Home
last modified time | relevance | path

Searched refs:RTE_EFD_VALUE_NUM_BITS (Results 1 – 6 of 6) sorted by relevance

/f-stack/dpdk/lib/librte_efd/
H A Drte_efd.h64 #ifndef RTE_EFD_VALUE_NUM_BITS
65 #define RTE_EFD_VALUE_NUM_BITS (8) macro
105 #if (RTE_EFD_VALUE_NUM_BITS > 0 && RTE_EFD_VALUE_NUM_BITS <= 8)
107 #elif (RTE_EFD_VALUE_NUM_BITS > 8 && RTE_EFD_VALUE_NUM_BITS <= 16)
109 #elif (RTE_EFD_VALUE_NUM_BITS > 16 && RTE_EFD_VALUE_NUM_BITS <= 32)
H A Drte_efd_x86.h10 #if (RTE_EFD_VALUE_NUM_BITS == 8 || RTE_EFD_VALUE_NUM_BITS == 16 || \
11 RTE_EFD_VALUE_NUM_BITS == 24 || RTE_EFD_VALUE_NUM_BITS == 32)
28 for (; i < RTE_EFD_VALUE_NUM_BITS; i += 8) { in efd_lookup_internal_avx2()
44 & ((1 << (RTE_EFD_VALUE_NUM_BITS - i)) - 1)) << i; in efd_lookup_internal_avx2()
H A Drte_efd.c209 efd_hashfunc_t hash_idx[RTE_EFD_VALUE_NUM_BITS];
210 efd_lookuptbl_t lookup_table[RTE_EFD_VALUE_NUM_BITS];
377 efd_hashfunc_t start_hash_idx[RTE_EFD_VALUE_NUM_BITS]; in efd_search_hash()
378 efd_lookuptbl_t start_lookup_table[RTE_EFD_VALUE_NUM_BITS]; in efd_search_hash()
398 for (i = 0; i < RTE_EFD_VALUE_NUM_BITS; i++) { in efd_search_hash()
649 if (RTE_EFD_VALUE_NUM_BITS > 3 in rte_efd_create()
660 if (RTE_EFD_VALUE_NUM_BITS > 16 && in rte_efd_create()
1250 for (i = 0; i < RTE_EFD_VALUE_NUM_BITS; i++) { in efd_lookup_internal_scalar()
1253 group_hash_idx[RTE_EFD_VALUE_NUM_BITS - i - 1]); in efd_lookup_internal_scalar()
1256 RTE_EFD_VALUE_NUM_BITS - i - 1] >> in efd_lookup_internal_scalar()
H A Drte_efd_arm64.h28 for (; i < RTE_EFD_VALUE_NUM_BITS; i += 4) { in efd_lookup_internal_neon()
/f-stack/dpdk/app/test/
H A Dtest_efd_perf.c25 #if RTE_EFD_VALUE_NUM_BITS == 32
28 #define VALUE_BITMASK ((1 << RTE_EFD_VALUE_NUM_BITS) - 1)
H A Dtest_efd.c19 #if RTE_EFD_VALUE_NUM_BITS == 32
22 #define VALUE_BITMASK ((1 << RTE_EFD_VALUE_NUM_BITS) - 1)