Searched refs:entry (Results 1 – 12 of 12) sorted by relevance
| /littlefs-3.5.0-3.4.0/scripts/ |
| D | stack.py | 220 entry = (file if by == 'file' else func)
221 entry_frame, entry_limit, entry_deps = entries[entry]
222 entries[entry] = (
316 filtered_entries = [(name, entry)
317 for name, entry in entries
319 for i, (name, entry) in enumerate(filtered_entries):
321 print(prefixes[0+last] + name, entry)
324 deps = entry[-1]
339 lambda name, entry: print_entry(name, *entry[:-1]))
352 lambda name, entry: print_diff_entry(name, *entry[:-1]))
|
| D | summary.py | 151 entry = (file if by == 'file' else func)
152 prev = entries[entry]
155 entries[entry][field.name] = field.acc(
158 entries[entry][field.name] = result[field.name]
|
| D | coverage.py | 166 entry = (file if by == 'file' else func)
167 entry_hits, entry_count = entries[entry]
168 entries[entry] = (entry_hits + hits, entry_count + count)
|
| D | data.py | 155 entry = (file if by == 'file' else func)
156 entries[entry] += size
|
| D | code.py | 156 entry = (file if by == 'file' else func)
157 entries[entry] += size
|
| D | structs.py | 207 entry = (file if by == 'file' else struct)
208 entries[entry] += size
|
| /littlefs-3.5.0-3.4.0/ |
| D | lfs.c | 4794 static inline lfs_size_t lfs1_entry_size(const lfs1_entry_t *entry) { argument
4795 return 4 + entry->d.elen + entry->d.alen + entry->d.nlen;
4860 static int lfs1_dir_next(lfs_t *lfs, lfs1_dir_t *dir, lfs1_entry_t *entry) { argument
4861 while (dir->off + sizeof(entry->d) > (0x7fffffff & dir->d.size)-4) {
4863 entry->off = dir->off;
4877 &entry->d, sizeof(entry->d));
4878 lfs1_entry_fromle32(&entry->d);
4883 entry->off = dir->off;
4884 dir->off += lfs1_entry_size(entry);
4885 dir->pos += lfs1_entry_size(entry);
[all …]
|
| D | SPEC.md | 325 Initializes the id as a superblock entry.
327 The superblock entry is a special entry used to store format-time configuration
330 The name is a bit of a misnomer. While the superblock entry serves the same
332 does not get a dedicated block. Instead, the superblock entry is duplicated
352 The contents of the superblock entry are stored in a name tag with the
403 The superblock must always be the first entry (id 0) in a metadata pair as well
404 as be the first entry written to the block. This means that the superblock
405 entry can be read from a device using offsets alone.
|
| D | DESIGN.md | 381 Note that littlefs doesn't maintain a checksum for each entry. Many logging
412 solution where for each entry we check to see if a newer entry has been
413 written. If the entry is the most recent we append it to our new block. This
507 entry, ![d] dynamic entries (entries that are outdated during garbage
522 updating an entry given how full the log is:
526 Assuming 100 byte entries in a 4 KiB log, we can graph this using the entry
545 entry has a worst case runtime complexity of _O(nm)_. For _updating_ a specific
546 entry, the worst case complexity is _O(nm²)_, with an amortized complexity
551 block in our metadata pair, each metadata entry has an effective storage cost
1808 comparison of every metadata pair with every directory entry. But the tradeoff
|
| D | README.md | 59 // entry point
|
| /littlefs-3.5.0-3.4.0/tests/ |
| D | test_entries.toml | 8 [[case]] # entry grow test
97 [[case]] # entry shrink test
186 [[case]] # entry spill test
259 [[case]] # entry push spill test
348 [[case]] # entry push spill two test
452 [[case]] # entry drop test
|
| D | test_orphans.toml | 14 // to the linked-list entry, which should orphan the orphan. Note this
|
