DPDK  18.11.10
rte_lpm_mips.h
1 /*-
2  * BSD LICENSE
3  *
4  * Copyright(c) 2022 Loongson Technology Corporation Limited
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  *
11  * * Redistributions of source code must retain the above copyright
12  * notice, this list of conditions and the following disclaimer.
13  * * Redistributions in binary form must reproduce the above copyright
14  * notice, this list of conditions and the following disclaimer in
15  * the documentation and/or other materials provided with the
16  * distribution.
17  * * Neither the name of Intel Corporation nor the names of its
18  * contributors may be used to endorse or promote products derived
19  * from this software without specific prior written permission.
20  *
21  * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22  * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23  * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24  * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25  * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26  * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27  * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28  * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29  * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30  * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31  * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
32  */
33 
34 #ifndef _RTE_LPM_MIPS_H_
35 #define _RTE_LPM_MIPS_H_
36 
37 #include <rte_branch_prediction.h>
38 #include <rte_byteorder.h>
39 #include <rte_common.h>
40 #include <rte_vect.h>
41 #include <rte_lpm.h>
42 
43 #ifdef __cplusplus
44 extern "C" {
45 #endif
46 
47 static inline void
48 rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4],
49  uint32_t defv)
50 
51 {
52 #ifdef RTE_ARCH_NO_VECTOR
53  xmm_t i24;
54  rte_xmm_t i8;
55  uint32_t tbl[4];
56  uint64_t idx, pt, pt2;
57  const uint32_t *ptbl;
58  int i;
59 
60  const uint32_t mask = UINT8_MAX;
61  xmm_t mask8_tmp = (xmm_t){.u32 = {mask, mask, mask, mask} };
62 
63  const xmm_t mask8 = mask8_tmp;
64 
65  /*
66  * RTE_LPM_VALID_EXT_ENTRY_BITMASK for 2 LPM entries
67  * as one 64-bit value (0x0300000003000000).
68  */
69  const uint64_t mask_xv =
70  ((uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK |
71  (uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK << 32);
72 
73  /*
74  * RTE_LPM_LOOKUP_SUCCESS for 2 LPM entries
75  * as one 64-bit value (0x0100000001000000).
76  */
77  const uint64_t mask_v =
78  ((uint64_t)RTE_LPM_LOOKUP_SUCCESS |
79  (uint64_t)RTE_LPM_LOOKUP_SUCCESS << 32);
80 
81  /* get 4 indexes for tbl24[]. */
82  for ( i = 0; i < 4; i++)
83  i24.u32[i] = ip.u32[i] >> CHAR_BIT;
84 
85  /* extract values from tbl24[] */
86  idx = i24.i64[0];
87 
88  ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx];
89  tbl[0] = *ptbl;
90  ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32];
91  tbl[1] = *ptbl;
92 
93  idx = i24.i64[1];
94 
95  ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx];
96  tbl[2] = *ptbl;
97  ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32];
98  tbl[3] = *ptbl;
99 
100  /* get 4 indexes for tbl8[]. */
101  for (i = 0; i < 2; i++)
102  i8.x.u64[i] = ip.u64[i] & mask8.u64[i];
103 
104 #endif
105 
106  pt = (uint64_t)tbl[0] |
107  (uint64_t)tbl[1] << 32;
108  pt2 = (uint64_t)tbl[2] |
109  (uint64_t)tbl[3] << 32;
110 
111  /* search successfully finished for all 4 IP addresses. */
112  if (likely((pt & mask_xv) == mask_v) &&
113  likely((pt2 & mask_xv) == mask_v)) {
114  *(uint64_t *)hop = pt & RTE_LPM_MASKX4_RES;
115  *(uint64_t *)(hop + 2) = pt2 & RTE_LPM_MASKX4_RES;
116  return;
117  }
118 
119  if (unlikely((pt & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
120  RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
121  i8.u32[0] = i8.u32[0] +
122  (uint8_t)tbl[0] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
123  ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[0]];
124  tbl[0] = *ptbl;
125  }
126  if (unlikely((pt >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
127  RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
128  i8.u32[1] = i8.u32[1] +
129  (uint8_t)tbl[1] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
130  ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[1]];
131  tbl[1] = *ptbl;
132  }
133  if (unlikely((pt2 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
134  RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
135  i8.u32[2] = i8.u32[2] +
136  (uint8_t)tbl[2] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
137  ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[2]];
138  tbl[2] = *ptbl;
139  }
140  if (unlikely((pt2 >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
141  RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
142  i8.u32[3] = i8.u32[3] +
143  (uint8_t)tbl[3] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
144  ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[3]];
145  tbl[3] = *ptbl;
146  }
147 
148  hop[0] = (tbl[0] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[0] & 0x00FFFFFF : defv;
149  hop[1] = (tbl[1] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[1] & 0x00FFFFFF : defv;
150  hop[2] = (tbl[2] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[2] & 0x00FFFFFF : defv;
151  hop[3] = (tbl[3] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[3] & 0x00FFFFFF : defv;
152 }
153 
154 #ifdef __cplusplus
155 }
156 #endif
157 
158 #endif /* _RTE_LPM_MIPS_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:64