Home
last modified time | relevance | path

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

/f-stack/dpdk/app/test/
H A Dtest_fib6_perf.c86 printf("No. routes = %u\n", (unsigned int) NUM_ROUTE_ENTRIES); in test_fib6_perf()
89 (uint32_t)NUM_ROUTE_ENTRIES); in test_fib6_perf()
102 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_fib6_perf()
113 (double)total_time / NUM_ROUTE_ENTRIES); in test_fib6_perf()
141 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_fib6_perf()
150 (double)total_time / NUM_ROUTE_ENTRIES); in test_fib6_perf()
H A Dtest_lpm6_perf.c70 printf("No. routes = %u\n", (unsigned) NUM_ROUTE_ENTRIES); in test_lpm6_perf()
72 print_route_distribution(large_route_table, (uint32_t) NUM_ROUTE_ENTRIES); in test_lpm6_perf()
85 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_lpm6_perf()
95 (double)total_time / NUM_ROUTE_ENTRIES); in test_lpm6_perf()
146 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_lpm6_perf()
155 (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.c41 #define NUM_ROUTE_ENTRIES num_route_entries macro
340 printf("No. routes = %u\n", (unsigned int) NUM_ROUTE_ENTRIES); in test_fib_perf()
343 (uint32_t) NUM_ROUTE_ENTRIES); in test_fib_perf()
351 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_fib_perf()
362 (double)total_time / NUM_ROUTE_ENTRIES); in test_fib_perf()
395 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_fib_perf()
404 (double)total_time / NUM_ROUTE_ENTRIES); in test_fib_perf()
H A Dtest_lpm_perf.c60 #define NUM_ROUTE_ENTRIES num_route_entries macro
615 printf("No. routes = %u\n", (unsigned) NUM_ROUTE_ENTRIES); in test_lpm_perf()
617 print_route_distribution(large_route_table, (uint32_t) NUM_ROUTE_ENTRIES); in test_lpm_perf()
625 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_lpm_perf()
654 (double)total_time / NUM_ROUTE_ENTRIES); in test_lpm_perf()
743 for (i = 0; i < NUM_ROUTE_ENTRIES; i++) { in test_lpm_perf()
752 (double)total_time / NUM_ROUTE_ENTRIES); in test_lpm_perf()