зеркало из https://github.com/github/ruby.git
363 строки
11 KiB
C
363 строки
11 KiB
C
/**********************************************************************
|
|
euc_jp.c - Oniguruma (regular expression library)
|
|
**********************************************************************/
|
|
/*-
|
|
* Copyright (c) 2002-2007 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 "regint.h"
|
|
|
|
#define eucjp_islead(c) ((UChar )((c) - 0xa1) > 0xfe - 0xa1)
|
|
|
|
static const int EncLen_EUCJP[] = {
|
|
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, 3,
|
|
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, 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, 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, 1
|
|
};
|
|
|
|
typedef enum { FAILURE = -2, ACCEPT = -1, S0 = 0, S1, S2 } state_t;
|
|
#define A ACCEPT
|
|
#define F FAILURE
|
|
static const signed char trans[][0x100] = {
|
|
{ /* S0 0 1 2 3 4 5 6 7 8 9 a b c d e f */
|
|
/* 0 */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* 1 */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* 2 */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* 3 */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* 4 */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* 5 */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* 6 */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* 7 */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* 8 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, 1, 2,
|
|
/* 9 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* a */ F, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
/* b */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
/* c */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
/* d */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
/* e */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
/* f */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, F
|
|
},
|
|
{ /* S1 0 1 2 3 4 5 6 7 8 9 a b c d e f */
|
|
/* 0 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 1 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 2 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 3 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 4 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 5 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 6 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 7 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 8 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 9 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* a */ F, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* b */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* c */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* d */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* e */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, A,
|
|
/* f */ A, A, A, A, A, A, A, A, A, A, A, A, A, A, A, F
|
|
},
|
|
{ /* S2 0 1 2 3 4 5 6 7 8 9 a b c d e f */
|
|
/* 0 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 1 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 2 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 3 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 4 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 5 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 6 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 7 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 8 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* 9 */ F, F, F, F, F, F, F, F, F, F, F, F, F, F, F, F,
|
|
/* a */ F, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
/* b */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
/* c */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
/* d */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
/* e */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
/* f */ 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, F
|
|
},
|
|
|
|
};
|
|
#undef A
|
|
#undef F
|
|
|
|
static int
|
|
mbc_enc_len(const UChar* p, const UChar* e, OnigEncoding enc)
|
|
{
|
|
int firstbyte = *p++;
|
|
state_t s;
|
|
s = trans[0][firstbyte];
|
|
if (s < 0) return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(1) :
|
|
ONIGENC_CONSTRUCT_MBCLEN_INVALID();
|
|
if (p == e) return ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(EncLen_EUCJP[firstbyte]-1);
|
|
s = trans[s][*p++];
|
|
if (s < 0) return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(2) :
|
|
ONIGENC_CONSTRUCT_MBCLEN_INVALID();
|
|
if (p == e) return ONIGENC_CONSTRUCT_MBCLEN_NEEDMORE(EncLen_EUCJP[firstbyte]-2);
|
|
s = trans[s][*p++];
|
|
return s == ACCEPT ? ONIGENC_CONSTRUCT_MBCLEN_CHARFOUND(3) :
|
|
ONIGENC_CONSTRUCT_MBCLEN_INVALID();
|
|
}
|
|
|
|
static OnigCodePoint
|
|
mbc_to_code(const UChar* p, const UChar* end, OnigEncoding enc)
|
|
{
|
|
int c, i, len;
|
|
OnigCodePoint n;
|
|
|
|
len = enc_len(ONIG_ENCODING_EUC_JP, p, end);
|
|
n = (OnigCodePoint )*p++;
|
|
if (len == 1) return n;
|
|
|
|
for (i = 1; i < len; i++) {
|
|
if (p >= end) break;
|
|
c = *p++;
|
|
n <<= 8; n += c;
|
|
}
|
|
return n;
|
|
}
|
|
|
|
static int
|
|
code_to_mbclen(OnigCodePoint code, OnigEncoding enc)
|
|
{
|
|
if (ONIGENC_IS_CODE_ASCII(code)) return 1;
|
|
else if (code > 0xffffff) return 0;
|
|
else if ((code & 0xff0000) >= 0x800000) return 3;
|
|
else if ((code & 0xff00) >= 0x8000) return 2;
|
|
else return 0;
|
|
}
|
|
|
|
#if 0
|
|
static int
|
|
code_to_mbc_first(OnigCodePoint code)
|
|
{
|
|
int first;
|
|
|
|
if ((code & 0xff0000) != 0) {
|
|
first = (code >> 16) & 0xff;
|
|
}
|
|
else if ((code & 0xff00) != 0) {
|
|
first = (code >> 8) & 0xff;
|
|
}
|
|
else {
|
|
return (int )code;
|
|
}
|
|
return first;
|
|
}
|
|
#endif
|
|
|
|
static int
|
|
code_to_mbc(OnigCodePoint code, UChar *buf, OnigEncoding enc)
|
|
{
|
|
UChar *p = buf;
|
|
|
|
if ((code & 0xff0000) != 0) *p++ = (UChar )(((code >> 16) & 0xff));
|
|
if ((code & 0xff00) != 0) *p++ = (UChar )(((code >> 8) & 0xff));
|
|
*p++ = (UChar )(code & 0xff);
|
|
|
|
#if 1
|
|
if (enc_len(ONIG_ENCODING_EUC_JP, buf, p) != (p - buf))
|
|
return ONIGENC_ERR_INVALID_WIDE_CHAR_VALUE;
|
|
#endif
|
|
return p - buf;
|
|
}
|
|
|
|
static int
|
|
mbc_case_fold(OnigCaseFoldType flag,
|
|
const UChar** pp, const UChar* end, UChar* lower,
|
|
OnigEncoding enc)
|
|
{
|
|
int len;
|
|
const UChar* p = *pp;
|
|
|
|
if (ONIGENC_IS_MBC_ASCII(p)) {
|
|
*lower = ONIGENC_ASCII_CODE_TO_LOWER_CASE(*p);
|
|
(*pp)++;
|
|
return 1;
|
|
}
|
|
else {
|
|
int i;
|
|
|
|
len = enc_len(ONIG_ENCODING_EUC_JP, p, end);
|
|
for (i = 0; i < len; i++) {
|
|
*lower++ = *p++;
|
|
}
|
|
(*pp) += len;
|
|
return len; /* return byte length of converted char to lower */
|
|
}
|
|
}
|
|
|
|
static UChar*
|
|
left_adjust_char_head(const UChar* start, const UChar* s, OnigEncoding enc)
|
|
{
|
|
/* In this encoding
|
|
mb-trail bytes doesn't mix with single bytes.
|
|
*/
|
|
const UChar *p;
|
|
int len;
|
|
|
|
if (s <= start) return (UChar* )s;
|
|
p = s;
|
|
|
|
while (!eucjp_islead(*p) && p > start) p--;
|
|
len = enc_len(ONIG_ENCODING_EUC_JP, p, s);
|
|
if (p + len > s) return (UChar* )p;
|
|
p += len;
|
|
return (UChar* )(p + ((s - p) & ~1));
|
|
}
|
|
|
|
static int
|
|
is_allowed_reverse_match(const UChar* s, const UChar* end, OnigEncoding enc)
|
|
{
|
|
const UChar c = *s;
|
|
if (c <= 0x7e || c == 0x8e || c == 0x8f)
|
|
return TRUE;
|
|
else
|
|
return FALSE;
|
|
}
|
|
|
|
|
|
static int PropertyInited = 0;
|
|
static const OnigCodePoint** PropertyList;
|
|
static int PropertyListNum;
|
|
static int PropertyListSize;
|
|
static hash_table_type* PropertyNameTable;
|
|
|
|
static const OnigCodePoint CR_Hiragana[] = {
|
|
1,
|
|
0xa4a1, 0xa4f3
|
|
}; /* CR_Hiragana */
|
|
|
|
static const OnigCodePoint CR_Katakana[] = {
|
|
3,
|
|
0xa5a1, 0xa5f6,
|
|
0xaaa6, 0xaaaf,
|
|
0xaab1, 0xaadd
|
|
}; /* CR_Katakana */
|
|
|
|
static int
|
|
init_property_list(void)
|
|
{
|
|
int r;
|
|
|
|
PROPERTY_LIST_ADD_PROP("Hiragana", CR_Hiragana);
|
|
PROPERTY_LIST_ADD_PROP("Katakana", CR_Katakana);
|
|
PropertyInited = 1;
|
|
|
|
end:
|
|
return r;
|
|
}
|
|
|
|
static int
|
|
property_name_to_ctype(OnigEncoding enc, UChar* p, UChar* end)
|
|
{
|
|
int ctype;
|
|
|
|
PROPERTY_LIST_INIT_CHECK;
|
|
|
|
if (onig_st_lookup_strend(PropertyNameTable, p, end, (void*)&ctype) == 0) {
|
|
return onigenc_minimum_property_name_to_ctype(enc, p, end);
|
|
}
|
|
|
|
return ctype;
|
|
}
|
|
|
|
static int
|
|
is_code_ctype(OnigCodePoint code, unsigned int ctype, OnigEncoding enc)
|
|
{
|
|
if (ctype <= ONIGENC_MAX_STD_CTYPE) {
|
|
if (code < 128)
|
|
return ONIGENC_IS_ASCII_CODE_CTYPE(code, ctype);
|
|
else {
|
|
if (CTYPE_IS_WORD_GRAPH_PRINT(ctype)) {
|
|
return (code_to_mbclen(code, enc) > 1 ? TRUE : FALSE);
|
|
}
|
|
}
|
|
}
|
|
else {
|
|
PROPERTY_LIST_INIT_CHECK;
|
|
|
|
ctype -= (ONIGENC_MAX_STD_CTYPE + 1);
|
|
if (ctype >= (unsigned int )PropertyListNum)
|
|
return ONIGENC_ERR_TYPE_BUG;
|
|
|
|
return onig_is_in_code_range((UChar* )PropertyList[ctype], code);
|
|
}
|
|
|
|
return FALSE;
|
|
}
|
|
|
|
static int
|
|
get_ctype_code_range(int ctype, OnigCodePoint* sb_out,
|
|
const OnigCodePoint* ranges[], OnigEncoding enc)
|
|
{
|
|
if (ctype <= ONIGENC_MAX_STD_CTYPE) {
|
|
return ONIG_NO_SUPPORT_CONFIG;
|
|
}
|
|
else {
|
|
*sb_out = 0x80;
|
|
|
|
PROPERTY_LIST_INIT_CHECK;
|
|
|
|
ctype -= (ONIGENC_MAX_STD_CTYPE + 1);
|
|
if (ctype >= PropertyListNum)
|
|
return ONIGENC_ERR_TYPE_BUG;
|
|
|
|
*ranges = PropertyList[ctype];
|
|
return 0;
|
|
}
|
|
}
|
|
|
|
|
|
OnigEncodingDefine(euc_jp, EUC_JP) = {
|
|
mbc_enc_len,
|
|
"EUC-JP", /* name */
|
|
3, /* max enc length */
|
|
1, /* min enc length */
|
|
onigenc_is_mbc_newline_0x0a,
|
|
mbc_to_code,
|
|
code_to_mbclen,
|
|
code_to_mbc,
|
|
mbc_case_fold,
|
|
onigenc_ascii_apply_all_case_fold,
|
|
onigenc_ascii_get_case_fold_codes_by_str,
|
|
property_name_to_ctype,
|
|
is_code_ctype,
|
|
get_ctype_code_range,
|
|
left_adjust_char_head,
|
|
is_allowed_reverse_match,
|
|
0
|
|
};
|