@@ -1847,7 +1847,7 @@ static int all_backpointers_checked(struct extent_record *rec, int print_errs)
(unsigned long long)rec->start,
back->full_backref ?
"parent" : "root",
- back->full_backref ?
+ back->full_backref ?
(unsigned long long)dback->parent:
(unsigned long long)dback->root,
(unsigned long long)dback->owner,
@@ -1941,7 +1941,7 @@ static int check_owner_ref(struct btrfs_root *root,
btrfs_item_key_to_cpu(buf, &key, 0);
else
btrfs_node_key_to_cpu(buf, &key, 0);
-
+
btrfs_init_path(&path);
path.lowest_level = level + 1;
ret = btrfs_search_slot(NULL, ref_root, &key, &path, 0, 0);
@@ -2047,7 +2047,7 @@ static struct data_backref *find_data_backref(struct extent_record *rec,
if (!node->is_data)
continue;
back = (struct data_backref *)node;
- if (parent > 0) {
+ if (parent > 0) {
if (!node->full_backref)
continue;
if (parent == back->parent)
@@ -2583,7 +2583,7 @@ static int run_next_block(struct btrfs_root *root,
ref = btrfs_item_ptr(buf, i,
struct btrfs_shared_data_ref);
add_data_backref(extent_cache,
- key.objectid, key.offset, 0, 0, 0,
+ key.objectid, key.offset, 0, 0, 0,
btrfs_shared_data_ref_count(buf, ref),
0);
continue;
@@ -2626,7 +2626,7 @@ static int run_next_block(struct btrfs_root *root,
ptr, size, 0, 0, 1, 0);
BUG_ON(ret);
- add_tree_backref(extent_cache, ptr, parent,
+ add_tree_backref(extent_cache, ptr, parent,
owner, 1);
if (level > 1) {
@@ -2815,13 +2815,18 @@ int main(int ac, char **av)
struct cache_tree root_cache;
struct btrfs_root *root;
int ret;
+ int i;
if (ac < 2)
print_usage();
radix_tree_init();
cache_tree_init(&root_cache);
- root = open_ctree(av[1], 0, 0);
+
+ for (i = 1; !strncmp("-", av[i], 1) && i < ac; ++i);
+ if (i >= ac)
+ print_usage();
+ root = open_ctree(av[i], 0, 0);
if (root == NULL)
return 1;