Merge pull request #183 from jfontan/fix/history_idx_loop

history_idx: do not visit a parent more than once

Author: jfontan

internal/function/history_idx.go

@@ -127,6 +127,7 @@ func (f *HistoryIdx) repoHistoryIdx(repo *git.Repository, start, target plumbing
 	// history. Because the frame keeps track of which was its index, we can
 	// return accurate indexes even if there are multiple branches.
 	stack := []*stackFrame{{0, 0, []plumbing.Hash{start}}}
+	visitedHashes := make(map[plumbing.Hash]struct{})
 
 	for {
 		if len(stack) == 0 {
@@ -135,7 +136,12 @@ func (f *HistoryIdx) repoHistoryIdx(repo *git.Repository, start, target plumbing
 
 		frame := stack[len(stack)-1]
 
-		c, err := repo.CommitObject(frame.hashes[frame.pos])
+		h := frame.hashes[frame.pos]
+		if _, ok := visitedHashes[h]; !ok {
+			visitedHashes[h] = struct{}{}
+		}
+
+		c, err := repo.CommitObject(h)
 		if err == plumbing.ErrObjectNotFound {
 			return -1, nil
 		}
@@ -155,7 +161,16 @@ func (f *HistoryIdx) repoHistoryIdx(repo *git.Repository, start, target plumbing
 		}
 
 		if c.NumParents() > 0 {
-			stack = append(stack, &stackFrame{frame.idx + 1, 0, c.ParentHashes})
+			newParents := make([]plumbing.Hash, 0, c.NumParents())
+			for _, h = range c.ParentHashes {
+				if _, ok := visitedHashes[h]; !ok {
+					newParents = append(newParents, h)
+				}
+			}
+
+			if len(newParents) > 0 {
+				stack = append(stack, &stackFrame{frame.idx + 1, 0, newParents})
+			}
 		}
 	}
 }