print-tree.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643
  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 "file-item.h"
  9. #include "print-tree.h"
  10. #include "accessors.h"
  11. #include "tree-checker.h"
  12. #include "volumes.h"
  13. #include "raid-stripe-tree.h"
  14. /*
  15. * Large enough buffer size for the stringification of any key type yet short
  16. * enough to use the stack and avoid allocations.
  17. */
  18. #define KEY_TYPE_BUF_SIZE 32
  19. struct root_name_map {
  20. u64 id;
  21. const char *name;
  22. };
  23. static const struct root_name_map root_map[] = {
  24. { BTRFS_ROOT_TREE_OBJECTID, "ROOT_TREE" },
  25. { BTRFS_EXTENT_TREE_OBJECTID, "EXTENT_TREE" },
  26. { BTRFS_CHUNK_TREE_OBJECTID, "CHUNK_TREE" },
  27. { BTRFS_DEV_TREE_OBJECTID, "DEV_TREE" },
  28. { BTRFS_FS_TREE_OBJECTID, "FS_TREE" },
  29. { BTRFS_CSUM_TREE_OBJECTID, "CSUM_TREE" },
  30. { BTRFS_TREE_LOG_OBJECTID, "TREE_LOG" },
  31. { BTRFS_QUOTA_TREE_OBJECTID, "QUOTA_TREE" },
  32. { BTRFS_UUID_TREE_OBJECTID, "UUID_TREE" },
  33. { BTRFS_FREE_SPACE_TREE_OBJECTID, "FREE_SPACE_TREE" },
  34. { BTRFS_BLOCK_GROUP_TREE_OBJECTID, "BLOCK_GROUP_TREE" },
  35. { BTRFS_DATA_RELOC_TREE_OBJECTID, "DATA_RELOC_TREE" },
  36. { BTRFS_RAID_STRIPE_TREE_OBJECTID, "RAID_STRIPE_TREE" },
  37. { BTRFS_REMAP_TREE_OBJECTID, "REMAP_TREE" },
  38. };
  39. const char *btrfs_root_name(const struct btrfs_key *key, char *buf)
  40. {
  41. int i;
  42. if (key->objectid == BTRFS_TREE_RELOC_OBJECTID) {
  43. snprintf(buf, BTRFS_ROOT_NAME_BUF_LEN,
  44. "TREE_RELOC offset=%llu", key->offset);
  45. return buf;
  46. }
  47. for (i = 0; i < ARRAY_SIZE(root_map); i++) {
  48. if (root_map[i].id == key->objectid)
  49. return root_map[i].name;
  50. }
  51. snprintf(buf, BTRFS_ROOT_NAME_BUF_LEN, "%llu", key->objectid);
  52. return buf;
  53. }
  54. static void print_chunk(const struct extent_buffer *eb, struct btrfs_chunk *chunk)
  55. {
  56. int num_stripes = btrfs_chunk_num_stripes(eb, chunk);
  57. int i;
  58. pr_info("\t\tchunk length %llu owner %llu type %llu num_stripes %d\n",
  59. btrfs_chunk_length(eb, chunk), btrfs_chunk_owner(eb, chunk),
  60. btrfs_chunk_type(eb, chunk), num_stripes);
  61. for (i = 0 ; i < num_stripes ; i++) {
  62. pr_info("\t\t\tstripe %d devid %llu offset %llu\n", i,
  63. btrfs_stripe_devid_nr(eb, chunk, i),
  64. btrfs_stripe_offset_nr(eb, chunk, i));
  65. }
  66. }
  67. static void print_dev_item(const struct extent_buffer *eb,
  68. struct btrfs_dev_item *dev_item)
  69. {
  70. pr_info("\t\tdev item devid %llu total_bytes %llu bytes used %llu\n",
  71. btrfs_device_id(eb, dev_item),
  72. btrfs_device_total_bytes(eb, dev_item),
  73. btrfs_device_bytes_used(eb, dev_item));
  74. }
  75. static void print_extent_data_ref(const struct extent_buffer *eb,
  76. struct btrfs_extent_data_ref *ref)
  77. {
  78. pr_cont("extent data backref root %llu objectid %llu offset %llu count %u\n",
  79. btrfs_extent_data_ref_root(eb, ref),
  80. btrfs_extent_data_ref_objectid(eb, ref),
  81. btrfs_extent_data_ref_offset(eb, ref),
  82. btrfs_extent_data_ref_count(eb, ref));
  83. }
  84. static void print_extent_owner_ref(const struct extent_buffer *eb,
  85. const struct btrfs_extent_owner_ref *ref)
  86. {
  87. ASSERT(btrfs_fs_incompat(eb->fs_info, SIMPLE_QUOTA));
  88. pr_cont("extent data owner root %llu\n", btrfs_extent_owner_ref_root_id(eb, ref));
  89. }
  90. static void print_extent_item(const struct extent_buffer *eb, int slot, int type)
  91. {
  92. struct btrfs_extent_item *ei;
  93. struct btrfs_extent_inline_ref *iref;
  94. struct btrfs_extent_data_ref *dref;
  95. struct btrfs_shared_data_ref *sref;
  96. struct btrfs_extent_owner_ref *oref;
  97. struct btrfs_disk_key key;
  98. unsigned long end;
  99. unsigned long ptr;
  100. u32 item_size = btrfs_item_size(eb, slot);
  101. u64 flags;
  102. u64 offset;
  103. int ref_index = 0;
  104. if (unlikely(item_size < sizeof(*ei))) {
  105. btrfs_err(eb->fs_info,
  106. "unexpected extent item size, has %u expect >= %zu",
  107. item_size, sizeof(*ei));
  108. return;
  109. }
  110. ei = btrfs_item_ptr(eb, slot, struct btrfs_extent_item);
  111. flags = btrfs_extent_flags(eb, ei);
  112. pr_info("\t\textent refs %llu gen %llu flags %llu\n",
  113. btrfs_extent_refs(eb, ei), btrfs_extent_generation(eb, ei),
  114. flags);
  115. if ((type == BTRFS_EXTENT_ITEM_KEY) &&
  116. flags & BTRFS_EXTENT_FLAG_TREE_BLOCK) {
  117. struct btrfs_tree_block_info *info;
  118. info = (struct btrfs_tree_block_info *)(ei + 1);
  119. btrfs_tree_block_key(eb, info, &key);
  120. pr_info("\t\ttree block key " BTRFS_KEY_FMT " level %d\n",
  121. btrfs_disk_key_objectid(&key), key.type,
  122. btrfs_disk_key_offset(&key),
  123. btrfs_tree_block_level(eb, info));
  124. iref = (struct btrfs_extent_inline_ref *)(info + 1);
  125. } else {
  126. iref = (struct btrfs_extent_inline_ref *)(ei + 1);
  127. }
  128. ptr = (unsigned long)iref;
  129. end = (unsigned long)ei + item_size;
  130. while (ptr < end) {
  131. iref = (struct btrfs_extent_inline_ref *)ptr;
  132. type = btrfs_extent_inline_ref_type(eb, iref);
  133. offset = btrfs_extent_inline_ref_offset(eb, iref);
  134. pr_info("\t\tref#%d: ", ref_index++);
  135. switch (type) {
  136. case BTRFS_TREE_BLOCK_REF_KEY:
  137. pr_cont("tree block backref root %llu\n", offset);
  138. break;
  139. case BTRFS_SHARED_BLOCK_REF_KEY:
  140. pr_cont("shared block backref parent %llu\n", offset);
  141. /*
  142. * offset is supposed to be a tree block which
  143. * must be aligned to nodesize.
  144. */
  145. if (!IS_ALIGNED(offset, eb->fs_info->sectorsize))
  146. pr_info(
  147. "\t\t\t(parent %llu not aligned to sectorsize %u)\n",
  148. offset, eb->fs_info->sectorsize);
  149. break;
  150. case BTRFS_EXTENT_DATA_REF_KEY:
  151. dref = (struct btrfs_extent_data_ref *)(&iref->offset);
  152. print_extent_data_ref(eb, dref);
  153. break;
  154. case BTRFS_SHARED_DATA_REF_KEY:
  155. sref = (struct btrfs_shared_data_ref *)(iref + 1);
  156. pr_cont("shared data backref parent %llu count %u\n",
  157. offset, btrfs_shared_data_ref_count(eb, sref));
  158. /*
  159. * Offset is supposed to be a tree block which must be
  160. * aligned to sectorsize.
  161. */
  162. if (!IS_ALIGNED(offset, eb->fs_info->sectorsize))
  163. pr_info(
  164. "\t\t\t(parent %llu not aligned to sectorsize %u)\n",
  165. offset, eb->fs_info->sectorsize);
  166. break;
  167. case BTRFS_EXTENT_OWNER_REF_KEY:
  168. oref = (struct btrfs_extent_owner_ref *)(&iref->offset);
  169. print_extent_owner_ref(eb, oref);
  170. break;
  171. default:
  172. pr_cont("(extent %llu has INVALID ref type %d)\n",
  173. eb->start, type);
  174. return;
  175. }
  176. ptr += btrfs_extent_inline_ref_size(type);
  177. }
  178. WARN_ON(ptr > end);
  179. }
  180. static void print_uuid_item(const struct extent_buffer *l, unsigned long offset,
  181. u32 item_size)
  182. {
  183. if (!IS_ALIGNED(item_size, sizeof(u64))) {
  184. btrfs_warn(l->fs_info, "uuid item with illegal size %lu",
  185. (unsigned long)item_size);
  186. return;
  187. }
  188. while (item_size) {
  189. __le64 subvol_id;
  190. read_extent_buffer(l, &subvol_id, offset, sizeof(subvol_id));
  191. pr_info("\t\tsubvol_id %llu\n", le64_to_cpu(subvol_id));
  192. item_size -= sizeof(u64);
  193. offset += sizeof(u64);
  194. }
  195. }
  196. static void print_raid_stripe_key(const struct extent_buffer *eb, u32 item_size,
  197. struct btrfs_stripe_extent *stripe)
  198. {
  199. const int num_stripes = btrfs_num_raid_stripes(item_size);
  200. for (int i = 0; i < num_stripes; i++)
  201. pr_info("\t\t\tstride %d devid %llu physical %llu\n",
  202. i, btrfs_raid_stride_devid(eb, &stripe->strides[i]),
  203. btrfs_raid_stride_physical(eb, &stripe->strides[i]));
  204. }
  205. /*
  206. * Helper to output refs and locking status of extent buffer. Useful to debug
  207. * race condition related problems.
  208. */
  209. static void print_eb_refs_lock(const struct extent_buffer *eb)
  210. {
  211. #ifdef CONFIG_BTRFS_DEBUG
  212. btrfs_info(eb->fs_info, "refs %u lock_owner %u current %u",
  213. refcount_read(&eb->refs), eb->lock_owner, current->pid);
  214. #endif
  215. }
  216. static void print_timespec(const struct extent_buffer *eb,
  217. struct btrfs_timespec *timespec,
  218. const char *prefix, const char *suffix)
  219. {
  220. const u64 secs = btrfs_timespec_sec(eb, timespec);
  221. const u32 nsecs = btrfs_timespec_nsec(eb, timespec);
  222. pr_info("%s%llu.%u%s", prefix, secs, nsecs, suffix);
  223. }
  224. static void print_inode_item(const struct extent_buffer *eb, int i)
  225. {
  226. struct btrfs_inode_item *ii = btrfs_item_ptr(eb, i, struct btrfs_inode_item);
  227. pr_info("\t\tinode generation %llu transid %llu size %llu nbytes %llu\n",
  228. btrfs_inode_generation(eb, ii), btrfs_inode_transid(eb, ii),
  229. btrfs_inode_size(eb, ii), btrfs_inode_nbytes(eb, ii));
  230. pr_info("\t\tblock group %llu mode %o links %u uid %u gid %u\n",
  231. btrfs_inode_block_group(eb, ii), btrfs_inode_mode(eb, ii),
  232. btrfs_inode_nlink(eb, ii), btrfs_inode_uid(eb, ii),
  233. btrfs_inode_gid(eb, ii));
  234. pr_info("\t\trdev %llu sequence %llu flags 0x%llx\n",
  235. btrfs_inode_rdev(eb, ii), btrfs_inode_sequence(eb, ii),
  236. btrfs_inode_flags(eb, ii));
  237. print_timespec(eb, &ii->atime, "\t\tatime ", "\n");
  238. print_timespec(eb, &ii->ctime, "\t\tctime ", "\n");
  239. print_timespec(eb, &ii->mtime, "\t\tmtime ", "\n");
  240. print_timespec(eb, &ii->otime, "\t\totime ", "\n");
  241. }
  242. static void print_dir_item(const struct extent_buffer *eb, int i)
  243. {
  244. const u32 size = btrfs_item_size(eb, i);
  245. struct btrfs_dir_item *di = btrfs_item_ptr(eb, i, struct btrfs_dir_item);
  246. u32 cur = 0;
  247. while (cur < size) {
  248. const u32 name_len = btrfs_dir_name_len(eb, di);
  249. const u32 data_len = btrfs_dir_data_len(eb, di);
  250. const u32 len = sizeof(*di) + name_len + data_len;
  251. struct btrfs_key location;
  252. btrfs_dir_item_key_to_cpu(eb, di, &location);
  253. pr_info("\t\tlocation key " BTRFS_KEY_FMT " type %d\n",
  254. BTRFS_KEY_FMT_VALUE(&location), btrfs_dir_ftype(eb, di));
  255. pr_info("\t\ttransid %llu data_len %u name_len %u\n",
  256. btrfs_dir_transid(eb, di), data_len, name_len);
  257. di = (struct btrfs_dir_item *)((char *)di + len);
  258. cur += len;
  259. }
  260. }
  261. static void print_inode_ref_item(const struct extent_buffer *eb, int i)
  262. {
  263. const u32 size = btrfs_item_size(eb, i);
  264. struct btrfs_inode_ref *ref = btrfs_item_ptr(eb, i, struct btrfs_inode_ref);
  265. u32 cur = 0;
  266. while (cur < size) {
  267. const u64 index = btrfs_inode_ref_index(eb, ref);
  268. const u32 name_len = btrfs_inode_ref_name_len(eb, ref);
  269. const u32 len = sizeof(*ref) + name_len;
  270. pr_info("\t\tindex %llu name_len %u\n", index, name_len);
  271. ref = (struct btrfs_inode_ref *)((char *)ref + len);
  272. cur += len;
  273. }
  274. }
  275. static void print_inode_extref_item(const struct extent_buffer *eb, int i)
  276. {
  277. const u32 size = btrfs_item_size(eb, i);
  278. struct btrfs_inode_extref *extref;
  279. u32 cur = 0;
  280. extref = btrfs_item_ptr(eb, i, struct btrfs_inode_extref);
  281. while (cur < size) {
  282. const u64 index = btrfs_inode_extref_index(eb, extref);
  283. const u32 name_len = btrfs_inode_extref_name_len(eb, extref);
  284. const u64 parent = btrfs_inode_extref_parent(eb, extref);
  285. const u32 len = sizeof(*extref) + name_len;
  286. pr_info("\t\tindex %llu parent %llu name_len %u\n",
  287. index, parent, name_len);
  288. extref = (struct btrfs_inode_extref *)((char *)extref + len);
  289. cur += len;
  290. }
  291. }
  292. static void print_dir_log_index_item(const struct extent_buffer *eb, int i)
  293. {
  294. struct btrfs_dir_log_item *dlog;
  295. dlog = btrfs_item_ptr(eb, i, struct btrfs_dir_log_item);
  296. pr_info("\t\tdir log end %llu\n", btrfs_dir_log_end(eb, dlog));
  297. }
  298. static void print_extent_csum(const struct extent_buffer *eb, int i)
  299. {
  300. const struct btrfs_fs_info *fs_info = eb->fs_info;
  301. const u32 size = btrfs_item_size(eb, i);
  302. const u32 csum_bytes = (size / fs_info->csum_size) * fs_info->sectorsize;
  303. struct btrfs_key key;
  304. btrfs_item_key_to_cpu(eb, &key, i);
  305. pr_info("\t\trange start %llu end %llu length %u\n",
  306. key.offset, key.offset + csum_bytes, csum_bytes);
  307. }
  308. static void print_file_extent_item(const struct extent_buffer *eb, int i)
  309. {
  310. struct btrfs_file_extent_item *fi;
  311. fi = btrfs_item_ptr(eb, i, struct btrfs_file_extent_item);
  312. pr_info("\t\tgeneration %llu type %hhu\n",
  313. btrfs_file_extent_generation(eb, fi),
  314. btrfs_file_extent_type(eb, fi));
  315. if (btrfs_file_extent_type(eb, fi) == BTRFS_FILE_EXTENT_INLINE) {
  316. pr_info("\t\tinline extent data size %u ram_bytes %llu compression %hhu\n",
  317. btrfs_file_extent_inline_item_len(eb, i),
  318. btrfs_file_extent_ram_bytes(eb, fi),
  319. btrfs_file_extent_compression(eb, fi));
  320. return;
  321. }
  322. pr_info("\t\textent data disk bytenr %llu nr %llu\n",
  323. btrfs_file_extent_disk_bytenr(eb, fi),
  324. btrfs_file_extent_disk_num_bytes(eb, fi));
  325. pr_info("\t\textent data offset %llu nr %llu ram %llu\n",
  326. btrfs_file_extent_offset(eb, fi),
  327. btrfs_file_extent_num_bytes(eb, fi),
  328. btrfs_file_extent_ram_bytes(eb, fi));
  329. pr_info("\t\textent compression %hhu\n",
  330. btrfs_file_extent_compression(eb, fi));
  331. }
  332. static void key_type_string(const struct btrfs_key *key, char *buf, int buf_size)
  333. {
  334. static const char *key_to_str[256] = {
  335. [BTRFS_INODE_ITEM_KEY] = "INODE_ITEM",
  336. [BTRFS_INODE_REF_KEY] = "INODE_REF",
  337. [BTRFS_INODE_EXTREF_KEY] = "INODE_EXTREF",
  338. [BTRFS_DIR_ITEM_KEY] = "DIR_ITEM",
  339. [BTRFS_DIR_INDEX_KEY] = "DIR_INDEX",
  340. [BTRFS_DIR_LOG_ITEM_KEY] = "DIR_LOG_ITEM",
  341. [BTRFS_DIR_LOG_INDEX_KEY] = "DIR_LOG_INDEX",
  342. [BTRFS_XATTR_ITEM_KEY] = "XATTR_ITEM",
  343. [BTRFS_VERITY_DESC_ITEM_KEY] = "VERITY_DESC_ITEM",
  344. [BTRFS_VERITY_MERKLE_ITEM_KEY] = "VERITY_MERKLE_ITEM",
  345. [BTRFS_ORPHAN_ITEM_KEY] = "ORPHAN_ITEM",
  346. [BTRFS_ROOT_ITEM_KEY] = "ROOT_ITEM",
  347. [BTRFS_ROOT_REF_KEY] = "ROOT_REF",
  348. [BTRFS_ROOT_BACKREF_KEY] = "ROOT_BACKREF",
  349. [BTRFS_EXTENT_ITEM_KEY] = "EXTENT_ITEM",
  350. [BTRFS_METADATA_ITEM_KEY] = "METADATA_ITEM",
  351. [BTRFS_TREE_BLOCK_REF_KEY] = "TREE_BLOCK_REF",
  352. [BTRFS_SHARED_BLOCK_REF_KEY] = "SHARED_BLOCK_REF",
  353. [BTRFS_EXTENT_DATA_REF_KEY] = "EXTENT_DATA_REF",
  354. [BTRFS_SHARED_DATA_REF_KEY] = "SHARED_DATA_REF",
  355. [BTRFS_EXTENT_OWNER_REF_KEY] = "EXTENT_OWNER_REF",
  356. [BTRFS_EXTENT_CSUM_KEY] = "EXTENT_CSUM",
  357. [BTRFS_EXTENT_DATA_KEY] = "EXTENT_DATA",
  358. [BTRFS_BLOCK_GROUP_ITEM_KEY] = "BLOCK_GROUP_ITEM",
  359. [BTRFS_FREE_SPACE_INFO_KEY] = "FREE_SPACE_INFO",
  360. [BTRFS_FREE_SPACE_EXTENT_KEY] = "FREE_SPACE_EXTENT",
  361. [BTRFS_FREE_SPACE_BITMAP_KEY] = "FREE_SPACE_BITMAP",
  362. [BTRFS_CHUNK_ITEM_KEY] = "CHUNK_ITEM",
  363. [BTRFS_DEV_ITEM_KEY] = "DEV_ITEM",
  364. [BTRFS_DEV_EXTENT_KEY] = "DEV_EXTENT",
  365. [BTRFS_TEMPORARY_ITEM_KEY] = "TEMPORARY_ITEM",
  366. [BTRFS_DEV_REPLACE_KEY] = "DEV_REPLACE",
  367. [BTRFS_STRING_ITEM_KEY] = "STRING_ITEM",
  368. [BTRFS_QGROUP_STATUS_KEY] = "QGROUP_STATUS",
  369. [BTRFS_QGROUP_RELATION_KEY] = "QGROUP_RELATION",
  370. [BTRFS_QGROUP_INFO_KEY] = "QGROUP_INFO",
  371. [BTRFS_QGROUP_LIMIT_KEY] = "QGROUP_LIMIT",
  372. [BTRFS_PERSISTENT_ITEM_KEY] = "PERSISTENT_ITEM",
  373. [BTRFS_UUID_KEY_SUBVOL] = "UUID_KEY_SUBVOL",
  374. [BTRFS_UUID_KEY_RECEIVED_SUBVOL] = "UUID_KEY_RECEIVED_SUBVOL",
  375. [BTRFS_RAID_STRIPE_KEY] = "RAID_STRIPE",
  376. [BTRFS_IDENTITY_REMAP_KEY] = "IDENTITY_REMAP",
  377. [BTRFS_REMAP_KEY] = "REMAP",
  378. [BTRFS_REMAP_BACKREF_KEY] = "REMAP_BACKREF",
  379. };
  380. if (key->type == 0 && key->objectid == BTRFS_FREE_SPACE_OBJECTID)
  381. scnprintf(buf, buf_size, "UNTYPED");
  382. else if (key_to_str[key->type])
  383. scnprintf(buf, buf_size, "%s", key_to_str[key->type]);
  384. else
  385. scnprintf(buf, buf_size, "UNKNOWN.%d", key->type);
  386. }
  387. void btrfs_print_leaf(const struct extent_buffer *l)
  388. {
  389. struct btrfs_fs_info *fs_info;
  390. int i;
  391. u32 type, nr;
  392. struct btrfs_root_item *ri;
  393. struct btrfs_block_group_item *bi;
  394. struct btrfs_extent_data_ref *dref;
  395. struct btrfs_shared_data_ref *sref;
  396. struct btrfs_dev_extent *dev_extent;
  397. struct btrfs_remap_item *remap;
  398. struct btrfs_key key;
  399. if (!l)
  400. return;
  401. fs_info = l->fs_info;
  402. nr = btrfs_header_nritems(l);
  403. btrfs_info(fs_info,
  404. "leaf %llu gen %llu total ptrs %d free space %d owner %llu",
  405. btrfs_header_bytenr(l), btrfs_header_generation(l), nr,
  406. btrfs_leaf_free_space(l), btrfs_header_owner(l));
  407. print_eb_refs_lock(l);
  408. for (i = 0 ; i < nr ; i++) {
  409. char key_buf[KEY_TYPE_BUF_SIZE];
  410. btrfs_item_key_to_cpu(l, &key, i);
  411. type = key.type;
  412. key_type_string(&key, key_buf, KEY_TYPE_BUF_SIZE);
  413. pr_info("\titem %d key (%llu %s %llu) itemoff %d itemsize %d\n",
  414. i, key.objectid, key_buf, key.offset,
  415. btrfs_item_offset(l, i), btrfs_item_size(l, i));
  416. switch (type) {
  417. case BTRFS_INODE_ITEM_KEY:
  418. print_inode_item(l, i);
  419. break;
  420. case BTRFS_INODE_REF_KEY:
  421. print_inode_ref_item(l, i);
  422. break;
  423. case BTRFS_INODE_EXTREF_KEY:
  424. print_inode_extref_item(l, i);
  425. break;
  426. case BTRFS_DIR_ITEM_KEY:
  427. case BTRFS_DIR_INDEX_KEY:
  428. case BTRFS_XATTR_ITEM_KEY:
  429. print_dir_item(l, i);
  430. break;
  431. case BTRFS_DIR_LOG_INDEX_KEY:
  432. print_dir_log_index_item(l, i);
  433. break;
  434. case BTRFS_EXTENT_CSUM_KEY:
  435. print_extent_csum(l, i);
  436. break;
  437. case BTRFS_ROOT_ITEM_KEY:
  438. ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  439. pr_info("\t\troot data bytenr %llu refs %u\n",
  440. btrfs_disk_root_bytenr(l, ri),
  441. btrfs_disk_root_refs(l, ri));
  442. break;
  443. case BTRFS_EXTENT_ITEM_KEY:
  444. case BTRFS_METADATA_ITEM_KEY:
  445. print_extent_item(l, i, type);
  446. break;
  447. case BTRFS_TREE_BLOCK_REF_KEY:
  448. pr_info("\t\ttree block backref\n");
  449. break;
  450. case BTRFS_SHARED_BLOCK_REF_KEY:
  451. pr_info("\t\tshared block backref\n");
  452. break;
  453. case BTRFS_EXTENT_DATA_REF_KEY:
  454. dref = btrfs_item_ptr(l, i,
  455. struct btrfs_extent_data_ref);
  456. print_extent_data_ref(l, dref);
  457. break;
  458. case BTRFS_SHARED_DATA_REF_KEY:
  459. sref = btrfs_item_ptr(l, i,
  460. struct btrfs_shared_data_ref);
  461. pr_info("\t\tshared data backref count %u\n",
  462. btrfs_shared_data_ref_count(l, sref));
  463. break;
  464. case BTRFS_EXTENT_DATA_KEY:
  465. print_file_extent_item(l, i);
  466. break;
  467. case BTRFS_BLOCK_GROUP_ITEM_KEY:
  468. bi = btrfs_item_ptr(l, i,
  469. struct btrfs_block_group_item);
  470. pr_info(
  471. "\t\tblock group used %llu chunk_objectid %llu flags %llu\n",
  472. btrfs_block_group_used(l, bi),
  473. btrfs_block_group_chunk_objectid(l, bi),
  474. btrfs_block_group_flags(l, bi));
  475. break;
  476. case BTRFS_CHUNK_ITEM_KEY:
  477. print_chunk(l, btrfs_item_ptr(l, i,
  478. struct btrfs_chunk));
  479. break;
  480. case BTRFS_DEV_ITEM_KEY:
  481. print_dev_item(l, btrfs_item_ptr(l, i,
  482. struct btrfs_dev_item));
  483. break;
  484. case BTRFS_DEV_EXTENT_KEY:
  485. dev_extent = btrfs_item_ptr(l, i,
  486. struct btrfs_dev_extent);
  487. pr_info("\t\tdev extent chunk_tree %llu\n\t\tchunk objectid %llu chunk offset %llu length %llu\n",
  488. btrfs_dev_extent_chunk_tree(l, dev_extent),
  489. btrfs_dev_extent_chunk_objectid(l, dev_extent),
  490. btrfs_dev_extent_chunk_offset(l, dev_extent),
  491. btrfs_dev_extent_length(l, dev_extent));
  492. break;
  493. case BTRFS_PERSISTENT_ITEM_KEY:
  494. pr_info("\t\tpersistent item objectid %llu offset %llu\n",
  495. key.objectid, key.offset);
  496. switch (key.objectid) {
  497. case BTRFS_DEV_STATS_OBJECTID:
  498. pr_info("\t\tdevice stats\n");
  499. break;
  500. default:
  501. pr_info("\t\tunknown persistent item\n");
  502. }
  503. break;
  504. case BTRFS_TEMPORARY_ITEM_KEY:
  505. pr_info("\t\ttemporary item objectid %llu offset %llu\n",
  506. key.objectid, key.offset);
  507. switch (key.objectid) {
  508. case BTRFS_BALANCE_OBJECTID:
  509. pr_info("\t\tbalance status\n");
  510. break;
  511. default:
  512. pr_info("\t\tunknown temporary item\n");
  513. }
  514. break;
  515. case BTRFS_DEV_REPLACE_KEY:
  516. pr_info("\t\tdev replace\n");
  517. break;
  518. case BTRFS_UUID_KEY_SUBVOL:
  519. case BTRFS_UUID_KEY_RECEIVED_SUBVOL:
  520. print_uuid_item(l, btrfs_item_ptr_offset(l, i),
  521. btrfs_item_size(l, i));
  522. break;
  523. case BTRFS_RAID_STRIPE_KEY:
  524. print_raid_stripe_key(l, btrfs_item_size(l, i),
  525. btrfs_item_ptr(l, i, struct btrfs_stripe_extent));
  526. break;
  527. case BTRFS_REMAP_KEY:
  528. case BTRFS_REMAP_BACKREF_KEY:
  529. remap = btrfs_item_ptr(l, i, struct btrfs_remap_item);
  530. pr_info("\t\taddress %llu\n", btrfs_remap_address(l, remap));
  531. break;
  532. }
  533. }
  534. }
  535. void btrfs_print_tree(const struct extent_buffer *c, bool follow)
  536. {
  537. struct btrfs_fs_info *fs_info;
  538. int i; u32 nr;
  539. struct btrfs_key key;
  540. int level;
  541. if (!c)
  542. return;
  543. fs_info = c->fs_info;
  544. nr = btrfs_header_nritems(c);
  545. level = btrfs_header_level(c);
  546. if (level == 0) {
  547. btrfs_print_leaf(c);
  548. return;
  549. }
  550. btrfs_info(fs_info,
  551. "node %llu level %d gen %llu total ptrs %d free spc %u owner %llu",
  552. btrfs_header_bytenr(c), level, btrfs_header_generation(c),
  553. nr, (u32)BTRFS_NODEPTRS_PER_BLOCK(fs_info) - nr,
  554. btrfs_header_owner(c));
  555. print_eb_refs_lock(c);
  556. for (i = 0; i < nr; i++) {
  557. btrfs_node_key_to_cpu(c, &key, i);
  558. pr_info("\tkey %d " BTRFS_KEY_FMT " block %llu gen %llu\n",
  559. i, BTRFS_KEY_FMT_VALUE(&key), btrfs_node_blockptr(c, i),
  560. btrfs_node_ptr_generation(c, i));
  561. }
  562. if (!follow)
  563. return;
  564. for (i = 0; i < nr; i++) {
  565. struct btrfs_tree_parent_check check = {
  566. .level = level - 1,
  567. .transid = btrfs_node_ptr_generation(c, i),
  568. .owner_root = btrfs_header_owner(c),
  569. .has_first_key = true
  570. };
  571. struct extent_buffer *next;
  572. btrfs_node_key_to_cpu(c, &check.first_key, i);
  573. next = read_tree_block(fs_info, btrfs_node_blockptr(c, i), &check);
  574. if (IS_ERR(next))
  575. continue;
  576. if (!extent_buffer_uptodate(next)) {
  577. free_extent_buffer(next);
  578. continue;
  579. }
  580. if (btrfs_is_leaf(next) &&
  581. level != 1)
  582. BUG();
  583. if (btrfs_header_level(next) !=
  584. level - 1)
  585. BUG();
  586. btrfs_print_tree(next, follow);
  587. free_extent_buffer(next);
  588. }
  589. }