| /littlefs-2.7.6/tests/ |
| D | test_entries.toml | 17 sprintf(path, "hi0"); size = 20;
18 lfs_file_open(&lfs, &file, path,
25 sprintf(path, "hi1"); size = 20;
26 lfs_file_open(&lfs, &file, path,
33 sprintf(path, "hi2"); size = 20;
34 lfs_file_open(&lfs, &file, path,
41 sprintf(path, "hi3"); size = 20;
42 lfs_file_open(&lfs, &file, path,
50 sprintf(path, "hi1"); size = 20;
51 lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
[all …]
|
| D | test_relocations.toml | 23 sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
24 lfs_file_open(&lfs, &file, path, LFS_O_CREAT | LFS_O_WRONLY) => 0;
32 sprintf(path, "test%03d_loooooooooooooooooong_name", i);
34 strcmp(info.name, path) => 0;
44 sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
45 lfs_remove(&lfs, path) => 0;
55 sprintf(path, "test%03d_loooooooooooooooooong_name", i);
57 strcmp(info.name, path) => 0;
62 sprintf(path, "child/test%03d_loooooooooooooooooong_name", i);
63 lfs_remove(&lfs, path) => 0;
[all …]
|
| D | test_dirs.toml | 24 sprintf(path, "dir%03d", i);
25 lfs_mkdir(&lfs, path) => 0;
38 sprintf(path, "dir%03d", i);
41 assert(strcmp(info.name, path) == 0);
55 sprintf(path, "removeme%03d", i);
56 lfs_mkdir(&lfs, path) => 0;
69 sprintf(path, "removeme%03d", i);
72 assert(strcmp(info.name, path) == 0);
80 sprintf(path, "removeme%03d", i);
81 lfs_remove(&lfs, path) => 0;
[all …]
|
| D | test_paths.toml | 2 [[case]] # simple path test
48 [[case]] # dot path test
74 [[case]] # dot dot path test
104 [[case]] # trailing dot path test
126 [[case]] # leading dot path test
138 [[case]] # root dot dot path test
162 [[case]] # invalid path tests
240 [[case]] # max path test
249 memset(path, 'w', LFS_NAME_MAX+1);
250 path[LFS_NAME_MAX+1] = '\0';
[all …]
|
| D | test_exhaustion.toml | 24 sprintf(path, "roadrunner/test%d", i);
28 lfs_file_open(&lfs, &file, path,
53 sprintf(path, "roadrunner/test%d", i);
57 lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
77 sprintf(path, "roadrunner/test%d", i);
78 lfs_stat(&lfs, path, &info) => 0;
106 sprintf(path, "test%d", i);
110 lfs_file_open(&lfs, &file, path,
135 sprintf(path, "test%d", i);
139 lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
[all …]
|
| D | test_orphans.toml | 78 // create random path
89 strcpy(path, full_path);
90 path[2*d+2] = '\0';
91 err = lfs_mkdir(&lfs, path);
96 strcpy(path, full_path);
97 path[2*d+2] = '\0';
98 lfs_stat(&lfs, path, &info) => 0;
99 assert(strcmp(info.name, &path[2*d+1]) == 0);
107 // try to delete path in reverse order, ignore if dir is not empty
109 strcpy(path, full_path);
[all …]
|
| D | test_interspersed.toml | 11 sprintf(path, "%c", alphas[j]);
12 lfs_file_open(&lfs, &files[j], path,
34 sprintf(path, "%c", alphas[j]);
36 assert(strcmp(info.name, path) == 0);
44 sprintf(path, "%c", alphas[j]);
45 lfs_file_open(&lfs, &files[j], path, LFS_O_RDONLY) => 0;
70 sprintf(path, "%c", alphas[j]);
71 lfs_file_open(&lfs, &file, path,
86 sprintf(path, "%c", alphas[j]);
87 lfs_remove(&lfs, path) => 0;
[all …]
|
| D | test_alloc.toml | 19 sprintf(path, "breakfast/%s", names[n]);
20 lfs_file_open(&lfs, &files[n], path,
36 sprintf(path, "breakfast/%s", names[n]);
37 lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
61 sprintf(path, "breakfast/%s", names[n]);
62 lfs_file_open(&lfs, &file, path,
75 sprintf(path, "breakfast/%s", names[n]);
76 lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
104 sprintf(path, "breakfast/%s", names[n]);
105 lfs_file_open(&lfs, &files[n], path,
[all …]
|
| D | test_files.toml | 413 sprintf(path, "file_%03d", i);
414 lfs_file_open(&lfs, &file, path,
423 lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
438 sprintf(path, "file_%03d", i);
439 lfs_file_open(&lfs, &file, path,
450 lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
469 sprintf(path, "file_%03d", i);
470 err = lfs_file_open(&lfs, &file, path, LFS_O_WRONLY | LFS_O_CREAT);
480 lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
|
| D | test_truncate.toml | 319 sprintf(path, "hairyhead%d", i);
320 lfs_file_open(&lfs, &file, path,
346 sprintf(path, "hairyhead%d", i);
347 lfs_file_open(&lfs, &file, path, LFS_O_RDWR) => 0;
373 sprintf(path, "hairyhead%d", i);
374 lfs_file_open(&lfs, &file, path, LFS_O_RDONLY) => 0;
|
| /littlefs-2.7.6/scripts/ |
| D | test.py | 160 f.write(4*' '+'#line %d "%s"\n' % (self.code_lineno, self.suite.path))
205 cmd = exec + ['./%s.test' % self.suite.path,
211 disk = self.suite.path + '.disk'
236 '-ex', 'b %s:%d' % (self.suite.path, self.code_lineno),
349 def __init__(self, path, classes=[TestCase], defines={}, argument
351 self.name = os.path.basename(path)
354 self.path = path
359 with open(path) as f:
470 tf = open(self.path + '.test.c.t', 'w')
473 tf.write('#line %d "%s"\n' % (self.code_lineno, self.path))
[all …]
|
| D | readtree.py | 87 path, dir = pending.pop(0)
96 pending.append(((path + '/' + npath), nmdir))
100 dir[0].path = path.replace('//', '/')
123 print("dir %s" % (json.dumps(dir[0].path)
|
| D | prefix.py | 11 import os.path
|
| /littlefs-2.7.6/ |
| D | lfs.h | 433 int lfs_remove(lfs_t *lfs, const char *path);
447 int lfs_stat(lfs_t *lfs, const char *path, struct lfs_info *info);
461 lfs_ssize_t lfs_getattr(lfs_t *lfs, const char *path,
471 int lfs_setattr(lfs_t *lfs, const char *path,
479 int lfs_removeattr(lfs_t *lfs, const char *path, uint8_t type);
491 const char *path, int flags);
504 const char *path, int flags,
573 int lfs_mkdir(lfs_t *lfs, const char *path);
579 int lfs_dir_open(lfs_t *lfs, lfs_dir_t *dir, const char *path);
|
| D | lfs.c | 1093 const char **path, uint16_t *id) { in lfs_dir_find() argument
1095 const char *name = *path; in lfs_dir_find()
1148 *path = name; in lfs_dir_find()
1909 int lfs_mkdir(lfs_t *lfs, const char *path) { in lfs_mkdir() argument
1910 LFS_TRACE("lfs_mkdir(%p, \"%s\")", (void*)lfs, path); in lfs_mkdir()
1921 err = lfs_dir_find(lfs, &cwd.m, &path, &id); in lfs_mkdir()
1928 lfs_size_t nlen = strlen(path); in lfs_mkdir()
1994 {LFS_MKTAG(LFS_TYPE_DIR, id, nlen), path}, in lfs_mkdir()
2008 int lfs_dir_open(lfs_t *lfs, lfs_dir_t *dir, const char *path) { in lfs_dir_open() argument
2009 LFS_TRACE("lfs_dir_open(%p, %p, \"%s\")", (void*)lfs, (void*)dir, path); in lfs_dir_open()
[all …]
|
| D | DESIGN.md | 644 Consider a path from data block 5 to data block 1. You can see how data block 3
654 The path to data block 0 is even faster, requiring only two jumps:
663 We can find the runtime complexity by looking at the path to any block from
664 the block containing the most pointers. Every step along the path divides
668 note is that this optimal path occurs naturally if we greedily choose the
|
| /littlefs-2.7.6/bd/ |
| D | lfs_filebd.c | 13 int lfs_filebd_createcfg(const struct lfs_config *cfg, const char *path, in lfs_filebd_createcfg() argument
25 path, (void*)bdcfg, bdcfg->erase_value); in lfs_filebd_createcfg()
30 bd->fd = open(path, O_RDWR | O_CREAT, 0666); in lfs_filebd_createcfg()
41 int lfs_filebd_create(const struct lfs_config *cfg, const char *path) { in lfs_filebd_create() argument
51 path); in lfs_filebd_create()
53 int err = lfs_filebd_createcfg(cfg, path, &defaults); in lfs_filebd_create()
|
| D | lfs_testbd.c | 13 int lfs_testbd_createcfg(const struct lfs_config *cfg, const char *path, in lfs_testbd_createcfg() argument
27 path, (void*)bdcfg, bdcfg->erase_value, bdcfg->erase_cycles, in lfs_testbd_createcfg()
34 bd->persist = path; in lfs_testbd_createcfg()
56 int err = lfs_filebd_createcfg(cfg, path, &bd->u.file.cfg); in lfs_testbd_createcfg()
70 int lfs_testbd_create(const struct lfs_config *cfg, const char *path) { in lfs_testbd_create() argument
80 path); in lfs_testbd_create()
82 int err = lfs_testbd_createcfg(cfg, path, &defaults); in lfs_testbd_create()
|
| D | lfs_filebd.h | 42 int lfs_filebd_create(const struct lfs_config *cfg, const char *path);
43 int lfs_filebd_createcfg(const struct lfs_config *cfg, const char *path,
|
| D | lfs_testbd.h | 99 int lfs_testbd_create(const struct lfs_config *cfg, const char *path);
100 int lfs_testbd_createcfg(const struct lfs_config *cfg, const char *path,
|
