btrfs-corrupt-block.c

   1 /*
   2  * Copyright (C) 2009 Oracle.  All rights reserved.
   3  *
   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.
   7  *
   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.
  12  *
  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.
  17  */
  18
  19 #include <stdio.h>
  20 #include <stdlib.h>
  21 #include <fcntl.h>
  22 #include <unistd.h>
  23 #include <getopt.h>
  24 #include <limits.h>
  25
  26 #include "kerncompat.h"
  27 #include "ctree.h"
  28 #include "volumes.h"
  29 #include "disk-io.h"
  30 #include "print-tree.h"
  31 #include "transaction.h"
  32 #include "list.h"
  33 #include "utils.h"
  34 #include "help.h"
  35
  36 #define FIELD_BUF_LEN 80
  37
  38 static int debug_corrupt_block(struct extent_buffer *eb,
  39                 struct btrfs_root *root, u64 bytenr, u32 blocksize, u64 copy)
  40 {
  41         int ret;
  42         u64 length;
  43         struct btrfs_multi_bio *multi = NULL;
  44         struct btrfs_device *device;
  45         int num_copies;
  46         int mirror_num = 1;
  47
  48         length = blocksize;
  49         while (1) {
  50                 ret = btrfs_map_block(root->fs_info, READ, eb->start, &length,
  51                                       &multi, mirror_num, NULL);
  52                 if (ret) {
  53                         error("cannot map block %llu length %llu mirror %d: %d",
  54                                         (unsigned long long)eb->start,
  55                                         (unsigned long long)length,
  56                                         mirror_num, ret);
  57                         return ret;
  58                 }
  59                 device = multi->stripes[0].dev;
  60                 eb->fd = device->fd;
  61                 device->total_ios++;
  62                 eb->dev_bytenr = multi->stripes[0].physical;
  63
  64                 fprintf(stdout,
  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);
  68                 free(multi);
  69
  70                 if (!copy || mirror_num == copy) {
  71                         ret = read_extent_from_disk(eb, 0, eb->len);
  72                         if (ret < 0) {
  73                                 error("cannot read eb bytenr %llu: %s",
  74                                                 (unsigned long long)eb->dev_bytenr,
  75                                                 strerror(-ret));
  76                                 return ret;
  77                         }
  78                         printf("corrupting %llu copy %d\n", eb->start,
  79                                mirror_num);
  80                         memset(eb->data, 0, eb->len);
  81                         ret = write_extent_to_disk(eb);
  82                         if (ret < 0) {
  83                                 error("cannot write eb bytenr %llu: %s",
  84                                                 (unsigned long long)eb->dev_bytenr,
  85                                                 strerror(-ret));
  86                                 return ret;
  87                         }
  88                         fsync(eb->fd);
  89                 }
  90
  91                 num_copies = btrfs_num_copies(root->fs_info, eb->start,
  92                                               eb->len);
  93                 if (num_copies == 1)
  94                         break;
  95
  96                 mirror_num++;
  97                 if (mirror_num > num_copies)
  98                         break;
  99         }
 100
 101         return 0;
 102 }
 103
 104 static void print_usage(int ret)
 105 {
 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");
 124         exit(ret);
 125 }
 126
 127 static void corrupt_keys(struct btrfs_trans_handle *trans,
 128                          struct btrfs_fs_info *fs_info,
 129                          struct extent_buffer *eb)
 130 {
 131         int slot;
 132         int bad_slot;
 133         int nr;
 134         struct btrfs_disk_key bad_key;;
 135
 136         nr = btrfs_header_nritems(eb);
 137         if (nr == 0)
 138                 return;
 139
 140         slot = rand_range(nr);
 141         bad_slot = rand_range(nr);
 142
 143         if (bad_slot == slot)
 144                 return;
 145
 146         fprintf(stderr,
 147                 "corrupting keys in block %llu slot %d swapping with %d\n",
 148                 (unsigned long long)eb->start, slot, bad_slot);
 149
 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);
 153         } else {
 154                 btrfs_node_key(eb, &bad_key, bad_slot);
 155                 btrfs_set_node_key(eb, &bad_key, slot);
 156         }
 157         btrfs_mark_buffer_dirty(eb);
 158         if (!trans) {
 159                 u16 csum_size =
 160                         btrfs_super_csum_size(fs_info->super_copy);
 161                 csum_tree_block_size(eb, csum_size, 0);
 162                 write_extent_to_disk(eb);
 163         }
 164 }
 165
 166
 167 static int corrupt_keys_in_block(struct btrfs_fs_info *fs_info, u64 bytenr)
 168 {
 169         struct extent_buffer *eb;
 170
 171         eb = read_tree_block(fs_info, bytenr, 0);
 172         if (!extent_buffer_uptodate(eb))
 173                 return -EIO;;
 174
 175         corrupt_keys(NULL, fs_info, eb);
 176         free_extent_buffer(eb);
 177         return 0;
 178 }
 179
 180 static int corrupt_extent(struct btrfs_trans_handle *trans,
 181                           struct btrfs_root *root, u64 bytenr)
 182 {
 183         struct btrfs_key key;
 184         struct extent_buffer *leaf;
 185         u32 item_size;
 186         unsigned long ptr;
 187         struct btrfs_path *path;
 188         int ret;
 189         int slot;
 190         int should_del = rand_range(3);
 191
 192         path = btrfs_alloc_path();
 193         if (!path)
 194                 return -ENOMEM;
 195
 196         key.objectid = bytenr;
 197         key.type = (u8)-1;
 198         key.offset = (u64)-1;
 199
 200         while(1) {
 201                 ret = btrfs_search_slot(trans, root->fs_info->extent_root,
 202                                         &key, path, -1, 1);
 203                 if (ret < 0)
 204                         break;
 205
 206                 if (ret > 0) {
 207                         if (path->slots[0] == 0)
 208                                 break;
 209                         path->slots[0]--;
 210                         ret = 0;
 211                 }
 212                 leaf = path->nodes[0];
 213                 slot = path->slots[0];
 214                 btrfs_item_key_to_cpu(leaf, &key, slot);
 215                 if (key.objectid != bytenr)
 216                         break;
 217
 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)
 225                         goto next;
 226
 227                 if (should_del) {
 228                         fprintf(stderr,
 229                                 "deleting extent record: key %llu %u %llu\n",
 230                                 key.objectid, key.type, key.offset);
 231
 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);
 237                         }
 238
 239                         btrfs_del_item(trans, root, path);
 240                 } else {
 241                         fprintf(stderr,
 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);
 248                 }
 249 next:
 250                 btrfs_release_path(path);
 251
 252                 if (key.offset > 0)
 253                         key.offset--;
 254                 if (key.offset == 0)
 255                         break;
 256         }
 257
 258         btrfs_free_path(path);
 259         return 0;
 260 }
 261
 262 static void btrfs_corrupt_extent_leaf(struct btrfs_trans_handle *trans,
 263                                       struct btrfs_root *root,
 264                                       struct extent_buffer *eb)
 265 {
 266         u32 nr = btrfs_header_nritems(eb);
 267         u32 victim = rand_range(nr);
 268         u64 objectid;
 269         struct btrfs_key key;
 270
 271         btrfs_item_key_to_cpu(eb, &key, victim);
 272         objectid = key.objectid;
 273         corrupt_extent(trans, root, objectid);
 274 }
 275
 276 static void btrfs_corrupt_extent_tree(struct btrfs_trans_handle *trans,
 277                                       struct btrfs_root *root,
 278                                       struct extent_buffer *eb)
 279 {
 280         struct btrfs_fs_info *fs_info = root->fs_info;
 281         int i;
 282
 283         if (!eb)
 284                 return;
 285
 286         if (btrfs_is_leaf(eb)) {
 287                 btrfs_corrupt_extent_leaf(trans, root, eb);
 288                 return;
 289         }
 290
 291         if (btrfs_header_level(eb) == 1 && eb != root->node) {
 292                 if (rand_range(5))
 293                         return;
 294         }
 295
 296         for (i = 0; i < btrfs_header_nritems(eb); i++) {
 297                 struct extent_buffer *next;
 298
 299                 next = read_tree_block(fs_info, btrfs_node_blockptr(eb, i),
 300                                        btrfs_node_ptr_generation(eb, i));
 301                 if (!extent_buffer_uptodate(next))
 302                         continue;
 303                 btrfs_corrupt_extent_tree(trans, root, next);
 304                 free_extent_buffer(next);
 305         }
 306 }
 307
 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,
 319 };
 320
 321 enum btrfs_file_extent_field {
 322         BTRFS_FILE_EXTENT_DISK_BYTENR,
 323         BTRFS_FILE_EXTENT_BAD,
 324 };
 325
 326 enum btrfs_dir_item_field {
 327         BTRFS_DIR_ITEM_NAME,
 328         BTRFS_DIR_ITEM_LOCATION_OBJECTID,
 329         BTRFS_DIR_ITEM_BAD,
 330 };
 331
 332 enum btrfs_metadata_block_field {
 333         BTRFS_METADATA_BLOCK_GENERATION,
 334         BTRFS_METADATA_BLOCK_SHIFT_ITEMS,
 335         BTRFS_METADATA_BLOCK_BAD,
 336 };
 337
 338 enum btrfs_item_field {
 339         BTRFS_ITEM_OFFSET,
 340         BTRFS_ITEM_BAD,
 341 };
 342
 343 enum btrfs_key_field {
 344         BTRFS_KEY_OBJECTID,
 345         BTRFS_KEY_TYPE,
 346         BTRFS_KEY_OFFSET,
 347         BTRFS_KEY_BAD,
 348 };
 349
 350 static enum btrfs_inode_field convert_inode_field(char *field)
 351 {
 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;
 371 }
 372
 373 static enum btrfs_file_extent_field convert_file_extent_field(char *field)
 374 {
 375         if (!strncmp(field, "disk_bytenr", FIELD_BUF_LEN))
 376                 return BTRFS_FILE_EXTENT_DISK_BYTENR;
 377         return BTRFS_FILE_EXTENT_BAD;
 378 }
 379
 380 static enum btrfs_metadata_block_field
 381 convert_metadata_block_field(char *field)
 382 {
 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;
 388 }
 389
 390 static enum btrfs_key_field convert_key_field(char *field)
 391 {
 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;
 399 }
 400
 401 static enum btrfs_item_field convert_item_field(char *field)
 402 {
 403         if (!strncmp(field, "offset", FIELD_BUF_LEN))
 404                 return BTRFS_ITEM_OFFSET;
 405         return BTRFS_ITEM_BAD;
 406 }
 407
 408 static enum btrfs_dir_item_field convert_dir_item_field(char *field)
 409 {
 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;
 415 }
 416
 417 static u64 generate_u64(u64 orig)
 418 {
 419         u64 ret;
 420         do {
 421                 ret = rand_u64();
 422         } while (ret == orig);
 423         return ret;
 424 }
 425
 426 static u32 generate_u32(u32 orig)
 427 {
 428         u32 ret;
 429         do {
 430                 ret = rand_u32();
 431         } while (ret == orig);
 432         return ret;
 433 }
 434
 435 static u8 generate_u8(u8 orig)
 436 {
 437         u8 ret;
 438         do {
 439                 ret = rand_u8();
 440         } while (ret == orig);
 441         return ret;
 442 }
 443
 444 static int corrupt_key(struct btrfs_root *root, struct btrfs_key *key,
 445                        char *field)
 446 {
 447         enum btrfs_key_field corrupt_field = convert_key_field(field);
 448         struct btrfs_path *path;
 449         struct btrfs_trans_handle *trans;
 450         int ret;
 451
 452         root = root->fs_info->fs_root;
 453         if (corrupt_field == BTRFS_KEY_BAD) {
 454                 fprintf(stderr, "Invalid field %s\n", field);
 455                 return -EINVAL;
 456         }
 457
 458         path = btrfs_alloc_path();
 459         if (!path)
 460                 return -ENOMEM;
 461
 462         trans = btrfs_start_transaction(root, 1);
 463         if (IS_ERR(trans)) {
 464                 btrfs_free_path(path);
 465                 return PTR_ERR(trans);
 466         }
 467
 468         ret = btrfs_search_slot(trans, root, key, path, 0, 1);
 469         if (ret < 0)
 470                 goto out;
 471         if (ret > 0) {
 472                 fprintf(stderr, "Couldn't find the key to corrupt\n");
 473                 ret = -ENOENT;
 474                 goto out;
 475         }
 476
 477         switch (corrupt_field) {
 478         case BTRFS_KEY_OBJECTID:
 479                 key->objectid = generate_u64(key->objectid);
 480                 break;
 481         case BTRFS_KEY_TYPE:
 482                 key->type = generate_u8(key->type);
 483                 break;
 484         case BTRFS_KEY_OFFSET:
 485                 key->offset = generate_u64(key->objectid);
 486                 break;
 487         default:
 488                 fprintf(stderr, "Invalid field %s, %d\n", field,
 489                         corrupt_field);
 490                 ret = -EINVAL;
 491                 goto out;
 492         }
 493
 494         btrfs_set_item_key_unsafe(root, path, key);
 495 out:
 496         btrfs_free_path(path);
 497         btrfs_commit_transaction(trans, root);
 498         return ret;
 499 }
 500
 501 static int corrupt_dir_item(struct btrfs_root *root, struct btrfs_key *key,
 502                             char *field)
 503 {
 504         struct btrfs_trans_handle *trans;
 505         struct btrfs_dir_item *di;
 506         struct btrfs_path *path;
 507         char name[PATH_MAX];
 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);
 513         u64 bogus;
 514         u16 name_len;
 515         int ret;
 516
 517         if (corrupt_field == BTRFS_DIR_ITEM_BAD) {
 518                 fprintf(stderr, "Invalid field %s\n", field);
 519                 return -EINVAL;
 520         }
 521
 522         path = btrfs_alloc_path();
 523         if (!path)
 524                 return -ENOMEM;
 525
 526         trans = btrfs_start_transaction(root, 1);
 527         if (IS_ERR(trans)) {
 528                 btrfs_free_path(path);
 529                 return PTR_ERR(trans);
 530         }
 531
 532         ret = btrfs_search_slot(trans, root, key, path, 0, 1);
 533         if (ret) {
 534                 if (ret > 0)
 535                         ret = -ENOENT;
 536                 fprintf(stderr, "Error searching for dir item %d\n", ret);
 537                 goto out;
 538         }
 539
 540         di = btrfs_item_ptr(path->nodes[0], path->slots[0],
 541                             struct btrfs_dir_item);
 542
 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);
 548                 name[0]++;
 549                 write_extent_buffer(path->nodes[0], name, name_ptr, name_len);
 550                 btrfs_mark_buffer_dirty(path->nodes[0]);
 551                 goto out;
 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]);
 559                 goto out;
 560         default:
 561                 ret = -EINVAL;
 562                 goto out;
 563         }
 564 out:
 565         btrfs_commit_transaction(trans, root);
 566         btrfs_free_path(path);
 567         return ret;
 568 }
 569
 570 static int corrupt_inode(struct btrfs_trans_handle *trans,
 571                          struct btrfs_root *root, u64 inode, char *field)
 572 {
 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);
 577         u64 bogus;
 578         u64 orig;
 579         int ret;
 580
 581         if (corrupt_field == BTRFS_INODE_FIELD_BAD) {
 582                 fprintf(stderr, "Invalid field %s\n", field);
 583                 return -EINVAL;
 584         }
 585
 586         key.objectid = inode;
 587         key.type = BTRFS_INODE_ITEM_KEY;
 588         key.offset = (u64)-1;
 589
 590         path = btrfs_alloc_path();
 591         if (!path)
 592                 return -ENOMEM;
 593
 594         ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
 595         if (ret < 0)
 596                 goto out;
 597         if (ret) {
 598                 if (!path->slots[0]) {
 599                         fprintf(stderr, "Couldn't find inode %Lu\n", inode);
 600                         ret = -ENOENT;
 601                         goto out;
 602                 }
 603                 path->slots[0]--;
 604                 ret = 0;
 605         }
 606
 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);
 610                 ret = -ENOENT;
 611                 goto out;
 612         }
 613
 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);
 621                 break;
 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);
 626                 break;
 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);
 631                 break;
 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);
 636                 break;
 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);
 641                 break;
 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);
 646                 break;
 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);
 651                 break;
 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);
 656                 break;
 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);
 661                 break;
 662         default:
 663                 ret = -EINVAL;
 664                 break;
 665         }
 666         btrfs_mark_buffer_dirty(path->nodes[0]);
 667 out:
 668         btrfs_free_path(path);
 669         return ret;
 670 }
 671
 672 static int corrupt_file_extent(struct btrfs_trans_handle *trans,
 673                                struct btrfs_root *root, u64 inode, u64 extent,
 674                                char *field)
 675 {
 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;
 680         u64 bogus;
 681         u64 orig;
 682         int ret = 0;
 683
 684         corrupt_field = convert_file_extent_field(field);
 685         if (corrupt_field == BTRFS_FILE_EXTENT_BAD) {
 686                 fprintf(stderr, "Invalid field %s\n", field);
 687                 return -EINVAL;
 688         }
 689
 690         key.objectid = inode;
 691         key.type = BTRFS_EXTENT_DATA_KEY;
 692         key.offset = extent;
 693
 694         path = btrfs_alloc_path();
 695         if (!path)
 696                 return -ENOMEM;
 697
 698         ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
 699         if (ret < 0)
 700                 goto out;
 701         if (ret) {
 702                 fprintf(stderr, "Couldn't find extent %llu for inode %llu\n",
 703                         extent, inode);
 704                 ret = -ENOENT;
 705                 goto out;
 706         }
 707
 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);
 715                 break;
 716         default:
 717                 ret = -EINVAL;
 718                 break;
 719         }
 720         btrfs_mark_buffer_dirty(path->nodes[0]);
 721 out:
 722         btrfs_free_path(path);
 723         return ret;
 724 }
 725
 726 static void shift_items(struct btrfs_root *root, struct extent_buffer *eb)
 727 {
 728         int nritems = btrfs_header_nritems(eb);
 729         int shift_space = btrfs_leaf_free_space(root, eb) / 2;
 730         int slot = nritems / 2;
 731         int i = 0;
 732         unsigned int data_end = btrfs_item_offset_nr(eb, nritems - 1);
 733
 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);
 738
 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);
 744         }
 745 }
 746
 747 static int corrupt_metadata_block(struct btrfs_fs_info *fs_info, u64 block,
 748                                   char *field)
 749 {
 750         struct btrfs_trans_handle *trans;
 751         struct btrfs_root *root;
 752         struct btrfs_path *path;
 753         struct extent_buffer *eb;
 754         struct btrfs_key key, root_key;
 755         enum btrfs_metadata_block_field corrupt_field;
 756         u64 root_objectid;
 757         u64 orig, bogus;
 758         u8 level;
 759         int ret;
 760
 761         corrupt_field = convert_metadata_block_field(field);
 762         if (corrupt_field == BTRFS_METADATA_BLOCK_BAD) {
 763                 fprintf(stderr, "Invalid field %s\n", field);
 764                 return -EINVAL;
 765         }
 766
 767         eb = read_tree_block(fs_info, block, 0);
 768         if (!extent_buffer_uptodate(eb)) {
 769                 fprintf(stderr, "Couldn't read in tree block %s\n", field);
 770                 return -EINVAL;
 771         }
 772         root_objectid = btrfs_header_owner(eb);
 773         level = btrfs_header_level(eb);
 774         if (level)
 775                 btrfs_node_key_to_cpu(eb, &key, 0);
 776         else
 777                 btrfs_item_key_to_cpu(eb, &key, 0);
 778         free_extent_buffer(eb);
 779
 780         root_key.objectid = root_objectid;
 781         root_key.type = BTRFS_ROOT_ITEM_KEY;
 782         root_key.offset = (u64)-1;
 783
 784         root = btrfs_read_fs_root(fs_info, &root_key);
 785         if (IS_ERR(root)) {
 786                 fprintf(stderr, "Couldn't find owner root %llu\n",
 787                         key.objectid);
 788                 return PTR_ERR(root);
 789         }
 790
 791         path = btrfs_alloc_path();
 792         if (!path)
 793                 return -ENOMEM;
 794
 795         trans = btrfs_start_transaction(root, 1);
 796         if (IS_ERR(trans)) {
 797                 btrfs_free_path(path);
 798                 fprintf(stderr, "Couldn't start transaction %ld\n",
 799                         PTR_ERR(trans));
 800                 return PTR_ERR(trans);
 801         }
 802
 803         path->lowest_level = level;
 804         ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
 805         if (ret < 0) {
 806                 fprintf(stderr, "Error searching to node %d\n", ret);
 807                 goto out;
 808         }
 809         eb = path->nodes[level];
 810
 811         ret = 0;
 812         switch (corrupt_field) {
 813         case BTRFS_METADATA_BLOCK_GENERATION:
 814                 orig = btrfs_header_generation(eb);
 815                 bogus = generate_u64(orig);
 816                 btrfs_set_header_generation(eb, bogus);
 817                 break;
 818         case BTRFS_METADATA_BLOCK_SHIFT_ITEMS:
 819                 shift_items(root, path->nodes[level]);
 820                 break;
 821         default:
 822                 ret = -EINVAL;
 823                 break;
 824         }
 825         btrfs_mark_buffer_dirty(path->nodes[level]);
 826 out:
 827         btrfs_commit_transaction(trans, root);
 828         btrfs_free_path(path);
 829         return ret;
 830 }
 831
 832 static int corrupt_btrfs_item(struct btrfs_root *root, struct btrfs_key *key,
 833                               char *field)
 834 {
 835         struct btrfs_trans_handle *trans;
 836         struct btrfs_path *path;
 837         enum btrfs_item_field corrupt_field;
 838         u32 orig, bogus;
 839         int ret;
 840
 841         corrupt_field = convert_item_field(field);
 842         if (corrupt_field == BTRFS_ITEM_BAD) {
 843                 fprintf(stderr, "Invalid field %s\n", field);
 844                 return -EINVAL;
 845         }
 846
 847         path = btrfs_alloc_path();
 848         if (!path)
 849                 return -ENOMEM;
 850
 851         trans = btrfs_start_transaction(root, 1);
 852         if (IS_ERR(trans)) {
 853                 btrfs_free_path(path);
 854                 fprintf(stderr, "Couldn't start transaction %ld\n",
 855                         PTR_ERR(trans));
 856                 return PTR_ERR(trans);
 857         }
 858
 859         ret = btrfs_search_slot(trans, root, key, path, 0, 1);
 860         if (ret != 0) {
 861                 fprintf(stderr, "Error searching to node %d\n", ret);
 862                 goto out;
 863         }
 864
 865         ret = 0;
 866         switch (corrupt_field) {
 867         case BTRFS_ITEM_OFFSET:
 868                 orig = btrfs_item_offset_nr(path->nodes[0], path->slots[0]);
 869                 bogus = generate_u32(orig);
 870                 btrfs_set_item_offset(path->nodes[0],
 871                                       btrfs_item_nr(path->slots[0]), bogus);
 872                 break;
 873         default:
 874                 ret = -EINVAL;
 875                 break;
 876         }
 877         btrfs_mark_buffer_dirty(path->nodes[0]);
 878 out:
 879         btrfs_commit_transaction(trans, root);
 880         btrfs_free_path(path);
 881         return ret;
 882 }
 883
 884 static int delete_item(struct btrfs_root *root, struct btrfs_key *key)
 885 {
 886         struct btrfs_trans_handle *trans;
 887         struct btrfs_path *path;
 888         int ret;
 889
 890         path = btrfs_alloc_path();
 891         if (!path)
 892                 return -ENOMEM;
 893
 894         trans = btrfs_start_transaction(root, 1);
 895         if (IS_ERR(trans)) {
 896                 btrfs_free_path(path);
 897                 fprintf(stderr, "Couldn't start transaction %ld\n",
 898                         PTR_ERR(trans));
 899                 return PTR_ERR(trans);
 900         }
 901
 902         ret = btrfs_search_slot(trans, root, key, path, -1, 1);
 903         if (ret) {
 904                 if (ret > 0)
 905                         ret = -ENOENT;
 906                 fprintf(stderr, "Error searching to node %d\n", ret);
 907                 goto out;
 908         }
 909         ret = btrfs_del_item(trans, root, path);
 910         btrfs_mark_buffer_dirty(path->nodes[0]);
 911 out:
 912         btrfs_commit_transaction(trans, root);
 913         btrfs_free_path(path);
 914         return ret;
 915 }
 916
 917 static int delete_csum(struct btrfs_root *root, u64 bytenr, u64 bytes)
 918 {
 919         struct btrfs_trans_handle *trans;
 920         int ret;
 921
 922         root = root->fs_info->csum_root;
 923         trans = btrfs_start_transaction(root, 1);
 924         if (IS_ERR(trans)) {
 925                 fprintf(stderr, "Couldn't start transaction %ld\n",
 926                         PTR_ERR(trans));
 927                 return PTR_ERR(trans);
 928         }
 929
 930         ret = btrfs_del_csums(trans, root, bytenr, bytes);
 931         if (ret)
 932                 fprintf(stderr, "Error deleting csums %d\n", ret);
 933         btrfs_commit_transaction(trans, root);
 934         return ret;
 935 }
 936
 937 /* corrupt item using NO cow.
 938  * Because chunk recover will recover based on whole partition scanning,
 939  * If using COW, chunk recover will use the old item to recover,
 940  * which is still OK but we want to check the ability to rebuild chunk
 941  * not only restore the old ones */
 942 static int corrupt_item_nocow(struct btrfs_trans_handle *trans,
 943                        struct btrfs_root *root, struct btrfs_path *path,
 944                        int del)
 945 {
 946         int ret = 0;
 947         struct btrfs_key key;
 948         struct extent_buffer *leaf;
 949         unsigned long ptr;
 950         int slot;
 951         u32 item_size;
 952
 953         leaf = path->nodes[0];
 954         slot = path->slots[0];
 955         /* Not deleting the first item of a leaf to keep leaf structure */
 956         if (slot == 0)
 957                 del = 0;
 958         /* Only accept valid eb */
 959         if (slot >= btrfs_header_nritems(leaf)) {
 960                 error("invalid eb: no data or slot out of range: %d >= %d",
 961                                 slot, btrfs_header_nritems(leaf));
 962                 return -EINVAL;
 963         }
 964         btrfs_item_key_to_cpu(leaf, &key, slot);
 965         if (del) {
 966                 fprintf(stdout, "Deleting key and data [%llu, %u, %llu].\n",
 967                         key.objectid, key.type, key.offset);
 968                 btrfs_del_item(trans, root, path);
 969         } else {
 970                 fprintf(stdout, "Corrupting key and data [%llu, %u, %llu].\n",
 971                         key.objectid, key.type, key.offset);
 972                 ptr = btrfs_item_ptr_offset(leaf, slot);
 973                 item_size = btrfs_item_size_nr(leaf, slot);
 974                 memset_extent_buffer(leaf, 0, ptr, item_size);
 975                 btrfs_mark_buffer_dirty(leaf);
 976         }
 977         return ret;
 978 }
 979 static int corrupt_chunk_tree(struct btrfs_trans_handle *trans,
 980                        struct btrfs_root *root)
 981 {
 982         int ret;
 983         int del;
 984         int slot;
 985         struct btrfs_path *path;
 986         struct btrfs_key key;
 987         struct btrfs_key found_key;
 988         struct extent_buffer *leaf;
 989
 990         path = btrfs_alloc_path();
 991         if (!path)
 992                 return -ENOMEM;
 993
 994         key.objectid = (u64)-1;
 995         key.offset = (u64)-1;
 996         key.type = (u8)-1;
 997
 998         /* Here, cow and ins_len must equals 0 for the following reasons:
 999          * 1) chunk recover is based on disk scanning, so COW should be
1000          *    disabled in case the original chunk being scanned and
1001          *    recovered using the old chunk.
1002          * 2) if cow = 0, ins_len must also be set to 0, or BUG_ON will be
1003          *    triggered.
1004          */
1005         ret = btrfs_search_slot(trans, root, &key, path, 0, 0);
1006         BUG_ON(ret == 0);
1007         if (ret < 0) {
1008                 fprintf(stderr, "Error searching tree\n");
1009                 goto free_out;
1010         }
1011         /* corrupt/del dev_item first */
1012         while (!btrfs_previous_item(root, path, 0, BTRFS_DEV_ITEM_KEY)) {
1013                 slot = path->slots[0];
1014                 leaf = path->nodes[0];
1015                 del = rand_range(3);
1016                 /* Never delete the first item to keep the leaf structure */
1017                 if (path->slots[0] == 0)
1018                         del = 0;
1019                 ret = corrupt_item_nocow(trans, root, path, del);
1020                 if (ret)
1021                         goto free_out;
1022         }
1023         btrfs_release_path(path);
1024
1025         /* Here, cow and ins_len must equals 0 for the following reasons:
1026          * 1) chunk recover is based on disk scanning, so COW should be
1027          *    disabled in case the original chunk being scanned and
1028          *    recovered using the old chunk.
1029          * 2) if cow = 0, ins_len must also be set to 0, or BUG_ON will be
1030          *    triggered.
1031          */
1032         ret = btrfs_search_slot(trans, root, &key, path, 0, 0);
1033         BUG_ON(ret == 0);
1034         if (ret < 0) {
1035                 fprintf(stderr, "Error searching tree\n");
1036                 goto free_out;
1037         }
1038         /* corrupt/del chunk then*/
1039         while (!btrfs_previous_item(root, path, 0, BTRFS_CHUNK_ITEM_KEY)) {
1040                 slot = path->slots[0];
1041                 leaf = path->nodes[0];
1042                 del = rand_range(3);
1043                 btrfs_item_key_to_cpu(leaf, &found_key, slot);
1044                 ret = corrupt_item_nocow(trans, root, path, del);
1045                 if (ret)
1046                         goto free_out;
1047         }
1048 free_out:
1049         btrfs_free_path(path);
1050         return ret;
1051 }
1052 static int find_chunk_offset(struct btrfs_root *root,
1053                       struct btrfs_path *path, u64 offset)
1054 {
1055         struct btrfs_key key;
1056         int ret;
1057
1058         key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
1059         key.type = BTRFS_CHUNK_ITEM_KEY;
1060         key.offset = offset;
1061
1062         /* Here, cow and ins_len must equals 0 for following reasons:
1063          * 1) chunk recover is based on disk scanning, so COW should
1064          *    be disabled in case the original chunk being scanned
1065          *    and recovered using the old chunk.
1066          * 2) if cow = 0, ins_len must also be set to 0, or BUG_ON
1067          *    will be triggered.
1068          */
1069         ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1070         if (ret > 0) {
1071                 fprintf(stderr, "Can't find chunk with given offset %llu\n",
1072                         offset);
1073                 goto out;
1074         }
1075         if (ret < 0) {
1076                 fprintf(stderr, "Error searching chunk\n");
1077                 goto out;
1078         }
1079 out:
1080         return ret;
1081
1082 }
1083 int main(int argc, char **argv)
1084 {
1085         struct cache_tree root_cache;
1086         struct btrfs_key key;
1087         struct btrfs_root *root;
1088         char *dev;
1089         /* chunk offset can be 0,so change to (u64)-1 */
1090         u64 logical = (u64)-1;
1091         int ret = 0;
1092         u64 copy = 0;
1093         u64 bytes = 4096;
1094         int extent_rec = 0;
1095         int extent_tree = 0;
1096         int corrupt_block_keys = 0;
1097         int chunk_rec = 0;
1098         int chunk_tree = 0;
1099         int corrupt_item = 0;
1100         int corrupt_di = 0;
1101         int delete = 0;
1102         u64 metadata_block = 0;
1103         u64 inode = 0;
1104         u64 file_extent = (u64)-1;
1105         u64 root_objectid = 0;
1106         u64 csum_bytenr = 0;
1107         char field[FIELD_BUF_LEN];
1108
1109         field[0] = '\0';
1110         memset(&key, 0, sizeof(key));
1111
1112         while(1) {
1113                 int c;
1114                 static const struct option long_options[] = {
1115                         /* { "byte-count", 1, NULL, 'b' }, */
1116                         { "logical", required_argument, NULL, 'l' },
1117                         { "copy", required_argument, NULL, 'c' },
1118                         { "bytes", required_argument, NULL, 'b' },
1119                         { "extent-record", no_argument, NULL, 'e' },
1120                         { "extent-tree", no_argument, NULL, 'E' },
1121                         { "keys", no_argument, NULL, 'k' },
1122                         { "chunk-record", no_argument, NULL, 'u' },
1123                         { "chunk-tree", no_argument, NULL, 'U' },
1124                         { "inode", required_argument, NULL, 'i'},
1125                         { "file-extent", required_argument, NULL, 'x'},
1126                         { "metadata-block", required_argument, NULL, 'm'},
1127                         { "field", required_argument, NULL, 'f'},
1128                         { "key", required_argument, NULL, 'K'},
1129                         { "item", no_argument, NULL, 'I'},
1130                         { "dir-item", no_argument, NULL, 'D'},
1131                         { "delete", no_argument, NULL, 'd'},
1132                         { "root", no_argument, NULL, 'r'},
1133                         { "csum", required_argument, NULL, 'C'},
1134                         { "help", no_argument, NULL, GETOPT_VAL_HELP},
1135                         { NULL, 0, NULL, 0 }
1136                 };
1137
1138                 c = getopt_long(argc, argv, "l:c:b:eEkuUi:f:x:m:K:IDdr:C:",
1139                                 long_options, NULL);
1140                 if (c < 0)
1141                         break;
1142                 switch(c) {
1143                         case 'l':
1144                                 logical = arg_strtou64(optarg);
1145                                 break;
1146                         case 'c':
1147                                 copy = arg_strtou64(optarg);
1148                                 break;
1149                         case 'b':
1150                                 bytes = arg_strtou64(optarg);
1151                                 break;
1152                         case 'e':
1153                                 extent_rec = 1;
1154                                 break;
1155                         case 'E':
1156                                 extent_tree = 1;
1157                                 break;
1158                         case 'k':
1159                                 corrupt_block_keys = 1;
1160                                 break;
1161                         case 'u':
1162                                 chunk_rec = 1;
1163                                 break;
1164                         case 'U':
1165                                 chunk_tree = 1;
1166                                 break;
1167                         case 'i':
1168                                 inode = arg_strtou64(optarg);
1169                                 break;
1170                         case 'f':
1171                                 strncpy(field, optarg, FIELD_BUF_LEN);
1172                                 break;
1173                         case 'x':
1174                                 file_extent = arg_strtou64(optarg);
1175                                 break;
1176                         case 'm':
1177                                 metadata_block = arg_strtou64(optarg);
1178                                 break;
1179                         case 'K':
1180                                 ret = sscanf(optarg, "%llu,%u,%llu",
1181                                              &key.objectid,
1182                                              (unsigned int *)&key.type,
1183                                              &key.offset);
1184                                 if (ret != 3) {
1185                                         fprintf(stderr, "error reading key "
1186                                                 "%d\n", errno);
1187                                         print_usage(1);
1188                                 }
1189                                 break;
1190                         case 'D':
1191                                 corrupt_di = 1;
1192                                 break;
1193                         case 'I':
1194                                 corrupt_item = 1;
1195                                 break;
1196                         case 'd':
1197                                 delete = 1;
1198                                 break;
1199                         case 'r':
1200                                 root_objectid = arg_strtou64(optarg);
1201                                 break;
1202                         case 'C':
1203                                 csum_bytenr = arg_strtou64(optarg);
1204                                 break;
1205                         case GETOPT_VAL_HELP:
1206                         default:
1207                                 print_usage(c != GETOPT_VAL_HELP);
1208                 }
1209         }
1210         set_argv0(argv);
1211         if (check_argc_min(argc - optind, 1))
1212                 print_usage(1);
1213         dev = argv[optind];
1214
1215         radix_tree_init();
1216         cache_tree_init(&root_cache);
1217
1218         root = open_ctree(dev, 0, OPEN_CTREE_WRITES);
1219         if (!root) {
1220                 fprintf(stderr, "Open ctree failed\n");
1221                 exit(1);
1222         }
1223         if (extent_rec) {
1224                 struct btrfs_trans_handle *trans;
1225
1226                 if (logical == (u64)-1)
1227                         print_usage(1);
1228                 trans = btrfs_start_transaction(root, 1);
1229                 BUG_ON(IS_ERR(trans));
1230                 ret = corrupt_extent(trans, root, logical);
1231                 btrfs_commit_transaction(trans, root);
1232                 goto out_close;
1233         }
1234         if (extent_tree) {
1235                 struct btrfs_trans_handle *trans;
1236
1237                 trans = btrfs_start_transaction(root, 1);
1238                 BUG_ON(IS_ERR(trans));
1239                 btrfs_corrupt_extent_tree(trans, root->fs_info->extent_root,
1240                                           root->fs_info->extent_root->node);
1241                 btrfs_commit_transaction(trans, root);
1242                 goto out_close;
1243         }
1244         if (chunk_rec) {
1245                 struct btrfs_trans_handle *trans;
1246                 struct btrfs_path *path;
1247                 int del;
1248
1249                 if (logical == (u64)-1)
1250                         print_usage(1);
1251                 del = rand_range(3);
1252                 path = btrfs_alloc_path();
1253                 if (!path) {
1254                         fprintf(stderr, "path allocation failed\n");
1255                         goto out_close;
1256                 }
1257
1258                 if (find_chunk_offset(root->fs_info->chunk_root, path,
1259                                       logical) != 0) {
1260                         btrfs_free_path(path);
1261                         goto out_close;
1262                 }
1263                 trans = btrfs_start_transaction(root, 1);
1264                 BUG_ON(IS_ERR(trans));
1265                 ret = corrupt_item_nocow(trans, root->fs_info->chunk_root,
1266                                          path, del);
1267                 if (ret < 0)
1268                         fprintf(stderr, "Failed to corrupt chunk record\n");
1269                 btrfs_commit_transaction(trans, root);
1270                 goto out_close;
1271         }
1272         if (chunk_tree) {
1273                 struct btrfs_trans_handle *trans;
1274
1275                 trans = btrfs_start_transaction(root, 1);
1276                 BUG_ON(IS_ERR(trans));
1277                 ret = corrupt_chunk_tree(trans, root->fs_info->chunk_root);
1278                 if (ret < 0)
1279                         fprintf(stderr, "Failed to corrupt chunk tree\n");
1280                 btrfs_commit_transaction(trans, root);
1281                 goto out_close;
1282         }
1283         if (inode) {
1284                 struct btrfs_trans_handle *trans;
1285
1286                 if (*field == 0)
1287                         print_usage(1);
1288
1289                 trans = btrfs_start_transaction(root, 1);
1290                 BUG_ON(IS_ERR(trans));
1291                 if (file_extent == (u64)-1) {
1292                         printf("corrupting inode\n");
1293                         ret = corrupt_inode(trans, root, inode, field);
1294                 } else {
1295                         printf("corrupting file extent\n");
1296                         ret = corrupt_file_extent(trans, root, inode,
1297                                                   file_extent, field);
1298                 }
1299                 btrfs_commit_transaction(trans, root);
1300                 goto out_close;
1301         }
1302         if (metadata_block) {
1303                 if (*field == 0)
1304                         print_usage(1);
1305                 ret = corrupt_metadata_block(root->fs_info, metadata_block,
1306                                              field);
1307                 goto out_close;
1308         }
1309         if (corrupt_di) {
1310                 if (!key.objectid || *field == 0)
1311                         print_usage(1);
1312                 ret = corrupt_dir_item(root, &key, field);
1313                 goto out_close;
1314         }
1315         if (csum_bytenr) {
1316                 ret = delete_csum(root, csum_bytenr, bytes);
1317                 goto out_close;
1318         }
1319         if (corrupt_item) {
1320                 if (!key.objectid)
1321                         print_usage(1);
1322                 ret = corrupt_btrfs_item(root, &key, field);
1323         }
1324         if (delete) {
1325                 struct btrfs_root *target = root;
1326
1327                 if (!key.objectid)
1328                         print_usage(1);
1329                 if (root_objectid) {
1330                         struct btrfs_key root_key;
1331
1332                         root_key.objectid = root_objectid;
1333                         root_key.type = BTRFS_ROOT_ITEM_KEY;
1334                         root_key.offset = (u64)-1;
1335
1336                         target = btrfs_read_fs_root(root->fs_info, &root_key);
1337                         if (IS_ERR(target)) {
1338                                 fprintf(stderr, "Couldn't find root %llu\n",
1339                                         (unsigned long long)root_objectid);
1340                                 print_usage(1);
1341                         }
1342                 }
1343                 ret = delete_item(target, &key);
1344                 goto out_close;
1345         }
1346         if (key.objectid || key.offset || key.type) {
1347                 if (*field == 0)
1348                         print_usage(1);
1349                 ret = corrupt_key(root, &key, field);
1350                 goto out_close;
1351         }
1352         /*
1353          * If we made it here and we have extent set then we didn't specify
1354          * inode and we're screwed.
1355          */
1356         if (file_extent != (u64)-1)
1357                 print_usage(1);
1358
1359         if (logical == (u64)-1)
1360                 print_usage(1);
1361
1362         if (bytes == 0)
1363                 bytes = root->fs_info->sectorsize;
1364
1365         bytes = round_up(bytes, root->fs_info->sectorsize);
1366
1367         while (bytes > 0) {
1368                 if (corrupt_block_keys) {
1369                         corrupt_keys_in_block(root->fs_info, logical);
1370                 } else {
1371                         struct extent_buffer *eb;
1372
1373                         eb = btrfs_find_create_tree_block(root->fs_info,
1374                                         logical);
1375                         if (!eb) {
1376                                 error(
1377                 "not enough memory to allocate extent buffer for bytenr %llu",
1378                                         (unsigned long long)logical);
1379                                 ret = 1;
1380                                 goto out_close;
1381                         }
1382
1383                         debug_corrupt_block(eb, root, logical,
1384                                             root->fs_info->sectorsize, copy);
1385                         free_extent_buffer(eb);
1386                 }
1387                 logical += root->fs_info->sectorsize;
1388                 bytes -= root->fs_info->sectorsize;
1389         }
1390         return ret;
1391 out_close:
1392         close_ctree(root);
1393         return ret;
1394 }