]> git.proxmox.com Git - mirror_frr.git/blob - bgpd/rfapi/rfapi_rib.c
projects / mirror_frr.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
*: conform with COMMUNITY.md formatting rules, via 'make indent'
[mirror_frr.git] / bgpd / rfapi / rfapi_rib.c
1 /*
2 *
3 * Copyright 2009-2016, LabN Consulting, L.L.C.
4 *
5 *
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License
8 * as published by the Free Software Foundation; either version 2
9 * of the License, or (at your option) any later version.
10 *
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License along
17 * with this program; see the file COPYING; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20
21 /*
22 * File: rfapi_rib.c
23 * Purpose: maintain per-nve ribs and generate change lists
24 */
25
26 #include <errno.h>
27
28 #include "lib/zebra.h"
29 #include "lib/prefix.h"
30 #include "lib/table.h"
31 #include "lib/vty.h"
32 #include "lib/memory.h"
33 #include "lib/log.h"
34 #include "lib/skiplist.h"
35 #include "lib/workqueue.h"
36
37 #include "bgpd/bgpd.h"
38 #include "bgpd/bgp_route.h"
39 #include "bgpd/bgp_ecommunity.h"
40 #include "bgpd/bgp_mplsvpn.h"
41 #include "bgpd/bgp_vnc_types.h"
42
43 #include "bgpd/rfapi/rfapi.h"
44 #include "bgpd/rfapi/bgp_rfapi_cfg.h"
45 #include "bgpd/rfapi/rfapi_import.h"
46 #include "bgpd/rfapi/rfapi_private.h"
47 #include "bgpd/rfapi/rfapi_vty.h"
48 #include "bgpd/rfapi/vnc_import_bgp.h"
49 #include "bgpd/rfapi/rfapi_rib.h"
50 #include "bgpd/rfapi/rfapi_monitor.h"
51 #include "bgpd/rfapi/rfapi_encap_tlv.h"
52 #include "bgpd/rfapi/vnc_debug.h"
53
54 #define DEBUG_PROCESS_PENDING_NODE 0
55 #define DEBUG_PENDING_DELETE_ROUTE 0
56 #define DEBUG_NHL 0
57 #define DEBUG_RIB_SL_RD 0
58
59 /* forward decl */
60 #if DEBUG_NHL
61 static void rfapiRibShowRibSl(void *stream, struct prefix *pfx,
62 struct skiplist *sl);
63 #endif
64
65 /*
66 * RIB
67 * ---
68 * Model of the set of routes currently in the NVE's RIB.
69 *
70 * node->info ptr to "struct skiplist".
71 * MUST be NULL if there are no routes.
72 * key = ptr to struct prefix {vn}
73 * val = ptr to struct rfapi_info
74 * skiplist.del = NULL
75 * skiplist.cmp = vnc_prefix_cmp
76 *
77 * node->aggregate ptr to "struct skiplist".
78 * key = ptr to struct prefix {vn}
79 * val = ptr to struct rfapi_info
80 * skiplist.del = rfapi_info_free
81 * skiplist.cmp = vnc_prefix_cmp
82 *
83 * This skiplist at "aggregate"
84 * contains the routes recently
85 * deleted
86 *
87 *
88 * Pending RIB
89 * -----------
90 * Sparse list of prefixes that need to be updated. Each node
91 * will have the complete set of routes for the prefix.
92 *
93 * node->info ptr to "struct list" (lib/linklist.h)
94 * "Cost List"
95 * List of routes sorted lowest cost first.
96 * This list is how the new complete set
97 * of routes should look.
98 * Set if there are updates to the prefix;
99 * MUST be NULL if there are no updates.
100 *
101 * .data = ptr to struct rfapi_info
102 * list.cmp = NULL (sorted manually)
103 * list.del = rfapi_info_free
104 *
105 * Special case: if node->info is 1, it means
106 * "delete all routes at this prefix".
107 *
108 * node->aggregate ptr to struct skiplist
109 * key = ptr to struct prefix {vn} (part of ri)
110 * val = struct rfapi_info
111 * skiplist.cmp = vnc_prefix_cmp
112 * skiplist.del = NULL
113 *
114 * ptlist is rewritten anew each time
115 * rfapiRibUpdatePendingNode() is called
116 *
117 * THE ptlist VALUES ARE REFERENCES TO THE
118 * rfapi_info STRUCTS IN THE node->info LIST.
119 */
120
121 /*
122 * iterate over RIB to count responses, compare with running counters
123 */
124 void rfapiRibCheckCounts(
125 int checkstats, /* validate rfd & global counts */
126 unsigned int offset) /* number of ri's held separately */
127 {
128 struct rfapi_descriptor *rfd;
129 struct listnode *node;
130
131 struct bgp *bgp = bgp_get_default();
132
133 uint32_t t_pfx_active = 0;
134 uint32_t t_pfx_deleted = 0;
135
136 uint32_t t_ri_active = 0;
137 uint32_t t_ri_deleted = 0;
138 uint32_t t_ri_pend = 0;
139
140 unsigned int alloc_count;
141
142 /*
143 * loop over NVEs
144 */
145 for (ALL_LIST_ELEMENTS_RO(&bgp->rfapi->descriptors, node, rfd)) {
146
147 afi_t afi;
148 uint32_t pfx_active = 0;
149 uint32_t pfx_deleted = 0;
150
151 for (afi = AFI_IP; afi < AFI_MAX; ++afi) {
152
153 struct route_node *rn;
154
155 for (rn = route_top(rfd->rib[afi]); rn;
156 rn = route_next(rn)) {
157
158 struct skiplist *sl = rn->info;
159 struct skiplist *dsl = rn->aggregate;
160 uint32_t ri_active = 0;
161 uint32_t ri_deleted = 0;
162
163 if (sl) {
164 ri_active = skiplist_count(sl);
165 assert(ri_active);
166 t_ri_active += ri_active;
167 ++pfx_active;
168 ++t_pfx_active;
169 }
170
171 if (dsl) {
172 ri_deleted = skiplist_count(dsl);
173 t_ri_deleted += ri_deleted;
174 ++pfx_deleted;
175 ++t_pfx_deleted;
176 }
177 }
178 for (rn = route_top(rfd->rib_pending[afi]); rn;
179 rn = route_next(rn)) {
180
181 struct list *l = rn->info; /* sorted by cost */
182 struct skiplist *sl = rn->aggregate;
183 uint32_t ri_pend_cost = 0;
184 uint32_t ri_pend_uniq = 0;
185
186 if (sl) {
187 ri_pend_uniq = skiplist_count(sl);
188 }
189
190 if (l && (l != (void *)1)) {
191 ri_pend_cost = l->count;
192 t_ri_pend += l->count;
193 }
194
195 assert(ri_pend_uniq == ri_pend_cost);
196 }
197 }
198
199 if (checkstats) {
200 if (pfx_active != rfd->rib_prefix_count) {
201 vnc_zlog_debug_verbose(
202 "%s: rfd %p actual pfx count %u != running %u",
203 __func__, rfd, pfx_active,
204 rfd->rib_prefix_count);
205 assert(0);
206 }
207 }
208 }
209
210 if (checkstats && bgp->rfapi) {
211 if (t_pfx_active != bgp->rfapi->rib_prefix_count_total) {
212 vnc_zlog_debug_verbose(
213 "%s: actual total pfx count %u != running %u",
214 __func__, t_pfx_active,
215 bgp->rfapi->rib_prefix_count_total);
216 assert(0);
217 }
218 }
219
220 /*
221 * Check against memory allocation count
222 */
223 alloc_count = mtype_stats_alloc(MTYPE_RFAPI_INFO);
224 assert(t_ri_active + t_ri_deleted + t_ri_pend + offset == alloc_count);
225 }
226
227 static struct rfapi_info *rfapi_info_new()
228 {
229 return XCALLOC(MTYPE_RFAPI_INFO, sizeof(struct rfapi_info));
230 }
231
232 void rfapiFreeRfapiUnOptionChain(struct rfapi_un_option *p)
233 {
234 while (p) {
235 struct rfapi_un_option *next;
236
237 next = p->next;
238 XFREE(MTYPE_RFAPI_UN_OPTION, p);
239 p = next;
240 }
241 }
242
243 void rfapiFreeRfapiVnOptionChain(struct rfapi_vn_option *p)
244 {
245 while (p) {
246 struct rfapi_vn_option *next;
247
248 next = p->next;
249 XFREE(MTYPE_RFAPI_VN_OPTION, p);
250 p = next;
251 }
252 }
253
254
255 static void rfapi_info_free(struct rfapi_info *goner)
256 {
257 if (goner) {
258 if (goner->tea_options) {
259 rfapiFreeBgpTeaOptionChain(goner->tea_options);
260 goner->tea_options = NULL;
261 }
262 if (goner->un_options) {
263 rfapiFreeRfapiUnOptionChain(goner->un_options);
264 goner->un_options = NULL;
265 }
266 if (goner->vn_options) {
267 rfapiFreeRfapiVnOptionChain(goner->vn_options);
268 goner->vn_options = NULL;
269 }
270 if (goner->timer) {
271 struct rfapi_rib_tcb *tcb;
272
273 tcb = ((struct thread *)goner->timer)->arg;
274 thread_cancel((struct thread *)goner->timer);
275 XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
276 goner->timer = NULL;
277 }
278 XFREE(MTYPE_RFAPI_INFO, goner);
279 }
280 }
281
282 /*
283 * Timer control block for recently-deleted and expired routes
284 */
285 struct rfapi_rib_tcb {
286 struct rfapi_descriptor *rfd;
287 struct skiplist *sl;
288 struct rfapi_info *ri;
289 struct route_node *rn;
290 int flags;
291 #define RFAPI_RIB_TCB_FLAG_DELETED 0x00000001
292 };
293
294 /*
295 * remove route from rib
296 */
297 static int rfapiRibExpireTimer(struct thread *t)
298 {
299 struct rfapi_rib_tcb *tcb = t->arg;
300
301 RFAPI_RIB_CHECK_COUNTS(1, 0);
302
303 /*
304 * Forget reference to thread. Otherwise rfapi_info_free() will
305 * attempt to free thread pointer as an option chain
306 */
307 tcb->ri->timer = NULL;
308
309 /* "deleted" skiplist frees ri, "active" doesn't */
310 assert(!skiplist_delete(tcb->sl, &tcb->ri->rk, NULL));
311 if (!tcb->sl->del) {
312 /*
313 * XXX in this case, skiplist has no delete function: we must
314 * therefore delete rfapi_info explicitly.
315 */
316 rfapi_info_free(tcb->ri);
317 }
318
319 if (skiplist_empty(tcb->sl)) {
320 if (CHECK_FLAG(tcb->flags, RFAPI_RIB_TCB_FLAG_DELETED))
321 tcb->rn->aggregate = NULL;
322 else {
323 struct bgp *bgp = bgp_get_default();
324 tcb->rn->info = NULL;
325 RFAPI_RIB_PREFIX_COUNT_DECR(tcb->rfd, bgp->rfapi);
326 }
327 skiplist_free(tcb->sl);
328 route_unlock_node(tcb->rn);
329 }
330
331 XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
332
333 RFAPI_RIB_CHECK_COUNTS(1, 0);
334
335 return 0;
336 }
337
338 static void
339 rfapiRibStartTimer(struct rfapi_descriptor *rfd, struct rfapi_info *ri,
340 struct route_node *rn, /* route node attached to */
341 int deleted)
342 {
343 struct thread *t = ri->timer;
344 struct rfapi_rib_tcb *tcb = NULL;
345 char buf_prefix[PREFIX_STRLEN];
346
347 if (t) {
348 tcb = t->arg;
349 thread_cancel(t);
350 ri->timer = NULL;
351 } else {
352 tcb = XCALLOC(MTYPE_RFAPI_RECENT_DELETE,
353 sizeof(struct rfapi_rib_tcb));
354 }
355 tcb->rfd = rfd;
356 tcb->ri = ri;
357 tcb->rn = rn;
358 if (deleted) {
359 tcb->sl = (struct skiplist *)rn->aggregate;
360 SET_FLAG(tcb->flags, RFAPI_RIB_TCB_FLAG_DELETED);
361 } else {
362 tcb->sl = (struct skiplist *)rn->info;
363 UNSET_FLAG(tcb->flags, RFAPI_RIB_TCB_FLAG_DELETED);
364 }
365
366 prefix2str(&rn->p, buf_prefix, sizeof(buf_prefix));
367 vnc_zlog_debug_verbose("%s: rfd %p pfx %s life %u", __func__, rfd,
368 buf_prefix, ri->lifetime);
369 ri->timer = NULL;
370 thread_add_timer(bm->master, rfapiRibExpireTimer, tcb, ri->lifetime,
371 &ri->timer);
372 assert(ri->timer);
373 }
374
375 extern void rfapi_rib_key_init(struct prefix *prefix, /* may be NULL */
376 struct prefix_rd *rd, /* may be NULL */
377 struct prefix *aux, /* may be NULL */
378 struct rfapi_rib_key *rk)
379
380 {
381 memset((void *)rk, 0, sizeof(struct rfapi_rib_key));
382 if (prefix)
383 rk->vn = *prefix;
384 if (rd)
385 rk->rd = *rd;
386 if (aux)
387 rk->aux_prefix = *aux;
388 }
389
390 /*
391 * Compares two <struct rfapi_rib_key>s
392 */
393 int rfapi_rib_key_cmp(void *k1, void *k2)
394 {
395 struct rfapi_rib_key *a = (struct rfapi_rib_key *)k1;
396 struct rfapi_rib_key *b = (struct rfapi_rib_key *)k2;
397 int ret;
398
399 if (!a || !b)
400 return (a - b);
401
402 ret = vnc_prefix_cmp(&a->vn, &b->vn);
403 if (ret)
404 return ret;
405
406 ret = vnc_prefix_cmp(&a->rd, &b->rd);
407 if (ret)
408 return ret;
409
410 ret = vnc_prefix_cmp(&a->aux_prefix, &b->aux_prefix);
411
412 return ret;
413 }
414
415
416 /*
417 * Note: this function will claim that two option chains are
418 * different unless their option items are in identical order.
419 * The consequence is that RFP updated responses can be sent
420 * unnecessarily, or that they might contain nexthop items
421 * that are not strictly needed.
422 *
423 * This function could be modified to compare option chains more
424 * thoroughly, but it's not clear that the extra compuation would
425 * be worth it.
426 */
427 static int bgp_tea_options_cmp(struct bgp_tea_options *a,
428 struct bgp_tea_options *b)
429 {
430 int rc;
431
432 if (!a || !b) {
433 return (a - b);
434 }
435
436 if (a->type != b->type)
437 return (a->type - b->type);
438 if (a->length != b->length)
439 return (a->length = b->length);
440 if ((rc = memcmp(a->value, b->value, a->length)))
441 return rc;
442 if (!a->next != !b->next) { /* logical xor */
443 return (a->next - b->next);
444 }
445 if (a->next)
446 return bgp_tea_options_cmp(a->next, b->next);
447 return 0;
448 }
449
450 static int rfapi_info_cmp(struct rfapi_info *a, struct rfapi_info *b)
451 {
452 int rc;
453
454 if (!a || !b)
455 return (a - b);
456
457 if ((rc = rfapi_rib_key_cmp(&a->rk, &b->rk)))
458 return rc;
459
460 if ((rc = vnc_prefix_cmp(&a->un, &b->un)))
461 return rc;
462
463 if (a->cost != b->cost)
464 return (a->cost - b->cost);
465
466 if (a->lifetime != b->lifetime)
467 return (a->lifetime - b->lifetime);
468
469 if ((rc = bgp_tea_options_cmp(a->tea_options, b->tea_options)))
470 return rc;
471
472 return 0;
473 }
474
475 void rfapiRibClear(struct rfapi_descriptor *rfd)
476 {
477 struct bgp *bgp;
478 afi_t afi;
479
480 if (rfd->bgp)
481 bgp = rfd->bgp;
482 else
483 bgp = bgp_get_default();
484 #if DEBUG_L2_EXTRA
485 vnc_zlog_debug_verbose("%s: rfd=%p", __func__, rfd);
486 #endif
487
488 for (afi = AFI_IP; afi < AFI_MAX; ++afi) {
489 struct route_node *pn;
490 struct route_node *rn;
491
492 if (rfd->rib_pending[afi]) {
493 for (pn = route_top(rfd->rib_pending[afi]); pn;
494 pn = route_next(pn)) {
495 if (pn->aggregate) {
496 /*
497 * free references into the rfapi_info
498 * structures before
499 * freeing the structures themselves
500 */
501 skiplist_free(
502 (struct skiplist
503 *)(pn->aggregate));
504 pn->aggregate = NULL;
505 route_unlock_node(
506 pn); /* skiplist deleted */
507 }
508 /*
509 * free the rfapi_info structures
510 */
511 if (pn->info) {
512 if (pn->info != (void *)1) {
513 list_delete_and_null(
514 (struct list *
515 *)(&pn->info));
516 }
517 pn->info = NULL;
518 /* linklist or 1 deleted */
519 route_unlock_node(pn);
520 }
521 }
522 }
523 if (rfd->rib[afi]) {
524 for (rn = route_top(rfd->rib[afi]); rn;
525 rn = route_next(rn)) {
526 if (rn->info) {
527
528 struct rfapi_info *ri;
529
530 while (0 == skiplist_first(
531 (struct skiplist *)
532 rn->info,
533 NULL,
534 (void **)&ri)) {
535
536 rfapi_info_free(ri);
537 skiplist_delete_first(
538 (struct skiplist *)
539 rn->info);
540 }
541 skiplist_free(
542 (struct skiplist *)rn->info);
543 rn->info = NULL;
544 route_unlock_node(rn);
545 RFAPI_RIB_PREFIX_COUNT_DECR(rfd,
546 bgp->rfapi);
547 }
548 if (rn->aggregate) {
549
550 struct rfapi_info *ri_del;
551
552 /* delete skiplist & contents */
553 while (!skiplist_first(
554 (struct skiplist
555 *)(rn->aggregate),
556 NULL, (void **)&ri_del)) {
557
558 /* sl->del takes care of ri_del
559 */
560 skiplist_delete_first((
561 struct skiplist
562 *)(rn->aggregate));
563 }
564 skiplist_free(
565 (struct skiplist
566 *)(rn->aggregate));
567
568 rn->aggregate = NULL;
569 route_unlock_node(rn);
570 }
571 }
572 }
573 }
574 if (rfd->updated_responses_queue) {
575 work_queue_free(rfd->updated_responses_queue);
576 rfd->updated_responses_queue = NULL;
577 }
578 }
579
580 /*
581 * Release all dynamically-allocated memory that is part of an HD's RIB
582 */
583 void rfapiRibFree(struct rfapi_descriptor *rfd)
584 {
585 afi_t afi;
586
587
588 /*
589 * NB rfd is typically detached from master list, so is not included
590 * in the count performed by RFAPI_RIB_CHECK_COUNTS
591 */
592
593 /*
594 * Free routes attached to radix trees
595 */
596 rfapiRibClear(rfd);
597
598 /* Now the uncounted rfapi_info's are freed, so the check should succeed
599 */
600 RFAPI_RIB_CHECK_COUNTS(1, 0);
601
602 /*
603 * Free radix trees
604 */
605 for (afi = AFI_IP; afi < AFI_MAX; ++afi) {
606 route_table_finish(rfd->rib_pending[afi]);
607 rfd->rib_pending[afi] = NULL;
608
609 route_table_finish(rfd->rib[afi]);
610 rfd->rib[afi] = NULL;
611
612 /* NB route_table_finish frees only prefix nodes, not chained
613 * info */
614 route_table_finish(rfd->rsp_times[afi]);
615 rfd->rib[afi] = NULL;
616 }
617 }
618
619 /*
620 * Copies struct bgp_info to struct rfapi_info, except for rk fields and un
621 */
622 static void rfapiRibBi2Ri(struct bgp_info *bi, struct rfapi_info *ri,
623 uint32_t lifetime)
624 {
625 struct bgp_attr_encap_subtlv *pEncap;
626
627 ri->cost = rfapiRfpCost(bi->attr);
628 ri->lifetime = lifetime;
629
630 /* This loop based on rfapiRouteInfo2NextHopEntry() */
631 for (pEncap = bi->attr->vnc_subtlvs; pEncap; pEncap = pEncap->next) {
632 struct bgp_tea_options *hop;
633
634 switch (pEncap->type) {
635 case BGP_VNC_SUBTLV_TYPE_LIFETIME:
636 /* use configured lifetime, not attr lifetime */
637 break;
638
639 case BGP_VNC_SUBTLV_TYPE_RFPOPTION:
640 hop = XCALLOC(MTYPE_BGP_TEA_OPTIONS,
641 sizeof(struct bgp_tea_options));
642 assert(hop);
643 hop->type = pEncap->value[0];
644 hop->length = pEncap->value[1];
645 hop->value = XCALLOC(MTYPE_BGP_TEA_OPTIONS_VALUE,
646 pEncap->length - 2);
647 assert(hop->value);
648 memcpy(hop->value, pEncap->value + 2,
649 pEncap->length - 2);
650 if (hop->length > pEncap->length - 2) {
651 zlog_warn(
652 "%s: VNC subtlv length mismatch: "
653 "RFP option says %d, attr says %d "
654 "(shrinking)",
655 __func__, hop->length,
656 pEncap->length - 2);
657 hop->length = pEncap->length - 2;
658 }
659 hop->next = ri->tea_options;
660 ri->tea_options = hop;
661 break;
662
663 default:
664 break;
665 }
666 }
667
668 rfapi_un_options_free(ri->un_options); /* maybe free old version */
669 ri->un_options = rfapi_encap_tlv_to_un_option(bi->attr);
670
671 /*
672 * VN options
673 */
674 if (bi->extra
675 && decode_rd_type(bi->extra->vnc.import.rd.val)
676 == RD_TYPE_VNC_ETH) {
677 /* ethernet route */
678
679 struct rfapi_vn_option *vo;
680
681 vo = XCALLOC(MTYPE_RFAPI_VN_OPTION,
682 sizeof(struct rfapi_vn_option));
683 assert(vo);
684
685 vo->type = RFAPI_VN_OPTION_TYPE_L2ADDR;
686
687 /* copy from RD already stored in bi, so we don't need it_node
688 */
689 memcpy(&vo->v.l2addr.macaddr, bi->extra->vnc.import.rd.val + 2,
690 ETH_ALEN);
691
692 (void)rfapiEcommunityGetLNI(bi->attr->ecommunity,
693 &vo->v.l2addr.logical_net_id);
694 (void)rfapiEcommunityGetEthernetTag(bi->attr->ecommunity,
695 &vo->v.l2addr.tag_id);
696
697 /* local_nve_id comes from RD */
698 vo->v.l2addr.local_nve_id = bi->extra->vnc.import.rd.val[1];
699
700 /* label comes from MP_REACH_NLRI label */
701 vo->v.l2addr.label = decode_label(&bi->extra->label[0]);
702
703 rfapi_vn_options_free(
704 ri->vn_options); /* maybe free old version */
705 ri->vn_options = vo;
706 }
707
708 /*
709 * If there is an auxiliary IP address (L2 can have it), copy it
710 */
711 if (bi->extra && bi->extra->vnc.import.aux_prefix.family) {
712 ri->rk.aux_prefix = bi->extra->vnc.import.aux_prefix;
713 }
714 }
715
716 /*
717 * rfapiRibPreloadBi
718 *
719 * Install route into NVE RIB model so as to be consistent with
720 * caller's response to rfapi_query().
721 *
722 * Also: return indication to caller whether this specific route
723 * should be included in the response to the NVE according to
724 * the following tests:
725 *
726 * 1. If there were prior duplicates of this route in this same
727 * query response, don't include the route.
728 *
729 * RETURN VALUE:
730 *
731 * 0 OK to include route in response
732 * !0 do not include route in response
733 */
734 int rfapiRibPreloadBi(
735 struct route_node *rfd_rib_node, /* NULL = don't preload or filter */
736 struct prefix *pfx_vn, struct prefix *pfx_un, uint32_t lifetime,
737 struct bgp_info *bi)
738 {
739 struct rfapi_descriptor *rfd;
740 struct skiplist *slRibPt = NULL;
741 struct rfapi_info *ori = NULL;
742 struct rfapi_rib_key rk;
743 struct route_node *trn;
744 afi_t afi;
745
746 if (!rfd_rib_node)
747 return 0;
748
749 afi = family2afi(rfd_rib_node->p.family);
750
751 rfd = (struct rfapi_descriptor *)(rfd_rib_node->table->info);
752
753 memset((void *)&rk, 0, sizeof(rk));
754 rk.vn = *pfx_vn;
755 rk.rd = bi->extra->vnc.import.rd;
756
757 /*
758 * If there is an auxiliary IP address (L2 can have it), copy it
759 */
760 if (bi->extra->vnc.import.aux_prefix.family) {
761 rk.aux_prefix = bi->extra->vnc.import.aux_prefix;
762 }
763
764 /*
765 * is this route already in NVE's RIB?
766 */
767 slRibPt = (struct skiplist *)rfd_rib_node->info;
768
769 if (slRibPt && !skiplist_search(slRibPt, &rk, (void **)&ori)) {
770
771 if ((ori->rsp_counter == rfd->rsp_counter)
772 && (ori->last_sent_time == rfd->rsp_time)) {
773 return -1; /* duplicate in this response */
774 }
775
776 /* found: update contents of existing route in RIB */
777 ori->un = *pfx_un;
778 rfapiRibBi2Ri(bi, ori, lifetime);
779 } else {
780 /* not found: add new route to RIB */
781 ori = rfapi_info_new();
782 ori->rk = rk;
783 ori->un = *pfx_un;
784 rfapiRibBi2Ri(bi, ori, lifetime);
785
786 if (!slRibPt) {
787 slRibPt = skiplist_new(0, rfapi_rib_key_cmp, NULL);
788 rfd_rib_node->info = slRibPt;
789 route_lock_node(rfd_rib_node);
790 RFAPI_RIB_PREFIX_COUNT_INCR(rfd, rfd->bgp->rfapi);
791 }
792 skiplist_insert(slRibPt, &ori->rk, ori);
793 }
794
795 ori->last_sent_time = rfapi_time(NULL);
796
797 /*
798 * poke timer
799 */
800 RFAPI_RIB_CHECK_COUNTS(0, 0);
801 rfapiRibStartTimer(rfd, ori, rfd_rib_node, 0);
802 RFAPI_RIB_CHECK_COUNTS(0, 0);
803
804 /*
805 * Update last sent time for prefix
806 */
807 trn = route_node_get(rfd->rsp_times[afi],
808 &rfd_rib_node->p); /* locks trn */
809 trn->info = (void *)(uintptr_t)bgp_clock();
810 if (trn->lock > 1)
811 route_unlock_node(trn);
812
813 return 0;
814 }
815
816 /*
817 * Frees rfapi_info items at node
818 *
819 * Adjust 'rib' and 'rib_pending' as follows:
820 *
821 * If rib_pending node->info is 1 (magic value):
822 * callback: NHL = RIB NHL with lifetime = withdraw_lifetime_value
823 * RIB = remove all routes at the node
824 * DONE
825 *
826 * For each item at rib node:
827 * if not present in pending node, move RIB item to "delete list"
828 *
829 * For each item at pending rib node:
830 * if present (same vn/un) in rib node with same lifetime & options, drop
831 * matching item from pending node
832 *
833 * For each remaining item at pending rib node, add or replace item
834 * at rib node.
835 *
836 * Construct NHL as concatenation of pending list + delete list
837 *
838 * Clear pending node
839 */
840 static void process_pending_node(struct bgp *bgp, struct rfapi_descriptor *rfd,
841 afi_t afi,
842 struct route_node *pn, /* pending node */
843 struct rfapi_next_hop_entry **head,
844 struct rfapi_next_hop_entry **tail)
845 {
846 struct listnode *node = NULL;
847 struct listnode *nnode = NULL;
848 struct rfapi_info *ri = NULL; /* happy valgrind */
849 struct rfapi_ip_prefix hp = {0}; /* pfx to put in NHE */
850 struct route_node *rn = NULL;
851 struct skiplist *slRibPt = NULL; /* rib list */
852 struct skiplist *slPendPt = NULL;
853 struct list *lPendCost = NULL;
854 struct list *delete_list = NULL;
855 int printedprefix = 0;
856 char buf_prefix[PREFIX_STRLEN];
857 int rib_node_started_nonempty = 0;
858 int sendingsomeroutes = 0;
859
860 #if DEBUG_PROCESS_PENDING_NODE
861 unsigned int count_rib_initial = 0;
862 unsigned int count_pend_vn_initial = 0;
863 unsigned int count_pend_cost_initial = 0;
864 #endif
865
866 assert(pn);
867 prefix2str(&pn->p, buf_prefix, sizeof(buf_prefix));
868 vnc_zlog_debug_verbose("%s: afi=%d, %s pn->info=%p", __func__, afi,
869 buf_prefix, pn->info);
870
871 if (AFI_L2VPN != afi) {
872 rfapiQprefix2Rprefix(&pn->p, &hp);
873 }
874
875 RFAPI_RIB_CHECK_COUNTS(1, 0);
876
877 /*
878 * Find corresponding RIB node
879 */
880 rn = route_node_get(rfd->rib[afi], &pn->p); /* locks rn */
881
882 /*
883 * RIB skiplist has key=rfapi_addr={vn,un}, val = rfapi_info,
884 * skiplist.del = NULL
885 */
886 slRibPt = (struct skiplist *)rn->info;
887 if (slRibPt)
888 rib_node_started_nonempty = 1;
889
890 slPendPt = (struct skiplist *)(pn->aggregate);
891 lPendCost = (struct list *)(pn->info);
892
893 #if DEBUG_PROCESS_PENDING_NODE
894 /* debugging */
895 if (slRibPt)
896 count_rib_initial = skiplist_count(slRibPt);
897
898 if (slPendPt)
899 count_pend_vn_initial = skiplist_count(slPendPt);
900
901 if (lPendCost && lPendCost != (struct list *)1)
902 count_pend_cost_initial = lPendCost->count;
903 #endif
904
905
906 /*
907 * Handle special case: delete all routes at prefix
908 */
909 if (lPendCost == (struct list *)1) {
910 vnc_zlog_debug_verbose("%s: lPendCost=1 => delete all",
911 __func__);
912 if (slRibPt && !skiplist_empty(slRibPt)) {
913 delete_list = list_new();
914 while (0
915 == skiplist_first(slRibPt, NULL, (void **)&ri)) {
916
917 char buf[PREFIX_STRLEN];
918 char buf2[PREFIX_STRLEN];
919
920 listnode_add(delete_list, ri);
921 vnc_zlog_debug_verbose(
922 "%s: after listnode_add, delete_list->count=%d",
923 __func__, delete_list->count);
924 rfapiFreeBgpTeaOptionChain(ri->tea_options);
925 ri->tea_options = NULL;
926
927 if (ri->timer) {
928 struct rfapi_rib_tcb *tcb;
929
930 tcb = ((struct thread *)ri->timer)->arg;
931 thread_cancel(ri->timer);
932 XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
933 ri->timer = NULL;
934 }
935
936 prefix2str(&ri->rk.vn, buf, sizeof(buf));
937 prefix2str(&ri->un, buf2, sizeof(buf2));
938 vnc_zlog_debug_verbose(
939 "%s: put dl pfx=%s vn=%s un=%s cost=%d life=%d vn_options=%p",
940 __func__, buf_prefix, buf, buf2,
941 ri->cost, ri->lifetime, ri->vn_options);
942
943 skiplist_delete_first(slRibPt);
944 }
945
946 assert(skiplist_empty(slRibPt));
947
948 skiplist_free(slRibPt);
949 rn->info = slRibPt = NULL;
950 route_unlock_node(rn);
951
952 lPendCost = pn->info = NULL;
953 route_unlock_node(pn);
954
955 goto callback;
956 }
957 if (slRibPt) {
958 skiplist_free(slRibPt);
959 rn->info = NULL;
960 route_unlock_node(rn);
961 }
962
963 assert(!slPendPt);
964 if (slPendPt) { /* TBD I think we can toss this block */
965 skiplist_free(slPendPt);
966 pn->aggregate = NULL;
967 route_unlock_node(pn);
968 }
969
970 pn->info = NULL;
971 route_unlock_node(pn);
972
973 route_unlock_node(rn); /* route_node_get() */
974
975 if (rib_node_started_nonempty) {
976 RFAPI_RIB_PREFIX_COUNT_DECR(rfd, bgp->rfapi);
977 }
978
979 RFAPI_RIB_CHECK_COUNTS(1, 0);
980
981 return;
982 }
983
984 vnc_zlog_debug_verbose("%s: lPendCost->count=%d, slRibPt->count=%d",
985 __func__,
986 (lPendCost ? (int)lPendCost->count : -1),
987 (slRibPt ? (int)slRibPt->count : -1));
988
989 /*
990 * Iterate over routes at RIB Node.
991 * If not found at Pending Node, delete from RIB Node and add to
992 * deletelist
993 * If found at Pending Node
994 * If identical rfapi_info, delete from Pending Node
995 */
996 if (slRibPt) {
997 void *cursor = NULL;
998 struct rfapi_info *ori;
999
1000 /*
1001 * Iterate over RIB List
1002 *
1003 */
1004 while (!skiplist_next(slRibPt, NULL, (void **)&ori, &cursor)) {
1005
1006 if (skiplist_search(slPendPt, &ori->rk, (void **)&ri)) {
1007 /*
1008 * Not in Pending list, so it should be deleted
1009 */
1010 if (!delete_list)
1011 delete_list = list_new();
1012 listnode_add(delete_list, ori);
1013 rfapiFreeBgpTeaOptionChain(ori->tea_options);
1014 ori->tea_options = NULL;
1015 if (ori->timer) {
1016 struct rfapi_rib_tcb *tcb;
1017
1018 tcb = ((struct thread *)ori->timer)
1019 ->arg;
1020 thread_cancel(ori->timer);
1021 XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
1022 ori->timer = NULL;
1023 }
1024
1025 #if DEBUG_PROCESS_PENDING_NODE
1026 /* deleted from slRibPt below, after we're done
1027 * iterating */
1028 vnc_zlog_debug_verbose(
1029 "%s: slRibPt ri %p not matched in pending list, delete",
1030 __func__, ori);
1031 #endif
1032
1033 } else {
1034 /*
1035 * Found in pending list. If same lifetime,
1036 * cost, options,
1037 * then remove from pending list because the
1038 * route
1039 * hasn't changed.
1040 */
1041 if (!rfapi_info_cmp(ori, ri)) {
1042 skiplist_delete(slPendPt, &ri->rk,
1043 NULL);
1044 assert(lPendCost);
1045 if (lPendCost) {
1046 /* linear walk: might need
1047 * optimization */
1048 listnode_delete(lPendCost,
1049 ri); /* XXX
1050 doesn't
1051 free
1052 data!
1053 bug? */
1054 rfapi_info_free(
1055 ri); /* grr... */
1056 }
1057 }
1058 #if DEBUG_PROCESS_PENDING_NODE
1059 vnc_zlog_debug_verbose(
1060 "%s: slRibPt ri %p matched in pending list, %s",
1061 __func__, ori,
1062 (same ? "same info"
1063 : "different info"));
1064 #endif
1065 }
1066 }
1067 /*
1068 * Go back and delete items from RIB
1069 */
1070 if (delete_list) {
1071 for (ALL_LIST_ELEMENTS_RO(delete_list, node, ri)) {
1072 vnc_zlog_debug_verbose(
1073 "%s: deleting ri %p from slRibPt",
1074 __func__, ri);
1075 assert(!skiplist_delete(slRibPt, &ri->rk,
1076 NULL));
1077 }
1078 if (skiplist_empty(slRibPt)) {
1079 skiplist_free(slRibPt);
1080 slRibPt = rn->info = NULL;
1081 route_unlock_node(rn);
1082 }
1083 }
1084 }
1085
1086 RFAPI_RIB_CHECK_COUNTS(0, (delete_list ? delete_list->count : 0));
1087
1088 /*
1089 * Iterate over routes at Pending Node
1090 *
1091 * If {vn} found at RIB Node, update RIB Node route contents to match PN
1092 * If {vn} NOT found at RIB Node, add copy to RIB Node
1093 */
1094 if (lPendCost) {
1095 for (ALL_LIST_ELEMENTS_RO(lPendCost, node, ri)) {
1096
1097 struct rfapi_info *ori;
1098
1099 if (slRibPt
1100 && !skiplist_search(slRibPt, &ri->rk,
1101 (void **)&ori)) {
1102
1103 /* found: update contents of existing route in
1104 * RIB */
1105 ori->un = ri->un;
1106 ori->cost = ri->cost;
1107 ori->lifetime = ri->lifetime;
1108 rfapiFreeBgpTeaOptionChain(ori->tea_options);
1109 ori->tea_options =
1110 rfapiOptionsDup(ri->tea_options);
1111 ori->last_sent_time = rfapi_time(NULL);
1112
1113 rfapiFreeRfapiVnOptionChain(ori->vn_options);
1114 ori->vn_options =
1115 rfapiVnOptionsDup(ri->vn_options);
1116
1117 rfapiFreeRfapiUnOptionChain(ori->un_options);
1118 ori->un_options =
1119 rfapiUnOptionsDup(ri->un_options);
1120
1121 vnc_zlog_debug_verbose(
1122 "%s: matched lPendCost item %p in slRibPt, rewrote",
1123 __func__, ri);
1124
1125 } else {
1126
1127 char buf_rd[RD_ADDRSTRLEN];
1128
1129 /* not found: add new route to RIB */
1130 ori = rfapi_info_new();
1131 ori->rk = ri->rk;
1132 ori->un = ri->un;
1133 ori->cost = ri->cost;
1134 ori->lifetime = ri->lifetime;
1135 ori->tea_options =
1136 rfapiOptionsDup(ri->tea_options);
1137 ori->last_sent_time = rfapi_time(NULL);
1138 ori->vn_options =
1139 rfapiVnOptionsDup(ri->vn_options);
1140 ori->un_options =
1141 rfapiUnOptionsDup(ri->un_options);
1142
1143 if (!slRibPt) {
1144 slRibPt = skiplist_new(
1145 0, rfapi_rib_key_cmp, NULL);
1146 rn->info = slRibPt;
1147 route_lock_node(rn);
1148 }
1149 skiplist_insert(slRibPt, &ori->rk, ori);
1150
1151 #if DEBUG_RIB_SL_RD
1152 prefix_rd2str(&ori->rk.rd, buf_rd,
1153 sizeof(buf_rd));
1154 #else
1155 buf_rd[0] = 0;
1156 #endif
1157
1158 vnc_zlog_debug_verbose(
1159 "%s: nomatch lPendCost item %p in slRibPt, added (rd=%s)",
1160 __func__, ri, buf_rd);
1161 }
1162
1163 /*
1164 * poke timer
1165 */
1166 RFAPI_RIB_CHECK_COUNTS(
1167 0, (delete_list ? delete_list->count : 0));
1168 rfapiRibStartTimer(rfd, ori, rn, 0);
1169 RFAPI_RIB_CHECK_COUNTS(
1170 0, (delete_list ? delete_list->count : 0));
1171 }
1172 }
1173
1174
1175 callback:
1176 /*
1177 * Construct NHL as concatenation of pending list + delete list
1178 */
1179
1180
1181 RFAPI_RIB_CHECK_COUNTS(0, (delete_list ? delete_list->count : 0));
1182
1183 if (lPendCost) {
1184
1185 char buf[BUFSIZ];
1186 char buf2[BUFSIZ];
1187
1188 vnc_zlog_debug_verbose("%s: lPendCost->count now %d", __func__,
1189 lPendCost->count);
1190 vnc_zlog_debug_verbose("%s: For prefix %s (a)", __func__,
1191 buf_prefix);
1192 printedprefix = 1;
1193
1194 for (ALL_LIST_ELEMENTS(lPendCost, node, nnode, ri)) {
1195
1196 struct rfapi_next_hop_entry *new;
1197 struct route_node *trn;
1198
1199 new = XCALLOC(MTYPE_RFAPI_NEXTHOP,
1200 sizeof(struct rfapi_next_hop_entry));
1201 assert(new);
1202
1203 if (ri->rk.aux_prefix.family) {
1204 rfapiQprefix2Rprefix(&ri->rk.aux_prefix,
1205 &new->prefix);
1206 } else {
1207 new->prefix = hp;
1208 if (AFI_L2VPN == afi) {
1209 /* hp is 0; need to set length to match
1210 * AF of vn */
1211 new->prefix.length =
1212 (ri->rk.vn.family == AF_INET)
1213 ? 32
1214 : 128;
1215 }
1216 }
1217 new->prefix.cost = ri->cost;
1218 new->lifetime = ri->lifetime;
1219 rfapiQprefix2Raddr(&ri->rk.vn, &new->vn_address);
1220 rfapiQprefix2Raddr(&ri->un, &new->un_address);
1221 /* free option chain from ri */
1222 rfapiFreeBgpTeaOptionChain(ri->tea_options);
1223
1224 ri->tea_options =
1225 NULL; /* option chain was transferred to NHL */
1226
1227 new->vn_options = ri->vn_options;
1228 ri->vn_options =
1229 NULL; /* option chain was transferred to NHL */
1230
1231 new->un_options = ri->un_options;
1232 ri->un_options =
1233 NULL; /* option chain was transferred to NHL */
1234
1235 if (*tail)
1236 (*tail)->next = new;
1237 *tail = new;
1238 if (!*head) {
1239 *head = new;
1240 }
1241 sendingsomeroutes = 1;
1242
1243 ++rfd->stat_count_nh_reachable;
1244 ++bgp->rfapi->stat.count_updated_response_updates;
1245
1246 /*
1247 * update this NVE's timestamp for this prefix
1248 */
1249 trn = route_node_get(rfd->rsp_times[afi],
1250 &pn->p); /* locks trn */
1251 trn->info = (void *)(uintptr_t)bgp_clock();
1252 if (trn->lock > 1)
1253 route_unlock_node(trn);
1254
1255 rfapiRfapiIpAddr2Str(&new->vn_address, buf, BUFSIZ);
1256 rfapiRfapiIpAddr2Str(&new->un_address, buf2, BUFSIZ);
1257 vnc_zlog_debug_verbose(
1258 "%s: add vn=%s un=%s cost=%d life=%d",
1259 __func__, buf, buf2, new->prefix.cost,
1260 new->lifetime);
1261 }
1262 }
1263
1264 RFAPI_RIB_CHECK_COUNTS(0, (delete_list ? delete_list->count : 0));
1265
1266 if (delete_list) {
1267
1268 char buf[BUFSIZ];
1269 char buf2[BUFSIZ];
1270
1271 if (!printedprefix) {
1272 vnc_zlog_debug_verbose("%s: For prefix %s (d)",
1273 __func__, buf_prefix);
1274 }
1275 vnc_zlog_debug_verbose("%s: delete_list has %d elements",
1276 __func__, delete_list->count);
1277
1278 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1279 if (!CHECK_FLAG(bgp->rfapi_cfg->flags,
1280 BGP_VNC_CONFIG_RESPONSE_REMOVAL_DISABLE)) {
1281
1282 for (ALL_LIST_ELEMENTS(delete_list, node, nnode, ri)) {
1283
1284 struct rfapi_next_hop_entry *new;
1285 struct rfapi_info *ri_del;
1286
1287 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1288 new = XCALLOC(
1289 MTYPE_RFAPI_NEXTHOP,
1290 sizeof(struct rfapi_next_hop_entry));
1291 assert(new);
1292
1293 if (ri->rk.aux_prefix.family) {
1294 rfapiQprefix2Rprefix(&ri->rk.aux_prefix,
1295 &new->prefix);
1296 } else {
1297 new->prefix = hp;
1298 if (AFI_L2VPN == afi) {
1299 /* hp is 0; need to set length
1300 * to match AF of vn */
1301 new->prefix.length =
1302 (ri->rk.vn.family
1303 == AF_INET)
1304 ? 32
1305 : 128;
1306 }
1307 }
1308
1309 new->prefix.cost = ri->cost;
1310 new->lifetime = RFAPI_REMOVE_RESPONSE_LIFETIME;
1311 rfapiQprefix2Raddr(&ri->rk.vn,
1312 &new->vn_address);
1313 rfapiQprefix2Raddr(&ri->un, &new->un_address);
1314
1315 new->vn_options = ri->vn_options;
1316 ri->vn_options = NULL; /* option chain was
1317 transferred to NHL */
1318
1319 new->un_options = ri->un_options;
1320 ri->un_options = NULL; /* option chain was
1321 transferred to NHL */
1322
1323 if (*tail)
1324 (*tail)->next = new;
1325 *tail = new;
1326 if (!*head) {
1327 *head = new;
1328 }
1329 ++rfd->stat_count_nh_removal;
1330 ++bgp->rfapi->stat
1331 .count_updated_response_deletes;
1332
1333 rfapiRfapiIpAddr2Str(&new->vn_address, buf,
1334 BUFSIZ);
1335 rfapiRfapiIpAddr2Str(&new->un_address, buf2,
1336 BUFSIZ);
1337 vnc_zlog_debug_verbose(
1338 "%s: DEL vn=%s un=%s cost=%d life=%d",
1339 __func__, buf, buf2, new->prefix.cost,
1340 new->lifetime);
1341
1342 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1343 /*
1344 * Update/add to list of recent deletions at
1345 * this prefix
1346 */
1347 if (!rn->aggregate) {
1348 rn->aggregate = skiplist_new(
1349 0, rfapi_rib_key_cmp,
1350 (void (*)(void *))
1351 rfapi_info_free);
1352 route_lock_node(rn);
1353 }
1354 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1355
1356 /* sanity check lifetime */
1357 if (ri->lifetime
1358 > RFAPI_LIFETIME_INFINITE_WITHDRAW_DELAY)
1359 ri->lifetime =
1360 RFAPI_LIFETIME_INFINITE_WITHDRAW_DELAY;
1361
1362 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1363 /* cancel normal expire timer */
1364 if (ri->timer) {
1365 struct rfapi_rib_tcb *tcb;
1366
1367 tcb = ((struct thread *)ri->timer)->arg;
1368 thread_cancel(
1369 (struct thread *)ri->timer);
1370 XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
1371 ri->timer = NULL;
1372 }
1373 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1374
1375 /*
1376 * Look in "recently-deleted" list
1377 */
1378 if (skiplist_search(
1379 (struct skiplist *)(rn->aggregate),
1380 &ri->rk, (void **)&ri_del)) {
1381
1382 int rc;
1383
1384 RFAPI_RIB_CHECK_COUNTS(
1385 0, delete_list->count);
1386 /*
1387 * NOT in "recently-deleted" list
1388 */
1389 list_delete_node(
1390 delete_list,
1391 node); /* does not free ri */
1392 rc = skiplist_insert(
1393 (struct skiplist
1394 *)(rn->aggregate),
1395 &ri->rk, ri);
1396 assert(!rc);
1397
1398 RFAPI_RIB_CHECK_COUNTS(
1399 0, delete_list->count);
1400 rfapiRibStartTimer(rfd, ri, rn, 1);
1401 RFAPI_RIB_CHECK_COUNTS(
1402 0, delete_list->count);
1403 ri->last_sent_time = rfapi_time(NULL);
1404 #if DEBUG_RIB_SL_RD
1405 {
1406 char buf_rd[RD_ADDRSTRLEN];
1407
1408 vnc_zlog_debug_verbose(
1409 "%s: move route to recently deleted list, rd=%s",
1410 __func__,
1411 prefix_rd2str(
1412 &ri->rk.rd,
1413 buf_rd,
1414 sizeof(buf_rd)));
1415 }
1416 #endif
1417
1418 } else {
1419 /*
1420 * IN "recently-deleted" list
1421 */
1422 RFAPI_RIB_CHECK_COUNTS(
1423 0, delete_list->count);
1424 rfapiRibStartTimer(rfd, ri_del, rn, 1);
1425 RFAPI_RIB_CHECK_COUNTS(
1426 0, delete_list->count);
1427 ri->last_sent_time = rfapi_time(NULL);
1428 }
1429 }
1430 } else {
1431 vnc_zlog_debug_verbose(
1432 "%s: response removal disabled, omitting removals",
1433 __func__);
1434 }
1435
1436 delete_list->del = (void (*)(void *))rfapi_info_free;
1437 list_delete_and_null(&delete_list);
1438 }
1439
1440 RFAPI_RIB_CHECK_COUNTS(0, 0);
1441
1442 /*
1443 * Reset pending lists. The final route_unlock_node() will probably
1444 * cause the pending node to be released.
1445 */
1446 if (slPendPt) {
1447 skiplist_free(slPendPt);
1448 pn->aggregate = NULL;
1449 route_unlock_node(pn);
1450 }
1451 if (lPendCost) {
1452 list_delete_and_null(&lPendCost);
1453 pn->info = NULL;
1454 route_unlock_node(pn);
1455 }
1456 RFAPI_RIB_CHECK_COUNTS(0, 0);
1457
1458 if (rib_node_started_nonempty) {
1459 if (!rn->info) {
1460 RFAPI_RIB_PREFIX_COUNT_DECR(rfd, bgp->rfapi);
1461 }
1462 } else {
1463 if (rn->info) {
1464 RFAPI_RIB_PREFIX_COUNT_INCR(rfd, bgp->rfapi);
1465 }
1466 }
1467
1468 if (sendingsomeroutes)
1469 rfapiMonitorTimersRestart(rfd, &pn->p);
1470
1471 route_unlock_node(rn); /* route_node_get() */
1472
1473 RFAPI_RIB_CHECK_COUNTS(1, 0);
1474 }
1475
1476 /*
1477 * regardless of targets, construct a single callback by doing
1478 * only one traversal of the pending RIB
1479 *
1480 *
1481 * Do callback
1482 *
1483 */
1484 static void rib_do_callback_onepass(struct rfapi_descriptor *rfd, afi_t afi)
1485 {
1486 struct bgp *bgp = bgp_get_default();
1487 struct rfapi_next_hop_entry *head = NULL;
1488 struct rfapi_next_hop_entry *tail = NULL;
1489 struct route_node *rn;
1490
1491 #if DEBUG_L2_EXTRA
1492 vnc_zlog_debug_verbose("%s: rfd=%p, afi=%d", __func__, rfd, afi);
1493 #endif
1494
1495 if (!rfd->rib_pending[afi])
1496 return;
1497
1498 assert(bgp->rfapi);
1499
1500 for (rn = route_top(rfd->rib_pending[afi]); rn; rn = route_next(rn)) {
1501 process_pending_node(bgp, rfd, afi, rn, &head, &tail);
1502 }
1503
1504 if (head) {
1505 rfapi_response_cb_t *f;
1506
1507 #if DEBUG_NHL
1508 vnc_zlog_debug_verbose("%s: response callback NHL follows:",
1509 __func__);
1510 rfapiPrintNhl(NULL, head);
1511 #endif
1512
1513 if (rfd->response_cb)
1514 f = rfd->response_cb;
1515 else
1516 f = bgp->rfapi->rfp_methods.response_cb;
1517
1518 bgp->rfapi->flags |= RFAPI_INCALLBACK;
1519 vnc_zlog_debug_verbose("%s: invoking updated response callback",
1520 __func__);
1521 (*f)(head, rfd->cookie);
1522 bgp->rfapi->flags &= ~RFAPI_INCALLBACK;
1523 ++bgp->rfapi->response_updated_count;
1524 }
1525 }
1526
1527 static wq_item_status rfapiRibDoQueuedCallback(struct work_queue *wq,
1528 void *data)
1529 {
1530 struct rfapi_descriptor *rfd;
1531 afi_t afi;
1532 uint32_t queued_flag;
1533
1534 RFAPI_RIB_CHECK_COUNTS(1, 0);
1535
1536 rfd = ((struct rfapi_updated_responses_queue *)data)->rfd;
1537 afi = ((struct rfapi_updated_responses_queue *)data)->afi;
1538
1539 /* Make sure the HD wasn't closed after the work item was scheduled */
1540 if (rfapi_check(rfd))
1541 return WQ_SUCCESS;
1542
1543 rib_do_callback_onepass(rfd, afi);
1544
1545 queued_flag = RFAPI_QUEUED_FLAG(afi);
1546
1547 UNSET_FLAG(rfd->flags, queued_flag);
1548
1549 RFAPI_RIB_CHECK_COUNTS(1, 0);
1550
1551 return WQ_SUCCESS;
1552 }
1553
1554 static void rfapiRibQueueItemDelete(struct work_queue *wq, void *data)
1555 {
1556 XFREE(MTYPE_RFAPI_UPDATED_RESPONSE_QUEUE, data);
1557 }
1558
1559 static void updated_responses_queue_init(struct rfapi_descriptor *rfd)
1560 {
1561 if (rfd->updated_responses_queue)
1562 return;
1563
1564 rfd->updated_responses_queue =
1565 work_queue_new(bm->master, "rfapi updated responses");
1566 assert(rfd->updated_responses_queue);
1567
1568 rfd->updated_responses_queue->spec.workfunc = rfapiRibDoQueuedCallback;
1569 rfd->updated_responses_queue->spec.del_item_data =
1570 rfapiRibQueueItemDelete;
1571 rfd->updated_responses_queue->spec.max_retries = 0;
1572 rfd->updated_responses_queue->spec.hold = 1;
1573 }
1574
1575 /*
1576 * Called when an import table node is modified. Construct a
1577 * new complete nexthop list, sorted by cost (lowest first),
1578 * based on the import table node.
1579 *
1580 * Filter out duplicate nexthops (vn address). There should be
1581 * only one UN address per VN address from the point of view of
1582 * a given import table, so we can probably ignore UN addresses
1583 * while filtering.
1584 *
1585 * Based on rfapiNhlAddNodeRoutes()
1586 */
1587 void rfapiRibUpdatePendingNode(
1588 struct bgp *bgp, struct rfapi_descriptor *rfd,
1589 struct rfapi_import_table *it, /* needed for L2 */
1590 struct route_node *it_node, uint32_t lifetime)
1591 {
1592 struct prefix *prefix;
1593 struct bgp_info *bi;
1594 struct route_node *pn;
1595 afi_t afi;
1596 uint32_t queued_flag;
1597 int count = 0;
1598 char buf[PREFIX_STRLEN];
1599
1600 vnc_zlog_debug_verbose("%s: entry", __func__);
1601
1602 if (CHECK_FLAG(bgp->rfapi_cfg->flags, BGP_VNC_CONFIG_CALLBACK_DISABLE))
1603 return;
1604
1605 vnc_zlog_debug_verbose("%s: callbacks are not disabled", __func__);
1606
1607 RFAPI_RIB_CHECK_COUNTS(1, 0);
1608
1609 prefix = &it_node->p;
1610 afi = family2afi(prefix->family);
1611 prefix2str(prefix, buf, sizeof(buf));
1612 vnc_zlog_debug_verbose("%s: prefix=%s", __func__, buf);
1613
1614 pn = route_node_get(rfd->rib_pending[afi], prefix);
1615 assert(pn);
1616
1617 vnc_zlog_debug_verbose("%s: pn->info=%p, pn->aggregate=%p", __func__,
1618 pn->info, pn->aggregate);
1619
1620 if (pn->aggregate) {
1621 /*
1622 * free references into the rfapi_info structures before
1623 * freeing the structures themselves
1624 */
1625 skiplist_free((struct skiplist *)(pn->aggregate));
1626 pn->aggregate = NULL;
1627 route_unlock_node(pn); /* skiplist deleted */
1628 }
1629
1630
1631 /*
1632 * free the rfapi_info structures
1633 */
1634 if (pn->info) {
1635 if (pn->info != (void *)1) {
1636 list_delete_and_null((struct list **)(&pn->info));
1637 }
1638 pn->info = NULL;
1639 route_unlock_node(pn); /* linklist or 1 deleted */
1640 }
1641
1642 /*
1643 * The BIs in the import table are already sorted by cost
1644 */
1645 for (bi = it_node->info; bi; bi = bi->next) {
1646
1647 struct rfapi_info *ri;
1648 struct prefix pfx_nh;
1649
1650 if (!bi->attr) {
1651 /* shouldn't happen */
1652 /* TBD increment error stats counter */
1653 continue;
1654 }
1655 if (!bi->extra) {
1656 /* shouldn't happen */
1657 /* TBD increment error stats counter */
1658 continue;
1659 }
1660
1661 rfapiNexthop2Prefix(bi->attr, &pfx_nh);
1662
1663 /*
1664 * Omit route if nexthop is self
1665 */
1666 if (CHECK_FLAG(bgp->rfapi_cfg->flags,
1667 BGP_VNC_CONFIG_FILTER_SELF_FROM_RSP)) {
1668
1669 struct prefix pfx_vn;
1670
1671 assert(!rfapiRaddr2Qprefix(&rfd->vn_addr, &pfx_vn));
1672 if (prefix_same(&pfx_vn, &pfx_nh))
1673 continue;
1674 }
1675
1676 ri = rfapi_info_new();
1677 ri->rk.vn = pfx_nh;
1678 ri->rk.rd = bi->extra->vnc.import.rd;
1679 /*
1680 * If there is an auxiliary IP address (L2 can have it), copy it
1681 */
1682 if (bi->extra->vnc.import.aux_prefix.family) {
1683 ri->rk.aux_prefix = bi->extra->vnc.import.aux_prefix;
1684 }
1685
1686 if (rfapiGetUnAddrOfVpnBi(bi, &ri->un)) {
1687 rfapi_info_free(ri);
1688 continue;
1689 }
1690
1691 if (!pn->aggregate) {
1692 pn->aggregate =
1693 skiplist_new(0, rfapi_rib_key_cmp, NULL);
1694 route_lock_node(pn);
1695 }
1696
1697 /*
1698 * If we have already added this nexthop, the insert will fail.
1699 * Note that the skiplist key is a pointer INTO the rfapi_info
1700 * structure which will be added to the "info" list.
1701 * The skiplist entry VALUE is not used for anything but
1702 * might be useful during debugging.
1703 */
1704 if (skiplist_insert((struct skiplist *)pn->aggregate, &ri->rk,
1705 ri)) {
1706
1707 /*
1708 * duplicate
1709 */
1710 rfapi_info_free(ri);
1711 continue;
1712 }
1713
1714 rfapiRibBi2Ri(bi, ri, lifetime);
1715
1716 if (!pn->info) {
1717 pn->info = list_new();
1718 ((struct list *)(pn->info))->del =
1719 (void (*)(void *))rfapi_info_free;
1720 route_lock_node(pn);
1721 }
1722
1723 listnode_add((struct list *)(pn->info), ri);
1724 }
1725
1726 if (pn->info) {
1727 count = ((struct list *)(pn->info))->count;
1728 }
1729
1730 if (!count) {
1731 assert(!pn->info);
1732 assert(!pn->aggregate);
1733 pn->info = (void *)1; /* magic value means this node has no
1734 routes */
1735 route_lock_node(pn);
1736 }
1737
1738 route_unlock_node(pn); /* route_node_get */
1739
1740 queued_flag = RFAPI_QUEUED_FLAG(afi);
1741
1742 if (!CHECK_FLAG(rfd->flags, queued_flag)) {
1743
1744 struct rfapi_updated_responses_queue *urq;
1745
1746 urq = XCALLOC(MTYPE_RFAPI_UPDATED_RESPONSE_QUEUE,
1747 sizeof(struct rfapi_updated_responses_queue));
1748 assert(urq);
1749 if (!rfd->updated_responses_queue)
1750 updated_responses_queue_init(rfd);
1751
1752 SET_FLAG(rfd->flags, queued_flag);
1753 urq->rfd = rfd;
1754 urq->afi = afi;
1755 work_queue_add(rfd->updated_responses_queue, urq);
1756 }
1757 RFAPI_RIB_CHECK_COUNTS(1, 0);
1758 }
1759
1760 void rfapiRibUpdatePendingNodeSubtree(
1761 struct bgp *bgp, struct rfapi_descriptor *rfd,
1762 struct rfapi_import_table *it, struct route_node *it_node,
1763 struct route_node *omit_subtree, /* may be NULL */
1764 uint32_t lifetime)
1765 {
1766 /* FIXME: need to find a better way here to work without sticking our
1767 * hands in node->link */
1768 if (it_node->l_left && (it_node->l_left != omit_subtree)) {
1769 if (it_node->l_left->info)
1770 rfapiRibUpdatePendingNode(bgp, rfd, it, it_node->l_left,
1771 lifetime);
1772 rfapiRibUpdatePendingNodeSubtree(bgp, rfd, it, it_node->l_left,
1773 omit_subtree, lifetime);
1774 }
1775
1776 if (it_node->l_right && (it_node->l_right != omit_subtree)) {
1777 if (it_node->l_right->info)
1778 rfapiRibUpdatePendingNode(bgp, rfd, it,
1779 it_node->l_right, lifetime);
1780 rfapiRibUpdatePendingNodeSubtree(bgp, rfd, it, it_node->l_right,
1781 omit_subtree, lifetime);
1782 }
1783 }
1784
1785 /*
1786 * RETURN VALUE
1787 *
1788 * 0 allow prefix to be included in response
1789 * !0 don't allow prefix to be included in response
1790 */
1791 int rfapiRibFTDFilterRecentPrefix(
1792 struct rfapi_descriptor *rfd,
1793 struct route_node *it_rn, /* import table node */
1794 struct prefix *pfx_target_original) /* query target */
1795 {
1796 struct bgp *bgp = rfd->bgp;
1797 afi_t afi = family2afi(it_rn->p.family);
1798 time_t prefix_time;
1799 struct route_node *trn;
1800
1801 /*
1802 * Not in FTD mode, so allow prefix
1803 */
1804 if (bgp->rfapi_cfg->rfp_cfg.download_type != RFAPI_RFP_DOWNLOAD_FULL)
1805 return 0;
1806
1807 /*
1808 * TBD
1809 * This matches behavior of now-obsolete rfapiRibFTDFilterRecent(),
1810 * but we need to decide if that is correct.
1811 */
1812 if (it_rn->p.family == AF_ETHERNET)
1813 return 0;
1814
1815 #if DEBUG_FTD_FILTER_RECENT
1816 {
1817 char buf_pfx[PREFIX_STRLEN];
1818
1819 prefix2str(&it_rn->p, buf_pfx, sizeof(buf_pfx));
1820 vnc_zlog_debug_verbose("%s: prefix %s", __func__, buf_pfx);
1821 }
1822 #endif
1823
1824 /*
1825 * prefix covers target address, so allow prefix
1826 */
1827 if (prefix_match(&it_rn->p, pfx_target_original)) {
1828 #if DEBUG_FTD_FILTER_RECENT
1829 vnc_zlog_debug_verbose("%s: prefix covers target, allowed",
1830 __func__);
1831 #endif
1832 return 0;
1833 }
1834
1835 /*
1836 * check this NVE's timestamp for this prefix
1837 */
1838 trn = route_node_get(rfd->rsp_times[afi], &it_rn->p); /* locks trn */
1839 prefix_time = (time_t)trn->info;
1840 if (trn->lock > 1)
1841 route_unlock_node(trn);
1842
1843 #if DEBUG_FTD_FILTER_RECENT
1844 vnc_zlog_debug_verbose("%s: last sent time %lu, last allowed time %lu",
1845 __func__, prefix_time,
1846 rfd->ftd_last_allowed_time);
1847 #endif
1848
1849 /*
1850 * haven't sent this prefix, which doesn't cover target address,
1851 * to NVE since ftd_advertisement_interval, so OK to send now.
1852 */
1853 if (prefix_time <= rfd->ftd_last_allowed_time)
1854 return 0;
1855
1856 return 1;
1857 }
1858
1859 /*
1860 * Call when rfapi returns from rfapi_query() so the RIB reflects
1861 * the routes sent to the NVE before the first updated response
1862 *
1863 * Also: remove duplicates from response. Caller should use returned
1864 * value of nexthop chain.
1865 */
1866 struct rfapi_next_hop_entry *
1867 rfapiRibPreload(struct bgp *bgp, struct rfapi_descriptor *rfd,
1868 struct rfapi_next_hop_entry *response, int use_eth_resolution)
1869 {
1870 struct rfapi_next_hop_entry *nhp;
1871 struct rfapi_next_hop_entry *nhp_next;
1872 struct rfapi_next_hop_entry *head = NULL;
1873 struct rfapi_next_hop_entry *tail = NULL;
1874 time_t new_last_sent_time;
1875
1876 vnc_zlog_debug_verbose("%s: loading response=%p, use_eth_resolution=%d",
1877 __func__, response, use_eth_resolution);
1878
1879 new_last_sent_time = rfapi_time(NULL);
1880
1881 for (nhp = response; nhp; nhp = nhp_next) {
1882
1883 struct prefix pfx;
1884 struct rfapi_rib_key rk;
1885 afi_t afi;
1886 struct rfapi_info *ri;
1887 int need_insert;
1888 struct route_node *rn;
1889 int rib_node_started_nonempty = 0;
1890 struct route_node *trn;
1891 int allowed = 0;
1892
1893 /* save in case we delete nhp */
1894 nhp_next = nhp->next;
1895
1896 if (nhp->lifetime == RFAPI_REMOVE_RESPONSE_LIFETIME) {
1897 /*
1898 * weird, shouldn't happen
1899 */
1900 vnc_zlog_debug_verbose(
1901 "%s: got nhp->lifetime == RFAPI_REMOVE_RESPONSE_LIFETIME",
1902 __func__);
1903 continue;
1904 }
1905
1906
1907 if (use_eth_resolution) {
1908 /* get the prefix of the ethernet address in the L2
1909 * option */
1910 struct rfapi_l2address_option *pL2o;
1911 struct rfapi_vn_option *vo;
1912
1913 /*
1914 * Look for VN option of type
1915 * RFAPI_VN_OPTION_TYPE_L2ADDR
1916 */
1917 for (pL2o = NULL, vo = nhp->vn_options; vo;
1918 vo = vo->next) {
1919 if (RFAPI_VN_OPTION_TYPE_L2ADDR == vo->type) {
1920 pL2o = &vo->v.l2addr;
1921 break;
1922 }
1923 }
1924
1925 if (!pL2o) {
1926 /*
1927 * not supposed to happen
1928 */
1929 vnc_zlog_debug_verbose("%s: missing L2 info",
1930 __func__);
1931 continue;
1932 }
1933
1934 afi = AFI_L2VPN;
1935 rfapiL2o2Qprefix(pL2o, &pfx);
1936 } else {
1937 rfapiRprefix2Qprefix(&nhp->prefix, &pfx);
1938 afi = family2afi(pfx.family);
1939 }
1940
1941 /*
1942 * TBD for ethernet, rib must know the right way to distinguish
1943 * duplicate routes
1944 *
1945 * Current approach: prefix is key to radix tree; then
1946 * each prefix has a set of routes with unique VN addrs
1947 */
1948
1949 /*
1950 * Look up prefix in RIB
1951 */
1952 rn = route_node_get(rfd->rib[afi], &pfx); /* locks rn */
1953
1954 if (rn->info) {
1955 rib_node_started_nonempty = 1;
1956 } else {
1957 rn->info = skiplist_new(0, rfapi_rib_key_cmp, NULL);
1958 route_lock_node(rn);
1959 }
1960
1961 /*
1962 * Look up route at prefix
1963 */
1964 need_insert = 0;
1965 memset((void *)&rk, 0, sizeof(rk));
1966 assert(!rfapiRaddr2Qprefix(&nhp->vn_address, &rk.vn));
1967
1968 if (use_eth_resolution) {
1969 /* copy what came from aux_prefix to rk.aux_prefix */
1970 rfapiRprefix2Qprefix(&nhp->prefix, &rk.aux_prefix);
1971 if (RFAPI_0_PREFIX(&rk.aux_prefix)
1972 && RFAPI_HOST_PREFIX(&rk.aux_prefix)) {
1973 /* mark as "none" if nhp->prefix is 0/32 or
1974 * 0/128 */
1975 rk.aux_prefix.family = 0;
1976 }
1977 }
1978
1979 #if DEBUG_NHL
1980 {
1981 char str_vn[PREFIX_STRLEN];
1982 char str_aux_prefix[PREFIX_STRLEN];
1983
1984 str_vn[0] = 0;
1985 str_aux_prefix[0] = 0;
1986
1987 prefix2str(&rk.vn, str_vn, sizeof(str_vn));
1988 prefix2str(&rk.aux_prefix, str_aux_prefix,
1989 sizeof(str_aux_prefix));
1990
1991 if (!rk.aux_prefix.family) {
1992 }
1993 vnc_zlog_debug_verbose(
1994 "%s: rk.vn=%s rk.aux_prefix=%s", __func__,
1995 str_vn,
1996 (rk.aux_prefix.family ? str_aux_prefix : "-"));
1997 }
1998 vnc_zlog_debug_verbose(
1999 "%s: RIB skiplist for this prefix follows", __func__);
2000 rfapiRibShowRibSl(NULL, &rn->p, (struct skiplist *)rn->info);
2001 #endif
2002
2003
2004 if (!skiplist_search((struct skiplist *)rn->info, &rk,
2005 (void **)&ri)) {
2006 /*
2007 * Already have this route; make values match
2008 */
2009 rfapiFreeRfapiUnOptionChain(ri->un_options);
2010 ri->un_options = NULL;
2011 rfapiFreeRfapiVnOptionChain(ri->vn_options);
2012 ri->vn_options = NULL;
2013
2014 #if DEBUG_NHL
2015 vnc_zlog_debug_verbose("%s: found in RIB", __func__);
2016 #endif
2017
2018 /*
2019 * Filter duplicate routes from initial response.
2020 * Check timestamps to avoid wraparound problems
2021 */
2022 if ((ri->rsp_counter != rfd->rsp_counter)
2023 || (ri->last_sent_time != new_last_sent_time)) {
2024
2025 #if DEBUG_NHL
2026 vnc_zlog_debug_verbose(
2027 "%s: allowed due to counter/timestamp diff",
2028 __func__);
2029 #endif
2030 allowed = 1;
2031 }
2032
2033 } else {
2034
2035 #if DEBUG_NHL
2036 vnc_zlog_debug_verbose(
2037 "%s: allowed due to not yet in RIB", __func__);
2038 #endif
2039 /* not found: add new route to RIB */
2040 ri = rfapi_info_new();
2041 need_insert = 1;
2042 allowed = 1;
2043 }
2044
2045 ri->rk = rk;
2046 assert(!rfapiRaddr2Qprefix(&nhp->un_address, &ri->un));
2047 ri->cost = nhp->prefix.cost;
2048 ri->lifetime = nhp->lifetime;
2049 ri->vn_options = rfapiVnOptionsDup(nhp->vn_options);
2050 ri->rsp_counter = rfd->rsp_counter;
2051 ri->last_sent_time = rfapi_time(NULL);
2052
2053 if (need_insert) {
2054 int rc;
2055 rc = skiplist_insert((struct skiplist *)rn->info,
2056 &ri->rk, ri);
2057 assert(!rc);
2058 }
2059
2060 if (!rib_node_started_nonempty) {
2061 RFAPI_RIB_PREFIX_COUNT_INCR(rfd, bgp->rfapi);
2062 }
2063
2064 RFAPI_RIB_CHECK_COUNTS(0, 0);
2065 rfapiRibStartTimer(rfd, ri, rn, 0);
2066 RFAPI_RIB_CHECK_COUNTS(0, 0);
2067
2068 route_unlock_node(rn);
2069
2070 /*
2071 * update this NVE's timestamp for this prefix
2072 */
2073 trn = route_node_get(rfd->rsp_times[afi], &pfx); /* locks trn */
2074 trn->info = (void *)(uintptr_t)bgp_clock();
2075 if (trn->lock > 1)
2076 route_unlock_node(trn);
2077
2078 {
2079 char str_pfx[PREFIX_STRLEN];
2080 char str_pfx_vn[PREFIX_STRLEN];
2081
2082 prefix2str(&pfx, str_pfx, sizeof(str_pfx));
2083 prefix2str(&rk.vn, str_pfx_vn, sizeof(str_pfx_vn));
2084 vnc_zlog_debug_verbose(
2085 "%s: added pfx=%s nh[vn]=%s, cost=%u, lifetime=%u, allowed=%d",
2086 __func__, str_pfx, str_pfx_vn, nhp->prefix.cost,
2087 nhp->lifetime, allowed);
2088 }
2089
2090 if (allowed) {
2091 if (tail)
2092 (tail)->next = nhp;
2093 tail = nhp;
2094 if (!head) {
2095 head = nhp;
2096 }
2097 } else {
2098 rfapi_un_options_free(nhp->un_options);
2099 nhp->un_options = NULL;
2100 rfapi_vn_options_free(nhp->vn_options);
2101 nhp->vn_options = NULL;
2102
2103 XFREE(MTYPE_RFAPI_NEXTHOP, nhp);
2104 nhp = NULL;
2105 }
2106 }
2107
2108 if (tail)
2109 tail->next = NULL;
2110 return head;
2111 }
2112
2113 void rfapiRibPendingDeleteRoute(struct bgp *bgp, struct rfapi_import_table *it,
2114 afi_t afi, struct route_node *it_node)
2115 {
2116 struct rfapi_descriptor *rfd;
2117 struct listnode *node;
2118 char buf[PREFIX_STRLEN];
2119
2120 prefix2str(&it_node->p, buf, sizeof(buf));
2121 vnc_zlog_debug_verbose("%s: entry, it=%p, afi=%d, it_node=%p, pfx=%s",
2122 __func__, it, afi, it_node, buf);
2123
2124 if (AFI_L2VPN == afi) {
2125 /*
2126 * ethernet import tables are per-LNI and each ethernet monitor
2127 * identifies the rfd that owns it.
2128 */
2129 struct rfapi_monitor_eth *m;
2130 struct route_node *rn;
2131 struct skiplist *sl;
2132 void *cursor;
2133 int rc;
2134
2135 /*
2136 * route-specific monitors
2137 */
2138 if ((sl = RFAPI_MONITOR_ETH(it_node))) {
2139
2140 vnc_zlog_debug_verbose(
2141 "%s: route-specific skiplist: %p", __func__,
2142 sl);
2143
2144 for (cursor = NULL,
2145 rc = skiplist_next(sl, NULL, (void **)&m,
2146 (void **)&cursor);
2147 !rc; rc = skiplist_next(sl, NULL, (void **)&m,
2148 (void **)&cursor)) {
2149
2150 #if DEBUG_PENDING_DELETE_ROUTE
2151 vnc_zlog_debug_verbose("%s: eth monitor rfd=%p",
2152 __func__, m->rfd);
2153 #endif
2154 /*
2155 * If we have already sent a route with this
2156 * prefix to this
2157 * NVE, it's OK to send an update with the
2158 * delete
2159 */
2160 if ((rn = route_node_lookup(m->rfd->rib[afi],
2161 &it_node->p))) {
2162 rfapiRibUpdatePendingNode(
2163 bgp, m->rfd, it, it_node,
2164 m->rfd->response_lifetime);
2165 route_unlock_node(rn);
2166 }
2167 }
2168 }
2169
2170 /*
2171 * all-routes/FTD monitors
2172 */
2173 for (m = it->eth0_queries; m; m = m->next) {
2174 #if DEBUG_PENDING_DELETE_ROUTE
2175 vnc_zlog_debug_verbose("%s: eth0 monitor rfd=%p",
2176 __func__, m->rfd);
2177 #endif
2178 /*
2179 * If we have already sent a route with this prefix to
2180 * this
2181 * NVE, it's OK to send an update with the delete
2182 */
2183 if ((rn = route_node_lookup(m->rfd->rib[afi],
2184 &it_node->p))) {
2185 rfapiRibUpdatePendingNode(
2186 bgp, m->rfd, it, it_node,
2187 m->rfd->response_lifetime);
2188 }
2189 }
2190
2191 } else {
2192 /*
2193 * Find RFDs that reference this import table
2194 */
2195 for (ALL_LIST_ELEMENTS_RO(&bgp->rfapi->descriptors, node,
2196 rfd)) {
2197
2198 struct route_node *rn;
2199
2200 vnc_zlog_debug_verbose(
2201 "%s: comparing rfd(%p)->import_table=%p to it=%p",
2202 __func__, rfd, rfd->import_table, it);
2203
2204 if (rfd->import_table != it)
2205 continue;
2206
2207 vnc_zlog_debug_verbose("%s: matched rfd %p", __func__,
2208 rfd);
2209
2210 /*
2211 * If we have sent a response to this NVE with this
2212 * prefix
2213 * previously, we should send an updated response.
2214 */
2215 if ((rn = route_node_lookup(rfd->rib[afi],
2216 &it_node->p))) {
2217 rfapiRibUpdatePendingNode(
2218 bgp, rfd, it, it_node,
2219 rfd->response_lifetime);
2220 route_unlock_node(rn);
2221 }
2222 }
2223 }
2224 }
2225
2226 void rfapiRibShowResponsesSummary(void *stream)
2227 {
2228 int (*fp)(void *, const char *, ...);
2229 struct vty *vty;
2230 void *out;
2231 const char *vty_newline;
2232 struct bgp *bgp = bgp_get_default();
2233
2234 int nves = 0;
2235 int nves_with_nonempty_ribs = 0;
2236 struct rfapi_descriptor *rfd;
2237 struct listnode *node;
2238
2239 if (rfapiStream2Vty(stream, &fp, &vty, &out, &vty_newline) == 0)
2240 return;
2241 if (!bgp) {
2242 fp(out, "Unable to find default BGP instance\n");
2243 return;
2244 }
2245
2246 fp(out, "%-24s ", "Responses: (Prefixes)");
2247 fp(out, "%-8s %-8u ", "Active:", bgp->rfapi->rib_prefix_count_total);
2248 fp(out, "%-8s %-8u",
2249 "Maximum:", bgp->rfapi->rib_prefix_count_total_max);
2250 fp(out, "\n");
2251
2252 fp(out, "%-24s ", " (Updated)");
2253 fp(out, "%-8s %-8u ",
2254 "Update:", bgp->rfapi->stat.count_updated_response_updates);
2255 fp(out, "%-8s %-8u",
2256 "Remove:", bgp->rfapi->stat.count_updated_response_deletes);
2257 fp(out, "%-8s %-8u", "Total:",
2258 bgp->rfapi->stat.count_updated_response_updates
2259 + bgp->rfapi->stat.count_updated_response_deletes);
2260 fp(out, "\n");
2261
2262 fp(out, "%-24s ", " (NVEs)");
2263 for (ALL_LIST_ELEMENTS_RO(&bgp->rfapi->descriptors, node, rfd)) {
2264 ++nves;
2265 if (rfd->rib_prefix_count)
2266 ++nves_with_nonempty_ribs;
2267 }
2268 fp(out, "%-8s %-8u ", "Active:", nves_with_nonempty_ribs);
2269 fp(out, "%-8s %-8u", "Total:", nves);
2270 fp(out, "\n");
2271 }
2272
2273 void rfapiRibShowResponsesSummaryClear(void)
2274 {
2275 struct bgp *bgp = bgp_get_default();
2276
2277 bgp->rfapi->rib_prefix_count_total_max =
2278 bgp->rfapi->rib_prefix_count_total;
2279 }
2280
2281 static int print_rib_sl(int (*fp)(void *, const char *, ...), struct vty *vty,
2282 void *out, struct skiplist *sl, int deleted,
2283 char *str_pfx, int *printedprefix)
2284 {
2285 struct rfapi_info *ri;
2286 int rc;
2287 void *cursor;
2288 int routes_displayed = 0;
2289
2290 cursor = NULL;
2291 for (rc = skiplist_next(sl, NULL, (void **)&ri, &cursor); !rc;
2292 rc = skiplist_next(sl, NULL, (void **)&ri, &cursor)) {
2293
2294 char str_vn[PREFIX_STRLEN];
2295 char str_un[PREFIX_STRLEN];
2296 char str_lifetime[BUFSIZ];
2297 char str_age[BUFSIZ];
2298 char *p;
2299 char str_rd[RD_ADDRSTRLEN];
2300
2301 ++routes_displayed;
2302
2303 prefix2str(&ri->rk.vn, str_vn, sizeof(str_vn));
2304 p = index(str_vn, '/');
2305 if (p)
2306 *p = 0;
2307
2308 prefix2str(&ri->un, str_un, sizeof(str_un));
2309 p = index(str_un, '/');
2310 if (p)
2311 *p = 0;
2312
2313 rfapiFormatSeconds(ri->lifetime, str_lifetime, BUFSIZ);
2314 #if RFAPI_REGISTRATIONS_REPORT_AGE
2315 rfapiFormatAge(ri->last_sent_time, str_age, BUFSIZ);
2316 #else
2317 {
2318 time_t now = rfapi_time(NULL);
2319 time_t expire =
2320 ri->last_sent_time + (time_t)ri->lifetime;
2321 /* allow for delayed/async removal */
2322 rfapiFormatSeconds((expire > now ? expire - now : 1),
2323 str_age, BUFSIZ);
2324 }
2325 #endif
2326
2327 str_rd[0] = 0; /* start empty */
2328 #if DEBUG_RIB_SL_RD
2329 prefix_rd2str(&ri->rk.rd, str_rd, sizeof(str_rd));
2330 #endif
2331
2332 fp(out, " %c %-20s %-15s %-15s %-4u %-8s %-8s %s\n",
2333 deleted ? 'r' : ' ', *printedprefix ? "" : str_pfx, str_vn,
2334 str_un, ri->cost, str_lifetime, str_age, str_rd);
2335
2336 if (!*printedprefix)
2337 *printedprefix = 1;
2338 }
2339 return routes_displayed;
2340 }
2341
2342 #if DEBUG_NHL
2343 /*
2344 * This one is for debugging (set stream to NULL to send output to log)
2345 */
2346 static void rfapiRibShowRibSl(void *stream, struct prefix *pfx,
2347 struct skiplist *sl)
2348 {
2349 int (*fp)(void *, const char *, ...);
2350 struct vty *vty;
2351 void *out;
2352 const char *vty_newline;
2353
2354 int nhs_displayed = 0;
2355 char str_pfx[PREFIX_STRLEN];
2356 int printedprefix = 0;
2357
2358 if (rfapiStream2Vty(stream, &fp, &vty, &out, &vty_newline) == 0)
2359 return;
2360
2361 prefix2str(pfx, str_pfx, sizeof(str_pfx));
2362
2363 nhs_displayed +=
2364 print_rib_sl(fp, vty, out, sl, 0, str_pfx, &printedprefix);
2365 }
2366 #endif
2367
2368 void rfapiRibShowResponses(void *stream, struct prefix *pfx_match,
2369 int show_removed)
2370 {
2371 int (*fp)(void *, const char *, ...);
2372 struct vty *vty;
2373 void *out;
2374 const char *vty_newline;
2375
2376 struct rfapi_descriptor *rfd;
2377 struct listnode *node;
2378
2379 struct bgp *bgp = bgp_get_default();
2380 int printedheader = 0;
2381 int routes_total = 0;
2382 int nhs_total = 0;
2383 int prefixes_total = 0;
2384 int prefixes_displayed = 0;
2385 int nves_total = 0;
2386 int nves_with_routes = 0;
2387 int nves_displayed = 0;
2388 int routes_displayed = 0;
2389 int nhs_displayed = 0;
2390
2391 if (rfapiStream2Vty(stream, &fp, &vty, &out, &vty_newline) == 0)
2392 return;
2393 if (!bgp) {
2394 fp(out, "Unable to find default BGP instance\n");
2395 return;
2396 }
2397
2398 /*
2399 * loop over NVEs
2400 */
2401 for (ALL_LIST_ELEMENTS_RO(&bgp->rfapi->descriptors, node, rfd)) {
2402
2403 int printednve = 0;
2404 afi_t afi;
2405
2406 ++nves_total;
2407 if (rfd->rib_prefix_count)
2408 ++nves_with_routes;
2409
2410 for (afi = AFI_IP; afi < AFI_MAX; ++afi) {
2411
2412 struct route_node *rn;
2413
2414 if (!rfd->rib[afi])
2415 continue;
2416
2417 for (rn = route_top(rfd->rib[afi]); rn;
2418 rn = route_next(rn)) {
2419
2420 struct skiplist *sl;
2421 char str_pfx[PREFIX_STRLEN];
2422 int printedprefix = 0;
2423
2424 if (!show_removed)
2425 sl = rn->info;
2426 else
2427 sl = rn->aggregate;
2428
2429 if (!sl)
2430 continue;
2431
2432 routes_total++;
2433 nhs_total += skiplist_count(sl);
2434 ++prefixes_total;
2435
2436 if (pfx_match
2437 && !prefix_match(pfx_match, &rn->p)
2438 && !prefix_match(&rn->p, pfx_match))
2439 continue;
2440
2441 ++prefixes_displayed;
2442
2443 if (!printedheader) {
2444 ++printedheader;
2445
2446 fp(out, "\n[%s]\n",
2447 show_removed ? "Removed" : "Active");
2448 fp(out, "%-15s %-15s\n", "Querying VN",
2449 "Querying UN");
2450 fp(out,
2451 " %-20s %-15s %-15s %4s %-8s %-8s\n",
2452 "Prefix", "Registered VN",
2453 "Registered UN", "Cost", "Lifetime",
2454 #if RFAPI_REGISTRATIONS_REPORT_AGE
2455 "Age"
2456 #else
2457 "Remaining"
2458 #endif
2459 );
2460 }
2461 if (!printednve) {
2462 char str_vn[BUFSIZ];
2463 char str_un[BUFSIZ];
2464
2465 ++printednve;
2466 ++nves_displayed;
2467
2468 fp(out, "%-15s %-15s\n",
2469 rfapiRfapiIpAddr2Str(&rfd->vn_addr,
2470 str_vn, BUFSIZ),
2471 rfapiRfapiIpAddr2Str(&rfd->un_addr,
2472 str_un,
2473 BUFSIZ));
2474 }
2475 prefix2str(&rn->p, str_pfx, sizeof(str_pfx));
2476 // fp(out, " %s\n", buf); /* prefix */
2477
2478 routes_displayed++;
2479 nhs_displayed += print_rib_sl(
2480 fp, vty, out, sl, show_removed, str_pfx,
2481 &printedprefix);
2482 }
2483 }
2484 }
2485
2486 if (routes_total) {
2487 fp(out, "\n");
2488 fp(out, "Displayed %u NVEs, and %u out of %u %s prefixes",
2489 nves_displayed, routes_displayed, routes_total,
2490 show_removed ? "removed" : "active");
2491 if (nhs_displayed != routes_displayed
2492 || nhs_total != routes_total)
2493 fp(out, " with %u out of %u next hops", nhs_displayed,
2494 nhs_total);
2495 fp(out, "\n");
2496 }
2497 }
FRRouting mirror