- ret = rte_hash_lookup_multi(handle, &key_array[0], 5, (int32_t *)pos);
+ ret = rte_hash_lookup_bulk(handle, &key_array[0], 5, (int32_t *)pos);
- ret = rte_hash_lookup_multi(handle, &key_array[0], 5, (int32_t *)pos);
+ ret = rte_hash_lookup_bulk(handle, &key_array[0], 5, (int32_t *)pos);
if (ret == 0)
for (i = 0; i < 5; i++) {
print_key_info("Lkp", key_array[i], pos[i]);
if (ret == 0)
for (i = 0; i < 5; i++) {
print_key_info("Lkp", key_array[i], pos[i]);
/*
* Test to see the average table utilization (entries added/max entries)
* before hitting a random entry that cannot be added
/*
* Test to see the average table utilization (entries added/max entries)
* before hitting a random entry that cannot be added
"\n before adding elements begins to fail\n");
printf("Measuring performance, please wait");
fflush(stdout);
"\n before adding elements begins to fail\n");
printf("Measuring performance, please wait");
fflush(stdout);
ut_params.name = "test_average_utilization";
ut_params.hash_func = rte_jhash;
handle = rte_hash_create(&ut_params);
ut_params.name = "test_average_utilization";
ut_params.hash_func = rte_jhash;
handle = rte_hash_create(&ut_params);