]>
Commit | Line | Data |
---|---|---|
718e3744 | 1 | /* Routing Information Base. |
2 | * Copyright (C) 1997, 98, 99, 2001 Kunihiro Ishiguro | |
3 | * | |
4 | * This file is part of GNU Zebra. | |
5 | * | |
6 | * GNU Zebra is free software; you can redistribute it and/or modify it | |
7 | * under the terms of the GNU General Public License as published by the | |
8 | * Free Software Foundation; either version 2, or (at your option) any | |
9 | * later version. | |
10 | * | |
11 | * GNU Zebra is distributed in the hope that it will be useful, but | |
12 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 | * General Public License for more details. | |
15 | * | |
896014f4 DL |
16 | * You should have received a copy of the GNU General Public License along |
17 | * with this program; see the file COPYING; if not, write to the Free Software | |
18 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
718e3744 | 19 | */ |
20 | ||
21 | #include <zebra.h> | |
22 | ||
718e3744 | 23 | #include "command.h" |
43e52561 QY |
24 | #include "if.h" |
25 | #include "linklist.h" | |
718e3744 | 26 | #include "log.h" |
43e52561 QY |
27 | #include "memory.h" |
28 | #include "mpls.h" | |
29 | #include "nexthop.h" | |
30 | #include "prefix.h" | |
7514fb77 PJ |
31 | #include "prefix.h" |
32 | #include "routemap.h" | |
43e52561 | 33 | #include "sockunion.h" |
05737783 | 34 | #include "srcdest_table.h" |
43e52561 QY |
35 | #include "table.h" |
36 | #include "thread.h" | |
37 | #include "vrf.h" | |
38 | #include "workqueue.h" | |
50d89650 | 39 | #include "nexthop_group_private.h" |
00dffa8c | 40 | #include "frr_pthread.h" |
718e3744 | 41 | |
89272910 | 42 | #include "zebra/zebra_router.h" |
43e52561 QY |
43 | #include "zebra/connected.h" |
44 | #include "zebra/debug.h" | |
45 | #include "zebra/interface.h" | |
46 | #include "zebra/redistribute.h" | |
718e3744 | 47 | #include "zebra/rib.h" |
48 | #include "zebra/rt.h" | |
43e52561 QY |
49 | #include "zebra/zapi_msg.h" |
50 | #include "zebra/zebra_errors.h" | |
51 | #include "zebra/zebra_memory.h" | |
7c551956 | 52 | #include "zebra/zebra_ns.h" |
fb018d25 | 53 | #include "zebra/zebra_rnh.h" |
43e52561 QY |
54 | #include "zebra/zebra_routemap.h" |
55 | #include "zebra/zebra_vrf.h" | |
6134fd82 | 56 | #include "zebra/zebra_vxlan.h" |
7cdb1a84 MS |
57 | #include "zebra/zapi_msg.h" |
58 | #include "zebra/zebra_dplane.h" | |
59 | ||
2a99ab95 SW |
60 | DEFINE_MTYPE_STATIC(ZEBRA, RIB_UPDATE_CTX, "Rib update context object"); |
61 | ||
7cdb1a84 MS |
62 | /* |
63 | * Event, list, and mutex for delivery of dataplane results | |
64 | */ | |
65 | static pthread_mutex_t dplane_mutex; | |
66 | static struct thread *t_dplane; | |
25779064 | 67 | static struct dplane_ctx_q rib_dplane_q; |
718e3744 | 68 | |
d62a17ae | 69 | DEFINE_HOOK(rib_update, (struct route_node * rn, const char *reason), |
70 | (rn, reason)) | |
4f8ea50c | 71 | |
6baf7bb8 DS |
72 | /* Should we allow non Quagga processes to delete our routes */ |
73 | extern int allow_delete; | |
74 | ||
718e3744 | 75 | /* Each route type's string and default distance value. */ |
d62a17ae | 76 | static const struct { |
77 | int key; | |
8dc7a759 | 78 | uint8_t distance; |
73547a75 | 79 | uint8_t meta_q_map; |
d62a17ae | 80 | } route_info[ZEBRA_ROUTE_MAX] = { |
e22e8001 SW |
81 | [ZEBRA_ROUTE_NHG] = {ZEBRA_ROUTE_NHG, 255 /* Uneeded for nhg's */, 0}, |
82 | [ZEBRA_ROUTE_SYSTEM] = {ZEBRA_ROUTE_SYSTEM, 0, 5}, | |
83 | [ZEBRA_ROUTE_KERNEL] = {ZEBRA_ROUTE_KERNEL, 0, 1}, | |
84 | [ZEBRA_ROUTE_CONNECT] = {ZEBRA_ROUTE_CONNECT, 0, 1}, | |
85 | [ZEBRA_ROUTE_STATIC] = {ZEBRA_ROUTE_STATIC, 1, 2}, | |
86 | [ZEBRA_ROUTE_RIP] = {ZEBRA_ROUTE_RIP, 120, 3}, | |
87 | [ZEBRA_ROUTE_RIPNG] = {ZEBRA_ROUTE_RIPNG, 120, 3}, | |
88 | [ZEBRA_ROUTE_OSPF] = {ZEBRA_ROUTE_OSPF, 110, 3}, | |
89 | [ZEBRA_ROUTE_OSPF6] = {ZEBRA_ROUTE_OSPF6, 110, 3}, | |
90 | [ZEBRA_ROUTE_ISIS] = {ZEBRA_ROUTE_ISIS, 115, 3}, | |
91 | [ZEBRA_ROUTE_BGP] = {ZEBRA_ROUTE_BGP, 20 /* IBGP is 200. */, 4}, | |
92 | [ZEBRA_ROUTE_PIM] = {ZEBRA_ROUTE_PIM, 255, 5}, | |
93 | [ZEBRA_ROUTE_EIGRP] = {ZEBRA_ROUTE_EIGRP, 90, 3}, | |
94 | [ZEBRA_ROUTE_NHRP] = {ZEBRA_ROUTE_NHRP, 10, 3}, | |
95 | [ZEBRA_ROUTE_HSLS] = {ZEBRA_ROUTE_HSLS, 255, 5}, | |
96 | [ZEBRA_ROUTE_OLSR] = {ZEBRA_ROUTE_OLSR, 255, 5}, | |
97 | [ZEBRA_ROUTE_TABLE] = {ZEBRA_ROUTE_TABLE, 150, 2}, | |
98 | [ZEBRA_ROUTE_LDP] = {ZEBRA_ROUTE_LDP, 150, 5}, | |
99 | [ZEBRA_ROUTE_VNC] = {ZEBRA_ROUTE_VNC, 20, 4}, | |
100 | [ZEBRA_ROUTE_VNC_DIRECT] = {ZEBRA_ROUTE_VNC_DIRECT, 20, 4}, | |
101 | [ZEBRA_ROUTE_VNC_DIRECT_RH] = {ZEBRA_ROUTE_VNC_DIRECT_RH, 20, 4}, | |
102 | [ZEBRA_ROUTE_BGP_DIRECT] = {ZEBRA_ROUTE_BGP_DIRECT, 20, 4}, | |
103 | [ZEBRA_ROUTE_BGP_DIRECT_EXT] = {ZEBRA_ROUTE_BGP_DIRECT_EXT, 20, 4}, | |
104 | [ZEBRA_ROUTE_BABEL] = {ZEBRA_ROUTE_BABEL, 100, 3}, | |
105 | [ZEBRA_ROUTE_SHARP] = {ZEBRA_ROUTE_SHARP, 150, 5}, | |
106 | [ZEBRA_ROUTE_PBR] = {ZEBRA_ROUTE_PBR, 200, 5}, | |
107 | [ZEBRA_ROUTE_BFD] = {ZEBRA_ROUTE_BFD, 255, 5}, | |
108 | [ZEBRA_ROUTE_OPENFABRIC] = {ZEBRA_ROUTE_OPENFABRIC, 115, 3}, | |
109 | [ZEBRA_ROUTE_VRRP] = {ZEBRA_ROUTE_VRRP, 255, 5} | |
d6abd8b0 | 110 | /* Any new route type added to zebra, should be mirrored here */ |
c710b277 | 111 | |
d62a17ae | 112 | /* no entry/default: 150 */ |
718e3744 | 113 | }; |
6b0655a2 | 114 | |
d62a17ae | 115 | static void __attribute__((format(printf, 5, 6))) |
116 | _rnode_zlog(const char *_func, vrf_id_t vrf_id, struct route_node *rn, | |
117 | int priority, const char *msgfmt, ...) | |
2263a412 | 118 | { |
d62a17ae | 119 | char buf[SRCDEST2STR_BUFFER + sizeof(" (MRIB)")]; |
120 | char msgbuf[512]; | |
121 | va_list ap; | |
2263a412 | 122 | |
d62a17ae | 123 | va_start(ap, msgfmt); |
124 | vsnprintf(msgbuf, sizeof(msgbuf), msgfmt, ap); | |
125 | va_end(ap); | |
2263a412 | 126 | |
d62a17ae | 127 | if (rn) { |
128 | rib_table_info_t *info = srcdest_rnode_table_info(rn); | |
129 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
cb653491 | 130 | |
d62a17ae | 131 | if (info->safi == SAFI_MULTICAST) |
eab4a5c2 | 132 | strlcat(buf, " (MRIB)", sizeof(buf)); |
d62a17ae | 133 | } else { |
134 | snprintf(buf, sizeof(buf), "{(route_node *) NULL}"); | |
135 | } | |
2263a412 | 136 | |
d62a17ae | 137 | zlog(priority, "%s: %d:%s: %s", _func, vrf_id, buf, msgbuf); |
2263a412 DL |
138 | } |
139 | ||
d62a17ae | 140 | #define rnode_debug(node, vrf_id, ...) \ |
2263a412 | 141 | _rnode_zlog(__func__, vrf_id, node, LOG_DEBUG, __VA_ARGS__) |
d62a17ae | 142 | #define rnode_info(node, ...) \ |
2263a412 DL |
143 | _rnode_zlog(__func__, vrf_id, node, LOG_INFO, __VA_ARGS__) |
144 | ||
fd289fc8 | 145 | uint8_t route_distance(int type) |
40c7bdb0 | 146 | { |
fd289fc8 | 147 | uint8_t distance; |
40c7bdb0 | 148 | |
d62a17ae | 149 | if ((unsigned)type >= array_size(route_info)) |
150 | distance = 150; | |
151 | else | |
152 | distance = route_info[type].distance; | |
40c7bdb0 | 153 | |
d62a17ae | 154 | return distance; |
40c7bdb0 | 155 | } |
156 | ||
d7c0a89a | 157 | int is_zebra_valid_kernel_table(uint32_t table_id) |
7a4bb9c5 | 158 | { |
8f500a1c | 159 | #ifdef linux |
d62a17ae | 160 | if ((table_id == RT_TABLE_UNSPEC) || (table_id == RT_TABLE_LOCAL) |
161 | || (table_id == RT_TABLE_COMPAT)) | |
162 | return 0; | |
8f500a1c RW |
163 | #endif |
164 | ||
d62a17ae | 165 | return 1; |
7a4bb9c5 DS |
166 | } |
167 | ||
d7c0a89a | 168 | int is_zebra_main_routing_table(uint32_t table_id) |
7a4bb9c5 | 169 | { |
c447ad08 | 170 | if (table_id == RT_TABLE_MAIN) |
d62a17ae | 171 | return 1; |
172 | return 0; | |
7a4bb9c5 DS |
173 | } |
174 | ||
86391e56 | 175 | int zebra_check_addr(const struct prefix *p) |
0aabccc0 | 176 | { |
d62a17ae | 177 | if (p->family == AF_INET) { |
d7c0a89a | 178 | uint32_t addr; |
0aabccc0 | 179 | |
d62a17ae | 180 | addr = p->u.prefix4.s_addr; |
181 | addr = ntohl(addr); | |
0aabccc0 | 182 | |
d62a17ae | 183 | if (IPV4_NET127(addr) || IN_CLASSD(addr) |
184 | || IPV4_LINKLOCAL(addr)) | |
185 | return 0; | |
186 | } | |
187 | if (p->family == AF_INET6) { | |
188 | if (IN6_IS_ADDR_LOOPBACK(&p->u.prefix6)) | |
189 | return 0; | |
190 | if (IN6_IS_ADDR_LINKLOCAL(&p->u.prefix6)) | |
191 | return 0; | |
192 | } | |
193 | return 1; | |
0aabccc0 DD |
194 | } |
195 | ||
6e26278c DS |
196 | /** |
197 | * copy_nexthop - copy a nexthop to the rib structure. | |
198 | */ | |
d62a17ae | 199 | void route_entry_copy_nexthops(struct route_entry *re, struct nexthop *nh) |
6e26278c | 200 | { |
0eb97b86 MS |
201 | assert(!re->nhe->nhg->nexthop); |
202 | copy_nexthops(&re->nhe->nhg->nexthop, nh, NULL); | |
718e3744 | 203 | } |
204 | ||
5463ce26 MS |
205 | static void route_entry_attach_ref(struct route_entry *re, |
206 | struct nhg_hash_entry *new) | |
718e3744 | 207 | { |
0eb97b86 | 208 | re->nhe = new; |
5463ce26 | 209 | re->nhe_id = new->id; |
718e3744 | 210 | |
5463ce26 | 211 | zebra_nhg_increment_ref(new); |
718e3744 | 212 | } |
213 | ||
5463ce26 | 214 | int route_entry_update_nhe(struct route_entry *re, struct nhg_hash_entry *new) |
718e3744 | 215 | { |
5463ce26 MS |
216 | struct nhg_hash_entry *old = NULL; |
217 | int ret = 0; | |
718e3744 | 218 | |
5463ce26 | 219 | if (new == NULL) { |
0eb97b86 | 220 | re->nhe->nhg = NULL; |
5463ce26 MS |
221 | goto done; |
222 | } | |
718e3744 | 223 | |
5463ce26 MS |
224 | if (re->nhe_id != new->id) { |
225 | old = zebra_nhg_lookup_id(re->nhe_id); | |
718e3744 | 226 | |
5463ce26 | 227 | route_entry_attach_ref(re, new); |
718e3744 | 228 | |
5463ce26 MS |
229 | if (old) |
230 | zebra_nhg_decrement_ref(old); | |
0eb97b86 | 231 | } else if (!re->nhe->nhg) |
5463ce26 MS |
232 | /* This is the first time it's being attached */ |
233 | route_entry_attach_ref(re, new); | |
595db7f1 | 234 | |
5463ce26 MS |
235 | done: |
236 | return ret; | |
595db7f1 | 237 | } |
238 | ||
d62a17ae | 239 | struct route_entry *rib_match(afi_t afi, safi_t safi, vrf_id_t vrf_id, |
240 | union g_addr *addr, struct route_node **rn_out) | |
241 | { | |
242 | struct prefix p; | |
243 | struct route_table *table; | |
244 | struct route_node *rn; | |
5f7a4718 | 245 | struct route_entry *match = NULL; |
d62a17ae | 246 | |
247 | /* Lookup table. */ | |
248 | table = zebra_vrf_table(afi, safi, vrf_id); | |
249 | if (!table) | |
250 | return 0; | |
251 | ||
252 | memset(&p, 0, sizeof(struct prefix)); | |
253 | p.family = afi; | |
254 | if (afi == AFI_IP) { | |
255 | p.u.prefix4 = addr->ipv4; | |
256 | p.prefixlen = IPV4_MAX_PREFIXLEN; | |
257 | } else { | |
258 | p.u.prefix6 = addr->ipv6; | |
259 | p.prefixlen = IPV6_MAX_PREFIXLEN; | |
260 | } | |
718e3744 | 261 | |
d62a17ae | 262 | rn = route_node_match(table, (struct prefix *)&p); |
718e3744 | 263 | |
d62a17ae | 264 | while (rn) { |
5f7a4718 DS |
265 | rib_dest_t *dest; |
266 | ||
d62a17ae | 267 | route_unlock_node(rn); |
718e3744 | 268 | |
5f7a4718 | 269 | dest = rib_dest_from_rnode(rn); |
996c9314 LB |
270 | if (dest && dest->selected_fib |
271 | && !CHECK_FLAG(dest->selected_fib->status, | |
272 | ROUTE_ENTRY_REMOVED)) | |
5f7a4718 | 273 | match = dest->selected_fib; |
718e3744 | 274 | |
d62a17ae | 275 | /* If there is no selected route or matched route is EGP, go up |
276 | tree. */ | |
277 | if (!match) { | |
278 | do { | |
279 | rn = rn->parent; | |
280 | } while (rn && rn->info == NULL); | |
281 | if (rn) | |
282 | route_lock_node(rn); | |
283 | } else { | |
284 | if (match->type != ZEBRA_ROUTE_CONNECT) { | |
677c1dd5 DS |
285 | if (!CHECK_FLAG(match->status, |
286 | ROUTE_ENTRY_INSTALLED)) | |
d62a17ae | 287 | return NULL; |
288 | } | |
289 | ||
290 | if (rn_out) | |
291 | *rn_out = rn; | |
292 | return match; | |
293 | } | |
16814f96 | 294 | } |
d62a17ae | 295 | return NULL; |
296 | } | |
297 | ||
298 | struct route_entry *rib_match_ipv4_multicast(vrf_id_t vrf_id, | |
299 | struct in_addr addr, | |
300 | struct route_node **rn_out) | |
301 | { | |
302 | struct route_entry *re = NULL, *mre = NULL, *ure = NULL; | |
303 | struct route_node *m_rn = NULL, *u_rn = NULL; | |
304 | union g_addr gaddr = {.ipv4 = addr}; | |
305 | ||
526052fb | 306 | switch (zrouter.ipv4_multicast_mode) { |
d62a17ae | 307 | case MCAST_MRIB_ONLY: |
308 | return rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr, | |
309 | rn_out); | |
310 | case MCAST_URIB_ONLY: | |
311 | return rib_match(AFI_IP, SAFI_UNICAST, vrf_id, &gaddr, rn_out); | |
312 | case MCAST_NO_CONFIG: | |
313 | case MCAST_MIX_MRIB_FIRST: | |
314 | re = mre = rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr, | |
315 | &m_rn); | |
316 | if (!mre) | |
317 | re = ure = rib_match(AFI_IP, SAFI_UNICAST, vrf_id, | |
318 | &gaddr, &u_rn); | |
319 | break; | |
320 | case MCAST_MIX_DISTANCE: | |
321 | mre = rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr, &m_rn); | |
322 | ure = rib_match(AFI_IP, SAFI_UNICAST, vrf_id, &gaddr, &u_rn); | |
323 | if (mre && ure) | |
324 | re = ure->distance < mre->distance ? ure : mre; | |
325 | else if (mre) | |
326 | re = mre; | |
327 | else if (ure) | |
328 | re = ure; | |
329 | break; | |
330 | case MCAST_MIX_PFXLEN: | |
331 | mre = rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr, &m_rn); | |
332 | ure = rib_match(AFI_IP, SAFI_UNICAST, vrf_id, &gaddr, &u_rn); | |
333 | if (mre && ure) | |
334 | re = u_rn->p.prefixlen > m_rn->p.prefixlen ? ure : mre; | |
335 | else if (mre) | |
336 | re = mre; | |
337 | else if (ure) | |
338 | re = ure; | |
339 | break; | |
718e3744 | 340 | } |
33550aa8 | 341 | |
d62a17ae | 342 | if (rn_out) |
343 | *rn_out = (re == mre) ? m_rn : u_rn; | |
718e3744 | 344 | |
d62a17ae | 345 | if (IS_ZEBRA_DEBUG_RIB) { |
346 | char buf[BUFSIZ]; | |
347 | inet_ntop(AF_INET, &addr, buf, BUFSIZ); | |
4623d897 | 348 | |
32391aff DS |
349 | zlog_debug("%s: %s: vrf: %u found %s, using %s", |
350 | __func__, buf, vrf_id, | |
d62a17ae | 351 | mre ? (ure ? "MRIB+URIB" : "MRIB") |
352 | : ure ? "URIB" : "nothing", | |
353 | re == ure ? "URIB" : re == mre ? "MRIB" : "none"); | |
354 | } | |
355 | return re; | |
4623d897 DL |
356 | } |
357 | ||
d62a17ae | 358 | struct route_entry *rib_lookup_ipv4(struct prefix_ipv4 *p, vrf_id_t vrf_id) |
718e3744 | 359 | { |
d62a17ae | 360 | struct route_table *table; |
361 | struct route_node *rn; | |
5f7a4718 | 362 | struct route_entry *match = NULL; |
5f7a4718 | 363 | rib_dest_t *dest; |
718e3744 | 364 | |
d62a17ae | 365 | /* Lookup table. */ |
366 | table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id); | |
367 | if (!table) | |
368 | return 0; | |
718e3744 | 369 | |
d62a17ae | 370 | rn = route_node_lookup(table, (struct prefix *)p); |
718e3744 | 371 | |
d62a17ae | 372 | /* No route for this prefix. */ |
373 | if (!rn) | |
374 | return NULL; | |
718e3744 | 375 | |
d62a17ae | 376 | /* Unlock node. */ |
377 | route_unlock_node(rn); | |
5f7a4718 | 378 | dest = rib_dest_from_rnode(rn); |
718e3744 | 379 | |
996c9314 LB |
380 | if (dest && dest->selected_fib |
381 | && !CHECK_FLAG(dest->selected_fib->status, ROUTE_ENTRY_REMOVED)) | |
5f7a4718 | 382 | match = dest->selected_fib; |
718e3744 | 383 | |
d62a17ae | 384 | if (!match) |
385 | return NULL; | |
718e3744 | 386 | |
d62a17ae | 387 | if (match->type == ZEBRA_ROUTE_CONNECT) |
388 | return match; | |
f9e1b38e | 389 | |
677c1dd5 DS |
390 | if (CHECK_FLAG(match->status, ROUTE_ENTRY_INSTALLED)) |
391 | return match; | |
718e3744 | 392 | |
d62a17ae | 393 | return NULL; |
718e3744 | 394 | } |
395 | ||
a64448ba DS |
396 | /* |
397 | * Is this RIB labeled-unicast? It must be of type BGP and all paths | |
398 | * (nexthops) must have a label. | |
399 | */ | |
d62a17ae | 400 | int zebra_rib_labeled_unicast(struct route_entry *re) |
a64448ba | 401 | { |
d62a17ae | 402 | struct nexthop *nexthop = NULL; |
a64448ba | 403 | |
d62a17ae | 404 | if (re->type != ZEBRA_ROUTE_BGP) |
405 | return 0; | |
a64448ba | 406 | |
0eb97b86 | 407 | for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop)) |
d62a17ae | 408 | if (!nexthop->nh_label || !nexthop->nh_label->num_labels) |
409 | return 0; | |
6b0655a2 | 410 | |
d62a17ae | 411 | return 1; |
a64448ba | 412 | } |
718e3744 | 413 | |
6ae24471 DS |
414 | /* Update flag indicates whether this is a "replace" or not. Currently, this |
415 | * is only used for IPv4. | |
416 | */ | |
0c555cc6 DS |
417 | void rib_install_kernel(struct route_node *rn, struct route_entry *re, |
418 | struct route_entry *old) | |
718e3744 | 419 | { |
d62a17ae | 420 | struct nexthop *nexthop; |
421 | rib_table_info_t *info = srcdest_rnode_table_info(rn); | |
d62a17ae | 422 | struct zebra_vrf *zvrf = vrf_info_lookup(re->vrf_id); |
97f5b441 MS |
423 | const struct prefix *p, *src_p; |
424 | enum zebra_dplane_result ret; | |
425 | ||
426 | rib_dest_t *dest = rib_dest_from_rnode(rn); | |
718e3744 | 427 | |
d62a17ae | 428 | srcdest_rnode_prefixes(rn, &p, &src_p); |
416ec78d | 429 | |
d62a17ae | 430 | if (info->safi != SAFI_UNICAST) { |
0eb97b86 | 431 | for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop)) |
d62a17ae | 432 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); |
0c555cc6 | 433 | return; |
d62a17ae | 434 | } |
718e3744 | 435 | |
9ef49038 | 436 | |
8dfbc657 SW |
437 | /* |
438 | * Install the resolved nexthop object first. | |
439 | */ | |
f429bd1b | 440 | zebra_nhg_install_kernel(zebra_nhg_lookup_id(re->nhe_id)); |
8dfbc657 | 441 | |
2063a814 DS |
442 | /* |
443 | * If this is a replace to a new RE let the originator of the RE | |
444 | * know that they've lost | |
445 | */ | |
9a9f8926 | 446 | if (old && (old != re) && (old->type != re->type)) |
28610f7e | 447 | zsend_route_notify_owner(old, p, ZAPI_ROUTE_BETTER_ADMIN_WON); |
25b9cb0c | 448 | |
97f5b441 MS |
449 | /* Update fib selection */ |
450 | dest->selected_fib = re; | |
451 | ||
d62a17ae | 452 | /* |
453 | * Make sure we update the FPM any time we send new information to | |
454 | * the kernel. | |
455 | */ | |
456 | hook_call(rib_update, rn, "installing in kernel"); | |
97f5b441 MS |
457 | |
458 | /* Send add or update */ | |
8263d1d0 | 459 | if (old) |
97f5b441 | 460 | ret = dplane_route_update(rn, re, old); |
5709131c | 461 | else |
97f5b441 | 462 | ret = dplane_route_add(rn, re); |
97f5b441 MS |
463 | |
464 | switch (ret) { | |
ea1c14f6 | 465 | case ZEBRA_DPLANE_REQUEST_QUEUED: |
60f98b23 | 466 | SET_FLAG(re->status, ROUTE_ENTRY_QUEUED); |
efe6c026 MS |
467 | |
468 | if (old) { | |
60f98b23 | 469 | SET_FLAG(old->status, ROUTE_ENTRY_QUEUED); |
efe6c026 MS |
470 | |
471 | /* Free old FIB nexthop group */ | |
472 | if (old->fib_ng.nexthop) { | |
473 | nexthops_free(old->fib_ng.nexthop); | |
474 | old->fib_ng.nexthop = NULL; | |
475 | } | |
efe6c026 MS |
476 | } |
477 | ||
97f5b441 MS |
478 | if (zvrf) |
479 | zvrf->installs_queued++; | |
1e885672 | 480 | break; |
ea1c14f6 | 481 | case ZEBRA_DPLANE_REQUEST_FAILURE: |
97f5b441 MS |
482 | { |
483 | char str[SRCDEST2STR_BUFFER]; | |
484 | ||
485 | srcdest_rnode2str(rn, str, sizeof(str)); | |
486 | flog_err(EC_ZEBRA_DP_INSTALL_FAIL, | |
487 | "%u:%s: Failed to enqueue dataplane install", | |
488 | re->vrf_id, str); | |
1e885672 | 489 | break; |
97f5b441 | 490 | } |
ea1c14f6 | 491 | case ZEBRA_DPLANE_REQUEST_SUCCESS: |
97f5b441 MS |
492 | if (zvrf) |
493 | zvrf->installs++; | |
1e885672 DS |
494 | break; |
495 | } | |
d62a17ae | 496 | |
0c555cc6 | 497 | return; |
718e3744 | 498 | } |
499 | ||
500 | /* Uninstall the route from kernel. */ | |
0c555cc6 | 501 | void rib_uninstall_kernel(struct route_node *rn, struct route_entry *re) |
718e3744 | 502 | { |
d62a17ae | 503 | struct nexthop *nexthop; |
504 | rib_table_info_t *info = srcdest_rnode_table_info(rn); | |
d62a17ae | 505 | struct zebra_vrf *zvrf = vrf_info_lookup(re->vrf_id); |
05737783 | 506 | |
d62a17ae | 507 | if (info->safi != SAFI_UNICAST) { |
677c1dd5 | 508 | UNSET_FLAG(re->status, ROUTE_ENTRY_INSTALLED); |
0eb97b86 | 509 | for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop)) |
d6792f9d | 510 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); |
0c555cc6 | 511 | return; |
d62a17ae | 512 | } |
416ec78d | 513 | |
d62a17ae | 514 | /* |
515 | * Make sure we update the FPM any time we send new information to | |
97f5b441 | 516 | * the dataplane. |
d62a17ae | 517 | */ |
518 | hook_call(rib_update, rn, "uninstalling from kernel"); | |
97f5b441 MS |
519 | |
520 | switch (dplane_route_delete(rn, re)) { | |
ea1c14f6 | 521 | case ZEBRA_DPLANE_REQUEST_QUEUED: |
97f5b441 MS |
522 | if (zvrf) |
523 | zvrf->removals_queued++; | |
1e885672 | 524 | break; |
ea1c14f6 | 525 | case ZEBRA_DPLANE_REQUEST_FAILURE: |
97f5b441 MS |
526 | { |
527 | char str[SRCDEST2STR_BUFFER]; | |
528 | ||
529 | srcdest_rnode2str(rn, str, sizeof(str)); | |
530 | flog_err(EC_ZEBRA_DP_INSTALL_FAIL, | |
531 | "%u:%s: Failed to enqueue dataplane uninstall", | |
532 | re->vrf_id, str); | |
1e885672 | 533 | break; |
97f5b441 | 534 | } |
ea1c14f6 | 535 | case ZEBRA_DPLANE_REQUEST_SUCCESS: |
1e885672 DS |
536 | if (zvrf) |
537 | zvrf->removals++; | |
538 | break; | |
539 | } | |
718e3744 | 540 | |
0c555cc6 | 541 | return; |
718e3744 | 542 | } |
543 | ||
544 | /* Uninstall the route from kernel. */ | |
d62a17ae | 545 | static void rib_uninstall(struct route_node *rn, struct route_entry *re) |
718e3744 | 546 | { |
d62a17ae | 547 | rib_table_info_t *info = srcdest_rnode_table_info(rn); |
5f7a4718 | 548 | rib_dest_t *dest = rib_dest_from_rnode(rn); |
97f5b441 | 549 | struct nexthop *nexthop; |
416ec78d | 550 | |
5f7a4718 | 551 | if (dest && dest->selected_fib == re) { |
d62a17ae | 552 | if (info->safi == SAFI_UNICAST) |
553 | hook_call(rib_update, rn, "rib_uninstall"); | |
5adc2528 | 554 | |
d62a17ae | 555 | /* If labeled-unicast route, uninstall transit LSP. */ |
556 | if (zebra_rib_labeled_unicast(re)) | |
557 | zebra_mpls_lsp_uninstall(info->zvrf, rn, re); | |
7cdb1a84 | 558 | |
3cdba47a | 559 | rib_uninstall_kernel(rn, re); |
97f5b441 MS |
560 | |
561 | dest->selected_fib = NULL; | |
562 | ||
efe6c026 MS |
563 | /* Free FIB nexthop group, if present */ |
564 | if (re->fib_ng.nexthop) { | |
565 | nexthops_free(re->fib_ng.nexthop); | |
566 | re->fib_ng.nexthop = NULL; | |
567 | } | |
568 | ||
0eb97b86 | 569 | for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop)) |
97f5b441 | 570 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); |
d62a17ae | 571 | } |
446bb95e | 572 | |
d62a17ae | 573 | if (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED)) { |
86391e56 MS |
574 | const struct prefix *p, *src_p; |
575 | ||
d62a17ae | 576 | srcdest_rnode_prefixes(rn, &p, &src_p); |
05737783 | 577 | |
40f321c0 | 578 | redistribute_delete(p, src_p, re, NULL); |
d62a17ae | 579 | UNSET_FLAG(re->flags, ZEBRA_FLAG_SELECTED); |
580 | } | |
718e3744 | 581 | } |
582 | ||
9fd92e3c AS |
583 | /* |
584 | * rib_can_delete_dest | |
585 | * | |
2951a7a4 | 586 | * Returns true if the given dest can be deleted from the table. |
9fd92e3c | 587 | */ |
d62a17ae | 588 | static int rib_can_delete_dest(rib_dest_t *dest) |
9fd92e3c | 589 | { |
045207e2 | 590 | if (re_list_first(&dest->routes)) { |
d62a17ae | 591 | return 0; |
592 | } | |
9fd92e3c | 593 | |
c86ba6c2 DS |
594 | /* |
595 | * Unresolved rnh's are stored on the default route's list | |
596 | * | |
597 | * dest->rnode can also be the source prefix node in an | |
598 | * ipv6 sourcedest table. Fortunately the prefix of a | |
599 | * source prefix node can never be the default prefix. | |
600 | */ | |
601 | if (is_default_prefix(&dest->rnode->p)) | |
602 | return 0; | |
603 | ||
d62a17ae | 604 | /* |
605 | * Don't delete the dest if we have to update the FPM about this | |
606 | * prefix. | |
607 | */ | |
608 | if (CHECK_FLAG(dest->flags, RIB_DEST_UPDATE_FPM) | |
609 | || CHECK_FLAG(dest->flags, RIB_DEST_SENT_TO_FPM)) | |
610 | return 0; | |
5adc2528 | 611 | |
d62a17ae | 612 | return 1; |
9fd92e3c AS |
613 | } |
614 | ||
699dae23 DS |
615 | void zebra_rib_evaluate_rn_nexthops(struct route_node *rn, uint32_t seq) |
616 | { | |
617 | rib_dest_t *dest = rib_dest_from_rnode(rn); | |
699dae23 DS |
618 | struct rnh *rnh; |
619 | ||
620 | /* | |
50872b08 | 621 | * We are storing the rnh's associated withb |
699dae23 DS |
622 | * the tracked nexthop as a list of the rn's. |
623 | * Unresolved rnh's are placed at the top | |
624 | * of the tree list.( 0.0.0.0/0 for v4 and 0::0/0 for v6 ) | |
625 | * As such for each rn we need to walk up the tree | |
626 | * and see if any rnh's need to see if they | |
627 | * would match a more specific route | |
628 | */ | |
629 | while (rn) { | |
50872b08 DS |
630 | if (IS_ZEBRA_DEBUG_NHT_DETAILED) { |
631 | char buf[PREFIX_STRLEN]; | |
632 | ||
0a7be328 | 633 | zlog_debug("%s: %s Being examined for Nexthop Tracking Count: %zd", |
50872b08 | 634 | __PRETTY_FUNCTION__, |
0a7be328 DS |
635 | srcdest_rnode2str(rn, buf, sizeof(buf)), |
636 | dest ? rnh_list_count(&dest->nht) : 0); | |
50872b08 | 637 | } |
699dae23 DS |
638 | if (!dest) { |
639 | rn = rn->parent; | |
640 | if (rn) | |
641 | dest = rib_dest_from_rnode(rn); | |
642 | continue; | |
643 | } | |
644 | /* | |
645 | * If we have any rnh's stored in the nht list | |
646 | * then we know that this route node was used for | |
647 | * nht resolution and as such we need to call the | |
648 | * nexthop tracking evaluation code | |
649 | */ | |
739c9c90 | 650 | frr_each_safe(rnh_list, &dest->nht, rnh) { |
699dae23 DS |
651 | struct zebra_vrf *zvrf = |
652 | zebra_vrf_lookup_by_id(rnh->vrf_id); | |
653 | struct prefix *p = &rnh->node->p; | |
654 | ||
50872b08 | 655 | if (IS_ZEBRA_DEBUG_NHT_DETAILED) { |
699dae23 DS |
656 | char buf1[PREFIX_STRLEN]; |
657 | char buf2[PREFIX_STRLEN]; | |
658 | ||
0a7be328 | 659 | zlog_debug("%u:%s has Nexthop(%s) Type: %s depending on it, evaluating %u:%u", |
699dae23 | 660 | zvrf->vrf->vrf_id, |
50872b08 | 661 | srcdest_rnode2str(rn, buf1, |
699dae23 DS |
662 | sizeof(buf1)), |
663 | prefix2str(p, buf2, sizeof(buf2)), | |
0a7be328 | 664 | rnh_type2str(rnh->type), |
699dae23 DS |
665 | seq, rnh->seqno); |
666 | } | |
667 | ||
668 | /* | |
669 | * If we have evaluated this node on this pass | |
670 | * already, due to following the tree up | |
671 | * then we know that we can move onto the next | |
672 | * rnh to process. | |
673 | * | |
674 | * Additionally we call zebra_evaluate_rnh | |
675 | * when we gc the dest. In this case we know | |
676 | * that there must be no other re's where | |
677 | * we were originally as such we know that | |
678 | * that sequence number is ok to respect. | |
679 | */ | |
50872b08 DS |
680 | if (rnh->seqno == seq) { |
681 | if (IS_ZEBRA_DEBUG_NHT_DETAILED) | |
682 | zlog_debug( | |
683 | "\tNode processed and moved already"); | |
699dae23 | 684 | continue; |
50872b08 | 685 | } |
699dae23 DS |
686 | |
687 | rnh->seqno = seq; | |
688 | zebra_evaluate_rnh(zvrf, family2afi(p->family), 0, | |
689 | rnh->type, p); | |
690 | } | |
691 | ||
692 | rn = rn->parent; | |
693 | if (rn) | |
694 | dest = rib_dest_from_rnode(rn); | |
695 | } | |
696 | } | |
697 | ||
9fd92e3c AS |
698 | /* |
699 | * rib_gc_dest | |
700 | * | |
701 | * Garbage collect the rib dest corresponding to the given route node | |
702 | * if appropriate. | |
703 | * | |
2951a7a4 | 704 | * Returns true if the dest was deleted, false otherwise. |
9fd92e3c | 705 | */ |
d62a17ae | 706 | int rib_gc_dest(struct route_node *rn) |
9fd92e3c | 707 | { |
d62a17ae | 708 | rib_dest_t *dest; |
9fd92e3c | 709 | |
d62a17ae | 710 | dest = rib_dest_from_rnode(rn); |
711 | if (!dest) | |
712 | return 0; | |
9fd92e3c | 713 | |
d62a17ae | 714 | if (!rib_can_delete_dest(dest)) |
715 | return 0; | |
9fd92e3c | 716 | |
c9abf558 DS |
717 | if (IS_ZEBRA_DEBUG_RIB) { |
718 | struct zebra_vrf *zvrf; | |
719 | ||
720 | zvrf = rib_dest_vrf(dest); | |
d62a17ae | 721 | rnode_debug(rn, zvrf_id(zvrf), "removing dest from table"); |
c9abf558 | 722 | } |
9fd92e3c | 723 | |
699dae23 DS |
724 | zebra_rib_evaluate_rn_nexthops(rn, zebra_router_get_next_sequence()); |
725 | ||
d62a17ae | 726 | dest->rnode = NULL; |
aa57abfb | 727 | rnh_list_fini(&dest->nht); |
d62a17ae | 728 | XFREE(MTYPE_RIB_DEST, dest); |
729 | rn->info = NULL; | |
9fd92e3c | 730 | |
d62a17ae | 731 | /* |
732 | * Release the one reference that we keep on the route node. | |
733 | */ | |
734 | route_unlock_node(rn); | |
735 | return 1; | |
9fd92e3c AS |
736 | } |
737 | ||
d62a17ae | 738 | static void rib_process_add_fib(struct zebra_vrf *zvrf, struct route_node *rn, |
739 | struct route_entry *new) | |
3e5c6e00 | 740 | { |
d62a17ae | 741 | hook_call(rib_update, rn, "new route selected"); |
3e5c6e00 | 742 | |
d62a17ae | 743 | /* Update real nexthop. This may actually determine if nexthop is active |
744 | * or not. */ | |
0eb97b86 | 745 | if (!nexthop_group_active_nexthop_num(new->nhe->nhg)) { |
d62a17ae | 746 | UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED); |
747 | return; | |
748 | } | |
3e5c6e00 | 749 | |
d62a17ae | 750 | if (IS_ZEBRA_DEBUG_RIB) { |
751 | char buf[SRCDEST2STR_BUFFER]; | |
752 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
2da33d6b DS |
753 | zlog_debug("%u:%s: Adding route rn %p, re %p (%s)", |
754 | zvrf_id(zvrf), buf, rn, new, | |
755 | zebra_route_string(new->type)); | |
d62a17ae | 756 | } |
3e5c6e00 | 757 | |
d62a17ae | 758 | /* If labeled-unicast route, install transit LSP. */ |
759 | if (zebra_rib_labeled_unicast(new)) | |
760 | zebra_mpls_lsp_install(zvrf, rn, new); | |
a64448ba | 761 | |
3cdba47a | 762 | rib_install_kernel(rn, new, NULL); |
3e5c6e00 | 763 | |
d62a17ae | 764 | UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED); |
3e5c6e00 | 765 | } |
766 | ||
d62a17ae | 767 | static void rib_process_del_fib(struct zebra_vrf *zvrf, struct route_node *rn, |
768 | struct route_entry *old) | |
3e5c6e00 | 769 | { |
d62a17ae | 770 | hook_call(rib_update, rn, "removing existing route"); |
3e5c6e00 | 771 | |
d62a17ae | 772 | /* Uninstall from kernel. */ |
773 | if (IS_ZEBRA_DEBUG_RIB) { | |
774 | char buf[SRCDEST2STR_BUFFER]; | |
775 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
2da33d6b DS |
776 | zlog_debug("%u:%s: Deleting route rn %p, re %p (%s)", |
777 | zvrf_id(zvrf), buf, rn, old, | |
778 | zebra_route_string(old->type)); | |
d62a17ae | 779 | } |
3e5c6e00 | 780 | |
d62a17ae | 781 | /* If labeled-unicast route, uninstall transit LSP. */ |
782 | if (zebra_rib_labeled_unicast(old)) | |
783 | zebra_mpls_lsp_uninstall(zvrf, rn, old); | |
784 | ||
3cdba47a | 785 | rib_uninstall_kernel(rn, old); |
d62a17ae | 786 | |
787 | /* Update nexthop for route, reset changed flag. */ | |
ef57f35f DL |
788 | /* Note: this code also handles the Linux case when an interface goes |
789 | * down, causing the kernel to delete routes without sending DELROUTE | |
790 | * notifications | |
791 | */ | |
6883bf8d | 792 | if (RIB_KERNEL_ROUTE(old)) |
212df1de PG |
793 | SET_FLAG(old->status, ROUTE_ENTRY_REMOVED); |
794 | else | |
795 | UNSET_FLAG(old->status, ROUTE_ENTRY_CHANGED); | |
d62a17ae | 796 | } |
797 | ||
798 | static void rib_process_update_fib(struct zebra_vrf *zvrf, | |
799 | struct route_node *rn, | |
800 | struct route_entry *old, | |
801 | struct route_entry *new) | |
802 | { | |
d62a17ae | 803 | int nh_active = 0; |
d62a17ae | 804 | |
805 | /* | |
806 | * We have to install or update if a new route has been selected or | |
807 | * something has changed. | |
808 | */ | |
809 | if (new != old || CHECK_FLAG(new->status, ROUTE_ENTRY_CHANGED)) { | |
810 | hook_call(rib_update, rn, "updating existing route"); | |
811 | ||
812 | /* Update the nexthop; we could determine here that nexthop is | |
813 | * inactive. */ | |
0eb97b86 | 814 | if (nexthop_group_active_nexthop_num(new->nhe->nhg)) |
d62a17ae | 815 | nh_active = 1; |
816 | ||
817 | /* If nexthop is active, install the selected route, if | |
818 | * appropriate. If | |
819 | * the install succeeds, cleanup flags for prior route, if | |
820 | * different from | |
821 | * newly selected. | |
822 | */ | |
823 | if (nh_active) { | |
824 | if (IS_ZEBRA_DEBUG_RIB) { | |
825 | char buf[SRCDEST2STR_BUFFER]; | |
826 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
827 | if (new != old) | |
828 | zlog_debug( | |
2da33d6b | 829 | "%u:%s: Updating route rn %p, re %p (%s) old %p (%s)", |
d62a17ae | 830 | zvrf_id(zvrf), buf, rn, new, |
2da33d6b DS |
831 | zebra_route_string(new->type), |
832 | old, | |
833 | zebra_route_string(old->type)); | |
d62a17ae | 834 | else |
835 | zlog_debug( | |
2da33d6b | 836 | "%u:%s: Updating route rn %p, re %p (%s)", |
d62a17ae | 837 | zvrf_id(zvrf), buf, rn, new, |
2da33d6b | 838 | zebra_route_string(new->type)); |
d62a17ae | 839 | } |
840 | ||
841 | /* If labeled-unicast route, uninstall transit LSP. */ | |
842 | if (zebra_rib_labeled_unicast(old)) | |
843 | zebra_mpls_lsp_uninstall(zvrf, rn, old); | |
844 | ||
3cdba47a DS |
845 | /* |
846 | * Non-system route should be installed. | |
847 | * If labeled-unicast route, install transit | |
848 | * LSP. | |
849 | */ | |
850 | if (zebra_rib_labeled_unicast(new)) | |
851 | zebra_mpls_lsp_install(zvrf, rn, new); | |
d62a17ae | 852 | |
3cdba47a | 853 | rib_install_kernel(rn, new, old); |
d62a17ae | 854 | } |
a64448ba | 855 | |
d62a17ae | 856 | /* |
857 | * If nexthop for selected route is not active or install | |
858 | * failed, we | |
859 | * may need to uninstall and delete for redistribution. | |
860 | */ | |
ed216282 | 861 | if (!nh_active) { |
d62a17ae | 862 | if (IS_ZEBRA_DEBUG_RIB) { |
863 | char buf[SRCDEST2STR_BUFFER]; | |
864 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
865 | if (new != old) | |
866 | zlog_debug( | |
2da33d6b | 867 | "%u:%s: Deleting route rn %p, re %p (%s) old %p (%s) - nexthop inactive", |
d62a17ae | 868 | zvrf_id(zvrf), buf, rn, new, |
2da33d6b DS |
869 | zebra_route_string(new->type), |
870 | old, | |
871 | zebra_route_string(old->type)); | |
d62a17ae | 872 | else |
873 | zlog_debug( | |
2da33d6b | 874 | "%u:%s: Deleting route rn %p, re %p (%s) - nexthop inactive", |
d62a17ae | 875 | zvrf_id(zvrf), buf, rn, new, |
2da33d6b | 876 | zebra_route_string(new->type)); |
d62a17ae | 877 | } |
878 | ||
879 | /* If labeled-unicast route, uninstall transit LSP. */ | |
880 | if (zebra_rib_labeled_unicast(old)) | |
881 | zebra_mpls_lsp_uninstall(zvrf, rn, old); | |
882 | ||
3cdba47a | 883 | rib_uninstall_kernel(rn, old); |
d62a17ae | 884 | } |
885 | } else { | |
886 | /* | |
887 | * Same route selected; check if in the FIB and if not, | |
3cdba47a DS |
888 | * re-install. This is housekeeping code to deal with |
889 | * race conditions in kernel with linux netlink reporting | |
890 | * interface up before IPv4 or IPv6 protocol is ready | |
d62a17ae | 891 | * to add routes. |
892 | */ | |
3cdba47a DS |
893 | if (!CHECK_FLAG(new->status, ROUTE_ENTRY_INSTALLED) || |
894 | RIB_SYSTEM_ROUTE(new)) | |
677c1dd5 | 895 | rib_install_kernel(rn, new, NULL); |
d62a17ae | 896 | } |
897 | ||
898 | /* Update prior route. */ | |
6883bf8d | 899 | if (new != old) |
d62a17ae | 900 | UNSET_FLAG(old->status, ROUTE_ENTRY_CHANGED); |
3e5c6e00 | 901 | |
d62a17ae | 902 | /* Clear changed flag. */ |
903 | UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED); | |
3e5c6e00 | 904 | } |
905 | ||
d62a17ae | 906 | /* Check if 'alternate' RIB entry is better than 'current'. */ |
907 | static struct route_entry *rib_choose_best(struct route_entry *current, | |
908 | struct route_entry *alternate) | |
909 | { | |
910 | if (current == NULL) | |
911 | return alternate; | |
912 | ||
913 | /* filter route selection in following order: | |
914 | * - connected beats other types | |
fec4ca19 | 915 | * - if both connected, loopback or vrf wins |
d62a17ae | 916 | * - lower distance beats higher |
917 | * - lower metric beats higher for equal distance | |
918 | * - last, hence oldest, route wins tie break. | |
919 | */ | |
920 | ||
fec4ca19 DS |
921 | /* Connected routes. Check to see if either are a vrf |
922 | * or loopback interface. If not, pick the last connected | |
d62a17ae | 923 | * route of the set of lowest metric connected routes. |
924 | */ | |
925 | if (alternate->type == ZEBRA_ROUTE_CONNECT) { | |
fec4ca19 DS |
926 | if (current->type != ZEBRA_ROUTE_CONNECT) |
927 | return alternate; | |
928 | ||
929 | /* both are connected. are either loop or vrf? */ | |
930 | struct nexthop *nexthop = NULL; | |
931 | ||
0eb97b86 | 932 | for (ALL_NEXTHOPS_PTR(alternate->nhe->nhg, nexthop)) { |
873fde8c | 933 | struct interface *ifp = if_lookup_by_index( |
934 | nexthop->ifindex, alternate->vrf_id); | |
935 | ||
936 | if (ifp && if_is_loopback_or_vrf(ifp)) | |
fec4ca19 DS |
937 | return alternate; |
938 | } | |
939 | ||
0eb97b86 | 940 | for (ALL_NEXTHOPS_PTR(current->nhe->nhg, nexthop)) { |
873fde8c | 941 | struct interface *ifp = if_lookup_by_index( |
942 | nexthop->ifindex, current->vrf_id); | |
943 | ||
944 | if (ifp && if_is_loopback_or_vrf(ifp)) | |
fec4ca19 DS |
945 | return current; |
946 | } | |
947 | ||
948 | /* Neither are loop or vrf so pick best metric */ | |
949 | if (alternate->metric <= current->metric) | |
d62a17ae | 950 | return alternate; |
951 | ||
952 | return current; | |
953 | } | |
3e5c6e00 | 954 | |
d62a17ae | 955 | if (current->type == ZEBRA_ROUTE_CONNECT) |
956 | return current; | |
3e5c6e00 | 957 | |
d62a17ae | 958 | /* higher distance loses */ |
959 | if (alternate->distance < current->distance) | |
960 | return alternate; | |
961 | if (current->distance < alternate->distance) | |
962 | return current; | |
3e5c6e00 | 963 | |
d62a17ae | 964 | /* metric tie-breaks equal distance */ |
965 | if (alternate->metric <= current->metric) | |
966 | return alternate; | |
3e5c6e00 | 967 | |
d62a17ae | 968 | return current; |
3e5c6e00 | 969 | } |
970 | ||
e22e8001 SW |
971 | /* Core function for processing nexthop group contexts's off metaq */ |
972 | static void rib_nhg_process(struct nhg_ctx *ctx) | |
973 | { | |
974 | nhg_ctx_process(ctx); | |
975 | } | |
976 | ||
d62a17ae | 977 | /* Core function for processing routing information base. */ |
978 | static void rib_process(struct route_node *rn) | |
979 | { | |
980 | struct route_entry *re; | |
981 | struct route_entry *next; | |
982 | struct route_entry *old_selected = NULL; | |
983 | struct route_entry *new_selected = NULL; | |
984 | struct route_entry *old_fib = NULL; | |
985 | struct route_entry *new_fib = NULL; | |
986 | struct route_entry *best = NULL; | |
987 | char buf[SRCDEST2STR_BUFFER]; | |
988 | rib_dest_t *dest; | |
989 | struct zebra_vrf *zvrf = NULL; | |
86391e56 MS |
990 | const struct prefix *p, *src_p; |
991 | ||
d62a17ae | 992 | srcdest_rnode_prefixes(rn, &p, &src_p); |
993 | vrf_id_t vrf_id = VRF_UNKNOWN; | |
994 | ||
995 | assert(rn); | |
996 | ||
997 | dest = rib_dest_from_rnode(rn); | |
998 | if (dest) { | |
999 | zvrf = rib_dest_vrf(dest); | |
1000 | vrf_id = zvrf_id(zvrf); | |
1001 | } | |
bab85d4f | 1002 | |
d62a17ae | 1003 | if (IS_ZEBRA_DEBUG_RIB) |
1004 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
bab85d4f | 1005 | |
d62a17ae | 1006 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) |
1007 | zlog_debug("%u:%s: Processing rn %p", vrf_id, buf, rn); | |
bab85d4f | 1008 | |
607425e5 DS |
1009 | /* |
1010 | * we can have rn's that have a NULL info pointer | |
1011 | * (dest). As such let's not let the deref happen | |
1012 | * additionally we know RNODE_FOREACH_RE_SAFE | |
1013 | * will not iterate so we are ok. | |
1014 | */ | |
1015 | if (dest) | |
1016 | old_fib = dest->selected_fib; | |
5f7a4718 | 1017 | |
a2addae8 | 1018 | RNODE_FOREACH_RE_SAFE (rn, re, next) { |
d62a17ae | 1019 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) |
1020 | zlog_debug( | |
2da33d6b DS |
1021 | "%u:%s: Examine re %p (%s) status %x flags %x dist %d metric %d", |
1022 | vrf_id, buf, re, zebra_route_string(re->type), | |
1023 | re->status, re->flags, re->distance, | |
1024 | re->metric); | |
d62a17ae | 1025 | |
d62a17ae | 1026 | /* Currently selected re. */ |
1027 | if (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED)) { | |
1028 | assert(old_selected == NULL); | |
1029 | old_selected = re; | |
1030 | } | |
bab85d4f | 1031 | |
d62a17ae | 1032 | /* Skip deleted entries from selection */ |
1033 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) | |
1034 | continue; | |
1035 | ||
1036 | /* Skip unreachable nexthop. */ | |
1037 | /* This first call to nexthop_active_update is merely to | |
6883bf8d DS |
1038 | * determine if there's any change to nexthops associated |
1039 | * with this RIB entry. Now, rib_process() can be invoked due | |
1040 | * to an external event such as link down or due to | |
1041 | * next-hop-tracking evaluation. In the latter case, | |
d62a17ae | 1042 | * a decision has already been made that the NHs have changed. |
6883bf8d DS |
1043 | * So, no need to invoke a potentially expensive call again. |
1044 | * Further, since the change might be in a recursive NH which | |
1045 | * is not caught in the nexthop_active_update() code. Thus, we | |
1046 | * might miss changes to recursive NHs. | |
d62a17ae | 1047 | */ |
6883bf8d | 1048 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_CHANGED) |
99eabcec | 1049 | && !nexthop_active_update(rn, re)) { |
d62a17ae | 1050 | if (re->type == ZEBRA_ROUTE_TABLE) { |
1051 | /* XXX: HERE BE DRAGONS!!!!! | |
1052 | * In all honesty, I have not yet figured out | |
6883bf8d DS |
1053 | * what this part does or why the |
1054 | * ROUTE_ENTRY_CHANGED test above is correct | |
d62a17ae | 1055 | * or why we need to delete a route here, and |
6883bf8d DS |
1056 | * also not whether this concerns both selected |
1057 | * and fib route, or only selected | |
1058 | * or only fib | |
1059 | * | |
1060 | * This entry was denied by the 'ip protocol | |
1061 | * table' route-map, we need to delete it */ | |
d62a17ae | 1062 | if (re != old_selected) { |
1063 | if (IS_ZEBRA_DEBUG_RIB) | |
1064 | zlog_debug( | |
32391aff | 1065 | "%s: %u:%s: imported via import-table but denied " |
d62a17ae | 1066 | "by the ip protocol table route-map", |
32391aff | 1067 | __func__, vrf_id, buf); |
d62a17ae | 1068 | rib_unlink(rn, re); |
1069 | } else | |
1070 | SET_FLAG(re->status, | |
1071 | ROUTE_ENTRY_REMOVED); | |
1072 | } | |
1073 | ||
1074 | continue; | |
1075 | } | |
bab85d4f | 1076 | |
d62a17ae | 1077 | /* Infinite distance. */ |
1078 | if (re->distance == DISTANCE_INFINITY) { | |
1079 | UNSET_FLAG(re->status, ROUTE_ENTRY_CHANGED); | |
1080 | continue; | |
1081 | } | |
bab85d4f | 1082 | |
d62a17ae | 1083 | if (CHECK_FLAG(re->flags, ZEBRA_FLAG_FIB_OVERRIDE)) { |
1084 | best = rib_choose_best(new_fib, re); | |
1085 | if (new_fib && best != new_fib) | |
1086 | UNSET_FLAG(new_fib->status, | |
1087 | ROUTE_ENTRY_CHANGED); | |
1088 | new_fib = best; | |
1089 | } else { | |
1090 | best = rib_choose_best(new_selected, re); | |
1091 | if (new_selected && best != new_selected) | |
1092 | UNSET_FLAG(new_selected->status, | |
1093 | ROUTE_ENTRY_CHANGED); | |
1094 | new_selected = best; | |
1095 | } | |
1096 | if (best != re) | |
1097 | UNSET_FLAG(re->status, ROUTE_ENTRY_CHANGED); | |
1098 | } /* RNODE_FOREACH_RE */ | |
1099 | ||
1100 | /* If no FIB override route, use the selected route also for FIB */ | |
1101 | if (new_fib == NULL) | |
1102 | new_fib = new_selected; | |
1103 | ||
1104 | /* After the cycle is finished, the following pointers will be set: | |
1105 | * old_selected --- RE entry currently having SELECTED | |
1106 | * new_selected --- RE entry that is newly SELECTED | |
1107 | * old_fib --- RE entry currently in kernel FIB | |
1108 | * new_fib --- RE entry that is newly to be in kernel FIB | |
1109 | * | |
1110 | * new_selected will get SELECTED flag, and is going to be redistributed | |
1111 | * the zclients. new_fib (which can be new_selected) will be installed | |
1112 | * in kernel. | |
1113 | */ | |
1114 | ||
1115 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) { | |
1116 | zlog_debug( | |
1117 | "%u:%s: After processing: old_selected %p new_selected %p old_fib %p new_fib %p", | |
1118 | vrf_id, buf, (void *)old_selected, (void *)new_selected, | |
1119 | (void *)old_fib, (void *)new_fib); | |
1120 | } | |
446bb95e | 1121 | |
d62a17ae | 1122 | /* Buffer ROUTE_ENTRY_CHANGED here, because it will get cleared if |
1123 | * fib == selected */ | |
9d303b37 DL |
1124 | bool selected_changed = new_selected && CHECK_FLAG(new_selected->status, |
1125 | ROUTE_ENTRY_CHANGED); | |
d62a17ae | 1126 | |
1127 | /* Update fib according to selection results */ | |
1128 | if (new_fib && old_fib) | |
1129 | rib_process_update_fib(zvrf, rn, old_fib, new_fib); | |
1130 | else if (new_fib) | |
1131 | rib_process_add_fib(zvrf, rn, new_fib); | |
1132 | else if (old_fib) | |
1133 | rib_process_del_fib(zvrf, rn, old_fib); | |
1134 | ||
8cb41cd6 | 1135 | /* Update SELECTED entry */ |
d62a17ae | 1136 | if (old_selected != new_selected || selected_changed) { |
93bdadae | 1137 | |
6883bf8d | 1138 | if (new_selected && new_selected != new_fib) |
d62a17ae | 1139 | UNSET_FLAG(new_selected->status, ROUTE_ENTRY_CHANGED); |
41ec9222 | 1140 | |
3cdba47a | 1141 | if (new_selected) |
5af4b346 MS |
1142 | SET_FLAG(new_selected->flags, ZEBRA_FLAG_SELECTED); |
1143 | ||
d62a17ae | 1144 | if (old_selected) { |
40f321c0 MS |
1145 | /* |
1146 | * If we're removing the old entry, we should tell | |
1147 | * redist subscribers about that *if* they aren't | |
1148 | * going to see a redist for the new entry. | |
1149 | */ | |
1150 | if (!new_selected || CHECK_FLAG(old_selected->status, | |
1151 | ROUTE_ENTRY_REMOVED)) | |
1152 | redistribute_delete(p, src_p, | |
1153 | old_selected, | |
1154 | new_selected); | |
1155 | ||
d62a17ae | 1156 | if (old_selected != new_selected) |
1157 | UNSET_FLAG(old_selected->flags, | |
1158 | ZEBRA_FLAG_SELECTED); | |
f857321e | 1159 | } |
d62a17ae | 1160 | } |
3e5c6e00 | 1161 | |
d62a17ae | 1162 | /* Remove all RE entries queued for removal */ |
a2addae8 | 1163 | RNODE_FOREACH_RE_SAFE (rn, re, next) { |
d62a17ae | 1164 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) { |
1165 | if (IS_ZEBRA_DEBUG_RIB) { | |
1166 | rnode_debug(rn, vrf_id, "rn %p, removing re %p", | |
1167 | (void *)rn, (void *)re); | |
1168 | } | |
1169 | rib_unlink(rn, re); | |
1170 | } | |
1171 | } | |
4d38fdb4 | 1172 | |
d62a17ae | 1173 | /* |
1174 | * Check if the dest can be deleted now. | |
1175 | */ | |
1176 | rib_gc_dest(rn); | |
e96f9203 DO |
1177 | } |
1178 | ||
a1494c25 DS |
1179 | static void zebra_rib_evaluate_mpls(struct route_node *rn) |
1180 | { | |
1181 | rib_dest_t *dest = rib_dest_from_rnode(rn); | |
1182 | struct zebra_vrf *zvrf = vrf_info_lookup(VRF_DEFAULT); | |
1183 | ||
1184 | if (!dest) | |
1185 | return; | |
1186 | ||
1187 | if (CHECK_FLAG(dest->flags, RIB_DEST_UPDATE_LSPS)) { | |
1188 | if (IS_ZEBRA_DEBUG_MPLS) | |
1189 | zlog_debug( | |
1190 | "%u: Scheduling all LSPs upon RIB completion", | |
1191 | zvrf_id(zvrf)); | |
1192 | zebra_mpls_lsp_schedule(zvrf); | |
1193 | mpls_unmark_lsps_for_processing(rn); | |
1194 | } | |
1195 | } | |
1196 | ||
e5ac2adf MS |
1197 | /* |
1198 | * Utility to match route with dplane context data | |
1199 | */ | |
1200 | static bool rib_route_match_ctx(const struct route_entry *re, | |
25779064 MS |
1201 | const struct zebra_dplane_ctx *ctx, |
1202 | bool is_update) | |
e5ac2adf MS |
1203 | { |
1204 | bool result = false; | |
1205 | ||
1206 | if (is_update) { | |
1207 | /* | |
1208 | * In 'update' case, we test info about the 'previous' or | |
1209 | * 'old' route | |
1210 | */ | |
1211 | if ((re->type == dplane_ctx_get_old_type(ctx)) && | |
1212 | (re->instance == dplane_ctx_get_old_instance(ctx))) { | |
1213 | result = true; | |
1214 | ||
1215 | /* TODO -- we're using this extra test, but it's not | |
1216 | * exactly clear why. | |
1217 | */ | |
1218 | if (re->type == ZEBRA_ROUTE_STATIC && | |
1219 | (re->distance != dplane_ctx_get_old_distance(ctx) || | |
1220 | re->tag != dplane_ctx_get_old_tag(ctx))) { | |
1221 | result = false; | |
1222 | } | |
1223 | } | |
1224 | ||
1225 | } else { | |
1226 | /* | |
1227 | * Ordinary, single-route case using primary context info | |
1228 | */ | |
1229 | if ((dplane_ctx_get_op(ctx) != DPLANE_OP_ROUTE_DELETE) && | |
1230 | CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) { | |
1231 | /* Skip route that's been deleted */ | |
1232 | goto done; | |
1233 | } | |
1234 | ||
1235 | if ((re->type == dplane_ctx_get_type(ctx)) && | |
1236 | (re->instance == dplane_ctx_get_instance(ctx))) { | |
1237 | result = true; | |
1238 | ||
1239 | /* TODO -- we're using this extra test, but it's not | |
1240 | * exactly clear why. | |
1241 | */ | |
1242 | if (re->type == ZEBRA_ROUTE_STATIC && | |
1243 | (re->distance != dplane_ctx_get_distance(ctx) || | |
1244 | re->tag != dplane_ctx_get_tag(ctx))) { | |
1245 | result = false; | |
1246 | } | |
1247 | } | |
1248 | } | |
1249 | ||
1250 | done: | |
1251 | ||
1252 | return (result); | |
1253 | } | |
1254 | ||
3cdba47a DS |
1255 | static void zebra_rib_fixup_system(struct route_node *rn) |
1256 | { | |
1257 | struct route_entry *re; | |
1258 | ||
1259 | RNODE_FOREACH_RE(rn, re) { | |
1260 | struct nexthop *nhop; | |
1261 | ||
1262 | if (!RIB_SYSTEM_ROUTE(re)) | |
1263 | continue; | |
1264 | ||
1265 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) | |
1266 | continue; | |
1267 | ||
1268 | SET_FLAG(re->status, ROUTE_ENTRY_INSTALLED); | |
6d0ee6a0 | 1269 | UNSET_FLAG(re->status, ROUTE_ENTRY_QUEUED); |
3cdba47a | 1270 | |
0eb97b86 | 1271 | for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nhop)) { |
3cdba47a DS |
1272 | if (CHECK_FLAG(nhop->flags, NEXTHOP_FLAG_RECURSIVE)) |
1273 | continue; | |
1274 | ||
1275 | SET_FLAG(nhop->flags, NEXTHOP_FLAG_FIB); | |
1276 | } | |
1277 | } | |
1278 | } | |
1279 | ||
e5ac2adf | 1280 | /* |
78bf56b0 MS |
1281 | * Update a route from a dplane context. This consolidates common code |
1282 | * that can be used in processing of results from FIB updates, and in | |
1283 | * async notification processing. | |
efe6c026 | 1284 | * The return is 'true' if the installed nexthops changed; 'false' otherwise. |
e5ac2adf | 1285 | */ |
efe6c026 MS |
1286 | static bool rib_update_re_from_ctx(struct route_entry *re, |
1287 | struct route_node *rn, | |
1288 | struct zebra_dplane_ctx *ctx) | |
78bf56b0 | 1289 | { |
941e261c | 1290 | char dest_str[PREFIX_STRLEN] = ""; |
efe6c026 | 1291 | char nh_str[NEXTHOP_STRLEN]; |
78bf56b0 | 1292 | struct nexthop *nexthop, *ctx_nexthop; |
941e261c MS |
1293 | bool matched; |
1294 | const struct nexthop_group *ctxnhg; | |
efe6c026 MS |
1295 | bool is_selected = false; /* Is 're' currently the selected re? */ |
1296 | bool changed_p = false; /* Change to nexthops? */ | |
1297 | rib_dest_t *dest; | |
78bf56b0 | 1298 | |
941e261c MS |
1299 | /* Note well: only capturing the prefix string if debug is enabled here; |
1300 | * unconditional log messages will have to generate the string. | |
1301 | */ | |
1302 | if (IS_ZEBRA_DEBUG_RIB) | |
1303 | prefix2str(&(rn->p), dest_str, sizeof(dest_str)); | |
78bf56b0 | 1304 | |
efe6c026 MS |
1305 | dest = rib_dest_from_rnode(rn); |
1306 | if (dest) | |
1307 | is_selected = (re == dest->selected_fib); | |
1308 | ||
1309 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) | |
1310 | zlog_debug("update_from_ctx: %u:%s: %sSELECTED", | |
1311 | re->vrf_id, dest_str, (is_selected ? "" : "NOT ")); | |
1312 | ||
1313 | /* Update zebra's nexthop FIB flag for each nexthop that was installed. | |
941e261c | 1314 | * If the installed set differs from the set requested by the rib/owner, |
efe6c026 MS |
1315 | * we use the fib-specific nexthop-group to record the actual FIB |
1316 | * status. | |
78bf56b0 | 1317 | */ |
941e261c | 1318 | |
986a6617 SW |
1319 | /* Check both fib group and notif group for equivalence. |
1320 | * | |
1321 | * Let's assume the nexthops are ordered here to save time. | |
941e261c | 1322 | */ |
986a6617 SW |
1323 | if (nexthop_group_equal(&re->fib_ng, dplane_ctx_get_ng(ctx)) == false) { |
1324 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) { | |
1325 | zlog_debug( | |
1326 | "%u:%s update_from_ctx: notif nh and fib nh mismatch", | |
1327 | re->vrf_id, dest_str); | |
941e261c MS |
1328 | } |
1329 | ||
986a6617 SW |
1330 | matched = false; |
1331 | } else | |
1332 | matched = true; | |
941e261c MS |
1333 | |
1334 | /* If the new FIB set matches the existing FIB set, we're done. */ | |
1335 | if (matched) { | |
1336 | if (IS_ZEBRA_DEBUG_RIB) | |
1337 | zlog_debug("%u:%s update_from_ctx(): existing fib nhg, no change", | |
1338 | re->vrf_id, dest_str); | |
1339 | goto done; | |
1340 | ||
1341 | } else if (re->fib_ng.nexthop) { | |
1342 | /* | |
1343 | * Free stale fib list and move on to check the rib nhg. | |
1344 | */ | |
1345 | if (IS_ZEBRA_DEBUG_RIB) | |
1346 | zlog_debug("%u:%s update_from_ctx(): replacing fib nhg", | |
1347 | re->vrf_id, dest_str); | |
1348 | nexthops_free(re->fib_ng.nexthop); | |
1349 | re->fib_ng.nexthop = NULL; | |
efe6c026 MS |
1350 | |
1351 | /* Note that the installed nexthops have changed */ | |
1352 | changed_p = true; | |
941e261c MS |
1353 | } else { |
1354 | if (IS_ZEBRA_DEBUG_RIB) | |
1355 | zlog_debug("%u:%s update_from_ctx(): no fib nhg", | |
1356 | re->vrf_id, dest_str); | |
1357 | } | |
1358 | ||
1359 | /* | |
1360 | * Compare with the rib nexthop group. The comparison here is different: | |
1361 | * the RIB group may be a superset of the list installed in the FIB. We | |
1362 | * walk the RIB group, looking for the 'installable' candidate | |
1363 | * nexthops, and then check those against the set | |
1364 | * that is actually installed. | |
986a6617 SW |
1365 | * |
1366 | * Assume nexthops are ordered here as well. | |
941e261c MS |
1367 | */ |
1368 | matched = true; | |
986a6617 SW |
1369 | |
1370 | ctx_nexthop = dplane_ctx_get_ng(ctx)->nexthop; | |
1371 | ||
1f6a5aca MS |
1372 | /* Nothing installed - we can skip some of the checking/comparison |
1373 | * of nexthops. | |
1374 | */ | |
1375 | if (ctx_nexthop == NULL) { | |
1376 | changed_p = true; | |
1377 | goto no_nexthops; | |
1378 | } | |
1379 | ||
986a6617 SW |
1380 | /* Get the first `installed` one to check against. |
1381 | * If the dataplane doesn't set these to be what was actually installed, | |
0eb97b86 | 1382 | * it will just be whatever was in re->nhe->nhg? |
986a6617 SW |
1383 | */ |
1384 | if (CHECK_FLAG(ctx_nexthop->flags, NEXTHOP_FLAG_RECURSIVE) | |
1385 | || !CHECK_FLAG(ctx_nexthop->flags, NEXTHOP_FLAG_ACTIVE)) | |
1386 | ctx_nexthop = nexthop_next_active_resolved(ctx_nexthop); | |
1387 | ||
0eb97b86 | 1388 | for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop)) { |
78bf56b0 | 1389 | |
5695d9ac | 1390 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_RECURSIVE)) |
78bf56b0 MS |
1391 | continue; |
1392 | ||
941e261c MS |
1393 | if (!CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE)) |
1394 | continue; | |
5695d9ac | 1395 | |
941e261c | 1396 | /* Check for a FIB nexthop corresponding to the RIB nexthop */ |
986a6617 SW |
1397 | if (nexthop_same(ctx_nexthop, nexthop) == false) { |
1398 | /* If the FIB doesn't know about the nexthop, | |
1399 | * it's not installed | |
1400 | */ | |
efe6c026 MS |
1401 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) { |
1402 | nexthop2str(nexthop, nh_str, sizeof(nh_str)); | |
986a6617 SW |
1403 | zlog_debug( |
1404 | "update_from_ctx: no notif match for rib nh %s", | |
1405 | nh_str); | |
efe6c026 | 1406 | } |
941e261c | 1407 | matched = false; |
efe6c026 MS |
1408 | |
1409 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) | |
1410 | changed_p = true; | |
1411 | ||
1412 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); | |
11260e70 MS |
1413 | |
1414 | /* Keep checking nexthops */ | |
1415 | continue; | |
5695d9ac | 1416 | } |
78bf56b0 | 1417 | |
efe6c026 MS |
1418 | if (CHECK_FLAG(ctx_nexthop->flags, NEXTHOP_FLAG_FIB)) { |
1419 | if (!CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) | |
1420 | changed_p = true; | |
1421 | ||
5695d9ac | 1422 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); |
efe6c026 MS |
1423 | } else { |
1424 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) | |
1425 | changed_p = true; | |
1426 | ||
5695d9ac | 1427 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); |
efe6c026 | 1428 | } |
986a6617 SW |
1429 | |
1430 | ctx_nexthop = nexthop_next_active_resolved(ctx_nexthop); | |
78bf56b0 MS |
1431 | } |
1432 | ||
941e261c MS |
1433 | /* If all nexthops were processed, we're done */ |
1434 | if (matched) { | |
1435 | if (IS_ZEBRA_DEBUG_RIB) | |
efe6c026 MS |
1436 | zlog_debug("%u:%s update_from_ctx(): rib nhg matched, changed '%s'", |
1437 | re->vrf_id, dest_str, | |
1438 | (changed_p ? "true" : "false")); | |
941e261c MS |
1439 | goto done; |
1440 | } | |
78bf56b0 | 1441 | |
1f6a5aca MS |
1442 | no_nexthops: |
1443 | ||
941e261c MS |
1444 | /* FIB nexthop set differs from the RIB set: |
1445 | * create a fib-specific nexthop-group | |
1446 | */ | |
1447 | if (IS_ZEBRA_DEBUG_RIB) | |
efe6c026 MS |
1448 | zlog_debug("%u:%s update_from_ctx(): changed %s, adding new fib nhg", |
1449 | re->vrf_id, dest_str, | |
1450 | (changed_p ? "true" : "false")); | |
941e261c MS |
1451 | |
1452 | ctxnhg = dplane_ctx_get_ng(ctx); | |
188a00e0 MS |
1453 | |
1454 | if (ctxnhg->nexthop) | |
1455 | copy_nexthops(&(re->fib_ng.nexthop), ctxnhg->nexthop, NULL); | |
1456 | else { | |
1457 | /* Bit of a special case when the fib has _no_ installed | |
1458 | * nexthops. | |
1459 | */ | |
1460 | nexthop = nexthop_new(); | |
1461 | nexthop->type = NEXTHOP_TYPE_IPV4; | |
50d89650 | 1462 | _nexthop_add(&(re->fib_ng.nexthop), nexthop); |
188a00e0 | 1463 | } |
941e261c MS |
1464 | |
1465 | done: | |
efe6c026 | 1466 | return changed_p; |
78bf56b0 MS |
1467 | } |
1468 | ||
e5ac2adf | 1469 | /* |
fad4d69c MS |
1470 | * Helper to locate a zebra route-node from a dplane context. This is used |
1471 | * when processing dplane results, e.g. Note well: the route-node is returned | |
1472 | * with a ref held - route_unlock_node() must be called eventually. | |
e5ac2adf | 1473 | */ |
fad4d69c MS |
1474 | static struct route_node * |
1475 | rib_find_rn_from_ctx(const struct zebra_dplane_ctx *ctx) | |
e5ac2adf MS |
1476 | { |
1477 | struct route_table *table = NULL; | |
1478 | struct route_node *rn = NULL; | |
e5ac2adf MS |
1479 | const struct prefix *dest_pfx, *src_pfx; |
1480 | ||
1481 | /* Locate rn and re(s) from ctx */ | |
1482 | ||
c7c0b007 SW |
1483 | table = zebra_vrf_lookup_table_with_table_id( |
1484 | dplane_ctx_get_afi(ctx), dplane_ctx_get_safi(ctx), | |
1485 | dplane_ctx_get_vrf(ctx), dplane_ctx_get_table(ctx)); | |
e5ac2adf MS |
1486 | if (table == NULL) { |
1487 | if (IS_ZEBRA_DEBUG_DPLANE) { | |
fad4d69c | 1488 | zlog_debug("Failed to find route for ctx: no table for afi %d, safi %d, vrf %u", |
e5ac2adf MS |
1489 | dplane_ctx_get_afi(ctx), |
1490 | dplane_ctx_get_safi(ctx), | |
1491 | dplane_ctx_get_vrf(ctx)); | |
1492 | } | |
1493 | goto done; | |
1494 | } | |
1495 | ||
fad4d69c MS |
1496 | dest_pfx = dplane_ctx_get_dest(ctx); |
1497 | src_pfx = dplane_ctx_get_src(ctx); | |
1498 | ||
1499 | rn = srcdest_rnode_get(table, dest_pfx, | |
1500 | src_pfx ? (struct prefix_ipv6 *)src_pfx : NULL); | |
1501 | ||
1502 | done: | |
1503 | return rn; | |
1504 | } | |
1505 | ||
1506 | ||
97f5b441 | 1507 | |
fad4d69c MS |
1508 | /* |
1509 | * Route-update results processing after async dataplane update. | |
1510 | */ | |
1511 | static void rib_process_result(struct zebra_dplane_ctx *ctx) | |
1512 | { | |
1513 | struct zebra_vrf *zvrf = NULL; | |
1514 | struct route_node *rn = NULL; | |
1515 | struct route_entry *re = NULL, *old_re = NULL, *rib; | |
1516 | bool is_update = false; | |
1517 | char dest_str[PREFIX_STRLEN] = ""; | |
1518 | enum dplane_op_e op; | |
1519 | enum zebra_dplane_result status; | |
1520 | const struct prefix *dest_pfx, *src_pfx; | |
1521 | uint32_t seq; | |
efe6c026 | 1522 | bool fib_changed = false; |
97f5b441 | 1523 | |
fad4d69c | 1524 | zvrf = vrf_info_lookup(dplane_ctx_get_vrf(ctx)); |
e5ac2adf MS |
1525 | dest_pfx = dplane_ctx_get_dest(ctx); |
1526 | ||
1527 | /* Note well: only capturing the prefix string if debug is enabled here; | |
1528 | * unconditional log messages will have to generate the string. | |
1529 | */ | |
5709131c | 1530 | if (IS_ZEBRA_DEBUG_DPLANE) |
e5ac2adf | 1531 | prefix2str(dest_pfx, dest_str, sizeof(dest_str)); |
e5ac2adf | 1532 | |
fad4d69c MS |
1533 | /* Locate rn and re(s) from ctx */ |
1534 | rn = rib_find_rn_from_ctx(ctx); | |
e5ac2adf MS |
1535 | if (rn == NULL) { |
1536 | if (IS_ZEBRA_DEBUG_DPLANE) { | |
fe2c53d4 | 1537 | zlog_debug("Failed to process dplane results: no route for %u:%s", |
e5ac2adf MS |
1538 | dplane_ctx_get_vrf(ctx), dest_str); |
1539 | } | |
1540 | goto done; | |
1541 | } | |
1542 | ||
1543 | srcdest_rnode_prefixes(rn, &dest_pfx, &src_pfx); | |
1544 | ||
1545 | op = dplane_ctx_get_op(ctx); | |
1546 | status = dplane_ctx_get_status(ctx); | |
1547 | ||
c831033f | 1548 | if (IS_ZEBRA_DEBUG_DPLANE_DETAIL) |
f183e380 | 1549 | zlog_debug("%u:%s Processing dplane ctx %p, op %s result %s", |
e5ac2adf | 1550 | dplane_ctx_get_vrf(ctx), dest_str, ctx, |
f183e380 | 1551 | dplane_op2str(op), dplane_res2str(status)); |
e5ac2adf | 1552 | |
e5ac2adf MS |
1553 | /* |
1554 | * Update is a bit of a special case, where we may have both old and new | |
1555 | * routes to post-process. | |
1556 | */ | |
1557 | is_update = dplane_ctx_is_update(ctx); | |
1558 | ||
1559 | /* | |
1560 | * Take a pass through the routes, look for matches with the context | |
1561 | * info. | |
1562 | */ | |
1563 | RNODE_FOREACH_RE(rn, rib) { | |
1564 | ||
1565 | if (re == NULL) { | |
5709131c | 1566 | if (rib_route_match_ctx(rib, ctx, false)) |
e5ac2adf | 1567 | re = rib; |
e5ac2adf MS |
1568 | } |
1569 | ||
1570 | /* Check for old route match */ | |
1571 | if (is_update && (old_re == NULL)) { | |
5709131c | 1572 | if (rib_route_match_ctx(rib, ctx, true /*is_update*/)) |
e5ac2adf | 1573 | old_re = rib; |
e5ac2adf MS |
1574 | } |
1575 | ||
1576 | /* Have we found the routes we need to work on? */ | |
5709131c | 1577 | if (re && ((!is_update || old_re))) |
e5ac2adf | 1578 | break; |
e5ac2adf MS |
1579 | } |
1580 | ||
699dae23 DS |
1581 | seq = dplane_ctx_get_seq(ctx); |
1582 | ||
e5ac2adf MS |
1583 | /* |
1584 | * Check sequence number(s) to detect stale results before continuing | |
1585 | */ | |
60f98b23 | 1586 | if (re) { |
699dae23 | 1587 | if (re->dplane_sequence != seq) { |
60f98b23 DS |
1588 | if (IS_ZEBRA_DEBUG_DPLANE_DETAIL) |
1589 | zlog_debug("%u:%s Stale dplane result for re %p", | |
1590 | dplane_ctx_get_vrf(ctx), | |
1591 | dest_str, re); | |
1592 | } else | |
1593 | UNSET_FLAG(re->status, ROUTE_ENTRY_QUEUED); | |
e5ac2adf MS |
1594 | } |
1595 | ||
60f98b23 DS |
1596 | if (old_re) { |
1597 | if (old_re->dplane_sequence != dplane_ctx_get_old_seq(ctx)) { | |
1598 | if (IS_ZEBRA_DEBUG_DPLANE_DETAIL) | |
1599 | zlog_debug("%u:%s Stale dplane result for old_re %p", | |
1600 | dplane_ctx_get_vrf(ctx), | |
1601 | dest_str, old_re); | |
1602 | } else | |
9ef0c6ba | 1603 | UNSET_FLAG(old_re->status, ROUTE_ENTRY_QUEUED); |
e5ac2adf MS |
1604 | } |
1605 | ||
12e7fe3a | 1606 | switch (op) { |
12e7fe3a DS |
1607 | case DPLANE_OP_ROUTE_INSTALL: |
1608 | case DPLANE_OP_ROUTE_UPDATE: | |
1609 | if (status == ZEBRA_DPLANE_REQUEST_SUCCESS) { | |
677c1dd5 DS |
1610 | if (re) { |
1611 | UNSET_FLAG(re->status, ROUTE_ENTRY_FAILED); | |
1612 | SET_FLAG(re->status, ROUTE_ENTRY_INSTALLED); | |
1613 | } | |
b9f0e5ee DS |
1614 | /* |
1615 | * On an update operation from the same route type | |
1616 | * context retrieval currently has no way to know | |
1617 | * which was the old and which was the new. | |
1618 | * So don't unset our flags that we just set. | |
1619 | * We know redistribution is ok because the | |
1620 | * old_re in this case is used for nothing | |
1621 | * more than knowing whom to contact if necessary. | |
1622 | */ | |
1623 | if (old_re && old_re != re) { | |
677c1dd5 DS |
1624 | UNSET_FLAG(old_re->status, ROUTE_ENTRY_FAILED); |
1625 | UNSET_FLAG(old_re->status, | |
1626 | ROUTE_ENTRY_INSTALLED); | |
1627 | } | |
f183e380 | 1628 | |
78bf56b0 | 1629 | /* Update zebra route based on the results in |
941e261c | 1630 | * the context struct. |
78bf56b0 | 1631 | */ |
941e261c | 1632 | if (re) { |
efe6c026 MS |
1633 | fib_changed = |
1634 | rib_update_re_from_ctx(re, rn, ctx); | |
1635 | ||
1636 | if (!fib_changed) { | |
1637 | if (IS_ZEBRA_DEBUG_DPLANE_DETAIL) | |
1638 | zlog_debug("%u:%s no fib change for re", | |
1639 | dplane_ctx_get_vrf( | |
1640 | ctx), | |
1641 | dest_str); | |
12e7fe3a DS |
1642 | } |
1643 | ||
941e261c MS |
1644 | /* Redistribute */ |
1645 | redistribute_update(dest_pfx, src_pfx, | |
228a811a | 1646 | re, old_re); |
f183e380 MS |
1647 | } |
1648 | ||
3cdba47a DS |
1649 | /* |
1650 | * System routes are weird in that they | |
1651 | * allow multiple to be installed that match | |
1652 | * to the same prefix, so after we get the | |
1653 | * result we need to clean them up so that | |
1654 | * we can actually use them. | |
1655 | */ | |
1656 | if ((re && RIB_SYSTEM_ROUTE(re)) || | |
1657 | (old_re && RIB_SYSTEM_ROUTE(old_re))) | |
1658 | zebra_rib_fixup_system(rn); | |
1659 | ||
f4c6e2a8 | 1660 | if (zvrf) |
12e7fe3a | 1661 | zvrf->installs++; |
f183e380 | 1662 | |
12e7fe3a | 1663 | /* Notify route owner */ |
677c1dd5 | 1664 | zsend_route_notify_owner_ctx(ctx, ZAPI_ROUTE_INSTALLED); |
e5ac2adf | 1665 | |
12e7fe3a | 1666 | } else { |
7a230a9d | 1667 | if (re) { |
677c1dd5 | 1668 | SET_FLAG(re->status, ROUTE_ENTRY_FAILED); |
7a230a9d DS |
1669 | UNSET_FLAG(re->status, ROUTE_ENTRY_INSTALLED); |
1670 | } if (old_re) | |
677c1dd5 DS |
1671 | SET_FLAG(old_re->status, ROUTE_ENTRY_FAILED); |
1672 | if (re) | |
1673 | zsend_route_notify_owner(re, dest_pfx, | |
1674 | ZAPI_ROUTE_FAIL_INSTALL); | |
97f5b441 | 1675 | |
12e7fe3a DS |
1676 | zlog_warn("%u:%s: Route install failed", |
1677 | dplane_ctx_get_vrf(ctx), | |
1678 | prefix2str(dest_pfx, | |
1679 | dest_str, sizeof(dest_str))); | |
1680 | } | |
1681 | break; | |
1682 | case DPLANE_OP_ROUTE_DELETE: | |
677c1dd5 DS |
1683 | if (re) |
1684 | SET_FLAG(re->status, ROUTE_ENTRY_FAILED); | |
12e7fe3a DS |
1685 | /* |
1686 | * In the delete case, the zebra core datastructs were | |
1687 | * updated (or removed) at the time the delete was issued, | |
1688 | * so we're just notifying the route owner. | |
e5ac2adf | 1689 | */ |
12e7fe3a | 1690 | if (status == ZEBRA_DPLANE_REQUEST_SUCCESS) { |
677c1dd5 DS |
1691 | if (re) { |
1692 | UNSET_FLAG(re->status, ROUTE_ENTRY_INSTALLED); | |
1693 | UNSET_FLAG(re->status, ROUTE_ENTRY_FAILED); | |
1694 | } | |
12e7fe3a | 1695 | zsend_route_notify_owner_ctx(ctx, ZAPI_ROUTE_REMOVED); |
e5ac2adf | 1696 | |
12e7fe3a DS |
1697 | if (zvrf) |
1698 | zvrf->removals++; | |
1699 | } else { | |
677c1dd5 DS |
1700 | if (re) |
1701 | SET_FLAG(re->status, ROUTE_ENTRY_FAILED); | |
12e7fe3a DS |
1702 | zsend_route_notify_owner_ctx(ctx, |
1703 | ZAPI_ROUTE_REMOVE_FAIL); | |
e5ac2adf | 1704 | |
12e7fe3a DS |
1705 | zlog_warn("%u:%s: Route Deletion failure", |
1706 | dplane_ctx_get_vrf(ctx), | |
1707 | prefix2str(dest_pfx, | |
1708 | dest_str, sizeof(dest_str))); | |
1709 | } | |
3cdba47a DS |
1710 | |
1711 | /* | |
1712 | * System routes are weird in that they | |
1713 | * allow multiple to be installed that match | |
1714 | * to the same prefix, so after we get the | |
1715 | * result we need to clean them up so that | |
1716 | * we can actually use them. | |
1717 | */ | |
1718 | if ((re && RIB_SYSTEM_ROUTE(re)) || | |
1719 | (old_re && RIB_SYSTEM_ROUTE(old_re))) | |
1720 | zebra_rib_fixup_system(rn); | |
12e7fe3a | 1721 | break; |
d37f4d6c MS |
1722 | default: |
1723 | break; | |
e5ac2adf | 1724 | } |
699dae23 DS |
1725 | |
1726 | zebra_rib_evaluate_rn_nexthops(rn, seq); | |
a1494c25 | 1727 | zebra_rib_evaluate_mpls(rn); |
e5ac2adf MS |
1728 | done: |
1729 | ||
5f27bcba DS |
1730 | if (rn) |
1731 | route_unlock_node(rn); | |
1732 | ||
e5ac2adf MS |
1733 | /* Return context to dataplane module */ |
1734 | dplane_ctx_fini(&ctx); | |
1735 | } | |
1736 | ||
54818e3b MS |
1737 | /* |
1738 | * Handle notification from async dataplane: the dataplane has detected | |
1739 | * some change to a route, and notifies zebra so that the control plane | |
1740 | * can reflect that change. | |
1741 | */ | |
1742 | static void rib_process_dplane_notify(struct zebra_dplane_ctx *ctx) | |
1743 | { | |
1744 | struct route_node *rn = NULL; | |
efe6c026 MS |
1745 | struct route_entry *re = NULL; |
1746 | struct nexthop *nexthop; | |
54818e3b MS |
1747 | char dest_str[PREFIX_STRLEN] = ""; |
1748 | const struct prefix *dest_pfx, *src_pfx; | |
941e261c | 1749 | rib_dest_t *dest; |
efe6c026 | 1750 | bool fib_changed = false; |
941e261c | 1751 | bool debug_p = IS_ZEBRA_DEBUG_DPLANE | IS_ZEBRA_DEBUG_RIB; |
efe6c026 | 1752 | int start_count, end_count; |
54818e3b MS |
1753 | dest_pfx = dplane_ctx_get_dest(ctx); |
1754 | ||
1755 | /* Note well: only capturing the prefix string if debug is enabled here; | |
1756 | * unconditional log messages will have to generate the string. | |
1757 | */ | |
941e261c | 1758 | if (debug_p) |
54818e3b MS |
1759 | prefix2str(dest_pfx, dest_str, sizeof(dest_str)); |
1760 | ||
1761 | /* Locate rn and re(s) from ctx */ | |
1762 | rn = rib_find_rn_from_ctx(ctx); | |
1763 | if (rn == NULL) { | |
941e261c MS |
1764 | if (debug_p) { |
1765 | zlog_debug("Failed to process dplane notification: no routes for %u:%s", | |
54818e3b MS |
1766 | dplane_ctx_get_vrf(ctx), dest_str); |
1767 | } | |
1768 | goto done; | |
1769 | } | |
1770 | ||
941e261c | 1771 | dest = rib_dest_from_rnode(rn); |
54818e3b MS |
1772 | srcdest_rnode_prefixes(rn, &dest_pfx, &src_pfx); |
1773 | ||
efe6c026 | 1774 | if (debug_p) |
54818e3b MS |
1775 | zlog_debug("%u:%s Processing dplane notif ctx %p", |
1776 | dplane_ctx_get_vrf(ctx), dest_str, ctx); | |
1777 | ||
1778 | /* | |
1779 | * Take a pass through the routes, look for matches with the context | |
1780 | * info. | |
1781 | */ | |
efe6c026 MS |
1782 | RNODE_FOREACH_RE(rn, re) { |
1783 | if (rib_route_match_ctx(re, ctx, false /*!update*/)) | |
54818e3b MS |
1784 | break; |
1785 | } | |
1786 | ||
1787 | /* No match? Nothing we can do */ | |
1788 | if (re == NULL) { | |
941e261c MS |
1789 | if (debug_p) |
1790 | zlog_debug("%u:%s Unable to process dplane notification: no entry for type %s", | |
54818e3b | 1791 | dplane_ctx_get_vrf(ctx), dest_str, |
941e261c MS |
1792 | zebra_route_string( |
1793 | dplane_ctx_get_type(ctx))); | |
54818e3b MS |
1794 | |
1795 | goto done; | |
1796 | } | |
1797 | ||
272e8903 MS |
1798 | /* Ensure we clear the QUEUED flag */ |
1799 | UNSET_FLAG(re->status, ROUTE_ENTRY_QUEUED); | |
1800 | ||
4c0b5436 MS |
1801 | /* Is this a notification that ... matters? We mostly care about |
1802 | * the route that is currently selected for installation; we may also | |
1803 | * get an un-install notification, and handle that too. | |
941e261c MS |
1804 | */ |
1805 | if (re != dest->selected_fib) { | |
4c0b5436 MS |
1806 | /* |
1807 | * If we need to, clean up after a delete that was part of | |
1808 | * an update operation. | |
941e261c | 1809 | */ |
4c0b5436 MS |
1810 | end_count = 0; |
1811 | for (ALL_NEXTHOPS_PTR(dplane_ctx_get_ng(ctx), nexthop)) { | |
1812 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) | |
1813 | end_count++; | |
1814 | } | |
1815 | ||
1816 | /* If no nexthops or none installed, ensure that this re | |
1817 | * gets its 'installed' flag cleared. | |
1818 | */ | |
1819 | if (end_count == 0) { | |
1820 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_INSTALLED)) | |
1821 | UNSET_FLAG(re->status, ROUTE_ENTRY_INSTALLED); | |
1822 | if (debug_p) | |
1823 | zlog_debug("%u:%s dplane notif, uninstalled type %s route", | |
1824 | dplane_ctx_get_vrf(ctx), dest_str, | |
1825 | zebra_route_string( | |
1826 | dplane_ctx_get_type(ctx))); | |
1827 | } else { | |
1828 | /* At least report on the event. */ | |
1829 | if (debug_p) | |
1830 | zlog_debug("%u:%s dplane notif, but type %s not selected_fib", | |
1831 | dplane_ctx_get_vrf(ctx), dest_str, | |
1832 | zebra_route_string( | |
1833 | dplane_ctx_get_type(ctx))); | |
1834 | } | |
941e261c MS |
1835 | goto done; |
1836 | } | |
1837 | ||
efe6c026 MS |
1838 | /* We'll want to determine whether the installation status of the |
1839 | * route has changed: we'll check the status before processing, | |
1840 | * and then again if there's been a change. | |
1841 | */ | |
1842 | start_count = 0; | |
1c30d64b MS |
1843 | |
1844 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_INSTALLED)) { | |
1845 | for (ALL_NEXTHOPS_PTR(rib_active_nhg(re), nexthop)) { | |
1846 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) | |
1847 | start_count++; | |
1848 | } | |
efe6c026 MS |
1849 | } |
1850 | ||
54818e3b MS |
1851 | /* Update zebra's nexthop FIB flags based on the context struct's |
1852 | * nexthops. | |
1853 | */ | |
efe6c026 | 1854 | fib_changed = rib_update_re_from_ctx(re, rn, ctx); |
54818e3b | 1855 | |
efe6c026 MS |
1856 | if (!fib_changed) { |
1857 | if (debug_p) | |
1c30d64b | 1858 | zlog_debug("%u:%s dplane notification: rib_update returns FALSE", |
54818e3b MS |
1859 | dplane_ctx_get_vrf(ctx), dest_str); |
1860 | } | |
1861 | ||
188a00e0 MS |
1862 | /* |
1863 | * Perform follow-up work if the actual status of the prefix | |
efe6c026 | 1864 | * changed. |
941e261c MS |
1865 | */ |
1866 | ||
efe6c026 MS |
1867 | end_count = 0; |
1868 | for (ALL_NEXTHOPS_PTR(rib_active_nhg(re), nexthop)) { | |
1869 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) | |
1870 | end_count++; | |
1871 | } | |
941e261c | 1872 | |
188a00e0 MS |
1873 | /* Various fib transitions: changed nexthops; from installed to |
1874 | * not-installed; or not-installed to installed. | |
efe6c026 | 1875 | */ |
188a00e0 | 1876 | if (start_count > 0 && end_count > 0) { |
11260e70 MS |
1877 | if (debug_p) |
1878 | zlog_debug("%u:%s applied nexthop changes from dplane notification", | |
1879 | dplane_ctx_get_vrf(ctx), dest_str); | |
188a00e0 MS |
1880 | |
1881 | /* Changed nexthops - update kernel/others */ | |
1882 | dplane_route_notif_update(rn, re, | |
1883 | DPLANE_OP_ROUTE_UPDATE, ctx); | |
1884 | ||
1885 | } else if (start_count == 0 && end_count > 0) { | |
efe6c026 MS |
1886 | if (debug_p) |
1887 | zlog_debug("%u:%s installed transition from dplane notification", | |
1888 | dplane_ctx_get_vrf(ctx), dest_str); | |
1889 | ||
1890 | /* We expect this to be the selected route, so we want | |
272e8903 | 1891 | * to tell others about this transition. |
efe6c026 MS |
1892 | */ |
1893 | SET_FLAG(re->status, ROUTE_ENTRY_INSTALLED); | |
1894 | ||
188a00e0 MS |
1895 | /* Changed nexthops - update kernel/others */ |
1896 | dplane_route_notif_update(rn, re, DPLANE_OP_ROUTE_INSTALL, ctx); | |
1897 | ||
efe6c026 MS |
1898 | /* Redistribute, lsp, and nht update */ |
1899 | redistribute_update(dest_pfx, src_pfx, re, NULL); | |
1900 | ||
1901 | zebra_rib_evaluate_rn_nexthops( | |
1902 | rn, zebra_router_get_next_sequence()); | |
1903 | ||
1904 | zebra_rib_evaluate_mpls(rn); | |
1905 | ||
1906 | } else if (start_count > 0 && end_count == 0) { | |
1907 | if (debug_p) | |
1908 | zlog_debug("%u:%s un-installed transition from dplane notification", | |
1909 | dplane_ctx_get_vrf(ctx), dest_str); | |
1910 | ||
1911 | /* Transition from _something_ installed to _nothing_ | |
1912 | * installed. | |
1913 | */ | |
1914 | /* We expect this to be the selected route, so we want | |
1915 | * to tell others about this transistion. | |
1916 | */ | |
1917 | UNSET_FLAG(re->status, ROUTE_ENTRY_INSTALLED); | |
1918 | ||
188a00e0 MS |
1919 | /* Changed nexthops - update kernel/others */ |
1920 | dplane_route_notif_update(rn, re, DPLANE_OP_ROUTE_DELETE, ctx); | |
1921 | ||
efe6c026 | 1922 | /* Redistribute, lsp, and nht update */ |
40f321c0 | 1923 | redistribute_delete(dest_pfx, src_pfx, re, NULL); |
efe6c026 MS |
1924 | |
1925 | zebra_rib_evaluate_rn_nexthops( | |
1926 | rn, zebra_router_get_next_sequence()); | |
1927 | ||
1928 | zebra_rib_evaluate_mpls(rn); | |
1929 | } | |
941e261c | 1930 | |
54818e3b | 1931 | done: |
941e261c MS |
1932 | if (rn) |
1933 | route_unlock_node(rn); | |
1934 | ||
54818e3b MS |
1935 | /* Return context to dataplane module */ |
1936 | dplane_ctx_fini(&ctx); | |
1937 | } | |
1938 | ||
e22e8001 | 1939 | static void process_subq_nhg(struct listnode *lnode) |
e96f9203 | 1940 | { |
e22e8001 SW |
1941 | struct nhg_ctx *ctx = NULL; |
1942 | uint8_t qindex = route_info[ZEBRA_ROUTE_NHG].meta_q_map; | |
5110a0c6 | 1943 | |
e22e8001 SW |
1944 | ctx = listgetdata(lnode); |
1945 | ||
1946 | if (!ctx) | |
1947 | return; | |
1948 | ||
1949 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) | |
1950 | zlog_debug("NHG Context id=%u dequeued from sub-queue %u", | |
1951 | ctx->id, qindex); | |
1952 | ||
1953 | rib_nhg_process(ctx); | |
1954 | } | |
1955 | ||
1956 | static void process_subq_route(struct listnode *lnode, uint8_t qindex) | |
1957 | { | |
1958 | struct route_node *rnode = NULL; | |
1959 | rib_dest_t *dest = NULL; | |
1960 | struct zebra_vrf *zvrf = NULL; | |
5110a0c6 | 1961 | |
d62a17ae | 1962 | rnode = listgetdata(lnode); |
1963 | dest = rib_dest_from_rnode(rnode); | |
1964 | if (dest) | |
1965 | zvrf = rib_dest_vrf(dest); | |
41ec9222 | 1966 | |
d62a17ae | 1967 | rib_process(rnode); |
5110a0c6 | 1968 | |
d62a17ae | 1969 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) { |
1970 | char buf[SRCDEST2STR_BUFFER]; | |
efe6c026 | 1971 | |
d62a17ae | 1972 | srcdest_rnode2str(rnode, buf, sizeof(buf)); |
1973 | zlog_debug("%u:%s: rn %p dequeued from sub-queue %u", | |
1974 | zvrf ? zvrf_id(zvrf) : 0, buf, rnode, qindex); | |
1975 | } | |
41ec9222 | 1976 | |
d62a17ae | 1977 | if (rnode->info) |
1978 | UNSET_FLAG(rib_dest_from_rnode(rnode)->flags, | |
1979 | RIB_ROUTE_QUEUED(qindex)); | |
9fd92e3c | 1980 | |
67b9467f | 1981 | #if 0 |
5110a0c6 SH |
1982 | else |
1983 | { | |
1984 | zlog_debug ("%s: called for route_node (%p, %d) with no ribs", | |
1985 | __func__, rnode, rnode->lock); | |
1986 | zlog_backtrace(LOG_DEBUG); | |
1987 | } | |
67b9467f | 1988 | #endif |
d62a17ae | 1989 | route_unlock_node(rnode); |
e22e8001 SW |
1990 | } |
1991 | ||
1992 | /* Take a list of route_node structs and return 1, if there was a record | |
1993 | * picked from it and processed by rib_process(). Don't process more, | |
1994 | * than one RN record; operate only in the specified sub-queue. | |
1995 | */ | |
1996 | static unsigned int process_subq(struct list *subq, uint8_t qindex) | |
1997 | { | |
1998 | struct listnode *lnode = listhead(subq); | |
1999 | ||
2000 | if (!lnode) | |
2001 | return 0; | |
2002 | ||
2003 | if (qindex == route_info[ZEBRA_ROUTE_NHG].meta_q_map) | |
2004 | process_subq_nhg(lnode); | |
2005 | else | |
2006 | process_subq_route(lnode, qindex); | |
2007 | ||
d62a17ae | 2008 | list_delete_node(subq, lnode); |
e22e8001 | 2009 | |
d62a17ae | 2010 | return 1; |
e96f9203 DO |
2011 | } |
2012 | ||
2013 | /* Dispatch the meta queue by picking, processing and unlocking the next RN from | |
d62a17ae | 2014 | * a non-empty sub-queue with lowest priority. wq is equal to zebra->ribq and |
2015 | * data | |
e96f9203 DO |
2016 | * is pointed to the meta queue structure. |
2017 | */ | |
d62a17ae | 2018 | static wq_item_status meta_queue_process(struct work_queue *dummy, void *data) |
e96f9203 | 2019 | { |
d62a17ae | 2020 | struct meta_queue *mq = data; |
2021 | unsigned i; | |
91f16812 MS |
2022 | uint32_t queue_len, queue_limit; |
2023 | ||
2024 | /* Ensure there's room for more dataplane updates */ | |
2025 | queue_limit = dplane_get_in_queue_limit(); | |
2026 | queue_len = dplane_get_in_queue_len(); | |
2027 | if (queue_len > queue_limit) { | |
2028 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) | |
8b962e77 MS |
2029 | zlog_debug("rib queue: dplane queue len %u, limit %u, retrying", |
2030 | queue_len, queue_limit); | |
91f16812 MS |
2031 | |
2032 | /* Ensure that the meta-queue is actually enqueued */ | |
489a9614 | 2033 | if (work_queue_empty(zrouter.ribq)) |
ea45a4e7 | 2034 | work_queue_add(zrouter.ribq, zrouter.mq); |
91f16812 MS |
2035 | |
2036 | return WQ_QUEUE_BLOCKED; | |
2037 | } | |
5110a0c6 | 2038 | |
d62a17ae | 2039 | for (i = 0; i < MQ_SIZE; i++) |
2040 | if (process_subq(mq->subq[i], i)) { | |
2041 | mq->size--; | |
2042 | break; | |
2043 | } | |
2044 | return mq->size ? WQ_REQUEUE : WQ_SUCCESS; | |
e96f9203 DO |
2045 | } |
2046 | ||
f52ed677 DS |
2047 | |
2048 | /* | |
2049 | * Look into the RN and queue it into the highest priority queue | |
2050 | * at this point in time for processing. | |
2051 | * | |
2052 | * We will enqueue a route node only once per invocation. | |
2053 | * | |
2054 | * There are two possibilities here that should be kept in mind. | |
2055 | * If the original invocation has not been pulled off for processing | |
2056 | * yet, A subsuquent invocation can have a route entry with a better | |
2057 | * meta queue index value and we can have a situation where | |
2058 | * we might have the same node enqueued 2 times. Not necessarily | |
2059 | * an optimal situation but it should be ok. | |
2060 | * | |
2061 | * The other possibility is that the original invocation has not | |
2062 | * been pulled off for processing yet, A subsusquent invocation | |
2063 | * doesn't have a route_entry with a better meta-queue and the | |
2064 | * original metaqueue index value will win and we'll end up with | |
2065 | * the route node enqueued once. | |
e96f9203 | 2066 | */ |
e22e8001 | 2067 | static int rib_meta_queue_add(struct meta_queue *mq, void *data) |
e96f9203 | 2068 | { |
e22e8001 | 2069 | struct route_node *rn = NULL; |
f52ed677 DS |
2070 | struct route_entry *re = NULL, *curr_re = NULL; |
2071 | uint8_t qindex = MQ_SIZE, curr_qindex = MQ_SIZE; | |
5110a0c6 | 2072 | |
e22e8001 SW |
2073 | rn = (struct route_node *)data; |
2074 | ||
f52ed677 DS |
2075 | RNODE_FOREACH_RE (rn, curr_re) { |
2076 | curr_qindex = route_info[curr_re->type].meta_q_map; | |
d62a17ae | 2077 | |
f52ed677 DS |
2078 | if (curr_qindex <= qindex) { |
2079 | re = curr_re; | |
2080 | qindex = curr_qindex; | |
d62a17ae | 2081 | } |
f52ed677 | 2082 | } |
5110a0c6 | 2083 | |
f52ed677 | 2084 | if (!re) |
e22e8001 | 2085 | return -1; |
5110a0c6 | 2086 | |
f52ed677 DS |
2087 | /* Invariant: at this point we always have rn->info set. */ |
2088 | if (CHECK_FLAG(rib_dest_from_rnode(rn)->flags, | |
2089 | RIB_ROUTE_QUEUED(qindex))) { | |
d62a17ae | 2090 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) |
2091 | rnode_debug(rn, re->vrf_id, | |
f52ed677 | 2092 | "rn %p is already queued in sub-queue %u", |
d62a17ae | 2093 | (void *)rn, qindex); |
e22e8001 | 2094 | return -1; |
d62a17ae | 2095 | } |
f52ed677 DS |
2096 | |
2097 | SET_FLAG(rib_dest_from_rnode(rn)->flags, RIB_ROUTE_QUEUED(qindex)); | |
2098 | listnode_add(mq->subq[qindex], rn); | |
2099 | route_lock_node(rn); | |
2100 | mq->size++; | |
2101 | ||
2102 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) | |
2103 | rnode_debug(rn, re->vrf_id, "queued rn %p into sub-queue %u", | |
2104 | (void *)rn, qindex); | |
e22e8001 SW |
2105 | |
2106 | return 0; | |
4d38fdb4 | 2107 | } |
2108 | ||
e22e8001 | 2109 | static int rib_meta_queue_nhg_add(struct meta_queue *mq, void *data) |
4d38fdb4 | 2110 | { |
e22e8001 SW |
2111 | struct nhg_ctx *ctx = NULL; |
2112 | uint8_t qindex = route_info[ZEBRA_ROUTE_NHG].meta_q_map; | |
fc328ac9 | 2113 | |
e22e8001 SW |
2114 | ctx = (struct nhg_ctx *)data; |
2115 | ||
2116 | if (!ctx) | |
2117 | return -1; | |
4d38fdb4 | 2118 | |
e22e8001 SW |
2119 | listnode_add(mq->subq[qindex], ctx); |
2120 | mq->size++; | |
2121 | ||
2122 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) | |
2123 | zlog_debug("NHG Context id=%u queued into sub-queue %u", | |
2124 | ctx->id, qindex); | |
2125 | ||
2126 | return 0; | |
2127 | } | |
2128 | ||
2129 | static int mq_add_handler(void *data, | |
2130 | int (*mq_add_func)(struct meta_queue *mq, void *data)) | |
2131 | { | |
489a9614 | 2132 | if (zrouter.ribq == NULL) { |
e914ccbe | 2133 | flog_err(EC_ZEBRA_WQ_NONEXISTENT, |
1c50c1c0 | 2134 | "%s: work_queue does not exist!", __func__); |
e22e8001 | 2135 | return -1; |
d62a17ae | 2136 | } |
2137 | ||
2138 | /* | |
2139 | * The RIB queue should normally be either empty or holding the only | |
2140 | * work_queue_item element. In the latter case this element would | |
2141 | * hold a pointer to the meta queue structure, which must be used to | |
2142 | * actually queue the route nodes to process. So create the MQ | |
2143 | * holder, if necessary, then push the work into it in any case. | |
2144 | * This semantics was introduced after 0.99.9 release. | |
2145 | */ | |
489a9614 | 2146 | if (work_queue_empty(zrouter.ribq)) |
ea45a4e7 | 2147 | work_queue_add(zrouter.ribq, zrouter.mq); |
e96f9203 | 2148 | |
e22e8001 SW |
2149 | return mq_add_func(zrouter.mq, data); |
2150 | } | |
fc328ac9 | 2151 | |
e22e8001 SW |
2152 | /* Add route_node to work queue and schedule processing */ |
2153 | int rib_queue_add(struct route_node *rn) | |
2154 | { | |
2155 | assert(rn); | |
2156 | ||
2157 | /* Pointless to queue a route_node with no RIB entries to add or remove | |
2158 | */ | |
2159 | if (!rnode_to_ribs(rn)) { | |
2160 | zlog_debug("%s: called for route_node (%p, %d) with no ribs", | |
2161 | __func__, (void *)rn, rn->lock); | |
2162 | zlog_backtrace(LOG_DEBUG); | |
2163 | return -1; | |
2164 | } | |
2165 | ||
2166 | return mq_add_handler(rn, &rib_meta_queue_add); | |
2167 | } | |
2168 | ||
2169 | int rib_queue_nhg_add(struct nhg_ctx *ctx) | |
2170 | { | |
2171 | assert(ctx); | |
2172 | ||
2173 | return mq_add_handler(ctx, &rib_meta_queue_nhg_add); | |
4d38fdb4 | 2174 | } |
2175 | ||
5110a0c6 SH |
2176 | /* Create new meta queue. |
2177 | A destructor function doesn't seem to be necessary here. | |
2178 | */ | |
d62a17ae | 2179 | static struct meta_queue *meta_queue_new(void) |
e96f9203 | 2180 | { |
d62a17ae | 2181 | struct meta_queue *new; |
2182 | unsigned i; | |
5110a0c6 | 2183 | |
d62a17ae | 2184 | new = XCALLOC(MTYPE_WORK_QUEUE, sizeof(struct meta_queue)); |
e96f9203 | 2185 | |
d62a17ae | 2186 | for (i = 0; i < MQ_SIZE; i++) { |
2187 | new->subq[i] = list_new(); | |
2188 | assert(new->subq[i]); | |
2189 | } | |
5110a0c6 | 2190 | |
d62a17ae | 2191 | return new; |
e96f9203 DO |
2192 | } |
2193 | ||
d62a17ae | 2194 | void meta_queue_free(struct meta_queue *mq) |
5a8dfcd8 | 2195 | { |
d62a17ae | 2196 | unsigned i; |
5a8dfcd8 | 2197 | |
d62a17ae | 2198 | for (i = 0; i < MQ_SIZE; i++) |
6a154c88 | 2199 | list_delete(&mq->subq[i]); |
5a8dfcd8 | 2200 | |
d62a17ae | 2201 | XFREE(MTYPE_WORK_QUEUE, mq); |
5a8dfcd8 RW |
2202 | } |
2203 | ||
4d38fdb4 | 2204 | /* initialise zebra rib work queue */ |
2561d12e | 2205 | static void rib_queue_init(void) |
4d38fdb4 | 2206 | { |
489a9614 DS |
2207 | if (!(zrouter.ribq = work_queue_new(zrouter.master, |
2208 | "route_node processing"))) { | |
e914ccbe | 2209 | flog_err(EC_ZEBRA_WQ_NONEXISTENT, |
1c50c1c0 | 2210 | "%s: could not initialise work queue!", __func__); |
d62a17ae | 2211 | return; |
2212 | } | |
4d38fdb4 | 2213 | |
d62a17ae | 2214 | /* fill in the work queue spec */ |
489a9614 DS |
2215 | zrouter.ribq->spec.workfunc = &meta_queue_process; |
2216 | zrouter.ribq->spec.errorfunc = NULL; | |
46a4e345 | 2217 | zrouter.ribq->spec.completion_func = NULL; |
d62a17ae | 2218 | /* XXX: TODO: These should be runtime configurable via vty */ |
489a9614 DS |
2219 | zrouter.ribq->spec.max_retries = 3; |
2220 | zrouter.ribq->spec.hold = ZEBRA_RIB_PROCESS_HOLD_TIME; | |
2221 | zrouter.ribq->spec.retry = ZEBRA_RIB_PROCESS_RETRY_TIME; | |
d62a17ae | 2222 | |
ea45a4e7 | 2223 | if (!(zrouter.mq = meta_queue_new())) { |
e914ccbe | 2224 | flog_err(EC_ZEBRA_WQ_NONEXISTENT, |
1c50c1c0 | 2225 | "%s: could not initialise meta queue!", __func__); |
d62a17ae | 2226 | return; |
2227 | } | |
2228 | return; | |
718e3744 | 2229 | } |
2230 | ||
434434f7 DS |
2231 | rib_dest_t *zebra_rib_create_dest(struct route_node *rn) |
2232 | { | |
2233 | rib_dest_t *dest; | |
2234 | ||
2235 | dest = XCALLOC(MTYPE_RIB_DEST, sizeof(rib_dest_t)); | |
aa57abfb | 2236 | rnh_list_init(&dest->nht); |
434434f7 DS |
2237 | route_lock_node(rn); /* rn route table reference */ |
2238 | rn->info = dest; | |
2239 | dest->rnode = rn; | |
2240 | ||
2241 | return dest; | |
2242 | } | |
2243 | ||
6d691129 PJ |
2244 | /* RIB updates are processed via a queue of pointers to route_nodes. |
2245 | * | |
2246 | * The queue length is bounded by the maximal size of the routing table, | |
2247 | * as a route_node will not be requeued, if already queued. | |
2248 | * | |
f0f77c9a DS |
2249 | * REs are submitted via rib_addnode or rib_delnode which set minimal |
2250 | * state, or static_install_route (when an existing RE is updated) | |
3c0755dc | 2251 | * and then submit route_node to queue for best-path selection later. |
f0f77c9a | 2252 | * Order of add/delete state changes are preserved for any given RE. |
6d691129 | 2253 | * |
f0f77c9a | 2254 | * Deleted REs are reaped during best-path selection. |
6d691129 PJ |
2255 | * |
2256 | * rib_addnode | |
f0f77c9a DS |
2257 | * |-> rib_link or unset ROUTE_ENTRY_REMOVE |->Update kernel with |
2258 | * |-------->| | best RE, if required | |
3c0755dc PJ |
2259 | * | | |
2260 | * static_install->|->rib_addqueue...... -> rib_process | |
2261 | * | | | |
2262 | * |-------->| |-> rib_unlink | |
f0f77c9a DS |
2263 | * |-> set ROUTE_ENTRY_REMOVE | |
2264 | * rib_delnode (RE freed) | |
6d691129 | 2265 | * |
9fd92e3c AS |
2266 | * The 'info' pointer of a route_node points to a rib_dest_t |
2267 | * ('dest'). Queueing state for a route_node is kept on the dest. The | |
2268 | * dest is created on-demand by rib_link() and is kept around at least | |
2269 | * as long as there are ribs hanging off it (@see rib_gc_dest()). | |
d62a17ae | 2270 | * |
6d691129 PJ |
2271 | * Refcounting (aka "locking" throughout the GNU Zebra and Quagga code): |
2272 | * | |
2273 | * - route_nodes: refcounted by: | |
9fd92e3c AS |
2274 | * - dest attached to route_node: |
2275 | * - managed by: rib_link/rib_gc_dest | |
6d691129 PJ |
2276 | * - route_node processing queue |
2277 | * - managed by: rib_addqueue, rib_process. | |
2278 | * | |
2279 | */ | |
d62a17ae | 2280 | |
f0f77c9a | 2281 | /* Add RE to head of the route node. */ |
d62a17ae | 2282 | static void rib_link(struct route_node *rn, struct route_entry *re, int process) |
2283 | { | |
d62a17ae | 2284 | rib_dest_t *dest; |
2285 | afi_t afi; | |
2286 | const char *rmap_name; | |
9fd92e3c | 2287 | |
d62a17ae | 2288 | assert(re && rn); |
9fd92e3c | 2289 | |
d62a17ae | 2290 | dest = rib_dest_from_rnode(rn); |
2291 | if (!dest) { | |
2292 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) | |
2293 | rnode_debug(rn, re->vrf_id, "rn %p adding dest", rn); | |
7a4bb9c5 | 2294 | |
434434f7 | 2295 | dest = zebra_rib_create_dest(rn); |
d62a17ae | 2296 | } |
2263a412 | 2297 | |
045207e2 | 2298 | re_list_add_head(&dest->routes, re); |
d62a17ae | 2299 | |
2300 | afi = (rn->p.family == AF_INET) | |
2301 | ? AFI_IP | |
2302 | : (rn->p.family == AF_INET6) ? AFI_IP6 : AFI_MAX; | |
fe257ae7 DS |
2303 | if (is_zebra_import_table_enabled(afi, re->vrf_id, re->table)) { |
2304 | struct zebra_vrf *zvrf = zebra_vrf_lookup_by_id(re->vrf_id); | |
2305 | ||
d62a17ae | 2306 | rmap_name = zebra_get_import_table_route_map(afi, re->table); |
fe257ae7 | 2307 | zebra_add_import_table_entry(zvrf, rn, re, rmap_name); |
d62a17ae | 2308 | } else if (process) |
2309 | rib_queue_add(rn); | |
2310 | } | |
2311 | ||
7e24fdf3 DS |
2312 | static void rib_addnode(struct route_node *rn, |
2313 | struct route_entry *re, int process) | |
d62a17ae | 2314 | { |
2315 | /* RE node has been un-removed before route-node is processed. | |
2316 | * route_node must hence already be on the queue for processing.. | |
2317 | */ | |
2318 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) { | |
2319 | if (IS_ZEBRA_DEBUG_RIB) | |
2320 | rnode_debug(rn, re->vrf_id, "rn %p, un-removed re %p", | |
2321 | (void *)rn, (void *)re); | |
2322 | ||
2323 | UNSET_FLAG(re->status, ROUTE_ENTRY_REMOVED); | |
2324 | return; | |
2325 | } | |
2326 | rib_link(rn, re, process); | |
6d691129 PJ |
2327 | } |
2328 | ||
9fd92e3c AS |
2329 | /* |
2330 | * rib_unlink | |
2331 | * | |
2332 | * Detach a rib structure from a route_node. | |
2333 | * | |
2334 | * Note that a call to rib_unlink() should be followed by a call to | |
2335 | * rib_gc_dest() at some point. This allows a rib_dest_t that is no | |
2336 | * longer required to be deleted. | |
2337 | */ | |
d62a17ae | 2338 | void rib_unlink(struct route_node *rn, struct route_entry *re) |
6d691129 | 2339 | { |
d62a17ae | 2340 | rib_dest_t *dest; |
8e766379 | 2341 | struct nhg_hash_entry *nhe = NULL; |
9fd92e3c | 2342 | |
d62a17ae | 2343 | assert(rn && re); |
6d691129 | 2344 | |
d62a17ae | 2345 | if (IS_ZEBRA_DEBUG_RIB) |
2346 | rnode_debug(rn, re->vrf_id, "rn %p, re %p", (void *)rn, | |
2347 | (void *)re); | |
6d691129 | 2348 | |
d62a17ae | 2349 | dest = rib_dest_from_rnode(rn); |
6d691129 | 2350 | |
045207e2 | 2351 | re_list_del(&dest->routes, re); |
7a4bb9c5 | 2352 | |
2eb07de3 DS |
2353 | if (dest->selected_fib == re) |
2354 | dest->selected_fib = NULL; | |
2355 | ||
e22e8001 SW |
2356 | if (re->nhe_id) { |
2357 | nhe = zebra_nhg_lookup_id(re->nhe_id); | |
2358 | if (nhe) | |
2359 | zebra_nhg_decrement_ref(nhe); | |
0eb97b86 MS |
2360 | } else if (re->nhe->nhg) |
2361 | nexthop_group_delete(&re->nhe->nhg); | |
22bcedb2 | 2362 | |
ee5e8a48 MS |
2363 | nexthops_free(re->fib_ng.nexthop); |
2364 | ||
d62a17ae | 2365 | XFREE(MTYPE_RE, re); |
2366 | } | |
2367 | ||
2368 | void rib_delnode(struct route_node *rn, struct route_entry *re) | |
2369 | { | |
2370 | afi_t afi; | |
2371 | ||
2372 | if (IS_ZEBRA_DEBUG_RIB) | |
2373 | rnode_debug(rn, re->vrf_id, "rn %p, re %p, removing", | |
2374 | (void *)rn, (void *)re); | |
2375 | SET_FLAG(re->status, ROUTE_ENTRY_REMOVED); | |
2376 | ||
2377 | afi = (rn->p.family == AF_INET) | |
2378 | ? AFI_IP | |
2379 | : (rn->p.family == AF_INET6) ? AFI_IP6 : AFI_MAX; | |
fe257ae7 DS |
2380 | if (is_zebra_import_table_enabled(afi, re->vrf_id, re->table)) { |
2381 | struct zebra_vrf *zvrf = zebra_vrf_lookup_by_id(re->vrf_id); | |
2382 | ||
2383 | zebra_del_import_table_entry(zvrf, rn, re); | |
d62a17ae | 2384 | /* Just clean up if non main table */ |
2385 | if (IS_ZEBRA_DEBUG_RIB) { | |
2386 | char buf[SRCDEST2STR_BUFFER]; | |
2387 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
2da33d6b DS |
2388 | zlog_debug("%u:%s: Freeing route rn %p, re %p (%s)", |
2389 | re->vrf_id, buf, rn, re, | |
2390 | zebra_route_string(re->type)); | |
d62a17ae | 2391 | } |
7a4bb9c5 | 2392 | |
d62a17ae | 2393 | rib_unlink(rn, re); |
2394 | } else { | |
2395 | rib_queue_add(rn); | |
2396 | } | |
718e3744 | 2397 | } |
2398 | ||
f0f77c9a | 2399 | /* This function dumps the contents of a given RE entry into |
dc95824a DO |
2400 | * standard debug log. Calling function name and IP prefix in |
2401 | * question are passed as 1st and 2nd arguments. | |
2402 | */ | |
2403 | ||
d62a17ae | 2404 | void _route_entry_dump(const char *func, union prefixconstptr pp, |
2405 | union prefixconstptr src_pp, | |
2406 | const struct route_entry *re) | |
2407 | { | |
d62a17ae | 2408 | const struct prefix *src_p = src_pp.p; |
2409 | bool is_srcdst = src_p && src_p->prefixlen; | |
2410 | char straddr[PREFIX_STRLEN]; | |
2411 | char srcaddr[PREFIX_STRLEN]; | |
53c16fbe | 2412 | char nhname[PREFIX_STRLEN]; |
d62a17ae | 2413 | struct nexthop *nexthop; |
2414 | ||
2415 | zlog_debug("%s: dumping RE entry %p for %s%s%s vrf %u", func, | |
2416 | (const void *)re, prefix2str(pp, straddr, sizeof(straddr)), | |
2417 | is_srcdst ? " from " : "", | |
2418 | is_srcdst ? prefix2str(src_pp, srcaddr, sizeof(srcaddr)) | |
2419 | : "", | |
2420 | re->vrf_id); | |
cc54cfee | 2421 | zlog_debug("%s: uptime == %lu, type == %u, instance == %d, table == %d", |
53c16fbe | 2422 | straddr, (unsigned long)re->uptime, re->type, re->instance, |
cc54cfee | 2423 | re->table); |
d62a17ae | 2424 | zlog_debug( |
2425 | "%s: metric == %u, mtu == %u, distance == %u, flags == %u, status == %u", | |
53c16fbe DS |
2426 | straddr, re->metric, re->mtu, re->distance, re->flags, re->status); |
2427 | zlog_debug("%s: nexthop_num == %u, nexthop_active_num == %u", straddr, | |
0eb97b86 MS |
2428 | nexthop_group_nexthop_num(re->nhe->nhg), |
2429 | nexthop_group_active_nexthop_num(re->nhe->nhg)); | |
d62a17ae | 2430 | |
0eb97b86 | 2431 | for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop)) { |
2d68a0f2 DS |
2432 | struct interface *ifp; |
2433 | struct vrf *vrf = vrf_lookup_by_id(nexthop->vrf_id); | |
2434 | ||
2435 | switch (nexthop->type) { | |
2436 | case NEXTHOP_TYPE_BLACKHOLE: | |
53c16fbe | 2437 | sprintf(nhname, "Blackhole"); |
2d68a0f2 DS |
2438 | break; |
2439 | case NEXTHOP_TYPE_IFINDEX: | |
2440 | ifp = if_lookup_by_index(nexthop->ifindex, | |
2441 | nexthop->vrf_id); | |
53c16fbe | 2442 | sprintf(nhname, "%s", ifp ? ifp->name : "Unknown"); |
2d68a0f2 DS |
2443 | break; |
2444 | case NEXTHOP_TYPE_IPV4: | |
2445 | /* fallthrough */ | |
2446 | case NEXTHOP_TYPE_IPV4_IFINDEX: | |
53c16fbe | 2447 | inet_ntop(AF_INET, &nexthop->gate, nhname, |
2d68a0f2 DS |
2448 | INET6_ADDRSTRLEN); |
2449 | break; | |
2450 | case NEXTHOP_TYPE_IPV6: | |
2451 | case NEXTHOP_TYPE_IPV6_IFINDEX: | |
53c16fbe | 2452 | inet_ntop(AF_INET6, &nexthop->gate, nhname, |
2d68a0f2 DS |
2453 | INET6_ADDRSTRLEN); |
2454 | break; | |
2455 | } | |
df38b099 | 2456 | zlog_debug("%s: %s %s[%u] vrf %s(%u) with flags %s%s%s%s%s%s", |
53c16fbe | 2457 | straddr, (nexthop->rparent ? " NH" : "NH"), nhname, |
2d68a0f2 DS |
2458 | nexthop->ifindex, vrf ? vrf->name : "Unknown", |
2459 | nexthop->vrf_id, | |
d62a17ae | 2460 | (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE) |
2461 | ? "ACTIVE " | |
2462 | : ""), | |
677c1dd5 | 2463 | (CHECK_FLAG(re->status, ROUTE_ENTRY_INSTALLED) |
d62a17ae | 2464 | ? "FIB " |
2465 | : ""), | |
2466 | (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_RECURSIVE) | |
df38b099 DS |
2467 | ? "RECURSIVE " |
2468 | : ""), | |
2469 | (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ONLINK) | |
2470 | ? "ONLINK " | |
2471 | : ""), | |
2472 | (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_MATCHED) | |
2473 | ? "MATCHED " | |
2474 | : ""), | |
2475 | (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_DUPLICATE) | |
2476 | ? "DUPLICATE " | |
d62a17ae | 2477 | : "")); |
2478 | } | |
53c16fbe | 2479 | zlog_debug("%s: dump complete", straddr); |
dc95824a DO |
2480 | } |
2481 | ||
2482 | /* This is an exported helper to rtm_read() to dump the strange | |
f0f77c9a | 2483 | * RE entry found by rib_lookup_ipv4_route() |
dc95824a DO |
2484 | */ |
2485 | ||
d62a17ae | 2486 | void rib_lookup_and_dump(struct prefix_ipv4 *p, vrf_id_t vrf_id) |
2487 | { | |
2488 | struct route_table *table; | |
2489 | struct route_node *rn; | |
2490 | struct route_entry *re; | |
2491 | char prefix_buf[INET_ADDRSTRLEN]; | |
2492 | ||
2493 | /* Lookup table. */ | |
2494 | table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id); | |
2495 | if (!table) { | |
e914ccbe | 2496 | flog_err(EC_ZEBRA_TABLE_LOOKUP_FAILED, |
1c50c1c0 QY |
2497 | "%s:%u zebra_vrf_table() returned NULL", __func__, |
2498 | vrf_id); | |
d62a17ae | 2499 | return; |
2500 | } | |
2501 | ||
2502 | /* Scan the RIB table for exactly matching RE entry. */ | |
2503 | rn = route_node_lookup(table, (struct prefix *)p); | |
2504 | ||
2505 | /* No route for this prefix. */ | |
2506 | if (!rn) { | |
32391aff | 2507 | zlog_debug("%s:%u lookup failed for %s", __func__, vrf_id, |
d62a17ae | 2508 | prefix2str((struct prefix *)p, prefix_buf, |
2509 | sizeof(prefix_buf))); | |
2510 | return; | |
2511 | } | |
2512 | ||
2513 | /* Unlock node. */ | |
2514 | route_unlock_node(rn); | |
2515 | ||
2516 | /* let's go */ | |
a2addae8 | 2517 | RNODE_FOREACH_RE (rn, re) { |
32391aff DS |
2518 | zlog_debug("%s:%u rn %p, re %p: %s, %s", |
2519 | __func__, vrf_id, | |
2520 | (void *)rn, (void *)re, | |
d62a17ae | 2521 | (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED) |
2522 | ? "removed" | |
2523 | : "NOT removed"), | |
2524 | (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED) | |
2525 | ? "selected" | |
2526 | : "NOT selected")); | |
2527 | route_entry_dump(p, NULL, re); | |
2528 | } | |
dc95824a DO |
2529 | } |
2530 | ||
20e5ff0a DO |
2531 | /* Check if requested address assignment will fail due to another |
2532 | * route being installed by zebra in FIB already. Take necessary | |
2533 | * actions, if needed: remove such a route from FIB and deSELECT | |
f0f77c9a | 2534 | * corresponding RE entry. Then put affected RN into RIBQ head. |
20e5ff0a | 2535 | */ |
d62a17ae | 2536 | void rib_lookup_and_pushup(struct prefix_ipv4 *p, vrf_id_t vrf_id) |
2537 | { | |
2538 | struct route_table *table; | |
2539 | struct route_node *rn; | |
5f7a4718 | 2540 | rib_dest_t *dest; |
d62a17ae | 2541 | |
2542 | if (NULL == (table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id))) { | |
e914ccbe | 2543 | flog_err(EC_ZEBRA_TABLE_LOOKUP_FAILED, |
1c50c1c0 QY |
2544 | "%s:%u zebra_vrf_table() returned NULL", __func__, |
2545 | vrf_id); | |
d62a17ae | 2546 | return; |
2547 | } | |
2548 | ||
2549 | /* No matches would be the simplest case. */ | |
2550 | if (NULL == (rn = route_node_lookup(table, (struct prefix *)p))) | |
2551 | return; | |
2552 | ||
2553 | /* Unlock node. */ | |
2554 | route_unlock_node(rn); | |
2555 | ||
5f7a4718 | 2556 | dest = rib_dest_from_rnode(rn); |
d62a17ae | 2557 | /* Check all RE entries. In case any changes have to be done, requeue |
2558 | * the RN into RIBQ head. If the routing message about the new connected | |
2559 | * route (generated by the IP address we are going to assign very soon) | |
2560 | * comes before the RIBQ is processed, the new RE entry will join | |
2561 | * RIBQ record already on head. This is necessary for proper | |
2562 | * revalidation | |
2563 | * of the rest of the RE. | |
2564 | */ | |
3cdba47a | 2565 | if (dest->selected_fib) { |
5f7a4718 DS |
2566 | if (IS_ZEBRA_DEBUG_RIB) { |
2567 | char buf[PREFIX_STRLEN]; | |
2568 | ||
2569 | zlog_debug("%u:%s: freeing way for connected prefix", | |
2570 | dest->selected_fib->vrf_id, | |
2571 | prefix2str(&rn->p, buf, sizeof(buf))); | |
2572 | route_entry_dump(&rn->p, NULL, dest->selected_fib); | |
d62a17ae | 2573 | } |
5f7a4718 | 2574 | rib_uninstall(rn, dest->selected_fib); |
d62a17ae | 2575 | rib_queue_add(rn); |
ade4a886 | 2576 | } |
20e5ff0a DO |
2577 | } |
2578 | ||
d62a17ae | 2579 | int rib_add_multipath(afi_t afi, safi_t safi, struct prefix *p, |
0eb97b86 MS |
2580 | struct prefix_ipv6 *src_p, struct route_entry *re, |
2581 | struct nexthop_group *ng) | |
718e3744 | 2582 | { |
98cda54a | 2583 | struct nhg_hash_entry *nhe = NULL; |
d62a17ae | 2584 | struct route_table *table; |
2585 | struct route_node *rn; | |
40ecd8e4 | 2586 | struct route_entry *same = NULL; |
d62a17ae | 2587 | int ret = 0; |
b4c034b0 | 2588 | |
d62a17ae | 2589 | if (!re) |
2590 | return 0; | |
b4c034b0 | 2591 | |
1f610a1f | 2592 | assert(!src_p || !src_p->prefixlen || afi == AFI_IP6); |
05737783 | 2593 | |
d62a17ae | 2594 | /* Lookup table. */ |
c7c0b007 SW |
2595 | table = zebra_vrf_get_table_with_table_id(afi, safi, re->vrf_id, |
2596 | re->table); | |
7865c65d | 2597 | if (!table) { |
0eb97b86 MS |
2598 | if (ng) |
2599 | nexthop_group_delete(&ng); | |
7865c65d | 2600 | XFREE(MTYPE_RE, re); |
d62a17ae | 2601 | return 0; |
7865c65d | 2602 | } |
cddf391b | 2603 | |
98cda54a SW |
2604 | if (re->nhe_id) { |
2605 | nhe = zebra_nhg_lookup_id(re->nhe_id); | |
2606 | ||
2607 | if (!nhe) { | |
2608 | flog_err( | |
2609 | EC_ZEBRA_TABLE_LOOKUP_FAILED, | |
2610 | "Zebra failed to find the nexthop hash entry for id=%u in a route entry", | |
2611 | re->nhe_id); | |
2612 | XFREE(MTYPE_RE, re); | |
2613 | return -1; | |
2614 | } | |
2615 | } else { | |
0eb97b86 | 2616 | nhe = zebra_nhg_rib_find(0, ng, afi); |
98cda54a SW |
2617 | |
2618 | /* | |
2619 | * The nexthops got copied over into an nhe, | |
2620 | * so free them now. | |
2621 | */ | |
0eb97b86 | 2622 | nexthop_group_delete(&ng); |
98cda54a SW |
2623 | |
2624 | if (!nhe) { | |
2625 | char buf[PREFIX_STRLEN] = ""; | |
2626 | char buf2[PREFIX_STRLEN] = ""; | |
2627 | ||
2628 | flog_err( | |
2629 | EC_ZEBRA_TABLE_LOOKUP_FAILED, | |
2630 | "Zebra failed to find or create a nexthop hash entry for %s%s%s", | |
2631 | prefix2str(p, buf, sizeof(buf)), | |
2632 | src_p ? " from " : "", | |
2633 | src_p ? prefix2str(src_p, buf2, sizeof(buf2)) | |
2634 | : ""); | |
2635 | ||
2636 | XFREE(MTYPE_RE, re); | |
2637 | return -1; | |
2638 | } | |
98cda54a SW |
2639 | } |
2640 | ||
4b87c90d SW |
2641 | /* |
2642 | * Attach the re to the nhe's nexthop group. | |
2643 | * | |
2644 | * TODO: This will need to change when we start getting IDs from upper | |
2645 | * level protocols, as the refcnt might be wrong, since it checks | |
2646 | * if old_id != new_id. | |
2647 | */ | |
5463ce26 | 2648 | route_entry_update_nhe(re, nhe); |
98cda54a | 2649 | |
d62a17ae | 2650 | /* Make it sure prefixlen is applied to the prefix. */ |
2651 | apply_mask(p); | |
2652 | if (src_p) | |
2653 | apply_mask_ipv6(src_p); | |
718e3744 | 2654 | |
d62a17ae | 2655 | /* Set default distance by route type. */ |
eea2ef07 | 2656 | if (re->distance == 0) |
0492eea0 | 2657 | re->distance = route_distance(re->type); |
718e3744 | 2658 | |
d62a17ae | 2659 | /* Lookup route node.*/ |
2660 | rn = srcdest_rnode_get(table, p, src_p); | |
718e3744 | 2661 | |
40ecd8e4 DS |
2662 | /* |
2663 | * If same type of route are installed, treat it as a implicit | |
2664 | * withdraw. | |
2665 | * If the user has specified the No route replace semantics | |
2666 | * for the install don't do a route replace. | |
2667 | */ | |
a2addae8 | 2668 | RNODE_FOREACH_RE (rn, same) { |
d62a17ae | 2669 | if (CHECK_FLAG(same->status, ROUTE_ENTRY_REMOVED)) |
2670 | continue; | |
41ec9222 | 2671 | |
eb327fa5 RW |
2672 | if (same->type != re->type) |
2673 | continue; | |
2674 | if (same->instance != re->instance) | |
2675 | continue; | |
996c9314 LB |
2676 | if (same->type == ZEBRA_ROUTE_KERNEL |
2677 | && same->metric != re->metric) | |
eb327fa5 | 2678 | continue; |
40ecd8e4 DS |
2679 | |
2680 | if (CHECK_FLAG(re->flags, ZEBRA_FLAG_RR_USE_DISTANCE) && | |
2681 | same->distance != re->distance) | |
2682 | continue; | |
2683 | ||
844b3a87 | 2684 | /* |
40ecd8e4 DS |
2685 | * We should allow duplicate connected routes |
2686 | * because of IPv6 link-local routes and unnumbered | |
2687 | * interfaces on Linux. | |
844b3a87 RW |
2688 | */ |
2689 | if (same->type != ZEBRA_ROUTE_CONNECT) | |
d62a17ae | 2690 | break; |
2691 | } | |
718e3744 | 2692 | |
cf363e1b MS |
2693 | /* If this route is kernel/connected route, notify the dataplane. */ |
2694 | if (RIB_SYSTEM_ROUTE(re)) { | |
2695 | /* Notify dataplane */ | |
2696 | dplane_sys_route_add(rn, re); | |
2697 | } | |
2698 | ||
d62a17ae | 2699 | /* Link new re to node.*/ |
2700 | if (IS_ZEBRA_DEBUG_RIB) { | |
2da33d6b DS |
2701 | rnode_debug(rn, re->vrf_id, |
2702 | "Inserting route rn %p, re %p (%s) existing %p", | |
2703 | rn, re, zebra_route_string(re->type), same); | |
718e3744 | 2704 | |
d62a17ae | 2705 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) |
2706 | route_entry_dump(p, src_p, re); | |
718e3744 | 2707 | } |
6883bf8d DS |
2708 | |
2709 | SET_FLAG(re->status, ROUTE_ENTRY_CHANGED); | |
d62a17ae | 2710 | rib_addnode(rn, re, 1); |
2711 | ret = 1; | |
6b0655a2 | 2712 | |
d62a17ae | 2713 | /* Free implicit route.*/ |
2714 | if (same) { | |
2715 | rib_delnode(rn, same); | |
2716 | ret = -1; | |
2717 | } | |
718e3744 | 2718 | |
d62a17ae | 2719 | route_unlock_node(rn); |
2720 | return ret; | |
2721 | } | |
2722 | ||
2723 | void rib_delete(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type, | |
d7c0a89a | 2724 | unsigned short instance, int flags, struct prefix *p, |
fd36be7e | 2725 | struct prefix_ipv6 *src_p, const struct nexthop *nh, |
bc541126 SW |
2726 | uint32_t nhe_id, uint32_t table_id, uint32_t metric, |
2727 | uint8_t distance, bool fromkernel) | |
d62a17ae | 2728 | { |
2729 | struct route_table *table; | |
2730 | struct route_node *rn; | |
2731 | struct route_entry *re; | |
2732 | struct route_entry *fib = NULL; | |
2733 | struct route_entry *same = NULL; | |
fd36be7e | 2734 | struct nexthop *rtnh; |
d62a17ae | 2735 | char buf2[INET6_ADDRSTRLEN]; |
5f7a4718 | 2736 | rib_dest_t *dest; |
d62a17ae | 2737 | |
1f610a1f | 2738 | assert(!src_p || !src_p->prefixlen || afi == AFI_IP6); |
d62a17ae | 2739 | |
2740 | /* Lookup table. */ | |
c7c0b007 SW |
2741 | table = zebra_vrf_lookup_table_with_table_id(afi, safi, vrf_id, |
2742 | table_id); | |
d62a17ae | 2743 | if (!table) |
2744 | return; | |
2745 | ||
2746 | /* Apply mask. */ | |
2747 | apply_mask(p); | |
2748 | if (src_p) | |
2749 | apply_mask_ipv6(src_p); | |
2750 | ||
2751 | /* Lookup route node. */ | |
2752 | rn = srcdest_rnode_lookup(table, p, src_p); | |
2753 | if (!rn) { | |
2754 | char dst_buf[PREFIX_STRLEN], src_buf[PREFIX_STRLEN]; | |
2755 | ||
2756 | prefix2str(p, dst_buf, sizeof(dst_buf)); | |
2757 | if (src_p && src_p->prefixlen) | |
2758 | prefix2str(src_p, src_buf, sizeof(src_buf)); | |
2759 | else | |
2760 | src_buf[0] = '\0'; | |
2761 | ||
82d7d0e2 DS |
2762 | if (IS_ZEBRA_DEBUG_RIB) { |
2763 | struct vrf *vrf = vrf_lookup_by_id(vrf_id); | |
2764 | ||
2765 | zlog_debug("%s[%d]:%s%s%s doesn't exist in rib", | |
2766 | vrf->name, table_id, dst_buf, | |
d62a17ae | 2767 | (src_buf[0] != '\0') ? " from " : "", |
2768 | src_buf); | |
82d7d0e2 | 2769 | } |
d62a17ae | 2770 | return; |
2771 | } | |
718e3744 | 2772 | |
5f7a4718 DS |
2773 | dest = rib_dest_from_rnode(rn); |
2774 | fib = dest->selected_fib; | |
2775 | ||
d62a17ae | 2776 | /* Lookup same type route. */ |
a2addae8 | 2777 | RNODE_FOREACH_RE (rn, re) { |
d62a17ae | 2778 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) |
2779 | continue; | |
2780 | ||
d62a17ae | 2781 | if (re->type != type) |
2782 | continue; | |
2783 | if (re->instance != instance) | |
2784 | continue; | |
40ecd8e4 DS |
2785 | if (CHECK_FLAG(re->flags, ZEBRA_FLAG_RR_USE_DISTANCE) && |
2786 | distance != re->distance) | |
2787 | continue; | |
2788 | ||
996c9314 | 2789 | if (re->type == ZEBRA_ROUTE_KERNEL && re->metric != metric) |
f19435a8 | 2790 | continue; |
0eb97b86 MS |
2791 | if (re->type == ZEBRA_ROUTE_CONNECT && |
2792 | (rtnh = re->nhe->nhg->nexthop) | |
fd36be7e DL |
2793 | && rtnh->type == NEXTHOP_TYPE_IFINDEX && nh) { |
2794 | if (rtnh->ifindex != nh->ifindex) | |
d62a17ae | 2795 | continue; |
d62a17ae | 2796 | same = re; |
2797 | break; | |
2798 | } | |
fec211ad | 2799 | |
d62a17ae | 2800 | /* Make sure that the route found has the same gateway. */ |
fec211ad | 2801 | if (nhe_id && re->nhe_id == nhe_id) { |
bc541126 SW |
2802 | same = re; |
2803 | break; | |
fec211ad SW |
2804 | } |
2805 | ||
2806 | if (nh == NULL) { | |
2807 | same = re; | |
2808 | break; | |
2809 | } | |
0eb97b86 | 2810 | for (ALL_NEXTHOPS_PTR(re->nhe->nhg, rtnh)) { |
fec211ad SW |
2811 | /* |
2812 | * No guarantee all kernel send nh with labels | |
2813 | * on delete. | |
2814 | */ | |
2815 | if (nexthop_same_no_labels(rtnh, nh)) { | |
d62a17ae | 2816 | same = re; |
2817 | break; | |
2818 | } | |
d62a17ae | 2819 | } |
fec211ad SW |
2820 | |
2821 | if (same) | |
2822 | break; | |
d62a17ae | 2823 | } |
2824 | /* If same type of route can't be found and this message is from | |
2825 | kernel. */ | |
2826 | if (!same) { | |
5dfeba19 DS |
2827 | /* |
2828 | * In the past(HA!) we could get here because | |
2829 | * we were receiving a route delete from the | |
2830 | * kernel and we're not marking the proto | |
2831 | * as coming from it's appropriate originator. | |
2832 | * Now that we are properly noticing the fact | |
2833 | * that the kernel has deleted our route we | |
2834 | * are not going to get called in this path | |
2835 | * I am going to leave this here because | |
2836 | * this might still work this way on non-linux | |
2837 | * platforms as well as some weird state I have | |
2838 | * not properly thought of yet. | |
2839 | * If we can show that this code path is | |
2840 | * dead then we can remove it. | |
2841 | */ | |
b8faa875 | 2842 | if (fib && CHECK_FLAG(flags, ZEBRA_FLAG_SELFROUTE)) { |
d62a17ae | 2843 | if (IS_ZEBRA_DEBUG_RIB) { |
2da33d6b DS |
2844 | rnode_debug(rn, vrf_id, |
2845 | "rn %p, re %p (%s) was deleted from kernel, adding", | |
2846 | rn, fib, | |
2847 | zebra_route_string(fib->type)); | |
d62a17ae | 2848 | } |
2849 | if (allow_delete) { | |
677c1dd5 | 2850 | UNSET_FLAG(fib->status, ROUTE_ENTRY_INSTALLED); |
d62a17ae | 2851 | /* Unset flags. */ |
0eb97b86 | 2852 | for (rtnh = fib->nhe->nhg->nexthop; rtnh; |
fd36be7e DL |
2853 | rtnh = rtnh->next) |
2854 | UNSET_FLAG(rtnh->flags, | |
d62a17ae | 2855 | NEXTHOP_FLAG_FIB); |
2856 | ||
ed216282 DS |
2857 | /* |
2858 | * This is a non FRR route | |
2859 | * as such we should mark | |
2860 | * it as deleted | |
2861 | */ | |
5f7a4718 | 2862 | dest->selected_fib = NULL; |
d62a17ae | 2863 | } else { |
2864 | /* This means someone else, other than Zebra, | |
2865 | * has deleted | |
2866 | * a Zebra router from the kernel. We will add | |
2867 | * it back */ | |
2868 | rib_install_kernel(rn, fib, NULL); | |
2869 | } | |
2870 | } else { | |
2871 | if (IS_ZEBRA_DEBUG_RIB) { | |
fd36be7e | 2872 | if (nh) |
d62a17ae | 2873 | rnode_debug( |
2874 | rn, vrf_id, | |
2875 | "via %s ifindex %d type %d " | |
2876 | "doesn't exist in rib", | |
36228974 | 2877 | inet_ntop(afi2family(afi), |
2878 | &nh->gate, buf2, | |
2879 | sizeof(buf2)), | |
2880 | nh->ifindex, type); | |
d62a17ae | 2881 | else |
2882 | rnode_debug( | |
2883 | rn, vrf_id, | |
fd36be7e DL |
2884 | "type %d doesn't exist in rib", |
2885 | type); | |
d62a17ae | 2886 | } |
2887 | route_unlock_node(rn); | |
2888 | return; | |
2889 | } | |
2890 | } | |
718e3744 | 2891 | |
5dfeba19 | 2892 | if (same) { |
996c9314 LB |
2893 | if (fromkernel && CHECK_FLAG(flags, ZEBRA_FLAG_SELFROUTE) |
2894 | && !allow_delete) { | |
5dfeba19 DS |
2895 | rib_install_kernel(rn, same, NULL); |
2896 | route_unlock_node(rn); | |
2897 | ||
2898 | return; | |
2899 | } | |
6134fd82 | 2900 | |
2b83602b | 2901 | /* Special handling for IPv4 or IPv6 routes sourced from |
2902 | * EVPN - the nexthop (and associated MAC) need to be | |
2903 | * uninstalled if no more refs. | |
2904 | */ | |
90264d64 | 2905 | if (CHECK_FLAG(flags, ZEBRA_FLAG_EVPN_ROUTE)) { |
6134fd82 | 2906 | struct nexthop *tmp_nh; |
2907 | ||
0eb97b86 | 2908 | for (ALL_NEXTHOPS_PTR(re->nhe->nhg, tmp_nh)) { |
6134fd82 | 2909 | struct ipaddr vtep_ip; |
2910 | ||
2911 | memset(&vtep_ip, 0, sizeof(struct ipaddr)); | |
1ec31309 | 2912 | if (afi == AFI_IP) { |
2913 | vtep_ip.ipa_type = IPADDR_V4; | |
2914 | memcpy(&(vtep_ip.ipaddr_v4), | |
2915 | &(tmp_nh->gate.ipv4), | |
2916 | sizeof(struct in_addr)); | |
2917 | } else { | |
2918 | vtep_ip.ipa_type = IPADDR_V6; | |
2919 | memcpy(&(vtep_ip.ipaddr_v6), | |
2920 | &(tmp_nh->gate.ipv6), | |
2921 | sizeof(struct in6_addr)); | |
2922 | } | |
a317a9b9 | 2923 | zebra_vxlan_evpn_vrf_route_del(re->vrf_id, |
6134fd82 | 2924 | &vtep_ip, p); |
2925 | } | |
2926 | } | |
cf363e1b MS |
2927 | |
2928 | /* Notify dplane if system route changes */ | |
2929 | if (RIB_SYSTEM_ROUTE(re)) | |
2930 | dplane_sys_route_del(rn, same); | |
2931 | ||
d62a17ae | 2932 | rib_delnode(rn, same); |
5dfeba19 | 2933 | } |
05737783 | 2934 | |
d62a17ae | 2935 | route_unlock_node(rn); |
2936 | return; | |
2937 | } | |
718e3744 | 2938 | |
718e3744 | 2939 | |
d7c0a89a QY |
2940 | int rib_add(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type, |
2941 | unsigned short instance, int flags, struct prefix *p, | |
2942 | struct prefix_ipv6 *src_p, const struct nexthop *nh, | |
8032b717 SW |
2943 | uint32_t nhe_id, uint32_t table_id, uint32_t metric, uint32_t mtu, |
2944 | uint8_t distance, route_tag_t tag) | |
d62a17ae | 2945 | { |
bbb322f2 SW |
2946 | struct route_entry *re = NULL; |
2947 | struct nexthop *nexthop = NULL; | |
0eb97b86 | 2948 | struct nexthop_group *ng = NULL; |
718e3744 | 2949 | |
66af6845 | 2950 | /* Allocate new route_entry structure. */ |
d62a17ae | 2951 | re = XCALLOC(MTYPE_RE, sizeof(struct route_entry)); |
d62a17ae | 2952 | re->type = type; |
2953 | re->instance = instance; | |
2954 | re->distance = distance; | |
2955 | re->flags = flags; | |
2956 | re->metric = metric; | |
2957 | re->mtu = mtu; | |
2958 | re->table = table_id; | |
2959 | re->vrf_id = vrf_id; | |
98572489 | 2960 | re->uptime = monotime(NULL); |
4e40b6d6 | 2961 | re->tag = tag; |
bbb322f2 SW |
2962 | re->nhe_id = nhe_id; |
2963 | ||
0eb97b86 MS |
2964 | /* If the owner of the route supplies a shared nexthop-group id, |
2965 | * we'll use that. Otherwise, pass the nexthop along directly. | |
2966 | */ | |
e22e8001 | 2967 | if (!nhe_id) { |
0eb97b86 | 2968 | ng = nexthop_group_new(); |
d62a17ae | 2969 | |
e22e8001 SW |
2970 | /* Add nexthop. */ |
2971 | nexthop = nexthop_new(); | |
2972 | *nexthop = *nh; | |
0eb97b86 | 2973 | nexthop_group_add_sorted(ng, nexthop); |
e22e8001 | 2974 | } |
718e3744 | 2975 | |
0eb97b86 | 2976 | return rib_add_multipath(afi, safi, p, src_p, re, ng); |
718e3744 | 2977 | } |
2978 | ||
2a99ab95 SW |
2979 | static const char *rib_update_event2str(rib_update_event_t event) |
2980 | { | |
2981 | const char *ret = "UNKNOWN"; | |
2982 | ||
2983 | switch (event) { | |
2984 | case RIB_UPDATE_KERNEL: | |
2985 | ret = "RIB_UPDATE_KERNEL"; | |
2986 | break; | |
2987 | case RIB_UPDATE_RMAP_CHANGE: | |
2988 | ret = "RIB_UPDATE_RMAP_CHANGE"; | |
2989 | break; | |
2990 | case RIB_UPDATE_OTHER: | |
2991 | ret = "RIB_UPDATE_OTHER"; | |
2992 | break; | |
2993 | case RIB_UPDATE_MAX: | |
2994 | break; | |
2995 | } | |
2996 | ||
2997 | return ret; | |
2998 | } | |
2999 | ||
3000 | ||
3001 | /* Schedule route nodes to be processed if they match the type */ | |
3002 | static void rib_update_route_node(struct route_node *rn, int type) | |
3003 | { | |
3004 | struct route_entry *re, *next; | |
3005 | bool re_changed = false; | |
3006 | ||
3007 | RNODE_FOREACH_RE_SAFE (rn, re, next) { | |
3008 | if (type == ZEBRA_ROUTE_ALL || type == re->type) { | |
3009 | SET_FLAG(re->status, ROUTE_ENTRY_CHANGED); | |
3010 | re_changed = true; | |
3011 | } | |
3012 | } | |
3013 | ||
3014 | if (re_changed) | |
3015 | rib_queue_add(rn); | |
3016 | } | |
3017 | ||
1c848137 | 3018 | /* Schedule routes of a particular table (address-family) based on event. */ |
d5b8c216 | 3019 | void rib_update_table(struct route_table *table, rib_update_event_t event) |
d62a17ae | 3020 | { |
3021 | struct route_node *rn; | |
2a99ab95 SW |
3022 | |
3023 | if (IS_ZEBRA_DEBUG_EVENT) { | |
3024 | struct zebra_vrf *zvrf; | |
3025 | struct vrf *vrf; | |
3026 | ||
3027 | zvrf = table->info ? ((rib_table_info_t *)table->info)->zvrf | |
3028 | : NULL; | |
3029 | vrf = zvrf ? zvrf->vrf : NULL; | |
3030 | ||
3031 | zlog_debug("%s: %s VRF %s Table %u event %s", __func__, | |
3032 | table->info ? afi2str( | |
3033 | ((rib_table_info_t *)table->info)->afi) | |
3034 | : "Unknown", | |
3035 | vrf ? vrf->name : "Unknown", | |
3036 | zvrf ? zvrf->table_id : 0, | |
3037 | rib_update_event2str(event)); | |
3038 | } | |
d62a17ae | 3039 | |
3040 | /* Walk all routes and queue for processing, if appropriate for | |
3041 | * the trigger event. | |
3042 | */ | |
3043 | for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) { | |
1ca60f2c DS |
3044 | /* |
3045 | * If we are looking at a route node and the node | |
3046 | * has already been queued we don't | |
3047 | * need to queue it up again | |
3048 | */ | |
2a99ab95 SW |
3049 | if (rn->info |
3050 | && CHECK_FLAG(rib_dest_from_rnode(rn)->flags, | |
3051 | RIB_ROUTE_ANY_QUEUED)) | |
1ca60f2c | 3052 | continue; |
2a99ab95 | 3053 | |
d62a17ae | 3054 | switch (event) { |
2a99ab95 SW |
3055 | case RIB_UPDATE_KERNEL: |
3056 | rib_update_route_node(rn, ZEBRA_ROUTE_KERNEL); | |
3057 | break; | |
d62a17ae | 3058 | case RIB_UPDATE_RMAP_CHANGE: |
3059 | case RIB_UPDATE_OTHER: | |
2a99ab95 | 3060 | rib_update_route_node(rn, ZEBRA_ROUTE_ALL); |
d62a17ae | 3061 | break; |
d62a17ae | 3062 | default: |
3063 | break; | |
3064 | } | |
3065 | } | |
b84c7253 | 3066 | } |
3067 | ||
2a99ab95 | 3068 | static void rib_update_handle_vrf(vrf_id_t vrf_id, rib_update_event_t event) |
718e3744 | 3069 | { |
d62a17ae | 3070 | struct route_table *table; |
1c848137 | 3071 | |
2a99ab95 SW |
3072 | if (IS_ZEBRA_DEBUG_EVENT) |
3073 | zlog_debug("%s: Handling VRF %s event %s", __func__, | |
3074 | vrf_id_to_name(vrf_id), rib_update_event2str(event)); | |
3075 | ||
d62a17ae | 3076 | /* Process routes of interested address-families. */ |
3077 | table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id); | |
2a99ab95 | 3078 | if (table) |
d62a17ae | 3079 | rib_update_table(table, event); |
718e3744 | 3080 | |
d62a17ae | 3081 | table = zebra_vrf_table(AFI_IP6, SAFI_UNICAST, vrf_id); |
2a99ab95 | 3082 | if (table) |
d62a17ae | 3083 | rib_update_table(table, event); |
2a99ab95 SW |
3084 | } |
3085 | ||
3086 | static void rib_update_handle_vrf_all(rib_update_event_t event) | |
3087 | { | |
3088 | struct zebra_router_table *zrt; | |
3089 | ||
3090 | if (IS_ZEBRA_DEBUG_EVENT) | |
3091 | zlog_debug("%s: Handling VRF (ALL) event %s", __func__, | |
3092 | rib_update_event2str(event)); | |
3093 | ||
3094 | /* Just iterate over all the route tables, rather than vrf lookups */ | |
3095 | RB_FOREACH (zrt, zebra_router_table_head, &zrouter.tables) | |
3096 | rib_update_table(zrt->table, event); | |
3097 | } | |
3098 | ||
3099 | struct rib_update_ctx { | |
3100 | rib_update_event_t event; | |
3101 | bool vrf_all; | |
3102 | vrf_id_t vrf_id; | |
3103 | }; | |
3104 | ||
3105 | static struct rib_update_ctx *rib_update_ctx_init(vrf_id_t vrf_id, | |
3106 | rib_update_event_t event) | |
3107 | { | |
3108 | struct rib_update_ctx *ctx; | |
3109 | ||
3110 | ctx = XCALLOC(MTYPE_RIB_UPDATE_CTX, sizeof(struct rib_update_ctx)); | |
3111 | ||
3112 | ctx->event = event; | |
3113 | ctx->vrf_id = vrf_id; | |
3114 | ||
3115 | return ctx; | |
3116 | } | |
3117 | ||
3118 | static void rib_update_ctx_fini(struct rib_update_ctx **ctx) | |
3119 | { | |
3120 | XFREE(MTYPE_RIB_UPDATE_CTX, *ctx); | |
3121 | ||
3122 | *ctx = NULL; | |
3123 | } | |
3124 | ||
3125 | static int rib_update_handler(struct thread *thread) | |
3126 | { | |
3127 | struct rib_update_ctx *ctx; | |
3128 | ||
3129 | ctx = THREAD_ARG(thread); | |
3130 | ||
3131 | if (ctx->vrf_all) | |
3132 | rib_update_handle_vrf_all(ctx->event); | |
3133 | else | |
3134 | rib_update_handle_vrf(ctx->vrf_id, ctx->event); | |
3135 | ||
3136 | rib_update_ctx_fini(&ctx); | |
3137 | ||
3138 | return 0; | |
3139 | } | |
3140 | ||
3141 | /* | |
3142 | * Thread list to ensure we don't schedule a ton of events | |
3143 | * if interfaces are flapping for instance. | |
3144 | */ | |
3145 | static struct thread *t_rib_update_threads[RIB_UPDATE_MAX]; | |
3146 | ||
3147 | /* Schedule a RIB update event for specific vrf */ | |
3148 | void rib_update_vrf(vrf_id_t vrf_id, rib_update_event_t event) | |
3149 | { | |
3150 | struct rib_update_ctx *ctx; | |
3151 | ||
3152 | ctx = rib_update_ctx_init(vrf_id, event); | |
3153 | ||
3154 | /* Don't worry about making sure multiple rib updates for specific vrf | |
3155 | * are scheduled at once for now. If it becomes a problem, we can use a | |
3156 | * lookup of some sort to keep track of running threads via t_vrf_id | |
3157 | * like how we are doing it in t_rib_update_threads[]. | |
3158 | */ | |
3159 | thread_add_event(zrouter.master, rib_update_handler, ctx, 0, NULL); | |
3160 | ||
3161 | if (IS_ZEBRA_DEBUG_EVENT) | |
3162 | zlog_debug("%s: Scheduled VRF %s, event %s", __func__, | |
3163 | vrf_id_to_name(ctx->vrf_id), | |
3164 | rib_update_event2str(event)); | |
3165 | } | |
3166 | ||
3167 | /* Schedule a RIB update event for all vrfs */ | |
3168 | void rib_update(rib_update_event_t event) | |
3169 | { | |
3170 | struct rib_update_ctx *ctx; | |
3171 | ||
3172 | ctx = rib_update_ctx_init(0, event); | |
3173 | ||
3174 | ctx->vrf_all = true; | |
3175 | ||
3176 | if (!thread_add_event(zrouter.master, rib_update_handler, ctx, 0, | |
3177 | &t_rib_update_threads[event])) | |
3178 | rib_update_ctx_fini(&ctx); /* Already scheduled */ | |
3179 | else if (IS_ZEBRA_DEBUG_EVENT) | |
3180 | zlog_debug("%s: Schedued VRF (ALL), event %s", __func__, | |
3181 | rib_update_event2str(event)); | |
718e3744 | 3182 | } |
3183 | ||
718e3744 | 3184 | /* Delete self installed routes after zebra is relaunched. */ |
95a29032 | 3185 | void rib_sweep_table(struct route_table *table) |
d62a17ae | 3186 | { |
3187 | struct route_node *rn; | |
3188 | struct route_entry *re; | |
3189 | struct route_entry *next; | |
915902cb | 3190 | struct nexthop *nexthop; |
d62a17ae | 3191 | |
915902cb DS |
3192 | if (!table) |
3193 | return; | |
d62a17ae | 3194 | |
915902cb | 3195 | for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) { |
a2addae8 | 3196 | RNODE_FOREACH_RE_SAFE (rn, re, next) { |
d4644d41 | 3197 | |
915902cb DS |
3198 | if (IS_ZEBRA_DEBUG_RIB) |
3199 | route_entry_dump(&rn->p, NULL, re); | |
3200 | ||
3201 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) | |
3202 | continue; | |
3203 | ||
3204 | if (!CHECK_FLAG(re->flags, ZEBRA_FLAG_SELFROUTE)) | |
3205 | continue; | |
3206 | ||
d4644d41 DS |
3207 | /* |
3208 | * If routes are older than startup_time then | |
3209 | * we know we read them in from the kernel. | |
3210 | * As such we can safely remove them. | |
3211 | */ | |
3212 | if (zrouter.startup_time < re->uptime) | |
3213 | continue; | |
3214 | ||
915902cb DS |
3215 | /* |
3216 | * So we are starting up and have received | |
3217 | * routes from the kernel that we have installed | |
3218 | * from a previous run of zebra but not cleaned | |
3219 | * up ( say a kill -9 ) | |
3220 | * But since we haven't actually installed | |
3221 | * them yet( we received them from the kernel ) | |
3222 | * we don't think they are active. | |
3223 | * So let's pretend they are active to actually | |
3224 | * remove them. | |
3225 | * In all honesty I'm not sure if we should | |
3226 | * mark them as active when we receive them | |
3227 | * This is startup only so probably ok. | |
3228 | * | |
3229 | * If we ever decide to move rib_sweep_table | |
3230 | * to a different spot (ie startup ) | |
3231 | * this decision needs to be revisited | |
3232 | */ | |
677c1dd5 | 3233 | SET_FLAG(re->status, ROUTE_ENTRY_INSTALLED); |
0eb97b86 | 3234 | for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop)) |
915902cb DS |
3235 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); |
3236 | ||
0c555cc6 DS |
3237 | rib_uninstall_kernel(rn, re); |
3238 | rib_delnode(rn, re); | |
915902cb DS |
3239 | } |
3240 | } | |
718e3744 | 3241 | } |
3242 | ||
3243 | /* Sweep all RIB tables. */ | |
d4644d41 | 3244 | int rib_sweep_route(struct thread *t) |
718e3744 | 3245 | { |
d62a17ae | 3246 | struct vrf *vrf; |
3247 | struct zebra_vrf *zvrf; | |
78104b9b | 3248 | |
a2addae8 | 3249 | RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) { |
915902cb DS |
3250 | if ((zvrf = vrf->info) == NULL) |
3251 | continue; | |
3252 | ||
d62a17ae | 3253 | rib_sweep_table(zvrf->table[AFI_IP][SAFI_UNICAST]); |
3254 | rib_sweep_table(zvrf->table[AFI_IP6][SAFI_UNICAST]); | |
3255 | } | |
95a29032 | 3256 | |
89272910 | 3257 | zebra_router_sweep_route(); |
38e40db1 | 3258 | zebra_router_sweep_nhgs(); |
d4644d41 DS |
3259 | |
3260 | return 0; | |
718e3744 | 3261 | } |
2ea1ab1c VT |
3262 | |
3263 | /* Remove specific by protocol routes from 'table'. */ | |
d7c0a89a | 3264 | unsigned long rib_score_proto_table(uint8_t proto, unsigned short instance, |
47a08aa9 | 3265 | struct route_table *table) |
d62a17ae | 3266 | { |
3267 | struct route_node *rn; | |
3268 | struct route_entry *re; | |
3269 | struct route_entry *next; | |
3270 | unsigned long n = 0; | |
3271 | ||
3272 | if (table) | |
3273 | for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) | |
a2addae8 | 3274 | RNODE_FOREACH_RE_SAFE (rn, re, next) { |
d62a17ae | 3275 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) |
3276 | continue; | |
3277 | if (re->type == proto | |
3278 | && re->instance == instance) { | |
3279 | rib_delnode(rn, re); | |
3280 | n++; | |
3281 | } | |
3282 | } | |
3283 | return n; | |
2ea1ab1c VT |
3284 | } |
3285 | ||
3286 | /* Remove specific by protocol routes. */ | |
d7c0a89a | 3287 | unsigned long rib_score_proto(uint8_t proto, unsigned short instance) |
2ea1ab1c | 3288 | { |
d62a17ae | 3289 | struct vrf *vrf; |
3290 | struct zebra_vrf *zvrf; | |
d8612e65 | 3291 | struct other_route_table *ort; |
d62a17ae | 3292 | unsigned long cnt = 0; |
78104b9b | 3293 | |
d8612e65 DS |
3294 | RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) { |
3295 | zvrf = vrf->info; | |
3296 | if (!zvrf) | |
3297 | continue; | |
78104b9b | 3298 | |
d8612e65 DS |
3299 | cnt += rib_score_proto_table(proto, instance, |
3300 | zvrf->table[AFI_IP][SAFI_UNICAST]) | |
3301 | + rib_score_proto_table( | |
3302 | proto, instance, | |
3303 | zvrf->table[AFI_IP6][SAFI_UNICAST]); | |
3304 | ||
81fddbe7 | 3305 | frr_each(otable, &zvrf->other_tables, ort) cnt += |
d8612e65 DS |
3306 | rib_score_proto_table(proto, instance, ort->table); |
3307 | } | |
47a08aa9 | 3308 | |
d62a17ae | 3309 | return cnt; |
2ea1ab1c VT |
3310 | } |
3311 | ||
718e3744 | 3312 | /* Close RIB and clean up kernel routes. */ |
d62a17ae | 3313 | void rib_close_table(struct route_table *table) |
718e3744 | 3314 | { |
d62a17ae | 3315 | struct route_node *rn; |
1e9f448f | 3316 | rib_table_info_t *info; |
5f7a4718 | 3317 | rib_dest_t *dest; |
718e3744 | 3318 | |
1e9f448f DS |
3319 | if (!table) |
3320 | return; | |
9fd92e3c | 3321 | |
6ca30e9e | 3322 | info = route_table_get_info(table); |
5adc2528 | 3323 | |
5f7a4718 DS |
3324 | for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) { |
3325 | dest = rib_dest_from_rnode(rn); | |
1e9f448f | 3326 | |
5f7a4718 | 3327 | if (dest && dest->selected_fib) { |
1e9f448f DS |
3328 | if (info->safi == SAFI_UNICAST) |
3329 | hook_call(rib_update, rn, NULL); | |
3330 | ||
3cdba47a DS |
3331 | rib_uninstall_kernel(rn, dest->selected_fib); |
3332 | dest->selected_fib = NULL; | |
1e9f448f | 3333 | } |
5f7a4718 | 3334 | } |
718e3744 | 3335 | } |
3336 | ||
9bd9717b MS |
3337 | /* |
3338 | * Handler for async dataplane results after a pseudowire installation | |
3339 | */ | |
3340 | static int handle_pw_result(struct zebra_dplane_ctx *ctx) | |
3341 | { | |
9bd9717b MS |
3342 | struct zebra_pw *pw; |
3343 | struct zebra_vrf *vrf; | |
3344 | ||
3345 | /* The pseudowire code assumes success - we act on an error | |
3346 | * result for installation attempts here. | |
3347 | */ | |
3348 | if (dplane_ctx_get_op(ctx) != DPLANE_OP_PW_INSTALL) | |
3349 | goto done; | |
3350 | ||
3351 | if (dplane_ctx_get_status(ctx) != ZEBRA_DPLANE_REQUEST_SUCCESS) { | |
3352 | vrf = zebra_vrf_lookup_by_id(dplane_ctx_get_vrf(ctx)); | |
7c7ef4a8 | 3353 | pw = zebra_pw_find(vrf, dplane_ctx_get_ifname(ctx)); |
9bd9717b MS |
3354 | if (pw) |
3355 | zebra_pw_install_failure(pw); | |
3356 | } | |
3357 | ||
3358 | done: | |
3359 | ||
9f2d0354 | 3360 | return 0; |
9bd9717b MS |
3361 | } |
3362 | ||
3363 | ||
7cdb1a84 | 3364 | /* |
d37f4d6c MS |
3365 | * Handle results from the dataplane system. Dequeue update context |
3366 | * structs, dispatch to appropriate internal handlers. | |
7cdb1a84 MS |
3367 | */ |
3368 | static int rib_process_dplane_results(struct thread *thread) | |
3369 | { | |
25779064 | 3370 | struct zebra_dplane_ctx *ctx; |
4c206c8f | 3371 | struct dplane_ctx_q ctxlist; |
2fc69f03 | 3372 | bool shut_p = false; |
4c206c8f MS |
3373 | |
3374 | /* Dequeue a list of completed updates with one lock/unlock cycle */ | |
7cdb1a84 MS |
3375 | |
3376 | do { | |
4c206c8f MS |
3377 | TAILQ_INIT(&ctxlist); |
3378 | ||
7cdb1a84 | 3379 | /* Take lock controlling queue of results */ |
00dffa8c | 3380 | frr_with_mutex(&dplane_mutex) { |
d37f4d6c | 3381 | /* Dequeue list of context structs */ |
4c206c8f | 3382 | dplane_ctx_list_append(&ctxlist, &rib_dplane_q); |
7cdb1a84 | 3383 | } |
7cdb1a84 | 3384 | |
4c206c8f MS |
3385 | /* Dequeue context block */ |
3386 | ctx = dplane_ctx_dequeue(&ctxlist); | |
3387 | ||
3388 | /* If we've emptied the results queue, we're done */ | |
3389 | if (ctx == NULL) | |
7cdb1a84 | 3390 | break; |
7cdb1a84 | 3391 | |
2fc69f03 MS |
3392 | /* If zebra is shutting down, avoid processing results, |
3393 | * just drain the results queue. | |
3394 | */ | |
3395 | shut_p = atomic_load_explicit(&zrouter.in_shutdown, | |
3396 | memory_order_relaxed); | |
3397 | if (shut_p) { | |
3398 | while (ctx) { | |
3399 | dplane_ctx_fini(&ctx); | |
3400 | ||
3401 | ctx = dplane_ctx_dequeue(&ctxlist); | |
3402 | } | |
3403 | ||
3404 | continue; | |
3405 | } | |
3406 | ||
4c206c8f | 3407 | while (ctx) { |
d37f4d6c MS |
3408 | switch (dplane_ctx_get_op(ctx)) { |
3409 | case DPLANE_OP_ROUTE_INSTALL: | |
3410 | case DPLANE_OP_ROUTE_UPDATE: | |
3411 | case DPLANE_OP_ROUTE_DELETE: | |
188a00e0 MS |
3412 | { |
3413 | /* Bit of special case for route updates | |
3414 | * that were generated by async notifications: | |
3415 | * we don't want to continue processing these | |
3416 | * in the rib. | |
3417 | */ | |
3418 | if (dplane_ctx_get_notif_provider(ctx) == 0) | |
3419 | rib_process_result(ctx); | |
3420 | else | |
3421 | dplane_ctx_fini(&ctx); | |
3422 | } | |
3423 | break; | |
d37f4d6c | 3424 | |
54818e3b MS |
3425 | case DPLANE_OP_ROUTE_NOTIFY: |
3426 | rib_process_dplane_notify(ctx); | |
d37f4d6c MS |
3427 | break; |
3428 | ||
9865e1c3 SW |
3429 | case DPLANE_OP_NH_INSTALL: |
3430 | case DPLANE_OP_NH_UPDATE: | |
3431 | case DPLANE_OP_NH_DELETE: | |
3432 | zebra_nhg_dplane_result(ctx); | |
3433 | break; | |
3434 | ||
d37f4d6c MS |
3435 | case DPLANE_OP_LSP_INSTALL: |
3436 | case DPLANE_OP_LSP_UPDATE: | |
3437 | case DPLANE_OP_LSP_DELETE: | |
188a00e0 MS |
3438 | { |
3439 | /* Bit of special case for LSP updates | |
3440 | * that were generated by async notifications: | |
3441 | * we don't want to continue processing these. | |
3442 | */ | |
3443 | if (dplane_ctx_get_notif_provider(ctx) == 0) | |
3444 | zebra_mpls_lsp_dplane_result(ctx); | |
3445 | else | |
3446 | dplane_ctx_fini(&ctx); | |
3447 | } | |
3448 | break; | |
d37f4d6c | 3449 | |
104e3ad9 MS |
3450 | case DPLANE_OP_LSP_NOTIFY: |
3451 | zebra_mpls_process_dplane_notify(ctx); | |
d37f4d6c MS |
3452 | break; |
3453 | ||
9bd9717b MS |
3454 | case DPLANE_OP_PW_INSTALL: |
3455 | case DPLANE_OP_PW_UNINSTALL: | |
3456 | handle_pw_result(ctx); | |
3457 | break; | |
3458 | ||
cf363e1b MS |
3459 | case DPLANE_OP_SYS_ROUTE_ADD: |
3460 | case DPLANE_OP_SYS_ROUTE_DELETE: | |
3461 | /* No further processing in zebra for these. */ | |
3462 | dplane_ctx_fini(&ctx); | |
3463 | break; | |
3464 | ||
036d93c0 MS |
3465 | case DPLANE_OP_MAC_INSTALL: |
3466 | case DPLANE_OP_MAC_DELETE: | |
3467 | zebra_vxlan_handle_result(ctx); | |
3468 | break; | |
3469 | ||
931fa60c MS |
3470 | /* Some op codes not handled here */ |
3471 | case DPLANE_OP_ADDR_INSTALL: | |
3472 | case DPLANE_OP_ADDR_UNINSTALL: | |
3473 | case DPLANE_OP_NEIGH_INSTALL: | |
3474 | case DPLANE_OP_NEIGH_UPDATE: | |
3475 | case DPLANE_OP_NEIGH_DELETE: | |
0bbd4ff4 MS |
3476 | case DPLANE_OP_VTEP_ADD: |
3477 | case DPLANE_OP_VTEP_DELETE: | |
931fa60c | 3478 | case DPLANE_OP_NONE: |
d37f4d6c MS |
3479 | /* Don't expect this: just return the struct? */ |
3480 | dplane_ctx_fini(&ctx); | |
3481 | break; | |
931fa60c | 3482 | |
d37f4d6c | 3483 | } /* Dispatch by op code */ |
4c206c8f MS |
3484 | |
3485 | ctx = dplane_ctx_dequeue(&ctxlist); | |
3486 | } | |
3487 | ||
5709131c | 3488 | } while (1); |
7cdb1a84 | 3489 | |
5709131c | 3490 | return 0; |
7cdb1a84 MS |
3491 | } |
3492 | ||
3493 | /* | |
3494 | * Results are returned from the dataplane subsystem, in the context of | |
1bcea841 | 3495 | * the dataplane pthread. We enqueue the results here for processing by |
7cdb1a84 MS |
3496 | * the main thread later. |
3497 | */ | |
4c206c8f | 3498 | static int rib_dplane_results(struct dplane_ctx_q *ctxlist) |
7cdb1a84 MS |
3499 | { |
3500 | /* Take lock controlling queue of results */ | |
00dffa8c | 3501 | frr_with_mutex(&dplane_mutex) { |
4c206c8f MS |
3502 | /* Enqueue context blocks */ |
3503 | dplane_ctx_list_append(&rib_dplane_q, ctxlist); | |
7cdb1a84 | 3504 | } |
7cdb1a84 | 3505 | |
4c206c8f | 3506 | /* Ensure event is signalled to zebra main pthread */ |
3801e764 | 3507 | thread_add_event(zrouter.master, rib_process_dplane_results, NULL, 0, |
7cdb1a84 MS |
3508 | &t_dplane); |
3509 | ||
5709131c | 3510 | return 0; |
7cdb1a84 MS |
3511 | } |
3512 | ||
eaa2716d SW |
3513 | /* |
3514 | * Ensure there are no empty slots in the route_info array. | |
3515 | * Every route type in zebra should be present there. | |
3516 | */ | |
3517 | static void check_route_info(void) | |
3518 | { | |
3519 | int len = array_size(route_info); | |
3520 | ||
3521 | /* | |
3522 | * ZEBRA_ROUTE_SYSTEM is special cased since | |
3523 | * its key is 0 anyway. | |
3524 | * | |
3525 | * ZEBRA_ROUTE_ALL is also ignored. | |
3526 | */ | |
3527 | for (int i = 0; i < len; i++) { | |
3528 | if (i == ZEBRA_ROUTE_SYSTEM || i == ZEBRA_ROUTE_ALL) | |
3529 | continue; | |
3530 | assert(route_info[i].key); | |
8dc7a759 | 3531 | assert(route_info[i].meta_q_map < MQ_SIZE); |
eaa2716d SW |
3532 | } |
3533 | } | |
3534 | ||
718e3744 | 3535 | /* Routing information base initialize. */ |
d62a17ae | 3536 | void rib_init(void) |
718e3744 | 3537 | { |
eaa2716d SW |
3538 | check_route_info(); |
3539 | ||
2561d12e | 3540 | rib_queue_init(); |
7cdb1a84 MS |
3541 | |
3542 | /* Init dataplane, and register for results */ | |
3543 | pthread_mutex_init(&dplane_mutex, NULL); | |
3544 | TAILQ_INIT(&rib_dplane_q); | |
4c206c8f | 3545 | zebra_dplane_init(rib_dplane_results); |
718e3744 | 3546 | } |
0915bb0c AS |
3547 | |
3548 | /* | |
3549 | * vrf_id_get_next | |
3550 | * | |
3551 | * Get the first vrf id that is greater than the given vrf id if any. | |
3552 | * | |
2951a7a4 | 3553 | * Returns true if a vrf id was found, false otherwise. |
0915bb0c | 3554 | */ |
d62a17ae | 3555 | static inline int vrf_id_get_next(vrf_id_t vrf_id, vrf_id_t *next_id_p) |
0915bb0c | 3556 | { |
d62a17ae | 3557 | struct vrf *vrf; |
b72ede27 | 3558 | |
d62a17ae | 3559 | vrf = vrf_lookup_by_id(vrf_id); |
3560 | if (vrf) { | |
3561 | vrf = RB_NEXT(vrf_id_head, vrf); | |
3562 | if (vrf) { | |
3563 | *next_id_p = vrf->vrf_id; | |
3564 | return 1; | |
3565 | } | |
3566 | } | |
0915bb0c | 3567 | |
d62a17ae | 3568 | return 0; |
0915bb0c AS |
3569 | } |
3570 | ||
3571 | /* | |
3572 | * rib_tables_iter_next | |
3573 | * | |
3574 | * Returns the next table in the iteration. | |
3575 | */ | |
d62a17ae | 3576 | struct route_table *rib_tables_iter_next(rib_tables_iter_t *iter) |
3577 | { | |
3578 | struct route_table *table; | |
3579 | ||
3580 | /* | |
3581 | * Array that helps us go over all AFI/SAFI combinations via one | |
3582 | * index. | |
3583 | */ | |
2b64873d | 3584 | static const struct { |
d62a17ae | 3585 | afi_t afi; |
3586 | safi_t safi; | |
3587 | } afi_safis[] = { | |
3588 | {AFI_IP, SAFI_UNICAST}, {AFI_IP, SAFI_MULTICAST}, | |
3589 | {AFI_IP, SAFI_LABELED_UNICAST}, {AFI_IP6, SAFI_UNICAST}, | |
3590 | {AFI_IP6, SAFI_MULTICAST}, {AFI_IP6, SAFI_LABELED_UNICAST}, | |
3591 | }; | |
3592 | ||
3593 | table = NULL; | |
3594 | ||
3595 | switch (iter->state) { | |
3596 | ||
3597 | case RIB_TABLES_ITER_S_INIT: | |
3598 | iter->vrf_id = VRF_DEFAULT; | |
3599 | iter->afi_safi_ix = -1; | |
3600 | ||
3601 | /* Fall through */ | |
3602 | ||
3603 | case RIB_TABLES_ITER_S_ITERATING: | |
3604 | iter->afi_safi_ix++; | |
3605 | while (1) { | |
3606 | ||
3607 | while (iter->afi_safi_ix | |
7e3a1ec7 | 3608 | < (int)array_size(afi_safis)) { |
d62a17ae | 3609 | table = zebra_vrf_table( |
3610 | afi_safis[iter->afi_safi_ix].afi, | |
3611 | afi_safis[iter->afi_safi_ix].safi, | |
3612 | iter->vrf_id); | |
3613 | if (table) | |
3614 | break; | |
3615 | ||
3616 | iter->afi_safi_ix++; | |
3617 | } | |
3618 | ||
3619 | /* | |
3620 | * Found another table in this vrf. | |
3621 | */ | |
3622 | if (table) | |
3623 | break; | |
3624 | ||
3625 | /* | |
3626 | * Done with all tables in the current vrf, go to the | |
3627 | * next | |
3628 | * one. | |
3629 | */ | |
3630 | if (!vrf_id_get_next(iter->vrf_id, &iter->vrf_id)) | |
3631 | break; | |
3632 | ||
3633 | iter->afi_safi_ix = 0; | |
3634 | } | |
0915bb0c | 3635 | |
0915bb0c AS |
3636 | break; |
3637 | ||
d62a17ae | 3638 | case RIB_TABLES_ITER_S_DONE: |
3639 | return NULL; | |
0915bb0c AS |
3640 | } |
3641 | ||
d62a17ae | 3642 | if (table) |
3643 | iter->state = RIB_TABLES_ITER_S_ITERATING; | |
3644 | else | |
3645 | iter->state = RIB_TABLES_ITER_S_DONE; | |
0915bb0c | 3646 | |
d62a17ae | 3647 | return table; |
0915bb0c | 3648 | } |