Lines Matching defs:head

93 #define	SLIST_HEAD_INITIALIZER(head)					\  argument
106 #define SLIST_FIRST(head) ((head)->slh_first) argument
107 #define SLIST_END(head) NULL argument
108 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
111 #define SLIST_FOREACH(var, head, field) \ argument
119 #define SLIST_INIT(head) { \ argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
133 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
145 #define LIST_HEAD_INITIALIZER(head) \ argument
157 #define LIST_FIRST(head) ((head)->lh_first) argument
158 #define LIST_END(head) NULL argument
159 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument
162 #define LIST_FOREACH(var, head, field) \ argument
170 #define LIST_INIT(head) do { \ argument
189 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
220 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
231 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
232 #define SIMPLEQ_END(head) NULL argument
233 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
236 #define SIMPLEQ_FOREACH(var, head, field) \ argument
244 #define SIMPLEQ_INIT(head) do { \ argument
249 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
255 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
261 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
267 #define SIMPLEQ_REMOVE_HEAD(head, elm, field) do { \ argument
281 #define TAILQ_HEAD_INITIALIZER(head) \ argument
293 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
294 #define TAILQ_END(head) NULL argument
296 #define TAILQ_LAST(head, headname) \ argument
301 #define TAILQ_EMPTY(head) \ argument
304 #define TAILQ_FOREACH(var, head, field) \ argument
309 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
317 #define TAILQ_INIT(head) do { \ argument
322 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
332 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
339 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
356 #define TAILQ_REMOVE(head, elm, field) do { \ argument
365 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
384 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
396 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
397 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
398 #define CIRCLEQ_END(head) ((void *)(head)) argument
401 #define CIRCLEQ_EMPTY(head) \ argument
404 #define CIRCLEQ_FOREACH(var, head, field) \ argument
409 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
417 #define CIRCLEQ_INIT(head) do { \ argument
422 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
432 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
442 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
452 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
462 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
475 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \ argument