aboutsummaryrefslogtreecommitdiffstats
path: root/pkg/vcs/git.go
diff options
context:
space:
mode:
authorAleksandr Nogikh <nogikh@google.com>2026-02-27 12:55:04 +0000
committerAleksandr Nogikh <nogikh@google.com>2026-02-27 13:59:44 +0000
commit2cf092b8cfccda3ad7fc30eeaf025f97bd331bb8 (patch)
tree1cb99db74ca4174abdf5e522169ad992ed22fb7f /pkg/vcs/git.go
parenta2f13f719e073f5891395e8e7374ba6640614a66 (diff)
pkg/vcs: fix repetitive change handling in BaseForDiff
The current implementation runs into problems if we modify the same file several times in the patch series since the sequential blob hashes will not be found in the reproducer. Fix it by moving the check for already processed files up.
Diffstat (limited to 'pkg/vcs/git.go')
-rw-r--r--pkg/vcs/git.go12
1 files changed, 6 insertions, 6 deletions
diff --git a/pkg/vcs/git.go b/pkg/vcs/git.go
index f1311e312..efcb64470 100644
--- a/pkg/vcs/git.go
+++ b/pkg/vcs/git.go
@@ -805,6 +805,10 @@ func (git Git) BaseForDiff(diff []byte, tracer debugtracer.DebugTracer) ([]*Base
if _, ignore := ignoreFiles[file.Name]; ignore {
continue
}
+ if _, ok := nameToHash[file.Name]; ok {
+ // We only care about the first occurrence of a file in the diff series.
+ continue
+ }
if ok, err := git.verifyHash(file.LeftHash); err != nil {
return nil, fmt.Errorf("hash verification failed: %w", err)
} else if !ok {
@@ -812,12 +816,8 @@ func (git Git) BaseForDiff(diff []byte, tracer debugtracer.DebugTracer) ([]*Base
tracer.Logf("unknown object %s, stopping base commit search", file.LeftHash)
return nil, nil
}
- if _, ok := nameToHash[file.Name]; !ok {
- // If the diff is actually a concatenation of several diffs, we only
- // want to remember the first left side hash for each file.
- fileNames = append(fileNames, file.Name)
- nameToHash[file.Name] = file.LeftHash
- }
+ fileNames = append(fileNames, file.Name)
+ nameToHash[file.Name] = file.LeftHash
args = append(args, "--find-object="+file.LeftHash)
}
tracer.Logf("extracted %d left blob hashes", len(nameToHash))