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