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
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
|
// Copyright (C) 2022 Luke Shumaker <lukeshu@lukeshu.com>
//
// SPDX-License-Identifier: GPL-2.0-or-later
package btrfsinspect
import (
"context"
"sort"
"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/btrfsvol"
"git.lukeshu.com/btrfs-progs-ng/lib/btrfsprogs/btrfsutil"
"git.lukeshu.com/btrfs-progs-ng/lib/util"
)
type ScanOneDevResult struct {
FoundNodes map[btrfsvol.LogicalAddr][]btrfsvol.PhysicalAddr
FoundChunks []btrfs.SysChunk
FoundBlockGroups []SysBlockGroup
FoundDevExtents []SysDevExtent
}
type SysBlockGroup struct {
Key btrfs.Key
BG btrfsitem.BlockGroup
}
type SysDevExtent struct {
Key btrfs.Key
DevExt btrfsitem.DevExtent
}
func (found ScanOneDevResult) AddToLV(ctx context.Context, fs *btrfs.FS, dev *btrfs.Device) {
sb, _ := dev.Superblock()
total := len(found.FoundChunks) + len(found.FoundDevExtents)
for _, paddrs := range found.FoundNodes {
total += len(paddrs)
}
lastProgress := -1
done := 0
printProgress := func() {
pct := int(100 * float64(done) / float64(total))
if pct != lastProgress || done == total {
dlog.Infof(ctx, "... dev[%q] added %v%% of the mappings (%v/%v=>%v)",
dev.Name(), pct, done, total, len(fs.LV.Mappings()))
lastProgress = pct
}
}
printProgress()
for _, chunk := range found.FoundChunks {
for _, mapping := range chunk.Chunk.Mappings(chunk.Key) {
if err := fs.LV.AddMapping(mapping); err != nil {
dlog.Errorf(ctx, "... dev[%q] error: adding chunk: %v",
dev.Name(), err)
}
done++
printProgress()
}
}
for _, ext := range found.FoundDevExtents {
if err := fs.LV.AddMapping(ext.DevExt.Mapping(ext.Key)); err != nil {
dlog.Errorf(ctx, "... dev[%q] error: adding devext: %v",
dev.Name(), err)
}
done++
printProgress()
}
// Do the nodes last to avoid bloating the mappings table too
// much. (Because nodes are numerous and small, while the
// others are few and large; so it is likely that many of the
// nodes will be subsumed by other things.)
//
// Sort them so that progress numbers are predictable.
for _, laddr := range util.SortedMapKeys(found.FoundNodes) {
for _, paddr := range found.FoundNodes[laddr] {
if err := fs.LV.AddMapping(btrfsvol.Mapping{
LAddr: laddr,
PAddr: btrfsvol.QualifiedPhysicalAddr{
Dev: sb.Data.DevItem.DevID,
Addr: paddr,
},
Size: btrfsvol.AddrDelta(sb.Data.NodeSize),
SizeLocked: false,
Flags: nil,
}); err != nil {
dlog.Errorf(ctx, "... dev[%q] error: adding node ident: %v",
dev.Name(), err)
}
done++
printProgress()
}
}
// Use block groups to add missing flags (and as a hint to
// combine node entries).
//
// First dedup them, because they change for allocations and
// CoW means that they'll bounce around a lot, so you likely
// have oodles of duplicates?
type blockgroup struct {
LAddr btrfsvol.LogicalAddr
Size btrfsvol.AddrDelta
Flags btrfsvol.BlockGroupFlags
}
bgsSet := make(map[blockgroup]struct{})
for _, bg := range found.FoundBlockGroups {
bgsSet[blockgroup{
LAddr: btrfsvol.LogicalAddr(bg.Key.ObjectID),
Size: btrfsvol.AddrDelta(bg.Key.Offset),
Flags: bg.BG.Flags,
}] = struct{}{}
}
bgsOrdered := util.MapKeys(bgsSet)
sort.Slice(bgsOrdered, func(i, j int) bool {
return bgsOrdered[i].LAddr < bgsOrdered[j].LAddr
})
for _, bg := range bgsOrdered {
otherLAddr, otherPAddr := fs.LV.ResolveAny(bg.LAddr, bg.Size)
if otherLAddr < 0 || otherPAddr.Addr < 0 {
dlog.Errorf(ctx, "... dev[%q] error: could not pair blockgroup laddr=%v (size=%v flags=%v) with a mapping",
dev.Name(), bg.LAddr, bg.Size, bg.Flags)
continue
}
offsetWithinChunk := otherLAddr.Sub(bg.LAddr)
flags := bg.Flags
mapping := btrfsvol.Mapping{
LAddr: bg.LAddr,
PAddr: btrfsvol.QualifiedPhysicalAddr{
Dev: otherPAddr.Dev,
Addr: otherPAddr.Addr.Add(-offsetWithinChunk),
},
Size: bg.Size,
SizeLocked: true,
Flags: &flags,
}
if err := fs.LV.AddMapping(mapping); err != nil {
dlog.Errorf(ctx, "... dev[%q] error: adding flags from blockgroup: %v",
dev.Name(), err)
}
}
}
func ScanOneDev(ctx context.Context, dev *btrfs.Device, superblock btrfs.Superblock) (ScanOneDevResult, error) {
result := ScanOneDevResult{
FoundNodes: make(map[btrfsvol.LogicalAddr][]btrfsvol.PhysicalAddr),
}
devSize, _ := dev.Size()
lastProgress := -1
err := btrfsutil.ScanForNodes(ctx, dev, superblock, func(nodeRef *util.Ref[btrfsvol.PhysicalAddr, btrfs.Node], err error) {
if err != nil {
dlog.Infof(ctx, "... dev[%q] error: %v", dev.Name(), err)
return
}
result.FoundNodes[nodeRef.Data.Head.Addr] = append(result.FoundNodes[nodeRef.Data.Head.Addr], nodeRef.Addr)
for i, item := range nodeRef.Data.BodyLeaf {
switch item.Head.Key.ItemType {
case btrfsitem.CHUNK_ITEM_KEY:
chunk, ok := item.Body.(btrfsitem.Chunk)
if !ok {
dlog.Errorf(ctx, "... dev[%q] node@%v: item %v: error: type is CHUNK_ITEM_KEY, but struct is %T",
dev.Name(), nodeRef.Addr, i, item.Body)
continue
}
//dlog.Tracef(ctx, "... dev[%q] node@%v: item %v: found chunk",
// dev.Name(), nodeRef.Addr, i)
result.FoundChunks = append(result.FoundChunks, btrfs.SysChunk{
Key: item.Head.Key,
Chunk: chunk,
})
case btrfsitem.BLOCK_GROUP_ITEM_KEY:
bg, ok := item.Body.(btrfsitem.BlockGroup)
if !ok {
dlog.Errorf(ctx, "... dev[%q] node@%v: item %v: error: type is BLOCK_GROUP_ITEM_KEY, but struct is %T",
dev.Name(), nodeRef.Addr, i, item.Body)
continue
}
//dlog.Tracef(ctx, "... dev[%q] node@%v: item %v: found block group",
// dev.Name(), nodeRef.Addr, i)
result.FoundBlockGroups = append(result.FoundBlockGroups, SysBlockGroup{
Key: item.Head.Key,
BG: bg,
})
case btrfsitem.DEV_EXTENT_KEY:
devext, ok := item.Body.(btrfsitem.DevExtent)
if !ok {
dlog.Errorf(ctx, "... dev[%q] node@%v: item %v: error: type is DEV_EXTENT_KEY, but struct is %T",
dev.Name(), nodeRef.Addr, i, item.Body)
continue
}
//dlog.Tracef(ctx, "... dev[%q] node@%v: item %v: found dev extent",
// dev.Name(), nodeRef.Addr, i)
result.FoundDevExtents = append(result.FoundDevExtents, SysDevExtent{
Key: item.Head.Key,
DevExt: devext,
})
}
}
}, func(pos btrfsvol.PhysicalAddr) {
pct := int(100 * float64(pos) / float64(devSize))
if pct != lastProgress || pos == devSize {
dlog.Infof(ctx, "... dev[%q] scanned %v%% (found: %v nodes, %v chunks, %v block groups, %v dev extents)",
dev.Name(), pct,
len(result.FoundNodes),
len(result.FoundChunks),
len(result.FoundBlockGroups),
len(result.FoundDevExtents))
lastProgress = pct
}
})
return result, err
}
|
