2 * Copyright (C) 2018 Cumulus Networks, Inc.
5 * This file is part of FRR.
7 * FRR is free software; you can redistribute it and/or modify it
8 * under the terms of the GNU General Public License as published by the
9 * Free Software Foundation; either version 2, or (at your option) any
12 * FRR is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License for more details.
17 * You should have received a copy of the GNU General Public License
18 * along with FRR; see the file COPYING. If not, write to the Free
19 * Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
25 #include "lib/frratomic.h"
27 #include "zebra_router.h"
28 #include "zebra_memory.h"
29 #include "zebra_pbr.h"
30 #include "zebra_vxlan.h"
31 #include "zebra_mlag.h"
32 #include "zebra_nhg.h"
35 struct zebra_router zrouter
= {
36 .multipath_num
= MULTIPATH_NUM
,
37 .ipv4_multicast_mode
= MCAST_NO_CONFIG
,
41 zebra_router_table_entry_compare(const struct zebra_router_table
*e1
,
42 const struct zebra_router_table
*e2
);
44 RB_GENERATE(zebra_router_table_head
, zebra_router_table
,
45 zebra_router_table_entry
, zebra_router_table_entry_compare
);
49 zebra_router_table_entry_compare(const struct zebra_router_table
*e1
,
50 const struct zebra_router_table
*e2
)
52 if (e1
->tableid
< e2
->tableid
)
54 if (e1
->tableid
> e2
->tableid
)
56 if (e1
->ns_id
< e2
->ns_id
)
58 if (e1
->ns_id
> e2
->ns_id
)
60 if (e1
->afi
< e2
->afi
)
62 if (e1
->afi
> e2
->afi
)
64 return (e1
->safi
- e2
->safi
);
68 struct route_table
*zebra_router_find_table(struct zebra_vrf
*zvrf
,
69 uint32_t tableid
, afi_t afi
,
72 struct zebra_router_table finder
;
73 struct zebra_router_table
*zrt
;
75 memset(&finder
, 0, sizeof(finder
));
78 finder
.tableid
= tableid
;
79 finder
.ns_id
= zvrf
->zns
->ns_id
;
80 zrt
= RB_FIND(zebra_router_table_head
, &zrouter
.tables
, &finder
);
88 struct route_table
*zebra_router_get_table(struct zebra_vrf
*zvrf
,
89 uint32_t tableid
, afi_t afi
,
92 struct zebra_router_table finder
;
93 struct zebra_router_table
*zrt
;
94 rib_table_info_t
*info
;
96 memset(&finder
, 0, sizeof(finder
));
99 finder
.tableid
= tableid
;
100 finder
.ns_id
= zvrf
->zns
->ns_id
;
101 zrt
= RB_FIND(zebra_router_table_head
, &zrouter
.tables
, &finder
);
106 zrt
= XCALLOC(MTYPE_ZEBRA_NS
, sizeof(*zrt
));
107 zrt
->tableid
= tableid
;
110 zrt
->ns_id
= zvrf
->zns
->ns_id
;
112 (afi
== AFI_IP6
) ? srcdest_table_init() : route_table_init();
114 info
= XCALLOC(MTYPE_RIB_TABLE_INFO
, sizeof(*info
));
118 route_table_set_info(zrt
->table
, info
);
119 zrt
->table
->cleanup
= zebra_rtable_node_cleanup
;
121 RB_INSERT(zebra_router_table_head
, &zrouter
.tables
, zrt
);
125 void zebra_router_show_table_summary(struct vty
*vty
)
127 struct zebra_router_table
*zrt
;
130 "VRF NS ID VRF ID AFI SAFI Table Count\n");
132 "---------------------------------------------------------------------------\n");
133 RB_FOREACH (zrt
, zebra_router_table_head
, &zrouter
.tables
) {
134 rib_table_info_t
*info
= route_table_get_info(zrt
->table
);
136 vty_out(vty
, "%-16s%5d %9d %7s %15s %8d %10lu\n", info
->zvrf
->vrf
->name
,
137 zrt
->ns_id
, info
->zvrf
->vrf
->vrf_id
,
138 afi2str(zrt
->afi
), safi2str(zrt
->safi
),
144 void zebra_router_sweep_route(void)
146 struct zebra_router_table
*zrt
;
148 RB_FOREACH (zrt
, zebra_router_table_head
, &zrouter
.tables
) {
149 if (zrt
->ns_id
!= NS_DEFAULT
)
151 rib_sweep_table(zrt
->table
);
155 static void zebra_router_free_table(struct zebra_router_table
*zrt
)
159 table_info
= route_table_get_info(zrt
->table
);
160 route_table_finish(zrt
->table
);
161 RB_REMOVE(zebra_router_table_head
, &zrouter
.tables
, zrt
);
163 XFREE(MTYPE_RIB_TABLE_INFO
, table_info
);
164 XFREE(MTYPE_ZEBRA_NS
, zrt
);
167 void zebra_router_release_table(struct zebra_vrf
*zvrf
, uint32_t tableid
,
168 afi_t afi
, safi_t safi
)
170 struct zebra_router_table finder
;
171 struct zebra_router_table
*zrt
;
173 memset(&finder
, 0, sizeof(finder
));
176 finder
.tableid
= tableid
;
177 finder
.ns_id
= zvrf
->zns
->ns_id
;
178 zrt
= RB_FIND(zebra_router_table_head
, &zrouter
.tables
, &finder
);
183 zebra_router_free_table(zrt
);
186 uint32_t zebra_router_get_next_sequence(void)
189 + atomic_fetch_add_explicit(&zrouter
.sequence_num
, 1,
190 memory_order_relaxed
);
193 void multicast_mode_ipv4_set(enum multicast_mode mode
)
195 if (IS_ZEBRA_DEBUG_RIB
)
196 zlog_debug("%s: multicast lookup mode set (%d)", __func__
,
198 zrouter
.ipv4_multicast_mode
= mode
;
201 enum multicast_mode
multicast_mode_ipv4_get(void)
203 return zrouter
.ipv4_multicast_mode
;
206 void zebra_router_terminate(void)
208 struct zebra_router_table
*zrt
, *tmp
;
210 RB_FOREACH_SAFE (zrt
, zebra_router_table_head
, &zrouter
.tables
, tmp
)
211 zebra_router_free_table(zrt
);
213 work_queue_free_and_null(&zrouter
.ribq
);
214 meta_queue_free(zrouter
.mq
);
216 zebra_vxlan_disable();
217 zebra_mlag_terminate();
219 hash_clean(zrouter
.rules_hash
, zebra_pbr_rules_free
);
220 hash_free(zrouter
.rules_hash
);
222 hash_clean(zrouter
.ipset_entry_hash
, zebra_pbr_ipset_entry_free
),
223 hash_clean(zrouter
.ipset_hash
, zebra_pbr_ipset_free
);
224 hash_free(zrouter
.ipset_hash
);
225 hash_free(zrouter
.ipset_entry_hash
);
226 hash_clean(zrouter
.iptable_hash
, zebra_pbr_iptable_free
);
227 hash_free(zrouter
.iptable_hash
);
230 void zebra_router_init(void)
232 zrouter
.sequence_num
= 0;
234 zrouter
.packets_to_process
= ZEBRA_ZAPI_PACKETS_TO_PROCESS
;
239 zrouter
.rules_hash
= hash_create_size(8, zebra_pbr_rules_hash_key
,
240 zebra_pbr_rules_hash_equal
,
244 hash_create_size(8, zebra_pbr_ipset_hash_key
,
245 zebra_pbr_ipset_hash_equal
, "IPset Hash");
247 zrouter
.ipset_entry_hash
= hash_create_size(
248 8, zebra_pbr_ipset_entry_hash_key
,
249 zebra_pbr_ipset_entry_hash_equal
, "IPset Hash Entry");
251 zrouter
.iptable_hash
= hash_create_size(8, zebra_pbr_iptable_hash_key
,
252 zebra_pbr_iptable_hash_equal
,
253 "IPtable Hash Entry");