/littlefs-3.7.0-3.6.0/scripts/ |
D | readtree.py | 29 data = [] 33 data.append(f.read(args.block_size) 35 blocks[id(data[-1])] = block 37 mdir = MetadataPair(data) 38 mdir.blocks = tuple(blocks[id(p.data)] for p in mdir.pair) 43 if mdir.tail.size != 8 or mdir.tail.data == 8*b'\xff': 60 for a,b in it.zip_longest(gstate, ngstate.data)) 77 tail = struct.unpack('<II', mdir.tail.data) 92 npath = tag.data.decode('utf8') 94 nblocks = struct.unpack('<II', dirstruct.data) [all …]
|
D | readmdir.py | 124 if hasattr(self, 'data'): ntag.data = self.data 178 self.data = self.pair[0].data 187 self.data = blocks[0] 188 block = self.data 206 tag.data = block[off+4:off+tag.dsize] 216 if tag.is_('fcrc') and len(tag.data) == 8: 218 fcrcdata = struct.unpack('<II', tag.data) 320 ' '.join('%02x' % c for c in tag.data[:8]), 322 for c in map(chr, tag.data[:8])))) 325 for i in range(0, len(tag.data), 16): [all …]
|
D | prettyasserts.py | 213 data = in_f.read() 218 m = p.search(data) 221 tokens.append((None, data[:m.start()], line, col)) 223 data = data[m.end():] 225 tokens.append((None, data, line, col))
|
D | cov.py | 231 data = json.load(proc.stdout) 240 for file in data['files']:
|
/littlefs-3.7.0-3.6.0/ |
D | DESIGN.md | 47 If a power loss corrupts any persistent data structures, this can cause the 106 binding relationship of storage location and data removes the filesystem's 111 data, instead the entire storage is used for a circular log which is 132 process of cleaning up outdated data from the end of the log, I've yet to 182 and data. 217 storing data changes directly in a log. They even disassociate the storage 218 location of data, which creates an opportunity for wear leveling. 223 would be needed for the original data. On top of this, the upward motion 233 provides independent atomicity, has poor runtime performance. And COW data 244 In the case of COW data structures, we can try twisting the definition a bit. [all …]
|
D | SPEC.md | 103 blob of data. But exactly how these tags are stored is a little bit tricky. 117 | data A | | | data A | | 123 | data B | | | data B | | 129 | data C | | data C | | 142 | | data A | | 145 | | tag AxB | data B | <--. | 151 | | data C | || | 156 | | tag CRCxA' | data A' | || \ 164 | | tag CRCxA'' | data A'' | <---. \ 170 | | data D | |||| | [all …]
|
D | Makefile | 213 .PHONY: data 214 data: DATAFLAGS+=-S target 215 data: $(OBJ) $(BUILDDIR)/lfs.data.csv target 216 ./scripts/data.py $(OBJ) $(DATAFLAGS) 219 .PHONY: data-diff 220 data-diff: $(OBJ) 221 ./scripts/data.py $^ $(DATAFLAGS) -d $(BUILDDIR)/lfs.data.csv 239 $(BUILDDIR)/lfs.data.csv \ 254 <(./scripts/data.py $(OBJ) -q $(DATAFLAGS) -o-) \ 262 $(BUILDDIR)/lfs.data.csv \ [all …]
|
D | lfs.c | 51 uint8_t *data = buffer; in lfs_bd_read() local 65 memcpy(data, &pcache->buffer[off-pcache->off], diff); in lfs_bd_read() 67 data += diff; in lfs_bd_read() 82 memcpy(data, &rcache->buffer[off-rcache->off], diff); in lfs_bd_read() 84 data += diff; in lfs_bd_read() 98 int err = lfs->cfg->read(lfs->cfg, block, off, data, diff); in lfs_bd_read() 103 data += diff; in lfs_bd_read() 134 const uint8_t *data = buffer; in lfs_bd_cmp() local 148 int res = memcmp(dat, data + i, diff); in lfs_bd_cmp() 234 const uint8_t *data = buffer; in lfs_bd_prog() local [all …]
|
D | lfs_util.c | 23 const uint8_t *data = buffer; in lfs_crc() local 26 crc = (crc >> 4) ^ rtable[(crc ^ (data[i] >> 0)) & 0xf]; in lfs_crc() 27 crc = (crc >> 4) ^ rtable[(crc ^ (data[i] >> 4)) & 0xf]; in lfs_crc()
|
D | README.md | 128 code of these functions, instead all data is read back and checked for 132 flushes all the data to memory and ensures that the next read fetches the data 133 from memory, otherwise data integrity can not be guaranteed. If the `write` 140 store metadata and larger copy-on-write (COW) structures to store file data. 144 storage, while the COW structures store file data compactly and without any 147 Both of these data structures are built out of blocks, which are fed by a
|
D | .gitignore | 19 lfs.data.csv
|
D | lfs.h | 713 int lfs_fs_traverse(lfs_t *lfs, int (*cb)(void*, lfs_block_t), void *data);
|
/littlefs-3.7.0-3.6.0/runners/ |
D | bench_runner.c | 145 intmax_t bench_define_lit(void *data) { in bench_define_lit() argument 146 return (intptr_t)data; in bench_define_lit() 154 intmax_t bench_define_##k(void *data) { \ 155 (void)data; \ 241 bench_define_maps[i].defines[define].data); in bench_define() 694 void *data, in case_forperm() argument 697 void *data) { in case_forperm() 707 cb(data, suite, case_); in case_forperm() 734 cb(data, suite, case_); in case_forperm() 750 void *data, in perm_count() argument [all …]
|
D | test_runner.c | 158 intmax_t test_define_lit(void *data) { in test_define_lit() argument 159 return (intptr_t)data; in test_define_lit() 167 intmax_t test_define_##k(void *data) { \ 168 (void)data; \ 254 test_define_maps[i].defines[define].data); in test_define() 687 void *data, in case_forperm() argument 691 void *data) { in case_forperm() 703 cb(data, suite, case_, &(test_powerloss_t){ in case_forperm() 715 cb(data, suite, case_, &test_powerlosses[p]); in case_forperm() 745 cb(data, suite, case_, &(test_powerloss_t){ in case_forperm() [all …]
|
D | bench_runner.h | 48 intmax_t (*cb)(void *data); 49 void *data; member
|
D | test_runner.h | 41 intmax_t (*cb)(void *data); 42 void *data; member
|
/littlefs-3.7.0-3.6.0/bd/ |
D | lfs_emubd.c | 85 memset(nblock->data, in lfs_emubd_mutblock() 239 memcpy(buffer, &b->data[off], size); in lfs_emubd_read() 303 LFS_ASSERT(b->data[off+i] == bd->cfg->erase_value); in lfs_emubd_prog() 308 memcpy(&b->data[off], buffer, size); in lfs_emubd_prog() 391 memset(b->data, bd->cfg->erase_value, bd->cfg->erase_size); in lfs_emubd_erase() 465 crc_ = lfs_crc(crc_, b->data, cfg->block_size); in lfs_emubd_rawcrc()
|
D | lfs_emubd.h | 135 uint8_t data[]; member
|
/littlefs-3.7.0-3.6.0/tests/ |
D | test_bd.toml | 13 // write data 22 // read data
|
D | test_files.toml | 377 // with syncs we could be any size, but it at least must be valid data
|
D | test_alloc.toml | 410 // now fill all but a couple of blocks of the filesystem with data
|