Lines Matching refs:node

91 inline static void ** get_lru_node(lv_lru_rb_t_ * lru, lv_rb_node_t * node);
157 lv_rb_node_t * node = lv_rb_insert(&lru->rb, key); in alloc_new_node() local
158 if(node == NULL) in alloc_new_node()
161 void * data = node->data; in alloc_new_node()
169 lv_memcpy(lru_node, &node, sizeof(void *)); in alloc_new_node()
170 lv_memcpy(get_lru_node(lru, node), &lru_node, sizeof(void *)); in alloc_new_node()
176 lv_rb_drop_node(&lru->rb, node); in alloc_new_node()
177 node = NULL; in alloc_new_node()
179 return node; in alloc_new_node()
182 inline static void ** get_lru_node(lv_lru_rb_t_ * lru, lv_rb_node_t * node) in get_lru_node() argument
184 return (void **)((char *)node->data + lru->rb.size - sizeof(void *)); in get_lru_node()
277 lv_rb_node_t * node = *(lv_rb_node_t **)head; in get_cb() local
278 void * data = node->data; in get_cb()
285 lv_rb_node_t * node = lv_rb_find(&lru->rb, key); in get_cb() local
287 if(node) { in get_cb()
288 void * lru_node = *get_lru_node(lru, node); in get_cb()
292 lv_cache_entry_t * entry = lv_cache_entry_get_entry(node->data, cache->node_size); in get_cb()
337 lv_rb_node_t * node = lv_rb_find(&lru->rb, data); in remove_cb() local
338 if(node == NULL) { in remove_cb()
342 void * lru_node = *get_lru_node(lru, node); in remove_cb()
343 lv_rb_remove_node(&lru->rb, node); in remove_cb()
361 lv_rb_node_t * node = lv_rb_find(&lru->rb, key); in drop_cb() local
362 if(node == NULL) { in drop_cb()
366 void * data = node->data; in drop_cb()
372 void * lru_node = *get_lru_node(lru, node); in drop_cb()
374 lv_rb_remove_node(&lru->rb, node); in drop_cb()
392 lv_rb_node_t ** node; in drop_all_cb() local
393 LV_LL_READ(&lru->ll, node) { in drop_all_cb()
395 void * search_key = (*node)->data; in drop_all_cb()
486 lv_rb_node_t ** node = *ll_node; in cache_iter_next_cb() local
488 if(node == NULL) return LV_RESULT_INVALID; in cache_iter_next_cb()
491 void * search_key = (*node)->data; in cache_iter_next_cb()