Lines Matching refs:field
163 #define SLIST_FOREACH(var, head, field) \ argument
166 (var) = SLIST_NEXT((var), field))
168 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
170 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
173 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
176 (varp) = &SLIST_NEXT((var), field))
182 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
183 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
184 SLIST_NEXT((slistelm), field) = (elm); \
187 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
188 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
192 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
194 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
195 QMD_SAVELINK(oldnext, (elm)->field.sle_next); \
197 SLIST_REMOVE_HEAD((head), field); \
201 while (SLIST_NEXT(curelm, field) != (elm)) \
202 curelm = SLIST_NEXT(curelm, field); \
203 SLIST_REMOVE_AFTER(curelm, field); \
208 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
209 SLIST_NEXT(elm, field) = \
210 SLIST_NEXT(SLIST_NEXT(elm, field), field); \
213 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
214 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
255 #define STAILQ_FOREACH(var, head, field) \ argument
258 (var) = STAILQ_NEXT((var), field))
261 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
263 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
271 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
272 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
273 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
274 STAILQ_NEXT((tqelm), field) = (elm); \
277 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
278 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
279 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
283 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
284 STAILQ_NEXT((elm), field) = NULL; \
286 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
289 #define STAILQ_LAST(head, type, field) \ argument
293 ((char *)((head)->stqh_last) - __offsetof(struct type, field))))
295 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
297 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
298 QMD_SAVELINK(oldnext, (elm)->field.stqe_next); \
300 STAILQ_REMOVE_HEAD((head), field); \
304 while (STAILQ_NEXT(curelm, field) != (elm)) \
305 curelm = STAILQ_NEXT(curelm, field); \
306 STAILQ_REMOVE_AFTER(head, curelm, field); \
311 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
312 if ((STAILQ_NEXT(elm, field) = \
313 STAILQ_NEXT(STAILQ_NEXT(elm, field), field)) == NULL) \
314 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
317 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
319 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
359 #define QMD_LIST_CHECK_HEAD(head, field) do { \ argument
361 LIST_FIRST((head))->field.le_prev != \
366 #define QMD_LIST_CHECK_NEXT(elm, field) do { \ argument
367 if (LIST_NEXT((elm), field) != NULL && \
368 LIST_NEXT((elm), field)->field.le_prev != \
369 &((elm)->field.le_next)) \
373 #define QMD_LIST_CHECK_PREV(elm, field) do { \ argument
374 if (*(elm)->field.le_prev != (elm)) \
378 #define QMD_LIST_CHECK_HEAD(head, field) argument
379 #define QMD_LIST_CHECK_NEXT(elm, field) argument
380 #define QMD_LIST_CHECK_PREV(elm, field) argument
387 #define LIST_FOREACH(var, head, field) \ argument
390 (var) = LIST_NEXT((var), field))
392 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
394 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
401 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
402 QMD_LIST_CHECK_NEXT(listelm, field); \
403 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
404 LIST_NEXT((listelm), field)->field.le_prev = \
405 &LIST_NEXT((elm), field); \
406 LIST_NEXT((listelm), field) = (elm); \
407 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
410 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
411 QMD_LIST_CHECK_PREV(listelm, field); \
412 (elm)->field.le_prev = (listelm)->field.le_prev; \
413 LIST_NEXT((elm), field) = (listelm); \
414 *(listelm)->field.le_prev = (elm); \
415 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
418 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
419 QMD_LIST_CHECK_HEAD((head), field); \
420 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
421 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
423 (elm)->field.le_prev = &LIST_FIRST((head)); \
426 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
428 #define LIST_REMOVE(elm, field) do { \ argument
429 QMD_SAVELINK(oldnext, (elm)->field.le_next); \
430 QMD_SAVELINK(oldprev, (elm)->field.le_prev); \
431 QMD_LIST_CHECK_NEXT(elm, field); \
432 QMD_LIST_CHECK_PREV(elm, field); \
433 if (LIST_NEXT((elm), field) != NULL) \
434 LIST_NEXT((elm), field)->field.le_prev = \
435 (elm)->field.le_prev; \
436 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
441 #define LIST_SWAP(head1, head2, type, field) do { \ argument
446 swap_tmp->field.le_prev = &LIST_FIRST((head1)); \
448 swap_tmp->field.le_prev = &LIST_FIRST((head2)); \
475 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \ argument
477 TAILQ_FIRST((head))->field.tqe_prev != \
482 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \ argument
487 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \ argument
488 if (TAILQ_NEXT((elm), field) != NULL && \
489 TAILQ_NEXT((elm), field)->field.tqe_prev != \
490 &((elm)->field.tqe_next)) \
494 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \ argument
495 if (*(elm)->field.tqe_prev != (elm)) \
499 #define QMD_TAILQ_CHECK_HEAD(head, field) argument
501 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
502 #define QMD_TAILQ_CHECK_PREV(elm, field) argument
505 #define TAILQ_CONCAT(head1, head2, field) do { \ argument
508 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
520 #define TAILQ_FOREACH(var, head, field) \ argument
523 (var) = TAILQ_NEXT((var), field))
525 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
527 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
530 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
533 (var) = TAILQ_PREV((var), headname, field))
535 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
537 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
546 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
547 QMD_TAILQ_CHECK_NEXT(listelm, field); \
548 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
549 TAILQ_NEXT((elm), field)->field.tqe_prev = \
550 &TAILQ_NEXT((elm), field); \
552 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
555 TAILQ_NEXT((listelm), field) = (elm); \
556 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
557 QMD_TRACE_ELEM(&(elm)->field); \
558 QMD_TRACE_ELEM(&listelm->field); \
561 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
562 QMD_TAILQ_CHECK_PREV(listelm, field); \
563 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
564 TAILQ_NEXT((elm), field) = (listelm); \
565 *(listelm)->field.tqe_prev = (elm); \
566 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
567 QMD_TRACE_ELEM(&(elm)->field); \
568 QMD_TRACE_ELEM(&listelm->field); \
571 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
572 QMD_TAILQ_CHECK_HEAD(head, field); \
573 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
574 TAILQ_FIRST((head))->field.tqe_prev = \
575 &TAILQ_NEXT((elm), field); \
577 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
579 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
581 QMD_TRACE_ELEM(&(elm)->field); \
584 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
585 QMD_TAILQ_CHECK_TAIL(head, field); \
586 TAILQ_NEXT((elm), field) = NULL; \
587 (elm)->field.tqe_prev = (head)->tqh_last; \
589 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
591 QMD_TRACE_ELEM(&(elm)->field); \
597 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
599 #define TAILQ_PREV(elm, headname, field) \ argument
600 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
602 #define TAILQ_REMOVE(head, elm, field) do { \ argument
603 QMD_SAVELINK(oldnext, (elm)->field.tqe_next); \
604 QMD_SAVELINK(oldprev, (elm)->field.tqe_prev); \
605 QMD_TAILQ_CHECK_NEXT(elm, field); \
606 QMD_TAILQ_CHECK_PREV(elm, field); \
607 if ((TAILQ_NEXT((elm), field)) != NULL) \
608 TAILQ_NEXT((elm), field)->field.tqe_prev = \
609 (elm)->field.tqe_prev; \
611 (head)->tqh_last = (elm)->field.tqe_prev; \
614 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
617 QMD_TRACE_ELEM(&(elm)->field); \
620 #define TAILQ_SWAP(head1, head2, type, field) do { \ argument
628 swap_first->field.tqe_prev = &(head1)->tqh_first; \
632 swap_first->field.tqe_prev = &(head2)->tqh_first; \