newlen = 0xFFFF;
#endif
}
- else
+ else {
+ /* This is annoying, because sv_force_normal_flags will fix the flags,
+ recurse into sv_grow to malloc a buffer of SvCUR(sv) + 1, then
+ return back to us, only for us to potentially realloc the buffer.
+ */
+ if (SvIsCOW(sv))
+ sv_force_normal_flags(sv, 0);
s = SvPVX(sv);
+ }
if (newlen > SvLEN(sv)) { /* need more room? */
if (SvLEN(sv) && s) {
char *pvx = SvPVX(sv);
STRLEN len = SvCUR(sv);
U32 hash = SvUVX(sv);
+ SvFAKE_off(sv);
+ SvREADONLY_off(sv);
SvGROW(sv, len + 1);
Move(pvx,SvPVX(sv),len,char);
*SvEND(sv) = '\0';
- SvFAKE_off(sv);
- SvREADONLY_off(sv);
unsharepvn(pvx, SvUTF8(sv) ? -(I32)len : len, hash);
}
else if (PL_curcop != &PL_compiling)
require './test.pl';
}
-plan tests => 3;
+plan tests => 5;
eval { for (\2) { $_ = <FH> } };
like($@, 'Modification of a read-only value attempted', '[perl #19566]');
is($a .= <A>, 4, '#21628 - $a .= <A> , A closed');
unlink "a";
}
+
+# 82 is chosen to exceed the length for sv_grow in do_readline (80)
+foreach my $k ('k', 'k'x82) {
+ my $result
+ = runperl (switches => '-l', stdin => '', stderr => 1,
+ prog => "%a = qw($k v); \$_ = <> foreach keys %a; print qw(end)",
+ );
+ is ($result, "end", '[perl #21614] for length ' . length $k);
+}