165 	unsigned i, j;  in get_input_keys()  local
183 	for (j = 0; j < hashtest_key_lens[table_index]; j++)  in get_input_keys()
184 		keys[0][j] = 0;  in get_input_keys()
199 			for (j = 1; j < hashtest_key_lens[table_index]; j++) {  in get_input_keys()
203 						keys[i][j] = keys[i - 1][j];  in get_input_keys()
205 						keys[i][j] = keys[i][j];  in get_input_keys()
209 						keys[i][j] = keys[i-1][j] + 1;  in get_input_keys()
211 						keys[i][j] = keys[i][j] + 1;  in get_input_keys()
212 					if (keys[i][j] == 0)  in get_input_keys()
320 	unsigned i, j;  in timed_lookups()  local
335 		for (j = 0; j < keys_to_add; j++) {  in timed_lookups()
338 							(const void *) keys[j],  in timed_lookups()
339 							signatures[j], &ret_data);  in timed_lookups()
341 					printf("Key number %u was not found\n", j);  in timed_lookups()
344 				expected_data = (void *) ((uintptr_t) signatures[j]);  in timed_lookups()
347 					       " but should be %p\n", j, ret_data,  in timed_lookups()
353 							(const void *) keys[j],  in timed_lookups()
354 							signatures[j]);  in timed_lookups()
355 				if (ret < 0 || ret != positions[j]) {  in timed_lookups()
357 						ret, positions[j]);  in timed_lookups()
362 							(const void *) keys[j], &ret_data);  in timed_lookups()
364 					printf("Key number %u was not found\n", j);  in timed_lookups()
367 				expected_data = (void *) ((uintptr_t) signatures[j]);  in timed_lookups()
370 					       " but should be %p\n", j, ret_data,  in timed_lookups()
375 				ret = rte_hash_lookup(h[table_index], keys[j]);  in timed_lookups()
376 				if (ret < 0 || ret != positions[j]) {  in timed_lookups()
378 						ret, positions[j]);  in timed_lookups()
397 	unsigned i, j, k;  in timed_lookups_multi()  local
417 		for (j = 0; j < keys_to_add/BURST_SIZE; j++) {  in timed_lookups_multi()
419 				keys_burst[k] = keys[j * BURST_SIZE + k];  in timed_lookups_multi()
434 							j * BURST_SIZE + k);  in timed_lookups_multi()
437 					expected_data[k] = (void *) ((uintptr_t) signatures[j * BURST_SIZE + k]);  in timed_lookups_multi()
440 						       " but should be %p\n", j * BURST_SIZE + k,  in timed_lookups_multi()
449 					&signatures[j * BURST_SIZE],  in timed_lookups_multi()
461 							j * BURST_SIZE + k);  in timed_lookups_multi()
466 						j * BURST_SIZE + k]);  in timed_lookups_multi()
471 							j * BURST_SIZE + k,  in timed_lookups_multi()
481 					&signatures[j * BURST_SIZE],  in timed_lookups_multi()
485 							positions[j *  in timed_lookups_multi()
489 							positions[j *  in timed_lookups_multi()
500 					if (positions_burst[k] != positions[j * BURST_SIZE + k]) {  in timed_lookups_multi()
503 							positions[j * BURST_SIZE + k]);  in timed_lookups_multi()
574 	unsigned i, j, with_data, with_hash;  in run_all_tbl_perf_tests()  local
590 				for (j = 0; j < NUM_SHUFFLES; j++)  in run_all_tbl_perf_tests()
630 				for (j = 0; j < NUM_OPERATIONS; j++)  in run_all_tbl_perf_tests()
631 					printf("%-18"PRIu64, cycles[i][j][with_hash][with_data]);  in run_all_tbl_perf_tests()
662 	unsigned i, j;  in fbk_hash_perf_test()  local
695 		for (j = 0; j < TEST_SIZE; j++)  in fbk_hash_perf_test()
696 			indexes[j] = rte_rand() % added;  in fbk_hash_perf_test()
700 		for (j = 0; j < TEST_SIZE; j++)  in fbk_hash_perf_test()
701 			value += rte_fbk_hash_lookup(handle, keys[indexes[j]]);  in fbk_hash_perf_test()