3 #include "kerncompat.h"
4 #include "radix-tree.h"
8 static int print_dir_item(struct btrfs_item
*item
,
9 struct btrfs_dir_item
*di
)
14 total
= btrfs_item_size(item
);
16 printf("\t\tdir index %Lu flags %u type %u\n",
17 btrfs_disk_key_objectid(&di
->location
),
20 printf("\t\tname %.*s\n",
21 btrfs_dir_name_len(di
),(char *)(di
+ 1));
22 len
= sizeof(*di
) + btrfs_dir_name_len(di
);
23 di
= (struct btrfs_dir_item
*)((char *)di
+ len
);
28 void btrfs_print_leaf(struct btrfs_root
*root
, struct btrfs_leaf
*l
)
31 u32 nr
= btrfs_header_nritems(&l
->header
);
32 struct btrfs_item
*item
;
33 struct btrfs_extent_item
*ei
;
34 struct btrfs_root_item
*ri
;
35 struct btrfs_dir_item
*di
;
36 struct btrfs_inode_item
*ii
;
37 struct btrfs_file_extent_item
*fi
;
38 struct btrfs_csum_item
*ci
;
39 struct btrfs_block_group_item
*bi
;
42 printf("leaf %Lu ptrs %d free space %d generation %Lu owner %Lu\n",
43 btrfs_header_blocknr(&l
->header
), nr
,
44 btrfs_leaf_free_space(root
, l
),
45 btrfs_header_generation(&l
->header
),
46 btrfs_header_owner(&l
->header
));
48 for (i
= 0 ; i
< nr
; i
++) {
50 type
= btrfs_disk_key_type(&item
->key
);
51 printf("\titem %d key (%Lu %x %Lu) itemoff %d itemsize %d\n",
53 btrfs_disk_key_objectid(&item
->key
),
54 btrfs_disk_key_flags(&item
->key
),
55 btrfs_disk_key_offset(&item
->key
),
56 btrfs_item_offset(item
),
57 btrfs_item_size(item
));
59 case BTRFS_INODE_ITEM_KEY
:
60 ii
= btrfs_item_ptr(l
, i
, struct btrfs_inode_item
);
61 printf("\t\tinode generation %Lu size %Lu block group %Lu mode %o\n",
62 btrfs_inode_generation(ii
),
64 btrfs_inode_block_group(ii
),
65 btrfs_inode_mode(ii
));
67 case BTRFS_DIR_ITEM_KEY
:
68 di
= btrfs_item_ptr(l
, i
, struct btrfs_dir_item
);
69 print_dir_item(l
->items
+ i
, di
);
71 case BTRFS_DIR_INDEX_KEY
:
72 di
= btrfs_item_ptr(l
, i
, struct btrfs_dir_item
);
73 print_dir_item(l
->items
+ i
, di
);
75 case BTRFS_ROOT_ITEM_KEY
:
76 ri
= btrfs_item_ptr(l
, i
, struct btrfs_root_item
);
77 printf("\t\troot data blocknr %Lu dirid %Lu refs %u\n",
78 btrfs_root_blocknr(ri
),
82 case BTRFS_EXTENT_ITEM_KEY
:
83 ei
= btrfs_item_ptr(l
, i
, struct btrfs_extent_item
);
84 printf("\t\textent data refs %u owner %Lu\n",
85 btrfs_extent_refs(ei
),
86 btrfs_extent_owner(ei
));
88 case BTRFS_CSUM_ITEM_KEY
:
89 ci
= btrfs_item_ptr(l
, i
,
90 struct btrfs_csum_item
);
91 printf("\t\tcsum item\n");
93 case BTRFS_EXTENT_DATA_KEY
:
94 fi
= btrfs_item_ptr(l
, i
,
95 struct btrfs_file_extent_item
);
96 if (btrfs_file_extent_type(fi
) ==
97 BTRFS_FILE_EXTENT_INLINE
) {
98 printf("\t\tinline extent data size %u\n",
99 btrfs_file_extent_inline_len(l
->items
+ i
));
102 printf("\t\textent data disk block %Lu nr %Lu\n",
103 btrfs_file_extent_disk_blocknr(fi
),
104 btrfs_file_extent_disk_num_blocks(fi
));
105 printf("\t\textent data offset %Lu nr %Lu\n",
106 btrfs_file_extent_offset(fi
),
107 btrfs_file_extent_num_blocks(fi
));
109 case BTRFS_BLOCK_GROUP_ITEM_KEY
:
110 bi
= btrfs_item_ptr(l
, i
,
111 struct btrfs_block_group_item
);
112 printf("\t\tblock group used %Lu flags %x\n",
113 btrfs_block_group_used(bi
), bi
->flags
);
115 case BTRFS_STRING_ITEM_KEY
:
116 printf("\t\titem data %.*s\n", btrfs_item_size(item
),
117 btrfs_leaf_data(l
) + btrfs_item_offset(item
));
123 void btrfs_print_tree(struct btrfs_root
*root
, struct btrfs_buffer
*t
)
127 struct btrfs_node
*c
;
132 nr
= btrfs_header_nritems(&c
->header
);
133 if (btrfs_is_leaf(c
)) {
134 btrfs_print_leaf(root
, (struct btrfs_leaf
*)c
);
137 printf("node %Lu level %d ptrs %d free %u generation %Lu owner %Lu\n",
139 btrfs_header_level(&c
->header
), nr
,
140 (u32
)BTRFS_NODEPTRS_PER_BLOCK(root
) - nr
,
141 btrfs_header_generation(&c
->header
),
142 btrfs_header_owner(&c
->header
));
144 for (i
= 0; i
< nr
; i
++) {
145 printf("\tkey %d (%Lu %x %Lu) block %Lu\n",
147 c
->ptrs
[i
].key
.objectid
,
148 c
->ptrs
[i
].key
.flags
,
149 c
->ptrs
[i
].key
.offset
,
150 btrfs_node_blockptr(c
, i
));
153 for (i
= 0; i
< nr
; i
++) {
154 struct btrfs_buffer
*next_buf
= read_tree_block(root
,
155 btrfs_node_blockptr(c
, i
));
156 struct btrfs_node
*next
= &next_buf
->node
;
157 if (btrfs_is_leaf(next
) &&
158 btrfs_header_level(&c
->header
) != 1)
160 if (btrfs_header_level(&next
->header
) !=
161 btrfs_header_level(&c
->header
) - 1)
163 btrfs_print_tree(root
, next_buf
);
164 btrfs_block_release(root
, next_buf
);