Lines Matching defs:field
187 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
190 #define SLIST_FOREACH(var, head, field) \ argument
195 #define SLIST_FOREACH_FROM(var, head, field) \ argument
200 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
206 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
220 #define SLIST_CONCAT(head1, head2, type, field) do { \ argument
235 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
241 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
247 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
252 #define SLIST_REMOVE_AFTER(slistelm, field) do { \ argument
258 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
312 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
315 #define STAILQ_FOREACH(var, head, field) \ argument
320 #define STAILQ_FOREACH_FROM(var, head, field) \ argument
326 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
332 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
357 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
364 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
371 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
378 #define STAILQ_LAST(head, type, field) \ argument
383 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
390 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
397 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
459 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
460 #define LIST_PREV(elm, head, type, field) \ argument
464 #define LIST_FOREACH(var, head, field) \ argument
469 #define LIST_FOREACH_FROM(var, head, field) \ argument
474 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
480 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
490 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ argument
494 #define QUEUEDEBUG_LIST_OP(elm, field) \ argument
501 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \ argument
505 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) argument
506 #define QUEUEDEBUG_LIST_OP(elm, field) argument
507 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) argument
515 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
525 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
534 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
543 #define LIST_REMOVE(elm, field) do { \ argument
553 #define LIST_SWAP(head1, head2, type, field) do { \ argument
598 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
600 #define SIMPLEQ_FOREACH(var, head, field) \ argument
605 #define SIMPLEQ_FOREACH_FROM(var, head, field) \ argument
611 #define SIMPLEQ_FOREACH_SAFE(var, head, field, tvar) \ argument
617 #define SIMPLEQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
633 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
640 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
647 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
655 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
662 #define SIMPLEQ_REMOVE_AFTER(head, elm, field) do { \ argument
669 #define SIMPLEQ_REMOVE(head, elm, type, field) do { \ argument
690 #define SIMPLEQ_LAST(head, type, field) \ argument
735 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
738 #define TAILQ_PREV(elm, headname, field) \ argument
743 #define TAILQ_FOREACH(var, head, field) \ argument
748 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
754 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
760 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
767 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
772 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
778 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
784 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar)\ argument
795 #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) \ argument
800 #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) \ argument
804 #define QUEUEDEBUG_TAILQ_OP(elm, field) \ argument
813 #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) \ argument
818 #define QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field) \ argument
822 #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) argument
823 #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) argument
824 #define QUEUEDEBUG_TAILQ_OP(elm, field) argument
825 #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) argument
826 #define QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field) argument
835 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
847 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
856 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
868 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
877 #define TAILQ_REMOVE(head, elm, field) do { \ argument
890 #define TAILQ_SWAP(head1, head2, type, field) do { \ argument
934 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
935 #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) argument
937 #define CIRCLEQ_LOOP_NEXT(head, elm, field) \ argument
941 #define CIRCLEQ_LOOP_PREV(head, elm, field) \ argument
946 #define CIRCLEQ_FOREACH(var, head, field) \ argument
951 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
965 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
976 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
987 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
998 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
1009 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument