| /littlefs-latest/scripts/ |
| D | stack.py | 187 _, _, _, targets = callgraph[info['title']]
192 _, _, _, targets = callgraph[info['sourcename']]
246 _, _, frame, targets = callgraph[source]
262 t_file, t_function, _, _ = callgraph[target]
279 **_): argument
283 for k in it.chain(by or [], (k for k, _ in defines or [])):
320 **_): argument
|
| D | perf.py | 504 for s, (a_, _) in syms_[dso].items()
505 for a, _ in syms[s])
511 delta, _ = min(deltas[dso].items(),
526 _, file, line = line_at[i-1]
633 **_): argument
637 for k in it.chain(by or [], (k for k, _ in defines or [])):
682 **_): argument
976 if not annotate and not any(i+1 in s for s, _ in spans):
986 next(iter(f for _, f in spans)),
1150 argparse.ArgumentParser._handle_conflict_ignore = lambda *_: None
[all …]
|
| D | summary.py | 248 **_): argument
278 and not any(k == old_k for _, old_k in renames))
350 **_): argument
354 for k in it.chain(by or [], (k for k, _ in defines or [])):
389 **_): argument
574 by = [k for k, _ in by]
576 fields = [k for k, _ in fields]
|
| D | plotmpl.py | 172 x, _ = x.split('/', 1)
731 by = [k for k, _ in by]
733 x = [k for k, _ in x]
735 y = [k for k, _ in y]
821 ax.plot([x for x,_ in dats], [y for _,y in dats],
849 for _, v in r.items()
854 for _, v in r.items()
|
| D | perfbd.py | 473 _, sym, _ = sym_at[i-1]
489 _, file, line = line_at[i-1]
599 **_): argument
603 for k in it.chain(by or [], (k for k, _ in defines or [])):
648 **_): argument
961 if not annotate and not any(i+1 in s for s, _ in spans):
971 next(iter(f for _, f in spans)),
|
| D | test.py | 178 for (lineno, name), (nlineno, _) in it.zip_longest(
742 def __exit__(self, *_): argument
907 case, _ = failure.id.split(':', 1)
1010 (_,
1175 sum(1 for _ in re.finditer('[0-9a-f]',
1187 sum(1 for _ in re.finditer('[0-9a-f]',
1244 argparse.ArgumentParser._handle_conflict_ignore = lambda *_: None
1245 argparse._ArgumentGroup._handle_conflict_ignore = lambda *_: None
|
| D | cov.py | 303 **_): argument
307 for k in it.chain(by or [], (k for k, _ in defines or [])):
342 **_): argument
546 if not annotate and not any(i+1 in s for s, _ in spans):
556 next(iter(f for _, f in spans)),
|
| D | data.py | 279 _, file = max(
316 **_): argument
320 for k in it.chain(by or [], (k for k, _ in defines or [])):
355 **_): argument
|
| D | code.py | 279 _, file = max(
316 **_): argument
320 for k in it.chain(by or [], (k for k, _ in defines or [])):
355 **_): argument
|
| D | tracebd.py | 142 for _ in range(w):
149 for _ in range(h):
256 **_): argument
279 **_): argument
352 self.blocks = [Block() for _ in range(width*height)]
|
| D | bench.py | 175 for (lineno, name), (nlineno, _) in it.zip_longest(
725 def __exit__(self, *_): argument
902 case, _ = failure.id.split(':', 1)
1004 (_,
1209 argparse.ArgumentParser._handle_conflict_ignore = lambda *_: None
1210 argparse._ArgumentGroup._handle_conflict_ignore = lambda *_: None
|
| D | plot.py | 158 for dir, _, files in os.walk(path):
241 x, _ = x.split('/', 1)
889 by = [k for k, _ in by]
891 x = [k for k, _ in x]
893 y = [k for k, _ in y]
1140 for _, v in r.items()
1145 for _, v in r.items()
|
| D | structs.py | 264 **_): argument
268 for k in it.chain(by or [], (k for k, _ in defines or [])):
303 **_): argument
|
| D | watch.py | 58 for dir, _, files in os.walk(path):
|
| /littlefs-latest/ |
| D | DESIGN.md | 135 1. _O(n²)_ runtime
136 2. _O(n)_ RAM
238 Consider logging. It has either a _O(n²)_ runtime or _O(n)_ RAM cost. We
242 complexity is _O(1)_ by bounding the input.
494 one time cost (_O(n²)_ for littlefs), but also depends on how often
538 giving us an amortized runtime complexity of _O(1)_.
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
547 of only _O(nm)_.
613 over a file _in order_ has a runtime cost of _O(n²)_. A quadratic runtime
[all …]
|
| D | SPEC.md | 540 2‍_ˣ_, that block contains a pointer to block _n_-2‍_ˣ_.
|
| D | README.md | 271 _O(|address|)_ pointer structure stored on each block and in RAM.
|
