This repository has been archived by the owner on Aug 15, 2020. It is now read-only.
/
fsck_test.go
92 lines (76 loc) · 2.69 KB
/
fsck_test.go
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
/* Copyright 2012 Marc-Antoine Ruel. Licensed under the Apache License, Version
2.0 (the "License"); you may not use this file except in compliance with the
License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0. Unless required by applicable law or
agreed to in writing, software distributed under the License is distributed on
an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express
or implied. See the License for the specific language governing permissions and
limitations under the License. */
package main
import (
"testing"
"github.com/maruel/dumbcas/dumbcaslib"
"github.com/maruel/ut"
)
func TestFsckEmpty(t *testing.T) {
t.Parallel()
f := makeDumbcasAppMock(t)
args := []string{"fsck", "-root=\\test_fsck_empty"}
f.Run(args, 0)
items, err := dumbcaslib.EnumerateCasAsList(f.cas)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, []string{}, items)
nodes, err := dumbcaslib.EnumerateNodesAsList(f.nodes)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, []string{}, nodes)
}
func TestFsckCorruptCasFile(t *testing.T) {
t.Parallel()
f := makeDumbcasAppMock(t)
args := []string{"fsck", "-root=\\test_fsck_cas"}
f.Run(args, 0)
archiveData(f.TB, f.cas, f.nodes, map[string]string{
"file1": "content1",
"dir1/dir2/file2": "content2",
})
i1, err := dumbcaslib.EnumerateCasAsList(f.cas)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 3, len(i1))
// Corrupt an item in CasTable.
f.cas.(dumbcaslib.Corruptable).Corrupt()
i1, err = dumbcaslib.EnumerateCasAsList(f.cas)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 4, len(i1))
f.Run(args, 0)
// One entry disapeared. I hope you had a valid secondary copy of your
// CasTable.
i1, err = dumbcaslib.EnumerateCasAsList(f.cas)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 3, len(i1))
// Note: The node is not quarantined, because in theory the data could be
// found on another copy of the CasTable so it's preferable to not delete the
// node.
n1, err := dumbcaslib.EnumerateNodesAsList(f.nodes)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 2, len(n1))
}
func TestFsckCorruptNodeEntry(t *testing.T) {
t.Parallel()
f := makeDumbcasAppMock(t)
args := []string{"fsck", "-root=\\test_fsck_corrupt"}
f.Run(args, 0)
// Create a tree of stuff.
archiveData(f.TB, f.cas, f.nodes, map[string]string{
"file1": "content1",
"dir1/dir2/file2": "content2",
})
// Corrupt an item in NodesTable.
f.nodes.(dumbcaslib.Corruptable).Corrupt()
f.Run(args, 0)
i1, err := dumbcaslib.EnumerateCasAsList(f.cas)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 3, len(i1))
n1, err := dumbcaslib.EnumerateNodesAsList(f.nodes)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 1, len(n1))
}