mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
6ee2e54239
* regsyntax.c, unicode.c: new files along with Oniguruma 5.x. git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@12376 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
331 lines
8.8 KiB
C
331 lines
8.8 KiB
C
/**********************************************************************
|
|
utf8.c - Oniguruma (regular expression library)
|
|
**********************************************************************/
|
|
/*-
|
|
* Copyright (c) 2002-2006 K.Kosako <sndgk393 AT ybb DOT ne DOT jp>
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include "regenc.h"
|
|
|
|
#define USE_INVALID_CODE_SCHEME
|
|
|
|
#ifdef USE_INVALID_CODE_SCHEME
|
|
/* virtual codepoint values for invalid encoding byte 0xfe and 0xff */
|
|
#define INVALID_CODE_FE 0xfffffffe
|
|
#define INVALID_CODE_FF 0xffffffff
|
|
#define VALID_CODE_LIMIT 0x7fffffff
|
|
#endif
|
|
|
|
#define utf8_islead(c) ((UChar )((c) & 0xc0) != 0x80)
|
|
|
|
static const int EncLen_UTF8[] = {
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
|
|
3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3,
|
|
4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 1, 1
|
|
};
|
|
|
|
static int
|
|
utf8_mbc_enc_len(const UChar* p)
|
|
{
|
|
return EncLen_UTF8[*p];
|
|
}
|
|
|
|
static int
|
|
utf8_is_mbc_newline(const UChar* p, const UChar* end)
|
|
{
|
|
if (p < end) {
|
|
if (*p == 0x0a) return 1;
|
|
|
|
#ifdef USE_UNICODE_ALL_LINE_TERMINATORS
|
|
if (*p == 0x0d) return 1;
|
|
if (p + 1 < end) {
|
|
if (*(p+1) == 0x85 && *p == 0xc2) /* U+0085 */
|
|
return 1;
|
|
if (p + 2 < end) {
|
|
if ((*(p+2) == 0xa8 || *(p+2) == 0xa9)
|
|
&& *(p+1) == 0x80 && *p == 0xe2) /* U+2028, U+2029 */
|
|
return 1;
|
|
}
|
|
}
|
|
#endif
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
static OnigCodePoint
|
|
utf8_mbc_to_code(const UChar* p, const UChar* end)
|
|
{
|
|
int c, len;
|
|
OnigCodePoint n;
|
|
|
|
len = enc_len(ONIG_ENCODING_UTF8, p);
|
|
c = *p++;
|
|
if (len > 1) {
|
|
len--;
|
|
n = c & ((1 << (6 - len)) - 1);
|
|
while (len--) {
|
|
c = *p++;
|
|
n = (n << 6) | (c & ((1 << 6) - 1));
|
|
}
|
|
return n;
|
|
}
|
|
else {
|
|
#ifdef USE_INVALID_CODE_SCHEME
|
|
if (c > 0xfd) {
|
|
return ((c == 0xfe) ? INVALID_CODE_FE : INVALID_CODE_FF);
|
|
}
|
|
#endif
|
|
return (OnigCodePoint )c;
|
|
}
|
|
}
|
|
|
|
static int
|
|
utf8_code_to_mbclen(OnigCodePoint code)
|
|
{
|
|
if ((code & 0xffffff80) == 0) return 1;
|
|
else if ((code & 0xfffff800) == 0) {
|
|
if (code <= 0xff && code >= 0xfe)
|
|
return 1;
|
|
return 2;
|
|
}
|
|
else if ((code & 0xffff0000) == 0) return 3;
|
|
else if ((code & 0xffe00000) == 0) return 4;
|
|
else if ((code & 0xfc000000) == 0) return 5;
|
|
else if ((code & 0x80000000) == 0) return 6;
|
|
#ifdef USE_INVALID_CODE_SCHEME
|
|
else if (code == INVALID_CODE_FE) return 1;
|
|
else if (code == INVALID_CODE_FF) return 1;
|
|
#endif
|
|
else
|
|
return ONIGENCERR_TOO_BIG_WIDE_CHAR_VALUE;
|
|
}
|
|
|
|
#if 0
|
|
static int
|
|
utf8_code_to_mbc_first(OnigCodePoint code)
|
|
{
|
|
if ((code & 0xffffff80) == 0)
|
|
return code;
|
|
else {
|
|
if ((code & 0xfffff800) == 0)
|
|
return ((code>>6)& 0x1f) | 0xc0;
|
|
else if ((code & 0xffff0000) == 0)
|
|
return ((code>>12) & 0x0f) | 0xe0;
|
|
else if ((code & 0xffe00000) == 0)
|
|
return ((code>>18) & 0x07) | 0xf0;
|
|
else if ((code & 0xfc000000) == 0)
|
|
return ((code>>24) & 0x03) | 0xf8;
|
|
else if ((code & 0x80000000) == 0)
|
|
return ((code>>30) & 0x01) | 0xfc;
|
|
else {
|
|
return ONIGENCERR_TOO_BIG_WIDE_CHAR_VALUE;
|
|
}
|
|
}
|
|
}
|
|
#endif
|
|
|
|
static int
|
|
utf8_code_to_mbc(OnigCodePoint code, UChar *buf)
|
|
{
|
|
#define UTF8_TRAILS(code, shift) (UChar )((((code) >> (shift)) & 0x3f) | 0x80)
|
|
#define UTF8_TRAIL0(code) (UChar )(((code) & 0x3f) | 0x80)
|
|
|
|
if ((code & 0xffffff80) == 0) {
|
|
*buf = (UChar )code;
|
|
return 1;
|
|
}
|
|
else {
|
|
UChar *p = buf;
|
|
|
|
if ((code & 0xfffff800) == 0) {
|
|
*p++ = (UChar )(((code>>6)& 0x1f) | 0xc0);
|
|
}
|
|
else if ((code & 0xffff0000) == 0) {
|
|
*p++ = (UChar )(((code>>12) & 0x0f) | 0xe0);
|
|
*p++ = UTF8_TRAILS(code, 6);
|
|
}
|
|
else if ((code & 0xffe00000) == 0) {
|
|
*p++ = (UChar )(((code>>18) & 0x07) | 0xf0);
|
|
*p++ = UTF8_TRAILS(code, 12);
|
|
*p++ = UTF8_TRAILS(code, 6);
|
|
}
|
|
else if ((code & 0xfc000000) == 0) {
|
|
*p++ = (UChar )(((code>>24) & 0x03) | 0xf8);
|
|
*p++ = UTF8_TRAILS(code, 18);
|
|
*p++ = UTF8_TRAILS(code, 12);
|
|
*p++ = UTF8_TRAILS(code, 6);
|
|
}
|
|
else if ((code & 0x80000000) == 0) {
|
|
*p++ = (UChar )(((code>>30) & 0x01) | 0xfc);
|
|
*p++ = UTF8_TRAILS(code, 24);
|
|
*p++ = UTF8_TRAILS(code, 18);
|
|
*p++ = UTF8_TRAILS(code, 12);
|
|
*p++ = UTF8_TRAILS(code, 6);
|
|
}
|
|
#ifdef USE_INVALID_CODE_SCHEME
|
|
else if (code == INVALID_CODE_FE) {
|
|
*p = 0xfe;
|
|
return 1;
|
|
}
|
|
else if (code == INVALID_CODE_FF) {
|
|
*p = 0xff;
|
|
return 1;
|
|
}
|
|
#endif
|
|
else {
|
|
return ONIGENCERR_TOO_BIG_WIDE_CHAR_VALUE;
|
|
}
|
|
|
|
*p++ = UTF8_TRAIL0(code);
|
|
return p - buf;
|
|
}
|
|
}
|
|
|
|
static int
|
|
utf8_mbc_case_fold(OnigCaseFoldType flag, const UChar** pp,
|
|
const UChar* end, UChar* fold)
|
|
{
|
|
const UChar* p = *pp;
|
|
|
|
if (ONIGENC_IS_MBC_ASCII(p)) {
|
|
#ifdef USE_UNICODE_CASE_FOLD_TURKISH_AZERI
|
|
if ((flag & ONIGENC_CASE_FOLD_TURKISH_AZERI) != 0) {
|
|
if (*p == 0x49) {
|
|
*fold++ = 0xc4;
|
|
*fold = 0xb1;
|
|
(*pp)++;
|
|
return 2;
|
|
}
|
|
}
|
|
#endif
|
|
|
|
*fold = ONIGENC_ASCII_CODE_TO_LOWER_CASE(*p);
|
|
(*pp)++;
|
|
return 1; /* return byte length of converted char to lower */
|
|
}
|
|
else {
|
|
return onigenc_unicode_mbc_case_fold(ONIG_ENCODING_UTF8, flag,
|
|
pp, end, fold);
|
|
}
|
|
}
|
|
|
|
#if 0
|
|
static int
|
|
utf8_is_mbc_ambiguous(OnigCaseFoldType flag, const UChar** pp, const UChar* end)
|
|
{
|
|
const UChar* p = *pp;
|
|
|
|
if (ONIGENC_IS_MBC_ASCII(p)) {
|
|
(*pp)++;
|
|
return ONIGENC_IS_ASCII_CODE_CASE_AMBIG(*p);
|
|
}
|
|
else {
|
|
(*pp) += enc_len(ONIG_ENCODING_UTF8, p);
|
|
|
|
if (*p == 0xc3) {
|
|
int c = *(p + 1);
|
|
if (c >= 0x80) {
|
|
if (c <= (UChar )0x9e) { /* upper */
|
|
if (c == (UChar )0x97) return FALSE;
|
|
return TRUE;
|
|
}
|
|
else if (c >= (UChar )0xa0 && c <= (UChar )0xbe) { /* lower */
|
|
if (c == (UChar )'\267') return FALSE;
|
|
return TRUE;
|
|
}
|
|
else if (c == (UChar )0x9f &&
|
|
(flag & INTERNAL_ONIGENC_CASE_FOLD_MULTI_CHAR) != 0) {
|
|
return TRUE;
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
return FALSE;
|
|
}
|
|
#endif
|
|
|
|
|
|
static int
|
|
utf8_get_ctype_code_range(int ctype, OnigCodePoint *sb_out,
|
|
const OnigCodePoint* ranges[])
|
|
{
|
|
*sb_out = 0x80;
|
|
return onigenc_unicode_ctype_code_range(ctype, ranges);
|
|
}
|
|
|
|
|
|
static UChar*
|
|
utf8_left_adjust_char_head(const UChar* start, const UChar* s)
|
|
{
|
|
const UChar *p;
|
|
|
|
if (s <= start) return (UChar* )s;
|
|
p = s;
|
|
|
|
while (!utf8_islead(*p) && p > start) p--;
|
|
return (UChar* )p;
|
|
}
|
|
|
|
static int
|
|
utf8_get_case_fold_codes_by_str(OnigCaseFoldType flag,
|
|
const OnigUChar* p, const OnigUChar* end, OnigCaseFoldCodeItem items[])
|
|
{
|
|
return onigenc_unicode_get_case_fold_codes_by_str(ONIG_ENCODING_UTF8,
|
|
flag, p, end, items);
|
|
}
|
|
|
|
OnigEncodingType OnigEncodingUTF8 = {
|
|
utf8_mbc_enc_len,
|
|
"UTF-8", /* name */
|
|
6, /* max byte length */
|
|
1, /* min byte length */
|
|
utf8_is_mbc_newline,
|
|
utf8_mbc_to_code,
|
|
utf8_code_to_mbclen,
|
|
utf8_code_to_mbc,
|
|
utf8_mbc_case_fold,
|
|
onigenc_unicode_apply_all_case_fold,
|
|
utf8_get_case_fold_codes_by_str,
|
|
onigenc_unicode_property_name_to_ctype,
|
|
onigenc_unicode_is_code_ctype,
|
|
utf8_get_ctype_code_range,
|
|
utf8_left_adjust_char_head,
|
|
onigenc_always_true_is_allowed_reverse_match
|
|
};
|