125 #define	SLIST_NEXT(elm, field)	((elm)->field.sle_next)  argument
145 #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\  argument
150 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
164 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
201 #define	LIST_NEXT(elm, field)		((elm)->field.le_next)  argument
226 #define	QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field)			\  argument
231 #define	QUEUEDEBUG_LIST_OP(elm, field)					\  argument
240 #define	QUEUEDEBUG_LIST_POSTREMOVE(elm, field)				\  argument
244 #define	QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field)  argument
245 #define	QUEUEDEBUG_LIST_OP(elm, field)  argument
246 #define	QUEUEDEBUG_LIST_POSTREMOVE(elm, field)  argument
253 #define	LIST_INSERT_AFTER(listelm, elm, field) do {			\  argument
263 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\  argument
271 #define	LIST_INSERT_HEAD(head, elm, field) do {				\  argument
279 #define	LIST_REMOVE(elm, field) do {					\  argument
288 #define LIST_REPLACE(elm, elm2, field) do {				\  argument
320 #define	SIMPLEQ_NEXT(elm, field)	((elm)->field.sqe_next)  argument
341 #define	SIMPLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
347 #define	SIMPLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
353 #define	SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
364 #define SIMPLEQ_REMOVE_AFTER(head, elm, field) do {			\  argument
370 #define	SIMPLEQ_REMOVE(head, elm, type, field) do {			\  argument
422 #define	TAILQ_NEXT(elm, field)		((elm)->field.tqe_next)  argument
425 #define	TAILQ_PREV(elm, headname, field) \  argument
454 #define	QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field)			\  argument
459 #define	QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field)			\  argument
463 #define	QUEUEDEBUG_TAILQ_OP(elm, field)					\  argument
472 #define	QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field)			\  argument
477 #define	QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field)				\  argument
481 #define	QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field)  argument
482 #define	QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field)  argument
483 #define	QUEUEDEBUG_TAILQ_OP(elm, field)  argument
484 #define	QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field)  argument
485 #define	QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field)  argument
493 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
504 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
512 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
524 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\  argument
532 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument
544 #define TAILQ_REPLACE(head, elm, elm2, field) do {			\  argument
587 #define	STAILQ_NEXT(elm, field)	((elm)->field.stqe_next)  argument
598 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
604 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
610 #define	STAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
621 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
699 #define QUEUEDEBUG_CIRCLEQ_ELM(head, elm, field)			\  argument
718 #define QUEUEDEBUG_CIRCLEQ_POSTREMOVE(elm, field)			\  argument
723 #define QUEUEDEBUG_CIRCLEQ_ELM(head, elm, field)  argument
724 #define QUEUEDEBUG_CIRCLEQ_POSTREMOVE(elm, field)  argument
750 #define	CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
762 #define	CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\  argument
774 #define	CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
785 #define	CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
796 #define	CIRCLEQ_REMOVE(head, elm, field) do {				\  argument
831 #define	CIRCLEQ_NEXT(elm, field)	((elm)->field.cqe_next)  argument
832 #define	CIRCLEQ_PREV(elm, field)	((elm)->field.cqe_prev)  argument
836 #define CIRCLEQ_LOOP_NEXT(head, elm, field)				\  argument
840 #define CIRCLEQ_LOOP_PREV(head, elm, field)				\  argument