Home
last modified time | relevance | path

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

/littlefs-2.7.6/tests/
Dtest_files.toml33 for (lfs_size_t i = 0; i < SIZE; i += CHUNKSIZE) {
34 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE-i);
48 for (lfs_size_t i = 0; i < SIZE; i += CHUNKSIZE) {
49 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE-i);
72 for (lfs_size_t i = 0; i < SIZE1; i += CHUNKSIZE) {
73 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE1-i);
87 for (lfs_size_t i = 0; i < SIZE1; i += CHUNKSIZE) {
88 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE1-i);
102 for (lfs_size_t i = 0; i < SIZE2; i += CHUNKSIZE) {
103 lfs_size_t chunk = lfs_min(CHUNKSIZE, SIZE2-i);
[all …]
Dtest_dirs.toml23 for (int i = 0; i < N; i++) {
24 sprintf(path, "dir%03d", i);
37 for (int i = 0; i < N; i++) {
38 sprintf(path, "dir%03d", i);
54 for (int i = 0; i < N; i++) {
55 sprintf(path, "removeme%03d", i);
68 for (int i = 0; i < N; i++) {
69 sprintf(path, "removeme%03d", i);
79 for (int i = 0; i < N; i++) {
80 sprintf(path, "removeme%03d", i);
[all …]
Dtest_badblocks.toml25 for (int i = 1; i < 10; i++) {
27 buffer[j] = '0'+i;
34 buffer[j+NAMEMULT+1] = '0'+i;
41 for (int j = 0; j < i*FILEMULT; j++) {
50 for (int i = 1; i < 10; i++) {
52 buffer[j] = '0'+i;
60 buffer[j+NAMEMULT+1] = '0'+i;
66 for (int j = 0; j < i*FILEMULT; j++) {
92 for (lfs_block_t i = 0; i < (LFS_BLOCK_COUNT-2)/2; i++) {
93 lfs_testbd_setwear(&cfg, i+2, 0xffffffff) => 0;
[all …]
Dtest_exhaustion.toml22 for (uint32_t i = 0; i < FILES; i++) {
24 sprintf(path, "roadrunner/test%d", i);
25 srand(cycle * i);
51 for (uint32_t i = 0; i < FILES; i++) {
53 sprintf(path, "roadrunner/test%d", i);
54 srand(cycle * i);
75 for (uint32_t i = 0; i < FILES; i++) {
77 sprintf(path, "roadrunner/test%d", i);
104 for (uint32_t i = 0; i < FILES; i++) {
106 sprintf(path, "test%d", i);
[all …]
Dtest_alloc.toml25 for (lfs_size_t i = 0; i < SIZE; i += size) {
39 for (lfs_size_t i = 0; i < SIZE; i += size) {
66 for (int i = 0; i < SIZE; i += size) {
78 for (int i = 0; i < SIZE; i += size) {
110 for (int i = 0; i < SIZE; i += size) {
124 for (int i = 0; i < SIZE; i += size) {
163 for (int i = 0; i < SIZE; i += size) {
175 for (int i = 0; i < SIZE; i += size) {
238 for (int i = 0; i < SIZE; i += size) {
304 for (int i = 0; i < count; i++) {
[all …]
Dtest_relocations.toml22 for (int i = 0; i < COUNT; i++) {
23 sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
31 for (int i = 0; i < COUNT; i++) {
32 sprintf(path, "test%03d_loooooooooooooooooong_name", i);
43 for (int i = 0; i < COUNT; i++) {
44 sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
54 for (int i = 0; i < COUNT; i++) {
55 sprintf(path, "test%03d_loooooooooooooooooong_name", i);
61 for (int i = 0; i < COUNT; i++) {
62 sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
[all …]
Dtest_interspersed.toml16 for (int i = 0; i < SIZE; i++) {
48 for (int i = 0; i < 10; i++) {
73 for (int i = 0; i < SIZE; i++) {
106 for (int i = 0; i < FILES; i++) {
125 for (int i = 0; i < SIZE/2; i++) {
133 for (int i = 0; i < SIZE/2; i++) {
163 for (int i = 0; i < SIZE; i++) {
195 for (int i = 0; i < SIZE; i++) {
199 if ((int)size <= i) {
232 for (int i = 0; i < 10; i++) {
Dtest_truncate.toml318 for (unsigned i = 0; i < COUNT; i++) {
319 sprintf(path, "hairyhead%d", i);
325 for (lfs_off_t j = 0; j < startsizes[i]; j += size) {
328 lfs_file_size(&lfs, &file) => startsizes[i];
330 if (startseeks[i] != startsizes[i]) {
332 startseeks[i], LFS_SEEK_SET) => startseeks[i];
335 lfs_file_truncate(&lfs, &file, hotsizes[i]) => 0;
336 lfs_file_size(&lfs, &file) => hotsizes[i];
345 for (unsigned i = 0; i < COUNT; i++) {
346 sprintf(path, "hairyhead%d", i);
[all …]
Dtest_seek.toml29 for (int i = 0; i < SKIP; i++) {
98 for (int i = 0; i < SKIP; i++) {
154 for (unsigned i = 0; i < sizeof(offsets) / sizeof(offsets[0]); i++) {
155 lfs_soff_t off = offsets[i];
252 for (unsigned i = 0; i < SIZE; i++) {
254 lfs_file_tell(&lfs, &file) => i+1;
255 lfs_file_size(&lfs, &file) => i+1;
261 for (unsigned i = 0; i < SIZE; i++) {
272 for (unsigned i = 0; i < SIZE; i++) {
274 lfs_file_tell(&lfs, &file) => i+1;
[all …]
Dtest_superblocks.toml35 for (int i = 0; i < N; i++) {
62 for (int i = 0; i < N; i++) {
66 assert(err == 0 || (err == LFS_ERR_NOENT && i == 0));
101 for (int i = 0; i < N; i++) {
104 assert(err == 0 || (err == LFS_ERR_NOENT && i == 0));
Dtest_orphans.toml77 for (int i = 0; i < CYCLES; i++) {
Dtest_evil.toml133 for (int i = 0; i < SIZE; i++) {
/littlefs-2.7.6/
Dlfs.c122 for (lfs_off_t i = 0; i < size; i++) { in lfs_bd_cmp() local
125 pcache, rcache, hint-i, in lfs_bd_cmp()
126 block, off+i, &dat, 1); in lfs_bd_cmp()
131 if (dat != data[i]) { in lfs_bd_cmp()
132 return (dat < data[i]) ? LFS_CMP_LT : LFS_CMP_GT; in lfs_bd_cmp()
342 for (int i = 0; i < 3; i++) { in lfs_gstate_xor() local
343 ((uint32_t*)a)[i] ^= ((const uint32_t*)b)[i]; in lfs_gstate_xor()
348 for (int i = 0; i < 3; i++) { in lfs_gstate_iszero() local
349 if (((uint32_t*)a)[i] != 0) { in lfs_gstate_iszero()
464 lfs->free.i = 0; in lfs_alloc_reset()
[all …]
Dlfs_util.c24 for (size_t i = 0; i < size; i++) { in lfs_crc() local
25 crc = (crc >> 4) ^ rtable[(crc ^ (data[i] >> 0)) & 0xf]; in lfs_crc()
26 crc = (crc >> 4) ^ rtable[(crc ^ (data[i] >> 4)) & 0xf]; in lfs_crc()
DDESIGN.md689 ![lim,n->inf((1/n)sum,i,0->n(ctz(i)+1)) = sum,i,0->inf(1/2^i) = 2][ctz-formula1]
722 ![N = sum,i,0->n(B-(w/8)(ctz(i)+1))][ctz-formula3]
737 ![sum,i,0->n(ctz(i)+1) = 2n-popcount(n)][ctz-formula4]
2152 …Cfrac%7B1%7D%7Bn%7D%5Csum_%7Bi%3D0%7D%5E%7Bn%7D%5Cleft%28%5Ctext%7Bctz%7D%28i%29&plus;1%5Cright%29…
2154 …20%5Csum_i%5En%5Cleft%5BB-%5Cfrac%7Bw%7D%7B8%7D%5Cleft%28%5Ctext%7Bctz%7D%28i%29&plus;1%5Cright%29…
2155 [ctz-formula4]: https://latex.codecogs.com/svg.latex?%5Csum_i%5En%5Cleft%28%5Ctext%7Bctz%7D%28i%29&…
Dlfs.h384 lfs_block_t i; member
/littlefs-2.7.6/bd/
Dlfs_filebd.c129 for (lfs_off_t i = 0; i < size; i++) { in lfs_filebd_prog() local
178 for (lfs_off_t i = 0; i < cfg->block_size; i++) { in lfs_filebd_erase() local
Dlfs_rambd.c104 for (lfs_off_t i = 0; i < size; i++) { in lfs_rambd_prog() local
105 LFS_ASSERT(bd->buffer[block*cfg->block_size + off + i] == in lfs_rambd_prog()
/littlefs-2.7.6/scripts/
Dreadmdir.py293 for i in range(0, len(tag.data), 16):
295 tag.off+i,
296 ' '.join('%02x' % c for c in tag.data[i:i+16]),
298 for c in map(chr, tag.data[i:i+16]))))
Dtest.py367 for i, line in enumerate(f):
369 linenos.append(i+1)
371 code_linenos.append(i+2)
385 for i, (case, lineno) in enumerate(zip(config['case'], linenos)):
396 suite=self, caseno=i+1, lineno=lineno, **args))
445 for i, (class_, defines) in enumerate(
448 class_, defines, permno=i+1, **args))
Dexplode_asserts.py368 for i in range(p.off, len(p.tokens)):
369 outf.write(p.tokens[i][1])
Dreadtree.py122 for i, dir in enumerate(dirs):