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

12

/netbsd-6-1-5-RELEASE/dist/nvi/include/sys/
H A Dqueue.h91 #define LIST_INSERT_AFTER(listelm, elm, field) { \
92 if (((elm)->field.le_next = (listelm)->field.le_next) != NULL) \
94 &(elm)->field.le_next; \
95 (listelm)->field.le_next = (elm); \
96 (elm)->field.le_prev = &(listelm)->field.le_next; \
99 #define LIST_INSERT_BEFORE(listelm, elm, field) { \
100 (elm)->field.le_prev = (listelm)->field.le_prev; \
101 (elm)->field.le_next = (listelm); \
102 *(listelm)->field.le_prev = (elm); \
103 (listelm)->field.le_prev = &(elm)
[all...]
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/base/
H A Dheimqueue.h61 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_HEAD(head, elm, field) \
65 #define QUEUEDEBUG_HEIM_TAILQ_INSERT_TAIL(head, elm, field) \
68 #define QUEUEDEBUG_HEIM_TAILQ_OP(elm, field) \
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_
[all...]
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/asn1/
H A Dasn1_queue.h61 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_HEAD(head, elm, field) \
65 #define QUEUEDEBUG_ASN1_TAILQ_INSERT_TAIL(head, elm, field) \
68 #define QUEUEDEBUG_ASN1_TAILQ_OP(elm, field) \
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_
[all...]
/netbsd-6-1-5-RELEASE/external/bsd/tmux/dist/compat/
H A Dqueue.h114 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
133 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
134 (elm)->field.sle_next = (slistelm)->field.sle_next; \
135 (slistelm)->field.sle_next = (elm); \
138 #define SLIST_INSERT_HEAD(head, elm, field) do { \
139 (elm)->field.sle_next = (head)->slh_first; \
140 (head)->slh_first = (elm); \
143 #define SLIST_REMOVE_NEXT(head, elm, field) do { \
144 (elm)
[all...]
H A Dtree.h76 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
77 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
121 /* Finds the node with the same key as elm */ \
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); \
[all...]
/netbsd-6-1-5-RELEASE/lib/libpthread/
H A Dpthread_queue.h69 #define PTQ_INSERT_HEAD(head, elm, field) do { \
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 { \
80 (elm)->field.ptqe_next = NULL; \
83 (elm)->field.ptqe_prev = (head)->ptqh_last; \
84 *(head)->ptqh_last = (elm); \
[all...]
/netbsd-6-1-5-RELEASE/sys/sys/
H A Dqueue.h106 #define QUEUEDEBUG_LIST_INSERT_HEAD(head, elm, field) \
110 #define QUEUEDEBUG_LIST_OP(elm, field) \
111 if ((elm)->field.le_next && \
112 (elm)->field.le_next->field.le_prev != \
113 &(elm)->field.le_next) \
114 panic("LIST_* forw %p %s:%d", (elm), __FILE__, __LINE__);\
115 if (*(elm)->field.le_prev != (elm)) \
116 panic("LIST_* back %p %s:%d", (elm), __FILE__, __LINE__);
117 #define QUEUEDEBUG_LIST_POSTREMOVE(elm, fiel
[all...]
H A Dtree.h76 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
77 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
121 /* Finds the node with the same key as elm */ \
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); \
[all...]
/netbsd-6-1-5-RELEASE/crypto/dist/ipsec-tools/src/include-glibc/sys/
H A Dqueue.h138 #define SLIST_INSERT_AFTER(slistelm, elm, field) do { \
139 SLIST_NEXT((elm), field) = SLIST_NEXT((slistelm), field); \
140 SLIST_NEXT((slistelm), field) = (elm); \
143 #define SLIST_INSERT_HEAD(head, elm, field) do { \
144 SLIST_NEXT((elm), field) = SLIST_FIRST((head)); \
145 SLIST_FIRST((head)) = (elm); \
148 #define SLIST_NEXT(elm, field) ((elm)->field.sle_next)
150 #define SLIST_REMOVE(head, elm, type, field) do { \
151 if (SLIST_FIRST((head)) == (elm)) { \
[all...]
/netbsd-6-1-5-RELEASE/external/bsd/openldap/dist/include/
H A Dldap_queue.h170 #define LDAP_SLIST_INSERT_AFTER(slistelm, elm, field) do { \
171 (elm)->field.sle_next = (slistelm)->field.sle_next; \
172 (slistelm)->field.sle_next = (elm); \
175 #define LDAP_SLIST_INSERT_HEAD(head, elm, field) do { \
176 (elm)->field.sle_next = (head)->slh_first; \
177 (head)->slh_first = (elm); \
180 #define LDAP_SLIST_NEXT(elm, field) ((elm)->field.sle_next)
186 #define LDAP_SLIST_REMOVE(head, elm, type, field) do { \
187 if ((head)->slh_first == (elm)) { \
[all...]
/netbsd-6-1-5-RELEASE/crypto/external/bsd/heimdal/dist/lib/gssapi/mech/
H A Dmechqueue.h62 #define HEIM_SLIST_INSERT_AFTER(slistelm, elm, field) do { \
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 { \
68 (elm)->field.sle_next = (head)->slh_first; \
69 (head)->slh_first = (elm); \
76 #define HEIM_SLIST_REMOVE(head, elm, type, field) do { \
77 if ((head)->slh_first == (elm)) { \
82 while(curelm->field.sle_next != (elm)) \
97 #define HEIM_SLIST_NEXT(elm, fiel
[all...]
/netbsd-6-1-5-RELEASE/lib/libc/citrus/
H A Dcitrus_hash.h43 #define _CITRUS_HASH_REMOVE(elm, field) LIST_REMOVE(elm, field)
44 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \
45 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
46 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \
48 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) { \
49 if (matchfunc((elm), key)==0) \
/netbsd-6-1-5-RELEASE/libexec/httpd/
H A Dnetbsd_queue.h60 #define SIMPLEQ_INSERT_TAIL(head, elm, field) do { \
61 (elm)->field.sqe_next = NULL; \
62 *(head)->sqh_last = (elm); \
63 (head)->sqh_last = &(elm)->field.sqe_next; \
80 #define SIMPLEQ_NEXT(elm, field) ((elm)->field.sqe_next)
/netbsd-6-1-5-RELEASE/external/bsd/libevent/dist/
H A Devent-internal.h78 #define TAILQ_NEXT(elm, field) ((elm)->field.tqe_next)
83 #define TAILQ_INSERT_BEFORE(listelm, elm, field) do { \
84 (elm)->field.tqe_prev = (listelm)->field.tqe_prev; \
85 (elm)->field.tqe_next = (listelm); \
86 *(listelm)->field.tqe_prev = (elm); \
87 (listelm)->field.tqe_prev = &(elm)->field.tqe_next; \
/netbsd-6-1-5-RELEASE/crypto/dist/ipsec-tools/src/racoon/
H A Dvar.h99 #define LIST_FOREACH(elm, head, field) \
100 for (elm = LIST_FIRST(head); elm; elm = LIST_NEXT(elm, field))
/netbsd-6-1-5-RELEASE/tests/util/xlint/lint1/
H A Dd_nested_structs.c17 struct el_modes_s elm = { variable in typeref:struct:el_modes_s
/netbsd-6-1-5-RELEASE/usr.bin/mail/
H A Dcomplete.h50 extern struct el_modes_s elm;
/netbsd-6-1-5-RELEASE/sys/dev/acpi/
H A Dacpi_bat.c363 ACPI_OBJECT *elm, *obj; local
375 elm = obj->Package.Elements;
379 if (elm[i].Type != ACPI_TYPE_INTEGER) {
384 KDASSERT((uint64_t)elm[i].Integer.Value < INT_MAX);
387 if ((elm[ACPIBAT_BIF_UNIT].Integer.Value & ACPIBAT_PWRUNIT_MA) != 0) {
402 val = elm[ACPIBAT_BIF_DCAPACITY].Integer.Value;
407 val = elm[ACPIBAT_BIF_LFCCAPACITY].Integer.Value;
412 val = elm[ACPIBAT_BIF_DVOLTAGE].Integer.Value;
417 sc->sc_lcapacity = elm[ACPIBAT_BIF_LCAPACITY].Integer.Value * 1000;
418 sc->sc_wcapacity = elm[ACPIBAT_BIF_WCAPACIT
444 acpibat_print_info(device_t dv, ACPI_OBJECT *elm) argument
521 ACPI_OBJECT *elm, *obj; local
[all...]
H A Dacpi_wakedev.c64 ACPI_OBJECT *elm, *obj; local
97 elm = &obj->Package.Elements[0];
99 switch (elm->Type) {
102 val = elm->Integer.Value;
108 if (elm->Package.Count < 2) {
115 if (elm->Package.Elements[0].Type != ACPI_TYPE_LOCAL_REFERENCE)
118 if (elm->Package.Elements[1].Type != ACPI_TYPE_INTEGER)
121 hdl = elm->Package.Elements[0].Reference.Handle;
122 val = elm->Package.Elements[1].Integer.Value;
143 elm
173 ACPI_OBJECT *elm; local
[all...]
H A Dacpi_cpu_cstate.c164 ACPI_OBJECT *elm, *obj; local
187 elm = obj->Package.Elements;
189 if (elm[0].Type != ACPI_TYPE_INTEGER) {
194 n = elm[0].Integer.Value;
218 elm = &obj->Package.Elements[i];
219 rv = acpicpu_cstate_cst_add(sc, elm);
235 acpicpu_cstate_cst_add(struct acpicpu_softc *sc, ACPI_OBJECT *elm) argument
246 if (elm->Type != ACPI_TYPE_PACKAGE) {
251 if (elm->Package.Count != 4) {
259 obj = &elm
427 ACPI_OBJECT *elm, *obj; local
[all...]
H A Dacpi_cpu_pstate.c310 ACPI_OBJECT *elm; local
319 elm = obj->Package.Elements;
323 if (elm[i].Type != ACPI_TYPE_INTEGER)
326 if (elm[i].Integer.Value > UINT32_MAX)
330 ps->ps_freq = elm[0].Integer.Value;
331 ps->ps_power = elm[1].Integer.Value;
332 ps->ps_latency = elm[2].Integer.Value;
333 ps->ps_latency_bm = elm[3].Integer.Value;
334 ps->ps_control = elm[4].Integer.Value;
335 ps->ps_status = elm[
403 ACPI_OBJECT *elm; local
477 ACPI_OBJECT *elm, *obj; local
614 ACPI_OBJECT *elm, *obj; local
[all...]
H A Dacpi_cpu_tstate.c307 ACPI_OBJECT *elm; local
318 elm = obj->Package.Elements;
322 if (elm[i].Type != ACPI_TYPE_INTEGER)
325 if (elm[i].Integer.Value > UINT32_MAX)
328 val[i] = elm[i].Integer.Value;
353 ACPI_OBJECT *elm, *obj; local
377 elm = &obj->Package.Elements[i];
379 if (elm->Type != ACPI_TYPE_BUFFER) {
384 if (size > elm->Buffer.Length) {
389 reg[i] = (struct acpicpu_reg *)elm
451 ACPI_OBJECT *elm, *obj; local
[all...]
H A Dacpi_pmtr.c177 ACPI_OBJECT *elm, *obj; local
197 elm = obj->Package.Elements;
208 if (elm[i].Type != ACPI_TYPE_INTEGER) {
213 if (elm[i].Integer.Value > UINT32_MAX) {
218 sc->sc_cap[i] = elm[i].Integer.Value;
226 if (elm[i].Type != ACPI_TYPE_STRING)
229 if (elm[i].String.Pointer == NULL)
232 if (elm[i].String.Pointer[0] == '\0')
237 "model %s\n", elm[13].String.Pointer,
238 elm[1
256 ACPI_OBJECT *elm, *obj; local
[all...]
/netbsd-6-1-5-RELEASE/external/bsd/wpa/dist/wpa_supplicant/wpa_gui-qt4/
H A Deventhistory.cpp91 elm = new EventListModel(parent);
92 eventListView->setModel(elm);
99 delete elm;
125 elm->addEvent(msg.getTimestamp().toString("yyyy-MM-dd hh:mm:ss.zzz"),
/netbsd-6-1-5-RELEASE/libexec/ld.elf_so/
H A Dload.c75 Objlist_Entry *elm; local
77 elm = NEW(Objlist_Entry);
78 elm->obj = obj;
79 SIMPLEQ_INSERT_HEAD(list, elm, link);
85 Objlist_Entry *elm; local
87 elm = NEW(Objlist_Entry);
88 elm->obj = obj;
89 SIMPLEQ_INSERT_TAIL(list, elm, link);
95 Objlist_Entry *elm; local
97 SIMPLEQ_FOREACH(elm, lis
[all...]

Completed in 320 milliseconds

12