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
|
/*
* Copyright (C) 2007-2024 Apple Inc. All rights reserved.
* Copyright (C) 2010 Patrick Gansterer <paroga@paroga.com>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include <wtf/unicode/UTF8Conversion.h>
#include <unicode/uchar.h>
#include <wtf/ASCIICType.h>
#include <wtf/text/StringHasherInlines.h>
#include <wtf/text/icu/UnicodeExtras.h>
#include <wtf/unicode/CharacterNames.h>
namespace WTF::Unicode {
static constexpr char32_t sentinelCodePoint = U_SENTINEL;
enum class Replacement : bool { None, ReplaceInvalidSequences };
template<Replacement = Replacement::None, typename CharacterType> static char32_t next(std::span<const CharacterType>, size_t& offset);
template<Replacement = Replacement::None, typename CharacterType> static bool append(std::span<CharacterType>, size_t& offset, char32_t character);
template<> char32_t next<Replacement::None, LChar>(std::span<const LChar> characters, size_t& offset)
{
return characters[offset++];
}
template<> char32_t next<Replacement::None, char8_t>(std::span<const char8_t> characters, size_t& offset)
{
char32_t character;
U8_NEXT_SPAN(characters, offset, character);
return U_IS_SURROGATE(character) ? sentinelCodePoint : character;
}
template<> char32_t next<Replacement::ReplaceInvalidSequences, char8_t>(std::span<const char8_t> characters, size_t& offset)
{
char32_t character;
U8_NEXT_OR_FFFD_SPAN(characters, offset, character);
return character;
}
template<> char32_t next<Replacement::None, char16_t>(std::span<const char16_t> characters, size_t& offset)
{
char32_t character;
U16_NEXT(characters, offset, characters.size(), character);
return U_IS_SURROGATE(character) ? sentinelCodePoint : character;
}
template<> char32_t next<Replacement::ReplaceInvalidSequences, char16_t>(std::span<const char16_t> characters, size_t& offset)
{
char32_t character;
U16_NEXT_OR_FFFD(characters, offset, characters.size(), character);
return character;
}
template<> bool append<Replacement::None, char8_t>(std::span<char8_t> characters, size_t& offset, char32_t character)
{
UBool sawError = false;
U8_APPEND(characters, offset, characters.size(), character, sawError);
return sawError;
}
template<> bool append<Replacement::ReplaceInvalidSequences, char8_t>(std::span<char8_t> characters, size_t& offset, char32_t character)
{
return append(characters, offset, character)
&& append(characters, offset, replacementCharacter);
}
template<> bool append<Replacement::None, char16_t>(std::span<char16_t> characters, size_t& offset, char32_t character)
{
UBool sawError = false;
U16_APPEND(characters, offset, characters.size(), character, sawError);
return sawError;
}
template<> bool append<Replacement::ReplaceInvalidSequences, char16_t>(std::span<char16_t> characters, size_t& offset, char32_t character)
{
return append(characters, offset, character)
&& append(characters, offset, replacementCharacter);
}
template<Replacement replacement = Replacement::None, typename SourceCharacterType, typename BufferCharacterType> static ConversionResult<BufferCharacterType> convertInternal(std::span<const SourceCharacterType> source, std::span<BufferCharacterType> buffer)
{
auto resultCode = ConversionResultCode::Success;
size_t bufferOffset = 0;
char32_t orAllData = 0;
for (size_t sourceOffset = 0; sourceOffset < source.size(); ) {
char32_t character = next<replacement>(source, sourceOffset);
if (character == sentinelCodePoint) {
resultCode = ConversionResultCode::SourceInvalid;
break;
}
if (bufferOffset == buffer.size()) {
resultCode = ConversionResultCode::TargetExhausted;
break;
}
bool sawError = append<replacement>(buffer, bufferOffset, character);
if (sawError) {
resultCode = ConversionResultCode::TargetExhausted;
break;
}
orAllData |= character;
}
return { resultCode, buffer.first(bufferOffset), isASCII(orAllData) };
}
ConversionResult<char8_t> convert(std::span<const char16_t> source, std::span<char8_t> buffer)
{
return convertInternal(source, buffer);
}
ConversionResult<char16_t> convert(std::span<const char8_t> source, std::span<char16_t> buffer)
{
return convertInternal(source, buffer);
}
ConversionResult<char8_t> convert(std::span<const LChar> source, std::span<char8_t> buffer)
{
return convertInternal(source, buffer);
}
ConversionResult<char8_t> convertReplacingInvalidSequences(std::span<const char16_t> source, std::span<char8_t> buffer)
{
return convertInternal<Replacement::ReplaceInvalidSequences>(source, buffer);
}
ConversionResult<char16_t> convertReplacingInvalidSequences(std::span<const char8_t> source, std::span<char16_t> buffer)
{
return convertInternal<Replacement::ReplaceInvalidSequences>(source, buffer);
}
CheckedUTF8 checkUTF8(std::span<const char8_t> source)
{
size_t lengthUTF16 = 0;
char32_t orAllData = 0;
size_t sourceOffset;
for (sourceOffset = 0; sourceOffset < source.size(); ) {
size_t nextSourceOffset = sourceOffset;
char32_t character = next(source, nextSourceOffset);
if (character == sentinelCodePoint)
break;
sourceOffset = nextSourceOffset;
lengthUTF16 += U16_LENGTH(character);
orAllData |= character;
}
return { source.first(sourceOffset), lengthUTF16, isASCII(orAllData) };
}
UTF16LengthWithHash computeUTF16LengthWithHash(std::span<const char8_t> source)
{
StringHasher hasher;
size_t lengthUTF16 = 0;
for (size_t sourceOffset = 0; sourceOffset < source.size(); ) {
char32_t character = next(source, sourceOffset);
if (character == sentinelCodePoint)
return { };
if (U_IS_BMP(character)) {
hasher.addCharacter(character);
++lengthUTF16;
} else {
hasher.addCharacter(U16_LEAD(character));
hasher.addCharacter(U16_TRAIL(character));
lengthUTF16 += 2;
}
}
return { lengthUTF16, hasher.hashWithTop8BitsMasked() };
}
template<typename CharacterTypeA, typename CharacterTypeB> bool equalInternal(std::span<CharacterTypeA> a, std::span<CharacterTypeB> b)
{
size_t offsetA = 0;
size_t offsetB = 0;
while (offsetA < a.size() && offsetB < b.size()) {
if (next(a, offsetA) != next(b, offsetB))
return false;
}
return offsetA == a.size() && offsetB == b.size();
}
bool equal(std::span<const UChar> a, std::span<const char8_t> b)
{
return equalInternal(a, b);
}
bool equal(std::span<const LChar> a, std::span<const char8_t> b)
{
return equalInternal(a, b);
}
} // namespace WTF::Unicode
|
