3 * Copyright (C) 2018 Cumulus Networks, Inc.
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
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.
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
24 #include <nexthop_group.h>
31 #include "pbrd/pbr_nht.h"
32 #include "pbrd/pbr_map.h"
33 #include "pbrd/pbr_zebra.h"
34 #include "pbrd/pbr_memory.h"
35 #include "pbrd/pbr_debug.h"
37 DEFINE_MTYPE_STATIC(PBRD
, PBR_NHG
, "PBR Nexthop Groups")
39 static struct hash
*pbr_nhg_hash
;
40 static struct hash
*pbr_nhrc_hash
;
42 static uint32_t pbr_nhg_low_table
;
43 static uint32_t pbr_nhg_high_table
;
44 static uint32_t pbr_nhg_low_rule
;
45 static uint32_t pbr_nhg_high_rule
;
46 static bool nhg_tableid
[65535];
48 static void pbr_nht_install_nexthop_group(struct pbr_nexthop_group_cache
*pnhgc
,
49 struct nexthop_group nhg
);
51 pbr_nht_uninstall_nexthop_group(struct pbr_nexthop_group_cache
*pnhgc
,
52 struct nexthop_group nhg
,
53 enum nexthop_types_t nh_afi
);
59 struct nexthop nexthop
;
60 unsigned int refcount
;
63 /* Hash functions for pbr_nhrc_hash ---------------------------------------- */
65 static void *pbr_nhrc_hash_alloc(void *p
)
67 struct nhrc
*nhrc
= XCALLOC(MTYPE_PBR_NHG
, sizeof(struct nhrc
));
68 nhrc
->nexthop
= *(struct nexthop
*)p
;
72 static int pbr_nhrc_hash_equal(const void *arg1
, const void *arg2
)
74 const struct nexthop
*nh1
, *nh2
;
79 return nexthop_same(nh1
, nh2
);
82 /* ------------------------------------------------------------------------- */
84 static void *pbr_nh_alloc(void *p
)
86 struct pbr_nexthop_cache
*new;
87 struct pbr_nexthop_cache
*pnhc
= (struct pbr_nexthop_cache
*)p
;
90 new = XCALLOC(MTYPE_PBR_NHG
, sizeof(*new));
91 nhrc
= hash_get(pbr_nhrc_hash
, pnhc
->nexthop
, pbr_nhrc_hash_alloc
);
92 new->nexthop
= &nhrc
->nexthop
;
94 /* Decremented again in pbr_nh_delete */
97 DEBUGD(&pbr_dbg_nht
, "%s: Sending nexthop to Zebra",
100 pbr_send_rnh(new->nexthop
, true);
106 static void pbr_nh_delete(struct pbr_nexthop_cache
**pnhc
)
110 nhrc
= hash_lookup(pbr_nhrc_hash
, (*pnhc
)->nexthop
);
114 if (!nhrc
|| nhrc
->refcount
== 0) {
115 DEBUGD(&pbr_dbg_nht
, "%s: Removing nexthop from Zebra",
116 __PRETTY_FUNCTION__
);
117 pbr_send_rnh((*pnhc
)->nexthop
, false);
119 if (nhrc
&& nhrc
->refcount
== 0) {
120 hash_release(pbr_nhrc_hash
, nhrc
);
121 XFREE(MTYPE_PBR_NHG
, nhrc
);
124 XFREE(MTYPE_PBR_NHG
, *pnhc
);
127 static void pbr_nh_delete_iterate(struct hash_backet
*b
, void *p
)
129 pbr_nh_delete((struct pbr_nexthop_cache
**)&b
->data
);
132 static uint32_t pbr_nh_hash_key(void *arg
)
135 struct pbr_nexthop_cache
*pbrnc
= (struct pbr_nexthop_cache
*)arg
;
137 key
= nexthop_hash(pbrnc
->nexthop
);
142 static int pbr_nh_hash_equal(const void *arg1
, const void *arg2
)
144 const struct pbr_nexthop_cache
*pbrnc1
=
145 (const struct pbr_nexthop_cache
*)arg1
;
146 const struct pbr_nexthop_cache
*pbrnc2
=
147 (const struct pbr_nexthop_cache
*)arg2
;
149 if (pbrnc1
->nexthop
->vrf_id
!= pbrnc2
->nexthop
->vrf_id
)
152 if (pbrnc1
->nexthop
->ifindex
!= pbrnc2
->nexthop
->ifindex
)
155 if (pbrnc1
->nexthop
->type
!= pbrnc2
->nexthop
->type
)
158 switch (pbrnc1
->nexthop
->type
) {
159 case NEXTHOP_TYPE_IFINDEX
:
161 case NEXTHOP_TYPE_IPV4_IFINDEX
:
162 case NEXTHOP_TYPE_IPV4
:
163 return pbrnc1
->nexthop
->gate
.ipv4
.s_addr
164 == pbrnc2
->nexthop
->gate
.ipv4
.s_addr
;
165 case NEXTHOP_TYPE_IPV6_IFINDEX
:
166 case NEXTHOP_TYPE_IPV6
:
167 return !memcmp(&pbrnc1
->nexthop
->gate
.ipv6
,
168 &pbrnc2
->nexthop
->gate
.ipv6
, 16);
169 case NEXTHOP_TYPE_BLACKHOLE
:
170 return pbrnc1
->nexthop
->bh_type
== pbrnc2
->nexthop
->bh_type
;
174 * We should not get here
179 static void pbr_nhgc_delete(struct pbr_nexthop_group_cache
*p
)
181 hash_iterate(p
->nhh
, pbr_nh_delete_iterate
, NULL
);
183 XFREE(MTYPE_PBR_NHG
, p
);
186 static void *pbr_nhgc_alloc(void *p
)
188 struct pbr_nexthop_group_cache
*new;
189 struct pbr_nexthop_group_cache
*pnhgc
=
190 (struct pbr_nexthop_group_cache
*)p
;
192 new = XCALLOC(MTYPE_PBR_NHG
, sizeof(*new));
194 strcpy(new->name
, pnhgc
->name
);
195 new->table_id
= pbr_nht_get_next_tableid();
197 DEBUGD(&pbr_dbg_nht
, "%s: NHT: %s assigned Table ID: %u",
198 __PRETTY_FUNCTION__
, new->name
, new->table_id
);
200 new->nhh
= hash_create_size(8, pbr_nh_hash_key
, pbr_nh_hash_equal
,
201 "PBR NH Cache Hash");
206 void pbr_nhgroup_add_cb(const char *name
)
208 struct pbr_nexthop_group_cache
*pnhgc
;
209 struct nexthop_group_cmd
*nhgc
;
211 nhgc
= nhgc_find(name
);
212 pnhgc
= pbr_nht_add_group(name
);
214 DEBUGD(&pbr_dbg_nht
, "%s: Added nexthop-group %s", __PRETTY_FUNCTION__
,
217 pbr_nht_install_nexthop_group(pnhgc
, nhgc
->nhg
);
218 pbr_map_check_nh_group_change(name
);
221 void pbr_nhgroup_add_nexthop_cb(const struct nexthop_group_cmd
*nhgc
,
222 const struct nexthop
*nhop
)
225 struct pbr_nexthop_group_cache pnhgc_find
= {};
226 struct pbr_nexthop_group_cache
*pnhgc
;
227 struct pbr_nexthop_cache pnhc_find
= {};
228 struct pbr_nexthop_cache
*pnhc
;
230 /* find pnhgc by name */
231 strlcpy(pnhgc_find
.name
, nhgc
->name
, sizeof(pnhgc_find
.name
));
232 pnhgc
= hash_get(pbr_nhg_hash
, &pnhgc_find
, pbr_nhgc_alloc
);
234 /* create & insert new pnhc into pnhgc->nhh */
235 pnhc_find
.nexthop
= (struct nexthop
*)nhop
;
236 pnhc
= hash_get(pnhgc
->nhh
, &pnhc_find
, pbr_nh_alloc
);
237 pnhc_find
.nexthop
= NULL
;
239 /* set parent pnhgc */
240 pnhc
->parent
= pnhgc
;
242 if (DEBUG_MODE_CHECK(&pbr_dbg_nht
, DEBUG_MODE_ALL
)) {
243 nexthop2str(nhop
, debugstr
, sizeof(debugstr
));
244 DEBUGD(&pbr_dbg_nht
, "%s: Added %s to nexthop-group %s",
245 __PRETTY_FUNCTION__
, debugstr
, nhgc
->name
);
248 pbr_nht_install_nexthop_group(pnhgc
, nhgc
->nhg
);
249 pbr_map_check_nh_group_change(nhgc
->name
);
252 void pbr_nhgroup_del_nexthop_cb(const struct nexthop_group_cmd
*nhgc
,
253 const struct nexthop
*nhop
)
256 struct pbr_nexthop_group_cache pnhgc_find
= {};
257 struct pbr_nexthop_group_cache
*pnhgc
;
258 struct pbr_nexthop_cache pnhc_find
= {};
259 struct pbr_nexthop_cache
*pnhc
;
260 enum nexthop_types_t nh_afi
= nhop
->type
;
262 /* find pnhgc by name */
263 strlcpy(pnhgc_find
.name
, nhgc
->name
, sizeof(pnhgc_find
.name
));
264 pnhgc
= hash_get(pbr_nhg_hash
, &pnhgc_find
, pbr_nhgc_alloc
);
266 /* delete pnhc from pnhgc->nhh */
267 pnhc_find
.nexthop
= (struct nexthop
*)nhop
;
268 pnhc
= hash_release(pnhgc
->nhh
, &pnhc_find
);
271 pbr_nh_delete(&pnhc
);
273 if (DEBUG_MODE_CHECK(&pbr_dbg_nht
, DEBUG_MODE_ALL
)) {
274 nexthop2str(nhop
, debugstr
, sizeof(debugstr
));
275 DEBUGD(&pbr_dbg_nht
, "%s: Removed %s from nexthop-group %s",
276 __PRETTY_FUNCTION__
, debugstr
, nhgc
->name
);
279 if (pnhgc
->nhh
->count
)
280 pbr_nht_install_nexthop_group(pnhgc
, nhgc
->nhg
);
282 pbr_nht_uninstall_nexthop_group(pnhgc
, nhgc
->nhg
, nh_afi
);
284 pbr_map_check_nh_group_change(nhgc
->name
);
287 void pbr_nhgroup_delete_cb(const char *name
)
289 DEBUGD(&pbr_dbg_nht
, "%s: Removed nexthop-group %s",
290 __PRETTY_FUNCTION__
, name
);
292 /* delete group from all pbrms's */
293 pbr_nht_delete_group(name
);
295 pbr_map_check_nh_group_change(name
);
299 static struct pbr_nexthop_cache
*pbr_nht_lookup_nexthop(struct nexthop
*nexthop
)
305 static void pbr_nht_find_nhg_from_table_install(struct hash_backet
*b
,
308 struct pbr_nexthop_group_cache
*pnhgc
=
309 (struct pbr_nexthop_group_cache
*)b
->data
;
310 uint32_t *table_id
= (uint32_t *)data
;
312 if (pnhgc
->table_id
== *table_id
) {
313 DEBUGD(&pbr_dbg_nht
, "%s: Table ID (%u) matches %s",
314 __PRETTY_FUNCTION__
, *table_id
, pnhgc
->name
);
315 pnhgc
->installed
= true;
316 pbr_map_schedule_policy_from_nhg(pnhgc
->name
);
320 void pbr_nht_route_installed_for_table(uint32_t table_id
)
322 hash_iterate(pbr_nhg_hash
, pbr_nht_find_nhg_from_table_install
,
326 static void pbr_nht_find_nhg_from_table_remove(struct hash_backet
*b
,
332 void pbr_nht_route_removed_for_table(uint32_t table_id
)
334 hash_iterate(pbr_nhg_hash
, pbr_nht_find_nhg_from_table_remove
,
339 * Loop through all nexthops in a nexthop group to check that they are all the
340 * same. If they are not all the same, log this peculiarity.
343 * The nexthop group to check
346 * - AFI of last nexthop in the group
349 static afi_t
pbr_nht_which_afi(struct nexthop_group nhg
,
350 enum nexthop_types_t nh_afi
)
352 struct nexthop
*nexthop
;
353 afi_t install_afi
= AFI_MAX
;
356 v6
= v4
= bh
= false;
359 for (ALL_NEXTHOPS(nhg
, nexthop
)) {
360 nh_afi
= nexthop
->type
;
366 case NEXTHOP_TYPE_IFINDEX
:
368 case NEXTHOP_TYPE_IPV4
:
369 case NEXTHOP_TYPE_IPV4_IFINDEX
:
371 install_afi
= AFI_IP
;
373 case NEXTHOP_TYPE_IPV6
:
374 case NEXTHOP_TYPE_IPV6_IFINDEX
:
376 install_afi
= AFI_IP6
;
378 case NEXTHOP_TYPE_BLACKHOLE
:
380 install_afi
= AFI_MAX
;
386 "%s: Saw both V6 and V4 nexthops...using %s",
387 __PRETTY_FUNCTION__
, afi2str(install_afi
));
388 if (bh
&& (v6
|| v4
))
390 "%s: Saw blackhole nexthop(s) with %s%s%s nexthop(s), using AFI_MAX.",
391 __PRETTY_FUNCTION__
, v4
? "v4" : "",
392 (v4
&& v6
) ? " and " : "", v6
? "v6" : "");
397 static void pbr_nht_install_nexthop_group(struct pbr_nexthop_group_cache
*pnhgc
,
398 struct nexthop_group nhg
)
401 enum nexthop_types_t nh_afi
= 0;
403 install_afi
= pbr_nht_which_afi(nhg
, nh_afi
);
405 pnhgc
->installed
= false;
407 route_add(pnhgc
, nhg
, install_afi
);
411 pbr_nht_uninstall_nexthop_group(struct pbr_nexthop_group_cache
*pnhgc
,
412 struct nexthop_group nhg
,
413 enum nexthop_types_t nh_afi
)
417 install_afi
= pbr_nht_which_afi(nhg
, nh_afi
);
419 pnhgc
->installed
= false;
420 pnhgc
->valid
= false;
421 route_delete(pnhgc
, install_afi
);
424 void pbr_nht_change_group(const char *name
)
426 struct nexthop_group_cmd
*nhgc
;
427 struct pbr_nexthop_group_cache
*pnhgc
;
428 struct pbr_nexthop_group_cache find
;
429 struct nexthop
*nhop
;
431 nhgc
= nhgc_find(name
);
435 memset(&find
, 0, sizeof(find
));
436 strcpy(find
.name
, name
);
437 pnhgc
= hash_lookup(pbr_nhg_hash
, &find
);
441 "%s: Could not find nexthop-group cache w/ name '%s'",
442 __PRETTY_FUNCTION__
, name
);
446 for (ALL_NEXTHOPS(nhgc
->nhg
, nhop
)) {
447 struct pbr_nexthop_cache lookup
;
448 struct pbr_nexthop_cache
*pnhc
;
450 lookup
.nexthop
= nhop
;
451 pnhc
= hash_lookup(pnhgc
->nhh
, &lookup
);
453 pnhc
= hash_get(pnhgc
->nhh
, &lookup
, pbr_nh_alloc
);
454 pnhc
->parent
= pnhgc
;
457 pbr_nht_install_nexthop_group(pnhgc
, nhgc
->nhg
);
460 char *pbr_nht_nexthop_make_name(char *name
, size_t l
,
461 uint32_t seqno
, char *buffer
)
463 snprintf(buffer
, l
, "%s%u", name
, seqno
);
467 void pbr_nht_add_individual_nexthop(struct pbr_map_sequence
*pbrms
)
469 struct pbr_nexthop_group_cache
*pnhgc
;
470 struct pbr_nexthop_group_cache find
;
471 struct pbr_nexthop_cache
*pnhc
;
472 struct pbr_nexthop_cache lookup
;
474 memset(&find
, 0, sizeof(find
));
475 pbr_nht_nexthop_make_name(pbrms
->parent
->name
, PBR_MAP_NAMELEN
,
476 pbrms
->seqno
, find
.name
);
477 if (!pbrms
->internal_nhg_name
)
478 pbrms
->internal_nhg_name
= XSTRDUP(MTYPE_TMP
, find
.name
);
480 pnhgc
= hash_get(pbr_nhg_hash
, &find
, pbr_nhgc_alloc
);
482 lookup
.nexthop
= pbrms
->nhg
->nexthop
;
483 pnhc
= hash_get(pnhgc
->nhh
, &lookup
, pbr_nh_alloc
);
484 pnhc
->parent
= pnhgc
;
485 pbr_nht_install_nexthop_group(pnhgc
, *pbrms
->nhg
);
488 void pbr_nht_delete_individual_nexthop(struct pbr_map_sequence
*pbrms
)
490 struct pbr_nexthop_group_cache
*pnhgc
;
491 struct pbr_nexthop_group_cache find
;
492 struct pbr_nexthop_cache
*pnhc
;
493 struct pbr_nexthop_cache lup
;
494 struct pbr_map
*pbrm
= pbrms
->parent
;
495 struct listnode
*node
;
496 struct pbr_map_interface
*pmi
;
498 enum nexthop_types_t nh_afi
= 0;
500 if (pbrm
->valid
&& pbrms
->nhs_installed
&& pbrm
->incoming
->count
) {
501 for (ALL_LIST_ELEMENTS_RO(pbrm
->incoming
, node
, pmi
))
502 pbr_send_pbr_map(pbrms
, pmi
, false);
506 pbrms
->nhs_installed
= false;
507 pbrms
->installed
= false;
508 pbrms
->reason
|= PBR_MAP_INVALID_NO_NEXTHOPS
;
510 memset(&find
, 0, sizeof(find
));
511 strcpy(&find
.name
[0], pbrms
->internal_nhg_name
);
512 pnhgc
= hash_lookup(pbr_nhg_hash
, &find
);
514 nh
= pbrms
->nhg
->nexthop
;
517 pnhc
= hash_lookup(pnhgc
->nhh
, &lup
);
519 hash_release(pnhgc
->nhh
, pnhc
);
520 pbr_nh_delete(&pnhc
);
521 pbr_nht_uninstall_nexthop_group(pnhgc
, *pbrms
->nhg
, nh_afi
);
523 hash_release(pbr_nhg_hash
, pnhgc
);
525 nexthop_del(pbrms
->nhg
, nh
);
527 nexthop_group_delete(&pbrms
->nhg
);
528 XFREE(MTYPE_TMP
, pbrms
->internal_nhg_name
);
531 struct pbr_nexthop_group_cache
*pbr_nht_add_group(const char *name
)
533 struct nexthop
*nhop
;
534 struct nexthop_group_cmd
*nhgc
;
535 struct pbr_nexthop_group_cache
*pnhgc
;
536 struct pbr_nexthop_group_cache lookup
;
538 nhgc
= nhgc_find(name
);
541 zlog_warn("%s: Could not find group %s to add",
542 __PRETTY_FUNCTION__
, name
);
546 strcpy(lookup
.name
, name
);
547 pnhgc
= hash_get(pbr_nhg_hash
, &lookup
, pbr_nhgc_alloc
);
548 DEBUGD(&pbr_dbg_nht
, "%s: Retrieved NHGC @ %p", __PRETTY_FUNCTION__
,
551 for (ALL_NEXTHOPS(nhgc
->nhg
, nhop
)) {
552 struct pbr_nexthop_cache lookup
;
553 struct pbr_nexthop_cache
*pnhc
;
555 lookup
.nexthop
= nhop
;
556 pnhc
= hash_lookup(pnhgc
->nhh
, &lookup
);
558 pnhc
= hash_get(pnhgc
->nhh
, &lookup
, pbr_nh_alloc
);
559 pnhc
->parent
= pnhgc
;
566 void pbr_nht_delete_group(const char *name
)
568 struct pbr_map_sequence
*pbrms
;
569 struct listnode
*snode
;
570 struct pbr_map
*pbrm
;
571 struct pbr_nexthop_group_cache pnhgc_find
;
572 struct pbr_nexthop_group_cache
*pnhgc
;
574 RB_FOREACH (pbrm
, pbr_map_entry_head
, &pbr_maps
) {
575 for (ALL_LIST_ELEMENTS_RO(pbrm
->seqnumbers
, snode
, pbrms
)) {
576 if (pbrms
->nhgrp_name
577 && strmatch(pbrms
->nhgrp_name
, name
)) {
578 pbrms
->reason
|= PBR_MAP_INVALID_NO_NEXTHOPS
;
579 nexthop_group_delete(&pbrms
->nhg
);
581 pbrms
->internal_nhg_name
= NULL
;
587 strlcpy(pnhgc_find
.name
, name
, sizeof(pnhgc_find
.name
));
588 pnhgc
= hash_release(pbr_nhg_hash
, &pnhgc_find
);
589 pbr_nhgc_delete(pnhgc
);
592 bool pbr_nht_nexthop_valid(struct nexthop_group
*nhg
)
594 DEBUGD(&pbr_dbg_nht
, "%s: %p", __PRETTY_FUNCTION__
, nhg
);
598 bool pbr_nht_nexthop_group_valid(const char *name
)
600 struct pbr_nexthop_group_cache
*pnhgc
;
601 struct pbr_nexthop_group_cache lookup
;
603 DEBUGD(&pbr_dbg_nht
, "%s: %s", __PRETTY_FUNCTION__
, name
);
605 strcpy(lookup
.name
, name
);
606 pnhgc
= hash_get(pbr_nhg_hash
, &lookup
, NULL
);
609 DEBUGD(&pbr_dbg_nht
, "%s: \t%d %d", __PRETTY_FUNCTION__
, pnhgc
->valid
,
611 if (pnhgc
->valid
&& pnhgc
->installed
)
617 struct pbr_nht_individual
{
618 struct zapi_route
*nhr
;
623 static void pbr_nht_individual_nexthop_update_lookup(struct hash_backet
*b
,
626 struct pbr_nexthop_cache
*pnhc
= b
->data
;
627 struct pbr_nht_individual
*pnhi
= data
;
628 char buf
[PREFIX_STRLEN
];
631 old_valid
= pnhc
->valid
;
633 switch (pnhi
->nhr
->prefix
.family
) {
635 if (pnhc
->nexthop
->gate
.ipv4
.s_addr
636 == pnhi
->nhr
->prefix
.u
.prefix4
.s_addr
)
637 pnhc
->valid
= !!pnhi
->nhr
->nexthop_num
;
640 if (memcmp(&pnhc
->nexthop
->gate
.ipv6
,
641 &pnhi
->nhr
->prefix
.u
.prefix6
, 16)
643 pnhc
->valid
= !!pnhi
->nhr
->nexthop_num
;
647 DEBUGD(&pbr_dbg_nht
, "\tFound %s: old: %d new: %d",
648 prefix2str(&pnhi
->nhr
->prefix
, buf
, sizeof(buf
)), old_valid
,
655 static void pbr_nht_nexthop_update_lookup(struct hash_backet
*b
, void *data
)
657 struct pbr_nexthop_group_cache
*pnhgc
= b
->data
;
658 struct pbr_nht_individual pnhi
;
661 old_valid
= pnhgc
->valid
;
663 pnhi
.nhr
= (struct zapi_route
*)data
;
665 hash_iterate(pnhgc
->nhh
, pbr_nht_individual_nexthop_update_lookup
,
669 * If any of the specified nexthops are valid we are valid
671 pnhgc
->valid
= !!pnhi
.valid
;
673 if (old_valid
!= pnhgc
->valid
)
674 pbr_map_check_nh_group_change(pnhgc
->name
);
677 void pbr_nht_nexthop_update(struct zapi_route
*nhr
)
679 hash_iterate(pbr_nhg_hash
, pbr_nht_nexthop_update_lookup
, nhr
);
682 static uint32_t pbr_nhg_hash_key(void *arg
)
684 struct pbr_nexthop_group_cache
*nhgc
=
685 (struct pbr_nexthop_group_cache
*)arg
;
687 return jhash(&nhgc
->name
, strlen(nhgc
->name
), 0x52c34a96);
690 static int pbr_nhg_hash_equal(const void *arg1
, const void *arg2
)
692 const struct pbr_nexthop_group_cache
*nhgc1
=
693 (const struct pbr_nexthop_group_cache
*)arg1
;
694 const struct pbr_nexthop_group_cache
*nhgc2
=
695 (const struct pbr_nexthop_group_cache
*)arg2
;
697 return !strcmp(nhgc1
->name
, nhgc2
->name
);
701 uint32_t pbr_nht_get_next_tableid(void)
706 for (i
= pbr_nhg_low_table
; i
<= pbr_nhg_high_table
; i
++) {
707 if (nhg_tableid
[i
] == false) {
714 nhg_tableid
[i
] = true;
720 void pbr_nht_set_tableid_range(uint32_t low
, uint32_t high
)
722 pbr_nhg_low_table
= low
;
723 pbr_nhg_high_table
= high
;
726 void pbr_nht_write_table_range(struct vty
*vty
)
728 if (pbr_nhg_low_table
!= PBR_NHT_DEFAULT_LOW_TABLEID
729 || pbr_nhg_high_table
!= PBR_NHT_DEFAULT_HIGH_TABLEID
) {
730 vty_out(vty
, "pbr table range %u %u\n", pbr_nhg_low_table
,
735 uint32_t pbr_nht_get_next_rule(uint32_t seqno
)
737 return seqno
+ pbr_nhg_low_rule
- 1;
739 void pbr_nht_set_rule_range(uint32_t low
, uint32_t high
)
741 pbr_nhg_low_rule
= low
;
742 pbr_nhg_high_rule
= high
;
745 void pbr_nht_write_rule_range(struct vty
*vty
)
747 if (pbr_nhg_low_rule
!= PBR_NHT_DEFAULT_LOW_RULE
748 || pbr_nhg_high_rule
!= PBR_NHT_DEFAULT_HIGH_RULE
) {
749 vty_out(vty
, "pbr rule range %u %u\n", pbr_nhg_low_rule
,
754 uint32_t pbr_nht_get_table(const char *name
)
756 struct pbr_nexthop_group_cache find
;
757 struct pbr_nexthop_group_cache
*pnhgc
;
759 memset(&find
, 0, sizeof(find
));
760 strcpy(find
.name
, name
);
761 pnhgc
= hash_lookup(pbr_nhg_hash
, &find
);
765 "%s: Could not find nexthop-group cache w/ name '%s'",
766 __PRETTY_FUNCTION__
, name
);
770 return pnhgc
->table_id
;
773 bool pbr_nht_get_installed(const char *name
)
775 struct pbr_nexthop_group_cache find
;
776 struct pbr_nexthop_group_cache
*pnhgc
;
778 memset(&find
, 0, sizeof(find
));
779 strcpy(find
.name
, name
);
781 pnhgc
= hash_lookup(pbr_nhg_hash
, &find
);
786 return pnhgc
->installed
;
789 static void pbr_nht_show_nhg_nexthops(struct hash_backet
*b
, void *data
)
791 struct pbr_nexthop_cache
*pnhc
= b
->data
;
792 struct vty
*vty
= data
;
794 vty_out(vty
, "\tValid: %d ", pnhc
->valid
);
795 nexthop_group_write_nexthop(vty
, pnhc
->nexthop
);
798 struct pbr_nht_show
{
803 static void pbr_nht_show_nhg(struct hash_backet
*b
, void *data
)
805 struct pbr_nexthop_group_cache
*pnhgc
= b
->data
;
806 struct pbr_nht_show
*pns
= data
;
809 if (pns
->name
&& strcmp(pns
->name
, pnhgc
->name
) != 0)
813 vty_out(vty
, "Nexthop-Group: %s Table: %u Valid: %d Installed: %d\n",
814 pnhgc
->name
, pnhgc
->table_id
, pnhgc
->valid
, pnhgc
->installed
);
816 hash_iterate(pnhgc
->nhh
, pbr_nht_show_nhg_nexthops
, vty
);
819 void pbr_nht_show_nexthop_group(struct vty
*vty
, const char *name
)
821 struct pbr_nht_show pns
;
826 hash_iterate(pbr_nhg_hash
, pbr_nht_show_nhg
, &pns
);
829 void pbr_nht_init(void)
831 pbr_nhg_hash
= hash_create_size(
832 16, pbr_nhg_hash_key
, pbr_nhg_hash_equal
, "PBR NHG Cache Hash");
834 hash_create_size(16, (unsigned int (*)(void *))nexthop_hash
,
835 pbr_nhrc_hash_equal
, "PBR NH Hash");
837 pbr_nhg_low_table
= PBR_NHT_DEFAULT_LOW_TABLEID
;
838 pbr_nhg_high_table
= PBR_NHT_DEFAULT_HIGH_TABLEID
;
839 pbr_nhg_low_rule
= PBR_NHT_DEFAULT_LOW_RULE
;
840 pbr_nhg_high_rule
= PBR_NHT_DEFAULT_HIGH_RULE
;
841 memset(&nhg_tableid
, 0, 65535 * sizeof(uint8_t));