165 lines
5.5 KiB
C
165 lines
5.5 KiB
C
/**********************************************************************
|
|
big5.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 "regenc.h"
|
|
|
|
OnigEncodingDeclare(BIG5);
|
|
|
|
static const int EncLen_BIG5[] = {
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
|
|
1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 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
|
|
};
|
|
|
|
static int
|
|
big5_mbc_enc_len(const UChar* p, const UChar* e, OnigEncoding enc)
|
|
{
|
|
return EncLen_BIG5[*p];
|
|
}
|
|
|
|
static OnigCodePoint
|
|
big5_mbc_to_code(const UChar* p, const UChar* end, OnigEncoding enc)
|
|
{
|
|
return onigenc_mbn_mbc_to_code(&OnigEncodingName(BIG5), p, end);
|
|
}
|
|
|
|
static int
|
|
big5_code_to_mbc(OnigCodePoint code, UChar *buf, OnigEncoding enc)
|
|
{
|
|
return onigenc_mb2_code_to_mbc(&OnigEncodingName(BIG5), code, buf);
|
|
}
|
|
|
|
static int
|
|
big5_mbc_case_fold(OnigCaseFoldType flag, const UChar** pp, const UChar* end,
|
|
UChar* lower, OnigEncoding enc)
|
|
{
|
|
return onigenc_mbn_mbc_case_fold(&OnigEncodingName(BIG5), flag,
|
|
pp, end, lower);
|
|
}
|
|
|
|
#if 0
|
|
static int
|
|
big5_is_mbc_ambiguous(OnigCaseFoldType flag,
|
|
const UChar** pp, const UChar* end, OnigEncoding enc)
|
|
{
|
|
return onigenc_mbn_is_mbc_ambiguous(&OnigEncodingName(BIG5), flag, pp, end);
|
|
}
|
|
#endif
|
|
|
|
static int
|
|
big5_is_code_ctype(OnigCodePoint code, unsigned int ctype, OnigEncoding enc)
|
|
{
|
|
return onigenc_mb2_is_code_ctype(&OnigEncodingName(BIG5), code, ctype);
|
|
}
|
|
|
|
static const char BIG5_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, 1, 1, 0
|
|
};
|
|
|
|
#define BIG5_ISMB_FIRST(byte) (EncLen_BIG5[byte] > 1)
|
|
#define BIG5_ISMB_TRAIL(byte) BIG5_CAN_BE_TRAIL_TABLE[(byte)]
|
|
|
|
static UChar*
|
|
big5_left_adjust_char_head(const UChar* start, const UChar* s, OnigEncoding enc)
|
|
{
|
|
const UChar *p;
|
|
int len;
|
|
|
|
if (s <= start) return (UChar* )s;
|
|
p = s;
|
|
|
|
if (BIG5_ISMB_TRAIL(*p)) {
|
|
while (p > start) {
|
|
if (! BIG5_ISMB_FIRST(*--p)) {
|
|
p++;
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
len = enclen(&OnigEncodingName(BIG5), p, s);
|
|
if (p + len > s) return (UChar* )p;
|
|
p += len;
|
|
return (UChar* )(p + ((s - p) & ~1));
|
|
}
|
|
|
|
static int
|
|
big5_is_allowed_reverse_match(const UChar* s, const UChar* end ARG_UNUSED, OnigEncoding enc)
|
|
{
|
|
const UChar c = *s;
|
|
|
|
return (BIG5_ISMB_TRAIL(c) ? FALSE : TRUE);
|
|
}
|
|
|
|
OnigEncodingDefine(big5, BIG5) = {
|
|
big5_mbc_enc_len,
|
|
"Big5", /* name */
|
|
2, /* max enc length */
|
|
1, /* min enc length */
|
|
onigenc_is_mbc_newline_0x0a,
|
|
big5_mbc_to_code,
|
|
onigenc_mb2_code_to_mbclen,
|
|
big5_code_to_mbc,
|
|
big5_mbc_case_fold,
|
|
onigenc_ascii_apply_all_case_fold,
|
|
onigenc_ascii_get_case_fold_codes_by_str,
|
|
onigenc_minimum_property_name_to_ctype,
|
|
big5_is_code_ctype,
|
|
onigenc_not_support_get_ctype_code_range,
|
|
big5_left_adjust_char_head,
|
|
big5_is_allowed_reverse_match
|
|
};
|