Btrfs: Use assert_spin_locked instead of spin_trylock
On UP systems spin_trylock always succeeds Signed-off-by: Chris Mason <chris.mason@oracle.com>
This commit is contained in:
committed by
Chris Mason
parent
b3c3da71ed
commit
64f26f7450
@@ -208,7 +208,7 @@ int add_extent_mapping(struct extent_map_tree *tree,
|
|||||||
struct extent_map *merge = NULL;
|
struct extent_map *merge = NULL;
|
||||||
struct rb_node *rb;
|
struct rb_node *rb;
|
||||||
|
|
||||||
BUG_ON(spin_trylock(&tree->lock));
|
assert_spin_locked(&tree->lock);
|
||||||
rb = tree_insert(&tree->map, em->start, &em->rb_node);
|
rb = tree_insert(&tree->map, em->start, &em->rb_node);
|
||||||
if (rb) {
|
if (rb) {
|
||||||
ret = -EEXIST;
|
ret = -EEXIST;
|
||||||
@@ -270,7 +270,7 @@ struct extent_map *lookup_extent_mapping(struct extent_map_tree *tree,
|
|||||||
struct rb_node *next = NULL;
|
struct rb_node *next = NULL;
|
||||||
u64 end = range_end(start, len);
|
u64 end = range_end(start, len);
|
||||||
|
|
||||||
BUG_ON(spin_trylock(&tree->lock));
|
assert_spin_locked(&tree->lock);
|
||||||
rb_node = __tree_search(&tree->map, start, &prev, &next);
|
rb_node = __tree_search(&tree->map, start, &prev, &next);
|
||||||
if (!rb_node && prev) {
|
if (!rb_node && prev) {
|
||||||
em = rb_entry(prev, struct extent_map, rb_node);
|
em = rb_entry(prev, struct extent_map, rb_node);
|
||||||
@@ -317,7 +317,7 @@ int remove_extent_mapping(struct extent_map_tree *tree, struct extent_map *em)
|
|||||||
int ret = 0;
|
int ret = 0;
|
||||||
|
|
||||||
WARN_ON(test_bit(EXTENT_FLAG_PINNED, &em->flags));
|
WARN_ON(test_bit(EXTENT_FLAG_PINNED, &em->flags));
|
||||||
BUG_ON(spin_trylock(&tree->lock));
|
assert_spin_locked(&tree->lock);
|
||||||
rb_erase(&em->rb_node, &tree->map);
|
rb_erase(&em->rb_node, &tree->map);
|
||||||
em->in_tree = 0;
|
em->in_tree = 0;
|
||||||
return ret;
|
return ret;
|
||||||
|
Reference in New Issue
Block a user