btrfs-progs: check: Remove duplicated and commented functions
Commit 756105181e
("btrfs-progs: check: supplement extent backref
list with rbtree") changed the backref implementation to use rb tree
and also commented the old implementations. It's been almost 2 years
since that change and it's unlikely the old version will ever be used,
so just remove it.
Signed-off-by: Nikolay Borisov <nborisov@suse.com>
Signed-off-by: David Sterba <dsterba@suse.com>
This commit is contained in:
parent
16b30ddb28
commit
32f75c87a0
69
check/main.c
69
check/main.c
|
@ -4385,36 +4385,6 @@ static int check_block(struct btrfs_root *root,
|
|||
return ret;
|
||||
}
|
||||
|
||||
#if 0
|
||||
static struct tree_backref *find_tree_backref(struct extent_record *rec,
|
||||
u64 parent, u64 root)
|
||||
{
|
||||
struct list_head *cur = rec->backrefs.next;
|
||||
struct extent_backref *node;
|
||||
struct tree_backref *back;
|
||||
|
||||
while (cur != &rec->backrefs) {
|
||||
node = to_extent_backref(cur);
|
||||
cur = cur->next;
|
||||
if (node->is_data)
|
||||
continue;
|
||||
back = to_tree_backref(node);
|
||||
if (parent > 0) {
|
||||
if (!node->full_backref)
|
||||
continue;
|
||||
if (parent == back->parent)
|
||||
return back;
|
||||
} else {
|
||||
if (node->full_backref)
|
||||
continue;
|
||||
if (back->root == root)
|
||||
return back;
|
||||
}
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
#endif
|
||||
|
||||
static struct tree_backref *alloc_tree_backref(struct extent_record *rec,
|
||||
u64 parent, u64 root)
|
||||
{
|
||||
|
@ -4434,45 +4404,6 @@ static struct tree_backref *alloc_tree_backref(struct extent_record *rec,
|
|||
return ref;
|
||||
}
|
||||
|
||||
#if 0
|
||||
static struct data_backref *find_data_backref(struct extent_record *rec,
|
||||
u64 parent, u64 root,
|
||||
u64 owner, u64 offset,
|
||||
int found_ref,
|
||||
u64 disk_bytenr, u64 bytes)
|
||||
{
|
||||
struct list_head *cur = rec->backrefs.next;
|
||||
struct extent_backref *node;
|
||||
struct data_backref *back;
|
||||
|
||||
while (cur != &rec->backrefs) {
|
||||
node = to_extent_backref(cur);
|
||||
cur = cur->next;
|
||||
if (!node->is_data)
|
||||
continue;
|
||||
back = to_data_backref(node);
|
||||
if (parent > 0) {
|
||||
if (!node->full_backref)
|
||||
continue;
|
||||
if (parent == back->parent)
|
||||
return back;
|
||||
} else {
|
||||
if (node->full_backref)
|
||||
continue;
|
||||
if (back->root == root && back->owner == owner &&
|
||||
back->offset == offset) {
|
||||
if (found_ref && node->found_ref &&
|
||||
(back->bytes != bytes ||
|
||||
back->disk_bytenr != disk_bytenr))
|
||||
continue;
|
||||
return back;
|
||||
}
|
||||
}
|
||||
}
|
||||
return NULL;
|
||||
}
|
||||
#endif
|
||||
|
||||
static struct data_backref *alloc_data_backref(struct extent_record *rec,
|
||||
u64 parent, u64 root,
|
||||
u64 owner, u64 offset,
|
||||
|
|
Loading…
Reference in New Issue