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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
|
package furgit
import (
"fmt"
"iter"
)
// ReachabilityMode controls which object types are walked.
type ReachabilityMode uint8
const (
// ReachabilityCommitsOnly walks only commit objects.
ReachabilityCommitsOnly ReachabilityMode = iota
// ReachabilityAllObjects walks commits, trees, blobs, and tags reachable
// from the commits in Wants.
ReachabilityAllObjects
)
// ReachabilityQuery describes a want/have reachability walk.
//
// ReachableObjects returns objects reachable from Wants. If Mode is
// ReachabilityCommitsOnly, non-commit Wants are ignored except for tags,
// which are peeled to their target.
type ReachabilityQuery struct {
Wants []Hash
Haves []Hash
Mode ReachabilityMode
// StopAtHaves prunes traversal when an object is reachable from Haves.
StopAtHaves bool
}
// ReachableObject reports a reachable object and whether it is also reachable
// from the Have set.
type ReachableObject struct {
ID Hash
Type ObjectType
InHave bool
}
// ReachabilityWalk is a single-use reachability iterator.
// After iterating, Err reports any error encountered during the walk.
type ReachabilityWalk struct {
repo *Repository
query ReachabilityQuery
err error
haveInit bool
haveErr error
haveSet map[Hash]struct{}
}
// ReachableObjects returns a single-use iterator over objects reachable from
// query.Wants.
//
// It yields ReachableObject values; InHave is true when the object is also
// reachable from query.Haves.
func (repo *Repository) ReachableObjects(query ReachabilityQuery) (*ReachabilityWalk, error) {
if repo == nil {
return nil, ErrInvalidObject
}
switch query.Mode {
case ReachabilityCommitsOnly, ReachabilityAllObjects:
default:
return nil, ErrInvalidObject
}
for _, id := range query.Wants {
if id.algo != repo.hashAlgo {
return nil, fmt.Errorf("furgit: reachability: want hash algorithm mismatch")
}
}
for _, id := range query.Haves {
if id.algo != repo.hashAlgo {
return nil, fmt.Errorf("furgit: reachability: have hash algorithm mismatch")
}
}
return &ReachabilityWalk{
repo: repo,
query: query,
}, nil
}
// Seq returns the iterator.
func (w *ReachabilityWalk) Seq() iter.Seq[ReachableObject] {
return func(yield func(ReachableObject) bool) {
if w == nil || w.repo == nil {
w.err = ErrInvalidObject
return
}
haveSet, err := w.ensureHaveSet()
if err != nil {
w.err = err
return
}
wantWalk := reachabilityWalker{
repo: w.repo,
mode: w.query.Mode,
seenCommits: make(map[Hash]struct{}),
seenObjects: make(map[Hash]struct{}),
haveSet: haveSet,
stopAtHaves: w.query.StopAtHaves,
}
if err := wantWalk.walkRoots(w.query.Wants, func(obj ReachableObject) bool {
return yield(obj)
}); err != nil {
w.err = err
return
}
}
}
// Err reports the first error encountered by the iterator.
func (w *ReachabilityWalk) Err() error {
if w == nil {
return ErrInvalidObject
}
return w.err
}
// HaveContains reports whether id is reachable from Haves.
func (w *ReachabilityWalk) HaveContains(id Hash) (bool, error) {
if w == nil || w.repo == nil {
return false, ErrInvalidObject
}
haveSet, err := w.ensureHaveSet()
if err != nil {
return false, err
}
_, ok := haveSet[id]
return ok, nil
}
func (w *ReachabilityWalk) ensureHaveSet() (map[Hash]struct{}, error) {
if w.haveInit {
return w.haveSet, w.haveErr
}
w.haveInit = true
w.haveSet = make(map[Hash]struct{})
if len(w.query.Haves) == 0 {
return w.haveSet, nil
}
haveWalk := reachabilityWalker{
repo: w.repo,
mode: w.query.Mode,
seenCommits: make(map[Hash]struct{}),
seenObjects: make(map[Hash]struct{}),
recordHaveOnly: true,
haveSet: w.haveSet,
}
if err := haveWalk.walkRoots(w.query.Haves, nil); err != nil {
w.haveErr = err
return nil, err
}
return w.haveSet, nil
}
type reachabilityWalker struct {
repo *Repository
mode ReachabilityMode
seenCommits map[Hash]struct{}
seenObjects map[Hash]struct{}
haveSet map[Hash]struct{}
recordHaveOnly bool
stopAtHaves bool
cg *commitGraph
cgInit bool
}
func (rw *reachabilityWalker) initCommitGraph() {
if rw.cgInit {
return
}
rw.cgInit = true
cg, err := rw.repo.CommitGraph()
if err == nil {
rw.cg = cg
}
}
func (rw *reachabilityWalker) walkRoots(roots []Hash, emit func(ReachableObject) bool) error {
for _, id := range roots {
if err := rw.walkObject(id, emit); err != nil {
return err
}
}
return nil
}
func (rw *reachabilityWalker) walkObject(id Hash, emit func(ReachableObject) bool) error {
if rw.stopAtHaves {
if _, ok := rw.haveSet[id]; ok {
return nil
}
}
if rw.recordHaveOnly {
if _, ok := rw.haveSet[id]; ok {
return nil
}
} else {
if _, ok := rw.seenObjects[id]; ok {
return nil
}
}
rw.initCommitGraph()
if rw.cg != nil {
if pos, ok := rw.cg.CommitPosition(id); ok {
return rw.walkCommitByPos(pos, id, emit)
}
}
ty, body, err := rw.repo.ReadObjectTypeRaw(id)
if err != nil {
return err
}
switch ty {
case ObjectTypeCommit:
return rw.walkCommitBody(id, body, emit)
case ObjectTypeTree:
if rw.mode != ReachabilityAllObjects {
return nil
}
return rw.walkTreeBody(id, body, emit)
case ObjectTypeBlob:
if rw.mode != ReachabilityAllObjects {
return nil
}
return rw.emitObject(id, ObjectTypeBlob, emit)
case ObjectTypeTag:
return rw.walkTagBody(id, body, emit)
default:
return ErrInvalidObject
}
}
func (rw *reachabilityWalker) walkCommitByPos(pos uint32, id Hash, emit func(ReachableObject) bool) error {
if _, ok := rw.seenCommits[id]; ok {
return nil
}
rw.seenCommits[id] = struct{}{}
cc, err := rw.cg.CommitAt(pos)
if err != nil {
return err
}
if err := rw.emitObject(id, ObjectTypeCommit, emit); err != nil {
return err
}
if rw.mode == ReachabilityAllObjects {
if err := rw.walkTreeByID(cc.Tree, emit); err != nil {
return err
}
}
for _, parentPos := range cc.Parents {
parentID, err := rw.cg.OIDAt(parentPos)
if err != nil {
return err
}
if err := rw.walkObject(parentID, emit); err != nil {
return err
}
}
return nil
}
func (rw *reachabilityWalker) walkCommitBody(id Hash, body []byte, emit func(ReachableObject) bool) error {
if _, ok := rw.seenCommits[id]; ok {
return nil
}
rw.seenCommits[id] = struct{}{}
commit, err := parseCommit(id, body, rw.repo)
if err != nil {
return err
}
if err := rw.emitObject(id, ObjectTypeCommit, emit); err != nil {
return err
}
if rw.mode == ReachabilityAllObjects {
if err := rw.walkTreeByID(commit.Tree, emit); err != nil {
return err
}
}
for _, parent := range commit.Parents {
if err := rw.walkObject(parent, emit); err != nil {
return err
}
}
return nil
}
func (rw *reachabilityWalker) walkTagBody(id Hash, body []byte, emit func(ReachableObject) bool) error {
tag, err := parseTag(id, body, rw.repo)
if err != nil {
return err
}
if rw.mode == ReachabilityAllObjects {
if err := rw.emitObject(id, ObjectTypeTag, emit); err != nil {
return err
}
}
if tag.TargetType == ObjectTypeCommit {
return rw.walkObject(tag.Target, emit)
}
if rw.mode == ReachabilityAllObjects {
return rw.walkObject(tag.Target, emit)
}
return nil
}
func (rw *reachabilityWalker) walkTreeByID(id Hash, emit func(ReachableObject) bool) error {
if rw.mode != ReachabilityAllObjects {
return nil
}
if _, ok := rw.seenObjects[id]; ok && !rw.recordHaveOnly {
return nil
}
ty, body, err := rw.repo.ReadObjectTypeRaw(id)
if err != nil {
return err
}
if ty != ObjectTypeTree {
return ErrInvalidObject
}
return rw.walkTreeBody(id, body, emit)
}
func (rw *reachabilityWalker) walkTreeBody(id Hash, body []byte, emit func(ReachableObject) bool) error {
if rw.mode != ReachabilityAllObjects {
return nil
}
tree, err := parseTree(id, body, rw.repo)
if err != nil {
return err
}
if err := rw.emitObject(id, ObjectTypeTree, emit); err != nil {
return err
}
for _, entry := range tree.Entries {
switch entry.Mode {
case FileModeDir:
if err := rw.walkTreeByID(entry.ID, emit); err != nil {
return err
}
case FileModeGitlink:
// IIRC Gitlinks are references to external repositories
// and do not imply reachability of the target commit...
continue
default:
if err := rw.emitObject(entry.ID, ObjectTypeBlob, emit); err != nil {
return err
}
}
}
return nil
}
func (rw *reachabilityWalker) emitObject(id Hash, ty ObjectType, emit func(ReachableObject) bool) error {
if rw.recordHaveOnly {
rw.haveSet[id] = struct{}{}
return nil
}
if _, ok := rw.seenObjects[id]; ok {
return nil
}
rw.seenObjects[id] = struct{}{}
inHave := false
if _, ok := rw.haveSet[id]; ok {
inHave = true
}
if emit != nil {
if !emit(ReachableObject{ID: id, Type: ty, InHave: inHave}) {
return nil
}
}
return nil
}
|