-
Notifications
You must be signed in to change notification settings - Fork 1.2k
/
rfapi_rib.c
2428 lines (2054 loc) · 57.4 KB
/
rfapi_rib.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// SPDX-License-Identifier: GPL-2.0-or-later
/*
*
* Copyright 2009-2016, LabN Consulting, L.L.C.
*
*/
/*
* File: rfapi_rib.c
* Purpose: maintain per-nve ribs and generate change lists
*/
#include "lib/zebra.h"
#include "lib/prefix.h"
#include "lib/agg_table.h"
#include "lib/vty.h"
#include "lib/memory.h"
#include "lib/log.h"
#include "lib/skiplist.h"
#include "lib/workqueue.h"
#include "bgpd/bgpd.h"
#include "bgpd/bgp_route.h"
#include "bgpd/bgp_ecommunity.h"
#include "bgpd/bgp_mplsvpn.h"
#include "bgpd/bgp_vnc_types.h"
#include "bgpd/rfapi/rfapi.h"
#include "bgpd/rfapi/bgp_rfapi_cfg.h"
#include "bgpd/rfapi/rfapi_import.h"
#include "bgpd/rfapi/rfapi_private.h"
#include "bgpd/rfapi/rfapi_vty.h"
#include "bgpd/rfapi/vnc_import_bgp.h"
#include "bgpd/rfapi/rfapi_rib.h"
#include "bgpd/rfapi/rfapi_monitor.h"
#include "bgpd/rfapi/rfapi_encap_tlv.h"
#include "bgpd/rfapi/vnc_debug.h"
#define DEBUG_PROCESS_PENDING_NODE 0
#define DEBUG_PENDING_DELETE_ROUTE 0
#define DEBUG_NHL 0
#define DEBUG_RIB_SL_RD 0
#define DEBUG_CLEANUP 0
/* forward decl */
#if DEBUG_NHL
static void rfapiRibShowRibSl(void *stream, struct prefix *pfx,
struct skiplist *sl);
#endif
/*
* RIB
* ---
* Model of the set of routes currently in the NVE's RIB.
*
* node->info ptr to "struct skiplist".
* MUST be NULL if there are no routes.
* key = ptr to struct prefix {vn}
* val = ptr to struct rfapi_info
* skiplist.del = NULL
* skiplist.cmp = vnc_prefix_cmp
*
* node->aggregate ptr to "struct skiplist".
* key = ptr to struct prefix {vn}
* val = ptr to struct rfapi_info
* skiplist.del = rfapi_info_free
* skiplist.cmp = vnc_prefix_cmp
*
* This skiplist at "aggregate"
* contains the routes recently
* deleted
*
*
* Pending RIB
* -----------
* Sparse list of prefixes that need to be updated. Each node
* will have the complete set of routes for the prefix.
*
* node->info ptr to "struct list" (lib/linklist.h)
* "Cost List"
* List of routes sorted lowest cost first.
* This list is how the new complete set
* of routes should look.
* Set if there are updates to the prefix;
* MUST be NULL if there are no updates.
*
* .data = ptr to struct rfapi_info
* list.cmp = NULL (sorted manually)
* list.del = rfapi_info_free
*
* Special case: if node->info is 1, it means
* "delete all routes at this prefix".
*
* node->aggregate ptr to struct skiplist
* key = ptr to struct prefix {vn} (part of ri)
* val = struct rfapi_info
* skiplist.cmp = vnc_prefix_cmp
* skiplist.del = NULL
*
* ptlist is rewritten anew each time
* rfapiRibUpdatePendingNode() is called
*
* THE ptlist VALUES ARE REFERENCES TO THE
* rfapi_info STRUCTS IN THE node->info LIST.
*/
/*
* iterate over RIB to count responses, compare with running counters
*/
void rfapiRibCheckCounts(
int checkstats, /* validate rfd & global counts */
unsigned int offset) /* number of ri's held separately */
{
struct rfapi_descriptor *rfd;
struct listnode *node;
struct bgp *bgp = bgp_get_default();
uint32_t t_pfx_active = 0;
uint32_t t_ri_active = 0;
uint32_t t_ri_deleted = 0;
uint32_t t_ri_pend = 0;
unsigned int alloc_count;
/*
* loop over NVEs
*/
for (ALL_LIST_ELEMENTS_RO(&bgp->rfapi->descriptors, node, rfd)) {
afi_t afi;
uint32_t pfx_active = 0;
for (afi = AFI_IP; afi < AFI_MAX; ++afi) {
struct agg_node *rn;
for (rn = agg_route_top(rfd->rib[afi]); rn;
rn = agg_route_next(rn)) {
struct skiplist *sl = rn->info;
struct skiplist *dsl = rn->aggregate;
uint32_t ri_active = 0;
uint32_t ri_deleted = 0;
if (sl) {
ri_active = skiplist_count(sl);
assert(ri_active);
t_ri_active += ri_active;
++pfx_active;
++t_pfx_active;
}
if (dsl) {
ri_deleted = skiplist_count(dsl);
t_ri_deleted += ri_deleted;
}
}
for (rn = agg_route_top(rfd->rib_pending[afi]); rn;
rn = agg_route_next(rn)) {
struct list *l = rn->info; /* sorted by cost */
struct skiplist *sl = rn->aggregate;
uint32_t ri_pend_cost = 0;
uint32_t ri_pend_uniq = 0;
if (sl) {
ri_pend_uniq = skiplist_count(sl);
}
if (l && (l != (void *)1)) {
ri_pend_cost = l->count;
t_ri_pend += l->count;
}
assert(ri_pend_uniq == ri_pend_cost);
}
}
if (checkstats) {
if (pfx_active != rfd->rib_prefix_count) {
vnc_zlog_debug_verbose(
"%s: rfd %p actual pfx count %u != running %u",
__func__, rfd, pfx_active,
rfd->rib_prefix_count);
assert(0);
}
}
}
if (checkstats && bgp->rfapi) {
if (t_pfx_active != bgp->rfapi->rib_prefix_count_total) {
vnc_zlog_debug_verbose(
"%s: actual total pfx count %u != running %u",
__func__, t_pfx_active,
bgp->rfapi->rib_prefix_count_total);
assert(0);
}
}
/*
* Check against memory allocation count
*/
alloc_count = mtype_stats_alloc(MTYPE_RFAPI_INFO);
assert(t_ri_active + t_ri_deleted + t_ri_pend + offset == alloc_count);
}
static struct rfapi_info *rfapi_info_new(void)
{
return XCALLOC(MTYPE_RFAPI_INFO, sizeof(struct rfapi_info));
}
void rfapiFreeRfapiUnOptionChain(struct rfapi_un_option *p)
{
while (p) {
struct rfapi_un_option *next;
next = p->next;
XFREE(MTYPE_RFAPI_UN_OPTION, p);
p = next;
}
}
void rfapiFreeRfapiVnOptionChain(struct rfapi_vn_option *p)
{
while (p) {
struct rfapi_vn_option *next;
next = p->next;
XFREE(MTYPE_RFAPI_VN_OPTION, p);
p = next;
}
}
static void rfapi_info_free(struct rfapi_info *goner)
{
if (goner) {
if (goner->tea_options) {
rfapiFreeBgpTeaOptionChain(goner->tea_options);
goner->tea_options = NULL;
}
if (goner->un_options) {
rfapiFreeRfapiUnOptionChain(goner->un_options);
goner->un_options = NULL;
}
if (goner->vn_options) {
rfapiFreeRfapiVnOptionChain(goner->vn_options);
goner->vn_options = NULL;
}
if (goner->timer) {
struct rfapi_rib_tcb *tcb;
tcb = EVENT_ARG(goner->timer);
EVENT_OFF(goner->timer);
XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
}
XFREE(MTYPE_RFAPI_INFO, goner);
}
}
/*
* Timer control block for recently-deleted and expired routes
*/
struct rfapi_rib_tcb {
struct rfapi_descriptor *rfd;
struct skiplist *sl;
struct rfapi_info *ri;
struct agg_node *rn;
int flags;
#define RFAPI_RIB_TCB_FLAG_DELETED 0x00000001
};
/*
* remove route from rib
*/
static void rfapiRibExpireTimer(struct event *t)
{
struct rfapi_rib_tcb *tcb = EVENT_ARG(t);
RFAPI_RIB_CHECK_COUNTS(1, 0);
/*
* Forget reference to thread. Otherwise rfapi_info_free() will
* attempt to free thread pointer as an option chain
*/
tcb->ri->timer = NULL;
/* "deleted" skiplist frees ri, "active" doesn't */
assert(!skiplist_delete(tcb->sl, &tcb->ri->rk, NULL));
if (!tcb->sl->del) {
/*
* XXX in this case, skiplist has no delete function: we must
* therefore delete rfapi_info explicitly.
*/
rfapi_info_free(tcb->ri);
}
if (skiplist_empty(tcb->sl)) {
if (CHECK_FLAG(tcb->flags, RFAPI_RIB_TCB_FLAG_DELETED))
tcb->rn->aggregate = NULL;
else {
struct bgp *bgp = bgp_get_default();
tcb->rn->info = NULL;
RFAPI_RIB_PREFIX_COUNT_DECR(tcb->rfd, bgp->rfapi);
}
skiplist_free(tcb->sl);
agg_unlock_node(tcb->rn);
}
XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
RFAPI_RIB_CHECK_COUNTS(1, 0);
}
static void rfapiRibStartTimer(struct rfapi_descriptor *rfd,
struct rfapi_info *ri,
struct agg_node *rn, /* route node attached to */
int deleted)
{
struct rfapi_rib_tcb *tcb = NULL;
if (ri->timer) {
tcb = EVENT_ARG(ri->timer);
EVENT_OFF(ri->timer);
} else {
tcb = XCALLOC(MTYPE_RFAPI_RECENT_DELETE,
sizeof(struct rfapi_rib_tcb));
}
#if DEBUG_CLEANUP
zlog_debug("%s: rfd %p, rn %p, ri %p, tcb %p", __func__, rfd, rn, ri,
tcb);
#endif
tcb->rfd = rfd;
tcb->ri = ri;
tcb->rn = rn;
if (deleted) {
tcb->sl = (struct skiplist *)rn->aggregate;
SET_FLAG(tcb->flags, RFAPI_RIB_TCB_FLAG_DELETED);
} else {
tcb->sl = (struct skiplist *)rn->info;
UNSET_FLAG(tcb->flags, RFAPI_RIB_TCB_FLAG_DELETED);
}
vnc_zlog_debug_verbose("%s: rfd %p pfx %pRN life %u", __func__, rfd, rn,
ri->lifetime);
event_add_timer(bm->master, rfapiRibExpireTimer, tcb, ri->lifetime,
&ri->timer);
}
extern void rfapi_rib_key_init(struct prefix *prefix, /* may be NULL */
struct prefix_rd *rd, /* may be NULL */
struct prefix *aux, /* may be NULL */
struct rfapi_rib_key *rk)
{
memset((void *)rk, 0, sizeof(struct rfapi_rib_key));
if (prefix)
rk->vn = *prefix;
if (rd)
rk->rd = *rd;
if (aux)
rk->aux_prefix = *aux;
}
/*
* Compares two <struct rfapi_rib_key>s
*/
int rfapi_rib_key_cmp(const void *k1, const void *k2)
{
const struct rfapi_rib_key *a = (struct rfapi_rib_key *)k1;
const struct rfapi_rib_key *b = (struct rfapi_rib_key *)k2;
int ret;
if (!a || !b)
return (a - b);
ret = vnc_prefix_cmp(&a->vn, &b->vn);
if (ret)
return ret;
ret = vnc_prefix_cmp(&a->rd, &b->rd);
if (ret)
return ret;
ret = vnc_prefix_cmp(&a->aux_prefix, &b->aux_prefix);
return ret;
}
/*
* Note: this function will claim that two option chains are
* different unless their option items are in identical order.
* The consequence is that RFP updated responses can be sent
* unnecessarily, or that they might contain nexthop items
* that are not strictly needed.
*
* This function could be modified to compare option chains more
* thoroughly, but it's not clear that the extra compuation would
* be worth it.
*/
static int bgp_tea_options_cmp(struct bgp_tea_options *a,
struct bgp_tea_options *b)
{
int rc;
if (!a || !b) {
return (a - b);
}
if (a->type != b->type)
return (a->type - b->type);
if (a->length != b->length)
return (a->length = b->length);
if ((rc = memcmp(a->value, b->value, a->length)))
return rc;
if (!a->next != !b->next) { /* logical xor */
return (a->next - b->next);
}
if (a->next)
return bgp_tea_options_cmp(a->next, b->next);
return 0;
}
static int rfapi_info_cmp(struct rfapi_info *a, struct rfapi_info *b)
{
int rc;
if (!a || !b)
return (a - b);
if ((rc = rfapi_rib_key_cmp(&a->rk, &b->rk)))
return rc;
if ((rc = vnc_prefix_cmp(&a->un, &b->un)))
return rc;
if (a->cost != b->cost)
return (a->cost - b->cost);
if (a->lifetime != b->lifetime)
return (a->lifetime - b->lifetime);
if ((rc = bgp_tea_options_cmp(a->tea_options, b->tea_options)))
return rc;
return 0;
}
void rfapiRibClear(struct rfapi_descriptor *rfd)
{
struct bgp *bgp;
afi_t afi;
if (rfd->bgp)
bgp = rfd->bgp;
else
bgp = bgp_get_default();
#ifdef DEBUG_L2_EXTRA
vnc_zlog_debug_verbose("%s: rfd=%p", __func__, rfd);
#endif
for (afi = AFI_IP; afi < AFI_MAX; ++afi) {
struct agg_node *pn;
struct agg_node *rn;
if (rfd->rib_pending[afi]) {
for (pn = agg_route_top(rfd->rib_pending[afi]); pn;
pn = agg_route_next(pn)) {
if (pn->aggregate) {
/*
* free references into the rfapi_info
* structures before
* freeing the structures themselves
*/
skiplist_free(
(struct skiplist
*)(pn->aggregate));
pn->aggregate = NULL;
agg_unlock_node(
pn); /* skiplist deleted */
}
/*
* free the rfapi_info structures
*/
if (pn->info) {
if (pn->info != (void *)1) {
list_delete(
(struct list *
*)(&pn->info));
}
pn->info = NULL;
/* linklist or 1 deleted */
agg_unlock_node(pn);
}
}
}
if (rfd->rib[afi]) {
for (rn = agg_route_top(rfd->rib[afi]); rn;
rn = agg_route_next(rn)) {
if (rn->info) {
struct rfapi_info *ri;
while (0 == skiplist_first(
(struct skiplist *)
rn->info,
NULL,
(void **)&ri)) {
if (ri->timer) {
struct rfapi_rib_tcb
*tcb;
tcb = EVENT_ARG(
ri->timer);
EVENT_OFF(ri->timer);
XFREE(MTYPE_RFAPI_RECENT_DELETE,
tcb);
}
rfapi_info_free(ri);
skiplist_delete_first(
(struct skiplist *)
rn->info);
}
skiplist_free(
(struct skiplist *)rn->info);
rn->info = NULL;
agg_unlock_node(rn);
RFAPI_RIB_PREFIX_COUNT_DECR(rfd,
bgp->rfapi);
}
if (rn->aggregate) {
struct rfapi_info *ri_del;
/* delete skiplist & contents */
while (!skiplist_first(
(struct skiplist
*)(rn->aggregate),
NULL, (void **)&ri_del)) {
/* sl->del takes care of ri_del
*/
skiplist_delete_first((
struct skiplist
*)(rn->aggregate));
}
skiplist_free(
(struct skiplist
*)(rn->aggregate));
rn->aggregate = NULL;
agg_unlock_node(rn);
}
}
}
}
if (rfd->updated_responses_queue)
work_queue_free_and_null(&rfd->updated_responses_queue);
}
/*
* Release all dynamically-allocated memory that is part of an HD's RIB
*/
void rfapiRibFree(struct rfapi_descriptor *rfd)
{
afi_t afi;
#if DEBUG_CLEANUP
zlog_debug("%s: rfd %p", __func__, rfd);
#endif
/*
* NB rfd is typically detached from master list, so is not included
* in the count performed by RFAPI_RIB_CHECK_COUNTS
*/
/*
* Free routes attached to radix trees
*/
rfapiRibClear(rfd);
/* Now the uncounted rfapi_info's are freed, so the check should succeed
*/
RFAPI_RIB_CHECK_COUNTS(1, 0);
/*
* Free radix trees
*/
for (afi = AFI_IP; afi < AFI_MAX; ++afi) {
if (rfd->rib_pending[afi])
agg_table_finish(rfd->rib_pending[afi]);
rfd->rib_pending[afi] = NULL;
if (rfd->rib[afi])
agg_table_finish(rfd->rib[afi]);
rfd->rib[afi] = NULL;
/* NB agg_table_finish frees only prefix nodes, not chained
* info */
if (rfd->rsp_times[afi])
agg_table_finish(rfd->rsp_times[afi]);
rfd->rib[afi] = NULL;
}
}
/*
* Copies struct bgp_path_info to struct rfapi_info, except for rk fields and un
*/
static void rfapiRibBi2Ri(struct bgp_path_info *bpi, struct rfapi_info *ri,
uint32_t lifetime)
{
struct bgp_attr_encap_subtlv *pEncap;
ri->cost = rfapiRfpCost(bpi->attr);
ri->lifetime = lifetime;
/* This loop based on rfapiRouteInfo2NextHopEntry() */
for (pEncap = bgp_attr_get_vnc_subtlvs(bpi->attr); pEncap;
pEncap = pEncap->next) {
struct bgp_tea_options *hop;
switch (pEncap->type) {
case BGP_VNC_SUBTLV_TYPE_LIFETIME:
/* use configured lifetime, not attr lifetime */
break;
case BGP_VNC_SUBTLV_TYPE_RFPOPTION:
hop = XCALLOC(MTYPE_BGP_TEA_OPTIONS,
sizeof(struct bgp_tea_options));
assert(hop);
hop->type = pEncap->value[0];
hop->length = pEncap->value[1];
hop->value = XCALLOC(MTYPE_BGP_TEA_OPTIONS_VALUE,
pEncap->length - 2);
assert(hop->value);
memcpy(hop->value, pEncap->value + 2,
pEncap->length - 2);
if (hop->length > pEncap->length - 2) {
zlog_warn(
"%s: VNC subtlv length mismatch: RFP option says %d, attr says %d (shrinking)",
__func__, hop->length,
pEncap->length - 2);
hop->length = pEncap->length - 2;
}
hop->next = ri->tea_options;
ri->tea_options = hop;
break;
default:
break;
}
}
rfapi_un_options_free(ri->un_options); /* maybe free old version */
ri->un_options = rfapi_encap_tlv_to_un_option(bpi->attr);
/*
* VN options
*/
if (bpi->extra && decode_rd_type(bpi->extra->vnc->vnc.import.rd.val) ==
RD_TYPE_VNC_ETH) {
/* ethernet route */
struct rfapi_vn_option *vo;
vo = XCALLOC(MTYPE_RFAPI_VN_OPTION,
sizeof(struct rfapi_vn_option));
assert(vo);
vo->type = RFAPI_VN_OPTION_TYPE_L2ADDR;
/* copy from RD already stored in bpi, so we don't need it_node
*/
memcpy(&vo->v.l2addr.macaddr,
bpi->extra->vnc->vnc.import.rd.val + 2, ETH_ALEN);
(void)rfapiEcommunityGetLNI(bgp_attr_get_ecommunity(bpi->attr),
&vo->v.l2addr.logical_net_id);
(void)rfapiEcommunityGetEthernetTag(
bgp_attr_get_ecommunity(bpi->attr),
&vo->v.l2addr.tag_id);
/* local_nve_id comes from RD */
vo->v.l2addr.local_nve_id =
bpi->extra->vnc->vnc.import.rd.val[1];
/* label comes from MP_REACH_NLRI label */
vo->v.l2addr.label =
BGP_PATH_INFO_NUM_LABELS(bpi)
? decode_label(&bpi->extra->labels->label[0])
: MPLS_INVALID_LABEL;
rfapi_vn_options_free(
ri->vn_options); /* maybe free old version */
ri->vn_options = vo;
}
/*
* If there is an auxiliary IP address (L2 can have it), copy it
*/
if (bpi->extra && bpi->extra->vnc->vnc.import.aux_prefix.family) {
ri->rk.aux_prefix = bpi->extra->vnc->vnc.import.aux_prefix;
}
}
/*
* rfapiRibPreloadBi
*
* Install route into NVE RIB model so as to be consistent with
* caller's response to rfapi_query().
*
* Also: return indication to caller whether this specific route
* should be included in the response to the NVE according to
* the following tests:
*
* 1. If there were prior duplicates of this route in this same
* query response, don't include the route.
*
* RETURN VALUE:
*
* 0 OK to include route in response
* !0 do not include route in response
*/
int rfapiRibPreloadBi(
struct agg_node *rfd_rib_node, /* NULL = don't preload or filter */
struct prefix *pfx_vn, struct prefix *pfx_un, uint32_t lifetime,
struct bgp_path_info *bpi)
{
struct rfapi_descriptor *rfd;
struct skiplist *slRibPt = NULL;
struct rfapi_info *ori = NULL;
struct rfapi_rib_key rk;
struct agg_node *trn;
afi_t afi;
const struct prefix *p = agg_node_get_prefix(rfd_rib_node);
if (!rfd_rib_node)
return 0;
afi = family2afi(p->family);
rfd = agg_get_table_info(agg_get_table(rfd_rib_node));
memset((void *)&rk, 0, sizeof(rk));
rk.vn = *pfx_vn;
rk.rd = bpi->extra->vnc->vnc.import.rd;
/*
* If there is an auxiliary IP address (L2 can have it), copy it
*/
if (bpi->extra->vnc->vnc.import.aux_prefix.family) {
rk.aux_prefix = bpi->extra->vnc->vnc.import.aux_prefix;
}
/*
* is this route already in NVE's RIB?
*/
slRibPt = (struct skiplist *)rfd_rib_node->info;
if (slRibPt && !skiplist_search(slRibPt, &rk, (void **)&ori)) {
if ((ori->rsp_counter == rfd->rsp_counter)
&& (ori->last_sent_time == rfd->rsp_time)) {
return -1; /* duplicate in this response */
}
/* found: update contents of existing route in RIB */
ori->un = *pfx_un;
rfapiRibBi2Ri(bpi, ori, lifetime);
} else {
/* not found: add new route to RIB */
ori = rfapi_info_new();
ori->rk = rk;
ori->un = *pfx_un;
rfapiRibBi2Ri(bpi, ori, lifetime);
if (!slRibPt) {
slRibPt = skiplist_new(0, rfapi_rib_key_cmp, NULL);
rfd_rib_node->info = slRibPt;
agg_lock_node(rfd_rib_node);
RFAPI_RIB_PREFIX_COUNT_INCR(rfd, rfd->bgp->rfapi);
}
skiplist_insert(slRibPt, &ori->rk, ori);
}
ori->last_sent_time = monotime(NULL);
/*
* poke timer
*/
RFAPI_RIB_CHECK_COUNTS(0, 0);
rfapiRibStartTimer(rfd, ori, rfd_rib_node, 0);
RFAPI_RIB_CHECK_COUNTS(0, 0);
/*
* Update last sent time for prefix
*/
trn = agg_node_get(rfd->rsp_times[afi], p); /* locks trn */
trn->info = (void *)(uintptr_t)monotime(NULL);
if (agg_node_get_lock_count(trn) > 1)
agg_unlock_node(trn);
return 0;
}
/*
* Frees rfapi_info items at node
*
* Adjust 'rib' and 'rib_pending' as follows:
*
* If rib_pending node->info is 1 (magic value):
* callback: NHL = RIB NHL with lifetime = withdraw_lifetime_value
* RIB = remove all routes at the node
* DONE
*
* For each item at rib node:
* if not present in pending node, move RIB item to "delete list"
*
* For each item at pending rib node:
* if present (same vn/un) in rib node with same lifetime & options, drop
* matching item from pending node
*
* For each remaining item at pending rib node, add or replace item
* at rib node.
*
* Construct NHL as concatenation of pending list + delete list
*
* Clear pending node
*/
static void process_pending_node(struct bgp *bgp, struct rfapi_descriptor *rfd,
afi_t afi,
struct agg_node *pn, /* pending node */
struct rfapi_next_hop_entry **head,
struct rfapi_next_hop_entry **tail)
{
struct listnode *node = NULL;
struct listnode *nnode = NULL;
struct rfapi_info *ri = NULL; /* happy valgrind */
struct rfapi_ip_prefix hp = {0}; /* pfx to put in NHE */
struct agg_node *rn = NULL;
struct skiplist *slRibPt = NULL; /* rib list */
struct skiplist *slPendPt = NULL;
struct list *lPendCost = NULL;
struct list *delete_list = NULL;
int printedprefix = 0;
int rib_node_started_nonempty = 0;
int sendingsomeroutes = 0;
const struct prefix *p;
#if DEBUG_PROCESS_PENDING_NODE
unsigned int count_rib_initial = 0;
unsigned int count_pend_vn_initial = 0;
unsigned int count_pend_cost_initial = 0;
#endif
assert(pn);
p = agg_node_get_prefix(pn);
vnc_zlog_debug_verbose("%s: afi=%d, %pRN pn->info=%p", __func__, afi,
pn, pn->info);
if (AFI_L2VPN != afi) {
rfapiQprefix2Rprefix(p, &hp);
}
RFAPI_RIB_CHECK_COUNTS(1, 0);
/*
* Find corresponding RIB node
*/
rn = agg_node_get(rfd->rib[afi], p); /* locks rn */
/*
* RIB skiplist has key=rfapi_addr={vn,un}, val = rfapi_info,
* skiplist.del = NULL
*/
slRibPt = (struct skiplist *)rn->info;
if (slRibPt)
rib_node_started_nonempty = 1;
slPendPt = (struct skiplist *)(pn->aggregate);
lPendCost = (struct list *)(pn->info);
#if DEBUG_PROCESS_PENDING_NODE
/* debugging */
if (slRibPt)
count_rib_initial = skiplist_count(slRibPt);
if (slPendPt)
count_pend_vn_initial = skiplist_count(slPendPt);
if (lPendCost && lPendCost != (struct list *)1)
count_pend_cost_initial = lPendCost->count;
#endif
/*
* Handle special case: delete all routes at prefix
*/
if (lPendCost == (struct list *)1) {
vnc_zlog_debug_verbose("%s: lPendCost=1 => delete all",
__func__);
if (slRibPt && !skiplist_empty(slRibPt)) {
delete_list = list_new();
while (0
== skiplist_first(slRibPt, NULL, (void **)&ri)) {
listnode_add(delete_list, ri);
vnc_zlog_debug_verbose(
"%s: after listnode_add, delete_list->count=%d",
__func__, delete_list->count);
rfapiFreeBgpTeaOptionChain(ri->tea_options);
ri->tea_options = NULL;
if (ri->timer) {
struct rfapi_rib_tcb *tcb;
tcb = EVENT_ARG(ri->timer);
EVENT_OFF(ri->timer);
XFREE(MTYPE_RFAPI_RECENT_DELETE, tcb);
}
vnc_zlog_debug_verbose(
"%s: put dl pfx=%pRN vn=%pFX un=%pFX cost=%d life=%d vn_options=%p",
__func__, pn, &ri->rk.vn, &ri->un,
ri->cost, ri->lifetime, ri->vn_options);
skiplist_delete_first(slRibPt);
}
assert(skiplist_empty(slRibPt));
skiplist_free(slRibPt);
rn->info = slRibPt = NULL;
agg_unlock_node(rn);
lPendCost = pn->info = NULL;
agg_unlock_node(pn);
goto callback;
}
if (slRibPt) {
skiplist_free(slRibPt);
rn->info = NULL;
agg_unlock_node(rn);
}
assert(!slPendPt);
if (slPendPt) { /* TBD I think we can toss this block */
skiplist_free(slPendPt);
pn->aggregate = NULL;
agg_unlock_node(pn);
}
pn->info = NULL;
agg_unlock_node(pn);
agg_unlock_node(rn); /* agg_node_get() */
if (rib_node_started_nonempty) {
RFAPI_RIB_PREFIX_COUNT_DECR(rfd, bgp->rfapi);
}
RFAPI_RIB_CHECK_COUNTS(1, 0);
return;
}
vnc_zlog_debug_verbose("%s: lPendCost->count=%d, slRibPt->count=%d",
__func__,
(lPendCost ? (int)lPendCost->count : -1),
(slRibPt ? (int)slRibPt->count : -1));
/*
* Iterate over routes at RIB Node.
* If not found at Pending Node, delete from RIB Node and add to
* deletelist
* If found at Pending Node
* If identical rfapi_info, delete from Pending Node
*/
if (slRibPt) {
void *cursor = NULL;
struct rfapi_info *ori;
/*
* Iterate over RIB List
*
*/
while (!skiplist_next(slRibPt, NULL, (void **)&ori, &cursor)) {
if (skiplist_search(slPendPt, &ori->rk, (void **)&ri)) {
/*
* Not in Pending list, so it should be deleted
*/
if (!delete_list)
delete_list = list_new();
listnode_add(delete_list, ori);