15 #define DEFINE_HASHTABLE(name, bits)						\  argument
16 	struct hlist_head name[1 << (bits)] =					\
19 #define DEFINE_READ_MOSTLY_HASHTABLE(name, bits)				\  argument
20 	struct hlist_head name[1 << (bits)] __read_mostly =			\
23 #define DECLARE_HASHTABLE(name, bits)                                   	\  argument
24 	struct hlist_head name[1 << (bits)]
26 #define HASH_SIZE(name) (ARRAY_SIZE(name))  argument
27 #define HASH_BITS(name) ilog2(HASH_SIZE(name))  argument
125 #define hash_for_each(name, bkt, obj, member)				\  argument
126 	for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
128 		hlist_for_each_entry(obj, &name[bkt], member)
137 #define hash_for_each_rcu(name, bkt, obj, member)			\  argument
138 	for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
140 		hlist_for_each_entry_rcu(obj, &name[bkt], member)
151 #define hash_for_each_safe(name, bkt, tmp, obj, member)			\  argument
152 	for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
154 		hlist_for_each_entry_safe(obj, tmp, &name[bkt], member)
164 #define hash_for_each_possible(name, obj, member, key)			\  argument
165 	hlist_for_each_entry(obj, &name[hash_min(key, HASH_BITS(name))], member)
176 #define hash_for_each_possible_rcu(name, obj, member, key)		\  argument
177 	hlist_for_each_entry_rcu(obj, &name[hash_min(key, HASH_BITS(name))],\
191 #define hash_for_each_possible_rcu_notrace(name, obj, member, key) \  argument
193 		&name[hash_min(key, HASH_BITS(name))], member)
204 #define hash_for_each_possible_safe(name, obj, tmp, member, key)	\  argument
206 		&name[hash_min(key, HASH_BITS(name))], member)