Lines Matching defs:elm
107 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \ argument
111 #define QUEUEDEBUG_LIST_OP(elm, field) \ argument
118 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) \ argument
122 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) argument
123 #define QUEUEDEBUG_LIST_OP(elm, field) argument
124 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, field) argument
131 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
140 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
148 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
156 #define LIST_REMOVE(elm, field) do { \ argument
175 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
205 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
210 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
219 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
250 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) 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
300 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
313 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
342 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) 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
392 #define SIMPLEQ_REMOVE(head, elm, type, field) do { \ argument
415 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
441 #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) \ argument
445 #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) \ argument
448 #define QUEUEDEBUG_TAILQ_OP(elm, field) \ argument
455 #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) \ argument
460 #define QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field) \ argument
464 #define QUEUEDEBUG_TAILQ_INSERT_HEAD(head, elm, field) argument
465 #define QUEUEDEBUG_TAILQ_INSERT_TAIL(head, elm, field) argument
466 #define QUEUEDEBUG_TAILQ_OP(elm, field) argument
467 #define QUEUEDEBUG_TAILQ_PREREMOVE(head, elm, field) argument
468 #define QUEUEDEBUG_TAILQ_POSTREMOVE(elm, field) 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
506 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
514 #define TAILQ_REMOVE(head, elm, field) do { \ argument
560 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
564 #define TAILQ_PREV(elm, headname, field) \ argument
580 #define QUEUEDEBUG_CIRCLEQ_ELM(head, elm, field) \ argument
599 #define QUEUEDEBUG_CIRCLEQ_POSTREMOVE(elm, field) \ argument
604 #define QUEUEDEBUG_CIRCLEQ_ELM(head, elm, field) argument
605 #define QUEUEDEBUG_CIRCLEQ_POSTREMOVE(elm, field) 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
709 #define CIRCLEQ_NEXT(elm, field) ((elm)->field.cqe_next) argument
710 #define CIRCLEQ_PREV(elm, field) ((elm)->field.cqe_prev) argument
712 #define CIRCLEQ_LOOP_NEXT(head, elm, field) \ argument
716 #define CIRCLEQ_LOOP_PREV(head, elm, field) \ argument