Lines Matching refs:elm
178 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
179 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
180 SLIST_NEXT((slistelm), field) = (elm); \
183 #define SLIST_INSERT_HEAD(head, elm, field) do { \
184 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
185 SLIST_FIRST((head)) = (elm); \
188 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
190 #define SLIST_REMOVE(head, elm, type, field) do { \
191 if (SLIST_FIRST((head)) == (elm)) { \
196 while (SLIST_NEXT(curelm, field) != (elm)) \
201 TRASHIT((elm)->field.sle_next); \
256 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
257 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
258 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
259 STAILQ_NEXT((tqelm), field) = (elm); \
262 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
263 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
264 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
265 STAILQ_FIRST((head)) = (elm); \
268 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
269 STAILQ_NEXT((elm), field) = NULL; \
270 *(head)->stqh_last = (elm); \
271 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
280 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)
282 #define STAILQ_REMOVE(head, elm, type, field) do { \
283 if (STAILQ_FIRST((head)) == (elm)) { \
288 while (STAILQ_NEXT(curelm, field) != (elm)) \
294 TRASHIT((elm)->field.stqe_next); \
332 #define QMD_LIST_CHECK_NEXT(elm, field) do { \
333 if (LIST_NEXT((elm), field) != NULL && \
334 LIST_NEXT((elm), field)->field.le_prev != \
335 &((elm)->field.le_next)) \
336 panic("Bad link elm %p next->prev != elm", (elm)); \
339 #define QMD_LIST_CHECK_PREV(elm, field) do { \
340 if (*(elm)->field.le_prev != (elm)) \
341 panic("Bad link elm %p prev->next != elm", (elm)); \
345 #define QMD_LIST_CHECK_NEXT(elm, field)
346 #define QMD_LIST_CHECK_PREV(elm, field)
367 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
369 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
371 &LIST_NEXT((elm), field); \
372 LIST_NEXT((listelm), field) = (elm); \
373 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
376 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
378 (elm)->field.le_prev = (listelm)->field.le_prev; \
379 LIST_NEXT((elm), field) = (listelm); \
380 *(listelm)->field.le_prev = (elm); \
381 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
384 #define LIST_INSERT_HEAD(head, elm, field) do { \
386 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
387 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
388 LIST_FIRST((head)) = (elm); \
389 (elm)->field.le_prev = &LIST_FIRST((head)); \
392 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
394 #define LIST_REMOVE(elm, field) do { \
395 QMD_LIST_CHECK_NEXT(elm, field); \
396 QMD_LIST_CHECK_PREV(elm, field); \
397 if (LIST_NEXT((elm), field) != NULL) \
398 LIST_NEXT((elm), field)->field.le_prev = \
399 (elm)->field.le_prev; \
400 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
401 TRASHIT((elm)->field.le_next); \
402 TRASHIT((elm)->field.le_prev); \
441 #define QMD_TAILQ_CHECK_NEXT(elm, field) do { \
442 if (TAILQ_NEXT((elm), field) != NULL && \
443 TAILQ_NEXT((elm), field)->field.tqe_prev != \
444 &((elm)->field.tqe_next)) \
445 panic("Bad link elm %p next->prev != elm", (elm)); \
448 #define QMD_TAILQ_CHECK_PREV(elm, field) do { \
449 if (*(elm)->field.tqe_prev != (elm)) \
450 panic("Bad link elm %p prev->next != elm", (elm)); \
455 #define QMD_TAILQ_CHECK_NEXT(elm, field)
456 #define QMD_TAILQ_CHECK_PREV(elm, field)
500 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
502 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
503 TAILQ_NEXT((elm), field)->field.tqe_prev = \
504 &TAILQ_NEXT((elm), field); \
506 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
509 TAILQ_NEXT((listelm), field) = (elm); \
510 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
511 QMD_TRACE_ELEM(&(elm)->field); \
515 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
517 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
518 TAILQ_NEXT((elm), field) = (listelm); \
519 *(listelm)->field.tqe_prev = (elm); \
520 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
521 QMD_TRACE_ELEM(&(elm)->field); \
525 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
527 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
529 &TAILQ_NEXT((elm), field); \
531 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
532 TAILQ_FIRST((head)) = (elm); \
533 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
535 QMD_TRACE_ELEM(&(elm)->field); \
538 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
540 TAILQ_NEXT((elm), field) = NULL; \
541 (elm)->field.tqe_prev = (head)->tqh_last; \
542 *(head)->tqh_last = (elm); \
543 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
545 QMD_TRACE_ELEM(&(elm)->field); \
551 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
553 #define TAILQ_PREV(elm, headname, field) \
554 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
556 #define TAILQ_REMOVE(head, elm, field) do { \
557 QMD_TAILQ_CHECK_NEXT(elm, field); \
558 QMD_TAILQ_CHECK_PREV(elm, field); \
559 if ((TAILQ_NEXT((elm), field)) != NULL) \
560 TAILQ_NEXT((elm), field)->field.tqe_prev = \
561 (elm)->field.tqe_prev; \
563 (head)->tqh_last = (elm)->field.tqe_prev; \
566 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \
567 TRASHIT((elm)->field.tqe_next); \
568 TRASHIT((elm)->field.tqe_prev); \
569 QMD_TRACE_ELEM(&(elm)->field); \