fs/btrfs/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         printf("leaf %Lu total ptrs %d free space %d\n",
  16                 btrfs_header_blocknr(&l->header), nr,
  17                 btrfs_leaf_free_space(root, l));
  18         fflush(stdout);
  19         for (i = 0 ; i < nr ; i++) {
  20                 item = l->items + i;
  21                 printf("\titem %d key (%Lu %Lu %u) itemoff %d itemsize %d\n",
  22                         i,
  23                         btrfs_key_objectid(&item->key),
  24                         btrfs_key_offset(&item->key),
  25                         btrfs_key_flags(&item->key),
  26                         btrfs_item_offset(item),
  27                         btrfs_item_size(item));
  28                 printf("\t\titem data %.*s\n", btrfs_item_size(item),
  29                         btrfs_leaf_data(l) + btrfs_item_offset(item));
  30                 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
  31                 printf("\t\textent data refs %u owner %Lu\n",
  32                         btrfs_extent_refs(ei), btrfs_extent_owner(ei));
  33                 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  34                 printf("\t\troot data blocknr %Lu refs %u\n",
  35                         btrfs_root_blocknr(ri), btrfs_root_refs(ri));
  36                 fflush(stdout);
  37         }
  38 }
  39 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
  40 {
  41         int i;
  42         u32 nr;
  43         struct btrfs_node *c;
  44
  45         if (!t)
  46                 return;
  47         c = &t->node;
  48         nr = btrfs_header_nritems(&c->header);
  49         if (btrfs_is_leaf(c)) {
  50                 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
  51                 return;
  52         }
  53         printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
  54                 btrfs_header_level(&c->header), nr,
  55                 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
  56         fflush(stdout);
  57         for (i = 0; i < nr; i++) {
  58                 printf("\tkey %d (%Lu %Lu %u) block %Lu\n",
  59                        i,
  60                        c->ptrs[i].key.objectid,
  61                        c->ptrs[i].key.offset,
  62                        c->ptrs[i].key.flags,
  63                        btrfs_node_blockptr(c, i));
  64                 fflush(stdout);
  65         }
  66         for (i = 0; i < nr; i++) {
  67                 struct btrfs_buffer *next_buf = read_tree_block(root,
  68                                                 btrfs_node_blockptr(c, i));
  69                 struct btrfs_node *next = &next_buf->node;
  70                 if (btrfs_is_leaf(next) &&
  71                     btrfs_header_level(&c->header) != 1)
  72                         BUG();
  73                 if (btrfs_header_level(&next->header) !=
  74                         btrfs_header_level(&c->header) - 1)
  75                         BUG();
  76                 btrfs_print_tree(root, next_buf);
  77                 btrfs_block_release(root, next_buf);
  78         }
  79 }
  80