114 #define	SLIST_HEAD_INITIALIZER(head)					\  argument
125 #define	SLIST_EMPTY(head)	((head)->slh_first == NULL)  argument
127 #define	SLIST_FIRST(head)	((head)->slh_first)  argument
129 #define	SLIST_FOREACH(var, head, field)					\  argument
134 #define	SLIST_INIT(head) do {						\  argument
143 #define	SLIST_INSERT_HEAD(head, elm, field) do {			\  argument
150 #define	SLIST_REMOVE(head, elm, type, field) do {			\  argument
163 #define	SLIST_REMOVE_HEAD(head, field) do {				\  argument
176 #define	STAILQ_HEAD_INITIALIZER(head)					\  argument
195 #define	STAILQ_EMPTY(head)	((head)->stqh_first == NULL)  argument
197 #define	STAILQ_FIRST(head)	((head)->stqh_first)  argument
199 #define	STAILQ_FOREACH(var, head, field)				\  argument
204 #define	STAILQ_INIT(head) do {						\  argument
209 #define	STAILQ_INSERT_AFTER(head, tqelm, elm, field) do {		\  argument
215 #define	STAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
221 #define	STAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
227 #define	STAILQ_LAST(head, type, field)					\  argument
235 #define	STAILQ_REMOVE(head, elm, type, field) do {			\  argument
249 #define	STAILQ_REMOVE_HEAD(head, field) do {				\  argument
255 #define	STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do {			\  argument
268 #define	LIST_HEAD_INITIALIZER(head)					\  argument
281 #define	LIST_EMPTY(head)	((head)->lh_first == NULL)  argument
283 #define	LIST_FIRST(head)	((head)->lh_first)  argument
285 #define	LIST_FOREACH(var, head, field)					\  argument
290 #define	LIST_INIT(head) do {						\  argument
309 #define	LIST_INSERT_HEAD(head, elm, field) do {				\  argument
334 #define	TAILQ_HEAD_INITIALIZER(head)					\  argument
355 #define	TAILQ_EMPTY(head)	((head)->tqh_first == NULL)  argument
357 #define	TAILQ_FIRST(head)	((head)->tqh_first)  argument
359 #define	TAILQ_FOREACH(var, head, field)					\  argument
364 #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\  argument
369 #define	TAILQ_INIT(head) do {						\  argument
374 #define	TAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\  argument
391 #define	TAILQ_INSERT_HEAD(head, elm, field) do {			\  argument
401 #define	TAILQ_INSERT_TAIL(head, elm, field) do {			\  argument
408 #define	TAILQ_LAST(head, headname)					\  argument
416 #define	TAILQ_REMOVE(head, elm, field) do {				\  argument
444 		 *head = (struct quehead *)b;  in insque()  local