Trees in the Reiser4 Filesystem, Part I
Reiser4 includes many different kinds of items designed to hold different types of information:
static_stat_data: holds the owner, permissions, last access time, creation time, last modification time, size and the number of links (names) to the file.
cmpnd_dir_item: holds directory entries and the keys of the files they link to.
extent pointers: explained above.
node pointers: explained above.
bodies: hold parts of files not large enough to be stored in unfleaves.
We call a unit that which we must place as a whole into an item, without splitting it across multiple items. When traversing an item's contents, it is often convenient to do so in units:
For body items the units are bytes.
For directory items the units are directory entries. The directory entries contain a name and a key of the file named (in practice the name and key may be compressed).
For extent items the units are extents. Extent items contain only extents from the same file.
For static_stat_data the whole stat data item is one indivisible unit of fixed size.
I have explained the basic structures of the Reiser4 tree, but the fun stuff is yet to come. I have not yet explained how other researchers structure their trees. Nor did you learn why object contents are stored at the bottom of the tree, why high fanout is important or what are the different kinds of balancing. No hint have I yet given as to why balanced trees are better and dancing trees are best. What I have most especially not done is explain how a subtle and controversial tree structure change, which you can see in the trees depicted in this article, doubled Reiser4 read speed compared to Reiser3. This will (space permitting) be in Part II in next month's issue of Linux Journal.
Hans Reiser (email@example.com) entered UC Berkeley in 1979 after completing the eigth grade and majored in “Systematizing”, an individual major based on the study of how theoretical models are developed. His senior thesis discussed how the philosophy of the hard sciences differs from that of computer science, with the development of a naming system as a case study. He is still implementing that naming system, of which Reiser4 is the storage layer. In 1993 he went to Russia and hired a team of programmers to develop ReiserFS. He worked full-time to pay their salaries while spending nights and weekends arguing over algorithms. In 1999 it began to work well enough that his mother stopped suggesting a salaried job at a nice big company.
- Cluetrain at Fifteen
- Embedding Python in Your C Programs
- Getting Good Vibrations with Linux
- [<Megashare>] Watch Mrs Brown's Boys Movie Online Full Movie HD 2014
- New Products
- Customizing Vim
- Memory Ordering in Modern Microprocessors, Part I
- Security Hardening with Ansible
- RSS Feeds
- Tech Tip: Really Simple HTTP Server with Python