]> git.proxmox.com Git - mirror_frr.git/blob - zebra/zebra_rib.c
Merge pull request #5614 from qlyoung/fix-zebra-zapi-crashes
[mirror_frr.git] / zebra / zebra_rib.c
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 *
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
19 */
20
21 #include <zebra.h>
22
23 #include "command.h"
24 #include "if.h"
25 #include "linklist.h"
26 #include "log.h"
27 #include "memory.h"
28 #include "mpls.h"
29 #include "nexthop.h"
30 #include "prefix.h"
31 #include "prefix.h"
32 #include "routemap.h"
33 #include "sockunion.h"
34 #include "srcdest_table.h"
35 #include "table.h"
36 #include "thread.h"
37 #include "vrf.h"
38 #include "workqueue.h"
39 #include "nexthop_group_private.h"
40 #include "frr_pthread.h"
41
42 #include "zebra/zebra_router.h"
43 #include "zebra/connected.h"
44 #include "zebra/debug.h"
45 #include "zebra/interface.h"
46 #include "zebra/redistribute.h"
47 #include "zebra/rib.h"
48 #include "zebra/rt.h"
49 #include "zebra/zapi_msg.h"
50 #include "zebra/zebra_errors.h"
51 #include "zebra/zebra_memory.h"
52 #include "zebra/zebra_ns.h"
53 #include "zebra/zebra_rnh.h"
54 #include "zebra/zebra_routemap.h"
55 #include "zebra/zebra_vrf.h"
56 #include "zebra/zebra_vxlan.h"
57 #include "zebra/zapi_msg.h"
58 #include "zebra/zebra_dplane.h"
59
60 DEFINE_MTYPE_STATIC(ZEBRA, RIB_UPDATE_CTX, "Rib update context object");
61
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;
67 static struct dplane_ctx_q rib_dplane_q;
68
69 DEFINE_HOOK(rib_update, (struct route_node * rn, const char *reason),
70 (rn, reason))
71
72 /* Should we allow non Quagga processes to delete our routes */
73 extern int allow_delete;
74
75 /* Each route type's string and default distance value. */
76 static const struct {
77 int key;
78 uint8_t distance;
79 uint8_t meta_q_map;
80 } route_info[ZEBRA_ROUTE_MAX] = {
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}
110 /* Any new route type added to zebra, should be mirrored here */
111
112 /* no entry/default: 150 */
113 };
114
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, ...)
118 {
119 char buf[SRCDEST2STR_BUFFER + sizeof(" (MRIB)")];
120 char msgbuf[512];
121 va_list ap;
122
123 va_start(ap, msgfmt);
124 vsnprintf(msgbuf, sizeof(msgbuf), msgfmt, ap);
125 va_end(ap);
126
127 if (rn) {
128 rib_table_info_t *info = srcdest_rnode_table_info(rn);
129 srcdest_rnode2str(rn, buf, sizeof(buf));
130
131 if (info->safi == SAFI_MULTICAST)
132 strlcat(buf, " (MRIB)", sizeof(buf));
133 } else {
134 snprintf(buf, sizeof(buf), "{(route_node *) NULL}");
135 }
136
137 zlog(priority, "%s: %d:%s: %s", _func, vrf_id, buf, msgbuf);
138 }
139
140 #define rnode_debug(node, vrf_id, ...) \
141 _rnode_zlog(__func__, vrf_id, node, LOG_DEBUG, __VA_ARGS__)
142 #define rnode_info(node, ...) \
143 _rnode_zlog(__func__, vrf_id, node, LOG_INFO, __VA_ARGS__)
144
145 uint8_t route_distance(int type)
146 {
147 uint8_t distance;
148
149 if ((unsigned)type >= array_size(route_info))
150 distance = 150;
151 else
152 distance = route_info[type].distance;
153
154 return distance;
155 }
156
157 int is_zebra_valid_kernel_table(uint32_t table_id)
158 {
159 #ifdef linux
160 if ((table_id == RT_TABLE_UNSPEC) || (table_id == RT_TABLE_LOCAL)
161 || (table_id == RT_TABLE_COMPAT))
162 return 0;
163 #endif
164
165 return 1;
166 }
167
168 int is_zebra_main_routing_table(uint32_t table_id)
169 {
170 if (table_id == RT_TABLE_MAIN)
171 return 1;
172 return 0;
173 }
174
175 int zebra_check_addr(const struct prefix *p)
176 {
177 if (p->family == AF_INET) {
178 uint32_t addr;
179
180 addr = p->u.prefix4.s_addr;
181 addr = ntohl(addr);
182
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;
194 }
195
196 /**
197 * copy_nexthop - copy a nexthop to the rib structure.
198 */
199 void route_entry_copy_nexthops(struct route_entry *re, struct nexthop *nh)
200 {
201 assert(!re->nhe->nhg->nexthop);
202 copy_nexthops(&re->nhe->nhg->nexthop, nh, NULL);
203 }
204
205 static void route_entry_attach_ref(struct route_entry *re,
206 struct nhg_hash_entry *new)
207 {
208 re->nhe = new;
209 re->nhe_id = new->id;
210
211 zebra_nhg_increment_ref(new);
212 }
213
214 int route_entry_update_nhe(struct route_entry *re, struct nhg_hash_entry *new)
215 {
216 struct nhg_hash_entry *old = NULL;
217 int ret = 0;
218
219 if (new == NULL) {
220 re->nhe->nhg = NULL;
221 goto done;
222 }
223
224 if (re->nhe_id != new->id) {
225 old = zebra_nhg_lookup_id(re->nhe_id);
226
227 route_entry_attach_ref(re, new);
228
229 if (old)
230 zebra_nhg_decrement_ref(old);
231 } else if (!re->nhe)
232 /* This is the first time it's being attached */
233 route_entry_attach_ref(re, new);
234
235 done:
236 return ret;
237 }
238
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;
245 struct route_entry *match = NULL;
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 }
261
262 rn = route_node_match(table, (struct prefix *)&p);
263
264 while (rn) {
265 rib_dest_t *dest;
266
267 route_unlock_node(rn);
268
269 dest = rib_dest_from_rnode(rn);
270 if (dest && dest->selected_fib
271 && !CHECK_FLAG(dest->selected_fib->status,
272 ROUTE_ENTRY_REMOVED))
273 match = dest->selected_fib;
274
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) {
285 if (!CHECK_FLAG(match->status,
286 ROUTE_ENTRY_INSTALLED))
287 return NULL;
288 }
289
290 if (rn_out)
291 *rn_out = rn;
292 return match;
293 }
294 }
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
306 switch (zrouter.ipv4_multicast_mode) {
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;
340 }
341
342 if (rn_out)
343 *rn_out = (re == mre) ? m_rn : u_rn;
344
345 if (IS_ZEBRA_DEBUG_RIB) {
346 char buf[BUFSIZ];
347 inet_ntop(AF_INET, &addr, buf, BUFSIZ);
348
349 zlog_debug("%s: %s: vrf: %u found %s, using %s",
350 __func__, buf, vrf_id,
351 mre ? (ure ? "MRIB+URIB" : "MRIB")
352 : ure ? "URIB" : "nothing",
353 re == ure ? "URIB" : re == mre ? "MRIB" : "none");
354 }
355 return re;
356 }
357
358 struct route_entry *rib_lookup_ipv4(struct prefix_ipv4 *p, vrf_id_t vrf_id)
359 {
360 struct route_table *table;
361 struct route_node *rn;
362 struct route_entry *match = NULL;
363 rib_dest_t *dest;
364
365 /* Lookup table. */
366 table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id);
367 if (!table)
368 return 0;
369
370 rn = route_node_lookup(table, (struct prefix *)p);
371
372 /* No route for this prefix. */
373 if (!rn)
374 return NULL;
375
376 /* Unlock node. */
377 route_unlock_node(rn);
378 dest = rib_dest_from_rnode(rn);
379
380 if (dest && dest->selected_fib
381 && !CHECK_FLAG(dest->selected_fib->status, ROUTE_ENTRY_REMOVED))
382 match = dest->selected_fib;
383
384 if (!match)
385 return NULL;
386
387 if (match->type == ZEBRA_ROUTE_CONNECT)
388 return match;
389
390 if (CHECK_FLAG(match->status, ROUTE_ENTRY_INSTALLED))
391 return match;
392
393 return NULL;
394 }
395
396 /*
397 * Is this RIB labeled-unicast? It must be of type BGP and all paths
398 * (nexthops) must have a label.
399 */
400 int zebra_rib_labeled_unicast(struct route_entry *re)
401 {
402 struct nexthop *nexthop = NULL;
403
404 if (re->type != ZEBRA_ROUTE_BGP)
405 return 0;
406
407 for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop))
408 if (!nexthop->nh_label || !nexthop->nh_label->num_labels)
409 return 0;
410
411 return 1;
412 }
413
414 /* Update flag indicates whether this is a "replace" or not. Currently, this
415 * is only used for IPv4.
416 */
417 void rib_install_kernel(struct route_node *rn, struct route_entry *re,
418 struct route_entry *old)
419 {
420 struct nexthop *nexthop;
421 rib_table_info_t *info = srcdest_rnode_table_info(rn);
422 struct zebra_vrf *zvrf = vrf_info_lookup(re->vrf_id);
423 const struct prefix *p, *src_p;
424 enum zebra_dplane_result ret;
425
426 rib_dest_t *dest = rib_dest_from_rnode(rn);
427
428 srcdest_rnode_prefixes(rn, &p, &src_p);
429
430 if (info->safi != SAFI_UNICAST) {
431 for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop))
432 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
433 return;
434 }
435
436
437 /*
438 * Install the resolved nexthop object first.
439 */
440 zebra_nhg_install_kernel(zebra_nhg_lookup_id(re->nhe_id));
441
442 /*
443 * If this is a replace to a new RE let the originator of the RE
444 * know that they've lost
445 */
446 if (old && (old != re) && (old->type != re->type))
447 zsend_route_notify_owner(old, p, ZAPI_ROUTE_BETTER_ADMIN_WON);
448
449 /* Update fib selection */
450 dest->selected_fib = re;
451
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");
457
458 /* Send add or update */
459 if (old)
460 ret = dplane_route_update(rn, re, old);
461 else
462 ret = dplane_route_add(rn, re);
463
464 switch (ret) {
465 case ZEBRA_DPLANE_REQUEST_QUEUED:
466 SET_FLAG(re->status, ROUTE_ENTRY_QUEUED);
467
468 if (old) {
469 SET_FLAG(old->status, ROUTE_ENTRY_QUEUED);
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 }
476 }
477
478 if (zvrf)
479 zvrf->installs_queued++;
480 break;
481 case ZEBRA_DPLANE_REQUEST_FAILURE:
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);
489 break;
490 }
491 case ZEBRA_DPLANE_REQUEST_SUCCESS:
492 if (zvrf)
493 zvrf->installs++;
494 break;
495 }
496
497 return;
498 }
499
500 /* Uninstall the route from kernel. */
501 void rib_uninstall_kernel(struct route_node *rn, struct route_entry *re)
502 {
503 struct nexthop *nexthop;
504 rib_table_info_t *info = srcdest_rnode_table_info(rn);
505 struct zebra_vrf *zvrf = vrf_info_lookup(re->vrf_id);
506
507 if (info->safi != SAFI_UNICAST) {
508 UNSET_FLAG(re->status, ROUTE_ENTRY_INSTALLED);
509 for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop))
510 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
511 return;
512 }
513
514 /*
515 * Make sure we update the FPM any time we send new information to
516 * the dataplane.
517 */
518 hook_call(rib_update, rn, "uninstalling from kernel");
519
520 switch (dplane_route_delete(rn, re)) {
521 case ZEBRA_DPLANE_REQUEST_QUEUED:
522 if (zvrf)
523 zvrf->removals_queued++;
524 break;
525 case ZEBRA_DPLANE_REQUEST_FAILURE:
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);
533 break;
534 }
535 case ZEBRA_DPLANE_REQUEST_SUCCESS:
536 if (zvrf)
537 zvrf->removals++;
538 break;
539 }
540
541 return;
542 }
543
544 /* Uninstall the route from kernel. */
545 static void rib_uninstall(struct route_node *rn, struct route_entry *re)
546 {
547 rib_table_info_t *info = srcdest_rnode_table_info(rn);
548 rib_dest_t *dest = rib_dest_from_rnode(rn);
549 struct nexthop *nexthop;
550
551 if (dest && dest->selected_fib == re) {
552 if (info->safi == SAFI_UNICAST)
553 hook_call(rib_update, rn, "rib_uninstall");
554
555 /* If labeled-unicast route, uninstall transit LSP. */
556 if (zebra_rib_labeled_unicast(re))
557 zebra_mpls_lsp_uninstall(info->zvrf, rn, re);
558
559 rib_uninstall_kernel(rn, re);
560
561 dest->selected_fib = NULL;
562
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
569 for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop))
570 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
571 }
572
573 if (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED)) {
574 const struct prefix *p, *src_p;
575
576 srcdest_rnode_prefixes(rn, &p, &src_p);
577
578 redistribute_delete(p, src_p, re, NULL);
579 UNSET_FLAG(re->flags, ZEBRA_FLAG_SELECTED);
580 }
581 }
582
583 /*
584 * rib_can_delete_dest
585 *
586 * Returns true if the given dest can be deleted from the table.
587 */
588 static int rib_can_delete_dest(rib_dest_t *dest)
589 {
590 if (re_list_first(&dest->routes)) {
591 return 0;
592 }
593
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
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;
611
612 return 1;
613 }
614
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);
618 struct rnh *rnh;
619
620 /*
621 * We are storing the rnh's associated withb
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) {
630 if (IS_ZEBRA_DEBUG_NHT_DETAILED) {
631 char buf[PREFIX_STRLEN];
632
633 zlog_debug("%s: %s Being examined for Nexthop Tracking Count: %zd",
634 __PRETTY_FUNCTION__,
635 srcdest_rnode2str(rn, buf, sizeof(buf)),
636 dest ? rnh_list_count(&dest->nht) : 0);
637 }
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 */
650 frr_each_safe(rnh_list, &dest->nht, rnh) {
651 struct zebra_vrf *zvrf =
652 zebra_vrf_lookup_by_id(rnh->vrf_id);
653 struct prefix *p = &rnh->node->p;
654
655 if (IS_ZEBRA_DEBUG_NHT_DETAILED) {
656 char buf1[PREFIX_STRLEN];
657 char buf2[PREFIX_STRLEN];
658
659 zlog_debug("%u:%s has Nexthop(%s) Type: %s depending on it, evaluating %u:%u",
660 zvrf->vrf->vrf_id,
661 srcdest_rnode2str(rn, buf1,
662 sizeof(buf1)),
663 prefix2str(p, buf2, sizeof(buf2)),
664 rnh_type2str(rnh->type),
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 */
680 if (rnh->seqno == seq) {
681 if (IS_ZEBRA_DEBUG_NHT_DETAILED)
682 zlog_debug(
683 "\tNode processed and moved already");
684 continue;
685 }
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
698 /*
699 * rib_gc_dest
700 *
701 * Garbage collect the rib dest corresponding to the given route node
702 * if appropriate.
703 *
704 * Returns true if the dest was deleted, false otherwise.
705 */
706 int rib_gc_dest(struct route_node *rn)
707 {
708 rib_dest_t *dest;
709
710 dest = rib_dest_from_rnode(rn);
711 if (!dest)
712 return 0;
713
714 if (!rib_can_delete_dest(dest))
715 return 0;
716
717 if (IS_ZEBRA_DEBUG_RIB) {
718 struct zebra_vrf *zvrf;
719
720 zvrf = rib_dest_vrf(dest);
721 rnode_debug(rn, zvrf_id(zvrf), "removing dest from table");
722 }
723
724 zebra_rib_evaluate_rn_nexthops(rn, zebra_router_get_next_sequence());
725
726 dest->rnode = NULL;
727 rnh_list_fini(&dest->nht);
728 XFREE(MTYPE_RIB_DEST, dest);
729 rn->info = NULL;
730
731 /*
732 * Release the one reference that we keep on the route node.
733 */
734 route_unlock_node(rn);
735 return 1;
736 }
737
738 static void rib_process_add_fib(struct zebra_vrf *zvrf, struct route_node *rn,
739 struct route_entry *new)
740 {
741 hook_call(rib_update, rn, "new route selected");
742
743 /* Update real nexthop. This may actually determine if nexthop is active
744 * or not. */
745 if (!nexthop_group_active_nexthop_num(new->nhe->nhg)) {
746 UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED);
747 return;
748 }
749
750 if (IS_ZEBRA_DEBUG_RIB) {
751 char buf[SRCDEST2STR_BUFFER];
752 srcdest_rnode2str(rn, buf, sizeof(buf));
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));
756 }
757
758 /* If labeled-unicast route, install transit LSP. */
759 if (zebra_rib_labeled_unicast(new))
760 zebra_mpls_lsp_install(zvrf, rn, new);
761
762 rib_install_kernel(rn, new, NULL);
763
764 UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED);
765 }
766
767 static void rib_process_del_fib(struct zebra_vrf *zvrf, struct route_node *rn,
768 struct route_entry *old)
769 {
770 hook_call(rib_update, rn, "removing existing route");
771
772 /* Uninstall from kernel. */
773 if (IS_ZEBRA_DEBUG_RIB) {
774 char buf[SRCDEST2STR_BUFFER];
775 srcdest_rnode2str(rn, buf, sizeof(buf));
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));
779 }
780
781 /* If labeled-unicast route, uninstall transit LSP. */
782 if (zebra_rib_labeled_unicast(old))
783 zebra_mpls_lsp_uninstall(zvrf, rn, old);
784
785 rib_uninstall_kernel(rn, old);
786
787 /* Update nexthop for route, reset changed flag. */
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 */
792 if (RIB_KERNEL_ROUTE(old))
793 SET_FLAG(old->status, ROUTE_ENTRY_REMOVED);
794 else
795 UNSET_FLAG(old->status, ROUTE_ENTRY_CHANGED);
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 {
803 int nh_active = 0;
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. */
814 if (nexthop_group_active_nexthop_num(new->nhe->nhg))
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(
829 "%u:%s: Updating route rn %p, re %p (%s) old %p (%s)",
830 zvrf_id(zvrf), buf, rn, new,
831 zebra_route_string(new->type),
832 old,
833 zebra_route_string(old->type));
834 else
835 zlog_debug(
836 "%u:%s: Updating route rn %p, re %p (%s)",
837 zvrf_id(zvrf), buf, rn, new,
838 zebra_route_string(new->type));
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
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);
852
853 rib_install_kernel(rn, new, old);
854 }
855
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 */
861 if (!nh_active) {
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(
867 "%u:%s: Deleting route rn %p, re %p (%s) old %p (%s) - nexthop inactive",
868 zvrf_id(zvrf), buf, rn, new,
869 zebra_route_string(new->type),
870 old,
871 zebra_route_string(old->type));
872 else
873 zlog_debug(
874 "%u:%s: Deleting route rn %p, re %p (%s) - nexthop inactive",
875 zvrf_id(zvrf), buf, rn, new,
876 zebra_route_string(new->type));
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
883 rib_uninstall_kernel(rn, old);
884 }
885 } else {
886 /*
887 * Same route selected; check if in the FIB and if not,
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
891 * to add routes.
892 */
893 if (!CHECK_FLAG(new->status, ROUTE_ENTRY_INSTALLED) ||
894 RIB_SYSTEM_ROUTE(new))
895 rib_install_kernel(rn, new, NULL);
896 }
897
898 /* Update prior route. */
899 if (new != old)
900 UNSET_FLAG(old->status, ROUTE_ENTRY_CHANGED);
901
902 /* Clear changed flag. */
903 UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED);
904 }
905
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
915 * - if both connected, loopback or vrf wins
916 * - lower distance beats higher
917 * - lower metric beats higher for equal distance
918 * - last, hence oldest, route wins tie break.
919 */
920
921 /* Connected routes. Check to see if either are a vrf
922 * or loopback interface. If not, pick the last connected
923 * route of the set of lowest metric connected routes.
924 */
925 if (alternate->type == ZEBRA_ROUTE_CONNECT) {
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
932 for (ALL_NEXTHOPS_PTR(alternate->nhe->nhg, nexthop)) {
933 struct interface *ifp = if_lookup_by_index(
934 nexthop->ifindex, alternate->vrf_id);
935
936 if (ifp && if_is_loopback_or_vrf(ifp))
937 return alternate;
938 }
939
940 for (ALL_NEXTHOPS_PTR(current->nhe->nhg, nexthop)) {
941 struct interface *ifp = if_lookup_by_index(
942 nexthop->ifindex, current->vrf_id);
943
944 if (ifp && if_is_loopback_or_vrf(ifp))
945 return current;
946 }
947
948 /* Neither are loop or vrf so pick best metric */
949 if (alternate->metric <= current->metric)
950 return alternate;
951
952 return current;
953 }
954
955 if (current->type == ZEBRA_ROUTE_CONNECT)
956 return current;
957
958 /* higher distance loses */
959 if (alternate->distance < current->distance)
960 return alternate;
961 if (current->distance < alternate->distance)
962 return current;
963
964 /* metric tie-breaks equal distance */
965 if (alternate->metric <= current->metric)
966 return alternate;
967
968 return current;
969 }
970
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
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;
990 const struct prefix *p, *src_p;
991
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 }
1002
1003 if (IS_ZEBRA_DEBUG_RIB)
1004 srcdest_rnode2str(rn, buf, sizeof(buf));
1005
1006 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
1007 zlog_debug("%u:%s: Processing rn %p", vrf_id, buf, rn);
1008
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;
1017
1018 RNODE_FOREACH_RE_SAFE (rn, re, next) {
1019 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
1020 zlog_debug(
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);
1025
1026 /* Currently selected re. */
1027 if (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED)) {
1028 assert(old_selected == NULL);
1029 old_selected = re;
1030 }
1031
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
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,
1042 * a decision has already been made that the NHs have changed.
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.
1047 */
1048 if (CHECK_FLAG(re->status, ROUTE_ENTRY_CHANGED)
1049 && !nexthop_active_update(rn, re)) {
1050 if (re->type == ZEBRA_ROUTE_TABLE) {
1051 /* XXX: HERE BE DRAGONS!!!!!
1052 * In all honesty, I have not yet figured out
1053 * what this part does or why the
1054 * ROUTE_ENTRY_CHANGED test above is correct
1055 * or why we need to delete a route here, and
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 */
1062 if (re != old_selected) {
1063 if (IS_ZEBRA_DEBUG_RIB)
1064 zlog_debug(
1065 "%s: %u:%s: imported via import-table but denied "
1066 "by the ip protocol table route-map",
1067 __func__, vrf_id, buf);
1068 rib_unlink(rn, re);
1069 } else
1070 SET_FLAG(re->status,
1071 ROUTE_ENTRY_REMOVED);
1072 }
1073
1074 continue;
1075 }
1076
1077 /* Infinite distance. */
1078 if (re->distance == DISTANCE_INFINITY) {
1079 UNSET_FLAG(re->status, ROUTE_ENTRY_CHANGED);
1080 continue;
1081 }
1082
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 }
1121
1122 /* Buffer ROUTE_ENTRY_CHANGED here, because it will get cleared if
1123 * fib == selected */
1124 bool selected_changed = new_selected && CHECK_FLAG(new_selected->status,
1125 ROUTE_ENTRY_CHANGED);
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
1135 /* Update SELECTED entry */
1136 if (old_selected != new_selected || selected_changed) {
1137
1138 if (new_selected && new_selected != new_fib)
1139 UNSET_FLAG(new_selected->status, ROUTE_ENTRY_CHANGED);
1140
1141 if (new_selected)
1142 SET_FLAG(new_selected->flags, ZEBRA_FLAG_SELECTED);
1143
1144 if (old_selected) {
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
1156 if (old_selected != new_selected)
1157 UNSET_FLAG(old_selected->flags,
1158 ZEBRA_FLAG_SELECTED);
1159 }
1160 }
1161
1162 /* Remove all RE entries queued for removal */
1163 RNODE_FOREACH_RE_SAFE (rn, re, next) {
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 }
1172
1173 /*
1174 * Check if the dest can be deleted now.
1175 */
1176 rib_gc_dest(rn);
1177 }
1178
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
1197 /*
1198 * Utility to match route with dplane context data
1199 */
1200 static bool rib_route_match_ctx(const struct route_entry *re,
1201 const struct zebra_dplane_ctx *ctx,
1202 bool is_update)
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
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);
1269 UNSET_FLAG(re->status, ROUTE_ENTRY_QUEUED);
1270
1271 for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nhop)) {
1272 if (CHECK_FLAG(nhop->flags, NEXTHOP_FLAG_RECURSIVE))
1273 continue;
1274
1275 SET_FLAG(nhop->flags, NEXTHOP_FLAG_FIB);
1276 }
1277 }
1278 }
1279
1280 /*
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.
1284 * The return is 'true' if the installed nexthops changed; 'false' otherwise.
1285 */
1286 static bool rib_update_re_from_ctx(struct route_entry *re,
1287 struct route_node *rn,
1288 struct zebra_dplane_ctx *ctx)
1289 {
1290 char dest_str[PREFIX_STRLEN] = "";
1291 char nh_str[NEXTHOP_STRLEN];
1292 struct nexthop *nexthop, *ctx_nexthop;
1293 bool matched;
1294 const struct nexthop_group *ctxnhg;
1295 bool is_selected = false; /* Is 're' currently the selected re? */
1296 bool changed_p = false; /* Change to nexthops? */
1297 rib_dest_t *dest;
1298
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));
1304
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.
1314 * If the installed set differs from the set requested by the rib/owner,
1315 * we use the fib-specific nexthop-group to record the actual FIB
1316 * status.
1317 */
1318
1319 /* Check both fib group and notif group for equivalence.
1320 *
1321 * Let's assume the nexthops are ordered here to save time.
1322 */
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);
1328 }
1329
1330 matched = false;
1331 } else
1332 matched = true;
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;
1350
1351 /* Note that the installed nexthops have changed */
1352 changed_p = true;
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.
1365 *
1366 * Assume nexthops are ordered here as well.
1367 */
1368 matched = true;
1369
1370 ctx_nexthop = dplane_ctx_get_ng(ctx)->nexthop;
1371
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
1380 /* Get the first `installed` one to check against.
1381 * If the dataplane doesn't set these to be what was actually installed,
1382 * it will just be whatever was in re->nhe->nhg?
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
1388 for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop)) {
1389
1390 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_RECURSIVE))
1391 continue;
1392
1393 if (!CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE))
1394 continue;
1395
1396 /* Check for a FIB nexthop corresponding to the RIB nexthop */
1397 if (nexthop_same(ctx_nexthop, nexthop) == false) {
1398 /* If the FIB doesn't know about the nexthop,
1399 * it's not installed
1400 */
1401 if (IS_ZEBRA_DEBUG_RIB_DETAILED) {
1402 nexthop2str(nexthop, nh_str, sizeof(nh_str));
1403 zlog_debug(
1404 "update_from_ctx: no notif match for rib nh %s",
1405 nh_str);
1406 }
1407 matched = false;
1408
1409 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB))
1410 changed_p = true;
1411
1412 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
1413
1414 /* Keep checking nexthops */
1415 continue;
1416 }
1417
1418 if (CHECK_FLAG(ctx_nexthop->flags, NEXTHOP_FLAG_FIB)) {
1419 if (!CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB))
1420 changed_p = true;
1421
1422 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
1423 } else {
1424 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB))
1425 changed_p = true;
1426
1427 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
1428 }
1429
1430 ctx_nexthop = nexthop_next_active_resolved(ctx_nexthop);
1431 }
1432
1433 /* If all nexthops were processed, we're done */
1434 if (matched) {
1435 if (IS_ZEBRA_DEBUG_RIB)
1436 zlog_debug("%u:%s update_from_ctx(): rib nhg matched, changed '%s'",
1437 re->vrf_id, dest_str,
1438 (changed_p ? "true" : "false"));
1439 goto done;
1440 }
1441
1442 no_nexthops:
1443
1444 /* FIB nexthop set differs from the RIB set:
1445 * create a fib-specific nexthop-group
1446 */
1447 if (IS_ZEBRA_DEBUG_RIB)
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"));
1451
1452 ctxnhg = dplane_ctx_get_ng(ctx);
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;
1462 _nexthop_add(&(re->fib_ng.nexthop), nexthop);
1463 }
1464
1465 done:
1466 return changed_p;
1467 }
1468
1469 /*
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.
1473 */
1474 static struct route_node *
1475 rib_find_rn_from_ctx(const struct zebra_dplane_ctx *ctx)
1476 {
1477 struct route_table *table = NULL;
1478 struct route_node *rn = NULL;
1479 const struct prefix *dest_pfx, *src_pfx;
1480
1481 /* Locate rn and re(s) from ctx */
1482
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));
1486 if (table == NULL) {
1487 if (IS_ZEBRA_DEBUG_DPLANE) {
1488 zlog_debug("Failed to find route for ctx: no table for afi %d, safi %d, vrf %u",
1489 dplane_ctx_get_afi(ctx),
1490 dplane_ctx_get_safi(ctx),
1491 dplane_ctx_get_vrf(ctx));
1492 }
1493 goto done;
1494 }
1495
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
1507
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;
1522 bool fib_changed = false;
1523
1524 zvrf = vrf_info_lookup(dplane_ctx_get_vrf(ctx));
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 */
1530 if (IS_ZEBRA_DEBUG_DPLANE)
1531 prefix2str(dest_pfx, dest_str, sizeof(dest_str));
1532
1533 /* Locate rn and re(s) from ctx */
1534 rn = rib_find_rn_from_ctx(ctx);
1535 if (rn == NULL) {
1536 if (IS_ZEBRA_DEBUG_DPLANE) {
1537 zlog_debug("Failed to process dplane results: no route for %u:%s",
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
1548 if (IS_ZEBRA_DEBUG_DPLANE_DETAIL)
1549 zlog_debug("%u:%s Processing dplane ctx %p, op %s result %s",
1550 dplane_ctx_get_vrf(ctx), dest_str, ctx,
1551 dplane_op2str(op), dplane_res2str(status));
1552
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) {
1566 if (rib_route_match_ctx(rib, ctx, false))
1567 re = rib;
1568 }
1569
1570 /* Check for old route match */
1571 if (is_update && (old_re == NULL)) {
1572 if (rib_route_match_ctx(rib, ctx, true /*is_update*/))
1573 old_re = rib;
1574 }
1575
1576 /* Have we found the routes we need to work on? */
1577 if (re && ((!is_update || old_re)))
1578 break;
1579 }
1580
1581 seq = dplane_ctx_get_seq(ctx);
1582
1583 /*
1584 * Check sequence number(s) to detect stale results before continuing
1585 */
1586 if (re) {
1587 if (re->dplane_sequence != seq) {
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);
1594 }
1595
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
1603 UNSET_FLAG(old_re->status, ROUTE_ENTRY_QUEUED);
1604 }
1605
1606 switch (op) {
1607 case DPLANE_OP_ROUTE_INSTALL:
1608 case DPLANE_OP_ROUTE_UPDATE:
1609 if (status == ZEBRA_DPLANE_REQUEST_SUCCESS) {
1610 if (re) {
1611 UNSET_FLAG(re->status, ROUTE_ENTRY_FAILED);
1612 SET_FLAG(re->status, ROUTE_ENTRY_INSTALLED);
1613 }
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) {
1624 UNSET_FLAG(old_re->status, ROUTE_ENTRY_FAILED);
1625 UNSET_FLAG(old_re->status,
1626 ROUTE_ENTRY_INSTALLED);
1627 }
1628
1629 /* Update zebra route based on the results in
1630 * the context struct.
1631 */
1632 if (re) {
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);
1642 }
1643
1644 /* Redistribute */
1645 redistribute_update(dest_pfx, src_pfx,
1646 re, old_re);
1647 }
1648
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
1660 if (zvrf)
1661 zvrf->installs++;
1662
1663 /* Notify route owner */
1664 zsend_route_notify_owner_ctx(ctx, ZAPI_ROUTE_INSTALLED);
1665
1666 } else {
1667 if (re) {
1668 SET_FLAG(re->status, ROUTE_ENTRY_FAILED);
1669 UNSET_FLAG(re->status, ROUTE_ENTRY_INSTALLED);
1670 } if (old_re)
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);
1675
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:
1683 if (re)
1684 SET_FLAG(re->status, ROUTE_ENTRY_FAILED);
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.
1689 */
1690 if (status == ZEBRA_DPLANE_REQUEST_SUCCESS) {
1691 if (re) {
1692 UNSET_FLAG(re->status, ROUTE_ENTRY_INSTALLED);
1693 UNSET_FLAG(re->status, ROUTE_ENTRY_FAILED);
1694 }
1695 zsend_route_notify_owner_ctx(ctx, ZAPI_ROUTE_REMOVED);
1696
1697 if (zvrf)
1698 zvrf->removals++;
1699 } else {
1700 if (re)
1701 SET_FLAG(re->status, ROUTE_ENTRY_FAILED);
1702 zsend_route_notify_owner_ctx(ctx,
1703 ZAPI_ROUTE_REMOVE_FAIL);
1704
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 }
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);
1721 break;
1722 default:
1723 break;
1724 }
1725
1726 zebra_rib_evaluate_rn_nexthops(rn, seq);
1727 zebra_rib_evaluate_mpls(rn);
1728 done:
1729
1730 if (rn)
1731 route_unlock_node(rn);
1732
1733 /* Return context to dataplane module */
1734 dplane_ctx_fini(&ctx);
1735 }
1736
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;
1745 struct route_entry *re = NULL;
1746 struct nexthop *nexthop;
1747 char dest_str[PREFIX_STRLEN] = "";
1748 const struct prefix *dest_pfx, *src_pfx;
1749 rib_dest_t *dest;
1750 bool fib_changed = false;
1751 bool debug_p = IS_ZEBRA_DEBUG_DPLANE | IS_ZEBRA_DEBUG_RIB;
1752 int start_count, end_count;
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 */
1758 if (debug_p)
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) {
1764 if (debug_p) {
1765 zlog_debug("Failed to process dplane notification: no routes for %u:%s",
1766 dplane_ctx_get_vrf(ctx), dest_str);
1767 }
1768 goto done;
1769 }
1770
1771 dest = rib_dest_from_rnode(rn);
1772 srcdest_rnode_prefixes(rn, &dest_pfx, &src_pfx);
1773
1774 if (debug_p)
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 */
1782 RNODE_FOREACH_RE(rn, re) {
1783 if (rib_route_match_ctx(re, ctx, false /*!update*/))
1784 break;
1785 }
1786
1787 /* No match? Nothing we can do */
1788 if (re == NULL) {
1789 if (debug_p)
1790 zlog_debug("%u:%s Unable to process dplane notification: no entry for type %s",
1791 dplane_ctx_get_vrf(ctx), dest_str,
1792 zebra_route_string(
1793 dplane_ctx_get_type(ctx)));
1794
1795 goto done;
1796 }
1797
1798 /* Ensure we clear the QUEUED flag */
1799 UNSET_FLAG(re->status, ROUTE_ENTRY_QUEUED);
1800
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.
1804 */
1805 if (re != dest->selected_fib) {
1806 /*
1807 * If we need to, clean up after a delete that was part of
1808 * an update operation.
1809 */
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 }
1835 goto done;
1836 }
1837
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;
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 }
1849 }
1850
1851 /* Update zebra's nexthop FIB flags based on the context struct's
1852 * nexthops.
1853 */
1854 fib_changed = rib_update_re_from_ctx(re, rn, ctx);
1855
1856 if (!fib_changed) {
1857 if (debug_p)
1858 zlog_debug("%u:%s dplane notification: rib_update returns FALSE",
1859 dplane_ctx_get_vrf(ctx), dest_str);
1860 }
1861
1862 /*
1863 * Perform follow-up work if the actual status of the prefix
1864 * changed.
1865 */
1866
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 }
1872
1873 /* Various fib transitions: changed nexthops; from installed to
1874 * not-installed; or not-installed to installed.
1875 */
1876 if (start_count > 0 && end_count > 0) {
1877 if (debug_p)
1878 zlog_debug("%u:%s applied nexthop changes from dplane notification",
1879 dplane_ctx_get_vrf(ctx), dest_str);
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) {
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
1891 * to tell others about this transition.
1892 */
1893 SET_FLAG(re->status, ROUTE_ENTRY_INSTALLED);
1894
1895 /* Changed nexthops - update kernel/others */
1896 dplane_route_notif_update(rn, re, DPLANE_OP_ROUTE_INSTALL, ctx);
1897
1898 /* Redistribute, lsp, and nht update */
1899 redistribute_update(dest_pfx, src_pfx, re, NULL);
1900
1901 } else if (start_count > 0 && end_count == 0) {
1902 if (debug_p)
1903 zlog_debug("%u:%s un-installed transition from dplane notification",
1904 dplane_ctx_get_vrf(ctx), dest_str);
1905
1906 /* Transition from _something_ installed to _nothing_
1907 * installed.
1908 */
1909 /* We expect this to be the selected route, so we want
1910 * to tell others about this transistion.
1911 */
1912 UNSET_FLAG(re->status, ROUTE_ENTRY_INSTALLED);
1913
1914 /* Changed nexthops - update kernel/others */
1915 dplane_route_notif_update(rn, re, DPLANE_OP_ROUTE_DELETE, ctx);
1916
1917 /* Redistribute, lsp, and nht update */
1918 redistribute_delete(dest_pfx, src_pfx, re, NULL);
1919 }
1920
1921 /* Make any changes visible for lsp and nexthop-tracking processing */
1922 zebra_rib_evaluate_rn_nexthops(
1923 rn, zebra_router_get_next_sequence());
1924
1925 zebra_rib_evaluate_mpls(rn);
1926
1927 done:
1928 if (rn)
1929 route_unlock_node(rn);
1930
1931 /* Return context to dataplane module */
1932 dplane_ctx_fini(&ctx);
1933 }
1934
1935 static void process_subq_nhg(struct listnode *lnode)
1936 {
1937 struct nhg_ctx *ctx = NULL;
1938 uint8_t qindex = route_info[ZEBRA_ROUTE_NHG].meta_q_map;
1939
1940 ctx = listgetdata(lnode);
1941
1942 if (!ctx)
1943 return;
1944
1945 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
1946 zlog_debug("NHG Context id=%u dequeued from sub-queue %u",
1947 ctx->id, qindex);
1948
1949 rib_nhg_process(ctx);
1950 }
1951
1952 static void process_subq_route(struct listnode *lnode, uint8_t qindex)
1953 {
1954 struct route_node *rnode = NULL;
1955 rib_dest_t *dest = NULL;
1956 struct zebra_vrf *zvrf = NULL;
1957
1958 rnode = listgetdata(lnode);
1959 dest = rib_dest_from_rnode(rnode);
1960 if (dest)
1961 zvrf = rib_dest_vrf(dest);
1962
1963 rib_process(rnode);
1964
1965 if (IS_ZEBRA_DEBUG_RIB_DETAILED) {
1966 char buf[SRCDEST2STR_BUFFER];
1967
1968 srcdest_rnode2str(rnode, buf, sizeof(buf));
1969 zlog_debug("%u:%s: rn %p dequeued from sub-queue %u",
1970 zvrf ? zvrf_id(zvrf) : 0, buf, rnode, qindex);
1971 }
1972
1973 if (rnode->info)
1974 UNSET_FLAG(rib_dest_from_rnode(rnode)->flags,
1975 RIB_ROUTE_QUEUED(qindex));
1976
1977 #if 0
1978 else
1979 {
1980 zlog_debug ("%s: called for route_node (%p, %d) with no ribs",
1981 __func__, rnode, rnode->lock);
1982 zlog_backtrace(LOG_DEBUG);
1983 }
1984 #endif
1985 route_unlock_node(rnode);
1986 }
1987
1988 /* Take a list of route_node structs and return 1, if there was a record
1989 * picked from it and processed by rib_process(). Don't process more,
1990 * than one RN record; operate only in the specified sub-queue.
1991 */
1992 static unsigned int process_subq(struct list *subq, uint8_t qindex)
1993 {
1994 struct listnode *lnode = listhead(subq);
1995
1996 if (!lnode)
1997 return 0;
1998
1999 if (qindex == route_info[ZEBRA_ROUTE_NHG].meta_q_map)
2000 process_subq_nhg(lnode);
2001 else
2002 process_subq_route(lnode, qindex);
2003
2004 list_delete_node(subq, lnode);
2005
2006 return 1;
2007 }
2008
2009 /* Dispatch the meta queue by picking, processing and unlocking the next RN from
2010 * a non-empty sub-queue with lowest priority. wq is equal to zebra->ribq and
2011 * data
2012 * is pointed to the meta queue structure.
2013 */
2014 static wq_item_status meta_queue_process(struct work_queue *dummy, void *data)
2015 {
2016 struct meta_queue *mq = data;
2017 unsigned i;
2018 uint32_t queue_len, queue_limit;
2019
2020 /* Ensure there's room for more dataplane updates */
2021 queue_limit = dplane_get_in_queue_limit();
2022 queue_len = dplane_get_in_queue_len();
2023 if (queue_len > queue_limit) {
2024 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
2025 zlog_debug("rib queue: dplane queue len %u, limit %u, retrying",
2026 queue_len, queue_limit);
2027
2028 /* Ensure that the meta-queue is actually enqueued */
2029 if (work_queue_empty(zrouter.ribq))
2030 work_queue_add(zrouter.ribq, zrouter.mq);
2031
2032 return WQ_QUEUE_BLOCKED;
2033 }
2034
2035 for (i = 0; i < MQ_SIZE; i++)
2036 if (process_subq(mq->subq[i], i)) {
2037 mq->size--;
2038 break;
2039 }
2040 return mq->size ? WQ_REQUEUE : WQ_SUCCESS;
2041 }
2042
2043
2044 /*
2045 * Look into the RN and queue it into the highest priority queue
2046 * at this point in time for processing.
2047 *
2048 * We will enqueue a route node only once per invocation.
2049 *
2050 * There are two possibilities here that should be kept in mind.
2051 * If the original invocation has not been pulled off for processing
2052 * yet, A subsuquent invocation can have a route entry with a better
2053 * meta queue index value and we can have a situation where
2054 * we might have the same node enqueued 2 times. Not necessarily
2055 * an optimal situation but it should be ok.
2056 *
2057 * The other possibility is that the original invocation has not
2058 * been pulled off for processing yet, A subsusquent invocation
2059 * doesn't have a route_entry with a better meta-queue and the
2060 * original metaqueue index value will win and we'll end up with
2061 * the route node enqueued once.
2062 */
2063 static int rib_meta_queue_add(struct meta_queue *mq, void *data)
2064 {
2065 struct route_node *rn = NULL;
2066 struct route_entry *re = NULL, *curr_re = NULL;
2067 uint8_t qindex = MQ_SIZE, curr_qindex = MQ_SIZE;
2068
2069 rn = (struct route_node *)data;
2070
2071 RNODE_FOREACH_RE (rn, curr_re) {
2072 curr_qindex = route_info[curr_re->type].meta_q_map;
2073
2074 if (curr_qindex <= qindex) {
2075 re = curr_re;
2076 qindex = curr_qindex;
2077 }
2078 }
2079
2080 if (!re)
2081 return -1;
2082
2083 /* Invariant: at this point we always have rn->info set. */
2084 if (CHECK_FLAG(rib_dest_from_rnode(rn)->flags,
2085 RIB_ROUTE_QUEUED(qindex))) {
2086 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
2087 rnode_debug(rn, re->vrf_id,
2088 "rn %p is already queued in sub-queue %u",
2089 (void *)rn, qindex);
2090 return -1;
2091 }
2092
2093 SET_FLAG(rib_dest_from_rnode(rn)->flags, RIB_ROUTE_QUEUED(qindex));
2094 listnode_add(mq->subq[qindex], rn);
2095 route_lock_node(rn);
2096 mq->size++;
2097
2098 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
2099 rnode_debug(rn, re->vrf_id, "queued rn %p into sub-queue %u",
2100 (void *)rn, qindex);
2101
2102 return 0;
2103 }
2104
2105 static int rib_meta_queue_nhg_add(struct meta_queue *mq, void *data)
2106 {
2107 struct nhg_ctx *ctx = NULL;
2108 uint8_t qindex = route_info[ZEBRA_ROUTE_NHG].meta_q_map;
2109
2110 ctx = (struct nhg_ctx *)data;
2111
2112 if (!ctx)
2113 return -1;
2114
2115 listnode_add(mq->subq[qindex], ctx);
2116 mq->size++;
2117
2118 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
2119 zlog_debug("NHG Context id=%u queued into sub-queue %u",
2120 ctx->id, qindex);
2121
2122 return 0;
2123 }
2124
2125 static int mq_add_handler(void *data,
2126 int (*mq_add_func)(struct meta_queue *mq, void *data))
2127 {
2128 if (zrouter.ribq == NULL) {
2129 flog_err(EC_ZEBRA_WQ_NONEXISTENT,
2130 "%s: work_queue does not exist!", __func__);
2131 return -1;
2132 }
2133
2134 /*
2135 * The RIB queue should normally be either empty or holding the only
2136 * work_queue_item element. In the latter case this element would
2137 * hold a pointer to the meta queue structure, which must be used to
2138 * actually queue the route nodes to process. So create the MQ
2139 * holder, if necessary, then push the work into it in any case.
2140 * This semantics was introduced after 0.99.9 release.
2141 */
2142 if (work_queue_empty(zrouter.ribq))
2143 work_queue_add(zrouter.ribq, zrouter.mq);
2144
2145 return mq_add_func(zrouter.mq, data);
2146 }
2147
2148 /* Add route_node to work queue and schedule processing */
2149 int rib_queue_add(struct route_node *rn)
2150 {
2151 assert(rn);
2152
2153 /* Pointless to queue a route_node with no RIB entries to add or remove
2154 */
2155 if (!rnode_to_ribs(rn)) {
2156 zlog_debug("%s: called for route_node (%p, %d) with no ribs",
2157 __func__, (void *)rn, rn->lock);
2158 zlog_backtrace(LOG_DEBUG);
2159 return -1;
2160 }
2161
2162 return mq_add_handler(rn, &rib_meta_queue_add);
2163 }
2164
2165 int rib_queue_nhg_add(struct nhg_ctx *ctx)
2166 {
2167 assert(ctx);
2168
2169 return mq_add_handler(ctx, &rib_meta_queue_nhg_add);
2170 }
2171
2172 /* Create new meta queue.
2173 A destructor function doesn't seem to be necessary here.
2174 */
2175 static struct meta_queue *meta_queue_new(void)
2176 {
2177 struct meta_queue *new;
2178 unsigned i;
2179
2180 new = XCALLOC(MTYPE_WORK_QUEUE, sizeof(struct meta_queue));
2181
2182 for (i = 0; i < MQ_SIZE; i++) {
2183 new->subq[i] = list_new();
2184 assert(new->subq[i]);
2185 }
2186
2187 return new;
2188 }
2189
2190 void meta_queue_free(struct meta_queue *mq)
2191 {
2192 unsigned i;
2193
2194 for (i = 0; i < MQ_SIZE; i++)
2195 list_delete(&mq->subq[i]);
2196
2197 XFREE(MTYPE_WORK_QUEUE, mq);
2198 }
2199
2200 /* initialise zebra rib work queue */
2201 static void rib_queue_init(void)
2202 {
2203 if (!(zrouter.ribq = work_queue_new(zrouter.master,
2204 "route_node processing"))) {
2205 flog_err(EC_ZEBRA_WQ_NONEXISTENT,
2206 "%s: could not initialise work queue!", __func__);
2207 return;
2208 }
2209
2210 /* fill in the work queue spec */
2211 zrouter.ribq->spec.workfunc = &meta_queue_process;
2212 zrouter.ribq->spec.errorfunc = NULL;
2213 zrouter.ribq->spec.completion_func = NULL;
2214 /* XXX: TODO: These should be runtime configurable via vty */
2215 zrouter.ribq->spec.max_retries = 3;
2216 zrouter.ribq->spec.hold = ZEBRA_RIB_PROCESS_HOLD_TIME;
2217 zrouter.ribq->spec.retry = ZEBRA_RIB_PROCESS_RETRY_TIME;
2218
2219 if (!(zrouter.mq = meta_queue_new())) {
2220 flog_err(EC_ZEBRA_WQ_NONEXISTENT,
2221 "%s: could not initialise meta queue!", __func__);
2222 return;
2223 }
2224 return;
2225 }
2226
2227 rib_dest_t *zebra_rib_create_dest(struct route_node *rn)
2228 {
2229 rib_dest_t *dest;
2230
2231 dest = XCALLOC(MTYPE_RIB_DEST, sizeof(rib_dest_t));
2232 rnh_list_init(&dest->nht);
2233 route_lock_node(rn); /* rn route table reference */
2234 rn->info = dest;
2235 dest->rnode = rn;
2236
2237 return dest;
2238 }
2239
2240 /* RIB updates are processed via a queue of pointers to route_nodes.
2241 *
2242 * The queue length is bounded by the maximal size of the routing table,
2243 * as a route_node will not be requeued, if already queued.
2244 *
2245 * REs are submitted via rib_addnode or rib_delnode which set minimal
2246 * state, or static_install_route (when an existing RE is updated)
2247 * and then submit route_node to queue for best-path selection later.
2248 * Order of add/delete state changes are preserved for any given RE.
2249 *
2250 * Deleted REs are reaped during best-path selection.
2251 *
2252 * rib_addnode
2253 * |-> rib_link or unset ROUTE_ENTRY_REMOVE |->Update kernel with
2254 * |-------->| | best RE, if required
2255 * | |
2256 * static_install->|->rib_addqueue...... -> rib_process
2257 * | |
2258 * |-------->| |-> rib_unlink
2259 * |-> set ROUTE_ENTRY_REMOVE |
2260 * rib_delnode (RE freed)
2261 *
2262 * The 'info' pointer of a route_node points to a rib_dest_t
2263 * ('dest'). Queueing state for a route_node is kept on the dest. The
2264 * dest is created on-demand by rib_link() and is kept around at least
2265 * as long as there are ribs hanging off it (@see rib_gc_dest()).
2266 *
2267 * Refcounting (aka "locking" throughout the GNU Zebra and Quagga code):
2268 *
2269 * - route_nodes: refcounted by:
2270 * - dest attached to route_node:
2271 * - managed by: rib_link/rib_gc_dest
2272 * - route_node processing queue
2273 * - managed by: rib_addqueue, rib_process.
2274 *
2275 */
2276
2277 /* Add RE to head of the route node. */
2278 static void rib_link(struct route_node *rn, struct route_entry *re, int process)
2279 {
2280 rib_dest_t *dest;
2281 afi_t afi;
2282 const char *rmap_name;
2283
2284 assert(re && rn);
2285
2286 dest = rib_dest_from_rnode(rn);
2287 if (!dest) {
2288 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
2289 rnode_debug(rn, re->vrf_id, "rn %p adding dest", rn);
2290
2291 dest = zebra_rib_create_dest(rn);
2292 }
2293
2294 re_list_add_head(&dest->routes, re);
2295
2296 afi = (rn->p.family == AF_INET)
2297 ? AFI_IP
2298 : (rn->p.family == AF_INET6) ? AFI_IP6 : AFI_MAX;
2299 if (is_zebra_import_table_enabled(afi, re->vrf_id, re->table)) {
2300 struct zebra_vrf *zvrf = zebra_vrf_lookup_by_id(re->vrf_id);
2301
2302 rmap_name = zebra_get_import_table_route_map(afi, re->table);
2303 zebra_add_import_table_entry(zvrf, rn, re, rmap_name);
2304 } else if (process)
2305 rib_queue_add(rn);
2306 }
2307
2308 static void rib_addnode(struct route_node *rn,
2309 struct route_entry *re, int process)
2310 {
2311 /* RE node has been un-removed before route-node is processed.
2312 * route_node must hence already be on the queue for processing..
2313 */
2314 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) {
2315 if (IS_ZEBRA_DEBUG_RIB)
2316 rnode_debug(rn, re->vrf_id, "rn %p, un-removed re %p",
2317 (void *)rn, (void *)re);
2318
2319 UNSET_FLAG(re->status, ROUTE_ENTRY_REMOVED);
2320 return;
2321 }
2322 rib_link(rn, re, process);
2323 }
2324
2325 /*
2326 * rib_unlink
2327 *
2328 * Detach a rib structure from a route_node.
2329 *
2330 * Note that a call to rib_unlink() should be followed by a call to
2331 * rib_gc_dest() at some point. This allows a rib_dest_t that is no
2332 * longer required to be deleted.
2333 */
2334 void rib_unlink(struct route_node *rn, struct route_entry *re)
2335 {
2336 rib_dest_t *dest;
2337 struct nhg_hash_entry *nhe = NULL;
2338
2339 assert(rn && re);
2340
2341 if (IS_ZEBRA_DEBUG_RIB)
2342 rnode_debug(rn, re->vrf_id, "rn %p, re %p", (void *)rn,
2343 (void *)re);
2344
2345 dest = rib_dest_from_rnode(rn);
2346
2347 re_list_del(&dest->routes, re);
2348
2349 if (dest->selected_fib == re)
2350 dest->selected_fib = NULL;
2351
2352 if (re->nhe_id) {
2353 nhe = zebra_nhg_lookup_id(re->nhe_id);
2354 if (nhe)
2355 zebra_nhg_decrement_ref(nhe);
2356 } else if (re->nhe->nhg)
2357 nexthop_group_delete(&re->nhe->nhg);
2358
2359 nexthops_free(re->fib_ng.nexthop);
2360
2361 XFREE(MTYPE_RE, re);
2362 }
2363
2364 void rib_delnode(struct route_node *rn, struct route_entry *re)
2365 {
2366 afi_t afi;
2367
2368 if (IS_ZEBRA_DEBUG_RIB)
2369 rnode_debug(rn, re->vrf_id, "rn %p, re %p, removing",
2370 (void *)rn, (void *)re);
2371 SET_FLAG(re->status, ROUTE_ENTRY_REMOVED);
2372
2373 afi = (rn->p.family == AF_INET)
2374 ? AFI_IP
2375 : (rn->p.family == AF_INET6) ? AFI_IP6 : AFI_MAX;
2376 if (is_zebra_import_table_enabled(afi, re->vrf_id, re->table)) {
2377 struct zebra_vrf *zvrf = zebra_vrf_lookup_by_id(re->vrf_id);
2378
2379 zebra_del_import_table_entry(zvrf, rn, re);
2380 /* Just clean up if non main table */
2381 if (IS_ZEBRA_DEBUG_RIB) {
2382 char buf[SRCDEST2STR_BUFFER];
2383 srcdest_rnode2str(rn, buf, sizeof(buf));
2384 zlog_debug("%u:%s: Freeing route rn %p, re %p (%s)",
2385 re->vrf_id, buf, rn, re,
2386 zebra_route_string(re->type));
2387 }
2388
2389 rib_unlink(rn, re);
2390 } else {
2391 rib_queue_add(rn);
2392 }
2393 }
2394
2395 /* This function dumps the contents of a given RE entry into
2396 * standard debug log. Calling function name and IP prefix in
2397 * question are passed as 1st and 2nd arguments.
2398 */
2399
2400 void _route_entry_dump(const char *func, union prefixconstptr pp,
2401 union prefixconstptr src_pp,
2402 const struct route_entry *re)
2403 {
2404 const struct prefix *src_p = src_pp.p;
2405 bool is_srcdst = src_p && src_p->prefixlen;
2406 char straddr[PREFIX_STRLEN];
2407 char srcaddr[PREFIX_STRLEN];
2408 char nhname[PREFIX_STRLEN];
2409 struct nexthop *nexthop;
2410
2411 zlog_debug("%s: dumping RE entry %p for %s%s%s vrf %u", func,
2412 (const void *)re, prefix2str(pp, straddr, sizeof(straddr)),
2413 is_srcdst ? " from " : "",
2414 is_srcdst ? prefix2str(src_pp, srcaddr, sizeof(srcaddr))
2415 : "",
2416 re->vrf_id);
2417 zlog_debug("%s: uptime == %lu, type == %u, instance == %d, table == %d",
2418 straddr, (unsigned long)re->uptime, re->type, re->instance,
2419 re->table);
2420 zlog_debug(
2421 "%s: metric == %u, mtu == %u, distance == %u, flags == %u, status == %u",
2422 straddr, re->metric, re->mtu, re->distance, re->flags, re->status);
2423 zlog_debug("%s: nexthop_num == %u, nexthop_active_num == %u", straddr,
2424 nexthop_group_nexthop_num(re->nhe->nhg),
2425 nexthop_group_active_nexthop_num(re->nhe->nhg));
2426
2427 for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop)) {
2428 struct interface *ifp;
2429 struct vrf *vrf = vrf_lookup_by_id(nexthop->vrf_id);
2430
2431 switch (nexthop->type) {
2432 case NEXTHOP_TYPE_BLACKHOLE:
2433 sprintf(nhname, "Blackhole");
2434 break;
2435 case NEXTHOP_TYPE_IFINDEX:
2436 ifp = if_lookup_by_index(nexthop->ifindex,
2437 nexthop->vrf_id);
2438 sprintf(nhname, "%s", ifp ? ifp->name : "Unknown");
2439 break;
2440 case NEXTHOP_TYPE_IPV4:
2441 /* fallthrough */
2442 case NEXTHOP_TYPE_IPV4_IFINDEX:
2443 inet_ntop(AF_INET, &nexthop->gate, nhname,
2444 INET6_ADDRSTRLEN);
2445 break;
2446 case NEXTHOP_TYPE_IPV6:
2447 case NEXTHOP_TYPE_IPV6_IFINDEX:
2448 inet_ntop(AF_INET6, &nexthop->gate, nhname,
2449 INET6_ADDRSTRLEN);
2450 break;
2451 }
2452 zlog_debug("%s: %s %s[%u] vrf %s(%u) with flags %s%s%s%s%s%s",
2453 straddr, (nexthop->rparent ? " NH" : "NH"), nhname,
2454 nexthop->ifindex, vrf ? vrf->name : "Unknown",
2455 nexthop->vrf_id,
2456 (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE)
2457 ? "ACTIVE "
2458 : ""),
2459 (CHECK_FLAG(re->status, ROUTE_ENTRY_INSTALLED)
2460 ? "FIB "
2461 : ""),
2462 (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_RECURSIVE)
2463 ? "RECURSIVE "
2464 : ""),
2465 (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ONLINK)
2466 ? "ONLINK "
2467 : ""),
2468 (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_MATCHED)
2469 ? "MATCHED "
2470 : ""),
2471 (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_DUPLICATE)
2472 ? "DUPLICATE "
2473 : ""));
2474 }
2475 zlog_debug("%s: dump complete", straddr);
2476 }
2477
2478 /* This is an exported helper to rtm_read() to dump the strange
2479 * RE entry found by rib_lookup_ipv4_route()
2480 */
2481
2482 void rib_lookup_and_dump(struct prefix_ipv4 *p, vrf_id_t vrf_id)
2483 {
2484 struct route_table *table;
2485 struct route_node *rn;
2486 struct route_entry *re;
2487 char prefix_buf[INET_ADDRSTRLEN];
2488
2489 /* Lookup table. */
2490 table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id);
2491 if (!table) {
2492 flog_err(EC_ZEBRA_TABLE_LOOKUP_FAILED,
2493 "%s:%u zebra_vrf_table() returned NULL", __func__,
2494 vrf_id);
2495 return;
2496 }
2497
2498 /* Scan the RIB table for exactly matching RE entry. */
2499 rn = route_node_lookup(table, (struct prefix *)p);
2500
2501 /* No route for this prefix. */
2502 if (!rn) {
2503 zlog_debug("%s:%u lookup failed for %s", __func__, vrf_id,
2504 prefix2str((struct prefix *)p, prefix_buf,
2505 sizeof(prefix_buf)));
2506 return;
2507 }
2508
2509 /* Unlock node. */
2510 route_unlock_node(rn);
2511
2512 /* let's go */
2513 RNODE_FOREACH_RE (rn, re) {
2514 zlog_debug("%s:%u rn %p, re %p: %s, %s",
2515 __func__, vrf_id,
2516 (void *)rn, (void *)re,
2517 (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)
2518 ? "removed"
2519 : "NOT removed"),
2520 (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED)
2521 ? "selected"
2522 : "NOT selected"));
2523 route_entry_dump(p, NULL, re);
2524 }
2525 }
2526
2527 /* Check if requested address assignment will fail due to another
2528 * route being installed by zebra in FIB already. Take necessary
2529 * actions, if needed: remove such a route from FIB and deSELECT
2530 * corresponding RE entry. Then put affected RN into RIBQ head.
2531 */
2532 void rib_lookup_and_pushup(struct prefix_ipv4 *p, vrf_id_t vrf_id)
2533 {
2534 struct route_table *table;
2535 struct route_node *rn;
2536 rib_dest_t *dest;
2537
2538 if (NULL == (table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id))) {
2539 flog_err(EC_ZEBRA_TABLE_LOOKUP_FAILED,
2540 "%s:%u zebra_vrf_table() returned NULL", __func__,
2541 vrf_id);
2542 return;
2543 }
2544
2545 /* No matches would be the simplest case. */
2546 if (NULL == (rn = route_node_lookup(table, (struct prefix *)p)))
2547 return;
2548
2549 /* Unlock node. */
2550 route_unlock_node(rn);
2551
2552 dest = rib_dest_from_rnode(rn);
2553 /* Check all RE entries. In case any changes have to be done, requeue
2554 * the RN into RIBQ head. If the routing message about the new connected
2555 * route (generated by the IP address we are going to assign very soon)
2556 * comes before the RIBQ is processed, the new RE entry will join
2557 * RIBQ record already on head. This is necessary for proper
2558 * revalidation
2559 * of the rest of the RE.
2560 */
2561 if (dest->selected_fib) {
2562 if (IS_ZEBRA_DEBUG_RIB) {
2563 char buf[PREFIX_STRLEN];
2564
2565 zlog_debug("%u:%s: freeing way for connected prefix",
2566 dest->selected_fib->vrf_id,
2567 prefix2str(&rn->p, buf, sizeof(buf)));
2568 route_entry_dump(&rn->p, NULL, dest->selected_fib);
2569 }
2570 rib_uninstall(rn, dest->selected_fib);
2571 rib_queue_add(rn);
2572 }
2573 }
2574
2575 int rib_add_multipath(afi_t afi, safi_t safi, struct prefix *p,
2576 struct prefix_ipv6 *src_p, struct route_entry *re,
2577 struct nexthop_group *ng)
2578 {
2579 struct nhg_hash_entry *nhe = NULL;
2580 struct route_table *table;
2581 struct route_node *rn;
2582 struct route_entry *same = NULL;
2583 int ret = 0;
2584
2585 if (!re)
2586 return 0;
2587
2588 assert(!src_p || !src_p->prefixlen || afi == AFI_IP6);
2589
2590 /* Lookup table. */
2591 table = zebra_vrf_get_table_with_table_id(afi, safi, re->vrf_id,
2592 re->table);
2593 if (!table) {
2594 if (ng)
2595 nexthop_group_delete(&ng);
2596 XFREE(MTYPE_RE, re);
2597 return 0;
2598 }
2599
2600 if (re->nhe_id) {
2601 nhe = zebra_nhg_lookup_id(re->nhe_id);
2602
2603 if (!nhe) {
2604 flog_err(
2605 EC_ZEBRA_TABLE_LOOKUP_FAILED,
2606 "Zebra failed to find the nexthop hash entry for id=%u in a route entry",
2607 re->nhe_id);
2608 XFREE(MTYPE_RE, re);
2609 return -1;
2610 }
2611 } else {
2612 nhe = zebra_nhg_rib_find(0, ng, afi);
2613
2614 /*
2615 * The nexthops got copied over into an nhe,
2616 * so free them now.
2617 */
2618 nexthop_group_delete(&ng);
2619
2620 if (!nhe) {
2621 char buf[PREFIX_STRLEN] = "";
2622 char buf2[PREFIX_STRLEN] = "";
2623
2624 flog_err(
2625 EC_ZEBRA_TABLE_LOOKUP_FAILED,
2626 "Zebra failed to find or create a nexthop hash entry for %s%s%s",
2627 prefix2str(p, buf, sizeof(buf)),
2628 src_p ? " from " : "",
2629 src_p ? prefix2str(src_p, buf2, sizeof(buf2))
2630 : "");
2631
2632 XFREE(MTYPE_RE, re);
2633 return -1;
2634 }
2635 }
2636
2637 /*
2638 * Attach the re to the nhe's nexthop group.
2639 *
2640 * TODO: This will need to change when we start getting IDs from upper
2641 * level protocols, as the refcnt might be wrong, since it checks
2642 * if old_id != new_id.
2643 */
2644 route_entry_update_nhe(re, nhe);
2645
2646 /* Make it sure prefixlen is applied to the prefix. */
2647 apply_mask(p);
2648 if (src_p)
2649 apply_mask_ipv6(src_p);
2650
2651 /* Set default distance by route type. */
2652 if (re->distance == 0)
2653 re->distance = route_distance(re->type);
2654
2655 /* Lookup route node.*/
2656 rn = srcdest_rnode_get(table, p, src_p);
2657
2658 /*
2659 * If same type of route are installed, treat it as a implicit
2660 * withdraw.
2661 * If the user has specified the No route replace semantics
2662 * for the install don't do a route replace.
2663 */
2664 RNODE_FOREACH_RE (rn, same) {
2665 if (CHECK_FLAG(same->status, ROUTE_ENTRY_REMOVED))
2666 continue;
2667
2668 if (same->type != re->type)
2669 continue;
2670 if (same->instance != re->instance)
2671 continue;
2672 if (same->type == ZEBRA_ROUTE_KERNEL
2673 && same->metric != re->metric)
2674 continue;
2675
2676 if (CHECK_FLAG(re->flags, ZEBRA_FLAG_RR_USE_DISTANCE) &&
2677 same->distance != re->distance)
2678 continue;
2679
2680 /*
2681 * We should allow duplicate connected routes
2682 * because of IPv6 link-local routes and unnumbered
2683 * interfaces on Linux.
2684 */
2685 if (same->type != ZEBRA_ROUTE_CONNECT)
2686 break;
2687 }
2688
2689 /* If this route is kernel/connected route, notify the dataplane. */
2690 if (RIB_SYSTEM_ROUTE(re)) {
2691 /* Notify dataplane */
2692 dplane_sys_route_add(rn, re);
2693 }
2694
2695 /* Link new re to node.*/
2696 if (IS_ZEBRA_DEBUG_RIB) {
2697 rnode_debug(rn, re->vrf_id,
2698 "Inserting route rn %p, re %p (%s) existing %p",
2699 rn, re, zebra_route_string(re->type), same);
2700
2701 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
2702 route_entry_dump(p, src_p, re);
2703 }
2704
2705 SET_FLAG(re->status, ROUTE_ENTRY_CHANGED);
2706 rib_addnode(rn, re, 1);
2707 ret = 1;
2708
2709 /* Free implicit route.*/
2710 if (same) {
2711 rib_delnode(rn, same);
2712 ret = -1;
2713 }
2714
2715 route_unlock_node(rn);
2716 return ret;
2717 }
2718
2719 void rib_delete(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type,
2720 unsigned short instance, int flags, struct prefix *p,
2721 struct prefix_ipv6 *src_p, const struct nexthop *nh,
2722 uint32_t nhe_id, uint32_t table_id, uint32_t metric,
2723 uint8_t distance, bool fromkernel)
2724 {
2725 struct route_table *table;
2726 struct route_node *rn;
2727 struct route_entry *re;
2728 struct route_entry *fib = NULL;
2729 struct route_entry *same = NULL;
2730 struct nexthop *rtnh;
2731 char buf2[INET6_ADDRSTRLEN];
2732 rib_dest_t *dest;
2733
2734 assert(!src_p || !src_p->prefixlen || afi == AFI_IP6);
2735
2736 /* Lookup table. */
2737 table = zebra_vrf_lookup_table_with_table_id(afi, safi, vrf_id,
2738 table_id);
2739 if (!table)
2740 return;
2741
2742 /* Apply mask. */
2743 apply_mask(p);
2744 if (src_p)
2745 apply_mask_ipv6(src_p);
2746
2747 /* Lookup route node. */
2748 rn = srcdest_rnode_lookup(table, p, src_p);
2749 if (!rn) {
2750 char dst_buf[PREFIX_STRLEN], src_buf[PREFIX_STRLEN];
2751
2752 prefix2str(p, dst_buf, sizeof(dst_buf));
2753 if (src_p && src_p->prefixlen)
2754 prefix2str(src_p, src_buf, sizeof(src_buf));
2755 else
2756 src_buf[0] = '\0';
2757
2758 if (IS_ZEBRA_DEBUG_RIB) {
2759 struct vrf *vrf = vrf_lookup_by_id(vrf_id);
2760
2761 zlog_debug("%s[%d]:%s%s%s doesn't exist in rib",
2762 vrf->name, table_id, dst_buf,
2763 (src_buf[0] != '\0') ? " from " : "",
2764 src_buf);
2765 }
2766 return;
2767 }
2768
2769 dest = rib_dest_from_rnode(rn);
2770 fib = dest->selected_fib;
2771
2772 /* Lookup same type route. */
2773 RNODE_FOREACH_RE (rn, re) {
2774 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED))
2775 continue;
2776
2777 if (re->type != type)
2778 continue;
2779 if (re->instance != instance)
2780 continue;
2781 if (CHECK_FLAG(re->flags, ZEBRA_FLAG_RR_USE_DISTANCE) &&
2782 distance != re->distance)
2783 continue;
2784
2785 if (re->type == ZEBRA_ROUTE_KERNEL && re->metric != metric)
2786 continue;
2787 if (re->type == ZEBRA_ROUTE_CONNECT &&
2788 (rtnh = re->nhe->nhg->nexthop)
2789 && rtnh->type == NEXTHOP_TYPE_IFINDEX && nh) {
2790 if (rtnh->ifindex != nh->ifindex)
2791 continue;
2792 same = re;
2793 break;
2794 }
2795
2796 /* Make sure that the route found has the same gateway. */
2797 if (nhe_id && re->nhe_id == nhe_id) {
2798 same = re;
2799 break;
2800 }
2801
2802 if (nh == NULL) {
2803 same = re;
2804 break;
2805 }
2806 for (ALL_NEXTHOPS_PTR(re->nhe->nhg, rtnh)) {
2807 /*
2808 * No guarantee all kernel send nh with labels
2809 * on delete.
2810 */
2811 if (nexthop_same_no_labels(rtnh, nh)) {
2812 same = re;
2813 break;
2814 }
2815 }
2816
2817 if (same)
2818 break;
2819 }
2820 /* If same type of route can't be found and this message is from
2821 kernel. */
2822 if (!same) {
2823 /*
2824 * In the past(HA!) we could get here because
2825 * we were receiving a route delete from the
2826 * kernel and we're not marking the proto
2827 * as coming from it's appropriate originator.
2828 * Now that we are properly noticing the fact
2829 * that the kernel has deleted our route we
2830 * are not going to get called in this path
2831 * I am going to leave this here because
2832 * this might still work this way on non-linux
2833 * platforms as well as some weird state I have
2834 * not properly thought of yet.
2835 * If we can show that this code path is
2836 * dead then we can remove it.
2837 */
2838 if (fib && CHECK_FLAG(flags, ZEBRA_FLAG_SELFROUTE)) {
2839 if (IS_ZEBRA_DEBUG_RIB) {
2840 rnode_debug(rn, vrf_id,
2841 "rn %p, re %p (%s) was deleted from kernel, adding",
2842 rn, fib,
2843 zebra_route_string(fib->type));
2844 }
2845 if (allow_delete) {
2846 UNSET_FLAG(fib->status, ROUTE_ENTRY_INSTALLED);
2847 /* Unset flags. */
2848 for (rtnh = fib->nhe->nhg->nexthop; rtnh;
2849 rtnh = rtnh->next)
2850 UNSET_FLAG(rtnh->flags,
2851 NEXTHOP_FLAG_FIB);
2852
2853 /*
2854 * This is a non FRR route
2855 * as such we should mark
2856 * it as deleted
2857 */
2858 dest->selected_fib = NULL;
2859 } else {
2860 /* This means someone else, other than Zebra,
2861 * has deleted
2862 * a Zebra router from the kernel. We will add
2863 * it back */
2864 rib_install_kernel(rn, fib, NULL);
2865 }
2866 } else {
2867 if (IS_ZEBRA_DEBUG_RIB) {
2868 if (nh)
2869 rnode_debug(
2870 rn, vrf_id,
2871 "via %s ifindex %d type %d "
2872 "doesn't exist in rib",
2873 inet_ntop(afi2family(afi),
2874 &nh->gate, buf2,
2875 sizeof(buf2)),
2876 nh->ifindex, type);
2877 else
2878 rnode_debug(
2879 rn, vrf_id,
2880 "type %d doesn't exist in rib",
2881 type);
2882 }
2883 route_unlock_node(rn);
2884 return;
2885 }
2886 }
2887
2888 if (same) {
2889 if (fromkernel && CHECK_FLAG(flags, ZEBRA_FLAG_SELFROUTE)
2890 && !allow_delete) {
2891 rib_install_kernel(rn, same, NULL);
2892 route_unlock_node(rn);
2893
2894 return;
2895 }
2896
2897 /* Special handling for IPv4 or IPv6 routes sourced from
2898 * EVPN - the nexthop (and associated MAC) need to be
2899 * uninstalled if no more refs.
2900 */
2901 if (CHECK_FLAG(flags, ZEBRA_FLAG_EVPN_ROUTE)) {
2902 struct nexthop *tmp_nh;
2903
2904 for (ALL_NEXTHOPS_PTR(re->nhe->nhg, tmp_nh)) {
2905 struct ipaddr vtep_ip;
2906
2907 memset(&vtep_ip, 0, sizeof(struct ipaddr));
2908 if (afi == AFI_IP) {
2909 vtep_ip.ipa_type = IPADDR_V4;
2910 memcpy(&(vtep_ip.ipaddr_v4),
2911 &(tmp_nh->gate.ipv4),
2912 sizeof(struct in_addr));
2913 } else {
2914 vtep_ip.ipa_type = IPADDR_V6;
2915 memcpy(&(vtep_ip.ipaddr_v6),
2916 &(tmp_nh->gate.ipv6),
2917 sizeof(struct in6_addr));
2918 }
2919 zebra_vxlan_evpn_vrf_route_del(re->vrf_id,
2920 &vtep_ip, p);
2921 }
2922 }
2923
2924 /* Notify dplane if system route changes */
2925 if (RIB_SYSTEM_ROUTE(re))
2926 dplane_sys_route_del(rn, same);
2927
2928 rib_delnode(rn, same);
2929 }
2930
2931 route_unlock_node(rn);
2932 return;
2933 }
2934
2935
2936 int rib_add(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type,
2937 unsigned short instance, int flags, struct prefix *p,
2938 struct prefix_ipv6 *src_p, const struct nexthop *nh,
2939 uint32_t nhe_id, uint32_t table_id, uint32_t metric, uint32_t mtu,
2940 uint8_t distance, route_tag_t tag)
2941 {
2942 struct route_entry *re = NULL;
2943 struct nexthop *nexthop = NULL;
2944 struct nexthop_group *ng = NULL;
2945
2946 /* Allocate new route_entry structure. */
2947 re = XCALLOC(MTYPE_RE, sizeof(struct route_entry));
2948 re->type = type;
2949 re->instance = instance;
2950 re->distance = distance;
2951 re->flags = flags;
2952 re->metric = metric;
2953 re->mtu = mtu;
2954 re->table = table_id;
2955 re->vrf_id = vrf_id;
2956 re->uptime = monotime(NULL);
2957 re->tag = tag;
2958 re->nhe_id = nhe_id;
2959
2960 /* If the owner of the route supplies a shared nexthop-group id,
2961 * we'll use that. Otherwise, pass the nexthop along directly.
2962 */
2963 if (!nhe_id) {
2964 ng = nexthop_group_new();
2965
2966 /* Add nexthop. */
2967 nexthop = nexthop_new();
2968 *nexthop = *nh;
2969 nexthop_group_add_sorted(ng, nexthop);
2970 }
2971
2972 return rib_add_multipath(afi, safi, p, src_p, re, ng);
2973 }
2974
2975 static const char *rib_update_event2str(rib_update_event_t event)
2976 {
2977 const char *ret = "UNKNOWN";
2978
2979 switch (event) {
2980 case RIB_UPDATE_KERNEL:
2981 ret = "RIB_UPDATE_KERNEL";
2982 break;
2983 case RIB_UPDATE_RMAP_CHANGE:
2984 ret = "RIB_UPDATE_RMAP_CHANGE";
2985 break;
2986 case RIB_UPDATE_OTHER:
2987 ret = "RIB_UPDATE_OTHER";
2988 break;
2989 case RIB_UPDATE_MAX:
2990 break;
2991 }
2992
2993 return ret;
2994 }
2995
2996
2997 /* Schedule route nodes to be processed if they match the type */
2998 static void rib_update_route_node(struct route_node *rn, int type)
2999 {
3000 struct route_entry *re, *next;
3001 bool re_changed = false;
3002
3003 RNODE_FOREACH_RE_SAFE (rn, re, next) {
3004 if (type == ZEBRA_ROUTE_ALL || type == re->type) {
3005 SET_FLAG(re->status, ROUTE_ENTRY_CHANGED);
3006 re_changed = true;
3007 }
3008 }
3009
3010 if (re_changed)
3011 rib_queue_add(rn);
3012 }
3013
3014 /* Schedule routes of a particular table (address-family) based on event. */
3015 void rib_update_table(struct route_table *table, rib_update_event_t event)
3016 {
3017 struct route_node *rn;
3018
3019 if (IS_ZEBRA_DEBUG_EVENT) {
3020 struct zebra_vrf *zvrf;
3021 struct vrf *vrf;
3022
3023 zvrf = table->info ? ((rib_table_info_t *)table->info)->zvrf
3024 : NULL;
3025 vrf = zvrf ? zvrf->vrf : NULL;
3026
3027 zlog_debug("%s: %s VRF %s Table %u event %s", __func__,
3028 table->info ? afi2str(
3029 ((rib_table_info_t *)table->info)->afi)
3030 : "Unknown",
3031 vrf ? vrf->name : "Unknown",
3032 zvrf ? zvrf->table_id : 0,
3033 rib_update_event2str(event));
3034 }
3035
3036 /* Walk all routes and queue for processing, if appropriate for
3037 * the trigger event.
3038 */
3039 for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) {
3040 /*
3041 * If we are looking at a route node and the node
3042 * has already been queued we don't
3043 * need to queue it up again
3044 */
3045 if (rn->info
3046 && CHECK_FLAG(rib_dest_from_rnode(rn)->flags,
3047 RIB_ROUTE_ANY_QUEUED))
3048 continue;
3049
3050 switch (event) {
3051 case RIB_UPDATE_KERNEL:
3052 rib_update_route_node(rn, ZEBRA_ROUTE_KERNEL);
3053 break;
3054 case RIB_UPDATE_RMAP_CHANGE:
3055 case RIB_UPDATE_OTHER:
3056 rib_update_route_node(rn, ZEBRA_ROUTE_ALL);
3057 break;
3058 default:
3059 break;
3060 }
3061 }
3062 }
3063
3064 static void rib_update_handle_vrf(vrf_id_t vrf_id, rib_update_event_t event)
3065 {
3066 struct route_table *table;
3067
3068 if (IS_ZEBRA_DEBUG_EVENT)
3069 zlog_debug("%s: Handling VRF %s event %s", __func__,
3070 vrf_id_to_name(vrf_id), rib_update_event2str(event));
3071
3072 /* Process routes of interested address-families. */
3073 table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id);
3074 if (table)
3075 rib_update_table(table, event);
3076
3077 table = zebra_vrf_table(AFI_IP6, SAFI_UNICAST, vrf_id);
3078 if (table)
3079 rib_update_table(table, event);
3080 }
3081
3082 static void rib_update_handle_vrf_all(rib_update_event_t event)
3083 {
3084 struct zebra_router_table *zrt;
3085
3086 if (IS_ZEBRA_DEBUG_EVENT)
3087 zlog_debug("%s: Handling VRF (ALL) event %s", __func__,
3088 rib_update_event2str(event));
3089
3090 /* Just iterate over all the route tables, rather than vrf lookups */
3091 RB_FOREACH (zrt, zebra_router_table_head, &zrouter.tables)
3092 rib_update_table(zrt->table, event);
3093 }
3094
3095 struct rib_update_ctx {
3096 rib_update_event_t event;
3097 bool vrf_all;
3098 vrf_id_t vrf_id;
3099 };
3100
3101 static struct rib_update_ctx *rib_update_ctx_init(vrf_id_t vrf_id,
3102 rib_update_event_t event)
3103 {
3104 struct rib_update_ctx *ctx;
3105
3106 ctx = XCALLOC(MTYPE_RIB_UPDATE_CTX, sizeof(struct rib_update_ctx));
3107
3108 ctx->event = event;
3109 ctx->vrf_id = vrf_id;
3110
3111 return ctx;
3112 }
3113
3114 static void rib_update_ctx_fini(struct rib_update_ctx **ctx)
3115 {
3116 XFREE(MTYPE_RIB_UPDATE_CTX, *ctx);
3117
3118 *ctx = NULL;
3119 }
3120
3121 static int rib_update_handler(struct thread *thread)
3122 {
3123 struct rib_update_ctx *ctx;
3124
3125 ctx = THREAD_ARG(thread);
3126
3127 if (ctx->vrf_all)
3128 rib_update_handle_vrf_all(ctx->event);
3129 else
3130 rib_update_handle_vrf(ctx->vrf_id, ctx->event);
3131
3132 rib_update_ctx_fini(&ctx);
3133
3134 return 0;
3135 }
3136
3137 /*
3138 * Thread list to ensure we don't schedule a ton of events
3139 * if interfaces are flapping for instance.
3140 */
3141 static struct thread *t_rib_update_threads[RIB_UPDATE_MAX];
3142
3143 /* Schedule a RIB update event for specific vrf */
3144 void rib_update_vrf(vrf_id_t vrf_id, rib_update_event_t event)
3145 {
3146 struct rib_update_ctx *ctx;
3147
3148 ctx = rib_update_ctx_init(vrf_id, event);
3149
3150 /* Don't worry about making sure multiple rib updates for specific vrf
3151 * are scheduled at once for now. If it becomes a problem, we can use a
3152 * lookup of some sort to keep track of running threads via t_vrf_id
3153 * like how we are doing it in t_rib_update_threads[].
3154 */
3155 thread_add_event(zrouter.master, rib_update_handler, ctx, 0, NULL);
3156
3157 if (IS_ZEBRA_DEBUG_EVENT)
3158 zlog_debug("%s: Scheduled VRF %s, event %s", __func__,
3159 vrf_id_to_name(ctx->vrf_id),
3160 rib_update_event2str(event));
3161 }
3162
3163 /* Schedule a RIB update event for all vrfs */
3164 void rib_update(rib_update_event_t event)
3165 {
3166 struct rib_update_ctx *ctx;
3167
3168 ctx = rib_update_ctx_init(0, event);
3169
3170 ctx->vrf_all = true;
3171
3172 if (!thread_add_event(zrouter.master, rib_update_handler, ctx, 0,
3173 &t_rib_update_threads[event]))
3174 rib_update_ctx_fini(&ctx); /* Already scheduled */
3175 else if (IS_ZEBRA_DEBUG_EVENT)
3176 zlog_debug("%s: Schedued VRF (ALL), event %s", __func__,
3177 rib_update_event2str(event));
3178 }
3179
3180 /* Delete self installed routes after zebra is relaunched. */
3181 void rib_sweep_table(struct route_table *table)
3182 {
3183 struct route_node *rn;
3184 struct route_entry *re;
3185 struct route_entry *next;
3186 struct nexthop *nexthop;
3187
3188 if (!table)
3189 return;
3190
3191 for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) {
3192 RNODE_FOREACH_RE_SAFE (rn, re, next) {
3193
3194 if (IS_ZEBRA_DEBUG_RIB)
3195 route_entry_dump(&rn->p, NULL, re);
3196
3197 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED))
3198 continue;
3199
3200 if (!CHECK_FLAG(re->flags, ZEBRA_FLAG_SELFROUTE))
3201 continue;
3202
3203 /*
3204 * If routes are older than startup_time then
3205 * we know we read them in from the kernel.
3206 * As such we can safely remove them.
3207 */
3208 if (zrouter.startup_time < re->uptime)
3209 continue;
3210
3211 /*
3212 * So we are starting up and have received
3213 * routes from the kernel that we have installed
3214 * from a previous run of zebra but not cleaned
3215 * up ( say a kill -9 )
3216 * But since we haven't actually installed
3217 * them yet( we received them from the kernel )
3218 * we don't think they are active.
3219 * So let's pretend they are active to actually
3220 * remove them.
3221 * In all honesty I'm not sure if we should
3222 * mark them as active when we receive them
3223 * This is startup only so probably ok.
3224 *
3225 * If we ever decide to move rib_sweep_table
3226 * to a different spot (ie startup )
3227 * this decision needs to be revisited
3228 */
3229 SET_FLAG(re->status, ROUTE_ENTRY_INSTALLED);
3230 for (ALL_NEXTHOPS_PTR(re->nhe->nhg, nexthop))
3231 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
3232
3233 rib_uninstall_kernel(rn, re);
3234 rib_delnode(rn, re);
3235 }
3236 }
3237 }
3238
3239 /* Sweep all RIB tables. */
3240 int rib_sweep_route(struct thread *t)
3241 {
3242 struct vrf *vrf;
3243 struct zebra_vrf *zvrf;
3244
3245 RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) {
3246 if ((zvrf = vrf->info) == NULL)
3247 continue;
3248
3249 rib_sweep_table(zvrf->table[AFI_IP][SAFI_UNICAST]);
3250 rib_sweep_table(zvrf->table[AFI_IP6][SAFI_UNICAST]);
3251 }
3252
3253 zebra_router_sweep_route();
3254 zebra_router_sweep_nhgs();
3255
3256 return 0;
3257 }
3258
3259 /* Remove specific by protocol routes from 'table'. */
3260 unsigned long rib_score_proto_table(uint8_t proto, unsigned short instance,
3261 struct route_table *table)
3262 {
3263 struct route_node *rn;
3264 struct route_entry *re;
3265 struct route_entry *next;
3266 unsigned long n = 0;
3267
3268 if (table)
3269 for (rn = route_top(table); rn; rn = srcdest_route_next(rn))
3270 RNODE_FOREACH_RE_SAFE (rn, re, next) {
3271 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED))
3272 continue;
3273 if (re->type == proto
3274 && re->instance == instance) {
3275 rib_delnode(rn, re);
3276 n++;
3277 }
3278 }
3279 return n;
3280 }
3281
3282 /* Remove specific by protocol routes. */
3283 unsigned long rib_score_proto(uint8_t proto, unsigned short instance)
3284 {
3285 struct vrf *vrf;
3286 struct zebra_vrf *zvrf;
3287 struct other_route_table *ort;
3288 unsigned long cnt = 0;
3289
3290 RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) {
3291 zvrf = vrf->info;
3292 if (!zvrf)
3293 continue;
3294
3295 cnt += rib_score_proto_table(proto, instance,
3296 zvrf->table[AFI_IP][SAFI_UNICAST])
3297 + rib_score_proto_table(
3298 proto, instance,
3299 zvrf->table[AFI_IP6][SAFI_UNICAST]);
3300
3301 frr_each(otable, &zvrf->other_tables, ort) cnt +=
3302 rib_score_proto_table(proto, instance, ort->table);
3303 }
3304
3305 return cnt;
3306 }
3307
3308 /* Close RIB and clean up kernel routes. */
3309 void rib_close_table(struct route_table *table)
3310 {
3311 struct route_node *rn;
3312 rib_table_info_t *info;
3313 rib_dest_t *dest;
3314
3315 if (!table)
3316 return;
3317
3318 info = route_table_get_info(table);
3319
3320 for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) {
3321 dest = rib_dest_from_rnode(rn);
3322
3323 if (dest && dest->selected_fib) {
3324 if (info->safi == SAFI_UNICAST)
3325 hook_call(rib_update, rn, NULL);
3326
3327 rib_uninstall_kernel(rn, dest->selected_fib);
3328 dest->selected_fib = NULL;
3329 }
3330 }
3331 }
3332
3333 /*
3334 * Handler for async dataplane results after a pseudowire installation
3335 */
3336 static int handle_pw_result(struct zebra_dplane_ctx *ctx)
3337 {
3338 struct zebra_pw *pw;
3339 struct zebra_vrf *vrf;
3340
3341 /* The pseudowire code assumes success - we act on an error
3342 * result for installation attempts here.
3343 */
3344 if (dplane_ctx_get_op(ctx) != DPLANE_OP_PW_INSTALL)
3345 goto done;
3346
3347 if (dplane_ctx_get_status(ctx) != ZEBRA_DPLANE_REQUEST_SUCCESS) {
3348 vrf = zebra_vrf_lookup_by_id(dplane_ctx_get_vrf(ctx));
3349 pw = zebra_pw_find(vrf, dplane_ctx_get_ifname(ctx));
3350 if (pw)
3351 zebra_pw_install_failure(pw);
3352 }
3353
3354 done:
3355
3356 return 0;
3357 }
3358
3359
3360 /*
3361 * Handle results from the dataplane system. Dequeue update context
3362 * structs, dispatch to appropriate internal handlers.
3363 */
3364 static int rib_process_dplane_results(struct thread *thread)
3365 {
3366 struct zebra_dplane_ctx *ctx;
3367 struct dplane_ctx_q ctxlist;
3368 bool shut_p = false;
3369
3370 /* Dequeue a list of completed updates with one lock/unlock cycle */
3371
3372 do {
3373 TAILQ_INIT(&ctxlist);
3374
3375 /* Take lock controlling queue of results */
3376 frr_with_mutex(&dplane_mutex) {
3377 /* Dequeue list of context structs */
3378 dplane_ctx_list_append(&ctxlist, &rib_dplane_q);
3379 }
3380
3381 /* Dequeue context block */
3382 ctx = dplane_ctx_dequeue(&ctxlist);
3383
3384 /* If we've emptied the results queue, we're done */
3385 if (ctx == NULL)
3386 break;
3387
3388 /* If zebra is shutting down, avoid processing results,
3389 * just drain the results queue.
3390 */
3391 shut_p = atomic_load_explicit(&zrouter.in_shutdown,
3392 memory_order_relaxed);
3393 if (shut_p) {
3394 while (ctx) {
3395 dplane_ctx_fini(&ctx);
3396
3397 ctx = dplane_ctx_dequeue(&ctxlist);
3398 }
3399
3400 continue;
3401 }
3402
3403 while (ctx) {
3404 switch (dplane_ctx_get_op(ctx)) {
3405 case DPLANE_OP_ROUTE_INSTALL:
3406 case DPLANE_OP_ROUTE_UPDATE:
3407 case DPLANE_OP_ROUTE_DELETE:
3408 {
3409 /* Bit of special case for route updates
3410 * that were generated by async notifications:
3411 * we don't want to continue processing these
3412 * in the rib.
3413 */
3414 if (dplane_ctx_get_notif_provider(ctx) == 0)
3415 rib_process_result(ctx);
3416 else
3417 dplane_ctx_fini(&ctx);
3418 }
3419 break;
3420
3421 case DPLANE_OP_ROUTE_NOTIFY:
3422 rib_process_dplane_notify(ctx);
3423 break;
3424
3425 case DPLANE_OP_NH_INSTALL:
3426 case DPLANE_OP_NH_UPDATE:
3427 case DPLANE_OP_NH_DELETE:
3428 zebra_nhg_dplane_result(ctx);
3429 break;
3430
3431 case DPLANE_OP_LSP_INSTALL:
3432 case DPLANE_OP_LSP_UPDATE:
3433 case DPLANE_OP_LSP_DELETE:
3434 {
3435 /* Bit of special case for LSP updates
3436 * that were generated by async notifications:
3437 * we don't want to continue processing these.
3438 */
3439 if (dplane_ctx_get_notif_provider(ctx) == 0)
3440 zebra_mpls_lsp_dplane_result(ctx);
3441 else
3442 dplane_ctx_fini(&ctx);
3443 }
3444 break;
3445
3446 case DPLANE_OP_LSP_NOTIFY:
3447 zebra_mpls_process_dplane_notify(ctx);
3448 break;
3449
3450 case DPLANE_OP_PW_INSTALL:
3451 case DPLANE_OP_PW_UNINSTALL:
3452 handle_pw_result(ctx);
3453 break;
3454
3455 case DPLANE_OP_SYS_ROUTE_ADD:
3456 case DPLANE_OP_SYS_ROUTE_DELETE:
3457 /* No further processing in zebra for these. */
3458 dplane_ctx_fini(&ctx);
3459 break;
3460
3461 case DPLANE_OP_MAC_INSTALL:
3462 case DPLANE_OP_MAC_DELETE:
3463 zebra_vxlan_handle_result(ctx);
3464 break;
3465
3466 /* Some op codes not handled here */
3467 case DPLANE_OP_ADDR_INSTALL:
3468 case DPLANE_OP_ADDR_UNINSTALL:
3469 case DPLANE_OP_NEIGH_INSTALL:
3470 case DPLANE_OP_NEIGH_UPDATE:
3471 case DPLANE_OP_NEIGH_DELETE:
3472 case DPLANE_OP_VTEP_ADD:
3473 case DPLANE_OP_VTEP_DELETE:
3474 case DPLANE_OP_NONE:
3475 /* Don't expect this: just return the struct? */
3476 dplane_ctx_fini(&ctx);
3477 break;
3478
3479 } /* Dispatch by op code */
3480
3481 ctx = dplane_ctx_dequeue(&ctxlist);
3482 }
3483
3484 } while (1);
3485
3486 return 0;
3487 }
3488
3489 /*
3490 * Results are returned from the dataplane subsystem, in the context of
3491 * the dataplane pthread. We enqueue the results here for processing by
3492 * the main thread later.
3493 */
3494 static int rib_dplane_results(struct dplane_ctx_q *ctxlist)
3495 {
3496 /* Take lock controlling queue of results */
3497 frr_with_mutex(&dplane_mutex) {
3498 /* Enqueue context blocks */
3499 dplane_ctx_list_append(&rib_dplane_q, ctxlist);
3500 }
3501
3502 /* Ensure event is signalled to zebra main pthread */
3503 thread_add_event(zrouter.master, rib_process_dplane_results, NULL, 0,
3504 &t_dplane);
3505
3506 return 0;
3507 }
3508
3509 /*
3510 * Ensure there are no empty slots in the route_info array.
3511 * Every route type in zebra should be present there.
3512 */
3513 static void check_route_info(void)
3514 {
3515 int len = array_size(route_info);
3516
3517 /*
3518 * ZEBRA_ROUTE_SYSTEM is special cased since
3519 * its key is 0 anyway.
3520 *
3521 * ZEBRA_ROUTE_ALL is also ignored.
3522 */
3523 for (int i = 0; i < len; i++) {
3524 if (i == ZEBRA_ROUTE_SYSTEM || i == ZEBRA_ROUTE_ALL)
3525 continue;
3526 assert(route_info[i].key);
3527 assert(route_info[i].meta_q_map < MQ_SIZE);
3528 }
3529 }
3530
3531 /* Routing information base initialize. */
3532 void rib_init(void)
3533 {
3534 check_route_info();
3535
3536 rib_queue_init();
3537
3538 /* Init dataplane, and register for results */
3539 pthread_mutex_init(&dplane_mutex, NULL);
3540 TAILQ_INIT(&rib_dplane_q);
3541 zebra_dplane_init(rib_dplane_results);
3542 }
3543
3544 /*
3545 * vrf_id_get_next
3546 *
3547 * Get the first vrf id that is greater than the given vrf id if any.
3548 *
3549 * Returns true if a vrf id was found, false otherwise.
3550 */
3551 static inline int vrf_id_get_next(vrf_id_t vrf_id, vrf_id_t *next_id_p)
3552 {
3553 struct vrf *vrf;
3554
3555 vrf = vrf_lookup_by_id(vrf_id);
3556 if (vrf) {
3557 vrf = RB_NEXT(vrf_id_head, vrf);
3558 if (vrf) {
3559 *next_id_p = vrf->vrf_id;
3560 return 1;
3561 }
3562 }
3563
3564 return 0;
3565 }
3566
3567 /*
3568 * rib_tables_iter_next
3569 *
3570 * Returns the next table in the iteration.
3571 */
3572 struct route_table *rib_tables_iter_next(rib_tables_iter_t *iter)
3573 {
3574 struct route_table *table;
3575
3576 /*
3577 * Array that helps us go over all AFI/SAFI combinations via one
3578 * index.
3579 */
3580 static const struct {
3581 afi_t afi;
3582 safi_t safi;
3583 } afi_safis[] = {
3584 {AFI_IP, SAFI_UNICAST}, {AFI_IP, SAFI_MULTICAST},
3585 {AFI_IP, SAFI_LABELED_UNICAST}, {AFI_IP6, SAFI_UNICAST},
3586 {AFI_IP6, SAFI_MULTICAST}, {AFI_IP6, SAFI_LABELED_UNICAST},
3587 };
3588
3589 table = NULL;
3590
3591 switch (iter->state) {
3592
3593 case RIB_TABLES_ITER_S_INIT:
3594 iter->vrf_id = VRF_DEFAULT;
3595 iter->afi_safi_ix = -1;
3596
3597 /* Fall through */
3598
3599 case RIB_TABLES_ITER_S_ITERATING:
3600 iter->afi_safi_ix++;
3601 while (1) {
3602
3603 while (iter->afi_safi_ix
3604 < (int)array_size(afi_safis)) {
3605 table = zebra_vrf_table(
3606 afi_safis[iter->afi_safi_ix].afi,
3607 afi_safis[iter->afi_safi_ix].safi,
3608 iter->vrf_id);
3609 if (table)
3610 break;
3611
3612 iter->afi_safi_ix++;
3613 }
3614
3615 /*
3616 * Found another table in this vrf.
3617 */
3618 if (table)
3619 break;
3620
3621 /*
3622 * Done with all tables in the current vrf, go to the
3623 * next
3624 * one.
3625 */
3626 if (!vrf_id_get_next(iter->vrf_id, &iter->vrf_id))
3627 break;
3628
3629 iter->afi_safi_ix = 0;
3630 }
3631
3632 break;
3633
3634 case RIB_TABLES_ITER_S_DONE:
3635 return NULL;
3636 }
3637
3638 if (table)
3639 iter->state = RIB_TABLES_ITER_S_ITERATING;
3640 else
3641 iter->state = RIB_TABLES_ITER_S_DONE;
3642
3643 return table;
3644 }