DPDK  26.03.0
rte_lpm.h
Go to the documentation of this file.
1 /* SPDX-License-Identifier: BSD-3-Clause
2  * Copyright(c) 2010-2014 Intel Corporation
3  * Copyright(c) 2020 Arm Limited
4  */
5 
6 #ifndef _RTE_LPM_H_
7 #define _RTE_LPM_H_
8 
14 #include <errno.h>
15 #include <stdalign.h>
16 #include <stdint.h>
17 
18 #include <rte_branch_prediction.h>
19 #include <rte_byteorder.h>
20 #include <rte_common.h>
21 #include <rte_vect.h>
22 #include <rte_rcu_qsbr.h>
23 
24 #ifdef __cplusplus
25 extern "C" {
26 #endif
27 
29 #define RTE_LPM_NAMESIZE 32
30 
32 #define RTE_LPM_MAX_DEPTH 32
33 
35 #define RTE_LPM_TBL24_NUM_ENTRIES (1 << 24)
36 
38 #define RTE_LPM_TBL8_GROUP_NUM_ENTRIES 256
39 
41 #define RTE_LPM_MAX_TBL8_NUM_GROUPS (1 << 24)
42 
44 #define RTE_LPM_TBL8_NUM_GROUPS 256
45 
47 #define RTE_LPM_TBL8_NUM_ENTRIES (RTE_LPM_TBL8_NUM_GROUPS * \
48  RTE_LPM_TBL8_GROUP_NUM_ENTRIES)
49 
51 #if defined(RTE_LIBRTE_LPM_DEBUG)
52 #define RTE_LPM_RETURN_IF_TRUE(cond, retval) do { \
53  if (cond) return (retval); \
54 } while (0)
55 #else
56 #define RTE_LPM_RETURN_IF_TRUE(cond, retval)
57 #endif
58 
60 #define RTE_LPM_VALID_EXT_ENTRY_BITMASK 0x03000000
61 
63 #define RTE_LPM_LOOKUP_SUCCESS 0x01000000
64 
66 #define RTE_LPM_RCU_DQ_RECLAIM_MAX 16
67 
74 };
75 
76 #if RTE_BYTE_ORDER == RTE_LITTLE_ENDIAN
77 
78 __extension__
79 struct rte_lpm_tbl_entry {
80  union {
81  RTE_ATOMIC(uint32_t) val;
82  struct {
88  uint32_t next_hop :24;
89  /* Using single uint8_t to store 3 values. */
90  uint32_t valid :1;
98  uint32_t valid_group :1;
99  uint32_t depth :6;
100  };
101  };
102 };
103 
104 #else
105 
106 __extension__
107 struct rte_lpm_tbl_entry {
108  union {
109  RTE_ATOMIC(uint32_t) val;
110  struct {
111  uint32_t depth :6;
112  uint32_t valid_group :1;
113  uint32_t valid :1;
114  uint32_t next_hop :24;
115  };
116  };
117 };
118 
119 #endif
120 
121 static_assert(sizeof(struct rte_lpm_tbl_entry) == sizeof(uint32_t),
122  "sizeof(struct rte_lpm_tbl_entry) == sizeof(uint32_t)");
123 
126  uint32_t max_rules;
127  uint32_t number_tbl8s;
128  int flags;
129 };
130 
132 struct rte_lpm {
133  /* LPM Tables. */
134  alignas(RTE_CACHE_LINE_SIZE) struct rte_lpm_tbl_entry tbl24[RTE_LPM_TBL24_NUM_ENTRIES];
136  struct rte_lpm_tbl_entry *tbl8;
137 };
138 
141  struct rte_rcu_qsbr *v; /* RCU QSBR variable. */
142  /* Mode of RCU QSBR. RTE_LPM_QSBR_MODE_xxx
143  * '0' for default: create defer queue for reclaim.
144  */
145  enum rte_lpm_qsbr_mode mode;
146  uint32_t dq_size; /* RCU defer queue size.
147  * default: lpm->number_tbl8s.
148  */
149  uint32_t reclaim_thd; /* Threshold to trigger auto reclaim. */
150  uint32_t reclaim_max; /* Max entries to reclaim in one go.
151  * default: RTE_LPM_RCU_DQ_RECLAIM_MAX.
152  */
153 };
154 
162 void
163 rte_lpm_free(struct rte_lpm *lpm);
164 
185 struct rte_lpm *
186 rte_lpm_create(const char *name, int socket_id,
187  const struct rte_lpm_config *config)
189 
200 struct rte_lpm *
201 rte_lpm_find_existing(const char *name);
202 
218 int rte_lpm_rcu_qsbr_add(struct rte_lpm *lpm, struct rte_lpm_rcu_config *cfg);
219 
234 int
235 rte_lpm_add(struct rte_lpm *lpm, uint32_t ip, uint8_t depth, uint32_t next_hop);
236 
252 int
253 rte_lpm_is_rule_present(struct rte_lpm *lpm, uint32_t ip, uint8_t depth,
254 uint32_t *next_hop);
255 
268 int
269 rte_lpm_delete(struct rte_lpm *lpm, uint32_t ip, uint8_t depth);
270 
277 void
278 rte_lpm_delete_all(struct rte_lpm *lpm);
279 
292 static inline int
293 rte_lpm_lookup(const struct rte_lpm *lpm, uint32_t ip, uint32_t *next_hop)
294 {
295  unsigned tbl24_index = (ip >> 8);
296  uint32_t tbl_entry;
297  const uint32_t *ptbl;
298 
299  /* DEBUG: Check user input arguments. */
300  RTE_LPM_RETURN_IF_TRUE(((lpm == NULL) || (next_hop == NULL)), -EINVAL);
301 
302  /* Copy tbl24 entry */
303  ptbl = (const uint32_t *)(&lpm->tbl24[tbl24_index]);
304  tbl_entry = *ptbl;
305 
306  /* Memory ordering is not required in lookup. Because dataflow
307  * dependency exists, compiler or HW won't be able to re-order
308  * the operations.
309  */
310  /* Copy tbl8 entry (only if needed) */
311  if (unlikely((tbl_entry & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
312  RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
313 
314  unsigned tbl8_index = (uint8_t)ip +
315  (((uint32_t)tbl_entry & 0x00FFFFFF) *
316  RTE_LPM_TBL8_GROUP_NUM_ENTRIES);
317 
318  ptbl = (const uint32_t *)&lpm->tbl8[tbl8_index];
319  tbl_entry = *ptbl;
320  }
321 
322  *next_hop = ((uint32_t)tbl_entry & 0x00FFFFFF);
323  return (tbl_entry & RTE_LPM_LOOKUP_SUCCESS) ? 0 : -ENOENT;
324 }
325 
346 #define rte_lpm_lookup_bulk(lpm, ips, next_hops, n) \
347  rte_lpm_lookup_bulk_func(lpm, ips, next_hops, n)
348 
349 static inline int
350 rte_lpm_lookup_bulk_func(const struct rte_lpm *lpm, const uint32_t *ips,
351  uint32_t *next_hops, const unsigned n)
352 {
353  unsigned i;
354  const uint32_t *ptbl;
355 
356  /* DEBUG: Check user input arguments. */
357  RTE_LPM_RETURN_IF_TRUE(((lpm == NULL) || (ips == NULL) ||
358  (next_hops == NULL)), -EINVAL);
359 
360  for (i = 0; i < n; i++) {
361  unsigned int tbl24_index = ips[i] >> 8;
362 
363  /* Simply copy tbl24 entry to output */
364  ptbl = (const uint32_t *)&lpm->tbl24[tbl24_index];
365  next_hops[i] = *ptbl;
366 
367  /* Overwrite output with tbl8 entry if needed */
368  if (unlikely((next_hops[i] & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
369  RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
370 
371  unsigned tbl8_index = (uint8_t)ips[i] +
372  (((uint32_t)next_hops[i] & 0x00FFFFFF) *
373  RTE_LPM_TBL8_GROUP_NUM_ENTRIES);
374 
375  ptbl = (const uint32_t *)&lpm->tbl8[tbl8_index];
376  next_hops[i] = *ptbl;
377  }
378  }
379  return 0;
380 }
381 
382 /* Mask four results. */
383 #define RTE_LPM_MASKX4_RES UINT64_C(0x00ffffff00ffffff)
384 
404 static inline void
405 rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4],
406  uint32_t defv);
407 
408 #ifdef __cplusplus
409 }
410 #endif
411 
412 #if defined(RTE_ARCH_ARM)
413 #ifdef RTE_HAS_SVE_ACLE
414 #include "rte_lpm_sve.h"
415 #undef rte_lpm_lookup_bulk
416 #define rte_lpm_lookup_bulk(lpm, ips, next_hops, n) \
417  __rte_lpm_lookup_vec(lpm, ips, next_hops, n)
418 #endif
419 #include "rte_lpm_neon.h"
420 #elif defined(RTE_ARCH_PPC_64)
421 #include "rte_lpm_altivec.h"
422 #elif defined(RTE_ARCH_X86)
423 #include "rte_lpm_sse.h"
424 #elif defined(RTE_ARCH_RISCV) && defined(RTE_RISCV_FEATURE_V)
425 #include "rte_lpm_rvv.h"
426 #else
427 #include "rte_lpm_scalar.h"
428 #endif
429 
430 #endif /* _RTE_LPM_H_ */
struct rte_lpm struct rte_lpm * rte_lpm_find_existing(const char *name)
void rte_lpm_free(struct rte_lpm *lpm)
void rte_lpm_delete_all(struct rte_lpm *lpm)
rte_lpm_qsbr_mode
Definition: rte_lpm.h:69
uint32_t max_rules
Definition: rte_lpm.h:126
#define unlikely(x)
static int rte_lpm_lookup(const struct rte_lpm *lpm, uint32_t ip, uint32_t *next_hop)
Definition: rte_lpm.h:293
static void rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4], uint32_t defv)
#define __rte_dealloc(dealloc, argno)
Definition: rte_common.h:339
#define __rte_malloc
Definition: rte_common.h:328
uint32_t number_tbl8s
Definition: rte_lpm.h:127
int rte_lpm_delete(struct rte_lpm *lpm, uint32_t ip, uint8_t depth)
#define RTE_LPM_LOOKUP_SUCCESS
Definition: rte_lpm.h:63
int rte_lpm_add(struct rte_lpm *lpm, uint32_t ip, uint8_t depth, uint32_t next_hop)
struct rte_lpm * rte_lpm_create(const char *name, int socket_id, const struct rte_lpm_config *config) __rte_malloc __rte_dealloc(rte_lpm_free
int rte_lpm_is_rule_present(struct rte_lpm *lpm, uint32_t ip, uint8_t depth, uint32_t *next_hop)
int rte_lpm_rcu_qsbr_add(struct rte_lpm *lpm, struct rte_lpm_rcu_config *cfg)