113 #define	SLIST_NEXT(elm, field)	((elm)->field.sle_next)  argument
115 #define	SLIST_FOREACH(var, head, field)					\  argument
120 #define	SLIST_FOREACH_PREVPTR(var, varp, head, field)			\  argument
132 #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\  argument
137 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
142 #define	SLIST_REMOVE_NEXT(head, elm, field) do {			\  argument
146 #define	SLIST_REMOVE_HEAD(head, field) do {				\  argument
150 #define SLIST_REMOVE(head, elm, type, field) do {			\  argument
187 #define	LIST_NEXT(elm, field)		((elm)->field.le_next)  argument
189 #define LIST_FOREACH(var, head, field)					\  argument
201 #define LIST_INSERT_AFTER(listelm, elm, field) do {			\  argument
209 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\  argument
216 #define LIST_INSERT_HEAD(head, elm, field) do {				\  argument
223 #define LIST_REMOVE(elm, field) do {					\  argument
232 #define LIST_REPLACE(elm, elm2, field) do {				\  argument
265 #define	SIMPLEQ_NEXT(elm, field)    ((elm)->field.sqe_next)  argument
267 #define SIMPLEQ_FOREACH(var, head, field)				\  argument
280 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
286 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
292 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
298 #define SIMPLEQ_REMOVE_HEAD(head, field) do {			\  argument
326 #define	TAILQ_NEXT(elm, field)		((elm)->field.tqe_next)  argument
330 #define TAILQ_PREV(elm, headname, field)				\  argument
335 #define TAILQ_FOREACH(var, head, field)					\  argument
340 #define TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
353 #define TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
363 #define TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
370 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
380 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\  argument
387 #define TAILQ_REMOVE(head, elm, field) do {				\  argument
398 #define TAILQ_REPLACE(head, elm, elm2, field) do {			\  argument
434 #define	CIRCLEQ_NEXT(elm, field)	((elm)->field.cqe_next)  argument
435 #define	CIRCLEQ_PREV(elm, field)	((elm)->field.cqe_prev)  argument
439 #define CIRCLEQ_FOREACH(var, head, field)				\  argument
444 #define CIRCLEQ_FOREACH_REVERSE(var, head, field)			\  argument
457 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
467 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\  argument
477 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
487 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
497 #define	CIRCLEQ_REMOVE(head, elm, field) do {				\  argument
512 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do {			\  argument