1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/* ***** BEGIN LICENSE BLOCK *****
* Version: MPL 1.1/GPL 2.0/LGPL 2.1
*
* The contents of this file are subject to the Mozilla Public License Version
* 1.1 (the "License"); you may not use this file except in compliance with
* the License. You may obtain a copy of the License at
* http://www.mozilla.org/MPL/
*
* Software distributed under the License is distributed on an "AS IS" basis,
* WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
* for the specific language governing rights and limitations under the
* License.
*
* The Original Code is Mozilla Communicator client code.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1998
* the Initial Developer. All Rights Reserved.
*
* Contributor(s):
*
* Alternatively, the contents of this file may be used under the terms of
* either of the GNU General Public License Version 2 or later (the "GPL"),
* or the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
* in which case the provisions of the GPL or the LGPL are applicable instead
* of those above. If you wish to allow use of your version of this file only
* under the terms of either the GPL or the LGPL, and not to allow others to
* use your version of this file under the terms of the MPL, indicate your
* decision by deleting the provisions above and replace them with the notice
* and other provisions required by the GPL or the LGPL. If you do not delete
* the provisions above, a recipient may use your version of this file under
* the terms of any one of the MPL, the GPL or the LGPL.
*
* ***** END LICENSE BLOCK ***** */
#include "nsGBKConvUtil.h"
#include "gbku.h"
#include "nsCRT.h"
#include "nsICharRepresentable.h"
#define MAX_GBK_LENGTH 24066 /* (0xfe-0x80)*(0xfe-0x3f) */
//--------------------------------------------------------------------
// nsGBKConvUtil
//--------------------------------------------------------------------
static PRBool gInitToGBKTable = PR_FALSE;
static const PRUnichar gGBKToUnicodeTable[MAX_GBK_LENGTH] = {
#include "cp936map.h"
};
static PRUint16 gUnicodeToGBKTable[0xA000-0x4e00];
PRBool nsGBKConvUtil::UnicodeToGBKChar(
PRUnichar aChar, PRBool aToGL, char*
aOutByte1, char* aOutByte2)
{
NS_ASSERTION(gInitToGBKTable, "gGBKToUnicodeTable is not init yet. need to call InitToGBKTable first");
PRBool found=PR_FALSE;
*aOutByte1 = *aOutByte2 = 0;
if(UNICHAR_IN_RANGE(0xd800, aChar, 0xdfff))
{
// surrogate is not in here
return PR_FALSE;
}
if(UNICHAR_IN_RANGE(0x4e00, aChar, 0x9FFF))
{
PRUint16 item = gUnicodeToGBKTable[aChar - 0x4e00];
if(item != 0)
{
*aOutByte1 = item >> 8;
*aOutByte2 = item & 0x00FF;
found = PR_TRUE;
} else {
return PR_FALSE;
}
} else {
// ugly linear search
for( PRInt32 i = 0; i < MAX_GBK_LENGTH; i++ )
{
if( aChar == gGBKToUnicodeTable[i])
{
*aOutByte1 = (i / 0x00BF + 0x0081) ;
*aOutByte2 = (i % 0x00BF + 0x0040) ;
found = PR_TRUE;
break;
}
}
}
if(! found)
return PR_FALSE;
if(aToGL) {
// to GL, we only return if it is in the range
if(UINT8_IN_RANGE(0xA1, *aOutByte1, 0xFE) &&
UINT8_IN_RANGE(0xA1, *aOutByte2, 0xFE))
{
// mask them to GL
*aOutByte1 &= 0x7F;
*aOutByte2 &= 0x7F;
} else {
// if it does not fit into 0xa1-0xfe 0xa1-0xfe range that mean
// it is not a GB2312 character, we cannot map to GL
*aOutByte1 = 0x00;
*aOutByte2 = 0x00;
return PR_FALSE;
}
}
return PR_TRUE;
}
PRUnichar nsGBKConvUtil::GBKCharToUnicode(char aByte1, char aByte2)
{
NS_ASSERTION(UINT8_IN_RANGE(0x81,aByte1, 0xFE), "first byte out of range");
NS_ASSERTION(UINT8_IN_RANGE(0x40,aByte2, 0xFE), "second byte out of range");
PRUint8 i1 = (PRUint8)aByte1;
PRUint8 i2 = (PRUint8)aByte2;
PRUint16 idx = (i1 - 0x0081) * 0x00bf + i2 - 0x0040 ;
NS_ASSERTION(idx < MAX_GBK_LENGTH, "ARB");
// play it safe- add if statement here ot protect ARB
// probably not necessary
if(idx < MAX_GBK_LENGTH)
return gGBKToUnicodeTable[ idx ];
else
return UCS2_NO_MAPPING;
}
void nsGBKConvUtil::InitToGBKTable()
{
if ( gInitToGBKTable )
return;
PRUnichar unicode;
PRUnichar i;
// zap it to zero first
memset(gUnicodeToGBKTable,0, sizeof(gUnicodeToGBKTable));
for ( i=0; i<MAX_GBK_LENGTH; i++ )
{
unicode = gGBKToUnicodeTable[i];
// to reduce size of gUnicodeToGBKTable, we only do direct unicode to GB
// table mapping between unicode 0x4E00 and 0xA000. Others by searching
// gGBKToUnicodeTable. There is a trade off between memory usage and speed.
if(UNICHAR_IN_RANGE(0x4e00, unicode, 0x9fff))
{
unicode -= 0x4E00;
gUnicodeToGBKTable[unicode] = (( i / 0x00BF + 0x0081) << 8) |
( i % 0x00BF+ 0x0040);
}
}
gInitToGBKTable = PR_TRUE;
}
void nsGBKConvUtil::FillInfo(
PRUint32 *aInfo,
PRUint8 aStart1, PRUint8 aEnd1,
PRUint8 aStart2, PRUint8 aEnd2
)
{
PRUint16 i,j, k;
PRUnichar unicode;
for ( i=aStart1; i<=aEnd1; i++)
{
for( j=aStart2; j<=aEnd2; j++)
{
k = (i - 0x0081)*0x00BF +(j-0x0040);
unicode = gGBKToUnicodeTable[k];
NS_ASSERTION(unicode != 0xFFFF, "somehow the table still use 0xffff");
if (unicode != UCS2_NO_MAPPING)
{
SET_REPRESENTABLE(aInfo, unicode);
}
}
}
}
void nsGBKConvUtil::FillGB2312Info(
PRUint32 *aInfo
)
{
// The following range is coded by looking at the GB2312 standard
// and make sure we do not call FillInfo for undefined code point
// Symbol
// row 1 - 1 range (full)
FillInfo(aInfo, 0x21|0x80, 0x21|0x80, 0x21|0x80, 0x7E|0x80);
// row 2 - 3 range
FillInfo(aInfo, 0x22|0x80, 0x22|0x80, (0x20+17)|0x80, (0x20+66)|0x80);
FillInfo(aInfo, 0x22|0x80, 0x22|0x80, (0x20+69)|0x80, (0x20+78)|0x80);
FillInfo(aInfo, 0x22|0x80, 0x22|0x80, (0x20+81)|0x80, (0x20+92)|0x80);
// row 3 - 1 range (full)
FillInfo(aInfo, 0x23|0x80, 0x23|0x80, 0x21|0x80, 0x7E|0x80);
// row 4 - 1 range
FillInfo(aInfo, 0x24|0x80, 0x24|0x80, (0x20+ 1)|0x80, (0x20+83)|0x80);
// row 5 - 1 range
FillInfo(aInfo, 0x25|0x80, 0x25|0x80, (0x20+ 1)|0x80, (0x20+86)|0x80);
// row 6 - 2 range
FillInfo(aInfo, 0x26|0x80, 0x26|0x80, (0x20+ 1)|0x80, (0x20+24)|0x80);
FillInfo(aInfo, 0x26|0x80, 0x26|0x80, (0x20+33)|0x80, (0x20+56)|0x80);
// row 7
FillInfo(aInfo, 0x27|0x80, 0x27|0x80, (0x20+ 1)|0x80, (0x20+33)|0x80);
FillInfo(aInfo, 0x27|0x80, 0x27|0x80, (0x20+49)|0x80, (0x20+81)|0x80);
// row 8
FillInfo(aInfo, 0x28|0x80, 0x28|0x80, (0x20+ 1)|0x80, (0x20+26)|0x80);
FillInfo(aInfo, 0x28|0x80, 0x28|0x80, (0x20+36)|0x80, (0x20+73)|0x80);
// row 9
FillInfo(aInfo, 0x29|0x80, 0x29|0x80, (0x20+ 4)|0x80, (0x20+79)|0x80);
// Frequent used Hanzi
// 3021-567e
FillInfo(aInfo, 0x30|0x80, 0x56|0x80, 0x21|0x80, 0x7E|0x80);
// 5721-5779
FillInfo(aInfo, 0x57|0x80, 0x57|0x80, 0x21|0x80, 0x79|0x80);
// Infrequent used Hanzi
// 5821-777e
FillInfo(aInfo, 0x58|0x80, 0x77|0x80, 0x21|0x80, 0x7E|0x80);
}
|
