2 * Copyright (C) 2009 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #define _XOPEN_SOURCE 500
26 #include "kerncompat.h"
30 #include "print-tree.h"
31 #include "transaction.h"
35 struct extent_buffer *debug_corrupt_block(struct btrfs_root *root, u64 bytenr,
36 u32 blocksize, int copy)
39 struct extent_buffer *eb;
41 struct btrfs_multi_bio *multi = NULL;
42 struct btrfs_device *device;
46 eb = btrfs_find_create_tree_block(root, bytenr, blocksize);
52 ret = btrfs_map_block(&root->fs_info->mapping_tree, READ,
53 eb->start, &length, &multi,
56 device = multi->stripes[0].dev;
59 eb->dev_bytenr = multi->stripes[0].physical;
61 fprintf(stdout, "mirror %d logical %Lu physical %Lu "
62 "device %s\n", mirror_num, (unsigned long long)bytenr,
63 (unsigned long long)eb->dev_bytenr, device->name);
66 if (!copy || mirror_num == copy) {
67 ret = read_extent_from_disk(eb, 0, eb->len);
68 printf("corrupting %llu copy %d\n", eb->start,
70 memset(eb->data, 0, eb->len);
71 write_extent_to_disk(eb);
75 num_copies = btrfs_num_copies(&root->fs_info->mapping_tree,
81 if (mirror_num > num_copies)
87 static void print_usage(void)
89 fprintf(stderr, "usage: btrfs-corrupt-block [options] device\n");
90 fprintf(stderr, "\t-l Logical extent to be corrupted\n");
91 fprintf(stderr, "\t-c Copy of the extent to be corrupted"
92 " (usually 1 or 2, default: 0)\n");
93 fprintf(stderr, "\t-b Number of bytes to be corrupted\n");
94 fprintf(stderr, "\t-e Extent to be corrupted\n");
95 fprintf(stderr, "\t-E The whole extent free to be corrupted\n");
99 static void corrupt_keys(struct btrfs_trans_handle *trans,
100 struct btrfs_root *root,
101 struct extent_buffer *eb)
106 struct btrfs_disk_key bad_key;;
108 nr = btrfs_header_nritems(eb);
113 bad_slot = rand() % nr;
115 if (bad_slot == slot)
118 fprintf(stderr, "corrupting keys in block %llu slot %d swapping with %d\n",
119 (unsigned long long)eb->start, slot, bad_slot);
121 if (btrfs_header_level(eb) == 0) {
122 btrfs_item_key(eb, &bad_key, bad_slot);
123 btrfs_set_item_key(eb, &bad_key, slot);
125 btrfs_node_key(eb, &bad_key, bad_slot);
126 btrfs_set_node_key(eb, &bad_key, slot);
128 btrfs_mark_buffer_dirty(eb);
130 csum_tree_block(root, eb, 0);
131 write_extent_to_disk(eb);
136 static int corrupt_keys_in_block(struct btrfs_root *root, u64 bytenr)
138 struct extent_buffer *eb;
140 eb = read_tree_block(root, bytenr, root->leafsize, 0);
144 corrupt_keys(NULL, root, eb);
145 free_extent_buffer(eb);
149 static int corrupt_extent(struct btrfs_trans_handle *trans,
150 struct btrfs_root *root, u64 bytenr, int copy)
152 struct btrfs_key key;
153 struct extent_buffer *leaf;
156 struct btrfs_path *path;
159 int should_del = rand() % 3;
161 path = btrfs_alloc_path();
163 key.objectid = bytenr;
165 key.offset = (u64)-1;
168 ret = btrfs_search_slot(trans, root->fs_info->extent_root,
174 if (path->slots[0] == 0)
179 leaf = path->nodes[0];
180 slot = path->slots[0];
181 btrfs_item_key_to_cpu(leaf, &key, slot);
182 if (key.objectid != bytenr)
185 if (key.type != BTRFS_EXTENT_ITEM_KEY &&
186 key.type != BTRFS_TREE_BLOCK_REF_KEY &&
187 key.type != BTRFS_EXTENT_DATA_REF_KEY &&
188 key.type != BTRFS_EXTENT_REF_V0_KEY &&
189 key.type != BTRFS_SHARED_BLOCK_REF_KEY &&
190 key.type != BTRFS_SHARED_DATA_REF_KEY)
194 fprintf(stderr, "deleting extent record: key %Lu %u %Lu\n",
195 key.objectid, key.type, key.offset);
197 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
198 /* make sure this extent doesn't get
199 * reused for other purposes */
200 btrfs_pin_extent(root->fs_info,
201 key.objectid, key.offset);
204 btrfs_del_item(trans, root, path);
206 fprintf(stderr, "corrupting extent record: key %Lu %u %Lu\n",
207 key.objectid, key.type, key.offset);
208 ptr = btrfs_item_ptr_offset(leaf, slot);
209 item_size = btrfs_item_size_nr(leaf, slot);
210 memset_extent_buffer(leaf, 0, ptr, item_size);
211 btrfs_mark_buffer_dirty(leaf);
214 btrfs_release_path(NULL, path);
222 btrfs_free_path(path);
226 static void btrfs_corrupt_extent_leaf(struct btrfs_trans_handle *trans,
227 struct btrfs_root *root, struct extent_buffer *eb)
229 u32 nr = btrfs_header_nritems(eb);
230 u32 victim = rand() % nr;
232 struct btrfs_key key;
234 btrfs_item_key_to_cpu(eb, &key, victim);
235 objectid = key.objectid;
236 corrupt_extent(trans, root, objectid, 1);
239 static void btrfs_corrupt_extent_tree(struct btrfs_trans_handle *trans,
240 struct btrfs_root *root, struct extent_buffer *eb)
248 nr = btrfs_header_nritems(eb);
249 if (btrfs_is_leaf(eb)) {
250 btrfs_corrupt_extent_leaf(trans, root, eb);
254 if (btrfs_header_level(eb) == 1 && eb != root->node) {
259 for (i = 0; i < nr; i++) {
260 struct extent_buffer *next;
262 next = read_tree_block(root, btrfs_node_blockptr(eb, i),
263 root->leafsize, btrfs_node_ptr_generation(eb, i));
266 btrfs_corrupt_extent_tree(trans, root, next);
267 free_extent_buffer(next);
271 static struct option long_options[] = {
272 /* { "byte-count", 1, NULL, 'b' }, */
273 { "logical", 1, NULL, 'l' },
274 { "copy", 1, NULL, 'c' },
275 { "bytes", 1, NULL, 'b' },
276 { "extent-record", 0, NULL, 'e' },
277 { "extent-tree", 0, NULL, 'E' },
278 { "keys", 0, NULL, 'k' },
283 int main(int ac, char **av)
285 struct cache_tree root_cache;
286 struct btrfs_root *root;
287 struct extent_buffer *eb;
291 int option_index = 0;
296 int corrupt_block_keys = 0;
302 c = getopt_long(ac, av, "l:c:b:eEk", long_options,
308 logical = atoll(optarg);
311 "invalid extent number\n");
319 "invalid copy number\n");
324 bytes = atoll(optarg);
327 "invalid byte count\n");
338 corrupt_block_keys = 1;
347 if (logical == 0 && !extent_tree)
355 cache_tree_init(&root_cache);
357 root = open_ctree(dev, 0, 1);
359 fprintf(stderr, "Open ctree failed\n");
363 struct btrfs_trans_handle *trans;
364 trans = btrfs_start_transaction(root, 1);
365 ret = corrupt_extent (trans, root, logical, 0);
366 btrfs_commit_transaction(trans, root);
370 struct btrfs_trans_handle *trans;
371 trans = btrfs_start_transaction(root, 1);
372 btrfs_corrupt_extent_tree(trans, root->fs_info->extent_root,
373 root->fs_info->extent_root->node);
374 btrfs_commit_transaction(trans, root);
379 bytes = root->sectorsize;
381 bytes = (bytes + root->sectorsize - 1) / root->sectorsize;
382 bytes *= root->sectorsize;
385 if (corrupt_block_keys) {
386 corrupt_keys_in_block(root, logical);
388 eb = debug_corrupt_block(root, logical,
389 root->sectorsize, copy);
390 free_extent_buffer(eb);
392 logical += root->sectorsize;
393 bytes -= root->sectorsize;