Btrfs: Do delalloc accounting via hooks in the extent_state code
[deliverable/linux.git] / fs / btrfs / print-tree.c
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
19 #include "ctree.h"
20 #include "disk-io.h"
21 #include "print-tree.h"
22
23 void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
24 {
25 int i;
26 u32 nr = btrfs_header_nritems(l);
27 struct btrfs_item *item;
28 struct btrfs_extent_item *ei;
29 struct btrfs_root_item *ri;
30 struct btrfs_dir_item *di;
31 struct btrfs_inode_item *ii;
32 struct btrfs_block_group_item *bi;
33 struct btrfs_file_extent_item *fi;
34 struct btrfs_key key;
35 struct btrfs_key found_key;
36 struct btrfs_extent_ref *ref;
37 u32 type;
38
39 printk("leaf %llu total ptrs %d free space %d\n",
40 (unsigned long long)btrfs_header_bytenr(l), nr,
41 btrfs_leaf_free_space(root, l));
42 for (i = 0 ; i < nr ; i++) {
43 item = btrfs_item_nr(l, i);
44 btrfs_item_key_to_cpu(l, &key, i);
45 type = btrfs_key_type(&key);
46 printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
47 i,
48 (unsigned long long)key.objectid, type,
49 (unsigned long long)key.offset,
50 btrfs_item_offset(l, item), btrfs_item_size(l, item));
51 switch (type) {
52 case BTRFS_INODE_ITEM_KEY:
53 ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
54 printk("\t\tinode generation %llu size %llu mode %o\n",
55 (unsigned long long)btrfs_inode_generation(l, ii),
56 (unsigned long long)btrfs_inode_size(l, ii),
57 btrfs_inode_mode(l, ii));
58 break;
59 case BTRFS_DIR_ITEM_KEY:
60 di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
61 btrfs_dir_item_key_to_cpu(l, di, &found_key);
62 printk("\t\tdir oid %llu type %u\n",
63 (unsigned long long)found_key.objectid,
64 btrfs_dir_type(l, di));
65 break;
66 case BTRFS_ROOT_ITEM_KEY:
67 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
68 printk("\t\troot data bytenr %llu refs %u\n",
69 (unsigned long long)btrfs_disk_root_bytenr(l, ri),
70 btrfs_disk_root_refs(l, ri));
71 break;
72 case BTRFS_EXTENT_ITEM_KEY:
73 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
74 printk("\t\textent data refs %u\n",
75 btrfs_extent_refs(l, ei));
76 break;
77 case BTRFS_EXTENT_REF_KEY:
78 ref = btrfs_item_ptr(l, i, struct btrfs_extent_ref);
79 printk("\t\textent back ref root %llu gen %llu "
80 "owner %llu offset %llu\n",
81 (unsigned long long)btrfs_ref_root(l, ref),
82 (unsigned long long)btrfs_ref_generation(l, ref),
83 (unsigned long long)btrfs_ref_objectid(l, ref),
84 (unsigned long long)btrfs_ref_offset(l, ref));
85 break;
86
87 case BTRFS_EXTENT_DATA_KEY:
88 fi = btrfs_item_ptr(l, i,
89 struct btrfs_file_extent_item);
90 if (btrfs_file_extent_type(l, fi) ==
91 BTRFS_FILE_EXTENT_INLINE) {
92 printk("\t\tinline extent data size %u\n",
93 btrfs_file_extent_inline_len(l, item));
94 break;
95 }
96 printk("\t\textent data disk bytenr %llu nr %llu\n",
97 (unsigned long long)btrfs_file_extent_disk_bytenr(l, fi),
98 (unsigned long long)btrfs_file_extent_disk_num_bytes(l, fi));
99 printk("\t\textent data offset %llu nr %llu\n",
100 (unsigned long long)btrfs_file_extent_offset(l, fi),
101 (unsigned long long)btrfs_file_extent_num_bytes(l, fi));
102 break;
103 case BTRFS_BLOCK_GROUP_ITEM_KEY:
104 bi = btrfs_item_ptr(l, i,
105 struct btrfs_block_group_item);
106 printk("\t\tblock group used %llu\n",
107 (unsigned long long)btrfs_disk_block_group_used(l, bi));
108 break;
109 };
110 }
111 }
112
113 void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *c)
114 {
115 int i;
116 u32 nr;
117 struct btrfs_key key;
118 int level;
119
120 if (!c)
121 return;
122 nr = btrfs_header_nritems(c);
123 level = btrfs_header_level(c);
124 if (level == 0) {
125 btrfs_print_leaf(root, c);
126 return;
127 }
128 printk("node %llu level %d total ptrs %d free spc %u\n",
129 (unsigned long long)btrfs_header_bytenr(c),
130 btrfs_header_level(c), nr,
131 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
132 for (i = 0; i < nr; i++) {
133 btrfs_node_key_to_cpu(c, &key, i);
134 printk("\tkey %d (%llu %u %llu) block %llu\n",
135 i,
136 (unsigned long long)key.objectid,
137 key.type,
138 (unsigned long long)key.offset,
139 (unsigned long long)btrfs_node_blockptr(c, i));
140 }
141 for (i = 0; i < nr; i++) {
142 struct extent_buffer *next = read_tree_block(root,
143 btrfs_node_blockptr(c, i),
144 btrfs_level_size(root, level - 1));
145 if (btrfs_is_leaf(next) &&
146 btrfs_header_level(c) != 1)
147 BUG();
148 if (btrfs_header_level(next) !=
149 btrfs_header_level(c) - 1)
150 BUG();
151 btrfs_print_tree(root, next);
152 free_extent_buffer(next);
153 }
154 }
155
This page took 0.035624 seconds and 5 git commands to generate.