/[pcre]/code/trunk/pcreposix.c
ViewVC logotype

Diff of /code/trunk/pcreposix.c

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

revision 41 by nigel, Sat Feb 24 21:39:17 2007 UTC revision 91 by nigel, Sat Feb 24 21:41:34 2007 UTC
# Line 2  Line 2 
2  *      Perl-Compatible Regular Expressions       *  *      Perl-Compatible Regular Expressions       *
3  *************************************************/  *************************************************/
4    
5  /*  /* PCRE is a library of functions to support regular expressions whose syntax
6  This is a library of functions to support regular expressions whose syntax  and semantics are as close as possible to those of the Perl 5 language.
 and semantics are as close as possible to those of the Perl 5 language. See  
 the file Tech.Notes for some information on the internals.  
7    
8  This module is a wrapper that provides a POSIX API to the underlying PCRE                         Written by Philip Hazel
9  functions.             Copyright (c) 1997-2006 University of Cambridge
10    
11  Written by: Philip Hazel <ph10@cam.ac.uk>  -----------------------------------------------------------------------------
12    Redistribution and use in source and binary forms, with or without
13    modification, are permitted provided that the following conditions are met:
14    
15             Copyright (c) 1997-1999 University of Cambridge      * Redistributions of source code must retain the above copyright notice,
16          this list of conditions and the following disclaimer.
17    
18  -----------------------------------------------------------------------------      * Redistributions in binary form must reproduce the above copyright
19  Permission is granted to anyone to use this software for any purpose on any        notice, this list of conditions and the following disclaimer in the
20  computer system, and to redistribute it freely, subject to the following        documentation and/or other materials provided with the distribution.
21  restrictions:  
22        * Neither the name of the University of Cambridge nor the names of its
23  1. This software is distributed in the hope that it will be useful,        contributors may be used to endorse or promote products derived from
24     but WITHOUT ANY WARRANTY; without even the implied warranty of        this software without specific prior written permission.
25     MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  
26    THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
27  2. The origin of this software must not be misrepresented, either by  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28     explicit claim or by omission.  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29    ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
30  3. Altered versions must be plainly marked as such, and must not be  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31     misrepresented as being the original software.  CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32    SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33  4. If PCRE is embedded in any software that is released under the GNU  INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34     General Purpose Licence (GPL), then the terms of that licence shall  CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35     supersede any condition above with which it is incompatible.  ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36    POSSIBILITY OF SUCH DAMAGE.
37  -----------------------------------------------------------------------------  -----------------------------------------------------------------------------
38  */  */
39    
40  #include "internal.h"  
41    /* This module is a wrapper that provides a POSIX API to the underlying PCRE
42    functions. */
43    
44    
45    #include "pcre_internal.h"
46  #include "pcreposix.h"  #include "pcreposix.h"
47  #include "stdlib.h"  #include "stdlib.h"
48    
49    
50    
51  /* Corresponding tables of PCRE error messages and POSIX error codes. */  /* Table to translate PCRE compile time error codes into POSIX error codes. */
52    
53  static const char *estring[] = {  static const int eint[] = {
54    ERR1,  ERR2,  ERR3,  ERR4,  ERR5,  ERR6,  ERR7,  ERR8,  ERR9,  ERR10,    0,           /* no error */
55    ERR11, ERR12, ERR13, ERR14, ERR15, ERR16, ERR17, ERR18, ERR19, ERR20,    REG_EESCAPE, /* \ at end of pattern */
56    ERR21, ERR22, ERR23, ERR24, ERR25 };    REG_EESCAPE, /* \c at end of pattern */
57      REG_EESCAPE, /* unrecognized character follows \ */
58  static int eint[] = {    REG_BADBR,   /* numbers out of order in {} quantifier */
59    REG_EESCAPE, /* "\\ at end of pattern" */    REG_BADBR,   /* number too big in {} quantifier */
60    REG_EESCAPE, /* "\\c at end of pattern" */    REG_EBRACK,  /* missing terminating ] for character class */
61    REG_EESCAPE, /* "unrecognized character follows \\" */    REG_ECTYPE,  /* invalid escape sequence in character class */
62    REG_BADBR,   /* "numbers out of order in {} quantifier" */    REG_ERANGE,  /* range out of order in character class */
63    REG_BADBR,   /* "number too big in {} quantifier" */    REG_BADRPT,  /* nothing to repeat */
64    REG_EBRACK,  /* "missing terminating ] for character class" */    REG_BADRPT,  /* operand of unlimited repeat could match the empty string */
65    REG_ECTYPE,  /* "invalid escape sequence in character class" */    REG_ASSERT,  /* internal error: unexpected repeat */
66    REG_ERANGE,  /* "range out of order in character class" */    REG_BADPAT,  /* unrecognized character after (? */
67    REG_BADRPT,  /* "nothing to repeat" */    REG_BADPAT,  /* POSIX named classes are supported only within a class */
68    REG_BADRPT,  /* "operand of unlimited repeat could match the empty string" */    REG_EPAREN,  /* missing ) */
69    REG_ASSERT,  /* "internal error: unexpected repeat" */    REG_ESUBREG, /* reference to non-existent subpattern */
70    REG_BADPAT,  /* "unrecognized character after (?" */    REG_INVARG,  /* erroffset passed as NULL */
71    REG_ESIZE,   /* "too many capturing parenthesized sub-patterns" */    REG_INVARG,  /* unknown option bit(s) set */
72    REG_EPAREN,  /* "missing )" */    REG_EPAREN,  /* missing ) after comment */
73    REG_ESUBREG, /* "back reference to non-existent subpattern" */    REG_ESIZE,   /* parentheses nested too deeply */
74    REG_INVARG,  /* "erroffset passed as NULL" */    REG_ESIZE,   /* regular expression too large */
75    REG_INVARG,  /* "unknown option bit(s) set" */    REG_ESPACE,  /* failed to get memory */
76    REG_EPAREN,  /* "missing ) after comment" */    REG_EPAREN,  /* unmatched brackets */
77    REG_ESIZE,   /* "too many sets of parentheses" */    REG_ASSERT,  /* internal error: code overflow */
78    REG_ESIZE,   /* "regular expression too large" */    REG_BADPAT,  /* unrecognized character after (?< */
79    REG_ESPACE,  /* "failed to get memory" */    REG_BADPAT,  /* lookbehind assertion is not fixed length */
80    REG_EPAREN,  /* "unmatched brackets" */    REG_BADPAT,  /* malformed number or name after (?( */
81    REG_ASSERT,  /* "internal error: code overflow" */    REG_BADPAT,  /* conditional group containe more than two branches */
82    REG_BADPAT,  /* "unrecognized character after (?<" */    REG_BADPAT,  /* assertion expected after (?( */
83    REG_BADPAT,  /* "lookbehind assertion is not fixed length" */    REG_BADPAT,  /* (?R or (?digits must be followed by ) */
84    REG_BADPAT,  /* "malformed number after (?(" */    REG_ECTYPE,  /* unknown POSIX class name */
85    REG_BADPAT,  /* "conditional group containe more than two branches" */    REG_BADPAT,  /* POSIX collating elements are not supported */
86    REG_BADPAT   /* "assertion expected after (?(" */    REG_INVARG,  /* this version of PCRE is not compiled with PCRE_UTF8 support */
87      REG_BADPAT,  /* spare error */
88      REG_BADPAT,  /* character value in \x{...} sequence is too large */
89      REG_BADPAT,  /* invalid condition (?(0) */
90      REG_BADPAT,  /* \C not allowed in lookbehind assertion */
91      REG_EESCAPE, /* PCRE does not support \L, \l, \N, \U, or \u */
92      REG_BADPAT,  /* number after (?C is > 255 */
93      REG_BADPAT,  /* closing ) for (?C expected */
94      REG_BADPAT,  /* recursive call could loop indefinitely */
95      REG_BADPAT,  /* unrecognized character after (?P */
96      REG_BADPAT,  /* syntax error after (?P */
97      REG_BADPAT,  /* two named subpatterns have the same name */
98      REG_BADPAT,  /* invalid UTF-8 string */
99      REG_BADPAT,  /* support for \P, \p, and \X has not been compiled */
100      REG_BADPAT,  /* malformed \P or \p sequence */
101      REG_BADPAT,  /* unknown property name after \P or \p */
102      REG_BADPAT,  /* subpattern name is too long (maximum 32 characters) */
103      REG_BADPAT,  /* too many named subpatterns (maximum 10,000) */
104      REG_BADPAT,  /* repeated subpattern is too long */
105      REG_BADPAT   /* octal value is greater than \377 (not in UTF-8 mode) */
106  };  };
107    
108  /* Table of texts corresponding to POSIX error codes */  /* Table of texts corresponding to POSIX error codes */
109    
110  static const char *pstring[] = {  static const char *const pstring[] = {
111    "",                                /* Dummy for value 0 */    "",                                /* Dummy for value 0 */
112    "internal error",                  /* REG_ASSERT */    "internal error",                  /* REG_ASSERT */
113    "invalid repeat counts in {}",     /* BADBR      */    "invalid repeat counts in {}",     /* BADBR      */
# Line 106  static const char *pstring[] = { Line 132  static const char *pstring[] = {
132    
133    
134  /*************************************************  /*************************************************
 *          Translate PCRE text code to int       *  
 *************************************************/  
   
 /* PCRE compile-time errors are given as strings defined as macros. We can just  
 look them up in a table to turn them into POSIX-style error codes. */  
   
 static int  
 pcre_posix_error_code(const char *s)  
 {  
 size_t i;  
 for (i = 0; i < sizeof(estring)/sizeof(char *); i++)  
   if (strcmp(s, estring[i]) == 0) return eint[i];  
 return REG_ASSERT;  
 }  
   
   
   
 /*************************************************  
135  *          Translate error code to string        *  *          Translate error code to string        *
136  *************************************************/  *************************************************/
137    
138  size_t  PCRE_DATA_SCOPE size_t
139  regerror(int errcode, const regex_t *preg, char *errbuf, size_t errbuf_size)  regerror(int errcode, const regex_t *preg, char *errbuf, size_t errbuf_size)
140  {  {
141  const char *message, *addmessage;  const char *message, *addmessage;
# Line 162  return length + addlength; Line 170  return length + addlength;
170  *           Free store held by a regex           *  *           Free store held by a regex           *
171  *************************************************/  *************************************************/
172    
173  void  PCRE_DATA_SCOPE void
174  regfree(regex_t *preg)  regfree(regex_t *preg)
175  {  {
176  (pcre_free)(preg->re_pcre);  (pcre_free)(preg->re_pcre);
# Line 185  Returns:      0 on success Line 193  Returns:      0 on success
193                various non-zero codes on failure                various non-zero codes on failure
194  */  */
195    
196  int  PCRE_DATA_SCOPE int
197  regcomp(regex_t *preg, const char *pattern, int cflags)  regcomp(regex_t *preg, const char *pattern, int cflags)
198  {  {
199  const char *errorptr;  const char *errorptr;
200  int erroffset;  int erroffset;
201    int errorcode;
202  int options = 0;  int options = 0;
203    
204  if ((cflags & REG_ICASE) != 0) options |= PCRE_CASELESS;  if ((cflags & REG_ICASE) != 0)   options |= PCRE_CASELESS;
205  if ((cflags & REG_NEWLINE) != 0) options |= PCRE_MULTILINE;  if ((cflags & REG_NEWLINE) != 0) options |= PCRE_MULTILINE;
206    if ((cflags & REG_DOTALL) != 0)  options |= PCRE_DOTALL;
207    if ((cflags & REG_NOSUB) != 0)   options |= PCRE_NO_AUTO_CAPTURE;
208    if ((cflags & REG_UTF8) != 0)    options |= PCRE_UTF8;
209    
210  preg->re_pcre = pcre_compile(pattern, options, &errorptr, &erroffset, NULL);  preg->re_pcre = pcre_compile2(pattern, options, &errorcode, &errorptr,
211      &erroffset, NULL);
212  preg->re_erroffset = erroffset;  preg->re_erroffset = erroffset;
213    
214  if (preg->re_pcre == NULL) return pcre_posix_error_code(errorptr);  if (preg->re_pcre == NULL) return eint[errorcode];
215    
216  preg->re_nsub = pcre_info(preg->re_pcre, NULL, NULL);  preg->re_nsub = pcre_info((const pcre *)preg->re_pcre, NULL, NULL);
217  return 0;  return 0;
218  }  }
219    
# Line 214  return 0; Line 227  return 0;
227  /* Unfortunately, PCRE requires 3 ints of working space for each captured  /* Unfortunately, PCRE requires 3 ints of working space for each captured
228  substring, so we have to get and release working store instead of just using  substring, so we have to get and release working store instead of just using
229  the POSIX structures as was done in earlier releases when PCRE needed only 2  the POSIX structures as was done in earlier releases when PCRE needed only 2
230  ints. */  ints. However, if the number of possible capturing brackets is small, use a
231    block of store on the stack, to reduce the use of malloc/free. The threshold is
232    in a macro that can be changed at configure time.
233    
234    If REG_NOSUB was specified at compile time, the PCRE_NO_AUTO_CAPTURE flag will
235    be set. When this is the case, the nmatch and pmatch arguments are ignored, and
236    the only result is yes/no/error. */
237    
238  int  PCRE_DATA_SCOPE int
239  regexec(regex_t *preg, const char *string, size_t nmatch,  regexec(const regex_t *preg, const char *string, size_t nmatch,
240    regmatch_t pmatch[], int eflags)    regmatch_t pmatch[], int eflags)
241  {  {
242  int rc;  int rc;
243  int options = 0;  int options = 0;
244  int *ovector = NULL;  int *ovector = NULL;
245    int small_ovector[POSIX_MALLOC_THRESHOLD * 3];
246    BOOL allocated_ovector = FALSE;
247    BOOL nosub =
248      (((const pcre *)preg->re_pcre)->options & PCRE_NO_AUTO_CAPTURE) != 0;
249    
250  if ((eflags & REG_NOTBOL) != 0) options |= PCRE_NOTBOL;  if ((eflags & REG_NOTBOL) != 0) options |= PCRE_NOTBOL;
251  if ((eflags & REG_NOTEOL) != 0) options |= PCRE_NOTEOL;  if ((eflags & REG_NOTEOL) != 0) options |= PCRE_NOTEOL;
252    
253  preg->re_erroffset = (size_t)(-1);   /* Only has meaning after compile */  ((regex_t *)preg)->re_erroffset = (size_t)(-1);  /* Only has meaning after compile */
254    
255    /* When no string data is being returned, ensure that nmatch is zero.
256    Otherwise, ensure the vector for holding the return data is large enough. */
257    
258    if (nosub) nmatch = 0;
259    
260  if (nmatch > 0)  else if (nmatch > 0)
261    {    {
262    ovector = malloc(sizeof(int) * nmatch * 3);    if (nmatch <= POSIX_MALLOC_THRESHOLD)
263    if (ovector == NULL) return REG_ESPACE;      {
264        ovector = &(small_ovector[0]);
265        }
266      else
267        {
268        if (nmatch > INT_MAX/(sizeof(int) * 3)) return REG_ESPACE;
269        ovector = (int *)malloc(sizeof(int) * nmatch * 3);
270        if (ovector == NULL) return REG_ESPACE;
271        allocated_ovector = TRUE;
272        }
273    }    }
274    
275  rc = pcre_exec(preg->re_pcre, NULL, string, (int)strlen(string), 0, options,  rc = pcre_exec((const pcre *)preg->re_pcre, NULL, string, (int)strlen(string),
276    ovector, nmatch * 3);    0, options, ovector, nmatch * 3);
277    
278  if (rc == 0) rc = nmatch;    /* All captured slots were filled in */  if (rc == 0) rc = nmatch;    /* All captured slots were filled in */
279    
280  if (rc >= 0)  if (rc >= 0)
281    {    {
282    size_t i;    size_t i;
283    for (i = 0; i < rc; i++)    if (!nosub)
284      {      {
285      pmatch[i].rm_so = ovector[i*2];      for (i = 0; i < (size_t)rc; i++)
286      pmatch[i].rm_eo = ovector[i*2+1];        {
287          pmatch[i].rm_so = ovector[i*2];
288          pmatch[i].rm_eo = ovector[i*2+1];
289          }
290        if (allocated_ovector) free(ovector);
291        for (; i < nmatch; i++) pmatch[i].rm_so = pmatch[i].rm_eo = -1;
292      }      }
   if (ovector != NULL) free(ovector);  
   for (; i < nmatch; i++) pmatch[i].rm_so = pmatch[i].rm_eo = -1;  
293    return 0;    return 0;
294    }    }
295    
296  else  else
297    {    {
298    if (ovector != NULL) free(ovector);    if (allocated_ovector) free(ovector);
299    switch(rc)    switch(rc)
300      {      {
301      case PCRE_ERROR_NOMATCH: return REG_NOMATCH;      case PCRE_ERROR_NOMATCH: return REG_NOMATCH;
# Line 264  else Line 304  else
304      case PCRE_ERROR_BADMAGIC: return REG_INVARG;      case PCRE_ERROR_BADMAGIC: return REG_INVARG;
305      case PCRE_ERROR_UNKNOWN_NODE: return REG_ASSERT;      case PCRE_ERROR_UNKNOWN_NODE: return REG_ASSERT;
306      case PCRE_ERROR_NOMEMORY: return REG_ESPACE;      case PCRE_ERROR_NOMEMORY: return REG_ESPACE;
307        case PCRE_ERROR_MATCHLIMIT: return REG_ESPACE;
308        case PCRE_ERROR_BADUTF8: return REG_INVARG;
309        case PCRE_ERROR_BADUTF8_OFFSET: return REG_INVARG;
310      default: return REG_ASSERT;      default: return REG_ASSERT;
311      }      }
312    }    }

Legend:
Removed from v.41  
changed lines
  Added in v.91

  ViewVC Help
Powered by ViewVC 1.1.5