Blame view
include/linux/hashtable.h
6.67 KB
b24413180 License cleanup: ... |
1 |
/* SPDX-License-Identifier: GPL-2.0 */ |
d9b482c8b hashtable: introd... |
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 |
/* * Statically sized hash table implementation * (C) 2012 Sasha Levin <levinsasha928@gmail.com> */ #ifndef _LINUX_HASHTABLE_H #define _LINUX_HASHTABLE_H #include <linux/list.h> #include <linux/types.h> #include <linux/kernel.h> #include <linux/hash.h> #include <linux/rculist.h> #define DEFINE_HASHTABLE(name, bits) \ struct hlist_head name[1 << (bits)] = \ { [0 ... ((1 << (bits)) - 1)] = HLIST_HEAD_INIT } |
6180d9de6 net: move napi_ha... |
19 20 21 |
#define DEFINE_READ_MOSTLY_HASHTABLE(name, bits) \ struct hlist_head name[1 << (bits)] __read_mostly = \ { [0 ... ((1 << (bits)) - 1)] = HLIST_HEAD_INIT } |
d9b482c8b hashtable: introd... |
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 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 |
#define DECLARE_HASHTABLE(name, bits) \ struct hlist_head name[1 << (bits)] #define HASH_SIZE(name) (ARRAY_SIZE(name)) #define HASH_BITS(name) ilog2(HASH_SIZE(name)) /* Use hash_32 when possible to allow for fast 32bit hashing in 64bit kernels. */ #define hash_min(val, bits) \ (sizeof(val) <= 4 ? hash_32(val, bits) : hash_long(val, bits)) static inline void __hash_init(struct hlist_head *ht, unsigned int sz) { unsigned int i; for (i = 0; i < sz; i++) INIT_HLIST_HEAD(&ht[i]); } /** * hash_init - initialize a hash table * @hashtable: hashtable to be initialized * * Calculates the size of the hashtable from the given parameter, otherwise * same as hash_init_size. * * This has to be a macro since HASH_BITS() will not work on pointers since * it calculates the size during preprocessing. */ #define hash_init(hashtable) __hash_init(hashtable, HASH_SIZE(hashtable)) /** * hash_add - add an object to a hashtable * @hashtable: hashtable to add to * @node: the &struct hlist_node of the object to be added * @key: the key of the object to be added */ #define hash_add(hashtable, node, key) \ hlist_add_head(node, &hashtable[hash_min(key, HASH_BITS(hashtable))]) /** * hash_add_rcu - add an object to a rcu enabled hashtable * @hashtable: hashtable to add to * @node: the &struct hlist_node of the object to be added * @key: the key of the object to be added */ #define hash_add_rcu(hashtable, node, key) \ hlist_add_head_rcu(node, &hashtable[hash_min(key, HASH_BITS(hashtable))]) /** * hash_hashed - check whether an object is in any hashtable * @node: the &struct hlist_node of the object to be checked */ static inline bool hash_hashed(struct hlist_node *node) { return !hlist_unhashed(node); } static inline bool __hash_empty(struct hlist_head *ht, unsigned int sz) { unsigned int i; for (i = 0; i < sz; i++) if (!hlist_empty(&ht[i])) return false; return true; } /** * hash_empty - check whether a hashtable is empty * @hashtable: hashtable to check * * This has to be a macro since HASH_BITS() will not work on pointers since * it calculates the size during preprocessing. */ #define hash_empty(hashtable) __hash_empty(hashtable, HASH_SIZE(hashtable)) /** * hash_del - remove an object from a hashtable * @node: &struct hlist_node of the object to remove */ static inline void hash_del(struct hlist_node *node) { hlist_del_init(node); } /** * hash_del_rcu - remove an object from a rcu enabled hashtable * @node: &struct hlist_node of the object to remove */ static inline void hash_del_rcu(struct hlist_node *node) { hlist_del_init_rcu(node); } /** * hash_for_each - iterate over a hashtable * @name: hashtable to iterate * @bkt: integer to use as bucket loop cursor |
d9b482c8b hashtable: introd... |
121 122 123 |
* @obj: the type * to use as a loop cursor for each entry * @member: the name of the hlist_node within the struct */ |
b67bfe0d4 hlist: drop the n... |
124 125 126 127 |
#define hash_for_each(name, bkt, obj, member) \ for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\ (bkt)++)\ hlist_for_each_entry(obj, &name[bkt], member) |
d9b482c8b hashtable: introd... |
128 129 130 131 132 |
/** * hash_for_each_rcu - iterate over a rcu enabled hashtable * @name: hashtable to iterate * @bkt: integer to use as bucket loop cursor |
d9b482c8b hashtable: introd... |
133 134 135 |
* @obj: the type * to use as a loop cursor for each entry * @member: the name of the hlist_node within the struct */ |
b67bfe0d4 hlist: drop the n... |
136 137 138 139 |
#define hash_for_each_rcu(name, bkt, obj, member) \ for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\ (bkt)++)\ hlist_for_each_entry_rcu(obj, &name[bkt], member) |
d9b482c8b hashtable: introd... |
140 141 142 143 144 145 |
/** * hash_for_each_safe - iterate over a hashtable safe against removal of * hash entry * @name: hashtable to iterate * @bkt: integer to use as bucket loop cursor |
c84716c40 list/hashtable: m... |
146 |
* @tmp: a &struct hlist_node used for temporary storage |
d9b482c8b hashtable: introd... |
147 148 149 |
* @obj: the type * to use as a loop cursor for each entry * @member: the name of the hlist_node within the struct */ |
b67bfe0d4 hlist: drop the n... |
150 151 152 153 |
#define hash_for_each_safe(name, bkt, tmp, obj, member) \ for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\ (bkt)++)\ hlist_for_each_entry_safe(obj, tmp, &name[bkt], member) |
d9b482c8b hashtable: introd... |
154 155 156 157 158 159 |
/** * hash_for_each_possible - iterate over all possible objects hashing to the * same bucket * @name: hashtable to iterate * @obj: the type * to use as a loop cursor for each entry |
d9b482c8b hashtable: introd... |
160 161 162 |
* @member: the name of the hlist_node within the struct * @key: the key of the objects to iterate over */ |
b67bfe0d4 hlist: drop the n... |
163 164 |
#define hash_for_each_possible(name, obj, member, key) \ hlist_for_each_entry(obj, &name[hash_min(key, HASH_BITS(name))], member) |
d9b482c8b hashtable: introd... |
165 166 167 168 |
/** * hash_for_each_possible_rcu - iterate over all possible objects hashing to the * same bucket in an rcu enabled hashtable |
d9b482c8b hashtable: introd... |
169 170 |
* @name: hashtable to iterate * @obj: the type * to use as a loop cursor for each entry |
d9b482c8b hashtable: introd... |
171 172 173 |
* @member: the name of the hlist_node within the struct * @key: the key of the objects to iterate over */ |
a8b7b2d0b sched: sch_api: a... |
174 |
#define hash_for_each_possible_rcu(name, obj, member, key, cond...) \ |
b67bfe0d4 hlist: drop the n... |
175 |
hlist_for_each_entry_rcu(obj, &name[hash_min(key, HASH_BITS(name))],\ |
a8b7b2d0b sched: sch_api: a... |
176 |
member, ## cond) |
d9b482c8b hashtable: introd... |
177 178 |
/** |
81fcfb813 hashtable: add ha... |
179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 |
* hash_for_each_possible_rcu_notrace - iterate over all possible objects hashing * to the same bucket in an rcu enabled hashtable in a rcu enabled hashtable * @name: hashtable to iterate * @obj: the type * to use as a loop cursor for each entry * @member: the name of the hlist_node within the struct * @key: the key of the objects to iterate over * * This is the same as hash_for_each_possible_rcu() except that it does * not do any RCU debugging or tracing. */ #define hash_for_each_possible_rcu_notrace(name, obj, member, key) \ hlist_for_each_entry_rcu_notrace(obj, \ &name[hash_min(key, HASH_BITS(name))], member) /** |
d9b482c8b hashtable: introd... |
194 195 196 197 |
* hash_for_each_possible_safe - iterate over all possible objects hashing to the * same bucket safe against removals * @name: hashtable to iterate * @obj: the type * to use as a loop cursor for each entry |
c84716c40 list/hashtable: m... |
198 |
* @tmp: a &struct hlist_node used for temporary storage |
d9b482c8b hashtable: introd... |
199 200 201 |
* @member: the name of the hlist_node within the struct * @key: the key of the objects to iterate over */ |
b67bfe0d4 hlist: drop the n... |
202 203 |
#define hash_for_each_possible_safe(name, obj, tmp, member, key) \ hlist_for_each_entry_safe(obj, tmp,\ |
d9b482c8b hashtable: introd... |
204 205 206 207 |
&name[hash_min(key, HASH_BITS(name))], member) #endif |