Home
last modified time | relevance | path

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

12

/freebsd-12.1/crypto/heimdal/lib/asn1/
H A Dasn1_queue.h66 #define QUEUEDEBUG_ASN1_TAILQ_OP(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
94 #define ASN1_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
105 #define ASN1_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
132 #define ASN1_TAILQ_REMOVE(head, elm, field) do { \ argument
[all …]
/freebsd-12.1/crypto/heimdal/base/
H A Dheimqueue.h66 #define QUEUEDEBUG_HEIM_TAILQ_OP(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
94 #define HEIM_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
105 #define HEIM_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
132 #define HEIM_TAILQ_REMOVE(head, elm, field) do { \ argument
[all …]
/freebsd-12.1/contrib/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) 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
299 #define TAILQ_PREV(elm, headname, field) \ argument
322 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
332 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
356 #define TAILQ_REMOVE(head, elm, field) do { \ argument
[all …]
/freebsd-12.1/contrib/ntp/sntp/libevent/compat/sys/
H A Dqueue.h109 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) 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
299 #define TAILQ_PREV(elm, headname, field) \ argument
322 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
332 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
356 #define TAILQ_REMOVE(head, elm, field) do { \ argument
[all …]
/freebsd-12.1/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
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((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
114 #define HT_ELT_HASH_(elm, field, hashfn) \ argument
116 #define HT_SET_HASHVAL_(elm, field, val) \ argument
121 #define HT_BUCKET_(head, field, elm, hashfn) \ argument
[all …]
/freebsd-12.1/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
57 #define HT_NEXT(name, head, elm) name##_HT_NEXT((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
114 #define HT_ELT_HASH_(elm, field, hashfn) \ argument
116 #define HT_SET_HASHVAL_(elm, field, val) \ argument
121 #define HT_BUCKET_(head, field, elm, hashfn) \ argument
[all …]
/freebsd-12.1/crypto/openssh/openbsd-compat/
H A Dsys-queue.h227 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
232 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
240 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
311 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
318 #define LIST_REMOVE(elm, field) do { \ argument
327 #define LIST_REPLACE(elm, elm2, field) do { \ argument
436 #define TAILQ_PREV(elm, headname, field) \ argument
472 #define TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
482 #define TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
506 #define TAILQ_REMOVE(head, 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-12.1/contrib/openbsm/compat/
H A Dqueue.h184 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
191 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
338 #define QMD_LIST_CHECK_NEXT(elm, field) do { \ argument
345 #define QMD_LIST_CHECK_PREV(elm, field) do { \ argument
351 #define QMD_LIST_CHECK_NEXT(elm, field) argument
352 #define QMD_LIST_CHECK_PREV(elm, field) argument
390 #define LIST_INSERT_HEAD(head, elm, field) do { \ argument
398 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
400 #define LIST_REMOVE(elm, field) do { \ argument
524 #define TAILQ_PREV(elm, headname, field) \ argument
[all …]
/freebsd-12.1/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-12.1/sys/contrib/ck/include/
H A Dck_queue.h148 #define CK_SLIST_NEXT(elm, field) \ argument
177 #define CK_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
189 #define CK_SLIST_REMOVE_AFTER(elm, field) do { \ argument
194 #define CK_SLIST_REMOVE(head, elm, type, field) do { \ argument
285 #define CK_STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
293 #define CK_STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
300 #define CK_STAILQ_NEXT(elm, field) \ argument
303 #define CK_STAILQ_REMOVE(head, elm, type, field) do { \ argument
314 #define CK_STAILQ_REMOVE_AFTER(head, elm, field) do { \ argument
404 #define CK_LIST_INSERT_HEAD(head, elm, field) do { \ argument
[all …]
/freebsd-12.1/usr.sbin/ypldap/
H A Dber.c65 struct ber_element *elm; in ber_get_element() local
101 struct ber_element *elm; in ber_unlink_elements() local
133 struct ber_element *elm; in ber_add_sequence() local
146 struct ber_element *elm; in ber_add_set() local
159 struct ber_element *elm; in ber_add_enumerated() local
188 struct ber_element *elm; in ber_add_integer() local
238 struct ber_element *elm; in ber_add_boolean() local
270 struct ber_element *elm; in ber_add_nstring() local
314 struct ber_element *elm; in ber_add_bitstring() local
348 struct ber_element *elm; in ber_add_null() local
[all …]
H A Daldap.c86 struct ber_element *root = NULL, *elm; in aldap_bind() local
123 struct ber_element *root = NULL, *elm; in aldap_unbind() local
213 aldap_create_page_control(struct ber_element *elm, int size, in aldap_create_page_control()
322 struct ber_element *elm; in aldap_parse_page_control() local
699 aldap_get_stringset(struct ber_element *elm) in aldap_get_stringset()
746 struct ber_element *elm; in ldap_parse_search_filter() local
788 struct ber_element *elm, *root = NULL; in ldap_do_parse_search_filter() local
/freebsd-12.1/sys/sys/
H A Dqueue.h216 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) argument
291 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
497 #define QMD_LIST_CHECK_NEXT(elm, field) do { \ argument
515 #define QMD_LIST_CHECK_NEXT(elm, field) argument
516 #define QMD_LIST_CHECK_PREV(elm, field) argument
591 #define LIST_PREV(elm, head, type, field) \ argument
596 #define LIST_REMOVE(elm, field) do { \ argument
705 #define QMD_TAILQ_CHECK_NEXT(elm, field) argument
706 #define QMD_TAILQ_CHECK_PREV(elm, field) argument
833 #define TAILQ_PREV(elm, headname, field) \ argument
[all …]
H A Dtree.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-12.1/contrib/jemalloc/include/jemalloc/internal/
H A Drtree.h212 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_extent_read()
225 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_szind_read()
237 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_slab_read()
249 rtree_leaf_elm_t *elm, extent_t *extent) { in rtree_leaf_elm_extent_write()
263 rtree_leaf_elm_t *elm, szind_t szind) { in rtree_leaf_elm_szind_write()
281 rtree_leaf_elm_t *elm, bool slab) { in rtree_leaf_elm_slab_write()
315 rtree_leaf_elm_t *elm, szind_t szind, bool slab) { in rtree_leaf_elm_szind_slab_update()
418 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, in rtree_extent_read() local
429 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, in rtree_szind_read() local
445 rtree_leaf_elm_t *elm = rtree_read(tsdn, rtree, rtree_ctx, key, in rtree_extent_szind_read() local
[all …]
/freebsd-12.1/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-12.1/lib/libc/iconv/
H A Dcitrus_hash.h47 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field) argument
48 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \ argument
50 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \ argument
/freebsd-12.1/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-12.1/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-12.1/contrib/ipfilter/sys/
H A Dtree.h78 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
79 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
323 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
324 #define RB_RIGHT(elm, field) (elm)->field.rbe_right argument
325 #define RB_PARENT(elm, field) (elm)->field.rbe_parent argument
326 #define RB_COLOR(elm, field) (elm)->field.rbe_color argument
330 #define RB_SET(elm, parent, field) do { \ argument
345 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ argument
365 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ argument
/freebsd-12.1/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
/freebsd-12.1/contrib/jemalloc/src/
H A Drtree.c165 rtree_child_node_tryread(rtree_node_elm_t *elm, bool dependent) { in rtree_child_node_tryread()
181 rtree_child_node_read(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *elm, in rtree_child_node_read()
194 rtree_child_leaf_tryread(rtree_node_elm_t *elm, bool dependent) { in rtree_child_leaf_tryread()
210 rtree_child_leaf_read(tsdn_t *tsdn, rtree_t *rtree, rtree_node_elm_t *elm, in rtree_child_leaf_read()
/freebsd-12.1/sys/dts/arm/
H A Dpandaboard-common.dtsi45 elm: elm@48078000 { label
/freebsd-12.1/contrib/elftoolchain/common/
H A D_elftc.h153 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
161 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
169 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
184 #define STAILQ_NEXT(elm, field) ((elm)->field.stqe_next) argument
188 #define STAILQ_REMOVE(head, elm, type, field) do { \ argument

12