Lines Matching refs:field
157 #define SLIST_FOREACH(var, head, field) \
160 (var) = SLIST_NEXT((var), field))
162 #define SLIST_FOREACH_SAFE(var, head, field, tvar) \
164 (var) && ((tvar) = SLIST_NEXT((var), field), 1); \
167 #define SLIST_FOREACH_PREVPTR(var, varp, head, field) \
170 (varp) = &SLIST_NEXT((var), field))
176 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
177 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
178 SLIST_NEXT((slistelm), field) = (elm); \
181 #define SLIST_INSERT_HEAD(head, elm, field) do { \
182 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
186 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
188 #define SLIST_REMOVE(head, elm, type, field) do { \
190 SLIST_REMOVE_HEAD((head), field); \
194 while (SLIST_NEXT(curelm, field) != (elm)) \
195 curelm = SLIST_NEXT(curelm, field); \
196 SLIST_NEXT(curelm, field) = \
197 SLIST_NEXT(SLIST_NEXT(curelm, field), field); \
199 TRASHIT((elm)->field.sle_next); \
202 #define SLIST_REMOVE_HEAD(head, field) do { \
203 SLIST_FIRST((head)) = SLIST_NEXT(SLIST_FIRST((head)), field); \
238 #define STAILQ_FOREACH(var, head, field) \
241 (var) = STAILQ_NEXT((var), field))
244 #define STAILQ_FOREACH_SAFE(var, head, field, tvar) \
246 (var) && ((tvar) = STAILQ_NEXT((var), field), 1); \
254 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
255 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
256 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
257 STAILQ_NEXT((tqelm), field) = (elm); \
260 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
261 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
262 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
266 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
267 STAILQ_NEXT((elm), field) = NULL; \
269 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
272 #define STAILQ_LAST(head, type, field) \
276 ((char *)((head)->stqh_last) - offsetof(struct type, field))))
278 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)
280 #define STAILQ_REMOVE(head, elm, type, field) do { \
282 STAILQ_REMOVE_HEAD((head), field); \
286 while (STAILQ_NEXT(curelm, field) != (elm)) \
287 curelm = STAILQ_NEXT(curelm, field); \
288 if ((STAILQ_NEXT(curelm, field) = \
289 STAILQ_NEXT(STAILQ_NEXT(curelm, field), field)) == NULL)\
290 (head)->stqh_last = &STAILQ_NEXT((curelm), field);\
292 TRASHIT((elm)->field.stqe_next); \
295 #define STAILQ_REMOVE_HEAD(head, field) do { \
297 STAILQ_NEXT(STAILQ_FIRST((head)), field)) == NULL) \
323 #define QMD_LIST_CHECK_HEAD(head, field) do { \
325 LIST_FIRST((head))->field.le_prev != \
330 #define QMD_LIST_CHECK_NEXT(elm, field) do { \
331 if (LIST_NEXT((elm), field) != NULL && \
332 LIST_NEXT((elm), field)->field.le_prev != \
333 &((elm)->field.le_next)) \
337 #define QMD_LIST_CHECK_PREV(elm, field) do { \
338 if (*(elm)->field.le_prev != (elm)) \
342 #define QMD_LIST_CHECK_HEAD(head, field)
343 #define QMD_LIST_CHECK_NEXT(elm, field)
344 #define QMD_LIST_CHECK_PREV(elm, field)
351 #define LIST_FOREACH(var, head, field) \
354 (var) = LIST_NEXT((var), field))
356 #define LIST_FOREACH_SAFE(var, head, field, tvar) \
358 (var) && ((tvar) = LIST_NEXT((var), field), 1); \
365 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
366 QMD_LIST_CHECK_NEXT(listelm, field); \
367 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
368 LIST_NEXT((listelm), field)->field.le_prev = \
369 &LIST_NEXT((elm), field); \
370 LIST_NEXT((listelm), field) = (elm); \
371 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
374 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
375 QMD_LIST_CHECK_PREV(listelm, field); \
376 (elm)->field.le_prev = (listelm)->field.le_prev; \
377 LIST_NEXT((elm), field) = (listelm); \
378 *(listelm)->field.le_prev = (elm); \
379 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
382 #define LIST_INSERT_HEAD(head, elm, field) do { \
383 QMD_LIST_CHECK_HEAD((head), field); \
384 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
385 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
387 (elm)->field.le_prev = &LIST_FIRST((head)); \
390 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
392 #define LIST_REMOVE(elm, field) do { \
393 QMD_LIST_CHECK_NEXT(elm, field); \
394 QMD_LIST_CHECK_PREV(elm, field); \
395 if (LIST_NEXT((elm), field) != NULL) \
396 LIST_NEXT((elm), field)->field.le_prev = \
397 (elm)->field.le_prev; \
398 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
399 TRASHIT((elm)->field.le_next); \
400 TRASHIT((elm)->field.le_prev); \
427 #define QMD_TAILQ_CHECK_HEAD(head, field) do { \
429 TAILQ_FIRST((head))->field.tqe_prev != \
434 #define QMD_TAILQ_CHECK_TAIL(head, field) do { \
439 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \
440 if (TAILQ_NEXT((elm), field) != NULL && \
441 TAILQ_NEXT((elm), field)->field.tqe_prev != \
442 &((elm)->field.tqe_next)) \
446 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \
447 if (*(elm)->field.tqe_prev != (elm)) \
451 #define QMD_TAILQ_CHECK_HEAD(head, field)
453 #define QMD_TAILQ_CHECK_NEXT(elm, field)
454 #define QMD_TAILQ_CHECK_PREV(elm, field)
457 #define TAILQ_CONCAT(head1, head2, field) do { \
460 (head2)->tqh_first->field.tqe_prev = (head1)->tqh_last; \
472 #define TAILQ_FOREACH(var, head, field) \
475 (var) = TAILQ_NEXT((var), field))
477 #define TAILQ_FOREACH_SAFE(var, head, field, tvar) \
479 (var) && ((tvar) = TAILQ_NEXT((var), field), 1); \
482 #define TAILQ_FOREACH_REVERSE(var, head, headname, field) \
485 (var) = TAILQ_PREV((var), headname, field))
487 #define TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar) \
489 (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1); \
498 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
499 QMD_TAILQ_CHECK_NEXT(listelm, field); \
500 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
501 TAILQ_NEXT((elm), field)->field.tqe_prev = \
502 &TAILQ_NEXT((elm), field); \
504 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
507 TAILQ_NEXT((listelm), field) = (elm); \
508 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
509 QMD_TRACE_ELEM(&(elm)->field); \
510 QMD_TRACE_ELEM(&listelm->field); \
513 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
514 QMD_TAILQ_CHECK_PREV(listelm, field); \
515 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
516 TAILQ_NEXT((elm), field) = (listelm); \
517 *(listelm)->field.tqe_prev = (elm); \
518 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
519 QMD_TRACE_ELEM(&(elm)->field); \
520 QMD_TRACE_ELEM(&listelm->field); \
523 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
524 QMD_TAILQ_CHECK_HEAD(head, field); \
525 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
526 TAILQ_FIRST((head))->field.tqe_prev = \
527 &TAILQ_NEXT((elm), field); \
529 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
531 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
533 QMD_TRACE_ELEM(&(elm)->field); \
536 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
537 QMD_TAILQ_CHECK_TAIL(head, field); \
538 TAILQ_NEXT((elm), field) = NULL; \
539 (elm)->field.tqe_prev = (head)->tqh_last; \
541 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
543 QMD_TRACE_ELEM(&(elm)->field); \
549 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
551 #define TAILQ_PREV(elm, headname, field) \
552 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
554 #define TAILQ_REMOVE(head, elm, field) do { \
555 QMD_TAILQ_CHECK_NEXT(elm, field); \
556 QMD_TAILQ_CHECK_PREV(elm, field); \
557 if ((TAILQ_NEXT((elm), field)) != NULL) \
558 TAILQ_NEXT((elm), field)->field.tqe_prev = \
559 (elm)->field.tqe_prev; \
561 (head)->tqh_last = (elm)->field.tqe_prev; \
564 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
565 TRASHIT((elm)->field.tqe_next); \
566 TRASHIT((elm)->field.tqe_prev); \
567 QMD_TRACE_ELEM(&(elm)->field); \