This repository has been archived by the owner on Aug 15, 2020. It is now read-only.
/
gc_test.go
109 lines (94 loc) · 3.17 KB
/
gc_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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
/* 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 (
"sort"
"testing"
"github.com/maruel/dumbcas/dumbcaslib"
"github.com/maruel/ut"
)
func TestGcEmpty(t *testing.T) {
t.Parallel()
f := makeDumbcasAppMock(t)
args := []string{"gc", "-root=\\test_gc_empty"}
f.Run(args, 0)
i, err := dumbcaslib.EnumerateCasAsList(f.cas)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, []string{}, i)
}
func TestGcKept(t *testing.T) {
t.Parallel()
f := makeDumbcasAppMock(t)
args := []string{"gc", "-root=\\test_gc_kept"}
f.Run(args, 0) // Instantiate f.cas and f.nodes
// Create a tree of stuff.
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))
n1, err := dumbcaslib.EnumerateNodesAsList(f.nodes)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 2, len(n1))
f.Run(args, 0)
// Nothing disapeared.
i2, err := dumbcaslib.EnumerateCasAsList(f.cas)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, i1, i2)
n2, err := dumbcaslib.EnumerateNodesAsList(f.nodes)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, n1, n2)
}
func TestGcTrim(t *testing.T) {
t.Parallel()
f := makeDumbcasAppMock(t)
args := []string{"gc", "-root=\\test_gc_trim"}
f.Run(args, 0) // Instantiate f.cas and f.nodes
// Create a tree of stuff.
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)
n1, err := dumbcaslib.EnumerateNodesAsList(f.nodes)
ut.AssertEqual(t, nil, err)
// Add anothera tree of stuff.
archiveData(f.TB, f.cas, f.nodes, map[string]string{
"file3": "content3",
"dir1/dir4/file5": "content4",
"dir6/file7": "content5",
"file1a": "content1",
})
i2, err := dumbcaslib.EnumerateCasAsList(f.cas)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 7, len(i2))
n2, err := dumbcaslib.EnumerateNodesAsList(f.nodes)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 3, len(n2))
// Remove the first node and gc.
err = f.nodes.Remove(n1[0])
ut.AssertEqual(t, nil, err)
f.Run(args, 0)
i3, err := dumbcaslib.EnumerateCasAsList(f.cas)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 5, len(i3))
n3, err := dumbcaslib.EnumerateNodesAsList(f.nodes)
ut.AssertEqual(t, nil, err)
ut.AssertEqual(t, 2, len(n3))
// Check both: "n3 == n2 - n1[0]" and "i3 == i2 - i1 + sha1(content1)"
rest := Sub(n2, []string{n1[0]})
ut.AssertEqual(t, n3, rest)
rest = Sub(i2, i1)
rest = append(rest, sha1String("content1"))
sort.Strings(rest)
ut.AssertEqual(t, i3, rest)
}