Home
last modified time | relevance | path

Searched full:n (Results 1 – 17 of 17) sorted by relevance

/littlefs-2.7.6/tests/
Dtest_alloc.toml18 for (int n = 0; n < FILES; n++) {
19 sprintf(path, "breakfast/%s", names[n]);
20 lfs_file_open(&lfs, &files[n], path,
23 for (int n = 0; n < FILES; n++) {
24 size = strlen(names[n]);
26 lfs_file_write(&lfs, &files[n], names[n], size) => size;
29 for (int n = 0; n < FILES; n++) {
30 lfs_file_close(&lfs, &files[n]) => 0;
35 for (int n = 0; n < FILES; n++) {
36 sprintf(path, "breakfast/%s", names[n]);
[all …]
Dtest_dirs.toml18 define.N = 'range(0, 100, 3)'
23 for (int i = 0; i < N; i++) {
37 for (int i = 0; i < N; i++) {
49 define.N = 'range(3, 100, 11)'
54 for (int i = 0; i < N; i++) {
68 for (int i = 0; i < N; i++) {
79 for (int i = 0; i < N; i++) {
99 define.N = 'range(3, 100, 11)'
104 for (int i = 0; i < N; i++) {
118 for (int i = 0; i < N; i++) {
[all …]
Dtest_superblocks.toml31 define.N = [10, 100, 1000]
35 for (int i = 0; i < N; i++) {
59 define.N = [10, 100, 1000]
62 for (int i = 0; i < N; i++) {
92 define.N = 24
101 for (int i = 0; i < N; i++) {
Dtest_files.toml338 # append (O(n))
340 # truncate (O(n^2))
342 # rewrite (O(n^2))
407 define.N = 300
410 // create N files of 7 bytes
412 for (int i = 0; i < N; i++) {
432 define.N = 300
435 // create N files of 7 bytes
437 for (int i = 0; i < N; i++) {
459 define.N = 300
[all …]
Dtest_move.toml10 lfs_file_write(&lfs, &file, "hola\n", 5) => 5;
11 lfs_file_write(&lfs, &file, "bonjour\n", 8) => 8;
12 lfs_file_write(&lfs, &file, "ohayo\n", 6) => 6;
48 memcmp(buffer, "hola\n", 5) => 0;
50 memcmp(buffer, "bonjour\n", 8) => 0;
52 memcmp(buffer, "ohayo\n", 6) => 0;
84 lfs_file_write(&lfs, &file, "hola\n", 5) => 5;
85 lfs_file_write(&lfs, &file, "bonjour\n", 8) => 8;
86 lfs_file_write(&lfs, &file, "ohayo\n", 6) => 6;
139 memcmp(buffer, "hola\n", 5) => 0;
[all …]
Dtest_exhaustion.toml23 // chose name, roughly random seed, and random 2^n size
105 // chose name, roughly random seed, and random 2^n size
196 // chose name, roughly random seed, and random 2^n size
285 // chose name, roughly random seed, and random 2^n size
370 // chose name, roughly random seed, and random 2^n size
438 printf("%08x: wear %d\n", b, wear);
/littlefs-2.7.6/scripts/
Dtest.py150 f.write('#define %s %s\n' % (k, v))
153 '\n'+8*' '+'__attribute__((unused)) intmax_t %s' % k
158 f.write('\n')
159 f.write(4*' '+'// test case %d\n' % self.caseno)
160 f.write(4*' '+'#line %d "%s"\n' % (self.code_lineno, self.suite.path))
167 f.write('}\n')
171 f.write('#undef %s\n' % k)
223 # simulate power-loss after n cycles?
275 .strip('\n'))
337 # been hit n cycles. We exit with a special return code if the
[all …]
Dexplode_asserts.py21 printf("\\n");
138 outf.write("#include <stdio.h>\n")
139 outf.write("#include <stdbool.h>\n")
140 outf.write("#include <stdint.h>\n")
141 outf.write("#include <inttypes.h>\n")
142 outf.write("#include <signal.h>\n")
152 desc['print'].strip().format(**format))+'\n')
154 desc['fail'].strip().format(**format))+'\n')
162 desc['assert'].strip().format(**format))+'\n')
183 'ws': [r'(?:\s|\n|#.*?\n|//.*?\n|/\*.*?\*/)+'],
[all …]
Dprefix.py47 line, n = subn(from_prefix, to_prefix, line)
48 count += n
Dreadmdir.py280 f.write('\n')
287 f.write(" %-23s %-8s\n" % (
292 f.write("\n")
294 f.write(" %08x: %-47s %-16s\n" % (
Dreadtree.py141 lines = list(filter(None, f.getvalue().split('\n')))
/littlefs-2.7.6/
DDESIGN.md135 1. _O(n&sup2;)_ runtime
136 2. _O(n)_ RAM
238 Consider logging. It has either a _O(n&sup2;)_ runtime or _O(n)_ RAM cost. We
494 one time cost (_O(n&sup2;)_ for littlefs), but also depends on how often
506 Looking at the problem generically, consider a log with ![n] bytes for each
512 ![cost = n + n (s / d+1)][metadata-formula1]
517 ![s = r (size/n)][metadata-formula2]
519 ![d = (1 - r) (size/n)][metadata-formula3]
524 ![cost = n + n (r (size/n) / ((1-r) (size/n) + 1))][metadata-formula4]
613 over a file _in order_ has a runtime cost of _O(n&sup2;)_. A quadratic runtime
[all …]
D.travis.yml26 - sed -n '/``` c/,/```/{/```/d; p}' README.md > test.c &&
65 OBJ="$(ls lfs*.c | sed 's/\.c/\.o/' | tr '\n' ' ')"
314 | sed -n '/^Link/{s/.*<\(.*\)>; rel="last"/\1/;p;q0};$q1' \
352 printf "CHANGES\n%s\n\n" "$CHANGES"
359 # Create the release and patch version tag (vN.N.N)
Dlfs_util.h74 printf("%s:%d:trace: " fmt "%s\n", __FILE__, __LINE__, __VA_ARGS__)
86 printf("%s:%d:debug: " fmt "%s\n", __FILE__, __LINE__, __VA_ARGS__)
98 printf("%s:%d:warn: " fmt "%s\n", __FILE__, __LINE__, __VA_ARGS__)
110 printf("%s:%d:error: " fmt "%s\n", __FILE__, __LINE__, __VA_ARGS__)
DREADME.md88 printf("boot_count: %d\n", boot_count);
DSPEC.md431 || file B | || file E | || file H | || | || file K | || file N |
507 | B |<-| E |--| H |<-| K |--| N | | Q |
Dlfs.c1517 // If our revision count == n * block_cycles, we should force a relocation, in lfs_dir_compact()
1521 // 2. block_cycles = 2n, which, due to aliasing, would only ever relocate in lfs_dir_compact()
4042 "{0x%"PRIx32", 0x%"PRIx32"} 0x%"PRIx16"\n", in lfs_fs_relocate()
4078 "{0x%"PRIx32", 0x%"PRIx32"} 0x%"PRIx16"\n", in lfs_fs_relocate()