what is this?
what isn't this?
Performant. Wear-alert. Making big promises. Well-tested. Backed by Big Camel or suitable for Big Data.
under what circumstances should I definitely not use it?
See "how does it differ from littlefs?" for specific caveats of this implementation compared to other users of
This implementation is not suitable for use as a large filesystem. Addressing is limited to 32-bit block indices, and currently the solo5 implementation supports blocks of a maximum size of 512 bytes, for a maximum addressible filesystem of 65535 MiB. Block devices of larger size can be supplied, but only 64 GiB will be usable by
littlefs is most efficient in its space usage with many small ( < 1/4 block size) files in a broad hierarchy (i.e. most directories have many files or other directories in them).
It is least space-efficient with many files of size > 1/4 block size and < 1 block size, and with deeply-nested directory structures.
The above limitations become more alarming with the knowledge that items within a directory are an unordered linked list, so many operations on directories are O(n) in the number of items within the directory. If performance begins to be of concern, some thought on the filesystem layout is advised.
Sometimes you just gotta store some stuff. You don't have to store much stuff and you don't have to do it very often but people are gonna get real mad if you don't do it at least a little.
can I use it?
Sure, if you want.
chamelon is released under the ISC license (like many MirageOS libraries and its core tooling). Prospective users are encouraged to remember that THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE.
why would I use it over other MirageOS filesystem implementations?
Good question. I'm using it because I didn't want to end up using an unmaintained filesystem implementation or maintaining someone else's filesystem implementation. Obviously that's not going to apply to you (or if it does, you're unlikely to decide this software is the right choice).
how does it differ from littlefs?
littlefs threads a linked list through its directory tree so the tree can be traversed in constant RAM. This necessitates some extra complexity to ensure that the tree and linked list agree. This implementation does not guarantee constant RAM operations, therefore does not use the threaded linked list (
softlinks in the parlance of the
littlefs spec), therefore also does not implement global move state.
littlefs implements wear leveling strategies aimed at increasing the life of flash-based storage. This implementation does not, because we assume the execution environment does not provide direct access to real storage; we trust the hypervisor's disk driver to handle this if it's appropriate and required.
This implementation also does not detect or track bad blocks, for similar reasons. (This decision would be fairly easy to reverse.)
The fuse driver for littlefs is interoperable with this implementation, to the best of my knowledge.