diff options
| author | Josef Bacik <josef@redhat.com> | 2010-02-02 21:48:28 +0000 |
|---|---|---|
| committer | Chris Mason <chris.mason@oracle.com> | 2010-03-15 11:00:12 -0400 |
| commit | 49958fd7dbb83cd4d65179d025940e01fe1fbacd (patch) | |
| tree | 4a29e47c0935375968971450a2f2949bbd3cdd43 /fs/btrfs/ordered-data.h | |
| parent | 4125bf761cd0786e1163e024c7c809ce2cc625bc (diff) | |
| download | kernel-common-49958fd7dbb83cd4d65179d025940e01fe1fbacd.tar.gz kernel-common-49958fd7dbb83cd4d65179d025940e01fe1fbacd.tar.bz2 kernel-common-49958fd7dbb83cd4d65179d025940e01fe1fbacd.zip | |
Btrfs: change the ordered tree to use a spinlock instead of a mutex
The ordered tree used to need a mutex, but currently all we use it for is to
protect the rb_tree, and a spin_lock is just fine for that. Using a spin_lock
instead makes dbench run a little faster, 58 mb/s instead of 51 mb/s, and have
less latency, 3445.138 ms instead of 3820.633 ms.
Signed-off-by: Josef Bacik <josef@redhat.com>
Signed-off-by: Chris Mason <chris.mason@oracle.com>
Diffstat (limited to 'fs/btrfs/ordered-data.h')
| -rw-r--r-- | fs/btrfs/ordered-data.h | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/fs/btrfs/ordered-data.h b/fs/btrfs/ordered-data.h index 9116c6d0c5a9..bfbcebbb0adc 100644 --- a/fs/btrfs/ordered-data.h +++ b/fs/btrfs/ordered-data.h @@ -21,7 +21,7 @@ /* one of these per inode */ struct btrfs_ordered_inode_tree { - struct mutex mutex; + spinlock_t lock; struct rb_root tree; struct rb_node *last; }; @@ -128,7 +128,7 @@ static inline int btrfs_ordered_sum_size(struct btrfs_root *root, static inline void btrfs_ordered_inode_tree_init(struct btrfs_ordered_inode_tree *t) { - mutex_init(&t->mutex); + spin_lock_init(&t->lock); t->tree = RB_ROOT; t->last = NULL; } |