Searched refs:lv_ll_node_t (Results 1 – 3 of 3) sorted by relevance
16 #define LL_NODE_META_SIZE (sizeof(lv_ll_node_t *) + sizeof(lv_ll_node_t *))18 #define LL_NEXT_P_OFFSET(ll_p) (ll_p->n_size + sizeof(lv_ll_node_t *))27 static void node_set_prev(lv_ll_t * ll_p, lv_ll_node_t * act, lv_ll_node_t * prev);28 static void node_set_next(lv_ll_t * ll_p, lv_ll_node_t * act, lv_ll_node_t * next);69 lv_ll_node_t * n_new; in _lv_ll_ins_head()98 lv_ll_node_t * n_new; in _lv_ll_ins_prev()110 lv_ll_node_t * n_prev; in _lv_ll_ins_prev()128 lv_ll_node_t * n_new; in _lv_ll_ins_tail()179 lv_ll_node_t * n_prev = _lv_ll_get_prev(ll_p, node_p); in _lv_ll_remove()180 lv_ll_node_t * n_next = _lv_ll_get_next(ll_p, node_p); in _lv_ll_remove()[all …]
29 typedef uint8_t lv_ll_node_t; typedef34 lv_ll_node_t * head;35 lv_ll_node_t * tail;
236 lv_ll_node_t * cur_node = linked_list->head; in lv_spangroup_get_child()249 cur_node = (lv_ll_node_t *) _lv_ll_get_next(linked_list, cur_node); in lv_spangroup_get_child()253 cur_node = (lv_ll_node_t *) _lv_ll_get_prev(linked_list, cur_node); in lv_spangroup_get_child()
