Lines Matching refs:field
190 #define SLIST_CONCAT(head1, head2, type, field) do { \ argument
196 while (SLIST_NEXT(curelm, field) != NULL) \
197 curelm = SLIST_NEXT(curelm, field); \
198 SLIST_NEXT(curelm, field) = SLIST_FIRST(head2); \
207 #define SLIST_FOREACH(var, head, field) \ argument
210 (var) = SLIST_NEXT((var), field))
212 #define SLIST_FOREACH_FROM(var, head, field) \ argument
215 (var) = SLIST_NEXT((var), field))
217 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
219 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
222 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
224 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
227 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
230 (varp) = &SLIST_NEXT((var), field))
236 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
237 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
238 SLIST_NEXT((slistelm), field) = (elm); \
241 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
242 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
246 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
248 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
249 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
251 SLIST_REMOVE_HEAD((head), field); \
255 while (SLIST_NEXT(curelm, field) != (elm)) \
256 curelm = SLIST_NEXT(curelm, field); \
257 SLIST_REMOVE_AFTER(curelm, field); \
262 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
263 SLIST_NEXT(elm, field) = \
264 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
267 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
268 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
320 #define STAILQ_FOREACH(var, head, field) \ argument
323 (var) = STAILQ_NEXT((var), field))
325 #define STAILQ_FOREACH_FROM(var, head, field) \ argument
328 (var) = STAILQ_NEXT((var), field))
330 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
332 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
335 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
337 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
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); \
357 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
358 STAILQ_NEXT((elm), field) = NULL; \
360 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
363 #define STAILQ_LAST(head, type, field) \ argument
366 QUEUE_TYPEOF(type), field.stqe_next))
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); \
373 STAILQ_REMOVE_HEAD((head), field); \
377 while (STAILQ_NEXT(curelm, field) != (elm)) \
378 curelm = STAILQ_NEXT(curelm, field); \
379 STAILQ_REMOVE_AFTER(head, curelm, field); \
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); \
390 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
392 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
443 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
445 LIST_FIRST((head))->field.le_prev != \
450 #define QMD_LIST_CHECK_NEXT(elm, field) do { \ argument
451 if (LIST_NEXT((elm), field) != NULL && \
452 LIST_NEXT((elm), field)->field.le_prev != \
453 &((elm)->field.le_next)) \
457 #define QMD_LIST_CHECK_PREV(elm, field) do { \ argument
458 if (*(elm)->field.le_prev != (elm)) \
462 #define QMD_LIST_CHECK_HEAD(head, field) argument
463 #define QMD_LIST_CHECK_NEXT(elm, field) argument
464 #define QMD_LIST_CHECK_PREV(elm, field) argument
467 #define LIST_CONCAT(head1, head2, type, field) do { \ argument
471 LIST_FIRST(head2)->field.le_prev = \
476 while (LIST_NEXT(curelm, field) != NULL) \
477 curelm = LIST_NEXT(curelm, field); \
478 LIST_NEXT(curelm, field) = LIST_FIRST(head2); \
479 LIST_FIRST(head2)->field.le_prev = &LIST_NEXT(curelm, field); \
488 #define LIST_FOREACH(var, head, field) \ argument
491 (var) = LIST_NEXT((var), field))
493 #define LIST_FOREACH_FROM(var, head, field) \ argument
496 (var) = LIST_NEXT((var), field))
498 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
500 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
503 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
505 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
512 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
513 QMD_LIST_CHECK_NEXT(listelm, field); \
514 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
515 LIST_NEXT((listelm), field)->field.le_prev = \
516 &LIST_NEXT((elm), field); \
517 LIST_NEXT((listelm), field) = (elm); \
518 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
521 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
522 QMD_LIST_CHECK_PREV(listelm, field); \
523 (elm)->field.le_prev = (listelm)->field.le_prev; \
524 LIST_NEXT((elm), field) = (listelm); \
525 *(listelm)->field.le_prev = (elm); \
526 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
529 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
530 QMD_LIST_CHECK_HEAD((head), field); \
531 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
532 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
534 (elm)->field.le_prev = &LIST_FIRST((head)); \
537 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
539 #define LIST_PREV(elm, head, type, field) \ argument
540 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
541 __containerof((elm)->field.le_prev, \
542 QUEUE_TYPEOF(type), field.le_next))
544 #define LIST_REMOVE(elm, field) do { \ argument
545 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
546 QMD_SAVELINK(oldprev, (elm)->field.le_prev); \
547 QMD_LIST_CHECK_NEXT(elm, field); \
548 QMD_LIST_CHECK_PREV(elm, field); \
549 if (LIST_NEXT((elm), field) != NULL) \
550 LIST_NEXT((elm), field)->field.le_prev = \
551 (elm)->field.le_prev; \
552 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
557 #define LIST_SWAP(head1, head2, type, field) do { \ argument
562 swap_tmp->field.le_prev = &LIST_FIRST((head1)); \
564 swap_tmp->field.le_prev = &LIST_FIRST((head2)); \
605 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
607 TAILQ_FIRST((head))->field.tqe_prev != \
612 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
617 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \ argument
618 if (TAILQ_NEXT((elm), field) != NULL && \
619 TAILQ_NEXT((elm), field)->field.tqe_prev != \
620 &((elm)->field.tqe_next)) \
624 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \ argument
625 if (*(elm)->field.tqe_prev != (elm)) \
629 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
631 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
632 #define QMD_TAILQ_CHECK_PREV(elm, field) argument
635 #define TAILQ_CONCAT(head1, head2, field) do { \ argument
638 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
650 #define TAILQ_FOREACH(var, head, field) \ argument
653 (var) = TAILQ_NEXT((var), field))
655 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
658 (var) = TAILQ_NEXT((var), field))
660 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
662 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
665 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
667 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
670 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
673 (var) = TAILQ_PREV((var), headname, field))
675 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
678 (var) = TAILQ_PREV((var), headname, field))
680 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
682 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
685 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \ argument
687 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
696 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
697 QMD_TAILQ_CHECK_NEXT(listelm, field); \
698 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
699 TAILQ_NEXT((elm), field)->field.tqe_prev = \
700 &TAILQ_NEXT((elm), field); \
702 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
705 TAILQ_NEXT((listelm), field) = (elm); \
706 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
707 QMD_TRACE_ELEM(&(elm)->field); \
708 QMD_TRACE_ELEM(&(listelm)->field); \
711 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
712 QMD_TAILQ_CHECK_PREV(listelm, field); \
713 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
714 TAILQ_NEXT((elm), field) = (listelm); \
715 *(listelm)->field.tqe_prev = (elm); \
716 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
717 QMD_TRACE_ELEM(&(elm)->field); \
718 QMD_TRACE_ELEM(&(listelm)->field); \
721 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
722 QMD_TAILQ_CHECK_HEAD(head, field); \
723 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
724 TAILQ_FIRST((head))->field.tqe_prev = \
725 &TAILQ_NEXT((elm), field); \
727 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
729 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
731 QMD_TRACE_ELEM(&(elm)->field); \
734 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
735 QMD_TAILQ_CHECK_TAIL(head, field); \
736 TAILQ_NEXT((elm), field) = NULL; \
737 (elm)->field.tqe_prev = (head)->tqh_last; \
739 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
741 QMD_TRACE_ELEM(&(elm)->field); \
747 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
749 #define TAILQ_PREV(elm, headname, field) \ argument
750 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
752 #define TAILQ_REMOVE(head, elm, field) do { \ argument
753 QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \
754 QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \
755 QMD_TAILQ_CHECK_NEXT(elm, field); \
756 QMD_TAILQ_CHECK_PREV(elm, field); \
757 if ((TAILQ_NEXT((elm), field)) != NULL) \
758 TAILQ_NEXT((elm), field)->field.tqe_prev = \
759 (elm)->field.tqe_prev; \
761 (head)->tqh_last = (elm)->field.tqe_prev; \
764 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
767 QMD_TRACE_ELEM(&(elm)->field); \
770 #define TAILQ_SWAP(head1, head2, type, field) do { \ argument
778 swap_first->field.tqe_prev = &(head1)->tqh_first; \
782 swap_first->field.tqe_prev = &(head2)->tqh_first; \