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
|
package btrfsmisc
import (
"fmt"
"lukeshu.com/btrfs-tools/pkg/btrfs"
"lukeshu.com/btrfs-tools/pkg/btrfs/btrfsitem"
"lukeshu.com/btrfs-tools/pkg/btrfs/btrfsvol"
"lukeshu.com/btrfs-tools/pkg/util"
)
type WalkErr struct {
TreeName string
Path btrfs.TreePath
Err error
}
func (e WalkErr) Unwrap() error { return e.Err }
func (e WalkErr) Error() string {
if len(e.Path) == 0 {
return fmt.Sprintf("%v: %v", e.TreeName, e.Err)
}
return fmt.Sprintf("%v: %v: %v", e.TreeName, e.Path, e.Err)
}
type WalkFSHandler struct {
Err func(error)
// Callbacks for entire trees
PreTree func(name string, laddr btrfsvol.LogicalAddr)
PostTree func(name string, laddr btrfsvol.LogicalAddr)
// Callbacks for nodes or smaller
btrfs.TreeWalkHandler
}
// WalkFS walks all trees in a *btrfs.FS. Rather than returning an
// error, it calls errCb each time an error is encountered. The error
// will always be of type WalkErr.
func WalkFS(fs *btrfs.FS, cbs WalkFSHandler) {
var treeName string
handleErr := func(path btrfs.TreePath, err error) {
cbs.Err(WalkErr{
TreeName: treeName,
Path: path,
Err: err,
})
}
var foundTrees []struct {
Name string
Root btrfsvol.LogicalAddr
}
origItem := cbs.Item
cbs.Item = func(path btrfs.TreePath, item btrfs.Item) error {
if item.Head.Key.ItemType == btrfsitem.ROOT_ITEM_KEY {
root, ok := item.Body.(btrfsitem.Root)
if !ok {
handleErr(path, fmt.Errorf("ROOT_ITEM_KEY is a %T, not a btrfsitem.Root", item.Body))
} else {
foundTrees = append(foundTrees, struct {
Name string
Root btrfsvol.LogicalAddr
}{
Name: fmt.Sprintf("tree %v (via %v %v)",
item.Head.Key.ObjectID.Format(0), treeName, path),
Root: root.ByteNr,
})
}
}
if origItem != nil {
return origItem(path, item)
}
return nil
}
origNode := cbs.Node
cbs.Node = func(path btrfs.TreePath, node *util.Ref[btrfsvol.LogicalAddr, btrfs.Node], err error) error {
if err != nil {
handleErr(path, err)
}
if node != nil && origNode != nil {
return origNode(path, node, nil)
}
return nil
}
treeName = "superblock"
superblock, err := fs.Superblock()
if err != nil {
handleErr(nil, err)
return
}
treeName = "root tree"
cbs.PreTree(treeName, superblock.Data.RootTree)
if err := fs.TreeWalk(superblock.Data.RootTree, cbs.TreeWalkHandler); err != nil {
handleErr(nil, err)
}
cbs.PostTree(treeName, superblock.Data.RootTree)
treeName = "chunk tree"
cbs.PreTree(treeName, superblock.Data.ChunkTree)
if err := fs.TreeWalk(superblock.Data.ChunkTree, cbs.TreeWalkHandler); err != nil {
handleErr(nil, err)
}
cbs.PostTree(treeName, superblock.Data.ChunkTree)
treeName = "log tree"
cbs.PreTree(treeName, superblock.Data.LogTree)
if err := fs.TreeWalk(superblock.Data.LogTree, cbs.TreeWalkHandler); err != nil {
handleErr(nil, err)
}
cbs.PostTree(treeName, superblock.Data.LogTree)
treeName = "block group tree"
cbs.PreTree(treeName, superblock.Data.BlockGroupRoot)
if err := fs.TreeWalk(superblock.Data.BlockGroupRoot, cbs.TreeWalkHandler); err != nil {
handleErr(nil, err)
}
cbs.PostTree(treeName, superblock.Data.BlockGroupRoot)
for _, tree := range foundTrees {
treeName = tree.Name
cbs.PreTree(treeName, tree.Root)
if err := fs.TreeWalk(tree.Root, cbs.TreeWalkHandler); err != nil {
handleErr(nil, err)
}
cbs.PostTree(treeName, tree.Root)
}
}
|
