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

Contents of /code/trunk/pcreposix.c

Parent Directory Parent Directory | Revision Log Revision Log


Revision 166 - (show annotations) (download)
Wed May 9 14:48:28 2007 UTC (7 years, 4 months ago) by ph10
File MIME type: text/plain
File size: 11887 byte(s)
Add (?-n) and (?+n) relative references.

1 /*************************************************
2 * Perl-Compatible Regular Expressions *
3 *************************************************/
4
5 /* 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
8 Written by Philip Hazel
9 Copyright (c) 1997-2007 University of Cambridge
10
11 -----------------------------------------------------------------------------
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 * 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 notice, this list of conditions and the following disclaimer in the
20 documentation and/or other materials provided with the distribution.
21
22 * 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
26 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 -----------------------------------------------------------------------------
38 */
39
40
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"
47 #include "stdlib.h"
48
49
50
51 /* Table to translate PCRE compile time error codes into POSIX error codes. */
52
53 static const int eint[] = {
54 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 or name after (?( */
81 REG_BADPAT, /* conditional group contains 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 in subpattern name (missing terminator) */
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 REG_BADPAT, /* internal error: overran compiling workspace */
107 REG_BADPAT, /* internal error: previously-checked referenced subpattern not found */
108 REG_BADPAT, /* DEFINE group contains more than one branch */
109 REG_BADPAT, /* repeating a DEFINE group is not allowed */
110 REG_INVARG, /* inconsistent NEWLINE options */
111 REG_BADPAT, /* \g is not followed followed by an (optionally braced) non-zero number */
112 REG_BADPAT /* (?+ or (?- must be followed by a non-zero number */
113 };
114
115 /* Table of texts corresponding to POSIX error codes */
116
117 static const char *const pstring[] = {
118 "", /* Dummy for value 0 */
119 "internal error", /* REG_ASSERT */
120 "invalid repeat counts in {}", /* BADBR */
121 "pattern error", /* BADPAT */
122 "? * + invalid", /* BADRPT */
123 "unbalanced {}", /* EBRACE */
124 "unbalanced []", /* EBRACK */
125 "collation error - not relevant", /* ECOLLATE */
126 "bad class", /* ECTYPE */
127 "bad escape sequence", /* EESCAPE */
128 "empty expression", /* EMPTY */
129 "unbalanced ()", /* EPAREN */
130 "bad range inside []", /* ERANGE */
131 "expression too big", /* ESIZE */
132 "failed to get memory", /* ESPACE */
133 "bad back reference", /* ESUBREG */
134 "bad argument", /* INVARG */
135 "match failed" /* NOMATCH */
136 };
137
138
139
140
141 /*************************************************
142 * Translate error code to string *
143 *************************************************/
144
145 PCREPOSIX_EXP_DEFN size_t
146 regerror(int errcode, const regex_t *preg, char *errbuf, size_t errbuf_size)
147 {
148 const char *message, *addmessage;
149 size_t length, addlength;
150
151 message = (errcode >= (int)(sizeof(pstring)/sizeof(char *)))?
152 "unknown error code" : pstring[errcode];
153 length = strlen(message) + 1;
154
155 addmessage = " at offset ";
156 addlength = (preg != NULL && (int)preg->re_erroffset != -1)?
157 strlen(addmessage) + 6 : 0;
158
159 if (errbuf_size > 0)
160 {
161 if (addlength > 0 && errbuf_size >= length + addlength)
162 sprintf(errbuf, "%s%s%-6d", message, addmessage, (int)preg->re_erroffset);
163 else
164 {
165 strncpy(errbuf, message, errbuf_size - 1);
166 errbuf[errbuf_size-1] = 0;
167 }
168 }
169
170 return length + addlength;
171 }
172
173
174
175
176 /*************************************************
177 * Free store held by a regex *
178 *************************************************/
179
180 PCREPOSIX_EXP_DEFN void
181 regfree(regex_t *preg)
182 {
183 (pcre_free)(preg->re_pcre);
184 }
185
186
187
188
189 /*************************************************
190 * Compile a regular expression *
191 *************************************************/
192
193 /*
194 Arguments:
195 preg points to a structure for recording the compiled expression
196 pattern the pattern to compile
197 cflags compilation flags
198
199 Returns: 0 on success
200 various non-zero codes on failure
201 */
202
203 PCREPOSIX_EXP_DEFN int
204 regcomp(regex_t *preg, const char *pattern, int cflags)
205 {
206 const char *errorptr;
207 int erroffset;
208 int errorcode;
209 int options = 0;
210
211 if ((cflags & REG_ICASE) != 0) options |= PCRE_CASELESS;
212 if ((cflags & REG_NEWLINE) != 0) options |= PCRE_MULTILINE;
213 if ((cflags & REG_DOTALL) != 0) options |= PCRE_DOTALL;
214 if ((cflags & REG_NOSUB) != 0) options |= PCRE_NO_AUTO_CAPTURE;
215 if ((cflags & REG_UTF8) != 0) options |= PCRE_UTF8;
216
217 preg->re_pcre = pcre_compile2(pattern, options, &errorcode, &errorptr,
218 &erroffset, NULL);
219 preg->re_erroffset = erroffset;
220
221 if (preg->re_pcre == NULL) return eint[errorcode];
222
223 preg->re_nsub = pcre_info((const pcre *)preg->re_pcre, NULL, NULL);
224 return 0;
225 }
226
227
228
229
230 /*************************************************
231 * Match a regular expression *
232 *************************************************/
233
234 /* Unfortunately, PCRE requires 3 ints of working space for each captured
235 substring, so we have to get and release working store instead of just using
236 the POSIX structures as was done in earlier releases when PCRE needed only 2
237 ints. However, if the number of possible capturing brackets is small, use a
238 block of store on the stack, to reduce the use of malloc/free. The threshold is
239 in a macro that can be changed at configure time.
240
241 If REG_NOSUB was specified at compile time, the PCRE_NO_AUTO_CAPTURE flag will
242 be set. When this is the case, the nmatch and pmatch arguments are ignored, and
243 the only result is yes/no/error. */
244
245 PCREPOSIX_EXP_DEFN int
246 regexec(const regex_t *preg, const char *string, size_t nmatch,
247 regmatch_t pmatch[], int eflags)
248 {
249 int rc;
250 int options = 0;
251 int *ovector = NULL;
252 int small_ovector[POSIX_MALLOC_THRESHOLD * 3];
253 BOOL allocated_ovector = FALSE;
254 BOOL nosub =
255 (((const pcre *)preg->re_pcre)->options & PCRE_NO_AUTO_CAPTURE) != 0;
256
257 if ((eflags & REG_NOTBOL) != 0) options |= PCRE_NOTBOL;
258 if ((eflags & REG_NOTEOL) != 0) options |= PCRE_NOTEOL;
259
260 ((regex_t *)preg)->re_erroffset = (size_t)(-1); /* Only has meaning after compile */
261
262 /* When no string data is being returned, ensure that nmatch is zero.
263 Otherwise, ensure the vector for holding the return data is large enough. */
264
265 if (nosub) nmatch = 0;
266
267 else if (nmatch > 0)
268 {
269 if (nmatch <= POSIX_MALLOC_THRESHOLD)
270 {
271 ovector = &(small_ovector[0]);
272 }
273 else
274 {
275 if (nmatch > INT_MAX/(sizeof(int) * 3)) return REG_ESPACE;
276 ovector = (int *)malloc(sizeof(int) * nmatch * 3);
277 if (ovector == NULL) return REG_ESPACE;
278 allocated_ovector = TRUE;
279 }
280 }
281
282 rc = pcre_exec((const pcre *)preg->re_pcre, NULL, string, (int)strlen(string),
283 0, options, ovector, nmatch * 3);
284
285 if (rc == 0) rc = nmatch; /* All captured slots were filled in */
286
287 if (rc >= 0)
288 {
289 size_t i;
290 if (!nosub)
291 {
292 for (i = 0; i < (size_t)rc; i++)
293 {
294 pmatch[i].rm_so = ovector[i*2];
295 pmatch[i].rm_eo = ovector[i*2+1];
296 }
297 if (allocated_ovector) free(ovector);
298 for (; i < nmatch; i++) pmatch[i].rm_so = pmatch[i].rm_eo = -1;
299 }
300 return 0;
301 }
302
303 else
304 {
305 if (allocated_ovector) free(ovector);
306 switch(rc)
307 {
308 case PCRE_ERROR_NOMATCH: return REG_NOMATCH;
309 case PCRE_ERROR_NULL: return REG_INVARG;
310 case PCRE_ERROR_BADOPTION: return REG_INVARG;
311 case PCRE_ERROR_BADMAGIC: return REG_INVARG;
312 case PCRE_ERROR_UNKNOWN_NODE: return REG_ASSERT;
313 case PCRE_ERROR_NOMEMORY: return REG_ESPACE;
314 case PCRE_ERROR_MATCHLIMIT: return REG_ESPACE;
315 case PCRE_ERROR_BADUTF8: return REG_INVARG;
316 case PCRE_ERROR_BADUTF8_OFFSET: return REG_INVARG;
317 default: return REG_ASSERT;
318 }
319 }
320 }
321
322 /* End of pcreposix.c */

Properties

Name Value
svn:eol-style native
svn:keywords "Author Date Id Revision Url"

webmaster@exim.org
ViewVC Help
Powered by ViewVC 1.1.12