Searched refs:ph_get_node (Results 1 – 2 of 2) sorted by relevance
| /hal_rpi_pico-latest/src/common/pico_util/ |
| D | pheap.c | 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()
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()
[all …]
|
| /hal_rpi_pico-latest/src/common/pico_util/include/pico/util/ |
| D | pheap.h | 107 static inline pheap_node_t *ph_get_node(pheap_t *heap, pheap_node_id_t id) { in ph_get_node() function
114 pheap_node_t *n = ph_get_node(heap, parent_id); in ph_add_child_node()
118 pheap_node_t *c = ph_get_node(heap, child_id); in ph_add_child_node()
151 pheap_node_t *hn = ph_get_node(heap, id); in ph_new_node()
172 pheap_node_t *hn = ph_get_node(heap, id); in ph_insert_node()
246 return id == heap->root_id || ph_get_node(heap, id)->parent; in ph_contains_node()
260 ph_get_node(heap, heap->free_tail_id)->sibling = id; in ph_free_node()
|
