Home
last modified time | relevance | path

Searched refs:NUM_ROUTE_ENTRIES (Results 1 – 5 of 5) sorted by relevance

/dpdk/app/test/
H A Dtest_fib6_perf.c99 printf("No. routes = %u\n", (unsigned int) NUM_ROUTE_ENTRIES); in test_fib6_perf()
102 (uint32_t)NUM_ROUTE_ENTRIES); in test_fib6_perf()
115 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_fib6_perf()
126 (double)total_time / NUM_ROUTE_ENTRIES); in test_fib6_perf()
154 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_fib6_perf()
163 (double)total_time / NUM_ROUTE_ENTRIES); in test_fib6_perf()
H A Dtest_lpm6_perf.c81 printf("No. routes = %u\n", (unsigned) NUM_ROUTE_ENTRIES); in test_lpm6_perf()
83 print_route_distribution(large_route_table, (uint32_t) NUM_ROUTE_ENTRIES); in test_lpm6_perf()
96 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_lpm6_perf()
106 (double)total_time / NUM_ROUTE_ENTRIES); in test_lpm6_perf()
157 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_lpm6_perf()
166 (double)total_time / NUM_ROUTE_ENTRIES); in test_lpm6_perf()
H A Dtest_lpm6_data.h1032 #define NUM_ROUTE_ENTRIES RTE_DIM(large_route_table) macro
1034 #define NUM_IPS_ENTRIES (NUM_ROUTE_ENTRIES * 100)
1139 if (k == (NUM_IPS_ENTRIES / NUM_ROUTE_ENTRIES)) { in generate_large_ips_table()
1143 if (j == NUM_ROUTE_ENTRIES) in generate_large_ips_table()
1154 NUM_ROUTE_ENTRIES); in generate_large_ips_table()
H A Dtest_fib_perf.c52 #define NUM_ROUTE_ENTRIES num_route_entries macro
352 printf("No. routes = %u\n", (unsigned int) NUM_ROUTE_ENTRIES); in test_fib_perf()
355 (uint32_t) NUM_ROUTE_ENTRIES); in test_fib_perf()
363 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_fib_perf()
374 (double)total_time / NUM_ROUTE_ENTRIES); in test_fib_perf()
407 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_fib_perf()
416 (double)total_time / NUM_ROUTE_ENTRIES); in test_fib_perf()
H A Dtest_lpm_perf.c70 #define NUM_ROUTE_ENTRIES num_route_entries macro
625 printf("No. routes = %u\n", (unsigned) NUM_ROUTE_ENTRIES); in test_lpm_perf()
627 print_route_distribution(large_route_table, (uint32_t) NUM_ROUTE_ENTRIES); in test_lpm_perf()
635 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_lpm_perf()
664 (double)total_time / NUM_ROUTE_ENTRIES); in test_lpm_perf()
753 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_lpm_perf()
762 (double)total_time / NUM_ROUTE_ENTRIES); in test_lpm_perf()