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_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"
67 struct bpacket
*bpacket_alloc()
71 pkt
= (struct bpacket
*)XCALLOC(MTYPE_BGP_PACKET
,
72 sizeof(struct bpacket
));
77 void bpacket_free(struct bpacket
*pkt
)
80 stream_free(pkt
->buffer
);
82 XFREE(MTYPE_BGP_PACKET
, pkt
);
85 void bpacket_queue_init(struct bpacket_queue
*q
)
87 TAILQ_INIT(&(q
->pkts
));
91 * bpacket_queue_sanity_check
93 void bpacket_queue_sanity_check(struct bpacket_queue
__attribute__((__unused__
))
99 pkt
= bpacket_queue_last (q
);
101 assert (!pkt
->buffer
);
104 * Make sure the count of packets is correct.
108 pkt
= bpacket_queue_first (q
);
113 if (num_pkts
> q
->curr_count
)
116 pkt
= TAILQ_NEXT (pkt
, pkt_train
);
119 assert (num_pkts
== q
->curr_count
);
124 * bpacket_queue_add_packet
126 * Internal function of bpacket_queue - and adds a
127 * packet entry to the end of the list.
129 * Users of bpacket_queue should use bpacket_queue_add instead.
131 static void bpacket_queue_add_packet(struct bpacket_queue
*q
,
134 struct bpacket
*last_pkt
;
136 if (TAILQ_EMPTY(&(q
->pkts
)))
137 TAILQ_INSERT_TAIL(&(q
->pkts
), pkt
, pkt_train
);
139 last_pkt
= bpacket_queue_last(q
);
140 TAILQ_INSERT_AFTER(&(q
->pkts
), last_pkt
, pkt
, pkt_train
);
143 if (q
->hwm_count
< q
->curr_count
)
144 q
->hwm_count
= q
->curr_count
;
148 * Adds a packet to the bpacket_queue.
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.
154 struct bpacket
*bpacket_queue_add(struct bpacket_queue
*q
, struct stream
*s
,
155 struct bpacket_attr_vec_arr
*vecarrp
)
158 struct bpacket
*last_pkt
;
161 pkt
= bpacket_alloc();
162 if (TAILQ_EMPTY(&(q
->pkts
))) {
166 memcpy(&pkt
->arr
, vecarrp
,
167 sizeof(struct bpacket_attr_vec_arr
));
169 bpacket_attr_vec_arr_reset(&pkt
->arr
);
170 bpacket_queue_add_packet(q
, pkt
);
171 bpacket_queue_sanity_check(q
);
176 * Fill in the new information into the current sentinel and create a
179 bpacket_queue_sanity_check(q
);
180 last_pkt
= bpacket_queue_last(q
);
181 assert(last_pkt
->buffer
== NULL
);
182 last_pkt
->buffer
= s
;
184 memcpy(&last_pkt
->arr
, vecarrp
,
185 sizeof(struct bpacket_attr_vec_arr
));
187 bpacket_attr_vec_arr_reset(&last_pkt
->arr
);
189 pkt
->ver
= last_pkt
->ver
;
191 bpacket_queue_add_packet(q
, pkt
);
193 bpacket_queue_sanity_check(q
);
197 struct bpacket
*bpacket_queue_first(struct bpacket_queue
*q
)
199 return (TAILQ_FIRST(&(q
->pkts
)));
202 struct bpacket
*bpacket_queue_last(struct bpacket_queue
*q
)
204 return TAILQ_LAST(&(q
->pkts
), pkt_queue
);
207 struct bpacket
*bpacket_queue_remove(struct bpacket_queue
*q
)
209 struct bpacket
*first
;
211 first
= bpacket_queue_first(q
);
213 TAILQ_REMOVE(&(q
->pkts
), first
, pkt_train
);
219 unsigned int bpacket_queue_length(struct bpacket_queue
*q
)
221 return q
->curr_count
- 1;
224 unsigned int bpacket_queue_hwm_length(struct bpacket_queue
*q
)
226 return q
->hwm_count
- 1;
229 int bpacket_queue_is_full(struct bgp
*bgp
, struct bpacket_queue
*q
)
231 if (q
->curr_count
>= bgp
->default_subgroup_pkt_queue_max
)
236 void bpacket_add_peer(struct bpacket
*pkt
, struct peer_af
*paf
)
241 LIST_INSERT_HEAD(&(pkt
->peers
), paf
, pkt_train
);
242 paf
->next_pkt_to_send
= pkt
;
246 * bpacket_queue_cleanup
248 void bpacket_queue_cleanup(struct bpacket_queue
*q
)
252 while ((pkt
= bpacket_queue_remove(q
))) {
258 * bpacket_queue_compact
260 * Delete packets that do not need to be transmitted to any peer from
263 * @return the number of packets deleted.
265 static int bpacket_queue_compact(struct bpacket_queue
*q
)
268 struct bpacket
*pkt
, *removed_pkt
;
273 pkt
= bpacket_queue_first(q
);
278 * Don't delete the sentinel.
283 if (!LIST_EMPTY(&(pkt
->peers
)))
286 removed_pkt
= bpacket_queue_remove(q
);
287 assert(pkt
== removed_pkt
);
288 bpacket_free(removed_pkt
);
293 bpacket_queue_sanity_check(q
);
297 void bpacket_queue_advance_peer(struct peer_af
*paf
)
300 struct bpacket
*old_pkt
;
302 old_pkt
= paf
->next_pkt_to_send
;
303 if (old_pkt
->buffer
== NULL
)
304 /* Already at end of list */
307 LIST_REMOVE(paf
, pkt_train
);
308 pkt
= TAILQ_NEXT(old_pkt
, pkt_train
);
309 bpacket_add_peer(pkt
, paf
);
311 if (!bpacket_queue_compact(PAF_PKTQ(paf
)))
315 * Deleted one or more packets. Check if we can now merge this
316 * peer's subgroup into another subgroup.
318 update_subgroup_check_merge(paf
->subgroup
, "advanced peer in queue");
322 * bpacket_queue_remove_peer
324 * Remove the peer from the packet queue of the subgroup it belongs
327 void bpacket_queue_remove_peer(struct peer_af
*paf
)
329 struct bpacket_queue
*q
;
336 LIST_REMOVE(paf
, pkt_train
);
337 paf
->next_pkt_to_send
= NULL
;
339 bpacket_queue_compact(q
);
342 unsigned int bpacket_queue_virtual_length(struct peer_af
*paf
)
345 struct bpacket
*last
;
346 struct bpacket_queue
*q
;
348 pkt
= paf
->next_pkt_to_send
;
349 if (!pkt
|| (pkt
->buffer
== NULL
))
350 /* Already at end of list */
354 if (TAILQ_EMPTY(&(q
->pkts
)))
357 last
= TAILQ_LAST(&(q
->pkts
), pkt_queue
);
358 if (last
->ver
>= pkt
->ver
)
359 return last
->ver
- pkt
->ver
;
361 /* sequence # rolled over */
362 return (UINT_MAX
- pkt
->ver
+ 1) + last
->ver
;
366 * Dump the bpacket queue
368 void bpacket_queue_show_vty(struct bpacket_queue
*q
, struct vty
*vty
)
373 pkt
= bpacket_queue_first(q
);
375 vty_out(vty
, " Packet %p ver %u buffer %p\n", pkt
, pkt
->ver
,
378 LIST_FOREACH (paf
, &(pkt
->peers
), pkt_train
) {
379 vty_out(vty
, " - %s\n", paf
->peer
->host
);
381 pkt
= bpacket_next(pkt
);
386 struct stream
*bpacket_reformat_for_peer(struct bpacket
*pkt
,
389 struct stream
*s
= NULL
;
390 bpacket_attr_vec
*vec
;
395 s
= stream_dup(pkt
->buffer
);
396 peer
= PAF_PEER(paf
);
398 vec
= &pkt
->arr
.entries
[BGP_ATTR_VEC_NH
];
399 if (CHECK_FLAG(vec
->flags
, BPKT_ATTRVEC_FLAGS_UPDATED
)) {
402 int route_map_sets_nh
;
403 nhlen
= stream_getc_from(s
, vec
->offset
);
404 if (peer_cap_enhe(peer
, paf
->afi
, paf
->safi
))
407 nhafi
= BGP_NEXTHOP_AFI_FROM_NHLEN(nhlen
);
409 if (nhafi
== AFI_IP
) {
410 struct in_addr v4nh
, *mod_v4nh
;
412 size_t offset_nh
= vec
->offset
+ 1;
417 BPKT_ATTRVEC_FLAGS_RMAP_IPV4_NH_CHANGED
)
420 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS
));
423 case BGP_ATTR_NHLEN_IPV4
:
425 case BGP_ATTR_NHLEN_VPNV4
:
429 /* TODO: handle IPv6 nexthops */
431 "%s: %s: invalid MP nexthop length (AFI IP): %u",
432 __func__
, peer
->host
, nhlen
);
437 stream_get_from(&v4nh
, s
, offset_nh
, IPV4_MAX_BYTELEN
);
441 * If route-map has set the nexthop, that is always
443 * specified as peer-address, the peering address is
445 * Otherwise, if NH is unavailable from attribute, the
447 * is picked up; the "NH unavailable" case also covers
449 * and some other scenarios -- see
450 * subgroup_announce_check(). In
451 * all other cases, use the nexthop carried in the
453 * it is EBGP non-multiaccess and there is no
454 * next-hop-unchanged setting.
455 * Note: It is assumed route-map cannot set the nexthop
459 if (route_map_sets_nh
) {
462 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS
)) {
463 mod_v4nh
= &peer
->nexthop
.v4
;
466 } else if (!v4nh
.s_addr
) {
467 mod_v4nh
= &peer
->nexthop
.v4
;
470 peer
->sort
== BGP_PEER_EBGP
471 && (bgp_multiaccess_check_v4(v4nh
, peer
) == 0)
474 BPKT_ATTRVEC_FLAGS_RMAP_NH_UNCHANGED
)
475 && !peer_af_flag_check(
476 peer
, paf
->afi
, 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
));
640 * Update the vecarr offsets to go beyond 'pos' bytes, i.e. add 'pos'
643 static void bpacket_attr_vec_arr_update(struct bpacket_attr_vec_arr
*vecarr
,
651 for (i
= 0; i
< BGP_ATTR_VEC_MAX
; i
++)
652 vecarr
->entries
[i
].offset
+= pos
;
656 * Return if there are packets to build for this subgroup.
658 int subgroup_packets_to_build(struct update_subgroup
*subgrp
)
660 struct bgp_advertise
*adv
;
665 adv
= BGP_ADV_FIFO_HEAD(&subgrp
->sync
->withdraw
);
669 adv
= BGP_ADV_FIFO_HEAD(&subgrp
->sync
->update
);
676 /* Make BGP update packet. */
677 struct bpacket
*subgroup_update_packet(struct update_subgroup
*subgrp
)
679 struct bpacket_attr_vec_arr vecarr
;
683 struct stream
*snlri
;
684 struct stream
*packet
;
685 struct bgp_adj_out
*adj
;
686 struct bgp_advertise
*adv
;
687 struct bgp_node
*rn
= NULL
;
688 struct bgp_info
*binfo
= NULL
;
689 bgp_size_t total_attr_len
= 0;
690 unsigned long attrlen_pos
= 0;
691 size_t mpattrlen_pos
= 0;
692 size_t mpattr_pos
= 0;
695 int space_remaining
= 0;
696 int space_needed
= 0;
697 char send_attr_str
[BUFSIZ
];
698 int send_attr_printed
= 0;
700 int addpath_encode
= 0;
701 int addpath_overhead
= 0;
702 uint32_t addpath_tx_id
= 0;
703 struct prefix_rd
*prd
= NULL
;
704 mpls_label_t label
= MPLS_INVALID_LABEL
, *label_pnt
= NULL
;
705 uint32_t num_labels
= 0;
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
;
737 BGP_NLRI_LENGTH
+ addpath_overhead
738 + bgp_packet_mpattr_prefix_size(afi
, safi
, &rn
->p
);
740 /* When remaining space can't include NLRI and it's length. */
741 if (space_remaining
< space_needed
)
744 /* If packet is empty, set attribute. */
745 if (stream_empty(s
)) {
746 struct peer
*from
= NULL
;
751 /* 1: Write the BGP message header - 16 bytes marker, 2
753 * one byte message type.
755 bgp_packet_set_marker(s
, BGP_MSG_UPDATE
);
757 /* 2: withdrawn routes length */
760 /* 3: total attributes length - attrlen_pos stores the
762 attrlen_pos
= stream_get_endp(s
);
765 /* 4: if there is MP_REACH_NLRI attribute, that should
767 * attribute, according to
768 * draft-ietf-idr-error-handling. Save the
771 mpattr_pos
= stream_get_endp(s
);
773 /* 5: Encode all the attributes, except MP_REACH_NLRI
775 total_attr_len
= bgp_packet_attribute(
776 NULL
, peer
, s
, adv
->baa
->attr
, &vecarr
, NULL
,
777 afi
, safi
, from
, NULL
, NULL
, 0, 0, 0);
780 STREAM_CONCAT_REMAIN(s
, snlri
, STREAM_SIZE(s
))
781 - BGP_MAX_PACKET_SIZE_OVERFLOW
;
782 space_needed
= BGP_NLRI_LENGTH
+ addpath_overhead
783 + bgp_packet_mpattr_prefix_size(
786 /* If the attributes alone do not leave any room for
789 if (space_remaining
< space_needed
) {
791 BGP_ERR_UPDGRP_ATTR_LEN
,
792 "u%" PRIu64
":s%" PRIu64
793 " attributes too long, cannot send UPDATE",
794 subgrp
->update_group
->id
, subgrp
->id
);
796 /* Flush the FIFO update queue */
798 adv
= bgp_advertise_clean_subgroup(
803 if (BGP_DEBUG(update
, UPDATE_OUT
)
804 || BGP_DEBUG(update
, UPDATE_PREFIX
)) {
805 memset(send_attr_str
, 0, BUFSIZ
);
806 send_attr_printed
= 0;
807 bgp_dump_attr(adv
->baa
->attr
, send_attr_str
,
812 if ((afi
== AFI_IP
&& safi
== SAFI_UNICAST
)
813 && !peer_cap_enhe(peer
, afi
, safi
))
814 stream_put_prefix_addpath(s
, &rn
->p
, addpath_encode
,
817 /* Encode the prefix in MP_REACH_NLRI attribute */
819 prd
= (struct prefix_rd
*)&rn
->prn
->p
;
821 if (safi
== SAFI_LABELED_UNICAST
) {
822 label
= bgp_adv_label(rn
, binfo
, peer
, afi
,
826 } else if (binfo
&& binfo
->extra
) {
827 label_pnt
= &binfo
->extra
->label
[0];
828 num_labels
= binfo
->extra
->num_labels
;
831 if (stream_empty(snlri
))
832 mpattrlen_pos
= bgp_packet_mpattr_start(
833 snlri
, peer
, afi
, safi
, &vecarr
,
836 bgp_packet_mpattr_prefix(snlri
, afi
, safi
, &rn
->p
, prd
,
837 label_pnt
, num_labels
,
838 addpath_encode
, addpath_tx_id
,
844 if (bgp_debug_update(NULL
, &rn
->p
, subgrp
->update_group
, 0)) {
845 char pfx_buf
[BGP_PRD_PATH_STRLEN
];
847 if (!send_attr_printed
) {
848 zlog_debug("u%" PRIu64
":s%" PRIu64
849 " send UPDATE w/ attr: %s",
850 subgrp
->update_group
->id
, subgrp
->id
,
852 if (!stream_empty(snlri
)) {
854 iana_safi_t pkt_safi
;
856 pkt_afi
= afi_int2iana(afi
);
857 pkt_safi
= safi_int2iana(safi
);
859 "u%" PRIu64
":s%" PRIu64
860 " send MP_REACH for afi/safi %d/%d",
861 subgrp
->update_group
->id
,
862 subgrp
->id
, pkt_afi
, pkt_safi
);
865 send_attr_printed
= 1;
868 bgp_debug_rdpfxpath2str(afi
, safi
, prd
, &rn
->p
,
869 label_pnt
, num_labels
,
870 addpath_encode
, addpath_tx_id
,
871 pfx_buf
, sizeof(pfx_buf
));
872 zlog_debug("u%" PRIu64
":s%" PRIu64
" send UPDATE %s",
873 subgrp
->update_group
->id
, subgrp
->id
,
877 /* Synchnorize attribute. */
879 bgp_attr_unintern(&adj
->attr
);
883 adj
->attr
= bgp_attr_intern(adv
->baa
->attr
);
885 adv
= bgp_advertise_clean_subgroup(subgrp
, adj
);
888 if (!stream_empty(s
)) {
889 if (!stream_empty(snlri
)) {
890 bgp_packet_mpattr_end(snlri
, mpattrlen_pos
);
891 total_attr_len
+= stream_get_endp(snlri
);
894 /* set the total attribute length correctly */
895 stream_putw_at(s
, attrlen_pos
, total_attr_len
);
897 if (!stream_empty(snlri
)) {
898 packet
= stream_dupcat(s
, snlri
, mpattr_pos
);
899 bpacket_attr_vec_arr_update(&vecarr
, mpattr_pos
);
901 packet
= stream_dup(s
);
902 bgp_packet_set_size(packet
);
903 if (bgp_debug_update(NULL
, NULL
, subgrp
->update_group
, 0))
904 zlog_debug("u%" PRIu64
":s%" PRIu64
905 " send UPDATE len %zd numpfx %d",
906 subgrp
->update_group
->id
, subgrp
->id
,
907 (stream_get_endp(packet
)
908 - stream_get_getp(packet
)),
910 pkt
= bpacket_queue_add(SUBGRP_PKTQ(subgrp
), packet
, &vecarr
);
918 /* Make BGP withdraw packet. */
920 16-octet marker | 2-octet length | 1-octet type |
921 2-octet withdrawn route length | withdrawn prefixes | 2-octet attrlen (=0)
923 /* For other afi/safis:
924 16-octet marker | 2-octet length | 1-octet type |
925 2-octet withdrawn route length (=0) | 2-octet attrlen |
926 mp_unreach attr type | attr len | afi | safi | withdrawn prefixes
928 struct bpacket
*subgroup_withdraw_packet(struct update_subgroup
*subgrp
)
932 struct bgp_adj_out
*adj
;
933 struct bgp_advertise
*adv
;
936 bgp_size_t unfeasible_len
;
937 bgp_size_t total_attr_len
;
939 size_t attrlen_pos
= 0;
940 size_t mplen_pos
= 0;
941 uint8_t first_time
= 1;
944 int space_remaining
= 0;
945 int space_needed
= 0;
947 int addpath_encode
= 0;
948 int addpath_overhead
= 0;
949 uint32_t addpath_tx_id
= 0;
950 struct prefix_rd
*prd
= NULL
;
956 if (bpacket_queue_is_full(SUBGRP_INST(subgrp
), SUBGRP_PKTQ(subgrp
)))
959 peer
= SUBGRP_PEER(subgrp
);
960 afi
= SUBGRP_AFI(subgrp
);
961 safi
= SUBGRP_SAFI(subgrp
);
964 addpath_encode
= bgp_addpath_encode_tx(peer
, afi
, safi
);
965 addpath_overhead
= addpath_encode
? BGP_ADDPATH_ID_LEN
: 0;
967 while ((adv
= BGP_ADV_FIFO_HEAD(&subgrp
->sync
->withdraw
)) != NULL
) {
971 addpath_tx_id
= adj
->addpath_tx_id
;
974 STREAM_WRITEABLE(s
) - BGP_MAX_PACKET_SIZE_OVERFLOW
;
976 BGP_NLRI_LENGTH
+ addpath_overhead
+ BGP_TOTAL_ATTR_LEN
977 + bgp_packet_mpattr_prefix_size(afi
, safi
, &rn
->p
);
979 if (space_remaining
< space_needed
)
982 if (stream_empty(s
)) {
983 bgp_packet_set_marker(s
, BGP_MSG_UPDATE
);
984 stream_putw(s
, 0); /* unfeasible routes length */
988 if (afi
== AFI_IP
&& safi
== SAFI_UNICAST
989 && !peer_cap_enhe(peer
, afi
, safi
))
990 stream_put_prefix_addpath(s
, &rn
->p
, addpath_encode
,
994 prd
= (struct prefix_rd
*)&rn
->prn
->p
;
996 /* If first time, format the MP_UNREACH header */
999 iana_safi_t pkt_safi
;
1001 pkt_afi
= afi_int2iana(afi
);
1002 pkt_safi
= safi_int2iana(safi
);
1004 attrlen_pos
= stream_get_endp(s
);
1005 /* total attr length = 0 for now. reevaluate
1008 mp_start
= stream_get_endp(s
);
1009 mplen_pos
= bgp_packet_mpunreach_start(s
, afi
,
1011 if (bgp_debug_update(NULL
, NULL
,
1012 subgrp
->update_group
, 0))
1014 "u%" PRIu64
":s%" PRIu64
1015 " send MP_UNREACH for afi/safi %d/%d",
1016 subgrp
->update_group
->id
,
1017 subgrp
->id
, pkt_afi
, pkt_safi
);
1020 bgp_packet_mpunreach_prefix(s
, &rn
->p
, afi
, safi
, prd
,
1021 NULL
, 0, addpath_encode
,
1022 addpath_tx_id
, NULL
);
1027 if (bgp_debug_update(NULL
, &rn
->p
, subgrp
->update_group
, 0)) {
1028 char pfx_buf
[BGP_PRD_PATH_STRLEN
];
1030 bgp_debug_rdpfxpath2str(afi
, safi
, prd
, &rn
->p
, NULL
, 0,
1031 addpath_encode
, addpath_tx_id
,
1032 pfx_buf
, sizeof(pfx_buf
));
1033 zlog_debug("u%" PRIu64
":s%" PRIu64
1034 " send UPDATE %s -- unreachable",
1035 subgrp
->update_group
->id
, subgrp
->id
,
1041 bgp_adj_out_remove_subgroup(rn
, adj
, subgrp
);
1042 bgp_unlock_node(rn
);
1045 if (!stream_empty(s
)) {
1046 if (afi
== AFI_IP
&& safi
== SAFI_UNICAST
1047 && !peer_cap_enhe(peer
, afi
, safi
)) {
1048 unfeasible_len
= stream_get_endp(s
) - BGP_HEADER_SIZE
1049 - BGP_UNFEASIBLE_LEN
;
1050 stream_putw_at(s
, BGP_HEADER_SIZE
, unfeasible_len
);
1053 /* Set the mp_unreach attr's length */
1054 bgp_packet_mpunreach_end(s
, mplen_pos
);
1056 /* Set total path attribute length. */
1057 total_attr_len
= stream_get_endp(s
) - mp_start
;
1058 stream_putw_at(s
, attrlen_pos
, total_attr_len
);
1060 bgp_packet_set_size(s
);
1061 if (bgp_debug_update(NULL
, NULL
, subgrp
->update_group
, 0))
1062 zlog_debug("u%" PRIu64
":s%" PRIu64
1063 " send UPDATE (withdraw) len %zd numpfx %d",
1064 subgrp
->update_group
->id
, subgrp
->id
,
1065 (stream_get_endp(s
) - stream_get_getp(s
)),
1067 pkt
= bpacket_queue_add(SUBGRP_PKTQ(subgrp
), stream_dup(s
),
1076 void subgroup_default_update_packet(struct update_subgroup
*subgrp
,
1077 struct attr
*attr
, struct peer
*from
)
1083 bgp_size_t total_attr_len
;
1086 struct bpacket_attr_vec_arr vecarr
;
1087 int addpath_encode
= 0;
1089 if (DISABLE_BGP_ANNOUNCE
)
1095 peer
= SUBGRP_PEER(subgrp
);
1096 afi
= SUBGRP_AFI(subgrp
);
1097 safi
= SUBGRP_SAFI(subgrp
);
1098 bpacket_attr_vec_arr_reset(&vecarr
);
1099 addpath_encode
= bgp_addpath_encode_tx(peer
, afi
, safi
);
1101 memset(&p
, 0, sizeof(p
));
1102 p
.family
= afi2family(afi
);
1105 /* Logging the attribute. */
1106 if (bgp_debug_update(NULL
, &p
, subgrp
->update_group
, 0)) {
1107 char attrstr
[BUFSIZ
];
1108 char buf
[PREFIX_STRLEN
];
1109 /* ' with addpath ID ' 17
1110 * max strlen of uint32 + 10
1111 * +/- (just in case) + 1
1112 * null terminator + 1
1113 * ============================ 29 */
1118 bgp_dump_attr(attr
, attrstr
, BUFSIZ
);
1121 snprintf(tx_id_buf
, sizeof(tx_id_buf
),
1122 " with addpath ID %u",
1123 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
1125 zlog_debug("u%" PRIu64
":s%" PRIu64
" send UPDATE %s%s %s",
1126 (SUBGRP_UPDGRP(subgrp
))->id
, subgrp
->id
,
1127 prefix2str(&p
, buf
, sizeof(buf
)), tx_id_buf
,
1131 s
= stream_new(BGP_MAX_PACKET_SIZE
);
1133 /* Make BGP update packet. */
1134 bgp_packet_set_marker(s
, BGP_MSG_UPDATE
);
1136 /* Unfeasible Routes Length. */
1139 /* Make place for total attribute length. */
1140 pos
= stream_get_endp(s
);
1142 total_attr_len
= bgp_packet_attribute(
1143 NULL
, peer
, s
, attr
, &vecarr
, &p
, afi
, safi
, from
, NULL
, NULL
,
1144 0, addpath_encode
, BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
1146 /* Set Total Path Attribute Length. */
1147 stream_putw_at(s
, pos
, total_attr_len
);
1150 if (p
.family
== AF_INET
&& safi
== SAFI_UNICAST
1151 && !peer_cap_enhe(peer
, afi
, safi
))
1152 stream_put_prefix_addpath(
1153 s
, &p
, addpath_encode
,
1154 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
1157 bgp_packet_set_size(s
);
1159 (void)bpacket_queue_add(SUBGRP_PKTQ(subgrp
), s
, &vecarr
);
1160 subgroup_trigger_write(subgrp
);
1163 void subgroup_default_withdraw_packet(struct update_subgroup
*subgrp
)
1168 unsigned long attrlen_pos
= 0;
1170 bgp_size_t unfeasible_len
;
1171 bgp_size_t total_attr_len
= 0;
1172 size_t mp_start
= 0;
1173 size_t mplen_pos
= 0;
1176 int addpath_encode
= 0;
1178 if (DISABLE_BGP_ANNOUNCE
)
1181 peer
= SUBGRP_PEER(subgrp
);
1182 afi
= SUBGRP_AFI(subgrp
);
1183 safi
= SUBGRP_SAFI(subgrp
);
1184 addpath_encode
= bgp_addpath_encode_tx(peer
, afi
, safi
);
1186 memset(&p
, 0, sizeof(p
));
1187 p
.family
= afi2family(afi
);
1190 if (bgp_debug_update(NULL
, &p
, subgrp
->update_group
, 0)) {
1191 char buf
[PREFIX_STRLEN
];
1192 /* ' with addpath ID ' 17
1193 * max strlen of uint32 + 10
1194 * +/- (just in case) + 1
1195 * null terminator + 1
1196 * ============================ 29 */
1200 snprintf(tx_id_buf
, sizeof(tx_id_buf
),
1201 " with addpath ID %u",
1202 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
1204 zlog_debug("u%" PRIu64
":s%" PRIu64
1205 " send UPDATE %s%s -- unreachable",
1206 (SUBGRP_UPDGRP(subgrp
))->id
, subgrp
->id
,
1207 prefix2str(&p
, buf
, sizeof(buf
)), tx_id_buf
);
1210 s
= stream_new(BGP_MAX_PACKET_SIZE
);
1212 /* Make BGP update packet. */
1213 bgp_packet_set_marker(s
, BGP_MSG_UPDATE
);
1215 /* Unfeasible Routes Length. */;
1216 cp
= stream_get_endp(s
);
1219 /* Withdrawn Routes. */
1220 if (p
.family
== AF_INET
&& safi
== SAFI_UNICAST
1221 && !peer_cap_enhe(peer
, afi
, safi
)) {
1222 stream_put_prefix_addpath(
1223 s
, &p
, addpath_encode
,
1224 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
1226 unfeasible_len
= stream_get_endp(s
) - cp
- 2;
1228 /* Set unfeasible len. */
1229 stream_putw_at(s
, cp
, unfeasible_len
);
1231 /* Set total path attribute length. */
1234 attrlen_pos
= stream_get_endp(s
);
1236 mp_start
= stream_get_endp(s
);
1237 mplen_pos
= bgp_packet_mpunreach_start(s
, afi
, safi
);
1238 bgp_packet_mpunreach_prefix(
1239 s
, &p
, afi
, safi
, NULL
, NULL
, 0, addpath_encode
,
1240 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
, NULL
);
1242 /* Set the mp_unreach attr's length */
1243 bgp_packet_mpunreach_end(s
, mplen_pos
);
1245 /* Set total path attribute length. */
1246 total_attr_len
= stream_get_endp(s
) - mp_start
;
1247 stream_putw_at(s
, attrlen_pos
, total_attr_len
);
1250 bgp_packet_set_size(s
);
1252 (void)bpacket_queue_add(SUBGRP_PKTQ(subgrp
), s
, NULL
);
1253 subgroup_trigger_write(subgrp
);
1257 bpacket_vec_arr_inherit_attr_flags(struct bpacket_attr_vec_arr
*vecarr
,
1258 bpacket_attr_vec_type type
,
1261 if (CHECK_FLAG(attr
->rmap_change_flags
,
1262 BATTR_RMAP_NEXTHOP_PEER_ADDRESS
))
1263 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1264 BPKT_ATTRVEC_FLAGS_RMAP_NH_PEER_ADDRESS
);
1266 if (CHECK_FLAG(attr
->rmap_change_flags
, BATTR_REFLECTED
))
1267 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1268 BPKT_ATTRVEC_FLAGS_REFLECTED
);
1270 if (CHECK_FLAG(attr
->rmap_change_flags
, BATTR_RMAP_NEXTHOP_UNCHANGED
))
1271 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1272 BPKT_ATTRVEC_FLAGS_RMAP_NH_UNCHANGED
);
1274 if (CHECK_FLAG(attr
->rmap_change_flags
, BATTR_RMAP_IPV4_NHOP_CHANGED
))
1275 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1276 BPKT_ATTRVEC_FLAGS_RMAP_IPV4_NH_CHANGED
);
1278 if (CHECK_FLAG(attr
->rmap_change_flags
,
1279 BATTR_RMAP_IPV6_GLOBAL_NHOP_CHANGED
))
1280 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1281 BPKT_ATTRVEC_FLAGS_RMAP_IPV6_GNH_CHANGED
);
1283 if (CHECK_FLAG(attr
->rmap_change_flags
,
1284 BATTR_RMAP_IPV6_LL_NHOP_CHANGED
))
1285 SET_FLAG(vecarr
->entries
[BGP_ATTR_VEC_NH
].flags
,
1286 BPKT_ATTRVEC_FLAGS_RMAP_IPV6_LNH_CHANGED
);
1289 /* Reset the Attributes vector array. The vector array is used to override
1290 * certain output parameters in the packet for a particular peer
1292 void bpacket_attr_vec_arr_reset(struct bpacket_attr_vec_arr
*vecarr
)
1300 while (i
< BGP_ATTR_VEC_MAX
) {
1301 vecarr
->entries
[i
].flags
= 0;
1302 vecarr
->entries
[i
].offset
= 0;
1307 /* Setup a particular node entry in the vecarr */
1308 void bpacket_attr_vec_arr_set_vec(struct bpacket_attr_vec_arr
*vecarr
,
1309 bpacket_attr_vec_type type
, struct stream
*s
,
1314 assert(type
< BGP_ATTR_VEC_MAX
);
1316 SET_FLAG(vecarr
->entries
[type
].flags
, BPKT_ATTRVEC_FLAGS_UPDATED
);
1317 vecarr
->entries
[type
].offset
= stream_get_endp(s
);
1319 bpacket_vec_arr_inherit_attr_flags(vecarr
, type
, attr
);