Home
last modified time | relevance | path

Searched refs:elm (Results 1 – 25 of 103) sorted by relevance

12345

/netbsd-src/external/bsd/openldap/dist/include/
H A Dldap_queue.h172 #define LDAP_SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
173 (elm)->field.sle_next = (slistelm)->field.sle_next; \
174 (slistelm)->field.sle_next = (elm); \
177 #define LDAP_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
178 (elm)->field.sle_next = (head)->slh_first; \
179 (head)->slh_first = (elm); \
182 #define LDAP_SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
188 #define LDAP_SLIST_REMOVE(head, elm, type, field) do { \ argument
189 if ((head)->slh_first == (elm)) { \
194 while( curelm->field.sle_next != (elm) ) \
[all …]
/netbsd-src/external/bsd/ntp/dist/sntp/libevent/compat/sys/
H A Dqueue.h111 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
125 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
126 (elm)->field.sle_next = (slistelm)->field.sle_next; \
127 (slistelm)->field.sle_next = (elm); \
130 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
131 (elm)->field.sle_next = (head)->slh_first; \
132 (head)->slh_first = (elm); \
162 #define LIST_NEXT(elm, field) ((elm)->field.le_next) argument
176 #define LIST_INSERT_AFTER(listelm, elm, field) do { \ argument
177 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
[all …]
/netbsd-src/sys/sys/
H A Dqueue.h121 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
141 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
142 (elm)->field.sle_next = (slistelm)->field.sle_next; \
143 (slistelm)->field.sle_next = (elm); \
146 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
147 (elm)->field.sle_next = (head)->slh_first; \
148 (head)->slh_first = (elm); \
160 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
161 if ((head)->slh_first == (elm)) { \
166 while(curelm->field.sle_next != (elm)) \
[all …]
H A Dtree.h76 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
77 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
123 name##_SPLAY_FIND(struct name *head, struct type *elm) \
127 name##_SPLAY(head, elm); \
128 if ((cmp)(elm, (head)->sph_root) == 0) \
134 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
136 name##_SPLAY(head, elm); \
137 if (SPLAY_RIGHT(elm, field) != NULL) { \
138 elm = SPLAY_RIGHT(elm, field); \
139 while (SPLAY_LEFT(elm, field) != NULL) { \
[all …]
/netbsd-src/crypto/external/bsd/heimdal/dist/lib/base/
H A Dheimqueue.h61 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \ argument
65 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \ argument
68 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \ argument
69 if ((elm)->field.tqe_next && \
70 (elm)->field.tqe_next->field.tqe_prev != \
71 &(elm)->field.tqe_next) \
72 panic("HEIM_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
73 if (*(elm)->field.tqe_prev != (elm)) \
74 panic("HEIM_TAILQ_* back %p %s:%d", (elm), __FILE__, __LINE__);
75 #define QUEUEDEBUG_HEIM_TAILQ_PREREMOVE(head, elm, field) \ argument
[all …]
/netbsd-src/crypto/external/bsd/heimdal/dist/lib/asn1/
H A Dasn1_queue.h61 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \ argument
65 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \ argument
68 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \ argument
69 if ((elm)->field.tqe_next && \
70 (elm)->field.tqe_next->field.tqe_prev != \
71 &(elm)->field.tqe_next) \
72 panic("ASN1_TAILQ_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
73 if (*(elm)->field.tqe_prev != (elm)) \
74 panic("ASN1_TAILQ_* back %p %s:%d", (elm), __FILE__, __LINE__);
75 #define QUEUEDEBUG_ASN1_TAILQ_PREREMOVE(head, elm, field) \ argument
[all …]
/netbsd-src/crypto/dist/ipsec-tools/src/include-glibc/sys/
H A Dqueue.h138 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
139 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
140 SLIST_NEXT((slistelm), field) = (elm); \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \ argument
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
148 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
150 #define SLIST_REMOVE(head, elm, type, field) do { \ argument
151 if (SLIST_FIRST((head)) == (elm)) { \
156 while (SLIST_NEXT(curelm, field) != (elm)) \
[all …]
/netbsd-src/external/bsd/ipf/dist/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
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); \
139 if (SPLAY_RIGHT(elm, field) != NULL) { \
140 elm = SPLAY_RIGHT(elm, field); \
141 while (SPLAY_LEFT(elm, field) != NULL) { \
[all …]
/netbsd-src/external/mit/libuv/dist/include/uv/
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
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); \
145 while (SPLAY_LEFT(elm, field) != NULL) { \
[all …]
/netbsd-src/external/bsd/libevent/dist/WIN32-Code/
H A Dtree.h76 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
77 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
123 name##_SPLAY_FIND(struct name *head, struct type *elm) \
127 name##_SPLAY(head, elm); \
128 if ((cmp)(elm, (head)->sph_root) == 0) \
134 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
136 name##_SPLAY(head, elm); \
137 if (SPLAY_RIGHT(elm, field) != NULL) { \
138 elm = SPLAY_RIGHT(elm, field); \
139 while (SPLAY_LEFT(elm, field) != NULL) { \
[all …]
/netbsd-src/external/bsd/ntp/dist/sntp/libevent/WIN32-Code/
H A Dtree.h77 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
78 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
124 name##_SPLAY_FIND(struct name *head, struct type *elm) \
128 name##_SPLAY(head, elm); \
129 if ((cmp)(elm, (head)->sph_root) == 0) \
135 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
137 name##_SPLAY(head, elm); \
138 if (SPLAY_RIGHT(elm, field) != NULL) { \
139 elm = SPLAY_RIGHT(elm, field); \
140 while (SPLAY_LEFT(elm, field) != NULL) { \
[all …]
/netbsd-src/external/bsd/ntp/dist/sntp/libevent/
H A Dht-internal.h54 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
55 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
56 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
57 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
59 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) argument
60 #define HT_NEXT_RMV(name, head, elm) name##_HT_NEXT_RMV((head), (elm)) argument
107 #define HT_SET_HASH_(elm, field, hashfn) \ argument
108 do { (elm)->field.hte_hash = hashfn(elm); } while (0)
109 #define HT_SET_HASHVAL_(elm, field, val) \ argument
110 do { (elm)->field.hte_hash = (val); } while (0)
[all …]
/netbsd-src/external/bsd/libevent/dist/
H A Dht-internal.h53 #define HT_FIND(name, head, elm) name##_HT_FIND((head), (elm)) argument
54 #define HT_INSERT(name, head, elm) name##_HT_INSERT((head), (elm)) argument
55 #define HT_REPLACE(name, head, elm) name##_HT_REPLACE((head), (elm)) argument
56 #define HT_REMOVE(name, head, elm) name##_HT_REMOVE((head), (elm)) argument
58 #define HT_NEXT(name, head, elm) name##_HT_NEXT((head), (elm)) argument
59 #define HT_NEXT_RMV(name, head, elm) name##_HT_NEXT_RMV((head), (elm)) argument
106 #define HT_SET_HASH_(elm, field, hashfn) \ argument
107 do { (elm)->field.hte_hash = hashfn(elm); } while (0)
108 #define HT_SET_HASHVAL_(elm, field, val) \ argument
109 do { (elm)->field.hte_hash = (val); } while (0)
[all …]
/netbsd-src/lib/libpthread/
H A Dpthread_queue.h69 #define PTQ_INSERT_HEAD(head, elm, field) do { \ argument
70 if (((elm)->field.ptqe_next = (head)->ptqh_first) != NULL) \
72 &(elm)->field.ptqe_next; \
74 (head)->ptqh_last = &(elm)->field.ptqe_next; \
75 (head)->ptqh_first = (elm); \
76 (elm)->field.ptqe_prev = &(head)->ptqh_first; \
79 #define PTQ_INSERT_TAIL(head, elm, field) do { \ argument
80 (elm)->field.ptqe_next = NULL; \
83 (elm)->field.ptqe_prev = (head)->ptqh_last; \
84 *(head)->ptqh_last = (elm); \
[all …]
/netbsd-src/external/mpl/dhcp/dist/keama/
H A Ddata.h79 #define TAILQ_INSERT_AFTER(head, listelm, elm) do { \ argument
80 if ((TAILQ_NEXT((elm)) = TAILQ_NEXT((listelm))) != NULL) \
81 TAILQ_NEXT((elm))->next.tqe_prev = \
82 &TAILQ_NEXT((elm)); \
84 (head)->tqh_last = &TAILQ_NEXT((elm)); \
86 TAILQ_NEXT((listelm)) = (elm); \
87 (elm)->next.tqe_prev = &TAILQ_NEXT((listelm)); \
90 #define TAILQ_INSERT_BEFORE(listelm, elm) do { \ argument
91 (elm)->next.tqe_prev = (listelm)->next.tqe_prev; \
92 TAILQ_NEXT((elm)) = (listelm); \
[all …]
/netbsd-src/sys/netinet/
H A Ddccp_tfrc.c560 struct s_hist_entry *elm, *elm2; in tfrc_send_free() local
579 elm = TAILQ_FIRST(&(cb->hist)); in tfrc_send_free()
580 while (elm != NULL) { in tfrc_send_free()
581 elm2 = TAILQ_NEXT(elm, linfo); in tfrc_send_free()
582 free(elm, M_TEMP); /* M_TEMP ?? */ in tfrc_send_free()
583 elm = elm2; in tfrc_send_free()
837 struct s_hist_entry *elm, *elm2; in tfrc_send_packet_recv() local
899 elm = TAILQ_FIRST(&(cb->hist)); in tfrc_send_packet_recv()
900 while (elm != NULL) { in tfrc_send_packet_recv()
901 if (elm->seq == cb->pcb->ack_rcv) in tfrc_send_packet_recv()
[all …]
/netbsd-src/sys/dev/acpi/
H A Dacpi_cpu_pstate.c311 ACPI_OBJECT *elm; in acpicpu_pstate_pss_add() local
320 elm = obj->Package.Elements; in acpicpu_pstate_pss_add()
324 if (elm[i].Type != ACPI_TYPE_INTEGER) in acpicpu_pstate_pss_add()
327 if (elm[i].Integer.Value > UINT32_MAX) in acpicpu_pstate_pss_add()
331 ps->ps_freq = elm[0].Integer.Value; in acpicpu_pstate_pss_add()
332 ps->ps_power = elm[1].Integer.Value; in acpicpu_pstate_pss_add()
333 ps->ps_latency = elm[2].Integer.Value; in acpicpu_pstate_pss_add()
334 ps->ps_latency_bm = elm[3].Integer.Value; in acpicpu_pstate_pss_add()
335 ps->ps_control = elm[4].Integer.Value; in acpicpu_pstate_pss_add()
336 ps->ps_status = elm[5].Integer.Value; in acpicpu_pstate_pss_add()
[all …]
H A Dacpi_bat.c358 ACPI_OBJECT *elm, *obj; in acpibat_get_info() local
369 elm = obj->Package.Elements; in acpibat_get_info()
371 if (elm[i].Type != ACPI_TYPE_INTEGER) { in acpibat_get_info()
375 if (elm[i].Integer.Value != ACPIBAT_VAL_UNKNOWN && in acpibat_get_info()
376 elm[i].Integer.Value >= INT_MAX) { in acpibat_get_info()
382 switch (elm[ACPIBAT_BIF_UNIT].Integer.Value) { in acpibat_get_info()
400 val = elm[ACPIBAT_BIF_DCAPACITY].Integer.Value; in acpibat_get_info()
405 val = elm[ACPIBAT_BIF_LFCCAPACITY].Integer.Value; in acpibat_get_info()
410 val = elm[ACPIBAT_BIF_DVOLTAGE].Integer.Value; in acpibat_get_info()
415 sc->sc_lcapacity = elm[ACPIBAT_BIF_LCAPACITY].Integer.Value * 1000; in acpibat_get_info()
[all …]
H A Dacpi_cpu_cstate.c163 ACPI_OBJECT *elm, *obj; in acpicpu_cstate_cst() local
186 elm = obj->Package.Elements; in acpicpu_cstate_cst()
188 if (elm[0].Type != ACPI_TYPE_INTEGER) { in acpicpu_cstate_cst()
193 n = elm[0].Integer.Value; in acpicpu_cstate_cst()
217 elm = &obj->Package.Elements[i]; in acpicpu_cstate_cst()
218 rv = acpicpu_cstate_cst_add(sc, elm); in acpicpu_cstate_cst()
234 acpicpu_cstate_cst_add(struct acpicpu_softc *sc, ACPI_OBJECT *elm) in acpicpu_cstate_cst_add() argument
245 if (elm->Type != ACPI_TYPE_PACKAGE) { in acpicpu_cstate_cst_add()
250 if (elm->Package.Count != 4) { in acpicpu_cstate_cst_add()
258 obj = &elm->Package.Elements[1]; in acpicpu_cstate_cst_add()
[all …]
H A Dacpi_wakedev.c66 ACPI_OBJECT *elm, *obj; in acpi_wakedev_init() local
99 elm = &obj->Package.Elements[0]; in acpi_wakedev_init()
101 switch (elm->Type) { in acpi_wakedev_init()
104 val = elm->Integer.Value; in acpi_wakedev_init()
110 if (elm->Package.Count < 2) { in acpi_wakedev_init()
117 if (elm->Package.Elements[0].Type != ACPI_TYPE_LOCAL_REFERENCE) in acpi_wakedev_init()
120 if (elm->Package.Elements[1].Type != ACPI_TYPE_INTEGER) in acpi_wakedev_init()
123 hdl = elm->Package.Elements[0].Reference.Handle; in acpi_wakedev_init()
124 val = elm->Package.Elements[1].Integer.Value; in acpi_wakedev_init()
141 elm in acpi_wakedev_init()
171 ACPI_OBJECT *elm; acpi_wakedev_power_add() local
[all...]
H A Dacpi_cpu_tstate.c303 ACPI_OBJECT *elm; in acpicpu_tstate_tss_add() local
314 elm = obj->Package.Elements; in acpicpu_tstate_tss_add()
318 if (elm[i].Type != ACPI_TYPE_INTEGER) in acpicpu_tstate_tss_add()
321 if (elm[i].Integer.Value > UINT32_MAX) in acpicpu_tstate_tss_add()
324 val[i] = elm[i].Integer.Value; in acpicpu_tstate_tss_add()
354 ACPI_OBJECT *elm, *obj; in acpicpu_tstate_ptc() local
378 elm = &obj->Package.Elements[i]; in acpicpu_tstate_ptc()
380 if (elm->Type != ACPI_TYPE_BUFFER) { in acpicpu_tstate_ptc()
385 if (size > elm->Buffer.Length) { in acpicpu_tstate_ptc()
390 reg[i] = (struct acpicpu_reg *)elm->Buffer.Pointer; in acpicpu_tstate_ptc()
[all …]
/netbsd-src/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/
H A Dmechqueue.h62 #define HEIM_SLIST_INSERT_AFTER(slistelm, elm, field) do { \ argument
63 (elm)->field.sle_next = (slistelm)->field.sle_next; \
64 (slistelm)->field.sle_next = (elm); \
67 #define HEIM_SLIST_INSERT_HEAD(head, elm, field) do { \ argument
68 (elm)->field.sle_next = (head)->slh_first; \
69 (head)->slh_first = (elm); \
76 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \ argument
77 if ((head)->slh_first == (elm)) { \
82 while(curelm->field.sle_next != (elm)) \
97 #define HEIM_SLIST_NEXT(elm, field) ((elm)->field.sle_next) argument
/netbsd-src/sys/external/gpl2/dts/dist/arch/arm64/boot/dts/mediatek/
H A Dmt8173-elm.dts7 #include "mt8173-elm.dtsi"
11 compatible = "google,elm-rev8", "google,elm-rev7", "google,elm-rev6",
12 "google,elm-rev5", "google,elm-rev4", "google,elm-rev3",
13 "google,elm", "mediatek,mt8173";
/netbsd-src/external/bsd/elftoolchain/dist/common/
H A D_elftc.h155 #define STAILQ_INSERT_HEAD(head, elm, field) do { \ argument
156 if (((elm)->field.stqe_next = (head)->stqh_first) == NULL) \
157 (head)->stqh_last = &(elm)->field.stqe_next; \
158 (head)->stqh_first = (elm); \
163 #define STAILQ_INSERT_TAIL(head, elm, field) do { \ argument
164 (elm)->field.stqe_next = NULL; \
165 *(head)->stqh_last = (elm); \
166 (head)->stqh_last = &(elm)->field.stqe_next; \
171 #define STAILQ_INSERT_AFTER(head, listelm, elm, field) do { \ argument
172 if (((elm)->field.stqe_next = (listelm)->field.stqe_next) == NULL)\
[all …]
/netbsd-src/lib/libc/citrus/
H A Dcitrus_hash.h43 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field) argument
44 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \ argument
45 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
46 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \ argument
48 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) { \
49 if (matchfunc((elm), key)==0) \

12345