Home
last modified time | relevance | path

Searched refs:files (Results 1 – 9 of 9) sorted by relevance

/littlefs-2.7.6/tests/
Dtest_interspersed.toml6 lfs_file_t files[FILES];
12 lfs_file_open(&lfs, &files[j], path,
18 lfs_file_write(&lfs, &files[j], &alphas[j], 1) => 1;
23 lfs_file_close(&lfs, &files[j]);
45 lfs_file_open(&lfs, &files[j], path, LFS_O_RDONLY) => 0;
50 lfs_file_read(&lfs, &files[j], buffer, 1) => 1;
56 lfs_file_close(&lfs, &files[j]);
120 lfs_file_t files[3];
121 lfs_file_open(&lfs, &files[0], "e", LFS_O_WRONLY | LFS_O_CREAT) => 0;
122 lfs_file_open(&lfs, &files[1], "f", LFS_O_WRONLY | LFS_O_CREAT) => 0;
[all …]
Dtest_move.toml358 // there should never exist _2_ hello files
987 // littlefs keeps files sorted, so we know the order these will be in
1007 lfs_file_t files[3];
1008 lfs_file_open(&lfs, &files[0], "0.before",
1010 lfs_file_open(&lfs, &files[1], "2.in_between",
1012 lfs_file_open(&lfs, &files[2], "4.after",
1014 lfs_file_write(&lfs, &files[0], "test.4", 7) => 7;
1015 lfs_file_write(&lfs, &files[1], "test.5", 7) => 7;
1016 lfs_file_write(&lfs, &files[2], "test.6", 7) => 7;
1022 lfs_file_close(&lfs, &files[0]) => 0;
[all …]
Dtest_files.toml22 [[case]] # larger files
60 [[case]] # rewriting files
142 [[case]] # appending files
219 [[case]] # truncating files
406 [[case]] # many files
410 // create N files of 7 bytes
431 [[case]] # many files with power cycle
435 // create N files of 7 bytes
458 [[case]] # many files with power loss
467 // create N files of 7 bytes
Dtest_alloc.toml10 lfs_file_t files[FILES];
20 lfs_file_open(&lfs, &files[n], path,
26 lfs_file_write(&lfs, &files[n], names[n], size) => size;
30 lfs_file_close(&lfs, &files[n]) => 0;
93 lfs_file_t files[FILES];
105 lfs_file_open(&lfs, &files[n], path,
111 lfs_file_write(&lfs, &files[n], names[n], size) => size;
115 lfs_file_close(&lfs, &files[n]) => 0;
538 // fill completely with two files
603 // fill completely with two files
Dtest_entries.toml1 # These tests are for some specific corner cases with neighboring inline files.
/littlefs-2.7.6/scripts/
Dprefix.py28 def main(from_prefix, to_prefix=None, files=None): argument
32 if not files:
33 files = subprocess.check_output([
36 for oldname in files:
/littlefs-2.7.6/
DSPEC.md258 Creates a new file with this id. Note that files in a metadata block
260 files using this id. In this sense a create is similar to insertion into
261 an imaginary array of files.
263 The create and delete tags allow littlefs to keep files in a directory
270 any files neighboring this id similar to a deletion from an imaginary
271 array of files.
319 each pair containing any number of files in alphabetical order. A pointer to
399 6. **File max (32-bits)** - Maximum size of files in bytes.
424 each pair containing any number of files in alphabetical order.
465 Inline structs store small files that can fit in the metadata pair. In this
[all …]
DDESIGN.md64 size or number of files. This creates a unique challenge as even presumably
114 Some logging filesystems cache files to avoid the read cost, but this comes
581 So, what can we do? First let's consider storing files in a simple COW
582 linked-list. Appending a block, which is the basis for writing files, means we
1312 The first step: How do we actually store our files?
1334 However, this doesn't work well when files are small, which is common for
1378 metadata pair, we can store multiple files in a single metadata pair. One way
1380 linked list of metadata pairs). This makes it easy for multiple files to share
1389 multiple files stored in metadata pair, 4 bytes costs ~4 KiB
1424 The second improvement we can make is noticing that for very small files, our
[all …]
DREADME.md208 Individual files contain the following tag instead of the full license text.