69     lv_ll_node_t * n_new;  in _lv_ll_ins_head()  local
71     n_new = lv_mem_alloc(ll_p->n_size + LL_NODE_META_SIZE);  in _lv_ll_ins_head()
73     if(n_new != NULL) {  in _lv_ll_ins_head()
74         node_set_prev(ll_p, n_new, NULL);       /*No prev. before the new head*/  in _lv_ll_ins_head()
75         node_set_next(ll_p, n_new, ll_p->head); /*After new comes the old head*/  in _lv_ll_ins_head()
78             node_set_prev(ll_p, ll_p->head, n_new);  in _lv_ll_ins_head()
81         ll_p->head = n_new;      /*Set the new head in the dsc.*/  in _lv_ll_ins_head()
83             ll_p->tail = n_new;  in _lv_ll_ins_head()
87     return n_new;  in _lv_ll_ins_head()
98     lv_ll_node_t * n_new;  in _lv_ll_ins_prev()  local
103         n_new = _lv_ll_ins_head(ll_p);  in _lv_ll_ins_prev()
104         if(n_new == NULL) return NULL;  in _lv_ll_ins_prev()
107         n_new = lv_mem_alloc(ll_p->n_size + LL_NODE_META_SIZE);  in _lv_ll_ins_prev()
108         if(n_new == NULL) return NULL;  in _lv_ll_ins_prev()
112         node_set_next(ll_p, n_prev, n_new);  in _lv_ll_ins_prev()
113         node_set_prev(ll_p, n_new, n_prev);  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()
118     return n_new;  in _lv_ll_ins_prev()
128     lv_ll_node_t * n_new;  in _lv_ll_ins_tail()  local
130     n_new = lv_mem_alloc(ll_p->n_size + LL_NODE_META_SIZE);  in _lv_ll_ins_tail()
132     if(n_new != NULL) {  in _lv_ll_ins_tail()
133         node_set_next(ll_p, n_new, NULL);       /*No next after the new tail*/  in _lv_ll_ins_tail()
134         node_set_prev(ll_p, n_new, ll_p->tail); /*The prev. before new is the old tail*/  in _lv_ll_ins_tail()
136             node_set_next(ll_p, ll_p->tail, n_new);  in _lv_ll_ins_tail()
139         ll_p->tail = n_new;      /*Set the new tail in the dsc.*/  in _lv_ll_ins_tail()
141             ll_p->head = n_new;  in _lv_ll_ins_tail()
145     return n_new;  in _lv_ll_ins_tail()