Lines Matching refs:field
191 #define SLIST_FOREACH(var, head, field) \ argument
194 (var) = SLIST_NEXT((var), field))
196 #define SLIST_FOREACH_FROM(var, head, field) \ argument
199 (var) = SLIST_NEXT((var), field))
201 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
203 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
206 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
208 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
211 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
214 (varp) = &SLIST_NEXT((var), field))
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)); \
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); \
235 SLIST_REMOVE_HEAD((head), field); \
239 while (SLIST_NEXT(curelm, field) != (elm)) \
240 curelm = SLIST_NEXT(curelm, field); \
241 SLIST_REMOVE_AFTER(curelm, field); \
246 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
247 SLIST_NEXT(elm, field) = \
248 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
251 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
252 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
304 #define STAILQ_FOREACH(var, head, field) \ argument
307 (var) = STAILQ_NEXT((var), field))
309 #define STAILQ_FOREACH_FROM(var, head, field) \ argument
312 (var) = STAILQ_NEXT((var), field))
314 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
316 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
319 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
321 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
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); \
341 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
342 STAILQ_NEXT((elm), field) = NULL; \
344 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
347 #define STAILQ_LAST(head, type, field) \ argument
350 QUEUE_TYPEOF(type), field.stqe_next))
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); \
357 STAILQ_REMOVE_HEAD((head), field); \
361 while (STAILQ_NEXT(curelm, field) != (elm)) \
362 curelm = STAILQ_NEXT(curelm, field); \
363 STAILQ_REMOVE_AFTER(head, curelm, field); \
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); \
374 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
376 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
427 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
429 LIST_FIRST((head))->field.le_prev != \
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)) \
441 #define QMD_LIST_CHECK_PREV(elm, field) do { \ argument
442 if (*(elm)->field.le_prev != (elm)) \
446 #define QMD_LIST_CHECK_HEAD(head, field) argument
447 #define QMD_LIST_CHECK_NEXT(elm, field) argument
448 #define QMD_LIST_CHECK_PREV(elm, field) argument
455 #define LIST_FOREACH(var, head, field) \ argument
458 (var) = LIST_NEXT((var), field))
460 #define LIST_FOREACH_FROM(var, head, field) \ argument
463 (var) = LIST_NEXT((var), field))
465 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
467 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
470 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
472 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
479 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
480 QMD_LIST_CHECK_NEXT(listelm, field); \
481 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
482 LIST_NEXT((listelm), field)->field.le_prev = \
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
489 QMD_LIST_CHECK_PREV(listelm, field); \
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
497 QMD_LIST_CHECK_HEAD((head), field); \
498 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
499 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
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, \
509 QUEUE_TYPEOF(type), field.le_next))
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); \
524 #define LIST_SWAP(head1, head2, type, field) do { \ argument
529 swap_tmp->field.le_prev = &LIST_FIRST((head1)); \
531 swap_tmp->field.le_prev = &LIST_FIRST((head2)); \
572 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
574 TAILQ_FIRST((head))->field.tqe_prev != \
579 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
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)) \
591 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \ argument
592 if (*(elm)->field.tqe_prev != (elm)) \
596 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
598 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
599 #define QMD_TAILQ_CHECK_PREV(elm, field) argument
602 #define TAILQ_CONCAT(head1, head2, field) do { \ argument
605 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
617 #define TAILQ_FOREACH(var, head, field) \ argument
620 (var) = TAILQ_NEXT((var), field))
622 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
625 (var) = TAILQ_NEXT((var), field))
627 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
629 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
632 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
634 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
637 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
640 (var) = TAILQ_PREV((var), headname, field))
642 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
645 (var) = TAILQ_PREV((var), headname, field))
647 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
649 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
652 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \ argument
654 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
663 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
664 QMD_TAILQ_CHECK_NEXT(listelm, field); \
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); \
675 QMD_TRACE_ELEM(&(listelm)->field); \
678 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
679 QMD_TAILQ_CHECK_PREV(listelm, field); \
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); \
685 QMD_TRACE_ELEM(&(listelm)->field); \
688 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
689 QMD_TAILQ_CHECK_HEAD(head, field); \
690 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
691 TAILQ_FIRST((head))->field.tqe_prev = \
692 &TAILQ_NEXT((elm), field); \
694 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
696 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
698 QMD_TRACE_ELEM(&(elm)->field); \
701 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
702 QMD_TAILQ_CHECK_TAIL(head, field); \
703 TAILQ_NEXT((elm), field) = NULL; \
704 (elm)->field.tqe_prev = (head)->tqh_last; \
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); \
737 #define TAILQ_SWAP(head1, head2, type, field) do { \ argument
745 swap_first->field.tqe_prev = &(head1)->tqh_first; \
749 swap_first->field.tqe_prev = &(head2)->tqh_first; \