print-tree.c 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200
  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. static void print_chunk(struct extent_buffer *eb, struct btrfs_chunk *chunk)
  22. {
  23. int num_stripes = btrfs_chunk_num_stripes(eb, chunk);
  24. int i;
  25. printk("\t\tchunk length %llu owner %llu type %llu num_stripes %d\n",
  26. (unsigned long long)btrfs_chunk_length(eb, chunk),
  27. (unsigned long long)btrfs_chunk_owner(eb, chunk),
  28. (unsigned long long)btrfs_chunk_type(eb, chunk),
  29. num_stripes);
  30. for (i = 0 ; i < num_stripes ; i++) {
  31. printk("\t\t\tstripe %d devid %llu offset %llu\n", i,
  32. (unsigned long long)btrfs_stripe_devid_nr(eb, chunk, i),
  33. (unsigned long long)btrfs_stripe_offset_nr(eb, chunk, i));
  34. }
  35. }
  36. static void print_dev_item(struct extent_buffer *eb,
  37. struct btrfs_dev_item *dev_item)
  38. {
  39. printk("\t\tdev item devid %llu "
  40. "total_bytes %llu bytes used %Lu\n",
  41. (unsigned long long)btrfs_device_id(eb, dev_item),
  42. (unsigned long long)btrfs_device_total_bytes(eb, dev_item),
  43. (unsigned long long)btrfs_device_bytes_used(eb, dev_item));
  44. }
  45. void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
  46. {
  47. int i;
  48. u32 nr = btrfs_header_nritems(l);
  49. struct btrfs_item *item;
  50. struct btrfs_extent_item *ei;
  51. struct btrfs_root_item *ri;
  52. struct btrfs_dir_item *di;
  53. struct btrfs_inode_item *ii;
  54. struct btrfs_block_group_item *bi;
  55. struct btrfs_file_extent_item *fi;
  56. struct btrfs_key key;
  57. struct btrfs_key found_key;
  58. struct btrfs_extent_ref *ref;
  59. struct btrfs_dev_extent *dev_extent;
  60. u32 type;
  61. printk("leaf %llu total ptrs %d free space %d\n",
  62. (unsigned long long)btrfs_header_bytenr(l), nr,
  63. btrfs_leaf_free_space(root, l));
  64. for (i = 0 ; i < nr ; i++) {
  65. item = btrfs_item_nr(l, i);
  66. btrfs_item_key_to_cpu(l, &key, i);
  67. type = btrfs_key_type(&key);
  68. printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
  69. i,
  70. (unsigned long long)key.objectid, type,
  71. (unsigned long long)key.offset,
  72. btrfs_item_offset(l, item), btrfs_item_size(l, item));
  73. switch (type) {
  74. case BTRFS_INODE_ITEM_KEY:
  75. ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
  76. printk("\t\tinode generation %llu size %llu mode %o\n",
  77. (unsigned long long)btrfs_inode_generation(l, ii),
  78. (unsigned long long)btrfs_inode_size(l, ii),
  79. btrfs_inode_mode(l, ii));
  80. break;
  81. case BTRFS_DIR_ITEM_KEY:
  82. di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  83. btrfs_dir_item_key_to_cpu(l, di, &found_key);
  84. printk("\t\tdir oid %llu type %u\n",
  85. (unsigned long long)found_key.objectid,
  86. btrfs_dir_type(l, di));
  87. break;
  88. case BTRFS_ROOT_ITEM_KEY:
  89. ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  90. printk("\t\troot data bytenr %llu refs %u\n",
  91. (unsigned long long)btrfs_disk_root_bytenr(l, ri),
  92. btrfs_disk_root_refs(l, ri));
  93. break;
  94. case BTRFS_EXTENT_ITEM_KEY:
  95. ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
  96. printk("\t\textent data refs %u\n",
  97. btrfs_extent_refs(l, ei));
  98. break;
  99. case BTRFS_EXTENT_REF_KEY:
  100. ref = btrfs_item_ptr(l, i, struct btrfs_extent_ref);
  101. printk("\t\textent back ref root %llu gen %llu "
  102. "owner %llu offset %llu\n",
  103. (unsigned long long)btrfs_ref_root(l, ref),
  104. (unsigned long long)btrfs_ref_generation(l, ref),
  105. (unsigned long long)btrfs_ref_objectid(l, ref),
  106. (unsigned long long)btrfs_ref_offset(l, ref));
  107. break;
  108. case BTRFS_EXTENT_DATA_KEY:
  109. fi = btrfs_item_ptr(l, i,
  110. struct btrfs_file_extent_item);
  111. if (btrfs_file_extent_type(l, fi) ==
  112. BTRFS_FILE_EXTENT_INLINE) {
  113. printk("\t\tinline extent data size %u\n",
  114. btrfs_file_extent_inline_len(l, item));
  115. break;
  116. }
  117. printk("\t\textent data disk bytenr %llu nr %llu\n",
  118. (unsigned long long)btrfs_file_extent_disk_bytenr(l, fi),
  119. (unsigned long long)btrfs_file_extent_disk_num_bytes(l, fi));
  120. printk("\t\textent data offset %llu nr %llu\n",
  121. (unsigned long long)btrfs_file_extent_offset(l, fi),
  122. (unsigned long long)btrfs_file_extent_num_bytes(l, fi));
  123. break;
  124. case BTRFS_BLOCK_GROUP_ITEM_KEY:
  125. bi = btrfs_item_ptr(l, i,
  126. struct btrfs_block_group_item);
  127. printk("\t\tblock group used %llu\n",
  128. (unsigned long long)btrfs_disk_block_group_used(l, bi));
  129. break;
  130. case BTRFS_CHUNK_ITEM_KEY:
  131. print_chunk(l, btrfs_item_ptr(l, i, struct btrfs_chunk));
  132. break;
  133. case BTRFS_DEV_ITEM_KEY:
  134. print_dev_item(l, btrfs_item_ptr(l, i,
  135. struct btrfs_dev_item));
  136. break;
  137. case BTRFS_DEV_EXTENT_KEY:
  138. dev_extent = btrfs_item_ptr(l, i,
  139. struct btrfs_dev_extent);
  140. printk("\t\tdev extent chunk_tree %llu\n"
  141. "\t\tchunk objectid %llu chunk offset %llu "
  142. "length %llu\n",
  143. (unsigned long long)
  144. btrfs_dev_extent_chunk_tree(l, dev_extent),
  145. (unsigned long long)
  146. btrfs_dev_extent_chunk_objectid(l, dev_extent),
  147. (unsigned long long)
  148. btrfs_dev_extent_chunk_offset(l, dev_extent),
  149. (unsigned long long)
  150. btrfs_dev_extent_length(l, dev_extent));
  151. };
  152. }
  153. }
  154. void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *c)
  155. {
  156. int i; u32 nr;
  157. struct btrfs_key key;
  158. int level;
  159. if (!c)
  160. return;
  161. nr = btrfs_header_nritems(c);
  162. level = btrfs_header_level(c);
  163. if (level == 0) {
  164. btrfs_print_leaf(root, c);
  165. return;
  166. }
  167. printk("node %llu level %d total ptrs %d free spc %u\n",
  168. (unsigned long long)btrfs_header_bytenr(c),
  169. btrfs_header_level(c), nr,
  170. (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
  171. for (i = 0; i < nr; i++) {
  172. btrfs_node_key_to_cpu(c, &key, i);
  173. printk("\tkey %d (%llu %u %llu) block %llu\n",
  174. i,
  175. (unsigned long long)key.objectid,
  176. key.type,
  177. (unsigned long long)key.offset,
  178. (unsigned long long)btrfs_node_blockptr(c, i));
  179. }
  180. for (i = 0; i < nr; i++) {
  181. struct extent_buffer *next = read_tree_block(root,
  182. btrfs_node_blockptr(c, i),
  183. btrfs_level_size(root, level - 1),
  184. btrfs_node_ptr_generation(c, i));
  185. if (btrfs_is_leaf(next) &&
  186. btrfs_header_level(c) != 1)
  187. BUG();
  188. if (btrfs_header_level(next) !=
  189. btrfs_header_level(c) - 1)
  190. BUG();
  191. btrfs_print_tree(root, next);
  192. free_extent_buffer(next);
  193. }
  194. }