88 #define SLIST_HEAD(name, type)						\  argument
90 	struct type *slh_first;	/* first element */			\
97 #define SLIST_ENTRY(type)						\  argument
99 	struct type *sle_next;	/* next element */			\
140 #define LIST_HEAD(name, type)						\  argument
142 	struct type *lh_first;	/* first element */			\
148 #define LIST_ENTRY(type)						\  argument
150 	struct type *le_next;	/* next element */			\
151 	struct type **le_prev;	/* address of previous next element */	\
214 #define SIMPLEQ_HEAD(name, type)					\  argument
216 	struct type *sqh_first;	/* first element */			\
217 	struct type **sqh_last;	/* addr of last next element */		\
223 #define SIMPLEQ_ENTRY(type)						\  argument
225 	struct type *sqe_next;	/* next element */			\
275 #define TAILQ_HEAD(name, type)						\  argument
277 	struct type *tqh_first;	/* first element */			\
278 	struct type **tqh_last;	/* addr of last next element */		\
284 #define TAILQ_ENTRY(type)						\  argument
286 	struct type *tqe_next;	/* next element */			\
287 	struct type **tqe_prev;	/* address of previous next element */	\
378 #define CIRCLEQ_HEAD(name, type)					\  argument
380 	struct type *cqh_first;		/* first element */		\
381 	struct type *cqh_last;		/* last element */		\
387 #define CIRCLEQ_ENTRY(type)						\  argument
389 	struct type *cqe_next;		/* next element */		\
390 	struct type *cqe_prev;		/* previous element */		\