/[pcre]/code/trunk/doc/pcrelimits.3
ViewVC logotype

Contents of /code/trunk/doc/pcrelimits.3

Parent Directory Parent Directory | Revision Log Revision Log


Revision 678 - (show annotations)
Sun Aug 28 15:23:03 2011 UTC (8 years ago) by ph10
File size: 1650 byte(s)
Documentation for JIT support.
1 .TH PCRELIMITS 3
2 .SH NAME
3 PCRE - Perl-compatible regular expressions
4 .SH "SIZE AND OTHER LIMITATIONS"
5 .rs
6 .sp
7 There are some size limitations in PCRE but it is hoped that they will never in
8 practice be relevant.
9 .P
10 The maximum length of a compiled pattern is 65539 (sic) bytes if PCRE is
11 compiled with the default internal linkage size of 2. If you want to process
12 regular expressions that are truly enormous, you can compile PCRE with an
13 internal linkage size of 3 or 4 (see the \fBREADME\fP file in the source
14 distribution and the
15 .\" HREF
16 \fBpcrebuild\fP
17 .\"
18 documentation for details). In these cases the limit is substantially larger.
19 However, the speed of execution is slower.
20 .P
21 All values in repeating quantifiers must be less than 65536.
22 .P
23 There is no limit to the number of parenthesized subpatterns, but there can be
24 no more than 65535 capturing subpatterns.
25 .P
26 The maximum length of name for a named subpattern is 32 characters, and the
27 maximum number of named subpatterns is 10000.
28 .P
29 The maximum length of a subject string is the largest positive number that an
30 integer variable can hold. However, when using the traditional matching
31 function, PCRE uses recursion to handle subpatterns and indefinite repetition.
32 This means that the available stack space may limit the size of a subject
33 string that can be processed by certain patterns. For a discussion of stack
34 issues, see the
35 .\" HREF
36 \fBpcrestack\fP
37 .\"
38 documentation.
39 .
40 .
41 .SH AUTHOR
42 .rs
43 .sp
44 .nf
45 Philip Hazel
46 University Computing Service
47 Cambridge CB2 3QH, England.
48 .fi
49 .
50 .
51 .SH REVISION
52 .rs
53 .sp
54 .nf
55 Last updated: 24 August 2011
56 Copyright (c) 1997-2011 University of Cambridge.
57 .fi

  ViewVC Help
Powered by ViewVC 1.1.5