print-tree.c 6.7 KB

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