Revision: 1033
http://www.exim.org/viewvc/pcre2?view=rev&revision=1033
Author: ph10
Date: 2018-10-21 16:06:43 +0100 (Sun, 21 Oct 2018)
Log Message:
-----------
Fix typos and obsolescences in comments.
Modified Paths:
--------------
code/trunk/src/pcre2_compile.c
code/trunk/src/pcre2_jit_match.c
Modified: code/trunk/src/pcre2_compile.c
===================================================================
--- code/trunk/src/pcre2_compile.c 2018-10-20 09:28:02 UTC (rev 1032)
+++ code/trunk/src/pcre2_compile.c 2018-10-21 15:06:43 UTC (rev 1033)
@@ -285,7 +285,7 @@
#define META_LAST_QUANTIFIER META_MINMAX_QUERY
/* This is a special "meta code" that is used only to distinguish (*asr: from
-(*sr in the table of aphabetic assertions. It is never stored in the parsed
+(*sr: in the table of aphabetic assertions. It is never stored in the parsed
pattern because (*asr: is turned into (*sr:(*atomic: at that stage. There is
therefore no need for it to have a length entry, so use a high value. */
@@ -7467,9 +7467,8 @@
scanned and these numbers are replaced by offsets within the pattern. It is
done like this to avoid problems with forward references and adjusting
offsets when groups are duplicated and moved (as discovered in previous
- implementations). Note that a recursion does not have a set first character
- (relevant if it is repeated, because it will then be wrapped with ONCE
- brackets). */
+ implementations). Note that a recursion does not have a set first
+ character. */
case META_RECURSE:
GETPLUSOFFSET(offset, pptr);
Modified: code/trunk/src/pcre2_jit_match.c
===================================================================
--- code/trunk/src/pcre2_jit_match.c 2018-10-20 09:28:02 UTC (rev 1032)
+++ code/trunk/src/pcre2_jit_match.c 2018-10-21 15:06:43 UTC (rev 1033)
@@ -152,8 +152,6 @@
jit_stack = NULL;
}
-/* JIT only need two offsets for each ovector entry. Hence
- the last 1/3 of the ovector will never be touched. */
max_oveccount = functions->top_bracket;
if (oveccount > max_oveccount)
