Home
last modified time | relevance | path

Searched refs:data (Results 1 – 12 of 12) sorted by relevance

/littlefs-3.5.0-3.4.0/scripts/
Dreadtree.py29 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 …]
Dreadmdir.py113 if hasattr(self, 'data'): ntag.data = self.data
161 self.data = self.pair[0].data
170 self.data = blocks[0]
171 block = self.data
187 tag.data = block[off+4:off+tag.dsize]
288 ' '.join('%02x' % c for c in tag.data[:8]),
290 for c in map(chr, tag.data[:8]))))
293 for i in range(0, len(tag.data), 16):
296 ' '.join('%02x' % c for c in tag.data[i:i+16]),
298 for c in map(chr, tag.data[i:i+16]))))
[all …]
Dexplode_asserts.py208 data = inf.read()
211 m = p.search(data)
214 tokens.append((None, data[:m.start()]))
216 data = data[m.end():]
218 tokens.append((None, data))
/littlefs-3.5.0-3.4.0/
DDESIGN.md47 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 …]
DSPEC.md103 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 | |
148 | | data A | |
151 | | tag AxB | data B | <--. |
157 | | data C | || |
162 | | tag CRCxA' | data A' | || \
170 | | tag CRCxA'' | data A'' | <---. \
176 | | data D | |||| |
[all …]
Dlfs.c52 uint8_t *data = buffer; in lfs_bd_read() local
66 memcpy(data, &pcache->buffer[off-pcache->off], diff); in lfs_bd_read()
68 data += diff; in lfs_bd_read()
83 memcpy(data, &rcache->buffer[off-rcache->off], diff); in lfs_bd_read()
85 data += diff; in lfs_bd_read()
99 int err = lfs->cfg->read(lfs->cfg, block, off, data, diff); in lfs_bd_read()
104 data += diff; in lfs_bd_read()
135 const uint8_t *data = buffer; in lfs_bd_cmp() local
149 res = memcmp(dat, data + i, diff); in lfs_bd_cmp()
214 const uint8_t *data = buffer; in lfs_bd_prog() local
[all …]
Dlfs_util.c23 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()
DMakefile110 .PHONY: data
111 data: $(OBJ) target
112 ./scripts/data.py $^ -S $(DATAFLAGS)
143 ./scripts/data.py $(OBJ) -q -m $@ $(DATAFLAGS) -o $@
DREADME.md128 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
Dlfs.h677 int lfs_fs_traverse(lfs_t *lfs, int (*cb)(void*, lfs_block_t), void *data);
/littlefs-3.5.0-3.4.0/tests/
Dtest_files.toml356 // with syncs we could be any size, but it at least must be valid data
Dtest_alloc.toml347 // now fill all but a couple of blocks of the filesystem with data