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
, mirror_num
);
55 device
= multi
->stripes
[0].dev
;
58 eb
->dev_bytenr
= multi
->stripes
[0].physical
;
60 fprintf(stdout
, "mirror %d logical %Lu physical %Lu "
61 "device %s\n", mirror_num
, (unsigned long long)bytenr
,
62 (unsigned long long)eb
->dev_bytenr
, device
->name
);
65 if (!copy
|| mirror_num
== copy
) {
66 ret
= read_extent_from_disk(eb
);
67 printf("corrupting %llu copy %d\n", eb
->start
,
69 memset(eb
->data
, 0, eb
->len
);
70 write_extent_to_disk(eb
);
74 num_copies
= btrfs_num_copies(&root
->fs_info
->mapping_tree
,
80 if (mirror_num
> num_copies
)
86 static void print_usage(void)
88 fprintf(stderr
, "usage: btrfs-map-logical [options] mount_point\n");
89 fprintf(stderr
, "\t-l Logical extent to map\n");
90 fprintf(stderr
, "\t-c Copy of the extent to read (usually 1 or 2)\n");
91 fprintf(stderr
, "\t-o Output file to hold the extent\n");
92 fprintf(stderr
, "\t-b Number of bytes to read\n");
96 static void corrupt_keys(struct btrfs_trans_handle
*trans
,
97 struct btrfs_root
*root
,
98 struct extent_buffer
*eb
)
103 struct btrfs_disk_key bad_key
;;
105 nr
= btrfs_header_nritems(eb
);
110 bad_slot
= rand() % nr
;
112 if (bad_slot
== slot
)
115 fprintf(stderr
, "corrupting keys in block %llu slot %d swapping with %d\n",
116 (unsigned long long)eb
->start
, slot
, bad_slot
);
118 if (btrfs_header_level(eb
) == 0) {
119 btrfs_item_key(eb
, &bad_key
, bad_slot
);
120 btrfs_set_item_key(eb
, &bad_key
, slot
);
122 btrfs_node_key(eb
, &bad_key
, bad_slot
);
123 btrfs_set_node_key(eb
, &bad_key
, slot
);
125 btrfs_mark_buffer_dirty(eb
);
127 csum_tree_block(root
, eb
, 0);
128 write_extent_to_disk(eb
);
133 static int corrupt_keys_in_block(struct btrfs_root
*root
, u64 bytenr
)
135 struct extent_buffer
*eb
;
137 eb
= read_tree_block(root
, bytenr
, root
->leafsize
, 0);
141 corrupt_keys(NULL
, root
, eb
);
142 free_extent_buffer(eb
);
146 static int corrupt_extent(struct btrfs_trans_handle
*trans
,
147 struct btrfs_root
*root
, u64 bytenr
, int copy
)
149 struct btrfs_key key
;
150 struct extent_buffer
*leaf
;
153 struct btrfs_path
*path
;
156 int should_del
= rand() % 3;
158 path
= btrfs_alloc_path();
160 key
.objectid
= bytenr
;
162 key
.offset
= (u64
)-1;
165 ret
= btrfs_search_slot(trans
, root
->fs_info
->extent_root
,
171 if (path
->slots
[0] == 0)
176 leaf
= path
->nodes
[0];
177 slot
= path
->slots
[0];
178 btrfs_item_key_to_cpu(leaf
, &key
, slot
);
179 if (key
.objectid
!= bytenr
)
182 if (key
.type
!= BTRFS_EXTENT_ITEM_KEY
&&
183 key
.type
!= BTRFS_TREE_BLOCK_REF_KEY
&&
184 key
.type
!= BTRFS_EXTENT_DATA_REF_KEY
&&
185 key
.type
!= BTRFS_EXTENT_REF_V0_KEY
&&
186 key
.type
!= BTRFS_SHARED_BLOCK_REF_KEY
&&
187 key
.type
!= BTRFS_SHARED_DATA_REF_KEY
)
191 fprintf(stderr
, "deleting extent record: key %Lu %u %Lu\n",
192 key
.objectid
, key
.type
, key
.offset
);
194 if (key
.type
== BTRFS_EXTENT_ITEM_KEY
) {
195 /* make sure this extent doesn't get
196 * reused for other purposes */
197 btrfs_pin_extent(root
->fs_info
,
198 key
.objectid
, key
.offset
);
201 btrfs_del_item(trans
, root
, path
);
203 fprintf(stderr
, "corrupting extent record: key %Lu %u %Lu\n",
204 key
.objectid
, key
.type
, key
.offset
);
205 ptr
= btrfs_item_ptr_offset(leaf
, slot
);
206 item_size
= btrfs_item_size_nr(leaf
, slot
);
207 memset_extent_buffer(leaf
, 0, ptr
, item_size
);
208 btrfs_mark_buffer_dirty(leaf
);
211 btrfs_release_path(NULL
, path
);
219 btrfs_free_path(path
);
223 static void btrfs_corrupt_extent_leaf(struct btrfs_trans_handle
*trans
,
224 struct btrfs_root
*root
, struct extent_buffer
*eb
)
226 u32 nr
= btrfs_header_nritems(eb
);
227 u32 victim
= rand() % nr
;
229 struct btrfs_key key
;
231 btrfs_item_key_to_cpu(eb
, &key
, victim
);
232 objectid
= key
.objectid
;
233 corrupt_extent(trans
, root
, objectid
, 1);
236 static void btrfs_corrupt_extent_tree(struct btrfs_trans_handle
*trans
,
237 struct btrfs_root
*root
, struct extent_buffer
*eb
)
245 nr
= btrfs_header_nritems(eb
);
246 if (btrfs_is_leaf(eb
)) {
247 btrfs_corrupt_extent_leaf(trans
, root
, eb
);
251 if (btrfs_header_level(eb
) == 1 && eb
!= root
->node
) {
256 for (i
= 0; i
< nr
; i
++) {
257 struct extent_buffer
*next
;
259 next
= read_tree_block(root
, btrfs_node_blockptr(eb
, i
),
260 root
->leafsize
, btrfs_node_ptr_generation(eb
, i
));
263 btrfs_corrupt_extent_tree(trans
, root
, next
);
264 free_extent_buffer(next
);
268 static struct option long_options
[] = {
269 /* { "byte-count", 1, NULL, 'b' }, */
270 { "logical", 1, NULL
, 'l' },
271 { "copy", 1, NULL
, 'c' },
272 { "bytes", 1, NULL
, 'b' },
273 { "extent-record", 0, NULL
, 'e' },
274 { "extent-tree", 0, NULL
, 'E' },
275 { "keys", 0, NULL
, 'k' },
280 int main(int ac
, char **av
)
282 struct cache_tree root_cache
;
283 struct btrfs_root
*root
;
284 struct extent_buffer
*eb
;
288 int option_index
= 0;
293 int corrupt_block_keys
= 0;
299 c
= getopt_long(ac
, av
, "l:c:eEk", long_options
,
305 logical
= atoll(optarg
);
308 "invalid extent number\n");
316 "invalid copy number\n");
321 bytes
= atoll(optarg
);
324 "invalid byte count\n");
335 corrupt_block_keys
= 1;
344 if (logical
== 0 && !extent_tree
)
352 cache_tree_init(&root_cache
);
354 root
= open_ctree(dev
, 0, 1);
356 fprintf(stderr
, "Open ctree failed\n");
360 struct btrfs_trans_handle
*trans
;
361 trans
= btrfs_start_transaction(root
, 1);
362 ret
= corrupt_extent (trans
, root
, logical
, 0);
363 btrfs_commit_transaction(trans
, root
);
367 struct btrfs_trans_handle
*trans
;
368 trans
= btrfs_start_transaction(root
, 1);
369 btrfs_corrupt_extent_tree(trans
, root
->fs_info
->extent_root
,
370 root
->fs_info
->extent_root
->node
);
371 btrfs_commit_transaction(trans
, root
);
376 bytes
= root
->sectorsize
;
378 bytes
= (bytes
+ root
->sectorsize
- 1) / root
->sectorsize
;
379 bytes
*= root
->sectorsize
;
382 if (corrupt_block_keys
) {
383 corrupt_keys_in_block(root
, logical
);
385 eb
= debug_corrupt_block(root
, logical
,
386 root
->sectorsize
, copy
);
387 free_extent_buffer(eb
);
389 logical
+= root
->sectorsize
;
390 bytes
-= root
->sectorsize
;