Lines Matching refs:var
228 #define SLIST_FOREACH(var, head, field) \
229 for ((var) = SLIST_FIRST((head)); \
230 (var); \
231 (var) = SLIST_NEXT((var), field))
233 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
234 for ((var) = SLIST_FIRST((head)); \
235 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
236 (var) = (tvar))
238 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
240 ((var) = *(varp)) != NULL; \
241 (varp) = &SLIST_NEXT((var), field))
320 #define STAILQ_FOREACH(var, head, field) \
321 for((var) = STAILQ_FIRST((head)); \
322 (var); \
323 (var) = STAILQ_NEXT((var), field))
326 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
327 for ((var) = STAILQ_FIRST((head)); \
328 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
329 (var) = (tvar))
468 #define LIST_FOREACH(var, head, field) \
469 for ((var) = LIST_FIRST((head)); \
470 (var); \
471 (var) = LIST_NEXT((var), field))
473 #define LIST_FOREACH_SAFE(var, head, field, tvar) \
474 for ((var) = LIST_FIRST((head)); \
475 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
476 (var) = (tvar))
575 #define TAILQ_FOREACH(var, head, field) \
576 for ((var) = TAILQ_FIRST((head)); \
577 (var); \
578 (var) = TAILQ_NEXT((var), field))
580 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
581 for ((var) = TAILQ_FIRST((head)); \
582 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
583 (var) = (tvar))
585 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
586 for ((var) = TAILQ_LAST((head), headname); \
587 (var); \
588 (var) = TAILQ_PREV((var), headname, field))
590 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
591 for ((var) = TAILQ_LAST((head), headname); \
592 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
593 (var) = (tvar))
720 #define CIRCLEQ_FOREACH(var, head, field) \
721 for((var) = (head)->cqh_first; \
722 (var) != (void *)(head); \
723 (var) = (var)->field.cqe_next)