89 #define	LIST_HEAD_INITIALIZER(head)					\  argument
101 #define	LIST_INIT(head) do {						\  argument
120 #define	LIST_INSERT_HEAD(head, elm, field) do {				\  argument
134 #define	LIST_FOREACH(var, head, field)					\  argument
142 #define	LIST_EMPTY(head)		((head)->lh_first == NULL)  argument
143 #define	LIST_FIRST(head)		((head)->lh_first)  argument
155 #define	SLIST_HEAD_INITIALIZER(head)					\  argument
166 #define	SLIST_INIT(head) do {						\  argument
175 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
180 #define	SLIST_REMOVE_HEAD(head, field) do {				\  argument
184 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
197 #define	SLIST_FOREACH(var, head, field)					\  argument
203 #define	SLIST_EMPTY(head)	((head)->slh_first == NULL)  argument
204 #define	SLIST_FIRST(head)	((head)->slh_first)  argument
217 #define	STAILQ_HEAD_INITIALIZER(head)					\  argument
228 #define	STAILQ_INIT(head) do {						\  argument
233 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
239 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
245 #define	STAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
251 #define	STAILQ_REMOVE_HEAD(head, field) do {				\  argument
256 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
269 #define	STAILQ_FOREACH(var, head, field)				\  argument
277 #define	STAILQ_EMPTY(head)	((head)->stqh_first == NULL)  argument
278 #define	STAILQ_FIRST(head)	((head)->stqh_first)  argument
291 #define	SIMPLEQ_HEAD_INITIALIZER(head)					\  argument
302 #define	SIMPLEQ_INIT(head) do {						\  argument
307 #define	SIMPLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
313 #define	SIMPLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
319 #define	SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
325 #define	SIMPLEQ_REMOVE_HEAD(head, field) do {				\  argument
330 #define	SIMPLEQ_REMOVE(head, elm, type, field) do {			\  argument
343 #define	SIMPLEQ_FOREACH(var, head, field)				\  argument
351 #define	SIMPLEQ_EMPTY(head)		((head)->sqh_first == NULL)  argument
352 #define	SIMPLEQ_FIRST(head)		((head)->sqh_first)  argument
366 #define	TAILQ_HEAD_INITIALIZER(head)					\  argument
379 #define	TAILQ_INIT(head) do {						\  argument
384 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
394 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
401 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
418 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument
427 #define	TAILQ_FOREACH(var, head, field)					\  argument
432 #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
440 #define	TAILQ_EMPTY(head)		((head)->tqh_first == NULL)  argument
441 #define	TAILQ_FIRST(head)		((head)->tqh_first)  argument
444 #define	TAILQ_LAST(head, headname) \  argument
459 #define	CIRCLEQ_HEAD_INITIALIZER(head)					\  argument
471 #define	CIRCLEQ_INIT(head) do {						\  argument
476 #define	CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
486 #define	CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do {		\  argument
496 #define	CIRCLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
506 #define	CIRCLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
516 #define	CIRCLEQ_REMOVE(head, elm, field) do {				\  argument
529 #define	CIRCLEQ_FOREACH(var, head, field)				\  argument
534 #define	CIRCLEQ_FOREACH_REVERSE(var, head, field)			\  argument
542 #define	CIRCLEQ_EMPTY(head)		((head)->cqh_first == (void *)(head))  argument
543 #define	CIRCLEQ_FIRST(head)		((head)->cqh_first)  argument
544 #define	CIRCLEQ_LAST(head)		((head)->cqh_last)  argument
548 #define CIRCLEQ_LOOP_NEXT(head, elm, field)				\  argument
552 #define CIRCLEQ_LOOP_PREV(head, elm, field)				\  argument