Lines Matching refs:elm
208 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) do { \ argument
209 if (*(prevp) != (elm)) \
211 (prevp), *(prevp), (elm)); \
214 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) argument
263 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
264 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
265 SLIST_NEXT((slistelm), field) = (elm); \
268 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
269 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
270 SLIST_FIRST((head)) = (elm); \
273 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
275 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
276 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
277 if (SLIST_FIRST((head)) == (elm)) { \
282 while (SLIST_NEXT(curelm, field) != (elm)) \
289 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
290 SLIST_NEXT(elm, field) = \
291 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
298 #define SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \ argument
299 QMD_SLIST_CHECK_PREVPTR(prevp, elm); \
300 *(prevp) = SLIST_NEXT(elm, field); \
301 TRASHIT((elm)->field.sle_next); \
378 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
379 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
380 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
381 STAILQ_NEXT((tqelm), field) = (elm); \
384 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
385 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
386 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
387 STAILQ_FIRST((head)) = (elm); \
390 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
391 STAILQ_NEXT((elm), field) = NULL; \
392 *(head)->stqh_last = (elm); \
393 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
401 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
403 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
404 QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \
405 if (STAILQ_FIRST((head)) == (elm)) { \
410 while (STAILQ_NEXT(curelm, field) != (elm)) \
417 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
418 if ((STAILQ_NEXT(elm, field) = \
419 STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL) \
420 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
429 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \ argument
430 if ((STAILQ_FIRST((head)) = STAILQ_NEXT((elm), field)) == NULL) \
500 #define QMD_LIST_CHECK_NEXT(elm, field) do { \ argument
501 if (LIST_NEXT((elm), field) != NULL && \
502 LIST_NEXT((elm), field)->field.le_prev != \
503 &((elm)->field.le_next)) \
504 panic("Bad link elm %p next->prev != elm", (elm)); \
512 #define QMD_LIST_CHECK_PREV(elm, field) do { \ argument
513 if (*(elm)->field.le_prev != (elm)) \
514 panic("Bad link elm %p prev->next != elm", (elm)); \
518 #define QMD_LIST_CHECK_NEXT(elm, field) argument
519 #define QMD_LIST_CHECK_PREV(elm, field) argument
567 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
569 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
571 &LIST_NEXT((elm), field); \
572 LIST_NEXT((listelm), field) = (elm); \
573 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
576 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
578 (elm)->field.le_prev = (listelm)->field.le_prev; \
579 LIST_NEXT((elm), field) = (listelm); \
580 *(listelm)->field.le_prev = (elm); \
581 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
584 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
586 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
587 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
588 LIST_FIRST((head)) = (elm); \
589 (elm)->field.le_prev = &LIST_FIRST((head)); \
592 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
594 #define LIST_PREV(elm, head, type, field) \ argument
595 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
596 __containerof((elm)->field.le_prev, \
599 #define LIST_REMOVE(elm, field) do { \ argument
600 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
601 QMD_SAVELINK(oldprev, (elm)->field.le_prev); \
602 QMD_LIST_CHECK_NEXT(elm, field); \
603 QMD_LIST_CHECK_PREV(elm, field); \
604 if (LIST_NEXT((elm), field) != NULL) \
605 LIST_NEXT((elm), field)->field.le_prev = \
606 (elm)->field.le_prev; \
607 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
689 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \ argument
690 if (TAILQ_NEXT((elm), field) != NULL && \
691 TAILQ_NEXT((elm), field)->field.tqe_prev != \
692 &((elm)->field.tqe_next)) \
693 panic("Bad link elm %p next->prev != elm", (elm)); \
701 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \ argument
702 if (*(elm)->field.tqe_prev != (elm)) \
703 panic("Bad link elm %p prev->next != elm", (elm)); \
708 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
709 #define QMD_TAILQ_CHECK_PREV(elm, field) argument
773 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
775 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
776 TAILQ_NEXT((elm), field)->field.tqe_prev = \
777 &TAILQ_NEXT((elm), field); \
779 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
782 TAILQ_NEXT((listelm), field) = (elm); \
783 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
784 QMD_TRACE_ELEM(&(elm)->field); \
788 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
790 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
791 TAILQ_NEXT((elm), field) = (listelm); \
792 *(listelm)->field.tqe_prev = (elm); \
793 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
794 QMD_TRACE_ELEM(&(elm)->field); \
798 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
800 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
802 &TAILQ_NEXT((elm), field); \
804 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
805 TAILQ_FIRST((head)) = (elm); \
806 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
808 QMD_TRACE_ELEM(&(elm)->field); \
811 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
813 TAILQ_NEXT((elm), field) = NULL; \
814 (elm)->field.tqe_prev = (head)->tqh_last; \
815 *(head)->tqh_last = (elm); \
816 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
818 QMD_TRACE_ELEM(&(elm)->field); \
834 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
836 #define TAILQ_PREV(elm, headname, field) \ argument
837 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
839 #define TAILQ_REMOVE(head, elm, field) do { \ argument
840 QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \
841 QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \
842 QMD_TAILQ_CHECK_NEXT(elm, field); \
843 QMD_TAILQ_CHECK_PREV(elm, field); \
844 if ((TAILQ_NEXT((elm), field)) != NULL) \
845 TAILQ_NEXT((elm), field)->field.tqe_prev = \
846 (elm)->field.tqe_prev; \
848 (head)->tqh_last = (elm)->field.tqe_prev; \
851 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
854 QMD_TRACE_ELEM(&(elm)->field); \