Cursor_redirect improvements:
* Use new_block instead of recoding the new_block functionality.
* Remove level parameter: always start at the btree leaf and
redirects clean blocks until a dirty block is found.
cursor_redirect is used every place we make a btree leaf dirty:
*
On Sun, Jan 25, 2009 at 2:41 PM, Daniel Phillips phill...@phunq.net wrote:
On Saturday 17 January 2009 13:12, gaurav tungatkar wrote:
De-duplication design includes two data structures as described below-
Hash Tree- Hash tree is a generic btree in which each node entry has
hash of a
Hi,
This fixes/cleanup cursor_redirect().
static-http://userweb.kernel.org/~hirofumi/tux3/
Please review.
And the following two patches to build tux3 on current linus git. I
guess one part will be fixed soon on Linus tree, because it is small
crappy bug. I'm not sure uml part is fixed
Tux3 kernel development is now tracking Linus mainline, and will no
longer maintain compatibility with older kernels. With the arrival of
delayed allocation, Tux3 now compiles only on kernels newer than
2.6.28. A patch against v2.6.29-rc1 is here:
http://tux3.org/patches/tux3-v2.6.29-rc1
This is supposed to cover all changes to metadata blocks. The
cursor_redirects occur inside change_begin/end markers.
Truncate (leaf_chop) is problematic for three reasons:
* We don't know if a particular leaf should be redirected until
calling the leaf chop method, and by that time the
