Lines Matching defs:head
89 #define LIST_HEAD_INITIALIZER(head) \ argument
101 #define LIST_INIT(head) do { \ argument
120 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
134 #define LIST_FOREACH(var, head, field) \ argument
142 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
143 #define LIST_FIRST(head) ((head)->lh_first) argument
155 #define SLIST_HEAD_INITIALIZER(head) \ argument
166 #define SLIST_INIT(head) do { \ argument
175 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
180 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
184 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
197 #define SLIST_FOREACH(var, head, field) \ argument
203 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
204 #define SLIST_FIRST(head) ((head)->slh_first) argument
217 #define STAILQ_HEAD_INITIALIZER(head) \ argument
228 #define STAILQ_INIT(head) do { \ argument
233 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
239 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
245 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
251 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
256 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
269 #define STAILQ_FOREACH(var, head, field) \ argument
285 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
286 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
299 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
310 #define SIMPLEQ_INIT(head) do { \ argument
315 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
321 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
327 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
333 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
338 #define SIMPLEQ_REMOVE(head, elm, type, field) do { \ argument
351 #define SIMPLEQ_FOREACH(var, head, field) \ argument
359 #define SIMPLEQ_EMPTY(head) ((head)->sqh_first == NULL) argument
360 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
374 #define TAILQ_HEAD_INITIALIZER(head) \ argument
387 #define TAILQ_INIT(head) do { \ argument
392 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
402 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
409 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
426 #define TAILQ_REMOVE(head, elm, field) do { \ argument
435 #define TAILQ_FOREACH(var, head, field) \ argument
440 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
457 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
458 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
461 #define TAILQ_LAST(head, headname) \ argument
476 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
488 #define CIRCLEQ_INIT(head) do { \ argument
493 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
503 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
513 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
523 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
533 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
546 #define CIRCLEQ_FOREACH(var, head, field) \ argument
551 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
559 #define CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head)) argument
560 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
561 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
565 #define CIRCLEQ_LOOP_NEXT(head, elm, field) \ argument
569 #define CIRCLEQ_LOOP_PREV(head, elm, field) \ argument