diff options
| author | Chris Mason <chris.mason@oracle.com> | 2008-08-01 15:11:20 -0400 |
|---|---|---|
| committer | Chris Mason <chris.mason@oracle.com> | 2008-09-25 11:04:06 -0400 |
| commit | 65b51a009e29e64c0951f21ea17fdc66bbb0fbd7 (patch) | |
| tree | 800926527fad4c12ca64083816f33be3d716ec13 /fs/btrfs/locking.h | |
| parent | 18e35e0ab337ec99c7e03e9ae917745a352c0bb1 (diff) | |
| download | linux-3.10-65b51a009e29e64c0951f21ea17fdc66bbb0fbd7.tar.gz linux-3.10-65b51a009e29e64c0951f21ea17fdc66bbb0fbd7.tar.bz2 linux-3.10-65b51a009e29e64c0951f21ea17fdc66bbb0fbd7.zip | |
btrfs_search_slot: reduce lock contention by cowing in two stages
A btree block cow has two parts, the first is to allocate a destination
block and the second is to copy the old bock over.
The first part needs locks in the extent allocation tree, and may need to
do IO. This changeset splits that into a separate function that can be
called without any tree locks held.
btrfs_search_slot is changed to drop its path and start over if it has
to COW a contended block. This often means that many writers will
pre-alloc a new destination for a the same contended block, but they
cache their prealloc for later use on lower levels in the tree.
Signed-off-by: Chris Mason <chris.mason@oracle.com>
Diffstat (limited to 'fs/btrfs/locking.h')
| -rw-r--r-- | fs/btrfs/locking.h | 1 |
1 files changed, 1 insertions, 0 deletions
diff --git a/fs/btrfs/locking.h b/fs/btrfs/locking.h index 2dab96d8280..bc1faef1251 100644 --- a/fs/btrfs/locking.h +++ b/fs/btrfs/locking.h @@ -23,4 +23,5 @@ int btrfs_tree_lock(struct extent_buffer *eb); int btrfs_tree_unlock(struct extent_buffer *eb); int btrfs_tree_locked(struct extent_buffer *eb); int btrfs_try_tree_lock(struct extent_buffer *eb); +int btrfs_path_lock_waiting(struct btrfs_path *path, int level); #endif |