print-tree.c 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145
  1. /*
  2. * Copyright (C) 2007 Oracle. All rights reserved.
  3. *
  4. * This program is free software; you can redistribute it and/or
  5. * modify it under the terms of the GNU General Public
  6. * License v2 as published by the Free Software Foundation.
  7. *
  8. * This program is distributed in the hope that it will be useful,
  9. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  10. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  11. * General Public License for more details.
  12. *
  13. * You should have received a copy of the GNU General Public
  14. * License along with this program; if not, write to the
  15. * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
  16. * Boston, MA 021110-1307, USA.
  17. */
  18. #include "ctree.h"
  19. #include "disk-io.h"
  20. #include "print-tree.h"
  21. void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
  22. {
  23. int i;
  24. u32 nr = btrfs_header_nritems(l);
  25. struct btrfs_item *item;
  26. struct btrfs_extent_item *ei;
  27. struct btrfs_root_item *ri;
  28. struct btrfs_dir_item *di;
  29. struct btrfs_inode_item *ii;
  30. struct btrfs_block_group_item *bi;
  31. struct btrfs_file_extent_item *fi;
  32. struct btrfs_key key;
  33. struct btrfs_key found_key;
  34. u32 type;
  35. printk("leaf %llu total ptrs %d free space %d\n",
  36. (unsigned long long)btrfs_header_bytenr(l), nr,
  37. btrfs_leaf_free_space(root, l));
  38. for (i = 0 ; i < nr ; i++) {
  39. item = btrfs_item_nr(l, i);
  40. btrfs_item_key_to_cpu(l, &key, i);
  41. type = btrfs_key_type(&key);
  42. printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
  43. i,
  44. (unsigned long long)key.objectid, type,
  45. (unsigned long long)key.offset,
  46. btrfs_item_offset(l, item), btrfs_item_size(l, item));
  47. switch (type) {
  48. case BTRFS_INODE_ITEM_KEY:
  49. ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
  50. printk("\t\tinode generation %llu size %llu mode %o\n",
  51. (unsigned long long)btrfs_inode_generation(l, ii),
  52. (unsigned long long)btrfs_inode_size(l, ii),
  53. btrfs_inode_mode(l, ii));
  54. break;
  55. case BTRFS_DIR_ITEM_KEY:
  56. di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  57. btrfs_dir_item_key_to_cpu(l, di, &found_key);
  58. printk("\t\tdir oid %llu type %u\n",
  59. (unsigned long long)found_key.objectid,
  60. btrfs_dir_type(l, di));
  61. break;
  62. case BTRFS_ROOT_ITEM_KEY:
  63. ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  64. printk("\t\troot data bytenr %llu refs %u\n",
  65. (unsigned long long)btrfs_disk_root_bytenr(l, ri),
  66. btrfs_disk_root_refs(l, ri));
  67. break;
  68. case BTRFS_EXTENT_ITEM_KEY:
  69. ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
  70. printk("\t\textent data refs %u\n",
  71. btrfs_extent_refs(l, ei));
  72. break;
  73. case BTRFS_EXTENT_DATA_KEY:
  74. fi = btrfs_item_ptr(l, i,
  75. struct btrfs_file_extent_item);
  76. if (btrfs_file_extent_type(l, fi) ==
  77. BTRFS_FILE_EXTENT_INLINE) {
  78. printk("\t\tinline extent data size %u\n",
  79. btrfs_file_extent_inline_len(l, item));
  80. break;
  81. }
  82. printk("\t\textent data disk bytenr %llu nr %llu\n",
  83. (unsigned long long)btrfs_file_extent_disk_bytenr(l, fi),
  84. (unsigned long long)btrfs_file_extent_disk_num_bytes(l, fi));
  85. printk("\t\textent data offset %llu nr %llu\n",
  86. (unsigned long long)btrfs_file_extent_offset(l, fi),
  87. (unsigned long long)btrfs_file_extent_num_bytes(l, fi));
  88. break;
  89. case BTRFS_BLOCK_GROUP_ITEM_KEY:
  90. bi = btrfs_item_ptr(l, i,
  91. struct btrfs_block_group_item);
  92. printk("\t\tblock group used %llu\n",
  93. (unsigned long long)btrfs_disk_block_group_used(l, bi));
  94. break;
  95. };
  96. }
  97. }
  98. void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *c)
  99. {
  100. int i;
  101. u32 nr;
  102. struct btrfs_key key;
  103. int level;
  104. if (!c)
  105. return;
  106. nr = btrfs_header_nritems(c);
  107. level = btrfs_header_level(c);
  108. if (level == 0) {
  109. btrfs_print_leaf(root, c);
  110. return;
  111. }
  112. printk("node %llu level %d total ptrs %d free spc %u\n",
  113. (unsigned long long)btrfs_header_bytenr(c),
  114. btrfs_header_level(c), nr,
  115. (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
  116. for (i = 0; i < nr; i++) {
  117. btrfs_node_key_to_cpu(c, &key, i);
  118. printk("\tkey %d (%llu %u %llu) block %llu\n",
  119. i,
  120. (unsigned long long)key.objectid,
  121. key.type,
  122. (unsigned long long)key.offset,
  123. (unsigned long long)btrfs_node_blockptr(c, i));
  124. }
  125. for (i = 0; i < nr; i++) {
  126. struct extent_buffer *next = read_tree_block(root,
  127. btrfs_node_blockptr(c, i),
  128. btrfs_level_size(root, level - 1));
  129. if (btrfs_is_leaf(next) &&
  130. btrfs_header_level(c) != 1)
  131. BUG();
  132. if (btrfs_header_level(next) !=
  133. btrfs_header_level(c) - 1)
  134. BUG();
  135. btrfs_print_tree(root, next);
  136. free_extent_buffer(next);
  137. }
  138. }