Searched refs:ph_get_node (Results 1 – 2 of 2) sorted by relevance
| /external/platform/pico/common/pico_util/ |
| A D | pheap.c | 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()
72 ph_get_node(heap, root_id)->sibling = 0; in ph_remove_any_head()
90 pheap_node_t *node = ph_get_node(heap, id); in ph_remove_and_free_node()
92 pheap_node_t *parent = ph_get_node(heap, node->parent); in ph_remove_and_free_node()
[all …]
|
| /external/platform/pico/common/pico_util/include/pico/util/ |
| A D | pheap.h | 103 static inline pheap_node_t *ph_get_node(pheap_t *heap, pheap_node_id_t id) { in ph_get_node() function
110 pheap_node_t *n = ph_get_node(heap, parent_id); in ph_add_child_node()
114 pheap_node_t *c = ph_get_node(heap, child_id); in ph_add_child_node()
146 pheap_node_t *hn = ph_get_node(heap, id); in ph_new_node()
166 pheap_node_t *hn = ph_get_node(heap, id); in ph_insert_node()
235 return id == heap->root_id || ph_get_node(heap, id)->parent; in ph_contains_node()
248 ph_get_node(heap, heap->free_tail_id)->sibling = id; in ph_free_node()
|
Completed in 3 milliseconds