blob: 5f96efa79a2441e85a623a7ed45246d5c9c22949 [file] [log] [blame]
Kenny Rootba0165b2010-11-09 14:37:23 -08001/*
2 * Copyright (C) 2005 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
Sergio Giro1cfa56d2016-06-28 18:02:29 +010017#include <log/log.h>
Kenny Rootba0165b2010-11-09 14:37:23 -080018#include <utils/Unicode.h>
19
Sergio Giro9de67762016-07-20 20:01:33 +010020#include <limits.h>
Kenny Rootba0165b2010-11-09 14:37:23 -080021#include <stddef.h>
22
Elliott Hughesadbf4422015-07-29 17:45:24 -070023#if defined(_WIN32)
Kenny Rootba0165b2010-11-09 14:37:23 -080024# undef nhtol
25# undef htonl
26# undef nhtos
27# undef htons
28
Elliott Hughes97ac0e12014-11-21 23:01:59 -080029# define ntohl(x) ( ((x) << 24) | (((x) >> 24) & 255) | (((x) << 8) & 0xff0000) | (((x) >> 8) & 0xff00) )
30# define htonl(x) ntohl(x)
31# define ntohs(x) ( (((x) << 8) & 0xff00) | (((x) >> 8) & 255) )
32# define htons(x) ntohs(x)
Kenny Rootba0165b2010-11-09 14:37:23 -080033#else
34# include <netinet/in.h>
35#endif
36
37extern "C" {
38
39static const char32_t kByteMask = 0x000000BF;
40static const char32_t kByteMark = 0x00000080;
41
42// Surrogates aren't valid for UTF-32 characters, so define some
43// constants that will let us screen them out.
44static const char32_t kUnicodeSurrogateHighStart = 0x0000D800;
Andreas Gampea53c8152014-11-24 09:42:07 -080045// Unused, here for completeness:
46// static const char32_t kUnicodeSurrogateHighEnd = 0x0000DBFF;
47// static const char32_t kUnicodeSurrogateLowStart = 0x0000DC00;
Kenny Rootba0165b2010-11-09 14:37:23 -080048static const char32_t kUnicodeSurrogateLowEnd = 0x0000DFFF;
49static const char32_t kUnicodeSurrogateStart = kUnicodeSurrogateHighStart;
50static const char32_t kUnicodeSurrogateEnd = kUnicodeSurrogateLowEnd;
51static const char32_t kUnicodeMaxCodepoint = 0x0010FFFF;
52
53// Mask used to set appropriate bits in first byte of UTF-8 sequence,
54// indexed by number of bytes in the sequence.
55// 0xxxxxxx
56// -> (00-7f) 7bit. Bit mask for the first byte is 0x00000000
57// 110yyyyx 10xxxxxx
58// -> (c0-df)(80-bf) 11bit. Bit mask is 0x000000C0
59// 1110yyyy 10yxxxxx 10xxxxxx
60// -> (e0-ef)(80-bf)(80-bf) 16bit. Bit mask is 0x000000E0
61// 11110yyy 10yyxxxx 10xxxxxx 10xxxxxx
62// -> (f0-f7)(80-bf)(80-bf)(80-bf) 21bit. Bit mask is 0x000000F0
63static const char32_t kFirstByteMark[] = {
64 0x00000000, 0x00000000, 0x000000C0, 0x000000E0, 0x000000F0
65};
66
67// --------------------------------------------------------------------------
68// UTF-32
69// --------------------------------------------------------------------------
70
71/**
72 * Return number of UTF-8 bytes required for the character. If the character
73 * is invalid, return size of 0.
74 */
75static inline size_t utf32_codepoint_utf8_length(char32_t srcChar)
76{
77 // Figure out how many bytes the result will require.
78 if (srcChar < 0x00000080) {
79 return 1;
80 } else if (srcChar < 0x00000800) {
81 return 2;
82 } else if (srcChar < 0x00010000) {
83 if ((srcChar < kUnicodeSurrogateStart) || (srcChar > kUnicodeSurrogateEnd)) {
84 return 3;
85 } else {
86 // Surrogates are invalid UTF-32 characters.
87 return 0;
88 }
89 }
90 // Max code point for Unicode is 0x0010FFFF.
91 else if (srcChar <= kUnicodeMaxCodepoint) {
92 return 4;
93 } else {
94 // Invalid UTF-32 character.
95 return 0;
96 }
97}
98
99// Write out the source character to <dstP>.
100
101static inline void utf32_codepoint_to_utf8(uint8_t* dstP, char32_t srcChar, size_t bytes)
102{
103 dstP += bytes;
104 switch (bytes)
105 { /* note: everything falls through. */
106 case 4: *--dstP = (uint8_t)((srcChar | kByteMark) & kByteMask); srcChar >>= 6;
107 case 3: *--dstP = (uint8_t)((srcChar | kByteMark) & kByteMask); srcChar >>= 6;
108 case 2: *--dstP = (uint8_t)((srcChar | kByteMark) & kByteMask); srcChar >>= 6;
109 case 1: *--dstP = (uint8_t)(srcChar | kFirstByteMark[bytes]);
110 }
111}
112
113size_t strlen32(const char32_t *s)
114{
115 const char32_t *ss = s;
116 while ( *ss )
117 ss++;
118 return ss-s;
119}
120
121size_t strnlen32(const char32_t *s, size_t maxlen)
122{
123 const char32_t *ss = s;
124 while ((maxlen > 0) && *ss) {
125 ss++;
126 maxlen--;
127 }
128 return ss-s;
129}
130
131static inline int32_t utf32_at_internal(const char* cur, size_t *num_read)
132{
133 const char first_char = *cur;
134 if ((first_char & 0x80) == 0) { // ASCII
135 *num_read = 1;
136 return *cur;
137 }
138 cur++;
139 char32_t mask, to_ignore_mask;
140 size_t num_to_read = 0;
141 char32_t utf32 = first_char;
142 for (num_to_read = 1, mask = 0x40, to_ignore_mask = 0xFFFFFF80;
143 (first_char & mask);
144 num_to_read++, to_ignore_mask |= mask, mask >>= 1) {
145 // 0x3F == 00111111
146 utf32 = (utf32 << 6) + (*cur++ & 0x3F);
147 }
148 to_ignore_mask |= mask;
149 utf32 &= ~(to_ignore_mask << (6 * (num_to_read - 1)));
150
151 *num_read = num_to_read;
152 return static_cast<int32_t>(utf32);
153}
154
155int32_t utf32_from_utf8_at(const char *src, size_t src_len, size_t index, size_t *next_index)
156{
157 if (index >= src_len) {
158 return -1;
159 }
160 size_t dummy_index;
161 if (next_index == NULL) {
162 next_index = &dummy_index;
163 }
164 size_t num_read;
165 int32_t ret = utf32_at_internal(src + index, &num_read);
166 if (ret >= 0) {
167 *next_index = index + num_read;
168 }
169
170 return ret;
171}
172
173ssize_t utf32_to_utf8_length(const char32_t *src, size_t src_len)
174{
175 if (src == NULL || src_len == 0) {
176 return -1;
177 }
178
179 size_t ret = 0;
180 const char32_t *end = src + src_len;
181 while (src < end) {
182 ret += utf32_codepoint_utf8_length(*src++);
183 }
184 return ret;
185}
186
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100187void utf32_to_utf8(const char32_t* src, size_t src_len, char* dst, size_t dst_len)
Kenny Rootba0165b2010-11-09 14:37:23 -0800188{
189 if (src == NULL || src_len == 0 || dst == NULL) {
190 return;
191 }
192
193 const char32_t *cur_utf32 = src;
194 const char32_t *end_utf32 = src + src_len;
195 char *cur = dst;
196 while (cur_utf32 < end_utf32) {
197 size_t len = utf32_codepoint_utf8_length(*cur_utf32);
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100198 LOG_ALWAYS_FATAL_IF(dst_len < len, "%zu < %zu", dst_len, len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800199 utf32_codepoint_to_utf8((uint8_t *)cur, *cur_utf32++, len);
200 cur += len;
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100201 dst_len -= len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800202 }
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100203 LOG_ALWAYS_FATAL_IF(dst_len < 1, "dst_len < 1: %zu < 1", dst_len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800204 *cur = '\0';
205}
206
207// --------------------------------------------------------------------------
208// UTF-16
209// --------------------------------------------------------------------------
210
211int strcmp16(const char16_t *s1, const char16_t *s2)
212{
213 char16_t ch;
214 int d = 0;
215
216 while ( 1 ) {
217 d = (int)(ch = *s1++) - (int)*s2++;
218 if ( d || !ch )
219 break;
220 }
221
222 return d;
223}
224
225int strncmp16(const char16_t *s1, const char16_t *s2, size_t n)
226{
227 char16_t ch;
228 int d = 0;
229
Michael Wright5bacef32016-05-09 14:43:31 +0100230 if (n == 0) {
231 return 0;
Kenny Rootba0165b2010-11-09 14:37:23 -0800232 }
233
Michael Wright5bacef32016-05-09 14:43:31 +0100234 do {
235 d = (int)(ch = *s1++) - (int)*s2++;
236 if ( d || !ch ) {
237 break;
238 }
239 } while (--n);
240
Kenny Rootba0165b2010-11-09 14:37:23 -0800241 return d;
242}
243
244char16_t *strcpy16(char16_t *dst, const char16_t *src)
245{
246 char16_t *q = dst;
247 const char16_t *p = src;
248 char16_t ch;
249
250 do {
251 *q++ = ch = *p++;
252 } while ( ch );
253
254 return dst;
255}
256
257size_t strlen16(const char16_t *s)
258{
259 const char16_t *ss = s;
260 while ( *ss )
261 ss++;
262 return ss-s;
263}
264
265
266char16_t *strncpy16(char16_t *dst, const char16_t *src, size_t n)
267{
268 char16_t *q = dst;
269 const char16_t *p = src;
270 char ch;
271
272 while (n) {
273 n--;
274 *q++ = ch = *p++;
275 if ( !ch )
276 break;
277 }
278
279 *q = 0;
280
281 return dst;
282}
283
284size_t strnlen16(const char16_t *s, size_t maxlen)
285{
286 const char16_t *ss = s;
287
288 /* Important: the maxlen test must precede the reference through ss;
289 since the byte beyond the maximum may segfault */
290 while ((maxlen > 0) && *ss) {
291 ss++;
292 maxlen--;
293 }
294 return ss-s;
295}
296
Michael Wright5bacef32016-05-09 14:43:31 +0100297char16_t* strstr16(const char16_t* src, const char16_t* target)
298{
299 const char16_t needle = *target++;
Michael Wright0fd60eb2016-05-16 21:23:07 +0100300 const size_t target_len = strlen16(target);
Michael Wright5bacef32016-05-09 14:43:31 +0100301 if (needle != '\0') {
302 do {
303 do {
304 if (*src == '\0') {
305 return nullptr;
306 }
307 } while (*src++ != needle);
Michael Wright0fd60eb2016-05-16 21:23:07 +0100308 } while (strncmp16(src, target, target_len) != 0);
Michael Wright5bacef32016-05-09 14:43:31 +0100309 src--;
310 }
311
312 return (char16_t*)src;
313}
314
315
Kenny Rootba0165b2010-11-09 14:37:23 -0800316int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2)
317{
318 const char16_t* e1 = s1+n1;
319 const char16_t* e2 = s2+n2;
320
321 while (s1 < e1 && s2 < e2) {
322 const int d = (int)*s1++ - (int)*s2++;
323 if (d) {
324 return d;
325 }
326 }
327
328 return n1 < n2
329 ? (0 - (int)*s2)
330 : (n1 > n2
331 ? ((int)*s1 - 0)
332 : 0);
333}
334
335int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2)
336{
337 const char16_t* e1 = s1H+n1;
338 const char16_t* e2 = s2N+n2;
339
340 while (s1H < e1 && s2N < e2) {
341 const char16_t c2 = ntohs(*s2N);
342 const int d = (int)*s1H++ - (int)c2;
343 s2N++;
344 if (d) {
345 return d;
346 }
347 }
348
349 return n1 < n2
350 ? (0 - (int)ntohs(*s2N))
351 : (n1 > n2
352 ? ((int)*s1H - 0)
353 : 0);
354}
355
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100356void utf16_to_utf8(const char16_t* src, size_t src_len, char* dst, size_t dst_len)
Kenny Rootba0165b2010-11-09 14:37:23 -0800357{
358 if (src == NULL || src_len == 0 || dst == NULL) {
359 return;
360 }
361
362 const char16_t* cur_utf16 = src;
363 const char16_t* const end_utf16 = src + src_len;
364 char *cur = dst;
365 while (cur_utf16 < end_utf16) {
366 char32_t utf32;
367 // surrogate pairs
Cylen Yao72299bf2014-06-04 19:11:27 +0800368 if((*cur_utf16 & 0xFC00) == 0xD800 && (cur_utf16 + 1) < end_utf16
369 && (*(cur_utf16 + 1) & 0xFC00) == 0xDC00) {
Kenny Rootba0165b2010-11-09 14:37:23 -0800370 utf32 = (*cur_utf16++ - 0xD800) << 10;
371 utf32 |= *cur_utf16++ - 0xDC00;
372 utf32 += 0x10000;
373 } else {
374 utf32 = (char32_t) *cur_utf16++;
375 }
376 const size_t len = utf32_codepoint_utf8_length(utf32);
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100377 LOG_ALWAYS_FATAL_IF(dst_len < len, "%zu < %zu", dst_len, len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800378 utf32_codepoint_to_utf8((uint8_t*)cur, utf32, len);
379 cur += len;
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100380 dst_len -= len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800381 }
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100382 LOG_ALWAYS_FATAL_IF(dst_len < 1, "%zu < 1", dst_len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800383 *cur = '\0';
384}
385
386// --------------------------------------------------------------------------
387// UTF-8
388// --------------------------------------------------------------------------
389
390ssize_t utf8_length(const char *src)
391{
392 const char *cur = src;
393 size_t ret = 0;
394 while (*cur != '\0') {
395 const char first_char = *cur++;
396 if ((first_char & 0x80) == 0) { // ASCII
397 ret += 1;
398 continue;
399 }
400 // (UTF-8's character must not be like 10xxxxxx,
401 // but 110xxxxx, 1110xxxx, ... or 1111110x)
402 if ((first_char & 0x40) == 0) {
403 return -1;
404 }
405
406 int32_t mask, to_ignore_mask;
407 size_t num_to_read = 0;
408 char32_t utf32 = 0;
409 for (num_to_read = 1, mask = 0x40, to_ignore_mask = 0x80;
410 num_to_read < 5 && (first_char & mask);
411 num_to_read++, to_ignore_mask |= mask, mask >>= 1) {
412 if ((*cur & 0xC0) != 0x80) { // must be 10xxxxxx
413 return -1;
414 }
415 // 0x3F == 00111111
416 utf32 = (utf32 << 6) + (*cur++ & 0x3F);
417 }
418 // "first_char" must be (110xxxxx - 11110xxx)
419 if (num_to_read == 5) {
420 return -1;
421 }
422 to_ignore_mask |= mask;
423 utf32 |= ((~to_ignore_mask) & first_char) << (6 * (num_to_read - 1));
424 if (utf32 > kUnicodeMaxCodepoint) {
425 return -1;
426 }
427
428 ret += num_to_read;
429 }
430 return ret;
431}
432
433ssize_t utf16_to_utf8_length(const char16_t *src, size_t src_len)
434{
435 if (src == NULL || src_len == 0) {
436 return -1;
437 }
438
439 size_t ret = 0;
440 const char16_t* const end = src + src_len;
441 while (src < end) {
442 if ((*src & 0xFC00) == 0xD800 && (src + 1) < end
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100443 && (*(src + 1) & 0xFC00) == 0xDC00) {
Kenny Rootba0165b2010-11-09 14:37:23 -0800444 // surrogate pairs are always 4 bytes.
445 ret += 4;
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100446 src += 2;
Kenny Rootba0165b2010-11-09 14:37:23 -0800447 } else {
448 ret += utf32_codepoint_utf8_length((char32_t) *src++);
449 }
450 }
451 return ret;
452}
453
454/**
455 * Returns 1-4 based on the number of leading bits.
456 *
457 * 1111 -> 4
458 * 1110 -> 3
459 * 110x -> 2
460 * 10xx -> 1
461 * 0xxx -> 1
462 */
463static inline size_t utf8_codepoint_len(uint8_t ch)
464{
465 return ((0xe5000000 >> ((ch >> 3) & 0x1e)) & 3) + 1;
466}
467
468static inline void utf8_shift_and_mask(uint32_t* codePoint, const uint8_t byte)
469{
470 *codePoint <<= 6;
471 *codePoint |= 0x3F & byte;
472}
473
474size_t utf8_to_utf32_length(const char *src, size_t src_len)
475{
476 if (src == NULL || src_len == 0) {
477 return 0;
478 }
479 size_t ret = 0;
480 const char* cur;
481 const char* end;
482 size_t num_to_skip;
483 for (cur = src, end = src + src_len, num_to_skip = 1;
484 cur < end;
485 cur += num_to_skip, ret++) {
486 const char first_char = *cur;
487 num_to_skip = 1;
488 if ((first_char & 0x80) == 0) { // ASCII
489 continue;
490 }
491 int32_t mask;
492
493 for (mask = 0x40; (first_char & mask); num_to_skip++, mask >>= 1) {
494 }
495 }
496 return ret;
497}
498
499void utf8_to_utf32(const char* src, size_t src_len, char32_t* dst)
500{
501 if (src == NULL || src_len == 0 || dst == NULL) {
502 return;
503 }
504
505 const char* cur = src;
506 const char* const end = src + src_len;
507 char32_t* cur_utf32 = dst;
508 while (cur < end) {
509 size_t num_read;
510 *cur_utf32++ = static_cast<char32_t>(utf32_at_internal(cur, &num_read));
511 cur += num_read;
512 }
513 *cur_utf32 = 0;
514}
515
516static inline uint32_t utf8_to_utf32_codepoint(const uint8_t *src, size_t length)
517{
518 uint32_t unicode;
519
520 switch (length)
521 {
522 case 1:
523 return src[0];
524 case 2:
525 unicode = src[0] & 0x1f;
526 utf8_shift_and_mask(&unicode, src[1]);
527 return unicode;
528 case 3:
529 unicode = src[0] & 0x0f;
530 utf8_shift_and_mask(&unicode, src[1]);
531 utf8_shift_and_mask(&unicode, src[2]);
532 return unicode;
533 case 4:
534 unicode = src[0] & 0x07;
535 utf8_shift_and_mask(&unicode, src[1]);
536 utf8_shift_and_mask(&unicode, src[2]);
537 utf8_shift_and_mask(&unicode, src[3]);
538 return unicode;
539 default:
540 return 0xffff;
541 }
542
543 //printf("Char at %p: len=%d, utf-16=%p\n", src, length, (void*)result);
544}
545
Sergio Giro9de67762016-07-20 20:01:33 +0100546ssize_t utf8_to_utf16_length(const uint8_t* u8str, size_t u8len, bool overreadIsFatal)
Kenny Rootba0165b2010-11-09 14:37:23 -0800547{
548 const uint8_t* const u8end = u8str + u8len;
549 const uint8_t* u8cur = u8str;
550
551 /* Validate that the UTF-8 is the correct len */
552 size_t u16measuredLen = 0;
553 while (u8cur < u8end) {
554 u16measuredLen++;
555 int u8charLen = utf8_codepoint_len(*u8cur);
Sergio Giro9de67762016-07-20 20:01:33 +0100556 // Malformed utf8, some characters are beyond the end.
557 // Cases:
558 // If u8charLen == 1, this becomes u8cur >= u8end, which cannot happen as u8cur < u8end,
559 // then this condition fail and we continue, as expected.
560 // If u8charLen == 2, this becomes u8cur + 1 >= u8end, which fails only if
561 // u8cur == u8end - 1, that is, there was only one remaining character to read but we need
562 // 2 of them. This condition holds and we return -1, as expected.
563 if (u8cur + u8charLen - 1 >= u8end) {
564 if (overreadIsFatal) {
565 LOG_ALWAYS_FATAL("Attempt to overread computing length of utf8 string");
566 } else {
567 return -1;
568 }
569 }
Kenny Rootba0165b2010-11-09 14:37:23 -0800570 uint32_t codepoint = utf8_to_utf32_codepoint(u8cur, u8charLen);
571 if (codepoint > 0xFFFF) u16measuredLen++; // this will be a surrogate pair in utf16
572 u8cur += u8charLen;
573 }
574
575 /**
576 * Make sure that we ended where we thought we would and the output UTF-16
577 * will be exactly how long we were told it would be.
578 */
579 if (u8cur != u8end) {
580 return -1;
581 }
582
583 return u16measuredLen;
584}
585
Sergio Giro9de67762016-07-20 20:01:33 +0100586char16_t* utf8_to_utf16(const uint8_t* u8str, size_t u8len, char16_t* u16str, size_t u16len) {
587 // A value > SSIZE_MAX is probably a negative value returned as an error and casted.
588 LOG_ALWAYS_FATAL_IF(u16len == 0 || u16len > SSIZE_MAX, "u16len is %zu", u16len);
589 char16_t* end = utf8_to_utf16_no_null_terminator(u8str, u8len, u16str, u16len - 1);
Jeff Brownaa983c92011-10-07 13:28:18 -0700590 *end = 0;
Sergio Giro9de67762016-07-20 20:01:33 +0100591 return end;
Kenny Rootba0165b2010-11-09 14:37:23 -0800592}
593
Sergio Giro9de67762016-07-20 20:01:33 +0100594char16_t* utf8_to_utf16_no_null_terminator(
595 const uint8_t* src, size_t srcLen, char16_t* dst, size_t dstLen) {
596 if (dstLen == 0) {
597 return dst;
598 }
599 // A value > SSIZE_MAX is probably a negative value returned as an error and casted.
600 LOG_ALWAYS_FATAL_IF(dstLen > SSIZE_MAX, "dstLen is %zu", dstLen);
Dianne Hackborn0f10d0a2013-07-31 16:04:39 -0700601 const uint8_t* const u8end = src + srcLen;
602 const uint8_t* u8cur = src;
Mark Salyzyn5bed8032014-04-30 11:10:46 -0700603 const char16_t* const u16end = dst + dstLen;
Dianne Hackborn0f10d0a2013-07-31 16:04:39 -0700604 char16_t* u16cur = dst;
605
606 while (u8cur < u8end && u16cur < u16end) {
607 size_t u8len = utf8_codepoint_len(*u8cur);
608 uint32_t codepoint = utf8_to_utf32_codepoint(u8cur, u8len);
609
610 // Convert the UTF32 codepoint to one or more UTF16 codepoints
611 if (codepoint <= 0xFFFF) {
612 // Single UTF16 character
613 *u16cur++ = (char16_t) codepoint;
614 } else {
615 // Multiple UTF16 characters with surrogates
616 codepoint = codepoint - 0x10000;
617 *u16cur++ = (char16_t) ((codepoint >> 10) + 0xD800);
618 if (u16cur >= u16end) {
619 // Ooops... not enough room for this surrogate pair.
620 return u16cur-1;
621 }
622 *u16cur++ = (char16_t) ((codepoint & 0x3FF) + 0xDC00);
623 }
624
625 u8cur += u8len;
626 }
627 return u16cur;
628}
629
Kenny Rootba0165b2010-11-09 14:37:23 -0800630}