Home
last modified time | relevance | path

Searched refs:pair (Results 1 – 11 of 11) sorted by relevance

/littlefs-3.7.0-3.6.0/
Dlfs.c289 static inline void lfs_pair_swap(lfs_block_t pair[2]) { in lfs_pair_swap()
290 lfs_block_t t = pair[0]; in lfs_pair_swap()
291 pair[0] = pair[1]; in lfs_pair_swap()
292 pair[1] = t; in lfs_pair_swap()
295 static inline bool lfs_pair_isnull(const lfs_block_t pair[2]) { in lfs_pair_isnull()
296 return pair[0] == LFS_BLOCK_NULL || pair[1] == LFS_BLOCK_NULL; in lfs_pair_isnull()
313 static inline void lfs_pair_fromle32(lfs_block_t pair[2]) { in lfs_pair_fromle32()
314 pair[0] = lfs_fromle32(pair[0]); in lfs_pair_fromle32()
315 pair[1] = lfs_fromle32(pair[1]); in lfs_pair_fromle32()
319 static inline void lfs_pair_tole32(lfs_block_t pair[2]) { in lfs_pair_tole32()
[all …]
DSPEC.md36 distributed atomic updates. Even the superblock is stored in a metadata pair.
38 As their name suggests, a metadata pair is stored in two blocks, with one block
41 metadata pair is stored as two block pointers.
360 each pair containing any number of files in alphabetical order. A pointer to
375 metadata pair doubles as the root directory of the filesystem.
390 pairs grow every time the root pair is compacted in order to prolong the
444 The superblock must always be the first entry (id 0) in a metadata pair as well
465 each pair containing any number of files in alphabetical order.
478 The dir-struct tag contains only the pointer to the first metadata-pair in the
481 The pointer to the next metadata-pair in the directory is stored in a tail tag,
[all …]
DDESIGN.md313 pair. This has the added advantage that we can change out blocks in the
314 metadata pair independently, and we don't reduce our block granularity for
324 metadata pair pointer: {block 0, block 1}
335 metadata pair .----------------.----------------.
385 of metadata as long as they reside on the same metadata pair.
446 Instead, we split our original metadata pair into two metadata pairs, each
454 resilience during this split step by first preparing the new metadata pair,
456 metadata pair.
502 Clearly we need to be more aggressive than waiting for our metadata pair to
503 be full. As the metadata pair approaches fullness the frequency of compactions
[all …]
Dlfs.h359 lfs_block_t pair[2]; member
412 lfs_block_t pair[2]; member
/littlefs-3.7.0-3.6.0/tests/
Dtest_evil.toml227 [cases.test_evil_mdir_loop] # metadata-pair threaded-list loop test
247 [cases.test_evil_mdir_loop2] # metadata-pair threaded-list 2-length loop test
260 lfs_block_t pair[2];
264 LFS_MKTAG(LFS_TYPE_DIRSTRUCT, 1, sizeof(pair)), pair)
265 => LFS_MKTAG(LFS_TYPE_DIRSTRUCT, 1, sizeof(pair));
266 lfs_pair_fromle32(pair);
268 lfs_dir_fetch(&lfs, &mdir, pair) => 0;
278 [cases.test_evil_mdir_loop_child] # metadata-pair threaded-list 1-length child loop test
291 lfs_block_t pair[2];
295 LFS_MKTAG(LFS_TYPE_DIRSTRUCT, 1, sizeof(pair)), pair)
[all …]
Dtest_powerloss.toml34 // get pair/rev count
38 lfs_block_t pair[2] = {dir.m.pair[0], dir.m.pair[1]};
45 cfg->read(cfg, pair[1], 0, bbuffer, BLOCK_SIZE) => 0;
49 cfg->erase(cfg, pair[1]) => 0;
50 cfg->prog(cfg, pair[1], 0, bbuffer, BLOCK_SIZE) => 0;
134 lfs_block_t block = dir.m.pair[0];
Dtest_orphans.toml20 lfs_block_t block = dir.m.pair[0];
109 lfs_pair_tole32(orphan.pair);
111 {LFS_MKTAG(LFS_TYPE_SOFTTAIL, 0x3ff, 8), orphan.pair})) => 0;
181 lfs_pair_tole32(orphan.pair);
183 {LFS_MKTAG(LFS_TYPE_SOFTTAIL, 0x3ff, 8), orphan.pair})) => 0;
Dtest_move.toml108 lfs_block_t block = dir.m.pair[0];
189 lfs_block_t block = dir.m.pair[0];
206 block = dir.m.pair[0];
285 lfs_block_t block = dir.m.pair[0];
302 block = dir.m.pair[0];
568 lfs_block_t block = dir.m.pair[0];
655 lfs_block_t block = dir.m.pair[0];
672 block = dir.m.pair[0];
758 lfs_block_t block = dir.m.pair[0];
775 block = dir.m.pair[0];
[all …]
Dtest_superblocks.toml330 .pair = {0, 0}, // make sure this goes into block 0
/littlefs-3.7.0-3.6.0/scripts/
Dreadmdir.py175 self.pair = [MetadataPair([block]) for block in blocks]
176 self.pair = sorted(self.pair, reverse=True)
178 self.data = self.pair[0].data
179 self.rev = self.pair[0].rev
180 self.tags = self.pair[0].tags
181 self.ids = self.pair[0].ids
182 self.log = self.pair[0].log
183 self.all_ = self.pair[0].all_
186 self.pair = [self]
366 ' (was %s)' % ', '.join('%d' % m.rev for m in mdir.pair[1:])
[all …]
Dreadtree.py38 mdir.blocks = tuple(blocks[id(p.data)] for p in mdir.pair)
128 mdir.blocks[0], mdir.blocks[1], mdir.rev, mdir.pair[1].rev,