1 /**********************************************************************
2 sjis.c - Oniguruma (regular expression library)
3 **********************************************************************/
4 /*-
5 * Copyright (c) 2002-2016 K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
6 * All rights reserved.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 *
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 * SUCH DAMAGE.
28 */
29
30 #include "regint.h"
31
32 static const int EncLen_SJIS[] = {
33 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
34 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
35 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
36 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
37 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
38 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
39 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
40 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
41 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
42 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
43 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
44 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
45 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
46 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
47 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
48 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1
49 };
50
51 static const char SJIS_CAN_BE_TRAIL_TABLE[256] = {
52 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
53 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
54 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
55 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
56 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
57 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
58 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
59 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
60 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
61 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
62 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
63 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
64 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
65 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
66 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
67 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0
68 };
69
70 #define SJIS_ISMB_FIRST(byte) (EncLen_SJIS[byte] > 1)
71 #define SJIS_ISMB_TRAIL(byte) SJIS_CAN_BE_TRAIL_TABLE[(byte)]
72
73 static int
mbc_enc_len(const UChar * p)74 mbc_enc_len(const UChar* p)
75 {
76 return EncLen_SJIS[*p];
77 }
78
79 static int
is_valid_mbc_string(const UChar * p,const UChar * end)80 is_valid_mbc_string(const UChar* p, const UChar* end)
81 {
82 while (p < end) {
83 if (*p < 0x80) {
84 p++;
85 }
86 else if (*p < 0xa1) {
87 if (*p == 0xa0 || *p == 0x80)
88 return FALSE;
89 p++;
90 if (p >= end) return FALSE;
91 if (*p < 0x40 || *p > 0xfc || *p == 0x7f)
92 return FALSE;
93 p++;
94 }
95 else if (*p < 0xe0) {
96 p++;
97 }
98 else if (*p < 0xfd) {
99 p++;
100 if (p >= end) return FALSE;
101 if (*p < 0x40 || *p > 0xfc || *p == 0x7f)
102 return FALSE;
103 p++;
104 }
105 else
106 return FALSE;
107 }
108
109 return TRUE;
110 }
111
112 static int
code_to_mbclen(OnigCodePoint code)113 code_to_mbclen(OnigCodePoint code)
114 {
115 if (code < 256) {
116 if (EncLen_SJIS[(int )code] == 1)
117 return 1;
118 else
119 return 0;
120 }
121 else if (code <= 0xffff) {
122 return 2;
123 }
124 else
125 return ONIGERR_INVALID_CODE_POINT_VALUE;
126 }
127
128 static OnigCodePoint
mbc_to_code(const UChar * p,const UChar * end)129 mbc_to_code(const UChar* p, const UChar* end)
130 {
131 int c, i, len;
132 OnigCodePoint n;
133
134 len = enclen(ONIG_ENCODING_SJIS, p);
135 c = *p++;
136 n = c;
137 if (len == 1) return n;
138
139 for (i = 1; i < len; i++) {
140 if (p >= end) break;
141 c = *p++;
142 n <<= 8; n += c;
143 }
144 return n;
145 }
146
147 static int
code_to_mbc(OnigCodePoint code,UChar * buf)148 code_to_mbc(OnigCodePoint code, UChar *buf)
149 {
150 UChar *p = buf;
151
152 if ((code & 0xff00) != 0) *p++ = (UChar )(((code >> 8) & 0xff));
153 *p++ = (UChar )(code & 0xff);
154
155 #if 0
156 if (enclen(ONIG_ENCODING_SJIS, buf) != (p - buf))
157 return REGERR_INVALID_CODE_POINT_VALUE;
158 #endif
159 return p - buf;
160 }
161
162 static int
mbc_case_fold(OnigCaseFoldType flag ARG_UNUSED,const UChar ** pp,const UChar * end ARG_UNUSED,UChar * lower)163 mbc_case_fold(OnigCaseFoldType flag ARG_UNUSED,
164 const UChar** pp, const UChar* end ARG_UNUSED, UChar* lower)
165 {
166 const UChar* p = *pp;
167
168 if (ONIGENC_IS_MBC_ASCII(p)) {
169 *lower = ONIGENC_ASCII_CODE_TO_LOWER_CASE(*p);
170 (*pp)++;
171 return 1;
172 }
173 else {
174 int i;
175 int len = enclen(ONIG_ENCODING_SJIS, p);
176
177 for (i = 0; i < len; i++) {
178 *lower++ = *p++;
179 }
180 (*pp) += len;
181 return len; /* return byte length of converted char to lower */
182 }
183 }
184
185 #if 0
186 static int
187 is_mbc_ambiguous(OnigCaseFoldType flag,
188 const UChar** pp, const UChar* end)
189 {
190 return onigenc_mbn_is_mbc_ambiguous(ONIG_ENCODING_SJIS, flag, pp, end);
191
192 }
193 #endif
194
195 #if 0
196 static int
197 is_code_ctype(OnigCodePoint code, unsigned int ctype)
198 {
199 if (code < 128)
200 return ONIGENC_IS_ASCII_CODE_CTYPE(code, ctype);
201 else {
202 if (CTYPE_IS_WORD_GRAPH_PRINT(ctype)) {
203 return (code_to_mbclen(code) > 1 ? TRUE : FALSE);
204 }
205 }
206
207 return FALSE;
208 }
209 #endif
210
211 static UChar*
left_adjust_char_head(const UChar * start,const UChar * s)212 left_adjust_char_head(const UChar* start, const UChar* s)
213 {
214 const UChar *p;
215 int len;
216
217 if (s <= start) return (UChar* )s;
218 p = s;
219
220 if (SJIS_ISMB_TRAIL(*p)) {
221 while (p > start) {
222 if (! SJIS_ISMB_FIRST(*--p)) {
223 p++;
224 break;
225 }
226 }
227 }
228 len = enclen(ONIG_ENCODING_SJIS, p);
229 if (p + len > s) return (UChar* )p;
230 p += len;
231 return (UChar* )(p + ((s - p) & ~1));
232 }
233
234 static int
is_allowed_reverse_match(const UChar * s,const UChar * end ARG_UNUSED)235 is_allowed_reverse_match(const UChar* s, const UChar* end ARG_UNUSED)
236 {
237 const UChar c = *s;
238 return (SJIS_ISMB_TRAIL(c) ? FALSE : TRUE);
239 }
240
241
242 static const OnigCodePoint CR_Hiragana[] = {
243 1,
244 0x829f, 0x82f1
245 }; /* CR_Hiragana */
246
247 static const OnigCodePoint CR_Katakana[] = {
248 4,
249 0x00a6, 0x00af,
250 0x00b1, 0x00dd,
251 0x8340, 0x837e,
252 0x8380, 0x8396,
253 }; /* CR_Katakana */
254
255 static const OnigCodePoint* PropertyList[] = {
256 CR_Hiragana,
257 CR_Katakana
258 };
259
260
261 static int
property_name_to_ctype(OnigEncoding enc,UChar * p,UChar * end)262 property_name_to_ctype(OnigEncoding enc, UChar* p, UChar* end)
263 {
264 struct PropertyNameCtype* pc;
265 int len = end - p;
266 char q[32];
267
268 if (len < sizeof(q) - 1) {
269 xmemcpy(q, p, (size_t )len);
270 q[len] = '\0';
271 pc = euc_jp_lookup_property_name(q, len);
272 if (pc != 0)
273 return pc->ctype;
274 }
275
276 return ONIGERR_INVALID_CHAR_PROPERTY_NAME;
277 }
278
279 static int
is_code_ctype(OnigCodePoint code,unsigned int ctype)280 is_code_ctype(OnigCodePoint code, unsigned int ctype)
281 {
282 if (ctype <= ONIGENC_MAX_STD_CTYPE) {
283 if (code < 128)
284 return ONIGENC_IS_ASCII_CODE_CTYPE(code, ctype);
285 else {
286 if (CTYPE_IS_WORD_GRAPH_PRINT(ctype)) {
287 return (code_to_mbclen(code) > 1 ? TRUE : FALSE);
288 }
289 }
290 }
291 else {
292 ctype -= (ONIGENC_MAX_STD_CTYPE + 1);
293 if (ctype >= (unsigned int )(sizeof(PropertyList)/sizeof(PropertyList[0])))
294 return ONIGERR_TYPE_BUG;
295
296 return onig_is_in_code_range((UChar* )PropertyList[ctype], code);
297 }
298
299 return FALSE;
300 }
301
302 static int
get_ctype_code_range(OnigCtype ctype,OnigCodePoint * sb_out,const OnigCodePoint * ranges[])303 get_ctype_code_range(OnigCtype ctype, OnigCodePoint* sb_out,
304 const OnigCodePoint* ranges[])
305 {
306 if (ctype <= ONIGENC_MAX_STD_CTYPE) {
307 return ONIG_NO_SUPPORT_CONFIG;
308 }
309 else {
310 *sb_out = 0x80;
311
312 ctype -= (ONIGENC_MAX_STD_CTYPE + 1);
313 if (ctype >= (OnigCtype )(sizeof(PropertyList)/sizeof(PropertyList[0])))
314 return ONIGERR_TYPE_BUG;
315
316 *ranges = PropertyList[ctype];
317 return 0;
318 }
319 }
320
321 OnigEncodingType OnigEncodingSJIS = {
322 mbc_enc_len,
323 "Shift_JIS", /* name */
324 2, /* max byte length */
325 1, /* min byte length */
326 onigenc_is_mbc_newline_0x0a,
327 mbc_to_code,
328 code_to_mbclen,
329 code_to_mbc,
330 mbc_case_fold,
331 onigenc_ascii_apply_all_case_fold,
332 onigenc_ascii_get_case_fold_codes_by_str,
333 property_name_to_ctype,
334 is_code_ctype,
335 get_ctype_code_range,
336 left_adjust_char_head,
337 is_allowed_reverse_match,
338 NULL, /* init */
339 NULL, /* is_initialized */
340 is_valid_mbc_string
341 };
342
