Lines Matching refs:field
170 #define SLIST_FOREACH(var, head, field) \ argument
173 (var) = SLIST_NEXT((var), field))
175 #define SLIST_FOREACH_FROM(var, head, field) \ argument
178 (var) = SLIST_NEXT((var), field))
180 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
182 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
185 #define SLIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
187 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
190 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
193 (varp) = &SLIST_NEXT((var), field))
199 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
200 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
201 SLIST_NEXT((slistelm), field) = (elm); \
204 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
205 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
209 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
211 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
212 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
214 SLIST_REMOVE_HEAD((head), field); \
218 while (SLIST_NEXT(curelm, field) != (elm)) \
219 curelm = SLIST_NEXT(curelm, field); \
220 SLIST_REMOVE_AFTER(curelm, field); \
225 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
226 SLIST_NEXT(elm, field) = \
227 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
230 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
231 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
272 #define STAILQ_FOREACH(var, head, field) \ argument
275 (var) = STAILQ_NEXT((var), field))
277 #define STAILQ_FOREACH_FROM(var, head, field) \ argument
280 (var) = STAILQ_NEXT((var), field))
282 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
284 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
287 #define STAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
289 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
297 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
298 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL) \
299 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
300 STAILQ_NEXT((tqelm), field) = (elm); \
303 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
304 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
305 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
309 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
310 STAILQ_NEXT((elm), field) = NULL; \
312 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
315 #define STAILQ_LAST(head, type, field) \ argument
316 (STAILQ_EMPTY((head)) ? NULL : __containerof((head)->stqh_last, struct type, (field).stqe_next))
318 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
320 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
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 { \ argument
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 { \ argument
342 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
381 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
383 LIST_FIRST((head))->field.le_prev != \
388 #define QMD_LIST_CHECK_NEXT(elm, field) do { \ argument
389 if (LIST_NEXT((elm), field) != NULL && \
390 LIST_NEXT((elm), field)->field.le_prev != \
391 &((elm)->field.le_next)) \
395 #define QMD_LIST_CHECK_PREV(elm, field) do { \ argument
396 if (*(elm)->field.le_prev != (elm)) \
400 #define QMD_LIST_CHECK_HEAD(head, field) argument
401 #define QMD_LIST_CHECK_NEXT(elm, field) argument
402 #define QMD_LIST_CHECK_PREV(elm, field) argument
409 #define LIST_FOREACH(var, head, field) \ argument
412 (var) = LIST_NEXT((var), field))
414 #define LIST_FOREACH_FROM(var, head, field) \ argument
417 (var) = LIST_NEXT((var), field))
419 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
421 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
424 #define LIST_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
426 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
433 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
434 QMD_LIST_CHECK_NEXT(listelm, field); \
435 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL) \
436 LIST_NEXT((listelm), field)->field.le_prev = \
437 &LIST_NEXT((elm), field); \
438 LIST_NEXT((listelm), field) = (elm); \
439 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
442 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
443 QMD_LIST_CHECK_PREV(listelm, field); \
444 (elm)->field.le_prev = (listelm)->field.le_prev; \
445 LIST_NEXT((elm), field) = (listelm); \
446 *(listelm)->field.le_prev = (elm); \
447 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
450 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
451 QMD_LIST_CHECK_HEAD((head), field); \
452 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
453 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field); \
455 (elm)->field.le_prev = &LIST_FIRST((head)); \
458 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
460 #define LIST_PREV(elm, head, type, field) \ argument
461 ((elm)->field.le_prev == &LIST_FIRST((head)) ? \
462 NULL : __containerof((elm)->(field).le_prev, struct type, (field).le_next))
464 #define LIST_REMOVE(elm, field) do { \ argument
465 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
466 QMD_SAVELINK(oldprev, (elm)->field.le_prev); \
467 QMD_LIST_CHECK_NEXT(elm, field); \
468 QMD_LIST_CHECK_PREV(elm, field); \
469 if (LIST_NEXT((elm), field) != NULL) \
470 LIST_NEXT((elm), field)->field.le_prev = \
471 (elm)->field.le_prev; \
472 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
477 #define LIST_SWAP(head1, head2, type, field) do { \ argument
482 swap_tmp->field.le_prev = &LIST_FIRST((head1)); \
484 swap_tmp->field.le_prev = &LIST_FIRST((head2)); \
511 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
513 TAILQ_FIRST((head))->field.tqe_prev != \
518 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
523 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \ argument
524 if (TAILQ_NEXT((elm), field) != NULL && \
525 TAILQ_NEXT((elm), field)->field.tqe_prev != \
526 &((elm)->field.tqe_next)) \
530 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \ argument
531 if (*(elm)->field.tqe_prev != (elm)) \
535 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
537 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
538 #define QMD_TAILQ_CHECK_PREV(elm, field) argument
541 #define TAILQ_CONCAT(head1, head2, field) do { \ argument
544 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
556 #define TAILQ_FOREACH(var, head, field) \ argument
559 (var) = TAILQ_NEXT((var), field))
561 #define TAILQ_FOREACH_FROM(var, head, field) \ argument
564 (var) = TAILQ_NEXT((var), field))
566 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
568 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
571 #define TAILQ_FOREACH_FROM_SAFE(var, head, field, tvar) \ argument
573 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
576 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
579 (var) = TAILQ_PREV((var), headname, field))
581 #define TAILQ_FOREACH_REVERSE_FROM(var, head, headname, field) \ argument
584 (var) = TAILQ_PREV((var), headname, field))
586 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
588 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
591 #define TAILQ_FOREACH_REVERSE_FROM_SAFE(var, head, headname, field, tvar) \ argument
593 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
602 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
603 QMD_TAILQ_CHECK_NEXT(listelm, field); \
604 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL) \
605 TAILQ_NEXT((elm), field)->field.tqe_prev = \
606 &TAILQ_NEXT((elm), field); \
608 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
611 TAILQ_NEXT((listelm), field) = (elm); \
612 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
613 QMD_TRACE_ELEM(&(elm)->field); \
614 QMD_TRACE_ELEM(&(listelm)->field); \
617 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
618 QMD_TAILQ_CHECK_PREV(listelm, field); \
619 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
620 TAILQ_NEXT((elm), field) = (listelm); \
621 *(listelm)->field.tqe_prev = (elm); \
622 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
623 QMD_TRACE_ELEM(&(elm)->field); \
624 QMD_TRACE_ELEM(&(listelm)->field); \
627 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
628 QMD_TAILQ_CHECK_HEAD(head, field); \
629 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
630 TAILQ_FIRST((head))->field.tqe_prev = \
631 &TAILQ_NEXT((elm), field); \
633 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
635 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
637 QMD_TRACE_ELEM(&(elm)->field); \
640 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
641 QMD_TAILQ_CHECK_TAIL(head, field); \
642 TAILQ_NEXT((elm), field) = NULL; \
643 (elm)->field.tqe_prev = (head)->tqh_last; \
645 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
647 QMD_TRACE_ELEM(&(elm)->field); \
653 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
655 #define TAILQ_PREV(elm, headname, field) \ argument
656 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
658 #define TAILQ_REMOVE(head, elm, field) do { \ argument
659 QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \
660 QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \
661 QMD_TAILQ_CHECK_NEXT(elm, field); \
662 QMD_TAILQ_CHECK_PREV(elm, field); \
663 if ((TAILQ_NEXT((elm), field)) != NULL) \
664 TAILQ_NEXT((elm), field)->field.tqe_prev = \
665 (elm)->field.tqe_prev; \
667 (head)->tqh_last = (elm)->field.tqe_prev; \
670 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
673 QMD_TRACE_ELEM(&(elm)->field); \
676 #define TAILQ_SWAP(head1, head2, type, field) do { \ argument
684 swap_first->field.tqe_prev = &(head1)->tqh_first; \
688 swap_first->field.tqe_prev = &(head2)->tqh_first; \