Lines Matching refs:elm
220 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
221 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
222 SLIST_NEXT((slistelm), field) = (elm); \
225 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
226 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
227 SLIST_FIRST((head)) = (elm); \
230 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
232 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
233 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
234 if (SLIST_FIRST((head)) == (elm)) { \
239 while (SLIST_NEXT(curelm, field) != (elm)) \
246 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
247 SLIST_NEXT(elm, field) = \
248 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
329 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
330 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
331 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
332 STAILQ_NEXT((tqelm), field) = (elm); \
335 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
336 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
337 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
338 STAILQ_FIRST((head)) = (elm); \
341 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
342 STAILQ_NEXT((elm), field) = NULL; \
343 *(head)->stqh_last = (elm); \
344 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
352 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
354 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
355 QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \
356 if (STAILQ_FIRST((head)) == (elm)) { \
361 while (STAILQ_NEXT(curelm, field) != (elm)) \
368 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
369 if ((STAILQ_NEXT(elm, field) = \
370 STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL) \
371 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
434 #define QMD_LIST_CHECK_NEXT(elm, field) do { \ argument
435 if (LIST_NEXT((elm), field) != NULL && \
436 LIST_NEXT((elm), field)->field.le_prev != \
437 &((elm)->field.le_next)) \
438 panic("Bad link elm %p next->prev != elm", (elm)); \
441 #define QMD_LIST_CHECK_PREV(elm, field) do { \ argument
442 if (*(elm)->field.le_prev != (elm)) \
443 panic("Bad link elm %p prev->next != elm", (elm)); \
447 #define QMD_LIST_CHECK_NEXT(elm, field) argument
448 #define QMD_LIST_CHECK_PREV(elm, field) argument
479 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
481 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
483 &LIST_NEXT((elm), field); \
484 LIST_NEXT((listelm), field) = (elm); \
485 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
488 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
490 (elm)->field.le_prev = (listelm)->field.le_prev; \
491 LIST_NEXT((elm), field) = (listelm); \
492 *(listelm)->field.le_prev = (elm); \
493 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
496 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
498 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
499 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
500 LIST_FIRST((head)) = (elm); \
501 (elm)->field.le_prev = &LIST_FIRST((head)); \
504 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
506 #define LIST_PREV(elm, head, type, field) \ argument
507 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
508 __containerof((elm)->field.le_prev, \
511 #define LIST_REMOVE(elm, field) do { \ argument
512 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
513 QMD_SAVELINK(oldprev, (elm)->field.le_prev); \
514 QMD_LIST_CHECK_NEXT(elm, field); \
515 QMD_LIST_CHECK_PREV(elm, field); \
516 if (LIST_NEXT((elm), field) != NULL) \
517 LIST_NEXT((elm), field)->field.le_prev = \
518 (elm)->field.le_prev; \
519 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
584 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \ argument
585 if (TAILQ_NEXT((elm), field) != NULL && \
586 TAILQ_NEXT((elm), field)->field.tqe_prev != \
587 &((elm)->field.tqe_next)) \
588 panic("Bad link elm %p next->prev != elm", (elm)); \
591 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \ argument
592 if (*(elm)->field.tqe_prev != (elm)) \
593 panic("Bad link elm %p prev->next != elm", (elm)); \
598 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
599 #define QMD_TAILQ_CHECK_PREV(elm, field) argument
663 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
665 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
666 TAILQ_NEXT((elm), field)->field.tqe_prev = \
667 &TAILQ_NEXT((elm), field); \
669 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
672 TAILQ_NEXT((listelm), field) = (elm); \
673 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
674 QMD_TRACE_ELEM(&(elm)->field); \
678 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
680 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
681 TAILQ_NEXT((elm), field) = (listelm); \
682 *(listelm)->field.tqe_prev = (elm); \
683 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
684 QMD_TRACE_ELEM(&(elm)->field); \
688 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
690 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
692 &TAILQ_NEXT((elm), field); \
694 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
695 TAILQ_FIRST((head)) = (elm); \
696 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
698 QMD_TRACE_ELEM(&(elm)->field); \
701 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
703 TAILQ_NEXT((elm), field) = NULL; \
704 (elm)->field.tqe_prev = (head)->tqh_last; \
705 *(head)->tqh_last = (elm); \
706 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
708 QMD_TRACE_ELEM(&(elm)->field); \
714 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
716 #define TAILQ_PREV(elm, headname, field) \ argument
717 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
719 #define TAILQ_REMOVE(head, elm, field) do { \ argument
720 QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \
721 QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \
722 QMD_TAILQ_CHECK_NEXT(elm, field); \
723 QMD_TAILQ_CHECK_PREV(elm, field); \
724 if ((TAILQ_NEXT((elm), field)) != NULL) \
725 TAILQ_NEXT((elm), field)->field.tqe_prev = \
726 (elm)->field.tqe_prev; \
728 (head)->tqh_last = (elm)->field.tqe_prev; \
731 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
734 QMD_TRACE_ELEM(&(elm)->field); \