7dc7868b20
Add fib implementation for DIR24_8 algorithm for IPv4. Implementation is similar to current LPM implementation but has few enhancements: faster control plane operations more bits for userdata in table entries configurable userdata size Signed-off-by: Vladimir Medvedkin <vladimir.medvedkin@intel.com>
320 lines
6.7 KiB
C
320 lines
6.7 KiB
C
/* SPDX-License-Identifier: BSD-3-Clause
|
|
* Copyright(c) 2018 Vladimir Medvedkin <medvedkinv@gmail.com>
|
|
* Copyright(c) 2019 Intel Corporation
|
|
*/
|
|
|
|
#include <stdint.h>
|
|
#include <string.h>
|
|
|
|
#include <rte_eal.h>
|
|
#include <rte_eal_memconfig.h>
|
|
#include <rte_errno.h>
|
|
#include <rte_malloc.h>
|
|
#include <rte_rwlock.h>
|
|
#include <rte_string_fns.h>
|
|
#include <rte_tailq.h>
|
|
|
|
#include <rte_rib.h>
|
|
#include <rte_fib.h>
|
|
|
|
#include "dir24_8.h"
|
|
|
|
TAILQ_HEAD(rte_fib_list, rte_tailq_entry);
|
|
static struct rte_tailq_elem rte_fib_tailq = {
|
|
.name = "RTE_FIB",
|
|
};
|
|
EAL_REGISTER_TAILQ(rte_fib_tailq)
|
|
|
|
/* Maximum length of a FIB name. */
|
|
#define RTE_FIB_NAMESIZE 64
|
|
|
|
#if defined(RTE_LIBRTE_FIB_DEBUG)
|
|
#define FIB_RETURN_IF_TRUE(cond, retval) do { \
|
|
if (cond) \
|
|
return retval; \
|
|
} while (0)
|
|
#else
|
|
#define FIB_RETURN_IF_TRUE(cond, retval)
|
|
#endif
|
|
|
|
struct rte_fib {
|
|
char name[RTE_FIB_NAMESIZE];
|
|
enum rte_fib_type type; /**< Type of FIB struct */
|
|
struct rte_rib *rib; /**< RIB helper datastruct */
|
|
void *dp; /**< pointer to the dataplane struct*/
|
|
rte_fib_lookup_fn_t lookup; /**< fib lookup function */
|
|
rte_fib_modify_fn_t modify; /**< modify fib datastruct */
|
|
uint64_t def_nh;
|
|
};
|
|
|
|
static void
|
|
dummy_lookup(void *fib_p, const uint32_t *ips, uint64_t *next_hops,
|
|
const unsigned int n)
|
|
{
|
|
unsigned int i;
|
|
struct rte_fib *fib = fib_p;
|
|
struct rte_rib_node *node;
|
|
|
|
for (i = 0; i < n; i++) {
|
|
node = rte_rib_lookup(fib->rib, ips[i]);
|
|
if (node != NULL)
|
|
rte_rib_get_nh(node, &next_hops[i]);
|
|
else
|
|
next_hops[i] = fib->def_nh;
|
|
}
|
|
}
|
|
|
|
static int
|
|
dummy_modify(struct rte_fib *fib, uint32_t ip, uint8_t depth,
|
|
uint64_t next_hop, int op)
|
|
{
|
|
struct rte_rib_node *node;
|
|
if ((fib == NULL) || (depth > RTE_FIB_MAXDEPTH))
|
|
return -EINVAL;
|
|
|
|
node = rte_rib_lookup_exact(fib->rib, ip, depth);
|
|
|
|
switch (op) {
|
|
case RTE_FIB_ADD:
|
|
if (node == NULL)
|
|
node = rte_rib_insert(fib->rib, ip, depth);
|
|
if (node == NULL)
|
|
return -rte_errno;
|
|
return rte_rib_set_nh(node, next_hop);
|
|
case RTE_FIB_DEL:
|
|
if (node == NULL)
|
|
return -ENOENT;
|
|
rte_rib_remove(fib->rib, ip, depth);
|
|
return 0;
|
|
}
|
|
return -EINVAL;
|
|
}
|
|
|
|
static int
|
|
init_dataplane(struct rte_fib *fib, __rte_unused int socket_id,
|
|
struct rte_fib_conf *conf)
|
|
{
|
|
char dp_name[sizeof(void *)];
|
|
|
|
snprintf(dp_name, sizeof(dp_name), "%p", fib);
|
|
switch (conf->type) {
|
|
case RTE_FIB_DUMMY:
|
|
fib->dp = fib;
|
|
fib->lookup = dummy_lookup;
|
|
fib->modify = dummy_modify;
|
|
return 0;
|
|
case RTE_FIB_DIR24_8:
|
|
fib->dp = dir24_8_create(dp_name, socket_id, conf);
|
|
if (fib->dp == NULL)
|
|
return -rte_errno;
|
|
fib->lookup = dir24_8_get_lookup_fn(conf);
|
|
fib->modify = dir24_8_modify;
|
|
return 0;
|
|
default:
|
|
return -EINVAL;
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int
|
|
rte_fib_add(struct rte_fib *fib, uint32_t ip, uint8_t depth, uint64_t next_hop)
|
|
{
|
|
if ((fib == NULL) || (fib->modify == NULL) ||
|
|
(depth > RTE_FIB_MAXDEPTH))
|
|
return -EINVAL;
|
|
return fib->modify(fib, ip, depth, next_hop, RTE_FIB_ADD);
|
|
}
|
|
|
|
int
|
|
rte_fib_delete(struct rte_fib *fib, uint32_t ip, uint8_t depth)
|
|
{
|
|
if ((fib == NULL) || (fib->modify == NULL) ||
|
|
(depth > RTE_FIB_MAXDEPTH))
|
|
return -EINVAL;
|
|
return fib->modify(fib, ip, depth, 0, RTE_FIB_DEL);
|
|
}
|
|
|
|
int
|
|
rte_fib_lookup_bulk(struct rte_fib *fib, uint32_t *ips,
|
|
uint64_t *next_hops, int n)
|
|
{
|
|
FIB_RETURN_IF_TRUE(((fib == NULL) || (ips == NULL) ||
|
|
(next_hops == NULL) || (fib->lookup == NULL)), -EINVAL);
|
|
|
|
fib->lookup(fib->dp, ips, next_hops, n);
|
|
return 0;
|
|
}
|
|
|
|
struct rte_fib *
|
|
rte_fib_create(const char *name, int socket_id, struct rte_fib_conf *conf)
|
|
{
|
|
char mem_name[RTE_FIB_NAMESIZE];
|
|
int ret;
|
|
struct rte_fib *fib = NULL;
|
|
struct rte_rib *rib = NULL;
|
|
struct rte_tailq_entry *te;
|
|
struct rte_fib_list *fib_list;
|
|
struct rte_rib_conf rib_conf;
|
|
|
|
/* Check user arguments. */
|
|
if ((name == NULL) || (conf == NULL) || (conf->max_routes < 0) ||
|
|
(conf->type >= RTE_FIB_TYPE_MAX)) {
|
|
rte_errno = EINVAL;
|
|
return NULL;
|
|
}
|
|
|
|
rib_conf.ext_sz = 0;
|
|
rib_conf.max_nodes = conf->max_routes * 2;
|
|
|
|
rib = rte_rib_create(name, socket_id, &rib_conf);
|
|
if (rib == NULL) {
|
|
RTE_LOG(ERR, LPM,
|
|
"Can not allocate RIB %s\n", name);
|
|
return NULL;
|
|
}
|
|
|
|
snprintf(mem_name, sizeof(mem_name), "FIB_%s", name);
|
|
fib_list = RTE_TAILQ_CAST(rte_fib_tailq.head, rte_fib_list);
|
|
|
|
rte_mcfg_tailq_write_lock();
|
|
|
|
/* guarantee there's no existing */
|
|
TAILQ_FOREACH(te, fib_list, next) {
|
|
fib = (struct rte_fib *)te->data;
|
|
if (strncmp(name, fib->name, RTE_FIB_NAMESIZE) == 0)
|
|
break;
|
|
}
|
|
fib = NULL;
|
|
if (te != NULL) {
|
|
rte_errno = EEXIST;
|
|
goto exit;
|
|
}
|
|
|
|
/* allocate tailq entry */
|
|
te = rte_zmalloc("FIB_TAILQ_ENTRY", sizeof(*te), 0);
|
|
if (te == NULL) {
|
|
RTE_LOG(ERR, LPM,
|
|
"Can not allocate tailq entry for FIB %s\n", name);
|
|
rte_errno = ENOMEM;
|
|
goto exit;
|
|
}
|
|
|
|
/* Allocate memory to store the FIB data structures. */
|
|
fib = rte_zmalloc_socket(mem_name,
|
|
sizeof(struct rte_fib), RTE_CACHE_LINE_SIZE, socket_id);
|
|
if (fib == NULL) {
|
|
RTE_LOG(ERR, LPM, "FIB %s memory allocation failed\n", name);
|
|
rte_errno = ENOMEM;
|
|
goto free_te;
|
|
}
|
|
|
|
rte_strlcpy(fib->name, name, sizeof(fib->name));
|
|
fib->rib = rib;
|
|
fib->type = conf->type;
|
|
fib->def_nh = conf->default_nh;
|
|
ret = init_dataplane(fib, socket_id, conf);
|
|
if (ret < 0) {
|
|
RTE_LOG(ERR, LPM,
|
|
"FIB dataplane struct %s memory allocation failed "
|
|
"with err %d\n", name, ret);
|
|
rte_errno = -ret;
|
|
goto free_fib;
|
|
}
|
|
|
|
te->data = (void *)fib;
|
|
TAILQ_INSERT_TAIL(fib_list, te, next);
|
|
|
|
rte_mcfg_tailq_write_unlock();
|
|
|
|
return fib;
|
|
|
|
free_fib:
|
|
rte_free(fib);
|
|
free_te:
|
|
rte_free(te);
|
|
exit:
|
|
rte_mcfg_tailq_write_unlock();
|
|
rte_rib_free(rib);
|
|
|
|
return NULL;
|
|
}
|
|
|
|
struct rte_fib *
|
|
rte_fib_find_existing(const char *name)
|
|
{
|
|
struct rte_fib *fib = NULL;
|
|
struct rte_tailq_entry *te;
|
|
struct rte_fib_list *fib_list;
|
|
|
|
fib_list = RTE_TAILQ_CAST(rte_fib_tailq.head, rte_fib_list);
|
|
|
|
rte_mcfg_tailq_read_lock();
|
|
TAILQ_FOREACH(te, fib_list, next) {
|
|
fib = (struct rte_fib *) te->data;
|
|
if (strncmp(name, fib->name, RTE_FIB_NAMESIZE) == 0)
|
|
break;
|
|
}
|
|
rte_mcfg_tailq_read_unlock();
|
|
|
|
if (te == NULL) {
|
|
rte_errno = ENOENT;
|
|
return NULL;
|
|
}
|
|
|
|
return fib;
|
|
}
|
|
|
|
static void
|
|
free_dataplane(struct rte_fib *fib)
|
|
{
|
|
switch (fib->type) {
|
|
case RTE_FIB_DUMMY:
|
|
return;
|
|
case RTE_FIB_DIR24_8:
|
|
dir24_8_free(fib->dp);
|
|
default:
|
|
return;
|
|
}
|
|
}
|
|
|
|
void
|
|
rte_fib_free(struct rte_fib *fib)
|
|
{
|
|
struct rte_tailq_entry *te;
|
|
struct rte_fib_list *fib_list;
|
|
|
|
if (fib == NULL)
|
|
return;
|
|
|
|
fib_list = RTE_TAILQ_CAST(rte_fib_tailq.head, rte_fib_list);
|
|
|
|
rte_mcfg_tailq_write_lock();
|
|
|
|
/* find our tailq entry */
|
|
TAILQ_FOREACH(te, fib_list, next) {
|
|
if (te->data == (void *)fib)
|
|
break;
|
|
}
|
|
if (te != NULL)
|
|
TAILQ_REMOVE(fib_list, te, next);
|
|
|
|
rte_mcfg_tailq_write_unlock();
|
|
|
|
free_dataplane(fib);
|
|
rte_rib_free(fib->rib);
|
|
rte_free(fib);
|
|
rte_free(te);
|
|
}
|
|
|
|
void *
|
|
rte_fib_get_dp(struct rte_fib *fib)
|
|
{
|
|
return (fib == NULL) ? NULL : fib->dp;
|
|
}
|
|
|
|
struct rte_rib *
|
|
rte_fib_get_rib(struct rte_fib *fib)
|
|
{
|
|
return (fib == NULL) ? NULL : fib->rib;
|
|
}
|