3 * Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
4 * by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * 'What a fix!' said Sam. 'That's the one place in all the lands we've ever
13 * heard of that we don't want to see any closer; and that's the one place
14 * we're trying to get to! And that's just where we can't get, nohow.'
16 * [p.603 of _The Lord of the Rings_, IV/I: "The Taming of Sméagol"]
18 * 'Well do I understand your speech,' he answered in the same language;
19 * 'yet few strangers do so. Why then do you not speak in the Common Tongue,
20 * as is the custom in the West, if you wish to be answered?'
21 * --Gandalf, addressing Théoden's door wardens
23 * [p.508 of _The Lord of the Rings_, III/vi: "The King of the Golden Hall"]
25 * ...the travellers perceived that the floor was paved with stones of many
26 * hues; branching runes and strange devices intertwined beneath their feet.
28 * [p.512 of _The Lord of the Rings_, III/vi: "The King of the Golden Hall"]
32 #define PERL_IN_UTF8_C
34 #include "invlist_inline.h"
36 static const char malformed_text[] = "Malformed UTF-8 character";
37 static const char unees[] =
38 "Malformed UTF-8 character (unexpected end of string)";
39 static const char cp_above_legal_max[] =
40 "Use of code point 0x%" UVXf " is not allowed; the"
41 " permissible max is 0x%" UVXf;
43 #define MAX_EXTERNALLY_LEGAL_CP ((UV) (IV_MAX))
46 =head1 Unicode Support
47 These are various utility functions for manipulating UTF8-encoded
48 strings. For the uninitiated, this is a method of representing arbitrary
49 Unicode characters as a variable number of bytes, in such a way that
50 characters in the ASCII range are unmodified, and a zero byte never appears
51 within non-zero characters.
57 Perl__force_out_malformed_utf8_message(pTHX_
58 const U8 *const p, /* First byte in UTF-8 sequence */
59 const U8 * const e, /* Final byte in sequence (may include
61 const U32 flags, /* Flags to pass to utf8n_to_uvchr(),
62 usually 0, or some DISALLOW flags */
63 const bool die_here) /* If TRUE, this function does not return */
65 /* This core-only function is to be called when a malformed UTF-8 character
66 * is found, in order to output the detailed information about the
67 * malformation before dieing. The reason it exists is for the occasions
68 * when such a malformation is fatal, but warnings might be turned off, so
69 * that normally they would not be actually output. This ensures that they
70 * do get output. Because a sequence may be malformed in more than one
71 * way, multiple messages may be generated, so we can't make them fatal, as
72 * that would cause the first one to die.
74 * Instead we pretend -W was passed to perl, then die afterwards. The
75 * flexibility is here to return to the caller so they can finish up and
79 PERL_ARGS_ASSERT__FORCE_OUT_MALFORMED_UTF8_MESSAGE;
85 PL_dowarn = G_WARN_ALL_ON|G_WARN_ON;
87 PL_curcop->cop_warnings = pWARN_ALL;
90 (void) utf8n_to_uvchr_error(p, e - p, NULL, flags & ~UTF8_CHECK_ONLY, &errors);
95 Perl_croak(aTHX_ "panic: _force_out_malformed_utf8_message should"
96 " be called only when there are errors found");
100 Perl_croak(aTHX_ "Malformed UTF-8 character (fatal)");
105 =for apidoc uvoffuni_to_utf8_flags
107 THIS FUNCTION SHOULD BE USED IN ONLY VERY SPECIALIZED CIRCUMSTANCES.
108 Instead, B<Almost all code should use L</uvchr_to_utf8> or
109 L</uvchr_to_utf8_flags>>.
111 This function is like them, but the input is a strict Unicode
112 (as opposed to native) code point. Only in very rare circumstances should code
113 not be using the native code point.
115 For details, see the description for L</uvchr_to_utf8_flags>.
120 /* All these formats take a single UV code point argument */
121 const char surrogate_cp_format[] = "UTF-16 surrogate U+%04" UVXf;
122 const char nonchar_cp_format[] = "Unicode non-character U+%04" UVXf
123 " is not recommended for open interchange";
124 const char super_cp_format[] = "Code point 0x%" UVXf " is not Unicode,"
125 " may not be portable";
126 const char perl_extended_cp_format[] = "Code point 0x%" UVXf " is not" \
127 " Unicode, requires a Perl extension," \
128 " and so is not portable";
130 #define HANDLE_UNICODE_SURROGATE(uv, flags) \
132 if (flags & UNICODE_WARN_SURROGATE) { \
133 Perl_ck_warner_d(aTHX_ packWARN(WARN_SURROGATE), \
134 surrogate_cp_format, uv); \
136 if (flags & UNICODE_DISALLOW_SURROGATE) { \
141 #define HANDLE_UNICODE_NONCHAR(uv, flags) \
143 if (flags & UNICODE_WARN_NONCHAR) { \
144 Perl_ck_warner_d(aTHX_ packWARN(WARN_NONCHAR), \
145 nonchar_cp_format, uv); \
147 if (flags & UNICODE_DISALLOW_NONCHAR) { \
152 /* Use shorter names internally in this file */
153 #define SHIFT UTF_ACCUMULATION_SHIFT
155 #define MARK UTF_CONTINUATION_MARK
156 #define MASK UTF_CONTINUATION_MASK
159 Perl_uvoffuni_to_utf8_flags(pTHX_ U8 *d, UV uv, const UV flags)
161 PERL_ARGS_ASSERT_UVOFFUNI_TO_UTF8_FLAGS;
163 if (OFFUNI_IS_INVARIANT(uv)) {
164 *d++ = LATIN1_TO_NATIVE(uv);
168 if (uv <= MAX_UTF8_TWO_BYTE) {
169 *d++ = I8_TO_NATIVE_UTF8(( uv >> SHIFT) | UTF_START_MARK(2));
170 *d++ = I8_TO_NATIVE_UTF8(( uv & MASK) | MARK);
174 /* Not 2-byte; test for and handle 3-byte result. In the test immediately
175 * below, the 16 is for start bytes E0-EF (which are all the possible ones
176 * for 3 byte characters). The 2 is for 2 continuation bytes; these each
177 * contribute SHIFT bits. This yields 0x4000 on EBCDIC platforms, 0x1_0000
178 * on ASCII; so 3 bytes covers the range 0x400-0x3FFF on EBCDIC;
179 * 0x800-0xFFFF on ASCII */
180 if (uv < (16 * (1U << (2 * SHIFT)))) {
181 *d++ = I8_TO_NATIVE_UTF8(( uv >> ((3 - 1) * SHIFT)) | UTF_START_MARK(3));
182 *d++ = I8_TO_NATIVE_UTF8(((uv >> ((2 - 1) * SHIFT)) & MASK) | MARK);
183 *d++ = I8_TO_NATIVE_UTF8(( uv /* (1 - 1) */ & MASK) | MARK);
185 #ifndef EBCDIC /* These problematic code points are 4 bytes on EBCDIC, so
186 aren't tested here */
187 /* The most likely code points in this range are below the surrogates.
188 * Do an extra test to quickly exclude those. */
189 if (UNLIKELY(uv >= UNICODE_SURROGATE_FIRST)) {
190 if (UNLIKELY( UNICODE_IS_32_CONTIGUOUS_NONCHARS(uv)
191 || UNICODE_IS_END_PLANE_NONCHAR_GIVEN_NOT_SUPER(uv)))
193 HANDLE_UNICODE_NONCHAR(uv, flags);
195 else if (UNLIKELY(UNICODE_IS_SURROGATE(uv))) {
196 HANDLE_UNICODE_SURROGATE(uv, flags);
203 /* Not 3-byte; that means the code point is at least 0x1_0000 on ASCII
204 * platforms, and 0x4000 on EBCDIC. There are problematic cases that can
205 * happen starting with 4-byte characters on ASCII platforms. We unify the
206 * code for these with EBCDIC, even though some of them require 5-bytes on
207 * those, because khw believes the code saving is worth the very slight
208 * performance hit on these high EBCDIC code points. */
210 if (UNLIKELY(UNICODE_IS_SUPER(uv))) {
211 if (UNLIKELY(uv > MAX_EXTERNALLY_LEGAL_CP)) {
212 Perl_croak(aTHX_ cp_above_legal_max, uv, MAX_EXTERNALLY_LEGAL_CP);
214 if ( (flags & UNICODE_WARN_SUPER)
215 || ( (flags & UNICODE_WARN_PERL_EXTENDED)
216 && UNICODE_IS_PERL_EXTENDED(uv)))
218 Perl_ck_warner_d(aTHX_ packWARN(WARN_NON_UNICODE),
220 /* Choose the more dire applicable warning */
221 (UNICODE_IS_PERL_EXTENDED(uv))
222 ? perl_extended_cp_format
226 if ( (flags & UNICODE_DISALLOW_SUPER)
227 || ( (flags & UNICODE_DISALLOW_PERL_EXTENDED)
228 && UNICODE_IS_PERL_EXTENDED(uv)))
233 else if (UNLIKELY(UNICODE_IS_END_PLANE_NONCHAR_GIVEN_NOT_SUPER(uv))) {
234 HANDLE_UNICODE_NONCHAR(uv, flags);
237 /* Test for and handle 4-byte result. In the test immediately below, the
238 * 8 is for start bytes F0-F7 (which are all the possible ones for 4 byte
239 * characters). The 3 is for 3 continuation bytes; these each contribute
240 * SHIFT bits. This yields 0x4_0000 on EBCDIC platforms, 0x20_0000 on
241 * ASCII, so 4 bytes covers the range 0x4000-0x3_FFFF on EBCDIC;
242 * 0x1_0000-0x1F_FFFF on ASCII */
243 if (uv < (8 * (1U << (3 * SHIFT)))) {
244 *d++ = I8_TO_NATIVE_UTF8(( uv >> ((4 - 1) * SHIFT)) | UTF_START_MARK(4));
245 *d++ = I8_TO_NATIVE_UTF8(((uv >> ((3 - 1) * SHIFT)) & MASK) | MARK);
246 *d++ = I8_TO_NATIVE_UTF8(((uv >> ((2 - 1) * SHIFT)) & MASK) | MARK);
247 *d++ = I8_TO_NATIVE_UTF8(( uv /* (1 - 1) */ & MASK) | MARK);
249 #ifdef EBCDIC /* These were handled on ASCII platforms in the code for 3-byte
250 characters. The end-plane non-characters for EBCDIC were
251 handled just above */
252 if (UNLIKELY(UNICODE_IS_32_CONTIGUOUS_NONCHARS(uv))) {
253 HANDLE_UNICODE_NONCHAR(uv, flags);
255 else if (UNLIKELY(UNICODE_IS_SURROGATE(uv))) {
256 HANDLE_UNICODE_SURROGATE(uv, flags);
263 /* Not 4-byte; that means the code point is at least 0x20_0000 on ASCII
264 * platforms, and 0x4000 on EBCDIC. At this point we switch to a loop
265 * format. The unrolled version above turns out to not save all that much
266 * time, and at these high code points (well above the legal Unicode range
267 * on ASCII platforms, and well above anything in common use in EBCDIC),
268 * khw believes that less code outweighs slight performance gains. */
271 STRLEN len = OFFUNISKIP(uv);
274 *p-- = I8_TO_NATIVE_UTF8((uv & UTF_CONTINUATION_MASK) | UTF_CONTINUATION_MARK);
275 uv >>= UTF_ACCUMULATION_SHIFT;
277 *p = I8_TO_NATIVE_UTF8((uv & UTF_START_MASK(len)) | UTF_START_MARK(len));
283 =for apidoc uvchr_to_utf8
285 Adds the UTF-8 representation of the native code point C<uv> to the end
286 of the string C<d>; C<d> should have at least C<UVCHR_SKIP(uv)+1> (up to
287 C<UTF8_MAXBYTES+1>) free bytes available. The return value is the pointer to
288 the byte after the end of the new character. In other words,
290 d = uvchr_to_utf8(d, uv);
292 is the recommended wide native character-aware way of saying
296 This function accepts any code point from 0..C<IV_MAX> as input.
297 C<IV_MAX> is typically 0x7FFF_FFFF in a 32-bit word.
299 It is possible to forbid or warn on non-Unicode code points, or those that may
300 be problematic by using L</uvchr_to_utf8_flags>.
305 /* This is also a macro */
306 PERL_CALLCONV U8* Perl_uvchr_to_utf8(pTHX_ U8 *d, UV uv);
309 Perl_uvchr_to_utf8(pTHX_ U8 *d, UV uv)
311 return uvchr_to_utf8(d, uv);
315 =for apidoc uvchr_to_utf8_flags
317 Adds the UTF-8 representation of the native code point C<uv> to the end
318 of the string C<d>; C<d> should have at least C<UVCHR_SKIP(uv)+1> (up to
319 C<UTF8_MAXBYTES+1>) free bytes available. The return value is the pointer to
320 the byte after the end of the new character. In other words,
322 d = uvchr_to_utf8_flags(d, uv, flags);
326 d = uvchr_to_utf8_flags(d, uv, 0);
328 This is the Unicode-aware way of saying
332 If C<flags> is 0, this function accepts any code point from 0..C<IV_MAX> as
333 input. C<IV_MAX> is typically 0x7FFF_FFFF in a 32-bit word.
335 Specifying C<flags> can further restrict what is allowed and not warned on, as
338 If C<uv> is a Unicode surrogate code point and C<UNICODE_WARN_SURROGATE> is set,
339 the function will raise a warning, provided UTF8 warnings are enabled. If
340 instead C<UNICODE_DISALLOW_SURROGATE> is set, the function will fail and return
341 NULL. If both flags are set, the function will both warn and return NULL.
343 Similarly, the C<UNICODE_WARN_NONCHAR> and C<UNICODE_DISALLOW_NONCHAR> flags
344 affect how the function handles a Unicode non-character.
346 And likewise, the C<UNICODE_WARN_SUPER> and C<UNICODE_DISALLOW_SUPER> flags
347 affect the handling of code points that are above the Unicode maximum of
348 0x10FFFF. Languages other than Perl may not be able to accept files that
351 The flag C<UNICODE_WARN_ILLEGAL_INTERCHANGE> selects all three of
352 the above WARN flags; and C<UNICODE_DISALLOW_ILLEGAL_INTERCHANGE> selects all
353 three DISALLOW flags. C<UNICODE_DISALLOW_ILLEGAL_INTERCHANGE> restricts the
354 allowed inputs to the strict UTF-8 traditionally defined by Unicode.
355 Similarly, C<UNICODE_WARN_ILLEGAL_C9_INTERCHANGE> and
356 C<UNICODE_DISALLOW_ILLEGAL_C9_INTERCHANGE> are shortcuts to select the
357 above-Unicode and surrogate flags, but not the non-character ones, as
359 L<Unicode Corrigendum #9|http://www.unicode.org/versions/corrigendum9.html>.
360 See L<perlunicode/Noncharacter code points>.
362 Extremely high code points were never specified in any standard, and require an
363 extension to UTF-8 to express, which Perl does. It is likely that programs
364 written in something other than Perl would not be able to read files that
365 contain these; nor would Perl understand files written by something that uses a
366 different extension. For these reasons, there is a separate set of flags that
367 can warn and/or disallow these extremely high code points, even if other
368 above-Unicode ones are accepted. They are the C<UNICODE_WARN_PERL_EXTENDED>
369 and C<UNICODE_DISALLOW_PERL_EXTENDED> flags. For more information see
370 L</C<UTF8_GOT_PERL_EXTENDED>>. Of course C<UNICODE_DISALLOW_SUPER> will
371 treat all above-Unicode code points, including these, as malformations. (Note
372 that the Unicode standard considers anything above 0x10FFFF to be illegal, but
373 there are standards predating it that allow up to 0x7FFF_FFFF (2**31 -1))
375 A somewhat misleadingly named synonym for C<UNICODE_WARN_PERL_EXTENDED> is
376 retained for backward compatibility: C<UNICODE_WARN_ABOVE_31_BIT>. Similarly,
377 C<UNICODE_DISALLOW_ABOVE_31_BIT> is usable instead of the more accurately named
378 C<UNICODE_DISALLOW_PERL_EXTENDED>. The names are misleading because these
379 flags can apply to code points that actually do fit in 31 bits. This happens
380 on EBCDIC platforms, and sometimes when the L<overlong
381 malformation|/C<UTF8_GOT_LONG>> is also present. The new names accurately
382 describe the situation in all cases.
387 /* This is also a macro */
388 PERL_CALLCONV U8* Perl_uvchr_to_utf8_flags(pTHX_ U8 *d, UV uv, UV flags);
391 Perl_uvchr_to_utf8_flags(pTHX_ U8 *d, UV uv, UV flags)
393 return uvchr_to_utf8_flags(d, uv, flags);
399 S_is_utf8_cp_above_31_bits(const U8 * const s,
401 const bool consider_overlongs)
403 /* Returns TRUE if the first code point represented by the Perl-extended-
404 * UTF-8-encoded string starting at 's', and looking no further than 'e -
405 * 1' doesn't fit into 31 bytes. That is, that if it is >= 2**31.
407 * The function handles the case where the input bytes do not include all
408 * the ones necessary to represent a full character. That is, they may be
409 * the intial bytes of the representation of a code point, but possibly
410 * the final ones necessary for the complete representation may be beyond
413 * The function also can handle the case where the input is an overlong
414 * sequence. If 'consider_overlongs' is 0, the function assumes the
415 * input is not overlong, without checking, and will return based on that
416 * assumption. If this parameter is 1, the function will go to the trouble
417 * of figuring out if it actually evaluates to above or below 31 bits.
419 * The sequence is otherwise assumed to be well-formed, without checking.
422 const STRLEN len = e - s;
425 PERL_ARGS_ASSERT_IS_UTF8_CP_ABOVE_31_BITS;
427 assert(! UTF8_IS_INVARIANT(*s) && e > s);
431 PERL_UNUSED_ARG(consider_overlongs);
433 /* On the EBCDIC code pages we handle, only the native start byte 0xFE can
434 * mean a 32-bit or larger code point (0xFF is an invariant). 0xFE can
435 * also be the start byte for a 31-bit code point; we need at least 2
436 * bytes, and maybe up through 8 bytes, to determine that. (It can also be
437 * the start byte for an overlong sequence, but for 30-bit or smaller code
438 * points, so we don't have to worry about overlongs on EBCDIC.) */
449 /* On ASCII, FE and FF are the only start bytes that can evaluate to
450 * needing more than 31 bits. */
451 if (LIKELY(*s < 0xFE)) {
455 /* What we have left are FE and FF. Both of these require more than 31
456 * bits unless they are for overlongs. */
457 if (! consider_overlongs) {
461 /* Here, we have FE or FF. If the input isn't overlong, it evaluates to
462 * above 31 bits. But we need more than one byte to discern this, so if
463 * passed just the start byte, it could be an overlong evaluating to
469 /* Having excluded len==1, and knowing that FE and FF are both valid start
470 * bytes, we can call the function below to see if the sequence is
471 * overlong. (We don't need the full generality of the called function,
472 * but for these huge code points, speed shouldn't be a consideration, and
473 * the compiler does have enough information, since it's static to this
474 * file, to optimize to just the needed parts.) */
475 is_overlong = is_utf8_overlong_given_start_byte_ok(s, len);
477 /* If it isn't overlong, more than 31 bits are required. */
478 if (is_overlong == 0) {
482 /* If it is indeterminate if it is overlong, return that */
483 if (is_overlong < 0) {
487 /* Here is overlong. Such a sequence starting with FE is below 31 bits, as
488 * the max it can be is 2**31 - 1 */
495 /* Here, ASCII and EBCDIC rejoin:
496 * On ASCII: We have an overlong sequence starting with FF
497 * On EBCDIC: We have a sequence starting with FE. */
499 { /* For C89, use a block so the declaration can be close to its use */
503 /* U+7FFFFFFF (2 ** 31 - 1)
504 * [0] [1] [2] [3] [4] [5] [6] [7] [8] [9] 10 11 12 13
505 * IBM-1047: \xFE\x41\x41\x41\x41\x41\x41\x42\x73\x73\x73\x73\x73\x73
506 * IBM-037: \xFE\x41\x41\x41\x41\x41\x41\x42\x72\x72\x72\x72\x72\x72
507 * POSIX-BC: \xFE\x41\x41\x41\x41\x41\x41\x42\x75\x75\x75\x75\x75\x75
508 * I8: \xFF\xA0\xA0\xA0\xA0\xA0\xA0\xA1\xBF\xBF\xBF\xBF\xBF\xBF
509 * U+80000000 (2 ** 31):
510 * IBM-1047: \xFE\x41\x41\x41\x41\x41\x41\x43\x41\x41\x41\x41\x41\x41
511 * IBM-037: \xFE\x41\x41\x41\x41\x41\x41\x43\x41\x41\x41\x41\x41\x41
512 * POSIX-BC: \xFE\x41\x41\x41\x41\x41\x41\x43\x41\x41\x41\x41\x41\x41
513 * I8: \xFF\xA0\xA0\xA0\xA0\xA0\xA0\xA2\xA0\xA0\xA0\xA0\xA0\xA0
515 * and since we know that *s = \xfe, any continuation sequcence
516 * following it that is gt the below is above 31 bits
517 [0] [1] [2] [3] [4] [5] [6] */
518 const U8 conts_for_highest_30_bit[] = "\x41\x41\x41\x41\x41\x41\x42";
522 /* FF overlong for U+7FFFFFFF (2 ** 31 - 1)
523 * ASCII: \xFF\x80\x80\x80\x80\x80\x80\x81\xBF\xBF\xBF\xBF\xBF
524 * FF overlong for U+80000000 (2 ** 31):
525 * ASCII: \xFF\x80\x80\x80\x80\x80\x80\x82\x80\x80\x80\x80\x80
526 * and since we know that *s = \xff, any continuation sequcence
527 * following it that is gt the below is above 30 bits
528 [0] [1] [2] [3] [4] [5] [6] */
529 const U8 conts_for_highest_30_bit[] = "\x80\x80\x80\x80\x80\x80\x81";
533 const STRLEN conts_len = sizeof(conts_for_highest_30_bit) - 1;
534 const STRLEN cmp_len = MIN(conts_len, len - 1);
536 /* Now compare the continuation bytes in s with the ones we have
537 * compiled in that are for the largest 30 bit code point. If we have
538 * enough bytes available to determine the answer, or the bytes we do
539 * have differ from them, we can compare the two to get a definitive
540 * answer (Note that in UTF-EBCDIC, the two lowest possible
541 * continuation bytes are \x41 and \x42.) */
542 if (cmp_len >= conts_len || memNE(s + 1,
543 conts_for_highest_30_bit,
546 return cBOOL(memGT(s + 1, conts_for_highest_30_bit, cmp_len));
549 /* Here, all the bytes we have are the same as the highest 30-bit code
550 * point, but we are missing so many bytes that we can't make the
558 PERL_STATIC_INLINE int
559 S_is_utf8_overlong_given_start_byte_ok(const U8 * const s, const STRLEN len)
561 /* Returns an int indicating whether or not the UTF-8 sequence from 's' to
562 * 's' + 'len' - 1 is an overlong. It returns 1 if it is an overlong; 0 if
563 * it isn't, and -1 if there isn't enough information to tell. This last
564 * return value can happen if the sequence is incomplete, missing some
565 * trailing bytes that would form a complete character. If there are
566 * enough bytes to make a definitive decision, this function does so.
567 * Usually 2 bytes sufficient.
569 * Overlongs can occur whenever the number of continuation bytes changes.
570 * That means whenever the number of leading 1 bits in a start byte
571 * increases from the next lower start byte. That happens for start bytes
572 * C0, E0, F0, F8, FC, FE, and FF. On modern perls, the following illegal
573 * start bytes have already been excluded, so don't need to be tested here;
574 * ASCII platforms: C0, C1
575 * EBCDIC platforms C0, C1, C2, C3, C4, E0
578 const U8 s0 = NATIVE_UTF8_TO_I8(s[0]);
579 const U8 s1 = NATIVE_UTF8_TO_I8(s[1]);
581 PERL_ARGS_ASSERT_IS_UTF8_OVERLONG_GIVEN_START_BYTE_OK;
582 assert(len > 1 && UTF8_IS_START(*s));
584 /* Each platform has overlongs after the start bytes given above (expressed
585 * in I8 for EBCDIC). What constitutes an overlong varies by platform, but
586 * the logic is the same, except the E0 overlong has already been excluded
587 * on EBCDIC platforms. The values below were found by manually
588 * inspecting the UTF-8 patterns. See the tables in utf8.h and
592 # define F0_ABOVE_OVERLONG 0xB0
593 # define F8_ABOVE_OVERLONG 0xA8
594 # define FC_ABOVE_OVERLONG 0xA4
595 # define FE_ABOVE_OVERLONG 0xA2
596 # define FF_OVERLONG_PREFIX "\xfe\x41\x41\x41\x41\x41\x41\x41"
600 if (s0 == 0xE0 && UNLIKELY(s1 < 0xA0)) {
604 # define F0_ABOVE_OVERLONG 0x90
605 # define F8_ABOVE_OVERLONG 0x88
606 # define FC_ABOVE_OVERLONG 0x84
607 # define FE_ABOVE_OVERLONG 0x82
608 # define FF_OVERLONG_PREFIX "\xff\x80\x80\x80\x80\x80\x80"
612 if ( (s0 == 0xF0 && UNLIKELY(s1 < F0_ABOVE_OVERLONG))
613 || (s0 == 0xF8 && UNLIKELY(s1 < F8_ABOVE_OVERLONG))
614 || (s0 == 0xFC && UNLIKELY(s1 < FC_ABOVE_OVERLONG))
615 || (s0 == 0xFE && UNLIKELY(s1 < FE_ABOVE_OVERLONG)))
620 /* Check for the FF overlong */
621 return isFF_OVERLONG(s, len);
624 PERL_STATIC_INLINE int
625 S_isFF_OVERLONG(const U8 * const s, const STRLEN len)
627 /* Returns an int indicating whether or not the UTF-8 sequence from 's' to
628 * 'e' - 1 is an overlong beginning with \xFF. It returns 1 if it is; 0 if
629 * it isn't, and -1 if there isn't enough information to tell. This last
630 * return value can happen if the sequence is incomplete, missing some
631 * trailing bytes that would form a complete character. If there are
632 * enough bytes to make a definitive decision, this function does so. */
634 PERL_ARGS_ASSERT_ISFF_OVERLONG;
636 /* To be an FF overlong, all the available bytes must match */
637 if (LIKELY(memNE(s, FF_OVERLONG_PREFIX,
638 MIN(len, sizeof(FF_OVERLONG_PREFIX) - 1))))
643 /* To be an FF overlong sequence, all the bytes in FF_OVERLONG_PREFIX must
644 * be there; what comes after them doesn't matter. See tables in utf8.h,
646 if (len >= sizeof(FF_OVERLONG_PREFIX) - 1) {
650 /* The missing bytes could cause the result to go one way or the other, so
651 * the result is indeterminate */
655 #if defined(UV_IS_QUAD) /* These assume IV_MAX is 2**63-1 */
656 # ifdef EBCDIC /* Actually is I8 */
657 # define HIGHEST_REPRESENTABLE_UTF8 \
658 "\xFF\xA7\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF"
660 # define HIGHEST_REPRESENTABLE_UTF8 \
661 "\xFF\x80\x87\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF"
665 PERL_STATIC_INLINE int
666 S_does_utf8_overflow(const U8 * const s,
668 const bool consider_overlongs)
670 /* Returns an int indicating whether or not the UTF-8 sequence from 's' to
671 * 'e' - 1 would overflow an IV on this platform; that is if it represents
672 * a code point larger than the highest representable code point. It
673 * returns 1 if it does overflow; 0 if it doesn't, and -1 if there isn't
674 * enough information to tell. This last return value can happen if the
675 * sequence is incomplete, missing some trailing bytes that would form a
676 * complete character. If there are enough bytes to make a definitive
677 * decision, this function does so.
679 * If 'consider_overlongs' is TRUE, the function checks for the possibility
680 * that the sequence is an overlong that doesn't overflow. Otherwise, it
681 * assumes the sequence is not an overlong. This can give different
682 * results only on ASCII 32-bit platforms.
684 * (For ASCII platforms, we could use memcmp() because we don't have to
685 * convert each byte to I8, but it's very rare input indeed that would
686 * approach overflow, so the loop below will likely only get executed once.)
688 * 'e' - 1 must not be beyond a full character. */
691 PERL_ARGS_ASSERT_DOES_UTF8_OVERFLOW;
692 assert(s <= e && s + UTF8SKIP(s) >= e);
694 #if ! defined(UV_IS_QUAD)
696 return is_utf8_cp_above_31_bits(s, e, consider_overlongs);
700 PERL_UNUSED_ARG(consider_overlongs);
703 const STRLEN len = e - s;
705 const U8 * y = (const U8 *) HIGHEST_REPRESENTABLE_UTF8;
707 for (x = s; x < e; x++, y++) {
709 if (UNLIKELY(NATIVE_UTF8_TO_I8(*x) == *y)) {
713 /* If this byte is larger than the corresponding highest UTF-8
714 * byte, the sequence overflow; otherwise the byte is less than,
715 * and so the sequence doesn't overflow */
716 return NATIVE_UTF8_TO_I8(*x) > *y;
720 /* Got to the end and all bytes are the same. If the input is a whole
721 * character, it doesn't overflow. And if it is a partial character,
722 * there's not enough information to tell */
723 if (len < sizeof(HIGHEST_REPRESENTABLE_UTF8) - 1) {
736 /* This is the portions of the above function that deal with UV_MAX instead of
737 * IV_MAX. They are left here in case we want to combine them so that internal
738 * uses can have larger code points. The only logic difference is that the
739 * 32-bit EBCDIC platform is treate like the 64-bit, and the 32-bit ASCII has
743 /* Anything larger than this will overflow the word if it were converted into a UV */
744 #if defined(UV_IS_QUAD)
745 # ifdef EBCDIC /* Actually is I8 */
746 # define HIGHEST_REPRESENTABLE_UTF8 \
747 "\xFF\xAF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF"
749 # define HIGHEST_REPRESENTABLE_UTF8 \
750 "\xFF\x80\x8F\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF\xBF"
754 # define HIGHEST_REPRESENTABLE_UTF8 \
755 "\xFF\xA0\xA0\xA0\xA0\xA0\xA0\xA3\xBF\xBF\xBF\xBF\xBF\xBF"
757 # define HIGHEST_REPRESENTABLE_UTF8 "\xFE\x83\xBF\xBF\xBF\xBF\xBF"
761 #if ! defined(UV_IS_QUAD) && ! defined(EBCDIC)
763 /* On 32 bit ASCII machines, many overlongs that start with FF don't
765 if (consider_overlongs && isFF_OVERLONG(s, len) > 0) {
767 /* To be such an overlong, the first bytes of 's' must match
768 * FF_OVERLONG_PREFIX, which is "\xff\x80\x80\x80\x80\x80\x80". If we
769 * don't have any additional bytes available, the sequence, when
770 * completed might or might not fit in 32 bits. But if we have that
771 * next byte, we can tell for sure. If it is <= 0x83, then it does
773 if (len <= sizeof(FF_OVERLONG_PREFIX) - 1) {
777 return s[sizeof(FF_OVERLONG_PREFIX) - 1] > 0x83;
780 /* Starting with the #else, the rest of the function is identical except
781 * 1. we need to move the 'len' declaration to be global to the function
782 * 2. the endif move to just after the UNUSED_ARG.
783 * An empty endif is given just below to satisfy the preprocessor
789 #undef F0_ABOVE_OVERLONG
790 #undef F8_ABOVE_OVERLONG
791 #undef FC_ABOVE_OVERLONG
792 #undef FE_ABOVE_OVERLONG
793 #undef FF_OVERLONG_PREFIX
796 Perl__is_utf8_char_helper(const U8 * const s, const U8 * e, const U32 flags)
801 /* A helper function that should not be called directly.
803 * This function returns non-zero if the string beginning at 's' and
804 * looking no further than 'e - 1' is well-formed Perl-extended-UTF-8 for a
805 * code point; otherwise it returns 0. The examination stops after the
806 * first code point in 's' is validated, not looking at the rest of the
807 * input. If 'e' is such that there are not enough bytes to represent a
808 * complete code point, this function will return non-zero anyway, if the
809 * bytes it does have are well-formed UTF-8 as far as they go, and aren't
810 * excluded by 'flags'.
812 * A non-zero return gives the number of bytes required to represent the
813 * code point. Be aware that if the input is for a partial character, the
814 * return will be larger than 'e - s'.
816 * This function assumes that the code point represented is UTF-8 variant.
817 * The caller should have excluded the possibility of it being invariant
818 * before calling this function.
820 * 'flags' can be 0, or any combination of the UTF8_DISALLOW_foo flags
821 * accepted by L</utf8n_to_uvchr>. If non-zero, this function will return
822 * 0 if the code point represented is well-formed Perl-extended-UTF-8, but
823 * disallowed by the flags. If the input is only for a partial character,
824 * the function will return non-zero if there is any sequence of
825 * well-formed UTF-8 that, when appended to the input sequence, could
826 * result in an allowed code point; otherwise it returns 0. Non characters
827 * cannot be determined based on partial character input. But many of the
828 * other excluded types can be determined with just the first one or two
833 PERL_ARGS_ASSERT__IS_UTF8_CHAR_HELPER;
835 assert(0 == (flags & ~(UTF8_DISALLOW_ILLEGAL_INTERCHANGE
836 |UTF8_DISALLOW_PERL_EXTENDED)));
837 assert(! UTF8_IS_INVARIANT(*s));
839 /* A variant char must begin with a start byte */
840 if (UNLIKELY(! UTF8_IS_START(*s))) {
844 /* Examine a maximum of a single whole code point */
845 if (e - s > UTF8SKIP(s)) {
851 if (flags && isUTF8_POSSIBLY_PROBLEMATIC(*s)) {
852 const U8 s0 = NATIVE_UTF8_TO_I8(s[0]);
854 /* Here, we are disallowing some set of largish code points, and the
855 * first byte indicates the sequence is for a code point that could be
856 * in the excluded set. We generally don't have to look beyond this or
857 * the second byte to see if the sequence is actually for one of the
858 * excluded classes. The code below is derived from this table:
860 * UTF-8 UTF-EBCDIC I8
861 * U+D800: \xED\xA0\x80 \xF1\xB6\xA0\xA0 First surrogate
862 * U+DFFF: \xED\xBF\xBF \xF1\xB7\xBF\xBF Final surrogate
863 * U+110000: \xF4\x90\x80\x80 \xF9\xA2\xA0\xA0\xA0 First above Unicode
865 * Keep in mind that legal continuation bytes range between \x80..\xBF
866 * for UTF-8, and \xA0..\xBF for I8. Anything above those aren't
867 * continuation bytes. Hence, we don't have to test the upper edge
868 * because if any of those is encountered, the sequence is malformed,
869 * and would fail elsewhere in this function.
871 * The code here likewise assumes that there aren't other
872 * malformations; again the function should fail elsewhere because of
873 * these. For example, an overlong beginning with FC doesn't actually
874 * have to be a super; it could actually represent a small code point,
875 * even U+0000. But, since overlongs (and other malformations) are
876 * illegal, the function should return FALSE in either case.
879 #ifdef EBCDIC /* On EBCDIC, these are actually I8 bytes */
880 # define FIRST_START_BYTE_THAT_IS_DEFINITELY_SUPER 0xFA
881 # define IS_UTF8_2_BYTE_SUPER(s0, s1) ((s0) == 0xF9 && (s1) >= 0xA2)
883 # define IS_UTF8_2_BYTE_SURROGATE(s0, s1) ((s0) == 0xF1 \
885 && ((s1) & 0xFE ) == 0xB6)
886 # define isUTF8_PERL_EXTENDED(s) (*s == I8_TO_NATIVE_UTF8(0xFF))
888 # define FIRST_START_BYTE_THAT_IS_DEFINITELY_SUPER 0xF5
889 # define IS_UTF8_2_BYTE_SUPER(s0, s1) ((s0) == 0xF4 && (s1) >= 0x90)
890 # define IS_UTF8_2_BYTE_SURROGATE(s0, s1) ((s0) == 0xED && (s1) >= 0xA0)
891 # define isUTF8_PERL_EXTENDED(s) (*s >= 0xFE)
894 if ( (flags & UTF8_DISALLOW_SUPER)
895 && UNLIKELY(s0 >= FIRST_START_BYTE_THAT_IS_DEFINITELY_SUPER))
897 return 0; /* Above Unicode */
900 if ( (flags & UTF8_DISALLOW_PERL_EXTENDED)
901 && UNLIKELY(isUTF8_PERL_EXTENDED(s)))
907 const U8 s1 = NATIVE_UTF8_TO_I8(s[1]);
909 if ( (flags & UTF8_DISALLOW_SUPER)
910 && UNLIKELY(IS_UTF8_2_BYTE_SUPER(s0, s1)))
912 return 0; /* Above Unicode */
915 if ( (flags & UTF8_DISALLOW_SURROGATE)
916 && UNLIKELY(IS_UTF8_2_BYTE_SURROGATE(s0, s1)))
918 return 0; /* Surrogate */
921 if ( (flags & UTF8_DISALLOW_NONCHAR)
922 && UNLIKELY(UTF8_IS_NONCHAR(s, e)))
924 return 0; /* Noncharacter code point */
929 /* Make sure that all that follows are continuation bytes */
930 for (x = s + 1; x < e; x++) {
931 if (UNLIKELY(! UTF8_IS_CONTINUATION(*x))) {
936 /* Here is syntactically valid. Next, make sure this isn't the start of an
938 if (len > 1 && is_utf8_overlong_given_start_byte_ok(s, len) > 0) {
942 /* And finally, that the code point represented fits in a word on this
944 if (0 < does_utf8_overflow(s, e,
945 0 /* Don't consider overlongs */
955 Perl__byte_dump_string(pTHX_ const U8 * const start, const STRLEN len, const bool format)
957 /* Returns a mortalized C string that is a displayable copy of the 'len'
958 * bytes starting at 'start'. 'format' gives how to display each byte.
959 * Currently, there are only two formats, so it is currently a bool:
961 * 1 ab (that is a space between two hex digit bytes)
964 const STRLEN output_len = 4 * len + 1; /* 4 bytes per each input, plus a
966 const U8 * s = start;
967 const U8 * const e = start + len;
971 PERL_ARGS_ASSERT__BYTE_DUMP_STRING;
973 Newx(output, output_len, char);
977 for (s = start; s < e; s++) {
978 const unsigned high_nibble = (*s & 0xF0) >> 4;
979 const unsigned low_nibble = (*s & 0x0F);
991 if (high_nibble < 10) {
992 *d++ = high_nibble + '0';
995 *d++ = high_nibble - 10 + 'a';
998 if (low_nibble < 10) {
999 *d++ = low_nibble + '0';
1002 *d++ = low_nibble - 10 + 'a';
1010 PERL_STATIC_INLINE char *
1011 S_unexpected_non_continuation_text(pTHX_ const U8 * const s,
1013 /* How many bytes to print */
1016 /* Which one is the non-continuation */
1017 const STRLEN non_cont_byte_pos,
1019 /* How many bytes should there be? */
1020 const STRLEN expect_len)
1022 /* Return the malformation warning text for an unexpected continuation
1025 const char * const where = (non_cont_byte_pos == 1)
1027 : Perl_form(aTHX_ "%d bytes",
1028 (int) non_cont_byte_pos);
1030 PERL_ARGS_ASSERT_UNEXPECTED_NON_CONTINUATION_TEXT;
1032 /* We don't need to pass this parameter, but since it has already been
1033 * calculated, it's likely faster to pass it; verify under DEBUGGING */
1034 assert(expect_len == UTF8SKIP(s));
1036 return Perl_form(aTHX_ "%s: %s (unexpected non-continuation byte 0x%02x,"
1037 " %s after start byte 0x%02x; need %d bytes, got %d)",
1039 _byte_dump_string(s, print_len, 0),
1040 *(s + non_cont_byte_pos),
1044 (int) non_cont_byte_pos);
1049 =for apidoc utf8n_to_uvchr
1051 THIS FUNCTION SHOULD BE USED IN ONLY VERY SPECIALIZED CIRCUMSTANCES.
1052 Most code should use L</utf8_to_uvchr_buf>() rather than call this directly.
1054 Bottom level UTF-8 decode routine.
1055 Returns the native code point value of the first character in the string C<s>,
1056 which is assumed to be in UTF-8 (or UTF-EBCDIC) encoding, and no longer than
1057 C<curlen> bytes; C<*retlen> (if C<retlen> isn't NULL) will be set to
1058 the length, in bytes, of that character.
1060 The value of C<flags> determines the behavior when C<s> does not point to a
1061 well-formed UTF-8 character. If C<flags> is 0, encountering a malformation
1062 causes zero to be returned and C<*retlen> is set so that (S<C<s> + C<*retlen>>)
1063 is the next possible position in C<s> that could begin a non-malformed
1064 character. Also, if UTF-8 warnings haven't been lexically disabled, a warning
1065 is raised. Some UTF-8 input sequences may contain multiple malformations.
1066 This function tries to find every possible one in each call, so multiple
1067 warnings can be raised for the same sequence.
1069 Various ALLOW flags can be set in C<flags> to allow (and not warn on)
1070 individual types of malformations, such as the sequence being overlong (that
1071 is, when there is a shorter sequence that can express the same code point;
1072 overlong sequences are expressly forbidden in the UTF-8 standard due to
1073 potential security issues). Another malformation example is the first byte of
1074 a character not being a legal first byte. See F<utf8.h> for the list of such
1075 flags. Even if allowed, this function generally returns the Unicode
1076 REPLACEMENT CHARACTER when it encounters a malformation. There are flags in
1077 F<utf8.h> to override this behavior for the overlong malformations, but don't
1078 do that except for very specialized purposes.
1080 The C<UTF8_CHECK_ONLY> flag overrides the behavior when a non-allowed (by other
1081 flags) malformation is found. If this flag is set, the routine assumes that
1082 the caller will raise a warning, and this function will silently just set
1083 C<retlen> to C<-1> (cast to C<STRLEN>) and return zero.
1085 Note that this API requires disambiguation between successful decoding a C<NUL>
1086 character, and an error return (unless the C<UTF8_CHECK_ONLY> flag is set), as
1087 in both cases, 0 is returned, and, depending on the malformation, C<retlen> may
1088 be set to 1. To disambiguate, upon a zero return, see if the first byte of
1089 C<s> is 0 as well. If so, the input was a C<NUL>; if not, the input had an
1090 error. Or you can use C<L</utf8n_to_uvchr_error>>.
1092 Certain code points are considered problematic. These are Unicode surrogates,
1093 Unicode non-characters, and code points above the Unicode maximum of 0x10FFFF.
1094 By default these are considered regular code points, but certain situations
1095 warrant special handling for them, which can be specified using the C<flags>
1096 parameter. If C<flags> contains C<UTF8_DISALLOW_ILLEGAL_INTERCHANGE>, all
1097 three classes are treated as malformations and handled as such. The flags
1098 C<UTF8_DISALLOW_SURROGATE>, C<UTF8_DISALLOW_NONCHAR>, and
1099 C<UTF8_DISALLOW_SUPER> (meaning above the legal Unicode maximum) can be set to
1100 disallow these categories individually. C<UTF8_DISALLOW_ILLEGAL_INTERCHANGE>
1101 restricts the allowed inputs to the strict UTF-8 traditionally defined by
1102 Unicode. Use C<UTF8_DISALLOW_ILLEGAL_C9_INTERCHANGE> to use the strictness
1104 L<Unicode Corrigendum #9|http://www.unicode.org/versions/corrigendum9.html>.
1105 The difference between traditional strictness and C9 strictness is that the
1106 latter does not forbid non-character code points. (They are still discouraged,
1107 however.) For more discussion see L<perlunicode/Noncharacter code points>.
1109 The flags C<UTF8_WARN_ILLEGAL_INTERCHANGE>,
1110 C<UTF8_WARN_ILLEGAL_C9_INTERCHANGE>, C<UTF8_WARN_SURROGATE>,
1111 C<UTF8_WARN_NONCHAR>, and C<UTF8_WARN_SUPER> will cause warning messages to be
1112 raised for their respective categories, but otherwise the code points are
1113 considered valid (not malformations). To get a category to both be treated as
1114 a malformation and raise a warning, specify both the WARN and DISALLOW flags.
1115 (But note that warnings are not raised if lexically disabled nor if
1116 C<UTF8_CHECK_ONLY> is also specified.)
1118 Extremely high code points were never specified in any standard, and require an
1119 extension to UTF-8 to express, which Perl does. It is likely that programs
1120 written in something other than Perl would not be able to read files that
1121 contain these; nor would Perl understand files written by something that uses a
1122 different extension. For these reasons, there is a separate set of flags that
1123 can warn and/or disallow these extremely high code points, even if other
1124 above-Unicode ones are accepted. They are the C<UTF8_WARN_PERL_EXTENDED> and
1125 C<UTF8_DISALLOW_PERL_EXTENDED> flags. For more information see
1126 L</C<UTF8_GOT_PERL_EXTENDED>>. Of course C<UTF8_DISALLOW_SUPER> will treat all
1127 above-Unicode code points, including these, as malformations.
1128 (Note that the Unicode standard considers anything above 0x10FFFF to be
1129 illegal, but there are standards predating it that allow up to 0x7FFF_FFFF
1132 A somewhat misleadingly named synonym for C<UTF8_WARN_PERL_EXTENDED> is
1133 retained for backward compatibility: C<UTF8_WARN_ABOVE_31_BIT>. Similarly,
1134 C<UTF8_DISALLOW_ABOVE_31_BIT> is usable instead of the more accurately named
1135 C<UTF8_DISALLOW_PERL_EXTENDED>. The names are misleading because these flags
1136 can apply to code points that actually do fit in 31 bits. This happens on
1137 EBCDIC platforms, and sometimes when the L<overlong
1138 malformation|/C<UTF8_GOT_LONG>> is also present. The new names accurately
1139 describe the situation in all cases.
1142 All other code points corresponding to Unicode characters, including private
1143 use and those yet to be assigned, are never considered malformed and never
1148 Also implemented as a macro in utf8.h
1152 Perl_utf8n_to_uvchr(pTHX_ const U8 *s,
1157 PERL_ARGS_ASSERT_UTF8N_TO_UVCHR;
1159 return utf8n_to_uvchr_error(s, curlen, retlen, flags, NULL);
1164 =for apidoc utf8n_to_uvchr_error
1166 THIS FUNCTION SHOULD BE USED IN ONLY VERY SPECIALIZED CIRCUMSTANCES.
1167 Most code should use L</utf8_to_uvchr_buf>() rather than call this directly.
1169 This function is for code that needs to know what the precise malformation(s)
1170 are when an error is found.
1172 It is like C<L</utf8n_to_uvchr>> but it takes an extra parameter placed after
1173 all the others, C<errors>. If this parameter is 0, this function behaves
1174 identically to C<L</utf8n_to_uvchr>>. Otherwise, C<errors> should be a pointer
1175 to a C<U32> variable, which this function sets to indicate any errors found.
1176 Upon return, if C<*errors> is 0, there were no errors found. Otherwise,
1177 C<*errors> is the bit-wise C<OR> of the bits described in the list below. Some
1178 of these bits will be set if a malformation is found, even if the input
1179 C<flags> parameter indicates that the given malformation is allowed; those
1180 exceptions are noted:
1184 =item C<UTF8_GOT_PERL_EXTENDED>
1186 The input sequence is not standard UTF-8, but a Perl extension. This bit is
1187 set only if the input C<flags> parameter contains either the
1188 C<UTF8_DISALLOW_PERL_EXTENDED> or the C<UTF8_WARN_PERL_EXTENDED> flags.
1190 Code points above 0x7FFF_FFFF (2**31 - 1) were never specified in any standard,
1191 and so some extension must be used to express them. Perl uses a natural
1192 extension to UTF-8 to represent the ones up to 2**36-1, and invented a further
1193 extension to represent even higher ones, so that any code point that fits in a
1194 64-bit word can be represented. Text using these extensions is not likely to
1195 be portable to non-Perl code. We lump both of these extensions together and
1196 refer to them as Perl extended UTF-8. There exist other extensions that people
1197 have invented, incompatible with Perl's.
1199 On EBCDIC platforms starting in Perl v5.24, the Perl extension for representing
1200 extremely high code points kicks in at 0x3FFF_FFFF (2**30 -1), which is lower
1201 than on ASCII. Prior to that, code points 2**31 and higher were simply
1202 unrepresentable, and a different, incompatible method was used to represent
1203 code points between 2**30 and 2**31 - 1.
1205 On both platforms, ASCII and EBCDIC, C<UTF8_GOT_PERL_EXTENDED> is set if
1206 Perl extended UTF-8 is used.
1208 In earlier Perls, this bit was named C<UTF8_GOT_ABOVE_31_BIT>, which you still
1209 may use for backward compatibility. That name is misleading, as this flag may
1210 be set when the code point actually does fit in 31 bits. This happens on
1211 EBCDIC platforms, and sometimes when the L<overlong
1212 malformation|/C<UTF8_GOT_LONG>> is also present. The new name accurately
1213 describes the situation in all cases.
1215 =item C<UTF8_GOT_CONTINUATION>
1217 The input sequence was malformed in that the first byte was a a UTF-8
1220 =item C<UTF8_GOT_EMPTY>
1222 The input C<curlen> parameter was 0.
1224 =item C<UTF8_GOT_LONG>
1226 The input sequence was malformed in that there is some other sequence that
1227 evaluates to the same code point, but that sequence is shorter than this one.
1229 Until Unicode 3.1, it was legal for programs to accept this malformation, but
1230 it was discovered that this created security issues.
1232 =item C<UTF8_GOT_NONCHAR>
1234 The code point represented by the input UTF-8 sequence is for a Unicode
1235 non-character code point.
1236 This bit is set only if the input C<flags> parameter contains either the
1237 C<UTF8_DISALLOW_NONCHAR> or the C<UTF8_WARN_NONCHAR> flags.
1239 =item C<UTF8_GOT_NON_CONTINUATION>
1241 The input sequence was malformed in that a non-continuation type byte was found
1242 in a position where only a continuation type one should be.
1244 =item C<UTF8_GOT_OVERFLOW>
1246 The input sequence was malformed in that it is for a code point that is not
1247 representable in the number of bits available in an IV on the current platform.
1249 =item C<UTF8_GOT_SHORT>
1251 The input sequence was malformed in that C<curlen> is smaller than required for
1252 a complete sequence. In other words, the input is for a partial character
1255 =item C<UTF8_GOT_SUPER>
1257 The input sequence was malformed in that it is for a non-Unicode code point;
1258 that is, one above the legal Unicode maximum.
1259 This bit is set only if the input C<flags> parameter contains either the
1260 C<UTF8_DISALLOW_SUPER> or the C<UTF8_WARN_SUPER> flags.
1262 =item C<UTF8_GOT_SURROGATE>
1264 The input sequence was malformed in that it is for a -Unicode UTF-16 surrogate
1266 This bit is set only if the input C<flags> parameter contains either the
1267 C<UTF8_DISALLOW_SURROGATE> or the C<UTF8_WARN_SURROGATE> flags.
1271 To do your own error handling, call this function with the C<UTF8_CHECK_ONLY>
1272 flag to suppress any warnings, and then examine the C<*errors> return.
1278 Perl_utf8n_to_uvchr_error(pTHX_ const U8 *s,
1284 const U8 * const s0 = s;
1285 U8 * send = NULL; /* (initialized to silence compilers' wrong
1287 U32 possible_problems = 0; /* A bit is set here for each potential problem
1288 found as we go along */
1290 STRLEN expectlen = 0; /* How long should this sequence be?
1291 (initialized to silence compilers' wrong
1293 STRLEN avail_len = 0; /* When input is too short, gives what that is */
1294 U32 discard_errors = 0; /* Used to save branches when 'errors' is NULL;
1295 this gets set and discarded */
1297 /* The below are used only if there is both an overlong malformation and a
1298 * too short one. Otherwise the first two are set to 's0' and 'send', and
1299 * the third not used at all */
1300 U8 * adjusted_s0 = (U8 *) s0;
1301 U8 temp_char_buf[UTF8_MAXBYTES + 1]; /* Used to avoid a Newx in this
1302 routine; see [perl #130921] */
1303 UV uv_so_far = 0; /* (Initialized to silence compilers' wrong warning) */
1305 PERL_ARGS_ASSERT_UTF8N_TO_UVCHR_ERROR;
1311 errors = &discard_errors;
1314 /* The order of malformation tests here is important. We should consume as
1315 * few bytes as possible in order to not skip any valid character. This is
1316 * required by the Unicode Standard (section 3.9 of Unicode 6.0); see also
1317 * http://unicode.org/reports/tr36 for more discussion as to why. For
1318 * example, once we've done a UTF8SKIP, we can tell the expected number of
1319 * bytes, and could fail right off the bat if the input parameters indicate
1320 * that there are too few available. But it could be that just that first
1321 * byte is garbled, and the intended character occupies fewer bytes. If we
1322 * blindly assumed that the first byte is correct, and skipped based on
1323 * that number, we could skip over a valid input character. So instead, we
1324 * always examine the sequence byte-by-byte.
1326 * We also should not consume too few bytes, otherwise someone could inject
1327 * things. For example, an input could be deliberately designed to
1328 * overflow, and if this code bailed out immediately upon discovering that,
1329 * returning to the caller C<*retlen> pointing to the very next byte (one
1330 * which is actually part of of the overflowing sequence), that could look
1331 * legitimate to the caller, which could discard the initial partial
1332 * sequence and process the rest, inappropriately.
1334 * Some possible input sequences are malformed in more than one way. This
1335 * function goes to lengths to try to find all of them. This is necessary
1336 * for correctness, as the inputs may allow one malformation but not
1337 * another, and if we abandon searching for others after finding the
1338 * allowed one, we could allow in something that shouldn't have been.
1341 if (UNLIKELY(curlen == 0)) {
1342 possible_problems |= UTF8_GOT_EMPTY;
1344 uv = UNICODE_REPLACEMENT;
1345 goto ready_to_handle_errors;
1348 expectlen = UTF8SKIP(s);
1350 /* A well-formed UTF-8 character, as the vast majority of calls to this
1351 * function will be for, has this expected length. For efficiency, set
1352 * things up here to return it. It will be overriden only in those rare
1353 * cases where a malformation is found */
1355 *retlen = expectlen;
1358 /* An invariant is trivially well-formed */
1359 if (UTF8_IS_INVARIANT(uv)) {
1363 /* A continuation character can't start a valid sequence */
1364 if (UNLIKELY(UTF8_IS_CONTINUATION(uv))) {
1365 possible_problems |= UTF8_GOT_CONTINUATION;
1367 uv = UNICODE_REPLACEMENT;
1368 goto ready_to_handle_errors;
1371 /* Here is not a continuation byte, nor an invariant. The only thing left
1372 * is a start byte (possibly for an overlong). (We can't use UTF8_IS_START
1373 * because it excludes start bytes like \xC0 that always lead to
1376 /* Convert to I8 on EBCDIC (no-op on ASCII), then remove the leading bits
1377 * that indicate the number of bytes in the character's whole UTF-8
1378 * sequence, leaving just the bits that are part of the value. */
1379 uv = NATIVE_UTF8_TO_I8(uv) & UTF_START_MASK(expectlen);
1381 /* Setup the loop end point, making sure to not look past the end of the
1382 * input string, and flag it as too short if the size isn't big enough. */
1384 if (UNLIKELY(curlen < expectlen)) {
1385 possible_problems |= UTF8_GOT_SHORT;
1393 /* Now, loop through the remaining bytes in the character's sequence,
1394 * accumulating each into the working value as we go. */
1395 for (s = s0 + 1; s < send; s++) {
1396 if (LIKELY(UTF8_IS_CONTINUATION(*s))) {
1397 uv = UTF8_ACCUMULATE(uv, *s);
1401 /* Here, found a non-continuation before processing all expected bytes.
1402 * This byte indicates the beginning of a new character, so quit, even
1403 * if allowing this malformation. */
1404 possible_problems |= UTF8_GOT_NON_CONTINUATION;
1406 } /* End of loop through the character's bytes */
1408 /* Save how many bytes were actually in the character */
1411 /* Note that there are two types of too-short malformation. One is when
1412 * there is actual wrong data before the normal termination of the
1413 * sequence. The other is that the sequence wasn't complete before the end
1414 * of the data we are allowed to look at, based on the input 'curlen'.
1415 * This means that we were passed data for a partial character, but it is
1416 * valid as far as we saw. The other is definitely invalid. This
1417 * distinction could be important to a caller, so the two types are kept
1420 * A convenience macro that matches either of the too-short conditions. */
1421 # define UTF8_GOT_TOO_SHORT (UTF8_GOT_SHORT|UTF8_GOT_NON_CONTINUATION)
1423 if (UNLIKELY(possible_problems & UTF8_GOT_TOO_SHORT)) {
1425 uv = UNICODE_REPLACEMENT;
1428 /* Check for overflow. The algorithm requires us to not look past the end
1429 * of the current character, even if partial, so the upper limit is 's' */
1430 if (UNLIKELY(0 < does_utf8_overflow(s0, s,
1431 1 /* Do consider overlongs */
1434 possible_problems |= UTF8_GOT_OVERFLOW;
1435 uv = UNICODE_REPLACEMENT;
1438 /* Check for overlong. If no problems so far, 'uv' is the correct code
1439 * point value. Simply see if it is expressible in fewer bytes. Otherwise
1440 * we must look at the UTF-8 byte sequence itself to see if it is for an
1442 if ( ( LIKELY(! possible_problems)
1443 && UNLIKELY(expectlen > (STRLEN) OFFUNISKIP(uv)))
1444 || ( UNLIKELY(possible_problems)
1445 && ( UNLIKELY(! UTF8_IS_START(*s0))
1447 && UNLIKELY(0 < is_utf8_overlong_given_start_byte_ok(s0,
1450 possible_problems |= UTF8_GOT_LONG;
1452 if ( UNLIKELY( possible_problems & UTF8_GOT_TOO_SHORT)
1454 /* The calculation in the 'true' branch of this 'if'
1455 * below won't work if overflows, and isn't needed
1456 * anyway. Further below we handle all overflow
1458 && LIKELY(! (possible_problems & UTF8_GOT_OVERFLOW)))
1460 UV min_uv = uv_so_far;
1463 /* Here, the input is both overlong and is missing some trailing
1464 * bytes. There is no single code point it could be for, but there
1465 * may be enough information present to determine if what we have
1466 * so far is for an unallowed code point, such as for a surrogate.
1467 * The code further below has the intelligence to determine this,
1468 * but just for non-overlong UTF-8 sequences. What we do here is
1469 * calculate the smallest code point the input could represent if
1470 * there were no too short malformation. Then we compute and save
1471 * the UTF-8 for that, which is what the code below looks at
1472 * instead of the raw input. It turns out that the smallest such
1473 * code point is all we need. */
1474 for (i = curlen; i < expectlen; i++) {
1475 min_uv = UTF8_ACCUMULATE(min_uv,
1476 I8_TO_NATIVE_UTF8(UTF_CONTINUATION_MARK));
1479 adjusted_s0 = temp_char_buf;
1480 (void) uvoffuni_to_utf8_flags(adjusted_s0, min_uv, 0);
1484 /* Here, we have found all the possible problems, except for when the input
1485 * is for a problematic code point not allowed by the input parameters. */
1487 /* uv is valid for overlongs */
1488 if ( ( ( LIKELY(! (possible_problems & ~UTF8_GOT_LONG))
1490 /* isn't problematic if < this */
1491 && uv >= UNICODE_SURROGATE_FIRST)
1492 || ( UNLIKELY(possible_problems)
1494 /* if overflow, we know without looking further
1495 * precisely which of the problematic types it is,
1496 * and we deal with those in the overflow handling
1498 && LIKELY(! (possible_problems & UTF8_GOT_OVERFLOW))
1499 && ( isUTF8_POSSIBLY_PROBLEMATIC(*adjusted_s0)
1500 || UNLIKELY(isUTF8_PERL_EXTENDED(s0)))))
1501 && ((flags & ( UTF8_DISALLOW_NONCHAR
1502 |UTF8_DISALLOW_SURROGATE
1503 |UTF8_DISALLOW_SUPER
1504 |UTF8_DISALLOW_PERL_EXTENDED
1506 |UTF8_WARN_SURROGATE
1508 |UTF8_WARN_PERL_EXTENDED))))
1510 /* If there were no malformations, or the only malformation is an
1511 * overlong, 'uv' is valid */
1512 if (LIKELY(! (possible_problems & ~UTF8_GOT_LONG))) {
1513 if (UNLIKELY(UNICODE_IS_SURROGATE(uv))) {
1514 possible_problems |= UTF8_GOT_SURROGATE;
1516 else if (UNLIKELY(uv > PERL_UNICODE_MAX)) {
1517 possible_problems |= UTF8_GOT_SUPER;
1519 else if (UNLIKELY(UNICODE_IS_NONCHAR(uv))) {
1520 possible_problems |= UTF8_GOT_NONCHAR;
1523 else { /* Otherwise, need to look at the source UTF-8, possibly
1524 adjusted to be non-overlong */
1526 if (UNLIKELY(NATIVE_UTF8_TO_I8(*adjusted_s0)
1527 >= FIRST_START_BYTE_THAT_IS_DEFINITELY_SUPER))
1529 possible_problems |= UTF8_GOT_SUPER;
1531 else if (curlen > 1) {
1532 if (UNLIKELY(IS_UTF8_2_BYTE_SUPER(
1533 NATIVE_UTF8_TO_I8(*adjusted_s0),
1534 NATIVE_UTF8_TO_I8(*(adjusted_s0 + 1)))))
1536 possible_problems |= UTF8_GOT_SUPER;
1538 else if (UNLIKELY(IS_UTF8_2_BYTE_SURROGATE(
1539 NATIVE_UTF8_TO_I8(*adjusted_s0),
1540 NATIVE_UTF8_TO_I8(*(adjusted_s0 + 1)))))
1542 possible_problems |= UTF8_GOT_SURROGATE;
1546 /* We need a complete well-formed UTF-8 character to discern
1547 * non-characters, so can't look for them here */
1551 ready_to_handle_errors:
1554 * curlen contains the number of bytes in the sequence that
1555 * this call should advance the input by.
1556 * avail_len gives the available number of bytes passed in, but
1557 * only if this is less than the expected number of
1558 * bytes, based on the code point's start byte.
1559 * possible_problems' is 0 if there weren't any problems; otherwise a bit
1560 * is set in it for each potential problem found.
1561 * uv contains the code point the input sequence
1562 * represents; or if there is a problem that prevents
1563 * a well-defined value from being computed, it is
1564 * some subsitute value, typically the REPLACEMENT
1566 * s0 points to the first byte of the character
1567 * s points to just after were we left off processing
1569 * send points to just after where that character should
1570 * end, based on how many bytes the start byte tells
1571 * us should be in it, but no further than s0 +
1575 if (UNLIKELY(possible_problems)) {
1576 bool disallowed = FALSE;
1577 const U32 orig_problems = possible_problems;
1579 while (possible_problems) { /* Handle each possible problem */
1581 char * message = NULL;
1583 /* Each 'if' clause handles one problem. They are ordered so that
1584 * the first ones' messages will be displayed before the later
1585 * ones; this is kinda in decreasing severity order. But the
1586 * overlong must come last, as it changes 'uv' looked at by the
1588 if (possible_problems & UTF8_GOT_OVERFLOW) {
1590 /* Overflow means also got a super and are using Perl's
1591 * extended UTF-8, but we handle all three cases here */
1593 &= ~(UTF8_GOT_OVERFLOW|UTF8_GOT_SUPER|UTF8_GOT_PERL_EXTENDED);
1594 *errors |= UTF8_GOT_OVERFLOW;
1596 /* But the API says we flag all errors found */
1597 if (flags & (UTF8_WARN_SUPER|UTF8_DISALLOW_SUPER)) {
1598 *errors |= UTF8_GOT_SUPER;
1601 & (UTF8_WARN_PERL_EXTENDED|UTF8_DISALLOW_PERL_EXTENDED))
1603 *errors |= UTF8_GOT_PERL_EXTENDED;
1606 /* Disallow if any of the three categories say to */
1607 if ( ! (flags & UTF8_ALLOW_OVERFLOW)
1608 || (flags & ( UTF8_DISALLOW_SUPER
1609 |UTF8_DISALLOW_PERL_EXTENDED)))
1614 /* Likewise, warn if any say to */
1615 if ( ! (flags & UTF8_ALLOW_OVERFLOW)
1616 || (flags & (UTF8_WARN_SUPER|UTF8_WARN_PERL_EXTENDED)))
1619 /* The warnings code explicitly says it doesn't handle the
1620 * case of packWARN2 and two categories which have
1621 * parent-child relationship. Even if it works now to
1622 * raise the warning if either is enabled, it wouldn't
1623 * necessarily do so in the future. We output (only) the
1624 * most dire warning */
1625 if (! (flags & UTF8_CHECK_ONLY)) {
1626 if (ckWARN_d(WARN_UTF8)) {
1627 pack_warn = packWARN(WARN_UTF8);
1629 else if (ckWARN_d(WARN_NON_UNICODE)) {
1630 pack_warn = packWARN(WARN_NON_UNICODE);
1633 message = Perl_form(aTHX_ "%s: %s (overflows)",
1635 _byte_dump_string(s0, curlen, 0));
1640 else if (possible_problems & UTF8_GOT_EMPTY) {
1641 possible_problems &= ~UTF8_GOT_EMPTY;
1642 *errors |= UTF8_GOT_EMPTY;
1644 if (! (flags & UTF8_ALLOW_EMPTY)) {
1646 /* This so-called malformation is now treated as a bug in
1647 * the caller. If you have nothing to decode, skip calling
1652 if (ckWARN_d(WARN_UTF8) && ! (flags & UTF8_CHECK_ONLY)) {
1653 pack_warn = packWARN(WARN_UTF8);
1654 message = Perl_form(aTHX_ "%s (empty string)",
1659 else if (possible_problems & UTF8_GOT_CONTINUATION) {
1660 possible_problems &= ~UTF8_GOT_CONTINUATION;
1661 *errors |= UTF8_GOT_CONTINUATION;
1663 if (! (flags & UTF8_ALLOW_CONTINUATION)) {
1665 if (ckWARN_d(WARN_UTF8) && ! (flags & UTF8_CHECK_ONLY)) {
1666 pack_warn = packWARN(WARN_UTF8);
1667 message = Perl_form(aTHX_
1668 "%s: %s (unexpected continuation byte 0x%02x,"
1669 " with no preceding start byte)",
1671 _byte_dump_string(s0, 1, 0), *s0);
1675 else if (possible_problems & UTF8_GOT_SHORT) {
1676 possible_problems &= ~UTF8_GOT_SHORT;
1677 *errors |= UTF8_GOT_SHORT;
1679 if (! (flags & UTF8_ALLOW_SHORT)) {
1681 if (ckWARN_d(WARN_UTF8) && ! (flags & UTF8_CHECK_ONLY)) {
1682 pack_warn = packWARN(WARN_UTF8);
1683 message = Perl_form(aTHX_
1684 "%s: %s (too short; %d byte%s available, need %d)",
1686 _byte_dump_string(s0, send - s0, 0),
1688 avail_len == 1 ? "" : "s",
1694 else if (possible_problems & UTF8_GOT_NON_CONTINUATION) {
1695 possible_problems &= ~UTF8_GOT_NON_CONTINUATION;
1696 *errors |= UTF8_GOT_NON_CONTINUATION;
1698 if (! (flags & UTF8_ALLOW_NON_CONTINUATION)) {
1700 if (ckWARN_d(WARN_UTF8) && ! (flags & UTF8_CHECK_ONLY)) {
1702 /* If we don't know for sure that the input length is
1703 * valid, avoid as much as possible reading past the
1704 * end of the buffer */
1705 int printlen = (flags & _UTF8_NO_CONFIDENCE_IN_CURLEN)
1708 pack_warn = packWARN(WARN_UTF8);
1709 message = Perl_form(aTHX_ "%s",
1710 unexpected_non_continuation_text(s0,
1717 else if (possible_problems & UTF8_GOT_SURROGATE) {
1718 possible_problems &= ~UTF8_GOT_SURROGATE;
1720 if (flags & UTF8_WARN_SURROGATE) {
1721 *errors |= UTF8_GOT_SURROGATE;
1723 if ( ! (flags & UTF8_CHECK_ONLY)
1724 && ckWARN_d(WARN_SURROGATE))
1726 pack_warn = packWARN(WARN_SURROGATE);
1728 /* These are the only errors that can occur with a
1729 * surrogate when the 'uv' isn't valid */
1730 if (orig_problems & UTF8_GOT_TOO_SHORT) {
1731 message = Perl_form(aTHX_
1732 "UTF-16 surrogate (any UTF-8 sequence that"
1733 " starts with \"%s\" is for a surrogate)",
1734 _byte_dump_string(s0, curlen, 0));
1737 message = Perl_form(aTHX_ surrogate_cp_format, uv);
1742 if (flags & UTF8_DISALLOW_SURROGATE) {
1744 *errors |= UTF8_GOT_SURROGATE;
1747 else if (possible_problems & UTF8_GOT_SUPER) {
1748 possible_problems &= ~UTF8_GOT_SUPER;
1750 if (flags & UTF8_WARN_SUPER) {
1751 *errors |= UTF8_GOT_SUPER;
1753 if ( ! (flags & UTF8_CHECK_ONLY)
1754 && ckWARN_d(WARN_NON_UNICODE))
1756 pack_warn = packWARN(WARN_NON_UNICODE);
1758 if (orig_problems & UTF8_GOT_TOO_SHORT) {
1759 message = Perl_form(aTHX_
1760 "Any UTF-8 sequence that starts with"
1761 " \"%s\" is for a non-Unicode code point,"
1762 " may not be portable",
1763 _byte_dump_string(s0, curlen, 0));
1766 message = Perl_form(aTHX_ super_cp_format, uv);
1771 /* Test for Perl's extended UTF-8 after the regular SUPER ones,
1772 * and before possibly bailing out, so that the more dire
1773 * warning will override the regular one. */
1774 if (UNLIKELY(isUTF8_PERL_EXTENDED(s0))) {
1775 if ( ! (flags & UTF8_CHECK_ONLY)
1776 && (flags & (UTF8_WARN_PERL_EXTENDED|UTF8_WARN_SUPER))
1777 && ckWARN_d(WARN_NON_UNICODE))
1779 pack_warn = packWARN(WARN_NON_UNICODE);
1781 /* If it is an overlong that evaluates to a code point
1782 * that doesn't have to use the Perl extended UTF-8, it
1783 * still used it, and so we output a message that
1784 * doesn't refer to the code point. The same is true
1785 * if there was a SHORT malformation where the code
1786 * point is not valid. In that case, 'uv' will have
1787 * been set to the REPLACEMENT CHAR, and the message
1788 * below without the code point in it will be selected
1790 if (UNICODE_IS_PERL_EXTENDED(uv)) {
1791 message = Perl_form(aTHX_
1792 perl_extended_cp_format, uv);
1795 message = Perl_form(aTHX_
1796 "Any UTF-8 sequence that starts with"
1797 " \"%s\" is a Perl extension, and"
1798 " so is not portable",
1799 _byte_dump_string(s0, curlen, 0));
1803 if (flags & ( UTF8_WARN_PERL_EXTENDED
1804 |UTF8_DISALLOW_PERL_EXTENDED))
1806 *errors |= UTF8_GOT_PERL_EXTENDED;
1808 if (flags & UTF8_DISALLOW_PERL_EXTENDED) {
1814 if (flags & UTF8_DISALLOW_SUPER) {
1815 *errors |= UTF8_GOT_SUPER;
1819 else if (possible_problems & UTF8_GOT_NONCHAR) {
1820 possible_problems &= ~UTF8_GOT_NONCHAR;
1822 if (flags & UTF8_WARN_NONCHAR) {
1823 *errors |= UTF8_GOT_NONCHAR;
1825 if ( ! (flags & UTF8_CHECK_ONLY)
1826 && ckWARN_d(WARN_NONCHAR))
1828 /* The code above should have guaranteed that we don't
1829 * get here with errors other than overlong */
1830 assert (! (orig_problems
1831 & ~(UTF8_GOT_LONG|UTF8_GOT_NONCHAR)));
1833 pack_warn = packWARN(WARN_NONCHAR);
1834 message = Perl_form(aTHX_ nonchar_cp_format, uv);
1838 if (flags & UTF8_DISALLOW_NONCHAR) {
1840 *errors |= UTF8_GOT_NONCHAR;
1843 else if (possible_problems & UTF8_GOT_LONG) {
1844 possible_problems &= ~UTF8_GOT_LONG;
1845 *errors |= UTF8_GOT_LONG;
1847 if (flags & UTF8_ALLOW_LONG) {
1849 /* We don't allow the actual overlong value, unless the
1850 * special extra bit is also set */
1851 if (! (flags & ( UTF8_ALLOW_LONG_AND_ITS_VALUE
1852 & ~UTF8_ALLOW_LONG)))
1854 uv = UNICODE_REPLACEMENT;
1860 if (ckWARN_d(WARN_UTF8) && ! (flags & UTF8_CHECK_ONLY)) {
1861 pack_warn = packWARN(WARN_UTF8);
1863 /* These error types cause 'uv' to be something that
1864 * isn't what was intended, so can't use it in the
1865 * message. The other error types either can't
1866 * generate an overlong, or else the 'uv' is valid */
1868 (UTF8_GOT_TOO_SHORT|UTF8_GOT_OVERFLOW))
1870 message = Perl_form(aTHX_
1871 "%s: %s (any UTF-8 sequence that starts"
1872 " with \"%s\" is overlong which can and"
1873 " should be represented with a"
1874 " different, shorter sequence)",
1876 _byte_dump_string(s0, send - s0, 0),
1877 _byte_dump_string(s0, curlen, 0));
1880 U8 tmpbuf[UTF8_MAXBYTES+1];
1881 const U8 * const e = uvoffuni_to_utf8_flags(tmpbuf,
1883 /* Don't use U+ for non-Unicode code points, which
1884 * includes those in the Latin1 range */
1885 const char * preface = ( uv > PERL_UNICODE_MAX
1892 message = Perl_form(aTHX_
1893 "%s: %s (overlong; instead use %s to represent"
1896 _byte_dump_string(s0, send - s0, 0),
1897 _byte_dump_string(tmpbuf, e - tmpbuf, 0),
1899 ((uv < 256) ? 2 : 4), /* Field width of 2 for
1900 small code points */
1905 } /* End of looking through the possible flags */
1907 /* Display the message (if any) for the problem being handled in
1908 * this iteration of the loop */
1911 Perl_warner(aTHX_ pack_warn, "%s in %s", message,
1914 Perl_warner(aTHX_ pack_warn, "%s", message);
1916 } /* End of 'while (possible_problems)' */
1918 /* Since there was a possible problem, the returned length may need to
1919 * be changed from the one stored at the beginning of this function.
1920 * Instead of trying to figure out if that's needed, just do it. */
1926 if (flags & UTF8_CHECK_ONLY && retlen) {
1927 *retlen = ((STRLEN) -1);
1933 return UNI_TO_NATIVE(uv);
1937 =for apidoc utf8_to_uvchr_buf
1939 Returns the native code point of the first character in the string C<s> which
1940 is assumed to be in UTF-8 encoding; C<send> points to 1 beyond the end of C<s>.
1941 C<*retlen> will be set to the length, in bytes, of that character.
1943 If C<s> does not point to a well-formed UTF-8 character and UTF8 warnings are
1944 enabled, zero is returned and C<*retlen> is set (if C<retlen> isn't
1945 C<NULL>) to -1. If those warnings are off, the computed value, if well-defined
1946 (or the Unicode REPLACEMENT CHARACTER if not), is silently returned, and
1947 C<*retlen> is set (if C<retlen> isn't C<NULL>) so that (S<C<s> + C<*retlen>>) is
1948 the next possible position in C<s> that could begin a non-malformed character.
1949 See L</utf8n_to_uvchr> for details on when the REPLACEMENT CHARACTER is
1954 Also implemented as a macro in utf8.h
1960 Perl_utf8_to_uvchr_buf(pTHX_ const U8 *s, const U8 *send, STRLEN *retlen)
1962 PERL_ARGS_ASSERT_UTF8_TO_UVCHR_BUF;
1966 return utf8n_to_uvchr(s, send - s, retlen,
1967 ckWARN_d(WARN_UTF8) ? 0 : UTF8_ALLOW_ANY);
1970 /* This is marked as deprecated
1972 =for apidoc utf8_to_uvuni_buf
1974 Only in very rare circumstances should code need to be dealing in Unicode
1975 (as opposed to native) code points. In those few cases, use
1976 C<L<NATIVE_TO_UNI(utf8_to_uvchr_buf(...))|/utf8_to_uvchr_buf>> instead.
1978 Returns the Unicode (not-native) code point of the first character in the
1980 is assumed to be in UTF-8 encoding; C<send> points to 1 beyond the end of C<s>.
1981 C<retlen> will be set to the length, in bytes, of that character.
1983 If C<s> does not point to a well-formed UTF-8 character and UTF8 warnings are
1984 enabled, zero is returned and C<*retlen> is set (if C<retlen> isn't
1985 NULL) to -1. If those warnings are off, the computed value if well-defined (or
1986 the Unicode REPLACEMENT CHARACTER, if not) is silently returned, and C<*retlen>
1987 is set (if C<retlen> isn't NULL) so that (S<C<s> + C<*retlen>>) is the
1988 next possible position in C<s> that could begin a non-malformed character.
1989 See L</utf8n_to_uvchr> for details on when the REPLACEMENT CHARACTER is returned.
1995 Perl_utf8_to_uvuni_buf(pTHX_ const U8 *s, const U8 *send, STRLEN *retlen)
1997 PERL_ARGS_ASSERT_UTF8_TO_UVUNI_BUF;
2001 return NATIVE_TO_UNI(utf8_to_uvchr_buf(s, send, retlen));
2005 =for apidoc utf8_length
2007 Returns the number of characters in the sequence of UTF-8-encoded bytes starting
2008 at C<s> and ending at the byte just before C<e>. If <s> and <e> point to the
2009 same place, it returns 0 with no warning raised.
2011 If C<e E<lt> s> or if the scan would end up past C<e>, it raises a UTF8 warning
2012 and returns the number of valid characters.
2018 Perl_utf8_length(pTHX_ const U8 *s, const U8 *e)
2022 PERL_ARGS_ASSERT_UTF8_LENGTH;
2024 /* Note: cannot use UTF8_IS_...() too eagerly here since e.g.
2025 * the bitops (especially ~) can create illegal UTF-8.
2026 * In other words: in Perl UTF-8 is not just for Unicode. */
2029 goto warn_and_return;
2039 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8),
2040 "%s in %s", unees, OP_DESC(PL_op));
2042 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8), "%s", unees);
2049 =for apidoc bytes_cmp_utf8
2051 Compares the sequence of characters (stored as octets) in C<b>, C<blen> with the
2052 sequence of characters (stored as UTF-8)
2053 in C<u>, C<ulen>. Returns 0 if they are
2054 equal, -1 or -2 if the first string is less than the second string, +1 or +2
2055 if the first string is greater than the second string.
2057 -1 or +1 is returned if the shorter string was identical to the start of the
2058 longer string. -2 or +2 is returned if
2059 there was a difference between characters
2066 Perl_bytes_cmp_utf8(pTHX_ const U8 *b, STRLEN blen, const U8 *u, STRLEN ulen)
2068 const U8 *const bend = b + blen;
2069 const U8 *const uend = u + ulen;
2071 PERL_ARGS_ASSERT_BYTES_CMP_UTF8;
2073 while (b < bend && u < uend) {
2075 if (!UTF8_IS_INVARIANT(c)) {
2076 if (UTF8_IS_DOWNGRADEABLE_START(c)) {
2079 if (UTF8_IS_CONTINUATION(c1)) {
2080 c = EIGHT_BIT_UTF8_TO_NATIVE(c, c1);
2082 /* diag_listed_as: Malformed UTF-8 character%s */
2083 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8),
2085 unexpected_non_continuation_text(u - 2, 2, 1, 2),
2086 PL_op ? " in " : "",
2087 PL_op ? OP_DESC(PL_op) : "");
2092 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8),
2093 "%s in %s", unees, OP_DESC(PL_op));
2095 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8), "%s", unees);
2096 return -2; /* Really want to return undef :-) */
2103 return *b < c ? -2 : +2;
2108 if (b == bend && u == uend)
2111 return b < bend ? +1 : -1;
2115 =for apidoc utf8_to_bytes
2117 Converts a string C<"s"> of length C<*lenp> from UTF-8 into native byte encoding.
2118 Unlike L</bytes_to_utf8>, this over-writes the original string, and
2119 updates C<*lenp> to contain the new length.
2120 Returns zero on failure (leaving C<"s"> unchanged) setting C<*lenp> to -1.
2122 Upon successful return, the number of variants in the string can be computed by
2123 having saved the value of C<*lenp> before the call, and subtracting the
2124 after-call value of C<*lenp> from it.
2126 If you need a copy of the string, see L</bytes_from_utf8>.
2132 Perl_utf8_to_bytes(pTHX_ U8 *s, STRLEN *lenp)
2136 PERL_ARGS_ASSERT_UTF8_TO_BYTES;
2137 PERL_UNUSED_CONTEXT;
2139 /* This is a no-op if no variants at all in the input */
2140 if (is_utf8_invariant_string_loc(s, *lenp, (const U8 **) &first_variant)) {
2145 U8 * const save = s;
2146 U8 * const send = s + *lenp;
2149 /* Nothing before the first variant needs to be changed, so start the real
2153 if (! UTF8_IS_INVARIANT(*s)) {
2154 if (! UTF8_IS_NEXT_CHAR_DOWNGRADEABLE(s, send)) {
2155 *lenp = ((STRLEN) -1);
2163 /* Is downgradable, so do it */
2164 d = s = first_variant;
2167 if (! UVCHR_IS_INVARIANT(c)) {
2168 /* Then it is two-byte encoded */
2169 c = EIGHT_BIT_UTF8_TO_NATIVE(c, *s);
2182 =for apidoc bytes_from_utf8
2184 Converts a potentially UTF-8 encoded string C<s> of length C<*lenp> into native
2185 byte encoding. On input, the boolean C<*is_utf8p> gives whether or not C<s> is
2186 actually encoded in UTF-8.
2188 Unlike L</utf8_to_bytes> but like L</bytes_to_utf8>, this is non-destructive of
2191 Do nothing if C<*is_utf8p> is 0, or if there are code points in the string
2192 not expressible in native byte encoding. In these cases, C<*is_utf8p> and
2193 C<*lenp> are unchanged, and the return value is the original C<s>.
2195 Otherwise, C<*is_utf8p> is set to 0, and the return value is a pointer to a
2196 newly created string containing a downgraded copy of C<s>, and whose length is
2197 returned in C<*lenp>, updated. The new string is C<NUL>-terminated.
2199 Upon successful return, the number of variants in the string can be computed by
2200 having saved the value of C<*lenp> before the call, and subtracting the
2201 after-call value of C<*lenp> from it.
2205 There is a macro that avoids this function call, but this is retained for
2206 anyone who calls it with the Perl_ prefix */
2209 Perl_bytes_from_utf8(pTHX_ const U8 *s, STRLEN *lenp, bool *is_utf8p)
2211 PERL_ARGS_ASSERT_BYTES_FROM_UTF8;
2212 PERL_UNUSED_CONTEXT;
2214 return bytes_from_utf8_loc(s, lenp, is_utf8p, NULL);
2218 No = here because currently externally undocumented
2219 for apidoc bytes_from_utf8_loc
2221 Like C<L</bytes_from_utf8>()>, but takes an extra parameter, a pointer to where
2222 to store the location of the first character in C<"s"> that cannot be
2223 converted to non-UTF8.
2225 If that parameter is C<NULL>, this function behaves identically to
2228 Otherwise if C<*is_utf8p> is 0 on input, the function behaves identically to
2229 C<bytes_from_utf8>, except it also sets C<*first_non_downgradable> to C<NULL>.
2231 Otherwise, the function returns a newly created C<NUL>-terminated string
2232 containing the non-UTF8 equivalent of the convertible first portion of
2233 C<"s">. C<*lenp> is set to its length, not including the terminating C<NUL>.
2234 If the entire input string was converted, C<*is_utf8p> is set to a FALSE value,
2235 and C<*first_non_downgradable> is set to C<NULL>.
2237 Otherwise, C<*first_non_downgradable> set to point to the first byte of the
2238 first character in the original string that wasn't converted. C<*is_utf8p> is
2239 unchanged. Note that the new string may have length 0.
2241 Another way to look at it is, if C<*first_non_downgradable> is non-C<NULL> and
2242 C<*is_utf8p> is TRUE, this function starts at the beginning of C<"s"> and
2243 converts as many characters in it as possible stopping at the first one it
2244 finds that can't be converted to non-UTF-8. C<*first_non_downgradable> is
2245 set to point to that. The function returns the portion that could be converted
2246 in a newly created C<NUL>-terminated string, and C<*lenp> is set to its length,
2247 not including the terminating C<NUL>. If the very first character in the
2248 original could not be converted, C<*lenp> will be 0, and the new string will
2249 contain just a single C<NUL>. If the entire input string was converted,
2250 C<*is_utf8p> is set to FALSE and C<*first_non_downgradable> is set to C<NULL>.
2252 Upon successful return, the number of variants in the converted portion of the
2253 string can be computed by having saved the value of C<*lenp> before the call,
2254 and subtracting the after-call value of C<*lenp> from it.
2262 Perl_bytes_from_utf8_loc(const U8 *s, STRLEN *lenp, bool *is_utf8p, const U8** first_unconverted)
2265 const U8 *original = s;
2266 U8 *converted_start;
2267 const U8 *send = s + *lenp;
2269 PERL_ARGS_ASSERT_BYTES_FROM_UTF8_LOC;
2272 if (first_unconverted) {
2273 *first_unconverted = NULL;
2276 return (U8 *) original;
2279 Newx(d, (*lenp) + 1, U8);
2281 converted_start = d;
2284 if (! UTF8_IS_INVARIANT(c)) {
2286 /* Then it is multi-byte encoded. If the code point is above 0xFF,
2287 * have to stop now */
2288 if (UNLIKELY (! UTF8_IS_NEXT_CHAR_DOWNGRADEABLE(s - 1, send))) {
2289 if (first_unconverted) {
2290 *first_unconverted = s - 1;
2291 goto finish_and_return;
2294 Safefree(converted_start);
2295 return (U8 *) original;
2299 c = EIGHT_BIT_UTF8_TO_NATIVE(c, *s);
2305 /* Here, converted the whole of the input */
2307 if (first_unconverted) {
2308 *first_unconverted = NULL;
2313 *lenp = d - converted_start;
2315 /* Trim unused space */
2316 Renew(converted_start, *lenp + 1, U8);
2318 return converted_start;
2322 =for apidoc bytes_to_utf8
2324 Converts a string C<s> of length C<*lenp> bytes from the native encoding into
2326 Returns a pointer to the newly-created string, and sets C<*lenp> to
2327 reflect the new length in bytes.
2329 Upon successful return, the number of variants in the string can be computed by
2330 having saved the value of C<*lenp> before the call, and subtracting it from the
2331 after-call value of C<*lenp>.
2333 A C<NUL> character will be written after the end of the string.
2335 If you want to convert to UTF-8 from encodings other than
2336 the native (Latin1 or EBCDIC),
2337 see L</sv_recode_to_utf8>().
2343 Perl_bytes_to_utf8(pTHX_ const U8 *s, STRLEN *lenp)
2345 const U8 * const send = s + (*lenp);
2349 PERL_ARGS_ASSERT_BYTES_TO_UTF8;
2350 PERL_UNUSED_CONTEXT;
2352 Newx(d, (*lenp) * 2 + 1, U8);
2356 append_utf8_from_native_byte(*s, &d);
2363 /* Trim unused space */
2364 Renew(dst, *lenp + 1, U8);
2370 * Convert native (big-endian) UTF-16 to UTF-8. For reversed (little-endian),
2371 * use utf16_to_utf8_reversed().
2373 * UTF-16 requires 2 bytes for every code point below 0x10000; otherwise 4 bytes.
2374 * UTF-8 requires 1-3 bytes for every code point below 0x1000; otherwise 4 bytes.
2375 * UTF-EBCDIC requires 1-4 bytes for every code point below 0x1000; otherwise 4-5 bytes.
2377 * These functions don't check for overflow. The worst case is every code
2378 * point in the input is 2 bytes, and requires 4 bytes on output. (If the code
2379 * is never going to run in EBCDIC, it is 2 bytes requiring 3 on output.) Therefore the
2380 * destination must be pre-extended to 2 times the source length.
2382 * Do not use in-place. We optimize for native, for obvious reasons. */
2385 Perl_utf16_to_utf8(pTHX_ U8* p, U8* d, I32 bytelen, I32 *newlen)
2390 PERL_ARGS_ASSERT_UTF16_TO_UTF8;
2393 Perl_croak(aTHX_ "panic: utf16_to_utf8: odd bytelen %" UVuf,
2399 UV uv = (p[0] << 8) + p[1]; /* UTF-16BE */
2401 if (OFFUNI_IS_INVARIANT(uv)) {
2402 *d++ = LATIN1_TO_NATIVE((U8) uv);
2405 if (uv <= MAX_UTF8_TWO_BYTE) {
2406 *d++ = UTF8_TWO_BYTE_HI(UNI_TO_NATIVE(uv));
2407 *d++ = UTF8_TWO_BYTE_LO(UNI_TO_NATIVE(uv));
2411 #define FIRST_HIGH_SURROGATE UNICODE_SURROGATE_FIRST
2412 #define LAST_HIGH_SURROGATE 0xDBFF
2413 #define FIRST_LOW_SURROGATE 0xDC00
2414 #define LAST_LOW_SURROGATE UNICODE_SURROGATE_LAST
2415 #define FIRST_IN_PLANE1 0x10000
2417 /* This assumes that most uses will be in the first Unicode plane, not
2418 * needing surrogates */
2419 if (UNLIKELY(uv >= UNICODE_SURROGATE_FIRST
2420 && uv <= UNICODE_SURROGATE_LAST))
2422 if (UNLIKELY(p >= pend) || UNLIKELY(uv > LAST_HIGH_SURROGATE)) {
2423 Perl_croak(aTHX_ "Malformed UTF-16 surrogate");
2426 UV low = (p[0] << 8) + p[1];
2427 if ( UNLIKELY(low < FIRST_LOW_SURROGATE)
2428 || UNLIKELY(low > LAST_LOW_SURROGATE))
2430 Perl_croak(aTHX_ "Malformed UTF-16 surrogate");
2433 uv = ((uv - FIRST_HIGH_SURROGATE) << 10)
2434 + (low - FIRST_LOW_SURROGATE) + FIRST_IN_PLANE1;
2438 d = uvoffuni_to_utf8_flags(d, uv, 0);
2440 if (uv < FIRST_IN_PLANE1) {
2441 *d++ = (U8)(( uv >> 12) | 0xe0);
2442 *d++ = (U8)(((uv >> 6) & 0x3f) | 0x80);
2443 *d++ = (U8)(( uv & 0x3f) | 0x80);
2447 *d++ = (U8)(( uv >> 18) | 0xf0);
2448 *d++ = (U8)(((uv >> 12) & 0x3f) | 0x80);
2449 *d++ = (U8)(((uv >> 6) & 0x3f) | 0x80);
2450 *d++ = (U8)(( uv & 0x3f) | 0x80);
2455 *newlen = d - dstart;
2459 /* Note: this one is slightly destructive of the source. */
2462 Perl_utf16_to_utf8_reversed(pTHX_ U8* p, U8* d, I32 bytelen, I32 *newlen)
2465 U8* const send = s + bytelen;
2467 PERL_ARGS_ASSERT_UTF16_TO_UTF8_REVERSED;
2470 Perl_croak(aTHX_ "panic: utf16_to_utf8_reversed: odd bytelen %" UVuf,
2474 const U8 tmp = s[0];
2479 return utf16_to_utf8(p, d, bytelen, newlen);
2483 Perl__is_uni_FOO(pTHX_ const U8 classnum, const UV c)
2485 U8 tmpbuf[UTF8_MAXBYTES+1];
2486 uvchr_to_utf8(tmpbuf, c);
2487 return _is_utf8_FOO_with_len(classnum, tmpbuf, tmpbuf + sizeof(tmpbuf));
2490 /* Internal function so we can deprecate the external one, and call
2491 this one from other deprecated functions in this file */
2494 Perl__is_utf8_idstart(pTHX_ const U8 *p)
2496 PERL_ARGS_ASSERT__IS_UTF8_IDSTART;
2500 return is_utf8_common(p, &PL_utf8_idstart, "IdStart", NULL);
2504 Perl__is_uni_perl_idcont(pTHX_ UV c)
2506 U8 tmpbuf[UTF8_MAXBYTES+1];
2507 uvchr_to_utf8(tmpbuf, c);
2508 return _is_utf8_perl_idcont_with_len(tmpbuf, tmpbuf + sizeof(tmpbuf));
2512 Perl__is_uni_perl_idstart(pTHX_ UV c)
2514 U8 tmpbuf[UTF8_MAXBYTES+1];
2515 uvchr_to_utf8(tmpbuf, c);
2516 return _is_utf8_perl_idstart_with_len(tmpbuf, tmpbuf + sizeof(tmpbuf));
2520 Perl__to_upper_title_latin1(pTHX_ const U8 c, U8* p, STRLEN *lenp,
2523 /* We have the latin1-range values compiled into the core, so just use
2524 * those, converting the result to UTF-8. The only difference between upper
2525 * and title case in this range is that LATIN_SMALL_LETTER_SHARP_S is
2526 * either "SS" or "Ss". Which one to use is passed into the routine in
2527 * 'S_or_s' to avoid a test */
2529 UV converted = toUPPER_LATIN1_MOD(c);
2531 PERL_ARGS_ASSERT__TO_UPPER_TITLE_LATIN1;
2533 assert(S_or_s == 'S' || S_or_s == 's');
2535 if (UVCHR_IS_INVARIANT(converted)) { /* No difference between the two for
2536 characters in this range */
2537 *p = (U8) converted;
2542 /* toUPPER_LATIN1_MOD gives the correct results except for three outliers,
2543 * which it maps to one of them, so as to only have to have one check for
2544 * it in the main case */
2545 if (UNLIKELY(converted == LATIN_SMALL_LETTER_Y_WITH_DIAERESIS)) {
2547 case LATIN_SMALL_LETTER_Y_WITH_DIAERESIS:
2548 converted = LATIN_CAPITAL_LETTER_Y_WITH_DIAERESIS;
2551 converted = GREEK_CAPITAL_LETTER_MU;
2553 #if UNICODE_MAJOR_VERSION > 2 \
2554 || (UNICODE_MAJOR_VERSION == 2 && UNICODE_DOT_VERSION >= 1 \
2555 && UNICODE_DOT_DOT_VERSION >= 8)
2556 case LATIN_SMALL_LETTER_SHARP_S:
2563 Perl_croak(aTHX_ "panic: to_upper_title_latin1 did not expect"
2564 " '%c' to map to '%c'",
2565 c, LATIN_SMALL_LETTER_Y_WITH_DIAERESIS);
2566 NOT_REACHED; /* NOTREACHED */
2570 *(p)++ = UTF8_TWO_BYTE_HI(converted);
2571 *p = UTF8_TWO_BYTE_LO(converted);
2577 /* Call the function to convert a UTF-8 encoded character to the specified case.
2578 * Note that there may be more than one character in the result.
2579 * INP is a pointer to the first byte of the input character
2580 * OUTP will be set to the first byte of the string of changed characters. It
2581 * needs to have space for UTF8_MAXBYTES_CASE+1 bytes
2582 * LENP will be set to the length in bytes of the string of changed characters
2584 * The functions return the ordinal of the first character in the string of
2586 #define CALL_UPPER_CASE(uv, s, d, lenp) \
2587 _to_utf8_case(uv, s, d, lenp, &PL_utf8_toupper, "ToUc", "")
2588 #define CALL_TITLE_CASE(uv, s, d, lenp) \
2589 _to_utf8_case(uv, s, d, lenp, &PL_utf8_totitle, "ToTc", "")
2590 #define CALL_LOWER_CASE(uv, s, d, lenp) \
2591 _to_utf8_case(uv, s, d, lenp, &PL_utf8_tolower, "ToLc", "")
2593 /* This additionally has the input parameter 'specials', which if non-zero will
2594 * cause this to use the specials hash for folding (meaning get full case
2595 * folding); otherwise, when zero, this implies a simple case fold */
2596 #define CALL_FOLD_CASE(uv, s, d, lenp, specials) \
2597 _to_utf8_case(uv, s, d, lenp, &PL_utf8_tofold, "ToCf", (specials) ? "" : NULL)
2600 Perl_to_uni_upper(pTHX_ UV c, U8* p, STRLEN *lenp)
2602 /* Convert the Unicode character whose ordinal is <c> to its uppercase
2603 * version and store that in UTF-8 in <p> and its length in bytes in <lenp>.
2604 * Note that the <p> needs to be at least UTF8_MAXBYTES_CASE+1 bytes since
2605 * the changed version may be longer than the original character.
2607 * The ordinal of the first character of the changed version is returned
2608 * (but note, as explained above, that there may be more.) */
2610 PERL_ARGS_ASSERT_TO_UNI_UPPER;
2613 return _to_upper_title_latin1((U8) c, p, lenp, 'S');
2616 uvchr_to_utf8(p, c);
2617 return CALL_UPPER_CASE(c, p, p, lenp);
2621 Perl_to_uni_title(pTHX_ UV c, U8* p, STRLEN *lenp)
2623 PERL_ARGS_ASSERT_TO_UNI_TITLE;
2626 return _to_upper_title_latin1((U8) c, p, lenp, 's');
2629 uvchr_to_utf8(p, c);
2630 return CALL_TITLE_CASE(c, p, p, lenp);
2634 S_to_lower_latin1(const U8 c, U8* p, STRLEN *lenp, const char dummy)
2636 /* We have the latin1-range values compiled into the core, so just use
2637 * those, converting the result to UTF-8. Since the result is always just
2638 * one character, we allow <p> to be NULL */
2640 U8 converted = toLOWER_LATIN1(c);
2642 PERL_UNUSED_ARG(dummy);
2645 if (NATIVE_BYTE_IS_INVARIANT(converted)) {
2650 /* Result is known to always be < 256, so can use the EIGHT_BIT
2652 *p = UTF8_EIGHT_BIT_HI(converted);
2653 *(p+1) = UTF8_EIGHT_BIT_LO(converted);
2661 Perl_to_uni_lower(pTHX_ UV c, U8* p, STRLEN *lenp)
2663 PERL_ARGS_ASSERT_TO_UNI_LOWER;
2666 return to_lower_latin1((U8) c, p, lenp, 0 /* 0 is a dummy arg */ );
2669 uvchr_to_utf8(p, c);
2670 return CALL_LOWER_CASE(c, p, p, lenp);
2674 Perl__to_fold_latin1(pTHX_ const U8 c, U8* p, STRLEN *lenp,
2675 const unsigned int flags)
2677 /* Corresponds to to_lower_latin1(); <flags> bits meanings:
2678 * FOLD_FLAGS_NOMIX_ASCII iff non-ASCII to ASCII folds are prohibited
2679 * FOLD_FLAGS_FULL iff full folding is to be used;
2681 * Not to be used for locale folds
2686 PERL_ARGS_ASSERT__TO_FOLD_LATIN1;
2687 PERL_UNUSED_CONTEXT;
2689 assert (! (flags & FOLD_FLAGS_LOCALE));
2691 if (UNLIKELY(c == MICRO_SIGN)) {
2692 converted = GREEK_SMALL_LETTER_MU;
2694 #if UNICODE_MAJOR_VERSION > 3 /* no multifolds in early Unicode */ \
2695 || (UNICODE_MAJOR_VERSION == 3 && ( UNICODE_DOT_VERSION > 0) \
2696 || UNICODE_DOT_DOT_VERSION > 0)
2697 else if ( (flags & FOLD_FLAGS_FULL)
2698 && UNLIKELY(c == LATIN_SMALL_LETTER_SHARP_S))
2700 /* If can't cross 127/128 boundary, can't return "ss"; instead return
2701 * two U+017F characters, as fc("\df") should eq fc("\x{17f}\x{17f}")
2702 * under those circumstances. */
2703 if (flags & FOLD_FLAGS_NOMIX_ASCII) {
2704 *lenp = 2 * sizeof(LATIN_SMALL_LETTER_LONG_S_UTF8) - 2;
2705 Copy(LATIN_SMALL_LETTER_LONG_S_UTF8 LATIN_SMALL_LETTER_LONG_S_UTF8,
2707 return LATIN_SMALL_LETTER_LONG_S;
2717 else { /* In this range the fold of all other characters is their lower
2719 converted = toLOWER_LATIN1(c);
2722 if (UVCHR_IS_INVARIANT(converted)) {
2723 *p = (U8) converted;
2727 *(p)++ = UTF8_TWO_BYTE_HI(converted);
2728 *p = UTF8_TWO_BYTE_LO(converted);
2736 Perl__to_uni_fold_flags(pTHX_ UV c, U8* p, STRLEN *lenp, U8 flags)
2739 /* Not currently externally documented, and subject to change
2740 * <flags> bits meanings:
2741 * FOLD_FLAGS_FULL iff full folding is to be used;
2742 * FOLD_FLAGS_LOCALE is set iff the rules from the current underlying
2743 * locale are to be used.
2744 * FOLD_FLAGS_NOMIX_ASCII iff non-ASCII to ASCII folds are prohibited
2747 PERL_ARGS_ASSERT__TO_UNI_FOLD_FLAGS;
2749 if (flags & FOLD_FLAGS_LOCALE) {
2750 /* Treat a UTF-8 locale as not being in locale at all */
2751 if (IN_UTF8_CTYPE_LOCALE) {
2752 flags &= ~FOLD_FLAGS_LOCALE;
2755 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
2756 goto needs_full_generality;
2761 return _to_fold_latin1((U8) c, p, lenp,
2762 flags & (FOLD_FLAGS_FULL | FOLD_FLAGS_NOMIX_ASCII));
2765 /* Here, above 255. If no special needs, just use the macro */
2766 if ( ! (flags & (FOLD_FLAGS_LOCALE|FOLD_FLAGS_NOMIX_ASCII))) {
2767 uvchr_to_utf8(p, c);
2768 return CALL_FOLD_CASE(c, p, p, lenp, flags & FOLD_FLAGS_FULL);
2770 else { /* Otherwise, _toFOLD_utf8_flags has the intelligence to deal with
2771 the special flags. */
2772 U8 utf8_c[UTF8_MAXBYTES + 1];
2774 needs_full_generality:
2775 uvchr_to_utf8(utf8_c, c);
2776 return _toFOLD_utf8_flags(utf8_c, utf8_c + sizeof(utf8_c),
2781 PERL_STATIC_INLINE bool
2782 S_is_utf8_common(pTHX_ const U8 *const p, SV **swash,
2783 const char *const swashname, SV* const invlist)
2785 /* returns a boolean giving whether or not the UTF8-encoded character that
2786 * starts at <p> is in the swash indicated by <swashname>. <swash>
2787 * contains a pointer to where the swash indicated by <swashname>
2788 * is to be stored; which this routine will do, so that future calls will
2789 * look at <*swash> and only generate a swash if it is not null. <invlist>
2790 * is NULL or an inversion list that defines the swash. If not null, it
2791 * saves time during initialization of the swash.
2793 * Note that it is assumed that the buffer length of <p> is enough to
2794 * contain all the bytes that comprise the character. Thus, <*p> should
2795 * have been checked before this call for mal-formedness enough to assure
2798 PERL_ARGS_ASSERT_IS_UTF8_COMMON;
2800 /* The API should have included a length for the UTF-8 character in <p>,
2801 * but it doesn't. We therefore assume that p has been validated at least
2802 * as far as there being enough bytes available in it to accommodate the
2803 * character without reading beyond the end, and pass that number on to the
2804 * validating routine */
2805 if (! isUTF8_CHAR(p, p + UTF8SKIP(p))) {
2806 _force_out_malformed_utf8_message(p, p + UTF8SKIP(p),
2807 _UTF8_NO_CONFIDENCE_IN_CURLEN,
2809 NOT_REACHED; /* NOTREACHED */
2813 U8 flags = _CORE_SWASH_INIT_ACCEPT_INVLIST;
2814 *swash = _core_swash_init("utf8",
2816 /* Only use the name if there is no inversion
2817 * list; otherwise will go out to disk */
2818 (invlist) ? "" : swashname,
2820 &PL_sv_undef, 1, 0, invlist, &flags);
2823 return swash_fetch(*swash, p, TRUE) != 0;
2826 PERL_STATIC_INLINE bool
2827 S_is_utf8_common_with_len(pTHX_ const U8 *const p, const U8 * const e,
2828 SV **swash, const char *const swashname,
2831 /* returns a boolean giving whether or not the UTF8-encoded character that
2832 * starts at <p>, and extending no further than <e - 1> is in the swash
2833 * indicated by <swashname>. <swash> contains a pointer to where the swash
2834 * indicated by <swashname> is to be stored; which this routine will do, so
2835 * that future calls will look at <*swash> and only generate a swash if it
2836 * is not null. <invlist> is NULL or an inversion list that defines the
2837 * swash. If not null, it saves time during initialization of the swash.
2840 PERL_ARGS_ASSERT_IS_UTF8_COMMON_WITH_LEN;
2842 if (! isUTF8_CHAR(p, e)) {
2843 _force_out_malformed_utf8_message(p, e, 0, 1);
2844 NOT_REACHED; /* NOTREACHED */
2848 U8 flags = _CORE_SWASH_INIT_ACCEPT_INVLIST;
2849 *swash = _core_swash_init("utf8",
2851 /* Only use the name if there is no inversion
2852 * list; otherwise will go out to disk */
2853 (invlist) ? "" : swashname,
2855 &PL_sv_undef, 1, 0, invlist, &flags);
2858 return swash_fetch(*swash, p, TRUE) != 0;
2862 S_warn_on_first_deprecated_use(pTHX_ const char * const name,
2863 const char * const alternative,
2864 const bool use_locale,
2865 const char * const file,
2866 const unsigned line)
2870 PERL_ARGS_ASSERT_WARN_ON_FIRST_DEPRECATED_USE;
2872 if (ckWARN_d(WARN_DEPRECATED)) {
2874 key = Perl_form(aTHX_ "%s;%d;%s;%d", name, use_locale, file, line);
2875 if (! hv_fetch(PL_seen_deprecated_macro, key, strlen(key), 0)) {
2876 if (! PL_seen_deprecated_macro) {
2877 PL_seen_deprecated_macro = newHV();
2879 if (! hv_store(PL_seen_deprecated_macro, key,
2880 strlen(key), &PL_sv_undef, 0))
2882 Perl_croak(aTHX_ "panic: hv_store() unexpectedly failed");
2885 if (instr(file, "mathoms.c")) {
2886 Perl_warner(aTHX_ WARN_DEPRECATED,
2887 "In %s, line %d, starting in Perl v5.30, %s()"
2888 " will be removed. Avoid this message by"
2889 " converting to use %s().\n",
2890 file, line, name, alternative);
2893 Perl_warner(aTHX_ WARN_DEPRECATED,
2894 "In %s, line %d, starting in Perl v5.30, %s() will"
2895 " require an additional parameter. Avoid this"
2896 " message by converting to use %s().\n",
2897 file, line, name, alternative);
2904 Perl__is_utf8_FOO(pTHX_ U8 classnum,
2906 const char * const name,
2907 const char * const alternative,
2908 const bool use_utf8,
2909 const bool use_locale,
2910 const char * const file,
2911 const unsigned line)
2913 PERL_ARGS_ASSERT__IS_UTF8_FOO;
2915 warn_on_first_deprecated_use(name, alternative, use_locale, file, line);
2917 if (use_utf8 && UTF8_IS_ABOVE_LATIN1(*p)) {
2927 case _CC_ALPHANUMERIC:
2931 return is_utf8_common(p,
2932 &PL_utf8_swash_ptrs[classnum],
2933 swash_property_names[classnum],
2934 PL_XPosix_ptrs[classnum]);
2937 return is_XPERLSPACE_high(p);
2939 return is_HORIZWS_high(p);
2941 return is_XDIGIT_high(p);
2947 return is_VERTWS_high(p);
2949 if (! PL_utf8_perl_idstart) {
2950 PL_utf8_perl_idstart
2951 = _new_invlist_C_array(_Perl_IDStart_invlist);
2953 return is_utf8_common(p, &PL_utf8_perl_idstart,
2954 "_Perl_IDStart", NULL);
2956 if (! PL_utf8_perl_idcont) {
2958 = _new_invlist_C_array(_Perl_IDCont_invlist);
2960 return is_utf8_common(p, &PL_utf8_perl_idcont,
2961 "_Perl_IDCont", NULL);
2965 /* idcont is the same as wordchar below 256 */
2966 if (classnum == _CC_IDCONT) {
2967 classnum = _CC_WORDCHAR;
2969 else if (classnum == _CC_IDFIRST) {
2973 classnum = _CC_ALPHA;
2977 if (! use_utf8 || UTF8_IS_INVARIANT(*p)) {
2978 return _generic_isCC(*p, classnum);
2981 return _generic_isCC(EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p + 1 )), classnum);
2984 if (! use_utf8 || UTF8_IS_INVARIANT(*p)) {
2985 return isFOO_lc(classnum, *p);
2988 return isFOO_lc(classnum, EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p + 1 )));
2991 NOT_REACHED; /* NOTREACHED */
2995 Perl__is_utf8_FOO_with_len(pTHX_ const U8 classnum, const U8 *p,
2998 PERL_ARGS_ASSERT__IS_UTF8_FOO_WITH_LEN;
3000 assert(classnum < _FIRST_NON_SWASH_CC);
3002 return is_utf8_common_with_len(p,
3004 &PL_utf8_swash_ptrs[classnum],
3005 swash_property_names[classnum],
3006 PL_XPosix_ptrs[classnum]);
3010 Perl__is_utf8_perl_idstart_with_len(pTHX_ const U8 *p, const U8 * const e)
3014 PERL_ARGS_ASSERT__IS_UTF8_PERL_IDSTART_WITH_LEN;
3016 if (! PL_utf8_perl_idstart) {
3017 invlist = _new_invlist_C_array(_Perl_IDStart_invlist);
3019 return is_utf8_common_with_len(p, e, &PL_utf8_perl_idstart,
3020 "_Perl_IDStart", invlist);
3024 Perl__is_utf8_xidstart(pTHX_ const U8 *p)
3026 PERL_ARGS_ASSERT__IS_UTF8_XIDSTART;
3030 return is_utf8_common(p, &PL_utf8_xidstart, "XIdStart", NULL);
3034 Perl__is_utf8_perl_idcont_with_len(pTHX_ const U8 *p, const U8 * const e)
3038 PERL_ARGS_ASSERT__IS_UTF8_PERL_IDCONT_WITH_LEN;
3040 if (! PL_utf8_perl_idcont) {
3041 invlist = _new_invlist_C_array(_Perl_IDCont_invlist);
3043 return is_utf8_common_with_len(p, e, &PL_utf8_perl_idcont,
3044 "_Perl_IDCont", invlist);
3048 Perl__is_utf8_idcont(pTHX_ const U8 *p)
3050 PERL_ARGS_ASSERT__IS_UTF8_IDCONT;
3052 return is_utf8_common(p, &PL_utf8_idcont, "IdContinue", NULL);
3056 Perl__is_utf8_xidcont(pTHX_ const U8 *p)
3058 PERL_ARGS_ASSERT__IS_UTF8_XIDCONT;
3060 return is_utf8_common(p, &PL_utf8_idcont, "XIdContinue", NULL);
3064 Perl__is_utf8_mark(pTHX_ const U8 *p)
3066 PERL_ARGS_ASSERT__IS_UTF8_MARK;
3068 return is_utf8_common(p, &PL_utf8_mark, "IsM", NULL);
3071 /* change namve uv1 to 'from' */
3073 S__to_utf8_case(pTHX_ const UV uv1, const U8 *p, U8* ustrp, STRLEN *lenp,
3074 SV **swashp, const char *normal, const char *special)
3078 PERL_ARGS_ASSERT__TO_UTF8_CASE;
3080 /* For code points that don't change case, we already know that the output
3081 * of this function is the unchanged input, so we can skip doing look-ups
3082 * for them. Unfortunately the case-changing code points are scattered
3083 * around. But there are some long consecutive ranges where there are no
3084 * case changing code points. By adding tests, we can eliminate the lookup
3085 * for all the ones in such ranges. This is currently done here only for
3086 * just a few cases where the scripts are in common use in modern commerce
3087 * (and scripts adjacent to those which can be included without additional
3090 if (uv1 >= 0x0590) {
3091 /* This keeps from needing further processing the code points most
3092 * likely to be used in the following non-cased scripts: Hebrew,
3093 * Arabic, Syriac, Thaana, NKo, Samaritan, Mandaic, Devanagari,
3094 * Bengali, Gurmukhi, Gujarati, Oriya, Tamil, Telugu, Kannada,
3095 * Malayalam, Sinhala, Thai, Lao, Tibetan, Myanmar */
3100 /* The following largish code point ranges also don't have case
3101 * changes, but khw didn't think they warranted extra tests to speed
3102 * them up (which would slightly slow down everything else above them):
3103 * 1100..139F Hangul Jamo, Ethiopic
3104 * 1400..1CFF Unified Canadian Aboriginal Syllabics, Ogham, Runic,
3105 * Tagalog, Hanunoo, Buhid, Tagbanwa, Khmer, Mongolian,
3106 * Limbu, Tai Le, New Tai Lue, Buginese, Tai Tham,
3107 * Combining Diacritical Marks Extended, Balinese,
3108 * Sundanese, Batak, Lepcha, Ol Chiki
3109 * 2000..206F General Punctuation
3112 if (uv1 >= 0x2D30) {
3114 /* This keeps the from needing further processing the code points
3115 * most likely to be used in the following non-cased major scripts:
3116 * CJK, Katakana, Hiragana, plus some less-likely scripts.
3118 * (0x2D30 above might have to be changed to 2F00 in the unlikely
3119 * event that Unicode eventually allocates the unused block as of
3120 * v8.0 2FE0..2FEF to code points that are cased. khw has verified
3121 * that the test suite will start having failures to alert you
3122 * should that happen) */
3127 if (uv1 >= 0xAC00) {
3128 if (UNLIKELY(UNICODE_IS_SURROGATE(uv1))) {
3129 if (ckWARN_d(WARN_SURROGATE)) {
3130 const char* desc = (PL_op) ? OP_DESC(PL_op) : normal;
3131 Perl_warner(aTHX_ packWARN(WARN_SURROGATE),
3132 "Operation \"%s\" returns its argument for"
3133 " UTF-16 surrogate U+%04" UVXf, desc, uv1);
3138 /* AC00..FAFF Catches Hangul syllables and private use, plus
3145 if (UNLIKELY(UNICODE_IS_SUPER(uv1))) {
3146 if (UNLIKELY(uv1 > MAX_EXTERNALLY_LEGAL_CP)) {
3147 Perl_croak(aTHX_ cp_above_legal_max, uv1,
3148 MAX_EXTERNALLY_LEGAL_CP);
3150 if (ckWARN_d(WARN_NON_UNICODE)) {
3151 const char* desc = (PL_op) ? OP_DESC(PL_op) : normal;
3152 Perl_warner(aTHX_ packWARN(WARN_NON_UNICODE),
3153 "Operation \"%s\" returns its argument for"
3154 " non-Unicode code point 0x%04" UVXf, desc, uv1);
3158 #ifdef HIGHEST_CASE_CHANGING_CP_FOR_USE_ONLY_BY_UTF8_DOT_C
3160 > HIGHEST_CASE_CHANGING_CP_FOR_USE_ONLY_BY_UTF8_DOT_C))
3163 /* As of Unicode 10.0, this means we avoid swash creation
3164 * for anything beyond high Plane 1 (below emojis) */
3171 /* Note that non-characters are perfectly legal, so no warning should
3172 * be given. There are so few of them, that it isn't worth the extra
3173 * tests to avoid swash creation */
3176 if (!*swashp) /* load on-demand */
3177 *swashp = _core_swash_init("utf8", normal, &PL_sv_undef,
3181 /* It might be "special" (sometimes, but not always,
3182 * a multicharacter mapping) */
3186 /* If passed in the specials name, use that; otherwise use any
3187 * given in the swash */
3188 if (*special != '\0') {
3189 hv = get_hv(special, 0);
3192 svp = hv_fetchs(MUTABLE_HV(SvRV(*swashp)), "SPECIALS", 0);
3194 hv = MUTABLE_HV(SvRV(*svp));
3199 && (svp = hv_fetch(hv, (const char*)p, UVCHR_SKIP(uv1), FALSE))
3204 s = SvPV_const(*svp, len);
3207 len = uvchr_to_utf8(ustrp, *(U8*)s) - ustrp;
3209 Copy(s, ustrp, len, U8);
3214 if (!len && *swashp) {
3215 const UV uv2 = swash_fetch(*swashp, p, TRUE /* => is UTF-8 */);
3218 /* It was "normal" (a single character mapping). */
3219 len = uvchr_to_utf8(ustrp, uv2) - ustrp;
3227 return valid_utf8_to_uvchr(ustrp, 0);
3230 /* Here, there was no mapping defined, which means that the code point maps
3231 * to itself. Return the inputs */
3234 if (p != ustrp) { /* Don't copy onto itself */
3235 Copy(p, ustrp, len, U8);
3246 S_check_locale_boundary_crossing(pTHX_ const U8* const p, const UV result,
3247 U8* const ustrp, STRLEN *lenp)
3249 /* This is called when changing the case of a UTF-8-encoded character above
3250 * the Latin1 range, and the operation is in a non-UTF-8 locale. If the
3251 * result contains a character that crosses the 255/256 boundary, disallow
3252 * the change, and return the original code point. See L<perlfunc/lc> for
3255 * p points to the original string whose case was changed; assumed
3256 * by this routine to be well-formed
3257 * result the code point of the first character in the changed-case string
3258 * ustrp points to the changed-case string (<result> represents its
3260 * lenp points to the length of <ustrp> */
3262 UV original; /* To store the first code point of <p> */
3264 PERL_ARGS_ASSERT_CHECK_LOCALE_BOUNDARY_CROSSING;
3266 assert(UTF8_IS_ABOVE_LATIN1(*p));
3268 /* We know immediately if the first character in the string crosses the
3269 * boundary, so can skip */
3272 /* Look at every character in the result; if any cross the
3273 * boundary, the whole thing is disallowed */
3274 U8* s = ustrp + UTF8SKIP(ustrp);
3275 U8* e = ustrp + *lenp;
3277 if (! UTF8_IS_ABOVE_LATIN1(*s)) {
3283 /* Here, no characters crossed, result is ok as-is, but we warn. */
3284 _CHECK_AND_OUTPUT_WIDE_LOCALE_UTF8_MSG(p, p + UTF8SKIP(p));
3290 /* Failed, have to return the original */
3291 original = valid_utf8_to_uvchr(p, lenp);
3293 /* diag_listed_as: Can't do %s("%s") on non-UTF-8 locale; resolved to "%s". */
3294 Perl_ck_warner(aTHX_ packWARN(WARN_LOCALE),
3295 "Can't do %s(\"\\x{%" UVXf "}\") on non-UTF-8"
3296 " locale; resolved to \"\\x{%" UVXf "}\".",
3300 Copy(p, ustrp, *lenp, char);
3305 S_check_and_deprecate(pTHX_ const U8 *p,
3307 const unsigned int type, /* See below */
3308 const bool use_locale, /* Is this a 'LC_'
3310 const char * const file,
3311 const unsigned line)
3313 /* This is a temporary function to deprecate the unsafe calls to the case
3314 * changing macros and functions. It keeps all the special stuff in just
3317 * It updates *e with the pointer to the end of the input string. If using
3318 * the old-style macros, *e is NULL on input, and so this function assumes
3319 * the input string is long enough to hold the entire UTF-8 sequence, and
3320 * sets *e accordingly, but it then returns a flag to pass the
3321 * utf8n_to_uvchr(), to tell it that this size is a guess, and to avoid
3322 * using the full length if possible.
3324 * It also does the assert that *e > p when *e is not NULL. This should be
3325 * migrated to the callers when this function gets deleted.
3327 * The 'type' parameter is used for the caller to specify which case
3328 * changing function this is called from: */
3330 # define DEPRECATE_TO_UPPER 0
3331 # define DEPRECATE_TO_TITLE 1
3332 # define DEPRECATE_TO_LOWER 2
3333 # define DEPRECATE_TO_FOLD 3
3335 U32 utf8n_flags = 0;
3337 const char * alternative;
3339 PERL_ARGS_ASSERT_CHECK_AND_DEPRECATE;
3342 utf8n_flags = _UTF8_NO_CONFIDENCE_IN_CURLEN;
3343 *e = p + UTF8SKIP(p);
3345 /* For mathoms.c calls, we use the function name we know is stored
3346 * there. It could be part of a larger path */
3347 if (type == DEPRECATE_TO_UPPER) {
3348 name = instr(file, "mathoms.c")
3351 alternative = "toUPPER_utf8_safe";
3353 else if (type == DEPRECATE_TO_TITLE) {
3354 name = instr(file, "mathoms.c")
3357 alternative = "toTITLE_utf8_safe";
3359 else if (type == DEPRECATE_TO_LOWER) {
3360 name = instr(file, "mathoms.c")
3363 alternative = "toLOWER_utf8_safe";
3365 else if (type == DEPRECATE_TO_FOLD) {
3366 name = instr(file, "mathoms.c")
3369 alternative = "toFOLD_utf8_safe";
3371 else Perl_croak(aTHX_ "panic: Unexpected case change type");
3373 warn_on_first_deprecated_use(name, alternative, use_locale, file, line);
3382 /* The process for changing the case is essentially the same for the four case
3383 * change types, except there are complications for folding. Otherwise the
3384 * difference is only which case to change to. To make sure that they all do
3385 * the same thing, the bodies of the functions are extracted out into the
3386 * following two macros. The functions are written with the same variable
3387 * names, and these are known and used inside these macros. It would be
3388 * better, of course, to have inline functions to do it, but since different
3389 * macros are called, depending on which case is being changed to, this is not
3390 * feasible in C (to khw's knowledge). Two macros are created so that the fold
3391 * function can start with the common start macro, then finish with its special
3392 * handling; while the other three cases can just use the common end macro.
3394 * The algorithm is to use the proper (passed in) macro or function to change
3395 * the case for code points that are below 256. The macro is used if using
3396 * locale rules for the case change; the function if not. If the code point is
3397 * above 255, it is computed from the input UTF-8, and another macro is called
3398 * to do the conversion. If necessary, the output is converted to UTF-8. If
3399 * using a locale, we have to check that the change did not cross the 255/256
3400 * boundary, see check_locale_boundary_crossing() for further details.
3402 * The macros are split with the correct case change for the below-256 case
3403 * stored into 'result', and in the middle of an else clause for the above-255
3404 * case. At that point in the 'else', 'result' is not the final result, but is
3405 * the input code point calculated from the UTF-8. The fold code needs to
3406 * realize all this and take it from there.
3408 * If you read the two macros as sequential, it's easier to understand what's
3410 #define CASE_CHANGE_BODY_START(locale_flags, LC_L1_change_macro, L1_func, \
3411 L1_func_extra_param) \
3413 if (flags & (locale_flags)) { \
3414 /* Treat a UTF-8 locale as not being in locale at all */ \
3415 if (IN_UTF8_CTYPE_LOCALE) { \
3416 flags &= ~(locale_flags); \
3419 _CHECK_AND_WARN_PROBLEMATIC_LOCALE; \
3423 if (UTF8_IS_INVARIANT(*p)) { \
3424 if (flags & (locale_flags)) { \
3425 result = LC_L1_change_macro(*p); \
3428 return L1_func(*p, ustrp, lenp, L1_func_extra_param); \
3431 else if UTF8_IS_NEXT_CHAR_DOWNGRADEABLE(p, e) { \
3432 if (flags & (locale_flags)) { \
3433 result = LC_L1_change_macro(EIGHT_BIT_UTF8_TO_NATIVE(*p, \
3437 return L1_func(EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p+1)), \
3438 ustrp, lenp, L1_func_extra_param); \
3441 else { /* malformed UTF-8 or ord above 255 */ \
3442 STRLEN len_result; \
3443 result = utf8n_to_uvchr(p, e - p, &len_result, UTF8_CHECK_ONLY); \
3444 if (len_result == (STRLEN) -1) { \
3445 _force_out_malformed_utf8_message(p, e, utf8n_flags, \
3449 #define CASE_CHANGE_BODY_END(locale_flags, change_macro) \
3450 result = change_macro(result, p, ustrp, lenp); \
3452 if (flags & (locale_flags)) { \
3453 result = check_locale_boundary_crossing(p, result, ustrp, lenp); \
3458 /* Here, used locale rules. Convert back to UTF-8 */ \
3459 if (UTF8_IS_INVARIANT(result)) { \
3460 *ustrp = (U8) result; \
3464 *ustrp = UTF8_EIGHT_BIT_HI((U8) result); \
3465 *(ustrp + 1) = UTF8_EIGHT_BIT_LO((U8) result); \
3472 =for apidoc to_utf8_upper
3474 Instead use L</toUPPER_utf8_safe>.
3478 /* Not currently externally documented, and subject to change:
3479 * <flags> is set iff iff the rules from the current underlying locale are to
3483 Perl__to_utf8_upper_flags(pTHX_ const U8 *p,
3488 const char * const file,
3492 const U32 utf8n_flags = check_and_deprecate(p, &e, DEPRECATE_TO_UPPER,
3493 cBOOL(flags), file, line);
3495 PERL_ARGS_ASSERT__TO_UTF8_UPPER_FLAGS;
3497 /* ~0 makes anything non-zero in 'flags' mean we are using locale rules */
3498 /* 2nd char of uc(U+DF) is 'S' */
3499 CASE_CHANGE_BODY_START(~0, toUPPER_LC, _to_upper_title_latin1, 'S');
3500 CASE_CHANGE_BODY_END (~0, CALL_UPPER_CASE);
3504 =for apidoc to_utf8_title
3506 Instead use L</toTITLE_utf8_safe>.
3510 /* Not currently externally documented, and subject to change:
3511 * <flags> is set iff the rules from the current underlying locale are to be
3512 * used. Since titlecase is not defined in POSIX, for other than a
3513 * UTF-8 locale, uppercase is used instead for code points < 256.
3517 Perl__to_utf8_title_flags(pTHX_ const U8 *p,
3522 const char * const file,
3526 const U32 utf8n_flags = check_and_deprecate(p, &e, DEPRECATE_TO_TITLE,
3527 cBOOL(flags), file, line);
3529 PERL_ARGS_ASSERT__TO_UTF8_TITLE_FLAGS;
3531 /* 2nd char of ucfirst(U+DF) is 's' */
3532 CASE_CHANGE_BODY_START(~0, toUPPER_LC, _to_upper_title_latin1, 's');
3533 CASE_CHANGE_BODY_END (~0, CALL_TITLE_CASE);
3537 =for apidoc to_utf8_lower
3539 Instead use L</toLOWER_utf8_safe>.
3543 /* Not currently externally documented, and subject to change:
3544 * <flags> is set iff iff the rules from the current underlying locale are to
3549 Perl__to_utf8_lower_flags(pTHX_ const U8 *p,
3554 const char * const file,
3558 const U32 utf8n_flags = check_and_deprecate(p, &e, DEPRECATE_TO_LOWER,
3559 cBOOL(flags), file, line);
3561 PERL_ARGS_ASSERT__TO_UTF8_LOWER_FLAGS;
3563 CASE_CHANGE_BODY_START(~0, toLOWER_LC, to_lower_latin1, 0 /* 0 is dummy */)
3564 CASE_CHANGE_BODY_END (~0, CALL_LOWER_CASE)
3568 =for apidoc to_utf8_fold
3570 Instead use L</toFOLD_utf8_safe>.
3574 /* Not currently externally documented, and subject to change,
3576 * bit FOLD_FLAGS_LOCALE is set iff the rules from the current underlying
3577 * locale are to be used.
3578 * bit FOLD_FLAGS_FULL is set iff full case folds are to be used;
3579 * otherwise simple folds
3580 * bit FOLD_FLAGS_NOMIX_ASCII is set iff folds of non-ASCII to ASCII are
3585 Perl__to_utf8_fold_flags(pTHX_ const U8 *p,
3590 const char * const file,
3594 const U32 utf8n_flags = check_and_deprecate(p, &e, DEPRECATE_TO_FOLD,
3595 cBOOL(flags), file, line);
3597 PERL_ARGS_ASSERT__TO_UTF8_FOLD_FLAGS;
3599 /* These are mutually exclusive */
3600 assert (! ((flags & FOLD_FLAGS_LOCALE) && (flags & FOLD_FLAGS_NOMIX_ASCII)));
3602 assert(p != ustrp); /* Otherwise overwrites */
3604 CASE_CHANGE_BODY_START(FOLD_FLAGS_LOCALE, toFOLD_LC, _to_fold_latin1,
3605 ((flags) & (FOLD_FLAGS_FULL | FOLD_FLAGS_NOMIX_ASCII)));
3607 result = CALL_FOLD_CASE(result, p, ustrp, lenp, flags & FOLD_FLAGS_FULL);
3609 if (flags & FOLD_FLAGS_LOCALE) {
3611 # define LONG_S_T LATIN_SMALL_LIGATURE_LONG_S_T_UTF8
3612 # ifdef LATIN_CAPITAL_LETTER_SHARP_S_UTF8
3613 # define CAP_SHARP_S LATIN_CAPITAL_LETTER_SHARP_S_UTF8
3615 /* Special case these two characters, as what normally gets
3616 * returned under locale doesn't work */
3617 if (memEQs((char *) p, UTF8SKIP(p), CAP_SHARP_S))
3619 /* diag_listed_as: Can't do %s("%s") on non-UTF-8 locale; resolved to "%s". */
3620 Perl_ck_warner(aTHX_ packWARN(WARN_LOCALE),
3621 "Can't do fc(\"\\x{1E9E}\") on non-UTF-8 locale; "
3622 "resolved to \"\\x{17F}\\x{17F}\".");
3627 if (memEQs((char *) p, UTF8SKIP(p), LONG_S_T))
3629 /* diag_listed_as: Can't do %s("%s") on non-UTF-8 locale; resolved to "%s". */
3630 Perl_ck_warner(aTHX_ packWARN(WARN_LOCALE),
3631 "Can't do fc(\"\\x{FB05}\") on non-UTF-8 locale; "
3632 "resolved to \"\\x{FB06}\".");
3633 goto return_ligature_st;
3636 #if UNICODE_MAJOR_VERSION == 3 \
3637 && UNICODE_DOT_VERSION == 0 \
3638 && UNICODE_DOT_DOT_VERSION == 1
3639 # define DOTTED_I LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE_UTF8
3641 /* And special case this on this Unicode version only, for the same
3642 * reaons the other two are special cased. They would cross the
3643 * 255/256 boundary which is forbidden under /l, and so the code
3644 * wouldn't catch that they are equivalent (which they are only in
3646 else if (memEQs((char *) p, UTF8SKIP(p), DOTTED_I)) {
3647 /* diag_listed_as: Can't do %s("%s") on non-UTF-8 locale; resolved to "%s". */
3648 Perl_ck_warner(aTHX_ packWARN(WARN_LOCALE),
3649 "Can't do fc(\"\\x{0130}\") on non-UTF-8 locale; "
3650 "resolved to \"\\x{0131}\".");
3651 goto return_dotless_i;
3655 return check_locale_boundary_crossing(p, result, ustrp, lenp);
3657 else if (! (flags & FOLD_FLAGS_NOMIX_ASCII)) {
3661 /* This is called when changing the case of a UTF-8-encoded
3662 * character above the ASCII range, and the result should not
3663 * contain an ASCII character. */
3665 UV original; /* To store the first code point of <p> */
3667 /* Look at every character in the result; if any cross the
3668 * boundary, the whole thing is disallowed */
3670 U8* e = ustrp + *lenp;
3673 /* Crossed, have to return the original */
3674 original = valid_utf8_to_uvchr(p, lenp);
3676 /* But in these instances, there is an alternative we can
3677 * return that is valid */
3678 if (original == LATIN_SMALL_LETTER_SHARP_S
3679 #ifdef LATIN_CAPITAL_LETTER_SHARP_S /* not defined in early Unicode releases */
3680 || original == LATIN_CAPITAL_LETTER_SHARP_S
3685 else if (original == LATIN_SMALL_LIGATURE_LONG_S_T) {
3686 goto return_ligature_st;
3688 #if UNICODE_MAJOR_VERSION == 3 \
3689 && UNICODE_DOT_VERSION == 0 \
3690 && UNICODE_DOT_DOT_VERSION == 1
3692 else if (original == LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE) {
3693 goto return_dotless_i;
3696 Copy(p, ustrp, *lenp, char);
3702 /* Here, no characters crossed, result is ok as-is */
3707 /* Here, used locale rules. Convert back to UTF-8 */
3708 if (UTF8_IS_INVARIANT(result)) {
3709 *ustrp = (U8) result;
3713 *ustrp = UTF8_EIGHT_BIT_HI((U8) result);
3714 *(ustrp + 1) = UTF8_EIGHT_BIT_LO((U8) result);
3721 /* Certain folds to 'ss' are prohibited by the options, but they do allow
3722 * folds to a string of two of these characters. By returning this
3723 * instead, then, e.g.,
3724 * fc("\x{1E9E}") eq fc("\x{17F}\x{17F}")
3727 *lenp = 2 * sizeof(LATIN_SMALL_LETTER_LONG_S_UTF8) - 2;
3728 Copy(LATIN_SMALL_LETTER_LONG_S_UTF8 LATIN_SMALL_LETTER_LONG_S_UTF8,
3730 return LATIN_SMALL_LETTER_LONG_S;
3733 /* Two folds to 'st' are prohibited by the options; instead we pick one and
3734 * have the other one fold to it */
3736 *lenp = sizeof(LATIN_SMALL_LIGATURE_ST_UTF8) - 1;
3737 Copy(LATIN_SMALL_LIGATURE_ST_UTF8, ustrp, *lenp, U8);
3738 return LATIN_SMALL_LIGATURE_ST;
3740 #if UNICODE_MAJOR_VERSION == 3 \
3741 && UNICODE_DOT_VERSION == 0 \
3742 && UNICODE_DOT_DOT_VERSION == 1
3745 *lenp = sizeof(LATIN_SMALL_LETTER_DOTLESS_I_UTF8) - 1;
3746 Copy(LATIN_SMALL_LETTER_DOTLESS_I_UTF8, ustrp, *lenp, U8);
3747 return LATIN_SMALL_LETTER_DOTLESS_I;
3754 * Returns a "swash" which is a hash described in utf8.c:Perl_swash_fetch().
3755 * C<pkg> is a pointer to a package name for SWASHNEW, should be "utf8".
3756 * For other parameters, see utf8::SWASHNEW in lib/utf8_heavy.pl.
3760 Perl_swash_init(pTHX_ const char* pkg, const char* name, SV *listsv,
3761 I32 minbits, I32 none)
3763 PERL_ARGS_ASSERT_SWASH_INIT;
3765 /* Returns a copy of a swash initiated by the called function. This is the
3766 * public interface, and returning a copy prevents others from doing
3767 * mischief on the original */
3769 return newSVsv(_core_swash_init(pkg, name, listsv, minbits, none,
3774 Perl__core_swash_init(pTHX_ const char* pkg, const char* name, SV *listsv,
3775 I32 minbits, I32 none, SV* invlist,
3779 /*NOTE NOTE NOTE - If you want to use "return" in this routine you MUST
3780 * use the following define */
3782 #define CORE_SWASH_INIT_RETURN(x) \
3783 PL_curpm= old_PL_curpm; \
3786 /* Initialize and return a swash, creating it if necessary. It does this
3787 * by calling utf8_heavy.pl in the general case. The returned value may be
3788 * the swash's inversion list instead if the input parameters allow it.
3789 * Which is returned should be immaterial to callers, as the only
3790 * operations permitted on a swash, swash_fetch(), _get_swash_invlist(),
3791 * and swash_to_invlist() handle both these transparently.
3793 * This interface should only be used by functions that won't destroy or
3794 * adversely change the swash, as doing so affects all other uses of the
3795 * swash in the program; the general public should use 'Perl_swash_init'
3798 * pkg is the name of the package that <name> should be in.
3799 * name is the name of the swash to find. Typically it is a Unicode
3800 * property name, including user-defined ones
3801 * listsv is a string to initialize the swash with. It must be of the form
3802 * documented as the subroutine return value in
3803 * L<perlunicode/User-Defined Character Properties>
3804 * minbits is the number of bits required to represent each data element.
3805 * It is '1' for binary properties.
3806 * none I (khw) do not understand this one, but it is used only in tr///.
3807 * invlist is an inversion list to initialize the swash with (or NULL)
3808 * flags_p if non-NULL is the address of various input and output flag bits
3809 * to the routine, as follows: ('I' means is input to the routine;
3810 * 'O' means output from the routine. Only flags marked O are
3811 * meaningful on return.)
3812 * _CORE_SWASH_INIT_USER_DEFINED_PROPERTY indicates if the swash
3813 * came from a user-defined property. (I O)
3814 * _CORE_SWASH_INIT_RETURN_IF_UNDEF indicates that instead of croaking
3815 * when the swash cannot be located, to simply return NULL. (I)
3816 * _CORE_SWASH_INIT_ACCEPT_INVLIST indicates that the caller will accept a
3817 * return of an inversion list instead of a swash hash if this routine
3818 * thinks that would result in faster execution of swash_fetch() later
3821 * Thus there are three possible inputs to find the swash: <name>,
3822 * <listsv>, and <invlist>. At least one must be specified. The result
3823 * will be the union of the specified ones, although <listsv>'s various
3824 * actions can intersect, etc. what <name> gives. To avoid going out to
3825 * disk at all, <invlist> should specify completely what the swash should
3826 * have, and <listsv> should be &PL_sv_undef and <name> should be "".
3828 * <invlist> is only valid for binary properties */
3830 PMOP *old_PL_curpm= PL_curpm; /* save away the old PL_curpm */
3832 SV* retval = &PL_sv_undef;
3833 HV* swash_hv = NULL;
3834 const int invlist_swash_boundary =
3835 (flags_p && *flags_p & _CORE_SWASH_INIT_ACCEPT_INVLIST)
3836 ? 512 /* Based on some benchmarking, but not extensive, see commit
3838 : -1; /* Never return just an inversion list */
3840 assert(listsv != &PL_sv_undef || strNE(name, "") || invlist);
3841 assert(! invlist || minbits == 1);
3843 PL_curpm= NULL; /* reset PL_curpm so that we dont get confused between the
3844 regex that triggered the swash init and the swash init
3845 perl logic itself. See perl #122747 */
3847 /* If data was passed in to go out to utf8_heavy to find the swash of, do
3849 if (listsv != &PL_sv_undef || strNE(name, "")) {
3851 const size_t pkg_len = strlen(pkg);
3852 const size_t name_len = strlen(name);
3853 HV * const stash = gv_stashpvn(pkg, pkg_len, 0);
3857 PERL_ARGS_ASSERT__CORE_SWASH_INIT;
3859 PUSHSTACKi(PERLSI_MAGIC);
3863 /* We might get here via a subroutine signature which uses a utf8
3864 * parameter name, at which point PL_subname will have been set
3865 * but not yet used. */
3866 save_item(PL_subname);
3867 if (PL_parser && PL_parser->error_count)
3868 SAVEI8(PL_parser->error_count), PL_parser->error_count = 0;
3869 method = gv_fetchmeth(stash, "SWASHNEW", 8, -1);
3870 if (!method) { /* demand load UTF-8 */
3872 if ((errsv_save = GvSV(PL_errgv))) SAVEFREESV(errsv_save);
3873 GvSV(PL_errgv) = NULL;
3874 #ifndef NO_TAINT_SUPPORT
3875 /* It is assumed that callers of this routine are not passing in
3876 * any user derived data. */
3877 /* Need to do this after save_re_context() as it will set
3878 * PL_tainted to 1 while saving $1 etc (see the code after getrx:
3879 * in Perl_magic_get). Even line to create errsv_save can turn on
3881 SAVEBOOL(TAINT_get);
3884 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT, newSVpvn(pkg,pkg_len),
3887 /* Not ERRSV, as there is no need to vivify a scalar we are
3888 about to discard. */
3889 SV * const errsv = GvSV(PL_errgv);
3890 if (!SvTRUE(errsv)) {
3891 GvSV(PL_errgv) = SvREFCNT_inc_simple(errsv_save);
3892 SvREFCNT_dec(errsv);
3900 mPUSHp(pkg, pkg_len);
3901 mPUSHp(name, name_len);
3906 if ((errsv_save = GvSV(PL_errgv))) SAVEFREESV(errsv_save);
3907 GvSV(PL_errgv) = NULL;
3908 /* If we already have a pointer to the method, no need to use
3909 * call_method() to repeat the lookup. */
3911 ? call_sv(MUTABLE_SV(method), G_SCALAR)
3912 : call_sv(newSVpvs_flags("SWASHNEW", SVs_TEMP), G_SCALAR | G_METHOD))
3914 retval = *PL_stack_sp--;
3915 SvREFCNT_inc(retval);
3918 /* Not ERRSV. See above. */
3919 SV * const errsv = GvSV(PL_errgv);
3920 if (!SvTRUE(errsv)) {
3921 GvSV(PL_errgv) = SvREFCNT_inc_simple(errsv_save);
3922 SvREFCNT_dec(errsv);
3927 if (IN_PERL_COMPILETIME) {
3928 CopHINTS_set(PL_curcop, PL_hints);
3930 if (!SvROK(retval) || SvTYPE(SvRV(retval)) != SVt_PVHV) {
3931 if (SvPOK(retval)) {
3933 /* If caller wants to handle missing properties, let them */
3934 if (flags_p && *flags_p & _CORE_SWASH_INIT_RETURN_IF_UNDEF) {
3935 CORE_SWASH_INIT_RETURN(NULL);
3938 "Can't find Unicode property definition \"%" SVf "\"",
3940 NOT_REACHED; /* NOTREACHED */
3943 } /* End of calling the module to find the swash */
3945 /* If this operation fetched a swash, and we will need it later, get it */
3946 if (retval != &PL_sv_undef
3947 && (minbits == 1 || (flags_p
3949 & _CORE_SWASH_INIT_USER_DEFINED_PROPERTY))))
3951 swash_hv = MUTABLE_HV(SvRV(retval));
3953 /* If we don't already know that there is a user-defined component to
3954 * this swash, and the user has indicated they wish to know if there is
3955 * one (by passing <flags_p>), find out */
3956 if (flags_p && ! (*flags_p & _CORE_SWASH_INIT_USER_DEFINED_PROPERTY)) {
3957 SV** user_defined = hv_fetchs(swash_hv, "USER_DEFINED", FALSE);
3958 if (user_defined && SvUV(*user_defined)) {
3959 *flags_p |= _CORE_SWASH_INIT_USER_DEFINED_PROPERTY;
3964 /* Make sure there is an inversion list for binary properties */
3966 SV** swash_invlistsvp = NULL;
3967 SV* swash_invlist = NULL;
3968 bool invlist_in_swash_is_valid = FALSE;
3969 bool swash_invlist_unclaimed = FALSE; /* whether swash_invlist has
3970 an unclaimed reference count */
3972 /* If this operation fetched a swash, get its already existing
3973 * inversion list, or create one for it */
3976 swash_invlistsvp = hv_fetchs(swash_hv, "V", FALSE);
3977 if (swash_invlistsvp) {
3978 swash_invlist = *swash_invlistsvp;
3979 invlist_in_swash_is_valid = TRUE;
3982 swash_invlist = _swash_to_invlist(retval);
3983 swash_invlist_unclaimed = TRUE;
3987 /* If an inversion list was passed in, have to include it */
3990 /* Any fetched swash will by now have an inversion list in it;
3991 * otherwise <swash_invlist> will be NULL, indicating that we
3992 * didn't fetch a swash */
3993 if (swash_invlist) {
3995 /* Add the passed-in inversion list, which invalidates the one
3996 * already stored in the swash */
3997 invlist_in_swash_is_valid = FALSE;
3998 SvREADONLY_off(swash_invlist); /* Turned on again below */
3999 _invlist_union(invlist, swash_invlist, &swash_invlist);
4003 /* Here, there is no swash already. Set up a minimal one, if
4004 * we are going to return a swash */
4005 if ((int) _invlist_len(invlist) > invlist_swash_boundary) {
4007 retval = newRV_noinc(MUTABLE_SV(swash_hv));
4009 swash_invlist = invlist;
4013 /* Here, we have computed the union of all the passed-in data. It may
4014 * be that there was an inversion list in the swash which didn't get
4015 * touched; otherwise save the computed one */
4016 if (! invlist_in_swash_is_valid
4017 && (int) _invlist_len(swash_invlist) > invlist_swash_boundary)
4019 if (! hv_stores(MUTABLE_HV(SvRV(retval)), "V", swash_invlist))
4021 Perl_croak(aTHX_ "panic: hv_store() unexpectedly failed");
4023 /* We just stole a reference count. */
4024 if (swash_invlist_unclaimed) swash_invlist_unclaimed = FALSE;
4025 else SvREFCNT_inc_simple_void_NN(swash_invlist);
4028 /* The result is immutable. Forbid attempts to change it. */
4029 SvREADONLY_on(swash_invlist);
4031 /* Use the inversion list stand-alone if small enough */
4032 if ((int) _invlist_len(swash_invlist) <= invlist_swash_boundary) {
4033 SvREFCNT_dec(retval);
4034 if (!swash_invlist_unclaimed)
4035 SvREFCNT_inc_simple_void_NN(swash_invlist);
4036 retval = newRV_noinc(swash_invlist);
4040 CORE_SWASH_INIT_RETURN(retval);
4041 #undef CORE_SWASH_INIT_RETURN
4045 /* This API is wrong for special case conversions since we may need to
4046 * return several Unicode characters for a single Unicode character
4047 * (see lib/unicore/SpecCase.txt) The SWASHGET in lib/utf8_heavy.pl is
4048 * the lower-level routine, and it is similarly broken for returning
4049 * multiple values. --jhi
4050 * For those, you should use S__to_utf8_case() instead */
4051 /* Now SWASHGET is recasted into S_swatch_get in this file. */
4054 * Returns the value of property/mapping C<swash> for the first character
4055 * of the string C<ptr>. If C<do_utf8> is true, the string C<ptr> is
4056 * assumed to be in well-formed UTF-8. If C<do_utf8> is false, the string C<ptr>
4057 * is assumed to be in native 8-bit encoding. Caches the swatch in C<swash>.
4059 * A "swash" is a hash which contains initially the keys/values set up by
4060 * SWASHNEW. The purpose is to be able to completely represent a Unicode
4061 * property for all possible code points. Things are stored in a compact form
4062 * (see utf8_heavy.pl) so that calculation is required to find the actual
4063 * property value for a given code point. As code points are looked up, new
4064 * key/value pairs are added to the hash, so that the calculation doesn't have
4065 * to ever be re-done. Further, each calculation is done, not just for the
4066 * desired one, but for a whole block of code points adjacent to that one.
4067 * For binary properties on ASCII machines, the block is usually for 64 code
4068 * points, starting with a code point evenly divisible by 64. Thus if the
4069 * property value for code point 257 is requested, the code goes out and
4070 * calculates the property values for all 64 code points between 256 and 319,
4071 * and stores these as a single 64-bit long bit vector, called a "swatch",
4072 * under the key for code point 256. The key is the UTF-8 encoding for code
4073 * point 256, minus the final byte. Thus, if the length of the UTF-8 encoding
4074 * for a code point is 13 bytes, the key will be 12 bytes long. If the value
4075 * for code point 258 is then requested, this code realizes that it would be
4076 * stored under the key for 256, and would find that value and extract the
4077 * relevant bit, offset from 256.
4079 * Non-binary properties are stored in as many bits as necessary to represent
4080 * their values (32 currently, though the code is more general than that), not
4081 * as single bits, but the principle is the same: the value for each key is a
4082 * vector that encompasses the property values for all code points whose UTF-8
4083 * representations are represented by the key. That is, for all code points
4084 * whose UTF-8 representations are length N bytes, and the key is the first N-1
4088 Perl_swash_fetch(pTHX_ SV *swash, const U8 *ptr, bool do_utf8)
4090 HV *const hv = MUTABLE_HV(SvRV(swash));
4095 const U8 *tmps = NULL;
4099 PERL_ARGS_ASSERT_SWASH_FETCH;
4101 /* If it really isn't a hash, it isn't really swash; must be an inversion
4103 if (SvTYPE(hv) != SVt_PVHV) {
4104 return _invlist_contains_cp((SV*)hv,
4106 ? valid_utf8_to_uvchr(ptr, NULL)
4110 /* We store the values in a "swatch" which is a vec() value in a swash
4111 * hash. Code points 0-255 are a single vec() stored with key length
4112 * (klen) 0. All other code points have a UTF-8 representation
4113 * 0xAA..0xYY,0xZZ. A vec() is constructed containing all of them which
4114 * share 0xAA..0xYY, which is the key in the hash to that vec. So the key
4115 * length for them is the length of the encoded char - 1. ptr[klen] is the
4116 * final byte in the sequence representing the character */
4117 if (!do_utf8 || UTF8_IS_INVARIANT(c)) {
4122 else if (UTF8_IS_DOWNGRADEABLE_START(c)) {
4125 off = EIGHT_BIT_UTF8_TO_NATIVE(c, *(ptr + 1));
4128 klen = UTF8SKIP(ptr) - 1;
4130 /* Each vec() stores 2**UTF_ACCUMULATION_SHIFT values. The offset into
4131 * the vec is the final byte in the sequence. (In EBCDIC this is
4132 * converted to I8 to get consecutive values.) To help you visualize
4134 * Straight 1047 After final byte
4135 * UTF-8 UTF-EBCDIC I8 transform
4136 * U+0400: \xD0\x80 \xB8\x41\x41 \xB8\x41\xA0
4137 * U+0401: \xD0\x81 \xB8\x41\x42 \xB8\x41\xA1
4139 * U+0409: \xD0\x89 \xB8\x41\x4A \xB8\x41\xA9
4140 * U+040A: \xD0\x8A \xB8\x41\x51 \xB8\x41\xAA
4142 * U+0412: \xD0\x92 \xB8\x41\x59 \xB8\x41\xB2
4143 * U+0413: \xD0\x93 \xB8\x41\x62 \xB8\x41\xB3
4145 * U+041B: \xD0\x9B \xB8\x41\x6A \xB8\x41\xBB
4146 * U+041C: \xD0\x9C \xB8\x41\x70 \xB8\x41\xBC
4148 * U+041F: \xD0\x9F \xB8\x41\x73 \xB8\x41\xBF
4149 * U+0420: \xD0\xA0 \xB8\x42\x41 \xB8\x42\x41
4151 * (There are no discontinuities in the elided (...) entries.)
4152 * The UTF-8 key for these 33 code points is '\xD0' (which also is the
4153 * key for the next 31, up through U+043F, whose UTF-8 final byte is
4154 * \xBF). Thus in UTF-8, each key is for a vec() for 64 code points.
4155 * The final UTF-8 byte, which ranges between \x80 and \xBF, is an
4156 * index into the vec() swatch (after subtracting 0x80, which we
4157 * actually do with an '&').
4158 * In UTF-EBCDIC, each key is for a 32 code point vec(). The first 32
4159 * code points above have key '\xB8\x41'. The final UTF-EBCDIC byte has
4160 * dicontinuities which go away by transforming it into I8, and we
4161 * effectively subtract 0xA0 to get the index. */
4162 needents = (1 << UTF_ACCUMULATION_SHIFT);
4163 off = NATIVE_UTF8_TO_I8(ptr[klen]) & UTF_CONTINUATION_MASK;
4167 * This single-entry cache saves about 1/3 of the UTF-8 overhead in test
4168 * suite. (That is, only 7-8% overall over just a hash cache. Still,
4169 * it's nothing to sniff at.) Pity we usually come through at least
4170 * two function calls to get here...
4172 * NB: this code assumes that swatches are never modified, once generated!
4175 if (hv == PL_last_swash_hv &&
4176 klen == PL_last_swash_klen &&
4177 (!klen || memEQ((char *)ptr, (char *)PL_last_swash_key, klen)) )
4179 tmps = PL_last_swash_tmps;
4180 slen = PL_last_swash_slen;
4183 /* Try our second-level swatch cache, kept in a hash. */
4184 SV** svp = hv_fetch(hv, (const char*)ptr, klen, FALSE);
4186 /* If not cached, generate it via swatch_get */
4187 if (!svp || !SvPOK(*svp)
4188 || !(tmps = (const U8*)SvPV_const(*svp, slen)))
4191 const UV code_point = valid_utf8_to_uvchr(ptr, NULL);
4192 swatch = swatch_get(swash,
4193 code_point & ~((UV)needents - 1),
4196 else { /* For the first 256 code points, the swatch has a key of
4198 swatch = swatch_get(swash, 0, needents);
4201 if (IN_PERL_COMPILETIME)
4202 CopHINTS_set(PL_curcop, PL_hints);
4204 svp = hv_store(hv, (const char *)ptr, klen, swatch, 0);
4206 if (!svp || !(tmps = (U8*)SvPV(*svp, slen))
4207 || (slen << 3) < needents)
4208 Perl_croak(aTHX_ "panic: swash_fetch got improper swatch, "
4209 "svp=%p, tmps=%p, slen=%" UVuf ", needents=%" UVuf,
4210 svp, tmps, (UV)slen, (UV)needents);
4213 PL_last_swash_hv = hv;
4214 assert(klen <= sizeof(PL_last_swash_key));
4215 PL_last_swash_klen = (U8)klen;
4216 /* FIXME change interpvar.h? */
4217 PL_last_swash_tmps = (U8 *) tmps;
4218 PL_last_swash_slen = slen;
4220 Copy(ptr, PL_last_swash_key, klen, U8);
4223 switch ((int)((slen << 3) / needents)) {
4225 return ((UV) tmps[off >> 3] & (1 << (off & 7))) != 0;
4227 return ((UV) tmps[off]);
4231 ((UV) tmps[off ] << 8) +
4232 ((UV) tmps[off + 1]);
4236 ((UV) tmps[off ] << 24) +
4237 ((UV) tmps[off + 1] << 16) +
4238 ((UV) tmps[off + 2] << 8) +
4239 ((UV) tmps[off + 3]);
4241 Perl_croak(aTHX_ "panic: swash_fetch got swatch of unexpected bit width, "
4242 "slen=%" UVuf ", needents=%" UVuf, (UV)slen, (UV)needents);
4243 NORETURN_FUNCTION_END;
4246 /* Read a single line of the main body of the swash input text. These are of
4249 * where each number is hex. The first two numbers form the minimum and
4250 * maximum of a range, and the third is the value associated with the range.
4251 * Not all swashes should have a third number
4253 * On input: l points to the beginning of the line to be examined; it points
4254 * to somewhere in the string of the whole input text, and is
4255 * terminated by a \n or the null string terminator.
4256 * lend points to the null terminator of that string
4257 * wants_value is non-zero if the swash expects a third number
4258 * typestr is the name of the swash's mapping, like 'ToLower'
4259 * On output: *min, *max, and *val are set to the values read from the line.
4260 * returns a pointer just beyond the line examined. If there was no
4261 * valid min number on the line, returns lend+1
4265 S_swash_scan_list_line(pTHX_ U8* l, U8* const lend, UV* min, UV* max, UV* val,
4266 const bool wants_value, const U8* const typestr)
4268 const int typeto = typestr[0] == 'T' && typestr[1] == 'o';
4269 STRLEN numlen; /* Length of the number */
4270 I32 flags = PERL_SCAN_SILENT_ILLDIGIT
4271 | PERL_SCAN_DISALLOW_PREFIX
4272 | PERL_SCAN_SILENT_NON_PORTABLE;
4274 /* nl points to the next \n in the scan */
4275 U8* const nl = (U8*)memchr(l, '\n', lend - l);
4277 PERL_ARGS_ASSERT_SWASH_SCAN_LIST_LINE;
4279 /* Get the first number on the line: the range minimum */
4281 *min = grok_hex((char *)l, &numlen, &flags, NULL);
4282 *max = *min; /* So can never return without setting max */
4283 if (numlen) /* If found a hex number, position past it */
4285 else if (nl) { /* Else, go handle next line, if any */
4286 return nl + 1; /* 1 is length of "\n" */
4288 else { /* Else, no next line */
4289 return lend + 1; /* to LIST's end at which \n is not found */
4292 /* The max range value follows, separated by a BLANK */
4295 flags = PERL_SCAN_SILENT_ILLDIGIT
4296 | PERL_SCAN_DISALLOW_PREFIX
4297 | PERL_SCAN_SILENT_NON_PORTABLE;
4299 *max = grok_hex((char *)l, &numlen, &flags, NULL);
4302 else /* If no value here, it is a single element range */
4305 /* Non-binary tables have a third entry: what the first element of the
4306 * range maps to. The map for those currently read here is in hex */
4310 flags = PERL_SCAN_SILENT_ILLDIGIT
4311 | PERL_SCAN_DISALLOW_PREFIX
4312 | PERL_SCAN_SILENT_NON_PORTABLE;
4314 *val = grok_hex((char *)l, &numlen, &flags, NULL);
4323 /* diag_listed_as: To%s: illegal mapping '%s' */
4324 Perl_croak(aTHX_ "%s: illegal mapping '%s'",
4330 *val = 0; /* bits == 1, then any val should be ignored */
4332 else { /* Nothing following range min, should be single element with no
4337 /* diag_listed_as: To%s: illegal mapping '%s' */
4338 Perl_croak(aTHX_ "%s: illegal mapping '%s'", typestr, l);
4342 *val = 0; /* bits == 1, then val should be ignored */
4345 /* Position to next line if any, or EOF */
4355 * Returns a swatch (a bit vector string) for a code point sequence
4356 * that starts from the value C<start> and comprises the number C<span>.
4357 * A C<swash> must be an object created by SWASHNEW (see lib/utf8_heavy.pl).
4358 * Should be used via swash_fetch, which will cache the swatch in C<swash>.
4361 S_swatch_get(pTHX_ SV* swash, UV start, UV span)
4364 U8 *l, *lend, *x, *xend, *s, *send;
4365 STRLEN lcur, xcur, scur;
4366 HV *const hv = MUTABLE_HV(SvRV(swash));
4367 SV** const invlistsvp = hv_fetchs(hv, "V", FALSE);
4369 SV** listsvp = NULL; /* The string containing the main body of the table */
4370 SV** extssvp = NULL;
4371 SV** invert_it_svp = NULL;
4374 STRLEN octets; /* if bits == 1, then octets == 0 */
4376 UV end = start + span;
4378 if (invlistsvp == NULL) {
4379 SV** const bitssvp = hv_fetchs(hv, "BITS", FALSE);
4380 SV** const nonesvp = hv_fetchs(hv, "NONE", FALSE);
4381 SV** const typesvp = hv_fetchs(hv, "TYPE", FALSE);
4382 extssvp = hv_fetchs(hv, "EXTRAS", FALSE);
4383 listsvp = hv_fetchs(hv, "LIST", FALSE);
4384 invert_it_svp = hv_fetchs(hv, "INVERT_IT", FALSE);
4386 bits = SvUV(*bitssvp);
4387 none = SvUV(*nonesvp);
4388 typestr = (U8*)SvPV_nolen(*typesvp);
4394 octets = bits >> 3; /* if bits == 1, then octets == 0 */
4396 PERL_ARGS_ASSERT_SWATCH_GET;
4398 if (bits != 1 && bits != 8 && bits != 16 && bits != 32) {
4399 Perl_croak(aTHX_ "panic: swatch_get doesn't expect bits %" UVuf,
4403 /* If overflowed, use the max possible */
4409 /* create and initialize $swatch */
4410 scur = octets ? (span * octets) : (span + 7) / 8;
4411 swatch = newSV(scur);
4413 s = (U8*)SvPVX(swatch);
4414 if (octets && none) {
4415 const U8* const e = s + scur;
4418 *s++ = (U8)(none & 0xff);
4419 else if (bits == 16) {
4420 *s++ = (U8)((none >> 8) & 0xff);
4421 *s++ = (U8)( none & 0xff);
4423 else if (bits == 32) {
4424 *s++ = (U8)((none >> 24) & 0xff);
4425 *s++ = (U8)((none >> 16) & 0xff);
4426 *s++ = (U8)((none >> 8) & 0xff);
4427 *s++ = (U8)( none & 0xff);
4433 (void)memzero((U8*)s, scur + 1);
4435 SvCUR_set(swatch, scur);
4436 s = (U8*)SvPVX(swatch);
4438 if (invlistsvp) { /* If has an inversion list set up use that */
4439 _invlist_populate_swatch(*invlistsvp, start, end, s);
4443 /* read $swash->{LIST} */
4444 l = (U8*)SvPV(*listsvp, lcur);
4447 UV min, max, val, upper;
4448 l = swash_scan_list_line(l, lend, &min, &max, &val,
4449 cBOOL(octets), typestr);
4454 /* If looking for something beyond this range, go try the next one */
4458 /* <end> is generally 1 beyond where we want to set things, but at the
4459 * platform's infinity, where we can't go any higher, we want to
4460 * include the code point at <end> */
4463 : (max != UV_MAX || end != UV_MAX)
4470 if (!none || val < none) {
4475 for (key = min; key <= upper; key++) {
4477 /* offset must be non-negative (start <= min <= key < end) */
4478 offset = octets * (key - start);
4480 s[offset] = (U8)(val & 0xff);
4481 else if (bits == 16) {
4482 s[offset ] = (U8)((val >> 8) & 0xff);
4483 s[offset + 1] = (U8)( val & 0xff);
4485 else if (bits == 32) {
4486 s[offset ] = (U8)((val >> 24) & 0xff);
4487 s[offset + 1] = (U8)((val >> 16) & 0xff);
4488 s[offset + 2] = (U8)((val >> 8) & 0xff);
4489 s[offset + 3] = (U8)( val & 0xff);
4492 if (!none || val < none)
4496 else { /* bits == 1, then val should be ignored */
4501 for (key = min; key <= upper; key++) {
4502 const STRLEN offset = (STRLEN)(key - start);
4503 s[offset >> 3] |= 1 << (offset & 7);
4508 /* Invert if the data says it should be. Assumes that bits == 1 */
4509 if (invert_it_svp && SvUV(*invert_it_svp)) {
4511 /* Unicode properties should come with all bits above PERL_UNICODE_MAX
4512 * be 0, and their inversion should also be 0, as we don't succeed any
4513 * Unicode property matches for non-Unicode code points */
4514 if (start <= PERL_UNICODE_MAX) {
4516 /* The code below assumes that we never cross the
4517 * Unicode/above-Unicode boundary in a range, as otherwise we would
4518 * have to figure out where to stop flipping the bits. Since this
4519 * boundary is divisible by a large power of 2, and swatches comes
4520 * in small powers of 2, this should be a valid assumption */
4521 assert(start + span - 1 <= PERL_UNICODE_MAX);
4531 /* read $swash->{EXTRAS}
4532 * This code also copied to swash_to_invlist() below */
4533 x = (U8*)SvPV(*extssvp, xcur);
4541 SV **otherbitssvp, *other;
4545 const U8 opc = *x++;
4549 nl = (U8*)memchr(x, '\n', xend - x);
4551 if (opc != '-' && opc != '+' && opc != '!' && opc != '&') {
4553 x = nl + 1; /* 1 is length of "\n" */
4557 x = xend; /* to EXTRAS' end at which \n is not found */
4564 namelen = nl - namestr;
4568 namelen = xend - namestr;
4572 othersvp = hv_fetch(hv, (char *)namestr, namelen, FALSE);
4573 otherhv = MUTABLE_HV(SvRV(*othersvp));
4574 otherbitssvp = hv_fetchs(otherhv, "BITS", FALSE);
4575 otherbits = (STRLEN)SvUV(*otherbitssvp);
4576 if (bits < otherbits)
4577 Perl_croak(aTHX_ "panic: swatch_get found swatch size mismatch, "
4578 "bits=%" UVuf ", otherbits=%" UVuf, (UV)bits, (UV)otherbits);
4580 /* The "other" swatch must be destroyed after. */
4581 other = swatch_get(*othersvp, start, span);
4582 o = (U8*)SvPV(other, olen);
4585 Perl_croak(aTHX_ "panic: swatch_get got improper swatch");
4587 s = (U8*)SvPV(swatch, slen);
4588 if (bits == 1 && otherbits == 1) {
4590 Perl_croak(aTHX_ "panic: swatch_get found swatch length "
4591 "mismatch, slen=%" UVuf ", olen=%" UVuf,
4592 (UV)slen, (UV)olen);
4616 STRLEN otheroctets = otherbits >> 3;
4618 U8* const send = s + slen;
4623 if (otherbits == 1) {
4624 otherval = (o[offset >> 3] >> (offset & 7)) & 1;
4628 STRLEN vlen = otheroctets;
4636 if (opc == '+' && otherval)
4637 NOOP; /* replace with otherval */
4638 else if (opc == '!' && !otherval)
4640 else if (opc == '-' && otherval)
4642 else if (opc == '&' && !otherval)
4645 s += octets; /* no replacement */
4650 *s++ = (U8)( otherval & 0xff);
4651 else if (bits == 16) {
4652 *s++ = (U8)((otherval >> 8) & 0xff);
4653 *s++ = (U8)( otherval & 0xff);
4655 else if (bits == 32) {
4656 *s++ = (U8)((otherval >> 24) & 0xff);
4657 *s++ = (U8)((otherval >> 16) & 0xff);
4658 *s++ = (U8)((otherval >> 8) & 0xff);
4659 *s++ = (U8)( otherval & 0xff);
4663 sv_free(other); /* through with it! */
4669 Perl__swash_inversion_hash(pTHX_ SV* const swash)
4672 /* Subject to change or removal. For use only in regcomp.c and regexec.c
4673 * Can't be used on a property that is subject to user override, as it
4674 * relies on the value of SPECIALS in the swash which would be set by
4675 * utf8_heavy.pl to the hash in the non-overriden file, and hence is not set
4676 * for overridden properties
4678 * Returns a hash which is the inversion and closure of a swash mapping.
4679 * For example, consider the input lines:
4684 * The returned hash would have two keys, the UTF-8 for 006B and the UTF-8 for
4685 * 006C. The value for each key is an array. For 006C, the array would
4686 * have two elements, the UTF-8 for itself, and for 004C. For 006B, there
4687 * would be three elements in its array, the UTF-8 for 006B, 004B and 212A.
4689 * Note that there are no elements in the hash for 004B, 004C, 212A. The
4690 * keys are only code points that are folded-to, so it isn't a full closure.
4692 * Essentially, for any code point, it gives all the code points that map to
4693 * it, or the list of 'froms' for that point.
4695 * Currently it ignores any additions or deletions from other swashes,
4696 * looking at just the main body of the swash, and if there are SPECIALS
4697 * in the swash, at that hash
4699 * The specials hash can be extra code points, and most likely consists of
4700 * maps from single code points to multiple ones (each expressed as a string
4701 * of UTF-8 characters). This function currently returns only 1-1 mappings.
4702 * However consider this possible input in the specials hash:
4703 * "\xEF\xAC\x85" => "\x{0073}\x{0074}", # U+FB05 => 0073 0074
4704 * "\xEF\xAC\x86" => "\x{0073}\x{0074}", # U+FB06 => 0073 0074
4706 * Both FB05 and FB06 map to the same multi-char sequence, which we don't
4707 * currently handle. But it also means that FB05 and FB06 are equivalent in
4708 * a 1-1 mapping which we should handle, and this relationship may not be in
4709 * the main table. Therefore this function examines all the multi-char
4710 * sequences and adds the 1-1 mappings that come out of that.
4712 * XXX This function was originally intended to be multipurpose, but its
4713 * only use is quite likely to remain for constructing the inversion of
4714 * the CaseFolding (//i) property. If it were more general purpose for
4715 * regex patterns, it would have to do the FB05/FB06 game for simple folds,
4716 * because certain folds are prohibited under /iaa and /il. As an example,
4717 * in Unicode 3.0.1 both U+0130 and U+0131 fold to 'i', and hence are both
4718 * equivalent under /i. But under /iaa and /il, the folds to 'i' are
4719 * prohibited, so we would not figure out that they fold to each other.
4720 * Code could be written to automatically figure this out, similar to the
4721 * code that does this for multi-character folds, but this is the only case
4722 * where something like this is ever likely to happen, as all the single
4723 * char folds to the 0-255 range are now quite settled. Instead there is a
4724 * little special code that is compiled only for this Unicode version. This
4725 * is smaller and didn't require much coding time to do. But this makes
4726 * this routine strongly tied to being used just for CaseFolding. If ever
4727 * it should be generalized, this would have to be fixed */
4731 HV *const hv = MUTABLE_HV(SvRV(swash));
4733 /* The string containing the main body of the table. This will have its
4734 * assertion fail if the swash has been converted to its inversion list */
4735 SV** const listsvp = hv_fetchs(hv, "LIST", FALSE);
4737 SV** const typesvp = hv_fetchs(hv, "TYPE", FALSE);
4738 SV** const bitssvp = hv_fetchs(hv, "BITS", FALSE);
4739 SV** const nonesvp = hv_fetchs(hv, "NONE", FALSE);
4740 /*SV** const extssvp = hv_fetchs(hv, "EXTRAS", FALSE);*/
4741 const U8* const typestr = (U8*)SvPV_nolen(*typesvp);
4742 const STRLEN bits = SvUV(*bitssvp);
4743 const STRLEN octets = bits >> 3; /* if bits == 1, then octets == 0 */
4744 const UV none = SvUV(*nonesvp);
4745 SV **specials_p = hv_fetchs(hv, "SPECIALS", 0);
4749 PERL_ARGS_ASSERT__SWASH_INVERSION_HASH;
4751 /* Must have at least 8 bits to get the mappings */
4752 if (bits != 8 && bits != 16 && bits != 32) {
4753 Perl_croak(aTHX_ "panic: swash_inversion_hash doesn't expect bits %"
4757 if (specials_p) { /* It might be "special" (sometimes, but not always, a
4758 mapping to more than one character */
4760 /* Construct an inverse mapping hash for the specials */
4761 HV * const specials_hv = MUTABLE_HV(SvRV(*specials_p));
4762 HV * specials_inverse = newHV();
4763 char *char_from; /* the lhs of the map */
4764 I32 from_len; /* its byte length */
4765 char *char_to; /* the rhs of the map */
4766 I32 to_len; /* its byte length */
4767 SV *sv_to; /* and in a sv */
4768 AV* from_list; /* list of things that map to each 'to' */
4770 hv_iterinit(specials_hv);
4772 /* The keys are the characters (in UTF-8) that map to the corresponding
4773 * UTF-8 string value. Iterate through the list creating the inverse
4775 while ((sv_to = hv_iternextsv(specials_hv, &char_from, &from_len))) {
4777 if (! SvPOK(sv_to)) {
4778 Perl_croak(aTHX_ "panic: value returned from hv_iternextsv() "
4779 "unexpectedly is not a string, flags=%lu",
4780 (unsigned long)SvFLAGS(sv_to));
4782 /*DEBUG_U(PerlIO_printf(Perl_debug_log, "Found mapping from %" UVXf ", First char of to is %" UVXf "\n", valid_utf8_to_uvchr((U8*) char_from, 0), valid_utf8_to_uvchr((U8*) SvPVX(sv_to), 0)));*/
4784 /* Each key in the inverse list is a mapped-to value, and the key's
4785 * hash value is a list of the strings (each in UTF-8) that map to
4786 * it. Those strings are all one character long */
4787 if ((listp = hv_fetch(specials_inverse,
4791 from_list = (AV*) *listp;
4793 else { /* No entry yet for it: create one */
4794 from_list = newAV();
4795 if (! hv_store(specials_inverse,
4798 (SV*) from_list, 0))
4800 Perl_croak(aTHX_ "panic: hv_store() unexpectedly failed");
4804 /* Here have the list associated with this 'to' (perhaps newly
4805 * created and empty). Just add to it. Note that we ASSUME that
4806 * the input is guaranteed to not have duplications, so we don't
4807 * check for that. Duplications just slow down execution time. */
4808 av_push(from_list, newSVpvn_utf8(char_from, from_len, TRUE));
4811 /* Here, 'specials_inverse' contains the inverse mapping. Go through
4812 * it looking for cases like the FB05/FB06 examples above. There would
4813 * be an entry in the hash like
4814 * 'st' => [ FB05, FB06 ]
4815 * In this example we will create two lists that get stored in the
4816 * returned hash, 'ret':
4817 * FB05 => [ FB05, FB06 ]
4818 * FB06 => [ FB05, FB06 ]
4820 * Note that there is nothing to do if the array only has one element.
4821 * (In the normal 1-1 case handled below, we don't have to worry about
4822 * two lists, as everything gets tied to the single list that is
4823 * generated for the single character 'to'. But here, we are omitting
4824 * that list, ('st' in the example), so must have multiple lists.) */
4825 while ((from_list = (AV *) hv_iternextsv(specials_inverse,
4826 &char_to, &to_len)))
4828 if (av_tindex_skip_len_mg(from_list) > 0) {
4831 /* We iterate over all combinations of i,j to place each code
4832 * point on each list */
4833 for (i = 0; i <= av_tindex_skip_len_mg(from_list); i++) {
4835 AV* i_list = newAV();
4836 SV** entryp = av_fetch(from_list, i, FALSE);
4837 if (entryp == NULL) {
4838 Perl_croak(aTHX_ "panic: av_fetch() unexpectedly"
4841 if (hv_fetch(ret, SvPVX(*entryp), SvCUR(*entryp), FALSE)) {
4842 Perl_croak(aTHX_ "panic: unexpected entry for %s",
4845 if (! hv_store(ret, SvPVX(*entryp), SvCUR(*entryp),
4846 (SV*) i_list, FALSE))
4848 Perl_croak(aTHX_ "panic: hv_store() unexpectedly failed");
4851 /* For DEBUG_U: UV u = valid_utf8_to_uvchr((U8*) SvPVX(*entryp), 0);*/
4852 for (j = 0; j <= av_tindex_skip_len_mg(from_list); j++) {
4853 entryp = av_fetch(from_list, j, FALSE);
4854 if (entryp == NULL) {
4855 Perl_croak(aTHX_ "panic: av_fetch() unexpectedly failed");
4858 /* When i==j this adds itself to the list */
4859 av_push(i_list, newSVuv(utf8_to_uvchr_buf(
4860 (U8*) SvPVX(*entryp),
4861 (U8*) SvPVX(*entryp) + SvCUR(*entryp),
4863 /*DEBUG_U(PerlIO_printf(Perl_debug_log, "%s: %d: Adding %" UVXf " to list for %" UVXf "\n", __FILE__, __LINE__, valid_utf8_to_uvchr((U8*) SvPVX(*entryp), 0), u));*/
4868 SvREFCNT_dec(specials_inverse); /* done with it */
4869 } /* End of specials */
4871 /* read $swash->{LIST} */
4873 #if UNICODE_MAJOR_VERSION == 3 \
4874 && UNICODE_DOT_VERSION == 0 \
4875 && UNICODE_DOT_DOT_VERSION == 1
4877 /* For this version only U+130 and U+131 are equivalent under qr//i. Add a
4878 * rule so that things work under /iaa and /il */
4880 SV * mod_listsv = sv_mortalcopy(*listsvp);
4881 sv_catpv(mod_listsv, "130\t130\t131\n");
4882 l = (U8*)SvPV(mod_listsv, lcur);
4886 l = (U8*)SvPV(*listsvp, lcur);
4892 /* Go through each input line */
4896 l = swash_scan_list_line(l, lend, &min, &max, &val,
4897 cBOOL(octets), typestr);
4902 /* Each element in the range is to be inverted */
4903 for (inverse = min; inverse <= max; inverse++) {
4907 bool found_key = FALSE;
4908 bool found_inverse = FALSE;
4910 /* The key is the inverse mapping */
4911 char key[UTF8_MAXBYTES+1];
4912 char* key_end = (char *) uvchr_to_utf8((U8*) key, val);
4913 STRLEN key_len = key_end - key;
4915 /* Get the list for the map */
4916 if ((listp = hv_fetch(ret, key, key_len, FALSE))) {
4917 list = (AV*) *listp;
4919 else { /* No entry yet for it: create one */
4921 if (! hv_store(ret, key, key_len, (SV*) list, FALSE)) {
4922 Perl_croak(aTHX_ "panic: hv_store() unexpectedly failed");
4926 /* Look through list to see if this inverse mapping already is
4927 * listed, or if there is a mapping to itself already */
4928 for (i = 0; i <= av_tindex_skip_len_mg(list); i++) {
4929 SV** entryp = av_fetch(list, i, FALSE);
4932 if (entryp == NULL) {
4933 Perl_croak(aTHX_ "panic: av_fetch() unexpectedly failed");
4937 /*DEBUG_U(PerlIO_printf(Perl_debug_log, "list for %" UVXf " contains %" UVXf "\n", val, uv));*/
4941 if (uv == inverse) {
4942 found_inverse = TRUE;
4945 /* No need to continue searching if found everything we are
4947 if (found_key && found_inverse) {
4952 /* Make sure there is a mapping to itself on the list */
4954 av_push(list, newSVuv(val));
4955 /*DEBUG_U(PerlIO_printf(Perl_debug_log, "%s: %d: Adding %" UVXf " to list for %" UVXf "\n", __FILE__, __LINE__, val, val));*/
4959 /* Simply add the value to the list */
4960 if (! found_inverse) {
4961 av_push(list, newSVuv(inverse));
4962 /*DEBUG_U(PerlIO_printf(Perl_debug_log, "%s: %d: Adding %" UVXf " to list for %" UVXf "\n", __FILE__, __LINE__, inverse, val));*/
4965 /* swatch_get() increments the value of val for each element in the
4966 * range. That makes more compact tables possible. You can
4967 * express the capitalization, for example, of all consecutive
4968 * letters with a single line: 0061\t007A\t0041 This maps 0061 to
4969 * 0041, 0062 to 0042, etc. I (khw) have never understood 'none',
4970 * and it's not documented; it appears to be used only in
4971 * implementing tr//; I copied the semantics from swatch_get(), just
4973 if (!none || val < none) {
4983 Perl__swash_to_invlist(pTHX_ SV* const swash)
4986 /* Subject to change or removal. For use only in one place in regcomp.c.
4987 * Ownership is given to one reference count in the returned SV* */
4992 HV *const hv = MUTABLE_HV(SvRV(swash));
4993 UV elements = 0; /* Number of elements in the inversion list */
5003 STRLEN octets; /* if bits == 1, then octets == 0 */
5009 PERL_ARGS_ASSERT__SWASH_TO_INVLIST;
5011 /* If not a hash, it must be the swash's inversion list instead */
5012 if (SvTYPE(hv) != SVt_PVHV) {
5013 return SvREFCNT_inc_simple_NN((SV*) hv);
5016 /* The string containing the main body of the table */
5017 listsvp = hv_fetchs(hv, "LIST", FALSE);
5018 typesvp = hv_fetchs(hv, "TYPE", FALSE);
5019 bitssvp = hv_fetchs(hv, "BITS", FALSE);
5020 extssvp = hv_fetchs(hv, "EXTRAS", FALSE);
5021 invert_it_svp = hv_fetchs(hv, "INVERT_IT", FALSE);
5023 typestr = (U8*)SvPV_nolen(*typesvp);
5024 bits = SvUV(*bitssvp);
5025 octets = bits >> 3; /* if bits == 1, then octets == 0 */
5027 /* read $swash->{LIST} */
5028 if (SvPOK(*listsvp)) {
5029 l = (U8*)SvPV(*listsvp, lcur);
5032 /* LIST legitimately doesn't contain a string during compilation phases
5033 * of Perl itself, before the Unicode tables are generated. In this
5034 * case, just fake things up by creating an empty list */
5041 if (*l == 'V') { /* Inversion list format */
5042 const char *after_atou = (char *) lend;
5044 UV* other_elements_ptr;
5046 /* The first number is a count of the rest */
5048 if (!grok_atoUV((const char *)l, &elements, &after_atou)) {
5049 Perl_croak(aTHX_ "panic: Expecting a valid count of elements"
5050 " at start of inversion list");
5052 if (elements == 0) {
5053 invlist = _new_invlist(0);
5056 l = (U8 *) after_atou;
5058 /* Get the 0th element, which is needed to setup the inversion list
5060 while (isSPACE(*l)) l++;
5061 if (!grok_atoUV((const char *)l, &element0, &after_atou)) {
5062 Perl_croak(aTHX_ "panic: Expecting a valid 0th element for"
5065 l = (U8 *) after_atou;
5066 invlist = _setup_canned_invlist(elements, element0,
5067 &other_elements_ptr);
5070 /* Then just populate the rest of the input */
5071 while (elements-- > 0) {
5073 Perl_croak(aTHX_ "panic: Expecting %" UVuf " more"
5074 " elements than available", elements);
5076 while (isSPACE(*l)) l++;
5077 if (!grok_atoUV((const char *)l, other_elements_ptr++,
5080 Perl_croak(aTHX_ "panic: Expecting a valid element"
5081 " in inversion list");
5083 l = (U8 *) after_atou;
5089 /* Scan the input to count the number of lines to preallocate array
5090 * size based on worst possible case, which is each line in the input
5091 * creates 2 elements in the inversion list: 1) the beginning of a
5092 * range in the list; 2) the beginning of a range not in the list. */
5093 while ((loc = (char *) memchr(loc, '\n', lend - (U8 *) loc)) != NULL) {
5098 /* If the ending is somehow corrupt and isn't a new line, add another
5099 * element for the final range that isn't in the inversion list */
5100 if (! (*lend == '\n'
5101 || (*lend == '\0' && (lcur == 0 || *(lend - 1) == '\n'))))
5106 invlist = _new_invlist(elements);
5108 /* Now go through the input again, adding each range to the list */
5111 UV val; /* Not used by this function */
5113 l = swash_scan_list_line(l, lend, &start, &end, &val,
5114 cBOOL(octets), typestr);
5120 invlist = _add_range_to_invlist(invlist, start, end);
5124 /* Invert if the data says it should be */
5125 if (invert_it_svp && SvUV(*invert_it_svp)) {
5126 _invlist_invert(invlist);
5129 /* This code is copied from swatch_get()
5130 * read $swash->{EXTRAS} */
5131 x = (U8*)SvPV(*extssvp, xcur);
5139 SV **otherbitssvp, *other;
5142 const U8 opc = *x++;
5146 nl = (U8*)memchr(x, '\n', xend - x);
5148 if (opc != '-' && opc != '+' && opc != '!' && opc != '&') {
5150 x = nl + 1; /* 1 is length of "\n" */
5154 x = xend; /* to EXTRAS' end at which \n is not found */
5161 namelen = nl - namestr;
5165 namelen = xend - namestr;
5169 othersvp = hv_fetch(hv, (char *)namestr, namelen, FALSE);
5170 otherhv = MUTABLE_HV(SvRV(*othersvp));
5171 otherbitssvp = hv_fetchs(otherhv, "BITS", FALSE);
5172 otherbits = (STRLEN)SvUV(*otherbitssvp);
5174 if (bits != otherbits || bits != 1) {
5175 Perl_croak(aTHX_ "panic: _swash_to_invlist only operates on boolean "
5176 "properties, bits=%" UVuf ", otherbits=%" UVuf,
5177 (UV)bits, (UV)otherbits);
5180 /* The "other" swatch must be destroyed after. */
5181 other = _swash_to_invlist((SV *)*othersvp);
5183 /* End of code copied from swatch_get() */
5186 _invlist_union(invlist, other, &invlist);
5189 _invlist_union_maybe_complement_2nd(invlist, other, TRUE, &invlist);
5192 _invlist_subtract(invlist, other, &invlist);
5195 _invlist_intersection(invlist, other, &invlist);
5200 sv_free(other); /* through with it! */
5203 SvREADONLY_on(invlist);
5208 Perl__get_swash_invlist(pTHX_ SV* const swash)
5212 PERL_ARGS_ASSERT__GET_SWASH_INVLIST;
5214 if (! SvROK(swash)) {
5218 /* If it really isn't a hash, it isn't really swash; must be an inversion
5220 if (SvTYPE(SvRV(swash)) != SVt_PVHV) {
5224 ptr = hv_fetchs(MUTABLE_HV(SvRV(swash)), "V", FALSE);
5233 Perl_check_utf8_print(pTHX_ const U8* s, const STRLEN len)
5235 /* May change: warns if surrogates, non-character code points, or
5236 * non-Unicode code points are in 's' which has length 'len' bytes.
5237 * Returns TRUE if none found; FALSE otherwise. The only other validity
5238 * check is to make sure that this won't exceed the string's length nor
5241 const U8* const e = s + len;
5244 PERL_ARGS_ASSERT_CHECK_UTF8_PRINT;
5247 if (UTF8SKIP(s) > len) {
5248 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8),
5249 "%s in %s", unees, PL_op ? OP_DESC(PL_op) : "print");
5252 if (UNLIKELY(isUTF8_POSSIBLY_PROBLEMATIC(*s))) {
5253 if (UNLIKELY(UTF8_IS_SUPER(s, e))) {
5254 if ( ckWARN_d(WARN_NON_UNICODE)
5255 || UNLIKELY(0 < does_utf8_overflow(s, s + len,
5256 0 /* Don't consider overlongs */
5259 /* A side effect of this function will be to warn */
5260 (void) utf8n_to_uvchr(s, e - s, NULL, UTF8_WARN_SUPER);
5264 else if (UNLIKELY(UTF8_IS_SURROGATE(s, e))) {
5265 if (ckWARN_d(WARN_SURROGATE)) {
5266 /* This has a different warning than the one the called
5267 * function would output, so can't just call it, unlike we
5268 * do for the non-chars and above-unicodes */
5269 UV uv = utf8_to_uvchr_buf(s, e, NULL);
5270 Perl_warner(aTHX_ packWARN(WARN_SURROGATE),
5271 "Unicode surrogate U+%04" UVXf " is illegal in UTF-8",
5276 else if ( UNLIKELY(UTF8_IS_NONCHAR(s, e))
5277 && (ckWARN_d(WARN_NONCHAR)))
5279 /* A side effect of this function will be to warn */
5280 (void) utf8n_to_uvchr(s, e - s, NULL, UTF8_WARN_NONCHAR);
5291 =for apidoc pv_uni_display
5293 Build to the scalar C<dsv> a displayable version of the string C<spv>,
5294 length C<len>, the displayable version being at most C<pvlim> bytes long
5295 (if longer, the rest is truncated and C<"..."> will be appended).
5297 The C<flags> argument can have C<UNI_DISPLAY_ISPRINT> set to display
5298 C<isPRINT()>able characters as themselves, C<UNI_DISPLAY_BACKSLASH>
5299 to display the C<\\[nrfta\\]> as the backslashed versions (like C<"\n">)
5300 (C<UNI_DISPLAY_BACKSLASH> is preferred over C<UNI_DISPLAY_ISPRINT> for C<"\\">).
5301 C<UNI_DISPLAY_QQ> (and its alias C<UNI_DISPLAY_REGEX>) have both
5302 C<UNI_DISPLAY_BACKSLASH> and C<UNI_DISPLAY_ISPRINT> turned on.
5304 The pointer to the PV of the C<dsv> is returned.
5306 See also L</sv_uni_display>.
5310 Perl_pv_uni_display(pTHX_ SV *dsv, const U8 *spv, STRLEN len, STRLEN pvlim,
5316 PERL_ARGS_ASSERT_PV_UNI_DISPLAY;
5320 for (s = (const char *)spv, e = s + len; s < e; s += UTF8SKIP(s)) {
5322 /* This serves double duty as a flag and a character to print after
5323 a \ when flags & UNI_DISPLAY_BACKSLASH is true.
5327 if (pvlim && SvCUR(dsv) >= pvlim) {
5331 u = utf8_to_uvchr_buf((U8*)s, (U8*)e, 0);
5333 const unsigned char c = (unsigned char)u & 0xFF;
5334 if (flags & UNI_DISPLAY_BACKSLASH) {
5351 const char string = ok;
5352 sv_catpvs(dsv, "\\");
5353 sv_catpvn(dsv, &string, 1);
5356 /* isPRINT() is the locale-blind version. */
5357 if (!ok && (flags & UNI_DISPLAY_ISPRINT) && isPRINT(c)) {
5358 const char string = c;
5359 sv_catpvn(dsv, &string, 1);
5364 Perl_sv_catpvf(aTHX_ dsv, "\\x{%" UVxf "}", u);
5367 sv_catpvs(dsv, "...");
5373 =for apidoc sv_uni_display
5375 Build to the scalar C<dsv> a displayable version of the scalar C<sv>,
5376 the displayable version being at most C<pvlim> bytes long
5377 (if longer, the rest is truncated and "..." will be appended).
5379 The C<flags> argument is as in L</pv_uni_display>().
5381 The pointer to the PV of the C<dsv> is returned.
5386 Perl_sv_uni_display(pTHX_ SV *dsv, SV *ssv, STRLEN pvlim, UV flags)
5388 const char * const ptr =
5389 isREGEXP(ssv) ? RX_WRAPPED((REGEXP*)ssv) : SvPVX_const(ssv);
5391 PERL_ARGS_ASSERT_SV_UNI_DISPLAY;
5393 return Perl_pv_uni_display(aTHX_ dsv, (const U8*)ptr,
5394 SvCUR(ssv), pvlim, flags);
5398 =for apidoc foldEQ_utf8
5400 Returns true if the leading portions of the strings C<s1> and C<s2> (either or
5401 both of which may be in UTF-8) are the same case-insensitively; false
5402 otherwise. How far into the strings to compare is determined by other input
5405 If C<u1> is true, the string C<s1> is assumed to be in UTF-8-encoded Unicode;
5406 otherwise it is assumed to be in native 8-bit encoding. Correspondingly for
5407 C<u2> with respect to C<s2>.
5409 If the byte length C<l1> is non-zero, it says how far into C<s1> to check for
5410 fold equality. In other words, C<s1>+C<l1> will be used as a goal to reach.
5411 The scan will not be considered to be a match unless the goal is reached, and
5412 scanning won't continue past that goal. Correspondingly for C<l2> with respect
5415 If C<pe1> is non-C<NULL> and the pointer it points to is not C<NULL>, that
5416 pointer is considered an end pointer to the position 1 byte past the maximum
5417 point in C<s1> beyond which scanning will not continue under any circumstances.
5418 (This routine assumes that UTF-8 encoded input strings are not malformed;
5419 malformed input can cause it to read past C<pe1>). This means that if both
5420 C<l1> and C<pe1> are specified, and C<pe1> is less than C<s1>+C<l1>, the match
5421 will never be successful because it can never
5422 get as far as its goal (and in fact is asserted against). Correspondingly for
5423 C<pe2> with respect to C<s2>.
5425 At least one of C<s1> and C<s2> must have a goal (at least one of C<l1> and
5426 C<l2> must be non-zero), and if both do, both have to be
5427 reached for a successful match. Also, if the fold of a character is multiple
5428 characters, all of them must be matched (see tr21 reference below for
5431 Upon a successful match, if C<pe1> is non-C<NULL>,
5432 it will be set to point to the beginning of the I<next> character of C<s1>
5433 beyond what was matched. Correspondingly for C<pe2> and C<s2>.
5435 For case-insensitiveness, the "casefolding" of Unicode is used
5436 instead of upper/lowercasing both the characters, see
5437 L<http://www.unicode.org/unicode/reports/tr21/> (Case Mappings).
5441 /* A flags parameter has been added which may change, and hence isn't
5442 * externally documented. Currently it is:
5443 * 0 for as-documented above
5444 * FOLDEQ_UTF8_NOMIX_ASCII meaning that if a non-ASCII character folds to an
5445 ASCII one, to not match
5446 * FOLDEQ_LOCALE is set iff the rules from the current underlying
5447 * locale are to be used.
5448 * FOLDEQ_S1_ALREADY_FOLDED s1 has already been folded before calling this
5449 * routine. This allows that step to be skipped.
5450 * Currently, this requires s1 to be encoded as UTF-8
5451 * (u1 must be true), which is asserted for.
5452 * FOLDEQ_S1_FOLDS_SANE With either NOMIX_ASCII or LOCALE, no folds may
5453 * cross certain boundaries. Hence, the caller should
5454 * let this function do the folding instead of
5455 * pre-folding. This code contains an assertion to
5456 * that effect. However, if the caller knows what
5457 * it's doing, it can pass this flag to indicate that,
5458 * and the assertion is skipped.
5459 * FOLDEQ_S2_ALREADY_FOLDED Similarly.
5460 * FOLDEQ_S2_FOLDS_SANE
5463 Perl_foldEQ_utf8_flags(pTHX_ const char *s1, char **pe1, UV l1, bool u1,
5464 const char *s2, char **pe2, UV l2, bool u2,
5467 const U8 *p1 = (const U8*)s1; /* Point to current char */
5468 const U8 *p2 = (const U8*)s2;
5469 const U8 *g1 = NULL; /* goal for s1 */
5470 const U8 *g2 = NULL;
5471 const U8 *e1 = NULL; /* Don't scan s1 past this */
5472 U8 *f1 = NULL; /* Point to current folded */
5473 const U8 *e2 = NULL;
5475 STRLEN n1 = 0, n2 = 0; /* Number of bytes in current char */
5476 U8 foldbuf1[UTF8_MAXBYTES_CASE+1];
5477 U8 foldbuf2[UTF8_MAXBYTES_CASE+1];
5478 U8 flags_for_folder = FOLD_FLAGS_FULL;
5480 PERL_ARGS_ASSERT_FOLDEQ_UTF8_FLAGS;
5482 assert( ! ((flags & (FOLDEQ_UTF8_NOMIX_ASCII | FOLDEQ_LOCALE))
5483 && (((flags & FOLDEQ_S1_ALREADY_FOLDED)
5484 && !(flags & FOLDEQ_S1_FOLDS_SANE))
5485 || ((flags & FOLDEQ_S2_ALREADY_FOLDED)
5486 && !(flags & FOLDEQ_S2_FOLDS_SANE)))));
5487 /* The algorithm is to trial the folds without regard to the flags on
5488 * the first line of the above assert(), and then see if the result
5489 * violates them. This means that the inputs can't be pre-folded to a
5490 * violating result, hence the assert. This could be changed, with the
5491 * addition of extra tests here for the already-folded case, which would
5492 * slow it down. That cost is more than any possible gain for when these
5493 * flags are specified, as the flags indicate /il or /iaa matching which
5494 * is less common than /iu, and I (khw) also believe that real-world /il
5495 * and /iaa matches are most likely to involve code points 0-255, and this
5496 * function only under rare conditions gets called for 0-255. */
5498 if (flags & FOLDEQ_LOCALE) {
5499 if (IN_UTF8_CTYPE_LOCALE) {
5500 flags &= ~FOLDEQ_LOCALE;
5503 flags_for_folder |= FOLD_FLAGS_LOCALE;
5512 g1 = (const U8*)s1 + l1;
5520 g2 = (const U8*)s2 + l2;
5523 /* Must have at least one goal */
5528 /* Will never match if goal is out-of-bounds */
5529 assert(! e1 || e1 >= g1);
5531 /* Here, there isn't an end pointer, or it is beyond the goal. We
5532 * only go as far as the goal */
5536 assert(e1); /* Must have an end for looking at s1 */
5539 /* Same for goal for s2 */
5541 assert(! e2 || e2 >= g2);
5548 /* If both operands are already folded, we could just do a memEQ on the
5549 * whole strings at once, but it would be better if the caller realized
5550 * this and didn't even call us */
5552 /* Look through both strings, a character at a time */
5553 while (p1 < e1 && p2 < e2) {
5555 /* If at the beginning of a new character in s1, get its fold to use
5556 * and the length of the fold. */
5558 if (flags & FOLDEQ_S1_ALREADY_FOLDED) {
5564 if (isASCII(*p1) && ! (flags & FOLDEQ_LOCALE)) {
5566 /* We have to forbid mixing ASCII with non-ASCII if the
5567 * flags so indicate. And, we can short circuit having to
5568 * call the general functions for this common ASCII case,
5569 * all of whose non-locale folds are also ASCII, and hence
5570 * UTF-8 invariants, so the UTF8ness of the strings is not
5572 if ((flags & FOLDEQ_UTF8_NOMIX_ASCII) && ! isASCII(*p2)) {
5576 *foldbuf1 = toFOLD(*p1);
5579 _toFOLD_utf8_flags(p1, e1, foldbuf1, &n1, flags_for_folder);
5581 else { /* Not UTF-8, get UTF-8 fold */
5582 _to_uni_fold_flags(*p1, foldbuf1, &n1, flags_for_folder);
5588 if (n2 == 0) { /* Same for s2 */
5589 if (flags & FOLDEQ_S2_ALREADY_FOLDED) {
5595 if (isASCII(*p2) && ! (flags & FOLDEQ_LOCALE)) {
5596 if ((flags & FOLDEQ_UTF8_NOMIX_ASCII) && ! isASCII(*p1)) {
5600 *foldbuf2 = toFOLD(*p2);
5603 _toFOLD_utf8_flags(p2, e2, foldbuf2, &n2, flags_for_folder);
5606 _to_uni_fold_flags(*p2, foldbuf2, &n2, flags_for_folder);
5612 /* Here f1 and f2 point to the beginning of the strings to compare.
5613 * These strings are the folds of the next character from each input
5614 * string, stored in UTF-8. */
5616 /* While there is more to look for in both folds, see if they
5617 * continue to match */
5619 U8 fold_length = UTF8SKIP(f1);
5620 if (fold_length != UTF8SKIP(f2)
5621 || (fold_length == 1 && *f1 != *f2) /* Short circuit memNE
5622 function call for single
5624 || memNE((char*)f1, (char*)f2, fold_length))
5626 return 0; /* mismatch */
5629 /* Here, they matched, advance past them */
5636 /* When reach the end of any fold, advance the input past it */
5638 p1 += u1 ? UTF8SKIP(p1) : 1;
5641 p2 += u2 ? UTF8SKIP(p2) : 1;
5643 } /* End of loop through both strings */
5645 /* A match is defined by each scan that specified an explicit length
5646 * reaching its final goal, and the other not having matched a partial
5647 * character (which can happen when the fold of a character is more than one
5649 if (! ((g1 == 0 || p1 == g1) && (g2 == 0 || p2 == g2)) || n1 || n2) {
5653 /* Successful match. Set output pointers */
5663 /* XXX The next two functions should likely be moved to mathoms.c once all
5664 * occurrences of them are removed from the core; some cpan-upstream modules
5668 Perl_uvuni_to_utf8(pTHX_ U8 *d, UV uv)
5670 PERL_ARGS_ASSERT_UVUNI_TO_UTF8;
5672 return Perl_uvoffuni_to_utf8_flags(aTHX_ d, uv, 0);
5676 =for apidoc utf8n_to_uvuni
5678 Instead use L</utf8_to_uvchr_buf>, or rarely, L</utf8n_to_uvchr>.
5680 This function was useful for code that wanted to handle both EBCDIC and
5681 ASCII platforms with Unicode properties, but starting in Perl v5.20, the
5682 distinctions between the platforms have mostly been made invisible to most
5683 code, so this function is quite unlikely to be what you want. If you do need
5684 this precise functionality, use instead
5685 C<L<NATIVE_TO_UNI(utf8_to_uvchr_buf(...))|/utf8_to_uvchr_buf>>
5686 or C<L<NATIVE_TO_UNI(utf8n_to_uvchr(...))|/utf8n_to_uvchr>>.
5692 Perl_utf8n_to_uvuni(pTHX_ const U8 *s, STRLEN curlen, STRLEN *retlen, U32 flags)
5694 PERL_ARGS_ASSERT_UTF8N_TO_UVUNI;
5696 return NATIVE_TO_UNI(utf8n_to_uvchr(s, curlen, retlen, flags));
5700 =for apidoc uvuni_to_utf8_flags
5702 Instead you almost certainly want to use L</uvchr_to_utf8> or
5703 L</uvchr_to_utf8_flags>.
5705 This function is a deprecated synonym for L</uvoffuni_to_utf8_flags>,
5706 which itself, while not deprecated, should be used only in isolated
5707 circumstances. These functions were useful for code that wanted to handle
5708 both EBCDIC and ASCII platforms with Unicode properties, but starting in Perl
5709 v5.20, the distinctions between the platforms have mostly been made invisible
5710 to most code, so this function is quite unlikely to be what you want.
5716 Perl_uvuni_to_utf8_flags(pTHX_ U8 *d, UV uv, UV flags)
5718 PERL_ARGS_ASSERT_UVUNI_TO_UTF8_FLAGS;
5720 return uvoffuni_to_utf8_flags(d, uv, flags);
5724 * ex: set ts=8 sts=4 sw=4 et: