btrfs-corrupt-block: add -E option to randomly corrupt the extent_root

Signed-off-by: Chris Mason <chris.mason@oracle.com>
master
Chris Mason 2012-02-07 08:36:38 -05:00
parent f5c4c4f3b7
commit 08e2cb625e
2 changed files with 111 additions and 30 deletions

View File

@ -93,17 +93,9 @@ static void print_usage(void)
exit(1); exit(1);
} }
static struct option long_options[] = { static int corrupt_extent(struct btrfs_trans_handle *trans,
/* { "byte-count", 1, NULL, 'b' }, */ struct btrfs_root *root, u64 bytenr, int copy)
{ "logical", 1, NULL, 'l' },
{ "copy", 1, NULL, 'c' },
{ "bytes", 1, NULL, 'b' },
{ 0, 0, 0, 0}
};
static int corrupt_extent(struct btrfs_root *root, u64 bytenr, int copy)
{ {
struct btrfs_trans_handle *trans;
struct btrfs_key key; struct btrfs_key key;
struct extent_buffer *leaf; struct extent_buffer *leaf;
u32 item_size; u32 item_size;
@ -111,8 +103,8 @@ static int corrupt_extent(struct btrfs_root *root, u64 bytenr, int copy)
struct btrfs_path *path; struct btrfs_path *path;
int ret; int ret;
int slot; int slot;
int should_del = rand() % 3;
trans = btrfs_start_transaction(root, 1);
path = btrfs_alloc_path(); path = btrfs_alloc_path();
key.objectid = bytenr; key.objectid = bytenr;
@ -121,7 +113,7 @@ static int corrupt_extent(struct btrfs_root *root, u64 bytenr, int copy)
while(1) { while(1) {
ret = btrfs_search_slot(trans, root->fs_info->extent_root, ret = btrfs_search_slot(trans, root->fs_info->extent_root,
&key, path, 0, 1); &key, path, -1, 1);
if (ret < 0) if (ret < 0)
break; break;
@ -129,6 +121,7 @@ static int corrupt_extent(struct btrfs_root *root, u64 bytenr, int copy)
if (path->slots[0] == 0) if (path->slots[0] == 0)
break; break;
path->slots[0]--; path->slots[0]--;
ret = 0;
} }
leaf = path->nodes[0]; leaf = path->nodes[0];
slot = path->slots[0]; slot = path->slots[0];
@ -144,13 +137,26 @@ static int corrupt_extent(struct btrfs_root *root, u64 bytenr, int copy)
key.type != BTRFS_SHARED_DATA_REF_KEY) key.type != BTRFS_SHARED_DATA_REF_KEY)
goto next; goto next;
fprintf(stderr, "corrupting extent record: key %Lu %u %Lu\n", if (should_del) {
key.objectid, key.type, key.offset); fprintf(stderr, "deleting extent record: key %Lu %u %Lu\n",
key.objectid, key.type, key.offset);
ptr = btrfs_item_ptr_offset(leaf, slot); if (key.type == BTRFS_EXTENT_ITEM_KEY) {
item_size = btrfs_item_size_nr(leaf, slot); /* make sure this extent doesn't get
memset_extent_buffer(leaf, 0, ptr, item_size); * reused for other purposes */
btrfs_mark_buffer_dirty(leaf); btrfs_pin_extent(root->fs_info,
key.objectid, key.offset);
}
btrfs_del_item(trans, root, path);
} else {
fprintf(stderr, "corrupting extent record: key %Lu %u %Lu\n",
key.objectid, key.type, key.offset);
ptr = btrfs_item_ptr_offset(leaf, slot);
item_size = btrfs_item_size_nr(leaf, slot);
memset_extent_buffer(leaf, 0, ptr, item_size);
btrfs_mark_buffer_dirty(leaf);
}
next: next:
btrfs_release_path(NULL, path); btrfs_release_path(NULL, path);
@ -161,12 +167,65 @@ next:
} }
btrfs_free_path(path); btrfs_free_path(path);
btrfs_commit_transaction(trans, root);
ret = close_ctree(root);
BUG_ON(ret);
return 0; return 0;
} }
static void btrfs_corrupt_extent_leaf(struct btrfs_trans_handle *trans,
struct btrfs_root *root, struct extent_buffer *eb)
{
u32 nr = btrfs_header_nritems(eb);
u32 victim = rand() % nr;
u64 objectid;
struct btrfs_key key;
btrfs_item_key_to_cpu(eb, &key, victim);
objectid = key.objectid;
corrupt_extent(trans, root, objectid, 1);
}
static void btrfs_corrupt_extent_tree(struct btrfs_trans_handle *trans,
struct btrfs_root *root, struct extent_buffer *eb)
{
int i;
u32 nr;
if (!eb)
return;
nr = btrfs_header_nritems(eb);
if (btrfs_is_leaf(eb)) {
btrfs_corrupt_extent_leaf(trans, root, eb);
return;
}
if (btrfs_header_level(eb) == 1 && eb != root->node) {
if (rand() % 5)
return;
}
for (i = 0; i < nr; i++) {
struct extent_buffer *next;
next = read_tree_block(root, btrfs_node_blockptr(eb, i),
root->leafsize, btrfs_node_ptr_generation(eb, i));
if (!next)
continue;
btrfs_corrupt_extent_tree(trans, root, next);
free_extent_buffer(next);
}
}
static struct option long_options[] = {
/* { "byte-count", 1, NULL, 'b' }, */
{ "logical", 1, NULL, 'l' },
{ "copy", 1, NULL, 'c' },
{ "bytes", 1, NULL, 'b' },
{ "extent-record", 0, NULL, 'e' },
{ "extent-tree", 0, NULL, 'E' },
{ 0, 0, 0, 0}
};
int main(int ac, char **av) int main(int ac, char **av)
{ {
struct cache_tree root_cache; struct cache_tree root_cache;
@ -178,11 +237,14 @@ int main(int ac, char **av)
int option_index = 0; int option_index = 0;
int copy = 0; int copy = 0;
u64 bytes = 4096; u64 bytes = 4096;
int extent_rec; int extent_rec = 0;
int extent_tree = 0;
srand(128);
while(1) { while(1) {
int c; int c;
c = getopt_long(ac, av, "l:c:e", long_options, c = getopt_long(ac, av, "l:c:eE", long_options,
&option_index); &option_index);
if (c < 0) if (c < 0)
break; break;
@ -214,6 +276,9 @@ int main(int ac, char **av)
case 'e': case 'e':
extent_rec = 1; extent_rec = 1;
break; break;
case 'E':
extent_tree = 1;
break;
default: default:
print_usage(); print_usage();
} }
@ -221,7 +286,7 @@ int main(int ac, char **av)
ac = ac - optind; ac = ac - optind;
if (ac == 0) if (ac == 0)
print_usage(); print_usage();
if (logical == 0) if (logical == 0 && !extent_tree)
print_usage(); print_usage();
if (copy < 0) if (copy < 0)
print_usage(); print_usage();
@ -237,8 +302,19 @@ int main(int ac, char **av)
exit(1); exit(1);
} }
if (extent_rec) { if (extent_rec) {
ret = corrupt_extent (root, logical, 0); struct btrfs_trans_handle *trans;
goto out; trans = btrfs_start_transaction(root, 1);
ret = corrupt_extent (trans, root, logical, 0);
btrfs_commit_transaction(trans, root);
goto out_close;
}
if (extent_tree) {
struct btrfs_trans_handle *trans;
trans = btrfs_start_transaction(root, 1);
btrfs_corrupt_extent_tree(trans, root->fs_info->extent_root,
root->fs_info->extent_root->node);
btrfs_commit_transaction(trans, root);
goto out_close;
} }
if (bytes == 0) if (bytes == 0)
@ -253,6 +329,8 @@ int main(int ac, char **av)
logical += root->sectorsize; logical += root->sectorsize;
bytes -= root->sectorsize; bytes -= root->sectorsize;
} }
out: return ret;
out_close:
close_ctree(root);
return ret; return ret;
} }

