blob: 8ae9ef24d58bf5b1a38d292c66d94fc821a0fdf2 [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 Giro3411dd42016-06-28 18:02:29 +010017#include <log/log.h>
Kenny Rootba0165b2010-11-09 14:37:23 -080018#include <utils/Unicode.h>
19
20#include <stddef.h>
Adam Vartanianf0a43de2017-08-14 15:51:29 +010021#include <limits.h>
Kenny Rootba0165b2010-11-09 14:37:23 -080022
23#ifdef HAVE_WINSOCK
24# 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) {
Adam Vartanianf0a43de2017-08-14 15:51:29 +0100182 size_t char_len = utf32_codepoint_utf8_length(*src++);
183 if (SSIZE_MAX - char_len < ret) {
184 // If this happens, we would overflow the ssize_t type when
185 // returning from this function, so we cannot express how
186 // long this string is in an ssize_t.
187 android_errorWriteLog(0x534e4554, "37723026");
188 return -1;
189 }
190 ret += char_len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800191 }
192 return ret;
193}
194
Sergio Giro3411dd42016-06-28 18:02:29 +0100195void utf32_to_utf8(const char32_t* src, size_t src_len, char* dst, size_t dst_len)
Kenny Rootba0165b2010-11-09 14:37:23 -0800196{
197 if (src == NULL || src_len == 0 || dst == NULL) {
198 return;
199 }
200
201 const char32_t *cur_utf32 = src;
202 const char32_t *end_utf32 = src + src_len;
203 char *cur = dst;
204 while (cur_utf32 < end_utf32) {
205 size_t len = utf32_codepoint_utf8_length(*cur_utf32);
Sergio Giro3411dd42016-06-28 18:02:29 +0100206 LOG_ALWAYS_FATAL_IF(dst_len < len, "%zu < %zu", dst_len, len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800207 utf32_codepoint_to_utf8((uint8_t *)cur, *cur_utf32++, len);
208 cur += len;
Sergio Giro3411dd42016-06-28 18:02:29 +0100209 dst_len -= len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800210 }
Sergio Giro3411dd42016-06-28 18:02:29 +0100211 LOG_ALWAYS_FATAL_IF(dst_len < 1, "dst_len < 1: %zu < 1", dst_len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800212 *cur = '\0';
213}
214
215// --------------------------------------------------------------------------
216// UTF-16
217// --------------------------------------------------------------------------
218
219int strcmp16(const char16_t *s1, const char16_t *s2)
220{
221 char16_t ch;
222 int d = 0;
223
224 while ( 1 ) {
225 d = (int)(ch = *s1++) - (int)*s2++;
226 if ( d || !ch )
227 break;
228 }
229
230 return d;
231}
232
233int strncmp16(const char16_t *s1, const char16_t *s2, size_t n)
234{
235 char16_t ch;
236 int d = 0;
237
238 while ( n-- ) {
239 d = (int)(ch = *s1++) - (int)*s2++;
240 if ( d || !ch )
241 break;
242 }
243
244 return d;
245}
246
247char16_t *strcpy16(char16_t *dst, const char16_t *src)
248{
249 char16_t *q = dst;
250 const char16_t *p = src;
251 char16_t ch;
252
253 do {
254 *q++ = ch = *p++;
255 } while ( ch );
256
257 return dst;
258}
259
260size_t strlen16(const char16_t *s)
261{
262 const char16_t *ss = s;
263 while ( *ss )
264 ss++;
265 return ss-s;
266}
267
268
269char16_t *strncpy16(char16_t *dst, const char16_t *src, size_t n)
270{
271 char16_t *q = dst;
272 const char16_t *p = src;
273 char ch;
274
275 while (n) {
276 n--;
277 *q++ = ch = *p++;
278 if ( !ch )
279 break;
280 }
281
282 *q = 0;
283
284 return dst;
285}
286
287size_t strnlen16(const char16_t *s, size_t maxlen)
288{
289 const char16_t *ss = s;
290
291 /* Important: the maxlen test must precede the reference through ss;
292 since the byte beyond the maximum may segfault */
293 while ((maxlen > 0) && *ss) {
294 ss++;
295 maxlen--;
296 }
297 return ss-s;
298}
299
300int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2)
301{
302 const char16_t* e1 = s1+n1;
303 const char16_t* e2 = s2+n2;
304
305 while (s1 < e1 && s2 < e2) {
306 const int d = (int)*s1++ - (int)*s2++;
307 if (d) {
308 return d;
309 }
310 }
311
312 return n1 < n2
313 ? (0 - (int)*s2)
314 : (n1 > n2
315 ? ((int)*s1 - 0)
316 : 0);
317}
318
319int strzcmp16_h_n(const char16_t *s1H, size_t n1, const char16_t *s2N, size_t n2)
320{
321 const char16_t* e1 = s1H+n1;
322 const char16_t* e2 = s2N+n2;
323
324 while (s1H < e1 && s2N < e2) {
325 const char16_t c2 = ntohs(*s2N);
326 const int d = (int)*s1H++ - (int)c2;
327 s2N++;
328 if (d) {
329 return d;
330 }
331 }
332
333 return n1 < n2
334 ? (0 - (int)ntohs(*s2N))
335 : (n1 > n2
336 ? ((int)*s1H - 0)
337 : 0);
338}
339
Sergio Giro3411dd42016-06-28 18:02:29 +0100340void utf16_to_utf8(const char16_t* src, size_t src_len, char* dst, size_t dst_len)
Kenny Rootba0165b2010-11-09 14:37:23 -0800341{
342 if (src == NULL || src_len == 0 || dst == NULL) {
343 return;
344 }
345
346 const char16_t* cur_utf16 = src;
347 const char16_t* const end_utf16 = src + src_len;
348 char *cur = dst;
349 while (cur_utf16 < end_utf16) {
350 char32_t utf32;
351 // surrogate pairs
Cylen Yao72299bf2014-06-04 19:11:27 +0800352 if((*cur_utf16 & 0xFC00) == 0xD800 && (cur_utf16 + 1) < end_utf16
353 && (*(cur_utf16 + 1) & 0xFC00) == 0xDC00) {
Kenny Rootba0165b2010-11-09 14:37:23 -0800354 utf32 = (*cur_utf16++ - 0xD800) << 10;
355 utf32 |= *cur_utf16++ - 0xDC00;
356 utf32 += 0x10000;
357 } else {
358 utf32 = (char32_t) *cur_utf16++;
359 }
360 const size_t len = utf32_codepoint_utf8_length(utf32);
Sergio Giro3411dd42016-06-28 18:02:29 +0100361 LOG_ALWAYS_FATAL_IF(dst_len < len, "%zu < %zu", dst_len, len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800362 utf32_codepoint_to_utf8((uint8_t*)cur, utf32, len);
363 cur += len;
Sergio Giro3411dd42016-06-28 18:02:29 +0100364 dst_len -= len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800365 }
Sergio Giro3411dd42016-06-28 18:02:29 +0100366 LOG_ALWAYS_FATAL_IF(dst_len < 1, "%zu < 1", dst_len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800367 *cur = '\0';
368}
369
370// --------------------------------------------------------------------------
371// UTF-8
372// --------------------------------------------------------------------------
373
374ssize_t utf8_length(const char *src)
375{
376 const char *cur = src;
377 size_t ret = 0;
378 while (*cur != '\0') {
379 const char first_char = *cur++;
380 if ((first_char & 0x80) == 0) { // ASCII
381 ret += 1;
382 continue;
383 }
384 // (UTF-8's character must not be like 10xxxxxx,
385 // but 110xxxxx, 1110xxxx, ... or 1111110x)
386 if ((first_char & 0x40) == 0) {
387 return -1;
388 }
389
390 int32_t mask, to_ignore_mask;
391 size_t num_to_read = 0;
392 char32_t utf32 = 0;
393 for (num_to_read = 1, mask = 0x40, to_ignore_mask = 0x80;
394 num_to_read < 5 && (first_char & mask);
395 num_to_read++, to_ignore_mask |= mask, mask >>= 1) {
396 if ((*cur & 0xC0) != 0x80) { // must be 10xxxxxx
397 return -1;
398 }
399 // 0x3F == 00111111
400 utf32 = (utf32 << 6) + (*cur++ & 0x3F);
401 }
402 // "first_char" must be (110xxxxx - 11110xxx)
403 if (num_to_read == 5) {
404 return -1;
405 }
406 to_ignore_mask |= mask;
407 utf32 |= ((~to_ignore_mask) & first_char) << (6 * (num_to_read - 1));
408 if (utf32 > kUnicodeMaxCodepoint) {
409 return -1;
410 }
411
412 ret += num_to_read;
413 }
414 return ret;
415}
416
417ssize_t utf16_to_utf8_length(const char16_t *src, size_t src_len)
418{
419 if (src == NULL || src_len == 0) {
420 return -1;
421 }
422
423 size_t ret = 0;
424 const char16_t* const end = src + src_len;
425 while (src < end) {
Adam Vartanianf0a43de2017-08-14 15:51:29 +0100426 size_t char_len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800427 if ((*src & 0xFC00) == 0xD800 && (src + 1) < end
Sergio Giro3411dd42016-06-28 18:02:29 +0100428 && (*(src + 1) & 0xFC00) == 0xDC00) {
Kenny Rootba0165b2010-11-09 14:37:23 -0800429 // surrogate pairs are always 4 bytes.
Adam Vartanianf0a43de2017-08-14 15:51:29 +0100430 char_len = 4;
Sergio Giro3411dd42016-06-28 18:02:29 +0100431 src += 2;
Kenny Rootba0165b2010-11-09 14:37:23 -0800432 } else {
Adam Vartanianf0a43de2017-08-14 15:51:29 +0100433 char_len = utf32_codepoint_utf8_length((char32_t)*src++);
Kenny Rootba0165b2010-11-09 14:37:23 -0800434 }
Adam Vartanianf0a43de2017-08-14 15:51:29 +0100435 if (SSIZE_MAX - char_len < ret) {
436 // If this happens, we would overflow the ssize_t type when
437 // returning from this function, so we cannot express how
438 // long this string is in an ssize_t.
439 android_errorWriteLog(0x534e4554, "37723026");
440 return -1;
441 }
442 ret += char_len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800443 }
444 return ret;
445}
446
447/**
448 * Returns 1-4 based on the number of leading bits.
449 *
450 * 1111 -> 4
451 * 1110 -> 3
452 * 110x -> 2
453 * 10xx -> 1
454 * 0xxx -> 1
455 */
456static inline size_t utf8_codepoint_len(uint8_t ch)
457{
458 return ((0xe5000000 >> ((ch >> 3) & 0x1e)) & 3) + 1;
459}
460
461static inline void utf8_shift_and_mask(uint32_t* codePoint, const uint8_t byte)
462{
463 *codePoint <<= 6;
464 *codePoint |= 0x3F & byte;
465}
466
467size_t utf8_to_utf32_length(const char *src, size_t src_len)
468{
469 if (src == NULL || src_len == 0) {
470 return 0;
471 }
472 size_t ret = 0;
473 const char* cur;
474 const char* end;
475 size_t num_to_skip;
476 for (cur = src, end = src + src_len, num_to_skip = 1;
477 cur < end;
478 cur += num_to_skip, ret++) {
479 const char first_char = *cur;
480 num_to_skip = 1;
481 if ((first_char & 0x80) == 0) { // ASCII
482 continue;
483 }
484 int32_t mask;
485
486 for (mask = 0x40; (first_char & mask); num_to_skip++, mask >>= 1) {
487 }
488 }
489 return ret;
490}
491
492void utf8_to_utf32(const char* src, size_t src_len, char32_t* dst)
493{
494 if (src == NULL || src_len == 0 || dst == NULL) {
495 return;
496 }
497
498 const char* cur = src;
499 const char* const end = src + src_len;
500 char32_t* cur_utf32 = dst;
501 while (cur < end) {
502 size_t num_read;
503 *cur_utf32++ = static_cast<char32_t>(utf32_at_internal(cur, &num_read));
504 cur += num_read;
505 }
506 *cur_utf32 = 0;
507}
508
509static inline uint32_t utf8_to_utf32_codepoint(const uint8_t *src, size_t length)
510{
511 uint32_t unicode;
512
513 switch (length)
514 {
515 case 1:
516 return src[0];
517 case 2:
518 unicode = src[0] & 0x1f;
519 utf8_shift_and_mask(&unicode, src[1]);
520 return unicode;
521 case 3:
522 unicode = src[0] & 0x0f;
523 utf8_shift_and_mask(&unicode, src[1]);
524 utf8_shift_and_mask(&unicode, src[2]);
525 return unicode;
526 case 4:
527 unicode = src[0] & 0x07;
528 utf8_shift_and_mask(&unicode, src[1]);
529 utf8_shift_and_mask(&unicode, src[2]);
530 utf8_shift_and_mask(&unicode, src[3]);
531 return unicode;
532 default:
533 return 0xffff;
534 }
535
536 //printf("Char at %p: len=%d, utf-16=%p\n", src, length, (void*)result);
537}
538
539ssize_t utf8_to_utf16_length(const uint8_t* u8str, size_t u8len)
540{
541 const uint8_t* const u8end = u8str + u8len;
542 const uint8_t* u8cur = u8str;
543
544 /* Validate that the UTF-8 is the correct len */
545 size_t u16measuredLen = 0;
546 while (u8cur < u8end) {
547 u16measuredLen++;
548 int u8charLen = utf8_codepoint_len(*u8cur);
549 uint32_t codepoint = utf8_to_utf32_codepoint(u8cur, u8charLen);
550 if (codepoint > 0xFFFF) u16measuredLen++; // this will be a surrogate pair in utf16
551 u8cur += u8charLen;
552 }
553
554 /**
555 * Make sure that we ended where we thought we would and the output UTF-16
556 * will be exactly how long we were told it would be.
557 */
558 if (u8cur != u8end) {
559 return -1;
560 }
561
562 return u16measuredLen;
563}
564
Jeff Brownaa983c92011-10-07 13:28:18 -0700565char16_t* utf8_to_utf16_no_null_terminator(const uint8_t* u8str, size_t u8len, char16_t* u16str)
Kenny Rootba0165b2010-11-09 14:37:23 -0800566{
567 const uint8_t* const u8end = u8str + u8len;
568 const uint8_t* u8cur = u8str;
569 char16_t* u16cur = u16str;
570
571 while (u8cur < u8end) {
572 size_t u8len = utf8_codepoint_len(*u8cur);
573 uint32_t codepoint = utf8_to_utf32_codepoint(u8cur, u8len);
574
575 // Convert the UTF32 codepoint to one or more UTF16 codepoints
576 if (codepoint <= 0xFFFF) {
577 // Single UTF16 character
578 *u16cur++ = (char16_t) codepoint;
579 } else {
580 // Multiple UTF16 characters with surrogates
581 codepoint = codepoint - 0x10000;
582 *u16cur++ = (char16_t) ((codepoint >> 10) + 0xD800);
583 *u16cur++ = (char16_t) ((codepoint & 0x3FF) + 0xDC00);
584 }
585
586 u8cur += u8len;
587 }
Jeff Brownaa983c92011-10-07 13:28:18 -0700588 return u16cur;
589}
590
591void utf8_to_utf16(const uint8_t* u8str, size_t u8len, char16_t* u16str) {
592 char16_t* end = utf8_to_utf16_no_null_terminator(u8str, u8len, u16str);
593 *end = 0;
Kenny Rootba0165b2010-11-09 14:37:23 -0800594}
595
Dianne Hackborn0f10d0a2013-07-31 16:04:39 -0700596char16_t* utf8_to_utf16_n(const uint8_t* src, size_t srcLen, char16_t* dst, size_t dstLen) {
597 const uint8_t* const u8end = src + srcLen;
598 const uint8_t* u8cur = src;
Mark Salyzyn5bed8032014-04-30 11:10:46 -0700599 const char16_t* const u16end = dst + dstLen;
Dianne Hackborn0f10d0a2013-07-31 16:04:39 -0700600 char16_t* u16cur = dst;
601
602 while (u8cur < u8end && u16cur < u16end) {
603 size_t u8len = utf8_codepoint_len(*u8cur);
604 uint32_t codepoint = utf8_to_utf32_codepoint(u8cur, u8len);
605
606 // Convert the UTF32 codepoint to one or more UTF16 codepoints
607 if (codepoint <= 0xFFFF) {
608 // Single UTF16 character
609 *u16cur++ = (char16_t) codepoint;
610 } else {
611 // Multiple UTF16 characters with surrogates
612 codepoint = codepoint - 0x10000;
613 *u16cur++ = (char16_t) ((codepoint >> 10) + 0xD800);
614 if (u16cur >= u16end) {
615 // Ooops... not enough room for this surrogate pair.
616 return u16cur-1;
617 }
618 *u16cur++ = (char16_t) ((codepoint & 0x3FF) + 0xDC00);
619 }
620
621 u8cur += u8len;
622 }
623 return u16cur;
624}
625
Kenny Rootba0165b2010-11-09 14:37:23 -0800626}