Home
last modified time | relevance | path

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

/littlefs-3.7.0-3.6.0/tests/
Dtest_relocations.toml194 for (unsigned d = 0; d < DEPTH; d++) {
195 sprintf(&full_path[2*d], "/%c", alpha[TEST_PRNG(&prng) % FILES]);
203 for (unsigned d = 0; d < DEPTH; d++) {
206 path[2*d+2] = '\0';
211 for (unsigned d = 0; d < DEPTH; d++) {
214 path[2*d+2] = '\0';
216 assert(strcmp(info.name, &path[2*d+1]) == 0);
225 for (unsigned d = DEPTH-1; d+1 > 0; d--) {
228 path[2*d+2] = '\0';
263 for (unsigned d = 0; d < DEPTH; d++) {
[all …]
Dtest_exhaustion.toml27 sprintf(path, "roadrunner/test%d", i);
58 sprintf(path, "roadrunner/test%d", i);
84 sprintf(path, "roadrunner/test%d", i);
90 LFS_WARN("completed %d cycles", cycle);
117 sprintf(path, "test%d", i);
148 sprintf(path, "test%d", i);
175 sprintf(path, "test%d", i);
180 LFS_WARN("completed %d cycles", cycle);
216 sprintf(path, "roadrunner/test%d", i);
247 sprintf(path, "roadrunner/test%d", i);
[all …]
Dtest_dirs.toml30 sprintf(path, "dir%03d", i);
47 sprintf(path, "dir%03d", i);
67 sprintf(path, "removeme%03d", i);
84 sprintf(path, "removeme%03d", i);
96 sprintf(path, "removeme%03d", i);
124 sprintf(path, "test%03d", i);
141 sprintf(path, "test%03d", i);
154 sprintf(oldpath, "test%03d", i);
155 sprintf(newpath, "tedd%03d", i);
170 sprintf(path, "tedd%03d", i);
[all …]
Dtest_compat.toml109 sprintf(name, "dir%03d", i);
139 sprintf(name, "dir%03d", i);
171 sprintf(name, "file%03d", i);
211 sprintf(name, "file%03d", i);
223 sprintf(name, "file%03d", i);
260 sprintf(name, "dir%03d", i);
264 sprintf(name, "dir%03d/file%03d", i, i);
304 sprintf(name, "dir%03d", i);
314 sprintf(name, "dir%03d", i);
327 sprintf(name, "file%03d", i);
[all …]
Dtest_orphans.toml229 for (unsigned d = 0; d < DEPTH; d++) {
230 sprintf(&full_path[2*d], "/%c", alpha[TEST_PRNG(&prng) % FILES]);
238 for (unsigned d = 0; d < DEPTH; d++) {
241 path[2*d+2] = '\0';
246 for (unsigned d = 0; d < DEPTH; d++) {
249 path[2*d+2] = '\0';
251 assert(strcmp(info.name, &path[2*d+1]) == 0);
260 for (int d = DEPTH-1; d >= 0; d--) {
263 path[2*d+2] = '\0';
Dtest_move.toml9 lfs_mkdir(&lfs, "d") => 0;
59 lfs_file_open(&lfs, &file, "d/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
90 lfs_mkdir(&lfs, "d") => 0;
156 lfs_file_open(&lfs, &file, "d/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
171 lfs_mkdir(&lfs, "d") => 0;
253 lfs_file_open(&lfs, &file, "d/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
267 lfs_mkdir(&lfs, "d") => 0;
354 lfs_file_open(&lfs, &file, "d/hello", LFS_O_RDONLY) => LFS_ERR_NOENT;
373 err = lfs_mkdir(&lfs, "d");
400 if (lfs_stat(&lfs, "d/hello", &info) == 0) {
[all …]
Dtest_files.toml437 sprintf(path, "file_%03d", i);
442 sprintf(wbuffer, "Hi %03d", i);
465 sprintf(path, "file_%03d", i);
470 sprintf(wbuffer, "Hi %03d", i);
499 sprintf(path, "file_%03d", i);
503 sprintf(wbuffer, "Hi %03d", i);
Dtest_truncate.toml362 sprintf(path, "hairyhead%d", i);
392 sprintf(path, "hairyhead%d", i);
423 sprintf(path, "hairyhead%d", i);
Dtest_alloc.toml492 sprintf(path, "dirwithanexhaustivelylongnameforpadding%d", i);
517 sprintf(path, "dirwithanexhaustivelylongnameforpadding%d", i);
530 sprintf(path, "dirwithanexhaustivelylongnameforpadding%d", i);
/littlefs-3.7.0-3.6.0/
Dlfs.c2314 for (struct lfs_mlist *d = lfs->mlist; d; d = d->next) { in lfs_dir_relocatingcommit() local
2315 if (lfs_pair_cmp(d->m.pair, oldpair) == 0) { in lfs_dir_relocatingcommit()
2316 d->m = *dir; in lfs_dir_relocatingcommit()
2317 if (d->m.pair != pair) { in lfs_dir_relocatingcommit()
2320 d->id == lfs_tag_id(attrs[i].tag)) { in lfs_dir_relocatingcommit()
2321 d->m.pair[0] = LFS_BLOCK_NULL; in lfs_dir_relocatingcommit()
2322 d->m.pair[1] = LFS_BLOCK_NULL; in lfs_dir_relocatingcommit()
2324 d->id > lfs_tag_id(attrs[i].tag)) { in lfs_dir_relocatingcommit()
2325 d->id -= 1; in lfs_dir_relocatingcommit()
2326 if (d->type == LFS_TYPE_DIR) { in lfs_dir_relocatingcommit()
[all …]
D.gitignore3 *.d
DMakefile23 DEP := $(SRC:%.c=$(BUILDDIR)/%.d)
37 TEST_DEP := $(TEST_C:%.t.c=%.t.d)
54 BENCH_DEP := $(BENCH_C:%.b.c=%.b.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.7.0-3.6.0/runners/
Dbench_runner.c319 for (size_t d = 0; in bench_define_suite() local
320 d < lfs_max( in bench_define_suite()
323 d++) { in bench_define_suite()
325 const char *name = bench_define_name(d); in bench_define_suite()
327 count = lfs_max(count, d+1); in bench_define_suite()
353 for (size_t d = 0; in bench_define_suite() local
354 d < lfs_max( in bench_define_suite()
357 d++) { in bench_define_suite()
359 const char *name = bench_define_name(d); in bench_define_suite()
364 bench_override_defines[j*count + d] = BENCH_LIT( in bench_define_suite()
[all …]
Dtest_runner.c332 for (size_t d = 0; in test_define_suite() local
333 d < lfs_max( in test_define_suite()
336 d++) { in test_define_suite()
338 const char *name = test_define_name(d); in test_define_suite()
340 count = lfs_max(count, d+1); in test_define_suite()
366 for (size_t d = 0; in test_define_suite() local
367 d < lfs_max( in test_define_suite()
370 d++) { in test_define_suite()
372 const char *name = test_define_name(d); in test_define_suite()
377 test_override_defines[j*count + d] = TEST_LIT( in test_define_suite()
[all …]
/littlefs-3.7.0-3.6.0/scripts/
Dreadtree.py21 for m in it.chain((m for d in dirs for m in d), mdirs):
Ddata.py281 key=lambda d: difflib.SequenceMatcher(None,
282 d[0],
Dcode.py281 key=lambda d: difflib.SequenceMatcher(None,
282 d[0],
/littlefs-3.7.0-3.6.0/benches/
Dbench_dir.toml225 printf("hm %d\n", i);