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
|
package commitgraph
import (
"bufio"
"errors"
"fmt"
"os"
"strings"
"codeberg.org/lindenii/furgit/internal/intconv"
"codeberg.org/lindenii/furgit/objectid"
)
// Open opens commit-graph data from one objects root.
func Open(root *os.Root, algo objectid.Algorithm, mode OpenMode) (*Reader, error) {
if algo.Size() == 0 {
return nil, objectid.ErrInvalidAlgorithm
}
switch mode {
case OpenSingle:
return openSingle(root, algo)
case OpenChain:
return openChain(root, algo)
default:
return nil, fmt.Errorf("format/commitgraph: invalid open mode %d", mode)
}
}
func openSingle(root *os.Root, algo objectid.Algorithm) (*Reader, error) {
graph, err := openLayer(root, "info/commit-graph", algo)
if err != nil {
return nil, err
}
graph.baseCount = 0
graph.globalFrom = 0
hashVersion, err := intconv.Uint32ToUint8(algo.PackHashID())
if err != nil {
return nil, err
}
out := &Reader{
algo: algo,
hashVersion: hashVersion,
layers: []layer{*graph},
total: graph.numCommits,
}
return out, nil
}
func openChain(root *os.Root, algo objectid.Algorithm) (*Reader, error) {
chainPath := "info/commit-graphs/commit-graph-chain"
file, err := root.Open(chainPath)
if err != nil {
if errors.Is(err, os.ErrNotExist) {
return nil, &ErrMalformed{Path: chainPath, Reason: "missing commit-graph-chain"}
}
return nil, err
}
scanner := bufio.NewScanner(file)
hashes := make([]string, 0)
for scanner.Scan() {
line := strings.TrimSpace(scanner.Text())
if line == "" {
continue
}
hashes = append(hashes, line)
}
scanErr := scanner.Err()
closeErr := file.Close()
if scanErr != nil {
return nil, scanErr
}
if closeErr != nil {
return nil, closeErr
}
if len(hashes) == 0 {
return nil, &ErrMalformed{Path: chainPath, Reason: "empty chain"}
}
layers := make([]layer, 0, len(hashes))
var total uint32
hashVersion, err := intconv.Uint32ToUint8(algo.PackHashID())
if err != nil {
return nil, err
}
for i, hashHex := range hashes {
expectedBaseCount, err := intconv.IntToUint32(i)
if err != nil {
closeLayers(layers)
return nil, err
}
if len(hashHex) != algo.HexLen() {
closeLayers(layers)
return nil, &ErrMalformed{
Path: chainPath,
Reason: fmt.Sprintf("invalid graph hash length at line %d", i+1),
}
}
relPath := fmt.Sprintf("info/commit-graphs/graph-%s.graph", hashHex)
loaded, loadErr := openLayer(root, relPath, algo)
if loadErr != nil {
closeLayers(layers)
return nil, loadErr
}
if loaded.baseCount != expectedBaseCount {
_ = loaded.close()
closeLayers(layers)
return nil, &ErrMalformed{
Path: relPath,
Reason: fmt.Sprintf("BASE count %d does not match chain depth %d", loaded.baseCount, i),
}
}
validateErr := validateChainBaseHashes(algo, hashes, i, loaded)
if validateErr != nil {
_ = loaded.close()
closeLayers(layers)
return nil, validateErr
}
loaded.globalFrom = total
loaded.baseCount = expectedBaseCount
totalNext := total + loaded.numCommits
if totalNext < total {
_ = loaded.close()
closeLayers(layers)
return nil, &ErrMalformed{Path: relPath, Reason: "total commit count overflow"}
}
total = totalNext
layers = append(layers, *loaded)
}
out := &Reader{
algo: algo,
hashVersion: hashVersion,
layers: layers,
total: total,
}
return out, nil
}
|
