169 #define	list_for_each(p, head)						\  argument
170 	for (p = (head)->next; p != (head); p = (p)->next)
172 #define	list_for_each_safe(p, n, head)					\  argument
173 	for (p = (head)->next, n = (p)->next; p != (head); p = n, n = (p)->next)
175 #define list_for_each_entry(p, h, field)				\  argument
176 	for (p = list_entry((h)->next, typeof(*p), field); &(p)->field != (h); \
177 	    p = list_entry((p)->field.next, typeof(*p), field))
179 #define list_for_each_entry_safe(p, n, h, field)			\  argument
180 	for (p = list_entry((h)->next, typeof(*p), field),		\
181 	    n = list_entry((p)->field.next, typeof(*p), field); &(p)->field != (h);\
182 	    p = n, n = list_entry(n->field.next, typeof(*n), field))
184 #define	list_for_each_entry_from(p, h, field) \  argument
185 	for ( ; &(p)->field != (h); \
186 	    p = list_entry((p)->field.next, typeof(*p), field))
188 #define	list_for_each_entry_continue(p, h, field)			\  argument
189 	for (p = list_next_entry((p), field); &(p)->field != (h);	\
190 	    p = list_next_entry((p), field))
197 #define	list_for_each_entry_reverse(p, h, field)			\  argument
198 	for (p = list_entry((h)->prev, typeof(*p), field); &(p)->field != (h); \
199 	    p = list_entry((p)->field.prev, typeof(*p), field))
201 #define	list_for_each_entry_safe_reverse(p, n, h, field)		\  argument
202 	for (p = list_entry((h)->prev, typeof(*p), field),		\
203 	    n = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
204 	    p = n, n = list_entry(n->field.prev, typeof(*n), field))
206 #define	list_for_each_entry_continue_reverse(p, h, field) \  argument
207 	for (p = list_entry((p)->field.prev, typeof(*p), field); &(p)->field != (h); \
208 	    p = list_entry((p)->field.prev, typeof(*p), field))
210 #define	list_for_each_prev(p, h) for (p = (h)->prev; p != (h); p = (p)->prev)  argument
424 #define	hlist_for_each(p, head)						\  argument
425 	for (p = (head)->first; p; p = (p)->next)
427 #define	hlist_for_each_safe(p, n, head)					\  argument
428 	for (p = (head)->first; p && ({ n = (p)->next; 1; }); p = n)