embedaddon/pcre/doc/pcrelimits.3 - diff

Return to pcrelimits.3 CVS log

Up to [ELWIX - Embedded LightWeight unIX -] / embedaddon / pcre / doc

Diff for /embedaddon/pcre/doc/pcrelimits.3 between versions 1.1.1.4 and 1.1.1.5

FreeBSD-CVSweb <freebsd-cvsweb@FreeBSD.org>

version 1.1.1.4, 2013/07/22 08:25:56	version 1.1.1.5, 2014/06/15 19:46:04
Line 1	Line 1
.TH PCRELIMITS 3 "24 June 2012" "PCRE 8.30"	.TH PCRELIMITS 3 "05 November 2013" "PCRE 8.34"
.SH NAME	.SH NAME
PCRE - Perl-compatible regular expressions	PCRE - Perl-compatible regular expressions
.SH "SIZE AND OTHER LIMITATIONS"	.SH "SIZE AND OTHER LIMITATIONS"
Line 8 There are some size limitations in PCRE but it is hope	Line 8 There are some size limitations in PCRE but it is hope
practice be relevant.	practice be relevant.
.P	.P
The maximum length of a compiled pattern is approximately 64K data units (bytes	The maximum length of a compiled pattern is approximately 64K data units (bytes
for the 8-bit library, 32-bit units for the 32-bit library, and 32-bit units for	for the 8-bit library, 16-bit units for the 16-bit library, and 32-bit units for
the 32-bit library) if PCRE is compiled with the default internal linkage size	the 32-bit library) if PCRE is compiled with the default internal linkage size,
of 2 bytes. If you want to process regular expressions that are truly enormous,	which is 2 bytes for the 8-bit and 16-bit libraries, and 4 bytes for the 32-bit
	library. If you want to process regular expressions that are truly enormous,
you can compile PCRE with an internal linkage size of 3 or 4 (when building the	you can compile PCRE with an internal linkage size of 3 or 4 (when building the
16-bit or 32-bit library, 3 is rounded up to 4). See the \fBREADME\fP file in	16-bit or 32-bit library, 3 is rounded up to 4). See the \fBREADME\fP file in
the source distribution and the	the source distribution and the
Line 23 However, the speed of execution is slower.	Line 24 However, the speed of execution is slower.
All values in repeating quantifiers must be less than 65536.	All values in repeating quantifiers must be less than 65536.
.P	.P
There is no limit to the number of parenthesized subpatterns, but there can be	There is no limit to the number of parenthesized subpatterns, but there can be
no more than 65535 capturing subpatterns.	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
	order to limit the amount of system stack used at compile time. The limit can
	be specified when PCRE is built; the default is 250.
.P	.P
There is a limit to the number of forward references to subsequent subpatterns	There is a limit to the number of forward references to subsequent subpatterns
of around 200,000. Repeated forward references with fixed upper limits, for	of around 200,000. Repeated forward references with fixed upper limits, for
Line 34 The maximum length of name for a named subpattern is 3	Line 38 The maximum length of name for a named subpattern is 3
maximum number of named subpatterns is 10000.	maximum number of named subpatterns is 10000.
.P	.P
The maximum length of a name in a (MARK), (PRUNE), (SKIP), or (THEN) verb	The maximum length of a name in a (MARK), (PRUNE), (SKIP), or (THEN) verb
is 255 for the 8-bit library and 65535 for the 16-bit and 32-bit library.	is 255 for the 8-bit library and 65535 for the 16-bit and 32-bit libraries.
.P	.P
The maximum length of a subject string is the largest positive number that an	The maximum length of a subject string is the largest positive number that an
integer variable can hold. However, when using the traditional matching	integer variable can hold. However, when using the traditional matching
Line 62 Cambridge CB2 3QH, England.	Line 66 Cambridge CB2 3QH, England.
.rs	.rs
.sp	.sp
.nf	.nf
Last updated: 04 May 2012	Last updated: 05 November 2013
Copyright (c) 1997-2012 University of Cambridge.	Copyright (c) 1997-2013 University of Cambridge.
.fi	.fi

Removed from v.1.1.1.4
changed lines
	Added in v.1.1.1.5