FD.io VPP  v21.10.1-2-g0a485f517
Vector Packet Processing
bihash_template.h
Go to the documentation of this file.
1 /*
2  Copyright (c) 2014 Cisco and/or its affiliates.
3 
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:
7  *
8  * http://www.apache.org/licenses/LICENSE-2.0
9  *
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.
15 */
16 
17 /** @cond DOCUMENTATION_IS_IN_BIHASH_DOC_H */
18 
19 /*
20  * Note: to instantiate the template multiple times in a single file,
21  * #undef __included_bihash_template_h__...
22  */
23 #ifndef __included_bihash_template_h__
24 #define __included_bihash_template_h__
25 
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>
31 
32 #ifndef BIHASH_TYPE
33 #error BIHASH_TYPE not defined
34 #endif
35 
36 #ifdef BIHASH_32_64_SVM
37 #include <vppinfra/linux/syscall.h>
38 #include <fcntl.h>
39 #define F_LINUX_SPECIFIC_BASE 1024
40 #define F_ADD_SEALS (F_LINUX_SPECIFIC_BASE + 9)
41 #define F_SEAL_SHRINK (2)
42 /* Max page size 2**16 due to refcount width */
43 #define BIHASH_FREELIST_LENGTH 17
44 #endif
45 
46 /* default is 2MB, use 30 for 1GB */
47 #ifndef BIHASH_LOG2_HUGEPAGE_SIZE
48 #define BIHASH_LOG2_HUGEPAGE_SIZE 21
49 #endif
50 
51 #define _bv(a,b) a##b
52 #define __bv(a,b) _bv(a,b)
53 #define BV(a) __bv(a,BIHASH_TYPE)
54 
55 #define _bvt(a,b) a##b##_t
56 #define __bvt(a,b) _bvt(a,b)
57 #define BVT(a) __bvt(a,BIHASH_TYPE)
58 
59 #define _bvs(a,b) struct a##b
60 #define __bvs(a,b) _bvs(a,b)
61 #define BVS(a) __bvs(a,BIHASH_TYPE)
62 
63 #if _LP64 == 0
64 #define OVERFLOW_ASSERT(x) ASSERT(((x) & 0xFFFFFFFF00000000ULL) == 0)
65 #define u64_to_pointer(x) (void *)(u32)((x))
66 #define pointer_to_u64(x) (u64)(u32)((x))
67 #else
68 #define OVERFLOW_ASSERT(x)
69 #define u64_to_pointer(x) (void *)((x))
70 #define pointer_to_u64(x) (u64)((x))
71 #endif
72 
73 typedef struct BV (clib_bihash_value)
74 {
75  union
76  {
77  BVT (clib_bihash_kv) kvp[BIHASH_KVP_PER_PAGE];
78  u64 next_free_as_u64;
79  };
81 
82 #define BIHASH_BUCKET_OFFSET_BITS 36
83 
84 typedef struct
85 {
86  union
87  {
88  struct
89  {
90  u64 offset:BIHASH_BUCKET_OFFSET_BITS;
91  u64 lock:1;
92  u64 linear_search:1;
93  u64 log2_pages:8;
94  u64 refcnt:16;
95  };
96  u64 as_u64;
97  };
98 } BVT (clib_bihash_bucket);
99 
100 STATIC_ASSERT_SIZEOF (BVT (clib_bihash_bucket), sizeof (u64));
101 
102 /* *INDENT-OFF* */
103 typedef CLIB_PACKED (struct {
104  /*
105  * Backing store allocation. Since bihash manages its own
106  * freelists, we simple dole out memory starting from alloc_arena[alloc_arena_next].
107  */
108  u64 alloc_arena_next; /* Next offset from alloc_arena to allocate, definitely NOT a constant */
109  u64 alloc_arena_size; /* Size of the arena */
110  u64 alloc_arena_mapped; /* Size of the mapped memory in the arena */
111  /* Two SVM pointers stored as 8-byte integers */
112  u64 alloc_lock_as_u64;
113  u64 buckets_as_u64;
114  /* freelist list-head arrays/vectors */
115  u64 freelists_as_u64;
116  u32 nbuckets; /* Number of buckets */
117  /* Set when header valid */
118  volatile u32 ready;
119  u64 pad[1];
120 }) BVT (clib_bihash_shared_header);
121 /* *INDENT-ON* */
122 
123 STATIC_ASSERT_SIZEOF (BVT (clib_bihash_shared_header), 8 * sizeof (u64));
124 
125 typedef
126 BVS (clib_bihash_alloc_chunk)
127 {
128  CLIB_CACHE_LINE_ALIGN_MARK (cacheline0);
129 
130  /* chunk size */
131  uword size;
132 
133  /* pointer to the next allocation */
134  u8 *next_alloc;
135 
136  /* number of bytes left in this chunk */
137  uword bytes_left;
138 
139  /* doubly linked list of heap allocated chunks */
140  BVS (clib_bihash_alloc_chunk) * prev, *next;
141 
142 } BVT (clib_bihash_alloc_chunk);
143 
144 typedef
145 BVS (clib_bihash)
146 {
147  BVT (clib_bihash_bucket) * buckets;
148  volatile u32 *alloc_lock;
149 
150  BVT (clib_bihash_value) ** working_copies;
151  int *working_copy_lengths;
152  BVT (clib_bihash_bucket) saved_bucket;
153 
154  u32 nbuckets;
155  u32 log2_nbuckets;
157  u8 *name;
158  format_function_t *fmt_fn;
159  void *heap;
160  BVT (clib_bihash_alloc_chunk) * chunks;
161 
162  u64 *freelists;
163 
164 #if BIHASH_32_64_SVM
165  BVT (clib_bihash_shared_header) * sh;
166  int memfd;
167 #else
168  BVT (clib_bihash_shared_header) sh;
169 #endif
170 
171  u64 alloc_arena; /* Base of the allocation arena */
172  volatile u8 instantiated;
173  u8 dont_add_to_all_bihash_list;
174 
175  /**
176  * A custom format function to print the Key and Value of bihash_key instead of default hexdump
177  */
178  format_function_t *kvp_fmt_fn;
179 
180  /** Optional statistics-gathering callback */
181 #if BIHASH_ENABLE_STATS
182  void (*inc_stats_callback) (BVS (clib_bihash) *, int stat_id, u64 count);
183 
184  /** Statistics callback context (e.g. address of stats data structure) */
185  void *inc_stats_context;
186 #endif
187 
188 } BVT (clib_bihash);
189 
190 typedef struct
191 {
192  BVT (clib_bihash) * h;
193  char *name;
194  u32 nbuckets;
196  format_function_t *kvp_fmt_fn;
197  u8 instantiate_immediately;
198  u8 dont_add_to_all_bihash_list;
199 } BVT (clib_bihash_init2_args);
200 
201 extern void **clib_all_bihashes;
202 
203 #if BIHASH_32_64_SVM
204 #undef alloc_arena_next
205 #undef alloc_arena_size
206 #undef alloc_arena_mapped
207 #undef alloc_arena
208 #undef CLIB_BIHASH_READY_MAGIC
209 #define alloc_arena_next(h) (((h)->sh)->alloc_arena_next)
210 #define alloc_arena_size(h) (((h)->sh)->alloc_arena_size)
211 #define alloc_arena_mapped(h) (((h)->sh)->alloc_arena_mapped)
212 #define alloc_arena(h) ((h)->alloc_arena)
213 #define CLIB_BIHASH_READY_MAGIC 0xFEEDFACE
214 #else
215 #undef alloc_arena_next
216 #undef alloc_arena_size
217 #undef alloc_arena_mapped
218 #undef alloc_arena
219 #undef CLIB_BIHASH_READY_MAGIC
220 #define alloc_arena_next(h) ((h)->sh.alloc_arena_next)
221 #define alloc_arena_size(h) ((h)->sh.alloc_arena_size)
222 #define alloc_arena_mapped(h) ((h)->sh.alloc_arena_mapped)
223 #define alloc_arena(h) ((h)->alloc_arena)
224 #define CLIB_BIHASH_READY_MAGIC 0
225 #endif
226 
227 #ifndef BIHASH_STAT_IDS
228 #define BIHASH_STAT_IDS 1
229 
230 #define foreach_bihash_stat \
231 _(alloc_add) \
232 _(add) \
233 _(split_add) \
234 _(replace) \
235 _(update) \
236 _(del) \
237 _(del_free) \
238 _(linear) \
239 _(resplit) \
240 _(working_copy_lost) \
241 _(splits) /* must be last */
242 
243 typedef enum
244 {
245 #define _(a) BIHASH_STAT_##a,
246  foreach_bihash_stat
247 #undef _
248  BIHASH_STAT_N_STATS,
249 } BVT (clib_bihash_stat_id);
250 #endif /* BIHASH_STAT_IDS */
251 
252 static inline void BV (clib_bihash_increment_stat) (BVT (clib_bihash) * h,
253  int stat_id, u64 count)
254 {
255 #if BIHASH_ENABLE_STATS
256  if (PREDICT_FALSE (h->inc_stats_callback != 0))
257  h->inc_stats_callback (h, stat_id, count);
258 #endif
259 }
260 
261 #if BIHASH_ENABLE_STATS
262 static inline void BV (clib_bihash_set_stats_callback)
263  (BVT (clib_bihash) * h, void (*cb) (BVT (clib_bihash) *, int, u64),
264  void *ctx)
265 {
266  h->inc_stats_callback = cb;
267  h->inc_stats_context = ctx;
268 }
269 #endif
270 
271 
272 static inline void BV (clib_bihash_alloc_lock) (BVT (clib_bihash) * h)
273 {
274  while (__atomic_test_and_set (h->alloc_lock, __ATOMIC_ACQUIRE))
275  CLIB_PAUSE ();
276 }
277 
278 static inline void BV (clib_bihash_alloc_unlock) (BVT (clib_bihash) * h)
279 {
280  __atomic_clear (h->alloc_lock, __ATOMIC_RELEASE);
281 }
282 
283 static inline void BV (clib_bihash_lock_bucket) (BVT (clib_bihash_bucket) * b)
284 {
285  /* *INDENT-OFF* */
286  BVT (clib_bihash_bucket) mask = { .lock = 1 };
287  /* *INDENT-ON* */
288  u64 old;
289 
290 try_again:
291  old = clib_atomic_fetch_or (&b->as_u64, mask.as_u64);
292 
293  if (PREDICT_FALSE (old & mask.as_u64))
294  {
295  /* somebody else flipped the bit, try again */
296  CLIB_PAUSE ();
297  goto try_again;
298  }
299 }
300 
301 static inline void BV (clib_bihash_unlock_bucket)
302  (BVT (clib_bihash_bucket) * b)
303 {
304  b->lock = 0;
305 }
306 
307 static inline void *BV (clib_bihash_get_value) (BVT (clib_bihash) * h,
308  uword offset)
309 {
310  u8 *hp = (u8 *) (uword) alloc_arena (h);
311  u8 *vp = hp + offset;
312 
313  return (void *) vp;
314 }
315 
316 static inline int BV (clib_bihash_bucket_is_empty)
317  (BVT (clib_bihash_bucket) * b)
318 {
319  /* Note: applied to locked buckets, test offset */
321  return b->offset == 0;
322  else
323  return (b->log2_pages == 0 && b->refcnt == 1);
324 }
325 
326 static inline uword BV (clib_bihash_get_offset) (BVT (clib_bihash) * h,
327  void *v)
328 {
329  u8 *hp, *vp;
330 
331  hp = (u8 *) (uword) alloc_arena (h);
332  vp = (u8 *) v;
333 
334  return vp - hp;
335 }
336 
337 #define BIHASH_ADD 1
338 #define BIHASH_DEL 0
339 
340 void BV (clib_bihash_init)
341  (BVT (clib_bihash) * h, char *name, u32 nbuckets, uword memory_size);
342 
343 void BV (clib_bihash_init2) (BVT (clib_bihash_init2_args) * a);
344 
345 #if BIHASH_32_64_SVM
346 void BV (clib_bihash_initiator_init_svm)
347  (BVT (clib_bihash) * h, char *name, u32 nbuckets, u64 memory_size);
348 void BV (clib_bihash_responder_init_svm)
349  (BVT (clib_bihash) * h, char *name, int fd);
350 #endif
351 
352 void BV (clib_bihash_set_kvp_format_fn) (BVT (clib_bihash) * h,
353  format_function_t * kvp_fmt_fn);
354 
355 void BV (clib_bihash_free) (BVT (clib_bihash) * h);
356 
357 int BV (clib_bihash_add_del) (BVT (clib_bihash) * h,
358  BVT (clib_bihash_kv) * add_v, int is_add);
359 int BV (clib_bihash_add_or_overwrite_stale) (BVT (clib_bihash) * h,
360  BVT (clib_bihash_kv) * add_v,
361  int (*is_stale_cb) (BVT
362  (clib_bihash_kv)
363  *, void *),
364  void *arg);
365 int BV (clib_bihash_search) (BVT (clib_bihash) * h,
366  BVT (clib_bihash_kv) * search_v,
367  BVT (clib_bihash_kv) * return_v);
368 
369 int BV (clib_bihash_is_initialised) (const BVT (clib_bihash) * h);
370 
371 #define BIHASH_WALK_STOP 0
372 #define BIHASH_WALK_CONTINUE 1
373 
374 typedef
375  int (*BV (clib_bihash_foreach_key_value_pair_cb)) (BVT (clib_bihash_kv) *,
376  void *);
377 void BV (clib_bihash_foreach_key_value_pair) (BVT (clib_bihash) * h,
378  BV
380  cb, void *arg);
381 void *clib_all_bihash_set_heap (void);
382 void clib_bihash_copied (void *dst, void *src);
383 
384 format_function_t BV (format_bihash);
385 format_function_t BV (format_bihash_kvp);
386 format_function_t BV (format_bihash_lru);
387 
388 static inline
389 BVT (clib_bihash_bucket) *
390 BV (clib_bihash_get_bucket) (BVT (clib_bihash) * h, u64 hash)
391 {
392 #if BIHASH_KVP_AT_BUCKET_LEVEL
393  uword offset;
394  offset = (hash & (h->nbuckets - 1));
395  offset = offset * (sizeof (BVT (clib_bihash_bucket))
396  + (BIHASH_KVP_PER_PAGE * sizeof (BVT (clib_bihash_kv))));
397  return ((BVT (clib_bihash_bucket) *) (((u8 *) h->buckets) + offset));
398 #else
399  return h->buckets + (hash & (h->nbuckets - 1));
400 #endif
401 }
402 
403 static inline int BV (clib_bihash_search_inline_with_hash)
404  (BVT (clib_bihash) * h, u64 hash, BVT (clib_bihash_kv) * key_result)
405 {
406  BVT (clib_bihash_value) * v;
407  BVT (clib_bihash_bucket) * b;
408  int i, limit;
409 
410  /* *INDENT-OFF* */
411  static const BVT (clib_bihash_bucket) mask = {
412  .linear_search = 1,
413  .log2_pages = -1
414  };
415  /* *INDENT-ON* */
416 
417 #if BIHASH_LAZY_INSTANTIATE
418  if (PREDICT_FALSE (h->instantiated == 0))
419  return -1;
420 #endif
421 
422  b = BV (clib_bihash_get_bucket) (h, hash);
423 
424  if (PREDICT_FALSE (BV (clib_bihash_bucket_is_empty) (b)))
425  return -1;
426 
427  if (PREDICT_FALSE (b->lock))
428  {
429  volatile BVT (clib_bihash_bucket) * bv = b;
430  while (bv->lock)
431  CLIB_PAUSE ();
432  }
433 
434  v = BV (clib_bihash_get_value) (h, b->offset);
435 
436  /* If the bucket has unresolvable collisions, use linear search */
437  limit = BIHASH_KVP_PER_PAGE;
438 
439  if (PREDICT_FALSE (b->as_u64 & mask.as_u64))
440  {
441  if (PREDICT_FALSE (b->linear_search))
442  limit <<= b->log2_pages;
443  else
444  v += extract_bits (hash, h->log2_nbuckets, b->log2_pages);
445  }
446 
447  for (i = 0; i < limit; i++)
448  {
449  if (BV (clib_bihash_key_compare) (v->kvp[i].key, key_result->key))
450  {
451  *key_result = v->kvp[i];
452  return 0;
453  }
454  }
455  return -1;
456 }
457 
458 static inline int BV (clib_bihash_search_inline)
459  (BVT (clib_bihash) * h, BVT (clib_bihash_kv) * key_result)
460 {
461  u64 hash;
462 
463  hash = BV (clib_bihash_hash) (key_result);
464 
465  return BV (clib_bihash_search_inline_with_hash) (h, hash, key_result);
466 }
467 
468 static inline void BV (clib_bihash_prefetch_bucket)
469  (BVT (clib_bihash) * h, u64 hash)
470 {
471  CLIB_PREFETCH (BV (clib_bihash_get_bucket) (h, hash),
473  LOAD);
474 }
475 
476 static inline void BV (clib_bihash_prefetch_data)
477  (BVT (clib_bihash) * h, u64 hash)
478 {
479  BVT (clib_bihash_value) * v;
480  BVT (clib_bihash_bucket) * b;
481 
482 #if BIHASH_LAZY_INSTANTIATE
483  if (PREDICT_FALSE (h->instantiated == 0))
484  return;
485 #endif
486 
487  b = BV (clib_bihash_get_bucket) (h, hash);
488 
489  if (PREDICT_FALSE (BV (clib_bihash_bucket_is_empty) (b)))
490  return;
491 
492  v = BV (clib_bihash_get_value) (h, b->offset);
493 
494  if (PREDICT_FALSE (b->log2_pages && b->linear_search == 0))
495  v += extract_bits (hash, h->log2_nbuckets, b->log2_pages);
496 
497  CLIB_PREFETCH (v, BIHASH_KVP_PER_PAGE * sizeof (BVT (clib_bihash_kv)),
498  LOAD);
499 }
500 
501 static inline int BV (clib_bihash_search_inline_2_with_hash)
502  (BVT (clib_bihash) * h,
503  u64 hash, BVT (clib_bihash_kv) * search_key, BVT (clib_bihash_kv) * valuep)
504 {
505  BVT (clib_bihash_value) * v;
506  BVT (clib_bihash_bucket) * b;
507  int i, limit;
508 
509 /* *INDENT-OFF* */
510  static const BVT (clib_bihash_bucket) mask = {
511  .linear_search = 1,
512  .log2_pages = -1
513  };
514 /* *INDENT-ON* */
515 
516  ASSERT (valuep);
517 
518 #if BIHASH_LAZY_INSTANTIATE
519  if (PREDICT_FALSE (h->instantiated == 0))
520  return -1;
521 #endif
522 
523  b = BV (clib_bihash_get_bucket) (h, hash);
524 
525  if (PREDICT_FALSE (BV (clib_bihash_bucket_is_empty) (b)))
526  return -1;
527 
528  if (PREDICT_FALSE (b->lock))
529  {
530  volatile BVT (clib_bihash_bucket) * bv = b;
531  while (bv->lock)
532  CLIB_PAUSE ();
533  }
534 
535  v = BV (clib_bihash_get_value) (h, b->offset);
536 
537  /* If the bucket has unresolvable collisions, use linear search */
538  limit = BIHASH_KVP_PER_PAGE;
539 
540  if (PREDICT_FALSE (b->as_u64 & mask.as_u64))
541  {
542  if (PREDICT_FALSE (b->linear_search))
543  limit <<= b->log2_pages;
544  else
545  v += extract_bits (hash, h->log2_nbuckets, b->log2_pages);
546  }
547 
548  for (i = 0; i < limit; i++)
549  {
550  if (BV (clib_bihash_key_compare) (v->kvp[i].key, search_key->key))
551  {
552  *valuep = v->kvp[i];
553  return 0;
554  }
555  }
556  return -1;
557 }
558 
559 static inline int BV (clib_bihash_search_inline_2)
560  (BVT (clib_bihash) * h,
561  BVT (clib_bihash_kv) * search_key, BVT (clib_bihash_kv) * valuep)
562 {
563  u64 hash;
564 
565  hash = BV (clib_bihash_hash) (search_key);
566 
567  return BV (clib_bihash_search_inline_2_with_hash) (h, hash, search_key,
568  valuep);
569 }
570 
571 
572 #endif /* __included_bihash_template_h__ */
573 
574 /** @endcond */
575 
576 /*
577  * fd.io coding-style-patch-verification: ON
578  *
579  * Local Variables:
580  * eval: (c-set-style "gnu")
581  * End:
582  */
clib_bihash_prefetch_data
void clib_bihash_prefetch_data(clib_bihash *h, u64 hash)
Prefetch bi-hash (key,value) data given a hash code.
BIHASH_KVP_PER_PAGE
#define BIHASH_KVP_PER_PAGE
Definition: bihash_16_8.h:25
CLIB_CACHE_LINE_ALIGN_MARK
#define CLIB_CACHE_LINE_ALIGN_MARK(mark)
Definition: cache.h:60
name
string name[64]
Definition: fib.api:25
next
u16 * next
Definition: nat44_ei_out2in.c:718
clib_bihash_get_value
static void * clib_bihash_get_value(clib_bihash *h, uword offset)
Get pointer to value page given its clib mheap offset.
memory_size
u64 memory_size
Definition: vhost_user.h:124
clib_atomic_fetch_or
#define clib_atomic_fetch_or(a, b)
Definition: atomics.h:27
h
h
Definition: flowhash_template.h:372
clib_bihash_search_inline
int clib_bihash_search_inline(clib_bihash *h, clib_bihash_kv *in_out_kv)
Search a bi-hash table.
clib_all_bihash_set_heap
__clib_export clib_mem_heap_t * clib_all_bihash_set_heap(void)
Definition: bihash_all_vector.c:23
clib_bihash_search_inline_2
int clib_bihash_search_inline_2(clib_bihash *h, clib_bihash_kv *search_key, clib_bihash_kv *valuep)
Search a bi-hash table.
clib_bihash_get_offset
static uword clib_bihash_get_offset(clib_bihash *h, void *v)
Get clib mheap offset given a pointer.
CLIB_PREFETCH
#define CLIB_PREFETCH(addr, size, type)
Definition: cache.h:76
count
u8 count
Definition: dhcp.api:208
clib_bihash_init
void clib_bihash_init(clib_bihash *h, char *name, u32 nbuckets, uword memory_size)
initialize a bounded index extensible hash table
clib_all_bihashes
__clib_export void ** clib_all_bihashes
Definition: bihash_all_vector.c:19
lock.h
offset
struct clib_bihash_value offset
template key/value backing page structure
PREDICT_FALSE
#define PREDICT_FALSE(x)
Definition: clib.h:124
clib_bihash_copied
__clib_export void clib_bihash_copied(void *dst, void *src)
Definition: bihash_all_vector.c:36
uword
u64 uword
Definition: types.h:112
clib_bihash_prefetch_bucket
void clib_bihash_prefetch_bucket(clib_bihash *h, u64 hash)
Prefetch a bi-hash bucket given a hash code.
clib_bihash_free
void clib_bihash_free(clib_bihash *h)
Destroy a bounded index extensible hash table.
pool.h
Fixed length block allocator. Pools are built from clib vectors and bitmaps. Use pools when repeatedl...
BVT
BVT(clib_bihash)
The table of adjacencies indexed by the rewrite string.
Definition: l2_fib.c:1065
STATIC_ASSERT_SIZEOF
#define STATIC_ASSERT_SIZEOF(d, s)
Definition: error_bootstrap.h:113
mask
vl_api_pnat_mask_t mask
Definition: pnat.api:45
format.h
src
vl_api_address_t src
Definition: gre.api:54
log2_pages
u8 log2_pages
Definition: bihash_doc.h:62
CLIB_CACHE_LINE_BYTES
#define CLIB_CACHE_LINE_BYTES
Definition: cache.h:58
BIHASH_KVP_AT_BUCKET_LEVEL
#define BIHASH_KVP_AT_BUCKET_LEVEL
Definition: bihash_16_8.h:26
format_function_t
u8 *() format_function_t(u8 *s, va_list *args)
Definition: format.h:48
BIHASH_BUCKET_PREFETCH_CACHE_LINES
#define BIHASH_BUCKET_PREFETCH_CACHE_LINES
Definition: bihash_16_8.h:28
size
u32 size
Definition: vhost_user.h:125
clib_bihash_value
template key/value backing page structure
Definition: bihash_doc.h:44
u64
unsigned long u64
Definition: types.h:89
ASSERT
#define ASSERT(truth)
Definition: error_bootstrap.h:69
cache.h
u32
unsigned int u32
Definition: types.h:88
extract_bits
static uword extract_bits(uword x, int start, int count)
Definition: clib.h:327
dst
vl_api_ip4_address_t dst
Definition: pnat.api:41
ctx
long ctx[MAX_CONNS]
Definition: main.c:144
CLIB_PAUSE
#define CLIB_PAUSE()
Definition: lock.h:23
as_u64
u64 as_u64
Definition: bihash_doc.h:63
clib_bihash_add_del
int clib_bihash_add_del(clib_bihash *h, clib_bihash_kv *add_v, int is_add)
Add or delete a (key,value) pair from a bi-hash table.
clib_bihash_foreach_key_value_pair
void clib_bihash_foreach_key_value_pair(clib_bihash *h, clib_bihash_foreach_key_value_pair_cb *callback, void *arg)
Visit active (key,value) pairs in a bi-hash table.
b
vlib_buffer_t ** b
Definition: nat44_ei_out2in.c:717
u8
unsigned char u8
Definition: types.h:56
a
a
Definition: bitmap.h:525
CLIB_PACKED
#define CLIB_PACKED(x)
Definition: clib.h:89
i
int i
Definition: flowhash_template.h:376
clib_bihash_foreach_key_value_pair_cb
int(* clib_bihash_foreach_key_value_pair_cb)(clib_bihash_kv *kv, void *ctx)
Definition: bihash_doc.h:175
pad
u8 pad[3]
log2 (size of the packing page block)
Definition: bihash_doc.h:61
clib_bihash_search_inline_with_hash
int clib_bihash_search_inline_with_hash(clib_bihash *h, u64 hash, clib_bihash_kv *in_out_kv)
Search a bi-hash table, use supplied hash code.
heap.h