Searched refs:tree (Results 1 – 4 of 4) sorted by relevance
| /littlefs-latest/ |
| D | DESIGN.md | 258 on the filesystem. At the super-block level, littlefs is a CObW tree of blocks
575 [B-trees][wikipedia-B-tree], which can not be traversed with constant RAM, and
576 [B+-trees][wikipedia-B+-tree], which are not possible to update with COW
897 through every block on storage and check each one against our filesystem tree;
1485 directory pointers in our metadata pairs, which gives us a directory tree, much
1513 [RAM]. The directory tree is a tree, and the unfortunate fact is you can't
1514 traverse a tree with constant RAM.
1516 Fortunately, the elements of our tree are metadata pairs, so unlike CTZ
1518 thread a linked-list through our tree, explicitly enabling cheap traversal
1546 whenever we want to manipulate the directory tree, multiple pointers need to be
[all …]
|
| D | README.md | 287 [mklfs]: https://github.com/whitecatboard/Lua-RTOS-ESP32/tree/master/components/mklfs/src
|
| /littlefs-latest/scripts/ |
| D | stack.py | 318 tree=False, argument
481 if not tree:
505 if not tree:
529 if not tree:
|
| /littlefs-latest/tests/ |
| D | test_relocations.toml | 170 # almost every tree operation needs a relocation
|
