Re-factor pcre2_dfa_match() to use the heap instead of the stack for workspace

vectors when doing recursive function calls.


git-svn-id: svn://vcs.exim.org/pcre2/code/trunk@932 6239d852-aaf2-0410-a92c-79f79f948069

1 files changed, 5 insertions, 4 deletions

diff --git a/doc/html/pcre2build.html b/doc/html/pcre2build.html
index edf24e8..c9d9324 100644
--- a/doc/html/pcre2build.html
+++ b/doc/html/pcre2build.html
@@ -295,9 +295,10 @@ change this by a setting such as
   --with-heap-limit=500
 </pre>
 which limits the amount of heap to 500 kilobytes. This limit applies only to
-interpretive matching in pcre2_match(). It does not apply when JIT (which has
-its own memory arrangements) is used, nor does it apply to
-<b>pcre2_dfa_match()</b>.
+interpretive matching in <b>pcre2_match()</b> and <b>pcre2_dfa_match()</b>, which
+may also use the heap for internal workspace when processing complicated
+patterns. This limit does not apply when JIT (which has its own memory
+arrangements) is used.
 </P>
 <P>
 You can also explicitly limit the depth of nested backtracking in the
@@ -573,7 +574,7 @@ Cambridge, England.
 </P>
 <br><a name="SEC25" href="#TOC1">REVISION</a><br>
 <P>
-Last updated: 25 February 2018
+Last updated: 26 April 2018
 <br>
 Copyright &copy; 1997-2018 University of Cambridge.
 <br>