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. |
|
|
|
|
|
This module is a wrapper that provides a POSIX API to the underlying PCRE |
|
|
functions. |
|
|
|
|
|
Written by: Philip Hazel <ph10@cam.ac.uk> |
|
7 |
|
|
8 |
Copyright (c) 1997-1999 University of Cambridge |
Written by Philip Hazel |
9 |
|
Copyright (c) 1997-2009 University of Cambridge |
10 |
|
|
11 |
----------------------------------------------------------------------------- |
----------------------------------------------------------------------------- |
12 |
Permission is granted to anyone to use this software for any purpose on any |
Redistribution and use in source and binary forms, with or without |
13 |
computer system, and to redistribute it freely, subject to the following |
modification, are permitted provided that the following conditions are met: |
|
restrictions: |
|
|
|
|
|
1. This software is distributed in the hope that it will be useful, |
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of |
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. |
|
14 |
|
|
15 |
2. The origin of this software must not be misrepresented, either by |
* Redistributions of source code must retain the above copyright notice, |
16 |
explicit claim or by omission. |
this list of conditions and the following disclaimer. |
17 |
|
|
18 |
3. Altered versions must be plainly marked as such, and must not be |
* Redistributions in binary form must reproduce the above copyright |
19 |
misrepresented as being the original software. |
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 |
|
|
|
#include "internal.h" |
|
|
#include "pcreposix.h" |
|
|
#include "stdlib.h" |
|
40 |
|
|
41 |
|
/* This module is a wrapper that provides a POSIX API to the underlying PCRE |
42 |
|
functions. */ |
43 |
|
|
44 |
|
|
45 |
|
#ifdef HAVE_CONFIG_H |
46 |
|
#include "config.h" |
47 |
|
#endif |
48 |
|
|
49 |
|
|
50 |
|
/* Ensure that the PCREPOSIX_EXP_xxx macros are set appropriately for |
51 |
|
compiling these functions. This must come before including pcreposix.h, where |
52 |
|
they are set for an application (using these functions) if they have not |
53 |
|
previously been set. */ |
54 |
|
|
55 |
|
#if defined(_WIN32) && !defined(PCRE_STATIC) |
56 |
|
# define PCREPOSIX_EXP_DECL extern __declspec(dllexport) |
57 |
|
# define PCREPOSIX_EXP_DEFN __declspec(dllexport) |
58 |
|
#endif |
59 |
|
|
60 |
|
#include "pcre.h" |
61 |
|
#include "pcre_internal.h" |
62 |
|
#include "pcreposix.h" |
63 |
|
|
64 |
|
|
65 |
/* Corresponding tables of PCRE error messages and POSIX error codes. */ |
/* Table to translate PCRE compile time error codes into POSIX error codes. */ |
66 |
|
|
67 |
static const char *estring[] = { |
static const int eint[] = { |
68 |
ERR1, ERR2, ERR3, ERR4, ERR5, ERR6, ERR7, ERR8, ERR9, ERR10, |
0, /* no error */ |
69 |
ERR11, ERR12, ERR13, ERR14, ERR15, ERR16, ERR17, ERR18, ERR19, ERR20, |
REG_EESCAPE, /* \ at end of pattern */ |
70 |
ERR21, ERR22, ERR23, ERR24, ERR25 }; |
REG_EESCAPE, /* \c at end of pattern */ |
71 |
|
REG_EESCAPE, /* unrecognized character follows \ */ |
72 |
static int eint[] = { |
REG_BADBR, /* numbers out of order in {} quantifier */ |
73 |
REG_EESCAPE, /* "\\ at end of pattern" */ |
/* 5 */ |
74 |
REG_EESCAPE, /* "\\c at end of pattern" */ |
REG_BADBR, /* number too big in {} quantifier */ |
75 |
REG_EESCAPE, /* "unrecognized character follows \\" */ |
REG_EBRACK, /* missing terminating ] for character class */ |
76 |
REG_BADBR, /* "numbers out of order in {} quantifier" */ |
REG_ECTYPE, /* invalid escape sequence in character class */ |
77 |
REG_BADBR, /* "number too big in {} quantifier" */ |
REG_ERANGE, /* range out of order in character class */ |
78 |
REG_EBRACK, /* "missing terminating ] for character class" */ |
REG_BADRPT, /* nothing to repeat */ |
79 |
REG_ECTYPE, /* "invalid escape sequence in character class" */ |
/* 10 */ |
80 |
REG_ERANGE, /* "range out of order in character class" */ |
REG_BADRPT, /* operand of unlimited repeat could match the empty string */ |
81 |
REG_BADRPT, /* "nothing to repeat" */ |
REG_ASSERT, /* internal error: unexpected repeat */ |
82 |
REG_BADRPT, /* "operand of unlimited repeat could match the empty string" */ |
REG_BADPAT, /* unrecognized character after (? */ |
83 |
REG_ASSERT, /* "internal error: unexpected repeat" */ |
REG_BADPAT, /* POSIX named classes are supported only within a class */ |
84 |
REG_BADPAT, /* "unrecognized character after (?" */ |
REG_EPAREN, /* missing ) */ |
85 |
REG_ESIZE, /* "too many capturing parenthesized sub-patterns" */ |
/* 15 */ |
86 |
REG_EPAREN, /* "missing )" */ |
REG_ESUBREG, /* reference to non-existent subpattern */ |
87 |
REG_ESUBREG, /* "back reference to non-existent subpattern" */ |
REG_INVARG, /* erroffset passed as NULL */ |
88 |
REG_INVARG, /* "erroffset passed as NULL" */ |
REG_INVARG, /* unknown option bit(s) set */ |
89 |
REG_INVARG, /* "unknown option bit(s) set" */ |
REG_EPAREN, /* missing ) after comment */ |
90 |
REG_EPAREN, /* "missing ) after comment" */ |
REG_ESIZE, /* parentheses nested too deeply */ |
91 |
REG_ESIZE, /* "too many sets of parentheses" */ |
/* 20 */ |
92 |
REG_ESIZE, /* "regular expression too large" */ |
REG_ESIZE, /* regular expression too large */ |
93 |
REG_ESPACE, /* "failed to get memory" */ |
REG_ESPACE, /* failed to get memory */ |
94 |
REG_EPAREN, /* "unmatched brackets" */ |
REG_EPAREN, /* unmatched parentheses */ |
95 |
REG_ASSERT, /* "internal error: code overflow" */ |
REG_ASSERT, /* internal error: code overflow */ |
96 |
REG_BADPAT, /* "unrecognized character after (?<" */ |
REG_BADPAT, /* unrecognized character after (?< */ |
97 |
REG_BADPAT, /* "lookbehind assertion is not fixed length" */ |
/* 25 */ |
98 |
REG_BADPAT, /* "malformed number after (?(" */ |
REG_BADPAT, /* lookbehind assertion is not fixed length */ |
99 |
REG_BADPAT, /* "conditional group containe more than two branches" */ |
REG_BADPAT, /* malformed number or name after (?( */ |
100 |
REG_BADPAT /* "assertion expected after (?(" */ |
REG_BADPAT, /* conditional group contains more than two branches */ |
101 |
|
REG_BADPAT, /* assertion expected after (?( */ |
102 |
|
REG_BADPAT, /* (?R or (?[+-]digits must be followed by ) */ |
103 |
|
/* 30 */ |
104 |
|
REG_ECTYPE, /* unknown POSIX class name */ |
105 |
|
REG_BADPAT, /* POSIX collating elements are not supported */ |
106 |
|
REG_INVARG, /* this version of PCRE is not compiled with PCRE_UTF8 support */ |
107 |
|
REG_BADPAT, /* spare error */ |
108 |
|
REG_BADPAT, /* character value in \x{...} sequence is too large */ |
109 |
|
/* 35 */ |
110 |
|
REG_BADPAT, /* invalid condition (?(0) */ |
111 |
|
REG_BADPAT, /* \C not allowed in lookbehind assertion */ |
112 |
|
REG_EESCAPE, /* PCRE does not support \L, \l, \N, \U, or \u */ |
113 |
|
REG_BADPAT, /* number after (?C is > 255 */ |
114 |
|
REG_BADPAT, /* closing ) for (?C expected */ |
115 |
|
/* 40 */ |
116 |
|
REG_BADPAT, /* recursive call could loop indefinitely */ |
117 |
|
REG_BADPAT, /* unrecognized character after (?P */ |
118 |
|
REG_BADPAT, /* syntax error in subpattern name (missing terminator) */ |
119 |
|
REG_BADPAT, /* two named subpatterns have the same name */ |
120 |
|
REG_BADPAT, /* invalid UTF-8 string */ |
121 |
|
/* 45 */ |
122 |
|
REG_BADPAT, /* support for \P, \p, and \X has not been compiled */ |
123 |
|
REG_BADPAT, /* malformed \P or \p sequence */ |
124 |
|
REG_BADPAT, /* unknown property name after \P or \p */ |
125 |
|
REG_BADPAT, /* subpattern name is too long (maximum 32 characters) */ |
126 |
|
REG_BADPAT, /* too many named subpatterns (maximum 10,000) */ |
127 |
|
/* 50 */ |
128 |
|
REG_BADPAT, /* repeated subpattern is too long */ |
129 |
|
REG_BADPAT, /* octal value is greater than \377 (not in UTF-8 mode) */ |
130 |
|
REG_BADPAT, /* internal error: overran compiling workspace */ |
131 |
|
REG_BADPAT, /* internal error: previously-checked referenced subpattern not found */ |
132 |
|
REG_BADPAT, /* DEFINE group contains more than one branch */ |
133 |
|
/* 55 */ |
134 |
|
REG_BADPAT, /* repeating a DEFINE group is not allowed */ |
135 |
|
REG_INVARG, /* inconsistent NEWLINE options */ |
136 |
|
REG_BADPAT, /* \g is not followed followed by an (optionally braced) non-zero number */ |
137 |
|
REG_BADPAT, /* a numbered reference must not be zero */ |
138 |
|
REG_BADPAT, /* (*VERB) with an argument is not supported */ |
139 |
|
/* 60 */ |
140 |
|
REG_BADPAT, /* (*VERB) not recognized */ |
141 |
|
REG_BADPAT, /* number is too big */ |
142 |
|
REG_BADPAT, /* subpattern name expected */ |
143 |
|
REG_BADPAT, /* digit expected after (?+ */ |
144 |
|
REG_BADPAT, /* ] is an invalid data character in JavaScript compatibility mode */ |
145 |
|
/* 65 */ |
146 |
|
REG_BADPAT /* different names for subpatterns of the same number are not allowed */ |
147 |
}; |
}; |
148 |
|
|
149 |
/* Table of texts corresponding to POSIX error codes */ |
/* Table of texts corresponding to POSIX error codes */ |
150 |
|
|
151 |
static const char *pstring[] = { |
static const char *const pstring[] = { |
152 |
"", /* Dummy for value 0 */ |
"", /* Dummy for value 0 */ |
153 |
"internal error", /* REG_ASSERT */ |
"internal error", /* REG_ASSERT */ |
154 |
"invalid repeat counts in {}", /* BADBR */ |
"invalid repeat counts in {}", /* BADBR */ |
173 |
|
|
174 |
|
|
175 |
/************************************************* |
/************************************************* |
|
* 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; |
|
|
} |
|
|
|
|
|
|
|
|
|
|
|
/************************************************* |
|
176 |
* Translate error code to string * |
* Translate error code to string * |
177 |
*************************************************/ |
*************************************************/ |
178 |
|
|
179 |
size_t |
PCREPOSIX_EXP_DEFN size_t PCRE_CALL_CONVENTION |
180 |
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) |
181 |
{ |
{ |
182 |
const char *message, *addmessage; |
const char *message, *addmessage; |
211 |
* Free store held by a regex * |
* Free store held by a regex * |
212 |
*************************************************/ |
*************************************************/ |
213 |
|
|
214 |
void |
PCREPOSIX_EXP_DEFN void PCRE_CALL_CONVENTION |
215 |
regfree(regex_t *preg) |
regfree(regex_t *preg) |
216 |
{ |
{ |
217 |
(pcre_free)(preg->re_pcre); |
(pcre_free)(preg->re_pcre); |
234 |
various non-zero codes on failure |
various non-zero codes on failure |
235 |
*/ |
*/ |
236 |
|
|
237 |
int |
PCREPOSIX_EXP_DEFN int PCRE_CALL_CONVENTION |
238 |
regcomp(regex_t *preg, const char *pattern, int cflags) |
regcomp(regex_t *preg, const char *pattern, int cflags) |
239 |
{ |
{ |
240 |
const char *errorptr; |
const char *errorptr; |
241 |
int erroffset; |
int erroffset; |
242 |
|
int errorcode; |
243 |
int options = 0; |
int options = 0; |
244 |
|
|
245 |
if ((cflags & REG_ICASE) != 0) options |= PCRE_CASELESS; |
if ((cflags & REG_ICASE) != 0) options |= PCRE_CASELESS; |
246 |
if ((cflags & REG_NEWLINE) != 0) options |= PCRE_MULTILINE; |
if ((cflags & REG_NEWLINE) != 0) options |= PCRE_MULTILINE; |
247 |
|
if ((cflags & REG_DOTALL) != 0) options |= PCRE_DOTALL; |
248 |
|
if ((cflags & REG_NOSUB) != 0) options |= PCRE_NO_AUTO_CAPTURE; |
249 |
|
if ((cflags & REG_UTF8) != 0) options |= PCRE_UTF8; |
250 |
|
if ((cflags & REG_UNGREEDY) != 0) options |= PCRE_UNGREEDY; |
251 |
|
|
252 |
preg->re_pcre = pcre_compile(pattern, options, &errorptr, &erroffset, NULL); |
preg->re_pcre = pcre_compile2(pattern, options, &errorcode, &errorptr, |
253 |
|
&erroffset, NULL); |
254 |
preg->re_erroffset = erroffset; |
preg->re_erroffset = erroffset; |
255 |
|
|
256 |
if (preg->re_pcre == NULL) return pcre_posix_error_code(errorptr); |
/* Safety: if the error code is too big for the translation vector (which |
257 |
|
should not happen, but we all make mistakes), return REG_BADPAT. */ |
258 |
|
|
259 |
|
if (preg->re_pcre == NULL) |
260 |
|
{ |
261 |
|
return (errorcode < sizeof(eint)/sizeof(const int))? |
262 |
|
eint[errorcode] : REG_BADPAT; |
263 |
|
} |
264 |
|
|
265 |
preg->re_nsub = pcre_info(preg->re_pcre, NULL, NULL); |
preg->re_nsub = pcre_info((const pcre *)preg->re_pcre, NULL, NULL); |
266 |
return 0; |
return 0; |
267 |
} |
} |
268 |
|
|
273 |
* Match a regular expression * |
* Match a regular expression * |
274 |
*************************************************/ |
*************************************************/ |
275 |
|
|
276 |
int |
/* Unfortunately, PCRE requires 3 ints of working space for each captured |
277 |
regexec(regex_t *preg, const char *string, size_t nmatch, |
substring, so we have to get and release working store instead of just using |
278 |
|
the POSIX structures as was done in earlier releases when PCRE needed only 2 |
279 |
|
ints. However, if the number of possible capturing brackets is small, use a |
280 |
|
block of store on the stack, to reduce the use of malloc/free. The threshold is |
281 |
|
in a macro that can be changed at configure time. |
282 |
|
|
283 |
|
If REG_NOSUB was specified at compile time, the PCRE_NO_AUTO_CAPTURE flag will |
284 |
|
be set. When this is the case, the nmatch and pmatch arguments are ignored, and |
285 |
|
the only result is yes/no/error. */ |
286 |
|
|
287 |
|
PCREPOSIX_EXP_DEFN int PCRE_CALL_CONVENTION |
288 |
|
regexec(const regex_t *preg, const char *string, size_t nmatch, |
289 |
regmatch_t pmatch[], int eflags) |
regmatch_t pmatch[], int eflags) |
290 |
{ |
{ |
291 |
int rc; |
int rc, so, eo; |
292 |
int options = 0; |
int options = 0; |
293 |
|
int *ovector = NULL; |
294 |
|
int small_ovector[POSIX_MALLOC_THRESHOLD * 3]; |
295 |
|
BOOL allocated_ovector = FALSE; |
296 |
|
BOOL nosub = |
297 |
|
(((const pcre *)preg->re_pcre)->options & PCRE_NO_AUTO_CAPTURE) != 0; |
298 |
|
|
299 |
if ((eflags & REG_NOTBOL) != 0) options |= PCRE_NOTBOL; |
if ((eflags & REG_NOTBOL) != 0) options |= PCRE_NOTBOL; |
300 |
if ((eflags & REG_NOTEOL) != 0) options |= PCRE_NOTEOL; |
if ((eflags & REG_NOTEOL) != 0) options |= PCRE_NOTEOL; |
301 |
|
if ((eflags & REG_NOTEMPTY) != 0) options |= PCRE_NOTEMPTY; |
302 |
|
|
303 |
preg->re_erroffset = (size_t)(-1); /* Only has meaning after compile */ |
((regex_t *)preg)->re_erroffset = (size_t)(-1); /* Only has meaning after compile */ |
304 |
|
|
305 |
rc = pcre_exec(preg->re_pcre, NULL, string, (int)strlen(string), options, |
/* When no string data is being returned, or no vector has been passed in which |
306 |
(int *)pmatch, nmatch * 2); |
to put it, ensure that nmatch is zero. Otherwise, ensure the vector for holding |
307 |
|
the return data is large enough. */ |
308 |
|
|
309 |
if (rc == 0) return 0; /* All pmatch were filled in */ |
if (nosub || pmatch == NULL) nmatch = 0; |
310 |
|
|
311 |
if (rc > 0) |
else if (nmatch > 0) |
312 |
|
{ |
313 |
|
if (nmatch <= POSIX_MALLOC_THRESHOLD) |
314 |
|
{ |
315 |
|
ovector = &(small_ovector[0]); |
316 |
|
} |
317 |
|
else |
318 |
|
{ |
319 |
|
if (nmatch > INT_MAX/(sizeof(int) * 3)) return REG_ESPACE; |
320 |
|
ovector = (int *)malloc(sizeof(int) * nmatch * 3); |
321 |
|
if (ovector == NULL) return REG_ESPACE; |
322 |
|
allocated_ovector = TRUE; |
323 |
|
} |
324 |
|
} |
325 |
|
|
326 |
|
/* REG_STARTEND is a BSD extension, to allow for non-NUL-terminated strings. |
327 |
|
The man page from OS X says "REG_STARTEND affects only the location of the |
328 |
|
string, not how it is matched". That is why the "so" value is used to bump the |
329 |
|
start location rather than being passed as a PCRE "starting offset". */ |
330 |
|
|
331 |
|
if ((eflags & REG_STARTEND) != 0) |
332 |
|
{ |
333 |
|
so = pmatch[0].rm_so; |
334 |
|
eo = pmatch[0].rm_eo; |
335 |
|
} |
336 |
|
else |
337 |
|
{ |
338 |
|
so = 0; |
339 |
|
eo = strlen(string); |
340 |
|
} |
341 |
|
|
342 |
|
rc = pcre_exec((const pcre *)preg->re_pcre, NULL, string + so, (eo - so), |
343 |
|
0, options, ovector, nmatch * 3); |
344 |
|
|
345 |
|
if (rc == 0) rc = nmatch; /* All captured slots were filled in */ |
346 |
|
|
347 |
|
if (rc >= 0) |
348 |
{ |
{ |
349 |
size_t i; |
size_t i; |
350 |
for (i = rc; i < nmatch; i++) pmatch[i].rm_so = pmatch[i].rm_eo = -1; |
if (!nosub) |
351 |
|
{ |
352 |
|
for (i = 0; i < (size_t)rc; i++) |
353 |
|
{ |
354 |
|
pmatch[i].rm_so = ovector[i*2]; |
355 |
|
pmatch[i].rm_eo = ovector[i*2+1]; |
356 |
|
} |
357 |
|
if (allocated_ovector) free(ovector); |
358 |
|
for (; i < nmatch; i++) pmatch[i].rm_so = pmatch[i].rm_eo = -1; |
359 |
|
} |
360 |
return 0; |
return 0; |
361 |
} |
} |
362 |
|
|
363 |
else switch(rc) |
else |
364 |
{ |
{ |
365 |
case PCRE_ERROR_NOMATCH: return REG_NOMATCH; |
if (allocated_ovector) free(ovector); |
366 |
case PCRE_ERROR_NULL: return REG_INVARG; |
switch(rc) |
367 |
case PCRE_ERROR_BADOPTION: return REG_INVARG; |
{ |
368 |
case PCRE_ERROR_BADMAGIC: return REG_INVARG; |
case PCRE_ERROR_NOMATCH: return REG_NOMATCH; |
369 |
case PCRE_ERROR_UNKNOWN_NODE: return REG_ASSERT; |
case PCRE_ERROR_NULL: return REG_INVARG; |
370 |
case PCRE_ERROR_NOMEMORY: return REG_ESPACE; |
case PCRE_ERROR_BADOPTION: return REG_INVARG; |
371 |
default: return REG_ASSERT; |
case PCRE_ERROR_BADMAGIC: return REG_INVARG; |
372 |
|
case PCRE_ERROR_UNKNOWN_NODE: return REG_ASSERT; |
373 |
|
case PCRE_ERROR_NOMEMORY: return REG_ESPACE; |
374 |
|
case PCRE_ERROR_MATCHLIMIT: return REG_ESPACE; |
375 |
|
case PCRE_ERROR_BADUTF8: return REG_INVARG; |
376 |
|
case PCRE_ERROR_BADUTF8_OFFSET: return REG_INVARG; |
377 |
|
default: return REG_ASSERT; |
378 |
|
} |
379 |
} |
} |
380 |
} |
} |
381 |
|
|