Versions Compared

Old Version 4

changes.mady.by.user Andreas Dilger

Saved on

compared with

New Version Current

changes.mady.by.user Andreas Dilger

Saved on

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.
Comment: Migration of unmigrated content due to installation of a new plugin

...

  1. Leaf block (or entries block) stores directory entries (filenames)
  2. Tree block (or indices block) stores hash-value/block-ID pairs
    1. Hash value: hash value of the entry name.
    2. Block-ID: either file logical block number of leaf block, or the next level indices block
Panel
borderStyledashed
titleAn Example of ldiskfs abstract directory structureborderStyledashed


This figure illustrates how storage and lookup takes place on entries in a htree directory. Gray blocks are tree blocks, and blue blocks are leaf blocks. Value pairs in tree blocks are [hash, block-ID], while strings in leaf blocks are "filenames". For example, if hash-value of name "E52" is 155, first the top level tree block-0 is scaned and the hash value 155 (between hash 100 - 199) is found in the next level tree block-2. Searching block-2 shows that hash 155 (higher than hash 150) is in leaf block-5, where the filename "E52" can be found.

...