mirror of
https://github.com/CTCaer/hekate.git
synced 2024-11-26 03:32:17 +00:00
bdk: lvgl: do not do unneeded invalidations
A bug was fixed that was causing full parent object invalidations when tapping into a window. Now if the object is already on top the invalidation is skipped and the whole rerender/draw is skipped, saving valuable cpu time.
This commit is contained in:
parent
0b2c2aa564
commit
eaa25114ad
5 changed files with 18 additions and 9 deletions
|
@ -149,8 +149,8 @@
|
||||||
/*HAL settings*/
|
/*HAL settings*/
|
||||||
#define LV_TICK_CUSTOM 1 /*1: use a custom tick source (removing the need to manually update the tick with `lv_tick_inc`) */
|
#define LV_TICK_CUSTOM 1 /*1: use a custom tick source (removing the need to manually update the tick with `lv_tick_inc`) */
|
||||||
#if LV_TICK_CUSTOM == 1
|
#if LV_TICK_CUSTOM == 1
|
||||||
#define LV_TICK_CUSTOM_INCLUDE <utils/util.h> /*Header for the sys time function*/
|
#define LV_TICK_CUSTOM_INCLUDE <soc/timer.h> /*Header for the sys time function*/
|
||||||
#define LV_TICK_CUSTOM_SYS_TIME_EXPR (get_tmr_ms()) /*Expression evaluating to current systime in ms*/
|
#define LV_TICK_CUSTOM_SYS_TIME_EXPR ((u32)get_tmr_ms()) /*Expression evaluating to current systime in ms*/
|
||||||
#endif /*LV_TICK_CUSTOM*/
|
#endif /*LV_TICK_CUSTOM*/
|
||||||
|
|
||||||
|
|
||||||
|
@ -296,6 +296,9 @@
|
||||||
|
|
||||||
/*Message box (dependencies: lv_rect, lv_btnm, lv_label)*/
|
/*Message box (dependencies: lv_rect, lv_btnm, lv_label)*/
|
||||||
#define USE_LV_MBOX 1
|
#define USE_LV_MBOX 1
|
||||||
|
#if USE_LV_MBOX != 0
|
||||||
|
# define LV_MBOX_CLOSE_ANIM_TIME 200 /*ms*/
|
||||||
|
#endif
|
||||||
|
|
||||||
/*Text area (dependencies: lv_label, lv_page)*/
|
/*Text area (dependencies: lv_label, lv_page)*/
|
||||||
#define USE_LV_TA 1
|
#define USE_LV_TA 1
|
||||||
|
|
|
@ -546,8 +546,8 @@ static void obj_to_foreground(lv_obj_t * obj)
|
||||||
/*Move the last_top object to the foreground*/
|
/*Move the last_top object to the foreground*/
|
||||||
lv_obj_t * par = lv_obj_get_parent(last_top);
|
lv_obj_t * par = lv_obj_get_parent(last_top);
|
||||||
/*After list change it will be the new head*/
|
/*After list change it will be the new head*/
|
||||||
lv_ll_chg_list(&par->child_ll, &par->child_ll, last_top);
|
if (lv_ll_chg_list(&par->child_ll, &par->child_ll, last_top))
|
||||||
lv_obj_invalidate(last_top);
|
lv_obj_invalidate(last_top); /*Only invalidate if not top*/
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -646,8 +646,8 @@ static void indev_proc_press(lv_indev_proc_t * proc)
|
||||||
/*Move the last_top object to the foreground*/
|
/*Move the last_top object to the foreground*/
|
||||||
lv_obj_t * par = lv_obj_get_parent(last_top);
|
lv_obj_t * par = lv_obj_get_parent(last_top);
|
||||||
/*After list change it will be the new head*/
|
/*After list change it will be the new head*/
|
||||||
lv_ll_chg_list(&par->child_ll, &par->child_ll, last_top);
|
if (lv_ll_chg_list(&par->child_ll, &par->child_ll, last_top))
|
||||||
lv_obj_invalidate(last_top);
|
lv_obj_invalidate(last_top); /*Only invalidate if not top*/
|
||||||
}
|
}
|
||||||
|
|
||||||
/*Send a signal about the press*/
|
/*Send a signal about the press*/
|
||||||
|
|
|
@ -215,9 +215,12 @@ void lv_ll_clear(lv_ll_t * ll_p)
|
||||||
* @param ll_ori_p pointer to the original (old) linked list
|
* @param ll_ori_p pointer to the original (old) linked list
|
||||||
* @param ll_new_p pointer to the new linked list
|
* @param ll_new_p pointer to the new linked list
|
||||||
* @param node pointer to a node
|
* @param node pointer to a node
|
||||||
|
* @return head changed
|
||||||
*/
|
*/
|
||||||
void lv_ll_chg_list(lv_ll_t * ll_ori_p, lv_ll_t * ll_new_p, void * node)
|
bool lv_ll_chg_list(lv_ll_t * ll_ori_p, lv_ll_t * ll_new_p, void * node)
|
||||||
{
|
{
|
||||||
|
bool changed = ll_new_p->head != node;
|
||||||
|
|
||||||
lv_ll_rem(ll_ori_p, node);
|
lv_ll_rem(ll_ori_p, node);
|
||||||
|
|
||||||
/*Set node as head*/
|
/*Set node as head*/
|
||||||
|
@ -232,6 +235,8 @@ void lv_ll_chg_list(lv_ll_t * ll_ori_p, lv_ll_t * ll_new_p, void * node)
|
||||||
if(ll_new_p->tail == NULL) { /*If there is no tail (first node) set the tail too*/
|
if(ll_new_p->tail == NULL) { /*If there is no tail (first node) set the tail too*/
|
||||||
ll_new_p->tail = node;
|
ll_new_p->tail = node;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
return changed;
|
||||||
}
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
|
|
|
@ -89,8 +89,9 @@ void lv_ll_clear(lv_ll_t * ll_p);
|
||||||
* @param ll_ori_p pointer to the original (old) linked list
|
* @param ll_ori_p pointer to the original (old) linked list
|
||||||
* @param ll_new_p pointer to the new linked list
|
* @param ll_new_p pointer to the new linked list
|
||||||
* @param node pointer to a node
|
* @param node pointer to a node
|
||||||
|
* @return head changed
|
||||||
*/
|
*/
|
||||||
void lv_ll_chg_list(lv_ll_t * ll_ori_p, lv_ll_t * ll_new_p, void * node);
|
bool lv_ll_chg_list(lv_ll_t * ll_ori_p, lv_ll_t * ll_new_p, void * node);
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Return with head node of the linked list
|
* Return with head node of the linked list
|
||||||
|
|
Loading…
Reference in a new issue