2 //===----------------------------------------------------------------------===//
4 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
5 // See https://llvm.org/LICENSE.txt for license information.
6 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
8 //===----------------------------------------------------------------------===//
10 #ifndef _LIBCPP___FORMAT_UNICODE_H
11 #define _LIBCPP___FORMAT_UNICODE_H
14 #include <__bit/countl.h>
15 #include <__concepts/same_as.h>
17 #include <__format/extended_grapheme_cluster_table.h>
18 #include <__iterator/concepts.h>
19 #include <__iterator/readable_traits.h> // iter_value_t
20 #include <string_view>
22 #if !defined(_LIBCPP_HAS_NO_PRAGMA_SYSTEM_HEADER)
23 # pragma GCC system_header
26 _LIBCPP_BEGIN_NAMESPACE_STD
28 #if _LIBCPP_STD_VER >= 20
32 // Helper struct for the result of a consume operation.
34 // The status value for a correct code point is 0. This allows a valid value to
35 // be used without masking.
36 // When the decoding fails it know the number of code units affected. For the
37 // current use-cases that value is not needed, therefore it is not stored.
38 // The escape routine needs the number of code units for both a valid and
39 // invalid character and keeps track of it itself. Doing it in this result
40 // unconditionally would give some overhead when the value is unneeded.
41 struct __consume_result
{
42 // When __status == __ok it contains the decoded code point.
43 // Else it contains the replacement character U+FFFD
44 char32_t __code_point
: 31;
47 // Consumed a well-formed code point.
49 // Encountered invalid UTF-8
51 } __status
: 1 {__ok
};
53 static_assert(sizeof(__consume_result
) == sizeof(char32_t
));
55 # ifndef _LIBCPP_HAS_NO_UNICODE
57 /// Implements the grapheme cluster boundary rules
59 /// These rules are used to implement format's width estimation as stated in
60 /// [format.string.std]/11
62 /// The Standard refers to UAX \#29 for Unicode 12.0.0
63 /// https://www.unicode.org/reports/tr29/#Grapheme_Cluster_Boundary_Rules
65 /// The data tables used are
66 /// https://www.unicode.org/Public/UCD/latest/ucd/auxiliary/GraphemeBreakProperty.txt
67 /// https://www.unicode.org/Public/UCD/latest/ucd/emoji/emoji-data.txt
68 /// https://www.unicode.org/Public/UCD/latest/ucd/auxiliary/GraphemeBreakTest.txt (for testing only)
70 inline constexpr char32_t __replacement_character
= U
'\ufffd';
72 // The error of a consume operation.
74 // This sets the code point to the replacement character. This code point does
75 // not participate in the grapheme clustering, so grapheme clustering code can
76 // ignore the error status and always use the code point.
77 inline constexpr __consume_result __consume_result_error
{__replacement_character
, __consume_result::__error
};
79 [[nodiscard
]] _LIBCPP_HIDE_FROM_ABI
constexpr bool __is_high_surrogate(char32_t __value
) {
80 return __value
>= 0xd800 && __value
<= 0xdbff;
83 [[nodiscard
]] _LIBCPP_HIDE_FROM_ABI
constexpr bool __is_low_surrogate(char32_t __value
) {
84 return __value
>= 0xdc00 && __value
<= 0xdfff;
87 // https://www.unicode.org/glossary/#surrogate_code_point
88 [[nodiscard
]] _LIBCPP_HIDE_FROM_ABI
inline constexpr bool __is_surrogate(char32_t __value
) {
89 return __value
>= 0xd800 && __value
<= 0xdfff;
92 // https://www.unicode.org/glossary/#code_point
93 [[nodiscard
]] _LIBCPP_HIDE_FROM_ABI
inline constexpr bool __is_code_point(char32_t __value
) {
94 return __value
<= 0x10ffff;
97 // https://www.unicode.org/glossary/#unicode_scalar_value
98 [[nodiscard
]] _LIBCPP_HIDE_FROM_ABI
inline constexpr bool __is_scalar_value(char32_t __value
) {
99 return __unicode::__is_code_point(__value
) && !__unicode::__is_surrogate(__value
);
102 template <contiguous_iterator _Iterator
>
103 requires same_as
<iter_value_t
<_Iterator
>, char>
104 _LIBCPP_HIDE_FROM_ABI
constexpr bool __is_continuation(_Iterator __char
, int __count
) {
106 if ((*__char
& 0b1100'0000) != 0b1000'0000)
114 /// Helper class to extract a code unit from a Unicode character range.
116 /// The stored range is a view. There are multiple specialization for different
118 template <class _CharT
>
119 class __code_point_view
;
121 /// UTF-8 specialization.
123 class __code_point_view
<char> {
124 using _Iterator
= basic_string_view
<char>::const_iterator
;
127 _LIBCPP_HIDE_FROM_ABI
constexpr explicit __code_point_view(_Iterator __first
, _Iterator __last
)
128 : __first_(__first
), __last_(__last
) {}
130 _LIBCPP_HIDE_FROM_ABI
constexpr bool __at_end() const noexcept
{ return __first_
== __last_
; }
131 _LIBCPP_HIDE_FROM_ABI
constexpr _Iterator
__position() const noexcept
{ return __first_
; }
133 // https://www.unicode.org/versions/latest/ch03.pdf#G7404
134 // Based on Table 3-7, Well-Formed UTF-8 Byte Sequences
136 // Code Points First Byte Second Byte Third Byte Fourth Byte Remarks
137 // U+0000..U+007F 00..7F U+0000..U+007F 1 code unit range
138 // C0..C1 80..BF invalid overlong encoding
139 // U+0080..U+07FF C2..DF 80..BF U+0080..U+07FF 2 code unit range
140 // E0 80..9F 80..BF invalid overlong encoding
141 // U+0800..U+0FFF E0 A0..BF 80..BF U+0800..U+FFFF 3 code unit range
142 // U+1000..U+CFFF E1..EC 80..BF 80..BF
143 // U+D000..U+D7FF ED 80..9F 80..BF
144 // U+D800..U+DFFF ED A0..BF 80..BF invalid encoding of surrogate code point
145 // U+E000..U+FFFF EE..EF 80..BF 80..BF
146 // F0 80..8F 80..BF 80..BF invalid overlong encoding
147 // U+10000..U+3FFFF F0 90..BF 80..BF 80..BF U+10000..U+10FFFF 4 code unit range
148 // U+40000..U+FFFFF F1..F3 80..BF 80..BF 80..BF
149 // U+100000..U+10FFFF F4 80..8F 80..BF 80..BF
150 // F4 90..BF 80..BF 80..BF U+110000.. invalid code point range
152 // Unlike other parsers, these invalid entries are tested after decoding.
153 // - The parser always needs to consume these code units
154 // - The code is optimized for well-formed UTF-8
155 [[nodiscard
]] _LIBCPP_HIDE_FROM_ABI
constexpr __consume_result
__consume() noexcept
{
156 _LIBCPP_ASSERT_UNCATEGORIZED(__first_
!= __last_
, "can't move beyond the end of input");
158 // Based on the number of leading 1 bits the number of code units in the
159 // code point can be determined. See
160 // https://en.wikipedia.org/wiki/UTF-8#Encoding
161 switch (std::countl_one(static_cast<unsigned char>(*__first_
))) {
163 return {static_cast<unsigned char>(*__first_
++)};
166 if (__last_
- __first_
< 2 || !__unicode::__is_continuation(__first_
+ 1, 1)) [[unlikely
]]
169 char32_t __value
= static_cast<unsigned char>(*__first_
++) & 0x1f;
171 __value
|= static_cast<unsigned char>(*__first_
++) & 0x3f;
173 // These values should be encoded in 1 UTF-8 code unit.
174 if (__value
< 0x0080) [[unlikely
]]
175 return __consume_result_error
;
181 if (__last_
- __first_
< 3 || !__unicode::__is_continuation(__first_
+ 1, 2)) [[unlikely
]]
184 char32_t __value
= static_cast<unsigned char>(*__first_
++) & 0x0f;
186 __value
|= static_cast<unsigned char>(*__first_
++) & 0x3f;
188 __value
|= static_cast<unsigned char>(*__first_
++) & 0x3f;
190 // These values should be encoded in 1 or 2 UTF-8 code units.
191 if (__value
< 0x0800) [[unlikely
]]
192 return __consume_result_error
;
194 // A surrogate value is always encoded in 3 UTF-8 code units.
195 if (__unicode::__is_surrogate(__value
)) [[unlikely
]]
196 return __consume_result_error
;
202 if (__last_
- __first_
< 4 || !__unicode::__is_continuation(__first_
+ 1, 3)) [[unlikely
]]
205 char32_t __value
= static_cast<unsigned char>(*__first_
++) & 0x07;
207 __value
|= static_cast<unsigned char>(*__first_
++) & 0x3f;
209 __value
|= static_cast<unsigned char>(*__first_
++) & 0x3f;
211 __value
|= static_cast<unsigned char>(*__first_
++) & 0x3f;
213 // These values should be encoded in 1, 2, or 3 UTF-8 code units.
214 if (__value
< 0x10000) [[unlikely
]]
215 return __consume_result_error
;
217 // A value too large is always encoded in 4 UTF-8 code units.
218 if (!__unicode::__is_code_point(__value
)) [[unlikely
]]
219 return __consume_result_error
;
224 // An invalid number of leading ones can be garbage or a code unit in the
225 // middle of a code point. By consuming one code unit the parser may get
226 // "in sync" after a few code units.
228 return __consume_result_error
;
236 # ifndef _LIBCPP_HAS_NO_WIDE_CHARACTERS
237 _LIBCPP_HIDE_FROM_ABI
constexpr bool __is_surrogate_pair_high(wchar_t __value
) {
238 return __value
>= 0xd800 && __value
<= 0xdbff;
241 _LIBCPP_HIDE_FROM_ABI
constexpr bool __is_surrogate_pair_low(wchar_t __value
) {
242 return __value
>= 0xdc00 && __value
<= 0xdfff;
245 /// This specialization depends on the size of wchar_t
246 /// - 2 UTF-16 (for example Windows and AIX)
247 /// - 4 UTF-32 (for example Linux)
249 class __code_point_view
<wchar_t> {
250 using _Iterator
= typename basic_string_view
<wchar_t>::const_iterator
;
253 static_assert(sizeof(wchar_t) == 2 || sizeof(wchar_t) == 4, "sizeof(wchar_t) has a not implemented value");
255 _LIBCPP_HIDE_FROM_ABI
constexpr explicit __code_point_view(_Iterator __first
, _Iterator __last
)
256 : __first_(__first
), __last_(__last
) {}
258 _LIBCPP_HIDE_FROM_ABI
constexpr _Iterator
__position() const noexcept
{ return __first_
; }
259 _LIBCPP_HIDE_FROM_ABI
constexpr bool __at_end() const noexcept
{ return __first_
== __last_
; }
261 [[nodiscard
]] _LIBCPP_HIDE_FROM_ABI
constexpr __consume_result
__consume() noexcept
{
262 _LIBCPP_ASSERT_UNCATEGORIZED(__first_
!= __last_
, "can't move beyond the end of input");
264 char32_t __value
= static_cast<char32_t
>(*__first_
++);
265 if constexpr (sizeof(wchar_t) == 2) {
266 if (__unicode::__is_low_surrogate(__value
)) [[unlikely
]]
267 return __consume_result_error
;
269 if (__unicode::__is_high_surrogate(__value
)) {
270 if (__first_
== __last_
|| !__unicode::__is_low_surrogate(static_cast<char32_t
>(*__first_
))) [[unlikely
]]
271 return __consume_result_error
;
275 __value
+= static_cast<char32_t
>(*__first_
++) - 0xdc00;
278 if (!__unicode::__is_code_point(__value
)) [[unlikely
]]
279 return __consume_result_error
;
282 if (!__unicode::__is_scalar_value(__value
)) [[unlikely
]]
283 return __consume_result_error
;
293 # endif // _LIBCPP_HAS_NO_WIDE_CHARACTERS
295 _LIBCPP_HIDE_FROM_ABI
constexpr bool __at_extended_grapheme_cluster_break(
296 bool& __ri_break_allowed
,
297 bool __has_extened_pictographic
,
298 __extended_grapheme_custer_property_boundary::__property __prev
,
299 __extended_grapheme_custer_property_boundary::__property __next
) {
300 using __extended_grapheme_custer_property_boundary::__property
;
302 __has_extened_pictographic
|= __prev
== __property::__Extended_Pictographic
;
304 // https://www.unicode.org/reports/tr29/tr29-39.html#Grapheme_Cluster_Boundary_Rules
306 // *** Break at the start and end of text, unless the text is empty. ***
308 _LIBCPP_ASSERT_UNCATEGORIZED(__prev
!= __property::__sot
, "should be handled in the constructor"); // GB1
309 _LIBCPP_ASSERT_UNCATEGORIZED(__prev
!= __property::__eot
, "should be handled by our caller"); // GB2
311 // *** Do not break between a CR and LF. Otherwise, break before and after controls. ***
312 if (__prev
== __property::__CR
&& __next
== __property::__LF
) // GB3
315 if (__prev
== __property::__Control
|| __prev
== __property::__CR
|| __prev
== __property::__LF
) // GB4
318 if (__next
== __property::__Control
|| __next
== __property::__CR
|| __next
== __property::__LF
) // GB5
321 // *** Do not break Hangul syllable sequences. ***
322 if (__prev
== __property::__L
&&
323 (__next
== __property::__L
|| __next
== __property::__V
|| __next
== __property::__LV
||
324 __next
== __property::__LVT
)) // GB6
327 if ((__prev
== __property::__LV
|| __prev
== __property::__V
) &&
328 (__next
== __property::__V
|| __next
== __property::__T
)) // GB7
331 if ((__prev
== __property::__LVT
|| __prev
== __property::__T
) && __next
== __property::__T
) // GB8
334 // *** Do not break before extending characters or ZWJ. ***
335 if (__next
== __property::__Extend
|| __next
== __property::__ZWJ
)
338 // *** Do not break before SpacingMarks, or after Prepend characters. ***
339 if (__next
== __property::__SpacingMark
) // GB9a
342 if (__prev
== __property::__Prepend
) // GB9b
345 // *** Do not break within emoji modifier sequences or emoji zwj sequences. ***
347 // GB11 \p{Extended_Pictographic} Extend* ZWJ x \p{Extended_Pictographic}
349 // Note that several parts of this rule are matched by GB9: Any x (Extend | ZWJ)
350 // - \p{Extended_Pictographic} x Extend
352 // - \p{Extended_Pictographic} x ZWJ
355 // So the only case left to test is
356 // - \p{Extended_Pictographic}' x ZWJ x \p{Extended_Pictographic}
357 // where \p{Extended_Pictographic}' is stored in __has_extened_pictographic
358 if (__has_extened_pictographic
&& __prev
== __property::__ZWJ
&& __next
== __property::__Extended_Pictographic
)
361 // *** Do not break within emoji flag sequences ***
363 // That is, do not break between regional indicator (RI) symbols if there
364 // is an odd number of RI characters before the break point.
366 if (__prev
== __property::__Regional_Indicator
&& __next
== __property::__Regional_Indicator
) { // GB12 + GB13
367 __ri_break_allowed
= !__ri_break_allowed
;
368 return __ri_break_allowed
;
371 // *** Otherwise, break everywhere. ***
372 return true; // GB999
375 /// Helper class to extract an extended grapheme cluster from a Unicode character range.
377 /// This function is used to determine the column width of an extended grapheme
378 /// cluster. In order to do that only the first code point is evaluated.
379 /// Therefore only this code point is extracted.
380 template <class _CharT
>
381 class __extended_grapheme_cluster_view
{
382 using _Iterator
= typename basic_string_view
<_CharT
>::const_iterator
;
385 _LIBCPP_HIDE_FROM_ABI
constexpr explicit __extended_grapheme_cluster_view(_Iterator __first
, _Iterator __last
)
386 : __code_point_view_(__first
, __last
),
387 __next_code_point_(__code_point_view_
.__consume().__code_point
),
388 __next_prop_(__extended_grapheme_custer_property_boundary::__get_property(__next_code_point_
)) {}
391 /// The first code point of the extended grapheme cluster.
393 /// The first code point is used to estimate the width of the extended
394 /// grapheme cluster.
395 char32_t __code_point_
;
397 /// Points one beyond the last code unit in the extended grapheme cluster.
399 /// It's expected the caller has the start position and thus can determine
400 /// the code unit range of the extended grapheme cluster.
404 _LIBCPP_HIDE_FROM_ABI
constexpr __cluster
__consume() {
405 _LIBCPP_ASSERT_UNCATEGORIZED(
406 __next_prop_
!= __extended_grapheme_custer_property_boundary::__property::__eot
,
407 "can't move beyond the end of input");
409 char32_t __code_point
= __next_code_point_
;
410 if (!__code_point_view_
.__at_end())
411 return {__code_point
, __get_break()};
413 __next_prop_
= __extended_grapheme_custer_property_boundary::__property::__eot
;
414 return {__code_point
, __code_point_view_
.__position()};
418 __code_point_view
<_CharT
> __code_point_view_
;
420 char32_t __next_code_point_
;
421 __extended_grapheme_custer_property_boundary::__property __next_prop_
;
423 _LIBCPP_HIDE_FROM_ABI
constexpr _Iterator
__get_break() {
424 bool __ri_break_allowed
= true;
425 bool __has_extened_pictographic
= false;
427 _Iterator __result
= __code_point_view_
.__position();
428 __extended_grapheme_custer_property_boundary::__property __prev
= __next_prop_
;
429 if (__code_point_view_
.__at_end()) {
430 __next_prop_
= __extended_grapheme_custer_property_boundary::__property::__eot
;
433 __next_code_point_
= __code_point_view_
.__consume().__code_point
;
434 __next_prop_
= __extended_grapheme_custer_property_boundary::__get_property(__next_code_point_
);
436 __has_extened_pictographic
|=
437 __prev
== __extended_grapheme_custer_property_boundary::__property::__Extended_Pictographic
;
439 if (__at_extended_grapheme_cluster_break(__ri_break_allowed
, __has_extened_pictographic
, __prev
, __next_prop_
))
445 template <contiguous_iterator _Iterator
>
446 __extended_grapheme_cluster_view(_Iterator
, _Iterator
) -> __extended_grapheme_cluster_view
<iter_value_t
<_Iterator
>>;
448 # else // _LIBCPP_HAS_NO_UNICODE
450 // For ASCII every character is a "code point".
451 // This makes it easier to write code agnostic of the _LIBCPP_HAS_NO_UNICODE define.
452 template <class _CharT
>
453 class __code_point_view
{
454 using _Iterator
= typename basic_string_view
<_CharT
>::const_iterator
;
457 _LIBCPP_HIDE_FROM_ABI
constexpr explicit __code_point_view(_Iterator __first
, _Iterator __last
)
458 : __first_(__first
), __last_(__last
) {}
460 _LIBCPP_HIDE_FROM_ABI
constexpr bool __at_end() const noexcept
{ return __first_
== __last_
; }
461 _LIBCPP_HIDE_FROM_ABI
constexpr _Iterator
__position() const noexcept
{ return __first_
; }
463 [[nodiscard
]] _LIBCPP_HIDE_FROM_ABI
constexpr __consume_result
__consume() noexcept
{
464 _LIBCPP_ASSERT_UNCATEGORIZED(__first_
!= __last_
, "can't move beyond the end of input");
465 return {static_cast<char32_t
>(*__first_
++)};
473 # endif // _LIBCPP_HAS_NO_UNICODE
475 } // namespace __unicode
477 #endif //_LIBCPP_STD_VER >= 20
479 _LIBCPP_END_NAMESPACE_STD
481 #endif // _LIBCPP___FORMAT_UNICODE_H