217 void _lv_ll_chg_list(lv_ll_t * ll_ori_p, lv_ll_t * ll_new_p, void * node, bool head)  in _lv_ll_chg_list()  argument
223         node_set_prev(ll_new_p, node, NULL);  in _lv_ll_chg_list()
224         node_set_next(ll_new_p, node, ll_new_p->head);  in _lv_ll_chg_list()
226         if(ll_new_p->head != NULL) { /*If there is old head then before it goes the new*/  in _lv_ll_chg_list()
227             node_set_prev(ll_new_p, ll_new_p->head, node);  in _lv_ll_chg_list()
230         ll_new_p->head = node;       /*Set the new head in the dsc.*/  in _lv_ll_chg_list()
231         if(ll_new_p->tail == NULL) { /*If there is no tail (first node) set the tail too*/  in _lv_ll_chg_list()
232             ll_new_p->tail = node;  in _lv_ll_chg_list()
237         node_set_prev(ll_new_p, node, ll_new_p->tail);  in _lv_ll_chg_list()
238         node_set_next(ll_new_p, node, NULL);  in _lv_ll_chg_list()
240         if(ll_new_p->tail != NULL) { /*If there is old tail then after it goes the new*/  in _lv_ll_chg_list()
241             node_set_next(ll_new_p, ll_new_p->tail, node);  in _lv_ll_chg_list()
244         ll_new_p->tail = node;       /*Set the new tail in the dsc.*/  in _lv_ll_chg_list()
245         if(ll_new_p->head == NULL) { /*If there is no head (first node) set the head too*/  in _lv_ll_chg_list()
246             ll_new_p->head = node;  in _lv_ll_chg_list()