2 * bgp_updgrp_adv.c: BGP update group advertisement and adjacency
6 * @copyright Copyright (C) 2014 Cumulus Networks, Inc.
8 * @author Avneesh Sachdev <avneesh@sproute.net>
9 * @author Rajesh Varadarajan <rajesh@sproute.net>
10 * @author Pradosh Mohapatra <pradosh@sproute.net>
12 * This file is part of GNU Zebra.
14 * GNU Zebra is free software; you can redistribute it and/or modify it
15 * under the terms of the GNU General Public License as published by the
16 * Free Software Foundation; either version 2, or (at your option) any
19 * GNU Zebra is distributed in the hope that it will be useful, but
20 * WITHOUT ANY WARRANTY; without even the implied warranty of
21 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
22 * General Public License for more details.
24 * You should have received a copy of the GNU General Public License along
25 * with this program; see the file COPYING; if not, write to the Free Software
26 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
40 #include "bgpd/bgpd.h"
41 #include "bgpd/bgp_table.h"
42 #include "bgpd/bgp_debug.h"
43 #include "bgpd/bgp_route.h"
44 #include "bgpd/bgp_advertise.h"
45 #include "bgpd/bgp_attr.h"
46 #include "bgpd/bgp_aspath.h"
47 #include "bgpd/bgp_packet.h"
48 #include "bgpd/bgp_fsm.h"
49 #include "bgpd/bgp_mplsvpn.h"
50 #include "bgpd/bgp_updgrp.h"
51 #include "bgpd/bgp_advertise.h"
52 #include "bgpd/bgp_addpath.h"
58 static int bgp_adj_out_compare(const struct bgp_adj_out
*o1
,
59 const struct bgp_adj_out
*o2
)
61 if (o1
->subgroup
< o2
->subgroup
)
64 if (o1
->subgroup
> o2
->subgroup
)
67 if (o1
->addpath_tx_id
< o2
->addpath_tx_id
)
70 if (o1
->addpath_tx_id
> o2
->addpath_tx_id
)
75 RB_GENERATE(bgp_adj_out_rb
, bgp_adj_out
, adj_entry
, bgp_adj_out_compare
);
77 static inline struct bgp_adj_out
*adj_lookup(struct bgp_dest
*dest
,
78 struct update_subgroup
*subgrp
,
79 uint32_t addpath_tx_id
)
81 struct bgp_adj_out lookup
;
86 /* update-groups that do not support addpath will pass 0 for
88 lookup
.subgroup
= subgrp
;
89 lookup
.addpath_tx_id
= addpath_tx_id
;
91 return RB_FIND(bgp_adj_out_rb
, &dest
->adj_out
, &lookup
);
94 static void adj_free(struct bgp_adj_out
*adj
)
96 TAILQ_REMOVE(&(adj
->subgroup
->adjq
), adj
, subgrp_adj_train
);
97 SUBGRP_DECR_STAT(adj
->subgroup
, adj_count
);
98 XFREE(MTYPE_BGP_ADJ_OUT
, adj
);
101 static void subgrp_withdraw_stale_addpath(struct updwalk_context
*ctx
,
102 struct update_subgroup
*subgrp
)
104 struct bgp_adj_out
*adj
, *adj_next
;
106 struct bgp_path_info
*pi
;
107 afi_t afi
= SUBGRP_AFI(subgrp
);
108 safi_t safi
= SUBGRP_SAFI(subgrp
);
109 struct peer
*peer
= SUBGRP_PEER(subgrp
);
111 /* Look through all of the paths we have advertised for this rn and send
112 * a withdraw for the ones that are no longer present */
113 RB_FOREACH_SAFE (adj
, bgp_adj_out_rb
, &ctx
->dest
->adj_out
, adj_next
) {
115 if (adj
->subgroup
== subgrp
) {
116 for (pi
= bgp_dest_get_bgp_path_info(ctx
->dest
); pi
;
118 id
= bgp_addpath_id_for_peer(peer
, afi
, safi
,
121 if (id
== adj
->addpath_tx_id
) {
127 subgroup_process_announce_selected(
128 subgrp
, NULL
, ctx
->dest
,
135 static int group_announce_route_walkcb(struct update_group
*updgrp
, void *arg
)
137 struct updwalk_context
*ctx
= arg
;
138 struct update_subgroup
*subgrp
;
139 struct bgp_path_info
*pi
;
143 struct bgp_adj_out
*adj
, *adj_next
;
146 afi
= UPDGRP_AFI(updgrp
);
147 safi
= UPDGRP_SAFI(updgrp
);
148 peer
= UPDGRP_PEER(updgrp
);
149 addpath_capable
= bgp_addpath_encode_tx(peer
, afi
, safi
);
151 if (BGP_DEBUG(update
, UPDATE_OUT
))
152 zlog_debug("%s: afi=%s, safi=%s, p=%pRN", __func__
,
153 afi2str(afi
), safi2str(safi
),
154 bgp_dest_to_rnode(ctx
->dest
));
156 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
159 * Skip the subgroups that have coalesce timer running. We will
160 * walk the entire prefix table for those subgroups when the
161 * coalesce timer fires.
163 if (!subgrp
->t_coalesce
) {
164 /* An update-group that uses addpath */
165 if (addpath_capable
) {
166 subgrp_withdraw_stale_addpath(ctx
, subgrp
);
168 for (pi
= bgp_dest_get_bgp_path_info(ctx
->dest
);
170 /* Skip the bestpath for now */
174 subgroup_process_announce_selected(
175 subgrp
, pi
, ctx
->dest
,
176 bgp_addpath_id_for_peer(
181 /* Process the bestpath last so the "show [ip]
182 * bgp neighbor x.x.x.x advertised"
183 * output shows the attributes from the bestpath
186 subgroup_process_announce_selected(
187 subgrp
, ctx
->pi
, ctx
->dest
,
188 bgp_addpath_id_for_peer(
190 &ctx
->pi
->tx_addpath
));
193 /* An update-group that does not use addpath */
196 subgroup_process_announce_selected(
197 subgrp
, ctx
->pi
, ctx
->dest
,
198 bgp_addpath_id_for_peer(
200 &ctx
->pi
->tx_addpath
));
202 /* Find the addpath_tx_id of the path we
205 RB_FOREACH_SAFE (adj
, bgp_adj_out_rb
,
208 if (adj
->subgroup
== subgrp
) {
209 subgroup_process_announce_selected(
220 return UPDWALK_CONTINUE
;
223 static void subgrp_show_adjq_vty(struct update_subgroup
*subgrp
,
224 struct vty
*vty
, uint8_t flags
)
226 struct bgp_table
*table
;
227 struct bgp_adj_out
*adj
;
228 unsigned long output_count
;
229 struct bgp_dest
*dest
;
234 bgp
= SUBGRP_INST(subgrp
);
238 table
= bgp
->rib
[SUBGRP_AFI(subgrp
)][SUBGRP_SAFI(subgrp
)];
242 for (dest
= bgp_table_top(table
); dest
; dest
= bgp_route_next(dest
)) {
243 const struct prefix
*dest_p
= bgp_dest_get_prefix(dest
);
245 RB_FOREACH (adj
, bgp_adj_out_rb
, &dest
->adj_out
)
246 if (adj
->subgroup
== subgrp
) {
249 "BGP table version is %" PRIu64
", local router ID is %s\n",
251 inet_ntoa(bgp
->router_id
));
252 vty_out(vty
, BGP_SHOW_SCODE_HEADER
);
253 vty_out(vty
, BGP_SHOW_OCODE_HEADER
);
257 vty_out(vty
, BGP_SHOW_HEADER
);
260 if ((flags
& UPDWALK_FLAGS_ADVQUEUE
) && adj
->adv
262 route_vty_out_tmp(vty
, dest_p
,
268 if ((flags
& UPDWALK_FLAGS_ADVERTISED
)
270 route_vty_out_tmp(vty
, dest_p
,
278 if (output_count
!= 0)
279 vty_out(vty
, "\nTotal number of prefixes %ld\n", output_count
);
282 static int updgrp_show_adj_walkcb(struct update_group
*updgrp
, void *arg
)
284 struct updwalk_context
*ctx
= arg
;
285 struct update_subgroup
*subgrp
;
289 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
290 if (ctx
->subgrp_id
&& (ctx
->subgrp_id
!= subgrp
->id
))
292 vty_out(vty
, "update group %" PRIu64
", subgroup %" PRIu64
"\n",
293 updgrp
->id
, subgrp
->id
);
294 subgrp_show_adjq_vty(subgrp
, vty
, ctx
->flags
);
296 return UPDWALK_CONTINUE
;
299 static void updgrp_show_adj(struct bgp
*bgp
, afi_t afi
, safi_t safi
,
300 struct vty
*vty
, uint64_t id
, uint8_t flags
)
302 struct updwalk_context ctx
;
303 memset(&ctx
, 0, sizeof(ctx
));
308 update_group_af_walk(bgp
, afi
, safi
, updgrp_show_adj_walkcb
, &ctx
);
311 static int subgroup_coalesce_timer(struct thread
*thread
)
313 struct update_subgroup
*subgrp
;
315 subgrp
= THREAD_ARG(thread
);
316 if (bgp_debug_update(NULL
, NULL
, subgrp
->update_group
, 0))
317 zlog_debug("u%" PRIu64
":s%" PRIu64
" announcing routes upon coalesce timer expiry(%u ms)",
318 (SUBGRP_UPDGRP(subgrp
))->id
, subgrp
->id
,
320 subgrp
->t_coalesce
= NULL
;
321 subgrp
->v_coalesce
= 0;
322 subgroup_announce_route(subgrp
);
325 /* While the announce_route() may kick off the route advertisement timer
327 * the members of the subgroup, we'd like to send the initial updates
329 * faster (i.e., without enforcing MRAI). Also, if there were no routes
331 * announce, this is the method currently employed to trigger the EOR.
333 if (!bgp_update_delay_active(SUBGRP_INST(subgrp
))) {
337 SUBGRP_FOREACH_PEER (subgrp
, paf
) {
338 peer
= PAF_PEER(paf
);
339 BGP_TIMER_OFF(peer
->t_routeadv
);
340 BGP_TIMER_ON(peer
->t_routeadv
, bgp_routeadv_timer
, 0);
347 static int update_group_announce_walkcb(struct update_group
*updgrp
, void *arg
)
349 struct update_subgroup
*subgrp
;
351 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
352 subgroup_announce_all(subgrp
);
355 return UPDWALK_CONTINUE
;
358 static int update_group_announce_rrc_walkcb(struct update_group
*updgrp
,
361 struct update_subgroup
*subgrp
;
366 afi
= UPDGRP_AFI(updgrp
);
367 safi
= UPDGRP_SAFI(updgrp
);
368 peer
= UPDGRP_PEER(updgrp
);
370 /* Only announce if this is a group of route-reflector-clients */
371 if (CHECK_FLAG(peer
->af_flags
[afi
][safi
], PEER_FLAG_REFLECTOR_CLIENT
)) {
372 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
373 subgroup_announce_all(subgrp
);
377 return UPDWALK_CONTINUE
;
380 /********************
382 ********************/
385 * Allocate an adj-out object. Do proper initialization of its fields,
386 * primarily its association with the subgroup and the prefix.
388 struct bgp_adj_out
*bgp_adj_out_alloc(struct update_subgroup
*subgrp
,
389 struct bgp_dest
*dest
,
390 uint32_t addpath_tx_id
)
392 struct bgp_adj_out
*adj
;
394 adj
= XCALLOC(MTYPE_BGP_ADJ_OUT
, sizeof(struct bgp_adj_out
));
395 adj
->subgroup
= subgrp
;
396 adj
->addpath_tx_id
= addpath_tx_id
;
399 RB_INSERT(bgp_adj_out_rb
, &dest
->adj_out
, adj
);
400 bgp_dest_lock_node(dest
);
404 TAILQ_INSERT_TAIL(&(subgrp
->adjq
), adj
, subgrp_adj_train
);
405 SUBGRP_INCR_STAT(subgrp
, adj_count
);
410 struct bgp_advertise
*
411 bgp_advertise_clean_subgroup(struct update_subgroup
*subgrp
,
412 struct bgp_adj_out
*adj
)
414 struct bgp_advertise
*adv
;
415 struct bgp_advertise_attr
*baa
;
416 struct bgp_advertise
*next
;
417 struct bgp_adv_fifo_head
*fhead
;
424 fhead
= &subgrp
->sync
->update
;
426 /* Unlink myself from advertise attribute FIFO. */
427 bgp_advertise_delete(baa
, adv
);
429 /* Fetch next advertise candidate. */
432 /* Unintern BGP advertise attribute. */
433 bgp_advertise_unintern(subgrp
->hash
, baa
);
435 fhead
= &subgrp
->sync
->withdraw
;
438 /* Unlink myself from advertisement FIFO. */
439 bgp_adv_fifo_del(fhead
, adv
);
442 bgp_advertise_free(adj
->adv
);
448 void bgp_adj_out_set_subgroup(struct bgp_dest
*dest
,
449 struct update_subgroup
*subgrp
, struct attr
*attr
,
450 struct bgp_path_info
*path
)
452 struct bgp_adj_out
*adj
= NULL
;
453 struct bgp_advertise
*adv
;
458 peer
= SUBGRP_PEER(subgrp
);
459 afi
= SUBGRP_AFI(subgrp
);
460 safi
= SUBGRP_SAFI(subgrp
);
462 if (DISABLE_BGP_ANNOUNCE
)
465 /* Look for adjacency information. */
468 bgp_addpath_id_for_peer(peer
, afi
, safi
, &path
->tx_addpath
));
471 adj
= bgp_adj_out_alloc(
473 bgp_addpath_id_for_peer(peer
, afi
, safi
,
480 bgp_advertise_clean_subgroup(subgrp
, adj
);
481 adj
->adv
= bgp_advertise_new();
485 assert(adv
->pathi
== NULL
);
486 /* bgp_path_info adj_out reference */
487 adv
->pathi
= bgp_path_info_lock(path
);
490 adv
->baa
= bgp_advertise_intern(subgrp
->hash
, attr
);
492 adv
->baa
= baa_new();
495 /* Add new advertisement to advertisement attribute list. */
496 bgp_advertise_add(adv
->baa
, adv
);
499 * If the update adv list is empty, trigger the member peers'
500 * mrai timers so the socket writes can happen.
502 if (!bgp_adv_fifo_count(&subgrp
->sync
->update
)) {
505 SUBGRP_FOREACH_PEER (subgrp
, paf
) {
506 bgp_adjust_routeadv(PAF_PEER(paf
));
510 bgp_adv_fifo_add_tail(&subgrp
->sync
->update
, adv
);
512 subgrp
->version
= max(subgrp
->version
, dest
->version
);
515 /* The only time 'withdraw' will be false is if we are sending
516 * the "neighbor x.x.x.x default-originate" default and need to clear
517 * bgp_adj_out for the 0.0.0.0/0 route in the BGP table.
519 void bgp_adj_out_unset_subgroup(struct bgp_dest
*dest
,
520 struct update_subgroup
*subgrp
, char withdraw
,
521 uint32_t addpath_tx_id
)
523 struct bgp_adj_out
*adj
;
524 struct bgp_advertise
*adv
;
527 if (DISABLE_BGP_ANNOUNCE
)
530 /* Lookup existing adjacency */
531 if ((adj
= adj_lookup(dest
, subgrp
, addpath_tx_id
)) != NULL
) {
532 /* Clean up previous advertisement. */
534 bgp_advertise_clean_subgroup(subgrp
, adj
);
536 /* If default originate is enabled and the route is default
537 * route, do not send withdraw. This will prevent deletion of
538 * the default route at the peer.
540 if (CHECK_FLAG(subgrp
->sflags
, SUBGRP_STATUS_DEFAULT_ORIGINATE
)
541 && is_default_prefix(bgp_dest_get_prefix(dest
)))
544 if (adj
->attr
&& withdraw
) {
545 /* We need advertisement structure. */
546 adj
->adv
= bgp_advertise_new();
551 /* Note if we need to trigger a packet write */
553 !bgp_adv_fifo_count(&subgrp
->sync
->withdraw
);
555 /* Add to synchronization entry for withdraw
557 bgp_adv_fifo_add_tail(&subgrp
->sync
->withdraw
, adv
);
560 subgroup_trigger_write(subgrp
);
562 /* Remove myself from adjacency. */
563 RB_REMOVE(bgp_adj_out_rb
, &dest
->adj_out
, adj
);
565 /* Free allocated information. */
568 bgp_dest_unlock_node(dest
);
572 subgrp
->version
= max(subgrp
->version
, dest
->version
);
575 void bgp_adj_out_remove_subgroup(struct bgp_dest
*dest
, struct bgp_adj_out
*adj
,
576 struct update_subgroup
*subgrp
)
579 bgp_attr_unintern(&adj
->attr
);
582 bgp_advertise_clean_subgroup(subgrp
, adj
);
584 RB_REMOVE(bgp_adj_out_rb
, &dest
->adj_out
, adj
);
589 * Go through all the routes and clean up the adj/adv structures corresponding
592 void subgroup_clear_table(struct update_subgroup
*subgrp
)
594 struct bgp_adj_out
*aout
, *taout
;
596 SUBGRP_FOREACH_ADJ_SAFE (subgrp
, aout
, taout
) {
597 struct bgp_dest
*dest
= aout
->dest
;
598 bgp_adj_out_remove_subgroup(dest
, aout
, subgrp
);
599 bgp_dest_unlock_node(dest
);
604 * subgroup_announce_table
606 void subgroup_announce_table(struct update_subgroup
*subgrp
,
607 struct bgp_table
*table
)
609 struct bgp_dest
*dest
;
610 struct bgp_path_info
*ri
;
617 peer
= SUBGRP_PEER(subgrp
);
618 afi
= SUBGRP_AFI(subgrp
);
619 safi
= SUBGRP_SAFI(subgrp
);
620 addpath_capable
= bgp_addpath_encode_tx(peer
, afi
, safi
);
622 if (safi
== SAFI_LABELED_UNICAST
)
626 table
= peer
->bgp
->rib
[afi
][safi
];
628 if (safi
!= SAFI_MPLS_VPN
&& safi
!= SAFI_ENCAP
&& safi
!= SAFI_EVPN
629 && CHECK_FLAG(peer
->af_flags
[afi
][safi
],
630 PEER_FLAG_DEFAULT_ORIGINATE
))
631 subgroup_default_originate(subgrp
, 0);
633 for (dest
= bgp_table_top(table
); dest
; dest
= bgp_route_next(dest
)) {
634 const struct prefix
*dest_p
= bgp_dest_get_prefix(dest
);
636 for (ri
= bgp_dest_get_bgp_path_info(dest
); ri
; ri
= ri
->next
)
638 if (CHECK_FLAG(ri
->flags
, BGP_PATH_SELECTED
)
640 && bgp_addpath_tx_path(
641 peer
->addpath_type
[afi
][safi
],
643 if (subgroup_announce_check(dest
, ri
, subgrp
,
645 bgp_adj_out_set_subgroup(dest
, subgrp
,
648 /* If default originate is enabled for
649 * the peer, do not send explicit
650 * withdraw. This will prevent deletion
651 * of default route advertised through
655 peer
->af_flags
[afi
][safi
],
656 PEER_FLAG_DEFAULT_ORIGINATE
)
657 && is_default_prefix(bgp_dest_get_prefix(dest
)))
660 bgp_adj_out_unset_subgroup(
662 bgp_addpath_id_for_peer(
670 * We walked through the whole table -- make sure our version number
671 * is consistent with the one on the table. This should allow
672 * subgroups to merge sooner if a peer comes up when the route node
673 * with the largest version is no longer in the table. This also
674 * covers the pathological case where all routes in the table have
677 subgrp
->version
= max(subgrp
->version
, table
->version
);
680 * Start a task to merge the subgroup if necessary.
682 update_subgroup_trigger_merge_check(subgrp
, 0);
686 * subgroup_announce_route
688 * Refresh all routes out to a subgroup.
690 void subgroup_announce_route(struct update_subgroup
*subgrp
)
692 struct bgp_dest
*dest
;
693 struct bgp_table
*table
;
694 struct peer
*onlypeer
;
696 if (update_subgroup_needs_refresh(subgrp
)) {
697 update_subgroup_set_needs_refresh(subgrp
, 0);
701 * First update is deferred until ORF or ROUTE-REFRESH is received
703 onlypeer
= ((SUBGRP_PCOUNT(subgrp
) == 1) ? (SUBGRP_PFIRST(subgrp
))->peer
705 if (onlypeer
&& CHECK_FLAG(onlypeer
->af_sflags
[SUBGRP_AFI(subgrp
)]
706 [SUBGRP_SAFI(subgrp
)],
707 PEER_STATUS_ORF_WAIT_REFRESH
))
710 if (SUBGRP_SAFI(subgrp
) != SAFI_MPLS_VPN
711 && SUBGRP_SAFI(subgrp
) != SAFI_ENCAP
712 && SUBGRP_SAFI(subgrp
) != SAFI_EVPN
)
713 subgroup_announce_table(subgrp
, NULL
);
715 for (dest
= bgp_table_top(update_subgroup_rib(subgrp
)); dest
;
716 dest
= bgp_route_next(dest
)) {
717 table
= bgp_dest_get_bgp_table_info(dest
);
720 subgroup_announce_table(subgrp
, table
);
724 void subgroup_default_originate(struct update_subgroup
*subgrp
, int withdraw
)
728 struct attr
*new_attr
= &attr
;
729 struct aspath
*aspath
;
732 struct bgp_dest
*dest
;
733 struct bgp_path_info
*pi
;
735 struct bgp_adj_out
*adj
;
736 route_map_result_t ret
= RMAP_DENYMATCH
;
743 peer
= SUBGRP_PEER(subgrp
);
744 afi
= SUBGRP_AFI(subgrp
);
745 safi
= SUBGRP_SAFI(subgrp
);
747 if (!(afi
== AFI_IP
|| afi
== AFI_IP6
))
751 from
= bgp
->peer_self
;
753 bgp_attr_default_set(&attr
, BGP_ORIGIN_IGP
);
754 aspath
= attr
.aspath
;
756 attr
.local_pref
= bgp
->default_local_pref
;
758 if ((afi
== AFI_IP6
) || peer_cap_enhe(peer
, afi
, safi
)) {
759 /* IPv6 global nexthop must be included. */
760 attr
.mp_nexthop_len
= BGP_ATTR_NHLEN_IPV6_GLOBAL
;
762 /* If the peer is on shared nextwork and we have link-local
764 if (peer
->shared_network
765 && !IN6_IS_ADDR_UNSPECIFIED(&peer
->nexthop
.v6_local
))
766 attr
.mp_nexthop_len
= BGP_ATTR_NHLEN_IPV6_GLOBAL_AND_LL
;
769 if (peer
->default_rmap
[afi
][safi
].name
) {
770 struct attr attr_tmp
= attr
;
771 struct bgp_path_info bpi_rmap
= {0};
773 bpi_rmap
.peer
= bgp
->peer_self
;
774 bpi_rmap
.attr
= &attr_tmp
;
776 SET_FLAG(bgp
->peer_self
->rmap_type
, PEER_RMAP_TYPE_DEFAULT
);
778 /* Iterate over the RIB to see if we can announce
779 * the default route. We announce the default
780 * route only if route-map has a match.
782 for (dest
= bgp_table_top(bgp
->rib
[afi
][safi
]); dest
;
783 dest
= bgp_route_next(dest
)) {
784 if (!bgp_dest_has_bgp_path_info_data(dest
))
787 ret
= route_map_apply(peer
->default_rmap
[afi
][safi
].map
,
788 bgp_dest_get_prefix(dest
),
789 RMAP_BGP
, &bpi_rmap
);
791 if (ret
!= RMAP_DENYMATCH
)
794 bgp
->peer_self
->rmap_type
= 0;
795 new_attr
= bgp_attr_intern(&attr_tmp
);
797 if (ret
== RMAP_DENYMATCH
) {
798 bgp_attr_flush(&attr_tmp
);
803 /* Check if the default route is in local BGP RIB which is
804 * installed through redistribute or network command
806 memset(&p
, 0, sizeof(p
));
807 p
.family
= afi2family(afi
);
809 dest
= bgp_afi_node_lookup(bgp
->rib
[afi
][safi
], afi
, safi
, &p
, NULL
);
812 /* Withdraw the default route advertised using default
815 if (CHECK_FLAG(subgrp
->sflags
, SUBGRP_STATUS_DEFAULT_ORIGINATE
))
816 subgroup_default_withdraw_packet(subgrp
);
817 UNSET_FLAG(subgrp
->sflags
, SUBGRP_STATUS_DEFAULT_ORIGINATE
);
819 /* If default route is present in the local RIB, advertise the
823 for (pi
= bgp_dest_get_bgp_path_info(dest
); pi
;
825 if (CHECK_FLAG(pi
->flags
, BGP_PATH_SELECTED
))
826 if (subgroup_announce_check(
828 bgp_dest_get_prefix(dest
),
830 bgp_adj_out_set_subgroup(
836 if (!CHECK_FLAG(subgrp
->sflags
,
837 SUBGRP_STATUS_DEFAULT_ORIGINATE
)) {
839 /* The 'neighbor x.x.x.x default-originate' default will
841 * implicit withdraw for any previous UPDATEs sent for
843 * clear adj_out for the 0.0.0.0/0 prefix in the BGP
847 /* Remove the adjacency for the previously
848 * advertised default route
852 BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE
);
854 /* Clean up previous advertisement. */
856 bgp_advertise_clean_subgroup(
859 /* Remove from adjacency. */
860 RB_REMOVE(bgp_adj_out_rb
,
861 &dest
->adj_out
, adj
);
863 /* Free allocated information. */
866 bgp_dest_unlock_node(dest
);
870 /* Advertise the default route */
871 if (bgp_in_graceful_shutdown(bgp
))
872 bgp_attr_add_gshut_community(new_attr
);
874 SET_FLAG(subgrp
->sflags
,
875 SUBGRP_STATUS_DEFAULT_ORIGINATE
);
876 subgroup_default_update_packet(subgrp
, new_attr
, from
);
880 aspath_unintern(&aspath
);
884 * Announce the BGP table to a subgroup.
886 * At startup, we try to optimize route announcement by coalescing the
887 * peer-up events. This is done only the first time - from then on,
888 * subgrp->v_coalesce will be set to zero and the normal logic
891 void subgroup_announce_all(struct update_subgroup
*subgrp
)
897 * If coalesce timer value is not set, announce routes immediately.
899 if (!subgrp
->v_coalesce
) {
900 if (bgp_debug_update(NULL
, NULL
, subgrp
->update_group
, 0))
901 zlog_debug("u%" PRIu64
":s%" PRIu64
" announcing all routes",
902 subgrp
->update_group
->id
, subgrp
->id
);
903 subgroup_announce_route(subgrp
);
908 * We should wait for the coalesce timer. Arm the timer if not done.
910 if (!subgrp
->t_coalesce
) {
911 thread_add_timer_msec(bm
->master
, subgroup_coalesce_timer
,
912 subgrp
, subgrp
->v_coalesce
,
913 &subgrp
->t_coalesce
);
918 * Go through all update subgroups and set up the adv queue for the
921 void group_announce_route(struct bgp
*bgp
, afi_t afi
, safi_t safi
,
922 struct bgp_dest
*dest
, struct bgp_path_info
*pi
)
924 struct updwalk_context ctx
;
927 update_group_af_walk(bgp
, afi
, safi
, group_announce_route_walkcb
, &ctx
);
930 void update_group_show_adj_queue(struct bgp
*bgp
, afi_t afi
, safi_t safi
,
931 struct vty
*vty
, uint64_t id
)
933 updgrp_show_adj(bgp
, afi
, safi
, vty
, id
, UPDWALK_FLAGS_ADVQUEUE
);
936 void update_group_show_advertised(struct bgp
*bgp
, afi_t afi
, safi_t safi
,
937 struct vty
*vty
, uint64_t id
)
939 updgrp_show_adj(bgp
, afi
, safi
, vty
, id
, UPDWALK_FLAGS_ADVERTISED
);
942 void update_group_announce(struct bgp
*bgp
)
944 update_group_walk(bgp
, update_group_announce_walkcb
, NULL
);
947 void update_group_announce_rrclients(struct bgp
*bgp
)
949 update_group_walk(bgp
, update_group_announce_rrc_walkcb
, NULL
);