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
|
// Package revlist provides support to access the ancestors of commits, in a
// similar way as the git-rev-list command.
package revlist
import (
"io"
"srcd.works/go-git.v4/plumbing"
"srcd.works/go-git.v4/plumbing/object"
"srcd.works/go-git.v4/plumbing/storer"
)
// Objects applies a complementary set. It gets all the hashes from all
// the reachable objects from the given commits. Ignore param are object hashes
// that we want to ignore on the result. It is a list because is
// easier to interact with other porcelain elements, but internally it is
// converted to a map. All that objects must be accessible from the object
// storer.
func Objects(
s storer.EncodedObjectStorer,
commits []*object.Commit,
ignore []plumbing.Hash) ([]plumbing.Hash, error) {
seen := hashListToSet(ignore)
result := make(map[plumbing.Hash]bool)
for _, c := range commits {
err := reachableObjects(s, c, seen, func(h plumbing.Hash) error {
if !seen[h] {
result[h] = true
seen[h] = true
}
return nil
})
if err != nil {
return nil, err
}
}
return hashSetToList(result), nil
}
// reachableObjects returns, using the callback function, all the reachable
// objects from the specified commit. To avoid to iterate over seen commits,
// if a commit hash is into the 'seen' set, we will not iterate all his trees
// and blobs objects.
func reachableObjects(
s storer.EncodedObjectStorer,
commit *object.Commit,
seen map[plumbing.Hash]bool,
cb func(h plumbing.Hash) error) error {
return iterateCommits(commit, func(commit *object.Commit) error {
if seen[commit.Hash] {
return nil
}
if err := cb(commit.Hash); err != nil {
return err
}
return iterateCommitTrees(s, commit, func(h plumbing.Hash) error {
return cb(h)
})
})
}
// iterateCommits iterate all reachable commits from the given one
func iterateCommits(commit *object.Commit, cb func(c *object.Commit) error) error {
if err := cb(commit); err != nil {
return err
}
return object.WalkCommitHistory(commit, func(c *object.Commit) error {
return cb(c)
})
}
// iterateCommitTrees iterate all reachable trees from the given commit
func iterateCommitTrees(
s storer.EncodedObjectStorer,
commit *object.Commit,
cb func(h plumbing.Hash) error) error {
tree, err := commit.Tree()
if err != nil {
return err
}
if err := cb(tree.Hash); err != nil {
return err
}
treeWalker := object.NewTreeWalker(tree, true)
for {
_, e, err := treeWalker.Next()
if err == io.EOF {
break
}
if err != nil {
return err
}
if err := cb(e.Hash); err != nil {
return err
}
}
return nil
}
func hashSetToList(hashes map[plumbing.Hash]bool) []plumbing.Hash {
var result []plumbing.Hash
for key := range hashes {
result = append(result, key)
}
return result
}
func hashListToSet(hashes []plumbing.Hash) map[plumbing.Hash]bool {
result := make(map[plumbing.Hash]bool)
for _, h := range hashes {
result[h] = true
}
return result
}
|
