Home
last modified time | relevance | path

Searched refs:node_size (Results 1 – 13 of 13) sorted by relevance

/lvgl-latest/src/misc/cache/
Dlv_cache_entry.c26 uint32_t node_size; member
80 return entry->node_size; in lv_cache_entry_get_node_size()
83 void lv_cache_entry_set_node_size(lv_cache_entry_t * entry, uint32_t node_size) in lv_cache_entry_set_node_size() argument
86 entry->node_size = node_size; in lv_cache_entry_set_node_size()
104 return (uint8_t *)entry - entry->node_size; in lv_cache_entry_get_data()
128 lv_cache_entry_t * lv_cache_entry_get_entry(void * data, const uint32_t node_size) in lv_cache_entry_get_entry() argument
131 return (lv_cache_entry_t *)((uint8_t *)data + node_size); in lv_cache_entry_get_entry()
146 uint32_t lv_cache_entry_get_size(const uint32_t node_size) in lv_cache_entry_get_size() argument
148 return node_size + sizeof(lv_cache_entry_t); in lv_cache_entry_get_size()
151 lv_cache_entry_t * lv_cache_entry_alloc(const uint32_t node_size, const lv_cache_t * cache) in lv_cache_entry_alloc() argument
[all …]
Dlv_cache_entry.h35 uint32_t lv_cache_entry_get_size(const uint32_t node_size);
78 lv_cache_entry_t * lv_cache_entry_get_entry(void * data, const uint32_t node_size);
86 lv_cache_entry_t * lv_cache_entry_alloc(const uint32_t node_size, const lv_cache_t * cache);
94 … lv_cache_entry_init(lv_cache_entry_t * entry, const lv_cache_t * cache, const uint32_t node_size);
Dlv_cache_lru_rb.c162 lv_cache_entry_t * entry = lv_cache_entry_get_entry(data, lru->cache.node_size); in alloc_new_node()
163 lv_memcpy(data, key, lru->cache.node_size); in alloc_new_node()
172 lv_cache_entry_init(entry, &lru->cache, lru->cache.node_size); in alloc_new_node()
206 LV_ASSERT(lru->cache.node_size > 0); in init_cnt_cb()
208 …if(lru->cache.node_size <= 0 || lru->cache.ops.compare_cb == NULL || lru->cache.ops.free_cb == NUL… in init_cnt_cb()
213 …&lru->rb, lru->cache.ops.compare_cb, lv_cache_entry_get_size(lru->cache.node_size) + sizeof(void *… in init_cnt_cb()
229 LV_ASSERT(lru->cache.node_size > 0); in init_size_cb()
231 …if(lru->cache.node_size <= 0 || lru->cache.ops.compare_cb == NULL || lru->cache.ops.free_cb == NUL… in init_size_cb()
236 …&lru->rb, lru->cache.ops.compare_cb, lv_cache_entry_get_size(lru->cache.node_size) + sizeof(void *… in init_size_cb()
279 lv_cache_entry_t * entry = lv_cache_entry_get_entry(data, cache->node_size); in get_cb()
[all …]
Dlv_cache_entry_private.h34 void lv_cache_entry_set_node_size(lv_cache_entry_t * entry, uint32_t node_size);
Dlv_cache.c47 size_t node_size, size_t max_size, in lv_cache_create() argument
54 cache->node_size = node_size; in lv_cache_create()
Dlv_cache.h49 size_t node_size, size_t max_size,
Dlv_cache_private.h131 uint32_t node_size; /**< Size of a node */ member
Dlv_image_header_cache.c157 lv_cache_entry_t * entry = lv_cache_entry_get_entry(data, img_header_cache_p->node_size); in iter_inspect_cb()
Dlv_image_cache.c169 lv_cache_entry_t * entry = lv_cache_entry_get_entry(data, img_cache_p->node_size); in iter_inspect_cb()
/lvgl-latest/src/misc/
Dlv_ll.c42 void lv_ll_init(lv_ll_t * ll_p, uint32_t node_size) in lv_ll_init() argument
48 node_size = (node_size + 7) & (~0x7); in lv_ll_init()
51 node_size = (node_size + 3) & (~0x3); in lv_ll_init()
54 ll_p->n_size = node_size; in lv_ll_init()
Dlv_rb.h41 bool lv_rb_init(lv_rb_t * tree, lv_rb_compare_t compare, size_t node_size);
Dlv_ll.h46 void lv_ll_init(lv_ll_t * ll_p, uint32_t node_size);
Dlv_rb.c47 bool lv_rb_init(lv_rb_t * tree, lv_rb_compare_t compare, size_t node_size) in lv_rb_init() argument
51 LV_ASSERT(node_size > 0); in lv_rb_init()
53 if(tree == NULL || compare == NULL || node_size == 0) { in lv_rb_init()
61 tree->size = node_size; in lv_rb_init()