]> git.proxmox.com Git - mirror_edk2.git/blame - MdeModulePkg/Universal/RegularExpressionDxe/Oniguruma/unicode.c
MdeModulePkg/HiiDB: Reorganize codes of exporting HII settings
[mirror_edk2.git] / MdeModulePkg / Universal / RegularExpressionDxe / Oniguruma / unicode.c
CommitLineData
b602265d
DG
1/**********************************************************************\r
2 unicode.c - Oniguruma (regular expression library)\r
3**********************************************************************/\r
4/*-\r
5 * Copyright (c) 2002-2018 K.Kosako <sndgk393 AT ybb DOT ne DOT jp>\r
6 * All rights reserved.\r
7 *\r
8 * Redistribution and use in source and binary forms, with or without\r
9 * modification, are permitted provided that the following conditions\r
10 * are met:\r
11 * 1. Redistributions of source code must retain the above copyright\r
12 * notice, this list of conditions and the following disclaimer.\r
13 * 2. Redistributions in binary form must reproduce the above copyright\r
14 * notice, this list of conditions and the following disclaimer in the\r
15 * documentation and/or other materials provided with the distribution.\r
16 *\r
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND\r
18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE\r
19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE\r
20 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE\r
21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\r
22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS\r
23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)\r
24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT\r
25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY\r
26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF\r
27 * SUCH DAMAGE.\r
28 */\r
29\r
30#include "regint.h"\r
31\r
32struct PoolPropertyNameCtype {\r
33 short int name;\r
34 short int ctype;\r
35};\r
36\r
37#define ONIGENC_IS_UNICODE_ISO_8859_1_CTYPE(code,ctype) \\r
38 ((EncUNICODE_ISO_8859_1_CtypeTable[code] & CTYPE_TO_BIT(ctype)) != 0)\r
39\r
40static const unsigned short EncUNICODE_ISO_8859_1_CtypeTable[256] = {\r
41 0x4008, 0x4008, 0x4008, 0x4008, 0x4008, 0x4008, 0x4008, 0x4008,\r
42 0x4008, 0x428c, 0x4289, 0x4288, 0x4288, 0x4288, 0x4008, 0x4008,\r
43 0x4008, 0x4008, 0x4008, 0x4008, 0x4008, 0x4008, 0x4008, 0x4008,\r
44 0x4008, 0x4008, 0x4008, 0x4008, 0x4008, 0x4008, 0x4008, 0x4008,\r
45 0x4284, 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x41a0,\r
46 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x41a0,\r
47 0x78b0, 0x78b0, 0x78b0, 0x78b0, 0x78b0, 0x78b0, 0x78b0, 0x78b0,\r
48 0x78b0, 0x78b0, 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x41a0,\r
49 0x41a0, 0x7ca2, 0x7ca2, 0x7ca2, 0x7ca2, 0x7ca2, 0x7ca2, 0x74a2,\r
50 0x74a2, 0x74a2, 0x74a2, 0x74a2, 0x74a2, 0x74a2, 0x74a2, 0x74a2,\r
51 0x74a2, 0x74a2, 0x74a2, 0x74a2, 0x74a2, 0x74a2, 0x74a2, 0x74a2,\r
52 0x74a2, 0x74a2, 0x74a2, 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x51a0,\r
53 0x41a0, 0x78e2, 0x78e2, 0x78e2, 0x78e2, 0x78e2, 0x78e2, 0x70e2,\r
54 0x70e2, 0x70e2, 0x70e2, 0x70e2, 0x70e2, 0x70e2, 0x70e2, 0x70e2,\r
55 0x70e2, 0x70e2, 0x70e2, 0x70e2, 0x70e2, 0x70e2, 0x70e2, 0x70e2,\r
56 0x70e2, 0x70e2, 0x70e2, 0x41a0, 0x41a0, 0x41a0, 0x41a0, 0x4008,\r
57 0x0008, 0x0008, 0x0008, 0x0008, 0x0008, 0x0288, 0x0008, 0x0008,\r
58 0x0008, 0x0008, 0x0008, 0x0008, 0x0008, 0x0008, 0x0008, 0x0008,\r
59 0x0008, 0x0008, 0x0008, 0x0008, 0x0008, 0x0008, 0x0008, 0x0008,\r
60 0x0008, 0x0008, 0x0008, 0x0008, 0x0008, 0x0008, 0x0008, 0x0008,\r
61 0x0284, 0x01a0, 0x00a0, 0x00a0, 0x00a0, 0x00a0, 0x00a0, 0x00a0,\r
62 0x00a0, 0x00a0, 0x30e2, 0x01a0, 0x00a0, 0x00a8, 0x00a0, 0x00a0,\r
63 0x00a0, 0x00a0, 0x10a0, 0x10a0, 0x00a0, 0x30e2, 0x00a0, 0x01a0,\r
64 0x00a0, 0x10a0, 0x30e2, 0x01a0, 0x10a0, 0x10a0, 0x10a0, 0x01a0,\r
65 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2,\r
66 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2,\r
67 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x00a0,\r
68 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x34a2, 0x30e2,\r
69 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2,\r
70 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2,\r
71 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x00a0,\r
72 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2, 0x30e2\r
73};\r
74\r
75#include "st.h"\r
76\r
77#include "unicode_fold_data.c"\r
78\r
79extern int\r
80onigenc_unicode_mbc_case_fold(OnigEncoding enc,\r
81 OnigCaseFoldType flag ARG_UNUSED, const UChar** pp, const UChar* end,\r
82 UChar* fold)\r
83{\r
84 const struct ByUnfoldKey* buk;\r
85\r
86 OnigCodePoint code;\r
87 int i, len, rlen;\r
88 const UChar *p = *pp;\r
89\r
90 code = ONIGENC_MBC_TO_CODE(enc, p, end);\r
91 len = enclen(enc, p);\r
92 *pp += len;\r
93\r
94#ifdef USE_UNICODE_CASE_FOLD_TURKISH_AZERI\r
95 if ((flag & ONIGENC_CASE_FOLD_TURKISH_AZERI) != 0) {\r
96 if (code == 0x0130) {\r
97 return ONIGENC_CODE_TO_MBC(enc, 0x0069, fold);\r
98 }\r
99#if 0\r
100 if (code == 0x0049) {\r
101 return ONIGENC_CODE_TO_MBC(enc, 0x0131, fold);\r
102 }\r
103#endif\r
104 }\r
105#endif\r
106\r
107 buk = onigenc_unicode_unfold_key(code);\r
108 if (buk != 0) {\r
109 if (buk->fold_len == 1) {\r
110 return ONIGENC_CODE_TO_MBC(enc, *FOLDS1_FOLD(buk->index), fold);\r
111 }\r
112 else {\r
113 OnigCodePoint* addr;\r
114\r
115 FOLDS_FOLD_ADDR_BUK(buk, addr);\r
116 rlen = 0;\r
117 for (i = 0; i < buk->fold_len; i++) {\r
118 OnigCodePoint c = addr[i];\r
119 len = ONIGENC_CODE_TO_MBC(enc, c, fold);\r
120 fold += len;\r
121 rlen += len;\r
122 }\r
123 return rlen;\r
124 }\r
125 }\r
126\r
127 for (i = 0; i < len; i++) {\r
128 *fold++ = *p++;\r
129 }\r
130 return len;\r
131}\r
132\r
133static int\r
134apply_case_fold1(int from, int to, OnigApplyAllCaseFoldFunc f, void* arg)\r
135{\r
136 int i, j, k, n, r;\r
137\r
138 for (i = from; i < to; ) {\r
139 OnigCodePoint fold = *FOLDS1_FOLD(i);\r
140 n = FOLDS1_UNFOLDS_NUM(i);\r
141 for (j = 0; j < n; j++) {\r
142 OnigCodePoint unfold = FOLDS1_UNFOLDS(i)[j];\r
143\r
144 r = (*f)(fold, &unfold, 1, arg);\r
145 if (r != 0) return r;\r
146 r = (*f)(unfold, &fold, 1, arg);\r
147 if (r != 0) return r;\r
148\r
149 for (k = 0; k < j; k++) {\r
150 OnigCodePoint unfold2 = FOLDS1_UNFOLDS(i)[k];\r
151 r = (*f)(unfold, &unfold2, 1, arg);\r
152 if (r != 0) return r;\r
153 r = (*f)(unfold2, &unfold, 1, arg);\r
154 if (r != 0) return r;\r
155 }\r
156 }\r
157\r
158 i = FOLDS1_NEXT_INDEX(i);\r
159 }\r
160\r
161 return 0;\r
162}\r
163\r
164static int\r
165apply_case_fold2(int from, int to, OnigApplyAllCaseFoldFunc f, void* arg)\r
166{\r
167 int i, j, k, n, r;\r
168\r
169 for (i = from; i < to; ) {\r
170 OnigCodePoint* fold = FOLDS2_FOLD(i);\r
171 n = FOLDS2_UNFOLDS_NUM(i);\r
172 for (j = 0; j < n; j++) {\r
173 OnigCodePoint unfold = FOLDS2_UNFOLDS(i)[j];\r
174\r
175 r = (*f)(unfold, fold, 2, arg);\r
176 if (r != 0) return r;\r
177\r
178 for (k = 0; k < j; k++) {\r
179 OnigCodePoint unfold2 = FOLDS2_UNFOLDS(i)[k];\r
180 r = (*f)(unfold, &unfold2, 1, arg);\r
181 if (r != 0) return r;\r
182 r = (*f)(unfold2, &unfold, 1, arg);\r
183 if (r != 0) return r;\r
184 }\r
185 }\r
186\r
187 i = FOLDS2_NEXT_INDEX(i);\r
188 }\r
189\r
190 return 0;\r
191}\r
192\r
193static int\r
194apply_case_fold3(int from, int to, OnigApplyAllCaseFoldFunc f, void* arg)\r
195{\r
196 int i, j, k, n, r;\r
197\r
198 for (i = from; i < to; ) {\r
199 OnigCodePoint* fold = FOLDS3_FOLD(i);\r
200 n = FOLDS3_UNFOLDS_NUM(i);\r
201 for (j = 0; j < n; j++) {\r
202 OnigCodePoint unfold = FOLDS3_UNFOLDS(i)[j];\r
203\r
204 r = (*f)(unfold, fold, 3, arg);\r
205 if (r != 0) return r;\r
206\r
207 for (k = 0; k < j; k++) {\r
208 OnigCodePoint unfold2 = FOLDS3_UNFOLDS(i)[k];\r
209 r = (*f)(unfold, &unfold2, 1, arg);\r
210 if (r != 0) return r;\r
211 r = (*f)(unfold2, &unfold, 1, arg);\r
212 if (r != 0) return r;\r
213 }\r
214 }\r
215\r
216 i = FOLDS3_NEXT_INDEX(i);\r
217 }\r
218\r
219 return 0;\r
220}\r
221\r
222extern int\r
223onigenc_unicode_apply_all_case_fold(OnigCaseFoldType flag,\r
224 OnigApplyAllCaseFoldFunc f, void* arg)\r
225{\r
226 int r;\r
227\r
228 r = apply_case_fold1(0, FOLDS1_NORMAL_END_INDEX, f, arg);\r
229 if (r != 0) return r;\r
230\r
231#ifdef USE_UNICODE_CASE_FOLD_TURKISH_AZERI\r
232 if ((flag & ONIGENC_CASE_FOLD_TURKISH_AZERI) != 0) {\r
233 code = 0x0131;\r
234 r = (*f)(0x0049, &code, 1, arg);\r
235 if (r != 0) return r;\r
236 code = 0x0049;\r
237 r = (*f)(0x0131, &code, 1, arg);\r
238 if (r != 0) return r;\r
239\r
240 code = 0x0130;\r
241 r = (*f)(0x0069, &code, 1, arg);\r
242 if (r != 0) return r;\r
243 code = 0x0069;\r
244 r = (*f)(0x0130, &code, 1, arg);\r
245 if (r != 0) return r;\r
246 }\r
247 else {\r
248#endif\r
249 r = apply_case_fold1(FOLDS1_NORMAL_END_INDEX, FOLDS1_END_INDEX, f, arg);\r
250 if (r != 0) return r;\r
251#ifdef USE_UNICODE_CASE_FOLD_TURKISH_AZERI\r
252 }\r
253#endif\r
254\r
255 if ((flag & INTERNAL_ONIGENC_CASE_FOLD_MULTI_CHAR) == 0)\r
256 return 0;\r
257\r
258 r = apply_case_fold2(0, FOLDS2_NORMAL_END_INDEX, f, arg);\r
259 if (r != 0) return r;\r
260\r
261#ifdef USE_UNICODE_CASE_FOLD_TURKISH_AZERI\r
262 if ((flag & ONIGENC_CASE_FOLD_TURKISH_AZERI) == 0) {\r
263#endif\r
264 r = apply_case_fold2(FOLDS2_NORMAL_END_INDEX, FOLDS2_END_INDEX, f, arg);\r
265 if (r != 0) return r;\r
266#ifdef USE_UNICODE_CASE_FOLD_TURKISH_AZERI\r
267 }\r
268#endif\r
269\r
270 r = apply_case_fold3(0, FOLDS3_NORMAL_END_INDEX, f, arg);\r
271 if (r != 0) return r;\r
272\r
273 return 0;\r
274}\r
275\r
276extern int\r
277onigenc_unicode_get_case_fold_codes_by_str(OnigEncoding enc,\r
278 OnigCaseFoldType flag, const OnigUChar* p, const OnigUChar* end,\r
279 OnigCaseFoldCodeItem items[])\r
280{\r
281 int n, m, i, j, k, len;\r
282 OnigCodePoint code, codes[3];\r
283 const struct ByUnfoldKey* buk;\r
284\r
285 n = 0;\r
286\r
287 code = ONIGENC_MBC_TO_CODE(enc, p, end);\r
288 len = enclen(enc, p);\r
289\r
290#ifdef USE_UNICODE_CASE_FOLD_TURKISH_AZERI\r
291 if ((flag & ONIGENC_CASE_FOLD_TURKISH_AZERI) != 0) {\r
292 if (code == 0x0049) {\r
293 items[0].byte_len = len;\r
294 items[0].code_len = 1;\r
295 items[0].code[0] = 0x0131;\r
296 return 1;\r
297 }\r
298 else if (code == 0x0130) {\r
299 items[0].byte_len = len;\r
300 items[0].code_len = 1;\r
301 items[0].code[0] = 0x0069;\r
302 return 1;\r
303 }\r
304 else if (code == 0x0131) {\r
305 items[0].byte_len = len;\r
306 items[0].code_len = 1;\r
307 items[0].code[0] = 0x0049;\r
308 return 1;\r
309 }\r
310 else if (code == 0x0069) {\r
311 items[0].byte_len = len;\r
312 items[0].code_len = 1;\r
313 items[0].code[0] = 0x0130;\r
314 return 1;\r
315 }\r
316 }\r
317#endif\r
318\r
319 buk = onigenc_unicode_unfold_key(code);\r
320 if (buk != 0) {\r
321 if (buk->fold_len == 1) {\r
322 int un;\r
323 items[0].byte_len = len;\r
324 items[0].code_len = 1;\r
325 items[0].code[0] = *FOLDS1_FOLD(buk->index);\r
326 n++;\r
327\r
328 un = FOLDS1_UNFOLDS_NUM(buk->index);\r
329 for (i = 0; i < un; i++) {\r
330 OnigCodePoint unfold = FOLDS1_UNFOLDS(buk->index)[i];\r
331 if (unfold != code) {\r
332 items[n].byte_len = len;\r
333 items[n].code_len = 1;\r
334 items[n].code[0] = unfold;\r
335 n++;\r
336 }\r
337 }\r
338 code = items[0].code[0]; /* for multi-code to unfold search. */\r
339 }\r
340 else if ((flag & INTERNAL_ONIGENC_CASE_FOLD_MULTI_CHAR) != 0) {\r
341 OnigCodePoint cs[3][4];\r
342 int fn, ncs[3];\r
343\r
344 if (buk->fold_len == 2) {\r
345 m = FOLDS2_UNFOLDS_NUM(buk->index);\r
346 for (i = 0; i < m; i++) {\r
347 OnigCodePoint unfold = FOLDS2_UNFOLDS(buk->index)[i];\r
348 if (unfold == code) continue;\r
349\r
350 items[n].byte_len = len;\r
351 items[n].code_len = 1;\r
352 items[n].code[0] = unfold;\r
353 n++;\r
354 }\r
355\r
356 for (fn = 0; fn < 2; fn++) {\r
357 int index;\r
358 cs[fn][0] = FOLDS2_FOLD(buk->index)[fn];\r
359 index = onigenc_unicode_fold1_key(&cs[fn][0]);\r
360 if (index >= 0) {\r
361 int m = FOLDS1_UNFOLDS_NUM(index);\r
362 for (i = 0; i < m; i++) {\r
363 cs[fn][i+1] = FOLDS1_UNFOLDS(index)[i];\r
364 }\r
365 ncs[fn] = m + 1;\r
366 }\r
367 else\r
368 ncs[fn] = 1;\r
369 }\r
370\r
371 for (i = 0; i < ncs[0]; i++) {\r
372 for (j = 0; j < ncs[1]; j++) {\r
373 items[n].byte_len = len;\r
374 items[n].code_len = 2;\r
375 items[n].code[0] = cs[0][i];\r
376 items[n].code[1] = cs[1][j];\r
377 n++;\r
378 }\r
379 }\r
380 }\r
381 else { /* fold_len == 3 */\r
382 m = FOLDS3_UNFOLDS_NUM(buk->index);\r
383 for (i = 0; i < m; i++) {\r
384 OnigCodePoint unfold = FOLDS3_UNFOLDS(buk->index)[i];\r
385 if (unfold == code) continue;\r
386\r
387 items[n].byte_len = len;\r
388 items[n].code_len = 1;\r
389 items[n].code[0] = unfold;\r
390 n++;\r
391 }\r
392\r
393 for (fn = 0; fn < 3; fn++) {\r
394 int index;\r
395 cs[fn][0] = FOLDS3_FOLD(buk->index)[fn];\r
396 index = onigenc_unicode_fold1_key(&cs[fn][0]);\r
397 if (index >= 0) {\r
398 int m = FOLDS1_UNFOLDS_NUM(index);\r
399 for (i = 0; i < m; i++) {\r
400 cs[fn][i+1] = FOLDS1_UNFOLDS(index)[i];\r
401 }\r
402 ncs[fn] = m + 1;\r
403 }\r
404 else\r
405 ncs[fn] = 1;\r
406 }\r
407\r
408 for (i = 0; i < ncs[0]; i++) {\r
409 for (j = 0; j < ncs[1]; j++) {\r
410 for (k = 0; k < ncs[2]; k++) {\r
411 items[n].byte_len = len;\r
412 items[n].code_len = 3;\r
413 items[n].code[0] = cs[0][i];\r
414 items[n].code[1] = cs[1][j];\r
415 items[n].code[2] = cs[2][k];\r
416 n++;\r
417 }\r
418 }\r
419 }\r
420 }\r
421\r
422 /* multi char folded code is not head of another folded multi char */\r
423 return n;\r
424 }\r
425 }\r
426 else {\r
427 int index = onigenc_unicode_fold1_key(&code);\r
428 if (index >= 0) {\r
429 int m = FOLDS1_UNFOLDS_NUM(index);\r
430 for (i = 0; i < m; i++) {\r
431 items[n].byte_len = len;\r
432 items[n].code_len = 1;\r
433 items[n].code[0] = FOLDS1_UNFOLDS(index)[i];\r
434 n++;\r
435 }\r
436 }\r
437 }\r
438\r
439 if ((flag & INTERNAL_ONIGENC_CASE_FOLD_MULTI_CHAR) == 0)\r
440 return n;\r
441\r
442 p += len;\r
443 if (p < end) {\r
444 int clen;\r
445 int index;\r
446\r
447 codes[0] = code;\r
448 code = ONIGENC_MBC_TO_CODE(enc, p, end);\r
449\r
450 buk = onigenc_unicode_unfold_key(code);\r
451 if (buk != 0 && buk->fold_len == 1) {\r
452 codes[1] = *FOLDS1_FOLD(buk->index);\r
453 }\r
454 else\r
455 codes[1] = code;\r
456\r
457 clen = enclen(enc, p);\r
458 len += clen;\r
459\r
460 index = onigenc_unicode_fold2_key(codes);\r
461 if (index >= 0) {\r
462 m = FOLDS2_UNFOLDS_NUM(index);\r
463 for (i = 0; i < m; i++) {\r
464 items[n].byte_len = len;\r
465 items[n].code_len = 1;\r
466 items[n].code[0] = FOLDS2_UNFOLDS(index)[i];\r
467 n++;\r
468 }\r
469 }\r
470\r
471 p += clen;\r
472 if (p < end) {\r
473 code = ONIGENC_MBC_TO_CODE(enc, p, end);\r
474 buk = onigenc_unicode_unfold_key(code);\r
475 if (buk != 0 && buk->fold_len == 1) {\r
476 codes[2] = *FOLDS1_FOLD(buk->index);\r
477 }\r
478 else\r
479 codes[2] = code;\r
480\r
481 clen = enclen(enc, p);\r
482 len += clen;\r
483\r
484 index = onigenc_unicode_fold3_key(codes);\r
485 if (index >= 0) {\r
486 m = FOLDS3_UNFOLDS_NUM(index);\r
487 for (i = 0; i < m; i++) {\r
488 items[n].byte_len = len;\r
489 items[n].code_len = 1;\r
490 items[n].code[0] = FOLDS3_UNFOLDS(index)[i];\r
491 n++;\r
492 }\r
493 }\r
494 }\r
495 }\r
496\r
497 return n;\r
498}\r
499\r
500#ifdef USE_UNICODE_PROPERTIES\r
501#include "unicode_property_data.c"\r
502#else\r
503#include "unicode_property_data_posix.c"\r
504#endif\r
505\r
506\r
507#ifdef USE_UNICODE_EXTENDED_GRAPHEME_CLUSTER\r
508\r
509enum EGCB_BREAK_TYPE {\r
510 EGCB_NOT_BREAK = 0,\r
511 EGCB_BREAK = 1,\r
512 EGCB_BREAK_UNDEF_GB11 = 2,\r
513 EGCB_BREAK_UNDEF_RI_RI = 3\r
514};\r
515\r
516enum EGCB_TYPE {\r
517 EGCB_Other = 0,\r
518 EGCB_CR = 1,\r
519 EGCB_LF = 2,\r
520 EGCB_Control = 3,\r
521 EGCB_Extend = 4,\r
522 EGCB_Prepend = 5,\r
523 EGCB_Regional_Indicator = 6,\r
524 EGCB_SpacingMark = 7,\r
525 EGCB_ZWJ = 8,\r
526#if 0\r
527 /* obsoleted */\r
528 EGCB_E_Base = 9,\r
529 EGCB_E_Base_GAZ = 10,\r
530 EGCB_E_Modifier = 11,\r
531 EGCB_Glue_After_Zwj = 12,\r
532#endif\r
533 EGCB_L = 13,\r
534 EGCB_LV = 14,\r
535 EGCB_LVT = 15,\r
536 EGCB_T = 16,\r
537 EGCB_V = 17\r
538};\r
539\r
540typedef struct {\r
541 OnigCodePoint start;\r
542 OnigCodePoint end;\r
543 enum EGCB_TYPE type;\r
544} EGCB_RANGE_TYPE;\r
545\r
546#include "unicode_egcb_data.c"\r
547\r
548static enum EGCB_TYPE\r
549egcb_get_type(OnigCodePoint code)\r
550{\r
551 OnigCodePoint low, high, x;\r
552 enum EGCB_TYPE type;\r
553\r
554 for (low = 0, high = (OnigCodePoint )EGCB_RANGE_NUM; low < high; ) {\r
555 x = (low + high) >> 1;\r
556 if (code > EGCB_RANGES[x].end)\r
557 low = x + 1;\r
558 else\r
559 high = x;\r
560 }\r
561\r
562 type = (low < (OnigCodePoint )EGCB_RANGE_NUM &&\r
563 code >= EGCB_RANGES[low].start) ?\r
564 EGCB_RANGES[low].type : EGCB_Other;\r
565\r
566 return type;\r
567}\r
568\r
569#define IS_CONTROL_CR_LF(code) ((code) <= EGCB_Control && (code) >= EGCB_CR)\r
570#define IS_HANGUL(code) ((code) >= EGCB_L)\r
571\r
572/* GB1 and GB2 are outside of this function. */\r
573static enum EGCB_BREAK_TYPE\r
574unicode_egcb_is_break_2code(OnigCodePoint from_code, OnigCodePoint to_code)\r
575{\r
576 enum EGCB_TYPE from;\r
577 enum EGCB_TYPE to;\r
578\r
579 from = egcb_get_type(from_code);\r
580 to = egcb_get_type(to_code);\r
581\r
582 /* short cut */\r
583 if (from == 0 && to == 0) goto GB999;\r
584\r
585 /* GB3 */\r
586 if (from == EGCB_CR && to == EGCB_LF) return EGCB_NOT_BREAK;\r
587 /* GB4 */\r
588 if (IS_CONTROL_CR_LF(from)) return EGCB_BREAK;\r
589 /* GB5 */\r
590 if (IS_CONTROL_CR_LF(to)) return EGCB_BREAK;\r
591\r
592 if (IS_HANGUL(from) && IS_HANGUL(to)) {\r
593 /* GB6 */\r
594 if (from == EGCB_L && to != EGCB_T) return EGCB_NOT_BREAK;\r
595 /* GB7 */\r
596 if ((from == EGCB_LV || from == EGCB_V)\r
597 && (to == EGCB_V || to == EGCB_T)) return EGCB_NOT_BREAK;\r
598\r
599 /* GB8 */\r
600 if ((to == EGCB_T) && (from == EGCB_LVT || from == EGCB_T))\r
601 return EGCB_NOT_BREAK;\r
602\r
603 goto GB999;\r
604 }\r
605\r
606 /* GB9 */\r
607 if (to == EGCB_Extend || to == EGCB_ZWJ) return EGCB_NOT_BREAK;\r
608\r
609 /* GB9a */\r
610 if (to == EGCB_SpacingMark) return EGCB_NOT_BREAK;\r
611 /* GB9b */\r
612 if (from == EGCB_Prepend) return EGCB_NOT_BREAK;\r
613\r
614 /* GB10 removed */\r
615\r
616 /* GB11 */\r
617 if (from == EGCB_ZWJ) {\r
618 if (onigenc_unicode_is_code_ctype(to_code, PROP_INDEX_EXTENDEDPICTOGRAPHIC))\r
619 return EGCB_BREAK_UNDEF_GB11;\r
620\r
621 goto GB999;\r
622 }\r
623\r
624 /* GB12, GB13 */\r
625 if (from == EGCB_Regional_Indicator && to == EGCB_Regional_Indicator) {\r
626 return EGCB_BREAK_UNDEF_RI_RI;\r
627 }\r
628\r
629 GB999:\r
630 return EGCB_BREAK;\r
631}\r
632\r
633#endif /* USE_UNICODE_EXTENDED_GRAPHEME_CLUSTER */\r
634\r
635extern int\r
636onigenc_egcb_is_break_position(OnigEncoding enc, UChar* p, UChar* prev,\r
637 const UChar* start, const UChar* end)\r
638{\r
639 OnigCodePoint from;\r
640 OnigCodePoint to;\r
641#ifdef USE_UNICODE_EXTENDED_GRAPHEME_CLUSTER\r
642 enum EGCB_BREAK_TYPE btype;\r
643 enum EGCB_TYPE type;\r
644#endif\r
645\r
646 /* GB1 and GB2 */\r
647 if (p == start) return 1;\r
648 if (p == end) return 1;\r
649\r
650 if (IS_NULL(prev)) {\r
651 prev = onigenc_get_prev_char_head(enc, start, p);\r
652 if (IS_NULL(prev)) return 1;\r
653 }\r
654\r
655 from = ONIGENC_MBC_TO_CODE(enc, prev, end);\r
656 to = ONIGENC_MBC_TO_CODE(enc, p, end);\r
657\r
658#ifdef USE_UNICODE_EXTENDED_GRAPHEME_CLUSTER\r
659 if (! ONIGENC_IS_UNICODE_ENCODING(enc)) {\r
660 if (from == 0x000d && to == 0x000a) return 0;\r
661 else return 1;\r
662 }\r
663\r
664 btype = unicode_egcb_is_break_2code(from, to);\r
665 switch (btype) {\r
666 case EGCB_NOT_BREAK:\r
667 return 0;\r
668 break;\r
669 case EGCB_BREAK:\r
670 return 1;\r
671 break;\r
672\r
673 case EGCB_BREAK_UNDEF_GB11:\r
674 while ((prev = onigenc_get_prev_char_head(enc, start, prev)) != NULL) {\r
675 from = ONIGENC_MBC_TO_CODE(enc, prev, end);\r
676 if (onigenc_unicode_is_code_ctype(from, PROP_INDEX_EXTENDEDPICTOGRAPHIC))\r
677 return 0;\r
678\r
679 type = egcb_get_type(from);\r
680 if (type != EGCB_Extend)\r
681 break;\r
682 }\r
683 break;\r
684\r
685 case EGCB_BREAK_UNDEF_RI_RI:\r
686 {\r
687 int n = 0;\r
688 while ((prev = onigenc_get_prev_char_head(enc, start, prev)) != NULL) {\r
689 from = ONIGENC_MBC_TO_CODE(enc, prev, end);\r
690 type = egcb_get_type(from);\r
691 if (type != EGCB_Regional_Indicator)\r
692 break;\r
693\r
694 n++;\r
695 }\r
696 if ((n % 2) == 0) return 0;\r
697 }\r
698 break;\r
699 }\r
700\r
701 return 1;\r
702\r
703#else\r
704 if (from == 0x000d && to == 0x000a) return 0;\r
705 else return 1;\r
706#endif /* USE_UNICODE_EXTENDED_GRAPHEME_CLUSTER */\r
707}\r
708\r
709\r
710#define USER_DEFINED_PROPERTY_MAX_NUM 20\r
711\r
712typedef struct {\r
713 int ctype;\r
714 OnigCodePoint* ranges;\r
715} UserDefinedPropertyValue;\r
716\r
717static int UserDefinedPropertyNum;\r
718static UserDefinedPropertyValue\r
719UserDefinedPropertyRanges[USER_DEFINED_PROPERTY_MAX_NUM];\r
720static st_table* UserDefinedPropertyTable;\r
721\r
722extern int\r
723onig_unicode_define_user_property(const char* name, OnigCodePoint* ranges)\r
724{\r
725 UserDefinedPropertyValue* e;\r
726 int r;\r
727 int i;\r
728 int n;\r
729 int len;\r
730 int c;\r
731 char* s;\r
732\r
733 if (UserDefinedPropertyNum >= USER_DEFINED_PROPERTY_MAX_NUM)\r
734 return ONIGERR_TOO_MANY_USER_DEFINED_OBJECTS;\r
735\r
736 len = (int )strlen_s(name,MAX_STRING_SIZE);\r
737 if (len >= PROPERTY_NAME_MAX_SIZE)\r
738 return ONIGERR_TOO_LONG_PROPERTY_NAME;\r
739\r
740 s = (char* )xmalloc(len + 1);\r
741 if (s == 0)\r
742 return ONIGERR_MEMORY;\r
743\r
744 n = 0;\r
745 for (i = 0; i < len; i++) {\r
746 c = name[i];\r
747 if (c <= 0 || c >= 0x80) {\r
748 xfree(s);\r
749 return ONIGERR_INVALID_CHAR_PROPERTY_NAME;\r
750 }\r
751\r
752 if (c != ' ' && c != '-' && c != '_') {\r
753 s[n] = c;\r
754 n++;\r
755 }\r
756 }\r
757 s[n] = '\0';\r
758\r
759 if (UserDefinedPropertyTable == 0) {\r
760 UserDefinedPropertyTable = onig_st_init_strend_table_with_size(10);\r
a5def177
DG
761 if (IS_NULL(UserDefinedPropertyTable)) {\r
762 xfree(s);\r
763 return ONIGERR_MEMORY;\r
764 }\r
b602265d
DG
765 }\r
766\r
767 e = UserDefinedPropertyRanges + UserDefinedPropertyNum;\r
768 e->ctype = CODE_RANGES_NUM + UserDefinedPropertyNum;\r
769 e->ranges = ranges;\r
770 r = onig_st_insert_strend(UserDefinedPropertyTable,\r
771 (const UChar* )s, (const UChar* )s + n,\r
772 (hash_data_type )((void* )e));\r
773 if (r < 0) return r;\r
774\r
775 UserDefinedPropertyNum++;\r
776 return 0;\r
777}\r
778\r
779extern int\r
780onigenc_unicode_is_code_ctype(OnigCodePoint code, unsigned int ctype)\r
781{\r
782 if (\r
783#ifdef USE_UNICODE_PROPERTIES\r
784 ctype <= ONIGENC_MAX_STD_CTYPE &&\r
785#endif\r
786 code < 256) {\r
787 return ONIGENC_IS_UNICODE_ISO_8859_1_CTYPE(code, ctype);\r
788 }\r
789\r
790 if (ctype >= CODE_RANGES_NUM) {\r
791 int index = ctype - CODE_RANGES_NUM;\r
792 if (index < UserDefinedPropertyNum)\r
793 return onig_is_in_code_range((UChar* )UserDefinedPropertyRanges[index].ranges, code);\r
794 else\r
795 return ONIGERR_TYPE_BUG;\r
796 }\r
797\r
798 return onig_is_in_code_range((UChar* )CodeRanges[ctype], code);\r
799}\r
800\r
801\r
802extern int\r
803onigenc_unicode_ctype_code_range(OnigCtype ctype, const OnigCodePoint* ranges[])\r
804{\r
805 if (ctype >= CODE_RANGES_NUM) {\r
806 int index = ctype - CODE_RANGES_NUM;\r
807 if (index < UserDefinedPropertyNum) {\r
808 *ranges = UserDefinedPropertyRanges[index].ranges;\r
809 return 0;\r
810 }\r
811 else\r
812 return ONIGERR_TYPE_BUG;\r
813 }\r
814\r
815 *ranges = CodeRanges[ctype];\r
816 return 0;\r
817}\r
818\r
819extern int\r
820onigenc_utf16_32_get_ctype_code_range(OnigCtype ctype, OnigCodePoint* sb_out,\r
821 const OnigCodePoint* ranges[])\r
822{\r
823 *sb_out = 0x00;\r
824 return onigenc_unicode_ctype_code_range(ctype, ranges);\r
825}\r
826\r
827extern int\r
828onigenc_unicode_property_name_to_ctype(OnigEncoding enc, UChar* name, UChar* end)\r
829{\r
830 int len;\r
831 UChar *p;\r
832 OnigCodePoint code;\r
833 const struct PoolPropertyNameCtype* pc;\r
834 char buf[PROPERTY_NAME_MAX_SIZE];\r
835\r
836 p = name;\r
837 len = 0;\r
838 while (p < end) {\r
839 code = ONIGENC_MBC_TO_CODE(enc, p, end);\r
840 if (code >= 0x80)\r
841 return ONIGERR_INVALID_CHAR_PROPERTY_NAME;\r
842\r
843 if (code != ' ' && code != '-' && code != '_') {\r
844 buf[len++] = (char )code;\r
845 if (len >= PROPERTY_NAME_MAX_SIZE)\r
846 return ONIGERR_INVALID_CHAR_PROPERTY_NAME;\r
847 }\r
848\r
849 p += enclen(enc, p);\r
850 }\r
851\r
852 buf[len] = 0;\r
853\r
854 if (UserDefinedPropertyTable != 0) {\r
855 UserDefinedPropertyValue* e;\r
856 e = (UserDefinedPropertyValue* )NULL;\r
857 onig_st_lookup_strend(UserDefinedPropertyTable,\r
858 (const UChar* )buf, (const UChar* )buf + len,\r
859 (hash_data_type* )((void* )(&e)));\r
860 if (e != 0) {\r
861 return e->ctype;\r
862 }\r
863 }\r
864\r
865 pc = unicode_lookup_property_name(buf, len);\r
866 if (pc != 0) {\r
867 /* fprintf(stderr, "LOOKUP: %s: %d\n", buf, pc->ctype); */\r
868#ifndef USE_UNICODE_PROPERTIES\r
869 if (pc->ctype > ONIGENC_MAX_STD_CTYPE)\r
870 return ONIGERR_INVALID_CHAR_PROPERTY_NAME;\r
871#endif\r
872\r
873 return (int )pc->ctype;\r
874 }\r
875\r
876 return ONIGERR_INVALID_CHAR_PROPERTY_NAME;\r
877}\r