]>
Commit | Line | Data |
---|---|---|
3f9c7369 DS |
1 | /** |
2 | * bgp_updgrp_adv.c: BGP update group advertisement and adjacency | |
3 | * maintenance | |
4 | * | |
5 | * | |
6 | * @copyright Copyright (C) 2014 Cumulus Networks, Inc. | |
7 | * | |
8 | * @author Avneesh Sachdev <avneesh@sproute.net> | |
9 | * @author Rajesh Varadarajan <rajesh@sproute.net> | |
10 | * @author Pradosh Mohapatra <pradosh@sproute.net> | |
11 | * | |
12 | * This file is part of GNU Zebra. | |
13 | * | |
14 | * GNU Zebra is free software; you can redistribute it and/or modify it | |
15 | * under the terms of the GNU General Public License as published by the | |
16 | * Free Software Foundation; either version 2, or (at your option) any | |
17 | * later version. | |
18 | * | |
19 | * GNU Zebra is distributed in the hope that it will be useful, but | |
20 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
21 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
22 | * General Public License for more details. | |
23 | * | |
896014f4 DL |
24 | * You should have received a copy of the GNU General Public License along |
25 | * with this program; see the file COPYING; if not, write to the Free Software | |
26 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
3f9c7369 DS |
27 | */ |
28 | ||
29 | #include <zebra.h> | |
30 | ||
31 | #include "command.h" | |
32 | #include "memory.h" | |
33 | #include "prefix.h" | |
34 | #include "hash.h" | |
35 | #include "thread.h" | |
36 | #include "queue.h" | |
37 | #include "routemap.h" | |
039f3a34 | 38 | #include "filter.h" |
3f9c7369 DS |
39 | |
40 | #include "bgpd/bgpd.h" | |
41 | #include "bgpd/bgp_table.h" | |
42 | #include "bgpd/bgp_debug.h" | |
43 | #include "bgpd/bgp_route.h" | |
44 | #include "bgpd/bgp_advertise.h" | |
45 | #include "bgpd/bgp_attr.h" | |
46 | #include "bgpd/bgp_aspath.h" | |
47 | #include "bgpd/bgp_packet.h" | |
48 | #include "bgpd/bgp_fsm.h" | |
49 | #include "bgpd/bgp_mplsvpn.h" | |
50 | #include "bgpd/bgp_updgrp.h" | |
51 | #include "bgpd/bgp_advertise.h" | |
dcc68b5e | 52 | #include "bgpd/bgp_addpath.h" |
3f9c7369 DS |
53 | |
54 | ||
55 | /******************** | |
56 | * PRIVATE FUNCTIONS | |
57 | ********************/ | |
a79c04e7 DS |
58 | static int bgp_adj_out_compare(const struct bgp_adj_out *o1, |
59 | const struct bgp_adj_out *o2) | |
60 | { | |
61 | if (o1->subgroup < o2->subgroup) | |
62 | return -1; | |
63 | ||
64 | if (o1->subgroup > o2->subgroup) | |
65 | return 1; | |
66 | ||
3373d7e7 MS |
67 | if (o1->addpath_tx_id < o2->addpath_tx_id) |
68 | return -1; | |
69 | ||
70 | if (o1->addpath_tx_id > o2->addpath_tx_id) | |
71 | return 1; | |
72 | ||
a79c04e7 DS |
73 | return 0; |
74 | } | |
75 | RB_GENERATE(bgp_adj_out_rb, bgp_adj_out, adj_entry, bgp_adj_out_compare); | |
3f9c7369 | 76 | |
9bcb3eef | 77 | static inline struct bgp_adj_out *adj_lookup(struct bgp_dest *dest, |
d62a17ae | 78 | struct update_subgroup *subgrp, |
d7c0a89a | 79 | uint32_t addpath_tx_id) |
3f9c7369 | 80 | { |
3373d7e7 | 81 | struct bgp_adj_out lookup; |
d62a17ae | 82 | |
9bcb3eef | 83 | if (!dest || !subgrp) |
d62a17ae | 84 | return NULL; |
85 | ||
d62a17ae | 86 | /* update-groups that do not support addpath will pass 0 for |
3373d7e7 | 87 | * addpath_tx_id. */ |
a79c04e7 | 88 | lookup.subgroup = subgrp; |
3373d7e7 MS |
89 | lookup.addpath_tx_id = addpath_tx_id; |
90 | ||
9bcb3eef | 91 | return RB_FIND(bgp_adj_out_rb, &dest->adj_out, &lookup); |
3f9c7369 DS |
92 | } |
93 | ||
d62a17ae | 94 | static void adj_free(struct bgp_adj_out *adj) |
3f9c7369 | 95 | { |
d62a17ae | 96 | TAILQ_REMOVE(&(adj->subgroup->adjq), adj, subgrp_adj_train); |
97 | SUBGRP_DECR_STAT(adj->subgroup, adj_count); | |
9669fbde DS |
98 | |
99 | RB_REMOVE(bgp_adj_out_rb, &adj->dest->adj_out, adj); | |
100 | bgp_dest_unlock_node(adj->dest); | |
101 | ||
d62a17ae | 102 | XFREE(MTYPE_BGP_ADJ_OUT, adj); |
3f9c7369 DS |
103 | } |
104 | ||
dcc68b5e MS |
105 | static void subgrp_withdraw_stale_addpath(struct updwalk_context *ctx, |
106 | struct update_subgroup *subgrp) | |
107 | { | |
108 | struct bgp_adj_out *adj, *adj_next; | |
109 | uint32_t id; | |
110 | struct bgp_path_info *pi; | |
111 | afi_t afi = SUBGRP_AFI(subgrp); | |
112 | safi_t safi = SUBGRP_SAFI(subgrp); | |
113 | struct peer *peer = SUBGRP_PEER(subgrp); | |
114 | ||
115 | /* Look through all of the paths we have advertised for this rn and send | |
116 | * a withdraw for the ones that are no longer present */ | |
9bcb3eef | 117 | RB_FOREACH_SAFE (adj, bgp_adj_out_rb, &ctx->dest->adj_out, adj_next) { |
dcc68b5e MS |
118 | |
119 | if (adj->subgroup == subgrp) { | |
9bcb3eef DS |
120 | for (pi = bgp_dest_get_bgp_path_info(ctx->dest); pi; |
121 | pi = pi->next) { | |
dcc68b5e MS |
122 | id = bgp_addpath_id_for_peer(peer, afi, safi, |
123 | &pi->tx_addpath); | |
124 | ||
125 | if (id == adj->addpath_tx_id) { | |
126 | break; | |
127 | } | |
128 | } | |
129 | ||
130 | if (!pi) { | |
131 | subgroup_process_announce_selected( | |
9bcb3eef | 132 | subgrp, NULL, ctx->dest, |
dcc68b5e MS |
133 | adj->addpath_tx_id); |
134 | } | |
135 | } | |
136 | } | |
137 | } | |
138 | ||
d62a17ae | 139 | static int group_announce_route_walkcb(struct update_group *updgrp, void *arg) |
3f9c7369 | 140 | { |
d62a17ae | 141 | struct updwalk_context *ctx = arg; |
142 | struct update_subgroup *subgrp; | |
40381db7 | 143 | struct bgp_path_info *pi; |
d62a17ae | 144 | afi_t afi; |
145 | safi_t safi; | |
146 | struct peer *peer; | |
147 | struct bgp_adj_out *adj, *adj_next; | |
148 | int addpath_capable; | |
149 | ||
150 | afi = UPDGRP_AFI(updgrp); | |
151 | safi = UPDGRP_SAFI(updgrp); | |
152 | peer = UPDGRP_PEER(updgrp); | |
153 | addpath_capable = bgp_addpath_encode_tx(peer, afi, safi); | |
154 | ||
b54892e0 DS |
155 | if (BGP_DEBUG(update, UPDATE_OUT)) |
156 | zlog_debug("%s: afi=%s, safi=%s, p=%pRN", __func__, | |
9bcb3eef DS |
157 | afi2str(afi), safi2str(safi), |
158 | bgp_dest_to_rnode(ctx->dest)); | |
e0207895 | 159 | |
a2addae8 | 160 | UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) { |
3f9c7369 | 161 | |
d62a17ae | 162 | /* |
163 | * Skip the subgroups that have coalesce timer running. We will | |
164 | * walk the entire prefix table for those subgroups when the | |
165 | * coalesce timer fires. | |
166 | */ | |
167 | if (!subgrp->t_coalesce) { | |
168 | /* An update-group that uses addpath */ | |
169 | if (addpath_capable) { | |
dcc68b5e | 170 | subgrp_withdraw_stale_addpath(ctx, subgrp); |
d62a17ae | 171 | |
9bcb3eef | 172 | for (pi = bgp_dest_get_bgp_path_info(ctx->dest); |
6f94b685 | 173 | pi; pi = pi->next) { |
d62a17ae | 174 | /* Skip the bestpath for now */ |
40381db7 | 175 | if (pi == ctx->pi) |
d62a17ae | 176 | continue; |
177 | ||
178 | subgroup_process_announce_selected( | |
9bcb3eef | 179 | subgrp, pi, ctx->dest, |
dcc68b5e MS |
180 | bgp_addpath_id_for_peer( |
181 | peer, afi, safi, | |
182 | &pi->tx_addpath)); | |
d62a17ae | 183 | } |
184 | ||
185 | /* Process the bestpath last so the "show [ip] | |
186 | * bgp neighbor x.x.x.x advertised" | |
187 | * output shows the attributes from the bestpath | |
188 | */ | |
40381db7 | 189 | if (ctx->pi) |
d62a17ae | 190 | subgroup_process_announce_selected( |
9bcb3eef | 191 | subgrp, ctx->pi, ctx->dest, |
dcc68b5e MS |
192 | bgp_addpath_id_for_peer( |
193 | peer, afi, safi, | |
194 | &ctx->pi->tx_addpath)); | |
d62a17ae | 195 | } |
196 | ||
197 | /* An update-group that does not use addpath */ | |
198 | else { | |
40381db7 | 199 | if (ctx->pi) { |
d62a17ae | 200 | subgroup_process_announce_selected( |
9bcb3eef | 201 | subgrp, ctx->pi, ctx->dest, |
dcc68b5e MS |
202 | bgp_addpath_id_for_peer( |
203 | peer, afi, safi, | |
204 | &ctx->pi->tx_addpath)); | |
d62a17ae | 205 | } else { |
206 | /* Find the addpath_tx_id of the path we | |
207 | * had advertised and | |
208 | * send a withdraw */ | |
a79c04e7 | 209 | RB_FOREACH_SAFE (adj, bgp_adj_out_rb, |
9bcb3eef | 210 | &ctx->dest->adj_out, |
a79c04e7 | 211 | adj_next) { |
d62a17ae | 212 | if (adj->subgroup == subgrp) { |
213 | subgroup_process_announce_selected( | |
214 | subgrp, NULL, | |
9bcb3eef | 215 | ctx->dest, |
d62a17ae | 216 | adj->addpath_tx_id); |
217 | } | |
218 | } | |
219 | } | |
220 | } | |
221 | } | |
e73c112e MK |
222 | |
223 | /* Notify BGP Conditional advertisement */ | |
224 | bgp_notify_conditional_adv_scanner(subgrp); | |
d62a17ae | 225 | } |
3f9c7369 | 226 | |
d62a17ae | 227 | return UPDWALK_CONTINUE; |
228 | } | |
3f9c7369 | 229 | |
d62a17ae | 230 | static void subgrp_show_adjq_vty(struct update_subgroup *subgrp, |
d7c0a89a | 231 | struct vty *vty, uint8_t flags) |
d62a17ae | 232 | { |
233 | struct bgp_table *table; | |
234 | struct bgp_adj_out *adj; | |
235 | unsigned long output_count; | |
9bcb3eef | 236 | struct bgp_dest *dest; |
d62a17ae | 237 | int header1 = 1; |
238 | struct bgp *bgp; | |
239 | int header2 = 1; | |
240 | ||
241 | bgp = SUBGRP_INST(subgrp); | |
242 | if (!bgp) | |
243 | return; | |
244 | ||
245 | table = bgp->rib[SUBGRP_AFI(subgrp)][SUBGRP_SAFI(subgrp)]; | |
246 | ||
247 | output_count = 0; | |
248 | ||
9bcb3eef DS |
249 | for (dest = bgp_table_top(table); dest; dest = bgp_route_next(dest)) { |
250 | const struct prefix *dest_p = bgp_dest_get_prefix(dest); | |
b54892e0 | 251 | |
9bcb3eef | 252 | RB_FOREACH (adj, bgp_adj_out_rb, &dest->adj_out) |
d62a17ae | 253 | if (adj->subgroup == subgrp) { |
254 | if (header1) { | |
255 | vty_out(vty, | |
23d0a753 DA |
256 | "BGP table version is %" PRIu64 |
257 | ", local router ID is %pI4\n", | |
d62a17ae | 258 | table->version, |
23d0a753 | 259 | &bgp->router_id); |
d62a17ae | 260 | vty_out(vty, BGP_SHOW_SCODE_HEADER); |
261 | vty_out(vty, BGP_SHOW_OCODE_HEADER); | |
262 | header1 = 0; | |
263 | } | |
264 | if (header2) { | |
265 | vty_out(vty, BGP_SHOW_HEADER); | |
266 | header2 = 0; | |
267 | } | |
268 | if ((flags & UPDWALK_FLAGS_ADVQUEUE) && adj->adv | |
269 | && adj->adv->baa) { | |
7d3cae70 | 270 | route_vty_out_tmp(vty, dest, dest_p, |
9bcb3eef DS |
271 | adj->adv->baa->attr, |
272 | SUBGRP_SAFI(subgrp), | |
ae248832 | 273 | 0, NULL, false); |
d62a17ae | 274 | output_count++; |
275 | } | |
276 | if ((flags & UPDWALK_FLAGS_ADVERTISED) | |
277 | && adj->attr) { | |
7d3cae70 | 278 | route_vty_out_tmp(vty, dest, dest_p, |
ae248832 MK |
279 | adj->attr, |
280 | SUBGRP_SAFI(subgrp), | |
281 | 0, NULL, false); | |
d62a17ae | 282 | output_count++; |
283 | } | |
284 | } | |
b54892e0 | 285 | } |
d62a17ae | 286 | if (output_count != 0) |
287 | vty_out(vty, "\nTotal number of prefixes %ld\n", output_count); | |
3f9c7369 DS |
288 | } |
289 | ||
d62a17ae | 290 | static int updgrp_show_adj_walkcb(struct update_group *updgrp, void *arg) |
3f9c7369 | 291 | { |
d62a17ae | 292 | struct updwalk_context *ctx = arg; |
293 | struct update_subgroup *subgrp; | |
294 | struct vty *vty; | |
295 | ||
296 | vty = ctx->vty; | |
a2addae8 | 297 | UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) { |
d62a17ae | 298 | if (ctx->subgrp_id && (ctx->subgrp_id != subgrp->id)) |
299 | continue; | |
300 | vty_out(vty, "update group %" PRIu64 ", subgroup %" PRIu64 "\n", | |
301 | updgrp->id, subgrp->id); | |
302 | subgrp_show_adjq_vty(subgrp, vty, ctx->flags); | |
303 | } | |
304 | return UPDWALK_CONTINUE; | |
3f9c7369 DS |
305 | } |
306 | ||
d62a17ae | 307 | static void updgrp_show_adj(struct bgp *bgp, afi_t afi, safi_t safi, |
d7c0a89a | 308 | struct vty *vty, uint64_t id, uint8_t flags) |
3f9c7369 | 309 | { |
d62a17ae | 310 | struct updwalk_context ctx; |
311 | memset(&ctx, 0, sizeof(ctx)); | |
312 | ctx.vty = vty; | |
313 | ctx.subgrp_id = id; | |
314 | ctx.flags = flags; | |
3f9c7369 | 315 | |
d62a17ae | 316 | update_group_af_walk(bgp, afi, safi, updgrp_show_adj_walkcb, &ctx); |
3f9c7369 DS |
317 | } |
318 | ||
d62a17ae | 319 | static int subgroup_coalesce_timer(struct thread *thread) |
3f9c7369 | 320 | { |
d62a17ae | 321 | struct update_subgroup *subgrp; |
a77e2f4b | 322 | struct bgp *bgp; |
d62a17ae | 323 | |
324 | subgrp = THREAD_ARG(thread); | |
325 | if (bgp_debug_update(NULL, NULL, subgrp->update_group, 0)) | |
6cde4b45 | 326 | zlog_debug("u%" PRIu64 ":s%" PRIu64" announcing routes upon coalesce timer expiry(%u ms)", |
5b18ef82 | 327 | (SUBGRP_UPDGRP(subgrp))->id, subgrp->id, |
80833111 | 328 | subgrp->v_coalesce); |
d62a17ae | 329 | subgrp->t_coalesce = NULL; |
330 | subgrp->v_coalesce = 0; | |
a77e2f4b | 331 | bgp = SUBGRP_INST(subgrp); |
d62a17ae | 332 | subgroup_announce_route(subgrp); |
333 | ||
334 | ||
335 | /* While the announce_route() may kick off the route advertisement timer | |
336 | * for | |
337 | * the members of the subgroup, we'd like to send the initial updates | |
338 | * much | |
339 | * faster (i.e., without enforcing MRAI). Also, if there were no routes | |
340 | * to | |
341 | * announce, this is the method currently employed to trigger the EOR. | |
342 | */ | |
a77e2f4b S |
343 | if (!bgp_update_delay_active(SUBGRP_INST(subgrp)) && |
344 | !(BGP_SUPPRESS_FIB_ENABLED(bgp))) { | |
d62a17ae | 345 | struct peer_af *paf; |
346 | struct peer *peer; | |
347 | ||
a2addae8 | 348 | SUBGRP_FOREACH_PEER (subgrp, paf) { |
d62a17ae | 349 | peer = PAF_PEER(paf); |
350 | BGP_TIMER_OFF(peer->t_routeadv); | |
351 | BGP_TIMER_ON(peer->t_routeadv, bgp_routeadv_timer, 0); | |
352 | } | |
353 | } | |
354 | ||
355 | return 0; | |
3f9c7369 DS |
356 | } |
357 | ||
d62a17ae | 358 | static int update_group_announce_walkcb(struct update_group *updgrp, void *arg) |
3f9c7369 | 359 | { |
d62a17ae | 360 | struct update_subgroup *subgrp; |
3f9c7369 | 361 | |
a2addae8 | 362 | UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) { |
d62a17ae | 363 | subgroup_announce_all(subgrp); |
364 | } | |
3f9c7369 | 365 | |
d62a17ae | 366 | return UPDWALK_CONTINUE; |
3f9c7369 DS |
367 | } |
368 | ||
d62a17ae | 369 | static int update_group_announce_rrc_walkcb(struct update_group *updgrp, |
370 | void *arg) | |
3f9c7369 | 371 | { |
d62a17ae | 372 | struct update_subgroup *subgrp; |
373 | afi_t afi; | |
374 | safi_t safi; | |
375 | struct peer *peer; | |
376 | ||
377 | afi = UPDGRP_AFI(updgrp); | |
378 | safi = UPDGRP_SAFI(updgrp); | |
379 | peer = UPDGRP_PEER(updgrp); | |
380 | ||
381 | /* Only announce if this is a group of route-reflector-clients */ | |
382 | if (CHECK_FLAG(peer->af_flags[afi][safi], PEER_FLAG_REFLECTOR_CLIENT)) { | |
a2addae8 | 383 | UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) { |
d62a17ae | 384 | subgroup_announce_all(subgrp); |
385 | } | |
386 | } | |
387 | ||
388 | return UPDWALK_CONTINUE; | |
3f9c7369 DS |
389 | } |
390 | ||
391 | /******************** | |
392 | * PUBLIC FUNCTIONS | |
393 | ********************/ | |
394 | ||
395 | /** | |
396 | * Allocate an adj-out object. Do proper initialization of its fields, | |
397 | * primarily its association with the subgroup and the prefix. | |
398 | */ | |
d62a17ae | 399 | struct bgp_adj_out *bgp_adj_out_alloc(struct update_subgroup *subgrp, |
9bcb3eef | 400 | struct bgp_dest *dest, |
d7c0a89a | 401 | uint32_t addpath_tx_id) |
3f9c7369 | 402 | { |
d62a17ae | 403 | struct bgp_adj_out *adj; |
404 | ||
405 | adj = XCALLOC(MTYPE_BGP_ADJ_OUT, sizeof(struct bgp_adj_out)); | |
406 | adj->subgroup = subgrp; | |
3373d7e7 MS |
407 | adj->addpath_tx_id = addpath_tx_id; |
408 | ||
9669fbde DS |
409 | RB_INSERT(bgp_adj_out_rb, &dest->adj_out, adj); |
410 | bgp_dest_lock_node(dest); | |
411 | adj->dest = dest; | |
d62a17ae | 412 | |
d62a17ae | 413 | TAILQ_INSERT_TAIL(&(subgrp->adjq), adj, subgrp_adj_train); |
414 | SUBGRP_INCR_STAT(subgrp, adj_count); | |
415 | return adj; | |
3f9c7369 DS |
416 | } |
417 | ||
418 | ||
419 | struct bgp_advertise * | |
d62a17ae | 420 | bgp_advertise_clean_subgroup(struct update_subgroup *subgrp, |
421 | struct bgp_adj_out *adj) | |
3f9c7369 | 422 | { |
d62a17ae | 423 | struct bgp_advertise *adv; |
424 | struct bgp_advertise_attr *baa; | |
425 | struct bgp_advertise *next; | |
a274fef8 | 426 | struct bgp_adv_fifo_head *fhead; |
3f9c7369 | 427 | |
d62a17ae | 428 | adv = adj->adv; |
429 | baa = adv->baa; | |
430 | next = NULL; | |
3f9c7369 | 431 | |
d62a17ae | 432 | if (baa) { |
433 | fhead = &subgrp->sync->update; | |
3f9c7369 | 434 | |
d62a17ae | 435 | /* Unlink myself from advertise attribute FIFO. */ |
436 | bgp_advertise_delete(baa, adv); | |
3f9c7369 | 437 | |
d62a17ae | 438 | /* Fetch next advertise candidate. */ |
439 | next = baa->adv; | |
3f9c7369 | 440 | |
d62a17ae | 441 | /* Unintern BGP advertise attribute. */ |
442 | bgp_advertise_unintern(subgrp->hash, baa); | |
443 | } else | |
444 | fhead = &subgrp->sync->withdraw; | |
3f9c7369 DS |
445 | |
446 | ||
d62a17ae | 447 | /* Unlink myself from advertisement FIFO. */ |
a274fef8 | 448 | bgp_adv_fifo_del(fhead, adv); |
3f9c7369 | 449 | |
d62a17ae | 450 | /* Free memory. */ |
451 | bgp_advertise_free(adj->adv); | |
452 | adj->adv = NULL; | |
3f9c7369 | 453 | |
d62a17ae | 454 | return next; |
3f9c7369 DS |
455 | } |
456 | ||
9bcb3eef | 457 | void bgp_adj_out_set_subgroup(struct bgp_dest *dest, |
d62a17ae | 458 | struct update_subgroup *subgrp, struct attr *attr, |
9b6d8fcf | 459 | struct bgp_path_info *path) |
3f9c7369 | 460 | { |
d62a17ae | 461 | struct bgp_adj_out *adj = NULL; |
462 | struct bgp_advertise *adv; | |
dcc68b5e MS |
463 | struct peer *peer; |
464 | afi_t afi; | |
465 | safi_t safi; | |
a77e2f4b S |
466 | struct peer *adv_peer; |
467 | struct peer_af *paf; | |
468 | struct bgp *bgp; | |
2adac256 | 469 | uint32_t attr_hash = attrhash_key_make(attr); |
dcc68b5e MS |
470 | |
471 | peer = SUBGRP_PEER(subgrp); | |
472 | afi = SUBGRP_AFI(subgrp); | |
473 | safi = SUBGRP_SAFI(subgrp); | |
a77e2f4b | 474 | bgp = SUBGRP_INST(subgrp); |
d62a17ae | 475 | |
476 | if (DISABLE_BGP_ANNOUNCE) | |
477 | return; | |
478 | ||
479 | /* Look for adjacency information. */ | |
dcc68b5e | 480 | adj = adj_lookup( |
9bcb3eef | 481 | dest, subgrp, |
dcc68b5e | 482 | bgp_addpath_id_for_peer(peer, afi, safi, &path->tx_addpath)); |
d62a17ae | 483 | |
484 | if (!adj) { | |
dcc68b5e | 485 | adj = bgp_adj_out_alloc( |
9bcb3eef | 486 | subgrp, dest, |
dcc68b5e | 487 | bgp_addpath_id_for_peer(peer, afi, safi, |
9bcb3eef | 488 | &path->tx_addpath)); |
d62a17ae | 489 | if (!adj) |
490 | return; | |
491 | } | |
492 | ||
2adac256 DA |
493 | /* Check if we are sending the same route. This is needed to |
494 | * avoid duplicate UPDATES. For instance, filtering communities | |
495 | * at egress, neighbors will see duplicate UPDATES despite | |
496 | * the route wasn't changed actually. | |
497 | * Do not suppress BGP UPDATES for route-refresh. | |
498 | */ | |
499 | if (CHECK_FLAG(bgp->flags, BGP_FLAG_SUPPRESS_DUPLICATES) | |
500 | && !CHECK_FLAG(subgrp->sflags, SUBGRP_STATUS_FORCE_UPDATES) | |
501 | && adj->attr_hash == attr_hash) { | |
502 | if (BGP_DEBUG(update, UPDATE_OUT)) { | |
503 | char attr_str[BUFSIZ] = {0}; | |
504 | ||
505 | bgp_dump_attr(attr, attr_str, sizeof(attr_str)); | |
506 | ||
507 | zlog_debug("%s suppress UPDATE w/ attr: %s", peer->host, | |
508 | attr_str); | |
509 | } | |
510 | return; | |
511 | } | |
512 | ||
d62a17ae | 513 | if (adj->adv) |
514 | bgp_advertise_clean_subgroup(subgrp, adj); | |
515 | adj->adv = bgp_advertise_new(); | |
516 | ||
517 | adv = adj->adv; | |
9bcb3eef | 518 | adv->dest = dest; |
9b6d8fcf | 519 | assert(adv->pathi == NULL); |
4b7e6066 | 520 | /* bgp_path_info adj_out reference */ |
9b6d8fcf | 521 | adv->pathi = bgp_path_info_lock(path); |
d62a17ae | 522 | |
5c8ecf6e | 523 | adv->baa = bgp_advertise_intern(subgrp->hash, attr); |
d62a17ae | 524 | adv->adj = adj; |
2adac256 | 525 | adj->attr_hash = attr_hash; |
d62a17ae | 526 | |
527 | /* Add new advertisement to advertisement attribute list. */ | |
528 | bgp_advertise_add(adv->baa, adv); | |
529 | ||
530 | /* | |
531 | * If the update adv list is empty, trigger the member peers' | |
532 | * mrai timers so the socket writes can happen. | |
533 | */ | |
a274fef8 | 534 | if (!bgp_adv_fifo_count(&subgrp->sync->update)) { |
a2addae8 | 535 | SUBGRP_FOREACH_PEER (subgrp, paf) { |
a77e2f4b S |
536 | /* If there are no routes in the withdraw list, set |
537 | * the flag PEER_STATUS_ADV_DELAY which will allow | |
538 | * more routes to be sent in the update message | |
539 | */ | |
540 | if (BGP_SUPPRESS_FIB_ENABLED(bgp)) { | |
541 | adv_peer = PAF_PEER(paf); | |
542 | if (!bgp_adv_fifo_count( | |
543 | &subgrp->sync->withdraw)) | |
544 | SET_FLAG(adv_peer->thread_flags, | |
545 | PEER_THREAD_SUBGRP_ADV_DELAY); | |
546 | else | |
547 | UNSET_FLAG(adv_peer->thread_flags, | |
548 | PEER_THREAD_SUBGRP_ADV_DELAY); | |
549 | } | |
d62a17ae | 550 | bgp_adjust_routeadv(PAF_PEER(paf)); |
551 | } | |
3f9c7369 | 552 | } |
3f9c7369 | 553 | |
a274fef8 | 554 | bgp_adv_fifo_add_tail(&subgrp->sync->update, adv); |
3f9c7369 | 555 | |
9bcb3eef | 556 | subgrp->version = max(subgrp->version, dest->version); |
3f9c7369 DS |
557 | } |
558 | ||
4125bb67 DS |
559 | /* The only time 'withdraw' will be false is if we are sending |
560 | * the "neighbor x.x.x.x default-originate" default and need to clear | |
561 | * bgp_adj_out for the 0.0.0.0/0 route in the BGP table. | |
562 | */ | |
9bcb3eef | 563 | void bgp_adj_out_unset_subgroup(struct bgp_dest *dest, |
d62a17ae | 564 | struct update_subgroup *subgrp, char withdraw, |
d7c0a89a | 565 | uint32_t addpath_tx_id) |
3f9c7369 | 566 | { |
d62a17ae | 567 | struct bgp_adj_out *adj; |
568 | struct bgp_advertise *adv; | |
2fc102e1 | 569 | bool trigger_write; |
d62a17ae | 570 | |
571 | if (DISABLE_BGP_ANNOUNCE) | |
572 | return; | |
573 | ||
574 | /* Lookup existing adjacency */ | |
4953391b DA |
575 | adj = adj_lookup(dest, subgrp, addpath_tx_id); |
576 | if (adj != NULL) { | |
d62a17ae | 577 | /* Clean up previous advertisement. */ |
578 | if (adj->adv) | |
579 | bgp_advertise_clean_subgroup(subgrp, adj); | |
580 | ||
f55c9a46 S |
581 | /* If default originate is enabled and the route is default |
582 | * route, do not send withdraw. This will prevent deletion of | |
583 | * the default route at the peer. | |
584 | */ | |
585 | if (CHECK_FLAG(subgrp->sflags, SUBGRP_STATUS_DEFAULT_ORIGINATE) | |
9bcb3eef | 586 | && is_default_prefix(bgp_dest_get_prefix(dest))) |
f55c9a46 S |
587 | return; |
588 | ||
d62a17ae | 589 | if (adj->attr && withdraw) { |
590 | /* We need advertisement structure. */ | |
591 | adj->adv = bgp_advertise_new(); | |
592 | adv = adj->adv; | |
9bcb3eef | 593 | adv->dest = dest; |
d62a17ae | 594 | adv->adj = adj; |
595 | ||
2fc102e1 QY |
596 | /* Note if we need to trigger a packet write */ |
597 | trigger_write = | |
a274fef8 | 598 | !bgp_adv_fifo_count(&subgrp->sync->withdraw); |
2fc102e1 | 599 | |
d62a17ae | 600 | /* Add to synchronization entry for withdraw |
601 | * announcement. */ | |
a274fef8 | 602 | bgp_adv_fifo_add_tail(&subgrp->sync->withdraw, adv); |
2fc102e1 QY |
603 | |
604 | if (trigger_write) | |
605 | subgroup_trigger_write(subgrp); | |
d62a17ae | 606 | } else { |
d62a17ae | 607 | /* Free allocated information. */ |
608 | adj_free(adj); | |
d62a17ae | 609 | } |
610 | } | |
611 | ||
9bcb3eef | 612 | subgrp->version = max(subgrp->version, dest->version); |
3f9c7369 DS |
613 | } |
614 | ||
9bcb3eef | 615 | void bgp_adj_out_remove_subgroup(struct bgp_dest *dest, struct bgp_adj_out *adj, |
d62a17ae | 616 | struct update_subgroup *subgrp) |
3f9c7369 | 617 | { |
d62a17ae | 618 | if (adj->attr) |
619 | bgp_attr_unintern(&adj->attr); | |
3f9c7369 | 620 | |
d62a17ae | 621 | if (adj->adv) |
622 | bgp_advertise_clean_subgroup(subgrp, adj); | |
3f9c7369 | 623 | |
d62a17ae | 624 | adj_free(adj); |
3f9c7369 DS |
625 | } |
626 | ||
627 | /* | |
628 | * Go through all the routes and clean up the adj/adv structures corresponding | |
629 | * to the subgroup. | |
630 | */ | |
d62a17ae | 631 | void subgroup_clear_table(struct update_subgroup *subgrp) |
3f9c7369 | 632 | { |
d62a17ae | 633 | struct bgp_adj_out *aout, *taout; |
634 | ||
9669fbde DS |
635 | SUBGRP_FOREACH_ADJ_SAFE (subgrp, aout, taout) |
636 | bgp_adj_out_remove_subgroup(aout->dest, aout, subgrp); | |
3f9c7369 DS |
637 | } |
638 | ||
639 | /* | |
640 | * subgroup_announce_table | |
641 | */ | |
d62a17ae | 642 | void subgroup_announce_table(struct update_subgroup *subgrp, |
643 | struct bgp_table *table) | |
3f9c7369 | 644 | { |
9bcb3eef | 645 | struct bgp_dest *dest; |
4b7e6066 | 646 | struct bgp_path_info *ri; |
d62a17ae | 647 | struct attr attr; |
648 | struct peer *peer; | |
649 | afi_t afi; | |
650 | safi_t safi; | |
651 | int addpath_capable; | |
a77e2f4b S |
652 | struct bgp *bgp; |
653 | bool advertise; | |
d62a17ae | 654 | |
655 | peer = SUBGRP_PEER(subgrp); | |
656 | afi = SUBGRP_AFI(subgrp); | |
657 | safi = SUBGRP_SAFI(subgrp); | |
a77e2f4b | 658 | bgp = SUBGRP_INST(subgrp); |
d62a17ae | 659 | addpath_capable = bgp_addpath_encode_tx(peer, afi, safi); |
660 | ||
661 | if (safi == SAFI_LABELED_UNICAST) | |
662 | safi = SAFI_UNICAST; | |
663 | ||
664 | if (!table) | |
665 | table = peer->bgp->rib[afi][safi]; | |
666 | ||
667 | if (safi != SAFI_MPLS_VPN && safi != SAFI_ENCAP && safi != SAFI_EVPN | |
668 | && CHECK_FLAG(peer->af_flags[afi][safi], | |
669 | PEER_FLAG_DEFAULT_ORIGINATE)) | |
670 | subgroup_default_originate(subgrp, 0); | |
671 | ||
9bcb3eef DS |
672 | for (dest = bgp_table_top(table); dest; dest = bgp_route_next(dest)) { |
673 | const struct prefix *dest_p = bgp_dest_get_prefix(dest); | |
b54892e0 | 674 | |
a77e2f4b S |
675 | /* Check if the route can be advertised */ |
676 | advertise = bgp_check_advertise(bgp, dest); | |
677 | ||
9bcb3eef | 678 | for (ri = bgp_dest_get_bgp_path_info(dest); ri; ri = ri->next) |
d62a17ae | 679 | |
1defdda8 | 680 | if (CHECK_FLAG(ri->flags, BGP_PATH_SELECTED) |
d62a17ae | 681 | || (addpath_capable |
dcc68b5e MS |
682 | && bgp_addpath_tx_path( |
683 | peer->addpath_type[afi][safi], | |
684 | ri))) { | |
9bcb3eef | 685 | if (subgroup_announce_check(dest, ri, subgrp, |
7f7940e6 | 686 | dest_p, &attr, |
a77e2f4b S |
687 | false)) { |
688 | /* Check if route can be advertised */ | |
689 | if (advertise) | |
690 | bgp_adj_out_set_subgroup(dest, | |
691 | subgrp, | |
692 | &attr, | |
693 | ri); | |
694 | } else { | |
f55c9a46 S |
695 | /* If default originate is enabled for |
696 | * the peer, do not send explicit | |
697 | * withdraw. This will prevent deletion | |
698 | * of default route advertised through | |
699 | * default originate | |
700 | */ | |
701 | if (CHECK_FLAG( | |
702 | peer->af_flags[afi][safi], | |
703 | PEER_FLAG_DEFAULT_ORIGINATE) | |
9bcb3eef | 704 | && is_default_prefix(bgp_dest_get_prefix(dest))) |
f55c9a46 S |
705 | break; |
706 | ||
d62a17ae | 707 | bgp_adj_out_unset_subgroup( |
9bcb3eef | 708 | dest, subgrp, 1, |
dcc68b5e MS |
709 | bgp_addpath_id_for_peer( |
710 | peer, afi, safi, | |
711 | &ri->tx_addpath)); | |
f55c9a46 | 712 | } |
d62a17ae | 713 | } |
b54892e0 | 714 | } |
d62a17ae | 715 | |
716 | /* | |
717 | * We walked through the whole table -- make sure our version number | |
718 | * is consistent with the one on the table. This should allow | |
719 | * subgroups to merge sooner if a peer comes up when the route node | |
720 | * with the largest version is no longer in the table. This also | |
721 | * covers the pathological case where all routes in the table have | |
722 | * now been deleted. | |
723 | */ | |
724 | subgrp->version = max(subgrp->version, table->version); | |
725 | ||
726 | /* | |
727 | * Start a task to merge the subgroup if necessary. | |
728 | */ | |
729 | update_subgroup_trigger_merge_check(subgrp, 0); | |
3f9c7369 DS |
730 | } |
731 | ||
732 | /* | |
733 | * subgroup_announce_route | |
734 | * | |
735 | * Refresh all routes out to a subgroup. | |
736 | */ | |
d62a17ae | 737 | void subgroup_announce_route(struct update_subgroup *subgrp) |
3f9c7369 | 738 | { |
9bcb3eef | 739 | struct bgp_dest *dest; |
d62a17ae | 740 | struct bgp_table *table; |
741 | struct peer *onlypeer; | |
742 | ||
743 | if (update_subgroup_needs_refresh(subgrp)) { | |
744 | update_subgroup_set_needs_refresh(subgrp, 0); | |
745 | } | |
746 | ||
747 | /* | |
748 | * First update is deferred until ORF or ROUTE-REFRESH is received | |
749 | */ | |
750 | onlypeer = ((SUBGRP_PCOUNT(subgrp) == 1) ? (SUBGRP_PFIRST(subgrp))->peer | |
751 | : NULL); | |
9d303b37 DL |
752 | if (onlypeer && CHECK_FLAG(onlypeer->af_sflags[SUBGRP_AFI(subgrp)] |
753 | [SUBGRP_SAFI(subgrp)], | |
754 | PEER_STATUS_ORF_WAIT_REFRESH)) | |
d62a17ae | 755 | return; |
756 | ||
757 | if (SUBGRP_SAFI(subgrp) != SAFI_MPLS_VPN | |
758 | && SUBGRP_SAFI(subgrp) != SAFI_ENCAP | |
759 | && SUBGRP_SAFI(subgrp) != SAFI_EVPN) | |
760 | subgroup_announce_table(subgrp, NULL); | |
761 | else | |
9bcb3eef DS |
762 | for (dest = bgp_table_top(update_subgroup_rib(subgrp)); dest; |
763 | dest = bgp_route_next(dest)) { | |
764 | table = bgp_dest_get_bgp_table_info(dest); | |
67009e22 DS |
765 | if (!table) |
766 | continue; | |
767 | subgroup_announce_table(subgrp, table); | |
768 | } | |
3f9c7369 DS |
769 | } |
770 | ||
d62a17ae | 771 | void subgroup_default_originate(struct update_subgroup *subgrp, int withdraw) |
3f9c7369 | 772 | { |
d62a17ae | 773 | struct bgp *bgp; |
e50c68b2 | 774 | struct attr attr; |
7208c282 | 775 | struct attr *new_attr = &attr; |
d62a17ae | 776 | struct prefix p; |
777 | struct peer *from; | |
9bcb3eef | 778 | struct bgp_dest *dest; |
f55c9a46 | 779 | struct bgp_path_info *pi; |
d62a17ae | 780 | struct peer *peer; |
f55c9a46 | 781 | struct bgp_adj_out *adj; |
b68885f9 | 782 | route_map_result_t ret = RMAP_DENYMATCH; |
d62a17ae | 783 | afi_t afi; |
784 | safi_t safi; | |
785 | ||
786 | if (!subgrp) | |
787 | return; | |
788 | ||
789 | peer = SUBGRP_PEER(subgrp); | |
790 | afi = SUBGRP_AFI(subgrp); | |
791 | safi = SUBGRP_SAFI(subgrp); | |
792 | ||
793 | if (!(afi == AFI_IP || afi == AFI_IP6)) | |
794 | return; | |
795 | ||
796 | bgp = peer->bgp; | |
797 | from = bgp->peer_self; | |
798 | ||
e50c68b2 | 799 | bgp_attr_default_set(&attr, BGP_ORIGIN_IGP); |
e50c68b2 | 800 | |
91204984 IR |
801 | /* make coverity happy */ |
802 | assert(attr.aspath); | |
803 | ||
e50c68b2 | 804 | attr.local_pref = bgp->default_local_pref; |
d62a17ae | 805 | |
e50c68b2 DS |
806 | if ((afi == AFI_IP6) || peer_cap_enhe(peer, afi, safi)) { |
807 | /* IPv6 global nexthop must be included. */ | |
808 | attr.mp_nexthop_len = BGP_ATTR_NHLEN_IPV6_GLOBAL; | |
809 | ||
810 | /* If the peer is on shared nextwork and we have link-local | |
811 | nexthop set it. */ | |
812 | if (peer->shared_network | |
813 | && !IN6_IS_ADDR_UNSPECIFIED(&peer->nexthop.v6_local)) | |
814 | attr.mp_nexthop_len = BGP_ATTR_NHLEN_IPV6_GLOBAL_AND_LL; | |
815 | } | |
816 | ||
d62a17ae | 817 | if (peer->default_rmap[afi][safi].name) { |
bf844bac IR |
818 | struct bgp_path_info tmp_pi = {0}; |
819 | ||
820 | tmp_pi.peer = bgp->peer_self; | |
821 | ||
d62a17ae | 822 | SET_FLAG(bgp->peer_self->rmap_type, PEER_RMAP_TYPE_DEFAULT); |
7208c282 DA |
823 | |
824 | /* Iterate over the RIB to see if we can announce | |
825 | * the default route. We announce the default | |
826 | * route only if route-map has a match. | |
827 | */ | |
9bcb3eef DS |
828 | for (dest = bgp_table_top(bgp->rib[afi][safi]); dest; |
829 | dest = bgp_route_next(dest)) { | |
f52a961a AC |
830 | if (!bgp_dest_has_bgp_path_info_data(dest)) |
831 | continue; | |
832 | ||
f2ee6d5c DA |
833 | for (pi = bgp_dest_get_bgp_path_info(dest); pi; |
834 | pi = pi->next) { | |
bf844bac | 835 | struct attr tmp_attr = attr; |
f2ee6d5c | 836 | |
bf844bac | 837 | tmp_pi.attr = &tmp_attr; |
7208c282 | 838 | |
bf844bac | 839 | ret = route_map_apply_ext( |
f2ee6d5c | 840 | peer->default_rmap[afi][safi].map, |
bf844bac | 841 | bgp_dest_get_prefix(dest), pi, &tmp_pi); |
f2ee6d5c DA |
842 | |
843 | if (ret == RMAP_DENYMATCH) { | |
bf844bac | 844 | bgp_attr_undup(&tmp_attr, &attr); |
f2ee6d5c DA |
845 | continue; |
846 | } else { | |
847 | new_attr = bgp_attr_intern(&tmp_attr); | |
f2ee6d5c DA |
848 | |
849 | subgroup_announce_reset_nhop( | |
850 | (peer_cap_enhe(peer, afi, safi) | |
851 | ? AF_INET6 | |
852 | : AF_INET), | |
853 | new_attr); | |
854 | ||
855 | break; | |
856 | } | |
857 | } | |
dc52bece DS |
858 | if (ret == RMAP_PERMITMATCH) { |
859 | bgp_dest_unlock_node(dest); | |
d62a17ae | 860 | break; |
dc52bece | 861 | } |
d62a17ae | 862 | } |
863 | bgp->peer_self->rmap_type = 0; | |
864 | ||
f2ee6d5c | 865 | if (ret == RMAP_DENYMATCH) |
d62a17ae | 866 | withdraw = 1; |
3f9c7369 | 867 | } |
3f9c7369 | 868 | |
f55c9a46 S |
869 | /* Check if the default route is in local BGP RIB which is |
870 | * installed through redistribute or network command | |
871 | */ | |
872 | memset(&p, 0, sizeof(p)); | |
873 | p.family = afi2family(afi); | |
874 | p.prefixlen = 0; | |
9bcb3eef | 875 | dest = bgp_afi_node_lookup(bgp->rib[afi][safi], afi, safi, &p, NULL); |
f55c9a46 | 876 | |
d62a17ae | 877 | if (withdraw) { |
f55c9a46 S |
878 | /* Withdraw the default route advertised using default |
879 | * originate | |
880 | */ | |
d62a17ae | 881 | if (CHECK_FLAG(subgrp->sflags, SUBGRP_STATUS_DEFAULT_ORIGINATE)) |
882 | subgroup_default_withdraw_packet(subgrp); | |
883 | UNSET_FLAG(subgrp->sflags, SUBGRP_STATUS_DEFAULT_ORIGINATE); | |
f55c9a46 S |
884 | |
885 | /* If default route is present in the local RIB, advertise the | |
886 | * route | |
887 | */ | |
e71ad4b6 | 888 | if (dest) { |
9bcb3eef | 889 | for (pi = bgp_dest_get_bgp_path_info(dest); pi; |
f55c9a46 S |
890 | pi = pi->next) { |
891 | if (CHECK_FLAG(pi->flags, BGP_PATH_SELECTED)) | |
892 | if (subgroup_announce_check( | |
9bcb3eef DS |
893 | dest, pi, subgrp, |
894 | bgp_dest_get_prefix(dest), | |
7f7940e6 | 895 | &attr, false)) |
f55c9a46 | 896 | bgp_adj_out_set_subgroup( |
9bcb3eef DS |
897 | dest, subgrp, &attr, |
898 | pi); | |
f55c9a46 | 899 | } |
e71ad4b6 | 900 | bgp_dest_unlock_node(dest); |
f55c9a46 | 901 | } |
d62a17ae | 902 | } else { |
903 | if (!CHECK_FLAG(subgrp->sflags, | |
904 | SUBGRP_STATUS_DEFAULT_ORIGINATE)) { | |
7f323236 | 905 | |
d62a17ae | 906 | /* The 'neighbor x.x.x.x default-originate' default will |
907 | * act as an | |
908 | * implicit withdraw for any previous UPDATEs sent for | |
909 | * 0.0.0.0/0 so | |
910 | * clear adj_out for the 0.0.0.0/0 prefix in the BGP | |
911 | * table. | |
912 | */ | |
e71ad4b6 | 913 | if (dest) { |
f55c9a46 S |
914 | /* Remove the adjacency for the previously |
915 | * advertised default route | |
916 | */ | |
917 | adj = adj_lookup( | |
9bcb3eef | 918 | dest, subgrp, |
f55c9a46 S |
919 | BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE); |
920 | if (adj != NULL) { | |
921 | /* Clean up previous advertisement. */ | |
922 | if (adj->adv) | |
923 | bgp_advertise_clean_subgroup( | |
924 | subgrp, adj); | |
925 | ||
f55c9a46 S |
926 | /* Free allocated information. */ |
927 | adj_free(adj); | |
f55c9a46 | 928 | } |
e71ad4b6 | 929 | bgp_dest_unlock_node(dest); |
f55c9a46 S |
930 | } |
931 | ||
932 | /* Advertise the default route */ | |
637e5ba4 | 933 | if (bgp_in_graceful_shutdown(bgp)) |
f55c9a46 S |
934 | bgp_attr_add_gshut_community(new_attr); |
935 | ||
936 | SET_FLAG(subgrp->sflags, | |
937 | SUBGRP_STATUS_DEFAULT_ORIGINATE); | |
938 | subgroup_default_update_packet(subgrp, new_attr, from); | |
d62a17ae | 939 | } |
940 | } | |
ab798674 IR |
941 | |
942 | aspath_unintern(&attr.aspath); | |
3f9c7369 DS |
943 | } |
944 | ||
945 | /* | |
946 | * Announce the BGP table to a subgroup. | |
947 | * | |
948 | * At startup, we try to optimize route announcement by coalescing the | |
949 | * peer-up events. This is done only the first time - from then on, | |
950 | * subgrp->v_coalesce will be set to zero and the normal logic | |
951 | * prevails. | |
952 | */ | |
d62a17ae | 953 | void subgroup_announce_all(struct update_subgroup *subgrp) |
3f9c7369 | 954 | { |
d62a17ae | 955 | if (!subgrp) |
956 | return; | |
957 | ||
958 | /* | |
959 | * If coalesce timer value is not set, announce routes immediately. | |
960 | */ | |
961 | if (!subgrp->v_coalesce) { | |
962 | if (bgp_debug_update(NULL, NULL, subgrp->update_group, 0)) | |
6cde4b45 | 963 | zlog_debug("u%" PRIu64 ":s%" PRIu64" announcing all routes", |
d62a17ae | 964 | subgrp->update_group->id, subgrp->id); |
965 | subgroup_announce_route(subgrp); | |
966 | return; | |
967 | } | |
968 | ||
969 | /* | |
970 | * We should wait for the coalesce timer. Arm the timer if not done. | |
971 | */ | |
972 | if (!subgrp->t_coalesce) { | |
973 | thread_add_timer_msec(bm->master, subgroup_coalesce_timer, | |
974 | subgrp, subgrp->v_coalesce, | |
975 | &subgrp->t_coalesce); | |
976 | } | |
3f9c7369 DS |
977 | } |
978 | ||
979 | /* | |
980 | * Go through all update subgroups and set up the adv queue for the | |
981 | * input route. | |
982 | */ | |
d62a17ae | 983 | void group_announce_route(struct bgp *bgp, afi_t afi, safi_t safi, |
9bcb3eef | 984 | struct bgp_dest *dest, struct bgp_path_info *pi) |
3f9c7369 | 985 | { |
d62a17ae | 986 | struct updwalk_context ctx; |
40381db7 | 987 | ctx.pi = pi; |
9bcb3eef | 988 | ctx.dest = dest; |
a77e2f4b S |
989 | |
990 | /* If suppress fib is enabled, the route will be advertised when | |
991 | * FIB status is received | |
992 | */ | |
993 | if (!bgp_check_advertise(bgp, dest)) | |
994 | return; | |
995 | ||
d62a17ae | 996 | update_group_af_walk(bgp, afi, safi, group_announce_route_walkcb, &ctx); |
3f9c7369 DS |
997 | } |
998 | ||
d62a17ae | 999 | void update_group_show_adj_queue(struct bgp *bgp, afi_t afi, safi_t safi, |
1000 | struct vty *vty, uint64_t id) | |
3f9c7369 | 1001 | { |
d62a17ae | 1002 | updgrp_show_adj(bgp, afi, safi, vty, id, UPDWALK_FLAGS_ADVQUEUE); |
3f9c7369 DS |
1003 | } |
1004 | ||
d62a17ae | 1005 | void update_group_show_advertised(struct bgp *bgp, afi_t afi, safi_t safi, |
1006 | struct vty *vty, uint64_t id) | |
3f9c7369 | 1007 | { |
d62a17ae | 1008 | updgrp_show_adj(bgp, afi, safi, vty, id, UPDWALK_FLAGS_ADVERTISED); |
3f9c7369 DS |
1009 | } |
1010 | ||
d62a17ae | 1011 | void update_group_announce(struct bgp *bgp) |
3f9c7369 | 1012 | { |
d62a17ae | 1013 | update_group_walk(bgp, update_group_announce_walkcb, NULL); |
3f9c7369 DS |
1014 | } |
1015 | ||
d62a17ae | 1016 | void update_group_announce_rrclients(struct bgp *bgp) |
3f9c7369 | 1017 | { |
d62a17ae | 1018 | update_group_walk(bgp, update_group_announce_rrc_walkcb, NULL); |
3f9c7369 | 1019 | } |