191 #define	SLIST_HEAD_INITIALIZER(head)					\  argument
202 #define	SLIST_FIRST(head)	((head)->slh_first)  argument
203 #define	SLIST_END(head)		NULL  argument
204 #define	SLIST_EMPTY(head)	(SLIST_FIRST(head) == SLIST_END(head))  argument
207 #define	SLIST_FOREACH(var, head, field)					\  argument
212 #define	SLIST_FOREACH_SAFE(var, head, field, tvar)			\  argument
220 #define	SLIST_INIT(head) {						\  argument
229 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
238 #define	SLIST_REMOVE_HEAD(head, field) do {				\  argument
242 #define SLIST_REMOVE(head, elm, type, field) do {			\  argument
264 #define LIST_HEAD_INITIALIZER(head)					\  argument
276 #define	LIST_FIRST(head)		((head)->lh_first)  argument
277 #define	LIST_END(head)			NULL  argument
278 #define	LIST_EMPTY(head)		(LIST_FIRST(head) == LIST_END(head))  argument
281 #define LIST_FOREACH(var, head, field)					\  argument
286 #define	LIST_FOREACH_SAFE(var, head, field, tvar)			\  argument
294 #define	LIST_INIT(head) do {						\  argument
313 #define LIST_INSERT_HEAD(head, elm, field) do {				\  argument
348 #define SIMPLEQ_HEAD_INITIALIZER(head)					\  argument
359 #define	SIMPLEQ_FIRST(head)	    ((head)->sqh_first)  argument
360 #define	SIMPLEQ_END(head)	    NULL  argument
361 #define	SIMPLEQ_EMPTY(head)	    (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head))  argument
364 #define SIMPLEQ_FOREACH(var, head, field)				\  argument
369 #define	SIMPLEQ_FOREACH_SAFE(var, head, field, tvar)			\  argument
377 #define	SIMPLEQ_INIT(head) do {						\  argument
382 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
388 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
394 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
400 #define SIMPLEQ_REMOVE_HEAD(head, field) do {			\  argument
405 #define SIMPLEQ_REMOVE_AFTER(head, elm, field) do {			\  argument
437 #define XSIMPLEQ_XOR(head, ptr)	    ((__typeof(ptr))((head)->sqx_cookie ^ \  argument
439 #define	XSIMPLEQ_FIRST(head)	    XSIMPLEQ_XOR(head, ((head)->sqx_first))  argument
440 #define	XSIMPLEQ_END(head)	    NULL  argument
441 #define	XSIMPLEQ_EMPTY(head)	    (XSIMPLEQ_FIRST(head) == XSIMPLEQ_END(head))  argument
442 #define	XSIMPLEQ_NEXT(head, elm, field)    XSIMPLEQ_XOR(head, ((elm)->field.sqx_next))  argument
445 #define XSIMPLEQ_FOREACH(var, head, field)				\  argument
450 #define	XSIMPLEQ_FOREACH_SAFE(var, head, field, tvar)			\  argument
458 #define	XSIMPLEQ_INIT(head) do {					\  argument
464 #define XSIMPLEQ_INSERT_HEAD(head, elm, field) do {			\  argument
471 #define XSIMPLEQ_INSERT_TAIL(head, elm, field) do {			\  argument
477 #define XSIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
484 #define XSIMPLEQ_REMOVE_HEAD(head, field) do {				\  argument
490 #define XSIMPLEQ_REMOVE_AFTER(head, elm, field) do {			\  argument
508 #define TAILQ_HEAD_INITIALIZER(head)					\  argument
520 #define	TAILQ_FIRST(head)		((head)->tqh_first)  argument
521 #define	TAILQ_END(head)			NULL  argument
523 #define TAILQ_LAST(head, headname)					\  argument
528 #define	TAILQ_EMPTY(head)						\  argument
531 #define TAILQ_FOREACH(var, head, field)					\  argument
536 #define	TAILQ_FOREACH_SAFE(var, head, field, tvar)			\  argument
543 #define TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
548 #define	TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)	\  argument
557 #define	TAILQ_INIT(head) do {						\  argument
562 #define TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
572 #define TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
579 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
596 #define TAILQ_REMOVE(head, elm, field) do {				\  argument
607 #define TAILQ_REPLACE(head, elm, elm2, field) do {			\  argument