236 #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\  argument
237 	SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field);	\
238 	SLIST_NEXT((slistelm), field) = (elm);				\
241 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
242 	SLIST_NEXT((elm), field) = SLIST_FIRST((head));			\
243 	SLIST_FIRST((head)) = (elm);					\
246 #define	SLIST_NEXT(elm, field)	((elm)->field.sle_next)  argument
248 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
249 	QMD_SAVELINK(oldnext, (elm)->field.sle_next);			\
250 	if (SLIST_FIRST((head)) == (elm)) {				\
255 		while (SLIST_NEXT(curelm, field) != (elm))		\
262 #define SLIST_REMOVE_AFTER(elm, field) do {				\  argument
263 	SLIST_NEXT(elm, field) =					\
264 	    SLIST_NEXT(SLIST_NEXT(elm, field), field);			\
345 #define	STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {		\  argument
346 	if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
347 		(head)->stqh_last = &STAILQ_NEXT((elm), field);		\
348 	STAILQ_NEXT((tqelm), field) = (elm);				\
351 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
352 	if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL)	\
353 		(head)->stqh_last = &STAILQ_NEXT((elm), field);		\
354 	STAILQ_FIRST((head)) = (elm);					\
357 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
358 	STAILQ_NEXT((elm), field) = NULL;				\
359 	*(head)->stqh_last = (elm);					\
360 	(head)->stqh_last = &STAILQ_NEXT((elm), field);			\
368 #define	STAILQ_NEXT(elm, field)	((elm)->field.stqe_next)  argument
370 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
371 	QMD_SAVELINK(oldnext, (elm)->field.stqe_next);			\
372 	if (STAILQ_FIRST((head)) == (elm)) {				\
377 		while (STAILQ_NEXT(curelm, field) != (elm))		\
384 #define STAILQ_REMOVE_AFTER(head, elm, field) do {			\  argument
385 	if ((STAILQ_NEXT(elm, field) =					\
386 	     STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL)	\
387 		(head)->stqh_last = &STAILQ_NEXT((elm), field);		\
450 #define	QMD_LIST_CHECK_NEXT(elm, field) do {				\  argument
451 	if (LIST_NEXT((elm), field) != NULL &&				\
452 	    LIST_NEXT((elm), field)->field.le_prev !=			\
453 	     &((elm)->field.le_next))					\
454 	     	panic("Bad link elm %p next->prev != elm", (elm));	\
457 #define	QMD_LIST_CHECK_PREV(elm, field) do {				\  argument
458 	if (*(elm)->field.le_prev != (elm))				\
459 		panic("Bad link elm %p prev->next != elm", (elm));	\
463 #define	QMD_LIST_CHECK_NEXT(elm, field)  argument
464 #define	QMD_LIST_CHECK_PREV(elm, field)  argument
512 #define	LIST_INSERT_AFTER(listelm, elm, field) do {			\  argument
514 	if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
516 		    &LIST_NEXT((elm), field);				\
517 	LIST_NEXT((listelm), field) = (elm);				\
518 	(elm)->field.le_prev = &LIST_NEXT((listelm), field);		\
521 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\  argument
523 	(elm)->field.le_prev = (listelm)->field.le_prev;		\
524 	LIST_NEXT((elm), field) = (listelm);				\
525 	*(listelm)->field.le_prev = (elm);				\
526 	(listelm)->field.le_prev = &LIST_NEXT((elm), field);		\
529 #define	LIST_INSERT_HEAD(head, elm, field) do {				\  argument
531 	if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL)	\
532 		LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
533 	LIST_FIRST((head)) = (elm);					\
534 	(elm)->field.le_prev = &LIST_FIRST((head));			\
537 #define	LIST_NEXT(elm, field)	((elm)->field.le_next)  argument
539 #define	LIST_PREV(elm, head, type, field)			\  argument
540 	((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL :	\
541 	    __containerof((elm)->field.le_prev,			\
544 #define	LIST_REMOVE(elm, field) do {					\  argument
545 	QMD_SAVELINK(oldnext, (elm)->field.le_next);			\
546 	QMD_SAVELINK(oldprev, (elm)->field.le_prev);			\
547 	QMD_LIST_CHECK_NEXT(elm, field);				\
548 	QMD_LIST_CHECK_PREV(elm, field);				\
549 	if (LIST_NEXT((elm), field) != NULL)				\
550 		LIST_NEXT((elm), field)->field.le_prev = 		\
551 		    (elm)->field.le_prev;				\
552 	*(elm)->field.le_prev = LIST_NEXT((elm), field);		\
617 #define	QMD_TAILQ_CHECK_NEXT(elm, field) do {				\  argument
618 	if (TAILQ_NEXT((elm), field) != NULL &&				\
619 	    TAILQ_NEXT((elm), field)->field.tqe_prev !=			\
620 	     &((elm)->field.tqe_next))					\
621 		panic("Bad link elm %p next->prev != elm", (elm));	\
624 #define	QMD_TAILQ_CHECK_PREV(elm, field) do {				\  argument
625 	if (*(elm)->field.tqe_prev != (elm))				\
626 		panic("Bad link elm %p prev->next != elm", (elm));	\
631 #define	QMD_TAILQ_CHECK_NEXT(elm, field)  argument
632 #define	QMD_TAILQ_CHECK_PREV(elm, field)  argument
696 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
698 	if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
699 		TAILQ_NEXT((elm), field)->field.tqe_prev = 		\
700 		    &TAILQ_NEXT((elm), field);				\
702 		(head)->tqh_last = &TAILQ_NEXT((elm), field);		\
705 	TAILQ_NEXT((listelm), field) = (elm);				\
706 	(elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field);		\
707 	QMD_TRACE_ELEM(&(elm)->field);					\
711 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\  argument
713 	(elm)->field.tqe_prev = (listelm)->field.tqe_prev;		\
714 	TAILQ_NEXT((elm), field) = (listelm);				\
715 	*(listelm)->field.tqe_prev = (elm);				\
716 	(listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field);		\
717 	QMD_TRACE_ELEM(&(elm)->field);					\
721 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
723 	if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL)	\
725 		    &TAILQ_NEXT((elm), field);				\
727 		(head)->tqh_last = &TAILQ_NEXT((elm), field);		\
728 	TAILQ_FIRST((head)) = (elm);					\
729 	(elm)->field.tqe_prev = &TAILQ_FIRST((head));			\
731 	QMD_TRACE_ELEM(&(elm)->field);					\
734 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
736 	TAILQ_NEXT((elm), field) = NULL;				\
737 	(elm)->field.tqe_prev = (head)->tqh_last;			\
738 	*(head)->tqh_last = (elm);					\
739 	(head)->tqh_last = &TAILQ_NEXT((elm), field);			\
741 	QMD_TRACE_ELEM(&(elm)->field);					\
747 #define	TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)  argument
749 #define	TAILQ_PREV(elm, headname, field)				\  argument
750 	(*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
752 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument
753 	QMD_SAVELINK(oldnext, (elm)->field.tqe_next);			\
754 	QMD_SAVELINK(oldprev, (elm)->field.tqe_prev);			\
755 	QMD_TAILQ_CHECK_NEXT(elm, field);				\
756 	QMD_TAILQ_CHECK_PREV(elm, field);				\
757 	if ((TAILQ_NEXT((elm), field)) != NULL)				\
758 		TAILQ_NEXT((elm), field)->field.tqe_prev = 		\
759 		    (elm)->field.tqe_prev;				\
761 		(head)->tqh_last = (elm)->field.tqe_prev;		\
764 	*(elm)->field.tqe_prev = TAILQ_NEXT((elm), field);		\
767 	QMD_TRACE_ELEM(&(elm)->field);					\