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_fsm.h"
51 #include "bgpd/bgp_advertise.h"
52 #include "bgpd/bgp_packet.h"
53 #include "bgpd/bgp_updgrp.h"
54 #include "bgpd/bgp_route.h"
55 #include "bgpd/bgp_filter.h"
56 #include "bgpd/bgp_io.h"
63 * assign a unique ID to update group and subgroup. Mostly for display/
64 * debugging purposes. It's a 64-bit space - used leisurely without a
65 * worry about its wrapping and about filling gaps. While at it, timestamp
68 static void update_group_checkin(struct update_group
*updgrp
)
70 updgrp
->id
= ++bm
->updgrp_idspace
;
71 updgrp
->uptime
= bgp_clock();
74 static void update_subgroup_checkin(struct update_subgroup
*subgrp
,
75 struct update_group
*updgrp
)
77 subgrp
->id
= ++bm
->subgrp_idspace
;
78 subgrp
->uptime
= bgp_clock();
81 static void sync_init(struct update_subgroup
*subgrp
)
84 XCALLOC(MTYPE_BGP_SYNCHRONISE
, sizeof(struct bgp_synchronize
));
85 BGP_ADV_FIFO_INIT(&subgrp
->sync
->update
);
86 BGP_ADV_FIFO_INIT(&subgrp
->sync
->withdraw
);
87 BGP_ADV_FIFO_INIT(&subgrp
->sync
->withdraw_low
);
89 hash_create(baa_hash_key
, baa_hash_cmp
, "BGP SubGroup Hash");
91 /* We use a larger buffer for subgrp->work in the event that:
92 * - We RX a BGP_UPDATE where the attributes alone are just
93 * under BGP_MAX_PACKET_SIZE
94 * - The user configures an outbound route-map that does many as-path
95 * prepends or adds many communities. At most they can have
97 * args in a route-map so there is a finite limit on how large they
99 * make the attributes.
101 * Having a buffer with BGP_MAX_PACKET_SIZE_OVERFLOW allows us to avoid
103 * checking for every single attribute as we construct an UPDATE.
106 stream_new(BGP_MAX_PACKET_SIZE
+ BGP_MAX_PACKET_SIZE_OVERFLOW
);
107 subgrp
->scratch
= stream_new(BGP_MAX_PACKET_SIZE
);
110 static void sync_delete(struct update_subgroup
*subgrp
)
113 XFREE(MTYPE_BGP_SYNCHRONISE
, subgrp
->sync
);
116 hash_free(subgrp
->hash
);
119 stream_free(subgrp
->work
);
122 stream_free(subgrp
->scratch
);
123 subgrp
->scratch
= NULL
;
129 * copy only those fields that are relevant to update group match
131 static void conf_copy(struct peer
*dst
, struct peer
*src
, afi_t afi
,
134 struct bgp_filter
*srcfilter
;
135 struct bgp_filter
*dstfilter
;
137 srcfilter
= &src
->filter
[afi
][safi
];
138 dstfilter
= &dst
->filter
[afi
][safi
];
141 dst
->sort
= src
->sort
;
143 dst
->v_routeadv
= src
->v_routeadv
;
144 dst
->flags
= src
->flags
;
145 dst
->af_flags
[afi
][safi
] = src
->af_flags
[afi
][safi
];
147 XFREE(MTYPE_BGP_PEER_HOST
, dst
->host
);
149 dst
->host
= XSTRDUP(MTYPE_BGP_PEER_HOST
, src
->host
);
151 dst
->af_cap
[afi
][safi
] = src
->af_cap
[afi
][safi
];
152 dst
->afc_nego
[afi
][safi
] = src
->afc_nego
[afi
][safi
];
153 dst
->orf_plist
[afi
][safi
] = src
->orf_plist
[afi
][safi
];
154 dst
->local_as
= src
->local_as
;
155 dst
->change_local_as
= src
->change_local_as
;
156 dst
->shared_network
= src
->shared_network
;
157 memcpy(&(dst
->nexthop
), &(src
->nexthop
), sizeof(struct bgp_nexthop
));
159 dst
->group
= src
->group
;
161 if (src
->default_rmap
[afi
][safi
].name
) {
162 dst
->default_rmap
[afi
][safi
].name
=
163 XSTRDUP(MTYPE_ROUTE_MAP_NAME
,
164 src
->default_rmap
[afi
][safi
].name
);
165 dst
->default_rmap
[afi
][safi
].map
=
166 src
->default_rmap
[afi
][safi
].map
;
169 if (DISTRIBUTE_OUT_NAME(srcfilter
)) {
170 DISTRIBUTE_OUT_NAME(dstfilter
) = XSTRDUP(
171 MTYPE_BGP_FILTER_NAME
, DISTRIBUTE_OUT_NAME(srcfilter
));
172 DISTRIBUTE_OUT(dstfilter
) = DISTRIBUTE_OUT(srcfilter
);
175 if (PREFIX_LIST_OUT_NAME(srcfilter
)) {
176 PREFIX_LIST_OUT_NAME(dstfilter
) = XSTRDUP(
177 MTYPE_BGP_FILTER_NAME
, PREFIX_LIST_OUT_NAME(srcfilter
));
178 PREFIX_LIST_OUT(dstfilter
) = PREFIX_LIST_OUT(srcfilter
);
181 if (FILTER_LIST_OUT_NAME(srcfilter
)) {
182 FILTER_LIST_OUT_NAME(dstfilter
) = XSTRDUP(
183 MTYPE_BGP_FILTER_NAME
, FILTER_LIST_OUT_NAME(srcfilter
));
184 FILTER_LIST_OUT(dstfilter
) = FILTER_LIST_OUT(srcfilter
);
187 if (ROUTE_MAP_OUT_NAME(srcfilter
)) {
188 ROUTE_MAP_OUT_NAME(dstfilter
) = XSTRDUP(
189 MTYPE_BGP_FILTER_NAME
, ROUTE_MAP_OUT_NAME(srcfilter
));
190 ROUTE_MAP_OUT(dstfilter
) = ROUTE_MAP_OUT(srcfilter
);
193 if (UNSUPPRESS_MAP_NAME(srcfilter
)) {
194 UNSUPPRESS_MAP_NAME(dstfilter
) = XSTRDUP(
195 MTYPE_BGP_FILTER_NAME
, UNSUPPRESS_MAP_NAME(srcfilter
));
196 UNSUPPRESS_MAP(dstfilter
) = UNSUPPRESS_MAP(srcfilter
);
201 * since we did a bunch of XSTRDUP's in conf_copy, time to free them up
203 static void conf_release(struct peer
*src
, afi_t afi
, safi_t safi
)
205 struct bgp_filter
*srcfilter
;
207 srcfilter
= &src
->filter
[afi
][safi
];
209 if (src
->default_rmap
[afi
][safi
].name
)
210 XFREE(MTYPE_ROUTE_MAP_NAME
, src
->default_rmap
[afi
][safi
].name
);
212 if (srcfilter
->dlist
[FILTER_OUT
].name
)
213 XFREE(MTYPE_BGP_FILTER_NAME
, srcfilter
->dlist
[FILTER_OUT
].name
);
215 if (srcfilter
->plist
[FILTER_OUT
].name
)
216 XFREE(MTYPE_BGP_FILTER_NAME
, srcfilter
->plist
[FILTER_OUT
].name
);
218 if (srcfilter
->aslist
[FILTER_OUT
].name
)
219 XFREE(MTYPE_BGP_FILTER_NAME
,
220 srcfilter
->aslist
[FILTER_OUT
].name
);
222 if (srcfilter
->map
[RMAP_OUT
].name
)
223 XFREE(MTYPE_BGP_FILTER_NAME
, srcfilter
->map
[RMAP_OUT
].name
);
225 if (srcfilter
->usmap
.name
)
226 XFREE(MTYPE_BGP_FILTER_NAME
, srcfilter
->usmap
.name
);
229 XFREE(MTYPE_BGP_PEER_HOST
, src
->host
);
233 static void peer2_updgrp_copy(struct update_group
*updgrp
, struct peer_af
*paf
)
246 updgrp
->afi
= paf
->afi
;
247 updgrp
->safi
= paf
->safi
;
248 updgrp
->afid
= paf
->afid
;
249 updgrp
->bgp
= src
->bgp
;
251 conf_copy(dst
, src
, paf
->afi
, paf
->safi
);
255 * auxiliary functions to maintain the hash table.
256 * - updgrp_hash_alloc - to create a new entry, passed to hash_get
257 * - updgrp_hash_key_make - makes the key for update group search
258 * - updgrp_hash_cmp - compare two update groups.
260 static void *updgrp_hash_alloc(void *p
)
262 struct update_group
*updgrp
;
263 const struct update_group
*in
;
265 in
= (const struct update_group
*)p
;
266 updgrp
= XCALLOC(MTYPE_BGP_UPDGRP
, sizeof(struct update_group
));
267 memcpy(updgrp
, in
, sizeof(struct update_group
));
268 updgrp
->conf
= XCALLOC(MTYPE_BGP_PEER
, sizeof(struct peer
));
269 conf_copy(updgrp
->conf
, in
->conf
, in
->afi
, in
->safi
);
274 * The hash value for a peer is computed from the following variables:
276 * 1. IBGP (1) or EBGP (2)
277 * 2. FLAGS based on configuration:
278 * LOCAL_AS_NO_PREPEND
279 * LOCAL_AS_REPLACE_AS
280 * 3. AF_FLAGS based on configuration:
281 * Refer to definition in bgp_updgrp.h
282 * 4. (AF-independent) Capability flags:
284 * 5. (AF-dependent) Capability flags:
285 * ORF_PREFIX_SM_RCV (peer can send prefix ORF)
288 * 8. Outbound route-map name (neighbor route-map <> out)
289 * 9. Outbound distribute-list name (neighbor distribute-list <> out)
290 * 10. Outbound prefix-list name (neighbor prefix-list <> out)
291 * 11. Outbound as-list name (neighbor filter-list <> out)
292 * 12. Unsuppress map name (neighbor unsuppress-map <>)
293 * 13. default rmap name (neighbor default-originate route-map <>)
294 * 14. encoding both global and link-local nexthop?
295 * 15. If peer is configured to be a lonesoul, peer ip address
296 * 16. Local-as should match, if configured.
299 static unsigned int updgrp_hash_key_make(void *p
)
301 const struct update_group
*updgrp
;
302 const struct peer
*peer
;
303 const struct bgp_filter
*filter
;
310 #define SEED2 2147483647
316 flags
= peer
->af_flags
[afi
][safi
];
317 filter
= &peer
->filter
[afi
][safi
];
321 key
= jhash_1word(peer
->sort
, key
); /* EBGP or IBGP */
322 key
= jhash_1word((peer
->flags
& PEER_UPDGRP_FLAGS
), key
);
323 key
= jhash_1word((flags
& PEER_UPDGRP_AF_FLAGS
), key
);
324 key
= jhash_1word((peer
->cap
& PEER_UPDGRP_CAP_FLAGS
), key
);
325 key
= jhash_1word((peer
->af_cap
[afi
][safi
] & PEER_UPDGRP_AF_CAP_FLAGS
),
327 key
= jhash_1word(peer
->v_routeadv
, key
);
328 key
= jhash_1word(peer
->change_local_as
, key
);
331 key
= jhash_1word(jhash(peer
->group
->name
,
332 strlen(peer
->group
->name
), SEED1
),
335 if (filter
->map
[RMAP_OUT
].name
)
336 key
= jhash_1word(jhash(filter
->map
[RMAP_OUT
].name
,
337 strlen(filter
->map
[RMAP_OUT
].name
),
341 if (filter
->dlist
[FILTER_OUT
].name
)
342 key
= jhash_1word(jhash(filter
->dlist
[FILTER_OUT
].name
,
343 strlen(filter
->dlist
[FILTER_OUT
].name
),
347 if (filter
->plist
[FILTER_OUT
].name
)
348 key
= jhash_1word(jhash(filter
->plist
[FILTER_OUT
].name
,
349 strlen(filter
->plist
[FILTER_OUT
].name
),
353 if (filter
->aslist
[FILTER_OUT
].name
)
354 key
= jhash_1word(jhash(filter
->aslist
[FILTER_OUT
].name
,
355 strlen(filter
->aslist
[FILTER_OUT
].name
),
359 if (filter
->usmap
.name
)
360 key
= jhash_1word(jhash(filter
->usmap
.name
,
361 strlen(filter
->usmap
.name
), SEED1
),
364 if (peer
->default_rmap
[afi
][safi
].name
)
366 jhash(peer
->default_rmap
[afi
][safi
].name
,
367 strlen(peer
->default_rmap
[afi
][safi
].name
),
371 /* If peer is on a shared network and is exchanging IPv6 prefixes,
372 * it needs to include link-local address. That's different from
373 * non-shared-network peers (nexthop encoded with 32 bytes vs 16
374 * bytes). We create different update groups to take care of that.
377 (peer
->shared_network
&& peer_afi_active_nego(peer
, AFI_IP6
)),
381 * There are certain peers that must get their own update-group:
383 * - peers that negotiated ORF
385 if (CHECK_FLAG(peer
->flags
, PEER_FLAG_LONESOUL
)
386 || CHECK_FLAG(peer
->af_cap
[afi
][safi
], PEER_CAP_ORF_PREFIX_SM_RCV
)
387 || CHECK_FLAG(peer
->af_cap
[afi
][safi
],
388 PEER_CAP_ORF_PREFIX_SM_OLD_RCV
))
389 key
= jhash_1word(jhash(peer
->host
, strlen(peer
->host
), SEED2
),
395 static int updgrp_hash_cmp(const void *p1
, const void *p2
)
397 const struct update_group
*grp1
;
398 const struct update_group
*grp2
;
399 const struct peer
*pe1
;
400 const struct peer
*pe2
;
403 const struct bgp_filter
*fl1
;
404 const struct bgp_filter
*fl2
;
417 flags1
= pe1
->af_flags
[afi
][safi
];
418 flags2
= pe2
->af_flags
[afi
][safi
];
419 fl1
= &pe1
->filter
[afi
][safi
];
420 fl2
= &pe2
->filter
[afi
][safi
];
422 /* put EBGP and IBGP peers in different update groups */
423 if (pe1
->sort
!= pe2
->sort
)
426 /* check peer flags */
427 if ((pe1
->flags
& PEER_UPDGRP_FLAGS
)
428 != (pe2
->flags
& PEER_UPDGRP_FLAGS
))
431 /* If there is 'local-as' configured, it should match. */
432 if (pe1
->change_local_as
!= pe2
->change_local_as
)
435 /* flags like route reflector client */
436 if ((flags1
& PEER_UPDGRP_AF_FLAGS
) != (flags2
& PEER_UPDGRP_AF_FLAGS
))
439 if ((pe1
->cap
& PEER_UPDGRP_CAP_FLAGS
)
440 != (pe2
->cap
& PEER_UPDGRP_CAP_FLAGS
))
443 if ((pe1
->af_cap
[afi
][safi
] & PEER_UPDGRP_AF_CAP_FLAGS
)
444 != (pe2
->af_cap
[afi
][safi
] & PEER_UPDGRP_AF_CAP_FLAGS
))
447 if (pe1
->v_routeadv
!= pe2
->v_routeadv
)
450 if (pe1
->group
!= pe2
->group
)
453 /* route-map names should be the same */
454 if ((fl1
->map
[RMAP_OUT
].name
&& !fl2
->map
[RMAP_OUT
].name
)
455 || (!fl1
->map
[RMAP_OUT
].name
&& fl2
->map
[RMAP_OUT
].name
)
456 || (fl1
->map
[RMAP_OUT
].name
&& fl2
->map
[RMAP_OUT
].name
457 && strcmp(fl1
->map
[RMAP_OUT
].name
, fl2
->map
[RMAP_OUT
].name
)))
460 if ((fl1
->dlist
[FILTER_OUT
].name
&& !fl2
->dlist
[FILTER_OUT
].name
)
461 || (!fl1
->dlist
[FILTER_OUT
].name
&& fl2
->dlist
[FILTER_OUT
].name
)
462 || (fl1
->dlist
[FILTER_OUT
].name
&& fl2
->dlist
[FILTER_OUT
].name
463 && strcmp(fl1
->dlist
[FILTER_OUT
].name
,
464 fl2
->dlist
[FILTER_OUT
].name
)))
467 if ((fl1
->plist
[FILTER_OUT
].name
&& !fl2
->plist
[FILTER_OUT
].name
)
468 || (!fl1
->plist
[FILTER_OUT
].name
&& fl2
->plist
[FILTER_OUT
].name
)
469 || (fl1
->plist
[FILTER_OUT
].name
&& fl2
->plist
[FILTER_OUT
].name
470 && strcmp(fl1
->plist
[FILTER_OUT
].name
,
471 fl2
->plist
[FILTER_OUT
].name
)))
474 if ((fl1
->aslist
[FILTER_OUT
].name
&& !fl2
->aslist
[FILTER_OUT
].name
)
475 || (!fl1
->aslist
[FILTER_OUT
].name
&& fl2
->aslist
[FILTER_OUT
].name
)
476 || (fl1
->aslist
[FILTER_OUT
].name
&& fl2
->aslist
[FILTER_OUT
].name
477 && strcmp(fl1
->aslist
[FILTER_OUT
].name
,
478 fl2
->aslist
[FILTER_OUT
].name
)))
481 if ((fl1
->usmap
.name
&& !fl2
->usmap
.name
)
482 || (!fl1
->usmap
.name
&& fl2
->usmap
.name
)
483 || (fl1
->usmap
.name
&& fl2
->usmap
.name
484 && strcmp(fl1
->usmap
.name
, fl2
->usmap
.name
)))
487 if ((pe1
->default_rmap
[afi
][safi
].name
488 && !pe2
->default_rmap
[afi
][safi
].name
)
489 || (!pe1
->default_rmap
[afi
][safi
].name
490 && pe2
->default_rmap
[afi
][safi
].name
)
491 || (pe1
->default_rmap
[afi
][safi
].name
492 && pe2
->default_rmap
[afi
][safi
].name
493 && strcmp(pe1
->default_rmap
[afi
][safi
].name
,
494 pe2
->default_rmap
[afi
][safi
].name
)))
497 if ((afi
== AFI_IP6
) && (pe1
->shared_network
!= pe2
->shared_network
))
500 if ((CHECK_FLAG(pe1
->flags
, PEER_FLAG_LONESOUL
)
501 || CHECK_FLAG(pe1
->af_cap
[afi
][safi
], PEER_CAP_ORF_PREFIX_SM_RCV
)
502 || CHECK_FLAG(pe1
->af_cap
[afi
][safi
],
503 PEER_CAP_ORF_PREFIX_SM_OLD_RCV
))
504 && !sockunion_same(&pe1
->su
, &pe2
->su
))
510 static void peer_lonesoul_or_not(struct peer
*peer
, int set
)
512 /* no change in status? */
513 if (set
== (CHECK_FLAG(peer
->flags
, PEER_FLAG_LONESOUL
) > 0))
517 SET_FLAG(peer
->flags
, PEER_FLAG_LONESOUL
);
519 UNSET_FLAG(peer
->flags
, PEER_FLAG_LONESOUL
);
521 update_group_adjust_peer_afs(peer
);
525 * subgroup_total_packets_enqueued
527 * Returns the total number of packets enqueued to a subgroup.
530 subgroup_total_packets_enqueued(struct update_subgroup
*subgrp
)
534 pkt
= bpacket_queue_last(SUBGRP_PKTQ(subgrp
));
539 static int update_group_show_walkcb(struct update_group
*updgrp
, void *arg
)
541 struct updwalk_context
*ctx
= arg
;
543 struct update_subgroup
*subgrp
;
545 struct bgp_filter
*filter
;
551 if (ctx
->subgrp_id
) {
552 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
553 if (ctx
->subgrp_id
&& (ctx
->subgrp_id
!= subgrp
->id
))
565 /* Since this routine is invoked from a walk, we cannot signal
567 /* error here, can only return. */
573 vty_out(vty
, "Update-group %" PRIu64
":\n", updgrp
->id
);
574 vty_out(vty
, " Created: %s", timestamp_string(updgrp
->uptime
));
575 filter
= &updgrp
->conf
->filter
[updgrp
->afi
][updgrp
->safi
];
576 if (filter
->map
[RMAP_OUT
].name
)
577 vty_out(vty
, " Outgoing route map: %s%s\n",
578 filter
->map
[RMAP_OUT
].map
? "X" : "",
579 filter
->map
[RMAP_OUT
].name
);
580 vty_out(vty
, " MRAI value (seconds): %d\n", updgrp
->conf
->v_routeadv
);
581 if (updgrp
->conf
->change_local_as
)
582 vty_out(vty
, " Local AS %u%s%s\n",
583 updgrp
->conf
->change_local_as
,
584 CHECK_FLAG(updgrp
->conf
->flags
,
585 PEER_FLAG_LOCAL_AS_NO_PREPEND
)
588 CHECK_FLAG(updgrp
->conf
->flags
,
589 PEER_FLAG_LOCAL_AS_REPLACE_AS
)
593 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
594 if (ctx
->subgrp_id
&& (ctx
->subgrp_id
!= subgrp
->id
))
597 vty_out(vty
, " Update-subgroup %" PRIu64
":\n", subgrp
->id
);
598 vty_out(vty
, " Created: %s",
599 timestamp_string(subgrp
->uptime
));
601 if (subgrp
->split_from
.update_group_id
602 || subgrp
->split_from
.subgroup_id
) {
603 vty_out(vty
, " Split from group id: %" PRIu64
"\n",
604 subgrp
->split_from
.update_group_id
);
606 " Split from subgroup id: %" PRIu64
"\n",
607 subgrp
->split_from
.subgroup_id
);
610 vty_out(vty
, " Join events: %u\n", subgrp
->join_events
);
611 vty_out(vty
, " Prune events: %u\n", subgrp
->prune_events
);
612 vty_out(vty
, " Merge events: %u\n", subgrp
->merge_events
);
613 vty_out(vty
, " Split events: %u\n", subgrp
->split_events
);
614 vty_out(vty
, " Update group switch events: %u\n",
615 subgrp
->updgrp_switch_events
);
616 vty_out(vty
, " Peer refreshes combined: %u\n",
617 subgrp
->peer_refreshes_combined
);
618 vty_out(vty
, " Merge checks triggered: %u\n",
619 subgrp
->merge_checks_triggered
);
620 vty_out(vty
, " Version: %" PRIu64
"\n", subgrp
->version
);
621 vty_out(vty
, " Packet queue length: %d\n",
622 bpacket_queue_length(SUBGRP_PKTQ(subgrp
)));
623 vty_out(vty
, " Total packets enqueued: %u\n",
624 subgroup_total_packets_enqueued(subgrp
));
625 vty_out(vty
, " Packet queue high watermark: %d\n",
626 bpacket_queue_hwm_length(SUBGRP_PKTQ(subgrp
)));
627 vty_out(vty
, " Adj-out list count: %u\n", subgrp
->adj_count
);
628 vty_out(vty
, " Advertise list: %s\n",
629 advertise_list_is_empty(subgrp
) ? "empty"
631 vty_out(vty
, " Flags: %s\n",
632 CHECK_FLAG(subgrp
->flags
, SUBGRP_FLAG_NEEDS_REFRESH
)
635 if (subgrp
->peer_count
> 0) {
636 vty_out(vty
, " Peers:\n");
637 SUBGRP_FOREACH_PEER (subgrp
, paf
)
638 vty_out(vty
, " - %s\n", paf
->peer
->host
);
641 return UPDWALK_CONTINUE
;
645 * Helper function to show the packet queue for each subgroup of update group.
646 * Will be constrained to a particular subgroup id if id !=0
648 static int updgrp_show_packet_queue_walkcb(struct update_group
*updgrp
,
651 struct updwalk_context
*ctx
= arg
;
652 struct update_subgroup
*subgrp
;
656 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
657 if (ctx
->subgrp_id
&& (ctx
->subgrp_id
!= subgrp
->id
))
659 vty_out(vty
, "update group %" PRIu64
", subgroup %" PRIu64
"\n",
660 updgrp
->id
, subgrp
->id
);
661 bpacket_queue_show_vty(SUBGRP_PKTQ(subgrp
), vty
);
663 return UPDWALK_CONTINUE
;
667 * Show the packet queue for each subgroup of update group. Will be
668 * constrained to a particular subgroup id if id !=0
670 void update_group_show_packet_queue(struct bgp
*bgp
, afi_t afi
, safi_t safi
,
671 struct vty
*vty
, uint64_t id
)
673 struct updwalk_context ctx
;
675 memset(&ctx
, 0, sizeof(ctx
));
679 update_group_af_walk(bgp
, afi
, safi
, updgrp_show_packet_queue_walkcb
,
683 static struct update_group
*update_group_find(struct peer_af
*paf
)
685 struct update_group
*updgrp
;
686 struct update_group tmp
;
687 struct peer tmp_conf
;
689 if (!peer_established(PAF_PEER(paf
)))
692 memset(&tmp
, 0, sizeof(tmp
));
693 memset(&tmp_conf
, 0, sizeof(tmp_conf
));
694 tmp
.conf
= &tmp_conf
;
695 peer2_updgrp_copy(&tmp
, paf
);
697 updgrp
= hash_lookup(paf
->peer
->bgp
->update_groups
[paf
->afid
], &tmp
);
698 conf_release(&tmp_conf
, paf
->afi
, paf
->safi
);
702 static struct update_group
*update_group_create(struct peer_af
*paf
)
704 struct update_group
*updgrp
;
705 struct update_group tmp
;
706 struct peer tmp_conf
;
708 memset(&tmp
, 0, sizeof(tmp
));
709 memset(&tmp_conf
, 0, sizeof(tmp_conf
));
710 tmp
.conf
= &tmp_conf
;
711 peer2_updgrp_copy(&tmp
, paf
);
713 updgrp
= hash_get(paf
->peer
->bgp
->update_groups
[paf
->afid
], &tmp
,
717 update_group_checkin(updgrp
);
719 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
720 zlog_debug("create update group %" PRIu64
, updgrp
->id
);
722 UPDGRP_GLOBAL_STAT(updgrp
, updgrps_created
) += 1;
724 conf_release(&tmp_conf
, paf
->afi
, paf
->safi
);
728 static void update_group_delete(struct update_group
*updgrp
)
730 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
731 zlog_debug("delete update group %" PRIu64
, updgrp
->id
);
733 UPDGRP_GLOBAL_STAT(updgrp
, updgrps_deleted
) += 1;
735 hash_release(updgrp
->bgp
->update_groups
[updgrp
->afid
], updgrp
);
736 conf_release(updgrp
->conf
, updgrp
->afi
, updgrp
->safi
);
738 if (updgrp
->conf
->host
)
739 XFREE(MTYPE_BGP_PEER_HOST
, updgrp
->conf
->host
);
740 updgrp
->conf
->host
= NULL
;
742 if (updgrp
->conf
->ifname
)
743 XFREE(MTYPE_BGP_PEER_IFNAME
, updgrp
->conf
->ifname
);
745 XFREE(MTYPE_BGP_PEER
, updgrp
->conf
);
746 XFREE(MTYPE_BGP_UPDGRP
, updgrp
);
749 static void update_group_add_subgroup(struct update_group
*updgrp
,
750 struct update_subgroup
*subgrp
)
752 if (!updgrp
|| !subgrp
)
755 LIST_INSERT_HEAD(&(updgrp
->subgrps
), subgrp
, updgrp_train
);
756 subgrp
->update_group
= updgrp
;
759 static void update_group_remove_subgroup(struct update_group
*updgrp
,
760 struct update_subgroup
*subgrp
)
762 if (!updgrp
|| !subgrp
)
765 LIST_REMOVE(subgrp
, updgrp_train
);
766 subgrp
->update_group
= NULL
;
767 if (LIST_EMPTY(&(updgrp
->subgrps
)))
768 update_group_delete(updgrp
);
771 static struct update_subgroup
*
772 update_subgroup_create(struct update_group
*updgrp
)
774 struct update_subgroup
*subgrp
;
776 subgrp
= XCALLOC(MTYPE_BGP_UPD_SUBGRP
, sizeof(struct update_subgroup
));
777 update_subgroup_checkin(subgrp
, updgrp
);
778 subgrp
->v_coalesce
= (UPDGRP_INST(updgrp
))->coalesce_time
;
780 bpacket_queue_init(SUBGRP_PKTQ(subgrp
));
781 bpacket_queue_add(SUBGRP_PKTQ(subgrp
), NULL
, NULL
);
782 TAILQ_INIT(&(subgrp
->adjq
));
783 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
784 zlog_debug("create subgroup u%" PRIu64
":s%" PRIu64
, updgrp
->id
,
787 update_group_add_subgroup(updgrp
, subgrp
);
789 UPDGRP_INCR_STAT(updgrp
, subgrps_created
);
794 static void update_subgroup_delete(struct update_subgroup
*subgrp
)
799 if (subgrp
->update_group
)
800 UPDGRP_INCR_STAT(subgrp
->update_group
, subgrps_deleted
);
802 if (subgrp
->t_merge_check
)
803 THREAD_OFF(subgrp
->t_merge_check
);
805 if (subgrp
->t_coalesce
)
806 THREAD_TIMER_OFF(subgrp
->t_coalesce
);
808 bpacket_queue_cleanup(SUBGRP_PKTQ(subgrp
));
809 subgroup_clear_table(subgrp
);
811 if (subgrp
->t_coalesce
)
812 THREAD_TIMER_OFF(subgrp
->t_coalesce
);
815 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
) && subgrp
->update_group
)
816 zlog_debug("delete subgroup u%" PRIu64
":s%" PRIu64
,
817 subgrp
->update_group
->id
, subgrp
->id
);
819 update_group_remove_subgroup(subgrp
->update_group
, subgrp
);
821 XFREE(MTYPE_BGP_UPD_SUBGRP
, subgrp
);
824 void update_subgroup_inherit_info(struct update_subgroup
*to
,
825 struct update_subgroup
*from
)
830 to
->sflags
= from
->sflags
;
834 * update_subgroup_check_delete
836 * Delete a subgroup if it is ready to be deleted.
838 * Returns TRUE if the subgroup was deleted.
840 static int update_subgroup_check_delete(struct update_subgroup
*subgrp
)
845 if (!LIST_EMPTY(&(subgrp
->peers
)))
848 update_subgroup_delete(subgrp
);
854 * update_subgroup_add_peer
856 * @param send_enqueued_packets If true all currently enqueued packets will
857 * also be sent to the peer.
859 static void update_subgroup_add_peer(struct update_subgroup
*subgrp
,
861 int send_enqueued_pkts
)
868 LIST_INSERT_HEAD(&(subgrp
->peers
), paf
, subgrp_train
);
869 paf
->subgroup
= subgrp
;
870 subgrp
->peer_count
++;
872 if (bgp_debug_peer_updout_enabled(paf
->peer
->host
)) {
873 UPDGRP_PEER_DBG_EN(subgrp
->update_group
);
876 SUBGRP_INCR_STAT(subgrp
, join_events
);
878 if (send_enqueued_pkts
) {
879 pkt
= bpacket_queue_first(SUBGRP_PKTQ(subgrp
));
883 * Hang the peer off of the last, placeholder, packet in the
884 * queue. This means it won't see any of the packets that are
885 * currently the queue.
887 pkt
= bpacket_queue_last(SUBGRP_PKTQ(subgrp
));
888 assert(pkt
->buffer
== NULL
);
891 bpacket_add_peer(pkt
, paf
);
893 bpacket_queue_sanity_check(SUBGRP_PKTQ(subgrp
));
897 * update_subgroup_remove_peer_internal
899 * Internal function that removes a peer from a subgroup, but does not
900 * delete the subgroup. A call to this function must almost always be
901 * followed by a call to update_subgroup_check_delete().
903 * @see update_subgroup_remove_peer
905 static void update_subgroup_remove_peer_internal(struct update_subgroup
*subgrp
,
908 assert(subgrp
&& paf
);
910 if (bgp_debug_peer_updout_enabled(paf
->peer
->host
)) {
911 UPDGRP_PEER_DBG_DIS(subgrp
->update_group
);
914 bpacket_queue_remove_peer(paf
);
915 LIST_REMOVE(paf
, subgrp_train
);
916 paf
->subgroup
= NULL
;
917 subgrp
->peer_count
--;
919 SUBGRP_INCR_STAT(subgrp
, prune_events
);
923 * update_subgroup_remove_peer
925 void update_subgroup_remove_peer(struct update_subgroup
*subgrp
,
931 update_subgroup_remove_peer_internal(subgrp
, paf
);
933 if (update_subgroup_check_delete(subgrp
))
937 * The deletion of the peer may have caused some packets to be
938 * deleted from the subgroup packet queue. Check if the subgroup can
941 update_subgroup_check_merge(subgrp
, "removed peer from subgroup");
944 static struct update_subgroup
*update_subgroup_find(struct update_group
*updgrp
,
947 struct update_subgroup
*subgrp
= NULL
;
956 if (!peer_established(PAF_PEER(paf
)))
959 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
960 if (subgrp
->version
!= version
961 || CHECK_FLAG(subgrp
->sflags
,
962 SUBGRP_STATUS_DEFAULT_ORIGINATE
))
966 * The version number is not meaningful on a subgroup that needs
969 if (update_subgroup_needs_refresh(subgrp
))
979 * update_subgroup_ready_for_merge
981 * Returns TRUE if this subgroup is in a state that allows it to be
982 * merged into another subgroup.
984 static int update_subgroup_ready_for_merge(struct update_subgroup
*subgrp
)
988 * Not ready if there are any encoded packets waiting to be written
991 if (!bpacket_queue_is_empty(SUBGRP_PKTQ(subgrp
)))
995 * Not ready if there enqueued updates waiting to be encoded.
997 if (!advertise_list_is_empty(subgrp
))
1001 * Don't attempt to merge a subgroup that needs a refresh. For one,
1002 * we can't determine if the adj_out of such a group matches that of
1005 if (update_subgroup_needs_refresh(subgrp
))
1012 * update_subgrp_can_merge_into
1014 * Returns TRUE if the first subgroup can merge into the second
1017 static int update_subgroup_can_merge_into(struct update_subgroup
*subgrp
,
1018 struct update_subgroup
*target
)
1021 if (subgrp
== target
)
1025 * Both must have processed the BRIB to the same point in order to
1028 if (subgrp
->version
!= target
->version
)
1031 if (CHECK_FLAG(subgrp
->sflags
, SUBGRP_STATUS_DEFAULT_ORIGINATE
)
1032 != CHECK_FLAG(target
->sflags
, SUBGRP_STATUS_DEFAULT_ORIGINATE
))
1035 if (subgrp
->adj_count
!= target
->adj_count
)
1038 return update_subgroup_ready_for_merge(target
);
1042 * update_subgroup_merge
1044 * Merge the first subgroup into the second one.
1046 static void update_subgroup_merge(struct update_subgroup
*subgrp
,
1047 struct update_subgroup
*target
,
1050 struct peer_af
*paf
;
1054 assert(subgrp
->adj_count
== target
->adj_count
);
1056 peer_count
= subgrp
->peer_count
;
1059 paf
= LIST_FIRST(&subgrp
->peers
);
1063 update_subgroup_remove_peer_internal(subgrp
, paf
);
1066 * Add the peer to the target subgroup, while making sure that
1067 * any currently enqueued packets won't be sent to it. Enqueued
1068 * packets could, for example, result in an unnecessary withdraw
1069 * followed by an advertise.
1071 update_subgroup_add_peer(target
, paf
, 0);
1074 SUBGRP_INCR_STAT(target
, merge_events
);
1076 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
1077 zlog_debug("u%" PRIu64
":s%" PRIu64
1078 " (%d peers) merged into u%" PRIu64
":s%" PRIu64
1081 subgrp
->update_group
->id
, subgrp
->id
, peer_count
,
1082 target
->update_group
->id
, target
->id
,
1083 reason
? reason
: "unknown");
1085 result
= update_subgroup_check_delete(subgrp
);
1090 * update_subgroup_check_merge
1092 * Merge this subgroup into another subgroup if possible.
1094 * Returns TRUE if the subgroup has been merged. The subgroup pointer
1095 * should not be accessed in this case.
1097 int update_subgroup_check_merge(struct update_subgroup
*subgrp
,
1100 struct update_subgroup
*target
;
1102 if (!update_subgroup_ready_for_merge(subgrp
))
1106 * Look for a subgroup to merge into.
1108 UPDGRP_FOREACH_SUBGRP (subgrp
->update_group
, target
) {
1109 if (update_subgroup_can_merge_into(subgrp
, target
))
1116 update_subgroup_merge(subgrp
, target
, reason
);
1121 * update_subgroup_merge_check_thread_cb
1123 static int update_subgroup_merge_check_thread_cb(struct thread
*thread
)
1125 struct update_subgroup
*subgrp
;
1127 subgrp
= THREAD_ARG(thread
);
1129 subgrp
->t_merge_check
= NULL
;
1131 update_subgroup_check_merge(subgrp
, "triggered merge check");
1136 * update_subgroup_trigger_merge_check
1138 * Triggers a call to update_subgroup_check_merge() on a clean context.
1140 * @param force If true, the merge check will be triggered even if the
1141 * subgroup doesn't currently look ready for a merge.
1143 * Returns TRUE if a merge check will be performed shortly.
1145 int update_subgroup_trigger_merge_check(struct update_subgroup
*subgrp
,
1148 if (subgrp
->t_merge_check
)
1151 if (!force
&& !update_subgroup_ready_for_merge(subgrp
))
1154 subgrp
->t_merge_check
= NULL
;
1155 thread_add_timer_msec(bm
->master
, update_subgroup_merge_check_thread_cb
,
1156 subgrp
, 0, &subgrp
->t_merge_check
);
1158 SUBGRP_INCR_STAT(subgrp
, merge_checks_triggered
);
1164 * update_subgroup_copy_adj_out
1166 * Helper function that clones the adj out (state about advertised
1167 * routes) from one subgroup to another. It assumes that the adj out
1168 * of the target subgroup is empty.
1170 static void update_subgroup_copy_adj_out(struct update_subgroup
*source
,
1171 struct update_subgroup
*dest
)
1173 struct bgp_adj_out
*aout
, *aout_copy
;
1175 SUBGRP_FOREACH_ADJ (source
, aout
) {
1180 bgp_adj_out_alloc(dest
, aout
->rn
, aout
->addpath_tx_id
);
1182 aout
->attr
? bgp_attr_intern(aout
->attr
) : NULL
;
1187 * update_subgroup_copy_packets
1189 * Copy packets after and including the given packet to the subgroup
1192 * Returns the number of packets copied.
1194 static int update_subgroup_copy_packets(struct update_subgroup
*dest
,
1195 struct bpacket
*pkt
)
1200 while (pkt
&& pkt
->buffer
) {
1201 bpacket_queue_add(SUBGRP_PKTQ(dest
), stream_dup(pkt
->buffer
),
1204 pkt
= bpacket_next(pkt
);
1207 bpacket_queue_sanity_check(SUBGRP_PKTQ(dest
));
1212 static int updgrp_prefix_list_update(struct update_group
*updgrp
,
1216 struct bgp_filter
*filter
;
1218 peer
= UPDGRP_PEER(updgrp
);
1219 filter
= &peer
->filter
[UPDGRP_AFI(updgrp
)][UPDGRP_SAFI(updgrp
)];
1221 if (PREFIX_LIST_OUT_NAME(filter
)
1222 && (strcmp(name
, PREFIX_LIST_OUT_NAME(filter
)) == 0)) {
1223 PREFIX_LIST_OUT(filter
) = prefix_list_lookup(
1224 UPDGRP_AFI(updgrp
), PREFIX_LIST_OUT_NAME(filter
));
1230 static int updgrp_filter_list_update(struct update_group
*updgrp
,
1234 struct bgp_filter
*filter
;
1236 peer
= UPDGRP_PEER(updgrp
);
1237 filter
= &peer
->filter
[UPDGRP_AFI(updgrp
)][UPDGRP_SAFI(updgrp
)];
1239 if (FILTER_LIST_OUT_NAME(filter
)
1240 && (strcmp(name
, FILTER_LIST_OUT_NAME(filter
)) == 0)) {
1241 FILTER_LIST_OUT(filter
) =
1242 as_list_lookup(FILTER_LIST_OUT_NAME(filter
));
1248 static int updgrp_distribute_list_update(struct update_group
*updgrp
,
1252 struct bgp_filter
*filter
;
1254 peer
= UPDGRP_PEER(updgrp
);
1255 filter
= &peer
->filter
[UPDGRP_AFI(updgrp
)][UPDGRP_SAFI(updgrp
)];
1257 if (DISTRIBUTE_OUT_NAME(filter
)
1258 && (strcmp(name
, DISTRIBUTE_OUT_NAME(filter
)) == 0)) {
1259 DISTRIBUTE_OUT(filter
) = access_list_lookup(
1260 UPDGRP_AFI(updgrp
), DISTRIBUTE_OUT_NAME(filter
));
1266 static int updgrp_route_map_update(struct update_group
*updgrp
,
1267 const char *name
, int *def_rmap_changed
)
1270 struct bgp_filter
*filter
;
1275 peer
= UPDGRP_PEER(updgrp
);
1276 afi
= UPDGRP_AFI(updgrp
);
1277 safi
= UPDGRP_SAFI(updgrp
);
1278 filter
= &peer
->filter
[afi
][safi
];
1280 if (ROUTE_MAP_OUT_NAME(filter
)
1281 && (strcmp(name
, ROUTE_MAP_OUT_NAME(filter
)) == 0)) {
1282 ROUTE_MAP_OUT(filter
) = route_map_lookup_by_name(name
);
1287 if (UNSUPPRESS_MAP_NAME(filter
)
1288 && (strcmp(name
, UNSUPPRESS_MAP_NAME(filter
)) == 0)) {
1289 UNSUPPRESS_MAP(filter
) = route_map_lookup_by_name(name
);
1293 /* process default-originate route-map */
1294 if (peer
->default_rmap
[afi
][safi
].name
1295 && (strcmp(name
, peer
->default_rmap
[afi
][safi
].name
) == 0)) {
1296 peer
->default_rmap
[afi
][safi
].map
=
1297 route_map_lookup_by_name(name
);
1298 if (def_rmap_changed
)
1299 *def_rmap_changed
= 1;
1305 * hash iteration callback function to process a policy change for an
1306 * update group. Check if the changed policy matches the updgrp's
1307 * outbound route-map or unsuppress-map or default-originate map or
1308 * filter-list or prefix-list or distribute-list.
1309 * Trigger update generation accordingly.
1311 static int updgrp_policy_update_walkcb(struct update_group
*updgrp
, void *arg
)
1313 struct updwalk_context
*ctx
= arg
;
1314 struct update_subgroup
*subgrp
;
1316 int def_changed
= 0;
1318 if (!updgrp
|| !ctx
|| !ctx
->policy_name
)
1319 return UPDWALK_CONTINUE
;
1321 switch (ctx
->policy_type
) {
1322 case BGP_POLICY_ROUTE_MAP
:
1323 changed
= updgrp_route_map_update(updgrp
, ctx
->policy_name
,
1326 case BGP_POLICY_FILTER_LIST
:
1327 changed
= updgrp_filter_list_update(updgrp
, ctx
->policy_name
);
1329 case BGP_POLICY_PREFIX_LIST
:
1330 changed
= updgrp_prefix_list_update(updgrp
, ctx
->policy_name
);
1332 case BGP_POLICY_DISTRIBUTE_LIST
:
1334 updgrp_distribute_list_update(updgrp
, ctx
->policy_name
);
1340 /* If not doing route update, return after updating "config" */
1341 if (!ctx
->policy_route_update
)
1342 return UPDWALK_CONTINUE
;
1344 /* If nothing has changed, return after updating "config" */
1345 if (!changed
&& !def_changed
)
1346 return UPDWALK_CONTINUE
;
1349 * If something has changed, at the beginning of a route-map
1351 * event, mark each subgroup's needs-refresh bit. For one, it signals to
1352 * whoever that the subgroup needs a refresh. Second, it prevents
1354 * merge of this subgroup with another before a complete (outbound)
1357 if (ctx
->policy_event_start_flag
) {
1358 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
1359 update_subgroup_set_needs_refresh(subgrp
, 1);
1361 return UPDWALK_CONTINUE
;
1364 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
1366 if (bgp_debug_update(NULL
, NULL
, updgrp
, 0))
1368 "u%" PRIu64
":s%" PRIu64
1369 " announcing routes upon policy %s (type %d) change",
1370 updgrp
->id
, subgrp
->id
,
1371 ctx
->policy_name
, ctx
->policy_type
);
1372 subgroup_announce_route(subgrp
);
1375 if (bgp_debug_update(NULL
, NULL
, updgrp
, 0))
1377 "u%" PRIu64
":s%" PRIu64
1378 " announcing default upon default routemap %s change",
1379 updgrp
->id
, subgrp
->id
,
1381 subgroup_default_originate(subgrp
, 0);
1383 update_subgroup_set_needs_refresh(subgrp
, 0);
1385 return UPDWALK_CONTINUE
;
1388 static int update_group_walkcb(struct hash_backet
*backet
, void *arg
)
1390 struct update_group
*updgrp
= backet
->data
;
1391 struct updwalk_context
*wctx
= arg
;
1392 int ret
= (*wctx
->cb
)(updgrp
, wctx
->context
);
1396 static int update_group_periodic_merge_walkcb(struct update_group
*updgrp
,
1399 struct update_subgroup
*subgrp
;
1400 struct update_subgroup
*tmp_subgrp
;
1401 const char *reason
= arg
;
1403 UPDGRP_FOREACH_SUBGRP_SAFE (updgrp
, subgrp
, tmp_subgrp
)
1404 update_subgroup_check_merge(subgrp
, reason
);
1405 return UPDWALK_CONTINUE
;
1408 /********************
1410 ********************/
1413 * trigger function when a policy (route-map/filter-list/prefix-list/
1414 * distribute-list etc.) content changes. Go through all the
1415 * update groups and process the change.
1417 * bgp: the bgp instance
1418 * ptype: the type of policy that got modified, see bgpd.h
1419 * pname: name of the policy
1420 * route_update: flag to control if an automatic update generation should
1422 * start_event: flag that indicates if it's the beginning of the change.
1423 * Esp. when the user is changing the content interactively
1424 * over multiple statements. Useful to set dirty flag on
1427 void update_group_policy_update(struct bgp
*bgp
, bgp_policy_type_e ptype
,
1428 const char *pname
, int route_update
,
1431 struct updwalk_context ctx
;
1433 memset(&ctx
, 0, sizeof(ctx
));
1434 ctx
.policy_type
= ptype
;
1435 ctx
.policy_name
= pname
;
1436 ctx
.policy_route_update
= route_update
;
1437 ctx
.policy_event_start_flag
= start_event
;
1440 update_group_walk(bgp
, updgrp_policy_update_walkcb
, &ctx
);
1444 * update_subgroup_split_peer
1446 * Ensure that the given peer is in a subgroup of its own in the
1447 * specified update group.
1449 void update_subgroup_split_peer(struct peer_af
*paf
,
1450 struct update_group
*updgrp
)
1452 struct update_subgroup
*old_subgrp
, *subgrp
;
1456 old_subgrp
= paf
->subgroup
;
1459 updgrp
= old_subgrp
->update_group
;
1462 * If the peer is alone in its subgroup, reuse the existing
1465 if (old_subgrp
->peer_count
== 1) {
1466 if (updgrp
== old_subgrp
->update_group
)
1469 subgrp
= old_subgrp
;
1470 old_id
= old_subgrp
->update_group
->id
;
1472 if (bgp_debug_peer_updout_enabled(paf
->peer
->host
)) {
1473 UPDGRP_PEER_DBG_DIS(old_subgrp
->update_group
);
1476 update_group_remove_subgroup(old_subgrp
->update_group
,
1478 update_group_add_subgroup(updgrp
, subgrp
);
1480 if (bgp_debug_peer_updout_enabled(paf
->peer
->host
)) {
1481 UPDGRP_PEER_DBG_EN(updgrp
);
1483 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
1484 zlog_debug("u%" PRIu64
":s%" PRIu64
1485 " peer %s moved to u%" PRIu64
":s%" PRIu64
,
1486 old_id
, subgrp
->id
, paf
->peer
->host
,
1487 updgrp
->id
, subgrp
->id
);
1490 * The state of the subgroup (adj_out, advs, packet queue etc)
1491 * is consistent internally, but may not be identical to other
1492 * subgroups in the new update group even if the version number
1493 * matches up. Make sure a full refresh is done before the
1494 * subgroup is merged with another.
1496 update_subgroup_set_needs_refresh(subgrp
, 1);
1498 SUBGRP_INCR_STAT(subgrp
, updgrp_switch_events
);
1503 * Create a new subgroup under the specified update group, and copy
1504 * over relevant state to it.
1506 subgrp
= update_subgroup_create(updgrp
);
1507 update_subgroup_inherit_info(subgrp
, old_subgrp
);
1509 subgrp
->split_from
.update_group_id
= old_subgrp
->update_group
->id
;
1510 subgrp
->split_from
.subgroup_id
= old_subgrp
->id
;
1513 * Copy out relevant state from the old subgroup.
1515 update_subgroup_copy_adj_out(paf
->subgroup
, subgrp
);
1516 update_subgroup_copy_packets(subgrp
, paf
->next_pkt_to_send
);
1518 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
1519 zlog_debug("u%" PRIu64
":s%" PRIu64
1520 " peer %s split and moved into u%" PRIu64
1522 paf
->subgroup
->update_group
->id
, paf
->subgroup
->id
,
1523 paf
->peer
->host
, updgrp
->id
, subgrp
->id
);
1525 SUBGRP_INCR_STAT(paf
->subgroup
, split_events
);
1528 * Since queued advs were left behind, this new subgroup needs a
1531 update_subgroup_set_needs_refresh(subgrp
, 1);
1534 * Remove peer from old subgroup, and add it to the new one.
1536 update_subgroup_remove_peer(paf
->subgroup
, paf
);
1538 update_subgroup_add_peer(subgrp
, paf
, 1);
1541 void update_bgp_group_init(struct bgp
*bgp
)
1546 bgp
->update_groups
[afid
] =
1547 hash_create(updgrp_hash_key_make
, updgrp_hash_cmp
,
1548 "BGP Update Group Hash");
1551 void update_bgp_group_free(struct bgp
*bgp
)
1556 if (bgp
->update_groups
[afid
]) {
1557 hash_free(bgp
->update_groups
[afid
]);
1558 bgp
->update_groups
[afid
] = NULL
;
1563 void update_group_show(struct bgp
*bgp
, afi_t afi
, safi_t safi
, struct vty
*vty
,
1566 struct updwalk_context ctx
;
1567 memset(&ctx
, 0, sizeof(ctx
));
1569 ctx
.subgrp_id
= subgrp_id
;
1571 update_group_af_walk(bgp
, afi
, safi
, update_group_show_walkcb
, &ctx
);
1575 * update_group_show_stats
1577 * Show global statistics about update groups.
1579 void update_group_show_stats(struct bgp
*bgp
, struct vty
*vty
)
1581 vty_out(vty
, "Update groups created: %u\n",
1582 bgp
->update_group_stats
.updgrps_created
);
1583 vty_out(vty
, "Update groups deleted: %u\n",
1584 bgp
->update_group_stats
.updgrps_deleted
);
1585 vty_out(vty
, "Update subgroups created: %u\n",
1586 bgp
->update_group_stats
.subgrps_created
);
1587 vty_out(vty
, "Update subgroups deleted: %u\n",
1588 bgp
->update_group_stats
.subgrps_deleted
);
1589 vty_out(vty
, "Join events: %u\n", bgp
->update_group_stats
.join_events
);
1590 vty_out(vty
, "Prune events: %u\n",
1591 bgp
->update_group_stats
.prune_events
);
1592 vty_out(vty
, "Merge events: %u\n",
1593 bgp
->update_group_stats
.merge_events
);
1594 vty_out(vty
, "Split events: %u\n",
1595 bgp
->update_group_stats
.split_events
);
1596 vty_out(vty
, "Update group switch events: %u\n",
1597 bgp
->update_group_stats
.updgrp_switch_events
);
1598 vty_out(vty
, "Peer route refreshes combined: %u\n",
1599 bgp
->update_group_stats
.peer_refreshes_combined
);
1600 vty_out(vty
, "Merge checks triggered: %u\n",
1601 bgp
->update_group_stats
.merge_checks_triggered
);
1605 * update_group_adjust_peer
1607 void update_group_adjust_peer(struct peer_af
*paf
)
1609 struct update_group
*updgrp
;
1610 struct update_subgroup
*subgrp
, *old_subgrp
;
1616 peer
= PAF_PEER(paf
);
1617 if (!peer_established(peer
)) {
1621 if (!CHECK_FLAG(peer
->flags
, PEER_FLAG_CONFIG_NODE
)) {
1625 if (!peer
->afc_nego
[paf
->afi
][paf
->safi
]) {
1629 updgrp
= update_group_find(paf
);
1631 updgrp
= update_group_create(paf
);
1633 zlog_err("couldn't create update group for peer %s",
1639 old_subgrp
= paf
->subgroup
;
1644 * If the update group of the peer is unchanged, the peer can
1646 * in its existing subgroup and we're done.
1648 if (old_subgrp
->update_group
== updgrp
)
1652 * The peer is switching between update groups. Put it in its
1653 * own subgroup under the new update group.
1655 update_subgroup_split_peer(paf
, updgrp
);
1659 subgrp
= update_subgroup_find(updgrp
, paf
);
1661 subgrp
= update_subgroup_create(updgrp
);
1666 update_subgroup_add_peer(subgrp
, paf
, 1);
1667 if (BGP_DEBUG(update_groups
, UPDATE_GROUPS
))
1668 zlog_debug("u%" PRIu64
":s%" PRIu64
" add peer %s", updgrp
->id
,
1669 subgrp
->id
, paf
->peer
->host
);
1674 int update_group_adjust_soloness(struct peer
*peer
, int set
)
1676 struct peer_group
*group
;
1677 struct listnode
*node
, *nnode
;
1679 if (!CHECK_FLAG(peer
->sflags
, PEER_STATUS_GROUP
)) {
1680 peer_lonesoul_or_not(peer
, set
);
1681 if (peer
->status
== Established
)
1682 bgp_announce_route_all(peer
);
1684 group
= peer
->group
;
1685 for (ALL_LIST_ELEMENTS(group
->peer
, node
, nnode
, peer
)) {
1686 peer_lonesoul_or_not(peer
, set
);
1687 if (peer
->status
== Established
)
1688 bgp_announce_route_all(peer
);
1695 * update_subgroup_rib
1697 struct bgp_table
*update_subgroup_rib(struct update_subgroup
*subgrp
)
1701 bgp
= SUBGRP_INST(subgrp
);
1705 return bgp
->rib
[SUBGRP_AFI(subgrp
)][SUBGRP_SAFI(subgrp
)];
1708 void update_group_af_walk(struct bgp
*bgp
, afi_t afi
, safi_t safi
,
1709 updgrp_walkcb cb
, void *ctx
)
1711 struct updwalk_context wctx
;
1716 afid
= afindex(afi
, safi
);
1717 if (afid
>= BGP_AF_MAX
)
1720 memset(&wctx
, 0, sizeof(wctx
));
1724 if (bgp
->update_groups
[afid
])
1725 hash_walk(bgp
->update_groups
[afid
], update_group_walkcb
, &wctx
);
1728 void update_group_walk(struct bgp
*bgp
, updgrp_walkcb cb
, void *ctx
)
1733 FOREACH_AFI_SAFI (afi
, safi
) {
1734 update_group_af_walk(bgp
, afi
, safi
, cb
, ctx
);
1738 void update_group_periodic_merge(struct bgp
*bgp
)
1740 char reason
[] = "periodic merge check";
1742 update_group_walk(bgp
, update_group_periodic_merge_walkcb
,
1747 update_group_default_originate_route_map_walkcb(struct update_group
*updgrp
,
1750 struct update_subgroup
*subgrp
;
1755 UPDGRP_FOREACH_SUBGRP (updgrp
, subgrp
) {
1756 peer
= SUBGRP_PEER(subgrp
);
1757 afi
= SUBGRP_AFI(subgrp
);
1758 safi
= SUBGRP_SAFI(subgrp
);
1760 if (peer
->default_rmap
[afi
][safi
].name
) {
1761 subgroup_default_originate(subgrp
, 0);
1765 return UPDWALK_CONTINUE
;
1768 int update_group_refresh_default_originate_route_map(struct thread
*thread
)
1771 char reason
[] = "refresh default-originate route-map";
1773 bgp
= THREAD_ARG(thread
);
1774 update_group_walk(bgp
, update_group_default_originate_route_map_walkcb
,
1776 THREAD_TIMER_OFF(bgp
->t_rmap_def_originate_eval
);
1783 * peer_af_announce_route
1785 * Refreshes routes out to a peer_af immediately.
1787 * If the combine parameter is TRUE, then this function will try to
1788 * gather other peers in the subgroup for which a route announcement
1789 * is pending and efficently announce routes to all of them.
1791 * For now, the 'combine' option has an effect only if all peers in
1792 * the subgroup have a route announcement pending.
1794 void peer_af_announce_route(struct peer_af
*paf
, int combine
)
1796 struct update_subgroup
*subgrp
;
1797 struct peer_af
*cur_paf
;
1800 subgrp
= paf
->subgroup
;
1805 * If there are other peers in the old subgroup that also need
1806 * routes to be announced, pull them into the peer's new
1808 * Combine route announcement with other peers if possible.
1810 * For now, we combine only if all peers in the subgroup have an
1811 * announcement pending.
1815 SUBGRP_FOREACH_PEER (subgrp
, cur_paf
) {
1819 if (cur_paf
->t_announce_route
)
1827 * Announce to the peer alone if we were not asked to combine peers,
1828 * or if some peers don't have a route annoucement pending.
1830 if (!combine
|| !all_pending
) {
1831 update_subgroup_split_peer(paf
, NULL
);
1835 if (bgp_debug_update(paf
->peer
, NULL
, subgrp
->update_group
, 0))
1836 zlog_debug("u%" PRIu64
":s%" PRIu64
1837 " %s announcing routes",
1838 subgrp
->update_group
->id
, subgrp
->id
,
1841 subgroup_announce_route(paf
->subgroup
);
1846 * We will announce routes the entire subgroup.
1848 * First stop refresh timers on all the other peers.
1850 SUBGRP_FOREACH_PEER (subgrp
, cur_paf
) {
1854 bgp_stop_announce_route_timer(cur_paf
);
1857 if (bgp_debug_update(paf
->peer
, NULL
, subgrp
->update_group
, 0))
1858 zlog_debug("u%" PRIu64
":s%" PRIu64
1859 " announcing routes to %s, combined into %d peers",
1860 subgrp
->update_group
->id
, subgrp
->id
,
1861 paf
->peer
->host
, subgrp
->peer_count
);
1863 subgroup_announce_route(subgrp
);
1865 SUBGRP_INCR_STAT_BY(subgrp
, peer_refreshes_combined
,
1866 subgrp
->peer_count
- 1);
1869 void subgroup_trigger_write(struct update_subgroup
*subgrp
)
1871 struct peer_af
*paf
;
1874 * For each peer in the subgroup, schedule a job to pull packets from
1875 * the subgroup output queue into their own output queue. This action
1876 * will trigger a write job on the I/O thread.
1878 SUBGRP_FOREACH_PEER (subgrp
, paf
)
1879 if (paf
->peer
->status
== Established
)
1880 thread_add_timer_msec(
1881 bm
->master
, bgp_generate_updgrp_packets
,
1883 &paf
->peer
->t_generate_updgrp_packets
);
1886 int update_group_clear_update_dbg(struct update_group
*updgrp
, void *arg
)
1888 UPDGRP_PEER_DBG_OFF(updgrp
);
1889 return UPDWALK_CONTINUE
;
1892 /* Return true if we should addpath encode NLRI to this peer */
1893 int bgp_addpath_encode_tx(struct peer
*peer
, afi_t afi
, safi_t safi
)
1895 return (CHECK_FLAG(peer
->af_cap
[afi
][safi
], PEER_CAP_ADDPATH_AF_TX_ADV
)
1896 && CHECK_FLAG(peer
->af_cap
[afi
][safi
],
1897 PEER_CAP_ADDPATH_AF_RX_RCV
));
1901 * Return true if this is a path we should advertise due to a
1902 * configured addpath-tx knob
1904 int bgp_addpath_tx_path(struct peer
*peer
, afi_t afi
, safi_t safi
,
1905 struct bgp_info
*ri
)
1907 if (CHECK_FLAG(peer
->af_flags
[afi
][safi
],
1908 PEER_FLAG_ADDPATH_TX_ALL_PATHS
))
1911 if (CHECK_FLAG(peer
->af_flags
[afi
][safi
],
1912 PEER_FLAG_ADDPATH_TX_BESTPATH_PER_AS
)
1913 && CHECK_FLAG(ri
->flags
, BGP_INFO_DMED_SELECTED
))