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