Remove extent back refs in batches, and avoid duplicate searches
[btrfs-progs-unstable.git] / print-tree.c
blobdb4633954cb9d5f80cd904e08a02c2ad49306457
1 /*
2 * Copyright (C) 2007 Oracle. All rights reserved.
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.
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.
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.
19 #include <stdio.h>
20 #include <stdlib.h>
21 #include "kerncompat.h"
22 #include "radix-tree.h"
23 #include "ctree.h"
24 #include "disk-io.h"
26 static int print_dir_item(struct extent_buffer *eb, struct btrfs_item *item,
27 struct btrfs_dir_item *di)
29 u32 total;
30 u32 cur = 0;
31 u32 len;
32 u32 name_len;
33 u32 data_len;
34 char namebuf[BTRFS_NAME_LEN];
35 struct btrfs_disk_key location;
37 total = btrfs_item_size(eb, item);
38 while(cur < total) {
39 btrfs_dir_item_key(eb, di, &location);
40 printf("\t\tdir index %llu type %u\n",
41 (unsigned long long)btrfs_disk_key_objectid(&location),
42 btrfs_dir_type(eb, di));
43 name_len = btrfs_dir_name_len(eb, di);
44 data_len = btrfs_dir_data_len(eb, di);
45 len = (name_len <= sizeof(namebuf))? name_len: sizeof(namebuf);
46 read_extent_buffer(eb, namebuf, (unsigned long)(di + 1), len);
47 printf("\t\tnamelen %u datalen %u name: %.*s\n",
48 name_len, data_len, len, namebuf);
49 len = sizeof(*di) + name_len + data_len;
50 di = (struct btrfs_dir_item *)((char *)di + len);
51 cur += len;
53 return 0;
56 static int print_inode_ref_item(struct extent_buffer *eb, struct btrfs_item *item,
57 struct btrfs_inode_ref *ref)
59 u32 total;
60 u32 cur = 0;
61 u32 len;
62 u32 name_len;
63 char namebuf[BTRFS_NAME_LEN];
64 total = btrfs_item_size(eb, item);
65 while(cur < total) {
66 name_len = btrfs_inode_ref_name_len(eb, ref);
67 len = (name_len <= sizeof(namebuf))? name_len: sizeof(namebuf);
68 read_extent_buffer(eb, namebuf, (unsigned long)(ref + 1), len);
69 printf("\t\tinode ref namelen %u name: %.*s\n",
70 name_len, len, namebuf);
71 len = sizeof(*ref) + name_len;
72 ref = (struct btrfs_inode_ref *)((char *)ref + len);
73 cur += len;
75 return 0;
78 void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
80 int i;
81 char *str;
82 struct btrfs_item *item;
83 struct btrfs_extent_item *ei;
84 struct btrfs_root_item *ri;
85 struct btrfs_dir_item *di;
86 struct btrfs_inode_item *ii;
87 struct btrfs_file_extent_item *fi;
88 struct btrfs_csum_item *ci;
89 struct btrfs_block_group_item *bi;
90 struct btrfs_extent_ref *ref;
91 struct btrfs_inode_ref *iref;
92 struct btrfs_disk_key disk_key;
93 struct btrfs_root_item root_item;
94 struct btrfs_block_group_item bg_item;
95 u32 nr = btrfs_header_nritems(l);
96 u32 type;
98 printf("leaf %llu ptrs %d free space %d generation %llu owner %llu\n",
99 (unsigned long long)btrfs_header_bytenr(l), nr,
100 btrfs_leaf_free_space(root, l),
101 (unsigned long long)btrfs_header_generation(l),
102 (unsigned long long)btrfs_header_owner(l));
103 fflush(stdout);
104 for (i = 0 ; i < nr ; i++) {
105 item = btrfs_item_nr(l, i);
106 btrfs_item_key(l, &disk_key, i);
107 type = btrfs_disk_key_type(&disk_key);
108 printf("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
110 (unsigned long long)btrfs_disk_key_objectid(&disk_key),
111 btrfs_disk_key_type(&disk_key),
112 (unsigned long long)btrfs_disk_key_offset(&disk_key),
113 btrfs_item_offset(l, item),
114 btrfs_item_size(l, item));
115 switch (type) {
116 case BTRFS_INODE_ITEM_KEY:
117 ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
118 printf("\t\tinode generation %llu size %llu block group %llu mode %o links %u\n",
119 (unsigned long long)btrfs_inode_generation(l, ii),
120 (unsigned long long)btrfs_inode_size(l, ii),
121 (unsigned long long)btrfs_inode_block_group(l,ii),
122 btrfs_inode_mode(l, ii),
123 btrfs_inode_nlink(l, ii));
124 break;
125 case BTRFS_INODE_REF_KEY:
126 iref = btrfs_item_ptr(l, i, struct btrfs_inode_ref);
127 print_inode_ref_item(l, item, iref);
128 break;
129 case BTRFS_DIR_ITEM_KEY:
130 case BTRFS_DIR_INDEX_KEY:
131 case BTRFS_XATTR_ITEM_KEY:
132 di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
133 print_dir_item(l, item, di);
134 break;
135 case BTRFS_ROOT_ITEM_KEY:
136 ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
137 read_extent_buffer(l, &root_item, (unsigned long)ri, sizeof(root_item));
138 printf("\t\troot data bytenr %llu level %d dirid %llu refs %u\n",
139 (unsigned long long)btrfs_root_bytenr(&root_item),
140 btrfs_root_level(&root_item),
141 (unsigned long long)btrfs_root_dirid(&root_item),
142 btrfs_root_refs(&root_item));
143 if (1 || btrfs_root_refs(&root_item) == 0) {
144 struct btrfs_key drop_key;
145 btrfs_disk_key_to_cpu(&drop_key,
146 &root_item.drop_progress);
147 printf("\t\tdrop key %Lu %x %Lu level %d\n",
148 (unsigned long long)drop_key.objectid,
149 drop_key.type,
150 (unsigned long long)drop_key.offset,
151 root_item.drop_level);
153 break;
154 case BTRFS_EXTENT_ITEM_KEY:
155 ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
156 printf("\t\textent data refs %u\n",
157 btrfs_extent_refs(l, ei));
158 break;
159 case BTRFS_EXTENT_REF_KEY:
160 ref = btrfs_item_ptr(l, i, struct btrfs_extent_ref);
161 printf("\t\textent back ref root %llu gen %llu "
162 "owner %llu offset %llu\n",
163 (unsigned long long)btrfs_ref_root(l, ref),
164 (unsigned long long)btrfs_ref_generation(l, ref),
165 (unsigned long long)btrfs_ref_objectid(l, ref),
166 (unsigned long long)btrfs_ref_offset(l, ref));
167 break;
168 case BTRFS_CSUM_ITEM_KEY:
169 ci = btrfs_item_ptr(l, i, struct btrfs_csum_item);
170 printf("\t\tcsum item\n");
171 break;
172 case BTRFS_EXTENT_DATA_KEY:
173 fi = btrfs_item_ptr(l, i,
174 struct btrfs_file_extent_item);
175 if (btrfs_file_extent_type(l, fi) ==
176 BTRFS_FILE_EXTENT_INLINE) {
177 printf("\t\tinline extent data size %u\n",
178 btrfs_file_extent_inline_len(l, item));
179 break;
181 printf("\t\textent data disk byte %llu nr %llu\n",
182 (unsigned long long)btrfs_file_extent_disk_bytenr(l, fi),
183 (unsigned long long)btrfs_file_extent_disk_num_bytes(l, fi));
184 printf("\t\textent data offset %llu nr %llu\n",
185 (unsigned long long)btrfs_file_extent_offset(l, fi),
186 (unsigned long long)btrfs_file_extent_num_bytes(l, fi));
187 break;
188 case BTRFS_BLOCK_GROUP_ITEM_KEY:
189 bi = btrfs_item_ptr(l, i,
190 struct btrfs_block_group_item);
191 read_extent_buffer(l, &bg_item, (unsigned long)bi,
192 sizeof(bg_item));
193 printf("\t\tblock group used %llu flags %x\n",
194 (unsigned long long)btrfs_block_group_used(&bg_item),
195 bg_item.flags);
196 break;
197 case BTRFS_STRING_ITEM_KEY:
198 /* dirty, but it's simple */
199 str = l->data + btrfs_item_ptr_offset(l, i);
200 printf("\t\titem data %.*s\n", btrfs_item_size(l, item), str);
201 break;
203 fflush(stdout);
206 void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *eb)
208 int i;
209 u32 nr;
210 u32 size;
211 struct btrfs_key key;
213 if (!eb)
214 return;
215 nr = btrfs_header_nritems(eb);
216 if (btrfs_is_leaf(eb)) {
217 btrfs_print_leaf(root, eb);
218 return;
220 printf("node %llu level %d ptrs %d free %u generation %llu owner %llu\n",
221 (unsigned long long)eb->start,
222 btrfs_header_level(eb), nr,
223 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
224 (unsigned long long)btrfs_header_generation(eb),
225 (unsigned long long)btrfs_header_owner(eb));
226 fflush(stdout);
227 size = btrfs_level_size(root, btrfs_header_level(eb) - 1);
228 for (i = 0; i < nr; i++) {
229 u64 blocknr = btrfs_node_blockptr(eb, i);
230 btrfs_node_key_to_cpu(eb, &key, i);
231 printf("\tkey %d (%llu %x %llu) block %llu (%llu) gen %llu\n",
233 (unsigned long long)key.objectid,
234 key.type,
235 (unsigned long long)key.offset,
236 (unsigned long long)blocknr,
237 (unsigned long long)blocknr / size,
238 (unsigned long long)btrfs_node_ptr_generation(eb, i));
239 fflush(stdout);
241 for (i = 0; i < nr; i++) {
242 struct extent_buffer *next = read_tree_block(root,
243 btrfs_node_blockptr(eb, i),
244 size);
245 if (btrfs_is_leaf(next) &&
246 btrfs_header_level(eb) != 1)
247 BUG();
248 if (btrfs_header_level(next) !=
249 btrfs_header_level(eb) - 1)
250 BUG();
251 btrfs_print_tree(root, next);
252 free_extent_buffer(next);