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 /* Hash header size in bytes */
101 hash_header_bytes (void *v)
104 uword is_user_bytes =
105 (sizeof (h->is_user[0]) * vec_len (v)) / BITS (h->is_user[0]);
106 return sizeof (h[0]) + is_user_bytes;
109 /* Returns a pointer to the hash header given the vector pointer */
110 always_inline hash_t *
111 hash_header (void *v)
113 return vec_header (v, hash_header_bytes (v));
116 /* Number of elements in the hash table */
120 hash_t *h = hash_header (v);
121 return v ? h->elts : 0;
124 /* Number of elements the hash table can hold */
126 hash_capacity (void *v)
131 /* Returns 1 if the hash pair contains user data */
133 hash_is_user (void *v, uword i)
135 hash_t *h = hash_header (v);
136 uword i0 = i / BITS (h->is_user[0]);
137 uword i1 = i % BITS (h->is_user[0]);
138 return (h->is_user[i0] & ((uword) 1 << i1)) != 0;
141 /* Set the format function and format argument for a hash table */
143 hash_set_pair_format (void *v,
144 format_function_t * format_pair, void *format_pair_arg)
146 hash_t *h = hash_header (v);
147 h->format_pair = format_pair;
148 h->format_pair_arg = format_pair_arg;
151 /* Set hash table flags */
153 hash_set_flags (void *v, uword flags)
155 hash_header (v)->flags |= flags;
158 /* Key value pairs. */
164 /* The Value. Length is 2^log2_pair_size - 1. */
168 /* The indirect pair structure
170 If log2_pair_size > 0 we overload hash pairs
171 with indirect pairs for buckets with more than one
178 u8 pad[sizeof (uword) - sizeof (hash_pair_t *)];
179 /* allocated length */
182 hash_pair_indirect_t;
184 /* Direct / Indirect pair union */
188 hash_pair_indirect_t indirect;
191 #define LOG2_ALLOC_BITS (5)
192 #define PAIR_BITS (BITS (uword) - LOG2_ALLOC_BITS)
194 /* Log2 number of bytes allocated in pairs array. */
196 indirect_pair_get_log2_bytes (hash_pair_indirect_t * p)
198 return p->alloc_len >> PAIR_BITS;
201 /* Get the length of an indirect pair */
203 indirect_pair_get_len (hash_pair_indirect_t * p)
208 return p->alloc_len & (((uword) 1 << PAIR_BITS) - 1);
211 /* Set the length of an indirect pair */
213 indirect_pair_set (hash_pair_indirect_t * p, uword log2_alloc, uword len)
215 ASSERT (len < ((uword) 1 << PAIR_BITS));
216 ASSERT (log2_alloc < ((uword) 1 << LOG2_ALLOC_BITS));
217 p->alloc_len = (log2_alloc << PAIR_BITS) | len;
220 /* internal routine to fetch value for given key */
221 uword *_hash_get (void *v, uword key);
223 /* internal routine to fetch value (key, value) pair for given key */
224 hash_pair_t *_hash_get_pair (void *v, uword key);
226 /* internal routine to unset a (key, value) pair */
227 void *_hash_unset (void *v, uword key, void *old_value);
229 /* internal routine to set a (key, value) pair, return the old value */
230 void *_hash_set3 (void *v, uword key, void *value, void *old_value);
232 /* Resize a hash table */
233 void *hash_resize (void *old, uword new_size);
235 /* duplicate a hash table */
236 void *hash_dup (void *old);
238 /* Returns the number of bytes used by a hash table */
239 uword hash_bytes (void *v);
241 /* Public macro to set a (key, value) pair, return the old value */
242 #define hash_set3(h,key,value,old_value) \
244 uword _v = (uword) (value); \
245 (h) = _hash_set3 ((h), (uword) (key), (void *) &_v, (old_value)); \
248 /* Public macro to fetch value for given key */
249 #define hash_get(h,key) _hash_get ((h), (uword) (key))
251 /* Public macro to fetch value (key, value) pair for given key */
252 #define hash_get_pair(h,key) _hash_get_pair ((h), (uword) (key))
254 /* Public macro to set a (key, value) pair */
255 #define hash_set(h,key,value) hash_set3(h,key,value,0)
257 /* Public macro to set (key, 0) pair */
258 #define hash_set1(h,key) (h) = _hash_set3(h,(uword) (key),0,0)
260 /* Public macro to unset a (key, value) pair */
261 #define hash_unset(h,key) ((h) = _hash_unset ((h), (uword) (key),0))
263 /* Public macro to unset a (key, value) pair, return the old value */
264 #define hash_unset3(h,key,old_value) ((h) = _hash_unset ((h), (uword) (key), (void *) (old_value)))
266 /* get/set/unset for pointer keys. */
268 /* Public macro to fetch value for given pointer key */
269 #define hash_get_mem(h,key) _hash_get ((h), pointer_to_uword (key))
271 /* Public macro to fetch (key, value) for given pointer key */
272 #define hash_get_pair_mem(h,key) _hash_get_pair ((h), pointer_to_uword (key))
274 /* Public macro to set (key, value) for pointer key */
275 #define hash_set_mem(h,key,value) hash_set3 (h, pointer_to_uword (key), (value), 0)
277 /* Public inline function allocate and copy key to use in hash for pointer key */
279 hash_set_mem_alloc (uword ** h, void *key, uword v)
281 size_t ksz = hash_header (*h)->user;
282 void *copy = clib_mem_alloc (ksz);
283 clib_memcpy_fast (copy, key, ksz);
284 hash_set_mem (*h, copy, v);
287 /* Public macro to set (key, 0) for pointer key */
288 #define hash_set1_mem(h,key) hash_set3 ((h), pointer_to_uword (key), 0, 0)
290 /* Public macro to unset (key, value) for pointer key */
291 #define hash_unset_mem(h,key) ((h) = _hash_unset ((h), pointer_to_uword (key),0))
293 /* Public inline function to unset pointer key and then free the key memory */
295 hash_unset_mem_free (uword ** h, void *key)
297 hash_pair_t *hp = hash_get_pair_mem (*h, key);
298 if (PREDICT_TRUE (hp != NULL))
300 key = uword_to_pointer (hp->key, void *);
301 hash_unset_mem (*h, key);
306 /* internal routine to free a hash table */
307 extern void *_hash_free (void *v);
309 /* Public macro to free a hash table */
310 #define hash_free(h) (h) = _hash_free ((h))
312 clib_error_t *hash_validate (void *v);
314 /* Public inline function to get the number of value bytes for a hash table */
316 hash_value_bytes (hash_t * h)
319 return (sizeof (p->value[0]) << h->log2_pair_size) - sizeof (p->key);
322 /* Public inline function to get log2(size of a (key,value) pair) */
324 hash_pair_log2_bytes (hash_t * h)
326 uword log2_bytes = h->log2_pair_size;
327 ASSERT (BITS (hash_pair_t) == 32 || BITS (hash_pair_t) == 64);
328 if (BITS (hash_pair_t) == 32)
330 else if (BITS (hash_pair_t) == 64)
335 /* Public inline function to get size of a (key,value) pair */
337 hash_pair_bytes (hash_t * h)
339 return (uword) 1 << hash_pair_log2_bytes (h);
342 /* Public inline function to advance a pointer past one (key,value) pair */
344 hash_forward1 (hash_t * h, void *v)
346 return (u8 *) v + hash_pair_bytes (h);
349 /* Public inline function to advance a pointer past N (key,value) pairs */
351 hash_forward (hash_t * h, void *v, uword n)
353 return (u8 *) v + ((n * sizeof (hash_pair_t)) << h->log2_pair_size);
356 /** Iterate over hash pairs.
358 @param p The current (key,value) pair. This should be of type
359 <code>(hash_pair_t *)</code>.
360 @param v The hash table to iterate.
361 @param body The operation to perform on each (key,value) pair.
363 Executes the expression or code block @c body with each active hash pair.
365 /* A previous version of this macro made use of the hash_pair_union_t
366 * structure; this version does not since that approach mightily upset
367 * the static analysis tool. In the rare chance someone is reading this
368 * code, pretend that _p below is of type hash_pair_union_t and that when
369 * used as an rvalue it's really using one of the union members as the
370 * rvalue. If you were confused before you might be marginally less
373 #define hash_foreach_pair(p,v,body) \
375 __label__ _hash_foreach_done; \
376 hash_t * _h = hash_header (v); \
378 hash_pair_t * _q, * _q_end; \
379 uword _i, _i1, _id, _pair_increment; \
383 _pair_increment = 1; \
385 _pair_increment = 1 << _h->log2_pair_size; \
386 while (_i < hash_capacity (v)) \
388 _id = _h->is_user[_i / BITS (_h->is_user[0])]; \
389 _i1 = _i + BITS (_h->is_user[0]); \
395 _q_end = _q + _pair_increment; \
399 hash_pair_indirect_t * _pi = _p; \
401 if (_h->log2_pair_size > 0) \
402 _q_end = hash_forward (_h, _q, indirect_pair_get_len (_pi)); \
404 _q_end = vec_end (_q); \
407 /* Loop through all elements in bucket. \
408 Bucket may have 0 1 or more (indirect case) pairs. */ \
409 while (_q < _q_end) \
411 uword _break_in_body = 1; \
415 _break_in_body = 0; \
417 if (_break_in_body) \
418 goto _hash_foreach_done; \
419 _q += _pair_increment; \
422 _p = (hash_pair_t *)_p + _pair_increment; \
425 } while (_i < _i1); \
427 _hash_foreach_done: \
428 /* Be silent Mr. Compiler-Warning. */ \
432 /* Iterate over key/value pairs
434 @param key_var the current key
435 @param value_var the current value
436 @param h the hash table to iterate across
437 @param body the operation to perform on each (key_var,value_var) pair.
439 calls body with each active hash pair
441 /* Iterate over key/value pairs. */
442 #define hash_foreach(key_var,value_var,h,body) \
445 hash_foreach_pair (_r, (h), { \
446 (key_var) = (__typeof__ (key_var)) _r->key; \
447 (value_var) = (__typeof__ (value_var)) _r->value[0]; \
448 do { body; } while (0); \
452 /* Iterate over key/value pairs for pointer key hash tables
454 @param key_var the current key
455 @param value_var the current value
456 @param h the hash table to iterate across
457 @param body the operation to perform on each (key_var,value_var) pair.
459 calls body with each active hash pair
461 #define hash_foreach_mem(key_var,value_var,h,body) \
464 hash_foreach_pair (_r, (h), { \
465 (key_var) = (__typeof__ (key_var)) uword_to_pointer (_r->key, void *); \
466 (value_var) = (__typeof__ (value_var)) _r->value[0]; \
467 do { body; } while (0); \
471 /* Support for iteration through hash table. */
473 /* This struct saves iteration state for hash_next.
474 None of these fields are meant to be visible to the user.
475 Hence, the cryptic short-hand names. */
481 hash_pair_t *hash_next (void *v, hash_next_t * hn);
483 void *_hash_create (uword elts, hash_t * h);
486 hash_set_value_bytes (hash_t * h, uword value_bytes)
490 max_log2 ((sizeof (p->key) + value_bytes + sizeof (p->key) -
491 1) / sizeof (p->key));
494 #define hash_create2(_elts,_user,_value_bytes, \
495 _key_sum,_key_equal, \
496 _format_pair,_format_pair_arg) \
499 clib_memset (&_h, 0, sizeof (_h)); \
501 _h.key_sum = (hash_key_sum_function_t *) (_key_sum); \
502 _h.key_equal = (_key_equal); \
503 hash_set_value_bytes (&_h, (_value_bytes)); \
504 _h.format_pair = (format_function_t *) (_format_pair); \
505 _h.format_pair_arg = (_format_pair_arg); \
506 _hash_create ((_elts), &_h); \
509 /* Hash function based on that of Bob Jenkins (bob_jenkins@compuserve.com).
510 Public domain per: http://www.burtleburtle.net/bob/hash/doobs.html
513 #define hash_mix_step(a,b,c,s0,s1,s2) \
515 (a) -= (b) + (c); (a) ^= (c) >> (s0); \
516 (b) -= (c) + (a); (b) ^= (a) << (s1); \
517 (c) -= (a) + (b); (c) ^= (b) >> (s2); \
520 #define hash_mix32_step_1(a,b,c) hash_mix_step(a,b,c,13,8,13)
521 #define hash_mix32_step_2(a,b,c) hash_mix_step(a,b,c,12,16,5)
522 #define hash_mix32_step_3(a,b,c) hash_mix_step(a,b,c,3,10,15)
524 #define hash_mix64_step_1(a,b,c) hash_mix_step(a,b,c,43,9,8)
525 #define hash_mix64_step_2(a,b,c) hash_mix_step(a,b,c,38,23,5)
526 #define hash_mix64_step_3(a,b,c) hash_mix_step(a,b,c,35,49,11)
527 #define hash_mix64_step_4(a,b,c) hash_mix_step(a,b,c,12,18,22)
529 /* Hash function based on that of Bob Jenkins (bob_jenkins@compuserve.com).
531 #define hash_mix64(a0,b0,c0) \
533 hash_mix64_step_1 (a0, b0, c0); \
534 hash_mix64_step_2 (a0, b0, c0); \
535 hash_mix64_step_3 (a0, b0, c0); \
536 hash_mix64_step_4 (a0, b0, c0); \
539 #define hash_mix32(a0,b0,c0) \
541 hash_mix32_step_1 (a0, b0, c0); \
542 hash_mix32_step_2 (a0, b0, c0); \
543 hash_mix32_step_3 (a0, b0, c0); \
546 /* Finalize from Bob Jenkins lookup3.c */
549 hash32_rotate_left (u32 x, u32 i)
551 return (x << i) | (x >> (BITS (i) - i));
554 #define hash_v3_mix32(a,b,c) \
556 (a) -= (c); (a) ^= hash32_rotate_left ((c), 4); (c) += (b); \
557 (b) -= (a); (b) ^= hash32_rotate_left ((a), 6); (a) += (c); \
558 (c) -= (b); (c) ^= hash32_rotate_left ((b), 8); (b) += (a); \
559 (a) -= (c); (a) ^= hash32_rotate_left ((c),16); (c) += (b); \
560 (b) -= (a); (b) ^= hash32_rotate_left ((a),19); (a) += (c); \
561 (c) -= (b); (c) ^= hash32_rotate_left ((b), 4); (b) += (a); \
564 #define hash_v3_finalize32(a,b,c) \
566 (c) ^= (b); (c) -= hash32_rotate_left ((b), 14); \
567 (a) ^= (c); (a) -= hash32_rotate_left ((c), 11); \
568 (b) ^= (a); (b) -= hash32_rotate_left ((a), 25); \
569 (c) ^= (b); (c) -= hash32_rotate_left ((b), 16); \
570 (a) ^= (c); (a) -= hash32_rotate_left ((c), 4); \
571 (b) ^= (a); (b) -= hash32_rotate_left ((a), 14); \
572 (c) ^= (b); (c) -= hash32_rotate_left ((b), 24); \
575 /* 32 bit mixing/finalize in steps. */
577 #define hash_v3_mix32_step1(a,b,c) \
579 (a) -= (c); (a) ^= hash32_rotate_left ((c), 4); (c) += (b); \
580 (b) -= (a); (b) ^= hash32_rotate_left ((a), 6); (a) += (c); \
583 #define hash_v3_mix32_step2(a,b,c) \
585 (c) -= (b); (c) ^= hash32_rotate_left ((b), 8); (b) += (a); \
586 (a) -= (c); (a) ^= hash32_rotate_left ((c),16); (c) += (b); \
589 #define hash_v3_mix32_step3(a,b,c) \
591 (b) -= (a); (b) ^= hash32_rotate_left ((a),19); (a) += (c); \
592 (c) -= (b); (c) ^= hash32_rotate_left ((b), 4); (b) += (a); \
595 #define hash_v3_finalize32_step1(a,b,c) \
597 (c) ^= (b); (c) -= hash32_rotate_left ((b), 14); \
598 (a) ^= (c); (a) -= hash32_rotate_left ((c), 11); \
601 #define hash_v3_finalize32_step2(a,b,c) \
603 (b) ^= (a); (b) -= hash32_rotate_left ((a), 25); \
604 (c) ^= (b); (c) -= hash32_rotate_left ((b), 16); \
607 #define hash_v3_finalize32_step3(a,b,c) \
609 (a) ^= (c); (a) -= hash32_rotate_left ((c), 4); \
610 (b) ^= (a); (b) -= hash32_rotate_left ((a), 14); \
611 (c) ^= (b); (c) -= hash32_rotate_left ((b), 24); \
614 /* Vector v3 mixing/finalize. */
615 #define hash_v3_mix_step_1_u32x(a,b,c) \
617 (a) -= (c); (a) ^= u32x_irotate_left ((c), 4); (c) += (b); \
618 (b) -= (a); (b) ^= u32x_irotate_left ((a), 6); (a) += (c); \
619 (c) -= (b); (c) ^= u32x_irotate_left ((b), 8); (b) += (a); \
622 #define hash_v3_mix_step_2_u32x(a,b,c) \
624 (a) -= (c); (a) ^= u32x_irotate_left ((c),16); (c) += (b); \
625 (b) -= (a); (b) ^= u32x_irotate_left ((a),19); (a) += (c); \
626 (c) -= (b); (c) ^= u32x_irotate_left ((b), 4); (b) += (a); \
629 #define hash_v3_finalize_step_1_u32x(a,b,c) \
631 (c) ^= (b); (c) -= u32x_irotate_left ((b), 14); \
632 (a) ^= (c); (a) -= u32x_irotate_left ((c), 11); \
633 (b) ^= (a); (b) -= u32x_irotate_left ((a), 25); \
636 #define hash_v3_finalize_step_2_u32x(a,b,c) \
638 (c) ^= (b); (c) -= u32x_irotate_left ((b), 16); \
639 (a) ^= (c); (a) -= u32x_irotate_left ((c), 4); \
640 (b) ^= (a); (b) -= u32x_irotate_left ((a), 14); \
641 (c) ^= (b); (c) -= u32x_irotate_left ((b), 24); \
644 #define hash_v3_mix_u32x(a,b,c) \
646 hash_v3_mix_step_1_u32x(a,b,c); \
647 hash_v3_mix_step_2_u32x(a,b,c); \
650 #define hash_v3_finalize_u32x(a,b,c) \
652 hash_v3_finalize_step_1_u32x(a,b,c); \
653 hash_v3_finalize_step_2_u32x(a,b,c); \
656 extern uword hash_memory (void *p, word n_bytes, uword state);
658 extern uword mem_key_sum (hash_t * h, uword key);
659 extern uword mem_key_equal (hash_t * h, uword key1, uword key2);
661 #define hash_create_mem(elts,key_bytes,value_bytes) \
662 hash_create2((elts),(key_bytes),(value_bytes),mem_key_sum,mem_key_equal,0,0)
664 extern uword vec_key_sum (hash_t * h, uword key);
665 extern uword vec_key_equal (hash_t * h, uword key1, uword key2);
666 extern u8 *vec_key_format_pair (u8 * s, va_list * args);
668 #define hash_create_vec(elts,key_bytes,value_bytes) \
669 hash_create2((elts),(key_bytes),(value_bytes),\
670 vec_key_sum,vec_key_equal,vec_key_format_pair,0)
672 extern uword string_key_sum (hash_t * h, uword key);
673 extern uword string_key_equal (hash_t * h, uword key1, uword key2);
674 extern u8 *string_key_format_pair (u8 * s, va_list * args);
677 * Note: if you plan to put a hash into shared memory,
678 * the key sum and key equal functions MUST be set to magic constants!
679 * PIC means that whichever process sets up the hash won't have
680 * the actual key sum functions at the same place, leading to
681 * very hard-to-find bugs...
684 #define hash_create_shmem(elts,key_bytes,value_bytes) \
685 hash_create2((elts),(key_bytes),(value_bytes), \
686 (hash_key_sum_function_t *) KEY_FUNC_MEM, \
687 (hash_key_equal_function_t *)KEY_FUNC_MEM, \
690 #define hash_create_string(elts,value_bytes) \
691 hash_create2((elts),0,(value_bytes), \
692 (hash_key_sum_function_t *) KEY_FUNC_STRING, \
693 (hash_key_equal_function_t *)KEY_FUNC_STRING, \
696 #define hash_create(elts,value_bytes) \
697 hash_create2((elts),0,(value_bytes), \
698 (hash_key_sum_function_t *) KEY_FUNC_NONE, \
699 (hash_key_equal_function_t *) KEY_FUNC_NONE, \
702 #define hash_create_uword(elts,value_bytes) \
703 hash_create2((elts),0,(value_bytes), \
704 (hash_key_sum_function_t *) KEY_FUNC_POINTER_UWORD, \
705 (hash_key_equal_function_t *) KEY_FUNC_POINTER_UWORD, \
708 #define hash_create_u32(elts,value_bytes) \
709 hash_create2((elts),0,(value_bytes), \
710 (hash_key_sum_function_t *) KEY_FUNC_POINTER_U32, \
711 (hash_key_equal_function_t *) KEY_FUNC_POINTER_U32, \
714 u8 *format_hash (u8 * s, va_list * va);
716 /* Looks up input in hash table indexed by either vec string or
717 c string (null terminated). */
718 unformat_function_t unformat_hash_vec_string;
719 unformat_function_t unformat_hash_string;
721 /* Main test routine. */
722 int test_hash_main (unformat_input_t * input);
724 #endif /* included_hash_h */
727 * fd.io coding-style-patch-verification: ON
730 * eval: (c-set-style "gnu")