177 #define	LIST_FOREACH(var, head, field)					\  argument
178 	for ((var) = ((head)->lh_first);				\
179 		(var);							\
180 		(var) = ((var)->field.le_next))
245 #define	SLIST_FOREACH(var, head, field)					\  argument
246 	for ((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
325 #define	STAILQ_FOREACH(var, head, field)				\  argument
326 	for ((var) = ((head)->stqh_first);				\
327 		(var);							\
328 		(var) = ((var)->field.stqe_next))
405 #define	SIMPLEQ_FOREACH(var, head, field)				\  argument
406 	for ((var) = ((head)->sqh_first);				\
407 		(var);							\
408 		(var) = ((var)->field.sqe_next))
537 #define	TAILQ_FOREACH(var, head, field)					\  argument
538 	for ((var) = ((head)->tqh_first);				\
539 		(var);							\
540 		(var) = ((var)->field.tqe_next))
542 #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
543 	for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last));\
544 		(var);							\
545 		(var) = 						\
546 		    (*(((struct headname *)((var)->field.tqe_prev))->tqh_last)))
646 #define	CIRCLEQ_FOREACH(var, head, field)				\  argument
647 	for ((var) = ((head)->cqh_first);				\
648 		(var) != (void *)(head);				\
649 		(var) = ((var)->field.cqe_next))
651 #define	CIRCLEQ_FOREACH_REVERSE(var, head, field)			\  argument
652 	for ((var) = ((head)->cqh_last);				\
653 		(var) != (void *)(head);				\
654 		(var) = ((var)->field.cqe_prev))