Searched refs:free (Results 1 – 7 of 7) sorted by relevance
| /littlefs-3.7.0-3.6.0/runners/ |
| D | test_runner.c | 420 free(test_define_cache); in test_define_cleanup()
421 free(test_define_cache_mask); in test_define_cleanup()
422 free(test_override_defines); in test_define_cleanup()
664 free(seen->branches); in test_seen_cleanup()
1185 free(defines.defines[i].values); in list_defines()
1187 free(defines.defines); in list_defines()
1233 free(defines.defines[i].values); in list_permutation_defines()
1235 free(defines.defines); in list_permutation_defines()
1269 free(defines.defines[i].values); in list_implicit_defines()
1271 free(defines.defines); in list_implicit_defines()
[all …]
|
| D | bench_runner.c | 407 free(bench_define_cache); in bench_define_cleanup()
408 free(bench_define_cache_mask); in bench_define_cleanup()
409 free(bench_override_defines); in bench_define_cleanup()
684 free(seen->branches); in bench_seen_cleanup()
1146 free(defines.defines[i].values); in list_defines()
1148 free(defines.defines); in list_defines()
1192 free(defines.defines[i].values); in list_permutation_defines()
1194 free(defines.defines); in list_permutation_defines()
1228 free(defines.defines[i].values); in list_implicit_defines()
1230 free(defines.defines); in list_implicit_defines()
[all …]
|
| /littlefs-3.7.0-3.6.0/ |
| D | lfs.c | 604 lfs_block_t off = ((block - lfs->free.off) in lfs_alloc_lookahead()
607 if (off < lfs->free.size) { in lfs_alloc_lookahead()
608 lfs->free.buffer[off / 32] |= 1U << (off % 32); in lfs_alloc_lookahead()
619 lfs->free.ack = lfs->block_count; in lfs_alloc_ack()
625 lfs->free.size = 0; in lfs_alloc_drop()
626 lfs->free.i = 0; in lfs_alloc_drop()
634 lfs->free.off = (lfs->free.off + lfs->free.i) % lfs->block_count; in lfs_fs_rawgc()
635 lfs->free.size = lfs_min(8*lfs->cfg->lookahead_size, lfs->free.ack); in lfs_fs_rawgc()
636 lfs->free.i = 0; in lfs_fs_rawgc()
639 memset(lfs->free.buffer, 0, lfs->cfg->lookahead_size); in lfs_fs_rawgc()
[all …]
|
| D | lfs_util.h | 231 free(p); in lfs_free()
|
| D | DESIGN.md | 851 Normally, block allocation involves some sort of free list or bitmap stored on
852 the filesystem that is updated with free blocks. However, with power
857 littlefs takes a cautious approach. Instead of trusting a free list on disk,
859 the free blocks on the disk. The block allocator operates much like a garbage
883 '-------------------'----'-------------------'----'-- free blocks
886 While this approach may sound complicated, the decision to not maintain a free
896 Our block allocator needs to find free blocks efficiently. You could traverse
922 is empty, we scan the filesystem for more free blocks, populating our lookahead
954 one or two passes are usually needed to find free blocks. Additionally, the
1235 perfectly, but it is distributed among the free blocks and greatly extends the
[all …]
|
| D | lfs.h | 439 } free; member
|
| /littlefs-3.7.0-3.6.0/bd/ |
| D | lfs_emubd.c | 43 free(block); in lfs_emubd_decblock()
195 free(bd->blocks); in lfs_emubd_destroy()
202 free(bd->disk->scratch); in lfs_emubd_destroy()
203 free(bd->disk); in lfs_emubd_destroy()
|
