JFFS3 superblock search

Jörn Engel joern at wohnheim.fh-wedel.de
Mon Jun 6 10:00:10 EDT 2005

On Mon, 6 June 2005 17:45:38 +0400, Artem B. Bityuckiy wrote:
> providing the key is 16 bytes and the pointer is 8 bytes, the 4-level 
> B-tree is enough for (4096/24)^4 = 170^4 ~1E8. If this isn't enough we 
> may use more levels as well.

There are valid reasons to use 512 byte blocks instead.  Most likely I
will do just that for logfs, just as a hint.  Therefore, even with 8
byte keys, you'd be down to 32^4 or about a million.  Prepare for more


I don't understand it. Nobody does.
-- Richard P. Feynman

More information about the linux-mtd mailing list