print-tree.c 11 KB

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