Searched refs:m (Results 1 – 17 of 17) sorted by relevance
/littlefs-3.5.0-3.4.0/scripts/ |
D | stack.py | 13 import math as m namespace 27 m = k_pattern.match(rest) 28 if not m: 30 k, rest = m.group(1), rest[m.end(0):] 39 m = v_pattern.match(rest) 40 assert m, "unexpected %r" % rest[0:1] 41 v, rest = m.group(1) or m.group(2), rest[m.end(0):] 61 m = f_pattern.match(info['label']) 62 if m: 63 function, file, size, type = m.groups() [all …]
|
D | explode_asserts.py | 211 m = p.search(data) 212 if m: 213 if m.start() > 0: 214 tokens.append((None, data[:m.start()])) 215 tokens.append((m.lastgroup, m.group())) 216 data = data[m.end():] 227 self.m = token[1] 228 return self.m 229 self.m = None 230 return self.m [all …]
|
D | structs.py | 45 m = decl_pattern.match(line) 46 if m: 47 decls[int(m.group('no'))] = m.group('file') 72 m = struct_pattern.match(line) 73 if m: 74 if m.group('tag'): 80 found = (m.group('tag') == 'structure_type') 84 elif found and m.group('name'): 85 name = m.group('name') 86 elif found and name and m.group('decl'): [all …]
|
D | coverage.py | 26 m = pattern.match(line) 27 if m and m.group('file'): 28 file = m.group('file_name') 29 elif m and file and m.group('func'): 30 funcs.append((file, int(m.group('func_lineno')), 31 m.group('func_name'))) 32 elif m and file and m.group('line'): 33 lines[(file, int(m.group('line_lineno')))] += ( 34 int(m.group('line_hits')))
|
D | test.py | 301 m = re.match( 305 if m and assert_ is None: 307 with open(m.group(1)) as f: 308 lineno = int(m.group(2)) 312 'path': m.group(1), 315 'message': m.group(3)} 676 list(it.chain.from_iterable(['-f', m] for m in makefiles)) + 698 m = re.match( 702 if m and not args.get('verbose'): 704 with open(m.group(1)) as f: [all …]
|
D | summary.py | 11 import math as m namespace 38 lambda r: '∞' if m.isinf(r) else int(r), 206 0.0 if m.isinf(o or 0) and m.isinf(n or 0) 207 else +float('inf') if m.isinf(n or 0) 208 else -float('inf') if m.isinf(o or 0) 215 else '(+∞%)' if ratio > 0 and m.isinf(ratio) 216 else '(-∞%)' if ratio < 0 and m.isinf(ratio)
|
D | readtree.py | 21 for m in it.chain((m for d in dirs for m in d), mdirs): 22 if set(m.blocks) == set(tail): 24 cycle = m.blocks
|
D | data.py | 37 m = pattern.match(line) 38 if m: 39 results[(path, m.group('func'))] += int(m.group('size'), 16)
|
D | code.py | 37 m = pattern.match(line) 38 if m: 39 results[(path, m.group('func'))] += int(m.group('size'), 16)
|
D | readmdir.py | 334 ' (was %s)' % ', '.join('%d' % m.rev for m in mdir.pair[1:])
|
/littlefs-3.5.0-3.4.0/ |
D | lfs.c | 2144 if (lfs_pair_cmp(d->m.pair, oldpair) == 0) { in lfs_dir_relocatingcommit() 2145 d->m = *dir; in lfs_dir_relocatingcommit() 2146 if (d->m.pair != pair) { in lfs_dir_relocatingcommit() 2150 d->m.pair[0] = LFS_BLOCK_NULL; in lfs_dir_relocatingcommit() 2151 d->m.pair[1] = LFS_BLOCK_NULL; in lfs_dir_relocatingcommit() 2168 while (d->id >= d->m.count && d->m.split) { in lfs_dir_relocatingcommit() 2170 d->id -= d->m.count; in lfs_dir_relocatingcommit() 2171 int err = lfs_dir_fetch(lfs, &d->m, d->m.tail); in lfs_dir_relocatingcommit() 2189 if (dir != &f->m && lfs_pair_cmp(f->m.pair, dir->pair) == 0 && in lfs_dir_orphaningcommit() 2263 if (lfs_pair_cmp(lpair, d->m.pair) == 0) { in lfs_dir_orphaningcommit() [all …]
|
D | lfs.h | 345 lfs_mdir_t m; member 356 lfs_mdir_t m; member 396 lfs_mdir_t m; member
|
D | README.md | 221 - [littlefs-js] - A javascript wrapper for littlefs. I'm not sure why you would
|
D | DESIGN.md | 2162 [m]: https://latex.codecogs.com/svg.latex?m
|
/littlefs-3.5.0-3.4.0/tests/ |
D | test_move.toml | 97 lfs_block_t block = dir.m.pair[0]; 173 lfs_block_t block = dir.m.pair[0]; 190 block = dir.m.pair[0]; 265 lfs_block_t block = dir.m.pair[0]; 282 block = dir.m.pair[0]; 535 lfs_block_t block = dir.m.pair[0]; 619 lfs_block_t block = dir.m.pair[0]; 636 block = dir.m.pair[0]; 719 lfs_block_t block = dir.m.pair[0]; 736 block = dir.m.pair[0]; [all …]
|
D | test_orphans.toml | 18 lfs_block_t block = dir.m.pair[0];
|
D | test_entries.toml | 555 memset(path, 'm', 200); 580 memset(path, 'm', 200);
|