]> git.proxmox.com Git - mirror_frr.git/blob - zebra/zebra_rib.c
Merge pull request #1852 from donaldsharp/notify_owner_fail
[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 "if.h"
24 #include "prefix.h"
25 #include "table.h"
26 #include "memory.h"
27 #include "zebra_memory.h"
28 #include "command.h"
29 #include "log.h"
30 #include "log_int.h"
31 #include "sockunion.h"
32 #include "linklist.h"
33 #include "thread.h"
34 #include "workqueue.h"
35 #include "prefix.h"
36 #include "routemap.h"
37 #include "nexthop.h"
38 #include "vrf.h"
39 #include "mpls.h"
40 #include "srcdest_table.h"
41
42 #include "zebra/rib.h"
43 #include "zebra/rt.h"
44 #include "zebra/zebra_ns.h"
45 #include "zebra/zserv.h"
46 #include "zebra/zebra_vrf.h"
47 #include "zebra/redistribute.h"
48 #include "zebra/zebra_routemap.h"
49 #include "zebra/debug.h"
50 #include "zebra/zebra_rnh.h"
51 #include "zebra/interface.h"
52 #include "zebra/connected.h"
53 #include "zebra/zebra_vxlan.h"
54
55 DEFINE_HOOK(rib_update, (struct route_node * rn, const char *reason),
56 (rn, reason))
57
58 /* Should we allow non Quagga processes to delete our routes */
59 extern int allow_delete;
60
61 /* Each route type's string and default distance value. */
62 static const struct {
63 int key;
64 int distance;
65 } route_info[ZEBRA_ROUTE_MAX] = {
66 [ZEBRA_ROUTE_SYSTEM] = {ZEBRA_ROUTE_SYSTEM, 0},
67 [ZEBRA_ROUTE_KERNEL] = {ZEBRA_ROUTE_KERNEL, 0},
68 [ZEBRA_ROUTE_CONNECT] = {ZEBRA_ROUTE_CONNECT, 0},
69 [ZEBRA_ROUTE_STATIC] = {ZEBRA_ROUTE_STATIC, 1},
70 [ZEBRA_ROUTE_RIP] = {ZEBRA_ROUTE_RIP, 120},
71 [ZEBRA_ROUTE_RIPNG] = {ZEBRA_ROUTE_RIPNG, 120},
72 [ZEBRA_ROUTE_OSPF] = {ZEBRA_ROUTE_OSPF, 110},
73 [ZEBRA_ROUTE_OSPF6] = {ZEBRA_ROUTE_OSPF6, 110},
74 [ZEBRA_ROUTE_ISIS] = {ZEBRA_ROUTE_ISIS, 115},
75 [ZEBRA_ROUTE_BGP] = {ZEBRA_ROUTE_BGP, 20 /* IBGP is 200. */},
76 [ZEBRA_ROUTE_PIM] = {ZEBRA_ROUTE_PIM, 255},
77 [ZEBRA_ROUTE_EIGRP] = {ZEBRA_ROUTE_EIGRP, 90},
78 [ZEBRA_ROUTE_NHRP] = {ZEBRA_ROUTE_NHRP, 10},
79 [ZEBRA_ROUTE_HSLS] = {ZEBRA_ROUTE_HSLS, 255},
80 [ZEBRA_ROUTE_OLSR] = {ZEBRA_ROUTE_OLSR, 255},
81 [ZEBRA_ROUTE_TABLE] = {ZEBRA_ROUTE_TABLE, 150},
82 [ZEBRA_ROUTE_LDP] = {ZEBRA_ROUTE_LDP, 150},
83 [ZEBRA_ROUTE_VNC] = {ZEBRA_ROUTE_VNC, 20},
84 [ZEBRA_ROUTE_VNC_DIRECT] = {ZEBRA_ROUTE_VNC_DIRECT, 20},
85 [ZEBRA_ROUTE_VNC_DIRECT_RH] = {ZEBRA_ROUTE_VNC_DIRECT_RH, 20},
86 [ZEBRA_ROUTE_BGP_DIRECT] = {ZEBRA_ROUTE_BGP_DIRECT, 20},
87 [ZEBRA_ROUTE_BGP_DIRECT_EXT] = {ZEBRA_ROUTE_BGP_DIRECT_EXT, 20},
88 [ZEBRA_ROUTE_BABEL] = {ZEBRA_ROUTE_BABEL, 100},
89 [ZEBRA_ROUTE_SHARP] = {ZEBRA_ROUTE_SHARP, 150},
90
91 /* no entry/default: 150 */
92 };
93
94 /* RPF lookup behaviour */
95 static enum multicast_mode ipv4_multicast_mode = MCAST_NO_CONFIG;
96
97
98 static void __attribute__((format(printf, 5, 6)))
99 _rnode_zlog(const char *_func, vrf_id_t vrf_id, struct route_node *rn,
100 int priority, const char *msgfmt, ...)
101 {
102 char buf[SRCDEST2STR_BUFFER + sizeof(" (MRIB)")];
103 char msgbuf[512];
104 va_list ap;
105
106 va_start(ap, msgfmt);
107 vsnprintf(msgbuf, sizeof(msgbuf), msgfmt, ap);
108 va_end(ap);
109
110 if (rn) {
111 rib_table_info_t *info = srcdest_rnode_table_info(rn);
112 srcdest_rnode2str(rn, buf, sizeof(buf));
113
114 if (info->safi == SAFI_MULTICAST)
115 strcat(buf, " (MRIB)");
116 } else {
117 snprintf(buf, sizeof(buf), "{(route_node *) NULL}");
118 }
119
120 zlog(priority, "%s: %d:%s: %s", _func, vrf_id, buf, msgbuf);
121 }
122
123 #define rnode_debug(node, vrf_id, ...) \
124 _rnode_zlog(__func__, vrf_id, node, LOG_DEBUG, __VA_ARGS__)
125 #define rnode_info(node, ...) \
126 _rnode_zlog(__func__, vrf_id, node, LOG_INFO, __VA_ARGS__)
127
128 uint8_t route_distance(int type)
129 {
130 uint8_t distance;
131
132 if ((unsigned)type >= array_size(route_info))
133 distance = 150;
134 else
135 distance = route_info[type].distance;
136
137 return distance;
138 }
139
140 int is_zebra_valid_kernel_table(u_int32_t table_id)
141 {
142 if ((table_id > ZEBRA_KERNEL_TABLE_MAX))
143 return 0;
144
145 #ifdef linux
146 if ((table_id == RT_TABLE_UNSPEC) || (table_id == RT_TABLE_LOCAL)
147 || (table_id == RT_TABLE_COMPAT))
148 return 0;
149 #endif
150
151 return 1;
152 }
153
154 int is_zebra_main_routing_table(u_int32_t table_id)
155 {
156 if ((table_id == RT_TABLE_MAIN)
157 || (table_id == zebrad.rtm_table_default))
158 return 1;
159 return 0;
160 }
161
162 int zebra_check_addr(struct prefix *p)
163 {
164 if (p->family == AF_INET) {
165 u_int32_t addr;
166
167 addr = p->u.prefix4.s_addr;
168 addr = ntohl(addr);
169
170 if (IPV4_NET127(addr) || IN_CLASSD(addr)
171 || IPV4_LINKLOCAL(addr))
172 return 0;
173 }
174 if (p->family == AF_INET6) {
175 if (IN6_IS_ADDR_LOOPBACK(&p->u.prefix6))
176 return 0;
177 if (IN6_IS_ADDR_LINKLOCAL(&p->u.prefix6))
178 return 0;
179 }
180 return 1;
181 }
182
183 /* Add nexthop to the end of a rib node's nexthop list */
184 void route_entry_nexthop_add(struct route_entry *re, struct nexthop *nexthop)
185 {
186 nexthop_add(&re->nexthop, nexthop);
187 re->nexthop_num++;
188 }
189
190
191 /**
192 * copy_nexthop - copy a nexthop to the rib structure.
193 */
194 void route_entry_copy_nexthops(struct route_entry *re, struct nexthop *nh)
195 {
196 assert(!re->nexthop);
197 copy_nexthops(&re->nexthop, nh, NULL);
198 for (struct nexthop *nexthop = nh; nexthop; nexthop = nexthop->next)
199 re->nexthop_num++;
200 }
201
202 /* Delete specified nexthop from the list. */
203 void route_entry_nexthop_delete(struct route_entry *re, struct nexthop *nexthop)
204 {
205 if (nexthop->next)
206 nexthop->next->prev = nexthop->prev;
207 if (nexthop->prev)
208 nexthop->prev->next = nexthop->next;
209 else
210 re->nexthop = nexthop->next;
211 re->nexthop_num--;
212 }
213
214
215 struct nexthop *route_entry_nexthop_ifindex_add(struct route_entry *re,
216 ifindex_t ifindex,
217 vrf_id_t nh_vrf_id)
218 {
219 struct nexthop *nexthop;
220
221 nexthop = nexthop_new();
222 nexthop->type = NEXTHOP_TYPE_IFINDEX;
223 nexthop->ifindex = ifindex;
224 nexthop->vrf_id = nh_vrf_id;
225
226 route_entry_nexthop_add(re, nexthop);
227
228 return nexthop;
229 }
230
231 struct nexthop *route_entry_nexthop_ipv4_add(struct route_entry *re,
232 struct in_addr *ipv4,
233 struct in_addr *src,
234 vrf_id_t nh_vrf_id)
235 {
236 struct nexthop *nexthop;
237
238 nexthop = nexthop_new();
239 nexthop->type = NEXTHOP_TYPE_IPV4;
240 nexthop->vrf_id = nh_vrf_id;
241 nexthop->gate.ipv4 = *ipv4;
242 if (src)
243 nexthop->src.ipv4 = *src;
244
245 route_entry_nexthop_add(re, nexthop);
246
247 return nexthop;
248 }
249
250 struct nexthop *route_entry_nexthop_ipv4_ifindex_add(struct route_entry *re,
251 struct in_addr *ipv4,
252 struct in_addr *src,
253 ifindex_t ifindex,
254 vrf_id_t nh_vrf_id)
255 {
256 struct nexthop *nexthop;
257 struct interface *ifp;
258
259 nexthop = nexthop_new();
260 nexthop->vrf_id = nh_vrf_id;
261 nexthop->type = NEXTHOP_TYPE_IPV4_IFINDEX;
262 nexthop->gate.ipv4 = *ipv4;
263 if (src)
264 nexthop->src.ipv4 = *src;
265 nexthop->ifindex = ifindex;
266 ifp = if_lookup_by_index(nexthop->ifindex, nh_vrf_id);
267 /*Pending: need to think if null ifp here is ok during bootup?
268 There was a crash because ifp here was coming to be NULL */
269 if (ifp)
270 if (connected_is_unnumbered(ifp)
271 || CHECK_FLAG(re->flags, ZEBRA_FLAG_EVPN_ROUTE)) {
272 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ONLINK);
273 }
274
275 route_entry_nexthop_add(re, nexthop);
276
277 return nexthop;
278 }
279
280 struct nexthop *route_entry_nexthop_ipv6_add(struct route_entry *re,
281 struct in6_addr *ipv6,
282 vrf_id_t nh_vrf_id)
283 {
284 struct nexthop *nexthop;
285
286 nexthop = nexthop_new();
287 nexthop->vrf_id = nh_vrf_id;
288 nexthop->type = NEXTHOP_TYPE_IPV6;
289 nexthop->gate.ipv6 = *ipv6;
290
291 route_entry_nexthop_add(re, nexthop);
292
293 return nexthop;
294 }
295
296 struct nexthop *route_entry_nexthop_ipv6_ifindex_add(struct route_entry *re,
297 struct in6_addr *ipv6,
298 ifindex_t ifindex,
299 vrf_id_t nh_vrf_id)
300 {
301 struct nexthop *nexthop;
302
303 nexthop = nexthop_new();
304 nexthop->vrf_id = nh_vrf_id;
305 nexthop->type = NEXTHOP_TYPE_IPV6_IFINDEX;
306 nexthop->gate.ipv6 = *ipv6;
307 nexthop->ifindex = ifindex;
308
309 route_entry_nexthop_add(re, nexthop);
310
311 return nexthop;
312 }
313
314 struct nexthop *route_entry_nexthop_blackhole_add(struct route_entry *re,
315 enum blackhole_type bh_type)
316 {
317 struct nexthop *nexthop;
318
319 nexthop = nexthop_new();
320 nexthop->vrf_id = VRF_DEFAULT;
321 nexthop->type = NEXTHOP_TYPE_BLACKHOLE;
322 nexthop->bh_type = bh_type;
323
324 route_entry_nexthop_add(re, nexthop);
325
326 return nexthop;
327 }
328
329 static void nexthop_set_resolved(afi_t afi, struct nexthop *newhop,
330 struct nexthop *nexthop)
331 {
332 struct nexthop *resolved_hop;
333
334 resolved_hop = nexthop_new();
335 SET_FLAG(resolved_hop->flags, NEXTHOP_FLAG_ACTIVE);
336
337 resolved_hop->vrf_id = nexthop->vrf_id;
338 switch (newhop->type) {
339 case NEXTHOP_TYPE_IPV4:
340 case NEXTHOP_TYPE_IPV4_IFINDEX:
341 /* If the resolving route specifies a gateway, use it */
342 resolved_hop->type = newhop->type;
343 resolved_hop->gate.ipv4 = newhop->gate.ipv4;
344
345 if (newhop->ifindex) {
346 resolved_hop->type = NEXTHOP_TYPE_IPV4_IFINDEX;
347 resolved_hop->ifindex = newhop->ifindex;
348 if (newhop->flags & NEXTHOP_FLAG_ONLINK)
349 resolved_hop->flags |= NEXTHOP_FLAG_ONLINK;
350 }
351 break;
352 case NEXTHOP_TYPE_IPV6:
353 case NEXTHOP_TYPE_IPV6_IFINDEX:
354 resolved_hop->type = newhop->type;
355 resolved_hop->gate.ipv6 = newhop->gate.ipv6;
356
357 if (newhop->ifindex) {
358 resolved_hop->type = NEXTHOP_TYPE_IPV6_IFINDEX;
359 resolved_hop->ifindex = newhop->ifindex;
360 }
361 break;
362 case NEXTHOP_TYPE_IFINDEX:
363 /* If the resolving route is an interface route,
364 * it means the gateway we are looking up is connected
365 * to that interface. (The actual network is _not_ onlink).
366 * Therefore, the resolved route should have the original
367 * gateway as nexthop as it is directly connected.
368 *
369 * On Linux, we have to set the onlink netlink flag because
370 * otherwise, the kernel won't accept the route.
371 */
372 resolved_hop->flags |= NEXTHOP_FLAG_ONLINK;
373 if (afi == AFI_IP) {
374 resolved_hop->type = NEXTHOP_TYPE_IPV4_IFINDEX;
375 resolved_hop->gate.ipv4 = nexthop->gate.ipv4;
376 } else if (afi == AFI_IP6) {
377 resolved_hop->type = NEXTHOP_TYPE_IPV6_IFINDEX;
378 resolved_hop->gate.ipv6 = nexthop->gate.ipv6;
379 }
380 resolved_hop->ifindex = newhop->ifindex;
381 break;
382 case NEXTHOP_TYPE_BLACKHOLE:
383 resolved_hop->type = NEXTHOP_TYPE_BLACKHOLE;
384 resolved_hop->bh_type = nexthop->bh_type;
385 break;
386 }
387
388 /* Copy labels of the resolved route */
389 if (newhop->nh_label)
390 nexthop_add_labels(resolved_hop, newhop->nh_label_type,
391 newhop->nh_label->num_labels,
392 &newhop->nh_label->label[0]);
393
394 resolved_hop->rparent = nexthop;
395 nexthop_add(&nexthop->resolved, resolved_hop);
396 }
397
398 /* If force flag is not set, do not modify falgs at all for uninstall
399 the route from FIB. */
400 static int nexthop_active(afi_t afi, struct route_entry *re,
401 struct nexthop *nexthop, int set,
402 struct route_node *top)
403 {
404 struct prefix p;
405 struct route_table *table;
406 struct route_node *rn;
407 struct route_entry *match = NULL;
408 int resolved;
409 struct nexthop *newhop;
410 struct interface *ifp;
411 rib_dest_t *dest;
412
413 if ((nexthop->type == NEXTHOP_TYPE_IPV4)
414 || nexthop->type == NEXTHOP_TYPE_IPV6)
415 nexthop->ifindex = 0;
416
417 if (set) {
418 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_RECURSIVE);
419 nexthops_free(nexthop->resolved);
420 nexthop->resolved = NULL;
421 re->nexthop_mtu = 0;
422 }
423
424 /* Skip nexthops that have been filtered out due to route-map */
425 /* The nexthops are specific to this route and so the same */
426 /* nexthop for a different route may not have this flag set */
427 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FILTERED))
428 return 0;
429
430 /*
431 * Check to see if we should trust the passed in information
432 * for UNNUMBERED interfaces as that we won't find the GW
433 * address in the routing table.
434 */
435 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ONLINK)) {
436 ifp = if_lookup_by_index(nexthop->ifindex, nexthop->vrf_id);
437 if (ifp && connected_is_unnumbered(ifp)) {
438 if (if_is_operative(ifp))
439 return 1;
440 else
441 return 0;
442 } else
443 return 0;
444 }
445
446 /* Make lookup prefix. */
447 memset(&p, 0, sizeof(struct prefix));
448 switch (afi) {
449 case AFI_IP:
450 p.family = AF_INET;
451 p.prefixlen = IPV4_MAX_PREFIXLEN;
452 p.u.prefix4 = nexthop->gate.ipv4;
453 break;
454 case AFI_IP6:
455 p.family = AF_INET6;
456 p.prefixlen = IPV6_MAX_PREFIXLEN;
457 p.u.prefix6 = nexthop->gate.ipv6;
458 break;
459 default:
460 assert(afi != AFI_IP && afi != AFI_IP6);
461 break;
462 }
463 /* Lookup table. */
464 table = zebra_vrf_table(afi, SAFI_UNICAST, nexthop->vrf_id);
465 if (!table)
466 return 0;
467
468 rn = route_node_match(table, (struct prefix *)&p);
469 while (rn) {
470 route_unlock_node(rn);
471
472 /* Lookup should halt if we've matched against ourselves ('top',
473 * if specified) - i.e., we cannot have a nexthop NH1 is
474 * resolved by a route NH1. The exception is if the route is a
475 * host route.
476 */
477 if (top && rn == top)
478 if (((afi == AFI_IP) && (rn->p.prefixlen != 32))
479 || ((afi == AFI_IP6) && (rn->p.prefixlen != 128)))
480 return 0;
481
482 /* Pick up selected route. */
483 /* However, do not resolve over default route unless explicitly
484 * allowed. */
485 if (is_default_prefix(&rn->p)
486 && !rnh_resolve_via_default(p.family))
487 return 0;
488
489 dest = rib_dest_from_rnode(rn);
490 if (dest && dest->selected_fib
491 && !CHECK_FLAG(dest->selected_fib->status,
492 ROUTE_ENTRY_REMOVED)
493 && dest->selected_fib->type != ZEBRA_ROUTE_TABLE)
494 match = dest->selected_fib;
495
496 /* If there is no selected route or matched route is EGP, go up
497 tree. */
498 if (!match) {
499 do {
500 rn = rn->parent;
501 } while (rn && rn->info == NULL);
502 if (rn)
503 route_lock_node(rn);
504
505 continue;
506 }
507
508 if (match->type == ZEBRA_ROUTE_CONNECT) {
509 /* Directly point connected route. */
510 newhop = match->nexthop;
511 if (newhop) {
512 if (nexthop->type == NEXTHOP_TYPE_IPV4
513 || nexthop->type == NEXTHOP_TYPE_IPV6)
514 nexthop->ifindex = newhop->ifindex;
515 }
516 return 1;
517 } else if (CHECK_FLAG(re->flags, ZEBRA_FLAG_ALLOW_RECURSION)) {
518 resolved = 0;
519 for (ALL_NEXTHOPS(match->nexthop, newhop)) {
520 if (!CHECK_FLAG(newhop->flags,
521 NEXTHOP_FLAG_FIB))
522 continue;
523 if (CHECK_FLAG(newhop->flags,
524 NEXTHOP_FLAG_RECURSIVE))
525 continue;
526
527 if (set) {
528 SET_FLAG(nexthop->flags,
529 NEXTHOP_FLAG_RECURSIVE);
530 SET_FLAG(re->status,
531 ROUTE_ENTRY_NEXTHOPS_CHANGED);
532 nexthop_set_resolved(afi, newhop,
533 nexthop);
534 }
535 resolved = 1;
536 }
537 if (resolved && set)
538 re->nexthop_mtu = match->mtu;
539 return resolved;
540 } else if (re->type == ZEBRA_ROUTE_STATIC) {
541 resolved = 0;
542 for (ALL_NEXTHOPS(match->nexthop, newhop)) {
543 if (!CHECK_FLAG(newhop->flags,
544 NEXTHOP_FLAG_FIB))
545 continue;
546
547 if (set) {
548 SET_FLAG(nexthop->flags,
549 NEXTHOP_FLAG_RECURSIVE);
550 nexthop_set_resolved(afi, newhop,
551 nexthop);
552 }
553 resolved = 1;
554 }
555 if (resolved && set)
556 re->nexthop_mtu = match->mtu;
557 return resolved;
558 } else {
559 return 0;
560 }
561 }
562 return 0;
563 }
564
565 struct route_entry *rib_match(afi_t afi, safi_t safi, vrf_id_t vrf_id,
566 union g_addr *addr, struct route_node **rn_out)
567 {
568 struct prefix p;
569 struct route_table *table;
570 struct route_node *rn;
571 struct route_entry *match = NULL;
572 struct nexthop *newhop;
573
574 /* Lookup table. */
575 table = zebra_vrf_table(afi, safi, vrf_id);
576 if (!table)
577 return 0;
578
579 memset(&p, 0, sizeof(struct prefix));
580 p.family = afi;
581 if (afi == AFI_IP) {
582 p.u.prefix4 = addr->ipv4;
583 p.prefixlen = IPV4_MAX_PREFIXLEN;
584 } else {
585 p.u.prefix6 = addr->ipv6;
586 p.prefixlen = IPV6_MAX_PREFIXLEN;
587 }
588
589 rn = route_node_match(table, (struct prefix *)&p);
590
591 while (rn) {
592 rib_dest_t *dest;
593
594 route_unlock_node(rn);
595
596 dest = rib_dest_from_rnode(rn);
597 if (dest && dest->selected_fib
598 && !CHECK_FLAG(dest->selected_fib->status,
599 ROUTE_ENTRY_REMOVED))
600 match = dest->selected_fib;
601
602 /* If there is no selected route or matched route is EGP, go up
603 tree. */
604 if (!match) {
605 do {
606 rn = rn->parent;
607 } while (rn && rn->info == NULL);
608 if (rn)
609 route_lock_node(rn);
610 } else {
611 if (match->type != ZEBRA_ROUTE_CONNECT) {
612 int found = 0;
613 for (ALL_NEXTHOPS(match->nexthop, newhop))
614 if (CHECK_FLAG(newhop->flags,
615 NEXTHOP_FLAG_FIB)) {
616 found = 1;
617 break;
618 }
619 if (!found)
620 return NULL;
621 }
622
623 if (rn_out)
624 *rn_out = rn;
625 return match;
626 }
627 }
628 return NULL;
629 }
630
631 struct route_entry *rib_match_ipv4_multicast(vrf_id_t vrf_id,
632 struct in_addr addr,
633 struct route_node **rn_out)
634 {
635 struct route_entry *re = NULL, *mre = NULL, *ure = NULL;
636 struct route_node *m_rn = NULL, *u_rn = NULL;
637 union g_addr gaddr = {.ipv4 = addr};
638
639 switch (ipv4_multicast_mode) {
640 case MCAST_MRIB_ONLY:
641 return rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr,
642 rn_out);
643 case MCAST_URIB_ONLY:
644 return rib_match(AFI_IP, SAFI_UNICAST, vrf_id, &gaddr, rn_out);
645 case MCAST_NO_CONFIG:
646 case MCAST_MIX_MRIB_FIRST:
647 re = mre = rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr,
648 &m_rn);
649 if (!mre)
650 re = ure = rib_match(AFI_IP, SAFI_UNICAST, vrf_id,
651 &gaddr, &u_rn);
652 break;
653 case MCAST_MIX_DISTANCE:
654 mre = rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr, &m_rn);
655 ure = rib_match(AFI_IP, SAFI_UNICAST, vrf_id, &gaddr, &u_rn);
656 if (mre && ure)
657 re = ure->distance < mre->distance ? ure : mre;
658 else if (mre)
659 re = mre;
660 else if (ure)
661 re = ure;
662 break;
663 case MCAST_MIX_PFXLEN:
664 mre = rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr, &m_rn);
665 ure = rib_match(AFI_IP, SAFI_UNICAST, vrf_id, &gaddr, &u_rn);
666 if (mre && ure)
667 re = u_rn->p.prefixlen > m_rn->p.prefixlen ? ure : mre;
668 else if (mre)
669 re = mre;
670 else if (ure)
671 re = ure;
672 break;
673 }
674
675 if (rn_out)
676 *rn_out = (re == mre) ? m_rn : u_rn;
677
678 if (IS_ZEBRA_DEBUG_RIB) {
679 char buf[BUFSIZ];
680 inet_ntop(AF_INET, &addr, buf, BUFSIZ);
681
682 zlog_debug("%s: %s: found %s, using %s", __func__, buf,
683 mre ? (ure ? "MRIB+URIB" : "MRIB")
684 : ure ? "URIB" : "nothing",
685 re == ure ? "URIB" : re == mre ? "MRIB" : "none");
686 }
687 return re;
688 }
689
690 void multicast_mode_ipv4_set(enum multicast_mode mode)
691 {
692 if (IS_ZEBRA_DEBUG_RIB)
693 zlog_debug("%s: multicast lookup mode set (%d)", __func__,
694 mode);
695 ipv4_multicast_mode = mode;
696 }
697
698 enum multicast_mode multicast_mode_ipv4_get(void)
699 {
700 return ipv4_multicast_mode;
701 }
702
703 struct route_entry *rib_lookup_ipv4(struct prefix_ipv4 *p, vrf_id_t vrf_id)
704 {
705 struct route_table *table;
706 struct route_node *rn;
707 struct route_entry *match = NULL;
708 struct nexthop *nexthop;
709 rib_dest_t *dest;
710
711 /* Lookup table. */
712 table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id);
713 if (!table)
714 return 0;
715
716 rn = route_node_lookup(table, (struct prefix *)p);
717
718 /* No route for this prefix. */
719 if (!rn)
720 return NULL;
721
722 /* Unlock node. */
723 route_unlock_node(rn);
724 dest = rib_dest_from_rnode(rn);
725
726 if (dest && dest->selected_fib
727 && !CHECK_FLAG(dest->selected_fib->status, ROUTE_ENTRY_REMOVED))
728 match = dest->selected_fib;
729
730 if (!match)
731 return NULL;
732
733 if (match->type == ZEBRA_ROUTE_CONNECT)
734 return match;
735
736 for (ALL_NEXTHOPS(match->nexthop, nexthop))
737 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB))
738 return match;
739
740 return NULL;
741 }
742
743 /*
744 * This clone function, unlike its original rib_lookup_ipv4(), checks
745 * if specified IPv4 route record (prefix/mask -> gate) exists in
746 * the whole RIB and has ROUTE_ENTRY_SELECTED_FIB set.
747 *
748 * Return values:
749 * -1: error
750 * 0: exact match found
751 * 1: a match was found with a different gate
752 * 2: connected route found
753 * 3: no matches found
754 */
755 int rib_lookup_ipv4_route(struct prefix_ipv4 *p, union sockunion *qgate,
756 vrf_id_t vrf_id)
757 {
758 struct route_table *table;
759 struct route_node *rn;
760 struct route_entry *match = NULL;
761 struct nexthop *nexthop;
762 int nexthops_active;
763 rib_dest_t *dest;
764
765 /* Lookup table. */
766 table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id);
767 if (!table)
768 return ZEBRA_RIB_LOOKUP_ERROR;
769
770 /* Scan the RIB table for exactly matching RIB entry. */
771 rn = route_node_lookup(table, (struct prefix *)p);
772
773 /* No route for this prefix. */
774 if (!rn)
775 return ZEBRA_RIB_NOTFOUND;
776
777 /* Unlock node. */
778 route_unlock_node(rn);
779 dest = rib_dest_from_rnode(rn);
780
781 /* Find out if a "selected" RR for the discovered RIB entry exists ever.
782 */
783 if (dest && dest->selected_fib
784 && !CHECK_FLAG(dest->selected_fib->status, ROUTE_ENTRY_REMOVED))
785 match = dest->selected_fib;
786
787 /* None such found :( */
788 if (!match)
789 return ZEBRA_RIB_NOTFOUND;
790
791 if (match->type == ZEBRA_ROUTE_CONNECT)
792 return ZEBRA_RIB_FOUND_CONNECTED;
793
794 /* Ok, we have a cood candidate, let's check it's nexthop list... */
795 nexthops_active = 0;
796 for (ALL_NEXTHOPS(match->nexthop, nexthop))
797 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) {
798 nexthops_active = 1;
799 if (nexthop->gate.ipv4.s_addr == sockunion2ip(qgate))
800 return ZEBRA_RIB_FOUND_EXACT;
801 if (IS_ZEBRA_DEBUG_RIB) {
802 char gate_buf[INET_ADDRSTRLEN],
803 qgate_buf[INET_ADDRSTRLEN];
804 inet_ntop(AF_INET, &nexthop->gate.ipv4.s_addr,
805 gate_buf, INET_ADDRSTRLEN);
806 inet_ntop(AF_INET, &sockunion2ip(qgate),
807 qgate_buf, INET_ADDRSTRLEN);
808 zlog_debug("%s: qgate == %s, %s == %s",
809 __func__, qgate_buf,
810 nexthop->rparent ? "rgate" : "gate",
811 gate_buf);
812 }
813 }
814
815 if (nexthops_active)
816 return ZEBRA_RIB_FOUND_NOGATE;
817
818 return ZEBRA_RIB_NOTFOUND;
819 }
820
821 #define RIB_SYSTEM_ROUTE(R) \
822 ((R)->type == ZEBRA_ROUTE_KERNEL || (R)->type == ZEBRA_ROUTE_CONNECT)
823
824 /* This function verifies reachability of one given nexthop, which can be
825 * numbered or unnumbered, IPv4 or IPv6. The result is unconditionally stored
826 * in nexthop->flags field. If the 4th parameter, 'set', is non-zero,
827 * nexthop->ifindex will be updated appropriately as well.
828 * An existing route map can turn (otherwise active) nexthop into inactive, but
829 * not vice versa.
830 *
831 * The return value is the final value of 'ACTIVE' flag.
832 */
833
834 static unsigned nexthop_active_check(struct route_node *rn,
835 struct route_entry *re,
836 struct nexthop *nexthop, int set)
837 {
838 struct interface *ifp;
839 route_map_result_t ret = RMAP_MATCH;
840 int family;
841 char buf[SRCDEST2STR_BUFFER];
842 struct prefix *p, *src_p;
843 srcdest_rnode_prefixes(rn, &p, &src_p);
844
845 if (rn->p.family == AF_INET)
846 family = AFI_IP;
847 else if (rn->p.family == AF_INET6)
848 family = AFI_IP6;
849 else
850 family = 0;
851 switch (nexthop->type) {
852 case NEXTHOP_TYPE_IFINDEX:
853 ifp = if_lookup_by_index(nexthop->ifindex, nexthop->vrf_id);
854 if (ifp && if_is_operative(ifp))
855 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
856 else
857 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
858 break;
859 case NEXTHOP_TYPE_IPV4:
860 case NEXTHOP_TYPE_IPV4_IFINDEX:
861 family = AFI_IP;
862 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_EVPN_RVTEP))
863 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
864 else if (nexthop_active(AFI_IP, re, nexthop, set, rn))
865 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
866 else
867 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
868 break;
869 case NEXTHOP_TYPE_IPV6:
870 family = AFI_IP6;
871 if (nexthop_active(AFI_IP6, re, nexthop, set, rn))
872 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
873 else
874 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
875 break;
876 case NEXTHOP_TYPE_IPV6_IFINDEX:
877 /* RFC 5549, v4 prefix with v6 NH */
878 if (rn->p.family != AF_INET)
879 family = AFI_IP6;
880 if (IN6_IS_ADDR_LINKLOCAL(&nexthop->gate.ipv6)) {
881 ifp = if_lookup_by_index(nexthop->ifindex,
882 nexthop->vrf_id);
883 if (ifp && if_is_operative(ifp))
884 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
885 else
886 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
887 } else {
888 if (nexthop_active(AFI_IP6, re, nexthop, set, rn))
889 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
890 else
891 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
892 }
893 break;
894 case NEXTHOP_TYPE_BLACKHOLE:
895 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
896 break;
897 default:
898 break;
899 }
900 if (!CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE))
901 return 0;
902
903 /* XXX: What exactly do those checks do? Do we support
904 * e.g. IPv4 routes with IPv6 nexthops or vice versa? */
905 if (RIB_SYSTEM_ROUTE(re) || (family == AFI_IP && p->family != AF_INET)
906 || (family == AFI_IP6 && p->family != AF_INET6))
907 return CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
908
909 /* The original code didn't determine the family correctly
910 * e.g. for NEXTHOP_TYPE_IFINDEX. Retrieve the correct afi
911 * from the rib_table_info in those cases.
912 * Possibly it may be better to use only the rib_table_info
913 * in every case.
914 */
915 if (!family) {
916 rib_table_info_t *info;
917
918 info = srcdest_rnode_table_info(rn);
919 family = info->afi;
920 }
921
922 memset(&nexthop->rmap_src.ipv6, 0, sizeof(union g_addr));
923
924 /* It'll get set if required inside */
925 ret = zebra_route_map_check(family, re->type, p, nexthop,
926 nexthop->vrf_id, re->tag);
927 if (ret == RMAP_DENYMATCH) {
928 if (IS_ZEBRA_DEBUG_RIB) {
929 srcdest_rnode2str(rn, buf, sizeof(buf));
930 zlog_debug(
931 "%u:%s: Filtering out with NH out %s due to route map",
932 re->vrf_id, buf,
933 ifindex2ifname(nexthop->ifindex,
934 nexthop->vrf_id));
935 }
936 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
937 }
938 return CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
939 }
940
941 /* Iterate over all nexthops of the given RIB entry and refresh their
942 * ACTIVE flag. re->nexthop_active_num is updated accordingly. If any
943 * nexthop is found to toggle the ACTIVE flag, the whole re structure
944 * is flagged with ROUTE_ENTRY_CHANGED. The 4th 'set' argument is
945 * transparently passed to nexthop_active_check().
946 *
947 * Return value is the new number of active nexthops.
948 */
949
950 static int nexthop_active_update(struct route_node *rn, struct route_entry *re,
951 int set)
952 {
953 struct nexthop *nexthop;
954 union g_addr prev_src;
955 unsigned int prev_active, new_active, old_num_nh;
956 ifindex_t prev_index;
957 old_num_nh = re->nexthop_active_num;
958
959 re->nexthop_active_num = 0;
960 UNSET_FLAG(re->status, ROUTE_ENTRY_CHANGED);
961
962 for (nexthop = re->nexthop; nexthop; nexthop = nexthop->next) {
963 /* No protocol daemon provides src and so we're skipping
964 * tracking it */
965 prev_src = nexthop->rmap_src;
966 prev_active = CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
967 prev_index = nexthop->ifindex;
968 if ((new_active = nexthop_active_check(rn, re, nexthop, set)))
969 re->nexthop_active_num++;
970 /* Don't allow src setting on IPv6 addr for now */
971 if (prev_active != new_active || prev_index != nexthop->ifindex
972 || ((nexthop->type >= NEXTHOP_TYPE_IFINDEX
973 && nexthop->type < NEXTHOP_TYPE_IPV6)
974 && prev_src.ipv4.s_addr
975 != nexthop->rmap_src.ipv4.s_addr)
976 || ((nexthop->type >= NEXTHOP_TYPE_IPV6
977 && nexthop->type < NEXTHOP_TYPE_BLACKHOLE)
978 && !(IPV6_ADDR_SAME(&prev_src.ipv6,
979 &nexthop->rmap_src.ipv6)))) {
980 SET_FLAG(re->status, ROUTE_ENTRY_CHANGED);
981 SET_FLAG(re->status, ROUTE_ENTRY_NEXTHOPS_CHANGED);
982 }
983 }
984
985 if (old_num_nh != re->nexthop_active_num)
986 SET_FLAG(re->status, ROUTE_ENTRY_CHANGED);
987
988 if (CHECK_FLAG(re->status, ROUTE_ENTRY_CHANGED)) {
989 SET_FLAG(re->status, ROUTE_ENTRY_NEXTHOPS_CHANGED);
990 }
991
992 return re->nexthop_active_num;
993 }
994
995 /*
996 * Is this RIB labeled-unicast? It must be of type BGP and all paths
997 * (nexthops) must have a label.
998 */
999 int zebra_rib_labeled_unicast(struct route_entry *re)
1000 {
1001 struct nexthop *nexthop = NULL;
1002
1003 if (re->type != ZEBRA_ROUTE_BGP)
1004 return 0;
1005
1006 for (ALL_NEXTHOPS(re->nexthop, nexthop))
1007 if (!nexthop->nh_label || !nexthop->nh_label->num_labels)
1008 return 0;
1009
1010 return 1;
1011 }
1012
1013 void kernel_route_rib_pass_fail(struct route_node *rn, struct prefix *p,
1014 struct route_entry *re,
1015 enum southbound_results res)
1016 {
1017 struct nexthop *nexthop;
1018 char buf[PREFIX_STRLEN];
1019 rib_dest_t *dest;
1020
1021 dest = rib_dest_from_rnode(rn);
1022
1023 switch (res) {
1024 case SOUTHBOUND_INSTALL_SUCCESS:
1025 dest->selected_fib = re;
1026 for (ALL_NEXTHOPS(re->nexthop, nexthop)) {
1027 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_RECURSIVE))
1028 continue;
1029
1030 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE))
1031 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
1032 else
1033 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
1034 }
1035 zsend_route_notify_owner(re, p, ZAPI_ROUTE_INSTALLED);
1036 break;
1037 case SOUTHBOUND_INSTALL_FAILURE:
1038 /*
1039 * I am not sure this is the right thing to do here
1040 * but the code always set selected_fib before
1041 * this assignment was moved here.
1042 */
1043 dest->selected_fib = re;
1044
1045 zsend_route_notify_owner(re, p, ZAPI_ROUTE_FAIL_INSTALL);
1046 zlog_warn("%u:%s: Route install failed", re->vrf_id,
1047 prefix2str(p, buf, sizeof(buf)));
1048 break;
1049 case SOUTHBOUND_DELETE_SUCCESS:
1050 /*
1051 * The case where selected_fib is not re is
1052 * when we have received a system route
1053 * that is overriding our installed route
1054 * as such we should leave the selected_fib
1055 * pointer alone
1056 */
1057 if (dest->selected_fib == re)
1058 dest->selected_fib = NULL;
1059 for (ALL_NEXTHOPS(re->nexthop, nexthop))
1060 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
1061
1062 zsend_route_notify_owner(re, p, ZAPI_ROUTE_REMOVED);
1063 break;
1064 case SOUTHBOUND_DELETE_FAILURE:
1065 /*
1066 * Should we set this to NULL if the
1067 * delete fails?
1068 */
1069 dest->selected_fib = NULL;
1070 zlog_warn("%u:%s: Route Deletion failure", re->vrf_id,
1071 prefix2str(p, buf, sizeof(buf)));
1072
1073 zsend_route_notify_owner(re, p, ZAPI_ROUTE_REMOVE_FAIL);
1074 break;
1075 }
1076 }
1077
1078 /* Update flag indicates whether this is a "replace" or not. Currently, this
1079 * is only used for IPv4.
1080 */
1081 void rib_install_kernel(struct route_node *rn, struct route_entry *re,
1082 struct route_entry *old)
1083 {
1084 struct nexthop *nexthop;
1085 rib_table_info_t *info = srcdest_rnode_table_info(rn);
1086 struct prefix *p, *src_p;
1087 struct zebra_vrf *zvrf = vrf_info_lookup(re->vrf_id);
1088
1089 srcdest_rnode_prefixes(rn, &p, &src_p);
1090
1091 if (info->safi != SAFI_UNICAST) {
1092 for (ALL_NEXTHOPS(re->nexthop, nexthop))
1093 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
1094 return;
1095 } else {
1096 struct nexthop *prev;
1097
1098 for (ALL_NEXTHOPS(re->nexthop, nexthop)) {
1099 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_DUPLICATE);
1100 for (ALL_NEXTHOPS(re->nexthop, prev)) {
1101 if (prev == nexthop)
1102 break;
1103 if (nexthop_same_firsthop(nexthop, prev)) {
1104 SET_FLAG(nexthop->flags,
1105 NEXTHOP_FLAG_DUPLICATE);
1106 break;
1107 }
1108 }
1109 }
1110 }
1111
1112 /*
1113 * If this is a replace to a new RE let the originator of the RE
1114 * know that they've lost
1115 */
1116 if (old && (old != re) && (old->type != re->type))
1117 zsend_route_notify_owner(old, p, ZAPI_ROUTE_BETTER_ADMIN_WON);
1118
1119 /*
1120 * Make sure we update the FPM any time we send new information to
1121 * the kernel.
1122 */
1123 hook_call(rib_update, rn, "installing in kernel");
1124 kernel_route_rib(rn, p, src_p, old, re);
1125 zvrf->installs++;
1126
1127 return;
1128 }
1129
1130 /* Uninstall the route from kernel. */
1131 void rib_uninstall_kernel(struct route_node *rn, struct route_entry *re)
1132 {
1133 struct nexthop *nexthop;
1134 rib_table_info_t *info = srcdest_rnode_table_info(rn);
1135 struct prefix *p, *src_p;
1136 struct zebra_vrf *zvrf = vrf_info_lookup(re->vrf_id);
1137
1138 srcdest_rnode_prefixes(rn, &p, &src_p);
1139
1140 if (info->safi != SAFI_UNICAST) {
1141 for (ALL_NEXTHOPS(re->nexthop, nexthop))
1142 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
1143 return;
1144 }
1145
1146 /*
1147 * Make sure we update the FPM any time we send new information to
1148 * the kernel.
1149 */
1150 hook_call(rib_update, rn, "uninstalling from kernel");
1151 kernel_route_rib(rn, p, src_p, re, NULL);
1152 if (zvrf)
1153 zvrf->removals++;
1154
1155 return;
1156 }
1157
1158 /* Uninstall the route from kernel. */
1159 static void rib_uninstall(struct route_node *rn, struct route_entry *re)
1160 {
1161 rib_table_info_t *info = srcdest_rnode_table_info(rn);
1162 rib_dest_t *dest = rib_dest_from_rnode(rn);
1163
1164 if (dest && dest->selected_fib == re) {
1165 if (info->safi == SAFI_UNICAST)
1166 hook_call(rib_update, rn, "rib_uninstall");
1167
1168 if (!RIB_SYSTEM_ROUTE(re))
1169 rib_uninstall_kernel(rn, re);
1170
1171 /* If labeled-unicast route, uninstall transit LSP. */
1172 if (zebra_rib_labeled_unicast(re))
1173 zebra_mpls_lsp_uninstall(info->zvrf, rn, re);
1174 }
1175
1176 if (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED)) {
1177 struct prefix *p, *src_p;
1178 srcdest_rnode_prefixes(rn, &p, &src_p);
1179
1180 redistribute_delete(p, src_p, re);
1181 UNSET_FLAG(re->flags, ZEBRA_FLAG_SELECTED);
1182 }
1183 }
1184
1185 /*
1186 * rib_can_delete_dest
1187 *
1188 * Returns TRUE if the given dest can be deleted from the table.
1189 */
1190 static int rib_can_delete_dest(rib_dest_t *dest)
1191 {
1192 if (dest->routes) {
1193 return 0;
1194 }
1195
1196 /*
1197 * Don't delete the dest if we have to update the FPM about this
1198 * prefix.
1199 */
1200 if (CHECK_FLAG(dest->flags, RIB_DEST_UPDATE_FPM)
1201 || CHECK_FLAG(dest->flags, RIB_DEST_SENT_TO_FPM))
1202 return 0;
1203
1204 return 1;
1205 }
1206
1207 /*
1208 * rib_gc_dest
1209 *
1210 * Garbage collect the rib dest corresponding to the given route node
1211 * if appropriate.
1212 *
1213 * Returns TRUE if the dest was deleted, FALSE otherwise.
1214 */
1215 int rib_gc_dest(struct route_node *rn)
1216 {
1217 rib_dest_t *dest;
1218
1219 dest = rib_dest_from_rnode(rn);
1220 if (!dest)
1221 return 0;
1222
1223 if (!rib_can_delete_dest(dest))
1224 return 0;
1225
1226 if (IS_ZEBRA_DEBUG_RIB) {
1227 struct zebra_vrf *zvrf;
1228
1229 zvrf = rib_dest_vrf(dest);
1230 rnode_debug(rn, zvrf_id(zvrf), "removing dest from table");
1231 }
1232
1233 dest->rnode = NULL;
1234 XFREE(MTYPE_RIB_DEST, dest);
1235 rn->info = NULL;
1236
1237 /*
1238 * Release the one reference that we keep on the route node.
1239 */
1240 route_unlock_node(rn);
1241 return 1;
1242 }
1243
1244 static void rib_process_add_fib(struct zebra_vrf *zvrf, struct route_node *rn,
1245 struct route_entry *new)
1246 {
1247 rib_dest_t *dest = rib_dest_from_rnode(rn);
1248
1249 hook_call(rib_update, rn, "new route selected");
1250
1251 /* Update real nexthop. This may actually determine if nexthop is active
1252 * or not. */
1253 if (!nexthop_active_update(rn, new, 1)) {
1254 UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED);
1255 return;
1256 }
1257
1258 if (IS_ZEBRA_DEBUG_RIB) {
1259 char buf[SRCDEST2STR_BUFFER];
1260 srcdest_rnode2str(rn, buf, sizeof(buf));
1261 zlog_debug("%u:%s: Adding route rn %p, re %p (type %d)",
1262 zvrf_id(zvrf), buf, rn, new, new->type);
1263 }
1264
1265 /* If labeled-unicast route, install transit LSP. */
1266 if (zebra_rib_labeled_unicast(new))
1267 zebra_mpls_lsp_install(zvrf, rn, new);
1268
1269 if (!RIB_SYSTEM_ROUTE(new))
1270 rib_install_kernel(rn, new, NULL);
1271 else
1272 dest->selected_fib = new;
1273
1274 UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED);
1275 }
1276
1277 static void rib_process_del_fib(struct zebra_vrf *zvrf, struct route_node *rn,
1278 struct route_entry *old)
1279 {
1280 rib_dest_t *dest = rib_dest_from_rnode(rn);
1281 hook_call(rib_update, rn, "removing existing route");
1282
1283 /* Uninstall from kernel. */
1284 if (IS_ZEBRA_DEBUG_RIB) {
1285 char buf[SRCDEST2STR_BUFFER];
1286 srcdest_rnode2str(rn, buf, sizeof(buf));
1287 zlog_debug("%u:%s: Deleting route rn %p, re %p (type %d)",
1288 zvrf_id(zvrf), buf, rn, old, old->type);
1289 }
1290
1291 /* If labeled-unicast route, uninstall transit LSP. */
1292 if (zebra_rib_labeled_unicast(old))
1293 zebra_mpls_lsp_uninstall(zvrf, rn, old);
1294
1295 if (!RIB_SYSTEM_ROUTE(old))
1296 rib_uninstall_kernel(rn, old);
1297 else {
1298 /*
1299 * We are setting this to NULL here
1300 * because that is what we traditionally
1301 * have been doing. I am not positive
1302 * that this is the right thing to do
1303 * but let's leave the code alone
1304 * for the RIB_SYSTEM_ROUTE case
1305 */
1306 dest->selected_fib = NULL;
1307 }
1308
1309 /* Update nexthop for route, reset changed flag. */
1310 nexthop_active_update(rn, old, 1);
1311 UNSET_FLAG(old->status, ROUTE_ENTRY_CHANGED);
1312 }
1313
1314 static void rib_process_update_fib(struct zebra_vrf *zvrf,
1315 struct route_node *rn,
1316 struct route_entry *old,
1317 struct route_entry *new)
1318 {
1319 struct nexthop *nexthop = NULL;
1320 int nh_active = 0;
1321 rib_dest_t *dest = rib_dest_from_rnode(rn);
1322
1323 /*
1324 * We have to install or update if a new route has been selected or
1325 * something has changed.
1326 */
1327 if (new != old || CHECK_FLAG(new->status, ROUTE_ENTRY_CHANGED)) {
1328 hook_call(rib_update, rn, "updating existing route");
1329
1330 /* Update the nexthop; we could determine here that nexthop is
1331 * inactive. */
1332 if (nexthop_active_update(rn, new, 1))
1333 nh_active = 1;
1334
1335 /* If nexthop is active, install the selected route, if
1336 * appropriate. If
1337 * the install succeeds, cleanup flags for prior route, if
1338 * different from
1339 * newly selected.
1340 */
1341 if (nh_active) {
1342 if (IS_ZEBRA_DEBUG_RIB) {
1343 char buf[SRCDEST2STR_BUFFER];
1344 srcdest_rnode2str(rn, buf, sizeof(buf));
1345 if (new != old)
1346 zlog_debug(
1347 "%u:%s: Updating route rn %p, re %p (type %d) "
1348 "old %p (type %d)",
1349 zvrf_id(zvrf), buf, rn, new,
1350 new->type, old, old->type);
1351 else
1352 zlog_debug(
1353 "%u:%s: Updating route rn %p, re %p (type %d)",
1354 zvrf_id(zvrf), buf, rn, new,
1355 new->type);
1356 }
1357
1358 /* If labeled-unicast route, uninstall transit LSP. */
1359 if (zebra_rib_labeled_unicast(old))
1360 zebra_mpls_lsp_uninstall(zvrf, rn, old);
1361
1362 /* Non-system route should be installed. */
1363 if (!RIB_SYSTEM_ROUTE(new)) {
1364 /* If labeled-unicast route, install transit
1365 * LSP. */
1366 if (zebra_rib_labeled_unicast(new))
1367 zebra_mpls_lsp_install(zvrf, rn, new);
1368
1369 rib_install_kernel(rn, new, old);
1370 } else {
1371 /*
1372 * We do not need to install the
1373 * selected route because it
1374 * is already isntalled by
1375 * the system( ie not us )
1376 * so just mark it as winning
1377 * we do need to ensure that
1378 * if we uninstall a route
1379 * from ourselves we don't
1380 * over write this pointer
1381 */
1382 dest->selected_fib = NULL;
1383 }
1384 /* If install succeeded or system route, cleanup flags
1385 * for prior route. */
1386 if (new != old) {
1387 if (RIB_SYSTEM_ROUTE(new)) {
1388 if (!RIB_SYSTEM_ROUTE(old))
1389 rib_uninstall_kernel(rn, old);
1390 } else {
1391 for (nexthop = old->nexthop; nexthop;
1392 nexthop = nexthop->next)
1393 UNSET_FLAG(nexthop->flags,
1394 NEXTHOP_FLAG_FIB);
1395 }
1396 }
1397 }
1398
1399 /*
1400 * If nexthop for selected route is not active or install
1401 * failed, we
1402 * may need to uninstall and delete for redistribution.
1403 */
1404 if (!nh_active) {
1405 if (IS_ZEBRA_DEBUG_RIB) {
1406 char buf[SRCDEST2STR_BUFFER];
1407 srcdest_rnode2str(rn, buf, sizeof(buf));
1408 if (new != old)
1409 zlog_debug(
1410 "%u:%s: Deleting route rn %p, re %p (type %d) "
1411 "old %p (type %d) - %s",
1412 zvrf_id(zvrf), buf, rn, new,
1413 new->type, old, old->type,
1414 nh_active ? "install failed"
1415 : "nexthop inactive");
1416 else
1417 zlog_debug(
1418 "%u:%s: Deleting route rn %p, re %p (type %d) - %s",
1419 zvrf_id(zvrf), buf, rn, new,
1420 new->type,
1421 nh_active ? "install failed"
1422 : "nexthop inactive");
1423 }
1424
1425 /* If labeled-unicast route, uninstall transit LSP. */
1426 if (zebra_rib_labeled_unicast(old))
1427 zebra_mpls_lsp_uninstall(zvrf, rn, old);
1428
1429 if (!RIB_SYSTEM_ROUTE(old))
1430 rib_uninstall_kernel(rn, old);
1431 else
1432 dest->selected_fib = NULL;
1433 }
1434 } else {
1435 /*
1436 * Same route selected; check if in the FIB and if not,
1437 * re-install. This
1438 * is housekeeping code to deal with race conditions in kernel
1439 * with linux
1440 * netlink reporting interface up before IPv4 or IPv6 protocol
1441 * is ready
1442 * to add routes.
1443 */
1444 if (!RIB_SYSTEM_ROUTE(new)) {
1445 bool in_fib = false;
1446
1447 for (ALL_NEXTHOPS(new->nexthop, nexthop))
1448 if (CHECK_FLAG(nexthop->flags,
1449 NEXTHOP_FLAG_FIB)) {
1450 in_fib = true;
1451 break;
1452 }
1453 if (!in_fib)
1454 rib_install_kernel(rn, new, NULL);
1455 }
1456 }
1457
1458 /* Update prior route. */
1459 if (new != old) {
1460 /* Set real nexthop. */
1461 nexthop_active_update(rn, old, 1);
1462 UNSET_FLAG(old->status, ROUTE_ENTRY_CHANGED);
1463 }
1464
1465 /* Clear changed flag. */
1466 UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED);
1467 }
1468
1469 /* Check if 'alternate' RIB entry is better than 'current'. */
1470 static struct route_entry *rib_choose_best(struct route_entry *current,
1471 struct route_entry *alternate)
1472 {
1473 if (current == NULL)
1474 return alternate;
1475
1476 /* filter route selection in following order:
1477 * - connected beats other types
1478 * - lower distance beats higher
1479 * - lower metric beats higher for equal distance
1480 * - last, hence oldest, route wins tie break.
1481 */
1482
1483 /* Connected routes. Pick the last connected
1484 * route of the set of lowest metric connected routes.
1485 */
1486 if (alternate->type == ZEBRA_ROUTE_CONNECT) {
1487 if (current->type != ZEBRA_ROUTE_CONNECT
1488 || alternate->metric <= current->metric)
1489 return alternate;
1490
1491 return current;
1492 }
1493
1494 if (current->type == ZEBRA_ROUTE_CONNECT)
1495 return current;
1496
1497 /* higher distance loses */
1498 if (alternate->distance < current->distance)
1499 return alternate;
1500 if (current->distance < alternate->distance)
1501 return current;
1502
1503 /* metric tie-breaks equal distance */
1504 if (alternate->metric <= current->metric)
1505 return alternate;
1506
1507 return current;
1508 }
1509
1510 /* Core function for processing routing information base. */
1511 static void rib_process(struct route_node *rn)
1512 {
1513 struct route_entry *re;
1514 struct route_entry *next;
1515 struct route_entry *old_selected = NULL;
1516 struct route_entry *new_selected = NULL;
1517 struct route_entry *old_fib = NULL;
1518 struct route_entry *new_fib = NULL;
1519 struct route_entry *best = NULL;
1520 char buf[SRCDEST2STR_BUFFER];
1521 rib_dest_t *dest;
1522 struct zebra_vrf *zvrf = NULL;
1523 struct prefix *p, *src_p;
1524 srcdest_rnode_prefixes(rn, &p, &src_p);
1525 vrf_id_t vrf_id = VRF_UNKNOWN;
1526
1527 assert(rn);
1528
1529 dest = rib_dest_from_rnode(rn);
1530 if (dest) {
1531 zvrf = rib_dest_vrf(dest);
1532 vrf_id = zvrf_id(zvrf);
1533 }
1534
1535 if (IS_ZEBRA_DEBUG_RIB)
1536 srcdest_rnode2str(rn, buf, sizeof(buf));
1537
1538 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
1539 zlog_debug("%u:%s: Processing rn %p", vrf_id, buf, rn);
1540
1541 /*
1542 * we can have rn's that have a NULL info pointer
1543 * (dest). As such let's not let the deref happen
1544 * additionally we know RNODE_FOREACH_RE_SAFE
1545 * will not iterate so we are ok.
1546 */
1547 if (dest)
1548 old_fib = dest->selected_fib;
1549
1550 RNODE_FOREACH_RE_SAFE (rn, re, next) {
1551 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
1552 zlog_debug(
1553 "%u:%s: Examine re %p (type %d) status %x flags %x "
1554 "dist %d metric %d",
1555 vrf_id, buf, re, re->type, re->status,
1556 re->flags, re->distance, re->metric);
1557
1558 UNSET_FLAG(re->status, ROUTE_ENTRY_NEXTHOPS_CHANGED);
1559
1560 /* Currently selected re. */
1561 if (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED)) {
1562 assert(old_selected == NULL);
1563 old_selected = re;
1564 }
1565
1566 /* Skip deleted entries from selection */
1567 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED))
1568 continue;
1569
1570 /* Skip unreachable nexthop. */
1571 /* This first call to nexthop_active_update is merely to
1572 * determine if
1573 * there's any change to nexthops associated with this RIB
1574 * entry. Now,
1575 * rib_process() can be invoked due to an external event such as
1576 * link
1577 * down or due to next-hop-tracking evaluation. In the latter
1578 * case,
1579 * a decision has already been made that the NHs have changed.
1580 * So, no
1581 * need to invoke a potentially expensive call again. Further,
1582 * since
1583 * the change might be in a recursive NH which is not caught in
1584 * the nexthop_active_update() code. Thus, we might miss changes
1585 * to
1586 * recursive NHs.
1587 */
1588 if (!CHECK_FLAG(re->status, ROUTE_ENTRY_CHANGED)
1589 && !nexthop_active_update(rn, re, 0)) {
1590 if (re->type == ZEBRA_ROUTE_TABLE) {
1591 /* XXX: HERE BE DRAGONS!!!!!
1592 * In all honesty, I have not yet figured out
1593 * what this part
1594 * does or why the ROUTE_ENTRY_CHANGED test
1595 * above is correct
1596 * or why we need to delete a route here, and
1597 * also not whether
1598 * this concerns both selected and fib route, or
1599 * only selected
1600 * or only fib */
1601 /* This entry was denied by the 'ip protocol
1602 * table' route-map, we
1603 * need to delete it */
1604 if (re != old_selected) {
1605 if (IS_ZEBRA_DEBUG_RIB)
1606 zlog_debug(
1607 "%s: %s: imported via import-table but denied "
1608 "by the ip protocol table route-map",
1609 __func__, buf);
1610 rib_unlink(rn, re);
1611 } else
1612 SET_FLAG(re->status,
1613 ROUTE_ENTRY_REMOVED);
1614 }
1615
1616 continue;
1617 }
1618
1619 /* Infinite distance. */
1620 if (re->distance == DISTANCE_INFINITY) {
1621 UNSET_FLAG(re->status, ROUTE_ENTRY_CHANGED);
1622 continue;
1623 }
1624
1625 if (CHECK_FLAG(re->flags, ZEBRA_FLAG_FIB_OVERRIDE)) {
1626 best = rib_choose_best(new_fib, re);
1627 if (new_fib && best != new_fib)
1628 UNSET_FLAG(new_fib->status,
1629 ROUTE_ENTRY_CHANGED);
1630 new_fib = best;
1631 } else {
1632 best = rib_choose_best(new_selected, re);
1633 if (new_selected && best != new_selected)
1634 UNSET_FLAG(new_selected->status,
1635 ROUTE_ENTRY_CHANGED);
1636 new_selected = best;
1637 }
1638 if (best != re)
1639 UNSET_FLAG(re->status, ROUTE_ENTRY_CHANGED);
1640 } /* RNODE_FOREACH_RE */
1641
1642 /* If no FIB override route, use the selected route also for FIB */
1643 if (new_fib == NULL)
1644 new_fib = new_selected;
1645
1646 /* After the cycle is finished, the following pointers will be set:
1647 * old_selected --- RE entry currently having SELECTED
1648 * new_selected --- RE entry that is newly SELECTED
1649 * old_fib --- RE entry currently in kernel FIB
1650 * new_fib --- RE entry that is newly to be in kernel FIB
1651 *
1652 * new_selected will get SELECTED flag, and is going to be redistributed
1653 * the zclients. new_fib (which can be new_selected) will be installed
1654 * in kernel.
1655 */
1656
1657 if (IS_ZEBRA_DEBUG_RIB_DETAILED) {
1658 zlog_debug(
1659 "%u:%s: After processing: old_selected %p new_selected %p old_fib %p new_fib %p",
1660 vrf_id, buf, (void *)old_selected, (void *)new_selected,
1661 (void *)old_fib, (void *)new_fib);
1662 }
1663
1664 /* Buffer ROUTE_ENTRY_CHANGED here, because it will get cleared if
1665 * fib == selected */
1666 bool selected_changed = new_selected && CHECK_FLAG(new_selected->status,
1667 ROUTE_ENTRY_CHANGED);
1668
1669 /* Update fib according to selection results */
1670 if (new_fib && old_fib)
1671 rib_process_update_fib(zvrf, rn, old_fib, new_fib);
1672 else if (new_fib)
1673 rib_process_add_fib(zvrf, rn, new_fib);
1674 else if (old_fib)
1675 rib_process_del_fib(zvrf, rn, old_fib);
1676
1677 /* Redistribute SELECTED entry */
1678 if (old_selected != new_selected || selected_changed) {
1679 struct nexthop *nexthop;
1680
1681 /* Check if we have a FIB route for the destination, otherwise,
1682 * don't redistribute it */
1683 for (ALL_NEXTHOPS(new_fib ? new_fib->nexthop : NULL, nexthop)) {
1684 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) {
1685 break;
1686 }
1687 }
1688 if (!nexthop)
1689 new_selected = NULL;
1690
1691 if (new_selected && new_selected != new_fib) {
1692 nexthop_active_update(rn, new_selected, 1);
1693 UNSET_FLAG(new_selected->status, ROUTE_ENTRY_CHANGED);
1694 }
1695
1696 if (old_selected) {
1697 if (!new_selected)
1698 redistribute_delete(p, src_p, old_selected);
1699 if (old_selected != new_selected)
1700 UNSET_FLAG(old_selected->flags,
1701 ZEBRA_FLAG_SELECTED);
1702 }
1703
1704 if (new_selected) {
1705 /* Install new or replace existing redistributed entry
1706 */
1707 SET_FLAG(new_selected->flags, ZEBRA_FLAG_SELECTED);
1708 redistribute_update(p, src_p, new_selected,
1709 old_selected);
1710 }
1711 }
1712
1713 /* Remove all RE entries queued for removal */
1714 RNODE_FOREACH_RE_SAFE (rn, re, next) {
1715 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) {
1716 if (IS_ZEBRA_DEBUG_RIB) {
1717 rnode_debug(rn, vrf_id, "rn %p, removing re %p",
1718 (void *)rn, (void *)re);
1719 }
1720 rib_unlink(rn, re);
1721 }
1722 }
1723
1724 /*
1725 * Check if the dest can be deleted now.
1726 */
1727 rib_gc_dest(rn);
1728 }
1729
1730 /* Take a list of route_node structs and return 1, if there was a record
1731 * picked from it and processed by rib_process(). Don't process more,
1732 * than one RN record; operate only in the specified sub-queue.
1733 */
1734 static unsigned int process_subq(struct list *subq, u_char qindex)
1735 {
1736 struct listnode *lnode = listhead(subq);
1737 struct route_node *rnode;
1738 rib_dest_t *dest;
1739 struct zebra_vrf *zvrf = NULL;
1740
1741 if (!lnode)
1742 return 0;
1743
1744 rnode = listgetdata(lnode);
1745 dest = rib_dest_from_rnode(rnode);
1746 if (dest)
1747 zvrf = rib_dest_vrf(dest);
1748
1749 rib_process(rnode);
1750
1751 if (IS_ZEBRA_DEBUG_RIB_DETAILED) {
1752 char buf[SRCDEST2STR_BUFFER];
1753 srcdest_rnode2str(rnode, buf, sizeof(buf));
1754 zlog_debug("%u:%s: rn %p dequeued from sub-queue %u",
1755 zvrf ? zvrf_id(zvrf) : 0, buf, rnode, qindex);
1756 }
1757
1758 if (rnode->info)
1759 UNSET_FLAG(rib_dest_from_rnode(rnode)->flags,
1760 RIB_ROUTE_QUEUED(qindex));
1761
1762 #if 0
1763 else
1764 {
1765 zlog_debug ("%s: called for route_node (%p, %d) with no ribs",
1766 __func__, rnode, rnode->lock);
1767 zlog_backtrace(LOG_DEBUG);
1768 }
1769 #endif
1770 route_unlock_node(rnode);
1771 list_delete_node(subq, lnode);
1772 return 1;
1773 }
1774
1775 /*
1776 * All meta queues have been processed. Trigger next-hop evaluation.
1777 */
1778 static void meta_queue_process_complete(struct work_queue *dummy)
1779 {
1780 struct vrf *vrf;
1781 struct zebra_vrf *zvrf;
1782
1783 /* Evaluate nexthops for those VRFs which underwent route processing.
1784 * This
1785 * should limit the evaluation to the necessary VRFs in most common
1786 * situations.
1787 */
1788 RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) {
1789 zvrf = vrf->info;
1790 if (zvrf == NULL || !(zvrf->flags & ZEBRA_VRF_RIB_SCHEDULED))
1791 continue;
1792
1793 zvrf->flags &= ~ZEBRA_VRF_RIB_SCHEDULED;
1794 zebra_evaluate_rnh(zvrf_id(zvrf), AF_INET, 0, RNH_NEXTHOP_TYPE,
1795 NULL);
1796 zebra_evaluate_rnh(zvrf_id(zvrf), AF_INET, 0,
1797 RNH_IMPORT_CHECK_TYPE, NULL);
1798 zebra_evaluate_rnh(zvrf_id(zvrf), AF_INET6, 0, RNH_NEXTHOP_TYPE,
1799 NULL);
1800 zebra_evaluate_rnh(zvrf_id(zvrf), AF_INET6, 0,
1801 RNH_IMPORT_CHECK_TYPE, NULL);
1802 }
1803
1804 /* Schedule LSPs for processing, if needed. */
1805 zvrf = vrf_info_lookup(VRF_DEFAULT);
1806 if (mpls_should_lsps_be_processed(zvrf)) {
1807 if (IS_ZEBRA_DEBUG_MPLS)
1808 zlog_debug(
1809 "%u: Scheduling all LSPs upon RIB completion",
1810 zvrf_id(zvrf));
1811 zebra_mpls_lsp_schedule(zvrf);
1812 mpls_unmark_lsps_for_processing(zvrf);
1813 }
1814 }
1815
1816 /* Dispatch the meta queue by picking, processing and unlocking the next RN from
1817 * a non-empty sub-queue with lowest priority. wq is equal to zebra->ribq and
1818 * data
1819 * is pointed to the meta queue structure.
1820 */
1821 static wq_item_status meta_queue_process(struct work_queue *dummy, void *data)
1822 {
1823 struct meta_queue *mq = data;
1824 unsigned i;
1825
1826 for (i = 0; i < MQ_SIZE; i++)
1827 if (process_subq(mq->subq[i], i)) {
1828 mq->size--;
1829 break;
1830 }
1831 return mq->size ? WQ_REQUEUE : WQ_SUCCESS;
1832 }
1833
1834 /*
1835 * Map from rib types to queue type (priority) in meta queue
1836 */
1837 static const u_char meta_queue_map[ZEBRA_ROUTE_MAX] = {
1838 [ZEBRA_ROUTE_SYSTEM] = 4,
1839 [ZEBRA_ROUTE_KERNEL] = 0,
1840 [ZEBRA_ROUTE_CONNECT] = 0,
1841 [ZEBRA_ROUTE_STATIC] = 1,
1842 [ZEBRA_ROUTE_RIP] = 2,
1843 [ZEBRA_ROUTE_RIPNG] = 2,
1844 [ZEBRA_ROUTE_OSPF] = 2,
1845 [ZEBRA_ROUTE_OSPF6] = 2,
1846 [ZEBRA_ROUTE_ISIS] = 2,
1847 [ZEBRA_ROUTE_BGP] = 3,
1848 [ZEBRA_ROUTE_PIM] = 4, // Shouldn't happen but for safety
1849 [ZEBRA_ROUTE_EIGRP] = 2,
1850 [ZEBRA_ROUTE_NHRP] = 2,
1851 [ZEBRA_ROUTE_HSLS] = 4,
1852 [ZEBRA_ROUTE_OLSR] = 4,
1853 [ZEBRA_ROUTE_TABLE] = 1,
1854 [ZEBRA_ROUTE_LDP] = 4,
1855 [ZEBRA_ROUTE_VNC] = 3,
1856 [ZEBRA_ROUTE_VNC_DIRECT] = 3,
1857 [ZEBRA_ROUTE_VNC_DIRECT_RH] = 3,
1858 [ZEBRA_ROUTE_BGP_DIRECT] = 3,
1859 [ZEBRA_ROUTE_BGP_DIRECT_EXT] = 3,
1860 [ZEBRA_ROUTE_BABEL] = 2,
1861 [ZEBRA_ROUTE_ALL] = 4, // Shouldn't happen but for safety
1862 };
1863
1864 /* Look into the RN and queue it into one or more priority queues,
1865 * increasing the size for each data push done.
1866 */
1867 static void rib_meta_queue_add(struct meta_queue *mq, struct route_node *rn)
1868 {
1869 struct route_entry *re;
1870
1871 RNODE_FOREACH_RE (rn, re) {
1872 u_char qindex = meta_queue_map[re->type];
1873 struct zebra_vrf *zvrf;
1874
1875 /* Invariant: at this point we always have rn->info set. */
1876 if (CHECK_FLAG(rib_dest_from_rnode(rn)->flags,
1877 RIB_ROUTE_QUEUED(qindex))) {
1878 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
1879 rnode_debug(
1880 rn, re->vrf_id,
1881 "rn %p is already queued in sub-queue %u",
1882 (void *)rn, qindex);
1883 continue;
1884 }
1885
1886 SET_FLAG(rib_dest_from_rnode(rn)->flags,
1887 RIB_ROUTE_QUEUED(qindex));
1888 listnode_add(mq->subq[qindex], rn);
1889 route_lock_node(rn);
1890 mq->size++;
1891
1892 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
1893 rnode_debug(rn, re->vrf_id,
1894 "queued rn %p into sub-queue %u",
1895 (void *)rn, qindex);
1896
1897 zvrf = zebra_vrf_lookup_by_id(re->vrf_id);
1898 if (zvrf)
1899 zvrf->flags |= ZEBRA_VRF_RIB_SCHEDULED;
1900 }
1901 }
1902
1903 /* Add route_node to work queue and schedule processing */
1904 void rib_queue_add(struct route_node *rn)
1905 {
1906 assert(rn);
1907
1908 /* Pointless to queue a route_node with no RIB entries to add or remove
1909 */
1910 if (!rnode_to_ribs(rn)) {
1911 zlog_debug("%s: called for route_node (%p, %d) with no ribs",
1912 __func__, (void *)rn, rn->lock);
1913 zlog_backtrace(LOG_DEBUG);
1914 return;
1915 }
1916
1917 if (zebrad.ribq == NULL) {
1918 zlog_err("%s: work_queue does not exist!", __func__);
1919 return;
1920 }
1921
1922 /*
1923 * The RIB queue should normally be either empty or holding the only
1924 * work_queue_item element. In the latter case this element would
1925 * hold a pointer to the meta queue structure, which must be used to
1926 * actually queue the route nodes to process. So create the MQ
1927 * holder, if necessary, then push the work into it in any case.
1928 * This semantics was introduced after 0.99.9 release.
1929 */
1930 if (work_queue_empty(zebrad.ribq))
1931 work_queue_add(zebrad.ribq, zebrad.mq);
1932
1933 rib_meta_queue_add(zebrad.mq, rn);
1934
1935 return;
1936 }
1937
1938 /* Create new meta queue.
1939 A destructor function doesn't seem to be necessary here.
1940 */
1941 static struct meta_queue *meta_queue_new(void)
1942 {
1943 struct meta_queue *new;
1944 unsigned i;
1945
1946 new = XCALLOC(MTYPE_WORK_QUEUE, sizeof(struct meta_queue));
1947 assert(new);
1948
1949 for (i = 0; i < MQ_SIZE; i++) {
1950 new->subq[i] = list_new();
1951 assert(new->subq[i]);
1952 }
1953
1954 return new;
1955 }
1956
1957 void meta_queue_free(struct meta_queue *mq)
1958 {
1959 unsigned i;
1960
1961 for (i = 0; i < MQ_SIZE; i++)
1962 list_delete_and_null(&mq->subq[i]);
1963
1964 XFREE(MTYPE_WORK_QUEUE, mq);
1965 }
1966
1967 /* initialise zebra rib work queue */
1968 static void rib_queue_init(struct zebra_t *zebra)
1969 {
1970 assert(zebra);
1971
1972 if (!(zebra->ribq =
1973 work_queue_new(zebra->master, "route_node processing"))) {
1974 zlog_err("%s: could not initialise work queue!", __func__);
1975 return;
1976 }
1977
1978 /* fill in the work queue spec */
1979 zebra->ribq->spec.workfunc = &meta_queue_process;
1980 zebra->ribq->spec.errorfunc = NULL;
1981 zebra->ribq->spec.completion_func = &meta_queue_process_complete;
1982 /* XXX: TODO: These should be runtime configurable via vty */
1983 zebra->ribq->spec.max_retries = 3;
1984 zebra->ribq->spec.hold = ZEBRA_RIB_PROCESS_HOLD_TIME;
1985
1986 if (!(zebra->mq = meta_queue_new())) {
1987 zlog_err("%s: could not initialise meta queue!", __func__);
1988 return;
1989 }
1990 return;
1991 }
1992
1993 /* RIB updates are processed via a queue of pointers to route_nodes.
1994 *
1995 * The queue length is bounded by the maximal size of the routing table,
1996 * as a route_node will not be requeued, if already queued.
1997 *
1998 * REs are submitted via rib_addnode or rib_delnode which set minimal
1999 * state, or static_install_route (when an existing RE is updated)
2000 * and then submit route_node to queue for best-path selection later.
2001 * Order of add/delete state changes are preserved for any given RE.
2002 *
2003 * Deleted REs are reaped during best-path selection.
2004 *
2005 * rib_addnode
2006 * |-> rib_link or unset ROUTE_ENTRY_REMOVE |->Update kernel with
2007 * |-------->| | best RE, if required
2008 * | |
2009 * static_install->|->rib_addqueue...... -> rib_process
2010 * | |
2011 * |-------->| |-> rib_unlink
2012 * |-> set ROUTE_ENTRY_REMOVE |
2013 * rib_delnode (RE freed)
2014 *
2015 * The 'info' pointer of a route_node points to a rib_dest_t
2016 * ('dest'). Queueing state for a route_node is kept on the dest. The
2017 * dest is created on-demand by rib_link() and is kept around at least
2018 * as long as there are ribs hanging off it (@see rib_gc_dest()).
2019 *
2020 * Refcounting (aka "locking" throughout the GNU Zebra and Quagga code):
2021 *
2022 * - route_nodes: refcounted by:
2023 * - dest attached to route_node:
2024 * - managed by: rib_link/rib_gc_dest
2025 * - route_node processing queue
2026 * - managed by: rib_addqueue, rib_process.
2027 *
2028 */
2029
2030 /* Add RE to head of the route node. */
2031 static void rib_link(struct route_node *rn, struct route_entry *re, int process)
2032 {
2033 struct route_entry *head;
2034 rib_dest_t *dest;
2035 afi_t afi;
2036 const char *rmap_name;
2037
2038 assert(re && rn);
2039
2040 dest = rib_dest_from_rnode(rn);
2041 if (!dest) {
2042 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
2043 rnode_debug(rn, re->vrf_id, "rn %p adding dest", rn);
2044
2045 dest = XCALLOC(MTYPE_RIB_DEST, sizeof(rib_dest_t));
2046 route_lock_node(rn); /* rn route table reference */
2047 rn->info = dest;
2048 dest->rnode = rn;
2049 }
2050
2051 head = dest->routes;
2052 if (head) {
2053 head->prev = re;
2054 }
2055 re->next = head;
2056 dest->routes = re;
2057
2058 afi = (rn->p.family == AF_INET)
2059 ? AFI_IP
2060 : (rn->p.family == AF_INET6) ? AFI_IP6 : AFI_MAX;
2061 if (is_zebra_import_table_enabled(afi, re->table)) {
2062 rmap_name = zebra_get_import_table_route_map(afi, re->table);
2063 zebra_add_import_table_entry(rn, re, rmap_name);
2064 } else if (process)
2065 rib_queue_add(rn);
2066 }
2067
2068 void rib_addnode(struct route_node *rn, struct route_entry *re, int process)
2069 {
2070 /* RE node has been un-removed before route-node is processed.
2071 * route_node must hence already be on the queue for processing..
2072 */
2073 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) {
2074 if (IS_ZEBRA_DEBUG_RIB)
2075 rnode_debug(rn, re->vrf_id, "rn %p, un-removed re %p",
2076 (void *)rn, (void *)re);
2077
2078 UNSET_FLAG(re->status, ROUTE_ENTRY_REMOVED);
2079 return;
2080 }
2081 rib_link(rn, re, process);
2082 }
2083
2084 /*
2085 * rib_unlink
2086 *
2087 * Detach a rib structure from a route_node.
2088 *
2089 * Note that a call to rib_unlink() should be followed by a call to
2090 * rib_gc_dest() at some point. This allows a rib_dest_t that is no
2091 * longer required to be deleted.
2092 */
2093 void rib_unlink(struct route_node *rn, struct route_entry *re)
2094 {
2095 rib_dest_t *dest;
2096
2097 assert(rn && re);
2098
2099 if (IS_ZEBRA_DEBUG_RIB)
2100 rnode_debug(rn, re->vrf_id, "rn %p, re %p", (void *)rn,
2101 (void *)re);
2102
2103 dest = rib_dest_from_rnode(rn);
2104
2105 if (re->next)
2106 re->next->prev = re->prev;
2107
2108 if (re->prev)
2109 re->prev->next = re->next;
2110 else {
2111 dest->routes = re->next;
2112 }
2113
2114 if (dest->selected_fib == re)
2115 dest->selected_fib = NULL;
2116
2117 /* free RE and nexthops */
2118 if (re->type == ZEBRA_ROUTE_STATIC)
2119 zebra_deregister_rnh_static_nexthops(re->vrf_id, re->nexthop,
2120 rn);
2121 nexthops_free(re->nexthop);
2122 XFREE(MTYPE_RE, re);
2123 }
2124
2125 void rib_delnode(struct route_node *rn, struct route_entry *re)
2126 {
2127 afi_t afi;
2128
2129 if (IS_ZEBRA_DEBUG_RIB)
2130 rnode_debug(rn, re->vrf_id, "rn %p, re %p, removing",
2131 (void *)rn, (void *)re);
2132 SET_FLAG(re->status, ROUTE_ENTRY_REMOVED);
2133
2134 afi = (rn->p.family == AF_INET)
2135 ? AFI_IP
2136 : (rn->p.family == AF_INET6) ? AFI_IP6 : AFI_MAX;
2137 if (is_zebra_import_table_enabled(afi, re->table)) {
2138 zebra_del_import_table_entry(rn, re);
2139 /* Just clean up if non main table */
2140 if (IS_ZEBRA_DEBUG_RIB) {
2141 char buf[SRCDEST2STR_BUFFER];
2142 srcdest_rnode2str(rn, buf, sizeof(buf));
2143 zlog_debug(
2144 "%u:%s: Freeing route rn %p, re %p (type %d)",
2145 re->vrf_id, buf, rn, re, re->type);
2146 }
2147
2148 rib_unlink(rn, re);
2149 } else {
2150 rib_queue_add(rn);
2151 }
2152 }
2153
2154 /* This function dumps the contents of a given RE entry into
2155 * standard debug log. Calling function name and IP prefix in
2156 * question are passed as 1st and 2nd arguments.
2157 */
2158
2159 void _route_entry_dump(const char *func, union prefixconstptr pp,
2160 union prefixconstptr src_pp,
2161 const struct route_entry *re)
2162 {
2163 const struct prefix *p = pp.p;
2164 const struct prefix *src_p = src_pp.p;
2165 bool is_srcdst = src_p && src_p->prefixlen;
2166 char straddr[PREFIX_STRLEN];
2167 char srcaddr[PREFIX_STRLEN];
2168 struct nexthop *nexthop;
2169
2170 zlog_debug("%s: dumping RE entry %p for %s%s%s vrf %u", func,
2171 (const void *)re, prefix2str(pp, straddr, sizeof(straddr)),
2172 is_srcdst ? " from " : "",
2173 is_srcdst ? prefix2str(src_pp, srcaddr, sizeof(srcaddr))
2174 : "",
2175 re->vrf_id);
2176 zlog_debug("%s: uptime == %lu, type == %u, instance == %d, table == %d",
2177 func, (unsigned long)re->uptime, re->type, re->instance,
2178 re->table);
2179 zlog_debug(
2180 "%s: metric == %u, mtu == %u, distance == %u, flags == %u, status == %u",
2181 func, re->metric, re->mtu, re->distance, re->flags, re->status);
2182 zlog_debug("%s: nexthop_num == %u, nexthop_active_num == %u", func,
2183 re->nexthop_num, re->nexthop_active_num);
2184
2185 for (ALL_NEXTHOPS(re->nexthop, nexthop)) {
2186 inet_ntop(p->family, &nexthop->gate, straddr, INET6_ADDRSTRLEN);
2187 zlog_debug("%s: %s %s[%u] with flags %s%s%s", func,
2188 (nexthop->rparent ? " NH" : "NH"), straddr,
2189 nexthop->ifindex,
2190 (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE)
2191 ? "ACTIVE "
2192 : ""),
2193 (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)
2194 ? "FIB "
2195 : ""),
2196 (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_RECURSIVE)
2197 ? "RECURSIVE"
2198 : ""));
2199 }
2200 zlog_debug("%s: dump complete", func);
2201 }
2202
2203 /* This is an exported helper to rtm_read() to dump the strange
2204 * RE entry found by rib_lookup_ipv4_route()
2205 */
2206
2207 void rib_lookup_and_dump(struct prefix_ipv4 *p, vrf_id_t vrf_id)
2208 {
2209 struct route_table *table;
2210 struct route_node *rn;
2211 struct route_entry *re;
2212 char prefix_buf[INET_ADDRSTRLEN];
2213
2214 /* Lookup table. */
2215 table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id);
2216 if (!table) {
2217 zlog_err("%s: zebra_vrf_table() returned NULL", __func__);
2218 return;
2219 }
2220
2221 /* Scan the RIB table for exactly matching RE entry. */
2222 rn = route_node_lookup(table, (struct prefix *)p);
2223
2224 /* No route for this prefix. */
2225 if (!rn) {
2226 zlog_debug("%s: lookup failed for %s", __func__,
2227 prefix2str((struct prefix *)p, prefix_buf,
2228 sizeof(prefix_buf)));
2229 return;
2230 }
2231
2232 /* Unlock node. */
2233 route_unlock_node(rn);
2234
2235 /* let's go */
2236 RNODE_FOREACH_RE (rn, re) {
2237 zlog_debug("%s: rn %p, re %p: %s, %s", __func__, (void *)rn,
2238 (void *)re,
2239 (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)
2240 ? "removed"
2241 : "NOT removed"),
2242 (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED)
2243 ? "selected"
2244 : "NOT selected"));
2245 route_entry_dump(p, NULL, re);
2246 }
2247 }
2248
2249 /* Check if requested address assignment will fail due to another
2250 * route being installed by zebra in FIB already. Take necessary
2251 * actions, if needed: remove such a route from FIB and deSELECT
2252 * corresponding RE entry. Then put affected RN into RIBQ head.
2253 */
2254 void rib_lookup_and_pushup(struct prefix_ipv4 *p, vrf_id_t vrf_id)
2255 {
2256 struct route_table *table;
2257 struct route_node *rn;
2258 unsigned changed = 0;
2259 rib_dest_t *dest;
2260
2261 if (NULL == (table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id))) {
2262 zlog_err("%s: zebra_vrf_table() returned NULL", __func__);
2263 return;
2264 }
2265
2266 /* No matches would be the simplest case. */
2267 if (NULL == (rn = route_node_lookup(table, (struct prefix *)p)))
2268 return;
2269
2270 /* Unlock node. */
2271 route_unlock_node(rn);
2272
2273 dest = rib_dest_from_rnode(rn);
2274 /* Check all RE entries. In case any changes have to be done, requeue
2275 * the RN into RIBQ head. If the routing message about the new connected
2276 * route (generated by the IP address we are going to assign very soon)
2277 * comes before the RIBQ is processed, the new RE entry will join
2278 * RIBQ record already on head. This is necessary for proper
2279 * revalidation
2280 * of the rest of the RE.
2281 */
2282 if (dest->selected_fib && !RIB_SYSTEM_ROUTE(dest->selected_fib)) {
2283 changed = 1;
2284 if (IS_ZEBRA_DEBUG_RIB) {
2285 char buf[PREFIX_STRLEN];
2286
2287 zlog_debug("%u:%s: freeing way for connected prefix",
2288 dest->selected_fib->vrf_id,
2289 prefix2str(&rn->p, buf, sizeof(buf)));
2290 route_entry_dump(&rn->p, NULL, dest->selected_fib);
2291 }
2292 rib_uninstall(rn, dest->selected_fib);
2293 }
2294 if (changed)
2295 rib_queue_add(rn);
2296 }
2297
2298 int rib_add_multipath(afi_t afi, safi_t safi, struct prefix *p,
2299 struct prefix_ipv6 *src_p, struct route_entry *re)
2300 {
2301 struct route_table *table;
2302 struct route_node *rn;
2303 struct route_entry *same;
2304 struct nexthop *nexthop;
2305 int ret = 0;
2306
2307 if (!re)
2308 return 0;
2309
2310 assert(!src_p || afi == AFI_IP6);
2311
2312 /* Lookup table. */
2313 table = zebra_vrf_table_with_table_id(afi, safi, re->vrf_id, re->table);
2314 if (!table) {
2315 XFREE(MTYPE_RE, re);
2316 return 0;
2317 }
2318
2319 /* Make it sure prefixlen is applied to the prefix. */
2320 apply_mask(p);
2321 if (src_p)
2322 apply_mask_ipv6(src_p);
2323
2324 /* Set default distance by route type. */
2325 if (re->distance == 0) {
2326 re->distance = route_distance(re->type);
2327
2328 /* iBGP distance is 200. */
2329 if (re->type == ZEBRA_ROUTE_BGP
2330 && CHECK_FLAG(re->flags, ZEBRA_FLAG_IBGP))
2331 re->distance = 200;
2332 }
2333
2334 /* Lookup route node.*/
2335 rn = srcdest_rnode_get(table, p, src_p);
2336
2337 /* If same type of route are installed, treat it as a implicit
2338 withdraw. */
2339 RNODE_FOREACH_RE (rn, same) {
2340 if (CHECK_FLAG(same->status, ROUTE_ENTRY_REMOVED))
2341 continue;
2342
2343 if (same->type != re->type)
2344 continue;
2345 if (same->instance != re->instance)
2346 continue;
2347 if (same->type == ZEBRA_ROUTE_KERNEL
2348 && same->metric != re->metric)
2349 continue;
2350 /*
2351 * We should allow duplicate connected routes because of
2352 * IPv6 link-local routes and unnumbered interfaces on Linux.
2353 */
2354 if (same->type != ZEBRA_ROUTE_CONNECT)
2355 break;
2356 }
2357
2358 /* If this route is kernel route, set FIB flag to the route. */
2359 if (RIB_SYSTEM_ROUTE(re))
2360 for (nexthop = re->nexthop; nexthop; nexthop = nexthop->next)
2361 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
2362
2363 /* Link new re to node.*/
2364 if (IS_ZEBRA_DEBUG_RIB) {
2365 rnode_debug(
2366 rn, re->vrf_id,
2367 "Inserting route rn %p, re %p (type %d) existing %p",
2368 (void *)rn, (void *)re, re->type, (void *)same);
2369
2370 if (IS_ZEBRA_DEBUG_RIB_DETAILED)
2371 route_entry_dump(p, src_p, re);
2372 }
2373 rib_addnode(rn, re, 1);
2374 ret = 1;
2375
2376 /* Free implicit route.*/
2377 if (same) {
2378 rib_delnode(rn, same);
2379 ret = -1;
2380 }
2381
2382 route_unlock_node(rn);
2383 return ret;
2384 }
2385
2386 void rib_delete(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type,
2387 u_short instance, int flags, struct prefix *p,
2388 struct prefix_ipv6 *src_p, const struct nexthop *nh,
2389 u_int32_t table_id, u_int32_t metric, bool fromkernel,
2390 struct ethaddr *rmac)
2391 {
2392 struct route_table *table;
2393 struct route_node *rn;
2394 struct route_entry *re;
2395 struct route_entry *fib = NULL;
2396 struct route_entry *same = NULL;
2397 struct nexthop *rtnh;
2398 char buf2[INET6_ADDRSTRLEN];
2399 rib_dest_t *dest;
2400
2401 assert(!src_p || afi == AFI_IP6);
2402
2403 /* Lookup table. */
2404 table = zebra_vrf_table_with_table_id(afi, safi, vrf_id, table_id);
2405 if (!table)
2406 return;
2407
2408 /* Apply mask. */
2409 apply_mask(p);
2410 if (src_p)
2411 apply_mask_ipv6(src_p);
2412
2413 /* Lookup route node. */
2414 rn = srcdest_rnode_lookup(table, p, src_p);
2415 if (!rn) {
2416 char dst_buf[PREFIX_STRLEN], src_buf[PREFIX_STRLEN];
2417
2418 prefix2str(p, dst_buf, sizeof(dst_buf));
2419 if (src_p && src_p->prefixlen)
2420 prefix2str(src_p, src_buf, sizeof(src_buf));
2421 else
2422 src_buf[0] = '\0';
2423
2424 if (IS_ZEBRA_DEBUG_RIB)
2425 zlog_debug("%u:%s%s%s doesn't exist in rib", vrf_id,
2426 dst_buf,
2427 (src_buf[0] != '\0') ? " from " : "",
2428 src_buf);
2429 return;
2430 }
2431
2432 dest = rib_dest_from_rnode(rn);
2433 fib = dest->selected_fib;
2434
2435 /* Lookup same type route. */
2436 RNODE_FOREACH_RE (rn, re) {
2437 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED))
2438 continue;
2439
2440 if (re->type != type)
2441 continue;
2442 if (re->instance != instance)
2443 continue;
2444 if (re->type == ZEBRA_ROUTE_KERNEL && re->metric != metric)
2445 continue;
2446 if (re->type == ZEBRA_ROUTE_CONNECT && (rtnh = re->nexthop)
2447 && rtnh->type == NEXTHOP_TYPE_IFINDEX && nh) {
2448 if (rtnh->ifindex != nh->ifindex)
2449 continue;
2450 same = re;
2451 break;
2452 }
2453 /* Make sure that the route found has the same gateway. */
2454 else {
2455 if (nh == NULL) {
2456 same = re;
2457 break;
2458 }
2459 for (ALL_NEXTHOPS(re->nexthop, rtnh))
2460 if (nexthop_same_no_recurse(rtnh, nh)) {
2461 same = re;
2462 break;
2463 }
2464 if (same)
2465 break;
2466 }
2467 }
2468 /* If same type of route can't be found and this message is from
2469 kernel. */
2470 if (!same) {
2471 /*
2472 * In the past(HA!) we could get here because
2473 * we were receiving a route delete from the
2474 * kernel and we're not marking the proto
2475 * as coming from it's appropriate originator.
2476 * Now that we are properly noticing the fact
2477 * that the kernel has deleted our route we
2478 * are not going to get called in this path
2479 * I am going to leave this here because
2480 * this might still work this way on non-linux
2481 * platforms as well as some weird state I have
2482 * not properly thought of yet.
2483 * If we can show that this code path is
2484 * dead then we can remove it.
2485 */
2486 if (fib && type == ZEBRA_ROUTE_KERNEL
2487 && CHECK_FLAG(flags, ZEBRA_FLAG_SELFROUTE)) {
2488 if (IS_ZEBRA_DEBUG_RIB) {
2489 rnode_debug(
2490 rn, vrf_id,
2491 "rn %p, re %p (type %d) was deleted from kernel, adding",
2492 rn, fib, fib->type);
2493 }
2494 if (allow_delete) {
2495 /* Unset flags. */
2496 for (rtnh = fib->nexthop; rtnh;
2497 rtnh = rtnh->next)
2498 UNSET_FLAG(rtnh->flags,
2499 NEXTHOP_FLAG_FIB);
2500
2501 /*
2502 * This is a non FRR route
2503 * as such we should mark
2504 * it as deleted
2505 */
2506 dest->selected_fib = NULL;
2507 } else {
2508 /* This means someone else, other than Zebra,
2509 * has deleted
2510 * a Zebra router from the kernel. We will add
2511 * it back */
2512 rib_install_kernel(rn, fib, NULL);
2513 }
2514 } else {
2515 if (IS_ZEBRA_DEBUG_RIB) {
2516 if (nh)
2517 rnode_debug(
2518 rn, vrf_id,
2519 "via %s ifindex %d type %d "
2520 "doesn't exist in rib",
2521 inet_ntop(
2522 family2afi(afi),
2523 &nh->gate, buf2,
2524 INET_ADDRSTRLEN), /* FIXME
2525 */
2526 nh->ifindex, type);
2527 else
2528 rnode_debug(
2529 rn, vrf_id,
2530 "type %d doesn't exist in rib",
2531 type);
2532 }
2533 route_unlock_node(rn);
2534 return;
2535 }
2536 }
2537
2538 if (same) {
2539 if (fromkernel && CHECK_FLAG(flags, ZEBRA_FLAG_SELFROUTE)
2540 && !allow_delete) {
2541 rib_install_kernel(rn, same, NULL);
2542 route_unlock_node(rn);
2543
2544 return;
2545 }
2546
2547 if (CHECK_FLAG(flags, ZEBRA_FLAG_EVPN_ROUTE)) {
2548 struct nexthop *tmp_nh;
2549
2550 for (ALL_NEXTHOPS(re->nexthop, tmp_nh)) {
2551 struct ipaddr vtep_ip;
2552
2553 memset(&vtep_ip, 0, sizeof(struct ipaddr));
2554 vtep_ip.ipa_type = IPADDR_V4;
2555 memcpy(&(vtep_ip.ipaddr_v4),
2556 &(tmp_nh->gate.ipv4),
2557 sizeof(struct in_addr));
2558 zebra_vxlan_evpn_vrf_route_del(re->vrf_id, rmac,
2559 &vtep_ip, p);
2560 }
2561 }
2562 rib_delnode(rn, same);
2563 }
2564
2565 route_unlock_node(rn);
2566 return;
2567 }
2568
2569
2570 int rib_add(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type, u_short instance,
2571 int flags, struct prefix *p, struct prefix_ipv6 *src_p,
2572 const struct nexthop *nh, u_int32_t table_id, u_int32_t metric,
2573 u_int32_t mtu, uint8_t distance, route_tag_t tag)
2574 {
2575 struct route_entry *re;
2576 struct nexthop *nexthop;
2577
2578 /* Allocate new route_entry structure. */
2579 re = XCALLOC(MTYPE_RE, sizeof(struct route_entry));
2580 re->type = type;
2581 re->instance = instance;
2582 re->distance = distance;
2583 re->flags = flags;
2584 re->metric = metric;
2585 re->mtu = mtu;
2586 re->table = table_id;
2587 re->vrf_id = vrf_id;
2588 re->nexthop_num = 0;
2589 re->uptime = time(NULL);
2590 re->tag = tag;
2591
2592 /* Add nexthop. */
2593 nexthop = nexthop_new();
2594 *nexthop = *nh;
2595 route_entry_nexthop_add(re, nexthop);
2596
2597 return rib_add_multipath(afi, safi, p, src_p, re);
2598 }
2599
2600 /* Schedule routes of a particular table (address-family) based on event. */
2601 static void rib_update_table(struct route_table *table,
2602 rib_update_event_t event)
2603 {
2604 struct route_node *rn;
2605 struct route_entry *re, *next;
2606
2607 /* Walk all routes and queue for processing, if appropriate for
2608 * the trigger event.
2609 */
2610 for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) {
2611 /*
2612 * If we are looking at a route node and the node
2613 * has already been queued we don't
2614 * need to queue it up again
2615 */
2616 if (rn->info && CHECK_FLAG(rib_dest_from_rnode(rn)->flags,
2617 RIB_ROUTE_ANY_QUEUED))
2618 continue;
2619 switch (event) {
2620 case RIB_UPDATE_IF_CHANGE:
2621 /* Examine all routes that won't get processed by the
2622 * protocol or
2623 * triggered by nexthop evaluation (NHT). This would be
2624 * system,
2625 * kernel and certain static routes. Note that NHT will
2626 * get
2627 * triggered upon an interface event as connected routes
2628 * always
2629 * get queued for processing.
2630 */
2631 RNODE_FOREACH_RE_SAFE (rn, re, next) {
2632 struct nexthop *nh;
2633
2634 if (re->type != ZEBRA_ROUTE_SYSTEM
2635 && re->type != ZEBRA_ROUTE_KERNEL
2636 && re->type != ZEBRA_ROUTE_CONNECT
2637 && re->type != ZEBRA_ROUTE_STATIC)
2638 continue;
2639
2640 if (re->type != ZEBRA_ROUTE_STATIC) {
2641 rib_queue_add(rn);
2642 continue;
2643 }
2644
2645 for (nh = re->nexthop; nh; nh = nh->next)
2646 if (!(nh->type == NEXTHOP_TYPE_IPV4
2647 || nh->type == NEXTHOP_TYPE_IPV6))
2648 break;
2649
2650 /* If we only have nexthops to a
2651 * gateway, NHT will
2652 * take care.
2653 */
2654 if (nh)
2655 rib_queue_add(rn);
2656 }
2657 break;
2658
2659 case RIB_UPDATE_RMAP_CHANGE:
2660 case RIB_UPDATE_OTHER:
2661 /* Right now, examine all routes. Can restrict to a
2662 * protocol in
2663 * some cases (TODO).
2664 */
2665 if (rnode_to_ribs(rn))
2666 rib_queue_add(rn);
2667 break;
2668
2669 default:
2670 break;
2671 }
2672 }
2673 }
2674
2675 /* RIB update function. */
2676 void rib_update(vrf_id_t vrf_id, rib_update_event_t event)
2677 {
2678 struct route_table *table;
2679
2680 /* Process routes of interested address-families. */
2681 table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id);
2682 if (table)
2683 rib_update_table(table, event);
2684
2685 table = zebra_vrf_table(AFI_IP6, SAFI_UNICAST, vrf_id);
2686 if (table)
2687 rib_update_table(table, event);
2688 }
2689
2690 /* Remove all routes which comes from non main table. */
2691 static void rib_weed_table(struct route_table *table)
2692 {
2693 struct route_node *rn;
2694 struct route_entry *re;
2695 struct route_entry *next;
2696
2697 if (table)
2698 for (rn = route_top(table); rn; rn = srcdest_route_next(rn))
2699 RNODE_FOREACH_RE_SAFE (rn, re, next) {
2700 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED))
2701 continue;
2702
2703 if (re->table != zebrad.rtm_table_default
2704 && re->table != RT_TABLE_MAIN)
2705 rib_delnode(rn, re);
2706 }
2707 }
2708
2709 /* Delete all routes from non main table. */
2710 void rib_weed_tables(void)
2711 {
2712 struct vrf *vrf;
2713 struct zebra_vrf *zvrf;
2714
2715 RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id)
2716 if ((zvrf = vrf->info) != NULL) {
2717 rib_weed_table(zvrf->table[AFI_IP][SAFI_UNICAST]);
2718 rib_weed_table(zvrf->table[AFI_IP6][SAFI_UNICAST]);
2719 }
2720 }
2721
2722 /* Delete self installed routes after zebra is relaunched. */
2723 static void rib_sweep_table(struct route_table *table)
2724 {
2725 struct route_node *rn;
2726 struct route_entry *re;
2727 struct route_entry *next;
2728 struct nexthop *nexthop;
2729
2730 if (!table)
2731 return;
2732
2733 for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) {
2734 RNODE_FOREACH_RE_SAFE (rn, re, next) {
2735 if (IS_ZEBRA_DEBUG_RIB)
2736 route_entry_dump(&rn->p, NULL, re);
2737
2738 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED))
2739 continue;
2740
2741 if (!CHECK_FLAG(re->flags, ZEBRA_FLAG_SELFROUTE))
2742 continue;
2743
2744 /*
2745 * So we are starting up and have received
2746 * routes from the kernel that we have installed
2747 * from a previous run of zebra but not cleaned
2748 * up ( say a kill -9 )
2749 * But since we haven't actually installed
2750 * them yet( we received them from the kernel )
2751 * we don't think they are active.
2752 * So let's pretend they are active to actually
2753 * remove them.
2754 * In all honesty I'm not sure if we should
2755 * mark them as active when we receive them
2756 * This is startup only so probably ok.
2757 *
2758 * If we ever decide to move rib_sweep_table
2759 * to a different spot (ie startup )
2760 * this decision needs to be revisited
2761 */
2762 for (ALL_NEXTHOPS(re->nexthop, nexthop))
2763 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB);
2764
2765 rib_uninstall_kernel(rn, re);
2766 rib_delnode(rn, re);
2767 }
2768 }
2769 }
2770
2771 /* Sweep all RIB tables. */
2772 void rib_sweep_route(void)
2773 {
2774 struct vrf *vrf;
2775 struct zebra_vrf *zvrf;
2776
2777 RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) {
2778 if ((zvrf = vrf->info) == NULL)
2779 continue;
2780
2781 rib_sweep_table(zvrf->table[AFI_IP][SAFI_UNICAST]);
2782 rib_sweep_table(zvrf->table[AFI_IP6][SAFI_UNICAST]);
2783 }
2784 }
2785
2786 /* Remove specific by protocol routes from 'table'. */
2787 static unsigned long rib_score_proto_table(u_char proto, u_short instance,
2788 struct route_table *table)
2789 {
2790 struct route_node *rn;
2791 struct route_entry *re;
2792 struct route_entry *next;
2793 unsigned long n = 0;
2794
2795 if (table)
2796 for (rn = route_top(table); rn; rn = srcdest_route_next(rn))
2797 RNODE_FOREACH_RE_SAFE (rn, re, next) {
2798 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED))
2799 continue;
2800 if (re->type == proto
2801 && re->instance == instance) {
2802 rib_delnode(rn, re);
2803 n++;
2804 }
2805 }
2806 return n;
2807 }
2808
2809 /* Remove specific by protocol routes. */
2810 unsigned long rib_score_proto(u_char proto, u_short instance)
2811 {
2812 struct vrf *vrf;
2813 struct zebra_vrf *zvrf;
2814 unsigned long cnt = 0;
2815
2816 RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id)
2817 if ((zvrf = vrf->info) != NULL)
2818 cnt += rib_score_proto_table(
2819 proto, instance,
2820 zvrf->table[AFI_IP][SAFI_UNICAST])
2821 + rib_score_proto_table(
2822 proto, instance,
2823 zvrf->table[AFI_IP6][SAFI_UNICAST]);
2824
2825 return cnt;
2826 }
2827
2828 /* Close RIB and clean up kernel routes. */
2829 void rib_close_table(struct route_table *table)
2830 {
2831 struct route_node *rn;
2832 rib_table_info_t *info;
2833 rib_dest_t *dest;
2834
2835 if (!table)
2836 return;
2837
2838 info = table->info;
2839
2840 for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) {
2841 dest = rib_dest_from_rnode(rn);
2842
2843 if (dest && dest->selected_fib) {
2844 if (info->safi == SAFI_UNICAST)
2845 hook_call(rib_update, rn, NULL);
2846
2847 if (!RIB_SYSTEM_ROUTE(dest->selected_fib))
2848 rib_uninstall_kernel(rn, dest->selected_fib);
2849 }
2850 }
2851 }
2852
2853 /* Routing information base initialize. */
2854 void rib_init(void)
2855 {
2856 rib_queue_init(&zebrad);
2857 }
2858
2859 /*
2860 * vrf_id_get_next
2861 *
2862 * Get the first vrf id that is greater than the given vrf id if any.
2863 *
2864 * Returns TRUE if a vrf id was found, FALSE otherwise.
2865 */
2866 static inline int vrf_id_get_next(vrf_id_t vrf_id, vrf_id_t *next_id_p)
2867 {
2868 struct vrf *vrf;
2869
2870 vrf = vrf_lookup_by_id(vrf_id);
2871 if (vrf) {
2872 vrf = RB_NEXT(vrf_id_head, vrf);
2873 if (vrf) {
2874 *next_id_p = vrf->vrf_id;
2875 return 1;
2876 }
2877 }
2878
2879 return 0;
2880 }
2881
2882 /*
2883 * rib_tables_iter_next
2884 *
2885 * Returns the next table in the iteration.
2886 */
2887 struct route_table *rib_tables_iter_next(rib_tables_iter_t *iter)
2888 {
2889 struct route_table *table;
2890
2891 /*
2892 * Array that helps us go over all AFI/SAFI combinations via one
2893 * index.
2894 */
2895 static struct {
2896 afi_t afi;
2897 safi_t safi;
2898 } afi_safis[] = {
2899 {AFI_IP, SAFI_UNICAST}, {AFI_IP, SAFI_MULTICAST},
2900 {AFI_IP, SAFI_LABELED_UNICAST}, {AFI_IP6, SAFI_UNICAST},
2901 {AFI_IP6, SAFI_MULTICAST}, {AFI_IP6, SAFI_LABELED_UNICAST},
2902 };
2903
2904 table = NULL;
2905
2906 switch (iter->state) {
2907
2908 case RIB_TABLES_ITER_S_INIT:
2909 iter->vrf_id = VRF_DEFAULT;
2910 iter->afi_safi_ix = -1;
2911
2912 /* Fall through */
2913
2914 case RIB_TABLES_ITER_S_ITERATING:
2915 iter->afi_safi_ix++;
2916 while (1) {
2917
2918 while (iter->afi_safi_ix
2919 < (int)ZEBRA_NUM_OF(afi_safis)) {
2920 table = zebra_vrf_table(
2921 afi_safis[iter->afi_safi_ix].afi,
2922 afi_safis[iter->afi_safi_ix].safi,
2923 iter->vrf_id);
2924 if (table)
2925 break;
2926
2927 iter->afi_safi_ix++;
2928 }
2929
2930 /*
2931 * Found another table in this vrf.
2932 */
2933 if (table)
2934 break;
2935
2936 /*
2937 * Done with all tables in the current vrf, go to the
2938 * next
2939 * one.
2940 */
2941 if (!vrf_id_get_next(iter->vrf_id, &iter->vrf_id))
2942 break;
2943
2944 iter->afi_safi_ix = 0;
2945 }
2946
2947 break;
2948
2949 case RIB_TABLES_ITER_S_DONE:
2950 return NULL;
2951 }
2952
2953 if (table)
2954 iter->state = RIB_TABLES_ITER_S_ITERATING;
2955 else
2956 iter->state = RIB_TABLES_ITER_S_DONE;
2957
2958 return table;
2959 }