Lines Matching refs:field
127 #define SLIST_FOREACH(var, head, field) \
130 (var) = SLIST_NEXT((var), field))
132 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
134 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
137 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
140 (varp) = &SLIST_NEXT((var), field))
146 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
147 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
148 SLIST_NEXT((slistelm), field) = (elm); \
151 #define SLIST_INSERT_HEAD(head, elm, field) do { \
152 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
156 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
158 #define SLIST_REMOVE(head, elm, type, field) do { \
160 SLIST_REMOVE_HEAD((head), field); \
164 while (SLIST_NEXT(curelm, field) != (elm)) \
165 curelm = SLIST_NEXT(curelm, field); \
166 SLIST_NEXT(curelm, field) = \
167 SLIST_NEXT(SLIST_NEXT(curelm, field), field); \
171 #define SLIST_REMOVE_HEAD(head, field) do { \
172 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
207 #define STAILQ_FOREACH(var, head, field) \
210 (var) = STAILQ_NEXT((var), field))
213 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
215 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
223 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
224 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
225 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
226 STAILQ_NEXT((tqelm), field) = (elm); \
229 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
230 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
231 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
235 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
236 STAILQ_NEXT((elm), field) = NULL; \
238 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
241 #define STAILQ_LAST(head, type, field) \
245 ((char *)((head)->stqh_last) - offsetof(struct type, field))))
247 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)
249 #define STAILQ_REMOVE(head, elm, type, field) do { \
251 STAILQ_REMOVE_HEAD((head), field); \
255 while (STAILQ_NEXT(curelm, field) != (elm)) \
256 curelm = STAILQ_NEXT(curelm, field); \
257 if ((STAILQ_NEXT(curelm, field) = \
258 STAILQ_NEXT(STAILQ_NEXT(curelm, field), field)) == NULL)\
259 (head)->stqh_last = &STAILQ_NEXT((curelm), field);\
263 #define STAILQ_REMOVE_HEAD(head, field) do { \
265 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
269 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \
270 if ((STAILQ_FIRST((head)) = STAILQ_NEXT((elm), field)) == NULL) \
299 #define LIST_FOREACH(var, head, field) \
302 (var) = LIST_NEXT((var), field))
304 #define LIST_FOREACH_SAFE(var, head, field, tvar) \
306 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
313 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
314 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
315 LIST_NEXT((listelm), field)->field.le_prev = \
316 &LIST_NEXT((elm), field); \
317 LIST_NEXT((listelm), field) = (elm); \
318 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
321 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
322 (elm)->field.le_prev = (listelm)->field.le_prev; \
323 LIST_NEXT((elm), field) = (listelm); \
324 *(listelm)->field.le_prev = (elm); \
325 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
328 #define LIST_INSERT_HEAD(head, elm, field) do { \
329 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
330 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
332 (elm)->field.le_prev = &LIST_FIRST((head)); \
335 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
337 #define LIST_REMOVE(elm, field) do { \
338 if (LIST_NEXT((elm), field) != NULL) \
339 LIST_NEXT((elm), field)->field.le_prev = \
340 (elm)->field.le_prev; \
341 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
365 #define TAILQ_CONCAT(head1, head2, field) do { \
368 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
378 #define TAILQ_FOREACH(var, head, field) \
381 (var) = TAILQ_NEXT((var), field))
383 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
385 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
388 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
391 (var) = TAILQ_PREV((var), headname, field))
393 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
395 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
403 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
404 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
405 TAILQ_NEXT((elm), field)->field.tqe_prev = \
406 &TAILQ_NEXT((elm), field); \
408 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
410 TAILQ_NEXT((listelm), field) = (elm); \
411 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
414 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
415 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
416 TAILQ_NEXT((elm), field) = (listelm); \
417 *(listelm)->field.tqe_prev = (elm); \
418 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
421 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
422 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
423 TAILQ_FIRST((head))->field.tqe_prev = \
424 &TAILQ_NEXT((elm), field); \
426 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
428 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
431 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
432 TAILQ_NEXT((elm), field) = NULL; \
433 (elm)->field.tqe_prev = (head)->tqh_last; \
435 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
441 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
443 #define TAILQ_PREV(elm, headname, field) \
444 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
446 #define TAILQ_REMOVE(head, elm, field) do { \
447 if ((TAILQ_NEXT((elm), field)) != NULL) \
448 TAILQ_NEXT((elm), field)->field.tqe_prev = \
449 (elm)->field.tqe_prev; \
451 (head)->tqh_last = (elm)->field.tqe_prev; \
453 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \