Home
last modified time | relevance | path

Searched refs:d (Results 1 – 14 of 14) sorted by relevance

/littlefs-3.5.0-3.4.0/tests/
Dtest_relocations.toml169 for (int d = 0; d < DEPTH; d++) {
170 sprintf(&full_path[2*d], "/%c", alpha[rand() % FILES]);
177 for (int d = 0; d < DEPTH; d++) {
179 path[2*d+2] = '\0';
184 for (int d = 0; d < DEPTH; d++) {
186 path[2*d+2] = '\0';
188 assert(strcmp(info.name, &path[2*d+1]) == 0);
197 for (int d = DEPTH-1; d >= 0; d--) {
199 path[2*d+2] = '\0';
231 for (int d = 0; d < DEPTH; d++) {
[all …]
Dtest_orphans.toml80 for (int d = 0; d < DEPTH; d++) {
81 sprintf(&full_path[2*d], "/%c", alpha[rand() % FILES]);
88 for (int d = 0; d < DEPTH; d++) {
90 path[2*d+2] = '\0';
95 for (int d = 0; d < DEPTH; d++) {
97 path[2*d+2] = '\0';
99 assert(strcmp(info.name, &path[2*d+1]) == 0);
108 for (int d = DEPTH-1; d >= 0; d--) {
110 path[2*d+2] = '\0';
Dtest_exhaustion.toml24 sprintf(path, "roadrunner/test%d", i);
53 sprintf(path, "roadrunner/test%d", i);
77 sprintf(path, "roadrunner/test%d", i);
82 LFS_WARN("completed %d cycles", cycle);
106 sprintf(path, "test%d", i);
135 sprintf(path, "test%d", i);
159 sprintf(path, "test%d", i);
164 LFS_WARN("completed %d cycles", cycle);
197 sprintf(path, "roadrunner/test%d", i);
226 sprintf(path, "roadrunner/test%d", i);
[all …]
Dtest_dirs.toml24 sprintf(path, "dir%03d", i);
38 sprintf(path, "dir%03d", i);
55 sprintf(path, "removeme%03d", i);
69 sprintf(path, "removeme%03d", i);
80 sprintf(path, "removeme%03d", i);
105 sprintf(path, "test%03d", i);
119 sprintf(path, "test%03d", i);
132 sprintf(oldpath, "test%03d", i);
133 sprintf(newpath, "tedd%03d", i);
147 sprintf(path, "tedd%03d", i);
[all …]
Dtest_move.toml8 lfs_mkdir(&lfs, "d") => 0;
54 lfs_file_open(&lfs, &file, "d/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
82 lfs_mkdir(&lfs, "d") => 0;
145 lfs_file_open(&lfs, &file, "d/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
158 lfs_mkdir(&lfs, "d") => 0;
237 lfs_file_open(&lfs, &file, "d/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
250 lfs_mkdir(&lfs, "d") => 0;
334 lfs_file_open(&lfs, &file, "d/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
352 err = lfs_mkdir(&lfs, "d");
378 if (lfs_stat(&lfs, "d/hello", &info) == 0) {
[all …]
Dtest_files.toml413 sprintf(path, "file_%03d", i);
418 snprintf(wbuffer, size, "Hi %03d", i);
438 sprintf(path, "file_%03d", i);
443 snprintf(wbuffer, size, "Hi %03d", i);
469 sprintf(path, "file_%03d", i);
473 snprintf(wbuffer, size, "Hi %03d", i);
Dtest_truncate.toml319 sprintf(path, "hairyhead%d", i);
346 sprintf(path, "hairyhead%d", i);
373 sprintf(path, "hairyhead%d", i);
Dtest_alloc.toml425 sprintf(path, "dirwithanexhaustivelylongnameforpadding%d", i);
446 sprintf(path, "dirwithanexhaustivelylongnameforpadding%d", i);
458 sprintf(path, "dirwithanexhaustivelylongnameforpadding%d", i);
/littlefs-3.5.0-3.4.0/
Dlfs.c2143 for (struct lfs_mlist *d = lfs->mlist; d; d = d->next) { in lfs_dir_relocatingcommit() local
2144 if (lfs_pair_cmp(d->m.pair, oldpair) == 0) { in lfs_dir_relocatingcommit()
2145 d->m = *dir; in lfs_dir_relocatingcommit()
2146 if (d->m.pair != pair) { in lfs_dir_relocatingcommit()
2149 d->id == lfs_tag_id(attrs[i].tag)) { in lfs_dir_relocatingcommit()
2150 d->m.pair[0] = LFS_BLOCK_NULL; in lfs_dir_relocatingcommit()
2151 d->m.pair[1] = LFS_BLOCK_NULL; in lfs_dir_relocatingcommit()
2153 d->id > lfs_tag_id(attrs[i].tag)) { in lfs_dir_relocatingcommit()
2154 d->id -= 1; in lfs_dir_relocatingcommit()
2155 if (d->type == LFS_TYPE_DIR) { in lfs_dir_relocatingcommit()
[all …]
D.gitignore3 *.d
DMakefile30 DEP := $(SRC:%.c=$(BUILDDIR)%.d)
DDESIGN.md507 entry, ![d] dynamic entries (entries that are outdated during garbage
512 ![cost = n + n (s / d+1)][metadata-formula1]
519 ![d = (1 - r) (size/n)][metadata-formula3]
521 Substituting these in for ![d] and ![s] gives us a nice formula for the cost of
2149 [metadata-formula3]: https://latex.codecogs.com/svg.latex?d%20%3D%20%281-r%29%20%5Cfrac%7Bsize%7D%7…
2161 [d]: https://latex.codecogs.com/svg.latex?d
DREADME.md88 printf("boot_count: %d\n", boot_count);
/littlefs-3.5.0-3.4.0/scripts/
Dreadtree.py21 for m in it.chain((m for d in dirs for m in d), mdirs):