fs/btrfs/print-tree.c

   1 #include <linux/module.h>
   2 #include "ctree.h"
   3 #include "disk-io.h"
   4
   5 void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
   6 {
   7         int i;
   8         u32 nr = btrfs_header_nritems(&l->header);
   9         struct btrfs_item *item;
  10         struct btrfs_extent_item *ei;
  11         struct btrfs_root_item *ri;
  12         struct btrfs_dir_item *di;
  13         struct btrfs_inode_map_item *mi;
  14         struct btrfs_inode_item *ii;
  15         u32 type;
  16
  17         printk("leaf %Lu total ptrs %d free space %d\n",
  18                 btrfs_header_blocknr(&l->header), nr,
  19                 btrfs_leaf_free_space(root, l));
  20         for (i = 0 ; i < nr ; i++) {
  21                 item = l->items + i;
  22                 type = btrfs_disk_key_type(&item->key);
  23                 printk("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n",
  24                         i,
  25                         btrfs_disk_key_objectid(&item->key),
  26                         btrfs_disk_key_flags(&item->key),
  27                         btrfs_disk_key_offset(&item->key),
  28                         btrfs_item_offset(item),
  29                         btrfs_item_size(item));
  30                 switch (type) {
  31                 case BTRFS_INODE_ITEM_KEY:
  32                         ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
  33                         printk("\t\tinode generation %Lu size %Lu mode %o\n",
  34                                btrfs_inode_generation(ii),
  35                                btrfs_inode_size(ii),
  36                                btrfs_inode_mode(ii));
  37                         break;
  38                 case BTRFS_DIR_ITEM_KEY:
  39                         di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  40                         printk("\t\tdir oid %Lu flags %u type %u\n",
  41                                 btrfs_dir_objectid(di),
  42                                 btrfs_dir_flags(di),
  43                                 btrfs_dir_type(di));
  44                         printk("\t\tname %.*s\n",
  45                                btrfs_dir_name_len(di),(char *)(di + 1));
  46                         break;
  47                 case BTRFS_ROOT_ITEM_KEY:
  48                         ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  49                         printk("\t\troot data blocknr %Lu refs %u\n",
  50                                 btrfs_root_blocknr(ri), btrfs_root_refs(ri));
  51                         break;
  52                 case BTRFS_EXTENT_ITEM_KEY:
  53                         ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
  54                         printk("\t\textent data refs %u owner %Lu\n",
  55                                 btrfs_extent_refs(ei), btrfs_extent_owner(ei));
  56                         break;
  57                 case BTRFS_INODE_MAP_ITEM_KEY:
  58                         mi = btrfs_item_ptr(l, i, struct btrfs_inode_map_item);
  59                         printk("\t\tinode map key %Lu %u %Lu\n",
  60                                btrfs_disk_key_objectid(&mi->key),
  61                                btrfs_disk_key_flags(&mi->key),
  62                                btrfs_disk_key_offset(&mi->key));
  63                         break;
  64                 case BTRFS_STRING_ITEM_KEY:
  65                         printk("\t\titem data %.*s\n", btrfs_item_size(item),
  66                                 btrfs_leaf_data(l) + btrfs_item_offset(item));
  67                         break;
  68                 };
  69         }
  70 }
  71
  72 void btrfs_print_tree(struct btrfs_root *root, struct buffer_head *t)
  73 {
  74         int i;
  75         u32 nr;
  76         struct btrfs_node *c;
  77
  78         if (!t)
  79                 return;
  80         c = btrfs_buffer_node(t);
  81         nr = btrfs_header_nritems(&c->header);
  82         if (btrfs_is_leaf(c)) {
  83                 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
  84                 return;
  85         }
  86         printk("node %Lu level %d total ptrs %d free spc %u\n",
  87                btrfs_header_blocknr(&c->header),
  88                btrfs_header_level(&c->header), nr,
  89                (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
  90         for (i = 0; i < nr; i++) {
  91                 printk("\tkey %d (%Lu %u %Lu) block %Lu\n",
  92                        i,
  93                        c->ptrs[i].key.objectid,
  94                        c->ptrs[i].key.flags,
  95                        c->ptrs[i].key.offset,
  96                        btrfs_node_blockptr(c, i));
  97         }
  98         for (i = 0; i < nr; i++) {
  99                 struct buffer_head *next_buf = read_tree_block(root,
 100                                                 btrfs_node_blockptr(c, i));
 101                 struct btrfs_node *next = btrfs_buffer_node(next_buf);
 102                 if (btrfs_is_leaf(next) &&
 103                     btrfs_header_level(&c->header) != 1)
 104                         BUG();
 105                 if (btrfs_header_level(&next->header) !=
 106                         btrfs_header_level(&c->header) - 1)
 107                         BUG();
 108                 btrfs_print_tree(root, next_buf);
 109                 btrfs_block_release(root, next_buf);
 110         }
 111 }
 112