32         ph_get_node(heap, i)->sibling = (pheap_node_id_t)(i + 1);  in ph_clear()
34     ph_get_node(heap, heap->max_nodes)->sibling = 0;  in ph_clear()
43     if (!id || !ph_get_node(heap, id)->sibling) {  in ph_merge_two_pass()
48         b = ph_get_node(heap, id)->sibling;  in ph_merge_two_pass()
49         new_node = ph_get_node(heap, b)->sibling;  in ph_merge_two_pass()
50         ph_get_node(heap, a)->sibling = ph_get_node(heap, b)->sibling = 0;  in ph_merge_two_pass()
58     assert(!ph_get_node(heap, root_id)->sibling);  in ph_remove_any_head()
63             ph_get_node(heap, heap->free_tail_id)->sibling = root_id;  in ph_remove_any_head()
72     ph_get_node(heap, root_id)->sibling = 0;  in ph_remove_any_head()
94         parent->child = node->sibling;  in ph_remove_and_free_node()
100             if (prev_sibling->sibling == id) {  in ph_remove_and_free_node()
101                 prev_sibling->sibling = node->sibling;  in ph_remove_and_free_node()
105             prev_sibling_id = prev_sibling->sibling;  in ph_remove_and_free_node()
109     node->sibling = node->parent = 0;  in ph_remove_and_free_node()
126         printf("%d (c=%d s=%d p=%d) ", id, node->child, node->sibling, node->parent);  in ph_dump_node()
130         count += ph_dump_node(heap, node->sibling, dump_key, user_data, indent);  in ph_dump_node()