Home
last modified time | relevance | path

Searched refs:NUM_IPS_ENTRIES (Results 1 – 3 of 3) sorted by relevance

/f-stack/dpdk/app/test/
H A Dtest_lpm6_data.h1034 #define NUM_IPS_ENTRIES (NUM_ROUTE_ENTRIES * 100) macro
1039 static struct ips_tbl_entry large_ips_table[NUM_IPS_ENTRIES];
1130 for (i = 0; i < NUM_IPS_ENTRIES; i++) { in generate_large_ips_table()
1135 for (k = j = 0, i = 0; i < NUM_IPS_ENTRIES; i++) { in generate_large_ips_table()
1139 if (k == (NUM_IPS_ENTRIES / NUM_ROUTE_ENTRIES)) { in generate_large_ips_table()
1150 for (k = 0; k < NUM_IPS_ENTRIES; k++) in generate_large_ips_table()
H A Dtest_lpm6_perf.c104 for (j = 0; j < NUM_IPS_ENTRIES; j ++) { in test_lpm6_perf()
121 uint8_t ip_batch[NUM_IPS_ENTRIES][16]; in test_lpm6_perf()
122 int32_t next_hops[NUM_IPS_ENTRIES]; in test_lpm6_perf()
124 for (i = 0; i < NUM_IPS_ENTRIES; i++) in test_lpm6_perf()
131 rte_lpm6_lookup_bulk_func(lpm, ip_batch, next_hops, NUM_IPS_ENTRIES); in test_lpm6_perf()
134 for (j = 0; j < NUM_IPS_ENTRIES; j++) in test_lpm6_perf()
H A Dtest_fib6_perf.c75 uint8_t ip_batch[NUM_IPS_ENTRIES][16]; in test_fib6_perf()
76 uint64_t next_hops[NUM_IPS_ENTRIES]; in test_fib6_perf()
119 for (i = 0; i < NUM_IPS_ENTRIES; i++) in test_fib6_perf()
126 rte_fib6_lookup_bulk(fib, ip_batch, next_hops, NUM_IPS_ENTRIES); in test_fib6_perf()
129 for (j = 0; j < NUM_IPS_ENTRIES; j++) in test_fib6_perf()