Home
last modified time | relevance | path

Searched refs:skip (Results 1 – 6 of 6) sorted by relevance

/littlefs-3.5.0-3.4.0/
DSPEC.md487 Gives the id a CTZ skip-list data structure.
489 CTZ skip-lists store files that can not fit in the metadata pair. These files
490 are stored in a skip-list in reverse, with a pointer to the head of the
491 skip-list. Note that the head of the skip-list and the file size is enough
494 How exactly CTZ skip-lists work is a bit complicated. A full explanation can be
495 found in the [DESIGN.md](DESIGN.md#ctz-skip-lists).
511 1 skip 2 skips 1 skip 3 skips 1 skip
535 file's CTZ skip-list.
DDESIGN.md557 ## CTZ skip-lists
618 [skip-list][wikipedia-skip-list]. However, unlike the most common type of
619 skip-list, littlefs's skip-lists are strictly deterministic built around some
622 The rules CTZ skip-lists follow are that for every _n_‍th block where _n_
625 log₂_n_ pointers that skip to different preceding elements of the
626 skip-list.
633 A backwards CTZ skip-list
680 we store a CTZ skip-list in our metadata pairs?
702 1. 32-bit CTZ skip-list => minimum block size of 104 bytes
703 2. 64-bit CTZ skip-list => minimum block size of 448 bytes
[all …]
Dlfs.c2676 lfs_size_t skip = lfs_min( in lfs_ctz_find() local
2682 head, 4*skip, &head, sizeof(head)); in lfs_ctz_find()
2688 current -= 1 << skip; in lfs_ctz_find()
/littlefs-3.5.0-3.4.0/tests/
Dtest_files.toml376 lfs_size_t skip = (MODE == LFS_O_APPEND) ? size : 0;
377 for (lfs_size_t b = 0; b < skip; b++) {
380 for (lfs_size_t i = skip; i < SIZE; i += CHUNKSIZE) {
Dtest_evil.toml123 [[case]] # invalid pointer in CTZ skip-list test
139 // change pointer in CTZ skip-list to be invalid
Dtest_exhaustion.toml435 // skip 0 and 1 as superblock movement is intentionally avoided