btrfs-progs/debug-tree.c

105 lines
3.0 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.
*/
#include <stdio.h>
#include <stdlib.h>
2007-04-05 18:29:12 +00:00
#include <uuid/uuid.h>
#include "kerncompat.h"
#include "radix-tree.h"
#include "ctree.h"
#include "disk-io.h"
#include "print-tree.h"
2007-03-16 20:20:31 +00:00
#include "transaction.h"
2007-02-28 14:40:58 +00:00
int main(int ac, char **av) {
2007-03-13 14:46:10 +00:00
struct btrfs_root *root;
2007-04-10 13:27:30 +00:00
struct btrfs_path path;
struct btrfs_key key;
struct btrfs_root_item ri;
struct extent_buffer *leaf;
2007-04-10 13:27:30 +00:00
struct btrfs_key found_key;
2007-04-05 18:29:12 +00:00
char uuidbuf[37];
2007-04-10 13:27:30 +00:00
int ret;
int slot;
2007-03-21 00:35:03 +00:00
if (ac != 2) {
fprintf(stderr, "usage: %s device\n", av[0]);
exit(1);
}
radix_tree_init();
root = open_ctree(av[1], 0);
2007-03-21 00:35:03 +00:00
if (!root) {
fprintf(stderr, "unable to open %s\n", av[1]);
exit(1);
}
printf("root tree\n");
btrfs_print_tree(root->fs_info->tree_root,
root->fs_info->tree_root->node);
2007-04-10 13:27:30 +00:00
btrfs_init_path(&path);
key.offset = 0;
key.objectid = 0;
btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
ret = btrfs_search_slot(NULL, root->fs_info->tree_root,
&key, &path, 0, 0);
BUG_ON(ret < 0);
while(1) {
leaf = path.nodes[0];
2007-04-10 13:27:30 +00:00
slot = path.slots[0];
if (slot >= btrfs_header_nritems(leaf)) {
2007-04-10 13:27:30 +00:00
ret = btrfs_next_leaf(root, &path);
if (ret != 0)
break;
leaf = path.nodes[0];
2007-04-10 13:27:30 +00:00
slot = path.slots[0];
}
btrfs_item_key_to_cpu(leaf, &found_key, path.slots[0]);
2007-04-10 13:27:30 +00:00
if (btrfs_key_type(&found_key) == BTRFS_ROOT_ITEM_KEY) {
unsigned long offset;
struct extent_buffer *buf;
offset = btrfs_item_ptr_offset(leaf, slot);
read_extent_buffer(leaf, &ri, offset, sizeof(ri));
2007-04-10 13:27:30 +00:00
buf = read_tree_block(root->fs_info->tree_root,
btrfs_root_bytenr(&ri),
2007-10-15 20:25:14 +00:00
root->leafsize);
2007-04-10 13:27:30 +00:00
switch(found_key.objectid) {
case BTRFS_ROOT_TREE_OBJECTID:
printf("root ");
break;
case BTRFS_EXTENT_TREE_OBJECTID:
printf("extent tree ");
break;
}
2007-06-12 12:08:04 +00:00
printf("tree %llu %u %llu\n",
(unsigned long long)found_key.objectid,
2007-10-15 20:24:39 +00:00
found_key.type,
2007-06-12 12:08:04 +00:00
(unsigned long long)found_key.offset);
2007-04-10 13:27:30 +00:00
btrfs_print_tree(root, buf);
}
path.slots[0]++;
}
btrfs_release_path(root, &path);
2007-10-15 20:25:14 +00:00
printf("total bytes %llu\n",
(unsigned long long)btrfs_super_total_bytes(&root->fs_info->super_copy));
2007-10-15 20:25:14 +00:00
printf("bytes used %llu\n",
(unsigned long long)btrfs_super_bytes_used(&root->fs_info->super_copy));
2007-04-05 18:29:12 +00:00
uuidbuf[36] = '\0';
uuid_unparse(root->fs_info->super_copy.fsid, uuidbuf);
2007-04-05 18:29:12 +00:00
printf("uuid %s\n", uuidbuf);
return 0;
}