print-tree.c 11 KB

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