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