struct btrfs_path *path;
struct btrfs_key k1, k2;
int i;
+ int level;
int ret;
if (status != BTRFS_TREE_BLOCK_BAD_KEY_ORDER)
if (!path)
return -EIO;
- path->lowest_level = btrfs_header_level(buf);
+ level = btrfs_header_level(buf);
+ path->lowest_level = level;
path->skip_check_block = 1;
- if (btrfs_header_level(buf))
+ if (level)
btrfs_node_key_to_cpu(buf, &k1, 0);
else
btrfs_item_key_to_cpu(buf, &k1, 0);
return -EIO;
}
- buf = path->nodes[0];
+ buf = path->nodes[level];
for (i = 0; i < btrfs_header_nritems(buf) - 1; i++) {
- if (btrfs_header_level(buf)) {
+ if (level) {
btrfs_node_key_to_cpu(buf, &k1, i);
btrfs_node_key_to_cpu(buf, &k2, i + 1);
} else {