1 /* SPDX-License-Identifier: BSD-3-Clause
2 * Copyright(c) 2018 Vladimir Medvedkin <medvedkinv@gmail.com>
3 * Copyright(c) 2019 Intel Corporation
10 #include <rte_eal_memconfig.h>
11 #include <rte_errno.h>
12 #include <rte_malloc.h>
13 #include <rte_rwlock.h>
14 #include <rte_string_fns.h>
15 #include <rte_tailq.h>
22 TAILQ_HEAD(rte_fib_list, rte_tailq_entry);
23 static struct rte_tailq_elem rte_fib_tailq = {
26 EAL_REGISTER_TAILQ(rte_fib_tailq)
28 /* Maximum length of a FIB name. */
29 #define RTE_FIB_NAMESIZE 64
31 #if defined(RTE_LIBRTE_FIB_DEBUG)
32 #define FIB_RETURN_IF_TRUE(cond, retval) do { \
37 #define FIB_RETURN_IF_TRUE(cond, retval)
41 char name[RTE_FIB_NAMESIZE];
42 enum rte_fib_type type; /**< Type of FIB struct */
43 struct rte_rib *rib; /**< RIB helper datastruct */
44 void *dp; /**< pointer to the dataplane struct*/
45 rte_fib_lookup_fn_t lookup; /**< fib lookup function */
46 rte_fib_modify_fn_t modify; /**< modify fib datastruct */
51 dummy_lookup(void *fib_p, const uint32_t *ips, uint64_t *next_hops,
55 struct rte_fib *fib = fib_p;
56 struct rte_rib_node *node;
58 for (i = 0; i < n; i++) {
59 node = rte_rib_lookup(fib->rib, ips[i]);
61 rte_rib_get_nh(node, &next_hops[i]);
63 next_hops[i] = fib->def_nh;
68 dummy_modify(struct rte_fib *fib, uint32_t ip, uint8_t depth,
69 uint64_t next_hop, int op)
71 struct rte_rib_node *node;
72 if ((fib == NULL) || (depth > RTE_FIB_MAXDEPTH))
75 node = rte_rib_lookup_exact(fib->rib, ip, depth);
80 node = rte_rib_insert(fib->rib, ip, depth);
83 return rte_rib_set_nh(node, next_hop);
87 rte_rib_remove(fib->rib, ip, depth);
94 init_dataplane(struct rte_fib *fib, __rte_unused int socket_id,
95 struct rte_fib_conf *conf)
97 char dp_name[sizeof(void *)];
99 snprintf(dp_name, sizeof(dp_name), "%p", fib);
100 switch (conf->type) {
103 fib->lookup = dummy_lookup;
104 fib->modify = dummy_modify;
106 case RTE_FIB_DIR24_8:
107 fib->dp = dir24_8_create(dp_name, socket_id, conf);
110 fib->lookup = dir24_8_get_lookup_fn(conf);
111 fib->modify = dir24_8_modify;
120 rte_fib_add(struct rte_fib *fib, uint32_t ip, uint8_t depth, uint64_t next_hop)
122 if ((fib == NULL) || (fib->modify == NULL) ||
123 (depth > RTE_FIB_MAXDEPTH))
125 return fib->modify(fib, ip, depth, next_hop, RTE_FIB_ADD);
129 rte_fib_delete(struct rte_fib *fib, uint32_t ip, uint8_t depth)
131 if ((fib == NULL) || (fib->modify == NULL) ||
132 (depth > RTE_FIB_MAXDEPTH))
134 return fib->modify(fib, ip, depth, 0, RTE_FIB_DEL);
138 rte_fib_lookup_bulk(struct rte_fib *fib, uint32_t *ips,
139 uint64_t *next_hops, int n)
141 FIB_RETURN_IF_TRUE(((fib == NULL) || (ips == NULL) ||
142 (next_hops == NULL) || (fib->lookup == NULL)), -EINVAL);
144 fib->lookup(fib->dp, ips, next_hops, n);
149 rte_fib_create(const char *name, int socket_id, struct rte_fib_conf *conf)
151 char mem_name[RTE_FIB_NAMESIZE];
153 struct rte_fib *fib = NULL;
154 struct rte_rib *rib = NULL;
155 struct rte_tailq_entry *te;
156 struct rte_fib_list *fib_list;
157 struct rte_rib_conf rib_conf;
159 /* Check user arguments. */
160 if ((name == NULL) || (conf == NULL) || (conf->max_routes < 0) ||
161 (conf->type >= RTE_FIB_TYPE_MAX)) {
167 rib_conf.max_nodes = conf->max_routes * 2;
169 rib = rte_rib_create(name, socket_id, &rib_conf);
172 "Can not allocate RIB %s\n", name);
176 snprintf(mem_name, sizeof(mem_name), "FIB_%s", name);
177 fib_list = RTE_TAILQ_CAST(rte_fib_tailq.head, rte_fib_list);
179 rte_mcfg_tailq_write_lock();
181 /* guarantee there's no existing */
182 TAILQ_FOREACH(te, fib_list, next) {
183 fib = (struct rte_fib *)te->data;
184 if (strncmp(name, fib->name, RTE_FIB_NAMESIZE) == 0)
193 /* allocate tailq entry */
194 te = rte_zmalloc("FIB_TAILQ_ENTRY", sizeof(*te), 0);
197 "Can not allocate tailq entry for FIB %s\n", name);
202 /* Allocate memory to store the FIB data structures. */
203 fib = rte_zmalloc_socket(mem_name,
204 sizeof(struct rte_fib), RTE_CACHE_LINE_SIZE, socket_id);
206 RTE_LOG(ERR, LPM, "FIB %s memory allocation failed\n", name);
211 rte_strlcpy(fib->name, name, sizeof(fib->name));
213 fib->type = conf->type;
214 fib->def_nh = conf->default_nh;
215 ret = init_dataplane(fib, socket_id, conf);
218 "FIB dataplane struct %s memory allocation failed "
219 "with err %d\n", name, ret);
224 te->data = (void *)fib;
225 TAILQ_INSERT_TAIL(fib_list, te, next);
227 rte_mcfg_tailq_write_unlock();
236 rte_mcfg_tailq_write_unlock();
243 rte_fib_find_existing(const char *name)
245 struct rte_fib *fib = NULL;
246 struct rte_tailq_entry *te;
247 struct rte_fib_list *fib_list;
249 fib_list = RTE_TAILQ_CAST(rte_fib_tailq.head, rte_fib_list);
251 rte_mcfg_tailq_read_lock();
252 TAILQ_FOREACH(te, fib_list, next) {
253 fib = (struct rte_fib *) te->data;
254 if (strncmp(name, fib->name, RTE_FIB_NAMESIZE) == 0)
257 rte_mcfg_tailq_read_unlock();
268 free_dataplane(struct rte_fib *fib)
273 case RTE_FIB_DIR24_8:
274 dir24_8_free(fib->dp);
281 rte_fib_free(struct rte_fib *fib)
283 struct rte_tailq_entry *te;
284 struct rte_fib_list *fib_list;
289 fib_list = RTE_TAILQ_CAST(rte_fib_tailq.head, rte_fib_list);
291 rte_mcfg_tailq_write_lock();
293 /* find our tailq entry */
294 TAILQ_FOREACH(te, fib_list, next) {
295 if (te->data == (void *)fib)
299 TAILQ_REMOVE(fib_list, te, next);
301 rte_mcfg_tailq_write_unlock();
304 rte_rib_free(fib->rib);
310 rte_fib_get_dp(struct rte_fib *fib)
312 return (fib == NULL) ? NULL : fib->dp;
316 rte_fib_get_rib(struct rte_fib *fib)
318 return (fib == NULL) ? NULL : fib->rib;