print-tree.c 7.2 KB

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