| /lvgl-latest/src/libs/thorvg/ |
| D | tvgInlist.h | 40 T* tail = nullptr; member
49 head = tail = nullptr; in free()
54 if (tail) { in back()
55 tail->next = element; in back()
56 element->prev = tail; in back()
58 tail = element; in back()
60 head = tail = element; in back()
74 head = tail = element; in front()
82 if (!tail) return nullptr; in back()
83 auto t = tail; in back()
[all …]
|
| D | tvgLottieBuilder.cpp | 252 auto fragment = contexts.tail; in _fragmented()
|
| /lvgl-latest/src/misc/ |
| D | lv_ll.c | 45 ll_p->tail = NULL; in lv_ll_init()
72 if(ll_p->tail == NULL) { /*If there is no tail (1. node) set the tail too*/ in lv_ll_ins_head()
73 ll_p->tail = n_new; in lv_ll_ins_head()
113 node_set_prev(ll_p, n_new, ll_p->tail); /*The prev. before new is the old tail*/ in lv_ll_ins_tail()
114 if(ll_p->tail != NULL) { /*If there is old tail then the new comes after it*/ in lv_ll_ins_tail()
115 node_set_next(ll_p, ll_p->tail, n_new); in lv_ll_ins_tail()
118 ll_p->tail = n_new; /*Set the new tail in the dsc.*/ in lv_ll_ins_tail()
135 ll_p->tail = NULL; in lv_ll_remove()
143 ll_p->tail = lv_ll_get_prev(ll_p, node_p); in lv_ll_remove()
144 if(ll_p->tail == NULL) { in lv_ll_remove()
[all …]
|
| D | lv_circle_buf.c | 26 uint32_t tail; /**< The next write position */ member
64 circle_buf->tail = 0; in lv_circle_buf_create()
85 circle_buf->tail = 0; in lv_circle_buf_create_from_buf()
109 circle_buf->tail = 0; in lv_circle_buf_create_from_array()
126 circle_buf->tail = 0; in lv_circle_buf_resize()
146 return circle_buf->tail - circle_buf->head; in lv_circle_buf_size()
183 circle_buf->tail = 0; in lv_circle_buf_reset()
199 circle_buf->tail % lv_circle_buf_capacity(circle_buf)); in lv_circle_buf_tail()
208 circle_buf->tail = 0; in lv_circle_buf_read()
226 … lv_array_assign(&circle_buf->array, circle_buf->tail % lv_circle_buf_capacity(circle_buf), data); in lv_circle_buf_write()
[all …]
|
| D | lv_ll.h | 34 lv_ll_node_t * tail; member
|
| /lvgl-latest/src/draw/ |
| D | lv_draw.c | 109 lv_draw_task_t * tail = layer->draw_task_head; in lv_draw_add_task() local
110 while(tail->next) tail = tail->next; in lv_draw_add_task()
112 tail->next = new_task; in lv_draw_add_task()
443 lv_layer_t * tail = disp->layer_head; in lv_draw_layer_init() local
444 while(tail->next) tail = tail->next; in lv_draw_layer_init()
445 tail->next = layer; in lv_draw_layer_init()
|
| /lvgl-latest/src/libs/tiny_ttf/ |
| D | stb_rect_pack.h | 349 stbrp_node ** prev, * node, * tail, ** best = NULL; in stbrp__skyline_find_best_pos() local
410 tail = c->active_head; in stbrp__skyline_find_best_pos()
414 while(tail->x < width) in stbrp__skyline_find_best_pos()
415 tail = tail->next; in stbrp__skyline_find_best_pos()
416 while(tail) { in stbrp__skyline_find_best_pos()
417 int xpos = tail->x - width; in stbrp__skyline_find_best_pos()
438 tail = tail->next; in stbrp__skyline_find_best_pos()
|
| /lvgl-latest/scripts/gen_json/ |
| D | create_fake_lib_c.py | 157 head, tail = os.path.split(file)
162 if None not in (head, tail):
|
| /lvgl-latest/src/others/font_manager/ |
| D | lv_font_manager_recycle.c | 165 lv_font_recycle_t * tail = lv_ll_get_tail(&manager->recycle_ll); in lv_font_manager_recycle_remove_tail() local
166 LV_ASSERT_NULL(tail); in lv_font_manager_recycle_remove_tail()
167 lv_font_recycle_close(manager, tail); in lv_font_manager_recycle_remove_tail()
|
| /lvgl-latest/src/misc/cache/ |
| D | lv_cache_lru_rb.c | 423 lv_rb_node_t ** tail; in get_victim_cb() local
424 LV_LL_READ_BACK(&lru->ll, tail) { in get_victim_cb()
425 lv_rb_node_t * tail_node = *tail; in get_victim_cb()
|
| /lvgl-latest/docs/ |
| D | doc_builder.py | 183 if element.tail:
185 docstring += ' ' + element.tail.strip()
187 docstring = element.tail.strip()
921 if element.tail:
923 define += ' ' + element.tail.strip()
925 define = element.tail.strip()
|
| /lvgl-latest/src/draw/sw/blend/neon/ |
| D | lv_blend_neon.S | 551 .macro tail src_bpp, dst_bpp, mask, opa, mode macro
634 tail \src_bpp, \dst_bpp, \mask, \opa, \mode
646 tail \src_bpp, \dst_bpp, \mask, \opa, \mode
|
| /lvgl-latest/src/libs/svg/ |
| D | lv_svg_render.c | 205 lv_svg_render_obj_t * tail; member
1988 state->tail = obj; in _lv_svg_doc_walk_cb()
1991 state->tail->next = obj; in _lv_svg_doc_walk_cb()
1992 state->tail = obj; in _lv_svg_doc_walk_cb()
2138 .list = NULL, .tail = NULL in lv_svg_render_create()
|
| /lvgl-latest/src/draw/sw/blend/helium/ |
| D | lv_blend_helium.S | 264 @ 31 to 31/32: index @ q3 (tail only)
|
| /lvgl-latest/src/libs/lodepng/ |
| D | lodepng.c | 901 struct BPMNode * tail; /*the next nodes in this chain (null if last)*/ member
920 static BPMNode * bpmnode_create(BPMLists * lists, int weight, unsigned index, BPMNode * tail) in bpmnode_create() argument
931 for(node = lists->chains0[i]; node != 0; node = node->tail) node->in_use = 1; in bpmnode_create()
932 for(node = lists->chains1[i]; node != 0; node = node->tail) node->in_use = 1; in bpmnode_create()
945 result->tail = tail; in bpmnode_create()
988 …ains1[c] = bpmnode_create(lists, leaves[lastindex].weight, lastindex + 1, lists->chains1[c]->tail); in boundaryPM()
1067 for(node = lists.chains1[maxbitlen - 1]; node; node = node->tail) { in lodepng_huffman_code_lengths()
|
| /lvgl-latest/src/widgets/span/ |
| D | lv_span.c | 286 cur_node = linked_list->tail; in lv_spangroup_get_child()
|
