| /littlefs-3.7.0-3.6.0/scripts/ |
| D | structs.py | 299 sort=None, argument
327 names.sort()
329 names.sort(key=lambda n: tuple(
335 if sort:
336 for k, reverse in reversed(sort):
337 names.sort(
471 sort=None, argument
499 results.sort()
500 if sort:
501 for k, reverse in reversed(sort):
[all …]
|
| D | data.py | 351 sort=None, argument
379 names.sort()
381 names.sort(key=lambda n: tuple(
387 if sort:
388 for k, reverse in reversed(sort):
389 names.sort(
523 sort=None, argument
546 results.sort()
547 if sort:
548 for k, reverse in reversed(sort):
[all …]
|
| D | code.py | 351 sort=None, argument
379 names.sort()
381 names.sort(key=lambda n: tuple(
387 if sort:
388 for k, reverse in reversed(sort):
389 names.sort(
523 sort=None, argument
549 results.sort()
550 if sort:
551 for k, reverse in reversed(sort):
[all …]
|
| D | stack.py | 314 sort=None, argument
344 names.sort()
346 names.sort(key=lambda n: tuple(
352 if sort:
353 for k, reverse in reversed(sort):
354 names.sort(
541 sort=None, argument
574 results.sort()
575 if sort:
576 for k, reverse in reversed(sort):
[all …]
|
| D | perf.py | 299 sym_at.sort(key=lambda x: (x[0], -x[2], x[1]))
369 lines.sort()
377 line_at.sort()
677 sort=None, argument
706 names.sort()
708 names.sort(key=lambda n: tuple(
714 if sort:
715 for k, reverse in reversed(sort):
716 names.sort(
859 names_.sort()
[all …]
|
| D | perfbd.py | 207 sym_at.sort(key=lambda x: (x[0], -x[2], x[1]))
277 lines.sort()
285 line_at.sort()
643 sort=None, argument
672 names.sort()
674 names.sort(key=lambda n: tuple(
680 if sort:
681 for k, reverse in reversed(sort):
682 names.sort(
825 names_.sort()
[all …]
|
| D | summary.py | 385 sort=None, argument
413 names.sort()
415 names.sort(key=lambda n: tuple(
421 if sort:
422 for k, reverse in reversed(sort):
423 names.sort(
567 sort=None, argument
654 results.sort()
655 if sort:
656 for k, reverse in reversed(sort):
[all …]
|
| D | cov.py | 338 sort=None, argument
366 names.sort()
368 names.sort(key=lambda n: tuple(
374 if sort:
375 for k, reverse in reversed(sort):
376 names.sort(
585 sort=None, argument
622 results.sort()
623 if sort:
624 for k, reverse in reversed(sort):
[all …]
|
| D | bench.py | 172 case_linenos.sort()
241 suites.sort(key=lambda s: s.name)
|
| D | test.py | 175 case_linenos.sort()
249 suites.sort(key=lambda s: s.name)
|
| /littlefs-3.7.0-3.6.0/ |
| D | DESIGN.md | 173 This sort of filesystem takes the best from both worlds. Performance can be
248 wear. This sort of copy-on-bounded-writes (CObW) still focuses wear, but at
411 simple. We want to avoid RAM consumption, so we use a sort of brute force
851 Normally, block allocation involves some sort of free list or bitmap stored on
1480 complications we need to sort out.
1813 If we only had some sort of global state, then we could also store a flag and
|
| D | README.md | 142 In littlefs, these ingredients form a sort of two-layered cake, with the small
|
| /littlefs-3.7.0-3.6.0/tests/ |
| D | test_exhaustion.toml | 183 # These are a sort of high-level litmus test for wear-leveling. One definition
|
