2 * bgp_updgrp.c: BGP update group structures
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_table.h"
49 #include "bgpd/bgp_debug.h"
50 #include "bgpd/bgp_errors.h"
51 #include "bgpd/bgp_fsm.h"
52 #include "bgpd/bgp_advertise.h"
53 #include "bgpd/bgp_packet.h"
54 #include "bgpd/bgp_updgrp.h"
55 #include "bgpd/bgp_route.h"
56 #include "bgpd/bgp_filter.h"
57 #include "bgpd/bgp_io.h"
64 * assign a unique ID to update group and subgroup. Mostly for display/
65 * debugging purposes. It's a 64-bit space - used leisurely without a
66 * worry about its wrapping and about filling gaps. While at it, timestamp
69 static void update_group_checkin(struct update_group
*updgrp
)
71 updgrp
->id
= ++bm
->updgrp_idspace
;
72 updgrp
->uptime
= bgp_clock();
75 static void update_subgroup_checkin(struct update_subgroup
*subgrp
,
76 struct update_group
*updgrp
)
78 subgrp
->id
= ++bm
->subgrp_idspace
;
79 subgrp
->uptime
= bgp_clock();
82 static void sync_init(struct update_subgroup
*subgrp
)
85 XCALLOC(MTYPE_BGP_SYNCHRONISE
, sizeof(struct bgp_synchronize
));
86 BGP_ADV_FIFO_INIT(&subgrp
->sync
->update
);
87 BGP_ADV_FIFO_INIT(&subgrp
->sync
->withdraw
);
88 BGP_ADV_FIFO_INIT(&subgrp
->sync
->withdraw_low
);
90 hash_create(baa_hash_key
, baa_hash_cmp
, "BGP SubGroup Hash");
92 /* We use a larger buffer for subgrp->work in the event that:
93 * - We RX a BGP_UPDATE where the attributes alone are just
94 * under BGP_MAX_PACKET_SIZE
95 * - The user configures an outbound route-map that does many as-path
96 * prepends or adds many communities. At most they can have
98 * args in a route-map so there is a finite limit on how large they
100 * make the attributes.
102 * Having a buffer with BGP_MAX_PACKET_SIZE_OVERFLOW allows us to avoid
104 * checking for every single attribute as we construct an UPDATE.
107 stream_new(BGP_MAX_PACKET_SIZE
+ BGP_MAX_PACKET_SIZE_OVERFLOW
);
108 subgrp
->scratch
= stream_new(BGP_MAX_PACKET_SIZE
);
111 static void sync_delete(struct update_subgroup
*subgrp
)
114 XFREE(MTYPE_BGP_SYNCHRONISE
, subgrp
->sync
);
117 hash_free(subgrp
->hash
);
120 stream_free(subgrp
->work
);
123 stream_free(subgrp
->scratch
);
124 subgrp
->scratch
= NULL
;
130 * copy only those fields that are relevant to update group match
132 static void conf_copy(struct peer
*dst
, struct peer
*src
, afi_t afi
,
135 struct bgp_filter
*srcfilter
;
136 struct bgp_filter
*dstfilter
;
138 srcfilter
= &src
->filter
[afi
][safi
];
139 dstfilter
= &dst
->filter
[afi
][safi
];
142 dst
->sort
= src
->sort
;
144 dst
->v_routeadv
= src
->v_routeadv
;
145 dst
->flags
= src
->flags
;
146 dst
->af_flags
[afi
][safi
] = src
->af_flags
[afi
][safi
];
148 XFREE(MTYPE_BGP_PEER_HOST
, dst
->host
);
150 dst
->host
= XSTRDUP(MTYPE_BGP_PEER_HOST
, src
->host
);
152 dst
->af_cap
[afi
][safi
] = src
->af_cap
[afi
][safi
];
153 dst
->afc_nego
[afi
][safi
] = src
->afc_nego
[afi
][safi
];
154 dst
->orf_plist
[afi
][safi
] = src
->orf_plist
[afi
][safi
];
155 dst
->local_as
= src
->local_as
;
156 dst
->change_local_as
= src
->change_local_as
;
157 dst
->shared_network
= src
->shared_network
;
158 memcpy(&(dst
->nexthop
), &(src
->nexthop
), sizeof(struct bgp_nexthop
));
160 dst
->group
= src
->group
;
162 if (src
->default_rmap
[afi
][safi
].name
) {
163 dst
->default_rmap
[afi
][safi
].name
=
164 XSTRDUP(MTYPE_ROUTE_MAP_NAME
,
165 src
->default_rmap
[afi
][safi
].name
);
166 dst
->default_rmap
[afi
][safi
].map
=
167 src
->default_rmap
[afi
][safi
].map
;
170 if (DISTRIBUTE_OUT_NAME(srcfilter
)) {
171 DISTRIBUTE_OUT_NAME(dstfilter
) = XSTRDUP(
172 MTYPE_BGP_FILTER_NAME
, DISTRIBUTE_OUT_NAME(srcfilter
));
173 DISTRIBUTE_OUT(dstfilter
) = DISTRIBUTE_OUT(srcfilter
);
176 if (PREFIX_LIST_OUT_NAME(srcfilter
)) {
177 PREFIX_LIST_OUT_NAME(dstfilter
) = XSTRDUP(
178 MTYPE_BGP_FILTER_NAME
, PREFIX_LIST_OUT_NAME(srcfilter
));
179 PREFIX_LIST_OUT(dstfilter
) = PREFIX_LIST_OUT(srcfilter
);
182 if (FILTER_LIST_OUT_NAME(srcfilter
)) {
183 FILTER_LIST_OUT_NAME(dstfilter
) = XSTRDUP(
184 MTYPE_BGP_FILTER_NAME
, FILTER_LIST_OUT_NAME(srcfilter
));
185 FILTER_LIST_OUT(dstfilter
) = FILTER_LIST_OUT(srcfilter
);
188 if (ROUTE_MAP_OUT_NAME(srcfilter
)) {
189 ROUTE_MAP_OUT_NAME(dstfilter
) = XSTRDUP(
190 MTYPE_BGP_FILTER_NAME
, ROUTE_MAP_OUT_NAME(srcfilter
));
191 ROUTE_MAP_OUT(dstfilter
) = ROUTE_MAP_OUT(srcfilter
);
194 if (UNSUPPRESS_MAP_NAME(srcfilter
)) {
195 UNSUPPRESS_MAP_NAME(dstfilter
) = XSTRDUP(
196 MTYPE_BGP_FILTER_NAME
, UNSUPPRESS_MAP_NAME(srcfilter
));
197 UNSUPPRESS_MAP(dstfilter
) = UNSUPPRESS_MAP(srcfilter
);
202 * since we did a bunch of XSTRDUP's in conf_copy, time to free them up
204 static void conf_release(struct peer
*src
, afi_t afi
, safi_t safi
)
206 struct bgp_filter
*srcfilter
;
208 srcfilter
= &src
->filter
[afi
][safi
];
210 if (src
->default_rmap
[afi
][safi
].name
)
211 XFREE(MTYPE_ROUTE_MAP_NAME
, src
->default_rmap
[afi
][safi
].name
);
213 if (srcfilter
->dlist
[FILTER_OUT
].name
)
214 XFREE(MTYPE_BGP_FILTER_NAME
, srcfilter
->dlist
[FILTER_OUT
].name
);
216 if (srcfilter
->plist
[FILTER_OUT
].name
)
217 XFREE(MTYPE_BGP_FILTER_NAME
, srcfilter
->plist
[FILTER_OUT
].name
);
219 if (srcfilter
->aslist
[FILTER_OUT
].name
)
220 XFREE(MTYPE_BGP_FILTER_NAME
,
221 srcfilter
->aslist
[FILTER_OUT
].name
);
223 if (srcfilter
->map
[RMAP_OUT
].name
)
224 XFREE(MTYPE_BGP_FILTER_NAME
, srcfilter
->map
[RMAP_OUT
].name
);
226 if (srcfilter
->usmap
.name
)
227 XFREE(MTYPE_BGP_FILTER_NAME
, srcfilter
->usmap
.name
);
230 XFREE(MTYPE_BGP_PEER_HOST
, src
->host
);
234 static void peer2_updgrp_copy(struct update_group
*updgrp
, struct peer_af
*paf
)
247 updgrp
->afi
= paf
->afi
;
248 updgrp
->safi
= paf
->safi
;
249 updgrp
->afid
= paf
->afid
;
250 updgrp
->bgp
= src
->bgp
;
252 conf_copy(dst
, src
, paf
->afi
, paf
->safi
);
256 * auxiliary functions to maintain the hash table.
257 * - updgrp_hash_alloc - to create a new entry, passed to hash_get
258 * - updgrp_hash_key_make - makes the key for update group search
259 * - updgrp_hash_cmp - compare two update groups.
261 static void *updgrp_hash_alloc(void *p
)
263 struct update_group
*updgrp
;
264 const struct update_group
*in
;
266 in
= (const struct update_group
*)p
;
267 updgrp
= XCALLOC(MTYPE_BGP_UPDGRP
, sizeof(struct update_group
));
268 memcpy(updgrp
, in
, sizeof(struct update_group
));
269 updgrp
->conf
= XCALLOC(MTYPE_BGP_PEER
, sizeof(struct peer
));
270 conf_copy(updgrp
->conf
, in
->conf
, in
->afi
, in
->safi
);
275 * The hash value for a peer is computed from the following variables:
277 * 1. IBGP (1) or EBGP (2)
278 * 2. FLAGS based on configuration:
279 * LOCAL_AS_NO_PREPEND
280 * LOCAL_AS_REPLACE_AS
281 * 3. AF_FLAGS based on configuration:
282 * Refer to definition in bgp_updgrp.h
283 * 4. (AF-independent) Capability flags:
285 * 5. (AF-dependent) Capability flags:
286 * ORF_PREFIX_SM_RCV (peer can send prefix ORF)
289 * 8. Outbound route-map name (neighbor route-map <> out)
290 * 9. Outbound distribute-list name (neighbor distribute-list <> out)
291 * 10. Outbound prefix-list name (neighbor prefix-list <> out)
292 * 11. Outbound as-list name (neighbor filter-list <> out)
293 * 12. Unsuppress map name (neighbor unsuppress-map <>)
294 * 13. default rmap name (neighbor default-originate route-map <>)
295 * 14. encoding both global and link-local nexthop?
296 * 15. If peer is configured to be a lonesoul, peer ip address
297 * 16. Local-as should match, if configured.
300 static unsigned int updgrp_hash_key_make(void *p
)
302 const struct update_group
*updgrp
;
303 const struct peer
*peer
;
304 const struct bgp_filter
*filter
;
311 #define SEED2 2147483647
317 flags
= peer
->af_flags
[afi
][safi
];
318 filter
= &peer
->filter
[afi
][safi
];
322 key
= jhash_1word(peer
->sort
, key
); /* EBGP or IBGP */
323 key
= jhash_1word((peer
->flags
& PEER_UPDGRP_FLAGS
), key
);
324 key
= jhash_1word((flags
& PEER_UPDGRP_AF_FLAGS
), key
);
325 key
= jhash_1word((peer
->cap
& PEER_UPDGRP_CAP_FLAGS
), key
);
326 key
= jhash_1word((peer
->af_cap
[afi
][safi
] & PEER_UPDGRP_AF_CAP_FLAGS
),
328 key
= jhash_1word(peer
->v_routeadv
, key
);
329 key
= jhash_1word(peer
->change_local_as
, key
);
332 key
= jhash_1word(jhash(peer
->group
->name
,
333 strlen(peer
->group
->name
), SEED1
),
336 if (filter
->map
[RMAP_OUT
].name
)
337 key
= jhash_1word(jhash(filter
->map
[RMAP_OUT
].name
,
338 strlen(filter
->map
[RMAP_OUT
].name
),
342 if (filter
->dlist
[FILTER_OUT
].name
)
343 key
= jhash_1word(jhash(filter
->dlist
[FILTER_OUT
].name
,
344 strlen(filter
->dlist
[FILTER_OUT
].name
),
348 if (filter
->plist
[FILTER_OUT
].name
)
349 key
= jhash_1word(jhash(filter
->plist
[FILTER_OUT
].name
,
350 strlen(filter
->plist
[FILTER_OUT
].name
),
354 if (filter
->aslist
[FILTER_OUT
].name
)
355 key
= jhash_1word(jhash(filter
->aslist
[FILTER_OUT
].name
,
356 strlen(filter
->aslist
[FILTER_OUT
].name
),
360 if (filter
->usmap
.name
)
361 key
= jhash_1word(jhash(filter
->usmap
.name
,
362 strlen(filter
->usmap
.name
), SEED1
),
365 if (peer
->default_rmap
[afi
][safi
].name
)
367 jhash(peer
->default_rmap
[afi
][safi
].name
,
368 strlen(peer
->default_rmap
[afi
][safi
].name
),
372 /* If peer is on a shared network and is exchanging IPv6 prefixes,
373 * it needs to include link-local address. That's different from
374 * non-shared-network peers (nexthop encoded with 32 bytes vs 16
375 * bytes). We create different update groups to take care of that.
378 (peer
->shared_network
&& peer_afi_active_nego(peer
, AFI_IP6
)),
382 * There are certain peers that must get their own update-group:
384 * - peers that negotiated ORF
386 if (CHECK_FLAG(peer
->flags
, PEER_FLAG_LONESOUL
)
387 || CHECK_FLAG(peer
->af_cap
[afi
][safi
], PEER_CAP_ORF_PREFIX_SM_RCV
)
388 || CHECK_FLAG(peer
->af_cap
[afi
][safi
],
389 PEER_CAP_ORF_PREFIX_SM_OLD_RCV
))
390 key
= jhash_1word(jhash(peer
->host
, strlen(peer
->host
), SEED2
),
396 static int updgrp_hash_cmp(const void *p1
, const void *p2
)
398 const struct update_group
*grp1
;
399 const struct update_group
*grp2
;
400 const struct peer
*pe1
;
401 const struct peer
*pe2
;
404 const struct bgp_filter
*fl1
;
405 const struct bgp_filter
*fl2
;
418 flags1
= pe1
->af_flags
[afi
][safi
];
419 flags2
= pe2
->af_flags
[afi
][safi
];
420 fl1
= &pe1
->filter
[afi
][safi
];
421 fl2
= &pe2
->filter
[afi
][safi
];
423 /* put EBGP and IBGP peers in different update groups */
424 if (pe1
->sort
!= pe2
->sort
)
427 /* check peer flags */
428 if ((pe1
->flags
& PEER_UPDGRP_FLAGS
)
429 != (pe2
->flags
& PEER_UPDGRP_FLAGS
))
432 /* If there is 'local-as' configured, it should match. */
433 if (pe1
->change_local_as
!= pe2
->change_local_as
)
436 /* flags like route reflector client */
437 if ((flags1
& PEER_UPDGRP_AF_FLAGS
) != (flags2
& PEER_UPDGRP_AF_FLAGS
))
440 if ((pe1
->cap
& PEER_UPDGRP_CAP_FLAGS
)
441 != (pe2
->cap
& PEER_UPDGRP_CAP_FLAGS
))
444 if ((pe1
->af_cap
[afi
][safi
] & PEER_UPDGRP_AF_CAP_FLAGS
)
445 != (pe2
->af_cap
[afi
][safi
] & PEER_UPDGRP_AF_CAP_FLAGS
))
448 if (pe1
->v_routeadv
!= pe2
->v_routeadv
)
451 if (pe1
->group
!= pe2
->group
)
454 /* route-map names should be the same */
455 if ((fl1
->map
[RMAP_OUT
].name
&& !fl2
->map
[RMAP_OUT
].name
)
456 || (!fl1
->map
[RMAP_OUT
].name
&& fl2
->map
[RMAP_OUT
].name
)
457 || (fl1
->map
[RMAP_OUT
].name
&& fl2
->map
[RMAP_OUT
].name
458 && strcmp(fl1
->map
[RMAP_OUT
].name
, fl2
->map
[RMAP_OUT
].name
)))
461 if ((fl1
->dlist
[FILTER_OUT
].name
&& !fl2
->dlist
[FILTER_OUT
].name
)
462 || (!fl1
->dlist
[FILTER_OUT
].name
&& fl2
->dlist
[FILTER_OUT
].name
)
463 || (fl1
->dlist
[FILTER_OUT
].name
&& fl2
->dlist
[FILTER_OUT
].name
464 && strcmp(fl1
->dlist
[FILTER_OUT
].name
,
465 fl2
->dlist
[FILTER_OUT
].name
)))
468 if ((fl1
->plist
[FILTER_OUT
].name
&& !fl2
->plist
[FILTER_OUT
].name
)
469 || (!fl1
->plist
[FILTER_OUT
].name
&& fl2
->plist
[FILTER_OUT
].name
)
470 || (fl1
->plist
[FILTER_OUT
].name
&& fl2
->plist
[FILTER_OUT
].name
471 && strcmp(fl1
->plist
[FILTER_OUT
].name
,
472 fl2
->plist
[FILTER_OUT
].name
)))
475 if ((fl1
->aslist
[FILTER_OUT
].name
&& !fl2
->aslist
[FILTER_OUT
].name
)
476 || (!fl1
->aslist
[FILTER_OUT
].name
&& fl2
->aslist
[FILTER_OUT
].name
)
477 || (fl1
->aslist
[FILTER_OUT
].name
&& fl2
->aslist
[FILTER_OUT
].name
478 && strcmp(fl1
->aslist
[FILTER_OUT
].name
,
479 fl2
->aslist
[FILTER_OUT
].name
)))
482 if ((fl1
->usmap
.name
&& !fl2
->usmap
.name
)
483 || (!fl1
->usmap
.name
&& fl2
->usmap
.name
)
484 || (fl1
->usmap
.name
&& fl2
->usmap
.name
485 && strcmp(fl1
->usmap
.name
, fl2
->usmap
.name
)))
488 if ((pe1
->default_rmap
[afi
][safi
].name
489 && !pe2
->default_rmap
[afi
][safi
].name
)
490 || (!pe1
->default_rmap
[afi
][safi
].name
491 && pe2
->default_rmap
[afi
][safi
].name
)
492 || (pe1
->default_rmap
[afi
][safi
].name
493 && pe2
->default_rmap
[afi
][safi
].name
494 && strcmp(pe1
->default_rmap
[afi
][safi
].name
,
495 pe2
->default_rmap
[afi
][safi
].name
)))
498 if ((afi
== AFI_IP6
) && (pe1
->shared_network
!= pe2
->shared_network
))
501 if ((CHECK_FLAG(pe1
->flags
, PEER_FLAG_LONESOUL
)
502 || CHECK_FLAG(pe1
->af_cap
[afi
][safi
], PEER_CAP_ORF_PREFIX_SM_RCV
)
503 || CHECK_FLAG(pe1
->af_cap
[afi
][safi
],
504 PEER_CAP_ORF_PREFIX_SM_OLD_RCV
))
505 && !sockunion_same(&pe1
->su
, &pe2
->su
))
511 static void peer_lonesoul_or_not(struct peer
*peer
, int set
)
513 /* no change in status? */
514 if (set
== (CHECK_FLAG(peer
->flags
, PEER_FLAG_LONESOUL
) > 0))
518 SET_FLAG(peer
->flags
, PEER_FLAG_LONESOUL
);
520 UNSET_FLAG(peer
->flags
, PEER_FLAG_LONESOUL
);
522 update_group_adjust_peer_afs(peer
);
526 * subgroup_total_packets_enqueued
528 * Returns the total number of packets enqueued to a subgroup.
531 subgroup_total_packets_enqueued(struct update_subgroup
*subgrp
)
535 pkt
= bpacket_queue_last(SUBGRP_PKTQ(subgrp
));
540 static int update_group_show_walkcb(struct update_group
*updgrp
, void *arg
)
542 struct updwalk_context
*ctx
= arg
;
544 struct update_subgroup
*subgrp
;
546 struct bgp_filter
*filter
;
552 if (ctx
->subgrp_id
) {
553 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
554 if (ctx
->subgrp_id
&& (ctx
->subgrp_id
!= subgrp
->id
))
566 /* Since this routine is invoked from a walk, we cannot signal
568 /* error here, can only return. */
574 vty_out(vty
, "Update-group %" PRIu64
":\n", updgrp
->id
);
575 vty_out(vty
, " Created: %s", timestamp_string(updgrp
->uptime
));
576 filter
= &updgrp
->conf
->filter
[updgrp
->afi
][updgrp
->safi
];
577 if (filter
->map
[RMAP_OUT
].name
)
578 vty_out(vty
, " Outgoing route map: %s%s\n",
579 filter
->map
[RMAP_OUT
].map
? "X" : "",
580 filter
->map
[RMAP_OUT
].name
);
581 vty_out(vty
, " MRAI value (seconds): %d\n", updgrp
->conf
->v_routeadv
);
582 if (updgrp
->conf
->change_local_as
)
583 vty_out(vty
, " Local AS %u%s%s\n",
584 updgrp
->conf
->change_local_as
,
585 CHECK_FLAG(updgrp
->conf
->flags
,
586 PEER_FLAG_LOCAL_AS_NO_PREPEND
)
589 CHECK_FLAG(updgrp
->conf
->flags
,
590 PEER_FLAG_LOCAL_AS_REPLACE_AS
)
594 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
595 if (ctx
->subgrp_id
&& (ctx
->subgrp_id
!= subgrp
->id
))
598 vty_out(vty
, " Update-subgroup %" PRIu64
":\n", subgrp
->id
);
599 vty_out(vty
, " Created: %s",
600 timestamp_string(subgrp
->uptime
));
602 if (subgrp
->split_from
.update_group_id
603 || subgrp
->split_from
.subgroup_id
) {
604 vty_out(vty
, " Split from group id: %" PRIu64
"\n",
605 subgrp
->split_from
.update_group_id
);
607 " Split from subgroup id: %" PRIu64
"\n",
608 subgrp
->split_from
.subgroup_id
);
611 vty_out(vty
, " Join events: %u\n", subgrp
->join_events
);
612 vty_out(vty
, " Prune events: %u\n", subgrp
->prune_events
);
613 vty_out(vty
, " Merge events: %u\n", subgrp
->merge_events
);
614 vty_out(vty
, " Split events: %u\n", subgrp
->split_events
);
615 vty_out(vty
, " Update group switch events: %u\n",
616 subgrp
->updgrp_switch_events
);
617 vty_out(vty
, " Peer refreshes combined: %u\n",
618 subgrp
->peer_refreshes_combined
);
619 vty_out(vty
, " Merge checks triggered: %u\n",
620 subgrp
->merge_checks_triggered
);
621 vty_out(vty
, " Version: %" PRIu64
"\n", subgrp
->version
);
622 vty_out(vty
, " Packet queue length: %d\n",
623 bpacket_queue_length(SUBGRP_PKTQ(subgrp
)));
624 vty_out(vty
, " Total packets enqueued: %u\n",
625 subgroup_total_packets_enqueued(subgrp
));
626 vty_out(vty
, " Packet queue high watermark: %d\n",
627 bpacket_queue_hwm_length(SUBGRP_PKTQ(subgrp
)));
628 vty_out(vty
, " Adj-out list count: %u\n", subgrp
->adj_count
);
629 vty_out(vty
, " Advertise list: %s\n",
630 advertise_list_is_empty(subgrp
) ? "empty"
632 vty_out(vty
, " Flags: %s\n",
633 CHECK_FLAG(subgrp
->flags
, SUBGRP_FLAG_NEEDS_REFRESH
)
636 if (subgrp
->peer_count
> 0) {
637 vty_out(vty
, " Peers:\n");
638 SUBGRP_FOREACH_PEER (subgrp
, paf
)
639 vty_out(vty
, " - %s\n", paf
->peer
->host
);
642 return UPDWALK_CONTINUE
;
646 * Helper function to show the packet queue for each subgroup of update group.
647 * Will be constrained to a particular subgroup id if id !=0
649 static int updgrp_show_packet_queue_walkcb(struct update_group
*updgrp
,
652 struct updwalk_context
*ctx
= arg
;
653 struct update_subgroup
*subgrp
;
657 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
658 if (ctx
->subgrp_id
&& (ctx
->subgrp_id
!= subgrp
->id
))
660 vty_out(vty
, "update group %" PRIu64
", subgroup %" PRIu64
"\n",
661 updgrp
->id
, subgrp
->id
);
662 bpacket_queue_show_vty(SUBGRP_PKTQ(subgrp
), vty
);
664 return UPDWALK_CONTINUE
;
668 * Show the packet queue for each subgroup of update group. Will be
669 * constrained to a particular subgroup id if id !=0
671 void update_group_show_packet_queue(struct bgp
*bgp
, afi_t afi
, safi_t safi
,
672 struct vty
*vty
, uint64_t id
)
674 struct updwalk_context ctx
;
676 memset(&ctx
, 0, sizeof(ctx
));
680 update_group_af_walk(bgp
, afi
, safi
, updgrp_show_packet_queue_walkcb
,
684 static struct update_group
*update_group_find(struct peer_af
*paf
)
686 struct update_group
*updgrp
;
687 struct update_group tmp
;
688 struct peer tmp_conf
;
690 if (!peer_established(PAF_PEER(paf
)))
693 memset(&tmp
, 0, sizeof(tmp
));
694 memset(&tmp_conf
, 0, sizeof(tmp_conf
));
695 tmp
.conf
= &tmp_conf
;
696 peer2_updgrp_copy(&tmp
, paf
);
698 updgrp
= hash_lookup(paf
->peer
->bgp
->update_groups
[paf
->afid
], &tmp
);
699 conf_release(&tmp_conf
, paf
->afi
, paf
->safi
);
703 static struct update_group
*update_group_create(struct peer_af
*paf
)
705 struct update_group
*updgrp
;
706 struct update_group tmp
;
707 struct peer tmp_conf
;
709 memset(&tmp
, 0, sizeof(tmp
));
710 memset(&tmp_conf
, 0, sizeof(tmp_conf
));
711 tmp
.conf
= &tmp_conf
;
712 peer2_updgrp_copy(&tmp
, paf
);
714 updgrp
= hash_get(paf
->peer
->bgp
->update_groups
[paf
->afid
], &tmp
,
718 update_group_checkin(updgrp
);
720 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
721 zlog_debug("create update group %" PRIu64
, updgrp
->id
);
723 UPDGRP_GLOBAL_STAT(updgrp
, updgrps_created
) += 1;
725 conf_release(&tmp_conf
, paf
->afi
, paf
->safi
);
729 static void update_group_delete(struct update_group
*updgrp
)
731 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
732 zlog_debug("delete update group %" PRIu64
, updgrp
->id
);
734 UPDGRP_GLOBAL_STAT(updgrp
, updgrps_deleted
) += 1;
736 hash_release(updgrp
->bgp
->update_groups
[updgrp
->afid
], updgrp
);
737 conf_release(updgrp
->conf
, updgrp
->afi
, updgrp
->safi
);
739 if (updgrp
->conf
->host
)
740 XFREE(MTYPE_BGP_PEER_HOST
, updgrp
->conf
->host
);
741 updgrp
->conf
->host
= NULL
;
743 if (updgrp
->conf
->ifname
)
744 XFREE(MTYPE_BGP_PEER_IFNAME
, updgrp
->conf
->ifname
);
746 XFREE(MTYPE_BGP_PEER
, updgrp
->conf
);
747 XFREE(MTYPE_BGP_UPDGRP
, updgrp
);
750 static void update_group_add_subgroup(struct update_group
*updgrp
,
751 struct update_subgroup
*subgrp
)
753 if (!updgrp
|| !subgrp
)
756 LIST_INSERT_HEAD(&(updgrp
->subgrps
), subgrp
, updgrp_train
);
757 subgrp
->update_group
= updgrp
;
760 static void update_group_remove_subgroup(struct update_group
*updgrp
,
761 struct update_subgroup
*subgrp
)
763 if (!updgrp
|| !subgrp
)
766 LIST_REMOVE(subgrp
, updgrp_train
);
767 subgrp
->update_group
= NULL
;
768 if (LIST_EMPTY(&(updgrp
->subgrps
)))
769 update_group_delete(updgrp
);
772 static struct update_subgroup
*
773 update_subgroup_create(struct update_group
*updgrp
)
775 struct update_subgroup
*subgrp
;
777 subgrp
= XCALLOC(MTYPE_BGP_UPD_SUBGRP
, sizeof(struct update_subgroup
));
778 update_subgroup_checkin(subgrp
, updgrp
);
779 subgrp
->v_coalesce
= (UPDGRP_INST(updgrp
))->coalesce_time
;
781 bpacket_queue_init(SUBGRP_PKTQ(subgrp
));
782 bpacket_queue_add(SUBGRP_PKTQ(subgrp
), NULL
, NULL
);
783 TAILQ_INIT(&(subgrp
->adjq
));
784 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
785 zlog_debug("create subgroup u%" PRIu64
":s%" PRIu64
, updgrp
->id
,
788 update_group_add_subgroup(updgrp
, subgrp
);
790 UPDGRP_INCR_STAT(updgrp
, subgrps_created
);
795 static void update_subgroup_delete(struct update_subgroup
*subgrp
)
800 if (subgrp
->update_group
)
801 UPDGRP_INCR_STAT(subgrp
->update_group
, subgrps_deleted
);
803 if (subgrp
->t_merge_check
)
804 THREAD_OFF(subgrp
->t_merge_check
);
806 if (subgrp
->t_coalesce
)
807 THREAD_TIMER_OFF(subgrp
->t_coalesce
);
809 bpacket_queue_cleanup(SUBGRP_PKTQ(subgrp
));
810 subgroup_clear_table(subgrp
);
812 if (subgrp
->t_coalesce
)
813 THREAD_TIMER_OFF(subgrp
->t_coalesce
);
816 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
) && subgrp
->update_group
)
817 zlog_debug("delete subgroup u%" PRIu64
":s%" PRIu64
,
818 subgrp
->update_group
->id
, subgrp
->id
);
820 update_group_remove_subgroup(subgrp
->update_group
, subgrp
);
822 XFREE(MTYPE_BGP_UPD_SUBGRP
, subgrp
);
825 void update_subgroup_inherit_info(struct update_subgroup
*to
,
826 struct update_subgroup
*from
)
831 to
->sflags
= from
->sflags
;
835 * update_subgroup_check_delete
837 * Delete a subgroup if it is ready to be deleted.
839 * Returns TRUE if the subgroup was deleted.
841 static int update_subgroup_check_delete(struct update_subgroup
*subgrp
)
846 if (!LIST_EMPTY(&(subgrp
->peers
)))
849 update_subgroup_delete(subgrp
);
855 * update_subgroup_add_peer
857 * @param send_enqueued_packets If true all currently enqueued packets will
858 * also be sent to the peer.
860 static void update_subgroup_add_peer(struct update_subgroup
*subgrp
,
862 int send_enqueued_pkts
)
869 LIST_INSERT_HEAD(&(subgrp
->peers
), paf
, subgrp_train
);
870 paf
->subgroup
= subgrp
;
871 subgrp
->peer_count
++;
873 if (bgp_debug_peer_updout_enabled(paf
->peer
->host
)) {
874 UPDGRP_PEER_DBG_EN(subgrp
->update_group
);
877 SUBGRP_INCR_STAT(subgrp
, join_events
);
879 if (send_enqueued_pkts
) {
880 pkt
= bpacket_queue_first(SUBGRP_PKTQ(subgrp
));
884 * Hang the peer off of the last, placeholder, packet in the
885 * queue. This means it won't see any of the packets that are
886 * currently the queue.
888 pkt
= bpacket_queue_last(SUBGRP_PKTQ(subgrp
));
889 assert(pkt
->buffer
== NULL
);
892 bpacket_add_peer(pkt
, paf
);
894 bpacket_queue_sanity_check(SUBGRP_PKTQ(subgrp
));
898 * update_subgroup_remove_peer_internal
900 * Internal function that removes a peer from a subgroup, but does not
901 * delete the subgroup. A call to this function must almost always be
902 * followed by a call to update_subgroup_check_delete().
904 * @see update_subgroup_remove_peer
906 static void update_subgroup_remove_peer_internal(struct update_subgroup
*subgrp
,
909 assert(subgrp
&& paf
&& subgrp
->update_group
);
911 if (bgp_debug_peer_updout_enabled(paf
->peer
->host
)) {
912 UPDGRP_PEER_DBG_DIS(subgrp
->update_group
);
915 bpacket_queue_remove_peer(paf
);
916 LIST_REMOVE(paf
, subgrp_train
);
917 paf
->subgroup
= NULL
;
918 subgrp
->peer_count
--;
920 SUBGRP_INCR_STAT(subgrp
, prune_events
);
924 * update_subgroup_remove_peer
926 void update_subgroup_remove_peer(struct update_subgroup
*subgrp
,
932 update_subgroup_remove_peer_internal(subgrp
, paf
);
934 if (update_subgroup_check_delete(subgrp
))
938 * The deletion of the peer may have caused some packets to be
939 * deleted from the subgroup packet queue. Check if the subgroup can
942 update_subgroup_check_merge(subgrp
, "removed peer from subgroup");
945 static struct update_subgroup
*update_subgroup_find(struct update_group
*updgrp
,
948 struct update_subgroup
*subgrp
= NULL
;
957 if (!peer_established(PAF_PEER(paf
)))
960 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
961 if (subgrp
->version
!= version
962 || CHECK_FLAG(subgrp
->sflags
,
963 SUBGRP_STATUS_DEFAULT_ORIGINATE
))
967 * The version number is not meaningful on a subgroup that needs
970 if (update_subgroup_needs_refresh(subgrp
))
980 * update_subgroup_ready_for_merge
982 * Returns TRUE if this subgroup is in a state that allows it to be
983 * merged into another subgroup.
985 static int update_subgroup_ready_for_merge(struct update_subgroup
*subgrp
)
989 * Not ready if there are any encoded packets waiting to be written
992 if (!bpacket_queue_is_empty(SUBGRP_PKTQ(subgrp
)))
996 * Not ready if there enqueued updates waiting to be encoded.
998 if (!advertise_list_is_empty(subgrp
))
1002 * Don't attempt to merge a subgroup that needs a refresh. For one,
1003 * we can't determine if the adj_out of such a group matches that of
1006 if (update_subgroup_needs_refresh(subgrp
))
1013 * update_subgrp_can_merge_into
1015 * Returns TRUE if the first subgroup can merge into the second
1018 static int update_subgroup_can_merge_into(struct update_subgroup
*subgrp
,
1019 struct update_subgroup
*target
)
1022 if (subgrp
== target
)
1026 * Both must have processed the BRIB to the same point in order to
1029 if (subgrp
->version
!= target
->version
)
1032 if (CHECK_FLAG(subgrp
->sflags
, SUBGRP_STATUS_DEFAULT_ORIGINATE
)
1033 != CHECK_FLAG(target
->sflags
, SUBGRP_STATUS_DEFAULT_ORIGINATE
))
1036 if (subgrp
->adj_count
!= target
->adj_count
)
1039 return update_subgroup_ready_for_merge(target
);
1043 * update_subgroup_merge
1045 * Merge the first subgroup into the second one.
1047 static void update_subgroup_merge(struct update_subgroup
*subgrp
,
1048 struct update_subgroup
*target
,
1051 struct peer_af
*paf
;
1055 assert(subgrp
->adj_count
== target
->adj_count
);
1057 peer_count
= subgrp
->peer_count
;
1060 paf
= LIST_FIRST(&subgrp
->peers
);
1064 update_subgroup_remove_peer_internal(subgrp
, paf
);
1067 * Add the peer to the target subgroup, while making sure that
1068 * any currently enqueued packets won't be sent to it. Enqueued
1069 * packets could, for example, result in an unnecessary withdraw
1070 * followed by an advertise.
1072 update_subgroup_add_peer(target
, paf
, 0);
1075 SUBGRP_INCR_STAT(target
, merge_events
);
1077 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
1078 zlog_debug("u%" PRIu64
":s%" PRIu64
1079 " (%d peers) merged into u%" PRIu64
":s%" PRIu64
1082 subgrp
->update_group
->id
, subgrp
->id
, peer_count
,
1083 target
->update_group
->id
, target
->id
,
1084 reason
? reason
: "unknown");
1086 result
= update_subgroup_check_delete(subgrp
);
1091 * update_subgroup_check_merge
1093 * Merge this subgroup into another subgroup if possible.
1095 * Returns TRUE if the subgroup has been merged. The subgroup pointer
1096 * should not be accessed in this case.
1098 int update_subgroup_check_merge(struct update_subgroup
*subgrp
,
1101 struct update_subgroup
*target
;
1103 if (!update_subgroup_ready_for_merge(subgrp
))
1107 * Look for a subgroup to merge into.
1109 UPDGRP_FOREACH_SUBGRP (subgrp
->update_group
, target
) {
1110 if (update_subgroup_can_merge_into(subgrp
, target
))
1117 update_subgroup_merge(subgrp
, target
, reason
);
1122 * update_subgroup_merge_check_thread_cb
1124 static int update_subgroup_merge_check_thread_cb(struct thread
*thread
)
1126 struct update_subgroup
*subgrp
;
1128 subgrp
= THREAD_ARG(thread
);
1130 subgrp
->t_merge_check
= NULL
;
1132 update_subgroup_check_merge(subgrp
, "triggered merge check");
1137 * update_subgroup_trigger_merge_check
1139 * Triggers a call to update_subgroup_check_merge() on a clean context.
1141 * @param force If true, the merge check will be triggered even if the
1142 * subgroup doesn't currently look ready for a merge.
1144 * Returns TRUE if a merge check will be performed shortly.
1146 int update_subgroup_trigger_merge_check(struct update_subgroup
*subgrp
,
1149 if (subgrp
->t_merge_check
)
1152 if (!force
&& !update_subgroup_ready_for_merge(subgrp
))
1155 subgrp
->t_merge_check
= NULL
;
1156 thread_add_timer_msec(bm
->master
, update_subgroup_merge_check_thread_cb
,
1157 subgrp
, 0, &subgrp
->t_merge_check
);
1159 SUBGRP_INCR_STAT(subgrp
, merge_checks_triggered
);
1165 * update_subgroup_copy_adj_out
1167 * Helper function that clones the adj out (state about advertised
1168 * routes) from one subgroup to another. It assumes that the adj out
1169 * of the target subgroup is empty.
1171 static void update_subgroup_copy_adj_out(struct update_subgroup
*source
,
1172 struct update_subgroup
*dest
)
1174 struct bgp_adj_out
*aout
, *aout_copy
;
1176 SUBGRP_FOREACH_ADJ (source
, aout
) {
1181 bgp_adj_out_alloc(dest
, aout
->rn
, aout
->addpath_tx_id
);
1183 aout
->attr
? bgp_attr_intern(aout
->attr
) : NULL
;
1188 * update_subgroup_copy_packets
1190 * Copy packets after and including the given packet to the subgroup
1193 * Returns the number of packets copied.
1195 static int update_subgroup_copy_packets(struct update_subgroup
*dest
,
1196 struct bpacket
*pkt
)
1201 while (pkt
&& pkt
->buffer
) {
1202 bpacket_queue_add(SUBGRP_PKTQ(dest
), stream_dup(pkt
->buffer
),
1205 pkt
= bpacket_next(pkt
);
1208 bpacket_queue_sanity_check(SUBGRP_PKTQ(dest
));
1213 static int updgrp_prefix_list_update(struct update_group
*updgrp
,
1217 struct bgp_filter
*filter
;
1219 peer
= UPDGRP_PEER(updgrp
);
1220 filter
= &peer
->filter
[UPDGRP_AFI(updgrp
)][UPDGRP_SAFI(updgrp
)];
1222 if (PREFIX_LIST_OUT_NAME(filter
)
1223 && (strcmp(name
, PREFIX_LIST_OUT_NAME(filter
)) == 0)) {
1224 PREFIX_LIST_OUT(filter
) = prefix_list_lookup(
1225 UPDGRP_AFI(updgrp
), PREFIX_LIST_OUT_NAME(filter
));
1231 static int updgrp_filter_list_update(struct update_group
*updgrp
,
1235 struct bgp_filter
*filter
;
1237 peer
= UPDGRP_PEER(updgrp
);
1238 filter
= &peer
->filter
[UPDGRP_AFI(updgrp
)][UPDGRP_SAFI(updgrp
)];
1240 if (FILTER_LIST_OUT_NAME(filter
)
1241 && (strcmp(name
, FILTER_LIST_OUT_NAME(filter
)) == 0)) {
1242 FILTER_LIST_OUT(filter
) =
1243 as_list_lookup(FILTER_LIST_OUT_NAME(filter
));
1249 static int updgrp_distribute_list_update(struct update_group
*updgrp
,
1253 struct bgp_filter
*filter
;
1255 peer
= UPDGRP_PEER(updgrp
);
1256 filter
= &peer
->filter
[UPDGRP_AFI(updgrp
)][UPDGRP_SAFI(updgrp
)];
1258 if (DISTRIBUTE_OUT_NAME(filter
)
1259 && (strcmp(name
, DISTRIBUTE_OUT_NAME(filter
)) == 0)) {
1260 DISTRIBUTE_OUT(filter
) = access_list_lookup(
1261 UPDGRP_AFI(updgrp
), DISTRIBUTE_OUT_NAME(filter
));
1267 static int updgrp_route_map_update(struct update_group
*updgrp
,
1268 const char *name
, int *def_rmap_changed
)
1271 struct bgp_filter
*filter
;
1276 peer
= UPDGRP_PEER(updgrp
);
1277 afi
= UPDGRP_AFI(updgrp
);
1278 safi
= UPDGRP_SAFI(updgrp
);
1279 filter
= &peer
->filter
[afi
][safi
];
1281 if (ROUTE_MAP_OUT_NAME(filter
)
1282 && (strcmp(name
, ROUTE_MAP_OUT_NAME(filter
)) == 0)) {
1283 ROUTE_MAP_OUT(filter
) = route_map_lookup_by_name(name
);
1288 if (UNSUPPRESS_MAP_NAME(filter
)
1289 && (strcmp(name
, UNSUPPRESS_MAP_NAME(filter
)) == 0)) {
1290 UNSUPPRESS_MAP(filter
) = route_map_lookup_by_name(name
);
1294 /* process default-originate route-map */
1295 if (peer
->default_rmap
[afi
][safi
].name
1296 && (strcmp(name
, peer
->default_rmap
[afi
][safi
].name
) == 0)) {
1297 peer
->default_rmap
[afi
][safi
].map
=
1298 route_map_lookup_by_name(name
);
1299 if (def_rmap_changed
)
1300 *def_rmap_changed
= 1;
1306 * hash iteration callback function to process a policy change for an
1307 * update group. Check if the changed policy matches the updgrp's
1308 * outbound route-map or unsuppress-map or default-originate map or
1309 * filter-list or prefix-list or distribute-list.
1310 * Trigger update generation accordingly.
1312 static int updgrp_policy_update_walkcb(struct update_group
*updgrp
, void *arg
)
1314 struct updwalk_context
*ctx
= arg
;
1315 struct update_subgroup
*subgrp
;
1317 int def_changed
= 0;
1319 if (!updgrp
|| !ctx
|| !ctx
->policy_name
)
1320 return UPDWALK_CONTINUE
;
1322 switch (ctx
->policy_type
) {
1323 case BGP_POLICY_ROUTE_MAP
:
1324 changed
= updgrp_route_map_update(updgrp
, ctx
->policy_name
,
1327 case BGP_POLICY_FILTER_LIST
:
1328 changed
= updgrp_filter_list_update(updgrp
, ctx
->policy_name
);
1330 case BGP_POLICY_PREFIX_LIST
:
1331 changed
= updgrp_prefix_list_update(updgrp
, ctx
->policy_name
);
1333 case BGP_POLICY_DISTRIBUTE_LIST
:
1335 updgrp_distribute_list_update(updgrp
, ctx
->policy_name
);
1341 /* If not doing route update, return after updating "config" */
1342 if (!ctx
->policy_route_update
)
1343 return UPDWALK_CONTINUE
;
1345 /* If nothing has changed, return after updating "config" */
1346 if (!changed
&& !def_changed
)
1347 return UPDWALK_CONTINUE
;
1350 * If something has changed, at the beginning of a route-map
1352 * event, mark each subgroup's needs-refresh bit. For one, it signals to
1353 * whoever that the subgroup needs a refresh. Second, it prevents
1355 * merge of this subgroup with another before a complete (outbound)
1358 if (ctx
->policy_event_start_flag
) {
1359 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
1360 update_subgroup_set_needs_refresh(subgrp
, 1);
1362 return UPDWALK_CONTINUE
;
1365 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
1367 if (bgp_debug_update(NULL
, NULL
, updgrp
, 0))
1369 "u%" PRIu64
":s%" PRIu64
1370 " announcing routes upon policy %s (type %d) change",
1371 updgrp
->id
, subgrp
->id
,
1372 ctx
->policy_name
, ctx
->policy_type
);
1373 subgroup_announce_route(subgrp
);
1376 if (bgp_debug_update(NULL
, NULL
, updgrp
, 0))
1378 "u%" PRIu64
":s%" PRIu64
1379 " announcing default upon default routemap %s change",
1380 updgrp
->id
, subgrp
->id
,
1382 subgroup_default_originate(subgrp
, 0);
1384 update_subgroup_set_needs_refresh(subgrp
, 0);
1386 return UPDWALK_CONTINUE
;
1389 static int update_group_walkcb(struct hash_backet
*backet
, void *arg
)
1391 struct update_group
*updgrp
= backet
->data
;
1392 struct updwalk_context
*wctx
= arg
;
1393 int ret
= (*wctx
->cb
)(updgrp
, wctx
->context
);
1397 static int update_group_periodic_merge_walkcb(struct update_group
*updgrp
,
1400 struct update_subgroup
*subgrp
;
1401 struct update_subgroup
*tmp_subgrp
;
1402 const char *reason
= arg
;
1404 UPDGRP_FOREACH_SUBGRP_SAFE (updgrp
, subgrp
, tmp_subgrp
)
1405 update_subgroup_check_merge(subgrp
, reason
);
1406 return UPDWALK_CONTINUE
;
1409 /********************
1411 ********************/
1414 * trigger function when a policy (route-map/filter-list/prefix-list/
1415 * distribute-list etc.) content changes. Go through all the
1416 * update groups and process the change.
1418 * bgp: the bgp instance
1419 * ptype: the type of policy that got modified, see bgpd.h
1420 * pname: name of the policy
1421 * route_update: flag to control if an automatic update generation should
1423 * start_event: flag that indicates if it's the beginning of the change.
1424 * Esp. when the user is changing the content interactively
1425 * over multiple statements. Useful to set dirty flag on
1428 void update_group_policy_update(struct bgp
*bgp
, bgp_policy_type_e ptype
,
1429 const char *pname
, int route_update
,
1432 struct updwalk_context ctx
;
1434 memset(&ctx
, 0, sizeof(ctx
));
1435 ctx
.policy_type
= ptype
;
1436 ctx
.policy_name
= pname
;
1437 ctx
.policy_route_update
= route_update
;
1438 ctx
.policy_event_start_flag
= start_event
;
1441 update_group_walk(bgp
, updgrp_policy_update_walkcb
, &ctx
);
1445 * update_subgroup_split_peer
1447 * Ensure that the given peer is in a subgroup of its own in the
1448 * specified update group.
1450 void update_subgroup_split_peer(struct peer_af
*paf
,
1451 struct update_group
*updgrp
)
1453 struct update_subgroup
*old_subgrp
, *subgrp
;
1457 old_subgrp
= paf
->subgroup
;
1460 updgrp
= old_subgrp
->update_group
;
1463 * If the peer is alone in its subgroup, reuse the existing
1466 if (old_subgrp
->peer_count
== 1) {
1467 if (updgrp
== old_subgrp
->update_group
)
1470 subgrp
= old_subgrp
;
1471 old_id
= old_subgrp
->update_group
->id
;
1473 if (bgp_debug_peer_updout_enabled(paf
->peer
->host
)) {
1474 UPDGRP_PEER_DBG_DIS(old_subgrp
->update_group
);
1477 update_group_remove_subgroup(old_subgrp
->update_group
,
1479 update_group_add_subgroup(updgrp
, subgrp
);
1481 if (bgp_debug_peer_updout_enabled(paf
->peer
->host
)) {
1482 UPDGRP_PEER_DBG_EN(updgrp
);
1484 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
1485 zlog_debug("u%" PRIu64
":s%" PRIu64
1486 " peer %s moved to u%" PRIu64
":s%" PRIu64
,
1487 old_id
, subgrp
->id
, paf
->peer
->host
,
1488 updgrp
->id
, subgrp
->id
);
1491 * The state of the subgroup (adj_out, advs, packet queue etc)
1492 * is consistent internally, but may not be identical to other
1493 * subgroups in the new update group even if the version number
1494 * matches up. Make sure a full refresh is done before the
1495 * subgroup is merged with another.
1497 update_subgroup_set_needs_refresh(subgrp
, 1);
1499 SUBGRP_INCR_STAT(subgrp
, updgrp_switch_events
);
1504 * Create a new subgroup under the specified update group, and copy
1505 * over relevant state to it.
1507 subgrp
= update_subgroup_create(updgrp
);
1508 update_subgroup_inherit_info(subgrp
, old_subgrp
);
1510 subgrp
->split_from
.update_group_id
= old_subgrp
->update_group
->id
;
1511 subgrp
->split_from
.subgroup_id
= old_subgrp
->id
;
1514 * Copy out relevant state from the old subgroup.
1516 update_subgroup_copy_adj_out(paf
->subgroup
, subgrp
);
1517 update_subgroup_copy_packets(subgrp
, paf
->next_pkt_to_send
);
1519 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
1520 zlog_debug("u%" PRIu64
":s%" PRIu64
1521 " peer %s split and moved into u%" PRIu64
1523 paf
->subgroup
->update_group
->id
, paf
->subgroup
->id
,
1524 paf
->peer
->host
, updgrp
->id
, subgrp
->id
);
1526 SUBGRP_INCR_STAT(paf
->subgroup
, split_events
);
1529 * Since queued advs were left behind, this new subgroup needs a
1532 update_subgroup_set_needs_refresh(subgrp
, 1);
1535 * Remove peer from old subgroup, and add it to the new one.
1537 update_subgroup_remove_peer(paf
->subgroup
, paf
);
1539 update_subgroup_add_peer(subgrp
, paf
, 1);
1542 void update_bgp_group_init(struct bgp
*bgp
)
1547 bgp
->update_groups
[afid
] =
1548 hash_create(updgrp_hash_key_make
, updgrp_hash_cmp
,
1549 "BGP Update Group Hash");
1552 void update_bgp_group_free(struct bgp
*bgp
)
1557 if (bgp
->update_groups
[afid
]) {
1558 hash_free(bgp
->update_groups
[afid
]);
1559 bgp
->update_groups
[afid
] = NULL
;
1564 void update_group_show(struct bgp
*bgp
, afi_t afi
, safi_t safi
, struct vty
*vty
,
1567 struct updwalk_context ctx
;
1568 memset(&ctx
, 0, sizeof(ctx
));
1570 ctx
.subgrp_id
= subgrp_id
;
1572 update_group_af_walk(bgp
, afi
, safi
, update_group_show_walkcb
, &ctx
);
1576 * update_group_show_stats
1578 * Show global statistics about update groups.
1580 void update_group_show_stats(struct bgp
*bgp
, struct vty
*vty
)
1582 vty_out(vty
, "Update groups created: %u\n",
1583 bgp
->update_group_stats
.updgrps_created
);
1584 vty_out(vty
, "Update groups deleted: %u\n",
1585 bgp
->update_group_stats
.updgrps_deleted
);
1586 vty_out(vty
, "Update subgroups created: %u\n",
1587 bgp
->update_group_stats
.subgrps_created
);
1588 vty_out(vty
, "Update subgroups deleted: %u\n",
1589 bgp
->update_group_stats
.subgrps_deleted
);
1590 vty_out(vty
, "Join events: %u\n", bgp
->update_group_stats
.join_events
);
1591 vty_out(vty
, "Prune events: %u\n",
1592 bgp
->update_group_stats
.prune_events
);
1593 vty_out(vty
, "Merge events: %u\n",
1594 bgp
->update_group_stats
.merge_events
);
1595 vty_out(vty
, "Split events: %u\n",
1596 bgp
->update_group_stats
.split_events
);
1597 vty_out(vty
, "Update group switch events: %u\n",
1598 bgp
->update_group_stats
.updgrp_switch_events
);
1599 vty_out(vty
, "Peer route refreshes combined: %u\n",
1600 bgp
->update_group_stats
.peer_refreshes_combined
);
1601 vty_out(vty
, "Merge checks triggered: %u\n",
1602 bgp
->update_group_stats
.merge_checks_triggered
);
1606 * update_group_adjust_peer
1608 void update_group_adjust_peer(struct peer_af
*paf
)
1610 struct update_group
*updgrp
;
1611 struct update_subgroup
*subgrp
, *old_subgrp
;
1617 peer
= PAF_PEER(paf
);
1618 if (!peer_established(peer
)) {
1622 if (!CHECK_FLAG(peer
->flags
, PEER_FLAG_CONFIG_NODE
)) {
1626 if (!peer
->afc_nego
[paf
->afi
][paf
->safi
]) {
1630 updgrp
= update_group_find(paf
);
1632 updgrp
= update_group_create(paf
);
1634 flog_err(BGP_ERR_UPDGRP_CREATE
,
1635 "couldn't create update group for peer %s",
1641 old_subgrp
= paf
->subgroup
;
1646 * If the update group of the peer is unchanged, the peer can
1648 * in its existing subgroup and we're done.
1650 if (old_subgrp
->update_group
== updgrp
)
1654 * The peer is switching between update groups. Put it in its
1655 * own subgroup under the new update group.
1657 update_subgroup_split_peer(paf
, updgrp
);
1661 subgrp
= update_subgroup_find(updgrp
, paf
);
1663 subgrp
= update_subgroup_create(updgrp
);
1668 update_subgroup_add_peer(subgrp
, paf
, 1);
1669 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
1670 zlog_debug("u%" PRIu64
":s%" PRIu64
" add peer %s", updgrp
->id
,
1671 subgrp
->id
, paf
->peer
->host
);
1676 int update_group_adjust_soloness(struct peer
*peer
, int set
)
1678 struct peer_group
*group
;
1679 struct listnode
*node
, *nnode
;
1681 if (!CHECK_FLAG(peer
->sflags
, PEER_STATUS_GROUP
)) {
1682 peer_lonesoul_or_not(peer
, set
);
1683 if (peer
->status
== Established
)
1684 bgp_announce_route_all(peer
);
1686 group
= peer
->group
;
1687 for (ALL_LIST_ELEMENTS(group
->peer
, node
, nnode
, peer
)) {
1688 peer_lonesoul_or_not(peer
, set
);
1689 if (peer
->status
== Established
)
1690 bgp_announce_route_all(peer
);
1697 * update_subgroup_rib
1699 struct bgp_table
*update_subgroup_rib(struct update_subgroup
*subgrp
)
1703 bgp
= SUBGRP_INST(subgrp
);
1707 return bgp
->rib
[SUBGRP_AFI(subgrp
)][SUBGRP_SAFI(subgrp
)];
1710 void update_group_af_walk(struct bgp
*bgp
, afi_t afi
, safi_t safi
,
1711 updgrp_walkcb cb
, void *ctx
)
1713 struct updwalk_context wctx
;
1718 afid
= afindex(afi
, safi
);
1719 if (afid
>= BGP_AF_MAX
)
1722 memset(&wctx
, 0, sizeof(wctx
));
1726 if (bgp
->update_groups
[afid
])
1727 hash_walk(bgp
->update_groups
[afid
], update_group_walkcb
, &wctx
);
1730 void update_group_walk(struct bgp
*bgp
, updgrp_walkcb cb
, void *ctx
)
1735 FOREACH_AFI_SAFI (afi
, safi
) {
1736 update_group_af_walk(bgp
, afi
, safi
, cb
, ctx
);
1740 void update_group_periodic_merge(struct bgp
*bgp
)
1742 char reason
[] = "periodic merge check";
1744 update_group_walk(bgp
, update_group_periodic_merge_walkcb
,
1749 update_group_default_originate_route_map_walkcb(struct update_group
*updgrp
,
1752 struct update_subgroup
*subgrp
;
1757 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
1758 peer
= SUBGRP_PEER(subgrp
);
1759 afi
= SUBGRP_AFI(subgrp
);
1760 safi
= SUBGRP_SAFI(subgrp
);
1762 if (peer
->default_rmap
[afi
][safi
].name
) {
1763 subgroup_default_originate(subgrp
, 0);
1767 return UPDWALK_CONTINUE
;
1770 int update_group_refresh_default_originate_route_map(struct thread
*thread
)
1773 char reason
[] = "refresh default-originate route-map";
1775 bgp
= THREAD_ARG(thread
);
1776 update_group_walk(bgp
, update_group_default_originate_route_map_walkcb
,
1778 THREAD_TIMER_OFF(bgp
->t_rmap_def_originate_eval
);
1785 * peer_af_announce_route
1787 * Refreshes routes out to a peer_af immediately.
1789 * If the combine parameter is TRUE, then this function will try to
1790 * gather other peers in the subgroup for which a route announcement
1791 * is pending and efficently announce routes to all of them.
1793 * For now, the 'combine' option has an effect only if all peers in
1794 * the subgroup have a route announcement pending.
1796 void peer_af_announce_route(struct peer_af
*paf
, int combine
)
1798 struct update_subgroup
*subgrp
;
1799 struct peer_af
*cur_paf
;
1802 subgrp
= paf
->subgroup
;
1807 * If there are other peers in the old subgroup that also need
1808 * routes to be announced, pull them into the peer's new
1810 * Combine route announcement with other peers if possible.
1812 * For now, we combine only if all peers in the subgroup have an
1813 * announcement pending.
1817 SUBGRP_FOREACH_PEER (subgrp
, cur_paf
) {
1821 if (cur_paf
->t_announce_route
)
1829 * Announce to the peer alone if we were not asked to combine peers,
1830 * or if some peers don't have a route annoucement pending.
1832 if (!combine
|| !all_pending
) {
1833 update_subgroup_split_peer(paf
, NULL
);
1837 if (bgp_debug_update(paf
->peer
, NULL
, subgrp
->update_group
, 0))
1838 zlog_debug("u%" PRIu64
":s%" PRIu64
1839 " %s announcing routes",
1840 subgrp
->update_group
->id
, subgrp
->id
,
1843 subgroup_announce_route(paf
->subgroup
);
1848 * We will announce routes the entire subgroup.
1850 * First stop refresh timers on all the other peers.
1852 SUBGRP_FOREACH_PEER (subgrp
, cur_paf
) {
1856 bgp_stop_announce_route_timer(cur_paf
);
1859 if (bgp_debug_update(paf
->peer
, NULL
, subgrp
->update_group
, 0))
1860 zlog_debug("u%" PRIu64
":s%" PRIu64
1861 " announcing routes to %s, combined into %d peers",
1862 subgrp
->update_group
->id
, subgrp
->id
,
1863 paf
->peer
->host
, subgrp
->peer_count
);
1865 subgroup_announce_route(subgrp
);
1867 SUBGRP_INCR_STAT_BY(subgrp
, peer_refreshes_combined
,
1868 subgrp
->peer_count
- 1);
1871 void subgroup_trigger_write(struct update_subgroup
*subgrp
)
1873 struct peer_af
*paf
;
1876 * For each peer in the subgroup, schedule a job to pull packets from
1877 * the subgroup output queue into their own output queue. This action
1878 * will trigger a write job on the I/O thread.
1880 SUBGRP_FOREACH_PEER (subgrp
, paf
)
1881 if (paf
->peer
->status
== Established
)
1882 thread_add_timer_msec(
1883 bm
->master
, bgp_generate_updgrp_packets
,
1885 &paf
->peer
->t_generate_updgrp_packets
);
1888 int update_group_clear_update_dbg(struct update_group
*updgrp
, void *arg
)
1890 UPDGRP_PEER_DBG_OFF(updgrp
);
1891 return UPDWALK_CONTINUE
;
1894 /* Return true if we should addpath encode NLRI to this peer */
1895 int bgp_addpath_encode_tx(struct peer
*peer
, afi_t afi
, safi_t safi
)
1897 return (CHECK_FLAG(peer
->af_cap
[afi
][safi
], PEER_CAP_ADDPATH_AF_TX_ADV
)
1898 && CHECK_FLAG(peer
->af_cap
[afi
][safi
],
1899 PEER_CAP_ADDPATH_AF_RX_RCV
));
1903 * Return true if this is a path we should advertise due to a
1904 * configured addpath-tx knob
1906 int bgp_addpath_tx_path(struct peer
*peer
, afi_t afi
, safi_t safi
,
1907 struct bgp_info
*ri
)
1909 if (CHECK_FLAG(peer
->af_flags
[afi
][safi
],
1910 PEER_FLAG_ADDPATH_TX_ALL_PATHS
))
1913 if (CHECK_FLAG(peer
->af_flags
[afi
][safi
],
1914 PEER_FLAG_ADDPATH_TX_BESTPATH_PER_AS
)
1915 && CHECK_FLAG(ri
->flags
, BGP_INFO_DMED_SELECTED
))