Lines Matching refs:tail
53 ll_p->tail = NULL; in lv_ll_init()
91 if(ll_p->tail == NULL) { /*If there is no tail (1. node) set the tail too*/ in lv_ll_ins_head()
92 ll_p->tail = n_new; in lv_ll_ins_head()
143 node_set_prev(ll_p, n_new, ll_p->tail); /*The prev. before new is tho old tail*/ in lv_ll_ins_tail()
144 if(ll_p->tail != NULL) { /*If there is old tail then the new comes after it*/ in lv_ll_ins_tail()
145 node_set_next(ll_p, ll_p->tail, n_new); in lv_ll_ins_tail()
148 ll_p->tail = n_new; /*Set the new tail in the dsc.*/ in lv_ll_ins_tail()
169 ll_p->tail = NULL; in lv_ll_rem()
175 ll_p->tail = lv_ll_get_prev(ll_p, node_p); in lv_ll_rem()
176 if(ll_p->tail == NULL) { in lv_ll_rem()
179 node_set_next(ll_p, ll_p->tail, NULL); in lv_ll_rem()
234 if(ll_new_p->tail == NULL) { /*If there is no tail (first node) set the tail too*/ in lv_ll_chg_list()
235 ll_new_p->tail = node; in lv_ll_chg_list()
239 node_set_prev(ll_new_p, node, ll_new_p->tail); in lv_ll_chg_list()
242 if(ll_new_p->tail != NULL) { /*If there is old tail then after it goes the new*/ in lv_ll_chg_list()
243 node_set_next(ll_new_p, ll_new_p->tail, node); in lv_ll_chg_list()
246 ll_new_p->tail = node; /*Set the new tail in the dsc.*/ in lv_ll_chg_list()
276 void * tail = NULL; in lv_ll_get_tail() local
279 tail = ll_p->tail; in lv_ll_get_tail()
282 return tail; in lv_ll_get_tail()
374 if(n_after == NULL) ll_p->tail = n_act; in lv_ll_move_before()
389 if(ll_p->head == NULL && ll_p->tail == NULL) return true; in lv_ll_is_empty()