Searched refs:elm (Results 1 - 25 of 46) sorted by relevance

12

/freebsd-current/crypto/heimdal/base/
H A Dheimqueue.h59 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \
63 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \
66 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \
67 if ((elm)->field.tqe_next && \
68 (elm)->field.tqe_next->field.tqe_prev != \
69 &(elm)->field.tqe_next) \
70 panic("HEIM_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
71 if (*(elm)->field.tqe_prev != (elm)) \
72 panic("HEIM_TAILQ_* back %p %s:%d", (elm), __FILE_
[all...]
/freebsd-current/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h59 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \
63 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \
66 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \
67 if ((elm)->field.tqe_next && \
68 (elm)->field.tqe_next->field.tqe_prev != \
69 &(elm)->field.tqe_next) \
70 panic("ASN1_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
71 if (*(elm)->field.tqe_prev != (elm)) \
72 panic("ASN1_TAILQ_* back %p %s:%d", (elm), __FILE_
[all...]
/freebsd-current/contrib/sendmail/include/sm/
H A Dtailq.h77 #define SM_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
81 #define SM_TAILQ_PREV(elm, headname, field) \
82 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
104 #define SM_TAILQ_INSERT_HEAD(head, elm, field) do { \
105 if (((elm)->field.tqe_next = (head)->tqh_first) != NULL) \
107 &(elm)->field.tqe_next; \
109 (head)->tqh_last = &(elm)->field.tqe_next; \
110 (head)->tqh_first = (elm); \
111 (elm)
[all...]
/freebsd-current/contrib/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \
129 (elm)->field.sle_next = (head)->slh_first; \
130 (head)->slh_first = (elm); \
160 #define LIST_NEXT(elm, field) ((elm)
[all...]
/freebsd-current/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \
129 (elm)->field.sle_next = (head)->slh_first; \
130 (head)->slh_first = (elm); \
160 #define LIST_NEXT(elm, field) ((elm)
[all...]
/freebsd-current/crypto/openssh/openbsd-compat/
H A Dsys-queue.h205 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
224 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
225 (elm)->field.sle_next = (slistelm)->field.sle_next; \
226 (slistelm)->field.sle_next = (elm); \
229 #define SLIST_INSERT_HEAD(head, elm, field) do { \
230 (elm)->field.sle_next = (head)->slh_first; \
231 (head)->slh_first = (elm); \
234 #define SLIST_REMOVE_AFTER(elm, field) do { \
235 (elm)
[all...]
H A Dsys-tree.h82 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
83 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
127 /* Finds the node with the same key as elm */ \
129 name##_SPLAY_FIND(struct name *head, struct type *elm) \
133 name##_SPLAY(head, elm); \
134 if ((cmp)(elm, (head)->sph_root) == 0) \
140 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
142 name##_SPLAY(head, elm); \
[all...]
/freebsd-current/crypto/heimdal/lib/gssapi/mech/
H A Dmechqueue.h60 #define HEIM_SLIST_INSERT_AFTER(slistelm, elm, field) do { \
61 (elm)->field.sle_next = (slistelm)->field.sle_next; \
62 (slistelm)->field.sle_next = (elm); \
65 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \
66 (elm)->field.sle_next = (head)->slh_first; \
67 (head)->slh_first = (elm); \
74 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \
75 if ((head)->slh_first == (elm)) { \
80 while(curelm->field.sle_next != (elm)) \
95 #define HEIM_SLIST_NEXT(elm, fiel
[all...]
/freebsd-current/lib/libc/iconv/
H A Dcitrus_hash.h46 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field)
47 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \
48 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
49 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \
51 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \
52 if (matchfunc((elm), key) == 0) \
/freebsd-current/contrib/openbsm/compat/
H A Dqueue.h179 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
180 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
181 SLIST_NEXT((slistelm), field) = (elm); \
184 #define SLIST_INSERT_HEAD(head, elm, field) do { \
185 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
186 SLIST_FIRST((head)) = (elm); \
189 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
191 #define SLIST_REMOVE(head, elm, type, field) do { \
192 if (SLIST_FIRST((head)) == (elm)) { \
[all...]
/freebsd-current/contrib/libevent/
H A Dht-internal.h52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm))
53 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm))
54 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm))
55 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm))
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm))
[all...]
/freebsd-current/contrib/ntp/sntp/libevent/
H A Dht-internal.h52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm))
53 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm))
54 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm))
55 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm))
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm))
[all...]
/freebsd-current/sys/sys/
H A Dqueue.h205 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) do { \
206 if (*(prevp) != (elm)) \
208 (prevp), *(prevp), (elm)); \
211 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm)
260 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
261 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
262 SLIST_NEXT((slistelm), field) = (elm); \
265 #define SLIST_INSERT_HEAD(head, elm, field) do { \
266 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
267 SLIST_FIRST((head)) = (elm); \
[all...]
H A Darb.h86 #define ARB_ENTRYINIT(elm, field) do { \
87 (elm)->field.arbe_parent_idx = \
88 (elm)->field.arbe_left_idx = \
89 (elm)->field.arbe_right_idx = ARB_NULLIDX; \
90 (elm)->field.arbe_color = ARB_NULLCOL; \
105 #define ARB_LEFT(head, elm, field) ARB_NODE(head, ARB_LEFTIDX(elm, field))
106 #define ARB_RIGHT(head, elm, field) ARB_NODE(head, ARB_RIGHTIDX(elm, field))
107 #define ARB_PARENT(head, elm, fiel
[all...]
H A Dtree.h92 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
93 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
137 /* Finds the node with the same key as elm */ \
139 name##_SPLAY_FIND(struct name *head, struct type *elm) \
143 name##_SPLAY(head, elm); \
144 if ((cmp)(elm, (head)->sph_root) == 0) \
150 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
152 name##_SPLAY(head, elm); \
[all...]
/freebsd-current/contrib/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
120 /* Finds the node with the same key as elm */ \
122 name##_SPLAY_FIND(struct name *head, struct type *elm) \
126 name##_SPLAY(head, elm); \
127 if ((cmp)(elm, (head)->sph_root) == 0) \
133 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
135 name##_SPLAY(head, elm); \
[all...]
/freebsd-current/contrib/ntp/sntp/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
120 /* Finds the node with the same key as elm */ \
122 name##_SPLAY_FIND(struct name *head, struct type *elm) \
126 name##_SPLAY(head, elm); \
127 if ((cmp)(elm, (head)->sph_root) == 0) \
133 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
135 name##_SPLAY(head, elm); \
[all...]
/freebsd-current/sys/contrib/ck/include/
H A Dck_queue.h148 #define CK_SLIST_NEXT(elm, field) \
149 ck_pr_load_ptr(&((elm)->field.csle_next))
182 #define CK_SLIST_INSERT_HEAD(head, elm, field) do { \
183 (elm)->field.csle_next = (head)->cslh_first; \
185 ck_pr_store_ptr(&(head)->cslh_first, elm); \
188 #define CK_SLIST_INSERT_PREVPTR(prevp, slistelm, elm, field) do { \
189 (elm)->field.csle_next = (slistelm); \
191 ck_pr_store_ptr(prevp, elm); \
194 #define CK_SLIST_REMOVE_AFTER(elm, field) do { \
195 ck_pr_store_ptr(&(elm)
[all...]
/freebsd-current/contrib/libarchive/unzip/
H A Dla_queue.h175 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) do { \
176 if (*(prevp) != (elm)) \
178 (prevp), *(prevp), (elm)); \
181 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm)
230 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
231 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
232 SLIST_NEXT((slistelm), field) = (elm); \
235 #define SLIST_INSERT_HEAD(head, elm, field) do { \
236 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
237 SLIST_FIRST((head)) = (elm); \
[all...]
/freebsd-current/usr.sbin/ypldap/
H A Dber.c50 static ssize_t ber_read_element(struct ber *ber, struct ber_element *elm);
64 struct ber_element *elm; local
66 if ((elm = calloc(1, sizeof(*elm))) == NULL)
69 elm->be_encoding = encoding;
70 ber_set_header(elm, BER_CLASS_UNIVERSAL, BER_TYPE_DEFAULT);
72 return elm;
76 ber_set_header(struct ber_element *elm, int class, unsigned long type) argument
78 elm->be_class = class & BER_CLASS_MASK;
80 type = elm
85 ber_link_elements(struct ber_element *prev, struct ber_element *elm) argument
100 struct ber_element *elm; local
132 struct ber_element *elm; local
145 struct ber_element *elm; local
158 struct ber_element *elm; local
187 struct ber_element *elm; local
214 ber_get_integer(struct ber_element *elm, long long *n) argument
224 ber_get_enumerated(struct ber_element *elm, long long *n) argument
237 struct ber_element *elm; local
251 ber_get_boolean(struct ber_element *elm, int *b) argument
269 struct ber_element *elm; local
290 ber_get_string(struct ber_element *elm, char **s) argument
300 ber_get_nstring(struct ber_element *elm, void **p, size_t *len) argument
313 struct ber_element *elm; local
334 ber_get_bitstring(struct ber_element *elm, void **v, size_t *len) argument
347 struct ber_element *elm; local
358 ber_get_null(struct ber_element *elm) argument
369 struct ber_element *elm; local
380 ber_get_eoc(struct ber_element *elm) argument
440 struct ber_element *elm; local
494 ber_get_oid(struct ber_element *elm, struct ber_oid *o) argument
807 ber_read_elements(struct ber *ber, struct ber_element *elm) argument
1066 ber_read_element(struct ber *ber, struct ber_element *elm) argument
[all...]
H A Daldap.c85 struct ber_element *root = NULL, *elm; local
96 elm = ber_printf_elements(root, "d{tdsst", ++ldap->msgid, BER_CLASS_APP,
99 if (elm == NULL)
122 struct ber_element *root = NULL, *elm; local
127 elm = ber_printf_elements(root, "d{t", ++ldap->msgid, BER_CLASS_APP,
129 if (elm == NULL)
212 aldap_create_page_control(struct ber_element *elm, int size, argument
235 if (ber_printf_elements(elm, "{t{sx", 2, 0, LDAP_PAGED_OID,
321 struct ber_element *elm; local
328 elm
698 aldap_get_stringset(struct ber_element *elm) argument
745 struct ber_element *elm; local
787 struct ber_element *elm, *root = NULL; local
[all...]
/freebsd-current/contrib/jemalloc/include/jemalloc/internal/
H A Drtree.h174 rtree_leaf_elm_t *elm, bool dependent) {
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, dependen
173 rtree_leaf_elm_bits_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, bool dependent) argument
211 rtree_leaf_elm_extent_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, bool dependent) argument
224 rtree_leaf_elm_szind_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, bool dependent) argument
236 rtree_leaf_elm_slab_read(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, bool dependent) argument
248 rtree_leaf_elm_extent_write(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, extent_t *extent) argument
262 rtree_leaf_elm_szind_write(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, szind_t szind) argument
280 rtree_leaf_elm_slab_write(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, bool slab) argument
295 rtree_leaf_elm_write(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, extent_t *extent, szind_t szind, bool slab) argument
314 rtree_leaf_elm_szind_slab_update(tsdn_t *tsdn, rtree_t *rtree, rtree_leaf_elm_t *elm, szind_t szind, bool slab) argument
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
465 rtree_leaf_elm_t *elm; local
494 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, local
515 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true); local
522 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true); local
[all...]
/freebsd-current/contrib/libucl/src/
H A Dtree.h122 (struct node *self, struct node *elm, int (*compare)(struct node *lhs, struct node *rhs)) \
125 return elm; \
126 if (compare(elm, self) < 0) \
127 self->field.avl_left= TREE_INSERT_##node##_##field(self->field.avl_left, elm, compare); \
129 self->field.avl_right= TREE_INSERT_##node##_##field(self->field.avl_right, elm, compare); \
134 (struct node *self, struct node *elm, int (*compare)(struct node *lhs, struct node *rhs)) \
138 if (compare(elm, self) == 0) \
140 if (compare(elm, self) < 0) \
141 return TREE_FIND_##node##_##field(self->field.avl_left, elm, compare); \
143 return TREE_FIND_##node##_##field(self->field.avl_right, elm, compar
[all...]
/freebsd-current/contrib/netbsd-tests/usr.bin/xlint/lint1/
H A Dd_nested_structs.c17 struct el_modes_s elm = { variable in typeref:struct:el_modes_s
/freebsd-current/contrib/elftoolchain/common/
H A D_elftc.h153 #define STAILQ_INSERT_HEAD(head, elm, field) do { \
154 if (((elm)->field.stqe_next = (head)->stqh_first) == NULL) \
155 (head)->stqh_last = &(elm)->field.stqe_next; \
156 (head)->stqh_first = (elm); \
161 #define STAILQ_INSERT_TAIL(head, elm, field) do { \
162 (elm)->field.stqe_next = NULL; \
163 *(head)->stqh_last = (elm); \
164 (head)->stqh_last = &(elm)->field.stqe_next; \
169 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \
170 if (((elm)
[all...]

Completed in 186 milliseconds

12