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