Home
last modified time | relevance | path

Searched refs:name (Results 1 – 23 of 23) sorted by relevance

/littlefs-3.5.0-3.4.0/scripts/
Dsummary.py78 name = result.pop('name', '')
79 prev = results[(file, name)]
83 if field.name in prev:
84 results[(file, name)][field.name] = field.acc(
85 [prev[field.name], r])
87 results[(file, name)][field.name] = r
97 fields_dict = {field.name: field for field in FIELDS}
102 if any(field.name in result for result in results.values()):
109 if field.name in result and field.name in total:
110 total[field.name] = field.acc(
[all …]
Dstructs.py57 name = None
75 if (name is not None
79 results[(decl, name)] = size
81 name = None
85 name = m.group('name')
86 elif found and name and m.group('decl'):
88 elif found and name and m.group('size'):
213 for name, new in news.items():
214 diff[name] = (0, new, new, 1.0)
215 for name, old in olds.items():
[all …]
Dstack.py231 for name, (new_frame, new_limit, deps) in news.items():
232 diff[name] = (
238 for name, (old_frame, old_limit, _) in olds.items():
239 _, _, new_frame, new_limit, _, _, _, deps = diff[name]
240 diff[name] = (
285 def print_entry(name, frame, limit): argument
286 print("%-36s %7d %7s" % (name,
289 def print_diff_entry(name, argument
294 print('%-36s %7s %7s %7s %7s %+7d %7s%s' % (name,
316 filtered_entries = [(name, entry)
[all …]
Dprefix.py21 def subn(from_prefix, to_prefix, name): argument
22 name, count1 = re.subn('\\b'+from_prefix, to_prefix, name)
23 name, count2 = re.subn('\\b'+from_prefix.upper(), to_prefix.upper(), name)
24 name, count3 = re.subn('\\B-D'+from_prefix.upper(),
25 '-D'+to_prefix.upper(), name)
26 return name, count1+count2+count3
Ddata.py161 for name, new in news.items():
162 diff[name] = (0, new, new, 1.0)
163 for name, old in olds.items():
164 _, new, _, _ = diff[name]
165 diff[name] = (old, new, new-old, (new-old)/old if old else 1.0)
190 def print_entry(name, size): argument
191 print("%-36s %7d" % (name, size))
193 def print_diff_entry(name, old, new, diff, ratio): argument
194 print("%-36s %7s %7s %+7d%s" % (name,
205 for name, size in sorted_entries(entries.items()):
[all …]
Dcode.py162 for name, new in news.items():
163 diff[name] = (0, new, new, 1.0)
164 for name, old in olds.items():
165 _, new, _, _ = diff[name]
166 diff[name] = (old, new, new-old, (new-old)/old if old else 1.0)
191 def print_entry(name, size): argument
192 print("%-36s %7d" % (name, size))
194 def print_diff_entry(name, old, new, diff, ratio): argument
195 print("%-36s %7s %7s %+7d%s" % (name,
206 for name, size in sorted_entries(entries.items()):
[all …]
Dcoverage.py173 for name, (new_hits, new_count) in news.items():
174 diff[name] = (
179 for name, (old_hits, old_count) in olds.items():
180 _, _, new_hits, new_count, _, _, _ = diff[name]
181 diff[name] = (
211 def print_entry(name, hits, count): argument
212 print("%-36s %11s %7s" % (name,
218 def print_diff_entry(name, argument
223 print("%-36s %11s %7s %11s %7s %11s%s" % (name,
240 for name, (hits, count) in sorted_entries(entries.items()):
[all …]
Dtest.py159 self.suite.name, self.caseno, self.permno, ', '.join(
164 self.suite.name, self.caseno, self.permno)
167 self.suite.name, self.caseno)
386 self.name = os.path.basename(path)
387 if self.name.endswith('.toml'):
388 self.name = self.name[:-len('.toml')]
439 return self.name
442 return self.name < other.name
595 sys.stdout.write(self.name + ' ')
822 directory of tests, a specific file, a suite by name, and even \
/littlefs-3.5.0-3.4.0/tests/
Dtest_dirs.toml8 assert(strcmp(info.name, ".") == 0);
11 assert(strcmp(info.name, "..") == 0);
33 assert(strcmp(info.name, ".") == 0);
36 assert(strcmp(info.name, "..") == 0);
41 assert(strcmp(info.name, path) == 0);
64 assert(strcmp(info.name, ".") == 0);
67 assert(strcmp(info.name, "..") == 0);
72 assert(strcmp(info.name, path) == 0);
89 assert(strcmp(info.name, ".") == 0);
92 assert(strcmp(info.name, "..") == 0);
[all …]
Dtest_paths.toml12 assert(strcmp(info.name, "hottea") == 0);
14 assert(strcmp(info.name, "hottea") == 0);
18 assert(strcmp(info.name, "milk") == 0);
20 assert(strcmp(info.name, "milk") == 0);
34 assert(strcmp(info.name, "hottea") == 0);
36 assert(strcmp(info.name, "hottea") == 0);
38 assert(strcmp(info.name, "hottea") == 0);
42 assert(strcmp(info.name, "milk") == 0);
44 assert(strcmp(info.name, "milk") == 0);
58 assert(strcmp(info.name, "hottea") == 0);
[all …]
Dtest_move.toml23 assert(strcmp(info.name, ".") == 0);
26 assert(strcmp(info.name, "..") == 0);
32 assert(strcmp(info.name, ".") == 0);
35 assert(strcmp(info.name, "..") == 0);
38 assert(strcmp(info.name, "hello") == 0);
69 assert(strcmp(info.name, "hi") == 0);
114 assert(strcmp(info.name, ".") == 0);
117 assert(strcmp(info.name, "..") == 0);
123 assert(strcmp(info.name, ".") == 0);
126 assert(strcmp(info.name, "..") == 0);
[all …]
Dtest_interspersed.toml28 assert(strcmp(info.name, ".") == 0);
31 assert(strcmp(info.name, "..") == 0);
36 assert(strcmp(info.name, path) == 0);
93 assert(strcmp(info.name, ".") == 0);
96 assert(strcmp(info.name, "..") == 0);
99 assert(strcmp(info.name, "zzz") == 0);
145 assert(strcmp(info.name, ".") == 0);
148 assert(strcmp(info.name, "..") == 0);
151 assert(strcmp(info.name, "e") == 0);
155 assert(strcmp(info.name, "g") == 0);
[all …]
Dtest_superblocks.toml40 assert(strcmp(info.name, "dummy") == 0);
52 assert(strcmp(info.name, "dummy") == 0);
68 assert(strcmp(info.name, "dummy") == 0);
77 assert(strcmp(info.name, "dummy") == 0);
85 assert(strcmp(info.name, "dummy") == 0);
106 assert(strcmp(info.name, "dummy") == 0);
115 assert(strcmp(info.name, "dummy") == 0);
124 assert(strcmp(info.name, "dummy") == 0);
Dtest_relocations.toml34 strcmp(info.name, path) => 0;
57 strcmp(info.name, path) => 0;
100 strcmp(info.name, path) => 0;
116 strcmp(info.name, path) => 0;
132 strcmp(info.name, path) => 0;
188 assert(strcmp(info.name, &path[2*d+1]) == 0);
193 assert(strcmp(info.name, &full_path[2*(DEPTH-1)+1]) == 0);
251 assert(strcmp(info.name, &path[2*d+1]) == 0);
255 assert(strcmp(info.name, &full_path[2*(DEPTH-1)+1]) == 0);
285 assert(strcmp(info.name, &path[2*d+1]) == 0);
Dtest_exhaustion.toml23 // chose name, roughly random seed, and random 2^n size
105 // chose name, roughly random seed, and random 2^n size
196 // chose name, roughly random seed, and random 2^n size
285 // chose name, roughly random seed, and random 2^n size
370 // chose name, roughly random seed, and random 2^n size
Dtest_orphans.toml99 assert(strcmp(info.name, &path[2*d+1]) == 0);
104 assert(strcmp(info.name, &full_path[2*(DEPTH-1)+1]) == 0);
Dtest_evil.toml62 assert(strcmp(info.name, "dir_here") == 0);
108 assert(strcmp(info.name, "file_here") == 0);
169 assert(strcmp(info.name, "file_here") == 0);
/littlefs-3.5.0-3.4.0/
DSPEC.md38 As their name suggests, a metadata pair is stored in two blocks, with one block
276 Associates the id with a file name and file type.
278 The data contains the file name stored as an ASCII string (may be expanded to
284 Currently, the name tag must precede any other tags associated with the id and
287 Layout of the name tag:
293 ^ ^ ^ ^ ^- size ^- file name
304 2. **file name** - File name stored as an ASCII string.
309 Initializes the id + name as a regular file.
316 Initializes the id + name as a directory.
330 The name is a bit of a misnomer. While the superblock entry serves the same
[all …]
Dlfs.c1269 strcpy(info->name, "/"); in lfs_dir_getinfo()
1275 LFS_MKTAG(LFS_TYPE_NAME, id, lfs->name_max+1), info->name); in lfs_dir_getinfo()
1301 const void *name; member
1307 struct lfs_dir_find_match *name = data; in lfs_dir_find_match() local
1308 lfs_t *lfs = name->lfs; in lfs_dir_find_match()
1312 lfs_size_t diff = lfs_min(name->size, lfs_tag_size(tag)); in lfs_dir_find_match()
1315 disk->block, disk->off, name->name, diff); in lfs_dir_find_match()
1321 if (name->size != lfs_tag_size(tag)) { in lfs_dir_find_match()
1322 return (name->size < lfs_tag_size(tag)) ? LFS_CMP_LT : LFS_CMP_GT; in lfs_dir_find_match()
1332 const char *name = *path; in lfs_dir_find() local
[all …]
DLICENSE.md12 - Neither the name of ARM nor the names of its contributors may be used to
DMakefile93 $(CTAGS) --totals --c-types=+p $(shell find -H -name '*.h') $(SRC)
Dlfs.h280 char name[LFS_NAME_MAX+1]; member
DDESIGN.md35 requires an expensive and destructive operation which gives flash its name.
628 The name comes from heavy use of the [CTZ instruction][wikipedia-ctz], which
1241 algorithm. Despite the long name, this is actually a simplification of dynamic
1394 || A name |
1397 || B name | | +- metadata
1440 || A name |
1443 || B name | | +- data