Searched refs:bucket_entries (Results 1 – 5 of 5) sorted by relevance
40 rte_ip_frag_table_create(uint32_t bucket_num, uint32_t bucket_entries, in rte_ip_frag_table_create() argument48 nb_entries *= bucket_entries; in rte_ip_frag_table_create()52 if (rte_is_power_of_2(bucket_entries) == 0 || in rte_ip_frag_table_create()75 tbl->bucket_entries = bucket_entries; in rte_ip_frag_table_create()76 tbl->entry_mask = (tbl->nb_entries - 1) & ~(tbl->bucket_entries - 1); in rte_ip_frag_table_create()
80 uint32_t bucket_entries; /* hash associativity. */ member
64 uint32_t bucket_entries, uint32_t max_entries,
297 assoc = tbl->bucket_entries; in ip_frag_lookup()
54 …frag_tbl = rte_ip_frag_table_create(max_flow_num, bucket_entries, max_flow_num, frag_cycles, socke…57 The basic idea is to use two hash functions and <bucket_entries> \* associativity.58 This provides 2 \* <bucket_entries> possible locations in the hash table for each key.59 When the collision occurs and all 2 \* <bucket_entries> are occupied,66 At any given time up to (2 \* bucket_entries \* RTE_LIBRTE_IP_FRAG_MAX \* <maximum number of mbufs …