btrfs-progs/print-tree.c

451 lines
14 KiB
C
Raw Normal View History

2007-06-12 13:07:11 +00:00
/*
* Copyright (C) 2007 Oracle. All rights reserved.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public
* License v2 as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public
* License along with this program; if not, write to the
* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
* Boston, MA 021110-1307, USA.
*/
2007-02-24 11:24:44 +00:00
#include <stdio.h>
#include <stdlib.h>
#include <uuid/uuid.h>
2007-02-24 11:24:44 +00:00
#include "kerncompat.h"
#include "radix-tree.h"
#include "ctree.h"
#include "disk-io.h"
static int print_dir_item(struct extent_buffer *eb, struct btrfs_item *item,
struct btrfs_dir_item *di)
{
u32 total;
u32 cur = 0;
u32 len;
u32 name_len;
u32 data_len;
char namebuf[BTRFS_NAME_LEN];
struct btrfs_disk_key location;
total = btrfs_item_size(eb, item);
while(cur < total) {
btrfs_dir_item_key(eb, di, &location);
2007-11-16 16:46:07 +00:00
printf("\t\tdir index %llu type %u\n",
(unsigned long long)btrfs_disk_key_objectid(&location),
btrfs_dir_type(eb, di));
name_len = btrfs_dir_name_len(eb, di);
data_len = btrfs_dir_data_len(eb, di);
len = (name_len <= sizeof(namebuf))? name_len: sizeof(namebuf);
read_extent_buffer(eb, namebuf, (unsigned long)(di + 1), len);
printf("\t\tnamelen %u datalen %u name: %.*s\n",
name_len, data_len, len, namebuf);
len = sizeof(*di) + name_len + data_len;
di = (struct btrfs_dir_item *)((char *)di + len);
cur += len;
}
return 0;
}
static int print_inode_ref_item(struct extent_buffer *eb, struct btrfs_item *item,
struct btrfs_inode_ref *ref)
{
u32 total;
u32 cur = 0;
u32 len;
u32 name_len;
2008-07-24 16:13:32 +00:00
u64 index;
char namebuf[BTRFS_NAME_LEN];
total = btrfs_item_size(eb, item);
while(cur < total) {
name_len = btrfs_inode_ref_name_len(eb, ref);
2008-07-24 16:13:32 +00:00
index = btrfs_inode_ref_index(eb, ref);
len = (name_len <= sizeof(namebuf))? name_len: sizeof(namebuf);
read_extent_buffer(eb, namebuf, (unsigned long)(ref + 1), len);
2008-07-24 16:13:32 +00:00
printf("\t\tinode ref index %llu namelen %u name: %.*s\n",
index, name_len, len, namebuf);
len = sizeof(*ref) + name_len;
ref = (struct btrfs_inode_ref *)((char *)ref + len);
cur += len;
}
return 0;
}
static void print_chunk(struct extent_buffer *eb, struct btrfs_chunk *chunk)
{
int num_stripes = btrfs_chunk_num_stripes(eb, chunk);
int i;
printf("\t\tchunk length %llu owner %llu type %llu num_stripes %d\n",
(unsigned long long)btrfs_chunk_length(eb, chunk),
(unsigned long long)btrfs_chunk_owner(eb, chunk),
(unsigned long long)btrfs_chunk_type(eb, chunk),
num_stripes);
for (i = 0 ; i < num_stripes ; i++) {
printf("\t\t\tstripe %d devid %llu offset %llu\n", i,
(unsigned long long)btrfs_stripe_devid_nr(eb, chunk, i),
(unsigned long long)btrfs_stripe_offset_nr(eb, chunk, i));
}
}
static void print_dev_item(struct extent_buffer *eb,
struct btrfs_dev_item *dev_item)
{
printf("\t\tdev item devid %llu "
"total_bytes %llu bytes used %Lu\n",
(unsigned long long)btrfs_device_id(eb, dev_item),
(unsigned long long)btrfs_device_total_bytes(eb, dev_item),
(unsigned long long)btrfs_device_bytes_used(eb, dev_item));
}
static void print_uuids(struct extent_buffer *eb)
{
char fs_uuid[37];
char chunk_uuid[37];
u8 disk_uuid[BTRFS_UUID_SIZE];
read_extent_buffer(eb, disk_uuid, (unsigned long)btrfs_header_fsid(eb),
BTRFS_FSID_SIZE);
fs_uuid[36] = '\0';
uuid_unparse(disk_uuid, fs_uuid);
read_extent_buffer(eb, disk_uuid,
(unsigned long)btrfs_header_chunk_tree_uuid(eb),
BTRFS_UUID_SIZE);
chunk_uuid[36] = '\0';
uuid_unparse(disk_uuid, chunk_uuid);
printf("fs uuid %s\nchunk uuid %s\n", fs_uuid, chunk_uuid);
}
static void print_file_extent_item(struct extent_buffer *eb,
struct btrfs_item *item,
struct btrfs_file_extent_item *fi)
{
int extent_type = btrfs_file_extent_type(eb, fi);
if (extent_type == BTRFS_FILE_EXTENT_INLINE) {
printf("\t\tinline extent data size %u "
"ram %u compress %d\n",
btrfs_file_extent_inline_item_len(eb, item),
btrfs_file_extent_inline_len(eb, fi),
btrfs_file_extent_compression(eb, fi));
return;
}
if (extent_type == BTRFS_FILE_EXTENT_PREALLOC) {
printf("\t\tprealloc data disk byte %llu nr %llu\n",
(unsigned long long)btrfs_file_extent_disk_bytenr(eb, fi),
(unsigned long long)btrfs_file_extent_disk_num_bytes(eb, fi));
printf("\t\tprealloc data offset %llu nr %llu\n",
(unsigned long long)btrfs_file_extent_offset(eb, fi),
(unsigned long long)btrfs_file_extent_num_bytes(eb, fi));
return;
}
printf("\t\textent data disk byte %llu nr %llu\n",
(unsigned long long)btrfs_file_extent_disk_bytenr(eb, fi),
(unsigned long long)btrfs_file_extent_disk_num_bytes(eb, fi));
printf("\t\textent data offset %llu nr %llu ram %llu\n",
(unsigned long long)btrfs_file_extent_offset(eb, fi),
(unsigned long long)btrfs_file_extent_num_bytes(eb, fi),
(unsigned long long)btrfs_file_extent_ram_bytes(eb, fi));
printf("\t\textent compression %d\n",
btrfs_file_extent_compression(eb, fi));
}
static void print_root_ref(struct extent_buffer *leaf, int slot, char *tag)
{
struct btrfs_root_ref *ref;
char namebuf[BTRFS_NAME_LEN];
int namelen;
ref = btrfs_item_ptr(leaf, slot, struct btrfs_root_ref);
namelen = btrfs_root_ref_name_len(leaf, ref);
read_extent_buffer(leaf, namebuf, (unsigned long)(ref + 1), namelen);
printf("\t\troot %s key dirid %llu sequence %llu name %.*s\n", tag,
(unsigned long long)btrfs_root_ref_dirid(leaf, ref),
(unsigned long long)btrfs_root_ref_sequence(leaf, ref),
namelen, namebuf);
}
static void print_key_type(u8 type)
{
switch (type) {
case BTRFS_INODE_ITEM_KEY:
printf("INODE_ITEM");
break;
case BTRFS_INODE_REF_KEY:
printf("INODE_REF");
break;
case BTRFS_DIR_ITEM_KEY:
printf("DIR_ITEM");
break;
case BTRFS_DIR_INDEX_KEY:
printf("DIR_INDEX");
break;
case BTRFS_XATTR_ITEM_KEY:
printf("XATTR_ITEM");
break;
case BTRFS_ORPHAN_ITEM_KEY:
printf("ORPHAN_ITEM");
break;
case BTRFS_ROOT_ITEM_KEY:
printf("ROOT_ITEM");
break;
case BTRFS_ROOT_REF_KEY:
printf("ROOT_REF");
break;
case BTRFS_ROOT_BACKREF_KEY:
printf("ROOT_BACKREF");
break;
case BTRFS_EXTENT_ITEM_KEY:
printf("EXTENT_ITEM");
break;
case BTRFS_EXTENT_REF_KEY:
printf("EXTENT_REF");
break;
case BTRFS_CSUM_ITEM_KEY:
printf("CSUM_ITEM");
break;
case BTRFS_EXTENT_CSUM_KEY:
printf("EXTENT_CSUM");
break;
case BTRFS_EXTENT_DATA_KEY:
printf("EXTENT_DATA");
break;
case BTRFS_BLOCK_GROUP_ITEM_KEY:
printf("GROUP_ITEM");
break;
case BTRFS_CHUNK_ITEM_KEY:
printf("CHUNK_ITEM");
break;
case BTRFS_DEV_ITEM_KEY:
printf("DEV_ITEM");
break;
case BTRFS_DEV_EXTENT_KEY:
printf("DEV_EXTENT");
break;
case BTRFS_STRING_ITEM_KEY:
printf("STRING_ITEM");
break;
default:
printf("UNKNOWN");
};
}
void btrfs_print_leaf(struct btrfs_root *root, struct extent_buffer *l)
2007-02-24 11:24:44 +00:00
{
int i;
char *str;
2007-03-13 00:12:07 +00:00
struct btrfs_item *item;
2007-03-13 14:46:10 +00:00
struct btrfs_extent_item *ei;
struct btrfs_root_item *ri;
struct btrfs_dir_item *di;
2007-03-20 19:57:25 +00:00
struct btrfs_inode_item *ii;
2007-03-26 20:01:00 +00:00
struct btrfs_file_extent_item *fi;
struct btrfs_csum_item *ci;
2007-04-26 20:46:06 +00:00
struct btrfs_block_group_item *bi;
struct btrfs_extent_ref *ref;
struct btrfs_inode_ref *iref;
struct btrfs_dev_extent *dev_extent;
struct btrfs_disk_key disk_key;
struct btrfs_root_item root_item;
struct btrfs_block_group_item bg_item;
u32 nr = btrfs_header_nritems(l);
u32 type;
2007-06-12 12:08:04 +00:00
printf("leaf %llu ptrs %d free space %d generation %llu owner %llu\n",
(unsigned long long)btrfs_header_bytenr(l), nr,
2007-03-26 15:24:42 +00:00
btrfs_leaf_free_space(root, l),
(unsigned long long)btrfs_header_generation(l),
(unsigned long long)btrfs_header_owner(l));
print_uuids(l);
2007-02-24 11:24:44 +00:00
fflush(stdout);
for (i = 0 ; i < nr ; i++) {
item = btrfs_item_nr(l, i);
btrfs_item_key(l, &disk_key, i);
type = btrfs_disk_key_type(&disk_key);
printf("\titem %d key (%llu ",
2007-02-24 11:24:44 +00:00
i,
(unsigned long long)btrfs_disk_key_objectid(&disk_key));
print_key_type(type);
printf(" %llu) itemoff %d itemsize %d\n",
(unsigned long long)btrfs_disk_key_offset(&disk_key),
btrfs_item_offset(l, item),
btrfs_item_size(l, item));
switch (type) {
case BTRFS_INODE_ITEM_KEY:
2007-03-20 19:57:25 +00:00
ii = btrfs_item_ptr(l, i, struct btrfs_inode_item);
printf("\t\tinode generation %llu size %llu block group %llu mode %o links %u\n",
(unsigned long long)btrfs_inode_generation(l, ii),
(unsigned long long)btrfs_inode_size(l, ii),
(unsigned long long)btrfs_inode_block_group(l,ii),
btrfs_inode_mode(l, ii),
btrfs_inode_nlink(l, ii));
break;
case BTRFS_INODE_REF_KEY:
iref = btrfs_item_ptr(l, i, struct btrfs_inode_ref);
print_inode_ref_item(l, item, iref);
break;
case BTRFS_DIR_ITEM_KEY:
2007-04-05 01:23:26 +00:00
case BTRFS_DIR_INDEX_KEY:
case BTRFS_XATTR_ITEM_KEY:
2007-04-05 01:23:26 +00:00
di = btrfs_item_ptr(l, i, struct btrfs_dir_item);
print_dir_item(l, item, di);
2007-04-05 01:23:26 +00:00
break;
case BTRFS_ORPHAN_ITEM_KEY:
printf("\t\torphan item\n");
break;
case BTRFS_ROOT_ITEM_KEY:
ri = btrfs_item_ptr(l, i, struct btrfs_root_item);
read_extent_buffer(l, &root_item, (unsigned long)ri, sizeof(root_item));
2007-10-15 20:25:14 +00:00
printf("\t\troot data bytenr %llu level %d dirid %llu refs %u\n",
(unsigned long long)btrfs_root_bytenr(&root_item),
btrfs_root_level(&root_item),
(unsigned long long)btrfs_root_dirid(&root_item),
btrfs_root_refs(&root_item));
if (1 || btrfs_root_refs(&root_item) == 0) {
2007-08-07 20:15:59 +00:00
struct btrfs_key drop_key;
btrfs_disk_key_to_cpu(&drop_key,
&root_item.drop_progress);
2007-08-07 20:15:59 +00:00
printf("\t\tdrop key %Lu %x %Lu level %d\n",
(unsigned long long)drop_key.objectid,
2007-10-15 20:24:39 +00:00
drop_key.type,
2007-08-07 20:15:59 +00:00
(unsigned long long)drop_key.offset,
root_item.drop_level);
2007-08-07 20:15:59 +00:00
}
break;
case BTRFS_ROOT_REF_KEY:
print_root_ref(l, i, "ref");
break;
case BTRFS_ROOT_BACKREF_KEY:
print_root_ref(l, i, "backref");
break;
case BTRFS_EXTENT_ITEM_KEY:
ei = btrfs_item_ptr(l, i, struct btrfs_extent_item);
printf("\t\textent data refs %u\n",
btrfs_extent_refs(l, ei));
break;
case BTRFS_EXTENT_REF_KEY:
ref = btrfs_item_ptr(l, i, struct btrfs_extent_ref);
printf("\t\textent back ref root %llu gen %llu "
"owner %llu num_refs %lu\n",
(unsigned long long)btrfs_ref_root(l, ref),
(unsigned long long)btrfs_ref_generation(l, ref),
(unsigned long long)btrfs_ref_objectid(l, ref),
(unsigned long)btrfs_ref_num_refs(l, ref));
break;
case BTRFS_CSUM_ITEM_KEY:
ci = btrfs_item_ptr(l, i, struct btrfs_csum_item);
printf("\t\tcsum item\n");
break;
Btrfs: move data checksumming into a dedicated tree Btrfs stores checksums for each data block. Until now, they have been stored in the subvolume trees, indexed by the inode that is referencing the data block. This means that when we read the inode, we've probably read in at least some checksums as well. But, this has a few problems: * The checksums are indexed by logical offset in the file. When compression is on, this means we have to do the expensive checksumming on the uncompressed data. It would be faster if we could checksum the compressed data instead. * If we implement encryption, we'll be checksumming the plain text and storing that on disk. This is significantly less secure. * For either compression or encryption, we have to get the plain text back before we can verify the checksum as correct. This makes the raid layer balancing and extent moving much more expensive. * It makes the front end caching code more complex, as we have touch the subvolume and inodes as we cache extents. * There is potentitally one copy of the checksum in each subvolume referencing an extent. The solution used here is to store the extent checksums in a dedicated tree. This allows us to index the checksums by phyiscal extent start and length. It means: * The checksum is against the data stored on disk, after any compression or encryption is done. * The checksum is stored in a central location, and can be verified without following back references, or reading inodes. This makes compression significantly faster by reducing the amount of data that needs to be checksummed. It will also allow much faster raid management code in general. The checksums are indexed by a key with a fixed objectid (a magic value in ctree.h) and offset set to the starting byte of the extent. This allows us to copy the checksum items into the fsync log tree directly (or any other tree), without having to invent a second format for them. Signed-off-by: Chris Mason <chris.mason@oracle.com>
2008-12-08 22:00:31 +00:00
case BTRFS_EXTENT_CSUM_KEY:
ci = btrfs_item_ptr(l, i, struct btrfs_csum_item);
printf("\t\textent csum item\n");
break;
2007-03-26 20:01:00 +00:00
case BTRFS_EXTENT_DATA_KEY:
fi = btrfs_item_ptr(l, i,
struct btrfs_file_extent_item);
print_file_extent_item(l, item, fi);
2007-03-26 20:01:00 +00:00
break;
2007-04-26 20:46:06 +00:00
case BTRFS_BLOCK_GROUP_ITEM_KEY:
bi = btrfs_item_ptr(l, i,
struct btrfs_block_group_item);
read_extent_buffer(l, &bg_item, (unsigned long)bi,
sizeof(bg_item));
printf("\t\tblock group used %llu flags %llu\n",
(unsigned long long)btrfs_block_group_used(&bg_item),
(unsigned long long)btrfs_block_group_flags(&bg_item));
break;
case BTRFS_CHUNK_ITEM_KEY:
print_chunk(l, btrfs_item_ptr(l, i, struct btrfs_chunk));
break;
case BTRFS_DEV_ITEM_KEY:
print_dev_item(l, btrfs_item_ptr(l, i,
struct btrfs_dev_item));
break;
case BTRFS_DEV_EXTENT_KEY:
dev_extent = btrfs_item_ptr(l, i,
struct btrfs_dev_extent);
printf("\t\tdev extent chunk_tree %llu\n"
"\t\tchunk objectid %llu chunk offset %llu "
"length %llu\n",
(unsigned long long)
btrfs_dev_extent_chunk_tree(l, dev_extent),
(unsigned long long)
btrfs_dev_extent_chunk_objectid(l, dev_extent),
(unsigned long long)
btrfs_dev_extent_chunk_offset(l, dev_extent),
(unsigned long long)
btrfs_dev_extent_length(l, dev_extent));
2007-04-26 20:46:06 +00:00
break;
case BTRFS_STRING_ITEM_KEY:
/* dirty, but it's simple */
str = l->data + btrfs_item_ptr_offset(l, i);
printf("\t\titem data %.*s\n", btrfs_item_size(l, item), str);
break;
};
2007-02-24 11:24:44 +00:00
fflush(stdout);
}
}
void btrfs_print_tree(struct btrfs_root *root, struct extent_buffer *eb)
2007-02-24 11:24:44 +00:00
{
int i;
2007-03-12 16:01:18 +00:00
u32 nr;
2007-10-15 20:25:14 +00:00
u32 size;
struct btrfs_key key;
2007-02-24 11:24:44 +00:00
if (!eb)
2007-02-24 11:24:44 +00:00
return;
nr = btrfs_header_nritems(eb);
if (btrfs_is_leaf(eb)) {
btrfs_print_leaf(root, eb);
2007-02-24 11:24:44 +00:00
return;
}
2007-06-12 12:08:04 +00:00
printf("node %llu level %d ptrs %d free %u generation %llu owner %llu\n",
(unsigned long long)eb->start,
btrfs_header_level(eb), nr,
2007-03-26 15:24:42 +00:00
(u32)BTRFS_NODEPTRS_PER_BLOCK(root) - nr,
(unsigned long long)btrfs_header_generation(eb),
(unsigned long long)btrfs_header_owner(eb));
print_uuids(eb);
2007-02-24 11:24:44 +00:00
fflush(stdout);
size = btrfs_level_size(root, btrfs_header_level(eb) - 1);
2007-02-24 11:24:44 +00:00
for (i = 0; i < nr; i++) {
u64 blocknr = btrfs_node_blockptr(eb, i);
btrfs_node_key_to_cpu(eb, &key, i);
printf("\tkey %d (%llu ",
2007-02-24 11:24:44 +00:00
i,
(unsigned long long)key.objectid);
print_key_type(key.type);
printf(" %llu) block %llu (%llu) gen %llu\n",
(unsigned long long)key.offset,
2007-10-15 20:25:14 +00:00
(unsigned long long)blocknr,
(unsigned long long)blocknr / size,
(unsigned long long)btrfs_node_ptr_generation(eb, i));
2007-02-24 11:24:44 +00:00
fflush(stdout);
}
for (i = 0; i < nr; i++) {
struct extent_buffer *next = read_tree_block(root,
btrfs_node_blockptr(eb, i),
size,
btrfs_node_ptr_generation(eb, i));
2007-03-12 16:01:18 +00:00
if (btrfs_is_leaf(next) &&
btrfs_header_level(eb) != 1)
2007-02-24 11:24:44 +00:00
BUG();
if (btrfs_header_level(next) !=
btrfs_header_level(eb) - 1)
2007-02-24 11:24:44 +00:00
BUG();
btrfs_print_tree(root, next);
free_extent_buffer(next);
2007-02-24 11:24:44 +00:00
}
}