]>
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 | |
d62a17ae | 77 | static inline struct bgp_adj_out *adj_lookup(struct bgp_node *rn, |
78 | struct update_subgroup *subgrp, | |
d7c0a89a | 79 | uint32_t addpath_tx_id) |
3f9c7369 | 80 | { |
3373d7e7 | 81 | struct bgp_adj_out lookup; |
d62a17ae | 82 | |
83 | if (!rn || !subgrp) | |
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 | ||
91 | return RB_FIND(bgp_adj_out_rb, &rn->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); | |
98 | XFREE(MTYPE_BGP_ADJ_OUT, adj); | |
3f9c7369 DS |
99 | } |
100 | ||
dcc68b5e MS |
101 | static void subgrp_withdraw_stale_addpath(struct updwalk_context *ctx, |
102 | struct update_subgroup *subgrp) | |
103 | { | |
104 | struct bgp_adj_out *adj, *adj_next; | |
105 | uint32_t id; | |
106 | struct bgp_path_info *pi; | |
107 | afi_t afi = SUBGRP_AFI(subgrp); | |
108 | safi_t safi = SUBGRP_SAFI(subgrp); | |
109 | struct peer *peer = SUBGRP_PEER(subgrp); | |
110 | ||
111 | /* Look through all of the paths we have advertised for this rn and send | |
112 | * a withdraw for the ones that are no longer present */ | |
a79c04e7 | 113 | RB_FOREACH_SAFE (adj, bgp_adj_out_rb, &ctx->rn->adj_out, adj_next) { |
dcc68b5e MS |
114 | |
115 | if (adj->subgroup == subgrp) { | |
6f94b685 DS |
116 | for (pi = bgp_node_get_bgp_path_info(ctx->rn); |
117 | pi; pi = pi->next) { | |
dcc68b5e MS |
118 | id = bgp_addpath_id_for_peer(peer, afi, safi, |
119 | &pi->tx_addpath); | |
120 | ||
121 | if (id == adj->addpath_tx_id) { | |
122 | break; | |
123 | } | |
124 | } | |
125 | ||
126 | if (!pi) { | |
127 | subgroup_process_announce_selected( | |
128 | subgrp, NULL, ctx->rn, | |
129 | adj->addpath_tx_id); | |
130 | } | |
131 | } | |
132 | } | |
133 | } | |
134 | ||
d62a17ae | 135 | static int group_announce_route_walkcb(struct update_group *updgrp, void *arg) |
3f9c7369 | 136 | { |
d62a17ae | 137 | struct updwalk_context *ctx = arg; |
138 | struct update_subgroup *subgrp; | |
40381db7 | 139 | struct bgp_path_info *pi; |
d62a17ae | 140 | afi_t afi; |
141 | safi_t safi; | |
142 | struct peer *peer; | |
143 | struct bgp_adj_out *adj, *adj_next; | |
144 | int addpath_capable; | |
145 | ||
146 | afi = UPDGRP_AFI(updgrp); | |
147 | safi = UPDGRP_SAFI(updgrp); | |
148 | peer = UPDGRP_PEER(updgrp); | |
149 | addpath_capable = bgp_addpath_encode_tx(peer, afi, safi); | |
150 | ||
e0207895 PZ |
151 | if (BGP_DEBUG(update, UPDATE_OUT)) { |
152 | char buf_prefix[PREFIX_STRLEN]; | |
153 | prefix2str(&ctx->rn->p, buf_prefix, sizeof(buf_prefix)); | |
154 | zlog_debug("%s: afi=%s, safi=%s, p=%s", __func__, afi2str(afi), | |
155 | safi2str(safi), buf_prefix); | |
156 | } | |
157 | ||
158 | ||
a2addae8 | 159 | UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) { |
3f9c7369 | 160 | |
d62a17ae | 161 | /* |
162 | * Skip the subgroups that have coalesce timer running. We will | |
163 | * walk the entire prefix table for those subgroups when the | |
164 | * coalesce timer fires. | |
165 | */ | |
166 | if (!subgrp->t_coalesce) { | |
167 | /* An update-group that uses addpath */ | |
168 | if (addpath_capable) { | |
dcc68b5e | 169 | subgrp_withdraw_stale_addpath(ctx, subgrp); |
d62a17ae | 170 | |
6f94b685 DS |
171 | for (pi = bgp_node_get_bgp_path_info(ctx->rn); |
172 | pi; pi = pi->next) { | |
d62a17ae | 173 | /* Skip the bestpath for now */ |
40381db7 | 174 | if (pi == ctx->pi) |
d62a17ae | 175 | continue; |
176 | ||
177 | subgroup_process_announce_selected( | |
40381db7 | 178 | subgrp, pi, ctx->rn, |
dcc68b5e MS |
179 | bgp_addpath_id_for_peer( |
180 | peer, afi, safi, | |
181 | &pi->tx_addpath)); | |
d62a17ae | 182 | } |
183 | ||
184 | /* Process the bestpath last so the "show [ip] | |
185 | * bgp neighbor x.x.x.x advertised" | |
186 | * output shows the attributes from the bestpath | |
187 | */ | |
40381db7 | 188 | if (ctx->pi) |
d62a17ae | 189 | subgroup_process_announce_selected( |
40381db7 | 190 | subgrp, ctx->pi, ctx->rn, |
dcc68b5e MS |
191 | bgp_addpath_id_for_peer( |
192 | peer, afi, safi, | |
193 | &ctx->pi->tx_addpath)); | |
d62a17ae | 194 | } |
195 | ||
196 | /* An update-group that does not use addpath */ | |
197 | else { | |
40381db7 | 198 | if (ctx->pi) { |
d62a17ae | 199 | subgroup_process_announce_selected( |
40381db7 | 200 | subgrp, ctx->pi, ctx->rn, |
dcc68b5e MS |
201 | bgp_addpath_id_for_peer( |
202 | peer, afi, safi, | |
203 | &ctx->pi->tx_addpath)); | |
d62a17ae | 204 | } else { |
205 | /* Find the addpath_tx_id of the path we | |
206 | * had advertised and | |
207 | * send a withdraw */ | |
a79c04e7 DS |
208 | RB_FOREACH_SAFE (adj, bgp_adj_out_rb, |
209 | &ctx->rn->adj_out, | |
210 | adj_next) { | |
d62a17ae | 211 | if (adj->subgroup == subgrp) { |
212 | subgroup_process_announce_selected( | |
213 | subgrp, NULL, | |
214 | ctx->rn, | |
215 | adj->addpath_tx_id); | |
216 | } | |
217 | } | |
218 | } | |
219 | } | |
220 | } | |
221 | } | |
3f9c7369 | 222 | |
d62a17ae | 223 | return UPDWALK_CONTINUE; |
224 | } | |
3f9c7369 | 225 | |
d62a17ae | 226 | static void subgrp_show_adjq_vty(struct update_subgroup *subgrp, |
d7c0a89a | 227 | struct vty *vty, uint8_t flags) |
d62a17ae | 228 | { |
229 | struct bgp_table *table; | |
230 | struct bgp_adj_out *adj; | |
231 | unsigned long output_count; | |
232 | struct bgp_node *rn; | |
233 | int header1 = 1; | |
234 | struct bgp *bgp; | |
235 | int header2 = 1; | |
236 | ||
237 | bgp = SUBGRP_INST(subgrp); | |
238 | if (!bgp) | |
239 | return; | |
240 | ||
241 | table = bgp->rib[SUBGRP_AFI(subgrp)][SUBGRP_SAFI(subgrp)]; | |
242 | ||
243 | output_count = 0; | |
244 | ||
245 | for (rn = bgp_table_top(table); rn; rn = bgp_route_next(rn)) | |
a79c04e7 | 246 | RB_FOREACH (adj, bgp_adj_out_rb, &rn->adj_out) |
d62a17ae | 247 | if (adj->subgroup == subgrp) { |
248 | if (header1) { | |
249 | vty_out(vty, | |
250 | "BGP table version is %" PRIu64 | |
251 | ", local router ID is %s\n", | |
252 | table->version, | |
253 | inet_ntoa(bgp->router_id)); | |
254 | vty_out(vty, BGP_SHOW_SCODE_HEADER); | |
255 | vty_out(vty, BGP_SHOW_OCODE_HEADER); | |
256 | header1 = 0; | |
257 | } | |
258 | if (header2) { | |
259 | vty_out(vty, BGP_SHOW_HEADER); | |
260 | header2 = 0; | |
261 | } | |
262 | if ((flags & UPDWALK_FLAGS_ADVQUEUE) && adj->adv | |
263 | && adj->adv->baa) { | |
264 | route_vty_out_tmp(vty, &rn->p, | |
265 | adj->adv->baa->attr, | |
266 | SUBGRP_SAFI(subgrp), | |
267 | 0, NULL); | |
268 | output_count++; | |
269 | } | |
270 | if ((flags & UPDWALK_FLAGS_ADVERTISED) | |
271 | && adj->attr) { | |
272 | route_vty_out_tmp( | |
273 | vty, &rn->p, adj->attr, | |
274 | SUBGRP_SAFI(subgrp), 0, NULL); | |
275 | output_count++; | |
276 | } | |
277 | } | |
278 | if (output_count != 0) | |
279 | vty_out(vty, "\nTotal number of prefixes %ld\n", output_count); | |
3f9c7369 DS |
280 | } |
281 | ||
d62a17ae | 282 | static int updgrp_show_adj_walkcb(struct update_group *updgrp, void *arg) |
3f9c7369 | 283 | { |
d62a17ae | 284 | struct updwalk_context *ctx = arg; |
285 | struct update_subgroup *subgrp; | |
286 | struct vty *vty; | |
287 | ||
288 | vty = ctx->vty; | |
a2addae8 | 289 | UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) { |
d62a17ae | 290 | if (ctx->subgrp_id && (ctx->subgrp_id != subgrp->id)) |
291 | continue; | |
292 | vty_out(vty, "update group %" PRIu64 ", subgroup %" PRIu64 "\n", | |
293 | updgrp->id, subgrp->id); | |
294 | subgrp_show_adjq_vty(subgrp, vty, ctx->flags); | |
295 | } | |
296 | return UPDWALK_CONTINUE; | |
3f9c7369 DS |
297 | } |
298 | ||
d62a17ae | 299 | static void updgrp_show_adj(struct bgp *bgp, afi_t afi, safi_t safi, |
d7c0a89a | 300 | struct vty *vty, uint64_t id, uint8_t flags) |
3f9c7369 | 301 | { |
d62a17ae | 302 | struct updwalk_context ctx; |
303 | memset(&ctx, 0, sizeof(ctx)); | |
304 | ctx.vty = vty; | |
305 | ctx.subgrp_id = id; | |
306 | ctx.flags = flags; | |
3f9c7369 | 307 | |
d62a17ae | 308 | update_group_af_walk(bgp, afi, safi, updgrp_show_adj_walkcb, &ctx); |
3f9c7369 DS |
309 | } |
310 | ||
d62a17ae | 311 | static int subgroup_coalesce_timer(struct thread *thread) |
3f9c7369 | 312 | { |
d62a17ae | 313 | struct update_subgroup *subgrp; |
314 | ||
315 | subgrp = THREAD_ARG(thread); | |
316 | if (bgp_debug_update(NULL, NULL, subgrp->update_group, 0)) | |
317 | zlog_debug("u%" PRIu64 ":s%" PRIu64 | |
5b18ef82 DS |
318 | " announcing routes upon coalesce timer expiry(%u ms)", |
319 | (SUBGRP_UPDGRP(subgrp))->id, subgrp->id, | |
320 | subgrp->v_coalesce), | |
d62a17ae | 321 | subgrp->t_coalesce = NULL; |
322 | subgrp->v_coalesce = 0; | |
323 | subgroup_announce_route(subgrp); | |
324 | ||
325 | ||
326 | /* While the announce_route() may kick off the route advertisement timer | |
327 | * for | |
328 | * the members of the subgroup, we'd like to send the initial updates | |
329 | * much | |
330 | * faster (i.e., without enforcing MRAI). Also, if there were no routes | |
331 | * to | |
332 | * announce, this is the method currently employed to trigger the EOR. | |
333 | */ | |
334 | if (!bgp_update_delay_active(SUBGRP_INST(subgrp))) { | |
335 | struct peer_af *paf; | |
336 | struct peer *peer; | |
337 | ||
a2addae8 | 338 | SUBGRP_FOREACH_PEER (subgrp, paf) { |
d62a17ae | 339 | peer = PAF_PEER(paf); |
340 | BGP_TIMER_OFF(peer->t_routeadv); | |
341 | BGP_TIMER_ON(peer->t_routeadv, bgp_routeadv_timer, 0); | |
342 | } | |
343 | } | |
344 | ||
345 | return 0; | |
3f9c7369 DS |
346 | } |
347 | ||
d62a17ae | 348 | static int update_group_announce_walkcb(struct update_group *updgrp, void *arg) |
3f9c7369 | 349 | { |
d62a17ae | 350 | struct update_subgroup *subgrp; |
3f9c7369 | 351 | |
a2addae8 | 352 | UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) { |
d62a17ae | 353 | subgroup_announce_all(subgrp); |
354 | } | |
3f9c7369 | 355 | |
d62a17ae | 356 | return UPDWALK_CONTINUE; |
3f9c7369 DS |
357 | } |
358 | ||
d62a17ae | 359 | static int update_group_announce_rrc_walkcb(struct update_group *updgrp, |
360 | void *arg) | |
3f9c7369 | 361 | { |
d62a17ae | 362 | struct update_subgroup *subgrp; |
363 | afi_t afi; | |
364 | safi_t safi; | |
365 | struct peer *peer; | |
366 | ||
367 | afi = UPDGRP_AFI(updgrp); | |
368 | safi = UPDGRP_SAFI(updgrp); | |
369 | peer = UPDGRP_PEER(updgrp); | |
370 | ||
371 | /* Only announce if this is a group of route-reflector-clients */ | |
372 | if (CHECK_FLAG(peer->af_flags[afi][safi], PEER_FLAG_REFLECTOR_CLIENT)) { | |
a2addae8 | 373 | UPDGRP_FOREACH_SUBGRP (updgrp, subgrp) { |
d62a17ae | 374 | subgroup_announce_all(subgrp); |
375 | } | |
376 | } | |
377 | ||
378 | return UPDWALK_CONTINUE; | |
3f9c7369 DS |
379 | } |
380 | ||
381 | /******************** | |
382 | * PUBLIC FUNCTIONS | |
383 | ********************/ | |
384 | ||
385 | /** | |
386 | * Allocate an adj-out object. Do proper initialization of its fields, | |
387 | * primarily its association with the subgroup and the prefix. | |
388 | */ | |
d62a17ae | 389 | struct bgp_adj_out *bgp_adj_out_alloc(struct update_subgroup *subgrp, |
390 | struct bgp_node *rn, | |
d7c0a89a | 391 | uint32_t addpath_tx_id) |
3f9c7369 | 392 | { |
d62a17ae | 393 | struct bgp_adj_out *adj; |
394 | ||
395 | adj = XCALLOC(MTYPE_BGP_ADJ_OUT, sizeof(struct bgp_adj_out)); | |
396 | adj->subgroup = subgrp; | |
3373d7e7 MS |
397 | adj->addpath_tx_id = addpath_tx_id; |
398 | ||
d62a17ae | 399 | if (rn) { |
a79c04e7 | 400 | RB_INSERT(bgp_adj_out_rb, &rn->adj_out, adj); |
d62a17ae | 401 | bgp_lock_node(rn); |
402 | adj->rn = rn; | |
403 | } | |
404 | ||
d62a17ae | 405 | TAILQ_INSERT_TAIL(&(subgrp->adjq), adj, subgrp_adj_train); |
406 | SUBGRP_INCR_STAT(subgrp, adj_count); | |
407 | return adj; | |
3f9c7369 DS |
408 | } |
409 | ||
410 | ||
411 | struct bgp_advertise * | |
d62a17ae | 412 | bgp_advertise_clean_subgroup(struct update_subgroup *subgrp, |
413 | struct bgp_adj_out *adj) | |
3f9c7369 | 414 | { |
d62a17ae | 415 | struct bgp_advertise *adv; |
416 | struct bgp_advertise_attr *baa; | |
417 | struct bgp_advertise *next; | |
a274fef8 | 418 | struct bgp_adv_fifo_head *fhead; |
3f9c7369 | 419 | |
d62a17ae | 420 | adv = adj->adv; |
421 | baa = adv->baa; | |
422 | next = NULL; | |
3f9c7369 | 423 | |
d62a17ae | 424 | if (baa) { |
425 | fhead = &subgrp->sync->update; | |
3f9c7369 | 426 | |
d62a17ae | 427 | /* Unlink myself from advertise attribute FIFO. */ |
428 | bgp_advertise_delete(baa, adv); | |
3f9c7369 | 429 | |
d62a17ae | 430 | /* Fetch next advertise candidate. */ |
431 | next = baa->adv; | |
3f9c7369 | 432 | |
d62a17ae | 433 | /* Unintern BGP advertise attribute. */ |
434 | bgp_advertise_unintern(subgrp->hash, baa); | |
435 | } else | |
436 | fhead = &subgrp->sync->withdraw; | |
3f9c7369 DS |
437 | |
438 | ||
d62a17ae | 439 | /* Unlink myself from advertisement FIFO. */ |
a274fef8 | 440 | bgp_adv_fifo_del(fhead, adv); |
3f9c7369 | 441 | |
d62a17ae | 442 | /* Free memory. */ |
443 | bgp_advertise_free(adj->adv); | |
444 | adj->adv = NULL; | |
3f9c7369 | 445 | |
d62a17ae | 446 | return next; |
3f9c7369 DS |
447 | } |
448 | ||
d62a17ae | 449 | void bgp_adj_out_set_subgroup(struct bgp_node *rn, |
450 | struct update_subgroup *subgrp, struct attr *attr, | |
9b6d8fcf | 451 | struct bgp_path_info *path) |
3f9c7369 | 452 | { |
d62a17ae | 453 | struct bgp_adj_out *adj = NULL; |
454 | struct bgp_advertise *adv; | |
dcc68b5e MS |
455 | struct peer *peer; |
456 | afi_t afi; | |
457 | safi_t safi; | |
458 | ||
459 | peer = SUBGRP_PEER(subgrp); | |
460 | afi = SUBGRP_AFI(subgrp); | |
461 | safi = SUBGRP_SAFI(subgrp); | |
d62a17ae | 462 | |
463 | if (DISABLE_BGP_ANNOUNCE) | |
464 | return; | |
465 | ||
466 | /* Look for adjacency information. */ | |
dcc68b5e MS |
467 | adj = adj_lookup( |
468 | rn, subgrp, | |
469 | bgp_addpath_id_for_peer(peer, afi, safi, &path->tx_addpath)); | |
d62a17ae | 470 | |
471 | if (!adj) { | |
dcc68b5e MS |
472 | adj = bgp_adj_out_alloc( |
473 | subgrp, rn, | |
474 | bgp_addpath_id_for_peer(peer, afi, safi, | |
475 | &path->tx_addpath)); | |
d62a17ae | 476 | if (!adj) |
477 | return; | |
478 | } | |
479 | ||
480 | if (adj->adv) | |
481 | bgp_advertise_clean_subgroup(subgrp, adj); | |
482 | adj->adv = bgp_advertise_new(); | |
483 | ||
484 | adv = adj->adv; | |
485 | adv->rn = rn; | |
9b6d8fcf | 486 | assert(adv->pathi == NULL); |
4b7e6066 | 487 | /* bgp_path_info adj_out reference */ |
9b6d8fcf | 488 | adv->pathi = bgp_path_info_lock(path); |
d62a17ae | 489 | |
490 | if (attr) | |
491 | adv->baa = bgp_advertise_intern(subgrp->hash, attr); | |
492 | else | |
493 | adv->baa = baa_new(); | |
494 | adv->adj = adj; | |
495 | ||
496 | /* Add new advertisement to advertisement attribute list. */ | |
497 | bgp_advertise_add(adv->baa, adv); | |
498 | ||
499 | /* | |
500 | * If the update adv list is empty, trigger the member peers' | |
501 | * mrai timers so the socket writes can happen. | |
502 | */ | |
a274fef8 | 503 | if (!bgp_adv_fifo_count(&subgrp->sync->update)) { |
d62a17ae | 504 | struct peer_af *paf; |
505 | ||
a2addae8 | 506 | SUBGRP_FOREACH_PEER (subgrp, paf) { |
d62a17ae | 507 | bgp_adjust_routeadv(PAF_PEER(paf)); |
508 | } | |
3f9c7369 | 509 | } |
3f9c7369 | 510 | |
a274fef8 | 511 | bgp_adv_fifo_add_tail(&subgrp->sync->update, adv); |
3f9c7369 | 512 | |
d62a17ae | 513 | subgrp->version = max(subgrp->version, rn->version); |
3f9c7369 DS |
514 | } |
515 | ||
4125bb67 DS |
516 | /* The only time 'withdraw' will be false is if we are sending |
517 | * the "neighbor x.x.x.x default-originate" default and need to clear | |
518 | * bgp_adj_out for the 0.0.0.0/0 route in the BGP table. | |
519 | */ | |
d62a17ae | 520 | void bgp_adj_out_unset_subgroup(struct bgp_node *rn, |
521 | struct update_subgroup *subgrp, char withdraw, | |
d7c0a89a | 522 | uint32_t addpath_tx_id) |
3f9c7369 | 523 | { |
d62a17ae | 524 | struct bgp_adj_out *adj; |
525 | struct bgp_advertise *adv; | |
2fc102e1 | 526 | bool trigger_write; |
d62a17ae | 527 | |
528 | if (DISABLE_BGP_ANNOUNCE) | |
529 | return; | |
530 | ||
531 | /* Lookup existing adjacency */ | |
532 | if ((adj = adj_lookup(rn, subgrp, addpath_tx_id)) != NULL) { | |
533 | /* Clean up previous advertisement. */ | |
534 | if (adj->adv) | |
535 | bgp_advertise_clean_subgroup(subgrp, adj); | |
536 | ||
537 | if (adj->attr && withdraw) { | |
538 | /* We need advertisement structure. */ | |
539 | adj->adv = bgp_advertise_new(); | |
540 | adv = adj->adv; | |
541 | adv->rn = rn; | |
542 | adv->adj = adj; | |
543 | ||
2fc102e1 QY |
544 | /* Note if we need to trigger a packet write */ |
545 | trigger_write = | |
a274fef8 | 546 | !bgp_adv_fifo_count(&subgrp->sync->withdraw); |
2fc102e1 | 547 | |
d62a17ae | 548 | /* Add to synchronization entry for withdraw |
549 | * announcement. */ | |
a274fef8 | 550 | bgp_adv_fifo_add_tail(&subgrp->sync->withdraw, adv); |
2fc102e1 QY |
551 | |
552 | if (trigger_write) | |
553 | subgroup_trigger_write(subgrp); | |
d62a17ae | 554 | } else { |
555 | /* Remove myself from adjacency. */ | |
a79c04e7 | 556 | RB_REMOVE(bgp_adj_out_rb, &rn->adj_out, adj); |
d62a17ae | 557 | |
558 | /* Free allocated information. */ | |
559 | adj_free(adj); | |
560 | ||
561 | bgp_unlock_node(rn); | |
562 | } | |
563 | } | |
564 | ||
565 | subgrp->version = max(subgrp->version, rn->version); | |
3f9c7369 DS |
566 | } |
567 | ||
d62a17ae | 568 | void bgp_adj_out_remove_subgroup(struct bgp_node *rn, struct bgp_adj_out *adj, |
569 | struct update_subgroup *subgrp) | |
3f9c7369 | 570 | { |
d62a17ae | 571 | if (adj->attr) |
572 | bgp_attr_unintern(&adj->attr); | |
3f9c7369 | 573 | |
d62a17ae | 574 | if (adj->adv) |
575 | bgp_advertise_clean_subgroup(subgrp, adj); | |
3f9c7369 | 576 | |
a79c04e7 | 577 | RB_REMOVE(bgp_adj_out_rb, &rn->adj_out, adj); |
d62a17ae | 578 | adj_free(adj); |
3f9c7369 DS |
579 | } |
580 | ||
581 | /* | |
582 | * Go through all the routes and clean up the adj/adv structures corresponding | |
583 | * to the subgroup. | |
584 | */ | |
d62a17ae | 585 | void subgroup_clear_table(struct update_subgroup *subgrp) |
3f9c7369 | 586 | { |
d62a17ae | 587 | struct bgp_adj_out *aout, *taout; |
588 | ||
a2addae8 | 589 | SUBGRP_FOREACH_ADJ_SAFE (subgrp, aout, taout) { |
d62a17ae | 590 | struct bgp_node *rn = aout->rn; |
591 | bgp_adj_out_remove_subgroup(rn, aout, subgrp); | |
592 | bgp_unlock_node(rn); | |
593 | } | |
3f9c7369 DS |
594 | } |
595 | ||
596 | /* | |
597 | * subgroup_announce_table | |
598 | */ | |
d62a17ae | 599 | void subgroup_announce_table(struct update_subgroup *subgrp, |
600 | struct bgp_table *table) | |
3f9c7369 | 601 | { |
d62a17ae | 602 | struct bgp_node *rn; |
4b7e6066 | 603 | struct bgp_path_info *ri; |
d62a17ae | 604 | struct attr attr; |
605 | struct peer *peer; | |
606 | afi_t afi; | |
607 | safi_t safi; | |
608 | int addpath_capable; | |
609 | ||
610 | peer = SUBGRP_PEER(subgrp); | |
611 | afi = SUBGRP_AFI(subgrp); | |
612 | safi = SUBGRP_SAFI(subgrp); | |
613 | addpath_capable = bgp_addpath_encode_tx(peer, afi, safi); | |
614 | ||
615 | if (safi == SAFI_LABELED_UNICAST) | |
616 | safi = SAFI_UNICAST; | |
617 | ||
618 | if (!table) | |
619 | table = peer->bgp->rib[afi][safi]; | |
620 | ||
621 | if (safi != SAFI_MPLS_VPN && safi != SAFI_ENCAP && safi != SAFI_EVPN | |
622 | && CHECK_FLAG(peer->af_flags[afi][safi], | |
623 | PEER_FLAG_DEFAULT_ORIGINATE)) | |
624 | subgroup_default_originate(subgrp, 0); | |
625 | ||
626 | for (rn = bgp_table_top(table); rn; rn = bgp_route_next(rn)) | |
6f94b685 | 627 | for (ri = bgp_node_get_bgp_path_info(rn); ri; ri = ri->next) |
d62a17ae | 628 | |
1defdda8 | 629 | if (CHECK_FLAG(ri->flags, BGP_PATH_SELECTED) |
d62a17ae | 630 | || (addpath_capable |
dcc68b5e MS |
631 | && bgp_addpath_tx_path( |
632 | peer->addpath_type[afi][safi], | |
633 | ri))) { | |
d62a17ae | 634 | if (subgroup_announce_check(rn, ri, subgrp, |
635 | &rn->p, &attr)) | |
636 | bgp_adj_out_set_subgroup(rn, subgrp, | |
637 | &attr, ri); | |
638 | else | |
639 | bgp_adj_out_unset_subgroup( | |
640 | rn, subgrp, 1, | |
dcc68b5e MS |
641 | bgp_addpath_id_for_peer( |
642 | peer, afi, safi, | |
643 | &ri->tx_addpath)); | |
d62a17ae | 644 | } |
645 | ||
646 | /* | |
647 | * We walked through the whole table -- make sure our version number | |
648 | * is consistent with the one on the table. This should allow | |
649 | * subgroups to merge sooner if a peer comes up when the route node | |
650 | * with the largest version is no longer in the table. This also | |
651 | * covers the pathological case where all routes in the table have | |
652 | * now been deleted. | |
653 | */ | |
654 | subgrp->version = max(subgrp->version, table->version); | |
655 | ||
656 | /* | |
657 | * Start a task to merge the subgroup if necessary. | |
658 | */ | |
659 | update_subgroup_trigger_merge_check(subgrp, 0); | |
3f9c7369 DS |
660 | } |
661 | ||
662 | /* | |
663 | * subgroup_announce_route | |
664 | * | |
665 | * Refresh all routes out to a subgroup. | |
666 | */ | |
d62a17ae | 667 | void subgroup_announce_route(struct update_subgroup *subgrp) |
3f9c7369 | 668 | { |
d62a17ae | 669 | struct bgp_node *rn; |
670 | struct bgp_table *table; | |
671 | struct peer *onlypeer; | |
672 | ||
673 | if (update_subgroup_needs_refresh(subgrp)) { | |
674 | update_subgroup_set_needs_refresh(subgrp, 0); | |
675 | } | |
676 | ||
677 | /* | |
678 | * First update is deferred until ORF or ROUTE-REFRESH is received | |
679 | */ | |
680 | onlypeer = ((SUBGRP_PCOUNT(subgrp) == 1) ? (SUBGRP_PFIRST(subgrp))->peer | |
681 | : NULL); | |
9d303b37 DL |
682 | if (onlypeer && CHECK_FLAG(onlypeer->af_sflags[SUBGRP_AFI(subgrp)] |
683 | [SUBGRP_SAFI(subgrp)], | |
684 | PEER_STATUS_ORF_WAIT_REFRESH)) | |
d62a17ae | 685 | return; |
686 | ||
687 | if (SUBGRP_SAFI(subgrp) != SAFI_MPLS_VPN | |
688 | && SUBGRP_SAFI(subgrp) != SAFI_ENCAP | |
689 | && SUBGRP_SAFI(subgrp) != SAFI_EVPN) | |
690 | subgroup_announce_table(subgrp, NULL); | |
691 | else | |
692 | for (rn = bgp_table_top(update_subgroup_rib(subgrp)); rn; | |
67009e22 DS |
693 | rn = bgp_route_next(rn)) { |
694 | table = bgp_node_get_bgp_table_info(rn); | |
695 | if (!table) | |
696 | continue; | |
697 | subgroup_announce_table(subgrp, table); | |
698 | } | |
3f9c7369 DS |
699 | } |
700 | ||
d62a17ae | 701 | void subgroup_default_originate(struct update_subgroup *subgrp, int withdraw) |
3f9c7369 | 702 | { |
d62a17ae | 703 | struct bgp *bgp; |
e50c68b2 | 704 | struct attr attr; |
7208c282 | 705 | struct attr *new_attr = &attr; |
e50c68b2 | 706 | struct aspath *aspath; |
d62a17ae | 707 | struct prefix p; |
708 | struct peer *from; | |
709 | struct bgp_node *rn; | |
d62a17ae | 710 | struct peer *peer; |
b68885f9 | 711 | route_map_result_t ret = RMAP_DENYMATCH; |
d62a17ae | 712 | afi_t afi; |
713 | safi_t safi; | |
714 | ||
715 | if (!subgrp) | |
716 | return; | |
717 | ||
718 | peer = SUBGRP_PEER(subgrp); | |
719 | afi = SUBGRP_AFI(subgrp); | |
720 | safi = SUBGRP_SAFI(subgrp); | |
721 | ||
722 | if (!(afi == AFI_IP || afi == AFI_IP6)) | |
723 | return; | |
724 | ||
725 | bgp = peer->bgp; | |
726 | from = bgp->peer_self; | |
727 | ||
e50c68b2 DS |
728 | bgp_attr_default_set(&attr, BGP_ORIGIN_IGP); |
729 | aspath = attr.aspath; | |
730 | ||
731 | attr.local_pref = bgp->default_local_pref; | |
d62a17ae | 732 | |
cbb65f5e RW |
733 | memset(&p, 0, sizeof(p)); |
734 | p.family = afi2family(afi); | |
735 | p.prefixlen = 0; | |
d62a17ae | 736 | |
e50c68b2 DS |
737 | if ((afi == AFI_IP6) || peer_cap_enhe(peer, afi, safi)) { |
738 | /* IPv6 global nexthop must be included. */ | |
739 | attr.mp_nexthop_len = BGP_ATTR_NHLEN_IPV6_GLOBAL; | |
740 | ||
741 | /* If the peer is on shared nextwork and we have link-local | |
742 | nexthop set it. */ | |
743 | if (peer->shared_network | |
744 | && !IN6_IS_ADDR_UNSPECIFIED(&peer->nexthop.v6_local)) | |
745 | attr.mp_nexthop_len = BGP_ATTR_NHLEN_IPV6_GLOBAL_AND_LL; | |
746 | } | |
747 | ||
d62a17ae | 748 | if (peer->default_rmap[afi][safi].name) { |
7208c282 DA |
749 | struct attr attr_tmp = attr; |
750 | struct bgp_path_info bpi_rmap = {0}; | |
751 | ||
752 | bpi_rmap.peer = bgp->peer_self; | |
753 | bpi_rmap.attr = &attr_tmp; | |
754 | ||
d62a17ae | 755 | SET_FLAG(bgp->peer_self->rmap_type, PEER_RMAP_TYPE_DEFAULT); |
7208c282 DA |
756 | |
757 | /* Iterate over the RIB to see if we can announce | |
758 | * the default route. We announce the default | |
759 | * route only if route-map has a match. | |
760 | */ | |
d62a17ae | 761 | for (rn = bgp_table_top(bgp->rib[afi][safi]); rn; |
762 | rn = bgp_route_next(rn)) { | |
7208c282 DA |
763 | ret = route_map_apply(peer->default_rmap[afi][safi].map, |
764 | &rn->p, RMAP_BGP, &bpi_rmap); | |
765 | ||
d62a17ae | 766 | if (ret != RMAP_DENYMATCH) |
767 | break; | |
768 | } | |
769 | bgp->peer_self->rmap_type = 0; | |
7208c282 | 770 | new_attr = bgp_attr_intern(&attr_tmp); |
d62a17ae | 771 | |
7208c282 DA |
772 | if (ret == RMAP_DENYMATCH) { |
773 | bgp_attr_flush(&attr_tmp); | |
d62a17ae | 774 | withdraw = 1; |
7208c282 | 775 | } |
3f9c7369 | 776 | } |
3f9c7369 | 777 | |
d62a17ae | 778 | if (withdraw) { |
779 | if (CHECK_FLAG(subgrp->sflags, SUBGRP_STATUS_DEFAULT_ORIGINATE)) | |
780 | subgroup_default_withdraw_packet(subgrp); | |
781 | UNSET_FLAG(subgrp->sflags, SUBGRP_STATUS_DEFAULT_ORIGINATE); | |
782 | } else { | |
783 | if (!CHECK_FLAG(subgrp->sflags, | |
784 | SUBGRP_STATUS_DEFAULT_ORIGINATE)) { | |
7f323236 DW |
785 | |
786 | if (bgp_flag_check(bgp, BGP_FLAG_GRACEFUL_SHUTDOWN)) { | |
7208c282 | 787 | bgp_attr_add_gshut_community(new_attr); |
7f323236 DW |
788 | } |
789 | ||
d62a17ae | 790 | SET_FLAG(subgrp->sflags, |
791 | SUBGRP_STATUS_DEFAULT_ORIGINATE); | |
7208c282 | 792 | subgroup_default_update_packet(subgrp, new_attr, from); |
d62a17ae | 793 | |
794 | /* The 'neighbor x.x.x.x default-originate' default will | |
795 | * act as an | |
796 | * implicit withdraw for any previous UPDATEs sent for | |
797 | * 0.0.0.0/0 so | |
798 | * clear adj_out for the 0.0.0.0/0 prefix in the BGP | |
799 | * table. | |
800 | */ | |
cbb65f5e RW |
801 | memset(&p, 0, sizeof(p)); |
802 | p.family = afi2family(afi); | |
803 | p.prefixlen = 0; | |
d62a17ae | 804 | |
805 | rn = bgp_afi_node_get(bgp->rib[afi][safi], afi, safi, | |
806 | &p, NULL); | |
807 | bgp_adj_out_unset_subgroup( | |
808 | rn, subgrp, 0, | |
809 | BGP_ADDPATH_TX_ID_FOR_DEFAULT_ORIGINATE); | |
810 | } | |
811 | } | |
e50c68b2 DS |
812 | |
813 | aspath_unintern(&aspath); | |
3f9c7369 DS |
814 | } |
815 | ||
816 | /* | |
817 | * Announce the BGP table to a subgroup. | |
818 | * | |
819 | * At startup, we try to optimize route announcement by coalescing the | |
820 | * peer-up events. This is done only the first time - from then on, | |
821 | * subgrp->v_coalesce will be set to zero and the normal logic | |
822 | * prevails. | |
823 | */ | |
d62a17ae | 824 | void subgroup_announce_all(struct update_subgroup *subgrp) |
3f9c7369 | 825 | { |
d62a17ae | 826 | if (!subgrp) |
827 | return; | |
828 | ||
829 | /* | |
830 | * If coalesce timer value is not set, announce routes immediately. | |
831 | */ | |
832 | if (!subgrp->v_coalesce) { | |
833 | if (bgp_debug_update(NULL, NULL, subgrp->update_group, 0)) | |
834 | zlog_debug("u%" PRIu64 ":s%" PRIu64 | |
835 | " announcing all routes", | |
836 | subgrp->update_group->id, subgrp->id); | |
837 | subgroup_announce_route(subgrp); | |
838 | return; | |
839 | } | |
840 | ||
841 | /* | |
842 | * We should wait for the coalesce timer. Arm the timer if not done. | |
843 | */ | |
844 | if (!subgrp->t_coalesce) { | |
845 | thread_add_timer_msec(bm->master, subgroup_coalesce_timer, | |
846 | subgrp, subgrp->v_coalesce, | |
847 | &subgrp->t_coalesce); | |
848 | } | |
3f9c7369 DS |
849 | } |
850 | ||
851 | /* | |
852 | * Go through all update subgroups and set up the adv queue for the | |
853 | * input route. | |
854 | */ | |
d62a17ae | 855 | void group_announce_route(struct bgp *bgp, afi_t afi, safi_t safi, |
40381db7 | 856 | struct bgp_node *rn, struct bgp_path_info *pi) |
3f9c7369 | 857 | { |
d62a17ae | 858 | struct updwalk_context ctx; |
40381db7 | 859 | ctx.pi = pi; |
d62a17ae | 860 | ctx.rn = rn; |
861 | update_group_af_walk(bgp, afi, safi, group_announce_route_walkcb, &ctx); | |
3f9c7369 DS |
862 | } |
863 | ||
d62a17ae | 864 | void update_group_show_adj_queue(struct bgp *bgp, afi_t afi, safi_t safi, |
865 | struct vty *vty, uint64_t id) | |
3f9c7369 | 866 | { |
d62a17ae | 867 | updgrp_show_adj(bgp, afi, safi, vty, id, UPDWALK_FLAGS_ADVQUEUE); |
3f9c7369 DS |
868 | } |
869 | ||
d62a17ae | 870 | void update_group_show_advertised(struct bgp *bgp, afi_t afi, safi_t safi, |
871 | struct vty *vty, uint64_t id) | |
3f9c7369 | 872 | { |
d62a17ae | 873 | updgrp_show_adj(bgp, afi, safi, vty, id, UPDWALK_FLAGS_ADVERTISED); |
3f9c7369 DS |
874 | } |
875 | ||
d62a17ae | 876 | void update_group_announce(struct bgp *bgp) |
3f9c7369 | 877 | { |
d62a17ae | 878 | update_group_walk(bgp, update_group_announce_walkcb, NULL); |
3f9c7369 DS |
879 | } |
880 | ||
d62a17ae | 881 | void update_group_announce_rrclients(struct bgp *bgp) |
3f9c7369 | 882 | { |
d62a17ae | 883 | update_group_walk(bgp, update_group_announce_rrc_walkcb, NULL); |
3f9c7369 | 884 | } |