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