1999-12-28 02:47:44 +01:00
|
|
|
/* Mapping tables from GBK to GB2312 and vice versa.
|
2017-01-01 01:14:16 +01:00
|
|
|
Copyright (C) 1999-2017 Free Software Foundation, Inc.
|
1999-12-28 02:47:44 +01:00
|
|
|
This file is part of the GNU C Library.
|
|
|
|
Contributed by Ulrich Drepper <drepper@cygnus.com>, 1999.
|
|
|
|
|
|
|
|
The GNU C Library is free software; you can redistribute it and/or
|
2001-07-06 06:58:11 +02:00
|
|
|
modify it under the terms of the GNU Lesser General Public
|
|
|
|
License as published by the Free Software Foundation; either
|
|
|
|
version 2.1 of the License, or (at your option) any later version.
|
1999-12-28 02:47:44 +01:00
|
|
|
|
|
|
|
The GNU C Library is distributed in the hope that it will be useful,
|
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
2001-07-06 06:58:11 +02:00
|
|
|
Lesser General Public License for more details.
|
1999-12-28 02:47:44 +01:00
|
|
|
|
2001-07-06 06:58:11 +02:00
|
|
|
You should have received a copy of the GNU Lesser General Public
|
2012-02-10 00:18:22 +01:00
|
|
|
License along with the GNU C Library; if not, see
|
|
|
|
<http://www.gnu.org/licenses/>. */
|
1999-12-28 02:47:44 +01:00
|
|
|
|
2000-06-12 21:47:50 +02:00
|
|
|
#include <dlfcn.h>
|
1999-12-28 02:47:44 +01:00
|
|
|
#include <gconv.h>
|
|
|
|
#include <stdint.h>
|
|
|
|
|
|
|
|
|
|
|
|
/* Definitions used in the body of the `gconv' function. */
|
|
|
|
#define CHARSET_NAME "GBK//"
|
|
|
|
#define FROM_LOOP from_gbk_to_gb
|
|
|
|
#define TO_LOOP from_gb_to_gbk
|
|
|
|
#define DEFINE_INIT 1
|
|
|
|
#define DEFINE_FINI 1
|
|
|
|
#define MIN_NEEDED_FROM 1
|
|
|
|
#define MAX_NEEDED_FROM 2
|
|
|
|
#define MIN_NEEDED_TO 1
|
|
|
|
#define MAX_NEEDED_TO 2
|
2014-05-01 22:42:40 +02:00
|
|
|
#define ONE_DIRECTION 0
|
1999-12-28 02:47:44 +01:00
|
|
|
|
|
|
|
|
1999-12-28 03:59:59 +01:00
|
|
|
/* First define the conversion function from GBK to GB2312. */
|
1999-12-28 02:47:44 +01:00
|
|
|
#define MIN_NEEDED_INPUT MIN_NEEDED_FROM
|
|
|
|
#define MAX_NEEDED_INPUT MAX_NEEDED_FROM
|
|
|
|
#define MIN_NEEDED_OUTPUT MIN_NEEDED_TO
|
2000-04-09 19:43:29 +02:00
|
|
|
#define MAX_NEEDED_OUTPUT MAX_NEEDED_TO
|
1999-12-28 02:47:44 +01:00
|
|
|
#define LOOPFCT FROM_LOOP
|
|
|
|
#define BODY \
|
|
|
|
{ \
|
|
|
|
uint32_t ch = *inptr; \
|
|
|
|
\
|
|
|
|
if (ch <= 0x7f) \
|
|
|
|
*outptr++ = *inptr++; \
|
|
|
|
else \
|
|
|
|
{ \
|
|
|
|
/* It's a two-byte sequence. We have to mask out all the sequences \
|
|
|
|
which are not in GB2312. Besides all of them in the range \
|
|
|
|
0x8140 to 0xA0FE this also includes in the remaining range the \
|
|
|
|
sequences which the second byte being in the range from 0x40 to \
|
|
|
|
0xA0 and the following exceptions: \
|
|
|
|
\
|
|
|
|
0xA2A1 to 0xA2A9, \
|
|
|
|
0xA2AA, \
|
|
|
|
0xA6E0 to 0xA6EB, \
|
|
|
|
0xA6EE to 0xA6F2, \
|
|
|
|
0xA6F4, 0xA6F5, \
|
|
|
|
0xA8BB to 0xA8C0 \
|
|
|
|
\
|
|
|
|
All these characters are not defined in GB2312. Besides this \
|
|
|
|
there is an incomatibility in the mapping. The Unicode tables \
|
|
|
|
say that 0xA1A4 maps in GB2312 to U30FB while in GBK it maps to \
|
2000-09-25 23:37:47 +02:00
|
|
|
U00B7. Similarly, 0xA1AA maps in GB2312 to U2015 while in GBK \
|
|
|
|
it maps to U2014. Since we are free to do whatever we want if \
|
|
|
|
a mapping is not available we will not flag this as an error \
|
|
|
|
but instead map the two positions. But this means that the \
|
|
|
|
mapping \
|
1999-12-28 02:47:44 +01:00
|
|
|
\
|
1999-12-28 03:59:59 +01:00
|
|
|
UCS4 -> GB2312 -> GBK -> UCS4 \
|
1999-12-28 02:47:44 +01:00
|
|
|
\
|
|
|
|
might not produce identical text. */ \
|
2014-02-10 14:45:42 +01:00
|
|
|
if (__glibc_unlikely (inptr + 1 >= inend)) \
|
1999-12-28 02:47:44 +01:00
|
|
|
{ \
|
|
|
|
/* The second character is not available. Store \
|
|
|
|
the intermediate result. */ \
|
|
|
|
result = __GCONV_INCOMPLETE_INPUT; \
|
|
|
|
break; \
|
|
|
|
} \
|
|
|
|
\
|
2014-02-10 14:45:42 +01:00
|
|
|
if (__glibc_unlikely (outend - outptr < 2)) \
|
1999-12-28 03:59:59 +01:00
|
|
|
{ \
|
|
|
|
/* We ran out of space. */ \
|
|
|
|
result = __GCONV_FULL_OUTPUT; \
|
|
|
|
break; \
|
|
|
|
} \
|
|
|
|
\
|
1999-12-28 02:47:44 +01:00
|
|
|
ch = (ch << 8) | inptr[1]; \
|
|
|
|
\
|
2000-09-25 23:37:47 +02:00
|
|
|
/* Map 0xA844 (U2015 in GBK) to 0xA1AA (U2015 in GB2312). */ \
|
2014-02-10 14:45:42 +01:00
|
|
|
if (__glibc_unlikely (ch == 0xa844)) \
|
2000-09-25 23:37:47 +02:00
|
|
|
ch = 0xa1aa; \
|
|
|
|
\
|
1999-12-28 02:47:44 +01:00
|
|
|
/* Now determine whether the character is valid. */ \
|
2001-08-04 00:09:42 +02:00
|
|
|
if (__builtin_expect (ch < 0xa1a1, 0) \
|
|
|
|
|| __builtin_expect (ch > 0xf7fe, 0) \
|
|
|
|
|| __builtin_expect (inptr[1] < 0xa1, 0) \
|
2000-06-06 05:16:30 +02:00
|
|
|
/* Now test the exceptions. */ \
|
2001-08-04 00:09:42 +02:00
|
|
|
|| (__builtin_expect (ch >= 0xa2a1, 0) \
|
2002-06-28 23:23:06 +02:00
|
|
|
&& __builtin_expect (ch <= 0xa2aa, 0)) \
|
2001-08-04 00:09:42 +02:00
|
|
|
|| (__builtin_expect (ch >= 0xa6e0, 0) \
|
2002-06-28 23:23:06 +02:00
|
|
|
&& __builtin_expect (ch <= 0xa6f5, 0)) \
|
2001-08-04 00:09:42 +02:00
|
|
|
|| (__builtin_expect (ch >= 0xa8bb, 0) \
|
2002-06-28 23:23:06 +02:00
|
|
|
&& __builtin_expect (ch <= 0xa8c0, 0))) \
|
1999-12-28 02:47:44 +01:00
|
|
|
{ \
|
2000-06-06 05:16:30 +02:00
|
|
|
/* One of the characters we cannot map. */ \
|
2002-06-28 23:23:06 +02:00
|
|
|
STANDARD_TO_LOOP_ERR_HANDLER (2); \
|
1999-12-28 02:47:44 +01:00
|
|
|
} \
|
2000-06-19 23:12:06 +02:00
|
|
|
\
|
|
|
|
/* Copy the two bytes. */ \
|
|
|
|
*outptr++ = *inptr++; \
|
|
|
|
*outptr++ = *inptr++; \
|
1999-12-28 02:47:44 +01:00
|
|
|
} \
|
|
|
|
}
|
2000-06-12 21:47:50 +02:00
|
|
|
#define LOOP_NEED_FLAGS
|
1999-12-28 02:47:44 +01:00
|
|
|
#include <iconv/loop.c>
|
|
|
|
|
|
|
|
|
|
|
|
/* Next, define the other direction. */
|
|
|
|
#define MIN_NEEDED_INPUT MIN_NEEDED_TO
|
2000-04-09 19:43:29 +02:00
|
|
|
#define MAX_NEEDED_INPUT MAX_NEEDED_TO
|
1999-12-28 02:47:44 +01:00
|
|
|
#define MIN_NEEDED_OUTPUT MIN_NEEDED_FROM
|
|
|
|
#define MAX_NEEDED_OUTPUT MAX_NEEDED_FROM
|
|
|
|
#define LOOPFCT TO_LOOP
|
|
|
|
#define BODY \
|
|
|
|
{ \
|
|
|
|
/* We don't have to care about characters we cannot map. The only \
|
2000-09-25 23:37:47 +02:00
|
|
|
problem are the mapping of 0xA1A4 and 0xA1AA but as explained above \
|
|
|
|
we do not do anything special here. */ \
|
1999-12-28 02:47:44 +01:00
|
|
|
unsigned char ch = *inptr++; \
|
|
|
|
\
|
|
|
|
if (ch > 0x7f) \
|
|
|
|
{ \
|
2014-02-10 14:45:42 +01:00
|
|
|
if (__glibc_unlikely (inptr + 1 >= inend)) \
|
1999-12-28 03:59:59 +01:00
|
|
|
{ \
|
|
|
|
/* The second character is not available. Store \
|
|
|
|
the intermediate result. */ \
|
2000-04-09 19:43:29 +02:00
|
|
|
result = __GCONV_INCOMPLETE_INPUT; \
|
|
|
|
break; \
|
1999-12-28 03:59:59 +01:00
|
|
|
} \
|
|
|
|
\
|
2014-02-10 14:45:42 +01:00
|
|
|
if (__glibc_unlikely (outend - outptr < 2)) \
|
1999-12-28 03:59:59 +01:00
|
|
|
{ \
|
|
|
|
/* We ran out of space. */ \
|
|
|
|
result = __GCONV_FULL_OUTPUT; \
|
|
|
|
break; \
|
|
|
|
} \
|
|
|
|
\
|
1999-12-28 02:47:44 +01:00
|
|
|
*outptr++ = ch; \
|
|
|
|
ch = *inptr++; \
|
|
|
|
} \
|
|
|
|
*outptr++ = ch; \
|
|
|
|
}
|
|
|
|
#include <iconv/loop.c>
|
|
|
|
|
|
|
|
|
|
|
|
/* Now define the toplevel functions. */
|
|
|
|
#include <iconv/skeleton.c>
|