Home
last modified time | relevance | path

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

/hal_rpi_pico-latest/src/common/pico_util/
Dpheap.c11 pheap_t *ph_create(uint max_nodes, pheap_comparator comparator, void *user_data) { in ph_create() argument
12 invalid_params_if(PHEAP, !max_nodes || max_nodes >= (1u << (8 * sizeof(pheap_node_id_t)))); in ph_create()
14 heap->nodes = calloc(max_nodes, sizeof(pheap_node_t)); in ph_create()
15 ph_post_alloc_init(heap, max_nodes, comparator, user_data); in ph_create()
19 void ph_post_alloc_init(pheap_t *heap, uint max_nodes, pheap_comparator comparator, void *user_data… in ph_post_alloc_init() argument
20 invalid_params_if(PHEAP, !max_nodes || max_nodes >= (1u << (8 * sizeof(pheap_node_id_t)))); in ph_post_alloc_init()
21 heap->max_nodes = (pheap_node_id_t) max_nodes; in ph_post_alloc_init()
30 heap->free_tail_id = heap->max_nodes; in ph_clear()
31 for(pheap_node_id_t i = 1; i < heap->max_nodes; i++) { in ph_clear()
34 ph_get_node(heap, heap->max_nodes)->sibling = 0; in ph_clear()
/hal_rpi_pico-latest/src/common/pico_util/include/pico/util/
Dpheap.h67 pheap_node_id_t max_nodes; member
88 pheap_t *ph_create(uint max_nodes, pheap_comparator comparator, void *user_data);
108 assert(id && id <= heap->max_nodes); in ph_get_node()
289 void ph_post_alloc_init(pheap_t *heap, uint max_nodes, pheap_comparator comparator, void *user_data…
301 .max_nodes = _max_nodes \