Home
last modified time | relevance | path

Searched refs:a_field (Results 1 – 6 of 6) sorted by relevance

/freebsd/contrib/jemalloc/include/jemalloc/internal/
H A Dqr.h12 #define qr_new(a_qr, a_field) do { \ argument
13 (a_qr)->a_field.qre_next = (a_qr); \
14 (a_qr)->a_field.qre_prev = (a_qr); \
17 #define qr_next(a_qr, a_field) ((a_qr)->a_field.qre_next) argument
19 #define qr_prev(a_qr, a_field) ((a_qr)->a_field.qre_prev) argument
21 #define qr_before_insert(a_qrelm, a_qr, a_field) do { \ argument
22 (a_qr)->a_field.qre_prev = (a_qrelm)->a_field.qre_prev; \
23 (a_qr)->a_field.qre_next = (a_qrelm); \
24 (a_qr)->a_field.qre_prev->a_field.qre_next = (a_qr); \
25 (a_qrelm)->a_field.qre_prev = (a_qr); \
[all …]
H A Dph.h33 #define phn_lchild_get(a_type, a_field, a_phn) \ argument
34 (a_phn->a_field.phn_lchild)
35 #define phn_lchild_set(a_type, a_field, a_phn, a_lchild) do { \ argument
36 a_phn->a_field.phn_lchild = a_lchild; \
39 #define phn_next_get(a_type, a_field, a_phn) \ argument
40 (a_phn->a_field.phn_next)
41 #define phn_prev_set(a_type, a_field, a_phn, a_prev) do { \ argument
42 a_phn->a_field.phn_prev = a_prev; \
45 #define phn_prev_get(a_type, a_field, a_phn) \ argument
46 (a_phn->a_field.phn_prev)
[all …]
H A Drb.h52 #define rbtn_left_get(a_type, a_field, a_node) \ argument
53 ((a_node)->a_field.rbn_left)
54 #define rbtn_left_set(a_type, a_field, a_node, a_left) do { \ argument
55 (a_node)->a_field.rbn_left = a_left; \
60 #define rbtn_right_get(a_type, a_field, a_node) \ argument
61 ((a_type *) (((intptr_t) (a_node)->a_field.rbn_right_red) \
63 #define rbtn_right_set(a_type, a_field, a_node, a_right) do { \ argument
64 (a_node)->a_field.rbn_right_red = (a_type *) (((uintptr_t) a_right) \
65 | (((uintptr_t) (a_node)->a_field.rbn_right_red) & ((size_t)1))); \
69 #define rbtn_red_get(a_type, a_field, a_node) \ argument
[all …]
H A Dql.h21 #define ql_elm_new(a_elm, a_field) qr_new((a_elm), a_field) argument
25 #define ql_last(a_head, a_field) \ argument
27 ? qr_prev(ql_first(a_head), a_field) : NULL)
29 #define ql_next(a_head, a_elm, a_field) \ argument
30 ((ql_last(a_head, a_field) != (a_elm)) \
31 ? qr_next((a_elm), a_field) : NULL)
33 #define ql_prev(a_head, a_elm, a_field) \ argument
34 ((ql_first(a_head) != (a_elm)) ? qr_prev((a_elm), a_field) \
37 #define ql_before_insert(a_head, a_qlelm, a_elm, a_field) do { \ argument
38 qr_before_insert((a_qlelm), (a_elm), a_field); \
[all …]
/freebsd/contrib/sendmail/src/
H A Dmime.c96 char *a_field; /* name of field */ member
214 argv[argc].a_field = *pvp++;
271 if (SM_STRCASEEQ(argv[i].a_field, "boundary"))
/freebsd/contrib/googletest/googlemock/test/
H A Dgmock_link_test.h241 explicit FieldHelper(int a_field) : field_(a_field) {} in FieldHelper() argument