print-tree.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343
  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. static void print_extent_data_ref(struct extent_buffer *eb,
  47. struct btrfs_extent_data_ref *ref)
  48. {
  49. printk(KERN_INFO "\t\textent data backref root %llu "
  50. "objectid %llu offset %llu count %u\n",
  51. (unsigned long long)btrfs_extent_data_ref_root(eb, ref),
  52. (unsigned long long)btrfs_extent_data_ref_objectid(eb, ref),
  53. (unsigned long long)btrfs_extent_data_ref_offset(eb, ref),
  54. btrfs_extent_data_ref_count(eb, ref));
  55. }
  56. static void print_extent_item(struct extent_buffer *eb, int slot)
  57. {
  58. struct btrfs_extent_item *ei;
  59. struct btrfs_extent_inline_ref *iref;
  60. struct btrfs_extent_data_ref *dref;
  61. struct btrfs_shared_data_ref *sref;
  62. struct btrfs_disk_key key;
  63. unsigned long end;
  64. unsigned long ptr;
  65. int type;
  66. u32 item_size = btrfs_item_size_nr(eb, slot);
  67. u64 flags;
  68. u64 offset;
  69. if (item_size < sizeof(*ei)) {
  70. #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
  71. struct btrfs_extent_item_v0 *ei0;
  72. BUG_ON(item_size != sizeof(*ei0));
  73. ei0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_item_v0);
  74. printk(KERN_INFO "\t\textent refs %u\n",
  75. btrfs_extent_refs_v0(eb, ei0));
  76. return;
  77. #else
  78. BUG();
  79. #endif
  80. }
  81. ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
  82. flags = btrfs_extent_flags(eb, ei);
  83. printk(KERN_INFO "\t\textent refs %llu gen %llu flags %llu\n",
  84. (unsigned long long)btrfs_extent_refs(eb, ei),
  85. (unsigned long long)btrfs_extent_generation(eb, ei),
  86. (unsigned long long)flags);
  87. if (flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
  88. struct btrfs_tree_block_info *info;
  89. info = (struct btrfs_tree_block_info *)(ei + 1);
  90. btrfs_tree_block_key(eb, info, &key);
  91. printk(KERN_INFO "\t\ttree block key (%llu %x %llu) "
  92. "level %d\n",
  93. (unsigned long long)btrfs_disk_key_objectid(&key),
  94. key.type,
  95. (unsigned long long)btrfs_disk_key_offset(&key),
  96. btrfs_tree_block_level(eb, info));
  97. iref = (struct btrfs_extent_inline_ref *)(info + 1);
  98. } else {
  99. iref = (struct btrfs_extent_inline_ref *)(ei + 1);
  100. }
  101. ptr = (unsigned long)iref;
  102. end = (unsigned long)ei + item_size;
  103. while (ptr < end) {
  104. iref = (struct btrfs_extent_inline_ref *)ptr;
  105. type = btrfs_extent_inline_ref_type(eb, iref);
  106. offset = btrfs_extent_inline_ref_offset(eb, iref);
  107. switch (type) {
  108. case BTRFS_TREE_BLOCK_REF_KEY:
  109. printk(KERN_INFO "\t\ttree block backref "
  110. "root %llu\n", (unsigned long long)offset);
  111. break;
  112. case BTRFS_SHARED_BLOCK_REF_KEY:
  113. printk(KERN_INFO "\t\tshared block backref "
  114. "parent %llu\n", (unsigned long long)offset);
  115. break;
  116. case BTRFS_EXTENT_DATA_REF_KEY:
  117. dref = (struct btrfs_extent_data_ref *)(&iref->offset);
  118. print_extent_data_ref(eb, dref);
  119. break;
  120. case BTRFS_SHARED_DATA_REF_KEY:
  121. sref = (struct btrfs_shared_data_ref *)(iref + 1);
  122. printk(KERN_INFO "\t\tshared data backref "
  123. "parent %llu count %u\n",
  124. (unsigned long long)offset,
  125. btrfs_shared_data_ref_count(eb, sref));
  126. break;
  127. default:
  128. BUG();
  129. }
  130. ptr += btrfs_extent_inline_ref_size(type);
  131. }
  132. WARN_ON(ptr > end);
  133. }
  134. #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
  135. static void print_extent_ref_v0(struct extent_buffer *eb, int slot)
  136. {
  137. struct btrfs_extent_ref_v0 *ref0;
  138. ref0 = btrfs_item_ptr(eb, slot, struct btrfs_extent_ref_v0);
  139. printk("\t\textent back ref root %llu gen %llu "
  140. "owner %llu num_refs %lu\n",
  141. (unsigned long long)btrfs_ref_root_v0(eb, ref0),
  142. (unsigned long long)btrfs_ref_generation_v0(eb, ref0),
  143. (unsigned long long)btrfs_ref_objectid_v0(eb, ref0),
  144. (unsigned long)btrfs_ref_count_v0(eb, ref0));
  145. }
  146. #endif
  147. void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
  148. {
  149. int i;
  150. u32 type, nr;
  151. struct btrfs_item *item;
  152. struct btrfs_root_item *ri;
  153. struct btrfs_dir_item *di;
  154. struct btrfs_inode_item *ii;
  155. struct btrfs_block_group_item *bi;
  156. struct btrfs_file_extent_item *fi;
  157. struct btrfs_extent_data_ref *dref;
  158. struct btrfs_shared_data_ref *sref;
  159. struct btrfs_dev_extent *dev_extent;
  160. struct btrfs_key key;
  161. struct btrfs_key found_key;
  162. if (!l)
  163. return;
  164. nr = btrfs_header_nritems(l);
  165. printk(KERN_INFO "leaf %llu total ptrs %d free space %d\n",
  166. (unsigned long long)btrfs_header_bytenr(l), nr,
  167. btrfs_leaf_free_space(root, l));
  168. for (i = 0 ; i < nr ; i++) {
  169. item = btrfs_item_nr(l, i);
  170. btrfs_item_key_to_cpu(l, &key, i);
  171. type = btrfs_key_type(&key);
  172. printk(KERN_INFO "\titem %d key (%llu %x %llu) itemoff %d "
  173. "itemsize %d\n",
  174. i,
  175. (unsigned long long)key.objectid, type,
  176. (unsigned long long)key.offset,
  177. btrfs_item_offset(l, item), btrfs_item_size(l, item));
  178. switch (type) {
  179. case BTRFS_INODE_ITEM_KEY:
  180. ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
  181. printk(KERN_INFO "\t\tinode generation %llu size %llu "
  182. "mode %o\n",
  183. (unsigned long long)
  184. btrfs_inode_generation(l, ii),
  185. (unsigned long long)btrfs_inode_size(l, ii),
  186. btrfs_inode_mode(l, ii));
  187. break;
  188. case BTRFS_DIR_ITEM_KEY:
  189. di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  190. btrfs_dir_item_key_to_cpu(l, di, &found_key);
  191. printk(KERN_INFO "\t\tdir oid %llu type %u\n",
  192. (unsigned long long)found_key.objectid,
  193. btrfs_dir_type(l, di));
  194. break;
  195. case BTRFS_ROOT_ITEM_KEY:
  196. ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  197. printk(KERN_INFO "\t\troot data bytenr %llu refs %u\n",
  198. (unsigned long long)
  199. btrfs_disk_root_bytenr(l, ri),
  200. btrfs_disk_root_refs(l, ri));
  201. break;
  202. case BTRFS_EXTENT_ITEM_KEY:
  203. print_extent_item(l, i);
  204. break;
  205. case BTRFS_TREE_BLOCK_REF_KEY:
  206. printk(KERN_INFO "\t\ttree block backref\n");
  207. break;
  208. case BTRFS_SHARED_BLOCK_REF_KEY:
  209. printk(KERN_INFO "\t\tshared block backref\n");
  210. break;
  211. case BTRFS_EXTENT_DATA_REF_KEY:
  212. dref = btrfs_item_ptr(l, i,
  213. struct btrfs_extent_data_ref);
  214. print_extent_data_ref(l, dref);
  215. break;
  216. case BTRFS_SHARED_DATA_REF_KEY:
  217. sref = btrfs_item_ptr(l, i,
  218. struct btrfs_shared_data_ref);
  219. printk(KERN_INFO "\t\tshared data backref count %u\n",
  220. btrfs_shared_data_ref_count(l, sref));
  221. break;
  222. case BTRFS_EXTENT_DATA_KEY:
  223. fi = btrfs_item_ptr(l, i,
  224. struct btrfs_file_extent_item);
  225. if (btrfs_file_extent_type(l, fi) ==
  226. BTRFS_FILE_EXTENT_INLINE) {
  227. printk(KERN_INFO "\t\tinline extent data "
  228. "size %u\n",
  229. btrfs_file_extent_inline_len(l, fi));
  230. break;
  231. }
  232. printk(KERN_INFO "\t\textent data disk bytenr %llu "
  233. "nr %llu\n",
  234. (unsigned long long)
  235. btrfs_file_extent_disk_bytenr(l, fi),
  236. (unsigned long long)
  237. btrfs_file_extent_disk_num_bytes(l, fi));
  238. printk(KERN_INFO "\t\textent data offset %llu "
  239. "nr %llu ram %llu\n",
  240. (unsigned long long)
  241. btrfs_file_extent_offset(l, fi),
  242. (unsigned long long)
  243. btrfs_file_extent_num_bytes(l, fi),
  244. (unsigned long long)
  245. btrfs_file_extent_ram_bytes(l, fi));
  246. break;
  247. case BTRFS_EXTENT_REF_V0_KEY:
  248. #ifdef BTRFS_COMPAT_EXTENT_TREE_V0
  249. print_extent_ref_v0(l, i);
  250. #else
  251. BUG();
  252. #endif
  253. break;
  254. case BTRFS_BLOCK_GROUP_ITEM_KEY:
  255. bi = btrfs_item_ptr(l, i,
  256. struct btrfs_block_group_item);
  257. printk(KERN_INFO "\t\tblock group used %llu\n",
  258. (unsigned long long)
  259. btrfs_disk_block_group_used(l, bi));
  260. break;
  261. case BTRFS_CHUNK_ITEM_KEY:
  262. print_chunk(l, btrfs_item_ptr(l, i,
  263. struct btrfs_chunk));
  264. break;
  265. case BTRFS_DEV_ITEM_KEY:
  266. print_dev_item(l, btrfs_item_ptr(l, i,
  267. struct btrfs_dev_item));
  268. break;
  269. case BTRFS_DEV_EXTENT_KEY:
  270. dev_extent = btrfs_item_ptr(l, i,
  271. struct btrfs_dev_extent);
  272. printk(KERN_INFO "\t\tdev extent chunk_tree %llu\n"
  273. "\t\tchunk objectid %llu chunk offset %llu "
  274. "length %llu\n",
  275. (unsigned long long)
  276. btrfs_dev_extent_chunk_tree(l, dev_extent),
  277. (unsigned long long)
  278. btrfs_dev_extent_chunk_objectid(l, dev_extent),
  279. (unsigned long long)
  280. btrfs_dev_extent_chunk_offset(l, dev_extent),
  281. (unsigned long long)
  282. btrfs_dev_extent_length(l, dev_extent));
  283. };
  284. }
  285. }
  286. void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *c)
  287. {
  288. int i; u32 nr;
  289. struct btrfs_key key;
  290. int level;
  291. if (!c)
  292. return;
  293. nr = btrfs_header_nritems(c);
  294. level = btrfs_header_level(c);
  295. if (level == 0) {
  296. btrfs_print_leaf(root, c);
  297. return;
  298. }
  299. printk(KERN_INFO "node %llu level %d total ptrs %d free spc %u\n",
  300. (unsigned long long)btrfs_header_bytenr(c),
  301. level, nr,
  302. (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
  303. for (i = 0; i < nr; i++) {
  304. btrfs_node_key_to_cpu(c, &key, i);
  305. printk(KERN_INFO "\tkey %d (%llu %u %llu) block %llu\n",
  306. i,
  307. (unsigned long long)key.objectid,
  308. key.type,
  309. (unsigned long long)key.offset,
  310. (unsigned long long)btrfs_node_blockptr(c, i));
  311. }
  312. for (i = 0; i < nr; i++) {
  313. struct extent_buffer *next = read_tree_block(root,
  314. btrfs_node_blockptr(c, i),
  315. btrfs_level_size(root, level - 1),
  316. btrfs_node_ptr_generation(c, i));
  317. if (btrfs_is_leaf(next) &&
  318. level != 1)
  319. BUG();
  320. if (btrfs_header_level(next) !=
  321. level - 1)
  322. BUG();
  323. btrfs_print_tree(root, next);
  324. free_extent_buffer(next);
  325. }
  326. }