1 /**********************************************************************
2 sjis.c - Oniguruma (regular expression library)
3 **********************************************************************/
4 /*-
5 * Copyright (c) 2002-2020 K.Kosako
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 }
119 else if (code < 0x10000) {
120 if (EncLen_SJIS[(int )(code >> 8) & 0xff] == 2)
121 return 2;
122 }
123
124 return ONIGERR_INVALID_CODE_POINT_VALUE;
125 }
126
127 static OnigCodePoint
mbc_to_code(const UChar * p,const UChar * end)128 mbc_to_code(const UChar* p, const UChar* end)
129 {
130 int c, i, len;
131 OnigCodePoint n;
132
133 len = enclen(ONIG_ENCODING_SJIS, p);
134 c = *p++;
135 n = c;
136 if (len == 1) return n;
137
138 for (i = 1; i < len; i++) {
139 if (p >= end) break;
140 c = *p++;
141 n <<= 8; n += c;
142 }
143 return n;
144 }
145
146 static int
code_to_mbc(OnigCodePoint code,UChar * buf)147 code_to_mbc(OnigCodePoint code, UChar *buf)
148 {
149 UChar *p = buf;
150
151 if ((code & 0xff00) != 0) *p++ = (UChar )(((code >> 8) & 0xff));
152 *p++ = (UChar )(code & 0xff);
153
154 return (int )(p - buf);
155 }
156
157 static int
mbc_case_fold(OnigCaseFoldType flag ARG_UNUSED,const UChar ** pp,const UChar * end ARG_UNUSED,UChar * lower)158 mbc_case_fold(OnigCaseFoldType flag ARG_UNUSED,
159 const UChar** pp, const UChar* end ARG_UNUSED, UChar* lower)
160 {
161 const UChar* p = *pp;
162
163 if (ONIGENC_IS_MBC_ASCII(p)) {
164 *lower = ONIGENC_ASCII_CODE_TO_LOWER_CASE(*p);
165 (*pp)++;
166 return 1;
167 }
168 else {
169 int i;
170 int len = enclen(ONIG_ENCODING_SJIS, p);
171
172 for (i = 0; i < len; i++) {
173 *lower++ = *p++;
174 }
175 (*pp) += len;
176 return len; /* return byte length of converted char to lower */
177 }
178 }
179
180 static UChar*
left_adjust_char_head(const UChar * start,const UChar * s)181 left_adjust_char_head(const UChar* start, const UChar* s)
182 {
183 const UChar *p;
184 int len;
185
186 if (s <= start) return (UChar* )s;
187 p = s;
188
189 if (SJIS_ISMB_TRAIL(*p)) {
190 while (p > start) {
191 if (! SJIS_ISMB_FIRST(*--p)) {
192 p++;
193 break;
194 }
195 }
196 }
197 len = enclen(ONIG_ENCODING_SJIS, p);
198 if (p + len > s) return (UChar* )p;
199 p += len;
200 return (UChar* )(p + ((s - p) & ~1));
201 }
202
203 static int
is_allowed_reverse_match(const UChar * s,const UChar * end ARG_UNUSED)204 is_allowed_reverse_match(const UChar* s, const UChar* end ARG_UNUSED)
205 {
206 const UChar c = *s;
207 return (SJIS_ISMB_TRAIL(c) ? FALSE : TRUE);
208 }
209
210
211 static const OnigCodePoint CR_Hiragana[] = {
212 1,
213 0x829f, 0x82f1
214 }; /* CR_Hiragana */
215
216 static const OnigCodePoint CR_Katakana[] = {
217 4,
218 0x00a6, 0x00af,
219 0x00b1, 0x00dd,
220 0x8340, 0x837e,
221 0x8380, 0x8396,
222 }; /* CR_Katakana */
223
224 static const OnigCodePoint* PropertyList[] = {
225 CR_Hiragana,
226 CR_Katakana
227 };
228
229
230 static int
property_name_to_ctype(OnigEncoding enc,UChar * p,UChar * end)231 property_name_to_ctype(OnigEncoding enc, UChar* p, UChar* end)
232 {
233 struct PropertyNameCtype* pc;
234 int len = (int )(end - p);
235 char q[32];
236
237 if (len < sizeof(q) - 1) {
238 xmemcpy(q, p, (size_t )len);
239 q[len] = '\0';
240 pc = onigenc_sjis_lookup_property_name(q, len);
241 if (pc != 0)
242 return pc->ctype;
243 }
244
245 return ONIGERR_INVALID_CHAR_PROPERTY_NAME;
246 }
247
248 static int
is_code_ctype(OnigCodePoint code,unsigned int ctype)249 is_code_ctype(OnigCodePoint code, unsigned int ctype)
250 {
251 if (ctype <= ONIGENC_MAX_STD_CTYPE) {
252 if (code < 128)
253 return ONIGENC_IS_ASCII_CODE_CTYPE(code, ctype);
254 else {
255 if (CTYPE_IS_WORD_GRAPH_PRINT(ctype)) {
256 return (code_to_mbclen(code) > 1 ? TRUE : FALSE);
257 }
258 }
259 }
260 else {
261 ctype -= (ONIGENC_MAX_STD_CTYPE + 1);
262 if (ctype >= (unsigned int )(sizeof(PropertyList)/sizeof(PropertyList[0])))
263 return ONIGERR_TYPE_BUG;
264
265 return onig_is_in_code_range((UChar* )PropertyList[ctype], code);
266 }
267
268 return FALSE;
269 }
270
271 static int
get_ctype_code_range(OnigCtype ctype,OnigCodePoint * sb_out,const OnigCodePoint * ranges[])272 get_ctype_code_range(OnigCtype ctype, OnigCodePoint* sb_out,
273 const OnigCodePoint* ranges[])
274 {
275 if (ctype <= ONIGENC_MAX_STD_CTYPE) {
276 return ONIG_NO_SUPPORT_CONFIG;
277 }
278 else {
279 *sb_out = 0x80;
280
281 ctype -= (ONIGENC_MAX_STD_CTYPE + 1);
282 if (ctype >= (OnigCtype )(sizeof(PropertyList)/sizeof(PropertyList[0])))
283 return ONIGERR_TYPE_BUG;
284
285 *ranges = PropertyList[ctype];
286 return 0;
287 }
288 }
289
290 OnigEncodingType OnigEncodingSJIS = {
291 mbc_enc_len,
292 "Shift_JIS", /* name */
293 2, /* max enc length */
294 1, /* min enc length */
295 onigenc_is_mbc_newline_0x0a,
296 mbc_to_code,
297 code_to_mbclen,
298 code_to_mbc,
299 mbc_case_fold,
300 onigenc_ascii_apply_all_case_fold,
301 onigenc_ascii_get_case_fold_codes_by_str,
302 property_name_to_ctype,
303 is_code_ctype,
304 get_ctype_code_range,
305 left_adjust_char_head,
306 is_allowed_reverse_match,
307 NULL, /* init */
308 NULL, /* is_initialized */
309 is_valid_mbc_string,
310 ENC_FLAG_ASCII_COMPATIBLE|ENC_FLAG_SKIP_OFFSET_1_OR_0,
311 0, 0
312 };
313