Documentation update

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

1 files changed, 22 insertions, 15 deletions

diff --git a/doc/html/pcre2test.html b/doc/html/pcre2test.html
index 1e82683..005df95 100644
--- a/doc/html/pcre2test.html
+++ b/doc/html/pcre2test.html
@@ -1082,14 +1082,14 @@ pattern.
       copy=<number or name>      copy captured substring
       depth_limit=<n>            set a depth limit
       dfa                        use <b>pcre2_dfa_match()</b>
-      find_limits                find match and recursion limits
+      find_limits                find match and depth limits
       get=&#60;number or name&#62;       extract captured substring
       getall                     extract all captured substrings
   /g  global                     global matching
       jitstack=&#60;n&#62;               set size of JIT stack
       mark                       show mark values
       match_limit=&#60;n&#62;            set a match limit
-      memory                     show memory usage
+      memory                     show heap memory usage
       null_context               match with a NULL context
       offset=&#60;n&#62;                 set starting offset
       offset_limit=&#60;n&#62;           set offset limit
@@ -1339,25 +1339,29 @@ limits in the match context. These values are ignored when the
 Finding minimum limits
 </b><br>
 <P>
-If the <b>find_limits</b> modifier is present, <b>pcre2test</b> calls
-<b>pcre2_match()</b> several times, setting different values in the match
-context via <b>pcre2_set_match_limit()</b> and <b>pcre2_set_depth_limit()</b>
-until it finds the minimum values for each parameter that allow
-<b>pcre2_match()</b> to complete without error.
+If the <b>find_limits</b> modifier is present on a subject line, <b>pcre2test</b>
+calls the relevant matching function several times, setting different values in
+the match context via <b>pcre2_set_match_limit()</b> or
+<b>pcre2_set_depth_limit()</b> until it finds the minimum values for each
+parameter that allows the match to complete without error.
 </P>
 <P>
 If JIT is being used, only the match limit is relevant. If DFA matching is
-being used, only the depth limit is relevant, but at present this modifier is
-ignored (with a warning message).
+being used, only the depth limit is relevant.
 </P>
 <P>
 The <i>match_limit</i> number is a measure of the amount of backtracking
 that takes place, and learning the minimum value can be instructive. For most
 simple matches, the number is quite small, but for patterns with very large
 numbers of matching possibilities, it can become large very quickly with
-increasing length of subject string. The <i>depth_limit</i> number is
-a measure of how much memory for recording backtracking points is needed to
-complete the match attempt.
+increasing length of subject string. 
+</P>
+<P>
+For non-DFA matching, the minimum <i>depth_limit</i> number is a measure of how
+much memory for recording backtracking points is needed to complete the match
+attempt. In the case of DFA matching, <i>depth_limit</i> controls the depth of 
+recursive calls of the internal function that is used for handling pattern 
+recursion, lookaround assertions, and atomic groups.
 </P>
 <br><b>
 Showing MARK names
@@ -1373,8 +1377,11 @@ is added to the non-match message.
 Showing memory usage
 </b><br>
 <P>
-The <b>memory</b> modifier causes <b>pcre2test</b> to log all memory allocation
-and freeing calls that occur during a match operation.
+The <b>memory</b> modifier causes <b>pcre2test</b> to log all heap memory
+allocation and freeing calls that occur during a call to <b>pcre2_match()</b>.
+These occur only when a match requires a bigger vector than the default for
+remembering backtracking points. In many cases there will be none. No heap
+memory is allocated during matching with <b>pcre2_dfa_match</b> or with JIT.
 </P>
 <br><b>
 Setting a starting offset
@@ -1787,7 +1794,7 @@ Cambridge, England.
 </P>
 <br><a name="SEC21" href="#TOC1">REVISION</a><br>
 <P>
-Last updated: 21 March 2017
+Last updated: 24 March 2017
 <br>
 Copyright &copy; 1997-2017 University of Cambridge.
 <br>