Searched refs:tail (Results 1 – 4 of 4) sorted by relevance
| /lvgl-3.5.0/src/misc/ |
| D | lv_ll.c | 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()
[all …]
|
| D | lv_ll.h | 35 lv_ll_node_t * tail; member
|
| /lvgl-3.5.0/src/extra/libs/png/ |
| D | lodepng.c | 870 struct BPMNode* tail; /*the next nodes in this chain (null if last)*/ member
889 static BPMNode* bpmnode_create(BPMLists* lists, int weight, unsigned index, BPMNode* tail) { in bpmnode_create() argument
899 for(node = lists->chains0[i]; node != 0; node = node->tail) node->in_use = 1; in bpmnode_create()
900 for(node = lists->chains1[i]; node != 0; node = node->tail) node->in_use = 1; in bpmnode_create()
913 result->tail = tail; in bpmnode_create()
953 …ains1[c] = bpmnode_create(lists, leaves[lastindex].weight, lastindex + 1, lists->chains1[c]->tail); in boundaryPM()
1029 for(node = lists.chains1[maxbitlen - 1]; node; node = node->tail) { in lodepng_huffman_code_lengths()
|
| /lvgl-3.5.0/src/extra/widgets/span/ |
| D | lv_span.c | 241 cur_node = linked_list->tail; in lv_spangroup_get_child()
|
