Use the treePath to optimize commit info search.

Signed-off-by: Filip Navara <[email protected]>

Author: filipnavara

modules/git/commit_info.go

@@ -5,8 +5,6 @@
 package git
 
 import (
-	"path"
-
 	"gopkg.in/src-d/go-git.v4/plumbing"
 	"gopkg.in/src-d/go-git.v4/plumbing/object"
 	"gopkg.in/src-d/go-git.v4/plumbing/storer"
@@ -16,15 +14,15 @@ import (
 func (tes Entries) GetCommitsInfo(commit *Commit, treePath string, cache LastCommitCache) ([][]interface{}, error) {
 	entryPaths := make([]string, len(tes))
 	for i, entry := range tes {
-		entryPaths[i] = path.Join(treePath, entry.Name())
+		entryPaths[i] = entry.Name()
 	}
 
 	c, err := commit.repo.gogitRepo.CommitObject(plumbing.Hash(commit.ID))
 	if err != nil {
 		return nil, err
 	}
 
-	revs, err := getLastCommitForPaths(c, entryPaths)
+	revs, err := getLastCommitForPaths(c, treePath, entryPaths)
 	if err != nil {
 		return nil, err
 	}
@@ -45,7 +43,7 @@ func (tes Entries) GetCommitsInfo(commit *Commit, treePath string, cache LastCom
 	return commitsInfo, nil
 }
 
-func getLastCommitForPaths(c *object.Commit, paths []string) ([]*object.Commit, error) {
+func getLastCommitForPaths(c *object.Commit, treePath string, paths []string) ([]*object.Commit, error) {
 	cIter := object.NewCommitIterCTime(c, nil, nil)
 	result := make([]*object.Commit, len(paths))
 	remainingResults := len(paths)
@@ -55,6 +53,14 @@ func getLastCommitForPaths(c *object.Commit, paths []string) ([]*object.Commit,
 		return nil, err
 	}
 
+	if treePath != "" {
+		cTree, err = cTree.Tree(treePath)
+		if err != nil {
+			return nil, err
+		}
+	}
+	lastTreeHash := cTree.Hash
+
 	currentEntryHashes := make([]plumbing.Hash, len(paths))
 	for i, path := range paths {
 		cEntry, err := cTree.FindEntry(path)
@@ -73,6 +79,21 @@ func getLastCommitForPaths(c *object.Commit, paths []string) ([]*object.Commit,
 				return err
 			}
 
+			if treePath != "" {
+				parentTree, err = parentTree.Tree(treePath)
+				// the whole tree doesn't exist
+				if err != nil {
+					return nil
+				}
+			}
+
+			// bail-out early if this tree branch was not changed in the commit
+			if lastTreeHash == parentTree.Hash {
+				copy(newEntryHashes, currentEntryHashes)
+				return nil
+			}
+			lastTreeHash = parentTree.Hash
+
 			for i, path := range paths {
 				// skip path if we already found it
 				if currentEntryHashes[i] != plumbing.ZeroHash {