127 #define	SLIST_FOREACH(var, head, field)					\  argument
128 	for ((var) = SLIST_FIRST((head));				\
129 	    (var);							\
130 	    (var) = SLIST_NEXT((var), field))
189 #define	STAILQ_FOREACH(var, head, field)				\  argument
190 	for((var) = STAILQ_FIRST((head));				\
191 	   (var);							\
192 	   (var) = STAILQ_NEXT((var), field))
271 #define	LIST_FOREACH(var, head, field)					\  argument
272 	for ((var) = LIST_FIRST((head));				\
273 	    (var);							\
274 	    (var) = LIST_NEXT((var), field))
336 #define	TAILQ_FOREACH(var, head, field)					\  argument
337 	for ((var) = TAILQ_FIRST((head));				\
338 	    (var);							\
339 	    (var) = TAILQ_NEXT((var), field))
341 #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
342 	for ((var) = TAILQ_LAST((head), headname);			\
343 	    (var);							\
344 	    (var) = TAILQ_PREV((var), headname, field))
427 #define	CIRCLEQ_FOREACH(var, head, field)				\  argument
428 	for ((var) = CIRCLEQ_FIRST((head));				\
429 	    (var) != (void *)(head);					\
430 	    (var) = CIRCLEQ_NEXT((var), field))
432 #define	CIRCLEQ_FOREACH_REVERSE(var, head, field)			\  argument
433 	for ((var) = CIRCLEQ_LAST((head));				\
434 	    (var) != (void *)(head);					\
435 	    (var) = CIRCLEQ_PREV((var), field))