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

Diff of /code/trunk/doc/pcreapi.3

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

revision 659 by ph10, Tue Aug 16 09:48:29 2011 UTC revision 678 by ph10, Sun Aug 28 15:23:03 2011 UTC
# Line 1  Line 1 
1  .TH PCREAPI 3  .TH PCREAPI 3
2  .SH NAME  .SH NAME
3  PCRE - Perl-compatible regular expressions  PCRE - Perl-compatible regular expressions
4  .SH "PCRE NATIVE API"  .SH "PCRE NATIVE API BASIC FUNCTIONS"
5  .rs  .rs
6  .sp  .sp
7  .B #include <pcre.h>  .B #include <pcre.h>
# Line 25  PCRE - Perl-compatible regular expressio Line 25  PCRE - Perl-compatible regular expressio
25  .ti +5n  .ti +5n
26  .B const char **\fIerrptr\fP);  .B const char **\fIerrptr\fP);
27  .PP  .PP
28    .B void pcre_free_study(pcre_extra *\fIextra\fP);
29    .PP
30  .B int pcre_exec(const pcre *\fIcode\fP, "const pcre_extra *\fIextra\fP,"  .B int pcre_exec(const pcre *\fIcode\fP, "const pcre_extra *\fIextra\fP,"
31  .ti +5n  .ti +5n
32  .B "const char *\fIsubject\fP," int \fIlength\fP, int \fIstartoffset\fP,  .B "const char *\fIsubject\fP," int \fIlength\fP, int \fIstartoffset\fP,
33  .ti +5n  .ti +5n
34  .B int \fIoptions\fP, int *\fIovector\fP, int \fIovecsize\fP);  .B int \fIoptions\fP, int *\fIovector\fP, int \fIovecsize\fP);
35    .
36    .
37    .SH "PCRE NATIVE API AUXILIARY FUNCTIONS"
38    .rs
39    .sp
40    .B pcre_jit_stack *pcre_jit_stack_alloc(int \fIstartsize\fP, int \fImaxsize\fP);
41    .PP
42    .B void pcre_jit_stack_free(pcre_jit_stack *\fIstack\fP);
43    .PP
44    .B void pcre_assign_jit_stack(pcre_extra *\fIextra\fP,
45    .ti +5n
46    .B pcre_jit_callback \fIcallback\fP, void *\fIdata\fP);
47  .PP  .PP
48  .B int pcre_dfa_exec(const pcre *\fIcode\fP, "const pcre_extra *\fIextra\fP,"  .B int pcre_dfa_exec(const pcre *\fIcode\fP, "const pcre_extra *\fIextra\fP,"
49  .ti +5n  .ti +5n
# Line 114  PCRE - Perl-compatible regular expressio Line 128  PCRE - Perl-compatible regular expressio
128  .sp  .sp
129  PCRE has its own native API, which is described in this document. There are  PCRE has its own native API, which is described in this document. There are
130  also some wrapper functions that correspond to the POSIX regular expression  also some wrapper functions that correspond to the POSIX regular expression
131  API. These are described in the  API, but they do not give access to all the functionality. They are described
132    in the
133  .\" HREF  .\" HREF
134  \fBpcreposix\fP  \fBpcreposix\fP
135  .\"  .\"
136  documentation. Both of these APIs define a set of C function calls. A C++  documentation. Both of these APIs define a set of C function calls. A C++
137  wrapper is distributed with PCRE. It is documented in the  wrapper is also distributed with PCRE. It is documented in the
138  .\" HREF  .\" HREF
139  \fBpcrecpp\fP  \fBpcrecpp\fP
140  .\"  .\"
# Line 152  documentation, and the Line 167  documentation, and the
167  .\"  .\"
168  documentation describes how to compile and run it.  documentation describes how to compile and run it.
169  .P  .P
170    Just-in-time compiler support is an optional feature of PCRE that can be built
171    in appropriate hardware environments. It greatly speeds up the matching
172    performance of many patterns. Simple programs can request its use if available.
173    More complicated programs might need to make use of the
174    \fBpcre_jit_stack_alloc()\fP, \fBpcre_jit_stack_free()\fP, and
175    \fBpcre_assign_jit_stack()\fP functions in order to control its memory usage.
176    These functions are discussed in the
177    .\" HREF
178    \fBpcrejit\fP
179    .\"
180    documentation.
181    .P
182  A second matching function, \fBpcre_dfa_exec()\fP, which is not  A second matching function, \fBpcre_dfa_exec()\fP, which is not
183  Perl-compatible, is also provided. This uses a different algorithm for the  Perl-compatible, is also provided. This uses a different algorithm for the
184  matching. The alternative algorithm finds all possible matches (at a given  matching. The alternative algorithm finds all possible matches (at a given
# Line 282  callout function pointed to by \fBpcre_c Line 309  callout function pointed to by \fBpcre_c
309  .P  .P
310  The compiled form of a regular expression is not altered during matching, so  The compiled form of a regular expression is not altered during matching, so
311  the same compiled pattern can safely be used by several threads at once.  the same compiled pattern can safely be used by several threads at once.
312    .P
313    If the just-in-time optimization feature is being used, it needs separate
314    memory stack areas for each thread. See the
315    .\" HREF
316    \fBpcrejit\fP
317    .\"
318    documentation for more details.
319  .  .
320  .  .
321  .SH "SAVING PRECOMPILED PATTERNS FOR LATER USE"  .SH "SAVING PRECOMPILED PATTERNS FOR LATER USE"
# Line 324  otherwise it is set to zero. Line 358  otherwise it is set to zero.
358  The output is an integer that is set to one if support for Unicode character  The output is an integer that is set to one if support for Unicode character
359  properties is available; otherwise it is set to zero.  properties is available; otherwise it is set to zero.
360  .sp  .sp
361      PCRE_CONFIG_JIT
362    .sp
363    The output is an integer that is set to one if support for just-in-time
364    compiling is available; otherwise it is set to zero.
365    .sp
366    PCRE_CONFIG_NEWLINE    PCRE_CONFIG_NEWLINE
367  .sp  .sp
368  The output is an integer whose value specifies the default character sequence  The output is an integer whose value specifies the default character sequence
# Line 701  of UTF-8 characters instead of single-by Line 740  of UTF-8 characters instead of single-by
740  available only when PCRE is built to include UTF-8 support. If not, the use  available only when PCRE is built to include UTF-8 support. If not, the use
741  of this option provokes an error. Details of how this option changes the  of this option provokes an error. Details of how this option changes the
742  behaviour of PCRE are given in the  behaviour of PCRE are given in the
 .\" HTML <a href="pcre.html#utf8support">  
 .\" </a>  
 section on UTF-8 support  
 .\"  
 in the main  
743  .\" HREF  .\" HREF
744  \fBpcre\fP  \fBpcreunicode\fP
745  .\"  .\"
746  page.  page.
747  .sp  .sp
# Line 849  If studying the pattern does not produce Line 883  If studying the pattern does not produce
883  wants to pass any of the other fields to \fBpcre_exec()\fP or  wants to pass any of the other fields to \fBpcre_exec()\fP or
884  \fBpcre_dfa_exec()\fP, it must set up its own \fBpcre_extra\fP block.  \fBpcre_dfa_exec()\fP, it must set up its own \fBpcre_extra\fP block.
885  .P  .P
886  The second argument of \fBpcre_study()\fP contains option bits. At present, no  The second argument of \fBpcre_study()\fP contains option bits. There is only
887  options are defined, and this argument should always be zero.  one option: PCRE_STUDY_JIT_COMPILE. If this is set, and the just-in-time
888    compiler is available, the pattern is further compiled into machine code that
889    executes much faster than the \fBpcre_exec()\fP matching function. If
890    the just-in-time compiler is not available, this option is ignored. All other
891    bits in the \fIoptions\fP argument must be zero.
892    .P
893    JIT compilation is a heavyweight optimization. It can take some time for
894    patterns to be analyzed, and for one-off matches and simple patterns the
895    benefit of faster execution might be offset by a much slower study time.
896    Not all patterns can be optimized by the JIT compiler. For those that cannot be
897    handled, matching automatically falls back to the \fBpcre_exec()\fP
898    interpreter. For more details, see the
899    .\" HREF
900    \fBpcrejit\fP
901    .\"
902    documentation.
903  .P  .P
904  The third argument for \fBpcre_study()\fP is a pointer for an error message. If  The third argument for \fBpcre_study()\fP is a pointer for an error message. If
905  studying succeeds (even if no data is returned), the variable it points to is  studying succeeds (even if no data is returned), the variable it points to is
# Line 859  static string that is part of the librar Line 908  static string that is part of the librar
908  should test the error pointer for NULL after calling \fBpcre_study()\fP, to be  should test the error pointer for NULL after calling \fBpcre_study()\fP, to be
909  sure that it has run successfully.  sure that it has run successfully.
910  .P  .P
911  This is a typical call to \fBpcre_study\fP():  When you are finished with a pattern, you can free the memory used for the
912    study data by calling \fBpcre_free_study()\fP. This function was added to the
913    API for release 8.20. For earlier versions, the memory could be freed with
914    \fBpcre_free()\fP, just like the pattern itself. This will still work in cases
915    where PCRE_STUDY_JIT_COMPILE is not used, but it is advisable to change to the
916    new function when convenient.
917    .P
918    This is a typical way in which \fBpcre_study\fP() is used (except that in a
919    real application there should be tests for errors):
920  .sp  .sp
921    pcre_extra *pe;    int rc;
922    pe = pcre_study(    pcre *re;
923      pcre_extra *sd;
924      re = pcre_compile("pattern", 0, &error, &erroroffset, NULL);
925      sd = pcre_study(
926      re,             /* result of pcre_compile() */      re,             /* result of pcre_compile() */
927      0,              /* no options exist */      0,              /* no options */
928      &error);        /* set to NULL or points to a message */      &error);        /* set to NULL or points to a message */
929      rc = pcre_exec(   /* see below for details of pcre_exec() options */
930        re, sd, "subject", 7, 0, 0, ovector, 30);
931      ...
932      pcre_free_study(sd);
933      pcre_free(re);
934  .sp  .sp
935  Studying a pattern does two things: first, a lower bound for the length of  Studying a pattern does two things: first, a lower bound for the length of
936  subject string that is needed to match the pattern is computed. This does not  subject string that is needed to match the pattern is computed. This does not
# Line 880  single fixed starting character. A bitma Line 945  single fixed starting character. A bitma
945  created. This speeds up finding a position in the subject at which to start  created. This speeds up finding a position in the subject at which to start
946  matching.  matching.
947  .P  .P
948  The two optimizations just described can be disabled by setting the  These two optimizations apply to both \fBpcre_exec()\fP and
949  PCRE_NO_START_OPTIMIZE option when calling \fBpcre_exec()\fP or  \fBpcre_dfa_exec()\fP. However, they are not used by \fBpcre_exec()\fP if
950    \fBpcre_study()\fP is called with the PCRE_STUDY_JIT_COMPILE option, and
951    just-in-time compiling is successful. The optimizations can be disabled by
952    setting the PCRE_NO_START_OPTIMIZE option when calling \fBpcre_exec()\fP or
953  \fBpcre_dfa_exec()\fP. You might want to do this if your pattern contains  \fBpcre_dfa_exec()\fP. You might want to do this if your pattern contains
954  callouts or (*MARK), and you want to make use of these facilities in cases  callouts or (*MARK) (which cannot be handled by the JIT compiler), and you want
955  where matching fails. See the discussion of PCRE_NO_START_OPTIMIZE  to make use of these facilities in cases where matching fails. See the
956    discussion of PCRE_NO_START_OPTIMIZE
957  .\" HTML <a href="#execoptions">  .\" HTML <a href="#execoptions">
958  .\" </a>  .\" </a>
959  below.  below.
# Line 981  check against passing an arbitrary memor Line 1050  check against passing an arbitrary memor
1050    size_t length;    size_t length;
1051    rc = pcre_fullinfo(    rc = pcre_fullinfo(
1052      re,               /* result of pcre_compile() */      re,               /* result of pcre_compile() */
1053      pe,               /* result of pcre_study(), or NULL */      sd,               /* result of pcre_study(), or NULL */
1054      PCRE_INFO_SIZE,   /* what is required */      PCRE_INFO_SIZE,   /* what is required */
1055      &length);         /* where to put the data */      &length);         /* where to put the data */
1056  .sp  .sp
# Line 1046  Return 1 if the (?J) or (?-J) option set Line 1115  Return 1 if the (?J) or (?-J) option set
1115  0. The fourth argument should point to an \fBint\fP variable. (?J) and  0. The fourth argument should point to an \fBint\fP variable. (?J) and
1116  (?-J) set and unset the local PCRE_DUPNAMES option, respectively.  (?-J) set and unset the local PCRE_DUPNAMES option, respectively.
1117  .sp  .sp
1118      PCRE_INFO_JIT
1119    .sp
1120    Return 1 if the pattern was studied with the PCRE_STUDY_JIT_COMPILE option, and
1121    just-in-time compiling was successful. The fourth argument should point to an
1122    \fBint\fP variable. A return value of 0 means that JIT support is not available
1123    in this version of PCRE, or that the pattern was not studied with the
1124    PCRE_STUDY_JIT_COMPILE option, or that the JIT compiler could not handle this
1125    particular pattern. See the
1126    .\" HREF
1127    \fBpcrejit\fP
1128    .\"
1129    documentation for details of what can and cannot be handled.
1130    .sp
1131    PCRE_INFO_LASTLITERAL    PCRE_INFO_LASTLITERAL
1132  .sp  .sp
1133  Return the value of the rightmost literal byte that must exist in any matched  Return the value of the rightmost literal byte that must exist in any matched
# Line 1290  fields (not necessarily in this order): Line 1372  fields (not necessarily in this order):
1372  .sp  .sp
1373    unsigned long int \fIflags\fP;    unsigned long int \fIflags\fP;
1374    void *\fIstudy_data\fP;    void *\fIstudy_data\fP;
1375      void *\fIexecutable_jit\fP;
1376    unsigned long int \fImatch_limit\fP;    unsigned long int \fImatch_limit\fP;
1377    unsigned long int \fImatch_limit_recursion\fP;    unsigned long int \fImatch_limit_recursion\fP;
1378    void *\fIcallout_data\fP;    void *\fIcallout_data\fP;
# Line 1300  The \fIflags\fP field is a bitmap that s Line 1383  The \fIflags\fP field is a bitmap that s
1383  are set. The flag bits are:  are set. The flag bits are:
1384  .sp  .sp
1385    PCRE_EXTRA_STUDY_DATA    PCRE_EXTRA_STUDY_DATA
1386      PCRE_EXTRA_EXECUTABLE_JIT
1387    PCRE_EXTRA_MATCH_LIMIT    PCRE_EXTRA_MATCH_LIMIT
1388    PCRE_EXTRA_MATCH_LIMIT_RECURSION    PCRE_EXTRA_MATCH_LIMIT_RECURSION
1389    PCRE_EXTRA_CALLOUT_DATA    PCRE_EXTRA_CALLOUT_DATA
1390    PCRE_EXTRA_TABLES    PCRE_EXTRA_TABLES
1391    PCRE_EXTRA_MARK    PCRE_EXTRA_MARK
1392  .sp  .sp
1393  Other flag bits should be set to zero. The \fIstudy_data\fP field is set in the  Other flag bits should be set to zero. The \fIstudy_data\fP field and sometimes
1394  \fBpcre_extra\fP block that is returned by \fBpcre_study()\fP, together with  the \fIexecutable_jit\fP field are set in the \fBpcre_extra\fP block that is
1395  the appropriate flag bit. You should not set this yourself, but you may add to  returned by \fBpcre_study()\fP, together with the appropriate flag bits. You
1396  the block by setting the other fields and their corresponding flag bits.  should not set these yourself, but you may add to the block by setting the
1397    other fields and their corresponding flag bits.
1398  .P  .P
1399  The \fImatch_limit\fP field provides a means of preventing PCRE from using up a  The \fImatch_limit\fP field provides a means of preventing PCRE from using up a
1400  vast amount of resources when running patterns that are not going to match,  vast amount of resources when running patterns that are not going to match,
1401  but which have a very large number of possibilities in their search trees. The  but which have a very large number of possibilities in their search trees. The
1402  classic example is a pattern that uses nested unlimited repeats.  classic example is a pattern that uses nested unlimited repeats.
1403  .P  .P
1404  Internally, PCRE uses a function called \fBmatch()\fP which it calls repeatedly  Internally, \fBpcre_exec()\fP uses a function called \fBmatch()\fP, which it
1405  (sometimes recursively). The limit set by \fImatch_limit\fP is imposed on the  calls repeatedly (sometimes recursively). The limit set by \fImatch_limit\fP is
1406  number of times this function is called during a match, which has the effect of  imposed on the number of times this function is called during a match, which
1407  limiting the amount of backtracking that can take place. For patterns that are  has the effect of limiting the amount of backtracking that can take place. For
1408  not anchored, the count restarts from zero for each position in the subject  patterns that are not anchored, the count restarts from zero for each position
1409  string.  in the subject string.
1410    .P
1411    When \fBpcre_exec()\fP is called with a pattern that was successfully studied
1412    with the PCRE_STUDY_JIT_COMPILE option, the way that the matching is executed
1413    is entirely different. However, there is still the possibility of runaway
1414    matching that goes on for a very long time, and so the \fImatch_limit\fP value
1415    is also used in this case (but in a different way) to limit how long the
1416    matching can continue.
1417  .P  .P
1418  The default value for the limit can be set when PCRE is built; the default  The default value for the limit can be set when PCRE is built; the default
1419  default is 10 million, which handles all but the most extreme cases. You can  default is 10 million, which handles all but the most extreme cases. You can
# Line 1334  The \fImatch_limit_recursion\fP field is Line 1426  The \fImatch_limit_recursion\fP field is
1426  instead of limiting the total number of times that \fBmatch()\fP is called, it  instead of limiting the total number of times that \fBmatch()\fP is called, it
1427  limits the depth of recursion. The recursion depth is a smaller number than the  limits the depth of recursion. The recursion depth is a smaller number than the
1428  total number of calls, because not all calls to \fBmatch()\fP are recursive.  total number of calls, because not all calls to \fBmatch()\fP are recursive.
1429  This limit is of use only if it is set smaller than \fImatch_limit\fP.  This limit is of use only if it is set smaller than \fImatch_limit\fP.
1430  .P  .P
1431  Limiting the recursion depth limits the amount of stack that can be used, or,  Limiting the recursion depth limits the amount of machine stack that can be
1432  when PCRE has been compiled to use memory on the heap instead of the stack, the  used, or, when PCRE has been compiled to use memory on the heap instead of the
1433  amount of heap memory that can be used.  stack, the amount of heap memory that can be used. This limit is relevant, and
1434    is ignored, when the pattern was successfully studied with
1435    PCRE_STUDY_JIT_COMPILE.
1436  .P  .P
1437  The default value for \fImatch_limit_recursion\fP can be set when PCRE is  The default value for \fImatch_limit_recursion\fP can be set when PCRE is
1438  built; the default default is the same value as the default for  built; the default default is the same value as the default for
# Line 1885  in the subject string. Some simple patte Line 1979  in the subject string. Some simple patte
1979  faulted at compile time, but more complicated cases, in particular mutual  faulted at compile time, but more complicated cases, in particular mutual
1980  recursions between two different subpatterns, cannot be detected until run  recursions between two different subpatterns, cannot be detected until run
1981  time.  time.
1982    .sp
1983      PCRE_ERROR_JIT_STACKLIMIT (-27)
1984    .sp
1985    This error is returned when a pattern that was successfully studied using the
1986    PCRE_STUDY_JIT_COMPILE option is matched, but the memory available for the
1987    just-in-time processing stack is not large enough. See the
1988    .\" HREF
1989    \fBpcrejit\fP
1990    .\"
1991    documentation for more details.
1992  .P  .P
1993  Error numbers -16 to -20 and -22 are not used by \fBpcre_exec()\fP.  Error numbers -16 to -20 and -22 are not used by \fBpcre_exec()\fP.
1994  .  .
# Line 2354  group. These are not supported. Line 2458  group. These are not supported.
2458    PCRE_ERROR_DFA_UMLIMIT    (-18)    PCRE_ERROR_DFA_UMLIMIT    (-18)
2459  .sp  .sp
2460  This return is given if \fBpcre_dfa_exec()\fP is called with an \fIextra\fP  This return is given if \fBpcre_dfa_exec()\fP is called with an \fIextra\fP
2461  block that contains a setting of the \fImatch_limit\fP field. This is not  block that contains a setting of the \fImatch_limit\fP or
2462  supported (it is meaningless).  \fImatch_limit_recursion\fP fields. This is not supported (these fields are
2463    meaningless for DFA matching).
2464  .sp  .sp
2465    PCRE_ERROR_DFA_WSSIZE     (-19)    PCRE_ERROR_DFA_WSSIZE     (-19)
2466  .sp  .sp
# Line 2392  Cambridge CB2 3QH, England. Line 2497  Cambridge CB2 3QH, England.
2497  .rs  .rs
2498  .sp  .sp
2499  .nf  .nf
2500  Last updated: 13 August 2011  Last updated: 27 August 2011
2501  Copyright (c) 1997-2011 University of Cambridge.  Copyright (c) 1997-2011 University of Cambridge.
2502  .fi  .fi

Legend:
Removed from v.659  
changed lines
  Added in v.678

  ViewVC Help
Powered by ViewVC 1.1.5