Home
last modified time | relevance | path

Searched refs:block_cycles (Results 1 - 5 of 5) sorted by relevance

/third_party/littlefs/scripts/
H A Dtracebd.py254 block_cycles=None,
260 if block_cycles:
261 return self.wear / block_cycles
270 block_cycles=None,
311 block_cycles=block_cycles,
573 block_cycles=None,
797 block_cycles=block_cycles,
/third_party/littlefs/runners/
H A Dtest_runner.c1346 .block_cycles = BLOCK_CYCLES, in run_powerloss_none()
1422 .block_cycles = BLOCK_CYCLES, in run_powerloss_linear()
1515 .block_cycles = BLOCK_CYCLES, in run_powerloss_log()
1606 .block_cycles = BLOCK_CYCLES, in run_powerloss_cycles()
1795 .block_cycles = BLOCK_CYCLES, in run_powerloss_exhaustive()
H A Dbench_runner.c1321 .block_cycles = BLOCK_CYCLES, in perm_run()
/third_party/littlefs/
H A Dlfs.h217 int32_t block_cycles; member
H A Dlfs.c1787 // to our block_cycles modulus, see lfs_dir_compact for why our modulus in lfs_dir_alloc()
1789 if (lfs->cfg->block_cycles > 0) { in lfs_dir_alloc()
1790 dir->rev = lfs_alignup(dir->rev, ((lfs->cfg->block_cycles+1)|1)); in lfs_dir_alloc()
1889 // If our revision count == n * block_cycles, we should force a relocation, in lfs_dir_needsrelocation()
1891 // actually use (block_cycles+1)|1, this is to avoid two corner cases: in lfs_dir_needsrelocation()
1892 // 1. block_cycles = 1, which would prevent relocations from terminating in lfs_dir_needsrelocation()
1893 // 2. block_cycles = 2n, which, due to aliasing, would only ever relocate in lfs_dir_needsrelocation()
1895 return (lfs->cfg->block_cycles > 0 in lfs_dir_needsrelocation()
1896 && ((dir->rev + 1) % ((lfs->cfg->block_cycles+1)|1) == 0)); in lfs_dir_needsrelocation()
4148 // block_cycles
[all...]

Completed in 15 milliseconds