aboutsummaryrefslogtreecommitdiffstats
path: root/fs/reiserfs/xattr.c
diff options
context:
space:
mode:
authorFrederic Weisbecker <fweisbec@gmail.com>2009-05-14 02:56:39 +0200
committerFrederic Weisbecker <fweisbec@gmail.com>2009-09-14 07:18:22 +0200
commit2ac626955ed62ee8596f00581f959cc86e6198d1 (patch)
treea5bd28e558b889ad7c026199f6032b2ff33f9103 /fs/reiserfs/xattr.c
parentc63e3c0b2498adec921b06c670d12c8c74b85538 (diff)
downloadkernel_samsung_smdk4412-2ac626955ed62ee8596f00581f959cc86e6198d1.zip
kernel_samsung_smdk4412-2ac626955ed62ee8596f00581f959cc86e6198d1.tar.gz
kernel_samsung_smdk4412-2ac626955ed62ee8596f00581f959cc86e6198d1.tar.bz2
kill-the-bkl/reiserfs: unlock only when needed in search_by_key
search_by_key() is the site which most requires the lock. This is mostly because it is a very central function and also because it releases/reaqcuires the write lock at least once each time it is called. Such release/reacquire creates a lot of contention in this place and also opens more the window which let another thread changing the tree. When it happens, the current path searching over the tree must be retried from the beggining (the root) which is a wasteful and time consuming recovery. This patch factorizes two release/reacquire sequences: - reading leaf nodes blocks - reading current block The latter immediately follows the former. The whole sequence is safe as a single unlocked section because we check just after if the tree has changed during these operations. Cc: Jeff Mahoney <jeffm@suse.com> Cc: Chris Mason <chris.mason@oracle.com> Cc: Ingo Molnar <mingo@elte.hu> Cc: Alexander Beregalov <a.beregalov@gmail.com> Signed-off-by: Frederic Weisbecker <fweisbec@gmail.com>
Diffstat (limited to 'fs/reiserfs/xattr.c')
0 files changed, 0 insertions, 0 deletions