print-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 "kerncompat.h"
  22 #include "radix-tree.h"
  23 #include "ctree.h"
  24 #include "disk-io.h"
  25
  26 static int print_dir_item(struct btrfs_item *item,
  27                           struct btrfs_dir_item *di)
  28 {
  29         u32 total;
  30         u32 cur = 0;
  31         u32 len;
  32         total = btrfs_item_size(item);
  33         while(cur < total) {
  34                 printf("\t\tdir index %llu type %u\n",
  35                      (unsigned long long)btrfs_disk_key_objectid(&di->location),
  36                      btrfs_dir_type(di));
  37                 printf("\t\tname: %.*s\n",
  38                        btrfs_dir_name_len(di),(char *)(di + 1));
  39                 if (btrfs_dir_data_len(di))
  40                         printf("\t\tdata: %.*s\n", btrfs_dir_data_len(di),
  41                                (char *)((char *)(di + 1) + btrfs_dir_name_len(di)));
  42                 len = sizeof(*di) + btrfs_dir_name_len(di) + btrfs_dir_data_len(di);
  43                 di = (struct btrfs_dir_item *)((char *)di + len);
  44                 cur += len;
  45         }
  46         return 0;
  47 }
  48
  49 static int print_inode_ref_item(struct btrfs_item *item,
  50                                 struct btrfs_inode_ref *ref)
  51 {
  52         u32 total;
  53         u32 cur = 0;
  54         u32 len;
  55         total = btrfs_item_size(item);
  56         while(cur < total) {
  57                 len = btrfs_inode_ref_name_len(ref);
  58                 printf("\t\tinode ref name: %.*s\n", len, (char *)(ref + 1));
  59                 len += sizeof(*ref);
  60                 ref = (struct btrfs_inode_ref *)((char *)ref + len);
  61                 cur += len;
  62         }
  63         return 0;
  64 }
  65
  66 void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
  67 {
  68         int i;
  69         u32 nr = btrfs_header_nritems(&l->header);
  70         struct btrfs_item *item;
  71         struct btrfs_extent_item *ei;
  72         struct btrfs_root_item *ri;
  73         struct btrfs_dir_item *di;
  74         struct btrfs_inode_item *ii;
  75         struct btrfs_file_extent_item *fi;
  76         struct btrfs_csum_item *ci;
  77         struct btrfs_block_group_item *bi;
  78         struct btrfs_extent_ref *ref;
  79         struct btrfs_inode_ref *iref;
  80         u32 type;
  81
  82         printf("leaf %llu ptrs %d free space %d generation %llu owner %llu\n",
  83                 (unsigned long long)btrfs_header_bytenr(&l->header), nr,
  84                 btrfs_leaf_free_space(root, l),
  85                 (unsigned long long)btrfs_header_generation(&l->header),
  86                 (unsigned long long)btrfs_header_owner(&l->header));
  87         fflush(stdout);
  88         for (i = 0 ; i < nr ; i++) {
  89                 item = l->items + i;
  90                 type = btrfs_disk_key_type(&item->key);
  91                 printf("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
  92                         i,
  93                         (unsigned long long)btrfs_disk_key_objectid(&item->key),
  94                         btrfs_disk_key_type(&item->key),
  95                         (unsigned long long)btrfs_disk_key_offset(&item->key),
  96                         btrfs_item_offset(item),
  97                         btrfs_item_size(item));
  98                 switch (type) {
  99                 case BTRFS_INODE_ITEM_KEY:
 100                         ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
 101                         printf("\t\tinode generation %llu size %llu block group %llu mode %o links %u\n",
 102                                (unsigned long long)btrfs_inode_generation(ii),
 103                                (unsigned long long)btrfs_inode_size(ii),
 104                                (unsigned long long)btrfs_inode_block_group(ii),
 105                                btrfs_inode_mode(ii),
 106                                btrfs_inode_nlink(ii));
 107                         break;
 108                 case BTRFS_INODE_REF_KEY:
 109                         iref = btrfs_item_ptr(l, i, struct btrfs_inode_ref);
 110                         print_inode_ref_item(l->items + i, iref);
 111                         break;
 112                 case BTRFS_DIR_ITEM_KEY:
 113                         di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
 114                         print_dir_item(l->items + i, di);
 115                         break;
 116                 case BTRFS_XATTR_ITEM_KEY:
 117                 case BTRFS_DIR_INDEX_KEY:
 118                         di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
 119                         print_dir_item(l->items + i, di);
 120                         break;
 121                 case BTRFS_ROOT_ITEM_KEY:
 122                         ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
 123                         printf("\t\troot data bytenr %llu level %d dirid %llu refs %u\n",
 124                                 (unsigned long long)btrfs_root_bytenr(ri),
 125                                 ri->level,
 126                                 (unsigned long long)btrfs_root_dirid(ri),
 127                                 btrfs_root_refs(ri));
 128                         if (1 || btrfs_root_refs(ri) == 0) {
 129                                 struct btrfs_key drop_key;
 130                                 btrfs_disk_key_to_cpu(&drop_key,
 131                                                       &ri->drop_progress);
 132                                 printf("\t\tdrop key %Lu %x %Lu level %d\n",
 133                                        (unsigned long long)drop_key.objectid,
 134                                        drop_key.type,
 135                                        (unsigned long long)drop_key.offset,
 136                                        ri->drop_level);
 137                         }
 138                         break;
 139                 case BTRFS_EXTENT_ITEM_KEY:
 140                         ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
 141                         printf("\t\textent data refs %u\n",
 142                                 btrfs_extent_refs(ei));
 143                         break;
 144                 case BTRFS_EXTENT_REF_KEY:
 145                         ref = btrfs_item_ptr(l, i, struct btrfs_extent_ref);
 146                         printf("\t\textent back ref root %llu gen %llu "
 147                                "owner %llu offset %llu\n",
 148                                (unsigned long long)btrfs_ref_root(ref),
 149                                (unsigned long long)btrfs_ref_generation(ref),
 150                                (unsigned long long)btrfs_ref_objectid(ref),
 151                                (unsigned long long)btrfs_ref_offset(ref));
 152                         break;
 153                 case BTRFS_CSUM_ITEM_KEY:
 154                         ci = btrfs_item_ptr(l, i,
 155                                             struct btrfs_csum_item);
 156                         printf("\t\tcsum item\n");
 157                         break;
 158                 case BTRFS_EXTENT_DATA_KEY:
 159                         fi = btrfs_item_ptr(l, i,
 160                                             struct btrfs_file_extent_item);
 161                         if (btrfs_file_extent_type(fi) ==
 162                             BTRFS_FILE_EXTENT_INLINE) {
 163                                 printf("\t\tinline extent data size %u\n",
 164                                    btrfs_file_extent_inline_len(l->items + i));
 165                                 break;
 166                         }
 167                         printf("\t\textent data disk byte %llu nr %llu\n",
 168                                (unsigned long long)btrfs_file_extent_disk_bytenr(fi),
 169                                (unsigned long long)btrfs_file_extent_disk_num_bytes(fi));
 170                         printf("\t\textent data offset %llu nr %llu\n",
 171                           (unsigned long long)btrfs_file_extent_offset(fi),
 172                           (unsigned long long)btrfs_file_extent_num_bytes(fi));
 173                         break;
 174                 case BTRFS_BLOCK_GROUP_ITEM_KEY:
 175                         bi = btrfs_item_ptr(l, i,
 176                                             struct btrfs_block_group_item);
 177                         printf("\t\tblock group used %llu flags %x\n",
 178                                (unsigned long long)btrfs_block_group_used(bi),
 179                                bi->flags);
 180                         break;
 181                 case BTRFS_STRING_ITEM_KEY:
 182                         printf("\t\titem data %.*s\n", btrfs_item_size(item),
 183                                 btrfs_leaf_data(l) + btrfs_item_offset(item));
 184                         break;
 185                 };
 186                 fflush(stdout);
 187         }
 188 }
 189 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
 190 {
 191         int i;
 192         u32 nr;
 193         struct btrfs_node *c;
 194         u32 size;
 195
 196         if (!t)
 197                 return;
 198         c = &t->node;
 199         nr = btrfs_header_nritems(&c->header);
 200         if (btrfs_is_leaf(c)) {
 201                 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
 202                 return;
 203         }
 204         printf("node %llu level %d ptrs %d free %u generation %llu owner %llu\n",
 205                (unsigned long long)t->bytenr,
 206                 btrfs_header_level(&c->header), nr,
 207                 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
 208                 (unsigned long long)btrfs_header_generation(&c->header),
 209                 (unsigned long long)btrfs_header_owner(&c->header));
 210         fflush(stdout);
 211         size = btrfs_level_size(root, btrfs_header_level(&c->header) - 1);
 212         for (i = 0; i < nr; i++) {
 213                 u64 blocknr = btrfs_node_blockptr(c, i);
 214                 printf("\tkey %d (%llu %x %llu) block %llu (%llu) gen %llu\n",
 215                        i,
 216                        (unsigned long long)c->ptrs[i].key.objectid,
 217                        c->ptrs[i].key.type,
 218                        (unsigned long long)c->ptrs[i].key.offset,
 219                        (unsigned long long)blocknr,
 220                        (unsigned long long)blocknr / size,
 221                        (unsigned long long)btrfs_node_ptr_generation(c, i));
 222                 fflush(stdout);
 223         }
 224         for (i = 0; i < nr; i++) {
 225                 struct btrfs_buffer *next_buf = read_tree_block(root,
 226                                                 btrfs_node_blockptr(c, i),
 227                                                 size);
 228                 struct btrfs_node *next = &next_buf->node;
 229                 if (btrfs_is_leaf(next) &&
 230                     btrfs_header_level(&c->header) != 1)
 231                         BUG();
 232                 if (btrfs_header_level(&next->header) !=
 233                         btrfs_header_level(&c->header) - 1)
 234                         BUG();
 235                 btrfs_print_tree(root, next_buf);
 236                 btrfs_block_release(root, next_buf);
 237         }
 238 }
 239