Home
last modified time | relevance | path

Searched refs:MAX_ENTRIES (Results 1 – 4 of 4) sorted by relevance

/dpdk/app/test/
H A Dtest_member.c96 #define MAX_ENTRIES (1 << 16) macro
97 uint8_t generated_keys[MAX_ENTRIES][KEY_SIZE];
100 .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()
547 for (i = 0; i < MAX_ENTRIES; i++) { in setup_keys_and_data()
556 qsort(generated_keys, MAX_ENTRIES, KEY_SIZE, key_compare); in setup_keys_and_data()
560 for (i = 0; i < MAX_ENTRIES - 1; i++) { in setup_keys_and_data()
578 for (*added_keys = 0; ret >= 0 && *added_keys < MAX_ENTRIES; in add_generated_keys()
592 for (*added_keys = 0; ret == 0 && *added_keys < MAX_ENTRIES; in add_generated_keys_cache()
H A Dtest_hash_perf.c20 #define MAX_ENTRIES (1 << 19) macro
21 #define KEYS_TO_ADD (MAX_ENTRIES)
26 #define NUM_BUCKETS (MAX_ENTRIES / BUCKET_SIZE)
56 static uint8_t slot_taken[MAX_ENTRIES];
75 .entries = MAX_ENTRIES,
172 for (i = 0; i < MAX_ENTRIES; i++) in get_input_keys()
H A Dtest_member_perf.c32 #define MAX_ENTRIES (1 << 19) macro
33 #define KEYS_TO_ADD (MAX_ENTRIES * 75 / 100) /* 75% table utilization */
122 .num_keys = MAX_ENTRIES, /* Total hash table entries. */
182 entry_cnt = MAX_ENTRIES; in setup_keys_and_data()
185 entry_cnt = MAX_ENTRIES / 2; in setup_keys_and_data()
H A Dtest_efd_perf.c31 #define MAX_ENTRIES (1 << 19) macro
32 #define KEYS_TO_ADD (MAX_ENTRIES * 3 / 4) /* 75% table utilization */
171 MAX_ENTRIES, params->key_size, in setup_keys_and_data()