-
Notifications
You must be signed in to change notification settings - Fork 171
/
vr_ip_mtrie.c
1294 lines (1063 loc) · 36.2 KB
/
vr_ip_mtrie.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
/*
* vr_ip_mtrie.c -- VRF mtrie management
*
* Copyright (c) 2014 Juniper Networks, Inc. All rights reserved.
*/
#include <vr_os.h>
#include "vr_sandesh.h"
#include "vr_message.h"
#include "vr_packet.h"
#include "vr_interface.h"
#include "vr_route.h"
#include "vr_bridge.h"
#include "vr_datapath.h"
#include "vr_ip_mtrie.h"
extern unsigned int vr_vrfs;
extern struct vr_nexthop *ip4_default_nh;
static struct vr_vrf_stats **mtrie_vrf_stats;
static struct vr_vrf_stats *invalid_vrf_stats;
struct vr_nexthop *(*vr_inet_route_lookup)(unsigned int, struct vr_route_req *);
struct vr_vrf_stats *(*vr_inet_vrf_stats)(int, unsigned int);
static struct ip_mtrie *mtrie_alloc_vrf(unsigned int, unsigned int);
/* mtrie specific, bucket_info for v4 and v6 */
#define IP4_BKT_LEVELS (IP4_PREFIX_LEN / IPBUCKET_LEVEL_BITS)
#define IP6_BKT_LEVELS (IP6_PREFIX_LEN / IPBUCKET_LEVEL_BITS)
struct mtrie_bkt_info ip4_bkt_info[IP4_BKT_LEVELS];
struct mtrie_bkt_info ip6_bkt_info[IP6_BKT_LEVELS];
struct ip_mtrie **vn_rtable[2];
static int algo_init_done = 0;
static vr_route_req dump_resp;
static void
mtrie_ip_bkt_info_init(struct mtrie_bkt_info *ip_bkt_info, int pfx_len)
{
int level;
ip_bkt_info[0].bi_bits = IPBUCKET_LEVEL_BITS;
ip_bkt_info[0].bi_pfx_len = IPBUCKET_LEVEL_BITS;
ip_bkt_info[0].bi_shift = pfx_len - IPBUCKET_LEVEL_BITS;
ip_bkt_info[0].bi_size = IPBUCKET_LEVEL_SIZE;
ip_bkt_info[0].bi_mask = IPBUCKET_LEVEL_MASK;
for (level = 1; level < (pfx_len/IPBUCKET_LEVEL_BITS); level++) {
ip_bkt_info[level].bi_bits = IPBUCKET_LEVEL_BITS;
ip_bkt_info[level].bi_pfx_len = ip_bkt_info[level-1].bi_pfx_len
+ IPBUCKET_LEVEL_BITS;
ip_bkt_info[level].bi_shift = ip_bkt_info[level-1].bi_shift - IPBUCKET_LEVEL_BITS;
ip_bkt_info[level].bi_size = IPBUCKET_LEVEL_SIZE;
ip_bkt_info[level].bi_mask = IPBUCKET_LEVEL_MASK;
}
}
/*
* given a vrf id, get the routing table corresponding to the id
*/
static inline struct ip_mtrie *
vrfid_to_mtrie(unsigned int vrf_id, unsigned int family)
{
int index = 0;
struct ip_mtrie **mtrie_table;
if (vrf_id >= vr_vrfs)
return NULL;
if (family == AF_INET6)
index = 1;
mtrie_table = vn_rtable[index];
return mtrie_table[vrf_id];
}
#define PREFIX_TO_INDEX(prefix, level) (prefix[level])
static inline unsigned int
ip_bkt_get_max_level(int family)
{
if (family == AF_INET6)
return(IP6_BKT_LEVELS);
else
return(IP4_BKT_LEVELS);
}
static struct mtrie_bkt_info *
ip_bkt_info_get(unsigned int family)
{
if (family == AF_INET6)
return ip6_bkt_info;
else
return ip4_bkt_info;
}
/*
* we have to be careful about 'level' here. assumption is that level
* will be passed sane from whomever is calling
*/
static inline unsigned char
rt_to_index(struct vr_route_req *rt, unsigned int level)
{
return PREFIX_TO_INDEX(rt->rtr_req.rtr_prefix, level);
}
static inline struct ip_bucket_entry *
index_to_entry(struct ip_bucket *bkt, int index)
{
return &bkt->bkt_data[index];
}
static void
set_entry_to_bucket(struct ip_bucket_entry *ent, struct ip_bucket *bkt)
{
struct vr_nexthop *tmp_nh;
/* save old... */
tmp_nh = ent->entry_nh_p;
/* update... */
ent->entry_long_i = (unsigned long)bkt | 0x1ul;
/* release old */
if (tmp_nh)
vrouter_put_nexthop(tmp_nh);
return;
}
/*
* the nh pointer is something which will be retained. So, call this function
* with an nh * that you are willing to forget about in your function
*/
static void
set_entry_to_nh(struct ip_bucket_entry *entry, struct vr_nexthop *nh)
{
struct vr_nexthop *tmp_nh;
tmp_nh = vrouter_get_nexthop(nh->nh_rid, nh->nh_id);
if (tmp_nh != nh) {
/*
* if the original nexthop was deleted, then there are
* two cases
*
* 1. no new nexthop was created (& hence the null check)
* 2. new nexthop has taken it's place (in which case, we need to
* put the reference we took above
*/
if (tmp_nh)
vrouter_put_nexthop(tmp_nh);
nh = vrouter_get_nexthop(nh->nh_rid, NH_DISCARD_ID);
}
/* save the original */
tmp_nh = entry->entry_nh_p;
/* update the entry */
entry->entry_nh_p = nh;
/* ...and then take steps to release original */
if (tmp_nh && PTR_IS_NEXTHOP((unsigned long)(tmp_nh))) {
vrouter_put_nexthop(tmp_nh);
}
return;
}
static inline struct ip_bucket *
entry_to_bucket(struct ip_bucket_entry *ent)
{
unsigned long long_i = ent->entry_long_i;
if (PTR_IS_BUCKET(long_i))
return (struct ip_bucket *)(long_i & ~0x1UL);
return NULL;
}
static void
mtrie_free_entry(struct ip_bucket_entry *entry, unsigned int level)
{
unsigned int i;
struct ip_bucket *bkt;
if (ENTRY_IS_NEXTHOP(entry)) {
vrouter_put_nexthop(entry->entry_nh_p);
entry->entry_nh_p = NULL;
return;
}
bkt = entry_to_bucket(entry);
if (!bkt)
return;
for (i = 0; i < IPBUCKET_LEVEL_SIZE; i++) {
if (ENTRY_IS_BUCKET(&bkt->bkt_data[i])) {
mtrie_free_entry(&bkt->bkt_data[i], level + 1);
} else {
if (bkt->bkt_data[i].entry_nh_p) {
vrouter_put_nexthop(bkt->bkt_data[i].entry_nh_p);
}
}
}
entry->entry_bkt_p = NULL;
vr_free(bkt, VR_MTRIE_BUCKET_OBJECT);
return;
}
static void
mtrie_free_bkt(struct ip_bucket *bkt)
{
unsigned int i;
for (i = 0; i < IPBUCKET_LEVEL_SIZE; i++) {
mtrie_free_entry(&bkt->bkt_data[i], 0);
}
vr_free(bkt, VR_MTRIE_BUCKET_OBJECT);
return;
}
static void
mtrie_free_bkt_cb(struct vrouter *router, void *data)
{
struct vr_defer_data *vdd = (struct vr_defer_data *)data;
if (!vdd)
return;
mtrie_free_bkt((struct ip_bucket *)(vdd->vdd_data));
return;
}
static int
mtrie_free_bkt_defer(struct vrouter *router, struct ip_bucket *bkt)
{
struct vr_defer_data *defer;
defer = vr_get_defer_data(sizeof(*defer));
if (!defer)
return -ENOMEM;
defer->vdd_data = bkt;
vr_defer(router, mtrie_free_bkt_cb, (void *)defer);
return 0;
}
static void
mtrie_delete_bkt(struct ip_bucket_entry *ent, struct vr_route_req *rt)
{
struct ip_bucket *bkt;
if (ENTRY_IS_NEXTHOP(ent)) {
vrouter_put_nexthop(ent->entry_nh_p);
ent->entry_nh_p = NULL;
return;
}
bkt = entry_to_bucket(ent);
set_entry_to_nh(ent, rt->rtr_nh);
ent->entry_label_flags = rt->rtr_req.rtr_label_flags;
ent->entry_label = rt->rtr_req.rtr_label;
ent->entry_bridge_index = rt->rtr_req.rtr_index;
if (!vr_not_ready) {
if (!mtrie_free_bkt_defer(rt->rtr_nh->nh_router, bkt))
return;
vr_delay_op();
}
mtrie_free_bkt(bkt);
return;
}
/*
* alloc a mtrie bucket
*/
static struct ip_bucket *
mtrie_alloc_bucket(struct mtrie_bkt_info *ip_bkt_info, unsigned char level, struct ip_bucket_entry *parent)
{
unsigned int bkt_size;
unsigned int i;
struct ip_bucket *bkt;
struct ip_bucket_entry *ent;
bkt_size = ip_bkt_info[level].bi_size;
bkt = vr_zalloc(sizeof(struct ip_bucket)
+ sizeof(struct ip_bucket_entry) * bkt_size,
VR_MTRIE_BUCKET_OBJECT);
if (!bkt)
return NULL;
for (i = 0; i < bkt_size; i++) {
ent = &bkt->bkt_data[i];
set_entry_to_nh(ent, parent->entry_nh_p);
ent->entry_prefix_len = parent->entry_prefix_len;
ent->entry_label_flags = parent->entry_label_flags;
ent->entry_label = parent->entry_label;
ent->entry_bridge_index = parent->entry_bridge_index;
}
return bkt;
}
static void
add_to_tree(struct ip_bucket_entry *ent, int level, struct vr_route_req *rt)
{
unsigned int i;
struct ip_bucket *bkt;
struct mtrie_bkt_info *ip_bkt_info;
if (ent->entry_prefix_len > rt->rtr_req.rtr_prefix_len)
return;
ent->entry_prefix_len = rt->rtr_req.rtr_prefix_len;
if (ENTRY_IS_NEXTHOP(ent)) {
/* a less specific entry, which needs to be replaced */
set_entry_to_nh(ent, rt->rtr_nh);
ent->entry_label_flags = rt->rtr_req.rtr_label_flags;
ent->entry_label = rt->rtr_req.rtr_label;
ent->entry_bridge_index = rt->rtr_req.rtr_index;
return;
}
if (level >= (ip_bkt_get_max_level(rt->rtr_req.rtr_family) - 1))
return;
ip_bkt_info = ip_bkt_info_get(rt->rtr_req.rtr_family);
/* Assured that this is valid bucket now */
bkt = entry_to_bucket(ent);
level++;
for (i = 0; i < ip_bkt_info[level].bi_size; i++) {
ent = index_to_entry(bkt, i);
add_to_tree(ent, level, rt);
}
return;
}
static void
mtrie_reset_entry(struct ip_bucket_entry *ent, int level,
struct vr_nexthop *nh)
{
struct ip_bucket_entry cp_ent;
struct ip_bucket *bkt;
memcpy(&cp_ent, ent, sizeof(cp_ent));
/* remove from the tree */
if (nh)
set_entry_to_nh(ent, nh);
/* ...and then work with the copy */
bkt = entry_to_bucket(&cp_ent);
if (!bkt)
return;
if (!vr_not_ready) {
if (!mtrie_free_bkt_defer(nh->nh_router, bkt))
return;
vr_delay_op();
}
mtrie_free_entry(&cp_ent, level);
return;
}
/*
* When adding a route:
* - descend the tree to the bucket at which the route is significant.
* (i.e. the bucket corresponding to a prefix >= to the route prefix).
* - if the bucket needs to be created, it is first initialized and only
* linked to the tree when the function exits.
* - if the bucket exists, populate any descendent bucket entries that
* themselfs do not have more specific routes.
* - when a bucket is created, initialize any entries with the parent that
* covers them.
*/
static int
__mtrie_add(struct ip_mtrie *mtrie, struct vr_route_req *rt)
{
int ret, index = 0, level, err_level = 0, fin;
unsigned char i;
struct ip_bucket *bkt;
struct ip_bucket_entry *ent, *err_ent = NULL;
struct vr_nexthop *nh, *err_nh = NULL;
struct mtrie_bkt_info *ip_bkt_info = ip_bkt_info_get(rt->rtr_req.rtr_family);
ent = &mtrie->root;
nh = ent->entry_nh_p;
for (level = 0; level < ip_bkt_get_max_level(rt->rtr_req.rtr_family); level++) {
if (!ENTRY_IS_BUCKET(ent)) {
bkt = mtrie_alloc_bucket(ip_bkt_info, level, ent);
set_entry_to_bucket(ent, bkt);
if (!err_ent) {
err_ent = ent;
err_nh = nh;
err_level = level;
}
}
bkt = entry_to_bucket(ent);
if (!bkt) {
ret = -ENOMEM;
goto exit_ret;
}
index = rt_to_index(rt, level);
ent = index_to_entry(bkt, index);
if (rt->rtr_req.rtr_prefix_len > ip_bkt_info[level].bi_pfx_len) {
if (ENTRY_IS_NEXTHOP(ent)) {
nh = ent->entry_nh_p;
}
continue;
} else {
/*
* cover all the indices for which this route is the best
* prefix match
*/
fin = ip_bkt_info[level].bi_size;
if ((rt->rtr_req.rtr_prefix_len >
(ip_bkt_info[level].bi_pfx_len - ip_bkt_info[level].bi_bits)) &&
(rt->rtr_req.rtr_prefix_len <= ip_bkt_info[level].bi_pfx_len)) {
fin = 1 << (ip_bkt_info[level].bi_pfx_len - rt->rtr_req.rtr_prefix_len);
}
i = index;
for (; ((i <= (ip_bkt_info[level].bi_size-1)) && fin);
i++, fin--) {
ent = index_to_entry(bkt, i);
add_to_tree(ent, level, rt);
}
break;
}
}
return 0;
exit_ret:
if (err_ent)
mtrie_reset_entry(err_ent, err_level, err_nh);
return ret;
}
static int
__mtrie_delete(struct vr_route_req *rt, struct ip_bucket_entry *ent,
unsigned char level)
{
unsigned int index, i, fin;
struct ip_bucket *bkt;
struct ip_bucket_entry *tmp_ent;
struct mtrie_bkt_info *ip_bkt_info = ip_bkt_info_get(rt->rtr_req.rtr_family);
if (ENTRY_IS_NEXTHOP(ent))
return -ENOENT;
bkt = entry_to_bucket(ent);
index = rt_to_index(rt, level);
if (rt->rtr_req.rtr_prefix_len > ip_bkt_info[level].bi_pfx_len) {
tmp_ent = index_to_entry(bkt, index);
__mtrie_delete(rt, tmp_ent, level + 1);
} else {
if ((rt->rtr_req.rtr_prefix_len >
(ip_bkt_info[level].bi_pfx_len - ip_bkt_info[level].bi_bits)) &&
(rt->rtr_req.rtr_prefix_len <= ip_bkt_info[level].bi_pfx_len)) {
fin = 1 << (ip_bkt_info[level].bi_pfx_len - rt->rtr_req.rtr_prefix_len);
index &= ~(fin - 1);
} else {
fin = ip_bkt_info[level].bi_size;
index = 0;
}
fin += index;
if (fin > ip_bkt_info[level].bi_size)
fin = ip_bkt_info[level].bi_size;
for (i = index; i < fin; i++) {
tmp_ent = index_to_entry(bkt, i);
if (tmp_ent->entry_prefix_len == rt->rtr_req.rtr_prefix_len) {
tmp_ent->entry_label_flags = rt->rtr_req.rtr_label_flags;
tmp_ent->entry_label = rt->rtr_req.rtr_label;
tmp_ent->entry_prefix_len = rt->rtr_req.rtr_replace_plen;
if (ENTRY_IS_NEXTHOP(tmp_ent)) {
set_entry_to_nh(tmp_ent, rt->rtr_nh);
tmp_ent->entry_bridge_index = rt->rtr_req.rtr_index;
} else {
__mtrie_delete(rt, tmp_ent, level + 1);
}
}
}
}
/* check if current bucket neds to be deleted */
for (i = 1; i < ip_bkt_info[level].bi_size; i++) {
if (memcmp(bkt->bkt_data + i, bkt->bkt_data,
sizeof(struct ip_bucket_entry)))
return 0;
}
mtrie_delete_bkt(ent, rt);
return 0;
}
static int
mtrie_dumper_route_encode(struct vr_message_dumper *dumper, vr_route_req *resp)
{
int len;
len = vr_message_dump_object(dumper, VR_ROUTE_OBJECT_ID, resp);
if (len <= 0)
return len;
return 1;
}
static void
mtrie_dumper_make_response(struct vr_message_dumper *dumper, vr_route_req *resp,
struct ip_bucket_entry *ent, int8_t *prefix, unsigned int prefix_len)
{
vr_route_req *req = (vr_route_req *)dumper->dump_req;
struct vr_route_req lreq;
resp->rtr_vrf_id = req->rtr_vrf_id;
resp->rtr_family = req->rtr_family;
memcpy(resp->rtr_prefix, prefix, prefix_len / IPBUCKET_LEVEL_BITS);
resp->rtr_prefix_size = req->rtr_prefix_size;
resp->rtr_marker_size = 0;
resp->rtr_marker = NULL;
resp->rtr_prefix_len = prefix_len;
resp->rtr_rid = req->rtr_rid;
resp->rtr_label_flags = ent->entry_label_flags;
resp->rtr_label = ent->entry_label;
resp->rtr_nh_id = ent->entry_nh_p->nh_id;
resp->rtr_index = ent->entry_bridge_index;
if (resp->rtr_index != VR_BE_INVALID_INDEX) {
resp->rtr_mac = vr_zalloc(VR_ETHER_ALEN, VR_ROUTE_REQ_MAC_OBJECT);
resp->rtr_mac_size = VR_ETHER_ALEN;
lreq.rtr_req.rtr_mac = resp->rtr_mac;
lreq.rtr_req.rtr_index = resp->rtr_index;
lreq.rtr_req.rtr_mac_size = VR_ETHER_ALEN;
vr_bridge_lookup(resp->rtr_vrf_id, &lreq);
} else {
resp->rtr_mac_size = 0;
resp->rtr_mac = NULL;
}
resp->rtr_replace_plen = ent->entry_prefix_len;
return;
}
static int
mtrie_dump_entry(struct vr_message_dumper *dumper, struct ip_bucket_entry *ent,
int8_t *prefix, int level)
{
unsigned char i = 0;
unsigned int j;
int ret;
struct ip_bucket *bkt;
struct ip_bucket_entry *ent_p = ent;
struct mtrie_bkt_info *ip_bkt_info;
vr_route_req *req;
int done = 0;
uint32_t rt_prefix[4];
req = dumper->dump_req;
ip_bkt_info = ip_bkt_info_get(req->rtr_family);
if (!dumper->dump_been_to_marker) {
i = PREFIX_TO_INDEX(req->rtr_marker, level);
bkt = entry_to_bucket(ent);
ent = index_to_entry(bkt, i);
prefix[level] = i;
if ((!memcmp(prefix, req->rtr_marker, ip_bkt_info[level].bi_pfx_len/8)) &&
(ip_bkt_info[level].bi_pfx_len == req->rtr_marker_plen)) {
dumper->dump_been_to_marker = 1;
}
/* take care of overflow */
if (i == (ip_bkt_info[level].bi_size - 1))
done = 1;
if (ENTRY_IS_BUCKET(ent) && !dumper->dump_been_to_marker) {
if (mtrie_dump_entry(dumper, ent, prefix, level + 1))
return -1;
i++;
} else {
if (dumper->dump_been_to_marker)
i++;
dumper->dump_been_to_marker = 1;
}
}
if (ENTRY_IS_BUCKET(ent_p)) {
if (done)
return 0;
j = ip_bkt_info[level].bi_size - i;
bkt = entry_to_bucket(ent_p);
for (; j > 0; j--, i++) {
ent = &bkt->bkt_data[i];
prefix[level] = i;
if (mtrie_dump_entry(dumper, ent, prefix, level + 1) < 0)
return -1;
}
} else if (ent_p->entry_nh_p) {
memset(rt_prefix, 0, sizeof(rt_prefix));
dump_resp.rtr_prefix = (uint8_t*)&rt_prefix;
mtrie_dumper_make_response(dumper, &dump_resp, ent_p, prefix,
ip_bkt_info[level - 1].bi_pfx_len);
ret = mtrie_dumper_route_encode(dumper, &dump_resp);
if (dump_resp.rtr_mac_size) {
vr_free(dump_resp.rtr_mac, VR_ROUTE_REQ_MAC_OBJECT);
dump_resp.rtr_mac_size = 0;
dump_resp.rtr_mac = NULL;
}
dump_resp.rtr_prefix = NULL;
if (ret <= 0)
return -1;
}
return 0;
}
static int
mtrie_walk(struct vr_message_dumper *dumper, unsigned int family)
{
vr_route_req *req;
struct ip_mtrie *mtrie;
struct ip_bucket_entry *ent;
int ret = 0;
uint32_t rt_prefix[4];
req = (vr_route_req *)dumper->dump_req;
mtrie = vrfid_to_mtrie(req->rtr_vrf_id, family);
if (!mtrie)
return -EINVAL;
ent = &mtrie->root;
if (ENTRY_IS_BUCKET(ent)) {
ret = mtrie_dump_entry(dumper, ent, (uint8_t*)&rt_prefix, 0);
}
return ret;
}
static int
mtrie_dump(struct vr_rtable * __unsued, struct vr_route_req *rt)
{
int ret = 0;
struct vr_message_dumper *dumper;
dumper = vr_message_dump_init(&rt->rtr_req);
if (!dumper) {
ret = -ENOMEM;
goto generate_response;
}
if (((vr_route_req *)(dumper->dump_req))->rtr_marker_size == 0)
dumper->dump_been_to_marker = 1;
ret = mtrie_walk(dumper, rt->rtr_req.rtr_family);
generate_response:
vr_message_dump_exit(dumper, ret);
return 0;
}
/*
* Delete a route from the table.
* prefix is in network byte order.
* returns 0 on failure; or non-zero if an entry was found.
*
* When deleting a route:
* - Move all descendent bucket (not covered by more-specifics) with the
* parent of this node.
* - If any buckets contain the same next-hop result, the bucket can be
* deleted. Memory should be freed after a delay in order to deal with
* concurrency.
*/
static int
mtrie_delete(struct vr_rtable * _unused, struct vr_route_req *rt)
{
int vrf_id = rt->rtr_req.rtr_vrf_id;
struct ip_mtrie *rtable;
struct vr_route_req lreq;
rtable = vrfid_to_mtrie(vrf_id, rt->rtr_req.rtr_family);
if (!rtable)
return -ENOENT;
rt->rtr_nh = vrouter_get_nexthop(rt->rtr_req.rtr_rid, rt->rtr_req.rtr_nh_id);
if (!rt->rtr_nh)
return -ENOENT;
rt->rtr_req.rtr_index = VR_BE_INVALID_INDEX;
if ((rt->rtr_req.rtr_mac_size == VR_ETHER_ALEN) &&
(!IS_MAC_ZERO(rt->rtr_req.rtr_mac))) {
lreq.rtr_req.rtr_index = rt->rtr_req.rtr_index;
lreq.rtr_req.rtr_mac_size = VR_ETHER_ALEN;
lreq.rtr_req.rtr_mac = rt->rtr_req.rtr_mac;
lreq.rtr_req.rtr_vrf_id = vrf_id;
if (!vr_bridge_lookup(vrf_id, &lreq))
return -ENOENT;
rt->rtr_req.rtr_index = lreq.rtr_req.rtr_index;
}
if (!(rt->rtr_req.rtr_label_flags & VR_RT_LABEL_VALID_FLAG)) {
rt->rtr_req.rtr_label = 0xFFFFF;
} else {
rt->rtr_req.rtr_label &= 0xFFFFF;
}
__mtrie_delete(rt, &rtable->root, 0);
vrouter_put_nexthop(rt->rtr_nh);
return 0;
}
static inline struct vr_vrf_stats *
mtrie_stats(int vrf, unsigned int cpu)
{
if ((unsigned int)vrf >= vr_vrfs)
return &invalid_vrf_stats[cpu];
if (mtrie_vrf_stats)
return &((mtrie_vrf_stats[vrf])[cpu]);
return NULL;
}
static int
mtrie_stats_get(vr_vrf_stats_req *req, vr_vrf_stats_req *response)
{
unsigned int i;
struct vr_vrf_stats *stats;
memset(response, 0, sizeof(*response));
response->vsr_rid = req->vsr_rid;
response->vsr_family = req->vsr_family;
response->vsr_type = req->vsr_type;
response->vsr_vrf = req->vsr_vrf;
for (i = 0; i < vr_num_cpus; i++) {
stats = mtrie_stats(req->vsr_vrf, i);
if (stats) {
response->vsr_discards += stats->vrf_discards;
response->vsr_resolves += stats->vrf_resolves;
response->vsr_receives += stats->vrf_receives;
response->vsr_l2_receives += stats->vrf_l2_receives;
response->vsr_ecmp_composites += stats->vrf_ecmp_composites;
response->vsr_encap_composites += stats->vrf_encap_composites;
response->vsr_evpn_composites += stats->vrf_evpn_composites;
response->vsr_l2_mcast_composites += stats->vrf_l2_mcast_composites;
response->vsr_fabric_composites += stats->vrf_fabric_composites;
response->vsr_udp_tunnels += stats->vrf_udp_tunnels;
response->vsr_udp_mpls_tunnels += stats->vrf_udp_mpls_tunnels;
response->vsr_gre_mpls_tunnels += stats->vrf_gre_mpls_tunnels;
response->vsr_l2_encaps += stats->vrf_l2_encaps;
response->vsr_encaps += stats->vrf_encaps;
response->vsr_gros += stats->vrf_gros;
response->vsr_diags += stats->vrf_diags;
response->vsr_vxlan_tunnels += stats->vrf_vxlan_tunnels;
response->vsr_arp_virtual_proxy += stats->vrf_arp_virtual_proxy;
response->vsr_arp_virtual_stitch += stats->vrf_arp_virtual_stitch;
response->vsr_arp_virtual_flood += stats->vrf_arp_virtual_flood;
response->vsr_arp_physical_stitch += stats->vrf_arp_physical_stitch;
response->vsr_arp_tor_proxy += stats->vrf_arp_tor_proxy;
response->vsr_arp_physical_flood += stats->vrf_arp_physical_flood;
response->vsr_vrf_translates += stats->vrf_vrf_translates;
response->vsr_uuc_floods += stats->vrf_uuc_floods;
}
}
return 0;
}
static bool
mtrie_stats_empty(vr_vrf_stats_req *r)
{
if (r->vsr_discards || r->vsr_resolves || r->vsr_receives ||
r->vsr_ecmp_composites || r->vsr_l2_mcast_composites ||
r->vsr_fabric_composites || r->vsr_udp_tunnels ||
r->vsr_udp_mpls_tunnels || r->vsr_gre_mpls_tunnels ||
r->vsr_l2_encaps || r->vsr_encaps || r->vsr_gros ||
r->vsr_diags || r->vsr_encap_composites ||
r->vsr_evpn_composites || r->vsr_vrf_translates ||
r->vsr_vxlan_tunnels || r->vsr_arp_virtual_proxy ||
r->vsr_arp_virtual_stitch || r->vsr_arp_virtual_flood ||
r->vsr_arp_physical_stitch || r->vsr_arp_tor_proxy ||
r->vsr_arp_physical_flood || r->vsr_l2_receives ||
r->vsr_uuc_floods)
return false;
return true;
}
static int
mtrie_stats_dump(struct vr_rtable *rtable, vr_vrf_stats_req *req)
{
int ret = 0, len;
unsigned int i;
struct vr_message_dumper *dumper;
vr_vrf_stats_req response;
dumper = vr_message_dump_init(req);
if (!dumper) {
ret = -ENOMEM;
goto generate_response;
}
for (i = req->vsr_marker + 1; i < rtable->algo_max_vrfs; i++) {
req->vsr_vrf = i;
mtrie_stats_get(req, &response);
if (mtrie_stats_empty(&response))
continue;
len = vr_message_dump_object(dumper, VR_VRF_STATS_OBJECT_ID,
&response);
if (len <= 0)
goto generate_response;
}
req->vsr_vrf = -1;
mtrie_stats_get(req, &response);
if (mtrie_stats_empty(&response))
goto generate_response;
len = vr_message_dump_object(dumper, VR_VRF_STATS_OBJECT_ID,
&response);
generate_response:
vr_message_dump_exit(dumper, ret);
return 0;
}
static struct vr_nexthop *
__mtrie_lookup(struct vr_route_req *rt, struct ip_bucket *bkt, unsigned int level)
{
unsigned int i, limit, index;
unsigned long ptr;
struct ip_bucket_entry *ent;
struct mtrie_bkt_info *ip_bkt_info;
struct vr_nexthop *ret_nh = NULL;
if (!bkt || level >= ip_bkt_get_max_level(rt->rtr_req.rtr_family))
return NULL;
ip_bkt_info = ip_bkt_info_get(rt->rtr_req.rtr_family);
index = rt_to_index(rt, level);
if (rt->rtr_req.rtr_prefix_len > ip_bkt_info[level].bi_pfx_len) {
limit = ip_bkt_info[level].bi_size;
} else {
limit = (1 <<
(ip_bkt_info[level].bi_pfx_len - rt->rtr_req.rtr_prefix_len));
}
/*
* ideally, we would have just followed the calculated index to the
* bottom of the tree and returned. however, what happens when the
* bottom of the tree is populated with a more specific route? for
* e.g.: we are searching for 1.1.0.0/16, but we also have a more
* specific route for 1.1.0.0/24. So, to get around that case, we
* need to loop the whole bucket, searching for a prefix length match.
*
* So what happens if all of the prefixes below have a more specific
* route. For e.g.: 1.1.0, 1.1.1, 1.1.2, ... 1.1.255. While there are
* no practical applications of such a route, for correctness, in such
* a case, we loop around the current bucket: i.e. in this case, we will
* loop around the bucket that holds 1.1/16. Maybe 1.2/16 was inherited
* from a lesser specific prefix and hence a match.
*/
for (i = 0; i < ip_bkt_info[level].bi_size; i++) {
ent = index_to_entry(bkt, (index + i) % ip_bkt_info[level].bi_size);
ptr = ent->entry_long_i;
if (PTR_IS_NEXTHOP(ptr)) {
if (i >= limit) {
if (ent->entry_prefix_len >= rt->rtr_req.rtr_prefix_len)
continue;
}
if (ent->entry_prefix_len > rt->rtr_req.rtr_prefix_len)
continue;
rt->rtr_req.rtr_label_flags = ent->entry_label_flags;
rt->rtr_req.rtr_label = ent->entry_label;
rt->rtr_req.rtr_prefix_len = ent->entry_prefix_len;
rt->rtr_req.rtr_index = ent->entry_bridge_index;
ret_nh = PTR_TO_NEXTHOP(ptr);
rt->rtr_nh = ret_nh;
break;
} else {
bkt = PTR_TO_BUCKET(ptr);
ret_nh = __mtrie_lookup(rt, bkt, level + 1);
if (ret_nh)
break;
}
}
return ret_nh;
}
/*
* longest prefix match. go down the tree till you encounter a next-hop.
* if no nexthop, there is something wrong with the tree which was built.
*
* returns the nexthop of the LPM route
*/
static struct vr_nexthop *
mtrie_lookup(unsigned int vrf_id, struct vr_route_req *rt)
{
unsigned int level = 0;
unsigned long ptr;
struct ip_mtrie *table;
struct ip_bucket *bkt;
struct ip_bucket_entry *ent;
struct vr_nexthop *default_nh, *ret_nh;
default_nh = ip4_default_nh;
table = vrfid_to_mtrie(vrf_id, rt->rtr_req.rtr_family);
if (!table) {
rt->rtr_nh = default_nh;
return default_nh;
}
ent = &table->root;
ptr = ent->entry_long_i;
if (!ptr) {
rt->rtr_nh = default_nh;
return default_nh;
}
if (PTR_IS_NEXTHOP(ptr)) {
rt->rtr_req.rtr_label_flags = ent->entry_label_flags;
rt->rtr_req.rtr_label = ent->entry_label;
rt->rtr_req.rtr_prefix_len = ent->entry_prefix_len;
rt->rtr_req.rtr_index = ent->entry_bridge_index;
ret_nh = PTR_TO_NEXTHOP(ptr);
rt->rtr_nh = ret_nh;
return ret_nh;
}
bkt = PTR_TO_BUCKET(ptr);
if (!bkt) {
rt->rtr_nh = default_nh;
return default_nh;
}
ret_nh = __mtrie_lookup(rt, bkt, level);
if (!ret_nh)
ret_nh = default_nh;
rt->rtr_nh = ret_nh;
return ret_nh;
}
/*
* adds a route to the corresponding vrf table. returns 0 on
* success and non-zero otherwise
*/
static int
mtrie_add(struct vr_rtable * _unused, struct vr_route_req *rt)
{
unsigned int vrf_id = rt->rtr_req.rtr_vrf_id;
struct ip_mtrie *mtrie = vrfid_to_mtrie(vrf_id, rt->rtr_req.rtr_family);