Lines Matching refs:elm
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)); \
192 SLIST_FIRST((head)) = (elm); \
195 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
197 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
198 if (SLIST_FIRST((head)) == (elm)) { \
203 while (SLIST_NEXT(curelm, field) != (elm)) \
262 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
263 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), \
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); \
273 STAILQ_FIRST((head)) = (elm); \
276 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
277 STAILQ_NEXT((elm), field) = NULL; \
278 *(head)->stqh_last = (elm); \
279 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
288 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
290 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
291 if (STAILQ_FIRST((head)) == (elm)) { \
296 while (STAILQ_NEXT(curelm, field) != (elm)) \
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), \
312 &STAILQ_NEXT((elm), field); \
323 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \ argument
325 STAILQ_NEXT((elm), field)) == NULL) \
372 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
373 if ((LIST_NEXT((elm), field) = \
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) \
391 &LIST_NEXT((elm), field); \
392 LIST_FIRST((head)) = (elm); \
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); \
473 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
474 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), \
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); \
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); \
497 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
498 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL)\
500 &TAILQ_NEXT((elm), field); \
502 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
503 TAILQ_FIRST((head)) = (elm); \
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; \
512 *(head)->tqh_last = (elm); \
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); \