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;		\
156 	(head)->stqh_first = (elm);					\
161 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
162 	(elm)->field.stqe_next = NULL;					\
163 	*(head)->stqh_last = (elm);					\
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);				\
184 #define	STAILQ_NEXT(elm, field)	((elm)->field.stqe_next)  argument
188 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
189 	if ((head)->stqh_first == (elm)) {				\
193 		while (curelm->field.stqe_next != (elm))		\