| /littlefs-latest/scripts/ |
| D | structs.py | 277 if all(getattr(r, k) in vs for k, vs in defines):
301 all=False, argument
304 all_, all = all, __builtins__.all
|
| D | data.py | 329 if all(getattr(r, k) in vs for k, vs in defines):
353 all=False, argument
356 all_, all = all, __builtins__.all
|
| D | code.py | 329 if all(getattr(r, k) in vs for k, vs in defines):
353 all=False, argument
356 all_, all = all, __builtins__.all
|
| D | stack.py | 292 if all(getattr(r, k) in vs for k, vs in defines):
316 all=False, argument
321 all_, all = all, __builtins__.all
|
| D | summary.py | 363 if all(getattr(r, k) in vs for k, vs in defines):
387 all=False, argument
390 all_, all = all, __builtins__.all
|
| D | cov.py | 316 if all(getattr(r, k) in vs for k, vs in defines):
340 all=False, argument
343 all_, all = all, __builtins__.all
|
| D | readtree.py | 109 if not any([args.no_truncate, args.log, args.all]) else ""))
136 elif args.all:
|
| D | perf.py | 646 if all(getattr(r, k) in vs for k, vs in defines):
679 all=False, argument
683 all_, all = all, __builtins__.all
|
| D | perfbd.py | 612 if all(getattr(r, k) in vs for k, vs in defines):
645 all=False, argument
649 all_, all = all, __builtins__.all
|
| D | plotmpl.py | 221 if not all(k in r and r[k] in vs for k, vs in define):
258 if all(k in r and r[k] in vs for k, vs in define):
|
| D | readmdir.py | 371 if args.all:
|
| D | plot.py | 475 if not all(k in r and r[k] in vs for k, vs in define):
512 if all(k in r and r[k] in vs for k, vs in define):
|
| D | bench.py | 731 if all(k in self.head or k in self.tail for k in row.keys()):
|
| D | test.py | 748 if all(k in self.head or k in self.tail for k in row.keys()):
|
| /littlefs-latest/ |
| D | README.md | 128 code of these functions, instead all data is read back and checked for
132 flushes all the data to memory and ensures that the next read fetches the data
189 - [SPEC.md](SPEC.md) - The on-disk specification of littlefs with all the
|
| D | DESIGN.md | 62 where possible. For RAM we have a stronger requirement, all RAM usage is
186 but instead of updating block inplace, all updates are performed by creating
188 our new block. This recursively pushes all of our problems upwards until we
419 write all of these changes to the second block without worrying about power
717 complicated. We can start with a summation that loops through all of the blocks
748 quick script that verified this property for all 32-bit integers.
843 But now we need to look at the [elephant] in the room. Where do all these
963 Wear leveling is the process of distributing wear across all blocks in the
984 errors, we have a copy of the corrupted data in RAM, so all we need to do is
1174 that means that all blocks in our storage are bad, and we've reached the end of
[all …]
|
| D | Makefile | 173 .PHONY: all build
174 all build: $(TARGET) target
|
| D | SPEC.md | 31 - By default, all values in littlefs are stored in little-endian byte order.
457 Any type of struct supersedes all other structs associated with the id. For
621 containing all metadata pairs. The chunk field contains the type of the tail,
792 all metadata since the previous CRC tag, including the CRC tag itself. For
|
| /littlefs-latest/tests/ |
| D | test_bd.toml | 1 # These tests don't really test littlefs at all, they are here only to make
|
| D | test_seek.toml | 522 // seek and write using quadratic probing to touch all
|
| D | test_alloc.toml | 447 // now fill all but a couple of blocks of the filesystem with data
|
