Lines Matching refs:elm
138 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
139 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
140 SLIST_NEXT((slistelm), field) = (elm); \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
148 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
150 #define SLIST_REMOVE(head, elm, type, field) do { \
151 if (SLIST_FIRST((head)) == (elm)) { \
156 while (SLIST_NEXT(curelm, field) != (elm)) \
209 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \
210 if ((STAILQ_NEXT((elm), field) = STAILQ_NEXT((tqelm), field)) == NULL)\
211 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
212 STAILQ_NEXT((tqelm), field) = (elm); \
215 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
216 if ((STAILQ_NEXT((elm), field) = STAILQ_FIRST((head))) == NULL) \
217 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
218 STAILQ_FIRST((head)) = (elm); \
221 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
222 STAILQ_NEXT((elm), field) = NULL; \
223 *(head)->stqh_last = (elm); \
224 (head)->stqh_last = &STAILQ_NEXT((elm), field); \
233 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next)
235 #define STAILQ_REMOVE(head, elm, type, field) do { \
236 if (STAILQ_FIRST((head)) == (elm)) { \
241 while (STAILQ_NEXT(curelm, field) != (elm)) \
255 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \
256 if ((STAILQ_FIRST((head)) = STAILQ_NEXT((elm), field)) == NULL) \
294 #define LIST_INSERT_AFTER(listelm, elm, field) do { \
295 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
297 &LIST_NEXT((elm), field); \
298 LIST_NEXT((listelm), field) = (elm); \
299 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
302 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \
303 (elm)->field.le_prev = (listelm)->field.le_prev; \
304 LIST_NEXT((elm), field) = (listelm); \
305 *(listelm)->field.le_prev = (elm); \
306 (listelm)->field.le_prev = &LIST_NEXT((elm), field); \
309 #define LIST_INSERT_HEAD(head, elm, field) do { \
310 if ((LIST_NEXT((elm), field) = LIST_FIRST((head))) != NULL) \
311 LIST_FIRST((head))->field.le_prev = &LIST_NEXT((elm), field);\
312 LIST_FIRST((head)) = (elm); \
313 (elm)->field.le_prev = &LIST_FIRST((head)); \
316 #define LIST_NEXT(elm, field) ((elm)->field.le_next)
318 #define LIST_REMOVE(elm, field) do { \
319 if (LIST_NEXT((elm), field) != NULL) \
320 LIST_NEXT((elm), field)->field.le_prev = \
321 (elm)->field.le_prev; \
322 *(elm)->field.le_prev = LIST_NEXT((elm), field); \
374 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
375 if ((TAILQ_NEXT((elm), field) = TAILQ_NEXT((listelm), field)) != NULL)\
376 TAILQ_NEXT((elm), field)->field.tqe_prev = \
377 &TAILQ_NEXT((elm), field); \
379 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
380 TAILQ_NEXT((listelm), field) = (elm); \
381 (elm)->field.tqe_prev = &TAILQ_NEXT((listelm), field); \
384 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
385 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
386 TAILQ_NEXT((elm), field) = (listelm); \
387 *(listelm)->field.tqe_prev = (elm); \
388 (listelm)->field.tqe_prev = &TAILQ_NEXT((elm), field); \
391 #define TAILQ_INSERT_HEAD(head, elm, field) do { \
392 if ((TAILQ_NEXT((elm), field) = TAILQ_FIRST((head))) != NULL) \
394 &TAILQ_NEXT((elm), field); \
396 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
397 TAILQ_FIRST((head)) = (elm); \
398 (elm)->field.tqe_prev = &TAILQ_FIRST((head)); \
401 #define TAILQ_INSERT_TAIL(head, elm, field) do { \
402 TAILQ_NEXT((elm), field) = NULL; \
403 (elm)->field.tqe_prev = (head)->tqh_last; \
404 *(head)->tqh_last = (elm); \
405 (head)->tqh_last = &TAILQ_NEXT((elm), field); \
411 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
413 #define TAILQ_PREV(elm, headname, field) \
414 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
416 #define TAILQ_REMOVE(head, elm, field) do { \
417 if ((TAILQ_NEXT((elm), field)) != NULL) \
418 TAILQ_NEXT((elm), field)->field.tqe_prev = \
419 (elm)->field.tqe_prev; \
421 (head)->tqh_last = (elm)->field.tqe_prev; \
422 *(elm)->field.tqe_prev = TAILQ_NEXT((elm), field); \