]> Pileus Git - ~andy/linux/blob - fs/btrfs/print-tree.c
Btrfs: Create extent_buffer interface for large blocksizes
[~andy/linux] / 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         u32 type;
37
38         printk("leaf %llu total ptrs %d free space %d\n",
39                 (unsigned long long)btrfs_header_blocknr(l), nr,
40                 btrfs_leaf_free_space(root, l));
41         for (i = 0 ; i < nr ; i++) {
42                 item = btrfs_item_nr(l, i);
43                 btrfs_item_key_to_cpu(l, &key, i);
44                 type = btrfs_key_type(&key);
45                 printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n",
46                         i,
47                         (unsigned long long)key.objectid, type,
48                         (unsigned long long)key.offset,
49                         btrfs_item_offset(l, item), btrfs_item_size(l, item));
50                 switch (type) {
51                 case BTRFS_INODE_ITEM_KEY:
52                         ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
53                         printk("\t\tinode generation %llu size %llu mode %o\n",
54                               (unsigned long long)btrfs_inode_generation(l, ii),
55                               (unsigned long long)btrfs_inode_size(l, ii),
56                                btrfs_inode_mode(l, ii));
57                         break;
58                 case BTRFS_DIR_ITEM_KEY:
59                         di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
60                         btrfs_dir_item_key_to_cpu(l, di, &found_key);
61                         printk("\t\tdir oid %llu flags %u type %u\n",
62                                 (unsigned long long)found_key.objectid,
63                                 btrfs_dir_flags(l, di),
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 blocknr %llu refs %u\n",
69                                 (unsigned long long)btrfs_disk_root_blocknr(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
78                 case BTRFS_EXTENT_DATA_KEY:
79                         fi = btrfs_item_ptr(l, i,
80                                             struct btrfs_file_extent_item);
81                         if (btrfs_file_extent_type(l, fi) ==
82                             BTRFS_FILE_EXTENT_INLINE) {
83                                 printk("\t\tinline extent data size %u\n",
84                                    btrfs_file_extent_inline_len(l, item));
85                                 break;
86                         }
87                         printk("\t\textent data disk block %llu nr %llu\n",
88                                (unsigned long long)btrfs_file_extent_disk_blocknr(l, fi),
89                                (unsigned long long)btrfs_file_extent_disk_num_blocks(l, fi));
90                         printk("\t\textent data offset %llu nr %llu\n",
91                           (unsigned long long)btrfs_file_extent_offset(l, fi),
92                           (unsigned long long)btrfs_file_extent_num_blocks(l, fi));
93                         break;
94                 case BTRFS_BLOCK_GROUP_ITEM_KEY:
95                         bi = btrfs_item_ptr(l, i,
96                                             struct btrfs_block_group_item);
97                         printk("\t\tblock group used %llu\n",
98                                (unsigned long long)btrfs_disk_block_group_used(l, bi));
99                         break;
100                 };
101         }
102 }
103
104 void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *c)
105 {
106         int i;
107         u32 nr;
108         struct btrfs_key key;
109
110         if (!c)
111                 return;
112         nr = btrfs_header_nritems(c);
113         if (btrfs_is_leaf(c)) {
114                 btrfs_print_leaf(root, c);
115                 return;
116         }
117         printk("node %llu level %d total ptrs %d free spc %u\n",
118                (unsigned long long)btrfs_header_blocknr(c),
119                btrfs_header_level(c), nr,
120                (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr);
121         for (i = 0; i < nr; i++) {
122                 btrfs_node_key_to_cpu(c, &key, i);
123                 printk("\tkey %d (%llu %u %llu) block %llu\n",
124                        i,
125                        (unsigned long long)key.objectid,
126                        key.type,
127                        (unsigned long long)key.offset,
128                        (unsigned long long)btrfs_node_blockptr(c, i));
129         }
130         for (i = 0; i < nr; i++) {
131                 struct extent_buffer *next = read_tree_block(root,
132                                                 btrfs_node_blockptr(c, i));
133                 if (btrfs_is_leaf(next) &&
134                     btrfs_header_level(c) != 1)
135                         BUG();
136                 if (btrfs_header_level(next) !=
137                         btrfs_header_level(c) - 1)
138                         BUG();
139                 btrfs_print_tree(root, next);
140                 free_extent_buffer(next);
141         }
142 }
143