Home
last modified time | relevance | path

Searched refs:disk (Results 1 – 11 of 11) sorted by relevance

/littlefs-latest/bd/
Dlfs_emubd.c134 bd->disk = NULL; in lfs_emubd_create()
137 bd->disk = malloc(sizeof(lfs_emubd_disk_t)); in lfs_emubd_create()
138 if (!bd->disk) { in lfs_emubd_create()
142 bd->disk->rc = 1; in lfs_emubd_create()
143 bd->disk->scratch = NULL; in lfs_emubd_create()
146 bd->disk->fd = open(bd->cfg->disk_path, in lfs_emubd_create()
149 bd->disk->fd = open(bd->cfg->disk_path, in lfs_emubd_create()
152 if (bd->disk->fd < 0) { in lfs_emubd_create()
161 bd->disk->scratch = malloc(bd->cfg->erase_size); in lfs_emubd_create()
162 if (!bd->disk->scratch) { in lfs_emubd_create()
[all …]
Dlfs_emubd.h158 lfs_emubd_disk_t *disk; member
/littlefs-latest/
DREADME.md189 - [SPEC.md](SPEC.md) - The on-disk specification of littlefs with all the
241 - [littlefs-disk-img-viewer] - A memory-efficient web application for viewing
242 littlefs disk images in your web browser.
286 [littlefs-disk-img-viewer]: https://github.com/tniessen/littlefs-disk-img-viewer
DSPEC.md3 This is the technical specification of the little filesystem with on-disk
5 is stored on disk for introspection and tooling. This document assumes you are
20 - littlefs is a block-based filesystem. The disk is divided into an array of
40 are not necessarily sequential and may be anywhere on disk, so a "pointer" to a
359 Directories in littlefs are stored on disk as a linked-list of metadata pairs,
452 Associates the id with an on-disk data structure.
465 Directories in littlefs are stored on disk as a linked-list of metadata pairs,
838 program block size. However, the program block is not saved on disk, and can
839 change between mounts, so the FCRC size on disk may be different than the
DDESIGN.md21 low-level details covering every bit on disk, check out [SPEC.md](SPEC.md).
304 stored on disk. But remember that flash has limited write granularity. We can
327 disk v v
641 The additional pointers let us navigate the data-structure on disk much more
726 doesn't need to touch the disk, so the practical impact is minimal.
794 write data to disk, create copies
857 littlefs takes a cautious approach. Instead of trusting a free list on disk,
858 littlefs relies on the fact that the filesystem on disk is a mirror image of
859 the free blocks on the disk. The block allocator operates much like a garbage
891 complexity of managing on disk data structures, especially when handling
[all …]
Dlfs.c917 struct lfs_diskoff disk; member
935 struct lfs_diskoff disk = {0}; in lfs_dir_traverse() local
948 disk.block = dir->pair[0]; in lfs_dir_traverse()
949 disk.off = off+sizeof(lfs_tag_t); in lfs_dir_traverse()
950 buffer = &disk; in lfs_dir_traverse()
988 .disk = disk, in lfs_dir_traverse()
1106 disk = stack[sp-1].disk; in lfs_dir_traverse()
1464 const struct lfs_diskoff *disk = buffer; in lfs_dir_find_match() local
1470 disk->block, disk->off, name->name, diff); in lfs_dir_find_match()
1651 const struct lfs_diskoff *disk = buffer; in lfs_dir_commitattr() local
[all …]
/littlefs-latest/scripts/
Dreadblock.py6 with open(args.disk, 'rb') as f:
Dreadtree.py17 with open(args.disk, 'rb') as f:
Dreadmdir.py343 with open(args.disk, 'rb') as f:
/littlefs-latest/tests/
Dtest_alloc.toml497 // check that the disk isn't hurt
Dtest_dirs.toml795 // or on disk