mirror of
https://github.com/ruby/ruby.git
synced 2022-11-09 12:17:21 -05:00
086e235f03
git-svn-id: svn+ssh://ci.ruby-lang.org/ruby/trunk@9885 b2dd03c8-39d4-4d8f-98ff-823fe69b080e
238 lines
6.9 KiB
C
238 lines
6.9 KiB
C
/**********************************************************************
|
|
sjis.c - Oniguruma (regular expression library)
|
|
**********************************************************************/
|
|
/*-
|
|
* Copyright (c) 2002-2005 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"
|
|
|
|
static const int EncLen_SJIS[] = {
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 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,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 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, 1, 1, 1
|
|
};
|
|
|
|
static const char SJIS_CAN_BE_TRAIL_TABLE[256] = {
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0
|
|
};
|
|
|
|
#define SJIS_ISMB_FIRST(byte) (EncLen_SJIS[byte] > 1)
|
|
#define SJIS_ISMB_TRAIL(byte) SJIS_CAN_BE_TRAIL_TABLE[(byte)]
|
|
|
|
static int
|
|
sjis_mbc_enc_len(const UChar* p)
|
|
{
|
|
return EncLen_SJIS[*p];
|
|
}
|
|
|
|
static int
|
|
sjis_code_to_mbclen(OnigCodePoint code)
|
|
{
|
|
if (code < 256) {
|
|
if (EncLen_SJIS[(int )code] == 1)
|
|
return 1;
|
|
else
|
|
return 0;
|
|
}
|
|
else if (code <= 0xffff) {
|
|
return 2;
|
|
}
|
|
else
|
|
return 0;
|
|
}
|
|
|
|
static OnigCodePoint
|
|
sjis_mbc_to_code(const UChar* p, const UChar* end)
|
|
{
|
|
int c, i, len;
|
|
OnigCodePoint n;
|
|
|
|
len = enc_len(ONIG_ENCODING_SJIS, p);
|
|
c = *p++;
|
|
n = c;
|
|
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
|
|
sjis_code_to_mbc(OnigCodePoint code, UChar *buf)
|
|
{
|
|
UChar *p = buf;
|
|
|
|
if ((code & 0xff00) != 0) *p++ = (UChar )(((code >> 8) & 0xff));
|
|
*p++ = (UChar )(code & 0xff);
|
|
|
|
#if 0
|
|
if (enc_len(ONIG_ENCODING_SJIS, buf) != (p - buf))
|
|
return REGERR_INVALID_WIDE_CHAR_VALUE;
|
|
#endif
|
|
return p - buf;
|
|
}
|
|
|
|
static int
|
|
sjis_mbc_to_normalize(OnigAmbigType flag,
|
|
const UChar** pp, const UChar* end, UChar* lower)
|
|
{
|
|
const UChar* p = *pp;
|
|
|
|
if (ONIGENC_IS_MBC_ASCII(p)) {
|
|
if ((flag & ONIGENC_AMBIGUOUS_MATCH_ASCII_CASE) != 0) {
|
|
*lower = ONIGENC_ASCII_CODE_TO_LOWER_CASE(*p);
|
|
}
|
|
else {
|
|
*lower = *p;
|
|
}
|
|
|
|
(*pp)++;
|
|
return 1;
|
|
}
|
|
else {
|
|
int len = enc_len(ONIG_ENCODING_SJIS, p);
|
|
|
|
if (lower != p) {
|
|
int i;
|
|
for (i = 0; i < len; i++) {
|
|
*lower++ = *p++;
|
|
}
|
|
}
|
|
(*pp) += len;
|
|
return len; /* return byte length of converted char to lower */
|
|
}
|
|
}
|
|
|
|
static int
|
|
sjis_is_mbc_ambiguous(OnigAmbigType flag, const UChar** pp, const UChar* end)
|
|
{
|
|
return onigenc_mbn_is_mbc_ambiguous(ONIG_ENCODING_SJIS, flag, pp, end);
|
|
|
|
}
|
|
|
|
static int
|
|
sjis_is_code_ctype(OnigCodePoint code, unsigned int ctype)
|
|
{
|
|
if (code < 128)
|
|
return ONIGENC_IS_ASCII_CODE_CTYPE(code, ctype);
|
|
else {
|
|
if ((ctype & (ONIGENC_CTYPE_WORD |
|
|
ONIGENC_CTYPE_GRAPH | ONIGENC_CTYPE_PRINT)) != 0) {
|
|
return (sjis_code_to_mbclen(code) > 1 ? TRUE : FALSE);
|
|
}
|
|
}
|
|
|
|
return FALSE;
|
|
}
|
|
|
|
static UChar*
|
|
sjis_left_adjust_char_head(const UChar* start, const UChar* s)
|
|
{
|
|
const UChar *p;
|
|
int len;
|
|
|
|
if (s <= start) return (UChar* )s;
|
|
p = s;
|
|
|
|
if (SJIS_ISMB_TRAIL(*p)) {
|
|
while (p > start) {
|
|
if (! SJIS_ISMB_FIRST(*--p)) {
|
|
p++;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
len = enc_len(ONIG_ENCODING_SJIS, p);
|
|
if (p + len > s) return (UChar* )p;
|
|
p += len;
|
|
return (UChar* )(p + ((s - p) & ~1));
|
|
}
|
|
|
|
static int
|
|
sjis_is_allowed_reverse_match(const UChar* s, const UChar* end)
|
|
{
|
|
const UChar c = *s;
|
|
return (SJIS_ISMB_TRAIL(c) ? FALSE : TRUE);
|
|
}
|
|
|
|
OnigEncodingType OnigEncodingSJIS = {
|
|
sjis_mbc_enc_len,
|
|
"Shift_JIS", /* name */
|
|
2, /* max byte length */
|
|
1, /* min byte length */
|
|
ONIGENC_AMBIGUOUS_MATCH_ASCII_CASE,
|
|
{
|
|
(OnigCodePoint )'\\' /* esc */
|
|
, (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* anychar '.' */
|
|
, (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* anytime '*' */
|
|
, (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* zero or one time '?' */
|
|
, (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* one or more time '+' */
|
|
, (OnigCodePoint )ONIG_INEFFECTIVE_META_CHAR /* anychar anytime */
|
|
},
|
|
onigenc_is_mbc_newline_0x0a,
|
|
sjis_mbc_to_code,
|
|
sjis_code_to_mbclen,
|
|
sjis_code_to_mbc,
|
|
sjis_mbc_to_normalize,
|
|
sjis_is_mbc_ambiguous,
|
|
onigenc_ascii_get_all_pair_ambig_codes,
|
|
onigenc_nothing_get_all_comp_ambig_codes,
|
|
sjis_is_code_ctype,
|
|
onigenc_not_support_get_ctype_code_range,
|
|
sjis_left_adjust_char_head,
|
|
sjis_is_allowed_reverse_match
|
|
};
|