94 #define SLIST_HEAD(name, type)						\  argument
96 	struct type *slh_first;	/* first element */			\
102 #define SLIST_ENTRY(type)						\  argument
104 	struct type *sle_next;	/* next element */			\
150 #define SLIST_REMOVE(head, elm, type, field) do {			\  argument
154 		struct type *curelm = (head)->slh_first;		\
167 #define LIST_HEAD(name, type)						\  argument
169 	struct type *lh_first;	/* first element */			\
175 #define LIST_ENTRY(type)						\  argument
177 	struct type *le_next;	/* next element */			\
178 	struct type **le_prev;	/* address of previous next element */	\
245 #define SIMPLEQ_HEAD(name, type)					\  argument
247 	struct type *sqh_first;	/* first element */			\
248 	struct type **sqh_last;	/* addr of last next element */		\
254 #define SIMPLEQ_ENTRY(type)						\  argument
256 	struct type *sqe_next;	/* next element */			\
306 #define TAILQ_HEAD(name, type)						\  argument
308 	struct type *tqh_first;	/* first element */			\
309 	struct type **tqh_last;	/* addr of last next element */		\
315 #define TAILQ_ENTRY(type)						\  argument
317 	struct type *tqe_next;	/* next element */			\
318 	struct type **tqe_prev;	/* address of previous next element */	\
413 #define CIRCLEQ_HEAD(name, type)					\  argument
415 	struct type *cqh_first;		/* first element */		\
416 	struct type *cqh_last;		/* last element */		\
422 #define CIRCLEQ_ENTRY(type)						\  argument
424 	struct type *cqe_next;		/* next element */		\
425 	struct type *cqe_prev;		/* previous element */		\