]>
Commit | Line | Data |
---|---|---|
718e3744 | 1 | /* Routing Information Base. |
2 | * Copyright (C) 1997, 98, 99, 2001 Kunihiro Ishiguro | |
3 | * | |
4 | * This file is part of GNU Zebra. | |
5 | * | |
6 | * GNU Zebra is free software; you can redistribute it and/or modify it | |
7 | * under the terms of the GNU General Public License as published by the | |
8 | * Free Software Foundation; either version 2, or (at your option) any | |
9 | * later version. | |
10 | * | |
11 | * GNU Zebra is distributed in the hope that it will be useful, but | |
12 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
14 | * General Public License for more details. | |
15 | * | |
896014f4 DL |
16 | * You should have received a copy of the GNU General Public License along |
17 | * with this program; see the file COPYING; if not, write to the Free Software | |
18 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
718e3744 | 19 | */ |
20 | ||
21 | #include <zebra.h> | |
22 | ||
b892f1dd | 23 | #include "if.h" |
718e3744 | 24 | #include "prefix.h" |
25 | #include "table.h" | |
26 | #include "memory.h" | |
4a1ab8e4 | 27 | #include "zebra_memory.h" |
718e3744 | 28 | #include "command.h" |
718e3744 | 29 | #include "log.h" |
deaa50db | 30 | #include "log_int.h" |
718e3744 | 31 | #include "sockunion.h" |
4d38fdb4 | 32 | #include "linklist.h" |
33 | #include "thread.h" | |
34 | #include "workqueue.h" | |
7514fb77 PJ |
35 | #include "prefix.h" |
36 | #include "routemap.h" | |
fb018d25 | 37 | #include "nexthop.h" |
b72ede27 | 38 | #include "vrf.h" |
40c7bdb0 | 39 | #include "mpls.h" |
05737783 | 40 | #include "srcdest_table.h" |
718e3744 | 41 | |
42 | #include "zebra/rib.h" | |
43 | #include "zebra/rt.h" | |
7c551956 | 44 | #include "zebra/zebra_ns.h" |
718e3744 | 45 | #include "zebra/zserv.h" |
7c551956 | 46 | #include "zebra/zebra_vrf.h" |
718e3744 | 47 | #include "zebra/redistribute.h" |
8902474b | 48 | #include "zebra/zebra_routemap.h" |
718e3744 | 49 | #include "zebra/debug.h" |
fb018d25 | 50 | #include "zebra/zebra_rnh.h" |
88177fe3 | 51 | #include "zebra/interface.h" |
d44ca835 | 52 | #include "zebra/connected.h" |
6134fd82 | 53 | #include "zebra/zebra_vxlan.h" |
718e3744 | 54 | |
d62a17ae | 55 | DEFINE_HOOK(rib_update, (struct route_node * rn, const char *reason), |
56 | (rn, reason)) | |
4f8ea50c | 57 | |
6baf7bb8 DS |
58 | /* Should we allow non Quagga processes to delete our routes */ |
59 | extern int allow_delete; | |
60 | ||
718e3744 | 61 | /* Each route type's string and default distance value. */ |
d62a17ae | 62 | static const struct { |
63 | int key; | |
64 | int distance; | |
65 | } route_info[ZEBRA_ROUTE_MAX] = { | |
9d303b37 DL |
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. */}, | |
c710b277 DS |
76 | [ZEBRA_ROUTE_PIM] = {ZEBRA_ROUTE_PIM, 255}, |
77 | [ZEBRA_ROUTE_EIGRP] = {ZEBRA_ROUTE_EIGRP, 90}, | |
9d303b37 | 78 | [ZEBRA_ROUTE_NHRP] = {ZEBRA_ROUTE_NHRP, 10}, |
c710b277 DS |
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}, | |
400a663b | 89 | [ZEBRA_ROUTE_SHARP] = {ZEBRA_ROUTE_SHARP, 150}, |
c710b277 | 90 | |
d62a17ae | 91 | /* no entry/default: 150 */ |
718e3744 | 92 | }; |
6b0655a2 | 93 | |
4623d897 DL |
94 | /* RPF lookup behaviour */ |
95 | static enum multicast_mode ipv4_multicast_mode = MCAST_NO_CONFIG; | |
96 | ||
6c4f4e6e | 97 | |
d62a17ae | 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, ...) | |
2263a412 | 101 | { |
d62a17ae | 102 | char buf[SRCDEST2STR_BUFFER + sizeof(" (MRIB)")]; |
103 | char msgbuf[512]; | |
104 | va_list ap; | |
2263a412 | 105 | |
d62a17ae | 106 | va_start(ap, msgfmt); |
107 | vsnprintf(msgbuf, sizeof(msgbuf), msgfmt, ap); | |
108 | va_end(ap); | |
2263a412 | 109 | |
d62a17ae | 110 | if (rn) { |
111 | rib_table_info_t *info = srcdest_rnode_table_info(rn); | |
112 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
cb653491 | 113 | |
d62a17ae | 114 | if (info->safi == SAFI_MULTICAST) |
115 | strcat(buf, " (MRIB)"); | |
116 | } else { | |
117 | snprintf(buf, sizeof(buf), "{(route_node *) NULL}"); | |
118 | } | |
2263a412 | 119 | |
d62a17ae | 120 | zlog(priority, "%s: %d:%s: %s", _func, vrf_id, buf, msgbuf); |
2263a412 DL |
121 | } |
122 | ||
d62a17ae | 123 | #define rnode_debug(node, vrf_id, ...) \ |
2263a412 | 124 | _rnode_zlog(__func__, vrf_id, node, LOG_DEBUG, __VA_ARGS__) |
d62a17ae | 125 | #define rnode_info(node, ...) \ |
2263a412 DL |
126 | _rnode_zlog(__func__, vrf_id, node, LOG_INFO, __VA_ARGS__) |
127 | ||
fd289fc8 | 128 | uint8_t route_distance(int type) |
40c7bdb0 | 129 | { |
fd289fc8 | 130 | uint8_t distance; |
40c7bdb0 | 131 | |
d62a17ae | 132 | if ((unsigned)type >= array_size(route_info)) |
133 | distance = 150; | |
134 | else | |
135 | distance = route_info[type].distance; | |
40c7bdb0 | 136 | |
d62a17ae | 137 | return distance; |
40c7bdb0 | 138 | } |
139 | ||
d62a17ae | 140 | int is_zebra_valid_kernel_table(u_int32_t table_id) |
7a4bb9c5 | 141 | { |
d62a17ae | 142 | if ((table_id > ZEBRA_KERNEL_TABLE_MAX)) |
143 | return 0; | |
8f500a1c RW |
144 | |
145 | #ifdef linux | |
d62a17ae | 146 | if ((table_id == RT_TABLE_UNSPEC) || (table_id == RT_TABLE_LOCAL) |
147 | || (table_id == RT_TABLE_COMPAT)) | |
148 | return 0; | |
8f500a1c RW |
149 | #endif |
150 | ||
d62a17ae | 151 | return 1; |
7a4bb9c5 DS |
152 | } |
153 | ||
d62a17ae | 154 | int is_zebra_main_routing_table(u_int32_t table_id) |
7a4bb9c5 | 155 | { |
d62a17ae | 156 | if ((table_id == RT_TABLE_MAIN) |
157 | || (table_id == zebrad.rtm_table_default)) | |
158 | return 1; | |
159 | return 0; | |
7a4bb9c5 DS |
160 | } |
161 | ||
d62a17ae | 162 | int zebra_check_addr(struct prefix *p) |
0aabccc0 | 163 | { |
d62a17ae | 164 | if (p->family == AF_INET) { |
165 | u_int32_t addr; | |
0aabccc0 | 166 | |
d62a17ae | 167 | addr = p->u.prefix4.s_addr; |
168 | addr = ntohl(addr); | |
0aabccc0 | 169 | |
d62a17ae | 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; | |
0aabccc0 DD |
181 | } |
182 | ||
fa713d9e | 183 | /* Add nexthop to the end of a rib node's nexthop list */ |
d62a17ae | 184 | void route_entry_nexthop_add(struct route_entry *re, struct nexthop *nexthop) |
fa713d9e | 185 | { |
d62a17ae | 186 | nexthop_add(&re->nexthop, nexthop); |
187 | re->nexthop_num++; | |
718e3744 | 188 | } |
189 | ||
6e26278c | 190 | |
6e26278c DS |
191 | /** |
192 | * copy_nexthop - copy a nexthop to the rib structure. | |
193 | */ | |
d62a17ae | 194 | void route_entry_copy_nexthops(struct route_entry *re, struct nexthop *nh) |
6e26278c | 195 | { |
d62a17ae | 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++; | |
6e26278c DS |
200 | } |
201 | ||
718e3744 | 202 | /* Delete specified nexthop from the list. */ |
d62a17ae | 203 | void route_entry_nexthop_delete(struct route_entry *re, struct nexthop *nexthop) |
718e3744 | 204 | { |
d62a17ae | 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--; | |
718e3744 | 212 | } |
213 | ||
fa713d9e | 214 | |
d62a17ae | 215 | struct nexthop *route_entry_nexthop_ifindex_add(struct route_entry *re, |
4a7371e9 DS |
216 | ifindex_t ifindex, |
217 | vrf_id_t nh_vrf_id) | |
718e3744 | 218 | { |
d62a17ae | 219 | struct nexthop *nexthop; |
718e3744 | 220 | |
d62a17ae | 221 | nexthop = nexthop_new(); |
222 | nexthop->type = NEXTHOP_TYPE_IFINDEX; | |
223 | nexthop->ifindex = ifindex; | |
4a7371e9 | 224 | nexthop->vrf_id = nh_vrf_id; |
718e3744 | 225 | |
d62a17ae | 226 | route_entry_nexthop_add(re, nexthop); |
718e3744 | 227 | |
d62a17ae | 228 | return nexthop; |
718e3744 | 229 | } |
230 | ||
d62a17ae | 231 | struct nexthop *route_entry_nexthop_ipv4_add(struct route_entry *re, |
232 | struct in_addr *ipv4, | |
4a7371e9 DS |
233 | struct in_addr *src, |
234 | vrf_id_t nh_vrf_id) | |
718e3744 | 235 | { |
d62a17ae | 236 | struct nexthop *nexthop; |
718e3744 | 237 | |
d62a17ae | 238 | nexthop = nexthop_new(); |
239 | nexthop->type = NEXTHOP_TYPE_IPV4; | |
4a7371e9 | 240 | nexthop->vrf_id = nh_vrf_id; |
d62a17ae | 241 | nexthop->gate.ipv4 = *ipv4; |
242 | if (src) | |
243 | nexthop->src.ipv4 = *src; | |
718e3744 | 244 | |
d62a17ae | 245 | route_entry_nexthop_add(re, nexthop); |
718e3744 | 246 | |
d62a17ae | 247 | return nexthop; |
718e3744 | 248 | } |
249 | ||
d62a17ae | 250 | struct nexthop *route_entry_nexthop_ipv4_ifindex_add(struct route_entry *re, |
251 | struct in_addr *ipv4, | |
252 | struct in_addr *src, | |
4a7371e9 DS |
253 | ifindex_t ifindex, |
254 | vrf_id_t nh_vrf_id) | |
718e3744 | 255 | { |
d62a17ae | 256 | struct nexthop *nexthop; |
257 | struct interface *ifp; | |
718e3744 | 258 | |
d62a17ae | 259 | nexthop = nexthop_new(); |
4a7371e9 | 260 | nexthop->vrf_id = nh_vrf_id; |
d62a17ae | 261 | nexthop->type = NEXTHOP_TYPE_IPV4_IFINDEX; |
262 | nexthop->gate.ipv4 = *ipv4; | |
263 | if (src) | |
264 | nexthop->src.ipv4 = *src; | |
265 | nexthop->ifindex = ifindex; | |
4a7371e9 | 266 | ifp = if_lookup_by_index(nexthop->ifindex, nh_vrf_id); |
d62a17ae | 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) | |
d3135ba3 | 270 | if (connected_is_unnumbered(ifp) || |
90264d64 | 271 | CHECK_FLAG(re->flags, ZEBRA_FLAG_EVPN_ROUTE)) { |
d62a17ae | 272 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ONLINK); |
273 | } | |
718e3744 | 274 | |
d62a17ae | 275 | route_entry_nexthop_add(re, nexthop); |
718e3744 | 276 | |
d62a17ae | 277 | return nexthop; |
718e3744 | 278 | } |
279 | ||
d62a17ae | 280 | struct nexthop *route_entry_nexthop_ipv6_add(struct route_entry *re, |
4a7371e9 DS |
281 | struct in6_addr *ipv6, |
282 | vrf_id_t nh_vrf_id) | |
718e3744 | 283 | { |
d62a17ae | 284 | struct nexthop *nexthop; |
718e3744 | 285 | |
d62a17ae | 286 | nexthop = nexthop_new(); |
4a7371e9 | 287 | nexthop->vrf_id = nh_vrf_id; |
d62a17ae | 288 | nexthop->type = NEXTHOP_TYPE_IPV6; |
289 | nexthop->gate.ipv6 = *ipv6; | |
718e3744 | 290 | |
d62a17ae | 291 | route_entry_nexthop_add(re, nexthop); |
718e3744 | 292 | |
d62a17ae | 293 | return nexthop; |
718e3744 | 294 | } |
295 | ||
d62a17ae | 296 | struct nexthop *route_entry_nexthop_ipv6_ifindex_add(struct route_entry *re, |
297 | struct in6_addr *ipv6, | |
4a7371e9 DS |
298 | ifindex_t ifindex, |
299 | vrf_id_t nh_vrf_id) | |
718e3744 | 300 | { |
d62a17ae | 301 | struct nexthop *nexthop; |
718e3744 | 302 | |
d62a17ae | 303 | nexthop = nexthop_new(); |
4a7371e9 | 304 | nexthop->vrf_id = nh_vrf_id; |
d62a17ae | 305 | nexthop->type = NEXTHOP_TYPE_IPV6_IFINDEX; |
306 | nexthop->gate.ipv6 = *ipv6; | |
307 | nexthop->ifindex = ifindex; | |
718e3744 | 308 | |
d62a17ae | 309 | route_entry_nexthop_add(re, nexthop); |
718e3744 | 310 | |
d62a17ae | 311 | return nexthop; |
718e3744 | 312 | } |
718e3744 | 313 | |
a8309422 | 314 | struct nexthop *route_entry_nexthop_blackhole_add(struct route_entry *re, |
60466a63 | 315 | enum blackhole_type bh_type) |
595db7f1 | 316 | { |
d62a17ae | 317 | struct nexthop *nexthop; |
595db7f1 | 318 | |
d62a17ae | 319 | nexthop = nexthop_new(); |
4a7371e9 | 320 | nexthop->vrf_id = VRF_DEFAULT; |
d62a17ae | 321 | nexthop->type = NEXTHOP_TYPE_BLACKHOLE; |
a8309422 | 322 | nexthop->bh_type = bh_type; |
595db7f1 | 323 | |
d62a17ae | 324 | route_entry_nexthop_add(re, nexthop); |
595db7f1 | 325 | |
d62a17ae | 326 | return nexthop; |
595db7f1 | 327 | } |
328 | ||
d62a17ae | 329 | static void nexthop_set_resolved(afi_t afi, struct nexthop *newhop, |
330 | struct nexthop *nexthop) | |
4491a88f | 331 | { |
d62a17ae | 332 | struct nexthop *resolved_hop; |
4491a88f | 333 | |
d62a17ae | 334 | resolved_hop = nexthop_new(); |
335 | SET_FLAG(resolved_hop->flags, NEXTHOP_FLAG_ACTIVE); | |
d855d11f | 336 | |
4a7371e9 | 337 | resolved_hop->vrf_id = nexthop->vrf_id; |
d855d11f RW |
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 */ | |
d62a17ae | 342 | resolved_hop->type = newhop->type; |
343 | resolved_hop->gate.ipv4 = newhop->gate.ipv4; | |
4491a88f | 344 | |
d62a17ae | 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 | } | |
d855d11f RW |
351 | break; |
352 | case NEXTHOP_TYPE_IPV6: | |
353 | case NEXTHOP_TYPE_IPV6_IFINDEX: | |
d62a17ae | 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 | } | |
d855d11f RW |
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 | */ | |
d62a17ae | 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; | |
d855d11f RW |
381 | break; |
382 | case NEXTHOP_TYPE_BLACKHOLE: | |
59693377 DS |
383 | resolved_hop->type = NEXTHOP_TYPE_BLACKHOLE; |
384 | resolved_hop->bh_type = nexthop->bh_type; | |
d855d11f | 385 | break; |
59693377 | 386 | } |
d855d11f | 387 | |
f674dfe2 RW |
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 | ||
d62a17ae | 394 | resolved_hop->rparent = nexthop; |
395 | nexthop_add(&nexthop->resolved, resolved_hop); | |
4491a88f DS |
396 | } |
397 | ||
718e3744 | 398 | /* If force flag is not set, do not modify falgs at all for uninstall |
399 | the route from FIB. */ | |
d62a17ae | 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; | |
5f7a4718 | 407 | struct route_entry *match = NULL; |
d62a17ae | 408 | int resolved; |
409 | struct nexthop *newhop; | |
410 | struct interface *ifp; | |
5f7a4718 | 411 | rib_dest_t *dest; |
d62a17ae | 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); | |
4a7371e9 | 419 | zebra_deregister_rnh_static_nexthops(nexthop->vrf_id, |
d62a17ae | 420 | nexthop->resolved, top); |
421 | nexthops_free(nexthop->resolved); | |
422 | nexthop->resolved = NULL; | |
423 | re->nexthop_mtu = 0; | |
d44ca835 | 424 | } |
18ff3edd | 425 | |
d62a17ae | 426 | /* Skip nexthops that have been filtered out due to route-map */ |
427 | /* The nexthops are specific to this route and so the same */ | |
428 | /* nexthop for a different route may not have this flag set */ | |
429 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FILTERED)) | |
430 | return 0; | |
431 | ||
432 | /* | |
433 | * Check to see if we should trust the passed in information | |
434 | * for UNNUMBERED interfaces as that we won't find the GW | |
435 | * address in the routing table. | |
436 | */ | |
437 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ONLINK)) { | |
4a7371e9 | 438 | ifp = if_lookup_by_index(nexthop->ifindex, nexthop->vrf_id); |
d62a17ae | 439 | if (ifp && connected_is_unnumbered(ifp)) { |
440 | if (if_is_operative(ifp)) | |
441 | return 1; | |
442 | else | |
443 | return 0; | |
444 | } else | |
445 | return 0; | |
16814f96 | 446 | } |
718e3744 | 447 | |
d62a17ae | 448 | /* Make lookup prefix. */ |
449 | memset(&p, 0, sizeof(struct prefix)); | |
450 | switch (afi) { | |
451 | case AFI_IP: | |
452 | p.family = AF_INET; | |
453 | p.prefixlen = IPV4_MAX_PREFIXLEN; | |
454 | p.u.prefix4 = nexthop->gate.ipv4; | |
455 | break; | |
456 | case AFI_IP6: | |
457 | p.family = AF_INET6; | |
458 | p.prefixlen = IPV6_MAX_PREFIXLEN; | |
459 | p.u.prefix6 = nexthop->gate.ipv6; | |
460 | break; | |
461 | default: | |
462 | assert(afi != AFI_IP && afi != AFI_IP6); | |
463 | break; | |
718e3744 | 464 | } |
d62a17ae | 465 | /* Lookup table. */ |
4a7371e9 | 466 | table = zebra_vrf_table(afi, SAFI_UNICAST, nexthop->vrf_id); |
d62a17ae | 467 | if (!table) |
468 | return 0; | |
469 | ||
470 | rn = route_node_match(table, (struct prefix *)&p); | |
471 | while (rn) { | |
472 | route_unlock_node(rn); | |
473 | ||
fd7fd9e5 DS |
474 | /* Lookup should halt if we've matched against ourselves ('top', |
475 | * if specified) - i.e., we cannot have a nexthop NH1 is | |
476 | * resolved by a route NH1. The exception is if the route is a | |
477 | * host route. | |
478 | */ | |
479 | if (top && rn == top) | |
480 | if (((afi == AFI_IP) && (rn->p.prefixlen != 32)) || | |
481 | ((afi == AFI_IP6) && (rn->p.prefixlen != 128))) | |
482 | return 0; | |
d62a17ae | 483 | |
484 | /* Pick up selected route. */ | |
485 | /* However, do not resolve over default route unless explicitly | |
486 | * allowed. */ | |
487 | if (is_default_prefix(&rn->p) | |
44bdf159 | 488 | && !rnh_resolve_via_default(p.family)) |
d62a17ae | 489 | return 0; |
490 | ||
5f7a4718 DS |
491 | dest = rib_dest_from_rnode(rn); |
492 | if (dest && dest->selected_fib && | |
493 | !CHECK_FLAG(dest->selected_fib->status, | |
494 | ROUTE_ENTRY_REMOVED) && | |
495 | dest->selected_fib->type != ZEBRA_ROUTE_TABLE) | |
496 | match = dest->selected_fib; | |
48a53dc7 | 497 | |
d62a17ae | 498 | /* If there is no selected route or matched route is EGP, go up |
499 | tree. */ | |
500 | if (!match) { | |
501 | do { | |
502 | rn = rn->parent; | |
503 | } while (rn && rn->info == NULL); | |
504 | if (rn) | |
505 | route_lock_node(rn); | |
c87bdd2b | 506 | |
d62a17ae | 507 | continue; |
508 | } | |
509 | ||
d62a17ae | 510 | if (match->type == ZEBRA_ROUTE_CONNECT) { |
511 | /* Directly point connected route. */ | |
512 | newhop = match->nexthop; | |
513 | if (newhop) { | |
514 | if (nexthop->type == NEXTHOP_TYPE_IPV4 | |
515 | || nexthop->type == NEXTHOP_TYPE_IPV6) | |
516 | nexthop->ifindex = newhop->ifindex; | |
517 | } | |
518 | return 1; | |
519 | } else if (CHECK_FLAG(re->flags, ZEBRA_FLAG_INTERNAL)) { | |
520 | resolved = 0; | |
a8309422 | 521 | for (ALL_NEXTHOPS(match->nexthop, newhop)) { |
a8309422 DL |
522 | if (!CHECK_FLAG(newhop->flags, |
523 | NEXTHOP_FLAG_FIB)) | |
524 | continue; | |
525 | if (CHECK_FLAG(newhop->flags, | |
526 | NEXTHOP_FLAG_RECURSIVE)) | |
527 | continue; | |
528 | ||
529 | if (set) { | |
530 | SET_FLAG(nexthop->flags, | |
531 | NEXTHOP_FLAG_RECURSIVE); | |
532 | SET_FLAG(re->status, | |
533 | ROUTE_ENTRY_NEXTHOPS_CHANGED); | |
534 | nexthop_set_resolved(afi, newhop, | |
535 | nexthop); | |
d62a17ae | 536 | } |
a8309422 DL |
537 | resolved = 1; |
538 | } | |
43e31305 JB |
539 | if (resolved && set) |
540 | re->nexthop_mtu = match->mtu; | |
d62a17ae | 541 | return resolved; |
542 | } else if (re->type == ZEBRA_ROUTE_STATIC) { | |
543 | resolved = 0; | |
a8309422 | 544 | for (ALL_NEXTHOPS(match->nexthop, newhop)) { |
a8309422 DL |
545 | if (!CHECK_FLAG(newhop->flags, |
546 | NEXTHOP_FLAG_FIB)) | |
547 | continue; | |
548 | ||
549 | if (set) { | |
550 | SET_FLAG(nexthop->flags, | |
551 | NEXTHOP_FLAG_RECURSIVE); | |
552 | nexthop_set_resolved(afi, newhop, | |
553 | nexthop); | |
d62a17ae | 554 | } |
a8309422 DL |
555 | resolved = 1; |
556 | } | |
d62a17ae | 557 | if (resolved && set) |
558 | re->nexthop_mtu = match->mtu; | |
559 | return resolved; | |
560 | } else { | |
561 | return 0; | |
562 | } | |
718e3744 | 563 | } |
d62a17ae | 564 | return 0; |
718e3744 | 565 | } |
718e3744 | 566 | |
d62a17ae | 567 | struct route_entry *rib_match(afi_t afi, safi_t safi, vrf_id_t vrf_id, |
568 | union g_addr *addr, struct route_node **rn_out) | |
569 | { | |
570 | struct prefix p; | |
571 | struct route_table *table; | |
572 | struct route_node *rn; | |
5f7a4718 | 573 | struct route_entry *match = NULL; |
d62a17ae | 574 | struct nexthop *newhop; |
575 | ||
576 | /* Lookup table. */ | |
577 | table = zebra_vrf_table(afi, safi, vrf_id); | |
578 | if (!table) | |
579 | return 0; | |
580 | ||
581 | memset(&p, 0, sizeof(struct prefix)); | |
582 | p.family = afi; | |
583 | if (afi == AFI_IP) { | |
584 | p.u.prefix4 = addr->ipv4; | |
585 | p.prefixlen = IPV4_MAX_PREFIXLEN; | |
586 | } else { | |
587 | p.u.prefix6 = addr->ipv6; | |
588 | p.prefixlen = IPV6_MAX_PREFIXLEN; | |
589 | } | |
718e3744 | 590 | |
d62a17ae | 591 | rn = route_node_match(table, (struct prefix *)&p); |
718e3744 | 592 | |
d62a17ae | 593 | while (rn) { |
5f7a4718 DS |
594 | rib_dest_t *dest; |
595 | ||
d62a17ae | 596 | route_unlock_node(rn); |
718e3744 | 597 | |
5f7a4718 DS |
598 | dest = rib_dest_from_rnode(rn); |
599 | if (dest && dest->selected_fib && | |
600 | !CHECK_FLAG(dest->selected_fib->status, ROUTE_ENTRY_REMOVED)) | |
601 | match = dest->selected_fib; | |
718e3744 | 602 | |
d62a17ae | 603 | /* If there is no selected route or matched route is EGP, go up |
604 | tree. */ | |
605 | if (!match) { | |
606 | do { | |
607 | rn = rn->parent; | |
608 | } while (rn && rn->info == NULL); | |
609 | if (rn) | |
610 | route_lock_node(rn); | |
611 | } else { | |
612 | if (match->type != ZEBRA_ROUTE_CONNECT) { | |
613 | int found = 0; | |
614 | for (ALL_NEXTHOPS(match->nexthop, newhop)) | |
615 | if (CHECK_FLAG(newhop->flags, | |
616 | NEXTHOP_FLAG_FIB)) { | |
617 | found = 1; | |
618 | break; | |
619 | } | |
620 | if (!found) | |
621 | return NULL; | |
622 | } | |
623 | ||
624 | if (rn_out) | |
625 | *rn_out = rn; | |
626 | return match; | |
627 | } | |
16814f96 | 628 | } |
d62a17ae | 629 | return NULL; |
630 | } | |
631 | ||
632 | struct route_entry *rib_match_ipv4_multicast(vrf_id_t vrf_id, | |
633 | struct in_addr addr, | |
634 | struct route_node **rn_out) | |
635 | { | |
636 | struct route_entry *re = NULL, *mre = NULL, *ure = NULL; | |
637 | struct route_node *m_rn = NULL, *u_rn = NULL; | |
638 | union g_addr gaddr = {.ipv4 = addr}; | |
639 | ||
640 | switch (ipv4_multicast_mode) { | |
641 | case MCAST_MRIB_ONLY: | |
642 | return rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr, | |
643 | rn_out); | |
644 | case MCAST_URIB_ONLY: | |
645 | return rib_match(AFI_IP, SAFI_UNICAST, vrf_id, &gaddr, rn_out); | |
646 | case MCAST_NO_CONFIG: | |
647 | case MCAST_MIX_MRIB_FIRST: | |
648 | re = mre = rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr, | |
649 | &m_rn); | |
650 | if (!mre) | |
651 | re = ure = rib_match(AFI_IP, SAFI_UNICAST, vrf_id, | |
652 | &gaddr, &u_rn); | |
653 | break; | |
654 | case MCAST_MIX_DISTANCE: | |
655 | mre = rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr, &m_rn); | |
656 | ure = rib_match(AFI_IP, SAFI_UNICAST, vrf_id, &gaddr, &u_rn); | |
657 | if (mre && ure) | |
658 | re = ure->distance < mre->distance ? ure : mre; | |
659 | else if (mre) | |
660 | re = mre; | |
661 | else if (ure) | |
662 | re = ure; | |
663 | break; | |
664 | case MCAST_MIX_PFXLEN: | |
665 | mre = rib_match(AFI_IP, SAFI_MULTICAST, vrf_id, &gaddr, &m_rn); | |
666 | ure = rib_match(AFI_IP, SAFI_UNICAST, vrf_id, &gaddr, &u_rn); | |
667 | if (mre && ure) | |
668 | re = u_rn->p.prefixlen > m_rn->p.prefixlen ? ure : mre; | |
669 | else if (mre) | |
670 | re = mre; | |
671 | else if (ure) | |
672 | re = ure; | |
673 | break; | |
718e3744 | 674 | } |
33550aa8 | 675 | |
d62a17ae | 676 | if (rn_out) |
677 | *rn_out = (re == mre) ? m_rn : u_rn; | |
718e3744 | 678 | |
d62a17ae | 679 | if (IS_ZEBRA_DEBUG_RIB) { |
680 | char buf[BUFSIZ]; | |
681 | inet_ntop(AF_INET, &addr, buf, BUFSIZ); | |
4623d897 | 682 | |
d62a17ae | 683 | zlog_debug("%s: %s: found %s, using %s", __func__, buf, |
684 | mre ? (ure ? "MRIB+URIB" : "MRIB") | |
685 | : ure ? "URIB" : "nothing", | |
686 | re == ure ? "URIB" : re == mre ? "MRIB" : "none"); | |
687 | } | |
688 | return re; | |
4623d897 DL |
689 | } |
690 | ||
d62a17ae | 691 | void multicast_mode_ipv4_set(enum multicast_mode mode) |
4623d897 | 692 | { |
d62a17ae | 693 | if (IS_ZEBRA_DEBUG_RIB) |
694 | zlog_debug("%s: multicast lookup mode set (%d)", __func__, | |
695 | mode); | |
696 | ipv4_multicast_mode = mode; | |
4623d897 DL |
697 | } |
698 | ||
d62a17ae | 699 | enum multicast_mode multicast_mode_ipv4_get(void) |
4623d897 | 700 | { |
d62a17ae | 701 | return ipv4_multicast_mode; |
4623d897 DL |
702 | } |
703 | ||
d62a17ae | 704 | struct route_entry *rib_lookup_ipv4(struct prefix_ipv4 *p, vrf_id_t vrf_id) |
718e3744 | 705 | { |
d62a17ae | 706 | struct route_table *table; |
707 | struct route_node *rn; | |
5f7a4718 | 708 | struct route_entry *match = NULL; |
d62a17ae | 709 | struct nexthop *nexthop; |
5f7a4718 | 710 | rib_dest_t *dest; |
718e3744 | 711 | |
d62a17ae | 712 | /* Lookup table. */ |
713 | table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id); | |
714 | if (!table) | |
715 | return 0; | |
718e3744 | 716 | |
d62a17ae | 717 | rn = route_node_lookup(table, (struct prefix *)p); |
718e3744 | 718 | |
d62a17ae | 719 | /* No route for this prefix. */ |
720 | if (!rn) | |
721 | return NULL; | |
718e3744 | 722 | |
d62a17ae | 723 | /* Unlock node. */ |
724 | route_unlock_node(rn); | |
5f7a4718 | 725 | dest = rib_dest_from_rnode(rn); |
718e3744 | 726 | |
5f7a4718 DS |
727 | if (dest && dest->selected_fib && |
728 | !CHECK_FLAG(dest->selected_fib->status, ROUTE_ENTRY_REMOVED)) | |
729 | match = dest->selected_fib; | |
718e3744 | 730 | |
d62a17ae | 731 | if (!match) |
732 | return NULL; | |
718e3744 | 733 | |
d62a17ae | 734 | if (match->type == ZEBRA_ROUTE_CONNECT) |
735 | return match; | |
f9e1b38e | 736 | |
d62a17ae | 737 | for (ALL_NEXTHOPS(match->nexthop, nexthop)) |
738 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) | |
739 | return match; | |
718e3744 | 740 | |
d62a17ae | 741 | return NULL; |
718e3744 | 742 | } |
743 | ||
dc95824a DO |
744 | /* |
745 | * This clone function, unlike its original rib_lookup_ipv4(), checks | |
746 | * if specified IPv4 route record (prefix/mask -> gate) exists in | |
f0f77c9a | 747 | * the whole RIB and has ROUTE_ENTRY_SELECTED_FIB set. |
dc95824a DO |
748 | * |
749 | * Return values: | |
750 | * -1: error | |
751 | * 0: exact match found | |
752 | * 1: a match was found with a different gate | |
753 | * 2: connected route found | |
754 | * 3: no matches found | |
755 | */ | |
d62a17ae | 756 | int rib_lookup_ipv4_route(struct prefix_ipv4 *p, union sockunion *qgate, |
757 | vrf_id_t vrf_id) | |
dc95824a | 758 | { |
d62a17ae | 759 | struct route_table *table; |
760 | struct route_node *rn; | |
5f7a4718 | 761 | struct route_entry *match = NULL; |
d62a17ae | 762 | struct nexthop *nexthop; |
763 | int nexthops_active; | |
5f7a4718 | 764 | rib_dest_t *dest; |
dc95824a | 765 | |
d62a17ae | 766 | /* Lookup table. */ |
767 | table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id); | |
768 | if (!table) | |
769 | return ZEBRA_RIB_LOOKUP_ERROR; | |
dc95824a | 770 | |
d62a17ae | 771 | /* Scan the RIB table for exactly matching RIB entry. */ |
772 | rn = route_node_lookup(table, (struct prefix *)p); | |
dc95824a | 773 | |
d62a17ae | 774 | /* No route for this prefix. */ |
775 | if (!rn) | |
776 | return ZEBRA_RIB_NOTFOUND; | |
dc95824a | 777 | |
d62a17ae | 778 | /* Unlock node. */ |
779 | route_unlock_node(rn); | |
5f7a4718 | 780 | dest = rib_dest_from_rnode(rn); |
dc95824a | 781 | |
d62a17ae | 782 | /* Find out if a "selected" RR for the discovered RIB entry exists ever. |
783 | */ | |
5f7a4718 DS |
784 | if (dest && dest->selected_fib && |
785 | !CHECK_FLAG(dest->selected_fib->status, ROUTE_ENTRY_REMOVED)) | |
786 | match = dest->selected_fib; | |
dc95824a | 787 | |
d62a17ae | 788 | /* None such found :( */ |
789 | if (!match) | |
790 | return ZEBRA_RIB_NOTFOUND; | |
791 | ||
792 | if (match->type == ZEBRA_ROUTE_CONNECT) | |
793 | return ZEBRA_RIB_FOUND_CONNECTED; | |
794 | ||
795 | /* Ok, we have a cood candidate, let's check it's nexthop list... */ | |
796 | nexthops_active = 0; | |
797 | for (ALL_NEXTHOPS(match->nexthop, nexthop)) | |
798 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) { | |
799 | nexthops_active = 1; | |
800 | if (nexthop->gate.ipv4.s_addr == sockunion2ip(qgate)) | |
801 | return ZEBRA_RIB_FOUND_EXACT; | |
802 | if (IS_ZEBRA_DEBUG_RIB) { | |
803 | char gate_buf[INET_ADDRSTRLEN], | |
804 | qgate_buf[INET_ADDRSTRLEN]; | |
805 | inet_ntop(AF_INET, &nexthop->gate.ipv4.s_addr, | |
806 | gate_buf, INET_ADDRSTRLEN); | |
807 | inet_ntop(AF_INET, &sockunion2ip(qgate), | |
808 | qgate_buf, INET_ADDRSTRLEN); | |
809 | zlog_debug("%s: qgate == %s, %s == %s", | |
810 | __func__, qgate_buf, | |
811 | nexthop->rparent ? "rgate" : "gate", | |
812 | gate_buf); | |
813 | } | |
814 | } | |
815 | ||
816 | if (nexthops_active) | |
817 | return ZEBRA_RIB_FOUND_NOGATE; | |
818 | ||
819 | return ZEBRA_RIB_NOTFOUND; | |
820 | } | |
821 | ||
822 | #define RIB_SYSTEM_ROUTE(R) \ | |
823 | ((R)->type == ZEBRA_ROUTE_KERNEL || (R)->type == ZEBRA_ROUTE_CONNECT) | |
7514fb77 | 824 | |
dc95824a DO |
825 | /* This function verifies reachability of one given nexthop, which can be |
826 | * numbered or unnumbered, IPv4 or IPv6. The result is unconditionally stored | |
827 | * in nexthop->flags field. If the 4th parameter, 'set', is non-zero, | |
828 | * nexthop->ifindex will be updated appropriately as well. | |
829 | * An existing route map can turn (otherwise active) nexthop into inactive, but | |
830 | * not vice versa. | |
831 | * | |
832 | * The return value is the final value of 'ACTIVE' flag. | |
833 | */ | |
834 | ||
d62a17ae | 835 | static unsigned nexthop_active_check(struct route_node *rn, |
836 | struct route_entry *re, | |
837 | struct nexthop *nexthop, int set) | |
838 | { | |
839 | struct interface *ifp; | |
840 | route_map_result_t ret = RMAP_MATCH; | |
841 | int family; | |
842 | char buf[SRCDEST2STR_BUFFER]; | |
843 | struct prefix *p, *src_p; | |
844 | srcdest_rnode_prefixes(rn, &p, &src_p); | |
845 | ||
846 | if (rn->p.family == AF_INET) | |
847 | family = AFI_IP; | |
848 | else if (rn->p.family == AF_INET6) | |
849 | family = AFI_IP6; | |
850 | else | |
851 | family = 0; | |
852 | switch (nexthop->type) { | |
853 | case NEXTHOP_TYPE_IFINDEX: | |
4a7371e9 | 854 | ifp = if_lookup_by_index(nexthop->ifindex, nexthop->vrf_id); |
d62a17ae | 855 | if (ifp && if_is_operative(ifp)) |
856 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
857 | else | |
858 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
859 | break; | |
860 | case NEXTHOP_TYPE_IPV4: | |
861 | case NEXTHOP_TYPE_IPV4_IFINDEX: | |
862 | family = AFI_IP; | |
19a847a9 MK |
863 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_EVPN_RVTEP)) |
864 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
865 | else if (nexthop_active(AFI_IP, re, nexthop, set, rn)) | |
d62a17ae | 866 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); |
867 | else | |
868 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
869 | break; | |
870 | case NEXTHOP_TYPE_IPV6: | |
871 | family = AFI_IP6; | |
872 | if (nexthop_active(AFI_IP6, re, nexthop, set, rn)) | |
873 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
874 | else | |
875 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
876 | break; | |
877 | case NEXTHOP_TYPE_IPV6_IFINDEX: | |
878 | /* RFC 5549, v4 prefix with v6 NH */ | |
879 | if (rn->p.family != AF_INET) | |
880 | family = AFI_IP6; | |
881 | if (IN6_IS_ADDR_LINKLOCAL(&nexthop->gate.ipv6)) { | |
007dbee6 | 882 | ifp = if_lookup_by_index(nexthop->ifindex, |
4a7371e9 | 883 | nexthop->vrf_id); |
d62a17ae | 884 | if (ifp && if_is_operative(ifp)) |
885 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
886 | else | |
887 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
888 | } else { | |
889 | if (nexthop_active(AFI_IP6, re, nexthop, set, rn)) | |
890 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
891 | else | |
892 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
893 | } | |
894 | break; | |
895 | case NEXTHOP_TYPE_BLACKHOLE: | |
896 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
897 | break; | |
898 | default: | |
899 | break; | |
900 | } | |
901 | if (!CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE)) | |
902 | return 0; | |
903 | ||
904 | /* XXX: What exactly do those checks do? Do we support | |
905 | * e.g. IPv4 routes with IPv6 nexthops or vice versa? */ | |
906 | if (RIB_SYSTEM_ROUTE(re) || (family == AFI_IP && p->family != AF_INET) | |
907 | || (family == AFI_IP6 && p->family != AF_INET6)) | |
908 | return CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
909 | ||
910 | /* The original code didn't determine the family correctly | |
911 | * e.g. for NEXTHOP_TYPE_IFINDEX. Retrieve the correct afi | |
912 | * from the rib_table_info in those cases. | |
913 | * Possibly it may be better to use only the rib_table_info | |
914 | * in every case. | |
915 | */ | |
916 | if (!family) { | |
917 | rib_table_info_t *info; | |
918 | ||
919 | info = srcdest_rnode_table_info(rn); | |
920 | family = info->afi; | |
718e3744 | 921 | } |
c52ef59f | 922 | |
d62a17ae | 923 | memset(&nexthop->rmap_src.ipv6, 0, sizeof(union g_addr)); |
924 | ||
925 | /* It'll get set if required inside */ | |
4a7371e9 DS |
926 | ret = zebra_route_map_check(family, re->type, p, nexthop, |
927 | nexthop->vrf_id, re->tag); | |
d62a17ae | 928 | if (ret == RMAP_DENYMATCH) { |
929 | if (IS_ZEBRA_DEBUG_RIB) { | |
930 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
931 | zlog_debug( | |
932 | "%u:%s: Filtering out with NH out %s due to route map", | |
933 | re->vrf_id, buf, | |
99b9d960 | 934 | ifindex2ifname(nexthop->ifindex, |
4a7371e9 | 935 | nexthop->vrf_id)); |
d62a17ae | 936 | } |
937 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
518f0eb1 | 938 | } |
d62a17ae | 939 | return CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); |
718e3744 | 940 | } |
941 | ||
03e232a4 | 942 | /* Iterate over all nexthops of the given RIB entry and refresh their |
f0f77c9a DS |
943 | * ACTIVE flag. re->nexthop_active_num is updated accordingly. If any |
944 | * nexthop is found to toggle the ACTIVE flag, the whole re structure | |
945 | * is flagged with ROUTE_ENTRY_CHANGED. The 4th 'set' argument is | |
03e232a4 DO |
946 | * transparently passed to nexthop_active_check(). |
947 | * | |
948 | * Return value is the new number of active nexthops. | |
949 | */ | |
950 | ||
d62a17ae | 951 | static int nexthop_active_update(struct route_node *rn, struct route_entry *re, |
952 | int set) | |
953 | { | |
954 | struct nexthop *nexthop; | |
955 | union g_addr prev_src; | |
956 | unsigned int prev_active, new_active, old_num_nh; | |
957 | ifindex_t prev_index; | |
958 | old_num_nh = re->nexthop_active_num; | |
959 | ||
960 | re->nexthop_active_num = 0; | |
961 | UNSET_FLAG(re->status, ROUTE_ENTRY_CHANGED); | |
962 | ||
963 | for (nexthop = re->nexthop; nexthop; nexthop = nexthop->next) { | |
964 | /* No protocol daemon provides src and so we're skipping | |
965 | * tracking it */ | |
966 | prev_src = nexthop->rmap_src; | |
967 | prev_active = CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE); | |
968 | prev_index = nexthop->ifindex; | |
969 | if ((new_active = nexthop_active_check(rn, re, nexthop, set))) | |
970 | re->nexthop_active_num++; | |
971 | /* Don't allow src setting on IPv6 addr for now */ | |
972 | if (prev_active != new_active || prev_index != nexthop->ifindex | |
973 | || ((nexthop->type >= NEXTHOP_TYPE_IFINDEX | |
974 | && nexthop->type < NEXTHOP_TYPE_IPV6) | |
975 | && prev_src.ipv4.s_addr | |
976 | != nexthop->rmap_src.ipv4.s_addr) | |
977 | || ((nexthop->type >= NEXTHOP_TYPE_IPV6 | |
978 | && nexthop->type < NEXTHOP_TYPE_BLACKHOLE) | |
979 | && !(IPV6_ADDR_SAME(&prev_src.ipv6, | |
980 | &nexthop->rmap_src.ipv6)))) { | |
981 | SET_FLAG(re->status, ROUTE_ENTRY_CHANGED); | |
982 | SET_FLAG(re->status, ROUTE_ENTRY_NEXTHOPS_CHANGED); | |
983 | } | |
984 | } | |
985 | ||
986 | if (old_num_nh != re->nexthop_active_num) | |
987 | SET_FLAG(re->status, ROUTE_ENTRY_CHANGED); | |
6e26278c | 988 | |
d62a17ae | 989 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_CHANGED)) { |
990 | SET_FLAG(re->status, ROUTE_ENTRY_NEXTHOPS_CHANGED); | |
991 | } | |
992 | ||
993 | return re->nexthop_active_num; | |
718e3744 | 994 | } |
6baeb988 | 995 | |
a64448ba DS |
996 | /* |
997 | * Is this RIB labeled-unicast? It must be of type BGP and all paths | |
998 | * (nexthops) must have a label. | |
999 | */ | |
d62a17ae | 1000 | int zebra_rib_labeled_unicast(struct route_entry *re) |
a64448ba | 1001 | { |
d62a17ae | 1002 | struct nexthop *nexthop = NULL; |
a64448ba | 1003 | |
d62a17ae | 1004 | if (re->type != ZEBRA_ROUTE_BGP) |
1005 | return 0; | |
a64448ba | 1006 | |
d62a17ae | 1007 | for (ALL_NEXTHOPS(re->nexthop, nexthop)) |
1008 | if (!nexthop->nh_label || !nexthop->nh_label->num_labels) | |
1009 | return 0; | |
6b0655a2 | 1010 | |
d62a17ae | 1011 | return 1; |
a64448ba | 1012 | } |
718e3744 | 1013 | |
7d974ba3 DS |
1014 | void kernel_route_rib_pass_fail(struct route_node *rn, struct prefix *p, |
1015 | struct route_entry *re, | |
0c555cc6 DS |
1016 | enum southbound_results res) |
1017 | { | |
1018 | struct nexthop *nexthop; | |
1019 | char buf[PREFIX_STRLEN]; | |
ed216282 DS |
1020 | rib_dest_t *dest; |
1021 | ||
1022 | dest = rib_dest_from_rnode(rn); | |
0c555cc6 DS |
1023 | |
1024 | switch (res) { | |
1025 | case SOUTHBOUND_INSTALL_SUCCESS: | |
ed216282 | 1026 | dest->selected_fib = re; |
0c555cc6 DS |
1027 | for (ALL_NEXTHOPS(re->nexthop, nexthop)) { |
1028 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_RECURSIVE)) | |
1029 | continue; | |
1030 | ||
1031 | if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE)) | |
1032 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); | |
1033 | else | |
1034 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); | |
1035 | } | |
1036 | zsend_route_notify_owner(re->type, re->instance, re->vrf_id, | |
1037 | p, ZAPI_ROUTE_INSTALLED); | |
1038 | break; | |
1039 | case SOUTHBOUND_INSTALL_FAILURE: | |
ed216282 DS |
1040 | /* |
1041 | * I am not sure this is the right thing to do here | |
1042 | * but the code always set selected_fib before | |
1043 | * this assignment was moved here. | |
1044 | */ | |
1045 | dest->selected_fib = re; | |
1046 | ||
0c555cc6 DS |
1047 | zsend_route_notify_owner(re->type, re->instance, re->vrf_id, |
1048 | p, ZAPI_ROUTE_FAIL_INSTALL); | |
1049 | zlog_warn("%u:%s: Route install failed", re->vrf_id, | |
1050 | prefix2str(p, buf, sizeof(buf))); | |
1051 | break; | |
1052 | case SOUTHBOUND_DELETE_SUCCESS: | |
ed216282 DS |
1053 | /* |
1054 | * The case where selected_fib is not re is | |
1055 | * when we have received a system route | |
1056 | * that is overriding our installed route | |
1057 | * as such we should leave the selected_fib | |
1058 | * pointer alone | |
1059 | */ | |
1060 | if (dest->selected_fib == re) | |
1061 | dest->selected_fib = NULL; | |
0c555cc6 DS |
1062 | for (ALL_NEXTHOPS(re->nexthop, nexthop)) |
1063 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); | |
1064 | break; | |
1065 | case SOUTHBOUND_DELETE_FAILURE: | |
ed216282 DS |
1066 | /* |
1067 | * Should we set this to NULL if the | |
1068 | * delete fails? | |
1069 | */ | |
1070 | dest->selected_fib = NULL; | |
0c555cc6 DS |
1071 | zlog_warn("%u:%s: Route Deletion failure", re->vrf_id, |
1072 | prefix2str(p, buf, sizeof(buf))); | |
1073 | break; | |
1074 | } | |
1075 | } | |
1076 | ||
6ae24471 DS |
1077 | /* Update flag indicates whether this is a "replace" or not. Currently, this |
1078 | * is only used for IPv4. | |
1079 | */ | |
0c555cc6 DS |
1080 | void rib_install_kernel(struct route_node *rn, struct route_entry *re, |
1081 | struct route_entry *old) | |
718e3744 | 1082 | { |
d62a17ae | 1083 | struct nexthop *nexthop; |
1084 | rib_table_info_t *info = srcdest_rnode_table_info(rn); | |
1085 | struct prefix *p, *src_p; | |
1086 | struct zebra_vrf *zvrf = vrf_info_lookup(re->vrf_id); | |
718e3744 | 1087 | |
d62a17ae | 1088 | srcdest_rnode_prefixes(rn, &p, &src_p); |
416ec78d | 1089 | |
d62a17ae | 1090 | if (info->safi != SAFI_UNICAST) { |
1091 | for (ALL_NEXTHOPS(re->nexthop, nexthop)) | |
1092 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); | |
0c555cc6 | 1093 | return; |
25b9cb0c DL |
1094 | } else { |
1095 | struct nexthop *prev; | |
1096 | ||
1097 | for (ALL_NEXTHOPS(re->nexthop, nexthop)) { | |
1098 | UNSET_FLAG (nexthop->flags, NEXTHOP_FLAG_DUPLICATE); | |
1099 | for (ALL_NEXTHOPS(re->nexthop, prev)) { | |
1100 | if (prev == nexthop) | |
1101 | break; | |
1102 | if (nexthop_same_firsthop (nexthop, prev)) | |
1103 | { | |
1104 | SET_FLAG (nexthop->flags, NEXTHOP_FLAG_DUPLICATE); | |
1105 | break; | |
1106 | } | |
1107 | } | |
1108 | } | |
d62a17ae | 1109 | } |
718e3744 | 1110 | |
2063a814 DS |
1111 | /* |
1112 | * If this is a replace to a new RE let the originator of the RE | |
1113 | * know that they've lost | |
1114 | */ | |
1115 | if (old && old != re) | |
019a82cb DS |
1116 | zsend_route_notify_owner(old->type, old->instance, |
1117 | old->vrf_id, p, | |
1118 | ZAPI_ROUTE_BETTER_ADMIN_WON); | |
25b9cb0c | 1119 | |
d62a17ae | 1120 | /* |
1121 | * Make sure we update the FPM any time we send new information to | |
1122 | * the kernel. | |
1123 | */ | |
1124 | hook_call(rib_update, rn, "installing in kernel"); | |
7d974ba3 | 1125 | kernel_route_rib(rn, p, src_p, old, re); |
d62a17ae | 1126 | zvrf->installs++; |
1127 | ||
0c555cc6 | 1128 | return; |
718e3744 | 1129 | } |
1130 | ||
1131 | /* Uninstall the route from kernel. */ | |
0c555cc6 | 1132 | void rib_uninstall_kernel(struct route_node *rn, struct route_entry *re) |
718e3744 | 1133 | { |
d62a17ae | 1134 | struct nexthop *nexthop; |
1135 | rib_table_info_t *info = srcdest_rnode_table_info(rn); | |
1136 | struct prefix *p, *src_p; | |
1137 | struct zebra_vrf *zvrf = vrf_info_lookup(re->vrf_id); | |
05737783 | 1138 | |
d62a17ae | 1139 | srcdest_rnode_prefixes(rn, &p, &src_p); |
718e3744 | 1140 | |
d62a17ae | 1141 | if (info->safi != SAFI_UNICAST) { |
1142 | for (ALL_NEXTHOPS(re->nexthop, nexthop)) | |
d6792f9d | 1143 | UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); |
0c555cc6 | 1144 | return; |
d62a17ae | 1145 | } |
416ec78d | 1146 | |
d62a17ae | 1147 | /* |
1148 | * Make sure we update the FPM any time we send new information to | |
1149 | * the kernel. | |
1150 | */ | |
1151 | hook_call(rib_update, rn, "uninstalling from kernel"); | |
7d974ba3 | 1152 | kernel_route_rib(rn, p, src_p, re, NULL); |
d62a17ae | 1153 | zvrf->removals++; |
718e3744 | 1154 | |
0c555cc6 | 1155 | return; |
718e3744 | 1156 | } |
1157 | ||
1158 | /* Uninstall the route from kernel. */ | |
d62a17ae | 1159 | static void rib_uninstall(struct route_node *rn, struct route_entry *re) |
718e3744 | 1160 | { |
d62a17ae | 1161 | rib_table_info_t *info = srcdest_rnode_table_info(rn); |
5f7a4718 | 1162 | rib_dest_t *dest = rib_dest_from_rnode(rn); |
416ec78d | 1163 | |
5f7a4718 | 1164 | if (dest && dest->selected_fib == re) { |
d62a17ae | 1165 | if (info->safi == SAFI_UNICAST) |
1166 | hook_call(rib_update, rn, "rib_uninstall"); | |
5adc2528 | 1167 | |
d62a17ae | 1168 | if (!RIB_SYSTEM_ROUTE(re)) |
1169 | rib_uninstall_kernel(rn, re); | |
a64448ba | 1170 | |
d62a17ae | 1171 | /* If labeled-unicast route, uninstall transit LSP. */ |
1172 | if (zebra_rib_labeled_unicast(re)) | |
1173 | zebra_mpls_lsp_uninstall(info->zvrf, rn, re); | |
d62a17ae | 1174 | } |
446bb95e | 1175 | |
d62a17ae | 1176 | if (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED)) { |
1177 | struct prefix *p, *src_p; | |
1178 | srcdest_rnode_prefixes(rn, &p, &src_p); | |
05737783 | 1179 | |
d62a17ae | 1180 | redistribute_delete(p, src_p, re); |
1181 | UNSET_FLAG(re->flags, ZEBRA_FLAG_SELECTED); | |
1182 | } | |
718e3744 | 1183 | } |
1184 | ||
9fd92e3c AS |
1185 | /* |
1186 | * rib_can_delete_dest | |
1187 | * | |
1188 | * Returns TRUE if the given dest can be deleted from the table. | |
1189 | */ | |
d62a17ae | 1190 | static int rib_can_delete_dest(rib_dest_t *dest) |
9fd92e3c | 1191 | { |
d62a17ae | 1192 | if (dest->routes) { |
1193 | return 0; | |
1194 | } | |
9fd92e3c | 1195 | |
d62a17ae | 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; | |
5adc2528 | 1203 | |
d62a17ae | 1204 | return 1; |
9fd92e3c AS |
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 | */ | |
d62a17ae | 1215 | int rib_gc_dest(struct route_node *rn) |
9fd92e3c | 1216 | { |
d62a17ae | 1217 | rib_dest_t *dest; |
9fd92e3c | 1218 | |
d62a17ae | 1219 | dest = rib_dest_from_rnode(rn); |
1220 | if (!dest) | |
1221 | return 0; | |
9fd92e3c | 1222 | |
d62a17ae | 1223 | if (!rib_can_delete_dest(dest)) |
1224 | return 0; | |
9fd92e3c | 1225 | |
c9abf558 DS |
1226 | if (IS_ZEBRA_DEBUG_RIB) { |
1227 | struct zebra_vrf *zvrf; | |
1228 | ||
1229 | zvrf = rib_dest_vrf(dest); | |
d62a17ae | 1230 | rnode_debug(rn, zvrf_id(zvrf), "removing dest from table"); |
c9abf558 | 1231 | } |
9fd92e3c | 1232 | |
d62a17ae | 1233 | dest->rnode = NULL; |
1234 | XFREE(MTYPE_RIB_DEST, dest); | |
1235 | rn->info = NULL; | |
9fd92e3c | 1236 | |
d62a17ae | 1237 | /* |
1238 | * Release the one reference that we keep on the route node. | |
1239 | */ | |
1240 | route_unlock_node(rn); | |
1241 | return 1; | |
9fd92e3c AS |
1242 | } |
1243 | ||
d62a17ae | 1244 | static void rib_process_add_fib(struct zebra_vrf *zvrf, struct route_node *rn, |
1245 | struct route_entry *new) | |
3e5c6e00 | 1246 | { |
5f7a4718 DS |
1247 | rib_dest_t *dest = rib_dest_from_rnode(rn); |
1248 | ||
d62a17ae | 1249 | hook_call(rib_update, rn, "new route selected"); |
3e5c6e00 | 1250 | |
d62a17ae | 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 | } | |
3e5c6e00 | 1257 | |
d62a17ae | 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 | } | |
3e5c6e00 | 1264 | |
d62a17ae | 1265 | /* If labeled-unicast route, install transit LSP. */ |
1266 | if (zebra_rib_labeled_unicast(new)) | |
1267 | zebra_mpls_lsp_install(zvrf, rn, new); | |
a64448ba | 1268 | |
0c555cc6 DS |
1269 | if (!RIB_SYSTEM_ROUTE(new)) |
1270 | rib_install_kernel(rn, new, NULL); | |
ed216282 DS |
1271 | else |
1272 | dest->selected_fib = new; | |
3e5c6e00 | 1273 | |
d62a17ae | 1274 | UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED); |
3e5c6e00 | 1275 | } |
1276 | ||
d62a17ae | 1277 | static void rib_process_del_fib(struct zebra_vrf *zvrf, struct route_node *rn, |
1278 | struct route_entry *old) | |
3e5c6e00 | 1279 | { |
5f7a4718 | 1280 | rib_dest_t *dest = rib_dest_from_rnode(rn); |
d62a17ae | 1281 | hook_call(rib_update, rn, "removing existing route"); |
3e5c6e00 | 1282 | |
d62a17ae | 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 | } | |
3e5c6e00 | 1290 | |
d62a17ae | 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); | |
ed216282 DS |
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 | } | |
d62a17ae | 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; | |
5f7a4718 | 1321 | rib_dest_t *dest = rib_dest_from_rnode(rn); |
d62a17ae | 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 | ||
0c555cc6 | 1369 | rib_install_kernel(rn, new, old); |
ed216282 DS |
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; | |
d62a17ae | 1383 | } |
d62a17ae | 1384 | /* If install succeeded or system route, cleanup flags |
1385 | * for prior route. */ | |
ed216282 | 1386 | if (new != old) { |
d62a17ae | 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 | } | |
d62a17ae | 1397 | } |
a64448ba | 1398 | |
d62a17ae | 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 | */ | |
ed216282 | 1404 | if (!nh_active) { |
d62a17ae | 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); | |
ed216282 DS |
1431 | else |
1432 | dest->selected_fib = NULL; | |
d62a17ae | 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)) { | |
ed216282 | 1445 | bool in_fib = false; |
d62a17ae | 1446 | |
1447 | for (ALL_NEXTHOPS(new->nexthop, nexthop)) | |
1448 | if (CHECK_FLAG(nexthop->flags, | |
1449 | NEXTHOP_FLAG_FIB)) { | |
ed216282 | 1450 | in_fib = true; |
d62a17ae | 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) { | |
d62a17ae | 1460 | /* Set real nexthop. */ |
1461 | nexthop_active_update(rn, old, 1); | |
1462 | UNSET_FLAG(old->status, ROUTE_ENTRY_CHANGED); | |
1463 | } | |
3e5c6e00 | 1464 | |
d62a17ae | 1465 | /* Clear changed flag. */ |
1466 | UNSET_FLAG(new->status, ROUTE_ENTRY_CHANGED); | |
3e5c6e00 | 1467 | } |
1468 | ||
d62a17ae | 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 | } | |
3e5c6e00 | 1493 | |
d62a17ae | 1494 | if (current->type == ZEBRA_ROUTE_CONNECT) |
1495 | return current; | |
3e5c6e00 | 1496 | |
d62a17ae | 1497 | /* higher distance loses */ |
1498 | if (alternate->distance < current->distance) | |
1499 | return alternate; | |
1500 | if (current->distance < alternate->distance) | |
1501 | return current; | |
3e5c6e00 | 1502 | |
d62a17ae | 1503 | /* metric tie-breaks equal distance */ |
1504 | if (alternate->metric <= current->metric) | |
1505 | return alternate; | |
3e5c6e00 | 1506 | |
d62a17ae | 1507 | return current; |
3e5c6e00 | 1508 | } |
1509 | ||
d62a17ae | 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 | } | |
bab85d4f | 1534 | |
d62a17ae | 1535 | if (IS_ZEBRA_DEBUG_RIB) |
1536 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
bab85d4f | 1537 | |
d62a17ae | 1538 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) |
1539 | zlog_debug("%u:%s: Processing rn %p", vrf_id, buf, rn); | |
bab85d4f | 1540 | |
607425e5 DS |
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; | |
5f7a4718 | 1549 | |
a2addae8 | 1550 | RNODE_FOREACH_RE_SAFE (rn, re, next) { |
d62a17ae | 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 | } | |
bab85d4f | 1565 | |
d62a17ae | 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 | } | |
bab85d4f | 1618 | |
d62a17ae | 1619 | /* Infinite distance. */ |
1620 | if (re->distance == DISTANCE_INFINITY) { | |
1621 | UNSET_FLAG(re->status, ROUTE_ENTRY_CHANGED); | |
1622 | continue; | |
1623 | } | |
bab85d4f | 1624 | |
d62a17ae | 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 | } | |
446bb95e | 1663 | |
d62a17ae | 1664 | /* Buffer ROUTE_ENTRY_CHANGED here, because it will get cleared if |
1665 | * fib == selected */ | |
9d303b37 DL |
1666 | bool selected_changed = new_selected && CHECK_FLAG(new_selected->status, |
1667 | ROUTE_ENTRY_CHANGED); | |
d62a17ae | 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; | |
93bdadae | 1690 | |
d62a17ae | 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 | } | |
41ec9222 | 1695 | |
d62a17ae | 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); | |
f857321e | 1702 | } |
446bb95e | 1703 | |
d62a17ae | 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 | } | |
3e5c6e00 | 1712 | |
d62a17ae | 1713 | /* Remove all RE entries queued for removal */ |
a2addae8 | 1714 | RNODE_FOREACH_RE_SAFE (rn, re, next) { |
d62a17ae | 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 | } | |
4d38fdb4 | 1723 | |
d62a17ae | 1724 | /* |
1725 | * Check if the dest can be deleted now. | |
1726 | */ | |
1727 | rib_gc_dest(rn); | |
e96f9203 DO |
1728 | } |
1729 | ||
5110a0c6 | 1730 | /* Take a list of route_node structs and return 1, if there was a record |
d62a17ae | 1731 | * picked from it and processed by rib_process(). Don't process more, |
5110a0c6 | 1732 | * than one RN record; operate only in the specified sub-queue. |
e96f9203 | 1733 | */ |
d62a17ae | 1734 | static unsigned int process_subq(struct list *subq, u_char qindex) |
e96f9203 | 1735 | { |
d62a17ae | 1736 | struct listnode *lnode = listhead(subq); |
1737 | struct route_node *rnode; | |
1738 | rib_dest_t *dest; | |
1739 | struct zebra_vrf *zvrf = NULL; | |
5110a0c6 | 1740 | |
d62a17ae | 1741 | if (!lnode) |
1742 | return 0; | |
5110a0c6 | 1743 | |
d62a17ae | 1744 | rnode = listgetdata(lnode); |
1745 | dest = rib_dest_from_rnode(rnode); | |
1746 | if (dest) | |
1747 | zvrf = rib_dest_vrf(dest); | |
41ec9222 | 1748 | |
d62a17ae | 1749 | rib_process(rnode); |
5110a0c6 | 1750 | |
d62a17ae | 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 | } | |
41ec9222 | 1757 | |
d62a17ae | 1758 | if (rnode->info) |
1759 | UNSET_FLAG(rib_dest_from_rnode(rnode)->flags, | |
1760 | RIB_ROUTE_QUEUED(qindex)); | |
9fd92e3c | 1761 | |
67b9467f | 1762 | #if 0 |
5110a0c6 SH |
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 | } | |
67b9467f | 1769 | #endif |
d62a17ae | 1770 | route_unlock_node(rnode); |
1771 | list_delete_node(subq, lnode); | |
1772 | return 1; | |
e96f9203 DO |
1773 | } |
1774 | ||
fb018d25 DS |
1775 | /* |
1776 | * All meta queues have been processed. Trigger next-hop evaluation. | |
1777 | */ | |
d62a17ae | 1778 | static void meta_queue_process_complete(struct work_queue *dummy) |
fb018d25 | 1779 | { |
d62a17ae | 1780 | struct vrf *vrf; |
1781 | struct zebra_vrf *zvrf; | |
9ec6b0bb | 1782 | |
d62a17ae | 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 | */ | |
a2addae8 | 1788 | RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) { |
d62a17ae | 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 | } | |
939fba27 | 1803 | |
d62a17ae | 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 | } | |
fb018d25 DS |
1814 | } |
1815 | ||
e96f9203 | 1816 | /* Dispatch the meta queue by picking, processing and unlocking the next RN from |
d62a17ae | 1817 | * a non-empty sub-queue with lowest priority. wq is equal to zebra->ribq and |
1818 | * data | |
e96f9203 DO |
1819 | * is pointed to the meta queue structure. |
1820 | */ | |
d62a17ae | 1821 | static wq_item_status meta_queue_process(struct work_queue *dummy, void *data) |
e96f9203 | 1822 | { |
d62a17ae | 1823 | struct meta_queue *mq = data; |
1824 | unsigned i; | |
5110a0c6 | 1825 | |
d62a17ae | 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; | |
e96f9203 DO |
1832 | } |
1833 | ||
9fd92e3c AS |
1834 | /* |
1835 | * Map from rib types to queue type (priority) in meta queue | |
1836 | */ | |
5110a0c6 | 1837 | static const u_char meta_queue_map[ZEBRA_ROUTE_MAX] = { |
9d303b37 DL |
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 | |
5110a0c6 SH |
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. | |
e96f9203 | 1866 | */ |
d62a17ae | 1867 | static void rib_meta_queue_add(struct meta_queue *mq, struct route_node *rn) |
e96f9203 | 1868 | { |
d62a17ae | 1869 | struct route_entry *re; |
5110a0c6 | 1870 | |
a2addae8 | 1871 | RNODE_FOREACH_RE (rn, re) { |
d62a17ae | 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 | } | |
5110a0c6 | 1885 | |
d62a17ae | 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++; | |
5110a0c6 | 1891 | |
d62a17ae | 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); | |
9ec6b0bb | 1896 | |
d62a17ae | 1897 | zvrf = zebra_vrf_lookup_by_id(re->vrf_id); |
1898 | if (zvrf) | |
1899 | zvrf->flags |= ZEBRA_VRF_RIB_SCHEDULED; | |
1900 | } | |
4d38fdb4 | 1901 | } |
1902 | ||
6d691129 | 1903 | /* Add route_node to work queue and schedule processing */ |
d62a17ae | 1904 | void rib_queue_add(struct route_node *rn) |
4d38fdb4 | 1905 | { |
d62a17ae | 1906 | assert(rn); |
fc328ac9 | 1907 | |
d62a17ae | 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 | } | |
4d38fdb4 | 1916 | |
d62a17ae | 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 | */ | |
f104f6c1 | 1930 | if (work_queue_empty(zebrad.ribq)) |
d62a17ae | 1931 | work_queue_add(zebrad.ribq, zebrad.mq); |
e96f9203 | 1932 | |
d62a17ae | 1933 | rib_meta_queue_add(zebrad.mq, rn); |
fc328ac9 | 1934 | |
d62a17ae | 1935 | return; |
4d38fdb4 | 1936 | } |
1937 | ||
5110a0c6 SH |
1938 | /* Create new meta queue. |
1939 | A destructor function doesn't seem to be necessary here. | |
1940 | */ | |
d62a17ae | 1941 | static struct meta_queue *meta_queue_new(void) |
e96f9203 | 1942 | { |
d62a17ae | 1943 | struct meta_queue *new; |
1944 | unsigned i; | |
5110a0c6 | 1945 | |
d62a17ae | 1946 | new = XCALLOC(MTYPE_WORK_QUEUE, sizeof(struct meta_queue)); |
1947 | assert(new); | |
e96f9203 | 1948 | |
d62a17ae | 1949 | for (i = 0; i < MQ_SIZE; i++) { |
1950 | new->subq[i] = list_new(); | |
1951 | assert(new->subq[i]); | |
1952 | } | |
5110a0c6 | 1953 | |
d62a17ae | 1954 | return new; |
e96f9203 DO |
1955 | } |
1956 | ||
d62a17ae | 1957 | void meta_queue_free(struct meta_queue *mq) |
5a8dfcd8 | 1958 | { |
d62a17ae | 1959 | unsigned i; |
5a8dfcd8 | 1960 | |
d62a17ae | 1961 | for (i = 0; i < MQ_SIZE; i++) |
affe9e99 | 1962 | list_delete_and_null(&mq->subq[i]); |
5a8dfcd8 | 1963 | |
d62a17ae | 1964 | XFREE(MTYPE_WORK_QUEUE, mq); |
5a8dfcd8 RW |
1965 | } |
1966 | ||
4d38fdb4 | 1967 | /* initialise zebra rib work queue */ |
d62a17ae | 1968 | static void rib_queue_init(struct zebra_t *zebra) |
4d38fdb4 | 1969 | { |
d62a17ae | 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 | } | |
4d38fdb4 | 1977 | |
d62a17ae | 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; | |
3a30f50f | 1984 | zebra->ribq->spec.hold = ZEBRA_RIB_PROCESS_HOLD_TIME; |
d62a17ae | 1985 | |
1986 | if (!(zebra->mq = meta_queue_new())) { | |
1987 | zlog_err("%s: could not initialise meta queue!", __func__); | |
1988 | return; | |
1989 | } | |
1990 | return; | |
718e3744 | 1991 | } |
1992 | ||
6d691129 PJ |
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 | * | |
f0f77c9a DS |
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) | |
3c0755dc | 2000 | * and then submit route_node to queue for best-path selection later. |
f0f77c9a | 2001 | * Order of add/delete state changes are preserved for any given RE. |
6d691129 | 2002 | * |
f0f77c9a | 2003 | * Deleted REs are reaped during best-path selection. |
6d691129 PJ |
2004 | * |
2005 | * rib_addnode | |
f0f77c9a DS |
2006 | * |-> rib_link or unset ROUTE_ENTRY_REMOVE |->Update kernel with |
2007 | * |-------->| | best RE, if required | |
3c0755dc PJ |
2008 | * | | |
2009 | * static_install->|->rib_addqueue...... -> rib_process | |
2010 | * | | | |
2011 | * |-------->| |-> rib_unlink | |
f0f77c9a DS |
2012 | * |-> set ROUTE_ENTRY_REMOVE | |
2013 | * rib_delnode (RE freed) | |
6d691129 | 2014 | * |
9fd92e3c AS |
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()). | |
d62a17ae | 2019 | * |
6d691129 PJ |
2020 | * Refcounting (aka "locking" throughout the GNU Zebra and Quagga code): |
2021 | * | |
2022 | * - route_nodes: refcounted by: | |
9fd92e3c AS |
2023 | * - dest attached to route_node: |
2024 | * - managed by: rib_link/rib_gc_dest | |
6d691129 PJ |
2025 | * - route_node processing queue |
2026 | * - managed by: rib_addqueue, rib_process. | |
2027 | * | |
2028 | */ | |
d62a17ae | 2029 | |
f0f77c9a | 2030 | /* Add RE to head of the route node. */ |
d62a17ae | 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; | |
9fd92e3c | 2037 | |
d62a17ae | 2038 | assert(re && rn); |
9fd92e3c | 2039 | |
d62a17ae | 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); | |
7a4bb9c5 | 2044 | |
d62a17ae | 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 | } | |
2263a412 | 2050 | |
d62a17ae | 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); | |
6d691129 PJ |
2082 | } |
2083 | ||
9fd92e3c AS |
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 | */ | |
d62a17ae | 2093 | void rib_unlink(struct route_node *rn, struct route_entry *re) |
6d691129 | 2094 | { |
d62a17ae | 2095 | rib_dest_t *dest; |
9fd92e3c | 2096 | |
d62a17ae | 2097 | assert(rn && re); |
6d691129 | 2098 | |
d62a17ae | 2099 | if (IS_ZEBRA_DEBUG_RIB) |
2100 | rnode_debug(rn, re->vrf_id, "rn %p, re %p", (void *)rn, | |
2101 | (void *)re); | |
6d691129 | 2102 | |
d62a17ae | 2103 | dest = rib_dest_from_rnode(rn); |
6d691129 | 2104 | |
d62a17ae | 2105 | if (re->next) |
2106 | re->next->prev = re->prev; | |
6d691129 | 2107 | |
d62a17ae | 2108 | if (re->prev) |
2109 | re->prev->next = re->next; | |
2110 | else { | |
2111 | dest->routes = re->next; | |
2112 | } | |
7a4bb9c5 | 2113 | |
2eb07de3 DS |
2114 | if (dest->selected_fib == re) |
2115 | dest->selected_fib = NULL; | |
2116 | ||
d62a17ae | 2117 | /* free RE and nexthops */ |
2118 | zebra_deregister_rnh_static_nexthops(re->vrf_id, re->nexthop, rn); | |
2119 | nexthops_free(re->nexthop); | |
2120 | XFREE(MTYPE_RE, re); | |
2121 | } | |
2122 | ||
2123 | void rib_delnode(struct route_node *rn, struct route_entry *re) | |
2124 | { | |
2125 | afi_t afi; | |
2126 | ||
2127 | if (IS_ZEBRA_DEBUG_RIB) | |
2128 | rnode_debug(rn, re->vrf_id, "rn %p, re %p, removing", | |
2129 | (void *)rn, (void *)re); | |
2130 | SET_FLAG(re->status, ROUTE_ENTRY_REMOVED); | |
2131 | ||
2132 | afi = (rn->p.family == AF_INET) | |
2133 | ? AFI_IP | |
2134 | : (rn->p.family == AF_INET6) ? AFI_IP6 : AFI_MAX; | |
2135 | if (is_zebra_import_table_enabled(afi, re->table)) { | |
2136 | zebra_del_import_table_entry(rn, re); | |
2137 | /* Just clean up if non main table */ | |
2138 | if (IS_ZEBRA_DEBUG_RIB) { | |
2139 | char buf[SRCDEST2STR_BUFFER]; | |
2140 | srcdest_rnode2str(rn, buf, sizeof(buf)); | |
2141 | zlog_debug( | |
2142 | "%u:%s: Freeing route rn %p, re %p (type %d)", | |
2143 | re->vrf_id, buf, rn, re, re->type); | |
2144 | } | |
7a4bb9c5 | 2145 | |
d62a17ae | 2146 | rib_unlink(rn, re); |
2147 | } else { | |
2148 | rib_queue_add(rn); | |
2149 | } | |
718e3744 | 2150 | } |
2151 | ||
f0f77c9a | 2152 | /* This function dumps the contents of a given RE entry into |
dc95824a DO |
2153 | * standard debug log. Calling function name and IP prefix in |
2154 | * question are passed as 1st and 2nd arguments. | |
2155 | */ | |
2156 | ||
d62a17ae | 2157 | void _route_entry_dump(const char *func, union prefixconstptr pp, |
2158 | union prefixconstptr src_pp, | |
2159 | const struct route_entry *re) | |
2160 | { | |
2161 | const struct prefix *p = pp.p; | |
2162 | const struct prefix *src_p = src_pp.p; | |
2163 | bool is_srcdst = src_p && src_p->prefixlen; | |
2164 | char straddr[PREFIX_STRLEN]; | |
2165 | char srcaddr[PREFIX_STRLEN]; | |
2166 | struct nexthop *nexthop; | |
2167 | ||
2168 | zlog_debug("%s: dumping RE entry %p for %s%s%s vrf %u", func, | |
2169 | (const void *)re, prefix2str(pp, straddr, sizeof(straddr)), | |
2170 | is_srcdst ? " from " : "", | |
2171 | is_srcdst ? prefix2str(src_pp, srcaddr, sizeof(srcaddr)) | |
2172 | : "", | |
2173 | re->vrf_id); | |
cc54cfee RW |
2174 | zlog_debug("%s: uptime == %lu, type == %u, instance == %d, table == %d", |
2175 | func, (unsigned long)re->uptime, re->type, re->instance, | |
2176 | re->table); | |
d62a17ae | 2177 | zlog_debug( |
2178 | "%s: metric == %u, mtu == %u, distance == %u, flags == %u, status == %u", | |
2179 | func, re->metric, re->mtu, re->distance, re->flags, re->status); | |
2180 | zlog_debug("%s: nexthop_num == %u, nexthop_active_num == %u", func, | |
2181 | re->nexthop_num, re->nexthop_active_num); | |
2182 | ||
2183 | for (ALL_NEXTHOPS(re->nexthop, nexthop)) { | |
2184 | inet_ntop(p->family, &nexthop->gate, straddr, INET6_ADDRSTRLEN); | |
915902cb | 2185 | zlog_debug("%s: %s %s[%u] with flags %s%s%s", func, |
d62a17ae | 2186 | (nexthop->rparent ? " NH" : "NH"), straddr, |
915902cb | 2187 | nexthop->ifindex, |
d62a17ae | 2188 | (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE) |
2189 | ? "ACTIVE " | |
2190 | : ""), | |
2191 | (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB) | |
2192 | ? "FIB " | |
2193 | : ""), | |
2194 | (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_RECURSIVE) | |
2195 | ? "RECURSIVE" | |
2196 | : "")); | |
2197 | } | |
2198 | zlog_debug("%s: dump complete", func); | |
dc95824a DO |
2199 | } |
2200 | ||
2201 | /* This is an exported helper to rtm_read() to dump the strange | |
f0f77c9a | 2202 | * RE entry found by rib_lookup_ipv4_route() |
dc95824a DO |
2203 | */ |
2204 | ||
d62a17ae | 2205 | void rib_lookup_and_dump(struct prefix_ipv4 *p, vrf_id_t vrf_id) |
2206 | { | |
2207 | struct route_table *table; | |
2208 | struct route_node *rn; | |
2209 | struct route_entry *re; | |
2210 | char prefix_buf[INET_ADDRSTRLEN]; | |
2211 | ||
2212 | /* Lookup table. */ | |
2213 | table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id); | |
2214 | if (!table) { | |
2215 | zlog_err("%s: zebra_vrf_table() returned NULL", __func__); | |
2216 | return; | |
2217 | } | |
2218 | ||
2219 | /* Scan the RIB table for exactly matching RE entry. */ | |
2220 | rn = route_node_lookup(table, (struct prefix *)p); | |
2221 | ||
2222 | /* No route for this prefix. */ | |
2223 | if (!rn) { | |
2224 | zlog_debug("%s: lookup failed for %s", __func__, | |
2225 | prefix2str((struct prefix *)p, prefix_buf, | |
2226 | sizeof(prefix_buf))); | |
2227 | return; | |
2228 | } | |
2229 | ||
2230 | /* Unlock node. */ | |
2231 | route_unlock_node(rn); | |
2232 | ||
2233 | /* let's go */ | |
a2addae8 | 2234 | RNODE_FOREACH_RE (rn, re) { |
d62a17ae | 2235 | zlog_debug("%s: rn %p, re %p: %s, %s", __func__, (void *)rn, |
2236 | (void *)re, | |
2237 | (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED) | |
2238 | ? "removed" | |
2239 | : "NOT removed"), | |
2240 | (CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED) | |
2241 | ? "selected" | |
2242 | : "NOT selected")); | |
2243 | route_entry_dump(p, NULL, re); | |
2244 | } | |
dc95824a DO |
2245 | } |
2246 | ||
20e5ff0a DO |
2247 | /* Check if requested address assignment will fail due to another |
2248 | * route being installed by zebra in FIB already. Take necessary | |
2249 | * actions, if needed: remove such a route from FIB and deSELECT | |
f0f77c9a | 2250 | * corresponding RE entry. Then put affected RN into RIBQ head. |
20e5ff0a | 2251 | */ |
d62a17ae | 2252 | void rib_lookup_and_pushup(struct prefix_ipv4 *p, vrf_id_t vrf_id) |
2253 | { | |
2254 | struct route_table *table; | |
2255 | struct route_node *rn; | |
d62a17ae | 2256 | unsigned changed = 0; |
5f7a4718 | 2257 | rib_dest_t *dest; |
d62a17ae | 2258 | |
2259 | if (NULL == (table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id))) { | |
2260 | zlog_err("%s: zebra_vrf_table() returned NULL", __func__); | |
2261 | return; | |
2262 | } | |
2263 | ||
2264 | /* No matches would be the simplest case. */ | |
2265 | if (NULL == (rn = route_node_lookup(table, (struct prefix *)p))) | |
2266 | return; | |
2267 | ||
2268 | /* Unlock node. */ | |
2269 | route_unlock_node(rn); | |
2270 | ||
5f7a4718 | 2271 | dest = rib_dest_from_rnode(rn); |
d62a17ae | 2272 | /* Check all RE entries. In case any changes have to be done, requeue |
2273 | * the RN into RIBQ head. If the routing message about the new connected | |
2274 | * route (generated by the IP address we are going to assign very soon) | |
2275 | * comes before the RIBQ is processed, the new RE entry will join | |
2276 | * RIBQ record already on head. This is necessary for proper | |
2277 | * revalidation | |
2278 | * of the rest of the RE. | |
2279 | */ | |
5f7a4718 DS |
2280 | if (dest->selected_fib && !RIB_SYSTEM_ROUTE(dest->selected_fib)) { |
2281 | changed = 1; | |
2282 | if (IS_ZEBRA_DEBUG_RIB) { | |
2283 | char buf[PREFIX_STRLEN]; | |
2284 | ||
2285 | zlog_debug("%u:%s: freeing way for connected prefix", | |
2286 | dest->selected_fib->vrf_id, | |
2287 | prefix2str(&rn->p, buf, sizeof(buf))); | |
2288 | route_entry_dump(&rn->p, NULL, dest->selected_fib); | |
d62a17ae | 2289 | } |
5f7a4718 | 2290 | rib_uninstall(rn, dest->selected_fib); |
d62a17ae | 2291 | } |
2292 | if (changed) | |
2293 | rib_queue_add(rn); | |
20e5ff0a DO |
2294 | } |
2295 | ||
d62a17ae | 2296 | int rib_add_multipath(afi_t afi, safi_t safi, struct prefix *p, |
2297 | struct prefix_ipv6 *src_p, struct route_entry *re) | |
718e3744 | 2298 | { |
d62a17ae | 2299 | struct route_table *table; |
2300 | struct route_node *rn; | |
2301 | struct route_entry *same; | |
2302 | struct nexthop *nexthop; | |
2303 | int ret = 0; | |
b4c034b0 | 2304 | |
d62a17ae | 2305 | if (!re) |
2306 | return 0; | |
b4c034b0 | 2307 | |
7990990e | 2308 | assert(!src_p || afi == AFI_IP6); |
05737783 | 2309 | |
d62a17ae | 2310 | /* Lookup table. */ |
7865c65d RW |
2311 | table = zebra_vrf_table_with_table_id(afi, safi, re->vrf_id, re->table); |
2312 | if (!table) { | |
2313 | XFREE(MTYPE_RE, re); | |
d62a17ae | 2314 | return 0; |
7865c65d | 2315 | } |
cddf391b | 2316 | |
d62a17ae | 2317 | /* Make it sure prefixlen is applied to the prefix. */ |
2318 | apply_mask(p); | |
2319 | if (src_p) | |
2320 | apply_mask_ipv6(src_p); | |
718e3744 | 2321 | |
d62a17ae | 2322 | /* Set default distance by route type. */ |
2323 | if (re->distance == 0) { | |
0492eea0 | 2324 | re->distance = route_distance(re->type); |
718e3744 | 2325 | |
d62a17ae | 2326 | /* iBGP distance is 200. */ |
2327 | if (re->type == ZEBRA_ROUTE_BGP | |
2328 | && CHECK_FLAG(re->flags, ZEBRA_FLAG_IBGP)) | |
2329 | re->distance = 200; | |
2330 | } | |
718e3744 | 2331 | |
d62a17ae | 2332 | /* Lookup route node.*/ |
2333 | rn = srcdest_rnode_get(table, p, src_p); | |
718e3744 | 2334 | |
d62a17ae | 2335 | /* If same type of route are installed, treat it as a implicit |
2336 | withdraw. */ | |
a2addae8 | 2337 | RNODE_FOREACH_RE (rn, same) { |
d62a17ae | 2338 | if (CHECK_FLAG(same->status, ROUTE_ENTRY_REMOVED)) |
2339 | continue; | |
41ec9222 | 2340 | |
eb327fa5 RW |
2341 | if (same->type != re->type) |
2342 | continue; | |
2343 | if (same->instance != re->instance) | |
2344 | continue; | |
2345 | if (same->type == ZEBRA_ROUTE_KERNEL && | |
2346 | same->metric != re->metric) | |
2347 | continue; | |
844b3a87 RW |
2348 | /* |
2349 | * We should allow duplicate connected routes because of | |
2350 | * IPv6 link-local routes and unnumbered interfaces on Linux. | |
2351 | */ | |
2352 | if (same->type != ZEBRA_ROUTE_CONNECT) | |
d62a17ae | 2353 | break; |
2354 | } | |
718e3744 | 2355 | |
d62a17ae | 2356 | /* If this route is kernel route, set FIB flag to the route. */ |
8628fc61 | 2357 | if (RIB_SYSTEM_ROUTE(re)) |
d62a17ae | 2358 | for (nexthop = re->nexthop; nexthop; nexthop = nexthop->next) |
2359 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); | |
718e3744 | 2360 | |
d62a17ae | 2361 | /* Link new re to node.*/ |
2362 | if (IS_ZEBRA_DEBUG_RIB) { | |
2363 | rnode_debug( | |
2364 | rn, re->vrf_id, | |
2365 | "Inserting route rn %p, re %p (type %d) existing %p", | |
2366 | (void *)rn, (void *)re, re->type, (void *)same); | |
718e3744 | 2367 | |
d62a17ae | 2368 | if (IS_ZEBRA_DEBUG_RIB_DETAILED) |
2369 | route_entry_dump(p, src_p, re); | |
718e3744 | 2370 | } |
d62a17ae | 2371 | rib_addnode(rn, re, 1); |
2372 | ret = 1; | |
6b0655a2 | 2373 | |
d62a17ae | 2374 | /* Free implicit route.*/ |
2375 | if (same) { | |
2376 | rib_delnode(rn, same); | |
2377 | ret = -1; | |
2378 | } | |
718e3744 | 2379 | |
d62a17ae | 2380 | route_unlock_node(rn); |
2381 | return ret; | |
2382 | } | |
2383 | ||
2384 | void rib_delete(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type, | |
2385 | u_short instance, int flags, struct prefix *p, | |
fd36be7e | 2386 | struct prefix_ipv6 *src_p, const struct nexthop *nh, |
6134fd82 | 2387 | u_int32_t table_id, u_int32_t metric, bool fromkernel, |
2388 | struct ethaddr *rmac) | |
d62a17ae | 2389 | { |
2390 | struct route_table *table; | |
2391 | struct route_node *rn; | |
2392 | struct route_entry *re; | |
2393 | struct route_entry *fib = NULL; | |
2394 | struct route_entry *same = NULL; | |
fd36be7e | 2395 | struct nexthop *rtnh; |
d62a17ae | 2396 | char buf2[INET6_ADDRSTRLEN]; |
5f7a4718 | 2397 | rib_dest_t *dest; |
d62a17ae | 2398 | |
2399 | assert(!src_p || afi == AFI_IP6); | |
2400 | ||
2401 | /* Lookup table. */ | |
2402 | table = zebra_vrf_table_with_table_id(afi, safi, vrf_id, table_id); | |
2403 | if (!table) | |
2404 | return; | |
2405 | ||
2406 | /* Apply mask. */ | |
2407 | apply_mask(p); | |
2408 | if (src_p) | |
2409 | apply_mask_ipv6(src_p); | |
2410 | ||
2411 | /* Lookup route node. */ | |
2412 | rn = srcdest_rnode_lookup(table, p, src_p); | |
2413 | if (!rn) { | |
2414 | char dst_buf[PREFIX_STRLEN], src_buf[PREFIX_STRLEN]; | |
2415 | ||
2416 | prefix2str(p, dst_buf, sizeof(dst_buf)); | |
2417 | if (src_p && src_p->prefixlen) | |
2418 | prefix2str(src_p, src_buf, sizeof(src_buf)); | |
2419 | else | |
2420 | src_buf[0] = '\0'; | |
2421 | ||
2422 | if (IS_ZEBRA_DEBUG_RIB) | |
2423 | zlog_debug("%u:%s%s%s doesn't exist in rib", vrf_id, | |
2424 | dst_buf, | |
2425 | (src_buf[0] != '\0') ? " from " : "", | |
2426 | src_buf); | |
2427 | return; | |
2428 | } | |
718e3744 | 2429 | |
5f7a4718 DS |
2430 | dest = rib_dest_from_rnode(rn); |
2431 | fib = dest->selected_fib; | |
2432 | ||
d62a17ae | 2433 | /* Lookup same type route. */ |
a2addae8 | 2434 | RNODE_FOREACH_RE (rn, re) { |
d62a17ae | 2435 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) |
2436 | continue; | |
2437 | ||
d62a17ae | 2438 | if (re->type != type) |
2439 | continue; | |
2440 | if (re->instance != instance) | |
2441 | continue; | |
f19435a8 DS |
2442 | if (re->type == ZEBRA_ROUTE_KERNEL && |
2443 | re->metric != metric) | |
2444 | continue; | |
fd36be7e DL |
2445 | if (re->type == ZEBRA_ROUTE_CONNECT && (rtnh = re->nexthop) |
2446 | && rtnh->type == NEXTHOP_TYPE_IFINDEX && nh) { | |
2447 | if (rtnh->ifindex != nh->ifindex) | |
d62a17ae | 2448 | continue; |
d62a17ae | 2449 | same = re; |
2450 | break; | |
2451 | } | |
2452 | /* Make sure that the route found has the same gateway. */ | |
2453 | else { | |
fd36be7e | 2454 | if (nh == NULL) { |
d62a17ae | 2455 | same = re; |
2456 | break; | |
2457 | } | |
fd36be7e DL |
2458 | for (ALL_NEXTHOPS(re->nexthop, rtnh)) |
2459 | if (nexthop_same_no_recurse(rtnh, nh)) { | |
d62a17ae | 2460 | same = re; |
2461 | break; | |
2462 | } | |
2463 | if (same) | |
2464 | break; | |
2465 | } | |
2466 | } | |
2467 | /* If same type of route can't be found and this message is from | |
2468 | kernel. */ | |
2469 | if (!same) { | |
5dfeba19 DS |
2470 | /* |
2471 | * In the past(HA!) we could get here because | |
2472 | * we were receiving a route delete from the | |
2473 | * kernel and we're not marking the proto | |
2474 | * as coming from it's appropriate originator. | |
2475 | * Now that we are properly noticing the fact | |
2476 | * that the kernel has deleted our route we | |
2477 | * are not going to get called in this path | |
2478 | * I am going to leave this here because | |
2479 | * this might still work this way on non-linux | |
2480 | * platforms as well as some weird state I have | |
2481 | * not properly thought of yet. | |
2482 | * If we can show that this code path is | |
2483 | * dead then we can remove it. | |
2484 | */ | |
d62a17ae | 2485 | if (fib && type == ZEBRA_ROUTE_KERNEL |
2486 | && CHECK_FLAG(flags, ZEBRA_FLAG_SELFROUTE)) { | |
2487 | if (IS_ZEBRA_DEBUG_RIB) { | |
2488 | rnode_debug( | |
2489 | rn, vrf_id, | |
2490 | "rn %p, re %p (type %d) was deleted from kernel, adding", | |
2491 | rn, fib, fib->type); | |
2492 | } | |
2493 | if (allow_delete) { | |
2494 | /* Unset flags. */ | |
fd36be7e DL |
2495 | for (rtnh = fib->nexthop; rtnh; |
2496 | rtnh = rtnh->next) | |
2497 | UNSET_FLAG(rtnh->flags, | |
d62a17ae | 2498 | NEXTHOP_FLAG_FIB); |
2499 | ||
ed216282 DS |
2500 | /* |
2501 | * This is a non FRR route | |
2502 | * as such we should mark | |
2503 | * it as deleted | |
2504 | */ | |
5f7a4718 | 2505 | dest->selected_fib = NULL; |
d62a17ae | 2506 | } else { |
2507 | /* This means someone else, other than Zebra, | |
2508 | * has deleted | |
2509 | * a Zebra router from the kernel. We will add | |
2510 | * it back */ | |
2511 | rib_install_kernel(rn, fib, NULL); | |
2512 | } | |
2513 | } else { | |
2514 | if (IS_ZEBRA_DEBUG_RIB) { | |
fd36be7e | 2515 | if (nh) |
d62a17ae | 2516 | rnode_debug( |
2517 | rn, vrf_id, | |
2518 | "via %s ifindex %d type %d " | |
2519 | "doesn't exist in rib", | |
2520 | inet_ntop( | |
60466a63 QY |
2521 | family2afi(afi), |
2522 | &nh->gate, buf2, | |
d62a17ae | 2523 | INET_ADDRSTRLEN), /* FIXME |
9d303b37 | 2524 | */ |
fd36be7e | 2525 | nh->ifindex, type); |
d62a17ae | 2526 | else |
2527 | rnode_debug( | |
2528 | rn, vrf_id, | |
fd36be7e DL |
2529 | "type %d doesn't exist in rib", |
2530 | type); | |
d62a17ae | 2531 | } |
2532 | route_unlock_node(rn); | |
2533 | return; | |
2534 | } | |
2535 | } | |
718e3744 | 2536 | |
5dfeba19 DS |
2537 | if (same) { |
2538 | if (fromkernel && | |
2539 | 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 | } | |
6134fd82 | 2546 | |
90264d64 | 2547 | if (CHECK_FLAG(flags, ZEBRA_FLAG_EVPN_ROUTE)) { |
6134fd82 | 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 | } | |
d62a17ae | 2562 | rib_delnode(rn, same); |
5dfeba19 | 2563 | } |
05737783 | 2564 | |
d62a17ae | 2565 | route_unlock_node(rn); |
2566 | return; | |
2567 | } | |
718e3744 | 2568 | |
718e3744 | 2569 | |
4a7371e9 DS |
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, | |
4e40b6d6 | 2573 | u_int32_t mtu, uint8_t distance, route_tag_t tag) |
d62a17ae | 2574 | { |
2575 | struct route_entry *re; | |
66af6845 | 2576 | struct nexthop *nexthop; |
718e3744 | 2577 | |
66af6845 | 2578 | /* Allocate new route_entry structure. */ |
d62a17ae | 2579 | re = XCALLOC(MTYPE_RE, sizeof(struct route_entry)); |
d62a17ae | 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); | |
4e40b6d6 | 2590 | re->tag = tag; |
d62a17ae | 2591 | |
66af6845 RW |
2592 | /* Add nexthop. */ |
2593 | nexthop = nexthop_new(); | |
2594 | *nexthop = *nh; | |
2595 | route_entry_nexthop_add(re, nexthop); | |
718e3744 | 2596 | |
66af6845 | 2597 | return rib_add_multipath(afi, safi, p, src_p, re); |
718e3744 | 2598 | } |
2599 | ||
1c848137 | 2600 | /* Schedule routes of a particular table (address-family) based on event. */ |
d62a17ae | 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)) { | |
1ca60f2c DS |
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 | |
2617 | && CHECK_FLAG(rib_dest_from_rnode(rn)->flags, | |
2618 | RIB_ROUTE_ANY_QUEUED)) | |
2619 | continue; | |
d62a17ae | 2620 | switch (event) { |
2621 | case RIB_UPDATE_IF_CHANGE: | |
2622 | /* Examine all routes that won't get processed by the | |
2623 | * protocol or | |
2624 | * triggered by nexthop evaluation (NHT). This would be | |
2625 | * system, | |
2626 | * kernel and certain static routes. Note that NHT will | |
2627 | * get | |
2628 | * triggered upon an interface event as connected routes | |
2629 | * always | |
2630 | * get queued for processing. | |
2631 | */ | |
a2addae8 | 2632 | RNODE_FOREACH_RE_SAFE (rn, re, next) { |
0a16efff DS |
2633 | struct nexthop *nh; |
2634 | ||
2635 | if (re->type != ZEBRA_ROUTE_SYSTEM && | |
2636 | re->type != ZEBRA_ROUTE_KERNEL && | |
2637 | re->type != ZEBRA_ROUTE_CONNECT && | |
2638 | re->type != ZEBRA_ROUTE_STATIC) | |
2639 | continue; | |
2640 | ||
2641 | if (re->type != ZEBRA_ROUTE_STATIC) { | |
2642 | rib_queue_add(rn); | |
2643 | continue; | |
2644 | } | |
2645 | ||
2646 | for (nh = re->nexthop; nh; nh = nh->next) | |
2647 | if (!(nh->type == NEXTHOP_TYPE_IPV4 | |
2648 | || nh->type == NEXTHOP_TYPE_IPV6)) | |
2649 | break; | |
2650 | ||
2651 | /* If we only have nexthops to a | |
2652 | * gateway, NHT will | |
2653 | * take care. | |
2654 | */ | |
2655 | if (nh) | |
d62a17ae | 2656 | rib_queue_add(rn); |
2657 | } | |
2658 | break; | |
2659 | ||
2660 | case RIB_UPDATE_RMAP_CHANGE: | |
2661 | case RIB_UPDATE_OTHER: | |
2662 | /* Right now, examine all routes. Can restrict to a | |
2663 | * protocol in | |
2664 | * some cases (TODO). | |
2665 | */ | |
2666 | if (rnode_to_ribs(rn)) | |
2667 | rib_queue_add(rn); | |
2668 | break; | |
2669 | ||
2670 | default: | |
2671 | break; | |
2672 | } | |
2673 | } | |
b84c7253 | 2674 | } |
2675 | ||
718e3744 | 2676 | /* RIB update function. */ |
d62a17ae | 2677 | void rib_update(vrf_id_t vrf_id, rib_update_event_t event) |
718e3744 | 2678 | { |
d62a17ae | 2679 | struct route_table *table; |
1c848137 | 2680 | |
d62a17ae | 2681 | /* Process routes of interested address-families. */ |
2682 | table = zebra_vrf_table(AFI_IP, SAFI_UNICAST, vrf_id); | |
2683 | if (table) | |
2684 | rib_update_table(table, event); | |
718e3744 | 2685 | |
d62a17ae | 2686 | table = zebra_vrf_table(AFI_IP6, SAFI_UNICAST, vrf_id); |
2687 | if (table) | |
2688 | rib_update_table(table, event); | |
718e3744 | 2689 | } |
2690 | ||
718e3744 | 2691 | /* Remove all routes which comes from non main table. */ |
d62a17ae | 2692 | static void rib_weed_table(struct route_table *table) |
718e3744 | 2693 | { |
d62a17ae | 2694 | struct route_node *rn; |
2695 | struct route_entry *re; | |
2696 | struct route_entry *next; | |
718e3744 | 2697 | |
d62a17ae | 2698 | if (table) |
2699 | for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) | |
a2addae8 | 2700 | RNODE_FOREACH_RE_SAFE (rn, re, next) { |
d62a17ae | 2701 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) |
2702 | continue; | |
6d691129 | 2703 | |
d62a17ae | 2704 | if (re->table != zebrad.rtm_table_default |
2705 | && re->table != RT_TABLE_MAIN) | |
2706 | rib_delnode(rn, re); | |
2707 | } | |
718e3744 | 2708 | } |
2709 | ||
2710 | /* Delete all routes from non main table. */ | |
d62a17ae | 2711 | void rib_weed_tables(void) |
718e3744 | 2712 | { |
d62a17ae | 2713 | struct vrf *vrf; |
2714 | struct zebra_vrf *zvrf; | |
78104b9b | 2715 | |
a2addae8 RW |
2716 | RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) |
2717 | if ((zvrf = vrf->info) != NULL) { | |
2718 | rib_weed_table(zvrf->table[AFI_IP][SAFI_UNICAST]); | |
2719 | rib_weed_table(zvrf->table[AFI_IP6][SAFI_UNICAST]); | |
2720 | } | |
718e3744 | 2721 | } |
6b0655a2 | 2722 | |
718e3744 | 2723 | /* Delete self installed routes after zebra is relaunched. */ |
d62a17ae | 2724 | static void rib_sweep_table(struct route_table *table) |
2725 | { | |
2726 | struct route_node *rn; | |
2727 | struct route_entry *re; | |
2728 | struct route_entry *next; | |
915902cb | 2729 | struct nexthop *nexthop; |
d62a17ae | 2730 | |
915902cb DS |
2731 | if (!table) |
2732 | return; | |
d62a17ae | 2733 | |
915902cb | 2734 | for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) { |
a2addae8 | 2735 | RNODE_FOREACH_RE_SAFE (rn, re, next) { |
915902cb DS |
2736 | if (IS_ZEBRA_DEBUG_RIB) |
2737 | route_entry_dump(&rn->p, NULL, re); | |
2738 | ||
2739 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) | |
2740 | continue; | |
2741 | ||
2742 | if (!CHECK_FLAG(re->flags, ZEBRA_FLAG_SELFROUTE)) | |
2743 | continue; | |
2744 | ||
2745 | /* | |
2746 | * So we are starting up and have received | |
2747 | * routes from the kernel that we have installed | |
2748 | * from a previous run of zebra but not cleaned | |
2749 | * up ( say a kill -9 ) | |
2750 | * But since we haven't actually installed | |
2751 | * them yet( we received them from the kernel ) | |
2752 | * we don't think they are active. | |
2753 | * So let's pretend they are active to actually | |
2754 | * remove them. | |
2755 | * In all honesty I'm not sure if we should | |
2756 | * mark them as active when we receive them | |
2757 | * This is startup only so probably ok. | |
2758 | * | |
2759 | * If we ever decide to move rib_sweep_table | |
2760 | * to a different spot (ie startup ) | |
2761 | * this decision needs to be revisited | |
2762 | */ | |
2763 | for (ALL_NEXTHOPS(re->nexthop, nexthop)) | |
2764 | SET_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB); | |
2765 | ||
0c555cc6 DS |
2766 | rib_uninstall_kernel(rn, re); |
2767 | rib_delnode(rn, re); | |
915902cb DS |
2768 | } |
2769 | } | |
718e3744 | 2770 | } |
2771 | ||
2772 | /* Sweep all RIB tables. */ | |
d62a17ae | 2773 | void rib_sweep_route(void) |
718e3744 | 2774 | { |
d62a17ae | 2775 | struct vrf *vrf; |
2776 | struct zebra_vrf *zvrf; | |
78104b9b | 2777 | |
a2addae8 | 2778 | RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) { |
915902cb DS |
2779 | if ((zvrf = vrf->info) == NULL) |
2780 | continue; | |
2781 | ||
d62a17ae | 2782 | rib_sweep_table(zvrf->table[AFI_IP][SAFI_UNICAST]); |
2783 | rib_sweep_table(zvrf->table[AFI_IP6][SAFI_UNICAST]); | |
2784 | } | |
718e3744 | 2785 | } |
2ea1ab1c VT |
2786 | |
2787 | /* Remove specific by protocol routes from 'table'. */ | |
d62a17ae | 2788 | static unsigned long rib_score_proto_table(u_char proto, u_short instance, |
2789 | struct route_table *table) | |
2790 | { | |
2791 | struct route_node *rn; | |
2792 | struct route_entry *re; | |
2793 | struct route_entry *next; | |
2794 | unsigned long n = 0; | |
2795 | ||
2796 | if (table) | |
2797 | for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) | |
a2addae8 | 2798 | RNODE_FOREACH_RE_SAFE (rn, re, next) { |
d62a17ae | 2799 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)) |
2800 | continue; | |
2801 | if (re->type == proto | |
2802 | && re->instance == instance) { | |
2803 | rib_delnode(rn, re); | |
2804 | n++; | |
2805 | } | |
2806 | } | |
2807 | return n; | |
2ea1ab1c VT |
2808 | } |
2809 | ||
2810 | /* Remove specific by protocol routes. */ | |
d62a17ae | 2811 | unsigned long rib_score_proto(u_char proto, u_short instance) |
2ea1ab1c | 2812 | { |
d62a17ae | 2813 | struct vrf *vrf; |
2814 | struct zebra_vrf *zvrf; | |
2815 | unsigned long cnt = 0; | |
78104b9b | 2816 | |
a2addae8 RW |
2817 | RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) |
2818 | if ((zvrf = vrf->info) != NULL) | |
2819 | cnt += rib_score_proto_table( | |
2820 | proto, instance, | |
2821 | zvrf->table[AFI_IP][SAFI_UNICAST]) | |
2822 | + rib_score_proto_table( | |
2823 | proto, instance, | |
2824 | zvrf->table[AFI_IP6][SAFI_UNICAST]); | |
78104b9b | 2825 | |
d62a17ae | 2826 | return cnt; |
2ea1ab1c VT |
2827 | } |
2828 | ||
718e3744 | 2829 | /* Close RIB and clean up kernel routes. */ |
d62a17ae | 2830 | void rib_close_table(struct route_table *table) |
718e3744 | 2831 | { |
d62a17ae | 2832 | struct route_node *rn; |
1e9f448f | 2833 | rib_table_info_t *info; |
5f7a4718 | 2834 | rib_dest_t *dest; |
718e3744 | 2835 | |
1e9f448f DS |
2836 | if (!table) |
2837 | return; | |
9fd92e3c | 2838 | |
1e9f448f | 2839 | info = table->info; |
5adc2528 | 2840 | |
5f7a4718 DS |
2841 | for (rn = route_top(table); rn; rn = srcdest_route_next(rn)) { |
2842 | dest = rib_dest_from_rnode(rn); | |
1e9f448f | 2843 | |
5f7a4718 | 2844 | if (dest && dest->selected_fib) { |
1e9f448f DS |
2845 | if (info->safi == SAFI_UNICAST) |
2846 | hook_call(rib_update, rn, NULL); | |
2847 | ||
5f7a4718 DS |
2848 | if (!RIB_SYSTEM_ROUTE(dest->selected_fib)) |
2849 | rib_uninstall_kernel(rn, dest->selected_fib); | |
1e9f448f | 2850 | } |
5f7a4718 | 2851 | } |
718e3744 | 2852 | } |
2853 | ||
718e3744 | 2854 | /* Routing information base initialize. */ |
d62a17ae | 2855 | void rib_init(void) |
718e3744 | 2856 | { |
d62a17ae | 2857 | rib_queue_init(&zebrad); |
718e3744 | 2858 | } |
0915bb0c AS |
2859 | |
2860 | /* | |
2861 | * vrf_id_get_next | |
2862 | * | |
2863 | * Get the first vrf id that is greater than the given vrf id if any. | |
2864 | * | |
2865 | * Returns TRUE if a vrf id was found, FALSE otherwise. | |
2866 | */ | |
d62a17ae | 2867 | static inline int vrf_id_get_next(vrf_id_t vrf_id, vrf_id_t *next_id_p) |
0915bb0c | 2868 | { |
d62a17ae | 2869 | struct vrf *vrf; |
b72ede27 | 2870 | |
d62a17ae | 2871 | vrf = vrf_lookup_by_id(vrf_id); |
2872 | if (vrf) { | |
2873 | vrf = RB_NEXT(vrf_id_head, vrf); | |
2874 | if (vrf) { | |
2875 | *next_id_p = vrf->vrf_id; | |
2876 | return 1; | |
2877 | } | |
2878 | } | |
0915bb0c | 2879 | |
d62a17ae | 2880 | return 0; |
0915bb0c AS |
2881 | } |
2882 | ||
2883 | /* | |
2884 | * rib_tables_iter_next | |
2885 | * | |
2886 | * Returns the next table in the iteration. | |
2887 | */ | |
d62a17ae | 2888 | struct route_table *rib_tables_iter_next(rib_tables_iter_t *iter) |
2889 | { | |
2890 | struct route_table *table; | |
2891 | ||
2892 | /* | |
2893 | * Array that helps us go over all AFI/SAFI combinations via one | |
2894 | * index. | |
2895 | */ | |
2896 | static struct { | |
2897 | afi_t afi; | |
2898 | safi_t safi; | |
2899 | } afi_safis[] = { | |
2900 | {AFI_IP, SAFI_UNICAST}, {AFI_IP, SAFI_MULTICAST}, | |
2901 | {AFI_IP, SAFI_LABELED_UNICAST}, {AFI_IP6, SAFI_UNICAST}, | |
2902 | {AFI_IP6, SAFI_MULTICAST}, {AFI_IP6, SAFI_LABELED_UNICAST}, | |
2903 | }; | |
2904 | ||
2905 | table = NULL; | |
2906 | ||
2907 | switch (iter->state) { | |
2908 | ||
2909 | case RIB_TABLES_ITER_S_INIT: | |
2910 | iter->vrf_id = VRF_DEFAULT; | |
2911 | iter->afi_safi_ix = -1; | |
2912 | ||
2913 | /* Fall through */ | |
2914 | ||
2915 | case RIB_TABLES_ITER_S_ITERATING: | |
2916 | iter->afi_safi_ix++; | |
2917 | while (1) { | |
2918 | ||
2919 | while (iter->afi_safi_ix | |
2920 | < (int)ZEBRA_NUM_OF(afi_safis)) { | |
2921 | table = zebra_vrf_table( | |
2922 | afi_safis[iter->afi_safi_ix].afi, | |
2923 | afi_safis[iter->afi_safi_ix].safi, | |
2924 | iter->vrf_id); | |
2925 | if (table) | |
2926 | break; | |
2927 | ||
2928 | iter->afi_safi_ix++; | |
2929 | } | |
2930 | ||
2931 | /* | |
2932 | * Found another table in this vrf. | |
2933 | */ | |
2934 | if (table) | |
2935 | break; | |
2936 | ||
2937 | /* | |
2938 | * Done with all tables in the current vrf, go to the | |
2939 | * next | |
2940 | * one. | |
2941 | */ | |
2942 | if (!vrf_id_get_next(iter->vrf_id, &iter->vrf_id)) | |
2943 | break; | |
2944 | ||
2945 | iter->afi_safi_ix = 0; | |
2946 | } | |
0915bb0c | 2947 | |
0915bb0c AS |
2948 | break; |
2949 | ||
d62a17ae | 2950 | case RIB_TABLES_ITER_S_DONE: |
2951 | return NULL; | |
0915bb0c AS |
2952 | } |
2953 | ||
d62a17ae | 2954 | if (table) |
2955 | iter->state = RIB_TABLES_ITER_S_ITERATING; | |
2956 | else | |
2957 | iter->state = RIB_TABLES_ITER_S_DONE; | |
0915bb0c | 2958 | |
d62a17ae | 2959 | return table; |
0915bb0c | 2960 | } |