50     ll_p->tail = NULL;  in _lv_ll_init()
82         if(ll_p->tail == NULL) { /*If there is no tail (1. node) set the tail too*/  in _lv_ll_ins_head()
83             ll_p->tail = n_new;  in _lv_ll_ins_head()
134         node_set_prev(ll_p, n_new, ll_p->tail); /*The prev. before new is the old tail*/  in _lv_ll_ins_tail()
135         if(ll_p->tail != NULL) {                /*If there is old tail then the new comes after it*/  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()
162             ll_p->tail = NULL;  in _lv_ll_remove()
170         ll_p->tail = _lv_ll_get_prev(ll_p, node_p);  in _lv_ll_remove()
171         if(ll_p->tail == NULL) {  in _lv_ll_remove()
175             node_set_next(ll_p, ll_p->tail, NULL);  in _lv_ll_remove()
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()
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()
270     return ll_p->tail;  in _lv_ll_get_tail()
348     if(n_after == NULL) ll_p->tail = n_act;  in _lv_ll_move_before()
363     if(ll_p->head == NULL && ll_p->tail == NULL) return true;  in _lv_ll_is_empty()