This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
https://perl5.git.perl.org / perl5.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
toke.c: Some simple mending to get readline() working with UTF-8 filehandles
[perl5.git] / pp.c
<
CommitLineData
a0d0e21e 1/* pp.c
79072805 2 *
1129b882
NC		 3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
79072805 5 *
a0d0e21e
LW		 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.
79072805 8 *
a0d0e21e
LW		 9 */
10
11/*
4ac71550
TC		 12 * 'It's a big house this, and very peculiar. Always a bit more
13 * to discover, and no knowing what you'll find round a corner.
14 * And Elves, sir!' --Samwise Gamgee
15 *
16 * [p.225 of _The Lord of the Rings_, II/i: "Many Meetings"]
a0d0e21e 17 */
79072805 18
166f8a29
DM		 19/* This file contains general pp ("push/pop") functions that execute the
20 * opcodes that make up a perl program. A typical pp function expects to
21 * find its arguments on the stack, and usually pushes its results onto
22 * the stack, hence the 'pp' terminology. Each OP structure contains
23 * a pointer to the relevant pp_foo() function.
24 */
25
79072805 26#include "EXTERN.h"
864dbfa3 27#define PERL_IN_PP_C
79072805 28#include "perl.h"
77bc9082 29#include "keywords.h"
79072805 30
a4af207c
JH		 31#include "reentr.h"
32
dfe9444c
AD		 33/* XXX I can't imagine anyone who doesn't have this actually _needs_
34 it, since pid_t is an integral type.
35 --AD 2/20/1998
36*/
37#ifdef NEED_GETPID_PROTO
38extern Pid_t getpid (void);
8ac85365
NIS		 39#endif
40
0630166f
SP		 41/*
42 * Some BSDs and Cygwin default to POSIX math instead of IEEE.
43 * This switches them over to IEEE.
44 */
45#if defined(LIBM_LIB_VERSION)
46 _LIB_VERSION_TYPE _LIB_VERSION = _IEEE_;
47#endif
48
13017935
SM		 49/* variations on pp_null */
50
93a17b20
LW		 51PP(pp_stub)
52{
97aff369 53 dVAR;
39644a26 54 dSP;
54310121 55 if (GIMME_V == G_SCALAR)
3280af22 56 XPUSHs(&PL_sv_undef);
93a17b20
LW		 57 RETURN;
58}
59
79072805
LW		 60/* Pushy stuff. */
61
93a17b20
LW		 62PP(pp_padav)
63{
97aff369 64 dVAR; dSP; dTARGET;
13017935 65 I32 gimme;
e190e9b4 66 assert(SvTYPE(TARG) == SVt_PVAV);
533c011a 67 if (PL_op->op_private & OPpLVAL_INTRO)
a5911867
RGS		 68 if (!(PL_op->op_private & OPpPAD_STATE))
69 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
85e6fe83 70 EXTEND(SP, 1);
533c011a 71 if (PL_op->op_flags & OPf_REF) {
85e6fe83 72 PUSHs(TARG);
93a17b20 73 RETURN;
40c94d11
FC		 74 } else if (PL_op->op_private & OPpMAYBE_LVSUB) {
75 const I32 flags = is_lvalue_sub();
76 if (flags && !(flags & OPpENTERSUB_INARGS)) {
78f9721b
SM		 77 if (GIMME == G_SCALAR)
78 Perl_croak(aTHX_ "Can't return array to lvalue scalar context");
79 PUSHs(TARG);
80 RETURN;
40c94d11 81 }
85e6fe83 82 }
13017935
SM		 83 gimme = GIMME_V;
84 if (gimme == G_ARRAY) {
502c6561 85 const I32 maxarg = AvFILL(MUTABLE_AV(TARG)) + 1;
85e6fe83 86 EXTEND(SP, maxarg);
93965878
NIS		 87 if (SvMAGICAL(TARG)) {
88 U32 i;
eb160463 89 for (i=0; i < (U32)maxarg; i++) {
502c6561 90 SV * const * const svp = av_fetch(MUTABLE_AV(TARG), i, FALSE);
3280af22 91 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
93965878
NIS		 92 }
93 }
94 else {
502c6561 95 Copy(AvARRAY((const AV *)TARG), SP+1, maxarg, SV*);
93965878 96 }
85e6fe83
LW		 97 SP += maxarg;
98 }
13017935 99 else if (gimme == G_SCALAR) {
1b6737cc 100 SV* const sv = sv_newmortal();
502c6561 101 const I32 maxarg = AvFILL(MUTABLE_AV(TARG)) + 1;
85e6fe83
LW		 102 sv_setiv(sv, maxarg);
103 PUSHs(sv);
104 }
105 RETURN;
93a17b20
LW		 106}
107
108PP(pp_padhv)
109{
97aff369 110 dVAR; dSP; dTARGET;
54310121 111 I32 gimme;
112
e190e9b4 113 assert(SvTYPE(TARG) == SVt_PVHV);
93a17b20 114 XPUSHs(TARG);
533c011a 115 if (PL_op->op_private & OPpLVAL_INTRO)
a5911867
RGS		 116 if (!(PL_op->op_private & OPpPAD_STATE))
117 SAVECLEARSV(PAD_SVl(PL_op->op_targ));
533c011a 118 if (PL_op->op_flags & OPf_REF)
93a17b20 119 RETURN;
40c94d11
FC		 120 else if (PL_op->op_private & OPpMAYBE_LVSUB) {
121 const I32 flags = is_lvalue_sub();
122 if (flags && !(flags & OPpENTERSUB_INARGS)) {
78f9721b
SM		 123 if (GIMME == G_SCALAR)
124 Perl_croak(aTHX_ "Can't return hash to lvalue scalar context");
125 RETURN;
40c94d11 126 }
78f9721b 127 }
54310121 128 gimme = GIMME_V;
129 if (gimme == G_ARRAY) {
981b7185 130 RETURNOP(Perl_do_kv(aTHX));
85e6fe83 131 }
54310121 132 else if (gimme == G_SCALAR) {
85fbaab2 133 SV* const sv = Perl_hv_scalar(aTHX_ MUTABLE_HV(TARG));
85e6fe83 134 SETs(sv);
85e6fe83 135 }
54310121 136 RETURN;
93a17b20
LW		 137}
138
79072805
LW		 139/* Translations. */
140
4bdf8368 141static const char S_no_symref_sv[] =
def89bff
NC		 142 "Can't use string (\"%" SVf32 "\"%s) as %s ref while \"strict refs\" in use";
143
6f7909da
FC		 144/* In some cases this function inspects PL_op. If this function is called
145 for new op types, more bool parameters may need to be added in place of
146 the checks.
147
148 When noinit is true, the absence of a gv will cause a retval of undef.
149 This is unrelated to the cv-to-gv assignment case.
8ec5e241 150
6f7909da
FC		 151 Make sure to use SPAGAIN after calling this.
152*/
153
154static SV *
155S_rv2gv(pTHX_ SV *sv, const bool vivify_sv, const bool strict,
156 const bool noinit)
157{
14f0f125 158 dVAR;
f64c9ac5 159 if (!isGV(sv) || SvFAKE(sv)) SvGETMAGIC(sv);
ed6116ce 160 if (SvROK(sv)) {
93d7320b
DM		 161 if (SvAMAGIC(sv)) {
162 sv = amagic_deref_call(sv, to_gv_amg);
93d7320b 163 }
e4a1664f 164 wasref:
ed6116ce 165 sv = SvRV(sv);
b1dadf13 166 if (SvTYPE(sv) == SVt_PVIO) {
159b6efe 167 GV * const gv = MUTABLE_GV(sv_newmortal());
b1dadf13 168 gv_init(gv, 0, "", 0, 0);
a45c7426 169 GvIOp(gv) = MUTABLE_IO(sv);
b37c2d43 170 SvREFCNT_inc_void_NN(sv);
ad64d0ec 171 sv = MUTABLE_SV(gv);
ef54e1a4 172 }
6e592b3a 173 else if (!isGV_with_GP(sv))
6f7909da 174 return (SV *)Perl_die(aTHX_ "Not a GLOB reference");
79072805
LW		 175 }
176 else {
6e592b3a 177 if (!isGV_with_GP(sv)) {
f132ae69 178 if (!SvOK(sv)) {
b13b2135 179 /* If this is a 'my' scalar and flag is set then vivify
853846ea 180 * NI-S 1999/05/07
b13b2135 181 */
f132ae69 182 if (vivify_sv && sv != &PL_sv_undef) {
2c8ac474 183 GV *gv;
ce74145d
FC		 184 if (SvREADONLY(sv))
185 Perl_croak_no_modify(aTHX);
2c8ac474 186 if (cUNOP->op_targ) {
0bd48802 187 SV * const namesv = PAD_SV(cUNOP->op_targ);
159b6efe 188 gv = MUTABLE_GV(newSV(0));
6b10071b 189 gv_init_sv(gv, CopSTASH(PL_curcop), namesv, 0);
2c8ac474
GS		 190 }
191 else {
0bd48802 192 const char * const name = CopSTASHPV(PL_curcop);
6b10071b
BF		 193 gv = newGVgen_flags(name,
194 HvNAMEUTF8(CopSTASH(PL_curcop)) ? SVf_UTF8 : 0 );
1d8d4d2a 195 }
43230e26 196 prepare_SV_for_RV(sv);
ad64d0ec 197 SvRV_set(sv, MUTABLE_SV(gv));
853846ea 198 SvROK_on(sv);
1d8d4d2a 199 SvSETMAGIC(sv);
853846ea 200 goto wasref;
2c8ac474 201 }
6f7909da
FC		 202 if (PL_op->op_flags & OPf_REF || strict)
203 return (SV *)Perl_die(aTHX_ PL_no_usym, "a symbol");
599cee73 204 if (ckWARN(WARN_UNINITIALIZED))
29489e7c 205 report_uninit(sv);
6f7909da 206 return &PL_sv_undef;
a0d0e21e 207 }
6f7909da 208 if (noinit)
35cd451c 209 {
77cb3b01
FC		 210 if (!(sv = MUTABLE_SV(gv_fetchsv_nomg(
211 sv, GV_ADDMG, SVt_PVGV
23496c6e 212 ))))
6f7909da 213 return &PL_sv_undef;
35cd451c
GS		 214 }
215 else {
6f7909da
FC		 216 if (strict)
217 return
218 (SV *)Perl_die(aTHX_
219 S_no_symref_sv,
220 sv,
221 (SvPOK(sv) && SvCUR(sv)>32 ? "..." : ""),
222 "a symbol"
223 );
e26df76a
NC		 224 if ((PL_op->op_private & (OPpLVAL_INTRO|OPpDONT_INIT_GV))
225 == OPpDONT_INIT_GV) {
226 /* We are the target of a coderef assignment. Return
227 the scalar unchanged, and let pp_sasssign deal with
228 things. */
6f7909da 229 return sv;
e26df76a 230 }
77cb3b01 231 sv = MUTABLE_SV(gv_fetchsv_nomg(sv, GV_ADD, SVt_PVGV));
35cd451c 232 }
2acc3314 233 /* FAKE globs in the symbol table cause weird bugs (#77810) */
96293f45 234 SvFAKE_off(sv);
93a17b20 235 }
79072805 236 }
96293f45 237 if (SvFAKE(sv)) {
2acc3314 238 SV *newsv = sv_newmortal();
5cf4b255 239 sv_setsv_flags(newsv, sv, 0);
2acc3314 240 SvFAKE_off(newsv);
d8906c05 241 sv = newsv;
2acc3314 242 }
6f7909da
FC		 243 return sv;
244}
245
246PP(pp_rv2gv)
247{
248 dVAR; dSP; dTOPss;
249
250 sv = S_rv2gv(aTHX_
251 sv, PL_op->op_private & OPpDEREF,
252 PL_op->op_private & HINT_STRICT_REFS,
253 ((PL_op->op_flags & OPf_SPECIAL) && !(PL_op->op_flags & OPf_MOD))
254 || PL_op->op_type == OP_READLINE
255 );
256 SPAGAIN;
d8906c05
FC		 257 if (PL_op->op_private & OPpLVAL_INTRO)
258 save_gp(MUTABLE_GV(sv), !(PL_op->op_flags & OPf_SPECIAL));
259 SETs(sv);
79072805
LW		 260 RETURN;
261}
262
dc3c76f8
NC		 263/* Helper function for pp_rv2sv and pp_rv2av */
264GV *
fe9845cc
RB		 265Perl_softref2xv(pTHX_ SV *const sv, const char *const what,
266 const svtype type, SV ***spp)
dc3c76f8
NC		 267{
268 dVAR;
269 GV *gv;
270
7918f24d
NC		 271 PERL_ARGS_ASSERT_SOFTREF2XV;
272
dc3c76f8
NC		 273 if (PL_op->op_private & HINT_STRICT_REFS) {
274 if (SvOK(sv))
10b53e54 275 Perl_die(aTHX_ S_no_symref_sv, sv, (SvPOK(sv) && SvCUR(sv)>32 ? "..." : ""), what);
dc3c76f8
NC		 276 else
277 Perl_die(aTHX_ PL_no_usym, what);
278 }
279 if (!SvOK(sv)) {
fd1d9b5c
FC		 280 if (
281 PL_op->op_flags & OPf_REF &&
282 PL_op->op_next->op_type != OP_BOOLKEYS
283 )
dc3c76f8
NC		 284 Perl_die(aTHX_ PL_no_usym, what);
285 if (ckWARN(WARN_UNINITIALIZED))
286 report_uninit(sv);
287 if (type != SVt_PV && GIMME_V == G_ARRAY) {
288 (*spp)--;
289 return NULL;
290 }
291 **spp = &PL_sv_undef;
292 return NULL;
293 }
294 if ((PL_op->op_flags & OPf_SPECIAL) &&
295 !(PL_op->op_flags & OPf_MOD))
296 {
77cb3b01 297 if (!(gv = gv_fetchsv_nomg(sv, GV_ADDMG, type)))
dc3c76f8
NC		 298 {
299 **spp = &PL_sv_undef;
300 return NULL;
301 }
302 }
303 else {
77cb3b01 304 gv = gv_fetchsv_nomg(sv, GV_ADD, type);
dc3c76f8
NC		 305 }
306 return gv;
307}
308
79072805
LW		 309PP(pp_rv2sv)
310{
97aff369 311 dVAR; dSP; dTOPss;
c445ea15 312 GV *gv = NULL;
79072805 313
9026059d 314 SvGETMAGIC(sv);
ed6116ce 315 if (SvROK(sv)) {
93d7320b
DM		 316 if (SvAMAGIC(sv)) {
317 sv = amagic_deref_call(sv, to_sv_amg);
318 SPAGAIN;
319 }
f5284f61 320
ed6116ce 321 sv = SvRV(sv);
79072805
LW		 322 switch (SvTYPE(sv)) {
323 case SVt_PVAV:
324 case SVt_PVHV:
325 case SVt_PVCV:
cbae9b9f
YST		 326 case SVt_PVFM:
327 case SVt_PVIO:
cea2e8a9 328 DIE(aTHX_ "Not a SCALAR reference");
42d0e0b7 329 default: NOOP;
79072805
LW		 330 }
331 }
332 else {
159b6efe 333 gv = MUTABLE_GV(sv);
748a9306 334
6e592b3a 335 if (!isGV_with_GP(gv)) {
dc3c76f8
NC		 336 gv = Perl_softref2xv(aTHX_ sv, "a SCALAR", SVt_PV, &sp);
337 if (!gv)
338 RETURN;
463ee0b2 339 }
29c711a3 340 sv = GvSVn(gv);
a0d0e21e 341 }
533c011a 342 if (PL_op->op_flags & OPf_MOD) {
82d03984
RGS		 343 if (PL_op->op_private & OPpLVAL_INTRO) {
344 if (cUNOP->op_first->op_type == OP_NULL)
159b6efe 345 sv = save_scalar(MUTABLE_GV(TOPs));
82d03984
RGS		 346 else if (gv)
347 sv = save_scalar(gv);
348 else
f1f66076 349 Perl_croak(aTHX_ "%s", PL_no_localize_ref);
82d03984 350 }
533c011a 351 else if (PL_op->op_private & OPpDEREF)
9026059d 352 sv = vivify_ref(sv, PL_op->op_private & OPpDEREF);
79072805 353 }
a0d0e21e 354 SETs(sv);
79072805
LW		 355 RETURN;
356}
357
358PP(pp_av2arylen)
359{
97aff369 360 dVAR; dSP;
502c6561 361 AV * const av = MUTABLE_AV(TOPs);
02d85cc3
EB		 362 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
363 if (lvalue) {
364 SV ** const sv = Perl_av_arylen_p(aTHX_ MUTABLE_AV(av));
365 if (!*sv) {
366 *sv = newSV_type(SVt_PVMG);
367 sv_magic(*sv, MUTABLE_SV(av), PERL_MAGIC_arylen, NULL, 0);
368 }
369 SETs(*sv);
370 } else {
e1dccc0d 371 SETs(sv_2mortal(newSViv(AvFILL(MUTABLE_AV(av)))));
79072805 372 }
79072805
LW		 373 RETURN;
374}
375
a0d0e21e
LW		 376PP(pp_pos)
377{
2154eca7 378 dVAR; dSP; dPOPss;
8ec5e241 379
78f9721b 380 if (PL_op->op_flags & OPf_MOD || LVRET) {
16eb5365
FC		 381 SV * const ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
382 sv_magic(ret, NULL, PERL_MAGIC_pos, NULL, 0);
383 LvTYPE(ret) = '.';
384 LvTARG(ret) = SvREFCNT_inc_simple(sv);
2154eca7 385 PUSHs(ret); /* no SvSETMAGIC */
a0d0e21e
LW		 386 RETURN;
387 }
388 else {
a0d0e21e 389 if (SvTYPE(sv) >= SVt_PVMG && SvMAGIC(sv)) {
1b6737cc 390 const MAGIC * const mg = mg_find(sv, PERL_MAGIC_regex_global);
565764a8 391 if (mg && mg->mg_len >= 0) {
2154eca7 392 dTARGET;
a0ed51b3 393 I32 i = mg->mg_len;
7e2040f0 394 if (DO_UTF8(sv))
a0ed51b3 395 sv_pos_b2u(sv, &i);
e1dccc0d 396 PUSHi(i);
a0d0e21e
LW		 397 RETURN;
398 }
399 }
400 RETPUSHUNDEF;
401 }
402}
403
79072805
LW		 404PP(pp_rv2cv)
405{
97aff369 406 dVAR; dSP;
79072805 407 GV *gv;
1eced8f8 408 HV *stash_unused;
c445ea15 409 const I32 flags = (PL_op->op_flags & OPf_SPECIAL)
9da346da 410 ? GV_ADDMG
c445ea15
AL		 411 : ((PL_op->op_private & (OPpLVAL_INTRO|OPpMAY_RETURN_CONSTANT)) == OPpMAY_RETURN_CONSTANT)
412 ? GV_ADD|GV_NOEXPAND
413 : GV_ADD;
4633a7c4
LW		 414 /* We usually try to add a non-existent subroutine in case of AUTOLOAD. */
415 /* (But not in defined().) */
e26df76a 416
1eced8f8 417 CV *cv = sv_2cv(TOPs, &stash_unused, &gv, flags);
07055b4c
CS		 418 if (cv) {
419 if (CvCLONE(cv))
ad64d0ec 420 cv = MUTABLE_CV(sv_2mortal(MUTABLE_SV(cv_clone(cv))));
d32f2495 421 if ((PL_op->op_private & OPpLVAL_INTRO)) {
f5e29650 422 if (gv && GvCV(gv) == cv && (gv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv), GvNAMEUTF8(gv) ? SVf_UTF8 : 0)))
d32f2495
SC		 423 cv = GvCV(gv);
424 if (!CvLVALUE(cv))
425 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
426 }
07055b4c 427 }
e26df76a 428 else if ((flags == (GV_ADD|GV_NOEXPAND)) && gv && SvROK(gv)) {
ea726b52 429 cv = MUTABLE_CV(gv);
e26df76a 430 }
07055b4c 431 else
ea726b52 432 cv = MUTABLE_CV(&PL_sv_undef);
ad64d0ec 433 SETs(MUTABLE_SV(cv));
79072805
LW		 434 RETURN;
435}
436
c07a80fd 437PP(pp_prototype)
438{
97aff369 439 dVAR; dSP;
c07a80fd 440 CV *cv;
441 HV *stash;
442 GV *gv;
fabdb6c0 443 SV *ret = &PL_sv_undef;
c07a80fd 444
b6c543e3 445 if (SvPOK(TOPs) && SvCUR(TOPs) >= 7) {
e3f73d4e 446 const char * s = SvPVX_const(TOPs);
b6c543e3 447 if (strnEQ(s, "CORE::", 6)) {
be1b855b 448 const int code = keyword(s + 6, SvCUR(TOPs) - 6, 1);
b66130dd
FC		 449 if (!code || code == -KEY_CORE)
450 DIE(aTHX_ "Can't find an opnumber for \"%s\"", s+6);
451 if (code < 0) { /* Overridable. */
452 SV * const sv = core_prototype(NULL, s + 6, code, NULL);
453 if (sv) ret = sv;
454 }
b8c38f0a 455 goto set;
b6c543e3
IZ		 456 }
457 }
f2c0649b 458 cv = sv_2cv(TOPs, &stash, &gv, 0);
5f05dabc 459 if (cv && SvPOK(cv))
59cd0e26 460 ret = newSVpvn_flags(SvPVX_const(cv), SvCUR(cv), SVs_TEMP);
b6c543e3 461 set:
c07a80fd 462 SETs(ret);
463 RETURN;
464}
465
a0d0e21e
LW		 466PP(pp_anoncode)
467{
97aff369 468 dVAR; dSP;
ea726b52 469 CV *cv = MUTABLE_CV(PAD_SV(PL_op->op_targ));
a5f75d66 470 if (CvCLONE(cv))
ad64d0ec 471 cv = MUTABLE_CV(sv_2mortal(MUTABLE_SV(cv_clone(cv))));
5f05dabc 472 EXTEND(SP,1);
ad64d0ec 473 PUSHs(MUTABLE_SV(cv));
a0d0e21e
LW		 474 RETURN;
475}
476
477PP(pp_srefgen)
79072805 478{
97aff369 479 dVAR; dSP;
71be2cbc 480 *SP = refto(*SP);
79072805 481 RETURN;
8ec5e241 482}
a0d0e21e
LW		 483
484PP(pp_refgen)
485{
97aff369 486 dVAR; dSP; dMARK;
a0d0e21e 487 if (GIMME != G_ARRAY) {
5f0b1d4e
GS		 488 if (++MARK <= SP)
489 *MARK = *SP;
490 else
3280af22 491 *MARK = &PL_sv_undef;
5f0b1d4e
GS		 492 *MARK = refto(*MARK);
493 SP = MARK;
494 RETURN;
a0d0e21e 495 }
bbce6d69 496 EXTEND_MORTAL(SP - MARK);
71be2cbc 497 while (++MARK <= SP)
498 *MARK = refto(*MARK);
a0d0e21e 499 RETURN;
79072805
LW		 500}
501
76e3520e 502STATIC SV*
cea2e8a9 503S_refto(pTHX_ SV *sv)
71be2cbc 504{
97aff369 505 dVAR;
71be2cbc 506 SV* rv;
507
7918f24d
NC		 508 PERL_ARGS_ASSERT_REFTO;
509
71be2cbc 510 if (SvTYPE(sv) == SVt_PVLV && LvTYPE(sv) == 'y') {
511 if (LvTARGLEN(sv))
68dc0745 512 vivify_defelem(sv);
513 if (!(sv = LvTARG(sv)))
3280af22 514 sv = &PL_sv_undef;
0dd88869 515 else
b37c2d43 516 SvREFCNT_inc_void_NN(sv);
71be2cbc 517 }
d8b46c1b 518 else if (SvTYPE(sv) == SVt_PVAV) {
502c6561
NC		 519 if (!AvREAL((const AV *)sv) && AvREIFY((const AV *)sv))
520 av_reify(MUTABLE_AV(sv));
d8b46c1b 521 SvTEMP_off(sv);
b37c2d43 522 SvREFCNT_inc_void_NN(sv);
d8b46c1b 523 }
f2933f5f
DM		 524 else if (SvPADTMP(sv) && !IS_PADGV(sv))
525 sv = newSVsv(sv);
71be2cbc 526 else {
527 SvTEMP_off(sv);
b37c2d43 528 SvREFCNT_inc_void_NN(sv);
71be2cbc 529 }
530 rv = sv_newmortal();
4df7f6af 531 sv_upgrade(rv, SVt_IV);
b162af07 532 SvRV_set(rv, sv);
71be2cbc 533 SvROK_on(rv);
534 return rv;
535}
536
79072805
LW		 537PP(pp_ref)
538{
97aff369 539 dVAR; dSP; dTARGET;
1b6737cc 540 SV * const sv = POPs;
f12c7020 541
5b295bef
RD		 542 if (sv)
543 SvGETMAGIC(sv);
f12c7020 544
a0d0e21e 545 if (!sv || !SvROK(sv))
4633a7c4 546 RETPUSHNO;
79072805 547
a15456de
BF		 548 (void)sv_ref(TARG,SvRV(sv),TRUE);
549 PUSHTARG;
79072805
LW		 550 RETURN;
551}
552
553PP(pp_bless)
554{
97aff369 555 dVAR; dSP;
463ee0b2 556 HV *stash;
79072805 557
463ee0b2 558 if (MAXARG == 1)
c2f922f1 559 curstash:
11faa288 560 stash = CopSTASH(PL_curcop);
7b8d334a 561 else {
1b6737cc 562 SV * const ssv = POPs;
7b8d334a 563 STRLEN len;
e1ec3a88 564 const char *ptr;
81689caa 565
c2f922f1
FC		 566 if (!ssv) goto curstash;
567 if (!SvGMAGICAL(ssv) && !SvAMAGIC(ssv) && SvROK(ssv))
81689caa 568 Perl_croak(aTHX_ "Attempt to bless into a reference");
5c144d81 569 ptr = SvPV_const(ssv,len);
a2a5de95
NC		 570 if (len == 0)
571 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
572 "Explicit blessing to '' (assuming package main)");
e69c50fe 573 stash = gv_stashpvn(ptr, len, GV_ADD|SvUTF8(ssv));
7b8d334a 574 }
a0d0e21e 575
5d3fdfeb 576 (void)sv_bless(TOPs, stash);
79072805
LW		 577 RETURN;
578}
579
fb73857a 580PP(pp_gelem)
581{
97aff369 582 dVAR; dSP;
b13b2135 583
1b6737cc
AL		 584 SV *sv = POPs;
585 const char * const elem = SvPV_nolen_const(sv);
159b6efe 586 GV * const gv = MUTABLE_GV(POPs);
c445ea15 587 SV * tmpRef = NULL;
1b6737cc 588
c445ea15 589 sv = NULL;
c4ba80c3
NC		 590 if (elem) {
591 /* elem will always be NUL terminated. */
1b6737cc 592 const char * const second_letter = elem + 1;
c4ba80c3
NC		 593 switch (*elem) {
594 case 'A':
1b6737cc 595 if (strEQ(second_letter, "RRAY"))
ad64d0ec 596 tmpRef = MUTABLE_SV(GvAV(gv));
c4ba80c3
NC		 597 break;
598 case 'C':
1b6737cc 599 if (strEQ(second_letter, "ODE"))
ad64d0ec 600 tmpRef = MUTABLE_SV(GvCVu(gv));
c4ba80c3
NC		 601 break;
602 case 'F':
1b6737cc 603 if (strEQ(second_letter, "ILEHANDLE")) {
c4ba80c3
NC		 604 /* finally deprecated in 5.8.0 */
605 deprecate("*glob{FILEHANDLE}");
ad64d0ec 606 tmpRef = MUTABLE_SV(GvIOp(gv));
c4ba80c3
NC		 607 }
608 else
1b6737cc 609 if (strEQ(second_letter, "ORMAT"))
ad64d0ec 610 tmpRef = MUTABLE_SV(GvFORM(gv));
c4ba80c3
NC		 611 break;
612 case 'G':
1b6737cc 613 if (strEQ(second_letter, "LOB"))
ad64d0ec 614 tmpRef = MUTABLE_SV(gv);
c4ba80c3
NC		 615 break;
616 case 'H':
1b6737cc 617 if (strEQ(second_letter, "ASH"))
ad64d0ec 618 tmpRef = MUTABLE_SV(GvHV(gv));
c4ba80c3
NC		 619 break;
620 case 'I':
1b6737cc 621 if (*second_letter == 'O' && !elem[2])
ad64d0ec 622 tmpRef = MUTABLE_SV(GvIOp(gv));
c4ba80c3
NC		 623 break;
624 case 'N':
1b6737cc 625 if (strEQ(second_letter, "AME"))
a663657d 626 sv = newSVhek(GvNAME_HEK(gv));
c4ba80c3
NC		 627 break;
628 case 'P':
1b6737cc 629 if (strEQ(second_letter, "ACKAGE")) {
7fa3a4ab
NC		 630 const HV * const stash = GvSTASH(gv);
631 const HEK * const hek = stash ? HvNAME_HEK(stash) : NULL;
396482e1 632 sv = hek ? newSVhek(hek) : newSVpvs("__ANON__");
c4ba80c3
NC		 633 }
634 break;
635 case 'S':
1b6737cc 636 if (strEQ(second_letter, "CALAR"))
f9d52e31 637 tmpRef = GvSVn(gv);
c4ba80c3 638 break;
39b99f21 639 }
fb73857a 640 }
76e3520e
GS		 641 if (tmpRef)
642 sv = newRV(tmpRef);
fb73857a 643 if (sv)
644 sv_2mortal(sv);
645 else
3280af22 646 sv = &PL_sv_undef;
fb73857a 647 XPUSHs(sv);
648 RETURN;
649}
650
a0d0e21e 651/* Pattern matching */
79072805 652
a0d0e21e 653PP(pp_study)
79072805 654{
97aff369 655 dVAR; dSP; dPOPss;
a0d0e21e 656 register unsigned char *s;
72de20cd 657 char *sfirst_raw;
a0d0e21e 658 STRLEN len;
4185c919 659 MAGIC *mg = SvMAGICAL(sv) ? mg_find(sv, PERL_MAGIC_study) : NULL;
72de20cd
NC		 660 U8 quanta;
661 STRLEN size;
4185c919
NC		 662
663 if (mg && SvSCREAM(sv))
664 RETPUSHYES;
a0d0e21e 665
a4f4e906 666 s = (unsigned char*)(SvPV(sv, len));
bc9a5256 667 if (len == 0 || len > I32_MAX || !SvPOK(sv) || SvUTF8(sv) || SvVALID(sv)) {
a4f4e906
NC		 668 /* No point in studying a zero length string, and not safe to study
669 anything that doesn't appear to be a simple scalar (and hence might
670 change between now and when the regexp engine runs without our set
bd473224 671 magic ever running) such as a reference to an object with overloaded
bc9a5256
NC		 672 stringification. Also refuse to study an FBM scalar, as this gives
673 more flexibility in SV flag usage. No real-world code would ever
674 end up studying an FBM scalar, so this isn't a real pessimisation.
72de20cd
NC		 675 Endemic use of I32 in Perl_screaminstr makes it hard to safely push
676 the study length limit from I32_MAX to U32_MAX - 1.
bc9a5256 677 */
a4f4e906
NC		 678 RETPUSHNO;
679 }
680
72de20cd
NC		 681 if (len < 0xFF) {
682 quanta = 1;
683 } else if (len < 0xFFFF) {
684 quanta = 2;
685 } else
686 quanta = 4;
a0d0e21e 687
72de20cd
NC		 688 size = (256 + len) * quanta;
689 sfirst_raw = (char *)safemalloc(size);
690
691 if (!sfirst_raw)
cea2e8a9 692 DIE(aTHX_ "do_study: out of memory");
a0d0e21e 693
4185c919
NC		 694 SvSCREAM_on(sv);
695 if (!mg)
696 mg = sv_magicext(sv, NULL, PERL_MAGIC_study, &PL_vtbl_regexp, NULL, 0);
72de20cd
NC		 697 mg->mg_ptr = sfirst_raw;
698 mg->mg_len = size;
699 mg->mg_private = quanta;
700
701 memset(sfirst_raw, ~0, 256 * quanta);
702
703 /* The assumption here is that most studied strings are fairly short, hence
704 the pain of the extra code is worth it, given the memory savings.
705 80 character string, 336 bytes as U8, down from 1344 as U32
706 800 character string, 2112 bytes as U16, down from 4224 as U32
707 */
708
709 if (quanta == 1) {
710 U8 *const sfirst = (U8 *)sfirst_raw;
711 U8 *const snext = sfirst + 256;
712 while (len-- > 0) {
713 const U8 ch = s[len];
714 snext[len] = sfirst[ch];
715 sfirst[ch] = len;
716 }
717 } else if (quanta == 2) {
718 U16 *const sfirst = (U16 *)sfirst_raw;
719 U16 *const snext = sfirst + 256;
720 while (len-- > 0) {
721 const U8 ch = s[len];
722 snext[len] = sfirst[ch];
723 sfirst[ch] = len;
724 }
725 } else {
726 U32 *const sfirst = (U32 *)sfirst_raw;
727 U32 *const snext = sfirst + 256;
728 while (len-- > 0) {
729 const U8 ch = s[len];
730 snext[len] = sfirst[ch];
731 sfirst[ch] = len;
732 }
79072805
LW		 733 }
734
1e422769 735 RETPUSHYES;
79072805
LW		 736}
737
a0d0e21e 738PP(pp_trans)
79072805 739{
97aff369 740 dVAR; dSP; dTARG;
a0d0e21e
LW		 741 SV *sv;
742
533c011a 743 if (PL_op->op_flags & OPf_STACKED)
a0d0e21e 744 sv = POPs;
59f00321
RGS		 745 else if (PL_op->op_private & OPpTARGET_MY)
746 sv = GETTARGET;
79072805 747 else {
54b9620d 748 sv = DEFSV;
a0d0e21e 749 EXTEND(SP,1);
79072805 750 }
adbc6bb1 751 TARG = sv_newmortal();
bb16bae8
FC		 752 if(PL_op->op_type == OP_TRANSR) {
753 SV * const newsv = newSVsv(sv);
754 do_trans(newsv);
755 mPUSHs(newsv);
756 }
757 else PUSHi(do_trans(sv));
a0d0e21e 758 RETURN;
79072805
LW		 759}
760
a0d0e21e 761/* Lvalue operators. */
79072805 762
81745e4e
NC		 763static void
764S_do_chomp(pTHX_ SV *retval, SV *sv, bool chomping)
765{
766 dVAR;
767 STRLEN len;
768 char *s;
769
770 PERL_ARGS_ASSERT_DO_CHOMP;
771
772 if (chomping && (RsSNARF(PL_rs) || RsRECORD(PL_rs)))
773 return;
774 if (SvTYPE(sv) == SVt_PVAV) {
775 I32 i;
776 AV *const av = MUTABLE_AV(sv);
777 const I32 max = AvFILL(av);
778
779 for (i = 0; i <= max; i++) {
780 sv = MUTABLE_SV(av_fetch(av, i, FALSE));
781 if (sv && ((sv = *(SV**)sv), sv != &PL_sv_undef))
782 do_chomp(retval, sv, chomping);
783 }
784 return;
785 }
786 else if (SvTYPE(sv) == SVt_PVHV) {
787 HV* const hv = MUTABLE_HV(sv);
788 HE* entry;
789 (void)hv_iterinit(hv);
790 while ((entry = hv_iternext(hv)))
791 do_chomp(retval, hv_iterval(hv,entry), chomping);
792 return;
793 }
794 else if (SvREADONLY(sv)) {
795 if (SvFAKE(sv)) {
796 /* SV is copy-on-write */
797 sv_force_normal_flags(sv, 0);
798 }
799 if (SvREADONLY(sv))
800 Perl_croak_no_modify(aTHX);
801 }
802
803 if (PL_encoding) {
804 if (!SvUTF8(sv)) {
805 /* XXX, here sv is utf8-ized as a side-effect!
806 If encoding.pm is used properly, almost string-generating
807 operations, including literal strings, chr(), input data, etc.
808 should have been utf8-ized already, right?
809 */
810 sv_recode_to_utf8(sv, PL_encoding);
811 }
812 }
813
814 s = SvPV(sv, len);
815 if (chomping) {
816 char *temp_buffer = NULL;
817 SV *svrecode = NULL;
818
819 if (s && len) {
820 s += --len;
821 if (RsPARA(PL_rs)) {
822 if (*s != '\n')
823 goto nope;
824 ++SvIVX(retval);
825 while (len && s[-1] == '\n') {
826 --len;
827 --s;
828 ++SvIVX(retval);
829 }
830 }
831 else {
832 STRLEN rslen, rs_charlen;
833 const char *rsptr = SvPV_const(PL_rs, rslen);
834
835 rs_charlen = SvUTF8(PL_rs)
836 ? sv_len_utf8(PL_rs)
837 : rslen;
838
839 if (SvUTF8(PL_rs) != SvUTF8(sv)) {
840 /* Assumption is that rs is shorter than the scalar. */
841 if (SvUTF8(PL_rs)) {
842 /* RS is utf8, scalar is 8 bit. */
843 bool is_utf8 = TRUE;
844 temp_buffer = (char*)bytes_from_utf8((U8*)rsptr,
845 &rslen, &is_utf8);
846 if (is_utf8) {
847 /* Cannot downgrade, therefore cannot possibly match
848 */
849 assert (temp_buffer == rsptr);
850 temp_buffer = NULL;
851 goto nope;
852 }
853 rsptr = temp_buffer;
854 }
855 else if (PL_encoding) {
856 /* RS is 8 bit, encoding.pm is used.
857 * Do not recode PL_rs as a side-effect. */
858 svrecode = newSVpvn(rsptr, rslen);
859 sv_recode_to_utf8(svrecode, PL_encoding);
860 rsptr = SvPV_const(svrecode, rslen);
861 rs_charlen = sv_len_utf8(svrecode);
862 }
863 else {
864 /* RS is 8 bit, scalar is utf8. */
865 temp_buffer = (char*)bytes_to_utf8((U8*)rsptr, &rslen);
866 rsptr = temp_buffer;
867 }
868 }
869 if (rslen == 1) {
870 if (*s != *rsptr)
871 goto nope;
872 ++SvIVX(retval);
873 }
874 else {
875 if (len < rslen - 1)
876 goto nope;
877 len -= rslen - 1;
878 s -= rslen - 1;
879 if (memNE(s, rsptr, rslen))
880 goto nope;
881 SvIVX(retval) += rs_charlen;
882 }
883 }
884 s = SvPV_force_nolen(sv);
885 SvCUR_set(sv, len);
886 *SvEND(sv) = '\0';
887 SvNIOK_off(sv);
888 SvSETMAGIC(sv);
889 }
890 nope:
891
892 SvREFCNT_dec(svrecode);
893
894 Safefree(temp_buffer);
895 } else {
896 if (len && !SvPOK(sv))
897 s = SvPV_force_nomg(sv, len);
898 if (DO_UTF8(sv)) {
899 if (s && len) {
900 char * const send = s + len;
901 char * const start = s;
902 s = send - 1;
903 while (s > start && UTF8_IS_CONTINUATION(*s))
904 s--;
905 if (is_utf8_string((U8*)s, send - s)) {
906 sv_setpvn(retval, s, send - s);
907 *s = '\0';
908 SvCUR_set(sv, s - start);
909 SvNIOK_off(sv);
910 SvUTF8_on(retval);
911 }
912 }
913 else
914 sv_setpvs(retval, "");
915 }
916 else if (s && len) {
917 s += --len;
918 sv_setpvn(retval, s, 1);
919 *s = '\0';
920 SvCUR_set(sv, len);
921 SvUTF8_off(sv);
922 SvNIOK_off(sv);
923 }
924 else
925 sv_setpvs(retval, "");
926 SvSETMAGIC(sv);
927 }
928}
929
a0d0e21e
LW		 930PP(pp_schop)
931{
97aff369 932 dVAR; dSP; dTARGET;
fa54efae
NC		 933 const bool chomping = PL_op->op_type == OP_SCHOMP;
934
935 if (chomping)
936 sv_setiv(TARG, 0);
937 do_chomp(TARG, TOPs, chomping);
a0d0e21e
LW		 938 SETTARG;
939 RETURN;
79072805
LW		 940}
941
a0d0e21e 942PP(pp_chop)
79072805 943{
97aff369 944 dVAR; dSP; dMARK; dTARGET; dORIGMARK;
fa54efae 945 const bool chomping = PL_op->op_type == OP_CHOMP;
8ec5e241 946
fa54efae
NC		 947 if (chomping)
948 sv_setiv(TARG, 0);
20cf1f79 949 while (MARK < SP)
fa54efae 950 do_chomp(TARG, *++MARK, chomping);
20cf1f79
NC		 951 SP = ORIGMARK;
952 XPUSHTARG;
a0d0e21e 953 RETURN;
79072805
LW		 954}
955
a0d0e21e
LW		 956PP(pp_undef)
957{
97aff369 958 dVAR; dSP;
a0d0e21e
LW		 959 SV *sv;
960
533c011a 961 if (!PL_op->op_private) {
774d564b 962 EXTEND(SP, 1);
a0d0e21e 963 RETPUSHUNDEF;
774d564b 964 }
79072805 965
a0d0e21e
LW		 966 sv = POPs;
967 if (!sv)
968 RETPUSHUNDEF;
85e6fe83 969
765f542d 970 SV_CHECK_THINKFIRST_COW_DROP(sv);
85e6fe83 971
a0d0e21e
LW		 972 switch (SvTYPE(sv)) {
973 case SVt_NULL:
974 break;
975 case SVt_PVAV:
502c6561 976 av_undef(MUTABLE_AV(sv));
a0d0e21e
LW		 977 break;
978 case SVt_PVHV:
85fbaab2 979 hv_undef(MUTABLE_HV(sv));
a0d0e21e
LW		 980 break;
981 case SVt_PVCV:
a2a5de95 982 if (cv_const_sv((const CV *)sv))
714cd18f
BF		 983 Perl_ck_warner(aTHX_ packWARN(WARN_MISC),
984 "Constant subroutine %"SVf" undefined",
985 SVfARG(CvANON((const CV *)sv)
986 ? newSVpvs_flags("(anonymous)", SVs_TEMP)
987 : sv_2mortal(newSVhek(GvENAME_HEK(CvGV((const CV *)sv))))));
5f66b61c 988 /* FALLTHROUGH */
9607fc9c 989 case SVt_PVFM:
6fc92669
GS		 990 {
991 /* let user-undef'd sub keep its identity */
ea726b52
NC		 992 GV* const gv = CvGV((const CV *)sv);
993 cv_undef(MUTABLE_CV(sv));
b3f91e91 994 CvGV_set(MUTABLE_CV(sv), gv);
6fc92669 995 }
a0d0e21e 996 break;
8e07c86e 997 case SVt_PVGV:
6e592b3a 998 if (SvFAKE(sv)) {
3280af22 999 SvSetMagicSV(sv, &PL_sv_undef);
6e592b3a
BM		 1000 break;
1001 }
1002 else if (isGV_with_GP(sv)) {
20408e3c 1003 GP *gp;
dd69841b
BB		 1004 HV *stash;
1005
dd69841b 1006 /* undef *Pkg::meth_name ... */
e530fb81
FC		 1007 bool method_changed
1008 = GvCVu((const GV *)sv) && (stash = GvSTASH((const GV *)sv))
1009 && HvENAME_get(stash);
1010 /* undef *Foo:: */
1011 if((stash = GvHV((const GV *)sv))) {
1012 if(HvENAME_get(stash))
1013 SvREFCNT_inc_simple_void_NN(sv_2mortal((SV *)stash));
1014 else stash = NULL;
1015 }
dd69841b 1016
159b6efe 1017 gp_free(MUTABLE_GV(sv));
a02a5408 1018 Newxz(gp, 1, GP);
c43ae56f 1019 GvGP_set(sv, gp_ref(gp));
561b68a9 1020 GvSV(sv) = newSV(0);
57843af0 1021 GvLINE(sv) = CopLINE(PL_curcop);
159b6efe 1022 GvEGV(sv) = MUTABLE_GV(sv);
20408e3c 1023 GvMULTI_on(sv);
e530fb81
FC		 1024
1025 if(stash)
afdbe55d 1026 mro_package_moved(NULL, stash, (const GV *)sv, 0);
e530fb81
FC		 1027 stash = NULL;
1028 /* undef *Foo::ISA */
1029 if( strEQ(GvNAME((const GV *)sv), "ISA")
1030 && (stash = GvSTASH((const GV *)sv))
1031 && (method_changed || HvENAME(stash)) )
1032 mro_isa_changed_in(stash);
1033 else if(method_changed)
1034 mro_method_changed_in(
da9043f5 1035 GvSTASH((const GV *)sv)
e530fb81
FC		 1036 );
1037
6e592b3a 1038 break;
20408e3c 1039 }
6e592b3a 1040 /* FALL THROUGH */
a0d0e21e 1041 default:
b15aece3 1042 if (SvTYPE(sv) >= SVt_PV && SvPVX_const(sv) && SvLEN(sv)) {
8bd4d4c5 1043 SvPV_free(sv);
c445ea15 1044 SvPV_set(sv, NULL);
4633a7c4 1045 SvLEN_set(sv, 0);
a0d0e21e 1046 }
0c34ef67 1047 SvOK_off(sv);
4633a7c4 1048 SvSETMAGIC(sv);
79072805 1049 }
a0d0e21e
LW		 1050
1051 RETPUSHUNDEF;
79072805
LW		 1052}
1053
a0d0e21e
LW		 1054PP(pp_postinc)
1055{
97aff369 1056 dVAR; dSP; dTARGET;
c22c99bc
FC		 1057 const bool inc =
1058 PL_op->op_type == OP_POSTINC || PL_op->op_type == OP_I_POSTINC;
60092ce4 1059 if (SvTYPE(TOPs) >= SVt_PVAV || (isGV_with_GP(TOPs) && !SvFAKE(TOPs)))
6ad8f254 1060 Perl_croak_no_modify(aTHX);
7dcb9b98
DM		 1061 if (SvROK(TOPs))
1062 TARG = sv_newmortal();
a0d0e21e 1063 sv_setsv(TARG, TOPs);
3510b4a1 1064 if (!SvREADONLY(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs)
c22c99bc 1065 && SvIVX(TOPs) != (inc ? IV_MAX : IV_MIN))
55497cff 1066 {
c22c99bc 1067 SvIV_set(TOPs, SvIVX(TOPs) + (inc ? 1 : -1));
55497cff 1068 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
748a9306 1069 }
c22c99bc 1070 else if (inc)
6f1401dc 1071 sv_inc_nomg(TOPs);
c22c99bc 1072 else sv_dec_nomg(TOPs);
a0d0e21e 1073 SvSETMAGIC(TOPs);
1e54a23f 1074 /* special case for undef: see thread at 2003-03/msg00536.html in archive */
c22c99bc 1075 if (inc && !SvOK(TARG))
a0d0e21e
LW		 1076 sv_setiv(TARG, 0);
1077 SETs(TARG);
1078 return NORMAL;
1079}
79072805 1080
a0d0e21e
LW		 1081/* Ordinary operators. */
1082
1083PP(pp_pow)
1084{
800401ee 1085 dVAR; dSP; dATARGET; SV *svl, *svr;
58d76dfd 1086#ifdef PERL_PRESERVE_IVUV
52a96ae6
HS		 1087 bool is_int = 0;
1088#endif
6f1401dc
DM		 1089 tryAMAGICbin_MG(pow_amg, AMGf_assign|AMGf_numeric);
1090 svr = TOPs;
1091 svl = TOPm1s;
52a96ae6
HS		 1092#ifdef PERL_PRESERVE_IVUV
1093 /* For integer to integer power, we do the calculation by hand wherever
1094 we're sure it is safe; otherwise we call pow() and try to convert to
1095 integer afterwards. */
58d76dfd 1096 {
6f1401dc 1097 SvIV_please_nomg(svr);
800401ee 1098 if (SvIOK(svr)) {
6f1401dc 1099 SvIV_please_nomg(svl);
800401ee 1100 if (SvIOK(svl)) {
900658e3
PF		 1101 UV power;
1102 bool baseuok;
1103 UV baseuv;
1104
800401ee
JH		 1105 if (SvUOK(svr)) {
1106 power = SvUVX(svr);
900658e3 1107 } else {
800401ee 1108 const IV iv = SvIVX(svr);
900658e3
PF		 1109 if (iv >= 0) {
1110 power = iv;
1111 } else {
1112 goto float_it; /* Can't do negative powers this way. */
1113 }
1114 }
1115
800401ee 1116 baseuok = SvUOK(svl);
900658e3 1117 if (baseuok) {
800401ee 1118 baseuv = SvUVX(svl);
900658e3 1119 } else {
800401ee 1120 const IV iv = SvIVX(svl);
900658e3
PF		 1121 if (iv >= 0) {
1122 baseuv = iv;
1123 baseuok = TRUE; /* effectively it's a UV now */
1124 } else {
1125 baseuv = -iv; /* abs, baseuok == false records sign */
1126 }
1127 }
52a96ae6
HS		 1128 /* now we have integer ** positive integer. */
1129 is_int = 1;
1130
1131 /* foo & (foo - 1) is zero only for a power of 2. */
58d76dfd 1132 if (!(baseuv & (baseuv - 1))) {
52a96ae6 1133 /* We are raising power-of-2 to a positive integer.
58d76dfd
JH		 1134 The logic here will work for any base (even non-integer
1135 bases) but it can be less accurate than
1136 pow (base,power) or exp (power * log (base)) when the
1137 intermediate values start to spill out of the mantissa.
1138 With powers of 2 we know this can't happen.
1139 And powers of 2 are the favourite thing for perl
1140 programmers to notice ** not doing what they mean. */
1141 NV result = 1.0;
1142 NV base = baseuok ? baseuv : -(NV)baseuv;
900658e3
PF		 1143
1144 if (power & 1) {
1145 result *= base;
1146 }
1147 while (power >>= 1) {
1148 base *= base;
1149 if (power & 1) {
1150 result *= base;
1151 }
1152 }
58d76dfd
JH		 1153 SP--;
1154 SETn( result );
6f1401dc 1155 SvIV_please_nomg(svr);
58d76dfd 1156 RETURN;
52a96ae6
HS		 1157 } else {
1158 register unsigned int highbit = 8 * sizeof(UV);
900658e3
PF		 1159 register unsigned int diff = 8 * sizeof(UV);
1160 while (diff >>= 1) {
1161 highbit -= diff;
1162 if (baseuv >> highbit) {
1163 highbit += diff;
1164 }
52a96ae6
HS		 1165 }
1166 /* we now have baseuv < 2 ** highbit */
1167 if (power * highbit <= 8 * sizeof(UV)) {
1168 /* result will definitely fit in UV, so use UV math
1169 on same algorithm as above */
1170 register UV result = 1;
1171 register UV base = baseuv;
f2338a2e 1172 const bool odd_power = cBOOL(power & 1);
900658e3
PF		 1173 if (odd_power) {
1174 result *= base;
1175 }
1176 while (power >>= 1) {
1177 base *= base;
1178 if (power & 1) {
52a96ae6 1179 result *= base;
52a96ae6
HS		 1180 }
1181 }
1182 SP--;
0615a994 1183 if (baseuok || !odd_power)
52a96ae6
HS		 1184 /* answer is positive */
1185 SETu( result );
1186 else if (result <= (UV)IV_MAX)
1187 /* answer negative, fits in IV */
1188 SETi( -(IV)result );
1189 else if (result == (UV)IV_MIN)
1190 /* 2's complement assumption: special case IV_MIN */
1191 SETi( IV_MIN );
1192 else
1193 /* answer negative, doesn't fit */
1194 SETn( -(NV)result );
1195 RETURN;
1196 }
1197 }
1198 }
1199 }
58d76dfd 1200 }
52a96ae6 1201 float_it:
58d76dfd 1202#endif
a0d0e21e 1203 {
6f1401dc
DM		 1204 NV right = SvNV_nomg(svr);
1205 NV left = SvNV_nomg(svl);
4efa5a16 1206 (void)POPs;
3aaeb624
JA		 1207
1208#if defined(USE_LONG_DOUBLE) && defined(HAS_AIX_POWL_NEG_BASE_BUG)
1209 /*
1210 We are building perl with long double support and are on an AIX OS
1211 afflicted with a powl() function that wrongly returns NaNQ for any
1212 negative base. This was reported to IBM as PMR #23047-379 on
1213 03/06/2006. The problem exists in at least the following versions
1214 of AIX and the libm fileset, and no doubt others as well:
1215
1216 AIX 4.3.3-ML10 bos.adt.libm 4.3.3.50
1217 AIX 5.1.0-ML04 bos.adt.libm 5.1.0.29
1218 AIX 5.2.0 bos.adt.libm 5.2.0.85
1219
1220 So, until IBM fixes powl(), we provide the following workaround to
1221 handle the problem ourselves. Our logic is as follows: for
1222 negative bases (left), we use fmod(right, 2) to check if the
1223 exponent is an odd or even integer:
1224
1225 - if odd, powl(left, right) == -powl(-left, right)
1226 - if even, powl(left, right) == powl(-left, right)
1227
1228 If the exponent is not an integer, the result is rightly NaNQ, so
1229 we just return that (as NV_NAN).
1230 */
1231
1232 if (left < 0.0) {
1233 NV mod2 = Perl_fmod( right, 2.0 );
1234 if (mod2 == 1.0 || mod2 == -1.0) { /* odd integer */
1235 SETn( -Perl_pow( -left, right) );
1236 } else if (mod2 == 0.0) { /* even integer */
1237 SETn( Perl_pow( -left, right) );
1238 } else { /* fractional power */
1239 SETn( NV_NAN );
1240 }
1241 } else {
1242 SETn( Perl_pow( left, right) );
1243 }
1244#else
52a96ae6 1245 SETn( Perl_pow( left, right) );
3aaeb624
JA		 1246#endif /* HAS_AIX_POWL_NEG_BASE_BUG */
1247
52a96ae6
HS		 1248#ifdef PERL_PRESERVE_IVUV
1249 if (is_int)
6f1401dc 1250 SvIV_please_nomg(svr);
52a96ae6
HS		 1251#endif
1252 RETURN;
93a17b20 1253 }
a0d0e21e
LW		 1254}
1255
1256PP(pp_multiply)
1257{
800401ee 1258 dVAR; dSP; dATARGET; SV *svl, *svr;
6f1401dc
DM		 1259 tryAMAGICbin_MG(mult_amg, AMGf_assign|AMGf_numeric);
1260 svr = TOPs;
1261 svl = TOPm1s;
28e5dec8 1262#ifdef PERL_PRESERVE_IVUV
6f1401dc 1263 SvIV_please_nomg(svr);
800401ee 1264 if (SvIOK(svr)) {
28e5dec8
JH		 1265 /* Unless the left argument is integer in range we are going to have to
1266 use NV maths. Hence only attempt to coerce the right argument if
1267 we know the left is integer. */
1268 /* Left operand is defined, so is it IV? */
6f1401dc 1269 SvIV_please_nomg(svl);
800401ee
JH		 1270 if (SvIOK(svl)) {
1271 bool auvok = SvUOK(svl);
1272 bool buvok = SvUOK(svr);
28e5dec8
JH		 1273 const UV topmask = (~ (UV)0) << (4 * sizeof (UV));
1274 const UV botmask = ~((~ (UV)0) << (4 * sizeof (UV)));
1275 UV alow;
1276 UV ahigh;
1277 UV blow;
1278 UV bhigh;
1279
1280 if (auvok) {
800401ee 1281 alow = SvUVX(svl);
28e5dec8 1282 } else {
800401ee 1283 const IV aiv = SvIVX(svl);
28e5dec8
JH		 1284 if (aiv >= 0) {
1285 alow = aiv;
1286 auvok = TRUE; /* effectively it's a UV now */
1287 } else {
1288 alow = -aiv; /* abs, auvok == false records sign */
1289 }
1290 }
1291 if (buvok) {
800401ee 1292 blow = SvUVX(svr);
28e5dec8 1293 } else {
800401ee 1294 const IV biv = SvIVX(svr);
28e5dec8
JH		 1295 if (biv >= 0) {
1296 blow = biv;
1297 buvok = TRUE; /* effectively it's a UV now */
1298 } else {
1299 blow = -biv; /* abs, buvok == false records sign */
1300 }
1301 }
1302
1303 /* If this does sign extension on unsigned it's time for plan B */
1304 ahigh = alow >> (4 * sizeof (UV));
1305 alow &= botmask;
1306 bhigh = blow >> (4 * sizeof (UV));
1307 blow &= botmask;
1308 if (ahigh && bhigh) {
6f207bd3 1309 NOOP;
28e5dec8
JH		 1310 /* eg 32 bit is at least 0x10000 * 0x10000 == 0x100000000
1311 which is overflow. Drop to NVs below. */
1312 } else if (!ahigh && !bhigh) {
1313 /* eg 32 bit is at most 0xFFFF * 0xFFFF == 0xFFFE0001
1314 so the unsigned multiply cannot overflow. */
c445ea15 1315 const UV product = alow * blow;
28e5dec8
JH		 1316 if (auvok == buvok) {
1317 /* -ve * -ve or +ve * +ve gives a +ve result. */
1318 SP--;
1319 SETu( product );
1320 RETURN;
1321 } else if (product <= (UV)IV_MIN) {
1322 /* 2s complement assumption that (UV)-IV_MIN is correct. */
1323 /* -ve result, which could overflow an IV */
1324 SP--;
25716404 1325 SETi( -(IV)product );
28e5dec8
JH		 1326 RETURN;
1327 } /* else drop to NVs below. */
1328 } else {
1329 /* One operand is large, 1 small */
1330 UV product_middle;
1331 if (bhigh) {
1332 /* swap the operands */
1333 ahigh = bhigh;
1334 bhigh = blow; /* bhigh now the temp var for the swap */
1335 blow = alow;
1336 alow = bhigh;
1337 }
1338 /* now, ((ahigh * blow) << half_UV_len) + (alow * blow)
1339 multiplies can't overflow. shift can, add can, -ve can. */
1340 product_middle = ahigh * blow;
1341 if (!(product_middle & topmask)) {
1342 /* OK, (ahigh * blow) won't lose bits when we shift it. */
1343 UV product_low;
1344 product_middle <<= (4 * sizeof (UV));
1345 product_low = alow * blow;
1346
1347 /* as for pp_add, UV + something mustn't get smaller.
1348 IIRC ANSI mandates this wrapping *behaviour* for
1349 unsigned whatever the actual representation*/
1350 product_low += product_middle;
1351 if (product_low >= product_middle) {
1352 /* didn't overflow */
1353 if (auvok == buvok) {
1354 /* -ve * -ve or +ve * +ve gives a +ve result. */
1355 SP--;
1356 SETu( product_low );
1357 RETURN;
1358 } else if (product_low <= (UV)IV_MIN) {
1359 /* 2s complement assumption again */
1360 /* -ve result, which could overflow an IV */
1361 SP--;
25716404 1362 SETi( -(IV)product_low );
28e5dec8
JH		 1363 RETURN;
1364 } /* else drop to NVs below. */
1365 }
1366 } /* product_middle too large */
1367 } /* ahigh && bhigh */
800401ee
JH		 1368 } /* SvIOK(svl) */
1369 } /* SvIOK(svr) */
28e5dec8 1370#endif
a0d0e21e 1371 {
6f1401dc
DM		 1372 NV right = SvNV_nomg(svr);
1373 NV left = SvNV_nomg(svl);
4efa5a16 1374 (void)POPs;
a0d0e21e
LW		 1375 SETn( left * right );
1376 RETURN;
79072805 1377 }
a0d0e21e
LW		 1378}
1379
1380PP(pp_divide)
1381{
800401ee 1382 dVAR; dSP; dATARGET; SV *svl, *svr;
6f1401dc
DM		 1383 tryAMAGICbin_MG(div_amg, AMGf_assign|AMGf_numeric);
1384 svr = TOPs;
1385 svl = TOPm1s;
5479d192 1386 /* Only try to do UV divide first
68795e93 1387 if ((SLOPPYDIVIDE is true) or
5479d192
NC		 1388 (PERL_PRESERVE_IVUV is true and one or both SV is a UV too large
1389 to preserve))
1390 The assumption is that it is better to use floating point divide
1391 whenever possible, only doing integer divide first if we can't be sure.
1392 If NV_PRESERVES_UV is true then we know at compile time that no UV
1393 can be too large to preserve, so don't need to compile the code to
1394 test the size of UVs. */
1395
a0d0e21e 1396#ifdef SLOPPYDIVIDE
5479d192
NC		 1397# define PERL_TRY_UV_DIVIDE
1398 /* ensure that 20./5. == 4. */
a0d0e21e 1399#else
5479d192
NC		 1400# ifdef PERL_PRESERVE_IVUV
1401# ifndef NV_PRESERVES_UV
1402# define PERL_TRY_UV_DIVIDE
1403# endif
1404# endif
a0d0e21e 1405#endif
5479d192
NC		 1406
1407#ifdef PERL_TRY_UV_DIVIDE
6f1401dc 1408 SvIV_please_nomg(svr);
800401ee 1409 if (SvIOK(svr)) {
6f1401dc 1410 SvIV_please_nomg(svl);
800401ee
JH		 1411 if (SvIOK(svl)) {
1412 bool left_non_neg = SvUOK(svl);
1413 bool right_non_neg = SvUOK(svr);
5479d192
NC		 1414 UV left;
1415 UV right;
1416
1417 if (right_non_neg) {
800401ee 1418 right = SvUVX(svr);
5479d192
NC		 1419 }
1420 else {
800401ee 1421 const IV biv = SvIVX(svr);
5479d192
NC		 1422 if (biv >= 0) {
1423 right = biv;
1424 right_non_neg = TRUE; /* effectively it's a UV now */
1425 }
1426 else {
1427 right = -biv;
1428 }
1429 }
1430 /* historically undef()/0 gives a "Use of uninitialized value"
1431 warning before dieing, hence this test goes here.
1432 If it were immediately before the second SvIV_please, then
1433 DIE() would be invoked before left was even inspected, so
486ec47a 1434 no inspection would give no warning. */
5479d192
NC		 1435 if (right == 0)
1436 DIE(aTHX_ "Illegal division by zero");
1437
1438 if (left_non_neg) {
800401ee 1439 left = SvUVX(svl);
5479d192
NC		 1440 }
1441 else {
800401ee 1442 const IV aiv = SvIVX(svl);
5479d192
NC		 1443 if (aiv >= 0) {
1444 left = aiv;
1445 left_non_neg = TRUE; /* effectively it's a UV now */
1446 }
1447 else {
1448 left = -aiv;
1449 }
1450 }
1451
1452 if (left >= right
1453#ifdef SLOPPYDIVIDE
1454 /* For sloppy divide we always attempt integer division. */
1455#else
1456 /* Otherwise we only attempt it if either or both operands
1457 would not be preserved by an NV. If both fit in NVs
0c2ee62a
NC		 1458 we fall through to the NV divide code below. However,
1459 as left >= right to ensure integer result here, we know that
1460 we can skip the test on the right operand - right big
1461 enough not to be preserved can't get here unless left is
1462 also too big. */
1463
1464 && (left > ((UV)1 << NV_PRESERVES_UV_BITS))
5479d192
NC		 1465#endif
1466 ) {
1467 /* Integer division can't overflow, but it can be imprecise. */
1b6737cc 1468 const UV result = left / right;
5479d192
NC		 1469 if (result * right == left) {
1470 SP--; /* result is valid */
1471 if (left_non_neg == right_non_neg) {
1472 /* signs identical, result is positive. */
1473 SETu( result );
1474 RETURN;
1475 }
1476 /* 2s complement assumption */
1477 if (result <= (UV)IV_MIN)
91f3b821 1478 SETi( -(IV)result );
5479d192
NC		 1479 else {
1480 /* It's exact but too negative for IV. */
1481 SETn( -(NV)result );
1482 }
1483 RETURN;
1484 } /* tried integer divide but it was not an integer result */
32fdb065 1485 } /* else (PERL_ABS(result) < 1.0) or (both UVs in range for NV) */
5479d192
NC		 1486 } /* left wasn't SvIOK */
1487 } /* right wasn't SvIOK */
1488#endif /* PERL_TRY_UV_DIVIDE */
1489 {
6f1401dc
DM		 1490 NV right = SvNV_nomg(svr);
1491 NV left = SvNV_nomg(svl);
4efa5a16 1492 (void)POPs;(void)POPs;
ebc6a117
PD		 1493#if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
1494 if (! Perl_isnan(right) && right == 0.0)
1495#else
5479d192 1496 if (right == 0.0)
ebc6a117 1497#endif
5479d192
NC		 1498 DIE(aTHX_ "Illegal division by zero");
1499 PUSHn( left / right );
1500 RETURN;
79072805 1501 }
a0d0e21e
LW		 1502}
1503
1504PP(pp_modulo)
1505{
6f1401dc
DM		 1506 dVAR; dSP; dATARGET;
1507 tryAMAGICbin_MG(modulo_amg, AMGf_assign|AMGf_numeric);
a0d0e21e 1508 {
9c5ffd7c
JH		 1509 UV left = 0;
1510 UV right = 0;
dc656993
JH		 1511 bool left_neg = FALSE;
1512 bool right_neg = FALSE;
e2c88acc
NC		 1513 bool use_double = FALSE;
1514 bool dright_valid = FALSE;
9c5ffd7c
JH		 1515 NV dright = 0.0;
1516 NV dleft = 0.0;
6f1401dc
DM		 1517 SV * const svr = TOPs;
1518 SV * const svl = TOPm1s;
1519 SvIV_please_nomg(svr);
800401ee
JH		 1520 if (SvIOK(svr)) {
1521 right_neg = !SvUOK(svr);
e2c88acc 1522 if (!right_neg) {
800401ee 1523 right = SvUVX(svr);
e2c88acc 1524 } else {
800401ee 1525 const IV biv = SvIVX(svr);
e2c88acc
NC		 1526 if (biv >= 0) {
1527 right = biv;
1528 right_neg = FALSE; /* effectively it's a UV now */
1529 } else {
1530 right = -biv;
1531 }
1532 }
1533 }
1534 else {
6f1401dc 1535 dright = SvNV_nomg(svr);
787eafbd
IZ		 1536 right_neg = dright < 0;
1537 if (right_neg)
1538 dright = -dright;
e2c88acc
NC		 1539 if (dright < UV_MAX_P1) {
1540 right = U_V(dright);
1541 dright_valid = TRUE; /* In case we need to use double below. */
1542 } else {
1543 use_double = TRUE;
1544 }
787eafbd 1545 }
a0d0e21e 1546
e2c88acc
NC		 1547 /* At this point use_double is only true if right is out of range for
1548 a UV. In range NV has been rounded down to nearest UV and
1549 use_double false. */
6f1401dc 1550 SvIV_please_nomg(svl);
800401ee
JH		 1551 if (!use_double && SvIOK(svl)) {
1552 if (SvIOK(svl)) {
1553 left_neg = !SvUOK(svl);
e2c88acc 1554 if (!left_neg) {
800401ee 1555 left = SvUVX(svl);
e2c88acc 1556 } else {
800401ee 1557 const IV aiv = SvIVX(svl);
e2c88acc
NC		 1558 if (aiv >= 0) {
1559 left = aiv;
1560 left_neg = FALSE; /* effectively it's a UV now */
1561 } else {
1562 left = -aiv;
1563 }
1564 }
1565 }
1566 }
787eafbd 1567 else {
6f1401dc 1568 dleft = SvNV_nomg(svl);
787eafbd
IZ		 1569 left_neg = dleft < 0;
1570 if (left_neg)
1571 dleft = -dleft;
68dc0745 1572
e2c88acc
NC		 1573 /* This should be exactly the 5.6 behaviour - if left and right are
1574 both in range for UV then use U_V() rather than floor. */
1575 if (!use_double) {
1576 if (dleft < UV_MAX_P1) {
1577 /* right was in range, so is dleft, so use UVs not double.
1578 */
1579 left = U_V(dleft);
1580 }
1581 /* left is out of range for UV, right was in range, so promote
1582 right (back) to double. */
1583 else {
1584 /* The +0.5 is used in 5.6 even though it is not strictly
1585 consistent with the implicit +0 floor in the U_V()
1586 inside the #if 1. */
1587 dleft = Perl_floor(dleft + 0.5);
1588 use_double = TRUE;
1589 if (dright_valid)
1590 dright = Perl_floor(dright + 0.5);
1591 else
1592 dright = right;
1593 }
1594 }
1595 }
6f1401dc 1596 sp -= 2;
787eafbd 1597 if (use_double) {
65202027 1598 NV dans;
787eafbd 1599
787eafbd 1600 if (!dright)
cea2e8a9 1601 DIE(aTHX_ "Illegal modulus zero");
787eafbd 1602
65202027 1603 dans = Perl_fmod(dleft, dright);
787eafbd
IZ		 1604 if ((left_neg != right_neg) && dans)
1605 dans = dright - dans;
1606 if (right_neg)
1607 dans = -dans;
1608 sv_setnv(TARG, dans);
1609 }
1610 else {
1611 UV ans;
1612
787eafbd 1613 if (!right)
cea2e8a9 1614 DIE(aTHX_ "Illegal modulus zero");
787eafbd
IZ		 1615
1616 ans = left % right;
1617 if ((left_neg != right_neg) && ans)
1618 ans = right - ans;
1619 if (right_neg) {
1620 /* XXX may warn: unary minus operator applied to unsigned type */
1621 /* could change -foo to be (~foo)+1 instead */
1622 if (ans <= ~((UV)IV_MAX)+1)
1623 sv_setiv(TARG, ~ans+1);
1624 else
65202027 1625 sv_setnv(TARG, -(NV)ans);
787eafbd
IZ		 1626 }
1627 else
1628 sv_setuv(TARG, ans);
1629 }
1630 PUSHTARG;
1631 RETURN;
79072805 1632 }
a0d0e21e 1633}
79072805 1634
a0d0e21e
LW		 1635PP(pp_repeat)
1636{
6f1401dc 1637 dVAR; dSP; dATARGET;
2b573ace 1638 register IV count;
6f1401dc
DM		 1639 SV *sv;
1640
1641 if (GIMME == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
1642 /* TODO: think of some way of doing list-repeat overloading ??? */
1643 sv = POPs;
1644 SvGETMAGIC(sv);
1645 }
1646 else {
1647 tryAMAGICbin_MG(repeat_amg, AMGf_assign);
1648 sv = POPs;
1649 }
1650
2b573ace
JH		 1651 if (SvIOKp(sv)) {
1652 if (SvUOK(sv)) {
6f1401dc 1653 const UV uv = SvUV_nomg(sv);
2b573ace
JH		 1654 if (uv > IV_MAX)
1655 count = IV_MAX; /* The best we can do? */
1656 else
1657 count = uv;
1658 } else {
6f1401dc 1659 const IV iv = SvIV_nomg(sv);
2b573ace
JH		 1660 if (iv < 0)
1661 count = 0;
1662 else
1663 count = iv;
1664 }
1665 }
1666 else if (SvNOKp(sv)) {
6f1401dc 1667 const NV nv = SvNV_nomg(sv);
2b573ace
JH		 1668 if (nv < 0.0)
1669 count = 0;
1670 else
1671 count = (IV)nv;
1672 }
1673 else
6f1401dc
DM		 1674 count = SvIV_nomg(sv);
1675
533c011a 1676 if (GIMME == G_ARRAY && PL_op->op_private & OPpREPEAT_DOLIST) {
a0d0e21e 1677 dMARK;
0bd48802
AL		 1678 static const char oom_list_extend[] = "Out of memory during list extend";
1679 const I32 items = SP - MARK;
1680 const I32 max = items * count;
79072805 1681
2b573ace
JH		 1682 MEM_WRAP_CHECK_1(max, SV*, oom_list_extend);
1683 /* Did the max computation overflow? */
27d5b266 1684 if (items > 0 && max > 0 && (max < items || max < count))
2b573ace 1685 Perl_croak(aTHX_ oom_list_extend);
a0d0e21e
LW		 1686 MEXTEND(MARK, max);
1687 if (count > 1) {
1688 while (SP > MARK) {
976c8a39
JH		 1689#if 0
1690 /* This code was intended to fix 20010809.028:
1691
1692 $x = 'abcd';
1693 for (($x =~ /./g) x 2) {
1694 print chop; # "abcdabcd" expected as output.
1695 }
1696
1697 * but that change (#11635) broke this code:
1698
1699 $x = [("foo")x2]; # only one "foo" ended up in the anonlist.
1700
1701 * I can't think of a better fix that doesn't introduce
1702 * an efficiency hit by copying the SVs. The stack isn't
1703 * refcounted, and mortalisation obviously doesn't
1704 * Do The Right Thing when the stack has more than
1705 * one pointer to the same mortal value.
1706 * .robin.
1707 */
e30acc16
RH		 1708 if (*SP) {
1709 *SP = sv_2mortal(newSVsv(*SP));
1710 SvREADONLY_on(*SP);
1711 }
976c8a39
JH		 1712#else
1713 if (*SP)
1714 SvTEMP_off((*SP));
1715#endif
a0d0e21e 1716 SP--;
79072805 1717 }
a0d0e21e
LW		 1718 MARK++;
1719 repeatcpy((char*)(MARK + items), (char*)MARK,
ad64d0ec 1720 items * sizeof(const SV *), count - 1);
a0d0e21e 1721 SP += max;
79072805 1722 }
a0d0e21e
LW		 1723 else if (count <= 0)
1724 SP -= items;
79072805 1725 }
a0d0e21e 1726 else { /* Note: mark already snarfed by pp_list */
0bd48802 1727 SV * const tmpstr = POPs;
a0d0e21e 1728 STRLEN len;
9b877dbb 1729 bool isutf;
2b573ace
JH		 1730 static const char oom_string_extend[] =
1731 "Out of memory during string extend";
a0d0e21e 1732
6f1401dc
DM		 1733 if (TARG != tmpstr)
1734 sv_setsv_nomg(TARG, tmpstr);
1735 SvPV_force_nomg(TARG, len);
9b877dbb 1736 isutf = DO_UTF8(TARG);
8ebc5c01 1737 if (count != 1) {
1738 if (count < 1)
1739 SvCUR_set(TARG, 0);
1740 else {
c445ea15 1741 const STRLEN max = (UV)count * len;
19a94d75 1742 if (len > MEM_SIZE_MAX / count)
2b573ace
JH		 1743 Perl_croak(aTHX_ oom_string_extend);
1744 MEM_WRAP_CHECK_1(max, char, oom_string_extend);
8569b9dc 1745 SvGROW(TARG, max + 1);
a0d0e21e 1746 repeatcpy(SvPVX(TARG) + len, SvPVX(TARG), len, count - 1);
b162af07 1747 SvCUR_set(TARG, SvCUR(TARG) * count);
7a4c00b4 1748 }
a0d0e21e 1749 *SvEND(TARG) = '\0';
a0d0e21e 1750 }
dfcb284a
GS		 1751 if (isutf)
1752 (void)SvPOK_only_UTF8(TARG);
1753 else
1754 (void)SvPOK_only(TARG);
b80b6069
RH		 1755
1756 if (PL_op->op_private & OPpREPEAT_DOLIST) {
1757 /* The parser saw this as a list repeat, and there
1758 are probably several items on the stack. But we're
1759 in scalar context, and there's no pp_list to save us
1760 now. So drop the rest of the items -- robin@kitsite.com
1761 */
1762 dMARK;
1763 SP = MARK;
1764 }
a0d0e21e 1765 PUSHTARG;
79072805 1766 }
a0d0e21e
LW		 1767 RETURN;
1768}
79072805 1769
a0d0e21e
LW		 1770PP(pp_subtract)
1771{
800401ee 1772 dVAR; dSP; dATARGET; bool useleft; SV *svl, *svr;
6f1401dc
DM		 1773 tryAMAGICbin_MG(subtr_amg, AMGf_assign|AMGf_numeric);
1774 svr = TOPs;
1775 svl = TOPm1s;
800401ee 1776 useleft = USE_LEFT(svl);
28e5dec8 1777#ifdef PERL_PRESERVE_IVUV
7dca457a
NC		 1778 /* See comments in pp_add (in pp_hot.c) about Overflow, and how
1779 "bad things" happen if you rely on signed integers wrapping. */
6f1401dc 1780 SvIV_please_nomg(svr);
800401ee 1781 if (SvIOK(svr)) {
28e5dec8
JH		 1782 /* Unless the left argument is integer in range we are going to have to
1783 use NV maths. Hence only attempt to coerce the right argument if
1784 we know the left is integer. */
9c5ffd7c
JH		 1785 register UV auv = 0;
1786 bool auvok = FALSE;
7dca457a
NC		 1787 bool a_valid = 0;
1788
28e5dec8 1789 if (!useleft) {
7dca457a
NC		 1790 auv = 0;
1791 a_valid = auvok = 1;
1792 /* left operand is undef, treat as zero. */
28e5dec8
JH		 1793 } else {
1794 /* Left operand is defined, so is it IV? */
6f1401dc 1795 SvIV_please_nomg(svl);
800401ee
JH		 1796 if (SvIOK(svl)) {
1797 if ((auvok = SvUOK(svl)))
1798 auv = SvUVX(svl);
7dca457a 1799 else {
800401ee 1800 register const IV aiv = SvIVX(svl);
7dca457a
NC		 1801 if (aiv >= 0) {
1802 auv = aiv;
1803 auvok = 1; /* Now acting as a sign flag. */
1804 } else { /* 2s complement assumption for IV_MIN */
1805 auv = (UV)-aiv;
28e5dec8 1806 }
7dca457a
NC		 1807 }
1808 a_valid = 1;
1809 }
1810 }
1811 if (a_valid) {
1812 bool result_good = 0;
1813 UV result;
1814 register UV buv;
800401ee 1815 bool buvok = SvUOK(svr);
9041c2e3 1816
7dca457a 1817 if (buvok)
800401ee 1818 buv = SvUVX(svr);
7dca457a 1819 else {
800401ee 1820 register const IV biv = SvIVX(svr);
7dca457a
NC		 1821 if (biv >= 0) {
1822 buv = biv;
1823 buvok = 1;
1824 } else
1825 buv = (UV)-biv;
1826 }
1827 /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve,
602f51c4 1828 else "IV" now, independent of how it came in.
7dca457a
NC		 1829 if a, b represents positive, A, B negative, a maps to -A etc
1830 a - b => (a - b)
1831 A - b => -(a + b)
1832 a - B => (a + b)
1833 A - B => -(a - b)
1834 all UV maths. negate result if A negative.
1835 subtract if signs same, add if signs differ. */
1836
1837 if (auvok ^ buvok) {
1838 /* Signs differ. */
1839 result = auv + buv;
1840 if (result >= auv)
1841 result_good = 1;
1842 } else {
1843 /* Signs same */
1844 if (auv >= buv) {
1845 result = auv - buv;
1846 /* Must get smaller */
1847 if (result <= auv)
1848 result_good = 1;
1849 } else {
1850 result = buv - auv;
1851 if (result <= buv) {
1852 /* result really should be -(auv-buv). as its negation
1853 of true value, need to swap our result flag */
1854 auvok = !auvok;
1855 result_good = 1;
28e5dec8 1856 }
28e5dec8
JH		 1857 }
1858 }
7dca457a
NC		 1859 if (result_good) {
1860 SP--;
1861 if (auvok)
1862 SETu( result );
1863 else {
1864 /* Negate result */
1865 if (result <= (UV)IV_MIN)
1866 SETi( -(IV)result );
1867 else {
1868 /* result valid, but out of range for IV. */
1869 SETn( -(NV)result );
1870 }
1871 }
1872 RETURN;
1873 } /* Overflow, drop through to NVs. */
28e5dec8
JH		 1874 }
1875 }
1876#endif
a0d0e21e 1877 {
6f1401dc 1878 NV value = SvNV_nomg(svr);
4efa5a16
RD		 1879 (void)POPs;
1880
28e5dec8
JH		 1881 if (!useleft) {
1882 /* left operand is undef, treat as zero - value */
1883 SETn(-value);
1884 RETURN;
1885 }
6f1401dc 1886 SETn( SvNV_nomg(svl) - value );
28e5dec8 1887 RETURN;
79072805 1888 }
a0d0e21e 1889}
79072805 1890
a0d0e21e
LW		 1891PP(pp_left_shift)
1892{
6f1401dc 1893 dVAR; dSP; dATARGET; SV *svl, *svr;
a42d0242 1894 tryAMAGICbin_MG(lshift_amg, AMGf_assign|AMGf_numeric);
6f1401dc
DM		 1895 svr = POPs;
1896 svl = TOPs;
a0d0e21e 1897 {
6f1401dc 1898 const IV shift = SvIV_nomg(svr);
d0ba1bd2 1899 if (PL_op->op_private & HINT_INTEGER) {
6f1401dc 1900 const IV i = SvIV_nomg(svl);
972b05a9 1901 SETi(i << shift);
d0ba1bd2
JH		 1902 }
1903 else {
6f1401dc 1904 const UV u = SvUV_nomg(svl);
972b05a9 1905 SETu(u << shift);
d0ba1bd2 1906 }
55497cff 1907 RETURN;
79072805 1908 }
a0d0e21e 1909}
79072805 1910
a0d0e21e
LW		 1911PP(pp_right_shift)
1912{
6f1401dc 1913 dVAR; dSP; dATARGET; SV *svl, *svr;
a42d0242 1914 tryAMAGICbin_MG(rshift_amg, AMGf_assign|AMGf_numeric);
6f1401dc
DM		 1915 svr = POPs;
1916 svl = TOPs;
a0d0e21e 1917 {
6f1401dc 1918 const IV shift = SvIV_nomg(svr);
d0ba1bd2 1919 if (PL_op->op_private & HINT_INTEGER) {
6f1401dc 1920 const IV i = SvIV_nomg(svl);
972b05a9 1921 SETi(i >> shift);
d0ba1bd2
JH		 1922 }
1923 else {
6f1401dc 1924 const UV u = SvUV_nomg(svl);
972b05a9 1925 SETu(u >> shift);
d0ba1bd2 1926 }
a0d0e21e 1927 RETURN;
93a17b20 1928 }
79072805
LW		 1929}
1930
a0d0e21e 1931PP(pp_lt)
79072805 1932{
6f1401dc 1933 dVAR; dSP;
33efebe6
DM		 1934 SV *left, *right;
1935
a42d0242 1936 tryAMAGICbin_MG(lt_amg, AMGf_set|AMGf_numeric);
33efebe6
DM		 1937 right = POPs;
1938 left = TOPs;
1939 SETs(boolSV(
1940 (SvIOK_notUV(left) && SvIOK_notUV(right))
1941 ? (SvIVX(left) < SvIVX(right))
1942 : (do_ncmp(left, right) == -1)
1943 ));
1944 RETURN;
a0d0e21e 1945}
79072805 1946
a0d0e21e
LW		 1947PP(pp_gt)
1948{
6f1401dc 1949 dVAR; dSP;
33efebe6 1950 SV *left, *right;
1b6737cc 1951
33efebe6
DM		 1952 tryAMAGICbin_MG(gt_amg, AMGf_set|AMGf_numeric);
1953 right = POPs;
1954 left = TOPs;
1955 SETs(boolSV(
1956 (SvIOK_notUV(left) && SvIOK_notUV(right))
1957 ? (SvIVX(left) > SvIVX(right))
1958 : (do_ncmp(left, right) == 1)
1959 ));
1960 RETURN;
a0d0e21e
LW		 1961}
1962
1963PP(pp_le)
1964{
6f1401dc 1965 dVAR; dSP;
33efebe6 1966 SV *left, *right;
1b6737cc 1967
33efebe6
DM		 1968 tryAMAGICbin_MG(le_amg, AMGf_set|AMGf_numeric);
1969 right = POPs;
1970 left = TOPs;
1971 SETs(boolSV(
1972 (SvIOK_notUV(left) && SvIOK_notUV(right))
1973 ? (SvIVX(left) <= SvIVX(right))
1974 : (do_ncmp(left, right) <= 0)
1975 ));
1976 RETURN;
a0d0e21e
LW		 1977}
1978
1979PP(pp_ge)
1980{
6f1401dc 1981 dVAR; dSP;
33efebe6
DM		 1982 SV *left, *right;
1983
1984 tryAMAGICbin_MG(ge_amg, AMGf_set|AMGf_numeric);
1985 right = POPs;
1986 left = TOPs;
1987 SETs(boolSV(
1988 (SvIOK_notUV(left) && SvIOK_notUV(right))
1989 ? (SvIVX(left) >= SvIVX(right))
1990 : ( (do_ncmp(left, right) & 2) == 0)
1991 ));
1992 RETURN;
1993}
1b6737cc 1994
33efebe6
DM		 1995PP(pp_ne)
1996{
1997 dVAR; dSP;
1998 SV *left, *right;
1999
2000 tryAMAGICbin_MG(ne_amg, AMGf_set|AMGf_numeric);
2001 right = POPs;
2002 left = TOPs;
2003 SETs(boolSV(
2004 (SvIOK_notUV(left) && SvIOK_notUV(right))
2005 ? (SvIVX(left) != SvIVX(right))
2006 : (do_ncmp(left, right) != 0)
2007 ));
2008 RETURN;
2009}
1b6737cc 2010
33efebe6
DM		 2011/* compare left and right SVs. Returns:
2012 * -1: <
2013 * 0: ==
2014 * 1: >
2015 * 2: left or right was a NaN
2016 */
2017I32
2018Perl_do_ncmp(pTHX_ SV* const left, SV * const right)
2019{
2020 dVAR;
1b6737cc 2021
33efebe6
DM		 2022 PERL_ARGS_ASSERT_DO_NCMP;
2023#ifdef PERL_PRESERVE_IVUV
2024 SvIV_please_nomg(right);
2025 /* Fortunately it seems NaN isn't IOK */
2026 if (SvIOK(right)) {
2027 SvIV_please_nomg(left);
2028 if (SvIOK(left)) {
2029 if (!SvUOK(left)) {
2030 const IV leftiv = SvIVX(left);
2031 if (!SvUOK(right)) {
2032 /* ## IV <=> IV ## */
2033 const IV rightiv = SvIVX(right);
2034 return (leftiv > rightiv) - (leftiv < rightiv);
28e5dec8 2035 }
33efebe6
DM		 2036 /* ## IV <=> UV ## */
2037 if (leftiv < 0)
2038 /* As (b) is a UV, it's >=0, so it must be < */
2039 return -1;
2040 {
2041 const UV rightuv = SvUVX(right);
2042 return ((UV)leftiv > rightuv) - ((UV)leftiv < rightuv);
28e5dec8 2043 }
28e5dec8 2044 }
79072805 2045
33efebe6
DM		 2046 if (SvUOK(right)) {
2047 /* ## UV <=> UV ## */
2048 const UV leftuv = SvUVX(left);
2049 const UV rightuv = SvUVX(right);
2050 return (leftuv > rightuv) - (leftuv < rightuv);
28e5dec8 2051 }
33efebe6
DM		 2052 /* ## UV <=> IV ## */
2053 {
2054 const IV rightiv = SvIVX(right);
2055 if (rightiv < 0)
2056 /* As (a) is a UV, it's >=0, so it cannot be < */
2057 return 1;
2058 {
2059 const UV leftuv = SvUVX(left);
2060 return (leftuv > (UV)rightiv) - (leftuv < (UV)rightiv);
28e5dec8 2061 }
28e5dec8 2062 }
33efebe6 2063 /* NOTREACHED */
28e5dec8
JH		 2064 }
2065 }
2066#endif
a0d0e21e 2067 {
33efebe6
DM		 2068 NV const rnv = SvNV_nomg(right);
2069 NV const lnv = SvNV_nomg(left);
2070
cab190d4 2071#if defined(NAN_COMPARE_BROKEN) && defined(Perl_isnan)
33efebe6
DM		 2072 if (Perl_isnan(lnv) || Perl_isnan(rnv)) {
2073 return 2;
2074 }
2075 return (lnv > rnv) - (lnv < rnv);
cab190d4 2076#else
33efebe6
DM		 2077 if (lnv < rnv)
2078 return -1;
2079 if (lnv > rnv)
2080 return 1;
2081 if (lnv == rnv)
2082 return 0;
2083 return 2;
cab190d4 2084#endif
a0d0e21e 2085 }
79072805
LW		 2086}
2087
33efebe6 2088
a0d0e21e 2089PP(pp_ncmp)
79072805 2090{
33efebe6
DM		 2091 dVAR; dSP;
2092 SV *left, *right;
2093 I32 value;
a42d0242 2094 tryAMAGICbin_MG(ncmp_amg, AMGf_numeric);
33efebe6
DM		 2095 right = POPs;
2096 left = TOPs;
2097 value = do_ncmp(left, right);
2098 if (value == 2) {
3280af22 2099 SETs(&PL_sv_undef);
79072805 2100 }
33efebe6
DM		 2101 else {
2102 dTARGET;
2103 SETi(value);
2104 }
2105 RETURN;
a0d0e21e 2106}
79072805 2107
afd9910b 2108PP(pp_sle)
a0d0e21e 2109{
97aff369 2110 dVAR; dSP;
79072805 2111
afd9910b
NC		 2112 int amg_type = sle_amg;
2113 int multiplier = 1;
2114 int rhs = 1;
79072805 2115
afd9910b
NC		 2116 switch (PL_op->op_type) {
2117 case OP_SLT:
2118 amg_type = slt_amg;
2119 /* cmp < 0 */
2120 rhs = 0;
2121 break;
2122 case OP_SGT:
2123 amg_type = sgt_amg;
2124 /* cmp > 0 */
2125 multiplier = -1;
2126 rhs = 0;
2127 break;
2128 case OP_SGE:
2129 amg_type = sge_amg;
2130 /* cmp >= 0 */
2131 multiplier = -1;
2132 break;
79072805 2133 }
79072805 2134
6f1401dc 2135 tryAMAGICbin_MG(amg_type, AMGf_set);
a0d0e21e
LW		 2136 {
2137 dPOPTOPssrl;
1b6737cc 2138 const int cmp = (IN_LOCALE_RUNTIME
078504b2
FC		 2139 ? sv_cmp_locale_flags(left, right, 0)
2140 : sv_cmp_flags(left, right, 0));
afd9910b 2141 SETs(boolSV(cmp * multiplier < rhs));
a0d0e21e
LW		 2142 RETURN;
2143 }
2144}
79072805 2145
36477c24 2146PP(pp_seq)
2147{
6f1401dc
DM		 2148 dVAR; dSP;
2149 tryAMAGICbin_MG(seq_amg, AMGf_set);
36477c24 2150 {
2151 dPOPTOPssrl;
078504b2 2152 SETs(boolSV(sv_eq_flags(left, right, 0)));
a0d0e21e
LW		 2153 RETURN;
2154 }
2155}
79072805 2156
a0d0e21e 2157PP(pp_sne)
79072805 2158{
6f1401dc
DM		 2159 dVAR; dSP;
2160 tryAMAGICbin_MG(sne_amg, AMGf_set);
a0d0e21e
LW		 2161 {
2162 dPOPTOPssrl;
078504b2 2163 SETs(boolSV(!sv_eq_flags(left, right, 0)));
a0d0e21e 2164 RETURN;
463ee0b2 2165 }
79072805
LW		 2166}
2167
a0d0e21e 2168PP(pp_scmp)
79072805 2169{
6f1401dc
DM		 2170 dVAR; dSP; dTARGET;
2171 tryAMAGICbin_MG(scmp_amg, 0);
a0d0e21e
LW		 2172 {
2173 dPOPTOPssrl;
1b6737cc 2174 const int cmp = (IN_LOCALE_RUNTIME
078504b2
FC		 2175 ? sv_cmp_locale_flags(left, right, 0)
2176 : sv_cmp_flags(left, right, 0));
bbce6d69 2177 SETi( cmp );
a0d0e21e
LW		 2178 RETURN;
2179 }
2180}
79072805 2181
55497cff 2182PP(pp_bit_and)
2183{
6f1401dc
DM		 2184 dVAR; dSP; dATARGET;
2185 tryAMAGICbin_MG(band_amg, AMGf_assign);
a0d0e21e
LW		 2186 {
2187 dPOPTOPssrl;
4633a7c4 2188 if (SvNIOKp(left) || SvNIOKp(right)) {
b20c4ee1
FC		 2189 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2190 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
d0ba1bd2 2191 if (PL_op->op_private & HINT_INTEGER) {
1b6737cc 2192 const IV i = SvIV_nomg(left) & SvIV_nomg(right);
972b05a9 2193 SETi(i);
d0ba1bd2
JH		 2194 }
2195 else {
1b6737cc 2196 const UV u = SvUV_nomg(left) & SvUV_nomg(right);
972b05a9 2197 SETu(u);
d0ba1bd2 2198 }
b20c4ee1
FC		 2199 if (left_ro_nonnum) SvNIOK_off(left);
2200 if (right_ro_nonnum) SvNIOK_off(right);
a0d0e21e
LW		 2201 }
2202 else {
533c011a 2203 do_vop(PL_op->op_type, TARG, left, right);
a0d0e21e
LW		 2204 SETTARG;
2205 }
2206 RETURN;
2207 }
2208}
79072805 2209
a0d0e21e
LW		 2210PP(pp_bit_or)
2211{
3658c1f1
NC		 2212 dVAR; dSP; dATARGET;
2213 const int op_type = PL_op->op_type;
2214
6f1401dc 2215 tryAMAGICbin_MG((op_type == OP_BIT_OR ? bor_amg : bxor_amg), AMGf_assign);
a0d0e21e
LW		 2216 {
2217 dPOPTOPssrl;
4633a7c4 2218 if (SvNIOKp(left) || SvNIOKp(right)) {
b20c4ee1
FC		 2219 const bool left_ro_nonnum = !SvNIOKp(left) && SvREADONLY(left);
2220 const bool right_ro_nonnum = !SvNIOKp(right) && SvREADONLY(right);
d0ba1bd2 2221 if (PL_op->op_private & HINT_INTEGER) {
3658c1f1
NC		 2222 const IV l = (USE_LEFT(left) ? SvIV_nomg(left) : 0);
2223 const IV r = SvIV_nomg(right);
2224 const IV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2225 SETi(result);
d0ba1bd2
JH		 2226 }
2227 else {
3658c1f1
NC		 2228 const UV l = (USE_LEFT(left) ? SvUV_nomg(left) : 0);
2229 const UV r = SvUV_nomg(right);
2230 const UV result = op_type == OP_BIT_OR ? (l | r) : (l ^ r);
2231 SETu(result);
d0ba1bd2 2232 }
b20c4ee1
FC		 2233 if (left_ro_nonnum) SvNIOK_off(left);
2234 if (right_ro_nonnum) SvNIOK_off(right);
a0d0e21e
LW		 2235 }
2236 else {
3658c1f1 2237 do_vop(op_type, TARG, left, right);
a0d0e21e
LW		 2238 SETTARG;
2239 }
2240 RETURN;
79072805 2241 }
a0d0e21e 2242}
79072805 2243
a0d0e21e
LW		 2244PP(pp_negate)
2245{
6f1401dc
DM		 2246 dVAR; dSP; dTARGET;
2247 tryAMAGICun_MG(neg_amg, AMGf_numeric);
a0d0e21e 2248 {
6f1401dc 2249 SV * const sv = TOPs;
1b6737cc 2250 const int flags = SvFLAGS(sv);
a5b92898 2251
886a4465 2252 if( !SvNIOK( sv ) && looks_like_number( sv ) ){
a5b92898
RB		 2253 SvIV_please( sv );
2254 }
2255
28e5dec8
JH		 2256 if ((flags & SVf_IOK) || ((flags & (SVp_IOK | SVp_NOK)) == SVp_IOK)) {
2257 /* It's publicly an integer, or privately an integer-not-float */
2258 oops_its_an_int:
9b0e499b
GS		 2259 if (SvIsUV(sv)) {
2260 if (SvIVX(sv) == IV_MIN) {
28e5dec8 2261 /* 2s complement assumption. */
9b0e499b
GS		 2262 SETi(SvIVX(sv)); /* special case: -((UV)IV_MAX+1) == IV_MIN */
2263 RETURN;
2264 }
2265 else if (SvUVX(sv) <= IV_MAX) {
beccb14c 2266 SETi(-SvIVX(sv));
9b0e499b
GS		 2267 RETURN;
2268 }
2269 }
2270 else if (SvIVX(sv) != IV_MIN) {
2271 SETi(-SvIVX(sv));
2272 RETURN;
2273 }
28e5dec8
JH		 2274#ifdef PERL_PRESERVE_IVUV
2275 else {
2276 SETu((UV)IV_MIN);
2277 RETURN;
2278 }
2279#endif
9b0e499b
GS		 2280 }
2281 if (SvNIOKp(sv))
6f1401dc 2282 SETn(-SvNV_nomg(sv));
4633a7c4 2283 else if (SvPOKp(sv)) {
a0d0e21e 2284 STRLEN len;
6f1401dc 2285 const char * const s = SvPV_nomg_const(sv, len);
bbce6d69 2286 if (isIDFIRST(*s)) {
76f68e9b 2287 sv_setpvs(TARG, "-");
a0d0e21e 2288 sv_catsv(TARG, sv);
79072805 2289 }
a0d0e21e 2290 else if (*s == '+' || *s == '-') {
6f1401dc
DM		 2291 sv_setsv_nomg(TARG, sv);
2292 *SvPV_force_nomg(TARG, len) = *s == '-' ? '+' : '-';
79072805 2293 }
8eb28a70 2294 else if (DO_UTF8(sv)) {
6f1401dc 2295 SvIV_please_nomg(sv);
8eb28a70
JH		 2296 if (SvIOK(sv))
2297 goto oops_its_an_int;
2298 if (SvNOK(sv))
6f1401dc 2299 sv_setnv(TARG, -SvNV_nomg(sv));
8eb28a70 2300 else {
76f68e9b 2301 sv_setpvs(TARG, "-");
8eb28a70
JH		 2302 sv_catsv(TARG, sv);
2303 }
834a4ddd 2304 }
28e5dec8 2305 else {
6f1401dc 2306 SvIV_please_nomg(sv);
8eb28a70
JH		 2307 if (SvIOK(sv))
2308 goto oops_its_an_int;
6f1401dc 2309 sv_setnv(TARG, -SvNV_nomg(sv));
28e5dec8 2310 }
a0d0e21e 2311 SETTARG;
79072805 2312 }
4633a7c4 2313 else
6f1401dc 2314 SETn(-SvNV_nomg(sv));
79072805 2315 }
a0d0e21e 2316 RETURN;
79072805
LW		 2317}
2318
a0d0e21e 2319PP(pp_not)
79072805 2320{
6f1401dc
DM		 2321 dVAR; dSP;
2322 tryAMAGICun_MG(not_amg, AMGf_set);
06c841cf 2323 *PL_stack_sp = boolSV(!SvTRUE_nomg(*PL_stack_sp));
a0d0e21e 2324 return NORMAL;
79072805
LW		 2325}
2326
a0d0e21e 2327PP(pp_complement)
79072805 2328{
6f1401dc 2329 dVAR; dSP; dTARGET;
a42d0242 2330 tryAMAGICun_MG(compl_amg, AMGf_numeric);
a0d0e21e
LW		 2331 {
2332 dTOPss;
4633a7c4 2333 if (SvNIOKp(sv)) {
d0ba1bd2 2334 if (PL_op->op_private & HINT_INTEGER) {
1b6737cc 2335 const IV i = ~SvIV_nomg(sv);
972b05a9 2336 SETi(i);
d0ba1bd2
JH		 2337 }
2338 else {
1b6737cc 2339 const UV u = ~SvUV_nomg(sv);
972b05a9 2340 SETu(u);
d0ba1bd2 2341 }
a0d0e21e
LW		 2342 }
2343 else {
51723571 2344 register U8 *tmps;
55497cff 2345 register I32 anum;
a0d0e21e
LW		 2346 STRLEN len;
2347
10516c54 2348 (void)SvPV_nomg_const(sv,len); /* force check for uninit var */
891f9566 2349 sv_setsv_nomg(TARG, sv);
6f1401dc 2350 tmps = (U8*)SvPV_force_nomg(TARG, len);
a0d0e21e 2351 anum = len;
1d68d6cd 2352 if (SvUTF8(TARG)) {
a1ca4561 2353 /* Calculate exact length, let's not estimate. */
1d68d6cd 2354 STRLEN targlen = 0;
ba210ebe 2355 STRLEN l;
a1ca4561
YST		 2356 UV nchar = 0;
2357 UV nwide = 0;
01f6e806 2358 U8 * const send = tmps + len;
74d49cd0
TS		 2359 U8 * const origtmps = tmps;
2360 const UV utf8flags = UTF8_ALLOW_ANYUV;
1d68d6cd 2361
1d68d6cd 2362 while (tmps < send) {
74d49cd0
TS		 2363 const UV c = utf8n_to_uvchr(tmps, send-tmps, &l, utf8flags);
2364 tmps += l;
5bbb0b5a 2365 targlen += UNISKIP(~c);
a1ca4561
YST		 2366 nchar++;
2367 if (c > 0xff)
2368 nwide++;
1d68d6cd
SC		 2369 }
2370
2371 /* Now rewind strings and write them. */
74d49cd0 2372 tmps = origtmps;
a1ca4561
YST		 2373
2374 if (nwide) {
01f6e806
AL		 2375 U8 *result;
2376 U8 *p;
2377
74d49cd0 2378 Newx(result, targlen + 1, U8);
01f6e806 2379 p = result;
a1ca4561 2380 while (tmps < send) {
74d49cd0
TS		 2381 const UV c = utf8n_to_uvchr(tmps, send-tmps, &l, utf8flags);
2382 tmps += l;
01f6e806 2383 p = uvchr_to_utf8_flags(p, ~c, UNICODE_ALLOW_ANY);
a1ca4561 2384 }
01f6e806 2385 *p = '\0';
c1c21316
NC		 2386 sv_usepvn_flags(TARG, (char*)result, targlen,
2387 SV_HAS_TRAILING_NUL);
a1ca4561
YST		 2388 SvUTF8_on(TARG);
2389 }
2390 else {
01f6e806
AL		 2391 U8 *result;
2392 U8 *p;
2393
74d49cd0 2394 Newx(result, nchar + 1, U8);
01f6e806 2395 p = result;
a1ca4561 2396 while (tmps < send) {
74d49cd0
TS		 2397 const U8 c = (U8)utf8n_to_uvchr(tmps, send-tmps, &l, utf8flags);
2398 tmps += l;
01f6e806 2399 *p++ = ~c;
a1ca4561 2400 }
01f6e806 2401 *p = '\0';
c1c21316 2402 sv_usepvn_flags(TARG, (char*)result, nchar, SV_HAS_TRAILING_NUL);
d0a21e00 2403 SvUTF8_off(TARG);
1d68d6cd 2404 }
ec93b65f 2405 SETTARG;
1d68d6cd
SC		 2406 RETURN;
2407 }
a0d0e21e 2408#ifdef LIBERAL
51723571
JH		 2409 {
2410 register long *tmpl;
2411 for ( ; anum && (unsigned long)tmps % sizeof(long); anum--, tmps++)
2412 *tmps = ~*tmps;
2413 tmpl = (long*)tmps;
bb7a0f54 2414 for ( ; anum >= (I32)sizeof(long); anum -= (I32)sizeof(long), tmpl++)
51723571
JH		 2415 *tmpl = ~*tmpl;
2416 tmps = (U8*)tmpl;
2417 }
a0d0e21e
LW		 2418#endif
2419 for ( ; anum > 0; anum--, tmps++)
2420 *tmps = ~*tmps;
ec93b65f 2421 SETTARG;
a0d0e21e
LW		 2422 }
2423 RETURN;
2424 }
79072805
LW		 2425}
2426
a0d0e21e
LW		 2427/* integer versions of some of the above */
2428
a0d0e21e 2429PP(pp_i_multiply)
79072805 2430{
6f1401dc
DM		 2431 dVAR; dSP; dATARGET;
2432 tryAMAGICbin_MG(mult_amg, AMGf_assign);
a0d0e21e 2433 {
6f1401dc 2434 dPOPTOPiirl_nomg;
a0d0e21e
LW		 2435 SETi( left * right );
2436 RETURN;
2437 }
79072805
LW		 2438}
2439
a0d0e21e 2440PP(pp_i_divide)
79072805 2441{
85935d8e 2442 IV num;
6f1401dc
DM		 2443 dVAR; dSP; dATARGET;
2444 tryAMAGICbin_MG(div_amg, AMGf_assign);
a0d0e21e 2445 {
6f1401dc 2446 dPOPTOPssrl;
85935d8e 2447 IV value = SvIV_nomg(right);
a0d0e21e 2448 if (value == 0)
ece1bcef 2449 DIE(aTHX_ "Illegal division by zero");
85935d8e 2450 num = SvIV_nomg(left);
a0cec769
YST		 2451
2452 /* avoid FPE_INTOVF on some platforms when num is IV_MIN */
2453 if (value == -1)
2454 value = - num;
2455 else
2456 value = num / value;
6f1401dc 2457 SETi(value);
a0d0e21e
LW		 2458 RETURN;
2459 }
79072805
LW		 2460}
2461
befad5d1 2462#if defined(__GLIBC__) && IVSIZE == 8
224ec323
JH		 2463STATIC
2464PP(pp_i_modulo_0)
befad5d1
NC		 2465#else
2466PP(pp_i_modulo)
2467#endif
224ec323
JH		 2468{
2469 /* This is the vanilla old i_modulo. */
6f1401dc
DM		 2470 dVAR; dSP; dATARGET;
2471 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
224ec323 2472 {
6f1401dc 2473 dPOPTOPiirl_nomg;
224ec323
JH		 2474 if (!right)
2475 DIE(aTHX_ "Illegal modulus zero");
a0cec769
YST		 2476 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2477 if (right == -1)
2478 SETi( 0 );
2479 else
2480 SETi( left % right );
224ec323
JH		 2481 RETURN;
2482 }
2483}
2484
11010fa3 2485#if defined(__GLIBC__) && IVSIZE == 8
224ec323
JH		 2486STATIC
2487PP(pp_i_modulo_1)
befad5d1 2488
224ec323 2489{
224ec323 2490 /* This is the i_modulo with the workaround for the _moddi3 bug
fce2b89e 2491 * in (at least) glibc 2.2.5 (the PERL_ABS() the workaround).
224ec323 2492 * See below for pp_i_modulo. */
6f1401dc
DM		 2493 dVAR; dSP; dATARGET;
2494 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
224ec323 2495 {
6f1401dc 2496 dPOPTOPiirl_nomg;
224ec323
JH		 2497 if (!right)
2498 DIE(aTHX_ "Illegal modulus zero");
a0cec769
YST		 2499 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2500 if (right == -1)
2501 SETi( 0 );
2502 else
2503 SETi( left % PERL_ABS(right) );
224ec323
JH		 2504 RETURN;
2505 }
224ec323
JH		 2506}
2507
a0d0e21e 2508PP(pp_i_modulo)
79072805 2509{
6f1401dc
DM		 2510 dVAR; dSP; dATARGET;
2511 tryAMAGICbin_MG(modulo_amg, AMGf_assign);
224ec323 2512 {
6f1401dc 2513 dPOPTOPiirl_nomg;
224ec323
JH		 2514 if (!right)
2515 DIE(aTHX_ "Illegal modulus zero");
2516 /* The assumption is to use hereafter the old vanilla version... */
2517 PL_op->op_ppaddr =
2518 PL_ppaddr[OP_I_MODULO] =
1c127fab 2519 Perl_pp_i_modulo_0;
224ec323
JH		 2520 /* .. but if we have glibc, we might have a buggy _moddi3
2521 * (at least glicb 2.2.5 is known to have this bug), in other
2522 * words our integer modulus with negative quad as the second
2523 * argument might be broken. Test for this and re-patch the
2524 * opcode dispatch table if that is the case, remembering to
2525 * also apply the workaround so that this first round works
2526 * right, too. See [perl #9402] for more information. */
224ec323
JH		 2527 {
2528 IV l = 3;
2529 IV r = -10;
2530 /* Cannot do this check with inlined IV constants since
2531 * that seems to work correctly even with the buggy glibc. */
2532 if (l % r == -3) {
2533 /* Yikes, we have the bug.
2534 * Patch in the workaround version. */
2535 PL_op->op_ppaddr =
2536 PL_ppaddr[OP_I_MODULO] =
2537 &Perl_pp_i_modulo_1;
2538 /* Make certain we work right this time, too. */
32fdb065 2539 right = PERL_ABS(right);
224ec323
JH		 2540 }
2541 }
a0cec769
YST		 2542 /* avoid FPE_INTOVF on some platforms when left is IV_MIN */
2543 if (right == -1)
2544 SETi( 0 );
2545 else
2546 SETi( left % right );
224ec323
JH		 2547 RETURN;
2548 }
79072805 2549}
befad5d1 2550#endif
79072805 2551
a0d0e21e 2552PP(pp_i_add)
79072805 2553{
6f1401dc
DM		 2554 dVAR; dSP; dATARGET;
2555 tryAMAGICbin_MG(add_amg, AMGf_assign);
a0d0e21e 2556 {
6f1401dc 2557 dPOPTOPiirl_ul_nomg;
a0d0e21e
LW		 2558 SETi( left + right );
2559 RETURN;
79072805 2560 }
79072805
LW		 2561}
2562
a0d0e21e 2563PP(pp_i_subtract)
79072805 2564{
6f1401dc
DM		 2565 dVAR; dSP; dATARGET;
2566 tryAMAGICbin_MG(subtr_amg, AMGf_assign);
a0d0e21e 2567 {
6f1401dc 2568 dPOPTOPiirl_ul_nomg;
a0d0e21e
LW		 2569 SETi( left - right );
2570 RETURN;
79072805 2571 }
79072805
LW		 2572}
2573
a0d0e21e 2574PP(pp_i_lt)
79072805 2575{
6f1401dc
DM		 2576 dVAR; dSP;
2577 tryAMAGICbin_MG(lt_amg, AMGf_set);
a0d0e21e 2578 {
96b6b87f 2579 dPOPTOPiirl_nomg;
54310121 2580 SETs(boolSV(left < right));
a0d0e21e
LW		 2581 RETURN;
2582 }
79072805
LW		 2583}
2584
a0d0e21e 2585PP(pp_i_gt)
79072805 2586{
6f1401dc
DM		 2587 dVAR; dSP;
2588 tryAMAGICbin_MG(gt_amg, AMGf_set);
a0d0e21e 2589 {
96b6b87f 2590 dPOPTOPiirl_nomg;
54310121 2591 SETs(boolSV(left > right));
a0d0e21e
LW		 2592 RETURN;
2593 }
79072805
LW		 2594}
2595
a0d0e21e 2596PP(pp_i_le)
79072805 2597{
6f1401dc
DM		 2598 dVAR; dSP;
2599 tryAMAGICbin_MG(le_amg, AMGf_set);
a0d0e21e 2600 {
96b6b87f 2601 dPOPTOPiirl_nomg;
54310121 2602 SETs(boolSV(left <= right));
a0d0e21e 2603 RETURN;
85e6fe83 2604 }
79072805
LW		 2605}
2606
a0d0e21e 2607PP(pp_i_ge)
79072805 2608{
6f1401dc
DM		 2609 dVAR; dSP;
2610 tryAMAGICbin_MG(ge_amg, AMGf_set);
a0d0e21e 2611 {
96b6b87f 2612 dPOPTOPiirl_nomg;
54310121 2613 SETs(boolSV(left >= right));
a0d0e21e
LW		 2614 RETURN;
2615 }
79072805
LW		 2616}
2617
a0d0e21e 2618PP(pp_i_eq)
79072805 2619{
6f1401dc
DM		 2620 dVAR; dSP;
2621 tryAMAGICbin_MG(eq_amg, AMGf_set);
a0d0e21e 2622 {
96b6b87f 2623 dPOPTOPiirl_nomg;
54310121 2624 SETs(boolSV(left == right));
a0d0e21e
LW		 2625 RETURN;
2626 }
79072805
LW		 2627}
2628
a0d0e21e 2629PP(pp_i_ne)
79072805 2630{
6f1401dc
DM		 2631 dVAR; dSP;
2632 tryAMAGICbin_MG(ne_amg, AMGf_set);
a0d0e21e 2633 {
96b6b87f 2634 dPOPTOPiirl_nomg;
54310121 2635 SETs(boolSV(left != right));
a0d0e21e
LW		 2636 RETURN;
2637 }
79072805
LW		 2638}
2639
a0d0e21e 2640PP(pp_i_ncmp)
79072805 2641{
6f1401dc
DM		 2642 dVAR; dSP; dTARGET;
2643 tryAMAGICbin_MG(ncmp_amg, 0);
a0d0e21e 2644 {
96b6b87f 2645 dPOPTOPiirl_nomg;
a0d0e21e 2646 I32 value;
79072805 2647
a0d0e21e 2648 if (left > right)
79072805 2649 value = 1;
a0d0e21e 2650 else if (left < right)
79072805 2651 value = -1;
a0d0e21e 2652 else
79072805 2653 value = 0;
a0d0e21e
LW		 2654 SETi(value);
2655 RETURN;
79072805 2656 }
85e6fe83
LW		 2657}
2658
2659PP(pp_i_negate)
2660{
6f1401dc
DM		 2661 dVAR; dSP; dTARGET;
2662 tryAMAGICun_MG(neg_amg, 0);
2663 {
2664 SV * const sv = TOPs;
2665 IV const i = SvIV_nomg(sv);
2666 SETi(-i);
2667 RETURN;
2668 }
85e6fe83
LW		 2669}
2670
79072805
LW		 2671/* High falutin' math. */
2672
2673PP(pp_atan2)
2674{
6f1401dc
DM		 2675 dVAR; dSP; dTARGET;
2676 tryAMAGICbin_MG(atan2_amg, 0);
a0d0e21e 2677 {
096c060c 2678 dPOPTOPnnrl_nomg;
a1021d57 2679 SETn(Perl_atan2(left, right));
a0d0e21e
LW		 2680 RETURN;
2681 }
79072805
LW		 2682}
2683
2684PP(pp_sin)
2685{
71302fe3
NC		 2686 dVAR; dSP; dTARGET;
2687 int amg_type = sin_amg;
2688 const char *neg_report = NULL;
bc81784a 2689 NV (*func)(NV) = Perl_sin;
71302fe3
NC		 2690 const int op_type = PL_op->op_type;
2691
2692 switch (op_type) {
2693 case OP_COS:
2694 amg_type = cos_amg;
bc81784a 2695 func = Perl_cos;
71302fe3
NC		 2696 break;
2697 case OP_EXP:
2698 amg_type = exp_amg;
bc81784a 2699 func = Perl_exp;
71302fe3
NC		 2700 break;
2701 case OP_LOG:
2702 amg_type = log_amg;
bc81784a 2703 func = Perl_log;
71302fe3
NC		 2704 neg_report = "log";
2705 break;
2706 case OP_SQRT:
2707 amg_type = sqrt_amg;
bc81784a 2708 func = Perl_sqrt;
71302fe3
NC		 2709 neg_report = "sqrt";
2710 break;
a0d0e21e 2711 }
79072805 2712
6f1401dc
DM		 2713
2714 tryAMAGICun_MG(amg_type, 0);
a0d0e21e 2715 {
6f1401dc
DM		 2716 SV * const arg = POPs;
2717 const NV value = SvNV_nomg(arg);
71302fe3
NC		 2718 if (neg_report) {
2719 if (op_type == OP_LOG ? (value <= 0.0) : (value < 0.0)) {
2720 SET_NUMERIC_STANDARD();
2721 DIE(aTHX_ "Can't take %s of %"NVgf, neg_report, value);
2722 }
2723 }
2724 XPUSHn(func(value));
a0d0e21e
LW		 2725 RETURN;
2726 }
79072805
LW		 2727}
2728
56cb0a1c
AD		 2729/* Support Configure command-line overrides for rand() functions.
2730 After 5.005, perhaps we should replace this by Configure support
2731 for drand48(), random(), or rand(). For 5.005, though, maintain
2732 compatibility by calling rand() but allow the user to override it.
2733 See INSTALL for details. --Andy Dougherty 15 July 1998
2734*/
85ab1d1d
JH		 2735/* Now it's after 5.005, and Configure supports drand48() and random(),
2736 in addition to rand(). So the overrides should not be needed any more.
2737 --Jarkko Hietaniemi 27 September 1998
2738 */
2739
2740#ifndef HAS_DRAND48_PROTO
20ce7b12 2741extern double drand48 (void);
56cb0a1c
AD		 2742#endif
2743
79072805
LW		 2744PP(pp_rand)
2745{
97aff369 2746 dVAR; dSP; dTARGET;
65202027 2747 NV value;
79072805
LW		 2748 if (MAXARG < 1)
2749 value = 1.0;
94ec06bc
FC		 2750 else if (!TOPs) {
2751 value = 1.0; (void)POPs;
2752 }
79072805
LW		 2753 else
2754 value = POPn;
2755 if (value == 0.0)
2756 value = 1.0;
80252599 2757 if (!PL_srand_called) {
85ab1d1d 2758 (void)seedDrand01((Rand_seed_t)seed());
80252599 2759 PL_srand_called = TRUE;
93dc8474 2760 }
85ab1d1d 2761 value *= Drand01();
79072805
LW		 2762 XPUSHn(value);
2763 RETURN;
2764}
2765
2766PP(pp_srand)
2767{
83832992 2768 dVAR; dSP; dTARGET;
d22667bf 2769 const UV anum = (MAXARG < 1 || (!TOPs && !POPs)) ? seed() : POPu;
85ab1d1d 2770 (void)seedDrand01((Rand_seed_t)anum);
80252599 2771 PL_srand_called = TRUE;
da1010ec
NC		 2772 if (anum)
2773 XPUSHu(anum);
2774 else {
2775 /* Historically srand always returned true. We can avoid breaking
2776 that like this: */
2777 sv_setpvs(TARG, "0 but true");
2778 XPUSHTARG;
2779 }
83832992 2780 RETURN;
79072805
LW		 2781}
2782
79072805
LW		 2783PP(pp_int)
2784{
6f1401dc
DM		 2785 dVAR; dSP; dTARGET;
2786 tryAMAGICun_MG(int_amg, AMGf_numeric);
774d564b 2787 {
6f1401dc
DM		 2788 SV * const sv = TOPs;
2789 const IV iv = SvIV_nomg(sv);
28e5dec8
JH		 2790 /* XXX it's arguable that compiler casting to IV might be subtly
2791 different from modf (for numbers inside (IV_MIN,UV_MAX)) in which
2792 else preferring IV has introduced a subtle behaviour change bug. OTOH
2793 relying on floating point to be accurate is a bug. */
2794
c781a409 2795 if (!SvOK(sv)) {
922c4365 2796 SETu(0);
c781a409
RD		 2797 }
2798 else if (SvIOK(sv)) {
2799 if (SvIsUV(sv))
6f1401dc 2800 SETu(SvUV_nomg(sv));
c781a409 2801 else
28e5dec8 2802 SETi(iv);
c781a409 2803 }
c781a409 2804 else {
6f1401dc 2805 const NV value = SvNV_nomg(sv);
1048ea30 2806 if (value >= 0.0) {
28e5dec8
JH		 2807 if (value < (NV)UV_MAX + 0.5) {
2808 SETu(U_V(value));
2809 } else {
059a1014 2810 SETn(Perl_floor(value));
28e5dec8 2811 }
1048ea30 2812 }
28e5dec8
JH		 2813 else {
2814 if (value > (NV)IV_MIN - 0.5) {
2815 SETi(I_V(value));
2816 } else {
1bbae031 2817 SETn(Perl_ceil(value));
28e5dec8
JH		 2818 }
2819 }
774d564b 2820 }
79072805 2821 }
79072805
LW		 2822 RETURN;
2823}
2824
463ee0b2
LW		 2825PP(pp_abs)
2826{
6f1401dc
DM		 2827 dVAR; dSP; dTARGET;
2828 tryAMAGICun_MG(abs_amg, AMGf_numeric);
a0d0e21e 2829 {
6f1401dc 2830 SV * const sv = TOPs;
28e5dec8 2831 /* This will cache the NV value if string isn't actually integer */
6f1401dc 2832 const IV iv = SvIV_nomg(sv);
a227d84d 2833
800401ee 2834 if (!SvOK(sv)) {
922c4365 2835 SETu(0);
800401ee
JH		 2836 }
2837 else if (SvIOK(sv)) {
28e5dec8 2838 /* IVX is precise */
800401ee 2839 if (SvIsUV(sv)) {
6f1401dc 2840 SETu(SvUV_nomg(sv)); /* force it to be numeric only */
28e5dec8
JH		 2841 } else {
2842 if (iv >= 0) {
2843 SETi(iv);
2844 } else {
2845 if (iv != IV_MIN) {
2846 SETi(-iv);
2847 } else {
2848 /* 2s complement assumption. Also, not really needed as
2849 IV_MIN and -IV_MIN should both be %100...00 and NV-able */
2850 SETu(IV_MIN);
2851 }
a227d84d 2852 }
28e5dec8
JH		 2853 }
2854 } else{
6f1401dc 2855 const NV value = SvNV_nomg(sv);
774d564b 2856 if (value < 0.0)
1b6737cc 2857 SETn(-value);
a4474c9e
DD		 2858 else
2859 SETn(value);
774d564b 2860 }
a0d0e21e 2861 }
774d564b 2862 RETURN;
463ee0b2
LW		 2863}
2864
79072805
LW		 2865PP(pp_oct)
2866{
97aff369 2867 dVAR; dSP; dTARGET;
5c144d81 2868 const char *tmps;
53305cf1 2869 I32 flags = PERL_SCAN_ALLOW_UNDERSCORES;
6f894ead 2870 STRLEN len;
53305cf1
NC		 2871 NV result_nv;
2872 UV result_uv;
1b6737cc 2873 SV* const sv = POPs;
79072805 2874
349d4f2f 2875 tmps = (SvPV_const(sv, len));
2bc69dc4
NIS		 2876 if (DO_UTF8(sv)) {
2877 /* If Unicode, try to downgrade
2878 * If not possible, croak. */
1b6737cc 2879 SV* const tsv = sv_2mortal(newSVsv(sv));
2bc69dc4
NIS		 2880
2881 SvUTF8_on(tsv);
2882 sv_utf8_downgrade(tsv, FALSE);
349d4f2f 2883 tmps = SvPV_const(tsv, len);
2bc69dc4 2884 }
daa2adfd
NC		 2885 if (PL_op->op_type == OP_HEX)
2886 goto hex;
2887
6f894ead 2888 while (*tmps && len && isSPACE(*tmps))
53305cf1 2889 tmps++, len--;
9e24b6e2 2890 if (*tmps == '0')
53305cf1 2891 tmps++, len--;
a674e8db 2892 if (*tmps == 'x' || *tmps == 'X') {
daa2adfd 2893 hex:
53305cf1 2894 result_uv = grok_hex (tmps, &len, &flags, &result_nv);
daa2adfd 2895 }
a674e8db 2896 else if (*tmps == 'b' || *tmps == 'B')
53305cf1 2897 result_uv = grok_bin (tmps, &len, &flags, &result_nv);
464e2e8a 2898 else
53305cf1
NC		 2899 result_uv = grok_oct (tmps, &len, &flags, &result_nv);
2900
2901 if (flags & PERL_SCAN_GREATER_THAN_UV_MAX) {
2902 XPUSHn(result_nv);
2903 }
2904 else {
2905 XPUSHu(result_uv);
2906 }
79072805
LW		 2907 RETURN;
2908}
2909
2910/* String stuff. */
2911
2912PP(pp_length)
2913{
97aff369 2914 dVAR; dSP; dTARGET;
0bd48802 2915 SV * const sv = TOPs;
a0ed51b3 2916
656266fc 2917 if (SvGAMAGIC(sv)) {
9f621bb0
NC		 2918 /* For an overloaded or magic scalar, we can't know in advance if
2919 it's going to be UTF-8 or not. Also, we can't call sv_len_utf8 as
2920 it likes to cache the length. Maybe that should be a documented
2921 feature of it.
92331800
NC		 2922 */
2923 STRLEN len;
9f621bb0
NC		 2924 const char *const p
2925 = sv_2pv_flags(sv, &len,
2926 SV_UNDEF_RETURNS_NULL|SV_CONST_RETURN|SV_GMAGIC);
92331800 2927
d88e091f 2928 if (!p) {
9407f9c1
DL		 2929 if (!SvPADTMP(TARG)) {
2930 sv_setsv(TARG, &PL_sv_undef);
2931 SETTARG;
2932 }
2933 SETs(&PL_sv_undef);
d88e091f 2934 }
9f621bb0 2935 else if (DO_UTF8(sv)) {
899be101 2936 SETi(utf8_length((U8*)p, (U8*)p + len));
92331800
NC		 2937 }
2938 else
2939 SETi(len);
656266fc 2940 } else if (SvOK(sv)) {
9f621bb0
NC		 2941 /* Neither magic nor overloaded. */
2942 if (DO_UTF8(sv))
2943 SETi(sv_len_utf8(sv));
2944 else
2945 SETi(sv_len(sv));
656266fc 2946 } else {
9407f9c1
DL		 2947 if (!SvPADTMP(TARG)) {
2948 sv_setsv_nomg(TARG, &PL_sv_undef);
2949 SETTARG;
2950 }
2951 SETs(&PL_sv_undef);
92331800 2952 }
79072805
LW		 2953 RETURN;
2954}
2955
2956PP(pp_substr)
2957{
97aff369 2958 dVAR; dSP; dTARGET;
79072805 2959 SV *sv;
463ee0b2 2960 STRLEN curlen;
9402d6ed 2961 STRLEN utf8_curlen;
777f7c56
EB		 2962 SV * pos_sv;
2963 IV pos1_iv;
2964 int pos1_is_uv;
2965 IV pos2_iv;
2966 int pos2_is_uv;
2967 SV * len_sv;
2968 IV len_iv = 0;
2969 int len_is_uv = 1;
050e6362 2970 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
e1ec3a88 2971 const char *tmps;
9402d6ed 2972 SV *repl_sv = NULL;
cbbf8932 2973 const char *repl = NULL;
7b8d334a 2974 STRLEN repl_len;
7bc95ae1 2975 int num_args = PL_op->op_private & 7;
13e30c65 2976 bool repl_need_utf8_upgrade = FALSE;
9402d6ed 2977 bool repl_is_utf8 = FALSE;
79072805 2978
78f9721b
SM		 2979 if (num_args > 2) {
2980 if (num_args > 3) {
7bc95ae1 2981 if((repl_sv = POPs)) {
83003860 2982 repl = SvPV_const(repl_sv, repl_len);
bf32a30c 2983 repl_is_utf8 = DO_UTF8(repl_sv) && repl_len;
7bc95ae1
FC		 2984 }
2985 else num_args--;
2986 }
2987 if ((len_sv = POPs)) {
2988 len_iv = SvIV(len_sv);
2989 len_is_uv = SvIOK_UV(len_sv);
7b8d334a 2990 }
7bc95ae1 2991 else num_args--;
5d82c453 2992 }
777f7c56
EB		 2993 pos_sv = POPs;
2994 pos1_iv = SvIV(pos_sv);
2995 pos1_is_uv = SvIOK_UV(pos_sv);
79072805 2996 sv = POPs;
849ca7ee 2997 PUTBACK;
9402d6ed
JH		 2998 if (repl_sv) {
2999 if (repl_is_utf8) {
3000 if (!DO_UTF8(sv))
3001 sv_utf8_upgrade(sv);
3002 }
13e30c65
JH		 3003 else if (DO_UTF8(sv))
3004 repl_need_utf8_upgrade = TRUE;
9402d6ed 3005 }
5c144d81 3006 tmps = SvPV_const(sv, curlen);
7e2040f0 3007 if (DO_UTF8(sv)) {
9402d6ed
JH		 3008 utf8_curlen = sv_len_utf8(sv);
3009 if (utf8_curlen == curlen)
3010 utf8_curlen = 0;
a0ed51b3 3011 else
9402d6ed 3012 curlen = utf8_curlen;
a0ed51b3 3013 }
d1c2b58a 3014 else
9402d6ed 3015 utf8_curlen = 0;
a0ed51b3 3016
e1dccc0d
Z		 3017 if (!pos1_is_uv && pos1_iv < 0 && curlen) {
3018 pos1_is_uv = curlen-1 > ~(UV)pos1_iv;
3019 pos1_iv += curlen;
777f7c56 3020 }
e1dccc0d
Z		 3021 if ((pos1_is_uv || pos1_iv > 0) && (UV)pos1_iv > curlen)
3022 goto bound_fail;
777f7c56
EB		 3023
3024 if (num_args > 2) {
3025 if (!len_is_uv && len_iv < 0) {
3026 pos2_iv = curlen + len_iv;
3027 if (curlen)
3028 pos2_is_uv = curlen-1 > ~(UV)len_iv;
3029 else
3030 pos2_is_uv = 0;
3031 } else { /* len_iv >= 0 */
3032 if (!pos1_is_uv && pos1_iv < 0) {
3033 pos2_iv = pos1_iv + len_iv;
3034 pos2_is_uv = (UV)len_iv > (UV)IV_MAX;
3035 } else {
3036 if ((UV)len_iv > curlen-(UV)pos1_iv)
3037 pos2_iv = curlen;
3038 else
3039 pos2_iv = pos1_iv+len_iv;
3040 pos2_is_uv = 1;
3041 }
5d82c453 3042 }
2304df62 3043 }
79072805 3044 else {
777f7c56
EB		 3045 pos2_iv = curlen;
3046 pos2_is_uv = 1;
3047 }
3048
3049 if (!pos2_is_uv && pos2_iv < 0) {
3050 if (!pos1_is_uv && pos1_iv < 0)
1c900557 3051 goto bound_fail;
777f7c56
EB		 3052 pos2_iv = 0;
3053 }
3054 else if (!pos1_is_uv && pos1_iv < 0)
3055 pos1_iv = 0;
3056
3057 if ((UV)pos2_iv < (UV)pos1_iv)
3058 pos2_iv = pos1_iv;
3059 if ((UV)pos2_iv > curlen)
3060 pos2_iv = curlen;
3061
3062 {
3063 /* pos1_iv and pos2_iv both in 0..curlen, so the cast is safe */
3064 const STRLEN pos = (STRLEN)( (UV)pos1_iv );
3065 const STRLEN len = (STRLEN)( (UV)pos2_iv - (UV)pos1_iv );
777f7c56 3066 STRLEN byte_len = len;
d931b1be
NC		 3067 STRLEN byte_pos = utf8_curlen
3068 ? sv_pos_u2b_flags(sv, pos, &byte_len, SV_CONST_RETURN) : pos;
3069
2154eca7
EB		 3070 if (lvalue && !repl) {
3071 SV * ret;
3072
3073 if (!SvGMAGICAL(sv)) {
3074 if (SvROK(sv)) {
3075 SvPV_force_nolen(sv);
3076 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR),
3077 "Attempt to use reference as lvalue in substr");
3078 }
3079 if (isGV_with_GP(sv))
3080 SvPV_force_nolen(sv);
3081 else if (SvOK(sv)) /* is it defined ? */
3082 (void)SvPOK_only_UTF8(sv);
3083 else
3084 sv_setpvs(sv, ""); /* avoid lexical reincarnation */
781e7547 3085 }
2154eca7
EB		 3086
3087 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3088 sv_magic(ret, NULL, PERL_MAGIC_substr, NULL, 0);
3089 LvTYPE(ret) = 'x';
3090 LvTARG(ret) = SvREFCNT_inc_simple(sv);
3091 LvTARGOFF(ret) = pos;
3092 LvTARGLEN(ret) = len;
3093
3094 SPAGAIN;
3095 PUSHs(ret); /* avoid SvSETMAGIC here */
3096 RETURN;
781e7547
DM		 3097 }
3098
2154eca7
EB		 3099 SvTAINTED_off(TARG); /* decontaminate */
3100 SvUTF8_off(TARG); /* decontaminate */
3101
3102 tmps += byte_pos;
777f7c56 3103 sv_setpvn(TARG, tmps, byte_len);
12aa1545 3104#ifdef USE_LOCALE_COLLATE
14befaf4 3105 sv_unmagic(TARG, PERL_MAGIC_collxfrm);
12aa1545 3106#endif
9402d6ed 3107 if (utf8_curlen)
7f66633b 3108 SvUTF8_on(TARG);
2154eca7 3109
f7928d6c 3110 if (repl) {
13e30c65
JH		 3111 SV* repl_sv_copy = NULL;
3112
3113 if (repl_need_utf8_upgrade) {
3114 repl_sv_copy = newSVsv(repl_sv);
3115 sv_utf8_upgrade(repl_sv_copy);
349d4f2f 3116 repl = SvPV_const(repl_sv_copy, repl_len);
bf32a30c 3117 repl_is_utf8 = DO_UTF8(repl_sv_copy) && repl_len;
13e30c65 3118 }
502d9230
VP		 3119 if (!SvOK(sv))
3120 sv_setpvs(sv, "");
777f7c56 3121 sv_insert_flags(sv, byte_pos, byte_len, repl, repl_len, 0);
9402d6ed 3122 if (repl_is_utf8)
f7928d6c 3123 SvUTF8_on(sv);
ef8d46e8 3124 SvREFCNT_dec(repl_sv_copy);
f7928d6c 3125 }
79072805 3126 }
849ca7ee 3127 SPAGAIN;
e27c778f
FC		 3128 SvSETMAGIC(TARG);
3129 PUSHs(TARG);
79072805 3130 RETURN;
777f7c56 3131
1c900557 3132bound_fail:
777f7c56
EB		 3133 if (lvalue || repl)
3134 Perl_croak(aTHX_ "substr outside of string");
3135 Perl_ck_warner(aTHX_ packWARN(WARN_SUBSTR), "substr outside of string");
3136 RETPUSHUNDEF;
79072805
LW		 3137}
3138
3139PP(pp_vec)
3140{
2154eca7 3141 dVAR; dSP;
1b6737cc
AL		 3142 register const IV size = POPi;
3143 register const IV offset = POPi;
3144 register SV * const src = POPs;
3145 const I32 lvalue = PL_op->op_flags & OPf_MOD || LVRET;
2154eca7 3146 SV * ret;
a0d0e21e 3147
81e118e0 3148 if (lvalue) { /* it's an lvalue! */
2154eca7
EB		 3149 ret = sv_2mortal(newSV_type(SVt_PVLV)); /* Not TARG RT#67838 */
3150 sv_magic(ret, NULL, PERL_MAGIC_vec, NULL, 0);
3151 LvTYPE(ret) = 'v';
3152 LvTARG(ret) = SvREFCNT_inc_simple(src);
3153 LvTARGOFF(ret) = offset;
3154 LvTARGLEN(ret) = size;
3155 }
3156 else {
3157 dTARGET;
3158 SvTAINTED_off(TARG); /* decontaminate */
3159 ret = TARG;
79072805
LW		 3160 }
3161
2154eca7
EB		 3162 sv_setuv(ret, do_vecget(src, offset, size));
3163 PUSHs(ret);
79072805
LW		 3164 RETURN;
3165}
3166
3167PP(pp_index)
3168{
97aff369 3169 dVAR; dSP; dTARGET;
79072805
LW		 3170 SV *big;
3171 SV *little;
c445ea15 3172 SV *temp = NULL;
ad66a58c 3173 STRLEN biglen;
2723d216 3174 STRLEN llen = 0;
79072805
LW		 3175 I32 offset;
3176 I32 retval;
73ee8be2
NC		 3177 const char *big_p;
3178 const char *little_p;
2f040f7f
NC		 3179 bool big_utf8;
3180 bool little_utf8;
2723d216 3181 const bool is_index = PL_op->op_type == OP_INDEX;
d3e26383 3182 const bool threeargs = MAXARG >= 3 && (TOPs || ((void)POPs,0));
79072805 3183
e1dccc0d
Z		 3184 if (threeargs)
3185 offset = POPi;
79072805
LW		 3186 little = POPs;
3187 big = POPs;
73ee8be2
NC		 3188 big_p = SvPV_const(big, biglen);
3189 little_p = SvPV_const(little, llen);
3190
e609e586
NC		 3191 big_utf8 = DO_UTF8(big);
3192 little_utf8 = DO_UTF8(little);
3193 if (big_utf8 ^ little_utf8) {
3194 /* One needs to be upgraded. */
2f040f7f
NC		 3195 if (little_utf8 && !PL_encoding) {
3196 /* Well, maybe instead we might be able to downgrade the small
3197 string? */
1eced8f8 3198 char * const pv = (char*)bytes_from_utf8((U8 *)little_p, &llen,
2f040f7f
NC		 3199 &little_utf8);
3200 if (little_utf8) {
3201 /* If the large string is ISO-8859-1, and it's not possible to
3202 convert the small string to ISO-8859-1, then there is no
3203 way that it could be found anywhere by index. */
3204 retval = -1;
3205 goto fail;
3206 }
e609e586 3207
2f040f7f
NC		 3208 /* At this point, pv is a malloc()ed string. So donate it to temp
3209 to ensure it will get free()d */
3210 little = temp = newSV(0);
73ee8be2
NC		 3211 sv_usepvn(temp, pv, llen);
3212 little_p = SvPVX(little);
e609e586 3213 } else {
73ee8be2
NC		 3214 temp = little_utf8
3215 ? newSVpvn(big_p, biglen) : newSVpvn(little_p, llen);
2f040f7f
NC		 3216
3217 if (PL_encoding) {
3218 sv_recode_to_utf8(temp, PL_encoding);
3219 } else {
3220 sv_utf8_upgrade(temp);
3221 }
3222 if (little_utf8) {
3223 big = temp;
3224 big_utf8 = TRUE;
73ee8be2 3225 big_p = SvPV_const(big, biglen);
2f040f7f
NC		 3226 } else {
3227 little = temp;
73ee8be2 3228 little_p = SvPV_const(little, llen);
2f040f7f 3229 }
e609e586
NC		 3230 }
3231 }
73ee8be2
NC		 3232 if (SvGAMAGIC(big)) {
3233 /* Life just becomes a lot easier if I use a temporary here.
3234 Otherwise I need to avoid calls to sv_pos_u2b(), which (dangerously)
3235 will trigger magic and overloading again, as will fbm_instr()
3236 */
59cd0e26
NC		 3237 big = newSVpvn_flags(big_p, biglen,
3238 SVs_TEMP | (big_utf8 ? SVf_UTF8 : 0));
73ee8be2
NC		 3239 big_p = SvPVX(big);
3240 }
e4e44778 3241 if (SvGAMAGIC(little) || (is_index && !SvOK(little))) {
73ee8be2
NC		 3242 /* index && SvOK() is a hack. fbm_instr() calls SvPV_const, which will
3243 warn on undef, and we've already triggered a warning with the
3244 SvPV_const some lines above. We can't remove that, as we need to
3245 call some SvPV to trigger overloading early and find out if the
3246 string is UTF-8.
3247 This is all getting to messy. The API isn't quite clean enough,
3248 because data access has side effects.
3249 */
59cd0e26
NC		 3250 little = newSVpvn_flags(little_p, llen,
3251 SVs_TEMP | (little_utf8 ? SVf_UTF8 : 0));
73ee8be2
NC		 3252 little_p = SvPVX(little);
3253 }
e609e586 3254
d3e26383 3255 if (!threeargs)
2723d216 3256 offset = is_index ? 0 : biglen;
a0ed51b3 3257 else {
ad66a58c 3258 if (big_utf8 && offset > 0)
a0ed51b3 3259 sv_pos_u2b(big, &offset, 0);
73ee8be2
NC		 3260 if (!is_index)
3261 offset += llen;
a0ed51b3 3262 }
79072805
LW		 3263 if (offset < 0)
3264 offset = 0;
ad66a58c
NC		 3265 else if (offset > (I32)biglen)
3266 offset = biglen;
73ee8be2
NC		 3267 if (!(little_p = is_index
3268 ? fbm_instr((unsigned char*)big_p + offset,
3269 (unsigned char*)big_p + biglen, little, 0)
3270 : rninstr(big_p, big_p + offset,
3271 little_p, little_p + llen)))
a0ed51b3 3272 retval = -1;
ad66a58c 3273 else {
73ee8be2 3274 retval = little_p - big_p;
ad66a58c
NC		 3275 if (retval > 0 && big_utf8)
3276 sv_pos_b2u(big, &retval);
3277 }
ef8d46e8 3278 SvREFCNT_dec(temp);
2723d216 3279 fail:
e1dccc0d 3280 PUSHi(retval);
79072805
LW		 3281 RETURN;
3282}
3283
3284PP(pp_sprintf)
3285{
97aff369 3286 dVAR; dSP; dMARK; dORIGMARK; dTARGET;
3e6bd4bf 3287 SvTAINTED_off(TARG);
79072805 3288 do_sprintf(TARG, SP-MARK, MARK+1);
bbce6d69 3289 TAINT_IF(SvTAINTED(TARG));
79072805
LW		 3290 SP = ORIGMARK;
3291 PUSHTARG;
3292 RETURN;
3293}
3294
79072805
LW		 3295PP(pp_ord)
3296{
97aff369 3297 dVAR; dSP; dTARGET;
1eced8f8 3298
7df053ec 3299 SV *argsv = POPs;
ba210ebe 3300 STRLEN len;
349d4f2f 3301 const U8 *s = (U8*)SvPV_const(argsv, len);
121910a4 3302
799ef3cb 3303 if (PL_encoding && SvPOK(argsv) && !DO_UTF8(argsv)) {
1eced8f8 3304 SV * const tmpsv = sv_2mortal(newSVsv(argsv));
799ef3cb 3305 s = (U8*)sv_recode_to_utf8(tmpsv, PL_encoding);
121910a4
JH		 3306 argsv = tmpsv;
3307 }
79072805 3308
872c91ae 3309 XPUSHu(DO_UTF8(argsv) ?
89ebb4a3 3310 utf8n_to_uvchr(s, UTF8_MAXBYTES, 0, UTF8_ALLOW_ANYUV) :
5fc32dea 3311 (UV)(*s & 0xff));
68795e93 3312
79072805
LW		 3313 RETURN;
3314}
3315
463ee0b2
LW		 3316PP(pp_chr)
3317{
97aff369 3318 dVAR; dSP; dTARGET;
463ee0b2 3319 char *tmps;
8a064bd6
JH		 3320 UV value;
3321
3322 if (((SvIOK_notUV(TOPs) && SvIV(TOPs) < 0)
3323 ||
3324 (SvNOK(TOPs) && SvNV(TOPs) < 0.0))) {
3325 if (IN_BYTES) {
3326 value = POPu; /* chr(-1) eq chr(0xff), etc. */
3327 } else {
3328 (void) POPs; /* Ignore the argument value. */
3329 value = UNICODE_REPLACEMENT;
3330 }
3331 } else {
3332 value = POPu;
3333 }
463ee0b2 3334
862a34c6 3335 SvUPGRADE(TARG,SVt_PV);
a0ed51b3 3336
0064a8a9 3337 if (value > 255 && !IN_BYTES) {
eb160463 3338 SvGROW(TARG, (STRLEN)UNISKIP(value)+1);
62961d2e 3339 tmps = (char*)uvchr_to_utf8_flags((U8*)SvPVX(TARG), value, 0);
349d4f2f 3340 SvCUR_set(TARG, tmps - SvPVX_const(TARG));
a0ed51b3
LW		 3341 *tmps = '\0';
3342 (void)SvPOK_only(TARG);
aa6ffa16 3343 SvUTF8_on(TARG);
a0ed51b3
LW		 3344 XPUSHs(TARG);
3345 RETURN;
3346 }
3347
748a9306 3348 SvGROW(TARG,2);
463ee0b2
LW		 3349 SvCUR_set(TARG, 1);
3350 tmps = SvPVX(TARG);
eb160463 3351 *tmps++ = (char)value;
748a9306 3352 *tmps = '\0';
a0d0e21e 3353 (void)SvPOK_only(TARG);
4c5ed6e2 3354
88632417 3355 if (PL_encoding && !IN_BYTES) {
799ef3cb 3356 sv_recode_to_utf8(TARG, PL_encoding);
88632417
JH		 3357 tmps = SvPVX(TARG);
3358 if (SvCUR(TARG) == 0 || !is_utf8_string((U8*)tmps, SvCUR(TARG)) ||
4c5ed6e2
TS		 3359 UNICODE_IS_REPLACEMENT(utf8_to_uvchr((U8*)tmps, NULL))) {
3360 SvGROW(TARG, 2);
d5a15ac2 3361 tmps = SvPVX(TARG);
4c5ed6e2
TS		 3362 SvCUR_set(TARG, 1);
3363 *tmps++ = (char)value;
88632417 3364 *tmps = '\0';
4c5ed6e2 3365 SvUTF8_off(TARG);
88632417
JH		 3366 }
3367 }
4c5ed6e2 3368
463ee0b2
LW		 3369 XPUSHs(TARG);
3370 RETURN;
3371}
3372
79072805
LW		 3373PP(pp_crypt)
3374{
79072805 3375#ifdef HAS_CRYPT
97aff369 3376 dVAR; dSP; dTARGET;
5f74f29c 3377 dPOPTOPssrl;
85c16d83 3378 STRLEN len;
10516c54 3379 const char *tmps = SvPV_const(left, len);
2bc69dc4 3380
85c16d83 3381 if (DO_UTF8(left)) {
2bc69dc4 3382 /* If Unicode, try to downgrade.
f2791508
JH		 3383 * If not possible, croak.
3384 * Yes, we made this up. */
1b6737cc 3385 SV* const tsv = sv_2mortal(newSVsv(left));
2bc69dc4 3386
f2791508 3387 SvUTF8_on(tsv);
2bc69dc4 3388 sv_utf8_downgrade(tsv, FALSE);
349d4f2f 3389 tmps = SvPV_const(tsv, len);
85c16d83 3390 }
05404ffe
JH		 3391# ifdef USE_ITHREADS
3392# ifdef HAS_CRYPT_R
3393 if (!PL_reentrant_buffer->_crypt_struct_buffer) {
3394 /* This should be threadsafe because in ithreads there is only
3395 * one thread per interpreter. If this would not be true,
3396 * we would need a mutex to protect this malloc. */
3397 PL_reentrant_buffer->_crypt_struct_buffer =
3398 (struct crypt_data *)safemalloc(sizeof(struct crypt_data));
3399#if defined(__GLIBC__) || defined(__EMX__)
3400 if (PL_reentrant_buffer->_crypt_struct_buffer) {
3401 PL_reentrant_buffer->_crypt_struct_buffer->initialized = 0;
3402 /* work around glibc-2.2.5 bug */
3403 PL_reentrant_buffer->_crypt_struct_buffer->current_saltbits = 0;
3404 }
05404ffe 3405#endif
6ab58e4d 3406 }
05404ffe
JH		 3407# endif /* HAS_CRYPT_R */
3408# endif /* USE_ITHREADS */
5f74f29c 3409# ifdef FCRYPT
83003860 3410 sv_setpv(TARG, fcrypt(tmps, SvPV_nolen_const(right)));
5f74f29c 3411# else
83003860 3412 sv_setpv(TARG, PerlProc_crypt(tmps, SvPV_nolen_const(right)));
5f74f29c 3413# endif
ec93b65f 3414 SETTARG;
4808266b 3415 RETURN;
79072805 3416#else
b13b2135 3417 DIE(aTHX_
79072805
LW		 3418 "The crypt() function is unimplemented due to excessive paranoia.");
3419#endif
79072805
LW		 3420}
3421
00f254e2
KW		 3422/* Generally UTF-8 and UTF-EBCDIC are indistinguishable at this level. So
3423 * most comments below say UTF-8, when in fact they mean UTF-EBCDIC as well */
3424
00f254e2
KW		 3425/* Below are several macros that generate code */
3426/* Generates code to store a unicode codepoint c that is known to occupy
3427 * exactly two UTF-8 and UTF-EBCDIC bytes; it is stored into p and p+1. */
3428#define STORE_UNI_TO_UTF8_TWO_BYTE(p, c) \
3429 STMT_START { \
3430 *(p) = UTF8_TWO_BYTE_HI(c); \
3431 *((p)+1) = UTF8_TWO_BYTE_LO(c); \
3432 } STMT_END
3433
3434/* Like STORE_UNI_TO_UTF8_TWO_BYTE, but advances p to point to the next
3435 * available byte after the two bytes */
3436#define CAT_UNI_TO_UTF8_TWO_BYTE(p, c) \
3437 STMT_START { \
3438 *(p)++ = UTF8_TWO_BYTE_HI(c); \
3439 *((p)++) = UTF8_TWO_BYTE_LO(c); \
3440 } STMT_END
3441
3442/* Generates code to store the upper case of latin1 character l which is known
3443 * to have its upper case be non-latin1 into the two bytes p and p+1. There
3444 * are only two characters that fit this description, and this macro knows
3445 * about them, and that the upper case values fit into two UTF-8 or UTF-EBCDIC
3446 * bytes */
3447#define STORE_NON_LATIN1_UC(p, l) \
3448STMT_START { \
3449 if ((l) == LATIN_SMALL_LETTER_Y_WITH_DIAERESIS) { \
3450 STORE_UNI_TO_UTF8_TWO_BYTE((p), LATIN_CAPITAL_LETTER_Y_WITH_DIAERESIS); \
3451 } else { /* Must be the following letter */ \
3452 STORE_UNI_TO_UTF8_TWO_BYTE((p), GREEK_CAPITAL_LETTER_MU); \
3453 } \
3454} STMT_END
3455
3456/* Like STORE_NON_LATIN1_UC, but advances p to point to the next available byte
3457 * after the character stored */
3458#define CAT_NON_LATIN1_UC(p, l) \
3459STMT_START { \
3460 if ((l) == LATIN_SMALL_LETTER_Y_WITH_DIAERESIS) { \
3461 CAT_UNI_TO_UTF8_TWO_BYTE((p), LATIN_CAPITAL_LETTER_Y_WITH_DIAERESIS); \
3462 } else { \
3463 CAT_UNI_TO_UTF8_TWO_BYTE((p), GREEK_CAPITAL_LETTER_MU); \
3464 } \
3465} STMT_END
3466
3467/* Generates code to add the two UTF-8 bytes (probably u) that are the upper
3468 * case of l into p and p+1. u must be the result of toUPPER_LATIN1_MOD(l),
3469 * and must require two bytes to store it. Advances p to point to the next
3470 * available position */
3471#define CAT_TWO_BYTE_UNI_UPPER_MOD(p, l, u) \
3472STMT_START { \
3473 if ((u) != LATIN_SMALL_LETTER_Y_WITH_DIAERESIS) { \
3474 CAT_UNI_TO_UTF8_TWO_BYTE((p), (u)); /* not special, just save it */ \
3475 } else if (l == LATIN_SMALL_LETTER_SHARP_S) { \
3476 *(p)++ = 'S'; *(p)++ = 'S'; /* upper case is 'SS' */ \
3477 } else {/* else is one of the other two special cases */ \
3478 CAT_NON_LATIN1_UC((p), (l)); \
3479 } \
3480} STMT_END
3481
79072805
LW		 3482PP(pp_ucfirst)
3483{
00f254e2
KW		 3484 /* Actually is both lcfirst() and ucfirst(). Only the first character
3485 * changes. This means that possibly we can change in-place, ie., just
3486 * take the source and change that one character and store it back, but not
3487 * if read-only etc, or if the length changes */
3488
97aff369 3489 dVAR;
39644a26 3490 dSP;
d54190f6 3491 SV *source = TOPs;
00f254e2 3492 STRLEN slen; /* slen is the byte length of the whole SV. */
d54190f6
NC		 3493 STRLEN need;
3494 SV *dest;
00f254e2
KW		 3495 bool inplace; /* ? Convert first char only, in-place */
3496 bool doing_utf8 = FALSE; /* ? using utf8 */
3497 bool convert_source_to_utf8 = FALSE; /* ? need to convert */
12e9c124 3498 const int op_type = PL_op->op_type;
d54190f6
NC		 3499 const U8 *s;
3500 U8 *d;
3501 U8 tmpbuf[UTF8_MAXBYTES_CASE+1];
00f254e2
KW		 3502 STRLEN ulen; /* ulen is the byte length of the original Unicode character
3503 * stored as UTF-8 at s. */
3504 STRLEN tculen; /* tculen is the byte length of the freshly titlecased (or
3505 * lowercased) character stored in tmpbuf. May be either
3506 * UTF-8 or not, but in either case is the number of bytes */
d54190f6
NC		 3507
3508 SvGETMAGIC(source);
3509 if (SvOK(source)) {
3510 s = (const U8*)SvPV_nomg_const(source, slen);
3511 } else {
0a0ffbce
RGS		 3512 if (ckWARN(WARN_UNINITIALIZED))
3513 report_uninit(source);
1eced8f8 3514 s = (const U8*)"";
d54190f6
NC		 3515 slen = 0;
3516 }
a0ed51b3 3517
00f254e2
KW		 3518 /* We may be able to get away with changing only the first character, in
3519 * place, but not if read-only, etc. Later we may discover more reasons to
3520 * not convert in-place. */
3521 inplace = SvPADTMP(source) && !SvREADONLY(source) && SvTEMP(source);
3522
3523 /* First calculate what the changed first character should be. This affects
3524 * whether we can just swap it out, leaving the rest of the string unchanged,
3525 * or even if have to convert the dest to UTF-8 when the source isn't */
3526
3527 if (! slen) { /* If empty */
3528 need = 1; /* still need a trailing NUL */
3529 }
3530 else if (DO_UTF8(source)) { /* Is the source utf8? */
d54190f6 3531 doing_utf8 = TRUE;
00f254e2 3532
00f254e2
KW		 3533 if (UTF8_IS_INVARIANT(*s)) {
3534
3535 /* An invariant source character is either ASCII or, in EBCDIC, an
3536 * ASCII equivalent or a caseless C1 control. In both these cases,
3537 * the lower and upper cases of any character are also invariants
3538 * (and title case is the same as upper case). So it is safe to
3539 * use the simple case change macros which avoid the overhead of
3540 * the general functions. Note that if perl were to be extended to
3541 * do locale handling in UTF-8 strings, this wouldn't be true in,
3542 * for example, Lithuanian or Turkic. */
3543 *tmpbuf = (op_type == OP_LCFIRST) ? toLOWER(*s) : toUPPER(*s);
3544 tculen = ulen = 1;
3545 need = slen + 1;
12e9c124 3546 }
00f254e2
KW		 3547 else if (UTF8_IS_DOWNGRADEABLE_START(*s)) {
3548 U8 chr;
3549
3550 /* Similarly, if the source character isn't invariant but is in the
3551 * latin1 range (or EBCDIC equivalent thereof), we have the case
3552 * changes compiled into perl, and can avoid the overhead of the
3553 * general functions. In this range, the characters are stored as
3554 * two UTF-8 bytes, and it so happens that any changed-case version
3555 * is also two bytes (in both ASCIIish and EBCDIC machines). */
3556 tculen = ulen = 2;
3557 need = slen + 1;
3558
3559 /* Convert the two source bytes to a single Unicode code point
3560 * value, change case and save for below */
356979f4 3561 chr = TWO_BYTE_UTF8_TO_UNI(*s, *(s+1));
00f254e2
KW		 3562 if (op_type == OP_LCFIRST) { /* lower casing is easy */
3563 U8 lower = toLOWER_LATIN1(chr);
3564 STORE_UNI_TO_UTF8_TWO_BYTE(tmpbuf, lower);
3565 }
3566 else { /* ucfirst */
3567 U8 upper = toUPPER_LATIN1_MOD(chr);
3568
3569 /* Most of the latin1 range characters are well-behaved. Their
3570 * title and upper cases are the same, and are also in the
3571 * latin1 range. The macro above returns their upper (hence
3572 * title) case, and all that need be done is to save the result
3573 * for below. However, several characters are problematic, and
3574 * have to be handled specially. The MOD in the macro name
3575 * above means that these tricky characters all get mapped to
3576 * the single character LATIN_SMALL_LETTER_Y_WITH_DIAERESIS.
3577 * This mapping saves some tests for the majority of the
3578 * characters */
3579
3580 if (upper != LATIN_SMALL_LETTER_Y_WITH_DIAERESIS) {
3581
3582 /* Not tricky. Just save it. */
3583 STORE_UNI_TO_UTF8_TWO_BYTE(tmpbuf, upper);
3584 }
3585 else if (chr == LATIN_SMALL_LETTER_SHARP_S) {
3586
3587 /* This one is tricky because it is two characters long,
3588 * though the UTF-8 is still two bytes, so the stored
3589 * length doesn't change */
3590 *tmpbuf = 'S'; /* The UTF-8 is 'Ss' */
3591 *(tmpbuf + 1) = 's';
3592 }
3593 else {
3594
3595 /* The other two have their title and upper cases the same,
3596 * but are tricky because the changed-case characters
3597 * aren't in the latin1 range. They, however, do fit into
3598 * two UTF-8 bytes */
3599 STORE_NON_LATIN1_UC(tmpbuf, chr);
3600 }
3601 }
3602 }
3603 else {
00f254e2
KW		 3604
3605 /* Here, can't short-cut the general case */
3606
3607 utf8_to_uvchr(s, &ulen);
3608 if (op_type == OP_UCFIRST) toTITLE_utf8(s, tmpbuf, &tculen);
3609 else toLOWER_utf8(s, tmpbuf, &tculen);
3610
3611 /* we can't do in-place if the length changes. */
3612 if (ulen != tculen) inplace = FALSE;
3613 need = slen + 1 - ulen + tculen;
00f254e2 3614 }
d54190f6 3615 }
00f254e2
KW		 3616 else { /* Non-zero length, non-UTF-8, Need to consider locale and if
3617 * latin1 is treated as caseless. Note that a locale takes
3618 * precedence */
3619 tculen = 1; /* Most characters will require one byte, but this will
3620 * need to be overridden for the tricky ones */
3621 need = slen + 1;
3622
3623 if (op_type == OP_LCFIRST) {
d54190f6 3624
00f254e2
KW		 3625 /* lower case the first letter: no trickiness for any character */
3626 *tmpbuf = (IN_LOCALE_RUNTIME) ? toLOWER_LC(*s) :
3627 ((IN_UNI_8_BIT) ? toLOWER_LATIN1(*s) : toLOWER(*s));
3628 }
3629 /* is ucfirst() */
3630 else if (IN_LOCALE_RUNTIME) {
3631 *tmpbuf = toUPPER_LC(*s); /* This would be a bug if any locales
3632 * have upper and title case different
3633 */
3634 }
3635 else if (! IN_UNI_8_BIT) {
3636 *tmpbuf = toUPPER(*s); /* Returns caseless for non-ascii, or
3637 * on EBCDIC machines whatever the
3638 * native function does */
3639 }
3640 else { /* is ucfirst non-UTF-8, not in locale, and cased latin1 */
3641 *tmpbuf = toUPPER_LATIN1_MOD(*s);
3642
3643 /* tmpbuf now has the correct title case for all latin1 characters
3644 * except for the several ones that have tricky handling. All
3645 * of these are mapped by the MOD to the letter below. */
3646 if (*tmpbuf == LATIN_SMALL_LETTER_Y_WITH_DIAERESIS) {
3647
3648 /* The length is going to change, with all three of these, so
3649 * can't replace just the first character */
3650 inplace = FALSE;
3651
3652 /* We use the original to distinguish between these tricky
3653 * cases */
3654 if (*s == LATIN_SMALL_LETTER_SHARP_S) {
3655 /* Two character title case 'Ss', but can remain non-UTF-8 */
3656 need = slen + 2;
3657 *tmpbuf = 'S';
3658 *(tmpbuf + 1) = 's'; /* Assert: length(tmpbuf) >= 2 */
3659 tculen = 2;
3660 }
3661 else {
d54190f6 3662
00f254e2
KW		 3663 /* The other two tricky ones have their title case outside
3664 * latin1. It is the same as their upper case. */
3665 doing_utf8 = TRUE;
3666 STORE_NON_LATIN1_UC(tmpbuf, *s);
3667
3668 /* The UTF-8 and UTF-EBCDIC lengths of both these characters
3669 * and their upper cases is 2. */
3670 tculen = ulen = 2;
3671
3672 /* The entire result will have to be in UTF-8. Assume worst
3673 * case sizing in conversion. (all latin1 characters occupy
3674 * at most two bytes in utf8) */
3675 convert_source_to_utf8 = TRUE;
3676 need = slen * 2 + 1;