Searched refs:case (Results 1 – 7 of 7) sorted by relevance
| /littlefs-3.7.0-3.6.0/scripts/ |
| D | bench.py | 199 for name, case in sorted(cases.items(),
203 'path': path + (':%d' % case['lineno']
204 if 'lineno' in case else ''),
208 **case},
213 set(case.defines) for case in self.cases))
257 for case in suite.cases:
259 if case.name in seen and not (
260 isinstance(seen[case.name], BenchSuite)
261 and seen[case.name].cases == [case]):
265 case.name,
[all …]
|
| D | test.py | 203 for name, case in sorted(cases.items(),
207 'path': path + (':%d' % case['lineno']
208 if 'lineno' in case else ''),
213 **case},
218 set(case.defines) for case in self.cases))
221 self.reentrant = any(case.reentrant for case in self.cases)
265 for case in suite.cases:
267 if case.name in seen and not (
268 isinstance(seen[case.name], TestSuite)
269 and seen[case.name].cases == [case]):
[all …]
|
| /littlefs-3.7.0-3.6.0/ |
| D | SPEC.md | 39 providing a backup during erase cycles in case power is lost. These two blocks
507 case, the file data is stored directly in the tag's data area.
686 In this case, the next metadata pair is not a part of our current directory
695 In this case, the next metadata pair belongs to the current directory. Note
740 In the case of moves, the move state contains a tag + metadata pair describing
747 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 …]
|
| /littlefs-3.7.0-3.6.0/tests/ |
| D | test_relocations.toml | 173 # TODO fix this case, caused by non-DAG trees
242 # TODO fix this case, caused by non-DAG trees
|
| D | test_orphans.toml | 209 # TODO fix this case, caused by non-DAG trees
|
| D | test_move.toml | 1656 // the worst case is if we need to relocate and we need to implicit
|
