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