Home
last modified time | relevance | path

Searched refs:orphans (Results 1 – 3 of 3) sorted by relevance

/littlefs-3.7.0-3.6.0/tests/
Dtest_orphans.toml70 // mark the filesystem as having orphans
76 // we should have orphans at this state
82 // we should detect orphans
86 // we should no longer have orphans
105 // append our orphan and mark the filesystem as having orphans
113 // we should have orphans at this state
119 // we should detect orphans
123 // we should no longer have orphans
137 // mark the filesystem as having orphans
143 // we should have orphans at this state
[all …]
/littlefs-3.7.0-3.6.0/
Dlfs.c565 static int lfs_fs_preporphans(lfs_t *lfs, int8_t orphans);
2419 bool orphans = false; in lfs_dir_orphaningcommit() local
2491 orphans = true; in lfs_dir_orphaningcommit()
2543 return orphans ? LFS_OK_ORPHANED : 0; in lfs_dir_orphaningcommit()
2550 int orphans = lfs_dir_orphaningcommit(lfs, dir, attrs, attrcount); in lfs_dir_commit() local
2551 if (orphans < 0) { in lfs_dir_commit()
2552 return orphans; in lfs_dir_commit()
2555 if (orphans) { in lfs_dir_commit()
4758 static int lfs_fs_preporphans(lfs_t *lfs, int8_t orphans) { argument
4759 LFS_ASSERT(lfs_tag_size(lfs->gstate.tag) > 0x000 || orphans >= 0);
[all …]
DDESIGN.md1555 With the possibility of orphans, we can build power loss resilient operations
1688 In addition to normal directory tree operations, we can use orphans to evict
1807 Finding orphans and half-orphans is expensive, requiring a _O(n&sup2;)_
1810 Fortunately, we only need to check for orphans on the first allocation after
1814 avoid searching for orphans unless we knew we were specifically interrupted