28     heap->root_id = 0;  in ph_clear()
55 static pheap_node_id_t ph_remove_any_head(pheap_t *heap, pheap_node_id_t root_id, bool free) {  in ph_remove_any_head()  argument
56     assert(root_id);  in ph_remove_any_head()
58     assert(!ph_get_node(heap, root_id)->sibling);  in ph_remove_any_head()
59     assert(!ph_get_node(heap, root_id)->parent);  in ph_remove_any_head()
60     pheap_node_id_t new_root_id = ph_merge_two_pass(heap, ph_get_node(heap, root_id)->child);  in ph_remove_any_head()
63             ph_get_node(heap, heap->free_tail_id)->sibling = root_id;  in ph_remove_any_head()
67             heap->free_head_id = root_id;  in ph_remove_any_head()
69         heap->free_tail_id = root_id;  in ph_remove_any_head()
72     ph_get_node(heap, root_id)->sibling = 0;  in ph_remove_any_head()
78     heap->root_id = ph_remove_any_head(heap, old_root_id, free);  in ph_remove_head()
85     if (id == heap->root_id) {  in ph_remove_and_free_node()
113     assert(new_sub_tree != heap->root_id);  in ph_remove_and_free_node()
114     heap->root_id = ph_merge_nodes(heap, heap->root_id, new_sub_tree);  in ph_remove_and_free_node()
136     uint count = ph_dump_node(heap, heap->root_id, dump_key, user_data, 0);  in ph_dump()