Home
last modified time | relevance | path

Searched refs:node (Results 1 – 7 of 7) sorted by relevance

/lvgl-3.7.0/src/extra/libs/tiny_ttf/
Dstb_rect_pack.h291 stbrp_node * node = first; in stbrp__skyline_find_min_y() local
301 while(node->next->x <= x0) in stbrp__skyline_find_min_y()
302 ++node; in stbrp__skyline_find_min_y()
304 STBRP_ASSERT(node->next->x > x0); // we ended up handling this in the caller for efficiency in stbrp__skyline_find_min_y()
307 STBRP_ASSERT(node->x <= x0); in stbrp__skyline_find_min_y()
312 while(node->x < x1) { in stbrp__skyline_find_min_y()
313 if(node->y > min_y) { in stbrp__skyline_find_min_y()
317 waste_area += visited_width * (node->y - min_y); in stbrp__skyline_find_min_y()
318 min_y = node->y; in stbrp__skyline_find_min_y()
320 if(node->x < x0) in stbrp__skyline_find_min_y()
[all …]
/lvgl-3.7.0/src/misc/
Dlv_ll.c217 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
219 _lv_ll_remove(ll_ori_p, node); in _lv_ll_chg_list()
223 node_set_prev(ll_new_p, node, NULL); in _lv_ll_chg_list()
224 node_set_next(ll_new_p, node, ll_new_p->head); in _lv_ll_chg_list()
227 node_set_prev(ll_new_p, ll_new_p->head, node); in _lv_ll_chg_list()
230 ll_new_p->head = node; /*Set the new head in the dsc.*/ 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()
238 node_set_next(ll_new_p, node, NULL); in _lv_ll_chg_list()
241 node_set_next(ll_new_p, ll_new_p->tail, node); in _lv_ll_chg_list()
[all …]
Dlv_ll.h93 void _lv_ll_chg_list(lv_ll_t * ll_ori_p, lv_ll_t * ll_new_p, void * node, bool head);
/lvgl-3.7.0/docs/
DROADMAP.md17 - Text node. See [#1701](https://github.com/lvgl/lvgl/issues/1701#issuecomment-699479408)
/lvgl-3.7.0/src/extra/libs/png/
Dlodepng.c898 BPMNode* node; in bpmnode_create() local
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()
1001 BPMNode* node; in lodepng_huffman_code_lengths() local
1029 for(node = lists.chains1[maxbitlen - 1]; node; node = node->tail) { in lodepng_huffman_code_lengths()
1030 for(i = 0; i != node->index; ++i) ++lengths[leaves[i].index]; in lodepng_huffman_code_lengths()
/lvgl-3.7.0/scripts/
DDoxyfile2247 # class node. If there are many fields or methods and many nodes the graph may
2400 # by representing a node as a red box. Note that doxygen if the number of direct
2401 # children of the root node in a graph is already larger than
2412 # further from the root node will be omitted. Note that setting this option to 1
/lvgl-3.7.0/docs/_static/css/
Dfontawesome.min.css5 …ore{content:"\f1ea"}.fa-nimblr:before{content:"\f5a8"}.fa-node:before{content:"\f419"}.fa-node-js:…