]> 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
Merge branch 'master' into stylechecker
[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 **)(&pn->info));
515 }
516 pn->info = NULL;
517 /* linklist or 1 deleted */
518 route_unlock_node(pn);
519 }
520 }
521 }
522 if (rfd->rib[afi]) {
523 for (rn = route_top(rfd->rib[afi]); rn;
524 rn = route_next(rn)) {
525 if (rn->info) {
526
527 struct rfapi_info *ri;
528
529 while (0 == skiplist_first(
530 (struct skiplist *)
531 rn->info,
532 NULL,
533 (void **)&ri)) {
534
535 rfapi_info_free(ri);
536 skiplist_delete_first(
537 (struct skiplist *)
538 rn->info);
539 }
540 skiplist_free(
541 (struct skiplist *)rn->info);
542 rn->info = NULL;
543 route_unlock_node(rn);
544 RFAPI_RIB_PREFIX_COUNT_DECR(rfd,
545 bgp->rfapi);
546 }
547 if (rn->aggregate) {
548
549 struct rfapi_info *ri_del;
550
551 /* delete skiplist & contents */
552 while (!skiplist_first(
553 (struct skiplist
554 *)(rn->aggregate),
555 NULL, (void **)&ri_del)) {
556
557 /* sl->del takes care of ri_del
558 */
559 skiplist_delete_first((
560 struct skiplist
561 *)(rn->aggregate));
562 }
563 skiplist_free(
564 (struct skiplist
565 *)(rn->aggregate));
566
567 rn->aggregate = NULL;
568 route_unlock_node(rn);
569 }
570 }
571 }
572 }
573 if (rfd->updated_responses_queue) {
574 work_queue_free(rfd->updated_responses_queue);
575 rfd->updated_responses_queue = NULL;
576 }
577 }
578
579 /*
580 * Release all dynamically-allocated memory that is part of an HD's RIB
581 */
582 void rfapiRibFree(struct rfapi_descriptor *rfd)
583 {
584 afi_t afi;
585
586
587 /*
588 * NB rfd is typically detached from master list, so is not included
589 * in the count performed by RFAPI_RIB_CHECK_COUNTS
590 */
591
592 /*
593 * Free routes attached to radix trees
594 */
595 rfapiRibClear(rfd);
596
597 /* Now the uncounted rfapi_info's are freed, so the check should succeed
598 */
599 RFAPI_RIB_CHECK_COUNTS(1, 0);
600
601 /*
602 * Free radix trees
603 */
604 for (afi = AFI_IP; afi < AFI_MAX; ++afi) {
605 route_table_finish(rfd->rib_pending[afi]);
606 rfd->rib_pending[afi] = NULL;
607
608 route_table_finish(rfd->rib[afi]);
609 rfd->rib[afi] = NULL;
610
611 /* NB route_table_finish frees only prefix nodes, not chained
612 * info */
613 route_table_finish(rfd->rsp_times[afi]);
614 rfd->rib[afi] = NULL;
615 }
616 }
617
618 /*
619 * Copies struct bgp_info to struct rfapi_info, except for rk fields and un
620 */
621 static void rfapiRibBi2Ri(struct bgp_info *bi, struct rfapi_info *ri,
622 uint32_t lifetime)
623 {
624 struct bgp_attr_encap_subtlv *pEncap;
625
626 ri->cost = rfapiRfpCost(bi->attr);
627 ri->lifetime = lifetime;
628
629 /* This loop based on rfapiRouteInfo2NextHopEntry() */
630 for (pEncap = bi->attr->vnc_subtlvs; pEncap; pEncap = pEncap->next) {
631 struct bgp_tea_options *hop;
632
633 switch (pEncap->type) {
634 case BGP_VNC_SUBTLV_TYPE_LIFETIME:
635 /* use configured lifetime, not attr lifetime */
636 break;
637
638 case BGP_VNC_SUBTLV_TYPE_RFPOPTION:
639 hop = XCALLOC(MTYPE_BGP_TEA_OPTIONS,
640 sizeof(struct bgp_tea_options));
641 assert(hop);
642 hop->type = pEncap->value[0];
643 hop->length = pEncap->value[1];
644 hop->value = XCALLOC(MTYPE_BGP_TEA_OPTIONS_VALUE,
645 pEncap->length - 2);
646 assert(hop->value);
647 memcpy(hop->value, pEncap->value + 2,
648 pEncap->length - 2);
649 if (hop->length > pEncap->length - 2) {
650 zlog_warn(
651 "%s: VNC subtlv length mismatch: "
652 "RFP option says %d, attr says %d "
653 "(shrinking)",
654 __func__, hop->length,
655 pEncap->length - 2);
656 hop->length = pEncap->length - 2;
657 }
658 hop->next = ri->tea_options;
659 ri->tea_options = hop;
660 break;
661
662 default:
663 break;
664 }
665 }
666
667 rfapi_un_options_free(ri->un_options); /* maybe free old version */
668 ri->un_options = rfapi_encap_tlv_to_un_option(bi->attr);
669
670 /*
671 * VN options
672 */
673 if (bi->extra
674 && decode_rd_type(bi->extra->vnc.import.rd.val)
675 == RD_TYPE_VNC_ETH) {
676 /* ethernet route */
677
678 struct rfapi_vn_option *vo;
679
680 vo = XCALLOC(MTYPE_RFAPI_VN_OPTION,
681 sizeof(struct rfapi_vn_option));
682 assert(vo);
683
684 vo->type = RFAPI_VN_OPTION_TYPE_L2ADDR;
685
686 /* copy from RD already stored in bi, so we don't need it_node
687 */
688 memcpy(&vo->v.l2addr.macaddr, bi->extra->vnc.import.rd.val + 2,
689 ETH_ALEN);
690
691 (void)rfapiEcommunityGetLNI(bi->attr->ecommunity,
692 &vo->v.l2addr.logical_net_id);
693 (void)rfapiEcommunityGetEthernetTag(bi->attr->ecommunity,
694 &vo->v.l2addr.tag_id);
695
696 /* local_nve_id comes from RD */
697 vo->v.l2addr.local_nve_id = bi->extra->vnc.import.rd.val[1];
698
699 /* label comes from MP_REACH_NLRI label */
700 vo->v.l2addr.label = decode_label(&bi->extra->label[0]);
701
702 rfapi_vn_options_free(
703 ri->vn_options); /* maybe free old version */
704 ri->vn_options = vo;
705 }
706
707 /*
708 * If there is an auxiliary IP address (L2 can have it), copy it
709 */
710 if (bi->extra && bi->extra->vnc.import.aux_prefix.family) {
711 ri->rk.aux_prefix = bi->extra->vnc.import.aux_prefix;
712 }
713 }
714
715 /*
716 * rfapiRibPreloadBi
717 *
718 * Install route into NVE RIB model so as to be consistent with
719 * caller's response to rfapi_query().
720 *
721 * Also: return indication to caller whether this specific route
722 * should be included in the response to the NVE according to
723 * the following tests:
724 *
725 * 1. If there were prior duplicates of this route in this same
726 * query response, don't include the route.
727 *
728 * RETURN VALUE:
729 *
730 * 0 OK to include route in response
731 * !0 do not include route in response
732 */
733 int rfapiRibPreloadBi(
734 struct route_node *rfd_rib_node, /* NULL = don't preload or filter */
735 struct prefix *pfx_vn, struct prefix *pfx_un, uint32_t lifetime,
736 struct bgp_info *bi)
737 {
738 struct rfapi_descriptor *rfd;
739 struct skiplist *slRibPt = NULL;
740 struct rfapi_info *ori = NULL;
741 struct rfapi_rib_key rk;
742 struct route_node *trn;
743 afi_t afi;
744
745 if (!rfd_rib_node)
746 return 0;
747
748 afi = family2afi(rfd_rib_node->p.family);
749
750 rfd = (struct rfapi_descriptor *)(rfd_rib_node->table->info);
751
752 memset((void *)&rk, 0, sizeof(rk));
753 rk.vn = *pfx_vn;
754 rk.rd = bi->extra->vnc.import.rd;
755
756 /*
757 * If there is an auxiliary IP address (L2 can have it), copy it
758 */
759 if (bi->extra->vnc.import.aux_prefix.family) {
760 rk.aux_prefix = bi->extra->vnc.import.aux_prefix;
761 }
762
763 /*
764 * is this route already in NVE's RIB?
765 */
766 slRibPt = (struct skiplist *)rfd_rib_node->info;
767
768 if (slRibPt && !skiplist_search(slRibPt, &rk, (void **)&ori)) {
769
770 if ((ori->rsp_counter == rfd->rsp_counter)
771 && (ori->last_sent_time == rfd->rsp_time)) {
772 return -1; /* duplicate in this response */
773 }
774
775 /* found: update contents of existing route in RIB */
776 ori->un = *pfx_un;
777 rfapiRibBi2Ri(bi, ori, lifetime);
778 } else {
779 /* not found: add new route to RIB */
780 ori = rfapi_info_new();
781 ori->rk = rk;
782 ori->un = *pfx_un;
783 rfapiRibBi2Ri(bi, ori, lifetime);
784
785 if (!slRibPt) {
786 slRibPt = skiplist_new(0, rfapi_rib_key_cmp, NULL);
787 rfd_rib_node->info = slRibPt;
788 route_lock_node(rfd_rib_node);
789 RFAPI_RIB_PREFIX_COUNT_INCR(rfd, rfd->bgp->rfapi);
790 }
791 skiplist_insert(slRibPt, &ori->rk, ori);
792 }
793
794 ori->last_sent_time = rfapi_time(NULL);
795
796 /*
797 * poke timer
798 */
799 RFAPI_RIB_CHECK_COUNTS(0, 0);
800 rfapiRibStartTimer(rfd, ori, rfd_rib_node, 0);
801 RFAPI_RIB_CHECK_COUNTS(0, 0);
802
803 /*
804 * Update last sent time for prefix
805 */
806 trn = route_node_get(rfd->rsp_times[afi],
807 &rfd_rib_node->p); /* locks trn */
808 trn->info = (void *)(uintptr_t)bgp_clock();
809 if (trn->lock > 1)
810 route_unlock_node(trn);
811
812 return 0;
813 }
814
815 /*
816 * Frees rfapi_info items at node
817 *
818 * Adjust 'rib' and 'rib_pending' as follows:
819 *
820 * If rib_pending node->info is 1 (magic value):
821 * callback: NHL = RIB NHL with lifetime = withdraw_lifetime_value
822 * RIB = remove all routes at the node
823 * DONE
824 *
825 * For each item at rib node:
826 * if not present in pending node, move RIB item to "delete list"
827 *
828 * For each item at pending rib node:
829 * if present (same vn/un) in rib node with same lifetime & options, drop
830 * matching item from pending node
831 *
832 * For each remaining item at pending rib node, add or replace item
833 * at rib node.
834 *
835 * Construct NHL as concatenation of pending list + delete list
836 *
837 * Clear pending node
838 */
839 static void process_pending_node(struct bgp *bgp, struct rfapi_descriptor *rfd,
840 afi_t afi,
841 struct route_node *pn, /* pending node */
842 struct rfapi_next_hop_entry **head,
843 struct rfapi_next_hop_entry **tail)
844 {
845 struct listnode *node = NULL;
846 struct listnode *nnode = NULL;
847 struct rfapi_info *ri = NULL; /* happy valgrind */
848 struct rfapi_ip_prefix hp = {0}; /* pfx to put in NHE */
849 struct route_node *rn = NULL;
850 struct skiplist *slRibPt = NULL; /* rib list */
851 struct skiplist *slPendPt = NULL;
852 struct list *lPendCost = NULL;
853 struct list *delete_list = NULL;
854 int printedprefix = 0;
855 char buf_prefix[PREFIX_STRLEN];
856 int rib_node_started_nonempty = 0;
857 int sendingsomeroutes = 0;
858
859 #if DEBUG_PROCESS_PENDING_NODE
860 unsigned int count_rib_initial = 0;
861 unsigned int count_pend_vn_initial = 0;
862 unsigned int count_pend_cost_initial = 0;
863 #endif
864
865 assert(pn);
866 prefix2str(&pn->p, buf_prefix, sizeof(buf_prefix));
867 vnc_zlog_debug_verbose("%s: afi=%d, %s pn->info=%p", __func__, afi,
868 buf_prefix, pn->info);
869
870 if (AFI_L2VPN != afi) {
871 rfapiQprefix2Rprefix(&pn->p, &hp);
872 }
873
874 RFAPI_RIB_CHECK_COUNTS(1, 0);
875
876 /*
877 * Find corresponding RIB node
878 */
879 rn = route_node_get(rfd->rib[afi], &pn->p); /* locks rn */
880
881 /*
882 * RIB skiplist has key=rfapi_addr={vn,un}, val = rfapi_info,
883 * skiplist.del = NULL
884 */
885 slRibPt = (struct skiplist *)rn->info;
886 if (slRibPt)
887 rib_node_started_nonempty = 1;
888
889 slPendPt = (struct skiplist *)(pn->aggregate);
890 lPendCost = (struct list *)(pn->info);
891
892 #if DEBUG_PROCESS_PENDING_NODE
893 /* debugging */
894 if (slRibPt)
895 count_rib_initial = skiplist_count(slRibPt);
896
897 if (slPendPt)
898 count_pend_vn_initial = skiplist_count(slPendPt);
899
900 if (lPendCost && lPendCost != (struct list *)1)
901 count_pend_cost_initial = lPendCost->count;
902 #endif
903
904
905 /*
906 * Handle special case: delete all routes at prefix
907 */
908 if (lPendCost == (struct list *)1) {
909 vnc_zlog_debug_verbose("%s: lPendCost=1 => delete all",
910 __func__);
911 if (slRibPt && !skiplist_empty(slRibPt)) {
912 delete_list = list_new();
913 while (0
914 == skiplist_first(slRibPt, NULL, (void **)&ri)) {
915
916 char buf[PREFIX_STRLEN];
917 char buf2[PREFIX_STRLEN];
918
919 listnode_add(delete_list, ri);
920 vnc_zlog_debug_verbose(
921 "%s: after listnode_add, delete_list->count=%d",
922 __func__, delete_list->count);
923 rfapiFreeBgpTeaOptionChain(ri->tea_options);
924 ri->tea_options = NULL;
925
926 if (ri->timer) {
927 struct rfapi_rib_tcb *tcb;
928
929 tcb = ((struct thread *)ri->timer)->arg;
930 thread_cancel(ri->timer);
931 XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
932 ri->timer = NULL;
933 }
934
935 prefix2str(&ri->rk.vn, buf, sizeof(buf));
936 prefix2str(&ri->un, buf2, sizeof(buf2));
937 vnc_zlog_debug_verbose(
938 "%s: put dl pfx=%s vn=%s un=%s cost=%d life=%d vn_options=%p",
939 __func__, buf_prefix, buf, buf2,
940 ri->cost, ri->lifetime, ri->vn_options);
941
942 skiplist_delete_first(slRibPt);
943 }
944
945 assert(skiplist_empty(slRibPt));
946
947 skiplist_free(slRibPt);
948 rn->info = slRibPt = NULL;
949 route_unlock_node(rn);
950
951 lPendCost = pn->info = NULL;
952 route_unlock_node(pn);
953
954 goto callback;
955 }
956 if (slRibPt) {
957 skiplist_free(slRibPt);
958 rn->info = NULL;
959 route_unlock_node(rn);
960 }
961
962 assert(!slPendPt);
963 if (slPendPt) { /* TBD I think we can toss this block */
964 skiplist_free(slPendPt);
965 pn->aggregate = NULL;
966 route_unlock_node(pn);
967 }
968
969 pn->info = NULL;
970 route_unlock_node(pn);
971
972 route_unlock_node(rn); /* route_node_get() */
973
974 if (rib_node_started_nonempty) {
975 RFAPI_RIB_PREFIX_COUNT_DECR(rfd, bgp->rfapi);
976 }
977
978 RFAPI_RIB_CHECK_COUNTS(1, 0);
979
980 return;
981 }
982
983 vnc_zlog_debug_verbose("%s: lPendCost->count=%d, slRibPt->count=%d",
984 __func__,
985 (lPendCost ? (int)lPendCost->count : -1),
986 (slRibPt ? (int)slRibPt->count : -1));
987
988 /*
989 * Iterate over routes at RIB Node.
990 * If not found at Pending Node, delete from RIB Node and add to
991 * deletelist
992 * If found at Pending Node
993 * If identical rfapi_info, delete from Pending Node
994 */
995 if (slRibPt) {
996 void *cursor = NULL;
997 struct rfapi_info *ori;
998
999 /*
1000 * Iterate over RIB List
1001 *
1002 */
1003 while (!skiplist_next(slRibPt, NULL, (void **)&ori, &cursor)) {
1004
1005 if (skiplist_search(slPendPt, &ori->rk, (void **)&ri)) {
1006 /*
1007 * Not in Pending list, so it should be deleted
1008 */
1009 if (!delete_list)
1010 delete_list = list_new();
1011 listnode_add(delete_list, ori);
1012 rfapiFreeBgpTeaOptionChain(ori->tea_options);
1013 ori->tea_options = NULL;
1014 if (ori->timer) {
1015 struct rfapi_rib_tcb *tcb;
1016
1017 tcb = ((struct thread *)ori->timer)
1018 ->arg;
1019 thread_cancel(ori->timer);
1020 XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
1021 ori->timer = NULL;
1022 }
1023
1024 #if DEBUG_PROCESS_PENDING_NODE
1025 /* deleted from slRibPt below, after we're done
1026 * iterating */
1027 vnc_zlog_debug_verbose(
1028 "%s: slRibPt ri %p not matched in pending list, delete",
1029 __func__, ori);
1030 #endif
1031
1032 } else {
1033 /*
1034 * Found in pending list. If same lifetime,
1035 * cost, options,
1036 * then remove from pending list because the
1037 * route
1038 * hasn't changed.
1039 */
1040 if (!rfapi_info_cmp(ori, ri)) {
1041 skiplist_delete(slPendPt, &ri->rk,
1042 NULL);
1043 assert(lPendCost);
1044 if (lPendCost) {
1045 /* linear walk: might need
1046 * optimization */
1047 listnode_delete(lPendCost,
1048 ri); /* XXX
1049 doesn't
1050 free
1051 data!
1052 bug? */
1053 rfapi_info_free(
1054 ri); /* grr... */
1055 }
1056 }
1057 #if DEBUG_PROCESS_PENDING_NODE
1058 vnc_zlog_debug_verbose(
1059 "%s: slRibPt ri %p matched in pending list, %s",
1060 __func__, ori,
1061 (same ? "same info"
1062 : "different info"));
1063 #endif
1064 }
1065 }
1066 /*
1067 * Go back and delete items from RIB
1068 */
1069 if (delete_list) {
1070 for (ALL_LIST_ELEMENTS_RO(delete_list, node, ri)) {
1071 vnc_zlog_debug_verbose(
1072 "%s: deleting ri %p from slRibPt",
1073 __func__, ri);
1074 assert(!skiplist_delete(slRibPt, &ri->rk,
1075 NULL));
1076 }
1077 if (skiplist_empty(slRibPt)) {
1078 skiplist_free(slRibPt);
1079 slRibPt = rn->info = NULL;
1080 route_unlock_node(rn);
1081 }
1082 }
1083 }
1084
1085 RFAPI_RIB_CHECK_COUNTS(0, (delete_list ? delete_list->count : 0));
1086
1087 /*
1088 * Iterate over routes at Pending Node
1089 *
1090 * If {vn} found at RIB Node, update RIB Node route contents to match PN
1091 * If {vn} NOT found at RIB Node, add copy to RIB Node
1092 */
1093 if (lPendCost) {
1094 for (ALL_LIST_ELEMENTS_RO(lPendCost, node, ri)) {
1095
1096 struct rfapi_info *ori;
1097
1098 if (slRibPt
1099 && !skiplist_search(slRibPt, &ri->rk,
1100 (void **)&ori)) {
1101
1102 /* found: update contents of existing route in
1103 * RIB */
1104 ori->un = ri->un;
1105 ori->cost = ri->cost;
1106 ori->lifetime = ri->lifetime;
1107 rfapiFreeBgpTeaOptionChain(ori->tea_options);
1108 ori->tea_options =
1109 rfapiOptionsDup(ri->tea_options);
1110 ori->last_sent_time = rfapi_time(NULL);
1111
1112 rfapiFreeRfapiVnOptionChain(ori->vn_options);
1113 ori->vn_options =
1114 rfapiVnOptionsDup(ri->vn_options);
1115
1116 rfapiFreeRfapiUnOptionChain(ori->un_options);
1117 ori->un_options =
1118 rfapiUnOptionsDup(ri->un_options);
1119
1120 vnc_zlog_debug_verbose(
1121 "%s: matched lPendCost item %p in slRibPt, rewrote",
1122 __func__, ri);
1123
1124 } else {
1125
1126 char buf_rd[RD_ADDRSTRLEN];
1127
1128 /* not found: add new route to RIB */
1129 ori = rfapi_info_new();
1130 ori->rk = ri->rk;
1131 ori->un = ri->un;
1132 ori->cost = ri->cost;
1133 ori->lifetime = ri->lifetime;
1134 ori->tea_options =
1135 rfapiOptionsDup(ri->tea_options);
1136 ori->last_sent_time = rfapi_time(NULL);
1137 ori->vn_options =
1138 rfapiVnOptionsDup(ri->vn_options);
1139 ori->un_options =
1140 rfapiUnOptionsDup(ri->un_options);
1141
1142 if (!slRibPt) {
1143 slRibPt = skiplist_new(
1144 0, rfapi_rib_key_cmp, NULL);
1145 rn->info = slRibPt;
1146 route_lock_node(rn);
1147 }
1148 skiplist_insert(slRibPt, &ori->rk, ori);
1149
1150 #if DEBUG_RIB_SL_RD
1151 prefix_rd2str(&ori->rk.rd, buf_rd,
1152 sizeof(buf_rd));
1153 #else
1154 buf_rd[0] = 0;
1155 #endif
1156
1157 vnc_zlog_debug_verbose(
1158 "%s: nomatch lPendCost item %p in slRibPt, added (rd=%s)",
1159 __func__, ri, buf_rd);
1160 }
1161
1162 /*
1163 * poke timer
1164 */
1165 RFAPI_RIB_CHECK_COUNTS(
1166 0, (delete_list ? delete_list->count : 0));
1167 rfapiRibStartTimer(rfd, ori, rn, 0);
1168 RFAPI_RIB_CHECK_COUNTS(
1169 0, (delete_list ? delete_list->count : 0));
1170 }
1171 }
1172
1173
1174 callback:
1175 /*
1176 * Construct NHL as concatenation of pending list + delete list
1177 */
1178
1179
1180 RFAPI_RIB_CHECK_COUNTS(0, (delete_list ? delete_list->count : 0));
1181
1182 if (lPendCost) {
1183
1184 char buf[BUFSIZ];
1185 char buf2[BUFSIZ];
1186
1187 vnc_zlog_debug_verbose("%s: lPendCost->count now %d", __func__,
1188 lPendCost->count);
1189 vnc_zlog_debug_verbose("%s: For prefix %s (a)", __func__,
1190 buf_prefix);
1191 printedprefix = 1;
1192
1193 for (ALL_LIST_ELEMENTS(lPendCost, node, nnode, ri)) {
1194
1195 struct rfapi_next_hop_entry *new;
1196 struct route_node *trn;
1197
1198 new = XCALLOC(MTYPE_RFAPI_NEXTHOP,
1199 sizeof(struct rfapi_next_hop_entry));
1200 assert(new);
1201
1202 if (ri->rk.aux_prefix.family) {
1203 rfapiQprefix2Rprefix(&ri->rk.aux_prefix,
1204 &new->prefix);
1205 } else {
1206 new->prefix = hp;
1207 if (AFI_L2VPN == afi) {
1208 /* hp is 0; need to set length to match
1209 * AF of vn */
1210 new->prefix.length =
1211 (ri->rk.vn.family == AF_INET)
1212 ? 32
1213 : 128;
1214 }
1215 }
1216 new->prefix.cost = ri->cost;
1217 new->lifetime = ri->lifetime;
1218 rfapiQprefix2Raddr(&ri->rk.vn, &new->vn_address);
1219 rfapiQprefix2Raddr(&ri->un, &new->un_address);
1220 /* free option chain from ri */
1221 rfapiFreeBgpTeaOptionChain(ri->tea_options);
1222
1223 ri->tea_options =
1224 NULL; /* option chain was transferred to NHL */
1225
1226 new->vn_options = ri->vn_options;
1227 ri->vn_options =
1228 NULL; /* option chain was transferred to NHL */
1229
1230 new->un_options = ri->un_options;
1231 ri->un_options =
1232 NULL; /* option chain was transferred to NHL */
1233
1234 if (*tail)
1235 (*tail)->next = new;
1236 *tail = new;
1237 if (!*head) {
1238 *head = new;
1239 }
1240 sendingsomeroutes = 1;
1241
1242 ++rfd->stat_count_nh_reachable;
1243 ++bgp->rfapi->stat.count_updated_response_updates;
1244
1245 /*
1246 * update this NVE's timestamp for this prefix
1247 */
1248 trn = route_node_get(rfd->rsp_times[afi],
1249 &pn->p); /* locks trn */
1250 trn->info = (void *)(uintptr_t)bgp_clock();
1251 if (trn->lock > 1)
1252 route_unlock_node(trn);
1253
1254 rfapiRfapiIpAddr2Str(&new->vn_address, buf, BUFSIZ);
1255 rfapiRfapiIpAddr2Str(&new->un_address, buf2, BUFSIZ);
1256 vnc_zlog_debug_verbose(
1257 "%s: add vn=%s un=%s cost=%d life=%d",
1258 __func__, buf, buf2, new->prefix.cost,
1259 new->lifetime);
1260 }
1261 }
1262
1263 RFAPI_RIB_CHECK_COUNTS(0, (delete_list ? delete_list->count : 0));
1264
1265 if (delete_list) {
1266
1267 char buf[BUFSIZ];
1268 char buf2[BUFSIZ];
1269
1270 if (!printedprefix) {
1271 vnc_zlog_debug_verbose("%s: For prefix %s (d)",
1272 __func__, buf_prefix);
1273 }
1274 vnc_zlog_debug_verbose("%s: delete_list has %d elements",
1275 __func__, delete_list->count);
1276
1277 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1278 if (!CHECK_FLAG(bgp->rfapi_cfg->flags,
1279 BGP_VNC_CONFIG_RESPONSE_REMOVAL_DISABLE)) {
1280
1281 for (ALL_LIST_ELEMENTS(delete_list, node, nnode, ri)) {
1282
1283 struct rfapi_next_hop_entry *new;
1284 struct rfapi_info *ri_del;
1285
1286 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1287 new = XCALLOC(
1288 MTYPE_RFAPI_NEXTHOP,
1289 sizeof(struct rfapi_next_hop_entry));
1290 assert(new);
1291
1292 if (ri->rk.aux_prefix.family) {
1293 rfapiQprefix2Rprefix(&ri->rk.aux_prefix,
1294 &new->prefix);
1295 } else {
1296 new->prefix = hp;
1297 if (AFI_L2VPN == afi) {
1298 /* hp is 0; need to set length
1299 * to match AF of vn */
1300 new->prefix.length =
1301 (ri->rk.vn.family
1302 == AF_INET)
1303 ? 32
1304 : 128;
1305 }
1306 }
1307
1308 new->prefix.cost = ri->cost;
1309 new->lifetime = RFAPI_REMOVE_RESPONSE_LIFETIME;
1310 rfapiQprefix2Raddr(&ri->rk.vn,
1311 &new->vn_address);
1312 rfapiQprefix2Raddr(&ri->un, &new->un_address);
1313
1314 new->vn_options = ri->vn_options;
1315 ri->vn_options = NULL; /* option chain was
1316 transferred to NHL */
1317
1318 new->un_options = ri->un_options;
1319 ri->un_options = NULL; /* option chain was
1320 transferred to NHL */
1321
1322 if (*tail)
1323 (*tail)->next = new;
1324 *tail = new;
1325 if (!*head) {
1326 *head = new;
1327 }
1328 ++rfd->stat_count_nh_removal;
1329 ++bgp->rfapi->stat
1330 .count_updated_response_deletes;
1331
1332 rfapiRfapiIpAddr2Str(&new->vn_address, buf,
1333 BUFSIZ);
1334 rfapiRfapiIpAddr2Str(&new->un_address, buf2,
1335 BUFSIZ);
1336 vnc_zlog_debug_verbose(
1337 "%s: DEL vn=%s un=%s cost=%d life=%d",
1338 __func__, buf, buf2, new->prefix.cost,
1339 new->lifetime);
1340
1341 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1342 /*
1343 * Update/add to list of recent deletions at
1344 * this prefix
1345 */
1346 if (!rn->aggregate) {
1347 rn->aggregate = skiplist_new(
1348 0, rfapi_rib_key_cmp,
1349 (void (*)(void *))
1350 rfapi_info_free);
1351 route_lock_node(rn);
1352 }
1353 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1354
1355 /* sanity check lifetime */
1356 if (ri->lifetime
1357 > RFAPI_LIFETIME_INFINITE_WITHDRAW_DELAY)
1358 ri->lifetime =
1359 RFAPI_LIFETIME_INFINITE_WITHDRAW_DELAY;
1360
1361 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1362 /* cancel normal expire timer */
1363 if (ri->timer) {
1364 struct rfapi_rib_tcb *tcb;
1365
1366 tcb = ((struct thread *)ri->timer)->arg;
1367 thread_cancel(
1368 (struct thread *)ri->timer);
1369 XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
1370 ri->timer = NULL;
1371 }
1372 RFAPI_RIB_CHECK_COUNTS(0, delete_list->count);
1373
1374 /*
1375 * Look in "recently-deleted" list
1376 */
1377 if (skiplist_search(
1378 (struct skiplist *)(rn->aggregate),
1379 &ri->rk, (void **)&ri_del)) {
1380
1381 int rc;
1382
1383 RFAPI_RIB_CHECK_COUNTS(
1384 0, delete_list->count);
1385 /*
1386 * NOT in "recently-deleted" list
1387 */
1388 list_delete_node(
1389 delete_list,
1390 node); /* does not free ri */
1391 rc = skiplist_insert(
1392 (struct skiplist
1393 *)(rn->aggregate),
1394 &ri->rk, ri);
1395 assert(!rc);
1396
1397 RFAPI_RIB_CHECK_COUNTS(
1398 0, delete_list->count);
1399 rfapiRibStartTimer(rfd, ri, rn, 1);
1400 RFAPI_RIB_CHECK_COUNTS(
1401 0, delete_list->count);
1402 ri->last_sent_time = rfapi_time(NULL);
1403 #if DEBUG_RIB_SL_RD
1404 {
1405 char buf_rd[RD_ADDRSTRLEN];
1406
1407 vnc_zlog_debug_verbose(
1408 "%s: move route to recently deleted list, rd=%s",
1409 __func__,
1410 prefix_rd2str(&ri->rk.rd,
1411 buf_rd,
1412 sizeof(buf_rd)));
1413 }
1414 #endif
1415
1416 } else {
1417 /*
1418 * IN "recently-deleted" list
1419 */
1420 RFAPI_RIB_CHECK_COUNTS(
1421 0, delete_list->count);
1422 rfapiRibStartTimer(rfd, ri_del, rn, 1);
1423 RFAPI_RIB_CHECK_COUNTS(
1424 0, delete_list->count);
1425 ri->last_sent_time = rfapi_time(NULL);
1426 }
1427 }
1428 } else {
1429 vnc_zlog_debug_verbose(
1430 "%s: response removal disabled, omitting removals",
1431 __func__);
1432 }
1433
1434 delete_list->del = (void (*)(void *))rfapi_info_free;
1435 list_delete_and_null(&delete_list);
1436 }
1437
1438 RFAPI_RIB_CHECK_COUNTS(0, 0);
1439
1440 /*
1441 * Reset pending lists. The final route_unlock_node() will probably
1442 * cause the pending node to be released.
1443 */
1444 if (slPendPt) {
1445 skiplist_free(slPendPt);
1446 pn->aggregate = NULL;
1447 route_unlock_node(pn);
1448 }
1449 if (lPendCost) {
1450 list_delete_and_null(&lPendCost);
1451 pn->info = NULL;
1452 route_unlock_node(pn);
1453 }
1454 RFAPI_RIB_CHECK_COUNTS(0, 0);
1455
1456 if (rib_node_started_nonempty) {
1457 if (!rn->info) {
1458 RFAPI_RIB_PREFIX_COUNT_DECR(rfd, bgp->rfapi);
1459 }
1460 } else {
1461 if (rn->info) {
1462 RFAPI_RIB_PREFIX_COUNT_INCR(rfd, bgp->rfapi);
1463 }
1464 }
1465
1466 if (sendingsomeroutes)
1467 rfapiMonitorTimersRestart(rfd, &pn->p);
1468
1469 route_unlock_node(rn); /* route_node_get() */
1470
1471 RFAPI_RIB_CHECK_COUNTS(1, 0);
1472 }
1473
1474 /*
1475 * regardless of targets, construct a single callback by doing
1476 * only one traversal of the pending RIB
1477 *
1478 *
1479 * Do callback
1480 *
1481 */
1482 static void rib_do_callback_onepass(struct rfapi_descriptor *rfd, afi_t afi)
1483 {
1484 struct bgp *bgp = bgp_get_default();
1485 struct rfapi_next_hop_entry *head = NULL;
1486 struct rfapi_next_hop_entry *tail = NULL;
1487 struct route_node *rn;
1488
1489 #if DEBUG_L2_EXTRA
1490 vnc_zlog_debug_verbose("%s: rfd=%p, afi=%d", __func__, rfd, afi);
1491 #endif
1492
1493 if (!rfd->rib_pending[afi])
1494 return;
1495
1496 assert(bgp->rfapi);
1497
1498 for (rn = route_top(rfd->rib_pending[afi]); rn; rn = route_next(rn)) {
1499 process_pending_node(bgp, rfd, afi, rn, &head, &tail);
1500 }
1501
1502 if (head) {
1503 rfapi_response_cb_t *f;
1504
1505 #if DEBUG_NHL
1506 vnc_zlog_debug_verbose("%s: response callback NHL follows:",
1507 __func__);
1508 rfapiPrintNhl(NULL, head);
1509 #endif
1510
1511 if (rfd->response_cb)
1512 f = rfd->response_cb;
1513 else
1514 f = bgp->rfapi->rfp_methods.response_cb;
1515
1516 bgp->rfapi->flags |= RFAPI_INCALLBACK;
1517 vnc_zlog_debug_verbose("%s: invoking updated response callback",
1518 __func__);
1519 (*f)(head, rfd->cookie);
1520 bgp->rfapi->flags &= ~RFAPI_INCALLBACK;
1521 ++bgp->rfapi->response_updated_count;
1522 }
1523 }
1524
1525 static wq_item_status rfapiRibDoQueuedCallback(struct work_queue *wq,
1526 void *data)
1527 {
1528 struct rfapi_descriptor *rfd;
1529 afi_t afi;
1530 uint32_t queued_flag;
1531
1532 RFAPI_RIB_CHECK_COUNTS(1, 0);
1533
1534 rfd = ((struct rfapi_updated_responses_queue *)data)->rfd;
1535 afi = ((struct rfapi_updated_responses_queue *)data)->afi;
1536
1537 /* Make sure the HD wasn't closed after the work item was scheduled */
1538 if (rfapi_check(rfd))
1539 return WQ_SUCCESS;
1540
1541 rib_do_callback_onepass(rfd, afi);
1542
1543 queued_flag = RFAPI_QUEUED_FLAG(afi);
1544
1545 UNSET_FLAG(rfd->flags, queued_flag);
1546
1547 RFAPI_RIB_CHECK_COUNTS(1, 0);
1548
1549 return WQ_SUCCESS;
1550 }
1551
1552 static void rfapiRibQueueItemDelete(struct work_queue *wq, void *data)
1553 {
1554 XFREE(MTYPE_RFAPI_UPDATED_RESPONSE_QUEUE, data);
1555 }
1556
1557 static void updated_responses_queue_init(struct rfapi_descriptor *rfd)
1558 {
1559 if (rfd->updated_responses_queue)
1560 return;
1561
1562 rfd->updated_responses_queue =
1563 work_queue_new(bm->master, "rfapi updated responses");
1564 assert(rfd->updated_responses_queue);
1565
1566 rfd->updated_responses_queue->spec.workfunc = rfapiRibDoQueuedCallback;
1567 rfd->updated_responses_queue->spec.del_item_data =
1568 rfapiRibQueueItemDelete;
1569 rfd->updated_responses_queue->spec.max_retries = 0;
1570 rfd->updated_responses_queue->spec.hold = 1;
1571 }
1572
1573 /*
1574 * Called when an import table node is modified. Construct a
1575 * new complete nexthop list, sorted by cost (lowest first),
1576 * based on the import table node.
1577 *
1578 * Filter out duplicate nexthops (vn address). There should be
1579 * only one UN address per VN address from the point of view of
1580 * a given import table, so we can probably ignore UN addresses
1581 * while filtering.
1582 *
1583 * Based on rfapiNhlAddNodeRoutes()
1584 */
1585 void rfapiRibUpdatePendingNode(
1586 struct bgp *bgp, struct rfapi_descriptor *rfd,
1587 struct rfapi_import_table *it, /* needed for L2 */
1588 struct route_node *it_node, uint32_t lifetime)
1589 {
1590 struct prefix *prefix;
1591 struct bgp_info *bi;
1592 struct route_node *pn;
1593 afi_t afi;
1594 uint32_t queued_flag;
1595 int count = 0;
1596 char buf[PREFIX_STRLEN];
1597
1598 vnc_zlog_debug_verbose("%s: entry", __func__);
1599
1600 if (CHECK_FLAG(bgp->rfapi_cfg->flags, BGP_VNC_CONFIG_CALLBACK_DISABLE))
1601 return;
1602
1603 vnc_zlog_debug_verbose("%s: callbacks are not disabled", __func__);
1604
1605 RFAPI_RIB_CHECK_COUNTS(1, 0);
1606
1607 prefix = &it_node->p;
1608 afi = family2afi(prefix->family);
1609 prefix2str(prefix, buf, sizeof(buf));
1610 vnc_zlog_debug_verbose("%s: prefix=%s", __func__, buf);
1611
1612 pn = route_node_get(rfd->rib_pending[afi], prefix);
1613 assert(pn);
1614
1615 vnc_zlog_debug_verbose("%s: pn->info=%p, pn->aggregate=%p", __func__,
1616 pn->info, pn->aggregate);
1617
1618 if (pn->aggregate) {
1619 /*
1620 * free references into the rfapi_info structures before
1621 * freeing the structures themselves
1622 */
1623 skiplist_free((struct skiplist *)(pn->aggregate));
1624 pn->aggregate = NULL;
1625 route_unlock_node(pn); /* skiplist deleted */
1626 }
1627
1628
1629 /*
1630 * free the rfapi_info structures
1631 */
1632 if (pn->info) {
1633 if (pn->info != (void *)1) {
1634 list_delete_and_null((struct list **)(&pn->info));
1635 }
1636 pn->info = NULL;
1637 route_unlock_node(pn); /* linklist or 1 deleted */
1638 }
1639
1640 /*
1641 * The BIs in the import table are already sorted by cost
1642 */
1643 for (bi = it_node->info; bi; bi = bi->next) {
1644
1645 struct rfapi_info *ri;
1646 struct prefix pfx_nh;
1647
1648 if (!bi->attr) {
1649 /* shouldn't happen */
1650 /* TBD increment error stats counter */
1651 continue;
1652 }
1653 if (!bi->extra) {
1654 /* shouldn't happen */
1655 /* TBD increment error stats counter */
1656 continue;
1657 }
1658
1659 rfapiNexthop2Prefix(bi->attr, &pfx_nh);
1660
1661 /*
1662 * Omit route if nexthop is self
1663 */
1664 if (CHECK_FLAG(bgp->rfapi_cfg->flags,
1665 BGP_VNC_CONFIG_FILTER_SELF_FROM_RSP)) {
1666
1667 struct prefix pfx_vn;
1668
1669 assert(!rfapiRaddr2Qprefix(&rfd->vn_addr, &pfx_vn));
1670 if (prefix_same(&pfx_vn, &pfx_nh))
1671 continue;
1672 }
1673
1674 ri = rfapi_info_new();
1675 ri->rk.vn = pfx_nh;
1676 ri->rk.rd = bi->extra->vnc.import.rd;
1677 /*
1678 * If there is an auxiliary IP address (L2 can have it), copy it
1679 */
1680 if (bi->extra->vnc.import.aux_prefix.family) {
1681 ri->rk.aux_prefix = bi->extra->vnc.import.aux_prefix;
1682 }
1683
1684 if (rfapiGetUnAddrOfVpnBi(bi, &ri->un)) {
1685 rfapi_info_free(ri);
1686 continue;
1687 }
1688
1689 if (!pn->aggregate) {
1690 pn->aggregate =
1691 skiplist_new(0, rfapi_rib_key_cmp, NULL);
1692 route_lock_node(pn);
1693 }
1694
1695 /*
1696 * If we have already added this nexthop, the insert will fail.
1697 * Note that the skiplist key is a pointer INTO the rfapi_info
1698 * structure which will be added to the "info" list.
1699 * The skiplist entry VALUE is not used for anything but
1700 * might be useful during debugging.
1701 */
1702 if (skiplist_insert((struct skiplist *)pn->aggregate, &ri->rk,
1703 ri)) {
1704
1705 /*
1706 * duplicate
1707 */
1708 rfapi_info_free(ri);
1709 continue;
1710 }
1711
1712 rfapiRibBi2Ri(bi, ri, lifetime);
1713
1714 if (!pn->info) {
1715 pn->info = list_new();
1716 ((struct list *)(pn->info))->del =
1717 (void (*)(void *))rfapi_info_free;
1718 route_lock_node(pn);
1719 }
1720
1721 listnode_add((struct list *)(pn->info), ri);
1722 }
1723
1724 if (pn->info) {
1725 count = ((struct list *)(pn->info))->count;
1726 }
1727
1728 if (!count) {
1729 assert(!pn->info);
1730 assert(!pn->aggregate);
1731 pn->info = (void *)1; /* magic value means this node has no
1732 routes */
1733 route_lock_node(pn);
1734 }
1735
1736 route_unlock_node(pn); /* route_node_get */
1737
1738 queued_flag = RFAPI_QUEUED_FLAG(afi);
1739
1740 if (!CHECK_FLAG(rfd->flags, queued_flag)) {
1741
1742 struct rfapi_updated_responses_queue *urq;
1743
1744 urq = XCALLOC(MTYPE_RFAPI_UPDATED_RESPONSE_QUEUE,
1745 sizeof(struct rfapi_updated_responses_queue));
1746 assert(urq);
1747 if (!rfd->updated_responses_queue)
1748 updated_responses_queue_init(rfd);
1749
1750 SET_FLAG(rfd->flags, queued_flag);
1751 urq->rfd = rfd;
1752 urq->afi = afi;
1753 work_queue_add(rfd->updated_responses_queue, urq);
1754 }
1755 RFAPI_RIB_CHECK_COUNTS(1, 0);
1756 }
1757
1758 void rfapiRibUpdatePendingNodeSubtree(
1759 struct bgp *bgp, struct rfapi_descriptor *rfd,
1760 struct rfapi_import_table *it, struct route_node *it_node,
1761 struct route_node *omit_subtree, /* may be NULL */
1762 uint32_t lifetime)
1763 {
1764 /* FIXME: need to find a better way here to work without sticking our
1765 * hands in node->link */
1766 if (it_node->l_left && (it_node->l_left != omit_subtree)) {
1767 if (it_node->l_left->info)
1768 rfapiRibUpdatePendingNode(bgp, rfd, it, it_node->l_left,
1769 lifetime);
1770 rfapiRibUpdatePendingNodeSubtree(bgp, rfd, it, it_node->l_left,
1771 omit_subtree, lifetime);
1772 }
1773
1774 if (it_node->l_right && (it_node->l_right != omit_subtree)) {
1775 if (it_node->l_right->info)
1776 rfapiRibUpdatePendingNode(bgp, rfd, it,
1777 it_node->l_right, lifetime);
1778 rfapiRibUpdatePendingNodeSubtree(bgp, rfd, it, it_node->l_right,
1779 omit_subtree, lifetime);
1780 }
1781 }
1782
1783 /*
1784 * RETURN VALUE
1785 *
1786 * 0 allow prefix to be included in response
1787 * !0 don't allow prefix to be included in response
1788 */
1789 int rfapiRibFTDFilterRecentPrefix(
1790 struct rfapi_descriptor *rfd,
1791 struct route_node *it_rn, /* import table node */
1792 struct prefix *pfx_target_original) /* query target */
1793 {
1794 struct bgp *bgp = rfd->bgp;
1795 afi_t afi = family2afi(it_rn->p.family);
1796 time_t prefix_time;
1797 struct route_node *trn;
1798
1799 /*
1800 * Not in FTD mode, so allow prefix
1801 */
1802 if (bgp->rfapi_cfg->rfp_cfg.download_type != RFAPI_RFP_DOWNLOAD_FULL)
1803 return 0;
1804
1805 /*
1806 * TBD
1807 * This matches behavior of now-obsolete rfapiRibFTDFilterRecent(),
1808 * but we need to decide if that is correct.
1809 */
1810 if (it_rn->p.family == AF_ETHERNET)
1811 return 0;
1812
1813 #if DEBUG_FTD_FILTER_RECENT
1814 {
1815 char buf_pfx[PREFIX_STRLEN];
1816
1817 prefix2str(&it_rn->p, buf_pfx, sizeof(buf_pfx));
1818 vnc_zlog_debug_verbose("%s: prefix %s", __func__, buf_pfx);
1819 }
1820 #endif
1821
1822 /*
1823 * prefix covers target address, so allow prefix
1824 */
1825 if (prefix_match(&it_rn->p, pfx_target_original)) {
1826 #if DEBUG_FTD_FILTER_RECENT
1827 vnc_zlog_debug_verbose("%s: prefix covers target, allowed",
1828 __func__);
1829 #endif
1830 return 0;
1831 }
1832
1833 /*
1834 * check this NVE's timestamp for this prefix
1835 */
1836 trn = route_node_get(rfd->rsp_times[afi], &it_rn->p); /* locks trn */
1837 prefix_time = (time_t)trn->info;
1838 if (trn->lock > 1)
1839 route_unlock_node(trn);
1840
1841 #if DEBUG_FTD_FILTER_RECENT
1842 vnc_zlog_debug_verbose("%s: last sent time %lu, last allowed time %lu",
1843 __func__, prefix_time,
1844 rfd->ftd_last_allowed_time);
1845 #endif
1846
1847 /*
1848 * haven't sent this prefix, which doesn't cover target address,
1849 * to NVE since ftd_advertisement_interval, so OK to send now.
1850 */
1851 if (prefix_time <= rfd->ftd_last_allowed_time)
1852 return 0;
1853
1854 return 1;
1855 }
1856
1857 /*
1858 * Call when rfapi returns from rfapi_query() so the RIB reflects
1859 * the routes sent to the NVE before the first updated response
1860 *
1861 * Also: remove duplicates from response. Caller should use returned
1862 * value of nexthop chain.
1863 */
1864 struct rfapi_next_hop_entry *
1865 rfapiRibPreload(struct bgp *bgp, struct rfapi_descriptor *rfd,
1866 struct rfapi_next_hop_entry *response, int use_eth_resolution)
1867 {
1868 struct rfapi_next_hop_entry *nhp;
1869 struct rfapi_next_hop_entry *nhp_next;
1870 struct rfapi_next_hop_entry *head = NULL;
1871 struct rfapi_next_hop_entry *tail = NULL;
1872 time_t new_last_sent_time;
1873
1874 vnc_zlog_debug_verbose("%s: loading response=%p, use_eth_resolution=%d",
1875 __func__, response, use_eth_resolution);
1876
1877 new_last_sent_time = rfapi_time(NULL);
1878
1879 for (nhp = response; nhp; nhp = nhp_next) {
1880
1881 struct prefix pfx;
1882 struct rfapi_rib_key rk;
1883 afi_t afi;
1884 struct rfapi_info *ri;
1885 int need_insert;
1886 struct route_node *rn;
1887 int rib_node_started_nonempty = 0;
1888 struct route_node *trn;
1889 int allowed = 0;
1890
1891 /* save in case we delete nhp */
1892 nhp_next = nhp->next;
1893
1894 if (nhp->lifetime == RFAPI_REMOVE_RESPONSE_LIFETIME) {
1895 /*
1896 * weird, shouldn't happen
1897 */
1898 vnc_zlog_debug_verbose(
1899 "%s: got nhp->lifetime == RFAPI_REMOVE_RESPONSE_LIFETIME",
1900 __func__);
1901 continue;
1902 }
1903
1904
1905 if (use_eth_resolution) {
1906 /* get the prefix of the ethernet address in the L2
1907 * option */
1908 struct rfapi_l2address_option *pL2o;
1909 struct rfapi_vn_option *vo;
1910
1911 /*
1912 * Look for VN option of type
1913 * RFAPI_VN_OPTION_TYPE_L2ADDR
1914 */
1915 for (pL2o = NULL, vo = nhp->vn_options; vo;
1916 vo = vo->next) {
1917 if (RFAPI_VN_OPTION_TYPE_L2ADDR == vo->type) {
1918 pL2o = &vo->v.l2addr;
1919 break;
1920 }
1921 }
1922
1923 if (!pL2o) {
1924 /*
1925 * not supposed to happen
1926 */
1927 vnc_zlog_debug_verbose("%s: missing L2 info",
1928 __func__);
1929 continue;
1930 }
1931
1932 afi = AFI_L2VPN;
1933 rfapiL2o2Qprefix(pL2o, &pfx);
1934 } else {
1935 rfapiRprefix2Qprefix(&nhp->prefix, &pfx);
1936 afi = family2afi(pfx.family);
1937 }
1938
1939 /*
1940 * TBD for ethernet, rib must know the right way to distinguish
1941 * duplicate routes
1942 *
1943 * Current approach: prefix is key to radix tree; then
1944 * each prefix has a set of routes with unique VN addrs
1945 */
1946
1947 /*
1948 * Look up prefix in RIB
1949 */
1950 rn = route_node_get(rfd->rib[afi], &pfx); /* locks rn */
1951
1952 if (rn->info) {
1953 rib_node_started_nonempty = 1;
1954 } else {
1955 rn->info = skiplist_new(0, rfapi_rib_key_cmp, NULL);
1956 route_lock_node(rn);
1957 }
1958
1959 /*
1960 * Look up route at prefix
1961 */
1962 need_insert = 0;
1963 memset((void *)&rk, 0, sizeof(rk));
1964 assert(!rfapiRaddr2Qprefix(&nhp->vn_address, &rk.vn));
1965
1966 if (use_eth_resolution) {
1967 /* copy what came from aux_prefix to rk.aux_prefix */
1968 rfapiRprefix2Qprefix(&nhp->prefix, &rk.aux_prefix);
1969 if (RFAPI_0_PREFIX(&rk.aux_prefix)
1970 && RFAPI_HOST_PREFIX(&rk.aux_prefix)) {
1971 /* mark as "none" if nhp->prefix is 0/32 or
1972 * 0/128 */
1973 rk.aux_prefix.family = 0;
1974 }
1975 }
1976
1977 #if DEBUG_NHL
1978 {
1979 char str_vn[PREFIX_STRLEN];
1980 char str_aux_prefix[PREFIX_STRLEN];
1981
1982 str_vn[0] = 0;
1983 str_aux_prefix[0] = 0;
1984
1985 prefix2str(&rk.vn, str_vn, sizeof(str_vn));
1986 prefix2str(&rk.aux_prefix, str_aux_prefix,
1987 sizeof(str_aux_prefix));
1988
1989 if (!rk.aux_prefix.family) {
1990 }
1991 vnc_zlog_debug_verbose(
1992 "%s: rk.vn=%s rk.aux_prefix=%s", __func__,
1993 str_vn,
1994 (rk.aux_prefix.family ? str_aux_prefix : "-"));
1995 }
1996 vnc_zlog_debug_verbose(
1997 "%s: RIB skiplist for this prefix follows", __func__);
1998 rfapiRibShowRibSl(NULL, &rn->p, (struct skiplist *)rn->info);
1999 #endif
2000
2001
2002 if (!skiplist_search((struct skiplist *)rn->info, &rk,
2003 (void **)&ri)) {
2004 /*
2005 * Already have this route; make values match
2006 */
2007 rfapiFreeRfapiUnOptionChain(ri->un_options);
2008 ri->un_options = NULL;
2009 rfapiFreeRfapiVnOptionChain(ri->vn_options);
2010 ri->vn_options = NULL;
2011
2012 #if DEBUG_NHL
2013 vnc_zlog_debug_verbose("%s: found in RIB", __func__);
2014 #endif
2015
2016 /*
2017 * Filter duplicate routes from initial response.
2018 * Check timestamps to avoid wraparound problems
2019 */
2020 if ((ri->rsp_counter != rfd->rsp_counter)
2021 || (ri->last_sent_time != new_last_sent_time)) {
2022
2023 #if DEBUG_NHL
2024 vnc_zlog_debug_verbose(
2025 "%s: allowed due to counter/timestamp diff",
2026 __func__);
2027 #endif
2028 allowed = 1;
2029 }
2030
2031 } else {
2032
2033 #if DEBUG_NHL
2034 vnc_zlog_debug_verbose(
2035 "%s: allowed due to not yet in RIB", __func__);
2036 #endif
2037 /* not found: add new route to RIB */
2038 ri = rfapi_info_new();
2039 need_insert = 1;
2040 allowed = 1;
2041 }
2042
2043 ri->rk = rk;
2044 assert(!rfapiRaddr2Qprefix(&nhp->un_address, &ri->un));
2045 ri->cost = nhp->prefix.cost;
2046 ri->lifetime = nhp->lifetime;
2047 ri->vn_options = rfapiVnOptionsDup(nhp->vn_options);
2048 ri->rsp_counter = rfd->rsp_counter;
2049 ri->last_sent_time = rfapi_time(NULL);
2050
2051 if (need_insert) {
2052 int rc;
2053 rc = skiplist_insert((struct skiplist *)rn->info,
2054 &ri->rk, ri);
2055 assert(!rc);
2056 }
2057
2058 if (!rib_node_started_nonempty) {
2059 RFAPI_RIB_PREFIX_COUNT_INCR(rfd, bgp->rfapi);
2060 }
2061
2062 RFAPI_RIB_CHECK_COUNTS(0, 0);
2063 rfapiRibStartTimer(rfd, ri, rn, 0);
2064 RFAPI_RIB_CHECK_COUNTS(0, 0);
2065
2066 route_unlock_node(rn);
2067
2068 /*
2069 * update this NVE's timestamp for this prefix
2070 */
2071 trn = route_node_get(rfd->rsp_times[afi], &pfx); /* locks trn */
2072 trn->info = (void *)(uintptr_t)bgp_clock();
2073 if (trn->lock > 1)
2074 route_unlock_node(trn);
2075
2076 {
2077 char str_pfx[PREFIX_STRLEN];
2078 char str_pfx_vn[PREFIX_STRLEN];
2079
2080 prefix2str(&pfx, str_pfx, sizeof(str_pfx));
2081 prefix2str(&rk.vn, str_pfx_vn, sizeof(str_pfx_vn));
2082 vnc_zlog_debug_verbose(
2083 "%s: added pfx=%s nh[vn]=%s, cost=%u, lifetime=%u, allowed=%d",
2084 __func__, str_pfx, str_pfx_vn, nhp->prefix.cost,
2085 nhp->lifetime, allowed);
2086 }
2087
2088 if (allowed) {
2089 if (tail)
2090 (tail)->next = nhp;
2091 tail = nhp;
2092 if (!head) {
2093 head = nhp;
2094 }
2095 } else {
2096 rfapi_un_options_free(nhp->un_options);
2097 nhp->un_options = NULL;
2098 rfapi_vn_options_free(nhp->vn_options);
2099 nhp->vn_options = NULL;
2100
2101 XFREE(MTYPE_RFAPI_NEXTHOP, nhp);
2102 nhp = NULL;
2103 }
2104 }
2105
2106 if (tail)
2107 tail->next = NULL;
2108 return head;
2109 }
2110
2111 void rfapiRibPendingDeleteRoute(struct bgp *bgp, struct rfapi_import_table *it,
2112 afi_t afi, struct route_node *it_node)
2113 {
2114 struct rfapi_descriptor *rfd;
2115 struct listnode *node;
2116 char buf[PREFIX_STRLEN];
2117
2118 prefix2str(&it_node->p, buf, sizeof(buf));
2119 vnc_zlog_debug_verbose("%s: entry, it=%p, afi=%d, it_node=%p, pfx=%s",
2120 __func__, it, afi, it_node, buf);
2121
2122 if (AFI_L2VPN == afi) {
2123 /*
2124 * ethernet import tables are per-LNI and each ethernet monitor
2125 * identifies the rfd that owns it.
2126 */
2127 struct rfapi_monitor_eth *m;
2128 struct route_node *rn;
2129 struct skiplist *sl;
2130 void *cursor;
2131 int rc;
2132
2133 /*
2134 * route-specific monitors
2135 */
2136 if ((sl = RFAPI_MONITOR_ETH(it_node))) {
2137
2138 vnc_zlog_debug_verbose(
2139 "%s: route-specific skiplist: %p", __func__,
2140 sl);
2141
2142 for (cursor = NULL,
2143 rc = skiplist_next(sl, NULL, (void **)&m,
2144 (void **)&cursor);
2145 !rc; rc = skiplist_next(sl, NULL, (void **)&m,
2146 (void **)&cursor)) {
2147
2148 #if DEBUG_PENDING_DELETE_ROUTE
2149 vnc_zlog_debug_verbose("%s: eth monitor rfd=%p",
2150 __func__, m->rfd);
2151 #endif
2152 /*
2153 * If we have already sent a route with this
2154 * prefix to this
2155 * NVE, it's OK to send an update with the
2156 * delete
2157 */
2158 if ((rn = route_node_lookup(m->rfd->rib[afi],
2159 &it_node->p))) {
2160 rfapiRibUpdatePendingNode(
2161 bgp, m->rfd, it, it_node,
2162 m->rfd->response_lifetime);
2163 route_unlock_node(rn);
2164 }
2165 }
2166 }
2167
2168 /*
2169 * all-routes/FTD monitors
2170 */
2171 for (m = it->eth0_queries; m; m = m->next) {
2172 #if DEBUG_PENDING_DELETE_ROUTE
2173 vnc_zlog_debug_verbose("%s: eth0 monitor rfd=%p",
2174 __func__, m->rfd);
2175 #endif
2176 /*
2177 * If we have already sent a route with this prefix to
2178 * this
2179 * NVE, it's OK to send an update with the delete
2180 */
2181 if ((rn = route_node_lookup(m->rfd->rib[afi],
2182 &it_node->p))) {
2183 rfapiRibUpdatePendingNode(
2184 bgp, m->rfd, it, it_node,
2185 m->rfd->response_lifetime);
2186 }
2187 }
2188
2189 } else {
2190 /*
2191 * Find RFDs that reference this import table
2192 */
2193 for (ALL_LIST_ELEMENTS_RO(&bgp->rfapi->descriptors, node,
2194 rfd)) {
2195
2196 struct route_node *rn;
2197
2198 vnc_zlog_debug_verbose(
2199 "%s: comparing rfd(%p)->import_table=%p to it=%p",
2200 __func__, rfd, rfd->import_table, it);
2201
2202 if (rfd->import_table != it)
2203 continue;
2204
2205 vnc_zlog_debug_verbose("%s: matched rfd %p", __func__,
2206 rfd);
2207
2208 /*
2209 * If we have sent a response to this NVE with this
2210 * prefix
2211 * previously, we should send an updated response.
2212 */
2213 if ((rn = route_node_lookup(rfd->rib[afi],
2214 &it_node->p))) {
2215 rfapiRibUpdatePendingNode(
2216 bgp, rfd, it, it_node,
2217 rfd->response_lifetime);
2218 route_unlock_node(rn);
2219 }
2220 }
2221 }
2222 }
2223
2224 void rfapiRibShowResponsesSummary(void *stream)
2225 {
2226 int (*fp)(void *, const char *, ...);
2227 struct vty *vty;
2228 void *out;
2229 const char *vty_newline;
2230 struct bgp *bgp = bgp_get_default();
2231
2232 int nves = 0;
2233 int nves_with_nonempty_ribs = 0;
2234 struct rfapi_descriptor *rfd;
2235 struct listnode *node;
2236
2237 if (rfapiStream2Vty(stream, &fp, &vty, &out, &vty_newline) == 0)
2238 return;
2239 if (!bgp) {
2240 fp(out, "Unable to find default BGP instance\n");
2241 return;
2242 }
2243
2244 fp(out, "%-24s ", "Responses: (Prefixes)");
2245 fp(out, "%-8s %-8u ", "Active:", bgp->rfapi->rib_prefix_count_total);
2246 fp(out, "%-8s %-8u",
2247 "Maximum:", bgp->rfapi->rib_prefix_count_total_max);
2248 fp(out, "\n");
2249
2250 fp(out, "%-24s ", " (Updated)");
2251 fp(out, "%-8s %-8u ",
2252 "Update:", bgp->rfapi->stat.count_updated_response_updates);
2253 fp(out, "%-8s %-8u",
2254 "Remove:", bgp->rfapi->stat.count_updated_response_deletes);
2255 fp(out, "%-8s %-8u", "Total:",
2256 bgp->rfapi->stat.count_updated_response_updates
2257 + bgp->rfapi->stat.count_updated_response_deletes);
2258 fp(out, "\n");
2259
2260 fp(out, "%-24s ", " (NVEs)");
2261 for (ALL_LIST_ELEMENTS_RO(&bgp->rfapi->descriptors, node, rfd)) {
2262 ++nves;
2263 if (rfd->rib_prefix_count)
2264 ++nves_with_nonempty_ribs;
2265 }
2266 fp(out, "%-8s %-8u ", "Active:", nves_with_nonempty_ribs);
2267 fp(out, "%-8s %-8u", "Total:", nves);
2268 fp(out, "\n");
2269 }
2270
2271 void rfapiRibShowResponsesSummaryClear(void)
2272 {
2273 struct bgp *bgp = bgp_get_default();
2274
2275 bgp->rfapi->rib_prefix_count_total_max =
2276 bgp->rfapi->rib_prefix_count_total;
2277 }
2278
2279 static int print_rib_sl(int (*fp)(void *, const char *, ...), struct vty *vty,
2280 void *out, struct skiplist *sl, int deleted,
2281 char *str_pfx, int *printedprefix)
2282 {
2283 struct rfapi_info *ri;
2284 int rc;
2285 void *cursor;
2286 int routes_displayed = 0;
2287
2288 cursor = NULL;
2289 for (rc = skiplist_next(sl, NULL, (void **)&ri, &cursor); !rc;
2290 rc = skiplist_next(sl, NULL, (void **)&ri, &cursor)) {
2291
2292 char str_vn[PREFIX_STRLEN];
2293 char str_un[PREFIX_STRLEN];
2294 char str_lifetime[BUFSIZ];
2295 char str_age[BUFSIZ];
2296 char *p;
2297 char str_rd[RD_ADDRSTRLEN];
2298
2299 ++routes_displayed;
2300
2301 prefix2str(&ri->rk.vn, str_vn, sizeof(str_vn));
2302 p = index(str_vn, '/');
2303 if (p)
2304 *p = 0;
2305
2306 prefix2str(&ri->un, str_un, sizeof(str_un));
2307 p = index(str_un, '/');
2308 if (p)
2309 *p = 0;
2310
2311 rfapiFormatSeconds(ri->lifetime, str_lifetime, BUFSIZ);
2312 #if RFAPI_REGISTRATIONS_REPORT_AGE
2313 rfapiFormatAge(ri->last_sent_time, str_age, BUFSIZ);
2314 #else
2315 {
2316 time_t now = rfapi_time(NULL);
2317 time_t expire =
2318 ri->last_sent_time + (time_t)ri->lifetime;
2319 /* allow for delayed/async removal */
2320 rfapiFormatSeconds((expire > now ? expire - now : 1),
2321 str_age, BUFSIZ);
2322 }
2323 #endif
2324
2325 str_rd[0] = 0; /* start empty */
2326 #if DEBUG_RIB_SL_RD
2327 prefix_rd2str(&ri->rk.rd, str_rd, sizeof(str_rd));
2328 #endif
2329
2330 fp(out, " %c %-20s %-15s %-15s %-4u %-8s %-8s %s\n",
2331 deleted ? 'r' : ' ', *printedprefix ? "" : str_pfx, str_vn,
2332 str_un, ri->cost, str_lifetime, str_age, str_rd);
2333
2334 if (!*printedprefix)
2335 *printedprefix = 1;
2336 }
2337 return routes_displayed;
2338 }
2339
2340 #if DEBUG_NHL
2341 /*
2342 * This one is for debugging (set stream to NULL to send output to log)
2343 */
2344 static void rfapiRibShowRibSl(void *stream, struct prefix *pfx,
2345 struct skiplist *sl)
2346 {
2347 int (*fp)(void *, const char *, ...);
2348 struct vty *vty;
2349 void *out;
2350 const char *vty_newline;
2351
2352 int nhs_displayed = 0;
2353 char str_pfx[PREFIX_STRLEN];
2354 int printedprefix = 0;
2355
2356 if (rfapiStream2Vty(stream, &fp, &vty, &out, &vty_newline) == 0)
2357 return;
2358
2359 prefix2str(pfx, str_pfx, sizeof(str_pfx));
2360
2361 nhs_displayed +=
2362 print_rib_sl(fp, vty, out, sl, 0, str_pfx, &printedprefix);
2363 }
2364 #endif
2365
2366 void rfapiRibShowResponses(void *stream, struct prefix *pfx_match,
2367 int show_removed)
2368 {
2369 int (*fp)(void *, const char *, ...);
2370 struct vty *vty;
2371 void *out;
2372 const char *vty_newline;
2373
2374 struct rfapi_descriptor *rfd;
2375 struct listnode *node;
2376
2377 struct bgp *bgp = bgp_get_default();
2378 int printedheader = 0;
2379 int routes_total = 0;
2380 int nhs_total = 0;
2381 int prefixes_total = 0;
2382 int prefixes_displayed = 0;
2383 int nves_total = 0;
2384 int nves_with_routes = 0;
2385 int nves_displayed = 0;
2386 int routes_displayed = 0;
2387 int nhs_displayed = 0;
2388
2389 if (rfapiStream2Vty(stream, &fp, &vty, &out, &vty_newline) == 0)
2390 return;
2391 if (!bgp) {
2392 fp(out, "Unable to find default BGP instance\n");
2393 return;
2394 }
2395
2396 /*
2397 * loop over NVEs
2398 */
2399 for (ALL_LIST_ELEMENTS_RO(&bgp->rfapi->descriptors, node, rfd)) {
2400
2401 int printednve = 0;
2402 afi_t afi;
2403
2404 ++nves_total;
2405 if (rfd->rib_prefix_count)
2406 ++nves_with_routes;
2407
2408 for (afi = AFI_IP; afi < AFI_MAX; ++afi) {
2409
2410 struct route_node *rn;
2411
2412 if (!rfd->rib[afi])
2413 continue;
2414
2415 for (rn = route_top(rfd->rib[afi]); rn;
2416 rn = route_next(rn)) {
2417
2418 struct skiplist *sl;
2419 char str_pfx[PREFIX_STRLEN];
2420 int printedprefix = 0;
2421
2422 if (!show_removed)
2423 sl = rn->info;
2424 else
2425 sl = rn->aggregate;
2426
2427 if (!sl)
2428 continue;
2429
2430 routes_total++;
2431 nhs_total += skiplist_count(sl);
2432 ++prefixes_total;
2433
2434 if (pfx_match
2435 && !prefix_match(pfx_match, &rn->p)
2436 && !prefix_match(&rn->p, pfx_match))
2437 continue;
2438
2439 ++prefixes_displayed;
2440
2441 if (!printedheader) {
2442 ++printedheader;
2443
2444 fp(out, "\n[%s]\n",
2445 show_removed ? "Removed" : "Active");
2446 fp(out, "%-15s %-15s\n", "Querying VN",
2447 "Querying UN");
2448 fp(out,
2449 " %-20s %-15s %-15s %4s %-8s %-8s\n",
2450 "Prefix", "Registered VN",
2451 "Registered UN", "Cost", "Lifetime",
2452 #if RFAPI_REGISTRATIONS_REPORT_AGE
2453 "Age"
2454 #else
2455 "Remaining"
2456 #endif
2457 );
2458 }
2459 if (!printednve) {
2460 char str_vn[BUFSIZ];
2461 char str_un[BUFSIZ];
2462
2463 ++printednve;
2464 ++nves_displayed;
2465
2466 fp(out, "%-15s %-15s\n",
2467 rfapiRfapiIpAddr2Str(&rfd->vn_addr,
2468 str_vn, BUFSIZ),
2469 rfapiRfapiIpAddr2Str(&rfd->un_addr,
2470 str_un,
2471 BUFSIZ));
2472 }
2473 prefix2str(&rn->p, str_pfx, sizeof(str_pfx));
2474 // fp(out, " %s\n", buf); /* prefix */
2475
2476 routes_displayed++;
2477 nhs_displayed += print_rib_sl(
2478 fp, vty, out, sl, show_removed, str_pfx,
2479 &printedprefix);
2480 }
2481 }
2482 }
2483
2484 if (routes_total) {
2485 fp(out, "\n");
2486 fp(out, "Displayed %u NVEs, and %u out of %u %s prefixes",
2487 nves_displayed, routes_displayed, routes_total,
2488 show_removed ? "removed" : "active");
2489 if (nhs_displayed != routes_displayed
2490 || nhs_total != routes_total)
2491 fp(out, " with %u out of %u next hops", nhs_displayed,
2492 nhs_total);
2493 fp(out, "\n");
2494 }
2495 }
FRRouting mirror