Searched full:case (Results 1 – 22 of 22) sorted by relevance
| /littlefs-2.7.6/scripts/ |
| D | test.py | 101 def __init__(self, case, returncode=None, stdout=None, assert_=None): argument
102 self.case = case
124 if any(k not in self.case.defines for k in self.defines):
128 if k not in self.case.defines))
140 ncase.case = self
159 f.write(4*' '+'// test case %d\n' % self.caseno)
162 # test case goes here
245 # run test case!
368 if re.match(r'\[\[\s*case\s*\]\]', line):
385 for i, (case, lineno) in enumerate(zip(config['case'], linenos)):
[all …]
|
| /littlefs-2.7.6/tests/ |
| D | test_superblocks.toml | 1 [[case]] # simple formatting test
6 [[case]] # mount/unmount
13 [[case]] # reentrant format
24 [[case]] # invalid mount
29 [[case]] # expanding superblock
57 [[case]] # expanding superblock with power cycle
90 [[case]] # reentrant expanding superblock
|
| D | test_paths.toml | 2 [[case]] # simple path test
24 [[case]] # redundant slashes
48 [[case]] # dot path test
74 [[case]] # dot dot path test
104 [[case]] # trailing dot path test
126 [[case]] # leading dot path test
138 [[case]] # root dot dot path test
162 [[case]] # invalid path tests
183 [[case]] # root operations
199 [[case]] # root representations
[all …]
|
| D | test_evil.toml | 6 [[case]] # invalid tail-pointer test
29 [[case]] # invalid dir pointer test
75 [[case]] # invalid file pointer test
123 [[case]] # invalid pointer in CTZ skip-list test
185 [[case]] # invalid gstate pointer
212 [[case]] # metadata-pair threaded-list loop test
231 [[case]] # metadata-pair threaded-list 2-length loop test
261 [[case]] # metadata-pair threaded-list 1-length child loop test
|
| D | test_alloc.toml | 5 [[case]] # parallel allocation test
48 [[case]] # serial allocation test
87 [[case]] # parallel allocation reuse test
142 [[case]] # serial allocation reuse test
193 [[case]] # exhaustion test
229 [[case]] # exhaustion wraparound test
277 [[case]] # dir exhaustion test
326 [[case]] # what if we have a bad block during an allocation scan?
414 [[case]] # chained dir exhaustion test
485 [[case]] # split dir test
[all …]
|
| D | test_files.toml | 2 [[case]] # simple file test
22 [[case]] # larger files
60 [[case]] # rewriting files
142 [[case]] # appending files
219 [[case]] # truncating files
288 [[case]] # reentrant file writing
336 [[case]] # reentrant file writing with syncs
406 [[case]] # many files
431 [[case]] # many files with power cycle
458 [[case]] # many files with power loss
|
| D | test_dirs.toml | 1 [[case]] # root
17 [[case]] # many directory creation
48 [[case]] # many directory removal
98 [[case]] # many directory rename
157 [[case]] # reentrant many directory creation/rename/removal
237 [[case]] # file creation
270 [[case]] # file removal
322 [[case]] # file rename
383 [[case]] # reentrant file creation/rename/removal
463 [[case]] # nested directories
[all …]
|
| D | test_relocations.toml | 2 [[case]] # dangling split dir test
68 [[case]] # outdated head test
146 [[case]] # reentrant testing for relocations, this is the same as the
150 # TODO fix this case, caused by non-DAG trees
210 [[case]] # reentrant testing for relocations, but now with random renames!
212 # TODO fix this case, caused by non-DAG trees
|
| D | test_badblocks.toml | 4 [[case]] # single bad blocks
78 [[case]] # region corruption (causes cascading failures)
151 [[case]] # alternating corruption (causes cascading failures)
225 [[case]] # bad superblocks (corrupt 1 or 0)
|
| D | test_orphans.toml | 1 [[case]] # orphan test
59 [[case]] # reentrant testing for orphans, basically just spam mkdir/remove
61 # TODO fix this case, caused by non-DAG trees
|
| D | test_seek.toml | 2 [[case]] # simple file seek
71 [[case]] # simple file seek and write
132 [[case]] # boundary seek and writes
186 [[case]] # out of bounds seek
241 [[case]] # inline write and seek
308 [[case]] # file seek and write with power-loss
|
| D | test_truncate.toml | 1 [[case]] # simple truncate
45 [[case]] # truncate and read
96 [[case]] # write, truncate, and read
148 [[case]] # truncate and write
199 [[case]] # truncate write under powerloss
265 [[case]] # more aggressive general truncation tests
|
| D | test_entries.toml | 8 [[case]] # entry grow test
97 [[case]] # entry shrink test
186 [[case]] # entry spill test
259 [[case]] # entry push spill test
348 [[case]] # entry push spill two test
452 [[case]] # entry drop test
550 [[case]] # create too big
575 [[case]] # resize too big
|
| D | test_interspersed.toml | 2 [[case]] # interspersed file test
62 [[case]] # interspersed remove file test
115 [[case]] # remove inconveniently test
175 [[case]] # reentrant interspersed file test
|
| D | test_exhaustion.toml | 1 [[case]] # test running a filesystem to exhaustion
85 [[case]] # test running a filesystem to exhaustion
172 [[case]] # wear-level test running a filesystem to exhaustion
264 [[case]] # wear-level test + expanding superblock
353 [[case]] # test that we wear blocks roughly evenly
|
| D | test_move.toml | 1 [[case]] # move file
58 [[case]] # noop move, yes this is legal
74 [[case]] # move file corrupt source
149 [[case]] # move file corrupt source and dest
241 [[case]] # move file after corrupt
338 [[case]] # simple reentrant move file
448 [[case]] # move dir
513 [[case]] # move dir corrupt source
596 [[case]] # move dir corrupt source and dest
696 [[case]] # move dir after corrupt
[all …]
|
| D | test_attrs.toml | 1 [[case]] # set/get attribute
79 [[case]] # set/get root attribute
156 [[case]] # set/get file attribute
263 [[case]] # deferred file attributes
|
| /littlefs-2.7.6/ |
| D | SPEC.md | 39 providing a backup during erase cycles in case power is lost. These two blocks
466 case, the file data is stored directly in the tag's data area.
645 In this case, the next metadata pair is not a part of our current directory
654 In this case, the next metadata pair belongs to the current directory. Note
699 In the case of moves, the move state contains a tag + metadata pair describing
706 In the case of operations to the threaded linked-list, a single "sync" bit is
|
| D | DESIGN.md | 138 SPIFFS is a very interesting case here, as it uses the fact that repeated
244 In the case of COW data structures, we can try twisting the definition a bit.
293 storage, in the worst case a small log costs 4x the size of the original data.
353 Error detection can be provided with a checksum, and in littlefs's case we
408 also call this specific case compaction.
545 entry has a worst case runtime complexity of _O(nm)_. For _updating_ a specific
546 entry, the worst case complexity is _O(nm²)_, with an amortized complexity
549 However, splitting at 50% capacity does mean that in the best case our
672 of _O(1)_, and can be read with a worst case runtime of _O(n log n)_. Given
983 Once we detect a bad block, we need to recover from it. In the case of write
[all …]
|
| D | lfs.c | 1031 // special case for root in lfs_dir_getinfo()
1365 // zero for reproducability in case initial block is unreadable in lfs_dir_alloc()
1467 // save some state in case block is bad in lfs_dir_compact()
1504 // we're too big for even the full block, in which case our in lfs_dir_compact()
3390 // special case for root in lfs_getattr()
3428 // special case for root in lfs_commitattr()
4448 // setup dir in case it's valid in lfs1_dir_fetch()
|
| D | .travis.yml | 354 case ${GEKY_BOT_DRAFT:-minor} in
|
| /littlefs-2.7.6/bd/ |
| D | lfs_filebd.c | 83 // zero for reproducability (in case file is truncated) in lfs_filebd_read()
|
