DPDK  20.11.2
rte_lpm_lsx.h
1 /* SPDX-License-Identifier: BSD-3-Clause
2  * Copyright(c) 2022 Loongson Technology Corporation Limited
3  */
4 
5 #ifndef _RTE_LPM_LSX_H_
6 #define _RTE_LPM_LSX_H_
7 
9 #include <rte_byteorder.h>
10 #include <rte_common.h>
11 #include <rte_vect.h>
12 #include <rte_lpm.h>
13 
14 #ifdef __cplusplus
15 extern "C" {
16 #endif
17 
18 static inline void
19 rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4],
20  uint32_t defv)
21 
22 {
23  __m128i i24;
24  rte_xmm_t i8;
25  uint32_t tbl[4];
26  uint64_t idx, pt, pt2;
27  const uint32_t *ptbl;
28 
29  __m128i mask8_tmp;
30  uint32_t max = UINT8_MAX;
31  mask8_tmp = __lsx_vreplgr2vr_w(max);
32  const __m128i mask8 = mask8_tmp;
33 
34  /*
35  * RTE_LPM_VALID_EXT_ENTRY_BITMASK for 2 LPM entries
36  * as one 64-bit value (0x0300000003000000).
37  */
38  const uint64_t mask_xv =
39  ((uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK |
40  (uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK << 32);
41 
42  /*
43  * RTE_LPM_LOOKUP_SUCCESS for 2 LPM entries
44  * as one 64-bit value (0x0100000001000000).
45  */
46  const uint64_t mask_v =
47  ((uint64_t)RTE_LPM_LOOKUP_SUCCESS |
48  (uint64_t)RTE_LPM_LOOKUP_SUCCESS << 32);
49 
50  /* get 4 indexes for tbl24[]. */
51  i24 = __lsx_vsrli_w(ip.m128i, CHAR_BIT);
52 
53  /* extract values from tbl24[] */
54  idx = __lsx_vpickve2gr_d(i24, 0);
55  i24 = __lsx_vbsrl_v(i24, 8);
56 
57  ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx];
58  tbl[0] = *ptbl;
59  ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32];
60  tbl[1] = *ptbl;
61 
62  idx = __lsx_vpickve2gr_d(i24, 0);
63 
64  ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx];
65  tbl[2] = *ptbl;
66  ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32];
67  tbl[3] = *ptbl;
68 
69  /* get 4 indexes for tbl8[]. */
70  i8.x.m128i = __lsx_vand_v(ip.m128i, mask8);
71 
72  pt = (uint64_t)tbl[0] |
73  (uint64_t)tbl[1] << 32;
74  pt2 = (uint64_t)tbl[2] |
75  (uint64_t)tbl[3] << 32;
76 
77  /* search successfully finished for all 4 IP addresses. */
78  if (likely((pt & mask_xv) == mask_v) &&
79  likely((pt2 & mask_xv) == mask_v)) {
80  *(uint64_t *)hop = pt & RTE_LPM_MASKX4_RES;
81  *(uint64_t *)(hop + 2) = pt2 & RTE_LPM_MASKX4_RES;
82  return;
83  }
84 
85  if (unlikely((pt & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
86  RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
87  i8.u32[0] = i8.u32[0] +
88  (uint8_t)tbl[0] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
89  ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[0]];
90  tbl[0] = *ptbl;
91  }
92  if (unlikely((pt >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
93  RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
94  i8.u32[1] = i8.u32[1] +
95  (uint8_t)tbl[1] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
96  ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[1]];
97  tbl[1] = *ptbl;
98  }
99  if (unlikely((pt2 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
100  RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
101  i8.u32[2] = i8.u32[2] +
102  (uint8_t)tbl[2] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
103  ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[2]];
104  tbl[2] = *ptbl;
105  }
106  if (unlikely((pt2 >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
107  RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
108  i8.u32[3] = i8.u32[3] +
109  (uint8_t)tbl[3] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
110  ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[3]];
111  tbl[3] = *ptbl;
112  }
113 
114  hop[0] = (tbl[0] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[0] & 0x00FFFFFF : defv;
115  hop[1] = (tbl[1] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[1] & 0x00FFFFFF : defv;
116  hop[2] = (tbl[2] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[2] & 0x00FFFFFF : defv;
117  hop[3] = (tbl[3] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[3] & 0x00FFFFFF : defv;
118 }
119 
120 #ifdef __cplusplus
121 }
122 #endif
123 
124 #endif /* _RTE_LPM_LSX_H_ */
#define likely(x)
#define unlikely(x)
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
Definition: rte_lpm.h:65