/[pcre]/code/trunk/doc/pcre.txt
ViewVC logotype

Contents of /code/trunk/doc/pcre.txt

Parent Directory Parent Directory | Revision Log Revision Log


Revision 155 - (hide annotations) (download)
Tue Apr 24 13:36:11 2007 UTC (6 years ago) by ph10
File MIME type: text/plain
File size: 267172 byte(s)
Tidies and final updates for 7.1.

1 nigel 75 -----------------------------------------------------------------------------
2 nigel 63 This file contains a concatenation of the PCRE man pages, converted to plain
3     text format for ease of searching with a text editor, or for use on systems
4     that do not have a man page processor. The small individual files that give
5     synopses of each function in the library have not been included. There are
6     separate text files for the pcregrep and pcretest commands.
7     -----------------------------------------------------------------------------
8    
9 nigel 41
10 nigel 79 PCRE(3) PCRE(3)
11 nigel 41
12 nigel 79
13 nigel 73 NAME
14     PCRE - Perl-compatible regular expressions
15    
16 nigel 77
17 nigel 75 INTRODUCTION
18 nigel 41
19 nigel 73 The PCRE library is a set of functions that implement regular expres-
20     sion pattern matching using the same syntax and semantics as Perl, with
21 nigel 93 just a few differences. (Certain features that appeared in Python and
22     PCRE before they appeared in Perl are also available using the Python
23     syntax.)
24 nigel 63
25 nigel 93 The current implementation of PCRE (release 7.x) corresponds approxi-
26     mately with Perl 5.10, including support for UTF-8 encoded strings and
27     Unicode general category properties. However, UTF-8 and Unicode support
28     has to be explicitly enabled; it is not the default. The Unicode tables
29     correspond to Unicode release 5.0.0.
30 nigel 77
31 nigel 93 In addition to the Perl-compatible matching function, PCRE contains an
32     alternative matching function that matches the same compiled patterns
33     in a different way. In certain circumstances, the alternative function
34     has some advantages. For a discussion of the two matching algorithms,
35     see the pcrematching page.
36    
37     PCRE is written in C and released as a C library. A number of people
38     have written wrappers and interfaces of various kinds. In particular,
39     Google Inc. have provided a comprehensive C++ wrapper. This is now
40 nigel 77 included as part of the PCRE distribution. The pcrecpp page has details
41 nigel 93 of this interface. Other people's contributions can be found in the
42 nigel 77 Contrib directory at the primary FTP site, which is:
43 nigel 63
44 nigel 73 ftp://ftp.csx.cam.ac.uk/pub/software/programming/pcre
45 nigel 63
46 nigel 93 Details of exactly which Perl regular expression features are and are
47 nigel 73 not supported by PCRE are given in separate documents. See the pcrepat-
48     tern and pcrecompat pages.
49 nigel 63
50 nigel 93 Some features of PCRE can be included, excluded, or changed when the
51     library is built. The pcre_config() function makes it possible for a
52     client to discover which features are available. The features them-
53     selves are described in the pcrebuild page. Documentation about build-
54     ing PCRE for various operating systems can be found in the README file
55 nigel 75 in the source distribution.
56 nigel 63
57 nigel 93 The library contains a number of undocumented internal functions and
58     data tables that are used by more than one of the exported external
59     functions, but which are not intended for use by external callers.
60     Their names all begin with "_pcre_", which hopefully will not provoke
61 nigel 83 any name clashes. In some environments, it is possible to control which
62 nigel 93 external symbols are exported when a shared library is built, and in
63 nigel 83 these cases the undocumented symbols are not exported.
64 nigel 63
65 nigel 77
66 nigel 63 USER DOCUMENTATION
67    
68 nigel 93 The user documentation for PCRE comprises a number of different sec-
69     tions. In the "man" format, each of these is a separate "man page". In
70     the HTML format, each is a separate page, linked from the index page.
71     In the plain text format, all the sections are concatenated, for ease
72 nigel 75 of searching. The sections are as follows:
73 nigel 63
74 nigel 73 pcre this document
75 ph10 153 pcre-config show PCRE installation configuration information
76 nigel 77 pcreapi details of PCRE's native C API
77 nigel 73 pcrebuild options for building PCRE
78     pcrecallout details of the callout feature
79     pcrecompat discussion of Perl compatibility
80 nigel 77 pcrecpp details of the C++ wrapper
81 nigel 73 pcregrep description of the pcregrep command
82 nigel 77 pcrematching discussion of the two matching algorithms
83 nigel 75 pcrepartial details of the partial matching facility
84 nigel 73 pcrepattern syntax and semantics of supported
85     regular expressions
86     pcreperform discussion of performance issues
87 nigel 77 pcreposix the POSIX-compatible C API
88 nigel 75 pcreprecompile details of saving and re-using precompiled patterns
89 nigel 73 pcresample discussion of the sample program
90 nigel 91 pcrestack discussion of stack usage
91 nigel 75 pcretest description of the pcretest testing command
92 nigel 63
93 nigel 93 In addition, in the "man" and HTML formats, there is a short page for
94 nigel 77 each C library function, listing its arguments and results.
95 nigel 63
96    
97     LIMITATIONS
98    
99 nigel 93 There are some size limitations in PCRE but it is hoped that they will
100 nigel 73 never in practice be relevant.
101 nigel 63
102 nigel 93 The maximum length of a compiled pattern is 65539 (sic) bytes if PCRE
103 nigel 73 is compiled with the default internal linkage size of 2. If you want to
104 nigel 93 process regular expressions that are truly enormous, you can compile
105     PCRE with an internal linkage size of 3 or 4 (see the README file in
106     the source distribution and the pcrebuild documentation for details).
107     In these cases the limit is substantially larger. However, the speed
108     of execution is slower.
109 nigel 63
110 nigel 93 All values in repeating quantifiers must be less than 65536. The maxi-
111     mum compiled length of subpattern with an explicit repeat count is
112 nigel 91 30000 bytes. The maximum number of capturing subpatterns is 65535.
113 nigel 63
114 nigel 93 There is no limit to the number of parenthesized subpatterns, but there
115     can be no more than 65535 capturing subpatterns.
116 nigel 63
117 nigel 93 The maximum length of name for a named subpattern is 32 characters, and
118     the maximum number of named subpatterns is 10000.
119 nigel 91
120 nigel 93 The maximum length of a subject string is the largest positive number
121     that an integer variable can hold. However, when using the traditional
122 nigel 77 matching function, PCRE uses recursion to handle subpatterns and indef-
123 nigel 93 inite repetition. This means that the available stack space may limit
124 nigel 77 the size of a subject string that can be processed by certain patterns.
125 nigel 91 For a discussion of stack issues, see the pcrestack documentation.
126 nigel 63
127    
128 nigel 75 UTF-8 AND UNICODE PROPERTY SUPPORT
129 nigel 63
130 nigel 93 From release 3.3, PCRE has had some support for character strings
131     encoded in the UTF-8 format. For release 4.0 this was greatly extended
132     to cover most common requirements, and in release 5.0 additional sup-
133 nigel 75 port for Unicode general category properties was added.
134 nigel 63
135 nigel 93 In order process UTF-8 strings, you must build PCRE to include UTF-8
136     support in the code, and, in addition, you must call pcre_compile()
137     with the PCRE_UTF8 option flag. When you do this, both the pattern and
138     any subject strings that are matched against it are treated as UTF-8
139 nigel 73 strings instead of just strings of bytes.
140 nigel 63
141 nigel 93 If you compile PCRE with UTF-8 support, but do not use it at run time,
142     the library will be a bit bigger, but the additional run time overhead
143     is limited to testing the PCRE_UTF8 flag occasionally, so should not be
144     very big.
145 nigel 63
146 nigel 75 If PCRE is built with Unicode character property support (which implies
147 nigel 93 UTF-8 support), the escape sequences \p{..}, \P{..}, and \X are sup-
148 nigel 75 ported. The available properties that can be tested are limited to the
149 nigel 93 general category properties such as Lu for an upper case letter or Nd
150     for a decimal number, the Unicode script names such as Arabic or Han,
151     and the derived properties Any and L&. A full list is given in the
152 nigel 87 pcrepattern documentation. Only the short names for properties are sup-
153 nigel 93 ported. For example, \p{L} matches a letter. Its Perl synonym, \p{Let-
154     ter}, is not supported. Furthermore, in Perl, many properties may
155     optionally be prefixed by "Is", for compatibility with Perl 5.6. PCRE
156 nigel 87 does not support this.
157 nigel 75
158 nigel 73 The following comments apply when PCRE is running in UTF-8 mode:
159 nigel 63
160 nigel 93 1. When you set the PCRE_UTF8 flag, the strings passed as patterns and
161     subjects are checked for validity on entry to the relevant functions.
162 nigel 73 If an invalid UTF-8 string is passed, an error return is given. In some
163 nigel 93 situations, you may already know that your strings are valid, and
164 nigel 73 therefore want to skip these checks in order to improve performance. If
165 nigel 93 you set the PCRE_NO_UTF8_CHECK flag at compile time or at run time,
166     PCRE assumes that the pattern or subject it is given (respectively)
167     contains only valid UTF-8 codes. In this case, it does not diagnose an
168     invalid UTF-8 string. If you pass an invalid UTF-8 string to PCRE when
169     PCRE_NO_UTF8_CHECK is set, the results are undefined. Your program may
170 nigel 73 crash.
171 nigel 63
172 nigel 93 2. An unbraced hexadecimal escape sequence (such as \xb3) matches a
173 nigel 87 two-byte UTF-8 character if the value is greater than 127.
174 nigel 63
175 nigel 93 3. Octal numbers up to \777 are recognized, and match two-byte UTF-8
176 nigel 91 characters for values greater than \177.
177    
178 nigel 93 4. Repeat quantifiers apply to complete UTF-8 characters, not to indi-
179 nigel 73 vidual bytes, for example: \x{100}{3}.
180 nigel 63
181 nigel 93 5. The dot metacharacter matches one UTF-8 character instead of a sin-
182 nigel 75 gle byte.
183 nigel 63
184 nigel 93 6. The escape sequence \C can be used to match a single byte in UTF-8
185     mode, but its use can lead to some strange effects. This facility is
186 nigel 77 not available in the alternative matching function, pcre_dfa_exec().
187 nigel 63
188 nigel 93 7. The character escapes \b, \B, \d, \D, \s, \S, \w, and \W correctly
189     test characters of any code value, but the characters that PCRE recog-
190     nizes as digits, spaces, or word characters remain the same set as
191 nigel 75 before, all with values less than 256. This remains true even when PCRE
192 nigel 93 includes Unicode property support, because to do otherwise would slow
193     down PCRE in many common cases. If you really want to test for a wider
194     sense of, say, "digit", you must use Unicode property tests such as
195 nigel 75 \p{Nd}.
196 nigel 63
197 nigel 93 8. Similarly, characters that match the POSIX named character classes
198 nigel 75 are all low-valued characters.
199 nigel 63
200 nigel 93 9. Case-insensitive matching applies only to characters whose values
201     are less than 128, unless PCRE is built with Unicode property support.
202     Even when Unicode property support is available, PCRE still uses its
203     own character tables when checking the case of low-valued characters,
204     so as not to degrade performance. The Unicode property information is
205 nigel 87 used only for characters with higher values. Even when Unicode property
206     support is available, PCRE supports case-insensitive matching only when
207 nigel 93 there is a one-to-one mapping between a letter's cases. There are a
208     small number of many-to-one mappings in Unicode; these are not sup-
209 nigel 87 ported by PCRE.
210 nigel 63
211    
212     AUTHOR
213    
214 nigel 77 Philip Hazel
215 ph10 99 University Computing Service
216 nigel 93 Cambridge CB2 3QH, England.
217 nigel 63
218 nigel 93 Putting an actual email address here seems to have been a spam magnet,
219 ph10 153 so I've taken it away. If you want to email me, use my two initials,
220     followed by the two digits 10, at the domain cam.ac.uk.
221 nigel 77
222 nigel 63
223 ph10 99 REVISION
224 nigel 63
225 ph10 153 Last updated: 18 April 2007
226 ph10 99 Copyright (c) 1997-2007 University of Cambridge.
227     ------------------------------------------------------------------------------
228 ph10 111
229    
230 nigel 79 PCREBUILD(3) PCREBUILD(3)
231 nigel 63
232 nigel 79
233 nigel 73 NAME
234     PCRE - Perl-compatible regular expressions
235    
236 nigel 77
237 nigel 63 PCRE BUILD-TIME OPTIONS
238    
239 nigel 73 This document describes the optional features of PCRE that can be
240     selected when the library is compiled. They are all selected, or dese-
241 nigel 75 lected, by providing options to the configure script that is run before
242     the make command. The complete list of options for configure (which
243     includes the standard ones such as the selection of the installation
244     directory) can be obtained by running
245 nigel 63
246 nigel 73 ./configure --help
247 nigel 63
248 ph10 128 The following sections include descriptions of options whose names
249     begin with --enable or --disable. These settings specify changes to the
250     defaults for the configure command. Because of the way that configure
251     works, --enable and --disable always come in pairs, so the complemen-
252     tary option always exists as well, but as it specifies the default, it
253     is not described.
254 nigel 63
255    
256 nigel 83 C++ SUPPORT
257    
258     By default, the configure script will search for a C++ compiler and C++
259     header files. If it finds them, it automatically builds the C++ wrapper
260     library for PCRE. You can disable this by adding
261    
262     --disable-cpp
263    
264     to the configure command.
265    
266    
267 nigel 63 UTF-8 SUPPORT
268    
269 nigel 73 To build PCRE with support for UTF-8 character strings, add
270 nigel 63
271 nigel 73 --enable-utf8
272 nigel 63
273 nigel 73 to the configure command. Of itself, this does not make PCRE treat
274     strings as UTF-8. As well as compiling PCRE with this option, you also
275     have have to set the PCRE_UTF8 option when you call the pcre_compile()
276     function.
277 nigel 63
278    
279 nigel 75 UNICODE CHARACTER PROPERTY SUPPORT
280    
281     UTF-8 support allows PCRE to process character values greater than 255
282     in the strings that it handles. On its own, however, it does not pro-
283     vide any facilities for accessing the properties of such characters. If
284     you want to be able to use the pattern escapes \P, \p, and \X, which
285     refer to Unicode character properties, you must add
286    
287     --enable-unicode-properties
288    
289     to the configure command. This implies UTF-8 support, even if you have
290     not explicitly requested it.
291    
292 ph10 128 Including Unicode property support adds around 30K of tables to the
293     PCRE library. Only the general category properties such as Lu and Nd
294     are supported. Details are given in the pcrepattern documentation.
295 nigel 75
296    
297 nigel 63 CODE VALUE OF NEWLINE
298    
299 ph10 128 By default, PCRE interprets character 10 (linefeed, LF) as indicating
300     the end of a line. This is the normal newline character on Unix-like
301 nigel 91 systems. You can compile PCRE to use character 13 (carriage return, CR)
302     instead, by adding
303 nigel 63
304 nigel 73 --enable-newline-is-cr
305 nigel 63
306 ph10 128 to the configure command. There is also a --enable-newline-is-lf
307 nigel 91 option, which explicitly specifies linefeed as the newline character.
308 nigel 63
309 nigel 91 Alternatively, you can specify that line endings are to be indicated by
310     the two character sequence CRLF. If you want this, add
311 nigel 63
312 nigel 91 --enable-newline-is-crlf
313    
314 nigel 93 to the configure command. There is a fourth option, specified by
315 nigel 91
316 ph10 150 --enable-newline-is-anycrlf
317    
318     which causes PCRE to recognize any of the three sequences CR, LF, or
319     CRLF as indicating a line ending. Finally, a fifth option, specified by
320    
321 nigel 93 --enable-newline-is-any
322 nigel 91
323 ph10 150 causes PCRE to recognize any Unicode newline sequence.
324 nigel 93
325 ph10 128 Whatever line ending convention is selected when PCRE is built can be
326     overridden when the library functions are called. At build time it is
327 nigel 93 conventional to use the standard for your operating system.
328    
329    
330 nigel 63 BUILDING SHARED AND STATIC LIBRARIES
331    
332 ph10 128 The PCRE building process uses libtool to build both shared and static
333     Unix libraries by default. You can suppress one of these by adding one
334 nigel 73 of
335 nigel 63
336 nigel 73 --disable-shared
337     --disable-static
338 nigel 63
339 nigel 73 to the configure command, as required.
340 nigel 63
341    
342     POSIX MALLOC USAGE
343    
344 nigel 75 When PCRE is called through the POSIX interface (see the pcreposix doc-
345 ph10 128 umentation), additional working storage is required for holding the
346     pointers to capturing substrings, because PCRE requires three integers
347     per substring, whereas the POSIX interface provides only two. If the
348 nigel 73 number of expected substrings is small, the wrapper function uses space
349     on the stack, because this is faster than using malloc() for each call.
350     The default threshold above which the stack is no longer used is 10; it
351     can be changed by adding a setting such as
352 nigel 63
353 nigel 73 --with-posix-malloc-threshold=20
354 nigel 63
355 nigel 73 to the configure command.
356 nigel 63
357    
358     HANDLING VERY LARGE PATTERNS
359    
360 ph10 128 Within a compiled pattern, offset values are used to point from one
361     part to another (for example, from an opening parenthesis to an alter-
362     nation metacharacter). By default, two-byte values are used for these
363     offsets, leading to a maximum size for a compiled pattern of around
364     64K. This is sufficient to handle all but the most gigantic patterns.
365     Nevertheless, some people do want to process enormous patterns, so it
366     is possible to compile PCRE to use three-byte or four-byte offsets by
367 nigel 73 adding a setting such as
368 nigel 63
369 nigel 73 --with-link-size=3
370 nigel 63
371 ph10 128 to the configure command. The value given must be 2, 3, or 4. Using
372     longer offsets slows down the operation of PCRE because it has to load
373 nigel 73 additional bytes when handling them.
374 nigel 63
375    
376 nigel 73 AVOIDING EXCESSIVE STACK USAGE
377    
378 nigel 77 When matching with the pcre_exec() function, PCRE implements backtrack-
379 nigel 93 ing by making recursive calls to an internal function called match().
380     In environments where the size of the stack is limited, this can se-
381     verely limit PCRE's operation. (The Unix environment does not usually
382 nigel 91 suffer from this problem, but it may sometimes be necessary to increase
383 nigel 93 the maximum stack size. There is a discussion in the pcrestack docu-
384     mentation.) An alternative approach to recursion that uses memory from
385     the heap to remember data, instead of using recursive function calls,
386     has been implemented to work round the problem of limited stack size.
387 nigel 91 If you want to build a version of PCRE that works this way, add
388 nigel 73
389     --disable-stack-for-recursion
390    
391 nigel 93 to the configure command. With this configuration, PCRE will use the
392     pcre_stack_malloc and pcre_stack_free variables to call memory manage-
393     ment functions. Separate functions are provided because the usage is
394     very predictable: the block sizes requested are always the same, and
395     the blocks are always freed in reverse order. A calling program might
396     be able to implement optimized functions that perform better than the
397     standard malloc() and free() functions. PCRE runs noticeably more
398 nigel 77 slowly when built in this way. This option affects only the pcre_exec()
399     function; it is not relevant for the the pcre_dfa_exec() function.
400 nigel 73
401    
402 nigel 91 LIMITING PCRE RESOURCE USAGE
403    
404 nigel 93 Internally, PCRE has a function called match(), which it calls repeat-
405     edly (sometimes recursively) when matching a pattern with the
406     pcre_exec() function. By controlling the maximum number of times this
407     function may be called during a single matching operation, a limit can
408     be placed on the resources used by a single call to pcre_exec(). The
409     limit can be changed at run time, as described in the pcreapi documen-
410     tation. The default is 10 million, but this can be changed by adding a
411 nigel 91 setting such as
412    
413     --with-match-limit=500000
414    
415 nigel 93 to the configure command. This setting has no effect on the
416 nigel 91 pcre_dfa_exec() matching function.
417    
418 nigel 93 In some environments it is desirable to limit the depth of recursive
419 nigel 91 calls of match() more strictly than the total number of calls, in order
420 nigel 93 to restrict the maximum amount of stack (or heap, if --disable-stack-
421 nigel 91 for-recursion is specified) that is used. A second limit controls this;
422 nigel 93 it defaults to the value that is set for --with-match-limit, which
423     imposes no additional constraints. However, you can set a lower limit
424 nigel 91 by adding, for example,
425    
426     --with-match-limit-recursion=10000
427    
428 nigel 93 to the configure command. This value can also be overridden at run
429 nigel 91 time.
430    
431    
432 ph10 128 CREATING CHARACTER TABLES AT BUILD TIME
433    
434     PCRE uses fixed tables for processing characters whose code values are
435     less than 256. By default, PCRE is built with a set of tables that are
436     distributed in the file pcre_chartables.c.dist. These tables are for
437     ASCII codes only. If you add
438    
439     --enable-rebuild-chartables
440    
441     to the configure command, the distributed tables are no longer used.
442     Instead, a program called dftables is compiled and run. This outputs
443     the source for new set of tables, created in the default locale of your
444     C runtime system. (This method of replacing the tables does not work if
445     you are cross compiling, because dftables is run on the local host. If
446     you need to create alternative tables when cross compiling, you will
447     have to do so "by hand".)
448    
449    
450 nigel 73 USING EBCDIC CODE
451    
452 ph10 128 PCRE assumes by default that it will run in an environment where the
453     character code is ASCII (or Unicode, which is a superset of ASCII).
454     PCRE can, however, be compiled to run in an EBCDIC environment by
455 nigel 75 adding
456 nigel 73
457     --enable-ebcdic
458    
459 ph10 128 to the configure command. This setting implies --enable-rebuild-charta-
460     bles.
461 nigel 73
462 nigel 93
463     SEE ALSO
464    
465     pcreapi(3), pcre_config(3).
466    
467 nigel 63
468 ph10 99 AUTHOR
469 nigel 63
470 ph10 99 Philip Hazel
471     University Computing Service
472     Cambridge CB2 3QH, England.
473    
474    
475     REVISION
476    
477 ph10 150 Last updated: 16 April 2007
478 ph10 99 Copyright (c) 1997-2007 University of Cambridge.
479     ------------------------------------------------------------------------------
480 ph10 111
481    
482 nigel 79 PCREMATCHING(3) PCREMATCHING(3)
483 nigel 63
484 nigel 79
485 nigel 77 NAME
486     PCRE - Perl-compatible regular expressions
487 nigel 73
488 nigel 77
489     PCRE MATCHING ALGORITHMS
490    
491     This document describes the two different algorithms that are available
492     in PCRE for matching a compiled regular expression against a given sub-
493     ject string. The "standard" algorithm is the one provided by the
494     pcre_exec() function. This works in the same was as Perl's matching
495     function, and provides a Perl-compatible matching operation.
496    
497     An alternative algorithm is provided by the pcre_dfa_exec() function;
498     this operates in a different way, and is not Perl-compatible. It has
499     advantages and disadvantages compared with the standard algorithm, and
500     these are described below.
501    
502     When there is only one possible way in which a given subject string can
503     match a pattern, the two algorithms give the same answer. A difference
504     arises, however, when there are multiple possibilities. For example, if
505     the pattern
506    
507     ^<.*>
508    
509     is matched against the string
510    
511     <something> <something else> <something further>
512    
513     there are three possible answers. The standard algorithm finds only one
514 nigel 93 of them, whereas the alternative algorithm finds all three.
515 nigel 77
516    
517     REGULAR EXPRESSIONS AS TREES
518    
519     The set of strings that are matched by a regular expression can be rep-
520     resented as a tree structure. An unlimited repetition in the pattern
521     makes the tree of infinite size, but it is still a tree. Matching the
522     pattern to a given subject string (from a given starting point) can be
523 nigel 91 thought of as a search of the tree. There are two ways to search a
524     tree: depth-first and breadth-first, and these correspond to the two
525     matching algorithms provided by PCRE.
526 nigel 77
527    
528     THE STANDARD MATCHING ALGORITHM
529    
530 ph10 148 In the terminology of Jeffrey Friedl's book "Mastering Regular Expres-
531     sions", the standard algorithm is an "NFA algorithm". It conducts a
532 nigel 77 depth-first search of the pattern tree. That is, it proceeds along a
533     single path through the tree, checking that the subject matches what is
534     required. When there is a mismatch, the algorithm tries any alterna-
535     tives at the current point, and if they all fail, it backs up to the
536     previous branch point in the tree, and tries the next alternative
537     branch at that level. This often involves backing up (moving to the
538     left) in the subject string as well. The order in which repetition
539     branches are tried is controlled by the greedy or ungreedy nature of
540     the quantifier.
541    
542     If a leaf node is reached, a matching string has been found, and at
543     that point the algorithm stops. Thus, if there is more than one possi-
544     ble match, this algorithm returns the first one that it finds. Whether
545     this is the shortest, the longest, or some intermediate length depends
546     on the way the greedy and ungreedy repetition quantifiers are specified
547     in the pattern.
548    
549     Because it ends up with a single path through the tree, it is rela-
550     tively straightforward for this algorithm to keep track of the sub-
551     strings that are matched by portions of the pattern in parentheses.
552     This provides support for capturing parentheses and back references.
553    
554    
555 nigel 93 THE ALTERNATIVE MATCHING ALGORITHM
556 nigel 77
557 nigel 93 This algorithm conducts a breadth-first search of the tree. Starting
558     from the first matching point in the subject, it scans the subject
559     string from left to right, once, character by character, and as it does
560     this, it remembers all the paths through the tree that represent valid
561     matches. In Friedl's terminology, this is a kind of "DFA algorithm",
562     though it is not implemented as a traditional finite state machine (it
563     keeps multiple states active simultaneously).
564 nigel 77
565 nigel 93 The scan continues until either the end of the subject is reached, or
566     there are no more unterminated paths. At this point, terminated paths
567     represent the different matching possibilities (if there are none, the
568     match has failed). Thus, if there is more than one possible match,
569 nigel 77 this algorithm finds all of them, and in particular, it finds the long-
570 nigel 93 est. In PCRE, there is an option to stop the algorithm after the first
571 nigel 77 match (which is necessarily the shortest) has been found.
572    
573     Note that all the matches that are found start at the same point in the
574     subject. If the pattern
575    
576     cat(er(pillar)?)
577    
578 nigel 93 is matched against the string "the caterpillar catchment", the result
579     will be the three strings "cat", "cater", and "caterpillar" that start
580 nigel 77 at the fourth character of the subject. The algorithm does not automat-
581     ically move on to find matches that start at later positions.
582    
583     There are a number of features of PCRE regular expressions that are not
584 nigel 93 supported by the alternative matching algorithm. They are as follows:
585 nigel 77
586 nigel 93 1. Because the algorithm finds all possible matches, the greedy or
587     ungreedy nature of repetition quantifiers is not relevant. Greedy and
588     ungreedy quantifiers are treated in exactly the same way. However, pos-
589     sessive quantifiers can make a difference when what follows could also
590     match what is quantified, for example in a pattern like this:
591 nigel 77
592 nigel 93 ^a++\w!
593    
594     This pattern matches "aaab!" but not "aaa!", which would be matched by
595     a non-possessive quantifier. Similarly, if an atomic group is present,
596     it is matched as if it were a standalone pattern at the current point,
597     and the longest match is then "locked in" for the rest of the overall
598     pattern.
599    
600 nigel 77 2. When dealing with multiple paths through the tree simultaneously, it
601 nigel 93 is not straightforward to keep track of captured substrings for the
602     different matching possibilities, and PCRE's implementation of this
603 nigel 77 algorithm does not attempt to do this. This means that no captured sub-
604     strings are available.
605    
606 nigel 93 3. Because no substrings are captured, back references within the pat-
607 nigel 77 tern are not supported, and cause errors if encountered.
608    
609 nigel 93 4. For the same reason, conditional expressions that use a backrefer-
610     ence as the condition or test for a specific group recursion are not
611     supported.
612 nigel 77
613     5. Callouts are supported, but the value of the capture_top field is
614     always 1, and the value of the capture_last field is always -1.
615    
616     6. The \C escape sequence, which (in the standard algorithm) matches a
617 nigel 93 single byte, even in UTF-8 mode, is not supported because the alterna-
618     tive algorithm moves through the subject string one character at a
619     time, for all active paths through the tree.
620 nigel 77
621    
622 nigel 93 ADVANTAGES OF THE ALTERNATIVE ALGORITHM
623 nigel 77
624 nigel 93 Using the alternative matching algorithm provides the following advan-
625     tages:
626 nigel 77
627     1. All possible matches (at a single point in the subject) are automat-
628 nigel 93 ically found, and in particular, the longest match is found. To find
629 nigel 77 more than one match using the standard algorithm, you have to do kludgy
630     things with callouts.
631    
632 nigel 93 2. There is much better support for partial matching. The restrictions
633     on the content of the pattern that apply when using the standard algo-
634     rithm for partial matching do not apply to the alternative algorithm.
635     For non-anchored patterns, the starting position of a partial match is
636     available.
637 nigel 77
638 nigel 93 3. Because the alternative algorithm scans the subject string just
639     once, and never needs to backtrack, it is possible to pass very long
640     subject strings to the matching function in several pieces, checking
641     for partial matching each time.
642 nigel 77
643    
644 nigel 93 DISADVANTAGES OF THE ALTERNATIVE ALGORITHM
645 nigel 77
646 nigel 93 The alternative algorithm suffers from a number of disadvantages:
647 nigel 77
648 nigel 93 1. It is substantially slower than the standard algorithm. This is
649     partly because it has to search for all possible matches, but is also
650 nigel 77 because it is less susceptible to optimization.
651    
652     2. Capturing parentheses and back references are not supported.
653    
654 nigel 93 3. Although atomic groups are supported, their use does not provide the
655     performance advantage that it does for the standard algorithm.
656 nigel 77
657    
658 ph10 99 AUTHOR
659 nigel 77
660 ph10 99 Philip Hazel
661     University Computing Service
662     Cambridge CB2 3QH, England.
663    
664    
665     REVISION
666    
667     Last updated: 06 March 2007
668     Copyright (c) 1997-2007 University of Cambridge.
669     ------------------------------------------------------------------------------
670 ph10 111
671    
672 nigel 79 PCREAPI(3) PCREAPI(3)
673 nigel 77
674 nigel 79
675 nigel 73 NAME
676     PCRE - Perl-compatible regular expressions
677    
678 nigel 77
679 nigel 75 PCRE NATIVE API
680 nigel 63
681 nigel 73 #include <pcre.h>
682 nigel 41
683 nigel 73 pcre *pcre_compile(const char *pattern, int options,
684     const char **errptr, int *erroffset,
685     const unsigned char *tableptr);
686 nigel 41
687 nigel 77 pcre *pcre_compile2(const char *pattern, int options,
688     int *errorcodeptr,
689     const char **errptr, int *erroffset,
690     const unsigned char *tableptr);
691    
692 nigel 73 pcre_extra *pcre_study(const pcre *code, int options,
693     const char **errptr);
694 nigel 41
695 nigel 73 int pcre_exec(const pcre *code, const pcre_extra *extra,
696     const char *subject, int length, int startoffset,
697     int options, int *ovector, int ovecsize);
698 nigel 41
699 nigel 77 int pcre_dfa_exec(const pcre *code, const pcre_extra *extra,
700     const char *subject, int length, int startoffset,
701     int options, int *ovector, int ovecsize,
702     int *workspace, int wscount);
703    
704 nigel 73 int pcre_copy_named_substring(const pcre *code,
705     const char *subject, int *ovector,
706     int stringcount, const char *stringname,
707     char *buffer, int buffersize);
708 nigel 63
709 nigel 73 int pcre_copy_substring(const char *subject, int *ovector,
710     int stringcount, int stringnumber, char *buffer,
711     int buffersize);
712 nigel 41
713 nigel 73 int pcre_get_named_substring(const pcre *code,
714     const char *subject, int *ovector,
715     int stringcount, const char *stringname,
716     const char **stringptr);
717 nigel 63
718 nigel 73 int pcre_get_stringnumber(const pcre *code,
719     const char *name);
720 nigel 63
721 nigel 91 int pcre_get_stringtable_entries(const pcre *code,
722     const char *name, char **first, char **last);
723    
724 nigel 73 int pcre_get_substring(const char *subject, int *ovector,
725     int stringcount, int stringnumber,
726     const char **stringptr);
727 nigel 41
728 nigel 73 int pcre_get_substring_list(const char *subject,
729     int *ovector, int stringcount, const char ***listptr);
730 nigel 41
731 nigel 73 void pcre_free_substring(const char *stringptr);
732 nigel 49
733 nigel 73 void pcre_free_substring_list(const char **stringptr);
734 nigel 49
735 nigel 73 const unsigned char *pcre_maketables(void);
736 nigel 41
737 nigel 73 int pcre_fullinfo(const pcre *code, const pcre_extra *extra,
738     int what, void *where);
739 nigel 43
740 nigel 73 int pcre_info(const pcre *code, int *optptr, int *firstcharptr);
741 nigel 63
742 nigel 77 int pcre_refcount(pcre *code, int adjust);
743    
744 nigel 73 int pcre_config(int what, void *where);
745 nigel 41
746 nigel 73 char *pcre_version(void);
747 nigel 63
748 nigel 73 void *(*pcre_malloc)(size_t);
749 nigel 41
750 nigel 73 void (*pcre_free)(void *);
751 nigel 41
752 nigel 73 void *(*pcre_stack_malloc)(size_t);
753 nigel 41
754 nigel 73 void (*pcre_stack_free)(void *);
755 nigel 41
756 nigel 73 int (*pcre_callout)(pcre_callout_block *);
757 nigel 41
758 nigel 73
759 nigel 75 PCRE API OVERVIEW
760 nigel 41
761 nigel 73 PCRE has its own native API, which is described in this document. There
762 nigel 93 are also some wrapper functions that correspond to the POSIX regular
763 nigel 77 expression API. These are described in the pcreposix documentation.
764     Both of these APIs define a set of C function calls. A C++ wrapper is
765     distributed with PCRE. It is documented in the pcrecpp page.
766 nigel 43
767 nigel 77 The native API C function prototypes are defined in the header file
768     pcre.h, and on Unix systems the library itself is called libpcre. It
769 nigel 75 can normally be accessed by adding -lpcre to the command for linking an
770     application that uses PCRE. The header file defines the macros
771     PCRE_MAJOR and PCRE_MINOR to contain the major and minor release num-
772     bers for the library. Applications can use these to include support
773     for different releases of PCRE.
774 nigel 41
775 nigel 77 The functions pcre_compile(), pcre_compile2(), pcre_study(), and
776     pcre_exec() are used for compiling and matching regular expressions in
777     a Perl-compatible manner. A sample program that demonstrates the sim-
778     plest way of using them is provided in the file called pcredemo.c in
779     the source distribution. The pcresample documentation describes how to
780     run it.
781 nigel 49
782 nigel 77 A second matching function, pcre_dfa_exec(), which is not Perl-compati-
783     ble, is also provided. This uses a different algorithm for the match-
784 nigel 91 ing. The alternative algorithm finds all possible matches (at a given
785 nigel 93 point in the subject), and scans the subject just once. However, this
786     algorithm does not return captured substrings. A description of the two
787     matching algorithms and their advantages and disadvantages is given in
788     the pcrematching documentation.
789 nigel 63
790 nigel 77 In addition to the main compiling and matching functions, there are
791     convenience functions for extracting captured substrings from a subject
792     string that is matched by pcre_exec(). They are:
793    
794 nigel 73 pcre_copy_substring()
795     pcre_copy_named_substring()
796     pcre_get_substring()
797     pcre_get_named_substring()
798     pcre_get_substring_list()
799 nigel 75 pcre_get_stringnumber()
800 nigel 91 pcre_get_stringtable_entries()
801 nigel 63
802 nigel 73 pcre_free_substring() and pcre_free_substring_list() are also provided,
803     to free the memory used for extracted strings.
804 nigel 41
805 nigel 77 The function pcre_maketables() is used to build a set of character
806     tables in the current locale for passing to pcre_compile(),
807     pcre_exec(), or pcre_dfa_exec(). This is an optional facility that is
808     provided for specialist use. Most commonly, no special tables are
809     passed, in which case internal tables that are generated when PCRE is
810     built are used.
811 nigel 49
812 nigel 75 The function pcre_fullinfo() is used to find out information about a
813     compiled pattern; pcre_info() is an obsolete version that returns only
814     some of the available information, but is retained for backwards com-
815     patibility. The function pcre_version() returns a pointer to a string
816 nigel 73 containing the version of PCRE and its date of release.
817 nigel 41
818 nigel 77 The function pcre_refcount() maintains a reference count in a data
819     block containing a compiled pattern. This is provided for the benefit
820     of object-oriented applications.
821    
822 nigel 75 The global variables pcre_malloc and pcre_free initially contain the
823     entry points of the standard malloc() and free() functions, respec-
824 nigel 73 tively. PCRE calls the memory management functions via these variables,
825 nigel 75 so a calling program can replace them if it wishes to intercept the
826 nigel 73 calls. This should be done before calling any PCRE functions.
827 nigel 41
828 nigel 75 The global variables pcre_stack_malloc and pcre_stack_free are also
829     indirections to memory management functions. These special functions
830     are used only when PCRE is compiled to use the heap for remembering
831 nigel 77 data, instead of recursive function calls, when running the pcre_exec()
832 nigel 91 function. See the pcrebuild documentation for details of how to do
833     this. It is a non-standard way of building PCRE, for use in environ-
834     ments that have limited stacks. Because of the greater use of memory
835     management, it runs more slowly. Separate functions are provided so
836     that special-purpose external code can be used for this case. When
837     used, these functions are always called in a stack-like manner (last
838     obtained, first freed), and always for memory blocks of the same size.
839     There is a discussion about PCRE's stack usage in the pcrestack docu-
840     mentation.
841 nigel 41
842 nigel 73 The global variable pcre_callout initially contains NULL. It can be set
843 nigel 77 by the caller to a "callout" function, which PCRE will then call at
844     specified points during a matching operation. Details are given in the
845 nigel 73 pcrecallout documentation.
846 nigel 41
847 nigel 73
848 nigel 91 NEWLINES
849    
850 ph10 150 PCRE supports five different conventions for indicating line breaks in
851 nigel 93 strings: a single CR (carriage return) character, a single LF (line-
852 ph10 150 feed) character, the two-character sequence CRLF, any of the three pre-
853     ceding, or any Unicode newline sequence. The Unicode newline sequences
854     are the three just mentioned, plus the single characters VT (vertical
855     tab, U+000B), FF (formfeed, U+000C), NEL (next line, U+0085), LS (line
856     separator, U+2028), and PS (paragraph separator, U+2029).
857 nigel 93
858     Each of the first three conventions is used by at least one operating
859     system as its standard newline sequence. When PCRE is built, a default
860     can be specified. The default default is LF, which is the Unix stan-
861     dard. When PCRE is run, the default can be overridden, either when a
862     pattern is compiled, or when it is matched.
863    
864 nigel 91 In the PCRE documentation the word "newline" is used to mean "the char-
865 nigel 93 acter or pair of characters that indicate a line break". The choice of
866     newline convention affects the handling of the dot, circumflex, and
867     dollar metacharacters, the handling of #-comments in /x mode, and, when
868     CRLF is a recognized line ending sequence, the match position advance-
869     ment for a non-anchored pattern. The choice of newline convention does
870     not affect the interpretation of the \n or \r escape sequences.
871 nigel 91
872    
873 nigel 63 MULTITHREADING
874    
875 nigel 93 The PCRE functions can be used in multi-threading applications, with
876 nigel 73 the proviso that the memory management functions pointed to by
877     pcre_malloc, pcre_free, pcre_stack_malloc, and pcre_stack_free, and the
878     callout function pointed to by pcre_callout, are shared by all threads.
879 nigel 41
880 nigel 93 The compiled form of a regular expression is not altered during match-
881 nigel 73 ing, so the same compiled pattern can safely be used by several threads
882     at once.
883 nigel 41
884    
885 nigel 75 SAVING PRECOMPILED PATTERNS FOR LATER USE
886    
887     The compiled form of a regular expression can be saved and re-used at a
888 nigel 93 later time, possibly by a different program, and even on a host other
889     than the one on which it was compiled. Details are given in the
890 ph10 155 pcreprecompile documentation. However, compiling a regular expression
891     with one version of PCRE for use with a different version is not guar-
892     anteed to work and may cause crashes.
893 nigel 75
894    
895 nigel 63 CHECKING BUILD-TIME OPTIONS
896 nigel 41
897 nigel 73 int pcre_config(int what, void *where);
898 nigel 63
899 nigel 93 The function pcre_config() makes it possible for a PCRE client to dis-
900 nigel 73 cover which optional features have been compiled into the PCRE library.
901 nigel 93 The pcrebuild documentation has more details about these optional fea-
902 nigel 73 tures.
903 nigel 63
904 nigel 93 The first argument for pcre_config() is an integer, specifying which
905 nigel 73 information is required; the second argument is a pointer to a variable
906 nigel 93 into which the information is placed. The following information is
907 nigel 73 available:
908 nigel 63
909 nigel 73 PCRE_CONFIG_UTF8
910 nigel 63
911 nigel 93 The output is an integer that is set to one if UTF-8 support is avail-
912 nigel 73 able; otherwise it is set to zero.
913 nigel 63
914 nigel 75 PCRE_CONFIG_UNICODE_PROPERTIES
915    
916 nigel 93 The output is an integer that is set to one if support for Unicode
917 nigel 75 character properties is available; otherwise it is set to zero.
918    
919 nigel 73 PCRE_CONFIG_NEWLINE
920 nigel 63
921 nigel 93 The output is an integer whose value specifies the default character
922     sequence that is recognized as meaning "newline". The four values that
923 ph10 150 are supported are: 10 for LF, 13 for CR, 3338 for CRLF, -2 for ANYCRLF,
924     and -1 for ANY. The default should normally be the standard sequence
925     for your operating system.
926 nigel 63
927 nigel 73 PCRE_CONFIG_LINK_SIZE
928 nigel 63
929 nigel 91 The output is an integer that contains the number of bytes used for
930 nigel 73 internal linkage in compiled regular expressions. The value is 2, 3, or
931 nigel 91 4. Larger values allow larger regular expressions to be compiled, at
932     the expense of slower matching. The default value of 2 is sufficient
933     for all but the most massive patterns, since it allows the compiled
934 nigel 73 pattern to be up to 64K in size.
935 nigel 63
936 nigel 73 PCRE_CONFIG_POSIX_MALLOC_THRESHOLD
937 nigel 63
938 nigel 91 The output is an integer that contains the threshold above which the
939     POSIX interface uses malloc() for output vectors. Further details are
940 nigel 73 given in the pcreposix documentation.
941 nigel 63
942 nigel 73 PCRE_CONFIG_MATCH_LIMIT
943 nigel 63
944 nigel 73 The output is an integer that gives the default limit for the number of
945 nigel 91 internal matching function calls in a pcre_exec() execution. Further
946 nigel 73 details are given with pcre_exec() below.
947 nigel 63
948 nigel 87 PCRE_CONFIG_MATCH_LIMIT_RECURSION
949    
950 nigel 91 The output is an integer that gives the default limit for the depth of
951     recursion when calling the internal matching function in a pcre_exec()
952 nigel 87 execution. Further details are given with pcre_exec() below.
953    
954 nigel 73 PCRE_CONFIG_STACKRECURSE
955 nigel 63
956 nigel 91 The output is an integer that is set to one if internal recursion when
957 nigel 77 running pcre_exec() is implemented by recursive function calls that use
958 nigel 91 the stack to remember their state. This is the usual way that PCRE is
959 nigel 77 compiled. The output is zero if PCRE was compiled to use blocks of data
960 nigel 91 on the heap instead of recursive function calls. In this case,
961     pcre_stack_malloc and pcre_stack_free are called to manage memory
962 nigel 77 blocks on the heap, thus avoiding the use of the stack.
963 nigel 73
964    
965 nigel 41 COMPILING A PATTERN
966 nigel 63
967 nigel 73 pcre *pcre_compile(const char *pattern, int options,
968     const char **errptr, int *erroffset,
969     const unsigned char *tableptr);
970 nigel 63
971 nigel 77 pcre *pcre_compile2(const char *pattern, int options,
972     int *errorcodeptr,
973     const char **errptr, int *erroffset,
974     const unsigned char *tableptr);
975 nigel 41
976 nigel 77 Either of the functions pcre_compile() or pcre_compile2() can be called
977     to compile a pattern into an internal form. The only difference between
978 nigel 91 the two interfaces is that pcre_compile2() has an additional argument,
979 nigel 77 errorcodeptr, via which a numerical error code can be returned.
980    
981     The pattern is a C string terminated by a binary zero, and is passed in
982 nigel 91 the pattern argument. A pointer to a single block of memory that is
983     obtained via pcre_malloc is returned. This contains the compiled code
984 nigel 77 and related data. The pcre type is defined for the returned block; this
985     is a typedef for a structure whose contents are not externally defined.
986 nigel 91 It is up to the caller to free the memory (via pcre_free) when it is no
987     longer required.
988 nigel 77
989 nigel 91 Although the compiled code of a PCRE regex is relocatable, that is, it
990 nigel 73 does not depend on memory location, the complete pcre data block is not
991 nigel 91 fully relocatable, because it may contain a copy of the tableptr argu-
992 nigel 75 ment, which is an address (see below).
993 nigel 41
994 nigel 93 The options argument contains various bit settings that affect the com-
995     pilation. It should be zero if no options are required. The available
996 nigel 91 options are described below. Some of them, in particular, those that
997     are compatible with Perl, can also be set and unset from within the
998     pattern (see the detailed description in the pcrepattern documenta-
999     tion). For these options, the contents of the options argument speci-
1000     fies their initial settings at the start of compilation and execution.
1001     The PCRE_ANCHORED and PCRE_NEWLINE_xxx options can be set at the time
1002     of matching as well as at compile time.
1003 nigel 41
1004 nigel 73 If errptr is NULL, pcre_compile() returns NULL immediately. Otherwise,
1005 nigel 91 if compilation of a pattern fails, pcre_compile() returns NULL, and
1006 nigel 73 sets the variable pointed to by errptr to point to a textual error mes-
1007 nigel 87 sage. This is a static string that is part of the library. You must not
1008     try to free it. The offset from the start of the pattern to the charac-
1009     ter where the error was discovered is placed in the variable pointed to
1010 nigel 91 by erroffset, which must not be NULL. If it is, an immediate error is
1011 nigel 73 given.
1012 nigel 53
1013 nigel 91 If pcre_compile2() is used instead of pcre_compile(), and the error-
1014     codeptr argument is not NULL, a non-zero error code number is returned
1015     via this argument in the event of an error. This is in addition to the
1016 nigel 77 textual error message. Error codes and messages are listed below.
1017    
1018 nigel 91 If the final argument, tableptr, is NULL, PCRE uses a default set of
1019     character tables that are built when PCRE is compiled, using the
1020     default C locale. Otherwise, tableptr must be an address that is the
1021     result of a call to pcre_maketables(). This value is stored with the
1022     compiled pattern, and used again by pcre_exec(), unless another table
1023 nigel 75 pointer is passed to it. For more discussion, see the section on locale
1024     support below.
1025 nigel 53
1026 nigel 91 This code fragment shows a typical straightforward call to pcre_com-
1027 nigel 73 pile():
1028 nigel 41
1029 nigel 73 pcre *re;
1030     const char *error;
1031     int erroffset;
1032     re = pcre_compile(
1033     "^A.*Z", /* the pattern */
1034     0, /* default options */
1035     &error, /* for error message */
1036     &erroffset, /* for error offset */
1037     NULL); /* use default character tables */
1038 nigel 41
1039 nigel 91 The following names for option bits are defined in the pcre.h header
1040 nigel 75 file:
1041 nigel 41
1042 nigel 73 PCRE_ANCHORED
1043 nigel 41
1044 nigel 73 If this bit is set, the pattern is forced to be "anchored", that is, it
1045 nigel 91 is constrained to match only at the first matching point in the string
1046     that is being searched (the "subject string"). This effect can also be
1047     achieved by appropriate constructs in the pattern itself, which is the
1048 nigel 73 only way to do it in Perl.
1049 nigel 41
1050 nigel 75 PCRE_AUTO_CALLOUT
1051    
1052     If this bit is set, pcre_compile() automatically inserts callout items,
1053 nigel 91 all with number 255, before each pattern item. For discussion of the
1054 nigel 75 callout facility, see the pcrecallout documentation.
1055    
1056 nigel 73 PCRE_CASELESS
1057 nigel 41
1058 nigel 91 If this bit is set, letters in the pattern match both upper and lower
1059     case letters. It is equivalent to Perl's /i option, and it can be
1060     changed within a pattern by a (?i) option setting. In UTF-8 mode, PCRE
1061     always understands the concept of case for characters whose values are
1062     less than 128, so caseless matching is always possible. For characters
1063     with higher values, the concept of case is supported if PCRE is com-
1064     piled with Unicode property support, but not otherwise. If you want to
1065     use caseless matching for characters 128 and above, you must ensure
1066     that PCRE is compiled with Unicode property support as well as with
1067 nigel 77 UTF-8 support.
1068 nigel 41
1069 nigel 73 PCRE_DOLLAR_ENDONLY
1070 nigel 41
1071 nigel 91 If this bit is set, a dollar metacharacter in the pattern matches only
1072     at the end of the subject string. Without this option, a dollar also
1073     matches immediately before a newline at the end of the string (but not
1074     before any other newlines). The PCRE_DOLLAR_ENDONLY option is ignored
1075     if PCRE_MULTILINE is set. There is no equivalent to this option in
1076     Perl, and no way to set it within a pattern.
1077 nigel 41
1078 nigel 73 PCRE_DOTALL
1079 nigel 41
1080 nigel 73 If this bit is set, a dot metacharater in the pattern matches all char-
1081 nigel 91 acters, including those that indicate newline. Without it, a dot does
1082     not match when the current position is at a newline. This option is
1083     equivalent to Perl's /s option, and it can be changed within a pattern
1084     by a (?s) option setting. A negative class such as [^a] always matches
1085 nigel 93 newline characters, independent of the setting of this option.
1086 nigel 63
1087 nigel 91 PCRE_DUPNAMES
1088    
1089     If this bit is set, names used to identify capturing subpatterns need
1090     not be unique. This can be helpful for certain types of pattern when it
1091     is known that only one instance of the named subpattern can ever be
1092     matched. There are more details of named subpatterns below; see also
1093     the pcrepattern documentation.
1094    
1095 nigel 73 PCRE_EXTENDED
1096 nigel 41
1097 nigel 91 If this bit is set, whitespace data characters in the pattern are
1098 nigel 77 totally ignored except when escaped or inside a character class. White-
1099     space does not include the VT character (code 11). In addition, charac-
1100     ters between an unescaped # outside a character class and the next new-
1101 nigel 91 line, inclusive, are also ignored. This is equivalent to Perl's /x
1102     option, and it can be changed within a pattern by a (?x) option set-
1103     ting.
1104 nigel 41
1105 nigel 91 This option makes it possible to include comments inside complicated
1106     patterns. Note, however, that this applies only to data characters.
1107     Whitespace characters may never appear within special character
1108     sequences in a pattern, for example within the sequence (?( which
1109 nigel 73 introduces a conditional subpattern.
1110 nigel 41
1111 nigel 73 PCRE_EXTRA
1112 nigel 41
1113 nigel 91 This option was invented in order to turn on additional functionality
1114     of PCRE that is incompatible with Perl, but it is currently of very
1115     little use. When set, any backslash in a pattern that is followed by a
1116     letter that has no special meaning causes an error, thus reserving
1117     these combinations for future expansion. By default, as in Perl, a
1118     backslash followed by a letter with no special meaning is treated as a
1119     literal. (Perl can, however, be persuaded to give a warning for this.)
1120     There are at present no other features controlled by this option. It
1121     can also be set by a (?X) option setting within a pattern.
1122 nigel 41
1123 nigel 77 PCRE_FIRSTLINE
1124    
1125 nigel 87 If this option is set, an unanchored pattern is required to match
1126 nigel 91 before or at the first newline in the subject string, though the
1127     matched text may continue over the newline.
1128 nigel 77
1129 nigel 73 PCRE_MULTILINE
1130 nigel 41
1131 nigel 87 By default, PCRE treats the subject string as consisting of a single
1132     line of characters (even if it actually contains newlines). The "start
1133     of line" metacharacter (^) matches only at the start of the string,
1134     while the "end of line" metacharacter ($) matches only at the end of
1135 nigel 75 the string, or before a terminating newline (unless PCRE_DOLLAR_ENDONLY
1136     is set). This is the same as Perl.
1137 nigel 63
1138 nigel 87 When PCRE_MULTILINE it is set, the "start of line" and "end of line"
1139 nigel 91 constructs match immediately following or immediately before internal
1140     newlines in the subject string, respectively, as well as at the very
1141     start and end. This is equivalent to Perl's /m option, and it can be
1142     changed within a pattern by a (?m) option setting. If there are no new-
1143     lines in a subject string, or no occurrences of ^ or $ in a pattern,
1144 nigel 73 setting PCRE_MULTILINE has no effect.
1145 nigel 63
1146 nigel 91 PCRE_NEWLINE_CR
1147     PCRE_NEWLINE_LF
1148     PCRE_NEWLINE_CRLF
1149 ph10 150 PCRE_NEWLINE_ANYCRLF
1150 nigel 93 PCRE_NEWLINE_ANY
1151 nigel 91
1152     These options override the default newline definition that was chosen
1153     when PCRE was built. Setting the first or the second specifies that a
1154     newline is indicated by a single character (CR or LF, respectively).
1155 nigel 93 Setting PCRE_NEWLINE_CRLF specifies that a newline is indicated by the
1156 ph10 150 two-character CRLF sequence. Setting PCRE_NEWLINE_ANYCRLF specifies
1157     that any of the three preceding sequences should be recognized. Setting
1158     PCRE_NEWLINE_ANY specifies that any Unicode newline sequence should be
1159     recognized. The Unicode newline sequences are the three just mentioned,
1160     plus the single characters VT (vertical tab, U+000B), FF (formfeed,
1161     U+000C), NEL (next line, U+0085), LS (line separator, U+2028), and PS
1162     (paragraph separator, U+2029). The last two are recognized only in
1163     UTF-8 mode.
1164 nigel 91
1165 nigel 93 The newline setting in the options word uses three bits that are
1166 ph10 150 treated as a number, giving eight possibilities. Currently only six are
1167     used (default plus the five values above). This means that if you set
1168     more than one newline option, the combination may or may not be sensi-
1169     ble. For example, PCRE_NEWLINE_CR with PCRE_NEWLINE_LF is equivalent to
1170     PCRE_NEWLINE_CRLF, but other combinations may yield unused numbers and
1171     cause an error.
1172 nigel 91
1173 nigel 93 The only time that a line break is specially recognized when compiling
1174     a pattern is if PCRE_EXTENDED is set, and an unescaped # outside a
1175     character class is encountered. This indicates a comment that lasts
1176     until after the next line break sequence. In other circumstances, line
1177     break sequences are treated as literal data, except that in
1178     PCRE_EXTENDED mode, both CR and LF are treated as whitespace characters
1179     and are therefore ignored.
1180    
1181     The newline option that is set at compile time becomes the default that
1182     is used for pcre_exec() and pcre_dfa_exec(), but it can be overridden.
1183    
1184 nigel 73 PCRE_NO_AUTO_CAPTURE
1185 nigel 41
1186 nigel 73 If this option is set, it disables the use of numbered capturing paren-
1187 nigel 91 theses in the pattern. Any opening parenthesis that is not followed by
1188     ? behaves as if it were followed by ?: but named parentheses can still
1189     be used for capturing (and they acquire numbers in the usual way).
1190 nigel 73 There is no equivalent of this option in Perl.
1191 nigel 41
1192 nigel 73 PCRE_UNGREEDY
1193 nigel 41
1194 nigel 91 This option inverts the "greediness" of the quantifiers so that they
1195     are not greedy by default, but become greedy if followed by "?". It is
1196     not compatible with Perl. It can also be set by a (?U) option setting
1197 nigel 73 within the pattern.
1198 nigel 41
1199 nigel 73 PCRE_UTF8
1200 nigel 49
1201 nigel 91 This option causes PCRE to regard both the pattern and the subject as
1202     strings of UTF-8 characters instead of single-byte character strings.
1203     However, it is available only when PCRE is built to include UTF-8 sup-
1204     port. If not, the use of this option provokes an error. Details of how
1205     this option changes the behaviour of PCRE are given in the section on
1206 nigel 75 UTF-8 support in the main pcre page.
1207 nigel 71
1208 nigel 73 PCRE_NO_UTF8_CHECK
1209 nigel 71
1210 nigel 73 When PCRE_UTF8 is set, the validity of the pattern as a UTF-8 string is
1211 nigel 91 automatically checked. If an invalid UTF-8 sequence of bytes is found,
1212     pcre_compile() returns an error. If you already know that your pattern
1213     is valid, and you want to skip this check for performance reasons, you
1214     can set the PCRE_NO_UTF8_CHECK option. When it is set, the effect of
1215 nigel 73 passing an invalid UTF-8 string as a pattern is undefined. It may cause
1216 nigel 91 your program to crash. Note that this option can also be passed to
1217     pcre_exec() and pcre_dfa_exec(), to suppress the UTF-8 validity check-
1218 nigel 77 ing of subject strings.
1219 nigel 71
1220 nigel 73
1221 nigel 77 COMPILATION ERROR CODES
1222    
1223 nigel 91 The following table lists the error codes than may be returned by
1224     pcre_compile2(), along with the error messages that may be returned by
1225 nigel 93 both compiling functions. As PCRE has developed, some error codes have
1226     fallen out of use. To avoid confusion, they have not been re-used.
1227 nigel 77
1228     0 no error
1229     1 \ at end of pattern
1230     2 \c at end of pattern
1231     3 unrecognized character follows \
1232     4 numbers out of order in {} quantifier
1233     5 number too big in {} quantifier
1234     6 missing terminating ] for character class
1235     7 invalid escape sequence in character class
1236     8 range out of order in character class
1237     9 nothing to repeat
1238 nigel 93 10 [this code is not in use]
1239 nigel 77 11 internal error: unexpected repeat
1240     12 unrecognized character after (?
1241     13 POSIX named classes are supported only within a class
1242     14 missing )
1243     15 reference to non-existent subpattern
1244     16 erroffset passed as NULL
1245     17 unknown option bit(s) set
1246     18 missing ) after comment
1247 nigel 93 19 [this code is not in use]
1248 nigel 77 20 regular expression too large
1249     21 failed to get memory
1250     22 unmatched parentheses
1251     23 internal error: code overflow
1252     24 unrecognized character after (?<
1253     25 lookbehind assertion is not fixed length
1254 nigel 91 26 malformed number or name after (?(
1255 nigel 77 27 conditional group contains more than two branches
1256     28 assertion expected after (?(
1257     29 (?R or (?digits must be followed by )
1258     30 unknown POSIX class name
1259     31 POSIX collating elements are not supported
1260     32 this version of PCRE is not compiled with PCRE_UTF8 support
1261 nigel 93 33 [this code is not in use]
1262 nigel 77 34 character value in \x{...} sequence is too large
1263     35 invalid condition (?(0)
1264     36 \C not allowed in lookbehind assertion
1265     37 PCRE does not support \L, \l, \N, \U, or \u
1266     38 number after (?C is > 255
1267     39 closing ) for (?C expected
1268     40 recursive call could loop indefinitely
1269     41 unrecognized character after (?P
1270 nigel 93 42 syntax error in subpattern name (missing terminator)
1271 nigel 91 43 two named subpatterns have the same name
1272 nigel 77 44 invalid UTF-8 string
1273     45 support for \P, \p, and \X has not been compiled
1274     46 malformed \P or \p sequence
1275     47 unknown property name after \P or \p
1276 nigel 91 48 subpattern name is too long (maximum 32 characters)
1277     49 too many named subpatterns (maximum 10,000)
1278     50 repeated subpattern is too long
1279     51 octal value is greater than \377 (not in UTF-8 mode)
1280 nigel 93 52 internal error: overran compiling workspace
1281     53 internal error: previously-checked referenced subpattern not
1282     found
1283     54 DEFINE group contains more than one branch
1284     55 repeating a DEFINE group is not allowed
1285     56 inconsistent NEWLINE options"
1286 nigel 77
1287    
1288 nigel 63 STUDYING A PATTERN
1289 nigel 49
1290 nigel 77 pcre_extra *pcre_study(const pcre *code, int options
1291 nigel 73 const char **errptr);
1292 nigel 63
1293 nigel 91 If a compiled pattern is going to be used several times, it is worth
1294 nigel 75 spending more time analyzing it in order to speed up the time taken for
1295 nigel 91 matching. The function pcre_study() takes a pointer to a compiled pat-
1296 nigel 75 tern as its first argument. If studying the pattern produces additional
1297 nigel 91 information that will help speed up matching, pcre_study() returns a
1298     pointer to a pcre_extra block, in which the study_data field points to
1299 nigel 75 the results of the study.
1300 nigel 41
1301 nigel 75 The returned value from pcre_study() can be passed directly to
1302 nigel 91 pcre_exec(). However, a pcre_extra block also contains other fields
1303     that can be set by the caller before the block is passed; these are
1304 nigel 75 described below in the section on matching a pattern.
1305 nigel 63
1306 nigel 91 If studying the pattern does not produce any additional information
1307 nigel 75 pcre_study() returns NULL. In that circumstance, if the calling program
1308 nigel 91 wants to pass any of the other fields to pcre_exec(), it must set up
1309 nigel 75 its own pcre_extra block.
1310 nigel 41
1311 nigel 91 The second argument of pcre_study() contains option bits. At present,
1312 nigel 75 no options are defined, and this argument should always be zero.
1313    
1314 nigel 91 The third argument for pcre_study() is a pointer for an error message.
1315     If studying succeeds (even if no data is returned), the variable it
1316     points to is set to NULL. Otherwise it is set to point to a textual
1317 nigel 87 error message. This is a static string that is part of the library. You
1318 nigel 91 must not try to free it. You should test the error pointer for NULL
1319 nigel 87 after calling pcre_study(), to be sure that it has run successfully.
1320 nigel 41
1321 nigel 73 This is a typical call to pcre_study():
1322 nigel 53
1323 nigel 73 pcre_extra *pe;
1324     pe = pcre_study(
1325     re, /* result of pcre_compile() */
1326     0, /* no options exist */
1327     &error); /* set to NULL or points to a message */
1328 nigel 53
1329 nigel 73 At present, studying a pattern is useful only for non-anchored patterns
1330 nigel 91 that do not have a single fixed starting character. A bitmap of possi-
1331 nigel 75 ble starting bytes is created.
1332 nigel 41
1333    
1334 nigel 63 LOCALE SUPPORT
1335 nigel 41
1336 nigel 91 PCRE handles caseless matching, and determines whether characters are
1337 ph10 142 letters, digits, or whatever, by reference to a set of tables, indexed
1338 nigel 91 by character value. When running in UTF-8 mode, this applies only to
1339     characters with codes less than 128. Higher-valued codes never match
1340     escapes such as \w or \d, but can be tested with \p if PCRE is built
1341     with Unicode character property support. The use of locales with Uni-
1342 ph10 142 code is discouraged. If you are handling characters with codes greater
1343     than 128, you should either use UTF-8 and Unicode, or use locales, but
1344     not try to mix the two.
1345 nigel 41
1346 ph10 142 PCRE contains an internal set of tables that are used when the final
1347     argument of pcre_compile() is NULL. These are sufficient for many
1348     applications. Normally, the internal tables recognize only ASCII char-
1349     acters. However, when PCRE is built, it is possible to cause the inter-
1350     nal tables to be rebuilt in the default "C" locale of the local system,
1351     which may cause them to be different.
1352 nigel 41
1353 ph10 142 The internal tables can always be overridden by tables supplied by the
1354     application that calls PCRE. These may be created in a different locale
1355     from the default. As more and more applications change to using Uni-
1356     code, the need for this locale support is expected to die away.
1357    
1358     External tables are built by calling the pcre_maketables() function,
1359     which has no arguments, in the relevant locale. The result can then be
1360     passed to pcre_compile() or pcre_exec() as often as necessary. For
1361     example, to build and use tables that are appropriate for the French
1362     locale (where accented characters with values greater than 128 are
1363 nigel 75 treated as letters), the following code could be used:
1364    
1365     setlocale(LC_CTYPE, "fr_FR");
1366 nigel 73 tables = pcre_maketables();
1367     re = pcre_compile(..., tables);
1368 nigel 41
1369 ph10 142 The locale name "fr_FR" is used on Linux and other Unix-like systems;
1370     if you are using Windows, the name for the French locale is "french".
1371    
1372 nigel 91 When pcre_maketables() runs, the tables are built in memory that is
1373     obtained via pcre_malloc. It is the caller's responsibility to ensure
1374     that the memory containing the tables remains available for as long as
1375 nigel 75 it is needed.
1376 nigel 41
1377 nigel 75 The pointer that is passed to pcre_compile() is saved with the compiled
1378 nigel 91 pattern, and the same tables are used via this pointer by pcre_study()
1379 nigel 75 and normally also by pcre_exec(). Thus, by default, for any single pat-
1380     tern, compilation, studying and matching all happen in the same locale,
1381     but different patterns can be compiled in different locales.
1382 nigel 41
1383 nigel 91 It is possible to pass a table pointer or NULL (indicating the use of
1384     the internal tables) to pcre_exec(). Although not intended for this
1385     purpose, this facility could be used to match a pattern in a different
1386 nigel 75 locale from the one in which it was compiled. Passing table pointers at
1387     run time is discussed below in the section on matching a pattern.
1388    
1389    
1390 nigel 63 INFORMATION ABOUT A PATTERN
1391 nigel 41
1392 nigel 73 int pcre_fullinfo(const pcre *code, const pcre_extra *extra,
1393     int what, void *where);
1394 nigel 63
1395 nigel 91 The pcre_fullinfo() function returns information about a compiled pat-
1396 nigel 73 tern. It replaces the obsolete pcre_info() function, which is neverthe-
1397     less retained for backwards compability (and is documented below).
1398 nigel 43
1399 nigel 91 The first argument for pcre_fullinfo() is a pointer to the compiled
1400     pattern. The second argument is the result of pcre_study(), or NULL if
1401     the pattern was not studied. The third argument specifies which piece
1402     of information is required, and the fourth argument is a pointer to a
1403     variable to receive the data. The yield of the function is zero for
1404 nigel 73 success, or one of the following negative numbers:
1405 nigel 41
1406 nigel 73 PCRE_ERROR_NULL the argument code was NULL
1407     the argument where was NULL
1408     PCRE_ERROR_BADMAGIC the "magic number" was not found
1409     PCRE_ERROR_BADOPTION the value of what was invalid
1410 nigel 53
1411 nigel 91 The "magic number" is placed at the start of each compiled pattern as
1412     an simple check against passing an arbitrary memory pointer. Here is a
1413     typical call of pcre_fullinfo(), to obtain the length of the compiled
1414 nigel 75 pattern:
1415 nigel 53
1416 nigel 73 int rc;
1417 nigel 91 size_t length;
1418 nigel 73 rc = pcre_fullinfo(
1419     re, /* result of pcre_compile() */
1420     pe, /* result of pcre_study(), or NULL */
1421     PCRE_INFO_SIZE, /* what is required */
1422     &length); /* where to put the data */
1423 nigel 43
1424 nigel 91 The possible values for the third argument are defined in pcre.h, and
1425 nigel 73 are as follows:
1426 nigel 43
1427 nigel 73 PCRE_INFO_BACKREFMAX
1428 nigel 41
1429 nigel 91 Return the number of the highest back reference in the pattern. The
1430     fourth argument should point to an int variable. Zero is returned if
1431 nigel 73 there are no back references.
1432 nigel 43
1433 nigel 73 PCRE_INFO_CAPTURECOUNT
1434 nigel 43
1435 nigel 91 Return the number of capturing subpatterns in the pattern. The fourth
1436 nigel 73 argument should point to an int variable.
1437 nigel 43
1438 nigel 77 PCRE_INFO_DEFAULT_TABLES
1439 nigel 75
1440 nigel 91 Return a pointer to the internal default character tables within PCRE.
1441     The fourth argument should point to an unsigned char * variable. This
1442 nigel 75 information call is provided for internal use by the pcre_study() func-
1443 nigel 91 tion. External callers can cause PCRE to use its internal tables by
1444 nigel 75 passing a NULL table pointer.
1445    
1446 nigel 73 PCRE_INFO_FIRSTBYTE
1447 nigel 43
1448 nigel 91 Return information about the first byte of any matched string, for a
1449     non-anchored pattern. The fourth argument should point to an int vari-
1450     able. (This option used to be called PCRE_INFO_FIRSTCHAR; the old name
1451     is still recognized for backwards compatibility.)
1452 nigel 41
1453 nigel 91 If there is a fixed first byte, for example, from a pattern such as
1454 nigel 93 (cat|cow|coyote), its value is returned. Otherwise, if either
1455 nigel 41
1456 nigel 87 (a) the pattern was compiled with the PCRE_MULTILINE option, and every
1457 nigel 73 branch starts with "^", or
1458 nigel 43
1459 nigel 73 (b) every branch of the pattern starts with ".*" and PCRE_DOTALL is not
1460     set (if it were set, the pattern would be anchored),
1461 nigel 41
1462 nigel 87 -1 is returned, indicating that the pattern matches only at the start
1463     of a subject string or after any newline within the string. Otherwise
1464 nigel 73 -2 is returned. For anchored patterns, -2 is returned.
1465 nigel 41
1466 nigel 73 PCRE_INFO_FIRSTTABLE
1467 nigel 41
1468 nigel 87 If the pattern was studied, and this resulted in the construction of a
1469 nigel 73 256-bit table indicating a fixed set of bytes for the first byte in any
1470 nigel 87 matching string, a pointer to the table is returned. Otherwise NULL is
1471     returned. The fourth argument should point to an unsigned char * vari-
1472 nigel 73 able.
1473 nigel 43
1474 nigel 73 PCRE_INFO_LASTLITERAL
1475 nigel 43
1476 nigel 87 Return the value of the rightmost literal byte that must exist in any
1477     matched string, other than at its start, if such a byte has been
1478 nigel 73 recorded. The fourth argument should point to an int variable. If there
1479 nigel 87 is no such byte, -1 is returned. For anchored patterns, a last literal
1480     byte is recorded only if it follows something of variable length. For
1481 nigel 73 example, for the pattern /^a\d+z\d+/ the returned value is "z", but for
1482     /^a\dz\d/ the returned value is -1.
1483 nigel 63
1484 nigel 73 PCRE_INFO_NAMECOUNT
1485     PCRE_INFO_NAMEENTRYSIZE
1486     PCRE_INFO_NAMETABLE
1487 nigel 63
1488 nigel 87 PCRE supports the use of named as well as numbered capturing parenthe-
1489     ses. The names are just an additional way of identifying the parenthe-
1490 nigel 91 ses, which still acquire numbers. Several convenience functions such as
1491     pcre_get_named_substring() are provided for extracting captured sub-
1492     strings by name. It is also possible to extract the data directly, by
1493     first converting the name to a number in order to access the correct
1494     pointers in the output vector (described with pcre_exec() below). To do
1495     the conversion, you need to use the name-to-number map, which is
1496     described by these three values.
1497 nigel 63
1498 nigel 73 The map consists of a number of fixed-size entries. PCRE_INFO_NAMECOUNT
1499     gives the number of entries, and PCRE_INFO_NAMEENTRYSIZE gives the size
1500 nigel 87 of each entry; both of these return an int value. The entry size
1501     depends on the length of the longest name. PCRE_INFO_NAMETABLE returns
1502     a pointer to the first entry of the table (a pointer to char). The
1503 nigel 73 first two bytes of each entry are the number of the capturing parenthe-
1504 nigel 87 sis, most significant byte first. The rest of the entry is the corre-
1505     sponding name, zero terminated. The names are in alphabetical order.
1506 nigel 91 When PCRE_DUPNAMES is set, duplicate names are in order of their paren-
1507     theses numbers. For example, consider the following pattern (assume
1508     PCRE_EXTENDED is set, so white space - including newlines - is
1509     ignored):
1510 nigel 63
1511 nigel 93 (?<date> (?<year>(\d\d)?\d\d) -
1512     (?<month>\d\d) - (?<day>\d\d) )
1513 nigel 63
1514 nigel 87 There are four named subpatterns, so the table has four entries, and
1515     each entry in the table is eight bytes long. The table is as follows,
1516 nigel 75 with non-printing bytes shows in hexadecimal, and undefined bytes shown
1517     as ??:
1518 nigel 63
1519 nigel 73 00 01 d a t e 00 ??
1520     00 05 d a y 00 ?? ??
1521     00 04 m o n t h 00
1522     00 02 y e a r 00 ??
1523 nigel 63
1524 nigel 87 When writing code to extract data from named subpatterns using the
1525 nigel 91 name-to-number map, remember that the length of the entries is likely
1526     to be different for each compiled pattern.
1527 nigel 63
1528 nigel 73 PCRE_INFO_OPTIONS
1529 nigel 63
1530 nigel 87 Return a copy of the options with which the pattern was compiled. The
1531     fourth argument should point to an unsigned long int variable. These
1532 nigel 73 option bits are those specified in the call to pcre_compile(), modified
1533     by any top-level option settings within the pattern itself.
1534 nigel 63
1535 nigel 87 A pattern is automatically anchored by PCRE if all of its top-level
1536 nigel 73 alternatives begin with one of the following:
1537 nigel 63
1538 nigel 73 ^ unless PCRE_MULTILINE is set
1539     \A always
1540     \G always
1541     .* if PCRE_DOTALL is set and there are no back
1542     references to the subpattern in which .* appears
1543 nigel 63
1544 nigel 73 For such patterns, the PCRE_ANCHORED bit is set in the options returned
1545     by pcre_fullinfo().
1546 nigel 63
1547 nigel 73 PCRE_INFO_SIZE
1548 nigel 63
1549 nigel 87 Return the size of the compiled pattern, that is, the value that was
1550 nigel 73 passed as the argument to pcre_malloc() when PCRE was getting memory in
1551     which to place the compiled data. The fourth argument should point to a
1552     size_t variable.
1553 nigel 63
1554 nigel 73 PCRE_INFO_STUDYSIZE
1555 nigel 63
1556 nigel 75 Return the size of the data block pointed to by the study_data field in
1557 nigel 87 a pcre_extra block. That is, it is the value that was passed to
1558 nigel 73 pcre_malloc() when PCRE was getting memory into which to place the data
1559 nigel 87 created by pcre_study(). The fourth argument should point to a size_t
1560 nigel 73 variable.
1561 nigel 63
1562 nigel 73
1563 nigel 63 OBSOLETE INFO FUNCTION
1564    
1565 nigel 73 int pcre_info(const pcre *code, int *optptr, int *firstcharptr);
1566 nigel 63
1567 nigel 87 The pcre_info() function is now obsolete because its interface is too
1568     restrictive to return all the available data about a compiled pattern.
1569     New programs should use pcre_fullinfo() instead. The yield of
1570     pcre_info() is the number of capturing subpatterns, or one of the fol-
1571 nigel 73 lowing negative numbers:
1572 nigel 43
1573 nigel 73 PCRE_ERROR_NULL the argument code was NULL
1574     PCRE_ERROR_BADMAGIC the "magic number" was not found
1575 nigel 43
1576 nigel 87 If the optptr argument is not NULL, a copy of the options with which
1577     the pattern was compiled is placed in the integer it points to (see
1578 nigel 73 PCRE_INFO_OPTIONS above).
1579 nigel 43
1580 nigel 87 If the pattern is not anchored and the firstcharptr argument is not
1581     NULL, it is used to pass back information about the first character of
1582 nigel 73 any matched string (see PCRE_INFO_FIRSTBYTE above).
1583 nigel 43
1584    
1585 nigel 77 REFERENCE COUNTS
1586 nigel 53
1587 nigel 77 int pcre_refcount(pcre *code, int adjust);
1588    
1589 nigel 87 The pcre_refcount() function is used to maintain a reference count in
1590 nigel 77 the data block that contains a compiled pattern. It is provided for the
1591 nigel 87 benefit of applications that operate in an object-oriented manner,
1592 nigel 77 where different parts of the application may be using the same compiled
1593     pattern, but you want to free the block when they are all done.
1594    
1595     When a pattern is compiled, the reference count field is initialized to
1596 nigel 87 zero. It is changed only by calling this function, whose action is to
1597     add the adjust value (which may be positive or negative) to it. The
1598 nigel 77 yield of the function is the new value. However, the value of the count
1599 nigel 87 is constrained to lie between 0 and 65535, inclusive. If the new value
1600 nigel 77 is outside these limits, it is forced to the appropriate limit value.
1601    
1602 nigel 87 Except when it is zero, the reference count is not correctly preserved
1603     if a pattern is compiled on one host and then transferred to a host
1604 nigel 77 whose byte-order is different. (This seems a highly unlikely scenario.)
1605    
1606    
1607     MATCHING A PATTERN: THE TRADITIONAL FUNCTION
1608    
1609 nigel 73 int pcre_exec(const pcre *code, const pcre_extra *extra,
1610     const char *subject, int length, int startoffset,
1611     int options, int *ovector, int ovecsize);
1612 nigel 53
1613 nigel 87 The function pcre_exec() is called to match a subject string against a
1614     compiled pattern, which is passed in the code argument. If the pattern
1615 nigel 75 has been studied, the result of the study should be passed in the extra
1616 nigel 87 argument. This function is the main matching facility of the library,
1617 nigel 77 and it operates in a Perl-like manner. For specialist use there is also
1618 nigel 87 an alternative matching function, which is described below in the sec-
1619 nigel 77 tion about the pcre_dfa_exec() function.
1620 nigel 41
1621 nigel 87 In most applications, the pattern will have been compiled (and option-
1622     ally studied) in the same process that calls pcre_exec(). However, it
1623 nigel 75 is possible to save compiled patterns and study data, and then use them
1624 nigel 87 later in different processes, possibly even on different hosts. For a
1625 nigel 75 discussion about this, see the pcreprecompile documentation.
1626    
1627 nigel 73 Here is an example of a simple call to pcre_exec():
1628 nigel 53
1629 nigel 73 int rc;
1630     int ovector[30];
1631     rc = pcre_exec(
1632     re, /* result of pcre_compile() */
1633     NULL, /* we didn't study the pattern */
1634     "some string", /* the subject string */
1635     11, /* the length of the subject string */
1636     0, /* start at offset 0 in the subject */
1637     0, /* default options */
1638 nigel 75 ovector, /* vector of integers for substring information */
1639 nigel 77 30); /* number of elements (NOT size in bytes) */
1640 nigel 53
1641 nigel 75 Extra data for pcre_exec()
1642 nigel 63
1643 nigel 87 If the extra argument is not NULL, it must point to a pcre_extra data
1644     block. The pcre_study() function returns such a block (when it doesn't
1645     return NULL), but you can also create one for yourself, and pass addi-
1646     tional information in it. The pcre_extra block contains the following
1647     fields (not necessarily in this order):
1648 nigel 75
1649 nigel 73 unsigned long int flags;
1650     void *study_data;
1651     unsigned long int match_limit;
1652 nigel 87 unsigned long int match_limit_recursion;
1653 nigel 73 void *callout_data;
1654 nigel 75 const unsigned char *tables;
1655 nigel 63
1656 nigel 87 The flags field is a bitmap that specifies which of the other fields
1657 nigel 73 are set. The flag bits are:
1658 nigel 63
1659 nigel 73 PCRE_EXTRA_STUDY_DATA
1660     PCRE_EXTRA_MATCH_LIMIT
1661 nigel 87 PCRE_EXTRA_MATCH_LIMIT_RECURSION
1662 nigel 73 PCRE_EXTRA_CALLOUT_DATA
1663 nigel 75 PCRE_EXTRA_TABLES
1664 nigel 63
1665 nigel 87 Other flag bits should be set to zero. The study_data field is set in
1666     the pcre_extra block that is returned by pcre_study(), together with
1667 nigel 75 the appropriate flag bit. You should not set this yourself, but you may
1668 nigel 87 add to the block by setting the other fields and their corresponding
1669 nigel 75 flag bits.
1670 nigel 63
1671 nigel 73 The match_limit field provides a means of preventing PCRE from using up
1672 nigel 87 a vast amount of resources when running patterns that are not going to
1673     match, but which have a very large number of possibilities in their
1674     search trees. The classic example is the use of nested unlimited
1675 nigel 75 repeats.
1676 nigel 63
1677 nigel 87 Internally, PCRE uses a function called match() which it calls repeat-
1678     edly (sometimes recursively). The limit set by match_limit is imposed
1679     on the number of times this function is called during a match, which
1680     has the effect of limiting the amount of backtracking that can take
1681     place. For patterns that are not anchored, the count restarts from zero
1682     for each position in the subject string.
1683 nigel 75
1684 nigel 87 The default value for the limit can be set when PCRE is built; the
1685     default default is 10 million, which handles all but the most extreme
1686     cases. You can override the default by suppling pcre_exec() with a
1687     pcre_extra block in which match_limit is set, and
1688     PCRE_EXTRA_MATCH_LIMIT is set in the flags field. If the limit is
1689 nigel 73 exceeded, pcre_exec() returns PCRE_ERROR_MATCHLIMIT.
1690 nigel 63
1691 nigel 87 The match_limit_recursion field is similar to match_limit, but instead
1692     of limiting the total number of times that match() is called, it limits
1693     the depth of recursion. The recursion depth is a smaller number than
1694     the total number of calls, because not all calls to match() are recur-
1695     sive. This limit is of use only if it is set smaller than match_limit.
1696    
1697     Limiting the recursion depth limits the amount of stack that can be
1698     used, or, when PCRE has been compiled to use memory on the heap instead
1699     of the stack, the amount of heap memory that can be used.
1700    
1701     The default value for match_limit_recursion can be set when PCRE is
1702     built; the default default is the same value as the default for
1703     match_limit. You can override the default by suppling pcre_exec() with
1704     a pcre_extra block in which match_limit_recursion is set, and
1705     PCRE_EXTRA_MATCH_LIMIT_RECURSION is set in the flags field. If the
1706     limit is exceeded, pcre_exec() returns PCRE_ERROR_RECURSIONLIMIT.
1707    
1708     The pcre_callout field is used in conjunction with the "callout" fea-
1709 nigel 73 ture, which is described in the pcrecallout documentation.
1710 nigel 63
1711 nigel 87 The tables field is used to pass a character tables pointer to
1712     pcre_exec(); this overrides the value that is stored with the compiled
1713     pattern. A non-NULL value is stored with the compiled pattern only if
1714     custom tables were supplied to pcre_compile() via its tableptr argu-
1715 nigel 75 ment. If NULL is passed to pcre_exec() using this mechanism, it forces
1716 nigel 87 PCRE's internal tables to be used. This facility is helpful when re-
1717     using patterns that have been saved after compiling with an external
1718     set of tables, because the external tables might be at a different
1719     address when pcre_exec() is called. See the pcreprecompile documenta-
1720 nigel 75 tion for a discussion of saving compiled patterns for later use.
1721 nigel 41
1722 nigel 75 Option bits for pcre_exec()
1723 nigel 71
1724 nigel 87 The unused bits of the options argument for pcre_exec() must be zero.
1725 nigel 91 The only bits that may be set are PCRE_ANCHORED, PCRE_NEWLINE_xxx,
1726     PCRE_NOTBOL, PCRE_NOTEOL, PCRE_NOTEMPTY, PCRE_NO_UTF8_CHECK and
1727     PCRE_PARTIAL.
1728 nigel 41
1729 nigel 75 PCRE_ANCHORED
1730 nigel 41
1731 nigel 91 The PCRE_ANCHORED option limits pcre_exec() to matching at the first
1732     matching position. If a pattern was compiled with PCRE_ANCHORED, or
1733     turned out to be anchored by virtue of its contents, it cannot be made
1734 nigel 75 unachored at matching time.
1735    
1736 nigel 91 PCRE_NEWLINE_CR
1737     PCRE_NEWLINE_LF
1738     PCRE_NEWLINE_CRLF
1739 ph10 150 PCRE_NEWLINE_ANYCRLF
1740 nigel 93 PCRE_NEWLINE_ANY
1741 nigel 91
1742     These options override the newline definition that was chosen or
1743     defaulted when the pattern was compiled. For details, see the descrip-
1744 nigel 93 tion of pcre_compile() above. During matching, the newline choice
1745     affects the behaviour of the dot, circumflex, and dollar metacharac-
1746     ters. It may also alter the way the match position is advanced after a
1747 ph10 150 match failure for an unanchored pattern. When PCRE_NEWLINE_CRLF,
1748     PCRE_NEWLINE_ANYCRLF, or PCRE_NEWLINE_ANY is set, and a match attempt
1749     fails when the current position is at a CRLF sequence, the match posi-
1750     tion is advanced by two characters instead of one, in other words, to
1751     after the CRLF.
1752 nigel 91
1753 nigel 73 PCRE_NOTBOL
1754 nigel 41
1755 nigel 75 This option specifies that first character of the subject string is not
1756 ph10 150 the beginning of a line, so the circumflex metacharacter should not
1757     match before it. Setting this without PCRE_MULTILINE (at compile time)
1758     causes circumflex never to match. This option affects only the behav-
1759 nigel 77 iour of the circumflex metacharacter. It does not affect \A.
1760 nigel 41
1761 nigel 73 PCRE_NOTEOL
1762 nigel 41
1763 nigel 75 This option specifies that the end of the subject string is not the end
1764 ph10 150 of a line, so the dollar metacharacter should not match it nor (except
1765     in multiline mode) a newline immediately before it. Setting this with-
1766 nigel 75 out PCRE_MULTILINE (at compile time) causes dollar never to match. This
1767 ph10 150 option affects only the behaviour of the dollar metacharacter. It does
1768 nigel 75 not affect \Z or \z.
1769 nigel 41
1770 nigel 73 PCRE_NOTEMPTY
1771 nigel 41
1772 nigel 73 An empty string is not considered to be a valid match if this option is
1773 ph10 150 set. If there are alternatives in the pattern, they are tried. If all
1774     the alternatives match the empty string, the entire match fails. For
1775 nigel 73 example, if the pattern
1776 nigel 41
1777 nigel 73 a?b?
1778 nigel 41
1779 ph10 150 is applied to a string not beginning with "a" or "b", it matches the
1780     empty string at the start of the subject. With PCRE_NOTEMPTY set, this
1781 nigel 73 match is not valid, so PCRE searches further into the string for occur-
1782     rences of "a" or "b".
1783 nigel 41
1784 nigel 73 Perl has no direct equivalent of PCRE_NOTEMPTY, but it does make a spe-
1785 ph10 150 cial case of a pattern match of the empty string within its split()
1786     function, and when using the /g modifier. It is possible to emulate
1787 nigel 73 Perl's behaviour after matching a null string by first trying the match
1788 nigel 75 again at the same offset with PCRE_NOTEMPTY and PCRE_ANCHORED, and then
1789 ph10 150 if that fails by advancing the starting offset (see below) and trying
1790 nigel 75 an ordinary match again. There is some code that demonstrates how to do
1791     this in the pcredemo.c sample program.
1792 nigel 41
1793 nigel 75 PCRE_NO_UTF8_CHECK
1794    
1795     When PCRE_UTF8 is set at compile time, the validity of the subject as a
1796 ph10 150 UTF-8 string is automatically checked when pcre_exec() is subsequently
1797     called. The value of startoffset is also checked to ensure that it
1798     points to the start of a UTF-8 character. If an invalid UTF-8 sequence
1799 nigel 75 of bytes is found, pcre_exec() returns the error PCRE_ERROR_BADUTF8. If
1800 ph10 150 startoffset contains an invalid value, PCRE_ERROR_BADUTF8_OFFSET is
1801 nigel 75 returned.
1802    
1803 ph10 150 If you already know that your subject is valid, and you want to skip
1804     these checks for performance reasons, you can set the
1805     PCRE_NO_UTF8_CHECK option when calling pcre_exec(). You might want to
1806     do this for the second and subsequent calls to pcre_exec() if you are
1807     making repeated calls to find all the matches in a single subject
1808     string. However, you should be sure that the value of startoffset
1809     points to the start of a UTF-8 character. When PCRE_NO_UTF8_CHECK is
1810     set, the effect of passing an invalid UTF-8 string as a subject, or a
1811     value of startoffset that does not point to the start of a UTF-8 char-
1812 nigel 75 acter, is undefined. Your program may crash.
1813    
1814     PCRE_PARTIAL
1815    
1816 ph10 150 This option turns on the partial matching feature. If the subject
1817     string fails to match the pattern, but at some point during the match-
1818     ing process the end of the subject was reached (that is, the subject
1819     partially matches the pattern and the failure to match occurred only
1820     because there were not enough subject characters), pcre_exec() returns
1821     PCRE_ERROR_PARTIAL instead of PCRE_ERROR_NOMATCH. When PCRE_PARTIAL is
1822     used, there are restrictions on what may appear in the pattern. These
1823 nigel 75 are discussed in the pcrepartial documentation.
1824    
1825     The string to be matched by pcre_exec()
1826    
1827 ph10 150 The subject string is passed to pcre_exec() as a pointer in subject, a
1828     length in length, and a starting byte offset in startoffset. In UTF-8
1829     mode, the byte offset must point to the start of a UTF-8 character.
1830     Unlike the pattern string, the subject may contain binary zero bytes.
1831     When the starting offset is zero, the search for a match starts at the
1832 nigel 75 beginning of the subject, and this is by far the most common case.
1833 nigel 63
1834 ph10 150 A non-zero starting offset is useful when searching for another match
1835     in the same subject by calling pcre_exec() again after a previous suc-
1836     cess. Setting startoffset differs from just passing over a shortened
1837     string and setting PCRE_NOTBOL in the case of a pattern that begins
1838 nigel 73 with any kind of lookbehind. For example, consider the pattern
1839 nigel 41
1840 nigel 73 \Biss\B
1841 nigel 41
1842 ph10 150 which finds occurrences of "iss" in the middle of words. (\B matches
1843     only if the current position in the subject is not a word boundary.)
1844     When applied to the string "Mississipi" the first call to pcre_exec()
1845     finds the first occurrence. If pcre_exec() is called again with just
1846     the remainder of the subject, namely "issipi", it does not match,
1847 nigel 73 because \B is always false at the start of the subject, which is deemed
1848 ph10 150 to be a word boundary. However, if pcre_exec() is passed the entire
1849 nigel 75 string again, but with startoffset set to 4, it finds the second occur-
1850 ph10 150 rence of "iss" because it is able to look behind the starting point to
1851 nigel 75 discover that it is preceded by a letter.
1852 nigel 41
1853 ph10 150 If a non-zero starting offset is passed when the pattern is anchored,
1854 nigel 75 one attempt to match at the given offset is made. This can only succeed
1855 ph10 150 if the pattern does not require the match to be at the start of the
1856 nigel 75 subject.
1857 nigel 41
1858 nigel 75 How pcre_exec() returns captured substrings
1859    
1860 ph10 150 In general, a pattern matches a certain portion of the subject, and in
1861     addition, further substrings from the subject may be picked out by
1862     parts of the pattern. Following the usage in Jeffrey Friedl's book,
1863     this is called "capturing" in what follows, and the phrase "capturing
1864     subpattern" is used for a fragment of a pattern that picks out a sub-
1865     string. PCRE supports several other kinds of parenthesized subpattern
1866 nigel 73 that do not cause substrings to be captured.
1867 nigel 65
1868 ph10 150 Captured substrings are returned to the caller via a vector of integer
1869     offsets whose address is passed in ovector. The number of elements in
1870     the vector is passed in ovecsize, which must be a non-negative number.
1871 nigel 75 Note: this argument is NOT the size of ovector in bytes.
1872 nigel 41
1873 ph10 150 The first two-thirds of the vector is used to pass back captured sub-
1874     strings, each substring using a pair of integers. The remaining third
1875     of the vector is used as workspace by pcre_exec() while matching cap-
1876     turing subpatterns, and is not available for passing back information.
1877     The length passed in ovecsize should always be a multiple of three. If
1878 nigel 75 it is not, it is rounded down.
1879    
1880 ph10 150 When a match is successful, information about captured substrings is
1881     returned in pairs of integers, starting at the beginning of ovector,
1882     and continuing up to two-thirds of its length at the most. The first
1883 nigel 73 element of a pair is set to the offset of the first character in a sub-
1884 ph10 150 string, and the second is set to the offset of the first character
1885     after the end of a substring. The first pair, ovector[0] and ovec-
1886     tor[1], identify the portion of the subject string matched by the
1887     entire pattern. The next pair is used for the first capturing subpat-
1888 nigel 91 tern, and so on. The value returned by pcre_exec() is one more than the
1889     highest numbered pair that has been set. For example, if two substrings
1890 ph10 150 have been captured, the returned value is 3. If there are no capturing
1891     subpatterns, the return value from a successful match is 1, indicating
1892 nigel 91 that just the first pair of offsets has been set.
1893 nigel 41
1894 nigel 73 If a capturing subpattern is matched repeatedly, it is the last portion
1895 nigel 75 of the string that it matched that is returned.
1896 nigel 41
1897 ph10 150 If the vector is too small to hold all the captured substring offsets,
1898 nigel 75 it is used as far as possible (up to two-thirds of its length), and the
1899 ph10 150 function returns a value of zero. In particular, if the substring off-
1900 nigel 75 sets are not of interest, pcre_exec() may be called with ovector passed
1901 ph10 150 as NULL and ovecsize as zero. However, if the pattern contains back
1902     references and the ovector is not big enough to remember the related
1903     substrings, PCRE has to get additional memory for use during matching.
1904 nigel 73 Thus it is usually advisable to supply an ovector.
1905 nigel 41
1906 ph10 150 The pcre_info() function can be used to find out how many capturing
1907     subpatterns there are in a compiled pattern. The smallest size for
1908     ovector that will allow for n captured substrings, in addition to the
1909 nigel 91 offsets of the substring matched by the whole pattern, is (n+1)*3.
1910 nigel 41
1911 ph10 150 It is possible for capturing subpattern number n+1 to match some part
1912 nigel 91 of the subject when subpattern n has not been used at all. For example,
1913 ph10 150 if the string "abc" is matched against the pattern (a|(z))(bc) the
1914 nigel 91 return from the function is 4, and subpatterns 1 and 3 are matched, but
1915 ph10 150 2 is not. When this happens, both values in the offset pairs corre-
1916 nigel 91 sponding to unused subpatterns are set to -1.
1917 nigel 75
1918 ph10 150 Offset values that correspond to unused subpatterns at the end of the
1919     expression are also set to -1. For example, if the string "abc" is
1920     matched against the pattern (abc)(x(yz)?)? subpatterns 2 and 3 are not
1921     matched. The return from the function is 2, because the highest used
1922 nigel 91 capturing subpattern number is 1. However, you can refer to the offsets
1923 ph10 150 for the second and third capturing subpatterns if you wish (assuming
1924 nigel 91 the vector is large enough, of course).
1925    
1926 ph10 150 Some convenience functions are provided for extracting the captured
1927 nigel 91 substrings as separate strings. These are described below.
1928    
1929     Error return values from pcre_exec()
1930    
1931 ph10 150 If pcre_exec() fails, it returns a negative number. The following are
1932 nigel 73 defined in the header file:
1933 nigel 41
1934 nigel 73 PCRE_ERROR_NOMATCH (-1)
1935 nigel 41
1936 nigel 73 The subject string did not match the pattern.
1937 nigel 41
1938 nigel 73 PCRE_ERROR_NULL (-2)
1939 nigel 41
1940 ph10 150 Either code or subject was passed as NULL, or ovector was NULL and
1941 nigel 73 ovecsize was not zero.
1942 nigel 41
1943 nigel 73 PCRE_ERROR_BADOPTION (-3)
1944 nigel 41
1945 nigel 73 An unrecognized bit was set in the options argument.
1946 nigel 41
1947 nigel 73 PCRE_ERROR_BADMAGIC (-4)
1948 nigel 41
1949 ph10 150 PCRE stores a 4-byte "magic number" at the start of the compiled code,
1950 nigel 75 to catch the case when it is passed a junk pointer and to detect when a
1951     pattern that was compiled in an environment of one endianness is run in
1952 ph10 150 an environment with the other endianness. This is the error that PCRE
1953 nigel 75 gives when the magic number is not present.
1954 nigel 41
1955 nigel 93 PCRE_ERROR_UNKNOWN_OPCODE (-5)
1956 nigel 41
1957 nigel 73 While running the pattern match, an unknown item was encountered in the
1958 ph10 150 compiled pattern. This error could be caused by a bug in PCRE or by
1959 nigel 73 overwriting of the compiled pattern.
1960 nigel 41
1961 nigel 73 PCRE_ERROR_NOMEMORY (-6)
1962 nigel 41
1963 ph10 150 If a pattern contains back references, but the ovector that is passed
1964 nigel 73 to pcre_exec() is not big enough to remember the referenced substrings,
1965 ph10 150 PCRE gets a block of memory at the start of matching to use for this
1966     purpose. If the call via pcre_malloc() fails, this error is given. The
1967 nigel 75 memory is automatically freed at the end of matching.
1968 nigel 41
1969 nigel 73 PCRE_ERROR_NOSUBSTRING (-7)
1970 nigel 53
1971 ph10 150 This error is used by the pcre_copy_substring(), pcre_get_substring(),
1972 nigel 73 and pcre_get_substring_list() functions (see below). It is never
1973     returned by pcre_exec().
1974 nigel 63
1975 nigel 73 PCRE_ERROR_MATCHLIMIT (-8)
1976 nigel 63
1977 ph10 150 The backtracking limit, as specified by the match_limit field in a
1978     pcre_extra structure (or defaulted) was reached. See the description
1979 nigel 87 above.
1980    
1981 nigel 73 PCRE_ERROR_CALLOUT (-9)
1982 nigel 63
1983 nigel 73 This error is never generated by pcre_exec() itself. It is provided for
1984 ph10 150 use by callout functions that want to yield a distinctive error code.
1985 nigel 73 See the pcrecallout documentation for details.
1986 nigel 71
1987 nigel 73 PCRE_ERROR_BADUTF8 (-10)
1988 nigel 71
1989 ph10 150 A string that contains an invalid UTF-8 byte sequence was passed as a
1990 nigel 73 subject.
1991    
1992     PCRE_ERROR_BADUTF8_OFFSET (-11)
1993    
1994     The UTF-8 byte sequence that was passed as a subject was valid, but the
1995 ph10 150 value of startoffset did not point to the beginning of a UTF-8 charac-
1996 nigel 73 ter.
1997    
1998 nigel 77 PCRE_ERROR_PARTIAL (-12)
1999 nigel 73
2000 ph10 150 The subject string did not match, but it did match partially. See the
2001 nigel 75 pcrepartial documentation for details of partial matching.
2002    
2003 nigel 77 PCRE_ERROR_BADPARTIAL (-13)
2004 nigel 75
2005 ph10 150 The PCRE_PARTIAL option was used with a compiled pattern containing
2006     items that are not supported for partial matching. See the pcrepartial
2007 nigel 75 documentation for details of partial matching.
2008    
2009 nigel 77 PCRE_ERROR_INTERNAL (-14)
2010 nigel 75
2011 ph10 150 An unexpected internal error has occurred. This error could be caused
2012 nigel 75 by a bug in PCRE or by overwriting of the compiled pattern.
2013    
2014 nigel 77 PCRE_ERROR_BADCOUNT (-15)
2015 nigel 75
2016 ph10 150 This error is given if the value of the ovecsize argument is negative.
2017 nigel 75
2018 nigel 93 PCRE_ERROR_RECURSIONLIMIT (-21)
2019 nigel 75
2020 nigel 93 The internal recursion limit, as specified by the match_limit_recursion
2021 ph10 150 field in a pcre_extra structure (or defaulted) was reached. See the
2022 nigel 93 description above.
2023    
2024     PCRE_ERROR_NULLWSLIMIT (-22)
2025    
2026 ph10 150 When a group that can match an empty substring is repeated with an
2027     unbounded upper limit, the subject position at the start of the group
2028 nigel 93 must be remembered, so that a test for an empty string can be made when
2029 ph10 150 the end of the group is reached. Some workspace is required for this;
2030 nigel 93 if it runs out, this error is given.
2031    
2032     PCRE_ERROR_BADNEWLINE (-23)
2033    
2034     An invalid combination of PCRE_NEWLINE_xxx options was given.
2035    
2036     Error numbers -16 to -20 are not used by pcre_exec().
2037    
2038    
2039 nigel 63 EXTRACTING CAPTURED SUBSTRINGS BY NUMBER
2040    
2041 nigel 73 int pcre_copy_substring(const char *subject, int *ovector,
2042     int stringcount, int stringnumber, char *buffer,
2043     int buffersize);
2044 nigel 63
2045 nigel 73 int pcre_get_substring(const char *subject, int *ovector,
2046     int stringcount, int stringnumber,
2047     const char **stringptr);
2048 nigel 63
2049 nigel 73 int pcre_get_substring_list(const char *subject,
2050     int *ovector, int stringcount, const char ***listptr);
2051 nigel 63
2052 ph10 150 Captured substrings can be accessed directly by using the offsets
2053     returned by pcre_exec() in ovector. For convenience, the functions
2054 nigel 73 pcre_copy_substring(), pcre_get_substring(), and pcre_get_sub-
2055 ph10 150 string_list() are provided for extracting captured substrings as new,
2056     separate, zero-terminated strings. These functions identify substrings
2057     by number. The next section describes functions for extracting named
2058 nigel 91 substrings.
2059 nigel 41
2060 ph10 150 A substring that contains a binary zero is correctly extracted and has
2061     a further zero added on the end, but the result is not, of course, a C
2062     string. However, you can process such a string by referring to the
2063     length that is returned by pcre_copy_substring() and pcre_get_sub-
2064 nigel 91 string(). Unfortunately, the interface to pcre_get_substring_list() is
2065 ph10 150 not adequate for handling strings containing binary zeros, because the
2066 nigel 91 end of the final string is not independently indicated.
2067    
2068 ph10 150 The first three arguments are the same for all three of these func-
2069     tions: subject is the subject string that has just been successfully
2070 nigel 73 matched, ovector is a pointer to the vector of integer offsets that was
2071     passed to pcre_exec(), and stringcount is the number of substrings that
2072 ph10 150 were captured by the match, including the substring that matched the
2073 nigel 75 entire regular expression. This is the value returned by pcre_exec() if
2074 ph10 150 it is greater than zero. If pcre_exec() returned zero, indicating that
2075     it ran out of space in ovector, the value passed as stringcount should
2076 nigel 75 be the number of elements in the vector divided by three.
2077 nigel 41
2078 ph10 150 The functions pcre_copy_substring() and pcre_get_substring() extract a
2079     single substring, whose number is given as stringnumber. A value of
2080     zero extracts the substring that matched the entire pattern, whereas
2081     higher values extract the captured substrings. For pcre_copy_sub-
2082     string(), the string is placed in buffer, whose length is given by
2083     buffersize, while for pcre_get_substring() a new block of memory is
2084     obtained via pcre_malloc, and its address is returned via stringptr.
2085     The yield of the function is the length of the string, not including
2086 nigel 93 the terminating zero, or one of these error codes:
2087 nigel 41
2088 nigel 73 PCRE_ERROR_NOMEMORY (-6)
2089 nigel 41
2090 ph10 150 The buffer was too small for pcre_copy_substring(), or the attempt to
2091 nigel 73 get memory failed for pcre_get_substring().
2092 nigel 41
2093 nigel 73 PCRE_ERROR_NOSUBSTRING (-7)
2094 nigel 41
2095 nigel 73 There is no substring whose number is stringnumber.
2096 nigel 41
2097 ph10 150 The pcre_get_substring_list() function extracts all available sub-
2098     strings and builds a list of pointers to them. All this is done in a
2099 nigel 75 single block of memory that is obtained via pcre_malloc. The address of
2100 ph10 150 the memory block is returned via listptr, which is also the start of
2101     the list of string pointers. The end of the list is marked by a NULL
2102     pointer. The yield of the function is zero if all went well, or the
2103 nigel 93 error code
2104 nigel 41
2105 nigel 73 PCRE_ERROR_NOMEMORY (-6)
2106 nigel 41
2107 nigel 73 if the attempt to get the memory block failed.
2108 nigel 41
2109 ph10 150 When any of these functions encounter a substring that is unset, which
2110     can happen when capturing subpattern number n+1 matches some part of
2111     the subject, but subpattern n has not been used at all, they return an
2112 nigel 73 empty string. This can be distinguished from a genuine zero-length sub-
2113 ph10 150 string by inspecting the appropriate offset in ovector, which is nega-
2114 nigel 73 tive for unset substrings.
2115 nigel 41
2116 ph10 150 The two convenience functions pcre_free_substring() and pcre_free_sub-
2117     string_list() can be used to free the memory returned by a previous
2118 nigel 75 call of pcre_get_substring() or pcre_get_substring_list(), respec-
2119 ph10 150 tively. They do nothing more than call the function pointed to by
2120     pcre_free, which of course could be called directly from a C program.
2121     However, PCRE is used in some situations where it is linked via a spe-
2122     cial interface to another programming language that cannot use
2123     pcre_free directly; it is for these cases that the functions are pro-
2124 nigel 77 vided.
2125 nigel 41
2126 nigel 73
2127 nigel 63 EXTRACTING CAPTURED SUBSTRINGS BY NAME
2128 nigel 41
2129 nigel 75 int pcre_get_stringnumber(const pcre *code,
2130     const char *name);
2131    
2132 nigel 73 int pcre_copy_named_substring(const pcre *code,
2133     const char *subject, int *ovector,
2134     int stringcount, const char *stringname,
2135     char *buffer, int buffersize);
2136 nigel 41
2137 nigel 73 int pcre_get_named_substring(const pcre *code,
2138     const char *subject, int *ovector,
2139     int stringcount, const char *stringname,
2140     const char **stringptr);
2141 nigel 41
2142 ph10 150 To extract a substring by name, you first have to find associated num-
2143 nigel 75 ber. For example, for this pattern
2144 nigel 41
2145 nigel 93 (a+)b(?<xxx>\d+)...
2146 nigel 63
2147 nigel 91 the number of the subpattern called "xxx" is 2. If the name is known to
2148     be unique (PCRE_DUPNAMES was not set), you can find the number from the
2149     name by calling pcre_get_stringnumber(). The first argument is the com-
2150     piled pattern, and the second is the name. The yield of the function is
2151 ph10 150 the subpattern number, or PCRE_ERROR_NOSUBSTRING (-7) if there is no
2152 nigel 91 subpattern of that name.
2153 nigel 63
2154 nigel 75 Given the number, you can extract the substring directly, or use one of
2155     the functions described in the previous section. For convenience, there
2156     are also two functions that do the whole job.
2157    
2158 ph10 150 Most of the arguments of pcre_copy_named_substring() and
2159     pcre_get_named_substring() are the same as those for the similarly
2160     named functions that extract by number. As these are described in the
2161     previous section, they are not re-described here. There are just two
2162 nigel 75 differences:
2163 nigel 63
2164 ph10 150 First, instead of a substring number, a substring name is given. Sec-
2165 nigel 73 ond, there is an extra argument, given at the start, which is a pointer
2166 ph10 150 to the compiled pattern. This is needed in order to gain access to the
2167 nigel 73 name-to-number translation table.
2168 nigel 63
2169 ph10 150 These functions call pcre_get_stringnumber(), and if it succeeds, they
2170     then call pcre_copy_substring() or pcre_get_substring(), as appropri-
2171     ate. NOTE: If PCRE_DUPNAMES is set and there are duplicate names, the
2172 ph10 128 behaviour may not be what you want (see the next section).
2173 nigel 63
2174 nigel 77
2175 nigel 91 DUPLICATE SUBPATTERN NAMES
2176    
2177     int pcre_get_stringtable_entries(const pcre *code,
2178     const char *name, char **first, char **last);
2179    
2180 ph10 150 When a pattern is compiled with the PCRE_DUPNAMES option, names for
2181     subpatterns are not required to be unique. Normally, patterns with
2182     duplicate names are such that in any one match, only one of the named
2183     subpatterns participates. An example is shown in the pcrepattern docu-
2184 nigel 91 mentation. When duplicates are present, pcre_copy_named_substring() and
2185 ph10 150 pcre_get_named_substring() return the first substring corresponding to
2186     the given name that is set. If none are set, an empty string is
2187 nigel 91 returned. The pcre_get_stringnumber() function returns one of the num-
2188 ph10 150 bers that are associated with the name, but it is not defined which it
2189 nigel 91 is.
2190    
2191 ph10 150 If you want to get full details of all captured substrings for a given
2192     name, you must use the pcre_get_stringtable_entries() function. The
2193 nigel 91 first argument is the compiled pattern, and the second is the name. The
2194 ph10 150 third and fourth are pointers to variables which are updated by the
2195 nigel 91 function. After it has run, they point to the first and last entries in
2196 ph10 150 the name-to-number table for the given name. The function itself
2197     returns the length of each entry, or PCRE_ERROR_NOSUBSTRING (-7) if
2198     there are none. The format of the table is described above in the sec-
2199     tion entitled Information about a pattern. Given all the relevant
2200     entries for the name, you can extract each of their numbers, and hence
2201 nigel 93 the captured data, if any.
2202 nigel 91
2203    
2204 nigel 77 FINDING ALL POSSIBLE MATCHES
2205    
2206 ph10 150 The traditional matching function uses a similar algorithm to Perl,
2207 nigel 77 which stops when it finds the first match, starting at a given point in
2208 ph10 150 the subject. If you want to find all possible matches, or the longest
2209     possible match, consider using the alternative matching function (see
2210     below) instead. If you cannot use the alternative function, but still
2211     need to find all possible matches, you can kludge it up by making use
2212 nigel 77 of the callout facility, which is described in the pcrecallout documen-
2213     tation.
2214    
2215     What you have to do is to insert a callout right at the end of the pat-
2216 ph10 150 tern. When your callout function is called, extract and save the cur-
2217     rent matched substring. Then return 1, which forces pcre_exec() to
2218     backtrack and try other alternatives. Ultimately, when it runs out of
2219 nigel 77 matches, pcre_exec() will yield PCRE_ERROR_NOMATCH.
2220    
2221    
2222     MATCHING A PATTERN: THE ALTERNATIVE FUNCTION
2223    
2224     int pcre_dfa_exec(const pcre *code, const pcre_extra *extra,
2225     const char *subject, int length, int startoffset,
2226     int options, int *ovector, int ovecsize,
2227     int *workspace, int wscount);
2228    
2229 ph10 150 The function pcre_dfa_exec() is called to match a subject string
2230     against a compiled pattern, using a matching algorithm that scans the
2231     subject string just once, and does not backtrack. This has different
2232     characteristics to the normal algorithm, and is not compatible with
2233     Perl. Some of the features of PCRE patterns are not supported. Never-
2234     theless, there are times when this kind of matching can be useful. For
2235 nigel 93 a discussion of the two matching algorithms, see the pcrematching docu-
2236     mentation.
2237 nigel 77
2238 ph10 150 The arguments for the pcre_dfa_exec() function are the same as for
2239 nigel 77 pcre_exec(), plus two extras. The ovector argument is used in a differ-
2240 ph10 150 ent way, and this is described below. The other common arguments are
2241     used in the same way as for pcre_exec(), so their description is not
2242 nigel 77 repeated here.
2243    
2244 ph10 150 The two additional arguments provide workspace for the function. The
2245     workspace vector should contain at least 20 elements. It is used for
2246 nigel 77 keeping track of multiple paths through the pattern tree. More
2247 ph10 150 workspace will be needed for patterns and subjects where there are a
2248 nigel 91 lot of potential matches.
2249 nigel 77
2250 nigel 87 Here is an example of a simple call to pcre_dfa_exec():
2251 nigel 77
2252     int rc;
2253     int ovector[10];
2254     int wspace[20];
2255 nigel 87 rc = pcre_dfa_exec(
2256 nigel 77 re, /* result of pcre_compile() */
2257     NULL, /* we didn't study the pattern */
2258     "some string", /* the subject string */
2259     11, /* the length of the subject string */
2260     0, /* start at offset 0 in the subject */
2261     0, /* default options */
2262     ovector, /* vector of integers for substring information */
2263     10, /* number of elements (NOT size in bytes) */
2264     wspace, /* working space vector */
2265     20); /* number of elements (NOT size in bytes) */
2266    
2267     Option bits for pcre_dfa_exec()
2268    
2269 ph10 150 The unused bits of the options argument for pcre_dfa_exec() must be
2270     zero. The only bits that may be set are PCRE_ANCHORED, PCRE_NEW-
2271     LINE_xxx, PCRE_NOTBOL, PCRE_NOTEOL, PCRE_NOTEMPTY, PCRE_NO_UTF8_CHECK,
2272 nigel 91 PCRE_PARTIAL, PCRE_DFA_SHORTEST, and PCRE_DFA_RESTART. All but the last
2273     three of these are the same as for pcre_exec(), so their description is
2274     not repeated here.
2275 nigel 77
2276     PCRE_PARTIAL
2277    
2278 ph10 150 This has the same general effect as it does for pcre_exec(), but the
2279     details are slightly different. When PCRE_PARTIAL is set for
2280     pcre_dfa_exec(), the return code PCRE_ERROR_NOMATCH is converted into
2281     PCRE_ERROR_PARTIAL if the end of the subject is reached, there have
2282 nigel 77 been no complete matches, but there is still at least one matching pos-
2283 ph10 150 sibility. The portion of the string that provided the partial match is
2284 nigel 77 set as the first matching string.
2285    
2286     PCRE_DFA_SHORTEST
2287    
2288 ph10 150 Setting the PCRE_DFA_SHORTEST option causes the matching algorithm to
2289 nigel 93 stop as soon as it has found one match. Because of the way the alterna-
2290 ph10 150 tive algorithm works, this is necessarily the shortest possible match
2291 nigel 93 at the first possible matching point in the subject string.
2292 nigel 77
2293     PCRE_DFA_RESTART
2294    
2295 ph10 150 When pcre_dfa_exec() is called with the PCRE_PARTIAL option, and
2296     returns a partial match, it is possible to call it again, with addi-
2297     tional subject characters, and have it continue with the same match.
2298     The PCRE_DFA_RESTART option requests this action; when it is set, the
2299     workspace and wscount options must reference the same vector as before
2300     because data about the match so far is left in them after a partial
2301     match. There is more discussion of this facility in the pcrepartial
2302 nigel 77 documentation.
2303    
2304     Successful returns from pcre_dfa_exec()
2305    
2306 ph10 150 When pcre_dfa_exec() succeeds, it may have matched more than one sub-
2307 nigel 77 string in the subject. Note, however, that all the matches from one run
2308 ph10 150 of the function start at the same point in the subject. The shorter
2309     matches are all initial substrings of the longer matches. For example,
2310 nigel 77 if the pattern
2311    
2312     <.*>
2313    
2314     is matched against the string
2315    
2316     This is <something> <something else> <something further> no more
2317    
2318     the three matched strings are
2319    
2320     <something>
2321     <something> <something else>
2322     <something> <something else> <something further>
2323    
2324 ph10 150 On success, the yield of the function is a number greater than zero,
2325     which is the number of matched substrings. The substrings themselves
2326     are returned in ovector. Each string uses two elements; the first is
2327     the offset to the start, and the second is the offset to the end. In
2328     fact, all the strings have the same start offset. (Space could have
2329     been saved by giving this only once, but it was decided to retain some
2330     compatibility with the way pcre_exec() returns data, even though the
2331 nigel 93 meaning of the strings is different.)
2332 nigel 77
2333     The strings are returned in reverse order of length; that is, the long-
2334 ph10 150 est matching string is given first. If there were too many matches to
2335     fit into ovector, the yield of the function is zero, and the vector is
2336 nigel 77 filled with the longest matches.
2337    
2338     Error returns from pcre_dfa_exec()
2339    
2340 ph10 150 The pcre_dfa_exec() function returns a negative number when it fails.
2341     Many of the errors are the same as for pcre_exec(), and these are
2342     described above. There are in addition the following errors that are
2343 nigel 77 specific to pcre_dfa_exec():
2344    
2345     PCRE_ERROR_DFA_UITEM (-16)
2346    
2347 ph10 150 This return is given if pcre_dfa_exec() encounters an item in the pat-
2348     tern that it does not support, for instance, the use of \C or a back
2349 nigel 77 reference.
2350    
2351     PCRE_ERROR_DFA_UCOND (-17)
2352    
2353 ph10 150 This return is given if pcre_dfa_exec() encounters a condition item
2354     that uses a back reference for the condition, or a test for recursion
2355 nigel 93 in a specific group. These are not supported.
2356 nigel 77
2357     PCRE_ERROR_DFA_UMLIMIT (-18)
2358    
2359 ph10 150 This return is given if pcre_dfa_exec() is called with an extra block
2360 nigel 77 that contains a setting of the match_limit field. This is not supported
2361     (it is meaningless).
2362    
2363     PCRE_ERROR_DFA_WSSIZE (-19)
2364    
2365 ph10 150 This return is given if pcre_dfa_exec() runs out of space in the
2366 nigel 77 workspace vector.
2367    
2368     PCRE_ERROR_DFA_RECURSE (-20)
2369    
2370 ph10 150 When a recursive subpattern is processed, the matching function calls
2371     itself recursively, using private vectors for ovector and workspace.
2372     This error is given if the output vector is not large enough. This
2373 nigel 77 should be extremely rare, as a vector of size 1000 is used.
2374    
2375 nigel 93
2376     SEE ALSO
2377    
2378 ph10 150 pcrebuild(3), pcrecallout(3), pcrecpp(3)(3), pcrematching(3), pcrepar-
2379     tial(3), pcreposix(3), pcreprecompile(3), pcresample(3), pcrestack(3).
2380 nigel 93
2381 nigel 63
2382 ph10 99 AUTHOR
2383 nigel 63
2384 ph10 99 Philip Hazel
2385     University Computing Service
2386     Cambridge CB2 3QH, England.
2387    
2388    
2389     REVISION
2390    
2391 ph10 155 Last updated: 24 April 2007
2392 ph10 99 Copyright (c) 1997-2007 University of Cambridge.
2393     ------------------------------------------------------------------------------
2394 ph10 111
2395    
2396 nigel 79 PCRECALLOUT(3) PCRECALLOUT(3)
2397 nigel 63
2398 nigel 79
2399 nigel 73 NAME
2400     PCRE - Perl-compatible regular expressions
2401    
2402 nigel 77
2403 nigel 63 PCRE CALLOUTS
2404    
2405 nigel 73 int (*pcre_callout)(pcre_callout_block *);
2406 nigel 63
2407 nigel 73 PCRE provides a feature called "callout", which is a means of temporar-
2408     ily passing control to the caller of PCRE in the middle of pattern
2409     matching. The caller of PCRE provides an external function by putting
2410     its entry point in the global variable pcre_callout. By default, this
2411     variable contains NULL, which disables all calling out.
2412 nigel 63
2413 nigel 73 Within a regular expression, (?C) indicates the points at which the
2414     external function is to be called. Different callout points can be
2415     identified by putting a number less than 256 after the letter C. The
2416     default value is zero. For example, this pattern has two callout
2417     points:
2418 nigel 63
2419 ph10 155 (?C1)abc(?C2)def
2420 nigel 63
2421 nigel 75 If the PCRE_AUTO_CALLOUT option bit is set when pcre_compile() is
2422     called, PCRE automatically inserts callouts, all with number 255,
2423     before each item in the pattern. For example, if PCRE_AUTO_CALLOUT is
2424     used with the pattern
2425 nigel 63
2426 nigel 75 A(\d{2}|--)
2427    
2428     it is processed as if it were
2429    
2430     (?C255)A(?C255)((?C255)\d{2}(?C255)|(?C255)-(?C255)-(?C255))(?C255)
2431    
2432     Notice that there is a callout before and after each parenthesis and
2433     alternation bar. Automatic callouts can be used for tracking the
2434     progress of pattern matching. The pcretest command has an option that
2435     sets automatic callouts; when it is used, the output indicates how the
2436     pattern is matched. This is useful information when you are trying to
2437     optimize the performance of a particular pattern.
2438    
2439    
2440     MISSING CALLOUTS
2441    
2442     You should be aware that, because of optimizations in the way PCRE
2443     matches patterns, callouts sometimes do not happen. For example, if the
2444     pattern is
2445    
2446     ab(?C4)cd
2447    
2448     PCRE knows that any matching string must contain the letter "d". If the
2449     subject string is "abyz", the lack of "d" means that matching doesn't
2450     ever start, and the callout is never reached. However, with "abyd",
2451     though the result is still no match, the callout is obeyed.
2452    
2453    
2454     THE CALLOUT INTERFACE
2455    
2456     During matching, when PCRE reaches a callout point, the external func-
2457 nigel 77 tion defined by pcre_callout is called (if it is set). This applies to
2458     both the pcre_exec() and the pcre_dfa_exec() matching functions. The
2459     only argument to the callout function is a pointer to a pcre_callout
2460     block. This structure contains the following fields:
2461 nigel 75
2462 nigel 73 int version;
2463     int callout_number;
2464     int *offset_vector;
2465     const char *subject;
2466     int subject_length;
2467     int start_match;
2468     int current_position;
2469     int capture_top;
2470     int capture_last;
2471     void *callout_data;
2472 nigel 75 int pattern_position;
2473     int next_item_length;
2474 nigel 63
2475 nigel 77 The version field is an integer containing the version number of the
2476     block format. The initial version was 0; the current version is 1. The
2477     version number will change again in future if additional fields are
2478 nigel 75 added, but the intention is never to remove any of the existing fields.
2479 nigel 63
2480 nigel 77 The callout_number field contains the number of the callout, as com-
2481     piled into the pattern (that is, the number after ?C for manual call-
2482 nigel 75 outs, and 255 for automatically generated callouts).
2483 nigel 63
2484 nigel 77 The offset_vector field is a pointer to the vector of offsets that was
2485     passed by the caller to pcre_exec() or pcre_dfa_exec(). When
2486     pcre_exec() is used, the contents can be inspected in order to extract
2487     substrings that have been matched so far, in the same way as for
2488     extracting substrings after a match has completed. For pcre_dfa_exec()
2489     this field is not useful.
2490 nigel 63
2491 nigel 75 The subject and subject_length fields contain copies of the values that
2492 nigel 73 were passed to pcre_exec().
2493 nigel 63
2494 nigel 77 The start_match field contains the offset within the subject at which
2495     the current match attempt started. If the pattern is not anchored, the
2496 nigel 75 callout function may be called several times from the same point in the
2497     pattern for different starting points in the subject.
2498 nigel 63
2499 nigel 77 The current_position field contains the offset within the subject of
2500 nigel 73 the current match pointer.
2501 nigel 63
2502 nigel 77 When the pcre_exec() function is used, the capture_top field contains
2503     one more than the number of the highest numbered captured substring so
2504     far. If no substrings have been captured, the value of capture_top is
2505     one. This is always the case when pcre_dfa_exec() is used, because it
2506     does not support captured substrings.
2507 nigel 63
2508 nigel 77 The capture_last field contains the number of the most recently cap-
2509     tured substring. If no substrings have been captured, its value is -1.
2510     This is always the case when pcre_dfa_exec() is used.
2511 nigel 63
2512 nigel 77 The callout_data field contains a value that is passed to pcre_exec()
2513     or pcre_dfa_exec() specifically so that it can be passed back in call-
2514     outs. It is passed in the pcre_callout field of the pcre_extra data
2515     structure. If no such data was passed, the value of callout_data in a
2516     pcre_callout block is NULL. There is a description of the pcre_extra
2517 nigel 73 structure in the pcreapi documentation.
2518 nigel 63
2519 nigel 77 The pattern_position field is present from version 1 of the pcre_call-
2520 nigel 75 out structure. It contains the offset to the next item to be matched in
2521     the pattern string.
2522 nigel 63
2523 nigel 77 The next_item_length field is present from version 1 of the pcre_call-
2524 nigel 75 out structure. It contains the length of the next item to be matched in
2525 nigel 77 the pattern string. When the callout immediately precedes an alterna-
2526     tion bar, a closing parenthesis, or the end of the pattern, the length
2527     is zero. When the callout precedes an opening parenthesis, the length
2528 nigel 75 is that of the entire subpattern.
2529 nigel 73
2530 nigel 77 The pattern_position and next_item_length fields are intended to help
2531     in distinguishing between different automatic callouts, which all have
2532 nigel 75 the same callout number. However, they are set for all callouts.
2533    
2534    
2535 nigel 63 RETURN VALUES
2536    
2537 nigel 77 The external callout function returns an integer to PCRE. If the value
2538     is zero, matching proceeds as normal. If the value is greater than
2539     zero, matching fails at the current point, but the testing of other
2540     matching possibilities goes ahead, just as if a lookahead assertion had
2541     failed. If the value is less than zero, the match is abandoned, and
2542     pcre_exec() (or pcre_dfa_exec()) returns the negative value.
2543 nigel 63
2544 nigel 77 Negative values should normally be chosen from the set of
2545 nigel 73 PCRE_ERROR_xxx values. In particular, PCRE_ERROR_NOMATCH forces a stan-
2546 nigel 77 dard "no match" failure. The error number PCRE_ERROR_CALLOUT is
2547     reserved for use by callout functions; it will never be used by PCRE
2548 nigel 73 itself.
2549 nigel 63
2550    
2551 ph10 99 AUTHOR
2552 nigel 63
2553 ph10 99 Philip Hazel
2554     University Computing Service
2555     Cambridge CB2 3QH, England.
2556    
2557    
2558     REVISION
2559    
2560     Last updated: 06 March 2007
2561     Copyright (c) 1997-2007 University of Cambridge.
2562     ------------------------------------------------------------------------------
2563 ph10 111
2564    
2565 nigel 79 PCRECOMPAT(3) PCRECOMPAT(3)
2566 nigel 63
2567 nigel 79
2568 nigel 73 NAME
2569     PCRE - Perl-compatible regular expressions
2570    
2571 nigel 77
2572 nigel 75 DIFFERENCES BETWEEN PCRE AND PERL
2573 nigel 41
2574 nigel 73 This document describes the differences in the ways that PCRE and Perl
2575 nigel 93 handle regular expressions. The differences described here are mainly
2576     with respect to Perl 5.8, though PCRE version 7.0 contains some fea-
2577     tures that are expected to be in the forthcoming Perl 5.10.
2578 nigel 41
2579 nigel 93 1. PCRE has only a subset of Perl's UTF-8 and Unicode support. Details
2580     of what it does have are given in the section on UTF-8 support in the
2581 nigel 87 main pcre page.
2582 nigel 41
2583 nigel 73 2. PCRE does not allow repeat quantifiers on lookahead assertions. Perl
2584 nigel 93 permits them, but they do not mean what you might think. For example,
2585 nigel 73 (?!a){3} does not assert that the next three characters are not "a". It
2586     just asserts that the next character is not "a" three times.
2587 nigel 41
2588 nigel 93 3. Capturing subpatterns that occur inside negative lookahead asser-
2589     tions are counted, but their entries in the offsets vector are never
2590     set. Perl sets its numerical variables from any such patterns that are
2591 nigel 73 matched before the assertion fails to match something (thereby succeed-
2592 nigel 93 ing), but only if the negative lookahead assertion contains just one
2593 nigel 73 branch.
2594 nigel 41
2595 nigel 93 4. Though binary zero characters are supported in the subject string,
2596 nigel 73 they are not allowed in a pattern string because it is passed as a nor-
2597 nigel 75 mal C string, terminated by zero. The escape sequence \0 can be used in
2598     the pattern to represent a binary zero.
2599 nigel 41
2600 nigel 93 5. The following Perl escape sequences are not supported: \l, \u, \L,
2601 nigel 75 \U, and \N. In fact these are implemented by Perl's general string-han-
2602 nigel 93 dling and are not part of its pattern matching engine. If any of these
2603 nigel 75 are encountered by PCRE, an error is generated.
2604 nigel 41
2605 nigel 93 6. The Perl escape sequences \p, \P, and \X are supported only if PCRE
2606     is built with Unicode character property support. The properties that
2607     can be tested with \p and \P are limited to the general category prop-
2608     erties such as Lu and Nd, script names such as Greek or Han, and the
2609 nigel 87 derived properties Any and L&.
2610 nigel 75
2611     7. PCRE does support the \Q...\E escape for quoting substrings. Charac-
2612 nigel 93 ters in between are treated as literals. This is slightly different
2613     from Perl in that $ and @ are also handled as literals inside the
2614     quotes. In Perl, they cause variable interpolation (but of course PCRE
2615 nigel 73 does not have variables). Note the following examples:
2616 nigel 49
2617 nigel 73 Pattern PCRE matches Perl matches
2618 nigel 41
2619 nigel 73 \Qabc$xyz\E abc$xyz abc followed by the
2620     contents of $xyz
2621     \Qabc\$xyz\E abc\$xyz abc\$xyz
2622     \Qabc\E\$\Qxyz\E abc$xyz abc$xyz
2623 nigel 41
2624 nigel 93 The \Q...\E sequence is recognized both inside and outside character
2625 nigel 73 classes.
2626 nigel 41
2627 nigel 93 8. Fairly obviously, PCRE does not support the (?{code}) and (??{code})
2628     constructions. However, there is support for recursive patterns. This
2629     is not available in Perl 5.8, but will be in Perl 5.10. Also, the PCRE
2630     "callout" feature allows an external function to be called during pat-
2631 nigel 75 tern matching. See the pcrecallout documentation for details.
2632 nigel 63
2633 nigel 93 9. Subpatterns that are called recursively or as "subroutines" are
2634     always treated as atomic groups in PCRE. This is like Python, but
2635     unlike Perl.
2636    
2637     10. There are some differences that are concerned with the settings of
2638     captured strings when part of a pattern is repeated. For example,
2639     matching "aba" against the pattern /^(a(b)?)+$/ in Perl leaves $2
2640 nigel 73 unset, but in PCRE it is set to "b".
2641 nigel 41
2642 nigel 93 11. PCRE provides some extensions to the Perl regular expression facil-
2643     ities. Perl 5.10 will include new features that are not in earlier
2644     versions, some of which (such as named parentheses) have been in PCRE
2645     for some time. This list is with respect to Perl 5.10:
2646 nigel 41
2647 nigel 93 (a) Although lookbehind assertions must match fixed length strings,
2648 nigel 73 each alternative branch of a lookbehind assertion can match a different
2649     length of string. Perl requires them all to have the same length.
2650 nigel 41
2651 nigel 93 (b) If PCRE_DOLLAR_ENDONLY is set and PCRE_MULTILINE is not set, the $
2652 nigel 73 meta-character matches only at the very end of the string.
2653 nigel 41
2654 nigel 73 (c) If PCRE_EXTRA is set, a backslash followed by a letter with no spe-
2655 nigel 93 cial meaning is faulted. Otherwise, like Perl, the backslash is
2656 nigel 91 ignored. (Perl can be made to issue a warning.)
2657 nigel 41
2658 nigel 93 (d) If PCRE_UNGREEDY is set, the greediness of the repetition quanti-
2659 nigel 73 fiers is inverted, that is, by default they are not greedy, but if fol-
2660     lowed by a question mark they are.
2661 nigel 41
2662 nigel 75 (e) PCRE_ANCHORED can be used at matching time to force a pattern to be
2663     tried only at the first matching position in the subject string.
2664 nigel 41
2665 nigel 93 (f) The PCRE_NOTBOL, PCRE_NOTEOL, PCRE_NOTEMPTY, and PCRE_NO_AUTO_CAP-
2666 nigel 73 TURE options for pcre_exec() have no Perl equivalents.
2667 nigel 41
2668 nigel 93 (g) The callout facility is PCRE-specific.
2669 nigel 41
2670 nigel 93 (h) The partial matching facility is PCRE-specific.
2671 nigel 43
2672 nigel 93 (i) Patterns compiled by PCRE can be saved and re-used at a later time,
2673 nigel 75 even on different hosts that have the other endianness.
2674    
2675 nigel 93 (j) The alternative matching function (pcre_dfa_exec()) matches in a
2676 nigel 77 different way and is not Perl-compatible.
2677    
2678 nigel 63
2679 ph10 99 AUTHOR
2680 nigel 63
2681 ph10 99 Philip Hazel
2682     University Computing Service
2683     Cambridge CB2 3QH, England.
2684    
2685    
2686     REVISION
2687    
2688     Last updated: 06 March 2007
2689     Copyright (c) 1997-2007 University of Cambridge.
2690     ------------------------------------------------------------------------------
2691 ph10 111
2692    
2693 nigel 79 PCREPATTERN(3) PCREPATTERN(3)
2694 nigel 63
2695 nigel 79
2696 nigel 73 NAME
2697     PCRE - Perl-compatible regular expressions
2698    
2699 nigel 77
2700 nigel 63 PCRE REGULAR EXPRESSION DETAILS
2701    
2702 nigel 73 The syntax and semantics of the regular expressions supported by PCRE
2703     are described below. Regular expressions are also described in the Perl
2704 nigel 75 documentation and in a number of books, some of which have copious
2705     examples. Jeffrey Friedl's "Mastering Regular Expressions", published
2706     by O'Reilly, covers regular expressions in great detail. This descrip-
2707     tion of PCRE's regular expressions is intended as reference material.
2708 nigel 49
2709 nigel 75 The original operation of PCRE was on strings of one-byte characters.
2710     However, there is now also support for UTF-8 character strings. To use
2711     this, you must build PCRE to include UTF-8 support, and then call
2712     pcre_compile() with the PCRE_UTF8 option. How this affects pattern
2713     matching is mentioned in several places below. There is also a summary
2714     of UTF-8 features in the section on UTF-8 support in the main pcre
2715     page.
2716 nigel 41
2717 nigel 77 The remainder of this document discusses the patterns that are sup-
2718     ported by PCRE when its main matching function, pcre_exec(), is used.
2719     From release 6.0, PCRE offers a second matching function,
2720     pcre_dfa_exec(), which matches using a different algorithm that is not
2721     Perl-compatible. The advantages and disadvantages of the alternative
2722     function, and how it differs from the normal function, are discussed in
2723     the pcrematching page.
2724    
2725 nigel 93
2726     CHARACTERS AND METACHARACTERS
2727    
2728 nigel 75 A regular expression is a pattern that is matched against a subject
2729     string from left to right. Most characters stand for themselves in a
2730     pattern, and match the corresponding characters in the subject. As a
2731 nigel 73 trivial example, the pattern
2732 nigel 41
2733 nigel 73 The quick brown fox
2734 nigel 41
2735 nigel 77 matches a portion of a subject string that is identical to itself. When
2736     caseless matching is specified (the PCRE_CASELESS option), letters are
2737     matched independently of case. In UTF-8 mode, PCRE always understands
2738     the concept of case for characters whose values are less than 128, so
2739     caseless matching is always possible. For characters with higher val-
2740     ues, the concept of case is supported if PCRE is compiled with Unicode
2741     property support, but not otherwise. If you want to use caseless
2742     matching for characters 128 and above, you must ensure that PCRE is
2743     compiled with Unicode property support as well as with UTF-8 support.
2744 nigel 41
2745 nigel 77 The power of regular expressions comes from the ability to include
2746     alternatives and repetitions in the pattern. These are encoded in the
2747     pattern by the use of metacharacters, which do not stand for themselves
2748     but instead are interpreted in some special way.
2749    
2750     There are two different sets of metacharacters: those that are recog-
2751     nized anywhere in the pattern except within square brackets, and those
2752 nigel 93 that are recognized within square brackets. Outside square brackets,
2753     the metacharacters are as follows:
2754 nigel 41
2755 nigel 73 \ general escape character with several uses
2756     ^ assert start of string (or line, in multiline mode)
2757     $ assert end of string (or line, in multiline mode)
2758     . match any character except newline (by default)
2759     [ start character class definition
2760     | start of alternative branch
2761     ( start subpattern
2762     ) end subpattern
2763     ? extends the meaning of (
2764     also 0 or 1 quantifier
2765     also quantifier minimizer
2766     * 0 or more quantifier
2767     + 1 or more quantifier
2768     also "possessive quantifier"
2769     { start min/max quantifier
2770 nigel 41
2771 nigel 77 Part of a pattern that is in square brackets is called a "character
2772 nigel 75 class". In a character class the only metacharacters are:
2773 nigel 41
2774 nigel 73 \ general escape character
2775     ^ negate the class, but only if the first character
2776     - indicates character range
2777     [ POSIX character class (only if followed by POSIX
2778     syntax)
2779     ] terminates the character class
2780 nigel 41
2781 nigel 77 The following sections describe the use of each of the metacharacters.
2782 nigel 41
2783    
2784 nigel 63 BACKSLASH
2785 nigel 41
2786 nigel 73 The backslash character has several uses. Firstly, if it is followed by
2787 nigel 77 a non-alphanumeric character, it takes away any special meaning that
2788     character may have. This use of backslash as an escape character
2789 nigel 73 applies both inside and outside character classes.
2790 nigel 41
2791 nigel 77 For example, if you want to match a * character, you write \* in the
2792     pattern. This escaping action applies whether or not the following
2793     character would otherwise be interpreted as a metacharacter, so it is
2794     always safe to precede a non-alphanumeric with backslash to specify
2795     that it stands for itself. In particular, if you want to match a back-
2796 nigel 75 slash, you write \\.
2797 nigel 41
2798 nigel 77 If a pattern is compiled with the PCRE_EXTENDED option, whitespace in
2799     the pattern (other than in a character class) and characters between a
2800 nigel 91 # outside a character class and the next newline are ignored. An escap-
2801     ing backslash can be used to include a whitespace or # character as
2802     part of the pattern.
2803 nigel 41
2804 nigel 77 If you want to remove the special meaning from a sequence of charac-
2805     ters, you can do so by putting them between \Q and \E. This is differ-
2806     ent from Perl in that $ and @ are handled as literals in \Q...\E
2807     sequences in PCRE, whereas in Perl, $ and @ cause variable interpola-
2808 nigel 73 tion. Note the following examples:
2809 nigel 63
2810 nigel 73 Pattern PCRE matches Perl matches
2811 nigel 63
2812 nigel 73 \Qabc$xyz\E abc$xyz abc followed by the
2813     contents of $xyz
2814     \Qabc\$xyz\E abc\$xyz abc\$xyz
2815     \Qabc\E\$\Qxyz\E abc$xyz abc$xyz
2816 nigel 63
2817 nigel 77 The \Q...\E sequence is recognized both inside and outside character
2818 nigel 73 classes.
2819 nigel 63
2820 nigel 75 Non-printing characters
2821    
2822 nigel 73 A second use of backslash provides a way of encoding non-printing char-
2823 nigel 77 acters in patterns in a visible manner. There is no restriction on the
2824     appearance of non-printing characters, apart from the binary zero that
2825     terminates a pattern, but when a pattern is being prepared by text
2826     editing, it is usually easier to use one of the following escape
2827 nigel 73 sequences than the binary character it represents:
2828 nigel 63
2829 nigel 73 \a alarm, that is, the BEL character (hex 07)
2830     \cx "control-x", where x is any character
2831     \e escape (hex 1B)
2832     \f formfeed (hex 0C)
2833     \n newline (hex 0A)
2834     \r carriage return (hex 0D)
2835     \t tab (hex 09)
2836     \ddd character with octal code ddd, or backreference
2837     \xhh character with hex code hh
2838 nigel 87 \x{hhh..} character with hex code hhh..
2839 nigel 41
2840 nigel 77 The precise effect of \cx is as follows: if x is a lower case letter,
2841     it is converted to upper case. Then bit 6 of the character (hex 40) is
2842     inverted. Thus \cz becomes hex 1A, but \c{ becomes hex 3B, while \c;
2843 nigel 73 becomes hex 7B.
2844 nigel 41
2845 nigel 77 After \x, from zero to two hexadecimal digits are read (letters can be
2846 nigel 87 in upper or lower case). Any number of hexadecimal digits may appear
2847     between \x{ and }, but the value of the character code must be less
2848     than 256 in non-UTF-8 mode, and less than 2**31 in UTF-8 mode (that is,
2849     the maximum hexadecimal value is 7FFFFFFF). If characters other than
2850     hexadecimal digits appear between \x{ and }, or if there is no termi-
2851     nating }, this form of escape is not recognized. Instead, the initial
2852     \x will be interpreted as a basic hexadecimal escape, with no following
2853     digits, giving a character whose value is zero.
2854 nigel 41
2855 nigel 73 Characters whose value is less than 256 can be defined by either of the
2856 nigel 87 two syntaxes for \x. There is no difference in the way they are han-
2857     dled. For example, \xdc is exactly the same as \x{dc}.
2858 nigel 41
2859 nigel 91 After \0 up to two further octal digits are read. If there are fewer
2860     than two digits, just those that are present are used. Thus the
2861     sequence \0\x\07 specifies two binary zeros followed by a BEL character
2862     (code value 7). Make sure you supply two digits after the initial zero
2863     if the pattern character that follows is itself an octal digit.
2864 nigel 63
2865 nigel 73 The handling of a backslash followed by a digit other than 0 is compli-
2866     cated. Outside a character class, PCRE reads it and any following dig-
2867 nigel 91 its as a decimal number. If the number is less than 10, or if there
2868 nigel 73 have been at least that many previous capturing left parentheses in the
2869 nigel 91 expression, the entire sequence is taken as a back reference. A
2870     description of how this works is given later, following the discussion
2871 nigel 73 of parenthesized subpatterns.
2872 nigel 41
2873 nigel 91 Inside a character class, or if the decimal number is greater than 9
2874     and there have not been that many capturing subpatterns, PCRE re-reads
2875 nigel 93 up to three octal digits following the backslash, and uses them to gen-
2876 nigel 91 erate a data character. Any subsequent digits stand for themselves. In
2877     non-UTF-8 mode, the value of a character specified in octal must be
2878     less than \400. In UTF-8 mode, values up to \777 are permitted. For
2879     example:
2880 nigel 41
2881 nigel 73 \040 is another way of writing a space
2882     \40 is the same, provided there are fewer than 40
2883     previous capturing subpatterns
2884     \7 is always a back reference
2885     \11 might be a back reference, or another way of
2886     writing a tab
2887     \011 is always a tab
2888     \0113 is a tab followed by the character "3"
2889     \113 might be a back reference, otherwise the
2890     character with octal code 113
2891     \377 might be a back reference, otherwise
2892     the byte consisting entirely of 1 bits
2893     \81 is either a back reference, or a binary zero
2894     followed by the two characters "8" and "1"
2895 nigel 41
2896 nigel 91 Note that octal values of 100 or greater must not be introduced by a
2897 nigel 73 leading zero, because no more than three octal digits are ever read.
2898 nigel 41
2899 nigel 91 All the sequences that define a single character value can be used both
2900     inside and outside character classes. In addition, inside a character
2901     class, the sequence \b is interpreted as the backspace character (hex
2902 nigel 93 08), and the sequences \R and \X are interpreted as the characters "R"
2903     and "X", respectively. Outside a character class, these sequences have
2904     different meanings (see below).
2905 nigel 43
2906 nigel 93 Absolute and relative back references
2907    
2908     The sequence \g followed by a positive or negative number, optionally
2909     enclosed in braces, is an absolute or relative back reference. Back
2910     references are discussed later, following the discussion of parenthe-
2911     sized subpatterns.
2912    
2913 nigel 75 Generic character types
2914 nigel 41
2915 nigel 93 Another use of backslash is for specifying generic character types. The
2916     following are always recognized:
2917 nigel 75
2918 nigel 73 \d any decimal digit
2919     \D any character that is not a decimal digit
2920     \s any whitespace character
2921     \S any character that is not a whitespace character
2922     \w any "word" character
2923     \W any "non-word" character
2924 nigel 41
2925 nigel 73 Each pair of escape sequences partitions the complete set of characters
2926 nigel 87 into two disjoint sets. Any given character matches one, and only one,
2927 nigel 73 of each pair.
2928 nigel 41
2929 nigel 75 These character type sequences can appear both inside and outside char-
2930 nigel 87 acter classes. They each match one character of the appropriate type.
2931     If the current matching point is at the end of the subject string, all
2932 nigel 75 of them fail, since there is no character to match.
2933 nigel 41
2934 nigel 87 For compatibility with Perl, \s does not match the VT character (code
2935     11). This makes it different from the the POSIX "space" class. The \s
2936 nigel 91 characters are HT (9), LF (10), FF (12), CR (13), and space (32). (If
2937     "use locale;" is included in a Perl script, \s may match the VT charac-
2938     ter. In PCRE, it never does.)
2939 nigel 63
2940 nigel 75 A "word" character is an underscore or any character less than 256 that
2941 nigel 87 is a letter or digit. The definition of letters and digits is con-
2942     trolled by PCRE's low-valued character tables, and may vary if locale-
2943     specific matching is taking place (see "Locale support" in the pcreapi
2944 ph10 142 page). For example, in a French locale such as "fr_FR" in Unix-like
2945     systems, or "french" in Windows, some character codes greater than 128
2946     are used for accented letters, and these are matched by \w.
2947 nigel 63
2948 nigel 87 In UTF-8 mode, characters with values greater than 128 never match \d,
2949 nigel 75 \s, or \w, and always match \D, \S, and \W. This is true even when Uni-
2950 nigel 87 code character property support is available. The use of locales with
2951     Unicode is discouraged.
2952 nigel 41
2953 nigel 93 Newline sequences
2954    
2955     Outside a character class, the escape sequence \R matches any Unicode
2956     newline sequence. This is an extension to Perl. In non-UTF-8 mode \R is
2957     equivalent to the following:
2958    
2959     (?>\r\n|\n|\x0b|\f|\r|\x85)
2960    
2961     This is an example of an "atomic group", details of which are given
2962     below. This particular group matches either the two-character sequence
2963     CR followed by LF, or one of the single characters LF (linefeed,
2964     U+000A), VT (vertical tab, U+000B), FF (formfeed, U+000C), CR (carriage
2965     return, U+000D), or NEL (next line, U+0085). The two-character sequence
2966     is treated as a single unit that cannot be split.
2967    
2968     In UTF-8 mode, two additional characters whose codepoints are greater
2969     than 255 are added: LS (line separator, U+2028) and PS (paragraph sepa-
2970     rator, U+2029). Unicode character property support is not needed for
2971     these characters to be recognized.
2972    
2973     Inside a character class, \R matches the letter "R".
2974    
2975 nigel 75 Unicode character properties
2976    
2977     When PCRE is built with Unicode character property support, three addi-
2978 nigel 87 tional escape sequences to match character properties are available
2979 nigel 75 when UTF-8 mode is selected. They are:
2980    
2981 nigel 87 \p{xx} a character with the xx property
2982     \P{xx} a character without the xx property
2983     \X an extended Unicode sequence
2984 nigel 75
2985 nigel 77 The property names represented by xx above are limited to the Unicode
2986 nigel 87 script names, the general category properties, and "Any", which matches
2987     any character (including newline). Other properties such as "InMusical-
2988     Symbols" are not currently supported by PCRE. Note that \P{Any} does
2989     not match any characters, so always causes a match failure.
2990 nigel 75
2991 nigel 87 Sets of Unicode characters are defined as belonging to certain scripts.
2992     A character from one of these sets can be matched using a script name.
2993     For example:
2994 nigel 75
2995 nigel 87 \p{Greek}
2996     \P{Han}
2997    
2998     Those that are not part of an identified script are lumped together as
2999     "Common". The current list of scripts is:
3000    
3001 nigel 93 Arabic, Armenian, Balinese, Bengali, Bopomofo, Braille, Buginese,
3002     Buhid, Canadian_Aboriginal, Cherokee, Common, Coptic, Cuneiform,
3003     Cypriot, Cyrillic, Deseret, Devanagari, Ethiopic, Georgian, Glagolitic,
3004     Gothic, Greek, Gujarati, Gurmukhi, Han, Hangul, Hanunoo, Hebrew, Hira-
3005     gana, Inherited, Kannada, Katakana, Kharoshthi, Khmer, Lao, Latin,
3006     Limbu, Linear_B, Malayalam, Mongolian, Myanmar, New_Tai_Lue, Nko,
3007     Ogham, Old_Italic, Old_Persian, Oriya, Osmanya, Phags_Pa, Phoenician,
3008     Runic, Shavian, Sinhala, Syloti_Nagri, Syriac, Tagalog, Tagbanwa,
3009     Tai_Le, Tamil, Telugu, Thaana, Thai, Tibetan, Tifinagh, Ugaritic, Yi.
3010 nigel 87
3011     Each character has exactly one general category property, specified by
3012     a two-letter abbreviation. For compatibility with Perl, negation can be
3013     specified by including a circumflex between the opening brace and the
3014     property name. For example, \p{^Lu} is the same as \P{Lu}.
3015    
3016     If only one letter is specified with \p or \P, it includes all the gen-
3017     eral category properties that start with that letter. In this case, in
3018     the absence of negation, the curly brackets in the escape sequence are
3019     optional; these two examples have the same effect:
3020    
3021 nigel 75 \p{L}
3022     \pL
3023    
3024 nigel 87 The following general category property codes are supported:
3025 nigel 75
3026     C Other
3027     Cc Control
3028     Cf Format
3029     Cn Unassigned
3030     Co Private use
3031     Cs Surrogate
3032    
3033     L Letter
3034     Ll Lower case letter
3035     Lm Modifier letter
3036     Lo Other letter
3037     Lt Title case letter
3038     Lu Upper case letter
3039    
3040     M Mark
3041     Mc Spacing mark
3042     Me Enclosing mark
3043     Mn Non-spacing mark
3044    
3045     N Number
3046     Nd Decimal number
3047     Nl Letter number
3048     No Other number
3049    
3050     P Punctuation
3051     Pc Connector punctuation
3052     Pd Dash punctuation
3053     Pe Close punctuation
3054     Pf Final punctuation
3055     Pi Initial punctuation
3056     Po Other punctuation
3057     Ps Open punctuation
3058    
3059     S Symbol
3060     Sc Currency symbol
3061     Sk Modifier symbol
3062     Sm Mathematical symbol
3063     So Other symbol
3064    
3065     Z Separator
3066     Zl Line separator
3067     Zp Paragraph separator
3068     Zs Space separator
3069    
3070 nigel 87 The special property L& is also supported: it matches a character that
3071     has the Lu, Ll, or Lt property, in other words, a letter that is not
3072     classified as a modifier or "other".
3073 nigel 75
3074 nigel 87 The long synonyms for these properties that Perl supports (such as
3075 nigel 91 \p{Letter}) are not supported by PCRE, nor is it permitted to prefix
3076 nigel 87 any of these properties with "Is".
3077    
3078     No character that is in the Unicode table has the Cn (unassigned) prop-
3079     erty. Instead, this property is assumed for any code point that is not
3080     in the Unicode table.
3081    
3082 nigel 77 Specifying caseless matching does not affect these escape sequences.
3083 nigel 75 For example, \p{Lu} always matches only upper case letters.
3084    
3085 nigel 77 The \X escape matches any number of Unicode characters that form an
3086 nigel 75 extended Unicode sequence. \X is equivalent to
3087    
3088     (?>\PM\pM*)
3089    
3090 nigel 77 That is, it matches a character without the "mark" property, followed
3091     by zero or more characters with the "mark" property, and treats the
3092     sequence as an atomic group (see below). Characters with the "mark"
3093 nigel 75 property are typically accents that affect the preceding character.
3094    
3095 nigel 77 Matching characters by Unicode property is not fast, because PCRE has
3096     to search a structure that contains data for over fifteen thousand
3097 nigel 75 characters. That is why the traditional escape sequences such as \d and
3098     \w do not use Unicode properties in PCRE.
3099    
3100     Simple assertions
3101    
3102 nigel 93 The final use of backslash is for certain simple assertions. An asser-
3103 nigel 77 tion specifies a condition that has to be met at a particular point in
3104     a match, without consuming any characters from the subject string. The
3105     use of subpatterns for more complicated assertions is described below.
3106 nigel 75 The backslashed assertions are:
3107 nigel 41
3108 nigel 73 \b matches at a word boundary
3109     \B matches when not at a word boundary
3110 nigel 93 \A matches at the start of the subject
3111     \Z matches at the end of the subject
3112     also matches before a newline at the end of the subject
3113     \z matches only at the end of the subject
3114     \G matches at the first matching position in the subject
3115 nigel 41
3116 nigel 77 These assertions may not appear in character classes (but note that \b
3117 nigel 73 has a different meaning, namely the backspace character, inside a char-
3118     acter class).
3119 nigel 41
3120 nigel 77 A word boundary is a position in the subject string where the current
3121     character and the previous character do not both match \w or \W (i.e.
3122     one matches \w and the other matches \W), or the start or end of the
3123 nigel 73 string if the first or last character matches \w, respectively.
3124 nigel 43
3125 nigel 77 The \A, \Z, and \z assertions differ from the traditional circumflex
3126 nigel 75 and dollar (described in the next section) in that they only ever match
3127 nigel 77 at the very start and end of the subject string, whatever options are
3128     set. Thus, they are independent of multiline mode. These three asser-
3129 nigel 75 tions are not affected by the PCRE_NOTBOL or PCRE_NOTEOL options, which
3130 nigel 77 affect only the behaviour of the circumflex and dollar metacharacters.
3131     However, if the startoffset argument of pcre_exec() is non-zero, indi-
3132 nigel 75 cating that matching is to start at a point other than the beginning of
3133 nigel 77 the subject, \A can never match. The difference between \Z and \z is
3134 nigel 91 that \Z matches before a newline at the end of the string as well as at
3135     the very end, whereas \z matches only at the end.
3136 nigel 63
3137 nigel 91 The \G assertion is true only when the current matching position is at
3138     the start point of the match, as specified by the startoffset argument
3139     of pcre_exec(). It differs from \A when the value of startoffset is
3140     non-zero. By calling pcre_exec() multiple times with appropriate argu-
3141 nigel 73 ments, you can mimic Perl's /g option, and it is in this kind of imple-
3142     mentation where \G can be useful.
3143 nigel 41
3144 nigel 91 Note, however, that PCRE's interpretation of \G, as the start of the
3145 nigel 73 current match, is subtly different from Perl's, which defines it as the
3146 nigel 91 end of the previous match. In Perl, these can be different when the
3147     previously matched string was empty. Because PCRE does just one match
3148 nigel 73 at a time, it cannot reproduce this behaviour.
3149 nigel 41
3150 nigel 91 If all the alternatives of a pattern begin with \G, the expression is
3151 nigel 73 anchored to the starting match position, and the "anchored" flag is set
3152     in the compiled regular expression.
3153 nigel 63
3154    
3155 nigel 41 CIRCUMFLEX AND DOLLAR
3156 nigel 63
3157 nigel 73 Outside a character class, in the default matching mode, the circumflex
3158 nigel 91 character is an assertion that is true only if the current matching
3159     point is at the start of the subject string. If the startoffset argu-
3160     ment of pcre_exec() is non-zero, circumflex can never match if the
3161     PCRE_MULTILINE option is unset. Inside a character class, circumflex
3162 nigel 73 has an entirely different meaning (see below).
3163 nigel 41
3164 nigel 91 Circumflex need not be the first character of the pattern if a number
3165     of alternatives are involved, but it should be the first thing in each
3166     alternative in which it appears if the pattern is ever to match that
3167     branch. If all possible alternatives start with a circumflex, that is,
3168     if the pattern is constrained to match only at the start of the sub-
3169     ject, it is said to be an "anchored" pattern. (There are also other
3170 nigel 73 constructs that can cause a pattern to be anchored.)
3171 nigel 41
3172 nigel 91 A dollar character is an assertion that is true only if the current
3173     matching point is at the end of the subject string, or immediately
3174     before a newline at the end of the string (by default). Dollar need not
3175     be the last character of the pattern if a number of alternatives are
3176     involved, but it should be the last item in any branch in which it
3177     appears. Dollar has no special meaning in a character class.
3178 nigel 41
3179 nigel 77 The meaning of dollar can be changed so that it matches only at the
3180     very end of the string, by setting the PCRE_DOLLAR_ENDONLY option at
3181 nigel 73 compile time. This does not affect the \Z assertion.
3182 nigel 41
3183 nigel 73 The meanings of the circumflex and dollar characters are changed if the
3184 nigel 91 PCRE_MULTILINE option is set. When this is the case, a circumflex
3185     matches immediately after internal newlines as well as at the start of
3186     the subject string. It does not match after a newline that ends the
3187     string. A dollar matches before any newlines in the string, as well as
3188     at the very end, when PCRE_MULTILINE is set. When newline is specified
3189     as the two-character sequence CRLF, isolated CR and LF characters do
3190     not indicate newlines.
3191 nigel 41
3192 nigel 91 For example, the pattern /^abc$/ matches the subject string "def\nabc"
3193     (where \n represents a newline) in multiline mode, but not otherwise.
3194     Consequently, patterns that are anchored in single line mode because
3195     all branches start with ^ are not anchored in multiline mode, and a
3196     match for circumflex is possible when the startoffset argument of
3197     pcre_exec() is non-zero. The PCRE_DOLLAR_ENDONLY option is ignored if
3198     PCRE_MULTILINE is set.
3199 nigel 41
3200 nigel 91 Note that the sequences \A, \Z, and \z can be used to match the start
3201     and end of the subject in both modes, and if all branches of a pattern
3202     start with \A it is always anchored, whether or not PCRE_MULTILINE is
3203     set.
3204 nigel 41
3205 nigel 91
3206 nigel 63 FULL STOP (PERIOD, DOT)
3207 nigel 41
3208 nigel 73 Outside a character class, a dot in the pattern matches any one charac-
3209 nigel 91 ter in the subject string except (by default) a character that signi-
3210     fies the end of a line. In UTF-8 mode, the matched character may be
3211 nigel 93 more than one byte long.
3212 nigel 41
3213 nigel 93 When a line ending is defined as a single character, dot never matches
3214     that character; when the two-character sequence CRLF is used, dot does
3215     not match CR if it is immediately followed by LF, but otherwise it
3216     matches all characters (including isolated CRs and LFs). When any Uni-
3217     code line endings are being recognized, dot does not match CR or LF or
3218     any of the other line ending characters.
3219 nigel 41
3220 nigel 93 The behaviour of dot with regard to newlines can be changed. If the
3221     PCRE_DOTALL option is set, a dot matches any one character, without
3222     exception. If the two-character sequence CRLF is present in the subject
3223     string, it takes two dots to match it.
3224    
3225     The handling of dot is entirely independent of the handling of circum-
3226     flex and dollar, the only relationship being that they both involve
3227 nigel 91 newlines. Dot has no special meaning in a character class.
3228    
3229    
3230 nigel 63 MATCHING A SINGLE BYTE
3231    
3232 nigel 73 Outside a character class, the escape sequence \C matches any one byte,
3233 nigel 93 both in and out of UTF-8 mode. Unlike a dot, it always matches any
3234     line-ending characters. The feature is provided in Perl in order to
3235     match individual bytes in UTF-8 mode. Because it breaks up UTF-8 char-
3236     acters into individual bytes, what remains in the string may be a mal-
3237     formed UTF-8 string. For this reason, the \C escape sequence is best
3238     avoided.
3239 nigel 63
3240 nigel 77 PCRE does not allow \C to appear in lookbehind assertions (described
3241     below), because in UTF-8 mode this would make it impossible to calcu-
3242 nigel 75 late the length of the lookbehind.
3243 nigel 63
3244    
3245 nigel 75 SQUARE BRACKETS AND CHARACTER CLASSES
3246 nigel 63
3247 nigel 73 An opening square bracket introduces a character class, terminated by a
3248     closing square bracket. A closing square bracket on its own is not spe-
3249     cial. If a closing square bracket is required as a member of the class,
3250 nigel 77 it should be the first data character in the class (after an initial
3251 nigel 73 circumflex, if present) or escaped with a backslash.
3252 nigel 41
3253 nigel 77 A character class matches a single character in the subject. In UTF-8
3254     mode, the character may occupy more than one byte. A matched character
3255 nigel 73 must be in the set of characters defined by the class, unless the first
3256 nigel 77 character in the class definition is a circumflex, in which case the
3257     subject character must not be in the set defined by the class. If a
3258     circumflex is actually required as a member of the class, ensure it is
3259 nigel 73 not the first character, or escape it with a backslash.
3260 nigel 41
3261 nigel 77 For example, the character class [aeiou] matches any lower case vowel,
3262     while [^aeiou] matches any character that is not a lower case vowel.
3263 nigel 73 Note that a circumflex is just a convenient notation for specifying the
3264 nigel 77 characters that are in the class by enumerating those that are not. A
3265     class that starts with a circumflex is not an assertion: it still con-
3266     sumes a character from the subject string, and therefore it fails if
3267 nigel 75 the current pointer is at the end of the string.
3268 nigel 41
3269 nigel 77 In UTF-8 mode, characters with values greater than 255 can be included
3270     in a class as a literal string of bytes, or by using the \x{ escaping
3271 nigel 73 mechanism.
3272 nigel 63
3273 nigel 77 When caseless matching is set, any letters in a class represent both
3274     their upper case and lower case versions, so for example, a caseless
3275     [aeiou] matches "A" as well as "a", and a caseless [^aeiou] does not
3276     match "A", whereas a caseful version would. In UTF-8 mode, PCRE always
3277     understands the concept of case for characters whose values are less
3278     than 128, so caseless matching is always possible. For characters with
3279     higher values, the concept of case is supported if PCRE is compiled
3280     with Unicode property support, but not otherwise. If you want to use
3281     caseless matching for characters 128 and above, you must ensure that
3282     PCRE is compiled with Unicode property support as well as with UTF-8
3283     support.
3284 nigel 41
3285 nigel 93 Characters that might indicate line breaks are never treated in any
3286     special way when matching character classes, whatever line-ending
3287     sequence is in use, and whatever setting of the PCRE_DOTALL and
3288     PCRE_MULTILINE options is used. A class such as [^a] always matches one
3289     of these characters.
3290 nigel 41
3291 nigel 75 The minus (hyphen) character can be used to specify a range of charac-
3292     ters in a character class. For example, [d-m] matches any letter
3293     between d and m, inclusive. If a minus character is required in a
3294     class, it must be escaped with a backslash or appear in a position
3295     where it cannot be interpreted as indicating a range, typically as the
3296 nigel 73 first or last character in the class.
3297 nigel 41
3298 nigel 73 It is not possible to have the literal character "]" as the end charac-
3299 nigel 75 ter of a range. A pattern such as [W-]46] is interpreted as a class of
3300     two characters ("W" and "-") followed by a literal string "46]", so it
3301     would match "W46]" or "-46]". However, if the "]" is escaped with a
3302     backslash it is interpreted as the end of range, so [W-\]46] is inter-
3303     preted as a class containing a range followed by two other characters.
3304     The octal or hexadecimal representation of "]" can also be used to end
3305     a range.
3306 nigel 41
3307 nigel 75 Ranges operate in the collating sequence of character values. They can
3308     also be used for characters specified numerically, for example
3309     [\000-\037]. In UTF-8 mode, ranges can include characters whose values
3310 nigel 73 are greater than 255, for example [\x{100}-\x{2ff}].
3311 nigel 63
3312 nigel 73 If a range that includes letters is used when caseless matching is set,
3313     it matches the letters in either case. For example, [W-c] is equivalent
3314 nigel 75 to [][\\^_`wxyzabc], matched caselessly, and in non-UTF-8 mode, if
3315 ph10 142 character tables for a French locale are in use, [\xc8-\xcb] matches
3316 nigel 75 accented E characters in both cases. In UTF-8 mode, PCRE supports the
3317     concept of case for characters with values greater than 128 only when
3318     it is compiled with Unicode property support.
3319 nigel 41
3320 nigel 75 The character types \d, \D, \p, \P, \s, \S, \w, and \W may also appear
3321     in a character class, and add the characters that they match to the
3322     class. For example, [\dABCDEF] matches any hexadecimal digit. A circum-
3323     flex can conveniently be used with the upper case character types to
3324     specify a more restricted set of characters than the matching lower
3325     case type. For example, the class [^\W_] matches any letter or digit,
3326     but not underscore.
3327 nigel 41
3328 nigel 75 The only metacharacters that are recognized in character classes are
3329     backslash, hyphen (only where it can be interpreted as specifying a
3330     range), circumflex (only at the start), opening square bracket (only
3331     when it can be interpreted as introducing a POSIX class name - see the
3332     next section), and the terminating closing square bracket. However,
3333     escaping other non-alphanumeric characters does no harm.
3334 nigel 41
3335 nigel 73
3336 nigel 43 POSIX CHARACTER CLASSES
3337    
3338 nigel 75 Perl supports the POSIX notation for character classes. This uses names
3339     enclosed by [: and :] within the enclosing square brackets. PCRE also
3340     supports this notation. For example,
3341 nigel 63
3342 nigel 73 [01[:alpha:]%]
3343 nigel 43
3344 nigel 73 matches "0", "1", any alphabetic character, or "%". The supported class
3345     names are
3346 nigel 43
3347 nigel 73 alnum letters and digits
3348     alpha letters
3349     ascii character codes 0 - 127
3350     blank space or tab only
3351     cntrl control characters
3352     digit decimal digits (same as \d)
3353     graph printing characters, excluding space
3354     lower lower case letters
3355     print printing characters, including space
3356     punct printing characters, excluding letters and digits
3357     space white space (not quite the same as \s)
3358     upper upper case letters
3359     word "word" characters (same as \w)
3360     xdigit hexadecimal digits
3361 nigel 43
3362 nigel 73 The "space" characters are HT (9), LF (10), VT (11), FF (12), CR (13),
3363     and space (32). Notice that this list includes the VT character (code
3364     11). This makes "space" different to \s, which does not include VT (for
3365     Perl compatibility).
3366 nigel 43
3367 nigel 73 The name "word" is a Perl extension, and "blank" is a GNU extension
3368     from Perl 5.8. Another Perl extension is negation, which is indicated
3369     by a ^ character after the colon. For example,
3370 nigel 63
3371 nigel 73 [12[:^digit:]]
3372 nigel 43
3373 nigel 73 matches "1", "2", or any non-digit. PCRE (and Perl) also recognize the
3374     POSIX syntax [.ch.] and [=ch=] where "ch" is a "collating element", but
3375     these are not supported, and an error is given if they are encountered.
3376 nigel 43
3377 nigel 75 In UTF-8 mode, characters with values greater than 128 do not match any
3378 nigel 73 of the POSIX character classes.
3379 nigel 43
3380    
3381 nigel 41 VERTICAL BAR
3382 nigel 63
3383 nigel 73 Vertical bar characters are used to separate alternative patterns. For
3384     example, the pattern
3385 nigel 41
3386 nigel 73 gilbert|sullivan
3387 nigel 41
3388 nigel 73 matches either "gilbert" or "sullivan". Any number of alternatives may
3389     appear, and an empty alternative is permitted (matching the empty
3390 nigel 91 string). The matching process tries each alternative in turn, from left
3391     to right, and the first one that succeeds is used. If the alternatives
3392     are within a subpattern (defined below), "succeeds" means matching the
3393     rest of the main pattern as well as the alternative in the subpattern.
3394 nigel 41
3395    
3396     INTERNAL OPTION SETTING
3397    
3398 nigel 73 The settings of the PCRE_CASELESS, PCRE_MULTILINE, PCRE_DOTALL, and
3399     PCRE_EXTENDED options can be changed from within the pattern by a
3400     sequence of Perl option letters enclosed between "(?" and ")". The
3401     option letters are
3402 nigel 63
3403 nigel 73 i for PCRE_CASELESS
3404     m for PCRE_MULTILINE
3405     s for PCRE_DOTALL
3406     x for PCRE_EXTENDED
3407 nigel 41
3408 nigel 73 For example, (?im) sets caseless, multiline matching. It is also possi-