]> git.proxmox.com Git - mirror_frr.git/blob - isisd/isis_spf.c
projects / mirror_frr.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Merge pull request #11864 from manojvn/clis
[mirror_frr.git] / isisd / isis_spf.c
1 /*
2 * IS-IS Rout(e)ing protocol - isis_spf.c
3 * The SPT algorithm
4 *
5 * Copyright (C) 2001,2002 Sampo Saaristo
6 * Tampere University of Technology
7 * Institute of Communications Engineering
8 * Copyright (C) 2017 Christian Franke <chris@opensourcerouting.org>
9 *
10 * This program is free software; you can redistribute it and/or modify it
11 * under the terms of the GNU General Public Licenseas published by the Free
12 * Software Foundation; either version 2 of the License, or (at your option)
13 * any later version.
14 *
15 * This program is distributed in the hope that it will be useful,but WITHOUT
16 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
17 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for
18 * more details.
19 *
20 * You should have received a copy of the GNU General Public License along
21 * with this program; see the file COPYING; if not, write to the Free Software
22 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
23 */
24
25 #include <zebra.h>
26
27 #include "thread.h"
28 #include "linklist.h"
29 #include "vty.h"
30 #include "log.h"
31 #include "command.h"
32 #include "termtable.h"
33 #include "memory.h"
34 #include "prefix.h"
35 #include "filter.h"
36 #include "if.h"
37 #include "hash.h"
38 #include "table.h"
39 #include "spf_backoff.h"
40 #include "srcdest_table.h"
41 #include "vrf.h"
42
43 #include "isis_errors.h"
44 #include "isis_constants.h"
45 #include "isis_common.h"
46 #include "isis_flags.h"
47 #include "isisd.h"
48 #include "isis_misc.h"
49 #include "isis_adjacency.h"
50 #include "isis_circuit.h"
51 #include "isis_pdu.h"
52 #include "isis_lsp.h"
53 #include "isis_dynhn.h"
54 #include "isis_spf.h"
55 #include "isis_route.h"
56 #include "isis_csm.h"
57 #include "isis_mt.h"
58 #include "isis_tlvs.h"
59 #include "isis_zebra.h"
60 #include "fabricd.h"
61 #include "isis_spf_private.h"
62
63 DEFINE_MTYPE_STATIC(ISISD, ISIS_SPFTREE, "ISIS SPFtree");
64 DEFINE_MTYPE_STATIC(ISISD, ISIS_SPF_RUN, "ISIS SPF Run Info");
65 DEFINE_MTYPE_STATIC(ISISD, ISIS_SPF_ADJ, "ISIS SPF Adjacency");
66 DEFINE_MTYPE_STATIC(ISISD, ISIS_VERTEX, "ISIS vertex");
67 DEFINE_MTYPE_STATIC(ISISD, ISIS_VERTEX_ADJ, "ISIS SPF Vertex Adjacency");
68
69 static void spf_adj_list_parse_lsp(struct isis_spftree *spftree,
70 struct list *adj_list, struct isis_lsp *lsp,
71 const uint8_t *pseudo_nodeid,
72 uint32_t pseudo_metric);
73
74 /*
75 * supports the given af ?
76 */
77 static bool speaks(uint8_t *protocols, uint8_t count, int family)
78 {
79 for (uint8_t i = 0; i < count; i++) {
80 if (family == AF_INET && protocols[i] == NLPID_IP)
81 return true;
82 if (family == AF_INET6 && protocols[i] == NLPID_IPV6)
83 return true;
84 }
85 return false;
86 }
87
88 struct isis_spf_run {
89 struct isis_area *area;
90 int level;
91 };
92
93 /* 7.2.7 */
94 static void remove_excess_adjs(struct list *adjs)
95 {
96 struct listnode *node, *excess = NULL;
97 struct isis_vertex_adj *vadj, *candidate = NULL;
98 int comp;
99
100 for (ALL_LIST_ELEMENTS_RO(adjs, node, vadj)) {
101 struct isis_adjacency *adj, *candidate_adj;
102
103 adj = vadj->sadj->adj;
104 assert(adj);
105
106 if (excess == NULL)
107 excess = node;
108 candidate = listgetdata(excess);
109 candidate_adj = candidate->sadj->adj;
110
111 if (candidate_adj->sys_type < adj->sys_type) {
112 excess = node;
113 continue;
114 }
115 if (candidate_adj->sys_type > adj->sys_type)
116 continue;
117
118 comp = memcmp(candidate_adj->sysid, adj->sysid,
119 ISIS_SYS_ID_LEN);
120 if (comp > 0) {
121 excess = node;
122 continue;
123 }
124 if (comp < 0)
125 continue;
126
127 if (candidate_adj->circuit->idx > adj->circuit->idx) {
128 excess = node;
129 continue;
130 }
131
132 if (candidate_adj->circuit->idx < adj->circuit->idx)
133 continue;
134
135 comp = memcmp(candidate_adj->snpa, adj->snpa, ETH_ALEN);
136 if (comp > 0) {
137 excess = node;
138 continue;
139 }
140 }
141
142 list_delete_node(adjs, excess);
143
144 return;
145 }
146
147 const char *vtype2string(enum vertextype vtype)
148 {
149 switch (vtype) {
150 case VTYPE_PSEUDO_IS:
151 return "pseudo_IS";
152 case VTYPE_PSEUDO_TE_IS:
153 return "pseudo_TE-IS";
154 case VTYPE_NONPSEUDO_IS:
155 return "IS";
156 case VTYPE_NONPSEUDO_TE_IS:
157 return "TE-IS";
158 case VTYPE_ES:
159 return "ES";
160 case VTYPE_IPREACH_INTERNAL:
161 return "IP internal";
162 case VTYPE_IPREACH_EXTERNAL:
163 return "IP external";
164 case VTYPE_IPREACH_TE:
165 return "IP TE";
166 case VTYPE_IP6REACH_INTERNAL:
167 return "IP6 internal";
168 case VTYPE_IP6REACH_EXTERNAL:
169 return "IP6 external";
170 default:
171 return "UNKNOWN";
172 }
173 return NULL; /* Not reached */
174 }
175
176 const char *vid2string(const struct isis_vertex *vertex, char *buff, int size)
177 {
178 if (VTYPE_IS(vertex->type) || VTYPE_ES(vertex->type)) {
179 const char *hostname = print_sys_hostname(vertex->N.id);
180 strlcpy(buff, hostname, size);
181 return buff;
182 }
183
184 if (VTYPE_IP(vertex->type)) {
185 srcdest2str(&vertex->N.ip.p.dest, &vertex->N.ip.p.src, buff,
186 size);
187 return buff;
188 }
189
190 return "UNKNOWN";
191 }
192
193 static bool prefix_sid_cmp(const void *value1, const void *value2)
194 {
195 const struct isis_vertex *c1 = value1;
196 const struct isis_vertex *c2 = value2;
197
198 if (CHECK_FLAG(c1->N.ip.sr.sid.flags,
199 ISIS_PREFIX_SID_VALUE | ISIS_PREFIX_SID_LOCAL)
200 != CHECK_FLAG(c2->N.ip.sr.sid.flags,
201 ISIS_PREFIX_SID_VALUE | ISIS_PREFIX_SID_LOCAL))
202 return false;
203
204 return c1->N.ip.sr.sid.value == c2->N.ip.sr.sid.value;
205 }
206
207 static unsigned int prefix_sid_key_make(const void *value)
208 {
209 const struct isis_vertex *vertex = value;
210
211 return jhash_1word(vertex->N.ip.sr.sid.value, 0);
212 }
213
214 struct isis_vertex *isis_spf_prefix_sid_lookup(struct isis_spftree *spftree,
215 struct isis_prefix_sid *psid)
216 {
217 struct isis_vertex lookup = {};
218
219 lookup.N.ip.sr.sid = *psid;
220 return hash_lookup(spftree->prefix_sids, &lookup);
221 }
222
223 void isis_vertex_adj_free(void *arg)
224 {
225 struct isis_vertex_adj *vadj = arg;
226
227 XFREE(MTYPE_ISIS_VERTEX_ADJ, vadj);
228 }
229
230 static struct isis_vertex *isis_vertex_new(struct isis_spftree *spftree,
231 void *id,
232 enum vertextype vtype)
233 {
234 struct isis_vertex *vertex;
235
236 vertex = XCALLOC(MTYPE_ISIS_VERTEX, sizeof(struct isis_vertex));
237
238 isis_vertex_id_init(vertex, id, vtype);
239
240 vertex->Adj_N = list_new();
241 vertex->Adj_N->del = isis_vertex_adj_free;
242 vertex->parents = list_new();
243
244 if (CHECK_FLAG(spftree->flags, F_SPFTREE_HOPCOUNT_METRIC)) {
245 vertex->firsthops = hash_create(isis_vertex_queue_hash_key,
246 isis_vertex_queue_hash_cmp,
247 NULL);
248 }
249
250 return vertex;
251 }
252
253 void isis_vertex_del(struct isis_vertex *vertex)
254 {
255 list_delete(&vertex->Adj_N);
256 list_delete(&vertex->parents);
257 if (vertex->firsthops) {
258 hash_clean(vertex->firsthops, NULL);
259 hash_free(vertex->firsthops);
260 vertex->firsthops = NULL;
261 }
262
263 memset(vertex, 0, sizeof(struct isis_vertex));
264 XFREE(MTYPE_ISIS_VERTEX, vertex);
265 }
266
267 struct isis_vertex_adj *
268 isis_vertex_adj_add(struct isis_spftree *spftree, struct isis_vertex *vertex,
269 struct list *vadj_list, struct isis_spf_adj *sadj,
270 struct isis_prefix_sid *psid, bool last_hop)
271 {
272 struct isis_vertex_adj *vadj;
273
274 vadj = XCALLOC(MTYPE_ISIS_VERTEX_ADJ, sizeof(*vadj));
275 vadj->sadj = sadj;
276 if (spftree->area->srdb.enabled && psid) {
277 if (vertex->N.ip.sr.present
278 && vertex->N.ip.sr.sid.value != psid->value)
279 zlog_warn(
280 "ISIS-SPF: ignoring different Prefix-SID for route %pFX",
281 &vertex->N.ip.p.dest);
282 else {
283 vadj->sr.sid = *psid;
284 vadj->sr.label = sr_prefix_out_label(
285 spftree->lspdb, vertex->N.ip.p.dest.family,
286 psid, sadj->id, last_hop);
287 if (vadj->sr.label != MPLS_INVALID_LABEL)
288 vadj->sr.present = true;
289 }
290 }
291 listnode_add(vadj_list, vadj);
292
293 return vadj;
294 }
295
296 static void isis_vertex_adj_del(struct isis_vertex *vertex,
297 struct isis_adjacency *adj)
298 {
299 struct isis_vertex_adj *vadj;
300 struct listnode *node, *nextnode;
301
302 if (!vertex)
303 return;
304
305 for (ALL_LIST_ELEMENTS(vertex->Adj_N, node, nextnode, vadj)) {
306 if (vadj->sadj->adj == adj) {
307 listnode_delete(vertex->Adj_N, vadj);
308 isis_vertex_adj_free(vadj);
309 }
310 }
311 return;
312 }
313
314 bool isis_vertex_adj_exists(const struct isis_spftree *spftree,
315 const struct isis_vertex *vertex,
316 const struct isis_spf_adj *sadj)
317 {
318 struct isis_vertex_adj *tmp;
319 struct listnode *node;
320
321 for (ALL_LIST_ELEMENTS_RO(vertex->Adj_N, node, tmp)) {
322 if (CHECK_FLAG(spftree->flags, F_SPFTREE_NO_ADJACENCIES)) {
323 if (memcmp(sadj->id, tmp->sadj->id, sizeof(sadj->id))
324 == 0)
325 return true;
326 } else {
327 if (sadj->adj == tmp->sadj->adj)
328 return true;
329 }
330 }
331
332 return false;
333 }
334
335 static void isis_spf_adj_free(void *arg)
336 {
337 struct isis_spf_adj *sadj = arg;
338
339 XFREE(MTYPE_ISIS_SPF_ADJ, sadj);
340 }
341
342 struct isis_spftree *isis_spftree_new(struct isis_area *area,
343 struct lspdb_head *lspdb,
344 const uint8_t *sysid, int level,
345 enum spf_tree_id tree_id,
346 enum spf_type type, uint8_t flags)
347 {
348 struct isis_spftree *tree;
349
350 tree = XCALLOC(MTYPE_ISIS_SPFTREE, sizeof(struct isis_spftree));
351
352 isis_vertex_queue_init(&tree->tents, "IS-IS SPF tents", true);
353 isis_vertex_queue_init(&tree->paths, "IS-IS SPF paths", false);
354 tree->route_table = srcdest_table_init();
355 tree->route_table->cleanup = isis_route_node_cleanup;
356 tree->route_table_backup = srcdest_table_init();
357 tree->route_table_backup->cleanup = isis_route_node_cleanup;
358 tree->area = area;
359 tree->lspdb = lspdb;
360 tree->prefix_sids = hash_create(prefix_sid_key_make, prefix_sid_cmp,
361 "SR Prefix-SID Entries");
362 tree->sadj_list = list_new();
363 tree->sadj_list->del = isis_spf_adj_free;
364 tree->last_run_timestamp = 0;
365 tree->last_run_monotime = 0;
366 tree->last_run_duration = 0;
367 tree->runcount = 0;
368 tree->type = type;
369 memcpy(tree->sysid, sysid, ISIS_SYS_ID_LEN);
370 tree->level = level;
371 tree->tree_id = tree_id;
372 tree->family = (tree->tree_id == SPFTREE_IPV4) ? AF_INET : AF_INET6;
373 tree->flags = flags;
374 isis_rlfa_list_init(tree);
375 tree->lfa.remote.pc_spftrees = list_new();
376 tree->lfa.remote.pc_spftrees->del = (void (*)(void *))isis_spftree_del;
377 if (tree->type == SPF_TYPE_RLFA || tree->type == SPF_TYPE_TI_LFA) {
378 isis_spf_node_list_init(&tree->lfa.p_space);
379 isis_spf_node_list_init(&tree->lfa.q_space);
380 }
381
382 return tree;
383 }
384
385 void isis_spftree_del(struct isis_spftree *spftree)
386 {
387 hash_clean(spftree->prefix_sids, NULL);
388 hash_free(spftree->prefix_sids);
389 isis_zebra_rlfa_unregister_all(spftree);
390 isis_rlfa_list_clear(spftree);
391 list_delete(&spftree->lfa.remote.pc_spftrees);
392 if (spftree->type == SPF_TYPE_RLFA
393 || spftree->type == SPF_TYPE_TI_LFA) {
394 isis_spf_node_list_clear(&spftree->lfa.q_space);
395 isis_spf_node_list_clear(&spftree->lfa.p_space);
396 }
397 isis_spf_node_list_clear(&spftree->adj_nodes);
398 list_delete(&spftree->sadj_list);
399 isis_vertex_queue_free(&spftree->tents);
400 isis_vertex_queue_free(&spftree->paths);
401 route_table_finish(spftree->route_table);
402 route_table_finish(spftree->route_table_backup);
403 spftree->route_table = NULL;
404
405 XFREE(MTYPE_ISIS_SPFTREE, spftree);
406 return;
407 }
408
409 static void isis_spftree_adj_del(struct isis_spftree *spftree,
410 struct isis_adjacency *adj)
411 {
412 struct listnode *node;
413 struct isis_vertex *v;
414 if (!adj)
415 return;
416 assert(!isis_vertex_queue_count(&spftree->tents));
417 for (ALL_QUEUE_ELEMENTS_RO(&spftree->paths, node, v))
418 isis_vertex_adj_del(v, adj);
419 return;
420 }
421
422 void spftree_area_init(struct isis_area *area)
423 {
424 for (int tree = SPFTREE_IPV4; tree < SPFTREE_COUNT; tree++) {
425 for (int level = ISIS_LEVEL1; level <= ISIS_LEVEL2; level++) {
426 if (!(area->is_type & level))
427 continue;
428 if (area->spftree[tree][level - 1])
429 continue;
430
431 area->spftree[tree][level - 1] =
432 isis_spftree_new(area, &area->lspdb[level - 1],
433 area->isis->sysid, level, tree,
434 SPF_TYPE_FORWARD, 0);
435 }
436 }
437 }
438
439 void spftree_area_del(struct isis_area *area)
440 {
441 for (int tree = SPFTREE_IPV4; tree < SPFTREE_COUNT; tree++) {
442 for (int level = ISIS_LEVEL1; level <= ISIS_LEVEL2; level++) {
443 if (!(area->is_type & level))
444 continue;
445 if (!area->spftree[tree][level - 1])
446 continue;
447
448 isis_spftree_del(area->spftree[tree][level - 1]);
449 }
450 }
451 }
452
453 static int spf_adj_state_change(struct isis_adjacency *adj)
454 {
455 struct isis_area *area = adj->circuit->area;
456
457 if (adj->adj_state == ISIS_ADJ_UP)
458 return 0;
459
460 /* Remove adjacency from all SPF trees. */
461 for (int tree = SPFTREE_IPV4; tree < SPFTREE_COUNT; tree++) {
462 for (int level = ISIS_LEVEL1; level <= ISIS_LEVEL2; level++) {
463 if (!(area->is_type & level))
464 continue;
465 if (!area->spftree[tree][level - 1])
466 continue;
467 isis_spftree_adj_del(area->spftree[tree][level - 1],
468 adj);
469 }
470 }
471
472 if (fabricd_spftree(area) != NULL)
473 isis_spftree_adj_del(fabricd_spftree(area), adj);
474
475 return 0;
476 }
477
478 /*
479 * Find the system LSP: returns the LSP in our LSP database
480 * associated with the given system ID.
481 */
482 struct isis_lsp *isis_root_system_lsp(struct lspdb_head *lspdb,
483 const uint8_t *sysid)
484 {
485 struct isis_lsp *lsp;
486 uint8_t lspid[ISIS_SYS_ID_LEN + 2];
487
488 memcpy(lspid, sysid, ISIS_SYS_ID_LEN);
489 LSP_PSEUDO_ID(lspid) = 0;
490 LSP_FRAGMENT(lspid) = 0;
491 lsp = lsp_search(lspdb, lspid);
492 if (lsp && lsp->hdr.rem_lifetime != 0)
493 return lsp;
494 return NULL;
495 }
496
497 /*
498 * Add this IS to the root of SPT
499 */
500 static struct isis_vertex *isis_spf_add_root(struct isis_spftree *spftree)
501 {
502 struct isis_vertex *vertex;
503 #ifdef EXTREME_DEBUG
504 char buff[VID2STR_BUFFER];
505 #endif /* EXTREME_DEBUG */
506
507 vertex = isis_vertex_new(spftree, spftree->sysid,
508 spftree->area->oldmetric
509 ? VTYPE_NONPSEUDO_IS
510 : VTYPE_NONPSEUDO_TE_IS);
511 isis_vertex_queue_append(&spftree->paths, vertex);
512
513 #ifdef EXTREME_DEBUG
514 if (IS_DEBUG_SPF_EVENTS)
515 zlog_debug(
516 "ISIS-SPF: added this IS %s %s depth %d dist %d to PATHS",
517 vtype2string(vertex->type),
518 vid2string(vertex, buff, sizeof(buff)), vertex->depth,
519 vertex->d_N);
520 #endif /* EXTREME_DEBUG */
521
522 return vertex;
523 }
524
525 static void vertex_add_parent_firsthop(struct hash_bucket *bucket, void *arg)
526 {
527 struct isis_vertex *vertex = arg;
528 struct isis_vertex *hop = bucket->data;
529
530 (void)hash_get(vertex->firsthops, hop, hash_alloc_intern);
531 }
532
533 static void vertex_update_firsthops(struct isis_vertex *vertex,
534 struct isis_vertex *parent)
535 {
536 if (vertex->d_N <= 2)
537 (void)hash_get(vertex->firsthops, vertex, hash_alloc_intern);
538
539 if (vertex->d_N < 2 || !parent)
540 return;
541
542 hash_iterate(parent->firsthops, vertex_add_parent_firsthop, vertex);
543 }
544
545 /*
546 * Add a vertex to TENT sorted by cost and by vertextype on tie break situation
547 */
548 static struct isis_vertex *
549 isis_spf_add2tent(struct isis_spftree *spftree, enum vertextype vtype, void *id,
550 uint32_t cost, int depth, struct isis_spf_adj *sadj,
551 struct isis_prefix_sid *psid, struct isis_vertex *parent)
552 {
553 struct isis_vertex *vertex;
554 struct listnode *node;
555 bool last_hop;
556 char buff[VID2STR_BUFFER];
557
558 vertex = isis_find_vertex(&spftree->paths, id, vtype);
559 if (vertex != NULL) {
560 zlog_err(
561 "%s: vertex %s of type %s already in PATH; check for sysId collisions with established neighbors",
562 __func__, vid2string(vertex, buff, sizeof(buff)),
563 vtype2string(vertex->type));
564 return NULL;
565 }
566 vertex = isis_find_vertex(&spftree->tents, id, vtype);
567 if (vertex != NULL) {
568 zlog_err(
569 "%s: vertex %s of type %s already in TENT; check for sysId collisions with established neighbors",
570 __func__, vid2string(vertex, buff, sizeof(buff)),
571 vtype2string(vertex->type));
572 return NULL;
573 }
574
575 vertex = isis_vertex_new(spftree, id, vtype);
576 vertex->d_N = cost;
577 vertex->depth = depth;
578 if (VTYPE_IP(vtype) && spftree->area->srdb.enabled && psid) {
579 struct isis_area *area = spftree->area;
580 struct isis_vertex *vertex_psid;
581
582 /*
583 * Check if the Prefix-SID is already in use by another prefix.
584 */
585 vertex_psid = isis_spf_prefix_sid_lookup(spftree, psid);
586 if (vertex_psid
587 && !prefix_same(&vertex_psid->N.ip.p.dest,
588 &vertex->N.ip.p.dest)) {
589 flog_warn(
590 EC_ISIS_SID_COLLISION,
591 "ISIS-Sr (%s): collision detected, prefixes %pFX and %pFX share the same SID %s (%u)",
592 area->area_tag, &vertex->N.ip.p.dest,
593 &vertex_psid->N.ip.p.dest,
594 CHECK_FLAG(psid->flags, ISIS_PREFIX_SID_VALUE)
595 ? "label"
596 : "index",
597 psid->value);
598 psid = NULL;
599 } else {
600 bool local;
601
602 local = (vertex->depth == 1);
603 vertex->N.ip.sr.sid = *psid;
604 vertex->N.ip.sr.label =
605 sr_prefix_in_label(area, psid, local);
606 if (vertex->N.ip.sr.label != MPLS_INVALID_LABEL)
607 vertex->N.ip.sr.present = true;
608
609 (void)hash_get(spftree->prefix_sids, vertex,
610 hash_alloc_intern);
611 }
612 }
613
614 if (parent) {
615 listnode_add(vertex->parents, parent);
616 }
617
618 if (CHECK_FLAG(spftree->flags, F_SPFTREE_HOPCOUNT_METRIC))
619 vertex_update_firsthops(vertex, parent);
620
621 last_hop = (vertex->depth == 2);
622 if (parent && parent->Adj_N && listcount(parent->Adj_N) > 0) {
623 struct isis_vertex_adj *parent_vadj;
624
625 for (ALL_LIST_ELEMENTS_RO(parent->Adj_N, node, parent_vadj))
626 isis_vertex_adj_add(spftree, vertex, vertex->Adj_N,
627 parent_vadj->sadj, psid, last_hop);
628 } else if (sadj) {
629 isis_vertex_adj_add(spftree, vertex, vertex->Adj_N, sadj, psid,
630 last_hop);
631 }
632
633 #ifdef EXTREME_DEBUG
634 if (IS_DEBUG_SPF_EVENTS)
635 zlog_debug(
636 "ISIS-SPF: add to TENT %s %s %s depth %d dist %d adjcount %d",
637 print_sys_hostname(vertex->N.id),
638 vtype2string(vertex->type),
639 vid2string(vertex, buff, sizeof(buff)), vertex->depth,
640 vertex->d_N, listcount(vertex->Adj_N));
641 #endif /* EXTREME_DEBUG */
642
643 isis_vertex_queue_insert(&spftree->tents, vertex);
644 return vertex;
645 }
646
647 static void isis_spf_add_local(struct isis_spftree *spftree,
648 enum vertextype vtype, void *id,
649 struct isis_spf_adj *sadj, uint32_t cost,
650 struct isis_prefix_sid *psid,
651 struct isis_vertex *parent)
652 {
653 struct isis_vertex *vertex;
654
655 vertex = isis_find_vertex(&spftree->tents, id, vtype);
656
657 if (vertex) {
658 /* C.2.5 c) */
659 if (vertex->d_N == cost) {
660 if (sadj) {
661 bool last_hop = (vertex->depth == 2);
662
663 isis_vertex_adj_add(spftree, vertex,
664 vertex->Adj_N, sadj, psid,
665 last_hop);
666 }
667 /* d) */
668 if (!CHECK_FLAG(spftree->flags,
669 F_SPFTREE_NO_ADJACENCIES)
670 && listcount(vertex->Adj_N) > ISIS_MAX_PATH_SPLITS)
671 remove_excess_adjs(vertex->Adj_N);
672 if (parent && (listnode_lookup(vertex->parents, parent)
673 == NULL))
674 listnode_add(vertex->parents, parent);
675 return;
676 } else if (vertex->d_N < cost) {
677 /* e) do nothing */
678 return;
679 } else { /* vertex->d_N > cost */
680 /* f) */
681 isis_vertex_queue_delete(&spftree->tents, vertex);
682 isis_vertex_del(vertex);
683 }
684 }
685
686 isis_spf_add2tent(spftree, vtype, id, cost, 1, sadj, psid, parent);
687 return;
688 }
689
690 static void process_N(struct isis_spftree *spftree, enum vertextype vtype,
691 void *id, uint32_t dist, uint16_t depth,
692 struct isis_prefix_sid *psid, struct isis_vertex *parent)
693 {
694 struct isis_vertex *vertex;
695 #ifdef EXTREME_DEBUG
696 char buff[VID2STR_BUFFER];
697 #endif
698
699 assert(spftree && parent);
700
701 if (CHECK_FLAG(spftree->flags, F_SPFTREE_HOPCOUNT_METRIC)
702 && !VTYPE_IS(vtype))
703 return;
704
705 struct prefix_pair p;
706 if (vtype >= VTYPE_IPREACH_INTERNAL) {
707 memcpy(&p, id, sizeof(p));
708 apply_mask(&p.dest);
709 apply_mask(&p.src);
710 id = &p;
711 }
712
713 /* RFC3787 section 5.1 */
714 if (spftree->area->newmetric == 1) {
715 if (dist > MAX_WIDE_PATH_METRIC)
716 return;
717 }
718 /* C.2.6 b) */
719 else if (spftree->area->oldmetric == 1) {
720 if (dist > MAX_NARROW_PATH_METRIC)
721 return;
722 }
723
724 /* c) */
725 vertex = isis_find_vertex(&spftree->paths, id, vtype);
726 if (vertex) {
727 #ifdef EXTREME_DEBUG
728 if (IS_DEBUG_SPF_EVENTS)
729 zlog_debug(
730 "ISIS-SPF: process_N %s %s %s dist %d already found from PATH",
731 print_sys_hostname(vertex->N.id),
732 vtype2string(vtype),
733 vid2string(vertex, buff, sizeof(buff)), dist);
734 #endif /* EXTREME_DEBUG */
735 assert(dist >= vertex->d_N);
736 return;
737 }
738
739 vertex = isis_find_vertex(&spftree->tents, id, vtype);
740 /* d) */
741 if (vertex) {
742 /* 1) */
743 #ifdef EXTREME_DEBUG
744 if (IS_DEBUG_SPF_EVENTS)
745 zlog_debug(
746 "ISIS-SPF: process_N %s %s %s dist %d parent %s adjcount %d",
747 print_sys_hostname(vertex->N.id),
748 vtype2string(vtype),
749 vid2string(vertex, buff, sizeof(buff)), dist,
750 (parent ? print_sys_hostname(parent->N.id)
751 : "null"),
752 (parent ? listcount(parent->Adj_N) : 0));
753 #endif /* EXTREME_DEBUG */
754 if (vertex->d_N == dist) {
755 struct listnode *node;
756 struct isis_vertex_adj *parent_vadj;
757 for (ALL_LIST_ELEMENTS_RO(parent->Adj_N, node,
758 parent_vadj))
759 if (!isis_vertex_adj_exists(
760 spftree, vertex,
761 parent_vadj->sadj)) {
762 bool last_hop = (vertex->depth == 2);
763
764 isis_vertex_adj_add(spftree, vertex,
765 vertex->Adj_N,
766 parent_vadj->sadj,
767 psid, last_hop);
768 }
769 if (CHECK_FLAG(spftree->flags,
770 F_SPFTREE_HOPCOUNT_METRIC))
771 vertex_update_firsthops(vertex, parent);
772 /* 2) */
773 if (!CHECK_FLAG(spftree->flags,
774 F_SPFTREE_NO_ADJACENCIES)
775 && listcount(vertex->Adj_N) > ISIS_MAX_PATH_SPLITS)
776 remove_excess_adjs(vertex->Adj_N);
777 if (listnode_lookup(vertex->parents, parent) == NULL)
778 listnode_add(vertex->parents, parent);
779 return;
780 } else if (vertex->d_N < dist) {
781 return;
782 /* 4) */
783 } else {
784 isis_vertex_queue_delete(&spftree->tents, vertex);
785 isis_vertex_del(vertex);
786 }
787 }
788
789 #ifdef EXTREME_DEBUG
790 if (IS_DEBUG_SPF_EVENTS)
791 zlog_debug(
792 "ISIS-SPF: process_N add2tent %s %s dist %d parent %s",
793 print_sys_hostname(id), vtype2string(vtype), dist,
794 (parent ? print_sys_hostname(parent->N.id) : "null"));
795 #endif /* EXTREME_DEBUG */
796
797 isis_spf_add2tent(spftree, vtype, id, dist, depth, NULL, psid, parent);
798 return;
799 }
800
801 /*
802 * C.2.6 Step 1
803 */
804 static int isis_spf_process_lsp(struct isis_spftree *spftree,
805 struct isis_lsp *lsp, uint32_t cost,
806 uint16_t depth, uint8_t *root_sysid,
807 struct isis_vertex *parent)
808 {
809 bool pseudo_lsp = LSP_PSEUDO_ID(lsp->hdr.lsp_id);
810 struct listnode *fragnode = NULL;
811 uint32_t dist;
812 enum vertextype vtype;
813 static const uint8_t null_sysid[ISIS_SYS_ID_LEN];
814 struct isis_mt_router_info *mt_router_info = NULL;
815 struct prefix_pair ip_info;
816 bool has_valid_psid;
817
818 if (isis_lfa_excise_node_check(spftree, lsp->hdr.lsp_id)) {
819 if (IS_DEBUG_LFA)
820 zlog_debug("ISIS-LFA: excising node %s",
821 print_sys_hostname(lsp->hdr.lsp_id));
822 return ISIS_OK;
823 }
824
825 if (!lsp->tlvs)
826 return ISIS_OK;
827
828 if (spftree->mtid != ISIS_MT_IPV4_UNICAST)
829 mt_router_info = isis_tlvs_lookup_mt_router_info(lsp->tlvs,
830 spftree->mtid);
831
832 if (!pseudo_lsp && (spftree->mtid == ISIS_MT_IPV4_UNICAST
833 && !speaks(lsp->tlvs->protocols_supported.protocols,
834 lsp->tlvs->protocols_supported.count,
835 spftree->family))
836 && !mt_router_info)
837 return ISIS_OK;
838
839 /* RFC3787 section 4 SHOULD ignore overload bit in pseudo LSPs */
840 bool no_overload = (pseudo_lsp
841 || (spftree->mtid == ISIS_MT_IPV4_UNICAST
842 && !ISIS_MASK_LSP_OL_BIT(lsp->hdr.lsp_bits))
843 || (mt_router_info && !mt_router_info->overload));
844
845 lspfragloop:
846 if (lsp->hdr.seqno == 0) {
847 zlog_warn("%s: lsp with 0 seq_num - ignore", __func__);
848 return ISIS_WARNING;
849 }
850
851 #ifdef EXTREME_DEBUG
852 if (IS_DEBUG_SPF_EVENTS)
853 zlog_debug("ISIS-SPF: process_lsp %s",
854 print_sys_hostname(lsp->hdr.lsp_id));
855 #endif /* EXTREME_DEBUG */
856
857 if (no_overload) {
858 if ((pseudo_lsp || spftree->mtid == ISIS_MT_IPV4_UNICAST)
859 && spftree->area->oldmetric) {
860 struct isis_oldstyle_reach *r;
861 for (r = (struct isis_oldstyle_reach *)
862 lsp->tlvs->oldstyle_reach.head;
863 r; r = r->next) {
864 if (fabricd)
865 continue;
866
867 /* C.2.6 a) */
868 /* Two way connectivity */
869 if (!LSP_PSEUDO_ID(r->id)
870 && !memcmp(r->id, root_sysid,
871 ISIS_SYS_ID_LEN))
872 continue;
873 if (!pseudo_lsp
874 && !memcmp(r->id, null_sysid,
875 ISIS_SYS_ID_LEN))
876 continue;
877 dist = cost + r->metric;
878 process_N(spftree,
879 LSP_PSEUDO_ID(r->id)
880 ? VTYPE_PSEUDO_IS
881 : VTYPE_NONPSEUDO_IS,
882 (void *)r->id, dist, depth + 1, NULL,
883 parent);
884 }
885 }
886
887 if (spftree->area->newmetric) {
888 struct isis_item_list *te_neighs = NULL;
889 if (pseudo_lsp || spftree->mtid == ISIS_MT_IPV4_UNICAST)
890 te_neighs = &lsp->tlvs->extended_reach;
891 else
892 te_neighs = isis_lookup_mt_items(
893 &lsp->tlvs->mt_reach, spftree->mtid);
894
895 struct isis_extended_reach *er;
896 for (er = te_neighs ? (struct isis_extended_reach *)
897 te_neighs->head
898 : NULL;
899 er; er = er->next) {
900 /* C.2.6 a) */
901 /* Two way connectivity */
902 if (!LSP_PSEUDO_ID(er->id)
903 && !memcmp(er->id, root_sysid,
904 ISIS_SYS_ID_LEN))
905 continue;
906 if (!pseudo_lsp
907 && !memcmp(er->id, null_sysid,
908 ISIS_SYS_ID_LEN))
909 continue;
910 dist = cost
911 + (CHECK_FLAG(spftree->flags,
912 F_SPFTREE_HOPCOUNT_METRIC)
913 ? 1
914 : er->metric);
915 process_N(spftree,
916 LSP_PSEUDO_ID(er->id)
917 ? VTYPE_PSEUDO_TE_IS
918 : VTYPE_NONPSEUDO_TE_IS,
919 (void *)er->id, dist, depth + 1, NULL,
920 parent);
921 }
922 }
923 }
924
925 if (!fabricd && !pseudo_lsp && spftree->family == AF_INET
926 && spftree->mtid == ISIS_MT_IPV4_UNICAST
927 && spftree->area->oldmetric) {
928 struct isis_item_list *reachs[] = {
929 &lsp->tlvs->oldstyle_ip_reach,
930 &lsp->tlvs->oldstyle_ip_reach_ext};
931
932 for (unsigned int i = 0; i < array_size(reachs); i++) {
933 vtype = i ? VTYPE_IPREACH_EXTERNAL
934 : VTYPE_IPREACH_INTERNAL;
935
936 memset(&ip_info, 0, sizeof(ip_info));
937 ip_info.dest.family = AF_INET;
938
939 struct isis_oldstyle_ip_reach *r;
940 for (r = (struct isis_oldstyle_ip_reach *)reachs[i]
941 ->head;
942 r; r = r->next) {
943 dist = cost + r->metric;
944 ip_info.dest.u.prefix4 = r->prefix.prefix;
945 ip_info.dest.prefixlen = r->prefix.prefixlen;
946 process_N(spftree, vtype, &ip_info,
947 dist, depth + 1, NULL, parent);
948 }
949 }
950 }
951
952 /* we can skip all the rest if we're using metric style narrow */
953 if (!spftree->area->newmetric)
954 goto end;
955
956 if (!pseudo_lsp && spftree->family == AF_INET) {
957 struct isis_item_list *ipv4_reachs;
958 if (spftree->mtid == ISIS_MT_IPV4_UNICAST)
959 ipv4_reachs = &lsp->tlvs->extended_ip_reach;
960 else
961 ipv4_reachs = isis_lookup_mt_items(
962 &lsp->tlvs->mt_ip_reach, spftree->mtid);
963
964 memset(&ip_info, 0, sizeof(ip_info));
965 ip_info.dest.family = AF_INET;
966
967 struct isis_extended_ip_reach *r;
968 for (r = ipv4_reachs
969 ? (struct isis_extended_ip_reach *)
970 ipv4_reachs->head
971 : NULL;
972 r; r = r->next) {
973 dist = cost + r->metric;
974 ip_info.dest.u.prefix4 = r->prefix.prefix;
975 ip_info.dest.prefixlen = r->prefix.prefixlen;
976
977 /* Parse list of Prefix-SID subTLVs if SR is enabled */
978 has_valid_psid = false;
979 if (spftree->area->srdb.enabled && r->subtlvs) {
980 for (struct isis_item *i =
981 r->subtlvs->prefix_sids.head;
982 i; i = i->next) {
983 struct isis_prefix_sid *psid =
984 (struct isis_prefix_sid *)i;
985
986 if (psid->algorithm != SR_ALGORITHM_SPF)
987 continue;
988
989 has_valid_psid = true;
990 process_N(spftree, VTYPE_IPREACH_TE,
991 &ip_info, dist, depth + 1,
992 psid, parent);
993 /*
994 * Stop the Prefix-SID iteration since
995 * we only support the SPF algorithm for
996 * now.
997 */
998 break;
999 }
1000 }
1001 if (!has_valid_psid)
1002 process_N(spftree, VTYPE_IPREACH_TE, &ip_info,
1003 dist, depth + 1, NULL, parent);
1004 }
1005 }
1006
1007 if (!pseudo_lsp && spftree->family == AF_INET6) {
1008 struct isis_item_list *ipv6_reachs;
1009 if (spftree->mtid == ISIS_MT_IPV4_UNICAST)
1010 ipv6_reachs = &lsp->tlvs->ipv6_reach;
1011 else
1012 ipv6_reachs = isis_lookup_mt_items(
1013 &lsp->tlvs->mt_ipv6_reach, spftree->mtid);
1014
1015 struct isis_ipv6_reach *r;
1016 for (r = ipv6_reachs
1017 ? (struct isis_ipv6_reach *)ipv6_reachs->head
1018 : NULL;
1019 r; r = r->next) {
1020 dist = cost + r->metric;
1021 vtype = r->external ? VTYPE_IP6REACH_EXTERNAL
1022 : VTYPE_IP6REACH_INTERNAL;
1023 memset(&ip_info, 0, sizeof(ip_info));
1024 ip_info.dest.family = AF_INET6;
1025 ip_info.dest.u.prefix6 = r->prefix.prefix;
1026 ip_info.dest.prefixlen = r->prefix.prefixlen;
1027
1028 if (spftree->area->srdb.enabled && r->subtlvs &&
1029 r->subtlvs->source_prefix &&
1030 r->subtlvs->source_prefix->prefixlen) {
1031 if (spftree->tree_id != SPFTREE_DSTSRC) {
1032 char buff[VID2STR_BUFFER];
1033 zlog_warn("Ignoring dest-src route %s in non dest-src topology",
1034 srcdest2str(
1035 &ip_info.dest,
1036 r->subtlvs->source_prefix,
1037 buff, sizeof(buff)
1038 )
1039 );
1040 continue;
1041 }
1042 ip_info.src = *r->subtlvs->source_prefix;
1043 }
1044
1045 /* Parse list of Prefix-SID subTLVs */
1046 has_valid_psid = false;
1047 if (r->subtlvs) {
1048 for (struct isis_item *i =
1049 r->subtlvs->prefix_sids.head;
1050 i; i = i->next) {
1051 struct isis_prefix_sid *psid =
1052 (struct isis_prefix_sid *)i;
1053
1054 if (psid->algorithm != SR_ALGORITHM_SPF)
1055 continue;
1056
1057 has_valid_psid = true;
1058 process_N(spftree, vtype, &ip_info,
1059 dist, depth + 1, psid,
1060 parent);
1061 /*
1062 * Stop the Prefix-SID iteration since
1063 * we only support the SPF algorithm for
1064 * now.
1065 */
1066 break;
1067 }
1068 }
1069 if (!has_valid_psid)
1070 process_N(spftree, vtype, &ip_info, dist,
1071 depth + 1, NULL, parent);
1072 }
1073 }
1074
1075 end:
1076
1077 /* if attach bit set in LSP, attached-bit receive ignore is
1078 * not configured, we are a level-1 area and we have no other
1079 * level-2 | level1-2 areas then add a default route toward
1080 * this neighbor
1081 */
1082 if ((lsp->hdr.lsp_bits & LSPBIT_ATT) == LSPBIT_ATT
1083 && !spftree->area->attached_bit_rcv_ignore
1084 && (spftree->area->is_type & IS_LEVEL_1)
1085 && !isis_level2_adj_up(spftree->area)) {
1086 struct prefix_pair ip_info = { {0} };
1087 if (IS_DEBUG_RTE_EVENTS)
1088 zlog_debug("ISIS-Spf (%s): add default %s route",
1089 rawlspid_print(lsp->hdr.lsp_id),
1090 spftree->family == AF_INET ? "ipv4"
1091 : "ipv6");
1092
1093 if (spftree->family == AF_INET) {
1094 ip_info.dest.family = AF_INET;
1095 vtype = VTYPE_IPREACH_INTERNAL;
1096 } else {
1097 ip_info.dest.family = AF_INET6;
1098 vtype = VTYPE_IP6REACH_INTERNAL;
1099 }
1100 process_N(spftree, vtype, &ip_info, cost, depth + 1, NULL,
1101 parent);
1102 }
1103
1104 if (fragnode == NULL)
1105 fragnode = listhead(lsp->lspu.frags);
1106 else
1107 fragnode = listnextnode(fragnode);
1108
1109 if (fragnode) {
1110 lsp = listgetdata(fragnode);
1111 goto lspfragloop;
1112 }
1113
1114 return ISIS_OK;
1115 }
1116
1117 static struct isis_adjacency *adj_find(struct list *adj_list, const uint8_t *id,
1118 int level, uint16_t mtid, int family)
1119 {
1120 struct isis_adjacency *adj;
1121 struct listnode *node;
1122
1123 for (ALL_LIST_ELEMENTS_RO(adj_list, node, adj)) {
1124 if (!(adj->level & level))
1125 continue;
1126 if (memcmp(adj->sysid, id, ISIS_SYS_ID_LEN) != 0)
1127 continue;
1128 if (adj->adj_state != ISIS_ADJ_UP)
1129 continue;
1130 if (!adj_has_mt(adj, mtid))
1131 continue;
1132 if (mtid == ISIS_MT_IPV4_UNICAST
1133 && !speaks(adj->nlpids.nlpids, adj->nlpids.count, family))
1134 continue;
1135 return adj;
1136 }
1137
1138 return NULL;
1139 }
1140
1141 struct spf_preload_tent_ip_reach_args {
1142 struct isis_spftree *spftree;
1143 struct isis_vertex *parent;
1144 };
1145
1146 static int isis_spf_preload_tent_ip_reach_cb(const struct prefix *prefix,
1147 uint32_t metric, bool external,
1148 struct isis_subtlvs *subtlvs,
1149 void *arg)
1150 {
1151 struct spf_preload_tent_ip_reach_args *args = arg;
1152 struct isis_spftree *spftree = args->spftree;
1153 struct isis_vertex *parent = args->parent;
1154 struct prefix_pair ip_info;
1155 enum vertextype vtype;
1156 bool has_valid_psid = false;
1157
1158 if (external)
1159 return LSP_ITER_CONTINUE;
1160
1161 assert(spftree->family == prefix->family);
1162 memset(&ip_info, 0, sizeof(ip_info));
1163 prefix_copy(&ip_info.dest, prefix);
1164 apply_mask(&ip_info.dest);
1165
1166 if (prefix->family == AF_INET)
1167 vtype = VTYPE_IPREACH_INTERNAL;
1168 else
1169 vtype = VTYPE_IP6REACH_INTERNAL;
1170
1171 /* Parse list of Prefix-SID subTLVs if SR is enabled */
1172 if (spftree->area->srdb.enabled && subtlvs) {
1173 for (struct isis_item *i = subtlvs->prefix_sids.head; i;
1174 i = i->next) {
1175 struct isis_prefix_sid *psid =
1176 (struct isis_prefix_sid *)i;
1177
1178 if (psid->algorithm != SR_ALGORITHM_SPF)
1179 continue;
1180
1181 has_valid_psid = true;
1182 isis_spf_add_local(spftree, vtype, &ip_info, NULL, 0,
1183 psid, parent);
1184
1185 /*
1186 * Stop the Prefix-SID iteration since we only support
1187 * the SPF algorithm for now.
1188 */
1189 break;
1190 }
1191 }
1192 if (!has_valid_psid)
1193 isis_spf_add_local(spftree, vtype, &ip_info, NULL, 0, NULL,
1194 parent);
1195
1196 return LSP_ITER_CONTINUE;
1197 }
1198
1199 static void isis_spf_preload_tent(struct isis_spftree *spftree,
1200 uint8_t *root_sysid,
1201 struct isis_lsp *root_lsp,
1202 struct isis_vertex *parent)
1203 {
1204 struct spf_preload_tent_ip_reach_args ip_reach_args;
1205 struct isis_spf_adj *sadj;
1206 struct listnode *node;
1207
1208 if (!CHECK_FLAG(spftree->flags, F_SPFTREE_HOPCOUNT_METRIC)) {
1209 ip_reach_args.spftree = spftree;
1210 ip_reach_args.parent = parent;
1211 isis_lsp_iterate_ip_reach(
1212 root_lsp, spftree->family, spftree->mtid,
1213 isis_spf_preload_tent_ip_reach_cb, &ip_reach_args);
1214 }
1215
1216 /* Iterate over adjacencies. */
1217 for (ALL_LIST_ELEMENTS_RO(spftree->sadj_list, node, sadj)) {
1218 const uint8_t *adj_id;
1219 uint32_t metric;
1220
1221 if (CHECK_FLAG(sadj->flags, F_ISIS_SPF_ADJ_BROADCAST))
1222 adj_id = sadj->lan.desig_is_id;
1223 else
1224 adj_id = sadj->id;
1225
1226 if (isis_lfa_excise_adj_check(spftree, adj_id)) {
1227 if (IS_DEBUG_LFA)
1228 zlog_debug("ISIS-SPF: excising adjacency %s",
1229 isis_format_id(sadj->id,
1230 ISIS_SYS_ID_LEN + 1));
1231 continue;
1232 }
1233
1234 metric = CHECK_FLAG(spftree->flags, F_SPFTREE_HOPCOUNT_METRIC)
1235 ? 1
1236 : sadj->metric;
1237 if (!LSP_PSEUDO_ID(sadj->id)) {
1238 isis_spf_add_local(spftree,
1239 CHECK_FLAG(sadj->flags,
1240 F_ISIS_SPF_ADJ_OLDMETRIC)
1241 ? VTYPE_NONPSEUDO_IS
1242 : VTYPE_NONPSEUDO_TE_IS,
1243 sadj->id, sadj, metric, NULL,
1244 parent);
1245 } else if (sadj->lsp) {
1246 isis_spf_process_lsp(spftree, sadj->lsp, metric, 0,
1247 spftree->sysid, parent);
1248 }
1249 }
1250 }
1251
1252 struct spf_adj_find_reverse_metric_args {
1253 const uint8_t *id_self;
1254 uint32_t reverse_metric;
1255 };
1256
1257 static int spf_adj_find_reverse_metric_cb(const uint8_t *id, uint32_t metric,
1258 bool oldmetric,
1259 struct isis_ext_subtlvs *subtlvs,
1260 void *arg)
1261 {
1262 struct spf_adj_find_reverse_metric_args *args = arg;
1263
1264 if (memcmp(id, args->id_self, ISIS_SYS_ID_LEN))
1265 return LSP_ITER_CONTINUE;
1266
1267 args->reverse_metric = metric;
1268
1269 return LSP_ITER_STOP;
1270 }
1271
1272 /*
1273 * Change all SPF adjacencies to use the link cost in the direction from the
1274 * next hop back towards root in place of the link cost in the direction away
1275 * from root towards the next hop.
1276 */
1277 static void spf_adj_get_reverse_metrics(struct isis_spftree *spftree)
1278 {
1279 struct isis_spf_adj *sadj;
1280 struct listnode *node, *nnode;
1281
1282 for (ALL_LIST_ELEMENTS(spftree->sadj_list, node, nnode, sadj)) {
1283 uint8_t lspid[ISIS_SYS_ID_LEN + 2];
1284 struct isis_lsp *lsp_adj;
1285 const uint8_t *id_self;
1286 struct spf_adj_find_reverse_metric_args args;
1287
1288 /* Skip pseudonodes. */
1289 if (LSP_PSEUDO_ID(sadj->id))
1290 continue;
1291
1292 /* Find LSP of the corresponding adjacency. */
1293 memcpy(lspid, sadj->id, ISIS_SYS_ID_LEN);
1294 LSP_PSEUDO_ID(lspid) = 0;
1295 LSP_FRAGMENT(lspid) = 0;
1296 lsp_adj = lsp_search(spftree->lspdb, lspid);
1297 if (lsp_adj == NULL || lsp_adj->hdr.rem_lifetime == 0) {
1298 /* Delete one-way adjacency. */
1299 listnode_delete(spftree->sadj_list, sadj);
1300 continue;
1301 }
1302
1303 /* Find root node in the LSP of the adjacent router. */
1304 if (CHECK_FLAG(sadj->flags, F_ISIS_SPF_ADJ_BROADCAST))
1305 id_self = sadj->lan.desig_is_id;
1306 else
1307 id_self = spftree->sysid;
1308 args.id_self = id_self;
1309 args.reverse_metric = UINT32_MAX;
1310 isis_lsp_iterate_is_reach(lsp_adj, spftree->mtid,
1311 spf_adj_find_reverse_metric_cb,
1312 &args);
1313 if (args.reverse_metric == UINT32_MAX) {
1314 /* Delete one-way adjacency. */
1315 listnode_delete(spftree->sadj_list, sadj);
1316 continue;
1317 }
1318 sadj->metric = args.reverse_metric;
1319 }
1320 }
1321
1322 static void spf_adj_list_parse_tlv(struct isis_spftree *spftree,
1323 struct list *adj_list, const uint8_t *id,
1324 const uint8_t *desig_is_id,
1325 uint32_t pseudo_metric, uint32_t metric,
1326 bool oldmetric,
1327 struct isis_ext_subtlvs *subtlvs)
1328 {
1329 struct isis_spf_adj *sadj;
1330 uint8_t lspid[ISIS_SYS_ID_LEN + 2];
1331 struct isis_lsp *lsp;
1332 uint8_t flags = 0;
1333
1334 /* Skip self in the pseudonode. */
1335 if (desig_is_id && !memcmp(id, spftree->sysid, ISIS_SYS_ID_LEN))
1336 return;
1337
1338 /* Find LSP from the adjacency. */
1339 memcpy(lspid, id, ISIS_SYS_ID_LEN + 1);
1340 LSP_FRAGMENT(lspid) = 0;
1341 lsp = lsp_search(spftree->lspdb, lspid);
1342 if (lsp == NULL || lsp->hdr.rem_lifetime == 0) {
1343 zlog_warn("ISIS-SPF: No LSP found from root to L%d %s",
1344 spftree->level, rawlspid_print(lspid));
1345 return;
1346 }
1347
1348 sadj = XCALLOC(MTYPE_ISIS_SPF_ADJ, sizeof(*sadj));
1349 memcpy(sadj->id, id, sizeof(sadj->id));
1350 if (desig_is_id) {
1351 memcpy(sadj->lan.desig_is_id, desig_is_id,
1352 sizeof(sadj->lan.desig_is_id));
1353 SET_FLAG(flags, F_ISIS_SPF_ADJ_BROADCAST);
1354 sadj->metric = pseudo_metric;
1355 } else
1356 sadj->metric = metric;
1357 if (oldmetric)
1358 SET_FLAG(flags, F_ISIS_SPF_ADJ_OLDMETRIC);
1359 sadj->lsp = lsp;
1360 sadj->subtlvs = subtlvs;
1361 sadj->flags = flags;
1362
1363 if ((oldmetric && metric == ISIS_NARROW_METRIC_INFINITY)
1364 || (!oldmetric && metric == ISIS_WIDE_METRIC_INFINITY))
1365 SET_FLAG(flags, F_ISIS_SPF_ADJ_METRIC_INFINITY);
1366
1367 /* Set real adjacency. */
1368 if (!CHECK_FLAG(spftree->flags, F_SPFTREE_NO_ADJACENCIES)
1369 && !LSP_PSEUDO_ID(id)) {
1370 struct isis_adjacency *adj;
1371
1372 adj = adj_find(adj_list, id, spftree->level, spftree->mtid,
1373 spftree->family);
1374 if (!adj) {
1375 XFREE(MTYPE_ISIS_SPF_ADJ, sadj);
1376 return;
1377 }
1378
1379 listnode_delete(adj_list, adj);
1380 sadj->adj = adj;
1381 }
1382
1383 /* Add adjacency to the list. */
1384 listnode_add(spftree->sadj_list, sadj);
1385
1386 if (!LSP_PSEUDO_ID(id)) {
1387 struct isis_spf_node *node;
1388
1389 node = isis_spf_node_find(&spftree->adj_nodes, id);
1390 if (!node)
1391 node = isis_spf_node_new(&spftree->adj_nodes, id);
1392 if (node->best_metric == 0 || sadj->metric < node->best_metric)
1393 node->best_metric = sadj->metric;
1394 listnode_add(node->adjacencies, sadj);
1395 }
1396
1397 /* Parse pseudonode LSP too. */
1398 if (LSP_PSEUDO_ID(id))
1399 spf_adj_list_parse_lsp(spftree, adj_list, lsp, id, metric);
1400 }
1401
1402 static void spf_adj_list_parse_lsp(struct isis_spftree *spftree,
1403 struct list *adj_list, struct isis_lsp *lsp,
1404 const uint8_t *pseudo_nodeid,
1405 uint32_t pseudo_metric)
1406 {
1407 bool pseudo_lsp = LSP_PSEUDO_ID(lsp->hdr.lsp_id);
1408 struct isis_lsp *frag;
1409 struct listnode *node;
1410 struct isis_item *head;
1411 struct isis_item_list *te_neighs;
1412
1413 if (lsp->hdr.seqno == 0 || lsp->hdr.rem_lifetime == 0)
1414 return;
1415
1416 /* Parse LSP. */
1417 if (lsp->tlvs) {
1418 if (pseudo_lsp || spftree->mtid == ISIS_MT_IPV4_UNICAST) {
1419 head = lsp->tlvs->oldstyle_reach.head;
1420 for (struct isis_oldstyle_reach *reach =
1421 (struct isis_oldstyle_reach *)head;
1422 reach; reach = reach->next) {
1423 spf_adj_list_parse_tlv(
1424 spftree, adj_list, reach->id,
1425 pseudo_nodeid, pseudo_metric,
1426 reach->metric, true, NULL);
1427 }
1428 }
1429
1430 if (pseudo_lsp || spftree->mtid == ISIS_MT_IPV4_UNICAST)
1431 te_neighs = &lsp->tlvs->extended_reach;
1432 else
1433 te_neighs = isis_get_mt_items(&lsp->tlvs->mt_reach,
1434 spftree->mtid);
1435 if (te_neighs) {
1436 head = te_neighs->head;
1437 for (struct isis_extended_reach *reach =
1438 (struct isis_extended_reach *)head;
1439 reach; reach = reach->next) {
1440 spf_adj_list_parse_tlv(
1441 spftree, adj_list, reach->id,
1442 pseudo_nodeid, pseudo_metric,
1443 reach->metric, false, reach->subtlvs);
1444 }
1445 }
1446 }
1447
1448 if (LSP_FRAGMENT(lsp->hdr.lsp_id))
1449 return;
1450
1451 /* Parse LSP fragments. */
1452 for (ALL_LIST_ELEMENTS_RO(lsp->lspu.frags, node, frag)) {
1453 if (!frag->tlvs)
1454 continue;
1455
1456 spf_adj_list_parse_lsp(spftree, adj_list, frag, pseudo_nodeid,
1457 pseudo_metric);
1458 }
1459 }
1460
1461 static void isis_spf_build_adj_list(struct isis_spftree *spftree,
1462 struct isis_lsp *lsp)
1463 {
1464 struct list *adj_list = NULL;
1465
1466 if (!CHECK_FLAG(spftree->flags, F_SPFTREE_NO_ADJACENCIES))
1467 adj_list = list_dup(spftree->area->adjacency_list);
1468
1469 spf_adj_list_parse_lsp(spftree, adj_list, lsp, NULL, 0);
1470
1471 if (!CHECK_FLAG(spftree->flags, F_SPFTREE_NO_ADJACENCIES))
1472 list_delete(&adj_list);
1473
1474 if (spftree->type == SPF_TYPE_REVERSE)
1475 spf_adj_get_reverse_metrics(spftree);
1476 }
1477
1478 /*
1479 * The parent(s) for vertex is set when added to TENT list
1480 * now we just put the child pointer(s) in place
1481 */
1482 static void add_to_paths(struct isis_spftree *spftree,
1483 struct isis_vertex *vertex)
1484 {
1485 #ifdef EXTREME_DEBUG
1486 char buff[VID2STR_BUFFER];
1487 #endif /* EXTREME_DEBUG */
1488
1489 if (isis_find_vertex(&spftree->paths, &vertex->N, vertex->type))
1490 return;
1491 isis_vertex_queue_append(&spftree->paths, vertex);
1492
1493 #ifdef EXTREME_DEBUG
1494 if (IS_DEBUG_SPF_EVENTS)
1495 zlog_debug("ISIS-SPF: added %s %s %s depth %d dist %d to PATHS",
1496 print_sys_hostname(vertex->N.id),
1497 vtype2string(vertex->type),
1498 vid2string(vertex, buff, sizeof(buff)),
1499 vertex->depth, vertex->d_N);
1500 #endif /* EXTREME_DEBUG */
1501 }
1502
1503 static void init_spt(struct isis_spftree *spftree, int mtid)
1504 {
1505 /* Clear data from previous run. */
1506 hash_clean(spftree->prefix_sids, NULL);
1507 isis_spf_node_list_clear(&spftree->adj_nodes);
1508 list_delete_all_node(spftree->sadj_list);
1509 isis_vertex_queue_clear(&spftree->tents);
1510 isis_vertex_queue_clear(&spftree->paths);
1511 isis_zebra_rlfa_unregister_all(spftree);
1512 isis_rlfa_list_clear(spftree);
1513 list_delete_all_node(spftree->lfa.remote.pc_spftrees);
1514 memset(&spftree->lfa.protection_counters, 0,
1515 sizeof(spftree->lfa.protection_counters));
1516
1517 spftree->mtid = mtid;
1518 }
1519
1520 static enum spf_prefix_priority
1521 spf_prefix_priority(struct isis_spftree *spftree, struct isis_vertex *vertex)
1522 {
1523 struct isis_area *area = spftree->area;
1524 struct prefix *prefix = &vertex->N.ip.p.dest;
1525
1526 for (int priority = SPF_PREFIX_PRIO_CRITICAL;
1527 priority <= SPF_PREFIX_PRIO_MEDIUM; priority++) {
1528 struct spf_prefix_priority_acl *ppa;
1529 enum filter_type ret = FILTER_PERMIT;
1530
1531 ppa = &area->spf_prefix_priorities[priority];
1532 switch (spftree->family) {
1533 case AF_INET:
1534 ret = access_list_apply(ppa->list_v4, prefix);
1535 break;
1536 case AF_INET6:
1537 ret = access_list_apply(ppa->list_v6, prefix);
1538 break;
1539 default:
1540 break;
1541 }
1542
1543 if (ret == FILTER_PERMIT)
1544 return priority;
1545 }
1546
1547 /* Assign medium priority to loopback prefixes by default. */
1548 if (is_host_route(prefix))
1549 return SPF_PREFIX_PRIO_MEDIUM;
1550
1551 return SPF_PREFIX_PRIO_LOW;
1552 }
1553
1554 static void spf_path_process(struct isis_spftree *spftree,
1555 struct isis_vertex *vertex)
1556 {
1557 struct isis_area *area = spftree->area;
1558 int level = spftree->level;
1559 char buff[VID2STR_BUFFER];
1560
1561 if (spftree->type == SPF_TYPE_TI_LFA && VTYPE_IS(vertex->type)
1562 && !CHECK_FLAG(spftree->flags, F_SPFTREE_NO_ADJACENCIES)) {
1563 if (listcount(vertex->Adj_N) > 0) {
1564 struct isis_adjacency *adj;
1565
1566 if (isis_tilfa_check(spftree, vertex) != 0)
1567 return;
1568
1569 adj = isis_adj_find(area, level, vertex->N.id);
1570 if (adj)
1571 sr_adj_sid_add_single(adj, spftree->family,
1572 true, vertex->Adj_N);
1573 } else if (IS_DEBUG_SPF_EVENTS)
1574 zlog_debug(
1575 "ISIS-SPF: no adjacencies, do not install backup Adj-SID for %s depth %d dist %d",
1576 vid2string(vertex, buff, sizeof(buff)),
1577 vertex->depth, vertex->d_N);
1578 }
1579
1580 if (VTYPE_IP(vertex->type)
1581 && !CHECK_FLAG(spftree->flags, F_SPFTREE_NO_ROUTES)) {
1582 enum spf_prefix_priority priority;
1583
1584 priority = spf_prefix_priority(spftree, vertex);
1585 vertex->N.ip.priority = priority;
1586 if (vertex->depth == 1 || listcount(vertex->Adj_N) > 0) {
1587 struct isis_spftree *pre_spftree;
1588 struct route_table *route_table;
1589 bool allow_ecmp;
1590
1591 switch (spftree->type) {
1592 case SPF_TYPE_RLFA:
1593 case SPF_TYPE_TI_LFA:
1594 if (priority
1595 > area->lfa_priority_limit[level - 1]) {
1596 if (IS_DEBUG_LFA)
1597 zlog_debug(
1598 "ISIS-LFA: skipping %s %s (low prefix priority)",
1599 vtype2string(
1600 vertex->type),
1601 vid2string(
1602 vertex, buff,
1603 sizeof(buff)));
1604 return;
1605 }
1606 break;
1607 default:
1608 break;
1609 }
1610
1611 switch (spftree->type) {
1612 case SPF_TYPE_RLFA:
1613 isis_rlfa_check(spftree, vertex);
1614 return;
1615 case SPF_TYPE_TI_LFA:
1616 if (isis_tilfa_check(spftree, vertex) != 0)
1617 return;
1618
1619 pre_spftree = spftree->lfa.old.spftree;
1620 route_table = pre_spftree->route_table_backup;
1621 allow_ecmp = area->lfa_load_sharing[level - 1];
1622 pre_spftree->lfa.protection_counters
1623 .tilfa[vertex->N.ip.priority] += 1;
1624 break;
1625 default:
1626 route_table = spftree->route_table;
1627 allow_ecmp = true;
1628
1629 /*
1630 * Update LFA protection counters (ignore local
1631 * routes).
1632 */
1633 if (vertex->depth > 1) {
1634 spftree->lfa.protection_counters
1635 .total[priority] += 1;
1636 if (listcount(vertex->Adj_N) > 1)
1637 spftree->lfa.protection_counters
1638 .ecmp[priority] += 1;
1639 }
1640 break;
1641 }
1642
1643 isis_route_create(
1644 &vertex->N.ip.p.dest, &vertex->N.ip.p.src,
1645 vertex->d_N, vertex->depth, &vertex->N.ip.sr,
1646 vertex->Adj_N, allow_ecmp, area, route_table);
1647 } else if (IS_DEBUG_SPF_EVENTS)
1648 zlog_debug(
1649 "ISIS-SPF: no adjacencies, do not install route for %s depth %d dist %d",
1650 vid2string(vertex, buff, sizeof(buff)),
1651 vertex->depth, vertex->d_N);
1652 }
1653 }
1654
1655 static void isis_spf_loop(struct isis_spftree *spftree,
1656 uint8_t *root_sysid)
1657 {
1658 struct isis_vertex *vertex;
1659 struct isis_lsp *lsp;
1660 struct listnode *node;
1661
1662 while (isis_vertex_queue_count(&spftree->tents)) {
1663 vertex = isis_vertex_queue_pop(&spftree->tents);
1664
1665 #ifdef EXTREME_DEBUG
1666 if (IS_DEBUG_SPF_EVENTS)
1667 zlog_debug(
1668 "ISIS-SPF: get TENT node %s %s depth %d dist %d to PATHS",
1669 print_sys_hostname(vertex->N.id),
1670 vtype2string(vertex->type), vertex->depth,
1671 vertex->d_N);
1672 #endif /* EXTREME_DEBUG */
1673
1674 add_to_paths(spftree, vertex);
1675 if (!VTYPE_IS(vertex->type))
1676 continue;
1677
1678 lsp = lsp_for_vertex(spftree, vertex);
1679 if (!lsp) {
1680 zlog_warn("ISIS-SPF: No LSP found for %s",
1681 isis_format_id(vertex->N.id,
1682 sizeof(vertex->N.id)));
1683 continue;
1684 }
1685
1686 isis_spf_process_lsp(spftree, lsp, vertex->d_N, vertex->depth,
1687 root_sysid, vertex);
1688 }
1689
1690 /* Generate routes once the SPT is formed. */
1691 for (ALL_QUEUE_ELEMENTS_RO(&spftree->paths, node, vertex)) {
1692 /* New-style TLVs take precedence over the old-style TLVs. */
1693 switch (vertex->type) {
1694 case VTYPE_IPREACH_INTERNAL:
1695 case VTYPE_IPREACH_EXTERNAL:
1696 if (isis_find_vertex(&spftree->paths, &vertex->N,
1697 VTYPE_IPREACH_TE))
1698 continue;
1699 break;
1700 default:
1701 break;
1702 }
1703
1704 spf_path_process(spftree, vertex);
1705 }
1706 }
1707
1708 struct isis_spftree *isis_run_hopcount_spf(struct isis_area *area,
1709 uint8_t *sysid,
1710 struct isis_spftree *spftree)
1711 {
1712 if (!spftree)
1713 spftree = isis_spftree_new(area, &area->lspdb[IS_LEVEL_2 - 1],
1714 sysid, ISIS_LEVEL2, SPFTREE_IPV4,
1715 SPF_TYPE_FORWARD,
1716 F_SPFTREE_HOPCOUNT_METRIC);
1717
1718 init_spt(spftree, ISIS_MT_IPV4_UNICAST);
1719 if (!memcmp(sysid, area->isis->sysid, ISIS_SYS_ID_LEN)) {
1720 struct isis_lsp *root_lsp;
1721 struct isis_vertex *root_vertex;
1722
1723 root_lsp = isis_root_system_lsp(spftree->lspdb, spftree->sysid);
1724 if (root_lsp) {
1725 /*
1726 * If we are running locally, initialize with
1727 * information from adjacencies
1728 */
1729 root_vertex = isis_spf_add_root(spftree);
1730
1731 isis_spf_preload_tent(spftree, sysid, root_lsp,
1732 root_vertex);
1733 }
1734 } else {
1735 isis_vertex_queue_insert(
1736 &spftree->tents,
1737 isis_vertex_new(spftree, sysid, VTYPE_NONPSEUDO_TE_IS));
1738 }
1739
1740 isis_spf_loop(spftree, sysid);
1741
1742 return spftree;
1743 }
1744
1745 void isis_run_spf(struct isis_spftree *spftree)
1746 {
1747 struct isis_lsp *root_lsp;
1748 struct isis_vertex *root_vertex;
1749 struct timeval time_start;
1750 struct timeval time_end;
1751 struct isis_mt_router_info *mt_router_info;
1752 uint16_t mtid = 0;
1753
1754 /* Get time that can't roll backwards. */
1755 monotime(&time_start);
1756
1757 root_lsp = isis_root_system_lsp(spftree->lspdb, spftree->sysid);
1758 if (root_lsp == NULL) {
1759 zlog_err("ISIS-SPF: could not find own l%d LSP!",
1760 spftree->level);
1761 return;
1762 }
1763
1764 /* Get Multi-Topology ID. */
1765 switch (spftree->tree_id) {
1766 case SPFTREE_IPV4:
1767 mtid = ISIS_MT_IPV4_UNICAST;
1768 break;
1769 case SPFTREE_IPV6:
1770 mt_router_info = isis_tlvs_lookup_mt_router_info(
1771 root_lsp->tlvs, ISIS_MT_IPV6_UNICAST);
1772 if (mt_router_info)
1773 mtid = ISIS_MT_IPV6_UNICAST;
1774 else
1775 mtid = ISIS_MT_IPV4_UNICAST;
1776 break;
1777 case SPFTREE_DSTSRC:
1778 mtid = ISIS_MT_IPV6_DSTSRC;
1779 break;
1780 case SPFTREE_COUNT:
1781 zlog_err(
1782 "%s should never be called with SPFTREE_COUNT as argument!",
1783 __func__);
1784 exit(1);
1785 }
1786
1787 /*
1788 * C.2.5 Step 0
1789 */
1790 init_spt(spftree, mtid);
1791 /* a) */
1792 root_vertex = isis_spf_add_root(spftree);
1793 /* b) */
1794 isis_spf_build_adj_list(spftree, root_lsp);
1795 isis_spf_preload_tent(spftree, spftree->sysid, root_lsp, root_vertex);
1796
1797 /*
1798 * C.2.7 Step 2
1799 */
1800 if (!isis_vertex_queue_count(&spftree->tents)
1801 && (IS_DEBUG_SPF_EVENTS)) {
1802 zlog_warn("ISIS-SPF: TENT is empty SPF-root:%s",
1803 print_sys_hostname(spftree->sysid));
1804 }
1805
1806 isis_spf_loop(spftree, spftree->sysid);
1807 spftree->runcount++;
1808 spftree->last_run_timestamp = time(NULL);
1809 spftree->last_run_monotime = monotime(&time_end);
1810 spftree->last_run_duration =
1811 ((time_end.tv_sec - time_start.tv_sec) * 1000000)
1812 + (time_end.tv_usec - time_start.tv_usec);
1813 }
1814
1815 static void isis_run_spf_with_protection(struct isis_area *area,
1816 struct isis_spftree *spftree)
1817 {
1818 /* Run forward SPF locally. */
1819 memcpy(spftree->sysid, area->isis->sysid, ISIS_SYS_ID_LEN);
1820 isis_run_spf(spftree);
1821
1822 /* Run LFA protection if configured. */
1823 if (area->lfa_protected_links[spftree->level - 1] > 0
1824 || area->tilfa_protected_links[spftree->level - 1] > 0)
1825 isis_spf_run_lfa(area, spftree);
1826 }
1827
1828 void isis_spf_verify_routes(struct isis_area *area, struct isis_spftree **trees)
1829 {
1830 if (area->is_type == IS_LEVEL_1) {
1831 isis_route_verify_table(area, trees[0]->route_table,
1832 trees[0]->route_table_backup);
1833 } else if (area->is_type == IS_LEVEL_2) {
1834 isis_route_verify_table(area, trees[1]->route_table,
1835 trees[1]->route_table_backup);
1836 } else {
1837 isis_route_verify_merge(area, trees[0]->route_table,
1838 trees[0]->route_table_backup,
1839 trees[1]->route_table,
1840 trees[1]->route_table_backup);
1841 }
1842 }
1843
1844 void isis_spf_invalidate_routes(struct isis_spftree *tree)
1845 {
1846 isis_route_invalidate_table(tree->area, tree->route_table);
1847
1848 /* Delete backup routes. */
1849 route_table_finish(tree->route_table_backup);
1850 tree->route_table_backup = srcdest_table_init();
1851 tree->route_table_backup->cleanup = isis_route_node_cleanup;
1852 }
1853
1854 static void isis_run_spf_cb(struct thread *thread)
1855 {
1856 struct isis_spf_run *run = THREAD_ARG(thread);
1857 struct isis_area *area = run->area;
1858 int level = run->level;
1859 int have_run = 0;
1860
1861 XFREE(MTYPE_ISIS_SPF_RUN, run);
1862
1863 if (!(area->is_type & level)) {
1864 if (IS_DEBUG_SPF_EVENTS)
1865 zlog_warn("ISIS-SPF (%s) area does not share level",
1866 area->area_tag);
1867 return;
1868 }
1869
1870 isis_area_delete_backup_adj_sids(area, level);
1871 isis_area_invalidate_routes(area, level);
1872
1873 if (IS_DEBUG_SPF_EVENTS)
1874 zlog_debug("ISIS-SPF (%s) L%d SPF needed, periodic SPF",
1875 area->area_tag, level);
1876
1877 if (area->ip_circuits) {
1878 isis_run_spf_with_protection(
1879 area, area->spftree[SPFTREE_IPV4][level - 1]);
1880 have_run = 1;
1881 }
1882 if (area->ipv6_circuits) {
1883 isis_run_spf_with_protection(
1884 area, area->spftree[SPFTREE_IPV6][level - 1]);
1885 have_run = 1;
1886 }
1887 if (area->ipv6_circuits && isis_area_ipv6_dstsrc_enabled(area)) {
1888 isis_run_spf_with_protection(
1889 area, area->spftree[SPFTREE_DSTSRC][level - 1]);
1890 have_run = 1;
1891 }
1892
1893 if (have_run)
1894 area->spf_run_count[level]++;
1895
1896 isis_area_verify_routes(area);
1897
1898 /* walk all circuits and reset any spf specific flags */
1899 struct listnode *node;
1900 struct isis_circuit *circuit;
1901 for (ALL_LIST_ELEMENTS_RO(area->circuit_list, node, circuit))
1902 UNSET_FLAG(circuit->flags, ISIS_CIRCUIT_FLAPPED_AFTER_SPF);
1903
1904 fabricd_run_spf(area);
1905 }
1906
1907 static struct isis_spf_run *isis_run_spf_arg(struct isis_area *area, int level)
1908 {
1909 struct isis_spf_run *run = XMALLOC(MTYPE_ISIS_SPF_RUN, sizeof(*run));
1910
1911 run->area = area;
1912 run->level = level;
1913
1914 return run;
1915 }
1916
1917 void isis_spf_timer_free(void *run)
1918 {
1919 XFREE(MTYPE_ISIS_SPF_RUN, run);
1920 }
1921
1922 int _isis_spf_schedule(struct isis_area *area, int level,
1923 const char *func, const char *file, int line)
1924 {
1925 struct isis_spftree *spftree = area->spftree[SPFTREE_IPV4][level - 1];
1926 time_t now = monotime(NULL);
1927 int diff = now - spftree->last_run_monotime;
1928
1929 if (CHECK_FLAG(im->options, F_ISIS_UNIT_TEST))
1930 return 0;
1931
1932 assert(diff >= 0);
1933 assert(area->is_type & level);
1934
1935 if (IS_DEBUG_SPF_EVENTS) {
1936 zlog_debug(
1937 "ISIS-SPF (%s) L%d SPF schedule called, lastrun %d sec ago Caller: %s %s:%d",
1938 area->area_tag, level, diff, func, file, line);
1939 }
1940
1941 THREAD_OFF(area->t_rlfa_rib_update);
1942 if (area->spf_delay_ietf[level - 1]) {
1943 /* Need to call schedule function also if spf delay is running
1944 * to
1945 * restart holdoff timer - compare
1946 * draft-ietf-rtgwg-backoff-algo-04 */
1947 long delay =
1948 spf_backoff_schedule(area->spf_delay_ietf[level - 1]);
1949 if (area->spf_timer[level - 1])
1950 return ISIS_OK;
1951
1952 thread_add_timer_msec(master, isis_run_spf_cb,
1953 isis_run_spf_arg(area, level), delay,
1954 &area->spf_timer[level - 1]);
1955 return ISIS_OK;
1956 }
1957
1958 if (area->spf_timer[level - 1])
1959 return ISIS_OK;
1960
1961 /* wait configured min_spf_interval before doing the SPF */
1962 long timer;
1963 if (diff >= area->min_spf_interval[level - 1]
1964 || area->bfd_force_spf_refresh) {
1965 /*
1966 * Last run is more than min interval ago or BFD signalled a
1967 * 'down' message, schedule immediate run
1968 */
1969 timer = 0;
1970
1971 if (area->bfd_force_spf_refresh) {
1972 zlog_debug(
1973 "ISIS-SPF (%s) L%d SPF scheduled immediately due to BFD 'down' message",
1974 area->area_tag, level);
1975 area->bfd_force_spf_refresh = false;
1976 }
1977 } else {
1978 timer = area->min_spf_interval[level - 1] - diff;
1979 }
1980
1981 thread_add_timer(master, isis_run_spf_cb, isis_run_spf_arg(area, level),
1982 timer, &area->spf_timer[level - 1]);
1983
1984 if (IS_DEBUG_SPF_EVENTS)
1985 zlog_debug("ISIS-SPF (%s) L%d SPF scheduled %ld sec from now",
1986 area->area_tag, level, timer);
1987
1988 return ISIS_OK;
1989 }
1990
1991 static void isis_print_paths(struct vty *vty, struct isis_vertex_queue *queue,
1992 uint8_t *root_sysid)
1993 {
1994 struct listnode *node;
1995 struct isis_vertex *vertex;
1996 char buff[VID2STR_BUFFER];
1997
1998 vty_out(vty,
1999 "Vertex Type Metric Next-Hop Interface Parent\n");
2000
2001 for (ALL_QUEUE_ELEMENTS_RO(queue, node, vertex)) {
2002 if (VTYPE_IS(vertex->type)
2003 && memcmp(vertex->N.id, root_sysid, ISIS_SYS_ID_LEN) == 0) {
2004 vty_out(vty, "%-20s %-12s %-6s",
2005 print_sys_hostname(root_sysid), "", "");
2006 vty_out(vty, "%-30s\n", "");
2007 continue;
2008 }
2009
2010 int rows = 0;
2011 struct listnode *anode = listhead(vertex->Adj_N);
2012 struct listnode *pnode = listhead(vertex->parents);
2013 struct isis_vertex_adj *vadj;
2014 struct isis_vertex *pvertex;
2015
2016 vty_out(vty, "%-20s %-12s %-6u ",
2017 vid2string(vertex, buff, sizeof(buff)),
2018 vtype2string(vertex->type), vertex->d_N);
2019 for (unsigned int i = 0;
2020 i < MAX(vertex->Adj_N ? listcount(vertex->Adj_N) : 0,
2021 vertex->parents ? listcount(vertex->parents) : 0);
2022 i++) {
2023 if (anode) {
2024 vadj = listgetdata(anode);
2025 anode = anode->next;
2026 } else {
2027 vadj = NULL;
2028 }
2029
2030 if (pnode) {
2031 pvertex = listgetdata(pnode);
2032 pnode = pnode->next;
2033 } else {
2034 pvertex = NULL;
2035 }
2036
2037 if (rows) {
2038 vty_out(vty, "\n");
2039 vty_out(vty, "%-20s %-12s %-6s ", "", "", "");
2040 }
2041
2042 if (vadj) {
2043 struct isis_spf_adj *sadj = vadj->sadj;
2044
2045 vty_out(vty, "%-20s %-9s ",
2046 print_sys_hostname(sadj->id),
2047 sadj->adj ? sadj->adj->circuit
2048 ->interface->name
2049 : "-");
2050 }
2051
2052 if (pvertex) {
2053 if (!vadj)
2054 vty_out(vty, "%-20s %-9s ", "", "");
2055
2056 vty_out(vty, "%s(%d)",
2057 vid2string(pvertex, buff, sizeof(buff)),
2058 pvertex->type);
2059 }
2060
2061 ++rows;
2062 }
2063 vty_out(vty, "\n");
2064 }
2065 }
2066
2067 void isis_print_spftree(struct vty *vty, struct isis_spftree *spftree)
2068 {
2069 const char *tree_id_text = NULL;
2070
2071 if (!spftree || !isis_vertex_queue_count(&spftree->paths))
2072 return;
2073
2074 switch (spftree->tree_id) {
2075 case SPFTREE_IPV4:
2076 tree_id_text = "that speak IP";
2077 break;
2078 case SPFTREE_IPV6:
2079 tree_id_text = "that speak IPv6";
2080 break;
2081 case SPFTREE_DSTSRC:
2082 tree_id_text = "that support IPv6 dst-src routing";
2083 break;
2084 case SPFTREE_COUNT:
2085 assert(!"isis_print_spftree shouldn't be called with SPFTREE_COUNT as type");
2086 return;
2087 }
2088
2089 vty_out(vty, "IS-IS paths to level-%d routers %s\n", spftree->level,
2090 tree_id_text);
2091 isis_print_paths(vty, &spftree->paths, spftree->sysid);
2092 vty_out(vty, "\n");
2093 }
2094
2095 static void show_isis_topology_common(struct vty *vty, int levels,
2096 struct isis *isis)
2097 {
2098 struct listnode *node;
2099 struct isis_area *area;
2100
2101 if (!isis->area_list || isis->area_list->count == 0)
2102 return;
2103
2104 for (ALL_LIST_ELEMENTS_RO(isis->area_list, node, area)) {
2105 vty_out(vty, "Area %s:\n",
2106 area->area_tag ? area->area_tag : "null");
2107
2108 for (int level = ISIS_LEVEL1; level <= ISIS_LEVELS; level++) {
2109 if ((level & levels) == 0)
2110 continue;
2111
2112 if (area->ip_circuits > 0) {
2113 isis_print_spftree(
2114 vty,
2115 area->spftree[SPFTREE_IPV4][level - 1]);
2116 }
2117 if (area->ipv6_circuits > 0) {
2118 isis_print_spftree(
2119 vty,
2120 area->spftree[SPFTREE_IPV6][level - 1]);
2121 }
2122 if (isis_area_ipv6_dstsrc_enabled(area)) {
2123 isis_print_spftree(vty,
2124 area->spftree[SPFTREE_DSTSRC]
2125 [level - 1]);
2126 }
2127 }
2128
2129 if (fabricd_spftree(area)) {
2130 vty_out(vty,
2131 "IS-IS paths to level-2 routers with hop-by-hop metric\n");
2132 isis_print_paths(vty, &fabricd_spftree(area)->paths, isis->sysid);
2133 vty_out(vty, "\n");
2134 }
2135
2136 vty_out(vty, "\n");
2137 }
2138 }
2139
2140 DEFUN(show_isis_topology, show_isis_topology_cmd,
2141 "show " PROTO_NAME
2142 " [vrf <NAME|all>] topology"
2143 #ifndef FABRICD
2144 " [<level-1|level-2>]"
2145 #endif
2146 ,
2147 SHOW_STR PROTO_HELP VRF_CMD_HELP_STR
2148 "All VRFs\n"
2149 "IS-IS paths to Intermediate Systems\n"
2150 #ifndef FABRICD
2151 "Paths to all level-1 routers in the area\n"
2152 "Paths to all level-2 routers in the domain\n"
2153 #endif
2154 )
2155 {
2156 int levels = ISIS_LEVELS;
2157 struct listnode *node;
2158 struct isis *isis = NULL;
2159 int idx = 0;
2160 const char *vrf_name = VRF_DEFAULT_NAME;
2161 bool all_vrf = false;
2162 int idx_vrf = 0;
2163
2164 if (argv_find(argv, argc, "topology", &idx)) {
2165 if (argc < idx + 2)
2166 levels = ISIS_LEVEL1 | ISIS_LEVEL2;
2167 else if (strmatch(argv[idx + 1]->arg, "level-1"))
2168 levels = ISIS_LEVEL1;
2169 else
2170 levels = ISIS_LEVEL2;
2171 }
2172
2173 if (!im) {
2174 vty_out(vty, "IS-IS Routing Process not enabled\n");
2175 return CMD_SUCCESS;
2176 }
2177 ISIS_FIND_VRF_ARGS(argv, argc, idx_vrf, vrf_name, all_vrf);
2178
2179 if (vrf_name) {
2180 if (all_vrf) {
2181 for (ALL_LIST_ELEMENTS_RO(im->isis, node, isis))
2182 show_isis_topology_common(vty, levels, isis);
2183 return CMD_SUCCESS;
2184 }
2185 isis = isis_lookup_by_vrfname(vrf_name);
2186 if (isis != NULL)
2187 show_isis_topology_common(vty, levels, isis);
2188 }
2189
2190 return CMD_SUCCESS;
2191 }
2192
2193 static void isis_print_route(struct ttable *tt, const struct prefix *prefix,
2194 struct isis_route_info *rinfo, bool prefix_sid,
2195 bool no_adjacencies)
2196 {
2197 struct isis_nexthop *nexthop;
2198 struct listnode *node;
2199 bool first = true;
2200 char buf_prefix[BUFSIZ];
2201
2202 (void)prefix2str(prefix, buf_prefix, sizeof(buf_prefix));
2203 for (ALL_LIST_ELEMENTS_RO(rinfo->nexthops, node, nexthop)) {
2204 struct interface *ifp;
2205 char buf_iface[BUFSIZ];
2206 char buf_nhop[BUFSIZ];
2207
2208 if (!no_adjacencies) {
2209 inet_ntop(nexthop->family, &nexthop->ip, buf_nhop,
2210 sizeof(buf_nhop));
2211 ifp = if_lookup_by_index(nexthop->ifindex, VRF_DEFAULT);
2212 if (ifp)
2213 strlcpy(buf_iface, ifp->name,
2214 sizeof(buf_iface));
2215 else
2216 snprintf(buf_iface, sizeof(buf_iface),
2217 "ifindex %u", nexthop->ifindex);
2218 } else {
2219 strlcpy(buf_nhop, print_sys_hostname(nexthop->sysid),
2220 sizeof(buf_nhop));
2221 strlcpy(buf_iface, "-", sizeof(buf_iface));
2222 }
2223
2224 if (prefix_sid) {
2225 char buf_sid[BUFSIZ] = {};
2226 char buf_lblop[BUFSIZ] = {};
2227
2228 if (nexthop->sr.present) {
2229 snprintf(buf_sid, sizeof(buf_sid), "%u",
2230 nexthop->sr.sid.value);
2231 sr_op2str(buf_lblop, sizeof(buf_lblop),
2232 rinfo->sr.label, nexthop->sr.label);
2233 } else {
2234 strlcpy(buf_sid, "-", sizeof(buf_sid));
2235 strlcpy(buf_lblop, "-", sizeof(buf_lblop));
2236 }
2237
2238 if (first) {
2239 ttable_add_row(tt, "%s|%u|%s|%s|%s|%s",
2240 buf_prefix, rinfo->cost,
2241 buf_iface, buf_nhop, buf_sid,
2242 buf_lblop);
2243 first = false;
2244 } else
2245 ttable_add_row(tt, "||%s|%s|%s|%s", buf_iface,
2246 buf_nhop, buf_sid, buf_lblop);
2247 } else {
2248 char buf_labels[BUFSIZ] = {};
2249
2250 if (nexthop->label_stack) {
2251 for (int i = 0;
2252 i < nexthop->label_stack->num_labels;
2253 i++) {
2254 char buf_label[BUFSIZ];
2255
2256 label2str(
2257 nexthop->label_stack->label[i],
2258 buf_label, sizeof(buf_label));
2259 if (i != 0)
2260 strlcat(buf_labels, "/",
2261 sizeof(buf_labels));
2262 strlcat(buf_labels, buf_label,
2263 sizeof(buf_labels));
2264 }
2265 } else if (nexthop->sr.present)
2266 label2str(nexthop->sr.label, buf_labels,
2267 sizeof(buf_labels));
2268 else
2269 strlcpy(buf_labels, "-", sizeof(buf_labels));
2270
2271 if (first) {
2272 ttable_add_row(tt, "%s|%u|%s|%s|%s", buf_prefix,
2273 rinfo->cost, buf_iface, buf_nhop,
2274 buf_labels);
2275 first = false;
2276 } else
2277 ttable_add_row(tt, "||%s|%s|%s", buf_iface,
2278 buf_nhop, buf_labels);
2279 }
2280 }
2281 if (list_isempty(rinfo->nexthops)) {
2282 if (prefix_sid) {
2283 char buf_sid[BUFSIZ] = {};
2284 char buf_lblop[BUFSIZ] = {};
2285
2286 if (rinfo->sr.present) {
2287 snprintf(buf_sid, sizeof(buf_sid), "%u",
2288 rinfo->sr.sid.value);
2289 sr_op2str(buf_lblop, sizeof(buf_lblop),
2290 rinfo->sr.label,
2291 MPLS_LABEL_IMPLICIT_NULL);
2292 } else {
2293 strlcpy(buf_sid, "-", sizeof(buf_sid));
2294 strlcpy(buf_lblop, "-", sizeof(buf_lblop));
2295 }
2296
2297 ttable_add_row(tt, "%s|%u|%s|%s|%s|%s", buf_prefix,
2298 rinfo->cost, "-", "-", buf_sid,
2299 buf_lblop);
2300 } else
2301 ttable_add_row(tt, "%s|%u|%s|%s|%s", buf_prefix,
2302 rinfo->cost, "-", "-", "-");
2303 }
2304 }
2305
2306 void isis_print_routes(struct vty *vty, struct isis_spftree *spftree,
2307 bool prefix_sid, bool backup)
2308 {
2309 struct route_table *route_table;
2310 struct ttable *tt;
2311 struct route_node *rn;
2312 bool no_adjacencies = false;
2313 const char *tree_id_text = NULL;
2314
2315 if (!spftree)
2316 return;
2317
2318 switch (spftree->tree_id) {
2319 case SPFTREE_IPV4:
2320 tree_id_text = "IPv4";
2321 break;
2322 case SPFTREE_IPV6:
2323 tree_id_text = "IPv6";
2324 break;
2325 case SPFTREE_DSTSRC:
2326 tree_id_text = "IPv6 (dst-src routing)";
2327 break;
2328 case SPFTREE_COUNT:
2329 assert(!"isis_print_routes shouldn't be called with SPFTREE_COUNT as type");
2330 return;
2331 }
2332
2333 vty_out(vty, "IS-IS %s %s routing table:\n\n",
2334 circuit_t2string(spftree->level), tree_id_text);
2335
2336 /* Prepare table. */
2337 tt = ttable_new(&ttable_styles[TTSTYLE_BLANK]);
2338 if (prefix_sid)
2339 ttable_add_row(tt, "Prefix|Metric|Interface|Nexthop|SID|Label Op.");
2340 else
2341 ttable_add_row(tt, "Prefix|Metric|Interface|Nexthop|Label(s)");
2342 tt->style.cell.rpad = 2;
2343 tt->style.corner = '+';
2344 ttable_restyle(tt);
2345 ttable_rowseps(tt, 0, BOTTOM, true, '-');
2346
2347 if (CHECK_FLAG(spftree->flags, F_SPFTREE_NO_ADJACENCIES))
2348 no_adjacencies = true;
2349
2350 route_table =
2351 (backup) ? spftree->route_table_backup : spftree->route_table;
2352 for (rn = route_top(route_table); rn; rn = route_next(rn)) {
2353 struct isis_route_info *rinfo;
2354
2355 rinfo = rn->info;
2356 if (!rinfo)
2357 continue;
2358
2359 isis_print_route(tt, &rn->p, rinfo, prefix_sid, no_adjacencies);
2360 }
2361
2362 /* Dump the generated table. */
2363 if (tt->nrows > 1) {
2364 char *table;
2365
2366 table = ttable_dump(tt, "\n");
2367 vty_out(vty, "%s\n", table);
2368 XFREE(MTYPE_TMP, table);
2369 }
2370 ttable_del(tt);
2371 }
2372
2373 static void show_isis_route_common(struct vty *vty, int levels,
2374 struct isis *isis, bool prefix_sid,
2375 bool backup)
2376 {
2377 struct listnode *node;
2378 struct isis_area *area;
2379
2380 if (!isis->area_list || isis->area_list->count == 0)
2381 return;
2382
2383 for (ALL_LIST_ELEMENTS_RO(isis->area_list, node, area)) {
2384 vty_out(vty, "Area %s:\n",
2385 area->area_tag ? area->area_tag : "null");
2386
2387 for (int level = ISIS_LEVEL1; level <= ISIS_LEVELS; level++) {
2388 if ((level & levels) == 0)
2389 continue;
2390
2391 if (area->ip_circuits > 0) {
2392 isis_print_routes(
2393 vty,
2394 area->spftree[SPFTREE_IPV4][level - 1],
2395 prefix_sid, backup);
2396 }
2397 if (area->ipv6_circuits > 0) {
2398 isis_print_routes(
2399 vty,
2400 area->spftree[SPFTREE_IPV6][level - 1],
2401 prefix_sid, backup);
2402 }
2403 if (isis_area_ipv6_dstsrc_enabled(area)) {
2404 isis_print_routes(vty,
2405 area->spftree[SPFTREE_DSTSRC]
2406 [level - 1],
2407 prefix_sid, backup);
2408 }
2409 }
2410 }
2411 }
2412
2413 DEFUN(show_isis_route, show_isis_route_cmd,
2414 "show " PROTO_NAME
2415 " [vrf <NAME|all>] route"
2416 #ifndef FABRICD
2417 " [<level-1|level-2>]"
2418 #endif
2419 " [<prefix-sid|backup>]",
2420 SHOW_STR PROTO_HELP VRF_FULL_CMD_HELP_STR
2421 "IS-IS routing table\n"
2422 #ifndef FABRICD
2423 "level-1 routes\n"
2424 "level-2 routes\n"
2425 #endif
2426 "Show Prefix-SID information\n"
2427 "Show backup routes\n")
2428 {
2429 int levels;
2430 struct isis *isis;
2431 struct listnode *node;
2432 const char *vrf_name = VRF_DEFAULT_NAME;
2433 bool all_vrf = false;
2434 bool prefix_sid = false;
2435 bool backup = false;
2436 int idx = 0;
2437
2438 if (argv_find(argv, argc, "level-1", &idx))
2439 levels = ISIS_LEVEL1;
2440 else if (argv_find(argv, argc, "level-2", &idx))
2441 levels = ISIS_LEVEL2;
2442 else
2443 levels = ISIS_LEVEL1 | ISIS_LEVEL2;
2444
2445 if (!im) {
2446 vty_out(vty, "IS-IS Routing Process not enabled\n");
2447 return CMD_SUCCESS;
2448 }
2449 ISIS_FIND_VRF_ARGS(argv, argc, idx, vrf_name, all_vrf);
2450
2451 if (argv_find(argv, argc, "prefix-sid", &idx))
2452 prefix_sid = true;
2453 if (argv_find(argv, argc, "backup", &idx))
2454 backup = true;
2455
2456 if (vrf_name) {
2457 if (all_vrf) {
2458 for (ALL_LIST_ELEMENTS_RO(im->isis, node, isis))
2459 show_isis_route_common(vty, levels, isis,
2460 prefix_sid, backup);
2461 return CMD_SUCCESS;
2462 }
2463 isis = isis_lookup_by_vrfname(vrf_name);
2464 if (isis != NULL)
2465 show_isis_route_common(vty, levels, isis, prefix_sid,
2466 backup);
2467 }
2468
2469 return CMD_SUCCESS;
2470 }
2471
2472 static void isis_print_frr_summary_line(struct ttable *tt,
2473 const char *protection,
2474 uint32_t counters[SPF_PREFIX_PRIO_MAX])
2475 {
2476 uint32_t critical, high, medium, low, total;
2477
2478 critical = counters[SPF_PREFIX_PRIO_CRITICAL];
2479 high = counters[SPF_PREFIX_PRIO_HIGH];
2480 medium = counters[SPF_PREFIX_PRIO_MEDIUM];
2481 low = counters[SPF_PREFIX_PRIO_LOW];
2482 total = critical + high + medium + low;
2483
2484 ttable_add_row(tt, "%s|%u|%u|%u|%u|%u", protection, critical, high,
2485 medium, low, total);
2486 }
2487
2488 static void
2489 isis_print_frr_summary_line_coverage(struct ttable *tt, const char *protection,
2490 double counters[SPF_PREFIX_PRIO_MAX],
2491 double total)
2492 {
2493 double critical, high, medium, low;
2494
2495 critical = counters[SPF_PREFIX_PRIO_CRITICAL] * 100;
2496 high = counters[SPF_PREFIX_PRIO_HIGH] * 100;
2497 medium = counters[SPF_PREFIX_PRIO_MEDIUM] * 100;
2498 low = counters[SPF_PREFIX_PRIO_LOW] * 100;
2499 total *= 100;
2500
2501 ttable_add_row(tt, "%s|%.2f%%|%.2f%%|%.2f%%|%.2f%%|%.2f%%", protection,
2502 critical, high, medium, low, total);
2503 }
2504
2505 static void isis_print_frr_summary(struct vty *vty,
2506 struct isis_spftree *spftree)
2507 {
2508 struct ttable *tt;
2509 char *table;
2510 const char *tree_id_text = NULL;
2511 uint32_t protectd[SPF_PREFIX_PRIO_MAX] = {0};
2512 uint32_t unprotected[SPF_PREFIX_PRIO_MAX] = {0};
2513 double coverage[SPF_PREFIX_PRIO_MAX] = {0};
2514 uint32_t protected_total = 0, grand_total = 0;
2515 double coverage_total;
2516
2517 if (!spftree)
2518 return;
2519
2520 switch (spftree->tree_id) {
2521 case SPFTREE_IPV4:
2522 tree_id_text = "IPv4";
2523 break;
2524 case SPFTREE_IPV6:
2525 tree_id_text = "IPv6";
2526 break;
2527 case SPFTREE_DSTSRC:
2528 tree_id_text = "IPv6 (dst-src routing)";
2529 break;
2530 case SPFTREE_COUNT:
2531 assert(!"isis_print_frr_summary shouldn't be called with SPFTREE_COUNT as type");
2532 return;
2533 }
2534
2535 vty_out(vty, " IS-IS %s %s Fast ReRoute summary:\n\n",
2536 circuit_t2string(spftree->level), tree_id_text);
2537
2538 /* Prepare table. */
2539 tt = ttable_new(&ttable_styles[TTSTYLE_BLANK]);
2540 ttable_add_row(
2541 tt,
2542 "Protection \\ Priority|Critical|High |Medium |Low |Total");
2543 tt->style.cell.rpad = 2;
2544 tt->style.corner = '+';
2545 ttable_restyle(tt);
2546 ttable_rowseps(tt, 0, BOTTOM, true, '-');
2547
2548 /* Compute unprotected and coverage totals. */
2549 for (int priority = SPF_PREFIX_PRIO_CRITICAL;
2550 priority < SPF_PREFIX_PRIO_MAX; priority++) {
2551 uint32_t *lfa = spftree->lfa.protection_counters.lfa;
2552 uint32_t *rlfa = spftree->lfa.protection_counters.rlfa;
2553 uint32_t *tilfa = spftree->lfa.protection_counters.tilfa;
2554 uint32_t *ecmp = spftree->lfa.protection_counters.ecmp;
2555 uint32_t *total = spftree->lfa.protection_counters.total;
2556
2557 protectd[priority] = lfa[priority] + rlfa[priority]
2558 + tilfa[priority] + ecmp[priority];
2559 /* Safeguard to protect against possible inconsistencies. */
2560 if (protectd[priority] > total[priority])
2561 protectd[priority] = total[priority];
2562 unprotected[priority] = total[priority] - protectd[priority];
2563 protected_total += protectd[priority];
2564 grand_total += total[priority];
2565
2566 if (!total[priority])
2567 coverage[priority] = 0;
2568 else
2569 coverage[priority] =
2570 protectd[priority] / (double)total[priority];
2571 }
2572
2573 if (!grand_total)
2574 coverage_total = 0;
2575 else
2576 coverage_total = protected_total / (double)grand_total;
2577
2578 /* Add rows. */
2579 isis_print_frr_summary_line(tt, "Classic LFA",
2580 spftree->lfa.protection_counters.lfa);
2581 isis_print_frr_summary_line(tt, "Remote LFA",
2582 spftree->lfa.protection_counters.rlfa);
2583 isis_print_frr_summary_line(tt, "Topology Independent LFA",
2584 spftree->lfa.protection_counters.tilfa);
2585 isis_print_frr_summary_line(tt, "ECMP",
2586 spftree->lfa.protection_counters.ecmp);
2587 isis_print_frr_summary_line(tt, "Unprotected", unprotected);
2588 isis_print_frr_summary_line_coverage(tt, "Protection coverage",
2589 coverage, coverage_total);
2590
2591 /* Dump the generated table. */
2592 table = ttable_dump(tt, "\n");
2593 vty_out(vty, "%s\n", table);
2594 XFREE(MTYPE_TMP, table);
2595 ttable_del(tt);
2596 }
2597
2598 static void show_isis_frr_summary_common(struct vty *vty, int levels,
2599 struct isis *isis)
2600 {
2601 struct listnode *node;
2602 struct isis_area *area;
2603
2604 if (!isis->area_list || isis->area_list->count == 0)
2605 return;
2606
2607 for (ALL_LIST_ELEMENTS_RO(isis->area_list, node, area)) {
2608 vty_out(vty, "Area %s:\n",
2609 area->area_tag ? area->area_tag : "null");
2610
2611 for (int level = ISIS_LEVEL1; level <= ISIS_LEVELS; level++) {
2612 if ((level & levels) == 0)
2613 continue;
2614
2615 if (area->ip_circuits > 0) {
2616 isis_print_frr_summary(
2617 vty,
2618 area->spftree[SPFTREE_IPV4][level - 1]);
2619 }
2620 if (area->ipv6_circuits > 0) {
2621 isis_print_frr_summary(
2622 vty,
2623 area->spftree[SPFTREE_IPV6][level - 1]);
2624 }
2625 if (isis_area_ipv6_dstsrc_enabled(area)) {
2626 isis_print_frr_summary(
2627 vty, area->spftree[SPFTREE_DSTSRC]
2628 [level - 1]);
2629 }
2630 }
2631 }
2632 }
2633
2634 DEFUN(show_isis_frr_summary, show_isis_frr_summary_cmd,
2635 "show " PROTO_NAME
2636 " [vrf <NAME|all>] fast-reroute summary"
2637 #ifndef FABRICD
2638 " [<level-1|level-2>]"
2639 #endif
2640 ,
2641 SHOW_STR PROTO_HELP VRF_FULL_CMD_HELP_STR
2642 "IS-IS FRR information\n"
2643 "FRR summary\n"
2644 #ifndef FABRICD
2645 "level-1 routes\n"
2646 "level-2 routes\n"
2647 #endif
2648 )
2649 {
2650 int levels;
2651 struct isis *isis;
2652 struct listnode *node;
2653 const char *vrf_name = VRF_DEFAULT_NAME;
2654 bool all_vrf = false;
2655 int idx = 0;
2656
2657 if (argv_find(argv, argc, "level-1", &idx))
2658 levels = ISIS_LEVEL1;
2659 else if (argv_find(argv, argc, "level-2", &idx))
2660 levels = ISIS_LEVEL2;
2661 else
2662 levels = ISIS_LEVEL1 | ISIS_LEVEL2;
2663
2664 if (!im) {
2665 vty_out(vty, "IS-IS Routing Process not enabled\n");
2666 return CMD_SUCCESS;
2667 }
2668 ISIS_FIND_VRF_ARGS(argv, argc, idx, vrf_name, all_vrf);
2669
2670 if (vrf_name) {
2671 if (all_vrf) {
2672 for (ALL_LIST_ELEMENTS_RO(im->isis, node, isis))
2673 show_isis_frr_summary_common(vty, levels, isis);
2674 return CMD_SUCCESS;
2675 }
2676 isis = isis_lookup_by_vrfname(vrf_name);
2677 if (isis != NULL)
2678 show_isis_frr_summary_common(vty, levels, isis);
2679 }
2680
2681 return CMD_SUCCESS;
2682 }
2683
2684 void isis_spf_init(void)
2685 {
2686 install_element(VIEW_NODE, &show_isis_topology_cmd);
2687 install_element(VIEW_NODE, &show_isis_route_cmd);
2688 install_element(VIEW_NODE, &show_isis_frr_summary_cmd);
2689
2690 /* Register hook(s). */
2691 hook_register(isis_adj_state_change_hook, spf_adj_state_change);
2692 }
2693
2694 void isis_spf_print(struct isis_spftree *spftree, struct vty *vty)
2695 {
2696 vty_out(vty, " last run elapsed : ");
2697 vty_out_timestr(vty, spftree->last_run_timestamp);
2698 vty_out(vty, "\n");
2699
2700 vty_out(vty, " last run duration : %u usec\n",
2701 (uint32_t)spftree->last_run_duration);
2702
2703 vty_out(vty, " run count : %u\n", spftree->runcount);
2704 }
2705 void isis_spf_print_json(struct isis_spftree *spftree, struct json_object *json)
2706 {
2707 char uptime[MONOTIME_STRLEN];
2708 time_t cur;
2709 cur = time(NULL);
2710 cur -= spftree->last_run_timestamp;
2711 frrtime_to_interval(cur, uptime, sizeof(uptime));
2712 json_object_string_add(json, "last-run-elapsed", uptime);
2713 json_object_int_add(json, "last-run-duration-usec",
2714 spftree->last_run_duration);
2715 json_object_int_add(json, "last-run-count", spftree->runcount);
2716 }
FRRouting mirror