# HG changeset patch
# User Georges Racinet <gracinet@anybox.fr>
# Date 2018-09-27 14:55:44
# Node ID 9cadb0f5f2279a60a79b1d0e50eccd60638495c0
# Parent  d33611280add98e96296bd91a4824613a6b63fc8

rust: hooking into Python code

We introduce a new class called 'rustlazyancestors'
in the ancestors module, which is used only if
parsers.rustlazyancestors does exist.

The implementation of __contains__ stays unchanged,
but is now backed by the Rust iterator. It would
probably be a good candidate for further development,
though, as it is mostly looping, and duplicates the
'seen' set.

The Rust code could be further optimized, however it already
gives rise to performance improvements:

median timing from hg perfancestors:
- on pypy:
    before: 0.077566s
    after:  0.016676s -79%
- on mozilla central:
    before: 0.190037s
    after:  0.082225s -58%
- on a private repository (about one million revisions):
    before: 0.567085s
    after:  0.108816s -80%
- on another private repository (about 400 000 revisions):
    before: 1.440918s
    after:  0.290116s -80%

median timing for hg perfbranchmap base
- on pypy:
    before:  1.383413s
    after:   0.507993s -63%
- on mozilla central:
    before:  2.821940s
    after:   1.258902s -55%
- on a private repository (about one million revisions):
    before: 77.065076s
    after:   16.158475s -80%
- on another private repository (about 401 000 revisions):
    before:  7.835503s
    after:   3.545331s -54%

diff --git a/mercurial/ancestor.py b/mercurial/ancestor.py
--- a/mercurial/ancestor.py
+++ b/mercurial/ancestor.py
@@ -11,9 +11,12 @@ import heapq
 
 from .node import nullrev
 from . import (
+    policy,
     pycompat,
 )
 
+parsers = policy.importmod(r'parsers')
+
 def commonancestorsheads(pfunc, *nodes):
     """Returns a set with the heads of all common ancestors of all nodes,
     heads(::nodes[0] and ::nodes[1] and ...) .
@@ -379,3 +382,25 @@ class lazyancestors(object):
             # free up memory.
             self._containsiter = None
             return False
+
+class rustlazyancestors(lazyancestors):
+
+    def __init__(self, index, revs, stoprev=0, inclusive=False):
+        self._index = index
+        self._stoprev = stoprev
+        self._inclusive = inclusive
+        # no need to prefilter out init revs that are smaller than stoprev,
+        # it's done by rustlazyancestors constructor.
+        # we need to convert to a list, because our ruslazyancestors
+        # constructor (from C code) doesn't understand anything else yet
+        self._initrevs = initrevs = list(revs)
+
+        self._containsseen = set()
+        self._containsiter = parsers.rustlazyancestors(
+            index, initrevs, stoprev, inclusive)
+
+    def __iter__(self):
+        return parsers.rustlazyancestors(self._index,
+                                         self._initrevs,
+                                         self._stoprev,
+                                         self._inclusive)
diff --git a/mercurial/revlog.py b/mercurial/revlog.py
--- a/mercurial/revlog.py
+++ b/mercurial/revlog.py
@@ -763,6 +763,10 @@ class revlog(object):
         for r in revs:
             checkrev(r)
         # and we're sure ancestors aren't filtered as well
+        if util.safehasattr(parsers, 'rustlazyancestors'):
+            return ancestor.rustlazyancestors(
+                self.index, revs,
+                stoprev=stoprev, inclusive=inclusive)
         return ancestor.lazyancestors(self._uncheckedparentrevs, revs,
                                       stoprev=stoprev, inclusive=inclusive)