Home
last modified time | relevance | path

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

/f-stack/app/redis-5.0.5/deps/jemalloc/include/jemalloc/internal/
H A Dph.h39 #define phn_next_get(a_type, a_field, a_phn) \ macro
110 phn1 = phn_next_get(a_type, a_field, phn0); \
112 phnrest = phn_next_get(a_type, a_field, \
140 phn1 = phn_next_get(a_type, a_field, phn0); \
143 head = phn_next_get(a_type, a_field, \
162 phn1 = phn_next_get(a_type, a_field, \
320 ph->ph_root = phn_next_get(a_type, a_field, \
361 phn_next_get(a_type, a_field, phn)); \
364 phn_next_get(a_type, a_field, phn), \
381 phn_next_get(a_type, a_field, phn)); \
[all …]
/f-stack/app/redis-5.0.5/deps/jemalloc/test/unit/
H A Dph.c58 for (sibling = phn_next_get(node_t, link, leftmost_child); sibling != in node_print()
59 NULL; sibling = phn_next_get(node_t, link, sibling)) { in node_print()
75 for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL; in heap_print()
76 auxelm = phn_next_get(node_t, link, auxelm)) { in heap_print()
77 assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t, in heap_print()
105 for (sibling = phn_next_get(node_t, link, leftmost_child); sibling != in node_validate()
106 NULL; sibling = phn_next_get(node_t, link, sibling)) { in node_validate()
107 assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t, in node_validate()
126 for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL; in heap_validate()
127 auxelm = phn_next_get(node_t, link, auxelm)) { in heap_validate()
[all …]