btrfsutil: RebuiltForrest: Have LookupRoot return an error

1 files changed, 10 insertions, 10 deletions

diff --git a/lib/btrfsutil/rebuilt_forrest_test.go b/lib/btrfsutil/rebuilt_forrest_test.go
index ef0ed72..86ae9a7 100644
--- a/lib/btrfsutil/rebuilt_forrest_test.go
+++ b/lib/btrfsutil/rebuilt_forrest_test.go
@@ -20,7 +20,7 @@ import (
 type rebuiltForrestCallbacks struct {
 	addedItem  func(ctx context.Context, tree btrfsprim.ObjID, key btrfsprim.Key)
 	addedRoot  func(ctx context.Context, tree btrfsprim.ObjID, root btrfsvol.LogicalAddr)
-	lookupRoot func(ctx context.Context, tree btrfsprim.ObjID) (offset btrfsprim.Generation, item btrfsitem.Root, ok bool)
+	lookupRoot func(ctx context.Context, tree btrfsprim.ObjID) (offset btrfsprim.Generation, item btrfsitem.Root, err error)
 	lookupUUID func(ctx context.Context, uuid btrfsprim.UUID) (id btrfsprim.ObjID, err error)
 }
 
@@ -32,7 +32,7 @@ func (cbs rebuiltForrestCallbacks) AddedRoot(ctx context.Context, tree btrfsprim
 	cbs.addedRoot(ctx, tree, root)
 }
 
-func (cbs rebuiltForrestCallbacks) LookupRoot(ctx context.Context, tree btrfsprim.ObjID) (offset btrfsprim.Generation, item btrfsitem.Root, ok bool) {
+func (cbs rebuiltForrestCallbacks) LookupRoot(ctx context.Context, tree btrfsprim.ObjID) (offset btrfsprim.Generation, item btrfsitem.Root, err error) {
 	return cbs.lookupRoot(ctx, tree)
 }
 
@@ -85,17 +85,17 @@ func TestRebuiltTreeCycles(t *testing.T) {
 		addedRoot: func(ctx context.Context, tree btrfsprim.ObjID, root btrfsvol.LogicalAddr) {
 			// do nothing
 		},
-		lookupRoot: func(ctx context.Context, tree btrfsprim.ObjID) (offset btrfsprim.Generation, item btrfsitem.Root, ok bool) {
+		lookupRoot: func(ctx context.Context, tree btrfsprim.ObjID) (offset btrfsprim.Generation, item btrfsitem.Root, err error) {
 			for _, root := range roots {
 				if root.ID == tree {
 					return root.ParentGen, btrfsitem.Root{
 						Generation: 2000,
 						UUID:       root.UUID,
 						ParentUUID: root.ParentUUID,
-					}, true
+					}, nil
 				}
 			}
-			return 0, btrfsitem.Root{}, false
+			return 0, btrfsitem.Root{}, btrfstree.ErrNoItem
 		},
 		lookupUUID: func(ctx context.Context, uuid btrfsprim.UUID) (id btrfsprim.ObjID, err error) {
 			for _, root := range roots {
@@ -194,10 +194,10 @@ func TestRebuiltTreeParentErr(t *testing.T) {
 		addedRoot: func(ctx context.Context, tree btrfsprim.ObjID, root btrfsvol.LogicalAddr) {
 			// do nothing
 		},
-		lookupRoot: func(ctx context.Context, tree btrfsprim.ObjID) (offset btrfsprim.Generation, item btrfsitem.Root, ok bool) {
+		lookupRoot: func(ctx context.Context, tree btrfsprim.ObjID) (offset btrfsprim.Generation, item btrfsitem.Root, err error) {
 			if tree == 304 {
 				// Force a fault.
-				return 0, btrfsitem.Root{}, false
+				return 0, btrfsitem.Root{}, btrfstree.ErrNoItem
 			}
 			for _, root := range roots {
 				if root.ID == tree {
@@ -205,10 +205,10 @@ func TestRebuiltTreeParentErr(t *testing.T) {
 						Generation: 2000,
 						UUID:       root.UUID,
 						ParentUUID: root.ParentUUID,
-					}, true
+					}, nil
 				}
 			}
-			return 0, btrfsitem.Root{}, false
+			return 0, btrfsitem.Root{}, btrfstree.ErrNoItem
 		},
 		lookupUUID: func(ctx context.Context, uuid btrfsprim.UUID) (id btrfsprim.ObjID, err error) {
 			for _, root := range roots {
@@ -225,7 +225,7 @@ func TestRebuiltTreeParentErr(t *testing.T) {
 		rfs := NewRebuiltForrest(nil, Graph{}, cbs, false)
 
 		tree, err := rfs.RebuiltTree(ctx, 305)
-		assert.EqualError(t, err, `failed to rebuild parent tree: 304: tree does not exist`)
+		assert.EqualError(t, err, `failed to rebuild parent tree: 304: tree does not exist: item does not exist`)
 		assert.Nil(t, tree)
 	})