Searched full:entry (Results 1 – 16 of 16) sorted by relevance
/lvgl-3.7.0/src/extra/libs/gif/ |
D | gifdec.c | 14 typedef struct Entry { struct 18 } Entry; argument 23 Entry *entries; 304 Table *table = lv_mem_alloc(sizeof(*table) + sizeof(Entry) * init_bulk); in new_table() 308 table->entries = (Entry *) &table[1]; in new_table() 310 table->entries[key] = (Entry) {1, 0xFFF, key}; in new_table() 315 /* Add table entry. Return value: 325 table = lv_mem_realloc(table, sizeof(*table) + sizeof(Entry) * table->bulk); in add_entry() 327 table->entries = (Entry *) &table[1]; in add_entry() 330 table->entries[table->nentries] = (Entry) {length, prefix, suffix}; in add_entry() [all …]
|
/lvgl-3.7.0/src/draw/ |
D | lv_draw_mask.c | 83 /*Look for a free entry*/ in lv_draw_mask_add() 496 /*Try to reuse a circle cache entry*/ in lv_draw_mask_radius_init() 506 /*If not found find a free entry with lowest life*/ in lv_draw_mask_radius_init() 507 _lv_draw_mask_radius_circle_dsc_t * entry = NULL; in lv_draw_mask_radius_init() local 510 if(!entry) entry = &LV_GC_ROOT(_lv_circle_cache[i]); in lv_draw_mask_radius_init() 511 …else if(LV_GC_ROOT(_lv_circle_cache[i]).life < entry->life) entry = &LV_GC_ROOT(_lv_circle_cache[i… in lv_draw_mask_radius_init() 515 if(!entry) { in lv_draw_mask_radius_init() 516 entry = lv_mem_alloc(sizeof(_lv_draw_mask_radius_circle_dsc_t)); in lv_draw_mask_radius_init() 517 LV_ASSERT_MALLOC(entry); in lv_draw_mask_radius_init() 518 lv_memset_00(entry, sizeof(_lv_draw_mask_radius_circle_dsc_t)); in lv_draw_mask_radius_init() [all …]
|
D | lv_img_cache.c | 61 * @return pointer to the cache entry or NULL if can open the image 102 /*Find an entry to reuse. Select the entry with the least life*/ in _lv_img_cache_open() 113 LV_LOG_INFO("image draw: cache miss, close and reuse an entry"); in _lv_img_cache_open() 116 LV_LOG_INFO("image draw: cache miss, cached to an empty entry"); in _lv_img_cache_open() 127 cached_src->life = INT32_MIN; /*Make the empty entry very "weak" to force its us*/ in _lv_img_cache_open()
|
D | lv_img_cache.h | 34 /** Count the cache entries's life. Add `time_to_open` to `life` when the entry is used. 36 * If life == 0 the entry can be reused*/ 51 * @return pointer to the cache entry or NULL if can open the image
|
D | lv_draw_mask.h | 158 int32_t life; /*How many times the entry way used*/ 160 lv_coord_t radius; /*The radius of the entry*/
|
/lvgl-3.7.0/docs/_templates/ |
D | page.html | 56 entries.forEach(entry => { 57 let currentlyLoaded = entry.target.getAttribute("data-is-loaded") == "true"; 58 let shouldBeLoaded = entry.intersectionRatio > 0; 60 entry.target.setAttribute("data-is-loaded", shouldBeLoaded); 63 iframe.src = entry.target.getAttribute("data-real-src"); 64 entry.target.appendChild(iframe); 66 let iframe = entry.target.querySelector("iframe");
|
/lvgl-3.7.0/src/extra/libs/fsdrv/ |
D | lv_fs_posix.c | 259 struct dirent * entry; in fs_dir_read() local 261 entry = readdir(dir_p); in fs_dir_read() 262 if(entry) { in fs_dir_read() 263 if(entry->d_type == DT_DIR) sprintf(fn, "/%s", entry->d_name); in fs_dir_read() 264 else strcpy(fn, entry->d_name); in fs_dir_read()
|
D | lv_fs_stdio.c | 265 struct dirent * entry; in fs_dir_read() local 267 entry = readdir(handle->dir_p); in fs_dir_read() 268 if(entry) { in fs_dir_read() 269 if(entry->d_type == DT_DIR) lv_snprintf(fn, MAX_PATH_LEN, "/%s", entry->d_name); in fs_dir_read() 270 else strcpy(fn, entry->d_name); in fs_dir_read()
|
/lvgl-3.7.0/docs/ |
D | conf.py | 214 # One entry per manual page. List of tuples 226 # dir menu entry, description, category)
|
/lvgl-3.7.0/docs/overview/ |
D | image.md | 304 Every cache entry has a *"life"* value. Every time an image is opened through the cache, the *life*… 307 If there is no more space in the cache, the entry with the lowest life value will be closed.
|
/lvgl-3.7.0/src/misc/ |
D | lv_tlsf.c | 614 tlsf_assert(current && "free list cannot have a null entry"); in insert_free_block() 615 tlsf_assert(block && "cannot insert a null entry into the free list"); in insert_free_block()
|
D | lv_utils.h | 33 * argument (the search key) is less that it's second (a table entry),
|
D | lv_utils.c | 40 * argument (the search key) is less than its second (a table entry),
|
/lvgl-3.7.0/ |
D | .pre-commit-config.yaml | 15 entry: astyle --options=scripts/code-format.cfg --ignore-exclude-errors
|
/lvgl-3.7.0/scripts/ |
D | Doxyfile | 672 # will remove the Files entry from the Quick Index and from the Folder Tree View 679 # page. This will remove the Namespaces entry from the Quick Index and from the
|
/lvgl-3.7.0/src/extra/libs/qrcode/ |
D | qrcodegen.c | 335 // The result is in the range [208, 29648]. This could be implemented as a 40-entry lookup table.
|