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