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
|
package furgit
import (
"bytes"
"fmt"
"os"
"path/filepath"
"strings"
"testing"
)
func TestTreeWrite(t *testing.T) {
repoPath, cleanup := setupTestRepo(t)
defer cleanup()
blobData := []byte("file content")
blobHash := gitHashObject(t, repoPath, "blob", blobData)
repo, err := OpenRepository(repoPath)
if err != nil {
t.Fatalf("OpenRepository failed: %v", err)
}
defer func() { _ = repo.Close() }()
blobHashObj, _ := repo.ParseHash(blobHash)
tree := &Tree{
Entries: []TreeEntry{
{Mode: 0o100644, Name: []byte("file.txt"), ID: blobHashObj},
},
}
treeHash, err := repo.WriteLooseObject(tree)
if err != nil {
t.Fatalf("WriteLooseObject failed: %v", err)
}
gitType := string(gitCatFile(t, repoPath, "-t", treeHash.String()))
if gitType != "tree" {
t.Errorf("git type: got %q, want %q", gitType, "tree")
}
gitLsTree := gitCmd(t, repoPath, "ls-tree", treeHash.String())
if !strings.Contains(gitLsTree, "file.txt") {
t.Errorf("git ls-tree doesn't contain file.txt: %s", gitLsTree)
}
if !strings.Contains(gitLsTree, blobHash) {
t.Errorf("git ls-tree doesn't contain blob hash: %s", gitLsTree)
}
}
func TestTreeRead(t *testing.T) {
repoPath, cleanup := setupTestRepo(t)
defer cleanup()
workDir, cleanupWork := setupWorkDir(t)
defer cleanupWork()
err := os.WriteFile(filepath.Join(workDir, "a.txt"), []byte("content a"), 0o644)
if err != nil {
t.Fatalf("failed to write a.txt: %v", err)
}
err = os.WriteFile(filepath.Join(workDir, "b.txt"), []byte("content b"), 0o644)
if err != nil {
t.Fatalf("failed to write b.txt: %v", err)
}
err = os.WriteFile(filepath.Join(workDir, "c.txt"), []byte("content c"), 0o644)
if err != nil {
t.Fatalf("failed to write c.txt: %v", err)
}
gitCmd(t, repoPath, "--work-tree="+workDir, "add", ".")
treeHash := gitCmd(t, repoPath, "--work-tree="+workDir, "write-tree")
repo, err := OpenRepository(repoPath)
if err != nil {
t.Fatalf("OpenRepository failed: %v", err)
}
defer func() { _ = repo.Close() }()
hash, _ := repo.ParseHash(treeHash)
obj, err := repo.ReadObject(hash)
if err != nil {
t.Fatalf("ReadObject failed: %v", err)
}
tree, ok := obj.(*StoredTree)
if !ok {
t.Fatalf("expected *StoredTree, got %T", obj)
}
if len(tree.Entries) != 3 {
t.Fatalf("entries count: got %d, want 3", len(tree.Entries))
}
expectedNames := []string{"a.txt", "b.txt", "c.txt"}
for i, expected := range expectedNames {
if string(tree.Entries[i].Name) != expected {
t.Errorf("entry[%d] name: got %q, want %q", i, tree.Entries[i].Name, expected)
}
}
if tree.ObjectType() != ObjectTypeTree {
t.Errorf("ObjectType(): got %d, want %d", tree.ObjectType(), ObjectTypeTree)
}
}
func TestTreeEntry(t *testing.T) {
repoPath, cleanup := setupTestRepo(t)
defer cleanup()
workDir, cleanupWork := setupWorkDir(t)
defer cleanupWork()
err := os.WriteFile(filepath.Join(workDir, "a.txt"), []byte("content a"), 0o644)
if err != nil {
t.Fatalf("failed to write a.txt: %v", err)
}
err = os.WriteFile(filepath.Join(workDir, "b.txt"), []byte("content b"), 0o644)
if err != nil {
t.Fatalf("failed to write b.txt: %v", err)
}
err = os.WriteFile(filepath.Join(workDir, "c.txt"), []byte("content c"), 0o644)
if err != nil {
t.Fatalf("failed to write c.txt: %v", err)
}
gitCmd(t, repoPath, "--work-tree="+workDir, "add", ".")
treeHash := gitCmd(t, repoPath, "--work-tree="+workDir, "write-tree")
repo, err := OpenRepository(repoPath)
if err != nil {
t.Fatalf("OpenRepository failed: %v", err)
}
defer func() { _ = repo.Close() }()
hash, _ := repo.ParseHash(treeHash)
obj, _ := repo.ReadObject(hash)
tree := obj.(*StoredTree)
entry := tree.Entry([]byte("b.txt"))
if entry == nil {
t.Fatal("Entry returned nil for existing entry")
}
if !bytes.Equal(entry.Name, []byte("b.txt")) {
t.Errorf("entry name: got %q, want %q", entry.Name, "b.txt")
}
notFound := tree.Entry([]byte("notfound.txt"))
if notFound != nil {
t.Error("Entry returned non-nil for non-existing entry")
}
}
func TestTreeEntryRecursive(t *testing.T) {
repoPath, cleanup := setupTestRepo(t)
defer cleanup()
workDir, cleanupWork := setupWorkDir(t)
defer cleanupWork()
err := os.MkdirAll(filepath.Join(workDir, "dir"), 0o755)
if err != nil {
t.Fatalf("failed to create dir: %v", err)
}
err = os.WriteFile(filepath.Join(workDir, "file1.txt"), []byte("file1"), 0o644)
if err != nil {
t.Fatalf("failed to write file1.txt: %v", err)
}
err = os.WriteFile(filepath.Join(workDir, "file2.txt"), []byte("file2"), 0o644)
if err != nil {
t.Fatalf("failed to write file2.txt: %v", err)
}
err = os.WriteFile(filepath.Join(workDir, "dir", "nested.txt"), []byte("nested"), 0o644)
if err != nil {
t.Fatalf("failed to write dir/nested.txt: %v", err)
}
gitCmd(t, repoPath, "--work-tree="+workDir, "add", ".")
treeHash := gitCmd(t, repoPath, "--work-tree="+workDir, "write-tree")
repo, err := OpenRepository(repoPath)
if err != nil {
t.Fatalf("OpenRepository failed: %v", err)
}
defer func() { _ = repo.Close() }()
hash, _ := repo.ParseHash(treeHash)
obj, _ := repo.ReadObject(hash)
tree := obj.(*StoredTree)
entry, err := tree.EntryRecursive(repo, [][]byte{[]byte("file1.txt")})
if err != nil {
t.Fatalf("EntryRecursive file1.txt failed: %v", err)
}
if !bytes.Equal(entry.Name, []byte("file1.txt")) {
t.Errorf("entry name: got %q, want %q", entry.Name, "file1.txt")
}
gitShow := string(gitCatFile(t, repoPath, "blob", entry.ID.String()))
if gitShow != "file1" {
t.Errorf("file1 content from git: got %q, want %q", gitShow, "file1")
}
nestedEntry, err := tree.EntryRecursive(repo, [][]byte{[]byte("dir"), []byte("nested.txt")})
if err != nil {
t.Fatalf("EntryRecursive dir/nested.txt failed: %v", err)
}
if !bytes.Equal(nestedEntry.Name, []byte("nested.txt")) {
t.Errorf("nested entry name: got %q, want %q", nestedEntry.Name, "nested.txt")
}
gitShowNested := string(gitCatFile(t, repoPath, "blob", nestedEntry.ID.String()))
if gitShowNested != "nested" {
t.Errorf("nested content from git: got %q, want %q", gitShowNested, "nested")
}
_, err = tree.EntryRecursive(repo, [][]byte{[]byte("nonexistent.txt")})
if err == nil {
t.Error("expected error for nonexistent path")
}
_, err = tree.EntryRecursive(repo, [][]byte{})
if err == nil {
t.Error("expected error for empty path")
}
}
func TestTreeLarge(t *testing.T) {
if testing.Short() {
t.Skip("skipping large tree test in short mode")
}
repoPath, cleanup := setupTestRepo(t)
defer cleanup()
gitCmd(t, repoPath, "config", "gc.auto", "0")
workDir, cleanupWork := setupWorkDir(t)
defer cleanupWork()
numFiles := 1000
for i := 0; i < numFiles; i++ {
filename := filepath.Join(workDir, fmt.Sprintf("file%04d.txt", i))
content := fmt.Sprintf("Content for file %d\n", i)
err := os.WriteFile(filename, []byte(content), 0o644)
if err != nil {
t.Fatalf("failed to write %s: %v", filename, err)
}
}
gitCmd(t, repoPath, "--work-tree="+workDir, "add", ".")
treeHash := gitCmd(t, repoPath, "--work-tree="+workDir, "write-tree")
repo, err := OpenRepository(repoPath)
if err != nil {
t.Fatalf("OpenRepository failed: %v", err)
}
defer func() { _ = repo.Close() }()
hash, _ := repo.ParseHash(treeHash)
obj, _ := repo.ReadObject(hash)
tree := obj.(*StoredTree)
if len(tree.Entries) != numFiles {
t.Errorf("tree entries: got %d, want %d", len(tree.Entries), numFiles)
}
gitCount := gitCmd(t, repoPath, "ls-tree", treeHash)
gitLines := strings.Count(gitCount, "\n") + 1
if len(tree.Entries) != gitLines {
t.Errorf("furgit found %d entries, git found %d", len(tree.Entries), gitLines)
}
for i := 0; i < 10; i++ {
idx := i * (numFiles / 10)
expectedName := fmt.Sprintf("file%04d.txt", idx)
entry := tree.Entry([]byte(expectedName))
if entry == nil {
t.Errorf("expected to find entry %s", expectedName)
continue
}
blobObj, _ := repo.ReadObject(entry.ID)
blob := blobObj.(*StoredBlob)
expectedContent := fmt.Sprintf("Content for file %d\n", idx)
if string(blob.Data) != expectedContent {
t.Errorf("blob %s: got %q, want %q", expectedName, blob.Data, expectedContent)
}
gitData := gitCatFile(t, repoPath, "blob", entry.ID.String())
if !bytes.Equal(blob.Data, gitData) {
t.Errorf("blob %s: furgit data doesn't match git data", expectedName)
}
}
}
func TestTreeInsertEntry(t *testing.T) {
tree := &Tree{
Entries: []TreeEntry{
{Mode: FileModeRegular, Name: []byte("alpha"), ID: Hash{}},
{Mode: FileModeRegular, Name: []byte("gamma"), ID: Hash{}},
},
}
if err := tree.InsertEntry(TreeEntry{Mode: FileModeRegular, Name: []byte("beta"), ID: Hash{}}); err != nil {
t.Fatalf("InsertEntry failed: %v", err)
}
if len(tree.Entries) != 3 {
t.Fatalf("entries count: got %d, want 3", len(tree.Entries))
}
if string(tree.Entries[1].Name) != "beta" {
t.Fatalf("inserted order mismatch: got %q, want %q", tree.Entries[1].Name, "beta")
}
if err := tree.InsertEntry(TreeEntry{Mode: FileModeRegular, Name: []byte("beta"), ID: Hash{}}); err == nil {
t.Fatal("expected duplicate insert error")
}
var nilTree *Tree
if err := nilTree.InsertEntry(TreeEntry{Mode: FileModeRegular, Name: []byte("x"), ID: Hash{}}); err == nil {
t.Fatal("expected error for nil tree")
}
}
func TestTreeRemoveEntry(t *testing.T) {
tree := &Tree{
Entries: []TreeEntry{
{Mode: FileModeRegular, Name: []byte("alpha"), ID: Hash{}},
{Mode: FileModeRegular, Name: []byte("beta"), ID: Hash{}},
{Mode: FileModeRegular, Name: []byte("gamma"), ID: Hash{}},
},
}
if err := tree.RemoveEntry([]byte("beta")); err != nil {
t.Fatalf("RemoveEntry failed: %v", err)
}
if len(tree.Entries) != 2 {
t.Fatalf("entries count: got %d, want 2", len(tree.Entries))
}
if string(tree.Entries[0].Name) != "alpha" || string(tree.Entries[1].Name) != "gamma" {
t.Fatalf("remove order mismatch: got %q, %q", tree.Entries[0].Name, tree.Entries[1].Name)
}
if err := tree.RemoveEntry([]byte("beta")); err == nil {
t.Fatal("expected ErrNotFound for missing entry")
}
var nilTree *Tree
if err := nilTree.RemoveEntry([]byte("alpha")); err == nil {
t.Fatal("expected error for nil tree")
}
}
|