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
|
#ifndef SIMDUTF_UTF16_TO_UTF8_H
#define SIMDUTF_UTF16_TO_UTF8_H
namespace simdutf {
namespace scalar {
namespace {
namespace utf16_to_utf8 {
template <endianness big_endian>
inline size_t convert(const char16_t *buf, size_t len, char *utf8_output) {
const uint16_t *data = reinterpret_cast<const uint16_t *>(buf);
size_t pos = 0;
char *start{utf8_output};
while (pos < len) {
// try to convert the next block of 8 bytes
if (pos + 4 <=
len) { // if it is safe to read 8 more bytes, check that they are ascii
uint64_t v;
::memcpy(&v, data + pos, sizeof(uint64_t));
if (!match_system(big_endian)) {
v = (v >> 8) | (v << (64 - 8));
}
if ((v & 0xFF80FF80FF80FF80) == 0) {
size_t final_pos = pos + 4;
while (pos < final_pos) {
*utf8_output++ = !match_system(big_endian)
? char(utf16::swap_bytes(buf[pos]))
: char(buf[pos]);
pos++;
}
continue;
}
}
uint16_t word =
!match_system(big_endian) ? utf16::swap_bytes(data[pos]) : data[pos];
if ((word & 0xFF80) == 0) {
// will generate one UTF-8 bytes
*utf8_output++ = char(word);
pos++;
} else if ((word & 0xF800) == 0) {
// will generate two UTF-8 bytes
// we have 0b110XXXXX 0b10XXXXXX
*utf8_output++ = char((word >> 6) | 0b11000000);
*utf8_output++ = char((word & 0b111111) | 0b10000000);
pos++;
} else if ((word & 0xF800) != 0xD800) {
// will generate three UTF-8 bytes
// we have 0b1110XXXX 0b10XXXXXX 0b10XXXXXX
*utf8_output++ = char((word >> 12) | 0b11100000);
*utf8_output++ = char(((word >> 6) & 0b111111) | 0b10000000);
*utf8_output++ = char((word & 0b111111) | 0b10000000);
pos++;
} else {
// must be a surrogate pair
if (pos + 1 >= len) {
return 0;
}
uint16_t diff = uint16_t(word - 0xD800);
if (diff > 0x3FF) {
return 0;
}
uint16_t next_word = !match_system(big_endian)
? utf16::swap_bytes(data[pos + 1])
: data[pos + 1];
uint16_t diff2 = uint16_t(next_word - 0xDC00);
if (diff2 > 0x3FF) {
return 0;
}
uint32_t value = (diff << 10) + diff2 + 0x10000;
// will generate four UTF-8 bytes
// we have 0b11110XXX 0b10XXXXXX 0b10XXXXXX 0b10XXXXXX
*utf8_output++ = char((value >> 18) | 0b11110000);
*utf8_output++ = char(((value >> 12) & 0b111111) | 0b10000000);
*utf8_output++ = char(((value >> 6) & 0b111111) | 0b10000000);
*utf8_output++ = char((value & 0b111111) | 0b10000000);
pos += 2;
}
}
return utf8_output - start;
}
template <endianness big_endian>
inline result convert_with_errors(const char16_t *buf, size_t len,
char *utf8_output) {
const uint16_t *data = reinterpret_cast<const uint16_t *>(buf);
size_t pos = 0;
char *start{utf8_output};
while (pos < len) {
// try to convert the next block of 8 bytes
if (pos + 4 <=
len) { // if it is safe to read 8 more bytes, check that they are ascii
uint64_t v;
::memcpy(&v, data + pos, sizeof(uint64_t));
if (!match_system(big_endian))
v = (v >> 8) | (v << (64 - 8));
if ((v & 0xFF80FF80FF80FF80) == 0) {
size_t final_pos = pos + 4;
while (pos < final_pos) {
*utf8_output++ = !match_system(big_endian)
? char(utf16::swap_bytes(buf[pos]))
: char(buf[pos]);
pos++;
}
continue;
}
}
uint16_t word =
!match_system(big_endian) ? utf16::swap_bytes(data[pos]) : data[pos];
if ((word & 0xFF80) == 0) {
// will generate one UTF-8 bytes
*utf8_output++ = char(word);
pos++;
} else if ((word & 0xF800) == 0) {
// will generate two UTF-8 bytes
// we have 0b110XXXXX 0b10XXXXXX
*utf8_output++ = char((word >> 6) | 0b11000000);
*utf8_output++ = char((word & 0b111111) | 0b10000000);
pos++;
} else if ((word & 0xF800) != 0xD800) {
// will generate three UTF-8 bytes
// we have 0b1110XXXX 0b10XXXXXX 0b10XXXXXX
*utf8_output++ = char((word >> 12) | 0b11100000);
*utf8_output++ = char(((word >> 6) & 0b111111) | 0b10000000);
*utf8_output++ = char((word & 0b111111) | 0b10000000);
pos++;
} else {
// must be a surrogate pair
if (pos + 1 >= len) {
return result(error_code::SURROGATE, pos);
}
uint16_t diff = uint16_t(word - 0xD800);
if (diff > 0x3FF) {
return result(error_code::SURROGATE, pos);
}
uint16_t next_word = !match_system(big_endian)
? utf16::swap_bytes(data[pos + 1])
: data[pos + 1];
uint16_t diff2 = uint16_t(next_word - 0xDC00);
if (diff2 > 0x3FF) {
return result(error_code::SURROGATE, pos);
}
uint32_t value = (diff << 10) + diff2 + 0x10000;
// will generate four UTF-8 bytes
// we have 0b11110XXX 0b10XXXXXX 0b10XXXXXX 0b10XXXXXX
*utf8_output++ = char((value >> 18) | 0b11110000);
*utf8_output++ = char(((value >> 12) & 0b111111) | 0b10000000);
*utf8_output++ = char(((value >> 6) & 0b111111) | 0b10000000);
*utf8_output++ = char((value & 0b111111) | 0b10000000);
pos += 2;
}
}
return result(error_code::SUCCESS, utf8_output - start);
}
} // namespace utf16_to_utf8
} // unnamed namespace
} // namespace scalar
} // namespace simdutf
#endif
|
