136 #define	LIST_FOREACH(var, head, field)					\  argument
137 	for ((var) = ((head)->lh_first);				\
138 		(var);							\
139 		(var) = ((var)->field.le_next))
199 #define	SLIST_FOREACH(var, head, field)					\  argument
200 	for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
271 #define	STAILQ_FOREACH(var, head, field)				\  argument
272 	for ((var) = ((head)->stqh_first);				\
273 		(var);							\
274 		(var) = ((var)->field.stqe_next))
345 #define	SIMPLEQ_FOREACH(var, head, field)				\  argument
346 	for ((var) = ((head)->sqh_first);				\
347 		(var);							\
348 		(var) = ((var)->field.sqe_next))
429 #define	TAILQ_FOREACH(var, head, field)					\  argument
430 	for ((var) = ((head)->tqh_first);				\
431 		(var);							\
432 		(var) = ((var)->field.tqe_next))
434 #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
435 	for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last));	\
436 		(var);							\
437 		(var) = (*(((struct headname *)((var)->field.tqe_prev))->tqh_last)))
531 #define	CIRCLEQ_FOREACH(var, head, field)				\  argument
532 	for ((var) = ((head)->cqh_first);				\
533 		(var) != (const void *)(head);				\
534 		(var) = ((var)->field.cqe_next))
536 #define	CIRCLEQ_FOREACH_REVERSE(var, head, field)			\  argument
537 	for ((var) = ((head)->cqh_last);				\
538 		(var) != (const void *)(head);				\
539 		(var) = ((var)->field.cqe_prev))