aboutsummaryrefslogtreecommitdiffstats
path: root/fs/btrfs
diff options
context:
space:
mode:
authorChris Mason <chris.mason@oracle.com>2011-06-10 16:36:57 -0400
committerChris Mason <chris.mason@oracle.com>2011-06-10 16:36:57 -0400
commit38e87880666091fe9c572a7a2ed2e771d97ca5aa (patch)
tree5e48b7ce7220a2b99f60574f6b02b6b41286d5de /fs/btrfs
parent3473f3c06a36865ae05993041fff35ee928342a7 (diff)
Btrfs: make sure to recheck for bitmaps in clusters
Josef recently changed the free extent cache to look in the block group cluster for any bitmaps before trying to add a new bitmap for the same offset. This avoids BUG_ON()s due covering duplicate ranges. But it didn't go quite far enough. A given free range might span between one or more bitmaps or free space entries. The code has looping to cover this, but it doesn't check for clustered bitmaps every time. This shuffles our gotos to check for a bitmap in the cluster for every new bitmap entry we try to add. Signed-off-by: Chris Mason <chris.mason@oracle.com>
Diffstat (limited to 'fs/btrfs')
-rw-r--r--fs/btrfs/free-space-cache.c9
1 files changed, 5 insertions, 4 deletions
diff --git a/fs/btrfs/free-space-cache.c b/fs/btrfs/free-space-cache.c
index 38f3fd923043..9f985a429877 100644
--- a/fs/btrfs/free-space-cache.c
+++ b/fs/btrfs/free-space-cache.c
@@ -1492,7 +1492,7 @@ static int insert_into_bitmap(struct btrfs_free_space_ctl *ctl,
1492 1492
1493 if (ctl->op == &free_space_op) 1493 if (ctl->op == &free_space_op)
1494 block_group = ctl->private; 1494 block_group = ctl->private;
1495 1495again:
1496 /* 1496 /*
1497 * Since we link bitmaps right into the cluster we need to see if we 1497 * Since we link bitmaps right into the cluster we need to see if we
1498 * have a cluster here, and if so and it has our bitmap we need to add 1498 * have a cluster here, and if so and it has our bitmap we need to add
@@ -1510,13 +1510,13 @@ static int insert_into_bitmap(struct btrfs_free_space_ctl *ctl,
1510 node = rb_first(&cluster->root); 1510 node = rb_first(&cluster->root);
1511 if (!node) { 1511 if (!node) {
1512 spin_unlock(&cluster->lock); 1512 spin_unlock(&cluster->lock);
1513 goto again; 1513 goto no_cluster_bitmap;
1514 } 1514 }
1515 1515
1516 entry = rb_entry(node, struct btrfs_free_space, offset_index); 1516 entry = rb_entry(node, struct btrfs_free_space, offset_index);
1517 if (!entry->bitmap) { 1517 if (!entry->bitmap) {
1518 spin_unlock(&cluster->lock); 1518 spin_unlock(&cluster->lock);
1519 goto again; 1519 goto no_cluster_bitmap;
1520 } 1520 }
1521 1521
1522 if (entry->offset == offset_to_bitmap(ctl, offset)) { 1522 if (entry->offset == offset_to_bitmap(ctl, offset)) {
@@ -1531,7 +1531,8 @@ static int insert_into_bitmap(struct btrfs_free_space_ctl *ctl,
1531 goto out; 1531 goto out;
1532 } 1532 }
1533 } 1533 }
1534again: 1534
1535no_cluster_bitmap:
1535 bitmap_info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset), 1536 bitmap_info = tree_search_offset(ctl, offset_to_bitmap(ctl, offset),
1536 1, 0); 1537 1, 0);
1537 if (!bitmap_info) { 1538 if (!bitmap_info) {