Home
last modified time | relevance | path

Searched full:elm (Results 1 – 25 of 110) sorted by relevance

12345

/freebsd/crypto/openssh/openbsd-compat/
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
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); \
143 if (SPLAY_RIGHT(elm, field) != NULL) { \
144 elm = SPLAY_RIGHT(elm, field); \
[all …]
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
225 (elm)->field.sle_next = (slistelm)->field.sle_next; \
226 (slistelm)->field.sle_next = (elm); \
229 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
230 (elm)->field.sle_next = (head)->slh_first; \
231 (head)->slh_first = (elm); \
234 #define SLIST_REMOVE_AFTER(elm, field) do { \ argument
235 (elm)->field.sle_next = (elm)->field.sle_next->field.sle_next; \
242 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
[all …]
/freebsd/sys/sys/
H A Darb.h86 #define ARB_ENTRYINIT(elm, field) do { \ argument
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)) 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
113 ((elm) ? ((intptr_t)((((const uint8_t *)(elm)) - \
[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
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); \
153 if (SPLAY_RIGHT(elm, field) != NULL) { \
154 elm = SPLAY_RIGHT(elm, field); \
[all …]
H A Dqueue.h205 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) do { \ argument
206 if (*(prevp) != (elm)) \
208 (prevp), *(prevp), (elm)); \
211 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) argument
260 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
261 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
262 SLIST_NEXT((slistelm), field) = (elm); \
265 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
266 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
267 SLIST_FIRST((head)) = (elm); \
[all …]
/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
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); \
136 if (SPLAY_RIGHT(elm, field) != NULL) { \
137 elm = SPLAY_RIGHT(elm, field); \
[all …]
/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
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); \
136 if (SPLAY_RIGHT(elm, field) != NULL) { \
137 elm = SPLAY_RIGHT(elm, field); \
[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
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
129 (elm)->field.sle_next = (head)->slh_first; \
130 (head)->slh_first = (elm); \
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
175 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
[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
124 (elm)->field.sle_next = (slistelm)->field.sle_next; \
125 (slistelm)->field.sle_next = (elm); \
128 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
129 (elm)->field.sle_next = (head)->slh_first; \
130 (head)->slh_first = (elm); \
160 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
174 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
175 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
[all …]
/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
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__, __LINE__);
73 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, 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
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__, __LINE__);
73 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ argument
[all …]
/freebsd/contrib/libarchive/unzip/
H A Dla_queue.h175 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) do { \ argument
176 if (*(prevp) != (elm)) \
178 (prevp), *(prevp), (elm)); \
181 #define QMD_SLIST_CHECK_PREVPTR(prevp, elm) argument
230 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
231 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
232 SLIST_NEXT((slistelm), field) = (elm); \
235 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
236 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
237 SLIST_FIRST((head)) = (elm); \
[all …]
/freebsd/contrib/openbsm/compat/
H A Dqueue.h179 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
180 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
181 SLIST_NEXT((slistelm), field) = (elm); \
184 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
185 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
186 SLIST_FIRST((head)) = (elm); \
189 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
191 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
192 if (SLIST_FIRST((head)) == (elm)) { \
197 while (SLIST_NEXT(curelm, field) != (elm)) \
[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
106 do { (elm)->field.hte_hash = hashfn(elm); } while (0)
107 #define HT_SET_HASHVAL_(elm, field, val) \ argument
108 do { (elm)->field.hte_hash = (val); } while (0)
[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
106 do { (elm)->field.hte_hash = hashfn(elm); } while (0)
107 #define HT_SET_HASHVAL_(elm, field, val) \ argument
108 do { (elm)->field.hte_hash = (val); } while (0)
[all …]
/freebsd/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; in ber_get_element() local
66 if ((elm = calloc(1, sizeof(*elm))) == NULL) in ber_get_element()
69 elm->be_encoding = encoding; in ber_get_element()
70 ber_set_header(elm, BER_CLASS_UNIVERSAL, BER_TYPE_DEFAULT); in ber_get_element()
72 return elm; in ber_get_element()
76 ber_set_header(struct ber_element *elm, int class, unsigned long type) in ber_set_header() argument
78 elm->be_class = class & BER_CLASS_MASK; in ber_set_header()
80 type = elm->be_encoding; in ber_set_header()
81 elm->be_type = type; in ber_set_header()
[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
82 (*(((struct headname *)((elm)->field.tqe_prev))->tqh_last))
104 #define SM_TAILQ_INSERT_HEAD(head, elm, field) do { \ argument
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)->field.tqe_prev = &(head)->tqh_first; \
114 #define SM_TAILQ_INSERT_TAIL(head, elm, field) do { \ argument
[all …]
/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Drtree.h174 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_bits_read() argument
175 return (uintptr_t)atomic_load_p(&elm->le_bits, dependent in rtree_leaf_elm_bits_read()
212 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_extent_read() argument
214 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent); in rtree_leaf_elm_extent_read()
217 extent_t *extent = (extent_t *)atomic_load_p(&elm->le_extent, dependent in rtree_leaf_elm_extent_read()
225 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_szind_read() argument
227 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent); in rtree_leaf_elm_szind_read()
230 return (szind_t)atomic_load_u(&elm->le_szind, dependent ? ATOMIC_RELAXED in rtree_leaf_elm_szind_read()
237 rtree_leaf_elm_t *elm, bool dependent) { in rtree_leaf_elm_slab_read() argument
239 uintptr_t bits = rtree_leaf_elm_bits_read(tsdn, rtree, elm, dependent); in rtree_leaf_elm_slab_read()
[all …]
/freebsd/sys/contrib/ck/include/
H A Dck_queue.h148 #define CK_SLIST_NEXT(elm, field) \ argument
149 ck_pr_load_ptr(&((elm)->field.csle_next))
182 #define CK_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
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 { \ argument
189 (elm)->field.csle_next = (slistelm); \
191 ck_pr_store_ptr(prevp, elm); \
194 #define CK_SLIST_REMOVE_AFTER(elm, field) do { \ argument
195 ck_pr_store_ptr(&(elm)->field.csle_next, \
[all …]
/freebsd/share/man/man3/
H A Dqueue.3140 .Fn SLIST_INSERT_AFTER "TYPE *listelm" "TYPE *elm" "SLIST_ENTRY NAME"
141 .Fn SLIST_INSERT_HEAD "SLIST_HEAD *head" "TYPE *elm" "SLIST_ENTRY NAME"
142 .Fn SLIST_NEXT "TYPE *elm" "SLIST_ENTRY NAME"
143 .Fn SLIST_REMOVE "SLIST_HEAD *head" "TYPE *elm" "TYPE" "SLIST_ENTRY NAME"
144 .Fn SLIST_REMOVE_AFTER "TYPE *elm" "SLIST_ENTRY NAME"
161 .Fn STAILQ_INSERT_AFTER "STAILQ_HEAD *head" "TYPE *listelm" "TYPE *elm" "STAILQ_ENTRY NAME"
162 .Fn STAILQ_INSERT_HEAD "STAILQ_HEAD *head" "TYPE *elm" "STAILQ_ENTRY NAME"
163 .Fn STAILQ_INSERT_TAIL "STAILQ_HEAD *head" "TYPE *elm" "STAILQ_ENTRY NAME"
164 .Fn STAILQ_LAST "STAILQ_HEAD *head" "TYPE *elm" "STAILQ_ENTRY NAME"
165 .Fn STAILQ_NEXT "TYPE *elm" "STAILQ_ENTRY NAME"
[all …]
H A Dtree.3118 .Fn SPLAY_NEXT NAME "SPLAY_HEAD *head" "struct TYPE *elm"
124 .Fn SPLAY_FIND NAME "SPLAY_HEAD *head" "struct TYPE *elm"
126 .Fn SPLAY_LEFT "struct TYPE *elm" "SPLAY_ENTRY NAME"
128 .Fn SPLAY_RIGHT "struct TYPE *elm" "SPLAY_ENTRY NAME"
133 .Fn SPLAY_INSERT NAME "SPLAY_HEAD *head" "struct TYPE *elm"
135 .Fn SPLAY_REMOVE NAME "SPLAY_HEAD *head" "struct TYPE *elm"
168 .Fn RB_NEXT NAME "RB_HEAD *head" "struct TYPE *elm"
170 .Fn RB_PREV NAME "RB_HEAD *head" "struct TYPE *elm"
176 .Fn RB_FIND NAME "RB_HEAD *head" "struct TYPE *elm"
178 .Fn RB_NFIND NAME "RB_HEAD *head" "struct TYPE *elm"
[all …]
H A Darb.3128 .Fn ARB_ALLOCSIZE "ARB_HEAD *head" "int<8|16|32>_t maxnodes" "struct TYPE *elm"
141 .Fn ARB_NEXT NAME "ARB_HEAD *head" "struct TYPE *elm"
143 .Fn ARB_PREV NAME "ARB_HEAD *head" "struct TYPE *elm"
149 .Fn ARB_FIND NAME "ARB_HEAD *head" "struct TYPE *elm"
151 .Fn ARB_NFIND NAME "ARB_HEAD *head" "struct TYPE *elm"
153 .Fn ARB_LEFT "struct TYPE *elm" "ARB_ENTRY NAME"
155 .Fn ARB_LEFTIDX "struct TYPE *elm" "ARB_ENTRY NAME"
157 .Fn ARB_RIGHT "struct TYPE *elm" "ARB_ENTRY NAME"
159 .Fn ARB_RIGHTIDX "struct TYPE *elm" "ARB_ENTRY NAME"
161 .Fn ARB_PARENT "struct TYPE *elm" "ARB_ENTRY NAME"
[all …]
/freebsd/sys/contrib/device-tree/src/arm64/mediatek/
H A Dmt8173-elm.dts7 #include "mt8173-elm.dtsi"
10 model = "Google Elm";
12 compatible = "google,elm-rev8", "google,elm-rev7", "google,elm-rev6",
13 "google,elm-rev5", "google,elm-rev4", "google,elm-rev3",
14 "google,elm", "mediatek,mt8173";
/freebsd/sys/contrib/device-tree/Bindings/mtd/
H A Dti,elm.yaml4 $id: http://devicetree.org/schemas/mtd/ti,elm.yaml#
7 title: Texas Instruments Error Location Module (ELM).
13 ELM module is used together with GPMC and NAND Flash to detect
20 - ti,am3352-elm
21 - ti,am64-elm
42 Name of the HWMOD associated with ELM. This is for legacy
57 const: ti,am64-elm
68 elm: ecc@0 {
69 compatible = "ti,am3352-elm";
/freebsd/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, compare); \
[all …]

12345