2 Copyright (c) 2014 Cisco and/or its affiliates.
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at:
8 * http://www.apache.org/licenses/LICENSE-2.0
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
17 /** @cond DOCUMENTATION_IS_IN_BIHASH_DOC_H */
20 * Note: to instantiate the template multiple times in a single file,
21 * #undef __included_bihash_template_h__...
23 #ifndef __included_bihash_template_h__
24 #define __included_bihash_template_h__
26 #include <vppinfra/heap.h>
27 #include <vppinfra/format.h>
28 #include <vppinfra/pool.h>
29 #include <vppinfra/cache.h>
30 #include <vppinfra/lock.h>
33 #error BIHASH_TYPE not defined
36 #ifdef BIHASH_32_64_SVM
37 #undef HAVE_MEMFD_CREATE
38 #include <vppinfra/linux/syscall.h>
40 #define F_LINUX_SPECIFIC_BASE 1024
41 #define F_ADD_SEALS (F_LINUX_SPECIFIC_BASE + 9)
42 #define F_SEAL_SHRINK (2)
43 /* Max page size 2**16 due to refcount width */
44 #define BIHASH_FREELIST_LENGTH 17
47 /* default is 2MB, use 30 for 1GB */
48 #ifndef BIHASH_LOG2_HUGEPAGE_SIZE
49 #define BIHASH_LOG2_HUGEPAGE_SIZE 21
53 #define __bv(a,b) _bv(a,b)
54 #define BV(a) __bv(a,BIHASH_TYPE)
56 #define _bvt(a,b) a##b##_t
57 #define __bvt(a,b) _bvt(a,b)
58 #define BVT(a) __bvt(a,BIHASH_TYPE)
60 #define _bvs(a,b) struct a##b
61 #define __bvs(a,b) _bvs(a,b)
62 #define BVS(a) __bvs(a,BIHASH_TYPE)
65 #define OVERFLOW_ASSERT(x) ASSERT(((x) & 0xFFFFFFFF00000000ULL) == 0)
66 #define u64_to_pointer(x) (void *)(u32)((x))
67 #define pointer_to_u64(x) (u64)(u32)((x))
69 #define OVERFLOW_ASSERT(x)
70 #define u64_to_pointer(x) (void *)((x))
71 #define pointer_to_u64(x) (u64)((x))
74 typedef struct BV (clib_bihash_value)
78 BVT (clib_bihash_kv) kvp[BIHASH_KVP_PER_PAGE];
81 } BVT (clib_bihash_value);
83 #define BIHASH_BUCKET_OFFSET_BITS 36
91 u64 offset:BIHASH_BUCKET_OFFSET_BITS;
99 } BVT (clib_bihash_bucket);
101 STATIC_ASSERT_SIZEOF (BVT (clib_bihash_bucket), sizeof (u64));
104 typedef CLIB_PACKED (struct {
106 * Backing store allocation. Since bihash manages its own
107 * freelists, we simple dole out memory starting from alloc_arena[alloc_arena_next].
109 u64 alloc_arena_next; /* Next offset from alloc_arena to allocate, definitely NOT a constant */
110 u64 alloc_arena_size; /* Size of the arena */
111 u64 alloc_arena_mapped; /* Size of the mapped memory in the arena */
112 /* Two SVM pointers stored as 8-byte integers */
113 u64 alloc_lock_as_u64;
115 /* freelist list-head arrays/vectors */
116 u64 freelists_as_u64;
117 u32 nbuckets; /* Number of buckets */
118 /* Set when header valid */
121 }) BVT (clib_bihash_shared_header);
124 STATIC_ASSERT_SIZEOF (BVT (clib_bihash_shared_header), 8 * sizeof (u64));
129 BVT (clib_bihash_bucket) * buckets;
130 volatile u32 *alloc_lock;
132 BVT (clib_bihash_value) ** working_copies;
133 int *working_copy_lengths;
134 BVT (clib_bihash_bucket) saved_bucket;
144 BVT (clib_bihash_shared_header) * sh;
147 BVT (clib_bihash_shared_header) sh;
150 u64 alloc_arena; /* Base of the allocation arena */
151 volatile u8 instantiated;
154 * A custom format function to print the Key and Value of bihash_key instead of default hexdump
156 format_function_t *fmt_fn;
158 /** Optional statistics-gathering callback */
159 #if BIHASH_ENABLE_STATS
160 void (*inc_stats_callback) (BVS (clib_bihash) *, int stat_id, u64 count);
162 /** Statistics callback context (e.g. address of stats data structure) */
163 void *inc_stats_context;
170 BVT (clib_bihash) * h;
174 format_function_t *fmt_fn;
175 u8 instantiate_immediately;
176 u8 dont_add_to_all_bihash_list;
177 } BVT (clib_bihash_init2_args);
179 extern void **clib_all_bihashes;
182 #undef alloc_arena_next
183 #undef alloc_arena_size
184 #undef alloc_arena_mapped
186 #undef CLIB_BIHASH_READY_MAGIC
187 #define alloc_arena_next(h) (((h)->sh)->alloc_arena_next)
188 #define alloc_arena_size(h) (((h)->sh)->alloc_arena_size)
189 #define alloc_arena_mapped(h) (((h)->sh)->alloc_arena_mapped)
190 #define alloc_arena(h) ((h)->alloc_arena)
191 #define CLIB_BIHASH_READY_MAGIC 0xFEEDFACE
193 #undef alloc_arena_next
194 #undef alloc_arena_size
195 #undef alloc_arena_mapped
197 #undef CLIB_BIHASH_READY_MAGIC
198 #define alloc_arena_next(h) ((h)->sh.alloc_arena_next)
199 #define alloc_arena_size(h) ((h)->sh.alloc_arena_size)
200 #define alloc_arena_mapped(h) ((h)->sh.alloc_arena_mapped)
201 #define alloc_arena(h) ((h)->alloc_arena)
202 #define CLIB_BIHASH_READY_MAGIC 0
205 #ifndef BIHASH_STAT_IDS
206 #define BIHASH_STAT_IDS 1
208 #define foreach_bihash_stat \
218 _(working_copy_lost) \
219 _(splits) /* must be last */
223 #define _(a) BIHASH_STAT_##a,
227 } BVT (clib_bihash_stat_id);
228 #endif /* BIHASH_STAT_IDS */
230 static inline void BV (clib_bihash_increment_stat) (BVT (clib_bihash) * h,
231 int stat_id, u64 count)
233 #if BIHASH_ENABLE_STATS
234 if (PREDICT_FALSE (h->inc_stats_callback != 0))
235 h->inc_stats_callback (h, stat_id, count);
239 #if BIHASH_ENABLE_STATS
240 static inline void BV (clib_bihash_set_stats_callback)
241 (BVT (clib_bihash) * h, void (*cb) (BVT (clib_bihash) *, int, u64),
244 h->inc_stats_callback = cb;
245 h->inc_stats_context = ctx;
250 static inline void BV (clib_bihash_alloc_lock) (BVT (clib_bihash) * h)
252 while (__atomic_test_and_set (h->alloc_lock, __ATOMIC_ACQUIRE))
256 static inline void BV (clib_bihash_alloc_unlock) (BVT (clib_bihash) * h)
258 __atomic_clear (h->alloc_lock, __ATOMIC_RELEASE);
261 static inline void BV (clib_bihash_lock_bucket) (BVT (clib_bihash_bucket) * b)
263 BVT (clib_bihash_bucket) unlocked_bucket, locked_bucket;
265 locked_bucket.as_u64 = unlocked_bucket.as_u64 = b->as_u64;
266 unlocked_bucket.lock = 0;
267 locked_bucket.lock = 1;
269 while (__atomic_compare_exchange_n (&b->as_u64, &unlocked_bucket.as_u64,
270 locked_bucket.as_u64, 1 /* weak */ ,
272 __ATOMIC_ACQUIRE) == 0)
275 locked_bucket.as_u64 = unlocked_bucket.as_u64 = b->as_u64;
276 unlocked_bucket.lock = 0;
277 locked_bucket.lock = 1;
281 static inline void BV (clib_bihash_unlock_bucket)
282 (BVT (clib_bihash_bucket) * b)
287 static inline void *BV (clib_bihash_get_value) (BVT (clib_bihash) * h,
290 u8 *hp = (u8 *) (uword) alloc_arena (h);
291 u8 *vp = hp + offset;
296 static inline int BV (clib_bihash_bucket_is_empty)
297 (BVT (clib_bihash_bucket) * b)
299 /* Note: applied to locked buckets, test offset */
300 if (BIHASH_KVP_AT_BUCKET_LEVEL == 0)
301 return b->offset == 0;
303 return (b->log2_pages == 0 && b->refcnt == 1);
306 static inline uword BV (clib_bihash_get_offset) (BVT (clib_bihash) * h,
311 hp = (u8 *) (uword) alloc_arena (h);
317 void BV (clib_bihash_init)
318 (BVT (clib_bihash) * h, char *name, u32 nbuckets, uword memory_size);
320 void BV (clib_bihash_init2) (BVT (clib_bihash_init2_args) * a);
323 void BV (clib_bihash_master_init_svm)
324 (BVT (clib_bihash) * h, char *name, u32 nbuckets, u64 memory_size);
325 void BV (clib_bihash_slave_init_svm)
326 (BVT (clib_bihash) * h, char *name, int fd);
329 void BV (clib_bihash_set_kvp_format_fn) (BVT (clib_bihash) * h,
330 format_function_t * fmt_fn);
332 void BV (clib_bihash_free) (BVT (clib_bihash) * h);
334 int BV (clib_bihash_add_del) (BVT (clib_bihash) * h,
335 BVT (clib_bihash_kv) * add_v, int is_add);
336 int BV (clib_bihash_add_or_overwrite_stale) (BVT (clib_bihash) * h,
337 BVT (clib_bihash_kv) * add_v,
338 int (*is_stale_cb) (BVT
342 int BV (clib_bihash_search) (BVT (clib_bihash) * h,
343 BVT (clib_bihash_kv) * search_v,
344 BVT (clib_bihash_kv) * return_v);
346 #define BIHASH_WALK_STOP 0
347 #define BIHASH_WALK_CONTINUE 1
350 int (*BV (clib_bihash_foreach_key_value_pair_cb)) (BVT (clib_bihash_kv) *,
352 void BV (clib_bihash_foreach_key_value_pair) (BVT (clib_bihash) * h,
354 (clib_bihash_foreach_key_value_pair_cb)
356 void *clib_all_bihash_set_heap (void);
357 void clib_bihash_copied (void *dst, void *src);
359 format_function_t BV (format_bihash);
360 format_function_t BV (format_bihash_kvp);
361 format_function_t BV (format_bihash_lru);
364 BVT (clib_bihash_bucket) *
365 BV (clib_bihash_get_bucket) (BVT (clib_bihash) * h, u64 hash)
367 #if BIHASH_KVP_AT_BUCKET_LEVEL
369 offset = (hash & (h->nbuckets - 1));
370 offset = offset * (sizeof (BVT (clib_bihash_bucket))
371 + (BIHASH_KVP_PER_PAGE * sizeof (BVT (clib_bihash_kv))));
372 return ((BVT (clib_bihash_bucket) *) (((u8 *) h->buckets) + offset));
375 return h->buckets + (hash & (h->nbuckets - 1));
378 static inline int BV (clib_bihash_search_inline_with_hash)
379 (BVT (clib_bihash) * h, u64 hash, BVT (clib_bihash_kv) * key_result)
381 BVT (clib_bihash_value) * v;
382 BVT (clib_bihash_bucket) * b;
385 #if BIHASH_LAZY_INSTANTIATE
386 if (PREDICT_FALSE (alloc_arena (h) == 0))
390 b = BV (clib_bihash_get_bucket) (h, hash);
392 if (PREDICT_FALSE (BV (clib_bihash_bucket_is_empty) (b)))
395 if (PREDICT_FALSE (b->lock))
397 volatile BVT (clib_bihash_bucket) * bv = b;
402 hash >>= h->log2_nbuckets;
404 v = BV (clib_bihash_get_value) (h, b->offset);
406 /* If the bucket has unresolvable collisions, use linear search */
407 limit = BIHASH_KVP_PER_PAGE;
408 v += (b->linear_search == 0) ? hash & ((1 << b->log2_pages) - 1) : 0;
409 if (PREDICT_FALSE (b->linear_search))
410 limit <<= b->log2_pages;
412 for (i = 0; i < limit; i++)
414 if (BV (clib_bihash_key_compare) (v->kvp[i].key, key_result->key))
416 *key_result = v->kvp[i];
423 static inline int BV (clib_bihash_search_inline)
424 (BVT (clib_bihash) * h, BVT (clib_bihash_kv) * key_result)
428 hash = BV (clib_bihash_hash) (key_result);
430 return BV (clib_bihash_search_inline_with_hash) (h, hash, key_result);
433 static inline void BV (clib_bihash_prefetch_bucket)
434 (BVT (clib_bihash) * h, u64 hash)
436 CLIB_PREFETCH (BV (clib_bihash_get_bucket) (h, hash),
437 BIHASH_BUCKET_PREFETCH_CACHE_LINES * CLIB_CACHE_LINE_BYTES,
441 static inline void BV (clib_bihash_prefetch_data)
442 (BVT (clib_bihash) * h, u64 hash)
444 BVT (clib_bihash_value) * v;
445 BVT (clib_bihash_bucket) * b;
447 #if BIHASH_LAZY_INSTANTIATE
448 if (PREDICT_FALSE (alloc_arena (h) == 0))
452 b = BV (clib_bihash_get_bucket) (h, hash);
454 if (PREDICT_FALSE (BV (clib_bihash_bucket_is_empty) (b)))
457 hash >>= h->log2_nbuckets;
458 v = BV (clib_bihash_get_value) (h, b->offset);
460 v += (b->linear_search == 0) ? hash & ((1 << b->log2_pages) - 1) : 0;
462 clib_prefetch_load (v);
465 static inline int BV (clib_bihash_search_inline_2_with_hash)
466 (BVT (clib_bihash) * h,
467 u64 hash, BVT (clib_bihash_kv) * search_key, BVT (clib_bihash_kv) * valuep)
469 BVT (clib_bihash_value) * v;
470 BVT (clib_bihash_bucket) * b;
475 #if BIHASH_LAZY_INSTANTIATE
476 if (PREDICT_FALSE (alloc_arena (h) == 0))
480 b = BV (clib_bihash_get_bucket) (h, hash);
482 if (PREDICT_FALSE (BV (clib_bihash_bucket_is_empty) (b)))
485 if (PREDICT_FALSE (b->lock))
487 volatile BVT (clib_bihash_bucket) * bv = b;
492 hash >>= h->log2_nbuckets;
493 v = BV (clib_bihash_get_value) (h, b->offset);
495 /* If the bucket has unresolvable collisions, use linear search */
496 limit = BIHASH_KVP_PER_PAGE;
497 v += (b->linear_search == 0) ? hash & ((1 << b->log2_pages) - 1) : 0;
498 if (PREDICT_FALSE (b->linear_search))
499 limit <<= b->log2_pages;
501 for (i = 0; i < limit; i++)
503 if (BV (clib_bihash_key_compare) (v->kvp[i].key, search_key->key))
512 static inline int BV (clib_bihash_search_inline_2)
513 (BVT (clib_bihash) * h,
514 BVT (clib_bihash_kv) * search_key, BVT (clib_bihash_kv) * valuep)
518 hash = BV (clib_bihash_hash) (search_key);
520 return BV (clib_bihash_search_inline_2_with_hash) (h, hash, search_key,
525 #endif /* __included_bihash_template_h__ */
530 * fd.io coding-style-patch-verification: ON
533 * eval: (c-set-style "gnu")