198 #define	SLIST_NEXT(elm, field)	((elm)->field.sle_next)  argument
200 #define	SLIST_FOREACH(var, head, field)					\  argument
205 #define	SLIST_FOREACH_SAFE(var, head, field, tvar)			\  argument
217 #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\  argument
222 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
227 #define	SLIST_REMOVE_AFTER(elm, field) do {				\  argument
231 #define	SLIST_REMOVE_HEAD(head, field) do {				\  argument
235 #define SLIST_REMOVE(head, elm, type, field) do {			\  argument
272 #define	LIST_NEXT(elm, field)		((elm)->field.le_next)  argument
274 #define LIST_FOREACH(var, head, field)					\  argument
279 #define	LIST_FOREACH_SAFE(var, head, field, tvar)			\  argument
291 #define LIST_INSERT_AFTER(listelm, elm, field) do {			\  argument
299 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\  argument
306 #define LIST_INSERT_HEAD(head, elm, field) do {				\  argument
313 #define LIST_REMOVE(elm, field) do {					\  argument
322 #define LIST_REPLACE(elm, elm2, field) do {				\  argument
355 #define	SIMPLEQ_NEXT(elm, field)    ((elm)->field.sqe_next)  argument
357 #define SIMPLEQ_FOREACH(var, head, field)				\  argument
362 #define	SIMPLEQ_FOREACH_SAFE(var, head, field, tvar)			\  argument
375 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
381 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
387 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
393 #define SIMPLEQ_REMOVE_HEAD(head, field) do {			\  argument
398 #define SIMPLEQ_REMOVE_AFTER(head, elm, field) do {			\  argument
427 #define	TAILQ_NEXT(elm, field)		((elm)->field.tqe_next)  argument
431 #define TAILQ_PREV(elm, headname, field)				\  argument
436 #define TAILQ_FOREACH(var, head, field)					\  argument
441 #define	TAILQ_FOREACH_SAFE(var, head, field, tvar)			\  argument
448 #define TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
453 #define	TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)	\  argument
467 #define TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
477 #define TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
484 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
494 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\  argument
501 #define TAILQ_REMOVE(head, elm, field) do {				\  argument
512 #define TAILQ_REPLACE(head, elm, elm2, field) do {			\  argument
548 #define	CIRCLEQ_NEXT(elm, field)	((elm)->field.cqe_next)  argument
549 #define	CIRCLEQ_PREV(elm, field)	((elm)->field.cqe_prev)  argument
553 #define CIRCLEQ_FOREACH(var, head, field)				\  argument
558 #define	CIRCLEQ_FOREACH_SAFE(var, head, field, tvar)			\  argument
564 #define CIRCLEQ_FOREACH_REVERSE(var, head, field)			\  argument
569 #define	CIRCLEQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)	\  argument
583 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
593 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\  argument
603 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
613 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
623 #define	CIRCLEQ_REMOVE(head, elm, field) do {				\  argument
638 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do {			\  argument