Commit | Line | Data |
---|---|---|
6cbd5570 CM |
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 | ||
2e635a27 | 19 | #include <linux/module.h> |
5de08d7d CM |
20 | #include "ctree.h" |
21 | #include "disk-io.h" | |
35b7e476 | 22 | #include "print-tree.h" |
5de08d7d | 23 | |
123abc88 | 24 | void btrfs_print_leaf(struct btrfs_root *root, struct btrfs_leaf *l) |
5de08d7d CM |
25 | { |
26 | int i; | |
7518a238 | 27 | u32 nr = btrfs_header_nritems(&l->header); |
0783fcfc | 28 | struct btrfs_item *item; |
234b63a0 | 29 | struct btrfs_extent_item *ei; |
3768f368 | 30 | struct btrfs_root_item *ri; |
1d4f6404 | 31 | struct btrfs_dir_item *di; |
293ffd5f | 32 | struct btrfs_inode_item *ii; |
9078a3e1 | 33 | struct btrfs_block_group_item *bi; |
62e2749e | 34 | u32 type; |
1d4f6404 | 35 | |
5af3981c CM |
36 | printk("leaf %llu total ptrs %d free space %d\n", |
37 | (unsigned long long)btrfs_header_blocknr(&l->header), nr, | |
123abc88 | 38 | btrfs_leaf_free_space(root, l)); |
5de08d7d CM |
39 | for (i = 0 ; i < nr ; i++) { |
40 | item = l->items + i; | |
62e2749e | 41 | type = btrfs_disk_key_type(&item->key); |
5af3981c | 42 | printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n", |
5de08d7d | 43 | i, |
5af3981c | 44 | (unsigned long long)btrfs_disk_key_objectid(&item->key), |
62e2749e | 45 | btrfs_disk_key_flags(&item->key), |
5af3981c | 46 | (unsigned long long)btrfs_disk_key_offset(&item->key), |
0783fcfc CM |
47 | btrfs_item_offset(item), |
48 | btrfs_item_size(item)); | |
62e2749e CM |
49 | switch (type) { |
50 | case BTRFS_INODE_ITEM_KEY: | |
293ffd5f | 51 | ii = btrfs_item_ptr(l, i, struct btrfs_inode_item); |
5af3981c CM |
52 | printk("\t\tinode generation %llu size %llu mode %o\n", |
53 | (unsigned long long)btrfs_inode_generation(ii), | |
54 | (unsigned long long)btrfs_inode_size(ii), | |
2e635a27 | 55 | btrfs_inode_mode(ii)); |
62e2749e CM |
56 | break; |
57 | case BTRFS_DIR_ITEM_KEY: | |
1d4f6404 | 58 | di = btrfs_item_ptr(l, i, struct btrfs_dir_item); |
5af3981c CM |
59 | printk("\t\tdir oid %llu flags %u type %u\n", |
60 | (unsigned long long)btrfs_disk_key_objectid( | |
61 | &di->location), | |
1d4f6404 CM |
62 | btrfs_dir_flags(di), |
63 | btrfs_dir_type(di)); | |
2e635a27 | 64 | printk("\t\tname %.*s\n", |
9f5fae2f | 65 | btrfs_dir_name_len(di),(char *)(di + 1)); |
62e2749e CM |
66 | break; |
67 | case BTRFS_ROOT_ITEM_KEY: | |
68 | ri = btrfs_item_ptr(l, i, struct btrfs_root_item); | |
5af3981c CM |
69 | printk("\t\troot data blocknr %llu refs %u\n", |
70 | (unsigned long long)btrfs_root_blocknr(ri), | |
71 | btrfs_root_refs(ri)); | |
62e2749e CM |
72 | break; |
73 | case BTRFS_EXTENT_ITEM_KEY: | |
74 | ei = btrfs_item_ptr(l, i, struct btrfs_extent_item); | |
d0dbc624 CM |
75 | printk("\t\textent data refs %u\n", |
76 | btrfs_extent_refs(ei)); | |
62e2749e | 77 | break; |
9078a3e1 CM |
78 | case BTRFS_BLOCK_GROUP_ITEM_KEY: |
79 | bi = btrfs_item_ptr(l, i, | |
80 | struct btrfs_block_group_item); | |
5af3981c CM |
81 | printk("\t\tblock group used %llu\n", |
82 | (unsigned long long)btrfs_block_group_used(bi)); | |
9078a3e1 | 83 | break; |
62e2749e | 84 | case BTRFS_STRING_ITEM_KEY: |
2e635a27 | 85 | printk("\t\titem data %.*s\n", btrfs_item_size(item), |
62e2749e CM |
86 | btrfs_leaf_data(l) + btrfs_item_offset(item)); |
87 | break; | |
88 | }; | |
5de08d7d CM |
89 | } |
90 | } | |
e20d96d6 CM |
91 | |
92 | void btrfs_print_tree(struct btrfs_root *root, struct buffer_head *t) | |
5de08d7d CM |
93 | { |
94 | int i; | |
7518a238 | 95 | u32 nr; |
234b63a0 | 96 | struct btrfs_node *c; |
5de08d7d CM |
97 | |
98 | if (!t) | |
99 | return; | |
e20d96d6 | 100 | c = btrfs_buffer_node(t); |
7518a238 CM |
101 | nr = btrfs_header_nritems(&c->header); |
102 | if (btrfs_is_leaf(c)) { | |
123abc88 | 103 | btrfs_print_leaf(root, (struct btrfs_leaf *)c); |
5de08d7d CM |
104 | return; |
105 | } | |
5af3981c CM |
106 | printk("node %llu level %d total ptrs %d free spc %u\n", |
107 | (unsigned long long)btrfs_header_blocknr(&c->header), | |
e20d96d6 CM |
108 | btrfs_header_level(&c->header), nr, |
109 | (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr); | |
5de08d7d | 110 | for (i = 0; i < nr; i++) { |
5af3981c | 111 | printk("\tkey %d (%llu %u %llu) block %llu\n", |
5de08d7d | 112 | i, |
5af3981c | 113 | (unsigned long long)c->ptrs[i].key.objectid, |
a1516c89 | 114 | c->ptrs[i].key.flags, |
5af3981c CM |
115 | (unsigned long long)c->ptrs[i].key.offset, |
116 | (unsigned long long)btrfs_node_blockptr(c, i)); | |
5de08d7d CM |
117 | } |
118 | for (i = 0; i < nr; i++) { | |
e20d96d6 | 119 | struct buffer_head *next_buf = read_tree_block(root, |
1d4f8a0c | 120 | btrfs_node_blockptr(c, i)); |
e20d96d6 | 121 | struct btrfs_node *next = btrfs_buffer_node(next_buf); |
7518a238 CM |
122 | if (btrfs_is_leaf(next) && |
123 | btrfs_header_level(&c->header) != 1) | |
5de08d7d | 124 | BUG(); |
7518a238 CM |
125 | if (btrfs_header_level(&next->header) != |
126 | btrfs_header_level(&c->header) - 1) | |
5de08d7d | 127 | BUG(); |
234b63a0 CM |
128 | btrfs_print_tree(root, next_buf); |
129 | btrfs_block_release(root, next_buf); | |
5de08d7d | 130 | } |
5de08d7d CM |
131 | } |
132 |