Home
last modified time | relevance | path

Searched full:in (Results 1 – 25 of 27) sorted by relevance

12

/littlefs-2.7.6/scripts/
Dtest.py4 # .toml files stored in the tests directory.
120 self.in_ = config.get('in', None)
124 if any(k not in self.case.defines for k in self.defines):
127 '%s=%s' % (k, v) for k, v in self.defines.items()
128 if k not in self.case.defines))
138 for k, v in self.__dict__.items():
148 for k, v in sorted(self.defines.items()):
149 if k not in self.suite.defines:
154 for k in sorted(self.perms[0].defines)
155 if k not in self.defines)))
[all …]
Dreadtree.py21 for m in it.chain((m for d in dirs for m in d), mdirs):
31 for block in tail:
38 mdir.blocks = tuple(blocks[id(p.data)] for p in mdir.pair)
60 for a,b in it.zip_longest(gstate, ngstate.data))
82 for dir in dirs:
88 for mdir in dir:
89 for tag in mdir.tags:
112 print("gstate 0x%s" % ''.join('%02x' % c for c in gstate))
122 for i, dir in enumerate(dirs):
126 for j, mdir in enumerate(dir):
[all …]
Dreadmdir.py40 id = int(args[1], 0) if args[1] not in 'x.' else 0x3ff
45 size = int(args[2], str) if args[2] not in 'x.' else 0x3ff
121 reverse_types = {v: k for k, v in TAG_TYPES.items()}
122 for prefix in range(12):
124 if (mask, self.type & mask) in reverse_types:
158 self.pair = [MetadataPair([block]) for block in blocks]
210 lambda id: Tag('name', id, 0) in self,
215 for tag in self.log:
219 if tag in self and self[tag] is tag:
224 for id in self.ids:
[all …]
Dprefix.py3 # This script replaces prefixes of files, and symbols in that file.
36 for oldname in files:
42 # Rename any prefixes in file
46 for line in newf:
Dexplode_asserts.py144 for type, desc in sorted(TYPE.items()):
156 for op, comp in sorted(COMP.items()):
206 for n, l in lexemes.items())
226 if token[0] in pattern or token[1] in pattern:
296 for pa in [pastr, pamem, paint, pabool, pa]:
368 for i in range(p.off, len(p.tokens)):
Dreadblock.py19 description="Hex dump a specific block in a disk.")
23 help="Size of a block in bytes.")
/littlefs-2.7.6/
DSPEC.md23 - Block pointers are stored in 32 bits, with the special value `0xffffffff`
26 - In addition to the logical block size (which usually matches the erase
31 - By default, all values in littlefs are stored in little-endian byte order.
36 distributed atomic updates. Even the superblock is stored in a metadata pair.
38 As their name suggests, a metadata pair is stored in two blocks, with one block
39 providing a backup during erase cycles in case power is lost. These two blocks
44 variable number of commits. Commits can be appended to the metadata log in
46 successive commits may supersede the metadata in previous commits. Only the
105 Metadata blocks support both forward and backward iteration. In order to do
138 valid. This valid bit is the first bit found in the tag and the commit and can
[all …]
Dlfs.h47 // Maximum name size in bytes, may be redefined to reduce the size of the
48 // info struct. Limited to <= 1022. Stored in superblock and must be
54 // Maximum size of a file in bytes, may be redefined to limit to support other
57 // incorrect values due to using signed integers. Stored in superblock and
63 // Maximum size of custom attributes in bytes, may be redefined, but there is
138 LFS_F_INLINE = 0x100000, // Currently inlined in directory entry
156 // Read a region in a block. Negative error codes are propogated
161 // Program a region in a block. The block must have previously
195 // the metadata to another block. Suggested values are in the
202 // Size of block caches. Each cache buffers a portion of a block in RAM.
[all …]
DREADME.md18 **Dynamic wear leveling** - littlefs is designed with flash in mind, and
95 can be found in the comments in [lfs.h](lfs.h).
97 littlefs takes in a configuration structure that defines how the filesystem
103 The state of the littlefs is stored in the `lfs_t` type which is left up
104 to the user to allocate, allowing multiple filesystems to be in use
112 All POSIX operations, such as remove and rename, are atomic, even in event
118 Littlefs is written in C, and specifically should compile with any compiler
122 errors can be either one of those found in the `enum lfs_error` in
125 In the configuration struct, the `prog` and `erase` function provided by the
142 In littlefs, these ingredients form a sort of two-layered cake, with the small
[all …]
DDESIGN.md15 in the context of microcontrollers. The question was: How would you build a
29 size in mind.
63 bounded. This means RAM usage does not grow as the filesystem changes in
77 Here storage is divided into blocks, with each file being stored in a
80 in place.
109 2. In a completely different direction, we have logging filesystems, such as
176 recover in the event of a power loss.
179 fairly complex, since there are effectively two filesystems running in
189 reach the root of our filesystem, which is often stored in a very small log.
217 storing data changes directly in a log. They even disassociate the storage
[all …]
DLICENSE.md3 Redistribution and use in source and binary forms, with or without modification,
8 - Redistributions in binary form must reproduce the above copyright notice, this
9 list of conditions and the following disclaimer in the documentation and/or
18 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR
22 ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
D.travis.yml134 # it just takes way to long to run byte-level writes in qemu,
135 # note this is still tested in the native tests
163 # it just takes way to long to run byte-level writes in qemu,
164 # note this is still tested in the native tests
192 # it just takes way to long to run byte-level writes in qemu,
193 # note this is still tested in the native tests
306 # Find version defined in lfs.h
354 case ${GEKY_BOT_DRAFT:-minor} in
386 \"description\": \"${STATUS:-In progress}\",
413 # only update if we were last job to mark in progress,
Dlfs.c43 // is already in pcache? in lfs_bd_read()
60 // is already in rcache? in lfs_bd_read()
198 // already fits in pcache? in lfs_bd_prog()
325 // operations on attributes in attribute lists
599 // is already in pcache? in lfs_dir_getread()
616 // is already in rcache? in lfs_dir_getread()
650 // which mask depends on unique bit in tag structure in lfs_dir_traverse_filter()
728 // in filter range? in lfs_dir_traverse()
837 // next commit not yet programmed or we're not in valid range in lfs_dir_fetchmatch()
890 // crc the entry first, hopefully leaving it in the cache in lfs_dir_fetchmatch()
[all …]
Dlfs_util.h167 // Count the number of trailing binary zeros in a
177 // Count the number of binary ones in a
/littlefs-2.7.6/tests/
Dtest_evil.toml9 in = "lfs.c"
31 in = "lfs.c"
76 in = "lfs.c"
123 [[case]] # invalid pointer in CTZ skip-list test
125 in = "lfs.c"
139 // change pointer in CTZ skip-list to be invalid
187 in = "lfs.c"
213 in = "lfs.c"
232 in = "lfs.c"
262 in = "lfs.c"
Dtest_relocations.toml16 // make a child dir to use in bounded space
82 // make a child dir to use in bounded space
176 // create each directory in turn, ignore if dir already exists
196 // try to delete path in reverse order, ignore if dir is not empty
239 // create each directory in turn, ignore if dir already exists
291 // try to delete path in reverse order,
Dtest_orphans.toml2 in = "lfs.c"
87 // create each directory in turn, ignore if dir already exists
107 // try to delete path in reverse order, ignore if dir is not empty
Dtest_move.toml75 in = "lfs.c"
150 in = "lfs.c"
242 in = "lfs.c"
514 in = "lfs.c"
597 in = "lfs.c"
697 in = "lfs.c"
982 [[case]] # create + delete in same commit with neighbors
987 // littlefs keeps files sorted, so we know the order these will be in
1128 [[case]] # create + delete + delete in same commit with neighbors
1133 // littlefs keeps files sorted, so we know the order these will be in
[all …]
Dtest_badblocks.toml1 # bad blocks with block cycles should be tested in test_relocations
/littlefs-2.7.6/bd/
Dlfs_rambd.h2 * Block device emulated in RAM
43 // Create a RAM block device using the geometry in lfs_config
Dlfs_filebd.h2 * Block device emulated in a file
41 // Create a file block device using the geometry in lfs_config
Dlfs_testbd.h3 * of hooks for testing littlefs in various conditions.
95 // Create a test block device using the geometry in lfs_config
Dlfs_filebd.c2 * Block device emulated in a file
83 // zero for reproducability (in case file is truncated) in lfs_filebd_read()
Dlfs_rambd.c2 * Block device emulated in RAM
Dlfs_testbd.c3 * of hooks for testing littlefs in various conditions.

12