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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
|
package git
import (
"bufio"
"errors"
"io"
"os"
"path/filepath"
"strconv"
"strings"
"gopkg.in/src-d/go-git.v2/core"
)
// Tree is basically like a directory - it references a bunch of other trees
// and/or blobs (i.e. files and sub-directories)
type Tree struct {
Entries map[string]TreeEntry
Hash core.Hash
r *Repository
}
// TreeEntry represents a file
type TreeEntry struct {
Name string
Mode os.FileMode
Hash core.Hash
}
// New errors defined by this package.
var ErrFileNotFound = errors.New("file not found")
// File returns the hash of the file identified by the `path` argument.
// The path is interpreted as relative to the tree receiver.
func (t *Tree) File(path string) (*File, error) {
hash, err := t.findHash(path)
if err != nil {
return nil, ErrFileNotFound
}
obj, ok := t.r.Storage.Get(*hash)
if !ok {
return nil, ErrFileNotFound // a git submodule
}
if obj.Type() != core.BlobObject {
return nil, ErrFileNotFound // a directory
}
blob := &Blob{}
blob.Decode(obj)
return &File{Name: path, Reader: blob.Reader(), Hash: *hash}, nil
}
func (t *Tree) findHash(path string) (*core.Hash, error) {
pathParts := strings.Split(path, "/")
var tree *Tree
var err error
for tree = t; len(pathParts) > 1; pathParts = pathParts[1:] {
if tree, err = tree.dir(pathParts[0]); err != nil {
return nil, err
}
}
entry, err := tree.entry(pathParts[0])
if err != nil {
return nil, err
}
return &entry.Hash, nil
}
var errDirNotFound = errors.New("directory not found")
func (t *Tree) dir(baseName string) (*Tree, error) {
entry, err := t.entry(baseName)
if err != nil {
return nil, errDirNotFound
}
obj, ok := t.r.Storage.Get(entry.Hash)
if !ok { // git submodule
return nil, errDirNotFound
}
if obj.Type() != core.TreeObject {
return nil, errDirNotFound // a file
}
tree := &Tree{r: t.r}
tree.Decode(obj)
return tree, nil
}
var errEntryNotFound = errors.New("entry not found")
func (t *Tree) entry(baseName string) (*TreeEntry, error) {
entry, ok := t.Entries[baseName]
if !ok {
return nil, errEntryNotFound
}
return &entry, nil
}
func (t *Tree) Files() chan *File {
ch := make(chan *File, 1)
go func() {
defer func() { close(ch) }()
t.walkEntries("", ch)
}()
return ch
}
func (t *Tree) walkEntries(base string, ch chan *File) {
for _, entry := range t.Entries {
obj, ok := t.r.Storage.Get(entry.Hash)
if !ok {
continue // ignore entries without hash (= submodule dirs)
}
if obj.Type() == core.TreeObject {
tree := &Tree{r: t.r}
tree.Decode(obj)
tree.walkEntries(filepath.Join(base, entry.Name), ch)
continue
}
blob := &Blob{}
blob.Decode(obj)
ch <- &File{Name: filepath.Join(base, entry.Name), Reader: blob.Reader(), Hash: entry.Hash}
}
}
// Decode transform an core.Object into a Tree struct
func (t *Tree) Decode(o core.Object) error {
t.Hash = o.Hash()
if o.Size() == 0 {
return nil
}
t.Entries = make(map[string]TreeEntry)
r := bufio.NewReader(o.Reader())
for {
mode, err := r.ReadString(' ')
if err != nil {
if err == io.EOF {
break
}
return err
}
fm, err := strconv.ParseInt(mode[:len(mode)-1], 8, 32)
if err != nil && err != io.EOF {
return err
}
name, err := r.ReadString(0)
if err != nil && err != io.EOF {
return err
}
var hash core.Hash
_, err = r.Read(hash[:])
if err != nil && err != io.EOF {
return err
}
baseName := name[:len(name)-1]
t.Entries[baseName] = TreeEntry{
Hash: hash,
Mode: os.FileMode(fm),
Name: baseName,
}
}
return nil
}
type TreeIter struct {
iter
}
func NewTreeIter(r *Repository) *TreeIter {
return &TreeIter{newIter(r)}
}
func (i *TreeIter) Next() (*Tree, error) {
obj := <-i.ch
if obj == nil {
return nil, io.EOF
}
tree := &Tree{r: i.r}
return tree, tree.Decode(obj)
}
|
