Home
last modified time | relevance | path

Searched +full:- +full:- +full:hard (Results 1 – 3 of 3) sorted by relevance

/littlefs-2.7.6/scripts/
Dreadtree.py19 hard = False
35 blocks[id(data[-1])] = block
78 hard = mdir.tail.is_('hardtail')
107 print("%-47s%s" % ("littlefs v%s.%s" % version,
130 ' -> {%#x, %#x}' % struct.unpack('<II', mdir.tail.data)
144 ' ' if j == len(dir)-1 else
145 'v' if k == len(lines)-1 else
177 parser.add_argument('-l', '--log', action='store_true',
179 parser.add_argument('-a', '--all', action='store_true',
181 parser.add_argument('-T', '--no-truncate', action='store_true',
/littlefs-2.7.6/
D.travis.yml4 - CFLAGS=-Werror
5 - MAKEFLAGS=-j
11 - $HOME/.cache/apt
14 _: &install-common
16 - sudo apt-get install python3 python3-pip
17 - sudo pip3 install toml
18 # setup a ram-backed disk to speed up reentrant tests
19 - mkdir disks
20 - sudo mount -t tmpfs -o size=100m tmpfs disks
21 - export TFLAGS="$TFLAGS --disk=disks/disk"
[all …]
DSPEC.md10 | | | .---._____
11 .-----. | |
12 --|o |---| littlefs |
13 --| |---| |
14 '-----' '----------'
20 - littlefs is a block-based filesystem. The disk is divided into an array of
23 - 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.
49 The high-level layout of a metadata block is fairly simple:
[all …]