print-tree.c 11 KB

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