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
|
// Copyright (C) 2022-2023 Luke Shumaker <lukeshu@lukeshu.com>
//
// SPDX-License-Identifier: GPL-2.0-or-later
package btrfs
import (
"context"
"fmt"
"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/containers"
"git.lukeshu.com/btrfs-progs-ng/lib/textui"
)
// This file is ordered from low-level to high-level.
// btrfstree.NodeFile //////////////////////////////////////////////////////////
type treeInfo struct {
UUID btrfsprim.UUID
ParentUUID btrfsprim.UUID
ParentGen btrfsprim.Generation
}
func (fs *FS) populateTreeUUIDs(ctx context.Context) {
if fs.cacheObjID2All != nil && fs.cacheUUID2ObjID != nil {
return
}
fs.cacheObjID2All = make(map[btrfsprim.ObjID]treeInfo)
fs.cacheUUID2ObjID = make(map[btrfsprim.UUID]btrfsprim.ObjID)
fs.TreeWalk(ctx, btrfsprim.ROOT_TREE_OBJECTID,
func(err *btrfstree.TreeError) {
// do nothing
},
btrfstree.TreeWalkHandler{
Item: func(_ btrfstree.Path, item btrfstree.Item) {
itemBody, ok := item.Body.(*btrfsitem.Root)
if !ok {
return
}
fs.cacheObjID2All[item.Key.ObjectID] = treeInfo{
UUID: itemBody.UUID,
ParentUUID: itemBody.ParentUUID,
ParentGen: btrfsprim.Generation(item.Key.Offset),
}
fs.cacheUUID2ObjID[itemBody.UUID] = item.Key.ObjectID
},
},
)
}
// ParentTree implements btrfstree.NodeFile.
func (fs *FS) ParentTree(tree btrfsprim.ObjID) (btrfsprim.ObjID, btrfsprim.Generation, bool) {
if tree < btrfsprim.FIRST_FREE_OBJECTID || tree > btrfsprim.LAST_FREE_OBJECTID {
// no parent
return 0, 0, true
}
fs.populateTreeUUIDs(context.TODO())
all, ok := fs.cacheObjID2All[tree]
if !ok {
// could not look up parent info
return 0, 0, false
}
if all.ParentUUID == (btrfsprim.UUID{}) {
// no parent
return 0, 0, true
}
parentObjID, ok := fs.cacheUUID2ObjID[all.ParentUUID]
if !ok {
// could not look up parent info
return 0, 0, false
}
return parentObjID, all.ParentGen, true
}
var _ btrfstree.NodeFile = (*FS)(nil)
// btrfstree.NodeSource ////////////////////////////////////////////////////////
type nodeCacheEntry struct {
node *btrfstree.Node
err error
}
// AcquireNode implements btrfstree.NodeSource.
func (fs *FS) AcquireNode(ctx context.Context, addr btrfsvol.LogicalAddr, exp btrfstree.NodeExpectations) (*btrfstree.Node, error) {
if fs.cacheNodes == nil {
fs.cacheNodes = containers.NewARCache[btrfsvol.LogicalAddr, nodeCacheEntry](
textui.Tunable(4*(btrfstree.MaxLevel+1)),
containers.SourceFunc[btrfsvol.LogicalAddr, nodeCacheEntry](fs.readNode),
)
}
nodeEntry := fs.cacheNodes.Acquire(ctx, addr)
if nodeEntry.err != nil {
err := nodeEntry.err
fs.cacheNodes.Release(addr)
return nil, err
}
if nodeEntry.node != nil {
if err := exp.Check(nodeEntry.node); err != nil {
fs.cacheNodes.Release(addr)
return nil, fmt.Errorf("btrfstree.ReadNode: node@%v: %w", addr, err) // fmt.Errorf("btrfs.FS.AcquireNode: node@%v: %w", addr, err)
}
}
return nodeEntry.node, nil
}
// ReleaseNode implements btrfstree.NodeSource.
func (fs *FS) ReleaseNode(node *btrfstree.Node) {
if node == nil {
return
}
fs.cacheNodes.Release(node.Head.Addr)
}
func (fs *FS) readNode(_ context.Context, addr btrfsvol.LogicalAddr, nodeEntry *nodeCacheEntry) {
nodeEntry.node.RawFree()
nodeEntry.node = nil
sb, err := fs.Superblock()
if err != nil {
nodeEntry.err = err
return
}
nodeEntry.node, nodeEntry.err = btrfstree.ReadNode[btrfsvol.LogicalAddr](fs, *sb, addr)
}
var _ btrfstree.NodeSource = (*FS)(nil)
// btrfstree.TreeOperator //////////////////////////////////////////////////////
// TreeWalk implements btrfstree.TreeOperator.
func (fs *FS) TreeWalk(ctx context.Context, treeID btrfsprim.ObjID, errHandle func(*btrfstree.TreeError), cbs btrfstree.TreeWalkHandler) {
btrfstree.TreeOperatorImpl{NodeSource: fs}.TreeWalk(ctx, treeID, errHandle, cbs)
}
// TreeLookup implements btrfstree.TreeOperator.
func (fs *FS) TreeLookup(treeID btrfsprim.ObjID, key btrfsprim.Key) (btrfstree.Item, error) {
return btrfstree.TreeOperatorImpl{NodeSource: fs}.TreeLookup(treeID, key)
}
// TreeSearch implements btrfstree.TreeOperator.
func (fs *FS) TreeSearch(treeID btrfsprim.ObjID, searcher btrfstree.TreeSearcher) (btrfstree.Item, error) {
return btrfstree.TreeOperatorImpl{NodeSource: fs}.TreeSearch(treeID, searcher)
}
// TreeSearchAll implements btrfstree.TreeOperator.
func (fs *FS) TreeSearchAll(treeID btrfsprim.ObjID, searcher btrfstree.TreeSearcher) ([]btrfstree.Item, error) {
return btrfstree.TreeOperatorImpl{NodeSource: fs}.TreeSearchAll(treeID, searcher)
}
var _ btrfstree.TreeOperator = (*FS)(nil)
|
