Home
last modified time | relevance | path

Searched refs:NUM_LOOKUPS (Results 1 – 3 of 3) sorted by relevance

/f-stack/dpdk/app/test/
H A Dtest_member_perf.c246 for (i = 0; i < NUM_LOOKUPS / KEYS_TO_ADD; i++) { in timed_lookups()
283 for (i = 0; i < NUM_LOOKUPS / KEYS_TO_ADD; i++) { in timed_lookups_bulk()
328 for (i = 0; i < NUM_LOOKUPS / KEYS_TO_ADD; i++) { in timed_lookups_multimatch()
371 for (i = 0; i < NUM_LOOKUPS / KEYS_TO_ADD; i++) { in timed_lookups_multimatch_bulk()
408 NUM_LOOKUPS; in timed_lookups_multimatch_bulk()
464 for (i = 0; i < 2 * NUM_LOOKUPS / KEYS_TO_ADD; i++) { in timed_miss_lookup()
600 printf("%-18f", (float)false_data[j][i] / NUM_LOOKUPS); in run_all_tbl_perf_tests()
602 NUM_LOOKUPS); in run_all_tbl_perf_tests()
604 NUM_LOOKUPS); in run_all_tbl_perf_tests()
606 NUM_LOOKUPS); in run_all_tbl_perf_tests()
[all …]
H A Dtest_efd_perf.c23 #define NUM_LOOKUPS (KEYS_TO_ADD * 5) /* Loop among keys added, several times */ macro
202 for (i = 0; i < NUM_LOOKUPS / KEYS_TO_ADD; i++) { in timed_lookups()
224 cycles[params->cycle][LOOKUP] = time_taken / NUM_LOOKUPS; in timed_lookups()
237 for (i = 0; i < NUM_LOOKUPS / KEYS_TO_ADD; i++) { in timed_lookups_multi()
268 cycles[params->cycle][LOOKUP_MULTI] = time_taken / NUM_LOOKUPS; in timed_lookups_multi()
H A Dtest_hash_perf.c23 #define NUM_LOOKUPS (KEYS_TO_ADD * 5) /* Loop among keys added, several times */ macro
329 num_lookups = NUM_LOOKUPS * ADD_PERCENT; in timed_lookups()
332 num_lookups = NUM_LOOKUPS; in timed_lookups()
408 num_lookups = NUM_LOOKUPS * ADD_PERCENT; in timed_lookups_multi()
411 num_lookups = NUM_LOOKUPS; in timed_lookups_multi()