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.
26 #include "kerncompat.h"
30 #include "print-tree.h"
31 #include "transaction.h"
35 #define FIELD_BUF_LEN 80
37 static int debug_corrupt_block(struct extent_buffer *eb,
38 struct btrfs_root *root, u64 bytenr, u32 blocksize, u64 copy)
42 struct btrfs_multi_bio *multi = NULL;
43 struct btrfs_device *device;
49 ret = btrfs_map_block(&root->fs_info->mapping_tree, READ,
50 eb->start, &length, &multi,
53 error("cannot map block %llu length %llu mirror %d: %d",
54 (unsigned long long)eb->start,
55 (unsigned long long)length,
59 device = multi->stripes[0].dev;
62 eb->dev_bytenr = multi->stripes[0].physical;
65 "mirror %d logical %llu physical %llu device %s\n",
66 mirror_num, (unsigned long long)bytenr,
67 (unsigned long long)eb->dev_bytenr, device->name);
70 if (!copy || mirror_num == copy) {
71 ret = read_extent_from_disk(eb, 0, eb->len);
73 error("cannot read eb bytenr %llu: %s",
74 (unsigned long long)eb->dev_bytenr,
78 printf("corrupting %llu copy %d\n", eb->start,
80 memset(eb->data, 0, eb->len);
81 ret = write_extent_to_disk(eb);
83 error("cannot write eb bytenr %llu: %s",
84 (unsigned long long)eb->dev_bytenr,
91 num_copies = btrfs_num_copies(&root->fs_info->mapping_tree,
97 if (mirror_num > num_copies)
104 static void print_usage(int ret)
106 printf("usage: btrfs-corrupt-block [options] device\n");
107 printf("\t-l Logical extent to be corrupted\n");
108 printf("\t-c Copy of the extent to be corrupted (usually 1 or 2, default: 0)\n");
109 printf("\t-b Number of bytes to be corrupted\n");
110 printf("\t-e Extent to be corrupted\n");
111 printf("\t-E The whole extent tree to be corrupted\n");
112 printf("\t-u Given chunk item to be corrupted\n");
113 printf("\t-U The whole chunk tree to be corrupted\n");
114 printf("\t-i The inode item to corrupt (must also specify the field to corrupt)\n");
115 printf("\t-x The file extent item to corrupt (must also specify -i for the inode and -f for the field to corrupt)\n");
116 printf("\t-m The metadata block to corrupt (must also specify -f for the field to corrupt)\n");
117 printf("\t-K The key to corrupt in the format <num>,<num>,<num> (must also specify -f for the field)\n");
118 printf("\t-f The field in the item to corrupt\n");
119 printf("\t-I An item to corrupt (must also specify the field to corrupt and a root+key for the item)\n");
120 printf("\t-D Corrupt a dir item, must specify key and field\n");
121 printf("\t-d Delete this item (must specify -K)\n");
122 printf("\t-r Operate on this root (only works with -d)\n");
123 printf("\t-C Delete a csum for the specified bytenr. When used with -b it'll delete that many bytes, otherwise it's just sectorsize\n");
127 static void corrupt_keys(struct btrfs_trans_handle *trans,
128 struct btrfs_root *root,
129 struct extent_buffer *eb)
134 struct btrfs_disk_key bad_key;;
136 nr = btrfs_header_nritems(eb);
140 slot = rand_range(nr);
141 bad_slot = rand_range(nr);
143 if (bad_slot == slot)
147 "corrupting keys in block %llu slot %d swapping with %d\n",
148 (unsigned long long)eb->start, slot, bad_slot);
150 if (btrfs_header_level(eb) == 0) {
151 btrfs_item_key(eb, &bad_key, bad_slot);
152 btrfs_set_item_key(eb, &bad_key, slot);
154 btrfs_node_key(eb, &bad_key, bad_slot);
155 btrfs_set_node_key(eb, &bad_key, slot);
157 btrfs_mark_buffer_dirty(eb);
160 btrfs_super_csum_size(root->fs_info->super_copy);
161 csum_tree_block_size(eb, csum_size, 0);
162 write_extent_to_disk(eb);
167 static int corrupt_keys_in_block(struct btrfs_root *root, u64 bytenr)
169 struct extent_buffer *eb;
171 eb = read_tree_block(root, bytenr, root->nodesize, 0);
172 if (!extent_buffer_uptodate(eb))
175 corrupt_keys(NULL, root, eb);
176 free_extent_buffer(eb);
180 static int corrupt_extent(struct btrfs_trans_handle *trans,
181 struct btrfs_root *root, u64 bytenr, u64 copy)
183 struct btrfs_key key;
184 struct extent_buffer *leaf;
187 struct btrfs_path *path;
190 int should_del = rand_range(3);
192 path = btrfs_alloc_path();
196 key.objectid = bytenr;
198 key.offset = (u64)-1;
201 ret = btrfs_search_slot(trans, root->fs_info->extent_root,
207 if (path->slots[0] == 0)
212 leaf = path->nodes[0];
213 slot = path->slots[0];
214 btrfs_item_key_to_cpu(leaf, &key, slot);
215 if (key.objectid != bytenr)
218 if (key.type != BTRFS_EXTENT_ITEM_KEY &&
219 key.type != BTRFS_METADATA_ITEM_KEY &&
220 key.type != BTRFS_TREE_BLOCK_REF_KEY &&
221 key.type != BTRFS_EXTENT_DATA_REF_KEY &&
222 key.type != BTRFS_EXTENT_REF_V0_KEY &&
223 key.type != BTRFS_SHARED_BLOCK_REF_KEY &&
224 key.type != BTRFS_SHARED_DATA_REF_KEY)
229 "deleting extent record: key %llu %u %llu\n",
230 key.objectid, key.type, key.offset);
232 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
233 /* make sure this extent doesn't get
234 * reused for other purposes */
235 btrfs_pin_extent(root->fs_info,
236 key.objectid, key.offset);
239 btrfs_del_item(trans, root, path);
242 "corrupting extent record: key %llu %u %llu\n",
243 key.objectid, key.type, key.offset);
244 ptr = btrfs_item_ptr_offset(leaf, slot);
245 item_size = btrfs_item_size_nr(leaf, slot);
246 memset_extent_buffer(leaf, 0, ptr, item_size);
247 btrfs_mark_buffer_dirty(leaf);
250 btrfs_release_path(path);
258 btrfs_free_path(path);
262 static void btrfs_corrupt_extent_leaf(struct btrfs_trans_handle *trans,
263 struct btrfs_root *root,
264 struct extent_buffer *eb)
266 u32 nr = btrfs_header_nritems(eb);
267 u32 victim = rand_range(nr);
269 struct btrfs_key key;
271 btrfs_item_key_to_cpu(eb, &key, victim);
272 objectid = key.objectid;
273 corrupt_extent(trans, root, objectid, 1);
276 static void btrfs_corrupt_extent_tree(struct btrfs_trans_handle *trans,
277 struct btrfs_root *root,
278 struct extent_buffer *eb)
285 if (btrfs_is_leaf(eb)) {
286 btrfs_corrupt_extent_leaf(trans, root, eb);
290 if (btrfs_header_level(eb) == 1 && eb != root->node) {
295 for (i = 0; i < btrfs_header_nritems(eb); i++) {
296 struct extent_buffer *next;
298 next = read_tree_block(root, btrfs_node_blockptr(eb, i),
300 btrfs_node_ptr_generation(eb, i));
301 if (!extent_buffer_uptodate(next))
303 btrfs_corrupt_extent_tree(trans, root, next);
304 free_extent_buffer(next);
308 enum btrfs_inode_field {
309 BTRFS_INODE_FIELD_ISIZE,
310 BTRFS_INODE_FIELD_NBYTES,
311 BTRFS_INODE_FIELD_NLINK,
312 BTRFS_INODE_FIELD_GENERATION,
313 BTRFS_INODE_FIELD_TRANSID,
314 BTRFS_INODE_FIELD_BLOCK_GROUP,
315 BTRFS_INODE_FIELD_MODE,
316 BTRFS_INODE_FIELD_UID,
317 BTRFS_INODE_FIELD_GID,
318 BTRFS_INODE_FIELD_BAD,
321 enum btrfs_file_extent_field {
322 BTRFS_FILE_EXTENT_DISK_BYTENR,
323 BTRFS_FILE_EXTENT_BAD,
326 enum btrfs_dir_item_field {
328 BTRFS_DIR_ITEM_LOCATION_OBJECTID,
332 enum btrfs_metadata_block_field {
333 BTRFS_METADATA_BLOCK_GENERATION,
334 BTRFS_METADATA_BLOCK_SHIFT_ITEMS,
335 BTRFS_METADATA_BLOCK_BAD,
338 enum btrfs_item_field {
343 enum btrfs_key_field {
350 static enum btrfs_inode_field convert_inode_field(char *field)
352 if (!strncmp(field, "isize", FIELD_BUF_LEN))
353 return BTRFS_INODE_FIELD_ISIZE;
354 if (!strncmp(field, "nbytes", FIELD_BUF_LEN))
355 return BTRFS_INODE_FIELD_NBYTES;
356 if (!strncmp(field, "nlink", FIELD_BUF_LEN))
357 return BTRFS_INODE_FIELD_NLINK;
358 if (!strncmp(field, "generation", FIELD_BUF_LEN))
359 return BTRFS_INODE_FIELD_GENERATION;
360 if (!strncmp(field, "transid", FIELD_BUF_LEN))
361 return BTRFS_INODE_FIELD_TRANSID;
362 if (!strncmp(field, "block_group", FIELD_BUF_LEN))
363 return BTRFS_INODE_FIELD_BLOCK_GROUP;
364 if (!strncmp(field, "mode", FIELD_BUF_LEN))
365 return BTRFS_INODE_FIELD_MODE;
366 if (!strncmp(field, "uid", FIELD_BUF_LEN))
367 return BTRFS_INODE_FIELD_UID;
368 if (!strncmp(field, "gid", FIELD_BUF_LEN))
369 return BTRFS_INODE_FIELD_GID;
370 return BTRFS_INODE_FIELD_BAD;
373 static enum btrfs_file_extent_field convert_file_extent_field(char *field)
375 if (!strncmp(field, "disk_bytenr", FIELD_BUF_LEN))
376 return BTRFS_FILE_EXTENT_DISK_BYTENR;
377 return BTRFS_FILE_EXTENT_BAD;
380 static enum btrfs_metadata_block_field
381 convert_metadata_block_field(char *field)
383 if (!strncmp(field, "generation", FIELD_BUF_LEN))
384 return BTRFS_METADATA_BLOCK_GENERATION;
385 if (!strncmp(field, "shift_items", FIELD_BUF_LEN))
386 return BTRFS_METADATA_BLOCK_SHIFT_ITEMS;
387 return BTRFS_METADATA_BLOCK_BAD;
390 static enum btrfs_key_field convert_key_field(char *field)
392 if (!strncmp(field, "objectid", FIELD_BUF_LEN))
393 return BTRFS_KEY_OBJECTID;
394 if (!strncmp(field, "type", FIELD_BUF_LEN))
395 return BTRFS_KEY_TYPE;
396 if (!strncmp(field, "offset", FIELD_BUF_LEN))
397 return BTRFS_KEY_OFFSET;
398 return BTRFS_KEY_BAD;
401 static enum btrfs_item_field convert_item_field(char *field)
403 if (!strncmp(field, "offset", FIELD_BUF_LEN))
404 return BTRFS_ITEM_OFFSET;
405 return BTRFS_ITEM_BAD;
408 static enum btrfs_dir_item_field convert_dir_item_field(char *field)
410 if (!strncmp(field, "name", FIELD_BUF_LEN))
411 return BTRFS_DIR_ITEM_NAME;
412 if (!strncmp(field, "location_objectid", FIELD_BUF_LEN))
413 return BTRFS_DIR_ITEM_LOCATION_OBJECTID;
414 return BTRFS_DIR_ITEM_BAD;
417 static u64 generate_u64(u64 orig)
422 } while (ret == orig);
426 static u32 generate_u32(u32 orig)
431 } while (ret == orig);
435 static u8 generate_u8(u8 orig)
440 } while (ret == orig);
444 static int corrupt_key(struct btrfs_root *root, struct btrfs_key *key,
447 enum btrfs_key_field corrupt_field = convert_key_field(field);
448 struct btrfs_path *path;
449 struct btrfs_trans_handle *trans;
452 root = root->fs_info->fs_root;
453 if (corrupt_field == BTRFS_KEY_BAD) {
454 fprintf(stderr, "Invalid field %s\n", field);
458 path = btrfs_alloc_path();
462 trans = btrfs_start_transaction(root, 1);
464 btrfs_free_path(path);
465 return PTR_ERR(trans);
468 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
472 fprintf(stderr, "Couldn't find the key to corrupt\n");
477 switch (corrupt_field) {
478 case BTRFS_KEY_OBJECTID:
479 key->objectid = generate_u64(key->objectid);
482 key->type = generate_u8(key->type);
484 case BTRFS_KEY_OFFSET:
485 key->offset = generate_u64(key->objectid);
488 fprintf(stderr, "Invalid field %s, %d\n", field,
494 btrfs_set_item_key_unsafe(root, path, key);
496 btrfs_free_path(path);
497 btrfs_commit_transaction(trans, root);
501 static int corrupt_dir_item(struct btrfs_root *root, struct btrfs_key *key,
504 struct btrfs_trans_handle *trans;
505 struct btrfs_dir_item *di;
506 struct btrfs_path *path;
508 struct btrfs_key location;
509 struct btrfs_disk_key disk_key;
510 unsigned long name_ptr;
511 enum btrfs_dir_item_field corrupt_field =
512 convert_dir_item_field(field);
517 if (corrupt_field == BTRFS_DIR_ITEM_BAD) {
518 fprintf(stderr, "Invalid field %s\n", field);
522 path = btrfs_alloc_path();
526 trans = btrfs_start_transaction(root, 1);
528 btrfs_free_path(path);
529 return PTR_ERR(trans);
532 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
536 fprintf(stderr, "Error searching for dir item %d\n", ret);
540 di = btrfs_item_ptr(path->nodes[0], path->slots[0],
541 struct btrfs_dir_item);
543 switch (corrupt_field) {
544 case BTRFS_DIR_ITEM_NAME:
545 name_len = btrfs_dir_name_len(path->nodes[0], di);
546 name_ptr = (unsigned long)(di + 1);
547 read_extent_buffer(path->nodes[0], name, name_ptr, name_len);
549 write_extent_buffer(path->nodes[0], name, name_ptr, name_len);
550 btrfs_mark_buffer_dirty(path->nodes[0]);
552 case BTRFS_DIR_ITEM_LOCATION_OBJECTID:
553 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &location);
554 bogus = generate_u64(location.objectid);
555 location.objectid = bogus;
556 btrfs_cpu_key_to_disk(&disk_key, &location);
557 btrfs_set_dir_item_key(path->nodes[0], di, &disk_key);
558 btrfs_mark_buffer_dirty(path->nodes[0]);
565 btrfs_commit_transaction(trans, root);
566 btrfs_free_path(path);
570 static int corrupt_inode(struct btrfs_trans_handle *trans,
571 struct btrfs_root *root, u64 inode, char *field)
573 struct btrfs_inode_item *ei;
574 struct btrfs_path *path;
575 struct btrfs_key key;
576 enum btrfs_inode_field corrupt_field = convert_inode_field(field);
581 if (corrupt_field == BTRFS_INODE_FIELD_BAD) {
582 fprintf(stderr, "Invalid field %s\n", field);
586 key.objectid = inode;
587 key.type = BTRFS_INODE_ITEM_KEY;
588 key.offset = (u64)-1;
590 path = btrfs_alloc_path();
594 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
598 if (!path->slots[0]) {
599 fprintf(stderr, "Couldn't find inode %Lu\n", inode);
607 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
608 if (key.objectid != inode) {
609 fprintf(stderr, "Couldn't find inode %Lu\n", inode);
614 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
615 struct btrfs_inode_item);
616 switch (corrupt_field) {
617 case BTRFS_INODE_FIELD_ISIZE:
618 orig = btrfs_inode_size(path->nodes[0], ei);
619 bogus = generate_u64(orig);
620 btrfs_set_inode_size(path->nodes[0], ei, bogus);
622 case BTRFS_INODE_FIELD_NBYTES:
623 orig = btrfs_inode_nbytes(path->nodes[0], ei);
624 bogus = generate_u64(orig);
625 btrfs_set_inode_nbytes(path->nodes[0], ei, bogus);
627 case BTRFS_INODE_FIELD_NLINK:
628 orig = btrfs_inode_nlink(path->nodes[0], ei);
629 bogus = generate_u32(orig);
630 btrfs_set_inode_nlink(path->nodes[0], ei, bogus);
632 case BTRFS_INODE_FIELD_GENERATION:
633 orig = btrfs_inode_generation(path->nodes[0], ei);
634 bogus = generate_u64(orig);
635 btrfs_set_inode_generation(path->nodes[0], ei, bogus);
637 case BTRFS_INODE_FIELD_TRANSID:
638 orig = btrfs_inode_transid(path->nodes[0], ei);
639 bogus = generate_u64(orig);
640 btrfs_set_inode_transid(path->nodes[0], ei, bogus);
642 case BTRFS_INODE_FIELD_BLOCK_GROUP:
643 orig = btrfs_inode_block_group(path->nodes[0], ei);
644 bogus = generate_u64(orig);
645 btrfs_set_inode_block_group(path->nodes[0], ei, bogus);
647 case BTRFS_INODE_FIELD_MODE:
648 orig = btrfs_inode_mode(path->nodes[0], ei);
649 bogus = generate_u32(orig);
650 btrfs_set_inode_mode(path->nodes[0], ei, bogus);
652 case BTRFS_INODE_FIELD_UID:
653 orig = btrfs_inode_uid(path->nodes[0], ei);
654 bogus = generate_u32(orig);
655 btrfs_set_inode_uid(path->nodes[0], ei, bogus);
657 case BTRFS_INODE_FIELD_GID:
658 orig = btrfs_inode_gid(path->nodes[0], ei);
659 bogus = generate_u32(orig);
660 btrfs_set_inode_gid(path->nodes[0], ei, bogus);
666 btrfs_mark_buffer_dirty(path->nodes[0]);
668 btrfs_free_path(path);
672 static int corrupt_file_extent(struct btrfs_trans_handle *trans,
673 struct btrfs_root *root, u64 inode, u64 extent,
676 struct btrfs_file_extent_item *fi;
677 struct btrfs_path *path;
678 struct btrfs_key key;
679 enum btrfs_file_extent_field corrupt_field;
684 corrupt_field = convert_file_extent_field(field);
685 if (corrupt_field == BTRFS_FILE_EXTENT_BAD) {
686 fprintf(stderr, "Invalid field %s\n", field);
690 key.objectid = inode;
691 key.type = BTRFS_EXTENT_DATA_KEY;
694 path = btrfs_alloc_path();
698 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
702 fprintf(stderr, "Couldn't find extent %llu for inode %llu\n",
708 fi = btrfs_item_ptr(path->nodes[0], path->slots[0],
709 struct btrfs_file_extent_item);
710 switch (corrupt_field) {
711 case BTRFS_FILE_EXTENT_DISK_BYTENR:
712 orig = btrfs_file_extent_disk_bytenr(path->nodes[0], fi);
713 bogus = generate_u64(orig);
714 btrfs_set_file_extent_disk_bytenr(path->nodes[0], fi, bogus);
720 btrfs_mark_buffer_dirty(path->nodes[0]);
722 btrfs_free_path(path);
726 static void shift_items(struct btrfs_root *root, struct extent_buffer *eb)
728 int nritems = btrfs_header_nritems(eb);
729 int shift_space = btrfs_leaf_free_space(root, eb) / 2;
730 int slot = nritems / 2;
732 unsigned int data_end = btrfs_item_offset_nr(eb, nritems - 1);
734 /* Shift the item data up to and including slot back by shift space */
735 memmove_extent_buffer(eb, btrfs_leaf_data(eb) + data_end - shift_space,
736 btrfs_leaf_data(eb) + data_end,
737 btrfs_item_offset_nr(eb, slot - 1) - data_end);
739 /* Now update the item pointers. */
740 for (i = nritems - 1; i >= slot; i--) {
741 u32 offset = btrfs_item_offset_nr(eb, i);
742 offset -= shift_space;
743 btrfs_set_item_offset(eb, btrfs_item_nr(i), offset);
747 static int corrupt_metadata_block(struct btrfs_root *root, u64 block,
750 struct btrfs_trans_handle *trans;
751 struct btrfs_path *path;
752 struct extent_buffer *eb;
753 struct btrfs_key key, root_key;
754 enum btrfs_metadata_block_field corrupt_field;
760 corrupt_field = convert_metadata_block_field(field);
761 if (corrupt_field == BTRFS_METADATA_BLOCK_BAD) {
762 fprintf(stderr, "Invalid field %s\n", field);
766 eb = read_tree_block(root, block, root->nodesize, 0);
767 if (!extent_buffer_uptodate(eb)) {
768 fprintf(stderr, "Couldn't read in tree block %s\n", field);
771 root_objectid = btrfs_header_owner(eb);
772 level = btrfs_header_level(eb);
774 btrfs_node_key_to_cpu(eb, &key, 0);
776 btrfs_item_key_to_cpu(eb, &key, 0);
777 free_extent_buffer(eb);
779 root_key.objectid = root_objectid;
780 root_key.type = BTRFS_ROOT_ITEM_KEY;
781 root_key.offset = (u64)-1;
783 root = btrfs_read_fs_root(root->fs_info, &root_key);
785 fprintf(stderr, "Couldn't find owner root %llu\n",
787 return PTR_ERR(root);
790 path = btrfs_alloc_path();
794 trans = btrfs_start_transaction(root, 1);
796 btrfs_free_path(path);
797 fprintf(stderr, "Couldn't start transaction %ld\n",
799 return PTR_ERR(trans);
802 path->lowest_level = level;
803 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
805 fprintf(stderr, "Error searching to node %d\n", ret);
808 eb = path->nodes[level];
811 switch (corrupt_field) {
812 case BTRFS_METADATA_BLOCK_GENERATION:
813 orig = btrfs_header_generation(eb);
814 bogus = generate_u64(orig);
815 btrfs_set_header_generation(eb, bogus);
817 case BTRFS_METADATA_BLOCK_SHIFT_ITEMS:
818 shift_items(root, path->nodes[level]);
824 btrfs_mark_buffer_dirty(path->nodes[level]);
826 btrfs_commit_transaction(trans, root);
827 btrfs_free_path(path);
831 static int corrupt_btrfs_item(struct btrfs_root *root, struct btrfs_key *key,
834 struct btrfs_trans_handle *trans;
835 struct btrfs_path *path;
836 enum btrfs_item_field corrupt_field;
840 corrupt_field = convert_item_field(field);
841 if (corrupt_field == BTRFS_ITEM_BAD) {
842 fprintf(stderr, "Invalid field %s\n", field);
846 path = btrfs_alloc_path();
850 trans = btrfs_start_transaction(root, 1);
852 btrfs_free_path(path);
853 fprintf(stderr, "Couldn't start transaction %ld\n",
855 return PTR_ERR(trans);
858 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
860 fprintf(stderr, "Error searching to node %d\n", ret);
865 switch (corrupt_field) {
866 case BTRFS_ITEM_OFFSET:
867 orig = btrfs_item_offset_nr(path->nodes[0], path->slots[0]);
868 bogus = generate_u32(orig);
869 btrfs_set_item_offset(path->nodes[0],
870 btrfs_item_nr(path->slots[0]), bogus);
876 btrfs_mark_buffer_dirty(path->nodes[0]);
878 btrfs_commit_transaction(trans, root);
879 btrfs_free_path(path);
883 static int delete_item(struct btrfs_root *root, struct btrfs_key *key)
885 struct btrfs_trans_handle *trans;
886 struct btrfs_path *path;
889 path = btrfs_alloc_path();
893 trans = btrfs_start_transaction(root, 1);
895 btrfs_free_path(path);
896 fprintf(stderr, "Couldn't start transaction %ld\n",
898 return PTR_ERR(trans);
901 ret = btrfs_search_slot(trans, root, key, path, -1, 1);
905 fprintf(stderr, "Error searching to node %d\n", ret);
908 ret = btrfs_del_item(trans, root, path);
909 btrfs_mark_buffer_dirty(path->nodes[0]);
911 btrfs_commit_transaction(trans, root);
912 btrfs_free_path(path);
916 static int delete_csum(struct btrfs_root *root, u64 bytenr, u64 bytes)
918 struct btrfs_trans_handle *trans;
921 root = root->fs_info->csum_root;
922 trans = btrfs_start_transaction(root, 1);
924 fprintf(stderr, "Couldn't start transaction %ld\n",
926 return PTR_ERR(trans);
929 ret = btrfs_del_csums(trans, root, bytenr, bytes);
931 fprintf(stderr, "Error deleting csums %d\n", ret);
932 btrfs_commit_transaction(trans, root);
936 /* corrupt item using NO cow.
937 * Because chunk recover will recover based on whole partition scanning,
938 * If using COW, chunk recover will use the old item to recover,
939 * which is still OK but we want to check the ability to rebuild chunk
940 * not only restore the old ones */
941 static int corrupt_item_nocow(struct btrfs_trans_handle *trans,
942 struct btrfs_root *root, struct btrfs_path *path,
946 struct btrfs_key key;
947 struct extent_buffer *leaf;
952 leaf = path->nodes[0];
953 slot = path->slots[0];
954 /* Not deleting the first item of a leaf to keep leaf structure */
957 /* Only accept valid eb */
958 if (slot >= btrfs_header_nritems(leaf)) {
959 error("invalid eb: no data or slot out of range: %d >= %d",
960 slot, btrfs_header_nritems(leaf));
963 btrfs_item_key_to_cpu(leaf, &key, slot);
965 fprintf(stdout, "Deleting key and data [%llu, %u, %llu].\n",
966 key.objectid, key.type, key.offset);
967 btrfs_del_item(trans, root, path);
969 fprintf(stdout, "Corrupting key and data [%llu, %u, %llu].\n",
970 key.objectid, key.type, key.offset);
971 ptr = btrfs_item_ptr_offset(leaf, slot);
972 item_size = btrfs_item_size_nr(leaf, slot);
973 memset_extent_buffer(leaf, 0, ptr, item_size);
974 btrfs_mark_buffer_dirty(leaf);
978 static int corrupt_chunk_tree(struct btrfs_trans_handle *trans,
979 struct btrfs_root *root)
984 struct btrfs_path *path;
985 struct btrfs_key key;
986 struct btrfs_key found_key;
987 struct extent_buffer *leaf;
989 path = btrfs_alloc_path();
993 key.objectid = (u64)-1;
994 key.offset = (u64)-1;
997 /* Here, cow and ins_len must equals 0 for the following reasons:
998 * 1) chunk recover is based on disk scanning, so COW should be
999 * disabled in case the original chunk being scanned and
1000 * recovered using the old chunk.
1001 * 2) if cow = 0, ins_len must also be set to 0, or BUG_ON will be
1004 ret = btrfs_search_slot(trans, root, &key, path, 0, 0);
1007 fprintf(stderr, "Error searching tree\n");
1010 /* corrupt/del dev_item first */
1011 while (!btrfs_previous_item(root, path, 0, BTRFS_DEV_ITEM_KEY)) {
1012 slot = path->slots[0];
1013 leaf = path->nodes[0];
1014 del = rand_range(3);
1015 /* Never delete the first item to keep the leaf structure */
1016 if (path->slots[0] == 0)
1018 ret = corrupt_item_nocow(trans, root, path, del);
1022 btrfs_release_path(path);
1024 /* Here, cow and ins_len must equals 0 for the following reasons:
1025 * 1) chunk recover is based on disk scanning, so COW should be
1026 * disabled in case the original chunk being scanned and
1027 * recovered using the old chunk.
1028 * 2) if cow = 0, ins_len must also be set to 0, or BUG_ON will be
1031 ret = btrfs_search_slot(trans, root, &key, path, 0, 0);
1034 fprintf(stderr, "Error searching tree\n");
1037 /* corrupt/del chunk then*/
1038 while (!btrfs_previous_item(root, path, 0, BTRFS_CHUNK_ITEM_KEY)) {
1039 slot = path->slots[0];
1040 leaf = path->nodes[0];
1041 del = rand_range(3);
1042 btrfs_item_key_to_cpu(leaf, &found_key, slot);
1043 ret = corrupt_item_nocow(trans, root, path, del);
1048 btrfs_free_path(path);
1051 static int find_chunk_offset(struct btrfs_root *root,
1052 struct btrfs_path *path, u64 offset)
1054 struct btrfs_key key;
1057 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
1058 key.type = BTRFS_CHUNK_ITEM_KEY;
1059 key.offset = offset;
1061 /* Here, cow and ins_len must equals 0 for following reasons:
1062 * 1) chunk recover is based on disk scanning, so COW should
1063 * be disabled in case the original chunk being scanned
1064 * and recovered using the old chunk.
1065 * 2) if cow = 0, ins_len must also be set to 0, or BUG_ON
1066 * will be triggered.
1068 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1070 fprintf(stderr, "Can't find chunk with given offset %llu\n",
1075 fprintf(stderr, "Error searching chunk\n");
1082 int main(int argc, char **argv)
1084 struct cache_tree root_cache;
1085 struct btrfs_key key;
1086 struct btrfs_root *root;
1088 /* chunk offset can be 0,so change to (u64)-1 */
1089 u64 logical = (u64)-1;
1094 int extent_tree = 0;
1095 int corrupt_block_keys = 0;
1098 int corrupt_item = 0;
1101 u64 metadata_block = 0;
1103 u64 file_extent = (u64)-1;
1104 u64 root_objectid = 0;
1105 u64 csum_bytenr = 0;
1106 char field[FIELD_BUF_LEN];
1109 memset(&key, 0, sizeof(key));
1113 static const struct option long_options[] = {
1114 /* { "byte-count", 1, NULL, 'b' }, */
1115 { "logical", required_argument, NULL, 'l' },
1116 { "copy", required_argument, NULL, 'c' },
1117 { "bytes", required_argument, NULL, 'b' },
1118 { "extent-record", no_argument, NULL, 'e' },
1119 { "extent-tree", no_argument, NULL, 'E' },
1120 { "keys", no_argument, NULL, 'k' },
1121 { "chunk-record", no_argument, NULL, 'u' },
1122 { "chunk-tree", no_argument, NULL, 'U' },
1123 { "inode", required_argument, NULL, 'i'},
1124 { "file-extent", required_argument, NULL, 'x'},
1125 { "metadata-block", required_argument, NULL, 'm'},
1126 { "field", required_argument, NULL, 'f'},
1127 { "key", required_argument, NULL, 'K'},
1128 { "item", no_argument, NULL, 'I'},
1129 { "dir-item", no_argument, NULL, 'D'},
1130 { "delete", no_argument, NULL, 'd'},
1131 { "root", no_argument, NULL, 'r'},
1132 { "csum", required_argument, NULL, 'C'},
1133 { "help", no_argument, NULL, GETOPT_VAL_HELP},
1134 { NULL, 0, NULL, 0 }
1137 c = getopt_long(argc, argv, "l:c:b:eEkuUi:f:x:m:K:IDdr:C:",
1138 long_options, NULL);
1143 logical = arg_strtou64(optarg);
1146 copy = arg_strtou64(optarg);
1149 bytes = arg_strtou64(optarg);
1158 corrupt_block_keys = 1;
1167 inode = arg_strtou64(optarg);
1170 strncpy(field, optarg, FIELD_BUF_LEN);
1173 file_extent = arg_strtou64(optarg);
1176 metadata_block = arg_strtou64(optarg);
1179 ret = sscanf(optarg, "%llu,%u,%llu",
1181 (unsigned int *)&key.type,
1184 fprintf(stderr, "error reading key "
1199 root_objectid = arg_strtou64(optarg);
1202 csum_bytenr = arg_strtou64(optarg);
1204 case GETOPT_VAL_HELP:
1206 print_usage(c != GETOPT_VAL_HELP);
1210 if (check_argc_min(argc - optind, 1))
1215 cache_tree_init(&root_cache);
1217 root = open_ctree(dev, 0, OPEN_CTREE_WRITES);
1219 fprintf(stderr, "Open ctree failed\n");
1223 struct btrfs_trans_handle *trans;
1225 if (logical == (u64)-1)
1227 trans = btrfs_start_transaction(root, 1);
1228 ret = corrupt_extent (trans, root, logical, 0);
1229 btrfs_commit_transaction(trans, root);
1233 struct btrfs_trans_handle *trans;
1234 trans = btrfs_start_transaction(root, 1);
1235 btrfs_corrupt_extent_tree(trans, root->fs_info->extent_root,
1236 root->fs_info->extent_root->node);
1237 btrfs_commit_transaction(trans, root);
1241 struct btrfs_trans_handle *trans;
1242 struct btrfs_path *path;
1245 if (logical == (u64)-1)
1247 del = rand_range(3);
1248 path = btrfs_alloc_path();
1250 fprintf(stderr, "path allocation failed\n");
1254 if (find_chunk_offset(root->fs_info->chunk_root, path,
1256 btrfs_free_path(path);
1259 trans = btrfs_start_transaction(root, 1);
1260 ret = corrupt_item_nocow(trans, root->fs_info->chunk_root,
1263 fprintf(stderr, "Failed to corrupt chunk record\n");
1264 btrfs_commit_transaction(trans, root);
1268 struct btrfs_trans_handle *trans;
1269 trans = btrfs_start_transaction(root, 1);
1270 ret = corrupt_chunk_tree(trans, root->fs_info->chunk_root);
1272 fprintf(stderr, "Failed to corrupt chunk tree\n");
1273 btrfs_commit_transaction(trans, root);
1277 struct btrfs_trans_handle *trans;
1282 trans = btrfs_start_transaction(root, 1);
1283 if (file_extent == (u64)-1) {
1284 printf("corrupting inode\n");
1285 ret = corrupt_inode(trans, root, inode, field);
1287 printf("corrupting file extent\n");
1288 ret = corrupt_file_extent(trans, root, inode,
1289 file_extent, field);
1291 btrfs_commit_transaction(trans, root);
1294 if (metadata_block) {
1297 ret = corrupt_metadata_block(root, metadata_block, field);
1301 if (!key.objectid || *field == 0)
1303 ret = corrupt_dir_item(root, &key, field);
1307 ret = delete_csum(root, csum_bytenr, bytes);
1313 ret = corrupt_btrfs_item(root, &key, field);
1316 struct btrfs_root *target = root;
1320 if (root_objectid) {
1321 struct btrfs_key root_key;
1323 root_key.objectid = root_objectid;
1324 root_key.type = BTRFS_ROOT_ITEM_KEY;
1325 root_key.offset = (u64)-1;
1327 target = btrfs_read_fs_root(root->fs_info, &root_key);
1328 if (IS_ERR(target)) {
1329 fprintf(stderr, "Couldn't find root %llu\n",
1330 (unsigned long long)root_objectid);
1334 ret = delete_item(target, &key);
1337 if (key.objectid || key.offset || key.type) {
1340 ret = corrupt_key(root, &key, field);
1344 * If we made it here and we have extent set then we didn't specify
1345 * inode and we're screwed.
1347 if (file_extent != (u64)-1)
1350 if (logical == (u64)-1)
1354 bytes = root->sectorsize;
1356 bytes = (bytes + root->sectorsize - 1) / root->sectorsize;
1357 bytes *= root->sectorsize;
1360 if (corrupt_block_keys) {
1361 corrupt_keys_in_block(root, logical);
1363 struct extent_buffer *eb;
1365 eb = btrfs_find_create_tree_block(root->fs_info,
1366 logical, root->sectorsize);
1369 "not enough memory to allocate extent buffer for bytenr %llu",
1370 (unsigned long long)logical);
1375 debug_corrupt_block(eb, root, logical, root->sectorsize,
1377 free_extent_buffer(eb);
1379 logical += root->sectorsize;
1380 bytes -= root->sectorsize;