Lines Matching refs:field
185 #define SLIST_CONCAT(head1, head2, type, field) do { \ argument
191 while (SLIST_NEXT(curelm, field) != NULL) \
192 curelm = SLIST_NEXT(curelm, field); \
193 SLIST_NEXT(curelm, field) = SLIST_FIRST(head2); \
202 #define SLIST_FOREACH(var, head, field) \ argument
205 (var) = SLIST_NEXT((var), field))
207 #define SLIST_FOREACH_FROM(var, head, field) \ argument
210 (var) = SLIST_NEXT((var), field))
212 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
214 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
217 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
219 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
222 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
225 (varp) = &SLIST_NEXT((var), field))
231 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
232 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
233 SLIST_NEXT((slistelm), field) = (elm); \
236 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
237 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
241 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
243 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
244 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
246 SLIST_REMOVE_HEAD((head), field); \
250 while (SLIST_NEXT(curelm, field) != (elm)) \
251 curelm = SLIST_NEXT(curelm, field); \
252 SLIST_REMOVE_AFTER(curelm, field); \
257 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
258 SLIST_NEXT(elm, field) = \
259 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
262 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
263 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
266 #define SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \ argument
268 *(prevp) = SLIST_NEXT(elm, field); \
269 TRASHIT((elm)->field.sle_next); \
321 #define STAILQ_FOREACH(var, head, field) \ argument
324 (var) = STAILQ_NEXT((var), field))
326 #define STAILQ_FOREACH_FROM(var, head, field) \ argument
329 (var) = STAILQ_NEXT((var), field))
331 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
333 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
336 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
338 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
346 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
347 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
348 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
349 STAILQ_NEXT((tqelm), field) = (elm); \
352 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
353 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
354 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
358 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
359 STAILQ_NEXT((elm), field) = NULL; \
361 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
364 #define STAILQ_LAST(head, type, field) \ argument
367 QUEUE_TYPEOF(type), field.stqe_next))
369 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
371 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
372 QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \
374 STAILQ_REMOVE_HEAD((head), field); \
378 while (STAILQ_NEXT(curelm, field) != (elm)) \
379 curelm = STAILQ_NEXT(curelm, field); \
380 STAILQ_REMOVE_AFTER(head, curelm, field); \
385 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
386 if ((STAILQ_NEXT(elm, field) = \
387 STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL) \
388 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
391 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
393 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
450 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
452 LIST_FIRST((head))->field.le_prev != \
463 #define QMD_LIST_CHECK_NEXT(elm, field) do { \ argument
464 if (LIST_NEXT((elm), field) != NULL && \
465 LIST_NEXT((elm), field)->field.le_prev != \
466 &((elm)->field.le_next)) \
475 #define QMD_LIST_CHECK_PREV(elm, field) do { \ argument
476 if (*(elm)->field.le_prev != (elm)) \
480 #define QMD_LIST_CHECK_HEAD(head, field) argument
481 #define QMD_LIST_CHECK_NEXT(elm, field) argument
482 #define QMD_LIST_CHECK_PREV(elm, field) argument
485 #define LIST_CONCAT(head1, head2, type, field) do { \ argument
489 LIST_FIRST(head2)->field.le_prev = \
494 while (LIST_NEXT(curelm, field) != NULL) \
495 curelm = LIST_NEXT(curelm, field); \
496 LIST_NEXT(curelm, field) = LIST_FIRST(head2); \
497 LIST_FIRST(head2)->field.le_prev = &LIST_NEXT(curelm, field); \
506 #define LIST_FOREACH(var, head, field) \ argument
509 (var) = LIST_NEXT((var), field))
511 #define LIST_FOREACH_FROM(var, head, field) \ argument
514 (var) = LIST_NEXT((var), field))
516 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
518 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
521 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
523 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
530 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
531 QMD_LIST_CHECK_NEXT(listelm, field); \
532 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
533 LIST_NEXT((listelm), field)->field.le_prev = \
534 &LIST_NEXT((elm), field); \
535 LIST_NEXT((listelm), field) = (elm); \
536 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
539 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
540 QMD_LIST_CHECK_PREV(listelm, field); \
541 (elm)->field.le_prev = (listelm)->field.le_prev; \
542 LIST_NEXT((elm), field) = (listelm); \
543 *(listelm)->field.le_prev = (elm); \
544 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
547 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
548 QMD_LIST_CHECK_HEAD((head), field); \
549 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
550 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
552 (elm)->field.le_prev = &LIST_FIRST((head)); \
555 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
557 #define LIST_PREV(elm, head, type, field) \ argument
558 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
559 __containerof((elm)->field.le_prev, \
560 QUEUE_TYPEOF(type), field.le_next))
562 #define LIST_REMOVE(elm, field) do { \ argument
563 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
564 QMD_SAVELINK(oldprev, (elm)->field.le_prev); \
565 QMD_LIST_CHECK_NEXT(elm, field); \
566 QMD_LIST_CHECK_PREV(elm, field); \
567 if (LIST_NEXT((elm), field) != NULL) \
568 LIST_NEXT((elm), field)->field.le_prev = \
569 (elm)->field.le_prev; \
570 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
575 #define LIST_SWAP(head1, head2, type, field) do { \ argument
580 swap_tmp->field.le_prev = &LIST_FIRST((head1)); \
582 swap_tmp->field.le_prev = &LIST_FIRST((head2)); \
629 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
631 TAILQ_FIRST((head))->field.tqe_prev != \
641 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
652 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \ argument
653 if (TAILQ_NEXT((elm), field) != NULL && \
654 TAILQ_NEXT((elm), field)->field.tqe_prev != \
655 &((elm)->field.tqe_next)) \
664 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \ argument
665 if (*(elm)->field.tqe_prev != (elm)) \
669 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
671 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
672 #define QMD_TAILQ_CHECK_PREV(elm, field) argument
675 #define TAILQ_CONCAT(head1, head2, field) do { \ argument
678 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
690 #define TAILQ_FOREACH(var, head, field) \ argument
693 (var) = TAILQ_NEXT((var), field))
695 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
698 (var) = TAILQ_NEXT((var), field))
700 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
702 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
705 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
707 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
710 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
713 (var) = TAILQ_PREV((var), headname, field))
715 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
718 (var) = TAILQ_PREV((var), headname, field))
720 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
722 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
725 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \ argument
727 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
736 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
737 QMD_TAILQ_CHECK_NEXT(listelm, field); \
738 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
739 TAILQ_NEXT((elm), field)->field.tqe_prev = \
740 &TAILQ_NEXT((elm), field); \
742 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
745 TAILQ_NEXT((listelm), field) = (elm); \
746 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
747 QMD_TRACE_ELEM(&(elm)->field); \
748 QMD_TRACE_ELEM(&(listelm)->field); \
751 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
752 QMD_TAILQ_CHECK_PREV(listelm, field); \
753 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
754 TAILQ_NEXT((elm), field) = (listelm); \
755 *(listelm)->field.tqe_prev = (elm); \
756 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
757 QMD_TRACE_ELEM(&(elm)->field); \
758 QMD_TRACE_ELEM(&(listelm)->field); \
761 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
762 QMD_TAILQ_CHECK_HEAD(head, field); \
763 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
764 TAILQ_FIRST((head))->field.tqe_prev = \
765 &TAILQ_NEXT((elm), field); \
767 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
769 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
771 QMD_TRACE_ELEM(&(elm)->field); \
774 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
775 QMD_TAILQ_CHECK_TAIL(head, field); \
776 TAILQ_NEXT((elm), field) = NULL; \
777 (elm)->field.tqe_prev = (head)->tqh_last; \
779 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
781 QMD_TRACE_ELEM(&(elm)->field); \
794 #define TAILQ_LAST_FAST(head, type, field) \ argument
795 (TAILQ_EMPTY(head) ? NULL : __containerof((head)->tqh_last, QUEUE_TYPEOF(type), field.tqe_next))
797 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
799 #define TAILQ_PREV(elm, headname, field) \ argument
800 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
802 #define TAILQ_PREV_FAST(elm, head, type, field) \ argument
803 ((elm)->field.tqe_prev == &(head)->tqh_first ? NULL : \
804 __containerof((elm)->field.tqe_prev, QUEUE_TYPEOF(type), field.tqe_next))
806 #define TAILQ_REMOVE(head, elm, field) do { \ argument
807 QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \
808 QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \
809 QMD_TAILQ_CHECK_NEXT(elm, field); \
810 QMD_TAILQ_CHECK_PREV(elm, field); \
811 if ((TAILQ_NEXT((elm), field)) != NULL) \
812 TAILQ_NEXT((elm), field)->field.tqe_prev = \
813 (elm)->field.tqe_prev; \
815 (head)->tqh_last = (elm)->field.tqe_prev; \
818 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
821 QMD_TRACE_ELEM(&(elm)->field); \
824 #define TAILQ_SWAP(head1, head2, type, field) do { \ argument
832 swap_first->field.tqe_prev = &(head1)->tqh_first; \
836 swap_first->field.tqe_prev = &(head2)->tqh_first; \