View File

@ -1083,7 +1083,9 @@ static int lookup_inline_extent_backref(struct btrfs_trans_handle *trans,
ptr += sizeof(struct btrfs_tree_block_info); ptr += sizeof(struct btrfs_tree_block_info);
BUG_ON(ptr > end); BUG_ON(ptr > end);
} else { } else {
BUG_ON(!(flags & BTRFS_EXTENT_FLAG_DATA)); if (!(flags & BTRFS_EXTENT_FLAG_DATA)) {
return -EIO;
}
} }
err = -ENOENT; err = -ENOENT;
@ -2120,8 +2122,6 @@ static int __free_extent(struct btrfs_trans_handle *trans,
extent_slot = path->slots[0]; extent_slot = path->slots[0];
} }
} else { } else {
btrfs_print_leaf(extent_root, path->nodes[0]);
WARN_ON(1);
printk(KERN_ERR "btrfs unable to find ref byte nr %llu " printk(KERN_ERR "btrfs unable to find ref byte nr %llu "
"parent %llu root %llu owner %llu offset %llu\n", "parent %llu root %llu owner %llu offset %llu\n",
(unsigned long long)bytenr, (unsigned long long)bytenr,
@ -2129,6 +2129,8 @@ static int __free_extent(struct btrfs_trans_handle *trans,
(unsigned long long)root_objectid, (unsigned long long)root_objectid,
(unsigned long long)owner_objectid, (unsigned long long)owner_objectid,
(unsigned long long)owner_offset); (unsigned long long)owner_offset);
ret = -EIO;
goto fail;
} }
leaf = path->nodes[0]; leaf = path->nodes[0];
@ -2238,6 +2240,7 @@ static int __free_extent(struct btrfs_trans_handle *trans,
mark_free); mark_free);
BUG_ON(ret); BUG_ON(ret);
} }
fail:
btrfs_free_path(path); btrfs_free_path(path);
finish_current_insert(trans, extent_root); finish_current_insert(trans, extent_root);
return ret; return ret;