159#define _LV_LL_READ(list, i) for(i = _lv_ll_get_head(list); i != NULL; i = _lv_ll_get_next(list, i))
161#define _LV_LL_READ_BACK(list, i) for(i = _lv_ll_get_tail(list); i != NULL; i = _lv_ll_get_prev(list, i))
void _lv_ll_clear(lv_ll_t *ll_p)
void _lv_ll_move_before(lv_ll_t *ll_p, void *n_act, void *n_after)
void _lv_ll_remove(lv_ll_t *ll_p, void *node_p)
bool _lv_ll_is_empty(lv_ll_t *ll_p)
void * _lv_ll_ins_tail(lv_ll_t *ll_p)
uint32_t _lv_ll_get_len(const lv_ll_t *ll_p)
void * _lv_ll_get_next(const lv_ll_t *ll_p, const void *n_act)
void * _lv_ll_get_prev(const lv_ll_t *ll_p, const void *n_act)
void * _lv_ll_get_tail(const lv_ll_t *ll_p)
void _lv_ll_init(lv_ll_t *ll_p, uint32_t node_size)
uint8_t lv_ll_node_t
Definition lv_ll.h:29
void * _lv_ll_ins_prev(lv_ll_t *ll_p, void *n_act)
void * _lv_ll_ins_head(lv_ll_t *ll_p)
void _lv_ll_chg_list(lv_ll_t *ll_ori_p, lv_ll_t *ll_new_p, void *node, bool head)
void * _lv_ll_get_head(const lv_ll_t *ll_p)