]> git.proxmox.com Git - mirror_frr.git/blob - pbrd/pbr_nht.c
*: Finish off the __PRETTY_FUNCTION__ to __func__
[mirror_frr.git] / pbrd / pbr_nht.c
1 /*
2 * PBR-nht Code
3 * Copyright (C) 2018 Cumulus Networks, Inc.
4 * Donald Sharp
5 *
6 * FRR 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 * FRR is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
15 *
16 * You should have received a copy of the GNU General Public License along
17 * with this program; see the file COPYING; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 */
20 #include <zebra.h>
21
22 #include <log.h>
23 #include <nexthop.h>
24 #include "nexthop_group.h"
25 #include "nexthop_group_private.h"
26 #include <hash.h>
27 #include <jhash.h>
28 #include <vty.h>
29 #include <zclient.h>
30 #include <debug.h>
31
32 #include "pbrd/pbr_nht.h"
33 #include "pbrd/pbr_map.h"
34 #include "pbrd/pbr_zebra.h"
35 #include "pbrd/pbr_memory.h"
36 #include "pbrd/pbr_debug.h"
37
38 DEFINE_MTYPE_STATIC(PBRD, PBR_NHG, "PBR Nexthop Groups")
39
40 static struct hash *pbr_nhg_hash;
41 static struct hash *pbr_nhrc_hash;
42
43 static uint32_t pbr_nhg_low_table;
44 static uint32_t pbr_nhg_high_table;
45 static uint32_t pbr_nhg_low_rule;
46 static uint32_t pbr_nhg_high_rule;
47 static bool nhg_tableid[65535];
48
49 static void pbr_nht_install_nexthop_group(struct pbr_nexthop_group_cache *pnhgc,
50 struct nexthop_group nhg);
51 static void
52 pbr_nht_uninstall_nexthop_group(struct pbr_nexthop_group_cache *pnhgc,
53 struct nexthop_group nhg,
54 enum nexthop_types_t nh_type);
55
56 /*
57 * Nexthop refcount.
58 */
59 struct nhrc {
60 struct nexthop nexthop;
61 unsigned int refcount;
62 };
63
64 /* Hash functions for pbr_nhrc_hash ---------------------------------------- */
65
66 static void *pbr_nhrc_hash_alloc(void *p)
67 {
68 struct nhrc *nhrc = XCALLOC(MTYPE_PBR_NHG, sizeof(struct nhrc));
69 nhrc->nexthop = *(struct nexthop *)p;
70 nhrc->nexthop.next = NULL;
71 nhrc->nexthop.prev = NULL;
72 return nhrc;
73 }
74
75 static bool pbr_nhrc_hash_equal(const void *arg1, const void *arg2)
76 {
77 const struct nexthop *nh1, *nh2;
78
79 nh1 = arg1;
80 nh2 = arg2;
81
82 return nexthop_same(nh1, nh2);
83 }
84
85 /* ------------------------------------------------------------------------- */
86
87 static void *pbr_nh_alloc(void *p)
88 {
89 struct pbr_nexthop_cache *new;
90 struct pbr_nexthop_cache *pnhc = (struct pbr_nexthop_cache *)p;
91 struct nhrc *nhrc;
92
93 new = XCALLOC(MTYPE_PBR_NHG, sizeof(*new));
94 nhrc = hash_get(pbr_nhrc_hash, pnhc->nexthop, pbr_nhrc_hash_alloc);
95 new->nexthop = &nhrc->nexthop;
96
97 /* Decremented again in pbr_nh_delete */
98 ++nhrc->refcount;
99
100 DEBUGD(&pbr_dbg_nht, "%s: Sending nexthop to Zebra", __func__);
101
102 pbr_send_rnh(new->nexthop, true);
103
104 new->valid = false;
105 return new;
106 }
107
108 static void pbr_nh_delete(struct pbr_nexthop_cache **pnhc)
109 {
110 struct nhrc *nhrc;
111
112 nhrc = hash_lookup(pbr_nhrc_hash, (*pnhc)->nexthop);
113
114 if (nhrc)
115 --nhrc->refcount;
116 if (!nhrc || nhrc->refcount == 0) {
117 DEBUGD(&pbr_dbg_nht, "%s: Removing nexthop from Zebra",
118 __func__);
119 pbr_send_rnh((*pnhc)->nexthop, false);
120 }
121 if (nhrc && nhrc->refcount == 0) {
122 hash_release(pbr_nhrc_hash, nhrc);
123 XFREE(MTYPE_PBR_NHG, nhrc);
124 }
125
126 XFREE(MTYPE_PBR_NHG, *pnhc);
127 }
128
129 static void pbr_nh_delete_iterate(struct hash_bucket *b, void *p)
130 {
131 pbr_nh_delete((struct pbr_nexthop_cache **)&b->data);
132 }
133
134 static uint32_t pbr_nh_hash_key(const void *arg)
135 {
136 uint32_t key;
137 const struct pbr_nexthop_cache *pbrnc = arg;
138
139 key = nexthop_hash(pbrnc->nexthop);
140
141 return key;
142 }
143
144 static bool pbr_nh_hash_equal(const void *arg1, const void *arg2)
145 {
146 const struct pbr_nexthop_cache *pbrnc1 =
147 (const struct pbr_nexthop_cache *)arg1;
148 const struct pbr_nexthop_cache *pbrnc2 =
149 (const struct pbr_nexthop_cache *)arg2;
150
151 if (pbrnc1->nexthop->vrf_id != pbrnc2->nexthop->vrf_id)
152 return false;
153
154 if (pbrnc1->nexthop->ifindex != pbrnc2->nexthop->ifindex)
155 return false;
156
157 if (pbrnc1->nexthop->type != pbrnc2->nexthop->type)
158 return false;
159
160 switch (pbrnc1->nexthop->type) {
161 case NEXTHOP_TYPE_IFINDEX:
162 return pbrnc1->nexthop->ifindex == pbrnc2->nexthop->ifindex;
163 case NEXTHOP_TYPE_IPV4_IFINDEX:
164 case NEXTHOP_TYPE_IPV4:
165 return pbrnc1->nexthop->gate.ipv4.s_addr
166 == pbrnc2->nexthop->gate.ipv4.s_addr;
167 case NEXTHOP_TYPE_IPV6_IFINDEX:
168 case NEXTHOP_TYPE_IPV6:
169 return !memcmp(&pbrnc1->nexthop->gate.ipv6,
170 &pbrnc2->nexthop->gate.ipv6, 16);
171 case NEXTHOP_TYPE_BLACKHOLE:
172 return pbrnc1->nexthop->bh_type == pbrnc2->nexthop->bh_type;
173 }
174
175 /*
176 * We should not get here
177 */
178 return false;
179 }
180
181 static void pbr_nhgc_delete(struct pbr_nexthop_group_cache *p)
182 {
183 hash_iterate(p->nhh, pbr_nh_delete_iterate, NULL);
184 hash_free(p->nhh);
185 XFREE(MTYPE_PBR_NHG, p);
186 }
187
188 static void *pbr_nhgc_alloc(void *p)
189 {
190 struct pbr_nexthop_group_cache *new;
191 struct pbr_nexthop_group_cache *pnhgc =
192 (struct pbr_nexthop_group_cache *)p;
193
194 new = XCALLOC(MTYPE_PBR_NHG, sizeof(*new));
195
196 strlcpy(new->name, pnhgc->name, sizeof(pnhgc->name));
197 new->table_id = pbr_nht_get_next_tableid(false);
198
199 DEBUGD(&pbr_dbg_nht, "%s: NHT: %s assigned Table ID: %u", __func__,
200 new->name, new->table_id);
201
202 new->nhh = hash_create_size(8, pbr_nh_hash_key, pbr_nh_hash_equal,
203 "PBR NH Cache Hash");
204 return new;
205 }
206
207
208 void pbr_nhgroup_add_cb(const char *name)
209 {
210 struct pbr_nexthop_group_cache *pnhgc;
211 struct nexthop_group_cmd *nhgc;
212
213 nhgc = nhgc_find(name);
214
215 if (!nhgc) {
216 DEBUGD(&pbr_dbg_nht, "%s: Could not find nhgc with name: %s\n",
217 __func__, name);
218 return;
219 }
220
221 pnhgc = pbr_nht_add_group(name);
222
223 if (!pnhgc)
224 return;
225
226 DEBUGD(&pbr_dbg_nht, "%s: Added nexthop-group %s", __func__, name);
227
228 pbr_map_check_nh_group_change(name);
229 }
230
231 void pbr_nhgroup_add_nexthop_cb(const struct nexthop_group_cmd *nhgc,
232 const struct nexthop *nhop)
233 {
234 char debugstr[256];
235 struct pbr_nexthop_group_cache pnhgc_find = {};
236 struct pbr_nexthop_group_cache *pnhgc;
237 struct pbr_nexthop_cache pnhc_find = {};
238 struct pbr_nexthop_cache *pnhc;
239
240 if (!pbr_nht_get_next_tableid(true)) {
241 zlog_warn(
242 "%s: Exhausted all table identifiers; cannot create nexthop-group cache for nexthop-group '%s'",
243 __func__, nhgc->name);
244 return;
245 }
246
247 /* find pnhgc by name */
248 strlcpy(pnhgc_find.name, nhgc->name, sizeof(pnhgc_find.name));
249 pnhgc = hash_get(pbr_nhg_hash, &pnhgc_find, pbr_nhgc_alloc);
250
251 /* create & insert new pnhc into pnhgc->nhh */
252 pnhc_find.nexthop = (struct nexthop *)nhop;
253 pnhc = hash_get(pnhgc->nhh, &pnhc_find, pbr_nh_alloc);
254 pnhc_find.nexthop = NULL;
255
256 /* set parent pnhgc */
257 pnhc->parent = pnhgc;
258
259 if (DEBUG_MODE_CHECK(&pbr_dbg_nht, DEBUG_MODE_ALL)) {
260 nexthop2str(nhop, debugstr, sizeof(debugstr));
261 DEBUGD(&pbr_dbg_nht, "%s: Added %s to nexthop-group %s",
262 __func__, debugstr, nhgc->name);
263 }
264
265 pbr_nht_install_nexthop_group(pnhgc, nhgc->nhg);
266 pbr_map_check_nh_group_change(nhgc->name);
267
268 if (nhop->type == NEXTHOP_TYPE_IFINDEX
269 || (nhop->type == NEXTHOP_TYPE_IPV6_IFINDEX
270 && IN6_IS_ADDR_LINKLOCAL(&nhop->gate.ipv6))) {
271 struct interface *ifp;
272
273 ifp = if_lookup_by_index(nhop->ifindex, nhop->vrf_id);
274 if (ifp)
275 pbr_nht_nexthop_interface_update(ifp);
276 }
277 }
278
279 void pbr_nhgroup_del_nexthop_cb(const struct nexthop_group_cmd *nhgc,
280 const struct nexthop *nhop)
281 {
282 char debugstr[256];
283 struct pbr_nexthop_group_cache pnhgc_find = {};
284 struct pbr_nexthop_group_cache *pnhgc;
285 struct pbr_nexthop_cache pnhc_find = {};
286 struct pbr_nexthop_cache *pnhc;
287 enum nexthop_types_t nh_type = nhop->type;
288
289 /* find pnhgc by name */
290 strlcpy(pnhgc_find.name, nhgc->name, sizeof(pnhgc_find.name));
291 pnhgc = hash_lookup(pbr_nhg_hash, &pnhgc_find);
292
293 /* delete pnhc from pnhgc->nhh */
294 pnhc_find.nexthop = (struct nexthop *)nhop;
295 pnhc = hash_release(pnhgc->nhh, &pnhc_find);
296
297 /* delete pnhc */
298 pbr_nh_delete(&pnhc);
299
300 if (DEBUG_MODE_CHECK(&pbr_dbg_nht, DEBUG_MODE_ALL)) {
301 nexthop2str(nhop, debugstr, sizeof(debugstr));
302 DEBUGD(&pbr_dbg_nht, "%s: Removed %s from nexthop-group %s",
303 __func__, debugstr, nhgc->name);
304 }
305
306 if (pnhgc->nhh->count)
307 pbr_nht_install_nexthop_group(pnhgc, nhgc->nhg);
308 else
309 pbr_nht_uninstall_nexthop_group(pnhgc, nhgc->nhg, nh_type);
310
311 pbr_map_check_nh_group_change(nhgc->name);
312 }
313
314 void pbr_nhgroup_delete_cb(const char *name)
315 {
316 DEBUGD(&pbr_dbg_nht, "%s: Removed nexthop-group %s", __func__, name);
317
318 /* delete group from all pbrms's */
319 pbr_nht_delete_group(name);
320
321 pbr_map_check_nh_group_change(name);
322 }
323
324 #if 0
325 static struct pbr_nexthop_cache *pbr_nht_lookup_nexthop(struct nexthop *nexthop)
326 {
327 return NULL;
328 }
329 #endif
330
331 static void pbr_nht_find_nhg_from_table_install(struct hash_bucket *b,
332 void *data)
333 {
334 struct pbr_nexthop_group_cache *pnhgc =
335 (struct pbr_nexthop_group_cache *)b->data;
336 uint32_t *table_id = (uint32_t *)data;
337
338 if (pnhgc->table_id == *table_id) {
339 DEBUGD(&pbr_dbg_nht, "%s: Table ID (%u) matches %s", __func__,
340 *table_id, pnhgc->name);
341
342 /*
343 * If the table has been re-handled by zebra
344 * and we are already installed no need to do
345 * anything here.
346 */
347 if (!pnhgc->installed) {
348 pnhgc->installed = true;
349 pbr_map_schedule_policy_from_nhg(pnhgc->name);
350 }
351 }
352 }
353
354 void pbr_nht_route_installed_for_table(uint32_t table_id)
355 {
356 hash_iterate(pbr_nhg_hash, pbr_nht_find_nhg_from_table_install,
357 &table_id);
358 }
359
360 static void pbr_nht_find_nhg_from_table_remove(struct hash_bucket *b,
361 void *data)
362 {
363 ;
364 }
365
366 void pbr_nht_route_removed_for_table(uint32_t table_id)
367 {
368 hash_iterate(pbr_nhg_hash, pbr_nht_find_nhg_from_table_remove,
369 &table_id);
370 }
371
372 /*
373 * Loop through all nexthops in a nexthop group to check that they are all the
374 * same. If they are not all the same, log this peculiarity.
375 *
376 * nhg
377 * The nexthop group to check
378 *
379 * Returns:
380 * - AFI of last nexthop in the group
381 * - AFI_MAX on error
382 */
383 static afi_t pbr_nht_which_afi(struct nexthop_group nhg,
384 enum nexthop_types_t nh_type)
385 {
386 struct nexthop *nexthop;
387 afi_t install_afi = AFI_MAX;
388 bool v6, v4, bh;
389
390 if (nh_type) {
391 switch (nh_type) {
392 case NEXTHOP_TYPE_IPV4:
393 case NEXTHOP_TYPE_IPV4_IFINDEX:
394 return AFI_IP;
395 case NEXTHOP_TYPE_IPV6:
396 case NEXTHOP_TYPE_IPV6_IFINDEX:
397 return AFI_IP6;
398 case NEXTHOP_TYPE_IFINDEX:
399 case NEXTHOP_TYPE_BLACKHOLE:
400 return AFI_MAX;
401 }
402 }
403
404 v6 = v4 = bh = false;
405
406 for (ALL_NEXTHOPS(nhg, nexthop)) {
407 nh_type = nexthop->type;
408
409 switch (nh_type) {
410 case NEXTHOP_TYPE_IFINDEX:
411 break;
412 case NEXTHOP_TYPE_IPV4:
413 case NEXTHOP_TYPE_IPV4_IFINDEX:
414 v6 = true;
415 install_afi = AFI_IP;
416 break;
417 case NEXTHOP_TYPE_IPV6:
418 case NEXTHOP_TYPE_IPV6_IFINDEX:
419 v4 = true;
420 install_afi = AFI_IP6;
421 break;
422 case NEXTHOP_TYPE_BLACKHOLE:
423 bh = true;
424 break;
425 }
426 }
427
428 /* Interface and/or blackhole nexthops only. */
429 if (!v4 && !v6)
430 install_afi = AFI_MAX;
431
432 if (!bh && v6 && v4)
433 DEBUGD(&pbr_dbg_nht,
434 "%s: Saw both V6 and V4 nexthops...using %s", __func__,
435 afi2str(install_afi));
436 if (bh && (v6 || v4))
437 DEBUGD(&pbr_dbg_nht,
438 "%s: Saw blackhole nexthop(s) with %s%s%s nexthop(s), using AFI_MAX.",
439 __func__, v4 ? "v4" : "", (v4 && v6) ? " and " : "",
440 v6 ? "v6" : "");
441
442 return install_afi;
443 }
444
445 static void pbr_nht_install_nexthop_group(struct pbr_nexthop_group_cache *pnhgc,
446 struct nexthop_group nhg)
447 {
448 afi_t install_afi;
449 enum nexthop_types_t nh_type = 0;
450
451 install_afi = pbr_nht_which_afi(nhg, nh_type);
452
453 route_add(pnhgc, nhg, install_afi);
454 }
455
456 static void
457 pbr_nht_uninstall_nexthop_group(struct pbr_nexthop_group_cache *pnhgc,
458 struct nexthop_group nhg,
459 enum nexthop_types_t nh_type)
460 {
461 afi_t install_afi;
462
463 install_afi = pbr_nht_which_afi(nhg, nh_type);
464
465 pnhgc->installed = false;
466 pnhgc->valid = false;
467 route_delete(pnhgc, install_afi);
468 }
469
470 void pbr_nht_change_group(const char *name)
471 {
472 struct nexthop_group_cmd *nhgc;
473 struct pbr_nexthop_group_cache *pnhgc;
474 struct pbr_nexthop_group_cache find;
475 struct nexthop *nhop;
476
477 nhgc = nhgc_find(name);
478 if (!nhgc)
479 return;
480
481 memset(&find, 0, sizeof(find));
482 snprintf(find.name, sizeof(find.name), "%s", name);
483 pnhgc = hash_lookup(pbr_nhg_hash, &find);
484
485 if (!pnhgc) {
486 DEBUGD(&pbr_dbg_nht,
487 "%s: Could not find nexthop-group cache w/ name '%s'",
488 __func__, name);
489 return;
490 }
491
492 for (ALL_NEXTHOPS(nhgc->nhg, nhop)) {
493 struct pbr_nexthop_cache lookup;
494 struct pbr_nexthop_cache *pnhc;
495
496 lookup.nexthop = nhop;
497 pnhc = hash_lookup(pnhgc->nhh, &lookup);
498 if (!pnhc) {
499 pnhc = hash_get(pnhgc->nhh, &lookup, pbr_nh_alloc);
500 pnhc->parent = pnhgc;
501 }
502 }
503 pbr_nht_install_nexthop_group(pnhgc, nhgc->nhg);
504 }
505
506 char *pbr_nht_nexthop_make_name(char *name, size_t l,
507 uint32_t seqno, char *buffer)
508 {
509 snprintf(buffer, l, "%s%u", name, seqno);
510 return buffer;
511 }
512
513 void pbr_nht_add_individual_nexthop(struct pbr_map_sequence *pbrms)
514 {
515 struct pbr_nexthop_group_cache *pnhgc;
516 struct pbr_nexthop_group_cache find;
517 struct pbr_nexthop_cache *pnhc;
518 struct pbr_nexthop_cache lookup;
519
520 memset(&find, 0, sizeof(find));
521 pbr_nht_nexthop_make_name(pbrms->parent->name, PBR_NHC_NAMELEN,
522 pbrms->seqno, find.name);
523
524 if (!pbr_nht_get_next_tableid(true)) {
525 zlog_warn(
526 "%s: Exhausted all table identifiers; cannot create nexthop-group cache for nexthop-group '%s'",
527 __func__, find.name);
528 return;
529 }
530
531 if (!pbrms->internal_nhg_name)
532 pbrms->internal_nhg_name = XSTRDUP(MTYPE_TMP, find.name);
533
534 pnhgc = hash_get(pbr_nhg_hash, &find, pbr_nhgc_alloc);
535
536 lookup.nexthop = pbrms->nhg->nexthop;
537 pnhc = hash_get(pnhgc->nhh, &lookup, pbr_nh_alloc);
538 pnhc->parent = pnhgc;
539 pbr_nht_install_nexthop_group(pnhgc, *pbrms->nhg);
540 }
541
542 void pbr_nht_delete_individual_nexthop(struct pbr_map_sequence *pbrms)
543 {
544 struct pbr_nexthop_group_cache *pnhgc;
545 struct pbr_nexthop_group_cache find;
546 struct pbr_nexthop_cache *pnhc;
547 struct pbr_nexthop_cache lup;
548 struct nexthop *nh;
549 enum nexthop_types_t nh_type = 0;
550
551 pbr_map_delete_nexthops(pbrms);
552
553 memset(&find, 0, sizeof(find));
554 snprintf(find.name, sizeof(find.name), "%s", pbrms->internal_nhg_name);
555 pnhgc = hash_lookup(pbr_nhg_hash, &find);
556
557 nh = pbrms->nhg->nexthop;
558 nh_type = nh->type;
559 lup.nexthop = nh;
560 pnhc = hash_lookup(pnhgc->nhh, &lup);
561 pnhc->parent = NULL;
562 hash_release(pnhgc->nhh, pnhc);
563 pbr_nh_delete(&pnhc);
564 pbr_nht_uninstall_nexthop_group(pnhgc, *pbrms->nhg, nh_type);
565
566 hash_release(pbr_nhg_hash, pnhgc);
567
568 nexthop_group_delete(&pbrms->nhg);
569 XFREE(MTYPE_TMP, pbrms->internal_nhg_name);
570 }
571
572 struct pbr_nexthop_group_cache *pbr_nht_add_group(const char *name)
573 {
574 struct nexthop *nhop;
575 struct nexthop_group_cmd *nhgc;
576 struct pbr_nexthop_group_cache *pnhgc;
577 struct pbr_nexthop_group_cache lookup;
578
579 if (!pbr_nht_get_next_tableid(true)) {
580 zlog_warn(
581 "%s: Exhausted all table identifiers; cannot create nexthop-group cache for nexthop-group '%s'",
582 __func__, name);
583 return NULL;
584 }
585
586 nhgc = nhgc_find(name);
587
588 if (!nhgc) {
589 DEBUGD(&pbr_dbg_nht, "%s: Could not find nhgc with name: %s\n",
590 __func__, name);
591 return NULL;
592 }
593
594 snprintf(lookup.name, sizeof(lookup.name), "%s", name);
595 pnhgc = hash_get(pbr_nhg_hash, &lookup, pbr_nhgc_alloc);
596 DEBUGD(&pbr_dbg_nht, "%s: Retrieved NHGC @ %p", __func__, pnhgc);
597
598 for (ALL_NEXTHOPS(nhgc->nhg, nhop)) {
599 struct pbr_nexthop_cache lookupc;
600 struct pbr_nexthop_cache *pnhc;
601
602 lookupc.nexthop = nhop;
603 pnhc = hash_lookup(pnhgc->nhh, &lookupc);
604 if (!pnhc) {
605 pnhc = hash_get(pnhgc->nhh, &lookupc, pbr_nh_alloc);
606 pnhc->parent = pnhgc;
607 }
608 }
609
610 return pnhgc;
611 }
612
613 void pbr_nht_delete_group(const char *name)
614 {
615 struct pbr_map_sequence *pbrms;
616 struct listnode *snode;
617 struct pbr_map *pbrm;
618 struct pbr_nexthop_group_cache pnhgc_find;
619 struct pbr_nexthop_group_cache *pnhgc;
620
621 RB_FOREACH (pbrm, pbr_map_entry_head, &pbr_maps) {
622 for (ALL_LIST_ELEMENTS_RO(pbrm->seqnumbers, snode, pbrms)) {
623 if (pbrms->nhgrp_name
624 && strmatch(pbrms->nhgrp_name, name)) {
625 pbrms->reason |= PBR_MAP_INVALID_NO_NEXTHOPS;
626 pbrms->nhg = NULL;
627 pbrms->internal_nhg_name = NULL;
628 pbrm->valid = false;
629 }
630 }
631 }
632
633 strlcpy(pnhgc_find.name, name, sizeof(pnhgc_find.name));
634 pnhgc = hash_release(pbr_nhg_hash, &pnhgc_find);
635 pbr_nhgc_delete(pnhgc);
636 }
637
638 bool pbr_nht_nexthop_valid(struct nexthop_group *nhg)
639 {
640 DEBUGD(&pbr_dbg_nht, "%s: %p", __func__, nhg);
641 return true;
642 }
643
644 bool pbr_nht_nexthop_group_valid(const char *name)
645 {
646 struct pbr_nexthop_group_cache *pnhgc;
647 struct pbr_nexthop_group_cache lookup;
648
649 DEBUGD(&pbr_dbg_nht, "%s: %s", __func__, name);
650
651 snprintf(lookup.name, sizeof(lookup.name), "%s", name);
652 pnhgc = hash_get(pbr_nhg_hash, &lookup, NULL);
653 if (!pnhgc)
654 return false;
655 DEBUGD(&pbr_dbg_nht, "%s: \t%d %d", __func__, pnhgc->valid,
656 pnhgc->installed);
657 if (pnhgc->valid && pnhgc->installed)
658 return true;
659
660 return false;
661 }
662
663 struct pbr_nht_individual {
664 struct zapi_route *nhr;
665 struct interface *ifp;
666
667 uint32_t valid;
668 };
669
670 static bool
671 pbr_nht_individual_nexthop_gw_update(struct pbr_nexthop_cache *pnhc,
672 const struct pbr_nht_individual *pnhi)
673 {
674 bool is_valid = pnhc->valid;
675
676 if (!pnhi->nhr) /* It doesn't care about non-nexthop updates */
677 goto done;
678
679 switch (pnhi->nhr->prefix.family) {
680 case AF_INET:
681 if (pnhc->nexthop->gate.ipv4.s_addr
682 != pnhi->nhr->prefix.u.prefix4.s_addr)
683 goto done; /* Unrelated change */
684 break;
685 case AF_INET6:
686 if (memcmp(&pnhc->nexthop->gate.ipv6,
687 &pnhi->nhr->prefix.u.prefix6, 16)
688 != 0)
689 goto done; /* Unrelated change */
690 break;
691 }
692
693 if (!pnhi->nhr->nexthop_num) {
694 is_valid = false;
695 goto done;
696 }
697
698 if (pnhc->nexthop->type == NEXTHOP_TYPE_IPV4_IFINDEX
699 || pnhc->nexthop->type == NEXTHOP_TYPE_IPV6_IFINDEX) {
700
701 /* GATEWAY_IFINDEX type shouldn't resolve to group */
702 if (pnhi->nhr->nexthop_num > 1) {
703 is_valid = false;
704 goto done;
705 }
706
707 /* If whatever we resolved to wasn't on the interface we
708 * specified. (i.e. not a connected route), its invalid.
709 */
710 if (pnhi->nhr->nexthops[0].ifindex != pnhc->nexthop->ifindex) {
711 is_valid = false;
712 goto done;
713 }
714 }
715
716 is_valid = true;
717
718 done:
719 pnhc->valid = is_valid;
720
721 return pnhc->valid;
722 }
723
724 static bool pbr_nht_individual_nexthop_interface_update(
725 struct pbr_nexthop_cache *pnhc, const struct pbr_nht_individual *pnhi)
726 {
727 bool is_valid = pnhc->valid;
728
729 if (!pnhi->ifp) /* It doesn't care about non-interface updates */
730 goto done;
731
732 if (pnhc->nexthop->ifindex
733 != pnhi->ifp->ifindex) /* Un-related interface */
734 goto done;
735
736 is_valid = !!if_is_up(pnhi->ifp);
737
738 done:
739 pnhc->valid = is_valid;
740
741 return pnhc->valid;
742 }
743
744 /* Given this update either from interface or nexthop tracking, re-validate this
745 * nexthop.
746 *
747 * If the update is un-related, the subroutines shoud just return their cached
748 * valid state.
749 */
750 static void
751 pbr_nht_individual_nexthop_update(struct pbr_nexthop_cache *pnhc,
752 const struct pbr_nht_individual *pnhi)
753 {
754 assert(pnhi->nhr || pnhi->ifp); /* Either nexthop or interface update */
755
756 switch (pnhc->nexthop->type) {
757 case NEXTHOP_TYPE_IFINDEX:
758 pbr_nht_individual_nexthop_interface_update(pnhc, pnhi);
759 break;
760 case NEXTHOP_TYPE_IPV6_IFINDEX:
761 if (IN6_IS_ADDR_LINKLOCAL(&pnhc->nexthop->gate.ipv6)) {
762 pbr_nht_individual_nexthop_interface_update(pnhc, pnhi);
763 break;
764 }
765 /* Intentional fall thru */
766 case NEXTHOP_TYPE_IPV4_IFINDEX:
767 case NEXTHOP_TYPE_IPV4:
768 case NEXTHOP_TYPE_IPV6:
769 pbr_nht_individual_nexthop_gw_update(pnhc, pnhi);
770 break;
771 case NEXTHOP_TYPE_BLACKHOLE:
772 pnhc->valid = true;
773 break;
774 }
775 }
776
777 static void pbr_nht_individual_nexthop_update_lookup(struct hash_bucket *b,
778 void *data)
779 {
780 struct pbr_nexthop_cache *pnhc = b->data;
781 struct pbr_nht_individual *pnhi = data;
782 char buf[PREFIX_STRLEN];
783 bool old_valid;
784
785 old_valid = pnhc->valid;
786
787 pbr_nht_individual_nexthop_update(pnhc, pnhi);
788
789 DEBUGD(&pbr_dbg_nht, "\tFound %s: old: %d new: %d",
790 prefix2str(&pnhi->nhr->prefix, buf, sizeof(buf)), old_valid,
791 pnhc->valid);
792
793 if (pnhc->valid)
794 pnhi->valid += 1;
795 }
796
797 static void pbr_nexthop_group_cache_iterate_to_group(struct hash_bucket *b,
798 void *data)
799 {
800 struct pbr_nexthop_cache *pnhc = b->data;
801 struct nexthop_group *nhg = data;
802 struct nexthop *nh = NULL;
803
804 copy_nexthops(&nh, pnhc->nexthop, NULL);
805
806 _nexthop_add(&nhg->nexthop, nh);
807 }
808
809 static void
810 pbr_nexthop_group_cache_to_nexthop_group(struct nexthop_group *nhg,
811 struct pbr_nexthop_group_cache *pnhgc)
812 {
813 hash_iterate(pnhgc->nhh, pbr_nexthop_group_cache_iterate_to_group, nhg);
814 }
815
816 static void pbr_nht_nexthop_update_lookup(struct hash_bucket *b, void *data)
817 {
818 struct pbr_nexthop_group_cache *pnhgc = b->data;
819 struct pbr_nht_individual pnhi = {};
820 struct nexthop_group nhg = {};
821 bool old_valid;
822
823 old_valid = pnhgc->valid;
824
825 pnhi.nhr = (struct zapi_route *)data;
826 pnhi.valid = 0;
827 hash_iterate(pnhgc->nhh, pbr_nht_individual_nexthop_update_lookup,
828 &pnhi);
829
830 /*
831 * If any of the specified nexthops are valid we are valid
832 */
833 pnhgc->valid = !!pnhi.valid;
834
835 if (pnhgc->valid) {
836 pbr_nexthop_group_cache_to_nexthop_group(&nhg, pnhgc);
837 pbr_nht_install_nexthop_group(pnhgc, nhg);
838 /* Don't need copied nexthops anymore */
839 nexthops_free(nhg.nexthop);
840 }
841
842 if (old_valid != pnhgc->valid)
843 pbr_map_check_nh_group_change(pnhgc->name);
844 }
845
846 void pbr_nht_nexthop_update(struct zapi_route *nhr)
847 {
848 hash_iterate(pbr_nhg_hash, pbr_nht_nexthop_update_lookup, nhr);
849 }
850
851 static void
852 pbr_nht_individual_nexthop_interface_update_lookup(struct hash_bucket *b,
853 void *data)
854 {
855 struct pbr_nexthop_cache *pnhc = b->data;
856 struct pbr_nht_individual *pnhi = data;
857 bool old_valid;
858
859 old_valid = pnhc->valid;
860
861 pbr_nht_individual_nexthop_update(pnhc, pnhi);
862
863 DEBUGD(&pbr_dbg_nht, "\tFound %s: old: %d new: %d", pnhi->ifp->name,
864 old_valid, pnhc->valid);
865
866 if (pnhc->valid)
867 pnhi->valid += 1;
868 }
869
870 static void pbr_nht_nexthop_interface_update_lookup(struct hash_bucket *b,
871 void *data)
872 {
873 struct pbr_nexthop_group_cache *pnhgc = b->data;
874 struct pbr_nht_individual pnhi = {};
875 bool old_valid;
876
877 old_valid = pnhgc->valid;
878
879 pnhi.ifp = data;
880 pnhi.valid = 0;
881 hash_iterate(pnhgc->nhh,
882 pbr_nht_individual_nexthop_interface_update_lookup, &pnhi);
883
884 /*
885 * If any of the specified nexthops are valid we are valid
886 */
887 pnhgc->valid = !!pnhi.valid;
888
889 if (old_valid != pnhgc->valid)
890 pbr_map_check_nh_group_change(pnhgc->name);
891 }
892
893 void pbr_nht_nexthop_interface_update(struct interface *ifp)
894 {
895 hash_iterate(pbr_nhg_hash, pbr_nht_nexthop_interface_update_lookup,
896 ifp);
897 }
898
899 static uint32_t pbr_nhg_hash_key(const void *arg)
900 {
901 const struct pbr_nexthop_group_cache *nhgc = arg;
902
903 return jhash(&nhgc->name, strlen(nhgc->name), 0x52c34a96);
904 }
905
906 static bool pbr_nhg_hash_equal(const void *arg1, const void *arg2)
907 {
908 const struct pbr_nexthop_group_cache *nhgc1 =
909 (const struct pbr_nexthop_group_cache *)arg1;
910 const struct pbr_nexthop_group_cache *nhgc2 =
911 (const struct pbr_nexthop_group_cache *)arg2;
912
913 return !strcmp(nhgc1->name, nhgc2->name);
914 }
915
916 uint32_t pbr_nht_get_next_tableid(bool peek)
917 {
918 uint32_t i;
919 bool found = false;
920
921 for (i = pbr_nhg_low_table; i <= pbr_nhg_high_table; i++) {
922 if (!nhg_tableid[i]) {
923 found = true;
924 break;
925 }
926 }
927
928 if (found) {
929 nhg_tableid[i] = !peek;
930 return i;
931 } else
932 return 0;
933 }
934
935 void pbr_nht_set_tableid_range(uint32_t low, uint32_t high)
936 {
937 pbr_nhg_low_table = low;
938 pbr_nhg_high_table = high;
939 }
940
941 void pbr_nht_write_table_range(struct vty *vty)
942 {
943 if (pbr_nhg_low_table != PBR_NHT_DEFAULT_LOW_TABLEID
944 || pbr_nhg_high_table != PBR_NHT_DEFAULT_HIGH_TABLEID) {
945 vty_out(vty, "pbr table range %u %u\n", pbr_nhg_low_table,
946 pbr_nhg_high_table);
947 }
948 }
949
950 uint32_t pbr_nht_get_next_rule(uint32_t seqno)
951 {
952 return seqno + pbr_nhg_low_rule - 1;
953 }
954 void pbr_nht_set_rule_range(uint32_t low, uint32_t high)
955 {
956 pbr_nhg_low_rule = low;
957 pbr_nhg_high_rule = high;
958 }
959
960 void pbr_nht_write_rule_range(struct vty *vty)
961 {
962 if (pbr_nhg_low_rule != PBR_NHT_DEFAULT_LOW_RULE
963 || pbr_nhg_high_rule != PBR_NHT_DEFAULT_HIGH_RULE) {
964 vty_out(vty, "pbr rule range %u %u\n", pbr_nhg_low_rule,
965 pbr_nhg_high_rule);
966 }
967 }
968
969 uint32_t pbr_nht_get_table(const char *name)
970 {
971 struct pbr_nexthop_group_cache find;
972 struct pbr_nexthop_group_cache *pnhgc;
973
974 memset(&find, 0, sizeof(find));
975 snprintf(find.name, sizeof(find.name), "%s", name);
976 pnhgc = hash_lookup(pbr_nhg_hash, &find);
977
978 if (!pnhgc) {
979 DEBUGD(&pbr_dbg_nht,
980 "%s: Could not find nexthop-group cache w/ name '%s'",
981 __func__, name);
982 return 5000;
983 }
984
985 return pnhgc->table_id;
986 }
987
988 bool pbr_nht_get_installed(const char *name)
989 {
990 struct pbr_nexthop_group_cache find;
991 struct pbr_nexthop_group_cache *pnhgc;
992
993 memset(&find, 0, sizeof(find));
994 snprintf(find.name, sizeof(find.name), "%s", name);
995
996 pnhgc = hash_lookup(pbr_nhg_hash, &find);
997
998 if (!pnhgc)
999 return false;
1000
1001 return pnhgc->installed;
1002 }
1003
1004 static void pbr_nht_show_nhg_nexthops(struct hash_bucket *b, void *data)
1005 {
1006 struct pbr_nexthop_cache *pnhc = b->data;
1007 struct vty *vty = data;
1008
1009 vty_out(vty, "\tValid: %d ", pnhc->valid);
1010 nexthop_group_write_nexthop(vty, pnhc->nexthop);
1011 }
1012
1013 struct pbr_nht_show {
1014 struct vty *vty;
1015 const char *name;
1016 };
1017
1018 static void pbr_nht_show_nhg(struct hash_bucket *b, void *data)
1019 {
1020 struct pbr_nexthop_group_cache *pnhgc = b->data;
1021 struct pbr_nht_show *pns = data;
1022 struct vty *vty;
1023
1024 if (pns->name && strcmp(pns->name, pnhgc->name) != 0)
1025 return;
1026
1027 vty = pns->vty;
1028 vty_out(vty, "Nexthop-Group: %s Table: %u Valid: %d Installed: %d\n",
1029 pnhgc->name, pnhgc->table_id, pnhgc->valid, pnhgc->installed);
1030
1031 hash_iterate(pnhgc->nhh, pbr_nht_show_nhg_nexthops, vty);
1032 }
1033
1034 void pbr_nht_show_nexthop_group(struct vty *vty, const char *name)
1035 {
1036 struct pbr_nht_show pns;
1037
1038 pns.vty = vty;
1039 pns.name = name;
1040
1041 hash_iterate(pbr_nhg_hash, pbr_nht_show_nhg, &pns);
1042 }
1043
1044 void pbr_nht_init(void)
1045 {
1046 pbr_nhg_hash = hash_create_size(
1047 16, pbr_nhg_hash_key, pbr_nhg_hash_equal, "PBR NHG Cache Hash");
1048 pbr_nhrc_hash =
1049 hash_create_size(16, (unsigned int (*)(const void *))nexthop_hash,
1050 pbr_nhrc_hash_equal, "PBR NH Hash");
1051
1052 pbr_nhg_low_table = PBR_NHT_DEFAULT_LOW_TABLEID;
1053 pbr_nhg_high_table = PBR_NHT_DEFAULT_HIGH_TABLEID;
1054 pbr_nhg_low_rule = PBR_NHT_DEFAULT_LOW_RULE;
1055 pbr_nhg_high_rule = PBR_NHT_DEFAULT_HIGH_RULE;
1056 memset(&nhg_tableid, 0, 65535 * sizeof(uint8_t));
1057 }