2 * bgp_updgrp_packet.c: BGP update group packet handling routines
4 * @copyright Copyright (C) 2014 Cumulus Networks, Inc.
6 * @author Avneesh Sachdev <avneesh@sproute.net>
7 * @author Rajesh Varadarajan <rajesh@sproute.net>
8 * @author Pradosh Mohapatra <pradosh@sproute.net>
10 * This file is part of GNU Zebra.
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
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.
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
34 #include "sockunion.h"
42 #include "workqueue.h"
47 #include "bgpd/bgpd.h"
48 #include "bgpd/bgp_debug.h"
49 #include "bgpd/bgp_fsm.h"
50 #include "bgpd/bgp_route.h"
51 #include "bgpd/bgp_packet.h"
52 #include "bgpd/bgp_advertise.h"
53 #include "bgpd/bgp_updgrp.h"
54 #include "bgpd/bgp_nexthop.h"
55 #include "bgpd/bgp_nht.h"
56 #include "bgpd/bgp_mplsvpn.h"
57 #include "bgpd/bgp_label.h"
66 struct bpacket
*bpacket_alloc()
70 pkt
= (struct bpacket
*)XCALLOC(MTYPE_BGP_PACKET
,
71 sizeof(struct bpacket
));
76 void bpacket_free(struct bpacket
*pkt
)
79 stream_free(pkt
->buffer
);
81 XFREE(MTYPE_BGP_PACKET
, pkt
);
84 void bpacket_queue_init(struct bpacket_queue
*q
)
86 TAILQ_INIT(&(q
->pkts
));
90 * bpacket_queue_sanity_check
92 void bpacket_queue_sanity_check(struct bpacket_queue
__attribute__((__unused__
))
98 pkt
= bpacket_queue_last (q
);
100 assert (!pkt
->buffer
);
103 * Make sure the count of packets is correct.
107 pkt
= bpacket_queue_first (q
);
112 if (num_pkts
> q
->curr_count
)
115 pkt
= TAILQ_NEXT (pkt
, pkt_train
);
118 assert (num_pkts
== q
->curr_count
);
123 * bpacket_queue_add_packet
125 * Internal function of bpacket_queue - and adds a
126 * packet entry to the end of the list.
128 * Users of bpacket_queue should use bpacket_queue_add instead.
130 static void bpacket_queue_add_packet(struct bpacket_queue
*q
,
133 struct bpacket
*last_pkt
;
135 if (TAILQ_EMPTY(&(q
->pkts
)))
136 TAILQ_INSERT_TAIL(&(q
->pkts
), pkt
, pkt_train
);
138 last_pkt
= bpacket_queue_last(q
);
139 TAILQ_INSERT_AFTER(&(q
->pkts
), last_pkt
, pkt
, pkt_train
);
142 if (q
->hwm_count
< q
->curr_count
)
143 q
->hwm_count
= q
->curr_count
;
147 * Adds a packet to the bpacket_queue.
149 * The stream passed is consumed by this function. So, the caller should
150 * not free or use the stream after
151 * invoking this function.
153 struct bpacket
*bpacket_queue_add(struct bpacket_queue
*q
, struct stream
*s
,
154 struct bpacket_attr_vec_arr
*vecarrp
)
157 struct bpacket
*last_pkt
;
160 pkt
= bpacket_alloc();
161 if (TAILQ_EMPTY(&(q
->pkts
))) {
165 memcpy(&pkt
->arr
, vecarrp
,
166 sizeof(struct bpacket_attr_vec_arr
));
168 bpacket_attr_vec_arr_reset(&pkt
->arr
);
169 bpacket_queue_add_packet(q
, pkt
);
170 bpacket_queue_sanity_check(q
);
175 * Fill in the new information into the current sentinel and create a
178 bpacket_queue_sanity_check(q
);
179 last_pkt
= bpacket_queue_last(q
);
180 assert(last_pkt
->buffer
== NULL
);
181 last_pkt
->buffer
= s
;
183 memcpy(&last_pkt
->arr
, vecarrp
,
184 sizeof(struct bpacket_attr_vec_arr
));
186 bpacket_attr_vec_arr_reset(&last_pkt
->arr
);
188 pkt
->ver
= last_pkt
->ver
;
190 bpacket_queue_add_packet(q
, pkt
);
192 bpacket_queue_sanity_check(q
);
196 struct bpacket
*bpacket_queue_first(struct bpacket_queue
*q
)
198 return (TAILQ_FIRST(&(q
->pkts
)));
201 struct bpacket
*bpacket_queue_last(struct bpacket_queue
*q
)
203 return TAILQ_LAST(&(q
->pkts
), pkt_queue
);
206 struct bpacket
*bpacket_queue_remove(struct bpacket_queue
*q
)
208 struct bpacket
*first
;
210 first
= bpacket_queue_first(q
);
212 TAILQ_REMOVE(&(q
->pkts
), first
, pkt_train
);
218 unsigned int bpacket_queue_length(struct bpacket_queue
*q
)
220 return q
->curr_count
- 1;
223 unsigned int bpacket_queue_hwm_length(struct bpacket_queue
*q
)
225 return q
->hwm_count
- 1;
228 int bpacket_queue_is_full(struct bgp
*bgp
, struct bpacket_queue
*q
)
230 if (q
->curr_count
>= bgp
->default_subgroup_pkt_queue_max
)
235 void bpacket_add_peer(struct bpacket
*pkt
, struct peer_af
*paf
)
240 LIST_INSERT_HEAD(&(pkt
->peers
), paf
, pkt_train
);
241 paf
->next_pkt_to_send
= pkt
;
245 * bpacket_queue_cleanup
247 void bpacket_queue_cleanup(struct bpacket_queue
*q
)
251 while ((pkt
= bpacket_queue_remove(q
))) {
257 * bpacket_queue_compact
259 * Delete packets that do not need to be transmitted to any peer from
262 * @return the number of packets deleted.
264 static int bpacket_queue_compact(struct bpacket_queue
*q
)
267 struct bpacket
*pkt
, *removed_pkt
;
272 pkt
= bpacket_queue_first(q
);
277 * Don't delete the sentinel.
282 if (!LIST_EMPTY(&(pkt
->peers
)))
285 removed_pkt
= bpacket_queue_remove(q
);
286 assert(pkt
== removed_pkt
);
287 bpacket_free(removed_pkt
);
292 bpacket_queue_sanity_check(q
);
296 void bpacket_queue_advance_peer(struct peer_af
*paf
)
299 struct bpacket
*old_pkt
;
301 old_pkt
= paf
->next_pkt_to_send
;
302 if (old_pkt
->buffer
== NULL
)
303 /* Already at end of list */
306 LIST_REMOVE(paf
, pkt_train
);
307 pkt
= TAILQ_NEXT(old_pkt
, pkt_train
);
308 bpacket_add_peer(pkt
, paf
);
310 if (!bpacket_queue_compact(PAF_PKTQ(paf
)))
314 * Deleted one or more packets. Check if we can now merge this
315 * peer's subgroup into another subgroup.
317 update_subgroup_check_merge(paf
->subgroup
, "advanced peer in queue");
321 * bpacket_queue_remove_peer
323 * Remove the peer from the packet queue of the subgroup it belongs
326 void bpacket_queue_remove_peer(struct peer_af
*paf
)
328 struct bpacket_queue
*q
;
335 LIST_REMOVE(paf
, pkt_train
);
336 paf
->next_pkt_to_send
= NULL
;
338 bpacket_queue_compact(q
);
341 unsigned int bpacket_queue_virtual_length(struct peer_af
*paf
)
344 struct bpacket
*last
;
345 struct bpacket_queue
*q
;
347 pkt
= paf
->next_pkt_to_send
;
348 if (!pkt
|| (pkt
->buffer
== NULL
))
349 /* Already at end of list */
353 if (TAILQ_EMPTY(&(q
->pkts
)))
356 last
= TAILQ_LAST(&(q
->pkts
), pkt_queue
);
357 if (last
->ver
>= pkt
->ver
)
358 return last
->ver
- pkt
->ver
;
360 /* sequence # rolled over */
361 return (UINT_MAX
- pkt
->ver
+ 1) + last
->ver
;
365 * Dump the bpacket queue
367 void bpacket_queue_show_vty(struct bpacket_queue
*q
, struct vty
*vty
)
372 pkt
= bpacket_queue_first(q
);
374 vty_out(vty
, " Packet %p ver %u buffer %p\n", pkt
, pkt
->ver
,
377 LIST_FOREACH (paf
, &(pkt
->peers
), pkt_train
) {
378 vty_out(vty
, " - %s\n", paf
->peer
->host
);
380 pkt
= bpacket_next(pkt
);
385 struct stream
*bpacket_reformat_for_peer(struct bpacket
*pkt
,
388 struct stream
*s
= NULL
;
389 bpacket_attr_vec
*vec
;
394 s
= stream_dup(pkt
->buffer
);
395 peer
= PAF_PEER(paf
);
397 vec
= &pkt
->arr
.entries
[BGP_ATTR_VEC_NH
];
398 if (CHECK_FLAG(vec
->flags
, BPKT_ATTRVEC_FLAGS_UPDATED
)) {
400 afi_t nhafi
= AFI_MAX
; /* NH AFI is based on nhlen! */
401 int route_map_sets_nh
;
402 nhlen
= stream_getc_from(s
, vec
->offset
);
403 if (peer_cap_enhe(peer
, paf
->afi
, paf
->safi
))
406 nhafi
= BGP_NEXTHOP_AFI_FROM_NHLEN(nhlen
);
408 if (nhafi
== AFI_IP
) {
409 struct in_addr v4nh
, *mod_v4nh
;
411 size_t offset_nh
= vec
->offset
+ 1;
416 BPKT_ATTRVEC_FLAGS_RMAP_IPV4_NH_CHANGED
)
419 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS
));
422 case BGP_ATTR_NHLEN_IPV4
:
424 case BGP_ATTR_NHLEN_VPNV4
:
428 /* TODO: handle IPv6 nexthops */
430 "%s: %s: invalid MP nexthop length (AFI IP): %u",
431 __func__
, peer
->host
, nhlen
);
436 stream_get_from(&v4nh
, s
, offset_nh
, IPV4_MAX_BYTELEN
);
440 * If route-map has set the nexthop, that is always
442 * specified as peer-address, the peering address is
444 * Otherwise, if NH is unavailable from attribute, the
446 * is picked up; the "NH unavailable" case also covers
448 * and some other scenarios -- see
449 * subgroup_announce_check(). In
450 * all other cases, use the nexthop carried in the
452 * it is EBGP non-multiaccess and there is no
453 * next-hop-unchanged setting.
454 * Note: It is assumed route-map cannot set the nexthop
458 if (route_map_sets_nh
) {
461 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS
)) {
462 mod_v4nh
= &peer
->nexthop
.v4
;
465 } else if (!v4nh
.s_addr
) {
466 mod_v4nh
= &peer
->nexthop
.v4
;
469 peer
->sort
== BGP_PEER_EBGP
470 && paf
->safi
!= SAFI_EVPN
471 && (bgp_multiaccess_check_v4(v4nh
, peer
) == 0)
474 BPKT_ATTRVEC_FLAGS_RMAP_NH_UNCHANGED
)
475 && !peer_af_flag_check(
476 peer
, nhafi
, paf
->safi
,
477 PEER_FLAG_NEXTHOP_UNCHANGED
)) {
478 /* NOTE: not handling case where NH has new AFI
480 mod_v4nh
= &peer
->nexthop
.v4
;
484 if (nh_modified
) /* allow for VPN RD */
485 stream_put_in_addr_at(s
, offset_nh
, mod_v4nh
);
487 if (bgp_debug_update(peer
, NULL
, NULL
, 0))
488 zlog_debug("u%" PRIu64
":s%" PRIu64
489 " %s send UPDATE w/ nexthop %s%s",
490 PAF_SUBGRP(paf
)->update_group
->id
,
491 PAF_SUBGRP(paf
)->id
, peer
->host
,
492 inet_ntoa(*mod_v4nh
),
493 (nhlen
== 12 ? " and RD" : ""));
494 } else if (nhafi
== AFI_IP6
) {
495 struct in6_addr v6nhglobal
, *mod_v6nhg
;
496 struct in6_addr v6nhlocal
, *mod_v6nhl
;
497 int gnh_modified
, lnh_modified
;
498 size_t offset_nhglobal
= vec
->offset
+ 1;
499 size_t offset_nhlocal
= vec
->offset
+ 1;
501 gnh_modified
= lnh_modified
= 0;
502 mod_v6nhg
= &v6nhglobal
;
503 mod_v6nhl
= &v6nhlocal
;
508 BPKT_ATTRVEC_FLAGS_RMAP_IPV6_GNH_CHANGED
)
511 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS
));
514 * The logic here is rather similar to that for IPv4,
516 * additional work being to handle 1 or 2 nexthops.
518 * party nexthop is not propagated for EBGP right now.
521 case BGP_ATTR_NHLEN_IPV6_GLOBAL
:
523 case BGP_ATTR_NHLEN_IPV6_GLOBAL_AND_LL
:
524 offset_nhlocal
+= IPV6_MAX_BYTELEN
;
526 case BGP_ATTR_NHLEN_VPNV6_GLOBAL
:
527 offset_nhglobal
+= 8;
529 case BGP_ATTR_NHLEN_VPNV6_GLOBAL_AND_LL
:
530 offset_nhglobal
+= 8;
531 offset_nhlocal
+= 8 * 2 + IPV6_MAX_BYTELEN
;
534 /* TODO: handle IPv4 nexthops */
536 "%s: %s: invalid MP nexthop length (AFI IP6): %u",
537 __func__
, peer
->host
, nhlen
);
542 stream_get_from(&v6nhglobal
, s
, offset_nhglobal
,
544 if (route_map_sets_nh
) {
547 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS
)) {
548 mod_v6nhg
= &peer
->nexthop
.v6_global
;
551 } else if (IN6_IS_ADDR_UNSPECIFIED(&v6nhglobal
)) {
552 mod_v6nhg
= &peer
->nexthop
.v6_global
;
555 peer
->sort
== BGP_PEER_EBGP
558 BPKT_ATTRVEC_FLAGS_RMAP_NH_UNCHANGED
)
559 && !peer_af_flag_check(
560 peer
, nhafi
, paf
->safi
,
561 PEER_FLAG_NEXTHOP_UNCHANGED
)) {
562 /* NOTE: not handling case where NH has new AFI
564 mod_v6nhg
= &peer
->nexthop
.v6_global
;
569 if (nhlen
== BGP_ATTR_NHLEN_IPV6_GLOBAL_AND_LL
570 || nhlen
== BGP_ATTR_NHLEN_VPNV6_GLOBAL_AND_LL
) {
571 stream_get_from(&v6nhlocal
, s
, offset_nhlocal
,
573 if (IN6_IS_ADDR_UNSPECIFIED(&v6nhlocal
)) {
574 mod_v6nhl
= &peer
->nexthop
.v6_local
;
580 stream_put_in6_addr_at(s
, offset_nhglobal
,
583 stream_put_in6_addr_at(s
, offset_nhlocal
,
586 if (bgp_debug_update(peer
, NULL
, NULL
, 0)) {
587 if (nhlen
== 32 || nhlen
== 48)
589 "u%" PRIu64
":s%" PRIu64
590 " %s send UPDATE w/ mp_nexthops %s, %s%s",
593 PAF_SUBGRP(paf
)->id
, peer
->host
,
594 inet_ntop(AF_INET6
, mod_v6nhg
,
596 inet_ntop(AF_INET6
, mod_v6nhl
,
598 (nhlen
== 48 ? " and RD" : ""));
601 "u%" PRIu64
":s%" PRIu64
602 " %s send UPDATE w/ mp_nexthop %s%s",
605 PAF_SUBGRP(paf
)->id
, peer
->host
,
606 inet_ntop(AF_INET6
, mod_v6nhg
,
608 (nhlen
== 24 ? " and RD" : ""));
610 } else if (paf
->afi
== AFI_L2VPN
) {
611 struct in_addr v4nh
, *mod_v4nh
;
614 stream_get_from(&v4nh
, s
, vec
->offset
+ 1, 4);
617 /* No route-map changes allowed for EVPN nexthops. */
619 mod_v4nh
= &peer
->nexthop
.v4
;
624 stream_put_in_addr_at(s
, vec
->offset
+ 1,
627 if (bgp_debug_update(peer
, NULL
, NULL
, 0))
628 zlog_debug("u%" PRIu64
":s%" PRIu64
629 " %s send UPDATE w/ nexthop %s",
630 PAF_SUBGRP(paf
)->update_group
->id
,
631 PAF_SUBGRP(paf
)->id
, peer
->host
,
632 inet_ntoa(*mod_v4nh
));
636 bgp_packet_add(peer
, s
);
641 * Update the vecarr offsets to go beyond 'pos' bytes, i.e. add 'pos'
644 static void bpacket_attr_vec_arr_update(struct bpacket_attr_vec_arr
*vecarr
,
652 for (i
= 0; i
< BGP_ATTR_VEC_MAX
; i
++)
653 vecarr
->entries
[i
].offset
+= pos
;
657 * Return if there are packets to build for this subgroup.
659 int subgroup_packets_to_build(struct update_subgroup
*subgrp
)
661 struct bgp_advertise
*adv
;
666 adv
= BGP_ADV_FIFO_HEAD(&subgrp
->sync
->withdraw
);
670 adv
= BGP_ADV_FIFO_HEAD(&subgrp
->sync
->update
);
677 /* Make BGP update packet. */
678 struct bpacket
*subgroup_update_packet(struct update_subgroup
*subgrp
)
680 struct bpacket_attr_vec_arr vecarr
;
684 struct stream
*snlri
;
685 struct stream
*packet
;
686 struct bgp_adj_out
*adj
;
687 struct bgp_advertise
*adv
;
688 struct bgp_node
*rn
= NULL
;
689 struct bgp_info
*binfo
= NULL
;
690 bgp_size_t total_attr_len
= 0;
691 unsigned long attrlen_pos
= 0;
692 size_t mpattrlen_pos
= 0;
693 size_t mpattr_pos
= 0;
696 int space_remaining
= 0;
697 int space_needed
= 0;
698 char send_attr_str
[BUFSIZ
];
699 int send_attr_printed
= 0;
701 int addpath_encode
= 0;
702 int addpath_overhead
= 0;
703 u_int32_t addpath_tx_id
= 0;
704 struct prefix_rd
*prd
= NULL
;
705 mpls_label_t label
= MPLS_INVALID_LABEL
;
710 if (bpacket_queue_is_full(SUBGRP_INST(subgrp
), SUBGRP_PKTQ(subgrp
)))
713 peer
= SUBGRP_PEER(subgrp
);
714 afi
= SUBGRP_AFI(subgrp
);
715 safi
= SUBGRP_SAFI(subgrp
);
718 snlri
= subgrp
->scratch
;
721 bpacket_attr_vec_arr_reset(&vecarr
);
723 addpath_encode
= bgp_addpath_encode_tx(peer
, afi
, safi
);
724 addpath_overhead
= addpath_encode
? BGP_ADDPATH_ID_LEN
: 0;
726 adv
= BGP_ADV_FIFO_HEAD(&subgrp
->sync
->update
);
731 addpath_tx_id
= adj
->addpath_tx_id
;
734 space_remaining
= STREAM_CONCAT_REMAIN(s
, snlri
, STREAM_SIZE(s
))
735 - BGP_MAX_PACKET_SIZE_OVERFLOW
;
736 space_needed
= BGP_NLRI_LENGTH
+ addpath_overhead
+
737 bgp_packet_mpattr_prefix_size(afi
, safi
, &rn
->p
);
739 /* When remaining space can't include NLRI and it's length. */
740 if (space_remaining
< space_needed
)
743 /* If packet is empty, set attribute. */
744 if (stream_empty(s
)) {
745 struct peer
*from
= NULL
;
750 /* 1: Write the BGP message header - 16 bytes marker, 2
752 * one byte message type.
754 bgp_packet_set_marker(s
, BGP_MSG_UPDATE
);
756 /* 2: withdrawn routes length */
759 /* 3: total attributes length - attrlen_pos stores the
761 attrlen_pos
= stream_get_endp(s
);
764 /* 4: if there is MP_REACH_NLRI attribute, that should
766 * attribute, according to
767 * draft-ietf-idr-error-handling. Save the
770 mpattr_pos
= stream_get_endp(s
);
772 /* 5: Encode all the attributes, except MP_REACH_NLRI
774 total_attr_len
= bgp_packet_attribute(
775 NULL
, peer
, s
, adv
->baa
->attr
, &vecarr
, NULL
,
776 afi
, safi
, from
, NULL
, NULL
, 0, 0);
779 STREAM_CONCAT_REMAIN(s
, snlri
, STREAM_SIZE(s
))
780 - BGP_MAX_PACKET_SIZE_OVERFLOW
;
781 space_needed
= BGP_NLRI_LENGTH
+ addpath_overhead
+
782 bgp_packet_mpattr_prefix_size(afi
, safi
,
785 /* If the attributes alone do not leave any room for
788 if (space_remaining
< space_needed
) {
790 "u%" PRIu64
":s%" PRIu64
791 " attributes too long, cannot send UPDATE",
792 subgrp
->update_group
->id
, subgrp
->id
);
794 /* Flush the FIFO update queue */
796 adv
= bgp_advertise_clean_subgroup(
801 if (BGP_DEBUG(update
, UPDATE_OUT
)
802 || BGP_DEBUG(update
, UPDATE_PREFIX
)) {
803 memset(send_attr_str
, 0, BUFSIZ
);
804 send_attr_printed
= 0;
805 bgp_dump_attr(adv
->baa
->attr
, send_attr_str
,
810 if ((afi
== AFI_IP
&& safi
== SAFI_UNICAST
)
811 && !peer_cap_enhe(peer
, afi
, safi
))
812 stream_put_prefix_addpath(s
, &rn
->p
, addpath_encode
,
815 /* Encode the prefix in MP_REACH_NLRI attribute */
817 prd
= (struct prefix_rd
*)&rn
->prn
->p
;
819 if (safi
== SAFI_LABELED_UNICAST
)
820 label
= bgp_adv_label(rn
, binfo
, peer
, afi
,
822 else if (binfo
&& binfo
->extra
)
823 label
= binfo
->extra
->label
;
825 if (stream_empty(snlri
))
826 mpattrlen_pos
= bgp_packet_mpattr_start(
827 snlri
, peer
, afi
, safi
, &vecarr
,
830 bgp_packet_mpattr_prefix(snlri
, afi
, safi
, &rn
->p
, prd
,
831 &label
, addpath_encode
,
832 addpath_tx_id
, adv
->baa
->attr
);
837 if (bgp_debug_update(NULL
, &rn
->p
, subgrp
->update_group
, 0)) {
838 char pfx_buf
[BGP_PRD_PATH_STRLEN
];
840 if (!send_attr_printed
) {
841 zlog_debug("u%" PRIu64
":s%" PRIu64
842 " send UPDATE w/ attr: %s",
843 subgrp
->update_group
->id
, subgrp
->id
,
845 if (!stream_empty(snlri
)) {
847 iana_safi_t pkt_safi
;
849 pkt_afi
= afi_int2iana(afi
);
850 pkt_safi
= safi_int2iana(safi
);
852 "u%" PRIu64
":s%" PRIu64
853 " send MP_REACH for afi/safi %d/%d",
854 subgrp
->update_group
->id
,
855 subgrp
->id
, pkt_afi
, pkt_safi
);
858 send_attr_printed
= 1;
861 bgp_debug_rdpfxpath2str(afi
, safi
, prd
, &rn
->p
, &label
,
862 addpath_encode
, addpath_tx_id
,
863 pfx_buf
, sizeof(pfx_buf
));
864 zlog_debug("u%" PRIu64
":s%" PRIu64
" send UPDATE %s",
865 subgrp
->update_group
->id
, subgrp
->id
,
869 /* Synchnorize attribute. */
871 bgp_attr_unintern(&adj
->attr
);
875 adj
->attr
= bgp_attr_intern(adv
->baa
->attr
);
877 adv
= bgp_advertise_clean_subgroup(subgrp
, adj
);
880 if (!stream_empty(s
)) {
881 if (!stream_empty(snlri
)) {
882 bgp_packet_mpattr_end(snlri
, mpattrlen_pos
);
883 total_attr_len
+= stream_get_endp(snlri
);
886 /* set the total attribute length correctly */
887 stream_putw_at(s
, attrlen_pos
, total_attr_len
);
889 if (!stream_empty(snlri
)) {
890 packet
= stream_dupcat(s
, snlri
, mpattr_pos
);
891 bpacket_attr_vec_arr_update(&vecarr
, mpattr_pos
);
893 packet
= stream_dup(s
);
894 bgp_packet_set_size(packet
);
895 if (bgp_debug_update(NULL
, NULL
, subgrp
->update_group
, 0))
896 zlog_debug("u%" PRIu64
":s%" PRIu64
897 " send UPDATE len %zd numpfx %d",
898 subgrp
->update_group
->id
, subgrp
->id
,
899 (stream_get_endp(packet
)
900 - stream_get_getp(packet
)),
902 pkt
= bpacket_queue_add(SUBGRP_PKTQ(subgrp
), packet
, &vecarr
);
910 /* Make BGP withdraw packet. */
912 16-octet marker | 2-octet length | 1-octet type |
913 2-octet withdrawn route length | withdrawn prefixes | 2-octet attrlen (=0)
915 /* For other afi/safis:
916 16-octet marker | 2-octet length | 1-octet type |
917 2-octet withdrawn route length (=0) | 2-octet attrlen |
918 mp_unreach attr type | attr len | afi | safi | withdrawn prefixes
920 struct bpacket
*subgroup_withdraw_packet(struct update_subgroup
*subgrp
)
924 struct bgp_adj_out
*adj
;
925 struct bgp_advertise
*adv
;
928 bgp_size_t unfeasible_len
;
929 bgp_size_t total_attr_len
;
931 size_t attrlen_pos
= 0;
932 size_t mplen_pos
= 0;
933 u_char first_time
= 1;
936 int space_remaining
= 0;
937 int space_needed
= 0;
939 int addpath_encode
= 0;
940 int addpath_overhead
= 0;
941 u_int32_t addpath_tx_id
= 0;
942 struct prefix_rd
*prd
= NULL
;
948 if (bpacket_queue_is_full(SUBGRP_INST(subgrp
), SUBGRP_PKTQ(subgrp
)))
951 peer
= SUBGRP_PEER(subgrp
);
952 afi
= SUBGRP_AFI(subgrp
);
953 safi
= SUBGRP_SAFI(subgrp
);
956 addpath_encode
= bgp_addpath_encode_tx(peer
, afi
, safi
);
957 addpath_overhead
= addpath_encode
? BGP_ADDPATH_ID_LEN
: 0;
959 while ((adv
= BGP_ADV_FIFO_HEAD(&subgrp
->sync
->withdraw
)) != NULL
) {
963 addpath_tx_id
= adj
->addpath_tx_id
;
966 STREAM_REMAIN(s
) - BGP_MAX_PACKET_SIZE_OVERFLOW
;
968 BGP_NLRI_LENGTH
+ addpath_overhead
+ BGP_TOTAL_ATTR_LEN
969 + bgp_packet_mpattr_prefix_size(afi
, safi
, &rn
->p
);
971 if (space_remaining
< space_needed
)
974 if (stream_empty(s
)) {
975 bgp_packet_set_marker(s
, BGP_MSG_UPDATE
);
976 stream_putw(s
, 0); /* unfeasible routes length */
980 if (afi
== AFI_IP
&& safi
== SAFI_UNICAST
981 && !peer_cap_enhe(peer
, afi
, safi
))
982 stream_put_prefix_addpath(s
, &rn
->p
, addpath_encode
,
986 prd
= (struct prefix_rd
*)&rn
->prn
->p
;
988 /* If first time, format the MP_UNREACH header */
991 iana_safi_t pkt_safi
;
993 pkt_afi
= afi_int2iana(afi
);
994 pkt_safi
= safi_int2iana(safi
);
996 attrlen_pos
= stream_get_endp(s
);
997 /* total attr length = 0 for now. reevaluate
1000 mp_start
= stream_get_endp(s
);
1001 mplen_pos
= bgp_packet_mpunreach_start(s
, afi
,
1003 if (bgp_debug_update(NULL
, NULL
,
1004 subgrp
->update_group
, 0))
1006 "u%" PRIu64
":s%" PRIu64
1007 " send MP_UNREACH for afi/safi %d/%d",
1008 subgrp
->update_group
->id
,
1009 subgrp
->id
, pkt_afi
, pkt_safi
);
1012 bgp_packet_mpunreach_prefix(s
, &rn
->p
, afi
, safi
, prd
,
1013 NULL
, addpath_encode
,
1014 addpath_tx_id
, NULL
);
1019 if (bgp_debug_update(NULL
, &rn
->p
, subgrp
->update_group
, 0)) {
1020 char pfx_buf
[BGP_PRD_PATH_STRLEN
];
1022 bgp_debug_rdpfxpath2str(afi
, safi
, prd
, &rn
->p
, NULL
,
1023 addpath_encode
, addpath_tx_id
,
1024 pfx_buf
, sizeof(pfx_buf
));
1025 zlog_debug("u%" PRIu64
":s%" PRIu64
1026 " send UPDATE %s -- unreachable",
1027 subgrp
->update_group
->id
, subgrp
->id
,
1033 bgp_adj_out_remove_subgroup(rn
, adj
, subgrp
);
1034 bgp_unlock_node(rn
);
1037 if (!stream_empty(s
)) {
1038 if (afi
== AFI_IP
&& safi
== SAFI_UNICAST
1039 && !peer_cap_enhe(peer
, afi
, safi
)) {
1040 unfeasible_len
= stream_get_endp(s
) - BGP_HEADER_SIZE
1041 - BGP_UNFEASIBLE_LEN
;
1042 stream_putw_at(s
, BGP_HEADER_SIZE
, unfeasible_len
);
1045 /* Set the mp_unreach attr's length */
1046 bgp_packet_mpunreach_end(s
, mplen_pos
);
1048 /* Set total path attribute length. */
1049 total_attr_len
= stream_get_endp(s
) - mp_start
;
1050 stream_putw_at(s
, attrlen_pos
, total_attr_len
);
1052 bgp_packet_set_size(s
);
1053 if (bgp_debug_update(NULL
, NULL
, subgrp
->update_group
, 0))
1054 zlog_debug("u%" PRIu64
":s%" PRIu64
1055 " send UPDATE (withdraw) len %zd numpfx %d",
1056 subgrp
->update_group
->id
, subgrp
->id
,
1057 (stream_get_endp(s
) - stream_get_getp(s
)),
1059 pkt
= bpacket_queue_add(SUBGRP_PKTQ(subgrp
), stream_dup(s
),
1068 void subgroup_default_update_packet(struct update_subgroup
*subgrp
,
1069 struct attr
*attr
, struct peer
*from
)
1075 bgp_size_t total_attr_len
;
1078 struct bpacket_attr_vec_arr vecarr
;
1079 int addpath_encode
= 0;
1081 if (DISABLE_BGP_ANNOUNCE
)
1087 peer
= SUBGRP_PEER(subgrp
);
1088 afi
= SUBGRP_AFI(subgrp
);
1089 safi
= SUBGRP_SAFI(subgrp
);
1090 bpacket_attr_vec_arr_reset(&vecarr
);
1091 addpath_encode
= bgp_addpath_encode_tx(peer
, afi
, safi
);
1093 memset(&p
, 0, sizeof(p
));
1094 p
.family
= afi2family(afi
);
1097 /* Logging the attribute. */
1098 if (bgp_debug_update(NULL
, &p
, subgrp
->update_group
, 0)) {
1099 char attrstr
[BUFSIZ
];
1100 char buf
[PREFIX_STRLEN
];
1101 /* ' with addpath ID ' 17
1102 * max strlen of uint32 + 10
1103 * +/- (just in case) + 1
1104 * null terminator + 1
1105 * ============================ 29 */
1110 bgp_dump_attr(attr
, attrstr
, BUFSIZ
);
1113 snprintf(tx_id_buf
, sizeof(tx_id_buf
),
1114 " with addpath ID %u",
1115 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
1117 zlog_debug("u%" PRIu64
":s%" PRIu64
" send UPDATE %s%s %s",
1118 (SUBGRP_UPDGRP(subgrp
))->id
, subgrp
->id
,
1119 prefix2str(&p
, buf
, sizeof(buf
)), tx_id_buf
,
1123 s
= stream_new(BGP_MAX_PACKET_SIZE
);
1125 /* Make BGP update packet. */
1126 bgp_packet_set_marker(s
, BGP_MSG_UPDATE
);
1128 /* Unfeasible Routes Length. */
1131 /* Make place for total attribute length. */
1132 pos
= stream_get_endp(s
);
1134 total_attr_len
= bgp_packet_attribute(
1135 NULL
, peer
, s
, attr
, &vecarr
, &p
, afi
, safi
, from
, NULL
, NULL
,
1136 addpath_encode
, BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
1138 /* Set Total Path Attribute Length. */
1139 stream_putw_at(s
, pos
, total_attr_len
);
1142 if (p
.family
== AF_INET
&& safi
== SAFI_UNICAST
1143 && !peer_cap_enhe(peer
, afi
, safi
))
1144 stream_put_prefix_addpath(
1145 s
, &p
, addpath_encode
,
1146 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
1149 bgp_packet_set_size(s
);
1151 (void)bpacket_queue_add(SUBGRP_PKTQ(subgrp
), s
, &vecarr
);
1152 subgroup_trigger_write(subgrp
);
1155 void subgroup_default_withdraw_packet(struct update_subgroup
*subgrp
)
1160 unsigned long attrlen_pos
= 0;
1162 bgp_size_t unfeasible_len
;
1163 bgp_size_t total_attr_len
= 0;
1164 size_t mp_start
= 0;
1165 size_t mplen_pos
= 0;
1168 int addpath_encode
= 0;
1170 if (DISABLE_BGP_ANNOUNCE
)
1173 peer
= SUBGRP_PEER(subgrp
);
1174 afi
= SUBGRP_AFI(subgrp
);
1175 safi
= SUBGRP_SAFI(subgrp
);
1176 addpath_encode
= bgp_addpath_encode_tx(peer
, afi
, safi
);
1178 memset(&p
, 0, sizeof(p
));
1179 p
.family
= afi2family(afi
);
1182 if (bgp_debug_update(NULL
, &p
, subgrp
->update_group
, 0)) {
1183 char buf
[PREFIX_STRLEN
];
1184 /* ' with addpath ID ' 17
1185 * max strlen of uint32 + 10
1186 * +/- (just in case) + 1
1187 * null terminator + 1
1188 * ============================ 29 */
1192 snprintf(tx_id_buf
, sizeof(tx_id_buf
),
1193 " with addpath ID %u",
1194 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
1196 zlog_debug("u%" PRIu64
":s%" PRIu64
1197 " send UPDATE %s%s -- unreachable",
1198 (SUBGRP_UPDGRP(subgrp
))->id
, subgrp
->id
,
1199 prefix2str(&p
, buf
, sizeof(buf
)), tx_id_buf
);
1202 s
= stream_new(BGP_MAX_PACKET_SIZE
);
1204 /* Make BGP update packet. */
1205 bgp_packet_set_marker(s
, BGP_MSG_UPDATE
);
1207 /* Unfeasible Routes Length. */;
1208 cp
= stream_get_endp(s
);
1211 /* Withdrawn Routes. */
1212 if (p
.family
== AF_INET
&& safi
== SAFI_UNICAST
1213 && !peer_cap_enhe(peer
, afi
, safi
)) {
1214 stream_put_prefix_addpath(
1215 s
, &p
, addpath_encode
,
1216 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
1218 unfeasible_len
= stream_get_endp(s
) - cp
- 2;
1220 /* Set unfeasible len. */
1221 stream_putw_at(s
, cp
, unfeasible_len
);
1223 /* Set total path attribute length. */
1226 attrlen_pos
= stream_get_endp(s
);
1228 mp_start
= stream_get_endp(s
);
1229 mplen_pos
= bgp_packet_mpunreach_start(s
, afi
, safi
);
1230 bgp_packet_mpunreach_prefix(
1231 s
, &p
, afi
, safi
, NULL
, NULL
, addpath_encode
,
1232 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
, NULL
);
1234 /* Set the mp_unreach attr's length */
1235 bgp_packet_mpunreach_end(s
, mplen_pos
);
1237 /* Set total path attribute length. */
1238 total_attr_len
= stream_get_endp(s
) - mp_start
;
1239 stream_putw_at(s
, attrlen_pos
, total_attr_len
);
1242 bgp_packet_set_size(s
);
1244 (void)bpacket_queue_add(SUBGRP_PKTQ(subgrp
), s
, NULL
);
1245 subgroup_trigger_write(subgrp
);
1249 bpacket_vec_arr_inherit_attr_flags(struct bpacket_attr_vec_arr
*vecarr
,
1250 bpacket_attr_vec_type type
,
1253 if (CHECK_FLAG(attr
->rmap_change_flags
,
1254 BATTR_RMAP_NEXTHOP_PEER_ADDRESS
))
1255 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1256 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS
);
1258 if (CHECK_FLAG(attr
->rmap_change_flags
, BATTR_REFLECTED
))
1259 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1260 BPKT_ATTRVEC_FLAGS_REFLECTED
);
1262 if (CHECK_FLAG(attr
->rmap_change_flags
, BATTR_RMAP_NEXTHOP_UNCHANGED
))
1263 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1264 BPKT_ATTRVEC_FLAGS_RMAP_NH_UNCHANGED
);
1266 if (CHECK_FLAG(attr
->rmap_change_flags
, BATTR_RMAP_IPV4_NHOP_CHANGED
))
1267 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1268 BPKT_ATTRVEC_FLAGS_RMAP_IPV4_NH_CHANGED
);
1270 if (CHECK_FLAG(attr
->rmap_change_flags
,
1271 BATTR_RMAP_IPV6_GLOBAL_NHOP_CHANGED
))
1272 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1273 BPKT_ATTRVEC_FLAGS_RMAP_IPV6_GNH_CHANGED
);
1275 if (CHECK_FLAG(attr
->rmap_change_flags
,
1276 BATTR_RMAP_IPV6_LL_NHOP_CHANGED
))
1277 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1278 BPKT_ATTRVEC_FLAGS_RMAP_IPV6_LNH_CHANGED
);
1281 /* Reset the Attributes vector array. The vector array is used to override
1282 * certain output parameters in the packet for a particular peer
1284 void bpacket_attr_vec_arr_reset(struct bpacket_attr_vec_arr
*vecarr
)
1292 while (i
< BGP_ATTR_VEC_MAX
) {
1293 vecarr
->entries
[i
].flags
= 0;
1294 vecarr
->entries
[i
].offset
= 0;
1299 /* Setup a particular node entry in the vecarr */
1300 void bpacket_attr_vec_arr_set_vec(struct bpacket_attr_vec_arr
*vecarr
,
1301 bpacket_attr_vec_type type
, struct stream
*s
,
1306 assert(type
< BGP_ATTR_VEC_MAX
);
1308 SET_FLAG(vecarr
->entries
[type
].flags
, BPKT_ATTRVEC_FLAGS_UPDATED
);
1309 vecarr
->entries
[type
].offset
= stream_get_endp(s
);
1311 bpacket_vec_arr_inherit_attr_flags(vecarr
, type
, attr
);