2 * Copyright (c) 2017 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.
16 #include <vppinfra/time.h>
17 #include <vppinfra/cache.h>
18 #include <vppinfra/error.h>
19 #include <vppinfra/heap.h>
20 #include <vppinfra/format.h>
21 #include <vppinfra/pool.h>
22 #include <vppinfra/error.h>
23 #include <vppinfra/hash.h>
24 #include <vppinfra/cache.h>
26 #include <vppinfra/time.h>
27 #include <vppinfra/cache.h>
28 #include <vppinfra/error.h>
30 #include <vppinfra/cuckoo_8_8.h>
31 #include <vppinfra/cuckoo_template.h>
32 #include <vppinfra/cuckoo_template.c>
40 int careful_delete_tests;
45 CVT (clib_cuckoo) hash;
46 clib_time_t clib_time;
48 unformat_input_t *input;
52 test_main_t test_main;
61 do_search (test_main_t * tm, CVT (clib_cuckoo) * h)
64 CVT (clib_cuckoo_kv) kv;
65 for (j = 0; j < tm->search_iter; j++)
67 for (i = 0; i < tm->nitems; i++)
70 if (CV (clib_cuckoo_search) (h, &kv, &kv) < 0)
71 if (CV (clib_cuckoo_search) (h, &kv, &kv) < 0)
72 clib_warning ("[%d] search for key %llu failed unexpectedly\n",
74 if (kv.value != (u64) (i + 1))
76 ("[%d] search for key %llu returned %llu, not %llu\n", i,
77 tm->keys[i], kv.value, (u64) (i + 1));
83 cb (CVT (clib_cuckoo) * h, void *ctx)
85 fformat (stdout, "Garbage callback called...");
86 if (clib_cpu_time_now () % 3)
88 fformat (stdout, "collecting garbage...\n");
89 CV (clib_cuckoo_garbage_collect) (h);
93 fformat (stdout, "ignoring for now...\n");
98 test_cuckoo (test_main_t * tm)
102 uword total_searches;
104 CVT (clib_cuckoo) * h;
105 CVT (clib_cuckoo_kv) kv;
109 CV (clib_cuckoo_init) (h, "test", tm->nbuckets, cb, NULL);
111 fformat (stdout, "Pick %lld unique %s keys...\n", tm->nitems,
112 tm->non_random_keys ? "non-random" : "random");
114 for (i = 0; i < tm->nitems; i++)
118 if (tm->non_random_keys == 0)
122 rndkey = random_u64 (&tm->seed);
124 p = hash_get (tm->key_hash, rndkey);
129 rndkey = (u64) (i + 1) << 16;
131 hash_set (tm->key_hash, rndkey, i + 1);
132 vec_add1 (tm->keys, rndkey);
135 fformat (stdout, "Add items...\n");
136 for (i = 0; i < tm->nitems; i++)
138 kv.key = tm->keys[i];
141 CV (clib_cuckoo_add_del) (h, &kv, 1 /* is_add */ ,
146 fformat (stdout, "--------------------\n");
147 fformat (stdout, "After adding key %llu value %lld...\n",
148 tm->keys[i], (u64) (i + 1));
149 fformat (stdout, "%U", CV (format_cuckoo), h,
150 2 /* very verbose */ );
153 CVT (clib_cuckoo_kv) kv2;
154 int rv = CV (clib_cuckoo_search) (h, &kv, &kv2);
155 ASSERT (CLIB_CUCKOO_ERROR_SUCCESS == rv);
158 fformat (stdout, "%U", CV (format_cuckoo), h, 0 /* very verbose */ );
160 fformat (stdout, "Search for items %d times...\n", tm->search_iter);
162 before = clib_time_now (&tm->clib_time);
166 delta = clib_time_now (&tm->clib_time) - before;
167 total_searches = (uword) tm->search_iter * (uword) tm->nitems;
170 fformat (stdout, "%.f searches per second\n",
171 ((f64) total_searches) / delta);
173 fformat (stdout, "%lld searches in %.6f seconds\n", total_searches, delta);
177 fformat (stdout, "Standard E-hash search for items %d times...\n",
180 before = clib_time_now (&tm->clib_time);
182 for (j = 0; j < tm->search_iter; j++)
184 for (i = 0; i < tm->nitems; i++)
186 p = hash_get (tm->key_hash, tm->keys[i]);
187 if (p == 0 || p[0] != (uword) (i + 1))
188 clib_warning ("ugh, couldn't find %lld\n", tm->keys[i]);
192 delta = clib_time_now (&tm->clib_time) - before;
193 total_searches = (uword) tm->search_iter * (uword) tm->nitems;
195 fformat (stdout, "%lld searches in %.6f seconds\n", total_searches, delta);
198 fformat (stdout, "%.f searches per second\n",
199 ((f64) total_searches) / delta);
202 fformat (stdout, "Delete items...\n");
204 for (i = 0; i < tm->nitems; i++)
209 kv.key = tm->keys[i];
210 kv.value = (u64) (i + 1);
211 rv = CV (clib_cuckoo_add_del) (h, &kv, 0 /* is_add */ ,
212 0 /* dont_overwrite */ );
215 clib_warning ("delete key %lld not ok but should be", tm->keys[i]);
217 if (tm->careful_delete_tests)
219 for (j = 0; j < tm->nitems; j++)
221 kv.key = tm->keys[j];
222 rv = CV (clib_cuckoo_search) (h, &kv, &kv);
223 if (j <= i && rv >= 0)
226 ("i %d j %d search ok but should not be, value %lld", i,
231 clib_warning ("i %d j %d search not ok but should be", i,
238 fformat (stdout, "After deletions, should be empty...\n");
240 fformat (stdout, "%U", CV (format_cuckoo), h, 0 /* very verbose */ );
245 test_cuckoo_main (test_main_t * tm)
247 unformat_input_t *i = tm->input;
250 while (unformat_check_input (i) != UNFORMAT_END_OF_INPUT)
252 if (unformat (i, "seed %u", &tm->seed))
254 else if (unformat (i, "nbuckets %d", &tm->nbuckets))
256 else if (unformat (i, "non-random-keys"))
257 tm->non_random_keys = 1;
258 else if (unformat (i, "nitems %d", &tm->nitems))
260 else if (unformat (i, "careful %d", &tm->careful_delete_tests))
262 else if (unformat (i, "verbose %d", &tm->verbose))
264 else if (unformat (i, "search %d", &tm->search_iter))
266 else if (unformat (i, "verbose"))
269 return clib_error_return (0, "unknown input '%U'",
270 format_unformat_error, i);
273 error = test_cuckoo (tm);
280 main (int argc, char *argv[])
284 test_main_t *tm = &test_main;
286 clib_mem_init (0, 3ULL << 30);
289 tm->seed = 0xdeaddabe;
294 tm->search_iter = 10000;
295 tm->careful_delete_tests = 0;
296 tm->key_hash = hash_create (0, sizeof (uword));
297 clib_time_init (&tm->clib_time);
299 unformat_init_command_line (&i, argv);
300 error = test_cuckoo_main (tm);
305 clib_error_report (error);
310 #endif /* CLIB_UNIX */
313 * fd.io coding-style-patch-verification: ON
316 * eval: (c-set-style "gnu")