Searched refs:root_id (Results 1 – 2 of 2) sorted by relevance
28 heap->root_id = 0; in ph_clear()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()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()[all …]
67 pheap_node_id_t root_id; member168 heap->root_id = ph_merge_nodes(heap, heap->root_id, id); in ph_insert_node()169 return heap->root_id; in ph_insert_node()180 return heap->root_id; in ph_peek_head()235 return id == heap->root_id || ph_get_node(heap, id)->parent; in ph_contains_node()
Completed in 5 milliseconds