]> git.proxmox.com Git - mirror_frr.git/blob - bgpd/bgp_aspath.c
Merge pull request #10008 from qlyoung/update-process-docs
[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 static struct assegment *aspath_aggregate_as_set_add(struct aspath *aspath,
1006 struct assegment *asset,
1007 as_t as)
1008 {
1009 int i;
1010
1011 /* If this is first AS set member, create new as-set segment. */
1012 if (asset == NULL) {
1013 asset = assegment_new(AS_SET, 1);
1014 if (!aspath->segments)
1015 aspath->segments = asset;
1016 else {
1017 struct assegment *seg = aspath->segments;
1018 while (seg->next)
1019 seg = seg->next;
1020 seg->next = asset;
1021 }
1022 asset->type = AS_SET;
1023 asset->length = 1;
1024 asset->as[0] = as;
1025 } else {
1026 /* Check this AS value already exists or not. */
1027 for (i = 0; i < asset->length; i++)
1028 if (asset->as[i] == as)
1029 return asset;
1030
1031 asset->length++;
1032 asset->as = XREALLOC(MTYPE_AS_SEG_DATA, asset->as,
1033 asset->length * AS_VALUE_SIZE);
1034 asset->as[asset->length - 1] = as;
1035 }
1036
1037
1038 return asset;
1039 }
1040
1041 /* Modify as1 using as2 for aggregation. */
1042 struct aspath *aspath_aggregate(struct aspath *as1, struct aspath *as2)
1043 {
1044 int i;
1045 int minlen = 0;
1046 int match = 0;
1047 int from;
1048 struct assegment *seg1 = as1->segments;
1049 struct assegment *seg2 = as2->segments;
1050 struct aspath *aspath = NULL;
1051 struct assegment *asset = NULL;
1052 struct assegment *prevseg = NULL;
1053
1054 /* First of all check common leading sequence. */
1055 while (seg1 && seg2) {
1056 /* Check segment type. */
1057 if (seg1->type != seg2->type)
1058 break;
1059
1060 /* Minimum segment length. */
1061 minlen = MIN(seg1->length, seg2->length);
1062
1063 for (match = 0; match < minlen; match++)
1064 if (seg1->as[match] != seg2->as[match])
1065 break;
1066
1067 if (match) {
1068 struct assegment *seg = assegment_new(seg1->type, 0);
1069
1070 seg = assegment_append_asns(seg, seg1->as, match);
1071
1072 if (!aspath) {
1073 aspath = aspath_new();
1074 aspath->segments = seg;
1075 } else
1076 prevseg->next = seg;
1077
1078 prevseg = seg;
1079 }
1080
1081 if (match != minlen || match != seg1->length
1082 || seg1->length != seg2->length)
1083 break;
1084 /* We are moving on to the next segment to reset match */
1085 else
1086 match = 0;
1087
1088 seg1 = seg1->next;
1089 seg2 = seg2->next;
1090 }
1091
1092 if (!aspath)
1093 aspath = aspath_new();
1094
1095 /* Make as-set using rest of all information. */
1096 from = match;
1097 while (seg1) {
1098 for (i = from; i < seg1->length; i++)
1099 asset = aspath_aggregate_as_set_add(aspath, asset,
1100 seg1->as[i]);
1101
1102 from = 0;
1103 seg1 = seg1->next;
1104 }
1105
1106 from = match;
1107 while (seg2) {
1108 for (i = from; i < seg2->length; i++)
1109 asset = aspath_aggregate_as_set_add(aspath, asset,
1110 seg2->as[i]);
1111
1112 from = 0;
1113 seg2 = seg2->next;
1114 }
1115
1116 assegment_normalise(aspath->segments);
1117 aspath_str_update(aspath, false);
1118 return aspath;
1119 }
1120
1121 /* When a BGP router receives an UPDATE with an MP_REACH_NLRI
1122 attribute, check the leftmost AS number in the AS_PATH attribute is
1123 or not the peer's AS number. */
1124 bool aspath_firstas_check(struct aspath *aspath, as_t asno)
1125 {
1126 if ((aspath == NULL) || (aspath->segments == NULL))
1127 return false;
1128
1129 if (aspath->segments && (aspath->segments->type == AS_SEQUENCE)
1130 && (aspath->segments->as[0] == asno))
1131 return true;
1132
1133 return false;
1134 }
1135
1136 unsigned int aspath_get_first_as(struct aspath *aspath)
1137 {
1138 if (aspath == NULL || aspath->segments == NULL)
1139 return 0;
1140
1141 return aspath->segments->as[0];
1142 }
1143
1144 unsigned int aspath_get_last_as(struct aspath *aspath)
1145 {
1146 int i;
1147 unsigned int last_as = 0;
1148 const struct assegment *seg;
1149
1150 if (aspath == NULL || aspath->segments == NULL)
1151 return last_as;
1152
1153 seg = aspath->segments;
1154
1155 while (seg) {
1156 if (seg->type == AS_SEQUENCE || seg->type == AS_CONFED_SEQUENCE)
1157 for (i = 0; i < seg->length; i++)
1158 last_as = seg->as[i];
1159 seg = seg->next;
1160 }
1161
1162 return last_as;
1163 }
1164
1165 /* AS path loop check. If aspath contains asno then return >= 1. */
1166 int aspath_loop_check(struct aspath *aspath, as_t asno)
1167 {
1168 struct assegment *seg;
1169 int count = 0;
1170
1171 if ((aspath == NULL) || (aspath->segments == NULL))
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 (seg->as[i] == asno)
1181 count++;
1182
1183 seg = seg->next;
1184 }
1185 return count;
1186 }
1187
1188 /* When all of AS path is private AS return 1. */
1189 bool aspath_private_as_check(struct aspath *aspath)
1190 {
1191 struct assegment *seg;
1192
1193 if (!(aspath && aspath->segments))
1194 return false;
1195
1196 seg = aspath->segments;
1197
1198 while (seg) {
1199 int i;
1200
1201 for (i = 0; i < seg->length; i++) {
1202 if (!BGP_AS_IS_PRIVATE(seg->as[i]))
1203 return false;
1204 }
1205 seg = seg->next;
1206 }
1207 return true;
1208 }
1209
1210 /* Return True if the entire ASPATH consist of the specified ASN */
1211 bool aspath_single_asn_check(struct aspath *aspath, as_t asn)
1212 {
1213 struct assegment *seg;
1214
1215 if (!(aspath && aspath->segments))
1216 return false;
1217
1218 seg = aspath->segments;
1219
1220 while (seg) {
1221 int i;
1222
1223 for (i = 0; i < seg->length; i++) {
1224 if (seg->as[i] != asn)
1225 return false;
1226 }
1227 seg = seg->next;
1228 }
1229 return true;
1230 }
1231
1232 /* Replace all instances of the target ASN with our own ASN */
1233 struct aspath *aspath_replace_specific_asn(struct aspath *aspath,
1234 as_t target_asn, as_t our_asn)
1235 {
1236 struct aspath *new;
1237 struct assegment *seg;
1238
1239 new = aspath_dup(aspath);
1240 seg = new->segments;
1241
1242 while (seg) {
1243 int i;
1244
1245 for (i = 0; i < seg->length; i++) {
1246 if (seg->as[i] == target_asn)
1247 seg->as[i] = our_asn;
1248 }
1249 seg = seg->next;
1250 }
1251
1252 aspath_str_update(new, false);
1253 return new;
1254 }
1255
1256 /* Replace all private ASNs with our own ASN */
1257 struct aspath *aspath_replace_private_asns(struct aspath *aspath, as_t asn,
1258 as_t peer_asn)
1259 {
1260 struct aspath *new;
1261 struct assegment *seg;
1262
1263 new = aspath_dup(aspath);
1264 seg = new->segments;
1265
1266 while (seg) {
1267 int i;
1268
1269 for (i = 0; i < seg->length; i++) {
1270 /* Don't replace if public ASN or peer's ASN */
1271 if (BGP_AS_IS_PRIVATE(seg->as[i])
1272 && (seg->as[i] != peer_asn))
1273 seg->as[i] = asn;
1274 }
1275 seg = seg->next;
1276 }
1277
1278 aspath_str_update(new, false);
1279 return new;
1280 }
1281
1282 /* Remove all private ASNs */
1283 struct aspath *aspath_remove_private_asns(struct aspath *aspath, as_t peer_asn)
1284 {
1285 struct aspath *new;
1286 struct assegment *seg;
1287 struct assegment *new_seg;
1288 struct assegment *last_new_seg;
1289 int i;
1290 int j;
1291 int public = 0;
1292
1293 new = XCALLOC(MTYPE_AS_PATH, sizeof(struct aspath));
1294
1295 new->json = NULL;
1296 new_seg = NULL;
1297 last_new_seg = NULL;
1298 seg = aspath->segments;
1299 while (seg) {
1300 public
1301 = 0;
1302 for (i = 0; i < seg->length; i++) {
1303 // ASN is public
1304 if (!BGP_AS_IS_PRIVATE(seg->as[i])) {
1305 public
1306 ++;
1307 }
1308 }
1309
1310 // The entire segment is public so copy it
1311 if (public == seg->length)
1312 new_seg = assegment_dup(seg);
1313
1314 // The segment is a mix of public and private ASNs. Copy as many
1315 // spots as
1316 // there are public ASNs then come back and fill in only the
1317 // public ASNs.
1318 else {
1319 new_seg = assegment_new(seg->type, public);
1320 j = 0;
1321 for (i = 0; i < seg->length; i++) {
1322 // keep ASN if public or matches peer's ASN
1323 if (!BGP_AS_IS_PRIVATE(seg->as[i])
1324 || (seg->as[i] == peer_asn)) {
1325 new_seg->as[j] = seg->as[i];
1326 j++;
1327 }
1328 }
1329 }
1330
1331 // This is the first segment so set the aspath segments pointer
1332 // to this one
1333 if (!last_new_seg)
1334 new->segments = new_seg;
1335 else
1336 last_new_seg->next = new_seg;
1337
1338 last_new_seg = new_seg;
1339 seg = seg->next;
1340 }
1341
1342 aspath_str_update(new, false);
1343 return new;
1344 }
1345
1346 /* AS path confed check. If aspath contains confed set or sequence then return
1347 * 1. */
1348 bool aspath_confed_check(struct aspath *aspath)
1349 {
1350 struct assegment *seg;
1351
1352 if (!(aspath && aspath->segments))
1353 return false;
1354
1355 seg = aspath->segments;
1356
1357 while (seg) {
1358 if (seg->type == AS_CONFED_SET
1359 || seg->type == AS_CONFED_SEQUENCE)
1360 return true;
1361 seg = seg->next;
1362 }
1363 return false;
1364 }
1365
1366 /* Leftmost AS path segment confed check. If leftmost AS segment is of type
1367 AS_CONFED_SEQUENCE or AS_CONFED_SET then return 1. */
1368 bool aspath_left_confed_check(struct aspath *aspath)
1369 {
1370
1371 if (!(aspath && aspath->segments))
1372 return false;
1373
1374 if ((aspath->segments->type == AS_CONFED_SEQUENCE)
1375 || (aspath->segments->type == AS_CONFED_SET))
1376 return true;
1377
1378 return false;
1379 }
1380
1381 /* Merge as1 to as2. as2 should be uninterned aspath. */
1382 static struct aspath *aspath_merge(struct aspath *as1, struct aspath *as2)
1383 {
1384 struct assegment *last, *new;
1385
1386 if (!as1 || !as2)
1387 return NULL;
1388
1389 last = new = assegment_dup_all(as1->segments);
1390
1391 /* find the last valid segment */
1392 while (last && last->next)
1393 last = last->next;
1394
1395 if (last)
1396 last->next = as2->segments;
1397 as2->segments = new;
1398 aspath_str_update(as2, false);
1399 return as2;
1400 }
1401
1402 /* Prepend as1 to as2. as2 should be uninterned aspath. */
1403 struct aspath *aspath_prepend(struct aspath *as1, struct aspath *as2)
1404 {
1405 struct assegment *as1segtail;
1406 struct assegment *as2segtail;
1407 struct assegment *as2seghead;
1408
1409 if (!as1 || !as2)
1410 return NULL;
1411
1412 /* If as2 is empty, only need to dupe as1's chain onto as2 */
1413 if (as2->segments == NULL) {
1414 as2->segments = assegment_dup_all(as1->segments);
1415 aspath_str_update(as2, false);
1416 return as2;
1417 }
1418
1419 /* If as1 is empty AS, no prepending to do. */
1420 if (as1->segments == NULL)
1421 return as2;
1422
1423 /* find the tail as1's segment chain. */
1424 as1segtail = as1->segments;
1425 while (as1segtail && as1segtail->next)
1426 as1segtail = as1segtail->next;
1427
1428 /* Delete any AS_CONFED_SEQUENCE segment from as2. */
1429 if (as1segtail->type == AS_SEQUENCE
1430 && as2->segments->type == AS_CONFED_SEQUENCE)
1431 as2 = aspath_delete_confed_seq(as2);
1432
1433 if (!as2->segments) {
1434 as2->segments = assegment_dup_all(as1->segments);
1435 aspath_str_update(as2, false);
1436 return as2;
1437 }
1438
1439 /* Compare last segment type of as1 and first segment type of as2. */
1440 if (as1segtail->type != as2->segments->type)
1441 return aspath_merge(as1, as2);
1442
1443 if (as1segtail->type == AS_SEQUENCE) {
1444 /* We have two chains of segments, as1->segments and seg2,
1445 * and we have to attach them together, merging the attaching
1446 * segments together into one.
1447 *
1448 * 1. dupe as1->segments onto head of as2
1449 * 2. merge seg2's asns onto last segment of this new chain
1450 * 3. attach chain after seg2
1451 */
1452
1453 /* save as2 head */
1454 as2seghead = as2->segments;
1455
1456 /* dupe as1 onto as2's head */
1457 as2segtail = as2->segments = assegment_dup_all(as1->segments);
1458
1459 /* refind the tail of as2 */
1460 while (as2segtail && as2segtail->next)
1461 as2segtail = as2segtail->next;
1462
1463 /* merge the old head, seg2, into tail, seg1 */
1464 assegment_append_asns(as2segtail, as2seghead->as,
1465 as2seghead->length);
1466
1467 /*
1468 * bypass the merged seg2, and attach any chain after it
1469 * to chain descending from as2's head
1470 */
1471 if (as2segtail)
1472 as2segtail->next = as2seghead->next;
1473
1474 /* as2->segments is now referenceless and useless */
1475 assegment_free(as2seghead);
1476
1477 /* we've now prepended as1's segment chain to as2, merging
1478 * the inbetween AS_SEQUENCE of seg2 in the process
1479 */
1480 aspath_str_update(as2, false);
1481 return as2;
1482 } else {
1483 /* AS_SET merge code is needed at here. */
1484 return aspath_merge(as1, as2);
1485 }
1486 /* XXX: Ermmm, what if as1 has multiple segments?? */
1487
1488 /* Not reached */
1489 }
1490
1491 /* Iterate over AS_PATH segments and wipe all occurrences of the
1492 * listed AS numbers. Hence some segments may lose some or even
1493 * all data on the way, the operation is implemented as a smarter
1494 * version of aspath_dup(), which allocates memory to hold the new
1495 * data, not the original. The new AS path is returned.
1496 */
1497 struct aspath *aspath_filter_exclude(struct aspath *source,
1498 struct aspath *exclude_list)
1499 {
1500 struct assegment *srcseg, *exclseg, *lastseg;
1501 struct aspath *newpath;
1502
1503 newpath = aspath_new();
1504 lastseg = NULL;
1505
1506 for (srcseg = source->segments; srcseg; srcseg = srcseg->next) {
1507 unsigned i, y, newlen = 0, done = 0, skip_as;
1508 struct assegment *newseg;
1509
1510 /* Find out, how much ASns are we going to pick from this
1511 * segment.
1512 * We can't perform filtering right inline, because the size of
1513 * the new segment isn't known at the moment yet.
1514 */
1515 for (i = 0; i < srcseg->length; i++) {
1516 skip_as = 0;
1517 for (exclseg = exclude_list->segments;
1518 exclseg && !skip_as; exclseg = exclseg->next)
1519 for (y = 0; y < exclseg->length; y++)
1520 if (srcseg->as[i] == exclseg->as[y]) {
1521 skip_as = 1;
1522 // There's no sense in testing
1523 // the rest of exclusion list,
1524 // bail out.
1525 break;
1526 }
1527 if (!skip_as)
1528 newlen++;
1529 }
1530 /* newlen is now the number of ASns to copy */
1531 if (!newlen)
1532 continue;
1533
1534 /* Actual copying. Allocate memory and iterate once more,
1535 * performing filtering. */
1536 newseg = assegment_new(srcseg->type, newlen);
1537 for (i = 0; i < srcseg->length; i++) {
1538 skip_as = 0;
1539 for (exclseg = exclude_list->segments;
1540 exclseg && !skip_as; exclseg = exclseg->next)
1541 for (y = 0; y < exclseg->length; y++)
1542 if (srcseg->as[i] == exclseg->as[y]) {
1543 skip_as = 1;
1544 break;
1545 }
1546 if (skip_as)
1547 continue;
1548 newseg->as[done++] = srcseg->as[i];
1549 }
1550 /* At his point newlen must be equal to done, and both must be
1551 * positive. Append
1552 * the filtered segment to the gross result. */
1553 if (!lastseg)
1554 newpath->segments = newseg;
1555 else
1556 lastseg->next = newseg;
1557 lastseg = newseg;
1558 }
1559 aspath_str_update(newpath, false);
1560 /* We are happy returning even an empty AS_PATH, because the
1561 * administrator
1562 * might expect this very behaviour. There's a mean to avoid this, if
1563 * necessary,
1564 * by having a match rule against certain AS_PATH regexps in the
1565 * route-map index.
1566 */
1567 aspath_free(source);
1568 return newpath;
1569 }
1570
1571 /* Add specified AS to the leftmost of aspath. */
1572 static struct aspath *aspath_add_asns(struct aspath *aspath, as_t asno,
1573 uint8_t type, unsigned num)
1574 {
1575 struct assegment *assegment = aspath->segments;
1576 unsigned i;
1577
1578 if (assegment && assegment->type == type) {
1579 /* extend existing segment */
1580 aspath->segments =
1581 assegment_prepend_asns(aspath->segments, asno, num);
1582 } else {
1583 /* prepend with new segment */
1584 struct assegment *newsegment = assegment_new(type, num);
1585 for (i = 0; i < num; i++)
1586 newsegment->as[i] = asno;
1587
1588 /* insert potentially replacing empty segment */
1589 if (assegment && assegment->length == 0) {
1590 newsegment->next = assegment->next;
1591 assegment_free(assegment);
1592 } else
1593 newsegment->next = assegment;
1594 aspath->segments = newsegment;
1595 }
1596
1597 aspath_str_update(aspath, false);
1598 return aspath;
1599 }
1600
1601 /* Add specified AS to the leftmost of aspath num times. */
1602 struct aspath *aspath_add_seq_n(struct aspath *aspath, as_t asno, unsigned num)
1603 {
1604 return aspath_add_asns(aspath, asno, AS_SEQUENCE, num);
1605 }
1606
1607 /* Add specified AS to the leftmost of aspath. */
1608 struct aspath *aspath_add_seq(struct aspath *aspath, as_t asno)
1609 {
1610 return aspath_add_asns(aspath, asno, AS_SEQUENCE, 1);
1611 }
1612
1613 /* Compare leftmost AS value for MED check. If as1's leftmost AS and
1614 as2's leftmost AS is same return 1. */
1615 bool aspath_cmp_left(const struct aspath *aspath1, const struct aspath *aspath2)
1616 {
1617 const struct assegment *seg1;
1618 const struct assegment *seg2;
1619
1620 if (!(aspath1 && aspath2))
1621 return false;
1622
1623 seg1 = aspath1->segments;
1624 seg2 = aspath2->segments;
1625
1626 /* If both paths are originated in this AS then we do want to compare
1627 * MED */
1628 if (!seg1 && !seg2)
1629 return true;
1630
1631 /* find first non-confed segments for each */
1632 while (seg1 && ((seg1->type == AS_CONFED_SEQUENCE)
1633 || (seg1->type == AS_CONFED_SET)))
1634 seg1 = seg1->next;
1635
1636 while (seg2 && ((seg2->type == AS_CONFED_SEQUENCE)
1637 || (seg2->type == AS_CONFED_SET)))
1638 seg2 = seg2->next;
1639
1640 /* Check as1's */
1641 if (!(seg1 && seg2 && (seg1->type == AS_SEQUENCE)
1642 && (seg2->type == AS_SEQUENCE)))
1643 return false;
1644
1645 if (seg1->as[0] == seg2->as[0])
1646 return true;
1647
1648 return false;
1649 }
1650
1651 /* Truncate an aspath after a number of hops, and put the hops remaining
1652 * at the front of another aspath. Needed for AS4 compat.
1653 *
1654 * Returned aspath is a /new/ aspath, which should either by free'd or
1655 * interned by the caller, as desired.
1656 */
1657 struct aspath *aspath_reconcile_as4(struct aspath *aspath,
1658 struct aspath *as4path)
1659 {
1660 struct assegment *seg, *newseg, *prevseg = NULL;
1661 struct aspath *newpath = NULL, *mergedpath;
1662 int hops, cpasns = 0;
1663
1664 if (!aspath || !as4path)
1665 return NULL;
1666
1667 seg = aspath->segments;
1668
1669 /* CONFEDs should get reconciled too.. */
1670 hops = (aspath_count_hops(aspath) + aspath_count_confeds(aspath))
1671 - aspath_count_hops(as4path);
1672
1673 if (hops < 0) {
1674 if (BGP_DEBUG(as4, AS4))
1675 flog_warn(
1676 EC_BGP_ASPATH_FEWER_HOPS,
1677 "[AS4] Fewer hops in AS_PATH than NEW_AS_PATH");
1678 /* Something's gone wrong. The RFC says we should now ignore
1679 * AS4_PATH,
1680 * which is daft behaviour - it contains vital loop-detection
1681 * information which must have been removed from AS_PATH.
1682 */
1683 hops = aspath_count_hops(aspath);
1684 }
1685
1686 if (!hops) {
1687 newpath = aspath_dup(as4path);
1688 aspath_str_update(newpath, false);
1689 return newpath;
1690 }
1691
1692 if (BGP_DEBUG(as4, AS4))
1693 zlog_debug(
1694 "[AS4] got AS_PATH %s and AS4_PATH %s synthesizing now",
1695 aspath->str, as4path->str);
1696
1697 while (seg && hops > 0) {
1698 switch (seg->type) {
1699 case AS_SET:
1700 case AS_CONFED_SET:
1701 hops--;
1702 cpasns = seg->length;
1703 break;
1704 case AS_CONFED_SEQUENCE:
1705 /* Should never split a confed-sequence, if hop-count
1706 * suggests we must then something's gone wrong
1707 * somewhere.
1708 *
1709 * Most important goal is to preserve AS_PATHs prime
1710 * function
1711 * as loop-detector, so we fudge the numbers so that the
1712 * entire
1713 * confed-sequence is merged in.
1714 */
1715 if (hops < seg->length) {
1716 if (BGP_DEBUG(as4, AS4))
1717 zlog_debug(
1718 "[AS4] AS4PATHmangle: AS_CONFED_SEQUENCE falls across 2/4 ASN boundary somewhere, broken..");
1719 hops = seg->length;
1720 }
1721 /* fallthru */
1722 case AS_SEQUENCE:
1723 cpasns = MIN(seg->length, hops);
1724 hops -= seg->length;
1725 }
1726
1727 assert(cpasns <= seg->length);
1728
1729 newseg = assegment_new(seg->type, 0);
1730 newseg = assegment_append_asns(newseg, seg->as, cpasns);
1731
1732 if (!newpath) {
1733 newpath = aspath_new();
1734 newpath->segments = newseg;
1735 } else
1736 prevseg->next = newseg;
1737
1738 prevseg = newseg;
1739 seg = seg->next;
1740 }
1741
1742 /* We may be able to join some segments here, and we must
1743 * do this because... we want normalised aspaths in out hash
1744 * and we do not want to stumble in aspath_put.
1745 */
1746 mergedpath = aspath_merge(newpath, aspath_dup(as4path));
1747 aspath_free(newpath);
1748 mergedpath->segments = assegment_normalise(mergedpath->segments);
1749 aspath_str_update(mergedpath, false);
1750
1751 if (BGP_DEBUG(as4, AS4))
1752 zlog_debug("[AS4] result of synthesizing is %s",
1753 mergedpath->str);
1754
1755 return mergedpath;
1756 }
1757
1758 /* Compare leftmost AS value for MED check. If as1's leftmost AS and
1759 as2's leftmost AS is same return 1. (confederation as-path
1760 only). */
1761 bool aspath_cmp_left_confed(const struct aspath *aspath1,
1762 const struct aspath *aspath2)
1763 {
1764 if (!(aspath1 && aspath2))
1765 return false;
1766
1767 if (!(aspath1->segments && aspath2->segments))
1768 return false;
1769
1770 if ((aspath1->segments->type != AS_CONFED_SEQUENCE)
1771 || (aspath2->segments->type != AS_CONFED_SEQUENCE))
1772 return false;
1773
1774 if (aspath1->segments->as[0] == aspath2->segments->as[0])
1775 return true;
1776
1777 return false;
1778 }
1779
1780 /* Delete all AS_CONFED_SEQUENCE/SET segments from aspath.
1781 * RFC 5065 section 4.1.c.1
1782 *
1783 * 1) if any path segments of the AS_PATH are of the type
1784 * AS_CONFED_SEQUENCE or AS_CONFED_SET, those segments MUST be
1785 * removed from the AS_PATH attribute, leaving the sanitized
1786 * AS_PATH attribute to be operated on by steps 2, 3 or 4.
1787 */
1788 struct aspath *aspath_delete_confed_seq(struct aspath *aspath)
1789 {
1790 struct assegment *seg, *prev, *next;
1791 char removed_confed_segment;
1792
1793 if (!(aspath && aspath->segments))
1794 return aspath;
1795
1796 seg = aspath->segments;
1797 removed_confed_segment = 0;
1798 next = NULL;
1799 prev = NULL;
1800
1801 while (seg) {
1802 next = seg->next;
1803
1804 if (seg->type == AS_CONFED_SEQUENCE
1805 || seg->type == AS_CONFED_SET) {
1806 /* This is the first segment in the aspath */
1807 if (aspath->segments == seg)
1808 aspath->segments = seg->next;
1809 else
1810 prev->next = seg->next;
1811
1812 assegment_free(seg);
1813 removed_confed_segment = 1;
1814 } else
1815 prev = seg;
1816
1817 seg = next;
1818 }
1819
1820 if (removed_confed_segment)
1821 aspath_str_update(aspath, false);
1822
1823 return aspath;
1824 }
1825
1826 /* Add new AS number to the leftmost part of the aspath as
1827 AS_CONFED_SEQUENCE. */
1828 struct aspath *aspath_add_confed_seq(struct aspath *aspath, as_t asno)
1829 {
1830 return aspath_add_asns(aspath, asno, AS_CONFED_SEQUENCE, 1);
1831 }
1832
1833 /* Add new as value to as path structure. */
1834 static void aspath_as_add(struct aspath *as, as_t asno)
1835 {
1836 struct assegment *seg = as->segments;
1837
1838 if (!seg)
1839 return;
1840
1841 /* Last segment search procedure. */
1842 while (seg->next)
1843 seg = seg->next;
1844
1845 assegment_append_asns(seg, &asno, 1);
1846 }
1847
1848 /* Add new as segment to the as path. */
1849 static void aspath_segment_add(struct aspath *as, int type)
1850 {
1851 struct assegment *seg = as->segments;
1852 struct assegment *new = assegment_new(type, 0);
1853
1854 if (seg) {
1855 while (seg->next)
1856 seg = seg->next;
1857 seg->next = new;
1858 } else
1859 as->segments = new;
1860 }
1861
1862 struct aspath *aspath_empty(void)
1863 {
1864 return aspath_parse(NULL, 0, 1); /* 32Bit ;-) */
1865 }
1866
1867 struct aspath *aspath_empty_get(void)
1868 {
1869 struct aspath *aspath;
1870
1871 aspath = aspath_new();
1872 aspath_make_str_count(aspath, false);
1873 return aspath;
1874 }
1875
1876 unsigned long aspath_count(void)
1877 {
1878 return ashash->count;
1879 }
1880
1881 /*
1882 Theoretically, one as path can have:
1883
1884 One BGP packet size should be less than 4096.
1885 One BGP attribute size should be less than 4096 - BGP header size.
1886 One BGP aspath size should be less than 4096 - BGP header size -
1887 BGP mandantry attribute size.
1888 */
1889
1890 /* AS path string lexical token enum. */
1891 enum as_token {
1892 as_token_asval,
1893 as_token_set_start,
1894 as_token_set_end,
1895 as_token_confed_seq_start,
1896 as_token_confed_seq_end,
1897 as_token_confed_set_start,
1898 as_token_confed_set_end,
1899 as_token_unknown
1900 };
1901
1902 /* Return next token and point for string parse. */
1903 static const char *aspath_gettoken(const char *buf, enum as_token *token,
1904 unsigned long *asno)
1905 {
1906 const char *p = buf;
1907
1908 /* Skip seperators (space for sequences, ',' for sets). */
1909 while (isspace((unsigned char)*p) || *p == ',')
1910 p++;
1911
1912 /* Check the end of the string and type specify characters
1913 (e.g. {}()). */
1914 switch (*p) {
1915 case '\0':
1916 return NULL;
1917 case '{':
1918 *token = as_token_set_start;
1919 p++;
1920 return p;
1921 case '}':
1922 *token = as_token_set_end;
1923 p++;
1924 return p;
1925 case '(':
1926 *token = as_token_confed_seq_start;
1927 p++;
1928 return p;
1929 case ')':
1930 *token = as_token_confed_seq_end;
1931 p++;
1932 return p;
1933 case '[':
1934 *token = as_token_confed_set_start;
1935 p++;
1936 return p;
1937 case ']':
1938 *token = as_token_confed_set_end;
1939 p++;
1940 return p;
1941 }
1942
1943 /* Check actual AS value. */
1944 if (isdigit((unsigned char)*p)) {
1945 as_t asval;
1946
1947 *token = as_token_asval;
1948 asval = (*p - '0');
1949 p++;
1950
1951 while (isdigit((unsigned char)*p)) {
1952 asval *= 10;
1953 asval += (*p - '0');
1954 p++;
1955 }
1956 *asno = asval;
1957 return p;
1958 }
1959
1960 /* There is no match then return unknown token. */
1961 *token = as_token_unknown;
1962 p++;
1963 return p;
1964 }
1965
1966 struct aspath *aspath_str2aspath(const char *str)
1967 {
1968 enum as_token token = as_token_unknown;
1969 unsigned short as_type;
1970 unsigned long asno = 0;
1971 struct aspath *aspath;
1972 int needtype;
1973
1974 aspath = aspath_new();
1975
1976 /* We start default type as AS_SEQUENCE. */
1977 as_type = AS_SEQUENCE;
1978 needtype = 1;
1979
1980 while ((str = aspath_gettoken(str, &token, &asno)) != NULL) {
1981 switch (token) {
1982 case as_token_asval:
1983 if (needtype) {
1984 aspath_segment_add(aspath, as_type);
1985 needtype = 0;
1986 }
1987 aspath_as_add(aspath, asno);
1988 break;
1989 case as_token_set_start:
1990 as_type = AS_SET;
1991 aspath_segment_add(aspath, as_type);
1992 needtype = 0;
1993 break;
1994 case as_token_set_end:
1995 as_type = AS_SEQUENCE;
1996 needtype = 1;
1997 break;
1998 case as_token_confed_seq_start:
1999 as_type = AS_CONFED_SEQUENCE;
2000 aspath_segment_add(aspath, as_type);
2001 needtype = 0;
2002 break;
2003 case as_token_confed_seq_end:
2004 as_type = AS_SEQUENCE;
2005 needtype = 1;
2006 break;
2007 case as_token_confed_set_start:
2008 as_type = AS_CONFED_SET;
2009 aspath_segment_add(aspath, as_type);
2010 needtype = 0;
2011 break;
2012 case as_token_confed_set_end:
2013 as_type = AS_SEQUENCE;
2014 needtype = 1;
2015 break;
2016 case as_token_unknown:
2017 default:
2018 aspath_free(aspath);
2019 return NULL;
2020 }
2021 }
2022
2023 aspath_make_str_count(aspath, false);
2024
2025 return aspath;
2026 }
2027
2028 /* Make hash value by raw aspath data. */
2029 unsigned int aspath_key_make(const void *p)
2030 {
2031 const struct aspath *aspath = p;
2032 unsigned int key = 0;
2033
2034 if (!aspath->str)
2035 aspath_str_update((struct aspath *)aspath, false);
2036
2037 key = jhash(aspath->str, aspath->str_len, 2334325);
2038
2039 return key;
2040 }
2041
2042 /* If two aspath have same value then return 1 else return 0 */
2043 bool aspath_cmp(const void *arg1, const void *arg2)
2044 {
2045 const struct assegment *seg1 = ((const struct aspath *)arg1)->segments;
2046 const struct assegment *seg2 = ((const struct aspath *)arg2)->segments;
2047
2048 while (seg1 || seg2) {
2049 int i;
2050 if ((!seg1 && seg2) || (seg1 && !seg2))
2051 return false;
2052 if (seg1->type != seg2->type)
2053 return false;
2054 if (seg1->length != seg2->length)
2055 return false;
2056 for (i = 0; i < seg1->length; i++)
2057 if (seg1->as[i] != seg2->as[i])
2058 return false;
2059 seg1 = seg1->next;
2060 seg2 = seg2->next;
2061 }
2062 return true;
2063 }
2064
2065 /* AS path hash initialize. */
2066 void aspath_init(void)
2067 {
2068 ashash = hash_create_size(32768, aspath_key_make, aspath_cmp,
2069 "BGP AS Path");
2070 }
2071
2072 void aspath_finish(void)
2073 {
2074 hash_clean(ashash, (void (*)(void *))aspath_free);
2075 hash_free(ashash);
2076 ashash = NULL;
2077
2078 if (snmp_stream)
2079 stream_free(snmp_stream);
2080 }
2081
2082 /* return and as path value */
2083 const char *aspath_print(struct aspath *as)
2084 {
2085 return (as ? as->str : NULL);
2086 }
2087
2088 /* Printing functions */
2089 /* Feed the AS_PATH to the vty; the suffix string follows it only in case
2090 * AS_PATH wasn't empty.
2091 */
2092 void aspath_print_vty(struct vty *vty, const char *format, struct aspath *as,
2093 const char *suffix)
2094 {
2095 assert(format);
2096 vty_out(vty, format, as->str);
2097 if (as->str_len && strlen(suffix))
2098 vty_out(vty, "%s", suffix);
2099 }
2100
2101 static void aspath_show_all_iterator(struct hash_bucket *bucket,
2102 struct vty *vty)
2103 {
2104 struct aspath *as;
2105
2106 as = (struct aspath *)bucket->data;
2107
2108 vty_out(vty, "[%p:%u] (%ld) ", (void *)bucket, bucket->key, as->refcnt);
2109 vty_out(vty, "%s\n", as->str);
2110 }
2111
2112 /* Print all aspath and hash information. This function is used from
2113 `show [ip] bgp paths' command. */
2114 void aspath_print_all_vty(struct vty *vty)
2115 {
2116 hash_iterate(ashash, (void (*)(struct hash_bucket *,
2117 void *))aspath_show_all_iterator,
2118 vty);
2119 }
2120
2121 static struct aspath *bgp_aggr_aspath_lookup(struct bgp_aggregate *aggregate,
2122 struct aspath *aspath)
2123 {
2124 return hash_lookup(aggregate->aspath_hash, aspath);
2125 }
2126
2127 static void *bgp_aggr_aspath_hash_alloc(void *p)
2128 {
2129 struct aspath *ref = (struct aspath *)p;
2130 struct aspath *aspath = NULL;
2131
2132 aspath = aspath_dup(ref);
2133 return aspath;
2134 }
2135
2136 static void bgp_aggr_aspath_prepare(struct hash_bucket *hb, void *arg)
2137 {
2138 struct aspath *hb_aspath = hb->data;
2139 struct aspath **aggr_aspath = arg;
2140
2141 if (*aggr_aspath)
2142 *aggr_aspath = aspath_aggregate(*aggr_aspath, hb_aspath);
2143 else
2144 *aggr_aspath = aspath_dup(hb_aspath);
2145 }
2146
2147 void bgp_aggr_aspath_remove(void *arg)
2148 {
2149 struct aspath *aspath = arg;
2150
2151 aspath_free(aspath);
2152 }
2153
2154 void bgp_compute_aggregate_aspath(struct bgp_aggregate *aggregate,
2155 struct aspath *aspath)
2156 {
2157 bgp_compute_aggregate_aspath_hash(aggregate, aspath);
2158
2159 bgp_compute_aggregate_aspath_val(aggregate);
2160
2161 }
2162
2163 void bgp_compute_aggregate_aspath_hash(struct bgp_aggregate *aggregate,
2164 struct aspath *aspath)
2165 {
2166 struct aspath *aggr_aspath = NULL;
2167
2168 if ((aggregate == NULL) || (aspath == NULL))
2169 return;
2170
2171 /* Create hash if not already created.
2172 */
2173 if (aggregate->aspath_hash == NULL)
2174 aggregate->aspath_hash = hash_create(
2175 aspath_key_make, aspath_cmp,
2176 "BGP Aggregator as-path hash");
2177
2178 aggr_aspath = bgp_aggr_aspath_lookup(aggregate, aspath);
2179 if (aggr_aspath == NULL) {
2180 /* Insert as-path into hash.
2181 */
2182 aggr_aspath = hash_get(aggregate->aspath_hash, aspath,
2183 bgp_aggr_aspath_hash_alloc);
2184 }
2185
2186 /* Increment reference counter.
2187 */
2188 aggr_aspath->refcnt++;
2189 }
2190
2191 void bgp_compute_aggregate_aspath_val(struct bgp_aggregate *aggregate)
2192 {
2193 if (aggregate == NULL)
2194 return;
2195 /* Re-compute aggregate's as-path.
2196 */
2197 if (aggregate->aspath) {
2198 aspath_free(aggregate->aspath);
2199 aggregate->aspath = NULL;
2200 }
2201 if (aggregate->aspath_hash
2202 && aggregate->aspath_hash->count) {
2203 hash_iterate(aggregate->aspath_hash,
2204 bgp_aggr_aspath_prepare,
2205 &aggregate->aspath);
2206 }
2207 }
2208
2209 void bgp_remove_aspath_from_aggregate(struct bgp_aggregate *aggregate,
2210 struct aspath *aspath)
2211 {
2212 struct aspath *aggr_aspath = NULL;
2213 struct aspath *ret_aspath = NULL;
2214
2215 if ((!aggregate)
2216 || (!aggregate->aspath_hash)
2217 || (!aspath))
2218 return;
2219
2220 /* Look-up the aspath in the hash.
2221 */
2222 aggr_aspath = bgp_aggr_aspath_lookup(aggregate, aspath);
2223 if (aggr_aspath) {
2224 aggr_aspath->refcnt--;
2225
2226 if (aggr_aspath->refcnt == 0) {
2227 ret_aspath = hash_release(aggregate->aspath_hash,
2228 aggr_aspath);
2229 aspath_free(ret_aspath);
2230 ret_aspath = NULL;
2231
2232 /* Remove aggregate's old as-path.
2233 */
2234 aspath_free(aggregate->aspath);
2235 aggregate->aspath = NULL;
2236
2237 bgp_compute_aggregate_aspath_val(aggregate);
2238 }
2239 }
2240 }
2241
2242 void bgp_remove_aspath_from_aggregate_hash(struct bgp_aggregate *aggregate,
2243 struct aspath *aspath)
2244 {
2245 struct aspath *aggr_aspath = NULL;
2246 struct aspath *ret_aspath = NULL;
2247
2248 if ((!aggregate)
2249 || (!aggregate->aspath_hash)
2250 || (!aspath))
2251 return;
2252
2253 /* Look-up the aspath in the hash.
2254 */
2255 aggr_aspath = bgp_aggr_aspath_lookup(aggregate, aspath);
2256 if (aggr_aspath) {
2257 aggr_aspath->refcnt--;
2258
2259 if (aggr_aspath->refcnt == 0) {
2260 ret_aspath = hash_release(aggregate->aspath_hash,
2261 aggr_aspath);
2262 aspath_free(ret_aspath);
2263 ret_aspath = NULL;
2264 }
2265 }
2266 }
2267