Home
last modified time | relevance | path

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

/littlefs-latest/
Dlfs.c480 static void lfs_ctz_fromle32(struct lfs_ctz *ctz) { in lfs_ctz_fromle32() argument
481 ctz->head = lfs_fromle32(ctz->head); in lfs_ctz_fromle32()
482 ctz->size = lfs_fromle32(ctz->size); in lfs_ctz_fromle32()
486 static void lfs_ctz_tole32(struct lfs_ctz *ctz) { in lfs_ctz_tole32() argument
487 ctz->head = lfs_tole32(ctz->head); in lfs_ctz_tole32()
488 ctz->size = lfs_tole32(ctz->size); in lfs_ctz_tole32()
1437 struct lfs_ctz ctz; in lfs_dir_getinfo() local
1439 LFS_MKTAG(LFS_TYPE_STRUCT, id, sizeof(ctz)), &ctz); in lfs_dir_getinfo()
1443 lfs_ctz_fromle32(&ctz); in lfs_dir_getinfo()
1446 info->size = ctz.size; in lfs_dir_getinfo()
[all …]
DDESIGN.md628 The name comes from heavy use of the [CTZ instruction][wikipedia-ctz], which
630 that block contains ctz(_n_)+1 pointers.
689 ![lim,n->inf((1/n)sum,i,0->n(ctz(i)+1)) = sum,i,0->inf(1/2^i) = 2][ctz-formula1]
697 ![B = (w/8)ceil(log2(2^w / (B-2w/8)))][ctz-formula2]
722 ![N = sum,i,0->n(B-(w/8)(ctz(i)+1))][ctz-formula3]
737 ![sum,i,0->n(ctz(i)+1) = 2n-popcount(n)][ctz-formula4]
741 1. ctz(![x]) = the number of trailing bits that are 0 in ![x]
753 ![N = Bn - (w/8)(2n-popcount(n))][ctz-formula5]
762 ![n = floor((N-(w/8)popcount(N/(B-2w/8))) / (B-2w/8))][ctz-formula6]
768 ![off = N - (B-2w/8)n - (w/8)popcount(n)][ctz-formula7]
[all …]
Dlfs.h409 } ctz; member
DSPEC.md458 example, appending a ctz-struct replaces an inline-struct on the same file.
537 found in the [DESIGN.md](DESIGN.md#ctz-skip-lists).
/littlefs-latest/tests/
Dtest_evil.toml162 struct lfs_ctz ctz;
165 LFS_MKTAG(LFS_TYPE_STRUCT, 1, sizeof(struct lfs_ctz)), &ctz)
167 lfs_ctz_fromle32(&ctz);
170 cfg->read(cfg, ctz.head, 0, bbuffer, BLOCK_SIZE) => 0;
174 cfg->erase(cfg, ctz.head) => 0;
175 cfg->prog(cfg, ctz.head, 0, bbuffer, BLOCK_SIZE) => 0;
Dtest_alloc.toml457 lfs_block_t fileblock = file.ctz.head;