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 Copyright (c) 2001-2005 Eliot Dresselhaus
18 Permission is hereby granted, free of charge, to any person obtaining
19 a copy of this software and associated documentation files (the
20 "Software"), to deal in the Software without restriction, including
21 without limitation the rights to use, copy, modify, merge, publish,
22 distribute, sublicense, and/or sell copies of the Software, and to
23 permit persons to whom the Software is furnished to do so, subject to
24 the following conditions:
26 The above copyright notice and this permission notice shall be
27 included in all copies or substantial portions of the Software.
29 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
30 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
31 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
32 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
33 LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
34 OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
35 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
38 #ifndef included_hash_h
39 #define included_hash_h
41 #include <vppinfra/error.h>
42 #include <vppinfra/format.h>
43 #include <vppinfra/vec.h>
44 #include <vppinfra/vector.h>
48 typedef uword (hash_key_sum_function_t) (struct hash_header *, uword key);
49 typedef uword (hash_key_equal_function_t)
50 (struct hash_header *, uword key1, uword key2);
52 /* Vector header for hash tables. */
53 typedef struct hash_header
55 /* Number of elements in hash table. */
58 /* Flags as follows. */
61 /* Set if user does not want table to auto-resize when sufficiently full. */
62 #define HASH_FLAG_NO_AUTO_GROW (1 << 0)
63 /* Set if user does not want table to auto-resize when sufficiently empty. */
64 #define HASH_FLAG_NO_AUTO_SHRINK (1 << 1)
65 /* Set when hash_next is in the process of iterating through this hash table. */
66 #define HASH_FLAG_HASH_NEXT_IN_PROGRESS (1 << 2)
70 /* Function to compute the "sum" of a hash key.
71 Hash function is this sum modulo the prime size of
72 the hash table (vec_len (v)). */
73 hash_key_sum_function_t *key_sum;
75 /* Special values for key_sum "function". */
76 #define KEY_FUNC_NONE (0) /*< sum = key */
77 #define KEY_FUNC_POINTER_UWORD (1) /*< sum = *(uword *) key */
78 #define KEY_FUNC_POINTER_U32 (2) /*< sum = *(u32 *) key */
79 #define KEY_FUNC_STRING (3) /*< sum = string_key_sum, etc. */
80 #define KEY_FUNC_MEM (4) /*< sum = mem_key_sum */
82 /* key comparison function */
83 hash_key_equal_function_t *key_equal;
85 /* Hook for user's data. Used to parameterize sum/equal functions. */
88 /* Format a (k,v) pair */
89 format_function_t *format_pair;
91 /* Format function arg */
92 void *format_pair_arg;
94 /* Bit i is set if pair i is a user object (as opposed to being
95 either zero or an indirect array of pairs). */
99 /* Returns a pointer to the hash header given the vector pointer */
100 always_inline hash_t *
101 hash_header (void *v)
103 return vec_header (v);
106 /* Number of elements in the hash table */
110 hash_t *h = hash_header (v);
111 return v ? h->elts : 0;
114 /* Number of elements the hash table can hold */
116 hash_capacity (void *v)
121 /* Returns 1 if the hash pair contains user data */
123 hash_is_user (void *v, uword i)
125 hash_t *h = hash_header (v);
126 uword i0 = i / BITS (h->is_user[0]);
127 uword i1 = i % BITS (h->is_user[0]);
128 return (h->is_user[i0] & ((uword) 1 << i1)) != 0;
131 /* Set the format function and format argument for a hash table */
133 hash_set_pair_format (void *v,
134 format_function_t * format_pair, void *format_pair_arg)
136 hash_t *h = hash_header (v);
137 h->format_pair = format_pair;
138 h->format_pair_arg = format_pair_arg;
141 /* Set hash table flags */
143 hash_set_flags (void *v, uword flags)
145 hash_header (v)->flags |= flags;
148 /* Key value pairs. */
154 /* The Value. Length is 2^log2_pair_size - 1. */
158 /* The indirect pair structure
160 If log2_pair_size > 0 we overload hash pairs
161 with indirect pairs for buckets with more than one
168 u8 pad[sizeof (uword) - sizeof (hash_pair_t *)];
169 /* allocated length */
172 hash_pair_indirect_t;
174 /* Direct / Indirect pair union */
178 hash_pair_indirect_t indirect;
181 #define LOG2_ALLOC_BITS (5)
182 #define PAIR_BITS (BITS (uword) - LOG2_ALLOC_BITS)
184 /* Log2 number of bytes allocated in pairs array. */
186 indirect_pair_get_log2_bytes (hash_pair_indirect_t * p)
188 return p->alloc_len >> PAIR_BITS;
191 /* Get the length of an indirect pair */
193 indirect_pair_get_len (hash_pair_indirect_t * p)
198 return p->alloc_len & (((uword) 1 << PAIR_BITS) - 1);
201 /* Set the length of an indirect pair */
203 indirect_pair_set (hash_pair_indirect_t * p, uword log2_alloc, uword len)
205 ASSERT (len < ((uword) 1 << PAIR_BITS));
206 ASSERT (log2_alloc < ((uword) 1 << LOG2_ALLOC_BITS));
207 p->alloc_len = (log2_alloc << PAIR_BITS) | len;
210 /* internal routine to fetch value for given key */
211 uword *_hash_get (void *v, uword key);
213 /* internal routine to fetch value (key, value) pair for given key */
214 hash_pair_t *_hash_get_pair (void *v, uword key);
216 /* internal routine to unset a (key, value) pair */
217 void *_hash_unset (void *v, uword key, void *old_value);
219 /* internal routine to set a (key, value) pair, return the old value */
220 void *_hash_set3 (void *v, uword key, void *value, void *old_value);
222 /* Resize a hash table */
223 void *hash_resize (void *old, uword new_size);
225 /* duplicate a hash table */
226 void *hash_dup (void *old);
228 /* Returns the number of bytes used by a hash table */
229 uword hash_bytes (void *v);
231 /* Public macro to set a (key, value) pair, return the old value */
232 #define hash_set3(h,key,value,old_value) \
234 uword _v = (uword) (value); \
235 (h) = _hash_set3 ((h), (uword) (key), (void *) &_v, (old_value)); \
238 /* Public macro to fetch value for given key */
239 #define hash_get(h,key) _hash_get ((h), (uword) (key))
241 /* Public macro to fetch value (key, value) pair for given key */
242 #define hash_get_pair(h,key) _hash_get_pair ((h), (uword) (key))
244 /* Public macro to set a (key, value) pair */
245 #define hash_set(h,key,value) hash_set3(h,key,value,0)
247 /* Public macro to set (key, 0) pair */
248 #define hash_set1(h,key) (h) = _hash_set3(h,(uword) (key),0,0)
250 /* Public macro to unset a (key, value) pair */
251 #define hash_unset(h,key) ((h) = _hash_unset ((h), (uword) (key),0))
253 /* Public macro to unset a (key, value) pair, return the old value */
254 #define hash_unset3(h,key,old_value) ((h) = _hash_unset ((h), (uword) (key), (void *) (old_value)))
256 /* get/set/unset for pointer keys. */
258 /* Public macro to fetch value for given pointer key */
259 #define hash_get_mem(h,key) _hash_get ((h), pointer_to_uword (key))
261 /* Public macro to fetch (key, value) for given pointer key */
262 #define hash_get_pair_mem(h,key) _hash_get_pair ((h), pointer_to_uword (key))
264 /* Public macro to set (key, value) for pointer key */
265 #define hash_set_mem(h,key,value) hash_set3 (h, pointer_to_uword (key), (value), 0)
267 /* Public inline function allocate and copy key to use in hash for pointer key */
269 hash_set_mem_alloc (uword ** h, const void *key, uword v)
271 int objsize = __builtin_object_size (key, 0);
272 size_t ksz = hash_header (*h)->user;
276 ASSERT (objsize == ksz);
277 copy = clib_mem_alloc (objsize);
278 clib_memcpy_fast (copy, key, objsize);
282 copy = clib_mem_alloc (ksz);
283 clib_memcpy_fast (copy, key, ksz);
285 hash_set_mem (*h, copy, v);
288 /* Public macro to set (key, 0) for pointer key */
289 #define hash_set1_mem(h,key) hash_set3 ((h), pointer_to_uword (key), 0, 0)
291 /* Public macro to unset (key, value) for pointer key */
292 #define hash_unset_mem(h,key) ((h) = _hash_unset ((h), pointer_to_uword (key),0))
294 /* Public inline function to unset pointer key and then free the key memory */
296 hash_unset_mem_free (uword ** h, const void *key)
298 hash_pair_t *hp = hash_get_pair_mem (*h, key);
299 if (PREDICT_TRUE (hp != NULL))
301 void *_k = uword_to_pointer (hp->key, void *);
302 hash_unset_mem (*h, _k);
307 /* internal routine to free a hash table */
308 extern void *_hash_free (void *v);
310 /* Public macro to free a hash table */
311 #define hash_free(h) (h) = _hash_free ((h))
313 clib_error_t *hash_validate (void *v);
315 /* Public inline function to get the number of value bytes for a hash table */
317 hash_value_bytes (hash_t * h)
320 return (sizeof (p->value[0]) << h->log2_pair_size) - sizeof (p->key);
323 /* Public inline function to get log2(size of a (key,value) pair) */
325 hash_pair_log2_bytes (hash_t * h)
327 uword log2_bytes = h->log2_pair_size;
328 ASSERT (BITS (hash_pair_t) == 32 || BITS (hash_pair_t) == 64);
329 if (BITS (hash_pair_t) == 32)
331 else if (BITS (hash_pair_t) == 64)
336 /* Public inline function to get size of a (key,value) pair */
338 hash_pair_bytes (hash_t * h)
340 return (uword) 1 << hash_pair_log2_bytes (h);
343 /* Public inline function to advance a pointer past one (key,value) pair */
345 hash_forward1 (hash_t * h, void *v)
347 return (u8 *) v + hash_pair_bytes (h);
350 /* Public inline function to advance a pointer past N (key,value) pairs */
352 hash_forward (hash_t * h, void *v, uword n)
354 return (u8 *) v + ((n * sizeof (hash_pair_t)) << h->log2_pair_size);
357 /** Iterate over hash pairs.
359 @param p The current (key,value) pair. This should be of type
360 <code>(hash_pair_t *)</code>.
361 @param v The hash table to iterate.
362 @param body The operation to perform on each (key,value) pair.
364 Executes the expression or code block @c body with each active hash pair.
366 /* A previous version of this macro made use of the hash_pair_union_t
367 * structure; this version does not since that approach mightily upset
368 * the static analysis tool. In the rare chance someone is reading this
369 * code, pretend that _p below is of type hash_pair_union_t and that when
370 * used as an rvalue it's really using one of the union members as the
371 * rvalue. If you were confused before you might be marginally less
374 #define hash_foreach_pair(p,v,body) \
376 __label__ _hash_foreach_done; \
377 hash_t * _h = hash_header (v); \
379 hash_pair_t * _q, * _q_end; \
380 uword _i, _i1, _id, _pair_increment; \
384 _pair_increment = 1; \
386 _pair_increment = 1 << _h->log2_pair_size; \
387 while (_i < hash_capacity (v)) \
389 _id = _h->is_user[_i / BITS (_h->is_user[0])]; \
390 _i1 = _i + BITS (_h->is_user[0]); \
396 _q_end = _q + _pair_increment; \
400 hash_pair_indirect_t * _pi = _p; \
402 if (_h->log2_pair_size > 0) \
403 _q_end = hash_forward (_h, _q, indirect_pair_get_len (_pi)); \
405 _q_end = vec_end (_q); \
408 /* Loop through all elements in bucket. \
409 Bucket may have 0 1 or more (indirect case) pairs. */ \
410 while (_q < _q_end) \
412 uword _break_in_body = 1; \
416 _break_in_body = 0; \
418 if (_break_in_body) \
419 goto _hash_foreach_done; \
420 _q += _pair_increment; \
423 _p = (hash_pair_t *)_p + _pair_increment; \
426 } while (_i < _i1); \
428 _hash_foreach_done: \
429 /* Be silent Mr. Compiler-Warning. */ \
433 /* Iterate over key/value pairs
435 @param key_var the current key
436 @param value_var the current value
437 @param h the hash table to iterate across
438 @param body the operation to perform on each (key_var,value_var) pair.
440 calls body with each active hash pair
442 /* Iterate over key/value pairs. */
443 #define hash_foreach(key_var,value_var,h,body) \
446 hash_foreach_pair (_r, (h), { \
447 (key_var) = (__typeof__ (key_var)) _r->key; \
448 (value_var) = (__typeof__ (value_var)) _r->value[0]; \
449 do { body; } while (0); \
453 /* Iterate over key/value pairs for pointer key hash tables
455 @param key_var the current key
456 @param value_var the current value
457 @param h the hash table to iterate across
458 @param body the operation to perform on each (key_var,value_var) pair.
460 calls body with each active hash pair
462 #define hash_foreach_mem(key_var,value_var,h,body) \
465 hash_foreach_pair (_r, (h), { \
466 (key_var) = (__typeof__ (key_var)) uword_to_pointer (_r->key, void *); \
467 (value_var) = (__typeof__ (value_var)) _r->value[0]; \
468 do { body; } while (0); \
472 /* Support for iteration through hash table. */
474 /* This struct saves iteration state for hash_next.
475 None of these fields are meant to be visible to the user.
476 Hence, the cryptic short-hand names. */
482 hash_pair_t *hash_next (void *v, hash_next_t * hn);
484 void *_hash_create (uword elts, hash_t * h);
487 hash_set_value_bytes (hash_t * h, uword value_bytes)
491 max_log2 ((sizeof (p->key) + value_bytes + sizeof (p->key) -
492 1) / sizeof (p->key));
495 #define hash_create2(_elts,_user,_value_bytes, \
496 _key_sum,_key_equal, \
497 _format_pair,_format_pair_arg) \
500 clib_memset (&_h, 0, sizeof (_h)); \
502 _h.key_sum = (hash_key_sum_function_t *) (_key_sum); \
503 _h.key_equal = (_key_equal); \
504 hash_set_value_bytes (&_h, (_value_bytes)); \
505 _h.format_pair = (format_function_t *) (_format_pair); \
506 _h.format_pair_arg = (_format_pair_arg); \
507 _hash_create ((_elts), &_h); \
510 /* Hash function based on that of Bob Jenkins (bob_jenkins@compuserve.com).
511 Public domain per: http://www.burtleburtle.net/bob/hash/doobs.html
514 #define hash_mix_step(a,b,c,s0,s1,s2) \
516 (a) -= (b) + (c); (a) ^= (c) >> (s0); \
517 (b) -= (c) + (a); (b) ^= (a) << (s1); \
518 (c) -= (a) + (b); (c) ^= (b) >> (s2); \
521 #define hash_mix32_step_1(a,b,c) hash_mix_step(a,b,c,13,8,13)
522 #define hash_mix32_step_2(a,b,c) hash_mix_step(a,b,c,12,16,5)
523 #define hash_mix32_step_3(a,b,c) hash_mix_step(a,b,c,3,10,15)
525 #define hash_mix64_step_1(a,b,c) hash_mix_step(a,b,c,43,9,8)
526 #define hash_mix64_step_2(a,b,c) hash_mix_step(a,b,c,38,23,5)
527 #define hash_mix64_step_3(a,b,c) hash_mix_step(a,b,c,35,49,11)
528 #define hash_mix64_step_4(a,b,c) hash_mix_step(a,b,c,12,18,22)
531 #define hash_mix(a, b, c) hash_mix64 (a, b, c)
533 #define hash_mix(a, b, c) hash_mix32 (a, b, c)
536 /* Hash function based on that of Bob Jenkins (bob_jenkins@compuserve.com).
538 #define hash_mix64(a0,b0,c0) \
540 hash_mix64_step_1 (a0, b0, c0); \
541 hash_mix64_step_2 (a0, b0, c0); \
542 hash_mix64_step_3 (a0, b0, c0); \
543 hash_mix64_step_4 (a0, b0, c0); \
546 #define hash_mix32(a0,b0,c0) \
548 hash_mix32_step_1 (a0, b0, c0); \
549 hash_mix32_step_2 (a0, b0, c0); \
550 hash_mix32_step_3 (a0, b0, c0); \
553 /* Finalize from Bob Jenkins lookup3.c */
556 hash32_rotate_left (u32 x, u32 i)
558 return (x << i) | (x >> (BITS (i) - i));
561 #define hash_v3_mix32(a,b,c) \
563 (a) -= (c); (a) ^= hash32_rotate_left ((c), 4); (c) += (b); \
564 (b) -= (a); (b) ^= hash32_rotate_left ((a), 6); (a) += (c); \
565 (c) -= (b); (c) ^= hash32_rotate_left ((b), 8); (b) += (a); \
566 (a) -= (c); (a) ^= hash32_rotate_left ((c),16); (c) += (b); \
567 (b) -= (a); (b) ^= hash32_rotate_left ((a),19); (a) += (c); \
568 (c) -= (b); (c) ^= hash32_rotate_left ((b), 4); (b) += (a); \
571 #define hash_v3_finalize32(a,b,c) \
573 (c) ^= (b); (c) -= hash32_rotate_left ((b), 14); \
574 (a) ^= (c); (a) -= hash32_rotate_left ((c), 11); \
575 (b) ^= (a); (b) -= hash32_rotate_left ((a), 25); \
576 (c) ^= (b); (c) -= hash32_rotate_left ((b), 16); \
577 (a) ^= (c); (a) -= hash32_rotate_left ((c), 4); \
578 (b) ^= (a); (b) -= hash32_rotate_left ((a), 14); \
579 (c) ^= (b); (c) -= hash32_rotate_left ((b), 24); \
582 /* 32 bit mixing/finalize in steps. */
584 #define hash_v3_mix32_step1(a,b,c) \
586 (a) -= (c); (a) ^= hash32_rotate_left ((c), 4); (c) += (b); \
587 (b) -= (a); (b) ^= hash32_rotate_left ((a), 6); (a) += (c); \
590 #define hash_v3_mix32_step2(a,b,c) \
592 (c) -= (b); (c) ^= hash32_rotate_left ((b), 8); (b) += (a); \
593 (a) -= (c); (a) ^= hash32_rotate_left ((c),16); (c) += (b); \
596 #define hash_v3_mix32_step3(a,b,c) \
598 (b) -= (a); (b) ^= hash32_rotate_left ((a),19); (a) += (c); \
599 (c) -= (b); (c) ^= hash32_rotate_left ((b), 4); (b) += (a); \
602 #define hash_v3_finalize32_step1(a,b,c) \
604 (c) ^= (b); (c) -= hash32_rotate_left ((b), 14); \
605 (a) ^= (c); (a) -= hash32_rotate_left ((c), 11); \
608 #define hash_v3_finalize32_step2(a,b,c) \
610 (b) ^= (a); (b) -= hash32_rotate_left ((a), 25); \
611 (c) ^= (b); (c) -= hash32_rotate_left ((b), 16); \
614 #define hash_v3_finalize32_step3(a,b,c) \
616 (a) ^= (c); (a) -= hash32_rotate_left ((c), 4); \
617 (b) ^= (a); (b) -= hash32_rotate_left ((a), 14); \
618 (c) ^= (b); (c) -= hash32_rotate_left ((b), 24); \
621 /* Vector v3 mixing/finalize. */
622 #define hash_v3_mix_step_1_u32x(a,b,c) \
624 (a) -= (c); (a) ^= u32x_irotate_left ((c), 4); (c) += (b); \
625 (b) -= (a); (b) ^= u32x_irotate_left ((a), 6); (a) += (c); \
626 (c) -= (b); (c) ^= u32x_irotate_left ((b), 8); (b) += (a); \
629 #define hash_v3_mix_step_2_u32x(a,b,c) \
631 (a) -= (c); (a) ^= u32x_irotate_left ((c),16); (c) += (b); \
632 (b) -= (a); (b) ^= u32x_irotate_left ((a),19); (a) += (c); \
633 (c) -= (b); (c) ^= u32x_irotate_left ((b), 4); (b) += (a); \
636 #define hash_v3_finalize_step_1_u32x(a,b,c) \
638 (c) ^= (b); (c) -= u32x_irotate_left ((b), 14); \
639 (a) ^= (c); (a) -= u32x_irotate_left ((c), 11); \
640 (b) ^= (a); (b) -= u32x_irotate_left ((a), 25); \
643 #define hash_v3_finalize_step_2_u32x(a,b,c) \
645 (c) ^= (b); (c) -= u32x_irotate_left ((b), 16); \
646 (a) ^= (c); (a) -= u32x_irotate_left ((c), 4); \
647 (b) ^= (a); (b) -= u32x_irotate_left ((a), 14); \
648 (c) ^= (b); (c) -= u32x_irotate_left ((b), 24); \
651 #define hash_v3_mix_u32x(a,b,c) \
653 hash_v3_mix_step_1_u32x(a,b,c); \
654 hash_v3_mix_step_2_u32x(a,b,c); \
657 #define hash_v3_finalize_u32x(a,b,c) \
659 hash_v3_finalize_step_1_u32x(a,b,c); \
660 hash_v3_finalize_step_2_u32x(a,b,c); \
663 extern uword hash_memory (void *p, word n_bytes, uword state);
665 extern uword mem_key_sum (hash_t * h, uword key);
666 extern uword mem_key_equal (hash_t * h, uword key1, uword key2);
668 #define hash_create_mem(elts,key_bytes,value_bytes) \
669 hash_create2((elts),(key_bytes),(value_bytes),mem_key_sum,mem_key_equal,0,0)
671 extern uword vec_key_sum (hash_t * h, uword key);
672 extern uword vec_key_equal (hash_t * h, uword key1, uword key2);
673 extern u8 *vec_key_format_pair (u8 * s, va_list * args);
675 #define hash_create_vec(elts,key_bytes,value_bytes) \
676 hash_create2((elts),(key_bytes),(value_bytes),\
677 vec_key_sum,vec_key_equal,vec_key_format_pair,0)
679 extern uword string_key_sum (hash_t * h, uword key);
680 extern uword string_key_equal (hash_t * h, uword key1, uword key2);
681 extern u8 *string_key_format_pair (u8 * s, va_list * args);
684 * Note: if you plan to put a hash into shared memory,
685 * the key sum and key equal functions MUST be set to magic constants!
686 * PIC means that whichever process sets up the hash won't have
687 * the actual key sum functions at the same place, leading to
688 * very hard-to-find bugs...
691 #define hash_create_shmem(elts,key_bytes,value_bytes) \
692 hash_create2((elts),(key_bytes),(value_bytes), \
693 (hash_key_sum_function_t *) KEY_FUNC_MEM, \
694 (hash_key_equal_function_t *)KEY_FUNC_MEM, \
697 #define hash_create_string(elts,value_bytes) \
698 hash_create2((elts),0,(value_bytes), \
699 (hash_key_sum_function_t *) KEY_FUNC_STRING, \
700 (hash_key_equal_function_t *)KEY_FUNC_STRING, \
703 #define hash_create(elts,value_bytes) \
704 hash_create2((elts),0,(value_bytes), \
705 (hash_key_sum_function_t *) KEY_FUNC_NONE, \
706 (hash_key_equal_function_t *) KEY_FUNC_NONE, \
709 #define hash_create_uword(elts,value_bytes) \
710 hash_create2((elts),0,(value_bytes), \
711 (hash_key_sum_function_t *) KEY_FUNC_POINTER_UWORD, \
712 (hash_key_equal_function_t *) KEY_FUNC_POINTER_UWORD, \
715 #define hash_create_u32(elts,value_bytes) \
716 hash_create2((elts),0,(value_bytes), \
717 (hash_key_sum_function_t *) KEY_FUNC_POINTER_U32, \
718 (hash_key_equal_function_t *) KEY_FUNC_POINTER_U32, \
721 u8 *format_hash (u8 * s, va_list * va);
723 /* Looks up input in hash table indexed by either vec string or
724 c string (null terminated). */
725 unformat_function_t unformat_hash_vec_string;
726 unformat_function_t unformat_hash_string;
728 /* Main test routine. */
729 int test_hash_main (unformat_input_t * input);
731 #endif /* included_hash_h */
734 * fd.io coding-style-patch-verification: ON
737 * eval: (c-set-style "gnu")