Lines Matching defs:head
112 #define SLIST_HEAD_INITIALIZER(head) \ argument
123 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
125 #define SLIST_FIRST(head) ((head)->slh_first) argument
127 #define SLIST_FOREACH(var, head, field) \ argument
132 #define SLIST_INIT(head) do { \ argument
141 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
148 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
161 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
174 #define STAILQ_HEAD_INITIALIZER(head) \ argument
185 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
187 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
189 #define STAILQ_FOREACH(var, head, field) \ argument
194 #define STAILQ_INIT(head) do { \ argument
199 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
205 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
211 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
217 #define STAILQ_LAST(head) (*(head)->stqh_last) argument
221 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
235 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
241 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \ argument
254 #define LIST_HEAD_INITIALIZER(head) \ argument
267 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
269 #define LIST_FIRST(head) ((head)->lh_first) argument
271 #define LIST_FOREACH(var, head, field) \ argument
276 #define LIST_INIT(head) do { \ argument
295 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
320 #define TAILQ_HEAD_INITIALIZER(head) \ argument
332 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
334 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
336 #define TAILQ_FOREACH(var, head, field) \ argument
341 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
346 #define TAILQ_INIT(head) do { \ argument
351 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
368 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
378 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
385 #define TAILQ_LAST(head, headname) \ argument
393 #define TAILQ_REMOVE(head, elm, field) do { \ argument
411 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
423 #define CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head)) argument
425 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
427 #define CIRCLEQ_FOREACH(var, head, field) \ argument
432 #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_LAST(head) ((head)->cqh_last) argument
488 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument