4 * Copyright(c) 2010-2014 Intel Corporation. All rights reserved.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
11 * * Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * * Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in
15 * the documentation and/or other materials provided with the
17 * * Neither the name of Intel Corporation nor the names of its
18 * contributors may be used to endorse or promote products derived
19 * from this software without specific prior written permission.
21 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
22 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
23 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
24 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
25 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
26 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
27 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
28 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
29 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
30 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
31 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
40 #include <sys/queue.h>
42 #include <rte_common.h>
43 #include <rte_lcore.h>
44 #include <rte_malloc.h>
45 #include <rte_cycles.h>
46 #include <rte_random.h>
47 #include <rte_memory.h>
48 #include <rte_memzone.h>
51 #include <rte_string_fns.h>
56 #include <rte_fbk_hash.h>
57 #include <rte_jhash.h>
58 #include <rte_hash_crc.h>
60 /* Types of hash table performance test that can be performed */
62 ADD_ON_EMPTY, /*< Add keys to empty table */
63 DELETE_ON_EMPTY, /*< Attempt to delete keys from empty table */
64 LOOKUP_ON_EMPTY, /*< Attempt to find keys in an empty table */
65 ADD_UPDATE, /*< Add/update keys in a full table */
66 DELETE, /*< Delete keys from a full table */
67 LOOKUP /*< Find keys in a full table */
70 /* Function type for hash table operations. */
71 typedef int32_t (*hash_operation)(const struct rte_hash *h, const void *key);
73 /* Structure to hold parameters used to run a hash table performance test */
74 struct tbl_perf_test_params {
75 enum hash_test_t test_type;
76 uint32_t num_iterations;
78 uint32_t bucket_entries;
80 rte_hash_function hash_func;
81 uint32_t hash_func_init_val;
84 #define ITERATIONS 10000
85 #define LOCAL_FBK_HASH_ENTRIES_MAX (1 << 15)
87 /*******************************************************************************
88 * Hash function performance test configuration section. Each performance test
89 * will be performed HASHTEST_ITERATIONS times.
91 * The five arrays below control what tests are performed. Every combination
92 * from the array entries is tested.
94 #define HASHTEST_ITERATIONS 1000000
96 static rte_hash_function hashtest_funcs[] = {rte_jhash, rte_hash_crc};
97 static uint32_t hashtest_initvals[] = {0};
98 static uint32_t hashtest_key_lens[] = {2, 4, 5, 6, 7, 8, 10, 11, 15, 16, 21, 31, 32, 33, 63, 64};
99 /******************************************************************************/
101 /*******************************************************************************
102 * Hash table performance test configuration section.
104 struct tbl_perf_test_params tbl_perf_params[] =
106 /* Small table, add */
107 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
108 { ADD_ON_EMPTY, 1024, 1024, 1, 16, rte_jhash, 0},
109 { ADD_ON_EMPTY, 1024, 1024, 2, 16, rte_jhash, 0},
110 { ADD_ON_EMPTY, 1024, 1024, 4, 16, rte_jhash, 0},
111 { ADD_ON_EMPTY, 1024, 1024, 8, 16, rte_jhash, 0},
112 { ADD_ON_EMPTY, 1024, 1024, 16, 16, rte_jhash, 0},
113 { ADD_ON_EMPTY, 1024, 1024, 1, 32, rte_jhash, 0},
114 { ADD_ON_EMPTY, 1024, 1024, 2, 32, rte_jhash, 0},
115 { ADD_ON_EMPTY, 1024, 1024, 4, 32, rte_jhash, 0},
116 { ADD_ON_EMPTY, 1024, 1024, 8, 32, rte_jhash, 0},
117 { ADD_ON_EMPTY, 1024, 1024, 16, 32, rte_jhash, 0},
118 { ADD_ON_EMPTY, 1024, 1024, 1, 48, rte_jhash, 0},
119 { ADD_ON_EMPTY, 1024, 1024, 2, 48, rte_jhash, 0},
120 { ADD_ON_EMPTY, 1024, 1024, 4, 48, rte_jhash, 0},
121 { ADD_ON_EMPTY, 1024, 1024, 8, 48, rte_jhash, 0},
122 { ADD_ON_EMPTY, 1024, 1024, 16, 48, rte_jhash, 0},
123 { ADD_ON_EMPTY, 1024, 1024, 1, 64, rte_jhash, 0},
124 { ADD_ON_EMPTY, 1024, 1024, 2, 64, rte_jhash, 0},
125 { ADD_ON_EMPTY, 1024, 1024, 4, 64, rte_jhash, 0},
126 { ADD_ON_EMPTY, 1024, 1024, 8, 64, rte_jhash, 0},
127 { ADD_ON_EMPTY, 1024, 1024, 16, 64, rte_jhash, 0},
128 /* Small table, update */
129 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
130 { ADD_UPDATE, ITERATIONS, 1024, 1, 16, rte_jhash, 0},
131 { ADD_UPDATE, ITERATIONS, 1024, 2, 16, rte_jhash, 0},
132 { ADD_UPDATE, ITERATIONS, 1024, 4, 16, rte_jhash, 0},
133 { ADD_UPDATE, ITERATIONS, 1024, 8, 16, rte_jhash, 0},
134 { ADD_UPDATE, ITERATIONS, 1024, 16, 16, rte_jhash, 0},
135 { ADD_UPDATE, ITERATIONS, 1024, 1, 32, rte_jhash, 0},
136 { ADD_UPDATE, ITERATIONS, 1024, 2, 32, rte_jhash, 0},
137 { ADD_UPDATE, ITERATIONS, 1024, 4, 32, rte_jhash, 0},
138 { ADD_UPDATE, ITERATIONS, 1024, 8, 32, rte_jhash, 0},
139 { ADD_UPDATE, ITERATIONS, 1024, 16, 32, rte_jhash, 0},
140 { ADD_UPDATE, ITERATIONS, 1024, 1, 48, rte_jhash, 0},
141 { ADD_UPDATE, ITERATIONS, 1024, 2, 48, rte_jhash, 0},
142 { ADD_UPDATE, ITERATIONS, 1024, 4, 48, rte_jhash, 0},
143 { ADD_UPDATE, ITERATIONS, 1024, 8, 48, rte_jhash, 0},
144 { ADD_UPDATE, ITERATIONS, 1024, 16, 48, rte_jhash, 0},
145 { ADD_UPDATE, ITERATIONS, 1024, 1, 64, rte_jhash, 0},
146 { ADD_UPDATE, ITERATIONS, 1024, 2, 64, rte_jhash, 0},
147 { ADD_UPDATE, ITERATIONS, 1024, 4, 64, rte_jhash, 0},
148 { ADD_UPDATE, ITERATIONS, 1024, 8, 64, rte_jhash, 0},
149 { ADD_UPDATE, ITERATIONS, 1024, 16, 64, rte_jhash, 0},
150 /* Small table, lookup */
151 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
152 { LOOKUP, ITERATIONS, 1024, 1, 16, rte_jhash, 0},
153 { LOOKUP, ITERATIONS, 1024, 2, 16, rte_jhash, 0},
154 { LOOKUP, ITERATIONS, 1024, 4, 16, rte_jhash, 0},
155 { LOOKUP, ITERATIONS, 1024, 8, 16, rte_jhash, 0},
156 { LOOKUP, ITERATIONS, 1024, 16, 16, rte_jhash, 0},
157 { LOOKUP, ITERATIONS, 1024, 1, 32, rte_jhash, 0},
158 { LOOKUP, ITERATIONS, 1024, 2, 32, rte_jhash, 0},
159 { LOOKUP, ITERATIONS, 1024, 4, 32, rte_jhash, 0},
160 { LOOKUP, ITERATIONS, 1024, 8, 32, rte_jhash, 0},
161 { LOOKUP, ITERATIONS, 1024, 16, 32, rte_jhash, 0},
162 { LOOKUP, ITERATIONS, 1024, 1, 48, rte_jhash, 0},
163 { LOOKUP, ITERATIONS, 1024, 2, 48, rte_jhash, 0},
164 { LOOKUP, ITERATIONS, 1024, 4, 48, rte_jhash, 0},
165 { LOOKUP, ITERATIONS, 1024, 8, 48, rte_jhash, 0},
166 { LOOKUP, ITERATIONS, 1024, 16, 48, rte_jhash, 0},
167 { LOOKUP, ITERATIONS, 1024, 1, 64, rte_jhash, 0},
168 { LOOKUP, ITERATIONS, 1024, 2, 64, rte_jhash, 0},
169 { LOOKUP, ITERATIONS, 1024, 4, 64, rte_jhash, 0},
170 { LOOKUP, ITERATIONS, 1024, 8, 64, rte_jhash, 0},
171 { LOOKUP, ITERATIONS, 1024, 16, 64, rte_jhash, 0},
173 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
174 { ADD_ON_EMPTY, 1048576, 1048576, 1, 16, rte_jhash, 0},
175 { ADD_ON_EMPTY, 1048576, 1048576, 2, 16, rte_jhash, 0},
176 { ADD_ON_EMPTY, 1048576, 1048576, 4, 16, rte_jhash, 0},
177 { ADD_ON_EMPTY, 1048576, 1048576, 8, 16, rte_jhash, 0},
178 { ADD_ON_EMPTY, 1048576, 1048576, 16, 16, rte_jhash, 0},
179 { ADD_ON_EMPTY, 1048576, 1048576, 1, 32, rte_jhash, 0},
180 { ADD_ON_EMPTY, 1048576, 1048576, 2, 32, rte_jhash, 0},
181 { ADD_ON_EMPTY, 1048576, 1048576, 4, 32, rte_jhash, 0},
182 { ADD_ON_EMPTY, 1048576, 1048576, 8, 32, rte_jhash, 0},
183 { ADD_ON_EMPTY, 1048576, 1048576, 16, 32, rte_jhash, 0},
184 { ADD_ON_EMPTY, 1048576, 1048576, 1, 48, rte_jhash, 0},
185 { ADD_ON_EMPTY, 1048576, 1048576, 2, 48, rte_jhash, 0},
186 { ADD_ON_EMPTY, 1048576, 1048576, 4, 48, rte_jhash, 0},
187 { ADD_ON_EMPTY, 1048576, 1048576, 8, 48, rte_jhash, 0},
188 { ADD_ON_EMPTY, 1048576, 1048576, 16, 48, rte_jhash, 0},
189 { ADD_ON_EMPTY, 1048576, 1048576, 1, 64, rte_jhash, 0},
190 { ADD_ON_EMPTY, 1048576, 1048576, 2, 64, rte_jhash, 0},
191 { ADD_ON_EMPTY, 1048576, 1048576, 4, 64, rte_jhash, 0},
192 { ADD_ON_EMPTY, 1048576, 1048576, 8, 64, rte_jhash, 0},
193 { ADD_ON_EMPTY, 1048576, 1048576, 16, 64, rte_jhash, 0},
194 /* Big table, update */
195 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
196 { ADD_UPDATE, ITERATIONS, 1048576, 1, 16, rte_jhash, 0},
197 { ADD_UPDATE, ITERATIONS, 1048576, 2, 16, rte_jhash, 0},
198 { ADD_UPDATE, ITERATIONS, 1048576, 4, 16, rte_jhash, 0},
199 { ADD_UPDATE, ITERATIONS, 1048576, 8, 16, rte_jhash, 0},
200 { ADD_UPDATE, ITERATIONS, 1048576, 16, 16, rte_jhash, 0},
201 { ADD_UPDATE, ITERATIONS, 1048576, 1, 32, rte_jhash, 0},
202 { ADD_UPDATE, ITERATIONS, 1048576, 2, 32, rte_jhash, 0},
203 { ADD_UPDATE, ITERATIONS, 1048576, 4, 32, rte_jhash, 0},
204 { ADD_UPDATE, ITERATIONS, 1048576, 8, 32, rte_jhash, 0},
205 { ADD_UPDATE, ITERATIONS, 1048576, 16, 32, rte_jhash, 0},
206 { ADD_UPDATE, ITERATIONS, 1048576, 1, 48, rte_jhash, 0},
207 { ADD_UPDATE, ITERATIONS, 1048576, 2, 48, rte_jhash, 0},
208 { ADD_UPDATE, ITERATIONS, 1048576, 4, 48, rte_jhash, 0},
209 { ADD_UPDATE, ITERATIONS, 1048576, 8, 48, rte_jhash, 0},
210 { ADD_UPDATE, ITERATIONS, 1048576, 16, 48, rte_jhash, 0},
211 { ADD_UPDATE, ITERATIONS, 1048576, 1, 64, rte_jhash, 0},
212 { ADD_UPDATE, ITERATIONS, 1048576, 2, 64, rte_jhash, 0},
213 { ADD_UPDATE, ITERATIONS, 1048576, 4, 64, rte_jhash, 0},
214 { ADD_UPDATE, ITERATIONS, 1048576, 8, 64, rte_jhash, 0},
215 { ADD_UPDATE, ITERATIONS, 1048576, 16, 64, rte_jhash, 0},
216 /* Big table, lookup */
217 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
218 { LOOKUP, ITERATIONS, 1048576, 1, 16, rte_jhash, 0},
219 { LOOKUP, ITERATIONS, 1048576, 2, 16, rte_jhash, 0},
220 { LOOKUP, ITERATIONS, 1048576, 4, 16, rte_jhash, 0},
221 { LOOKUP, ITERATIONS, 1048576, 8, 16, rte_jhash, 0},
222 { LOOKUP, ITERATIONS, 1048576, 16, 16, rte_jhash, 0},
223 { LOOKUP, ITERATIONS, 1048576, 1, 32, rte_jhash, 0},
224 { LOOKUP, ITERATIONS, 1048576, 2, 32, rte_jhash, 0},
225 { LOOKUP, ITERATIONS, 1048576, 4, 32, rte_jhash, 0},
226 { LOOKUP, ITERATIONS, 1048576, 8, 32, rte_jhash, 0},
227 { LOOKUP, ITERATIONS, 1048576, 16, 32, rte_jhash, 0},
228 { LOOKUP, ITERATIONS, 1048576, 1, 48, rte_jhash, 0},
229 { LOOKUP, ITERATIONS, 1048576, 2, 48, rte_jhash, 0},
230 { LOOKUP, ITERATIONS, 1048576, 4, 48, rte_jhash, 0},
231 { LOOKUP, ITERATIONS, 1048576, 8, 48, rte_jhash, 0},
232 { LOOKUP, ITERATIONS, 1048576, 16, 48, rte_jhash, 0},
233 { LOOKUP, ITERATIONS, 1048576, 1, 64, rte_jhash, 0},
234 { LOOKUP, ITERATIONS, 1048576, 2, 64, rte_jhash, 0},
235 { LOOKUP, ITERATIONS, 1048576, 4, 64, rte_jhash, 0},
236 { LOOKUP, ITERATIONS, 1048576, 8, 64, rte_jhash, 0},
237 { LOOKUP, ITERATIONS, 1048576, 16, 64, rte_jhash, 0},
238 /* Small table, add */
239 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
240 { ADD_ON_EMPTY, 1024, 1024, 1, 16, rte_hash_crc, 0},
241 { ADD_ON_EMPTY, 1024, 1024, 2, 16, rte_hash_crc, 0},
242 { ADD_ON_EMPTY, 1024, 1024, 4, 16, rte_hash_crc, 0},
243 { ADD_ON_EMPTY, 1024, 1024, 8, 16, rte_hash_crc, 0},
244 { ADD_ON_EMPTY, 1024, 1024, 16, 16, rte_hash_crc, 0},
245 { ADD_ON_EMPTY, 1024, 1024, 1, 32, rte_hash_crc, 0},
246 { ADD_ON_EMPTY, 1024, 1024, 2, 32, rte_hash_crc, 0},
247 { ADD_ON_EMPTY, 1024, 1024, 4, 32, rte_hash_crc, 0},
248 { ADD_ON_EMPTY, 1024, 1024, 8, 32, rte_hash_crc, 0},
249 { ADD_ON_EMPTY, 1024, 1024, 16, 32, rte_hash_crc, 0},
250 { ADD_ON_EMPTY, 1024, 1024, 1, 48, rte_hash_crc, 0},
251 { ADD_ON_EMPTY, 1024, 1024, 2, 48, rte_hash_crc, 0},
252 { ADD_ON_EMPTY, 1024, 1024, 4, 48, rte_hash_crc, 0},
253 { ADD_ON_EMPTY, 1024, 1024, 8, 48, rte_hash_crc, 0},
254 { ADD_ON_EMPTY, 1024, 1024, 16, 48, rte_hash_crc, 0},
255 { ADD_ON_EMPTY, 1024, 1024, 1, 64, rte_hash_crc, 0},
256 { ADD_ON_EMPTY, 1024, 1024, 2, 64, rte_hash_crc, 0},
257 { ADD_ON_EMPTY, 1024, 1024, 4, 64, rte_hash_crc, 0},
258 { ADD_ON_EMPTY, 1024, 1024, 8, 64, rte_hash_crc, 0},
259 { ADD_ON_EMPTY, 1024, 1024, 16, 64, rte_hash_crc, 0},
260 /* Small table, update */
261 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
262 { ADD_UPDATE, ITERATIONS, 1024, 1, 16, rte_hash_crc, 0},
263 { ADD_UPDATE, ITERATIONS, 1024, 2, 16, rte_hash_crc, 0},
264 { ADD_UPDATE, ITERATIONS, 1024, 4, 16, rte_hash_crc, 0},
265 { ADD_UPDATE, ITERATIONS, 1024, 8, 16, rte_hash_crc, 0},
266 { ADD_UPDATE, ITERATIONS, 1024, 16, 16, rte_hash_crc, 0},
267 { ADD_UPDATE, ITERATIONS, 1024, 1, 32, rte_hash_crc, 0},
268 { ADD_UPDATE, ITERATIONS, 1024, 2, 32, rte_hash_crc, 0},
269 { ADD_UPDATE, ITERATIONS, 1024, 4, 32, rte_hash_crc, 0},
270 { ADD_UPDATE, ITERATIONS, 1024, 8, 32, rte_hash_crc, 0},
271 { ADD_UPDATE, ITERATIONS, 1024, 16, 32, rte_hash_crc, 0},
272 { ADD_UPDATE, ITERATIONS, 1024, 1, 48, rte_hash_crc, 0},
273 { ADD_UPDATE, ITERATIONS, 1024, 2, 48, rte_hash_crc, 0},
274 { ADD_UPDATE, ITERATIONS, 1024, 4, 48, rte_hash_crc, 0},
275 { ADD_UPDATE, ITERATIONS, 1024, 8, 48, rte_hash_crc, 0},
276 { ADD_UPDATE, ITERATIONS, 1024, 16, 48, rte_hash_crc, 0},
277 { ADD_UPDATE, ITERATIONS, 1024, 1, 64, rte_hash_crc, 0},
278 { ADD_UPDATE, ITERATIONS, 1024, 2, 64, rte_hash_crc, 0},
279 { ADD_UPDATE, ITERATIONS, 1024, 4, 64, rte_hash_crc, 0},
280 { ADD_UPDATE, ITERATIONS, 1024, 8, 64, rte_hash_crc, 0},
281 { ADD_UPDATE, ITERATIONS, 1024, 16, 64, rte_hash_crc, 0},
282 /* Small table, lookup */
283 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
284 { LOOKUP, ITERATIONS, 1024, 1, 16, rte_hash_crc, 0},
285 { LOOKUP, ITERATIONS, 1024, 2, 16, rte_hash_crc, 0},
286 { LOOKUP, ITERATIONS, 1024, 4, 16, rte_hash_crc, 0},
287 { LOOKUP, ITERATIONS, 1024, 8, 16, rte_hash_crc, 0},
288 { LOOKUP, ITERATIONS, 1024, 16, 16, rte_hash_crc, 0},
289 { LOOKUP, ITERATIONS, 1024, 1, 32, rte_hash_crc, 0},
290 { LOOKUP, ITERATIONS, 1024, 2, 32, rte_hash_crc, 0},
291 { LOOKUP, ITERATIONS, 1024, 4, 32, rte_hash_crc, 0},
292 { LOOKUP, ITERATIONS, 1024, 8, 32, rte_hash_crc, 0},
293 { LOOKUP, ITERATIONS, 1024, 16, 32, rte_hash_crc, 0},
294 { LOOKUP, ITERATIONS, 1024, 1, 48, rte_hash_crc, 0},
295 { LOOKUP, ITERATIONS, 1024, 2, 48, rte_hash_crc, 0},
296 { LOOKUP, ITERATIONS, 1024, 4, 48, rte_hash_crc, 0},
297 { LOOKUP, ITERATIONS, 1024, 8, 48, rte_hash_crc, 0},
298 { LOOKUP, ITERATIONS, 1024, 16, 48, rte_hash_crc, 0},
299 { LOOKUP, ITERATIONS, 1024, 1, 64, rte_hash_crc, 0},
300 { LOOKUP, ITERATIONS, 1024, 2, 64, rte_hash_crc, 0},
301 { LOOKUP, ITERATIONS, 1024, 4, 64, rte_hash_crc, 0},
302 { LOOKUP, ITERATIONS, 1024, 8, 64, rte_hash_crc, 0},
303 { LOOKUP, ITERATIONS, 1024, 16, 64, rte_hash_crc, 0},
305 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
306 { ADD_ON_EMPTY, 1048576, 1048576, 1, 16, rte_hash_crc, 0},
307 { ADD_ON_EMPTY, 1048576, 1048576, 2, 16, rte_hash_crc, 0},
308 { ADD_ON_EMPTY, 1048576, 1048576, 4, 16, rte_hash_crc, 0},
309 { ADD_ON_EMPTY, 1048576, 1048576, 8, 16, rte_hash_crc, 0},
310 { ADD_ON_EMPTY, 1048576, 1048576, 16, 16, rte_hash_crc, 0},
311 { ADD_ON_EMPTY, 1048576, 1048576, 1, 32, rte_hash_crc, 0},
312 { ADD_ON_EMPTY, 1048576, 1048576, 2, 32, rte_hash_crc, 0},
313 { ADD_ON_EMPTY, 1048576, 1048576, 4, 32, rte_hash_crc, 0},
314 { ADD_ON_EMPTY, 1048576, 1048576, 8, 32, rte_hash_crc, 0},
315 { ADD_ON_EMPTY, 1048576, 1048576, 16, 32, rte_hash_crc, 0},
316 { ADD_ON_EMPTY, 1048576, 1048576, 1, 48, rte_hash_crc, 0},
317 { ADD_ON_EMPTY, 1048576, 1048576, 2, 48, rte_hash_crc, 0},
318 { ADD_ON_EMPTY, 1048576, 1048576, 4, 48, rte_hash_crc, 0},
319 { ADD_ON_EMPTY, 1048576, 1048576, 8, 48, rte_hash_crc, 0},
320 { ADD_ON_EMPTY, 1048576, 1048576, 16, 48, rte_hash_crc, 0},
321 { ADD_ON_EMPTY, 1048576, 1048576, 1, 64, rte_hash_crc, 0},
322 { ADD_ON_EMPTY, 1048576, 1048576, 2, 64, rte_hash_crc, 0},
323 { ADD_ON_EMPTY, 1048576, 1048576, 4, 64, rte_hash_crc, 0},
324 { ADD_ON_EMPTY, 1048576, 1048576, 8, 64, rte_hash_crc, 0},
325 { ADD_ON_EMPTY, 1048576, 1048576, 16, 64, rte_hash_crc, 0},
326 /* Big table, update */
327 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
328 { ADD_UPDATE, ITERATIONS, 1048576, 1, 16, rte_hash_crc, 0},
329 { ADD_UPDATE, ITERATIONS, 1048576, 2, 16, rte_hash_crc, 0},
330 { ADD_UPDATE, ITERATIONS, 1048576, 4, 16, rte_hash_crc, 0},
331 { ADD_UPDATE, ITERATIONS, 1048576, 8, 16, rte_hash_crc, 0},
332 { ADD_UPDATE, ITERATIONS, 1048576, 16, 16, rte_hash_crc, 0},
333 { ADD_UPDATE, ITERATIONS, 1048576, 1, 32, rte_hash_crc, 0},
334 { ADD_UPDATE, ITERATIONS, 1048576, 2, 32, rte_hash_crc, 0},
335 { ADD_UPDATE, ITERATIONS, 1048576, 4, 32, rte_hash_crc, 0},
336 { ADD_UPDATE, ITERATIONS, 1048576, 8, 32, rte_hash_crc, 0},
337 { ADD_UPDATE, ITERATIONS, 1048576, 16, 32, rte_hash_crc, 0},
338 { ADD_UPDATE, ITERATIONS, 1048576, 1, 48, rte_hash_crc, 0},
339 { ADD_UPDATE, ITERATIONS, 1048576, 2, 48, rte_hash_crc, 0},
340 { ADD_UPDATE, ITERATIONS, 1048576, 4, 48, rte_hash_crc, 0},
341 { ADD_UPDATE, ITERATIONS, 1048576, 8, 48, rte_hash_crc, 0},
342 { ADD_UPDATE, ITERATIONS, 1048576, 16, 48, rte_hash_crc, 0},
343 { ADD_UPDATE, ITERATIONS, 1048576, 1, 64, rte_hash_crc, 0},
344 { ADD_UPDATE, ITERATIONS, 1048576, 2, 64, rte_hash_crc, 0},
345 { ADD_UPDATE, ITERATIONS, 1048576, 4, 64, rte_hash_crc, 0},
346 { ADD_UPDATE, ITERATIONS, 1048576, 8, 64, rte_hash_crc, 0},
347 { ADD_UPDATE, ITERATIONS, 1048576, 16, 64, rte_hash_crc, 0},
348 /* Big table, lookup */
349 /* Test type | Iterations | Entries | BucketSize | KeyLen | HashFunc | InitVal */
350 { LOOKUP, ITERATIONS, 1048576, 1, 16, rte_hash_crc, 0},
351 { LOOKUP, ITERATIONS, 1048576, 2, 16, rte_hash_crc, 0},
352 { LOOKUP, ITERATIONS, 1048576, 4, 16, rte_hash_crc, 0},
353 { LOOKUP, ITERATIONS, 1048576, 8, 16, rte_hash_crc, 0},
354 { LOOKUP, ITERATIONS, 1048576, 16, 16, rte_hash_crc, 0},
355 { LOOKUP, ITERATIONS, 1048576, 1, 32, rte_hash_crc, 0},
356 { LOOKUP, ITERATIONS, 1048576, 2, 32, rte_hash_crc, 0},
357 { LOOKUP, ITERATIONS, 1048576, 4, 32, rte_hash_crc, 0},
358 { LOOKUP, ITERATIONS, 1048576, 8, 32, rte_hash_crc, 0},
359 { LOOKUP, ITERATIONS, 1048576, 16, 32, rte_hash_crc, 0},
360 { LOOKUP, ITERATIONS, 1048576, 1, 48, rte_hash_crc, 0},
361 { LOOKUP, ITERATIONS, 1048576, 2, 48, rte_hash_crc, 0},
362 { LOOKUP, ITERATIONS, 1048576, 4, 48, rte_hash_crc, 0},
363 { LOOKUP, ITERATIONS, 1048576, 8, 48, rte_hash_crc, 0},
364 { LOOKUP, ITERATIONS, 1048576, 16, 48, rte_hash_crc, 0},
365 { LOOKUP, ITERATIONS, 1048576, 1, 64, rte_hash_crc, 0},
366 { LOOKUP, ITERATIONS, 1048576, 2, 64, rte_hash_crc, 0},
367 { LOOKUP, ITERATIONS, 1048576, 4, 64, rte_hash_crc, 0},
368 { LOOKUP, ITERATIONS, 1048576, 8, 64, rte_hash_crc, 0},
369 { LOOKUP, ITERATIONS, 1048576, 16, 64, rte_hash_crc, 0},
372 /******************************************************************************/
375 * Check condition and return an error if true. Assumes that "handle" is the
376 * name of the hash structure pointer to be freed.
378 #define RETURN_IF_ERROR(cond, str, ...) do { \
380 printf("ERROR line %d: " str "\n", __LINE__, ##__VA_ARGS__); \
381 if (handle) rte_hash_free(handle); \
386 #define RETURN_IF_ERROR_FBK(cond, str, ...) do { \
388 printf("ERROR line %d: " str "\n", __LINE__, ##__VA_ARGS__); \
389 if (handle) rte_fbk_hash_free(handle); \
396 * Find average of array of numbers.
399 get_avg(const uint32_t *array, uint32_t size)
403 for (i = 0; i < size; i++)
405 return sum / (double)size;
409 * To help print out name of hash functions.
411 static const char *get_hash_name(rte_hash_function f)
416 if (f == rte_hash_crc)
417 return "rte_hash_crc";
419 return "UnknownHash";
423 * Do a single performance test, of one type of operation.
426 * hash table to run test on
428 * function to call (add, delete or lookup function)
429 * @param avg_occupancy
430 * The average number of entries in each bucket of the hash table
431 * @param invalid_pos_count
432 * The amount of errors (e.g. due to a full bucket).
434 * The average number of ticks per hash function call. A negative number
438 run_single_tbl_perf_test(const struct rte_hash *h, hash_operation func,
439 const struct tbl_perf_test_params *params, double *avg_occupancy,
440 uint32_t *invalid_pos_count)
442 uint64_t begin, end, ticks = 0;
444 uint32_t *bucket_occupancies = NULL;
445 uint32_t num_buckets, i, j;
449 num_buckets = params->entries / params->bucket_entries;
450 key = rte_zmalloc("hash key",
451 params->key_len * sizeof(uint8_t), 16);
455 bucket_occupancies = rte_calloc("bucket occupancies",
456 num_buckets, sizeof(uint32_t), 16);
457 if (bucket_occupancies == NULL) {
463 *invalid_pos_count = 0;
465 for (i = 0; i < params->num_iterations; i++) {
466 /* Prepare inputs for the current iteration */
467 for (j = 0; j < params->key_len; j++)
468 key[j] = (uint8_t) rte_rand();
470 /* Perform operation, and measure time it takes */
474 ticks += end - begin;
476 /* Other work per iteration */
478 *invalid_pos_count += 1;
480 bucket_occupancies[pos / params->bucket_entries]++;
482 *avg_occupancy = get_avg(bucket_occupancies, num_buckets);
484 rte_free(bucket_occupancies);
487 return (double)ticks / params->num_iterations;
491 * To help print out what tests are being done.
494 get_tbl_perf_test_desc(enum hash_test_t type)
497 case ADD_ON_EMPTY: return "Add on Empty";
498 case DELETE_ON_EMPTY: return "Delete on Empty";
499 case LOOKUP_ON_EMPTY: return "Lookup on Empty";
500 case ADD_UPDATE: return "Add Update";
501 case DELETE: return "Delete";
502 case LOOKUP: return "Lookup";
503 default: return "UNKNOWN";
508 * Run a hash table performance test based on params.
511 run_tbl_perf_test(struct tbl_perf_test_params *params)
513 static unsigned calledCount = 5;
514 struct rte_hash_parameters hash_params = {
515 .entries = params->entries,
516 .bucket_entries = params->bucket_entries,
517 .key_len = params->key_len,
518 .hash_func = params->hash_func,
519 .hash_func_init_val = params->hash_func_init_val,
520 .socket_id = rte_socket_id(),
522 struct rte_hash *handle;
523 double avg_occupancy = 0, ticks = 0;
524 uint32_t num_iterations, invalid_pos;
525 char name[RTE_HASH_NAMESIZE];
526 char hashname[RTE_HASH_NAMESIZE];
528 snprintf(name, 32, "test%u", calledCount++);
529 hash_params.name = name;
531 handle = rte_hash_create(&hash_params);
532 RETURN_IF_ERROR(handle == NULL, "hash creation failed");
534 switch (params->test_type){
536 ticks = run_single_tbl_perf_test(handle, rte_hash_add_key,
537 params, &avg_occupancy, &invalid_pos);
539 case DELETE_ON_EMPTY:
540 ticks = run_single_tbl_perf_test(handle, rte_hash_del_key,
541 params, &avg_occupancy, &invalid_pos);
543 case LOOKUP_ON_EMPTY:
544 ticks = run_single_tbl_perf_test(handle, rte_hash_lookup,
545 params, &avg_occupancy, &invalid_pos);
548 num_iterations = params->num_iterations;
549 params->num_iterations = params->entries;
550 run_single_tbl_perf_test(handle, rte_hash_add_key, params,
551 &avg_occupancy, &invalid_pos);
552 params->num_iterations = num_iterations;
553 ticks = run_single_tbl_perf_test(handle, rte_hash_add_key,
554 params, &avg_occupancy, &invalid_pos);
557 num_iterations = params->num_iterations;
558 params->num_iterations = params->entries;
559 run_single_tbl_perf_test(handle, rte_hash_add_key, params,
560 &avg_occupancy, &invalid_pos);
562 params->num_iterations = num_iterations;
563 ticks = run_single_tbl_perf_test(handle, rte_hash_del_key,
564 params, &avg_occupancy, &invalid_pos);
567 num_iterations = params->num_iterations;
568 params->num_iterations = params->entries;
569 run_single_tbl_perf_test(handle, rte_hash_add_key, params,
570 &avg_occupancy, &invalid_pos);
572 params->num_iterations = num_iterations;
573 ticks = run_single_tbl_perf_test(handle, rte_hash_lookup,
574 params, &avg_occupancy, &invalid_pos);
579 snprintf(hashname, RTE_HASH_NAMESIZE, "%s", get_hash_name(params->hash_func));
581 printf("%-12s, %-15s, %-16u, %-7u, %-18u, %-8u, %-19.2f, %.2f\n",
583 get_tbl_perf_test_desc(params->test_type),
584 (unsigned) params->key_len,
585 (unsigned) params->entries,
586 (unsigned) params->bucket_entries,
587 (unsigned) invalid_pos,
593 rte_hash_free(handle);
598 * Run all hash table performance tests.
600 static int run_all_tbl_perf_tests(void)
604 printf(" *** Hash table performance test results ***\n");
605 printf("Hash Func. , Operation , Key size (bytes), Entries, "
606 "Entries per bucket, Errors , Avg. bucket entries, Ticks/Op.\n");
608 /* Loop through every combination of test parameters */
610 i < sizeof(tbl_perf_params) / sizeof(struct tbl_perf_test_params);
614 if (run_tbl_perf_test(&tbl_perf_params[i]) < 0)
621 * Test a hash function.
623 static void run_hash_func_test(rte_hash_function f, uint32_t init_val,
626 static uint8_t key[RTE_HASH_KEY_LENGTH_MAX];
627 uint64_t ticks = 0, start, end;
630 for (i = 0; i < HASHTEST_ITERATIONS; i++) {
632 for (j = 0; j < key_len; j++)
633 key[j] = (uint8_t) rte_rand();
636 f(key, key_len, init_val);
638 ticks += end - start;
641 printf("%-12s, %-18u, %-13u, %.02f\n", get_hash_name(f), (unsigned) key_len,
642 (unsigned) init_val, (double)ticks / HASHTEST_ITERATIONS);
646 * Test all hash functions.
648 static void run_hash_func_tests(void)
652 printf("\n\n *** Hash function performance test results ***\n");
653 printf(" Number of iterations for each test = %d\n",
654 HASHTEST_ITERATIONS);
655 printf("Hash Func. , Key Length (bytes), Initial value, Ticks/Op.\n");
658 i < sizeof(hashtest_funcs) / sizeof(rte_hash_function);
661 j < sizeof(hashtest_initvals) / sizeof(uint32_t);
664 k < sizeof(hashtest_key_lens) / sizeof(uint32_t);
666 run_hash_func_test(hashtest_funcs[i],
667 hashtest_initvals[j],
668 hashtest_key_lens[k]);
674 /* Control operation of performance testing of fbk hash. */
675 #define LOAD_FACTOR 0.667 /* How full to make the hash table. */
676 #define TEST_SIZE 1000000 /* How many operations to time. */
677 #define TEST_ITERATIONS 30 /* How many measurements to take. */
678 #define ENTRIES (1 << 15) /* How many entries. */
681 fbk_hash_perf_test(void)
683 struct rte_fbk_hash_params params = {
684 .name = "fbk_hash_test",
686 .entries_per_bucket = 4,
687 .socket_id = rte_socket_id(),
689 struct rte_fbk_hash_table *handle = NULL;
690 uint32_t *keys = NULL;
691 unsigned indexes[TEST_SIZE];
692 uint64_t lookup_time = 0;
697 handle = rte_fbk_hash_create(¶ms);
698 RETURN_IF_ERROR_FBK(handle == NULL, "fbk hash creation failed");
700 keys = rte_zmalloc(NULL, ENTRIES * sizeof(*keys), 0);
701 RETURN_IF_ERROR_FBK(keys == NULL,
702 "fbk hash: memory allocation for key store failed");
704 /* Generate random keys and values. */
705 for (i = 0; i < ENTRIES; i++) {
706 uint32_t key = (uint32_t)rte_rand();
707 key = ((uint64_t)key << 32) | (uint64_t)rte_rand();
708 uint16_t val = (uint16_t)rte_rand();
710 if (rte_fbk_hash_add_key(handle, key, val) == 0) {
714 if (added > (LOAD_FACTOR * ENTRIES)) {
719 for (i = 0; i < TEST_ITERATIONS; i++) {
723 /* Generate random indexes into keys[] array. */
724 for (j = 0; j < TEST_SIZE; j++) {
725 indexes[j] = rte_rand() % added;
730 for (j = 0; j < TEST_SIZE; j++) {
731 value += rte_fbk_hash_lookup(handle, keys[indexes[j]]);
734 lookup_time += (double)(end - begin);
737 printf("\n\n *** FBK Hash function performance test results ***\n");
739 * The use of the 'value' variable ensures that the hash lookup is not
740 * being optimised out by the compiler.
743 printf("Number of ticks per lookup = %g\n",
744 (double)lookup_time /
745 ((double)TEST_ITERATIONS * (double)TEST_SIZE));
747 rte_fbk_hash_free(handle);
753 * Do all unit and performance tests.
758 if (run_all_tbl_perf_tests() < 0)
760 run_hash_func_tests();
762 if (fbk_hash_perf_test() < 0)
767 static struct test_command hash_perf_cmd = {
768 .command = "hash_perf_autotest",
769 .callback = test_hash_perf,
771 REGISTER_TEST_COMMAND(hash_perf_cmd);