| /littlefs-3.5.0-3.4.0/scripts/ |
| D | data.py | 152 def dedup_entries(results, by='name'): argument
155 entry = (file if by == 'file' else func)
184 def print_header(by=''): argument
186 print('%-36s %7s' % (by, 'size'))
188 print('%-36s %7s %7s %7s' % (by, 'old', 'new', 'diff'))
200 def print_entries(by='name'): argument
201 entries = dedup_entries(results, by=by)
204 print_header(by=by)
208 prev_entries = dedup_entries(prev_results, by=by)
210 print_header(by='%s (%d added, %d removed)' % (by,
[all …]
|
| D | code.py | 153 def dedup_entries(results, by='name'): argument
156 entry = (file if by == 'file' else func)
185 def print_header(by=''): argument
187 print('%-36s %7s' % (by, 'size'))
189 print('%-36s %7s %7s %7s' % (by, 'old', 'new', 'diff'))
201 def print_entries(by='name'): argument
202 entries = dedup_entries(results, by=by)
205 print_header(by=by)
209 prev_entries = dedup_entries(prev_results, by=by)
211 print_header(by='%s (%d added, %d removed)' % (by,
[all …]
|
| D | coverage.py | 163 def dedup_entries(results, by='name'): argument
166 entry = (file if by == 'file' else func)
205 def print_header(by=''): argument
207 print('%-36s %19s' % (by, 'hits/line'))
209 print('%-36s %19s %19s %11s' % (by, 'old', 'new', 'diff'))
235 def print_entries(by='name'): argument
236 entries = dedup_entries(results, by=by)
239 print_header(by=by)
243 prev_entries = dedup_entries(prev_results, by=by)
245 print_header(by='%s (%d added, %d removed)' % (by,
[all …]
|
| D | summary.py | 148 def dedup_entries(results, by='name'): argument
151 entry = (file if by == 'file' else func)
173 def print_header(by=''): argument
175 print('%-36s' % by, end='')
180 print('%-36s' % by, end='')
220 def print_entries(by='name'): argument
221 entries = dedup_entries(results, by=by)
224 print_header(by=by)
228 prev_entries = dedup_entries(prev_results, by=by)
229 print_header(by='%s (%d added, %d removed)' % (by,
[all …]
|
| D | structs.py | 204 def dedup_entries(results, by='name'): argument
207 entry = (file if by == 'file' else struct)
236 def print_header(by=''): argument
238 print('%-36s %7s' % (by, 'size'))
240 print('%-36s %7s %7s %7s' % (by, 'old', 'new', 'diff'))
252 def print_entries(by='name'): argument
253 entries = dedup_entries(results, by=by)
256 print_header(by=by)
260 prev_entries = dedup_entries(prev_results, by=by)
262 print_header(by='%s (%d added, %d removed)' % (by,
[all …]
|
| D | stack.py | 217 def dedup_entries(results, by='name'): argument
220 entry = (file if by == 'file' else func)
225 entry_deps | {file if by == 'file' else func
279 def print_header(by=''): argument
281 print('%-36s %7s %7s' % (by, 'frame', 'limit'))
283 print('%-36s %15s %15s %15s' % (by, 'old', 'new', 'diff'))
310 def print_entries(by='name'): argument
332 entries = dedup_entries(results, by=by)
335 print_header(by=by)
341 prev_entries = dedup_entries(prev_results, by=by)
[all …]
|
| D | test.py | 822 directory of tests, a specific file, a suite by name, and even \
|
| /littlefs-3.5.0-3.4.0/ |
| D | README.md | 37 // variables used by the filesystem
41 // configuration of the filesystem is provided by this struct
110 structures must be provided by the user.
123 [lfs.h](lfs.h), or an error returned by the user's block device operations.
125 In the configuration struct, the `prog` and `erase` function provided by the
147 Both of these data structures are built out of blocks, which are fed by a
230 - [mklfs] - A command line tool built by the [Lua RTOS] guys for making
|
| D | SPEC.md | 82 Each metadata block contains a 32-bit revision count followed by a number of
84 by a 32-bit CRC.
102 Entries themselves are stored as a 32-bit tag followed by a variable length
239 2. **Chunk (8-bits)** - Chunk field used for various purposes by the different
264 ordered alphabetically by filename.
392 3. **Block size (32-bits)** - Size of the logical block size used by the
497 A quick summary: For every _n_‍th block where _n_ is divisible by
514 Note that the maximum number of pointers in a block is bounded by the maximum
515 file size divided by the block size. With 32 bits for file size, this results
548 Each user attribute is uniquely identified by an 8-bit type which is stored in
[all …]
|
| D | DESIGN.md | 127 detect power-loss and fall back to the previous state by ignoring failed
186 but instead of updating block inplace, all updates are performed by creating
242 complexity is _O(1)_ by bounding the input.
249 each level we divide the propagation of wear by _n_. With a sufficiently
303 Why two blocks? Well, logs work by appending entries to a circular buffer
447 containing half of the entries, connected by a tail pointer. Instead of
454 resilience during this split step by first preparing the new metadata pair,
560 storage cost. But we can work around this storage cost by only using the
623 is divisible by 2‍_ˣ_, that block contains a pointer to block
663 We can find the runtime complexity by looking at the path to any block from
[all …]
|
| /littlefs-3.5.0-3.4.0/tests/ |
| D | test_relocations.toml | 150 # TODO fix this case, caused by non-DAG trees
212 # TODO fix this case, caused by non-DAG trees
|
| D | test_exhaustion.toml | 260 // check we increased the lifetime by 2x with ~10% error
349 // check we increased the lifetime by 2x with ~10% error
|
| D | test_orphans.toml | 61 # TODO fix this case, caused by non-DAG trees
|
