1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
/* $OpenBSD: hashtable.h,v 1.1 2019/04/14 10:14:53 jsg Exp $ */
/*
* Copyright (c) 2017 Mark Kettenis
*
* Permission to use, copy, modify, and distribute this software for any
* purpose with or without fee is hereby granted, provided that the above
* copyright notice and this permission notice appear in all copies.
*
* THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
* WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
* ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
* WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
* ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
* OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
*/
#ifndef _LINUX_HASHTABLE_H
#define _LINUX_HASHTABLE_H
#include <linux/list.h>
#define DECLARE_HASHTABLE(name, bits) struct hlist_head name[1 << (bits)]
static inline void
__hash_init(struct hlist_head *table, u_int size)
{
u_int i;
for (i = 0; i < size; i++)
INIT_HLIST_HEAD(&table[i]);
}
static inline bool
__hash_empty(struct hlist_head *table, u_int size)
{
u_int i;
for (i = 0; i < size; i++) {
if (!hlist_empty(&table[i]))
return false;
}
return true;
}
#define __hash(table, key) &table[key % (nitems(table) - 1)]
#define hash_init(table) __hash_init(table, nitems(table))
#define hash_add(table, node, key) \
hlist_add_head(node, __hash(table, key))
#define hash_del(node) hlist_del_init(node)
#define hash_empty(table) __hash_empty(table, nitems(table))
#define hash_for_each_possible(table, obj, member, key) \
hlist_for_each_entry(obj, __hash(table, key), member)
#define hash_for_each_safe(table, i, tmp, obj, member) \
for (i = 0; i < nitems(table); i++) \
hlist_for_each_entry_safe(obj, tmp, &table[i], member)
#endif
|
