27#define RTE_LPM_NAMESIZE 32
30#define RTE_LPM_MAX_DEPTH 32
33#define RTE_LPM_TBL24_NUM_ENTRIES (1 << 24)
36#define RTE_LPM_TBL8_GROUP_NUM_ENTRIES 256
39#define RTE_LPM_MAX_TBL8_NUM_GROUPS (1 << 24)
42#define RTE_LPM_TBL8_NUM_GROUPS 256
45#define RTE_LPM_TBL8_NUM_ENTRIES (RTE_LPM_TBL8_NUM_GROUPS * \
46 RTE_LPM_TBL8_GROUP_NUM_ENTRIES)
49#if defined(RTE_LIBRTE_LPM_DEBUG)
50#define RTE_LPM_RETURN_IF_TRUE(cond, retval) do { \
51 if (cond) return (retval); \
54#define RTE_LPM_RETURN_IF_TRUE(cond, retval)
58#define RTE_LPM_VALID_EXT_ENTRY_BITMASK 0x03000000
61#define RTE_LPM_LOOKUP_SUCCESS 0x01000000
64#define RTE_LPM_RCU_DQ_RECLAIM_MAX 16
74#if RTE_BYTE_ORDER == RTE_LITTLE_ENDIAN
77struct rte_lpm_tbl_entry {
83 uint32_t next_hop :24;
93 uint32_t valid_group :1;
100struct rte_lpm_tbl_entry {
102 uint32_t valid_group :1;
104 uint32_t next_hop :24;
120 struct rte_lpm_tbl_entry tbl24[RTE_LPM_TBL24_NUM_ENTRIES]
122 struct rte_lpm_tbl_entry *tbl8;
127 struct rte_rcu_qsbr *v;
135 uint32_t reclaim_thd;
136 uint32_t reclaim_max;
223rte_lpm_add(
struct rte_lpm *lpm, uint32_t ip, uint8_t depth, uint32_t next_hop);
283 unsigned tbl24_index = (ip >> 8);
285 const uint32_t *ptbl;
288 RTE_LPM_RETURN_IF_TRUE(((lpm == NULL) || (next_hop == NULL)), -EINVAL);
291 ptbl = (
const uint32_t *)(&lpm->tbl24[tbl24_index]);
299 if (
unlikely((tbl_entry & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
300 RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
302 unsigned tbl8_index = (uint8_t)ip +
303 (((uint32_t)tbl_entry & 0x00FFFFFF) *
304 RTE_LPM_TBL8_GROUP_NUM_ENTRIES);
306 ptbl = (
const uint32_t *)&lpm->tbl8[tbl8_index];
310 *next_hop = ((uint32_t)tbl_entry & 0x00FFFFFF);
334#define rte_lpm_lookup_bulk(lpm, ips, next_hops, n) \
335 rte_lpm_lookup_bulk_func(lpm, ips, next_hops, n)
338rte_lpm_lookup_bulk_func(
const struct rte_lpm *lpm,
const uint32_t *ips,
339 uint32_t *next_hops,
const unsigned n)
342 unsigned tbl24_indexes[n];
343 const uint32_t *ptbl;
346 RTE_LPM_RETURN_IF_TRUE(((lpm == NULL) || (ips == NULL) ||
347 (next_hops == NULL)), -EINVAL);
349 for (i = 0; i < n; i++) {
350 tbl24_indexes[i] = ips[i] >> 8;
353 for (i = 0; i < n; i++) {
355 ptbl = (
const uint32_t *)&lpm->tbl24[tbl24_indexes[i]];
356 next_hops[i] = *ptbl;
359 if (
unlikely((next_hops[i] & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
360 RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
362 unsigned tbl8_index = (uint8_t)ips[i] +
363 (((uint32_t)next_hops[i] & 0x00FFFFFF) *
364 RTE_LPM_TBL8_GROUP_NUM_ENTRIES);
366 ptbl = (
const uint32_t *)&lpm->tbl8[tbl8_index];
367 next_hops[i] = *ptbl;
374#define RTE_LPM_MASKX4_RES UINT64_C(0x00ffffff00ffffff)
399#if defined(RTE_ARCH_ARM)
400#ifdef RTE_HAS_SVE_ACLE
401#include "rte_lpm_sve.h"
403#include "rte_lpm_neon.h"
405#elif defined(RTE_ARCH_PPC_64)
406#include "rte_lpm_altivec.h"
407#elif defined(RTE_ARCH_X86)
408#include "rte_lpm_sse.h"
410#include "rte_lpm_scalar.h"
#define __rte_cache_aligned
int rte_lpm_add(struct rte_lpm *lpm, uint32_t ip, uint8_t depth, uint32_t next_hop)
int rte_lpm_delete(struct rte_lpm *lpm, uint32_t ip, uint8_t depth)
__rte_experimental int rte_lpm_rcu_qsbr_add(struct rte_lpm *lpm, struct rte_lpm_rcu_config *cfg)
void rte_lpm_free(struct rte_lpm *lpm)
static void rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4], uint32_t defv)
#define RTE_LPM_LOOKUP_SUCCESS
struct rte_lpm * rte_lpm_create(const char *name, int socket_id, const struct rte_lpm_config *config)
void rte_lpm_delete_all(struct rte_lpm *lpm)
int rte_lpm_is_rule_present(struct rte_lpm *lpm, uint32_t ip, uint8_t depth, uint32_t *next_hop)
static int rte_lpm_lookup(const struct rte_lpm *lpm, uint32_t ip, uint32_t *next_hop)
struct rte_lpm * rte_lpm_find_existing(const char *name)