129 #define	SLIST_FOREACH(var, head, field)					\  argument
138 #define	SLIST_INSERT_AFTER(slistelm, elm, field) do {			\  argument
143 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
148 #define	SLIST_NEXT(elm, field)	((elm)->field.sle_next)  argument
150 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
163 #define	SLIST_REMOVE_HEAD(head, field) do {				\  argument
191 #define	STAILQ_FOREACH(var, head, field)				\  argument
201 #define	STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {		\  argument
207 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
213 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
219 #define	STAILQ_LAST(head, type, field)					\  argument
225 #define	STAILQ_NEXT(elm, field)	((elm)->field.stqe_next)  argument
227 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
241 #define	STAILQ_REMOVE_HEAD(head, field) do {				\  argument
247 #define	STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {			\  argument
277 #define	LIST_FOREACH(var, head, field)					\  argument
286 #define	LIST_INSERT_AFTER(listelm, elm, field) do {			\  argument
294 #define	LIST_INSERT_BEFORE(listelm, elm, field) do {			\  argument
301 #define	LIST_INSERT_HEAD(head, elm, field) do {				\  argument
308 #define	LIST_NEXT(elm, field)	((elm)->field.le_next)  argument
310 #define	LIST_REMOVE(elm, field) do {					\  argument
342 #define	TAILQ_FOREACH(var, head, field)					\  argument
347 #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
357 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
367 #define	TAILQ_INSERT_BEFORE(listelm, elm, field) do {			\  argument
374 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
384 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
394 #define	TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)  argument
396 #define	TAILQ_PREV(elm, headname, field)				\  argument
399 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument