Switch to byte granular allocations
[platform/upstream/btrfs-progs.git] / 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 <stdio.h>
20 #include <stdlib.h>
21 #include "kerncompat.h"
22 #include "radix-tree.h"
23 #include "ctree.h"
24 #include "disk-io.h"
25
26 static int print_dir_item(struct btrfs_item *item,
27                           struct btrfs_dir_item *di)
28 {
29         u32 total;
30         u32 cur = 0;
31         u32 len;
32         total = btrfs_item_size(item);
33         while(cur < total) {
34                 printf("\t\tdir index %llu flags %u type %u\n",
35                      (unsigned long long)btrfs_disk_key_objectid(&di->location),
36                      btrfs_dir_flags(di),
37                      btrfs_dir_type(di));
38                 printf("\t\tname %.*s\n",
39                        btrfs_dir_name_len(di),(char *)(di + 1));
40                 len = sizeof(*di) + btrfs_dir_name_len(di);
41                 di = (struct btrfs_dir_item *)((char *)di + len);
42                 cur += len;
43         }
44         return 0;
45 }
46 void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l)
47 {
48         int i;
49         u32 nr = btrfs_header_nritems(&l->header);
50         struct btrfs_item *item;
51         struct btrfs_extent_item *ei;
52         struct btrfs_root_item *ri;
53         struct btrfs_dir_item *di;
54         struct btrfs_inode_item *ii;
55         struct btrfs_file_extent_item *fi;
56         struct btrfs_csum_item *ci;
57         struct btrfs_block_group_item *bi;
58         u32 type;
59
60         printf("leaf %llu ptrs %d free space %d generation %llu owner %llu\n",
61                 (unsigned long long)btrfs_header_bytenr(&l->header), nr,
62                 btrfs_leaf_free_space(root, l),
63                 (unsigned long long)btrfs_header_generation(&l->header),
64                 (unsigned long long)btrfs_header_owner(&l->header));
65         fflush(stdout);
66         for (i = 0 ; i < nr ; i++) {
67                 item = l->items + i;
68                 type = btrfs_disk_key_type(&item->key);
69                 printf("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
70                         i,
71                         (unsigned long long)btrfs_disk_key_objectid(&item->key),
72                         btrfs_disk_key_type(&item->key),
73                         (unsigned long long)btrfs_disk_key_offset(&item->key),
74                         btrfs_item_offset(item),
75                         btrfs_item_size(item));
76                 switch (type) {
77                 case BTRFS_INODE_ITEM_KEY:
78                         ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
79                         printf("\t\tinode generation %llu size %llu block group %llu mode %o links %u\n",
80                                (unsigned long long)btrfs_inode_generation(ii),
81                                (unsigned long long)btrfs_inode_size(ii),
82                                (unsigned long long)btrfs_inode_block_group(ii),
83                                btrfs_inode_mode(ii),
84                                btrfs_inode_nlink(ii));
85                         break;
86                 case BTRFS_DIR_ITEM_KEY:
87                         di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
88                         print_dir_item(l->items + i, di);
89                         break;
90                 case BTRFS_DIR_INDEX_KEY:
91                         di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
92                         print_dir_item(l->items + i, di);
93                         break;
94                 case BTRFS_ROOT_ITEM_KEY:
95                         ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
96                         printf("\t\troot data bytenr %llu level %d dirid %llu refs %u\n",
97                                 (unsigned long long)btrfs_root_bytenr(ri),
98                                 ri->level,
99                                 (unsigned long long)btrfs_root_dirid(ri),
100                                 btrfs_root_refs(ri));
101                         if (1 || btrfs_root_refs(ri) == 0) {
102                                 struct btrfs_key drop_key;
103                                 btrfs_disk_key_to_cpu(&drop_key,
104                                                       &ri->drop_progress);
105                                 printf("\t\tdrop key %Lu %x %Lu level %d\n",
106                                        (unsigned long long)drop_key.objectid,
107                                        drop_key.type,
108                                        (unsigned long long)drop_key.offset,
109                                        ri->drop_level);
110                         }
111                         break;
112                 case BTRFS_EXTENT_ITEM_KEY:
113                         ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
114                         printf("\t\textent data refs %u owner %llu\n",
115                                 btrfs_extent_refs(ei),
116                                 (unsigned long long)btrfs_extent_owner(ei));
117                         break;
118                 case BTRFS_CSUM_ITEM_KEY:
119                         ci = btrfs_item_ptr(l, i,
120                                             struct btrfs_csum_item);
121                         printf("\t\tcsum item\n");
122                         break;
123                 case BTRFS_EXTENT_DATA_KEY:
124                         fi = btrfs_item_ptr(l, i,
125                                             struct btrfs_file_extent_item);
126                         if (btrfs_file_extent_type(fi) ==
127                             BTRFS_FILE_EXTENT_INLINE) {
128                                 printf("\t\tinline extent data size %u\n",
129                                    btrfs_file_extent_inline_len(l->items + i));
130                                 break;
131                         }
132                         printf("\t\textent data disk byte %llu nr %llu\n",
133                                (unsigned long long)btrfs_file_extent_disk_bytenr(fi),
134                                (unsigned long long)btrfs_file_extent_disk_num_bytes(fi));
135                         printf("\t\textent data offset %llu nr %llu\n",
136                           (unsigned long long)btrfs_file_extent_offset(fi),
137                           (unsigned long long)btrfs_file_extent_num_bytes(fi));
138                         break;
139                 case BTRFS_BLOCK_GROUP_ITEM_KEY:
140                         bi = btrfs_item_ptr(l, i,
141                                             struct btrfs_block_group_item);
142                         printf("\t\tblock group used %llu flags %x\n",
143                                (unsigned long long)btrfs_block_group_used(bi),
144                                bi->flags);
145                         break;
146                 case BTRFS_STRING_ITEM_KEY:
147                         printf("\t\titem data %.*s\n", btrfs_item_size(item),
148                                 btrfs_leaf_data(l) + btrfs_item_offset(item));
149                         break;
150                 };
151                 fflush(stdout);
152         }
153 }
154 void btrfs_print_tree(struct btrfs_root *root, struct btrfs_buffer *t)
155 {
156         int i;
157         u32 nr;
158         struct btrfs_node *c;
159         u32 size;
160
161         if (!t)
162                 return;
163         c = &t->node;
164         nr = btrfs_header_nritems(&c->header);
165         if (btrfs_is_leaf(c)) {
166                 btrfs_print_leaf(root, (struct btrfs_leaf *)c);
167                 return;
168         }
169         printf("node %llu level %d ptrs %d free %u generation %llu owner %llu\n",
170                (unsigned long long)t->bytenr,
171                 btrfs_header_level(&c->header), nr,
172                 (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
173                 (unsigned long long)btrfs_header_generation(&c->header),
174                 (unsigned long long)btrfs_header_owner(&c->header));
175         fflush(stdout);
176         size = btrfs_level_size(root, btrfs_header_level(&c->header) - 1);
177         for (i = 0; i < nr; i++) {
178                 u64 blocknr = btrfs_node_blockptr(c, i);
179                 printf("\tkey %d (%llu %x %llu) block %llu (%llu)\n",
180                        i,
181                        (unsigned long long)c->ptrs[i].key.objectid,
182                        c->ptrs[i].key.type,
183                        (unsigned long long)c->ptrs[i].key.offset,
184                        (unsigned long long)blocknr,
185                        (unsigned long long)blocknr / size);
186                 fflush(stdout);
187         }
188         for (i = 0; i < nr; i++) {
189                 struct btrfs_buffer *next_buf = read_tree_block(root,
190                                                 btrfs_node_blockptr(c, i),
191                                                 size);
192                 struct btrfs_node *next = &next_buf->node;
193                 if (btrfs_is_leaf(next) &&
194                     btrfs_header_level(&c->header) != 1)
195                         BUG();
196                 if (btrfs_header_level(&next->header) !=
197                         btrfs_header_level(&c->header) - 1)
198                         BUG();
199                 btrfs_print_tree(root, next_buf);
200                 btrfs_block_release(root, next_buf);
201         }
202 }
203