126 #define hash_for_each(name, bkt, obj, member)				\  argument
127 	for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
129 		hlist_for_each_entry(obj, &name[bkt], member)
138 #define hash_for_each_rcu(name, bkt, obj, member)			\  argument
139 	for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
141 		hlist_for_each_entry_rcu(obj, &name[bkt], member)
152 #define hash_for_each_safe(name, bkt, tmp, obj, member)			\  argument
153 	for ((bkt) = 0, obj = NULL; obj == NULL && (bkt) < HASH_SIZE(name);\
155 		hlist_for_each_entry_safe(obj, tmp, &name[bkt], member)
165 #define hash_for_each_possible(name, obj, member, key)			\  argument
166 	hlist_for_each_entry(obj, &name[hash_min(key, HASH_BITS(name))], member)
176 #define hash_for_each_possible_rcu(name, obj, member, key, cond...)	\  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
192 	hlist_for_each_entry_rcu_notrace(obj, \
204 #define hash_for_each_possible_safe(name, obj, tmp, member, key)	\  argument
205 	hlist_for_each_entry_safe(obj, tmp,\