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.
16 /** @cond DOCUMENTATION_IS_IN_BIHASH_DOC_H */
18 static inline void *BV (alloc_aligned) (BVT (clib_bihash) * h, uword nbytes)
22 /* Round to an even number of cache lines */
23 nbytes += CLIB_CACHE_LINE_BYTES - 1;
24 nbytes &= ~(CLIB_CACHE_LINE_BYTES - 1);
26 rv = alloc_arena_next (h);
27 alloc_arena_next (h) += nbytes;
29 if (rv >= alloc_arena_size (h))
32 return (void *) (uword) (rv + alloc_arena (h));
36 void BV (clib_bihash_init)
37 (BVT (clib_bihash) * h, char *name, u32 nbuckets, uword memory_size)
41 nbuckets = 1 << (max_log2 (nbuckets));
43 h->name = (u8 *) name;
44 h->nbuckets = nbuckets;
45 h->log2_nbuckets = max_log2 (nbuckets);
48 * Make sure the requested size is rational. The max table
49 * size without playing the alignment card is 64 Gbytes.
50 * If someone starts complaining that's not enough, we can shift
51 * the offset by CLIB_LOG2_CACHE_LINE_BYTES...
53 ASSERT (memory_size < (1ULL << BIHASH_BUCKET_OFFSET_BITS));
55 alloc_arena (h) = (uword) clib_mem_vm_alloc (memory_size);
56 alloc_arena_next (h) = 0;
57 alloc_arena_size (h) = memory_size;
59 bucket_size = nbuckets * sizeof (h->buckets[0]);
60 h->buckets = BV (alloc_aligned) (h, bucket_size);
62 h->alloc_lock = BV (alloc_aligned) (h, CLIB_CACHE_LINE_BYTES);
69 #if !defined (MFD_ALLOW_SEALING)
70 #define MFD_ALLOW_SEALING 0x0002U
73 void BV (clib_bihash_master_init_svm)
74 (BVT (clib_bihash) * h, char *name, u32 nbuckets, u64 memory_size)
78 vec_header_t *freelist_vh;
81 ASSERT (memory_size < (1ULL << 32));
82 /* Set up for memfd sharing */
83 if ((fd = memfd_create (name, MFD_ALLOW_SEALING)) == -1)
85 clib_unix_warning ("memfd_create");
89 if (ftruncate (fd, memory_size) < 0)
91 clib_unix_warning ("ftruncate");
95 /* Not mission-critical, complain and continue */
96 if ((fcntl (fd, F_ADD_SEALS, F_SEAL_SHRINK)) == -1)
97 clib_unix_warning ("fcntl (F_ADD_SEALS)");
99 mmap_addr = mmap (0, memory_size,
100 PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0 /* offset */ );
102 if (mmap_addr == MAP_FAILED)
104 clib_unix_warning ("mmap failed");
108 h->sh = (void *) mmap_addr;
110 nbuckets = 1 << (max_log2 (nbuckets));
112 h->name = (u8 *) name;
113 h->sh->nbuckets = h->nbuckets = nbuckets;
114 h->log2_nbuckets = max_log2 (nbuckets);
116 alloc_arena (h) = (u64) (uword) mmap_addr;
117 alloc_arena_next (h) = CLIB_CACHE_LINE_BYTES;
118 alloc_arena_size (h) = memory_size;
120 bucket_size = nbuckets * sizeof (h->buckets[0]);
121 h->buckets = BV (alloc_aligned) (h, bucket_size);
122 h->sh->buckets_as_u64 = (u64) BV (clib_bihash_get_offset) (h, h->buckets);
124 h->alloc_lock = BV (alloc_aligned) (h, CLIB_CACHE_LINE_BYTES);
125 h->alloc_lock[0] = 0;
127 h->sh->alloc_lock_as_u64 =
128 (u64) BV (clib_bihash_get_offset) (h, (void *) h->alloc_lock);
130 BV (alloc_aligned) (h,
131 sizeof (vec_header_t) +
132 BIHASH_FREELIST_LENGTH * sizeof (u64));
133 freelist_vh->len = BIHASH_FREELIST_LENGTH;
134 freelist_vh->dlmalloc_header_offset = 0xDEADBEEF;
135 h->sh->freelists_as_u64 =
136 (u64) BV (clib_bihash_get_offset) (h, freelist_vh->vector_data);
137 h->freelists = (void *) (freelist_vh->vector_data);
142 void BV (clib_bihash_slave_init_svm)
143 (BVT (clib_bihash) * h, char *name, int fd)
147 BVT (clib_bihash_shared_header) * sh;
149 /* Trial mapping, to learn the segment size */
150 mmap_addr = mmap (0, 4096, PROT_READ, MAP_SHARED, fd, 0 /* offset */ );
151 if (mmap_addr == MAP_FAILED)
153 clib_unix_warning ("trial mmap failed");
157 sh = (BVT (clib_bihash_shared_header) *) mmap_addr;
159 memory_size = sh->alloc_arena_size;
161 munmap (mmap_addr, 4096);
163 /* Actual mapping, at the required size */
164 mmap_addr = mmap (0, memory_size,
165 PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0 /* offset */ );
167 if (mmap_addr == MAP_FAILED)
169 clib_unix_warning ("mmap failed");
175 h->sh = (void *) mmap_addr;
176 alloc_arena (h) = (u64) (uword) mmap_addr;
179 h->name = (u8 *) name;
180 h->buckets = BV (clib_bihash_get_value) (h, h->sh->buckets_as_u64);
181 h->nbuckets = h->sh->nbuckets;
182 h->log2_nbuckets = max_log2 (h->nbuckets);
184 h->alloc_lock = BV (clib_bihash_get_value) (h, h->sh->alloc_lock_as_u64);
185 h->freelists = BV (clib_bihash_get_value) (h, h->sh->freelists_as_u64);
188 #endif /* BIHASH_32_64_SVM */
190 void BV (clib_bihash_set_kvp_format_fn) (BVT (clib_bihash) * h,
191 format_function_t * fmt_fn)
196 void BV (clib_bihash_free) (BVT (clib_bihash) * h)
198 vec_free (h->working_copies);
199 vec_free (h->working_copy_lengths);
200 #if BIHASH_32_64_SVM == 0
201 vec_free (h->freelists);
204 (void) close (h->memfd);
206 clib_mem_vm_free ((void *) (uword) (alloc_arena (h)), alloc_arena_size (h));
207 clib_memset (h, 0, sizeof (*h));
211 BVT (clib_bihash_value) *
212 BV (value_alloc) (BVT (clib_bihash) * h, u32 log2_pages)
214 BVT (clib_bihash_value) * rv = 0;
216 ASSERT (h->alloc_lock[0]);
219 ASSERT (log2_pages < vec_len (h->freelists));
222 if (log2_pages >= vec_len (h->freelists) || h->freelists[log2_pages] == 0)
224 vec_validate_init_empty (h->freelists, log2_pages, 0);
225 rv = BV (alloc_aligned) (h, (sizeof (*rv) * (1 << log2_pages)));
228 rv = BV (clib_bihash_get_value) (h, (uword) h->freelists[log2_pages]);
229 h->freelists[log2_pages] = rv->next_free_as_u64;
234 * Latest gcc complains that the length arg is zero
235 * if we replace (1<<log2_pages) with vec_len(rv).
238 clib_memset (rv, 0xff, sizeof (*rv) * (1 << log2_pages));
243 BV (value_free) (BVT (clib_bihash) * h, BVT (clib_bihash_value) * v,
246 ASSERT (h->alloc_lock[0]);
248 ASSERT (vec_len (h->freelists) > log2_pages);
251 clib_memset (v, 0xFE, sizeof (*v) * (1 << log2_pages));
253 v->next_free_as_u64 = (u64) h->freelists[log2_pages];
254 h->freelists[log2_pages] = (u64) BV (clib_bihash_get_offset) (h, v);
258 BV (make_working_copy) (BVT (clib_bihash) * h, BVT (clib_bihash_bucket) * b)
260 BVT (clib_bihash_value) * v;
261 BVT (clib_bihash_bucket) working_bucket __attribute__ ((aligned (8)));
262 BVT (clib_bihash_value) * working_copy;
263 u32 thread_index = os_get_thread_index ();
264 int log2_working_copy_length;
266 ASSERT (h->alloc_lock[0]);
268 if (thread_index >= vec_len (h->working_copies))
270 vec_validate (h->working_copies, thread_index);
271 vec_validate_init_empty (h->working_copy_lengths, thread_index, ~0);
275 * working_copies are per-cpu so that near-simultaneous
276 * updates from multiple threads will not result in sporadic, spurious
279 working_copy = h->working_copies[thread_index];
280 log2_working_copy_length = h->working_copy_lengths[thread_index];
282 h->saved_bucket.as_u64 = b->as_u64;
284 if (b->log2_pages > log2_working_copy_length)
287 * It's not worth the bookkeeping to free working copies
289 * clib_mem_free (working_copy);
291 working_copy = BV (alloc_aligned)
292 (h, sizeof (working_copy[0]) * (1 << b->log2_pages));
293 h->working_copy_lengths[thread_index] = b->log2_pages;
294 h->working_copies[thread_index] = working_copy;
296 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_working_copy_lost,
297 1ULL << b->log2_pages);
300 v = BV (clib_bihash_get_value) (h, b->offset);
302 clib_memcpy_fast (working_copy, v, sizeof (*v) * (1 << b->log2_pages));
303 working_bucket.as_u64 = b->as_u64;
304 working_bucket.offset = BV (clib_bihash_get_offset) (h, working_copy);
305 CLIB_MEMORY_BARRIER ();
306 b->as_u64 = working_bucket.as_u64;
307 h->working_copies[thread_index] = working_copy;
311 BVT (clib_bihash_value) *
312 BV (split_and_rehash)
313 (BVT (clib_bihash) * h,
314 BVT (clib_bihash_value) * old_values, u32 old_log2_pages,
317 BVT (clib_bihash_value) * new_values, *new_v;
318 int i, j, length_in_kvs;
320 ASSERT (h->alloc_lock[0]);
322 new_values = BV (value_alloc) (h, new_log2_pages);
323 length_in_kvs = (1 << old_log2_pages) * BIHASH_KVP_PER_PAGE;
325 for (i = 0; i < length_in_kvs; i++)
329 /* Entry not in use? Forget it */
330 if (BV (clib_bihash_is_free) (&(old_values->kvp[i])))
333 /* rehash the item onto its new home-page */
334 new_hash = BV (clib_bihash_hash) (&(old_values->kvp[i]));
335 new_hash >>= h->log2_nbuckets;
336 new_hash &= (1 << new_log2_pages) - 1;
337 new_v = &new_values[new_hash];
339 /* Across the new home-page */
340 for (j = 0; j < BIHASH_KVP_PER_PAGE; j++)
343 if (BV (clib_bihash_is_free) (&(new_v->kvp[j])))
345 clib_memcpy_fast (&(new_v->kvp[j]), &(old_values->kvp[i]),
346 sizeof (new_v->kvp[j]));
350 /* Crap. Tell caller to try again */
351 BV (value_free) (h, new_values, new_log2_pages);
360 BVT (clib_bihash_value) *
361 BV (split_and_rehash_linear)
362 (BVT (clib_bihash) * h,
363 BVT (clib_bihash_value) * old_values, u32 old_log2_pages,
366 BVT (clib_bihash_value) * new_values;
367 int i, j, new_length, old_length;
369 ASSERT (h->alloc_lock[0]);
371 new_values = BV (value_alloc) (h, new_log2_pages);
372 new_length = (1 << new_log2_pages) * BIHASH_KVP_PER_PAGE;
373 old_length = (1 << old_log2_pages) * BIHASH_KVP_PER_PAGE;
376 /* Across the old value array */
377 for (i = 0; i < old_length; i++)
379 /* Find a free slot in the new linear scan bucket */
380 for (; j < new_length; j++)
382 /* Old value not in use? Forget it. */
383 if (BV (clib_bihash_is_free) (&(old_values->kvp[i])))
386 /* New value should never be in use */
387 if (BV (clib_bihash_is_free) (&(new_values->kvp[j])))
389 /* Copy the old value and move along */
390 clib_memcpy_fast (&(new_values->kvp[j]), &(old_values->kvp[i]),
391 sizeof (new_values->kvp[j]));
396 /* This should never happen... */
397 clib_warning ("BUG: linear rehash failed!");
398 BV (value_free) (h, new_values, new_log2_pages);
406 static inline int BV (clib_bihash_add_del_inline)
407 (BVT (clib_bihash) * h, BVT (clib_bihash_kv) * add_v, int is_add,
408 int (*is_stale_cb) (BVT (clib_bihash_kv) *, void *), void *arg)
411 BVT (clib_bihash_bucket) * b, tmp_b;
412 BVT (clib_bihash_value) * v, *new_v, *save_new_v, *working_copy;
415 u32 new_log2_pages, old_log2_pages;
416 u32 thread_index = os_get_thread_index ();
417 int mark_bucket_linear;
420 hash = BV (clib_bihash_hash) (add_v);
422 bucket_index = hash & (h->nbuckets - 1);
423 b = &h->buckets[bucket_index];
425 hash >>= h->log2_nbuckets;
427 BV (clib_bihash_lock_bucket) (b);
429 /* First elt in the bucket? */
430 if (BV (clib_bihash_bucket_is_empty) (b))
434 BV (clib_bihash_unlock_bucket) (b);
438 BV (clib_bihash_alloc_lock) (h);
439 v = BV (value_alloc) (h, 0);
440 BV (clib_bihash_alloc_unlock) (h);
443 tmp_b.as_u64 = 0; /* clears bucket lock */
444 tmp_b.offset = BV (clib_bihash_get_offset) (h, v);
446 CLIB_MEMORY_BARRIER ();
448 b->as_u64 = tmp_b.as_u64; /* unlocks the bucket */
449 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_alloc_add, 1);
454 /* WARNING: we're still looking at the live copy... */
455 limit = BIHASH_KVP_PER_PAGE;
456 v = BV (clib_bihash_get_value) (h, b->offset);
458 v += (b->linear_search == 0) ? hash & ((1 << b->log2_pages) - 1) : 0;
459 if (b->linear_search)
460 limit <<= b->log2_pages;
465 * Because reader threads are looking at live data,
466 * we have to be extra careful. Readers do NOT hold the
467 * bucket lock. We need to be SLOWER than a search, past the
468 * point where readers CHECK the bucket lock.
472 * For obvious (in hindsight) reasons, see if we're supposed to
473 * replace an existing key, then look for an empty slot.
475 for (i = 0; i < limit; i++)
477 if (BV (clib_bihash_key_compare) (v->kvp[i].key, add_v->key))
479 CLIB_MEMORY_BARRIER (); /* Add a delay */
480 clib_memcpy_fast (&(v->kvp[i]), add_v, sizeof (*add_v));
481 BV (clib_bihash_unlock_bucket) (b);
482 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_replace, 1);
487 * Look for an empty slot. If found, use it
489 for (i = 0; i < limit; i++)
491 if (BV (clib_bihash_is_free) (&(v->kvp[i])))
494 * Copy the value first, so that if a reader manages
495 * to match the new key, the value will be right...
497 clib_memcpy_fast (&(v->kvp[i].value),
498 &add_v->value, sizeof (add_v->value));
499 CLIB_MEMORY_BARRIER (); /* Make sure the value has settled */
500 clib_memcpy_fast (&(v->kvp[i]), &add_v->key,
501 sizeof (add_v->key));
503 ASSERT (b->refcnt > 0);
504 BV (clib_bihash_unlock_bucket) (b);
505 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_add, 1);
509 /* look for stale data to overwrite */
512 for (i = 0; i < limit; i++)
514 if (is_stale_cb (&(v->kvp[i]), arg))
516 CLIB_MEMORY_BARRIER ();
517 clib_memcpy_fast (&(v->kvp[i]), add_v, sizeof (*add_v));
518 BV (clib_bihash_unlock_bucket) (b);
519 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_replace, 1);
524 /* Out of space in this bucket, split the bucket... */
526 else /* delete case */
528 for (i = 0; i < limit; i++)
530 /* Found the key? Kill it... */
531 if (BV (clib_bihash_key_compare) (v->kvp[i].key, add_v->key))
533 clib_memset (&(v->kvp[i]), 0xff, sizeof (*(add_v)));
534 /* Is the bucket empty? */
535 if (PREDICT_TRUE (b->refcnt > 1))
538 BV (clib_bihash_unlock_bucket) (b);
539 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_del, 1);
542 else /* yes, free it */
544 /* Save old bucket value, need log2_pages to free it */
545 tmp_b.as_u64 = b->as_u64;
546 CLIB_MEMORY_BARRIER ();
548 /* Kill and unlock the bucket */
551 /* And free the backing storage */
552 BV (clib_bihash_alloc_lock) (h);
553 /* Note: v currently points into the middle of the bucket */
554 v = BV (clib_bihash_get_value) (h, tmp_b.offset);
555 BV (value_free) (h, v, tmp_b.log2_pages);
556 BV (clib_bihash_alloc_unlock) (h);
557 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_del_free,
564 BV (clib_bihash_unlock_bucket) (b);
568 /* Move readers to a (locked) temp copy of the bucket */
569 BV (clib_bihash_alloc_lock) (h);
570 BV (make_working_copy) (h, b);
572 v = BV (clib_bihash_get_value) (h, h->saved_bucket.offset);
574 old_log2_pages = h->saved_bucket.log2_pages;
575 new_log2_pages = old_log2_pages + 1;
576 mark_bucket_linear = 0;
577 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_split_add, 1);
578 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_splits, old_log2_pages);
580 working_copy = h->working_copies[thread_index];
582 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_splits, 1);
584 new_v = BV (split_and_rehash) (h, working_copy, old_log2_pages,
591 /* Try re-splitting. If that fails, fall back to linear search */
592 new_v = BV (split_and_rehash) (h, working_copy, old_log2_pages,
598 /* pinned collisions, use linear search */
600 BV (split_and_rehash_linear) (h, working_copy, old_log2_pages,
602 mark_bucket_linear = 1;
603 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_linear, 1);
605 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_resplit, 1);
606 BV (clib_bihash_increment_stat) (h, BIHASH_STAT_splits,
610 /* Try to add the new entry */
612 new_hash = BV (clib_bihash_hash) (add_v);
613 limit = BIHASH_KVP_PER_PAGE;
614 if (mark_bucket_linear)
615 limit <<= new_log2_pages;
616 new_hash >>= h->log2_nbuckets;
617 new_hash &= (1 << new_log2_pages) - 1;
618 new_v += mark_bucket_linear ? 0 : new_hash;
620 for (i = 0; i < limit; i++)
622 if (BV (clib_bihash_is_free) (&(new_v->kvp[i])))
624 clib_memcpy_fast (&(new_v->kvp[i]), add_v, sizeof (*add_v));
629 /* Crap. Try again */
630 BV (value_free) (h, save_new_v, new_log2_pages);
632 * If we've already doubled the size of the bucket once,
633 * fall back to linear search now.
641 tmp_b.log2_pages = new_log2_pages;
642 tmp_b.offset = BV (clib_bihash_get_offset) (h, save_new_v);
643 tmp_b.linear_search = mark_bucket_linear;
644 tmp_b.refcnt = h->saved_bucket.refcnt + 1;
645 ASSERT (tmp_b.refcnt > 0);
647 CLIB_MEMORY_BARRIER ();
648 b->as_u64 = tmp_b.as_u64;
649 /* free the old bucket */
650 v = BV (clib_bihash_get_value) (h, h->saved_bucket.offset);
651 BV (value_free) (h, v, h->saved_bucket.log2_pages);
652 BV (clib_bihash_alloc_unlock) (h);
656 int BV (clib_bihash_add_del)
657 (BVT (clib_bihash) * h, BVT (clib_bihash_kv) * add_v, int is_add)
659 return BV (clib_bihash_add_del_inline) (h, add_v, is_add, 0, 0);
662 int BV (clib_bihash_add_or_overwrite_stale)
663 (BVT (clib_bihash) * h, BVT (clib_bihash_kv) * add_v,
664 int (*stale_callback) (BVT (clib_bihash_kv) *, void *), void *arg)
666 return BV (clib_bihash_add_del_inline) (h, add_v, 1, stale_callback, arg);
669 int BV (clib_bihash_search)
670 (BVT (clib_bihash) * h,
671 BVT (clib_bihash_kv) * search_key, BVT (clib_bihash_kv) * valuep)
675 BVT (clib_bihash_value) * v;
676 BVT (clib_bihash_bucket) * b;
681 hash = BV (clib_bihash_hash) (search_key);
683 bucket_index = hash & (h->nbuckets - 1);
684 b = &h->buckets[bucket_index];
686 if (BV (clib_bihash_bucket_is_empty) (b))
689 if (PREDICT_FALSE (b->lock))
691 volatile BVT (clib_bihash_bucket) * bv = b;
696 hash >>= h->log2_nbuckets;
698 v = BV (clib_bihash_get_value) (h, b->offset);
699 limit = BIHASH_KVP_PER_PAGE;
700 v += (b->linear_search == 0) ? hash & ((1 << b->log2_pages) - 1) : 0;
701 if (PREDICT_FALSE (b->linear_search))
702 limit <<= b->log2_pages;
704 for (i = 0; i < limit; i++)
706 if (BV (clib_bihash_key_compare) (v->kvp[i].key, search_key->key))
715 u8 *BV (format_bihash) (u8 * s, va_list * args)
717 BVT (clib_bihash) * h = va_arg (*args, BVT (clib_bihash) *);
718 int verbose = va_arg (*args, int);
719 BVT (clib_bihash_bucket) * b;
720 BVT (clib_bihash_value) * v;
722 u64 active_elements = 0;
723 u64 active_buckets = 0;
724 u64 linear_buckets = 0;
727 s = format (s, "Hash table %s\n", h->name ? h->name : (u8 *) "(unnamed)");
729 for (i = 0; i < h->nbuckets; i++)
732 if (BV (clib_bihash_bucket_is_empty) (b))
735 s = format (s, "[%d]: empty\n", i);
741 if (b->linear_search)
746 s = format (s, "[%d]: heap offset %lld, len %d, linear %d\n", i,
747 b->offset, (1 << b->log2_pages), b->linear_search);
750 v = BV (clib_bihash_get_value) (h, b->offset);
751 for (j = 0; j < (1 << b->log2_pages); j++)
753 for (k = 0; k < BIHASH_KVP_PER_PAGE; k++)
755 if (BV (clib_bihash_is_free) (&v->kvp[k]))
758 s = format (s, " %d: empty\n",
759 j * BIHASH_KVP_PER_PAGE + k);
766 s = format (s, " %d: %U\n",
767 j * BIHASH_KVP_PER_PAGE + k,
768 h->fmt_fn, &(v->kvp[k]), verbose);
772 s = format (s, " %d: %U\n",
773 j * BIHASH_KVP_PER_PAGE + k,
774 BV (format_bihash_kvp), &(v->kvp[k]));
783 s = format (s, " %lld active elements %lld active buckets\n",
784 active_elements, active_buckets);
785 s = format (s, " %d free lists\n", vec_len (h->freelists));
787 for (i = 0; i < vec_len (h->freelists); i++)
790 BVT (clib_bihash_value) * free_elt;
791 u64 free_elt_as_u64 = h->freelists[i];
793 while (free_elt_as_u64)
795 free_elt = BV (clib_bihash_get_value) (h, free_elt_as_u64);
797 free_elt_as_u64 = free_elt->next_free_as_u64;
800 if (nfree || verbose)
801 s = format (s, " [len %d] %u free elts\n", 1 << i, nfree);
804 s = format (s, " %lld linear search buckets\n", linear_buckets);
805 used_bytes = alloc_arena_next (h);
807 " arena: base %llx, next %llx\n"
808 " used %lld b (%lld Mbytes) of %lld b (%lld Mbytes)\n",
809 alloc_arena (h), alloc_arena_next (h),
810 used_bytes, used_bytes >> 20,
811 alloc_arena_size (h), alloc_arena_size (h) >> 20);
815 void BV (clib_bihash_foreach_key_value_pair)
816 (BVT (clib_bihash) * h, void *callback, void *arg)
819 BVT (clib_bihash_bucket) * b;
820 BVT (clib_bihash_value) * v;
821 void (*fp) (BVT (clib_bihash_kv) *, void *) = callback;
823 for (i = 0; i < h->nbuckets; i++)
826 if (BV (clib_bihash_bucket_is_empty) (b))
829 v = BV (clib_bihash_get_value) (h, b->offset);
830 for (j = 0; j < (1 << b->log2_pages); j++)
832 for (k = 0; k < BIHASH_KVP_PER_PAGE; k++)
834 if (BV (clib_bihash_is_free) (&v->kvp[k]))
837 (*fp) (&v->kvp[k], arg);
839 * In case the callback deletes the last entry in the bucket...
841 if (BV (clib_bihash_bucket_is_empty) (b))
854 * fd.io coding-style-patch-verification: ON
857 * eval: (c-set-style "gnu")