138 #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\  argument
139 	SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field);	\
140 	SLIST_NEXT((slistelm), field) = (elm);				\
143 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
144 	SLIST_NEXT((elm), field) = SLIST_FIRST((head));			\
145 	SLIST_FIRST((head)) = (elm);					\
148 #define	SLIST_NEXT(elm, field)	((elm)->field.sle_next)  argument
150 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
151 	if (SLIST_FIRST((head)) == (elm)) {				\
156 		while (SLIST_NEXT(curelm, field) != (elm))		\
201 #define	STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {		\  argument
202 	if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
203 		(head)->stqh_last = &STAILQ_NEXT((elm), field);		\
204 	STAILQ_NEXT((tqelm), field) = (elm);				\
207 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
208 	if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL)	\
209 		(head)->stqh_last = &STAILQ_NEXT((elm), field);		\
210 	STAILQ_FIRST((head)) = (elm);					\
213 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
214 	STAILQ_NEXT((elm), field) = NULL;				\
215 	*(head)->stqh_last = (elm);					\
216 	(head)->stqh_last = &STAILQ_NEXT((elm), field);			\
225 #define	STAILQ_NEXT(elm, field)	((elm)->field.stqe_next)  argument
227 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
228 	if (STAILQ_FIRST((head)) == (elm)) {				\
233 		while (STAILQ_NEXT(curelm, field) != (elm))		\
247 #define	STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {			\  argument
248 	if ((STAILQ_FIRST((head)) = STAILQ_NEXT((elm), field)) == NULL)	\
286 #define	LIST_INSERT_AFTER(listelm, elm, field) do {			\  argument
287 	if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
289 		    &LIST_NEXT((elm), field);				\
290 	LIST_NEXT((listelm), field) = (elm);				\
291 	(elm)->field.le_prev = &LIST_NEXT((listelm), field);		\
294 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\  argument
295 	(elm)->field.le_prev = (listelm)->field.le_prev;		\
296 	LIST_NEXT((elm), field) = (listelm);				\
297 	*(listelm)->field.le_prev = (elm);				\
298 	(listelm)->field.le_prev = &LIST_NEXT((elm), field);		\
301 #define	LIST_INSERT_HEAD(head, elm, field) do {				\  argument
302 	if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL)	\
303 		LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
304 	LIST_FIRST((head)) = (elm);					\
305 	(elm)->field.le_prev = &LIST_FIRST((head));			\
308 #define	LIST_NEXT(elm, field)	((elm)->field.le_next)  argument
310 #define	LIST_REMOVE(elm, field) do {					\  argument
311 	if (LIST_NEXT((elm), field) != NULL)				\
312 		LIST_NEXT((elm), field)->field.le_prev = 		\
313 		    (elm)->field.le_prev;				\
314 	*(elm)->field.le_prev = LIST_NEXT((elm), field);		\
357 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
358 	if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
359 		TAILQ_NEXT((elm), field)->field.tqe_prev = 		\
360 		    &TAILQ_NEXT((elm), field);				\
362 		(head)->tqh_last = &TAILQ_NEXT((elm), field);		\
363 	TAILQ_NEXT((listelm), field) = (elm);				\
364 	(elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field);		\
367 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\  argument
368 	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
369 	TAILQ_NEXT((elm), field) = (listelm);				\
370 	*(listelm)->field.tqe_prev = (elm);				\
371 	(listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field);		\
374 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
375 	if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL)	\
377 		    &TAILQ_NEXT((elm), field);				\
379 		(head)->tqh_last = &TAILQ_NEXT((elm), field);		\
380 	TAILQ_FIRST((head)) = (elm);					\
381 	(elm)->field.tqe_prev = &TAILQ_FIRST((head));			\
384 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
385 	TAILQ_NEXT((elm), field) = NULL;				\
386 	(elm)->field.tqe_prev = (head)->tqh_last;			\
387 	*(head)->tqh_last = (elm);					\
388 	(head)->tqh_last = &TAILQ_NEXT((elm), field);			\
394 #define	TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)  argument
396 #define	TAILQ_PREV(elm, headname, field)				\  argument
397 	(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
399 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument
400 	if ((TAILQ_NEXT((elm), field)) != NULL)				\
401 		TAILQ_NEXT((elm), field)->field.tqe_prev = 		\
402 		    (elm)->field.tqe_prev;				\
404 		(head)->tqh_last = (elm)->field.tqe_prev;		\
405 	*(elm)->field.tqe_prev = TAILQ_NEXT((elm), field);		\