blob: 843a81afb4416698cd8a94b6d36119a284531912 [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
Mark Salyzyncfd5b082016-10-17 14:28:00 -070017#define LOG_TAG "unicode"
18
Chih-Hung Hsieh502f4862018-09-13 11:08:41 -070019#include <android-base/macros.h>
Sergio Giro9de67762016-07-20 20:01:33 +010020#include <limits.h>
Chih-Hung Hsieh502f4862018-09-13 11:08:41 -070021#include <utils/Unicode.h>
Kenny Rootba0165b2010-11-09 14:37:23 -080022
Mark Salyzyn30f991f2017-01-10 13:19:54 -080023#include <log/log.h>
Mark Salyzynff2dcd92016-09-28 15:54:45 -070024
Elliott Hughesadbf4422015-07-29 17:45:24 -070025#if defined(_WIN32)
Kenny Rootba0165b2010-11-09 14:37:23 -080026# undef nhtol
27# undef htonl
28# undef nhtos
29# undef htons
30
Elliott Hughes97ac0e12014-11-21 23:01:59 -080031# define ntohl(x) ( ((x) << 24) | (((x) >> 24) & 255) | (((x) << 8) & 0xff0000) | (((x) >> 8) & 0xff00) )
32# define htonl(x) ntohl(x)
33# define ntohs(x) ( (((x) << 8) & 0xff00) | (((x) >> 8) & 255) )
34# define htons(x) ntohs(x)
Kenny Rootba0165b2010-11-09 14:37:23 -080035#else
36# include <netinet/in.h>
37#endif
38
39extern "C" {
40
41static const char32_t kByteMask = 0x000000BF;
42static const char32_t kByteMark = 0x00000080;
43
44// Surrogates aren't valid for UTF-32 characters, so define some
45// constants that will let us screen them out.
46static const char32_t kUnicodeSurrogateHighStart = 0x0000D800;
Andreas Gampea53c8152014-11-24 09:42:07 -080047// Unused, here for completeness:
48// static const char32_t kUnicodeSurrogateHighEnd = 0x0000DBFF;
49// static const char32_t kUnicodeSurrogateLowStart = 0x0000DC00;
Kenny Rootba0165b2010-11-09 14:37:23 -080050static const char32_t kUnicodeSurrogateLowEnd = 0x0000DFFF;
51static const char32_t kUnicodeSurrogateStart = kUnicodeSurrogateHighStart;
52static const char32_t kUnicodeSurrogateEnd = kUnicodeSurrogateLowEnd;
53static const char32_t kUnicodeMaxCodepoint = 0x0010FFFF;
54
55// Mask used to set appropriate bits in first byte of UTF-8 sequence,
56// indexed by number of bytes in the sequence.
57// 0xxxxxxx
58// -> (00-7f) 7bit. Bit mask for the first byte is 0x00000000
59// 110yyyyx 10xxxxxx
60// -> (c0-df)(80-bf) 11bit. Bit mask is 0x000000C0
61// 1110yyyy 10yxxxxx 10xxxxxx
62// -> (e0-ef)(80-bf)(80-bf) 16bit. Bit mask is 0x000000E0
63// 11110yyy 10yyxxxx 10xxxxxx 10xxxxxx
64// -> (f0-f7)(80-bf)(80-bf)(80-bf) 21bit. Bit mask is 0x000000F0
65static const char32_t kFirstByteMark[] = {
66 0x00000000, 0x00000000, 0x000000C0, 0x000000E0, 0x000000F0
67};
68
69// --------------------------------------------------------------------------
70// UTF-32
71// --------------------------------------------------------------------------
72
73/**
74 * Return number of UTF-8 bytes required for the character. If the character
75 * is invalid, return size of 0.
76 */
77static inline size_t utf32_codepoint_utf8_length(char32_t srcChar)
78{
79 // Figure out how many bytes the result will require.
80 if (srcChar < 0x00000080) {
81 return 1;
82 } else if (srcChar < 0x00000800) {
83 return 2;
84 } else if (srcChar < 0x00010000) {
85 if ((srcChar < kUnicodeSurrogateStart) || (srcChar > kUnicodeSurrogateEnd)) {
86 return 3;
87 } else {
88 // Surrogates are invalid UTF-32 characters.
89 return 0;
90 }
91 }
92 // Max code point for Unicode is 0x0010FFFF.
93 else if (srcChar <= kUnicodeMaxCodepoint) {
94 return 4;
95 } else {
96 // Invalid UTF-32 character.
97 return 0;
98 }
99}
100
101// Write out the source character to <dstP>.
102
103static inline void utf32_codepoint_to_utf8(uint8_t* dstP, char32_t srcChar, size_t bytes)
104{
105 dstP += bytes;
106 switch (bytes)
107 { /* note: everything falls through. */
108 case 4: *--dstP = (uint8_t)((srcChar | kByteMark) & kByteMask); srcChar >>= 6;
Chih-Hung Hsieh502f4862018-09-13 11:08:41 -0700109 FALLTHROUGH_INTENDED;
Kenny Rootba0165b2010-11-09 14:37:23 -0800110 case 3: *--dstP = (uint8_t)((srcChar | kByteMark) & kByteMask); srcChar >>= 6;
Chih-Hung Hsieh502f4862018-09-13 11:08:41 -0700111 FALLTHROUGH_INTENDED;
Kenny Rootba0165b2010-11-09 14:37:23 -0800112 case 2: *--dstP = (uint8_t)((srcChar | kByteMark) & kByteMask); srcChar >>= 6;
Chih-Hung Hsieh502f4862018-09-13 11:08:41 -0700113 FALLTHROUGH_INTENDED;
Kenny Rootba0165b2010-11-09 14:37:23 -0800114 case 1: *--dstP = (uint8_t)(srcChar | kFirstByteMark[bytes]);
115 }
116}
117
118size_t strlen32(const char32_t *s)
119{
120 const char32_t *ss = s;
121 while ( *ss )
122 ss++;
123 return ss-s;
124}
125
126size_t strnlen32(const char32_t *s, size_t maxlen)
127{
128 const char32_t *ss = s;
129 while ((maxlen > 0) && *ss) {
130 ss++;
131 maxlen--;
132 }
133 return ss-s;
134}
135
136static inline int32_t utf32_at_internal(const char* cur, size_t *num_read)
137{
138 const char first_char = *cur;
139 if ((first_char & 0x80) == 0) { // ASCII
140 *num_read = 1;
141 return *cur;
142 }
143 cur++;
144 char32_t mask, to_ignore_mask;
145 size_t num_to_read = 0;
146 char32_t utf32 = first_char;
147 for (num_to_read = 1, mask = 0x40, to_ignore_mask = 0xFFFFFF80;
148 (first_char & mask);
149 num_to_read++, to_ignore_mask |= mask, mask >>= 1) {
150 // 0x3F == 00111111
151 utf32 = (utf32 << 6) + (*cur++ & 0x3F);
152 }
153 to_ignore_mask |= mask;
154 utf32 &= ~(to_ignore_mask << (6 * (num_to_read - 1)));
155
156 *num_read = num_to_read;
157 return static_cast<int32_t>(utf32);
158}
159
160int32_t utf32_from_utf8_at(const char *src, size_t src_len, size_t index, size_t *next_index)
161{
162 if (index >= src_len) {
163 return -1;
164 }
Dan Albertac4500e2020-07-27 14:03:56 -0700165 size_t unused_index;
Yi Konge1731a42018-07-16 18:11:34 -0700166 if (next_index == nullptr) {
Dan Albertac4500e2020-07-27 14:03:56 -0700167 next_index = &unused_index;
Kenny Rootba0165b2010-11-09 14:37:23 -0800168 }
169 size_t num_read;
170 int32_t ret = utf32_at_internal(src + index, &num_read);
171 if (ret >= 0) {
172 *next_index = index + num_read;
173 }
174
175 return ret;
176}
177
178ssize_t utf32_to_utf8_length(const char32_t *src, size_t src_len)
179{
Yi Konge1731a42018-07-16 18:11:34 -0700180 if (src == nullptr || src_len == 0) {
Kenny Rootba0165b2010-11-09 14:37:23 -0800181 return -1;
182 }
183
184 size_t ret = 0;
185 const char32_t *end = src + src_len;
186 while (src < end) {
Adam Vartanian47efc672017-08-14 15:51:29 +0100187 size_t char_len = utf32_codepoint_utf8_length(*src++);
188 if (SSIZE_MAX - char_len < ret) {
189 // If this happens, we would overflow the ssize_t type when
190 // returning from this function, so we cannot express how
191 // long this string is in an ssize_t.
192 android_errorWriteLog(0x534e4554, "37723026");
193 return -1;
194 }
195 ret += char_len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800196 }
197 return ret;
198}
199
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100200void utf32_to_utf8(const char32_t* src, size_t src_len, char* dst, size_t dst_len)
Kenny Rootba0165b2010-11-09 14:37:23 -0800201{
Yi Konge1731a42018-07-16 18:11:34 -0700202 if (src == nullptr || src_len == 0 || dst == nullptr) {
Kenny Rootba0165b2010-11-09 14:37:23 -0800203 return;
204 }
205
206 const char32_t *cur_utf32 = src;
207 const char32_t *end_utf32 = src + src_len;
208 char *cur = dst;
209 while (cur_utf32 < end_utf32) {
210 size_t len = utf32_codepoint_utf8_length(*cur_utf32);
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100211 LOG_ALWAYS_FATAL_IF(dst_len < len, "%zu < %zu", dst_len, len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800212 utf32_codepoint_to_utf8((uint8_t *)cur, *cur_utf32++, len);
213 cur += len;
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100214 dst_len -= len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800215 }
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100216 LOG_ALWAYS_FATAL_IF(dst_len < 1, "dst_len < 1: %zu < 1", dst_len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800217 *cur = '\0';
218}
219
220// --------------------------------------------------------------------------
221// UTF-16
222// --------------------------------------------------------------------------
223
224int strcmp16(const char16_t *s1, const char16_t *s2)
225{
226 char16_t ch;
227 int d = 0;
228
229 while ( 1 ) {
230 d = (int)(ch = *s1++) - (int)*s2++;
231 if ( d || !ch )
232 break;
233 }
234
235 return d;
236}
237
238int strncmp16(const char16_t *s1, const char16_t *s2, size_t n)
239{
240 char16_t ch;
241 int d = 0;
242
Michael Wright5bacef32016-05-09 14:43:31 +0100243 if (n == 0) {
244 return 0;
Kenny Rootba0165b2010-11-09 14:37:23 -0800245 }
246
Michael Wright5bacef32016-05-09 14:43:31 +0100247 do {
248 d = (int)(ch = *s1++) - (int)*s2++;
249 if ( d || !ch ) {
250 break;
251 }
252 } while (--n);
253
Kenny Rootba0165b2010-11-09 14:37:23 -0800254 return d;
255}
256
257char16_t *strcpy16(char16_t *dst, const char16_t *src)
258{
259 char16_t *q = dst;
260 const char16_t *p = src;
261 char16_t ch;
262
263 do {
264 *q++ = ch = *p++;
265 } while ( ch );
266
267 return dst;
268}
269
270size_t strlen16(const char16_t *s)
271{
272 const char16_t *ss = s;
273 while ( *ss )
274 ss++;
275 return ss-s;
276}
277
Kenny Rootba0165b2010-11-09 14:37:23 -0800278size_t strnlen16(const char16_t *s, size_t maxlen)
279{
280 const char16_t *ss = s;
281
282 /* Important: the maxlen test must precede the reference through ss;
283 since the byte beyond the maximum may segfault */
284 while ((maxlen > 0) && *ss) {
285 ss++;
286 maxlen--;
287 }
288 return ss-s;
289}
290
Michael Wright5bacef32016-05-09 14:43:31 +0100291char16_t* strstr16(const char16_t* src, const char16_t* target)
292{
Branislav Rankovbf3fff12017-10-12 15:08:42 +0200293 const char16_t needle = *target;
294 if (needle == '\0') return (char16_t*)src;
295
296 const size_t target_len = strlen16(++target);
297 do {
Michael Wright5bacef32016-05-09 14:43:31 +0100298 do {
Branislav Rankovbf3fff12017-10-12 15:08:42 +0200299 if (*src == '\0') {
300 return nullptr;
301 }
Michael Wright5bacef32016-05-09 14:43:31 +0100302 } while (*src++ != needle);
Branislav Rankovbf3fff12017-10-12 15:08:42 +0200303 } while (strncmp16(src, target, target_len) != 0);
304 src--;
Michael Wright5bacef32016-05-09 14:43:31 +0100305
306 return (char16_t*)src;
307}
308
Kenny Rootba0165b2010-11-09 14:37:23 -0800309int strzcmp16(const char16_t *s1, size_t n1, const char16_t *s2, size_t n2)
310{
311 const char16_t* e1 = s1+n1;
312 const char16_t* e2 = s2+n2;
313
314 while (s1 < e1 && s2 < e2) {
315 const int d = (int)*s1++ - (int)*s2++;
316 if (d) {
317 return d;
318 }
319 }
320
321 return n1 < n2
322 ? (0 - (int)*s2)
323 : (n1 > n2
324 ? ((int)*s1 - 0)
325 : 0);
326}
327
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100328void utf16_to_utf8(const char16_t* src, size_t src_len, char* dst, size_t dst_len)
Kenny Rootba0165b2010-11-09 14:37:23 -0800329{
Yi Konge1731a42018-07-16 18:11:34 -0700330 if (src == nullptr || src_len == 0 || dst == nullptr) {
Kenny Rootba0165b2010-11-09 14:37:23 -0800331 return;
332 }
333
334 const char16_t* cur_utf16 = src;
335 const char16_t* const end_utf16 = src + src_len;
336 char *cur = dst;
337 while (cur_utf16 < end_utf16) {
338 char32_t utf32;
339 // surrogate pairs
Cylen Yao72299bf2014-06-04 19:11:27 +0800340 if((*cur_utf16 & 0xFC00) == 0xD800 && (cur_utf16 + 1) < end_utf16
341 && (*(cur_utf16 + 1) & 0xFC00) == 0xDC00) {
Kenny Rootba0165b2010-11-09 14:37:23 -0800342 utf32 = (*cur_utf16++ - 0xD800) << 10;
343 utf32 |= *cur_utf16++ - 0xDC00;
344 utf32 += 0x10000;
345 } else {
346 utf32 = (char32_t) *cur_utf16++;
347 }
348 const size_t len = utf32_codepoint_utf8_length(utf32);
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100349 LOG_ALWAYS_FATAL_IF(dst_len < len, "%zu < %zu", dst_len, len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800350 utf32_codepoint_to_utf8((uint8_t*)cur, utf32, len);
351 cur += len;
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100352 dst_len -= len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800353 }
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100354 LOG_ALWAYS_FATAL_IF(dst_len < 1, "%zu < 1", dst_len);
Kenny Rootba0165b2010-11-09 14:37:23 -0800355 *cur = '\0';
356}
357
358// --------------------------------------------------------------------------
359// UTF-8
360// --------------------------------------------------------------------------
361
Kenny Rootba0165b2010-11-09 14:37:23 -0800362ssize_t utf16_to_utf8_length(const char16_t *src, size_t src_len)
363{
Yi Konge1731a42018-07-16 18:11:34 -0700364 if (src == nullptr || src_len == 0) {
Kenny Rootba0165b2010-11-09 14:37:23 -0800365 return -1;
366 }
367
368 size_t ret = 0;
369 const char16_t* const end = src + src_len;
370 while (src < end) {
Adam Vartanian47efc672017-08-14 15:51:29 +0100371 size_t char_len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800372 if ((*src & 0xFC00) == 0xD800 && (src + 1) < end
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100373 && (*(src + 1) & 0xFC00) == 0xDC00) {
Kenny Rootba0165b2010-11-09 14:37:23 -0800374 // surrogate pairs are always 4 bytes.
Adam Vartanian47efc672017-08-14 15:51:29 +0100375 char_len = 4;
Sergio Giro1cfa56d2016-06-28 18:02:29 +0100376 src += 2;
Kenny Rootba0165b2010-11-09 14:37:23 -0800377 } else {
Adam Vartanian47efc672017-08-14 15:51:29 +0100378 char_len = utf32_codepoint_utf8_length((char32_t)*src++);
Kenny Rootba0165b2010-11-09 14:37:23 -0800379 }
Adam Vartanian47efc672017-08-14 15:51:29 +0100380 if (SSIZE_MAX - char_len < ret) {
381 // If this happens, we would overflow the ssize_t type when
382 // returning from this function, so we cannot express how
383 // long this string is in an ssize_t.
384 android_errorWriteLog(0x534e4554, "37723026");
385 return -1;
386 }
387 ret += char_len;
Kenny Rootba0165b2010-11-09 14:37:23 -0800388 }
389 return ret;
390}
391
392/**
393 * Returns 1-4 based on the number of leading bits.
394 *
395 * 1111 -> 4
396 * 1110 -> 3
397 * 110x -> 2
398 * 10xx -> 1
399 * 0xxx -> 1
400 */
401static inline size_t utf8_codepoint_len(uint8_t ch)
402{
403 return ((0xe5000000 >> ((ch >> 3) & 0x1e)) & 3) + 1;
404}
405
406static inline void utf8_shift_and_mask(uint32_t* codePoint, const uint8_t byte)
407{
408 *codePoint <<= 6;
409 *codePoint |= 0x3F & byte;
410}
411
Kenny Rootba0165b2010-11-09 14:37:23 -0800412static inline uint32_t utf8_to_utf32_codepoint(const uint8_t *src, size_t length)
413{
414 uint32_t unicode;
415
416 switch (length)
417 {
418 case 1:
419 return src[0];
420 case 2:
421 unicode = src[0] & 0x1f;
422 utf8_shift_and_mask(&unicode, src[1]);
423 return unicode;
424 case 3:
425 unicode = src[0] & 0x0f;
426 utf8_shift_and_mask(&unicode, src[1]);
427 utf8_shift_and_mask(&unicode, src[2]);
428 return unicode;
429 case 4:
430 unicode = src[0] & 0x07;
431 utf8_shift_and_mask(&unicode, src[1]);
432 utf8_shift_and_mask(&unicode, src[2]);
433 utf8_shift_and_mask(&unicode, src[3]);
434 return unicode;
435 default:
436 return 0xffff;
437 }
438
439 //printf("Char at %p: len=%d, utf-16=%p\n", src, length, (void*)result);
440}
441
Sergio Giro9de67762016-07-20 20:01:33 +0100442ssize_t utf8_to_utf16_length(const uint8_t* u8str, size_t u8len, bool overreadIsFatal)
Kenny Rootba0165b2010-11-09 14:37:23 -0800443{
444 const uint8_t* const u8end = u8str + u8len;
445 const uint8_t* u8cur = u8str;
446
447 /* Validate that the UTF-8 is the correct len */
448 size_t u16measuredLen = 0;
449 while (u8cur < u8end) {
450 u16measuredLen++;
451 int u8charLen = utf8_codepoint_len(*u8cur);
Sergio Giro9de67762016-07-20 20:01:33 +0100452 // Malformed utf8, some characters are beyond the end.
453 // Cases:
454 // If u8charLen == 1, this becomes u8cur >= u8end, which cannot happen as u8cur < u8end,
455 // then this condition fail and we continue, as expected.
456 // If u8charLen == 2, this becomes u8cur + 1 >= u8end, which fails only if
457 // u8cur == u8end - 1, that is, there was only one remaining character to read but we need
458 // 2 of them. This condition holds and we return -1, as expected.
459 if (u8cur + u8charLen - 1 >= u8end) {
460 if (overreadIsFatal) {
461 LOG_ALWAYS_FATAL("Attempt to overread computing length of utf8 string");
462 } else {
463 return -1;
464 }
465 }
Kenny Rootba0165b2010-11-09 14:37:23 -0800466 uint32_t codepoint = utf8_to_utf32_codepoint(u8cur, u8charLen);
467 if (codepoint > 0xFFFF) u16measuredLen++; // this will be a surrogate pair in utf16
468 u8cur += u8charLen;
469 }
470
471 /**
472 * Make sure that we ended where we thought we would and the output UTF-16
473 * will be exactly how long we were told it would be.
474 */
475 if (u8cur != u8end) {
476 return -1;
477 }
478
479 return u16measuredLen;
480}
481
Sergio Giro9de67762016-07-20 20:01:33 +0100482char16_t* utf8_to_utf16(const uint8_t* u8str, size_t u8len, char16_t* u16str, size_t u16len) {
483 // A value > SSIZE_MAX is probably a negative value returned as an error and casted.
484 LOG_ALWAYS_FATAL_IF(u16len == 0 || u16len > SSIZE_MAX, "u16len is %zu", u16len);
485 char16_t* end = utf8_to_utf16_no_null_terminator(u8str, u8len, u16str, u16len - 1);
Jeff Brownaa983c92011-10-07 13:28:18 -0700486 *end = 0;
Sergio Giro9de67762016-07-20 20:01:33 +0100487 return end;
Kenny Rootba0165b2010-11-09 14:37:23 -0800488}
489
Sergio Giro9de67762016-07-20 20:01:33 +0100490char16_t* utf8_to_utf16_no_null_terminator(
491 const uint8_t* src, size_t srcLen, char16_t* dst, size_t dstLen) {
492 if (dstLen == 0) {
493 return dst;
494 }
495 // A value > SSIZE_MAX is probably a negative value returned as an error and casted.
496 LOG_ALWAYS_FATAL_IF(dstLen > SSIZE_MAX, "dstLen is %zu", dstLen);
Dianne Hackborn0f10d0a2013-07-31 16:04:39 -0700497 const uint8_t* const u8end = src + srcLen;
498 const uint8_t* u8cur = src;
Mark Salyzyn5bed8032014-04-30 11:10:46 -0700499 const char16_t* const u16end = dst + dstLen;
Dianne Hackborn0f10d0a2013-07-31 16:04:39 -0700500 char16_t* u16cur = dst;
501
502 while (u8cur < u8end && u16cur < u16end) {
503 size_t u8len = utf8_codepoint_len(*u8cur);
504 uint32_t codepoint = utf8_to_utf32_codepoint(u8cur, u8len);
505
506 // Convert the UTF32 codepoint to one or more UTF16 codepoints
507 if (codepoint <= 0xFFFF) {
508 // Single UTF16 character
509 *u16cur++ = (char16_t) codepoint;
510 } else {
511 // Multiple UTF16 characters with surrogates
512 codepoint = codepoint - 0x10000;
513 *u16cur++ = (char16_t) ((codepoint >> 10) + 0xD800);
514 if (u16cur >= u16end) {
515 // Ooops... not enough room for this surrogate pair.
516 return u16cur-1;
517 }
518 *u16cur++ = (char16_t) ((codepoint & 0x3FF) + 0xDC00);
519 }
520
521 u8cur += u8len;
522 }
523 return u16cur;
524}
525
Kenny Rootba0165b2010-11-09 14:37:23 -0800526}