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
|
package repository_test
import (
"codeberg.org/lindenii/furgit/object"
"codeberg.org/lindenii/furgit/objectid"
"codeberg.org/lindenii/furgit/objecttype"
"codeberg.org/lindenii/furgit/repository"
)
func traverseTreeIter(repo *repository.Repository, root objectid.ObjectID) (int, error) {
stack := []objectid.ObjectID{root}
total := 0
for len(stack) > 0 {
id := stack[len(stack)-1]
stack = stack[:len(stack)-1]
ty, _, err := repo.Objects().ReadHeader(id)
if err != nil {
return 0, err
}
total++
if ty != objecttype.TypeTree {
continue
}
tree, err := repo.ReadStoredTree(id)
if err != nil {
return 0, err
}
for i := len(tree.Tree().Entries) - 1; i >= 0; i-- {
entry := tree.Tree().Entries[i]
if entry.Mode == object.FileModeGitlink {
continue
}
stack = append(stack, entry.ID)
}
}
return total, nil
}
func traverseReachableIter(repo *repository.Repository, root objectid.ObjectID) (int, error) {
stack := []objectid.ObjectID{root}
visited := make(map[objectid.ObjectID]struct{})
total := 0
for len(stack) > 0 {
id := stack[len(stack)-1]
stack = stack[:len(stack)-1]
if _, ok := visited[id]; ok {
continue
}
visited[id] = struct{}{}
stored, err := repo.ReadStored(id)
if err != nil {
return 0, err
}
total++
switch obj := stored.Object().(type) {
case *object.Commit:
stack = append(stack, obj.Tree)
stack = append(stack, obj.Parents...)
case *object.Tree:
for i := len(obj.Entries) - 1; i >= 0; i-- {
entry := obj.Entries[i]
if entry.Mode == object.FileModeGitlink {
continue
}
stack = append(stack, entry.ID)
}
case *object.Tag:
stack = append(stack, obj.Target)
case *object.Blob:
default:
// Unknown parsed object variants are treated as leaves.
}
}
return total, nil
}
|
