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>
20 TAILQ_HEAD(rte_fib_list, rte_tailq_entry);
21 static struct rte_tailq_elem rte_fib_tailq = {
24 EAL_REGISTER_TAILQ(rte_fib_tailq)
26 /* Maximum length of a FIB name. */
27 #define RTE_FIB_NAMESIZE 64
29 #if defined(RTE_LIBRTE_FIB_DEBUG)
30 #define FIB_RETURN_IF_TRUE(cond, retval) do { \
35 #define FIB_RETURN_IF_TRUE(cond, retval)
39 char name[RTE_FIB_NAMESIZE];
40 enum rte_fib_type type; /**< Type of FIB struct */
41 struct rte_rib *rib; /**< RIB helper datastruct */
42 void *dp; /**< pointer to the dataplane struct*/
43 rte_fib_lookup_fn_t lookup; /**< fib lookup function */
44 rte_fib_modify_fn_t modify; /**< modify fib datastruct */
49 dummy_lookup(void *fib_p, const uint32_t *ips, uint64_t *next_hops,
53 struct rte_fib *fib = fib_p;
54 struct rte_rib_node *node;
56 for (i = 0; i < n; i++) {
57 node = rte_rib_lookup(fib->rib, ips[i]);
59 rte_rib_get_nh(node, &next_hops[i]);
61 next_hops[i] = fib->def_nh;
66 dummy_modify(struct rte_fib *fib, uint32_t ip, uint8_t depth,
67 uint64_t next_hop, int op)
69 struct rte_rib_node *node;
70 if ((fib == NULL) || (depth > RTE_FIB_MAXDEPTH))
73 node = rte_rib_lookup_exact(fib->rib, ip, depth);
78 node = rte_rib_insert(fib->rib, ip, depth);
81 return rte_rib_set_nh(node, next_hop);
85 rte_rib_remove(fib->rib, ip, depth);
92 init_dataplane(struct rte_fib *fib, __rte_unused int socket_id,
93 struct rte_fib_conf *conf)
98 fib->lookup = dummy_lookup;
99 fib->modify = dummy_modify;
108 rte_fib_add(struct rte_fib *fib, uint32_t ip, uint8_t depth, uint64_t next_hop)
110 if ((fib == NULL) || (fib->modify == NULL) ||
111 (depth > RTE_FIB_MAXDEPTH))
113 return fib->modify(fib, ip, depth, next_hop, RTE_FIB_ADD);
117 rte_fib_delete(struct rte_fib *fib, uint32_t ip, uint8_t depth)
119 if ((fib == NULL) || (fib->modify == NULL) ||
120 (depth > RTE_FIB_MAXDEPTH))
122 return fib->modify(fib, ip, depth, 0, RTE_FIB_DEL);
126 rte_fib_lookup_bulk(struct rte_fib *fib, uint32_t *ips,
127 uint64_t *next_hops, int n)
129 FIB_RETURN_IF_TRUE(((fib == NULL) || (ips == NULL) ||
130 (next_hops == NULL) || (fib->lookup == NULL)), -EINVAL);
132 fib->lookup(fib->dp, ips, next_hops, n);
137 rte_fib_create(const char *name, int socket_id, struct rte_fib_conf *conf)
139 char mem_name[RTE_FIB_NAMESIZE];
141 struct rte_fib *fib = NULL;
142 struct rte_rib *rib = NULL;
143 struct rte_tailq_entry *te;
144 struct rte_fib_list *fib_list;
145 struct rte_rib_conf rib_conf;
147 /* Check user arguments. */
148 if ((name == NULL) || (conf == NULL) || (conf->max_routes < 0) ||
149 (conf->type >= RTE_FIB_TYPE_MAX)) {
155 rib_conf.max_nodes = conf->max_routes * 2;
157 rib = rte_rib_create(name, socket_id, &rib_conf);
160 "Can not allocate RIB %s\n", name);
164 snprintf(mem_name, sizeof(mem_name), "FIB_%s", name);
165 fib_list = RTE_TAILQ_CAST(rte_fib_tailq.head, rte_fib_list);
167 rte_mcfg_tailq_write_lock();
169 /* guarantee there's no existing */
170 TAILQ_FOREACH(te, fib_list, next) {
171 fib = (struct rte_fib *)te->data;
172 if (strncmp(name, fib->name, RTE_FIB_NAMESIZE) == 0)
181 /* allocate tailq entry */
182 te = rte_zmalloc("FIB_TAILQ_ENTRY", sizeof(*te), 0);
185 "Can not allocate tailq entry for FIB %s\n", name);
190 /* Allocate memory to store the FIB data structures. */
191 fib = rte_zmalloc_socket(mem_name,
192 sizeof(struct rte_fib), RTE_CACHE_LINE_SIZE, socket_id);
194 RTE_LOG(ERR, LPM, "FIB %s memory allocation failed\n", name);
199 rte_strlcpy(fib->name, name, sizeof(fib->name));
201 fib->type = conf->type;
202 fib->def_nh = conf->default_nh;
203 ret = init_dataplane(fib, socket_id, conf);
206 "FIB dataplane struct %s memory allocation failed "
207 "with err %d\n", name, ret);
212 te->data = (void *)fib;
213 TAILQ_INSERT_TAIL(fib_list, te, next);
215 rte_mcfg_tailq_write_unlock();
224 rte_mcfg_tailq_write_unlock();
231 rte_fib_find_existing(const char *name)
233 struct rte_fib *fib = NULL;
234 struct rte_tailq_entry *te;
235 struct rte_fib_list *fib_list;
237 fib_list = RTE_TAILQ_CAST(rte_fib_tailq.head, rte_fib_list);
239 rte_mcfg_tailq_read_lock();
240 TAILQ_FOREACH(te, fib_list, next) {
241 fib = (struct rte_fib *) te->data;
242 if (strncmp(name, fib->name, RTE_FIB_NAMESIZE) == 0)
245 rte_mcfg_tailq_read_unlock();
256 free_dataplane(struct rte_fib *fib)
267 rte_fib_free(struct rte_fib *fib)
269 struct rte_tailq_entry *te;
270 struct rte_fib_list *fib_list;
275 fib_list = RTE_TAILQ_CAST(rte_fib_tailq.head, rte_fib_list);
277 rte_mcfg_tailq_write_lock();
279 /* find our tailq entry */
280 TAILQ_FOREACH(te, fib_list, next) {
281 if (te->data == (void *)fib)
285 TAILQ_REMOVE(fib_list, te, next);
287 rte_mcfg_tailq_write_unlock();
290 rte_rib_free(fib->rib);
296 rte_fib_get_dp(struct rte_fib *fib)
298 return (fib == NULL) ? NULL : fib->dp;
302 rte_fib_get_rib(struct rte_fib *fib)
304 return (fib == NULL) ? NULL : fib->rib;