1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
|
// Copyright (C) 2022 Luke Shumaker <lukeshu@lukeshu.com>
//
// SPDX-License-Identifier: GPL-2.0-or-later
package rebuildnodes
/*
import (
"context"
//"github.com/datawire/dlib/dlog"
"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfsprim"
"git.lukeshu.com/btrfs-progs-ng/lib/containers"
)
func getTreeAncestors(ctx context.Context, scanData scanResult) map[btrfsprim.ObjID]containers.Set[btrfsprim.ObjID] {
treeAncestors := make(map[btrfsprim.ObjID]containers.Set[btrfsprim.ObjID])
for laddr, node := range scanData.Nodes {
if _, ok := treeAncestors[node.Owner]; !ok {
treeAncestors[node.Owner] = make(containers.Set[btrfsprim.ObjID])
}
for _, edge := range scanData.EdgesTo[laddr] {
if edge.FromTree != node.Owner {
if err := checkNodeExpectations(*edge, node); err != nil {
//dlog.Errorf(ctx, "... ignoring keypointer %v because %v", edge.String(), err)
} else {
treeAncestors[node.Owner].Insert(edge.FromTree)
}
}
}
}
return treeAncestors
}
func (m uuidMap) considerAncestors(ctx context.Context, treeAncestors map[btrfsprim.ObjID]containers.Set[btrfsprim.ObjID]) {
if missing := m.missingRootItems(); len(missing) == 0 {
return
} else {
dlog.Infof(ctx, "Rebuilding %d root items...", len(missing))
}
fa := newFullAncestorLister(m, treeAncestors)
for _, missingRoot := range maps.SortedKeys(m.missingRootItems()) {
if _, ok := m.TreeParent[missingRoot]; ok {
// This one is incomplete because it doesn't have a UUID, not
// because it doesn't have a parent.
continue
}
potentialParents := make(containers.Set[btrfsprim.ObjID])
potentialParents.InsertFrom(fa.GetFullAncestors(missingRoot))
for _, ancestor := range maps.SortedKeys(fa.GetFullAncestors(missingRoot)) {
potentialParents.DeleteFrom(fa.GetFullAncestors(ancestor))
}
if len(potentialParents) == 1 {
parent := potentialParents.TakeOne()
dlog.Infof(ctx, "... the parent of %v is %v", missingRoot, parent)
parentUUID, ok := m.ObjID2UUID[parent]
if !ok {
dlog.Errorf(ctx, "... but can't synthesize a root item because UUID of %v is unknown", parent)
continue
}
m.TreeParent[missingRoot] = parentUUID
}
}
if missing := m.missingRootItems(); len(missing) > 0 {
dlog.Errorf(ctx, "... could not rebuild root items for %d trees: %v", len(missing), maps.SortedKeys(missing))
} else {
dlog.Info(ctx, "... rebuilt all root items")
}
}
*/
|
