debug-tree.c

   1 /*
   2  * Copyright (C) 2007 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 <unistd.h>
  22 #include <uuid/uuid.h>
  23 #include "kerncompat.h"
  24 #include "radix-tree.h"
  25 #include "ctree.h"
  26 #include "disk-io.h"
  27 #include "print-tree.h"
  28 #include "transaction.h"
  29 #include "version.h"
  30
  31 static int print_usage(void)
  32 {
  33         fprintf(stderr, "usage: debug-tree [ -e ] device\n");
  34         fprintf(stderr, "%s\n", BTRFS_BUILD_VERSION);
  35         exit(1);
  36 }
  37
  38 static void print_extents(struct btrfs_root *root, struct extent_buffer *eb)
  39 {
  40         int i;
  41         u32 nr;
  42         u32 size;
  43
  44         if (!eb)
  45                 return;
  46
  47         size = btrfs_level_size(root, btrfs_header_level(eb) - 1);
  48         nr = btrfs_header_nritems(eb);
  49         for (i = 0; i < nr; i++) {
  50                 struct extent_buffer *next = read_tree_block(root,
  51                                              btrfs_node_blockptr(eb, i),
  52                                              size,
  53                                              btrfs_node_ptr_generation(eb, i));
  54                 if (btrfs_is_leaf(next) &&
  55                     btrfs_header_level(eb) != 1)
  56                         BUG();
  57                 if (btrfs_header_level(next) !=
  58                         btrfs_header_level(eb) - 1)
  59                         BUG();
  60                 print_extents(root, next);
  61                 free_extent_buffer(next);
  62         }
  63 }
  64
  65 static void print_old_roots(struct btrfs_super_block *super)
  66 {
  67         struct btrfs_root_backup *backup;
  68         int i;
  69
  70         for (i = 0; i < BTRFS_NUM_BACKUP_ROOTS; i++) {
  71                 backup = super->super_roots + i;
  72                 printf("btrfs root backup slot %d\n", i);
  73                 printf("\ttree root gen %llu block %llu\n",
  74                        (unsigned long long)btrfs_backup_tree_root_gen(backup),
  75                        (unsigned long long)btrfs_backup_tree_root(backup));
  76
  77                 printf("\t\textent root gen %llu block %llu\n",
  78                        (unsigned long long)btrfs_backup_extent_root_gen(backup),
  79                        (unsigned long long)btrfs_backup_extent_root(backup));
  80
  81                 printf("\t\tchunk root gen %llu block %llu\n",
  82                        (unsigned long long)btrfs_backup_chunk_root_gen(backup),
  83                        (unsigned long long)btrfs_backup_chunk_root(backup));
  84
  85                 printf("\t\tdevice root gen %llu block %llu\n",
  86                        (unsigned long long)btrfs_backup_dev_root_gen(backup),
  87                        (unsigned long long)btrfs_backup_dev_root(backup));
  88
  89                 printf("\t\tcsum root gen %llu block %llu\n",
  90                        (unsigned long long)btrfs_backup_csum_root_gen(backup),
  91                        (unsigned long long)btrfs_backup_csum_root(backup));
  92
  93                 printf("\t\tfs root gen %llu block %llu\n",
  94                        (unsigned long long)btrfs_backup_fs_root_gen(backup),
  95                        (unsigned long long)btrfs_backup_fs_root(backup));
  96
  97                 printf("\t\t%llu used %llu total %llu devices\n",
  98                        (unsigned long long)btrfs_backup_bytes_used(backup),
  99                        (unsigned long long)btrfs_backup_total_bytes(backup),
 100                        (unsigned long long)btrfs_backup_num_devices(backup));
 101         }
 102 }
 103
 104 int main(int ac, char **av)
 105 {
 106         struct btrfs_root *root;
 107         struct btrfs_path path;
 108         struct btrfs_key key;
 109         struct btrfs_root_item ri;
 110         struct extent_buffer *leaf;
 111         struct btrfs_disk_key disk_key;
 112         struct btrfs_key found_key;
 113         char uuidbuf[37];
 114         int ret;
 115         int slot;
 116         int extent_only = 0;
 117         int device_only = 0;
 118         int roots_only = 0;
 119         int root_backups = 0;
 120         u64 block_only = 0;
 121         struct btrfs_root *tree_root_scan;
 122
 123         radix_tree_init();
 124
 125         while(1) {
 126                 int c;
 127                 c = getopt(ac, av, "deb:rR");
 128                 if (c < 0)
 129                         break;
 130                 switch(c) {
 131                         case 'e':
 132                                 extent_only = 1;
 133                                 break;
 134                         case 'd':
 135                                 device_only = 1;
 136                                 break;
 137                         case 'r':
 138                                 roots_only = 1;
 139                                 break;
 140                         case 'R':
 141                                 roots_only = 1;
 142                                 root_backups = 1;
 143                                 break;
 144                         case 'b':
 145                                 block_only = atoll(optarg);
 146                                 break;
 147                         default:
 148                                 print_usage();
 149                 }
 150         }
 151         ac = ac - optind;
 152         if (ac != 1)
 153                 print_usage();
 154
 155         root = open_ctree(av[optind], 0, 0);
 156         if (!root) {
 157                 fprintf(stderr, "unable to open %s\n", av[optind]);
 158                 exit(1);
 159         }
 160         if (block_only) {
 161                 leaf = read_tree_block(root,
 162                                       block_only,
 163                                       root->leafsize, 0);
 164
 165                 if (leaf && btrfs_header_level(leaf) != 0) {
 166                         free_extent_buffer(leaf);
 167                         leaf = NULL;
 168                 }
 169
 170                 if (!leaf) {
 171                         leaf = read_tree_block(root,
 172                                               block_only,
 173                                               root->nodesize, 0);
 174                 }
 175                 if (!leaf) {
 176                         fprintf(stderr, "failed to read %llu\n",
 177                                 (unsigned long long)block_only);
 178                         return 0;
 179                 }
 180                 btrfs_print_tree(root, leaf, 0);
 181                 return 0;
 182         }
 183
 184         if (!extent_only) {
 185                 if (roots_only) {
 186                         printf("root tree: %llu level %d\n",
 187                              (unsigned long long)root->fs_info->tree_root->node->start,
 188                              btrfs_header_level(root->fs_info->tree_root->node));
 189                         printf("chunk tree: %llu level %d\n",
 190                              (unsigned long long)root->fs_info->chunk_root->node->start,
 191                              btrfs_header_level(root->fs_info->chunk_root->node));
 192                 } else {
 193                         printf("root tree\n");
 194                         btrfs_print_tree(root->fs_info->tree_root,
 195                                          root->fs_info->tree_root->node, 1);
 196
 197                         printf("chunk tree\n");
 198                         btrfs_print_tree(root->fs_info->chunk_root,
 199                                          root->fs_info->chunk_root->node, 1);
 200                 }
 201         }
 202         tree_root_scan = root->fs_info->tree_root;
 203
 204         btrfs_init_path(&path);
 205 again:
 206         key.offset = 0;
 207         key.objectid = 0;
 208         btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
 209         ret = btrfs_search_slot(NULL, tree_root_scan, &key, &path, 0, 0);
 210         BUG_ON(ret < 0);
 211         while(1) {
 212                 leaf = path.nodes[0];
 213                 slot = path.slots[0];
 214                 if (slot >= btrfs_header_nritems(leaf)) {
 215                         ret = btrfs_next_leaf(tree_root_scan, &path);
 216                         if (ret != 0)
 217                                 break;
 218                         leaf = path.nodes[0];
 219                         slot = path.slots[0];
 220                 }
 221                 btrfs_item_key(leaf, &disk_key, path.slots[0]);
 222                 btrfs_disk_key_to_cpu(&found_key, &disk_key);
 223                 if (btrfs_key_type(&found_key) == BTRFS_ROOT_ITEM_KEY) {
 224                         unsigned long offset;
 225                         struct extent_buffer *buf;
 226                         int skip = extent_only | device_only;
 227
 228                         offset = btrfs_item_ptr_offset(leaf, slot);
 229                         read_extent_buffer(leaf, &ri, offset, sizeof(ri));
 230                         buf = read_tree_block(tree_root_scan,
 231                                               btrfs_root_bytenr(&ri),
 232                                               btrfs_level_size(tree_root_scan,
 233                                                         btrfs_root_level(&ri)),
 234                                               0);
 235                         switch(found_key.objectid) {
 236                         case BTRFS_ROOT_TREE_OBJECTID:
 237                                 if (!skip)
 238                                         printf("root");
 239                                 break;
 240                         case BTRFS_EXTENT_TREE_OBJECTID:
 241                                 if (!device_only)
 242                                         skip = 0;
 243                                 if (!extent_only && !device_only)
 244                                         printf("extent");
 245                                 break;
 246                         case BTRFS_CHUNK_TREE_OBJECTID:
 247                                 if (!skip) {
 248                                         printf("chunk");
 249                                 }
 250                                 break;
 251                         case BTRFS_DEV_TREE_OBJECTID:
 252                                 skip = 0;
 253                                 printf("device");
 254                                 break;
 255                         case BTRFS_FS_TREE_OBJECTID:
 256                                 if (!skip) {
 257                                         printf("fs");
 258                                 }
 259                                 break;
 260                         case BTRFS_ROOT_TREE_DIR_OBJECTID:
 261                                 skip = 0;
 262                                 printf("directory");
 263                                 break;
 264                         case BTRFS_CSUM_TREE_OBJECTID:
 265                                 if (!skip) {
 266                                         printf("checksum");
 267                                 }
 268                                 break;
 269                         case BTRFS_ORPHAN_OBJECTID:
 270                                 if (!skip) {
 271                                         printf("orphan");
 272                                 }
 273                                 break;
 274                         case BTRFS_TREE_LOG_OBJECTID:
 275                                 if (!skip) {
 276                                         printf("log");
 277                                 }
 278                                 break;
 279                         case BTRFS_TREE_LOG_FIXUP_OBJECTID:
 280                                 if (!skip) {
 281                                         printf("log fixup");
 282                                 }
 283                                 break;
 284                         case BTRFS_TREE_RELOC_OBJECTID:
 285                                 if (!skip) {
 286                                         printf("reloc");
 287                                 }
 288                                 break;
 289                         case BTRFS_DATA_RELOC_TREE_OBJECTID:
 290                                 if (!skip) {
 291                                         printf("data reloc");
 292                                 }
 293                                 break;
 294                         case BTRFS_EXTENT_CSUM_OBJECTID:
 295                                 if (!skip) {
 296                                         printf("extent checksum");
 297                                 }
 298                         case BTRFS_MULTIPLE_OBJECTIDS:
 299                                 if (!skip) {
 300                                         printf("multiple");
 301                                 }
 302                                 break;
 303                         default:
 304                                 if (!skip) {
 305                                         printf("file");
 306                                 }
 307                         }
 308                         if (extent_only && !skip) {
 309                                 print_extents(tree_root_scan, buf);
 310                         } else if (!skip) {
 311                                 printf(" tree ");
 312                                 btrfs_print_key(&disk_key);
 313                                 if (roots_only) {
 314                                         printf(" %llu level %d\n",
 315                                                (unsigned long long)buf->start,
 316                                                btrfs_header_level(buf));
 317                                 } else {
 318                                         printf(" \n");
 319                                         btrfs_print_tree(tree_root_scan, buf, 1);
 320                                 }
 321                         }
 322                 }
 323                 path.slots[0]++;
 324         }
 325         btrfs_release_path(root, &path);
 326
 327         if (tree_root_scan == root->fs_info->tree_root &&
 328             root->fs_info->log_root_tree) {
 329                 tree_root_scan = root->fs_info->log_root_tree;
 330                 goto again;
 331         }
 332
 333         if (extent_only || device_only)
 334                 return 0;
 335
 336         if (root_backups)
 337                 print_old_roots(&root->fs_info->super_copy);
 338
 339         printf("total bytes %llu\n",
 340                (unsigned long long)btrfs_super_total_bytes(&root->fs_info->super_copy));
 341         printf("bytes used %llu\n",
 342                (unsigned long long)btrfs_super_bytes_used(&root->fs_info->super_copy));
 343         uuidbuf[36] = '\0';
 344         uuid_unparse(root->fs_info->super_copy.fsid, uuidbuf);
 345         printf("uuid %s\n", uuidbuf);
 346         printf("%s\n", BTRFS_BUILD_VERSION);
 347         return 0;
 348 }