Lines Matching refs:field
166 #define SLIST_FOREACH(var, head, field) \ argument
169 (var) = SLIST_NEXT((var), field))
171 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \ argument
173 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
176 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \ argument
179 (varp) = &SLIST_NEXT((var), field))
185 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
186 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
187 SLIST_NEXT((slistelm), field) = (elm); \
190 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
191 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
195 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
197 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
199 SLIST_REMOVE_HEAD((head), field); \
203 while (SLIST_NEXT(curelm, field) != (elm)) \
204 curelm = SLIST_NEXT(curelm, field); \
205 SLIST_NEXT(curelm, field) = \
206 SLIST_NEXT(SLIST_NEXT(curelm, field), field);\
210 #define SLIST_REMOVE_HEAD(head, field) do { \ argument
212 field); \
247 #define STAILQ_FOREACH(var, head, field) \ argument
250 (var) = STAILQ_NEXT((var), field))
252 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
254 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
262 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
263 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), \
264 field)) == NULL) \
265 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
266 STAILQ_NEXT((tqelm), field) = (elm); \
269 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
270 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == \
272 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
276 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
277 STAILQ_NEXT((elm), field) = NULL; \
279 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
282 #define STAILQ_LAST(head, type, field) \ argument
286 ((char *)((head)->stqh_last) - __offsetof(struct type, field))))
288 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
290 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
292 STAILQ_REMOVE_HEAD((head), field); \
296 while (STAILQ_NEXT(curelm, field) != (elm)) \
297 curelm = STAILQ_NEXT(curelm, field); \
298 if ((STAILQ_NEXT(curelm, field) = \
299 STAILQ_NEXT(STAILQ_NEXT(curelm, field), \
300 field)) == NULL) \
302 field); \
306 #define STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
307 if (STAILQ_NEXT(elm, field)) { \
308 if ((STAILQ_NEXT(elm, field) = \
309 STAILQ_NEXT(STAILQ_NEXT(elm, field), \
310 field)) == NULL) \
312 &STAILQ_NEXT((elm), field); \
316 #define STAILQ_REMOVE_HEAD(head, field) do { \ argument
318 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == \
323 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \ argument
325 STAILQ_NEXT((elm), field)) == NULL) \
358 #define LIST_FOREACH(var, head, field) \ argument
361 (var) = LIST_NEXT((var), field))
363 #define LIST_FOREACH_SAFE(var, head, field, tvar) \ argument
365 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
372 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
373 if ((LIST_NEXT((elm), field) = \
374 LIST_NEXT((listelm), field)) != NULL) \
375 LIST_NEXT((listelm), field)->field.le_prev = \
376 &LIST_NEXT((elm), field); \
377 LIST_NEXT((listelm), field) = (elm); \
378 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
381 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
382 (elm)->field.le_prev = (listelm)->field.le_prev; \
383 LIST_NEXT((elm), field) = (listelm); \
384 *(listelm)->field.le_prev = (elm); \
385 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
388 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
389 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
390 LIST_FIRST((head))->field.le_prev = \
391 &LIST_NEXT((elm), field); \
393 (elm)->field.le_prev = &LIST_FIRST((head)); \
396 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
398 #define LIST_REMOVE(elm, field) do { \ argument
399 if (LIST_NEXT((elm), field) != NULL) \
400 LIST_NEXT((elm), field)->field.le_prev = \
401 (elm)->field.le_prev; \
402 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
446 #define TAILQ_FOREACH(var, head, field) \ argument
449 (var) = TAILQ_NEXT((var), field))
451 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \ argument
453 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
456 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \ argument
459 (var) = TAILQ_PREV((var), headname, field))
461 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \ argument
463 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
473 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
474 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), \
475 field)) != NULL) \
476 TAILQ_NEXT((elm), field)->field.tqe_prev = \
477 &TAILQ_NEXT((elm), field); \
479 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
482 TAILQ_NEXT((listelm), field) = (elm); \
483 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
484 QMD_TRACE_ELEM(&(elm)->field); \
485 QMD_TRACE_ELEM(&listelm->field); \
488 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
489 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
490 TAILQ_NEXT((elm), field) = (listelm); \
491 *(listelm)->field.tqe_prev = (elm); \
492 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
493 QMD_TRACE_ELEM(&(elm)->field); \
494 QMD_TRACE_ELEM(&listelm->field); \
497 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
498 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL)\
499 TAILQ_FIRST((head))->field.tqe_prev = \
500 &TAILQ_NEXT((elm), field); \
502 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
504 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
506 QMD_TRACE_ELEM(&(elm)->field); \
509 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
510 TAILQ_NEXT((elm), field) = NULL; \
511 (elm)->field.tqe_prev = (head)->tqh_last; \
513 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
515 QMD_TRACE_ELEM(&(elm)->field); \
521 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
523 #define TAILQ_PREV(elm, headname, field) \ argument
524 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
526 #define TAILQ_REMOVE(head, elm, field) do { \ argument
527 if ((TAILQ_NEXT((elm), field)) != NULL) \
528 TAILQ_NEXT((elm), field)->field.tqe_prev = \
529 (elm)->field.tqe_prev; \
531 (head)->tqh_last = (elm)->field.tqe_prev; \
534 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
535 TRASHIT((elm)->field.tqe_next); \
536 TRASHIT((elm)->field.tqe_prev); \
537 QMD_TRACE_ELEM(&(elm)->field); \
540 #define TAILQ_CONCAT(head1, head2, field) do { \ argument
543 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last;\