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"
36 #define FIELD_BUF_LEN 80
38 struct extent_buffer *debug_corrupt_block(struct btrfs_root *root, u64 bytenr,
39 u32 blocksize, u64 copy)
42 struct extent_buffer *eb;
44 struct btrfs_multi_bio *multi = NULL;
45 struct btrfs_device *device;
49 eb = btrfs_find_create_tree_block(root, bytenr, blocksize);
55 ret = btrfs_map_block(&root->fs_info->mapping_tree, READ,
56 eb->start, &length, &multi,
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);
72 printf("corrupting %llu copy %d\n", eb->start,
74 memset(eb->data, 0, eb->len);
75 write_extent_to_disk(eb);
79 num_copies = btrfs_num_copies(&root->fs_info->mapping_tree,
85 if (mirror_num > num_copies)
91 static void print_usage(void)
93 fprintf(stderr, "usage: btrfs-corrupt-block [options] device\n");
94 fprintf(stderr, "\t-l Logical extent to be corrupted\n");
95 fprintf(stderr, "\t-c Copy of the extent to be corrupted"
96 " (usually 1 or 2, default: 0)\n");
97 fprintf(stderr, "\t-b Number of bytes to be corrupted\n");
98 fprintf(stderr, "\t-e Extent to be corrupted\n");
99 fprintf(stderr, "\t-E The whole extent tree to be corrupted\n");
100 fprintf(stderr, "\t-u Given chunk item to be corrupted\n");
101 fprintf(stderr, "\t-U The whole chunk tree to be corrupted\n");
102 fprintf(stderr, "\t-i The inode item to corrupt (must also specify "
103 "the field to corrupt)\n");
104 fprintf(stderr, "\t-x The file extent item to corrupt (must also "
105 "specify -i for the inode and -f for the field to corrupt)\n");
106 fprintf(stderr, "\t-m The metadata block to corrupt (must also "
107 "specify -f for the field to corrupt)\n");
108 fprintf(stderr, "\t-K The key to corrupt in the format "
109 "<num>,<num>,<num> (must also specify -f for the field)\n");
110 fprintf(stderr, "\t-f The field in the item to corrupt\n");
111 fprintf(stderr, "\t-I An item to corrupt (must also specify the field "
112 "to corrupt and a root+key for the item)\n");
113 fprintf(stderr, "\t-D Corrupt a dir item, must specify key and field\n");
117 static void corrupt_keys(struct btrfs_trans_handle *trans,
118 struct btrfs_root *root,
119 struct extent_buffer *eb)
124 struct btrfs_disk_key bad_key;;
126 nr = btrfs_header_nritems(eb);
131 bad_slot = rand() % nr;
133 if (bad_slot == slot)
137 "corrupting keys in block %llu slot %d swapping with %d\n",
138 (unsigned long long)eb->start, slot, bad_slot);
140 if (btrfs_header_level(eb) == 0) {
141 btrfs_item_key(eb, &bad_key, bad_slot);
142 btrfs_set_item_key(eb, &bad_key, slot);
144 btrfs_node_key(eb, &bad_key, bad_slot);
145 btrfs_set_node_key(eb, &bad_key, slot);
147 btrfs_mark_buffer_dirty(eb);
150 btrfs_super_csum_size(root->fs_info->super_copy);
151 csum_tree_block_size(eb, csum_size, 0);
152 write_extent_to_disk(eb);
157 static int corrupt_keys_in_block(struct btrfs_root *root, u64 bytenr)
159 struct extent_buffer *eb;
161 eb = read_tree_block(root, bytenr, root->leafsize, 0);
165 corrupt_keys(NULL, root, eb);
166 free_extent_buffer(eb);
170 static int corrupt_extent(struct btrfs_trans_handle *trans,
171 struct btrfs_root *root, u64 bytenr, u64 copy)
173 struct btrfs_key key;
174 struct extent_buffer *leaf;
177 struct btrfs_path *path;
180 int should_del = rand() % 3;
182 path = btrfs_alloc_path();
186 key.objectid = bytenr;
188 key.offset = (u64)-1;
191 ret = btrfs_search_slot(trans, root->fs_info->extent_root,
197 if (path->slots[0] == 0)
202 leaf = path->nodes[0];
203 slot = path->slots[0];
204 btrfs_item_key_to_cpu(leaf, &key, slot);
205 if (key.objectid != bytenr)
208 if (key.type != BTRFS_EXTENT_ITEM_KEY &&
209 key.type != BTRFS_TREE_BLOCK_REF_KEY &&
210 key.type != BTRFS_EXTENT_DATA_REF_KEY &&
211 key.type != BTRFS_EXTENT_REF_V0_KEY &&
212 key.type != BTRFS_SHARED_BLOCK_REF_KEY &&
213 key.type != BTRFS_SHARED_DATA_REF_KEY)
218 "deleting extent record: key %llu %u %llu\n",
219 key.objectid, key.type, key.offset);
221 if (key.type == BTRFS_EXTENT_ITEM_KEY) {
222 /* make sure this extent doesn't get
223 * reused for other purposes */
224 btrfs_pin_extent(root->fs_info,
225 key.objectid, key.offset);
228 btrfs_del_item(trans, root, path);
231 "corrupting extent record: key %llu %u %llu\n",
232 key.objectid, key.type, key.offset);
233 ptr = btrfs_item_ptr_offset(leaf, slot);
234 item_size = btrfs_item_size_nr(leaf, slot);
235 memset_extent_buffer(leaf, 0, ptr, item_size);
236 btrfs_mark_buffer_dirty(leaf);
239 btrfs_release_path(path);
247 btrfs_free_path(path);
251 static void btrfs_corrupt_extent_leaf(struct btrfs_trans_handle *trans,
252 struct btrfs_root *root,
253 struct extent_buffer *eb)
255 u32 nr = btrfs_header_nritems(eb);
256 u32 victim = rand() % nr;
258 struct btrfs_key key;
260 btrfs_item_key_to_cpu(eb, &key, victim);
261 objectid = key.objectid;
262 corrupt_extent(trans, root, objectid, 1);
265 static void btrfs_corrupt_extent_tree(struct btrfs_trans_handle *trans,
266 struct btrfs_root *root,
267 struct extent_buffer *eb)
274 if (btrfs_is_leaf(eb)) {
275 btrfs_corrupt_extent_leaf(trans, root, eb);
279 if (btrfs_header_level(eb) == 1 && eb != root->node) {
284 for (i = 0; i < btrfs_header_nritems(eb); i++) {
285 struct extent_buffer *next;
287 next = read_tree_block(root, btrfs_node_blockptr(eb, i),
289 btrfs_node_ptr_generation(eb, i));
292 btrfs_corrupt_extent_tree(trans, root, next);
293 free_extent_buffer(next);
297 enum btrfs_inode_field {
298 BTRFS_INODE_FIELD_ISIZE,
299 BTRFS_INODE_FIELD_BAD,
302 enum btrfs_file_extent_field {
303 BTRFS_FILE_EXTENT_DISK_BYTENR,
304 BTRFS_FILE_EXTENT_BAD,
307 enum btrfs_dir_item_field {
309 BTRFS_DIR_ITEM_LOCATION_OBJECTID,
313 enum btrfs_metadata_block_field {
314 BTRFS_METADATA_BLOCK_GENERATION,
315 BTRFS_METADATA_BLOCK_SHIFT_ITEMS,
316 BTRFS_METADATA_BLOCK_BAD,
319 enum btrfs_item_field {
324 enum btrfs_key_field {
331 static enum btrfs_inode_field convert_inode_field(char *field)
333 if (!strncmp(field, "isize", FIELD_BUF_LEN))
334 return BTRFS_INODE_FIELD_ISIZE;
335 return BTRFS_INODE_FIELD_BAD;
338 static enum btrfs_file_extent_field convert_file_extent_field(char *field)
340 if (!strncmp(field, "disk_bytenr", FIELD_BUF_LEN))
341 return BTRFS_FILE_EXTENT_DISK_BYTENR;
342 return BTRFS_FILE_EXTENT_BAD;
345 static enum btrfs_metadata_block_field
346 convert_metadata_block_field(char *field)
348 if (!strncmp(field, "generation", FIELD_BUF_LEN))
349 return BTRFS_METADATA_BLOCK_GENERATION;
350 if (!strncmp(field, "shift_items", FIELD_BUF_LEN))
351 return BTRFS_METADATA_BLOCK_SHIFT_ITEMS;
352 return BTRFS_METADATA_BLOCK_BAD;
355 static enum btrfs_key_field convert_key_field(char *field)
357 if (!strncmp(field, "objectid", FIELD_BUF_LEN))
358 return BTRFS_KEY_OBJECTID;
359 if (!strncmp(field, "type", FIELD_BUF_LEN))
360 return BTRFS_KEY_TYPE;
361 if (!strncmp(field, "offset", FIELD_BUF_LEN))
362 return BTRFS_KEY_OFFSET;
363 return BTRFS_KEY_BAD;
366 static enum btrfs_item_field convert_item_field(char *field)
368 if (!strncmp(field, "offset", FIELD_BUF_LEN))
369 return BTRFS_ITEM_OFFSET;
370 return BTRFS_ITEM_BAD;
373 static enum btrfs_dir_item_field convert_dir_item_field(char *field)
375 if (!strncmp(field, "name", FIELD_BUF_LEN))
376 return BTRFS_DIR_ITEM_NAME;
377 if (!strncmp(field, "location_objectid", FIELD_BUF_LEN))
378 return BTRFS_DIR_ITEM_LOCATION_OBJECTID;
379 return BTRFS_DIR_ITEM_BAD;
382 static u64 generate_u64(u64 orig)
387 } while (ret == orig);
391 static u32 generate_u32(u32 orig)
396 } while (ret == orig);
400 static u8 generate_u8(u8 orig)
405 } while (ret == orig);
409 static int corrupt_key(struct btrfs_root *root, struct btrfs_key *key,
412 enum btrfs_key_field corrupt_field = convert_key_field(field);
413 struct btrfs_path *path;
414 struct btrfs_trans_handle *trans;
417 root = root->fs_info->fs_root;
418 if (corrupt_field == BTRFS_KEY_BAD) {
419 fprintf(stderr, "Invalid field %s\n", field);
423 path = btrfs_alloc_path();
427 trans = btrfs_start_transaction(root, 1);
429 btrfs_free_path(path);
430 return PTR_ERR(trans);
433 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
437 fprintf(stderr, "Couldn't find the key to corrupt\n");
442 switch (corrupt_field) {
443 case BTRFS_KEY_OBJECTID:
444 key->objectid = generate_u64(key->objectid);
447 key->type = generate_u8(key->type);
449 case BTRFS_KEY_OFFSET:
450 key->offset = generate_u64(key->objectid);
453 fprintf(stderr, "Invalid field %s, %d\n", field,
459 btrfs_set_item_key_unsafe(root, path, key);
461 btrfs_free_path(path);
462 btrfs_commit_transaction(trans, root);
466 static int corrupt_dir_item(struct btrfs_root *root, struct btrfs_key *key,
469 struct btrfs_trans_handle *trans;
470 struct btrfs_dir_item *di;
471 struct btrfs_path *path;
473 struct btrfs_key location;
474 struct btrfs_disk_key disk_key;
475 unsigned long name_ptr;
476 enum btrfs_dir_item_field corrupt_field =
477 convert_dir_item_field(field);
482 if (corrupt_field == BTRFS_DIR_ITEM_BAD) {
483 fprintf(stderr, "Invalid field %s\n", field);
487 path = btrfs_alloc_path();
491 trans = btrfs_start_transaction(root, 1);
493 btrfs_free_path(path);
494 return PTR_ERR(trans);
497 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
501 fprintf(stderr, "Error searching for dir item %d\n", ret);
505 di = btrfs_item_ptr(path->nodes[0], path->slots[0],
506 struct btrfs_dir_item);
508 switch (corrupt_field) {
509 case BTRFS_DIR_ITEM_NAME:
510 name_len = btrfs_dir_name_len(path->nodes[0], di);
511 name = malloc(name_len);
516 name_ptr = (unsigned long)(di + 1);
517 read_extent_buffer(path->nodes[0], name, name_ptr, name_len);
519 write_extent_buffer(path->nodes[0], name, name_ptr, name_len);
520 btrfs_mark_buffer_dirty(path->nodes[0]);
523 case BTRFS_DIR_ITEM_LOCATION_OBJECTID:
524 btrfs_dir_item_key_to_cpu(path->nodes[0], di, &location);
525 bogus = generate_u64(location.objectid);
526 location.objectid = bogus;
527 btrfs_cpu_key_to_disk(&disk_key, &location);
528 btrfs_set_dir_item_key(path->nodes[0], di, &disk_key);
529 btrfs_mark_buffer_dirty(path->nodes[0]);
536 btrfs_commit_transaction(trans, root);
537 btrfs_free_path(path);
541 static int corrupt_inode(struct btrfs_trans_handle *trans,
542 struct btrfs_root *root, u64 inode, char *field)
544 struct btrfs_inode_item *ei;
545 struct btrfs_path *path;
546 struct btrfs_key key;
547 enum btrfs_inode_field corrupt_field = convert_inode_field(field);
552 if (corrupt_field == BTRFS_INODE_FIELD_BAD) {
553 fprintf(stderr, "Invalid field %s\n", field);
557 key.objectid = inode;
558 key.type = BTRFS_INODE_ITEM_KEY;
559 key.offset = (u64)-1;
561 path = btrfs_alloc_path();
565 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
569 if (!path->slots[0]) {
570 fprintf(stderr, "Couldn't find inode %Lu\n", inode);
578 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
579 if (key.objectid != inode) {
580 fprintf(stderr, "Couldn't find inode %Lu\n", inode);
585 ei = btrfs_item_ptr(path->nodes[0], path->slots[0],
586 struct btrfs_inode_item);
587 switch (corrupt_field) {
588 case BTRFS_INODE_FIELD_ISIZE:
589 orig = btrfs_inode_size(path->nodes[0], ei);
590 bogus = generate_u64(orig);
591 btrfs_set_inode_size(path->nodes[0], ei, bogus);
597 btrfs_mark_buffer_dirty(path->nodes[0]);
599 btrfs_free_path(path);
603 static int corrupt_file_extent(struct btrfs_trans_handle *trans,
604 struct btrfs_root *root, u64 inode, u64 extent,
607 struct btrfs_file_extent_item *fi;
608 struct btrfs_path *path;
609 struct btrfs_key key;
610 enum btrfs_file_extent_field corrupt_field;
615 corrupt_field = convert_file_extent_field(field);
616 if (corrupt_field == BTRFS_FILE_EXTENT_BAD) {
617 fprintf(stderr, "Invalid field %s\n", field);
621 key.objectid = inode;
622 key.type = BTRFS_EXTENT_DATA_KEY;
625 path = btrfs_alloc_path();
629 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
633 fprintf(stderr, "Couldn't find extent %llu for inode %llu\n",
639 fi = btrfs_item_ptr(path->nodes[0], path->slots[0],
640 struct btrfs_file_extent_item);
641 switch (corrupt_field) {
642 case BTRFS_FILE_EXTENT_DISK_BYTENR:
643 orig = btrfs_file_extent_disk_bytenr(path->nodes[0], fi);
644 bogus = generate_u64(orig);
645 btrfs_set_file_extent_disk_bytenr(path->nodes[0], fi, bogus);
651 btrfs_mark_buffer_dirty(path->nodes[0]);
653 btrfs_free_path(path);
657 static void shift_items(struct btrfs_root *root, struct extent_buffer *eb)
659 int nritems = btrfs_header_nritems(eb);
660 int shift_space = btrfs_leaf_free_space(root, eb) / 2;
661 int slot = nritems / 2;
663 unsigned int data_end = btrfs_item_offset_nr(eb, nritems - 1);
665 /* Shift the item data up to and including slot back by shift space */
666 memmove_extent_buffer(eb, btrfs_leaf_data(eb) + data_end - shift_space,
667 btrfs_leaf_data(eb) + data_end,
668 btrfs_item_offset_nr(eb, slot - 1) - data_end);
670 /* Now update the item pointers. */
671 for (i = nritems - 1; i >= slot; i--) {
672 u32 offset = btrfs_item_offset_nr(eb, i);
673 offset -= shift_space;
674 btrfs_set_item_offset(eb, btrfs_item_nr(i), offset);
678 static int corrupt_metadata_block(struct btrfs_root *root, u64 block,
681 struct btrfs_trans_handle *trans;
682 struct btrfs_path *path;
683 struct extent_buffer *eb;
684 struct btrfs_key key, root_key;
685 enum btrfs_metadata_block_field corrupt_field;
691 corrupt_field = convert_metadata_block_field(field);
692 if (corrupt_field == BTRFS_METADATA_BLOCK_BAD) {
693 fprintf(stderr, "Invalid field %s\n", field);
697 eb = read_tree_block(root, block, root->leafsize, 0);
699 fprintf(stderr, "Couldn't read in tree block %s\n", field);
702 root_objectid = btrfs_header_owner(eb);
703 level = btrfs_header_level(eb);
705 btrfs_node_key_to_cpu(eb, &key, 0);
707 btrfs_item_key_to_cpu(eb, &key, 0);
708 free_extent_buffer(eb);
710 root_key.objectid = root_objectid;
711 root_key.type = BTRFS_ROOT_ITEM_KEY;
712 root_key.offset = (u64)-1;
714 root = btrfs_read_fs_root(root->fs_info, &root_key);
716 fprintf(stderr, "Couldn't finde owner root %llu\n",
718 return PTR_ERR(root);
721 path = btrfs_alloc_path();
725 trans = btrfs_start_transaction(root, 1);
727 btrfs_free_path(path);
728 fprintf(stderr, "Couldn't start transaction %ld\n",
730 return PTR_ERR(trans);
733 path->lowest_level = level;
734 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
736 fprintf(stderr, "Error searching to node %d\n", ret);
739 eb = path->nodes[level];
742 switch (corrupt_field) {
743 case BTRFS_METADATA_BLOCK_GENERATION:
744 orig = btrfs_header_generation(eb);
745 bogus = generate_u64(orig);
746 btrfs_set_header_generation(eb, bogus);
748 case BTRFS_METADATA_BLOCK_SHIFT_ITEMS:
749 shift_items(root, path->nodes[level]);
755 btrfs_mark_buffer_dirty(path->nodes[level]);
757 btrfs_commit_transaction(trans, root);
758 btrfs_free_path(path);
762 static int corrupt_btrfs_item(struct btrfs_root *root, struct btrfs_key *key,
765 struct btrfs_trans_handle *trans;
766 struct btrfs_path *path;
767 enum btrfs_item_field corrupt_field;
771 corrupt_field = convert_item_field(field);
772 if (corrupt_field == BTRFS_ITEM_BAD) {
773 fprintf(stderr, "Invalid field %s\n", field);
777 path = btrfs_alloc_path();
781 trans = btrfs_start_transaction(root, 1);
783 btrfs_free_path(path);
784 fprintf(stderr, "Couldn't start transaction %ld\n",
786 return PTR_ERR(trans);
789 ret = btrfs_search_slot(trans, root, key, path, 0, 1);
791 fprintf(stderr, "Error searching to node %d\n", ret);
796 switch (corrupt_field) {
797 case BTRFS_ITEM_OFFSET:
798 orig = btrfs_item_offset_nr(path->nodes[0], path->slots[0]);
799 bogus = generate_u32(orig);
800 btrfs_set_item_offset(path->nodes[0],
801 btrfs_item_nr(path->slots[0]), bogus);
807 btrfs_mark_buffer_dirty(path->nodes[0]);
809 btrfs_commit_transaction(trans, root);
810 btrfs_free_path(path);
814 static struct option long_options[] = {
815 /* { "byte-count", 1, NULL, 'b' }, */
816 { "logical", 1, NULL, 'l' },
817 { "copy", 1, NULL, 'c' },
818 { "bytes", 1, NULL, 'b' },
819 { "extent-record", 0, NULL, 'e' },
820 { "extent-tree", 0, NULL, 'E' },
821 { "keys", 0, NULL, 'k' },
822 { "chunk-record", 0, NULL, 'u' },
823 { "chunk-tree", 0, NULL, 'U' },
824 { "inode", 1, NULL, 'i'},
825 { "file-extent", 1, NULL, 'x'},
826 { "metadata-block", 1, NULL, 'm'},
827 { "field", 1, NULL, 'f'},
828 { "key", 1, NULL, 'K'},
829 { "item", 0, NULL, 'I'},
830 { "dir-item", 0, NULL, 'D'},
834 /* corrupt item using NO cow.
835 * Because chunk recover will recover based on whole partition scaning,
836 * If using COW, chunk recover will use the old item to recover,
837 * which is still OK but we want to check the ability to rebuild chunk
838 * not only restore the old ones */
839 int corrupt_item_nocow(struct btrfs_trans_handle *trans,
840 struct btrfs_root *root, struct btrfs_path *path,
844 struct btrfs_key key;
845 struct extent_buffer *leaf;
850 leaf = path->nodes[0];
851 slot = path->slots[0];
852 /* Not deleting the first item of a leaf to keep leaf structure */
855 /* Only accept valid eb */
856 BUG_ON(!leaf->data || slot >= btrfs_header_nritems(leaf));
857 btrfs_item_key_to_cpu(leaf, &key, slot);
859 fprintf(stdout, "Deleting key and data [%llu, %u, %llu].\n",
860 key.objectid, key.type, key.offset);
861 btrfs_del_item(trans, root, path);
863 fprintf(stdout, "Corrupting key and data [%llu, %u, %llu].\n",
864 key.objectid, key.type, key.offset);
865 ptr = btrfs_item_ptr_offset(leaf, slot);
866 item_size = btrfs_item_size_nr(leaf, slot);
867 memset_extent_buffer(leaf, 0, ptr, item_size);
868 btrfs_mark_buffer_dirty(leaf);
872 int corrupt_chunk_tree(struct btrfs_trans_handle *trans,
873 struct btrfs_root *root)
878 struct btrfs_path *path;
879 struct btrfs_key key;
880 struct btrfs_key found_key;
881 struct extent_buffer *leaf;
883 path = btrfs_alloc_path();
887 key.objectid = (u64)-1;
888 key.offset = (u64)-1;
891 /* Here, cow and ins_len must equals 0 for the following reasons:
892 * 1) chunk recover is based on disk scanning, so COW should be
893 * disabled in case the original chunk being scanned and
894 * recovered using the old chunk.
895 * 2) if cow = 0, ins_len must also be set to 0, or BUG_ON will be
898 ret = btrfs_search_slot(trans, root, &key, path, 0, 0);
901 fprintf(stderr, "Error searching tree\n");
904 /* corrupt/del dev_item first */
905 while (!btrfs_previous_item(root, path, 0, BTRFS_DEV_ITEM_KEY)) {
906 slot = path->slots[0];
907 leaf = path->nodes[0];
909 /* Never delete the first item to keep the leaf structure */
910 if (path->slots[0] == 0)
912 ret = corrupt_item_nocow(trans, root, path, del);
916 btrfs_release_path(path);
918 /* Here, cow and ins_len must equals 0 for the following reasons:
919 * 1) chunk recover is based on disk scanning, so COW should be
920 * disabled in case the original chunk being scanned and
921 * recovered using the old chunk.
922 * 2) if cow = 0, ins_len must also be set to 0, or BUG_ON will be
925 ret = btrfs_search_slot(trans, root, &key, path, 0, 0);
928 fprintf(stderr, "Error searching tree\n");
931 /* corrupt/del chunk then*/
932 while (!btrfs_previous_item(root, path, 0, BTRFS_CHUNK_ITEM_KEY)) {
933 slot = path->slots[0];
934 leaf = path->nodes[0];
936 btrfs_item_key_to_cpu(leaf, &found_key, slot);
937 ret = corrupt_item_nocow(trans, root, path, del);
942 btrfs_free_path(path);
945 int find_chunk_offset(struct btrfs_root *root,
946 struct btrfs_path *path, u64 offset)
948 struct btrfs_key key;
951 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
952 key.type = BTRFS_CHUNK_ITEM_KEY;
955 /* Here, cow and ins_len must equals 0 for following reasons:
956 * 1) chunk recover is based on disk scanning, so COW should
957 * be disabled in case the original chunk being scanned
958 * and recovered using the old chunk.
959 * 2) if cow = 0, ins_len must also be set to 0, or BUG_ON
962 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
964 fprintf(stderr, "Can't find chunk with given offset %llu\n",
969 fprintf(stderr, "Error searching chunk");
976 int main(int ac, char **av)
978 struct cache_tree root_cache;
979 struct btrfs_key key;
980 struct btrfs_root *root;
981 struct extent_buffer *eb;
983 /* chunk offset can be 0,so change to (u64)-1 */
984 u64 logical = (u64)-1;
986 int option_index = 0;
991 int corrupt_block_keys = 0;
994 int corrupt_item = 0;
996 u64 metadata_block = 0;
998 u64 file_extent = (u64)-1;
999 char field[FIELD_BUF_LEN];
1003 memset(&key, 0, sizeof(key));
1007 c = getopt_long(ac, av, "l:c:b:eEkuUi:f:x:m:K:ID", long_options,
1013 logical = arg_strtou64(optarg);
1016 copy = arg_strtou64(optarg);
1019 bytes = arg_strtou64(optarg);
1028 corrupt_block_keys = 1;
1036 inode = arg_strtou64(optarg);
1039 strncpy(field, optarg, FIELD_BUF_LEN);
1042 file_extent = arg_strtou64(optarg);
1045 metadata_block = arg_strtou64(optarg);
1048 ret = sscanf(optarg, "%llu,%u,%llu",
1050 (unsigned int *)&key.type,
1053 fprintf(stderr, "error reading key "
1070 if (check_argc_min(ac, 1))
1075 cache_tree_init(&root_cache);
1077 root = open_ctree(dev, 0, OPEN_CTREE_WRITES);
1079 fprintf(stderr, "Open ctree failed\n");
1083 struct btrfs_trans_handle *trans;
1085 if (logical == (u64)-1)
1087 trans = btrfs_start_transaction(root, 1);
1088 ret = corrupt_extent (trans, root, logical, 0);
1089 btrfs_commit_transaction(trans, root);
1093 struct btrfs_trans_handle *trans;
1094 trans = btrfs_start_transaction(root, 1);
1095 btrfs_corrupt_extent_tree(trans, root->fs_info->extent_root,
1096 root->fs_info->extent_root->node);
1097 btrfs_commit_transaction(trans, root);
1101 struct btrfs_trans_handle *trans;
1102 struct btrfs_path *path;
1105 if (logical == (u64)-1)
1108 path = btrfs_alloc_path();
1110 fprintf(stderr, "path allocation failed\n");
1114 if (find_chunk_offset(root->fs_info->chunk_root, path,
1116 btrfs_free_path(path);
1119 trans = btrfs_start_transaction(root, 1);
1120 ret = corrupt_item_nocow(trans, root->fs_info->chunk_root,
1123 fprintf(stderr, "Failed to corrupt chunk record\n");
1124 btrfs_commit_transaction(trans, root);
1128 struct btrfs_trans_handle *trans;
1129 trans = btrfs_start_transaction(root, 1);
1130 ret = corrupt_chunk_tree(trans, root->fs_info->chunk_root);
1132 fprintf(stderr, "Failed to corrupt chunk tree\n");
1133 btrfs_commit_transaction(trans, root);
1137 struct btrfs_trans_handle *trans;
1142 trans = btrfs_start_transaction(root, 1);
1143 if (file_extent == (u64)-1) {
1144 printf("corrupting inode\n");
1145 ret = corrupt_inode(trans, root, inode, field);
1147 printf("corrupting file extent\n");
1148 ret = corrupt_file_extent(trans, root, inode,
1149 file_extent, field);
1151 btrfs_commit_transaction(trans, root);
1154 if (metadata_block) {
1157 ret = corrupt_metadata_block(root, metadata_block, field);
1161 if (!key.objectid || !strlen(field))
1163 ret = corrupt_dir_item(root, &key, field);
1169 ret = corrupt_btrfs_item(root, &key, field);
1172 if (key.objectid || key.offset || key.type) {
1175 ret = corrupt_key(root, &key, field);
1179 * If we made it here and we have extent set then we didn't specify
1180 * inode and we're screwed.
1182 if (file_extent != (u64)-1)
1185 if (logical == (u64)-1)
1189 bytes = root->sectorsize;
1191 bytes = (bytes + root->sectorsize - 1) / root->sectorsize;
1192 bytes *= root->sectorsize;
1195 if (corrupt_block_keys) {
1196 corrupt_keys_in_block(root, logical);
1198 eb = debug_corrupt_block(root, logical,
1199 root->sectorsize, copy);
1200 free_extent_buffer(eb);
1202 logical += root->sectorsize;
1203 bytes -= root->sectorsize;