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
|
#include "simdutf.h"
#include <array>
#include <memory>
#include <vector>
#include <tests/helpers/transcode_test_base.h>
#include <tests/helpers/random_int.h>
#include <tests/helpers/test.h>
namespace {
std::array<size_t, 7> input_size{7, 16, 12, 64, 67, 128, 256};
using simdutf::tests::helpers::transcode_utf8_to_utf32_test_base;
constexpr size_t fix_size = 512;
} // namespace
TEST(issue_483) {
const unsigned char data[] = {
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0xa9};
constexpr std::size_t data_len_bytes = sizeof(data);
constexpr std::size_t data_len = data_len_bytes / sizeof(char);
const auto validation1 =
implementation.validate_utf8_with_errors((const char *)data, data_len);
ASSERT_EQUAL(validation1.count, 64);
ASSERT_EQUAL(validation1.error, simdutf::error_code::TOO_LONG);
const auto outlen =
implementation.utf32_length_from_utf8((const char *)data, data_len);
ASSERT_EQUAL(outlen, 64);
std::vector<char32_t> output(outlen);
const auto r = implementation.convert_utf8_to_utf32_with_errors(
(const char *)data, data_len, output.data());
ASSERT_EQUAL(r.error, simdutf::error_code::TOO_LONG);
ASSERT_EQUAL(r.count, 64);
}
TEST(issue_478) {
const unsigned char data[] = {
0x20, 0xdf, 0xbb, 0xcd, 0x8d, 0xcf, 0xbb, 0x20, 0x20, 0xdf, 0xbb,
0xdf, 0xbb, 0xcd, 0xbb, 0xcd, 0xbb, 0xde, 0xbb, 0xdf, 0xbb, 0xcd,
0xa9, 0xdf, 0xbb, 0xdf, 0xbb, 0xdf, 0xbb, 0xdf, 0xbb, 0xcd, 0xbb,
0xcd, 0xbb, 0xde, 0xbb, 0xdf, 0xbb, 0xcd, 0xa9, 0xd8, 0xbb, 0xdf,
0xbb, 0xdf, 0xbb, 0xdf, 0xbb, 0xdf, 0xbb, 0xdf, 0xb3, 0xdf, 0xbb,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0xb9};
constexpr std::size_t data_len_bytes = sizeof(data);
constexpr std::size_t data_len = data_len_bytes / sizeof(char);
const auto validation1 =
implementation.validate_utf8_with_errors((const char *)data, data_len);
ASSERT_EQUAL(validation1.count, 64);
ASSERT_EQUAL(validation1.error, simdutf::error_code::TOO_LONG);
const auto outlen =
implementation.utf32_length_from_utf8((const char *)data, data_len);
ASSERT_EQUAL(outlen, 38);
std::vector<char32_t> output(outlen);
const auto r = implementation.convert_utf8_to_utf32_with_errors(
(const char *)data, data_len, output.data());
ASSERT_EQUAL(r.error, simdutf::error_code::TOO_LONG);
ASSERT_EQUAL(r.count, 64);
}
TEST(issue_convert_utf8_to_utf32_with_errors_3fa5955f57c6b0a0) {
std::vector<char> input;
std::vector<char32_t> output(4);
const auto r = implementation.convert_utf8_to_utf32_with_errors(
input.data(), input.size(), output.data());
ASSERT_EQUAL(r.count, 0);
ASSERT_EQUAL(r.error, simdutf::error_code::SUCCESS);
}
TEST(issue_convert_utf8_to_utf32_with_errors_a8ec246845d4878e) {
const unsigned char data[] = {
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0xf2, 0xa8, 0xa4, 0x8b, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0xf2, 0xa8, 0xa4, 0x8b, 0x20,
0x20, 0x20, 0x20, 0xf2, 0xa8, 0xa4, 0x8b, 0x20, 0x20, 0xf2, 0xa8, 0xa4,
0x8b, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0xf2, 0xa8, 0xa4, 0xa8, 0xa4, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20};
constexpr std::size_t data_len_bytes = sizeof(data);
constexpr std::size_t data_len = data_len_bytes / sizeof(char);
std::vector<char32_t> output(4 * data_len);
const auto r = implementation.convert_utf8_to_utf32_with_errors(
(const char *)data, data_len, output.data());
/*
got return [count=61, error=TOO_LONG] from implementation icelake
got return [count=64, error=TOO_LONG] from implementation haswell
got return [count=64, error=TOO_LONG] from implementation westmere
got return [count=64, error=TOO_LONG] from implementation fallback
*/
ASSERT_EQUAL(r.count, 64);
ASSERT_EQUAL(r.error, simdutf::error_code::TOO_LONG);
}
TEST(issue_448) {
const unsigned char crash[] = {
0xcd, 0xb8, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0xff, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20};
const unsigned int crash_len = 128;
std::vector<char32_t> output(4 * crash_len);
const auto r = implementation.convert_utf8_to_utf32_with_errors(
(const char *)crash, crash_len / sizeof(char), output.data());
ASSERT_EQUAL(r.error, simdutf::HEADER_BITS);
ASSERT_EQUAL(r.count, 63);
}
TEST(issue_213) {
const char buf[] = "\x01\x9a\x84";
// We select the byte 0x84. It is a continuation byte so it is possible
// that the predicted output might be zero.
size_t expected_size = implementation.utf32_length_from_utf8(buf + 2, 1);
std::unique_ptr<char32_t[]> buffer(new char32_t[expected_size]);
simdutf::result r =
simdutf::convert_utf8_to_utf32_with_errors(buf + 2, 1, buffer.get());
ASSERT_TRUE(r.error != simdutf::SUCCESS);
// r.count: In case of error, indicates the position of the error in the
// input.
// In case of success, indicates the number of code units validated/written.
ASSERT_EQUAL(r.count, 0);
}
TEST(issue_441) {
const unsigned char crash[] = {
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0xa1, 0x20,
0x20, 0x20, 0x20, 0x20, 0x20, 0x20, 0x20};
const unsigned int crash_len = 73;
std::vector<char32_t> output(crash_len);
const auto r = implementation.convert_utf8_to_utf32_with_errors(
(const char *)crash, crash_len, output.data());
ASSERT_TRUE(r.error != simdutf::SUCCESS);
ASSERT_EQUAL(r.count, 64);
}
TEST_LOOP(convert_pure_ASCII) {
size_t counter = 0;
auto generator = [&counter]() -> uint32_t { return counter++ & 0x7f; };
auto procedure = [&implementation](const char *utf8, size_t size,
char32_t *utf32) -> size_t {
simdutf::result res =
implementation.convert_utf8_to_utf32_with_errors(utf8, size, utf32);
ASSERT_EQUAL(res.error, simdutf::error_code::SUCCESS);
return res.count;
};
auto size_procedure = [&implementation](const char *utf8,
size_t size) -> size_t {
return implementation.utf32_length_from_utf8(utf8, size);
};
for (size_t size : input_size) {
transcode_utf8_to_utf32_test_base test(generator, size);
ASSERT_TRUE(test(procedure));
ASSERT_TRUE(test.check_size(size_procedure));
}
}
TEST_LOOP(convert_1_or_2_UTF8_bytes) {
simdutf::tests::helpers::RandomInt random(
0x0000, 0x07ff, seed); // range for 1 or 2 UTF-8 bytes
auto procedure = [&implementation](const char *utf8, size_t size,
char32_t *utf32) -> size_t {
simdutf::result res =
implementation.convert_utf8_to_utf32_with_errors(utf8, size, utf32);
ASSERT_EQUAL(res.error, simdutf::error_code::SUCCESS);
return res.count;
};
auto size_procedure = [&implementation](const char *utf8,
size_t size) -> size_t {
return implementation.utf32_length_from_utf8(utf8, size);
};
for (size_t size : input_size) {
transcode_utf8_to_utf32_test_base test(random, size);
ASSERT_TRUE(test(procedure));
ASSERT_TRUE(test.check_size(size_procedure));
}
}
TEST_LOOP(convert_1_or_2_or_3_UTF8_bytes) {
// range for 1, 2 or 3 UTF-8 bytes
simdutf::tests::helpers::RandomIntRanges random(
{{0x0000, 0xd7ff}, {0xe000, 0xffff}}, seed);
auto procedure = [&implementation](const char *utf8, size_t size,
char32_t *utf32) -> size_t {
simdutf::result res =
implementation.convert_utf8_to_utf32_with_errors(utf8, size, utf32);
ASSERT_EQUAL(res.error, simdutf::error_code::SUCCESS);
return res.count;
};
auto size_procedure = [&implementation](const char *utf8,
size_t size) -> size_t {
return implementation.utf32_length_from_utf8(utf8, size);
};
for (size_t size : input_size) {
transcode_utf8_to_utf32_test_base test(random, size);
ASSERT_TRUE(test(procedure));
ASSERT_TRUE(test.check_size(size_procedure));
}
}
TEST_LOOP(convert_3_or_4_UTF8_bytes) {
simdutf::tests::helpers::RandomIntRanges random(
{{0x0800, 0xd800 - 1}, {0xe000, 0x10ffff}},
seed); // range for 3 or 4 UTF-8 bytes
auto procedure = [&implementation](const char *utf8, size_t size,
char32_t *utf32) -> size_t {
simdutf::result res =
implementation.convert_utf8_to_utf32_with_errors(utf8, size, utf32);
ASSERT_EQUAL(res.error, simdutf::error_code::SUCCESS);
return res.count;
};
auto size_procedure = [&implementation](const char *utf8,
size_t size) -> size_t {
return implementation.utf32_length_from_utf8(utf8, size);
};
for (size_t size : input_size) {
transcode_utf8_to_utf32_test_base test(random, size);
ASSERT_TRUE(test(procedure));
ASSERT_TRUE(test.check_size(size_procedure));
}
}
TEST_LOOP(too_large_error) {
simdutf::tests::helpers::RandomIntRanges random(
{{0x0000, 0xd800 - 1}, {0xe000, 0x10ffff}}, seed);
transcode_utf8_to_utf32_test_base test(random, fix_size);
for (unsigned int i = 1; i < fix_size; i++) {
if ((test.input_utf8[i] & 0b11111000) ==
0b11110000) { // Can only have too large error in 4-bytes case
auto procedure = [&implementation, &i](const char *utf8, size_t size,
char32_t *utf32) -> size_t {
simdutf::result res =
implementation.convert_utf8_to_utf32_with_errors(utf8, size, utf32);
ASSERT_EQUAL(res.error, simdutf::error_code::TOO_LARGE);
ASSERT_EQUAL(res.count, i);
return 0;
};
test.input_utf8[i] += ((test.input_utf8[i] & 0b100) == 0b100)
? 0b10
: 0b100; // Make sure we get too large error and
// not header bits error
ASSERT_TRUE(test(procedure));
test.input_utf8[i] -= 0b100;
}
}
}
TEST_LOOP(surrogate_error) {
simdutf::tests::helpers::RandomIntRanges random(
{{0x0000, 0xd800 - 1}, {0xe000, 0x10ffff}}, seed);
transcode_utf8_to_utf32_test_base test(random, fix_size);
for (unsigned int i = 1; i < fix_size; i++) {
if ((test.input_utf8[i] & 0b11110000) ==
0b11100000) { // Can only have surrogate error in 3-bytes case
auto procedure = [&implementation, &i](const char *utf8, size_t size,
char32_t *utf32) -> size_t {
simdutf::result res =
implementation.convert_utf8_to_utf32_with_errors(utf8, size, utf32);
ASSERT_EQUAL(res.error, simdutf::error_code::SURROGATE);
ASSERT_EQUAL(res.count, i);
return 0;
};
const unsigned char old = test.input_utf8[i];
const unsigned char second_old = test.input_utf8[i + 1];
test.input_utf8[i] = char(0b11101101);
for (int s = 0x8; s < 0xf;
s++) { // Modify second byte to create a surrogate codepoint
test.input_utf8[i + 1] =
(test.input_utf8[i + 1] & 0b11000011) | (s << 2);
ASSERT_TRUE(test(procedure));
}
test.input_utf8[i] = old;
test.input_utf8[i + 1] = second_old;
}
}
}
TEST_MAIN
|
