Home
last modified time | relevance | path

Searched refs:x (Results 1 – 13 of 13) sorted by relevance

/littlefs-3.5.0-3.4.0/scripts/
Dstack.py257 return sorted(entries, key=lambda x: (-x[1][1], x))
259 return sorted(entries, key=lambda x: (+x[1][1], x))
261 return sorted(entries, key=lambda x: (-x[1][0], x))
263 return sorted(entries, key=lambda x: (+x[1][0], x))
269 return sorted(entries, key=lambda x: (-(x[1][3] or 0), x))
271 return sorted(entries, key=lambda x: (+(x[1][3] or 0), x))
273 return sorted(entries, key=lambda x: (-(x[1][2] or 0), x))
275 return sorted(entries, key=lambda x: (+(x[1][2] or 0), x))
277 return sorted(entries, key=lambda x: (-x[1][6], x))
349 lambda x: x[1][6] or args.get('all'),
[all …]
Dcoverage.py191 return sorted(entries, key=lambda x: (-(x[1][0]/x[1][1] if x[1][1] else -1), x))
193 return sorted(entries, key=lambda x: (+(x[1][0]/x[1][1] if x[1][1] else -1), x))
199 return sorted(entries, key=lambda x: (-(x[1][2]/x[1][3] if x[1][3] else -1), x))
201 return sorted(entries, key=lambda x: (+(x[1][2]/x[1][3] if x[1][3] else -1), x))
203 return sorted(entries, key=lambda x: (-x[1][6], x))
Ddata.py170 return sorted(entries, key=lambda x: (-x[1], x))
172 return sorted(entries, key=lambda x: (+x[1], x))
178 return sorted(entries, key=lambda x: (-x[1][1], x))
180 return sorted(entries, key=lambda x: (+x[1][1], x))
182 return sorted(entries, key=lambda x: (-x[1][3], x))
278 parser.add_argument('--nm-tool', default=['nm'], type=lambda x: x.split(),
Dcode.py171 return sorted(entries, key=lambda x: (-x[1], x))
173 return sorted(entries, key=lambda x: (+x[1], x))
179 return sorted(entries, key=lambda x: (-x[1][1], x))
181 return sorted(entries, key=lambda x: (+x[1][1], x))
183 return sorted(entries, key=lambda x: (-x[1][3], x))
279 parser.add_argument('--nm-tool', default=['nm'], type=lambda x: x.split(),
Dstructs.py222 return sorted(entries, key=lambda x: (-x[1], x))
224 return sorted(entries, key=lambda x: (+x[1], x))
230 return sorted(entries, key=lambda x: (-x[1][1], x))
232 return sorted(entries, key=lambda x: (+x[1][1], x))
234 return sorted(entries, key=lambda x: (-x[1][3], x))
326 parser.add_argument('--objdump-tool', default=['objdump'], type=lambda x: x.split(),
Dsummary.py164 return sorted(entries, key=lambda x: (
165 -(field.key(x[1][field.name])) if field.name in x[1] else -1, x))
168 return sorted(entries, key=lambda x: (
169 +(field.key(x[1][field.name])) if field.name in x[1] else -1, x))
268 parser.add_argument('-f', '--fields', type=lambda x: re.split('\s*,\s*', x),
Dreadblock.py22 parser.add_argument('block_size', type=lambda x: int(x, 0),
24 parser.add_argument('block', type=lambda x: int(x, 0),
Dreadtree.py169 parser.add_argument('block_size', type=lambda x: int(x, 0),
172 type=lambda x: int(x, 0),
175 type=lambda x: int(x, 0),
Dreadmdir.py355 parser.add_argument('block_size', type=lambda x: int(x, 0),
357 parser.add_argument('block1', type=lambda x: int(x, 0),
359 parser.add_argument('block2', nargs='?', type=lambda x: int(x, 0),
Dtest.py221 key=lambda x: len(x[0]), reverse=True):
851 parser.add_argument('--coverage', type=lambda x: x if x else True,
/littlefs-3.5.0-3.4.0/
Dlfs_util.h18 #define LFS_STRINGIZE(x) LFS_STRINGIZE2(x) argument
19 #define LFS_STRINGIZE2(x) #x argument
DDESIGN.md293 storage, in the worst case a small log costs 4x the size of the original data.
531 So at 50% usage, we're seeing an average of 2x cost per update, and at 75%
532 usage, we're already at an average of 4x cost per update.
537 limit. This limits the overhead of garbage collection to 2x the runtime cost,
552 of 4x the original size. I imagine users would not be happy if they found
741 1. ctz(![x]) = the number of trailing bits that are 0 in ![x]
742 2. popcount(![x]) = the number of bits that are 1 in ![x]
1339 with 4 KiB blocks, this is 12 KiB of overhead. A ridiculous 3072x increase.
1426 have a ~4x storage cost, so if our file is smaller than 1/4 the block size,
1471 means that our files never use more than 4x storage overhead, decreasing as
[all …]
/littlefs-3.5.0-3.4.0/tests/
Dtest_exhaustion.toml260 // check we increased the lifetime by 2x with ~10% error
349 // check we increased the lifetime by 2x with ~10% error
438 printf("%08x: wear %d\n", b, wear);