Home
last modified time | relevance | path

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

/littlefs-3.5.0-3.4.0/
Dlfs.c269 static inline void lfs_pair_swap(lfs_block_t pair[2]) { in lfs_pair_swap()
270 lfs_block_t t = pair[0]; in lfs_pair_swap()
271 pair[0] = pair[1]; in lfs_pair_swap()
272 pair[1] = t; in lfs_pair_swap()
275 static inline bool lfs_pair_isnull(const lfs_block_t pair[2]) { in lfs_pair_isnull()
276 return pair[0] == LFS_BLOCK_NULL || pair[1] == LFS_BLOCK_NULL; in lfs_pair_isnull()
295 static inline void lfs_pair_fromle32(lfs_block_t pair[2]) { in lfs_pair_fromle32()
296 pair[0] = lfs_fromle32(pair[0]); in lfs_pair_fromle32()
297 pair[1] = lfs_fromle32(pair[1]); in lfs_pair_fromle32()
301 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.
319 each pair containing any number of files in alphabetical order. A pointer to
334 metadata pair doubles as the root directory of the filesystem.
349 pairs grow every time the root pair is compacted in order to prolong the
403 The superblock must always be the first entry (id 0) in a metadata pair as well
424 each pair containing any number of files in alphabetical order.
437 The dir-struct tag contains only the pointer to the first metadata-pair in the
440 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.h330 lfs_block_t pair[2]; member
383 lfs_block_t pair[2]; member
/littlefs-3.5.0-3.4.0/tests/
Dtest_evil.toml212 [[case]] # metadata-pair threaded-list loop test
231 [[case]] # metadata-pair threaded-list 2-length loop test
243 lfs_block_t pair[2];
247 LFS_MKTAG(LFS_TYPE_DIRSTRUCT, 1, sizeof(pair)), pair)
248 => LFS_MKTAG(LFS_TYPE_DIRSTRUCT, 1, sizeof(pair));
249 lfs_pair_fromle32(pair);
251 lfs_dir_fetch(&lfs, &mdir, pair) => 0;
261 [[case]] # metadata-pair threaded-list 1-length child loop test
273 lfs_block_t pair[2];
277 LFS_MKTAG(LFS_TYPE_DIRSTRUCT, 1, sizeof(pair)), pair)
[all …]
Dtest_move.toml97 lfs_block_t block = dir.m.pair[0];
173 lfs_block_t block = dir.m.pair[0];
190 block = dir.m.pair[0];
265 lfs_block_t block = dir.m.pair[0];
282 block = dir.m.pair[0];
535 lfs_block_t block = dir.m.pair[0];
619 lfs_block_t block = dir.m.pair[0];
636 block = dir.m.pair[0];
719 lfs_block_t block = dir.m.pair[0];
736 block = dir.m.pair[0];
[all …]
Dtest_orphans.toml18 lfs_block_t block = dir.m.pair[0];
/littlefs-3.5.0-3.4.0/scripts/
Dreadmdir.py158 self.pair = [MetadataPair([block]) for block in blocks]
159 self.pair = sorted(self.pair, reverse=True)
161 self.data = self.pair[0].data
162 self.rev = self.pair[0].rev
163 self.tags = self.pair[0].tags
164 self.ids = self.pair[0].ids
165 self.log = self.pair[0].log
166 self.all_ = self.pair[0].all_
169 self.pair = [self]
334 ' (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,