41 #define	TAILQ_END(head)			(NULL)  argument
52 #define	TAILQ_HEAD_INITIALIZER(head)					\  argument
53 	{ TAILQ_END(head), &(head).tqh_first }
67 #define	TAILQ_FIRST(head)		((head)->tqh_first)  argument
69 #define	TAILQ_LAST(head, headname) \  argument
70 	(*(((struct headname *)((head)->tqh_last))->tqh_last))
73 #define	TAILQ_EMPTY(head)		(TAILQ_FIRST(head) == TAILQ_END(head))  argument
77 #define	TAILQ_FOREACH(var, head, field)					\  argument
78 	for ((var) = ((head)->tqh_first);				\
79 	    (var) != TAILQ_END(head);					\
82 #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
83 	for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last));\
84 	    (var) != TAILQ_END(head);					\
89 #define	TAILQ_INIT(head) do {						\  argument
90 	(head)->tqh_first = TAILQ_END(head);				\
91 	(head)->tqh_last = &(head)->tqh_first;				\
94 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
95 	if (((elm)->field.tqe_next = (head)->tqh_first) != TAILQ_END(head))\
96 		(head)->tqh_first->field.tqe_prev =			\
99 		(head)->tqh_last = &(elm)->field.tqe_next;		\
100 	(head)->tqh_first = (elm);					\
101 	(elm)->field.tqe_prev = &(head)->tqh_first;			\
104 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
105 	(elm)->field.tqe_next = TAILQ_END(head);			\
106 	(elm)->field.tqe_prev = (head)->tqh_last;			\
107 	*(head)->tqh_last = (elm);					\
108 	(head)->tqh_last = &(elm)->field.tqe_next;			\
111 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
113 	    TAILQ_END(head))						\
117 		(head)->tqh_last = &(elm)->field.tqe_next;		\
129 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument
130 	if (((elm)->field.tqe_next) != TAILQ_END(head))			\
134 		(head)->tqh_last = (elm)->field.tqe_prev;		\
140 #define TAILQ_REPLACE(head, elm, elm2, field) do {                      \  argument
142 	    TAILQ_END(head))						\
146                 (head)->tqh_last = &(elm2)->field.tqe_next;             \
153 #define	TAILQ_FOREACH_SAFE(var, head, field, next)			\  argument
154 	for ((var) = TAILQ_FIRST(head);					\
155 	    (var) != TAILQ_END(head) &&					\
158 #define	TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, prev)	\  argument
159 	for ((var) = TAILQ_LAST((head), headname);			\
160 	    (var) != TAILQ_END(head) &&					\