Lines Matching defs:head
111 #define SLIST_HEAD_INITIALIZER(head) \ argument
122 #define SLIST_FIRST(head) ((head)->slh_first) argument
123 #define SLIST_END(head) NULL argument
124 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
127 #define SLIST_FOREACH(var, head, field) \ argument
132 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
141 #define SLIST_INIT(head) do { \ argument
150 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
160 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
164 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
186 #define LIST_HEAD_INITIALIZER(head) \ argument
198 #define LIST_FIRST(head) ((head)->lh_first) argument
199 #define LIST_END(head) NULL argument
200 #define LIST_EMPTY(head) ((head)->lh_first == LIST_END(head)) argument
203 #define LIST_FOREACH(var, head, field) \ argument
208 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
226 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ argument
244 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) argument
249 #define LIST_INIT(head) do { \ argument
271 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
306 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
317 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
318 #define SIMPLEQ_END(head) NULL argument
319 #define SIMPLEQ_EMPTY(head) ((head)->sqh_first == SIMPLEQ_END(head)) argument
322 #define SIMPLEQ_FOREACH(var, head, field) \ argument
327 #define SIMPLEQ_FOREACH_SAFE(var, head, field, next) \ argument
336 #define SIMPLEQ_INIT(head) do { \ argument
341 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
347 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
353 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
359 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
364 #define SIMPLEQ_REMOVE_AFTER(head, elm, field) do { \ argument
370 #define SIMPLEQ_REMOVE(head, elm, type, field) do { \ argument
391 #define SIMPLEQ_LAST(head, type, field) \ argument
407 #define TAILQ_HEAD_INITIALIZER(head) \ argument
420 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
421 #define TAILQ_END(head) (NULL) argument
423 #define TAILQ_LAST(head, headname) \ argument
427 #define TAILQ_EMPTY(head) (TAILQ_FIRST(head) == TAILQ_END(head)) argument
430 #define TAILQ_FOREACH(var, head, field) \ argument
435 #define TAILQ_FOREACH_SAFE(var, head, field, next) \ argument
440 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
445 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, prev) \ argument
454 #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) \ argument
459 #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) \ argument
472 #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) \ argument
481 #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) argument
482 #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) argument
484 #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) argument
488 #define TAILQ_INIT(head) do { \ argument
493 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
504 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
512 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
532 #define TAILQ_REMOVE(head, elm, field) do { \ argument
544 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
574 #define STAILQ_HEAD_INITIALIZER(head) \ argument
585 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
586 #define STAILQ_END(head) NULL argument
588 #define STAILQ_EMPTY(head) (STAILQ_FIRST(head) == STAILQ_END(head)) argument
593 #define STAILQ_INIT(head) do { \ argument
598 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
604 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
610 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
616 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
621 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
634 #define STAILQ_FOREACH(var, head, field) \ argument
639 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
652 #define STAILQ_LAST(head, type, field) \ argument
690 #define QUEUEDEBUG_CIRCLEQ_HEAD(head, field) \ argument
699 #define QUEUEDEBUG_CIRCLEQ_ELM(head, elm, field) \ argument
722 #define QUEUEDEBUG_CIRCLEQ_HEAD(head, field) argument
723 #define QUEUEDEBUG_CIRCLEQ_ELM(head, elm, field) argument
733 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
745 #define CIRCLEQ_INIT(head) do { \ argument
750 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
762 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
774 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
785 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
796 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
812 #define CIRCLEQ_FOREACH(var, head, field) \ argument
817 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
825 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
826 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
828 #define CIRCLEQ_ENDC(head) (__launder_type(head)) argument
830 #define CIRCLEQ_END(head) ((void *)(head)) argument
833 #define CIRCLEQ_EMPTY(head) \ argument
836 #define CIRCLEQ_LOOP_NEXT(head, elm, field) \ argument
840 #define CIRCLEQ_LOOP_PREV(head, elm, field) \ argument