96 void * _lv_ll_ins_prev(lv_ll_t * ll_p, void * n_act)  in _lv_ll_ins_prev()  argument
100     if(NULL == ll_p || NULL == n_act) return NULL;  in _lv_ll_ins_prev()
102     if(_lv_ll_get_head(ll_p) == n_act) {  in _lv_ll_ins_prev()
111         n_prev = _lv_ll_get_prev(ll_p, n_act);  in _lv_ll_ins_prev()
114         node_set_prev(ll_p, n_act, n_new);  in _lv_ll_ins_prev()
115         node_set_next(ll_p, n_new, n_act);  in _lv_ll_ins_prev()
279 void * _lv_ll_get_next(const lv_ll_t * ll_p, const void * n_act)  in _lv_ll_get_next()  argument
283     const lv_ll_node_t * n_act_d = n_act;  in _lv_ll_get_next()
294 void * _lv_ll_get_prev(const lv_ll_t * ll_p, const void * n_act)  in _lv_ll_get_prev()  argument
298     const lv_ll_node_t * n_act_d = n_act;  in _lv_ll_get_prev()
326 void _lv_ll_move_before(lv_ll_t * ll_p, void * n_act, void * n_after)  in _lv_ll_move_before()  argument
328     if(n_act == n_after) return; /*Can't move before itself*/  in _lv_ll_move_before()
336     if(n_act == n_before) return; /*Already before `n_after`*/  in _lv_ll_move_before()
339     _lv_ll_remove(ll_p, n_act);  in _lv_ll_move_before()
342     node_set_next(ll_p, n_before, n_act);  in _lv_ll_move_before()
343     node_set_prev(ll_p, n_act, n_before);  in _lv_ll_move_before()
344     node_set_prev(ll_p, n_after, n_act);  in _lv_ll_move_before()
345     node_set_next(ll_p, n_act, n_after);  in _lv_ll_move_before()
348     if(n_after == NULL) ll_p->tail = n_act;  in _lv_ll_move_before()
351     if(n_before == NULL) ll_p->head = n_act;  in _lv_ll_move_before()