Lines Matching refs:field
169 #define SLIST_FOREACH(var, head, field) \
172 (var) = SLIST_NEXT((var), field))
174 #define SLIST_FOREACH_FROM(var, head, field) \
177 (var) = SLIST_NEXT((var), field))
179 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
181 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
184 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \
186 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
189 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
192 (varp) = &SLIST_NEXT((var), field))
198 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
199 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
200 SLIST_NEXT((slistelm), field) = (elm); \
203 #define SLIST_INSERT_HEAD(head, elm, field) do { \
204 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
208 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
210 #define SLIST_REMOVE(head, elm, type, field) do { \
211 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
213 SLIST_REMOVE_HEAD((head), field); \
217 while (SLIST_NEXT(curelm, field) != (elm)) \
218 curelm = SLIST_NEXT(curelm, field); \
219 SLIST_REMOVE_AFTER(curelm, field); \
224 #define SLIST_REMOVE_AFTER(elm, field) do { \
225 SLIST_NEXT(elm, field) = \
226 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
229 #define SLIST_REMOVE_HEAD(head, field) do { \
230 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
271 #define STAILQ_FOREACH(var, head, field) \
274 (var) = STAILQ_NEXT((var), field))
276 #define STAILQ_FOREACH_FROM(var, head, field) \
279 (var) = STAILQ_NEXT((var), field))
281 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
283 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
286 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \
288 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
296 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
297 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
298 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
299 STAILQ_NEXT((tqelm), field) = (elm); \
302 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
303 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
304 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
308 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
309 STAILQ_NEXT((elm), field) = NULL; \
311 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
314 #define STAILQ_LAST(head, type, field) \
316 __containerof((head)->stqh_last, struct type, field.stqe_next))
318 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)
320 #define STAILQ_REMOVE(head, elm, type, field) do { \
321 QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \
323 STAILQ_REMOVE_HEAD((head), field); \
327 while (STAILQ_NEXT(curelm, field) != (elm)) \
328 curelm = STAILQ_NEXT(curelm, field); \
329 STAILQ_REMOVE_AFTER(head, curelm, field); \
334 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \
335 if ((STAILQ_NEXT(elm, field) = \
336 STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL) \
337 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
340 #define STAILQ_REMOVE_HEAD(head, field) do { \
342 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
382 #define QMD_LIST_CHECK_HEAD(head, field) do { \
384 LIST_FIRST((head))->field.le_prev != \
389 #define QMD_LIST_CHECK_NEXT(elm, field) do { \
390 if (LIST_NEXT((elm), field) != NULL && \
391 LIST_NEXT((elm), field)->field.le_prev != \
392 &((elm)->field.le_next)) \
396 #define QMD_LIST_CHECK_PREV(elm, field) do { \
397 if (*(elm)->field.le_prev != (elm)) \
401 #define QMD_LIST_CHECK_HEAD(head, field)
402 #define QMD_LIST_CHECK_NEXT(elm, field)
403 #define QMD_LIST_CHECK_PREV(elm, field)
410 #define LIST_FOREACH(var, head, field) \
413 (var) = LIST_NEXT((var), field))
415 #define LIST_FOREACH_FROM(var, head, field) \
418 (var) = LIST_NEXT((var), field))
420 #define LIST_FOREACH_SAFE(var, head, field, tvar) \
422 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
425 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \
427 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
434 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
435 QMD_LIST_CHECK_NEXT(listelm, field); \
436 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
437 LIST_NEXT((listelm), field)->field.le_prev = \
438 &LIST_NEXT((elm), field); \
439 LIST_NEXT((listelm), field) = (elm); \
440 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
443 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
444 QMD_LIST_CHECK_PREV(listelm, field); \
445 (elm)->field.le_prev = (listelm)->field.le_prev; \
446 LIST_NEXT((elm), field) = (listelm); \
447 *(listelm)->field.le_prev = (elm); \
448 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
451 #define LIST_INSERT_HEAD(head, elm, field) do { \
452 QMD_LIST_CHECK_HEAD((head), field); \
453 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
454 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
456 (elm)->field.le_prev = &LIST_FIRST((head)); \
459 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
461 #define LIST_PREV(elm, head, type, field) \
462 ((elm)->field.le_prev == &LIST_FIRST((head)) ? NULL : \
463 __containerof((elm)->field.le_prev, struct type, field.le_next))
465 #define LIST_REMOVE(elm, field) do { \
466 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
467 QMD_SAVELINK(oldprev, (elm)->field.le_prev); \
468 QMD_LIST_CHECK_NEXT(elm, field); \
469 QMD_LIST_CHECK_PREV(elm, field); \
470 if (LIST_NEXT((elm), field) != NULL) \
471 LIST_NEXT((elm), field)->field.le_prev = \
472 (elm)->field.le_prev; \
473 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
478 #define LIST_SWAP(head1, head2, type, field) do { \
483 swap_tmp->field.le_prev = &LIST_FIRST((head1)); \
485 swap_tmp->field.le_prev = &LIST_FIRST((head2)); \
512 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \
514 TAILQ_FIRST((head))->field.tqe_prev != \
519 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \
524 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \
525 if (TAILQ_NEXT((elm), field) != NULL && \
526 TAILQ_NEXT((elm), field)->field.tqe_prev != \
527 &((elm)->field.tqe_next)) \
531 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \
532 if (*(elm)->field.tqe_prev != (elm)) \
536 #define QMD_TAILQ_CHECK_HEAD(head, field)
538 #define QMD_TAILQ_CHECK_NEXT(elm, field)
539 #define QMD_TAILQ_CHECK_PREV(elm, field)
542 #define TAILQ_CONCAT(head1, head2, field) do { \
545 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
557 #define TAILQ_FOREACH(var, head, field) \
560 (var) = TAILQ_NEXT((var), field))
562 #define TAILQ_FOREACH_FROM(var, head, field) \
565 (var) = TAILQ_NEXT((var), field))
567 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
569 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
572 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \
574 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
577 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
580 (var) = TAILQ_PREV((var), headname, field))
582 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \
585 (var) = TAILQ_PREV((var), headname, field))
587 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
589 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
592 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \
594 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
603 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
604 QMD_TAILQ_CHECK_NEXT(listelm, field); \
605 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
606 TAILQ_NEXT((elm), field)->field.tqe_prev = \
607 &TAILQ_NEXT((elm), field); \
609 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
612 TAILQ_NEXT((listelm), field) = (elm); \
613 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
614 QMD_TRACE_ELEM(&(elm)->field); \
615 QMD_TRACE_ELEM(&listelm->field); \
618 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
619 QMD_TAILQ_CHECK_PREV(listelm, field); \
620 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
621 TAILQ_NEXT((elm), field) = (listelm); \
622 *(listelm)->field.tqe_prev = (elm); \
623 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
624 QMD_TRACE_ELEM(&(elm)->field); \
625 QMD_TRACE_ELEM(&listelm->field); \
628 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
629 QMD_TAILQ_CHECK_HEAD(head, field); \
630 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
631 TAILQ_FIRST((head))->field.tqe_prev = \
632 &TAILQ_NEXT((elm), field); \
634 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
636 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
638 QMD_TRACE_ELEM(&(elm)->field); \
641 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
642 QMD_TAILQ_CHECK_TAIL(head, field); \
643 TAILQ_NEXT((elm), field) = NULL; \
644 (elm)->field.tqe_prev = (head)->tqh_last; \
646 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
648 QMD_TRACE_ELEM(&(elm)->field); \
654 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
656 #define TAILQ_PREV(elm, headname, field) \
657 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
659 #define TAILQ_REMOVE(head, elm, field) do { \
660 QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \
661 QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \
662 QMD_TAILQ_CHECK_NEXT(elm, field); \
663 QMD_TAILQ_CHECK_PREV(elm, field); \
664 if ((TAILQ_NEXT((elm), field)) != NULL) \
665 TAILQ_NEXT((elm), field)->field.tqe_prev = \
666 (elm)->field.tqe_prev; \
668 (head)->tqh_last = (elm)->field.tqe_prev; \
671 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
674 QMD_TRACE_ELEM(&(elm)->field); \
677 #define TAILQ_SWAP(head1, head2, type, field) do { \
685 swap_first->field.tqe_prev = &(head1)->tqh_first; \
689 swap_first->field.tqe_prev = &(head2)->tqh_first; \