Lines Matching defs:head
93 #define SLIST_HEAD_INITIALIZER(head) \ argument
104 #define SLIST_FIRST(head) ((head)->slh_first) argument
105 #define SLIST_END(head) NULL argument
106 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
109 #define SLIST_FOREACH(var, head, field) \ argument
114 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
122 #define SLIST_INIT(head) { \ argument
131 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
136 #define SLIST_REMOVE_NEXT(head, elm, field) do { \ argument
140 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
144 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
165 #define LIST_HEAD_INITIALIZER(head) \ argument
177 #define LIST_FIRST(head) ((head)->lh_first) argument
178 #define LIST_END(head) NULL argument
179 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument
182 #define LIST_FOREACH(var, head, field) \ argument
190 #define LIST_INIT(head) do { \ argument
209 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
240 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
251 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
252 #define SIMPLEQ_END(head) NULL argument
253 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
256 #define SIMPLEQ_FOREACH(var, head, field) \ argument
264 #define SIMPLEQ_INIT(head) do { \ argument
269 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
275 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
281 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
287 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
301 #define TAILQ_HEAD_INITIALIZER(head) \ argument
313 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
314 #define TAILQ_END(head) NULL argument
316 #define TAILQ_LAST(head, headname) \ argument
321 #define TAILQ_EMPTY(head) \ argument
324 #define TAILQ_FOREACH(var, head, field) \ argument
329 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
337 #define TAILQ_INIT(head) do { \ argument
342 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
352 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
359 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
376 #define TAILQ_REMOVE(head, elm, field) do { \ argument
385 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
404 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
416 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
417 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
418 #define CIRCLEQ_END(head) ((void *)(head)) argument
421 #define CIRCLEQ_EMPTY(head) \ argument
424 #define CIRCLEQ_FOREACH(var, head, field) \ argument
429 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
437 #define CIRCLEQ_INIT(head) do { \ argument
442 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
452 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
462 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
472 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
482 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
495 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \ argument