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_tailq.h>
12 #include <rte_errno.h>
13 #include <rte_rwlock.h>
14 #include <rte_malloc.h>
15 #include <rte_string_fns.h>
20 TAILQ_HEAD(rte_fib6_list, rte_tailq_entry);
21 static struct rte_tailq_elem rte_fib6_tailq = {
24 EAL_REGISTER_TAILQ(rte_fib6_tailq)
26 /* Maximum length of a FIB name. */
27 #define FIB6_NAMESIZE 64
29 #if defined(RTE_LIBRTE_FIB_DEBUG)
30 #define FIB6_RETURN_IF_TRUE(cond, retval) do { \
35 #define FIB6_RETURN_IF_TRUE(cond, retval)
39 char name[FIB6_NAMESIZE];
40 enum rte_fib6_type type; /**< Type of FIB struct */
41 struct rte_rib6 *rib; /**< RIB helper datastruct */
42 void *dp; /**< pointer to the dataplane struct*/
43 rte_fib6_lookup_fn_t lookup; /**< fib lookup function */
44 rte_fib6_modify_fn_t modify; /**< modify fib datastruct */
49 dummy_lookup(void *fib_p, uint8_t ips[][RTE_FIB6_IPV6_ADDR_SIZE],
50 uint64_t *next_hops, const unsigned int n)
53 struct rte_fib6 *fib = fib_p;
54 struct rte_rib6_node *node;
56 for (i = 0; i < n; i++) {
57 node = rte_rib6_lookup(fib->rib, ips[i]);
59 rte_rib6_get_nh(node, &next_hops[i]);
61 next_hops[i] = fib->def_nh;
66 dummy_modify(struct rte_fib6 *fib, const uint8_t ip[RTE_FIB6_IPV6_ADDR_SIZE],
67 uint8_t depth, uint64_t next_hop, int op)
69 struct rte_rib6_node *node;
70 if ((fib == NULL) || (depth > RTE_FIB6_MAXDEPTH))
73 node = rte_rib6_lookup_exact(fib->rib, ip, depth);
78 node = rte_rib6_insert(fib->rib, ip, depth);
81 return rte_rib6_set_nh(node, next_hop);
85 rte_rib6_remove(fib->rib, ip, depth);
92 init_dataplane(struct rte_fib6 *fib, __rte_unused int socket_id,
93 struct rte_fib6_conf *conf)
98 fib->lookup = dummy_lookup;
99 fib->modify = dummy_modify;
108 rte_fib6_add(struct rte_fib6 *fib, const uint8_t ip[RTE_FIB6_IPV6_ADDR_SIZE],
109 uint8_t depth, uint64_t next_hop)
111 if ((fib == NULL) || (ip == NULL) || (fib->modify == NULL) ||
112 (depth > RTE_FIB6_MAXDEPTH))
114 return fib->modify(fib, ip, depth, next_hop, RTE_FIB6_ADD);
118 rte_fib6_delete(struct rte_fib6 *fib, const uint8_t ip[RTE_FIB6_IPV6_ADDR_SIZE],
121 if ((fib == NULL) || (ip == NULL) || (fib->modify == NULL) ||
122 (depth > RTE_FIB6_MAXDEPTH))
124 return fib->modify(fib, ip, depth, 0, RTE_FIB6_DEL);
128 rte_fib6_lookup_bulk(struct rte_fib6 *fib,
129 uint8_t ips[][RTE_FIB6_IPV6_ADDR_SIZE],
130 uint64_t *next_hops, int n)
132 FIB6_RETURN_IF_TRUE((fib == NULL) || (ips == NULL) ||
133 (next_hops == NULL) || (fib->lookup == NULL), -EINVAL);
134 fib->lookup(fib->dp, ips, next_hops, n);
139 rte_fib6_create(const char *name, int socket_id, struct rte_fib6_conf *conf)
141 char mem_name[FIB6_NAMESIZE];
143 struct rte_fib6 *fib = NULL;
144 struct rte_rib6 *rib = NULL;
145 struct rte_tailq_entry *te;
146 struct rte_fib6_list *fib_list;
147 struct rte_rib6_conf rib_conf;
149 /* Check user arguments. */
150 if ((name == NULL) || (conf == NULL) || (conf->max_routes < 0) ||
151 (conf->type >= RTE_FIB6_TYPE_MAX)) {
157 rib_conf.max_nodes = conf->max_routes * 2;
159 rib = rte_rib6_create(name, socket_id, &rib_conf);
162 "Can not allocate RIB %s\n", name);
166 snprintf(mem_name, sizeof(mem_name), "FIB6_%s", name);
167 fib_list = RTE_TAILQ_CAST(rte_fib6_tailq.head, rte_fib6_list);
169 rte_mcfg_tailq_write_lock();
171 /* guarantee there's no existing */
172 TAILQ_FOREACH(te, fib_list, next) {
173 fib = (struct rte_fib6 *)te->data;
174 if (strncmp(name, fib->name, FIB6_NAMESIZE) == 0)
183 /* allocate tailq entry */
184 te = rte_zmalloc("FIB_TAILQ_ENTRY", sizeof(*te), 0);
187 "Can not allocate tailq entry for FIB %s\n", name);
192 /* Allocate memory to store the FIB data structures. */
193 fib = rte_zmalloc_socket(mem_name,
194 sizeof(struct rte_fib6), RTE_CACHE_LINE_SIZE, socket_id);
196 RTE_LOG(ERR, LPM, "FIB %s memory allocation failed\n", name);
201 rte_strlcpy(fib->name, name, sizeof(fib->name));
203 fib->type = conf->type;
204 fib->def_nh = conf->default_nh;
205 ret = init_dataplane(fib, socket_id, conf);
208 "FIB dataplane struct %s memory allocation failed\n",
214 te->data = (void *)fib;
215 TAILQ_INSERT_TAIL(fib_list, te, next);
217 rte_mcfg_tailq_write_unlock();
226 rte_mcfg_tailq_write_unlock();
233 rte_fib6_find_existing(const char *name)
235 struct rte_fib6 *fib = NULL;
236 struct rte_tailq_entry *te;
237 struct rte_fib6_list *fib_list;
239 fib_list = RTE_TAILQ_CAST(rte_fib6_tailq.head, rte_fib6_list);
241 rte_mcfg_tailq_read_lock();
242 TAILQ_FOREACH(te, fib_list, next) {
243 fib = (struct rte_fib6 *) te->data;
244 if (strncmp(name, fib->name, FIB6_NAMESIZE) == 0)
247 rte_mcfg_tailq_read_unlock();
258 free_dataplane(struct rte_fib6 *fib)
269 rte_fib6_free(struct rte_fib6 *fib)
271 struct rte_tailq_entry *te;
272 struct rte_fib6_list *fib_list;
277 fib_list = RTE_TAILQ_CAST(rte_fib6_tailq.head, rte_fib6_list);
279 rte_mcfg_tailq_write_lock();
281 /* find our tailq entry */
282 TAILQ_FOREACH(te, fib_list, next) {
283 if (te->data == (void *)fib)
287 TAILQ_REMOVE(fib_list, te, next);
289 rte_mcfg_tailq_write_unlock();
292 rte_rib6_free(fib->rib);
298 rte_fib6_get_dp(struct rte_fib6 *fib)
300 return (fib == NULL) ? NULL : fib->dp;
304 rte_fib6_get_rib(struct rte_fib6 *fib)
306 return (fib == NULL) ? NULL : fib->rib;