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