2017-03-30 19:43:50 +02:00
|
|
|
.TH PCRE2LIMITS 3 "30 March 2017" "PCRE2 10.30"
|
2014-09-29 18:45:37 +02:00
|
|
|
.SH NAME
|
|
|
|
PCRE2 - Perl-compatible regular expressions (revised API)
|
|
|
|
.SH "SIZE AND OTHER LIMITATIONS"
|
|
|
|
.rs
|
|
|
|
.sp
|
|
|
|
There are some size limitations in PCRE2 but it is hoped that they will never
|
|
|
|
in practice be relevant.
|
|
|
|
.P
|
2018-06-18 16:03:33 +02:00
|
|
|
The maximum size of a compiled pattern is approximately 64 thousand code units
|
|
|
|
for the 8-bit and 16-bit libraries if PCRE2 is compiled with the default
|
|
|
|
internal linkage size, which is 2 bytes for these libraries. If you want to
|
|
|
|
process regular expressions that are truly enormous, you can compile PCRE2 with
|
|
|
|
an internal linkage size of 3 or 4 (when building the 16-bit library, 3 is
|
|
|
|
rounded up to 4). See the \fBREADME\fP file in the source distribution and the
|
2014-09-29 18:45:37 +02:00
|
|
|
.\" HREF
|
|
|
|
\fBpcre2build\fP
|
|
|
|
.\"
|
|
|
|
documentation for details. In these cases the limit is substantially larger.
|
|
|
|
However, the speed of execution is slower. In the 32-bit library, the internal
|
|
|
|
linkage size is always 4.
|
|
|
|
.P
|
2015-12-17 19:44:06 +01:00
|
|
|
The maximum length of a source pattern string is essentially unlimited; it is
|
|
|
|
the largest number a PCRE2_SIZE variable can hold. However, the program that
|
2015-11-05 18:33:39 +01:00
|
|
|
calls \fBpcre2_compile()\fP can specify a smaller limit.
|
|
|
|
.P
|
2014-11-25 18:50:28 +01:00
|
|
|
The maximum length (in code units) of a subject string is one less than the
|
|
|
|
largest number a PCRE2_SIZE variable can hold. PCRE2_SIZE is an unsigned
|
|
|
|
integer type, usually defined as size_t. Its maximum value (that is
|
|
|
|
~(PCRE2_SIZE)0) is reserved as a special indicator for zero-terminated strings
|
|
|
|
and unset offsets.
|
|
|
|
.P
|
2014-09-29 18:45:37 +02:00
|
|
|
All values in repeating quantifiers must be less than 65536.
|
|
|
|
.P
|
2015-11-03 11:39:27 +01:00
|
|
|
The maximum length of a lookbehind assertion is 65535 characters.
|
|
|
|
.P
|
2014-09-29 18:45:37 +02:00
|
|
|
There is no limit to the number of parenthesized subpatterns, but there can be
|
|
|
|
no more than 65535 capturing subpatterns. There is, however, a limit to the
|
|
|
|
depth of nesting of parenthesized subpatterns of all kinds. This is imposed in
|
2016-10-02 18:01:01 +02:00
|
|
|
order to limit the amount of system stack used at compile time. The default
|
2018-06-17 16:13:28 +02:00
|
|
|
limit can be specified when PCRE2 is built; if not, the default is set to 250.
|
|
|
|
An application can change this limit by calling pcre2_set_parens_nest_limit()
|
|
|
|
to set the limit in a compile context.
|
2014-09-29 18:45:37 +02:00
|
|
|
.P
|
|
|
|
The maximum length of name for a named subpattern is 32 code units, and the
|
|
|
|
maximum number of named subpatterns is 10000.
|
|
|
|
.P
|
|
|
|
The maximum length of a name in a (*MARK), (*PRUNE), (*SKIP), or (*THEN) verb
|
2016-10-26 18:59:22 +02:00
|
|
|
is 255 code units for the 8-bit library and 65535 code units for the 16-bit and
|
|
|
|
32-bit libraries.
|
2016-10-02 18:01:01 +02:00
|
|
|
.P
|
2017-01-16 18:40:47 +01:00
|
|
|
The maximum length of a string argument to a callout is the largest number a
|
2016-10-02 18:01:01 +02:00
|
|
|
32-bit unsigned integer can hold.
|
2014-09-29 18:45:37 +02:00
|
|
|
.
|
|
|
|
.
|
|
|
|
.SH AUTHOR
|
|
|
|
.rs
|
|
|
|
.sp
|
|
|
|
.nf
|
|
|
|
Philip Hazel
|
|
|
|
University Computing Service
|
2014-11-17 17:59:02 +01:00
|
|
|
Cambridge, England.
|
2014-09-29 18:45:37 +02:00
|
|
|
.fi
|
|
|
|
.
|
|
|
|
.
|
|
|
|
.SH REVISION
|
|
|
|
.rs
|
|
|
|
.sp
|
|
|
|
.nf
|
2017-03-30 19:43:50 +02:00
|
|
|
Last updated: 30 March 2017
|
|
|
|
Copyright (c) 1997-2017 University of Cambridge.
|
2014-09-29 18:45:37 +02:00
|
|
|
.fi
|