lpm/x86: move SSE implementation to be architecture agnostic
-Used architecture agnostic xmm_t to represent 128 bit SIMD variable -Introduced vect_* API abstraction in app/test to test rte_lpm_lookupx4 API in architecture agnostic way -Moved rte_lpm_lookupx4 SSE implementation to architecture specific rte_lpm_sse.h file to accommodate new rte_lpm_lookupx4 implementation for a different architecture. Signed-off-by: Jerin Jacob <jerin.jacob@caviumnetworks.com> Acked-by: Konstantin Ananyev <konstantin.ananyev@intel.com>
This commit is contained in:
Jerin Jacob
Thomas Monjalon
parent
1dc1b95796
commit
15d8dfc05b
@ -458,6 +458,7 @@ F: lib/librte_lpm/
|
||||
F: doc/guides/prog_guide/lpm*
|
||||
F: app/test/test_lpm*
|
||||
F: app/test/test_func_reentrancy.c
|
||||
F: app/test/test_xmmt_ops.h
|
||||
|
||||
Traffic metering
|
||||
M: Cristian Dumitrescu <cristian.dumitrescu@intel.com>
|
||||
|
||||
@ -49,6 +49,7 @@
|
||||
|
||||
#include "rte_lpm.h"
|
||||
#include "test_lpm_routes.h"
|
||||
#include "test_xmmt_ops.h"
|
||||
|
||||
#define TEST_LPM_ASSERT(cond) do { \
|
||||
if (!(cond)) { \
|
||||
@ -345,7 +346,7 @@ test6(void)
|
||||
int32_t
|
||||
test7(void)
|
||||
{
|
||||
__m128i ipx4;
|
||||
xmm_t ipx4;
|
||||
uint32_t hop[4];
|
||||
struct rte_lpm *lpm = NULL;
|
||||
struct rte_lpm_config config;
|
||||
@ -366,7 +367,7 @@ test7(void)
|
||||
status = rte_lpm_lookup(lpm, ip, &next_hop_return);
|
||||
TEST_LPM_ASSERT((status == 0) && (next_hop_return == next_hop_add));
|
||||
|
||||
ipx4 = _mm_set_epi32(ip, ip + 0x100, ip - 0x100, ip);
|
||||
ipx4 = vect_set_epi32(ip, ip + 0x100, ip - 0x100, ip);
|
||||
rte_lpm_lookupx4(lpm, ipx4, hop, UINT32_MAX);
|
||||
TEST_LPM_ASSERT(hop[0] == next_hop_add);
|
||||
TEST_LPM_ASSERT(hop[1] == UINT32_MAX);
|
||||
@ -396,7 +397,7 @@ test7(void)
|
||||
int32_t
|
||||
test8(void)
|
||||
{
|
||||
__m128i ipx4;
|
||||
xmm_t ipx4;
|
||||
uint32_t hop[4];
|
||||
struct rte_lpm *lpm = NULL;
|
||||
struct rte_lpm_config config;
|
||||
@ -428,7 +429,7 @@ test8(void)
|
||||
TEST_LPM_ASSERT((status == 0) &&
|
||||
(next_hop_return == next_hop_add));
|
||||
|
||||
ipx4 = _mm_set_epi32(ip2, ip1, ip2, ip1);
|
||||
ipx4 = vect_set_epi32(ip2, ip1, ip2, ip1);
|
||||
rte_lpm_lookupx4(lpm, ipx4, hop, UINT32_MAX);
|
||||
TEST_LPM_ASSERT(hop[0] == UINT32_MAX);
|
||||
TEST_LPM_ASSERT(hop[1] == next_hop_add);
|
||||
@ -455,7 +456,7 @@ test8(void)
|
||||
status = rte_lpm_lookup(lpm, ip1, &next_hop_return);
|
||||
TEST_LPM_ASSERT(status == -ENOENT);
|
||||
|
||||
ipx4 = _mm_set_epi32(ip1, ip1, ip2, ip2);
|
||||
ipx4 = vect_set_epi32(ip1, ip1, ip2, ip2);
|
||||
rte_lpm_lookupx4(lpm, ipx4, hop, UINT32_MAX);
|
||||
if (depth != 1) {
|
||||
TEST_LPM_ASSERT(hop[0] == next_hop_add);
|
||||
@ -912,7 +913,7 @@ test11(void)
|
||||
int32_t
|
||||
test12(void)
|
||||
{
|
||||
__m128i ipx4;
|
||||
xmm_t ipx4;
|
||||
uint32_t hop[4];
|
||||
struct rte_lpm *lpm = NULL;
|
||||
struct rte_lpm_config config;
|
||||
@ -939,7 +940,7 @@ test12(void)
|
||||
TEST_LPM_ASSERT((status == 0) &&
|
||||
(next_hop_return == next_hop_add));
|
||||
|
||||
ipx4 = _mm_set_epi32(ip, ip + 1, ip, ip - 1);
|
||||
ipx4 = vect_set_epi32(ip, ip + 1, ip, ip - 1);
|
||||
rte_lpm_lookupx4(lpm, ipx4, hop, UINT32_MAX);
|
||||
TEST_LPM_ASSERT(hop[0] == UINT32_MAX);
|
||||
TEST_LPM_ASSERT(hop[1] == next_hop_add);
|
||||
@ -1386,10 +1387,10 @@ perf_test(void)
|
||||
begin = rte_rdtsc();
|
||||
for (j = 0; j < BATCH_SIZE; j += RTE_DIM(next_hops)) {
|
||||
unsigned k;
|
||||
__m128i ipx4;
|
||||
xmm_t ipx4;
|
||||
|
||||
ipx4 = _mm_loadu_si128((__m128i *)(ip_batch + j));
|
||||
ipx4 = *(__m128i *)(ip_batch + j);
|
||||
ipx4 = vect_loadu_sil128((xmm_t *)(ip_batch + j));
|
||||
ipx4 = *(xmm_t *)(ip_batch + j);
|
||||
rte_lpm_lookupx4(lpm, ipx4, next_hops, UINT32_MAX);
|
||||
for (k = 0; k < RTE_DIM(next_hops); k++)
|
||||
if (unlikely(next_hops[k] == UINT32_MAX))
|
||||
|
||||
47
app/test/test_xmmt_ops.h
Normal file
47
app/test/test_xmmt_ops.h
Normal file
@ -0,0 +1,47 @@
|
||||
/*-
|
||||
* BSD LICENSE
|
||||
*
|
||||
* Copyright(c) 2015 Cavium Networks. All rights reserved.
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* * Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* * Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
* * Neither the name of Cavium Networks nor the names of its
|
||||
* contributors may be used to endorse or promote products derived
|
||||
* from this software without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#ifndef _TEST_XMMT_OPS_H_
|
||||
#define _TEST_XMMT_OPS_H_
|
||||
|
||||
#include <rte_vect.h>
|
||||
|
||||
/* vect_* abstraction implementation using SSE */
|
||||
|
||||
/* loads the xmm_t value from address p(does not need to be 16-byte aligned)*/
|
||||
#define vect_loadu_sil128(p) _mm_loadu_si128(p)
|
||||
|
||||
/* sets the 4 signed 32-bit integer values and returns the xmm_t variable */
|
||||
#define vect_set_epi32(i3, i2, i1, i0) _mm_set_epi32(i3, i2, i1, i0)
|
||||
|
||||
#endif /* _TEST_XMMT_OPS_H_ */
|
||||
@ -46,6 +46,7 @@ SRCS-$(CONFIG_RTE_LIBRTE_LPM) := rte_lpm.c rte_lpm6.c
|
||||
|
||||
# install this header file
|
||||
SYMLINK-$(CONFIG_RTE_LIBRTE_LPM)-include := rte_lpm.h rte_lpm6.h
|
||||
SYMLINK-$(CONFIG_RTE_LIBRTE_LPM)-include += rte_lpm_sse.h
|
||||
|
||||
# this lib needs eal
|
||||
DEPDIRS-$(CONFIG_RTE_LIBRTE_LPM) += lib/librte_eal
|
||||
|
||||
@ -475,103 +475,10 @@ rte_lpm_lookup_bulk_func(const struct rte_lpm *lpm, const uint32_t *ips,
|
||||
* if lookup would fail.
|
||||
*/
|
||||
static inline void
|
||||
rte_lpm_lookupx4(const struct rte_lpm *lpm, __m128i ip, uint32_t hop[4],
|
||||
uint32_t defv)
|
||||
{
|
||||
__m128i i24;
|
||||
rte_xmm_t i8;
|
||||
uint32_t tbl[4];
|
||||
uint64_t idx, pt, pt2;
|
||||
const uint32_t *ptbl;
|
||||
rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4],
|
||||
uint32_t defv);
|
||||
|
||||
const __m128i mask8 =
|
||||
_mm_set_epi32(UINT8_MAX, UINT8_MAX, UINT8_MAX, UINT8_MAX);
|
||||
|
||||
/*
|
||||
* RTE_LPM_VALID_EXT_ENTRY_BITMASK for 2 LPM entries
|
||||
* as one 64-bit value (0x0300000003000000).
|
||||
*/
|
||||
const uint64_t mask_xv =
|
||||
((uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK |
|
||||
(uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK << 32);
|
||||
|
||||
/*
|
||||
* RTE_LPM_LOOKUP_SUCCESS for 2 LPM entries
|
||||
* as one 64-bit value (0x0100000001000000).
|
||||
*/
|
||||
const uint64_t mask_v =
|
||||
((uint64_t)RTE_LPM_LOOKUP_SUCCESS |
|
||||
(uint64_t)RTE_LPM_LOOKUP_SUCCESS << 32);
|
||||
|
||||
/* get 4 indexes for tbl24[]. */
|
||||
i24 = _mm_srli_epi32(ip, CHAR_BIT);
|
||||
|
||||
/* extract values from tbl24[] */
|
||||
idx = _mm_cvtsi128_si64(i24);
|
||||
i24 = _mm_srli_si128(i24, sizeof(uint64_t));
|
||||
|
||||
ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx];
|
||||
tbl[0] = *ptbl;
|
||||
ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32];
|
||||
tbl[1] = *ptbl;
|
||||
|
||||
idx = _mm_cvtsi128_si64(i24);
|
||||
|
||||
ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx];
|
||||
tbl[2] = *ptbl;
|
||||
ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32];
|
||||
tbl[3] = *ptbl;
|
||||
|
||||
/* get 4 indexes for tbl8[]. */
|
||||
i8.x = _mm_and_si128(ip, mask8);
|
||||
|
||||
pt = (uint64_t)tbl[0] |
|
||||
(uint64_t)tbl[1] << 32;
|
||||
pt2 = (uint64_t)tbl[2] |
|
||||
(uint64_t)tbl[3] << 32;
|
||||
|
||||
/* search successfully finished for all 4 IP addresses. */
|
||||
if (likely((pt & mask_xv) == mask_v) &&
|
||||
likely((pt2 & mask_xv) == mask_v)) {
|
||||
*(uint64_t *)hop = pt & RTE_LPM_MASKX4_RES;
|
||||
*(uint64_t *)(hop + 2) = pt2 & RTE_LPM_MASKX4_RES;
|
||||
return;
|
||||
}
|
||||
|
||||
if (unlikely((pt & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
|
||||
RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
|
||||
i8.u32[0] = i8.u32[0] +
|
||||
(uint8_t)tbl[0] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
|
||||
ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[0]];
|
||||
tbl[0] = *ptbl;
|
||||
}
|
||||
if (unlikely((pt >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
|
||||
RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
|
||||
i8.u32[1] = i8.u32[1] +
|
||||
(uint8_t)tbl[1] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
|
||||
ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[1]];
|
||||
tbl[1] = *ptbl;
|
||||
}
|
||||
if (unlikely((pt2 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
|
||||
RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
|
||||
i8.u32[2] = i8.u32[2] +
|
||||
(uint8_t)tbl[2] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
|
||||
ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[2]];
|
||||
tbl[2] = *ptbl;
|
||||
}
|
||||
if (unlikely((pt2 >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
|
||||
RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
|
||||
i8.u32[3] = i8.u32[3] +
|
||||
(uint8_t)tbl[3] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
|
||||
ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[3]];
|
||||
tbl[3] = *ptbl;
|
||||
}
|
||||
|
||||
hop[0] = (tbl[0] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[0] & 0x00FFFFFF : defv;
|
||||
hop[1] = (tbl[1] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[1] & 0x00FFFFFF : defv;
|
||||
hop[2] = (tbl[2] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[2] & 0x00FFFFFF : defv;
|
||||
hop[3] = (tbl[3] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[3] & 0x00FFFFFF : defv;
|
||||
}
|
||||
#include "rte_lpm_sse.h"
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
|
||||
149
lib/librte_lpm/rte_lpm_sse.h
Normal file
149
lib/librte_lpm/rte_lpm_sse.h
Normal file
@ -0,0 +1,149 @@
|
||||
/*-
|
||||
* BSD LICENSE
|
||||
*
|
||||
* Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
|
||||
* All rights reserved.
|
||||
*
|
||||
* Redistribution and use in source and binary forms, with or without
|
||||
* modification, are permitted provided that the following conditions
|
||||
* are met:
|
||||
*
|
||||
* * Redistributions of source code must retain the above copyright
|
||||
* notice, this list of conditions and the following disclaimer.
|
||||
* * Redistributions in binary form must reproduce the above copyright
|
||||
* notice, this list of conditions and the following disclaimer in
|
||||
* the documentation and/or other materials provided with the
|
||||
* distribution.
|
||||
* * Neither the name of Intel Corporation nor the names of its
|
||||
* contributors may be used to endorse or promote products derived
|
||||
* from this software without specific prior written permission.
|
||||
*
|
||||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||||
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||||
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||||
*/
|
||||
|
||||
#ifndef _RTE_LPM_SSE_H_
|
||||
#define _RTE_LPM_SSE_H_
|
||||
|
||||
#include <rte_branch_prediction.h>
|
||||
#include <rte_byteorder.h>
|
||||
#include <rte_common.h>
|
||||
#include <rte_vect.h>
|
||||
|
||||
#ifdef __cplusplus
|
||||
extern "C" {
|
||||
#endif
|
||||
|
||||
static inline void
|
||||
rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4],
|
||||
uint32_t defv)
|
||||
{
|
||||
__m128i i24;
|
||||
rte_xmm_t i8;
|
||||
uint32_t tbl[4];
|
||||
uint64_t idx, pt, pt2;
|
||||
const uint32_t *ptbl;
|
||||
|
||||
const __m128i mask8 =
|
||||
_mm_set_epi32(UINT8_MAX, UINT8_MAX, UINT8_MAX, UINT8_MAX);
|
||||
|
||||
/*
|
||||
* RTE_LPM_VALID_EXT_ENTRY_BITMASK for 2 LPM entries
|
||||
* as one 64-bit value (0x0300000003000000).
|
||||
*/
|
||||
const uint64_t mask_xv =
|
||||
((uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK |
|
||||
(uint64_t)RTE_LPM_VALID_EXT_ENTRY_BITMASK << 32);
|
||||
|
||||
/*
|
||||
* RTE_LPM_LOOKUP_SUCCESS for 2 LPM entries
|
||||
* as one 64-bit value (0x0100000001000000).
|
||||
*/
|
||||
const uint64_t mask_v =
|
||||
((uint64_t)RTE_LPM_LOOKUP_SUCCESS |
|
||||
(uint64_t)RTE_LPM_LOOKUP_SUCCESS << 32);
|
||||
|
||||
/* get 4 indexes for tbl24[]. */
|
||||
i24 = _mm_srli_epi32(ip, CHAR_BIT);
|
||||
|
||||
/* extract values from tbl24[] */
|
||||
idx = _mm_cvtsi128_si64(i24);
|
||||
i24 = _mm_srli_si128(i24, sizeof(uint64_t));
|
||||
|
||||
ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx];
|
||||
tbl[0] = *ptbl;
|
||||
ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32];
|
||||
tbl[1] = *ptbl;
|
||||
|
||||
idx = _mm_cvtsi128_si64(i24);
|
||||
|
||||
ptbl = (const uint32_t *)&lpm->tbl24[(uint32_t)idx];
|
||||
tbl[2] = *ptbl;
|
||||
ptbl = (const uint32_t *)&lpm->tbl24[idx >> 32];
|
||||
tbl[3] = *ptbl;
|
||||
|
||||
/* get 4 indexes for tbl8[]. */
|
||||
i8.x = _mm_and_si128(ip, mask8);
|
||||
|
||||
pt = (uint64_t)tbl[0] |
|
||||
(uint64_t)tbl[1] << 32;
|
||||
pt2 = (uint64_t)tbl[2] |
|
||||
(uint64_t)tbl[3] << 32;
|
||||
|
||||
/* search successfully finished for all 4 IP addresses. */
|
||||
if (likely((pt & mask_xv) == mask_v) &&
|
||||
likely((pt2 & mask_xv) == mask_v)) {
|
||||
*(uint64_t *)hop = pt & RTE_LPM_MASKX4_RES;
|
||||
*(uint64_t *)(hop + 2) = pt2 & RTE_LPM_MASKX4_RES;
|
||||
return;
|
||||
}
|
||||
|
||||
if (unlikely((pt & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
|
||||
RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
|
||||
i8.u32[0] = i8.u32[0] +
|
||||
(uint8_t)tbl[0] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
|
||||
ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[0]];
|
||||
tbl[0] = *ptbl;
|
||||
}
|
||||
if (unlikely((pt >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
|
||||
RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
|
||||
i8.u32[1] = i8.u32[1] +
|
||||
(uint8_t)tbl[1] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
|
||||
ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[1]];
|
||||
tbl[1] = *ptbl;
|
||||
}
|
||||
if (unlikely((pt2 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
|
||||
RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
|
||||
i8.u32[2] = i8.u32[2] +
|
||||
(uint8_t)tbl[2] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
|
||||
ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[2]];
|
||||
tbl[2] = *ptbl;
|
||||
}
|
||||
if (unlikely((pt2 >> 32 & RTE_LPM_VALID_EXT_ENTRY_BITMASK) ==
|
||||
RTE_LPM_VALID_EXT_ENTRY_BITMASK)) {
|
||||
i8.u32[3] = i8.u32[3] +
|
||||
(uint8_t)tbl[3] * RTE_LPM_TBL8_GROUP_NUM_ENTRIES;
|
||||
ptbl = (const uint32_t *)&lpm->tbl8[i8.u32[3]];
|
||||
tbl[3] = *ptbl;
|
||||
}
|
||||
|
||||
hop[0] = (tbl[0] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[0] & 0x00FFFFFF : defv;
|
||||
hop[1] = (tbl[1] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[1] & 0x00FFFFFF : defv;
|
||||
hop[2] = (tbl[2] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[2] & 0x00FFFFFF : defv;
|
||||
hop[3] = (tbl[3] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[3] & 0x00FFFFFF : defv;
|
||||
}
|
||||
|
||||
#ifdef __cplusplus
|
||||
}
|
||||
#endif
|
||||
|
||||
#endif /* _RTE_LPM_SSE_H_ */
|
||||
Loading…
x
Reference in New Issue
Block a user