166 #define    SLIST_FOREACH(var, head, field)		      \  argument
171 #define    SLIST_FOREACH_SAFE(var, head, field, tvar)		 \  argument
176 #define    SLIST_FOREACH_PREVPTR(var, varp, head, field)	    \  argument
185 #define    SLIST_INSERT_AFTER(slistelm, elm, field) do {	    \  argument
190 #define    SLIST_INSERT_HEAD(head, elm, field) do {	       \  argument
195 #define    SLIST_NEXT(elm, field)    ((elm)->field.sle_next)  argument
197 #define    SLIST_REMOVE(head, elm, type, field) do {		\  argument
210 #define    SLIST_REMOVE_HEAD(head, field) do {		      \  argument
247 #define    STAILQ_FOREACH(var, head, field)		   \  argument
252 #define    STAILQ_FOREACH_SAFE(var, head, field, tvar)		  \  argument
262 #define    STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {	    \  argument
269 #define    STAILQ_INSERT_HEAD(head, elm, field) do {		\  argument
276 #define    STAILQ_INSERT_TAIL(head, elm, field) do {		\  argument
282 #define    STAILQ_LAST(head, type, field)		     \  argument
288 #define    STAILQ_NEXT(elm, field)    ((elm)->field.stqe_next)  argument
290 #define    STAILQ_REMOVE(head, elm, type, field) do {		 \  argument
306 #define    STAILQ_REMOVE_AFTER(head, elm, field) do {		 \  argument
316 #define    STAILQ_REMOVE_HEAD(head, field) do {		       \  argument
323 #define    STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {	      \  argument
358 #define    LIST_FOREACH(var, head, field)		     \  argument
363 #define    LIST_FOREACH_SAFE(var, head, field, tvar)		\  argument
372 #define    LIST_INSERT_AFTER(listelm, elm, field) do {		  \  argument
381 #define    LIST_INSERT_BEFORE(listelm, elm, field) do {		   \  argument
388 #define    LIST_INSERT_HEAD(head, elm, field) do {		  \  argument
396 #define    LIST_NEXT(elm, field)    ((elm)->field.le_next)  argument
398 #define    LIST_REMOVE(elm, field) do {			   \  argument
446 #define    TAILQ_FOREACH(var, head, field)		      \  argument
451 #define    TAILQ_FOREACH_SAFE(var, head, field, tvar)		 \  argument
456 #define    TAILQ_FOREACH_REVERSE(var, head, headname, field)	    \  argument
461 #define    TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)	   \  argument
473 #define    TAILQ_INSERT_AFTER(head, listelm, elm, field) do {	     \  argument
488 #define    TAILQ_INSERT_BEFORE(listelm, elm, field) do {	    \  argument
497 #define    TAILQ_INSERT_HEAD(head, elm, field) do {	       \  argument
509 #define    TAILQ_INSERT_TAIL(head, elm, field) do {	       \  argument
521 #define    TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)  argument
523 #define    TAILQ_PREV(elm, headname, field)		   \  argument
526 #define    TAILQ_REMOVE(head, elm, field) do {		      \  argument
540 #define TAILQ_CONCAT(head1, head2, field)  do {			 \  argument