136 #define	__hash_next(obj, type, member) ({ \  argument
138 	    CK_LIST_NEXT((struct lkpi_hash_entry *)&(obj)->member, entry); \
139 	__hash_node_type_assert(&(obj)->member); \
146 #define	hash_for_each_rcu(name, bkt, obj, member) \  argument
147 	for ((bkt) = 0, (obj) = NULL; (obj) == NULL && \
149 		for ((obj) = __hash_first(&(name)[bkt], \
150 			__typeof(*(obj)), member); \
151 		     (obj) != NULL; \
152 		     (obj) = __hash_next(obj, \
153 			__typeof(*(obj)), member))
155 #define	hash_for_each_safe(name, bkt, tmp, obj, member) \  argument
156 	for ((bkt) = 0, (obj) = NULL; (obj) == NULL && \
158 		for ((obj) = __hash_first(&(name)[bkt], \
159 			__typeof(*(obj)), member); \
160 		     (obj) != NULL && ((tmp) = &__hash_next(obj, \
161 			__typeof(*(obj)), member)->member, 1); \
162 		     (obj) = container_of(tmp, __typeof(*(obj)), member))
170 #define	hash_for_each_possible_rcu(name, obj, member, key) \  argument
171 	for ((obj) = __hash_first(&(name)[hash_min(key, HASH_BITS(name))], \
172 		__typeof(*(obj)), member); \
173 	     (obj) != NULL; \
174 	     (obj) = __hash_next(obj, __typeof(*(obj)), member))
176 #define	hash_for_each_possible_safe(name, obj, tmp, member, key) \  argument
177 	for ((obj) = __hash_first(&(name)[hash_min(key, HASH_BITS(name))], \
178 		__typeof(*(obj)), member); \
179 	     (obj) != NULL && ((tmp) = &__hash_next(obj, \
180 		__typeof(*(obj)), member)->member, 1); \
181 	     (obj) = container_of(tmp, __typeof(*(obj)), member))