-
Notifications
You must be signed in to change notification settings - Fork 50
/
utf8.c
571 lines (500 loc) · 16.5 KB
/
utf8.c
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
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
/* ################################################################### */
/* Copyright 2015, Pierre Gentile ([email protected]) */
/* */
/* This Source Code Form is subject to the terms of the Mozilla Public */
/* License, v. 2.0. If a copy of the MPL was not distributed with this */
/* file, You can obtain one at https://mozilla.org/MPL/2.0/. */
/* ################################################################### */
/* ************************************* */
/* Various UTF-8 manipulation functions. */
/* ************************************* */
#include <stdio.h>
#include <stdlib.h>
#include <stdarg.h>
#include <string.h>
#include <ctype.h>
#include <limits.h>
#include <langinfo.h>
#include "xmalloc.h"
#include "utf8.h"
/* =========================================================== */
/* UTF-8 byte sequence generation from a given UCS-4 codepoint */
/* utf8_str must be preallocated with a size of at least 5 */
/* bytes. */
/* return the length of the generated sequence or 0 if c is */
/* not a valid codepoint. */
/* =========================================================== */
int
cptoutf8(char *utf8_str, uint32_t c)
{
int len = 0;
if (c < 0x80)
{
utf8_str[0] = c;
len = 1;
}
else if (c < 0x800)
{
utf8_str[0] = 0xC0 | ((c >> 6) & 0x1F);
utf8_str[1] = 0x80 | (c & 0x3F);
len = 2;
}
else if (c < 0x10000)
{
utf8_str[0] = 0xE0 | ((c >> 12) & 0x0F);
utf8_str[1] = 0x80 | ((c >> 6) & 0x3F);
utf8_str[2] = 0x80 | (c & 0x3F);
len = 3;
}
else if (c < 0x110000)
{
utf8_str[0] = 0xF0 | ((c >> 18) & 0x07);
utf8_str[1] = 0x80 | ((c >> 12) & 0x3F);
utf8_str[2] = 0x80 | ((c >> 6) & 0x3F);
utf8_str[3] = 0x80 | (c & 0x3F);
len = 4;
}
return len;
}
/* ======================================================================= */
/* Unicode (UTF-8) ASCII representation interpreter. */
/* The string passed will be altered but its address will not change. */
/* All hexadecimal sequences of \uxx, \uxxxx, \uxxxxxx and \uxxxxxxxx will */
/* be replaced by the corresponding UTF-8 character when possible. */
/* All hexadecimal sequences of \Uxxxxxx will be replaced with the UTF-8 */
/* sequence corresponding to the given UCS-4 codepoint. */
/* When not possible the substitution character is substituted in place. */
/* Returns 0 if the conversion has failed else 1. */
/* ======================================================================= */
int
utf8_interpret(char *s, char substitute)
{
char *utf8_str; /* \uxx... */
size_t utf8_to_eos_len; /* bytes in s starting from the first *
* occurrence of \u. */
size_t init_len; /* initial lengths of the string to interpret */
size_t utf8_ascii_len; /* 2,4,6 or 8 bytes. */
size_t len_to_remove = 0; /* number of bytes to remove after the *
| conversion. */
char tmp[9]; /* temporary string. */
int rc = 1; /* return code, 0: error, 1: fine. */
/* Guard against the case where s is NULL. */
/* """"""""""""""""""""""""""""""""""""""" */
if (s == NULL)
return 0;
init_len = strlen(s);
/* Manage \U codepoints. */
/* """"""""""""""""""""" */
while ((utf8_str = strstr(s,
"\\"
"U"))
!= NULL)
{
int utf8_str_len;
int n;
uint32_t cp;
int subst; /* 0, the \U sequence is valid, else 1. */
utf8_to_eos_len = strlen(utf8_str);
utf8_str_len = 0;
n = sscanf(utf8_str + 2,
"%6["
"0123456789"
"abcdef"
"ABCDEF"
"]%n",
tmp,
&utf8_str_len);
subst = 0;
if (n == 1 && utf8_str_len == 6)
{
sscanf(tmp, "%x", &cp);
if (cp > 0x10FFFF)
subst = 1; /* Invalid range. */
else
{
char str[7];
int len;
len = cptoutf8(str, cp);
str[len] = '\0';
*(utf8_str + 1) = 'u';
memmove(utf8_str, str, len);
memmove(utf8_str + len, utf8_str + 8, utf8_to_eos_len - 8);
len_to_remove += 8 - len;
}
}
else
subst = 1; /* Invalid sequence. */
/* In case of invalid \U sequence, replace it with the */
/* substitution character. */
/* ''''''''''''''''''''''''''''''''''''''''''''''''''' */
if (subst)
{
*utf8_str = substitute;
memmove(utf8_str + 1,
utf8_str + 2 + utf8_str_len,
utf8_to_eos_len - (utf8_str_len + 2 - 1));
len_to_remove += utf8_str_len + 2 - 1;
}
}
/* Make sure that the string is well terminated. */
/* """"""""""""""""""""""""""""""""""""""""""""" */
*(s + init_len - len_to_remove) = '\0';
/* Manage \u UTF-8 byte sequences. */
/* """"""""""""""""""""""""""""""" */
while ((utf8_str = strstr(s,
"\\"
"u"))
!= NULL)
{
utf8_to_eos_len = strlen(utf8_str);
if (utf8_to_eos_len < 4) /* string too short to contain *
| a valid UTF-8 char. */
{
*utf8_str = substitute;
*(utf8_str + 1) = '\0';
rc = 0;
}
else /* s is long enough. */
{
unsigned byte;
char *utf8_seq_offset = utf8_str + 2;
/* Get the first 2 UTF-8 bytes. */
/* """""""""""""""""""""""""""" */
*tmp = *utf8_seq_offset;
*(tmp + 1) = *(utf8_seq_offset + 1);
*(tmp + 2) = '\0';
/* If they are invalid, replace the \u sequence by the */
/* substitute character. */
/* """"""""""""""""""""""""""""""""""""""""""""""""""" */
if (!isxdigit(tmp[0]) || !isxdigit(tmp[1]))
{
*utf8_str = substitute;
if (4 >= utf8_to_eos_len)
*(utf8_str + 1) = '\0';
else
{
/* Do not forget the training \0. */
/* """""""""""""""""""""""""""""" */
memmove(utf8_str + 1, utf8_str + 4, utf8_to_eos_len - 4 + 1);
}
rc = 0;
}
else
{
char end;
size_t i;
char b[3] = { ' ', ' ', '\0' };
/* They are valid, deduce from them the length of the sequence. */
/* """""""""""""""""""""""""""""""""""""""""""""""""""""""""""" */
sscanf(tmp, "%2x", &byte);
utf8_ascii_len = utf8_get_length(byte) * 2;
/* replace the \u sequence by the bytes forming the UTF-8 char. */
/* """""""""""""""""""""""""""""""""""""""""""""""""""""""""""" */
/* Put the bytes in the tmp string. */
/* '''''''''''''''''''''''''''''''' */
*tmp = byte; /* Reuse the tmp array. */
for (i = 1; i < utf8_ascii_len / 2; i++)
{
int good = 1;
int n;
n = sscanf(utf8_seq_offset + 2 * i, "%c%c", &b[0], &b[1]);
if (n == 2)
{
byte = 0;
end = '\0';
sscanf(b, "%x%c", &byte, &end);
if (byte == 0 || end != '\0' || (byte & 0xc0) != 0x80)
good = 0;
}
else
good = 0;
if (good)
*(tmp + i) = byte;
else
utf8_ascii_len = 2 * i; /* Force the new length according to the *
| number of valid UTF-8 bytes read. */
}
tmp[utf8_ascii_len / 2] = '\0';
/* Does they form a valid UTF-8 char? */
/* '''''''''''''''''''''''''''''''''' */
if (utf8_validate(tmp) == NULL)
{
/* Put them back in the original string and move */
/* the remaining bytes after them. */
/* ''''''''''''''''''''''''''''''''''''''''''''' */
memmove(utf8_str, tmp, utf8_ascii_len / 2);
if (utf8_to_eos_len < utf8_ascii_len)
*(utf8_str + utf8_ascii_len / 2 + 1) = '\0';
else
memmove(utf8_str + utf8_ascii_len / 2,
utf8_seq_offset + utf8_ascii_len,
utf8_to_eos_len - utf8_ascii_len - 2 + 1);
}
else
{
/* The invalid sequence is replaced by a */
/* substitution character. */
/* ''''''''''''''''''''''''''''''''''''' */
*utf8_str = substitute;
if (utf8_to_eos_len < utf8_ascii_len)
*(utf8_str + 1) = '\0';
else
memmove(utf8_str + 1,
utf8_seq_offset + utf8_ascii_len,
utf8_to_eos_len - utf8_ascii_len - 2 + 1);
utf8_ascii_len = 2;
rc = 0;
}
/* Update the number of bytes to remove at the end */
/* of the initial string. */
/* """"""""""""""""""""""""""""""""""""""""""""""" */
len_to_remove += 2 + utf8_ascii_len / 2;
}
}
}
/* Make sure that the string is well terminated. */
/* """"""""""""""""""""""""""""""""""""""""""""" */
*(s + init_len - len_to_remove) = '\0';
return rc;
}
/* ========================================================= */
/* Decodes the number of bytes taken by a UTF-8 glyph. */
/* It is the length of the leading sequence of bits set to 1 */
/* in the first byte. */
/* ========================================================= */
int
utf8_get_length(unsigned char c)
{
if (c < 0x80)
return 1;
else if (c < 0xe0)
return 2;
else if (c < 0xf0)
return 3;
return 4;
}
/* ==================================================== */
/* Returns the byte offset of the nth UTF-8 glyph in s. */
/* ==================================================== */
size_t
utf8_offset(char const *s, size_t n)
{
size_t i = 0;
while (n > 0)
{
if (s[i++] & 0x80)
{
(void)(((s[++i] & 0xc0) != 0x80) || ((s[++i] & 0xc0) != 0x80) || ++i);
}
n--;
}
return i;
}
/* ============================================== */
/* Points to the previous UTF-8 glyph in a string */
/* from the given position. */
/* ============================================== */
char *
utf8_prev(const char *str, const char *p)
{
while ((*p & 0xc0) == 0x80)
p--;
for (--p; p >= str; --p)
{
if ((*p & 0xc0) != 0x80)
return (char *)p;
}
return NULL;
}
/* ========================================== */
/* Points to the next UTF-8 glyph in a string */
/* from the current position. */
/* ========================================== */
char *
utf8_next(char *p)
{
if (*p)
{
for (++p; (*p & 0xc0) == 0x80; ++p)
;
}
return *p == '\0' ? NULL : p;
}
/* ============================================================= */
/* Replaces any UTF-8 glyph present in s by a substitution */
/* character in-place. */
/* s will be modified but its address in memory will not change. */
/* ============================================================= */
void
utf8_sanitize(char *s, char substitute)
{
char *p = s;
size_t len;
len = strlen(s);
while (*p)
{
int n;
n = utf8_get_length(*p);
if (n > 1)
{
*p = substitute;
memmove(p + 1, p + n, len - (p - s) - n + 1);
len -= (n - 1);
}
p++;
}
}
/* ======================================================================= */
/* This function scans the '\0'-terminated string starting at s. */
/* It returns a pointer to the first byte of the first malformed */
/* or overlong UTF-8 sequence found, or NULL if the string contains only */
/* correct UTF-8. */
/* It also spots UTF-8 sequences that could cause trouble if converted to */
/* UTF-16, namely surrogate characters (U+D800..U+DFFF) and non-Unicode */
/* positions (U+FFFE..U+FFFF). */
/* This routine is very likely to find a malformed sequence if the input */
/* uses any other encoding than UTF-8. */
/* It therefore can be used as a very effective heuristic for */
/* distinguishing between UTF-8 and other encodings. */
/* */
/* I wrote this code mainly as a specification of functionality; there */
/* are no doubt performance optimizations possible for certain CPUs. */
/* */
/* Markus Kuhn <http://www.cl.cam.ac.uk/~mgk25/> -- 2005-03-30 */
/* License: http://www.cl.cam.ac.uk/~mgk25/short-license.html */
/* ======================================================================= */
char *
utf8_validate(char *s)
{
unsigned char *us = (unsigned char *)s;
/* clang-format off */
while (*us)
{
if (*us < 0x80)
/* 0xxxxxxx */
us++;
else if ((us[0] & 0xe0) == 0xc0)
{
/* 110XXXXx 10xxxxxx */
if ((us[1] & 0xc0) != 0x80 || (us[0] & 0xfe) == 0xc0) /* overlong? */
return (char *)us;
us += 2;
}
else if ((us[0] & 0xf0) == 0xe0)
{
/* 1110XXXX 10Xxxxxx 10xxxxxx */
if ((us[1] & 0xc0) != 0x80 ||
(us[2] & 0xc0) != 0x80 ||
(us[0] == 0xe0 && (us[1] & 0xe0) == 0x80) || /* overlong? */
(us[0] == 0xed && (us[1] & 0xe0) == 0xa0) || /* surrogate? */
(us[0] == 0xef && us[1] == 0xbf &&
(us[2] & 0xfe) == 0xbe)) /* U+FFFE or U+FFFF? */
return (char *)us;
us += 3;
}
else if ((us[0] & 0xf8) == 0xf0)
{
/* 11110XXX 10XXxxxx 10xxxxxx 10xxxxxx */
if ((us[1] & 0xc0) != 0x80 ||
(us[2] & 0xc0) != 0x80 ||
(us[3] & 0xc0) != 0x80 ||
(us[0] == 0xf0 && (us[1] & 0xf0) == 0x80) || /* overlong? */
(us[0] == 0xf4 && us[1] > 0x8f) || us[0] > 0xf4) /* > U+10FFFF? */
return (char *)us;
us += 4;
}
else
return (char *)us;
}
/* clang-format on */
return NULL;
}
/* ======================= */
/* Multibyte UTF-8 strlen. */
/* ======================= */
size_t
utf8_strlen(char const *str)
{
size_t i = 0, j = 0;
while (str[i])
{
if ((str[i] & 0xc0) != 0x80)
j++;
i++;
}
return j;
}
/* ==================================================================== */
/* Multibytes extraction of the prefix of n UTF-8 glyphs from a string. */
/* The destination string d must have been allocated before. */
/* pos is updated to reflect the position AFTER the prefix. */
/* ==================================================================== */
char *
utf8_strprefix(char *d, char const *s, long n, long *pos)
{
long i = 0;
long j = 0;
*pos = 0;
while (s[i] && j < n)
{
d[i] = s[i];
i++;
j++;
while (s[i] && (s[i] & 0xC0) == 0x80)
{
d[i] = s[i];
i++;
}
}
*pos = i;
d[i] = '\0';
return d;
}
/* ================================================== */
/* Converts a UTF-8 glyph string to a wchar_t string. */
/* The returned string must be freed by the caller. */
/* ================================================== */
wchar_t *
utf8_strtowcs(char *s)
{
int converted = 0;
unsigned char *ch;
wchar_t *wptr, *w;
size_t size;
size = (long)strlen(s);
w = xmalloc((size + 1) * sizeof(wchar_t));
w[0] = L'\0';
wptr = w;
for (ch = (unsigned char *)s; *ch; ch += converted)
{
if ((converted = mbtowc(wptr, (char *)ch, 4)) > 0)
wptr++;
else
{
*wptr++ = (wchar_t)*ch;
converted = 1;
}
}
*wptr = L'\0';
return w;
}
/* ============================================================== */
/* Poor man UTF-8 aware strtolower version. */
/* Replaces all ASCII characters in src by its lowercase version. */
/* dst must be preallocated before the call. */
/* ============================================================== */
void
utf8_strtolower(char *dst, char *src)
{
unsigned char c;
while ((c = *src))
{
if (c >= 0x80)
*dst = c;
else
*dst = tolower(c);
src++;
dst++;
}
*dst = '\0';
}