ambiser
/
btrbk
mirror of https://github.com/digint/btrbk
9
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

btrbk: btr_tree: return already assembled tree if a subvolume is already known in uuid_cache

pull/88/head
Axel Burri 2016-04-05 16:37:23 +02:00
parent ac0002bce8
commit a26e8851b4
1 changed files with 12 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
btrbk
View File

@ -1236,12 +1236,24 @@ sub btr_tree($$)
my %id = ( 5 => \%tree ); my %id = ( 5 => \%tree );
$tree{TREE_ROOT} = \%tree; $tree{TREE_ROOT} = \%tree;
$tree{ID_HASH} = \%id;
my $node_list = btrfs_subvolume_list($vol); my $node_list = btrfs_subvolume_list($vol);
return undef unless(ref($node_list) eq "ARRAY"); return undef unless(ref($node_list) eq "ARRAY");
my $vol_root;
TRACE "btr_tree: processing subvolume list of: $vol->{PRINT}"; TRACE "btr_tree: processing subvolume list of: $vol->{PRINT}";
# check if we already know this tree
if((scalar @$node_list) && $uuid_cache{$node_list->[0]->{uuid}}) {
TRACE "uuid_cache HIT: $node_list->[0]->{uuid}";
$vol_root = $uuid_cache{$node_list->[0]->{uuid}}->{TREE_ROOT}->{ID_HASH}->{$vol_root_id};
die "Duplicate UUID on different file systems" unless($vol_root);
TRACE "btr_tree: returning already parsed tree at id=$vol_root->{id}";
return $vol_root;
}
# fill ID_HASH and uuid_cache
foreach my $node (@$node_list) foreach my $node (@$node_list)
{ {
die if exists($id{$node->{id}}); die if exists($id{$node->{id}});
@ -1251,7 +1263,6 @@ sub btr_tree($$)
} }
# note: it is possible that id < top_level, e.g. after restoring # note: it is possible that id < top_level, e.g. after restoring
my $vol_root;
foreach my $node (@$node_list) foreach my $node (@$node_list)
{ {
# set SUBTREE / TOP_LEVEL node # set SUBTREE / TOP_LEVEL node