| /src/crypto/external/bsd/heimdal/dist/lib/asn1/ |
| asn1_queue.h | 61 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \
65 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \
68 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \
69 if ((elm)->field.tqe_next && \
70 (elm)->field.tqe_next->field.tqe_prev != \
71 &(elm)->field.tqe_next) \
72 panic("ASN1_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
73 if (*(elm)->field.tqe_prev != (elm)) \
74 panic("ASN1_TAILQ_* back %p %s:%d", (elm), __FILE__, __LINE__)
[all...] |
| /src/crypto/external/bsd/heimdal/dist/lib/base/ |
| heimqueue.h | 61 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \
65 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \
68 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \
69 if ((elm)->field.tqe_next && \
70 (elm)->field.tqe_next->field.tqe_prev != \
71 &(elm)->field.tqe_next) \
72 panic("HEIM_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
73 if (*(elm)->field.tqe_prev != (elm)) \
74 panic("HEIM_TAILQ_* back %p %s:%d", (elm), __FILE__, __LINE__)
[all...] |
| /src/external/bsd/openldap/dist/include/ |
| ldap_queue.h | 172 #define LDAP_SLIST_INSERT_AFTER(slistelm, elm, field) do { \
173 (elm)->field.sle_next = (slistelm)->field.sle_next; \
174 (slistelm)->field.sle_next = (elm); \
177 #define LDAP_SLIST_INSERT_HEAD(head, elm, field) do { \
178 (elm)->field.sle_next = (head)->slh_first; \
179 (head)->slh_first = (elm); \
182 #define LDAP_SLIST_NEXT(elm, field) ((elm)->field.sle_next)
188 #define LDAP_SLIST_REMOVE(head, elm, type, field) do { \
189 if ((head)->slh_first == (elm)) { \
[all...] |
| /src/lib/libpthread/ |
| pthread_queue.h | 69 #define PTQ_INSERT_HEAD(head, elm, field) do { \
70 if (((elm)->field.ptqe_next = (head)->ptqh_first) != NULL) \
72 &(elm)->field.ptqe_next; \
74 (head)->ptqh_last = &(elm)->field.ptqe_next; \
75 (head)->ptqh_first = (elm); \
76 (elm)->field.ptqe_prev = &(head)->ptqh_first; \
79 #define PTQ_INSERT_TAIL(head, elm, field) do { \
80 (elm)->field.ptqe_next = NULL; \
83 (elm)->field.ptqe_prev = (head)->ptqh_last; \
84 *(head)->ptqh_last = (elm); \
[all...] |
| /src/external/mit/libuv/dist/include/uv/ |
| tree.h | 73 #define RB_LEFT(elm, field) (elm)->field.rbe_left
74 #define RB_RIGHT(elm, field) (elm)->field.rbe_right
75 #define RB_PARENT(elm, field) (elm)->field.rbe_parent
76 #define RB_COLOR(elm, field) (elm)->field.rbe_color
80 #define RB_SET(elm, parent, field) do { \
81 RB_PARENT(elm, field) = parent;
[all...] |
| /src/external/bsd/ntp/dist/sntp/libevent/compat/sys/ |
| queue.h | 111 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
125 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
126 (elm)->field.sle_next = (slistelm)->field.sle_next; \
127 (slistelm)->field.sle_next = (elm); \
130 #define SLIST_INSERT_HEAD(head, elm, field) do { \
131 (elm)->field.sle_next = (head)->slh_first; \
132 (head)->slh_first = (elm); \
162 #define LIST_NEXT(elm, field) ((elm)->field.le_next
[all...] |
| /src/crypto/dist/ipsec-tools/src/include-glibc/sys/ |
| queue.h | 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)) { \
[all...] |
| /src/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/ |
| mechqueue.h | 62 #define HEIM_SLIST_INSERT_AFTER(slistelm, elm, field) do { \
63 (elm)->field.sle_next = (slistelm)->field.sle_next; \
64 (slistelm)->field.sle_next = (elm); \
67 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \
68 (elm)->field.sle_next = (head)->slh_first; \
69 (head)->slh_first = (elm); \
76 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \
77 if ((head)->slh_first == (elm)) { \
82 while(curelm->field.sle_next != (elm)) \
97 #define HEIM_SLIST_NEXT(elm, field) ((elm)->field.sle_next
[all...] |
| /src/lib/libc/citrus/ |
| citrus_hash.h | 43 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field)
44 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \
45 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
46 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \
48 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) { \
49 if (matchfunc((elm), key)==0) \
|
| /src/sys/sys/ |
| tree.h | 76 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
77 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
121 /* Finds the node with the same key as elm */ \
123 name##_SPLAY_FIND(struct name *head, struct type *elm) \
127 name##_SPLAY(head, elm); \
128 if ((cmp)(elm, (head)->sph_root) == 0) \
134 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
136 name##_SPLAY(head, elm); \
[all...] |
| queue.h | 121 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
141 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
142 (elm)->field.sle_next = (slistelm)->field.sle_next; \
143 (slistelm)->field.sle_next = (elm); \
146 #define SLIST_INSERT_HEAD(head, elm, field) do { \
147 (elm)->field.sle_next = (head)->slh_first; \
148 (head)->slh_first = (elm); \
160 #define SLIST_REMOVE(head, elm, type, field) do { \
161 if ((head)->slh_first == (elm)) { \
[all...] |
| /src/external/bsd/ipf/dist/sys/ |
| tree.h | 78 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
79 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
123 /* Finds the node with the same key as elm */ \
125 name##_SPLAY_FIND(struct name *head, struct type *elm) \
129 name##_SPLAY(head, elm); \
130 if ((cmp)(elm, (head)->sph_root) == 0) \
136 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
138 name##_SPLAY(head, elm); \
[all...] |
| /src/external/bsd/libevent/dist/ |
| ht-internal.h | 53 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm))
54 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm))
55 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm))
56 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm))
58 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm))
[all...] |
| /src/external/bsd/ntp/dist/sntp/libevent/ |
| ht-internal.h | 54 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm))
55 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm))
56 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm))
57 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm))
59 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm))
[all...] |
| /src/external/apache2/mDNSResponder/dist/mDNSShared/utilities/ |
| bsd_queue.h | 287 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
288 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
289 SLIST_NEXT((slistelm), field) = (elm); \
292 #define SLIST_INSERT_HEAD(head, elm, field) do { \
293 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
294 SLIST_FIRST((head)) = (elm); \
297 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
299 #define SLIST_REMOVE(head, elm, type, field) \
303 if (SLIST_FIRST((head)) == (elm)) { \
[all...] |
| /src/libexec/httpd/ |
| netbsd_queue.h | 60 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \
61 (elm)->field.sqe_next = NULL; \
62 *(head)->sqh_last = (elm); \
63 (head)->sqh_last = &(elm)->field.sqe_next; \
80 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next)
|
| /src/external/bsd/libevent/dist/WIN32-Code/ |
| tree.h | 76 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
77 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
121 /* Finds the node with the same key as elm */ \
123 name##_SPLAY_FIND(struct name *head, struct type *elm) \
127 name##_SPLAY(head, elm); \
128 if ((cmp)(elm, (head)->sph_root) == 0) \
134 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
136 name##_SPLAY(head, elm); \
[all...] |
| /src/external/bsd/ntp/dist/sntp/libevent/WIN32-Code/ |
| tree.h | 77 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
78 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
122 /* Finds the node with the same key as elm */ \
124 name##_SPLAY_FIND(struct name *head, struct type *elm) \
128 name##_SPLAY(head, elm); \
129 if ((cmp)(elm, (head)->sph_root) == 0) \
135 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
137 name##_SPLAY(head, elm); \
[all...] |
| /src/external/mpl/dhcp/dist/keama/ |
| data.h | 79 #define TAILQ_INSERT_AFTER(head, listelm, elm) do { \
80 if ((TAILQ_NEXT((elm)) = TAILQ_NEXT((listelm))) != NULL) \
81 TAILQ_NEXT((elm))->next.tqe_prev = \
82 &TAILQ_NEXT((elm)); \
84 (head)->tqh_last = &TAILQ_NEXT((elm)); \
86 TAILQ_NEXT((listelm)) = (elm); \
87 (elm)->next.tqe_prev = &TAILQ_NEXT((listelm)); \
90 #define TAILQ_INSERT_BEFORE(listelm, elm) do { \
91 (elm)->next.tqe_prev = (listelm)->next.tqe_prev; \
92 TAILQ_NEXT((elm)) = (listelm);
[all...] |
| /src/lib/libpanel/ |
| panel_impl.h | 63 #define TAILQ_REMOVE_NP(head, elm, field) do { \
64 TAILQ_REMOVE((head), (elm), field); \
65 (elm)->field.tqe_next = NULL; \
66 (elm)->field.tqe_prev = NULL; \
69 #define TAILQ_LINKED_NP(elm, field) \
70 (((elm)->field.tqe_prev) != NULL)
|
| /src/external/bsd/jemalloc.old/dist/include/jemalloc/internal/ |
| rtree.h | 173 rtree_leaf_elm_bits_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
175 return (uintptr_t)atomic_load_p(&elm->le_bits, dependent
212 rtree_leaf_elm_t *elm, bool dependent) {
214 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
217 extent_t *extent = (extent_t *)atomic_load_p(&elm->le_extent, dependent
225 rtree_leaf_elm_t *elm, bool dependent) {
227 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
230 return (szind_t)atomic_load_u(&elm->le_szind, dependent ? ATOMIC_RELAXED
237 rtree_leaf_elm_t *elm, bool dependent) {
239 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent)
391 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, local
406 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, local
418 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, local
429 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, local
445 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, local
458 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, local
479 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true); local
486 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true); local
[all...] |
| /src/external/bsd/jemalloc.old/include/jemalloc/internal/ |
| rtree.h | 173 rtree_leaf_elm_bits_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
175 return (uintptr_t)atomic_load_p(&elm->le_bits, dependent
212 rtree_leaf_elm_t *elm, bool dependent) {
214 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
217 extent_t *extent = (extent_t *)atomic_load_p(&elm->le_extent, dependent
225 rtree_leaf_elm_t *elm, bool dependent) {
227 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
230 return (szind_t)atomic_load_u(&elm->le_szind, dependent ? ATOMIC_RELAXED
237 rtree_leaf_elm_t *elm, bool dependent) {
239 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent)
391 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, local
406 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, local
418 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, local
429 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, local
445 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, local
458 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, local
479 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true); local
486 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true); local
[all...] |
| /src/sbin/efi/ |
| getvars.c | 102 efi_var_elm_t *elm; local
106 elm = ecalloc(sizeof(*elm), 1);
107 efi_var_cpy(&elm->v.ev, ev);
109 elm->v.name = args->name;
113 SLIST_INSERT_HEAD(head, elm, entry);
139 efi_var_elm_t *elm; local
160 SLIST_FOREACH(elm, &list_head, entry) {
161 var_array[i++] = &elm->v;
192 efi_var_elm_t *elm; local
[all...] |
| /src/crypto/dist/ipsec-tools/src/racoon/ |
| var.h | 99 #define LIST_FOREACH(elm, head, field) \
100 for (elm = LIST_FIRST(head); elm; elm = LIST_NEXT(elm, field))
|
| /src/external/bsd/jemalloc/dist/include/jemalloc/internal/ |
| rtree.h | 181 rtree_leaf_elm_t *elm, bool dependent) {
182 return (uintptr_t)atomic_load_p(&elm->le_bits, dependent
239 rtree_leaf_elm_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm,
242 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent);
247 unsigned metadata_bits = atomic_load_u(&elm->le_metadata, dependent
259 contents.edata = (edata_t *)atomic_load_p(&elm->le_edata, dependent
283 rtree_leaf_elm_t *elm, void *bits, unsigned additional) {
285 atomic_store_p(&elm->le_bits, bits, ATOMIC_RELEASE);
287 atomic_store_u(&elm->le_metadata, additional, ATOMIC_RELEASE);
292 atomic_store_p(&elm->le_edata, bits, ATOMIC_RELEASE)
421 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, local
434 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, local
443 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, local
456 rtree_leaf_elm_t *elm; local
486 rtree_leaf_elm_t *elm = NULL; \/* Dead store. *\/ local
513 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, local
527 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, local
[all...] |
