Lines Matching defs:head
94 #define LIST_HEAD_INITIALIZER(head) \ argument
107 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ argument
122 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) argument
127 #define LIST_INIT(head) do { \ argument
148 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
165 #define LIST_FOREACH(var, head, field) \ argument
173 #define LIST_EMPTY(head) ((head)->lh_first == NULL) argument
174 #define LIST_FIRST(head) ((head)->lh_first) argument
177 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
190 #define SLIST_HEAD_INITIALIZER(head) \ argument
201 #define SLIST_INIT(head) do { \ argument
210 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
215 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
219 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
237 #define SLIST_FOREACH(var, head, field) \ argument
240 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
248 #define SLIST_EMPTY(head) ((head)->slh_first == NULL) argument
249 #define SLIST_FIRST(head) ((head)->slh_first) argument
261 #define STAILQ_HEAD_INITIALIZER(head) \ argument
272 #define STAILQ_INIT(head) do { \ argument
277 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
283 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
289 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
295 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
300 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
313 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
319 #define STAILQ_FOREACH(var, head, field) \ argument
324 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
340 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL) argument
341 #define STAILQ_FIRST(head) ((head)->stqh_first) argument
353 #define SIMPLEQ_HEAD_INITIALIZER(head) \ argument
364 #define SIMPLEQ_INIT(head) do { \ argument
369 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
375 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
381 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
387 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
392 #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
427 #define TAILQ_HEAD_INITIALIZER(head) \ argument
441 #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) \ argument
445 #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) \ argument
455 #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) \ argument
464 #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) argument
465 #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) argument
467 #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) argument
471 #define TAILQ_INIT(head) do { \ argument
476 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
487 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
495 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
514 #define TAILQ_REMOVE(head, elm, field) do { \ argument
526 #define TAILQ_FOREACH(var, head, field) \ argument
531 #define TAILQ_FOREACH_SAFE(var, head, field, next) \ argument
536 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
541 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, prev) \ argument
558 #define TAILQ_EMPTY(head) ((head)->tqh_first == NULL) argument
559 #define TAILQ_FIRST(head) ((head)->tqh_first) argument
562 #define TAILQ_LAST(head, headname) \ argument
571 #define QUEUEDEBUG_CIRCLEQ_HEAD(head, field) \ argument
580 #define QUEUEDEBUG_CIRCLEQ_ELM(head, elm, field) \ argument
603 #define QUEUEDEBUG_CIRCLEQ_HEAD(head, field) argument
604 #define QUEUEDEBUG_CIRCLEQ_ELM(head, elm, field) argument
614 #define CIRCLEQ_HEAD_INITIALIZER(head) \ argument
626 #define CIRCLEQ_INIT(head) do { \ argument
631 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
643 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
655 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
666 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
677 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
693 #define CIRCLEQ_FOREACH(var, head, field) \ argument
698 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
706 #define CIRCLEQ_EMPTY(head) ((head)->cqh_first == (void *)(head)) argument
707 #define CIRCLEQ_FIRST(head) ((head)->cqh_first) argument
708 #define CIRCLEQ_LAST(head) ((head)->cqh_last) argument
712 #define CIRCLEQ_LOOP_NEXT(head, elm, field) \ argument
716 #define CIRCLEQ_LOOP_PREV(head, elm, field) \ argument