136 #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\  argument
141 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
146 #define	SLIST_NEXT(elm, field)	((elm)->field.sle_next)  argument
148 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
199 #define	STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {		\  argument
205 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
211 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
219 #define	STAILQ_NEXT(elm, field)	((elm)->field.stqe_next)  argument
221 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
241 #define	STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {			\  argument
280 #define	LIST_INSERT_AFTER(listelm, elm, field) do {			\  argument
288 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\  argument
295 #define	LIST_INSERT_HEAD(head, elm, field) do {				\  argument
302 #define	LIST_NEXT(elm, field)	((elm)->field.le_next)  argument
304 #define	LIST_REMOVE(elm, field) do {					\  argument
351 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
361 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\  argument
368 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
378 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
388 #define	TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)  argument
390 #define	TAILQ_PREV(elm, headname, field)				\  argument
393 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument
442 #define	CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
452 #define	CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\  argument
462 #define	CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
472 #define	CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
484 #define	CIRCLEQ_NEXT(elm,field)	((elm)->field.cqe_next)  argument
486 #define	CIRCLEQ_PREV(elm,field)	((elm)->field.cqe_prev)  argument
488 #define	CIRCLEQ_REMOVE(head, elm, field) do {				\  argument