2 * Copyright (c) 2015 Cisco and/or its affiliates.
3 * Licensed under the Apache License, Version 2.0 (the "License");
4 * you may not use this file except in compliance with the License.
5 * You may obtain a copy of the License at:
7 * http://www.apache.org/licenses/LICENSE-2.0
9 * Unless required by applicable law or agreed to in writing, software
10 * distributed under the License is distributed on an "AS IS" BASIS,
11 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
12 * See the License for the specific language governing permissions and
13 * limitations under the License.
15 #include <vppinfra/time.h>
16 #include <vppinfra/cache.h>
17 #include <vppinfra/error.h>
18 #include <sys/resource.h>
22 #include <vppinfra/bihash_8_8.h>
23 #include <vppinfra/bihash_template.h>
25 #include <vppinfra/bihash_template.c>
29 volatile u32 thread_barrier;
30 volatile u32 threads_running;
31 volatile u64 sequence_number;
39 int careful_delete_tests;
45 uword hash_memory_size;
46 BVT (clib_bihash) hash;
47 clib_time_t clib_time;
50 unformat_input_t *input;
54 test_main_t test_main;
63 test_bihash_vec64 (test_main_t * tm)
65 u32 user_buckets = 1228800;
66 u32 user_memory_size = 209715200;
67 BVT (clib_bihash_kv) kv;
71 BVT (clib_bihash) * h;
76 BV (clib_bihash_master_init_svm) (h, "test", user_buckets,
77 0x30000000 /* base_addr */ ,
80 BV (clib_bihash_init) (h, "test", user_buckets, user_memory_size);
83 before = clib_time_now (&tm->clib_time);
85 for (j = 0; j < 10; j++)
87 for (i = 1; i <= j * 1000 + 1; i++)
92 BV (clib_bihash_add_del) (h, &kv, 1 /* is_add */ );
95 vec_add1 (cum_times, clib_time_now (&tm->clib_time) - before);
98 for (j = 0; j < vec_len (cum_times); j++)
99 fformat (stdout, "Cum time for %d: %.4f (us)\n", (j + 1) * 1000,
106 stale_cb (BVT (clib_bihash_kv) * kv, void *ctx)
108 test_main_t *tm = ctx;
115 static clib_error_t *
116 test_bihash_stale_overwrite (test_main_t * tm)
118 BVT (clib_bihash) * h;
119 BVT (clib_bihash_kv) kv;
121 tm->noverwritten = 0;
126 BV (clib_bihash_master_init_svm) (h, "test", tm->nbuckets,
127 0x30000000 /* base_addr */ ,
128 tm->hash_memory_size);
130 BV (clib_bihash_init) (h, "test", tm->nbuckets, tm->hash_memory_size);
133 fformat (stdout, "Add %d items to %d buckets\n", tm->nitems, tm->nbuckets);
135 for (i = 0; i < tm->nitems; i++)
140 BV (clib_bihash_add_or_overwrite_stale) (h, &kv, stale_cb, tm);
143 fformat (stdout, "%d items overwritten\n", tm->noverwritten);
144 fformat (stdout, "%U", BV (format_bihash), h, 0);
150 test_bihash_thread_fn (void *arg)
152 BVT (clib_bihash) * h;
153 BVT (clib_bihash_kv) kv;
154 test_main_t *tm = &test_main;
158 u32 my_thread_index = (u32) (u64) arg;
159 __os_thread_index = my_thread_index;
160 clib_mem_set_per_cpu_heap (tm->global_heap);
162 while (tm->thread_barrier)
167 for (i = 0; i < tm->ncycles; i++)
169 for (j = 0; j < tm->nitems; j++)
171 kv.key = ((u64) my_thread_index << 32) | (u64) j;
172 kv.value = ((u64) my_thread_index << 32) | (u64) j;
173 (void) __atomic_add_fetch (&tm->sequence_number, 1,
175 BV (clib_bihash_add_del) (h, &kv, 1 /* is_add */ );
177 for (j = 0; j < tm->nitems; j++)
179 kv.key = ((u64) my_thread_index << 32) | (u64) j;
180 kv.value = ((u64) my_thread_index << 32) | (u64) j;
181 (void) __atomic_add_fetch (&tm->sequence_number, 1,
183 BV (clib_bihash_add_del) (h, &kv, 0 /* is_add */ );
187 (void) __atomic_sub_fetch (&tm->threads_running, 1, __ATOMIC_ACQUIRE);
190 struct timespec ts, tsrem;
194 while (nanosleep (&ts, &tsrem) < 0)
197 return (0); /* not so much */
200 static clib_error_t *
201 test_bihash_threads (test_main_t * tm)
205 BVT (clib_bihash) * h;
211 BV (clib_bihash_master_init_svm) (h, "test", tm->nbuckets,
212 0x30000000 /* base_addr */ ,
213 tm->hash_memory_size);
215 BV (clib_bihash_init) (h, "test", tm->nbuckets, tm->hash_memory_size);
218 tm->thread_barrier = 1;
220 /* Start the worker threads */
221 for (i = 0; i < tm->nthreads; i++)
223 rv = pthread_create (&handle, NULL, test_bihash_thread_fn,
227 clib_unix_warning ("pthread_create returned %d", rv);
230 tm->threads_running = i;
231 tm->sequence_number = 0;
232 CLIB_MEMORY_BARRIER ();
234 /* start the workers */
235 tm->thread_barrier = 0;
237 while (tm->threads_running)
239 struct timespec ts, tsrem;
241 ts.tv_nsec = 20 * 1000 * 1000; /* sleep for 20ms at a time */
243 while (nanosleep (&ts, &tsrem) < 0)
251 static clib_error_t *
252 test_bihash (test_main_t * tm)
256 uword total_searches;
258 BVT (clib_bihash) * h;
259 BVT (clib_bihash_kv) kv;
265 BV (clib_bihash_master_init_svm) (h, "test", tm->nbuckets,
266 0x30000000 /* base_addr */ ,
267 tm->hash_memory_size);
269 BV (clib_bihash_init) (h, "test", tm->nbuckets, tm->hash_memory_size);
272 for (acycle = 0; acycle < tm->ncycles; acycle++)
274 if ((acycle % tm->report_every_n) == 0)
276 fformat (stdout, "Cycle %lld out of %lld...\n",
277 acycle, tm->ncycles);
279 fformat (stdout, "Pick %lld unique %s keys...\n",
280 tm->nitems, tm->non_random_keys ? "non-random" : "random");
283 for (i = 0; i < tm->nitems; i++)
287 if (tm->non_random_keys == 0)
291 rndkey = random_u64 (&tm->seed);
293 p = hash_get (tm->key_hash, rndkey);
298 rndkey = (u64) (i + 1) << 16;
301 hash_set (tm->key_hash, rndkey, i + 1);
302 vec_add1 (tm->keys, rndkey);
306 if ((acycle % tm->report_every_n) == 0)
307 fformat (stdout, "Add items...\n");
309 for (i = 0; i < tm->nitems; i++)
311 kv.key = tm->keys[i];
314 BV (clib_bihash_add_del) (h, &kv, 1 /* is_add */ );
318 fformat (stdout, "--------------------\n");
319 fformat (stdout, "After adding key %llu value %lld...\n",
320 tm->keys[i], (u64) (i + 1));
321 fformat (stdout, "%U", BV (format_bihash), h,
322 2 /* very verbose */ );
326 if ((acycle % tm->report_every_n) == 0)
328 fformat (stdout, "%U", BV (format_bihash), h,
329 0 /* very verbose */ );
331 fformat (stdout, "Search for items %d times...\n", tm->search_iter);
334 before = clib_time_now (&tm->clib_time);
336 for (j = 0; j < tm->search_iter; j++)
338 for (i = 0; i < tm->nitems; i++)
340 /* Prefetch buckets 8 iterations ahead */
341 if (1 && (i < (tm->nitems - 8)))
343 BVT (clib_bihash_kv) pref_kv;
345 pref_kv.key = tm->keys[i + 8];
346 pref_hash = BV (clib_bihash_hash) (&pref_kv);
347 BV (clib_bihash_prefetch_bucket) (h, pref_hash);
350 kv.key = tm->keys[i];
351 if (BV (clib_bihash_search) (h, &kv, &kv) < 0)
352 if (BV (clib_bihash_search) (h, &kv, &kv) < 0)
354 ("[%d] search for key %lld failed unexpectedly\n", i,
356 if (kv.value != (u64) (i + 1))
358 ("[%d] search for key %lld returned %lld, not %lld\n", i,
359 tm->keys, kv.value, (u64) (i + 1));
363 if ((acycle % tm->report_every_n) == 0)
365 delta = clib_time_now (&tm->clib_time) - before;
366 total_searches = (uword) tm->search_iter * (uword) tm->nitems;
370 "%.f searches per second, %.2f nsec per search\n",
371 ((f64) total_searches) / delta,
372 1e9 * (delta / ((f64) total_searches)));
374 fformat (stdout, "%lld searches in %.6f seconds\n", total_searches,
377 fformat (stdout, "Standard E-hash search for items %d times...\n",
381 before = clib_time_now (&tm->clib_time);
383 for (j = 0; j < tm->search_iter; j++)
385 for (i = 0; i < tm->nitems; i++)
387 p = hash_get (tm->key_hash, tm->keys[i]);
388 if (p == 0 || p[0] != (uword) (i + 1))
389 clib_warning ("ugh, couldn't find %lld\n", tm->keys[i]);
393 delta = clib_time_now (&tm->clib_time) - before;
394 total_searches = (uword) tm->search_iter * (uword) tm->nitems;
396 if ((acycle % tm->report_every_n) == 0)
398 fformat (stdout, "%lld searches in %.6f seconds\n",
399 total_searches, delta);
402 fformat (stdout, "%.f searches per second\n",
403 ((f64) total_searches) / delta);
404 fformat (stdout, "Delete items...\n");
407 for (i = 0; i < tm->nitems; i++)
412 kv.key = tm->keys[i];
413 kv.value = (u64) (i + 1);
414 rv = BV (clib_bihash_add_del) (h, &kv, 0 /* is_add */ );
417 clib_warning ("delete key %lld not ok but should be",
420 if (tm->careful_delete_tests)
422 for (j = 0; j < tm->nitems; j++)
424 /* Prefetch buckets 8 iterations ahead */
425 if (1 && (j < (tm->nitems - 8)))
427 BVT (clib_bihash_kv) pref_kv;
429 pref_kv.key = tm->keys[j + 8];
430 pref_hash = BV (clib_bihash_hash) (&pref_kv);
431 BV (clib_bihash_prefetch_bucket) (h, pref_hash);
434 kv.key = tm->keys[j];
435 rv = BV (clib_bihash_search) (h, &kv, &kv);
436 if (j <= i && rv >= 0)
439 ("i %d j %d search ok but should not be, value %lld",
444 clib_warning ("i %d j %d search not ok but should be",
450 if ((acycle % tm->report_every_n) == 0)
452 struct rusage r_usage;
453 getrusage (RUSAGE_SELF, &r_usage);
454 fformat (stdout, "Kernel RSS: %ld bytes\n", r_usage.ru_maxrss);
455 fformat (stdout, "%U\n", BV (format_bihash), h, 0 /* verbose */ );
458 /* Clean up side-bet hash table and random key vector */
459 hash_free (tm->key_hash);
460 vec_reset_length (tm->keys);
461 /* Recreate hash table if we're going to need it again */
462 if (acycle != (tm->ncycles - 1))
463 tm->key_hash = hash_create (tm->nitems, sizeof (uword));
466 fformat (stdout, "End of run, should be empty...\n");
468 fformat (stdout, "%U", BV (format_bihash), h, 0 /* very verbose */ );
470 BV (clib_bihash_free) (h);
476 test_bihash_main (test_main_t * tm)
478 unformat_input_t *i = tm->input;
482 tm->report_every_n = 1;
483 tm->hash_memory_size = 1ULL << 30;
485 while (unformat_check_input (i) != UNFORMAT_END_OF_INPUT)
487 if (unformat (i, "seed %u", &tm->seed))
490 else if (unformat (i, "nbuckets %d", &tm->nbuckets))
492 else if (unformat (i, "non-random-keys"))
493 tm->non_random_keys = 1;
494 else if (unformat (i, "nitems %d", &tm->nitems))
496 else if (unformat (i, "ncycles %d", &tm->ncycles))
498 else if (unformat (i, "careful %d", &tm->careful_delete_tests))
500 else if (unformat (i, "verbose %d", &tm->verbose))
502 else if (unformat (i, "search %d", &tm->search_iter))
504 else if (unformat (i, "report-every %d", &tm->report_every_n))
506 else if (unformat (i, "memory-size %U",
507 unformat_memory_size, &tm->hash_memory_size))
509 else if (unformat (i, "vec64"))
511 else if (unformat (i, "threads %u", &tm->nthreads))
513 else if (unformat (i, "verbose"))
515 else if (unformat (i, "stale-overwrite"))
518 return clib_error_return (0, "unknown input '%U'",
519 format_unformat_error, i);
522 /* Preallocate hash table, key vector */
523 tm->key_hash = hash_create (tm->nitems, sizeof (uword));
524 vec_validate (tm->keys, tm->nitems - 1);
525 _vec_len (tm->keys) = 0;
531 error = test_bihash (tm);
535 error = test_bihash_vec64 (tm);
539 error = test_bihash_threads (tm);
543 error = test_bihash_stale_overwrite (tm);
547 return clib_error_return (0, "no such test?");
555 main (int argc, char *argv[])
559 test_main_t *tm = &test_main;
561 clib_mem_init (0, 4095ULL << 20);
563 tm->global_heap = clib_mem_get_per_cpu_heap ();
566 tm->seed = 0xdeaddabe;
573 tm->careful_delete_tests = 0;
574 clib_time_init (&tm->clib_time);
576 unformat_init_command_line (&i, argv);
577 error = test_bihash_main (tm);
582 clib_error_report (error);
587 #endif /* CLIB_UNIX */
590 * fd.io coding-style-patch-verification: ON
593 * eval: (c-set-style "gnu")