Lines Matching defs:field

114 #define	QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field)			\  argument
118 #define QUEUEDEBUG_LIST_OP(elm, field) \ argument
125 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \ argument
139 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
149 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
158 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
167 #define LIST_REMOVE(elm, field) do { \ argument
177 #define LIST_FOREACH(var, head, field) \ argument
187 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
214 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
220 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
226 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
231 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
245 #define SLIST_FOREACH(var, head, field) \ argument
253 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
282 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
289 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
296 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
304 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
311 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
325 #define STAILQ_FOREACH(var, head, field) \ argument
335 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
364 #define SIMPLEQ_INSERT_HEAD(head, elm, field) do { \ argument
371 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \ argument
378 #define SIMPLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
385 #define SIMPLEQ_REMOVE_HEAD(head, field) do { \ argument
391 #define SIMPLEQ_REMOVE(head, elm, type, field) do { \ argument
405 #define SIMPLEQ_FOREACH(var, head, field) \ argument
415 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
442 #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) \ argument
447 #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) \ argument
451 #define QUEUEDEBUG_TAILQ_OP(elm, field) \ argument
460 #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) \ argument
465 #define QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field) \ argument
482 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
494 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
503 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
515 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
524 #define TAILQ_REMOVE(head, elm, field) do { \ argument
537 #define TAILQ_FOREACH(var, head, field) \ argument
542 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
553 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
557 #define TAILQ_PREV(elm, headname, field) \ argument
588 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
599 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) do { \ argument
610 #define CIRCLEQ_INSERT_HEAD(head, elm, field) do { \ argument
621 #define CIRCLEQ_INSERT_TAIL(head, elm, field) do { \ argument
632 #define CIRCLEQ_REMOVE(head, elm, field) do { \ argument
646 #define CIRCLEQ_FOREACH(var, head, field) \ argument
651 #define CIRCLEQ_FOREACH_REVERSE(var, head, field) \ argument
662 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
663 #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) argument
665 #define CIRCLEQ_LOOP_NEXT(head, elm, field) \ argument
669 #define CIRCLEQ_LOOP_PREV(head, elm, field) \ argument