91 #define	LIST_HEAD_INITIALIZER(head)					\  argument
103 #define	LIST_INIT(head) do {						\  argument
122 #define	LIST_INSERT_HEAD(head, elm, field) do {				\  argument
136 #define	LIST_FOREACH(var, head, field)					\  argument
144 #define	LIST_EMPTY(head)		((head)->lh_first == NULL)  argument
145 #define	LIST_FIRST(head)		((head)->lh_first)  argument
157 #define	SLIST_HEAD_INITIALIZER(head)					\  argument
168 #define	SLIST_INIT(head) do {						\  argument
177 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
182 #define	SLIST_REMOVE_HEAD(head, field) do {				\  argument
186 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
199 #define	SLIST_FOREACH(var, head, field)					\  argument
205 #define	SLIST_EMPTY(head)	((head)->slh_first == NULL)  argument
206 #define	SLIST_FIRST(head)	((head)->slh_first)  argument
219 #define	STAILQ_HEAD_INITIALIZER(head)					\  argument
230 #define	STAILQ_INIT(head) do {						\  argument
235 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
241 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
247 #define	STAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
253 #define	STAILQ_REMOVE_HEAD(head, field) do {				\  argument
258 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
271 #define	STAILQ_FOREACH(var, head, field)				\  argument
279 #define	STAILQ_EMPTY(head)	((head)->stqh_first == NULL)  argument
280 #define	STAILQ_FIRST(head)	((head)->stqh_first)  argument
293 #define	SIMPLEQ_HEAD_INITIALIZER(head)					\  argument
304 #define	SIMPLEQ_INIT(head) do {						\  argument
309 #define	SIMPLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
315 #define	SIMPLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
321 #define	SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
327 #define	SIMPLEQ_REMOVE_HEAD(head, field) do {				\  argument
332 #define	SIMPLEQ_REMOVE(head, elm, type, field) do {			\  argument
345 #define	SIMPLEQ_FOREACH(var, head, field)				\  argument
353 #define	SIMPLEQ_EMPTY(head)		((head)->sqh_first == NULL)  argument
354 #define	SIMPLEQ_FIRST(head)		((head)->sqh_first)  argument
368 #define	TAILQ_HEAD_INITIALIZER(head)					\  argument
381 #define	TAILQ_INIT(head) do {						\  argument
386 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
396 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
403 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
420 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument
429 #define	TAILQ_FOREACH(var, head, field)					\  argument
434 #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
442 #define	TAILQ_EMPTY(head)		((head)->tqh_first == NULL)  argument
443 #define	TAILQ_FIRST(head)		((head)->tqh_first)  argument
446 #define	TAILQ_LAST(head, headname) \  argument
461 #define	CIRCLEQ_HEAD_INITIALIZER(head)					\  argument
473 #define	CIRCLEQ_INIT(head) do {						\  argument
478 #define	CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
488 #define	CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\  argument
498 #define	CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
508 #define	CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
518 #define	CIRCLEQ_REMOVE(head, elm, field) do {				\  argument
531 #define	CIRCLEQ_FOREACH(var, head, field)				\  argument
536 #define	CIRCLEQ_FOREACH_REVERSE(var, head, field)			\  argument
544 #define	CIRCLEQ_EMPTY(head)		((head)->cqh_first == (void *)(head))  argument
545 #define	CIRCLEQ_FIRST(head)		((head)->cqh_first)  argument
546 #define	CIRCLEQ_LAST(head)		((head)->cqh_last)  argument
550 #define CIRCLEQ_LOOP_NEXT(head, elm, field)				\  argument
554 #define CIRCLEQ_LOOP_PREV(head, elm, field)				\  argument