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
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
|
// 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/btrfs/btrfstree"
"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfsvol"
"git.lukeshu.com/btrfs-progs-ng/lib/btrfsprogs/btrfsinspect/rebuildnodes/graph"
"git.lukeshu.com/btrfs-progs-ng/lib/containers"
"git.lukeshu.com/btrfs-progs-ng/lib/diskio"
"git.lukeshu.com/btrfs-progs-ng/lib/maps"
)
func listRoots(graph graph.Graph, leaf btrfsvol.LogicalAddr) containers.Set[btrfsvol.LogicalAddr] {
kps := graph.EdgesTo[leaf]
if len(kps) == 0 {
return containers.NewSet(leaf)
}
ret := make(containers.Set[btrfsvol.LogicalAddr])
for _, kp := range kps {
ret.InsertFrom(listRoots(graph, kp.FromNode))
}
return ret
}
func walk(graph graph.Graph, root btrfsvol.LogicalAddr, fn func(btrfsvol.LogicalAddr) bool) {
if _, ok := graph.Nodes[root]; !ok {
return
}
if !fn(root) {
return
}
for _, kp := range graph.EdgesFrom[root] {
walk(graph, kp.ToNode, fn)
}
}
type keyAndTree struct {
btrfsprim.Key
TreeID btrfsprim.ObjID
}
func (a keyAndTree) Cmp(b keyAndTree) int {
if d := a.Key.Cmp(b.Key); d != 0 {
return d
}
return containers.NativeCmp(a.TreeID, b.TreeID)
}
func indexOrphans(ctx context.Context, fs diskio.File[btrfsvol.LogicalAddr], sb btrfstree.Superblock, graph graph.Graph) (
orphans containers.Set[btrfsvol.LogicalAddr],
leaf2orphans map[btrfsvol.LogicalAddr]containers.Set[btrfsvol.LogicalAddr],
key2leaf *containers.SortedMap[keyAndTree, btrfsvol.LogicalAddr],
err error,
) {
dlog.Info(ctx, "... counting orphans")
orphans = make(containers.Set[btrfsvol.LogicalAddr])
for node := range graph.Nodes {
if len(graph.EdgesTo[node]) == 0 {
orphans.Insert(node)
}
}
leaf2orphans = make(map[btrfsvol.LogicalAddr]containers.Set[btrfsvol.LogicalAddr])
visited := make(containers.Set[btrfsvol.LogicalAddr])
lastPct, lastVisited, lastLeafs := -1, 0, 0
total := len(orphans)
done := 0
progress := func() {
pct := int(100 * float64(done) / float64(total))
if pct != lastPct || (len(visited) != lastVisited && len(visited)%500 == 0) || len(leaf2orphans) != lastLeafs || done == total {
dlog.Infof(ctx, "... crawling orphans %v%% (%v/%v); visited %d nodes, found %d leaf nodes",
pct, done, total, len(visited), len(leaf2orphans))
lastPct = pct
lastVisited = len(visited)
lastLeafs = len(leaf2orphans)
}
}
progress()
for _, orphan := range maps.SortedKeys(orphans) {
walk(graph, orphan, func(node btrfsvol.LogicalAddr) bool {
if visited.Has(node) {
return false
}
visited.Insert(node)
if graph.Nodes[node].Level == 0 {
if roots := listRoots(graph, node); !roots.Has(0) {
leaf2orphans[node] = roots
}
}
progress()
return true
})
done++
progress()
}
key2leaf = new(containers.SortedMap[keyAndTree, btrfsvol.LogicalAddr])
total = len(leaf2orphans)
done = 0
progress = func() {
pct := int(100 * float64(done) / float64(total))
if pct != lastPct || done == total {
dlog.Infof(ctx, "... reading leafs %v%% (%v/%v)",
pct, done, total)
lastPct = pct
}
}
progress()
for _, laddr := range maps.SortedKeys(leaf2orphans) {
nodeRef, err := btrfstree.ReadNode[btrfsvol.LogicalAddr](fs, sb, laddr, btrfstree.NodeExpectations{
LAddr: containers.Optional[btrfsvol.LogicalAddr]{OK: true, Val: laddr},
Level: containers.Optional[uint8]{OK: true, Val: 0},
})
if err != nil {
return nil, nil, nil, err
}
for _, item := range nodeRef.Data.BodyLeaf {
k := keyAndTree{
Key: item.Key,
TreeID: nodeRef.Data.Head.Owner,
}
if cur, ok := key2leaf.Load(k); !ok || graph.Nodes[cur].Generation < nodeRef.Data.Head.Generation {
key2leaf.Store(k, laddr)
}
}
done++
progress()
}
return orphans, leaf2orphans, key2leaf, nil
}
|
