source: EcnlProtoTool/trunk/onigmo-5.15.0/src/regposix.c@ 279

Last change on this file since 279 was 279, checked in by coas-nagasima, 7 years ago

ファイルを追加、更新。

  • Property svn:eol-style set to native
  • Property svn:keywords set to Id
  • Property svn:mime-type set to text/x-csrc
File size: 10.7 KB
Line 
1/**********************************************************************
2 regposix.c - Onigmo (Oniguruma-mod) (regular expression library)
3**********************************************************************/
4/*-
5 * Copyright (c) 2002-2008 K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
6 * Copyright (c) 2011 K.Takata <kentkt AT csc DOT jp>
7 * All rights reserved.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
11 * are met:
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
17 *
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
22 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
28 * SUCH DAMAGE.
29 */
30
31#define regex_t onig_regex_t
32#include "regint.h"
33#undef regex_t
34#include "onigposix.h"
35
36#define ONIG_C(reg) ((onig_regex_t* )((reg)->onig))
37#define PONIG_C(reg) ((onig_regex_t** )(&(reg)->onig))
38
39/* #define ENC_STRING_LEN(enc,s,len) len = strlen(s) */
40#define ENC_STRING_LEN(enc,s,len) do { \
41 if (ONIGENC_MBC_MINLEN(enc) == 1) { \
42 UChar* tmps = (UChar* )(s); \
43 while (*tmps != 0) tmps++; \
44 len = (int )(tmps - (UChar* )(s)); \
45 } \
46 else { \
47 len = onigenc_str_bytelen_null(enc, (UChar* )s); \
48 } \
49} while(0)
50
51typedef struct {
52 int onig_err;
53 int posix_err;
54} O2PERR;
55
56static int
57onig2posix_error_code(int code)
58{
59 static const O2PERR o2p[] = {
60 { ONIG_MISMATCH, REG_NOMATCH },
61 { ONIG_NO_SUPPORT_CONFIG, REG_EONIG_INTERNAL },
62 { ONIGERR_MEMORY, REG_ESPACE },
63 { ONIGERR_MATCH_STACK_LIMIT_OVER, REG_EONIG_INTERNAL },
64 { ONIGERR_TYPE_BUG, REG_EONIG_INTERNAL },
65 { ONIGERR_PARSER_BUG, REG_EONIG_INTERNAL },
66 { ONIGERR_STACK_BUG, REG_EONIG_INTERNAL },
67 { ONIGERR_UNDEFINED_BYTECODE, REG_EONIG_INTERNAL },
68 { ONIGERR_UNEXPECTED_BYTECODE, REG_EONIG_INTERNAL },
69 { ONIGERR_DEFAULT_ENCODING_IS_NOT_SET, REG_EONIG_BADARG },
70 { ONIGERR_SPECIFIED_ENCODING_CANT_CONVERT_TO_WIDE_CHAR, REG_EONIG_BADARG },
71 { ONIGERR_INVALID_ARGUMENT, REG_EONIG_BADARG },
72 { ONIGERR_END_PATTERN_AT_LEFT_BRACE, REG_EBRACE },
73 { ONIGERR_END_PATTERN_AT_LEFT_BRACKET, REG_EBRACK },
74 { ONIGERR_EMPTY_CHAR_CLASS, REG_ECTYPE },
75 { ONIGERR_PREMATURE_END_OF_CHAR_CLASS, REG_ECTYPE },
76 { ONIGERR_END_PATTERN_AT_ESCAPE, REG_EESCAPE },
77 { ONIGERR_END_PATTERN_AT_META, REG_EESCAPE },
78 { ONIGERR_END_PATTERN_AT_CONTROL, REG_EESCAPE },
79 { ONIGERR_META_CODE_SYNTAX, REG_BADPAT },
80 { ONIGERR_CONTROL_CODE_SYNTAX, REG_BADPAT },
81 { ONIGERR_CHAR_CLASS_VALUE_AT_END_OF_RANGE, REG_ECTYPE },
82 { ONIGERR_CHAR_CLASS_VALUE_AT_START_OF_RANGE, REG_ECTYPE },
83 { ONIGERR_UNMATCHED_RANGE_SPECIFIER_IN_CHAR_CLASS, REG_ECTYPE },
84 { ONIGERR_TARGET_OF_REPEAT_OPERATOR_NOT_SPECIFIED, REG_BADRPT },
85 { ONIGERR_TARGET_OF_REPEAT_OPERATOR_INVALID, REG_BADRPT },
86 { ONIGERR_NESTED_REPEAT_OPERATOR, REG_BADRPT },
87 { ONIGERR_UNMATCHED_CLOSE_PARENTHESIS, REG_EPAREN },
88 { ONIGERR_END_PATTERN_WITH_UNMATCHED_PARENTHESIS, REG_EPAREN },
89 { ONIGERR_END_PATTERN_IN_GROUP, REG_BADPAT },
90 { ONIGERR_UNDEFINED_GROUP_OPTION, REG_BADPAT },
91 { ONIGERR_INVALID_POSIX_BRACKET_TYPE, REG_BADPAT },
92 { ONIGERR_INVALID_LOOK_BEHIND_PATTERN, REG_BADPAT },
93 { ONIGERR_INVALID_REPEAT_RANGE_PATTERN, REG_BADPAT },
94 { ONIGERR_TOO_BIG_NUMBER, REG_BADPAT },
95 { ONIGERR_TOO_BIG_NUMBER_FOR_REPEAT_RANGE, REG_BADBR },
96 { ONIGERR_UPPER_SMALLER_THAN_LOWER_IN_REPEAT_RANGE, REG_BADBR },
97 { ONIGERR_EMPTY_RANGE_IN_CHAR_CLASS, REG_ECTYPE },
98 { ONIGERR_MISMATCH_CODE_LENGTH_IN_CLASS_RANGE, REG_ECTYPE },
99 { ONIGERR_TOO_MANY_MULTI_BYTE_RANGES, REG_ECTYPE },
100 { ONIGERR_TOO_SHORT_MULTI_BYTE_STRING, REG_BADPAT },
101 { ONIGERR_TOO_BIG_BACKREF_NUMBER, REG_ESUBREG },
102 { ONIGERR_INVALID_BACKREF, REG_ESUBREG },
103 { ONIGERR_NUMBERED_BACKREF_OR_CALL_NOT_ALLOWED, REG_BADPAT },
104 { ONIGERR_TOO_BIG_WIDE_CHAR_VALUE, REG_EONIG_BADWC },
105 { ONIGERR_TOO_LONG_WIDE_CHAR_VALUE, REG_EONIG_BADWC },
106 { ONIGERR_INVALID_CODE_POINT_VALUE, REG_EONIG_BADWC },
107 { ONIGERR_EMPTY_GROUP_NAME, REG_BADPAT },
108 { ONIGERR_INVALID_GROUP_NAME, REG_BADPAT },
109 { ONIGERR_INVALID_CHAR_IN_GROUP_NAME, REG_BADPAT },
110 { ONIGERR_UNDEFINED_NAME_REFERENCE, REG_BADPAT },
111 { ONIGERR_UNDEFINED_GROUP_REFERENCE, REG_BADPAT },
112 { ONIGERR_MULTIPLEX_DEFINED_NAME, REG_BADPAT },
113 { ONIGERR_MULTIPLEX_DEFINITION_NAME_CALL, REG_BADPAT },
114 { ONIGERR_NEVER_ENDING_RECURSION, REG_BADPAT },
115 { ONIGERR_GROUP_NUMBER_OVER_FOR_CAPTURE_HISTORY, REG_BADPAT },
116 { ONIGERR_INVALID_CHAR_PROPERTY_NAME, REG_BADPAT },
117 { ONIGERR_NOT_SUPPORTED_ENCODING_COMBINATION, REG_EONIG_BADARG },
118 { ONIGERR_OVER_THREAD_PASS_LIMIT_COUNT, REG_EONIG_THREAD }
119
120 };
121
122 int i;
123
124 if (code >= 0) return 0;
125
126 for (i = 0; i < numberof(o2p); i++) {
127 if (code == o2p[i].onig_err)
128 return o2p[i].posix_err;
129 }
130
131 return REG_EONIG_INTERNAL; /* but, unknown error code */
132}
133
134extern int
135regcomp(regex_t* reg, const char* pattern, int posix_options)
136{
137 int r, len;
138 OnigSyntaxType* syntax = OnigDefaultSyntax;
139 OnigOptionType options;
140
141 if ((posix_options & REG_EXTENDED) == 0)
142 syntax = ONIG_SYNTAX_POSIX_BASIC;
143
144 options = syntax->options;
145 if ((posix_options & REG_ICASE) != 0)
146 ONIG_OPTION_ON(options, ONIG_OPTION_IGNORECASE);
147 if ((posix_options & REG_NEWLINE) != 0) {
148 ONIG_OPTION_ON( options, ONIG_OPTION_NEGATE_SINGLELINE);
149 ONIG_OPTION_OFF(options, ONIG_OPTION_SINGLELINE);
150 }
151
152 reg->comp_options = posix_options;
153
154 ENC_STRING_LEN(OnigEncDefaultCharEncoding, pattern, len);
155 r = onig_new(PONIG_C(reg), (UChar* )pattern, (UChar* )(pattern + len),
156 options, OnigEncDefaultCharEncoding, syntax,
157 (OnigErrorInfo* )NULL);
158 if (r != ONIG_NORMAL) {
159 return onig2posix_error_code(r);
160 }
161
162 reg->re_nsub = ONIG_C(reg)->num_mem;
163 return 0;
164}
165
166extern int
167regexec(regex_t* reg, const char* str, size_t nmatch,
168 regmatch_t pmatch[], int posix_options)
169{
170 int r, i, len;
171 UChar* end;
172 regmatch_t* pm;
173 OnigOptionType options;
174
175 options = ONIG_OPTION_POSIX_REGION;
176 if ((posix_options & REG_NOTBOL) != 0) options |= ONIG_OPTION_NOTBOL;
177 if ((posix_options & REG_NOTEOL) != 0) options |= ONIG_OPTION_NOTEOL;
178
179 if (nmatch == 0 || (reg->comp_options & REG_NOSUB) != 0) {
180 pm = (regmatch_t* )NULL;
181 nmatch = 0;
182 }
183 else if ((int )nmatch < ONIG_C(reg)->num_mem + 1) {
184 pm = (regmatch_t* )xmalloc(sizeof(regmatch_t)
185 * (ONIG_C(reg)->num_mem + 1));
186 if (pm == NULL)
187 return REG_ESPACE;
188 }
189 else {
190 pm = pmatch;
191 }
192
193 ENC_STRING_LEN(ONIG_C(reg)->enc, str, len);
194 end = (UChar* )(str + len);
195 r = (int )onig_search(ONIG_C(reg), (UChar* )str, end, (UChar* )str, end,
196 (OnigRegion* )pm, options);
197
198 if (r >= 0) {
199 r = 0; /* Match */
200 if (pm != pmatch && pm != NULL) {
201 xmemcpy(pmatch, pm, sizeof(regmatch_t) * nmatch);
202 }
203 }
204 else if (r == ONIG_MISMATCH) {
205 r = REG_NOMATCH;
206 for (i = 0; i < (int )nmatch; i++)
207 pmatch[i].rm_so = pmatch[i].rm_eo = ONIG_REGION_NOTPOS;
208 }
209 else {
210 r = onig2posix_error_code(r);
211 }
212
213 if (pm != pmatch && pm != NULL)
214 xfree(pm);
215
216#if 0
217 if (reg->re_nsub > nmatch - 1)
218 reg->re_nsub = (nmatch <= 1 ? 0 : nmatch - 1);
219#endif
220
221 return r;
222}
223
224extern void
225regfree(regex_t* reg)
226{
227 onig_free(ONIG_C(reg));
228}
229
230
231extern void
232reg_set_encoding(int mb_code)
233{
234 OnigEncoding enc;
235
236 switch (mb_code) {
237 case REG_POSIX_ENCODING_ASCII:
238 enc = ONIG_ENCODING_ASCII;
239 break;
240#if 0
241 case REG_POSIX_ENCODING_EUC_JP:
242 enc = ONIG_ENCODING_EUC_JP;
243 break;
244 case REG_POSIX_ENCODING_SJIS:
245 enc = ONIG_ENCODING_SJIS;
246 break;
247#endif
248 case REG_POSIX_ENCODING_UTF8:
249 enc = ONIG_ENCODING_UTF8;
250 break;
251#if 0
252 case REG_POSIX_ENCODING_UTF16_BE:
253 enc = ONIG_ENCODING_UTF16_BE;
254 break;
255 case REG_POSIX_ENCODING_UTF16_LE:
256 enc = ONIG_ENCODING_UTF16_LE;
257 break;
258#endif
259 default:
260 return ;
261 break;
262 }
263
264 onigenc_set_default_encoding(enc);
265}
266
267extern int
268reg_name_to_group_numbers(regex_t* reg,
269 const unsigned char* name, const unsigned char* name_end, int** nums)
270{
271 return onig_name_to_group_numbers(ONIG_C(reg), name, name_end, nums);
272}
273
274typedef struct {
275 int (*func)(const unsigned char*, const unsigned char*,int,int*,regex_t*,void*);
276 regex_t* reg;
277 void* arg;
278} i_wrap;
279
280static int
281i_wrapper(const UChar* name, const UChar* name_end, int ng, int* gs,
282 onig_regex_t* reg ARG_UNUSED, void* arg)
283{
284 i_wrap* warg = (i_wrap* )arg;
285
286 return (*warg->func)(name, name_end, ng, gs, warg->reg, warg->arg);
287}
288
289extern int
290reg_foreach_name(regex_t* reg,
291 int (*func)(const unsigned char*, const unsigned char*,int,int*,regex_t*,void*),
292 void* arg)
293{
294 i_wrap warg;
295
296 warg.func = func;
297 warg.reg = reg;
298 warg.arg = arg;
299
300 return onig_foreach_name(ONIG_C(reg), i_wrapper, &warg);
301}
302
303extern int
304reg_number_of_names(regex_t* reg)
305{
306 return onig_number_of_names(ONIG_C(reg));
307}
Note: See TracBrowser for help on using the repository browser.