Home
last modified time | relevance | path

Searched +full:2 +full:f (Results 1 – 8 of 8) sorted by relevance

/littlefs-2.7.6/scripts/
Dreadmdir.py44 if isinstance(args[2], str):
45 size = int(args[2], str) if args[2] not in 'x.' else 0x3ff
47 size = args[2]
275 def _dump_tags(self, tags, f=sys.stdout, truncate=True): argument
276 f.write("%-8s %-8s %-13s %4s %4s" % (
279 f.write(' data (truncated)')
280 f.write('\n')
283 f.write("%08x: %08x %-13s %4s %4s" % (
287 f.write(" %-23s %-8s\n" % (
292 f.write("\n")
[all …]
Dtest.py34 %.test: %.test.o $(foreach f,$(subst /,.,$(SRC:.c=.o)),%.$f)
146 def build(self, f, **_): argument
150 f.write('#define %s %s\n' % (k, v))
152 f.write('void test_case%d(%s) {' % (self.caseno, ','.join(
157 f.write(PROLOGUE)
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))
163 f.write(self.code)
166 f.write(EPILOGUE)
[all …]
Dreadtree.py17 with open(args.disk, 'rb') as f:
32 f.seek(block * args.block_size)
33 data.append(f.read(args.block_size)
133 f = io.StringIO()
135 mdir.dump_log(f, truncate=not args.no_truncate)
137 mdir.dump_all(f, truncate=not args.no_truncate)
139 mdir.dump_tags(f, truncate=not args.no_truncate)
141 lines = list(filter(None, f.getvalue().split('\n')))
156 errcode = errcode or 2
/littlefs-2.7.6/tests/
Dtest_interspersed.toml122 lfs_file_open(&lfs, &files[1], "f", LFS_O_WRONLY | LFS_O_CREAT) => 0;
123 lfs_file_open(&lfs, &files[2], "g", LFS_O_WRONLY | LFS_O_CREAT) => 0;
125 for (int i = 0; i < SIZE/2; i++) {
127 lfs_file_write(&lfs, &files[1], (const void*)"f", 1) => 1;
128 lfs_file_write(&lfs, &files[2], (const void*)"g", 1) => 1;
131 lfs_remove(&lfs, "f") => 0;
133 for (int i = 0; i < SIZE/2; i++) {
135 lfs_file_write(&lfs, &files[1], (const void*)"f", 1) => 1;
136 lfs_file_write(&lfs, &files[2], (const void*)"g", 1) => 1;
141 lfs_file_close(&lfs, &files[2]);
/littlefs-2.7.6/
Dlfs.c11 #define LFS_BLOCK_INLINE ((lfs_block_t)-2)
113 LFS_CMP_GT = 2,
242 static inline void lfs_pair_swap(lfs_block_t pair[2]) { in lfs_pair_swap() argument
248 static inline bool lfs_pair_isnull(const lfs_block_t pair[2]) { in lfs_pair_isnull() argument
253 const lfs_block_t paira[2], in lfs_pair_cmp() argument
254 const lfs_block_t pairb[2]) { in lfs_pair_cmp() argument
260 const lfs_block_t paira[2], in lfs_pair_sync() argument
261 const lfs_block_t pairb[2]) { in lfs_pair_sync() argument
266 static inline void lfs_pair_fromle32(lfs_block_t pair[2]) { in lfs_pair_fromle32() argument
271 static inline void lfs_pair_tole32(lfs_block_t pair[2]) { in lfs_pair_tole32() argument
[all …]
D.travis.yml82 STATUS="$STATUS ($(python -c "print '%+.2f' % (100*($CURR-$PREV)/$PREV.0)")%)"
324 CURRENT_COMMIT=$(curl -f -u "$GEKY_BOT_RELEASES" \
360 curl -f -u "$GEKY_BOT_RELEASES" -X POST \
DSPEC.md63 | | | +-- 2nd commit
98 2. **CRC (32-bits)** - Detects corruption from power-loss or other write
165 | | +-------------------+----| || +-- 2nd commit
232 2. **Type3 (11-bits)** - Type of the tag. This field is broken down further
304 2. **file name** - File name stored as an ASCII string.
386 2. **Version (32-bits)** - The version of littlefs at format time. The version
432 || file C | || file F | || | || | || file L | || |
498 2&zwj;_&#739;_, that block contains a pointer to block _n_-2&zwj;_&#739;_.
508 | C |<-| F |--| I |--| L |--| O | | |
510 block 0 block 1 block 2 block 3 block 4 block 5
[all …]
DDESIGN.md109 2. In a completely different direction, we have logging filesystems, such as
136 2. _O(n)_ RAM
286 | F | | G | | new F |
405 2. If our block _is_ full of entries, we need to somehow remove outdated
426 | revision 1 | revision 0 | => | revision 1 | revision 2 |
461 | revision 1 | revision 2 | => | revision 3 | revision 2 |
500 2. Log is full, garbage collection occurs **every** update
531 So at 50% usage, we're seeing an average of 2x cost per update, and at 75%
537 limit. This limits the overhead of garbage collection to 2x the runtime cost,
550 metadata pairs will only be 1/2 full. If we include the overhead of the second
[all …]