205 #define	SLIST_NEXT(elm, field)	((elm)->field.sle_next)  argument
224 #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\  argument
229 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
234 #define	SLIST_REMOVE_AFTER(elm, field) do {				\  argument
242 #define SLIST_REMOVE(head, elm, type, field) do {			\  argument
279 #define	LIST_NEXT(elm, field)		((elm)->field.le_next)  argument
298 #define LIST_INSERT_AFTER(listelm, elm, field) do {			\  argument
306 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\  argument
313 #define LIST_INSERT_HEAD(head, elm, field) do {				\  argument
320 #define LIST_REMOVE(elm, field) do {					\  argument
329 #define LIST_REPLACE(elm, elm2, field) do {				\  argument
362 #define	SIMPLEQ_NEXT(elm, field)    ((elm)->field.sqe_next)  argument
382 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
388 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
394 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
405 #define SIMPLEQ_REMOVE_AFTER(head, elm, field) do {			\  argument
442 #define	XSIMPLEQ_NEXT(head, elm, field)    XSIMPLEQ_XOR(head, ((elm)->field.sqx_next))  argument
464 #define XSIMPLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
471 #define XSIMPLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
477 #define XSIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
490 #define XSIMPLEQ_REMOVE_AFTER(head, elm, field) do {			\  argument
522 #define	TAILQ_NEXT(elm, field)		((elm)->field.tqe_next)  argument
526 #define TAILQ_PREV(elm, headname, field)				\  argument
562 #define TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
572 #define TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
579 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
589 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\  argument
596 #define TAILQ_REMOVE(head, elm, field) do {				\  argument
607 #define TAILQ_REPLACE(head, elm, elm2, field) do {			\  argument