150 lines
4.8 KiB
C
150 lines
4.8 KiB
C
/*-
|
|
* 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_ */
|