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
|
/* Copyright 2009-2014
* Kaz Kylheku <kaz@kylheku.com>
* Vancouver, Canada
* All rights reserved.
*
* Redistribution of this software in source and binary forms, with or without
* modification, is permitted provided that the following two conditions are met.
*
* Use of this software in any manner constitutes agreement with the disclaimer
* which follows the two conditions.
*
* 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 ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED
* WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF
* MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN NO EVENT SHALL THE
* COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DAMAGES, HOWEVER CAUSED,
* AND UNDER ANY THEORY OF LIABILITY, ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <stddef.h>
#include <stdio.h>
#include <stdlib.h>
#include <wchar.h>
#include <setjmp.h>
#include <signal.h>
#include "config.h"
#include "lib.h"
#include "signal.h"
#include "unwind.h"
#include "utf8.h"
#if WCHAR_MAX > 65535
#define FULL_UNICODE
#endif
#ifndef FULL_UNICODE
static void conversion_error(void)
{
uw_throw(range_error_s,
lit("encountered utf-8 character that needs full unicode support"));
}
#endif
size_t utf8_from_uc(wchar_t *wdst, const unsigned char *src)
{
size_t nchar = 1;
enum utf8_state state = utf8_init;
const unsigned char *backtrack = 0;
wchar_t wch = 0, wch_min = 0;
for (;;) {
int ch = *src++;
if (ch == 0) {
if (state == utf8_init)
break;
src = backtrack;
if (wdst)
*wdst++ = 0xDC00 | *src;
nchar++;
state = utf8_init;
continue;
}
switch (state) {
case utf8_init:
switch (ch >> 4) {
case 0x0: case 0x1: case 0x2: case 0x3:
case 0x4: case 0x5: case 0x6: case 0x7:
if (wdst)
*wdst++ = ch;
nchar++;
break;
case 0xC: case 0xD:
state = utf8_more1;
wch = (ch & 0x1F);
wch_min = 0x80;
break;
case 0xE:
state = utf8_more2;
wch = (ch & 0xF);
wch_min = 0x800;
break;
case 0xF:
#ifdef FULL_UNICODE
if (ch < 0xF5) {
state = utf8_more3;
wch = (ch & 0x7);
wch_min = 0x10000;
break;
}
/* fallthrough */
#else
conversion_error();
#endif
default:
if (wdst)
*wdst++ = 0xDC00 | ch;
nchar++;
break;
}
backtrack = src;
break;
case utf8_more1:
case utf8_more2:
case utf8_more3:
if (ch >= 0x80 && ch < 0xC0) {
wch <<= 6;
wch |= (ch & 0x3F);
state = (enum utf8_state) (state - 1);
if (state == utf8_init) {
if (wch < wch_min ||
(wch <= 0xFFFF && (wch & 0xFF00) == 0xDC00) ||
(wch > 0x10FFFF))
{
src = backtrack;
if (wdst)
*wdst++ = 0xDC00 | *src;
} else {
if (wdst)
*wdst++ = wch;
}
nchar++;
}
} else {
src = backtrack;
if (wdst)
*wdst++ = 0xDC00 | *src;
nchar++;
state = utf8_init;
}
break;
}
}
if (wdst)
*wdst++ = 0;
return nchar;
}
size_t utf8_from(wchar_t *wdst, const char *src)
{
return utf8_from_uc(wdst, (const unsigned char *) src);
}
size_t utf8_to_uc(unsigned char *dst, const wchar_t *wsrc)
{
size_t nbyte = 1;
wchar_t wch;
while ((wch = *wsrc++)) {
if (wch < 0x80) {
nbyte += 1;
if (dst)
*dst++ = wch;
} else if (wch < 0x800) {
nbyte += 2;
if (dst) {
*dst++ = 0xC0 | (wch >> 6);
*dst++ = 0x80 | (wch & 0x3F);
}
} else if (wch < 0x10000) {
if ((wch & 0xFF00) == 0xDC00) {
nbyte += 1;
if (dst)
*dst++ = (wch & 0xFF);
} else {
nbyte += 3;
if (dst) {
*dst++ = 0xE0 | (wch >> 12);
*dst++ = 0x80 | ((wch >> 6) & 0x3F);
*dst++ = 0x80 | (wch & 0x3F);
}
}
} else if (wch < 0x110000) {
nbyte += 4;
if (dst) {
*dst++ = 0xF0 | (wch >> 18);
*dst++ = 0x80 | ((wch >> 12) & 0x3F);
*dst++ = 0x80 | ((wch >> 6) & 0x3F);
*dst++ = 0x80 | (wch & 0x3F);
}
}
}
if (dst)
*dst++ = 0;
return nbyte;
}
size_t utf8_to(char *dst, const wchar_t *wsrc)
{
return utf8_to_uc((unsigned char *) dst, wsrc);
}
wchar_t *utf8_dup_from_uc(const unsigned char *str)
{
size_t nchar = utf8_from_uc(0, str);
wchar_t *wstr = (wchar_t *) chk_malloc(nchar * sizeof *wstr);
utf8_from_uc(wstr, str);
return wstr;
}
wchar_t *utf8_dup_from(const char *str)
{
size_t nchar = utf8_from(0, str);
wchar_t *wstr = (wchar_t *) chk_malloc(nchar * sizeof *wstr);
utf8_from(wstr, str);
return wstr;
}
unsigned char *utf8_dup_to_uc(const wchar_t *wstr)
{
size_t nbyte = utf8_to_uc(0, wstr);
unsigned char *str = chk_malloc(nbyte);
utf8_to_uc(str, wstr);
return str;
}
char *utf8_dup_to(const wchar_t *wstr)
{
size_t nbyte = utf8_to(0, wstr);
char *str = (char *) chk_malloc(nbyte);
utf8_to(str, wstr);
return str;
}
int utf8_encode(wchar_t wch, int (*put)(int ch, mem_t *ctx), mem_t *ctx)
{
if (wch < 0x80) {
return put(wch, ctx);
} else if (wch < 0x800) {
return put(0xC0 | (wch >> 6), ctx) &&
put(0x80 | (wch & 0x3F), ctx);
} else if (wch < 0x10000) {
if ((wch & 0xFF00) == 0xDC00) {
return put(wch & 0xFF, ctx);
} else {
return put(0xE0 | (wch >> 12), ctx) &&
put(0x80 | ((wch >> 6) & 0x3F), ctx) &&
put(0x80 | (wch & 0x3F), ctx);
}
} else if (wch < 0x110000) {
return put(0xF0 | (wch >> 18), ctx) &&
put(0x80 | ((wch >> 12) & 0x3F), ctx) &&
put(0x80 | ((wch >> 6) & 0x3F), ctx) &&
put(0x80 | (wch & 0x3F), ctx);
}
return 0;
}
void utf8_decoder_init(utf8_decoder_t *ud)
{
ud->state = utf8_init;
ud->flags = 0;
ud->wch = 0;
ud->head = ud->tail = ud->back = 0;
}
wint_t utf8_decode(utf8_decoder_t *ud, int (*get)(mem_t *ctx), mem_t *ctx)
{
for (;;) {
int ch;
if (ud->tail != ud->head) {
ch = ud->buf[ud->tail];
ud->tail = (ud->tail + 1) % 8;
} else {
ch = get(ctx);
ud->buf[ud->head] = ch;
ud->head = ud->tail = (ud->head + 1) % 8;
}
if (ch == EOF) {
if (ud->state == utf8_init) {
return WEOF;
} else {
wchar_t wch = 0xDC00 | ud->buf[ud->back];
ud->tail = ud->back = (ud->back + 1) % 8;
ud->state = utf8_init;
return wch;
}
}
switch (ud->state) {
case utf8_init:
switch (ch >> 4) {
case 0x0: case 0x1: case 0x2: case 0x3:
case 0x4: case 0x5: case 0x6: case 0x7:
ud->back = ud->tail;
if (ch == 0 && (ud->flags & UTF8_ADMIT_NUL) == 0)
return 0xDC00;
return ch;
case 0xC: case 0xD:
ud->state = utf8_more1;
ud->wch = (ch & 0x1F);
ud->wch_min = 0x80;
break;
case 0xE:
ud->state = utf8_more2;
ud->wch = (ch & 0xF);
ud->wch_min = 0x800;
break;
case 0xF:
#ifdef FULL_UNICODE
if (ch < 0xF5) {
ud->state = utf8_more3;
ud->wch = (ch & 0x7);
ud->wch_min = 0x100000;
break;
}
/* fallthrough */
#else
conversion_error();
#endif
default:
ud->back = ud->tail;
return 0xDC00 | ch;
}
break;
case utf8_more1:
case utf8_more2:
case utf8_more3:
if (ch >= 0x80 && ch < 0xC0) {
ud->wch <<= 6;
ud->wch |= (ch & 0x3F);
ud->state = (enum utf8_state) (ud->state - 1);
if (ud->state == utf8_init) {
if (ud->wch < ud->wch_min ||
(ud->wch <= 0xFFFF && (ud->wch & 0xFF00) == 0xDC00) ||
(ud->wch > 0x10FFFF))
{
wchar_t wch = 0xDC00 | ud->buf[ud->back];
ud->tail = ud->back = (ud->back + 1) % 8;
return wch;
} else {
ud->back = ud->tail;
return ud->wch;
}
}
} else {
wchar_t wch = 0xDC00 | ud->buf[ud->back];
ud->tail = ud->back = (ud->back + 1) % 8;
ud->state = utf8_init;
return wch;
}
break;
}
}
}
FILE *w_fopen(const wchar_t *wname, const wchar_t *wmode)
{
char *name = utf8_dup_to(wname);
char *mode = utf8_dup_to(wmode);
FILE *f = fopen(name, mode);
free(name);
free(mode);
return f;
}
FILE *w_popen(const wchar_t *wcmd, const wchar_t *wmode)
{
char *cmd = utf8_dup_to(wcmd);
char *mode = utf8_dup_to(wmode);
FILE *f = popen(cmd, mode);
free(cmd);
free(mode);
return f;
}
FILE *w_freopen(const wchar_t *wname, const wchar_t *wmode, FILE *fold)
{
char *name = utf8_dup_to(wname);
char *mode = utf8_dup_to(wmode);
FILE *f = fold ? freopen(name, mode, fold) : fopen(name, mode);
free(name);
free(mode);
return f;
}
int w_remove(const wchar_t *wpath)
{
char *path = utf8_dup_to(wpath);
int err = remove(path);
free(path);
return err;
}
int w_rename(const wchar_t *wfrom, const wchar_t *wto)
{
char *from = utf8_dup_to(wfrom);
char *to = utf8_dup_to(wto);
int err = rename(from, to);
free(to);
free(from);
return err;
}
|