Hi Daniel, Am Freitag 12 Dezember 2008 schrieb Daniel Phillips: > Using the "advance" style of coding, it is easy to write the tree > walker non-recursively, a big help to robustness and clarity. There > will be two nested advance loops, one for the inode table and one for > data btrees. We do not attempt to check the internal structure of > metadata files in this pass, because first we want to know that the > files are structurally sound. > > We already have the idea of "leaf check" methods specific to different > types of btrees. We can use this to make our tree walk serve dual > purpose, as either a checker or dumper, by optionally calling > the "show" method for an index leaf.
So this could be used to implement something like xfs_dump of dump for ext2/ext3/ext4? Thanks for your verbose explainations. I do not understand everything, but I like reading about it. I already thought whether I can help with documentation by collecting bits and pieces together, structure them in a good way, maybe rewrite or adapt them at places and check them in as documentation. But I can't promise whether I understand everything of what I read. And its difficult for me to take enough time to the job. Maybe if it could be done in a step by step manner. But what would be needed for documentation anyway at the moment? Ciao, -- Martin 'Helios' Steigerwald - http://www.Lichtvoll.de GPG: 03B0 0D6C 0040 0710 4AFA B82F 991B EAAC A599 84C7
signature.asc
Description: This is a digitally signed message part.
_______________________________________________ Tux3 mailing list [email protected] http://mailman.tux3.org/cgi-bin/mailman/listinfo/tux3
