print-tree.c 6.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192
  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. printk("\t\tchunk owner %llu type %llu num_stripes %d\n",
  26. (unsigned long long)btrfs_chunk_owner(eb, chunk),
  27. (unsigned long long)btrfs_chunk_type(eb, chunk),
  28. num_stripes);
  29. for (i = 0 ; i < num_stripes ; i++) {
  30. printk("\t\t\tstripe %d devid %llu offset %llu\n", i,
  31. (unsigned long long)btrfs_stripe_devid_nr(eb, chunk, i),
  32. (unsigned long long)btrfs_stripe_offset_nr(eb, chunk, i));
  33. }
  34. }
  35. static void print_dev_item(struct extent_buffer *eb,
  36. struct btrfs_dev_item *dev_item)
  37. {
  38. printk("\t\tdev item devid %llu "
  39. "total_bytes %llu bytes used %Lu\n",
  40. (unsigned long long)btrfs_device_id(eb, dev_item),
  41. (unsigned long long)btrfs_device_total_bytes(eb, dev_item),
  42. (unsigned long long)btrfs_device_bytes_used(eb, dev_item));
  43. }
  44. void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
  45. {
  46. int i;
  47. u32 nr = btrfs_header_nritems(l);
  48. struct btrfs_item *item;
  49. struct btrfs_extent_item *ei;
  50. struct btrfs_root_item *ri;
  51. struct btrfs_dir_item *di;
  52. struct btrfs_inode_item *ii;
  53. struct btrfs_block_group_item *bi;
  54. struct btrfs_file_extent_item *fi;
  55. struct btrfs_key key;
  56. struct btrfs_key found_key;
  57. struct btrfs_extent_ref *ref;
  58. struct btrfs_dev_extent *dev_extent;
  59. u32 type;
  60. printk("leaf %llu total ptrs %d free space %d\n",
  61. (unsigned long long)btrfs_header_bytenr(l), nr,
  62. btrfs_leaf_free_space(root, l));
  63. for (i = 0 ; i < nr ; i++) {
  64. item = btrfs_item_nr(l, i);
  65. btrfs_item_key_to_cpu(l, &key, i);
  66. type = btrfs_key_type(&key);
  67. printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
  68. i,
  69. (unsigned long long)key.objectid, type,
  70. (unsigned long long)key.offset,
  71. btrfs_item_offset(l, item), btrfs_item_size(l, item));
  72. switch (type) {
  73. case BTRFS_INODE_ITEM_KEY:
  74. ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
  75. printk("\t\tinode generation %llu size %llu mode %o\n",
  76. (unsigned long long)btrfs_inode_generation(l, ii),
  77. (unsigned long long)btrfs_inode_size(l, ii),
  78. btrfs_inode_mode(l, ii));
  79. break;
  80. case BTRFS_DIR_ITEM_KEY:
  81. di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
  82. btrfs_dir_item_key_to_cpu(l, di, &found_key);
  83. printk("\t\tdir oid %llu type %u\n",
  84. (unsigned long long)found_key.objectid,
  85. btrfs_dir_type(l, di));
  86. break;
  87. case BTRFS_ROOT_ITEM_KEY:
  88. ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
  89. printk("\t\troot data bytenr %llu refs %u\n",
  90. (unsigned long long)btrfs_disk_root_bytenr(l, ri),
  91. btrfs_disk_root_refs(l, ri));
  92. break;
  93. case BTRFS_EXTENT_ITEM_KEY:
  94. ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
  95. printk("\t\textent data refs %u\n",
  96. btrfs_extent_refs(l, ei));
  97. break;
  98. case BTRFS_EXTENT_REF_KEY:
  99. ref = btrfs_item_ptr(l, i, struct btrfs_extent_ref);
  100. printk("\t\textent back ref root %llu gen %llu "
  101. "owner %llu offset %llu\n",
  102. (unsigned long long)btrfs_ref_root(l, ref),
  103. (unsigned long long)btrfs_ref_generation(l, ref),
  104. (unsigned long long)btrfs_ref_objectid(l, ref),
  105. (unsigned long long)btrfs_ref_offset(l, ref));
  106. break;
  107. case BTRFS_EXTENT_DATA_KEY:
  108. fi = btrfs_item_ptr(l, i,
  109. struct btrfs_file_extent_item);
  110. if (btrfs_file_extent_type(l, fi) ==
  111. BTRFS_FILE_EXTENT_INLINE) {
  112. printk("\t\tinline extent data size %u\n",
  113. btrfs_file_extent_inline_len(l, item));
  114. break;
  115. }
  116. printk("\t\textent data disk bytenr %llu nr %llu\n",
  117. (unsigned long long)btrfs_file_extent_disk_bytenr(l, fi),
  118. (unsigned long long)btrfs_file_extent_disk_num_bytes(l, fi));
  119. printk("\t\textent data offset %llu nr %llu\n",
  120. (unsigned long long)btrfs_file_extent_offset(l, fi),
  121. (unsigned long long)btrfs_file_extent_num_bytes(l, fi));
  122. break;
  123. case BTRFS_BLOCK_GROUP_ITEM_KEY:
  124. bi = btrfs_item_ptr(l, i,
  125. struct btrfs_block_group_item);
  126. printk("\t\tblock group used %llu\n",
  127. (unsigned long long)btrfs_disk_block_group_used(l, bi));
  128. break;
  129. case BTRFS_CHUNK_ITEM_KEY:
  130. print_chunk(l, btrfs_item_ptr(l, i, struct btrfs_chunk));
  131. break;
  132. case BTRFS_DEV_ITEM_KEY:
  133. print_dev_item(l, btrfs_item_ptr(l, i,
  134. struct btrfs_dev_item));
  135. break;
  136. case BTRFS_DEV_EXTENT_KEY:
  137. dev_extent = btrfs_item_ptr(l, i,
  138. struct btrfs_dev_extent);
  139. printk("\t\tdev extent owner %llu length %llu\n",
  140. (unsigned long long)btrfs_dev_extent_owner(l, dev_extent),
  141. (unsigned long long)btrfs_dev_extent_length(l, dev_extent));
  142. };
  143. }
  144. }
  145. void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *c)
  146. {
  147. int i;
  148. u32 nr;
  149. struct btrfs_key key;
  150. int level;
  151. if (!c)
  152. return;
  153. nr = btrfs_header_nritems(c);
  154. level = btrfs_header_level(c);
  155. if (level == 0) {
  156. btrfs_print_leaf(root, c);
  157. return;
  158. }
  159. printk("node %llu level %d total ptrs %d free spc %u\n",
  160. (unsigned long long)btrfs_header_bytenr(c),
  161. btrfs_header_level(c), nr,
  162. (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
  163. for (i = 0; i < nr; i++) {
  164. btrfs_node_key_to_cpu(c, &key, i);
  165. printk("\tkey %d (%llu %u %llu) block %llu\n",
  166. i,
  167. (unsigned long long)key.objectid,
  168. key.type,
  169. (unsigned long long)key.offset,
  170. (unsigned long long)btrfs_node_blockptr(c, i));
  171. }
  172. for (i = 0; i < nr; i++) {
  173. struct extent_buffer *next = read_tree_block(root,
  174. btrfs_node_blockptr(c, i),
  175. btrfs_level_size(root, level - 1));
  176. if (btrfs_is_leaf(next) &&
  177. btrfs_header_level(c) != 1)
  178. BUG();
  179. if (btrfs_header_level(next) !=
  180. btrfs_header_level(c) - 1)
  181. BUG();
  182. btrfs_print_tree(root, next);
  183. free_extent_buffer(next);
  184. }
  185. }