80 #define	LIST_FOREACH_SAFE(var, head, field, tvar)		\  argument
82 	    (var) && ((tvar) = LIST_NEXT((var), field), 1);	\
87 #define	SLIST_FOREACH_SAFE(var, head, field, tvar)		\  argument
89 	    (var) && ((tvar) = SLIST_NEXT((var), field), 1);	\
132 #define	STAILQ_FOREACH(var, head, field)			\  argument
135 		(var) = ((var)->field.stqe_next))
139 #define STAILQ_FOREACH_SAFE(var, head, field, tvar)		\  argument
141 	    (var) && ((tvar) = STAILQ_NEXT((var), field), 1);	\
153 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
154 	if (((elm)->field.stqe_next = (head)->stqh_first) == NULL)	\
155 		(head)->stqh_last = &(elm)->field.stqe_next;		\
161 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
162 	(elm)->field.stqe_next = NULL;					\
164 	(head)->stqh_last = &(elm)->field.stqe_next;			\
169 #define	STAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
170 	if (((elm)->field.stqe_next = (listelm)->field.stqe_next) == NULL)\
171 		(head)->stqh_last = &(elm)->field.stqe_next;		\
172 	(listelm)->field.stqe_next = (elm);				\
177 #define STAILQ_LAST(head, type, field)					\  argument
180 	    ((char *)((head)->stqh_last) - offsetof(struct type, field))))
184 #define	STAILQ_NEXT(elm, field)	((elm)->field.stqe_next)  argument
188 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
190 		STAILQ_REMOVE_HEAD((head), field);			\
193 		while (curelm->field.stqe_next != (elm))		\
194 			curelm = curelm->field.stqe_next;		\
195 		if ((curelm->field.stqe_next =				\
196 			curelm->field.stqe_next->field.stqe_next) == NULL) \
197 			    (head)->stqh_last = &(curelm)->field.stqe_next; \
203 #define	STAILQ_REMOVE_HEAD(head, field) do {				\  argument
204 	if (((head)->stqh_first = (head)->stqh_first->field.stqe_next) == \
215 #define	STAILQ_SORT(head, type, field, cmp) do {			\  argument
234 				STAILQ_REMOVE_HEAD((head), field);	\
235 				STAILQ_INSERT_TAIL(&_la, _e, field);	\
243 					_q = STAILQ_NEXT(_q, field);	\
245 					    field);			\
249 					_p = STAILQ_NEXT(_p, field);	\
250 					STAILQ_REMOVE_HEAD(&_la, field);\
254 					_p = STAILQ_NEXT(_p, field);	\
255 					STAILQ_REMOVE_HEAD(&_la, field);\
259 					_q = STAILQ_NEXT(_q, field);	\
261 					    field);			\
264 				STAILQ_INSERT_TAIL(&_lb, _e, field);	\
275 #define TAILQ_FOREACH_SAFE(var, head, field, tvar)                      \  argument
277 	    (var) && ((tvar) = TAILQ_NEXT((var), field), 1);            \