--- embedaddon/pcre/doc/html/pcrelimits.html 2012/02/21 23:50:25 1.1.1.2 +++ embedaddon/pcre/doc/html/pcrelimits.html 2014/06/15 19:46:05 1.1.1.5 @@ -21,11 +21,13 @@ practice be relevant.
The maximum length of a compiled pattern is approximately 64K data units (bytes -for the 8-bit library, 16-bit units for the 16-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, you can compile PCRE with an -internal linkage size of 3 or 4 (when building the 16-bit library, 3 is rounded -up to 4). See the README file in the source distribution and the +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, +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 +16-bit or 32-bit library, 3 is rounded up to 4). See the README file in +the source distribution and the pcrebuild documentation for details. In these cases the limit is substantially larger. However, the speed of execution is slower. @@ -35,7 +37,10 @@ All values in repeating quantifiers must be less than
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.
There is a limit to the number of forward references to subsequent subpatterns @@ -48,6 +53,10 @@ The maximum length of name for a named subpattern is 3 maximum number of named subpatterns is 10000.
+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 libraries. +
+
The maximum length of a subject string is the largest positive number that an
integer variable can hold. However, when using the traditional matching
function, PCRE uses recursion to handle subpatterns and indefinite repetition.
@@ -72,9 +81,9 @@ Cambridge CB2 3QH, England.
REVISION
-Last updated: 08 January 2012
+Last updated: 05 November 2013
-Copyright © 1997-2012 University of Cambridge.
+Copyright © 1997-2013 University of Cambridge.
Return to the PCRE index page.