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
|
package object
import (
"path"
. "gopkg.in/check.v1"
"gopkg.in/src-d/go-git-fixtures.v3"
"gopkg.in/src-d/go-git.v4/plumbing"
"gopkg.in/src-d/go-git.v4/plumbing/cache"
"gopkg.in/src-d/go-git.v4/plumbing/format/commitgraph"
"gopkg.in/src-d/go-git.v4/plumbing/format/packfile"
"gopkg.in/src-d/go-git.v4/storage/filesystem"
)
type CommitNodeSuite struct {
fixtures.Suite
}
var _ = Suite(&CommitNodeSuite{})
func unpackRepositry(f *fixtures.Fixture) *filesystem.Storage {
storer := filesystem.NewStorage(f.DotGit(), cache.NewObjectLRUDefault())
p := f.Packfile()
defer p.Close()
packfile.UpdateObjectStorage(storer, p)
return storer
}
func testWalker(c *C, nodeIndex CommitNodeIndex) {
head, err := nodeIndex.Get(plumbing.NewHash("b9d69064b190e7aedccf84731ca1d917871f8a1c"))
c.Assert(err, IsNil)
iter := NewCommitNodeIterCTime(
head,
nil,
nil,
)
var commits []CommitNode
iter.ForEach(func(c CommitNode) error {
commits = append(commits, c)
return nil
})
c.Assert(commits, HasLen, 9)
expected := []string{
"b9d69064b190e7aedccf84731ca1d917871f8a1c",
"6f6c5d2be7852c782be1dd13e36496dd7ad39560",
"a45273fe2d63300e1962a9e26a6b15c276cd7082",
"c0edf780dd0da6a65a7a49a86032fcf8a0c2d467",
"bb13916df33ed23004c3ce9ed3b8487528e655c1",
"03d2c021ff68954cf3ef0a36825e194a4b98f981",
"ce275064ad67d51e99f026084e20827901a8361c",
"e713b52d7e13807e87a002e812041f248db3f643",
"347c91919944a68e9413581a1bc15519550a3afe",
}
for i, commit := range commits {
c.Assert(commit.ID().String(), Equals, expected[i])
}
}
func testParents(c *C, nodeIndex CommitNodeIndex) {
merge3, err := nodeIndex.Get(plumbing.NewHash("6f6c5d2be7852c782be1dd13e36496dd7ad39560"))
c.Assert(err, IsNil)
var parents []CommitNode
merge3.ParentNodes().ForEach(func(c CommitNode) error {
parents = append(parents, c)
return nil
})
c.Assert(parents, HasLen, 3)
expected := []string{
"ce275064ad67d51e99f026084e20827901a8361c",
"bb13916df33ed23004c3ce9ed3b8487528e655c1",
"a45273fe2d63300e1962a9e26a6b15c276cd7082",
}
for i, parent := range parents {
c.Assert(parent.ID().String(), Equals, expected[i])
}
}
func testCommitAndTree(c *C, nodeIndex CommitNodeIndex) {
merge3node, err := nodeIndex.Get(plumbing.NewHash("6f6c5d2be7852c782be1dd13e36496dd7ad39560"))
c.Assert(err, IsNil)
merge3commit, err := merge3node.Commit()
c.Assert(err, IsNil)
c.Assert(merge3node.ID().String(), Equals, merge3commit.ID().String())
tree, err := merge3node.Tree()
c.Assert(err, IsNil)
c.Assert(tree.ID().String(), Equals, merge3commit.TreeHash.String())
}
func (s *CommitNodeSuite) TestObjectGraph(c *C) {
f := fixtures.ByTag("commit-graph").One()
storer := unpackRepositry(f)
nodeIndex := NewObjectCommitNodeIndex(storer)
testWalker(c, nodeIndex)
testParents(c, nodeIndex)
testCommitAndTree(c, nodeIndex)
}
func (s *CommitNodeSuite) TestCommitGraph(c *C) {
f := fixtures.ByTag("commit-graph").One()
storer := unpackRepositry(f)
reader, err := storer.Filesystem().Open(path.Join("objects", "info", "commit-graph"))
c.Assert(err, IsNil)
defer reader.Close()
index, err := commitgraph.OpenFileIndex(reader)
c.Assert(err, IsNil)
nodeIndex := NewGraphCommitNodeIndex(index, storer)
testWalker(c, nodeIndex)
testParents(c, nodeIndex)
testCommitAndTree(c, nodeIndex)
}
func (s *CommitNodeSuite) TestMixedGraph(c *C) {
f := fixtures.ByTag("commit-graph").One()
storer := unpackRepositry(f)
// Take the commit-graph file and copy it to memory index without the last commit
reader, err := storer.Filesystem().Open(path.Join("objects", "info", "commit-graph"))
c.Assert(err, IsNil)
defer reader.Close()
fileIndex, err := commitgraph.OpenFileIndex(reader)
c.Assert(err, IsNil)
memoryIndex := commitgraph.NewMemoryIndex()
for i, hash := range fileIndex.Hashes() {
if hash.String() != "b9d69064b190e7aedccf84731ca1d917871f8a1c" {
node, err := fileIndex.GetNodeByIndex(i)
c.Assert(err, IsNil)
memoryIndex.Add(hash, node)
}
}
nodeIndex := NewGraphCommitNodeIndex(memoryIndex, storer)
testWalker(c, nodeIndex)
testParents(c, nodeIndex)
testCommitAndTree(c, nodeIndex)
}
|
