walkero
/
pcre2
1
0
Fork 0
Code Issues Pull Requests Projects Releases 1 Wiki Activity

Fix typos and obsolescences in comments.

This commit is contained in:
Philip.Hazel 2018-10-21 15:06:43 +00:00
parent 996892434f
commit c796bb85a1
2 changed files with 3 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

7
src/pcre2_compile.c
View File

@ -285,7 +285,7 @@ versions. */
#define META_LAST_QUANTIFIER META_MINMAX_QUERY #define META_LAST_QUANTIFIER META_MINMAX_QUERY
/* This is a special "meta code" that is used only to distinguish (*asr: from /* 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 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. */ therefore no need for it to have a length entry, so use a high value. */
@ -7467,9 +7467,8 @@ for (;; pptr++)
scanned and these numbers are replaced by offsets within the pattern. It is scanned and these numbers are replaced by offsets within the pattern. It is
done like this to avoid problems with forward references and adjusting done like this to avoid problems with forward references and adjusting
offsets when groups are duplicated and moved (as discovered in previous offsets when groups are duplicated and moved (as discovered in previous
implementations). Note that a recursion does not have a set first character implementations). Note that a recursion does not have a set first
(relevant if it is repeated, because it will then be wrapped with ONCE character. */
brackets). */
case META_RECURSE: case META_RECURSE:
GETPLUSOFFSET(offset, pptr); GETPLUSOFFSET(offset, pptr);

2
src/pcre2_jit_match.c
View File

@ -152,8 +152,6 @@ else
jit_stack = NULL; 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; max_oveccount = functions->top_bracket;
if (oveccount > max_oveccount) if (oveccount > max_oveccount)