Home
last modified time | relevance | path

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

/hal_rpi_pico-latest/src/common/pico_util/
Dpheap.c28 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()
[all …]
/hal_rpi_pico-latest/src/common/pico_util/include/pico/util/
Dpheap.h68 pheap_node_id_t root_id; member
174 heap->root_id = ph_merge_nodes(heap, heap->root_id, id); in ph_insert_node()
175 return heap->root_id; in ph_insert_node()
187 return heap->root_id; in ph_peek_head()
246 return id == heap->root_id || ph_get_node(heap, id)->parent; in ph_contains_node()