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

12

/freebsd-11-stable/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-11-stable/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-11-stable/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-11-stable/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-11-stable/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-11-stable/lib/libc/iconv/
H A Dcitrus_hash.h45 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field)
46 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \
47 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
48 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \
50 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \
51 if (matchfunc((elm), key) == 0) \
/freebsd-11-stable/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-11-stable/contrib/ipfilter/sys/
H A Dtree.h78 #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...]
/freebsd-11-stable/crypto/openssh/openbsd-compat/
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...]
H A Dsys-queue.h198 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
217 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
218 (elm)->field.sle_next = (slistelm)->field.sle_next; \
219 (slistelm)->field.sle_next = (elm); \
222 #define SLIST_INSERT_HEAD(head, elm, field) do { \
223 (elm)->field.sle_next = (head)->slh_first; \
224 (head)->slh_first = (elm); \
227 #define SLIST_REMOVE_AFTER(elm, field) do { \
228 (elm)
[all...]
/freebsd-11-stable/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...]
H A Devent-internal.h379 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
390 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
391 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
392 (elm)->field.tqe_next = (listelm); \
393 *(listelm)->field.tqe_prev = (elm); \
394 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
/freebsd-11-stable/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-11-stable/sys/contrib/ck/include/
H A Dck_queue.h148 #define CK_SLIST_NEXT(elm, field) \
149 ck_pr_load_ptr(&((elm)->field.csle_next))
177 #define CK_SLIST_INSERT_HEAD(head, elm, field) do { \
178 (elm)->field.csle_next = (head)->cslh_first; \
180 ck_pr_store_ptr(&(head)->cslh_first, elm); \
183 #define CK_SLIST_INSERT_PREVPTR(prevp, slistelm, elm, field) do { \
184 (elm)->field.csle_next = (slistelm); \
186 ck_pr_store_ptr(prevp, elm); \
189 #define CK_SLIST_REMOVE_AFTER(elm, field) do { \
190 ck_pr_store_ptr(&(elm)
[all...]
/freebsd-11-stable/sys/sys/
H A Dqueue.h237 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
238 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
239 SLIST_NEXT((slistelm), field) = (elm); \
242 #define SLIST_INSERT_HEAD(head, elm, field) do { \
243 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
244 SLIST_FIRST((head)) = (elm); \
247 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
249 #define SLIST_REMOVE(head, elm, type, field) do { \
250 QMD_SAVELINK(oldnext, (elm)
[all...]
H A Dtree.h80 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
81 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
125 /* Finds the node with the same key as elm */ \
127 name##_SPLAY_FIND(struct name *head, struct type *elm) \
131 name##_SPLAY(head, elm); \
132 if ((cmp)(elm, (head)->sph_root) == 0) \
138 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
140 name##_SPLAY(head, elm); \
[all...]
/freebsd-11-stable/usr.sbin/ypldap/
H A Dber.c51 static ssize_t ber_read_element(struct ber *ber, struct ber_element *elm);
65 struct ber_element *elm; local
67 if ((elm = calloc(1, sizeof(*elm))) == NULL)
70 elm->be_encoding = encoding;
71 ber_set_header(elm, BER_CLASS_UNIVERSAL, BER_TYPE_DEFAULT);
73 return elm;
77 ber_set_header(struct ber_element *elm, int class, unsigned long type) argument
79 elm->be_class = class & BER_CLASS_MASK;
81 type = elm
86 ber_link_elements(struct ber_element *prev, struct ber_element *elm) argument
101 struct ber_element *elm; local
133 struct ber_element *elm; local
146 struct ber_element *elm; local
159 struct ber_element *elm; local
188 struct ber_element *elm; local
215 ber_get_integer(struct ber_element *elm, long long *n) argument
225 ber_get_enumerated(struct ber_element *elm, long long *n) argument
238 struct ber_element *elm; local
252 ber_get_boolean(struct ber_element *elm, int *b) argument
270 struct ber_element *elm; local
291 ber_get_string(struct ber_element *elm, char **s) argument
301 ber_get_nstring(struct ber_element *elm, void **p, size_t *len) argument
314 struct ber_element *elm; local
335 ber_get_bitstring(struct ber_element *elm, void **v, size_t *len) argument
348 struct ber_element *elm; local
359 ber_get_null(struct ber_element *elm) argument
370 struct ber_element *elm; local
381 ber_get_eoc(struct ber_element *elm) argument
441 struct ber_element *elm; local
495 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.c86 struct ber_element *root = NULL, *elm; local
97 elm = ber_printf_elements(root, "d{tdsst", ++ldap->msgid, BER_CLASS_APP,
100 if (elm == NULL)
123 struct ber_element *root = NULL, *elm; local
128 elm = ber_printf_elements(root, "d{t", ++ldap->msgid, BER_CLASS_APP,
130 if (elm == NULL)
213 aldap_create_page_control(struct ber_element *elm, int size, argument
236 if (ber_printf_elements(elm, "{t{sx", 2, 0, LDAP_PAGED_OID,
322 struct ber_element *elm; local
329 elm
699 aldap_get_stringset(struct ber_element *elm) argument
746 struct ber_element *elm; local
788 struct ber_element *elm, *root = NULL; local
[all...]
/freebsd-11-stable/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-11-stable/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-11-stable/contrib/jemalloc/include/jemalloc/internal/
H A Drtree.h104 rtree_node_elm_t *elm, unsigned level);
115 rtree_node_elm_t *rtree_child_tryread(rtree_node_elm_t *elm,
117 rtree_node_elm_t *rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm,
119 extent_node_t *rtree_val_read(rtree_t *rtree, rtree_node_elm_t *elm,
121 void rtree_val_write(rtree_t *rtree, rtree_node_elm_t *elm,
164 rtree_child_tryread(rtree_node_elm_t *elm, bool dependent) argument
169 child = elm->child;
171 child = atomic_read_p(&elm->pun);
177 rtree_child_read(rtree_t *rtree, rtree_node_elm_t *elm, unsigned level, argument
182 child = rtree_child_tryread(elm, dependen
190 rtree_val_read(rtree_t *rtree, rtree_node_elm_t *elm, bool dependent) argument
212 rtree_val_write(rtree_t *rtree, rtree_node_elm_t *elm, const extent_node_t *val) argument
[all...]
/freebsd-11-stable/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...]
/freebsd-11-stable/contrib/libucl/python/src/
H A Duclmodule.c161 ucl_object_t *top, *elm; local
167 elm = _iterate_python(value);
184 ucl_object_insert_key (top, elm, keystr, 0, true);
192 ucl_object_t *top, *elm; local
199 elm = _iterate_python(value);
200 ucl_array_append(top, elm);
/freebsd-11-stable/contrib/jemalloc/src/
H A Dtcache.c452 tcaches_t *elm; local
471 elm = tcaches_avail;
473 elm->tcache = tcache;
474 *r_ind = (unsigned)(elm - tcaches);
476 elm = &tcaches[tcaches_past];
477 elm->tcache = tcache;
486 tcaches_elm_flush(tsd_t *tsd, tcaches_t *elm) argument
489 if (elm->tcache == NULL)
491 tcache_destroy(tsd, elm->tcache);
492 elm
505 tcaches_t *elm = &tcaches[ind]; local
[all...]
/freebsd-11-stable/libexec/rtld-elf/
H A Drtld.c2005 const Objlist_Entry *elm; local
2022 STAILQ_FOREACH(elm, &root->dagmembers, link) {
2023 for (needed = elm->obj->needed; needed != NULL; needed = needed->next) {
2087 const Objlist_Entry *elm; local
2100 STAILQ_FOREACH(elm, &root->dagmembers, link) {
2101 obj = elm->obj;
2661 Objlist_Entry *elm; local
2677 STAILQ_FOREACH(elm, list, link) {
2678 if (root != NULL && (elm->obj->refcount != 1 ||
2679 objlist_find(&root->dagmembers, elm
2736 Objlist_Entry *elm; local
2812 Objlist_Entry *elm; local
2824 Objlist_Entry *elm; local
2841 Objlist_Entry *elm; local
2851 Objlist_Entry *elm; local
2861 Objlist_Entry *elm, *listelm; local
2878 Objlist_Entry *elm; local
2895 Objlist_Entry *elm; local
3060 Objlist_Entry *elm; local
4187 const Objlist_Entry *elm; local
4231 const Objlist_Entry *elm; local
4291 const Objlist_Entry *elm; local
4755 Objlist_Entry *elm; local
4773 Objlist_Entry *elm; local
4783 Objlist_Entry *elm; local
5456 Objlist_Entry *elm; local
[all...]

Completed in 332 milliseconds

12