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"
33 struct zebra_router zrouter
;
36 zebra_router_table_entry_compare(const struct zebra_router_table
*e1
,
37 const struct zebra_router_table
*e2
);
39 RB_GENERATE(zebra_router_table_head
, zebra_router_table
,
40 zebra_router_table_entry
, zebra_router_table_entry_compare
);
44 zebra_router_table_entry_compare(const struct zebra_router_table
*e1
,
45 const struct zebra_router_table
*e2
)
47 if (e1
->tableid
< e2
->tableid
)
49 if (e1
->tableid
> e2
->tableid
)
51 if (e1
->ns_id
< e2
->ns_id
)
53 if (e1
->ns_id
> e2
->ns_id
)
55 if (e1
->afi
< e2
->afi
)
57 if (e1
->afi
> e2
->afi
)
59 return (e1
->safi
- e2
->safi
);
63 struct route_table
*zebra_router_find_table(struct zebra_vrf
*zvrf
,
64 uint32_t tableid
, afi_t afi
,
67 struct zebra_router_table finder
;
68 struct zebra_router_table
*zrt
;
70 memset(&finder
, 0, sizeof(finder
));
73 finder
.tableid
= tableid
;
74 finder
.ns_id
= zvrf
->zns
->ns_id
;
75 zrt
= RB_FIND(zebra_router_table_head
, &zrouter
.tables
, &finder
);
83 struct route_table
*zebra_router_get_table(struct zebra_vrf
*zvrf
,
84 uint32_t tableid
, afi_t afi
,
87 struct zebra_router_table finder
;
88 struct zebra_router_table
*zrt
;
89 rib_table_info_t
*info
;
91 memset(&finder
, 0, sizeof(finder
));
94 finder
.tableid
= tableid
;
95 finder
.ns_id
= zvrf
->zns
->ns_id
;
96 zrt
= RB_FIND(zebra_router_table_head
, &zrouter
.tables
, &finder
);
101 zrt
= XCALLOC(MTYPE_ZEBRA_NS
, sizeof(*zrt
));
102 zrt
->tableid
= tableid
;
105 zrt
->ns_id
= zvrf
->zns
->ns_id
;
107 (afi
== AFI_IP6
) ? srcdest_table_init() : route_table_init();
109 info
= XCALLOC(MTYPE_RIB_TABLE_INFO
, sizeof(*info
));
113 route_table_set_info(zrt
->table
, info
);
114 zrt
->table
->cleanup
= zebra_rtable_node_cleanup
;
116 RB_INSERT(zebra_router_table_head
, &zrouter
.tables
, zrt
);
120 unsigned long zebra_router_score_proto(uint8_t proto
, unsigned short instance
)
122 struct zebra_router_table
*zrt
;
123 unsigned long cnt
= 0;
125 RB_FOREACH (zrt
, zebra_router_table_head
, &zrouter
.tables
) {
126 if (zrt
->ns_id
!= NS_DEFAULT
)
128 cnt
+= rib_score_proto_table(proto
, instance
, zrt
->table
);
133 void zebra_router_show_table_summary(struct vty
*vty
)
135 struct zebra_router_table
*zrt
;
138 "VRF NS ID VRF ID AFI SAFI Table Count\n");
140 "---------------------------------------------------------------------------\n");
141 RB_FOREACH (zrt
, zebra_router_table_head
, &zrouter
.tables
) {
142 rib_table_info_t
*info
= route_table_get_info(zrt
->table
);
144 vty_out(vty
, "%-16s%5d %9d %7s %15s %8d %10lu\n", info
->zvrf
->vrf
->name
,
145 zrt
->ns_id
, info
->zvrf
->vrf
->vrf_id
,
146 afi2str(zrt
->afi
), safi2str(zrt
->safi
),
152 void zebra_router_sweep_route(void)
154 struct zebra_router_table
*zrt
;
156 RB_FOREACH (zrt
, zebra_router_table_head
, &zrouter
.tables
) {
157 if (zrt
->ns_id
!= NS_DEFAULT
)
159 rib_sweep_table(zrt
->table
);
163 static void zebra_router_free_table(struct zebra_router_table
*zrt
)
167 rib_close_table(zrt
->table
);
169 table_info
= route_table_get_info(zrt
->table
);
170 route_table_finish(zrt
->table
);
171 XFREE(MTYPE_RIB_TABLE_INFO
, table_info
);
172 XFREE(MTYPE_ZEBRA_NS
, zrt
);
175 uint32_t zebra_router_get_next_sequence(void)
178 + atomic_fetch_add_explicit(&zrouter
.sequence_num
, 1,
179 memory_order_relaxed
);
182 void zebra_router_terminate(void)
184 struct zebra_router_table
*zrt
, *tmp
;
186 RB_FOREACH_SAFE (zrt
, zebra_router_table_head
, &zrouter
.tables
, tmp
) {
187 RB_REMOVE(zebra_router_table_head
, &zrouter
.tables
, zrt
);
188 zebra_router_free_table(zrt
);
191 work_queue_free_and_null(&zrouter
.ribq
);
192 meta_queue_free(zrouter
.mq
);
194 zebra_vxlan_disable();
195 zebra_mlag_terminate();
197 hash_clean(zrouter
.rules_hash
, zebra_pbr_rules_free
);
198 hash_free(zrouter
.rules_hash
);
200 hash_clean(zrouter
.ipset_entry_hash
, zebra_pbr_ipset_entry_free
),
201 hash_clean(zrouter
.ipset_hash
, zebra_pbr_ipset_free
);
202 hash_free(zrouter
.ipset_hash
);
203 hash_free(zrouter
.ipset_entry_hash
);
204 hash_clean(zrouter
.iptable_hash
, zebra_pbr_iptable_free
);
205 hash_free(zrouter
.iptable_hash
);
208 void zebra_router_init(void)
210 zrouter
.sequence_num
= 0;
212 zrouter
.rtm_table_default
= 0;
213 zrouter
.packets_to_process
= ZEBRA_ZAPI_PACKETS_TO_PROCESS
;
218 zrouter
.rules_hash
= hash_create_size(8, zebra_pbr_rules_hash_key
,
219 zebra_pbr_rules_hash_equal
,
223 hash_create_size(8, zebra_pbr_ipset_hash_key
,
224 zebra_pbr_ipset_hash_equal
, "IPset Hash");
226 zrouter
.ipset_entry_hash
= hash_create_size(
227 8, zebra_pbr_ipset_entry_hash_key
,
228 zebra_pbr_ipset_entry_hash_equal
, "IPset Hash Entry");
230 zrouter
.iptable_hash
= hash_create_size(8, zebra_pbr_iptable_hash_key
,
231 zebra_pbr_iptable_hash_equal
,
232 "IPtable Hash Entry");