print-tree.c 2.2 KB

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