]> git.proxmox.com Git - mirror_frr.git/blame - zebra/zebra_rnh.c
lib: remove deprecated list_delete()/list_free()
[mirror_frr.git] / zebra / zebra_rnh.c
CommitLineData
fb018d25
DS
1/* Zebra next hop tracking code
2 * Copyright (C) 2013 Cumulus Networks, Inc.
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
fb018d25
DS
19 */
20
21#include <zebra.h>
22
23#include "prefix.h"
24#include "table.h"
25#include "memory.h"
fb018d25
DS
26#include "command.h"
27#include "if.h"
28#include "log.h"
29#include "sockunion.h"
30#include "linklist.h"
31#include "thread.h"
32#include "workqueue.h"
33#include "prefix.h"
34#include "routemap.h"
35#include "stream.h"
36#include "nexthop.h"
b72ede27 37#include "vrf.h"
fb018d25
DS
38
39#include "zebra/rib.h"
40#include "zebra/rt.h"
41#include "zebra/zserv.h"
fe18ee2d 42#include "zebra/zebra_ns.h"
7c551956 43#include "zebra/zebra_vrf.h"
fb018d25
DS
44#include "zebra/redistribute.h"
45#include "zebra/debug.h"
46#include "zebra/zebra_rnh.h"
8902474b 47#include "zebra/zebra_routemap.h"
a815b788 48#include "zebra/interface.h"
4a1ab8e4 49#include "zebra/zebra_memory.h"
43e52561 50#include "zebra/zebra_errors.h"
fb018d25 51
d62a17ae 52static void free_state(vrf_id_t vrf_id, struct route_entry *re,
53 struct route_node *rn);
f0f77c9a 54static void copy_state(struct rnh *rnh, struct route_entry *re,
078430f6 55 struct route_node *rn);
d62a17ae 56#define lookup_rnh_table(v, f) \
57 ({ \
58 struct zebra_vrf *zvrf; \
59 struct route_table *t = NULL; \
60 zvrf = zebra_vrf_lookup_by_id(v); \
61 if (zvrf) \
62 t = zvrf->rnh_table[family2afi(f)]; \
63 t; \
64 })
b72ede27 65
f0f77c9a 66static int compare_state(struct route_entry *r1, struct route_entry *r2);
7076bb2f 67static int send_client(struct rnh *rnh, struct zserv *client, rnh_type_t type,
d62a17ae 68 vrf_id_t vrf_id);
fb018d25 69static void print_rnh(struct route_node *rn, struct vty *vty);
453844ab 70static int zebra_client_cleanup_rnh(struct zserv *client);
fb018d25 71
a50b580a
DS
72int zebra_rnh_ip_default_route = 0;
73int zebra_rnh_ipv6_default_route = 0;
74
453844ab
QY
75void zebra_rnh_init(void)
76{
21ccc0cf 77 hook_register(zserv_client_close, zebra_client_cleanup_rnh);
453844ab
QY
78}
79
b72ede27 80static inline struct route_table *get_rnh_table(vrf_id_t vrfid, int family,
078430f6
DS
81 rnh_type_t type)
82{
d62a17ae 83 struct zebra_vrf *zvrf;
84 struct route_table *t = NULL;
85
86 zvrf = zebra_vrf_lookup_by_id(vrfid);
87 if (zvrf)
88 switch (type) {
89 case RNH_NEXTHOP_TYPE:
90 t = zvrf->rnh_table[family2afi(family)];
91 break;
92 case RNH_IMPORT_CHECK_TYPE:
93 t = zvrf->import_check_table[family2afi(family)];
94 break;
95 }
96
97 return t;
078430f6
DS
98}
99
d62a17ae 100char *rnh_str(struct rnh *rnh, char *buf, int size)
fb018d25 101{
d62a17ae 102 prefix2str(&(rnh->node->p), buf, size);
103 return buf;
fb018d25
DS
104}
105
1d30d1f4
DS
106struct rnh *zebra_add_rnh(struct prefix *p, vrf_id_t vrfid, rnh_type_t type,
107 bool *exists)
fb018d25 108{
d62a17ae 109 struct route_table *table;
110 struct route_node *rn;
111 struct rnh *rnh = NULL;
112 char buf[PREFIX2STR_BUFFER];
113
114 if (IS_ZEBRA_DEBUG_NHT) {
115 prefix2str(p, buf, sizeof(buf));
116 zlog_debug("%u: Add RNH %s type %d", vrfid, buf, type);
117 }
118 table = get_rnh_table(vrfid, PREFIX_FAMILY(p), type);
119 if (!table) {
120 prefix2str(p, buf, sizeof(buf));
e914ccbe 121 flog_warn(EC_ZEBRA_RNH_NO_TABLE,
9df414fe 122 "%u: Add RNH %s type %d - table not found", vrfid,
d62a17ae 123 buf, type);
1d30d1f4 124 exists = false;
d62a17ae 125 return NULL;
126 }
127
128 /* Make it sure prefixlen is applied to the prefix. */
129 apply_mask(p);
130
131 /* Lookup (or add) route node.*/
132 rn = route_node_get(table, p);
133
134 if (!rn->info) {
135 rnh = XCALLOC(MTYPE_RNH, sizeof(struct rnh));
136 rnh->client_list = list_new();
137 rnh->vrf_id = vrfid;
731a75fe 138 rnh->zebra_pseudowire_list = list_new();
d62a17ae 139 route_lock_node(rn);
140 rn->info = rnh;
141 rnh->node = rn;
1d30d1f4
DS
142 *exists = false;
143 } else
144 *exists = true;
d62a17ae 145
146 route_unlock_node(rn);
147 return (rn->info);
fb018d25
DS
148}
149
d62a17ae 150struct rnh *zebra_lookup_rnh(struct prefix *p, vrf_id_t vrfid, rnh_type_t type)
fb018d25 151{
d62a17ae 152 struct route_table *table;
153 struct route_node *rn;
fb018d25 154
d62a17ae 155 table = get_rnh_table(vrfid, PREFIX_FAMILY(p), type);
156 if (!table)
157 return NULL;
fb018d25 158
d62a17ae 159 /* Make it sure prefixlen is applied to the prefix. */
160 apply_mask(p);
fb018d25 161
d62a17ae 162 /* Lookup route node.*/
163 rn = route_node_lookup(table, p);
164 if (!rn)
165 return NULL;
fb018d25 166
d62a17ae 167 route_unlock_node(rn);
168 return (rn->info);
fb018d25
DS
169}
170
d62a17ae 171void zebra_free_rnh(struct rnh *rnh)
5a8dfcd8 172{
d62a17ae 173 rnh->flags |= ZEBRA_NHT_DELETED;
acdf5e25 174 list_delete_and_null(&rnh->client_list);
acdf5e25 175 list_delete_and_null(&rnh->zebra_pseudowire_list);
d62a17ae 176 free_state(rnh->vrf_id, rnh->state, rnh->node);
177 XFREE(MTYPE_RNH, rnh);
5a8dfcd8
RW
178}
179
d62a17ae 180void zebra_delete_rnh(struct rnh *rnh, rnh_type_t type)
fb018d25 181{
d62a17ae 182 struct route_node *rn;
fb018d25 183
d62a17ae 184 if (!rnh || (rnh->flags & ZEBRA_NHT_DELETED) || !(rn = rnh->node))
185 return;
fb018d25 186
d62a17ae 187 if (IS_ZEBRA_DEBUG_NHT) {
188 char buf[PREFIX2STR_BUFFER];
189 zlog_debug("%u: Del RNH %s type %d", rnh->vrf_id,
190 rnh_str(rnh, buf, sizeof(buf)), type);
191 }
fb018d25 192
d62a17ae 193 zebra_free_rnh(rnh);
194 rn->info = NULL;
195 route_unlock_node(rn);
fb018d25
DS
196}
197
1d30d1f4
DS
198/*
199 * This code will send to the registering client
200 * the looked up rnh.
201 * For a rnh that was created, there is no data
202 * so it will send an empty nexthop group
203 * If rnh exists then we know it has been evaluated
204 * and as such it will have a resolved rnh.
205 */
d62a17ae 206void zebra_add_rnh_client(struct rnh *rnh, struct zserv *client,
207 rnh_type_t type, vrf_id_t vrf_id)
fb018d25 208{
d62a17ae 209 if (IS_ZEBRA_DEBUG_NHT) {
210 char buf[PREFIX2STR_BUFFER];
211 zlog_debug("%u: Client %s registers for RNH %s type %d", vrf_id,
212 zebra_route_string(client->proto),
213 rnh_str(rnh, buf, sizeof(buf)), type);
214 }
215 if (!listnode_lookup(rnh->client_list, client)) {
216 listnode_add(rnh->client_list, client);
1d30d1f4 217 send_client(rnh, client, type, vrf_id);
d62a17ae 218 }
fb018d25
DS
219}
220
d62a17ae 221void zebra_remove_rnh_client(struct rnh *rnh, struct zserv *client,
222 rnh_type_t type)
fb018d25 223{
d62a17ae 224 if (IS_ZEBRA_DEBUG_NHT) {
225 char buf[PREFIX2STR_BUFFER];
226 zlog_debug("Client %s unregisters for RNH %s type %d",
227 zebra_route_string(client->proto),
228 rnh_str(rnh, buf, sizeof(buf)), type);
229 }
230 listnode_delete(rnh->client_list, client);
231 if (list_isempty(rnh->client_list)
731a75fe 232 && list_isempty(rnh->zebra_pseudowire_list))
d62a17ae 233 zebra_delete_rnh(rnh, type);
6e26278c
DS
234}
235
731a75fe
RW
236/* XXX move this utility function elsewhere? */
237static void addr2hostprefix(int af, const union g_addr *addr,
238 struct prefix *prefix)
239{
240 switch (af) {
241 case AF_INET:
242 prefix->family = AF_INET;
243 prefix->prefixlen = IPV4_MAX_BITLEN;
244 prefix->u.prefix4 = addr->ipv4;
245 break;
246 case AF_INET6:
247 prefix->family = AF_INET6;
248 prefix->prefixlen = IPV6_MAX_BITLEN;
249 prefix->u.prefix6 = addr->ipv6;
250 break;
251 default:
c31a793b 252 memset(prefix, 0, sizeof(*prefix));
9df414fe 253 zlog_debug("%s: unknown address family %d", __func__, af);
731a75fe
RW
254 break;
255 }
256}
257
258void zebra_register_rnh_pseudowire(vrf_id_t vrf_id, struct zebra_pw *pw)
259{
260 struct prefix nh;
261 struct rnh *rnh;
1d30d1f4 262 bool exists;
731a75fe
RW
263
264 addr2hostprefix(pw->af, &pw->nexthop, &nh);
1d30d1f4 265 rnh = zebra_add_rnh(&nh, vrf_id, RNH_NEXTHOP_TYPE, &exists);
731a75fe
RW
266 if (rnh && !listnode_lookup(rnh->zebra_pseudowire_list, pw)) {
267 listnode_add(rnh->zebra_pseudowire_list, pw);
268 pw->rnh = rnh;
269 zebra_evaluate_rnh(vrf_id, pw->af, 1, RNH_NEXTHOP_TYPE, &nh);
270 }
271}
272
273void zebra_deregister_rnh_pseudowire(vrf_id_t vrf_id, struct zebra_pw *pw)
274{
275 struct rnh *rnh;
276
277 rnh = pw->rnh;
278 if (!rnh)
279 return;
280
281 listnode_delete(rnh->zebra_pseudowire_list, pw);
282 pw->rnh = NULL;
283
284 if (list_isempty(rnh->client_list)
731a75fe
RW
285 && list_isempty(rnh->zebra_pseudowire_list))
286 zebra_delete_rnh(rnh, RNH_NEXTHOP_TYPE);
287}
288
d50b5bdd 289/* Apply the NHT route-map for a client to the route (and nexthops)
290 * resolving a NH.
291 */
d62a17ae 292static int zebra_rnh_apply_nht_rmap(int family, struct route_node *prn,
293 struct route_entry *re, int proto)
6e26278c 294{
d62a17ae 295 int at_least_one = 0;
296 int rmap_family; /* Route map has diff AF family enum */
297 struct nexthop *nexthop;
298 int ret;
299
300 rmap_family = (family == AF_INET) ? AFI_IP : AFI_IP6;
301
302 if (prn && re) {
7ee30f28
DS
303 for (nexthop = re->ng.nexthop; nexthop;
304 nexthop = nexthop->next) {
d62a17ae 305 ret = zebra_nht_route_map_check(rmap_family, proto,
306 &prn->p, re, nexthop);
307 if (ret != RMAP_DENYMATCH) {
308 SET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
309 at_least_one++; /* at least one valid NH */
310 } else {
311 UNSET_FLAG(nexthop->flags, NEXTHOP_FLAG_ACTIVE);
312 }
313 }
6e26278c 314 }
d62a17ae 315 return (at_least_one);
6e26278c
DS
316}
317
d50b5bdd 318/*
fd7fd9e5
DS
319 * Determine appropriate route (RE entry) resolving a tracked BGP route
320 * for BGP route for import.
d50b5bdd 321 */
996c9314
LB
322static struct route_entry *
323zebra_rnh_resolve_import_entry(vrf_id_t vrfid, int family,
324 struct route_node *nrn, struct rnh *rnh,
325 struct route_node **prn)
fb018d25 326{
d62a17ae 327 struct route_table *route_table;
328 struct route_node *rn;
329 struct route_entry *re;
330
331 *prn = NULL;
332
333 route_table = zebra_vrf_table(family2afi(family), SAFI_UNICAST, vrfid);
334 if (!route_table) // unexpected
335 return NULL;
336
337 rn = route_node_match(route_table, &nrn->p);
338 if (!rn)
339 return NULL;
340
fd7fd9e5
DS
341 /* Unlock route node - we don't need to lock when walking the tree. */
342 route_unlock_node(rn);
343
996c9314
LB
344 if (CHECK_FLAG(rnh->flags, ZEBRA_NHT_EXACT_MATCH)
345 && !prefix_same(&nrn->p, &rn->p))
fd7fd9e5 346 return NULL;
d62a17ae 347
fd7fd9e5 348 /* Identify appropriate route entry. */
996c9314
LB
349 RNODE_FOREACH_RE (rn, re) {
350 if (!CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED)
351 && CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED)
352 && (re->type != ZEBRA_ROUTE_BGP))
fd7fd9e5 353 break;
d62a17ae 354 }
355
d62a17ae 356 if (re)
357 *prn = rn;
358 return re;
d50b5bdd 359}
360
361/*
362 * See if a tracked route entry for import (by BGP) has undergone any
363 * change, and if so, notify the client.
364 */
d62a17ae 365static void zebra_rnh_eval_import_check_entry(vrf_id_t vrfid, int family,
366 int force, struct route_node *nrn,
367 struct rnh *rnh,
368 struct route_entry *re)
d50b5bdd 369{
d62a17ae 370 int state_changed = 0;
371 struct zserv *client;
372 char bufn[INET6_ADDRSTRLEN];
373 struct listnode *node;
374 struct nexthop *nexthop;
375
376 if (re && (rnh->state == NULL)) {
7ee30f28 377 for (ALL_NEXTHOPS(re->ng, nexthop))
d62a17ae 378 if (CHECK_FLAG(nexthop->flags, NEXTHOP_FLAG_FIB)) {
379 state_changed = 1;
380 break;
381 }
382 } else if (!re && (rnh->state != NULL))
383 state_changed = 1;
384
385 if (compare_state(re, rnh->state))
386 copy_state(rnh, re, nrn);
387
388 if (state_changed || force) {
389 if (IS_ZEBRA_DEBUG_NHT) {
390 prefix2str(&nrn->p, bufn, INET6_ADDRSTRLEN);
391 zlog_debug("%u:%s: Route import check %s %s\n", vrfid,
392 bufn, rnh->state ? "passed" : "failed",
393 state_changed ? "(state changed)" : "");
394 }
395 /* state changed, notify clients */
396 for (ALL_LIST_ELEMENTS_RO(rnh->client_list, node, client)) {
397 send_client(rnh, client, RNH_IMPORT_CHECK_TYPE, vrfid);
398 }
399 }
d50b5bdd 400}
fb018d25 401
d50b5bdd 402/*
403 * Notify clients registered for this nexthop about a change.
404 */
d62a17ae 405static void zebra_rnh_notify_protocol_clients(vrf_id_t vrfid, int family,
406 struct route_node *nrn,
407 struct rnh *rnh,
408 struct route_node *prn,
409 struct route_entry *re)
d50b5bdd 410{
d62a17ae 411 struct listnode *node;
412 struct zserv *client;
413 char bufn[INET6_ADDRSTRLEN];
414 char bufp[INET6_ADDRSTRLEN];
415 int num_resolving_nh;
416
417 if (IS_ZEBRA_DEBUG_NHT) {
418 prefix2str(&nrn->p, bufn, INET6_ADDRSTRLEN);
419 if (prn && re) {
420 prefix2str(&prn->p, bufp, INET6_ADDRSTRLEN);
421 zlog_debug("%u:%s: NH resolved over route %s", vrfid,
422 bufn, bufp);
423 } else
424 zlog_debug("%u:%s: NH has become unresolved", vrfid,
425 bufn);
426 }
427
428 for (ALL_LIST_ELEMENTS_RO(rnh->client_list, node, client)) {
429 if (prn && re) {
430 /* Apply route-map for this client to route resolving
431 * this
432 * nexthop to see if it is filtered or not.
433 */
434 num_resolving_nh = zebra_rnh_apply_nht_rmap(
435 family, prn, re, client->proto);
436 if (num_resolving_nh)
437 rnh->filtered[client->proto] = 0;
438 else
439 rnh->filtered[client->proto] = 1;
440
441 if (IS_ZEBRA_DEBUG_NHT)
442 zlog_debug(
443 "%u:%s: Notifying client %s about NH %s",
444 vrfid, bufn,
445 zebra_route_string(client->proto),
446 num_resolving_nh
447 ? ""
448 : "(filtered by route-map)");
449 } else {
450 rnh->filtered[client->proto] = 0;
451 if (IS_ZEBRA_DEBUG_NHT)
452 zlog_debug(
453 "%u:%s: Notifying client %s about NH (unreachable)",
454 vrfid, bufn,
455 zebra_route_string(client->proto));
456 }
457
458 send_client(rnh, client, RNH_NEXTHOP_TYPE, vrfid);
459 }
d50b5bdd 460}
078430f6 461
d61d5d88
DS
462static void zebra_rnh_process_pbr_tables(int family,
463 struct route_node *nrn,
464 struct rnh *rnh,
465 struct route_node *prn,
466 struct route_entry *re)
467{
468 struct zebra_ns_table *znst;
469 struct route_entry *o_re;
470 struct route_node *o_rn;
471 struct listnode *node;
472 struct zserv *client;
473 struct zebra_ns *zns;
474 afi_t afi = AFI_IP;
475
476 if (family == AF_INET6)
477 afi = AFI_IP6;
478
479 /*
480 * We are only concerned about nexthops that change for
481 * anyone using PBR
482 */
483 for (ALL_LIST_ELEMENTS_RO(rnh->client_list, node, client)) {
484 if (client->proto == ZEBRA_ROUTE_PBR)
485 break;
486 }
487
488 if (!client)
489 return;
490
491 zns = zebra_ns_lookup(NS_DEFAULT);
492 RB_FOREACH (znst, zebra_ns_table_head, &zns->ns_tables) {
493 if (afi != znst->afi)
494 continue;
495
496 for (o_rn = route_top(znst->table);
497 o_rn; o_rn = srcdest_route_next(o_rn)) {
498 RNODE_FOREACH_RE (o_rn, o_re) {
499 if (o_re->type == ZEBRA_ROUTE_PBR)
500 break;
501
502 }
503
504 /*
505 * If we have a PBR route and a nexthop changes
506 * just rethink it. Yes this is a hammer, but
507 * a small one
508 */
4d96fd9f
DS
509 if (o_re) {
510 SET_FLAG(o_re->status, ROUTE_ENTRY_CHANGED);
d61d5d88 511 rib_queue_add(o_rn);
4d96fd9f 512 }
d61d5d88
DS
513 }
514 }
515}
516
fd7fd9e5
DS
517/*
518 * Determine appropriate route (route entry) resolving a tracked
519 * nexthop.
520 */
996c9314
LB
521static struct route_entry *
522zebra_rnh_resolve_nexthop_entry(vrf_id_t vrfid, int family,
523 struct route_node *nrn, struct rnh *rnh,
524 struct route_node **prn)
fd7fd9e5
DS
525{
526 struct route_table *route_table;
527 struct route_node *rn;
528 struct route_entry *re;
529
530 *prn = NULL;
531
532 route_table = zebra_vrf_table(family2afi(family), SAFI_UNICAST, vrfid);
533 if (!route_table)
534 return NULL;
535
536 rn = route_node_match(route_table, &nrn->p);
537 if (!rn)
538 return NULL;
539
540 /* Unlock route node - we don't need to lock when walking the tree. */
541 route_unlock_node(rn);
542
543 /* While resolving nexthops, we may need to walk up the tree from the
544 * most-specific match. Do similar logic as in zebra_rib.c
545 */
546 while (rn) {
547 /* Do not resolve over default route unless allowed &&
548 * match route to be exact if so specified
549 */
996c9314
LB
550 if (is_default_prefix(&rn->p)
551 && !rnh_resolve_via_default(rn->p.family))
fd7fd9e5
DS
552 return NULL;
553
554 /* Identify appropriate route entry. */
996c9314 555 RNODE_FOREACH_RE (rn, re) {
fd7fd9e5
DS
556 if (CHECK_FLAG(re->status, ROUTE_ENTRY_REMOVED))
557 continue;
558 if (!CHECK_FLAG(re->flags, ZEBRA_FLAG_SELECTED))
559 continue;
560
561 if (CHECK_FLAG(rnh->flags, ZEBRA_NHT_CONNECTED)) {
562 if ((re->type == ZEBRA_ROUTE_CONNECT)
563 || (re->type == ZEBRA_ROUTE_STATIC))
564 break;
565 if (re->type == ZEBRA_ROUTE_NHRP) {
566 struct nexthop *nexthop;
567
7ee30f28 568 for (nexthop = re->ng.nexthop; nexthop;
fd7fd9e5
DS
569 nexthop = nexthop->next)
570 if (nexthop->type
996c9314 571 == NEXTHOP_TYPE_IFINDEX)
fd7fd9e5
DS
572 break;
573 if (nexthop)
574 break;
575 }
576 } else
577 break;
578 }
579
580 /* Route entry found, we're done; else, walk up the tree. */
581 if (re) {
582 *prn = rn;
583 return re;
584 }
585
586 if (CHECK_FLAG(rnh->flags, ZEBRA_NHT_CONNECTED))
587 rn = rn->parent;
588 else
589 return NULL;
590 }
591
592 return NULL;
593}
594
731a75fe
RW
595static void zebra_rnh_process_pseudowires(vrf_id_t vrfid, struct rnh *rnh)
596{
597 struct zebra_pw *pw;
598 struct listnode *node;
599
600 for (ALL_LIST_ELEMENTS_RO(rnh->zebra_pseudowire_list, node, pw))
601 zebra_pw_update(pw);
602}
603
d50b5bdd 604/*
605 * See if a tracked nexthop entry has undergone any change, and if so,
606 * take appropriate action; this involves notifying any clients and/or
607 * scheduling dependent static routes for processing.
608 */
d62a17ae 609static void zebra_rnh_eval_nexthop_entry(vrf_id_t vrfid, int family, int force,
610 struct route_node *nrn,
611 struct rnh *rnh,
612 struct route_node *prn,
613 struct route_entry *re)
d50b5bdd 614{
d62a17ae 615 int state_changed = 0;
616
617 /* If we're resolving over a different route, resolution has changed or
618 * the resolving route has some change (e.g., metric), there is a state
619 * change.
620 */
621 if (!prefix_same(&rnh->resolved_route, &prn->p)) {
622 if (prn)
623 prefix_copy(&rnh->resolved_route, &prn->p);
624 else
625 memset(&rnh->resolved_route, 0, sizeof(struct prefix));
626
627 copy_state(rnh, re, nrn);
628 state_changed = 1;
629 } else if (compare_state(re, rnh->state)) {
630 copy_state(rnh, re, nrn);
631 state_changed = 1;
632 }
633
634 if (state_changed || force) {
635 /* NOTE: Use the "copy" of resolving route stored in 'rnh' i.e.,
636 * rnh->state.
637 */
638 /* Notify registered protocol clients. */
639 zebra_rnh_notify_protocol_clients(vrfid, family, nrn, rnh, prn,
640 rnh->state);
641
d61d5d88
DS
642 zebra_rnh_process_pbr_tables(family, nrn, rnh, prn,
643 rnh->state);
644
731a75fe
RW
645 /* Process pseudowires attached to this nexthop */
646 zebra_rnh_process_pseudowires(vrfid, rnh);
d62a17ae 647 }
d50b5bdd 648}
6e26278c 649
d50b5bdd 650/* Evaluate one tracked entry */
d62a17ae 651static void zebra_rnh_evaluate_entry(vrf_id_t vrfid, int family, int force,
652 rnh_type_t type, struct route_node *nrn)
d50b5bdd 653{
d62a17ae 654 struct rnh *rnh;
655 struct route_entry *re;
656 struct route_node *prn;
657 char bufn[INET6_ADDRSTRLEN];
658
659 if (IS_ZEBRA_DEBUG_NHT) {
660 prefix2str(&nrn->p, bufn, INET6_ADDRSTRLEN);
661 zlog_debug("%u:%s: Evaluate RNH, type %d %s", vrfid, bufn, type,
662 force ? "(force)" : "");
663 }
664
665 rnh = nrn->info;
666
667 /* Identify route entry (RE) resolving this tracked entry. */
fd7fd9e5 668 if (type == RNH_IMPORT_CHECK_TYPE)
996c9314
LB
669 re = zebra_rnh_resolve_import_entry(vrfid, family, nrn, rnh,
670 &prn);
fd7fd9e5
DS
671 else
672 re = zebra_rnh_resolve_nexthop_entry(vrfid, family, nrn, rnh,
673 &prn);
d62a17ae 674
675 /* If the entry cannot be resolved and that is also the existing state,
676 * there is nothing further to do.
677 */
678 if (!re && rnh->state == NULL && !force)
679 return;
680
681 /* Process based on type of entry. */
682 if (type == RNH_IMPORT_CHECK_TYPE)
683 zebra_rnh_eval_import_check_entry(vrfid, family, force, nrn,
684 rnh, re);
685 else
686 zebra_rnh_eval_nexthop_entry(vrfid, family, force, nrn, rnh,
687 prn, re);
d50b5bdd 688}
689
8ce5e6a3 690/*
f0f77c9a
DS
691 * Clear the ROUTE_ENTRY_NEXTHOPS_CHANGED flag
692 * from the re entries.
8ce5e6a3
DS
693 *
694 * Please note we are doing this *after* we have
695 * notified the world about each nexthop as that
f0f77c9a 696 * we can have a situation where one re entry
8ce5e6a3
DS
697 * covers multiple nexthops we are interested in.
698 */
d62a17ae 699static void zebra_rnh_clear_nhc_flag(vrf_id_t vrfid, int family,
700 rnh_type_t type, struct route_node *nrn)
8ce5e6a3 701{
d62a17ae 702 struct rnh *rnh;
703 struct route_entry *re;
704 struct route_node *prn;
8ce5e6a3 705
d62a17ae 706 rnh = nrn->info;
8ce5e6a3 707
fd7fd9e5
DS
708 /* Identify route entry (RIB) resolving this tracked entry. */
709 if (type == RNH_IMPORT_CHECK_TYPE)
996c9314
LB
710 re = zebra_rnh_resolve_import_entry(vrfid, family, nrn, rnh,
711 &prn);
fd7fd9e5
DS
712 else
713 re = zebra_rnh_resolve_nexthop_entry(vrfid, family, nrn, rnh,
714 &prn);
8ce5e6a3 715
332ad713 716 if (re) {
d62a17ae 717 UNSET_FLAG(re->status, ROUTE_ENTRY_NEXTHOPS_CHANGED);
332ad713
RW
718 UNSET_FLAG(re->status, ROUTE_ENTRY_LABELS_CHANGED);
719 }
8ce5e6a3 720}
d50b5bdd 721
722/* Evaluate all tracked entries (nexthops or routes for import into BGP)
723 * of a particular VRF and address-family or a specific prefix.
724 */
d62a17ae 725void zebra_evaluate_rnh(vrf_id_t vrfid, int family, int force, rnh_type_t type,
726 struct prefix *p)
d50b5bdd 727{
d62a17ae 728 struct route_table *rnh_table;
729 struct route_node *nrn;
730
731 rnh_table = get_rnh_table(vrfid, family, type);
732 if (!rnh_table) // unexpected
733 return;
734
735 if (p) {
736 /* Evaluating a specific entry, make sure it exists. */
737 nrn = route_node_lookup(rnh_table, p);
738 if (nrn && nrn->info)
739 zebra_rnh_evaluate_entry(vrfid, family, force, type,
740 nrn);
741
742 if (nrn)
743 route_unlock_node(nrn);
744 } else {
745 /* Evaluate entire table. */
746 nrn = route_top(rnh_table);
747 while (nrn) {
748 if (nrn->info)
749 zebra_rnh_evaluate_entry(vrfid, family, force,
750 type, nrn);
751 nrn = route_next(nrn); /* this will also unlock nrn */
752 }
753 nrn = route_top(rnh_table);
754 while (nrn) {
755 if (nrn->info)
756 zebra_rnh_clear_nhc_flag(vrfid, family, type,
757 nrn);
758 nrn = route_next(nrn); /* this will also unlock nrn */
759 }
760 }
fb018d25
DS
761}
762
d62a17ae 763void zebra_print_rnh_table(vrf_id_t vrfid, int af, struct vty *vty,
764 rnh_type_t type)
fb018d25 765{
d62a17ae 766 struct route_table *table;
767 struct route_node *rn;
768
769 table = get_rnh_table(vrfid, af, type);
770 if (!table) {
771 zlog_debug("print_rnhs: rnh table not found\n");
772 return;
773 }
774
775 for (rn = route_top(table); rn; rn = route_next(rn))
776 if (rn->info)
777 print_rnh(rn, vty);
fb018d25
DS
778}
779
fb018d25 780/**
f0f77c9a 781 * free_state - free up the re structure associated with the rnh.
fb018d25 782 */
d62a17ae 783static void free_state(vrf_id_t vrf_id, struct route_entry *re,
784 struct route_node *rn)
fb018d25 785{
fb018d25 786
d62a17ae 787 if (!re)
788 return;
fb018d25 789
d62a17ae 790 /* free RE and nexthops */
7ee30f28 791 nexthops_free(re->ng.nexthop);
d62a17ae 792 XFREE(MTYPE_RE, re);
fb018d25
DS
793}
794
d62a17ae 795static void copy_state(struct rnh *rnh, struct route_entry *re,
796 struct route_node *rn)
fb018d25 797{
d62a17ae 798 struct route_entry *state;
fb018d25 799
d62a17ae 800 if (rnh->state) {
801 free_state(rnh->vrf_id, rnh->state, rn);
802 rnh->state = NULL;
803 }
fb018d25 804
d62a17ae 805 if (!re)
806 return;
fb018d25 807
d62a17ae 808 state = XCALLOC(MTYPE_RE, sizeof(struct route_entry));
809 state->type = re->type;
7733c6c4 810 state->distance = re->distance;
d62a17ae 811 state->metric = re->metric;
8f43b4d8 812 state->vrf_id = re->vrf_id;
fb018d25 813
7ee30f28 814 route_entry_copy_nexthops(state, re->ng.nexthop);
d62a17ae 815 rnh->state = state;
fb018d25
DS
816}
817
d62a17ae 818static int compare_state(struct route_entry *r1, struct route_entry *r2)
fb018d25 819{
fb018d25 820
d62a17ae 821 if (!r1 && !r2)
822 return 0;
fb018d25 823
d62a17ae 824 if ((!r1 && r2) || (r1 && !r2))
825 return 1;
fb018d25 826
7733c6c4
JB
827 if (r1->distance != r2->distance)
828 return 1;
829
d62a17ae 830 if (r1->metric != r2->metric)
831 return 1;
fb018d25 832
d62a17ae 833 if (r1->nexthop_num != r2->nexthop_num)
834 return 1;
fb018d25 835
332ad713
RW
836 if (CHECK_FLAG(r1->status, ROUTE_ENTRY_NEXTHOPS_CHANGED)
837 || CHECK_FLAG(r1->status, ROUTE_ENTRY_LABELS_CHANGED))
d62a17ae 838 return 1;
fb018d25 839
d62a17ae 840 return 0;
fb018d25
DS
841}
842
d62a17ae 843static int send_client(struct rnh *rnh, struct zserv *client, rnh_type_t type,
844 vrf_id_t vrf_id)
fb018d25 845{
d62a17ae 846 struct stream *s;
847 struct route_entry *re;
848 unsigned long nump;
d7c0a89a 849 uint8_t num;
0acf4df0 850 struct nexthop *nh;
d62a17ae 851 struct route_node *rn;
852 int cmd = (type == RNH_IMPORT_CHECK_TYPE) ? ZEBRA_IMPORT_CHECK_UPDATE
853 : ZEBRA_NEXTHOP_UPDATE;
854
855 rn = rnh->node;
856 re = rnh->state;
857
858 /* Get output stream. */
1002497a 859 s = stream_new(ZEBRA_MAX_PACKET_SIZ);
d62a17ae 860
7cf15b25 861 zclient_create_header(s, cmd, vrf_id);
d62a17ae 862
863 stream_putw(s, rn->p.family);
864 switch (rn->p.family) {
865 case AF_INET:
866 stream_putc(s, rn->p.prefixlen);
867 stream_put_in_addr(s, &rn->p.u.prefix4);
fb018d25 868 break;
d62a17ae 869 case AF_INET6:
870 stream_putc(s, rn->p.prefixlen);
871 stream_put(s, &rn->p.u.prefix6, IPV6_MAX_BYTELEN);
fb018d25 872 break;
d62a17ae 873 default:
e914ccbe 874 flog_err(EC_ZEBRA_RNH_UNKNOWN_FAMILY,
1c50c1c0
QY
875 "%s: Unknown family (%d) notification attempted\n",
876 __FUNCTION__, rn->p.family);
fb018d25 877 break;
d62a17ae 878 }
879 if (re) {
05dd5aaf
DS
880 stream_putc(s, re->type);
881 stream_putw(s, re->instance);
d62a17ae 882 stream_putc(s, re->distance);
883 stream_putl(s, re->metric);
884 num = 0;
885 nump = stream_get_endp(s);
886 stream_putc(s, 0);
0acf4df0
DS
887 for (nh = re->ng.nexthop; nh; nh = nh->next)
888 if ((CHECK_FLAG(nh->flags, NEXTHOP_FLAG_FIB)
889 || CHECK_FLAG(nh->flags, NEXTHOP_FLAG_RECURSIVE))
890 && CHECK_FLAG(nh->flags, NEXTHOP_FLAG_ACTIVE)) {
891 stream_putc(s, nh->type);
892 switch (nh->type) {
d62a17ae 893 case NEXTHOP_TYPE_IPV4:
aab09c10 894 case NEXTHOP_TYPE_IPV4_IFINDEX:
0acf4df0
DS
895 stream_put_in_addr(s, &nh->gate.ipv4);
896 stream_putl(s, nh->ifindex);
d62a17ae 897 break;
898 case NEXTHOP_TYPE_IFINDEX:
0acf4df0 899 stream_putl(s, nh->ifindex);
d62a17ae 900 break;
d62a17ae 901 case NEXTHOP_TYPE_IPV6:
d62a17ae 902 case NEXTHOP_TYPE_IPV6_IFINDEX:
0acf4df0
DS
903 stream_put(s, &nh->gate.ipv6, 16);
904 stream_putl(s, nh->ifindex);
d62a17ae 905 break;
906 default:
907 /* do nothing */
908 break;
909 }
0acf4df0
DS
910 if (nh->nh_label) {
911 stream_putc(s,
912 nh->nh_label->num_labels);
913 if (nh->nh_label->num_labels)
914 stream_put(
915 s,
916 &nh->nh_label->label[0],
917 nh->nh_label->num_labels
918 * sizeof(mpls_label_t));
919 } else
920 stream_putc(s, 0);
d62a17ae 921 num++;
922 }
923 stream_putc_at(s, nump, num);
924 } else {
05dd5aaf
DS
925 stream_putc(s, 0); // type
926 stream_putw(s, 0); // instance
d62a17ae 927 stream_putc(s, 0); // distance
928 stream_putl(s, 0); // metric
929 stream_putc(s, 0); // nexthops
930 }
931 stream_putw_at(s, 0, stream_get_endp(s));
932
933 client->nh_last_upd_time = monotime(NULL);
934 client->last_write_cmd = cmd;
21ccc0cf 935 return zserv_send_message(client, s);
fb018d25
DS
936}
937
d62a17ae 938static void print_nh(struct nexthop *nexthop, struct vty *vty)
fb018d25 939{
d62a17ae 940 char buf[BUFSIZ];
941 struct zebra_ns *zns = zebra_ns_lookup(NS_DEFAULT);
942
943 switch (nexthop->type) {
944 case NEXTHOP_TYPE_IPV4:
945 case NEXTHOP_TYPE_IPV4_IFINDEX:
946 vty_out(vty, " via %s", inet_ntoa(nexthop->gate.ipv4));
947 if (nexthop->ifindex)
948 vty_out(vty, ", %s",
949 ifindex2ifname_per_ns(zns, nexthop->ifindex));
950 break;
951 case NEXTHOP_TYPE_IPV6:
952 case NEXTHOP_TYPE_IPV6_IFINDEX:
953 vty_out(vty, " %s",
954 inet_ntop(AF_INET6, &nexthop->gate.ipv6, buf, BUFSIZ));
955 if (nexthop->ifindex)
956 vty_out(vty, ", via %s",
957 ifindex2ifname_per_ns(zns, nexthop->ifindex));
958 break;
959 case NEXTHOP_TYPE_IFINDEX:
960 vty_out(vty, " is directly connected, %s",
961 ifindex2ifname_per_ns(zns, nexthop->ifindex));
962 break;
963 case NEXTHOP_TYPE_BLACKHOLE:
964 vty_out(vty, " is directly connected, Null0");
965 break;
966 default:
967 break;
968 }
969 vty_out(vty, "\n");
fb018d25
DS
970}
971
d62a17ae 972static void print_rnh(struct route_node *rn, struct vty *vty)
fb018d25 973{
d62a17ae 974 struct rnh *rnh;
975 struct nexthop *nexthop;
976 struct listnode *node;
977 struct zserv *client;
978 char buf[BUFSIZ];
979
980 rnh = rn->info;
981 vty_out(vty, "%s%s\n",
982 inet_ntop(rn->p.family, &rn->p.u.prefix, buf, BUFSIZ),
983 CHECK_FLAG(rnh->flags, ZEBRA_NHT_CONNECTED) ? "(Connected)"
984 : "");
985 if (rnh->state) {
986 vty_out(vty, " resolved via %s\n",
987 zebra_route_string(rnh->state->type));
7ee30f28 988 for (nexthop = rnh->state->ng.nexthop; nexthop;
d62a17ae 989 nexthop = nexthop->next)
990 print_nh(nexthop, vty);
991 } else
992 vty_out(vty, " unresolved%s\n",
993 CHECK_FLAG(rnh->flags, ZEBRA_NHT_CONNECTED)
994 ? "(Connected)"
995 : "");
996
997 vty_out(vty, " Client list:");
998 for (ALL_LIST_ELEMENTS_RO(rnh->client_list, node, client))
999 vty_out(vty, " %s(fd %d)%s", zebra_route_string(client->proto),
1000 client->sock,
1001 rnh->filtered[client->proto] ? "(filtered)" : "");
731a75fe
RW
1002 if (!list_isempty(rnh->zebra_pseudowire_list))
1003 vty_out(vty, " zebra[pseudowires]");
d62a17ae 1004 vty_out(vty, "\n");
fb018d25 1005}
bf094f69
QY
1006
1007static int zebra_cleanup_rnh_client(vrf_id_t vrf_id, int family,
1008 struct zserv *client, rnh_type_t type)
1009{
1010 struct route_table *ntable;
1011 struct route_node *nrn;
1012 struct rnh *rnh;
1013
1014 if (IS_ZEBRA_DEBUG_NHT)
1015 zlog_debug("%u: Client %s RNH cleanup for family %d type %d",
1016 vrf_id, zebra_route_string(client->proto), family,
1017 type);
1018
1019 ntable = get_rnh_table(vrf_id, family, type);
1020 if (!ntable) {
1021 zlog_debug("cleanup_rnh_client: rnh table not found\n");
1022 return -1;
1023 }
1024
1025 for (nrn = route_top(ntable); nrn; nrn = route_next(nrn)) {
1026 if (!nrn->info)
1027 continue;
1028
1029 rnh = nrn->info;
1030 zebra_remove_rnh_client(rnh, client, type);
1031 }
1032 return 1;
1033}
1034
1035/* Cleanup registered nexthops (across VRFs) upon client disconnect. */
453844ab 1036static int zebra_client_cleanup_rnh(struct zserv *client)
bf094f69
QY
1037{
1038 struct vrf *vrf;
1039 struct zebra_vrf *zvrf;
1040
1041 RB_FOREACH (vrf, vrf_id_head, &vrfs_by_id) {
8b1766b1
QY
1042 zvrf = vrf->info;
1043 if (zvrf) {
bf094f69
QY
1044 zebra_cleanup_rnh_client(zvrf_id(zvrf), AF_INET, client,
1045 RNH_NEXTHOP_TYPE);
1046 zebra_cleanup_rnh_client(zvrf_id(zvrf), AF_INET6,
1047 client, RNH_NEXTHOP_TYPE);
1048 zebra_cleanup_rnh_client(zvrf_id(zvrf), AF_INET, client,
1049 RNH_IMPORT_CHECK_TYPE);
1050 zebra_cleanup_rnh_client(zvrf_id(zvrf), AF_INET6,
1051 client, RNH_IMPORT_CHECK_TYPE);
1052 if (client->proto == ZEBRA_ROUTE_LDP) {
1053 hash_iterate(zvrf->lsp_table,
1054 mpls_ldp_lsp_uninstall_all,
1055 zvrf->lsp_table);
1056 mpls_ldp_ftn_uninstall_all(zvrf, AFI_IP);
1057 mpls_ldp_ftn_uninstall_all(zvrf, AFI_IP6);
1058 }
1059 }
1060 }
453844ab
QY
1061
1062 return 0;
bf094f69 1063}