blob: 32a34d1cd347a490b076e80b328f408d40268f52 (
plain)
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
|
// Copyright (C) 2022 Luke Shumaker <lukeshu@lukeshu.com>
//
// SPDX-License-Identifier: GPL-2.0-or-later
package uuidmap
import (
"git.lukeshu.com/btrfs-progs-ng/lib/btrfs/btrfsprim"
"git.lukeshu.com/btrfs-progs-ng/lib/containers"
)
type UUIDMap struct {
ObjID2UUID map[btrfsprim.ObjID]btrfsprim.UUID
UUID2ObjID map[btrfsprim.UUID]btrfsprim.ObjID
TreeParent map[btrfsprim.ObjID]btrfsprim.UUID
SeenTrees containers.Set[btrfsprim.ObjID]
}
func (m UUIDMap) MissingRootItems() containers.Set[btrfsprim.ObjID] {
missing := make(containers.Set[btrfsprim.ObjID])
for treeID := range m.SeenTrees {
if _, ok := m.ObjID2UUID[treeID]; !ok && treeID != btrfsprim.ROOT_TREE_OBJECTID {
missing.Insert(treeID)
continue
}
if _, ok := m.TreeParent[treeID]; !ok && treeID >= btrfsprim.FIRST_FREE_OBJECTID && treeID <= btrfsprim.LAST_FREE_OBJECTID {
missing.Insert(treeID)
}
}
return missing
}
// ParentTree implements btrfstree.NodeFile.
func (m UUIDMap) ParentTree(tree btrfsprim.ObjID) (btrfsprim.ObjID, bool) {
if tree < btrfsprim.FIRST_FREE_OBJECTID || tree > btrfsprim.LAST_FREE_OBJECTID {
// no parent
return 0, true
}
parentUUID, ok := m.TreeParent[tree]
if !ok {
// could not look up parent info
return 0, false
}
if parentUUID == (btrfsprim.UUID{}) {
// no parent
return 0, true
}
parentObjID, ok := m.UUID2ObjID[parentUUID]
if !ok {
// could not look up parent info
return 0, false
}
return parentObjID, true
}
|
