This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
embed.fnc: White-space only
[perl5.git] / utf8.c
CommitLineData
a0ed51b3
LW
1/* utf8.c
2 *
1129b882 3 * Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008
b94e2f88 4 * by Larry Wall and others
a0ed51b3
LW
5 *
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.
8 *
9 */
10
11/*
4ac71550
TC
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.'
15 *
cdad3b53 16 * [p.603 of _The Lord of the Rings_, IV/I: "The Taming of Sméagol"]
a0ed51b3
LW
17 *
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,
4ac71550 20 * as is the custom in the West, if you wish to be answered?'
cdad3b53 21 * --Gandalf, addressing Théoden's door wardens
4ac71550
TC
22 *
23 * [p.508 of _The Lord of the Rings_, III/vi: "The King of the Golden Hall"]
a0ed51b3
LW
24 *
25 * ...the travellers perceived that the floor was paved with stones of many
26 * hues; branching runes and strange devices intertwined beneath their feet.
4ac71550
TC
27 *
28 * [p.512 of _The Lord of the Rings_, III/vi: "The King of the Golden Hall"]
a0ed51b3
LW
29 */
30
31#include "EXTERN.h"
864dbfa3 32#define PERL_IN_UTF8_C
a0ed51b3 33#include "perl.h"
b992490d 34#include "invlist_inline.h"
a0ed51b3 35
27da23d5
JH
36static const char unees[] =
37 "Malformed UTF-8 character (unexpected end of string)";
760c7c2f
KW
38static const char cp_above_legal_max[] =
39 "It is deprecated to use code point 0x%"UVXf"; the permissible max is 0x%"UVXf"";
40
41#define MAX_NON_DEPRECATED_CP (IV_MAX)
901b21bf 42
48ef279e 43/*
ccfc67b7 44=head1 Unicode Support
7fefc6c1 45These are various utility functions for manipulating UTF8-encoded
72d33970 46strings. For the uninitiated, this is a method of representing arbitrary
61296642 47Unicode characters as a variable number of bytes, in such a way that
56da48f7
DM
48characters in the ASCII range are unmodified, and a zero byte never appears
49within non-zero characters.
166f8a29 50
eaf7a4d2
CS
51=cut
52*/
53
54/*
7bbfa158 55=for apidoc is_invariant_string
eaf7a4d2 56
b8ed1ca9
KW
57Returns true iff the first C<len> bytes of the string C<s> are the same
58regardless of the UTF-8 encoding of the string (or UTF-EBCDIC encoding on
59EBCDIC machines). That is, if they are UTF-8 invariant. On ASCII-ish
60machines, all the ASCII characters and only the ASCII characters fit this
7bbfa158 61definition. On EBCDIC machines, the ASCII-range characters are invariant, but
b8ed1ca9
KW
62so also are the C1 controls and C<\c?> (which isn't in the ASCII range on
63EBCDIC).
eaf7a4d2 64
75200dff
KW
65If C<len> is 0, it will be calculated using C<strlen(s)>, (which means if you
66use this option, that C<s> can't have embedded C<NUL> characters and has to
67have a terminating C<NUL> byte).
9f7e3d64 68
a1433954 69See also L</is_utf8_string>(), L</is_utf8_string_loclen>(), and L</is_utf8_string_loc>().
eaf7a4d2
CS
70
71=cut
72*/
73
74bool
7bbfa158 75Perl_is_invariant_string(const U8 *s, STRLEN len)
eaf7a4d2
CS
76{
77 const U8* const send = s + (len ? len : strlen((const char *)s));
78 const U8* x = s;
79
7bbfa158 80 PERL_ARGS_ASSERT_IS_INVARIANT_STRING;
eaf7a4d2
CS
81
82 for (; x < send; ++x) {
83 if (!UTF8_IS_INVARIANT(*x))
84 break;
85 }
86
87 return x == send;
88}
89
90/*
378516de 91=for apidoc uvoffuni_to_utf8_flags
eebe1485 92
a27992cc 93THIS FUNCTION SHOULD BE USED IN ONLY VERY SPECIALIZED CIRCUMSTANCES.
de69f3af
KW
94Instead, B<Almost all code should use L</uvchr_to_utf8> or
95L</uvchr_to_utf8_flags>>.
a27992cc 96
de69f3af
KW
97This function is like them, but the input is a strict Unicode
98(as opposed to native) code point. Only in very rare circumstances should code
99not be using the native code point.
949cf498 100
efa9cd84 101For details, see the description for L</uvchr_to_utf8_flags>.
949cf498 102
eebe1485
SC
103=cut
104*/
105
8ee1cdcb
KW
106#define HANDLE_UNICODE_SURROGATE(uv, flags) \
107 STMT_START { \
108 if (flags & UNICODE_WARN_SURROGATE) { \
109 Perl_ck_warner_d(aTHX_ packWARN(WARN_SURROGATE), \
110 "UTF-16 surrogate U+%04"UVXf, uv); \
111 } \
112 if (flags & UNICODE_DISALLOW_SURROGATE) { \
113 return NULL; \
114 } \
115 } STMT_END;
116
117#define HANDLE_UNICODE_NONCHAR(uv, flags) \
118 STMT_START { \
119 if (flags & UNICODE_WARN_NONCHAR) { \
120 Perl_ck_warner_d(aTHX_ packWARN(WARN_NONCHAR), \
121 "Unicode non-character U+%04"UVXf" is not " \
122 "recommended for open interchange", uv); \
123 } \
124 if (flags & UNICODE_DISALLOW_NONCHAR) { \
125 return NULL; \
126 } \
127 } STMT_END;
128
ba6ed43c
KW
129/* Use shorter names internally in this file */
130#define SHIFT UTF_ACCUMULATION_SHIFT
131#undef MARK
132#define MARK UTF_CONTINUATION_MARK
133#define MASK UTF_CONTINUATION_MASK
134
dfe13c55 135U8 *
378516de 136Perl_uvoffuni_to_utf8_flags(pTHX_ U8 *d, UV uv, UV flags)
a0ed51b3 137{
378516de 138 PERL_ARGS_ASSERT_UVOFFUNI_TO_UTF8_FLAGS;
7918f24d 139
2d1545e5 140 if (OFFUNI_IS_INVARIANT(uv)) {
4c8cd605 141 *d++ = LATIN1_TO_NATIVE(uv);
d9432125
KW
142 return d;
143 }
3ea68d71
KW
144 if (uv <= MAX_UTF8_TWO_BYTE) {
145 *d++ = UTF8_TWO_BYTE_HI(uv);
146 *d++ = UTF8_TWO_BYTE_LO(uv);
147 return d;
148 }
d9432125 149
ba6ed43c
KW
150 /* Not 2-byte; test for and handle 3-byte result. In the test immediately
151 * below, the 16 is for start bytes E0-EF (which are all the possible ones
152 * for 3 byte characters). The 2 is for 2 continuation bytes; these each
153 * contribute SHIFT bits. This yields 0x4000 on EBCDIC platforms, 0x1_0000
154 * on ASCII; so 3 bytes covers the range 0x400-0x3FFF on EBCDIC;
155 * 0x800-0xFFFF on ASCII */
156 if (uv < (16 * (1U << (2 * SHIFT)))) {
157 *d++ = I8_TO_NATIVE_UTF8(( uv >> ((3 - 1) * SHIFT)) | UTF_START_MARK(3));
158 *d++ = I8_TO_NATIVE_UTF8(((uv >> ((2 - 1) * SHIFT)) & MASK) | MARK);
159 *d++ = I8_TO_NATIVE_UTF8(( uv /* (1 - 1) */ & MASK) | MARK);
160
161#ifndef EBCDIC /* These problematic code points are 4 bytes on EBCDIC, so
162 aren't tested here */
163 /* The most likely code points in this range are below the surrogates.
164 * Do an extra test to quickly exclude those. */
165 if (UNLIKELY(uv >= UNICODE_SURROGATE_FIRST)) {
166 if (UNLIKELY( UNICODE_IS_32_CONTIGUOUS_NONCHARS(uv)
167 || UNICODE_IS_END_PLANE_NONCHAR_GIVEN_NOT_SUPER(uv)))
168 {
8ee1cdcb
KW
169 HANDLE_UNICODE_NONCHAR(uv, flags);
170 }
171 else if (UNLIKELY(UNICODE_IS_SURROGATE(uv))) {
172 HANDLE_UNICODE_SURROGATE(uv, flags);
760c7c2f 173 }
ba6ed43c
KW
174 }
175#endif
176 return d;
177 }
178
179 /* Not 3-byte; that means the code point is at least 0x1_0000 on ASCII
180 * platforms, and 0x4000 on EBCDIC. There are problematic cases that can
181 * happen starting with 4-byte characters on ASCII platforms. We unify the
182 * code for these with EBCDIC, even though some of them require 5-bytes on
183 * those, because khw believes the code saving is worth the very slight
184 * performance hit on these high EBCDIC code points. */
185
186 if (UNLIKELY(UNICODE_IS_SUPER(uv))) {
a5bf80e0
KW
187 if ( UNLIKELY(uv > MAX_NON_DEPRECATED_CP)
188 && ckWARN_d(WARN_DEPRECATED))
189 {
190 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
191 cp_above_legal_max, uv, MAX_NON_DEPRECATED_CP);
192 }
193 if ( (flags & UNICODE_WARN_SUPER)
194 || ( UNICODE_IS_ABOVE_31_BIT(uv)
195 && (flags & UNICODE_WARN_ABOVE_31_BIT)))
196 {
197 Perl_ck_warner_d(aTHX_ packWARN(WARN_NON_UNICODE),
198
199 /* Choose the more dire applicable warning */
200 (UNICODE_IS_ABOVE_31_BIT(uv))
201 ? "Code point 0x%"UVXf" is not Unicode, and not portable"
202 : "Code point 0x%"UVXf" is not Unicode, may not be portable",
203 uv);
204 }
205 if (flags & UNICODE_DISALLOW_SUPER
206 || ( UNICODE_IS_ABOVE_31_BIT(uv)
207 && (flags & UNICODE_DISALLOW_ABOVE_31_BIT)))
208 {
209 return NULL;
210 }
211 }
ba6ed43c
KW
212 else if (UNLIKELY(UNICODE_IS_END_PLANE_NONCHAR_GIVEN_NOT_SUPER(uv))) {
213 HANDLE_UNICODE_NONCHAR(uv, flags);
507b9800 214 }
d9432125 215
ba6ed43c
KW
216 /* Test for and handle 4-byte result. In the test immediately below, the
217 * 8 is for start bytes F0-F7 (which are all the possible ones for 4 byte
218 * characters). The 3 is for 3 continuation bytes; these each contribute
219 * SHIFT bits. This yields 0x4_0000 on EBCDIC platforms, 0x20_0000 on
220 * ASCII, so 4 bytes covers the range 0x4000-0x3_FFFF on EBCDIC;
221 * 0x1_0000-0x1F_FFFF on ASCII */
222 if (uv < (8 * (1U << (3 * SHIFT)))) {
223 *d++ = I8_TO_NATIVE_UTF8(( uv >> ((4 - 1) * SHIFT)) | UTF_START_MARK(4));
224 *d++ = I8_TO_NATIVE_UTF8(((uv >> ((3 - 1) * SHIFT)) & MASK) | MARK);
225 *d++ = I8_TO_NATIVE_UTF8(((uv >> ((2 - 1) * SHIFT)) & MASK) | MARK);
226 *d++ = I8_TO_NATIVE_UTF8(( uv /* (1 - 1) */ & MASK) | MARK);
227
228#ifdef EBCDIC /* These were handled on ASCII platforms in the code for 3-byte
229 characters. The end-plane non-characters for EBCDIC were
230 handled just above */
231 if (UNLIKELY(UNICODE_IS_32_CONTIGUOUS_NONCHARS(uv))) {
232 HANDLE_UNICODE_NONCHAR(uv, flags);
d528804a 233 }
ba6ed43c
KW
234 else if (UNLIKELY(UNICODE_IS_SURROGATE(uv))) {
235 HANDLE_UNICODE_SURROGATE(uv, flags);
236 }
237#endif
238
239 return d;
240 }
241
242 /* Not 4-byte; that means the code point is at least 0x20_0000 on ASCII
243 * platforms, and 0x4000 on EBCDIC. At this point we switch to a loop
244 * format. The unrolled version above turns out to not save all that much
245 * time, and at these high code points (well above the legal Unicode range
246 * on ASCII platforms, and well above anything in common use in EBCDIC),
247 * khw believes that less code outweighs slight performance gains. */
248
d9432125 249 {
5aaebcb3 250 STRLEN len = OFFUNISKIP(uv);
1d72bdf6
NIS
251 U8 *p = d+len-1;
252 while (p > d) {
4c8cd605 253 *p-- = I8_TO_NATIVE_UTF8((uv & UTF_CONTINUATION_MASK) | UTF_CONTINUATION_MARK);
1d72bdf6
NIS
254 uv >>= UTF_ACCUMULATION_SHIFT;
255 }
4c8cd605 256 *p = I8_TO_NATIVE_UTF8((uv & UTF_START_MASK(len)) | UTF_START_MARK(len));
1d72bdf6
NIS
257 return d+len;
258 }
a0ed51b3 259}
a5bf80e0 260
646ca15d 261/*
07693fe6
KW
262=for apidoc uvchr_to_utf8
263
bcb1a2d4 264Adds the UTF-8 representation of the native code point C<uv> to the end
f2fc1b45 265of the string C<d>; C<d> should have at least C<UVCHR_SKIP(uv)+1> (up to
c749c9fd
KW
266C<UTF8_MAXBYTES+1>) free bytes available. The return value is the pointer to
267the byte after the end of the new character. In other words,
07693fe6
KW
268
269 d = uvchr_to_utf8(d, uv);
270
271is the recommended wide native character-aware way of saying
272
273 *(d++) = uv;
274
760c7c2f
KW
275This function accepts any UV as input, but very high code points (above
276C<IV_MAX> on the platform) will raise a deprecation warning. This is
277typically 0x7FFF_FFFF in a 32-bit word.
278
279It is possible to forbid or warn on non-Unicode code points, or those that may
280be problematic by using L</uvchr_to_utf8_flags>.
de69f3af 281
07693fe6
KW
282=cut
283*/
284
de69f3af
KW
285/* This is also a macro */
286PERL_CALLCONV U8* Perl_uvchr_to_utf8(pTHX_ U8 *d, UV uv);
287
07693fe6
KW
288U8 *
289Perl_uvchr_to_utf8(pTHX_ U8 *d, UV uv)
290{
de69f3af 291 return uvchr_to_utf8(d, uv);
07693fe6
KW
292}
293
de69f3af
KW
294/*
295=for apidoc uvchr_to_utf8_flags
296
297Adds the UTF-8 representation of the native code point C<uv> to the end
f2fc1b45 298of the string C<d>; C<d> should have at least C<UVCHR_SKIP(uv)+1> (up to
c749c9fd
KW
299C<UTF8_MAXBYTES+1>) free bytes available. The return value is the pointer to
300the byte after the end of the new character. In other words,
de69f3af
KW
301
302 d = uvchr_to_utf8_flags(d, uv, flags);
303
304or, in most cases,
305
306 d = uvchr_to_utf8_flags(d, uv, 0);
307
308This is the Unicode-aware way of saying
309
310 *(d++) = uv;
311
760c7c2f
KW
312If C<flags> is 0, this function accepts any UV as input, but very high code
313points (above C<IV_MAX> for the platform) will raise a deprecation warning.
314This is typically 0x7FFF_FFFF in a 32-bit word.
315
316Specifying C<flags> can further restrict what is allowed and not warned on, as
317follows:
de69f3af 318
796b6530 319If C<uv> is a Unicode surrogate code point and C<UNICODE_WARN_SURROGATE> is set,
7ee537e6
KW
320the function will raise a warning, provided UTF8 warnings are enabled. If
321instead C<UNICODE_DISALLOW_SURROGATE> is set, the function will fail and return
322NULL. If both flags are set, the function will both warn and return NULL.
de69f3af 323
760c7c2f
KW
324Similarly, the C<UNICODE_WARN_NONCHAR> and C<UNICODE_DISALLOW_NONCHAR> flags
325affect how the function handles a Unicode non-character.
93e6dbd6 326
760c7c2f
KW
327And likewise, the C<UNICODE_WARN_SUPER> and C<UNICODE_DISALLOW_SUPER> flags
328affect the handling of code points that are above the Unicode maximum of
3290x10FFFF. Languages other than Perl may not be able to accept files that
330contain these.
93e6dbd6
KW
331
332The flag C<UNICODE_WARN_ILLEGAL_INTERCHANGE> selects all three of
333the above WARN flags; and C<UNICODE_DISALLOW_ILLEGAL_INTERCHANGE> selects all
334three DISALLOW flags.
335
ab8e6d41
KW
336Code points above 0x7FFF_FFFF (2**31 - 1) were never specified in any standard,
337so using them is more problematic than other above-Unicode code points. Perl
338invented an extension to UTF-8 to represent the ones above 2**36-1, so it is
339likely that non-Perl languages will not be able to read files that contain
340these that written by the perl interpreter; nor would Perl understand files
341written by something that uses a different extension. For these reasons, there
342is a separate set of flags that can warn and/or disallow these extremely high
343code points, even if other above-Unicode ones are accepted. These are the
760c7c2f
KW
344C<UNICODE_WARN_ABOVE_31_BIT> and C<UNICODE_DISALLOW_ABOVE_31_BIT> flags. These
345are entirely independent from the deprecation warning for code points above
346C<IV_MAX>. On 32-bit machines, it will eventually be forbidden to have any
347code point that needs more than 31 bits to represent. When that happens,
348effectively the C<UNICODE_DISALLOW_ABOVE_31_BIT> flag will always be set on
34932-bit machines. (Of course C<UNICODE_DISALLOW_SUPER> will treat all
ab8e6d41
KW
350above-Unicode code points, including these, as malformations; and
351C<UNICODE_WARN_SUPER> warns on these.)
352
353On EBCDIC platforms starting in Perl v5.24, the Perl extension for representing
354extremely high code points kicks in at 0x3FFF_FFFF (2**30 -1), which is lower
355than on ASCII. Prior to that, code points 2**31 and higher were simply
356unrepresentable, and a different, incompatible method was used to represent
357code points between 2**30 and 2**31 - 1. The flags C<UNICODE_WARN_ABOVE_31_BIT>
358and C<UNICODE_DISALLOW_ABOVE_31_BIT> have the same function as on ASCII
359platforms, warning and disallowing 2**31 and higher.
de69f3af 360
de69f3af
KW
361=cut
362*/
363
364/* This is also a macro */
365PERL_CALLCONV U8* Perl_uvchr_to_utf8_flags(pTHX_ U8 *d, UV uv, UV flags);
366
07693fe6
KW
367U8 *
368Perl_uvchr_to_utf8_flags(pTHX_ U8 *d, UV uv, UV flags)
369{
de69f3af 370 return uvchr_to_utf8_flags(d, uv, flags);
07693fe6
KW
371}
372
373/*
87cea99e 374=for apidoc is_utf8_string
6662521e 375
a1433954 376Returns true if the first C<len> bytes of string C<s> form a valid
9f7e3d64 377UTF-8 string, false otherwise. If C<len> is 0, it will be calculated
75200dff
KW
378using C<strlen(s)> (which means if you use this option, that C<s> can't have
379embedded C<NUL> characters and has to have a terminating C<NUL> byte). Note
380that all characters being ASCII constitute 'a valid UTF-8 string'.
6662521e 381
7bbfa158 382See also L</is_invariant_string>(), L</is_utf8_string_loclen>(), and L</is_utf8_string_loc>().
768c67ee 383
6662521e
GS
384=cut
385*/
386
8e84507e 387bool
668b6d8d 388Perl_is_utf8_string(const U8 *s, STRLEN len)
6662521e 389{
35da51f7 390 const U8* const send = s + (len ? len : strlen((const char *)s));
7fc63493 391 const U8* x = s;
067a85ef 392
7918f24d 393 PERL_ARGS_ASSERT_IS_UTF8_STRING;
1aa99e6b 394
6662521e 395 while (x < send) {
6302f837
KW
396 STRLEN len = isUTF8_CHAR(x, send);
397 if (UNLIKELY(! len)) {
398 return FALSE;
399 }
400 x += len;
6662521e 401 }
768c67ee 402
067a85ef 403 return TRUE;
6662521e
GS
404}
405
67e989fb 406/*
814fafa7
NC
407Implemented as a macro in utf8.h
408
87cea99e 409=for apidoc is_utf8_string_loc
814fafa7 410
a1433954
KW
411Like L</is_utf8_string> but stores the location of the failure (in the
412case of "utf8ness failure") or the location C<s>+C<len> (in the case of
814fafa7
NC
413"utf8ness success") in the C<ep>.
414
a1433954 415See also L</is_utf8_string_loclen>() and L</is_utf8_string>().
814fafa7 416
87cea99e 417=for apidoc is_utf8_string_loclen
81cd54e3 418
a1433954
KW
419Like L</is_utf8_string>() but stores the location of the failure (in the
420case of "utf8ness failure") or the location C<s>+C<len> (in the case of
768c67ee
JH
421"utf8ness success") in the C<ep>, and the number of UTF-8
422encoded characters in the C<el>.
423
a1433954 424See also L</is_utf8_string_loc>() and L</is_utf8_string>().
81cd54e3
JH
425
426=cut
427*/
428
429bool
668b6d8d 430Perl_is_utf8_string_loclen(const U8 *s, STRLEN len, const U8 **ep, STRLEN *el)
81cd54e3 431{
35da51f7 432 const U8* const send = s + (len ? len : strlen((const char *)s));
7fc63493 433 const U8* x = s;
3ebfea28 434 STRLEN outlen = 0;
7918f24d
NC
435
436 PERL_ARGS_ASSERT_IS_UTF8_STRING_LOCLEN;
81cd54e3 437
81cd54e3 438 while (x < send) {
6302f837
KW
439 STRLEN len = isUTF8_CHAR(x, send);
440 if (UNLIKELY(! len)) {
441 goto out;
442 }
443 x += len;
444 outlen++;
81cd54e3 445 }
768c67ee
JH
446
447 out:
3ebfea28
AL
448 if (el)
449 *el = outlen;
450
768c67ee
JH
451 if (ep)
452 *ep = x;
3ebfea28 453 return (x == send);
81cd54e3
JH
454}
455
456/*
768c67ee 457
de69f3af 458=for apidoc utf8n_to_uvchr
378516de
KW
459
460THIS FUNCTION SHOULD BE USED IN ONLY VERY SPECIALIZED CIRCUMSTANCES.
de69f3af 461Most code should use L</utf8_to_uvchr_buf>() rather than call this directly.
67e989fb 462
9041c2e3 463Bottom level UTF-8 decode routine.
de69f3af 464Returns the native code point value of the first character in the string C<s>,
746afd53
KW
465which is assumed to be in UTF-8 (or UTF-EBCDIC) encoding, and no longer than
466C<curlen> bytes; C<*retlen> (if C<retlen> isn't NULL) will be set to
467the length, in bytes, of that character.
949cf498
KW
468
469The value of C<flags> determines the behavior when C<s> does not point to a
470well-formed UTF-8 character. If C<flags> is 0, when a malformation is found,
524080c4
KW
471zero is returned and C<*retlen> is set so that (S<C<s> + C<*retlen>>) is the
472next possible position in C<s> that could begin a non-malformed character.
473Also, if UTF-8 warnings haven't been lexically disabled, a warning is raised.
949cf498
KW
474
475Various ALLOW flags can be set in C<flags> to allow (and not warn on)
476individual types of malformations, such as the sequence being overlong (that
477is, when there is a shorter sequence that can express the same code point;
478overlong sequences are expressly forbidden in the UTF-8 standard due to
479potential security issues). Another malformation example is the first byte of
480a character not being a legal first byte. See F<utf8.h> for the list of such
524080c4
KW
481flags. For allowed 0 length strings, this function returns 0; for allowed
482overlong sequences, the computed code point is returned; for all other allowed
483malformations, the Unicode REPLACEMENT CHARACTER is returned, as these have no
484determinable reasonable value.
949cf498 485
796b6530 486The C<UTF8_CHECK_ONLY> flag overrides the behavior when a non-allowed (by other
949cf498
KW
487flags) malformation is found. If this flag is set, the routine assumes that
488the caller will raise a warning, and this function will silently just set
d088425d
KW
489C<retlen> to C<-1> (cast to C<STRLEN>) and return zero.
490
75200dff 491Note that this API requires disambiguation between successful decoding a C<NUL>
796b6530 492character, and an error return (unless the C<UTF8_CHECK_ONLY> flag is set), as
d088425d 493in both cases, 0 is returned. To disambiguate, upon a zero return, see if the
75200dff
KW
494first byte of C<s> is 0 as well. If so, the input was a C<NUL>; if not, the
495input had an error.
949cf498
KW
496
497Certain code points are considered problematic. These are Unicode surrogates,
746afd53 498Unicode non-characters, and code points above the Unicode maximum of 0x10FFFF.
949cf498 499By default these are considered regular code points, but certain situations
5eafe189 500warrant special handling for them. If C<flags> contains
796b6530
KW
501C<UTF8_DISALLOW_ILLEGAL_INTERCHANGE>, all three classes are treated as
502malformations and handled as such. The flags C<UTF8_DISALLOW_SURROGATE>,
503C<UTF8_DISALLOW_NONCHAR>, and C<UTF8_DISALLOW_SUPER> (meaning above the legal
504Unicode maximum) can be set to disallow these categories individually.
505
506The flags C<UTF8_WARN_ILLEGAL_INTERCHANGE>, C<UTF8_WARN_SURROGATE>,
507C<UTF8_WARN_NONCHAR>, and C<UTF8_WARN_SUPER> will cause warning messages to be
508raised for their respective categories, but otherwise the code points are
509considered valid (not malformations). To get a category to both be treated as
510a malformation and raise a warning, specify both the WARN and DISALLOW flags.
949cf498 511(But note that warnings are not raised if lexically disabled nor if
796b6530 512C<UTF8_CHECK_ONLY> is also specified.)
949cf498 513
760c7c2f
KW
514It is now deprecated to have very high code points (above C<IV_MAX> on the
515platforms) and this function will raise a deprecation warning for these (unless
516such warnings are turned off). This value, is typically 0x7FFF_FFFF (2**31 -1)
517in a 32-bit word.
ab8e6d41
KW
518
519Code points above 0x7FFF_FFFF (2**31 - 1) were never specified in any standard,
520so using them is more problematic than other above-Unicode code points. Perl
521invented an extension to UTF-8 to represent the ones above 2**36-1, so it is
522likely that non-Perl languages will not be able to read files that contain
523these that written by the perl interpreter; nor would Perl understand files
524written by something that uses a different extension. For these reasons, there
525is a separate set of flags that can warn and/or disallow these extremely high
526code points, even if other above-Unicode ones are accepted. These are the
760c7c2f
KW
527C<UTF8_WARN_ABOVE_31_BIT> and C<UTF8_DISALLOW_ABOVE_31_BIT> flags. These
528are entirely independent from the deprecation warning for code points above
529C<IV_MAX>. On 32-bit machines, it will eventually be forbidden to have any
530code point that needs more than 31 bits to represent. When that happens,
531effectively the C<UTF8_DISALLOW_ABOVE_31_BIT> flag will always be set on
53232-bit machines. (Of course C<UTF8_DISALLOW_SUPER> will treat all
ab8e6d41
KW
533above-Unicode code points, including these, as malformations; and
534C<UTF8_WARN_SUPER> warns on these.)
535
536On EBCDIC platforms starting in Perl v5.24, the Perl extension for representing
537extremely high code points kicks in at 0x3FFF_FFFF (2**30 -1), which is lower
538than on ASCII. Prior to that, code points 2**31 and higher were simply
539unrepresentable, and a different, incompatible method was used to represent
540code points between 2**30 and 2**31 - 1. The flags C<UTF8_WARN_ABOVE_31_BIT>
541and C<UTF8_DISALLOW_ABOVE_31_BIT> have the same function as on ASCII
542platforms, warning and disallowing 2**31 and higher.
949cf498
KW
543
544All other code points corresponding to Unicode characters, including private
545use and those yet to be assigned, are never considered malformed and never
546warn.
67e989fb 547
37607a96
PK
548=cut
549*/
67e989fb 550
a0ed51b3 551UV
de69f3af 552Perl_utf8n_to_uvchr(pTHX_ const U8 *s, STRLEN curlen, STRLEN *retlen, U32 flags)
a0ed51b3 553{
d4c19fe8 554 const U8 * const s0 = s;
eb83ed87 555 U8 overflow_byte = '\0'; /* Save byte in case of overflow */
0b8d30e8 556 U8 * send;
eb83ed87
KW
557 UV uv = *s;
558 STRLEN expectlen;
949cf498 559 SV* sv = NULL;
eb83ed87
KW
560 UV outlier_ret = 0; /* return value when input is in error or problematic
561 */
562 UV pack_warn = 0; /* Save result of packWARN() for later */
563 bool unexpected_non_continuation = FALSE;
564 bool overflowed = FALSE;
2f8f112e 565 bool do_overlong_test = TRUE; /* May have to skip this test */
a0dbb045 566
eb83ed87 567 const char* const malformed_text = "Malformed UTF-8 character";
7918f24d 568
de69f3af 569 PERL_ARGS_ASSERT_UTF8N_TO_UVCHR;
a0dbb045 570
eb83ed87
KW
571 /* The order of malformation tests here is important. We should consume as
572 * few bytes as possible in order to not skip any valid character. This is
573 * required by the Unicode Standard (section 3.9 of Unicode 6.0); see also
574 * http://unicode.org/reports/tr36 for more discussion as to why. For
575 * example, once we've done a UTF8SKIP, we can tell the expected number of
576 * bytes, and could fail right off the bat if the input parameters indicate
577 * that there are too few available. But it could be that just that first
578 * byte is garbled, and the intended character occupies fewer bytes. If we
579 * blindly assumed that the first byte is correct, and skipped based on
580 * that number, we could skip over a valid input character. So instead, we
581 * always examine the sequence byte-by-byte.
582 *
583 * We also should not consume too few bytes, otherwise someone could inject
584 * things. For example, an input could be deliberately designed to
585 * overflow, and if this code bailed out immediately upon discovering that,
e2660c54 586 * returning to the caller C<*retlen> pointing to the very next byte (one
eb83ed87
KW
587 * which is actually part of of the overflowing sequence), that could look
588 * legitimate to the caller, which could discard the initial partial
589 * sequence and process the rest, inappropriately */
590
591 /* Zero length strings, if allowed, of necessity are zero */
b5b9af04 592 if (UNLIKELY(curlen == 0)) {
eb83ed87
KW
593 if (retlen) {
594 *retlen = 0;
595 }
a0dbb045 596
eb83ed87
KW
597 if (flags & UTF8_ALLOW_EMPTY) {
598 return 0;
599 }
600 if (! (flags & UTF8_CHECK_ONLY)) {
601 sv = sv_2mortal(Perl_newSVpvf(aTHX_ "%s (empty string)", malformed_text));
602 }
0c443dc2
JH
603 goto malformed;
604 }
605
eb83ed87
KW
606 expectlen = UTF8SKIP(s);
607
608 /* A well-formed UTF-8 character, as the vast majority of calls to this
609 * function will be for, has this expected length. For efficiency, set
610 * things up here to return it. It will be overriden only in those rare
611 * cases where a malformation is found */
612 if (retlen) {
613 *retlen = expectlen;
614 }
615
616 /* An invariant is trivially well-formed */
1d72bdf6 617 if (UTF8_IS_INVARIANT(uv)) {
de69f3af 618 return uv;
a0ed51b3 619 }
67e989fb 620
eb83ed87 621 /* A continuation character can't start a valid sequence */
b5b9af04 622 if (UNLIKELY(UTF8_IS_CONTINUATION(uv))) {
eb83ed87
KW
623 if (flags & UTF8_ALLOW_CONTINUATION) {
624 if (retlen) {
625 *retlen = 1;
626 }
627 return UNICODE_REPLACEMENT;
628 }
ba210ebe 629
eb83ed87
KW
630 if (! (flags & UTF8_CHECK_ONLY)) {
631 sv = sv_2mortal(Perl_newSVpvf(aTHX_ "%s (unexpected continuation byte 0x%02x, with no preceding start byte)", malformed_text, *s0));
632 }
633 curlen = 1;
ba210ebe
JH
634 goto malformed;
635 }
9041c2e3 636
dcd27b3c
KW
637 /* Here is not a continuation byte, nor an invariant. The only thing left
638 * is a start byte (possibly for an overlong) */
639
1d72bdf6 640#ifdef EBCDIC
bc3632a8 641 uv = NATIVE_UTF8_TO_I8(uv);
1d72bdf6
NIS
642#endif
643
eb83ed87
KW
644 /* Remove the leading bits that indicate the number of bytes in the
645 * character's whole UTF-8 sequence, leaving just the bits that are part of
646 * the value */
647 uv &= UTF_START_MASK(expectlen);
ba210ebe 648
eb83ed87
KW
649 /* Now, loop through the remaining bytes in the character's sequence,
650 * accumulating each into the working value as we go. Be sure to not look
651 * past the end of the input string */
0b8d30e8
KW
652 send = (U8*) s0 + ((expectlen <= curlen) ? expectlen : curlen);
653
eb83ed87 654 for (s = s0 + 1; s < send; s++) {
b5b9af04 655 if (LIKELY(UTF8_IS_CONTINUATION(*s))) {
eb83ed87
KW
656 if (uv & UTF_ACCUMULATION_OVERFLOW_MASK) {
657
658 /* The original implementors viewed this malformation as more
659 * serious than the others (though I, khw, don't understand
660 * why, since other malformations also give very very wrong
661 * results), so there is no way to turn off checking for it.
662 * Set a flag, but keep going in the loop, so that we absorb
663 * the rest of the bytes that comprise the character. */
664 overflowed = TRUE;
665 overflow_byte = *s; /* Save for warning message's use */
666 }
8850bf83 667 uv = UTF8_ACCUMULATE(uv, *s);
eb83ed87
KW
668 }
669 else {
670 /* Here, found a non-continuation before processing all expected
671 * bytes. This byte begins a new character, so quit, even if
672 * allowing this malformation. */
673 unexpected_non_continuation = TRUE;
674 break;
675 }
676 } /* End of loop through the character's bytes */
677
678 /* Save how many bytes were actually in the character */
679 curlen = s - s0;
680
681 /* The loop above finds two types of malformations: non-continuation and/or
682 * overflow. The non-continuation malformation is really a too-short
683 * malformation, as it means that the current character ended before it was
684 * expected to (being terminated prematurely by the beginning of the next
685 * character, whereas in the too-short malformation there just are too few
686 * bytes available to hold the character. In both cases, the check below
687 * that we have found the expected number of bytes would fail if executed.)
688 * Thus the non-continuation malformation is really unnecessary, being a
689 * subset of the too-short malformation. But there may be existing
690 * applications that are expecting the non-continuation type, so we retain
691 * it, and return it in preference to the too-short malformation. (If this
692 * code were being written from scratch, the two types might be collapsed
693 * into one.) I, khw, am also giving priority to returning the
694 * non-continuation and too-short malformations over overflow when multiple
695 * ones are present. I don't know of any real reason to prefer one over
696 * the other, except that it seems to me that multiple-byte errors trumps
697 * errors from a single byte */
b5b9af04 698 if (UNLIKELY(unexpected_non_continuation)) {
eb83ed87
KW
699 if (!(flags & UTF8_ALLOW_NON_CONTINUATION)) {
700 if (! (flags & UTF8_CHECK_ONLY)) {
701 if (curlen == 1) {
702 sv = sv_2mortal(Perl_newSVpvf(aTHX_ "%s (unexpected non-continuation byte 0x%02x, immediately after start byte 0x%02x)", malformed_text, *s, *s0));
703 }
704 else {
705 sv = sv_2mortal(Perl_newSVpvf(aTHX_ "%s (unexpected non-continuation byte 0x%02x, %d bytes after start byte 0x%02x, expected %d bytes)", malformed_text, *s, (int) curlen, *s0, (int)expectlen));
a0dbb045
JH
706 }
707 }
eb83ed87
KW
708 goto malformed;
709 }
710 uv = UNICODE_REPLACEMENT;
2f8f112e
KW
711
712 /* Skip testing for overlongs, as the REPLACEMENT may not be the same
713 * as what the original expectations were. */
714 do_overlong_test = FALSE;
eb83ed87
KW
715 if (retlen) {
716 *retlen = curlen;
717 }
718 }
b5b9af04 719 else if (UNLIKELY(curlen < expectlen)) {
eb83ed87
KW
720 if (! (flags & UTF8_ALLOW_SHORT)) {
721 if (! (flags & UTF8_CHECK_ONLY)) {
722 sv = sv_2mortal(Perl_newSVpvf(aTHX_ "%s (%d byte%s, need %d, after start byte 0x%02x)", malformed_text, (int)curlen, curlen == 1 ? "" : "s", (int)expectlen, *s0));
a0dbb045 723 }
eb83ed87
KW
724 goto malformed;
725 }
726 uv = UNICODE_REPLACEMENT;
2f8f112e 727 do_overlong_test = FALSE;
eb83ed87
KW
728 if (retlen) {
729 *retlen = curlen;
730 }
731 }
732
b5b9af04 733 if (UNLIKELY(overflowed)) {
eb83ed87 734 sv = sv_2mortal(Perl_newSVpvf(aTHX_ "%s (overflow at byte 0x%02x, after start byte 0x%02x)", malformed_text, overflow_byte, *s0));
ba210ebe 735 goto malformed;
eb83ed87 736 }
eb83ed87 737
2f8f112e 738 if (do_overlong_test
5aaebcb3 739 && expectlen > (STRLEN) OFFUNISKIP(uv)
2f8f112e
KW
740 && ! (flags & UTF8_ALLOW_LONG))
741 {
eb83ed87
KW
742 /* The overlong malformation has lower precedence than the others.
743 * Note that if this malformation is allowed, we return the actual
744 * value, instead of the replacement character. This is because this
745 * value is actually well-defined. */
746 if (! (flags & UTF8_CHECK_ONLY)) {
5aaebcb3 747 sv = sv_2mortal(Perl_newSVpvf(aTHX_ "%s (%d byte%s, need %d, after start byte 0x%02x)", malformed_text, (int)expectlen, expectlen == 1 ? "": "s", OFFUNISKIP(uv), *s0));
eb83ed87
KW
748 }
749 goto malformed;
750 }
751
1a89bb6c 752 /* Here, the input is considered to be well-formed, but it still could be a
eb83ed87
KW
753 * problematic code point that is not allowed by the input parameters. */
754 if (uv >= UNICODE_SURROGATE_FIRST /* isn't problematic if < this */
760c7c2f
KW
755 && ((flags & ( UTF8_DISALLOW_NONCHAR
756 |UTF8_DISALLOW_SURROGATE
757 |UTF8_DISALLOW_SUPER
758 |UTF8_DISALLOW_ABOVE_31_BIT
759 |UTF8_WARN_NONCHAR
760 |UTF8_WARN_SURROGATE
761 |UTF8_WARN_SUPER
762 |UTF8_WARN_ABOVE_31_BIT))
763 || ( UNLIKELY(uv > MAX_NON_DEPRECATED_CP)
764 && ckWARN_d(WARN_DEPRECATED))))
eb83ed87 765 {
949cf498 766 if (UNICODE_IS_SURROGATE(uv)) {
ea5ced44
KW
767
768 /* By adding UTF8_CHECK_ONLY to the test, we avoid unnecessary
769 * generation of the sv, since no warnings are raised under CHECK */
eb83ed87 770 if ((flags & (UTF8_WARN_SURROGATE|UTF8_CHECK_ONLY)) == UTF8_WARN_SURROGATE
54f4afef 771 && ckWARN_d(WARN_SURROGATE))
eb83ed87 772 {
111d382d 773 sv = sv_2mortal(Perl_newSVpvf(aTHX_ "UTF-16 surrogate U+%04"UVXf"", uv));
54f4afef 774 pack_warn = packWARN(WARN_SURROGATE);
949cf498
KW
775 }
776 if (flags & UTF8_DISALLOW_SURROGATE) {
777 goto disallowed;
778 }
779 }
949cf498 780 else if ((uv > PERL_UNICODE_MAX)) {
eb83ed87 781 if ((flags & (UTF8_WARN_SUPER|UTF8_CHECK_ONLY)) == UTF8_WARN_SUPER
ea5ced44 782 && ckWARN_d(WARN_NON_UNICODE))
eb83ed87 783 {
0bcdd8f6
KW
784 sv = sv_2mortal(Perl_newSVpvf(aTHX_
785 "Code point 0x%04"UVXf" is not Unicode, may not be portable",
786 uv));
54f4afef 787 pack_warn = packWARN(WARN_NON_UNICODE);
949cf498 788 }
c0236afe
KW
789
790 /* The maximum code point ever specified by a standard was
791 * 2**31 - 1. Anything larger than that is a Perl extension that
792 * very well may not be understood by other applications (including
793 * earlier perl versions on EBCDIC platforms). On ASCII platforms,
794 * these code points are indicated by the first UTF-8 byte being
d35f2ca5
KW
795 * 0xFE or 0xFF. We test for these after the regular SUPER ones,
796 * and before possibly bailing out, so that the slightly more dire
c0236afe
KW
797 * warning will override the regular one. */
798 if (
799#ifndef EBCDIC
800 (*s0 & 0xFE) == 0xFE /* matches both FE, FF */
801#else
802 /* The I8 for 2**31 (U+80000000) is
803 * \xFF\xA0\xA0\xA0\xA0\xA0\xA0\xA2\xA0\xA0\xA0\xA0\xA0\xA0
804 * and it turns out that on all EBCDIC pages recognized that
805 * the UTF-EBCDIC for that code point is
806 * \xFE\x41\x41\x41\x41\x41\x41\x43\x41\x41\x41\x41\x41\x41
807 * For the next lower code point, the 1047 UTF-EBCDIC is
808 * \xFE\x41\x41\x41\x41\x41\x41\x42\x73\x73\x73\x73\x73\x73
809 * The other code pages differ only in the bytes following
810 * \x42. Thus the following works (the minimum continuation
811 * byte is \x41). */
812 *s0 == 0xFE && send - s0 > 7 && ( s0[1] > 0x41
813 || s0[2] > 0x41
814 || s0[3] > 0x41
815 || s0[4] > 0x41
816 || s0[5] > 0x41
817 || s0[6] > 0x41
818 || s0[7] > 0x42)
819#endif
d35f2ca5
KW
820 && (flags & (UTF8_WARN_ABOVE_31_BIT|UTF8_WARN_SUPER
821 |UTF8_DISALLOW_ABOVE_31_BIT)))
ea5ced44 822 {
0bcdd8f6 823 if ( ! (flags & UTF8_CHECK_ONLY)
d35f2ca5 824 && (flags & (UTF8_WARN_ABOVE_31_BIT|UTF8_WARN_SUPER))
0bcdd8f6 825 && ckWARN_d(WARN_UTF8))
ea5ced44 826 {
0bcdd8f6
KW
827 sv = sv_2mortal(Perl_newSVpvf(aTHX_
828 "Code point 0x%"UVXf" is not Unicode, and not portable",
829 uv));
ea5ced44
KW
830 pack_warn = packWARN(WARN_UTF8);
831 }
d35f2ca5 832 if (flags & UTF8_DISALLOW_ABOVE_31_BIT) {
ea5ced44
KW
833 goto disallowed;
834 }
835 }
c0236afe 836
949cf498
KW
837 if (flags & UTF8_DISALLOW_SUPER) {
838 goto disallowed;
839 }
760c7c2f
KW
840
841 /* The deprecated warning overrides any non-deprecated one */
842 if (UNLIKELY(uv > MAX_NON_DEPRECATED_CP) && ckWARN_d(WARN_DEPRECATED))
843 {
844 sv = sv_2mortal(Perl_newSVpvf(aTHX_ cp_above_legal_max,
845 uv, MAX_NON_DEPRECATED_CP));
846 pack_warn = packWARN(WARN_DEPRECATED);
847 }
949cf498 848 }
4190d317
KW
849 else if (UNICODE_IS_NONCHAR(uv)) {
850 if ((flags & (UTF8_WARN_NONCHAR|UTF8_CHECK_ONLY)) == UTF8_WARN_NONCHAR
54f4afef 851 && ckWARN_d(WARN_NONCHAR))
4190d317 852 {
ba707cdc 853 sv = sv_2mortal(Perl_newSVpvf(aTHX_ "Unicode non-character U+%04"UVXf" is not recommended for open interchange", uv));
54f4afef 854 pack_warn = packWARN(WARN_NONCHAR);
4190d317
KW
855 }
856 if (flags & UTF8_DISALLOW_NONCHAR) {
857 goto disallowed;
858 }
859 }
949cf498 860
eb83ed87 861 if (sv) {
de69f3af
KW
862 outlier_ret = uv; /* Note we don't bother to convert to native,
863 as all the outlier code points are the same
864 in both ASCII and EBCDIC */
eb83ed87
KW
865 goto do_warn;
866 }
867
949cf498
KW
868 /* Here, this is not considered a malformed character, so drop through
869 * to return it */
a0ed51b3 870 }
ba210ebe 871
de69f3af 872 return UNI_TO_NATIVE(uv);
ba210ebe 873
eb83ed87
KW
874 /* There are three cases which get to beyond this point. In all 3 cases:
875 * <sv> if not null points to a string to print as a warning.
876 * <curlen> is what <*retlen> should be set to if UTF8_CHECK_ONLY isn't
877 * set.
878 * <outlier_ret> is what return value to use if UTF8_CHECK_ONLY isn't set.
879 * This is done by initializing it to 0, and changing it only
880 * for case 1).
881 * The 3 cases are:
882 * 1) The input is valid but problematic, and to be warned about. The
883 * return value is the resultant code point; <*retlen> is set to
884 * <curlen>, the number of bytes that comprise the code point.
885 * <pack_warn> contains the result of packWARN() for the warning
886 * types. The entry point for this case is the label <do_warn>;
887 * 2) The input is a valid code point but disallowed by the parameters to
888 * this function. The return value is 0. If UTF8_CHECK_ONLY is set,
889 * <*relen> is -1; otherwise it is <curlen>, the number of bytes that
890 * comprise the code point. <pack_warn> contains the result of
891 * packWARN() for the warning types. The entry point for this case is
892 * the label <disallowed>.
893 * 3) The input is malformed. The return value is 0. If UTF8_CHECK_ONLY
894 * is set, <*relen> is -1; otherwise it is <curlen>, the number of
895 * bytes that comprise the malformation. All such malformations are
896 * assumed to be warning type <utf8>. The entry point for this case
897 * is the label <malformed>.
898 */
949cf498 899
7b52d656 900 malformed:
ba210ebe 901
eb83ed87
KW
902 if (sv && ckWARN_d(WARN_UTF8)) {
903 pack_warn = packWARN(WARN_UTF8);
904 }
905
7b52d656 906 disallowed:
eb83ed87 907
fcc8fcf6 908 if (flags & UTF8_CHECK_ONLY) {
ba210ebe 909 if (retlen)
10edeb5d 910 *retlen = ((STRLEN) -1);
ba210ebe
JH
911 return 0;
912 }
913
7b52d656 914 do_warn:
5b311467 915
eb83ed87
KW
916 if (pack_warn) { /* <pack_warn> was initialized to 0, and changed only
917 if warnings are to be raised. */
f555bc63 918 const char * const string = SvPVX_const(sv);
a0dbb045 919
f555bc63
KW
920 if (PL_op)
921 Perl_warner(aTHX_ pack_warn, "%s in %s", string, OP_DESC(PL_op));
922 else
923 Perl_warner(aTHX_ pack_warn, "%s", string);
a0dbb045
JH
924 }
925
eb83ed87
KW
926 if (retlen) {
927 *retlen = curlen;
928 }
ba210ebe 929
eb83ed87 930 return outlier_ret;
a0ed51b3
LW
931}
932
8e84507e 933/*
ec5f19d0
KW
934=for apidoc utf8_to_uvchr_buf
935
936Returns the native code point of the first character in the string C<s> which
937is assumed to be in UTF-8 encoding; C<send> points to 1 beyond the end of C<s>.
524080c4 938C<*retlen> will be set to the length, in bytes, of that character.
ec5f19d0 939
524080c4
KW
940If C<s> does not point to a well-formed UTF-8 character and UTF8 warnings are
941enabled, zero is returned and C<*retlen> is set (if C<retlen> isn't
796b6530 942C<NULL>) to -1. If those warnings are off, the computed value, if well-defined
173db420 943(or the Unicode REPLACEMENT CHARACTER if not), is silently returned, and
796b6530 944C<*retlen> is set (if C<retlen> isn't C<NULL>) so that (S<C<s> + C<*retlen>>) is
173db420 945the next possible position in C<s> that could begin a non-malformed character.
de69f3af 946See L</utf8n_to_uvchr> for details on when the REPLACEMENT CHARACTER is
173db420 947returned.
ec5f19d0 948
760c7c2f
KW
949Code points above the platform's C<IV_MAX> will raise a deprecation warning,
950unless those are turned off.
951
ec5f19d0
KW
952=cut
953*/
954
955
956UV
957Perl_utf8_to_uvchr_buf(pTHX_ const U8 *s, const U8 *send, STRLEN *retlen)
958{
ec5f19d0
KW
959 assert(s < send);
960
961 return utf8n_to_uvchr(s, send - s, retlen,
962 ckWARN_d(WARN_UTF8) ? 0 : UTF8_ALLOW_ANY);
963}
964
27d6c58a 965/* Like L</utf8_to_uvchr_buf>(), but should only be called when it is known that
3986bb7c 966 * there are no malformations in the input UTF-8 string C<s>. surrogates,
57b0056d 967 * non-character code points, and non-Unicode code points are allowed. */
27d6c58a
KW
968
969UV
970Perl_valid_utf8_to_uvchr(pTHX_ const U8 *s, STRLEN *retlen)
971{
010ab96b
KW
972 UV expectlen = UTF8SKIP(s);
973 const U8* send = s + expectlen;
9ff2f0f7 974 UV uv = *s;
3986bb7c 975
27d6c58a 976 PERL_ARGS_ASSERT_VALID_UTF8_TO_UVCHR;
81611534 977 PERL_UNUSED_CONTEXT;
27d6c58a 978
010ab96b
KW
979 if (retlen) {
980 *retlen = expectlen;
981 }
982
983 /* An invariant is trivially returned */
984 if (expectlen == 1) {
9ff2f0f7 985 return uv;
010ab96b
KW
986 }
987
9ff2f0f7
KW
988#ifdef EBCDIC
989 uv = NATIVE_UTF8_TO_I8(uv);
990#endif
991
010ab96b
KW
992 /* Remove the leading bits that indicate the number of bytes, leaving just
993 * the bits that are part of the value */
994 uv &= UTF_START_MASK(expectlen);
995
996 /* Now, loop through the remaining bytes, accumulating each into the
997 * working total as we go. (I khw tried unrolling the loop for up to 4
998 * bytes, but there was no performance improvement) */
999 for (++s; s < send; s++) {
1000 uv = UTF8_ACCUMULATE(uv, *s);
1001 }
1002
3986bb7c 1003 return UNI_TO_NATIVE(uv);
010ab96b 1004
27d6c58a
KW
1005}
1006
ec5f19d0 1007/*
ec5f19d0
KW
1008=for apidoc utf8_to_uvuni_buf
1009
de69f3af
KW
1010Only in very rare circumstances should code need to be dealing in Unicode
1011(as opposed to native) code points. In those few cases, use
1012C<L<NATIVE_TO_UNI(utf8_to_uvchr_buf(...))|/utf8_to_uvchr_buf>> instead.
4f83cdcd
KW
1013
1014Returns the Unicode (not-native) code point of the first character in the
1015string C<s> which
ec5f19d0
KW
1016is assumed to be in UTF-8 encoding; C<send> points to 1 beyond the end of C<s>.
1017C<retlen> will be set to the length, in bytes, of that character.
1018
524080c4
KW
1019If C<s> does not point to a well-formed UTF-8 character and UTF8 warnings are
1020enabled, zero is returned and C<*retlen> is set (if C<retlen> isn't
1021NULL) to -1. If those warnings are off, the computed value if well-defined (or
1022the Unicode REPLACEMENT CHARACTER, if not) is silently returned, and C<*retlen>
1023is set (if C<retlen> isn't NULL) so that (S<C<s> + C<*retlen>>) is the
1024next possible position in C<s> that could begin a non-malformed character.
de69f3af 1025See L</utf8n_to_uvchr> for details on when the REPLACEMENT CHARACTER is returned.
ec5f19d0 1026
760c7c2f
KW
1027Code points above the platform's C<IV_MAX> will raise a deprecation warning,
1028unless those are turned off.
1029
ec5f19d0
KW
1030=cut
1031*/
1032
1033UV
1034Perl_utf8_to_uvuni_buf(pTHX_ const U8 *s, const U8 *send, STRLEN *retlen)
1035{
1036 PERL_ARGS_ASSERT_UTF8_TO_UVUNI_BUF;
1037
1038 assert(send > s);
1039
1040 /* Call the low level routine asking for checks */
de69f3af
KW
1041 return NATIVE_TO_UNI(Perl_utf8n_to_uvchr(aTHX_ s, send -s, retlen,
1042 ckWARN_d(WARN_UTF8) ? 0 : UTF8_ALLOW_ANY));
ec5f19d0
KW
1043}
1044
b76347f2 1045/*
87cea99e 1046=for apidoc utf8_length
b76347f2
JH
1047
1048Return the length of the UTF-8 char encoded string C<s> in characters.
02eb7b47
JH
1049Stops at C<e> (inclusive). If C<e E<lt> s> or if the scan would end
1050up past C<e>, croaks.
b76347f2
JH
1051
1052=cut
1053*/
1054
1055STRLEN
35a4481c 1056Perl_utf8_length(pTHX_ const U8 *s, const U8 *e)
b76347f2
JH
1057{
1058 STRLEN len = 0;
1059
7918f24d
NC
1060 PERL_ARGS_ASSERT_UTF8_LENGTH;
1061
8850bf83
JH
1062 /* Note: cannot use UTF8_IS_...() too eagerly here since e.g.
1063 * the bitops (especially ~) can create illegal UTF-8.
1064 * In other words: in Perl UTF-8 is not just for Unicode. */
1065
a3b680e6
AL
1066 if (e < s)
1067 goto warn_and_return;
b76347f2 1068 while (s < e) {
4cbf4130 1069 s += UTF8SKIP(s);
8e91ec7f
AV
1070 len++;
1071 }
1072
1073 if (e != s) {
1074 len--;
1075 warn_and_return:
9b387841
NC
1076 if (PL_op)
1077 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8),
1078 "%s in %s", unees, OP_DESC(PL_op));
1079 else
61a12c31 1080 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8), "%s", unees);
b76347f2
JH
1081 }
1082
1083 return len;
1084}
1085
b06226ff 1086/*
87cea99e 1087=for apidoc utf8_distance
b06226ff 1088
1e54db1a 1089Returns the number of UTF-8 characters between the UTF-8 pointers C<a>
b06226ff
JH
1090and C<b>.
1091
1092WARNING: use only if you *know* that the pointers point inside the
1093same UTF-8 buffer.
1094
37607a96
PK
1095=cut
1096*/
a0ed51b3 1097
02eb7b47 1098IV
35a4481c 1099Perl_utf8_distance(pTHX_ const U8 *a, const U8 *b)
a0ed51b3 1100{
7918f24d
NC
1101 PERL_ARGS_ASSERT_UTF8_DISTANCE;
1102
bf1665bc 1103 return (a < b) ? -1 * (IV) utf8_length(a, b) : (IV) utf8_length(b, a);
a0ed51b3
LW
1104}
1105
b06226ff 1106/*
87cea99e 1107=for apidoc utf8_hop
b06226ff 1108
8850bf83
JH
1109Return the UTF-8 pointer C<s> displaced by C<off> characters, either
1110forward or backward.
b06226ff
JH
1111
1112WARNING: do not use the following unless you *know* C<off> is within
8850bf83
JH
1113the UTF-8 data pointed to by C<s> *and* that on entry C<s> is aligned
1114on the first byte of character or just after the last byte of a character.
b06226ff 1115
37607a96
PK
1116=cut
1117*/
a0ed51b3
LW
1118
1119U8 *
ddeaf645 1120Perl_utf8_hop(const U8 *s, I32 off)
a0ed51b3 1121{
7918f24d
NC
1122 PERL_ARGS_ASSERT_UTF8_HOP;
1123
8850bf83
JH
1124 /* Note: cannot use UTF8_IS_...() too eagerly here since e.g
1125 * the bitops (especially ~) can create illegal UTF-8.
1126 * In other words: in Perl UTF-8 is not just for Unicode. */
1127
a0ed51b3
LW
1128 if (off >= 0) {
1129 while (off--)
1130 s += UTF8SKIP(s);
1131 }
1132 else {
1133 while (off++) {
1134 s--;
8850bf83
JH
1135 while (UTF8_IS_CONTINUATION(*s))
1136 s--;
a0ed51b3
LW
1137 }
1138 }
4373e329 1139 return (U8 *)s;
a0ed51b3
LW
1140}
1141
6940069f 1142/*
fed3ba5d
NC
1143=for apidoc bytes_cmp_utf8
1144
a1433954 1145Compares the sequence of characters (stored as octets) in C<b>, C<blen> with the
72d33970
FC
1146sequence of characters (stored as UTF-8)
1147in C<u>, C<ulen>. Returns 0 if they are
fed3ba5d
NC
1148equal, -1 or -2 if the first string is less than the second string, +1 or +2
1149if the first string is greater than the second string.
1150
1151-1 or +1 is returned if the shorter string was identical to the start of the
72d33970
FC
1152longer string. -2 or +2 is returned if
1153there was a difference between characters
fed3ba5d
NC
1154within the strings.
1155
1156=cut
1157*/
1158
1159int
1160Perl_bytes_cmp_utf8(pTHX_ const U8 *b, STRLEN blen, const U8 *u, STRLEN ulen)
1161{
1162 const U8 *const bend = b + blen;
1163 const U8 *const uend = u + ulen;
1164
1165 PERL_ARGS_ASSERT_BYTES_CMP_UTF8;
fed3ba5d
NC
1166
1167 while (b < bend && u < uend) {
1168 U8 c = *u++;
1169 if (!UTF8_IS_INVARIANT(c)) {
1170 if (UTF8_IS_DOWNGRADEABLE_START(c)) {
1171 if (u < uend) {
1172 U8 c1 = *u++;
1173 if (UTF8_IS_CONTINUATION(c1)) {
a62b247b 1174 c = EIGHT_BIT_UTF8_TO_NATIVE(c, c1);
fed3ba5d
NC
1175 } else {
1176 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8),
1177 "Malformed UTF-8 character "
1178 "(unexpected non-continuation byte 0x%02x"
1179 ", immediately after start byte 0x%02x)"
1180 /* Dear diag.t, it's in the pod. */
1181 "%s%s", c1, c,
1182 PL_op ? " in " : "",
1183 PL_op ? OP_DESC(PL_op) : "");
1184 return -2;
1185 }
1186 } else {
1187 if (PL_op)
1188 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8),
1189 "%s in %s", unees, OP_DESC(PL_op));
1190 else
61a12c31 1191 Perl_ck_warner_d(aTHX_ packWARN(WARN_UTF8), "%s", unees);
fed3ba5d
NC
1192 return -2; /* Really want to return undef :-) */
1193 }
1194 } else {
1195 return -2;
1196 }
1197 }
1198 if (*b != c) {
1199 return *b < c ? -2 : +2;
1200 }
1201 ++b;
1202 }
1203
1204 if (b == bend && u == uend)
1205 return 0;
1206
1207 return b < bend ? +1 : -1;
1208}
1209
1210/*
87cea99e 1211=for apidoc utf8_to_bytes
6940069f 1212
2bbc8d55 1213Converts a string C<s> of length C<len> from UTF-8 into native byte encoding.
a1433954
KW
1214Unlike L</bytes_to_utf8>, this over-writes the original string, and
1215updates C<len> to contain the new length.
67e989fb 1216Returns zero on failure, setting C<len> to -1.
6940069f 1217
a1433954 1218If you need a copy of the string, see L</bytes_from_utf8>.
95be277c 1219
6940069f
GS
1220=cut
1221*/
1222
1223U8 *
37607a96 1224Perl_utf8_to_bytes(pTHX_ U8 *s, STRLEN *len)
6940069f 1225{
d4c19fe8
AL
1226 U8 * const save = s;
1227 U8 * const send = s + *len;
6940069f 1228 U8 *d;
246fae53 1229
7918f24d 1230 PERL_ARGS_ASSERT_UTF8_TO_BYTES;
81611534 1231 PERL_UNUSED_CONTEXT;
7918f24d 1232
1e54db1a 1233 /* ensure valid UTF-8 and chars < 256 before updating string */
d4c19fe8 1234 while (s < send) {
d59937ca
KW
1235 if (! UTF8_IS_INVARIANT(*s)) {
1236 if (! UTF8_IS_NEXT_CHAR_DOWNGRADEABLE(s, send)) {
1237 *len = ((STRLEN) -1);
1238 return 0;
1239 }
1240 s++;
dcad2880 1241 }
d59937ca 1242 s++;
246fae53 1243 }
dcad2880
JH
1244
1245 d = s = save;
6940069f 1246 while (s < send) {
80e0b38f
KW
1247 U8 c = *s++;
1248 if (! UTF8_IS_INVARIANT(c)) {
1249 /* Then it is two-byte encoded */
a62b247b 1250 c = EIGHT_BIT_UTF8_TO_NATIVE(c, *s);
80e0b38f
KW
1251 s++;
1252 }
1253 *d++ = c;
6940069f
GS
1254 }
1255 *d = '\0';
246fae53 1256 *len = d - save;
6940069f
GS
1257 return save;
1258}
1259
1260/*
87cea99e 1261=for apidoc bytes_from_utf8
f9a63242 1262
2bbc8d55 1263Converts a string C<s> of length C<len> from UTF-8 into native byte encoding.
a1433954 1264Unlike L</utf8_to_bytes> but like L</bytes_to_utf8>, returns a pointer to
ef9edfd0
JH
1265the newly-created string, and updates C<len> to contain the new
1266length. Returns the original string if no conversion occurs, C<len>
72d33970 1267is unchanged. Do nothing if C<is_utf8> points to 0. Sets C<is_utf8> to
2bbc8d55 12680 if C<s> is converted or consisted entirely of characters that are invariant
4a4088c4 1269in UTF-8 (i.e., US-ASCII on non-EBCDIC machines).
f9a63242 1270
37607a96
PK
1271=cut
1272*/
f9a63242
JH
1273
1274U8 *
e1ec3a88 1275Perl_bytes_from_utf8(pTHX_ const U8 *s, STRLEN *len, bool *is_utf8)
f9a63242 1276{
f9a63242 1277 U8 *d;
e1ec3a88
AL
1278 const U8 *start = s;
1279 const U8 *send;
f9a63242
JH
1280 I32 count = 0;
1281
7918f24d 1282 PERL_ARGS_ASSERT_BYTES_FROM_UTF8;
96a5add6 1283 PERL_UNUSED_CONTEXT;
f9a63242 1284 if (!*is_utf8)
73d840c0 1285 return (U8 *)start;
f9a63242 1286
1e54db1a 1287 /* ensure valid UTF-8 and chars < 256 before converting string */
f9a63242 1288 for (send = s + *len; s < send;) {
d59937ca
KW
1289 if (! UTF8_IS_INVARIANT(*s)) {
1290 if (! UTF8_IS_NEXT_CHAR_DOWNGRADEABLE(s, send)) {
73d840c0 1291 return (U8 *)start;
d59937ca
KW
1292 }
1293 count++;
1294 s++;
db42d148 1295 }
d59937ca 1296 s++;
f9a63242
JH
1297 }
1298
35da51f7 1299 *is_utf8 = FALSE;
f9a63242 1300
212542aa 1301 Newx(d, (*len) - count + 1, U8);
ef9edfd0 1302 s = start; start = d;
f9a63242
JH
1303 while (s < send) {
1304 U8 c = *s++;
1a91c45d 1305 if (! UTF8_IS_INVARIANT(c)) {
c4d5f83a 1306 /* Then it is two-byte encoded */
a62b247b 1307 c = EIGHT_BIT_UTF8_TO_NATIVE(c, *s);
1a91c45d 1308 s++;
c4d5f83a
NIS
1309 }
1310 *d++ = c;
f9a63242
JH
1311 }
1312 *d = '\0';
1313 *len = d - start;
73d840c0 1314 return (U8 *)start;
f9a63242
JH
1315}
1316
1317/*
87cea99e 1318=for apidoc bytes_to_utf8
6940069f 1319
ff97e5cf
KW
1320Converts a string C<s> of length C<len> bytes from the native encoding into
1321UTF-8.
6662521e 1322Returns a pointer to the newly-created string, and sets C<len> to
ff97e5cf 1323reflect the new length in bytes.
6940069f 1324
75200dff 1325A C<NUL> character will be written after the end of the string.
2bbc8d55
SP
1326
1327If you want to convert to UTF-8 from encodings other than
1328the native (Latin1 or EBCDIC),
a1433954 1329see L</sv_recode_to_utf8>().
c9ada85f 1330
497711e7 1331=cut
6940069f
GS
1332*/
1333
c682ebef
FC
1334/* This logic is duplicated in sv_catpvn_flags, so any bug fixes will
1335 likewise need duplication. */
1336
6940069f 1337U8*
35a4481c 1338Perl_bytes_to_utf8(pTHX_ const U8 *s, STRLEN *len)
6940069f 1339{
35a4481c 1340 const U8 * const send = s + (*len);
6940069f
GS
1341 U8 *d;
1342 U8 *dst;
7918f24d
NC
1343
1344 PERL_ARGS_ASSERT_BYTES_TO_UTF8;
96a5add6 1345 PERL_UNUSED_CONTEXT;
6940069f 1346
212542aa 1347 Newx(d, (*len) * 2 + 1, U8);
6940069f
GS
1348 dst = d;
1349
1350 while (s < send) {
55d09dc8
KW
1351 append_utf8_from_native_byte(*s, &d);
1352 s++;
6940069f
GS
1353 }
1354 *d = '\0';
6662521e 1355 *len = d-dst;
6940069f
GS
1356 return dst;
1357}
1358
a0ed51b3 1359/*
dea0fc0b 1360 * Convert native (big-endian) or reversed (little-endian) UTF-16 to UTF-8.
a0ed51b3
LW
1361 *
1362 * Destination must be pre-extended to 3/2 source. Do not use in-place.
1363 * We optimize for native, for obvious reasons. */
1364
1365U8*
dea0fc0b 1366Perl_utf16_to_utf8(pTHX_ U8* p, U8* d, I32 bytelen, I32 *newlen)
a0ed51b3 1367{
dea0fc0b
JH
1368 U8* pend;
1369 U8* dstart = d;
1370
7918f24d
NC
1371 PERL_ARGS_ASSERT_UTF16_TO_UTF8;
1372
dea0fc0b 1373 if (bytelen & 1)
f5992bc4 1374 Perl_croak(aTHX_ "panic: utf16_to_utf8: odd bytelen %"UVuf, (UV)bytelen);
dea0fc0b
JH
1375
1376 pend = p + bytelen;
1377
a0ed51b3 1378 while (p < pend) {
dea0fc0b
JH
1379 UV uv = (p[0] << 8) + p[1]; /* UTF-16BE */
1380 p += 2;
2d1545e5 1381 if (OFFUNI_IS_INVARIANT(uv)) {
56d37426 1382 *d++ = LATIN1_TO_NATIVE((U8) uv);
a0ed51b3
LW
1383 continue;
1384 }
56d37426
KW
1385 if (uv <= MAX_UTF8_TWO_BYTE) {
1386 *d++ = UTF8_TWO_BYTE_HI(UNI_TO_NATIVE(uv));
1387 *d++ = UTF8_TWO_BYTE_LO(UNI_TO_NATIVE(uv));
a0ed51b3
LW
1388 continue;
1389 }
46956fad
KW
1390#define FIRST_HIGH_SURROGATE UNICODE_SURROGATE_FIRST
1391#define LAST_HIGH_SURROGATE 0xDBFF
1392#define FIRST_LOW_SURROGATE 0xDC00
1393#define LAST_LOW_SURROGATE UNICODE_SURROGATE_LAST
e23c50db
KW
1394
1395 /* This assumes that most uses will be in the first Unicode plane, not
1396 * needing surrogates */
1397 if (UNLIKELY(uv >= UNICODE_SURROGATE_FIRST
1398 && uv <= UNICODE_SURROGATE_LAST))
1399 {
1400 if (UNLIKELY(p >= pend) || UNLIKELY(uv > LAST_HIGH_SURROGATE)) {
1401 Perl_croak(aTHX_ "Malformed UTF-16 surrogate");
1402 }
1403 else {
01ea242b 1404 UV low = (p[0] << 8) + p[1];
e23c50db
KW
1405 if ( UNLIKELY(low < FIRST_LOW_SURROGATE)
1406 || UNLIKELY(low > LAST_LOW_SURROGATE))
1407 {
01ea242b 1408 Perl_croak(aTHX_ "Malformed UTF-16 surrogate");
e23c50db
KW
1409 }
1410 p += 2;
46956fad
KW
1411 uv = ((uv - FIRST_HIGH_SURROGATE) << 10)
1412 + (low - FIRST_LOW_SURROGATE) + 0x10000;
01ea242b 1413 }
a0ed51b3 1414 }
56d37426
KW
1415#ifdef EBCDIC
1416 d = uvoffuni_to_utf8_flags(d, uv, 0);
1417#else
a0ed51b3 1418 if (uv < 0x10000) {
eb160463
GS
1419 *d++ = (U8)(( uv >> 12) | 0xe0);
1420 *d++ = (U8)(((uv >> 6) & 0x3f) | 0x80);
1421 *d++ = (U8)(( uv & 0x3f) | 0x80);
a0ed51b3
LW
1422 continue;
1423 }
1424 else {
eb160463
GS
1425 *d++ = (U8)(( uv >> 18) | 0xf0);
1426 *d++ = (U8)(((uv >> 12) & 0x3f) | 0x80);
1427 *d++ = (U8)(((uv >> 6) & 0x3f) | 0x80);
1428 *d++ = (U8)(( uv & 0x3f) | 0x80);
a0ed51b3
LW
1429 continue;
1430 }
56d37426 1431#endif
a0ed51b3 1432 }
dea0fc0b 1433 *newlen = d - dstart;
a0ed51b3
LW
1434 return d;
1435}
1436
1437/* Note: this one is slightly destructive of the source. */
1438
1439U8*
dea0fc0b 1440Perl_utf16_to_utf8_reversed(pTHX_ U8* p, U8* d, I32 bytelen, I32 *newlen)
a0ed51b3
LW
1441{
1442 U8* s = (U8*)p;
d4c19fe8 1443 U8* const send = s + bytelen;
7918f24d
NC
1444
1445 PERL_ARGS_ASSERT_UTF16_TO_UTF8_REVERSED;
1446
e0ea5e2d
NC
1447 if (bytelen & 1)
1448 Perl_croak(aTHX_ "panic: utf16_to_utf8_reversed: odd bytelen %"UVuf,
1449 (UV)bytelen);
1450
a0ed51b3 1451 while (s < send) {
d4c19fe8 1452 const U8 tmp = s[0];
a0ed51b3
LW
1453 s[0] = s[1];
1454 s[1] = tmp;
1455 s += 2;
1456 }
dea0fc0b 1457 return utf16_to_utf8(p, d, bytelen, newlen);
a0ed51b3
LW
1458}
1459
922e8cb4
KW
1460bool
1461Perl__is_uni_FOO(pTHX_ const U8 classnum, const UV c)
1462{
1463 U8 tmpbuf[UTF8_MAXBYTES+1];
1464 uvchr_to_utf8(tmpbuf, c);
1465 return _is_utf8_FOO(classnum, tmpbuf);
1466}
1467
f9ae8fb6
JD
1468/* Internal function so we can deprecate the external one, and call
1469 this one from other deprecated functions in this file */
1470
f2645549
KW
1471bool
1472Perl__is_utf8_idstart(pTHX_ const U8 *p)
61b19385 1473{
f2645549 1474 PERL_ARGS_ASSERT__IS_UTF8_IDSTART;
61b19385
KW
1475
1476 if (*p == '_')
1477 return TRUE;
f25ce844 1478 return is_utf8_common(p, &PL_utf8_idstart, "IdStart", NULL);
61b19385
KW
1479}
1480
5092f92a 1481bool
eba68aa0
KW
1482Perl__is_uni_perl_idcont(pTHX_ UV c)
1483{
1484 U8 tmpbuf[UTF8_MAXBYTES+1];
1485 uvchr_to_utf8(tmpbuf, c);
1486 return _is_utf8_perl_idcont(tmpbuf);
1487}
1488
1489bool
f91dcd13
KW
1490Perl__is_uni_perl_idstart(pTHX_ UV c)
1491{
1492 U8 tmpbuf[UTF8_MAXBYTES+1];
1493 uvchr_to_utf8(tmpbuf, c);
1494 return _is_utf8_perl_idstart(tmpbuf);
1495}
1496
3a4c58c9
KW
1497UV
1498Perl__to_upper_title_latin1(pTHX_ const U8 c, U8* p, STRLEN *lenp, const char S_or_s)
1499{
1500 /* We have the latin1-range values compiled into the core, so just use
4a4088c4 1501 * those, converting the result to UTF-8. The only difference between upper
3a4c58c9
KW
1502 * and title case in this range is that LATIN_SMALL_LETTER_SHARP_S is
1503 * either "SS" or "Ss". Which one to use is passed into the routine in
1504 * 'S_or_s' to avoid a test */
1505
1506 UV converted = toUPPER_LATIN1_MOD(c);
1507
1508 PERL_ARGS_ASSERT__TO_UPPER_TITLE_LATIN1;
1509
1510 assert(S_or_s == 'S' || S_or_s == 's');
1511
6f2d5cbc 1512 if (UVCHR_IS_INVARIANT(converted)) { /* No difference between the two for
f4cd282c 1513 characters in this range */
3a4c58c9
KW
1514 *p = (U8) converted;
1515 *lenp = 1;
1516 return converted;
1517 }
1518
1519 /* toUPPER_LATIN1_MOD gives the correct results except for three outliers,
1520 * which it maps to one of them, so as to only have to have one check for
1521 * it in the main case */
1522 if (UNLIKELY(converted == LATIN_SMALL_LETTER_Y_WITH_DIAERESIS)) {
1523 switch (c) {
1524 case LATIN_SMALL_LETTER_Y_WITH_DIAERESIS:
1525 converted = LATIN_CAPITAL_LETTER_Y_WITH_DIAERESIS;
1526 break;
1527 case MICRO_SIGN:
1528 converted = GREEK_CAPITAL_LETTER_MU;
1529 break;
79e064b9
KW
1530#if UNICODE_MAJOR_VERSION > 2 \
1531 || (UNICODE_MAJOR_VERSION == 2 && UNICODE_DOT_VERSION >= 1 \
1532 && UNICODE_DOT_DOT_VERSION >= 8)
3a4c58c9
KW
1533 case LATIN_SMALL_LETTER_SHARP_S:
1534 *(p)++ = 'S';
1535 *p = S_or_s;
1536 *lenp = 2;
1537 return 'S';
79e064b9 1538#endif
3a4c58c9
KW
1539 default:
1540 Perl_croak(aTHX_ "panic: to_upper_title_latin1 did not expect '%c' to map to '%c'", c, LATIN_SMALL_LETTER_Y_WITH_DIAERESIS);
e5964223 1541 NOT_REACHED; /* NOTREACHED */
3a4c58c9
KW
1542 }
1543 }
1544
1545 *(p)++ = UTF8_TWO_BYTE_HI(converted);
1546 *p = UTF8_TWO_BYTE_LO(converted);
1547 *lenp = 2;
1548
1549 return converted;
1550}
1551
50bda2c3
KW
1552/* Call the function to convert a UTF-8 encoded character to the specified case.
1553 * Note that there may be more than one character in the result.
1554 * INP is a pointer to the first byte of the input character
1555 * OUTP will be set to the first byte of the string of changed characters. It
1556 * needs to have space for UTF8_MAXBYTES_CASE+1 bytes
1557 * LENP will be set to the length in bytes of the string of changed characters
1558 *
1559 * The functions return the ordinal of the first character in the string of OUTP */
4a8240a3
KW
1560#define CALL_UPPER_CASE(INP, OUTP, LENP) Perl_to_utf8_case(aTHX_ INP, OUTP, LENP, &PL_utf8_toupper, "ToUc", "")
1561#define CALL_TITLE_CASE(INP, OUTP, LENP) Perl_to_utf8_case(aTHX_ INP, OUTP, LENP, &PL_utf8_totitle, "ToTc", "")
1562#define CALL_LOWER_CASE(INP, OUTP, LENP) Perl_to_utf8_case(aTHX_ INP, OUTP, LENP, &PL_utf8_tolower, "ToLc", "")
50bda2c3
KW
1563
1564/* This additionally has the input parameter SPECIALS, which if non-zero will
1565 * cause this to use the SPECIALS hash for folding (meaning get full case
1566 * folding); otherwise, when zero, this implies a simple case fold */
4a8240a3 1567#define CALL_FOLD_CASE(INP, OUTP, LENP, SPECIALS) Perl_to_utf8_case(aTHX_ INP, OUTP, LENP, &PL_utf8_tofold, "ToCf", (SPECIALS) ? "" : NULL)
c3fd2246 1568
84afefe6
JH
1569UV
1570Perl_to_uni_upper(pTHX_ UV c, U8* p, STRLEN *lenp)
a0ed51b3 1571{
a1433954
KW
1572 /* Convert the Unicode character whose ordinal is <c> to its uppercase
1573 * version and store that in UTF-8 in <p> and its length in bytes in <lenp>.
1574 * Note that the <p> needs to be at least UTF8_MAXBYTES_CASE+1 bytes since
c3fd2246
KW
1575 * the changed version may be longer than the original character.
1576 *
1577 * The ordinal of the first character of the changed version is returned
1578 * (but note, as explained above, that there may be more.) */
1579
7918f24d
NC
1580 PERL_ARGS_ASSERT_TO_UNI_UPPER;
1581
3a4c58c9
KW
1582 if (c < 256) {
1583 return _to_upper_title_latin1((U8) c, p, lenp, 'S');
1584 }
1585
0ebc6274 1586 uvchr_to_utf8(p, c);
3a4c58c9 1587 return CALL_UPPER_CASE(p, p, lenp);
a0ed51b3
LW
1588}
1589
84afefe6
JH
1590UV
1591Perl_to_uni_title(pTHX_ UV c, U8* p, STRLEN *lenp)
a0ed51b3 1592{
7918f24d
NC
1593 PERL_ARGS_ASSERT_TO_UNI_TITLE;
1594
3a4c58c9
KW
1595 if (c < 256) {
1596 return _to_upper_title_latin1((U8) c, p, lenp, 's');
1597 }
1598
0ebc6274 1599 uvchr_to_utf8(p, c);
3a4c58c9 1600 return CALL_TITLE_CASE(p, p, lenp);
a0ed51b3
LW
1601}
1602
afc16117 1603STATIC U8
81611534 1604S_to_lower_latin1(const U8 c, U8* p, STRLEN *lenp)
afc16117
KW
1605{
1606 /* We have the latin1-range values compiled into the core, so just use
4a4088c4 1607 * those, converting the result to UTF-8. Since the result is always just
a1433954 1608 * one character, we allow <p> to be NULL */
afc16117
KW
1609
1610 U8 converted = toLOWER_LATIN1(c);
1611
1612 if (p != NULL) {
6f2d5cbc 1613 if (NATIVE_BYTE_IS_INVARIANT(converted)) {
afc16117
KW
1614 *p = converted;
1615 *lenp = 1;
1616 }
1617 else {
430c9760
KW
1618 /* Result is known to always be < 256, so can use the EIGHT_BIT
1619 * macros */
1620 *p = UTF8_EIGHT_BIT_HI(converted);
1621 *(p+1) = UTF8_EIGHT_BIT_LO(converted);
afc16117
KW
1622 *lenp = 2;
1623 }
1624 }
1625 return converted;
1626}
1627
84afefe6
JH
1628UV
1629Perl_to_uni_lower(pTHX_ UV c, U8* p, STRLEN *lenp)
a0ed51b3 1630{
7918f24d
NC
1631 PERL_ARGS_ASSERT_TO_UNI_LOWER;
1632
afc16117
KW
1633 if (c < 256) {
1634 return to_lower_latin1((U8) c, p, lenp);
bca00c02
KW
1635 }
1636
afc16117 1637 uvchr_to_utf8(p, c);
968c5e6a 1638 return CALL_LOWER_CASE(p, p, lenp);
a0ed51b3
LW
1639}
1640
84afefe6 1641UV
51910141 1642Perl__to_fold_latin1(pTHX_ const U8 c, U8* p, STRLEN *lenp, const unsigned int flags)
a1dde8de 1643{
51910141 1644 /* Corresponds to to_lower_latin1(); <flags> bits meanings:
1ca267a5 1645 * FOLD_FLAGS_NOMIX_ASCII iff non-ASCII to ASCII folds are prohibited
51910141 1646 * FOLD_FLAGS_FULL iff full folding is to be used;
1ca267a5
KW
1647 *
1648 * Not to be used for locale folds
51910141 1649 */
f673fad4 1650
a1dde8de
KW
1651 UV converted;
1652
1653 PERL_ARGS_ASSERT__TO_FOLD_LATIN1;
81611534 1654 PERL_UNUSED_CONTEXT;
a1dde8de 1655
1ca267a5
KW
1656 assert (! (flags & FOLD_FLAGS_LOCALE));
1657
659a7c2d 1658 if (UNLIKELY(c == MICRO_SIGN)) {
a1dde8de
KW
1659 converted = GREEK_SMALL_LETTER_MU;
1660 }
9b63e895
KW
1661#if UNICODE_MAJOR_VERSION > 3 /* no multifolds in early Unicode */ \
1662 || (UNICODE_MAJOR_VERSION == 3 && ( UNICODE_DOT_VERSION > 0) \
1663 || UNICODE_DOT_DOT_VERSION > 0)
659a7c2d
KW
1664 else if ( (flags & FOLD_FLAGS_FULL)
1665 && UNLIKELY(c == LATIN_SMALL_LETTER_SHARP_S))
1666 {
1ca267a5
KW
1667 /* If can't cross 127/128 boundary, can't return "ss"; instead return
1668 * two U+017F characters, as fc("\df") should eq fc("\x{17f}\x{17f}")
1669 * under those circumstances. */
1670 if (flags & FOLD_FLAGS_NOMIX_ASCII) {
1671 *lenp = 2 * sizeof(LATIN_SMALL_LETTER_LONG_S_UTF8) - 2;
1672 Copy(LATIN_SMALL_LETTER_LONG_S_UTF8 LATIN_SMALL_LETTER_LONG_S_UTF8,
1673 p, *lenp, U8);
1674 return LATIN_SMALL_LETTER_LONG_S;
1675 }
1676 else {
4f489194
KW
1677 *(p)++ = 's';
1678 *p = 's';
1679 *lenp = 2;
1680 return 's';
1ca267a5 1681 }
a1dde8de 1682 }
9b63e895 1683#endif
a1dde8de
KW
1684 else { /* In this range the fold of all other characters is their lower
1685 case */
1686 converted = toLOWER_LATIN1(c);
1687 }
1688
6f2d5cbc 1689 if (UVCHR_IS_INVARIANT(converted)) {
a1dde8de
KW
1690 *p = (U8) converted;
1691 *lenp = 1;
1692 }
1693 else {
1694 *(p)++ = UTF8_TWO_BYTE_HI(converted);
1695 *p = UTF8_TWO_BYTE_LO(converted);
1696 *lenp = 2;
1697 }
1698
1699 return converted;
1700}
1701
1702UV
31f05a37 1703Perl__to_uni_fold_flags(pTHX_ UV c, U8* p, STRLEN *lenp, U8 flags)
84afefe6 1704{
4b593389 1705
a0270393
KW
1706 /* Not currently externally documented, and subject to change
1707 * <flags> bits meanings:
1708 * FOLD_FLAGS_FULL iff full folding is to be used;
31f05a37
KW
1709 * FOLD_FLAGS_LOCALE is set iff the rules from the current underlying
1710 * locale are to be used.
a0270393
KW
1711 * FOLD_FLAGS_NOMIX_ASCII iff non-ASCII to ASCII folds are prohibited
1712 */
4b593389 1713
36bb2ab6 1714 PERL_ARGS_ASSERT__TO_UNI_FOLD_FLAGS;
7918f24d 1715
780fcc9f
KW
1716 if (flags & FOLD_FLAGS_LOCALE) {
1717 /* Treat a UTF-8 locale as not being in locale at all */
1718 if (IN_UTF8_CTYPE_LOCALE) {
1719 flags &= ~FOLD_FLAGS_LOCALE;
1720 }
1721 else {
1722 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
e7b7ac46 1723 goto needs_full_generality;
780fcc9f 1724 }
31f05a37
KW
1725 }
1726
a1dde8de 1727 if (c < 256) {
e7b7ac46 1728 return _to_fold_latin1((U8) c, p, lenp,
31f05a37 1729 flags & (FOLD_FLAGS_FULL | FOLD_FLAGS_NOMIX_ASCII));
a1dde8de
KW
1730 }
1731
2f306ab9 1732 /* Here, above 255. If no special needs, just use the macro */
a0270393
KW
1733 if ( ! (flags & (FOLD_FLAGS_LOCALE|FOLD_FLAGS_NOMIX_ASCII))) {
1734 uvchr_to_utf8(p, c);
1735 return CALL_FOLD_CASE(p, p, lenp, flags & FOLD_FLAGS_FULL);
1736 }
1737 else { /* Otherwise, _to_utf8_fold_flags has the intelligence to deal with
1738 the special flags. */
1739 U8 utf8_c[UTF8_MAXBYTES + 1];
e7b7ac46
KW
1740
1741 needs_full_generality:
a0270393 1742 uvchr_to_utf8(utf8_c, c);
445bf929 1743 return _to_utf8_fold_flags(utf8_c, p, lenp, flags);
a0270393 1744 }
84afefe6
JH
1745}
1746
26483009 1747PERL_STATIC_INLINE bool
5141f98e 1748S_is_utf8_common(pTHX_ const U8 *const p, SV **swash,
f25ce844 1749 const char *const swashname, SV* const invlist)
bde6a22d 1750{
ea317ccb
KW
1751 /* returns a boolean giving whether or not the UTF8-encoded character that
1752 * starts at <p> is in the swash indicated by <swashname>. <swash>
1753 * contains a pointer to where the swash indicated by <swashname>
1754 * is to be stored; which this routine will do, so that future calls will
f25ce844
KW
1755 * look at <*swash> and only generate a swash if it is not null. <invlist>
1756 * is NULL or an inversion list that defines the swash. If not null, it
1757 * saves time during initialization of the swash.
ea317ccb
KW
1758 *
1759 * Note that it is assumed that the buffer length of <p> is enough to
1760 * contain all the bytes that comprise the character. Thus, <*p> should
1761 * have been checked before this call for mal-formedness enough to assure
1762 * that. */
1763
7918f24d
NC
1764 PERL_ARGS_ASSERT_IS_UTF8_COMMON;
1765
492a624f 1766 /* The API should have included a length for the UTF-8 character in <p>,
28123549 1767 * but it doesn't. We therefore assume that p has been validated at least
492a624f
KW
1768 * as far as there being enough bytes available in it to accommodate the
1769 * character without reading beyond the end, and pass that number on to the
1770 * validating routine */
6302f837 1771 if (! isUTF8_CHAR(p, p + UTF8SKIP(p))) {
28123549
KW
1772 if (ckWARN_d(WARN_UTF8)) {
1773 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED,WARN_UTF8),
9816f121 1774 "Passing malformed UTF-8 to \"%s\" is deprecated", swashname);
28123549
KW
1775 if (ckWARN(WARN_UTF8)) { /* This will output details as to the
1776 what the malformation is */
1777 utf8_to_uvchr_buf(p, p + UTF8SKIP(p), NULL);
1778 }
1779 }
1780 return FALSE;
1781 }
87367d5f
KW
1782 if (!*swash) {
1783 U8 flags = _CORE_SWASH_INIT_ACCEPT_INVLIST;
f25ce844
KW
1784 *swash = _core_swash_init("utf8",
1785
1786 /* Only use the name if there is no inversion
1787 * list; otherwise will go out to disk */
1788 (invlist) ? "" : swashname,
1789
1790 &PL_sv_undef, 1, 0, invlist, &flags);
87367d5f 1791 }
28123549 1792
bde6a22d
NC
1793 return swash_fetch(*swash, p, TRUE) != 0;
1794}
1795
1796bool
922e8cb4
KW
1797Perl__is_utf8_FOO(pTHX_ const U8 classnum, const U8 *p)
1798{
922e8cb4
KW
1799 PERL_ARGS_ASSERT__IS_UTF8_FOO;
1800
1801 assert(classnum < _FIRST_NON_SWASH_CC);
1802
f25ce844
KW
1803 return is_utf8_common(p,
1804 &PL_utf8_swash_ptrs[classnum],
1805 swash_property_names[classnum],
1806 PL_XPosix_ptrs[classnum]);
922e8cb4
KW
1807}
1808
1809bool
f2645549 1810Perl__is_utf8_perl_idstart(pTHX_ const U8 *p)
a0ed51b3 1811{
f2645549 1812 SV* invlist = NULL;
7918f24d 1813
f2645549 1814 PERL_ARGS_ASSERT__IS_UTF8_PERL_IDSTART;
7918f24d 1815
f2645549
KW
1816 if (! PL_utf8_perl_idstart) {
1817 invlist = _new_invlist_C_array(_Perl_IDStart_invlist);
1818 }
60071a22 1819 return is_utf8_common(p, &PL_utf8_perl_idstart, "_Perl_IDStart", invlist);
82686b01
JH
1820}
1821
1822bool
f2645549 1823Perl__is_utf8_xidstart(pTHX_ const U8 *p)
c11ff943 1824{
f2645549 1825 PERL_ARGS_ASSERT__IS_UTF8_XIDSTART;
c11ff943
KW
1826
1827 if (*p == '_')
1828 return TRUE;
f25ce844 1829 return is_utf8_common(p, &PL_utf8_xidstart, "XIdStart", NULL);
c11ff943
KW
1830}
1831
1832bool
eba68aa0
KW
1833Perl__is_utf8_perl_idcont(pTHX_ const U8 *p)
1834{
b24b43f7 1835 SV* invlist = NULL;
eba68aa0
KW
1836
1837 PERL_ARGS_ASSERT__IS_UTF8_PERL_IDCONT;
1838
b24b43f7
KW
1839 if (! PL_utf8_perl_idcont) {
1840 invlist = _new_invlist_C_array(_Perl_IDCont_invlist);
1841 }
60071a22 1842 return is_utf8_common(p, &PL_utf8_perl_idcont, "_Perl_IDCont", invlist);
eba68aa0
KW
1843}
1844
eba68aa0 1845bool
f2645549 1846Perl__is_utf8_idcont(pTHX_ const U8 *p)
82686b01 1847{
f2645549 1848 PERL_ARGS_ASSERT__IS_UTF8_IDCONT;
7918f24d 1849
f25ce844 1850 return is_utf8_common(p, &PL_utf8_idcont, "IdContinue", NULL);
a0ed51b3
LW
1851}
1852
1853bool
f2645549 1854Perl__is_utf8_xidcont(pTHX_ const U8 *p)
c11ff943 1855{
f2645549 1856 PERL_ARGS_ASSERT__IS_UTF8_XIDCONT;
c11ff943 1857
f25ce844 1858 return is_utf8_common(p, &PL_utf8_idcont, "XIdContinue", NULL);
c11ff943
KW
1859}
1860
1861bool
7dbf68d2
KW
1862Perl__is_utf8_mark(pTHX_ const U8 *p)
1863{
7dbf68d2
KW
1864 PERL_ARGS_ASSERT__IS_UTF8_MARK;
1865
f25ce844 1866 return is_utf8_common(p, &PL_utf8_mark, "IsM", NULL);
7dbf68d2
KW
1867}
1868
6b5c0936 1869/*
87cea99e 1870=for apidoc to_utf8_case
6b5c0936 1871
9da1e7cb
KW
1872Instead use the appropriate one of L</toUPPER_utf8>,
1873L</toTITLE_utf8>,
1874L</toLOWER_utf8>,
1875or L</toFOLD_utf8>.
1876
6fae5207 1877C<p> contains the pointer to the UTF-8 string encoding
a1433954
KW
1878the character that is being converted. This routine assumes that the character
1879at C<p> is well-formed.
6b5c0936 1880
6fae5207
KW
1881C<ustrp> is a pointer to the character buffer to put the
1882conversion result to. C<lenp> is a pointer to the length
6b5c0936
JH
1883of the result.
1884
6fae5207 1885C<swashp> is a pointer to the swash to use.
6b5c0936 1886
a1433954 1887Both the special and normal mappings are stored in F<lib/unicore/To/Foo.pl>,
796b6530 1888and loaded by C<SWASHNEW>, using F<lib/utf8_heavy.pl>. C<special> (usually,
0134edef 1889but not always, a multicharacter mapping), is tried first.
6b5c0936 1890
4a8240a3
KW
1891C<special> is a string, normally C<NULL> or C<"">. C<NULL> means to not use
1892any special mappings; C<""> means to use the special mappings. Values other
1893than these two are treated as the name of the hash containing the special
1894mappings, like C<"utf8::ToSpecLower">.
6b5c0936 1895
796b6530
KW
1896C<normal> is a string like C<"ToLower"> which means the swash
1897C<%utf8::ToLower>.
0134edef 1898
760c7c2f
KW
1899Code points above the platform's C<IV_MAX> will raise a deprecation warning,
1900unless those are turned off.
1901
0134edef 1902=cut */
6b5c0936 1903
2104c8d9 1904UV
9a957fbc
AL
1905Perl_to_utf8_case(pTHX_ const U8 *p, U8* ustrp, STRLEN *lenp,
1906 SV **swashp, const char *normal, const char *special)
a0ed51b3 1907{
0134edef 1908 STRLEN len = 0;
f4cd282c 1909 const UV uv1 = valid_utf8_to_uvchr(p, NULL);
7918f24d
NC
1910
1911 PERL_ARGS_ASSERT_TO_UTF8_CASE;
1912
9ae3ac1a
KW
1913 /* Note that swash_fetch() doesn't output warnings for these because it
1914 * assumes we will */
8457b38f 1915 if (uv1 >= UNICODE_SURROGATE_FIRST) {
659a7c2d 1916 if (UNLIKELY(uv1 <= UNICODE_SURROGATE_LAST)) {
8457b38f
KW
1917 if (ckWARN_d(WARN_SURROGATE)) {
1918 const char* desc = (PL_op) ? OP_DESC(PL_op) : normal;
1919 Perl_warner(aTHX_ packWARN(WARN_SURROGATE),
1920 "Operation \"%s\" returns its argument for UTF-16 surrogate U+%04"UVXf"", desc, uv1);
1921 }
9ae3ac1a 1922 }
659a7c2d 1923 else if (UNLIKELY(UNICODE_IS_SUPER(uv1))) {
760c7c2f
KW
1924 if ( UNLIKELY(uv1 > MAX_NON_DEPRECATED_CP)
1925 && ckWARN_d(WARN_DEPRECATED))
1926 {
1927 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
1928 cp_above_legal_max, uv1, MAX_NON_DEPRECATED_CP);
1929 }
8457b38f
KW
1930 if (ckWARN_d(WARN_NON_UNICODE)) {
1931 const char* desc = (PL_op) ? OP_DESC(PL_op) : normal;
1932 Perl_warner(aTHX_ packWARN(WARN_NON_UNICODE),
1933 "Operation \"%s\" returns its argument for non-Unicode code point 0x%04"UVXf"", desc, uv1);
1934 }
9ae3ac1a
KW
1935 }
1936
1937 /* Note that non-characters are perfectly legal, so no warning should
1938 * be given */
1939 }
1940
0134edef 1941 if (!*swashp) /* load on-demand */
5ab9d2ef 1942 *swashp = _core_swash_init("utf8", normal, &PL_sv_undef, 4, 0, NULL, NULL);
0134edef 1943
a6f87d8c 1944 if (special) {
0134edef 1945 /* It might be "special" (sometimes, but not always,
2a37f04d 1946 * a multicharacter mapping) */
4a8240a3 1947 HV *hv = NULL;
b08cf34e
JH
1948 SV **svp;
1949
4a8240a3
KW
1950 /* If passed in the specials name, use that; otherwise use any
1951 * given in the swash */
1952 if (*special != '\0') {
1953 hv = get_hv(special, 0);
1954 }
1955 else {
1956 svp = hv_fetchs(MUTABLE_HV(SvRV(*swashp)), "SPECIALS", 0);
1957 if (svp) {
1958 hv = MUTABLE_HV(SvRV(*svp));
1959 }
1960 }
1961
176fe009 1962 if (hv
5f560d8a 1963 && (svp = hv_fetch(hv, (const char*)p, UVCHR_SKIP(uv1), FALSE))
176fe009
KW
1964 && (*svp))
1965 {
cfd0369c 1966 const char *s;
47654450 1967
cfd0369c 1968 s = SvPV_const(*svp, len);
47654450 1969 if (len == 1)
f4cd282c 1970 /* EIGHTBIT */
c80e42f3 1971 len = uvchr_to_utf8(ustrp, *(U8*)s) - ustrp;
2a37f04d 1972 else {
d2dcd0fb 1973 Copy(s, ustrp, len, U8);
29e98929 1974 }
983ffd37 1975 }
0134edef
JH
1976 }
1977
1978 if (!len && *swashp) {
4a4088c4 1979 const UV uv2 = swash_fetch(*swashp, p, TRUE /* => is UTF-8 */);
d4c19fe8 1980
0134edef
JH
1981 if (uv2) {
1982 /* It was "normal" (a single character mapping). */
f4cd282c 1983 len = uvchr_to_utf8(ustrp, uv2) - ustrp;
2a37f04d
JH
1984 }
1985 }
1feea2c7 1986
cbe07460
KW
1987 if (len) {
1988 if (lenp) {
1989 *lenp = len;
1990 }
1991 return valid_utf8_to_uvchr(ustrp, 0);
1992 }
1993
1994 /* Here, there was no mapping defined, which means that the code point maps
1995 * to itself. Return the inputs */
bfdf22ec 1996 len = UTF8SKIP(p);
ca9fab46
KW
1997 if (p != ustrp) { /* Don't copy onto itself */
1998 Copy(p, ustrp, len, U8);
1999 }
0134edef 2000
2a37f04d
JH
2001 if (lenp)
2002 *lenp = len;
2003
f4cd282c 2004 return uv1;
cbe07460 2005
a0ed51b3
LW
2006}
2007
051a06d4 2008STATIC UV
357aadde 2009S_check_locale_boundary_crossing(pTHX_ const U8* const p, const UV result, U8* const ustrp, STRLEN *lenp)
051a06d4 2010{
4a4088c4 2011 /* This is called when changing the case of a UTF-8-encoded character above
31f05a37
KW
2012 * the Latin1 range, and the operation is in a non-UTF-8 locale. If the
2013 * result contains a character that crosses the 255/256 boundary, disallow
2014 * the change, and return the original code point. See L<perlfunc/lc> for
2015 * why;
051a06d4 2016 *
a1433954
KW
2017 * p points to the original string whose case was changed; assumed
2018 * by this routine to be well-formed
051a06d4
KW
2019 * result the code point of the first character in the changed-case string
2020 * ustrp points to the changed-case string (<result> represents its first char)
2021 * lenp points to the length of <ustrp> */
2022
2023 UV original; /* To store the first code point of <p> */
2024
2025 PERL_ARGS_ASSERT_CHECK_LOCALE_BOUNDARY_CROSSING;
2026
a4f12ed7 2027 assert(UTF8_IS_ABOVE_LATIN1(*p));
051a06d4
KW
2028
2029 /* We know immediately if the first character in the string crosses the
2030 * boundary, so can skip */
2031 if (result > 255) {
2032
2033 /* Look at every character in the result; if any cross the
2034 * boundary, the whole thing is disallowed */
2035 U8* s = ustrp + UTF8SKIP(ustrp);
2036 U8* e = ustrp + *lenp;
2037 while (s < e) {
a4f12ed7 2038 if (! UTF8_IS_ABOVE_LATIN1(*s)) {
051a06d4
KW
2039 goto bad_crossing;
2040 }
2041 s += UTF8SKIP(s);
2042 }
2043
613abc6d
KW
2044 /* Here, no characters crossed, result is ok as-is, but we warn. */
2045 _CHECK_AND_OUTPUT_WIDE_LOCALE_UTF8_MSG(p, p + UTF8SKIP(p));
051a06d4
KW
2046 return result;
2047 }
2048
7b52d656 2049 bad_crossing:
051a06d4
KW
2050
2051 /* Failed, have to return the original */
4b88fb76 2052 original = valid_utf8_to_uvchr(p, lenp);
ab0b796c
KW
2053
2054 /* diag_listed_as: Can't do %s("%s") on non-UTF-8 locale; resolved to "%s". */
2055 Perl_ck_warner(aTHX_ packWARN(WARN_LOCALE),
2056 "Can't do %s(\"\\x{%"UVXf"}\") on non-UTF-8 locale; "
2057 "resolved to \"\\x{%"UVXf"}\".",
357aadde 2058 OP_DESC(PL_op),
ab0b796c
KW
2059 original,
2060 original);
051a06d4
KW
2061 Copy(p, ustrp, *lenp, char);
2062 return original;
2063}
2064
d3e79532 2065/*
87cea99e 2066=for apidoc to_utf8_upper
d3e79532 2067
1f607577 2068Instead use L</toUPPER_utf8>.
a1433954 2069
d3e79532
JH
2070=cut */
2071
051a06d4 2072/* Not currently externally documented, and subject to change:
31f05a37
KW
2073 * <flags> is set iff iff the rules from the current underlying locale are to
2074 * be used. */
051a06d4 2075
2104c8d9 2076UV
31f05a37 2077Perl__to_utf8_upper_flags(pTHX_ const U8 *p, U8* ustrp, STRLEN *lenp, bool flags)
a0ed51b3 2078{
051a06d4
KW
2079 UV result;
2080
2081 PERL_ARGS_ASSERT__TO_UTF8_UPPER_FLAGS;
7918f24d 2082
780fcc9f
KW
2083 if (flags) {
2084 /* Treat a UTF-8 locale as not being in locale at all */
2085 if (IN_UTF8_CTYPE_LOCALE) {
2086 flags = FALSE;
2087 }
2088 else {
2089 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
2090 }
31f05a37
KW
2091 }
2092
3a4c58c9 2093 if (UTF8_IS_INVARIANT(*p)) {
051a06d4
KW
2094 if (flags) {
2095 result = toUPPER_LC(*p);
2096 }
2097 else {
81c6c7ce 2098 return _to_upper_title_latin1(*p, ustrp, lenp, 'S');
051a06d4 2099 }
3a4c58c9
KW
2100 }
2101 else if UTF8_IS_DOWNGRADEABLE_START(*p) {
051a06d4 2102 if (flags) {
a62b247b 2103 U8 c = EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p+1));
68067e4e 2104 result = toUPPER_LC(c);
051a06d4
KW
2105 }
2106 else {
a62b247b 2107 return _to_upper_title_latin1(EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p+1)),
81c6c7ce 2108 ustrp, lenp, 'S');
051a06d4
KW
2109 }
2110 }
4a4088c4 2111 else { /* UTF-8, ord above 255 */
051a06d4
KW
2112 result = CALL_UPPER_CASE(p, ustrp, lenp);
2113
2114 if (flags) {
357aadde 2115 result = check_locale_boundary_crossing(p, result, ustrp, lenp);
051a06d4
KW
2116 }
2117 return result;
2118 }
2119
4a4088c4 2120 /* Here, used locale rules. Convert back to UTF-8 */
051a06d4
KW
2121 if (UTF8_IS_INVARIANT(result)) {
2122 *ustrp = (U8) result;
2123 *lenp = 1;
2124 }
2125 else {
62cb07ea
KW
2126 *ustrp = UTF8_EIGHT_BIT_HI((U8) result);
2127 *(ustrp + 1) = UTF8_EIGHT_BIT_LO((U8) result);
051a06d4 2128 *lenp = 2;
3a4c58c9 2129 }
baa60164 2130
051a06d4 2131 return result;
983ffd37 2132}
a0ed51b3 2133
d3e79532 2134/*
87cea99e 2135=for apidoc to_utf8_title
d3e79532 2136
1f607577 2137Instead use L</toTITLE_utf8>.
a1433954 2138
d3e79532
JH
2139=cut */
2140
051a06d4 2141/* Not currently externally documented, and subject to change:
31f05a37
KW
2142 * <flags> is set iff the rules from the current underlying locale are to be
2143 * used. Since titlecase is not defined in POSIX, for other than a
2144 * UTF-8 locale, uppercase is used instead for code points < 256.
445bf929 2145 */
051a06d4 2146
983ffd37 2147UV
31f05a37 2148Perl__to_utf8_title_flags(pTHX_ const U8 *p, U8* ustrp, STRLEN *lenp, bool flags)
983ffd37 2149{
051a06d4
KW
2150 UV result;
2151
2152 PERL_ARGS_ASSERT__TO_UTF8_TITLE_FLAGS;
7918f24d 2153
780fcc9f
KW
2154 if (flags) {
2155 /* Treat a UTF-8 locale as not being in locale at all */
2156 if (IN_UTF8_CTYPE_LOCALE) {
2157 flags = FALSE;
2158 }
2159 else {
2160 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
2161 }
31f05a37
KW
2162 }
2163
3a4c58c9 2164 if (UTF8_IS_INVARIANT(*p)) {
051a06d4
KW
2165 if (flags) {
2166 result = toUPPER_LC(*p);
2167 }
2168 else {
81c6c7ce 2169 return _to_upper_title_latin1(*p, ustrp, lenp, 's');
051a06d4 2170 }
3a4c58c9
KW
2171 }
2172 else if UTF8_IS_DOWNGRADEABLE_START(*p) {
051a06d4 2173 if (flags) {
a62b247b 2174 U8 c = EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p+1));
68067e4e 2175 result = toUPPER_LC(c);
051a06d4
KW
2176 }
2177 else {
a62b247b 2178 return _to_upper_title_latin1(EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p+1)),
81c6c7ce 2179 ustrp, lenp, 's');
051a06d4
KW
2180 }
2181 }
4a4088c4 2182 else { /* UTF-8, ord above 255 */
051a06d4
KW
2183 result = CALL_TITLE_CASE(p, ustrp, lenp);
2184
2185 if (flags) {
357aadde 2186 result = check_locale_boundary_crossing(p, result, ustrp, lenp);
051a06d4
KW
2187 }
2188 return result;
2189 }
2190
4a4088c4 2191 /* Here, used locale rules. Convert back to UTF-8 */
051a06d4
KW
2192 if (UTF8_IS_INVARIANT(result)) {
2193 *ustrp = (U8) result;
2194 *lenp = 1;
2195 }
2196 else {
62cb07ea
KW
2197 *ustrp = UTF8_EIGHT_BIT_HI((U8) result);
2198 *(ustrp + 1) = UTF8_EIGHT_BIT_LO((U8) result);
051a06d4 2199 *lenp = 2;
3a4c58c9
KW
2200 }
2201
051a06d4 2202 return result;
a0ed51b3
LW
2203}
2204
d3e79532 2205/*
87cea99e 2206=for apidoc to_utf8_lower
d3e79532 2207
1f607577 2208Instead use L</toLOWER_utf8>.
a1433954 2209
d3e79532
JH
2210=cut */
2211
051a06d4 2212/* Not currently externally documented, and subject to change:
31f05a37
KW
2213 * <flags> is set iff iff the rules from the current underlying locale are to
2214 * be used.
2215 */
051a06d4 2216
2104c8d9 2217UV
31f05a37 2218Perl__to_utf8_lower_flags(pTHX_ const U8 *p, U8* ustrp, STRLEN *lenp, bool flags)
a0ed51b3 2219{
051a06d4
KW
2220 UV result;
2221
051a06d4 2222 PERL_ARGS_ASSERT__TO_UTF8_LOWER_FLAGS;
7918f24d 2223
780fcc9f
KW
2224 if (flags) {
2225 /* Treat a UTF-8 locale as not being in locale at all */
2226 if (IN_UTF8_CTYPE_LOCALE) {
2227 flags = FALSE;
2228 }
2229 else {
2230 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
2231 }
31f05a37
KW
2232 }
2233
968c5e6a 2234 if (UTF8_IS_INVARIANT(*p)) {
051a06d4
KW
2235 if (flags) {
2236 result = toLOWER_LC(*p);
2237 }
2238 else {
81c6c7ce 2239 return to_lower_latin1(*p, ustrp, lenp);
051a06d4 2240 }
968c5e6a
KW
2241 }
2242 else if UTF8_IS_DOWNGRADEABLE_START(*p) {
051a06d4 2243 if (flags) {
a62b247b 2244 U8 c = EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p+1));
68067e4e 2245 result = toLOWER_LC(c);
051a06d4
KW
2246 }
2247 else {
a62b247b 2248 return to_lower_latin1(EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p+1)),
81c6c7ce 2249 ustrp, lenp);
051a06d4 2250 }
968c5e6a 2251 }
4a4088c4 2252 else { /* UTF-8, ord above 255 */
051a06d4
KW
2253 result = CALL_LOWER_CASE(p, ustrp, lenp);
2254
2255 if (flags) {
357aadde 2256 result = check_locale_boundary_crossing(p, result, ustrp, lenp);
051a06d4 2257 }
968c5e6a 2258
051a06d4
KW
2259 return result;
2260 }
2261
4a4088c4 2262 /* Here, used locale rules. Convert back to UTF-8 */
051a06d4
KW
2263 if (UTF8_IS_INVARIANT(result)) {
2264 *ustrp = (U8) result;
2265 *lenp = 1;
2266 }
2267 else {
62cb07ea
KW
2268 *ustrp = UTF8_EIGHT_BIT_HI((U8) result);
2269 *(ustrp + 1) = UTF8_EIGHT_BIT_LO((U8) result);
051a06d4
KW
2270 *lenp = 2;
2271 }
2272
051a06d4 2273 return result;
b4e400f9
JH
2274}
2275
d3e79532 2276/*
87cea99e 2277=for apidoc to_utf8_fold
d3e79532 2278
1f607577 2279Instead use L</toFOLD_utf8>.
a1433954 2280
d3e79532
JH
2281=cut */
2282
051a06d4
KW
2283/* Not currently externally documented, and subject to change,
2284 * in <flags>
31f05a37
KW
2285 * bit FOLD_FLAGS_LOCALE is set iff the rules from the current underlying
2286 * locale are to be used.
051a06d4
KW
2287 * bit FOLD_FLAGS_FULL is set iff full case folds are to be used;
2288 * otherwise simple folds
a0270393
KW
2289 * bit FOLD_FLAGS_NOMIX_ASCII is set iff folds of non-ASCII to ASCII are
2290 * prohibited
445bf929 2291 */
36bb2ab6 2292
b4e400f9 2293UV
445bf929 2294Perl__to_utf8_fold_flags(pTHX_ const U8 *p, U8* ustrp, STRLEN *lenp, U8 flags)
b4e400f9 2295{
051a06d4
KW
2296 UV result;
2297
36bb2ab6 2298 PERL_ARGS_ASSERT__TO_UTF8_FOLD_FLAGS;
7918f24d 2299
a0270393
KW
2300 /* These are mutually exclusive */
2301 assert (! ((flags & FOLD_FLAGS_LOCALE) && (flags & FOLD_FLAGS_NOMIX_ASCII)));
2302
50ba90ff
KW
2303 assert(p != ustrp); /* Otherwise overwrites */
2304
780fcc9f
KW
2305 if (flags & FOLD_FLAGS_LOCALE) {
2306 /* Treat a UTF-8 locale as not being in locale at all */
2307 if (IN_UTF8_CTYPE_LOCALE) {
2308 flags &= ~FOLD_FLAGS_LOCALE;
2309 }
2310 else {
2311 _CHECK_AND_WARN_PROBLEMATIC_LOCALE;
2312 }
31f05a37
KW
2313 }
2314
a1dde8de 2315 if (UTF8_IS_INVARIANT(*p)) {
051a06d4 2316 if (flags & FOLD_FLAGS_LOCALE) {
d22b930b 2317 result = toFOLD_LC(*p);
051a06d4
KW
2318 }
2319 else {
81c6c7ce 2320 return _to_fold_latin1(*p, ustrp, lenp,
1ca267a5 2321 flags & (FOLD_FLAGS_FULL | FOLD_FLAGS_NOMIX_ASCII));
051a06d4 2322 }
a1dde8de
KW
2323 }
2324 else if UTF8_IS_DOWNGRADEABLE_START(*p) {
051a06d4 2325 if (flags & FOLD_FLAGS_LOCALE) {
a62b247b 2326 U8 c = EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p+1));
68067e4e 2327 result = toFOLD_LC(c);
051a06d4
KW
2328 }
2329 else {
a62b247b 2330 return _to_fold_latin1(EIGHT_BIT_UTF8_TO_NATIVE(*p, *(p+1)),
51910141 2331 ustrp, lenp,
1ca267a5 2332 flags & (FOLD_FLAGS_FULL | FOLD_FLAGS_NOMIX_ASCII));
051a06d4 2333 }
a1dde8de 2334 }
4a4088c4 2335 else { /* UTF-8, ord above 255 */
a0270393 2336 result = CALL_FOLD_CASE(p, ustrp, lenp, flags & FOLD_FLAGS_FULL);
a1dde8de 2337
1ca267a5
KW
2338 if (flags & FOLD_FLAGS_LOCALE) {
2339
76f2ffcd 2340# define LONG_S_T LATIN_SMALL_LIGATURE_LONG_S_T_UTF8
0766489e
KW
2341 const unsigned int long_s_t_len = sizeof(LONG_S_T) - 1;
2342
2343# ifdef LATIN_CAPITAL_LETTER_SHARP_S_UTF8
2344# define CAP_SHARP_S LATIN_CAPITAL_LETTER_SHARP_S_UTF8
76f2ffcd
KW
2345
2346 const unsigned int cap_sharp_s_len = sizeof(CAP_SHARP_S) - 1;
76f2ffcd 2347
538e84ed
KW
2348 /* Special case these two characters, as what normally gets
2349 * returned under locale doesn't work */
76f2ffcd
KW
2350 if (UTF8SKIP(p) == cap_sharp_s_len
2351 && memEQ((char *) p, CAP_SHARP_S, cap_sharp_s_len))
1ca267a5 2352 {
ab0b796c
KW
2353 /* diag_listed_as: Can't do %s("%s") on non-UTF-8 locale; resolved to "%s". */
2354 Perl_ck_warner(aTHX_ packWARN(WARN_LOCALE),
2355 "Can't do fc(\"\\x{1E9E}\") on non-UTF-8 locale; "
2356 "resolved to \"\\x{17F}\\x{17F}\".");
1ca267a5
KW
2357 goto return_long_s;
2358 }
0766489e
KW
2359 else
2360#endif
2361 if (UTF8SKIP(p) == long_s_t_len
76f2ffcd 2362 && memEQ((char *) p, LONG_S_T, long_s_t_len))
9fc2026f 2363 {
ab0b796c
KW
2364 /* diag_listed_as: Can't do %s("%s") on non-UTF-8 locale; resolved to "%s". */
2365 Perl_ck_warner(aTHX_ packWARN(WARN_LOCALE),
2366 "Can't do fc(\"\\x{FB05}\") on non-UTF-8 locale; "
2367 "resolved to \"\\x{FB06}\".");
9fc2026f
KW
2368 goto return_ligature_st;
2369 }
74894415
KW
2370
2371#if UNICODE_MAJOR_VERSION == 3 \
2372 && UNICODE_DOT_VERSION == 0 \
2373 && UNICODE_DOT_DOT_VERSION == 1
2374# define DOTTED_I LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE_UTF8
2375
2376 /* And special case this on this Unicode version only, for the same
2377 * reaons the other two are special cased. They would cross the
2378 * 255/256 boundary which is forbidden under /l, and so the code
2379 * wouldn't catch that they are equivalent (which they are only in
2380 * this release) */
2381 else if (UTF8SKIP(p) == sizeof(DOTTED_I) - 1
2382 && memEQ((char *) p, DOTTED_I, sizeof(DOTTED_I) - 1))
2383 {
2384 /* diag_listed_as: Can't do %s("%s") on non-UTF-8 locale; resolved to "%s". */
2385 Perl_ck_warner(aTHX_ packWARN(WARN_LOCALE),
2386 "Can't do fc(\"\\x{0130}\") on non-UTF-8 locale; "
2387 "resolved to \"\\x{0131}\".");
2388 goto return_dotless_i;
2389 }
2390#endif
2391
357aadde 2392 return check_locale_boundary_crossing(p, result, ustrp, lenp);
051a06d4 2393 }
a0270393
KW
2394 else if (! (flags & FOLD_FLAGS_NOMIX_ASCII)) {
2395 return result;
2396 }
2397 else {
4a4088c4 2398 /* This is called when changing the case of a UTF-8-encoded
9fc2026f
KW
2399 * character above the ASCII range, and the result should not
2400 * contain an ASCII character. */
a0270393
KW
2401
2402 UV original; /* To store the first code point of <p> */
2403
2404 /* Look at every character in the result; if any cross the
2405 * boundary, the whole thing is disallowed */
2406 U8* s = ustrp;
2407 U8* e = ustrp + *lenp;
2408 while (s < e) {
2409 if (isASCII(*s)) {
2410 /* Crossed, have to return the original */
2411 original = valid_utf8_to_uvchr(p, lenp);
1ca267a5 2412
9fc2026f 2413 /* But in these instances, there is an alternative we can
1ca267a5 2414 * return that is valid */
0766489e
KW
2415 if (original == LATIN_SMALL_LETTER_SHARP_S
2416#ifdef LATIN_CAPITAL_LETTER_SHARP_S /* not defined in early Unicode releases */
2417 || original == LATIN_CAPITAL_LETTER_SHARP_S
2418#endif
2419 ) {
1ca267a5
KW
2420 goto return_long_s;
2421 }
9fc2026f
KW
2422 else if (original == LATIN_SMALL_LIGATURE_LONG_S_T) {
2423 goto return_ligature_st;
2424 }
74894415
KW
2425#if UNICODE_MAJOR_VERSION == 3 \
2426 && UNICODE_DOT_VERSION == 0 \
2427 && UNICODE_DOT_DOT_VERSION == 1
2428
2429 else if (original == LATIN_CAPITAL_LETTER_I_WITH_DOT_ABOVE) {
2430 goto return_dotless_i;
2431 }
2432#endif
a0270393
KW
2433 Copy(p, ustrp, *lenp, char);
2434 return original;
2435 }
2436 s += UTF8SKIP(s);
2437 }
051a06d4 2438
a0270393
KW
2439 /* Here, no characters crossed, result is ok as-is */
2440 return result;
2441 }
051a06d4
KW
2442 }
2443
4a4088c4 2444 /* Here, used locale rules. Convert back to UTF-8 */
051a06d4
KW
2445 if (UTF8_IS_INVARIANT(result)) {
2446 *ustrp = (U8) result;
2447 *lenp = 1;
2448 }
2449 else {
62cb07ea
KW
2450 *ustrp = UTF8_EIGHT_BIT_HI((U8) result);
2451 *(ustrp + 1) = UTF8_EIGHT_BIT_LO((U8) result);
051a06d4
KW
2452 *lenp = 2;
2453 }
2454
051a06d4 2455 return result;
1ca267a5
KW
2456
2457 return_long_s:
2458 /* Certain folds to 'ss' are prohibited by the options, but they do allow
2459 * folds to a string of two of these characters. By returning this
2460 * instead, then, e.g.,
2461 * fc("\x{1E9E}") eq fc("\x{17F}\x{17F}")
2462 * works. */
2463
2464 *lenp = 2 * sizeof(LATIN_SMALL_LETTER_LONG_S_UTF8) - 2;
2465 Copy(LATIN_SMALL_LETTER_LONG_S_UTF8 LATIN_SMALL_LETTER_LONG_S_UTF8,
2466 ustrp, *lenp, U8);
2467 return LATIN_SMALL_LETTER_LONG_S;
9fc2026f
KW
2468
2469 return_ligature_st:
2470 /* Two folds to 'st' are prohibited by the options; instead we pick one and
2471 * have the other one fold to it */
2472
2473 *lenp = sizeof(LATIN_SMALL_LIGATURE_ST_UTF8) - 1;
2474 Copy(LATIN_SMALL_LIGATURE_ST_UTF8, ustrp, *lenp, U8);
2475 return LATIN_SMALL_LIGATURE_ST;
74894415
KW
2476
2477#if UNICODE_MAJOR_VERSION == 3 \
2478 && UNICODE_DOT_VERSION == 0 \
2479 && UNICODE_DOT_DOT_VERSION == 1
2480
2481 return_dotless_i:
2482 *lenp = sizeof(LATIN_SMALL_LETTER_DOTLESS_I_UTF8) - 1;
2483 Copy(LATIN_SMALL_LETTER_DOTLESS_I_UTF8, ustrp, *lenp, U8);
2484 return LATIN_SMALL_LETTER_DOTLESS_I;
2485
2486#endif
2487
a0ed51b3
LW
2488}
2489
711a919c 2490/* Note:
f90a9a02 2491 * Returns a "swash" which is a hash described in utf8.c:Perl_swash_fetch().
711a919c
ST
2492 * C<pkg> is a pointer to a package name for SWASHNEW, should be "utf8".
2493 * For other parameters, see utf8::SWASHNEW in lib/utf8_heavy.pl.
2494 */
c4a5db0c 2495
a0ed51b3 2496SV*
7fc63493 2497Perl_swash_init(pTHX_ const char* pkg, const char* name, SV *listsv, I32 minbits, I32 none)
a0ed51b3 2498{
c4a5db0c
KW
2499 PERL_ARGS_ASSERT_SWASH_INIT;
2500
2501 /* Returns a copy of a swash initiated by the called function. This is the
2502 * public interface, and returning a copy prevents others from doing
2503 * mischief on the original */
2504
5d3d13d1 2505 return newSVsv(_core_swash_init(pkg, name, listsv, minbits, none, NULL, NULL));
c4a5db0c
KW
2506}
2507
2508SV*
5d3d13d1 2509Perl__core_swash_init(pTHX_ const char* pkg, const char* name, SV *listsv, I32 minbits, I32 none, SV* invlist, U8* const flags_p)
c4a5db0c 2510{
2c1f00b9
YO
2511
2512 /*NOTE NOTE NOTE - If you want to use "return" in this routine you MUST
2513 * use the following define */
2514
2515#define CORE_SWASH_INIT_RETURN(x) \
2516 PL_curpm= old_PL_curpm; \
2517 return x
2518
c4a5db0c 2519 /* Initialize and return a swash, creating it if necessary. It does this
87367d5f
KW
2520 * by calling utf8_heavy.pl in the general case. The returned value may be
2521 * the swash's inversion list instead if the input parameters allow it.
2522 * Which is returned should be immaterial to callers, as the only
923b6d4e
KW
2523 * operations permitted on a swash, swash_fetch(), _get_swash_invlist(),
2524 * and swash_to_invlist() handle both these transparently.
c4a5db0c
KW
2525 *
2526 * This interface should only be used by functions that won't destroy or
2527 * adversely change the swash, as doing so affects all other uses of the
2528 * swash in the program; the general public should use 'Perl_swash_init'
2529 * instead.
2530 *
2531 * pkg is the name of the package that <name> should be in.
2532 * name is the name of the swash to find. Typically it is a Unicode
2533 * property name, including user-defined ones
2534 * listsv is a string to initialize the swash with. It must be of the form
2535 * documented as the subroutine return value in
2536 * L<perlunicode/User-Defined Character Properties>
2537 * minbits is the number of bits required to represent each data element.
2538 * It is '1' for binary properties.
2539 * none I (khw) do not understand this one, but it is used only in tr///.
9a53f6cf 2540 * invlist is an inversion list to initialize the swash with (or NULL)
83199d38
KW
2541 * flags_p if non-NULL is the address of various input and output flag bits
2542 * to the routine, as follows: ('I' means is input to the routine;
2543 * 'O' means output from the routine. Only flags marked O are
2544 * meaningful on return.)
2545 * _CORE_SWASH_INIT_USER_DEFINED_PROPERTY indicates if the swash
2546 * came from a user-defined property. (I O)
5d3d13d1
KW
2547 * _CORE_SWASH_INIT_RETURN_IF_UNDEF indicates that instead of croaking
2548 * when the swash cannot be located, to simply return NULL. (I)
87367d5f
KW
2549 * _CORE_SWASH_INIT_ACCEPT_INVLIST indicates that the caller will accept a
2550 * return of an inversion list instead of a swash hash if this routine
2551 * thinks that would result in faster execution of swash_fetch() later
2552 * on. (I)
9a53f6cf
KW
2553 *
2554 * Thus there are three possible inputs to find the swash: <name>,
2555 * <listsv>, and <invlist>. At least one must be specified. The result
2556 * will be the union of the specified ones, although <listsv>'s various
aabbdbda
KW
2557 * actions can intersect, etc. what <name> gives. To avoid going out to
2558 * disk at all, <invlist> should specify completely what the swash should
2559 * have, and <listsv> should be &PL_sv_undef and <name> should be "".
9a53f6cf
KW
2560 *
2561 * <invlist> is only valid for binary properties */
c4a5db0c 2562
2c1f00b9
YO
2563 PMOP *old_PL_curpm= PL_curpm; /* save away the old PL_curpm */
2564
c4a5db0c 2565 SV* retval = &PL_sv_undef;
83199d38 2566 HV* swash_hv = NULL;
87367d5f
KW
2567 const int invlist_swash_boundary =
2568 (flags_p && *flags_p & _CORE_SWASH_INIT_ACCEPT_INVLIST)
2569 ? 512 /* Based on some benchmarking, but not extensive, see commit
2570 message */
2571 : -1; /* Never return just an inversion list */
9a53f6cf
KW
2572
2573 assert(listsv != &PL_sv_undef || strNE(name, "") || invlist);
2574 assert(! invlist || minbits == 1);
2575
2c1f00b9
YO
2576 PL_curpm= NULL; /* reset PL_curpm so that we dont get confused between the regex
2577 that triggered the swash init and the swash init perl logic itself.
2578 See perl #122747 */
2579
9a53f6cf
KW
2580 /* If data was passed in to go out to utf8_heavy to find the swash of, do
2581 * so */
2582 if (listsv != &PL_sv_undef || strNE(name, "")) {
69794297
KW
2583 dSP;
2584 const size_t pkg_len = strlen(pkg);
2585 const size_t name_len = strlen(name);
2586 HV * const stash = gv_stashpvn(pkg, pkg_len, 0);
2587 SV* errsv_save;
2588 GV *method;
2589
2590 PERL_ARGS_ASSERT__CORE_SWASH_INIT;
2591
2592 PUSHSTACKi(PERLSI_MAGIC);
ce3b816e 2593 ENTER;
69794297 2594 SAVEHINTS();
2782061f 2595 save_re_context();
650f067c
JL
2596 /* We might get here via a subroutine signature which uses a utf8
2597 * parameter name, at which point PL_subname will have been set
2598 * but not yet used. */
2599 save_item(PL_subname);
69794297
KW
2600 if (PL_parser && PL_parser->error_count)
2601 SAVEI8(PL_parser->error_count), PL_parser->error_count = 0;
2602 method = gv_fetchmeth(stash, "SWASHNEW", 8, -1);
4a4088c4 2603 if (!method) { /* demand load UTF-8 */
69794297 2604 ENTER;
db2c6cb3
FC
2605 if ((errsv_save = GvSV(PL_errgv))) SAVEFREESV(errsv_save);
2606 GvSV(PL_errgv) = NULL;
1a419e6b 2607#ifndef NO_TAINT_SUPPORT
69794297
KW
2608 /* It is assumed that callers of this routine are not passing in
2609 * any user derived data. */
2782061f
DM
2610 /* Need to do this after save_re_context() as it will set
2611 * PL_tainted to 1 while saving $1 etc (see the code after getrx:
2612 * in Perl_magic_get). Even line to create errsv_save can turn on
2613 * PL_tainted. */
284167a5
SM
2614 SAVEBOOL(TAINT_get);
2615 TAINT_NOT;
2616#endif
69794297
KW
2617 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT, newSVpvn(pkg,pkg_len),
2618 NULL);
eed484f9 2619 {
db2c6cb3
FC
2620 /* Not ERRSV, as there is no need to vivify a scalar we are
2621 about to discard. */
2622 SV * const errsv = GvSV(PL_errgv);
2623 if (!SvTRUE(errsv)) {
2624 GvSV(PL_errgv) = SvREFCNT_inc_simple(errsv_save);
2625 SvREFCNT_dec(errsv);
2626 }
eed484f9 2627 }
69794297
KW
2628 LEAVE;
2629 }
2630 SPAGAIN;
2631 PUSHMARK(SP);
2632 EXTEND(SP,5);
2633 mPUSHp(pkg, pkg_len);
2634 mPUSHp(name, name_len);
2635 PUSHs(listsv);
2636 mPUSHi(minbits);
2637 mPUSHi(none);
2638 PUTBACK;
db2c6cb3
FC
2639 if ((errsv_save = GvSV(PL_errgv))) SAVEFREESV(errsv_save);
2640 GvSV(PL_errgv) = NULL;
69794297
KW
2641 /* If we already have a pointer to the method, no need to use
2642 * call_method() to repeat the lookup. */
c41800a8
KW
2643 if (method
2644 ? call_sv(MUTABLE_SV(method), G_SCALAR)
69794297
KW
2645 : call_sv(newSVpvs_flags("SWASHNEW", SVs_TEMP), G_SCALAR | G_METHOD))
2646 {
2647 retval = *PL_stack_sp--;
2648 SvREFCNT_inc(retval);
2649 }
eed484f9 2650 {
db2c6cb3
FC
2651 /* Not ERRSV. See above. */
2652 SV * const errsv = GvSV(PL_errgv);
2653 if (!SvTRUE(errsv)) {
2654 GvSV(PL_errgv) = SvREFCNT_inc_simple(errsv_save);
2655 SvREFCNT_dec(errsv);
2656 }
eed484f9 2657 }
ce3b816e 2658 LEAVE;
69794297
KW
2659 POPSTACK;
2660 if (IN_PERL_COMPILETIME) {
2661 CopHINTS_set(PL_curcop, PL_hints);
2662 }
2663 if (!SvROK(retval) || SvTYPE(SvRV(retval)) != SVt_PVHV) {
2664 if (SvPOK(retval))
2665
2666 /* If caller wants to handle missing properties, let them */
5d3d13d1 2667 if (flags_p && *flags_p & _CORE_SWASH_INIT_RETURN_IF_UNDEF) {
2c1f00b9 2668 CORE_SWASH_INIT_RETURN(NULL);
69794297
KW
2669 }
2670 Perl_croak(aTHX_
2671 "Can't find Unicode property definition \"%"SVf"\"",
2672 SVfARG(retval));
a25b5927 2673 NOT_REACHED; /* NOTREACHED */
69794297 2674 }
9a53f6cf 2675 } /* End of calling the module to find the swash */
36eb48b4 2676
83199d38
KW
2677 /* If this operation fetched a swash, and we will need it later, get it */
2678 if (retval != &PL_sv_undef
2679 && (minbits == 1 || (flags_p
2680 && ! (*flags_p
2681 & _CORE_SWASH_INIT_USER_DEFINED_PROPERTY))))
2682 {
2683 swash_hv = MUTABLE_HV(SvRV(retval));
2684
2685 /* If we don't already know that there is a user-defined component to
2686 * this swash, and the user has indicated they wish to know if there is
2687 * one (by passing <flags_p>), find out */
2688 if (flags_p && ! (*flags_p & _CORE_SWASH_INIT_USER_DEFINED_PROPERTY)) {
2689 SV** user_defined = hv_fetchs(swash_hv, "USER_DEFINED", FALSE);
2690 if (user_defined && SvUV(*user_defined)) {
2691 *flags_p |= _CORE_SWASH_INIT_USER_DEFINED_PROPERTY;
2692 }
2693 }
2694 }
2695
36eb48b4
KW
2696 /* Make sure there is an inversion list for binary properties */
2697 if (minbits == 1) {
2698 SV** swash_invlistsvp = NULL;
2699 SV* swash_invlist = NULL;
9a53f6cf 2700 bool invlist_in_swash_is_valid = FALSE;
02c85471
FC
2701 bool swash_invlist_unclaimed = FALSE; /* whether swash_invlist has
2702 an unclaimed reference count */
36eb48b4 2703
9a53f6cf 2704 /* If this operation fetched a swash, get its already existing
83199d38 2705 * inversion list, or create one for it */
36eb48b4 2706
83199d38 2707 if (swash_hv) {
5c9f4bd2 2708 swash_invlistsvp = hv_fetchs(swash_hv, "V", FALSE);
9a53f6cf
KW
2709 if (swash_invlistsvp) {
2710 swash_invlist = *swash_invlistsvp;
2711 invlist_in_swash_is_valid = TRUE;
2712 }
2713 else {
36eb48b4 2714 swash_invlist = _swash_to_invlist(retval);
02c85471 2715 swash_invlist_unclaimed = TRUE;
9a53f6cf
KW
2716 }
2717 }
2718
2719 /* If an inversion list was passed in, have to include it */
2720 if (invlist) {
2721
2722 /* Any fetched swash will by now have an inversion list in it;
2723 * otherwise <swash_invlist> will be NULL, indicating that we
2724 * didn't fetch a swash */
2725 if (swash_invlist) {
2726
2727 /* Add the passed-in inversion list, which invalidates the one
2728 * already stored in the swash */
2729 invlist_in_swash_is_valid = FALSE;
2730 _invlist_union(invlist, swash_invlist, &swash_invlist);
2731 }
2732 else {
2733
87367d5f
KW
2734 /* Here, there is no swash already. Set up a minimal one, if
2735 * we are going to return a swash */
2736 if ((int) _invlist_len(invlist) > invlist_swash_boundary) {
971d486f 2737 swash_hv = newHV();
4aca0fe6 2738 retval = newRV_noinc(MUTABLE_SV(swash_hv));
87367d5f 2739 }
9a53f6cf
KW
2740 swash_invlist = invlist;
2741 }
9a53f6cf
KW
2742 }
2743
2744 /* Here, we have computed the union of all the passed-in data. It may
2745 * be that there was an inversion list in the swash which didn't get
538e84ed 2746 * touched; otherwise save the computed one */
87367d5f
KW
2747 if (! invlist_in_swash_is_valid
2748 && (int) _invlist_len(swash_invlist) > invlist_swash_boundary)
2749 {
5c9f4bd2 2750 if (! hv_stores(MUTABLE_HV(SvRV(retval)), "V", swash_invlist))
69794297
KW
2751 {
2752 Perl_croak(aTHX_ "panic: hv_store() unexpectedly failed");
2753 }
cc34d8c5
FC
2754 /* We just stole a reference count. */
2755 if (swash_invlist_unclaimed) swash_invlist_unclaimed = FALSE;
2756 else SvREFCNT_inc_simple_void_NN(swash_invlist);
9a53f6cf 2757 }
87367d5f 2758
dbfdbd26
KW
2759 SvREADONLY_on(swash_invlist);
2760
c41800a8 2761 /* Use the inversion list stand-alone if small enough */
87367d5f
KW
2762 if ((int) _invlist_len(swash_invlist) <= invlist_swash_boundary) {
2763 SvREFCNT_dec(retval);
02c85471
FC
2764 if (!swash_invlist_unclaimed)
2765 SvREFCNT_inc_simple_void_NN(swash_invlist);
2766 retval = newRV_noinc(swash_invlist);
87367d5f 2767 }
36eb48b4
KW
2768 }
2769
2c1f00b9
YO
2770 CORE_SWASH_INIT_RETURN(retval);
2771#undef CORE_SWASH_INIT_RETURN
a0ed51b3
LW
2772}
2773
035d37be
JH
2774
2775/* This API is wrong for special case conversions since we may need to
2776 * return several Unicode characters for a single Unicode character
2777 * (see lib/unicore/SpecCase.txt) The SWASHGET in lib/utf8_heavy.pl is
2778 * the lower-level routine, and it is similarly broken for returning
38684baa
KW
2779 * multiple values. --jhi
2780 * For those, you should use to_utf8_case() instead */
b0e3252e 2781/* Now SWASHGET is recasted into S_swatch_get in this file. */
680c470c
ST
2782
2783/* Note:
2784 * Returns the value of property/mapping C<swash> for the first character
2785 * of the string C<ptr>. If C<do_utf8> is true, the string C<ptr> is
4a4088c4 2786 * assumed to be in well-formed UTF-8. If C<do_utf8> is false, the string C<ptr>
3d0f8846 2787 * is assumed to be in native 8-bit encoding. Caches the swatch in C<swash>.
af2af982
KW
2788 *
2789 * A "swash" is a hash which contains initially the keys/values set up by
2790 * SWASHNEW. The purpose is to be able to completely represent a Unicode
2791 * property for all possible code points. Things are stored in a compact form
2792 * (see utf8_heavy.pl) so that calculation is required to find the actual
2793 * property value for a given code point. As code points are looked up, new
2794 * key/value pairs are added to the hash, so that the calculation doesn't have
2795 * to ever be re-done. Further, each calculation is done, not just for the
2796 * desired one, but for a whole block of code points adjacent to that one.
2797 * For binary properties on ASCII machines, the block is usually for 64 code
2798 * points, starting with a code point evenly divisible by 64. Thus if the
2799 * property value for code point 257 is requested, the code goes out and
2800 * calculates the property values for all 64 code points between 256 and 319,
2801 * and stores these as a single 64-bit long bit vector, called a "swatch",
2802 * under the key for code point 256. The key is the UTF-8 encoding for code
2803 * point 256, minus the final byte. Thus, if the length of the UTF-8 encoding
2804 * for a code point is 13 bytes, the key will be 12 bytes long. If the value
2805 * for code point 258 is then requested, this code realizes that it would be
2806 * stored under the key for 256, and would find that value and extract the
2807 * relevant bit, offset from 256.
2808 *
2809 * Non-binary properties are stored in as many bits as necessary to represent
2810 * their values (32 currently, though the code is more general than that), not
2811 * as single bits, but the principal is the same: the value for each key is a
2812 * vector that encompasses the property values for all code points whose UTF-8
2813 * representations are represented by the key. That is, for all code points
2814 * whose UTF-8 representations are length N bytes, and the key is the first N-1
2815 * bytes of that.
680c470c 2816 */
a0ed51b3 2817UV
680c470c 2818Perl_swash_fetch(pTHX_ SV *swash, const U8 *ptr, bool do_utf8)
a0ed51b3 2819{
ef8f7699 2820 HV *const hv = MUTABLE_HV(SvRV(swash));
3568d838
JH
2821 U32 klen;
2822 U32 off;
9b56a019 2823 STRLEN slen = 0;
7d85a32c 2824 STRLEN needents;
cfd0369c 2825 const U8 *tmps = NULL;
979f2922 2826 SV *swatch;
08fb1ac5 2827 const U8 c = *ptr;
3568d838 2828
7918f24d
NC
2829 PERL_ARGS_ASSERT_SWASH_FETCH;
2830
87367d5f
KW
2831 /* If it really isn't a hash, it isn't really swash; must be an inversion
2832 * list */
2833 if (SvTYPE(hv) != SVt_PVHV) {
2834 return _invlist_contains_cp((SV*)hv,
2835 (do_utf8)
2836 ? valid_utf8_to_uvchr(ptr, NULL)
2837 : c);
2838 }
2839
08fb1ac5
KW
2840 /* We store the values in a "swatch" which is a vec() value in a swash
2841 * hash. Code points 0-255 are a single vec() stored with key length
2842 * (klen) 0. All other code points have a UTF-8 representation
2843 * 0xAA..0xYY,0xZZ. A vec() is constructed containing all of them which
2844 * share 0xAA..0xYY, which is the key in the hash to that vec. So the key
2845 * length for them is the length of the encoded char - 1. ptr[klen] is the
2846 * final byte in the sequence representing the character */
2847 if (!do_utf8 || UTF8_IS_INVARIANT(c)) {
2848 klen = 0;
2849 needents = 256;
2850 off = c;
3568d838 2851 }
08fb1ac5
KW
2852 else if (UTF8_IS_DOWNGRADEABLE_START(c)) {
2853 klen = 0;
2854 needents = 256;
a62b247b 2855 off = EIGHT_BIT_UTF8_TO_NATIVE(c, *(ptr + 1));
979f2922
ST
2856 }
2857 else {
08fb1ac5
KW
2858 klen = UTF8SKIP(ptr) - 1;
2859
2860 /* Each vec() stores 2**UTF_ACCUMULATION_SHIFT values. The offset into
2861 * the vec is the final byte in the sequence. (In EBCDIC this is
2862 * converted to I8 to get consecutive values.) To help you visualize
2863 * all this:
2864 * Straight 1047 After final byte
2865 * UTF-8 UTF-EBCDIC I8 transform
2866 * U+0400: \xD0\x80 \xB8\x41\x41 \xB8\x41\xA0
2867 * U+0401: \xD0\x81 \xB8\x41\x42 \xB8\x41\xA1
2868 * ...
2869 * U+0409: \xD0\x89 \xB8\x41\x4A \xB8\x41\xA9
2870 * U+040A: \xD0\x8A \xB8\x41\x51 \xB8\x41\xAA
2871 * ...
2872 * U+0412: \xD0\x92 \xB8\x41\x59 \xB8\x41\xB2
2873 * U+0413: \xD0\x93 \xB8\x41\x62 \xB8\x41\xB3
2874 * ...
2875 * U+041B: \xD0\x9B \xB8\x41\x6A \xB8\x41\xBB
2876 * U+041C: \xD0\x9C \xB8\x41\x70 \xB8\x41\xBC
2877 * ...
2878 * U+041F: \xD0\x9F \xB8\x41\x73 \xB8\x41\xBF
2879 * U+0420: \xD0\xA0 \xB8\x42\x41 \xB8\x42\x41
2880 *
2881 * (There are no discontinuities in the elided (...) entries.)
2882 * The UTF-8 key for these 33 code points is '\xD0' (which also is the
2883 * key for the next 31, up through U+043F, whose UTF-8 final byte is
2884 * \xBF). Thus in UTF-8, each key is for a vec() for 64 code points.
2885 * The final UTF-8 byte, which ranges between \x80 and \xBF, is an
2886 * index into the vec() swatch (after subtracting 0x80, which we
2887 * actually do with an '&').
2888 * In UTF-EBCDIC, each key is for a 32 code point vec(). The first 32
2889 * code points above have key '\xB8\x41'. The final UTF-EBCDIC byte has
2890 * dicontinuities which go away by transforming it into I8, and we
2891 * effectively subtract 0xA0 to get the index. */
979f2922 2892 needents = (1 << UTF_ACCUMULATION_SHIFT);
bc3632a8 2893 off = NATIVE_UTF8_TO_I8(ptr[klen]) & UTF_CONTINUATION_MASK;
979f2922 2894 }
7d85a32c 2895
a0ed51b3 2896 /*
4a4088c4 2897 * This single-entry cache saves about 1/3 of the UTF-8 overhead in test
a0ed51b3
LW
2898 * suite. (That is, only 7-8% overall over just a hash cache. Still,
2899 * it's nothing to sniff at.) Pity we usually come through at least
2900 * two function calls to get here...
2901 *
2902 * NB: this code assumes that swatches are never modified, once generated!
2903 */
2904
3568d838 2905 if (hv == PL_last_swash_hv &&
a0ed51b3 2906 klen == PL_last_swash_klen &&
27da23d5 2907 (!klen || memEQ((char *)ptr, (char *)PL_last_swash_key, klen)) )
a0ed51b3
LW
2908 {
2909 tmps = PL_last_swash_tmps;
2910 slen = PL_last_swash_slen;
2911 }
2912 else {
2913 /* Try our second-level swatch cache, kept in a hash. */
e1ec3a88 2914 SV** svp = hv_fetch(hv, (const char*)ptr, klen, FALSE);
a0ed51b3 2915
b0e3252e 2916 /* If not cached, generate it via swatch_get */
979f2922 2917 if (!svp || !SvPOK(*svp)
08fb1ac5
KW
2918 || !(tmps = (const U8*)SvPV_const(*svp, slen)))
2919 {
2920 if (klen) {
2921 const UV code_point = valid_utf8_to_uvchr(ptr, NULL);
2922 swatch = swatch_get(swash,
2923 code_point & ~((UV)needents - 1),
2924 needents);
2925 }
2926 else { /* For the first 256 code points, the swatch has a key of
2927 length 0 */
2928 swatch = swatch_get(swash, 0, needents);
2929 }
979f2922 2930
923e4eb5 2931 if (IN_PERL_COMPILETIME)
623e6609 2932 CopHINTS_set(PL_curcop, PL_hints);
a0ed51b3 2933
979f2922 2934 svp = hv_store(hv, (const char *)ptr, klen, swatch, 0);
a0ed51b3 2935
979f2922
ST
2936 if (!svp || !(tmps = (U8*)SvPV(*svp, slen))
2937 || (slen << 3) < needents)
5637ef5b
NC
2938 Perl_croak(aTHX_ "panic: swash_fetch got improper swatch, "
2939 "svp=%p, tmps=%p, slen=%"UVuf", needents=%"UVuf,
2940 svp, tmps, (UV)slen, (UV)needents);
a0ed51b3
LW
2941 }
2942
2943 PL_last_swash_hv = hv;
16d8f38a 2944 assert(klen <= sizeof(PL_last_swash_key));
eac04b2e 2945 PL_last_swash_klen = (U8)klen;
cfd0369c
NC
2946 /* FIXME change interpvar.h? */
2947 PL_last_swash_tmps = (U8 *) tmps;
a0ed51b3
LW
2948 PL_last_swash_slen = slen;
2949 if (klen)
2950 Copy(ptr, PL_last_swash_key, klen, U8);
2951 }
2952
9faf8d75 2953 switch ((int)((slen << 3) / needents)) {
a0ed51b3 2954 case 1:
e7aca353 2955 return ((UV) tmps[off >> 3] & (1 << (off & 7))) != 0;
a0ed51b3 2956 case 8:
e7aca353 2957 return ((UV) tmps[off]);
a0ed51b3
LW
2958 case 16:
2959 off <<= 1;
e7aca353
JH
2960 return
2961 ((UV) tmps[off ] << 8) +
2962 ((UV) tmps[off + 1]);
a0ed51b3
LW
2963 case 32:
2964 off <<= 2;
e7aca353
JH
2965 return
2966 ((UV) tmps[off ] << 24) +
2967 ((UV) tmps[off + 1] << 16) +
2968 ((UV) tmps[off + 2] << 8) +
2969 ((UV) tmps[off + 3]);
a0ed51b3 2970 }
5637ef5b
NC
2971 Perl_croak(aTHX_ "panic: swash_fetch got swatch of unexpected bit width, "
2972 "slen=%"UVuf", needents=%"UVuf, (UV)slen, (UV)needents);
670f1322 2973 NORETURN_FUNCTION_END;
a0ed51b3 2974}
2b9d42f0 2975
319009ee
KW
2976/* Read a single line of the main body of the swash input text. These are of
2977 * the form:
2978 * 0053 0056 0073
2979 * where each number is hex. The first two numbers form the minimum and
2980 * maximum of a range, and the third is the value associated with the range.
2981 * Not all swashes should have a third number
2982 *
2983 * On input: l points to the beginning of the line to be examined; it points
2984 * to somewhere in the string of the whole input text, and is
2985 * terminated by a \n or the null string terminator.
2986 * lend points to the null terminator of that string
2987 * wants_value is non-zero if the swash expects a third number
2988 * typestr is the name of the swash's mapping, like 'ToLower'
2989 * On output: *min, *max, and *val are set to the values read from the line.
2990 * returns a pointer just beyond the line examined. If there was no
2991 * valid min number on the line, returns lend+1
2992 */
2993
2994STATIC U8*
2995S_swash_scan_list_line(pTHX_ U8* l, U8* const lend, UV* min, UV* max, UV* val,
2996 const bool wants_value, const U8* const typestr)
2997{
2998 const int typeto = typestr[0] == 'T' && typestr[1] == 'o';
2999 STRLEN numlen; /* Length of the number */
02470786
KW
3000 I32 flags = PERL_SCAN_SILENT_ILLDIGIT
3001 | PERL_SCAN_DISALLOW_PREFIX
3002 | PERL_SCAN_SILENT_NON_PORTABLE;
319009ee
KW
3003
3004 /* nl points to the next \n in the scan */
3005 U8* const nl = (U8*)memchr(l, '\n', lend - l);
3006
95543e92
KW
3007 PERL_ARGS_ASSERT_SWASH_SCAN_LIST_LINE;
3008
319009ee
KW
3009 /* Get the first number on the line: the range minimum */
3010 numlen = lend - l;
3011 *min = grok_hex((char *)l, &numlen, &flags, NULL);
c88850db 3012 *max = *min; /* So can never return without setting max */
319009ee
KW
3013 if (numlen) /* If found a hex number, position past it */
3014 l += numlen;
3015 else if (nl) { /* Else, go handle next line, if any */
3016 return nl + 1; /* 1 is length of "\n" */
3017 }
3018 else { /* Else, no next line */
3019 return lend + 1; /* to LIST's end at which \n is not found */
3020 }
3021
3022 /* The max range value follows, separated by a BLANK */
3023 if (isBLANK(*l)) {
3024 ++l;
02470786
KW
3025 flags = PERL_SCAN_SILENT_ILLDIGIT
3026 | PERL_SCAN_DISALLOW_PREFIX
3027 | PERL_SCAN_SILENT_NON_PORTABLE;
319009ee
KW
3028 numlen = lend - l;
3029 *max = grok_hex((char *)l, &numlen, &flags, NULL);
3030 if (numlen)
3031 l += numlen;
3032 else /* If no value here, it is a single element range */
3033 *max = *min;
3034
3035 /* Non-binary tables have a third entry: what the first element of the
24303724 3036 * range maps to. The map for those currently read here is in hex */
319009ee
KW
3037 if (wants_value) {
3038 if (isBLANK(*l)) {
3039 ++l;
f2a7d0fc
KW
3040 flags = PERL_SCAN_SILENT_ILLDIGIT
3041 | PERL_SCAN_DISALLOW_PREFIX
3042 | PERL_SCAN_SILENT_NON_PORTABLE;
3043 numlen = lend - l;
3044 *val = grok_hex((char *)l, &numlen, &flags, NULL);
3045 if (numlen)
3046 l += numlen;
3047 else
3048 *val = 0;
319009ee
KW
3049 }
3050 else {
3051 *val = 0;
3052 if (typeto) {
dcbac5bb 3053 /* diag_listed_as: To%s: illegal mapping '%s' */
319009ee
KW
3054 Perl_croak(aTHX_ "%s: illegal mapping '%s'",
3055 typestr, l);
3056 }
3057 }
3058 }
3059 else
3060 *val = 0; /* bits == 1, then any val should be ignored */
3061 }
3062 else { /* Nothing following range min, should be single element with no
3063 mapping expected */
319009ee
KW
3064 if (wants_value) {
3065 *val = 0;
3066 if (typeto) {
dcbac5bb 3067 /* diag_listed_as: To%s: illegal mapping '%s' */
319009ee
KW
3068 Perl_croak(aTHX_ "%s: illegal mapping '%s'", typestr, l);
3069 }
3070 }
3071 else
3072 *val = 0; /* bits == 1, then val should be ignored */
3073 }
3074
3075 /* Position to next line if any, or EOF */
3076 if (nl)
3077 l = nl + 1;
3078 else
3079 l = lend;
3080
3081 return l;
3082}
3083
979f2922
ST
3084/* Note:
3085 * Returns a swatch (a bit vector string) for a code point sequence
3086 * that starts from the value C<start> and comprises the number C<span>.
3087 * A C<swash> must be an object created by SWASHNEW (see lib/utf8_heavy.pl).
3088 * Should be used via swash_fetch, which will cache the swatch in C<swash>.
3089 */
3090STATIC SV*
b0e3252e 3091S_swatch_get(pTHX_ SV* swash, UV start, UV span)
979f2922
ST
3092{
3093 SV *swatch;
77f9f126 3094 U8 *l, *lend, *x, *xend, *s, *send;
979f2922 3095 STRLEN lcur, xcur, scur;
ef8f7699 3096 HV *const hv = MUTABLE_HV(SvRV(swash));
5c9f4bd2 3097 SV** const invlistsvp = hv_fetchs(hv, "V", FALSE);
36eb48b4 3098
88d45d28
KW
3099 SV** listsvp = NULL; /* The string containing the main body of the table */
3100 SV** extssvp = NULL;
3101 SV** invert_it_svp = NULL;
3102 U8* typestr = NULL;
786861f5
KW
3103 STRLEN bits;
3104 STRLEN octets; /* if bits == 1, then octets == 0 */
3105 UV none;
3106 UV end = start + span;
972dd592 3107
36eb48b4 3108 if (invlistsvp == NULL) {
786861f5
KW
3109 SV** const bitssvp = hv_fetchs(hv, "BITS", FALSE);
3110 SV** const nonesvp = hv_fetchs(hv, "NONE", FALSE);
3111 SV** const typesvp = hv_fetchs(hv, "TYPE", FALSE);
3112 extssvp = hv_fetchs(hv, "EXTRAS", FALSE);
3113 listsvp = hv_fetchs(hv, "LIST", FALSE);
3114 invert_it_svp = hv_fetchs(hv, "INVERT_IT", FALSE);
3115
3116 bits = SvUV(*bitssvp);
3117 none = SvUV(*nonesvp);
3118 typestr = (U8*)SvPV_nolen(*typesvp);
3119 }
36eb48b4
KW
3120 else {
3121 bits = 1;
3122 none = 0;
3123 }
786861f5 3124 octets = bits >> 3; /* if bits == 1, then octets == 0 */
979f2922 3125
b0e3252e 3126 PERL_ARGS_ASSERT_SWATCH_GET;
7918f24d 3127
979f2922 3128 if (bits != 1 && bits != 8 && bits != 16 && bits != 32) {
b0e3252e 3129 Perl_croak(aTHX_ "panic: swatch_get doesn't expect bits %"UVuf,
660a4616 3130 (UV)bits);
979f2922
ST
3131 }
3132
84ea5ef6
KW
3133 /* If overflowed, use the max possible */
3134 if (end < start) {
3135 end = UV_MAX;
3136 span = end - start;
3137 }
3138
979f2922 3139 /* create and initialize $swatch */
979f2922 3140 scur = octets ? (span * octets) : (span + 7) / 8;
e524fe40
NC
3141 swatch = newSV(scur);
3142 SvPOK_on(swatch);
979f2922
ST
3143 s = (U8*)SvPVX(swatch);
3144 if (octets && none) {
0bd48802 3145 const U8* const e = s + scur;
979f2922
ST
3146 while (s < e) {
3147 if (bits == 8)
3148 *s++ = (U8)(none & 0xff);
3149 else if (bits == 16) {
3150 *s++ = (U8)((none >> 8) & 0xff);
3151 *s++ = (U8)( none & 0xff);
3152 }
3153 else if (bits == 32) {
3154 *s++ = (U8)((none >> 24) & 0xff);
3155 *s++ = (U8)((none >> 16) & 0xff);
3156 *s++ = (U8)((none >> 8) & 0xff);
3157 *s++ = (U8)( none & 0xff);
3158 }
3159 }
3160 *s = '\0';
3161 }
3162 else {
3163 (void)memzero((U8*)s, scur + 1);
3164 }
3165 SvCUR_set(swatch, scur);
3166 s = (U8*)SvPVX(swatch);
3167
36eb48b4
KW
3168 if (invlistsvp) { /* If has an inversion list set up use that */
3169 _invlist_populate_swatch(*invlistsvp, start, end, s);
3170 return swatch;
3171 }
3172
3173 /* read $swash->{LIST} */
979f2922
ST
3174 l = (U8*)SvPV(*listsvp, lcur);
3175 lend = l + lcur;
3176 while (l < lend) {
8ed25d53 3177 UV min, max, val, upper;
95543e92
KW
3178 l = swash_scan_list_line(l, lend, &min, &max, &val,
3179 cBOOL(octets), typestr);
319009ee 3180 if (l > lend) {
979f2922
ST
3181 break;
3182 }
3183
972dd592 3184 /* If looking for something beyond this range, go try the next one */
979f2922
ST
3185 if (max < start)
3186 continue;
3187
8ed25d53
KW
3188 /* <end> is generally 1 beyond where we want to set things, but at the
3189 * platform's infinity, where we can't go any higher, we want to
3190 * include the code point at <end> */
3191 upper = (max < end)
3192 ? max
3193 : (max != UV_MAX || end != UV_MAX)
3194 ? end - 1
3195 : end;
3196
979f2922 3197 if (octets) {
35da51f7 3198 UV key;
979f2922
ST
3199 if (min < start) {
3200 if (!none || val < none) {
3201 val += start - min;
3202 }
3203 min = start;
3204 }
8ed25d53 3205 for (key = min; key <= upper; key++) {
979f2922 3206 STRLEN offset;
979f2922
ST
3207 /* offset must be non-negative (start <= min <= key < end) */
3208 offset = octets * (key - start);
3209 if (bits == 8)
3210 s[offset] = (U8)(val & 0xff);
3211 else if (bits == 16) {
3212 s[offset ] = (U8)((val >> 8) & 0xff);
3213 s[offset + 1] = (U8)( val & 0xff);
3214 }
3215 else if (bits == 32) {
3216 s[offset ] = (U8)((val >> 24) & 0xff);
3217 s[offset + 1] = (U8)((val >> 16) & 0xff);
3218 s[offset + 2] = (U8)((val >> 8) & 0xff);
3219 s[offset + 3] = (U8)( val & 0xff);
3220 }
3221
3222 if (!none || val < none)
3223 ++val;
3224 }
3225 }
711a919c 3226 else { /* bits == 1, then val should be ignored */
35da51f7 3227 UV key;
979f2922
ST
3228 if (min < start)
3229 min = start;
6cb05c12 3230
8ed25d53 3231 for (key = min; key <= upper; key++) {
0bd48802 3232 const STRLEN offset = (STRLEN)(key - start);
979f2922
ST
3233 s[offset >> 3] |= 1 << (offset & 7);
3234 }
3235 }
3236 } /* while */
979f2922 3237
9479a769 3238 /* Invert if the data says it should be. Assumes that bits == 1 */
77f9f126 3239 if (invert_it_svp && SvUV(*invert_it_svp)) {
0bda3001
KW
3240
3241 /* Unicode properties should come with all bits above PERL_UNICODE_MAX
3242 * be 0, and their inversion should also be 0, as we don't succeed any
3243 * Unicode property matches for non-Unicode code points */
3244 if (start <= PERL_UNICODE_MAX) {
3245
3246 /* The code below assumes that we never cross the
3247 * Unicode/above-Unicode boundary in a range, as otherwise we would
3248 * have to figure out where to stop flipping the bits. Since this
3249 * boundary is divisible by a large power of 2, and swatches comes
3250 * in small powers of 2, this should be a valid assumption */
3251 assert(start + span - 1 <= PERL_UNICODE_MAX);
3252
507a8485
KW
3253 send = s + scur;
3254 while (s < send) {
3255 *s = ~(*s);
3256 s++;
3257 }
0bda3001 3258 }
77f9f126
KW
3259 }
3260
d73c39c5
KW
3261 /* read $swash->{EXTRAS}
3262 * This code also copied to swash_to_invlist() below */
979f2922
ST
3263 x = (U8*)SvPV(*extssvp, xcur);
3264 xend = x + xcur;
3265 while (x < xend) {
3266 STRLEN namelen;
3267 U8 *namestr;
3268 SV** othersvp;
3269 HV* otherhv;
3270 STRLEN otherbits;
3271 SV **otherbitssvp, *other;
711a919c 3272 U8 *s, *o, *nl;
979f2922
ST
3273 STRLEN slen, olen;
3274
35da51f7 3275 const U8 opc = *x++;
979f2922
ST
3276 if (opc == '\n')
3277 continue;
3278
3279 nl = (U8*)memchr(x, '\n', xend - x);
3280
3281 if (opc != '-' && opc != '+' && opc != '!' && opc != '&') {
3282 if (nl) {
3283 x = nl + 1; /* 1 is length of "\n" */
3284 continue;
3285 }
3286 else {
3287 x = xend; /* to EXTRAS' end at which \n is not found */
3288 break;
3289 }
3290 }
3291
3292 namestr = x;
3293 if (nl) {
3294 namelen = nl - namestr;
3295 x = nl + 1;
3296 }
3297 else {
3298 namelen = xend - namestr;
3299 x = xend;
3300 }
3301
3302 othersvp = hv_fetch(hv, (char *)namestr, namelen, FALSE);
ef8f7699 3303 otherhv = MUTABLE_HV(SvRV(*othersvp));
017a3ce5 3304 otherbitssvp = hv_fetchs(otherhv, "BITS", FALSE);
979f2922
ST
3305 otherbits = (STRLEN)SvUV(*otherbitssvp);
3306 if (bits < otherbits)
5637ef5b
NC
3307 Perl_croak(aTHX_ "panic: swatch_get found swatch size mismatch, "
3308 "bits=%"UVuf", otherbits=%"UVuf, (UV)bits, (UV)otherbits);
979f2922
ST
3309
3310 /* The "other" swatch must be destroyed after. */
b0e3252e 3311 other = swatch_get(*othersvp, start, span);
979f2922
ST
3312 o = (U8*)SvPV(other, olen);
3313
3314 if (!olen)
b0e3252e 3315 Perl_croak(aTHX_ "panic: swatch_get got improper swatch");
979f2922
ST
3316
3317 s = (U8*)SvPV(swatch, slen);
3318 if (bits == 1 && otherbits == 1) {
3319 if (slen != olen)
5637ef5b
NC
3320 Perl_croak(aTHX_ "panic: swatch_get found swatch length "
3321 "mismatch, slen=%"UVuf", olen=%"UVuf,
3322 (UV)slen, (UV)olen);
979f2922
ST
3323
3324 switch (opc) {
3325 case '+':
3326 while (slen--)
3327 *s++ |= *o++;
3328 break;
3329 case '!':
3330 while (slen--)
3331 *s++ |= ~*o++;
3332 break;
3333 case '-':
3334 while (slen--)
3335 *s++ &= ~*o++;
3336 break;
3337 case '&':
3338 while (slen--)
3339 *s++ &= *o++;
3340 break;
3341 default:
3342 break;
3343 }
3344 }
711a919c 3345 else {
979f2922
ST
3346 STRLEN otheroctets = otherbits >> 3;
3347 STRLEN offset = 0;
35da51f7 3348 U8* const send = s + slen;
979f2922
ST
3349
3350 while (s < send) {
3351 UV otherval = 0;
3352
3353 if (otherbits == 1) {
3354 otherval = (o[offset >> 3] >> (offset & 7)) & 1;
3355 ++offset;
3356 }
3357 else {
3358 STRLEN vlen = otheroctets;
3359 otherval = *o++;
3360 while (--vlen) {
3361 otherval <<= 8;
3362 otherval |= *o++;
3363 }
3364 }
3365
711a919c 3366 if (opc == '+' && otherval)
6f207bd3 3367 NOOP; /* replace with otherval */
979f2922
ST
3368 else if (opc == '!' && !otherval)
3369 otherval = 1;
3370 else if (opc == '-' && otherval)
3371 otherval = 0;
3372 else if (opc == '&' && !otherval)
3373 otherval = 0;
3374 else {
711a919c 3375 s += octets; /* no replacement */
979f2922
ST
3376 continue;
3377 }
3378
3379 if (bits == 8)
3380 *s++ = (U8)( otherval & 0xff);
3381 else if (bits == 16) {
3382 *s++ = (U8)((otherval >> 8) & 0xff);
3383 *s++ = (U8)( otherval & 0xff);
3384 }
3385 else if (bits == 32) {
3386 *s++ = (U8)((otherval >> 24) & 0xff);
3387 *s++ = (U8)((otherval >> 16) & 0xff);
3388 *s++ = (U8)((otherval >> 8) & 0xff);
3389 *s++ = (U8)( otherval & 0xff);
3390 }
3391 }
3392 }
3393 sv_free(other); /* through with it! */
3394 } /* while */
3395 return swatch;
3396}
3397
064c021d 3398HV*
4c2e1131 3399Perl__swash_inversion_hash(pTHX_ SV* const swash)
064c021d
KW
3400{
3401
79a2a0e8 3402 /* Subject to change or removal. For use only in regcomp.c and regexec.c
5662e334
KW
3403 * Can't be used on a property that is subject to user override, as it
3404 * relies on the value of SPECIALS in the swash which would be set by
3405 * utf8_heavy.pl to the hash in the non-overriden file, and hence is not set
3406 * for overridden properties
064c021d
KW
3407 *
3408 * Returns a hash which is the inversion and closure of a swash mapping.
3409 * For example, consider the input lines:
3410 * 004B 006B
3411 * 004C 006C
3412 * 212A 006B
3413 *
4a4088c4 3414 * The returned hash would have two keys, the UTF-8 for 006B and the UTF-8 for
064c021d 3415 * 006C. The value for each key is an array. For 006C, the array would
4a4088c4
KW
3416 * have two elements, the UTF-8 for itself, and for 004C. For 006B, there
3417 * would be three elements in its array, the UTF-8 for 006B, 004B and 212A.
064c021d 3418 *
538e84ed
KW
3419 * Note that there are no elements in the hash for 004B, 004C, 212A. The
3420 * keys are only code points that are folded-to, so it isn't a full closure.
3421 *
064c021d
KW
3422 * Essentially, for any code point, it gives all the code points that map to
3423 * it, or the list of 'froms' for that point.
3424 *
5662e334
KW
3425 * Currently it ignores any additions or deletions from other swashes,
3426 * looking at just the main body of the swash, and if there are SPECIALS
3427 * in the swash, at that hash
3428 *
3429 * The specials hash can be extra code points, and most likely consists of
3430 * maps from single code points to multiple ones (each expressed as a string
4a4088c4 3431 * of UTF-8 characters). This function currently returns only 1-1 mappings.
5662e334
KW
3432 * However consider this possible input in the specials hash:
3433 * "\xEF\xAC\x85" => "\x{0073}\x{0074}", # U+FB05 => 0073 0074
3434 * "\xEF\xAC\x86" => "\x{0073}\x{0074}", # U+FB06 => 0073 0074
3435 *
3436 * Both FB05 and FB06 map to the same multi-char sequence, which we don't
3437 * currently handle. But it also means that FB05 and FB06 are equivalent in
3438 * a 1-1 mapping which we should handle, and this relationship may not be in
3439 * the main table. Therefore this function examines all the multi-char
74894415
KW
3440 * sequences and adds the 1-1 mappings that come out of that.
3441 *
3442 * XXX This function was originally intended to be multipurpose, but its
3443 * only use is quite likely to remain for constructing the inversion of
3444 * the CaseFolding (//i) property. If it were more general purpose for
3445 * regex patterns, it would have to do the FB05/FB06 game for simple folds,
3446 * because certain folds are prohibited under /iaa and /il. As an example,
3447 * in Unicode 3.0.1 both U+0130 and U+0131 fold to 'i', and hence are both
3448 * equivalent under /i. But under /iaa and /il, the folds to 'i' are
3449 * prohibited, so we would not figure out that they fold to each other.
3450 * Code could be written to automatically figure this out, similar to the
3451 * code that does this for multi-character folds, but this is the only case
3452 * where something like this is ever likely to happen, as all the single
7ee537e6 3453 * char folds to the 0-255 range are now quite settled. Instead there is a
74894415
KW
3454 * little special code that is compiled only for this Unicode version. This
3455 * is smaller and didn't require much coding time to do. But this makes
3456 * this routine strongly tied to being used just for CaseFolding. If ever
3457 * it should be generalized, this would have to be fixed */
064c021d
KW
3458
3459 U8 *l, *lend;
3460 STRLEN lcur;
3461 HV *const hv = MUTABLE_HV(SvRV(swash));
3462
923b6d4e
KW
3463 /* The string containing the main body of the table. This will have its
3464 * assertion fail if the swash has been converted to its inversion list */
064c021d
KW
3465 SV** const listsvp = hv_fetchs(hv, "LIST", FALSE);
3466
3467 SV** const typesvp = hv_fetchs(hv, "TYPE", FALSE);
3468 SV** const bitssvp = hv_fetchs(hv, "BITS", FALSE);
3469 SV** const nonesvp = hv_fetchs(hv, "NONE", FALSE);
3470 /*SV** const extssvp = hv_fetchs(hv, "EXTRAS", FALSE);*/
3471 const U8* const typestr = (U8*)SvPV_nolen(*typesvp);
3472 const STRLEN bits = SvUV(*bitssvp);
3473 const STRLEN octets = bits >> 3; /* if bits == 1, then octets == 0 */
3474 const UV none = SvUV(*nonesvp);
5662e334 3475 SV **specials_p = hv_fetchs(hv, "SPECIALS", 0);
064c021d
KW
3476
3477 HV* ret = newHV();
3478
3479 PERL_ARGS_ASSERT__SWASH_INVERSION_HASH;
3480
3481 /* Must have at least 8 bits to get the mappings */
3482 if (bits != 8 && bits != 16 && bits != 32) {
3483 Perl_croak(aTHX_ "panic: swash_inversion_hash doesn't expect bits %"UVuf,
3484 (UV)bits);
3485 }
3486
5662e334
KW
3487 if (specials_p) { /* It might be "special" (sometimes, but not always, a
3488 mapping to more than one character */
3489
3490 /* Construct an inverse mapping hash for the specials */
3491 HV * const specials_hv = MUTABLE_HV(SvRV(*specials_p));
3492 HV * specials_inverse = newHV();
3493 char *char_from; /* the lhs of the map */
3494 I32 from_len; /* its byte length */
3495 char *char_to; /* the rhs of the map */
3496 I32 to_len; /* its byte length */
3497 SV *sv_to; /* and in a sv */
3498 AV* from_list; /* list of things that map to each 'to' */
3499
3500 hv_iterinit(specials_hv);
3501
4a4088c4
KW
3502 /* The keys are the characters (in UTF-8) that map to the corresponding
3503 * UTF-8 string value. Iterate through the list creating the inverse
5662e334
KW
3504 * list. */
3505 while ((sv_to = hv_iternextsv(specials_hv, &char_from, &from_len))) {
3506 SV** listp;
3507 if (! SvPOK(sv_to)) {
5637ef5b
NC
3508 Perl_croak(aTHX_ "panic: value returned from hv_iternextsv() "
3509 "unexpectedly is not a string, flags=%lu",
3510 (unsigned long)SvFLAGS(sv_to));
5662e334 3511 }
4b88fb76 3512 /*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)));*/
5662e334
KW
3513
3514 /* Each key in the inverse list is a mapped-to value, and the key's
4a4088c4 3515 * hash value is a list of the strings (each in UTF-8) that map to
5662e334
KW
3516 * it. Those strings are all one character long */
3517 if ((listp = hv_fetch(specials_inverse,
3518 SvPVX(sv_to),
3519 SvCUR(sv_to), 0)))
3520 {
3521 from_list = (AV*) *listp;
3522 }
3523 else { /* No entry yet for it: create one */
3524 from_list = newAV();
3525 if (! hv_store(specials_inverse,
3526 SvPVX(sv_to),
3527 SvCUR(sv_to),
3528 (SV*) from_list, 0))
3529 {
3530 Perl_croak(aTHX_ "panic: hv_store() unexpectedly failed");
3531 }
3532 }
3533
3534 /* Here have the list associated with this 'to' (perhaps newly
3535 * created and empty). Just add to it. Note that we ASSUME that
3536 * the input is guaranteed to not have duplications, so we don't
3537 * check for that. Duplications just slow down execution time. */
3538 av_push(from_list, newSVpvn_utf8(char_from, from_len, TRUE));
3539 }
3540
3541 /* Here, 'specials_inverse' contains the inverse mapping. Go through
3542 * it looking for cases like the FB05/FB06 examples above. There would
3543 * be an entry in the hash like
3544 * 'st' => [ FB05, FB06 ]
3545 * In this example we will create two lists that get stored in the
3546 * returned hash, 'ret':
3547 * FB05 => [ FB05, FB06 ]
3548 * FB06 => [ FB05, FB06 ]
3549 *
3550 * Note that there is nothing to do if the array only has one element.
3551 * (In the normal 1-1 case handled below, we don't have to worry about
3552 * two lists, as everything gets tied to the single list that is
3553 * generated for the single character 'to'. But here, we are omitting
3554 * that list, ('st' in the example), so must have multiple lists.) */
3555 while ((from_list = (AV *) hv_iternextsv(specials_inverse,
3556 &char_to, &to_len)))
3557 {
b9f2b683 3558 if (av_tindex(from_list) > 0) {
c70927a6 3559 SSize_t i;
5662e334
KW
3560
3561 /* We iterate over all combinations of i,j to place each code
3562 * point on each list */
b9f2b683 3563 for (i = 0; i <= av_tindex(from_list); i++) {
c70927a6 3564 SSize_t j;
5662e334
KW
3565 AV* i_list = newAV();
3566 SV** entryp = av_fetch(from_list, i, FALSE);
3567 if (entryp == NULL) {
3568 Perl_croak(aTHX_ "panic: av_fetch() unexpectedly failed");
3569 }
3570 if (hv_fetch(ret, SvPVX(*entryp), SvCUR(*entryp), FALSE)) {
3571 Perl_croak(aTHX_ "panic: unexpected entry for %s", SvPVX(*entryp));
3572 }
3573 if (! hv_store(ret, SvPVX(*entryp), SvCUR(*entryp),
3574 (SV*) i_list, FALSE))
3575 {
3576 Perl_croak(aTHX_ "panic: hv_store() unexpectedly failed");
3577 }
3578
538e84ed 3579 /* For DEBUG_U: UV u = valid_utf8_to_uvchr((U8*) SvPVX(*entryp), 0);*/
b9f2b683 3580 for (j = 0; j <= av_tindex(from_list); j++) {
5662e334
KW
3581 entryp = av_fetch(from_list, j, FALSE);
3582 if (entryp == NULL) {
3583 Perl_croak(aTHX_ "panic: av_fetch() unexpectedly failed");
3584 }
3585
3586 /* When i==j this adds itself to the list */
4b88fb76
KW
3587 av_push(i_list, newSVuv(utf8_to_uvchr_buf(
3588 (U8*) SvPVX(*entryp),
3589 (U8*) SvPVX(*entryp) + SvCUR(*entryp),
3590 0)));
4637d003 3591 /*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));*/
5662e334
KW
3592 }
3593 }
3594 }
3595 }
3596 SvREFCNT_dec(specials_inverse); /* done with it */
3597 } /* End of specials */
3598
064c021d 3599 /* read $swash->{LIST} */
74894415
KW
3600
3601#if UNICODE_MAJOR_VERSION == 3 \
3602 && UNICODE_DOT_VERSION == 0 \
3603 && UNICODE_DOT_DOT_VERSION == 1
3604
3605 /* For this version only U+130 and U+131 are equivalent under qr//i. Add a
3606 * rule so that things work under /iaa and /il */
3607
3608 SV * mod_listsv = sv_mortalcopy(*listsvp);
3609 sv_catpv(mod_listsv, "130\t130\t131\n");
3610 l = (U8*)SvPV(mod_listsv, lcur);
3611
3612#else
3613
064c021d 3614 l = (U8*)SvPV(*listsvp, lcur);
74894415
KW
3615
3616#endif
3617
064c021d
KW
3618 lend = l + lcur;
3619
3620 /* Go through each input line */
3621 while (l < lend) {
3622 UV min, max, val;
3623 UV inverse;
95543e92
KW
3624 l = swash_scan_list_line(l, lend, &min, &max, &val,
3625 cBOOL(octets), typestr);
064c021d
KW
3626 if (l > lend) {
3627 break;
3628 }
3629
3630 /* Each element in the range is to be inverted */
3631 for (inverse = min; inverse <= max; inverse++) {
3632 AV* list;
064c021d
KW
3633 SV** listp;
3634 IV i;
3635 bool found_key = FALSE;
5662e334 3636 bool found_inverse = FALSE;
064c021d
KW
3637
3638 /* The key is the inverse mapping */
3639 char key[UTF8_MAXBYTES+1];
c80e42f3 3640 char* key_end = (char *) uvchr_to_utf8((U8*) key, val);
064c021d
KW
3641 STRLEN key_len = key_end - key;