171 #define	QUEUE_TYPEOF(type) type  argument
173 #define	QUEUE_TYPEOF(type) struct type  argument
179 #define	SLIST_HEAD(name, type)						\  argument
184 #define	SLIST_CLASS_HEAD(name, type)					\  argument
192 #define	SLIST_ENTRY(type)						\  argument
197 #define	SLIST_CLASS_ENTRY(type)						\  argument
215 #define SLIST_CONCAT(head1, head2, type, field) do {			\  argument
273 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
302 #define SLIST_SWAP(head1, head2, type) do {				\  argument
311 #define	STAILQ_HEAD(name, type)						\  argument
317 #define	STAILQ_CLASS_HEAD(name, type)					\  argument
326 #define	STAILQ_ENTRY(type)						\  argument
331 #define	STAILQ_CLASS_ENTRY(type)					\  argument
394 #define	STAILQ_LAST(head, type, field)				\  argument
401 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
427 #define STAILQ_SWAP(head1, head2, type) do {				\  argument
443 #define	LIST_HEAD(name, type)						\  argument
448 #define	LIST_CLASS_HEAD(name, type)					\  argument
456 #define	LIST_ENTRY(type)						\  argument
462 #define	LIST_CLASS_ENTRY(type)						\  argument
514 #define LIST_CONCAT(head1, head2, type, field) do {			      \  argument
586 #define	LIST_PREV(elm, head, type, field)			\  argument
604 #define LIST_SWAP(head1, head2, type, field) do {			\  argument
617 #define	TAILQ_HEAD(name, type)						\  argument
624 #define	TAILQ_CLASS_HEAD(name, type)					\  argument
634 #define	TAILQ_ENTRY(type)						\  argument
641 #define	TAILQ_CLASS_ENTRY(type)						\  argument
823 #define	TAILQ_LAST_FAST(head, type, field)			\  argument
831 #define	TAILQ_PREV_FAST(elm, head, type, field)				\  argument
853 #define TAILQ_SWAP(head1, head2, type, field) do {			\  argument