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 | ||
5de08d7d CM |
19 | #include "ctree.h" |
20 | #include "disk-io.h" | |
35b7e476 | 21 | #include "print-tree.h" |
5de08d7d | 22 | |
5f39d397 | 23 | void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l) |
5de08d7d CM |
24 | { |
25 | int i; | |
5f39d397 | 26 | u32 nr = btrfs_header_nritems(l); |
0783fcfc | 27 | struct btrfs_item *item; |
234b63a0 | 28 | struct btrfs_extent_item *ei; |
3768f368 | 29 | struct btrfs_root_item *ri; |
1d4f6404 | 30 | struct btrfs_dir_item *di; |
293ffd5f | 31 | struct btrfs_inode_item *ii; |
9078a3e1 | 32 | struct btrfs_block_group_item *bi; |
8c2383c3 | 33 | struct btrfs_file_extent_item *fi; |
5f39d397 CM |
34 | struct btrfs_key key; |
35 | struct btrfs_key found_key; | |
62e2749e | 36 | u32 type; |
1d4f6404 | 37 | |
5af3981c | 38 | printk("leaf %llu total ptrs %d free space %d\n", |
db94535d | 39 | (unsigned long long)btrfs_header_bytenr(l), nr, |
123abc88 | 40 | btrfs_leaf_free_space(root, l)); |
5de08d7d | 41 | for (i = 0 ; i < nr ; i++) { |
5f39d397 CM |
42 | item = btrfs_item_nr(l, i); |
43 | btrfs_item_key_to_cpu(l, &key, i); | |
44 | type = btrfs_key_type(&key); | |
5af3981c | 45 | printk("\titem %d key (%llu %x %llu) itemoff %d itemsize %d\n", |
5de08d7d | 46 | i, |
5f39d397 CM |
47 | (unsigned long long)key.objectid, type, |
48 | (unsigned long long)key.offset, | |
49 | btrfs_item_offset(l, item), btrfs_item_size(l, item)); | |
62e2749e CM |
50 | switch (type) { |
51 | case BTRFS_INODE_ITEM_KEY: | |
293ffd5f | 52 | ii = btrfs_item_ptr(l, i, struct btrfs_inode_item); |
5af3981c | 53 | printk("\t\tinode generation %llu size %llu mode %o\n", |
5f39d397 CM |
54 | (unsigned long long)btrfs_inode_generation(l, ii), |
55 | (unsigned long long)btrfs_inode_size(l, ii), | |
56 | btrfs_inode_mode(l, ii)); | |
62e2749e CM |
57 | break; |
58 | case BTRFS_DIR_ITEM_KEY: | |
1d4f6404 | 59 | di = btrfs_item_ptr(l, i, struct btrfs_dir_item); |
5f39d397 | 60 | btrfs_dir_item_key_to_cpu(l, di, &found_key); |
5af3981c | 61 | printk("\t\tdir oid %llu flags %u type %u\n", |
5f39d397 CM |
62 | (unsigned long long)found_key.objectid, |
63 | btrfs_dir_flags(l, di), | |
64 | btrfs_dir_type(l, di)); | |
62e2749e CM |
65 | break; |
66 | case BTRFS_ROOT_ITEM_KEY: | |
67 | ri = btrfs_item_ptr(l, i, struct btrfs_root_item); | |
db94535d CM |
68 | printk("\t\troot data bytenr %llu refs %u\n", |
69 | (unsigned long long)btrfs_disk_root_bytenr(l, ri), | |
5f39d397 | 70 | btrfs_disk_root_refs(l, ri)); |
62e2749e CM |
71 | break; |
72 | case BTRFS_EXTENT_ITEM_KEY: | |
73 | ei = btrfs_item_ptr(l, i, struct btrfs_extent_item); | |
d0dbc624 | 74 | printk("\t\textent data refs %u\n", |
5f39d397 | 75 | btrfs_extent_refs(l, ei)); |
62e2749e | 76 | break; |
8c2383c3 CM |
77 | |
78 | case BTRFS_EXTENT_DATA_KEY: | |
79 | fi = btrfs_item_ptr(l, i, | |
80 | struct btrfs_file_extent_item); | |
5f39d397 | 81 | if (btrfs_file_extent_type(l, fi) == |
8c2383c3 CM |
82 | BTRFS_FILE_EXTENT_INLINE) { |
83 | printk("\t\tinline extent data size %u\n", | |
5f39d397 | 84 | btrfs_file_extent_inline_len(l, item)); |
8c2383c3 CM |
85 | break; |
86 | } | |
db94535d CM |
87 | printk("\t\textent data disk bytenr %llu nr %llu\n", |
88 | (unsigned long long)btrfs_file_extent_disk_bytenr(l, fi), | |
89 | (unsigned long long)btrfs_file_extent_disk_num_bytes(l, fi)); | |
8c2383c3 | 90 | printk("\t\textent data offset %llu nr %llu\n", |
5f39d397 | 91 | (unsigned long long)btrfs_file_extent_offset(l, fi), |
db94535d | 92 | (unsigned long long)btrfs_file_extent_num_bytes(l, fi)); |
8c2383c3 | 93 | break; |
9078a3e1 CM |
94 | case BTRFS_BLOCK_GROUP_ITEM_KEY: |
95 | bi = btrfs_item_ptr(l, i, | |
96 | struct btrfs_block_group_item); | |
5af3981c | 97 | printk("\t\tblock group used %llu\n", |
5f39d397 | 98 | (unsigned long long)btrfs_disk_block_group_used(l, bi)); |
62e2749e CM |
99 | break; |
100 | }; | |
5de08d7d CM |
101 | } |
102 | } | |
e20d96d6 | 103 | |
5f39d397 | 104 | void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *c) |
5de08d7d CM |
105 | { |
106 | int i; | |
7518a238 | 107 | u32 nr; |
5f39d397 | 108 | struct btrfs_key key; |
db94535d | 109 | int level; |
5de08d7d | 110 | |
5f39d397 | 111 | if (!c) |
5de08d7d | 112 | return; |
5f39d397 | 113 | nr = btrfs_header_nritems(c); |
db94535d CM |
114 | level = btrfs_header_level(c); |
115 | if (level == 0) { | |
5f39d397 | 116 | btrfs_print_leaf(root, c); |
5de08d7d CM |
117 | return; |
118 | } | |
5af3981c | 119 | printk("node %llu level %d total ptrs %d free spc %u\n", |
db94535d | 120 | (unsigned long long)btrfs_header_bytenr(c), |
5f39d397 | 121 | btrfs_header_level(c), nr, |
e20d96d6 | 122 | (u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr); |
5de08d7d | 123 | for (i = 0; i < nr; i++) { |
5f39d397 | 124 | btrfs_node_key_to_cpu(c, &key, i); |
5af3981c | 125 | printk("\tkey %d (%llu %u %llu) block %llu\n", |
5de08d7d | 126 | i, |
5f39d397 CM |
127 | (unsigned long long)key.objectid, |
128 | key.type, | |
129 | (unsigned long long)key.offset, | |
5af3981c | 130 | (unsigned long long)btrfs_node_blockptr(c, i)); |
5de08d7d CM |
131 | } |
132 | for (i = 0; i < nr; i++) { | |
5f39d397 | 133 | struct extent_buffer *next = read_tree_block(root, |
db94535d CM |
134 | btrfs_node_blockptr(c, i), |
135 | btrfs_level_size(root, level - 1)); | |
7518a238 | 136 | if (btrfs_is_leaf(next) && |
5f39d397 | 137 | btrfs_header_level(c) != 1) |
5de08d7d | 138 | BUG(); |
5f39d397 CM |
139 | if (btrfs_header_level(next) != |
140 | btrfs_header_level(c) - 1) | |
5de08d7d | 141 | BUG(); |
5f39d397 CM |
142 | btrfs_print_tree(root, next); |
143 | free_extent_buffer(next); | |
5de08d7d | 144 | } |
5de08d7d CM |
145 | } |
146 |