Home
last modified time | relevance | path

Searched defs:elm (Results 1 – 25 of 55) sorted by relevance

123

/freebsd/crypto/heimdal/base/
H A Dheimqueue.h59 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \ argument
63 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \ argument
66 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \ argument
73 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) \ argument
78 #define QUEUEDEBUG_HEIM_TAILQ_POSTREMOVE(elm, field) \ argument
82 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) argument
83 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) argument
84 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) argument
85 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) argument
86 #define QUEUEDEBUG_HEIM_TAILQ_POSTREMOVE(elm, field) argument
[all …]
/freebsd/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h59 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ argument
63 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ argument
66 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \ argument
73 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ argument
78 #define QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field) \ argument
82 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) argument
83 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) argument
84 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) argument
85 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) argument
86 #define QUEUEDEBUG_ASN1_TAILQ_POSTREMOVE(elm, field) argument
[all …]
/freebsd/crypto/krb5/src/plugins/kdb/db2/libdb2/include/
H A Ddb-queue.h89 #define LIST_INSERT_AFTER(listelm, elm, field) { \ argument
97 #define LIST_INSERT_HEAD(head, elm, field) { \ argument
104 #define LIST_REMOVE(elm, field) { \ argument
134 #define TAILQ_INSERT_HEAD(head, elm, field) { \ argument
144 #define TAILQ_INSERT_TAIL(head, elm, field) { \ argument
151 #define TAILQ_INSERT_AFTER(head, listelm, elm, field) { \ argument
161 #define TAILQ_REMOVE(head, elm, field) { \ argument
193 #define CIRCLEQ_INSERT_AFTER(head, listelm, elm, field) { \ argument
203 #define CIRCLEQ_INSERT_BEFORE(head, listelm, elm, field) { \ argument
213 #define CIRCLEQ_INSERT_HEAD(head, elm, field) { \ argument
[all …]
/freebsd/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
182 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
189 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
196 #define LIST_REMOVE(elm, field) do { \ argument
203 #define LIST_REPLACE(elm, elm2, field) do { \ argument
234 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
[all …]
/freebsd/contrib/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
123 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
182 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
189 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
196 #define LIST_REMOVE(elm, field) do { \ argument
203 #define LIST_REPLACE(elm, elm2, field) do { \ argument
234 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next) argument
[all …]
/freebsd/contrib/ntp/sntp/libevent/
H A Dht-internal.h52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
53 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
54 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
55 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) argument
58 #define HT_NEXT_RMV(name, head, elm) name##_HT_NEXT_RMV((head), (elm)) argument
105 #define HT_SET_HASH_(elm, field, hashfn) \ argument
107 #define HT_SET_HASHVAL_(elm, field, val) \ argument
109 #define HT_ELT_HASH_(elm, field, hashfn) \ argument
112 #define HT_SET_HASH_(elm, field, hashfn) \ argument
[all …]
/freebsd/contrib/libevent/
H A Dht-internal.h52 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
53 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
54 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
55 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) argument
58 #define HT_NEXT_RMV(name, head, elm) name##_HT_NEXT_RMV((head), (elm)) argument
105 #define HT_SET_HASH_(elm, field, hashfn) \ argument
107 #define HT_SET_HASHVAL_(elm, field, val) \ argument
109 #define HT_ELT_HASH_(elm, field, hashfn) \ argument
112 #define HT_SET_HASH_(elm, field, hashfn) \ argument
[all …]
/freebsd/crypto/krb5/src/include/
H A Dk5-queue.h114 #define K5_LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
122 #define K5_LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
129 #define K5_LIST_INSERT_HEAD(head, elm, field) do { \ argument
136 #define K5_LIST_REMOVE(elm, field) do { \ argument
157 #define K5_LIST_NEXT(elm, field) ((elm)->field.le_next) argument
183 #define K5_SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
188 #define K5_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
197 #define K5_SLIST_REMOVE(head, elm, type, field) do { \ argument
228 #define K5_SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
256 #define K5_STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/freebsd/crypto/openssh/openbsd-compat/
H A Dsys-queue.h205 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
224 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
229 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
234 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
242 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
279 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
298 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
306 #define LIST_INSERT_BEFORE(listelm, elm, field) do { \ argument
313 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
320 #define LIST_REMOVE(elm, field) do { \ argument
[all …]
H A Dsys-tree.h82 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
83 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
320 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
321 #define RB_RIGHT(elm, field) (elm)->field.rbe_right argument
322 #define RB_PARENT(elm, field) (elm)->field.rbe_parent argument
323 #define RB_COLOR(elm, field) (elm)->field.rbe_color argument
327 #define RB_SET(elm, parent, field) do { \ argument
342 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ argument
362 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ argument
/freebsd/contrib/openbsm/compat/
H A Dqueue.h179 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
184 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
189 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
191 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
257 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
263 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
269 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
281 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
283 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument
304 #define STAILQ_REMOVE_HEAD_UNTIL(head, elm, field) do { \ argument
[all …]
/freebsd/contrib/sendmail/include/sm/
H A Dtailq.h77 #define SM_TAILQ_NEXT(elm, field) ((elm)->field.tqe_next) argument
81 #define SM_TAILQ_PREV(elm, headname, field) \ argument
104 #define SM_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
114 #define SM_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
121 #define SM_TAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
131 #define SM_TAILQ_INSERT_BEFORE(listelm, elm, field) do { \ argument
138 #define SM_TAILQ_REMOVE(head, elm, field) do { \ argument
147 #define SM_TAILQ_REPLACE(head, elm, elm2, field) do { \ argument
/freebsd/usr.sbin/ypldap/
H A Dber.c64 struct ber_element *elm; in ber_get_element() local
76 ber_set_header(struct ber_element *elm, int class, unsigned long type) in ber_set_header()
85 ber_link_elements(struct ber_element *prev, struct ber_element *elm) in ber_link_elements()
100 struct ber_element *elm; in ber_unlink_elements() local
132 struct ber_element *elm; in ber_add_sequence() local
145 struct ber_element *elm; in ber_add_set() local
158 struct ber_element *elm; in ber_add_enumerated() local
187 struct ber_element *elm; in ber_add_integer() local
214 ber_get_integer(struct ber_element *elm, long long *n) in ber_get_integer()
224 ber_get_enumerated(struct ber_element *elm, long long *n) in ber_get_enumerated()
[all …]
H A Daldap.c85 struct ber_element *root = NULL, *elm; in aldap_bind() local
122 struct ber_element *root = NULL, *elm; in aldap_unbind() local
212 aldap_create_page_control(struct ber_element *elm, int size, in aldap_create_page_control()
321 struct ber_element *elm; in aldap_parse_page_control() local
698 aldap_get_stringset(struct ber_element *elm) in aldap_get_stringset()
745 struct ber_element *elm; in ldap_parse_search_filter() local
787 struct ber_element *elm, *root = NULL; in ldap_do_parse_search_filter() local
/freebsd/contrib/libarchive/unzip/
H A Dla_queue.h175 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) do { \ argument
181 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) argument
230 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
235 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
240 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
242 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
256 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
265 #define SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \ argument
345 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
351 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/freebsd/sys/contrib/ck/include/
H A Dck_queue.h148 #define CK_SLIST_NEXT(elm, field) \ argument
182 #define CK_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
188 #define CK_SLIST_INSERT_PREVPTR(prevp, slistelm, elm, field) do { \ argument
194 #define CK_SLIST_REMOVE_AFTER(elm, field) do { \ argument
199 #define CK_SLIST_REMOVE(head, elm, type, field) do { \ argument
215 #define CK_SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \ argument
287 #define CK_STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
295 #define CK_STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
303 #define CK_STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
310 #define CK_STAILQ_NEXT(elm, field) \ argument
[all …]
/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Drtree.h174 rtree_leaf_elm_bits_read(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,bool dependent) rtree_leaf_elm_bits_read() argument
212 rtree_leaf_elm_extent_read(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,bool dependent) rtree_leaf_elm_extent_read() argument
225 rtree_leaf_elm_szind_read(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,bool dependent) rtree_leaf_elm_szind_read() argument
237 rtree_leaf_elm_slab_read(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,bool dependent) rtree_leaf_elm_slab_read() argument
249 rtree_leaf_elm_extent_write(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,extent_t * extent) rtree_leaf_elm_extent_write() argument
263 rtree_leaf_elm_szind_write(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,szind_t szind) rtree_leaf_elm_szind_write() argument
281 rtree_leaf_elm_slab_write(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,bool slab) rtree_leaf_elm_slab_write() argument
296 rtree_leaf_elm_write(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,extent_t * extent,szind_t szind,bool slab) rtree_leaf_elm_write() argument
315 rtree_leaf_elm_szind_slab_update(tsdn_t * tsdn,rtree_t * rtree,rtree_leaf_elm_t * elm,szind_t szind,bool slab) rtree_leaf_elm_szind_slab_update() argument
391 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, rtree_write() local
406 rtree_leaf_elm_t *elm = rtree_leaf_elm_lookup(tsdn, rtree, rtree_ctx, rtree_read() local
418 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, rtree_extent_read() local
429 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, rtree_szind_read() local
445 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, rtree_extent_szind_read() local
465 rtree_leaf_elm_t *elm; rtree_szind_slab_read_fast() local
494 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, rtree_szind_slab_read() local
515 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true); rtree_szind_slab_update() local
522 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, true); rtree_clear() local
[all...]
/freebsd/sys/sys/
H A Dqueue.h262 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) \ argument
324 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
329 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
334 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
336 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
348 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
361 #define SLIST_REMOVE_PREVPTR(prevp, elm, field) do { \ argument
367 #define SLIST_SPLIT_AFTER(head, elm, rest, field) do { \ argument
488 #define STAILQ_INSERT_AFTER(head, tqelm, elm, field) do { \ argument
494 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
H A Darb.h86 #define ARB_ENTRYINIT(elm, field) do { \ argument
105 #define ARB_LEFT(head, elm, field) ARB_NODE(head, ARB_LEFTIDX(elm, field)) argument
106 #define ARB_RIGHT(head, elm, field) ARB_NODE(head, ARB_RIGHTIDX(elm, field)) argument
107 #define ARB_PARENT(head, elm, field) ARB_NODE(head, ARB_PARENTIDX(elm, field)) argument
112 #define ARB_SELFIDX(head, elm) \ argument
116 #define ARB_LEFTIDX(elm, field) (elm)->field.arbe_left_idx argument
117 #define ARB_RIGHTIDX(elm, field) (elm)->field.arbe_right_idx argument
118 #define ARB_PARENTIDX(elm, field) (elm)->field.arbe_parent_idx argument
119 #define ARB_COLOR(elm, field) (elm)->field.arbe_color argument
120 #define ARB_PREVFREE(head, elm, field) \ argument
[all …]
H A Dtree.h92 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
93 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
332 #define _RB_LINK(elm, dir, field) (elm)->field.rbe_link[dir] argument
333 #define _RB_UP(elm, field) _RB_LINK(elm, 0, field) argument
337 #define _RB_BITS(elm) (*(__uintptr_t *)&elm) argument
338 #define _RB_BITSUP(elm, field) _RB_BITS(_RB_UP(elm, field)) argument
339 #define _RB_PTR(elm) (__typeof(elm)) \ argument
342 #define RB_PARENT(elm, field) _RB_PTR(_RB_UP(elm, field)) argument
343 #define RB_LEFT(elm, field) _RB_LINK(elm, _RB_L, field) argument
344 #define RB_RIGHT(elm, field) _RB_LINK(elm, _RB_R, field) argument
[all …]
/freebsd/crypto/heimdal/lib/gssapi/mech/
H A Dmechqueue.h60 #define HEIM_SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
65 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
74 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \ argument
95 #define HEIM_SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
/freebsd/lib/libc/iconv/
H A Dcitrus_hash.h46 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field) argument
47 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \ argument
49 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \ argument
/freebsd/contrib/ntp/sntp/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
313 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
314 #define RB_RIGHT(elm, field) (elm)->field.rbe_right argument
315 #define RB_PARENT(elm, field) (elm)->field.rbe_parent argument
316 #define RB_COLOR(elm, field) (elm)->field.rbe_color argument
320 #define RB_SET(elm, parent, field) do { \ argument
335 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ argument
355 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ argument
/freebsd/contrib/libevent/WIN32-Code/
H A Dtree.h75 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
76 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
313 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
314 #define RB_RIGHT(elm, field) (elm)->field.rbe_right argument
315 #define RB_PARENT(elm, field) (elm)->field.rbe_parent argument
316 #define RB_COLOR(elm, field) (elm)->field.rbe_color argument
320 #define RB_SET(elm, parent, field) do { \ argument
335 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ argument
355 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ argument
/freebsd/contrib/libucl/src/
H A Dtree.h195 #define TREE_INSERT(head, node, field, elm) \ argument
198 #define TREE_FIND(head, node, field, elm) \ argument
201 #define TREE_REMOVE(head, node, field, elm) \ argument

123