119 #define	SLIST_HEAD_INITIALIZER(head)                    \  argument
130 #define SLIST_EMPTY(head)   ((head)->slh_first == NULL)  argument
132 #define SLIST_FIRST(head)   ((head)->slh_first)  argument
134 #define SLIST_FOREACH(var, head, field)                 \  argument
139 #define SLIST_INIT(head) do {                           \  argument
148 #define SLIST_INSERT_HEAD(head, elm, field) do {            \  argument
155 #define SLIST_REMOVE(head, elm, type, field) do {           \  argument
168 #define SLIST_REMOVE_HEAD(head, field) do {                         \  argument
181 #define	STAILQ_HEAD_INITIALIZER(head)					\  argument
192 #define	STAILQ_EMPTY(head)	((head)->stqh_first == NULL)  argument
194 #define	STAILQ_FIRST(head)	((head)->stqh_first)  argument
196 #define	STAILQ_FOREACH(var, head, field)				\  argument
201 #define	STAILQ_INIT(head) do {						\  argument
206 #define	STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {		\  argument
212 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
218 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
224 #define	STAILQ_LAST(head, type, field)					\  argument
232 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
246 #define	STAILQ_REMOVE_HEAD(head, field) do {				\  argument
252 #define	STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {			\  argument
257 #define STAILQ_REMOVE_AFTER(head, elm, field) do {			\  argument
271 #define	LIST_HEAD_INITIALIZER(head)					\  argument
284 #define	LIST_EMPTY(head)	((head)->lh_first == NULL)  argument
286 #define	LIST_FIRST(head)	((head)->lh_first)  argument
288 #define	LIST_FOREACH(var, head, field)					\  argument
293 #define	LIST_INIT(head) do {						\  argument
312 #define	LIST_INSERT_HEAD(head, elm, field) do {				\  argument
337 #define	TAILQ_HEAD_INITIALIZER(head)					\  argument
349 #define	TAILQ_EMPTY(head)	((head)->tqh_first == NULL)  argument
351 #define	TAILQ_FIRST(head)	((head)->tqh_first)  argument
353 #define	TAILQ_FOREACH(var, head, field)					\  argument
358 #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
363 #define	TAILQ_INIT(head) do {						\  argument
368 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
385 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
395 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
402 #define	TAILQ_LAST(head, headname)					\  argument
410 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument
428 #define	CIRCLEQ_HEAD_INITIALIZER(head)					\  argument
440 #define	CIRCLEQ_EMPTY(head)	((head)->cqh_first == (void *)(head))  argument
442 #define	CIRCLEQ_FIRST(head)	((head)->cqh_first)  argument
444 #define	CIRCLEQ_FOREACH(var, head, field)				\  argument
449 #define	CIRCLEQ_FOREACH_REVERSE(var, head, field)			\  argument
454 #define	CIRCLEQ_INIT(head) do {						\  argument
459 #define	CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
469 #define	CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\  argument
479 #define	CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
489 #define	CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
499 #define	CIRCLEQ_LAST(head)	((head)->cqh_last)  argument
505 #define	CIRCLEQ_REMOVE(head, elm, field) do {				\  argument