diff options
author | Filipe Manana <fdmanana@suse.com> | 2014-11-26 10:28:50 -0500 |
---|---|---|
committer | Chris Mason <clm@fb.com> | 2014-12-02 21:19:17 -0500 |
commit | 292cbd51ecf85d73195a3e3193937fa770f6ea71 (patch) | |
tree | ef651a477536ba72b8cbdf951b823135ca5b3ee4 | |
parent | 9ea24bbe17a29f937e7f48e4b15fd52e89e9d386 (diff) |
Btrfs: fix invalid block group rbtree access after bg is removed
If we grab a block group, for example in btrfs_trim_fs(), we will be holding
a reference on it but the block group can be removed after we got it (via
btrfs_remove_block_group), which means it will no longer be part of the
rbtree.
However, btrfs_remove_block_group() was only calling rb_erase() which leaves
the block group's rb_node left and right child pointers with the same content
they had before calling rb_erase. This was dangerous because a call to
next_block_group() would access the node's left and right child pointers (via
rb_next), which can be no longer valid.
Fix this by clearing a block group's node after removing it from the tree,
and have next_block_group() do a tree search to get the next block group
instead of using rb_next() if our block group was removed.
Signed-off-by: Filipe Manana <fdmanana@suse.com>
Reviewed-by: Josef Bacik <jbacik@fb.com>
Signed-off-by: Chris Mason <clm@fb.com>
-rw-r--r-- | fs/btrfs/extent-tree.c | 13 |
1 files changed, 13 insertions, 0 deletions
diff --git a/fs/btrfs/extent-tree.c b/fs/btrfs/extent-tree.c index b4e3ab115f5f..c21cd85a2e3a 100644 --- a/fs/btrfs/extent-tree.c +++ b/fs/btrfs/extent-tree.c | |||
@@ -3162,7 +3162,19 @@ next_block_group(struct btrfs_root *root, | |||
3162 | struct btrfs_block_group_cache *cache) | 3162 | struct btrfs_block_group_cache *cache) |
3163 | { | 3163 | { |
3164 | struct rb_node *node; | 3164 | struct rb_node *node; |
3165 | |||
3165 | spin_lock(&root->fs_info->block_group_cache_lock); | 3166 | spin_lock(&root->fs_info->block_group_cache_lock); |
3167 | |||
3168 | /* If our block group was removed, we need a full search. */ | ||
3169 | if (RB_EMPTY_NODE(&cache->cache_node)) { | ||
3170 | const u64 next_bytenr = cache->key.objectid + cache->key.offset; | ||
3171 | |||
3172 | spin_unlock(&root->fs_info->block_group_cache_lock); | ||
3173 | btrfs_put_block_group(cache); | ||
3174 | cache = btrfs_lookup_first_block_group(root->fs_info, | ||
3175 | next_bytenr); | ||
3176 | return cache; | ||
3177 | } | ||
3166 | node = rb_next(&cache->cache_node); | 3178 | node = rb_next(&cache->cache_node); |
3167 | btrfs_put_block_group(cache); | 3179 | btrfs_put_block_group(cache); |
3168 | if (node) { | 3180 | if (node) { |
@@ -9389,6 +9401,7 @@ int btrfs_remove_block_group(struct btrfs_trans_handle *trans, | |||
9389 | spin_lock(&root->fs_info->block_group_cache_lock); | 9401 | spin_lock(&root->fs_info->block_group_cache_lock); |
9390 | rb_erase(&block_group->cache_node, | 9402 | rb_erase(&block_group->cache_node, |
9391 | &root->fs_info->block_group_cache_tree); | 9403 | &root->fs_info->block_group_cache_tree); |
9404 | RB_CLEAR_NODE(&block_group->cache_node); | ||
9392 | 9405 | ||
9393 | if (root->fs_info->first_logical_byte == block_group->key.objectid) | 9406 | if (root->fs_info->first_logical_byte == block_group->key.objectid) |
9394 | root->fs_info->first_logical_byte = (u64)-1; | 9407 | root->fs_info->first_logical_byte = (u64)-1; |