elm 59 source4/heimdal/lib/asn1/asn1_queue.h #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ elm 63 source4/heimdal/lib/asn1/asn1_queue.h #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ elm 66 source4/heimdal/lib/asn1/asn1_queue.h #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \ elm 67 source4/heimdal/lib/asn1/asn1_queue.h if ((elm)->field.tqe_next && \ elm 68 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_next->field.tqe_prev != \ elm 69 source4/heimdal/lib/asn1/asn1_queue.h &(elm)->field.tqe_next) \ elm 70 source4/heimdal/lib/asn1/asn1_queue.h panic("ASN1_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\ elm 71 source4/heimdal/lib/asn1/asn1_queue.h if (*(elm)->field.tqe_prev != (elm)) \ elm 72 source4/heimdal/lib/asn1/asn1_queue.h panic("ASN1_TAILQ_* back %p %s:%d", (elm), __FILE__, __LINE__); elm 73 source4/heimdal/lib/asn1/asn1_queue.h #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ elm 74 source4/heimdal/lib/asn1/asn1_queue.h if ((elm)->field.tqe_next == NULL && \ elm 75 source4/heimdal/lib/asn1/asn1_queue.h (head)->tqh_last != &(elm)->field.tqe_next) \ elm 77 source4/heimdal/lib/asn1/asn1_queue.h (head), (elm), __FILE__, __LINE__); elm 78 source4/heimdal/lib/asn1/asn1_queue.h #define QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field) \ elm 79 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_next = (void *)1L; \ elm 80 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_prev = (void *)1L; elm 82 source4/heimdal/lib/asn1/asn1_queue.h #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) elm 83 source4/heimdal/lib/asn1/asn1_queue.h #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) elm 84 source4/heimdal/lib/asn1/asn1_queue.h #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) elm 85 source4/heimdal/lib/asn1/asn1_queue.h #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) elm 86 source4/heimdal/lib/asn1/asn1_queue.h #define QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field) elm 94 source4/heimdal/lib/asn1/asn1_queue.h #define ASN1_TAILQ_INSERT_HEAD(head, elm, field) do { \ elm 95 source4/heimdal/lib/asn1/asn1_queue.h QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD((head), (elm), field) \ elm 96 source4/heimdal/lib/asn1/asn1_queue.h if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \ elm 98 source4/heimdal/lib/asn1/asn1_queue.h &(elm)->field.tqe_next; \ elm 100 source4/heimdal/lib/asn1/asn1_queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ elm 101 source4/heimdal/lib/asn1/asn1_queue.h (head)->tqh_first = (elm); \ elm 102 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_prev = &(head)->tqh_first; \ elm 105 source4/heimdal/lib/asn1/asn1_queue.h #define ASN1_TAILQ_INSERT_TAIL(head, elm, field) do { \ elm 106 source4/heimdal/lib/asn1/asn1_queue.h QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL((head), (elm), field) \ elm 107 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_next = NULL; \ elm 108 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_prev = (head)->tqh_last; \ elm 109 source4/heimdal/lib/asn1/asn1_queue.h *(head)->tqh_last = (elm); \ elm 110 source4/heimdal/lib/asn1/asn1_queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ elm 113 source4/heimdal/lib/asn1/asn1_queue.h #define ASN1_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ elm 115 source4/heimdal/lib/asn1/asn1_queue.h if (((elm)->field.tqe_next = (listelm)->field.tqe_next) != NULL)\ elm 116 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_next->field.tqe_prev = \ elm 117 source4/heimdal/lib/asn1/asn1_queue.h &(elm)->field.tqe_next; \ elm 119 source4/heimdal/lib/asn1/asn1_queue.h (head)->tqh_last = &(elm)->field.tqe_next; \ elm 120 source4/heimdal/lib/asn1/asn1_queue.h (listelm)->field.tqe_next = (elm); \ elm 121 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_prev = &(listelm)->field.tqe_next; \ elm 124 source4/heimdal/lib/asn1/asn1_queue.h #define ASN1_TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ elm 126 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \ elm 127 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_next = (listelm); \ elm 128 source4/heimdal/lib/asn1/asn1_queue.h *(listelm)->field.tqe_prev = (elm); \ elm 129 source4/heimdal/lib/asn1/asn1_queue.h (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \ elm 132 source4/heimdal/lib/asn1/asn1_queue.h #define ASN1_TAILQ_REMOVE(head, elm, field) do { \ elm 133 source4/heimdal/lib/asn1/asn1_queue.h QUEUEDEBUG_ASN1_TAILQ_PREREMOVE((head), (elm), field) \ elm 134 source4/heimdal/lib/asn1/asn1_queue.h QUEUEDEBUG_ASN1_TAILQ_OP((elm), field) \ elm 135 source4/heimdal/lib/asn1/asn1_queue.h if (((elm)->field.tqe_next) != NULL) \ elm 136 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_next->field.tqe_prev = \ elm 137 source4/heimdal/lib/asn1/asn1_queue.h (elm)->field.tqe_prev; \ elm 139 source4/heimdal/lib/asn1/asn1_queue.h (head)->tqh_last = (elm)->field.tqe_prev; \ elm 140 source4/heimdal/lib/asn1/asn1_queue.h *(elm)->field.tqe_prev = (elm)->field.tqe_next; \ elm 141 source4/heimdal/lib/asn1/asn1_queue.h QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE((elm), field); \ elm 159 source4/heimdal/lib/asn1/asn1_queue.h #define ASN1_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) elm 163 source4/heimdal/lib/asn1/asn1_queue.h #define ASN1_TAILQ_PREV(elm, headname, field) \ elm 164 source4/heimdal/lib/asn1/asn1_queue.h (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last)) elm 62 source4/heimdal/lib/gssapi/mech/mechqueue.h #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ elm 63 source4/heimdal/lib/gssapi/mech/mechqueue.h (elm)->field.sle_next = (slistelm)->field.sle_next; \ elm 64 source4/heimdal/lib/gssapi/mech/mechqueue.h (slistelm)->field.sle_next = (elm); \ elm 67 source4/heimdal/lib/gssapi/mech/mechqueue.h #define SLIST_INSERT_HEAD(head, elm, field) do { \ elm 68 source4/heimdal/lib/gssapi/mech/mechqueue.h (elm)->field.sle_next = (head)->slh_first; \ elm 69 source4/heimdal/lib/gssapi/mech/mechqueue.h (head)->slh_first = (elm); \ elm 76 source4/heimdal/lib/gssapi/mech/mechqueue.h #define SLIST_REMOVE(head, elm, type, field) do { \ elm 77 source4/heimdal/lib/gssapi/mech/mechqueue.h if ((head)->slh_first == (elm)) { \ elm 82 source4/heimdal/lib/gssapi/mech/mechqueue.h while(curelm->field.sle_next != (elm)) \ elm 97 source4/heimdal/lib/gssapi/mech/mechqueue.h #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)