Home
last modified time | relevance | path

Searched refs:listelm (Results 1 – 14 of 14) sorted by relevance

/freebsd/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
175 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
176 (listelm)->field.le_next->field.le_prev = \
178 (listelm)->field.le_next = (elm); \
179 (elm)->field.le_prev = &(listelm)->field.le_next; \
182 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
183 (elm)->field.le_prev = (listelm)->field.le_prev; \
184 (elm)->field.le_next = (listelm); \
185 *(listelm)->field.le_prev = (elm); \
186 (listelm)->field.le_prev = &(elm)->field.le_next; \
[all …]
/freebsd/contrib/libevent/compat/sys/
H A Dqueue.h174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
175 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
176 (listelm)->field.le_next->field.le_prev = \
178 (listelm)->field.le_next = (elm); \
179 (elm)->field.le_prev = &(listelm)->field.le_next; \
182 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
183 (elm)->field.le_prev = (listelm)->field.le_prev; \
184 (elm)->field.le_next = (listelm); \
185 *(listelm)->field.le_prev = (elm); \
186 (listelm)->field.le_prev = &(elm)->field.le_next; \
[all …]
/freebsd/contrib/openbsm/compat/
H A Dqueue.h373 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
374 QMD_LIST_CHECK_NEXT(listelm, field); \
375 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
376 LIST_NEXT((listelm), field)->field.le_prev = \
378 LIST_NEXT((listelm), field) = (elm); \
379 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
382 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
383 QMD_LIST_CHECK_PREV(listelm, field); \
384 (elm)->field.le_prev = (listelm)->field.le_prev; \
385 LIST_NEXT((elm), field) = (listelm); \
[all …]
/freebsd/crypto/heimdal/base/
H A Dheimqueue.h113 #define HEIM_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
114 QUEUEDEBUG_HEIM_TAILQ_OP((listelm), field) \
115 if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
120 (listelm)->field.tqe_next = (elm); \
121 (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
124 #define HEIM_TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
125 QUEUEDEBUG_HEIM_TAILQ_OP((listelm), field) \
126 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
127 (elm)->field.tqe_next = (listelm); \
128 *(listelm)->field.tqe_prev = (elm); \
[all …]
/freebsd/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h113 #define ASN1_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
114 QUEUEDEBUG_ASN1_TAILQ_OP((listelm), field) \
115 if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
120 (listelm)->field.tqe_next = (elm); \
121 (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
124 #define ASN1_TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
125 QUEUEDEBUG_ASN1_TAILQ_OP((listelm), field) \
126 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
127 (elm)->field.tqe_next = (listelm); \
128 *(listelm)->field.tqe_prev = (elm); \
[all …]
/freebsd/crypto/openssh/openbsd-compat/
H A Dsys-queue.h298 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
299 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
300 (listelm)->field.le_next->field.le_prev = \
302 (listelm)->field.le_next = (elm); \
303 (elm)->field.le_prev = &(listelm)->field.le_next; \
306 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
307 (elm)->field.le_prev = (listelm)->field.le_prev; \
308 (elm)->field.le_next = (listelm); \
309 *(listelm)->field.le_prev = (elm); \
310 (listelm)->field.le_prev = &(elm)->field.le_next; \
[all …]
/freebsd/contrib/sendmail/include/sm/
H A Dtailq.h121 #define SM_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
122 if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\
127 (listelm)->field.tqe_next = (elm); \
128 (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \
131 #define SM_TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
132 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
133 (elm)->field.tqe_next = (listelm); \
134 *(listelm)->field.tqe_prev = (elm); \
135 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
/freebsd/contrib/libarchive/unzip/
H A Dla_queue.h529 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
530 QMD_LIST_CHECK_NEXT(listelm, field); \
531 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
532 LIST_NEXT((listelm), field)->field.le_prev = \
534 LIST_NEXT((listelm), field) = (elm); \
535 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
538 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
539 QMD_LIST_CHECK_PREV(listelm, field); \
540 (elm)->field.le_prev = (listelm)->field.le_prev; \
541 LIST_NEXT((elm), field) = (listelm); \
[all …]
/freebsd/sys/sys/
H A Dqueue.h613 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
614 QMD_LIST_CHECK_NEXT(listelm, field); \
615 if ((LIST_NEXT((elm), field) = LIST_NEXT((listelm), field)) != NULL)\
616 LIST_NEXT((listelm), field)->field.le_prev = \
618 LIST_NEXT((listelm), field) = (elm); \
619 (elm)->field.le_prev = &LIST_NEXT((listelm), field); \
622 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
623 QMD_LIST_CHECK_PREV(listelm, field); \
624 (elm)->field.le_prev = (listelm)->field.le_prev; \
625 LIST_NEXT((elm), field) = (listelm); \
[all …]
/freebsd/sys/contrib/ck/include/
H A Dck_queue.h402 #define CK_LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
403 (elm)->field.cle_next = (listelm)->field.cle_next; \
404 (elm)->field.cle_prev = &(listelm)->field.cle_next; \
406 if ((listelm)->field.cle_next != NULL) \
407 (listelm)->field.cle_next->field.cle_prev = &(elm)->field.cle_next;\
408 ck_pr_store_ptr(&(listelm)->field.cle_next, elm); \
411 #define CK_LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
412 (elm)->field.cle_prev = (listelm)->field.cle_prev; \
413 (elm)->field.cle_next = (listelm); \
415 ck_pr_store_ptr((listelm)->field.cle_prev, (elm)); \
[all …]
/freebsd/contrib/ntp/sntp/libevent/
H A Devent-internal.h393 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
394 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
395 (elm)->field.tqe_next = (listelm); \
396 *(listelm)->field.tqe_prev = (elm); \
397 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
/freebsd/contrib/libevent/
H A Devent-internal.h393 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
394 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
395 (elm)->field.tqe_next = (listelm); \
396 *(listelm)->field.tqe_prev = (elm); \
397 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
/freebsd/contrib/elftoolchain/common/
H A D_elftc.h169 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
170 if (((elm)->field.stqe_next = (listelm)->field.stqe_next) == NULL)\
172 (listelm)->field.stqe_next = (elm); \
/freebsd/libexec/rtld-elf/
H A Drtld.c3231 Objlist_Entry *elm, *listelm; in objlist_put_after() local
3233 STAILQ_FOREACH(listelm, list, link) { in objlist_put_after()
3234 if (listelm->obj == listobj) in objlist_put_after()
3239 if (listelm != NULL) in objlist_put_after()
3240 STAILQ_INSERT_AFTER(list, listelm, elm, link); in objlist_put_after()