HomeSort by relevance Sort by last modified time
    Searched full:phn_next_get (Results 1 - 2 of 2) sorted by null

  /external/jemalloc/include/jemalloc/internal/
ph.h 39 #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/
ph.c 56 for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=
57 NULL; sibling = phn_next_get(node_t, link, sibling)) {
73 for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL;
74 auxelm = phn_next_get(node_t, link, auxelm)) {
75 assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t,
103 for (sibling = phn_next_get(node_t, link, leftmost_child); sibling !=
104 NULL; sibling = phn_next_get(node_t, link, sibling)) {
105 assert_ptr_eq(phn_next_get(node_t, link, phn_prev_get(node_t,
124 for (auxelm = phn_next_get(node_t, link, heap->ph_root); auxelm != NULL;
125 auxelm = phn_next_get(node_t, link, auxelm))
    [all...]

Completed in 297 milliseconds