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
|
// Copyright (C) 2022-2023 Luke Shumaker <lukeshu@lukeshu.com>
//
// SPDX-License-Identifier: GPL-2.0-or-later
package btrfstree
import (
"context"
"errors"
"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/btrfsvol"
)
// LookupTreeRoot //////////////////////////////////////////////////////////////
// A TreeRoot is more-or-less a btrfsitem.Root, but simpler; returned by
// LookupTreeRoot.
type TreeRoot struct {
ID btrfsprim.ObjID
RootNode btrfsvol.LogicalAddr
Level uint8
Generation btrfsprim.Generation
RootInode btrfsprim.ObjID // only for subvolume trees
ParentUUID btrfsprim.UUID
ParentGen btrfsprim.Generation // offset of this tree's root item
}
// LookupTreeRoot is a utility function to help with implementing the
// 'Forrest' interface.
//
// The 'forrest' passed to LookupTreeRoot must handle:
//
// forrest.ForrestLookup(ctx, btrfsprim.ROOT_TREE_OBJECTID)
//
// It is OK for forrest.ForrestLookup to recurse and call
// LookupTreeRoot, as LookupTreeRoot will not call ForrestLookup for
// ROOT_TREE_OBJECTID; so it will not be an infinite recursion.
func LookupTreeRoot(ctx context.Context, forrest Forrest, sb Superblock, treeID btrfsprim.ObjID) (*TreeRoot, error) {
return OldLookupTreeRoot(
ctx,
func(rootTreeID btrfsprim.ObjID, searcher TreeSearcher) (Item, error) {
rootTree, err := forrest.ForrestLookup(ctx, rootTreeID)
if err != nil {
return Item{}, err
}
rootItem, err := rootTree.TreeSearch(ctx, searcher)
if err != nil {
return Item{}, err
}
return rootItem, nil
},
sb,
treeID,
)
}
// OldLookupTreeRoot is a utility function to help with implementing
// the old 'TreeOperator' interface.
func OldLookupTreeRoot(_ context.Context, treeSearch func(treeID btrfsprim.ObjID, _ TreeSearcher) (Item, error), sb Superblock, treeID btrfsprim.ObjID) (*TreeRoot, error) {
switch treeID {
case btrfsprim.ROOT_TREE_OBJECTID:
return &TreeRoot{
ID: treeID,
RootNode: sb.RootTree,
Level: sb.RootLevel,
Generation: sb.Generation, // XXX: same generation as LOG_TREE?
}, nil
case btrfsprim.CHUNK_TREE_OBJECTID:
return &TreeRoot{
ID: treeID,
RootNode: sb.ChunkTree,
Level: sb.ChunkLevel,
Generation: sb.ChunkRootGeneration,
}, nil
case btrfsprim.TREE_LOG_OBJECTID:
return &TreeRoot{
ID: treeID,
RootNode: sb.LogTree,
Level: sb.LogLevel,
Generation: sb.Generation, // XXX: same generation as ROOT_TREE?
}, nil
case btrfsprim.BLOCK_GROUP_TREE_OBJECTID:
return &TreeRoot{
ID: treeID,
RootNode: sb.BlockGroupRoot,
Level: sb.BlockGroupRootLevel,
Generation: sb.BlockGroupRootGeneration,
}, nil
default:
rootItem, err := treeSearch(btrfsprim.ROOT_TREE_OBJECTID, SearchRootItem(treeID))
if err != nil {
if errors.Is(err, ErrNoItem) {
err = fmt.Errorf("%w: %s", ErrNoTree, err)
}
return nil, fmt.Errorf("tree %s: %w", treeID.Format(btrfsprim.ROOT_TREE_OBJECTID), err)
}
switch rootItemBody := rootItem.Body.(type) {
case *btrfsitem.Root:
return &TreeRoot{
ID: treeID,
RootNode: rootItemBody.ByteNr,
Level: rootItemBody.Level,
Generation: rootItemBody.Generation,
RootInode: rootItemBody.RootDirID,
ParentUUID: rootItemBody.ParentUUID,
ParentGen: btrfsprim.Generation(rootItem.Key.Offset),
}, nil
case *btrfsitem.Error:
return nil, fmt.Errorf("malformed ROOT_ITEM for tree %v: %w", treeID, rootItemBody.Err)
default:
panic(fmt.Errorf("should not happen: ROOT_ITEM has unexpected item type: %T", rootItemBody))
}
}
}
// RawForrest //////////////////////////////////////////////////////////////////
// RawForrest implements Forrest.
type RawForrest struct {
NodeSource NodeSource
}
var _ Forrest = RawForrest{}
// RawTree is a variant of ForrestLookup that returns a concrete type
// instead of an interface.
func (forrest RawForrest) RawTree(ctx context.Context, treeID btrfsprim.ObjID) (*RawTree, error) {
sb, err := forrest.NodeSource.Superblock()
if err != nil {
return nil, err
}
rootInfo, err := LookupTreeRoot(ctx, forrest, *sb, treeID)
if err != nil {
return nil, err
}
return &RawTree{
Forrest: forrest,
TreeRoot: *rootInfo,
}, nil
}
// ForrestLookup implements Forrest.
func (forrest RawForrest) ForrestLookup(ctx context.Context, treeID btrfsprim.ObjID) (Tree, error) {
tree, err := forrest.RawTree(ctx, treeID)
if err != nil {
return nil, err
}
return tree, nil
}
// Compat //////////////////////////////////////////////////////////////////////
var _ TreeOperator = RawForrest{}
type TreeOperatorImpl = RawForrest
// TreeWalk implements the 'TreeOperator' interface.
func (forrest RawForrest) TreeWalk(ctx context.Context, treeID btrfsprim.ObjID, errHandle func(*TreeError), cbs TreeWalkHandler) {
tree, err := forrest.RawTree(ctx, treeID)
if err != nil {
errHandle(&TreeError{Path: Path{PathRoot{TreeID: treeID}}, Err: err})
return
}
tree.TreeWalk(ctx, cbs)
}
// TreeLookup implements the 'TreeOperator' interface.
func (forrest RawForrest) TreeLookup(treeID btrfsprim.ObjID, key btrfsprim.Key) (Item, error) {
ctx := context.TODO()
tree, err := forrest.RawTree(ctx, treeID)
if err != nil {
return Item{}, err
}
return tree.TreeLookup(ctx, key)
}
// TreeSearch implements the 'TreeOperator' interface.
func (forrest RawForrest) TreeSearch(treeID btrfsprim.ObjID, searcher TreeSearcher) (Item, error) {
ctx := context.TODO()
tree, err := forrest.RawTree(ctx, treeID)
if err != nil {
return Item{}, err
}
return tree.TreeSearch(ctx, searcher)
}
// TreeSearchAll implements the 'TreeOperator' interface.
func (forrest RawForrest) TreeSearchAll(treeID btrfsprim.ObjID, searcher TreeSearcher) ([]Item, error) {
ctx := context.TODO()
tree, err := forrest.RawTree(ctx, treeID)
if err != nil {
return nil, err
}
var ret []Item
err = tree.TreeSubrange(ctx, 1, searcher, func(item Item) bool {
item.Body = item.Body.CloneItem()
ret = append(ret, item)
return true
})
return ret, err
}
|
