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

Contents of /code/trunk/pcreposix.c

Parent Directory Parent Directory | Revision Log Revision Log


Revision 77 - (hide annotations) (download)
Sat Feb 24 21:40:45 2007 UTC (7 years, 7 months ago) by nigel
File MIME type: text/plain
File size: 10356 byte(s)
Load pcre-6.0 into code/trunk.

1 nigel 3 /*************************************************
2     * Perl-Compatible Regular Expressions *
3     *************************************************/
4    
5 nigel 77 /* PCRE is a library of functions to support regular expressions whose syntax
6     and semantics are as close as possible to those of the Perl 5 language.
7 nigel 3
8 nigel 77 Written by Philip Hazel
9     Copyright (c) 1997-2005 University of Cambridge
10 nigel 3
11     -----------------------------------------------------------------------------
12 nigel 75 Redistribution and use in source and binary forms, with or without
13     modification, are permitted provided that the following conditions are met:
14 nigel 3
15 nigel 75 * Redistributions of source code must retain the above copyright notice,
16     this list of conditions and the following disclaimer.
17 nigel 3
18 nigel 75 * Redistributions in binary form must reproduce the above copyright
19     notice, this list of conditions and the following disclaimer in the
20     documentation and/or other materials provided with the distribution.
21 nigel 3
22 nigel 75 * Neither the name of the University of Cambridge nor the names of its
23     contributors may be used to endorse or promote products derived from
24     this software without specific prior written permission.
25 nigel 29
26 nigel 75 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
27     AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28     IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29     ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
30     LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
31     CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
32     SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
33     INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
34     CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
35     ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
36     POSSIBILITY OF SUCH DAMAGE.
37 nigel 3 -----------------------------------------------------------------------------
38     */
39    
40 nigel 77
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 nigel 3 #include "pcreposix.h"
47     #include "stdlib.h"
48    
49    
50    
51 nigel 77 /* Table to translate PCRE compile time error codes into POSIX error codes. */
52 nigel 3
53 nigel 73 static const int eint[] = {
54 nigel 77 0, /* no error */
55     REG_EESCAPE, /* \ at end of pattern */
56     REG_EESCAPE, /* \c at end of pattern */
57     REG_EESCAPE, /* unrecognized character follows \ */
58     REG_BADBR, /* numbers out of order in {} quantifier */
59     REG_BADBR, /* number too big in {} quantifier */
60     REG_EBRACK, /* missing terminating ] for character class */
61     REG_ECTYPE, /* invalid escape sequence in character class */
62     REG_ERANGE, /* range out of order in character class */
63     REG_BADRPT, /* nothing to repeat */
64     REG_BADRPT, /* operand of unlimited repeat could match the empty string */
65     REG_ASSERT, /* internal error: unexpected repeat */
66     REG_BADPAT, /* unrecognized character after (? */
67     REG_BADPAT, /* POSIX named classes are supported only within a class */
68     REG_EPAREN, /* missing ) */
69     REG_ESUBREG, /* reference to non-existent subpattern */
70     REG_INVARG, /* erroffset passed as NULL */
71     REG_INVARG, /* unknown option bit(s) set */
72     REG_EPAREN, /* missing ) after comment */
73     REG_ESIZE, /* parentheses nested too deeply */
74     REG_ESIZE, /* regular expression too large */
75     REG_ESPACE, /* failed to get memory */
76     REG_EPAREN, /* unmatched brackets */
77     REG_ASSERT, /* internal error: code overflow */
78     REG_BADPAT, /* unrecognized character after (?< */
79     REG_BADPAT, /* lookbehind assertion is not fixed length */
80     REG_BADPAT, /* malformed number after (?( */
81     REG_BADPAT, /* conditional group containe more than two branches */
82     REG_BADPAT, /* assertion expected after (?( */
83     REG_BADPAT, /* (?R or (?digits must be followed by ) */
84     REG_ECTYPE, /* unknown POSIX class name */
85     REG_BADPAT, /* POSIX collating elements are not supported */
86     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 groups 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 nigel 3 };
103    
104     /* Table of texts corresponding to POSIX error codes */
105    
106 nigel 73 static const char *const pstring[] = {
107 nigel 3 "", /* Dummy for value 0 */
108     "internal error", /* REG_ASSERT */
109     "invalid repeat counts in {}", /* BADBR */
110     "pattern error", /* BADPAT */
111     "? * + invalid", /* BADRPT */
112     "unbalanced {}", /* EBRACE */
113     "unbalanced []", /* EBRACK */
114     "collation error - not relevant", /* ECOLLATE */
115     "bad class", /* ECTYPE */
116     "bad escape sequence", /* EESCAPE */
117     "empty expression", /* EMPTY */
118     "unbalanced ()", /* EPAREN */
119     "bad range inside []", /* ERANGE */
120     "expression too big", /* ESIZE */
121     "failed to get memory", /* ESPACE */
122     "bad back reference", /* ESUBREG */
123     "bad argument", /* INVARG */
124     "match failed" /* NOMATCH */
125     };
126    
127    
128    
129    
130     /*************************************************
131     * Translate error code to string *
132     *************************************************/
133    
134 nigel 73 EXPORT size_t
135 nigel 3 regerror(int errcode, const regex_t *preg, char *errbuf, size_t errbuf_size)
136     {
137 nigel 7 const char *message, *addmessage;
138     size_t length, addlength;
139 nigel 3
140 nigel 7 message = (errcode >= (int)(sizeof(pstring)/sizeof(char *)))?
141 nigel 3 "unknown error code" : pstring[errcode];
142 nigel 7 length = strlen(message) + 1;
143 nigel 3
144 nigel 7 addmessage = " at offset ";
145     addlength = (preg != NULL && (int)preg->re_erroffset != -1)?
146     strlen(addmessage) + 6 : 0;
147 nigel 3
148     if (errbuf_size > 0)
149     {
150 nigel 7 if (addlength > 0 && errbuf_size >= length + addlength)
151 nigel 23 sprintf(errbuf, "%s%s%-6d", message, addmessage, (int)preg->re_erroffset);
152 nigel 3 else
153     {
154     strncpy(errbuf, message, errbuf_size - 1);
155     errbuf[errbuf_size-1] = 0;
156     }
157     }
158    
159 nigel 7 return length + addlength;
160 nigel 3 }
161    
162    
163    
164    
165     /*************************************************
166     * Free store held by a regex *
167     *************************************************/
168    
169 nigel 73 EXPORT void
170 nigel 3 regfree(regex_t *preg)
171     {
172     (pcre_free)(preg->re_pcre);
173     }
174    
175    
176    
177    
178     /*************************************************
179     * Compile a regular expression *
180     *************************************************/
181    
182     /*
183     Arguments:
184     preg points to a structure for recording the compiled expression
185     pattern the pattern to compile
186     cflags compilation flags
187    
188     Returns: 0 on success
189     various non-zero codes on failure
190     */
191    
192 nigel 73 EXPORT int
193 nigel 3 regcomp(regex_t *preg, const char *pattern, int cflags)
194     {
195 nigel 7 const char *errorptr;
196 nigel 3 int erroffset;
197 nigel 77 int errorcode;
198 nigel 3 int options = 0;
199    
200     if ((cflags & REG_ICASE) != 0) options |= PCRE_CASELESS;
201     if ((cflags & REG_NEWLINE) != 0) options |= PCRE_MULTILINE;
202 nigel 77 if ((cflags & REG_DOTALL) != 0) options |= PCRE_DOTALL;
203 nigel 3
204 nigel 77 preg->re_pcre = pcre_compile2(pattern, options, &errorcode, &errorptr,
205     &erroffset, NULL);
206 nigel 3 preg->re_erroffset = erroffset;
207    
208 nigel 77 if (preg->re_pcre == NULL) return eint[errorcode];
209 nigel 3
210 nigel 71 preg->re_nsub = pcre_info((const pcre *)preg->re_pcre, NULL, NULL);
211 nigel 3 return 0;
212     }
213    
214    
215    
216    
217     /*************************************************
218     * Match a regular expression *
219     *************************************************/
220    
221 nigel 41 /* Unfortunately, PCRE requires 3 ints of working space for each captured
222     substring, so we have to get and release working store instead of just using
223     the POSIX structures as was done in earlier releases when PCRE needed only 2
224 nigel 63 ints. However, if the number of possible capturing brackets is small, use a
225     block of store on the stack, to reduce the use of malloc/free. The threshold is
226     in a macro that can be changed at configure time. */
227 nigel 41
228 nigel 73 EXPORT int
229 nigel 69 regexec(const regex_t *preg, const char *string, size_t nmatch,
230 nigel 3 regmatch_t pmatch[], int eflags)
231     {
232     int rc;
233     int options = 0;
234 nigel 41 int *ovector = NULL;
235 nigel 63 int small_ovector[POSIX_MALLOC_THRESHOLD * 3];
236     BOOL allocated_ovector = FALSE;
237 nigel 3
238     if ((eflags & REG_NOTBOL) != 0) options |= PCRE_NOTBOL;
239     if ((eflags & REG_NOTEOL) != 0) options |= PCRE_NOTEOL;
240    
241 nigel 69 ((regex_t *)preg)->re_erroffset = (size_t)(-1); /* Only has meaning after compile */
242 nigel 3
243 nigel 41 if (nmatch > 0)
244     {
245 nigel 63 if (nmatch <= POSIX_MALLOC_THRESHOLD)
246     {
247     ovector = &(small_ovector[0]);
248     }
249     else
250     {
251     ovector = (int *)malloc(sizeof(int) * nmatch * 3);
252     if (ovector == NULL) return REG_ESPACE;
253     allocated_ovector = TRUE;
254     }
255 nigel 41 }
256    
257 nigel 71 rc = pcre_exec((const pcre *)preg->re_pcre, NULL, string, (int)strlen(string),
258     0, options, ovector, nmatch * 3);
259 nigel 3
260 nigel 41 if (rc == 0) rc = nmatch; /* All captured slots were filled in */
261 nigel 3
262 nigel 41 if (rc >= 0)
263 nigel 3 {
264 nigel 7 size_t i;
265 nigel 63 for (i = 0; i < (size_t)rc; i++)
266 nigel 41 {
267     pmatch[i].rm_so = ovector[i*2];
268     pmatch[i].rm_eo = ovector[i*2+1];
269     }
270 nigel 63 if (allocated_ovector) free(ovector);
271 nigel 41 for (; i < nmatch; i++) pmatch[i].rm_so = pmatch[i].rm_eo = -1;
272 nigel 3 return 0;
273     }
274    
275 nigel 41 else
276 nigel 3 {
277 nigel 63 if (allocated_ovector) free(ovector);
278 nigel 41 switch(rc)
279     {
280     case PCRE_ERROR_NOMATCH: return REG_NOMATCH;
281     case PCRE_ERROR_NULL: return REG_INVARG;
282     case PCRE_ERROR_BADOPTION: return REG_INVARG;
283     case PCRE_ERROR_BADMAGIC: return REG_INVARG;
284     case PCRE_ERROR_UNKNOWN_NODE: return REG_ASSERT;
285     case PCRE_ERROR_NOMEMORY: return REG_ESPACE;
286 nigel 73 case PCRE_ERROR_MATCHLIMIT: return REG_ESPACE;
287     case PCRE_ERROR_BADUTF8: return REG_INVARG;
288     case PCRE_ERROR_BADUTF8_OFFSET: return REG_INVARG;
289 nigel 41 default: return REG_ASSERT;
290     }
291 nigel 3 }
292     }
293    
294     /* End of pcreposix.c */

webmaster@exim.org
ViewVC Help
Powered by ViewVC 1.1.12