include/sys/queue.h

84 #define	LIST_HEAD(name, type)						\
86 	struct type *lh_first;	/* first element */			\
92 #define	LIST_ENTRY(type)						\
94 	struct type *le_next;	/* next element */			\
95 	struct type **le_prev;	/* address of previous next element */	\
150 #define	SLIST_HEAD(name, type)						\
152 	struct type *slh_first;	/* first element */			\
158 #define	SLIST_ENTRY(type)						\
160 	struct type *sle_next;	/* next element */			\
184 #define	SLIST_REMOVE(head, elm, type, field) do {			\
189 		struct type *curelm = (head)->slh_first;		\
211 #define	STAILQ_HEAD(name, type)					\
213 	struct type *stqh_first;	/* first element */			\
214 	struct type **stqh_last;	/* addr of last next element */		\
220 #define	STAILQ_ENTRY(type)						\
222 	struct type *stqe_next;	/* next element */			\
256 #define	STAILQ_REMOVE(head, elm, type, field) do {			\
260 		struct type *curelm = (head)->stqh_first;		\
293 #define	SIMPLEQ_HEAD(name, type)					\
295 	struct type *sqh_first;	/* first element */			\
296 	struct type **sqh_last;	/* addr of last next element */		\
302 #define	SIMPLEQ_ENTRY(type)						\
304 	struct type *sqe_next;	/* next element */			\
338 #define	SIMPLEQ_REMOVE(head, elm, type, field) do {			\
342 		struct type *curelm = (head)->sqh_first;		\
367 #define	_TAILQ_HEAD(name, type, qual)					\
369 	qual type *tqh_first;		/* first element */		\
370 	qual type *qual *tqh_last;	/* addr of last next element */	\
372 #define TAILQ_HEAD(name, type)	_TAILQ_HEAD(name, struct type,)
377 #define	_TAILQ_ENTRY(type, qual)					\
379 	qual type *tqe_next;		/* next element */		\
380 	qual type *qual *tqe_prev;	/* address of previous next element */\
382 #define TAILQ_ENTRY(type)	_TAILQ_ENTRY(struct type,)
470 #define	CIRCLEQ_HEAD(name, type)					\
472 	struct type *cqh_first;		/* first element */		\
473 	struct type *cqh_last;		/* last element */		\
479 #define	CIRCLEQ_ENTRY(type)						\
481 	struct type *cqe_next;		/* next element */		\
482 	struct type *cqe_prev;		/* previous element */		\