[PATCH] copies: optimize forward copy detection logic for rebases

[Durham Goode]

# HG changeset patch
# User Durham Goode <durham at fb.com>
# Date 1454701571 28800
#      Fri Feb 05 11:46:11 2016 -0800
# Node ID 6eca9fcd1a9cce2f07a212a9c0eaf05dacd082df
# Parent  01a5143cd25f285f8c745a92986cd7186bb32c90
copies: optimize forward copy detection logic for rebases

Forward copy detection (i.e. detecting what files have been moved/copied in
commit X since ancestor Y) previously required diff'ing the manifests of both X
and Y. This was expensive since it required reading both entire manifests and
doing a set difference (they weren't already in a set because of the
lazymanifest work). This cost almost 1 second on very large repositories, and
happens N times for a rebase of N commits.

This patch optimizes it for the case of rebase. In a rebase, we are comparing a
commit against it's immediate parent, and therefore we can know what files
changed by looking at ctx.files().  This let's us drastically decrease the size
of the set comparison, and makes it O(# of changes) instead of O(size of
manifest). This makes it take 1ms instead of 1000ms.

diff --git a/mercurial/copies.py b/mercurial/copies.py
--- a/mercurial/copies.py
+++ b/mercurial/copies.py
@@ -11,6 +11,7 @@ import heapq
 
 from . import (
     pathutil,
+    scmutil,
     util,
 )
 
@@ -175,7 +176,16 @@ def _forwardcopies(a, b, match=None):
     # we currently don't try to find where old files went, too expensive
     # this means we can miss a case like 'hg rm b; hg cp a b'
     cm = {}
-    missing = _computeforwardmissing(a, b, match=match)
+
+    # Computing the forward missing is quite expensive on large manifests, since
+    # it compares the entire manifests. We can optimize it in the common use
+    # case of computing what copies are in a commit versus its parent (like
+    # during a rebase or histedit).
+    forwardmissingmatch = match
+    if not match and b.p1() == a:
+        forwardmissingmatch = scmutil.matchfiles(a._repo, b.files())
+    missing = _computeforwardmissing(a, b, match=forwardmissingmatch)
+
     ancestrycontext = a._repo.changelog.ancestors([b.rev()], inclusive=True)
     for f in missing:
         fctx = b[f]