Lines Matching defs:head
184 #define SLIST_HEAD_INITIALIZER(head) \ argument
195 #define SLIST_FIRST(head) ((head)->slh_first) argument
196 #define SLIST_END(head) NULL argument
197 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
200 #define SLIST_FOREACH(var, head, field) \ argument
205 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
213 #define SLIST_INIT(head) { \ argument
222 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
231 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
235 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
257 #define LIST_HEAD_INITIALIZER(head) \ argument
269 #define LIST_FIRST(head) ((head)->lh_first) argument
270 #define LIST_END(head) NULL argument
271 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument
274 #define LIST_FOREACH(var, head, field) \ argument
279 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
287 #define LIST_INIT(head) do { \ argument
306 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
341 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
352 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
353 #define SIMPLEQ_END(head) NULL argument
354 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
357 #define SIMPLEQ_FOREACH(var, head, field) \ argument
362 #define SIMPLEQ_FOREACH_SAFE(var, head, field, tvar) \ argument
370 #define SIMPLEQ_INIT(head) do { \ argument
375 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
381 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
387 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
393 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
398 #define SIMPLEQ_REMOVE_AFTER(head, elm, field) do { \ argument
413 #define TAILQ_HEAD_INITIALIZER(head) \ argument
425 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
426 #define TAILQ_END(head) NULL argument
428 #define TAILQ_LAST(head, headname) \ argument
433 #define TAILQ_EMPTY(head) \ argument
436 #define TAILQ_FOREACH(var, head, field) \ argument
441 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
448 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
453 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
462 #define TAILQ_INIT(head) do { \ argument
467 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
477 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
484 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
501 #define TAILQ_REMOVE(head, elm, field) do { \ argument
512 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
533 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
545 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
546 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
547 #define CIRCLEQ_END(head) ((void *)(head)) argument
550 #define CIRCLEQ_EMPTY(head) \ argument
553 #define CIRCLEQ_FOREACH(var, head, field) \ argument
558 #define CIRCLEQ_FOREACH_SAFE(var, head, field, tvar) \ argument
564 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
569 #define CIRCLEQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
578 #define CIRCLEQ_INIT(head) do { \ argument
583 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
593 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
603 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
613 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
623 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
638 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \ argument