Home
last modified time | relevance | path

Searched refs:num_keys (Results 1 – 15 of 15) sorted by relevance

/dpdk/lib/member/
H A Drte_member_vbf.c34 params->num_keys == 0 || in rte_member_create_vbf()
187 const void **keys, uint32_t num_keys, member_set_t *set_ids) in rte_member_lookup_bulk_vbf() argument
195 for (i = 0; i < num_keys; i++) in rte_member_lookup_bulk_vbf()
198 for (i = 0; i < num_keys; i++) in rte_member_lookup_bulk_vbf()
201 for (i = 0; i < num_keys; i++) { in rte_member_lookup_bulk_vbf()
208 for (i = 0; i < num_keys; i++) { in rte_member_lookup_bulk_vbf()
248 const void **keys, uint32_t num_keys, uint32_t match_per_key, in rte_member_lookup_multi_bulk_vbf() argument
259 for (i = 0; i < num_keys; i++) in rte_member_lookup_multi_bulk_vbf()
262 for (i = 0; i < num_keys; i++) in rte_member_lookup_multi_bulk_vbf()
265 for (i = 0; i < num_keys; i++) { in rte_member_lookup_multi_bulk_vbf()
[all …]
H A Drte_member.c205 const void **keys, uint32_t num_keys, in rte_member_lookup_bulk() argument
213 return rte_member_lookup_bulk_ht(setsum, keys, num_keys, in rte_member_lookup_bulk()
216 return rte_member_lookup_bulk_vbf(setsum, keys, num_keys, in rte_member_lookup_bulk()
244 const void **keys, uint32_t num_keys, in rte_member_lookup_multi_bulk() argument
254 return rte_member_lookup_multi_bulk_ht(setsum, keys, num_keys, in rte_member_lookup_multi_bulk()
257 return rte_member_lookup_multi_bulk_vbf(setsum, keys, num_keys, in rte_member_lookup_multi_bulk()
H A Drte_member.h209 uint32_t num_keys; member
340 const void **keys, uint32_t num_keys,
400 const void **keys, uint32_t num_keys,
H A Drte_member_vbf.h25 const void **keys, uint32_t num_keys,
35 const void **keys, uint32_t num_keys, uint32_t match_per_key,
H A Drte_member_ht.h33 const void **keys, uint32_t num_keys,
43 const void **keys, uint32_t num_keys, uint32_t match_per_key,
H A Drte_member_ht.c81 uint32_t num_entries = rte_align32pow2(params->num_keys); in rte_member_create_ht()
203 const void **keys, uint32_t num_keys, member_set_t *set_id) in rte_member_lookup_bulk_ht() argument
212 for (i = 0; i < num_keys; i++) { in rte_member_lookup_bulk_ht()
219 for (i = 0; i < num_keys; i++) { in rte_member_lookup_bulk_ht()
279 const void **keys, uint32_t num_keys, uint32_t match_per_key, in rte_member_lookup_multi_bulk_ht() argument
291 for (i = 0; i < num_keys; i++) { in rte_member_lookup_multi_bulk_ht()
297 for (i = 0; i < num_keys; i++) { in rte_member_lookup_multi_bulk_ht()
/dpdk/lib/hash/
H A Drte_cuckoo_hash.c1916 for (i = 0; i < num_keys; i++) { in __bulk_lookup_l()
1950 for (i = 0; i < num_keys; i++) { in __bulk_lookup_l()
2021 for (i = 0; i < num_keys; i++) { in __bulk_lookup_l()
2061 for (i = 0; i < num_keys; i++) in __bulk_lookup_lf()
2073 for (i = 0; i < num_keys; i++) { in __bulk_lookup_lf()
2107 for (i = 0; i < num_keys; i++) { in __bulk_lookup_lf()
2263 for (; i < num_keys; i++) { in __bulk_lookup_prefetching_loop()
2344 int32_t positions[num_keys]; in rte_hash_lookup_bulk_data()
2370 for (i = 0; i < num_keys; i++) { in __rte_hash_lookup_with_hash_bulk_l()
2405 for (i = 0; i < num_keys; i++) { in __rte_hash_lookup_with_hash_bulk_lf()
[all …]
H A Drte_hash.h558 uint32_t num_keys, uint64_t *hit_mask, void *data[]);
585 hash_sig_t *sig, uint32_t num_keys, int32_t *positions);
611 uint32_t num_keys, uint64_t *hit_mask, void *data[]);
636 uint32_t num_keys, int32_t *positions);
/dpdk/app/test/
H A Dtest_member.c100 .num_keys = MAX_ENTRIES, /* Total hash table entries. */
125 .num_keys = MAX_ENTRIES, /* Total hash table entries. */ in test_member_find_existing()
161 .num_keys = MAX_ENTRIES, /* Total hash table entries. */ in test_member_create_bad_param()
198 bad_params.num_keys = 0; in test_member_create_bad_param()
210 bad_params.num_keys = RTE_MEMBER_BUCKET_ENTRIES / 2; in test_member_create_bad_param()
221 bad_params.num_keys = RTE_MEMBER_ENTRIES_MAX + 1; in test_member_create_bad_param()
649 ((double) average_keys_added / params.num_keys * 100), in test_member_loadfactor()
650 average_keys_added, params.num_keys); in test_member_loadfactor()
674 ((double) average_keys_added / params.num_keys * 100), in test_member_loadfactor()
675 average_keys_added, params.num_keys); in test_member_loadfactor()
H A Dtest_member_perf.c122 .num_keys = MAX_ENTRIES, /* Total hash table entries. */
191 member_params.num_keys = entry_cnt; in setup_keys_and_data()
207 member_params.num_keys = bf_key_cnt; in setup_keys_and_data()
H A Dtest_hash_readwrite_lf_perf.c1241 uint32_t num_keys = tbl_rwc_test_param.count_keys_no_ks in test_hash_rcu_qsbr_reader() local
1250 for (i = 0; i < num_keys; i += j) { in test_hash_rcu_qsbr_reader()
/dpdk/lib/efd/
H A Drte_efd.h272 int num_keys, const void **key_list,
H A Drte_efd.c1320 const unsigned int socket_id, const int num_keys, in rte_efd_lookup_bulk() argument
1332 for (i = 0; i < num_keys; i++) { in rte_efd_lookup_bulk()
1338 for (i = 0; i < num_keys; i++) { in rte_efd_lookup_bulk()
1347 for (i = 0; i < num_keys; i++) { in rte_efd_lookup_bulk()
/dpdk/doc/guides/prog_guide/
H A Dmember_lib.rst286 For example, ``num_keys`` parameter means the maximum number of entries for Hash table based set-su…
299 ``false_pos_rate`` is the false positive rate. num_keys and false_pos_rate will be used to determine
333 ``num_keys`` is the number
336 needs to be sized according to the ``num_keys``. If there is no match, the set id
362 a pointer to a bulk of keys that are to be looked up, ``num_keys`` is the number
H A Defd_lib.rst263 that looks up num_keys simultaneously stored in the key_list and the