Lines Matching full:elm
175 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) do { \ argument
176 if (*(prevp) != (elm)) \
178 (prevp), *(prevp), (elm)); \
181 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) argument
230 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
231 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
232 SLIST_NEXT((slistelm), field) = (elm); \
235 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
236 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
237 SLIST_FIRST((head)) = (elm); \
240 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
242 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
243 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
244 if (SLIST_FIRST((head)) == (elm)) { \
249 while (SLIST_NEXT(curelm, field) != (elm)) \
256 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
257 SLIST_NEXT(elm, field) = \
258 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
265 #define SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \ argument
266 QMD_SLIST_CHECK_PREVPTR(prevp, elm); \
267 *(prevp) = SLIST_NEXT(elm, field); \
268 TRASHIT((elm)->field.sle_next); \
345 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
346 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
347 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
348 STAILQ_NEXT((tqelm), field) = (elm); \
351 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
352 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
353 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
354 STAILQ_FIRST((head)) = (elm); \
357 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
358 STAILQ_NEXT((elm), field) = NULL; \
359 *(head)->stqh_last = (elm); \
360 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
368 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
370 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
371 QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \
372 if (STAILQ_FIRST((head)) == (elm)) { \
377 while (STAILQ_NEXT(curelm, field) != (elm)) \
384 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
385 if ((STAILQ_NEXT(elm, field) = \
386 STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL) \
387 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
457 * QMD_LIST_CHECK_NEXT(TYPE *elm, LIST_ENTRY NAME)
459 * If an element follows 'elm' in the list, validates that the next element
460 * points back at 'elm.'
462 #define QMD_LIST_CHECK_NEXT(elm, field) do { \ argument
463 if (LIST_NEXT((elm), field) != NULL && \
464 LIST_NEXT((elm), field)->field.le_prev != \
465 &((elm)->field.le_next)) \
466 panic("Bad link elm %p next->prev != elm", (elm)); \
470 * QMD_LIST_CHECK_PREV(TYPE *elm, LIST_ENTRY NAME)
472 * Validates that the previous element (or head of the list) points to 'elm.'
474 #define QMD_LIST_CHECK_PREV(elm, field) do { \ argument
475 if (*(elm)->field.le_prev != (elm)) \
476 panic("Bad link elm %p prev->next != elm", (elm)); \
480 #define QMD_LIST_CHECK_NEXT(elm, field) argument
481 #define QMD_LIST_CHECK_PREV(elm, field) argument
529 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
531 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
533 &LIST_NEXT((elm), field); \
534 LIST_NEXT((listelm), field) = (elm); \
535 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
538 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
540 (elm)->field.le_prev = (listelm)->field.le_prev; \
541 LIST_NEXT((elm), field) = (listelm); \
542 *(listelm)->field.le_prev = (elm); \
543 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
546 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
548 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
549 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
550 LIST_FIRST((head)) = (elm); \
551 (elm)->field.le_prev = &LIST_FIRST((head)); \
554 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
556 #define LIST_PREV(elm, head, type, field) \ argument
557 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
558 __containerof((elm)->field.le_prev, \
561 #define LIST_REMOVE(elm, field) do { \ argument
562 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
563 QMD_SAVELINK(oldprev, (elm)->field.le_prev); \
564 QMD_LIST_CHECK_NEXT(elm, field); \
565 QMD_LIST_CHECK_PREV(elm, field); \
566 if (LIST_NEXT((elm), field) != NULL) \
567 LIST_NEXT((elm), field)->field.le_prev = \
568 (elm)->field.le_prev; \
569 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
646 * QMD_TAILQ_CHECK_NEXT(TYPE *elm, TAILQ_ENTRY NAME)
648 * If an element follows 'elm' in the tailq, validates that the next element
649 * points back at 'elm.'
651 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \ argument
652 if (TAILQ_NEXT((elm), field) != NULL && \
653 TAILQ_NEXT((elm), field)->field.tqe_prev != \
654 &((elm)->field.tqe_next)) \
655 panic("Bad link elm %p next->prev != elm", (elm)); \
659 * QMD_TAILQ_CHECK_PREV(TYPE *elm, TAILQ_ENTRY NAME)
661 * Validates that the previous element (or head of the tailq) points to 'elm.'
663 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \ argument
664 if (*(elm)->field.tqe_prev != (elm)) \
665 panic("Bad link elm %p prev->next != elm", (elm)); \
670 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
671 #define QMD_TAILQ_CHECK_PREV(elm, field) argument
735 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
737 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
738 TAILQ_NEXT((elm), field)->field.tqe_prev = \
739 &TAILQ_NEXT((elm), field); \
741 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
744 TAILQ_NEXT((listelm), field) = (elm); \
745 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
746 QMD_TRACE_ELEM(&(elm)->field); \
750 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
752 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
753 TAILQ_NEXT((elm), field) = (listelm); \
754 *(listelm)->field.tqe_prev = (elm); \
755 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
756 QMD_TRACE_ELEM(&(elm)->field); \
760 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
762 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
764 &TAILQ_NEXT((elm), field); \
766 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
767 TAILQ_FIRST((head)) = (elm); \
768 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
770 QMD_TRACE_ELEM(&(elm)->field); \
773 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
775 TAILQ_NEXT((elm), field) = NULL; \
776 (elm)->field.tqe_prev = (head)->tqh_last; \
777 *(head)->tqh_last = (elm); \
778 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
780 QMD_TRACE_ELEM(&(elm)->field); \
796 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
798 #define TAILQ_PREV(elm, headname, field) \ argument
799 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
801 #define TAILQ_PREV_FAST(elm, head, type, field) \ argument
802 ((elm)->field.tqe_prev == &(head)->tqh_first ? NULL : \
803 __containerof((elm)->field.tqe_prev, QUEUE_TYPEOF(type), field.tqe_next))
805 #define TAILQ_REMOVE(head, elm, field) do { \ argument
806 QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \
807 QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \
808 QMD_TAILQ_CHECK_NEXT(elm, field); \
809 QMD_TAILQ_CHECK_PREV(elm, field); \
810 if ((TAILQ_NEXT((elm), field)) != NULL) \
811 TAILQ_NEXT((elm), field)->field.tqe_prev = \
812 (elm)->field.tqe_prev; \
814 (head)->tqh_last = (elm)->field.tqe_prev; \
817 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
820 QMD_TRACE_ELEM(&(elm)->field); \