Lines Matching defs:head
101 #define LIST_HEAD_INITIALIZER(head) \ argument
114 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ argument
134 #define LIST_INIT(head) do { \ argument
158 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
177 #define LIST_FOREACH(var, head, field) \ argument
185 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
186 #define LIST_FIRST(head) ((head)->lh_first) argument
198 #define SLIST_HEAD_INITIALIZER(head) \ argument
209 #define SLIST_INIT(head) do { \ argument
220 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
226 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
231 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
245 #define SLIST_FOREACH(var, head, field) \ argument
251 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
252 #define SLIST_FIRST(head) ((head)->slh_first) argument
265 #define STAILQ_HEAD_INITIALIZER(head) \ argument
276 #define STAILQ_INIT(head) do { \ argument
282 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
289 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
296 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
304 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
311 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
325 #define STAILQ_FOREACH(var, head, field) \ argument
333 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
334 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
347 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
358 #define SIMPLEQ_INIT(head) do { \ argument
364 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
371 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
378 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
385 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
391 #define SIMPLEQ_REMOVE(head, elm, type, field) do { \ argument
405 #define SIMPLEQ_FOREACH(var, head, field) \ argument
413 #define SIMPLEQ_EMPTY(head) ((head)->sqh_first == NULL) argument
414 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
428 #define TAILQ_HEAD_INITIALIZER(head) \ argument
442 #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) \ argument
447 #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) \ argument
460 #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) \ argument
476 #define TAILQ_INIT(head) do { \ argument
482 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
494 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
503 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
524 #define TAILQ_REMOVE(head, elm, field) do { \ argument
537 #define TAILQ_FOREACH(var, head, field) \ argument
542 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
551 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
552 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
555 #define TAILQ_LAST(head, headname) \ argument
570 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
582 #define CIRCLEQ_INIT(head) do { \ argument
588 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
599 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
610 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
621 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
632 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
646 #define CIRCLEQ_FOREACH(var, head, field) \ argument
651 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
659 #define CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head)) argument
660 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
661 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
665 #define CIRCLEQ_LOOP_NEXT(head, elm, field) \ argument
669 #define CIRCLEQ_LOOP_PREV(head, elm, field) \ argument