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_extent_leaf(struct btrfs_root *root, struct extent_buffer *l)
  39 {
  40         int i;
  41         struct btrfs_item *item;
  42 //      struct btrfs_extent_ref *ref;
  43         struct btrfs_key key;
  44         static u64 last = 0;
  45         static u64 last_len = 0;
  46         u32 nr = btrfs_header_nritems(l);
  47         u32 type;
  48
  49         for (i = 0 ; i < nr ; i++) {
  50                 item = btrfs_item_nr(l, i);
  51                 btrfs_item_key_to_cpu(l, &key, i);
  52                 type = btrfs_key_type(&key);
  53                 switch (type) {
  54                 case BTRFS_EXTENT_ITEM_KEY:
  55                         last_len = key.offset;
  56                         last = key.objectid;
  57                         break;
  58 #if 0
  59                 case BTRFS_EXTENT_REF_KEY:
  60                         ref = btrfs_item_ptr(l, i, struct btrfs_extent_ref);
  61                         printf("%llu %llu extent back ref root %llu gen %llu "
  62                                "owner %llu num_refs %lu\n",
  63                                (unsigned long long)last,
  64                                (unsigned long long)last_len,
  65                                (unsigned long long)btrfs_ref_root(l, ref),
  66                                (unsigned long long)btrfs_ref_generation(l, ref),
  67                                (unsigned long long)btrfs_ref_objectid(l, ref),
  68                                (unsigned long)btrfs_ref_num_refs(l, ref));
  69                         break;
  70 #endif
  71                 };
  72                 fflush(stdout);
  73         }
  74 }
  75
  76 static void print_extents(struct btrfs_root *root, struct extent_buffer *eb)
  77 {
  78         int i;
  79         u32 nr;
  80         u32 size;
  81
  82         if (!eb)
  83                 return;
  84         if (btrfs_is_leaf(eb)) {
  85                 print_extent_leaf(root, eb);
  86                 return;
  87         }
  88         size = btrfs_level_size(root, btrfs_header_level(eb) - 1);
  89         nr = btrfs_header_nritems(eb);
  90         for (i = 0; i < nr; i++) {
  91                 struct extent_buffer *next = read_tree_block(root,
  92                                              btrfs_node_blockptr(eb, i),
  93                                              size,
  94                                              btrfs_node_ptr_generation(eb, i));
  95                 if (btrfs_is_leaf(next) &&
  96                     btrfs_header_level(eb) != 1)
  97                         BUG();
  98                 if (btrfs_header_level(next) !=
  99                         btrfs_header_level(eb) - 1)
 100                         BUG();
 101                 print_extents(root, next);
 102                 free_extent_buffer(next);
 103         }
 104 }
 105
 106 int main(int ac, char **av)
 107 {
 108         struct btrfs_root *root;
 109         struct btrfs_path path;
 110         struct btrfs_key key;
 111         struct btrfs_root_item ri;
 112         struct extent_buffer *leaf;
 113         struct btrfs_disk_key disk_key;
 114         struct btrfs_key found_key;
 115         char uuidbuf[37];
 116         int ret;
 117         int slot;
 118         int extent_only = 0;
 119         struct btrfs_root *tree_root_scan;
 120
 121         radix_tree_init();
 122
 123         while(1) {
 124                 int c;
 125                 c = getopt(ac, av, "e");
 126                 if (c < 0)
 127                         break;
 128                 switch(c) {
 129                         case 'e':
 130                                 extent_only = 1;
 131                                 break;
 132                         default:
 133                                 print_usage();
 134                 }
 135         }
 136         ac = ac - optind;
 137         if (ac != 1)
 138                 print_usage();
 139
 140         root = open_ctree(av[optind], 0, 0);
 141         if (!root) {
 142                 fprintf(stderr, "unable to open %s\n", av[optind]);
 143                 exit(1);
 144         }
 145         if (!extent_only) {
 146                 printf("root tree\n");
 147                 btrfs_print_tree(root->fs_info->tree_root,
 148                                  root->fs_info->tree_root->node);
 149
 150                 printf("chunk tree\n");
 151                 btrfs_print_tree(root->fs_info->chunk_root,
 152                                  root->fs_info->chunk_root->node);
 153         }
 154         tree_root_scan = root->fs_info->tree_root;
 155
 156         btrfs_init_path(&path);
 157 again:
 158         key.offset = 0;
 159         key.objectid = 0;
 160         btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
 161         ret = btrfs_search_slot(NULL, tree_root_scan, &key, &path, 0, 0);
 162         BUG_ON(ret < 0);
 163         while(1) {
 164                 leaf = path.nodes[0];
 165                 slot = path.slots[0];
 166                 if (slot >= btrfs_header_nritems(leaf)) {
 167                         ret = btrfs_next_leaf(tree_root_scan, &path);
 168                         if (ret != 0)
 169                                 break;
 170                         leaf = path.nodes[0];
 171                         slot = path.slots[0];
 172                 }
 173                 btrfs_item_key(leaf, &disk_key, path.slots[0]);
 174                 btrfs_disk_key_to_cpu(&found_key, &disk_key);
 175                 if (btrfs_key_type(&found_key) == BTRFS_ROOT_ITEM_KEY) {
 176                         unsigned long offset;
 177                         struct extent_buffer *buf;
 178                         int skip = extent_only;
 179
 180                         offset = btrfs_item_ptr_offset(leaf, slot);
 181                         read_extent_buffer(leaf, &ri, offset, sizeof(ri));
 182                         buf = read_tree_block(tree_root_scan,
 183                                               btrfs_root_bytenr(&ri),
 184                                               tree_root_scan->leafsize, 0);
 185                         switch(found_key.objectid) {
 186                         case BTRFS_ROOT_TREE_OBJECTID:
 187                                 if (!skip)
 188                                         printf("root");
 189                                 break;
 190                         case BTRFS_EXTENT_TREE_OBJECTID:
 191                                 skip = 0;
 192                                 if (!extent_only)
 193                                         printf("extent");
 194                                 break;
 195                         case BTRFS_CHUNK_TREE_OBJECTID:
 196                                 if (!skip) {
 197                                         printf("chunk");
 198                                 }
 199                                 break;
 200                         case BTRFS_DEV_TREE_OBJECTID:
 201                                 if (!skip) {
 202                                         printf("device");
 203                                 }
 204                                 break;
 205                         case BTRFS_FS_TREE_OBJECTID:
 206                                 if (!skip) {
 207                                         printf("fs");
 208                                 }
 209                                 break;
 210                         case BTRFS_ROOT_TREE_DIR_OBJECTID:
 211                                 if (!skip) {
 212                                         printf("directory");
 213                                 }
 214                                 break;
 215                         case BTRFS_CSUM_TREE_OBJECTID:
 216                                 if (!skip) {
 217                                         printf("checksum");
 218                                 }
 219                                 break;
 220                         case BTRFS_ORPHAN_OBJECTID:
 221                                 if (!skip) {
 222                                         printf("orphan");
 223                                 }
 224                                 break;
 225                         case BTRFS_TREE_LOG_OBJECTID:
 226                                 if (!skip) {
 227                                         printf("log");
 228                                 }
 229                                 break;
 230                         case BTRFS_TREE_LOG_FIXUP_OBJECTID:
 231                                 if (!skip) {
 232                                         printf("log fixup");
 233                                 }
 234                                 break;
 235                         case BTRFS_TREE_RELOC_OBJECTID:
 236                                 if (!skip) {
 237                                         printf("reloc");
 238                                 }
 239                                 break;
 240                         case BTRFS_DATA_RELOC_TREE_OBJECTID:
 241                                 if (!skip) {
 242                                         printf("data reloc");
 243                                 }
 244                                 break;
 245                         case BTRFS_EXTENT_CSUM_OBJECTID:
 246                                 if (!skip) {
 247                                         printf("extent checksum");
 248                                 }
 249                         case BTRFS_MULTIPLE_OBJECTIDS:
 250                                 if (!skip) {
 251                                         printf("multiple");
 252                                 }
 253                                 break;
 254                         default:
 255                                 if (!skip) {
 256                                         printf("file");
 257                                 }
 258                         }
 259                         if (!skip && !extent_only) {
 260                                 printf(" tree ");
 261                                 btrfs_print_key(&disk_key);
 262                                 printf(" \n");
 263                                 btrfs_print_tree(tree_root_scan, buf);
 264                         } else if (extent_only && !skip) {
 265                                 print_extents(tree_root_scan, buf);
 266                         }
 267                 }
 268                 path.slots[0]++;
 269         }
 270         btrfs_release_path(root, &path);
 271
 272         if (tree_root_scan == root->fs_info->tree_root &&
 273             root->fs_info->log_root_tree) {
 274                 tree_root_scan = root->fs_info->log_root_tree;
 275                 goto again;
 276         }
 277
 278         if (extent_only)
 279                 return 0;
 280
 281         printf("total bytes %llu\n",
 282                (unsigned long long)btrfs_super_total_bytes(&root->fs_info->super_copy));
 283         printf("bytes used %llu\n",
 284                (unsigned long long)btrfs_super_bytes_used(&root->fs_info->super_copy));
 285         uuidbuf[36] = '\0';
 286         uuid_unparse(root->fs_info->super_copy.fsid, uuidbuf);
 287         printf("uuid %s\n", uuidbuf);
 288         printf("%s\n", BTRFS_BUILD_VERSION);
 289         return 0;
 290 }