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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
|
// 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"
"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfsitem"
"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"
"git.lukeshu.com/btrfs-progs-ng/lib/containers"
"git.lukeshu.com/btrfs-progs-ng/lib/maps"
)
type nodeData struct {
Level uint8 // 0+1=1
Generation btrfsprim.Generation // 1+8=9
Owner btrfsprim.ObjID // 9+8=17
MinItem btrfsprim.Key // 17+17=34
MaxItem btrfsprim.Key // 34+17=51
}
type kpData struct {
From, To btrfsvol.LogicalAddr // 0+(2*8)=16
Key btrfsprim.Key // 16+17=33
Generation btrfsprim.Generation // 33+8=41
}
type nodeGraph struct {
Nodes map[btrfsvol.LogicalAddr]nodeData
EdgesFrom map[btrfsvol.LogicalAddr][]*kpData
EdgesTo map[btrfsvol.LogicalAddr][]*kpData
}
type scanResult struct {
uuidMap
nodeGraph
}
func ScanDevices(ctx context.Context, fs *btrfs.FS, scanResults btrfsinspect.ScanDevicesResult) (*scanResult, error) {
dlog.Infof(ctx, "Building table of ObjID←→UUID...")
sb, err := fs.Superblock()
if err != nil {
return nil, err
}
lastPct := -1
total := countNodes(scanResults)
done := 0
progress := func() {
pct := int(100 * float64(done) / float64(total))
if pct != lastPct || done == total {
dlog.Infof(ctx, "... %v%% (%v/%v)",
pct, done, total)
lastPct = pct
}
}
ret := &scanResult{
uuidMap: uuidMap{
ObjID2UUID: make(map[btrfsprim.ObjID]btrfsprim.UUID),
UUID2ObjID: make(map[btrfsprim.UUID]btrfsprim.ObjID),
TreeParent: make(map[btrfsprim.ObjID]btrfsprim.UUID),
SeenTrees: make(containers.Set[btrfsprim.ObjID]),
},
nodeGraph: nodeGraph{
Nodes: make(map[btrfsvol.LogicalAddr]nodeData),
EdgesFrom: make(map[btrfsvol.LogicalAddr][]*kpData),
EdgesTo: make(map[btrfsvol.LogicalAddr][]*kpData),
},
}
// These 4 trees are mentioned directly in the superblock, so
// they are always seen.
ret.SeenTrees.Insert(btrfsprim.ROOT_TREE_OBJECTID)
ret.SeenTrees.Insert(btrfsprim.CHUNK_TREE_OBJECTID)
ret.SeenTrees.Insert(btrfsprim.TREE_LOG_OBJECTID)
ret.SeenTrees.Insert(btrfsprim.BLOCK_GROUP_TREE_OBJECTID)
progress()
for _, devResults := range scanResults {
for laddr := range devResults.FoundNodes {
nodeRef, err := btrfstree.ReadNode[btrfsvol.LogicalAddr](fs, *sb, laddr, btrfstree.NodeExpectations{
LAddr: containers.Optional[btrfsvol.LogicalAddr]{OK: true, Val: laddr},
})
if err != nil {
return nil, err
}
// UUID map rebuilding
for _, item := range nodeRef.Data.BodyLeaf {
switch itemBody := item.Body.(type) {
case btrfsitem.Root:
if err := maybeSet("ObjID2UUID", ret.ObjID2UUID, item.Key.ObjectID, itemBody.UUID); err != nil {
return nil, err
}
if itemBody.UUID != (btrfsprim.UUID{}) {
if err := maybeSet("UUID2ObjID", ret.UUID2ObjID, itemBody.UUID, item.Key.ObjectID); err != nil {
return nil, err
}
}
if err := maybeSet("ParentUUID", ret.TreeParent, item.Key.ObjectID, itemBody.ParentUUID); err != nil {
return nil, err
}
ret.SeenTrees.Insert(item.Key.ObjectID)
case btrfsitem.UUIDMap:
uuid := btrfsitem.KeyToUUID(item.Key)
if err := maybeSet("ObjID2UUID", ret.ObjID2UUID, itemBody.ObjID, uuid); err != nil {
return nil, err
}
if err := maybeSet("UUID2ObjID", ret.UUID2ObjID, uuid, itemBody.ObjID); err != nil {
return nil, err
}
}
}
ret.SeenTrees.Insert(nodeRef.Data.Head.Owner)
// graph building
ret.Nodes[laddr] = nodeData{
Level: nodeRef.Data.Head.Level,
Generation: nodeRef.Data.Head.Generation,
Owner: nodeRef.Data.Head.Owner,
MinItem: func() btrfsprim.Key { k, _ := nodeRef.Data.MinItem(); return k }(),
MaxItem: func() btrfsprim.Key { k, _ := nodeRef.Data.MaxItem(); return k }(),
}
for _, kp := range nodeRef.Data.BodyInternal {
dat := &kpData{
From: laddr,
To: kp.BlockPtr,
Key: kp.Key,
Generation: kp.Generation,
}
ret.EdgesFrom[laddr] = append(ret.EdgesFrom[laddr], dat)
ret.EdgesTo[laddr] = append(ret.EdgesTo[laddr], dat)
}
done++
progress()
}
}
if done != total {
panic("should not happen")
}
missing := ret.missingRootItems()
if len(missing) > 0 {
dlog.Errorf(ctx, "... could not find root items for %d trees: %v", len(missing), maps.SortedKeys(missing))
}
dlog.Info(ctx, "... done building table")
return ret, nil
}
|
