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
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
|
/*
Miranda IM: the free IM client for Microsoft* Windows*
Copyright 2000-12 Miranda IM, 2012-13 Miranda NG project,
all portions of this codebase are copyrighted to the people
listed in contributors.txt.
Copyright 2000 Alexandre Julliard of Wine project
(UTF-8 conversion routines)
This program is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public License
as published by the Free Software Foundation; either version 2
of the License, or (at your option) any later version.
This program 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#include "commonheaders.h"
/* number of following bytes in sequence based on first byte value (for bytes above 0x7f) */
static const char utf8_length[128] =
{
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x80-0x8f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0x90-0x9f */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xa0-0xaf */
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, /* 0xb0-0xbf */
0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0xc0-0xcf */
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, /* 0xd0-0xdf */
2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, /* 0xe0-0xef */
3, 3, 3, 3, 3, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 /* 0xf0-0xff */
};
/* first byte mask depending on UTF-8 sequence length */
static const unsigned char utf8_mask[4] = { 0x7f, 0x1f, 0x0f, 0x07 };
/* minimum Unicode value depending on UTF-8 sequence length */
static const unsigned int utf8_minval[4] = { 0x0, 0x80, 0x800, 0x10000 };
/* get the next char value taking surrogates into account */
static unsigned int getSurrogateValue(const wchar_t *src, unsigned int srclen)
{
if (src[0] >= 0xd800 && src[0] <= 0xdfff) { /* surrogate pair */
if (src[0] > 0xdbff || /* invalid high surrogate */
srclen <= 1 || /* missing low surrogate */
src[1] < 0xdc00 || src[1] > 0xdfff) /* invalid low surrogate */
return 0;
return 0x10000 + ((src[0] & 0x3ff) << 10) + (src[1] & 0x3ff);
}
return src[0];
}
/* query necessary dst length for src string */
static int Ucs2toUtf8Len(const wchar_t *src, unsigned int srclen)
{
int len;
unsigned int val;
for (len = 0; srclen; srclen--, src++) {
if (*src < 0x80) { /* 0x00-0x7f: 1 byte */
len++;
continue;
}
if (*src < 0x800) { /* 0x80-0x7ff: 2 bytes */
len += 2;
continue;
}
if ( !(val = getSurrogateValue(src, srclen)))
return -2;
if (val < 0x10000) /* 0x800-0xffff: 3 bytes */
len += 3;
else { /* 0x10000-0x10ffff: 4 bytes */
len += 4;
src++;
srclen--;
}
}
return len;
}
MIR_CORE_DLL(int) Ucs2toUtf8Len(const wchar_t *src)
{
if (src == 0)
return 0;
return Ucs2toUtf8Len(src, (int)wcslen(src));
}
/* wide char to UTF-8 string conversion */
/* return -1 on dst buffer overflow, -2 on invalid input char */
int Ucs2toUtf8(const wchar_t *src, int srclen, char *dst, int dstlen)
{
int len;
for (len = dstlen; srclen; srclen--, src++)
{
WCHAR ch = *src;
unsigned int val;
if (ch < 0x80) /* 0x00-0x7f: 1 byte */
{
if ( !len--) return -1; /* overflow */
*dst++ = ch;
continue;
}
if (ch < 0x800) /* 0x80-0x7ff: 2 bytes */
{
if ((len -= 2) < 0) return -1; /* overflow */
dst[1] = 0x80 | (ch & 0x3f);
ch >>= 6;
dst[0] = 0xc0 | ch;
dst += 2;
continue;
}
if ( !(val = getSurrogateValue(src, srclen)))
{
return -2;
}
if (val < 0x10000) /* 0x800-0xffff: 3 bytes */
{
if ((len -= 3) < 0) return -1; /* overflow */
dst[2] = 0x80 | (val & 0x3f);
val >>= 6;
dst[1] = 0x80 | (val & 0x3f);
val >>= 6;
dst[0] = 0xe0 | val;
dst += 3;
}
else /* 0x10000-0x10ffff: 4 bytes */
{
if ((len -= 4) < 0) return -1; /* overflow */
dst[3] = 0x80 | (val & 0x3f);
val >>= 6;
dst[2] = 0x80 | (val & 0x3f);
val >>= 6;
dst[1] = 0x80 | (val & 0x3f);
val >>= 6;
dst[0] = 0xf0 | val;
dst += 4;
src++;
srclen--;
}
}
return dstlen - len;
}
/* helper for the various utf8 mbstowcs functions */
static unsigned int decodeUtf8Char(unsigned char ch, const char **str, const char *strend)
{
unsigned int len = utf8_length[ch-0x80];
unsigned int res = ch & utf8_mask[len];
const char *end = *str + len;
if (end > strend) return ~0;
switch(len)
{
case 3:
if ((ch = end[-3] ^ 0x80) >= 0x40) break;
res = (res << 6) | ch;
(*str)++;
case 2:
if ((ch = end[-2] ^ 0x80) >= 0x40) break;
res = (res << 6) | ch;
(*str)++;
case 1:
if ((ch = end[-1] ^ 0x80) >= 0x40) break;
res = (res << 6) | ch;
(*str)++;
if (res < utf8_minval[len]) break;
return res;
}
return ~0;
}
/* query necessary dst length for src string */
static inline int Utf8toUcs2Len(const char *src, int srclen)
{
int ret = 0;
unsigned int res;
const char *srcend = src + srclen;
while (src < srcend)
{
unsigned char ch = *src++;
if (ch < 0x80) /* special fast case for 7-bit ASCII */
{
ret++;
continue;
}
if ((res = decodeUtf8Char(ch, &src, srcend)) <= 0x10ffff)
{
if (res > 0xffff) ret++;
ret++;
}
else return -2; /* bad char */
/* otherwise ignore it */
}
return ret;
}
/* UTF-8 to wide char string conversion */
/* return -1 on dst buffer overflow, -2 on invalid input char */
int Utf8toUcs2(const char *src, int srclen, wchar_t *dst, int dstlen)
{
unsigned int res;
const char *srcend = src + srclen;
wchar_t *dstend = dst + dstlen;
while ((dst < dstend) && (src < srcend))
{
unsigned char ch = *src++;
if (ch < 0x80) /* special fast case for 7-bit ASCII */
{
*dst++ = ch;
continue;
}
if ((res = decodeUtf8Char(ch, &src, srcend)) <= 0xffff)
{
*dst++ = res;
}
else if (res <= 0x10ffff) /* we need surrogates */
{
if (dst == dstend - 1) return -1; /* overflow */
res -= 0x10000;
*dst++ = 0xd800 | (res >> 10);
*dst++ = 0xdc00 | (res & 0x3ff);
}
else return -2; /* bad char */
/* otherwise ignore it */
}
if (src < srcend) return -1; /* overflow */
return dstlen - (dstend - dst);
}
/////////////////////////////////////////////////////////////////////////////////////////
// Utf8Decode - converts UTF8-encoded string to the UCS2/MBCS format
MIR_CORE_DLL(char*) Utf8DecodeCP(char* str, int codepage, wchar_t** ucs2)
{
int len;
bool needs_free = false;
wchar_t* tempBuf = NULL;
if (ucs2)
*ucs2 = NULL;
if (str == NULL)
return NULL;
len = (int)strlen(str);
if (len < 2) {
if (ucs2 != NULL) {
*ucs2 = tempBuf = (wchar_t*)mir_alloc((len + 1) * sizeof(wchar_t));
MultiByteToWideChar(codepage, 0, str, len, tempBuf, len);
tempBuf[len] = 0;
}
return str;
}
int destlen = Utf8toUcs2Len(str, len);
if (destlen < 0)
return NULL;
if (ucs2 == NULL) {
__try
{
tempBuf = (wchar_t*)alloca((destlen + 1) * sizeof(wchar_t));
}
__except(EXCEPTION_EXECUTE_HANDLER)
{
tempBuf = NULL;
needs_free = true;
}
}
if (tempBuf == NULL) {
tempBuf = (wchar_t*)mir_alloc((destlen + 1) * sizeof(wchar_t));
if (tempBuf == NULL)
return NULL;
}
Utf8toUcs2(str, len, tempBuf, destlen);
tempBuf[destlen] = 0;
WideCharToMultiByte(codepage, 0, tempBuf, -1, str, len + 1, "?", NULL);
if (ucs2)
*ucs2 = tempBuf;
else if (needs_free)
mir_free(tempBuf);
return str;
}
MIR_CORE_DLL(char*) Utf8Decode(char* str, wchar_t** ucs2)
{
return Utf8DecodeCP(str, Langpack_GetDefaultCodePage(), ucs2);
}
MIR_CORE_DLL(wchar_t*) Utf8DecodeW(const char* str)
{
if (str == NULL)
return NULL;
int len = (int)strlen(str);
int destlen = Utf8toUcs2Len(str, len);
if (destlen < 0) return NULL;
wchar_t* ucs2 = (wchar_t*)mir_alloc((destlen + 1) * sizeof(wchar_t));
if (ucs2 == NULL) return NULL;
if (Utf8toUcs2(str, len, ucs2, destlen) >= 0)
{
ucs2[destlen] = 0;
return ucs2;
}
mir_free(ucs2);
return NULL;
}
/////////////////////////////////////////////////////////////////////////////////////////
// Utf8Encode - converts MBCS string to the UTF8-encoded format
MIR_CORE_DLL(char*) Utf8EncodeCP(const char* src, int codepage)
{
int len;
bool needs_free = false;
char* result = NULL;
wchar_t* tempBuf;
if (src == NULL)
return NULL;
len = (int)strlen(src);
__try
{
tempBuf = (wchar_t*)alloca((len + 1) * sizeof(wchar_t));
}
__except(EXCEPTION_EXECUTE_HANDLER)
{
tempBuf = (wchar_t*)mir_alloc((len + 1) * sizeof(wchar_t));
if (tempBuf == NULL) return NULL;
needs_free = true;
}
len = MultiByteToWideChar(codepage, 0, src, -1, tempBuf, len + 1);
int destlen = Ucs2toUtf8Len(tempBuf, len);
if (destlen >= 0)
{
result = (char*)mir_alloc(destlen + 1);
if (result)
{
Ucs2toUtf8(tempBuf, len, result, destlen);
result[destlen] = 0;
}
}
if (needs_free)
mir_free(tempBuf);
return result;
}
MIR_CORE_DLL(char*) Utf8Encode(const char* src)
{
return Utf8EncodeCP(src, Langpack_GetDefaultCodePage());
}
/////////////////////////////////////////////////////////////////////////////////////////
// Utf8Encode - converts UCS2 string to the UTF8-encoded format
MIR_CORE_DLL(char*) Utf8EncodeW(const wchar_t* src)
{
if (src == NULL)
return NULL;
int len = (int)wcslen(src);
int destlen = Ucs2toUtf8Len(src, len);
if (destlen < 0) return NULL;
char* result = (char*)mir_alloc(destlen + 1);
if (result == NULL)
return NULL;
Ucs2toUtf8(src, len, result, destlen);
result[destlen] = 0;
return result;
}
/////////////////////////////////////////////////////////////////////////////////////////
// Utf8Encode - converts UCS2 string to the UTF8-encoded format
MIR_CORE_DLL(BOOL) Utf8CheckString(const char* str)
{
int expect_bytes = 0, utf_found = 0;
if (!str) return 0;
while (*str) {
if ((*str & 0x80) == 0) {
/* Looks like an ASCII character */
if (expect_bytes)
/* byte of UTF-8 character expected */
return 0;
}
else {
/* Looks like byte of an UTF-8 character */
if (expect_bytes) {
/* expect_bytes already set: first byte of UTF-8 char already seen */
if ((*str & 0xC0) != 0x80) {
/* again first byte ?!?! */
return 0;
}
}
else {
/* First byte of the UTF-8 character */
/* count initial one bits and set expect_bytes to 1 less */
char ch = *str;
while (ch & 0x80) {
expect_bytes++;
ch = (ch & 0x7f) << 1;
}
}
/* OK, next byte of UTF-8 character */
/* Decrement number of expected bytes */
if (--expect_bytes == 0)
utf_found = 1;
}
str++;
}
return (utf_found && expect_bytes == 0);
}
|