print-tree.c 2.2 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677
  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 = btrfs_item_ptr(l, i, struct btrfs_extent_item);
  29. printf("\t\textent data refs %u owner %Lu\n",
  30. btrfs_extent_refs(ei), btrfs_extent_owner(ei));
  31. ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  32. printf("\t\troot data blocknr %Lu refs %u\n",
  33. btrfs_root_blocknr(ri), btrfs_root_refs(ri));
  34. fflush(stdout);
  35. }
  36. }
  37. void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
  38. {
  39. int i;
  40. u32 nr;
  41. struct btrfs_node *c;
  42. if (!t)
  43. return;
  44. c = &t->node;
  45. nr = btrfs_header_nritems(&c->header);
  46. if (btrfs_is_leaf(c)) {
  47. btrfs_print_leaf((struct btrfs_leaf *)c);
  48. return;
  49. }
  50. printf("node %Lu level %d total ptrs %d free spc %u\n", t->blocknr,
  51. btrfs_header_level(&c->header), nr,
  52. (u32)NODEPTRS_PER_BLOCK - nr);
  53. fflush(stdout);
  54. for (i = 0; i < nr; i++) {
  55. printf("\tkey %d (%Lu %u %Lu) block %Lu\n",
  56. i,
  57. c->keys[i].objectid, c->keys[i].flags, c->keys[i].offset,
  58. btrfs_node_blockptr(c, i));
  59. fflush(stdout);
  60. }
  61. for (i = 0; i < nr; i++) {
  62. struct btrfs_buffer *next_buf = read_tree_block(root,
  63. btrfs_node_blockptr(c, i));
  64. struct btrfs_node *next = &next_buf->node;
  65. if (btrfs_is_leaf(next) &&
  66. btrfs_header_level(&c->header) != 1)
  67. BUG();
  68. if (btrfs_header_level(&next->header) !=
  69. btrfs_header_level(&c->header) - 1)
  70. BUG();
  71. btrfs_print_tree(root, next_buf);
  72. btrfs_block_release(root, next_buf);
  73. }
  74. }