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
|
/* AS path management routines.
* Copyright (C) 1996, 97, 98, 99 Kunihiro Ishiguro
* Copyright (C) 2005 Sun Microsystems, Inc.
*
* This file is part of GNU Zebra.
*
* GNU Zebra is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the
* Free Software Foundation; either version 2, or (at your option) any
* later version.
*
* GNU Zebra is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; see the file COPYING; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
*/
#include <zebra.h>
#include "hash.h"
#include "memory.h"
#include "vector.h"
#include "log.h"
#include "stream.h"
#include "command.h"
#include "jhash.h"
#include "queue.h"
#include "filter.h"
#include "bgpd/bgpd.h"
#include "bgpd/bgp_aspath.h"
#include "bgpd/bgp_debug.h"
#include "bgpd/bgp_attr.h"
/* Attr. Flags and Attr. Type Code. */
#define AS_HEADER_SIZE 2
/* Now FOUR octets are used for AS value. */
#define AS_VALUE_SIZE sizeof (as_t)
/* This is the old one */
#define AS16_VALUE_SIZE sizeof (as16_t)
/* Maximum protocol segment length value */
#define AS_SEGMENT_MAX 255
/* The following length and size macros relate specifically to Quagga's
* internal representation of AS-Segments, not per se to the on-wire
* sizes and lengths. At present (200508) they sort of match, however
* the ONLY functions which should now about the on-wire syntax are
* aspath_put, assegment_put and assegment_parse.
*
* aspath_put returns bytes written, the only definitive record of
* size of wire-format attribute..
*/
/* Calculated size in bytes of ASN segment data to hold N ASN's */
#define ASSEGMENT_DATA_SIZE(N, S) \
((N) * ((S) ? AS_VALUE_SIZE : AS16_VALUE_SIZE))
/* Calculated size of segment struct to hold N ASN's */
#define ASSEGMENT_SIZE(N,S) (AS_HEADER_SIZE + ASSEGMENT_DATA_SIZE (N,S))
/* AS segment octet length. */
#define ASSEGMENT_LEN(X,S) ASSEGMENT_SIZE((X)->length,S)
/* AS_SEQUENCE segments can be packed together */
/* Can the types of X and Y be considered for packing? */
#define ASSEGMENT_TYPES_PACKABLE(X, Y) \
(((X)->type == (Y)->type) && ((X)->type == AS_SEQUENCE))
/* Types and length of X,Y suitable for packing? */
#define ASSEGMENTS_PACKABLE(X, Y) \
(ASSEGMENT_TYPES_PACKABLE((X), (Y)) \
&& (((X)->length + (Y)->length) <= AS_SEGMENT_MAX))
/* As segment header - the on-wire representation
* NOT the internal representation!
*/
struct assegment_header {
u_char type;
u_char length;
};
/* Hash for aspath. This is the top level structure of AS path. */
static struct hash *ashash;
/* Stream for SNMP. See aspath_snmp_pathseg */
static struct stream *snmp_stream;
/* Callers are required to initialize the memory */
static as_t *assegment_data_new(int num)
{
return (XMALLOC(MTYPE_AS_SEG_DATA, ASSEGMENT_DATA_SIZE(num, 1)));
}
static void assegment_data_free(as_t *asdata)
{
XFREE(MTYPE_AS_SEG_DATA, asdata);
}
const char *aspath_segment_type_str[] = {"as-invalid", "as-set", "as-sequence",
"as-confed-sequence", "as-confed-set"};
/* Get a new segment. Note that 0 is an allowed length,
* and will result in a segment with no allocated data segment.
* the caller should immediately assign data to the segment, as the segment
* otherwise is not generally valid
*/
static struct assegment *assegment_new(u_char type, u_short length)
{
struct assegment *new;
new = XCALLOC(MTYPE_AS_SEG, sizeof(struct assegment));
if (length)
new->as = assegment_data_new(length);
new->length = length;
new->type = type;
return new;
}
static void assegment_free(struct assegment *seg)
{
if (!seg)
return;
if (seg->as)
assegment_data_free(seg->as);
memset(seg, 0xfe, sizeof(struct assegment));
XFREE(MTYPE_AS_SEG, seg);
return;
}
/* free entire chain of segments */
static void assegment_free_all(struct assegment *seg)
{
struct assegment *prev;
while (seg) {
prev = seg;
seg = seg->next;
assegment_free(prev);
}
}
/* Duplicate just the given assegment and its data */
static struct assegment *assegment_dup(struct assegment *seg)
{
struct assegment *new;
new = assegment_new(seg->type, seg->length);
memcpy(new->as, seg->as, ASSEGMENT_DATA_SIZE(new->length, 1));
return new;
}
/* Duplicate entire chain of assegments, return the head */
static struct assegment *assegment_dup_all(struct assegment *seg)
{
struct assegment *new = NULL;
struct assegment *head = NULL;
while (seg) {
if (head) {
new->next = assegment_dup(seg);
new = new->next;
} else
head = new = assegment_dup(seg);
seg = seg->next;
}
return head;
}
/* prepend the as number to given segment, given num of times */
static struct assegment *assegment_prepend_asns(struct assegment *seg,
as_t asnum, int num)
{
as_t *newas;
int i;
if (!num)
return seg;
if (num >= AS_SEGMENT_MAX)
return seg; /* we don't do huge prepends */
if ((newas = assegment_data_new(seg->length + num)) == NULL)
return seg;
for (i = 0; i < num; i++)
newas[i] = asnum;
memcpy(newas + num, seg->as, ASSEGMENT_DATA_SIZE(seg->length, 1));
assegment_data_free(seg->as);
seg->as = newas;
seg->length += num;
return seg;
}
/* append given array of as numbers to the segment */
static struct assegment *assegment_append_asns(struct assegment *seg,
as_t *asnos, int num)
{
as_t *newas;
newas = XREALLOC(MTYPE_AS_SEG_DATA, seg->as,
ASSEGMENT_DATA_SIZE(seg->length + num, 1));
if (newas) {
seg->as = newas;
memcpy(seg->as + seg->length, asnos,
ASSEGMENT_DATA_SIZE(num, 1));
seg->length += num;
return seg;
}
assegment_free_all(seg);
return NULL;
}
static int int_cmp(const void *p1, const void *p2)
{
const as_t *as1 = p1;
const as_t *as2 = p2;
return (*as1 == *as2) ? 0 : ((*as1 > *as2) ? 1 : -1);
}
/* normalise the segment.
* In particular, merge runs of AS_SEQUENCEs into one segment
* Internally, we do not care about the wire segment length limit, and
* we want each distinct AS_PATHs to have the exact same internal
* representation - eg, so that our hashing actually works..
*/
static struct assegment *assegment_normalise(struct assegment *head)
{
struct assegment *seg = head, *pin;
struct assegment *tmp;
if (!head)
return head;
while (seg) {
pin = seg;
/* Sort values SET segments, for determinism in paths to aid
* creation of hash values / path comparisons
* and because it helps other lesser implementations ;)
*/
if (seg->type == AS_SET || seg->type == AS_CONFED_SET) {
int tail = 0;
int i;
qsort(seg->as, seg->length, sizeof(as_t), int_cmp);
/* weed out dupes */
for (i = 1; i < seg->length; i++) {
if (seg->as[tail] == seg->as[i])
continue;
tail++;
if (tail < i)
seg->as[tail] = seg->as[i];
}
/* seg->length can be 0.. */
if (seg->length)
seg->length = tail + 1;
}
/* read ahead from the current, pinned segment while the
* segments
* are packable/mergeable. Append all following packable
* segments
* to the segment we have pinned and remove these appended
* segments.
*/
while (pin->next && ASSEGMENT_TYPES_PACKABLE(pin, pin->next)) {
tmp = pin->next;
seg = pin->next;
/* append the next sequence to the pinned sequence */
pin = assegment_append_asns(pin, seg->as, seg->length);
/* bypass the next sequence */
pin->next = seg->next;
/* get rid of the now referenceless segment */
assegment_free(tmp);
}
seg = pin->next;
}
return head;
}
static struct aspath *aspath_new(void)
{
return XCALLOC(MTYPE_AS_PATH, sizeof(struct aspath));
}
/* Free AS path structure. */
void aspath_free(struct aspath *aspath)
{
if (!aspath)
return;
if (aspath->segments)
assegment_free_all(aspath->segments);
if (aspath->str)
XFREE(MTYPE_AS_STR, aspath->str);
if (aspath->json) {
json_object_free(aspath->json);
aspath->json = NULL;
}
XFREE(MTYPE_AS_PATH, aspath);
}
/* Unintern aspath from AS path bucket. */
void aspath_unintern(struct aspath **aspath)
{
struct aspath *ret;
struct aspath *asp = *aspath;
if (asp->refcnt)
asp->refcnt--;
if (asp->refcnt == 0) {
/* This aspath must exist in aspath hash table. */
ret = hash_release(ashash, asp);
assert(ret != NULL);
aspath_free(asp);
*aspath = NULL;
}
}
/* Return the start or end delimiters for a particular Segment type */
#define AS_SEG_START 0
#define AS_SEG_END 1
static char aspath_delimiter_char(u_char type, u_char which)
{
int i;
struct {
int type;
char start;
char end;
} aspath_delim_char[] = {{AS_SET, '{', '}'},
{AS_CONFED_SET, '[', ']'},
{AS_CONFED_SEQUENCE, '(', ')'},
{0}};
for (i = 0; aspath_delim_char[i].type != 0; i++) {
if (aspath_delim_char[i].type == type) {
if (which == AS_SEG_START)
return aspath_delim_char[i].start;
else if (which == AS_SEG_END)
return aspath_delim_char[i].end;
}
}
return ' ';
}
/* countup asns from this segment and index onward */
static int assegment_count_asns(struct assegment *seg, int from)
{
int count = 0;
while (seg) {
if (!from)
count += seg->length;
else {
count += (seg->length - from);
from = 0;
}
seg = seg->next;
}
return count;
}
unsigned int aspath_count_confeds(struct aspath *aspath)
{
int count = 0;
struct assegment *seg = aspath->segments;
while (seg) {
if (seg->type == AS_CONFED_SEQUENCE)
count += seg->length;
else if (seg->type == AS_CONFED_SET)
count++;
seg = seg->next;
}
return count;
}
unsigned int aspath_count_hops(const struct aspath *aspath)
{
int count = 0;
struct assegment *seg = aspath->segments;
while (seg) {
if (seg->type == AS_SEQUENCE)
count += seg->length;
else if (seg->type == AS_SET)
count++;
seg = seg->next;
}
return count;
}
/* Estimate size aspath /might/ take if encoded into an
* ASPATH attribute.
*
* This is a quick estimate, not definitive! aspath_put()
* may return a different number!!
*/
unsigned int aspath_size(struct aspath *aspath)
{
int size = 0;
struct assegment *seg = aspath->segments;
while (seg) {
size += ASSEGMENT_SIZE(seg->length, 1);
seg = seg->next;
}
return size;
}
/* Return highest public ASN in path */
as_t aspath_highest(struct aspath *aspath)
{
struct assegment *seg = aspath->segments;
as_t highest = 0;
unsigned int i;
while (seg) {
for (i = 0; i < seg->length; i++)
if (seg->as[i] > highest
&& !BGP_AS_IS_PRIVATE(seg->as[i]))
highest = seg->as[i];
seg = seg->next;
}
return highest;
}
/* Return the left-most ASN in path */
as_t aspath_leftmost(struct aspath *aspath)
{
struct assegment *seg = aspath->segments;
as_t leftmost = 0;
if (seg && seg->length && seg->type == AS_SEQUENCE)
leftmost = seg->as[0];
return leftmost;
}
/* Return 1 if there are any 4-byte ASes in the path */
unsigned int aspath_has_as4(struct aspath *aspath)
{
struct assegment *seg = aspath->segments;
unsigned int i;
while (seg) {
for (i = 0; i < seg->length; i++)
if (seg->as[i] > BGP_AS_MAX)
return 1;
seg = seg->next;
}
return 0;
}
/* Convert aspath structure to string expression. */
static void aspath_make_str_count(struct aspath *as)
{
struct assegment *seg;
int str_size;
int len = 0;
char *str_buf;
json_object *jaspath_segments = NULL;
json_object *jseg = NULL;
json_object *jseg_list = NULL;
as->json = json_object_new_object();
jaspath_segments = json_object_new_array();
/* Empty aspath. */
if (!as->segments) {
json_object_string_add(as->json, "string", "Local");
json_object_object_add(as->json, "segments", jaspath_segments);
json_object_int_add(as->json, "length", 0);
as->str = XMALLOC(MTYPE_AS_STR, 1);
as->str[0] = '\0';
as->str_len = 0;
return;
}
seg = as->segments;
/* ASN takes 5 to 10 chars plus seperator, see below.
* If there is one differing segment type, we need an additional
* 2 chars for segment delimiters, and the final '\0'.
* Hopefully this is large enough to avoid hitting the realloc
* code below for most common sequences.
*
* This was changed to 10 after the well-known BGP assertion, which
* had hit some parts of the Internet in May of 2009.
*/
#define ASN_STR_LEN (10 + 1)
str_size = MAX(assegment_count_asns(seg, 0) * ASN_STR_LEN + 2 + 1,
ASPATH_STR_DEFAULT_LEN);
str_buf = XMALLOC(MTYPE_AS_STR, str_size);
while (seg) {
int i;
char seperator;
/* Check AS type validity. Set seperator for segment */
switch (seg->type) {
case AS_SET:
case AS_CONFED_SET:
seperator = ',';
break;
case AS_SEQUENCE:
case AS_CONFED_SEQUENCE:
seperator = ' ';
break;
default:
XFREE(MTYPE_AS_STR, str_buf);
as->str = NULL;
as->str_len = 0;
json_object_free(as->json);
as->json = NULL;
return;
}
/* We might need to increase str_buf, particularly if path has
* differing segments types, our initial guesstimate above will
* have been wrong. Need 10 chars for ASN, a seperator each and
* potentially two segment delimiters, plus a space between each
* segment and trailing zero.
*
* This definitely didn't work with the value of 5 bytes and
* 32-bit ASNs.
*/
#define SEGMENT_STR_LEN(X) (((X)->length * ASN_STR_LEN) + 2 + 1 + 1)
if ((len + SEGMENT_STR_LEN(seg)) > str_size) {
str_size = len + SEGMENT_STR_LEN(seg);
str_buf = XREALLOC(MTYPE_AS_STR, str_buf, str_size);
}
#undef ASN_STR_LEN
#undef SEGMENT_STR_LEN
if (seg->type != AS_SEQUENCE)
len += snprintf(
str_buf + len, str_size - len, "%c",
aspath_delimiter_char(seg->type, AS_SEG_START));
jseg_list = json_object_new_array();
/* write out the ASNs, with their seperators, bar the last one*/
for (i = 0; i < seg->length; i++) {
json_object_array_add(jseg_list,
json_object_new_int(seg->as[i]));
len += snprintf(str_buf + len, str_size - len, "%u",
seg->as[i]);
if (i < (seg->length - 1))
len += snprintf(str_buf + len, str_size - len,
"%c", seperator);
}
jseg = json_object_new_object();
json_object_string_add(jseg, "type",
aspath_segment_type_str[seg->type]);
json_object_object_add(jseg, "list", jseg_list);
json_object_array_add(jaspath_segments, jseg);
if (seg->type != AS_SEQUENCE)
len += snprintf(
str_buf + len, str_size - len, "%c",
aspath_delimiter_char(seg->type, AS_SEG_END));
if (seg->next)
len += snprintf(str_buf + len, str_size - len, " ");
seg = seg->next;
}
assert(len < str_size);
str_buf[len] = '\0';
as->str = str_buf;
as->str_len = len;
json_object_string_add(as->json, "string", str_buf);
json_object_object_add(as->json, "segments", jaspath_segments);
json_object_int_add(as->json, "length", aspath_count_hops(as));
return;
}
static void aspath_str_update(struct aspath *as)
{
if (as->str)
XFREE(MTYPE_AS_STR, as->str);
if (as->json) {
json_object_free(as->json);
as->json = NULL;
}
aspath_make_str_count(as);
}
/* Intern allocated AS path. */
struct aspath *aspath_intern(struct aspath *aspath)
{
struct aspath *find;
/* Assert this AS path structure is not interned and has the string
representation built. */
assert(aspath->refcnt == 0);
assert(aspath->str);
/* Check AS path hash. */
find = hash_get(ashash, aspath, hash_alloc_intern);
if (find != aspath)
aspath_free(aspath);
find->refcnt++;
return find;
}
/* Duplicate aspath structure. Created same aspath structure but
reference count and AS path string is cleared. */
struct aspath *aspath_dup(struct aspath *aspath)
{
unsigned short buflen = aspath->str_len + 1;
struct aspath *new;
new = XCALLOC(MTYPE_AS_PATH, sizeof(struct aspath));
new->json = NULL;
if (aspath->segments)
new->segments = assegment_dup_all(aspath->segments);
if (!aspath->str)
return new;
new->str = XMALLOC(MTYPE_AS_STR, buflen);
new->str_len = aspath->str_len;
/* copy the string data */
if (aspath->str_len > 0)
memcpy(new->str, aspath->str, buflen);
else
new->str[0] = '\0';
return new;
}
static void *aspath_hash_alloc(void *arg)
{
const struct aspath *aspath = arg;
struct aspath *new;
/* Malformed AS path value. */
assert(aspath->str);
/* New aspath structure is needed. */
new = XMALLOC(MTYPE_AS_PATH, sizeof(struct aspath));
/* Reuse segments and string representation */
new->refcnt = 0;
new->segments = aspath->segments;
new->str = aspath->str;
new->str_len = aspath->str_len;
new->json = aspath->json;
return new;
}
/* parse as-segment byte stream in struct assegment */
static int assegments_parse(struct stream *s, size_t length,
struct assegment **result, int use32bit)
{
struct assegment_header segh;
struct assegment *seg, *prev = NULL, *head = NULL;
size_t bytes = 0;
/* empty aspath (ie iBGP or somesuch) */
if (length == 0)
return 0;
if (BGP_DEBUG(as4, AS4_SEGMENT))
zlog_debug(
"[AS4SEG] Parse aspath segment: got total byte length %lu",
(unsigned long)length);
/* basic checks */
if ((STREAM_READABLE(s) < length)
|| (STREAM_READABLE(s) < AS_HEADER_SIZE)
|| (length % AS16_VALUE_SIZE))
return -1;
while (bytes < length) {
int i;
size_t seg_size;
if ((length - bytes) <= AS_HEADER_SIZE) {
if (head)
assegment_free_all(head);
return -1;
}
/* softly softly, get the header first on its own */
segh.type = stream_getc(s);
segh.length = stream_getc(s);
seg_size = ASSEGMENT_SIZE(segh.length, use32bit);
if (BGP_DEBUG(as4, AS4_SEGMENT))
zlog_debug(
"[AS4SEG] Parse aspath segment: got type %d, length %d",
segh.type, segh.length);
/* check it.. */
if (((bytes + seg_size) > length)
/* 1771bis 4.3b: seg length contains one or more */
|| (segh.length == 0)
/* Paranoia in case someone changes type of segment length.
* Shift both values by 0x10 to make the comparison operate
* on more, than 8 bits (otherwise it's a warning, bug
* #564).
*/
|| ((sizeof segh.length > 1)
&& (0x10 + segh.length > 0x10 + AS_SEGMENT_MAX))) {
if (head)
assegment_free_all(head);
return -1;
}
switch (segh.type) {
case AS_SEQUENCE:
case AS_SET:
case AS_CONFED_SEQUENCE:
case AS_CONFED_SET:
break;
default:
if (head)
assegment_free_all(head);
return -1;
}
/* now its safe to trust lengths */
seg = assegment_new(segh.type, segh.length);
if (head)
prev->next = seg;
else /* it's the first segment */
head = prev = seg;
for (i = 0; i < segh.length; i++)
seg->as[i] =
(use32bit) ? stream_getl(s) : stream_getw(s);
bytes += seg_size;
if (BGP_DEBUG(as4, AS4_SEGMENT))
zlog_debug(
"[AS4SEG] Parse aspath segment: Bytes now: %lu",
(unsigned long)bytes);
prev = seg;
}
*result = assegment_normalise(head);
return 0;
}
/* AS path parse function. pnt is a pointer to byte stream and length
is length of byte stream. If there is same AS path in the the AS
path hash then return it else make new AS path structure.
On error NULL is returned.
*/
struct aspath *aspath_parse(struct stream *s, size_t length, int use32bit)
{
struct aspath as;
struct aspath *find;
/* If length is odd it's malformed AS path. */
/* Nit-picking: if (use32bit == 0) it is malformed if odd,
* otherwise its malformed when length is larger than 2 and (length-2)
* is not dividable by 4.
* But... this time we're lazy
*/
if (length % AS16_VALUE_SIZE)
return NULL;
memset(&as, 0, sizeof(struct aspath));
if (assegments_parse(s, length, &as.segments, use32bit) < 0)
return NULL;
/* If already same aspath exist then return it. */
find = hash_get(ashash, &as, aspath_hash_alloc);
/* bug! should not happen, let the daemon crash below */
assert(find);
/* if the aspath was already hashed free temporary memory. */
if (find->refcnt) {
assegment_free_all(as.segments);
/* aspath_key_make() always updates the string */
XFREE(MTYPE_AS_STR, as.str);
if (as.json) {
json_object_free(as.json);
as.json = NULL;
}
}
find->refcnt++;
return find;
}
static void assegment_data_put(struct stream *s, as_t *as, int num,
int use32bit)
{
int i;
assert(num <= AS_SEGMENT_MAX);
for (i = 0; i < num; i++)
if (use32bit)
stream_putl(s, as[i]);
else {
if (as[i] <= BGP_AS_MAX)
stream_putw(s, as[i]);
else
stream_putw(s, BGP_AS_TRANS);
}
}
static size_t assegment_header_put(struct stream *s, u_char type, int length)
{
size_t lenp;
assert(length <= AS_SEGMENT_MAX);
stream_putc(s, type);
lenp = stream_get_endp(s);
stream_putc(s, length);
return lenp;
}
/* write aspath data to stream */
size_t aspath_put(struct stream *s, struct aspath *as, int use32bit)
{
struct assegment *seg = as->segments;
size_t bytes = 0;
if (!seg || seg->length == 0)
return 0;
if (seg) {
/*
* Hey, what do we do when we have > STREAM_WRITABLE(s) here?
* At the moment, we would write out a partial aspath, and our
* peer
* will complain and drop the session :-/
*
* The general assumption here is that many things tested will
* never happen. And, in real live, up to now, they have not.
*/
while (seg && (ASSEGMENT_LEN(seg, use32bit)
<= STREAM_WRITEABLE(s))) {
struct assegment *next = seg->next;
int written = 0;
int asns_packed = 0;
size_t lenp;
/* Overlength segments have to be split up */
while ((seg->length - written) > AS_SEGMENT_MAX) {
assegment_header_put(s, seg->type,
AS_SEGMENT_MAX);
assegment_data_put(s, seg->as, AS_SEGMENT_MAX,
use32bit);
written += AS_SEGMENT_MAX;
bytes += ASSEGMENT_SIZE(AS_SEGMENT_MAX, use32bit);
}
/* write the final segment, probably is also the first
*/
lenp = assegment_header_put(s, seg->type,
seg->length - written);
assegment_data_put(s, (seg->as + written),
seg->length - written, use32bit);
/* Sequence-type segments can be 'packed' together
* Case of a segment which was overlength and split up
* will be missed here, but that doesn't matter.
*/
while (next && ASSEGMENTS_PACKABLE(seg, next)) {
/* NB: We should never normally get here given
* we
* normalise aspath data when parse them.
* However, better
* safe than sorry. We potentially could call
* assegment_normalise here instead, but it's
* cheaper and
* easier to do it on the fly here rather than
* go through
* the segment list twice every time we write
* out
* aspath's.
*/
/* Next segment's data can fit in this one */
assegment_data_put(s, next->as, next->length,
use32bit);
/* update the length of the segment header */
stream_putc_at(s, lenp,
seg->length - written
+ next->length);
asns_packed += next->length;
next = next->next;
}
bytes += ASSEGMENT_SIZE(
seg->length - written + asns_packed, use32bit);
seg = next;
}
}
return bytes;
}
/* This is for SNMP BGP4PATHATTRASPATHSEGMENT
* We have no way to manage the storage, so we use a static stream
* wrapper around aspath_put.
*/
u_char *aspath_snmp_pathseg(struct aspath *as, size_t *varlen)
{
#define SNMP_PATHSEG_MAX 1024
if (!snmp_stream)
snmp_stream = stream_new(SNMP_PATHSEG_MAX);
else
stream_reset(snmp_stream);
if (!as) {
*varlen = 0;
return NULL;
}
aspath_put(snmp_stream, as, 0); /* use 16 bit for now here */
*varlen = stream_get_endp(snmp_stream);
return stream_pnt(snmp_stream);
}
#define min(A,B) ((A) < (B) ? (A) : (B))
static struct assegment *aspath_aggregate_as_set_add(struct aspath *aspath,
struct assegment *asset,
as_t as)
{
int i;
/* If this is first AS set member, create new as-set segment. */
if (asset == NULL) {
asset = assegment_new(AS_SET, 1);
if (!aspath->segments)
aspath->segments = asset;
else {
struct assegment *seg = aspath->segments;
while (seg->next)
seg = seg->next;
seg->next = asset;
}
asset->type = AS_SET;
asset->length = 1;
asset->as[0] = as;
} else {
/* Check this AS value already exists or not. */
for (i = 0; i < asset->length; i++)
if (asset->as[i] == as)
return asset;
asset->length++;
asset->as = XREALLOC(MTYPE_AS_SEG_DATA, asset->as,
asset->length * AS_VALUE_SIZE);
asset->as[asset->length - 1] = as;
}
return asset;
}
/* Modify as1 using as2 for aggregation. */
struct aspath *aspath_aggregate(struct aspath *as1, struct aspath *as2)
{
int i;
int minlen = 0;
int match = 0;
int from;
struct assegment *seg1 = as1->segments;
struct assegment *seg2 = as2->segments;
struct aspath *aspath = NULL;
struct assegment *asset = NULL;
struct assegment *prevseg = NULL;
/* First of all check common leading sequence. */
while (seg1 && seg2) {
/* Check segment type. */
if (seg1->type != seg2->type)
break;
/* Minimum segment length. */
minlen = min(seg1->length, seg2->length);
for (match = 0; match < minlen; match++)
if (seg1->as[match] != seg2->as[match])
break;
if (match) {
struct assegment *seg = assegment_new(seg1->type, 0);
seg = assegment_append_asns(seg, seg1->as, match);
if (!aspath) {
aspath = aspath_new();
aspath->segments = seg;
} else
prevseg->next = seg;
prevseg = seg;
}
if (match != minlen || match != seg1->length
|| seg1->length != seg2->length)
break;
/* We are moving on to the next segment to reset match */
else
match = 0;
seg1 = seg1->next;
seg2 = seg2->next;
}
if (!aspath)
aspath = aspath_new();
/* Make as-set using rest of all information. */
from = match;
while (seg1) {
for (i = from; i < seg1->length; i++)
asset = aspath_aggregate_as_set_add(aspath, asset,
seg1->as[i]);
from = 0;
seg1 = seg1->next;
}
from = match;
while (seg2) {
for (i = from; i < seg2->length; i++)
asset = aspath_aggregate_as_set_add(aspath, asset,
seg2->as[i]);
from = 0;
seg2 = seg2->next;
}
assegment_normalise(aspath->segments);
aspath_str_update(aspath);
return aspath;
}
/* When a BGP router receives an UPDATE with an MP_REACH_NLRI
attribute, check the leftmost AS number in the AS_PATH attribute is
or not the peer's AS number. */
int aspath_firstas_check(struct aspath *aspath, as_t asno)
{
if ((aspath == NULL) || (aspath->segments == NULL))
return 0;
if (aspath->segments && (aspath->segments->type == AS_SEQUENCE)
&& (aspath->segments->as[0] == asno))
return 1;
return 0;
}
unsigned int aspath_get_first_as(struct aspath *aspath)
{
if (aspath == NULL || aspath->segments == NULL)
return 0;
return aspath->segments->as[0];
}
unsigned int aspath_get_last_as(struct aspath *aspath)
{
int i;
unsigned int last_as = 0;
const struct assegment *seg;
if (aspath == NULL || aspath->segments == NULL)
return last_as;
seg = aspath->segments;
while (seg) {
if (seg->type == AS_SEQUENCE || seg->type == AS_CONFED_SEQUENCE)
for (i = 0; i < seg->length; i++)
last_as = seg->as[i];
seg = seg->next;
}
return last_as;
}
/* AS path loop check. If aspath contains asno then return >= 1. */
int aspath_loop_check(struct aspath *aspath, as_t asno)
{
struct assegment *seg;
int count = 0;
if ((aspath == NULL) || (aspath->segments == NULL))
return 0;
seg = aspath->segments;
while (seg) {
int i;
for (i = 0; i < seg->length; i++)
if (seg->as[i] == asno)
count++;
seg = seg->next;
}
return count;
}
/* When all of AS path is private AS return 1. */
int aspath_private_as_check(struct aspath *aspath)
{
struct assegment *seg;
if (!(aspath && aspath->segments))
return 0;
seg = aspath->segments;
while (seg) {
int i;
for (i = 0; i < seg->length; i++) {
if (!BGP_AS_IS_PRIVATE(seg->as[i]))
return 0;
}
seg = seg->next;
}
return 1;
}
/* Return True if the entire ASPATH consist of the specified ASN */
int aspath_single_asn_check(struct aspath *aspath, as_t asn)
{
struct assegment *seg;
if (!(aspath && aspath->segments))
return 0;
seg = aspath->segments;
while (seg) {
int i;
for (i = 0; i < seg->length; i++) {
if (seg->as[i] != asn)
return 0;
}
seg = seg->next;
}
return 1;
}
/* Replace all instances of the target ASN with our own ASN */
struct aspath *aspath_replace_specific_asn(struct aspath *aspath,
as_t target_asn, as_t our_asn)
{
struct aspath *new;
struct assegment *seg;
new = aspath_dup(aspath);
seg = new->segments;
while (seg) {
int i;
for (i = 0; i < seg->length; i++) {
if (seg->as[i] == target_asn)
seg->as[i] = our_asn;
}
seg = seg->next;
}
aspath_str_update(new);
return new;
}
/* Replace all private ASNs with our own ASN */
struct aspath *aspath_replace_private_asns(struct aspath *aspath, as_t asn)
{
struct aspath *new;
struct assegment *seg;
new = aspath_dup(aspath);
seg = new->segments;
while (seg) {
int i;
for (i = 0; i < seg->length; i++) {
if (BGP_AS_IS_PRIVATE(seg->as[i]))
seg->as[i] = asn;
}
seg = seg->next;
}
aspath_str_update(new);
return new;
}
/* Remove all private ASNs */
struct aspath *aspath_remove_private_asns(struct aspath *aspath)
{
struct aspath *new;
struct assegment *seg;
struct assegment *new_seg;
struct assegment *last_new_seg;
int i;
int j;
int public = 0;
new = XCALLOC(MTYPE_AS_PATH, sizeof(struct aspath));
new->json = NULL;
new_seg = NULL;
last_new_seg = NULL;
seg = aspath->segments;
while (seg) {
public
= 0;
for (i = 0; i < seg->length; i++) {
// ASN is public
if (!BGP_AS_IS_PRIVATE(seg->as[i])) {
public
++;
}
}
// The entire segment is private so skip it
if (!public) {
seg = seg->next;
continue;
}
// The entire segment is public so copy it
else if (public == seg->length) {
new_seg = assegment_dup(seg);
}
// The segment is a mix of public and private ASNs. Copy as many
// spots as
// there are public ASNs then come back and fill in only the
// public ASNs.
else {
new_seg = assegment_new(seg->type, public);
j = 0;
for (i = 0; i < seg->length; i++) {
// ASN is public
if (!BGP_AS_IS_PRIVATE(seg->as[i])) {
new_seg->as[j] = seg->as[i];
j++;
}
}
}
// This is the first segment so set the aspath segments pointer
// to this one
if (!last_new_seg)
new->segments = new_seg;
else
last_new_seg->next = new_seg;
last_new_seg = new_seg;
seg = seg->next;
}
aspath_str_update(new);
return new;
}
/* AS path confed check. If aspath contains confed set or sequence then return
* 1. */
int aspath_confed_check(struct aspath *aspath)
{
struct assegment *seg;
if (!(aspath && aspath->segments))
return 0;
seg = aspath->segments;
while (seg) {
if (seg->type == AS_CONFED_SET
|| seg->type == AS_CONFED_SEQUENCE)
return 1;
seg = seg->next;
}
return 0;
}
/* Leftmost AS path segment confed check. If leftmost AS segment is of type
AS_CONFED_SEQUENCE or AS_CONFED_SET then return 1. */
int aspath_left_confed_check(struct aspath *aspath)
{
if (!(aspath && aspath->segments))
return 0;
if ((aspath->segments->type == AS_CONFED_SEQUENCE)
|| (aspath->segments->type == AS_CONFED_SET))
return 1;
return 0;
}
/* Merge as1 to as2. as2 should be uninterned aspath. */
static struct aspath *aspath_merge(struct aspath *as1, struct aspath *as2)
{
struct assegment *last, *new;
if (!as1 || !as2)
return NULL;
last = new = assegment_dup_all(as1->segments);
/* find the last valid segment */
while (last && last->next)
last = last->next;
last->next = as2->segments;
as2->segments = new;
aspath_str_update(as2);
return as2;
}
/* Prepend as1 to as2. as2 should be uninterned aspath. */
struct aspath *aspath_prepend(struct aspath *as1, struct aspath *as2)
{
struct assegment *seg1;
struct assegment *seg2;
if (!as1 || !as2)
return NULL;
seg1 = as1->segments;
seg2 = as2->segments;
/* If as2 is empty, only need to dupe as1's chain onto as2 */
if (seg2 == NULL) {
as2->segments = assegment_dup_all(as1->segments);
aspath_str_update(as2);
return as2;
}
/* If as1 is empty AS, no prepending to do. */
if (seg1 == NULL)
return as2;
/* find the tail as1's segment chain. */
while (seg1 && seg1->next)
seg1 = seg1->next;
/* Delete any AS_CONFED_SEQUENCE segment from as2. */
if (seg1->type == AS_SEQUENCE && seg2->type == AS_CONFED_SEQUENCE)
as2 = aspath_delete_confed_seq(as2);
/* Compare last segment type of as1 and first segment type of as2. */
if (seg1->type != seg2->type)
return aspath_merge(as1, as2);
if (seg1->type == AS_SEQUENCE) {
/* We have two chains of segments, as1->segments and seg2,
* and we have to attach them together, merging the attaching
* segments together into one.
*
* 1. dupe as1->segments onto head of as2
* 2. merge seg2's asns onto last segment of this new chain
* 3. attach chain after seg2
*/
/* dupe as1 onto as2's head */
seg1 = as2->segments = assegment_dup_all(as1->segments);
/* refind the tail of as2, reusing seg1 */
while (seg1 && seg1->next)
seg1 = seg1->next;
/* merge the old head, seg2, into tail, seg1 */
seg1 = assegment_append_asns(seg1, seg2->as, seg2->length);
/* bypass the merged seg2, and attach any chain after it to
* chain descending from as2's head
*/
seg1->next = seg2->next;
/* seg2 is now referenceless and useless*/
assegment_free(seg2);
/* we've now prepended as1's segment chain to as2, merging
* the inbetween AS_SEQUENCE of seg2 in the process
*/
aspath_str_update(as2);
return as2;
} else {
/* AS_SET merge code is needed at here. */
return aspath_merge(as1, as2);
}
/* XXX: Ermmm, what if as1 has multiple segments?? */
/* Not reached */
}
/* Iterate over AS_PATH segments and wipe all occurences of the
* listed AS numbers. Hence some segments may lose some or even
* all data on the way, the operation is implemented as a smarter
* version of aspath_dup(), which allocates memory to hold the new
* data, not the original. The new AS path is returned.
*/
struct aspath *aspath_filter_exclude(struct aspath *source,
struct aspath *exclude_list)
{
struct assegment *srcseg, *exclseg, *lastseg;
struct aspath *newpath;
newpath = aspath_new();
lastseg = NULL;
for (srcseg = source->segments; srcseg; srcseg = srcseg->next) {
unsigned i, y, newlen = 0, done = 0, skip_as;
struct assegment *newseg;
/* Find out, how much ASns are we going to pick from this
* segment.
* We can't perform filtering right inline, because the size of
* the new segment isn't known at the moment yet.
*/
for (i = 0; i < srcseg->length; i++) {
skip_as = 0;
for (exclseg = exclude_list->segments;
exclseg && !skip_as; exclseg = exclseg->next)
for (y = 0; y < exclseg->length; y++)
if (srcseg->as[i] == exclseg->as[y]) {
skip_as = 1;
// There's no sense in testing
// the rest of exclusion list,
// bail out.
break;
}
if (!skip_as)
newlen++;
}
/* newlen is now the number of ASns to copy */
if (!newlen)
continue;
/* Actual copying. Allocate memory and iterate once more,
* performing filtering. */
newseg = assegment_new(srcseg->type, newlen);
for (i = 0; i < srcseg->length; i++) {
skip_as = 0;
for (exclseg = exclude_list->segments;
exclseg && !skip_as; exclseg = exclseg->next)
for (y = 0; y < exclseg->length; y++)
if (srcseg->as[i] == exclseg->as[y]) {
skip_as = 1;
break;
}
if (skip_as)
continue;
newseg->as[done++] = srcseg->as[i];
}
/* At his point newlen must be equal to done, and both must be
* positive. Append
* the filtered segment to the gross result. */
if (!lastseg)
newpath->segments = newseg;
else
lastseg->next = newseg;
lastseg = newseg;
}
aspath_str_update(newpath);
/* We are happy returning even an empty AS_PATH, because the
* administrator
* might expect this very behaviour. There's a mean to avoid this, if
* necessary,
* by having a match rule against certain AS_PATH regexps in the
* route-map index.
*/
aspath_free(source);
return newpath;
}
/* Add specified AS to the leftmost of aspath. */
static struct aspath *aspath_add_asns(struct aspath *aspath, as_t asno,
u_char type, unsigned num)
{
struct assegment *assegment = aspath->segments;
unsigned i;
if (assegment && assegment->type == type) {
/* extend existing segment */
aspath->segments =
assegment_prepend_asns(aspath->segments, asno, num);
} else {
/* prepend with new segment */
struct assegment *newsegment = assegment_new(type, num);
for (i = 0; i < num; i++)
newsegment->as[i] = asno;
/* insert potentially replacing empty segment */
if (assegment && assegment->length == 0) {
newsegment->next = assegment->next;
assegment_free(assegment);
} else
newsegment->next = assegment;
aspath->segments = newsegment;
}
aspath_str_update(aspath);
return aspath;
}
/* Add specified AS to the leftmost of aspath num times. */
struct aspath *aspath_add_seq_n(struct aspath *aspath, as_t asno, unsigned num)
{
return aspath_add_asns(aspath, asno, AS_SEQUENCE, num);
}
/* Add specified AS to the leftmost of aspath. */
struct aspath *aspath_add_seq(struct aspath *aspath, as_t asno)
{
return aspath_add_asns(aspath, asno, AS_SEQUENCE, 1);
}
/* Compare leftmost AS value for MED check. If as1's leftmost AS and
as2's leftmost AS is same return 1. */
int aspath_cmp_left(const struct aspath *aspath1, const struct aspath *aspath2)
{
const struct assegment *seg1;
const struct assegment *seg2;
if (!(aspath1 && aspath2))
return 0;
seg1 = aspath1->segments;
seg2 = aspath2->segments;
/* If both paths are originated in this AS then we do want to compare
* MED */
if (!seg1 && !seg2)
return 1;
/* find first non-confed segments for each */
while (seg1 && ((seg1->type == AS_CONFED_SEQUENCE)
|| (seg1->type == AS_CONFED_SET)))
seg1 = seg1->next;
while (seg2 && ((seg2->type == AS_CONFED_SEQUENCE)
|| (seg2->type == AS_CONFED_SET)))
seg2 = seg2->next;
/* Check as1's */
if (!(seg1 && seg2 && (seg1->type == AS_SEQUENCE)
&& (seg2->type == AS_SEQUENCE)))
return 0;
if (seg1->as[0] == seg2->as[0])
return 1;
return 0;
}
/* Truncate an aspath after a number of hops, and put the hops remaining
* at the front of another aspath. Needed for AS4 compat.
*
* Returned aspath is a /new/ aspath, which should either by free'd or
* interned by the caller, as desired.
*/
struct aspath *aspath_reconcile_as4(struct aspath *aspath,
struct aspath *as4path)
{
struct assegment *seg, *newseg, *prevseg = NULL;
struct aspath *newpath = NULL, *mergedpath;
int hops, cpasns = 0;
if (!aspath)
return NULL;
seg = aspath->segments;
/* CONFEDs should get reconciled too.. */
hops = (aspath_count_hops(aspath) + aspath_count_confeds(aspath))
- aspath_count_hops(as4path);
if (hops < 0) {
if (BGP_DEBUG(as4, AS4))
zlog_warn(
"[AS4] Fewer hops in AS_PATH than NEW_AS_PATH");
/* Something's gone wrong. The RFC says we should now ignore
* AS4_PATH,
* which is daft behaviour - it contains vital loop-detection
* information which must have been removed from AS_PATH.
*/
hops = aspath_count_hops(aspath);
}
if (!hops) {
newpath = aspath_dup(as4path);
aspath_str_update(newpath);
return newpath;
}
if (BGP_DEBUG(as4, AS4))
zlog_debug(
"[AS4] got AS_PATH %s and AS4_PATH %s synthesizing now",
aspath->str, as4path->str);
while (seg && hops > 0) {
switch (seg->type) {
case AS_SET:
case AS_CONFED_SET:
hops--;
cpasns = seg->length;
break;
case AS_CONFED_SEQUENCE:
/* Should never split a confed-sequence, if hop-count
* suggests we must then something's gone wrong
* somewhere.
*
* Most important goal is to preserve AS_PATHs prime
* function
* as loop-detector, so we fudge the numbers so that the
* entire
* confed-sequence is merged in.
*/
if (hops < seg->length) {
if (BGP_DEBUG(as4, AS4))
zlog_debug(
"[AS4] AS4PATHmangle: AS_CONFED_SEQUENCE falls"
" across 2/4 ASN boundary somewhere, broken..");
hops = seg->length;
}
/* fallthru */
case AS_SEQUENCE:
cpasns = MIN(seg->length, hops);
hops -= seg->length;
}
assert(cpasns <= seg->length);
newseg = assegment_new(seg->type, 0);
newseg = assegment_append_asns(newseg, seg->as, cpasns);
if (!newpath) {
newpath = aspath_new();
newpath->segments = newseg;
} else
prevseg->next = newseg;
prevseg = newseg;
seg = seg->next;
}
/* We may be able to join some segments here, and we must
* do this because... we want normalised aspaths in out hash
* and we do not want to stumble in aspath_put.
*/
mergedpath = aspath_merge(newpath, aspath_dup(as4path));
aspath_free(newpath);
mergedpath->segments = assegment_normalise(mergedpath->segments);
aspath_str_update(mergedpath);
if (BGP_DEBUG(as4, AS4))
zlog_debug("[AS4] result of synthesizing is %s",
mergedpath->str);
return mergedpath;
}
/* Compare leftmost AS value for MED check. If as1's leftmost AS and
as2's leftmost AS is same return 1. (confederation as-path
only). */
int aspath_cmp_left_confed(const struct aspath *aspath1,
const struct aspath *aspath2)
{
if (!(aspath1 && aspath2))
return 0;
if (!(aspath1->segments && aspath2->segments))
return 0;
if ((aspath1->segments->type != AS_CONFED_SEQUENCE)
|| (aspath2->segments->type != AS_CONFED_SEQUENCE))
return 0;
if (aspath1->segments->as[0] == aspath2->segments->as[0])
return 1;
return 0;
}
/* Delete all AS_CONFED_SEQUENCE/SET segments from aspath.
* RFC 5065 section 4.1.c.1
*
* 1) if any path segments of the AS_PATH are of the type
* AS_CONFED_SEQUENCE or AS_CONFED_SET, those segments MUST be
* removed from the AS_PATH attribute, leaving the sanitized
* AS_PATH attribute to be operated on by steps 2, 3 or 4.
*/
struct aspath *aspath_delete_confed_seq(struct aspath *aspath)
{
struct assegment *seg, *prev, *next;
char removed_confed_segment;
if (!(aspath && aspath->segments))
return aspath;
seg = aspath->segments;
removed_confed_segment = 0;
next = NULL;
prev = NULL;
while (seg) {
next = seg->next;
if (seg->type == AS_CONFED_SEQUENCE
|| seg->type == AS_CONFED_SET) {
/* This is the first segment in the aspath */
if (aspath->segments == seg)
aspath->segments = seg->next;
else
prev->next = seg->next;
assegment_free(seg);
removed_confed_segment = 1;
} else
prev = seg;
seg = next;
}
if (removed_confed_segment)
aspath_str_update(aspath);
return aspath;
}
/* Add new AS number to the leftmost part of the aspath as
AS_CONFED_SEQUENCE. */
struct aspath *aspath_add_confed_seq(struct aspath *aspath, as_t asno)
{
return aspath_add_asns(aspath, asno, AS_CONFED_SEQUENCE, 1);
}
/* Add new as value to as path structure. */
static void aspath_as_add(struct aspath *as, as_t asno)
{
struct assegment *seg = as->segments;
if (!seg)
return;
/* Last segment search procedure. */
while (seg->next)
seg = seg->next;
assegment_append_asns(seg, &asno, 1);
}
/* Add new as segment to the as path. */
static void aspath_segment_add(struct aspath *as, int type)
{
struct assegment *seg = as->segments;
struct assegment *new = assegment_new(type, 0);
if (seg) {
while (seg->next)
seg = seg->next;
seg->next = new;
} else
as->segments = new;
}
struct aspath *aspath_empty(void)
{
return aspath_parse(NULL, 0, 1); /* 32Bit ;-) */
}
struct aspath *aspath_empty_get(void)
{
struct aspath *aspath;
aspath = aspath_new();
aspath_make_str_count(aspath);
return aspath;
}
unsigned long aspath_count(void)
{
return ashash->count;
}
/*
Theoretically, one as path can have:
One BGP packet size should be less than 4096.
One BGP attribute size should be less than 4096 - BGP header size.
One BGP aspath size should be less than 4096 - BGP header size -
BGP mandantry attribute size.
*/
/* AS path string lexical token enum. */
enum as_token {
as_token_asval,
as_token_set_start,
as_token_set_end,
as_token_confed_seq_start,
as_token_confed_seq_end,
as_token_confed_set_start,
as_token_confed_set_end,
as_token_unknown
};
/* Return next token and point for string parse. */
static const char *aspath_gettoken(const char *buf, enum as_token *token,
u_long *asno)
{
const char *p = buf;
/* Skip seperators (space for sequences, ',' for sets). */
while (isspace((int)*p) || *p == ',')
p++;
/* Check the end of the string and type specify characters
(e.g. {}()). */
switch (*p) {
case '\0':
return NULL;
case '{':
*token = as_token_set_start;
p++;
return p;
case '}':
*token = as_token_set_end;
p++;
return p;
case '(':
*token = as_token_confed_seq_start;
p++;
return p;
case ')':
*token = as_token_confed_seq_end;
p++;
return p;
case '[':
*token = as_token_confed_set_start;
p++;
return p;
case ']':
*token = as_token_confed_set_end;
p++;
return p;
}
/* Check actual AS value. */
if (isdigit((int)*p)) {
as_t asval;
*token = as_token_asval;
asval = (*p - '0');
p++;
while (isdigit((int)*p)) {
asval *= 10;
asval += (*p - '0');
p++;
}
*asno = asval;
return p;
}
/* There is no match then return unknown token. */
*token = as_token_unknown;
return p++;
}
struct aspath *aspath_str2aspath(const char *str)
{
enum as_token token = as_token_unknown;
u_short as_type;
u_long asno = 0;
struct aspath *aspath;
int needtype;
aspath = aspath_new();
/* We start default type as AS_SEQUENCE. */
as_type = AS_SEQUENCE;
needtype = 1;
while ((str = aspath_gettoken(str, &token, &asno)) != NULL) {
switch (token) {
case as_token_asval:
if (needtype) {
aspath_segment_add(aspath, as_type);
needtype = 0;
}
aspath_as_add(aspath, asno);
break;
case as_token_set_start:
as_type = AS_SET;
aspath_segment_add(aspath, as_type);
needtype = 0;
break;
case as_token_set_end:
as_type = AS_SEQUENCE;
needtype = 1;
break;
case as_token_confed_seq_start:
as_type = AS_CONFED_SEQUENCE;
aspath_segment_add(aspath, as_type);
needtype = 0;
break;
case as_token_confed_seq_end:
as_type = AS_SEQUENCE;
needtype = 1;
break;
case as_token_confed_set_start:
as_type = AS_CONFED_SET;
aspath_segment_add(aspath, as_type);
needtype = 0;
break;
case as_token_confed_set_end:
as_type = AS_SEQUENCE;
needtype = 1;
break;
case as_token_unknown:
default:
aspath_free(aspath);
return NULL;
}
}
aspath_make_str_count(aspath);
return aspath;
}
/* Make hash value by raw aspath data. */
unsigned int aspath_key_make(void *p)
{
struct aspath *aspath = (struct aspath *)p;
unsigned int key = 0;
if (!aspath->str)
aspath_str_update(aspath);
key = jhash(aspath->str, aspath->str_len, 2334325);
return key;
}
/* If two aspath have same value then return 1 else return 0 */
int aspath_cmp(const void *arg1, const void *arg2)
{
const struct assegment *seg1 = ((const struct aspath *)arg1)->segments;
const struct assegment *seg2 = ((const struct aspath *)arg2)->segments;
while (seg1 || seg2) {
int i;
if ((!seg1 && seg2) || (seg1 && !seg2))
return 0;
if (seg1->type != seg2->type)
return 0;
if (seg1->length != seg2->length)
return 0;
for (i = 0; i < seg1->length; i++)
if (seg1->as[i] != seg2->as[i])
return 0;
seg1 = seg1->next;
seg2 = seg2->next;
}
return 1;
}
/* AS path hash initialize. */
void aspath_init(void)
{
ashash = hash_create_size(32768,
aspath_key_make,
aspath_cmp,
"BGP AS Path");
}
void aspath_finish(void)
{
hash_clean(ashash, (void (*)(void *))aspath_free);
hash_free(ashash);
ashash = NULL;
if (snmp_stream)
stream_free(snmp_stream);
}
/* return and as path value */
const char *aspath_print(struct aspath *as)
{
return (as ? as->str : NULL);
}
/* Printing functions */
/* Feed the AS_PATH to the vty; the suffix string follows it only in case
* AS_PATH wasn't empty.
*/
void aspath_print_vty(struct vty *vty, const char *format, struct aspath *as,
const char *suffix)
{
assert(format);
vty_out(vty, format, as->str);
if (as->str_len && strlen(suffix))
vty_out(vty, "%s", suffix);
}
static void aspath_show_all_iterator(struct hash_backet *backet,
struct vty *vty)
{
struct aspath *as;
as = (struct aspath *)backet->data;
vty_out(vty, "[%p:%u] (%ld) ", (void *)backet, backet->key, as->refcnt);
vty_out(vty, "%s\n", as->str);
}
/* Print all aspath and hash information. This function is used from
`show [ip] bgp paths' command. */
void aspath_print_all_vty(struct vty *vty)
{
hash_iterate(ashash, (void (*)(struct hash_backet *,
void *))aspath_show_all_iterator,
vty);
}
|