Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 45) sorted by relevance

12

/littlefs-latest/runners/
Dbench_runner.c83 size_t i = 0; in leb16_parse() local
85 uintmax_t nibble = s[i]; in leb16_parse()
95 x |= (nibble & 0xf) << (4*i); in leb16_parse()
96 i += 1; in leb16_parse()
98 s = s + i; in leb16_parse()
205 for (size_t i = 0; i < BENCH_DEFINE_NAMES_COUNT; i++) { in bench_define_name() local
206 if (define < bench_define_names[i].count in bench_define_name()
207 && bench_define_names[i].names in bench_define_name()
208 && bench_define_names[i].names[define]) { in bench_define_name()
209 return bench_define_names[i].names[define]; in bench_define_name()
[all …]
Dtest_runner.c83 size_t i = 0; in leb16_parse() local
85 uintmax_t nibble = s[i]; in leb16_parse()
95 x |= (nibble & 0xf) << (4*i); in leb16_parse()
96 i += 1; in leb16_parse()
98 s = s + i; in leb16_parse()
218 for (size_t i = 0; i < TEST_DEFINE_NAMES_COUNT; i++) { in test_define_name() local
219 if (define < test_define_names[i].count in test_define_name()
220 && test_define_names[i].names in test_define_name()
221 && test_define_names[i].names[define]) { in test_define_name()
222 return test_define_names[i].names[define]; in test_define_name()
[all …]
/littlefs-latest/tests/
Dtest_bd.toml15 for (lfs_off_t i = 0; i < cfg->block_size; i += PROG) {
17 buffer[j] = (i+j) % 251;
19 cfg->prog(cfg, 0, i, buffer, PROG) => 0;
23 for (lfs_off_t i = 0; i < cfg->block_size; i += READ) {
24 cfg->read(cfg, 0, i, buffer, READ) => 0;
27 LFS_ASSERT(buffer[j] == (i+j) % 251);
42 for (lfs_off_t i = 0; i < cfg->block_size; i += PROG) {
44 buffer[j] = (block+i+j) % 251;
46 cfg->prog(cfg, block, i, buffer, PROG) => 0;
51 for (lfs_off_t i = 0; i < cfg->block_size; i += READ) {
[all …]
Dtest_files.toml41 for (lfs_size_t i = 0; i < SIZE; i += CHUNKSIZE) {
42 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE-i);
56 for (lfs_size_t i = 0; i < SIZE; i += CHUNKSIZE) {
57 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE-i);
84 for (lfs_size_t i = 0; i < SIZE1; i += CHUNKSIZE) {
85 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE1-i);
99 for (lfs_size_t i = 0; i < SIZE1; i += CHUNKSIZE) {
100 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE1-i);
114 for (lfs_size_t i = 0; i < SIZE2; i += CHUNKSIZE) {
115 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE2-i);
[all …]
Dtest_dirs.toml28 for (int i = 0; i < N; i++) {
30 sprintf(path, "dir%03d", i);
45 for (int i = 0; i < N; i++) {
47 sprintf(path, "dir%03d", i);
65 for (int i = 0; i < N; i++) {
67 sprintf(path, "removeme%03d", i);
82 for (int i = 0; i < N; i++) {
84 sprintf(path, "removeme%03d", i);
94 for (int i = 0; i < N; i++) {
96 sprintf(path, "removeme%03d", i);
[all …]
Dtest_compat.toml107 for (lfs_size_t i = 0; i < COUNT; i++) {
109 sprintf(name, "dir%03d", i);
135 for (lfs_size_t i = 0; i < COUNT; i++) {
139 sprintf(name, "dir%03d", i);
168 for (lfs_size_t i = 0; i < COUNT; i++) {
171 sprintf(name, "file%03d", i);
207 for (lfs_size_t i = 0; i < COUNT; i++) {
211 sprintf(name, "file%03d", i);
220 for (lfs_size_t i = 0; i < COUNT; i++) {
223 sprintf(name, "file%03d", i);
[all …]
Dtest_exhaustion.toml24 for (uint32_t i = 0; i < FILES; i++) {
27 sprintf(path, "roadrunner/test%d", i);
28 uint32_t prng = cycle * i;
55 for (uint32_t i = 0; i < FILES; i++) {
58 sprintf(path, "roadrunner/test%d", i);
59 uint32_t prng = cycle * i;
81 for (uint32_t i = 0; i < FILES; i++) {
84 sprintf(path, "roadrunner/test%d", i);
114 for (uint32_t i = 0; i < FILES; i++) {
117 sprintf(path, "test%d", i);
[all …]
Dtest_badblocks.toml26 for (int i = 1; i < 10; i++) {
29 buffer[j] = '0'+i;
36 buffer[j+NAMEMULT+1] = '0'+i;
44 for (int j = 0; j < i*FILEMULT; j++) {
53 for (int i = 1; i < 10; i++) {
56 buffer[j] = '0'+i;
65 buffer[j+NAMEMULT+1] = '0'+i;
72 for (int j = 0; j < i*FILEMULT; j++) {
98 for (lfs_block_t i = 0; i < (BLOCK_COUNT-2)/2; i++) {
99 lfs_emubd_setwear(cfg, i+2, 0xffffffff) => 0;
[all …]
Dtest_alloc.toml38 for (lfs_size_t i = 0; i < SIZE; i += size) {
54 for (lfs_size_t i = 0; i < SIZE; i += size) {
94 for (int i = 0; i < SIZE; i += size) {
111 for (int i = 0; i < SIZE; i += size) {
152 for (int i = 0; i < SIZE; i += size) {
168 for (int i = 0; i < SIZE; i += size) {
219 for (int i = 0; i < SIZE; i += size) {
233 for (int i = 0; i < SIZE; i += size) {
319 for (int i = 0; i < SIZE; i += size) {
400 for (int i = 0; i < count; i++) {
[all …]
Dtest_powerloss.toml19 for (int i = 0; i < 5; i++) {
27 for (int i = 0; i < 5; i++) {
56 for (int i = 0; i < 5; i++) {
67 for (int i = 0; i < 5; i++) {
76 for (int i = 0; i < 5; i++) {
82 for (int i = 0; i < 5; i++) {
112 for (int i = 0; i < 5; i++) {
120 for (int i = 0; i < 5; i++) {
152 for (int i = 0; i < 5; i++) {
163 for (int i = 0; i < 5; i++) {
[all …]
Dtest_relocations.toml25 for (unsigned i = 0; i < COUNT; i++) {
27 sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
37 for (unsigned i = 0; i < COUNT; i++) {
39 sprintf(path, "test%03d_loooooooooooooooooong_name", i);
50 for (unsigned i = 0; i < COUNT; i++) {
52 sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
64 for (unsigned i = 0; i < COUNT; i++) {
66 sprintf(path, "test%03d_loooooooooooooooooong_name", i);
72 for (unsigned i = 0; i < COUNT; i++) {
74 sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
[all …]
Dtest_interspersed.toml18 for (int i = 0; i < SIZE; i++) {
54 for (int i = 0; i < 10; i++) {
83 for (int i = 0; i < SIZE; i++) {
120 for (int i = 0; i < FILES; i++) {
141 for (int i = 0; i < SIZE/2; i++) {
149 for (int i = 0; i < SIZE/2; i++) {
181 for (int i = 0; i < SIZE; i++) {
220 for (int i = 0; i < SIZE; i++) {
224 if ((int)size <= i) {
261 for (int i = 0; i < 10; i++) {
Dtest_truncate.toml364 for (unsigned i = 0; i < COUNT; i++) {
366 sprintf(path, "hairyhead%d", i);
374 for (lfs_off_t j = 0; j < startsizes[i]; j += size) {
377 lfs_file_size(&lfs, &file) => startsizes[i];
379 if (startseeks[i] != startsizes[i]) {
381 startseeks[i], LFS_SEEK_SET) => startseeks[i];
384 lfs_file_truncate(&lfs, &file, hotsizes[i]) => 0;
385 lfs_file_size(&lfs, &file) => hotsizes[i];
394 for (unsigned i = 0; i < COUNT; i++) {
396 sprintf(path, "hairyhead%d", i);
[all …]
Dtest_seek.toml33 for (int i = 0; i < SKIP; i++) {
106 for (int i = 0; i < SKIP; i++) {
181 for (unsigned i = 0; i < sizeof(offsets) / sizeof(offsets[0]); i++) {
182 lfs_soff_t off = offsets[i];
305 for (unsigned i = 0; i < sizeof(offsets) / sizeof(offsets[0]); i++) {
306 lfs_soff_t off = offsets[i];
418 for (unsigned i = 0; i < SIZE; i++) {
420 lfs_file_tell(&lfs, &file) => i+1;
421 lfs_file_size(&lfs, &file) => i+1;
427 for (unsigned i = 0; i < SIZE; i++) {
[all …]
Dtest_superblocks.toml129 for (int i = 0; i < N; i++) {
163 for (int i = 0; i < N; i++) {
195 for (int i = 0; i < N; i++) {
200 assert(err == 0 || (err == LFS_ERR_NOENT && i == 0));
243 for (int i = 0; i < N; i++) {
247 assert(err == 0 || (err == LFS_ERR_NOENT && i == 0));
539 for (int i = 0; i < N; i++) {
542 sprintf(name, "hello%03x", i);
/littlefs-latest/benches/
Dbench_dir.toml17 for (lfs_size_t i = 0; i < N; i++) {
18 sprintf(name, "file%08x", i);
23 uint32_t file_prng = i;
37 for (lfs_size_t i = 0; i < N; i++) {
39 = (ORDER == 0) ? i
40 : (ORDER == 1) ? (N-1-i)
78 for (lfs_size_t i = 0; i < N; i++) {
80 = (ORDER == 0) ? i
81 : (ORDER == 1) ? (N-1-i)
119 for (lfs_size_t i = 0; i < N; i++) {
[all …]
Dbench_file.toml19 for (lfs_size_t i = 0; i < chunks; i++) {
20 uint32_t chunk_prng = i;
35 for (lfs_size_t i = 0; i < chunks; i++) {
37 = (ORDER == 0) ? i
38 : (ORDER == 1) ? (chunks-1-i)
76 for (lfs_size_t i = 0; i < chunks; i++) {
78 = (ORDER == 0) ? i
79 : (ORDER == 1) ? (chunks-1-i)
/littlefs-latest/scripts/
Dplot.py213 for i in range(shrink):
215 if shrink-1-i > 0:
216 sys.stdout.write('\x1b[%dA' % (shrink-1-i))
218 if shrink-1-i > 0:
219 sys.stdout.write('\x1b[%dB' % (shrink-1-i))
223 for i, line in enumerate(self.lines):
226 if len(self.lines)-1-i > 0:
227 sys.stdout.write('\x1b[%dA' % (len(self.lines)-1-i))
232 if len(self.lines)-1-i > 0:
233 sys.stdout.write('\x1b[%dB' % (len(self.lines)-1-i))
[all …]
Dtailpipe.py77 for i in range(shrink):
79 if shrink-1-i > 0:
80 sys.stdout.write('\x1b[%dA' % (shrink-1-i))
82 if shrink-1-i > 0:
83 sys.stdout.write('\x1b[%dB' % (shrink-1-i))
87 for i, line in enumerate(self.lines):
90 if len(self.lines)-1-i > 0:
91 sys.stdout.write('\x1b[%dA' % (len(self.lines)-1-i))
96 if len(self.lines)-1-i > 0:
97 sys.stdout.write('\x1b[%dB' % (len(self.lines)-1-i))
Dtracebd.py99 for i in range(shrink):
101 if shrink-1-i > 0:
102 sys.stdout.write('\x1b[%dA' % (shrink-1-i))
104 if shrink-1-i > 0:
105 sys.stdout.write('\x1b[%dB' % (shrink-1-i))
109 for i, line in enumerate(self.lines):
112 if len(self.lines)-1-i > 0:
113 sys.stdout.write('\x1b[%dA' % (len(self.lines)-1-i))
118 if len(self.lines)-1-i > 0:
119 sys.stdout.write('\x1b[%dB' % (len(self.lines)-1-i))
[all …]
Dwatch.py113 for i in range(shrink):
115 if shrink-1-i > 0:
116 sys.stdout.write('\x1b[%dA' % (shrink-1-i))
118 if shrink-1-i > 0:
119 sys.stdout.write('\x1b[%dB' % (shrink-1-i))
123 for i, line in enumerate(self.lines):
126 if len(self.lines)-1-i > 0:
127 sys.stdout.write('\x1b[%dA' % (len(self.lines)-1-i))
132 if len(self.lines)-1-i > 0:
133 sys.stdout.write('\x1b[%dB' % (len(self.lines)-1-i))
Dperfbd.py371 for i in range(len(last_stack)):
373 for j in reversed(range(i+1)):
374 if i+1-j > depth:
449 i = bisect.bisect(lines, (last_file, last_line),
451 if i > 0:
452 last_delta = lines[i-1][2] - addr_
470 i = bisect.bisect(sym_at, addr, key=lambda x: x[0])
472 if i > 0 and addr < sym_at[i-1][0] + sym_at[i-1][2]:
473 _, sym, _ = sym_at[i-1]
487 i = bisect.bisect(line_at, addr, key=lambda x: x[0])
[all …]
Dperf.py435 for i in range(len(last_stack)):
437 for j in reversed(range(i+1)):
438 if i+1-j > depth:
524 i = bisect.bisect(line_at, addr, key=lambda x: x[0])
525 if i > 0:
526 _, file, line = line_at[i-1]
584 def collect_job(path, i, **args): argument
588 with z.open(i) as f:
611 records.extend((path, i) for i in z.infolist())
620 ((collect_job, (path, i), args) for path, i in records)):
[all …]
/littlefs-latest/
Dlfs.c137 for (lfs_off_t i = 0; i < size; i += diff) { in lfs_bd_cmp() local
140 diff = lfs_min(size-i, sizeof(dat)); in lfs_bd_cmp()
142 pcache, rcache, hint-i, in lfs_bd_cmp()
143 block, off+i, &dat, diff); in lfs_bd_cmp()
148 int res = memcmp(dat, data + i, diff); in lfs_bd_cmp()
162 for (lfs_off_t i = 0; i < size; i += diff) { in lfs_bd_crc() local
164 diff = lfs_min(size-i, sizeof(dat)); in lfs_bd_crc()
166 pcache, rcache, hint-i, in lfs_bd_crc()
167 block, off+i, &dat, diff); in lfs_bd_crc()
410 for (int i = 0; i < 3; i++) { in lfs_gstate_xor() local
[all …]
/littlefs-latest/bd/
Dlfs_emubd.c172 for (size_t i = 0; i < bd->cfg->erase_count; i++) { in lfs_emubd_create() local
194 for (lfs_block_t i = 0; i < bd->cfg->erase_count; i++) { in lfs_emubd_destroy() local
195 lfs_emubd_decblock(bd->blocks[i]); in lfs_emubd_destroy()
374 for (lfs_off_t i = 0; i < size; i++) { in lfs_emubd_prog() local
375 LFS_ASSERT(b->data[off+i] == bd->cfg->erase_value); in lfs_emubd_prog()
562 for (lfs_size_t i = 0; i < cfg->block_size; i++) { in lfs_emubd_crc_() local
584 for (lfs_block_t i = 0; i < cfg->block_count; i++) { in lfs_emubd_bdcrc() local
586 int err = lfs_emubd_crc_(cfg, i, &i_crc); in lfs_emubd_bdcrc()
719 for (size_t i = 0; i < bd->cfg->erase_count; i++) { in lfs_emubd_copy() local
720 copy->blocks[i] = lfs_emubd_incblock(bd->blocks[i]); in lfs_emubd_copy()

12