Lines Matching refs:head
52 #define STAILQ_HEAD_INITIALIZER(head) \
53 { NULL, &(head).stqh_first }
62 #define STAILQ_EMPTY(head) ((head)->stqh_first == NULL)
65 #define STAILQ_FIRST(head) ((head)->stqh_first)
68 #define STAILQ_FOREACH(var, head, field) \
69 for((var) = STAILQ_FIRST((head)); \
74 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
75 for ((var) = STAILQ_FIRST((head)); \
80 #define STAILQ_INIT(head) do { \
81 STAILQ_FIRST((head)) = NULL; \
82 (head)->stqh_last = &STAILQ_FIRST((head)); \
86 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
88 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
93 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
94 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
95 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
96 STAILQ_FIRST((head)) = (elm); \
100 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
102 *(head)->stqh_last = (elm); \
103 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
107 #define STAILQ_LAST(head, type, field) \
108 (STAILQ_EMPTY((head)) ? \
111 ((char *)((head)->stqh_last) - __offsetof(struct type, field))))
117 #define STAILQ_REMOVE(head, elm, type, field) do { \
118 if (STAILQ_FIRST((head)) == (elm)) { \
119 STAILQ_REMOVE_HEAD((head), field); \
122 struct type *curelm = STAILQ_FIRST((head)); \
127 (head)->stqh_last = &STAILQ_NEXT((curelm), field);\
132 #define STAILQ_REMOVE_HEAD(head, field) do { \
133 if ((STAILQ_FIRST((head)) = \
134 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
135 (head)->stqh_last = &STAILQ_FIRST((head)); \
139 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \
140 if ((STAILQ_FIRST((head)) = STAILQ_NEXT((elm), field)) == NULL) \
141 (head)->stqh_last = &STAILQ_FIRST((head)); \
154 #define LIST_HEAD_INITIALIZER(head) \
169 #define LIST_EMPTY(head) ((head)->lh_first == NULL)
172 #define LIST_FIRST(head) ((head)->lh_first)
175 #define LIST_FOREACH(var, head, field) \
176 for ((var) = LIST_FIRST((head)); \
181 #define LIST_FOREACH_SAFE(var, head, field, tvar) \
182 for ((var) = LIST_FIRST((head)); \
187 #define LIST_INIT(head) do { \
188 LIST_FIRST((head)) = NULL; \
209 #define LIST_INSERT_HEAD(head, elm, field) do { \
210 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
211 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
212 LIST_FIRST((head)) = (elm); \
213 (elm)->field.le_prev = &LIST_FIRST((head)); \