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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
1907
1908
1909
1910
1911
1912
1913
1914
1915
1916
1917
1918
1919
1920
1921
1922
1923
1924
1925
1926
1927
1928
1929
1930
1931
1932
1933
1934
1935
1936
1937
1938
1939
1940
1941
1942
1943
1944
1945
1946
1947
1948
1949
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
2051
2052
2053
2054
2055
2056
2057
2058
2059
2060
2061
2062
2063
2064
2065
2066
2067
2068
2069
2070
2071
2072
2073
2074
2075
2076
2077
2078
2079
2080
2081
2082
2083
2084
2085
2086
2087
2088
2089
2090
2091
2092
2093
2094
2095
2096
2097
2098
2099
2100
2101
2102
2103
2104
2105
2106
2107
2108
2109
2110
2111
2112
2113
2114
2115
2116
2117
2118
2119
2120
2121
2122
2123
2124
2125
2126
2127
2128
2129
2130
2131
2132
2133
2134
2135
2136
2137
2138
2139
2140
2141
2142
2143
2144
2145
2146
2147
2148
2149
2150
2151
2152
2153
2154
2155
2156
2157
2158
2159
2160
2161
2162
2163
2164
2165
2166
2167
2168
2169
2170
2171
2172
2173
2174
2175
2176
2177
2178
2179
2180
2181
2182
2183
2184
2185
2186
2187
2188
2189
2190
2191
2192
2193
2194
2195
2196
2197
2198
2199
2200
2201
2202
2203
2204
2205
2206
2207
2208
2209
2210
2211
2212
2213
2214
2215
2216
2217
2218
2219
2220
2221
2222
2223
2224
2225
2226
2227
2228
2229
2230
2231
2232
2233
2234
2235
2236
2237
2238
2239
2240
2241
2242
2243
2244
2245
2246
2247
2248
2249
2250
2251
2252
2253
2254
2255
2256
2257
2258
2259
2260
2261
2262
2263
2264
2265
2266
2267
2268
2269
2270
2271
2272
2273
2274
2275
2276
2277
2278
2279
2280
2281
2282
2283
2284
2285
2286
2287
2288
2289
2290
2291
2292
2293
2294
2295
2296
2297
2298
2299
2300
2301
2302
2303
2304
2305
2306
2307
2308
2309
2310
2311
2312
2313
2314
2315
2316
2317
2318
2319
2320
2321
2322
2323
2324
2325
2326
2327
2328
2329
2330
2331
2332
2333
2334
2335
2336
2337
2338
2339
2340
2341
2342
2343
2344
2345
2346
2347
2348
2349
2350
2351
2352
2353
2354
2355
2356
2357
2358
2359
2360
2361
2362
2363
2364
2365
2366
2367
2368
2369
2370
2371
2372
2373
2374
2375
2376
2377
2378
2379
2380
2381
2382
2383
2384
2385
2386
2387
2388
2389
2390
2391
2392
2393
2394
2395
2396
2397
2398
2399
2400
2401
2402
2403
2404
2405
2406
2407
2408
2409
2410
2411
2412
2413
2414
2415
2416
2417
2418
2419
2420
2421
2422
2423
2424
2425
2426
2427
2428
2429
2430
2431
2432
2433
2434
2435
2436
2437
2438
2439
2440
2441
2442
2443
2444
2445
2446
2447
2448
2449
2450
2451
2452
2453
2454
2455
2456
2457
2458
2459
2460
2461
2462
2463
2464
2465
2466
2467
2468
2469
2470
2471
2472
2473
2474
2475
2476
2477
2478
2479
2480
2481
2482
2483
2484
2485
2486
2487
2488
2489
2490
2491
2492
2493
2494
2495
2496
2497
2498
2499
2500
2501
2502
2503
2504
2505
2506
2507
2508
2509
2510
2511
2512
2513
2514
2515
2516
2517
2518
2519
2520
2521
2522
2523
2524
2525
2526
2527
2528
2529
2530
2531
2532
2533
2534
2535
2536
2537
2538
2539
2540
2541
2542
2543
2544
2545
2546
2547
2548
2549
2550
2551
2552
2553
2554
2555
2556
2557
2558
2559
2560
2561
2562
2563
2564
2565
2566
2567
2568
2569
2570
2571
2572
2573
2574
2575
2576
2577
2578
2579
2580
2581
2582
2583
2584
2585
2586
2587
2588
2589
2590
2591
2592
2593
2594
2595
2596
2597
2598
2599
2600
2601
2602
2603
2604
2605
2606
2607
2608
2609
2610
2611
2612
2613
2614
2615
2616
2617
2618
2619
2620
2621
2622
2623
2624
2625
2626
2627
2628
2629
2630
2631
2632
2633
2634
2635
2636
2637
2638
2639
2640
2641
2642
2643
2644
2645
2646
2647
2648
2649
2650
2651
2652
2653
2654
2655
2656
2657
2658
2659
2660
2661
2662
2663
2664
2665
2666
2667
2668
2669
2670
2671
2672
2673
2674
2675
2676
2677
2678
2679
2680
2681
2682
2683
2684
2685
2686
2687
2688
2689
2690
2691
2692
2693
2694
2695
2696
2697
2698
2699
2700
2701
2702
2703
2704
2705
2706
2707
2708
2709
2710
2711
2712
2713
2714
2715
2716
2717
2718
2719
2720
2721
2722
2723
2724
2725
2726
2727
2728
2729
2730
2731
2732
2733
2734
2735
2736
2737
2738
2739
2740
2741
2742
2743
2744
2745
2746
2747
2748
2749
2750
2751
2752
2753
2754
2755
2756
2757
2758
2759
2760
2761
2762
2763
2764
2765
2766
2767
2768
2769
2770
2771
2772
2773
2774
2775
2776
2777
2778
2779
2780
2781
2782
2783
2784
2785
2786
2787
2788
2789
2790
2791
2792
2793
2794
2795
2796
2797
2798
2799
2800
2801
2802
2803
2804
2805
2806
2807
2808
2809
2810
2811
2812
2813
2814
2815
2816
2817
2818
2819
2820
2821
2822
2823
2824
|
/*
* Copyright (c) 2016 Cisco and/or its affiliates.
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at:
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
#include <vlib/vlib.h>
#include <vnet/vnet.h>
#include <vnet/ip/format.h>
#include <vnet/ip/ip.h>
#include <vnet/dpo/drop_dpo.h>
#include <vnet/dpo/receive_dpo.h>
#include <vnet/dpo/load_balance_map.h>
#include <vnet/dpo/lookup_dpo.h>
#include <vnet/dpo/interface_rx_dpo.h>
#include <vnet/dpo/mpls_disposition.h>
#include <vnet/dpo/dvr_dpo.h>
#include <vnet/dpo/ip_null_dpo.h>
#include <vnet/dpo/classify_dpo.h>
#include <vnet/adj/adj.h>
#include <vnet/adj/adj_mcast.h>
#include <vnet/fib/fib_path.h>
#include <vnet/fib/fib_node.h>
#include <vnet/fib/fib_table.h>
#include <vnet/fib/fib_entry.h>
#include <vnet/fib/fib_path_list.h>
#include <vnet/fib/fib_internal.h>
#include <vnet/fib/fib_urpf_list.h>
#include <vnet/fib/mpls_fib.h>
#include <vnet/fib/fib_path_ext.h>
#include <vnet/udp/udp_encap.h>
#include <vnet/bier/bier_fmask.h>
#include <vnet/bier/bier_table.h>
#include <vnet/bier/bier_imp.h>
#include <vnet/bier/bier_disp_table.h>
/**
* Enurmeration of path types
*/
typedef enum fib_path_type_t_ {
/**
* Marker. Add new types after this one.
*/
FIB_PATH_TYPE_FIRST = 0,
/**
* Attached-nexthop. An interface and a nexthop are known.
*/
FIB_PATH_TYPE_ATTACHED_NEXT_HOP = FIB_PATH_TYPE_FIRST,
/**
* attached. Only the interface is known.
*/
FIB_PATH_TYPE_ATTACHED,
/**
* recursive. Only the next-hop is known.
*/
FIB_PATH_TYPE_RECURSIVE,
/**
* special. nothing is known. so we drop.
*/
FIB_PATH_TYPE_SPECIAL,
/**
* exclusive. user provided adj.
*/
FIB_PATH_TYPE_EXCLUSIVE,
/**
* deag. Link to a lookup adj in the next table
*/
FIB_PATH_TYPE_DEAG,
/**
* interface receive.
*/
FIB_PATH_TYPE_INTF_RX,
/**
* Path resolves via a UDP encap object.
*/
FIB_PATH_TYPE_UDP_ENCAP,
/**
* receive. it's for-us.
*/
FIB_PATH_TYPE_RECEIVE,
/**
* bier-imp. it's via a BIER imposition.
*/
FIB_PATH_TYPE_BIER_IMP,
/**
* bier-fmask. it's via a BIER ECMP-table.
*/
FIB_PATH_TYPE_BIER_TABLE,
/**
* bier-fmask. it's via a BIER f-mask.
*/
FIB_PATH_TYPE_BIER_FMASK,
/**
* via a DVR.
*/
FIB_PATH_TYPE_DVR,
/**
* Marker. Add new types before this one, then update it.
*/
FIB_PATH_TYPE_LAST = FIB_PATH_TYPE_BIER_FMASK,
} __attribute__ ((packed)) fib_path_type_t;
/**
* The maximum number of path_types
*/
#define FIB_PATH_TYPE_MAX (FIB_PATH_TYPE_LAST + 1)
#define FIB_PATH_TYPES { \
[FIB_PATH_TYPE_ATTACHED_NEXT_HOP] = "attached-nexthop", \
[FIB_PATH_TYPE_ATTACHED] = "attached", \
[FIB_PATH_TYPE_RECURSIVE] = "recursive", \
[FIB_PATH_TYPE_SPECIAL] = "special", \
[FIB_PATH_TYPE_EXCLUSIVE] = "exclusive", \
[FIB_PATH_TYPE_DEAG] = "deag", \
[FIB_PATH_TYPE_INTF_RX] = "intf-rx", \
[FIB_PATH_TYPE_UDP_ENCAP] = "udp-encap", \
[FIB_PATH_TYPE_RECEIVE] = "receive", \
[FIB_PATH_TYPE_BIER_IMP] = "bier-imp", \
[FIB_PATH_TYPE_BIER_TABLE] = "bier-table", \
[FIB_PATH_TYPE_BIER_FMASK] = "bier-fmask", \
[FIB_PATH_TYPE_DVR] = "dvr", \
}
#define FOR_EACH_FIB_PATH_TYPE(_item) \
for (_item = FIB_PATH_TYPE_FIRST; \
_item <= FIB_PATH_TYPE_LAST; \
_item++)
/**
* Enurmeration of path operational (i.e. derived) attributes
*/
typedef enum fib_path_oper_attribute_t_ {
/**
* Marker. Add new types after this one.
*/
FIB_PATH_OPER_ATTRIBUTE_FIRST = 0,
/**
* The path forms part of a recursive loop.
*/
FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP = FIB_PATH_OPER_ATTRIBUTE_FIRST,
/**
* The path is resolved
*/
FIB_PATH_OPER_ATTRIBUTE_RESOLVED,
/**
* The path is attached, despite what the next-hop may say.
*/
FIB_PATH_OPER_ATTRIBUTE_ATTACHED,
/**
* The path has become a permanent drop.
*/
FIB_PATH_OPER_ATTRIBUTE_DROP,
/**
* Marker. Add new types before this one, then update it.
*/
FIB_PATH_OPER_ATTRIBUTE_LAST = FIB_PATH_OPER_ATTRIBUTE_DROP,
} __attribute__ ((packed)) fib_path_oper_attribute_t;
/**
* The maximum number of path operational attributes
*/
#define FIB_PATH_OPER_ATTRIBUTE_MAX (FIB_PATH_OPER_ATTRIBUTE_LAST + 1)
#define FIB_PATH_OPER_ATTRIBUTES { \
[FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP] = "recursive-loop", \
[FIB_PATH_OPER_ATTRIBUTE_RESOLVED] = "resolved", \
[FIB_PATH_OPER_ATTRIBUTE_DROP] = "drop", \
}
#define FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(_item) \
for (_item = FIB_PATH_OPER_ATTRIBUTE_FIRST; \
_item <= FIB_PATH_OPER_ATTRIBUTE_LAST; \
_item++)
/**
* Path flags from the attributes
*/
typedef enum fib_path_oper_flags_t_ {
FIB_PATH_OPER_FLAG_NONE = 0,
FIB_PATH_OPER_FLAG_RECURSIVE_LOOP = (1 << FIB_PATH_OPER_ATTRIBUTE_RECURSIVE_LOOP),
FIB_PATH_OPER_FLAG_DROP = (1 << FIB_PATH_OPER_ATTRIBUTE_DROP),
FIB_PATH_OPER_FLAG_RESOLVED = (1 << FIB_PATH_OPER_ATTRIBUTE_RESOLVED),
FIB_PATH_OPER_FLAG_ATTACHED = (1 << FIB_PATH_OPER_ATTRIBUTE_ATTACHED),
} __attribute__ ((packed)) fib_path_oper_flags_t;
/**
* A FIB path
*/
typedef struct fib_path_t_ {
/**
* A path is a node in the FIB graph.
*/
fib_node_t fp_node;
/**
* The index of the path-list to which this path belongs
*/
u32 fp_pl_index;
/**
* This marks the start of the memory area used to hash
* the path
*/
STRUCT_MARK(path_hash_start);
/**
* Configuration Flags
*/
fib_path_cfg_flags_t fp_cfg_flags;
/**
* The type of the path. This is the selector for the union
*/
fib_path_type_t fp_type;
/**
* The protocol of the next-hop, i.e. the address family of the
* next-hop's address. We can't derive this from the address itself
* since the address can be all zeros
*/
dpo_proto_t fp_nh_proto;
/**
* UCMP [unnormalised] weigth
*/
u8 fp_weight;
/**
* A path preference. 0 is the best.
* Only paths of the best preference, that are 'up', are considered
* for forwarding.
*/
u8 fp_preference;
/**
* per-type union of the data required to resolve the path
*/
union {
struct {
/**
* The next-hop
*/
ip46_address_t fp_nh;
/**
* The interface
*/
u32 fp_interface;
} attached_next_hop;
struct {
/**
* The interface
*/
u32 fp_interface;
} attached;
struct {
union
{
/**
* The next-hop
*/
ip46_address_t fp_ip;
struct {
/**
* The local label to resolve through.
*/
mpls_label_t fp_local_label;
/**
* The EOS bit of the resolving label
*/
mpls_eos_bit_t fp_eos;
};
} fp_nh;
union {
/**
* The FIB table index in which to find the next-hop.
*/
fib_node_index_t fp_tbl_id;
/**
* The BIER FIB the fmask is in
*/
index_t fp_bier_fib;
};
} recursive;
struct {
/**
* BIER FMask ID
*/
index_t fp_bier_fmask;
} bier_fmask;
struct {
/**
* The BIER table's ID
*/
bier_table_id_t fp_bier_tbl;
} bier_table;
struct {
/**
* The BIER imposition object
* this is part of the path's key, since the index_t
* of an imposition object is the object's key.
*/
index_t fp_bier_imp;
} bier_imp;
struct {
/**
* The FIB index in which to perfom the next lookup
*/
fib_node_index_t fp_tbl_id;
/**
* The RPF-ID to tag the packets with
*/
fib_rpf_id_t fp_rpf_id;
} deag;
struct {
} special;
struct {
/**
* The user provided 'exclusive' DPO
*/
dpo_id_t fp_ex_dpo;
} exclusive;
struct {
/**
* The interface on which the local address is configured
*/
u32 fp_interface;
/**
* The next-hop
*/
ip46_address_t fp_addr;
} receive;
struct {
/**
* The interface on which the packets will be input.
*/
u32 fp_interface;
} intf_rx;
struct {
/**
* The UDP Encap object this path resolves through
*/
u32 fp_udp_encap_id;
} udp_encap;
struct {
/**
* The UDP Encap object this path resolves through
*/
u32 fp_classify_table_id;
} classify;
struct {
/**
* The interface
*/
u32 fp_interface;
} dvr;
};
STRUCT_MARK(path_hash_end);
/**
* Memebers in this last section represent information that is
* dervied during resolution. It should not be copied to new paths
* nor compared.
*/
/**
* Operational Flags
*/
fib_path_oper_flags_t fp_oper_flags;
union {
/**
* the resolving via fib. not part of the union, since it it not part
* of the path's hash.
*/
fib_node_index_t fp_via_fib;
/**
* the resolving bier-table
*/
index_t fp_via_bier_tbl;
/**
* the resolving bier-fmask
*/
index_t fp_via_bier_fmask;
};
/**
* The Data-path objects through which this path resolves for IP.
*/
dpo_id_t fp_dpo;
/**
* the index of this path in the parent's child list.
*/
u32 fp_sibling;
} fib_path_t;
/*
* Array of strings/names for the path types and attributes
*/
static const char *fib_path_type_names[] = FIB_PATH_TYPES;
static const char *fib_path_oper_attribute_names[] = FIB_PATH_OPER_ATTRIBUTES;
static const char *fib_path_cfg_attribute_names[] = FIB_PATH_CFG_ATTRIBUTES;
/*
* The memory pool from which we allocate all the paths
*/
static fib_path_t *fib_path_pool;
/**
* the logger
*/
vlib_log_class_t fib_path_logger;
/*
* Debug macro
*/
#define FIB_PATH_DBG(_p, _fmt, _args...) \
{ \
vlib_log_debug (fib_path_logger, \
"[%U]: " _fmt, \
format_fib_path, fib_path_get_index(_p), 0, \
FIB_PATH_FORMAT_FLAGS_ONE_LINE, \
##_args); \
}
static fib_path_t *
fib_path_get (fib_node_index_t index)
{
return (pool_elt_at_index(fib_path_pool, index));
}
static fib_node_index_t
fib_path_get_index (fib_path_t *path)
{
return (path - fib_path_pool);
}
static fib_node_t *
fib_path_get_node (fib_node_index_t index)
{
return ((fib_node_t*)fib_path_get(index));
}
static fib_path_t*
fib_path_from_fib_node (fib_node_t *node)
{
ASSERT(FIB_NODE_TYPE_PATH == node->fn_type);
return ((fib_path_t*)node);
}
u8 *
format_fib_path (u8 * s, va_list * args)
{
fib_node_index_t path_index = va_arg (*args, fib_node_index_t);
u32 indent = va_arg (*args, u32);
fib_format_path_flags_t flags = va_arg (*args, fib_format_path_flags_t);
vnet_main_t * vnm = vnet_get_main();
fib_path_oper_attribute_t oattr;
fib_path_cfg_attribute_t cattr;
fib_path_t *path;
const char *eol;
if (flags & FIB_PATH_FORMAT_FLAGS_ONE_LINE)
{
eol = "";
}
else
{
eol = "\n";
}
path = fib_path_get(path_index);
s = format (s, "%Upath:[%d] ", format_white_space, indent,
fib_path_get_index(path));
s = format (s, "pl-index:%d ", path->fp_pl_index);
s = format (s, "%U ", format_dpo_proto, path->fp_nh_proto);
s = format (s, "weight=%d ", path->fp_weight);
s = format (s, "pref=%d ", path->fp_preference);
s = format (s, "%s: ", fib_path_type_names[path->fp_type]);
if (FIB_PATH_OPER_FLAG_NONE != path->fp_oper_flags) {
s = format(s, " oper-flags:");
FOR_EACH_FIB_PATH_OPER_ATTRIBUTE(oattr) {
if ((1<<oattr) & path->fp_oper_flags) {
s = format (s, "%s,", fib_path_oper_attribute_names[oattr]);
}
}
}
if (FIB_PATH_CFG_FLAG_NONE != path->fp_cfg_flags) {
s = format(s, " cfg-flags:");
FOR_EACH_FIB_PATH_CFG_ATTRIBUTE(cattr) {
if ((1<<cattr) & path->fp_cfg_flags) {
s = format (s, "%s,", fib_path_cfg_attribute_names[cattr]);
}
}
}
if (!(flags & FIB_PATH_FORMAT_FLAGS_ONE_LINE))
s = format(s, "\n%U", format_white_space, indent+2);
switch (path->fp_type)
{
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
s = format (s, "%U", format_ip46_address,
&path->attached_next_hop.fp_nh,
IP46_TYPE_ANY);
if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
{
s = format (s, " if_index:%d", path->attached_next_hop.fp_interface);
}
else
{
s = format (s, " %U",
format_vnet_sw_interface_name,
vnm,
vnet_get_sw_interface(
vnm,
path->attached_next_hop.fp_interface));
if (vnet_sw_interface_is_p2p(vnet_get_main(),
path->attached_next_hop.fp_interface))
{
s = format (s, " (p2p)");
}
}
if (!dpo_id_is_valid(&path->fp_dpo))
{
s = format(s, "%s%Uunresolved", eol, format_white_space, indent+2);
}
else
{
s = format(s, "%s%U%U", eol,
format_white_space, indent,
format_dpo_id,
&path->fp_dpo, 13);
}
break;
case FIB_PATH_TYPE_ATTACHED:
if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP)
{
s = format (s, "if_index:%d", path->attached_next_hop.fp_interface);
}
else
{
s = format (s, " %U",
format_vnet_sw_interface_name,
vnm,
vnet_get_sw_interface(
vnm,
path->attached.fp_interface));
}
break;
case FIB_PATH_TYPE_RECURSIVE:
if (DPO_PROTO_MPLS == path->fp_nh_proto)
{
s = format (s, "via %U %U",
format_mpls_unicast_label,
path->recursive.fp_nh.fp_local_label,
format_mpls_eos_bit,
path->recursive.fp_nh.fp_eos);
}
else
{
s = format (s, "via %U",
format_ip46_address,
&path->recursive.fp_nh.fp_ip,
IP46_TYPE_ANY);
}
s = format (s, " in fib:%d",
path->recursive.fp_tbl_id,
path->fp_via_fib);
s = format (s, " via-fib:%d", path->fp_via_fib);
s = format (s, " via-dpo:[%U:%d]",
format_dpo_type, path->fp_dpo.dpoi_type,
path->fp_dpo.dpoi_index);
break;
case FIB_PATH_TYPE_UDP_ENCAP:
s = format (s, "UDP-encap ID:%d", path->udp_encap.fp_udp_encap_id);
break;
case FIB_PATH_TYPE_BIER_TABLE:
s = format (s, "via bier-table:[%U}",
format_bier_table_id,
&path->bier_table.fp_bier_tbl);
s = format (s, " via-dpo:[%U:%d]",
format_dpo_type, path->fp_dpo.dpoi_type,
path->fp_dpo.dpoi_index);
break;
case FIB_PATH_TYPE_BIER_FMASK:
s = format (s, "via-fmask:%d", path->bier_fmask.fp_bier_fmask);
s = format (s, " via-dpo:[%U:%d]",
format_dpo_type, path->fp_dpo.dpoi_type,
path->fp_dpo.dpoi_index);
break;
case FIB_PATH_TYPE_BIER_IMP:
s = format (s, "via %U", format_bier_imp,
path->bier_imp.fp_bier_imp, 0, BIER_SHOW_BRIEF);
break;
case FIB_PATH_TYPE_DVR:
s = format (s, " %U",
format_vnet_sw_interface_name,
vnm,
vnet_get_sw_interface(
vnm,
path->dvr.fp_interface));
break;
case FIB_PATH_TYPE_DEAG:
s = format (s, " %sfib-index:%d",
(path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID ? "m" : ""),
path->deag.fp_tbl_id);
break;
case FIB_PATH_TYPE_RECEIVE:
case FIB_PATH_TYPE_INTF_RX:
case FIB_PATH_TYPE_SPECIAL:
case FIB_PATH_TYPE_EXCLUSIVE:
if (dpo_id_is_valid(&path->fp_dpo))
{
s = format(s, "%U", format_dpo_id,
&path->fp_dpo, indent+2);
}
break;
}
return (s);
}
/*
* fib_path_last_lock_gone
*
* We don't share paths, we share path lists, so the [un]lock functions
* are no-ops
*/
static void
fib_path_last_lock_gone (fib_node_t *node)
{
ASSERT(0);
}
static const adj_index_t
fib_path_attached_next_hop_get_adj (fib_path_t *path,
vnet_link_t link)
{
if (vnet_sw_interface_is_p2p(vnet_get_main(),
path->attached_next_hop.fp_interface))
{
/*
* if the interface is p2p then the adj for the specific
* neighbour on that link will never exist. on p2p links
* the subnet address (the attached route) links to the
* auto-adj (see below), we want that adj here too.
*/
return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
link,
&zero_addr,
path->attached_next_hop.fp_interface));
}
else
{
return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
link,
&path->attached_next_hop.fp_nh,
path->attached_next_hop.fp_interface));
}
}
static void
fib_path_attached_next_hop_set (fib_path_t *path)
{
/*
* resolve directly via the adjacnecy discribed by the
* interface and next-hop
*/
dpo_set(&path->fp_dpo,
DPO_ADJACENCY,
path->fp_nh_proto,
fib_path_attached_next_hop_get_adj(
path,
dpo_proto_to_link(path->fp_nh_proto)));
/*
* become a child of the adjacency so we receive updates
* when its rewrite changes
*/
path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
FIB_NODE_TYPE_PATH,
fib_path_get_index(path));
if (!vnet_sw_interface_is_up(vnet_get_main(),
path->attached_next_hop.fp_interface) ||
!adj_is_up(path->fp_dpo.dpoi_index))
{
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
}
}
static const adj_index_t
fib_path_attached_get_adj (fib_path_t *path,
vnet_link_t link)
{
if (vnet_sw_interface_is_p2p(vnet_get_main(),
path->attached.fp_interface))
{
/*
* point-2-point interfaces do not require a glean, since
* there is nothing to ARP. Install a rewrite/nbr adj instead
*/
return (adj_nbr_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
link,
&zero_addr,
path->attached.fp_interface));
}
else
{
return (adj_glean_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
link,
path->attached.fp_interface,
NULL));
}
}
/*
* create of update the paths recursive adj
*/
static void
fib_path_recursive_adj_update (fib_path_t *path,
fib_forward_chain_type_t fct,
dpo_id_t *dpo)
{
dpo_id_t via_dpo = DPO_INVALID;
/*
* get the DPO to resolve through from the via-entry
*/
fib_entry_contribute_forwarding(path->fp_via_fib,
fct,
&via_dpo);
/*
* hope for the best - clear if restrictions apply.
*/
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
/*
* Validate any recursion constraints and over-ride the via
* adj if not met
*/
if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP)
{
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
}
else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)
{
/*
* the via FIB must be a host route.
* note the via FIB just added will always be a host route
* since it is an RR source added host route. So what we need to
* check is whether the route has other sources. If it does then
* some other source has added it as a host route. If it doesn't
* then it was added only here and inherits forwarding from a cover.
* the cover is not a host route.
* The RR source is the lowest priority source, so we check if it
* is the best. if it is there are no other sources.
*/
if (fib_entry_get_best_source(path->fp_via_fib) >= FIB_SOURCE_RR)
{
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
/*
* PIC edge trigger. let the load-balance maps know
*/
load_balance_map_path_state_change(fib_path_get_index(path));
}
}
else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED)
{
/*
* RR source entries inherit the flags from the cover, so
* we can check the via directly
*/
if (!(FIB_ENTRY_FLAG_ATTACHED & fib_entry_get_flags(path->fp_via_fib)))
{
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
/*
* PIC edge trigger. let the load-balance maps know
*/
load_balance_map_path_state_change(fib_path_get_index(path));
}
}
/*
* check for over-riding factors on the FIB entry itself
*/
if (!fib_entry_is_resolved(path->fp_via_fib))
{
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
dpo_copy(&via_dpo, drop_dpo_get(path->fp_nh_proto));
/*
* PIC edge trigger. let the load-balance maps know
*/
load_balance_map_path_state_change(fib_path_get_index(path));
}
/*
* If this path is contributing a drop, then it's not resolved
*/
if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
{
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
}
/*
* update the path's contributed DPO
*/
dpo_copy(dpo, &via_dpo);
FIB_PATH_DBG(path, "recursive update:");
dpo_reset(&via_dpo);
}
/*
* re-evaulate the forwarding state for a via fmask path
*/
static void
fib_path_bier_fmask_update (fib_path_t *path,
dpo_id_t *dpo)
{
bier_fmask_contribute_forwarding(path->bier_fmask.fp_bier_fmask, dpo);
/*
* if we are stakcing on the drop, then the path is not resolved
*/
if (dpo_is_drop(dpo))
{
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
}
else
{
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
}
}
/*
* fib_path_is_permanent_drop
*
* Return !0 if the path is configured to permanently drop,
* despite other attributes.
*/
static int
fib_path_is_permanent_drop (fib_path_t *path)
{
return ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DROP) ||
(path->fp_oper_flags & FIB_PATH_OPER_FLAG_DROP));
}
/*
* fib_path_unresolve
*
* Remove our dependency on the resolution target
*/
static void
fib_path_unresolve (fib_path_t *path)
{
/*
* the forced drop path does not need unresolving
*/
if (fib_path_is_permanent_drop(path))
{
return;
}
switch (path->fp_type)
{
case FIB_PATH_TYPE_RECURSIVE:
if (FIB_NODE_INDEX_INVALID != path->fp_via_fib)
{
fib_entry_child_remove(path->fp_via_fib,
path->fp_sibling);
fib_table_entry_special_remove(path->recursive.fp_tbl_id,
fib_entry_get_prefix(path->fp_via_fib),
FIB_SOURCE_RR);
fib_table_unlock(path->recursive.fp_tbl_id,
dpo_proto_to_fib(path->fp_nh_proto),
FIB_SOURCE_RR);
path->fp_via_fib = FIB_NODE_INDEX_INVALID;
}
break;
case FIB_PATH_TYPE_BIER_FMASK:
bier_fmask_child_remove(path->fp_via_bier_fmask,
path->fp_sibling);
break;
case FIB_PATH_TYPE_BIER_IMP:
bier_imp_unlock(path->fp_dpo.dpoi_index);
break;
case FIB_PATH_TYPE_BIER_TABLE:
bier_table_ecmp_unlock(path->fp_via_bier_tbl);
break;
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
adj_child_remove(path->fp_dpo.dpoi_index,
path->fp_sibling);
adj_unlock(path->fp_dpo.dpoi_index);
break;
case FIB_PATH_TYPE_ATTACHED:
adj_child_remove(path->fp_dpo.dpoi_index,
path->fp_sibling);
adj_unlock(path->fp_dpo.dpoi_index);
break;
case FIB_PATH_TYPE_UDP_ENCAP:
udp_encap_unlock(path->fp_dpo.dpoi_index);
break;
case FIB_PATH_TYPE_EXCLUSIVE:
dpo_reset(&path->exclusive.fp_ex_dpo);
break;
case FIB_PATH_TYPE_SPECIAL:
case FIB_PATH_TYPE_RECEIVE:
case FIB_PATH_TYPE_INTF_RX:
case FIB_PATH_TYPE_DEAG:
case FIB_PATH_TYPE_DVR:
/*
* these hold only the path's DPO, which is reset below.
*/
break;
}
/*
* release the adj we were holding and pick up the
* drop just in case.
*/
dpo_reset(&path->fp_dpo);
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
return;
}
static fib_forward_chain_type_t
fib_path_to_chain_type (const fib_path_t *path)
{
if (DPO_PROTO_MPLS == path->fp_nh_proto)
{
if (FIB_PATH_TYPE_RECURSIVE == path->fp_type &&
MPLS_EOS == path->recursive.fp_nh.fp_eos)
{
return (FIB_FORW_CHAIN_TYPE_MPLS_EOS);
}
else
{
return (FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS);
}
}
else
{
return (fib_forw_chain_type_from_dpo_proto(path->fp_nh_proto));
}
}
/*
* fib_path_back_walk_notify
*
* A back walk has reach this path.
*/
static fib_node_back_walk_rc_t
fib_path_back_walk_notify (fib_node_t *node,
fib_node_back_walk_ctx_t *ctx)
{
fib_path_t *path;
path = fib_path_from_fib_node(node);
FIB_PATH_DBG(path, "bw:%U",
format_fib_node_bw_reason, ctx->fnbw_reason);
switch (path->fp_type)
{
case FIB_PATH_TYPE_RECURSIVE:
if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
{
/*
* modify the recursive adjacency to use the new forwarding
* of the via-fib.
* this update is visible to packets in flight in the DP.
*/
fib_path_recursive_adj_update(
path,
fib_path_to_chain_type(path),
&path->fp_dpo);
}
if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
(FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
{
/*
* ADJ updates (complete<->incomplete) do not need to propagate to
* recursive entries.
* The only reason its needed as far back as here, is that the adj
* and the incomplete adj are a different DPO type, so the LBs need
* to re-stack.
* If this walk was quashed in the fib_entry, then any non-fib_path
* children (like tunnels that collapse out the LB when they stack)
* would not see the update.
*/
return (FIB_NODE_BACK_WALK_CONTINUE);
}
break;
case FIB_PATH_TYPE_BIER_FMASK:
if (FIB_NODE_BW_REASON_FLAG_EVALUATE & ctx->fnbw_reason)
{
/*
* update to use the BIER fmask's new forwading
*/
fib_path_bier_fmask_update(path, &path->fp_dpo);
}
if ((FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason) ||
(FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason))
{
/*
* ADJ updates (complete<->incomplete) do not need to propagate to
* recursive entries.
* The only reason its needed as far back as here, is that the adj
* and the incomplete adj are a different DPO type, so the LBs need
* to re-stack.
* If this walk was quashed in the fib_entry, then any non-fib_path
* children (like tunnels that collapse out the LB when they stack)
* would not see the update.
*/
return (FIB_NODE_BACK_WALK_CONTINUE);
}
break;
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
/*
FIXME comment
* ADJ_UPDATE backwalk pass silently through here and up to
* the path-list when the multipath adj collapse occurs.
* The reason we do this is that the assumtption is that VPP
* runs in an environment where the Control-Plane is remote
* and hence reacts slowly to link up down. In order to remove
* this down link from the ECMP set quickly, we back-walk.
* VPP also has dedicated CPUs, so we are not stealing resources
* from the CP to do so.
*/
if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
{
if (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED)
{
/*
* alreday resolved. no need to walk back again
*/
return (FIB_NODE_BACK_WALK_CONTINUE);
}
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
}
if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
{
if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
{
/*
* alreday unresolved. no need to walk back again
*/
return (FIB_NODE_BACK_WALK_CONTINUE);
}
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
}
if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
{
/*
* The interface this path resolves through has been deleted.
* This will leave the path in a permanent drop state. The route
* needs to be removed and readded (and hence the path-list deleted)
* before it can forward again.
*/
fib_path_unresolve(path);
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
}
if (FIB_NODE_BW_REASON_FLAG_ADJ_UPDATE & ctx->fnbw_reason)
{
/*
* restack the DPO to pick up the correct DPO sub-type
*/
uword if_is_up;
adj_index_t ai;
if_is_up = vnet_sw_interface_is_up(
vnet_get_main(),
path->attached_next_hop.fp_interface);
ai = fib_path_attached_next_hop_get_adj(
path,
dpo_proto_to_link(path->fp_nh_proto));
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
if (if_is_up && adj_is_up(ai))
{
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
}
dpo_set(&path->fp_dpo, DPO_ADJACENCY, path->fp_nh_proto, ai);
adj_unlock(ai);
if (!if_is_up)
{
/*
* If the interface is not up there is no reason to walk
* back to children. if we did they would only evalute
* that this path is unresolved and hence it would
* not contribute the adjacency - so it would be wasted
* CPU time.
*/
return (FIB_NODE_BACK_WALK_CONTINUE);
}
}
if (FIB_NODE_BW_REASON_FLAG_ADJ_DOWN & ctx->fnbw_reason)
{
if (!(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED))
{
/*
* alreday unresolved. no need to walk back again
*/
return (FIB_NODE_BACK_WALK_CONTINUE);
}
/*
* the adj has gone down. the path is no longer resolved.
*/
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
}
break;
case FIB_PATH_TYPE_ATTACHED:
case FIB_PATH_TYPE_DVR:
/*
* FIXME; this could schedule a lower priority walk, since attached
* routes are not usually in ECMP configurations so the backwalk to
* the FIB entry does not need to be high priority
*/
if (FIB_NODE_BW_REASON_FLAG_INTERFACE_UP & ctx->fnbw_reason)
{
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
}
if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DOWN & ctx->fnbw_reason)
{
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
}
if (FIB_NODE_BW_REASON_FLAG_INTERFACE_DELETE & ctx->fnbw_reason)
{
fib_path_unresolve(path);
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_DROP;
}
break;
case FIB_PATH_TYPE_UDP_ENCAP:
{
dpo_id_t via_dpo = DPO_INVALID;
/*
* hope for the best - clear if restrictions apply.
*/
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
path->fp_nh_proto,
&via_dpo);
/*
* If this path is contributing a drop, then it's not resolved
*/
if (dpo_is_drop(&via_dpo) || load_balance_is_drop(&via_dpo))
{
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
}
/*
* update the path's contributed DPO
*/
dpo_copy(&path->fp_dpo, &via_dpo);
dpo_reset(&via_dpo);
break;
}
case FIB_PATH_TYPE_INTF_RX:
ASSERT(0);
case FIB_PATH_TYPE_DEAG:
/*
* FIXME When VRF delete is allowed this will need a poke.
*/
case FIB_PATH_TYPE_SPECIAL:
case FIB_PATH_TYPE_RECEIVE:
case FIB_PATH_TYPE_EXCLUSIVE:
case FIB_PATH_TYPE_BIER_TABLE:
case FIB_PATH_TYPE_BIER_IMP:
/*
* these path types have no parents. so to be
* walked from one is unexpected.
*/
ASSERT(0);
break;
}
/*
* propagate the backwalk further to the path-list
*/
fib_path_list_back_walk(path->fp_pl_index, ctx);
return (FIB_NODE_BACK_WALK_CONTINUE);
}
static void
fib_path_memory_show (void)
{
fib_show_memory_usage("Path",
pool_elts(fib_path_pool),
pool_len(fib_path_pool),
sizeof(fib_path_t));
}
/*
* The FIB path's graph node virtual function table
*/
static const fib_node_vft_t fib_path_vft = {
.fnv_get = fib_path_get_node,
.fnv_last_lock = fib_path_last_lock_gone,
.fnv_back_walk = fib_path_back_walk_notify,
.fnv_mem_show = fib_path_memory_show,
};
static fib_path_cfg_flags_t
fib_path_route_flags_to_cfg_flags (const fib_route_path_t *rpath)
{
fib_path_cfg_flags_t cfg_flags = FIB_PATH_CFG_FLAG_NONE;
if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_HOST)
cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_HOST;
if (rpath->frp_flags & FIB_ROUTE_PATH_RESOLVE_VIA_ATTACHED)
cfg_flags |= FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED;
if (rpath->frp_flags & FIB_ROUTE_PATH_LOCAL)
cfg_flags |= FIB_PATH_CFG_FLAG_LOCAL;
if (rpath->frp_flags & FIB_ROUTE_PATH_ATTACHED)
cfg_flags |= FIB_PATH_CFG_FLAG_ATTACHED;
if (rpath->frp_flags & FIB_ROUTE_PATH_INTF_RX)
cfg_flags |= FIB_PATH_CFG_FLAG_INTF_RX;
if (rpath->frp_flags & FIB_ROUTE_PATH_RPF_ID)
cfg_flags |= FIB_PATH_CFG_FLAG_RPF_ID;
if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
cfg_flags |= FIB_PATH_CFG_FLAG_EXCLUSIVE;
if (rpath->frp_flags & FIB_ROUTE_PATH_DROP)
cfg_flags |= FIB_PATH_CFG_FLAG_DROP;
if (rpath->frp_flags & FIB_ROUTE_PATH_SOURCE_LOOKUP)
cfg_flags |= FIB_PATH_CFG_FLAG_DEAG_SRC;
if (rpath->frp_flags & FIB_ROUTE_PATH_ICMP_UNREACH)
cfg_flags |= FIB_PATH_CFG_FLAG_ICMP_UNREACH;
if (rpath->frp_flags & FIB_ROUTE_PATH_ICMP_PROHIBIT)
cfg_flags |= FIB_PATH_CFG_FLAG_ICMP_PROHIBIT;
return (cfg_flags);
}
/*
* fib_path_create
*
* Create and initialise a new path object.
* return the index of the path.
*/
fib_node_index_t
fib_path_create (fib_node_index_t pl_index,
const fib_route_path_t *rpath)
{
fib_path_t *path;
pool_get(fib_path_pool, path);
clib_memset(path, 0, sizeof(*path));
fib_node_init(&path->fp_node,
FIB_NODE_TYPE_PATH);
dpo_reset(&path->fp_dpo);
path->fp_pl_index = pl_index;
path->fp_nh_proto = rpath->frp_proto;
path->fp_via_fib = FIB_NODE_INDEX_INVALID;
path->fp_weight = rpath->frp_weight;
if (0 == path->fp_weight)
{
/*
* a weight of 0 is a meaningless value. We could either reject it, and thus force
* clients to always use 1, or we can accept it and fixup approrpiately.
*/
path->fp_weight = 1;
}
path->fp_preference = rpath->frp_preference;
path->fp_cfg_flags = fib_path_route_flags_to_cfg_flags(rpath);
/*
* deduce the path's tpye from the parementers and save what is needed.
*/
if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_LOCAL)
{
path->fp_type = FIB_PATH_TYPE_RECEIVE;
path->receive.fp_interface = rpath->frp_sw_if_index;
path->receive.fp_addr = rpath->frp_addr;
}
else if (rpath->frp_flags & FIB_ROUTE_PATH_UDP_ENCAP)
{
path->fp_type = FIB_PATH_TYPE_UDP_ENCAP;
path->udp_encap.fp_udp_encap_id = rpath->frp_udp_encap_id;
}
else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_INTF_RX)
{
path->fp_type = FIB_PATH_TYPE_INTF_RX;
path->intf_rx.fp_interface = rpath->frp_sw_if_index;
}
else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
{
path->fp_type = FIB_PATH_TYPE_DEAG;
path->deag.fp_tbl_id = rpath->frp_fib_index;
path->deag.fp_rpf_id = rpath->frp_rpf_id;
}
else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_FMASK)
{
path->fp_type = FIB_PATH_TYPE_BIER_FMASK;
path->bier_fmask.fp_bier_fmask = rpath->frp_bier_fmask;
}
else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_IMP)
{
path->fp_type = FIB_PATH_TYPE_BIER_IMP;
path->bier_imp.fp_bier_imp = rpath->frp_bier_imp;
}
else if (rpath->frp_flags & FIB_ROUTE_PATH_BIER_TABLE)
{
path->fp_type = FIB_PATH_TYPE_BIER_TABLE;
path->bier_table.fp_bier_tbl = rpath->frp_bier_tbl;
}
else if (rpath->frp_flags & FIB_ROUTE_PATH_DEAG)
{
path->fp_type = FIB_PATH_TYPE_DEAG;
path->deag.fp_tbl_id = rpath->frp_fib_index;
}
else if (rpath->frp_flags & FIB_ROUTE_PATH_DVR)
{
path->fp_type = FIB_PATH_TYPE_DVR;
path->dvr.fp_interface = rpath->frp_sw_if_index;
}
else if (rpath->frp_flags & FIB_ROUTE_PATH_EXCLUSIVE)
{
path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
dpo_copy(&path->exclusive.fp_ex_dpo, &rpath->dpo);
}
else if ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_PROHIBIT) ||
(path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_UNREACH))
{
path->fp_type = FIB_PATH_TYPE_SPECIAL;
}
else if ((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_CLASSIFY))
{
path->fp_type = FIB_PATH_TYPE_SPECIAL;
path->classify.fp_classify_table_id = rpath->frp_classify_table_id;
}
else if (~0 != rpath->frp_sw_if_index)
{
if (ip46_address_is_zero(&rpath->frp_addr))
{
path->fp_type = FIB_PATH_TYPE_ATTACHED;
path->attached.fp_interface = rpath->frp_sw_if_index;
}
else
{
path->fp_type = FIB_PATH_TYPE_ATTACHED_NEXT_HOP;
path->attached_next_hop.fp_interface = rpath->frp_sw_if_index;
path->attached_next_hop.fp_nh = rpath->frp_addr;
}
}
else
{
if (ip46_address_is_zero(&rpath->frp_addr))
{
if (~0 == rpath->frp_fib_index)
{
path->fp_type = FIB_PATH_TYPE_SPECIAL;
}
else
{
path->fp_type = FIB_PATH_TYPE_DEAG;
path->deag.fp_tbl_id = rpath->frp_fib_index;
path->deag.fp_rpf_id = ~0;
}
}
else
{
path->fp_type = FIB_PATH_TYPE_RECURSIVE;
if (DPO_PROTO_MPLS == path->fp_nh_proto)
{
path->recursive.fp_nh.fp_local_label = rpath->frp_local_label;
path->recursive.fp_nh.fp_eos = rpath->frp_eos;
}
else
{
path->recursive.fp_nh.fp_ip = rpath->frp_addr;
}
path->recursive.fp_tbl_id = rpath->frp_fib_index;
}
}
FIB_PATH_DBG(path, "create");
return (fib_path_get_index(path));
}
/*
* fib_path_create_special
*
* Create and initialise a new path object.
* return the index of the path.
*/
fib_node_index_t
fib_path_create_special (fib_node_index_t pl_index,
dpo_proto_t nh_proto,
fib_path_cfg_flags_t flags,
const dpo_id_t *dpo)
{
fib_path_t *path;
pool_get(fib_path_pool, path);
clib_memset(path, 0, sizeof(*path));
fib_node_init(&path->fp_node,
FIB_NODE_TYPE_PATH);
dpo_reset(&path->fp_dpo);
path->fp_pl_index = pl_index;
path->fp_weight = 1;
path->fp_preference = 0;
path->fp_nh_proto = nh_proto;
path->fp_via_fib = FIB_NODE_INDEX_INVALID;
path->fp_cfg_flags = flags;
if (FIB_PATH_CFG_FLAG_DROP & flags)
{
path->fp_type = FIB_PATH_TYPE_SPECIAL;
}
else if (FIB_PATH_CFG_FLAG_LOCAL & flags)
{
path->fp_type = FIB_PATH_TYPE_RECEIVE;
path->attached.fp_interface = FIB_NODE_INDEX_INVALID;
}
else
{
path->fp_type = FIB_PATH_TYPE_EXCLUSIVE;
ASSERT(NULL != dpo);
dpo_copy(&path->exclusive.fp_ex_dpo, dpo);
}
return (fib_path_get_index(path));
}
/*
* fib_path_copy
*
* Copy a path. return index of new path.
*/
fib_node_index_t
fib_path_copy (fib_node_index_t path_index,
fib_node_index_t path_list_index)
{
fib_path_t *path, *orig_path;
pool_get(fib_path_pool, path);
orig_path = fib_path_get(path_index);
ASSERT(NULL != orig_path);
memcpy(path, orig_path, sizeof(*path));
FIB_PATH_DBG(path, "create-copy:%d", path_index);
/*
* reset the dynamic section
*/
fib_node_init(&path->fp_node, FIB_NODE_TYPE_PATH);
path->fp_oper_flags = FIB_PATH_OPER_FLAG_NONE;
path->fp_pl_index = path_list_index;
path->fp_via_fib = FIB_NODE_INDEX_INVALID;
clib_memset(&path->fp_dpo, 0, sizeof(path->fp_dpo));
dpo_reset(&path->fp_dpo);
return (fib_path_get_index(path));
}
/*
* fib_path_destroy
*
* destroy a path that is no longer required
*/
void
fib_path_destroy (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
ASSERT(NULL != path);
FIB_PATH_DBG(path, "destroy");
fib_path_unresolve(path);
fib_node_deinit(&path->fp_node);
pool_put(fib_path_pool, path);
}
/*
* fib_path_destroy
*
* destroy a path that is no longer required
*/
uword
fib_path_hash (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
return (hash_memory(STRUCT_MARK_PTR(path, path_hash_start),
(STRUCT_OFFSET_OF(fib_path_t, path_hash_end) -
STRUCT_OFFSET_OF(fib_path_t, path_hash_start)),
0));
}
/*
* fib_path_cmp_i
*
* Compare two paths for equivalence.
*/
static int
fib_path_cmp_i (const fib_path_t *path1,
const fib_path_t *path2)
{
int res;
res = 1;
/*
* paths of different types and protocol are not equal.
* different weights and/or preference only are the same path.
*/
if (path1->fp_type != path2->fp_type)
{
res = (path1->fp_type - path2->fp_type);
}
else if (path1->fp_nh_proto != path2->fp_nh_proto)
{
res = (path1->fp_nh_proto - path2->fp_nh_proto);
}
else
{
/*
* both paths are of the same type.
* consider each type and its attributes in turn.
*/
switch (path1->fp_type)
{
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
res = ip46_address_cmp(&path1->attached_next_hop.fp_nh,
&path2->attached_next_hop.fp_nh);
if (0 == res) {
res = (path1->attached_next_hop.fp_interface -
path2->attached_next_hop.fp_interface);
}
break;
case FIB_PATH_TYPE_ATTACHED:
res = (path1->attached.fp_interface -
path2->attached.fp_interface);
break;
case FIB_PATH_TYPE_RECURSIVE:
res = ip46_address_cmp(&path1->recursive.fp_nh,
&path2->recursive.fp_nh);
if (0 == res)
{
res = (path1->recursive.fp_tbl_id - path2->recursive.fp_tbl_id);
}
break;
case FIB_PATH_TYPE_BIER_FMASK:
res = (path1->bier_fmask.fp_bier_fmask -
path2->bier_fmask.fp_bier_fmask);
break;
case FIB_PATH_TYPE_BIER_IMP:
res = (path1->bier_imp.fp_bier_imp -
path2->bier_imp.fp_bier_imp);
break;
case FIB_PATH_TYPE_BIER_TABLE:
res = bier_table_id_cmp(&path1->bier_table.fp_bier_tbl,
&path2->bier_table.fp_bier_tbl);
break;
case FIB_PATH_TYPE_DEAG:
res = (path1->deag.fp_tbl_id - path2->deag.fp_tbl_id);
if (0 == res)
{
res = (path1->deag.fp_rpf_id - path2->deag.fp_rpf_id);
}
break;
case FIB_PATH_TYPE_INTF_RX:
res = (path1->intf_rx.fp_interface - path2->intf_rx.fp_interface);
break;
case FIB_PATH_TYPE_UDP_ENCAP:
res = (path1->udp_encap.fp_udp_encap_id - path2->udp_encap.fp_udp_encap_id);
break;
case FIB_PATH_TYPE_DVR:
res = (path1->dvr.fp_interface - path2->dvr.fp_interface);
break;
case FIB_PATH_TYPE_EXCLUSIVE:
res = dpo_cmp(&path1->exclusive.fp_ex_dpo, &path2->exclusive.fp_ex_dpo);
break;
case FIB_PATH_TYPE_SPECIAL:
case FIB_PATH_TYPE_RECEIVE:
res = 0;
break;
}
}
return (res);
}
/*
* fib_path_cmp_for_sort
*
* Compare two paths for equivalence. Used during path sorting.
* As usual 0 means equal.
*/
int
fib_path_cmp_for_sort (void * v1,
void * v2)
{
fib_node_index_t *pi1 = v1, *pi2 = v2;
fib_path_t *path1, *path2;
path1 = fib_path_get(*pi1);
path2 = fib_path_get(*pi2);
/*
* when sorting paths we want the highest preference paths
* first, so that the choices set built is in prefernce order
*/
if (path1->fp_preference != path2->fp_preference)
{
return (path1->fp_preference - path2->fp_preference);
}
return (fib_path_cmp_i(path1, path2));
}
/*
* fib_path_cmp
*
* Compare two paths for equivalence.
*/
int
fib_path_cmp (fib_node_index_t pi1,
fib_node_index_t pi2)
{
fib_path_t *path1, *path2;
path1 = fib_path_get(pi1);
path2 = fib_path_get(pi2);
return (fib_path_cmp_i(path1, path2));
}
int
fib_path_cmp_w_route_path (fib_node_index_t path_index,
const fib_route_path_t *rpath)
{
fib_path_t *path;
int res;
path = fib_path_get(path_index);
res = 1;
if (path->fp_weight != rpath->frp_weight)
{
res = (path->fp_weight - rpath->frp_weight);
}
else
{
/*
* both paths are of the same type.
* consider each type and its attributes in turn.
*/
switch (path->fp_type)
{
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
res = ip46_address_cmp(&path->attached_next_hop.fp_nh,
&rpath->frp_addr);
if (0 == res)
{
res = (path->attached_next_hop.fp_interface -
rpath->frp_sw_if_index);
}
break;
case FIB_PATH_TYPE_ATTACHED:
res = (path->attached.fp_interface - rpath->frp_sw_if_index);
break;
case FIB_PATH_TYPE_RECURSIVE:
if (DPO_PROTO_MPLS == path->fp_nh_proto)
{
res = path->recursive.fp_nh.fp_local_label - rpath->frp_local_label;
if (res == 0)
{
res = path->recursive.fp_nh.fp_eos - rpath->frp_eos;
}
}
else
{
res = ip46_address_cmp(&path->recursive.fp_nh.fp_ip,
&rpath->frp_addr);
}
if (0 == res)
{
res = (path->recursive.fp_tbl_id - rpath->frp_fib_index);
}
break;
case FIB_PATH_TYPE_BIER_FMASK:
res = (path->bier_fmask.fp_bier_fmask - rpath->frp_bier_fmask);
break;
case FIB_PATH_TYPE_BIER_IMP:
res = (path->bier_imp.fp_bier_imp - rpath->frp_bier_imp);
break;
case FIB_PATH_TYPE_BIER_TABLE:
res = bier_table_id_cmp(&path->bier_table.fp_bier_tbl,
&rpath->frp_bier_tbl);
break;
case FIB_PATH_TYPE_INTF_RX:
res = (path->intf_rx.fp_interface - rpath->frp_sw_if_index);
break;
case FIB_PATH_TYPE_UDP_ENCAP:
res = (path->udp_encap.fp_udp_encap_id - rpath->frp_udp_encap_id);
break;
case FIB_PATH_TYPE_DEAG:
res = (path->deag.fp_tbl_id - rpath->frp_fib_index);
if (0 == res)
{
res = (path->deag.fp_rpf_id - rpath->frp_rpf_id);
}
break;
case FIB_PATH_TYPE_DVR:
res = (path->dvr.fp_interface - rpath->frp_sw_if_index);
break;
case FIB_PATH_TYPE_EXCLUSIVE:
res = dpo_cmp(&path->exclusive.fp_ex_dpo, &rpath->dpo);
break;
case FIB_PATH_TYPE_RECEIVE:
if (rpath->frp_flags & FIB_ROUTE_PATH_LOCAL)
{
res = 0;
}
else
{
res = 1;
}
break;
case FIB_PATH_TYPE_SPECIAL:
res = 0;
break;
}
}
return (res);
}
/*
* fib_path_recursive_loop_detect
*
* A forward walk of the FIB object graph to detect for a cycle/loop. This
* walk is initiated when an entry is linking to a new path list or from an old.
* The entry vector passed contains all the FIB entrys that are children of this
* path (it is all the entries encountered on the walk so far). If this vector
* contains the entry this path resolve via, then a loop is about to form.
* The loop must be allowed to form, since we need the dependencies in place
* so that we can track when the loop breaks.
* However, we MUST not produce a loop in the forwarding graph (else packets
* would loop around the switch path until the loop breaks), so we mark recursive
* paths as looped so that they do not contribute forwarding information.
* By marking the path as looped, an etry such as;
* X/Y
* via a.a.a.a (looped)
* via b.b.b.b (not looped)
* can still forward using the info provided by b.b.b.b only
*/
int
fib_path_recursive_loop_detect (fib_node_index_t path_index,
fib_node_index_t **entry_indicies)
{
fib_path_t *path;
path = fib_path_get(path_index);
/*
* the forced drop path is never looped, cos it is never resolved.
*/
if (fib_path_is_permanent_drop(path))
{
return (0);
}
switch (path->fp_type)
{
case FIB_PATH_TYPE_RECURSIVE:
{
fib_node_index_t *entry_index, *entries;
int looped = 0;
entries = *entry_indicies;
vec_foreach(entry_index, entries) {
if (*entry_index == path->fp_via_fib)
{
/*
* the entry that is about to link to this path-list (or
* one of this path-list's children) is the same entry that
* this recursive path resolves through. this is a cycle.
* abort the walk.
*/
looped = 1;
break;
}
}
if (looped)
{
FIB_PATH_DBG(path, "recursive loop formed");
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
}
else
{
/*
* no loop here yet. keep forward walking the graph.
*/
if (fib_entry_recursive_loop_detect(path->fp_via_fib, entry_indicies))
{
FIB_PATH_DBG(path, "recursive loop formed");
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
}
else
{
FIB_PATH_DBG(path, "recursive loop cleared");
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
}
}
break;
}
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
case FIB_PATH_TYPE_ATTACHED:
if (adj_recursive_loop_detect(path->fp_dpo.dpoi_index,
entry_indicies))
{
FIB_PATH_DBG(path, "recursive loop formed");
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
}
else
{
FIB_PATH_DBG(path, "recursive loop cleared");
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RECURSIVE_LOOP;
}
break;
case FIB_PATH_TYPE_SPECIAL:
case FIB_PATH_TYPE_DEAG:
case FIB_PATH_TYPE_DVR:
case FIB_PATH_TYPE_RECEIVE:
case FIB_PATH_TYPE_INTF_RX:
case FIB_PATH_TYPE_UDP_ENCAP:
case FIB_PATH_TYPE_EXCLUSIVE:
case FIB_PATH_TYPE_BIER_FMASK:
case FIB_PATH_TYPE_BIER_TABLE:
case FIB_PATH_TYPE_BIER_IMP:
/*
* these path types cannot be part of a loop, since they are the leaves
* of the graph.
*/
break;
}
return (fib_path_is_looped(path_index));
}
int
fib_path_resolve (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
/*
* hope for the best.
*/
path->fp_oper_flags |= FIB_PATH_OPER_FLAG_RESOLVED;
/*
* the forced drop path resolves via the drop adj
*/
if (fib_path_is_permanent_drop(path))
{
dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
return (fib_path_is_resolved(path_index));
}
switch (path->fp_type)
{
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
fib_path_attached_next_hop_set(path);
break;
case FIB_PATH_TYPE_ATTACHED:
{
dpo_id_t tmp = DPO_INVALID;
/*
* path->attached.fp_interface
*/
if (!vnet_sw_interface_is_up(vnet_get_main(),
path->attached.fp_interface))
{
path->fp_oper_flags &= ~FIB_PATH_OPER_FLAG_RESOLVED;
}
dpo_set(&tmp,
DPO_ADJACENCY,
path->fp_nh_proto,
fib_path_attached_get_adj(path,
dpo_proto_to_link(path->fp_nh_proto)));
/*
* re-fetch after possible mem realloc
*/
path = fib_path_get(path_index);
dpo_copy(&path->fp_dpo, &tmp);
/*
* become a child of the adjacency so we receive updates
* when the interface state changes
*/
path->fp_sibling = adj_child_add(path->fp_dpo.dpoi_index,
FIB_NODE_TYPE_PATH,
fib_path_get_index(path));
dpo_reset(&tmp);
break;
}
case FIB_PATH_TYPE_RECURSIVE:
{
/*
* Create a RR source entry in the table for the address
* that this path recurses through.
* This resolve action is recursive, hence we may create
* more paths in the process. more creates mean maybe realloc
* of this path.
*/
fib_node_index_t fei;
fib_prefix_t pfx;
ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_fib);
if (DPO_PROTO_MPLS == path->fp_nh_proto)
{
fib_prefix_from_mpls_label(path->recursive.fp_nh.fp_local_label,
path->recursive.fp_nh.fp_eos,
&pfx);
}
else
{
fib_prefix_from_ip46_addr(&path->recursive.fp_nh.fp_ip, &pfx);
}
fib_table_lock(path->recursive.fp_tbl_id,
dpo_proto_to_fib(path->fp_nh_proto),
FIB_SOURCE_RR);
fei = fib_table_entry_special_add(path->recursive.fp_tbl_id,
&pfx,
FIB_SOURCE_RR,
FIB_ENTRY_FLAG_NONE);
path = fib_path_get(path_index);
path->fp_via_fib = fei;
/*
* become a dependent child of the entry so the path is
* informed when the forwarding for the entry changes.
*/
path->fp_sibling = fib_entry_child_add(path->fp_via_fib,
FIB_NODE_TYPE_PATH,
fib_path_get_index(path));
/*
* create and configure the IP DPO
*/
fib_path_recursive_adj_update(
path,
fib_path_to_chain_type(path),
&path->fp_dpo);
break;
}
case FIB_PATH_TYPE_BIER_FMASK:
{
/*
* become a dependent child of the entry so the path is
* informed when the forwarding for the entry changes.
*/
path->fp_sibling = bier_fmask_child_add(path->bier_fmask.fp_bier_fmask,
FIB_NODE_TYPE_PATH,
fib_path_get_index(path));
path->fp_via_bier_fmask = path->bier_fmask.fp_bier_fmask;
fib_path_bier_fmask_update(path, &path->fp_dpo);
break;
}
case FIB_PATH_TYPE_BIER_IMP:
bier_imp_lock(path->bier_imp.fp_bier_imp);
bier_imp_contribute_forwarding(path->bier_imp.fp_bier_imp,
DPO_PROTO_IP4,
&path->fp_dpo);
break;
case FIB_PATH_TYPE_BIER_TABLE:
{
/*
* Find/create the BIER table to link to
*/
ASSERT(FIB_NODE_INDEX_INVALID == path->fp_via_bier_tbl);
path->fp_via_bier_tbl =
bier_table_ecmp_create_and_lock(&path->bier_table.fp_bier_tbl);
bier_table_contribute_forwarding(path->fp_via_bier_tbl,
&path->fp_dpo);
break;
}
case FIB_PATH_TYPE_SPECIAL:
if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_PROHIBIT)
{
ip_null_dpo_add_and_lock (path->fp_nh_proto,
IP_NULL_ACTION_SEND_ICMP_PROHIBIT,
&path->fp_dpo);
}
else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_UNREACH)
{
ip_null_dpo_add_and_lock (path->fp_nh_proto,
IP_NULL_ACTION_SEND_ICMP_UNREACH,
&path->fp_dpo);
}
else if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_CLASSIFY)
{
dpo_set (&path->fp_dpo, DPO_CLASSIFY,
path->fp_nh_proto,
classify_dpo_create (path->fp_nh_proto,
path->classify.fp_classify_table_id));
}
else
{
/*
* Resolve via the drop
*/
dpo_copy(&path->fp_dpo, drop_dpo_get(path->fp_nh_proto));
}
break;
case FIB_PATH_TYPE_DEAG:
{
if (DPO_PROTO_BIER == path->fp_nh_proto)
{
bier_disp_table_contribute_forwarding(path->deag.fp_tbl_id,
&path->fp_dpo);
}
else
{
/*
* Resolve via a lookup DPO.
* FIXME. control plane should add routes with a table ID
*/
lookup_input_t input;
lookup_cast_t cast;
cast = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID ?
LOOKUP_MULTICAST :
LOOKUP_UNICAST);
input = (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DEAG_SRC ?
LOOKUP_INPUT_SRC_ADDR :
LOOKUP_INPUT_DST_ADDR);
lookup_dpo_add_or_lock_w_fib_index(path->deag.fp_tbl_id,
path->fp_nh_proto,
cast,
input,
LOOKUP_TABLE_FROM_CONFIG,
&path->fp_dpo);
}
break;
}
case FIB_PATH_TYPE_DVR:
dvr_dpo_add_or_lock(path->attached.fp_interface,
path->fp_nh_proto,
&path->fp_dpo);
break;
case FIB_PATH_TYPE_RECEIVE:
/*
* Resolve via a receive DPO.
*/
receive_dpo_add_or_lock(path->fp_nh_proto,
path->receive.fp_interface,
&path->receive.fp_addr,
&path->fp_dpo);
break;
case FIB_PATH_TYPE_UDP_ENCAP:
udp_encap_lock(path->udp_encap.fp_udp_encap_id);
udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
path->fp_nh_proto,
&path->fp_dpo);
break;
case FIB_PATH_TYPE_INTF_RX: {
/*
* Resolve via a receive DPO.
*/
interface_rx_dpo_add_or_lock(path->fp_nh_proto,
path->intf_rx.fp_interface,
&path->fp_dpo);
break;
}
case FIB_PATH_TYPE_EXCLUSIVE:
/*
* Resolve via the user provided DPO
*/
dpo_copy(&path->fp_dpo, &path->exclusive.fp_ex_dpo);
break;
}
return (fib_path_is_resolved(path_index));
}
u32
fib_path_get_resolving_interface (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
switch (path->fp_type)
{
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
return (path->attached_next_hop.fp_interface);
case FIB_PATH_TYPE_ATTACHED:
return (path->attached.fp_interface);
case FIB_PATH_TYPE_RECEIVE:
return (path->receive.fp_interface);
case FIB_PATH_TYPE_RECURSIVE:
if (fib_path_is_resolved(path_index))
{
return (fib_entry_get_resolving_interface(path->fp_via_fib));
}
break;
case FIB_PATH_TYPE_DVR:
return (path->dvr.fp_interface);
case FIB_PATH_TYPE_INTF_RX:
case FIB_PATH_TYPE_UDP_ENCAP:
case FIB_PATH_TYPE_SPECIAL:
case FIB_PATH_TYPE_DEAG:
case FIB_PATH_TYPE_EXCLUSIVE:
case FIB_PATH_TYPE_BIER_FMASK:
case FIB_PATH_TYPE_BIER_TABLE:
case FIB_PATH_TYPE_BIER_IMP:
break;
}
return (dpo_get_urpf(&path->fp_dpo));
}
index_t
fib_path_get_resolving_index (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
switch (path->fp_type)
{
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
case FIB_PATH_TYPE_ATTACHED:
case FIB_PATH_TYPE_RECEIVE:
case FIB_PATH_TYPE_INTF_RX:
case FIB_PATH_TYPE_SPECIAL:
case FIB_PATH_TYPE_DEAG:
case FIB_PATH_TYPE_DVR:
case FIB_PATH_TYPE_EXCLUSIVE:
break;
case FIB_PATH_TYPE_UDP_ENCAP:
return (path->udp_encap.fp_udp_encap_id);
case FIB_PATH_TYPE_RECURSIVE:
return (path->fp_via_fib);
case FIB_PATH_TYPE_BIER_FMASK:
return (path->bier_fmask.fp_bier_fmask);
case FIB_PATH_TYPE_BIER_TABLE:
return (path->fp_via_bier_tbl);
case FIB_PATH_TYPE_BIER_IMP:
return (path->bier_imp.fp_bier_imp);
}
return (~0);
}
adj_index_t
fib_path_get_adj (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
ASSERT(dpo_is_adj(&path->fp_dpo));
if (dpo_is_adj(&path->fp_dpo))
{
return (path->fp_dpo.dpoi_index);
}
return (ADJ_INDEX_INVALID);
}
u16
fib_path_get_weight (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
ASSERT(path);
return (path->fp_weight);
}
u16
fib_path_get_preference (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
ASSERT(path);
return (path->fp_preference);
}
u32
fib_path_get_rpf_id (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
ASSERT(path);
if (FIB_PATH_CFG_FLAG_RPF_ID & path->fp_cfg_flags)
{
return (path->deag.fp_rpf_id);
}
return (~0);
}
/**
* @brief Contribute the path's adjacency to the list passed.
* By calling this function over all paths, recursively, a child
* can construct its full set of forwarding adjacencies, and hence its
* uRPF list.
*/
void
fib_path_contribute_urpf (fib_node_index_t path_index,
index_t urpf)
{
fib_path_t *path;
path = fib_path_get(path_index);
/*
* resolved and unresolved paths contribute to the RPF list.
*/
switch (path->fp_type)
{
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
fib_urpf_list_append(urpf, path->attached_next_hop.fp_interface);
break;
case FIB_PATH_TYPE_ATTACHED:
fib_urpf_list_append(urpf, path->attached.fp_interface);
break;
case FIB_PATH_TYPE_RECURSIVE:
if (FIB_NODE_INDEX_INVALID != path->fp_via_fib &&
!fib_path_is_looped(path_index))
{
/*
* there's unresolved due to constraints, and there's unresolved
* due to ain't got no via. can't do nowt w'out via.
*/
fib_entry_contribute_urpf(path->fp_via_fib, urpf);
}
break;
case FIB_PATH_TYPE_EXCLUSIVE:
case FIB_PATH_TYPE_SPECIAL:
{
/*
* these path types may link to an adj, if that's what
* the clinet gave
*/
u32 rpf_sw_if_index;
rpf_sw_if_index = dpo_get_urpf(&path->fp_dpo);
if (~0 != rpf_sw_if_index)
{
fib_urpf_list_append(urpf, rpf_sw_if_index);
}
break;
}
case FIB_PATH_TYPE_DVR:
fib_urpf_list_append(urpf, path->dvr.fp_interface);
break;
case FIB_PATH_TYPE_DEAG:
case FIB_PATH_TYPE_RECEIVE:
case FIB_PATH_TYPE_INTF_RX:
case FIB_PATH_TYPE_UDP_ENCAP:
case FIB_PATH_TYPE_BIER_FMASK:
case FIB_PATH_TYPE_BIER_TABLE:
case FIB_PATH_TYPE_BIER_IMP:
/*
* these path types don't link to an adj
*/
break;
}
}
void
fib_path_stack_mpls_disp (fib_node_index_t path_index,
dpo_proto_t payload_proto,
fib_mpls_lsp_mode_t mode,
dpo_id_t *dpo)
{
fib_path_t *path;
path = fib_path_get(path_index);
ASSERT(path);
switch (path->fp_type)
{
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
{
dpo_id_t tmp = DPO_INVALID;
dpo_copy(&tmp, dpo);
mpls_disp_dpo_create(payload_proto, ~0, mode, &tmp, dpo);
dpo_reset(&tmp);
break;
}
case FIB_PATH_TYPE_DEAG:
{
dpo_id_t tmp = DPO_INVALID;
dpo_copy(&tmp, dpo);
mpls_disp_dpo_create(payload_proto,
path->deag.fp_rpf_id,
mode, &tmp, dpo);
dpo_reset(&tmp);
break;
}
case FIB_PATH_TYPE_RECEIVE:
case FIB_PATH_TYPE_ATTACHED:
case FIB_PATH_TYPE_RECURSIVE:
case FIB_PATH_TYPE_INTF_RX:
case FIB_PATH_TYPE_UDP_ENCAP:
case FIB_PATH_TYPE_EXCLUSIVE:
case FIB_PATH_TYPE_SPECIAL:
case FIB_PATH_TYPE_BIER_FMASK:
case FIB_PATH_TYPE_BIER_TABLE:
case FIB_PATH_TYPE_BIER_IMP:
case FIB_PATH_TYPE_DVR:
break;
}
}
void
fib_path_contribute_forwarding (fib_node_index_t path_index,
fib_forward_chain_type_t fct,
dpo_id_t *dpo)
{
fib_path_t *path;
path = fib_path_get(path_index);
ASSERT(path);
ASSERT(FIB_FORW_CHAIN_TYPE_MPLS_EOS != fct);
/*
* The DPO stored in the path was created when the path was resolved.
* This then represents the path's 'native' protocol; IP.
* For all others will need to go find something else.
*/
if (fib_path_to_chain_type(path) == fct)
{
dpo_copy(dpo, &path->fp_dpo);
}
else
{
switch (path->fp_type)
{
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
switch (fct)
{
case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
case FIB_FORW_CHAIN_TYPE_ETHERNET:
case FIB_FORW_CHAIN_TYPE_NSH:
case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
{
adj_index_t ai;
/*
* get a appropriate link type adj.
*/
ai = fib_path_attached_next_hop_get_adj(
path,
fib_forw_chain_type_to_link_type(fct));
dpo_set(dpo, DPO_ADJACENCY,
fib_forw_chain_type_to_dpo_proto(fct), ai);
adj_unlock(ai);
break;
}
case FIB_FORW_CHAIN_TYPE_BIER:
break;
}
break;
case FIB_PATH_TYPE_RECURSIVE:
switch (fct)
{
case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
case FIB_FORW_CHAIN_TYPE_BIER:
fib_path_recursive_adj_update(path, fct, dpo);
break;
case FIB_FORW_CHAIN_TYPE_ETHERNET:
case FIB_FORW_CHAIN_TYPE_NSH:
ASSERT(0);
break;
}
break;
case FIB_PATH_TYPE_BIER_TABLE:
switch (fct)
{
case FIB_FORW_CHAIN_TYPE_BIER:
bier_table_contribute_forwarding(path->fp_via_bier_tbl, dpo);
break;
case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
case FIB_FORW_CHAIN_TYPE_ETHERNET:
case FIB_FORW_CHAIN_TYPE_NSH:
ASSERT(0);
break;
}
break;
case FIB_PATH_TYPE_BIER_FMASK:
switch (fct)
{
case FIB_FORW_CHAIN_TYPE_BIER:
fib_path_bier_fmask_update(path, dpo);
break;
case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
case FIB_FORW_CHAIN_TYPE_ETHERNET:
case FIB_FORW_CHAIN_TYPE_NSH:
ASSERT(0);
break;
}
break;
case FIB_PATH_TYPE_BIER_IMP:
bier_imp_contribute_forwarding(path->bier_imp.fp_bier_imp,
fib_forw_chain_type_to_dpo_proto(fct),
dpo);
break;
case FIB_PATH_TYPE_DEAG:
switch (fct)
{
case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
lookup_dpo_add_or_lock_w_table_id(MPLS_FIB_DEFAULT_TABLE_ID,
DPO_PROTO_MPLS,
LOOKUP_UNICAST,
LOOKUP_INPUT_DST_ADDR,
LOOKUP_TABLE_FROM_CONFIG,
dpo);
break;
case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
dpo_copy(dpo, &path->fp_dpo);
break;
case FIB_FORW_CHAIN_TYPE_BIER:
break;
case FIB_FORW_CHAIN_TYPE_ETHERNET:
case FIB_FORW_CHAIN_TYPE_NSH:
ASSERT(0);
break;
}
break;
case FIB_PATH_TYPE_EXCLUSIVE:
dpo_copy(dpo, &path->exclusive.fp_ex_dpo);
break;
case FIB_PATH_TYPE_ATTACHED:
switch (fct)
{
case FIB_FORW_CHAIN_TYPE_MPLS_NON_EOS:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP4:
case FIB_FORW_CHAIN_TYPE_UNICAST_IP6:
case FIB_FORW_CHAIN_TYPE_MPLS_EOS:
case FIB_FORW_CHAIN_TYPE_ETHERNET:
case FIB_FORW_CHAIN_TYPE_NSH:
case FIB_FORW_CHAIN_TYPE_BIER:
{
adj_index_t ai;
/*
* get a appropriate link type adj.
*/
ai = fib_path_attached_get_adj(
path,
fib_forw_chain_type_to_link_type(fct));
dpo_set(dpo, DPO_ADJACENCY,
fib_forw_chain_type_to_dpo_proto(fct), ai);
adj_unlock(ai);
break;
}
case FIB_FORW_CHAIN_TYPE_MCAST_IP4:
case FIB_FORW_CHAIN_TYPE_MCAST_IP6:
{
adj_index_t ai;
/*
* Create the adj needed for sending IP multicast traffic
*/
ai = adj_mcast_add_or_lock(dpo_proto_to_fib(path->fp_nh_proto),
fib_forw_chain_type_to_link_type(fct),
path->attached.fp_interface);
dpo_set(dpo, DPO_ADJACENCY,
fib_forw_chain_type_to_dpo_proto(fct),
ai);
adj_unlock(ai);
}
break;
}
break;
case FIB_PATH_TYPE_INTF_RX:
/*
* Create the adj needed for sending IP multicast traffic
*/
interface_rx_dpo_add_or_lock(fib_forw_chain_type_to_dpo_proto(fct),
path->attached.fp_interface,
dpo);
break;
case FIB_PATH_TYPE_UDP_ENCAP:
udp_encap_contribute_forwarding(path->udp_encap.fp_udp_encap_id,
path->fp_nh_proto,
dpo);
break;
case FIB_PATH_TYPE_RECEIVE:
case FIB_PATH_TYPE_SPECIAL:
case FIB_PATH_TYPE_DVR:
dpo_copy(dpo, &path->fp_dpo);
break;
}
}
}
load_balance_path_t *
fib_path_append_nh_for_multipath_hash (fib_node_index_t path_index,
fib_forward_chain_type_t fct,
load_balance_path_t *hash_key)
{
load_balance_path_t *mnh;
fib_path_t *path;
path = fib_path_get(path_index);
ASSERT(path);
vec_add2(hash_key, mnh, 1);
mnh->path_weight = path->fp_weight;
mnh->path_index = path_index;
if (fib_path_is_resolved(path_index))
{
fib_path_contribute_forwarding(path_index, fct, &mnh->path_dpo);
}
else
{
dpo_copy(&mnh->path_dpo,
drop_dpo_get(fib_forw_chain_type_to_dpo_proto(fct)));
}
return (hash_key);
}
int
fib_path_is_recursive_constrained (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
return ((FIB_PATH_TYPE_RECURSIVE == path->fp_type) &&
((path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_ATTACHED) ||
(path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RESOLVE_HOST)));
}
int
fib_path_is_exclusive (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
return (FIB_PATH_TYPE_EXCLUSIVE == path->fp_type);
}
int
fib_path_is_deag (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
return (FIB_PATH_TYPE_DEAG == path->fp_type);
}
int
fib_path_is_resolved (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
return (dpo_id_is_valid(&path->fp_dpo) &&
(path->fp_oper_flags & FIB_PATH_OPER_FLAG_RESOLVED) &&
!fib_path_is_looped(path_index) &&
!fib_path_is_permanent_drop(path));
}
int
fib_path_is_looped (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
return (path->fp_oper_flags & FIB_PATH_OPER_FLAG_RECURSIVE_LOOP);
}
fib_path_list_walk_rc_t
fib_path_encode (fib_node_index_t path_list_index,
fib_node_index_t path_index,
const fib_path_ext_t *path_ext,
void *args)
{
fib_path_encode_ctx_t *ctx = args;
fib_route_path_t *rpath;
fib_path_t *path;
path = fib_path_get(path_index);
if (!path)
return (FIB_PATH_LIST_WALK_CONTINUE);
vec_add2(ctx->rpaths, rpath, 1);
rpath->frp_weight = path->fp_weight;
rpath->frp_preference = path->fp_preference;
rpath->frp_proto = path->fp_nh_proto;
rpath->frp_sw_if_index = ~0;
rpath->frp_fib_index = 0;
switch (path->fp_type)
{
case FIB_PATH_TYPE_RECEIVE:
rpath->frp_addr = path->receive.fp_addr;
rpath->frp_sw_if_index = path->receive.fp_interface;
rpath->frp_flags |= FIB_ROUTE_PATH_LOCAL;
break;
case FIB_PATH_TYPE_ATTACHED:
rpath->frp_sw_if_index = path->attached.fp_interface;
break;
case FIB_PATH_TYPE_ATTACHED_NEXT_HOP:
rpath->frp_sw_if_index = path->attached_next_hop.fp_interface;
rpath->frp_addr = path->attached_next_hop.fp_nh;
break;
case FIB_PATH_TYPE_BIER_FMASK:
rpath->frp_bier_fmask = path->bier_fmask.fp_bier_fmask;
break;
case FIB_PATH_TYPE_SPECIAL:
break;
case FIB_PATH_TYPE_DEAG:
rpath->frp_fib_index = path->deag.fp_tbl_id;
if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_RPF_ID)
{
rpath->frp_flags |= FIB_ROUTE_PATH_RPF_ID;
}
break;
case FIB_PATH_TYPE_RECURSIVE:
rpath->frp_addr = path->recursive.fp_nh.fp_ip;
rpath->frp_fib_index = path->recursive.fp_tbl_id;
break;
case FIB_PATH_TYPE_DVR:
rpath->frp_sw_if_index = path->dvr.fp_interface;
rpath->frp_flags |= FIB_ROUTE_PATH_DVR;
break;
case FIB_PATH_TYPE_UDP_ENCAP:
rpath->frp_udp_encap_id = path->udp_encap.fp_udp_encap_id;
rpath->frp_flags |= FIB_ROUTE_PATH_UDP_ENCAP;
break;
case FIB_PATH_TYPE_INTF_RX:
rpath->frp_sw_if_index = path->receive.fp_interface;
rpath->frp_flags |= FIB_ROUTE_PATH_INTF_RX;
break;
case FIB_PATH_TYPE_EXCLUSIVE:
rpath->frp_flags |= FIB_ROUTE_PATH_EXCLUSIVE;
default:
break;
}
if (path_ext && path_ext->fpe_type == FIB_PATH_EXT_MPLS)
{
rpath->frp_label_stack = path_ext->fpe_path.frp_label_stack;
}
if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_DROP)
rpath->frp_flags |= FIB_ROUTE_PATH_DROP;
if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_UNREACH)
rpath->frp_flags |= FIB_ROUTE_PATH_ICMP_UNREACH;
if (path->fp_cfg_flags & FIB_PATH_CFG_FLAG_ICMP_PROHIBIT)
rpath->frp_flags |= FIB_ROUTE_PATH_ICMP_PROHIBIT;
return (FIB_PATH_LIST_WALK_CONTINUE);
}
dpo_proto_t
fib_path_get_proto (fib_node_index_t path_index)
{
fib_path_t *path;
path = fib_path_get(path_index);
return (path->fp_nh_proto);
}
void
fib_path_module_init (void)
{
fib_node_register_type (FIB_NODE_TYPE_PATH, &fib_path_vft);
fib_path_logger = vlib_log_register_class ("fib", "path");
}
static clib_error_t *
show_fib_path_command (vlib_main_t * vm,
unformat_input_t * input,
vlib_cli_command_t * cmd)
{
fib_node_index_t pi;
fib_path_t *path;
if (unformat (input, "%d", &pi))
{
/*
* show one in detail
*/
if (!pool_is_free_index(fib_path_pool, pi))
{
path = fib_path_get(pi);
u8 *s = format(NULL, "%U", format_fib_path, pi, 1,
FIB_PATH_FORMAT_FLAGS_NONE);
s = format(s, "\n children:");
s = fib_node_children_format(path->fp_node.fn_children, s);
vlib_cli_output (vm, "%s", s);
vec_free(s);
}
else
{
vlib_cli_output (vm, "path %d invalid", pi);
}
}
else
{
vlib_cli_output (vm, "FIB Paths");
pool_foreach_index (pi, fib_path_pool,
({
vlib_cli_output (vm, "%U", format_fib_path, pi, 0,
FIB_PATH_FORMAT_FLAGS_NONE);
}));
}
return (NULL);
}
VLIB_CLI_COMMAND (show_fib_path, static) = {
.path = "show fib paths",
.function = show_fib_path_command,
.short_help = "show fib paths",
};
|