# HG changeset patch
# User Matt Mackall <mpm@selenic.com>
# Date 1187550236 18000
# Node ID 0f6a1bdf89fb9b8e6c260a56a96063df3d57a636
# Parent  6d5ed61c508cfdfa0c12fad4cb328b975ad15135
match: handle large regexes

Some Python versions don't handle large regexes, so when we hit an
overflow, split our regex in two.

diff --git a/mercurial/util.py b/mercurial/util.py
--- a/mercurial/util.py
+++ b/mercurial/util.py
@@ -476,6 +476,15 @@ def _matcher(canonroot, cwd, names, inc,
         try:
             pat = '(?:%s)' % '|'.join([regex(k, p, tail) for (k, p) in pats])
             return re.compile(pat).match
+        except OverflowError:
+            # We're using a Python with a tiny regex engine and we
+            # made it explode, so we'll divide the pattern list in two
+            # until it works
+            l = len(pats)
+            if l < 2:
+                raise
+            a, b = matchfn(pats[:l/2], tail), matchfn(pats[l/2:], tail)
+            return lambda s: a(s) or b(s)
         except re.error:
             for k, p in pats:
                 try: