Home
last modified time | relevance | path

Searched refs:pheap_node_id_t (Results 1 – 3 of 3) sorted by relevance

/external/platform/pico/common/pico_util/include/pico/util/
A Dpheap.h44 typedef uint8_t pheap_node_id_t; typedef
46 typedef uint16_t pheap_node_id_t;
52 pheap_node_id_t child, sibling, parent;
60 typedef bool (*pheap_comparator)(void *user_data, pheap_node_id_t a, pheap_node_id_t b);
66 pheap_node_id_t max_nodes;
67 pheap_node_id_t root_id;
69 pheap_node_id_t free_head_id;
70 pheap_node_id_t free_tail_id;
109 static void ph_add_child_node(pheap_t *heap, pheap_node_id_t parent_id, pheap_node_id_t child_id) { in ph_add_child_node()
125 static pheap_node_id_t ph_merge_nodes(pheap_t *heap, pheap_node_id_t a, pheap_node_id_t b) { in ph_merge_nodes()
[all …]
/external/platform/pico/common/pico_util/
A Dpheap.c21 heap->max_nodes = (pheap_node_id_t) max_nodes; in ph_post_alloc_init()
31 for(pheap_node_id_t i = 1; i < heap->max_nodes; i++) { in ph_clear()
32 ph_get_node(heap, i)->sibling = (pheap_node_id_t)(i + 1); in ph_clear()
42 pheap_node_id_t ph_merge_two_pass(pheap_t *heap, pheap_node_id_t id) { in ph_merge_two_pass()
46 pheap_node_id_t a, b, new_node; in ph_merge_two_pass()
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()
76 pheap_node_id_t ph_remove_head(pheap_t *heap, bool free) { in ph_remove_head()
77 pheap_node_id_t old_root_id = ph_peek_head(heap); in ph_remove_head()
82 bool ph_remove_and_free_node(pheap_t *heap, pheap_node_id_t id) { in ph_remove_and_free_node()
96 pheap_node_id_t prev_sibling_id = parent->child; in ph_remove_and_free_node()
[all …]
/external/platform/pico/common/pico_time/
A Dtime.c59 static inline alarm_pool_entry_t *get_entry(alarm_pool_t *pool, pheap_node_id_t id) { in get_entry()
64 static inline uint8_t *get_entry_id_high(alarm_pool_t *pool, pheap_node_id_t id) { in get_entry_id_high()
69 bool timer_pool_entry_comparator(void *user_data, pheap_node_id_t a, pheap_node_id_t b) { in timer_pool_entry_comparator()
74 static inline alarm_id_t make_public_id(uint8_t id_high, pheap_node_id_t id) { in make_public_id()
101 pheap_node_id_t id; in add_alarm_under_lock()
136 pheap_node_id_t next_id = ph_peek_head(pool->heap); in alarm_pool_alarm_callback()
141 pheap_node_id_t __unused removed_id = ph_remove_head(pool->heap, false); in alarm_pool_alarm_callback()
280 pheap_node_id_t id = add_alarm_under_lock(pool, time, callback, user_data, 0, true, &missed); in alarm_pool_add_alarm_at_force_in_context()
297 pheap_node_id_t id = (pheap_node_id_t) alarm_id; in alarm_pool_cancel_alarm()
301 uint8_t id_high = (uint8_t)((uint)alarm_id >> 8u * sizeof(pheap_node_id_t)); in alarm_pool_cancel_alarm()
[all …]

Completed in 5 milliseconds