Lines Matching refs:field
129 #define SLIST_FOREACH(var, head, field) \
132 (var) = SLIST_NEXT((var), field))
138 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
139 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
140 SLIST_NEXT((slistelm), field) = (elm); \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
148 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
150 #define SLIST_REMOVE(head, elm, type, field) do { \
152 SLIST_REMOVE_HEAD((head), field); \
156 while (SLIST_NEXT(curelm, field) != (elm)) \
157 curelm = SLIST_NEXT(curelm, field); \
158 SLIST_NEXT(curelm, field) = \
159 SLIST_NEXT(SLIST_NEXT(curelm, field), field); \
163 #define SLIST_REMOVE_HEAD(head, field) do { \
164 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
191 #define STAILQ_FOREACH(var, head, field) \
194 (var) = STAILQ_NEXT((var), field))
201 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
202 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
203 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
204 STAILQ_NEXT((tqelm), field) = (elm); \
207 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
208 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
209 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
213 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
214 STAILQ_NEXT((elm), field) = NULL; \
216 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
219 #define STAILQ_LAST(head, type, field) \
223 ((char *)((head)->stqh_last) - __offsetof(struct type, field))))
225 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)
227 #define STAILQ_REMOVE(head, elm, type, field) do { \
229 STAILQ_REMOVE_HEAD(head, field); \
233 while (STAILQ_NEXT(curelm, field) != (elm)) \
234 curelm = STAILQ_NEXT(curelm, field); \
235 if ((STAILQ_NEXT(curelm, field) = \
236 STAILQ_NEXT(STAILQ_NEXT(curelm, field), field)) == NULL)\
237 (head)->stqh_last = &STAILQ_NEXT((curelm), field);\
241 #define STAILQ_REMOVE_HEAD(head, field) do { \
243 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
247 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \
248 if ((STAILQ_FIRST((head)) = STAILQ_NEXT((elm), field)) == NULL) \
277 #define LIST_FOREACH(var, head, field) \
280 (var) = LIST_NEXT((var), field))
286 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
287 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
288 LIST_NEXT((listelm), field)->field.le_prev = \
289 &LIST_NEXT((elm), field); \
290 LIST_NEXT((listelm), field) = (elm); \
291 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
294 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
295 (elm)->field.le_prev = (listelm)->field.le_prev; \
296 LIST_NEXT((elm), field) = (listelm); \
297 *(listelm)->field.le_prev = (elm); \
298 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
301 #define LIST_INSERT_HEAD(head, elm, field) do { \
302 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
303 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
305 (elm)->field.le_prev = &LIST_FIRST((head)); \
308 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
310 #define LIST_REMOVE(elm, field) do { \
311 if (LIST_NEXT((elm), field) != NULL) \
312 LIST_NEXT((elm), field)->field.le_prev = \
313 (elm)->field.le_prev; \
314 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
342 #define TAILQ_FOREACH(var, head, field) \
345 (var) = TAILQ_NEXT((var), field))
347 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
350 (var) = TAILQ_PREV((var), headname, field))
357 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
358 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
359 TAILQ_NEXT((elm), field)->field.tqe_prev = \
360 &TAILQ_NEXT((elm), field); \
362 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
363 TAILQ_NEXT((listelm), field) = (elm); \
364 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
367 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
368 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
369 TAILQ_NEXT((elm), field) = (listelm); \
370 *(listelm)->field.tqe_prev = (elm); \
371 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
374 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
375 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
376 TAILQ_FIRST((head))->field.tqe_prev = \
377 &TAILQ_NEXT((elm), field); \
379 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
381 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
384 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
385 TAILQ_NEXT((elm), field) = NULL; \
386 (elm)->field.tqe_prev = (head)->tqh_last; \
388 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
394 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
396 #define TAILQ_PREV(elm, headname, field) \
397 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
399 #define TAILQ_REMOVE(head, elm, field) do { \
400 if ((TAILQ_NEXT((elm), field)) != NULL) \
401 TAILQ_NEXT((elm), field)->field.tqe_prev = \
402 (elm)->field.tqe_prev; \
404 (head)->tqh_last = (elm)->field.tqe_prev; \
405 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \