Home
last modified time | relevance | path

Searched refs:count (Results 1 – 10 of 10) sorted by relevance

/littlefs-2.7.6/scripts/
Dprefix.py43 count = 0
48 count += n
57 count)
Dreadmdir.py211 it.count()))
Dtest.py324 for cycles in it.count(1):
/littlefs-2.7.6/
Dlfs.c880 dir->count = tempcount; in lfs_dir_fetchmatch()
980 *id = lfs_min(lfs_tag_id(besttag), dir->count); in lfs_dir_fetchmatch()
985 } else if (lfs_tag_id(besttag) < dir->count) { in lfs_dir_fetchmatch()
1384 dir->count = 0; in lfs_dir_alloc()
1669 dir->count = end - begin; in lfs_dir_compact()
1744 dir->count += 1; in lfs_dir_commit()
1746 LFS_ASSERT(dir->count > 0); in lfs_dir_commit()
1747 dir->count -= 1; in lfs_dir_commit()
1758 if (hasdelete && dir->count == 0) { in lfs_dir_commit()
1775 if (dir->erased || dir->count >= 0xff) { in lfs_dir_commit()
[all …]
DSPEC.md53 .-| revision count | entries | \
82 Each metadata block contains a 32-bit revision count followed by a number of
93 1. **Revision count (32-bits)** - Incremented every erase cycle. If both blocks
94 contain valid commits, only the block with the most recent revision count
113 | revision count | | | revision count |
146 .-| revision count | tag ~A | \
371 ^ ^ ^ ^ ^- version ^- block size ^- block count
395 4. **Block count (32-bits)** - Number of blocks in the filesystem.
751 the first commit, this includes the revision count for the metadata block.
DREADME.md71 // read current count
76 // update boot count
87 // print the boot count
Dlfs.h311 uint16_t count; member
DDESIGN.md318 revision count that we compare using [sequence arithmetic][wikipedia-sna]
320 revision count also gives us a rough idea of how many erases have occurred on
418 the revision count. Because we can commit multiple entries at once, we can
421 entries and revision count become committed and readable.
620 interesting properties of the count-trailing-zeros (CTZ) instruction.
/littlefs-2.7.6/tests/
Dtest_alloc.toml287 int count = 0;
294 count += 1;
304 for (int i = 0; i < count; i++) {
315 for (int i = 0; i < count+1; i++) {
431 int count = 0;
438 count += 1;
452 for (int i = 0; i < count+1; i++) {
Dtest_move.toml359 int count = 0;
364 count += 1;
370 count += 1;
376 count += 1;
382 count += 1;
384 assert(count <= 1);
822 int count = 0;
826 count += 1;
831 count += 1;
836 count += 1;
[all …]