print-tree.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447
  1. // SPDX-License-Identifier: GPL-2.0
  2. /*
  3. * Copyright (C) 2007 Oracle. All rights reserved.
  4. */
  5. #include "messages.h"
  6. #include "ctree.h"
  7. #include "disk-io.h"
  8. #include "print-tree.h"
  9. #include "accessors.h"
  10. #include "tree-checker.h"
  11. #include "volumes.h"
  12. #include "raid-stripe-tree.h"
  13. struct root_name_map {
  14. u64 id;
  15. const char *name;
  16. };
  17. static const struct root_name_map root_map[] = {
  18. { BTRFS_ROOT_TREE_OBJECTID, "ROOT_TREE" },
  19. { BTRFS_EXTENT_TREE_OBJECTID, "EXTENT_TREE" },
  20. { BTRFS_CHUNK_TREE_OBJECTID, "CHUNK_TREE" },
  21. { BTRFS_DEV_TREE_OBJECTID, "DEV_TREE" },
  22. { BTRFS_FS_TREE_OBJECTID, "FS_TREE" },
  23. { BTRFS_CSUM_TREE_OBJECTID, "CSUM_TREE" },
  24. { BTRFS_TREE_LOG_OBJECTID, "TREE_LOG" },
  25. { BTRFS_QUOTA_TREE_OBJECTID, "QUOTA_TREE" },
  26. { BTRFS_UUID_TREE_OBJECTID, "UUID_TREE" },
  27. { BTRFS_FREE_SPACE_TREE_OBJECTID, "FREE_SPACE_TREE" },
  28. { BTRFS_BLOCK_GROUP_TREE_OBJECTID, "BLOCK_GROUP_TREE" },
  29. { BTRFS_DATA_RELOC_TREE_OBJECTID, "DATA_RELOC_TREE" },
  30. { BTRFS_RAID_STRIPE_TREE_OBJECTID, "RAID_STRIPE_TREE" },
  31. };
  32. const char *btrfs_root_name(const struct btrfs_key *key, char *buf)
  33. {
  34. int i;
  35. if (key->objectid == BTRFS_TREE_RELOC_OBJECTID) {
  36. snprintf(buf, BTRFS_ROOT_NAME_BUF_LEN,
  37. "TREE_RELOC offset=%llu", key->offset);
  38. return buf;
  39. }
  40. for (i = 0; i < ARRAY_SIZE(root_map); i++) {
  41. if (root_map[i].id == key->objectid)
  42. return root_map[i].name;
  43. }
  44. snprintf(buf, BTRFS_ROOT_NAME_BUF_LEN, "%llu", key->objectid);
  45. return buf;
  46. }
  47. static void print_chunk(const struct extent_buffer *eb, struct btrfs_chunk *chunk)
  48. {
  49. int num_stripes = btrfs_chunk_num_stripes(eb, chunk);
  50. int i;
  51. pr_info("\t\tchunk length %llu owner %llu type %llu num_stripes %d\n",
  52. btrfs_chunk_length(eb, chunk), btrfs_chunk_owner(eb, chunk),
  53. btrfs_chunk_type(eb, chunk), num_stripes);
  54. for (i = 0 ; i < num_stripes ; i++) {
  55. pr_info("\t\t\tstripe %d devid %llu offset %llu\n", i,
  56. btrfs_stripe_devid_nr(eb, chunk, i),
  57. btrfs_stripe_offset_nr(eb, chunk, i));
  58. }
  59. }
  60. static void print_dev_item(const struct extent_buffer *eb,
  61. struct btrfs_dev_item *dev_item)
  62. {
  63. pr_info("\t\tdev item devid %llu total_bytes %llu bytes used %llu\n",
  64. btrfs_device_id(eb, dev_item),
  65. btrfs_device_total_bytes(eb, dev_item),
  66. btrfs_device_bytes_used(eb, dev_item));
  67. }
  68. static void print_extent_data_ref(const struct extent_buffer *eb,
  69. struct btrfs_extent_data_ref *ref)
  70. {
  71. pr_cont("extent data backref root %llu objectid %llu offset %llu count %u\n",
  72. btrfs_extent_data_ref_root(eb, ref),
  73. btrfs_extent_data_ref_objectid(eb, ref),
  74. btrfs_extent_data_ref_offset(eb, ref),
  75. btrfs_extent_data_ref_count(eb, ref));
  76. }
  77. static void print_extent_owner_ref(const struct extent_buffer *eb,
  78. const struct btrfs_extent_owner_ref *ref)
  79. {
  80. ASSERT(btrfs_fs_incompat(eb->fs_info, SIMPLE_QUOTA));
  81. pr_cont("extent data owner root %llu\n", btrfs_extent_owner_ref_root_id(eb, ref));
  82. }
  83. static void print_extent_item(const struct extent_buffer *eb, int slot, int type)
  84. {
  85. struct btrfs_extent_item *ei;
  86. struct btrfs_extent_inline_ref *iref;
  87. struct btrfs_extent_data_ref *dref;
  88. struct btrfs_shared_data_ref *sref;
  89. struct btrfs_extent_owner_ref *oref;
  90. struct btrfs_disk_key key;
  91. unsigned long end;
  92. unsigned long ptr;
  93. u32 item_size = btrfs_item_size(eb, slot);
  94. u64 flags;
  95. u64 offset;
  96. int ref_index = 0;
  97. if (unlikely(item_size < sizeof(*ei))) {
  98. btrfs_err(eb->fs_info,
  99. "unexpected extent item size, has %u expect >= %zu",
  100. item_size, sizeof(*ei));
  101. return;
  102. }
  103. ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
  104. flags = btrfs_extent_flags(eb, ei);
  105. pr_info("\t\textent refs %llu gen %llu flags %llu\n",
  106. btrfs_extent_refs(eb, ei), btrfs_extent_generation(eb, ei),
  107. flags);
  108. if ((type == BTRFS_EXTENT_ITEM_KEY) &&
  109. flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
  110. struct btrfs_tree_block_info *info;
  111. info = (struct btrfs_tree_block_info *)(ei + 1);
  112. btrfs_tree_block_key(eb, info, &key);
  113. pr_info("\t\ttree block key (%llu %u %llu) level %d\n",
  114. btrfs_disk_key_objectid(&key), key.type,
  115. btrfs_disk_key_offset(&key),
  116. btrfs_tree_block_level(eb, info));
  117. iref = (struct btrfs_extent_inline_ref *)(info + 1);
  118. } else {
  119. iref = (struct btrfs_extent_inline_ref *)(ei + 1);
  120. }
  121. ptr = (unsigned long)iref;
  122. end = (unsigned long)ei + item_size;
  123. while (ptr < end) {
  124. iref = (struct btrfs_extent_inline_ref *)ptr;
  125. type = btrfs_extent_inline_ref_type(eb, iref);
  126. offset = btrfs_extent_inline_ref_offset(eb, iref);
  127. pr_info("\t\tref#%d: ", ref_index++);
  128. switch (type) {
  129. case BTRFS_TREE_BLOCK_REF_KEY:
  130. pr_cont("tree block backref root %llu\n", offset);
  131. break;
  132. case BTRFS_SHARED_BLOCK_REF_KEY:
  133. pr_cont("shared block backref parent %llu\n", offset);
  134. /*
  135. * offset is supposed to be a tree block which
  136. * must be aligned to nodesize.
  137. */
  138. if (!IS_ALIGNED(offset, eb->fs_info->sectorsize))
  139. pr_info(
  140. "\t\t\t(parent %llu not aligned to sectorsize %u)\n",
  141. offset, eb->fs_info->sectorsize);
  142. break;
  143. case BTRFS_EXTENT_DATA_REF_KEY:
  144. dref = (struct btrfs_extent_data_ref *)(&iref->offset);
  145. print_extent_data_ref(eb, dref);
  146. break;
  147. case BTRFS_SHARED_DATA_REF_KEY:
  148. sref = (struct btrfs_shared_data_ref *)(iref + 1);
  149. pr_cont("shared data backref parent %llu count %u\n",
  150. offset, btrfs_shared_data_ref_count(eb, sref));
  151. /*
  152. * Offset is supposed to be a tree block which must be
  153. * aligned to sectorsize.
  154. */
  155. if (!IS_ALIGNED(offset, eb->fs_info->sectorsize))
  156. pr_info(
  157. "\t\t\t(parent %llu not aligned to sectorsize %u)\n",
  158. offset, eb->fs_info->sectorsize);
  159. break;
  160. case BTRFS_EXTENT_OWNER_REF_KEY:
  161. oref = (struct btrfs_extent_owner_ref *)(&iref->offset);
  162. print_extent_owner_ref(eb, oref);
  163. break;
  164. default:
  165. pr_cont("(extent %llu has INVALID ref type %d)\n",
  166. eb->start, type);
  167. return;
  168. }
  169. ptr += btrfs_extent_inline_ref_size(type);
  170. }
  171. WARN_ON(ptr > end);
  172. }
  173. static void print_uuid_item(const struct extent_buffer *l, unsigned long offset,
  174. u32 item_size)
  175. {
  176. if (!IS_ALIGNED(item_size, sizeof(u64))) {
  177. pr_warn("BTRFS: uuid item with illegal size %lu!\n",
  178. (unsigned long)item_size);
  179. return;
  180. }
  181. while (item_size) {
  182. __le64 subvol_id;
  183. read_extent_buffer(l, &subvol_id, offset, sizeof(subvol_id));
  184. pr_info("\t\tsubvol_id %llu\n", le64_to_cpu(subvol_id));
  185. item_size -= sizeof(u64);
  186. offset += sizeof(u64);
  187. }
  188. }
  189. static void print_raid_stripe_key(const struct extent_buffer *eb, u32 item_size,
  190. struct btrfs_stripe_extent *stripe)
  191. {
  192. const int num_stripes = btrfs_num_raid_stripes(item_size);
  193. for (int i = 0; i < num_stripes; i++)
  194. pr_info("\t\t\tstride %d devid %llu physical %llu\n",
  195. i, btrfs_raid_stride_devid(eb, &stripe->strides[i]),
  196. btrfs_raid_stride_physical(eb, &stripe->strides[i]));
  197. }
  198. /*
  199. * Helper to output refs and locking status of extent buffer. Useful to debug
  200. * race condition related problems.
  201. */
  202. static void print_eb_refs_lock(const struct extent_buffer *eb)
  203. {
  204. #ifdef CONFIG_BTRFS_DEBUG
  205. btrfs_info(eb->fs_info, "refs %u lock_owner %u current %u",
  206. atomic_read(&eb->refs), eb->lock_owner, current->pid);
  207. #endif
  208. }
  209. void btrfs_print_leaf(const struct extent_buffer *l)
  210. {
  211. struct btrfs_fs_info *fs_info;
  212. int i;
  213. u32 type, nr;
  214. struct btrfs_root_item *ri;
  215. struct btrfs_dir_item *di;
  216. struct btrfs_inode_item *ii;
  217. struct btrfs_block_group_item *bi;
  218. struct btrfs_file_extent_item *fi;
  219. struct btrfs_extent_data_ref *dref;
  220. struct btrfs_shared_data_ref *sref;
  221. struct btrfs_dev_extent *dev_extent;
  222. struct btrfs_key key;
  223. struct btrfs_key found_key;
  224. if (!l)
  225. return;
  226. fs_info = l->fs_info;
  227. nr = btrfs_header_nritems(l);
  228. btrfs_info(fs_info,
  229. "leaf %llu gen %llu total ptrs %d free space %d owner %llu",
  230. btrfs_header_bytenr(l), btrfs_header_generation(l), nr,
  231. btrfs_leaf_free_space(l), btrfs_header_owner(l));
  232. print_eb_refs_lock(l);
  233. for (i = 0 ; i < nr ; i++) {
  234. btrfs_item_key_to_cpu(l, &key, i);
  235. type = key.type;
  236. pr_info("\titem %d key (%llu %u %llu) itemoff %d itemsize %d\n",
  237. i, key.objectid, type, key.offset,
  238. btrfs_item_offset(l, i), btrfs_item_size(l, i));
  239. switch (type) {
  240. case BTRFS_INODE_ITEM_KEY:
  241. ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
  242. pr_info("\t\tinode generation %llu size %llu mode %o\n",
  243. btrfs_inode_generation(l, ii),
  244. btrfs_inode_size(l, ii),
  245. btrfs_inode_mode(l, ii));
  246. break;
  247. case BTRFS_DIR_ITEM_KEY:
  248. di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  249. btrfs_dir_item_key_to_cpu(l, di, &found_key);
  250. pr_info("\t\tdir oid %llu flags %u\n",
  251. found_key.objectid,
  252. btrfs_dir_flags(l, di));
  253. break;
  254. case BTRFS_ROOT_ITEM_KEY:
  255. ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  256. pr_info("\t\troot data bytenr %llu refs %u\n",
  257. btrfs_disk_root_bytenr(l, ri),
  258. btrfs_disk_root_refs(l, ri));
  259. break;
  260. case BTRFS_EXTENT_ITEM_KEY:
  261. case BTRFS_METADATA_ITEM_KEY:
  262. print_extent_item(l, i, type);
  263. break;
  264. case BTRFS_TREE_BLOCK_REF_KEY:
  265. pr_info("\t\ttree block backref\n");
  266. break;
  267. case BTRFS_SHARED_BLOCK_REF_KEY:
  268. pr_info("\t\tshared block backref\n");
  269. break;
  270. case BTRFS_EXTENT_DATA_REF_KEY:
  271. dref = btrfs_item_ptr(l, i,
  272. struct btrfs_extent_data_ref);
  273. print_extent_data_ref(l, dref);
  274. break;
  275. case BTRFS_SHARED_DATA_REF_KEY:
  276. sref = btrfs_item_ptr(l, i,
  277. struct btrfs_shared_data_ref);
  278. pr_info("\t\tshared data backref count %u\n",
  279. btrfs_shared_data_ref_count(l, sref));
  280. break;
  281. case BTRFS_EXTENT_DATA_KEY:
  282. fi = btrfs_item_ptr(l, i,
  283. struct btrfs_file_extent_item);
  284. pr_info("\t\tgeneration %llu type %hhu\n",
  285. btrfs_file_extent_generation(l, fi),
  286. btrfs_file_extent_type(l, fi));
  287. if (btrfs_file_extent_type(l, fi) ==
  288. BTRFS_FILE_EXTENT_INLINE) {
  289. pr_info("\t\tinline extent data size %llu\n",
  290. btrfs_file_extent_ram_bytes(l, fi));
  291. break;
  292. }
  293. pr_info("\t\textent data disk bytenr %llu nr %llu\n",
  294. btrfs_file_extent_disk_bytenr(l, fi),
  295. btrfs_file_extent_disk_num_bytes(l, fi));
  296. pr_info("\t\textent data offset %llu nr %llu ram %llu\n",
  297. btrfs_file_extent_offset(l, fi),
  298. btrfs_file_extent_num_bytes(l, fi),
  299. btrfs_file_extent_ram_bytes(l, fi));
  300. break;
  301. case BTRFS_BLOCK_GROUP_ITEM_KEY:
  302. bi = btrfs_item_ptr(l, i,
  303. struct btrfs_block_group_item);
  304. pr_info(
  305. "\t\tblock group used %llu chunk_objectid %llu flags %llu\n",
  306. btrfs_block_group_used(l, bi),
  307. btrfs_block_group_chunk_objectid(l, bi),
  308. btrfs_block_group_flags(l, bi));
  309. break;
  310. case BTRFS_CHUNK_ITEM_KEY:
  311. print_chunk(l, btrfs_item_ptr(l, i,
  312. struct btrfs_chunk));
  313. break;
  314. case BTRFS_DEV_ITEM_KEY:
  315. print_dev_item(l, btrfs_item_ptr(l, i,
  316. struct btrfs_dev_item));
  317. break;
  318. case BTRFS_DEV_EXTENT_KEY:
  319. dev_extent = btrfs_item_ptr(l, i,
  320. struct btrfs_dev_extent);
  321. pr_info("\t\tdev extent chunk_tree %llu\n\t\tchunk objectid %llu chunk offset %llu length %llu\n",
  322. btrfs_dev_extent_chunk_tree(l, dev_extent),
  323. btrfs_dev_extent_chunk_objectid(l, dev_extent),
  324. btrfs_dev_extent_chunk_offset(l, dev_extent),
  325. btrfs_dev_extent_length(l, dev_extent));
  326. break;
  327. case BTRFS_PERSISTENT_ITEM_KEY:
  328. pr_info("\t\tpersistent item objectid %llu offset %llu\n",
  329. key.objectid, key.offset);
  330. switch (key.objectid) {
  331. case BTRFS_DEV_STATS_OBJECTID:
  332. pr_info("\t\tdevice stats\n");
  333. break;
  334. default:
  335. pr_info("\t\tunknown persistent item\n");
  336. }
  337. break;
  338. case BTRFS_TEMPORARY_ITEM_KEY:
  339. pr_info("\t\ttemporary item objectid %llu offset %llu\n",
  340. key.objectid, key.offset);
  341. switch (key.objectid) {
  342. case BTRFS_BALANCE_OBJECTID:
  343. pr_info("\t\tbalance status\n");
  344. break;
  345. default:
  346. pr_info("\t\tunknown temporary item\n");
  347. }
  348. break;
  349. case BTRFS_DEV_REPLACE_KEY:
  350. pr_info("\t\tdev replace\n");
  351. break;
  352. case BTRFS_UUID_KEY_SUBVOL:
  353. case BTRFS_UUID_KEY_RECEIVED_SUBVOL:
  354. print_uuid_item(l, btrfs_item_ptr_offset(l, i),
  355. btrfs_item_size(l, i));
  356. break;
  357. case BTRFS_RAID_STRIPE_KEY:
  358. print_raid_stripe_key(l, btrfs_item_size(l, i),
  359. btrfs_item_ptr(l, i, struct btrfs_stripe_extent));
  360. break;
  361. }
  362. }
  363. }
  364. void btrfs_print_tree(const struct extent_buffer *c, bool follow)
  365. {
  366. struct btrfs_fs_info *fs_info;
  367. int i; u32 nr;
  368. struct btrfs_key key;
  369. int level;
  370. if (!c)
  371. return;
  372. fs_info = c->fs_info;
  373. nr = btrfs_header_nritems(c);
  374. level = btrfs_header_level(c);
  375. if (level == 0) {
  376. btrfs_print_leaf(c);
  377. return;
  378. }
  379. btrfs_info(fs_info,
  380. "node %llu level %d gen %llu total ptrs %d free spc %u owner %llu",
  381. btrfs_header_bytenr(c), level, btrfs_header_generation(c),
  382. nr, (u32)BTRFS_NODEPTRS_PER_BLOCK(fs_info) - nr,
  383. btrfs_header_owner(c));
  384. print_eb_refs_lock(c);
  385. for (i = 0; i < nr; i++) {
  386. btrfs_node_key_to_cpu(c, &key, i);
  387. pr_info("\tkey %d (%llu %u %llu) block %llu gen %llu\n",
  388. i, key.objectid, key.type, key.offset,
  389. btrfs_node_blockptr(c, i),
  390. btrfs_node_ptr_generation(c, i));
  391. }
  392. if (!follow)
  393. return;
  394. for (i = 0; i < nr; i++) {
  395. struct btrfs_tree_parent_check check = {
  396. .level = level - 1,
  397. .transid = btrfs_node_ptr_generation(c, i),
  398. .owner_root = btrfs_header_owner(c),
  399. .has_first_key = true
  400. };
  401. struct extent_buffer *next;
  402. btrfs_node_key_to_cpu(c, &check.first_key, i);
  403. next = read_tree_block(fs_info, btrfs_node_blockptr(c, i), &check);
  404. if (IS_ERR(next))
  405. continue;
  406. if (!extent_buffer_uptodate(next)) {
  407. free_extent_buffer(next);
  408. continue;
  409. }
  410. if (btrfs_is_leaf(next) &&
  411. level != 1)
  412. BUG();
  413. if (btrfs_header_level(next) !=
  414. level - 1)
  415. BUG();
  416. btrfs_print_tree(next, follow);
  417. free_extent_buffer(next);
  418. }
  419. }