| /littlefs-3.7.0-3.6.0/scripts/ |
| D | prettyasserts.py | 210 p = '|'.join('(?P<%s>%s)' % (n, '|'.join(l))
212 p = re.compile(p, re.DOTALL)
218 m = p.search(data)
257 def p_assert(p): argument
258 state = p.push()
262 p.expect('assert') ; p.accept('ws')
263 p.expect('(') ; p.accept('ws')
264 p.expect('memcmp') ; p.accept('ws')
265 p.expect('(') ; p.accept('ws')
266 lh = p_expr(p) ; p.accept('ws')
[all …]
|
| D | watch.py | 202 for p in command:
203 for p in {
204 p,
205 re.sub('^-.', '', p),
206 re.sub('^--[^=]+=', '', p)}:
207 if p and os.path.exists(p):
208 paths.add(p)
|
| D | teepipe.py | 29 out_pipes = [openio(p, 'wb', 0) for p in out_paths]
41 for p in out_pipes:
43 p.write(buf)
|
| D | plotmpl.py | 101 p = 3*int(m.log(abs(x), 10**3))
102 p = min(18, max(-18, p))
104 s = '%.3f' % (abs(x) / (10.0**p))
110 return '%s%s%s' % ('-' if x < 0 else '', s, SI_PREFIXES[p])
117 p = 10*int(m.log(abs(x), 2**10))
118 p = min(30, max(-30, p))
120 s = '%.3f' % (abs(x) / (2.0**p))
126 return '%s%s%s' % ('-' if x < 0 else '', s, SI2_PREFIXES[p])
|
| D | plot.py | 98 p = 3*int(m.log(abs(x)*10, 10**3))
99 p = min(18, max(-18, p))
101 s = '%.*f' % (w, abs(x) / (10.0**p))
108 return '%s%s%s' % ('-' if x < 0 else '', s, SI_PREFIXES[p])
117 p = 10*int(m.log(abs(x)*10, 2**10))
118 p = min(30, max(-30, p))
120 s = '%.*f' % (w, abs(x) / (2.0**p))
127 return '%s%s%s' % ('-' if x < 0 else '', s, SI2_PREFIXES[p])
|
| D | perfbd.py | 380 r, p, e, children = results_[name]
382 r, p, e, children = 0, 0, 0, {}
385 p+last_proged,
533 for name, (r, p, e, children) in results.items():
535 r, p, e,
576 with mp.Pool(jobs) as p:
577 for results_ in p.imap_unordered(
|
| D | readtree.py | 38 mdir.blocks = tuple(blocks[id(p.data)] for p in mdir.pair)
|
| D | perf.py | 617 with mp.Pool(jobs) as p:
618 for results_ in p.imap_unordered(
|
| /littlefs-3.7.0-3.6.0/ |
| D | lfs_util.h | 229 static inline void lfs_free(void *p) { in lfs_free() argument
231 free(p); in lfs_free()
233 (void)p; in lfs_free()
|
| D | lfs.c | 501 for (struct lfs_mlist **p = &head; *p; p = &(*p)->next) { in lfs_mlist_isopen() local
502 if (*p == (struct lfs_mlist*)node) { in lfs_mlist_isopen()
513 for (struct lfs_mlist **p = &lfs->mlist; *p; p = &(*p)->next) { in lfs_mlist_remove() local
514 if (*p == mlist) { in lfs_mlist_remove()
515 *p = (*p)->next; in lfs_mlist_remove()
602 static int lfs_alloc_lookahead(void *p, lfs_block_t block) { in lfs_alloc_lookahead() argument
603 lfs_t *lfs = (lfs_t*)p; in lfs_alloc_lookahead()
822 static int lfs_dir_traverse_filter(void *p, in lfs_dir_traverse_filter() argument
824 lfs_tag_t *filtertag = p; in lfs_dir_traverse_filter()
1869 static int lfs_dir_commit_size(void *p, lfs_tag_t tag, const void *buffer) { in lfs_dir_commit_size() argument
[all …]
|
| /littlefs-3.7.0-3.6.0/runners/ |
| D | test_runner.c | 29 void *mappend(void **p, in mappend() argument
33 uint8_t *p_ = *p; in mappend()
47 *p = p_; in mappend()
364 size_t p = 1; in test_define_suite() local
378 test_overrides[i].defines[(j/p) in test_define_suite()
383 p *= test_overrides[i].permutations; in test_define_suite()
708 for (size_t p = 0; p < test_powerloss_count; p++) { in case_forperm() local
710 if (test_powerlosses[p].run != run_powerloss_none in case_forperm()
715 cb(data, suite, case_, &test_powerlosses[p]); in case_forperm()
750 for (size_t p = 0; p < test_powerloss_count; p++) { in case_forperm() local
[all …]
|
| D | bench_runner.c | 29 void *mappend(void **p, in mappend() argument
33 uint8_t *p_ = *p; in mappend()
47 *p = p_; in mappend()
351 size_t p = 1; in bench_define_suite() local
365 bench_overrides[i].defines[(j/p) in bench_define_suite()
370 p *= bench_overrides[i].permutations; in bench_define_suite()
|
