Home
last modified time | relevance | path

Searched refs:keys (Results 1 – 25 of 71) sorted by relevance

123

/dpdk/app/test/
H A Dtest_hash.c119 static struct flow_key keys[5] = { { variable
287 print_key_info("Add", &keys[0], pos0); in test_add_delete()
292 print_key_info("Lkp", &keys[0], pos0); in test_add_delete()
297 print_key_info("Del", &keys[0], pos0); in test_add_delete()
302 print_key_info("Lkp", &keys[0], pos0); in test_add_delete()
319 print_key_info("Add", &keys[0], pos1); in test_add_delete()
550 ip_src = keys[0].ip_src; in test_add_delete_free_lf()
558 keys[0].ip_src++; in test_add_delete_free_lf()
576 keys[0].ip_src = ip_src; in test_add_delete_free_lf()
728 key_array[i] = &keys[i]; in test_five_keys()
[all …]
H A Dtest_efd.c63 static struct flow_key keys[5] = { variable
140 print_key_info("Add", &keys[0], data[0]); in test_add_delete()
152 print_key_info("Del", &keys[0], data[0]); in test_add_delete()
182 print_key_info("Add", &keys[1], data[1]); in test_add_update_delete()
186 print_key_info("Lkp", &keys[1], data[1]); in test_add_update_delete()
191 print_key_info("Add", &keys[1], data[1]); in test_add_update_delete()
272 &keys[i], data[i]), in test_five_keys()
279 key_array[i] = &keys[i]; in test_five_keys()
298 &keys[i], data[i]), in test_five_keys()
306 &keys[i]), data[i], in test_five_keys()
[all …]
H A Dtest_hash_perf.c142 memcpy(keys[i], keys[swap_idx], hashtest_key_lens[table_index]); in shuffle_input_keys()
179 keys[0][j] = 0; in get_input_keys()
190 keys[i][0] = ++k; in get_input_keys()
192 if (keys[i][0] == 0) in get_input_keys()
198 keys[i][j] = keys[i - 1][j]; in get_input_keys()
200 keys[i][j] = keys[i][j]; in get_input_keys()
204 keys[i][j] = keys[i-1][j] + 1; in get_input_keys()
206 keys[i][j] = keys[i][j] + 1; in get_input_keys()
665 keys = rte_zmalloc(NULL, ENTRIES * sizeof(*keys), 0); in fbk_hash_perf_test()
666 if (keys == NULL) { in fbk_hash_perf_test()
[all …]
H A Dtest_efd_perf.c90 static uint8_t keys[KEYS_TO_ADD][MAX_KEYSIZE]; variable
107 memcpy(keys[i], keys[swap_idx], hashtest_key_lens[params->cycle]); in shuffle_input_keys()
138 keys[0][i] = 0; in setup_keys_and_data()
143 keys[i][j] = rte_rand() & 0xFF; in setup_keys_and_data()
158 if (memcmp(keys[i], keys[i + 1], params->key_size) == 0) { in setup_keys_and_data()
162 keys[i][j] = rte_rand() & 0xFF; in setup_keys_and_data()
191 printf("%02x", keys[i][a]); in timed_adds()
215 test_socket_id, keys[j]); in timed_lookups()
220 printf("%02x", keys[i][a]); in timed_lookups()
264 keys[data_idx][a]); in timed_lookups_multi()
[all …]
H A Dtest_hash_readwrite.c41 uint32_t *keys; member
128 uint32_t *keys = NULL; in init_params() local
172 if (keys == NULL) { in init_params()
183 tbl_rw_test_param.keys = keys; in init_params()
187 keys[i] = i; in init_params()
192 rte_free(keys); in init_params()
302 tbl_rw_test_param.keys + i, in test_rw_reader()
338 tbl_rw_test_param.keys + i, in test_rw_writer()
416 tbl_rw_test_param.keys + i, in test_hash_readwrite_perf()
447 tbl_rw_test_param.keys + i, in test_hash_readwrite_perf()
[all …]
H A Dtest_hash_multiwriter.c36 uint32_t *keys; member
82 tbl_multiwriter_test_params.keys + i) < 0) in test_hash_multiwriter_worker()
91 tbl_multiwriter_test_params.keys[i] in test_hash_multiwriter_worker()
106 uint32_t *keys; in test_hash_multiwriter() local
151 keys = rte_malloc(NULL, sizeof(uint32_t) * nb_entries, 0); in test_hash_multiwriter()
153 if (keys == NULL) { in test_hash_multiwriter()
159 keys[i] = i; in test_hash_multiwriter()
161 tbl_multiwriter_test_params.keys = keys; in test_hash_multiwriter()
211 if (tbl_multiwriter_test_params.keys[i] in test_hash_multiwriter()
244 rte_free(tbl_multiwriter_test_params.keys); in test_hash_multiwriter()
[all …]
H A Dtest_member.c53 static struct flow_key keys[NUM_SAMPLES] = { variable
277 ret_cache = rte_member_add(setsum_cache, &keys[i], in test_member_insert()
304 ret_cache = rte_member_lookup(setsum_cache, &keys[i], in test_member_lookup()
319 key_array[i] = &keys[i]; in test_member_lookup()
358 ret_cache = rte_member_delete(setsum_cache, &keys[i], in test_member_delete()
369 key_array[i] = &keys[i]; in test_member_delete()
399 ret_cache = rte_member_delete(setsum_cache, &keys[i], in test_member_delete()
411 ret_cache = rte_member_lookup(setsum_cache, &keys[i], in test_member_delete()
453 ret_ht = rte_member_add(setsum_ht, &keys[j], i); in test_member_multimatch()
454 ret_vbf = rte_member_add(setsum_vbf, &keys[j], i); in test_member_multimatch()
[all …]
H A Dtest_member_perf.c90 static uint8_t keys[KEYS_TO_ADD][MAX_KEYSIZE]; variable
104 memcpy(keys[i], keys[swap_idx], in shuffle_input_keys()
106 memcpy(keys[swap_idx], temp_key, in shuffle_input_keys()
145 keys[0][i] = 0; in setup_keys_and_data()
150 keys[i][j] = rte_rand() & 0xFF; in setup_keys_and_data()
166 if (memcmp(keys[i], keys[i + 1], in setup_keys_and_data()
171 keys[i][j] = rte_rand() & 0xFF; in setup_keys_and_data()
232 printf("%02x", keys[i][a]); in timed_adds()
297 keys_burst[k] = keys[j * BURST_SIZE + k]; in timed_lookups_bulk()
385 keys_burst[k] = keys[j * BURST_SIZE + k]; in timed_lookups_multimatch_bulk()
[all …]
H A Dtest_hash_readwrite_lf_perf.c70 uint32_t *keys; member
278 if (keys == NULL) { in generate_keys()
386 tbl_rwc_test_param.keys = keys; in generate_keys()
395 keys[0] = 0; in generate_keys()
396 keys[1] = 1; in generate_keys()
398 keys[i] = keys[i-1] + keys[i-2]; in generate_keys()
421 keys+i, in generate_keys()
549 rte_free(keys); in generate_keys()
572 uint32_t *keys; in test_rwc_reader() local
665 uint32_t *keys; in write_keys() local
[all …]
H A Dtest_rcu_qsbr_perf.c22 static uint32_t *keys; variable
305 if (rte_hash_lookup_data(hash, keys + i, in test_rcu_qsbr_hash_reader()
360 if (keys == NULL) { in init_hash()
366 keys[i] = i; in init_hash()
369 if (rte_hash_add_key_data(hash, keys + i, in init_hash()
428 pos = rte_hash_del_key(h, keys + i); in test_rcu_qsbr_sw_sv_1qs()
466 rte_free(keys); in test_rcu_qsbr_sw_sv_1qs()
487 rte_free(keys); in test_rcu_qsbr_sw_sv_1qs()
543 pos = rte_hash_del_key(h, keys + i); in test_rcu_qsbr_sw_sv_1qs_non_blocking()
582 rte_free(keys); in test_rcu_qsbr_sw_sv_1qs_non_blocking()
[all …]
H A Dtest_rcu_qsbr.c44 static uint32_t *keys; variable
981 if (rte_hash_lookup_data(hash, keys+i, in test_rcu_qsbr_reader()
1014 pos = rte_hash_del_key(hash, keys + del); in test_rcu_qsbr_writer()
1075 if (keys == NULL) { in init_hash()
1081 keys[i] = i; in init_hash()
1084 if (rte_hash_add_key_data(h, keys + i, in init_hash()
1135 pos[0] = rte_hash_del_key(h[0], keys + 0); in test_rcu_qsbr_sw_sv_3qs()
1222 rte_free(keys); in test_rcu_qsbr_sw_sv_3qs()
1232 rte_free(keys); in test_rcu_qsbr_sw_sv_3qs()
1315 rte_free(keys); in test_rcu_qsbr_mw_mv_mqs()
[all …]
H A Dtest_table_acl.c456 struct rte_table_acl_rule_add_params keys[5]; in setup_acl_pipeline() local
466 memset(&keys[n], 0, sizeof(struct rte_table_acl_rule_add_params)); in setup_acl_pipeline()
467 key_array[n] = &keys[n]; in setup_acl_pipeline()
472 ret = parser(line, &keys[n]); in setup_acl_pipeline()
481 keys[n].priority = RTE_ACL_MAX_PRIORITY - n - 1; in setup_acl_pipeline()
500 struct rte_table_acl_rule_delete_params keys[5]; in setup_acl_pipeline() local
508 memset(&keys[n], 0, sizeof(struct rte_table_acl_rule_delete_params)); in setup_acl_pipeline()
509 key_array[n] = &keys[n]; in setup_acl_pipeline()
514 ret = parse_cb_ipv4_rule_del(line, &keys[n]); in setup_acl_pipeline()
/dpdk/lib/hash/
H A Drte_cuckoo_hash.c1479 struct rte_hash_key *keys, *k; in __hash_rcu_qsbr_free_resource() local
1485 keys = h->key_store; in __hash_rcu_qsbr_free_resource()
1969 key_slot->key, keys[i], h)) { in __bulk_lookup_l()
1998 key_slot->key, keys[i], h)) { in __bulk_lookup_l()
2127 key_slot->key, keys[i], h)) { in __bulk_lookup_lf()
2160 key_slot->key, keys[i], h)) { in __bulk_lookup_lf()
2191 keys[i], sig[i], in __bulk_lookup_lf()
2195 keys[i], sig[i], in __bulk_lookup_lf()
2240 rte_prefetch0(keys[i]); in __bulk_lookup_prefetching_loop()
2371 rte_prefetch0(keys[i]); in __rte_hash_lookup_with_hash_bulk_l()
[all …]
H A Drte_hash.h557 rte_hash_lookup_bulk_data(const struct rte_hash *h, const void **keys,
584 rte_hash_lookup_with_hash_bulk(const struct rte_hash *h, const void **keys,
610 const void **keys, hash_sig_t *sig,
635 rte_hash_lookup_bulk(const struct rte_hash *h, const void **keys,
/dpdk/lib/member/
H A Drte_member.c205 const void **keys, uint32_t num_keys, in rte_member_lookup_bulk() argument
208 if (setsum == NULL || keys == NULL || set_ids == NULL) in rte_member_lookup_bulk()
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
248 if (setsum == NULL || keys == NULL || set_ids == NULL || in rte_member_lookup_multi_bulk()
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_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,
/dpdk/doc/guides/prog_guide/
H A Defd_lib.rst30 fit for CPU cache), EFD can scale to millions of flow keys. Finally,
68 keys (shown in blue), and keys are mapped to the nearest target in a clockwise
105 is the storage requirement, since the flow table need to store keys,
107 millions of flow keys. Large tables will usually not fit in
142 (millions) of input keys to the correct output value is effectively
154 desirable feature especially for longer keys.
213 target values for a given individual flow key or a bulk of keys.
221 not store the keys and is used for lookups) will be allocated and
224 stores the keys and is used for key inserts and for computing the
394 groups, i.e., some group will have more keys than other groups.
[all …]
/dpdk/lib/ipsec/
H A Dipsec_sad.c457 const union rte_ipsec_sad_key *keys[], void *sa[], uint32_t n) in __ipsec_sad_lookup() argument
477 hash_sig[i] = rte_hash_crc_4byte(keys[i]->v4.spi, in __ipsec_sad_lookup()
485 (const void **)keys, hash_sig, n, &mask_1, sa); in __ipsec_sad_lookup()
494 hash_sig_3[n_3] = rte_hash_crc(keys[i], in __ipsec_sad_lookup()
497 keys_3[n_3++] = keys[i]; in __ipsec_sad_lookup()
501 hash_sig_2[n_2] = rte_hash_crc(keys[i], in __ipsec_sad_lookup()
504 keys_2[n_2++] = keys[i]; in __ipsec_sad_lookup()
541 const union rte_ipsec_sad_key *keys[], void *sa[], uint32_t n) in rte_ipsec_sad_lookup() argument
546 if (unlikely((sad == NULL) || (keys == NULL) || (sa == NULL))) in rte_ipsec_sad_lookup()
552 &keys[i], &sa[i], num); in rte_ipsec_sad_lookup()
/dpdk/usertools/
H A Ddpdk-devbind.py212 if "Driver" in dev.keys():
214 if "Module" in dev.keys():
244 for d in devices.keys():
284 for key in devices_type[i].keys():
309 for d in devices.keys():
453 for d in devices.keys():
504 for d in devices.keys():
549 for d in devices.keys():
/dpdk/lib/table/
H A Drte_table.h158 void **keys,
193 void **keys,
H A Drte_table_acl.c415 void **keys, in rte_table_acl_entry_add_bulk() argument
433 if (keys == NULL) { in rte_table_acl_entry_add_bulk()
460 if (keys[i] == NULL) { in rte_table_acl_entry_add_bulk()
472 rule = keys[i]; in rte_table_acl_entry_add_bulk()
483 keys[i]; in rte_table_acl_entry_add_bulk()
596 void **keys, in rte_table_acl_entry_delete_bulk() argument
614 if (keys == NULL) { in rte_table_acl_entry_delete_bulk()
629 if (keys[i] == NULL) { in rte_table_acl_entry_delete_bulk()
640 keys[i]; in rte_table_acl_entry_delete_bulk()
H A Drte_table_hash_key8.c654 entries, buckets_mask, buckets, keys, f) \ argument
676 keys[pkt2_index] = key; \
689 key = keys[pkt_index]; \
704 keys[pkt_index] = key; \
838 keys[pkt20_index] = key20; \
839 keys[pkt21_index] = key21; \
983 uint64_t *keys[RTE_PORT_IN_BURST_SIZE_MAX]; in rte_table_hash_lookup_key8_ext() local
999 buckets, keys, f); in rte_table_hash_lookup_key8_ext()
1053 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key8_ext()
1078 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key8_ext()
[all …]
H A Drte_table_hash_key16.c684 buckets_mask, buckets, keys, f) \ argument
706 keys[pkt2_index] = key; \
719 key = keys[pkt_index]; \
735 keys[pkt_index] = key; \
866 keys[pkt20_index] = key20; \
867 keys[pkt21_index] = key21; \
1014 uint64_t *keys[RTE_PORT_IN_BURST_SIZE_MAX]; in rte_table_hash_lookup_key16_ext() local
1031 buckets, keys, f); in rte_table_hash_lookup_key16_ext()
1085 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key16_ext()
1110 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key16_ext()
[all …]
H A Drte_table_hash_key32.c713 entries, buckets_mask, buckets, keys, f) \ argument
735 keys[pkt2_index] = key; \
748 key = keys[pkt_index]; \
767 keys[pkt_index] = key; \
903 keys[pkt20_index] = key20; \
904 keys[pkt21_index] = key21; \
1049 uint64_t *keys[RTE_PORT_IN_BURST_SIZE_MAX]; in rte_table_hash_lookup_key32_ext() local
1065 keys, f); in rte_table_hash_lookup_key32_ext()
1119 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key32_ext()
1144 buckets_mask, buckets, keys, f); in rte_table_hash_lookup_key32_ext()
[all …]

123