Home
last modified time | relevance | path

Searched full:- (Results 1 – 25 of 34) sorted by relevance

12

/littlefs-2.7.6/
DDESIGN.md3 A little fail-safe filesystem designed for microcontrollers.
6 | | | .---._____
7 .-----. | |
8 --|o |---| littlefs |
9 --| |---| |
10 '-----' '----------'
16 filesystem that is resilient to power-loss and flash wear without using
19 This document covers the high-level design of littlefs, how it is different
21 low-level details covering every bit on disk, check out [SPEC.md](SPEC.md).
25 The embedded systems littlefs targets are usually 32-bit microcontrollers with
[all …]
DSPEC.md10 | | | .---._____
11 .-----. | |
12 --|o |---| littlefs |
13 --| |---| |
14 '-----' '----------'
20 - littlefs is a block-based filesystem. The disk is divided into an array of
23 - Block pointers are stored in 32 bits, with the special value `0xffffffff`
26 - In addition to the logical block size (which usually matches the erase
31 - By default, all values in littlefs are stored in little-endian byte order.
49 The high-level layout of a metadata block is fairly simple:
[all …]
D.travis.yml4 - CFLAGS=-Werror
5 - MAKEFLAGS=-j
11 - $HOME/.cache/apt
14 _: &install-common
16 - sudo apt-get install python3 python3-pip
17 - sudo pip3 install toml
18 # setup a ram-backed disk to speed up reentrant tests
19 - mkdir disks
20 - sudo mount -t tmpfs -o size=100m tmpfs disks
21 - export TFLAGS="$TFLAGS --disk=disks/disk"
[all …]
DREADME.md3 A little fail-safe filesystem designed for microcontrollers.
6 | | | .---._____
7 .-----. | |
8 --|o |---| littlefs |
9 --| |---| |
10 '-----' '----------'
14 **Power-loss resilience** - littlefs is designed to handle random power
15 failures. All file operations have strong copy-on-write guarantees and if
18 **Dynamic wear leveling** - littlefs is designed with flash in mind, and
22 **Bounded RAM/ROM** - littlefs is designed to work with a small amount of
[all …]
Dlfs.c5 * SPDX-License-Identifier: BSD-3-Clause
10 #define LFS_BLOCK_NULL ((lfs_block_t)-1)
11 #define LFS_BLOCK_INLINE ((lfs_block_t)-2)
18 rcache->block = LFS_BLOCK_NULL; in lfs_cache_drop()
23 memset(pcache->buffer, 0xff, lfs->cfg->cache_size); in lfs_cache_zero()
24 pcache->block = LFS_BLOCK_NULL; in lfs_cache_zero()
32 if (block >= lfs->cfg->block_count || in lfs_bd_read()
33 off+size > lfs->cfg->block_size) { in lfs_bd_read()
40 if (pcache && block == pcache->block && in lfs_bd_read()
41 off < pcache->off + pcache->size) { in lfs_bd_read()
[all …]
DMakefile16 override CFLAGS += -O0 -g3
18 override CFLAGS += -Os
21 override CFLAGS += -m$(WORD)
24 override CFLAGS += -DLFS_YES_TRACE
26 override CFLAGS += -I.
27 override CFLAGS += -std=c99 -Wall -pedantic
28 override CFLAGS += -Wextra -Wshadow -Wjump-misses-init -Wundef
29 # Remove missing-field-initializers because of GCC bug
30 override CFLAGS += -Wno-missing-field-initializers
33 override TFLAGS += -v
[all …]
Dlfs.h5 * SPDX-License-Identifier: BSD-3-Clause
22 // Major (top-nibble), incremented on backwards incompatible changes
23 // Minor (bottom-nibble), incremented on feature additions
28 // Version of On-disk data structures
29 // Major (top-nibble), incremented on backwards incompatible changes
30 // Minor (bottom-nibble), incremented on feature additions
73 LFS_ERR_IO = -5, // Error during device operation
74 LFS_ERR_CORRUPT = -84, // Corrupted
75 LFS_ERR_NOENT = -2, // No directory entry
76 LFS_ERR_EXIST = -17, // Entry already exists
[all …]
Dlfs_util.h5 * SPDX-License-Identifier: BSD-3-Clause
11 // LFS_CONFIG as a header file to include (-DLFS_CONFIG=lfs_config.h).
65 // macros must not have side-effects as the macros can be removed for a smaller
130 // toolchain-specific implementations. LFS_NO_INTRINSICS falls back to a more
133 // Min/max functions for unsigned 32-bit numbers
144 return a - (a % alignment); in lfs_aligndown()
148 return lfs_aligndown(a + alignment-1, alignment); in lfs_alignup()
154 return 32 - __builtin_clz(a-1); in lfs_npw2()
158 a -= 1; in lfs_npw2()
173 return lfs_npw2((a & -a) + 1) - 1; in lfs_ctz()
[all …]
/littlefs-2.7.6/bd/
Dlfs_testbd.c6 * SPDX-License-Identifier: BSD-3-Clause
23 (void*)cfg, cfg->context, in lfs_testbd_createcfg()
24 (void*)(uintptr_t)cfg->read, (void*)(uintptr_t)cfg->prog, in lfs_testbd_createcfg()
25 (void*)(uintptr_t)cfg->erase, (void*)(uintptr_t)cfg->sync, in lfs_testbd_createcfg()
26 cfg->read_size, cfg->prog_size, cfg->block_size, cfg->block_count, in lfs_testbd_createcfg()
27 path, (void*)bdcfg, bdcfg->erase_value, bdcfg->erase_cycles, in lfs_testbd_createcfg()
28 bdcfg->badblock_behavior, bdcfg->power_cycles, in lfs_testbd_createcfg()
29 bdcfg->buffer, bdcfg->wear_buffer); in lfs_testbd_createcfg()
30 lfs_testbd_t *bd = cfg->context; in lfs_testbd_createcfg()
31 bd->cfg = bdcfg; in lfs_testbd_createcfg()
[all …]
Dlfs_filebd.c5 * SPDX-License-Identifier: BSD-3-Clause
21 (void*)cfg, cfg->context, in lfs_filebd_createcfg()
22 (void*)(uintptr_t)cfg->read, (void*)(uintptr_t)cfg->prog, in lfs_filebd_createcfg()
23 (void*)(uintptr_t)cfg->erase, (void*)(uintptr_t)cfg->sync, in lfs_filebd_createcfg()
24 cfg->read_size, cfg->prog_size, cfg->block_size, cfg->block_count, in lfs_filebd_createcfg()
25 path, (void*)bdcfg, bdcfg->erase_value); in lfs_filebd_createcfg()
26 lfs_filebd_t *bd = cfg->context; in lfs_filebd_createcfg()
27 bd->cfg = bdcfg; in lfs_filebd_createcfg()
30 bd->fd = open(path, O_RDWR | O_CREAT, 0666); in lfs_filebd_createcfg()
31 if (bd->fd < 0) { in lfs_filebd_createcfg()
[all …]
Dlfs_rambd.c5 * SPDX-License-Identifier: BSD-3-Clause
16 (void*)cfg, cfg->context, in lfs_rambd_createcfg()
17 (void*)(uintptr_t)cfg->read, (void*)(uintptr_t)cfg->prog, in lfs_rambd_createcfg()
18 (void*)(uintptr_t)cfg->erase, (void*)(uintptr_t)cfg->sync, in lfs_rambd_createcfg()
19 cfg->read_size, cfg->prog_size, cfg->block_size, cfg->block_count, in lfs_rambd_createcfg()
20 (void*)bdcfg, bdcfg->erase_value, bdcfg->buffer); in lfs_rambd_createcfg()
21 lfs_rambd_t *bd = cfg->context; in lfs_rambd_createcfg()
22 bd->cfg = bdcfg; in lfs_rambd_createcfg()
25 if (bd->cfg->buffer) { in lfs_rambd_createcfg()
26 bd->buffer = bd->cfg->buffer; in lfs_rambd_createcfg()
[all …]
Dlfs_testbd.h6 * SPDX-License-Identifier: BSD-3-Clause
30 // some real-world circumstances such as progs not sticking (prog-noop),
31 // a readonly disk (erase-noop), and ECC failures (read-error).
33 // Not that read-noop is not allowed. Read _must_ return a consistent (but
49 // 8-bit erase value to use for simulating erases. -1 does not simulate
50 // erases, which can speed up testing by avoiding all the extra block-device
62 // the program with exit. Simulates power-loss. 0 disables.
Dlfs_filebd.h5 * SPDX-License-Identifier: BSD-3-Clause
28 // 8-bit erase value to use for simulating erases. -1 does not simulate
29 // erases, which can speed up testing by avoiding all the extra block-device
Dlfs_rambd.h5 * SPDX-License-Identifier: BSD-3-Clause
28 // 8-bit erase value to simulate erasing with. -1 indicates no erase
/littlefs-2.7.6/scripts/
Dtest.py27 ./scripts/explode_asserts.py $$< -o $$@
31 -include tests/*.d
35 $(CC) $(CFLAGS) $^ $(LFLAGS) -o $@
50 'LFS_BLOCK_CYCLES': -1,
217 print('truncate --size=0', disk)
223 # simulate power-loss after n cycles?
231 ncmd.extend(['-ex', 'r'])
233 ncmd.extend(['-ex', 'up 2'])
236 '-ex', 'b %s:%d' % (self.suite.path, self.code_lineno),
237 '-ex', 'r'])
[all …]
Dreadmdir.py123 mask = 0x7ff & ~((1 << prefix)-1)
128 type, prefix//4, self.type & ((1 << prefix)-1))
182 while len(block) - off >= 4:
240 return not ((other.rev - self.rev) & 0x80000000)
258 tag.id <= gtag.id - gdiff):
259 if tag.is_('create') and tag.id == gtag.id - gdiff:
266 (int(gmask) & int(gtag.chid(gtag.id - gdiff)))):
276 f.write("%-8s %-8s %-13s %4s %4s" % (
283 f.write("%08x: %08x %-13s %4s %4s" % (
287 f.write(" %-23s %-8s\n" % (
[all …]
Dreadtree.py35 blocks[id(data[-1])] = block
107 print("%-47s%s" % ("littlefs v%s.%s" % version,
130 ' -> {%#x, %#x}' % struct.unpack('<II', mdir.tail.data)
144 ' ' if j == len(dir)-1 else
145 'v' if k == len(lines)-1 else
177 parser.add_argument('-l', '--log', action='store_true',
179 parser.add_argument('-a', '--all', action='store_true',
181 parser.add_argument('-T', '--no-truncate', action='store_true',
Dprefix.py24 name, count3 = re.subn('\\B-D'+from_prefix.upper(),
25 '-D'+to_prefix.upper(), name)
34 'git', 'ls-tree', '-r', '--name-only', 'HEAD']).split()
56 '%s -> %s' % (oldname, newname) if namecount else oldname,
/littlefs-2.7.6/tests/
Dtest_alloc.toml3 if = 'LFS_BLOCK_CYCLES == -1'
7 define.SIZE = '(((LFS_BLOCK_SIZE-8)*(LFS_BLOCK_COUNT-6)) / FILES)'
50 define.SIZE = '(((LFS_BLOCK_SIZE-8)*(LFS_BLOCK_COUNT-6)) / FILES)'
89 define.SIZE = '(((LFS_BLOCK_SIZE-8)*(LFS_BLOCK_COUNT-6)) / FILES)'
144 define.SIZE = '(((LFS_BLOCK_SIZE-8)*(LFS_BLOCK_COUNT-6)) / FILES)'
230 define.SIZE = '(((LFS_BLOCK_SIZE-8)*(LFS_BLOCK_COUNT-4)) / 3)'
348 filesize -= 3*LFS_BLOCK_SIZE;
474 lfs_file_truncate(&lfs, &file, filesize - size) => 0;
505 i < (cfg.block_count-4)*(cfg.block_size-8);
544 i < ((cfg.block_count-2)/2)*(cfg.block_size-8);
[all …]
Dtest_files.toml34 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE-i);
49 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE-i);
73 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE1-i);
88 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE1-i);
103 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE2-i);
118 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE2-i);
130 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE1-i);
155 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE1-i);
170 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE1-i);
185 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE2-i);
[all …]
Dtest_evil.toml6 [[case]] # invalid tail-pointer test
14 // change tail-pointer to invalid pointers
123 [[case]] # invalid pointer in CTZ skip-list test
139 // change pointer in CTZ skip-list to be invalid
212 [[case]] # metadata-pair threaded-list loop test
218 // change tail-pointer to point to ourself
231 [[case]] # metadata-pair threaded-list 2-length loop test
250 // change tail-pointer to point to root
261 [[case]] # metadata-pair threaded-list 1-length child loop test
280 // change tail-pointer to point to ourself
Dtest_orphans.toml14 // to the linked-list entry, which should orphan the orphan. Note this
23 int off = LFS_BLOCK_SIZE-1;
25 off -= 1;
27 memset(&bbuffer[off-3], LFS_BLOCK_SIZE, 3);
61 # TODO fix this case, caused by non-DAG trees
104 assert(strcmp(info.name, &full_path[2*(DEPTH-1)+1]) == 0);
108 for (int d = DEPTH-1; d >= 0; d--) {
Dtest_relocations.toml12 while (LFS_BLOCK_COUNT - lfs_fs_size(&lfs) > 16) {
39 if (j == ITERATIONS-1) {
78 while (LFS_BLOCK_COUNT - lfs_fs_size(&lfs) > 16) {
150 # TODO fix this case, caused by non-DAG trees
193 assert(strcmp(info.name, &full_path[2*(DEPTH-1)+1]) == 0);
197 for (int d = DEPTH-1; d >= 0; d--) {
212 # TODO fix this case, caused by non-DAG trees
255 assert(strcmp(info.name, &full_path[2*(DEPTH-1)+1]) == 0);
293 for (int d = DEPTH-1; d >= 0; d--) {
Dtest_seek.toml27 lfs_soff_t pos = -1;
56 lfs_file_seek(&lfs, &file, -size, LFS_SEEK_CUR) => pos;
60 lfs_file_seek(&lfs, &file, -size, LFS_SEEK_END) >= 0 => 1;
96 lfs_soff_t pos = -1;
121 lfs_file_seek(&lfs, &file, -size, LFS_SEEK_END) >= 0 => 1;
229 lfs_file_seek(&lfs, &file, -((COUNT+SKIP)*size),
233 lfs_file_seek(&lfs, &file, -((COUNT+2*SKIP)*size),
279 if (i < SIZE-2) {
281 lfs_file_seek(&lfs, &file, -1, LFS_SEEK_CUR) => i;
308 [[case]] # file seek and write with power-loss
[all …]
Dtest_badblocks.toml2 if = 'LFS_BLOCK_CYCLES == -1'
7 define.LFS_ERASE_VALUE = [0x00, 0xff, -1]
19 lfs_testbd_setwear(&cfg, badblock-1, 0) => 0;
81 define.LFS_ERASE_VALUE = [0x00, 0xff, -1]
92 for (lfs_block_t i = 0; i < (LFS_BLOCK_COUNT-2)/2; i++) {
154 define.LFS_ERASE_VALUE = [0x00, 0xff, -1]
165 for (lfs_block_t i = 0; i < (LFS_BLOCK_COUNT-2)/2; i++) {
227 define.LFS_ERASE_VALUE = [0x00, 0xff, -1]

12