Home
last modified time | relevance | path

Searched refs:phn_next_get (Results 1 – 2 of 2) sorted by relevance

/external/jemalloc/include/jemalloc/internal/
Dph.h39 #define phn_next_get(a_type, a_field, a_phn) \ macro
86 a_type *phn1 = phn_next_get(a_type, a_field, phn0); \
97 a_type *phnrest = phn_next_get(a_type, a_field, phn1); \
108 phn1 = phn_next_get(a_type, a_field, phn0); \
110 phnrest = phn_next_get(a_type, a_field, \
138 phn1 = phn_next_get(a_type, a_field, phn0); \
141 head = phn_next_get(a_type, a_field, \
159 phn1 = phn_next_get(a_type, a_field, \
168 a_type *phn = phn_next_get(a_type, a_field, a_ph->ph_root); \
174 assert(phn_next_get(a_type, a_field, phn) == NULL); \
[all …]
/external/jemalloc/test/unit/
Dph.c56 for (sibling = phn_next_get(node_t, link, leftmost_child); sibling != in node_print()
57 NULL; sibling = phn_next_get(node_t, link, sibling)) { in node_print()
73 for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL; in heap_print()
74 auxelm = phn_next_get(node_t, link, auxelm)) { in heap_print()
75 assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t, in heap_print()
103 for (sibling = phn_next_get(node_t, link, leftmost_child); sibling != in node_validate()
104 NULL; sibling = phn_next_get(node_t, link, sibling)) { in node_validate()
105 assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t, in node_validate()
124 for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL; in heap_validate()
125 auxelm = phn_next_get(node_t, link, auxelm)) { in heap_validate()
[all …]