Home
last modified time | relevance | path

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

/f-stack/dpdk/lib/librte_ip_frag/
H A Drte_ip_frag_common.c41 rte_ip_frag_table_create(uint32_t bucket_num, uint32_t bucket_entries, in rte_ip_frag_table_create() argument
49 nb_entries *= bucket_entries; in rte_ip_frag_table_create()
53 if (rte_is_power_of_2(bucket_entries) == 0 || in rte_ip_frag_table_create()
76 tbl->bucket_entries = bucket_entries; in rte_ip_frag_table_create()
77 tbl->entry_mask = (tbl->nb_entries - 1) & ~(tbl->bucket_entries - 1); in rte_ip_frag_table_create()
H A Drte_ip_frag.h104 uint32_t bucket_entries; /**< hash associativity. */ member
136 uint32_t bucket_entries, uint32_t max_entries,
H A Dip_frag_internal.c297 assoc = tbl->bucket_entries; in ip_frag_lookup()
/f-stack/dpdk/doc/guides/prog_guide/
H A Dip_fragment_reassembly_lib.rst54 …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 …
/f-stack/freebsd/netinet/
H A Dtcp_fastopen.h70 TAILQ_HEAD(bucket_entries, tcp_fastopen_ccache_entry) ccb_entries;
H A Dtcp_fastopen.c1075 cce = TAILQ_LAST(&ccb->ccb_entries, bucket_entries); in tcp_fastopen_ccache_create()