Home
last modified time | relevance | path

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

/hal_rpi_pico-latest/src/common/pico_util/
Dpheap.c32 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()
[all …]
/hal_rpi_pico-latest/src/common/pico_util/include/pico/util/
Dpheap.h52 pheap_node_id_t child, sibling, parent; member
123 c->sibling = n->child; in ph_add_child_node()
152 heap->free_head_id = hn->sibling; in ph_new_node()
154 hn->child = hn->sibling = hn->parent = 0; in ph_new_node()
173 hn->child = hn->sibling = hn->parent = 0; in ph_insert_node()
260 ph_get_node(heap, heap->free_tail_id)->sibling = id; in ph_free_node()