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 void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
  49 {
  50         int i;
  51         u32 nr = btrfs_header_nritems(&l->header);
  52         struct btrfs_item *item;
  53         struct btrfs_extent_item *ei;
  54         struct btrfs_root_item *ri;
  55         struct btrfs_dir_item *di;
  56         struct btrfs_inode_item *ii;
  57         struct btrfs_file_extent_item *fi;
  58         struct btrfs_csum_item *ci;
  59         struct btrfs_block_group_item *bi;
  60         u32 type;
  61
  62         printf("leaf %llu ptrs %d free space %d generation %llu owner %llu\n",
  63                 (unsigned long long)btrfs_header_bytenr(&l->header), nr,
  64                 btrfs_leaf_free_space(root, l),
  65                 (unsigned long long)btrfs_header_generation(&l->header),
  66                 (unsigned long long)btrfs_header_owner(&l->header));
  67         fflush(stdout);
  68         for (i = 0 ; i < nr ; i++) {
  69                 item = l->items + i;
  70                 type = btrfs_disk_key_type(&item->key);
  71                 printf("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
  72                         i,
  73                         (unsigned long long)btrfs_disk_key_objectid(&item->key),
  74                         btrfs_disk_key_type(&item->key),
  75                         (unsigned long long)btrfs_disk_key_offset(&item->key),
  76                         btrfs_item_offset(item),
  77                         btrfs_item_size(item));
  78                 switch (type) {
  79                 case BTRFS_INODE_ITEM_KEY:
  80                         ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
  81                         printf("\t\tinode generation %llu size %llu block group %llu mode %o links %u\n",
  82                                (unsigned long long)btrfs_inode_generation(ii),
  83                                (unsigned long long)btrfs_inode_size(ii),
  84                                (unsigned long long)btrfs_inode_block_group(ii),
  85                                btrfs_inode_mode(ii),
  86                                btrfs_inode_nlink(ii));
  87                         break;
  88                 case BTRFS_DIR_ITEM_KEY:
  89                         di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  90                         print_dir_item(l->items + i, di);
  91                         break;
  92                 case BTRFS_XATTR_ITEM_KEY:
  93                 case BTRFS_DIR_INDEX_KEY:
  94                         di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  95                         print_dir_item(l->items + i, di);
  96                         break;
  97                 case BTRFS_ROOT_ITEM_KEY:
  98                         ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  99                         printf("\t\troot data bytenr %llu level %d dirid %llu refs %u\n",
 100                                 (unsigned long long)btrfs_root_bytenr(ri),
 101                                 ri->level,
 102                                 (unsigned long long)btrfs_root_dirid(ri),
 103                                 btrfs_root_refs(ri));
 104                         if (1 || btrfs_root_refs(ri) == 0) {
 105                                 struct btrfs_key drop_key;
 106                                 btrfs_disk_key_to_cpu(&drop_key,
 107                                                       &ri->drop_progress);
 108                                 printf("\t\tdrop key %Lu %x %Lu level %d\n",
 109                                        (unsigned long long)drop_key.objectid,
 110                                        drop_key.type,
 111                                        (unsigned long long)drop_key.offset,
 112                                        ri->drop_level);
 113                         }
 114                         break;
 115                 case BTRFS_EXTENT_ITEM_KEY:
 116                         ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
 117                         printf("\t\textent data refs %u owner %llu\n",
 118                                 btrfs_extent_refs(ei),
 119                                 (unsigned long long)btrfs_extent_owner(ei));
 120                         break;
 121                 case BTRFS_CSUM_ITEM_KEY:
 122                         ci = btrfs_item_ptr(l, i,
 123                                             struct btrfs_csum_item);
 124                         printf("\t\tcsum item\n");
 125                         break;
 126                 case BTRFS_EXTENT_DATA_KEY:
 127                         fi = btrfs_item_ptr(l, i,
 128                                             struct btrfs_file_extent_item);
 129                         if (btrfs_file_extent_type(fi) ==
 130                             BTRFS_FILE_EXTENT_INLINE) {
 131                                 printf("\t\tinline extent data size %u\n",
 132                                    btrfs_file_extent_inline_len(l->items + i));
 133                                 break;
 134                         }
 135                         printf("\t\textent data disk byte %llu nr %llu\n",
 136                                (unsigned long long)btrfs_file_extent_disk_bytenr(fi),
 137                                (unsigned long long)btrfs_file_extent_disk_num_bytes(fi));
 138                         printf("\t\textent data offset %llu nr %llu\n",
 139                           (unsigned long long)btrfs_file_extent_offset(fi),
 140                           (unsigned long long)btrfs_file_extent_num_bytes(fi));
 141                         break;
 142                 case BTRFS_BLOCK_GROUP_ITEM_KEY:
 143                         bi = btrfs_item_ptr(l, i,
 144                                             struct btrfs_block_group_item);
 145                         printf("\t\tblock group used %llu flags %x\n",
 146                                (unsigned long long)btrfs_block_group_used(bi),
 147                                bi->flags);
 148                         break;
 149                 case BTRFS_STRING_ITEM_KEY:
 150                         printf("\t\titem data %.*s\n", btrfs_item_size(item),
 151                                 btrfs_leaf_data(l) + btrfs_item_offset(item));
 152                         break;
 153                 };
 154                 fflush(stdout);
 155         }
 156 }
 157 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
 158 {
 159         int i;
 160         u32 nr;
 161         struct btrfs_node *c;
 162         u32 size;
 163
 164         if (!t)
 165                 return;
 166         c = &t->node;
 167         nr = btrfs_header_nritems(&c->header);
 168         if (btrfs_is_leaf(c)) {
 169                 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
 170                 return;
 171         }
 172         printf("node %llu level %d ptrs %d free %u generation %llu owner %llu\n",
 173                (unsigned long long)t->bytenr,
 174                 btrfs_header_level(&c->header), nr,
 175                 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
 176                 (unsigned long long)btrfs_header_generation(&c->header),
 177                 (unsigned long long)btrfs_header_owner(&c->header));
 178         fflush(stdout);
 179         size = btrfs_level_size(root, btrfs_header_level(&c->header) - 1);
 180         for (i = 0; i < nr; i++) {
 181                 u64 blocknr = btrfs_node_blockptr(c, i);
 182                 printf("\tkey %d (%llu %x %llu) block %llu (%llu)\n",
 183                        i,
 184                        (unsigned long long)c->ptrs[i].key.objectid,
 185                        c->ptrs[i].key.type,
 186                        (unsigned long long)c->ptrs[i].key.offset,
 187                        (unsigned long long)blocknr,
 188                        (unsigned long long)blocknr / size);
 189                 fflush(stdout);
 190         }
 191         for (i = 0; i < nr; i++) {
 192                 struct btrfs_buffer *next_buf = read_tree_block(root,
 193                                                 btrfs_node_blockptr(c, i),
 194                                                 size);
 195                 struct btrfs_node *next = &next_buf->node;
 196                 if (btrfs_is_leaf(next) &&
 197                     btrfs_header_level(&c->header) != 1)
 198                         BUG();
 199                 if (btrfs_header_level(&next->header) !=
 200                         btrfs_header_level(&c->header) - 1)
 201                         BUG();
 202                 btrfs_print_tree(root, next_buf);
 203                 btrfs_block_release(root, next_buf);
 204         }
 205 }
 206