struct btrfs_key found_key;
int i;
- stat->total_bytes += root->leafsize;
+ stat->total_bytes += root->nodesize;
stat->total_leaves++;
if (!find_inline)
{
struct extent_buffer *b = path->nodes[level];
u64 last_block;
- u64 cluster_size = root->leafsize;
+ u64 cluster_size = root->nodesize;
int i;
int ret = 0;
path->slots[level] = i;
if ((level - 1) > 0 || find_inline) {
tmp = read_tree_block(root, cur_blocknr,
- btrfs_level_size(root, level - 1),
+ root->nodesize,
btrfs_node_ptr_generation(b, i));
if (!extent_buffer_uptodate(tmp)) {
fprintf(stderr, "Failed to read blocknr %llu\n",
find_inline);
else
ret = walk_leaf(root, path, stat, find_inline);
- if (last_block + root->leafsize != cur_blocknr) {
+ if (last_block + root->nodesize != cur_blocknr) {
u64 distance = calc_distance(last_block +
- root->leafsize,
+ root->nodesize,
cur_blocknr);
stat->total_seeks++;
stat->total_seek_len += distance;
stat->forward_seeks++;
else
stat->backward_seeks++;
- if (cluster_size != root->leafsize) {
+ if (cluster_size != root->nodesize) {
stat->total_cluster_size += cluster_size;
stat->total_clusters++;
if (cluster_size < stat->min_cluster_size)
if (cluster_size > stat->max_cluster_size)
stat->max_cluster_size = cluster_size;
}
- cluster_size = root->leafsize;
+ cluster_size = root->nodesize;
} else {
- cluster_size += root->leafsize;
+ cluster_size += root->nodesize;
}
last_block = cur_blocknr;
if (cur_blocknr < stat->lowest_bytenr)
stat.lowest_bytenr = btrfs_header_bytenr(root->node);
stat.highest_bytenr = stat.lowest_bytenr;
stat.min_cluster_size = (u64)-1;
- stat.max_cluster_size = root->leafsize;
+ stat.max_cluster_size = root->nodesize;
path->nodes[level] = root->node;
if (gettimeofday(&start, NULL)) {
fprintf(stderr, "Error getting time: %d\n", errno);
key.objectid = BTRFS_FS_TREE_OBJECTID;
key.offset = (u64)-1;
- printf("Calculatin' size of fs tree\n");
+ printf("Calculating size of fs tree\n");
ret = calc_root_size(root, &key, 1);
if (ret)
goto out;