Mirrors_UI_SDK/lvgl
1
0
Fork 0
mirror of https://github.com/lvgl/lvgl.git synced 2026-05-10 04:37:55 +08:00
Code Issues Actions 2 Packages Projects Releases Wiki Activity

perf(vg_lite): optimize the memory usage and search speed of grad item (#8474)

Browse Source 
Signed-off-by: pengyiqiang <pengyiqiang@xiaomi.com>
Co-authored-by: pengyiqiang <pengyiqiang@xiaomi.com>
This commit is contained in:
VIFEX
2025-06-25 08:16:48 +08:00
committed by GitHub
parent 1d46a727bf
commit ab6ec8ac18
1 changed files with 32 additions and 13 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/draw/vg_lite/lv_vg_lite_grad.c
+32 -13
View File
@@ -40,7 +40,10 @@ typedef enum {
GRAD_TYPE_UNKNOWN,
} grad_type_t;
struct _lv_vg_lite_grad_ctx_t;
typedef struct {
struct _lv_vg_lite_grad_ctx_t * ctx;
grad_type_t type;
lv_vector_gradient_t lv;
union {
@@ -56,8 +59,7 @@ typedef struct _lv_vg_lite_grad_ctx_t {
struct _lv_draw_vg_lite_unit_t * unit;
lv_cache_t * cache;
struct _lv_vg_lite_pending_t * pending;
grad_item_t * item_pool;
uint32_t item_pool_size;
lv_ll_t item_pool;
/**
* Temporary reuse of data to reduce the use of
@@ -111,9 +113,7 @@ struct _lv_vg_lite_grad_ctx_t * lv_vg_lite_grad_ctx_create(uint32_t cache_cnt, s
LV_ASSERT_MALLOC(ctx);
ctx->unit = unit;
ctx->item_pool = lv_malloc_zeroed(cache_cnt * sizeof(grad_item_t));
LV_ASSERT_MALLOC(ctx->item_pool);
ctx->item_pool_size = cache_cnt;
lv_ll_init(&ctx->item_pool, sizeof(grad_item_t));
ctx->cache = lv_cache_create(&lv_cache_class_lru_ll_count, sizeof(grad_item_ref_t), cache_cnt, ops);
lv_cache_set_name(ctx->cache, "VG_GRAD");
@@ -128,7 +128,7 @@ void lv_vg_lite_grad_ctx_delete(struct _lv_vg_lite_grad_ctx_t * ctx)
LV_ASSERT_NULL(ctx);
lv_vg_lite_pending_destroy(ctx->pending);
lv_cache_destroy(ctx->cache, NULL);
lv_free(ctx->item_pool);
lv_ll_clear(&ctx->item_pool);
lv_memzero(ctx, sizeof(lv_vg_lite_grad_ctx_t));
lv_free(ctx);
@@ -420,21 +420,40 @@ static grad_item_t * grad_get(lv_vg_lite_grad_ctx_t * ctx, const lv_vector_gradi
static grad_item_t * grad_item_pool_alloc(lv_vg_lite_grad_ctx_t * ctx, grad_type_t type)
{
LV_ASSERT_NULL(ctx);
for(uint32_t i = 0; i < ctx->item_pool_size; i++) {
if(ctx->item_pool[i].type == GRAD_TYPE_FREE) {
ctx->item_pool[i].type = type;
return &ctx->item_pool[i];
}
grad_item_t * item = lv_ll_get_head(&ctx->item_pool);
/* Always get free nodes from the head */
if(item && item->type == GRAD_TYPE_FREE) {
item->type = type;
lv_ll_move_before(&ctx->item_pool, item, NULL);
LV_LOG_TRACE("reuse item: %p, type: %d", (void *)item, type);
return item;
}
LV_LOG_WARN("alloc grad item failed, no free slot");
return NULL;
item = lv_ll_ins_tail(&ctx->item_pool);
LV_ASSERT_MALLOC(item);
if(!item) {
LV_LOG_ERROR("alloc grad item failed");
return NULL;
}
item->ctx = ctx;
item->type = type;
LV_LOG_TRACE("alloc new item: %p, type: %d, pool size: %" LV_PRIu32,
(void *)item, type, lv_ll_get_len(&ctx->item_pool));
return item;
}
static void grad_item_pool_free(grad_item_t * item)
{
LV_ASSERT_NULL(item);
LV_ASSERT_NULL(item->ctx);
/* Move the free nodes to the head to ensure quick allocation */
item->type = GRAD_TYPE_FREE;
grad_item_t * head = lv_ll_get_head(&item->ctx->item_pool);
lv_ll_move_before(&item->ctx->item_pool, item, head);
}
static void grad_cache_release_cb(void * entry, void * user_data)