summaryrefslogtreecommitdiff
path: root/include/linux/jhash.h
diff options
context:
space:
mode:
authorYan Zheng <zheng.yan@oracle.com>2009-07-30 17:40:40 +0400
committerChris Mason <chris.mason@oracle.com>2009-07-30 17:40:40 +0400
commit276e680d192a67d222fcea51af37b056feffb665 (patch)
tree137bae016c30f24e7fafcbc8073e3411b732eb31 /include/linux/jhash.h
parentf25784b35f590c81d5fb8245a8cd45e1afb6f1b2 (diff)
downloadlinux-276e680d192a67d222fcea51af37b056feffb665.tar.xz
Btrfs: preserve commit_root for async caching
The async block group caching code uses the commit_root pointer to get a stable version of the extent allocation tree for scanning. This copy of the tree root isn't going to change and it significantly reduces the complexity of the scanning code. During a commit, we have a loop where we update the extent allocation tree root. We need to loop because updating the root pointer in the tree of tree roots may allocate blocks which may change the extent allocation tree. Right now the commit_root pointer is changed inside this loop. It is more correct to change the commit_root pointer only after all the looping is done. Signed-off-by: Yan Zheng <zheng.yan@oracle.com> Signed-off-by: Chris Mason <chris.mason@oracle.com>
Diffstat (limited to 'include/linux/jhash.h')
0 files changed, 0 insertions, 0 deletions