Lines Matching full:head

44     ll_p->head = NULL;  in lv_ll_init()
64 node_set_prev(ll_p, n_new, NULL); /*No prev. before the new head*/ in lv_ll_ins_head()
65 node_set_next(ll_p, n_new, ll_p->head); /*After new comes the old head*/ in lv_ll_ins_head()
67 if(ll_p->head != NULL) { /*If there is old head then before it goes the new*/ in lv_ll_ins_head()
68 node_set_prev(ll_p, ll_p->head, n_new); in lv_ll_ins_head()
71 ll_p->head = n_new; /*Set the new head in the dsc.*/ in lv_ll_ins_head()
119 if(ll_p->head == NULL) { /*If there is no head (1. node) set the head too*/ in lv_ll_ins_tail()
120 ll_p->head = n_new; in lv_ll_ins_tail()
132 /*The new head will be the node after 'node_p'*/ in lv_ll_remove()
133 ll_p->head = lv_ll_get_next(ll_p, node_p); in lv_ll_remove()
134 if(ll_p->head == NULL) { in lv_ll_remove()
138 node_set_prev(ll_p, ll_p->head, NULL); in lv_ll_remove()
145 ll_p->head = NULL; in lv_ll_remove()
181 void lv_ll_chg_list(lv_ll_t * ll_ori_p, lv_ll_t * ll_new_p, void * node, bool head) in lv_ll_chg_list() argument
185 if(head) { in lv_ll_chg_list()
186 /*Set node as head*/ in lv_ll_chg_list()
188 node_set_next(ll_new_p, node, ll_new_p->head); in lv_ll_chg_list()
190 if(ll_new_p->head != NULL) { /*If there is old head then before it goes the new*/ in lv_ll_chg_list()
191 node_set_prev(ll_new_p, ll_new_p->head, node); in lv_ll_chg_list()
194 ll_new_p->head = node; /*Set the new head in the dsc.*/ in lv_ll_chg_list()
209 if(ll_new_p->head == NULL) { /*If there is no head (first node) set the head too*/ in lv_ll_chg_list()
210 ll_new_p->head = node; in lv_ll_chg_list()
218 return ll_p->head; in lv_ll_get_head()
281 /*If `n_act` was moved before `NULL` then it's the new head*/ in lv_ll_move_before()
282 if(n_before == NULL) ll_p->head = n_act; in lv_ll_move_before()
289 if(ll_p->head == NULL && ll_p->tail == NULL) return true; in lv_ll_is_empty()