print-tree.c 3.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114
  1. #include <linux/module.h>
  2. #include "ctree.h"
  3. #include "disk-io.h"
  4. #include "print-tree.h"
  5. void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
  6. {
  7. int i;
  8. u32 nr = btrfs_header_nritems(&l->header);
  9. struct btrfs_item *item;
  10. struct btrfs_extent_item *ei;
  11. struct btrfs_root_item *ri;
  12. struct btrfs_dir_item *di;
  13. struct btrfs_inode_item *ii;
  14. struct btrfs_block_group_item *bi;
  15. u32 type;
  16. printk("leaf %llu total ptrs %d free space %d\n",
  17. (unsigned long long)btrfs_header_blocknr(&l->header), nr,
  18. btrfs_leaf_free_space(root, l));
  19. for (i = 0 ; i < nr ; i++) {
  20. item = l->items + i;
  21. type = btrfs_disk_key_type(&item->key);
  22. printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
  23. i,
  24. (unsigned long long)btrfs_disk_key_objectid(&item->key),
  25. btrfs_disk_key_flags(&item->key),
  26. (unsigned long long)btrfs_disk_key_offset(&item->key),
  27. btrfs_item_offset(item),
  28. btrfs_item_size(item));
  29. switch (type) {
  30. case BTRFS_INODE_ITEM_KEY:
  31. ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
  32. printk("\t\tinode generation %llu size %llu mode %o\n",
  33. (unsigned long long)btrfs_inode_generation(ii),
  34. (unsigned long long)btrfs_inode_size(ii),
  35. btrfs_inode_mode(ii));
  36. break;
  37. case BTRFS_DIR_ITEM_KEY:
  38. di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  39. printk("\t\tdir oid %llu flags %u type %u\n",
  40. (unsigned long long)btrfs_disk_key_objectid(
  41. &di->location),
  42. btrfs_dir_flags(di),
  43. btrfs_dir_type(di));
  44. printk("\t\tname %.*s\n",
  45. btrfs_dir_name_len(di),(char *)(di + 1));
  46. break;
  47. case BTRFS_ROOT_ITEM_KEY:
  48. ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  49. printk("\t\troot data blocknr %llu refs %u\n",
  50. (unsigned long long)btrfs_root_blocknr(ri),
  51. btrfs_root_refs(ri));
  52. break;
  53. case BTRFS_EXTENT_ITEM_KEY:
  54. ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
  55. printk("\t\textent data refs %u\n",
  56. btrfs_extent_refs(ei));
  57. break;
  58. case BTRFS_BLOCK_GROUP_ITEM_KEY:
  59. bi = btrfs_item_ptr(l, i,
  60. struct btrfs_block_group_item);
  61. printk("\t\tblock group used %llu\n",
  62. (unsigned long long)btrfs_block_group_used(bi));
  63. break;
  64. case BTRFS_STRING_ITEM_KEY:
  65. printk("\t\titem data %.*s\n", btrfs_item_size(item),
  66. btrfs_leaf_data(l) + btrfs_item_offset(item));
  67. break;
  68. };
  69. }
  70. }
  71. void btrfs_print_tree(struct btrfs_root *root, struct buffer_head *t)
  72. {
  73. int i;
  74. u32 nr;
  75. struct btrfs_node *c;
  76. if (!t)
  77. return;
  78. c = btrfs_buffer_node(t);
  79. nr = btrfs_header_nritems(&c->header);
  80. if (btrfs_is_leaf(c)) {
  81. btrfs_print_leaf(root, (struct btrfs_leaf *)c);
  82. return;
  83. }
  84. printk("node %llu level %d total ptrs %d free spc %u\n",
  85. (unsigned long long)btrfs_header_blocknr(&c->header),
  86. btrfs_header_level(&c->header), nr,
  87. (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
  88. for (i = 0; i < nr; i++) {
  89. printk("\tkey %d (%llu %u %llu) block %llu\n",
  90. i,
  91. (unsigned long long)c->ptrs[i].key.objectid,
  92. c->ptrs[i].key.flags,
  93. (unsigned long long)c->ptrs[i].key.offset,
  94. (unsigned long long)btrfs_node_blockptr(c, i));
  95. }
  96. for (i = 0; i < nr; i++) {
  97. struct buffer_head *next_buf = read_tree_block(root,
  98. btrfs_node_blockptr(c, i));
  99. struct btrfs_node *next = btrfs_buffer_node(next_buf);
  100. if (btrfs_is_leaf(next) &&
  101. btrfs_header_level(&c->header) != 1)
  102. BUG();
  103. if (btrfs_header_level(&next->header) !=
  104. btrfs_header_level(&c->header) - 1)
  105. BUG();
  106. btrfs_print_tree(root, next_buf);
  107. btrfs_block_release(root, next_buf);
  108. }
  109. }