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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
|
// Copyright (C) 2022 Luke Shumaker <lukeshu@lukeshu.com>
//
// SPDX-License-Identifier: GPL-2.0-or-later
package rebuildnodes
import (
"context"
"errors"
iofs "io/fs"
"strings"
"github.com/datawire/dlib/dlog"
"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfstree"
"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfsvol"
"git.lukeshu.com/btrfs-progs-ng/lib/btrfsprogs/btrfsinspect"
"git.lukeshu.com/btrfs-progs-ng/lib/btrfsprogs/btrfsutil"
"git.lukeshu.com/btrfs-progs-ng/lib/diskio"
)
func lostAndFoundNodes(ctx context.Context, fs _FS, nodeScanResults btrfsinspect.ScanDevicesResult) (map[btrfsvol.LogicalAddr]struct{}, error) {
lastPct := -1
total := countNodes(nodeScanResults)
progress := func(done int) {
pct := int(100 * float64(done) / float64(total))
if pct != lastPct || done == total {
dlog.Infof(ctx, "... %v%% (%v/%v)",
pct, done, total)
lastPct = pct
}
}
attachedNodes := make(map[btrfsvol.LogicalAddr]struct{})
btrfsutil.WalkAllTrees(ctx, fs, btrfsutil.WalkAllTreesHandler{
TreeWalkHandler: btrfstree.TreeWalkHandler{
Node: func(path btrfstree.TreePath, _ *diskio.Ref[btrfsvol.LogicalAddr, btrfstree.Node]) error {
addr := path.Node(-1).ToNodeAddr
if _, alreadyVisited := attachedNodes[addr]; alreadyVisited {
// Can happen because of COW subvolumes;
// this is really a DAG not a tree.
return iofs.SkipDir
}
attachedNodes[addr] = struct{}{}
progress(len(attachedNodes))
return nil
},
},
Err: func(err *btrfsutil.WalkError) {
// do nothing
if !errors.Is(err, btrfstree.ErrNotANode) && !strings.Contains(err.Error(), "read: could not map logical address") {
dlog.Errorf(ctx, "dbg walk err: %v", err)
}
},
})
orphanedNodes := make(map[btrfsvol.LogicalAddr]int)
for _, devResults := range nodeScanResults {
for laddr := range devResults.FoundNodes {
if _, attached := attachedNodes[laddr]; !attached {
orphanedNodes[laddr] = 0
}
}
}
dlog.Infof(ctx,
"... (finished processing %v attached nodes, proceeding to process %v lost nodes, for a total of %v)",
len(attachedNodes), len(orphanedNodes), len(attachedNodes)+len(orphanedNodes))
// 'orphanedRoots' is a subset of 'orphanedNodes'; start with
// it as the complete orphanedNodes, and then remove entries.
orphanedRoots := make(map[btrfsvol.LogicalAddr]struct{}, len(orphanedNodes))
for node := range orphanedNodes {
orphanedRoots[node] = struct{}{}
}
done := len(attachedNodes)
for potentialRoot := range orphanedRoots {
done++
progress(done)
if orphanedNodes[potentialRoot] > 1 {
continue
}
walkCtx, cancel := context.WithCancel(ctx)
walkFromNode(walkCtx, fs, potentialRoot,
func(err *btrfstree.TreeError) {
// do nothing
},
btrfstree.TreeWalkHandler{
PreNode: func(path btrfstree.TreePath) error {
nodeAddr := path.Node(-1).ToNodeAddr
if nodeAddr != potentialRoot {
delete(orphanedRoots, nodeAddr)
}
visitCnt := orphanedNodes[nodeAddr] + 1
orphanedNodes[nodeAddr] = visitCnt
if visitCnt > 1 {
cancel()
}
return nil
},
},
)
}
return orphanedRoots, nil
}
|
