]> git.proxmox.com Git - mirror_frr.git/blob - bgpd/bgp_updgrp_packet.c
projects / mirror_frr.git / blob
? search:
summary | shortlog | log | commit | commitdiff | tree
blame | history | raw | HEAD
Merge pull request #5717 from pguibert6WIND/flowspec_issue_redistribute
[mirror_frr.git] / bgpd / bgp_updgrp_packet.c
1 /**
2 * bgp_updgrp_packet.c: BGP update group packet handling routines
3 *
4 * @copyright Copyright (C) 2014 Cumulus Networks, Inc.
5 *
6 * @author Avneesh Sachdev <avneesh@sproute.net>
7 * @author Rajesh Varadarajan <rajesh@sproute.net>
8 * @author Pradosh Mohapatra <pradosh@sproute.net>
9 *
10 * This file is part of GNU Zebra.
11 *
12 * GNU Zebra is free software; you can redistribute it and/or modify it
13 * under the terms of the GNU General Public License as published by the
14 * Free Software Foundation; either version 2, or (at your option) any
15 * later version.
16 *
17 * GNU Zebra is distributed in the hope that it will be useful, but
18 * WITHOUT ANY WARRANTY; without even the implied warranty of
19 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 * General Public License for more details.
21 *
22 * You should have received a copy of the GNU General Public License along
23 * with this program; see the file COPYING; if not, write to the Free Software
24 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
25 */
26
27 #include <zebra.h>
28
29 #include "prefix.h"
30 #include "thread.h"
31 #include "buffer.h"
32 #include "stream.h"
33 #include "command.h"
34 #include "sockunion.h"
35 #include "network.h"
36 #include "memory.h"
37 #include "filter.h"
38 #include "routemap.h"
39 #include "log.h"
40 #include "plist.h"
41 #include "linklist.h"
42 #include "workqueue.h"
43 #include "hash.h"
44 #include "queue.h"
45 #include "mpls.h"
46
47 #include "bgpd/bgpd.h"
48 #include "bgpd/bgp_debug.h"
49 #include "bgpd/bgp_errors.h"
50 #include "bgpd/bgp_fsm.h"
51 #include "bgpd/bgp_route.h"
52 #include "bgpd/bgp_packet.h"
53 #include "bgpd/bgp_advertise.h"
54 #include "bgpd/bgp_updgrp.h"
55 #include "bgpd/bgp_nexthop.h"
56 #include "bgpd/bgp_nht.h"
57 #include "bgpd/bgp_mplsvpn.h"
58 #include "bgpd/bgp_label.h"
59 #include "bgpd/bgp_addpath.h"
60
61 /********************
62 * PRIVATE FUNCTIONS
63 ********************/
64
65 /********************
66 * PUBLIC FUNCTIONS
67 ********************/
68 struct bpacket *bpacket_alloc(void)
69 {
70 struct bpacket *pkt;
71
72 pkt = XCALLOC(MTYPE_BGP_PACKET, sizeof(struct bpacket));
73
74 return pkt;
75 }
76
77 void bpacket_free(struct bpacket *pkt)
78 {
79 if (pkt->buffer)
80 stream_free(pkt->buffer);
81 pkt->buffer = NULL;
82 XFREE(MTYPE_BGP_PACKET, pkt);
83 }
84
85 void bpacket_queue_init(struct bpacket_queue *q)
86 {
87 TAILQ_INIT(&(q->pkts));
88 }
89
90 /*
91 * bpacket_queue_sanity_check
92 */
93 void bpacket_queue_sanity_check(struct bpacket_queue __attribute__((__unused__))
94 * q)
95 {
96 #if 0
97 struct bpacket *pkt;
98
99 pkt = bpacket_queue_last (q);
100 assert (pkt);
101 assert (!pkt->buffer);
102
103 /*
104 * Make sure the count of packets is correct.
105 */
106 int num_pkts = 0;
107
108 pkt = bpacket_queue_first (q);
109 while (pkt)
110 {
111 num_pkts++;
112
113 if (num_pkts > q->curr_count)
114 assert (0);
115
116 pkt = TAILQ_NEXT (pkt, pkt_train);
117 }
118
119 assert (num_pkts == q->curr_count);
120 #endif
121 }
122
123 /*
124 * bpacket_queue_add_packet
125 *
126 * Internal function of bpacket_queue - and adds a
127 * packet entry to the end of the list.
128 *
129 * Users of bpacket_queue should use bpacket_queue_add instead.
130 */
131 static void bpacket_queue_add_packet(struct bpacket_queue *q,
132 struct bpacket *pkt)
133 {
134 struct bpacket *last_pkt;
135
136 if (TAILQ_EMPTY(&(q->pkts)))
137 TAILQ_INSERT_TAIL(&(q->pkts), pkt, pkt_train);
138 else {
139 last_pkt = bpacket_queue_last(q);
140 TAILQ_INSERT_AFTER(&(q->pkts), last_pkt, pkt, pkt_train);
141 }
142 q->curr_count++;
143 if (q->hwm_count < q->curr_count)
144 q->hwm_count = q->curr_count;
145 }
146
147 /*
148 * Adds a packet to the bpacket_queue.
149 *
150 * The stream passed is consumed by this function. So, the caller should
151 * not free or use the stream after
152 * invoking this function.
153 */
154 struct bpacket *bpacket_queue_add(struct bpacket_queue *q, struct stream *s,
155 struct bpacket_attr_vec_arr *vecarrp)
156 {
157 struct bpacket *pkt;
158 struct bpacket *last_pkt;
159
160
161 pkt = bpacket_alloc();
162 if (TAILQ_EMPTY(&(q->pkts))) {
163 pkt->ver = 1;
164 pkt->buffer = s;
165 if (vecarrp)
166 memcpy(&pkt->arr, vecarrp,
167 sizeof(struct bpacket_attr_vec_arr));
168 else
169 bpacket_attr_vec_arr_reset(&pkt->arr);
170 bpacket_queue_add_packet(q, pkt);
171 bpacket_queue_sanity_check(q);
172 return pkt;
173 }
174
175 /*
176 * Fill in the new information into the current sentinel and create a
177 * new sentinel.
178 */
179 bpacket_queue_sanity_check(q);
180 last_pkt = bpacket_queue_last(q);
181 assert(last_pkt->buffer == NULL);
182 last_pkt->buffer = s;
183 if (vecarrp)
184 memcpy(&last_pkt->arr, vecarrp,
185 sizeof(struct bpacket_attr_vec_arr));
186 else
187 bpacket_attr_vec_arr_reset(&last_pkt->arr);
188
189 pkt->ver = last_pkt->ver;
190 pkt->ver++;
191 bpacket_queue_add_packet(q, pkt);
192
193 bpacket_queue_sanity_check(q);
194 return last_pkt;
195 }
196
197 struct bpacket *bpacket_queue_first(struct bpacket_queue *q)
198 {
199 return (TAILQ_FIRST(&(q->pkts)));
200 }
201
202 struct bpacket *bpacket_queue_last(struct bpacket_queue *q)
203 {
204 return TAILQ_LAST(&(q->pkts), pkt_queue);
205 }
206
207 struct bpacket *bpacket_queue_remove(struct bpacket_queue *q)
208 {
209 struct bpacket *first;
210
211 first = bpacket_queue_first(q);
212 if (first) {
213 TAILQ_REMOVE(&(q->pkts), first, pkt_train);
214 q->curr_count--;
215 }
216 return first;
217 }
218
219 unsigned int bpacket_queue_length(struct bpacket_queue *q)
220 {
221 return q->curr_count - 1;
222 }
223
224 unsigned int bpacket_queue_hwm_length(struct bpacket_queue *q)
225 {
226 return q->hwm_count - 1;
227 }
228
229 int bpacket_queue_is_full(struct bgp *bgp, struct bpacket_queue *q)
230 {
231 if (q->curr_count >= bgp->default_subgroup_pkt_queue_max)
232 return 1;
233 return 0;
234 }
235
236 void bpacket_add_peer(struct bpacket *pkt, struct peer_af *paf)
237 {
238 if (!pkt || !paf)
239 return;
240
241 LIST_INSERT_HEAD(&(pkt->peers), paf, pkt_train);
242 paf->next_pkt_to_send = pkt;
243 }
244
245 /*
246 * bpacket_queue_cleanup
247 */
248 void bpacket_queue_cleanup(struct bpacket_queue *q)
249 {
250 struct bpacket *pkt;
251
252 while ((pkt = bpacket_queue_remove(q))) {
253 bpacket_free(pkt);
254 }
255 }
256
257 /*
258 * bpacket_queue_compact
259 *
260 * Delete packets that do not need to be transmitted to any peer from
261 * the queue.
262 *
263 * @return the number of packets deleted.
264 */
265 static int bpacket_queue_compact(struct bpacket_queue *q)
266 {
267 int num_deleted;
268 struct bpacket *pkt, *removed_pkt;
269
270 num_deleted = 0;
271
272 while (1) {
273 pkt = bpacket_queue_first(q);
274 if (!pkt)
275 break;
276
277 /*
278 * Don't delete the sentinel.
279 */
280 if (!pkt->buffer)
281 break;
282
283 if (!LIST_EMPTY(&(pkt->peers)))
284 break;
285
286 removed_pkt = bpacket_queue_remove(q);
287 assert(pkt == removed_pkt);
288 bpacket_free(removed_pkt);
289
290 num_deleted++;
291 }
292
293 bpacket_queue_sanity_check(q);
294 return num_deleted;
295 }
296
297 void bpacket_queue_advance_peer(struct peer_af *paf)
298 {
299 struct bpacket *pkt;
300 struct bpacket *old_pkt;
301
302 old_pkt = paf->next_pkt_to_send;
303 if (old_pkt->buffer == NULL)
304 /* Already at end of list */
305 return;
306
307 LIST_REMOVE(paf, pkt_train);
308 pkt = TAILQ_NEXT(old_pkt, pkt_train);
309 bpacket_add_peer(pkt, paf);
310
311 if (!bpacket_queue_compact(PAF_PKTQ(paf)))
312 return;
313
314 /*
315 * Deleted one or more packets. Check if we can now merge this
316 * peer's subgroup into another subgroup.
317 */
318 update_subgroup_check_merge(paf->subgroup, "advanced peer in queue");
319 }
320
321 /*
322 * bpacket_queue_remove_peer
323 *
324 * Remove the peer from the packet queue of the subgroup it belongs
325 * to.
326 */
327 void bpacket_queue_remove_peer(struct peer_af *paf)
328 {
329 struct bpacket_queue *q;
330
331 q = PAF_PKTQ(paf);
332 assert(q);
333 if (!q)
334 return;
335
336 LIST_REMOVE(paf, pkt_train);
337 paf->next_pkt_to_send = NULL;
338
339 bpacket_queue_compact(q);
340 }
341
342 unsigned int bpacket_queue_virtual_length(struct peer_af *paf)
343 {
344 struct bpacket *pkt;
345 struct bpacket *last;
346 struct bpacket_queue *q;
347
348 pkt = paf->next_pkt_to_send;
349 if (!pkt || (pkt->buffer == NULL))
350 /* Already at end of list */
351 return 0;
352
353 q = PAF_PKTQ(paf);
354 if (TAILQ_EMPTY(&(q->pkts)))
355 return 0;
356
357 last = TAILQ_LAST(&(q->pkts), pkt_queue);
358 if (last->ver >= pkt->ver)
359 return last->ver - pkt->ver;
360
361 /* sequence # rolled over */
362 return (UINT_MAX - pkt->ver + 1) + last->ver;
363 }
364
365 /*
366 * Dump the bpacket queue
367 */
368 void bpacket_queue_show_vty(struct bpacket_queue *q, struct vty *vty)
369 {
370 struct bpacket *pkt;
371 struct peer_af *paf;
372
373 pkt = bpacket_queue_first(q);
374 while (pkt) {
375 vty_out(vty, " Packet %p ver %u buffer %p\n", pkt, pkt->ver,
376 pkt->buffer);
377
378 LIST_FOREACH (paf, &(pkt->peers), pkt_train) {
379 vty_out(vty, " - %s\n", paf->peer->host);
380 }
381 pkt = bpacket_next(pkt);
382 }
383 return;
384 }
385
386 struct stream *bpacket_reformat_for_peer(struct bpacket *pkt,
387 struct peer_af *paf)
388 {
389 struct stream *s = NULL;
390 bpacket_attr_vec *vec;
391 struct peer *peer;
392 char buf[BUFSIZ];
393 char buf2[BUFSIZ];
394 struct bgp_filter *filter;
395
396 s = stream_dup(pkt->buffer);
397 peer = PAF_PEER(paf);
398
399 vec = &pkt->arr.entries[BGP_ATTR_VEC_NH];
400 if (CHECK_FLAG(vec->flags, BPKT_ATTRVEC_FLAGS_UPDATED)) {
401 uint8_t nhlen;
402 afi_t nhafi;
403 int route_map_sets_nh;
404 nhlen = stream_getc_from(s, vec->offset);
405 filter = &peer->filter[paf->afi][paf->safi];
406
407 if (peer_cap_enhe(peer, paf->afi, paf->safi))
408 nhafi = AFI_IP6;
409 else
410 nhafi = BGP_NEXTHOP_AFI_FROM_NHLEN(nhlen);
411
412 if (nhafi == AFI_IP) {
413 struct in_addr v4nh, *mod_v4nh;
414 int nh_modified = 0;
415 size_t offset_nh = vec->offset + 1;
416
417 route_map_sets_nh =
418 (CHECK_FLAG(
419 vec->flags,
420 BPKT_ATTRVEC_FLAGS_RMAP_IPV4_NH_CHANGED)
421 || CHECK_FLAG(
422 vec->flags,
423 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS));
424
425 switch (nhlen) {
426 case BGP_ATTR_NHLEN_IPV4:
427 break;
428 case BGP_ATTR_NHLEN_VPNV4:
429 offset_nh += 8;
430 break;
431 default:
432 /* TODO: handle IPv6 nexthops */
433 flog_warn(
434 EC_BGP_INVALID_NEXTHOP_LENGTH,
435 "%s: %s: invalid MP nexthop length (AFI IP): %u",
436 __func__, peer->host, nhlen);
437 stream_free(s);
438 return NULL;
439 }
440
441 stream_get_from(&v4nh, s, offset_nh, IPV4_MAX_BYTELEN);
442 mod_v4nh = &v4nh;
443
444 /*
445 * If route-map has set the nexthop, that is normally
446 * used; if it is specified as peer-address, the peering
447 * address is picked up. Otherwise, if NH is unavailable
448 * from attribute, the peering addr is picked up; the
449 * "NH unavailable" case also covers next-hop-self and
450 * some other scenarios - see subgroup_announce_check().
451 * In all other cases, use the nexthop carried in the
452 * attribute unless it is EBGP non-multiaccess and there
453 * is no next-hop-unchanged setting or the peer is EBGP
454 * and the route-map that changed the next-hop value
455 * was applied inbound rather than outbound. Updates to
456 * an EBGP peer should only modify the next-hop if it
457 * was set in an outbound route-map to that peer.
458 * Note: It is assumed route-map cannot set the nexthop
459 * to an invalid value.
460 */
461 if (route_map_sets_nh
462 && ((peer->sort != BGP_PEER_EBGP)
463 || ROUTE_MAP_OUT(filter))) {
464 if (CHECK_FLAG(
465 vec->flags,
466 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS)) {
467 mod_v4nh = &peer->nexthop.v4;
468 nh_modified = 1;
469 }
470 } else if (!v4nh.s_addr) {
471 mod_v4nh = &peer->nexthop.v4;
472 nh_modified = 1;
473 } else if (
474 peer->sort == BGP_PEER_EBGP
475 && (bgp_multiaccess_check_v4(v4nh, peer) == 0)
476 && !CHECK_FLAG(
477 vec->flags,
478 BPKT_ATTRVEC_FLAGS_RMAP_NH_UNCHANGED)
479 && !peer_af_flag_check(
480 peer, paf->afi, paf->safi,
481 PEER_FLAG_NEXTHOP_UNCHANGED)) {
482 /* NOTE: not handling case where NH has new AFI
483 */
484 mod_v4nh = &peer->nexthop.v4;
485 nh_modified = 1;
486 }
487
488 if (nh_modified) /* allow for VPN RD */
489 stream_put_in_addr_at(s, offset_nh, mod_v4nh);
490
491 if (bgp_debug_update(peer, NULL, NULL, 0))
492 zlog_debug("u%" PRIu64 ":s%" PRIu64
493 " %s send UPDATE w/ nexthop %s%s",
494 PAF_SUBGRP(paf)->update_group->id,
495 PAF_SUBGRP(paf)->id, peer->host,
496 inet_ntoa(*mod_v4nh),
497 (nhlen == 12 ? " and RD" : ""));
498 } else if (nhafi == AFI_IP6) {
499 struct in6_addr v6nhglobal, *mod_v6nhg;
500 struct in6_addr v6nhlocal, *mod_v6nhl;
501 int gnh_modified, lnh_modified;
502 size_t offset_nhglobal = vec->offset + 1;
503 size_t offset_nhlocal = vec->offset + 1;
504
505 gnh_modified = lnh_modified = 0;
506 mod_v6nhg = &v6nhglobal;
507 mod_v6nhl = &v6nhlocal;
508
509 route_map_sets_nh =
510 (CHECK_FLAG(
511 vec->flags,
512 BPKT_ATTRVEC_FLAGS_RMAP_IPV6_GNH_CHANGED)
513 || CHECK_FLAG(
514 vec->flags,
515 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS));
516
517 /*
518 * The logic here is rather similar to that for IPv4,
519 * the
520 * additional work being to handle 1 or 2 nexthops.
521 * Also, 3rd
522 * party nexthop is not propagated for EBGP right now.
523 */
524 switch (nhlen) {
525 case BGP_ATTR_NHLEN_IPV6_GLOBAL:
526 break;
527 case BGP_ATTR_NHLEN_IPV6_GLOBAL_AND_LL:
528 offset_nhlocal += IPV6_MAX_BYTELEN;
529 break;
530 case BGP_ATTR_NHLEN_VPNV6_GLOBAL:
531 offset_nhglobal += 8;
532 break;
533 case BGP_ATTR_NHLEN_VPNV6_GLOBAL_AND_LL:
534 offset_nhglobal += 8;
535 offset_nhlocal += 8 * 2 + IPV6_MAX_BYTELEN;
536 break;
537 default:
538 /* TODO: handle IPv4 nexthops */
539 flog_warn(
540 EC_BGP_INVALID_NEXTHOP_LENGTH,
541 "%s: %s: invalid MP nexthop length (AFI IP6): %u",
542 __func__, peer->host, nhlen);
543 stream_free(s);
544 return NULL;
545 }
546
547 stream_get_from(&v6nhglobal, s, offset_nhglobal,
548 IPV6_MAX_BYTELEN);
549
550 /*
551 * Updates to an EBGP peer should only modify the
552 * next-hop if it was set in an outbound route-map
553 * to that peer.
554 */
555 if (route_map_sets_nh
556 && ((peer->sort != BGP_PEER_EBGP)
557 || ROUTE_MAP_OUT(filter))) {
558 if (CHECK_FLAG(
559 vec->flags,
560 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS)) {
561 mod_v6nhg = &peer->nexthop.v6_global;
562 gnh_modified = 1;
563 }
564 } else if (IN6_IS_ADDR_UNSPECIFIED(&v6nhglobal)) {
565 mod_v6nhg = &peer->nexthop.v6_global;
566 gnh_modified = 1;
567 } else if (
568 (peer->sort == BGP_PEER_EBGP)
569 && (!bgp_multiaccess_check_v6(v6nhglobal, peer))
570 && !CHECK_FLAG(vec->flags,
571 BPKT_ATTRVEC_FLAGS_RMAP_NH_UNCHANGED)
572 && !peer_af_flag_check(
573 peer, nhafi, paf->safi,
574 PEER_FLAG_NEXTHOP_UNCHANGED)) {
575 /* NOTE: not handling case where NH has new AFI
576 */
577 mod_v6nhg = &peer->nexthop.v6_global;
578 gnh_modified = 1;
579 }
580
581
582 if (nhlen == BGP_ATTR_NHLEN_IPV6_GLOBAL_AND_LL
583 || nhlen == BGP_ATTR_NHLEN_VPNV6_GLOBAL_AND_LL) {
584 stream_get_from(&v6nhlocal, s, offset_nhlocal,
585 IPV6_MAX_BYTELEN);
586 if (IN6_IS_ADDR_UNSPECIFIED(&v6nhlocal)) {
587 mod_v6nhl = &peer->nexthop.v6_local;
588 lnh_modified = 1;
589 }
590 }
591
592 if (gnh_modified)
593 stream_put_in6_addr_at(s, offset_nhglobal,
594 mod_v6nhg);
595 if (lnh_modified)
596 stream_put_in6_addr_at(s, offset_nhlocal,
597 mod_v6nhl);
598
599 if (bgp_debug_update(peer, NULL, NULL, 0)) {
600 if (nhlen == 32 || nhlen == 48)
601 zlog_debug(
602 "u%" PRIu64 ":s%" PRIu64
603 " %s send UPDATE w/ mp_nexthops %s, %s%s",
604 PAF_SUBGRP(paf)
605 ->update_group->id,
606 PAF_SUBGRP(paf)->id, peer->host,
607 inet_ntop(AF_INET6, mod_v6nhg,
608 buf, BUFSIZ),
609 inet_ntop(AF_INET6, mod_v6nhl,
610 buf2, BUFSIZ),
611 (nhlen == 48 ? " and RD" : ""));
612 else
613 zlog_debug(
614 "u%" PRIu64 ":s%" PRIu64
615 " %s send UPDATE w/ mp_nexthop %s%s",
616 PAF_SUBGRP(paf)
617 ->update_group->id,
618 PAF_SUBGRP(paf)->id, peer->host,
619 inet_ntop(AF_INET6, mod_v6nhg,
620 buf, BUFSIZ),
621 (nhlen == 24 ? " and RD" : ""));
622 }
623 } else if (paf->afi == AFI_L2VPN) {
624 struct in_addr v4nh, *mod_v4nh;
625 int nh_modified = 0;
626
627 stream_get_from(&v4nh, s, vec->offset + 1, 4);
628 mod_v4nh = &v4nh;
629
630 /* No route-map changes allowed for EVPN nexthops. */
631 if (!v4nh.s_addr) {
632 mod_v4nh = &peer->nexthop.v4;
633 nh_modified = 1;
634 }
635
636 if (nh_modified)
637 stream_put_in_addr_at(s, vec->offset + 1,
638 mod_v4nh);
639
640 if (bgp_debug_update(peer, NULL, NULL, 0))
641 zlog_debug("u%" PRIu64 ":s%" PRIu64
642 " %s send UPDATE w/ nexthop %s",
643 PAF_SUBGRP(paf)->update_group->id,
644 PAF_SUBGRP(paf)->id, peer->host,
645 inet_ntoa(*mod_v4nh));
646 }
647 }
648
649 return s;
650 }
651
652 /*
653 * Update the vecarr offsets to go beyond 'pos' bytes, i.e. add 'pos'
654 * to each offset.
655 */
656 static void bpacket_attr_vec_arr_update(struct bpacket_attr_vec_arr *vecarr,
657 size_t pos)
658 {
659 int i;
660
661 if (!vecarr)
662 return;
663
664 for (i = 0; i < BGP_ATTR_VEC_MAX; i++)
665 vecarr->entries[i].offset += pos;
666 }
667
668 /*
669 * Return if there are packets to build for this subgroup.
670 */
671 int subgroup_packets_to_build(struct update_subgroup *subgrp)
672 {
673 struct bgp_advertise *adv;
674
675 if (!subgrp)
676 return 0;
677
678 adv = bgp_adv_fifo_first(&subgrp->sync->withdraw);
679 if (adv)
680 return 1;
681
682 adv = bgp_adv_fifo_first(&subgrp->sync->update);
683 if (adv)
684 return 1;
685
686 return 0;
687 }
688
689 /* Make BGP update packet. */
690 struct bpacket *subgroup_update_packet(struct update_subgroup *subgrp)
691 {
692 struct bpacket_attr_vec_arr vecarr;
693 struct bpacket *pkt;
694 struct peer *peer;
695 struct stream *s;
696 struct stream *snlri;
697 struct stream *packet;
698 struct bgp_adj_out *adj;
699 struct bgp_advertise *adv;
700 struct bgp_node *rn = NULL;
701 struct bgp_path_info *path = NULL;
702 bgp_size_t total_attr_len = 0;
703 unsigned long attrlen_pos = 0;
704 size_t mpattrlen_pos = 0;
705 size_t mpattr_pos = 0;
706 afi_t afi;
707 safi_t safi;
708 int space_remaining = 0;
709 int space_needed = 0;
710 char send_attr_str[BUFSIZ];
711 int send_attr_printed = 0;
712 int num_pfx = 0;
713 int addpath_encode = 0;
714 int addpath_overhead = 0;
715 uint32_t addpath_tx_id = 0;
716 struct prefix_rd *prd = NULL;
717 mpls_label_t label = MPLS_INVALID_LABEL, *label_pnt = NULL;
718 uint32_t num_labels = 0;
719
720 if (!subgrp)
721 return NULL;
722
723 if (bpacket_queue_is_full(SUBGRP_INST(subgrp), SUBGRP_PKTQ(subgrp)))
724 return NULL;
725
726 peer = SUBGRP_PEER(subgrp);
727 afi = SUBGRP_AFI(subgrp);
728 safi = SUBGRP_SAFI(subgrp);
729 s = subgrp->work;
730 stream_reset(s);
731 snlri = subgrp->scratch;
732 stream_reset(snlri);
733
734 bpacket_attr_vec_arr_reset(&vecarr);
735
736 addpath_encode = bgp_addpath_encode_tx(peer, afi, safi);
737 addpath_overhead = addpath_encode ? BGP_ADDPATH_ID_LEN : 0;
738
739 adv = bgp_adv_fifo_first(&subgrp->sync->update);
740 while (adv) {
741 assert(adv->rn);
742 rn = adv->rn;
743 adj = adv->adj;
744 addpath_tx_id = adj->addpath_tx_id;
745 path = adv->pathi;
746
747 /* Check if we need to add a prefix to the packet if
748 * maximum-prefix-out is set for the peer.
749 */
750 if (CHECK_FLAG(peer->af_flags[afi][safi],
751 PEER_FLAG_MAX_PREFIX_OUT)
752 && subgrp->scount >= peer->pmax_out[afi][safi]) {
753 if (BGP_DEBUG(update, UPDATE_OUT)
754 || BGP_DEBUG(update, UPDATE_PREFIX)) {
755 zlog_debug(
756 "%s reached maximum prefix to be send (%" PRIu32
757 ")",
758 peer->host, peer->pmax_out[afi][safi]);
759 }
760 goto next;
761 }
762
763 space_remaining = STREAM_CONCAT_REMAIN(s, snlri, STREAM_SIZE(s))
764 - BGP_MAX_PACKET_SIZE_OVERFLOW;
765 space_needed =
766 BGP_NLRI_LENGTH + addpath_overhead
767 + bgp_packet_mpattr_prefix_size(afi, safi, &rn->p);
768
769 /* When remaining space can't include NLRI and it's length. */
770 if (space_remaining < space_needed)
771 break;
772
773 /* If packet is empty, set attribute. */
774 if (stream_empty(s)) {
775 struct peer *from = NULL;
776
777 if (path)
778 from = path->peer;
779
780 /* 1: Write the BGP message header - 16 bytes marker, 2
781 * bytes length,
782 * one byte message type.
783 */
784 bgp_packet_set_marker(s, BGP_MSG_UPDATE);
785
786 /* 2: withdrawn routes length */
787 stream_putw(s, 0);
788
789 /* 3: total attributes length - attrlen_pos stores the
790 * position */
791 attrlen_pos = stream_get_endp(s);
792 stream_putw(s, 0);
793
794 /* 4: if there is MP_REACH_NLRI attribute, that should
795 * be the first
796 * attribute, according to
797 * draft-ietf-idr-error-handling. Save the
798 * position.
799 */
800 mpattr_pos = stream_get_endp(s);
801
802 /* 5: Encode all the attributes, except MP_REACH_NLRI
803 * attr. */
804 total_attr_len = bgp_packet_attribute(
805 NULL, peer, s, adv->baa->attr, &vecarr, NULL,
806 afi, safi, from, NULL, NULL, 0, 0, 0);
807
808 space_remaining =
809 STREAM_CONCAT_REMAIN(s, snlri, STREAM_SIZE(s))
810 - BGP_MAX_PACKET_SIZE_OVERFLOW;
811 space_needed = BGP_NLRI_LENGTH + addpath_overhead
812 + bgp_packet_mpattr_prefix_size(
813 afi, safi, &rn->p);
814
815 /* If the attributes alone do not leave any room for
816 * NLRI then
817 * return */
818 if (space_remaining < space_needed) {
819 flog_err(
820 EC_BGP_UPDGRP_ATTR_LEN,
821 "u%" PRIu64 ":s%" PRIu64
822 " attributes too long, cannot send UPDATE",
823 subgrp->update_group->id, subgrp->id);
824
825 /* Flush the FIFO update queue */
826 while (adv)
827 adv = bgp_advertise_clean_subgroup(
828 subgrp, adj);
829 return NULL;
830 }
831
832 if (BGP_DEBUG(update, UPDATE_OUT)
833 || BGP_DEBUG(update, UPDATE_PREFIX)) {
834 memset(send_attr_str, 0, BUFSIZ);
835 send_attr_printed = 0;
836 bgp_dump_attr(adv->baa->attr, send_attr_str,
837 BUFSIZ);
838 }
839 }
840
841 if ((afi == AFI_IP && safi == SAFI_UNICAST)
842 && !peer_cap_enhe(peer, afi, safi))
843 stream_put_prefix_addpath(s, &rn->p, addpath_encode,
844 addpath_tx_id);
845 else {
846 /* Encode the prefix in MP_REACH_NLRI attribute */
847 if (rn->prn)
848 prd = (struct prefix_rd *)&rn->prn->p;
849
850 if (safi == SAFI_LABELED_UNICAST) {
851 label = bgp_adv_label(rn, path, peer, afi,
852 safi);
853 label_pnt = &label;
854 num_labels = 1;
855 } else if (path && path->extra) {
856 label_pnt = &path->extra->label[0];
857 num_labels = path->extra->num_labels;
858 }
859
860 if (stream_empty(snlri))
861 mpattrlen_pos = bgp_packet_mpattr_start(
862 snlri, peer, afi, safi, &vecarr,
863 adv->baa->attr);
864
865 bgp_packet_mpattr_prefix(snlri, afi, safi, &rn->p, prd,
866 label_pnt, num_labels,
867 addpath_encode, addpath_tx_id,
868 adv->baa->attr);
869 }
870
871 num_pfx++;
872
873 if (bgp_debug_update(NULL, &rn->p, subgrp->update_group, 0)) {
874 char pfx_buf[BGP_PRD_PATH_STRLEN];
875
876 if (!send_attr_printed) {
877 zlog_debug("u%" PRIu64 ":s%" PRIu64
878 " send UPDATE w/ attr: %s",
879 subgrp->update_group->id, subgrp->id,
880 send_attr_str);
881 if (!stream_empty(snlri)) {
882 iana_afi_t pkt_afi;
883 iana_safi_t pkt_safi;
884
885 pkt_afi = afi_int2iana(afi);
886 pkt_safi = safi_int2iana(safi);
887 zlog_debug(
888 "u%" PRIu64 ":s%" PRIu64
889 " send MP_REACH for afi/safi %d/%d",
890 subgrp->update_group->id,
891 subgrp->id, pkt_afi, pkt_safi);
892 }
893
894 send_attr_printed = 1;
895 }
896
897 bgp_debug_rdpfxpath2str(afi, safi, prd, &rn->p,
898 label_pnt, num_labels,
899 addpath_encode, addpath_tx_id,
900 pfx_buf, sizeof(pfx_buf));
901 zlog_debug("u%" PRIu64 ":s%" PRIu64 " send UPDATE %s",
902 subgrp->update_group->id, subgrp->id,
903 pfx_buf);
904 }
905
906 /* Synchnorize attribute. */
907 if (adj->attr)
908 bgp_attr_unintern(&adj->attr);
909 else
910 subgrp->scount++;
911
912 adj->attr = bgp_attr_intern(adv->baa->attr);
913 next:
914 adv = bgp_advertise_clean_subgroup(subgrp, adj);
915 }
916
917 if (!stream_empty(s)) {
918 if (!stream_empty(snlri)) {
919 bgp_packet_mpattr_end(snlri, mpattrlen_pos);
920 total_attr_len += stream_get_endp(snlri);
921 }
922
923 /* set the total attribute length correctly */
924 stream_putw_at(s, attrlen_pos, total_attr_len);
925
926 if (!stream_empty(snlri)) {
927 packet = stream_dupcat(s, snlri, mpattr_pos);
928 bpacket_attr_vec_arr_update(&vecarr, mpattr_pos);
929 } else
930 packet = stream_dup(s);
931 bgp_packet_set_size(packet);
932 if (bgp_debug_update(NULL, NULL, subgrp->update_group, 0))
933 zlog_debug("u%" PRIu64 ":s%" PRIu64
934 " send UPDATE len %zd numpfx %d",
935 subgrp->update_group->id, subgrp->id,
936 (stream_get_endp(packet)
937 - stream_get_getp(packet)),
938 num_pfx);
939 pkt = bpacket_queue_add(SUBGRP_PKTQ(subgrp), packet, &vecarr);
940 stream_reset(s);
941 stream_reset(snlri);
942 return pkt;
943 }
944 return NULL;
945 }
946
947 /* Make BGP withdraw packet. */
948 /* For ipv4 unicast:
949 16-octet marker | 2-octet length | 1-octet type |
950 2-octet withdrawn route length | withdrawn prefixes | 2-octet attrlen (=0)
951 */
952 /* For other afi/safis:
953 16-octet marker | 2-octet length | 1-octet type |
954 2-octet withdrawn route length (=0) | 2-octet attrlen |
955 mp_unreach attr type | attr len | afi | safi | withdrawn prefixes
956 */
957 struct bpacket *subgroup_withdraw_packet(struct update_subgroup *subgrp)
958 {
959 struct bpacket *pkt;
960 struct stream *s;
961 struct bgp_adj_out *adj;
962 struct bgp_advertise *adv;
963 struct peer *peer;
964 struct bgp_node *rn;
965 bgp_size_t unfeasible_len;
966 bgp_size_t total_attr_len;
967 size_t mp_start = 0;
968 size_t attrlen_pos = 0;
969 size_t mplen_pos = 0;
970 uint8_t first_time = 1;
971 afi_t afi;
972 safi_t safi;
973 int space_remaining = 0;
974 int space_needed = 0;
975 int num_pfx = 0;
976 int addpath_encode = 0;
977 int addpath_overhead = 0;
978 uint32_t addpath_tx_id = 0;
979 struct prefix_rd *prd = NULL;
980
981
982 if (!subgrp)
983 return NULL;
984
985 if (bpacket_queue_is_full(SUBGRP_INST(subgrp), SUBGRP_PKTQ(subgrp)))
986 return NULL;
987
988 peer = SUBGRP_PEER(subgrp);
989 afi = SUBGRP_AFI(subgrp);
990 safi = SUBGRP_SAFI(subgrp);
991 s = subgrp->work;
992 stream_reset(s);
993 addpath_encode = bgp_addpath_encode_tx(peer, afi, safi);
994 addpath_overhead = addpath_encode ? BGP_ADDPATH_ID_LEN : 0;
995
996 while ((adv = bgp_adv_fifo_first(&subgrp->sync->withdraw)) != NULL) {
997 assert(adv->rn);
998 adj = adv->adj;
999 rn = adv->rn;
1000 addpath_tx_id = adj->addpath_tx_id;
1001
1002 space_remaining =
1003 STREAM_WRITEABLE(s) - BGP_MAX_PACKET_SIZE_OVERFLOW;
1004 space_needed =
1005 BGP_NLRI_LENGTH + addpath_overhead + BGP_TOTAL_ATTR_LEN
1006 + bgp_packet_mpattr_prefix_size(afi, safi, &rn->p);
1007
1008 if (space_remaining < space_needed)
1009 break;
1010
1011 if (stream_empty(s)) {
1012 bgp_packet_set_marker(s, BGP_MSG_UPDATE);
1013 stream_putw(s, 0); /* unfeasible routes length */
1014 } else
1015 first_time = 0;
1016
1017 if (afi == AFI_IP && safi == SAFI_UNICAST
1018 && !peer_cap_enhe(peer, afi, safi))
1019 stream_put_prefix_addpath(s, &rn->p, addpath_encode,
1020 addpath_tx_id);
1021 else {
1022 if (rn->prn)
1023 prd = (struct prefix_rd *)&rn->prn->p;
1024
1025 /* If first time, format the MP_UNREACH header */
1026 if (first_time) {
1027 iana_afi_t pkt_afi;
1028 iana_safi_t pkt_safi;
1029
1030 pkt_afi = afi_int2iana(afi);
1031 pkt_safi = safi_int2iana(safi);
1032
1033 attrlen_pos = stream_get_endp(s);
1034 /* total attr length = 0 for now. reevaluate
1035 * later */
1036 stream_putw(s, 0);
1037 mp_start = stream_get_endp(s);
1038 mplen_pos = bgp_packet_mpunreach_start(s, afi,
1039 safi);
1040 if (bgp_debug_update(NULL, NULL,
1041 subgrp->update_group, 0))
1042 zlog_debug(
1043 "u%" PRIu64 ":s%" PRIu64
1044 " send MP_UNREACH for afi/safi %d/%d",
1045 subgrp->update_group->id,
1046 subgrp->id, pkt_afi, pkt_safi);
1047 }
1048
1049 bgp_packet_mpunreach_prefix(s, &rn->p, afi, safi, prd,
1050 NULL, 0, addpath_encode,
1051 addpath_tx_id, NULL);
1052 }
1053
1054 num_pfx++;
1055
1056 if (bgp_debug_update(NULL, &rn->p, subgrp->update_group, 0)) {
1057 char pfx_buf[BGP_PRD_PATH_STRLEN];
1058
1059 bgp_debug_rdpfxpath2str(afi, safi, prd, &rn->p, NULL, 0,
1060 addpath_encode, addpath_tx_id,
1061 pfx_buf, sizeof(pfx_buf));
1062 zlog_debug("u%" PRIu64 ":s%" PRIu64
1063 " send UPDATE %s -- unreachable",
1064 subgrp->update_group->id, subgrp->id,
1065 pfx_buf);
1066 }
1067
1068 subgrp->scount--;
1069
1070 bgp_adj_out_remove_subgroup(rn, adj, subgrp);
1071 bgp_unlock_node(rn);
1072 }
1073
1074 if (!stream_empty(s)) {
1075 if (afi == AFI_IP && safi == SAFI_UNICAST
1076 && !peer_cap_enhe(peer, afi, safi)) {
1077 unfeasible_len = stream_get_endp(s) - BGP_HEADER_SIZE
1078 - BGP_UNFEASIBLE_LEN;
1079 stream_putw_at(s, BGP_HEADER_SIZE, unfeasible_len);
1080 stream_putw(s, 0);
1081 } else {
1082 /* Set the mp_unreach attr's length */
1083 bgp_packet_mpunreach_end(s, mplen_pos);
1084
1085 /* Set total path attribute length. */
1086 total_attr_len = stream_get_endp(s) - mp_start;
1087 stream_putw_at(s, attrlen_pos, total_attr_len);
1088 }
1089 bgp_packet_set_size(s);
1090 if (bgp_debug_update(NULL, NULL, subgrp->update_group, 0))
1091 zlog_debug("u%" PRIu64 ":s%" PRIu64
1092 " send UPDATE (withdraw) len %zd numpfx %d",
1093 subgrp->update_group->id, subgrp->id,
1094 (stream_get_endp(s) - stream_get_getp(s)),
1095 num_pfx);
1096 pkt = bpacket_queue_add(SUBGRP_PKTQ(subgrp), stream_dup(s),
1097 NULL);
1098 stream_reset(s);
1099 return pkt;
1100 }
1101
1102 return NULL;
1103 }
1104
1105 void subgroup_default_update_packet(struct update_subgroup *subgrp,
1106 struct attr *attr, struct peer *from)
1107 {
1108 struct stream *s;
1109 struct peer *peer;
1110 struct prefix p;
1111 unsigned long pos;
1112 bgp_size_t total_attr_len;
1113 afi_t afi;
1114 safi_t safi;
1115 struct bpacket_attr_vec_arr vecarr;
1116 int addpath_encode = 0;
1117
1118 if (DISABLE_BGP_ANNOUNCE)
1119 return;
1120
1121 if (!subgrp)
1122 return;
1123
1124 peer = SUBGRP_PEER(subgrp);
1125 afi = SUBGRP_AFI(subgrp);
1126 safi = SUBGRP_SAFI(subgrp);
1127 bpacket_attr_vec_arr_reset(&vecarr);
1128 addpath_encode = bgp_addpath_encode_tx(peer, afi, safi);
1129
1130 memset(&p, 0, sizeof(p));
1131 p.family = afi2family(afi);
1132 p.prefixlen = 0;
1133
1134 /* Logging the attribute. */
1135 if (bgp_debug_update(NULL, &p, subgrp->update_group, 0)) {
1136 char attrstr[BUFSIZ];
1137 char buf[PREFIX_STRLEN];
1138 /* ' with addpath ID ' 17
1139 * max strlen of uint32 + 10
1140 * +/- (just in case) + 1
1141 * null terminator + 1
1142 * ============================ 29 */
1143 char tx_id_buf[30];
1144
1145 attrstr[0] = '\0';
1146
1147 bgp_dump_attr(attr, attrstr, BUFSIZ);
1148
1149 if (addpath_encode)
1150 snprintf(tx_id_buf, sizeof(tx_id_buf),
1151 " with addpath ID %u",
1152 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE);
1153 else
1154 tx_id_buf[0] = '\0';
1155
1156 zlog_debug("u%" PRIu64 ":s%" PRIu64 " send UPDATE %s%s %s",
1157 (SUBGRP_UPDGRP(subgrp))->id, subgrp->id,
1158 prefix2str(&p, buf, sizeof(buf)), tx_id_buf,
1159 attrstr);
1160 }
1161
1162 s = stream_new(BGP_MAX_PACKET_SIZE);
1163
1164 /* Make BGP update packet. */
1165 bgp_packet_set_marker(s, BGP_MSG_UPDATE);
1166
1167 /* Unfeasible Routes Length. */
1168 stream_putw(s, 0);
1169
1170 /* Make place for total attribute length. */
1171 pos = stream_get_endp(s);
1172 stream_putw(s, 0);
1173 total_attr_len = bgp_packet_attribute(
1174 NULL, peer, s, attr, &vecarr, &p, afi, safi, from, NULL, NULL,
1175 0, addpath_encode, BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE);
1176
1177 /* Set Total Path Attribute Length. */
1178 stream_putw_at(s, pos, total_attr_len);
1179
1180 /* NLRI set. */
1181 if (p.family == AF_INET && safi == SAFI_UNICAST
1182 && !peer_cap_enhe(peer, afi, safi))
1183 stream_put_prefix_addpath(
1184 s, &p, addpath_encode,
1185 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE);
1186
1187 /* Set size. */
1188 bgp_packet_set_size(s);
1189
1190 (void)bpacket_queue_add(SUBGRP_PKTQ(subgrp), s, &vecarr);
1191 subgroup_trigger_write(subgrp);
1192 }
1193
1194 void subgroup_default_withdraw_packet(struct update_subgroup *subgrp)
1195 {
1196 struct peer *peer;
1197 struct stream *s;
1198 struct prefix p;
1199 unsigned long attrlen_pos = 0;
1200 unsigned long cp;
1201 bgp_size_t unfeasible_len;
1202 bgp_size_t total_attr_len = 0;
1203 size_t mp_start = 0;
1204 size_t mplen_pos = 0;
1205 afi_t afi;
1206 safi_t safi;
1207 int addpath_encode = 0;
1208
1209 if (DISABLE_BGP_ANNOUNCE)
1210 return;
1211
1212 peer = SUBGRP_PEER(subgrp);
1213 afi = SUBGRP_AFI(subgrp);
1214 safi = SUBGRP_SAFI(subgrp);
1215 addpath_encode = bgp_addpath_encode_tx(peer, afi, safi);
1216
1217 memset(&p, 0, sizeof(p));
1218 p.family = afi2family(afi);
1219 p.prefixlen = 0;
1220
1221 if (bgp_debug_update(NULL, &p, subgrp->update_group, 0)) {
1222 char buf[PREFIX_STRLEN];
1223 /* ' with addpath ID ' 17
1224 * max strlen of uint32 + 10
1225 * +/- (just in case) + 1
1226 * null terminator + 1
1227 * ============================ 29 */
1228 char tx_id_buf[30];
1229
1230 if (addpath_encode)
1231 snprintf(tx_id_buf, sizeof(tx_id_buf),
1232 " with addpath ID %u",
1233 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE);
1234
1235 zlog_debug("u%" PRIu64 ":s%" PRIu64
1236 " send UPDATE %s%s -- unreachable",
1237 (SUBGRP_UPDGRP(subgrp))->id, subgrp->id,
1238 prefix2str(&p, buf, sizeof(buf)), tx_id_buf);
1239 }
1240
1241 s = stream_new(BGP_MAX_PACKET_SIZE);
1242
1243 /* Make BGP update packet. */
1244 bgp_packet_set_marker(s, BGP_MSG_UPDATE);
1245
1246 /* Unfeasible Routes Length. */;
1247 cp = stream_get_endp(s);
1248 stream_putw(s, 0);
1249
1250 /* Withdrawn Routes. */
1251 if (p.family == AF_INET && safi == SAFI_UNICAST
1252 && !peer_cap_enhe(peer, afi, safi)) {
1253 stream_put_prefix_addpath(
1254 s, &p, addpath_encode,
1255 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE);
1256
1257 unfeasible_len = stream_get_endp(s) - cp - 2;
1258
1259 /* Set unfeasible len. */
1260 stream_putw_at(s, cp, unfeasible_len);
1261
1262 /* Set total path attribute length. */
1263 stream_putw(s, 0);
1264 } else {
1265 attrlen_pos = stream_get_endp(s);
1266 stream_putw(s, 0);
1267 mp_start = stream_get_endp(s);
1268 mplen_pos = bgp_packet_mpunreach_start(s, afi, safi);
1269 bgp_packet_mpunreach_prefix(
1270 s, &p, afi, safi, NULL, NULL, 0, addpath_encode,
1271 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE, NULL);
1272
1273 /* Set the mp_unreach attr's length */
1274 bgp_packet_mpunreach_end(s, mplen_pos);
1275
1276 /* Set total path attribute length. */
1277 total_attr_len = stream_get_endp(s) - mp_start;
1278 stream_putw_at(s, attrlen_pos, total_attr_len);
1279 }
1280
1281 bgp_packet_set_size(s);
1282
1283 (void)bpacket_queue_add(SUBGRP_PKTQ(subgrp), s, NULL);
1284 subgroup_trigger_write(subgrp);
1285 }
1286
1287 static void
1288 bpacket_vec_arr_inherit_attr_flags(struct bpacket_attr_vec_arr *vecarr,
1289 bpacket_attr_vec_type type,
1290 struct attr *attr)
1291 {
1292 if (CHECK_FLAG(attr->rmap_change_flags,
1293 BATTR_RMAP_NEXTHOP_PEER_ADDRESS))
1294 SET_FLAG(vecarr->entries[BGP_ATTR_VEC_NH].flags,
1295 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS);
1296
1297 if (CHECK_FLAG(attr->rmap_change_flags, BATTR_REFLECTED))
1298 SET_FLAG(vecarr->entries[BGP_ATTR_VEC_NH].flags,
1299 BPKT_ATTRVEC_FLAGS_REFLECTED);
1300
1301 if (CHECK_FLAG(attr->rmap_change_flags, BATTR_RMAP_NEXTHOP_UNCHANGED))
1302 SET_FLAG(vecarr->entries[BGP_ATTR_VEC_NH].flags,
1303 BPKT_ATTRVEC_FLAGS_RMAP_NH_UNCHANGED);
1304
1305 if (CHECK_FLAG(attr->rmap_change_flags, BATTR_RMAP_IPV4_NHOP_CHANGED))
1306 SET_FLAG(vecarr->entries[BGP_ATTR_VEC_NH].flags,
1307 BPKT_ATTRVEC_FLAGS_RMAP_IPV4_NH_CHANGED);
1308
1309 if (CHECK_FLAG(attr->rmap_change_flags,
1310 BATTR_RMAP_IPV6_GLOBAL_NHOP_CHANGED))
1311 SET_FLAG(vecarr->entries[BGP_ATTR_VEC_NH].flags,
1312 BPKT_ATTRVEC_FLAGS_RMAP_IPV6_GNH_CHANGED);
1313
1314 if (CHECK_FLAG(attr->rmap_change_flags,
1315 BATTR_RMAP_IPV6_LL_NHOP_CHANGED))
1316 SET_FLAG(vecarr->entries[BGP_ATTR_VEC_NH].flags,
1317 BPKT_ATTRVEC_FLAGS_RMAP_IPV6_LNH_CHANGED);
1318 }
1319
1320 /* Reset the Attributes vector array. The vector array is used to override
1321 * certain output parameters in the packet for a particular peer
1322 */
1323 void bpacket_attr_vec_arr_reset(struct bpacket_attr_vec_arr *vecarr)
1324 {
1325 int i;
1326
1327 if (!vecarr)
1328 return;
1329
1330 i = 0;
1331 while (i < BGP_ATTR_VEC_MAX) {
1332 vecarr->entries[i].flags = 0;
1333 vecarr->entries[i].offset = 0;
1334 i++;
1335 }
1336 }
1337
1338 /* Setup a particular node entry in the vecarr */
1339 void bpacket_attr_vec_arr_set_vec(struct bpacket_attr_vec_arr *vecarr,
1340 bpacket_attr_vec_type type, struct stream *s,
1341 struct attr *attr)
1342 {
1343 if (!vecarr)
1344 return;
1345 assert(type < BGP_ATTR_VEC_MAX);
1346
1347 SET_FLAG(vecarr->entries[type].flags, BPKT_ATTRVEC_FLAGS_UPDATED);
1348 vecarr->entries[type].offset = stream_get_endp(s);
1349 if (attr)
1350 bpacket_vec_arr_inherit_attr_flags(vecarr, type, attr);
1351 }
FRRouting mirror