Lines Matching defs:head
185 #define SLIST_HEAD_INITIALIZER(head) \ argument
196 #define SLIST_FIRST(head) ((head)->slh_first) argument
197 #define SLIST_END(head) NULL argument
198 #define SLIST_EMPTY(head) (SLIST_FIRST(head) == SLIST_END(head)) argument
201 #define SLIST_FOREACH(var, head, field) \ argument
209 #define SLIST_INIT(head) { \ argument
218 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
223 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
227 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
248 #define LIST_HEAD_INITIALIZER(head) \ argument
260 #define LIST_FIRST(head) ((head)->lh_first) argument
261 #define LIST_END(head) NULL argument
262 #define LIST_EMPTY(head) (LIST_FIRST(head) == LIST_END(head)) argument
265 #define LIST_FOREACH(var, head, field) \ argument
273 #define LIST_INIT(head) do { \ argument
292 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
323 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
334 #define SIMPLEQ_FIRST(head) ((head)->sqh_first) argument
335 #define SIMPLEQ_END(head) NULL argument
336 #define SIMPLEQ_EMPTY(head) (SIMPLEQ_FIRST(head) == SIMPLEQ_END(head)) argument
339 #define SIMPLEQ_FOREACH(var, head, field) \ argument
347 #define SIMPLEQ_INIT(head) do { \ argument
352 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
358 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
364 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
370 #define SIMPLEQ_REMOVE_HEAD(head, elm, field) do { \ argument
384 #define TAILQ_HEAD_INITIALIZER(head) \ argument
396 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
397 #define TAILQ_END(head) NULL argument
399 #define TAILQ_LAST(head, headname) \ argument
404 #define TAILQ_EMPTY(head) \ argument
407 #define TAILQ_FOREACH(var, head, field) \ argument
412 #define TAILQ_FOREACH_REVERSE(var, head, field, headname) \ argument
420 #define TAILQ_INIT(head) do { \ argument
425 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
435 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
442 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
459 #define TAILQ_REMOVE(head, elm, field) do { \ argument
468 #define TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
487 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
499 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
500 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
501 #define CIRCLEQ_END(head) ((void *)(head)) argument
504 #define CIRCLEQ_EMPTY(head) \ argument
507 #define CIRCLEQ_FOREACH(var, head, field) \ argument
512 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
520 #define CIRCLEQ_INIT(head) do { \ argument
525 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
535 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
545 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
555 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
565 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
578 #define CIRCLEQ_REPLACE(head, elm, elm2, field) do { \ argument