]> git.proxmox.com Git - mirror_frr.git/blob - bgpd/bgp_aspath.c
Merge pull request #4899 from ton31337/fix/no_aspath_prepend_last_7.1
[mirror_frr.git] / bgpd / bgp_aspath.c
1 /* AS path management routines.
2 * Copyright (C) 1996, 97, 98, 99 Kunihiro Ishiguro
3 * Copyright (C) 2005 Sun Microsystems, Inc.
4 *
5 * This file is part of GNU Zebra.
6 *
7 * GNU Zebra is free software; you can redistribute it and/or modify it
8 * under the terms of the GNU General Public License as published by the
9 * Free Software Foundation; either version 2, or (at your option) any
10 * later version.
11 *
12 * GNU Zebra is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License along
18 * with this program; see the file COPYING; if not, write to the Free Software
19 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 */
21
22 #include <zebra.h>
23
24 #include "hash.h"
25 #include "memory.h"
26 #include "vector.h"
27 #include "log.h"
28 #include "stream.h"
29 #include "command.h"
30 #include "jhash.h"
31 #include "queue.h"
32 #include "filter.h"
33
34 #include "bgpd/bgpd.h"
35 #include "bgpd/bgp_aspath.h"
36 #include "bgpd/bgp_debug.h"
37 #include "bgpd/bgp_attr.h"
38 #include "bgpd/bgp_errors.h"
39
40 /* Attr. Flags and Attr. Type Code. */
41 #define AS_HEADER_SIZE 2
42
43 /* Now FOUR octets are used for AS value. */
44 #define AS_VALUE_SIZE sizeof (as_t)
45 /* This is the old one */
46 #define AS16_VALUE_SIZE sizeof (as16_t)
47
48 /* Maximum protocol segment length value */
49 #define AS_SEGMENT_MAX 255
50
51 /* The following length and size macros relate specifically to Quagga's
52 * internal representation of AS-Segments, not per se to the on-wire
53 * sizes and lengths. At present (200508) they sort of match, however
54 * the ONLY functions which should now about the on-wire syntax are
55 * aspath_put, assegment_put and assegment_parse.
56 *
57 * aspath_put returns bytes written, the only definitive record of
58 * size of wire-format attribute..
59 */
60
61 /* Calculated size in bytes of ASN segment data to hold N ASN's */
62 #define ASSEGMENT_DATA_SIZE(N, S) \
63 ((N) * ((S) ? AS_VALUE_SIZE : AS16_VALUE_SIZE))
64
65 /* Calculated size of segment struct to hold N ASN's */
66 #define ASSEGMENT_SIZE(N,S) (AS_HEADER_SIZE + ASSEGMENT_DATA_SIZE (N,S))
67
68 /* AS segment octet length. */
69 #define ASSEGMENT_LEN(X,S) ASSEGMENT_SIZE((X)->length,S)
70
71 /* AS_SEQUENCE segments can be packed together */
72 /* Can the types of X and Y be considered for packing? */
73 #define ASSEGMENT_TYPES_PACKABLE(X, Y) \
74 (((X)->type == (Y)->type) && ((X)->type == AS_SEQUENCE))
75 /* Types and length of X,Y suitable for packing? */
76 #define ASSEGMENTS_PACKABLE(X, Y) \
77 (ASSEGMENT_TYPES_PACKABLE((X), (Y)) \
78 && (((X)->length + (Y)->length) <= AS_SEGMENT_MAX))
79
80 /* As segment header - the on-wire representation
81 * NOT the internal representation!
82 */
83 struct assegment_header {
84 uint8_t type;
85 uint8_t length;
86 };
87
88 /* Hash for aspath. This is the top level structure of AS path. */
89 static struct hash *ashash;
90
91 /* Stream for SNMP. See aspath_snmp_pathseg */
92 static struct stream *snmp_stream;
93
94 /* Callers are required to initialize the memory */
95 static as_t *assegment_data_new(int num)
96 {
97 return (XMALLOC(MTYPE_AS_SEG_DATA, ASSEGMENT_DATA_SIZE(num, 1)));
98 }
99
100 static void assegment_data_free(as_t *asdata)
101 {
102 XFREE(MTYPE_AS_SEG_DATA, asdata);
103 }
104
105 const char *aspath_segment_type_str[] = {"as-invalid", "as-set", "as-sequence",
106 "as-confed-sequence", "as-confed-set"};
107
108 /* Get a new segment. Note that 0 is an allowed length,
109 * and will result in a segment with no allocated data segment.
110 * the caller should immediately assign data to the segment, as the segment
111 * otherwise is not generally valid
112 */
113 static struct assegment *assegment_new(uint8_t type, unsigned short length)
114 {
115 struct assegment *new;
116
117 new = XCALLOC(MTYPE_AS_SEG, sizeof(struct assegment));
118
119 if (length)
120 new->as = assegment_data_new(length);
121
122 new->length = length;
123 new->type = type;
124
125 return new;
126 }
127
128 static void assegment_free(struct assegment *seg)
129 {
130 if (!seg)
131 return;
132
133 if (seg->as)
134 assegment_data_free(seg->as);
135 memset(seg, 0xfe, sizeof(struct assegment));
136 XFREE(MTYPE_AS_SEG, seg);
137
138 return;
139 }
140
141 /* free entire chain of segments */
142 static void assegment_free_all(struct assegment *seg)
143 {
144 struct assegment *prev;
145
146 while (seg) {
147 prev = seg;
148 seg = seg->next;
149 assegment_free(prev);
150 }
151 }
152
153 /* Duplicate just the given assegment and its data */
154 static struct assegment *assegment_dup(struct assegment *seg)
155 {
156 struct assegment *new;
157
158 new = assegment_new(seg->type, seg->length);
159 memcpy(new->as, seg->as, ASSEGMENT_DATA_SIZE(new->length, 1));
160
161 return new;
162 }
163
164 /* Duplicate entire chain of assegments, return the head */
165 static struct assegment *assegment_dup_all(struct assegment *seg)
166 {
167 struct assegment *new = NULL;
168 struct assegment *head = NULL;
169
170 while (seg) {
171 if (head) {
172 new->next = assegment_dup(seg);
173 new = new->next;
174 } else
175 head = new = assegment_dup(seg);
176
177 seg = seg->next;
178 }
179 return head;
180 }
181
182 /* prepend the as number to given segment, given num of times */
183 static struct assegment *assegment_prepend_asns(struct assegment *seg,
184 as_t asnum, int num)
185 {
186 as_t *newas;
187 int i;
188
189 if (!num)
190 return seg;
191
192 if (num >= AS_SEGMENT_MAX)
193 return seg; /* we don't do huge prepends */
194
195 if ((newas = assegment_data_new(seg->length + num)) == NULL)
196 return seg;
197
198 for (i = 0; i < num; i++)
199 newas[i] = asnum;
200
201 memcpy(newas + num, seg->as, ASSEGMENT_DATA_SIZE(seg->length, 1));
202 assegment_data_free(seg->as);
203 seg->as = newas;
204 seg->length += num;
205
206 return seg;
207 }
208
209 /* append given array of as numbers to the segment */
210 static struct assegment *assegment_append_asns(struct assegment *seg,
211 as_t *asnos, int num)
212 {
213 as_t *newas;
214
215 if (!seg)
216 return seg;
217
218 newas = XREALLOC(MTYPE_AS_SEG_DATA, seg->as,
219 ASSEGMENT_DATA_SIZE(seg->length + num, 1));
220
221 seg->as = newas;
222 memcpy(seg->as + seg->length, asnos,
223 ASSEGMENT_DATA_SIZE(num, 1));
224 seg->length += num;
225 return seg;
226 }
227
228 static int int_cmp(const void *p1, const void *p2)
229 {
230 const as_t *as1 = p1;
231 const as_t *as2 = p2;
232
233 return (*as1 == *as2) ? 0 : ((*as1 > *as2) ? 1 : -1);
234 }
235
236 /* normalise the segment.
237 * In particular, merge runs of AS_SEQUENCEs into one segment
238 * Internally, we do not care about the wire segment length limit, and
239 * we want each distinct AS_PATHs to have the exact same internal
240 * representation - eg, so that our hashing actually works..
241 */
242 static struct assegment *assegment_normalise(struct assegment *head)
243 {
244 struct assegment *seg = head, *pin;
245 struct assegment *tmp;
246
247 if (!head)
248 return head;
249
250 while (seg) {
251 pin = seg;
252
253 /* Sort values SET segments, for determinism in paths to aid
254 * creation of hash values / path comparisons
255 * and because it helps other lesser implementations ;)
256 */
257 if (seg->type == AS_SET || seg->type == AS_CONFED_SET) {
258 int tail = 0;
259 int i;
260
261 qsort(seg->as, seg->length, sizeof(as_t), int_cmp);
262
263 /* weed out dupes */
264 for (i = 1; i < seg->length; i++) {
265 if (seg->as[tail] == seg->as[i])
266 continue;
267
268 tail++;
269 if (tail < i)
270 seg->as[tail] = seg->as[i];
271 }
272 /* seg->length can be 0.. */
273 if (seg->length)
274 seg->length = tail + 1;
275 }
276
277 /* read ahead from the current, pinned segment while the
278 * segments
279 * are packable/mergeable. Append all following packable
280 * segments
281 * to the segment we have pinned and remove these appended
282 * segments.
283 */
284 while (pin->next && ASSEGMENT_TYPES_PACKABLE(pin, pin->next)) {
285 tmp = pin->next;
286 seg = pin->next;
287
288 /* append the next sequence to the pinned sequence */
289 pin = assegment_append_asns(pin, seg->as, seg->length);
290
291 /* bypass the next sequence */
292 pin->next = seg->next;
293
294 /* get rid of the now referenceless segment */
295 assegment_free(tmp);
296 }
297
298 seg = pin->next;
299 }
300 return head;
301 }
302
303 static struct aspath *aspath_new(void)
304 {
305 return XCALLOC(MTYPE_AS_PATH, sizeof(struct aspath));
306 }
307
308 /* Free AS path structure. */
309 void aspath_free(struct aspath *aspath)
310 {
311 if (!aspath)
312 return;
313 if (aspath->segments)
314 assegment_free_all(aspath->segments);
315 XFREE(MTYPE_AS_STR, aspath->str);
316
317 if (aspath->json) {
318 json_object_free(aspath->json);
319 aspath->json = NULL;
320 }
321
322 XFREE(MTYPE_AS_PATH, aspath);
323 }
324
325 /* Unintern aspath from AS path bucket. */
326 void aspath_unintern(struct aspath **aspath)
327 {
328 struct aspath *ret;
329 struct aspath *asp = *aspath;
330
331 if (asp->refcnt)
332 asp->refcnt--;
333
334 if (asp->refcnt == 0) {
335 /* This aspath must exist in aspath hash table. */
336 ret = hash_release(ashash, asp);
337 assert(ret != NULL);
338 aspath_free(asp);
339 *aspath = NULL;
340 }
341 }
342
343 /* Return the start or end delimiters for a particular Segment type */
344 #define AS_SEG_START 0
345 #define AS_SEG_END 1
346 static char aspath_delimiter_char(uint8_t type, uint8_t which)
347 {
348 int i;
349 struct {
350 int type;
351 char start;
352 char end;
353 } aspath_delim_char[] = {{AS_SET, '{', '}'},
354 {AS_CONFED_SET, '[', ']'},
355 {AS_CONFED_SEQUENCE, '(', ')'},
356 {0}};
357
358 for (i = 0; aspath_delim_char[i].type != 0; i++) {
359 if (aspath_delim_char[i].type == type) {
360 if (which == AS_SEG_START)
361 return aspath_delim_char[i].start;
362 else if (which == AS_SEG_END)
363 return aspath_delim_char[i].end;
364 }
365 }
366 return ' ';
367 }
368
369 /* countup asns from this segment and index onward */
370 static int assegment_count_asns(struct assegment *seg, int from)
371 {
372 int count = 0;
373 while (seg) {
374 if (!from)
375 count += seg->length;
376 else {
377 count += (seg->length - from);
378 from = 0;
379 }
380 seg = seg->next;
381 }
382 return count;
383 }
384
385 unsigned int aspath_count_confeds(struct aspath *aspath)
386 {
387 int count = 0;
388 struct assegment *seg = aspath->segments;
389
390 while (seg) {
391 if (seg->type == AS_CONFED_SEQUENCE)
392 count += seg->length;
393 else if (seg->type == AS_CONFED_SET)
394 count++;
395
396 seg = seg->next;
397 }
398 return count;
399 }
400
401 unsigned int aspath_count_hops(const struct aspath *aspath)
402 {
403 int count = 0;
404 struct assegment *seg = aspath->segments;
405
406 while (seg) {
407 if (seg->type == AS_SEQUENCE)
408 count += seg->length;
409 else if (seg->type == AS_SET)
410 count++;
411
412 seg = seg->next;
413 }
414 return count;
415 }
416
417 /* Estimate size aspath /might/ take if encoded into an
418 * ASPATH attribute.
419 *
420 * This is a quick estimate, not definitive! aspath_put()
421 * may return a different number!!
422 */
423 unsigned int aspath_size(struct aspath *aspath)
424 {
425 int size = 0;
426 struct assegment *seg = aspath->segments;
427
428 while (seg) {
429 size += ASSEGMENT_SIZE(seg->length, 1);
430 seg = seg->next;
431 }
432 return size;
433 }
434
435 /* Return highest public ASN in path */
436 as_t aspath_highest(struct aspath *aspath)
437 {
438 struct assegment *seg = aspath->segments;
439 as_t highest = 0;
440 unsigned int i;
441
442 while (seg) {
443 for (i = 0; i < seg->length; i++)
444 if (seg->as[i] > highest
445 && !BGP_AS_IS_PRIVATE(seg->as[i]))
446 highest = seg->as[i];
447 seg = seg->next;
448 }
449 return highest;
450 }
451
452 /* Return the left-most ASN in path */
453 as_t aspath_leftmost(struct aspath *aspath)
454 {
455 struct assegment *seg = aspath->segments;
456 as_t leftmost = 0;
457
458 if (seg && seg->length && seg->type == AS_SEQUENCE)
459 leftmost = seg->as[0];
460
461 return leftmost;
462 }
463
464 /* Return 1 if there are any 4-byte ASes in the path */
465 unsigned int aspath_has_as4(struct aspath *aspath)
466 {
467 struct assegment *seg = aspath->segments;
468 unsigned int i;
469
470 while (seg) {
471 for (i = 0; i < seg->length; i++)
472 if (seg->as[i] > BGP_AS_MAX)
473 return 1;
474 seg = seg->next;
475 }
476 return 0;
477 }
478
479 /* Convert aspath structure to string expression. */
480 static void aspath_make_str_count(struct aspath *as, bool make_json)
481 {
482 struct assegment *seg;
483 int str_size;
484 int len = 0;
485 char *str_buf;
486 json_object *jaspath_segments = NULL;
487 json_object *jseg = NULL;
488 json_object *jseg_list = NULL;
489
490 if (make_json) {
491 as->json = json_object_new_object();
492 jaspath_segments = json_object_new_array();
493 }
494
495 /* Empty aspath. */
496 if (!as->segments) {
497 if (make_json) {
498 json_object_string_add(as->json, "string", "Local");
499 json_object_object_add(as->json, "segments",
500 jaspath_segments);
501 json_object_int_add(as->json, "length", 0);
502 }
503 as->str = XMALLOC(MTYPE_AS_STR, 1);
504 as->str[0] = '\0';
505 as->str_len = 0;
506 return;
507 }
508
509 seg = as->segments;
510
511 /* ASN takes 5 to 10 chars plus seperator, see below.
512 * If there is one differing segment type, we need an additional
513 * 2 chars for segment delimiters, and the final '\0'.
514 * Hopefully this is large enough to avoid hitting the realloc
515 * code below for most common sequences.
516 *
517 * This was changed to 10 after the well-known BGP assertion, which
518 * had hit some parts of the Internet in May of 2009.
519 */
520 #define ASN_STR_LEN (10 + 1)
521 str_size = MAX(assegment_count_asns(seg, 0) * ASN_STR_LEN + 2 + 1,
522 ASPATH_STR_DEFAULT_LEN);
523 str_buf = XMALLOC(MTYPE_AS_STR, str_size);
524
525 while (seg) {
526 int i;
527 char seperator;
528
529 /* Check AS type validity. Set seperator for segment */
530 switch (seg->type) {
531 case AS_SET:
532 case AS_CONFED_SET:
533 seperator = ',';
534 break;
535 case AS_SEQUENCE:
536 case AS_CONFED_SEQUENCE:
537 seperator = ' ';
538 break;
539 default:
540 XFREE(MTYPE_AS_STR, str_buf);
541 as->str = NULL;
542 as->str_len = 0;
543 json_object_free(as->json);
544 as->json = NULL;
545
546 return;
547 }
548
549 /* We might need to increase str_buf, particularly if path has
550 * differing segments types, our initial guesstimate above will
551 * have been wrong. Need 10 chars for ASN, a seperator each and
552 * potentially two segment delimiters, plus a space between each
553 * segment and trailing zero.
554 *
555 * This definitely didn't work with the value of 5 bytes and
556 * 32-bit ASNs.
557 */
558 #define SEGMENT_STR_LEN(X) (((X)->length * ASN_STR_LEN) + 2 + 1 + 1)
559 if ((len + SEGMENT_STR_LEN(seg)) > str_size) {
560 str_size = len + SEGMENT_STR_LEN(seg);
561 str_buf = XREALLOC(MTYPE_AS_STR, str_buf, str_size);
562 }
563 #undef ASN_STR_LEN
564 #undef SEGMENT_STR_LEN
565
566 if (seg->type != AS_SEQUENCE)
567 len += snprintf(
568 str_buf + len, str_size - len, "%c",
569 aspath_delimiter_char(seg->type, AS_SEG_START));
570
571 if (make_json)
572 jseg_list = json_object_new_array();
573
574 /* write out the ASNs, with their seperators, bar the last one*/
575 for (i = 0; i < seg->length; i++) {
576 if (make_json)
577 json_object_array_add(
578 jseg_list,
579 json_object_new_int(seg->as[i]));
580
581 len += snprintf(str_buf + len, str_size - len, "%u",
582 seg->as[i]);
583
584 if (i < (seg->length - 1))
585 len += snprintf(str_buf + len, str_size - len,
586 "%c", seperator);
587 }
588
589 if (make_json) {
590 jseg = json_object_new_object();
591 json_object_string_add(
592 jseg, "type",
593 aspath_segment_type_str[seg->type]);
594 json_object_object_add(jseg, "list", jseg_list);
595 json_object_array_add(jaspath_segments, jseg);
596 }
597
598 if (seg->type != AS_SEQUENCE)
599 len += snprintf(
600 str_buf + len, str_size - len, "%c",
601 aspath_delimiter_char(seg->type, AS_SEG_END));
602 if (seg->next)
603 len += snprintf(str_buf + len, str_size - len, " ");
604
605 seg = seg->next;
606 }
607
608 assert(len < str_size);
609
610 str_buf[len] = '\0';
611 as->str = str_buf;
612 as->str_len = len;
613
614 if (make_json) {
615 json_object_string_add(as->json, "string", str_buf);
616 json_object_object_add(as->json, "segments", jaspath_segments);
617 json_object_int_add(as->json, "length", aspath_count_hops(as));
618 }
619
620 return;
621 }
622
623 void aspath_str_update(struct aspath *as, bool make_json)
624 {
625 XFREE(MTYPE_AS_STR, as->str);
626
627 if (as->json) {
628 json_object_free(as->json);
629 as->json = NULL;
630 }
631
632 aspath_make_str_count(as, make_json);
633 }
634
635 /* Intern allocated AS path. */
636 struct aspath *aspath_intern(struct aspath *aspath)
637 {
638 struct aspath *find;
639
640 /* Assert this AS path structure is not interned and has the string
641 representation built. */
642 assert(aspath->refcnt == 0);
643 assert(aspath->str);
644
645 /* Check AS path hash. */
646 find = hash_get(ashash, aspath, hash_alloc_intern);
647 if (find != aspath)
648 aspath_free(aspath);
649
650 find->refcnt++;
651
652 return find;
653 }
654
655 /* Duplicate aspath structure. Created same aspath structure but
656 reference count and AS path string is cleared. */
657 struct aspath *aspath_dup(struct aspath *aspath)
658 {
659 unsigned short buflen = aspath->str_len + 1;
660 struct aspath *new;
661
662 new = XCALLOC(MTYPE_AS_PATH, sizeof(struct aspath));
663 new->json = NULL;
664
665 if (aspath->segments)
666 new->segments = assegment_dup_all(aspath->segments);
667
668 if (!aspath->str)
669 return new;
670
671 new->str = XMALLOC(MTYPE_AS_STR, buflen);
672 new->str_len = aspath->str_len;
673
674 /* copy the string data */
675 if (aspath->str_len > 0)
676 memcpy(new->str, aspath->str, buflen);
677 else
678 new->str[0] = '\0';
679
680 return new;
681 }
682
683 static void *aspath_hash_alloc(void *arg)
684 {
685 const struct aspath *aspath = arg;
686 struct aspath *new;
687
688 /* Malformed AS path value. */
689 assert(aspath->str);
690
691 /* New aspath structure is needed. */
692 new = XMALLOC(MTYPE_AS_PATH, sizeof(struct aspath));
693
694 /* Reuse segments and string representation */
695 new->refcnt = 0;
696 new->segments = aspath->segments;
697 new->str = aspath->str;
698 new->str_len = aspath->str_len;
699 new->json = aspath->json;
700
701 return new;
702 }
703
704 /* parse as-segment byte stream in struct assegment */
705 static int assegments_parse(struct stream *s, size_t length,
706 struct assegment **result, int use32bit)
707 {
708 struct assegment_header segh;
709 struct assegment *seg, *prev = NULL, *head = NULL;
710 size_t bytes = 0;
711
712 /* empty aspath (ie iBGP or somesuch) */
713 if (length == 0)
714 return 0;
715
716 if (BGP_DEBUG(as4, AS4_SEGMENT))
717 zlog_debug(
718 "[AS4SEG] Parse aspath segment: got total byte length %lu",
719 (unsigned long)length);
720 /* basic checks */
721 if ((STREAM_READABLE(s) < length)
722 || (STREAM_READABLE(s) < AS_HEADER_SIZE)
723 || (length % AS16_VALUE_SIZE))
724 return -1;
725
726 while (bytes < length) {
727 int i;
728 size_t seg_size;
729
730 if ((length - bytes) <= AS_HEADER_SIZE) {
731 if (head)
732 assegment_free_all(head);
733 return -1;
734 }
735
736 /* softly softly, get the header first on its own */
737 segh.type = stream_getc(s);
738 segh.length = stream_getc(s);
739
740 seg_size = ASSEGMENT_SIZE(segh.length, use32bit);
741
742 if (BGP_DEBUG(as4, AS4_SEGMENT))
743 zlog_debug(
744 "[AS4SEG] Parse aspath segment: got type %d, length %d",
745 segh.type, segh.length);
746
747 /* check it.. */
748 if (((bytes + seg_size) > length)
749 /* 1771bis 4.3b: seg length contains one or more */
750 || (segh.length == 0)
751 /* Paranoia in case someone changes type of segment length.
752 * Shift both values by 0x10 to make the comparison operate
753 * on more, than 8 bits (otherwise it's a warning, bug
754 * #564).
755 */
756 || ((sizeof segh.length > 1)
757 && (0x10 + segh.length > 0x10 + AS_SEGMENT_MAX))) {
758 if (head)
759 assegment_free_all(head);
760 return -1;
761 }
762
763 switch (segh.type) {
764 case AS_SEQUENCE:
765 case AS_SET:
766 case AS_CONFED_SEQUENCE:
767 case AS_CONFED_SET:
768 break;
769 default:
770 if (head)
771 assegment_free_all(head);
772 return -1;
773 }
774
775 /* now its safe to trust lengths */
776 seg = assegment_new(segh.type, segh.length);
777
778 if (head)
779 prev->next = seg;
780 else /* it's the first segment */
781 head = prev = seg;
782
783 for (i = 0; i < segh.length; i++)
784 seg->as[i] =
785 (use32bit) ? stream_getl(s) : stream_getw(s);
786
787 bytes += seg_size;
788
789 if (BGP_DEBUG(as4, AS4_SEGMENT))
790 zlog_debug(
791 "[AS4SEG] Parse aspath segment: Bytes now: %lu",
792 (unsigned long)bytes);
793
794 prev = seg;
795 }
796
797 *result = assegment_normalise(head);
798 return 0;
799 }
800
801 /* AS path parse function. pnt is a pointer to byte stream and length
802 is length of byte stream. If there is same AS path in the the AS
803 path hash then return it else make new AS path structure.
804
805 On error NULL is returned.
806 */
807 struct aspath *aspath_parse(struct stream *s, size_t length, int use32bit)
808 {
809 struct aspath as;
810 struct aspath *find;
811
812 /* If length is odd it's malformed AS path. */
813 /* Nit-picking: if (use32bit == 0) it is malformed if odd,
814 * otherwise its malformed when length is larger than 2 and (length-2)
815 * is not dividable by 4.
816 * But... this time we're lazy
817 */
818 if (length % AS16_VALUE_SIZE)
819 return NULL;
820
821 memset(&as, 0, sizeof(struct aspath));
822 if (assegments_parse(s, length, &as.segments, use32bit) < 0)
823 return NULL;
824
825 /* If already same aspath exist then return it. */
826 find = hash_get(ashash, &as, aspath_hash_alloc);
827
828 /* bug! should not happen, let the daemon crash below */
829 assert(find);
830
831 /* if the aspath was already hashed free temporary memory. */
832 if (find->refcnt) {
833 assegment_free_all(as.segments);
834 /* aspath_key_make() always updates the string */
835 XFREE(MTYPE_AS_STR, as.str);
836 if (as.json) {
837 json_object_free(as.json);
838 as.json = NULL;
839 }
840 }
841
842 find->refcnt++;
843
844 return find;
845 }
846
847 static void assegment_data_put(struct stream *s, as_t *as, int num,
848 int use32bit)
849 {
850 int i;
851 assert(num <= AS_SEGMENT_MAX);
852
853 for (i = 0; i < num; i++)
854 if (use32bit)
855 stream_putl(s, as[i]);
856 else {
857 if (as[i] <= BGP_AS_MAX)
858 stream_putw(s, as[i]);
859 else
860 stream_putw(s, BGP_AS_TRANS);
861 }
862 }
863
864 static size_t assegment_header_put(struct stream *s, uint8_t type, int length)
865 {
866 size_t lenp;
867 assert(length <= AS_SEGMENT_MAX);
868 stream_putc(s, type);
869 lenp = stream_get_endp(s);
870 stream_putc(s, length);
871 return lenp;
872 }
873
874 /* write aspath data to stream */
875 size_t aspath_put(struct stream *s, struct aspath *as, int use32bit)
876 {
877 struct assegment *seg = as->segments;
878 size_t bytes = 0;
879
880 if (!seg || seg->length == 0)
881 return 0;
882
883 if (seg) {
884 /*
885 * Hey, what do we do when we have > STREAM_WRITABLE(s) here?
886 * At the moment, we would write out a partial aspath, and our
887 * peer
888 * will complain and drop the session :-/
889 *
890 * The general assumption here is that many things tested will
891 * never happen. And, in real live, up to now, they have not.
892 */
893 while (seg && (ASSEGMENT_LEN(seg, use32bit)
894 <= STREAM_WRITEABLE(s))) {
895 struct assegment *next = seg->next;
896 int written = 0;
897 int asns_packed = 0;
898 size_t lenp;
899
900 /* Overlength segments have to be split up */
901 while ((seg->length - written) > AS_SEGMENT_MAX) {
902 assegment_header_put(s, seg->type,
903 AS_SEGMENT_MAX);
904 assegment_data_put(s, (seg->as + written), AS_SEGMENT_MAX,
905 use32bit);
906 written += AS_SEGMENT_MAX;
907 bytes += ASSEGMENT_SIZE(AS_SEGMENT_MAX,
908 use32bit);
909 }
910
911 /* write the final segment, probably is also the first
912 */
913 lenp = assegment_header_put(s, seg->type,
914 seg->length - written);
915 assegment_data_put(s, (seg->as + written),
916 seg->length - written, use32bit);
917
918 /* Sequence-type segments can be 'packed' together
919 * Case of a segment which was overlength and split up
920 * will be missed here, but that doesn't matter.
921 */
922 while (next && ASSEGMENTS_PACKABLE(seg, next)) {
923 /* NB: We should never normally get here given
924 * we
925 * normalise aspath data when parse them.
926 * However, better
927 * safe than sorry. We potentially could call
928 * assegment_normalise here instead, but it's
929 * cheaper and
930 * easier to do it on the fly here rather than
931 * go through
932 * the segment list twice every time we write
933 * out
934 * aspath's.
935 */
936
937 /* Next segment's data can fit in this one */
938 assegment_data_put(s, next->as, next->length,
939 use32bit);
940
941 /* update the length of the segment header */
942 stream_putc_at(s, lenp,
943 seg->length - written
944 + next->length);
945 asns_packed += next->length;
946
947 next = next->next;
948 }
949
950 bytes += ASSEGMENT_SIZE(
951 seg->length - written + asns_packed, use32bit);
952 seg = next;
953 }
954 }
955 return bytes;
956 }
957
958 /* This is for SNMP BGP4PATHATTRASPATHSEGMENT
959 * We have no way to manage the storage, so we use a static stream
960 * wrapper around aspath_put.
961 */
962 uint8_t *aspath_snmp_pathseg(struct aspath *as, size_t *varlen)
963 {
964 #define SNMP_PATHSEG_MAX 1024
965
966 if (!snmp_stream)
967 snmp_stream = stream_new(SNMP_PATHSEG_MAX);
968 else
969 stream_reset(snmp_stream);
970
971 if (!as) {
972 *varlen = 0;
973 return NULL;
974 }
975 aspath_put(snmp_stream, as, 0); /* use 16 bit for now here */
976
977 *varlen = stream_get_endp(snmp_stream);
978 return stream_pnt(snmp_stream);
979 }
980
981 #define min(A,B) ((A) < (B) ? (A) : (B))
982
983 static struct assegment *aspath_aggregate_as_set_add(struct aspath *aspath,
984 struct assegment *asset,
985 as_t as)
986 {
987 int i;
988
989 /* If this is first AS set member, create new as-set segment. */
990 if (asset == NULL) {
991 asset = assegment_new(AS_SET, 1);
992 if (!aspath->segments)
993 aspath->segments = asset;
994 else {
995 struct assegment *seg = aspath->segments;
996 while (seg->next)
997 seg = seg->next;
998 seg->next = asset;
999 }
1000 asset->type = AS_SET;
1001 asset->length = 1;
1002 asset->as[0] = as;
1003 } else {
1004 /* Check this AS value already exists or not. */
1005 for (i = 0; i < asset->length; i++)
1006 if (asset->as[i] == as)
1007 return asset;
1008
1009 asset->length++;
1010 asset->as = XREALLOC(MTYPE_AS_SEG_DATA, asset->as,
1011 asset->length * AS_VALUE_SIZE);
1012 asset->as[asset->length - 1] = as;
1013 }
1014
1015
1016 return asset;
1017 }
1018
1019 /* Modify as1 using as2 for aggregation. */
1020 struct aspath *aspath_aggregate(struct aspath *as1, struct aspath *as2)
1021 {
1022 int i;
1023 int minlen = 0;
1024 int match = 0;
1025 int from;
1026 struct assegment *seg1 = as1->segments;
1027 struct assegment *seg2 = as2->segments;
1028 struct aspath *aspath = NULL;
1029 struct assegment *asset = NULL;
1030 struct assegment *prevseg = NULL;
1031
1032 /* First of all check common leading sequence. */
1033 while (seg1 && seg2) {
1034 /* Check segment type. */
1035 if (seg1->type != seg2->type)
1036 break;
1037
1038 /* Minimum segment length. */
1039 minlen = min(seg1->length, seg2->length);
1040
1041 for (match = 0; match < minlen; match++)
1042 if (seg1->as[match] != seg2->as[match])
1043 break;
1044
1045 if (match) {
1046 struct assegment *seg = assegment_new(seg1->type, 0);
1047
1048 seg = assegment_append_asns(seg, seg1->as, match);
1049
1050 if (!aspath) {
1051 aspath = aspath_new();
1052 aspath->segments = seg;
1053 } else
1054 prevseg->next = seg;
1055
1056 prevseg = seg;
1057 }
1058
1059 if (match != minlen || match != seg1->length
1060 || seg1->length != seg2->length)
1061 break;
1062 /* We are moving on to the next segment to reset match */
1063 else
1064 match = 0;
1065
1066 seg1 = seg1->next;
1067 seg2 = seg2->next;
1068 }
1069
1070 if (!aspath)
1071 aspath = aspath_new();
1072
1073 /* Make as-set using rest of all information. */
1074 from = match;
1075 while (seg1) {
1076 for (i = from; i < seg1->length; i++)
1077 asset = aspath_aggregate_as_set_add(aspath, asset,
1078 seg1->as[i]);
1079
1080 from = 0;
1081 seg1 = seg1->next;
1082 }
1083
1084 from = match;
1085 while (seg2) {
1086 for (i = from; i < seg2->length; i++)
1087 asset = aspath_aggregate_as_set_add(aspath, asset,
1088 seg2->as[i]);
1089
1090 from = 0;
1091 seg2 = seg2->next;
1092 }
1093
1094 assegment_normalise(aspath->segments);
1095 aspath_str_update(aspath, false);
1096 return aspath;
1097 }
1098
1099 /* When a BGP router receives an UPDATE with an MP_REACH_NLRI
1100 attribute, check the leftmost AS number in the AS_PATH attribute is
1101 or not the peer's AS number. */
1102 int aspath_firstas_check(struct aspath *aspath, as_t asno)
1103 {
1104 if ((aspath == NULL) || (aspath->segments == NULL))
1105 return 0;
1106
1107 if (aspath->segments && (aspath->segments->type == AS_SEQUENCE)
1108 && (aspath->segments->as[0] == asno))
1109 return 1;
1110
1111 return 0;
1112 }
1113
1114 unsigned int aspath_get_first_as(struct aspath *aspath)
1115 {
1116 if (aspath == NULL || aspath->segments == NULL)
1117 return 0;
1118
1119 return aspath->segments->as[0];
1120 }
1121
1122 unsigned int aspath_get_last_as(struct aspath *aspath)
1123 {
1124 int i;
1125 unsigned int last_as = 0;
1126 const struct assegment *seg;
1127
1128 if (aspath == NULL || aspath->segments == NULL)
1129 return last_as;
1130
1131 seg = aspath->segments;
1132
1133 while (seg) {
1134 if (seg->type == AS_SEQUENCE || seg->type == AS_CONFED_SEQUENCE)
1135 for (i = 0; i < seg->length; i++)
1136 last_as = seg->as[i];
1137 seg = seg->next;
1138 }
1139
1140 return last_as;
1141 }
1142
1143 /* AS path loop check. If aspath contains asno then return >= 1. */
1144 int aspath_loop_check(struct aspath *aspath, as_t asno)
1145 {
1146 struct assegment *seg;
1147 int count = 0;
1148
1149 if ((aspath == NULL) || (aspath->segments == NULL))
1150 return 0;
1151
1152 seg = aspath->segments;
1153
1154 while (seg) {
1155 int i;
1156
1157 for (i = 0; i < seg->length; i++)
1158 if (seg->as[i] == asno)
1159 count++;
1160
1161 seg = seg->next;
1162 }
1163 return count;
1164 }
1165
1166 /* When all of AS path is private AS return 1. */
1167 int aspath_private_as_check(struct aspath *aspath)
1168 {
1169 struct assegment *seg;
1170
1171 if (!(aspath && aspath->segments))
1172 return 0;
1173
1174 seg = aspath->segments;
1175
1176 while (seg) {
1177 int i;
1178
1179 for (i = 0; i < seg->length; i++) {
1180 if (!BGP_AS_IS_PRIVATE(seg->as[i]))
1181 return 0;
1182 }
1183 seg = seg->next;
1184 }
1185 return 1;
1186 }
1187
1188 /* Return True if the entire ASPATH consist of the specified ASN */
1189 int aspath_single_asn_check(struct aspath *aspath, as_t asn)
1190 {
1191 struct assegment *seg;
1192
1193 if (!(aspath && aspath->segments))
1194 return 0;
1195
1196 seg = aspath->segments;
1197
1198 while (seg) {
1199 int i;
1200
1201 for (i = 0; i < seg->length; i++) {
1202 if (seg->as[i] != asn)
1203 return 0;
1204 }
1205 seg = seg->next;
1206 }
1207 return 1;
1208 }
1209
1210 /* Replace all instances of the target ASN with our own ASN */
1211 struct aspath *aspath_replace_specific_asn(struct aspath *aspath,
1212 as_t target_asn, as_t our_asn)
1213 {
1214 struct aspath *new;
1215 struct assegment *seg;
1216
1217 new = aspath_dup(aspath);
1218 seg = new->segments;
1219
1220 while (seg) {
1221 int i;
1222
1223 for (i = 0; i < seg->length; i++) {
1224 if (seg->as[i] == target_asn)
1225 seg->as[i] = our_asn;
1226 }
1227 seg = seg->next;
1228 }
1229
1230 aspath_str_update(new, false);
1231 return new;
1232 }
1233
1234 /* Replace all private ASNs with our own ASN */
1235 struct aspath *aspath_replace_private_asns(struct aspath *aspath, as_t asn)
1236 {
1237 struct aspath *new;
1238 struct assegment *seg;
1239
1240 new = aspath_dup(aspath);
1241 seg = new->segments;
1242
1243 while (seg) {
1244 int i;
1245
1246 for (i = 0; i < seg->length; i++) {
1247 if (BGP_AS_IS_PRIVATE(seg->as[i]))
1248 seg->as[i] = asn;
1249 }
1250 seg = seg->next;
1251 }
1252
1253 aspath_str_update(new, false);
1254 return new;
1255 }
1256
1257 /* Remove all private ASNs */
1258 struct aspath *aspath_remove_private_asns(struct aspath *aspath)
1259 {
1260 struct aspath *new;
1261 struct assegment *seg;
1262 struct assegment *new_seg;
1263 struct assegment *last_new_seg;
1264 int i;
1265 int j;
1266 int public = 0;
1267
1268 new = XCALLOC(MTYPE_AS_PATH, sizeof(struct aspath));
1269
1270 new->json = NULL;
1271 new_seg = NULL;
1272 last_new_seg = NULL;
1273 seg = aspath->segments;
1274 while (seg) {
1275 public
1276 = 0;
1277 for (i = 0; i < seg->length; i++) {
1278 // ASN is public
1279 if (!BGP_AS_IS_PRIVATE(seg->as[i])) {
1280 public
1281 ++;
1282 }
1283 }
1284
1285 // The entire segment is private so skip it
1286 if (!public) {
1287 seg = seg->next;
1288 continue;
1289 }
1290
1291 // The entire segment is public so copy it
1292 else if (public == seg->length) {
1293 new_seg = assegment_dup(seg);
1294 }
1295
1296 // The segment is a mix of public and private ASNs. Copy as many
1297 // spots as
1298 // there are public ASNs then come back and fill in only the
1299 // public ASNs.
1300 else {
1301 new_seg = assegment_new(seg->type, public);
1302 j = 0;
1303 for (i = 0; i < seg->length; i++) {
1304 // ASN is public
1305 if (!BGP_AS_IS_PRIVATE(seg->as[i])) {
1306 new_seg->as[j] = seg->as[i];
1307 j++;
1308 }
1309 }
1310 }
1311
1312 // This is the first segment so set the aspath segments pointer
1313 // to this one
1314 if (!last_new_seg)
1315 new->segments = new_seg;
1316 else
1317 last_new_seg->next = new_seg;
1318
1319 last_new_seg = new_seg;
1320 seg = seg->next;
1321 }
1322
1323 aspath_str_update(new, false);
1324 return new;
1325 }
1326
1327 /* AS path confed check. If aspath contains confed set or sequence then return
1328 * 1. */
1329 int aspath_confed_check(struct aspath *aspath)
1330 {
1331 struct assegment *seg;
1332
1333 if (!(aspath && aspath->segments))
1334 return 0;
1335
1336 seg = aspath->segments;
1337
1338 while (seg) {
1339 if (seg->type == AS_CONFED_SET
1340 || seg->type == AS_CONFED_SEQUENCE)
1341 return 1;
1342 seg = seg->next;
1343 }
1344 return 0;
1345 }
1346
1347 /* Leftmost AS path segment confed check. If leftmost AS segment is of type
1348 AS_CONFED_SEQUENCE or AS_CONFED_SET then return 1. */
1349 int aspath_left_confed_check(struct aspath *aspath)
1350 {
1351
1352 if (!(aspath && aspath->segments))
1353 return 0;
1354
1355 if ((aspath->segments->type == AS_CONFED_SEQUENCE)
1356 || (aspath->segments->type == AS_CONFED_SET))
1357 return 1;
1358
1359 return 0;
1360 }
1361
1362 /* Merge as1 to as2. as2 should be uninterned aspath. */
1363 static struct aspath *aspath_merge(struct aspath *as1, struct aspath *as2)
1364 {
1365 struct assegment *last, *new;
1366
1367 if (!as1 || !as2)
1368 return NULL;
1369
1370 last = new = assegment_dup_all(as1->segments);
1371
1372 /* find the last valid segment */
1373 while (last && last->next)
1374 last = last->next;
1375
1376 if (last)
1377 last->next = as2->segments;
1378 as2->segments = new;
1379 aspath_str_update(as2, false);
1380 return as2;
1381 }
1382
1383 /* Prepend as1 to as2. as2 should be uninterned aspath. */
1384 struct aspath *aspath_prepend(struct aspath *as1, struct aspath *as2)
1385 {
1386 struct assegment *as1segtail;
1387 struct assegment *as2segtail;
1388 struct assegment *as2seghead;
1389
1390 if (!as1 || !as2)
1391 return NULL;
1392
1393 /* If as2 is empty, only need to dupe as1's chain onto as2 */
1394 if (as2->segments == NULL) {
1395 as2->segments = assegment_dup_all(as1->segments);
1396 aspath_str_update(as2, false);
1397 return as2;
1398 }
1399
1400 /* If as1 is empty AS, no prepending to do. */
1401 if (as1->segments == NULL)
1402 return as2;
1403
1404 /* find the tail as1's segment chain. */
1405 as1segtail = as1->segments;
1406 while (as1segtail && as1segtail->next)
1407 as1segtail = as1segtail->next;
1408
1409 /* Delete any AS_CONFED_SEQUENCE segment from as2. */
1410 if (as1segtail->type == AS_SEQUENCE
1411 && as2->segments->type == AS_CONFED_SEQUENCE)
1412 as2 = aspath_delete_confed_seq(as2);
1413
1414 if (!as2->segments) {
1415 as2->segments = assegment_dup_all(as1->segments);
1416 aspath_str_update(as2, false);
1417 return as2;
1418 }
1419
1420 /* Compare last segment type of as1 and first segment type of as2. */
1421 if (as1segtail->type != as2->segments->type)
1422 return aspath_merge(as1, as2);
1423
1424 if (as1segtail->type == AS_SEQUENCE) {
1425 /* We have two chains of segments, as1->segments and seg2,
1426 * and we have to attach them together, merging the attaching
1427 * segments together into one.
1428 *
1429 * 1. dupe as1->segments onto head of as2
1430 * 2. merge seg2's asns onto last segment of this new chain
1431 * 3. attach chain after seg2
1432 */
1433
1434 /* save as2 head */
1435 as2seghead = as2->segments;
1436
1437 /* dupe as1 onto as2's head */
1438 as2segtail = as2->segments = assegment_dup_all(as1->segments);
1439
1440 /* refind the tail of as2 */
1441 while (as2segtail && as2segtail->next)
1442 as2segtail = as2segtail->next;
1443
1444 /* merge the old head, seg2, into tail, seg1 */
1445 assegment_append_asns(as2segtail, as2seghead->as,
1446 as2seghead->length);
1447
1448 /*
1449 * bypass the merged seg2, and attach any chain after it
1450 * to chain descending from as2's head
1451 */
1452 if (as2segtail)
1453 as2segtail->next = as2seghead->next;
1454
1455 /* as2->segments is now referenceless and useless */
1456 assegment_free(as2seghead);
1457
1458 /* we've now prepended as1's segment chain to as2, merging
1459 * the inbetween AS_SEQUENCE of seg2 in the process
1460 */
1461 aspath_str_update(as2, false);
1462 return as2;
1463 } else {
1464 /* AS_SET merge code is needed at here. */
1465 return aspath_merge(as1, as2);
1466 }
1467 /* XXX: Ermmm, what if as1 has multiple segments?? */
1468
1469 /* Not reached */
1470 }
1471
1472 /* Iterate over AS_PATH segments and wipe all occurences of the
1473 * listed AS numbers. Hence some segments may lose some or even
1474 * all data on the way, the operation is implemented as a smarter
1475 * version of aspath_dup(), which allocates memory to hold the new
1476 * data, not the original. The new AS path is returned.
1477 */
1478 struct aspath *aspath_filter_exclude(struct aspath *source,
1479 struct aspath *exclude_list)
1480 {
1481 struct assegment *srcseg, *exclseg, *lastseg;
1482 struct aspath *newpath;
1483
1484 newpath = aspath_new();
1485 lastseg = NULL;
1486
1487 for (srcseg = source->segments; srcseg; srcseg = srcseg->next) {
1488 unsigned i, y, newlen = 0, done = 0, skip_as;
1489 struct assegment *newseg;
1490
1491 /* Find out, how much ASns are we going to pick from this
1492 * segment.
1493 * We can't perform filtering right inline, because the size of
1494 * the new segment isn't known at the moment yet.
1495 */
1496 for (i = 0; i < srcseg->length; i++) {
1497 skip_as = 0;
1498 for (exclseg = exclude_list->segments;
1499 exclseg && !skip_as; exclseg = exclseg->next)
1500 for (y = 0; y < exclseg->length; y++)
1501 if (srcseg->as[i] == exclseg->as[y]) {
1502 skip_as = 1;
1503 // There's no sense in testing
1504 // the rest of exclusion list,
1505 // bail out.
1506 break;
1507 }
1508 if (!skip_as)
1509 newlen++;
1510 }
1511 /* newlen is now the number of ASns to copy */
1512 if (!newlen)
1513 continue;
1514
1515 /* Actual copying. Allocate memory and iterate once more,
1516 * performing filtering. */
1517 newseg = assegment_new(srcseg->type, newlen);
1518 for (i = 0; i < srcseg->length; i++) {
1519 skip_as = 0;
1520 for (exclseg = exclude_list->segments;
1521 exclseg && !skip_as; exclseg = exclseg->next)
1522 for (y = 0; y < exclseg->length; y++)
1523 if (srcseg->as[i] == exclseg->as[y]) {
1524 skip_as = 1;
1525 break;
1526 }
1527 if (skip_as)
1528 continue;
1529 newseg->as[done++] = srcseg->as[i];
1530 }
1531 /* At his point newlen must be equal to done, and both must be
1532 * positive. Append
1533 * the filtered segment to the gross result. */
1534 if (!lastseg)
1535 newpath->segments = newseg;
1536 else
1537 lastseg->next = newseg;
1538 lastseg = newseg;
1539 }
1540 aspath_str_update(newpath, false);
1541 /* We are happy returning even an empty AS_PATH, because the
1542 * administrator
1543 * might expect this very behaviour. There's a mean to avoid this, if
1544 * necessary,
1545 * by having a match rule against certain AS_PATH regexps in the
1546 * route-map index.
1547 */
1548 aspath_free(source);
1549 return newpath;
1550 }
1551
1552 /* Add specified AS to the leftmost of aspath. */
1553 static struct aspath *aspath_add_asns(struct aspath *aspath, as_t asno,
1554 uint8_t type, unsigned num)
1555 {
1556 struct assegment *assegment = aspath->segments;
1557 unsigned i;
1558
1559 if (assegment && assegment->type == type) {
1560 /* extend existing segment */
1561 aspath->segments =
1562 assegment_prepend_asns(aspath->segments, asno, num);
1563 } else {
1564 /* prepend with new segment */
1565 struct assegment *newsegment = assegment_new(type, num);
1566 for (i = 0; i < num; i++)
1567 newsegment->as[i] = asno;
1568
1569 /* insert potentially replacing empty segment */
1570 if (assegment && assegment->length == 0) {
1571 newsegment->next = assegment->next;
1572 assegment_free(assegment);
1573 } else
1574 newsegment->next = assegment;
1575 aspath->segments = newsegment;
1576 }
1577
1578 aspath_str_update(aspath, false);
1579 return aspath;
1580 }
1581
1582 /* Add specified AS to the leftmost of aspath num times. */
1583 struct aspath *aspath_add_seq_n(struct aspath *aspath, as_t asno, unsigned num)
1584 {
1585 return aspath_add_asns(aspath, asno, AS_SEQUENCE, num);
1586 }
1587
1588 /* Add specified AS to the leftmost of aspath. */
1589 struct aspath *aspath_add_seq(struct aspath *aspath, as_t asno)
1590 {
1591 return aspath_add_asns(aspath, asno, AS_SEQUENCE, 1);
1592 }
1593
1594 /* Compare leftmost AS value for MED check. If as1's leftmost AS and
1595 as2's leftmost AS is same return 1. */
1596 int aspath_cmp_left(const struct aspath *aspath1, const struct aspath *aspath2)
1597 {
1598 const struct assegment *seg1;
1599 const struct assegment *seg2;
1600
1601 if (!(aspath1 && aspath2))
1602 return 0;
1603
1604 seg1 = aspath1->segments;
1605 seg2 = aspath2->segments;
1606
1607 /* If both paths are originated in this AS then we do want to compare
1608 * MED */
1609 if (!seg1 && !seg2)
1610 return 1;
1611
1612 /* find first non-confed segments for each */
1613 while (seg1 && ((seg1->type == AS_CONFED_SEQUENCE)
1614 || (seg1->type == AS_CONFED_SET)))
1615 seg1 = seg1->next;
1616
1617 while (seg2 && ((seg2->type == AS_CONFED_SEQUENCE)
1618 || (seg2->type == AS_CONFED_SET)))
1619 seg2 = seg2->next;
1620
1621 /* Check as1's */
1622 if (!(seg1 && seg2 && (seg1->type == AS_SEQUENCE)
1623 && (seg2->type == AS_SEQUENCE)))
1624 return 0;
1625
1626 if (seg1->as[0] == seg2->as[0])
1627 return 1;
1628
1629 return 0;
1630 }
1631
1632 /* Truncate an aspath after a number of hops, and put the hops remaining
1633 * at the front of another aspath. Needed for AS4 compat.
1634 *
1635 * Returned aspath is a /new/ aspath, which should either by free'd or
1636 * interned by the caller, as desired.
1637 */
1638 struct aspath *aspath_reconcile_as4(struct aspath *aspath,
1639 struct aspath *as4path)
1640 {
1641 struct assegment *seg, *newseg, *prevseg = NULL;
1642 struct aspath *newpath = NULL, *mergedpath;
1643 int hops, cpasns = 0;
1644
1645 if (!aspath || !as4path)
1646 return NULL;
1647
1648 seg = aspath->segments;
1649
1650 /* CONFEDs should get reconciled too.. */
1651 hops = (aspath_count_hops(aspath) + aspath_count_confeds(aspath))
1652 - aspath_count_hops(as4path);
1653
1654 if (hops < 0) {
1655 if (BGP_DEBUG(as4, AS4))
1656 flog_warn(
1657 EC_BGP_ASPATH_FEWER_HOPS,
1658 "[AS4] Fewer hops in AS_PATH than NEW_AS_PATH");
1659 /* Something's gone wrong. The RFC says we should now ignore
1660 * AS4_PATH,
1661 * which is daft behaviour - it contains vital loop-detection
1662 * information which must have been removed from AS_PATH.
1663 */
1664 hops = aspath_count_hops(aspath);
1665 }
1666
1667 if (!hops) {
1668 newpath = aspath_dup(as4path);
1669 aspath_str_update(newpath, false);
1670 return newpath;
1671 }
1672
1673 if (BGP_DEBUG(as4, AS4))
1674 zlog_debug(
1675 "[AS4] got AS_PATH %s and AS4_PATH %s synthesizing now",
1676 aspath->str, as4path->str);
1677
1678 while (seg && hops > 0) {
1679 switch (seg->type) {
1680 case AS_SET:
1681 case AS_CONFED_SET:
1682 hops--;
1683 cpasns = seg->length;
1684 break;
1685 case AS_CONFED_SEQUENCE:
1686 /* Should never split a confed-sequence, if hop-count
1687 * suggests we must then something's gone wrong
1688 * somewhere.
1689 *
1690 * Most important goal is to preserve AS_PATHs prime
1691 * function
1692 * as loop-detector, so we fudge the numbers so that the
1693 * entire
1694 * confed-sequence is merged in.
1695 */
1696 if (hops < seg->length) {
1697 if (BGP_DEBUG(as4, AS4))
1698 zlog_debug(
1699 "[AS4] AS4PATHmangle: AS_CONFED_SEQUENCE falls"
1700 " across 2/4 ASN boundary somewhere, broken..");
1701 hops = seg->length;
1702 }
1703 /* fallthru */
1704 case AS_SEQUENCE:
1705 cpasns = MIN(seg->length, hops);
1706 hops -= seg->length;
1707 }
1708
1709 assert(cpasns <= seg->length);
1710
1711 newseg = assegment_new(seg->type, 0);
1712 newseg = assegment_append_asns(newseg, seg->as, cpasns);
1713
1714 if (!newpath) {
1715 newpath = aspath_new();
1716 newpath->segments = newseg;
1717 } else
1718 prevseg->next = newseg;
1719
1720 prevseg = newseg;
1721 seg = seg->next;
1722 }
1723
1724 /* We may be able to join some segments here, and we must
1725 * do this because... we want normalised aspaths in out hash
1726 * and we do not want to stumble in aspath_put.
1727 */
1728 mergedpath = aspath_merge(newpath, aspath_dup(as4path));
1729 aspath_free(newpath);
1730 mergedpath->segments = assegment_normalise(mergedpath->segments);
1731 aspath_str_update(mergedpath, false);
1732
1733 if (BGP_DEBUG(as4, AS4))
1734 zlog_debug("[AS4] result of synthesizing is %s",
1735 mergedpath->str);
1736
1737 return mergedpath;
1738 }
1739
1740 /* Compare leftmost AS value for MED check. If as1's leftmost AS and
1741 as2's leftmost AS is same return 1. (confederation as-path
1742 only). */
1743 bool aspath_cmp_left_confed(const struct aspath *aspath1,
1744 const struct aspath *aspath2)
1745 {
1746 if (!(aspath1 && aspath2))
1747 return false;
1748
1749 if (!(aspath1->segments && aspath2->segments))
1750 return false;
1751
1752 if ((aspath1->segments->type != AS_CONFED_SEQUENCE)
1753 || (aspath2->segments->type != AS_CONFED_SEQUENCE))
1754 return false;
1755
1756 if (aspath1->segments->as[0] == aspath2->segments->as[0])
1757 return true;
1758
1759 return false;
1760 }
1761
1762 /* Delete all AS_CONFED_SEQUENCE/SET segments from aspath.
1763 * RFC 5065 section 4.1.c.1
1764 *
1765 * 1) if any path segments of the AS_PATH are of the type
1766 * AS_CONFED_SEQUENCE or AS_CONFED_SET, those segments MUST be
1767 * removed from the AS_PATH attribute, leaving the sanitized
1768 * AS_PATH attribute to be operated on by steps 2, 3 or 4.
1769 */
1770 struct aspath *aspath_delete_confed_seq(struct aspath *aspath)
1771 {
1772 struct assegment *seg, *prev, *next;
1773 char removed_confed_segment;
1774
1775 if (!(aspath && aspath->segments))
1776 return aspath;
1777
1778 seg = aspath->segments;
1779 removed_confed_segment = 0;
1780 next = NULL;
1781 prev = NULL;
1782
1783 while (seg) {
1784 next = seg->next;
1785
1786 if (seg->type == AS_CONFED_SEQUENCE
1787 || seg->type == AS_CONFED_SET) {
1788 /* This is the first segment in the aspath */
1789 if (aspath->segments == seg)
1790 aspath->segments = seg->next;
1791 else
1792 prev->next = seg->next;
1793
1794 assegment_free(seg);
1795 removed_confed_segment = 1;
1796 } else
1797 prev = seg;
1798
1799 seg = next;
1800 }
1801
1802 if (removed_confed_segment)
1803 aspath_str_update(aspath, false);
1804
1805 return aspath;
1806 }
1807
1808 /* Add new AS number to the leftmost part of the aspath as
1809 AS_CONFED_SEQUENCE. */
1810 struct aspath *aspath_add_confed_seq(struct aspath *aspath, as_t asno)
1811 {
1812 return aspath_add_asns(aspath, asno, AS_CONFED_SEQUENCE, 1);
1813 }
1814
1815 /* Add new as value to as path structure. */
1816 static void aspath_as_add(struct aspath *as, as_t asno)
1817 {
1818 struct assegment *seg = as->segments;
1819
1820 if (!seg)
1821 return;
1822
1823 /* Last segment search procedure. */
1824 while (seg->next)
1825 seg = seg->next;
1826
1827 assegment_append_asns(seg, &asno, 1);
1828 }
1829
1830 /* Add new as segment to the as path. */
1831 static void aspath_segment_add(struct aspath *as, int type)
1832 {
1833 struct assegment *seg = as->segments;
1834 struct assegment *new = assegment_new(type, 0);
1835
1836 if (seg) {
1837 while (seg->next)
1838 seg = seg->next;
1839 seg->next = new;
1840 } else
1841 as->segments = new;
1842 }
1843
1844 struct aspath *aspath_empty(void)
1845 {
1846 return aspath_parse(NULL, 0, 1); /* 32Bit ;-) */
1847 }
1848
1849 struct aspath *aspath_empty_get(void)
1850 {
1851 struct aspath *aspath;
1852
1853 aspath = aspath_new();
1854 aspath_make_str_count(aspath, false);
1855 return aspath;
1856 }
1857
1858 unsigned long aspath_count(void)
1859 {
1860 return ashash->count;
1861 }
1862
1863 /*
1864 Theoretically, one as path can have:
1865
1866 One BGP packet size should be less than 4096.
1867 One BGP attribute size should be less than 4096 - BGP header size.
1868 One BGP aspath size should be less than 4096 - BGP header size -
1869 BGP mandantry attribute size.
1870 */
1871
1872 /* AS path string lexical token enum. */
1873 enum as_token {
1874 as_token_asval,
1875 as_token_set_start,
1876 as_token_set_end,
1877 as_token_confed_seq_start,
1878 as_token_confed_seq_end,
1879 as_token_confed_set_start,
1880 as_token_confed_set_end,
1881 as_token_unknown
1882 };
1883
1884 /* Return next token and point for string parse. */
1885 static const char *aspath_gettoken(const char *buf, enum as_token *token,
1886 unsigned long *asno)
1887 {
1888 const char *p = buf;
1889
1890 /* Skip seperators (space for sequences, ',' for sets). */
1891 while (isspace((int)*p) || *p == ',')
1892 p++;
1893
1894 /* Check the end of the string and type specify characters
1895 (e.g. {}()). */
1896 switch (*p) {
1897 case '\0':
1898 return NULL;
1899 case '{':
1900 *token = as_token_set_start;
1901 p++;
1902 return p;
1903 case '}':
1904 *token = as_token_set_end;
1905 p++;
1906 return p;
1907 case '(':
1908 *token = as_token_confed_seq_start;
1909 p++;
1910 return p;
1911 case ')':
1912 *token = as_token_confed_seq_end;
1913 p++;
1914 return p;
1915 case '[':
1916 *token = as_token_confed_set_start;
1917 p++;
1918 return p;
1919 case ']':
1920 *token = as_token_confed_set_end;
1921 p++;
1922 return p;
1923 }
1924
1925 /* Check actual AS value. */
1926 if (isdigit((int)*p)) {
1927 as_t asval;
1928
1929 *token = as_token_asval;
1930 asval = (*p - '0');
1931 p++;
1932
1933 while (isdigit((int)*p)) {
1934 asval *= 10;
1935 asval += (*p - '0');
1936 p++;
1937 }
1938 *asno = asval;
1939 return p;
1940 }
1941
1942 /* There is no match then return unknown token. */
1943 *token = as_token_unknown;
1944 p++;
1945 return p;
1946 }
1947
1948 struct aspath *aspath_str2aspath(const char *str)
1949 {
1950 enum as_token token = as_token_unknown;
1951 unsigned short as_type;
1952 unsigned long asno = 0;
1953 struct aspath *aspath;
1954 int needtype;
1955
1956 aspath = aspath_new();
1957
1958 /* We start default type as AS_SEQUENCE. */
1959 as_type = AS_SEQUENCE;
1960 needtype = 1;
1961
1962 while ((str = aspath_gettoken(str, &token, &asno)) != NULL) {
1963 switch (token) {
1964 case as_token_asval:
1965 if (needtype) {
1966 aspath_segment_add(aspath, as_type);
1967 needtype = 0;
1968 }
1969 aspath_as_add(aspath, asno);
1970 break;
1971 case as_token_set_start:
1972 as_type = AS_SET;
1973 aspath_segment_add(aspath, as_type);
1974 needtype = 0;
1975 break;
1976 case as_token_set_end:
1977 as_type = AS_SEQUENCE;
1978 needtype = 1;
1979 break;
1980 case as_token_confed_seq_start:
1981 as_type = AS_CONFED_SEQUENCE;
1982 aspath_segment_add(aspath, as_type);
1983 needtype = 0;
1984 break;
1985 case as_token_confed_seq_end:
1986 as_type = AS_SEQUENCE;
1987 needtype = 1;
1988 break;
1989 case as_token_confed_set_start:
1990 as_type = AS_CONFED_SET;
1991 aspath_segment_add(aspath, as_type);
1992 needtype = 0;
1993 break;
1994 case as_token_confed_set_end:
1995 as_type = AS_SEQUENCE;
1996 needtype = 1;
1997 break;
1998 case as_token_unknown:
1999 default:
2000 aspath_free(aspath);
2001 return NULL;
2002 }
2003 }
2004
2005 aspath_make_str_count(aspath, false);
2006
2007 return aspath;
2008 }
2009
2010 /* Make hash value by raw aspath data. */
2011 unsigned int aspath_key_make(void *p)
2012 {
2013 struct aspath *aspath = (struct aspath *)p;
2014 unsigned int key = 0;
2015
2016 if (!aspath->str)
2017 aspath_str_update(aspath, false);
2018
2019 key = jhash(aspath->str, aspath->str_len, 2334325);
2020
2021 return key;
2022 }
2023
2024 /* If two aspath have same value then return 1 else return 0 */
2025 bool aspath_cmp(const void *arg1, const void *arg2)
2026 {
2027 const struct assegment *seg1 = ((const struct aspath *)arg1)->segments;
2028 const struct assegment *seg2 = ((const struct aspath *)arg2)->segments;
2029
2030 while (seg1 || seg2) {
2031 int i;
2032 if ((!seg1 && seg2) || (seg1 && !seg2))
2033 return false;
2034 if (seg1->type != seg2->type)
2035 return false;
2036 if (seg1->length != seg2->length)
2037 return false;
2038 for (i = 0; i < seg1->length; i++)
2039 if (seg1->as[i] != seg2->as[i])
2040 return false;
2041 seg1 = seg1->next;
2042 seg2 = seg2->next;
2043 }
2044 return true;
2045 }
2046
2047 /* AS path hash initialize. */
2048 void aspath_init(void)
2049 {
2050 ashash = hash_create_size(32768, aspath_key_make, aspath_cmp,
2051 "BGP AS Path");
2052 }
2053
2054 void aspath_finish(void)
2055 {
2056 hash_clean(ashash, (void (*)(void *))aspath_free);
2057 hash_free(ashash);
2058 ashash = NULL;
2059
2060 if (snmp_stream)
2061 stream_free(snmp_stream);
2062 }
2063
2064 /* return and as path value */
2065 const char *aspath_print(struct aspath *as)
2066 {
2067 return (as ? as->str : NULL);
2068 }
2069
2070 /* Printing functions */
2071 /* Feed the AS_PATH to the vty; the suffix string follows it only in case
2072 * AS_PATH wasn't empty.
2073 */
2074 void aspath_print_vty(struct vty *vty, const char *format, struct aspath *as,
2075 const char *suffix)
2076 {
2077 assert(format);
2078 vty_out(vty, format, as->str);
2079 if (as->str_len && strlen(suffix))
2080 vty_out(vty, "%s", suffix);
2081 }
2082
2083 static void aspath_show_all_iterator(struct hash_bucket *bucket,
2084 struct vty *vty)
2085 {
2086 struct aspath *as;
2087
2088 as = (struct aspath *)bucket->data;
2089
2090 vty_out(vty, "[%p:%u] (%ld) ", (void *)bucket, bucket->key, as->refcnt);
2091 vty_out(vty, "%s\n", as->str);
2092 }
2093
2094 /* Print all aspath and hash information. This function is used from
2095 `show [ip] bgp paths' command. */
2096 void aspath_print_all_vty(struct vty *vty)
2097 {
2098 hash_iterate(ashash, (void (*)(struct hash_bucket *,
2099 void *))aspath_show_all_iterator,
2100 vty);
2101 }
2102
2103 static struct aspath *bgp_aggr_aspath_lookup(struct bgp_aggregate *aggregate,
2104 struct aspath *aspath)
2105 {
2106 return hash_lookup(aggregate->aspath_hash, aspath);
2107 }
2108
2109 static void *bgp_aggr_aspath_hash_alloc(void *p)
2110 {
2111 struct aspath *ref = (struct aspath *)p;
2112 struct aspath *aspath = NULL;
2113
2114 aspath = aspath_dup(ref);
2115 return aspath;
2116 }
2117
2118 static void bgp_aggr_aspath_prepare(struct hash_backet *hb, void *arg)
2119 {
2120 struct aspath *asmerge = NULL;
2121 struct aspath *hb_aspath = hb->data;
2122 struct aspath **aggr_aspath = arg;
2123
2124 if (*aggr_aspath) {
2125 asmerge = aspath_aggregate(*aggr_aspath, hb_aspath);
2126 aspath_free(*aggr_aspath);
2127 *aggr_aspath = asmerge;
2128 } else
2129 *aggr_aspath = aspath_dup(hb_aspath);
2130 }
2131
2132 void bgp_aggr_aspath_remove(void *arg)
2133 {
2134 struct aspath *aspath = arg;
2135
2136 aspath_free(aspath);
2137 }
2138
2139 void bgp_compute_aggregate_aspath(struct bgp_aggregate *aggregate,
2140 struct aspath *aspath)
2141 {
2142 struct aspath *aggr_aspath = NULL;
2143
2144 if ((aggregate == NULL) || (aspath == NULL))
2145 return;
2146
2147 /* Create hash if not already created.
2148 */
2149 if (aggregate->aspath_hash == NULL)
2150 aggregate->aspath_hash = hash_create(
2151 aspath_key_make, aspath_cmp,
2152 "BGP Aggregator as-path hash");
2153
2154 aggr_aspath = bgp_aggr_aspath_lookup(aggregate, aspath);
2155 if (aggr_aspath == NULL) {
2156 /* Insert as-path into hash.
2157 */
2158 aggr_aspath = hash_get(aggregate->aspath_hash, aspath,
2159 bgp_aggr_aspath_hash_alloc);
2160
2161 /* Compute aggregate's as-path.
2162 */
2163 hash_iterate(aggregate->aspath_hash,
2164 bgp_aggr_aspath_prepare,
2165 &aggregate->aspath);
2166 }
2167
2168 /* Increment refernce counter.
2169 */
2170 aggr_aspath->refcnt++;
2171 }
2172
2173 void bgp_remove_aspath_from_aggregate(struct bgp_aggregate *aggregate,
2174 struct aspath *aspath)
2175 {
2176 struct aspath *aggr_aspath = NULL;
2177 struct aspath *ret_aspath = NULL;
2178
2179 if ((aggregate == NULL) || (aspath == NULL))
2180 return;
2181
2182 if (aggregate->aspath_hash == NULL)
2183 return;
2184
2185 /* Look-up the aspath in the hash.
2186 */
2187 aggr_aspath = bgp_aggr_aspath_lookup(aggregate, aspath);
2188 if (aggr_aspath) {
2189 aggr_aspath->refcnt--;
2190
2191 if (aggr_aspath->refcnt == 0) {
2192 ret_aspath = hash_release(aggregate->aspath_hash,
2193 aggr_aspath);
2194 aspath_free(ret_aspath);
2195
2196 /* Remove aggregate's old as-path.
2197 */
2198 aspath_free(aggregate->aspath);
2199 aggregate->aspath = NULL;
2200
2201 /* Compute aggregate's as-path.
2202 */
2203 hash_iterate(aggregate->aspath_hash,
2204 bgp_aggr_aspath_prepare,
2205 &aggregate->aspath);
2206 }
2207 }
2208 }