print-tree.c

   1 #include <stdio.h>
   2 #include <stdlib.h>
   3 #include "kerncompat.h"
   4 #include "radix-tree.h"
   5 #include "ctree.h"
   6 #include "disk-io.h"
   7
   8 void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
   9 {
  10         int i;
  11         u32 nr = btrfs_header_nritems(&l->header);
  12         struct btrfs_item *item;
  13         struct btrfs_extent_item *ei;
  14         struct btrfs_root_item *ri;
  15         struct btrfs_dir_item *di;
  16         struct btrfs_inode_map_item *mi;
  17         struct btrfs_inode_item *ii;
  18         struct btrfs_file_extent_item *fi;
  19         char *p;
  20         u32 type;
  21
  22         printf("leaf %Lu ptrs %d free space %d parent %Lu generation %Lu\n",
  23                 btrfs_header_blocknr(&l->header), nr,
  24                 btrfs_leaf_free_space(root, l),
  25                 btrfs_header_parentid(&l->header),
  26                 btrfs_header_generation(&l->header));
  27         fflush(stdout);
  28         for (i = 0 ; i < nr ; i++) {
  29                 item = l->items + i;
  30                 type = btrfs_disk_key_type(&item->key);
  31                 printf("\titem %d key (%Lu %u %Lu) itemoff %d itemsize %d\n",
  32                         i,
  33                         btrfs_disk_key_objectid(&item->key),
  34                         btrfs_disk_key_flags(&item->key),
  35                         btrfs_disk_key_offset(&item->key),
  36                         btrfs_item_offset(item),
  37                         btrfs_item_size(item));
  38                 switch (type) {
  39                 case BTRFS_INODE_ITEM_KEY:
  40                         ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
  41                         printf("\t\tinode generation %Lu size %Lu mode %o\n",
  42                                btrfs_inode_generation(ii),
  43                                btrfs_inode_size(ii),
  44                                btrfs_inode_mode(ii));
  45                         break;
  46                 case BTRFS_INLINE_DATA_KEY:
  47                         p = btrfs_item_ptr(l, i, char);
  48                         printf("\t\tinline data %.*s\n", 10, p);
  49                         break;
  50                 case BTRFS_DIR_ITEM_KEY:
  51                         di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  52                         printf("\t\tdir oid %Lu flags %u type %u\n",
  53                                 btrfs_dir_objectid(di),
  54                                 btrfs_dir_flags(di),
  55                                 btrfs_dir_type(di));
  56                         printf("\t\tname %.*s\n",
  57                                btrfs_dir_name_len(di),(char *)(di + 1));
  58                         break;
  59                 case BTRFS_DIR_INDEX_KEY:
  60                         di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  61                         printf("\t\tdir index %Lu flags %u type %u\n",
  62                                 btrfs_dir_objectid(di),
  63                                 btrfs_dir_flags(di),
  64                                 btrfs_dir_type(di));
  65                         printf("\t\tname %.*s\n",
  66                                btrfs_dir_name_len(di),(char *)(di + 1));
  67                         break;
  68                 case BTRFS_ROOT_ITEM_KEY:
  69                         ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  70                         printf("\t\troot data blocknr %Lu refs %u\n",
  71                                 btrfs_root_blocknr(ri), btrfs_root_refs(ri));
  72                         break;
  73                 case BTRFS_EXTENT_ITEM_KEY:
  74                         ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
  75                         printf("\t\textent data refs %u owner %Lu\n",
  76                                 btrfs_extent_refs(ei), btrfs_extent_owner(ei));
  77                         break;
  78                 case BTRFS_INODE_MAP_ITEM_KEY:
  79                         mi = btrfs_item_ptr(l, i, struct btrfs_inode_map_item);
  80                         printf("\t\tinode map key %Lu %u %Lu\n",
  81                                btrfs_disk_key_objectid(&mi->key),
  82                                btrfs_disk_key_flags(&mi->key),
  83                                btrfs_disk_key_offset(&mi->key));
  84                         break;
  85                 case BTRFS_EXTENT_DATA_KEY:
  86                         fi = btrfs_item_ptr(l, i,
  87                                             struct btrfs_file_extent_item);
  88                         printf("\t\textent data disk block %Lu nr %Lu\n",
  89                                btrfs_file_extent_disk_blocknr(fi),
  90                                btrfs_file_extent_disk_num_blocks(fi));
  91                         printf("\t\textent data offset %Lu nr %Lu\n",
  92                                btrfs_file_extent_offset(fi),
  93                                btrfs_file_extent_num_blocks(fi));
  94                         break;
  95                 case BTRFS_STRING_ITEM_KEY:
  96                         printf("\t\titem data %.*s\n", btrfs_item_size(item),
  97                                 btrfs_leaf_data(l) + btrfs_item_offset(item));
  98                         break;
  99                 };
 100                 fflush(stdout);
 101         }
 102 }
 103 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
 104 {
 105         int i;
 106         u32 nr;
 107         struct btrfs_node *c;
 108
 109         if (!t)
 110                 return;
 111         c = &t->node;
 112         nr = btrfs_header_nritems(&c->header);
 113         if (btrfs_is_leaf(c)) {
 114                 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
 115                 return;
 116         }
 117         printf("node %Lu level %d ptrs %d free %u parent %Lu generation %Lu\n",
 118                t->blocknr,
 119                 btrfs_header_level(&c->header), nr,
 120                 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
 121                 btrfs_header_parentid(&c->header),
 122                 btrfs_header_generation(&c->header));
 123         fflush(stdout);
 124         for (i = 0; i < nr; i++) {
 125                 printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
 126                        i,
 127                        c->ptrs[i].key.objectid,
 128                        c->ptrs[i].key.flags,
 129                        c->ptrs[i].key.offset,
 130                        btrfs_node_blockptr(c, i));
 131                 fflush(stdout);
 132         }
 133         for (i = 0; i < nr; i++) {
 134                 struct btrfs_buffer *next_buf = read_tree_block(root,
 135                                                 btrfs_node_blockptr(c, i));
 136                 struct btrfs_node *next = &next_buf->node;
 137                 if (btrfs_is_leaf(next) &&
 138                     btrfs_header_level(&c->header) != 1)
 139                         BUG();
 140                 if (btrfs_header_level(&next->header) !=
 141                         btrfs_header_level(&c->header) - 1)
 142                         BUG();
 143                 btrfs_print_tree(root, next_buf);
 144                 btrfs_block_release(root, next_buf);
 145         }
 146 }
 147