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