| 1 | /* pp_hot.c |
| 2 | * |
| 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 |
| 5 | * |
| 6 | * You may distribute under the terms of either the GNU General Public |
| 7 | * License or the Artistic License, as specified in the README file. |
| 8 | * |
| 9 | */ |
| 10 | |
| 11 | /* |
| 12 | * Then he heard Merry change the note, and up went the Horn-cry of Buckland, |
| 13 | * shaking the air. |
| 14 | * |
| 15 | * Awake! Awake! Fear, Fire, Foes! Awake! |
| 16 | * Fire, Foes! Awake! |
| 17 | * |
| 18 | * [p.1007 of _The Lord of the Rings_, VI/viii: "The Scouring of the Shire"] |
| 19 | */ |
| 20 | |
| 21 | /* This file contains 'hot' pp ("push/pop") functions that |
| 22 | * execute the opcodes that make up a perl program. A typical pp function |
| 23 | * expects to find its arguments on the stack, and usually pushes its |
| 24 | * results onto the stack, hence the 'pp' terminology. Each OP structure |
| 25 | * contains a pointer to the relevant pp_foo() function. |
| 26 | * |
| 27 | * By 'hot', we mean common ops whose execution speed is critical. |
| 28 | * By gathering them together into a single file, we encourage |
| 29 | * CPU cache hits on hot code. Also it could be taken as a warning not to |
| 30 | * change any code in this file unless you're sure it won't affect |
| 31 | * performance. |
| 32 | */ |
| 33 | |
| 34 | #include "EXTERN.h" |
| 35 | #define PERL_IN_PP_HOT_C |
| 36 | #include "perl.h" |
| 37 | |
| 38 | /* Hot code. */ |
| 39 | |
| 40 | PP(pp_const) |
| 41 | { |
| 42 | dVAR; |
| 43 | dSP; |
| 44 | XPUSHs(cSVOP_sv); |
| 45 | RETURN; |
| 46 | } |
| 47 | |
| 48 | PP(pp_nextstate) |
| 49 | { |
| 50 | dVAR; |
| 51 | PL_curcop = (COP*)PL_op; |
| 52 | TAINT_NOT; /* Each statement is presumed innocent */ |
| 53 | PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; |
| 54 | FREETMPS; |
| 55 | PERL_ASYNC_CHECK(); |
| 56 | return NORMAL; |
| 57 | } |
| 58 | |
| 59 | PP(pp_gvsv) |
| 60 | { |
| 61 | dVAR; |
| 62 | dSP; |
| 63 | EXTEND(SP,1); |
| 64 | if (PL_op->op_private & OPpLVAL_INTRO) |
| 65 | PUSHs(save_scalar(cGVOP_gv)); |
| 66 | else |
| 67 | PUSHs(GvSVn(cGVOP_gv)); |
| 68 | RETURN; |
| 69 | } |
| 70 | |
| 71 | PP(pp_null) |
| 72 | { |
| 73 | dVAR; |
| 74 | return NORMAL; |
| 75 | } |
| 76 | |
| 77 | /* This is sometimes called directly by pp_coreargs and pp_grepstart. */ |
| 78 | PP(pp_pushmark) |
| 79 | { |
| 80 | dVAR; |
| 81 | PUSHMARK(PL_stack_sp); |
| 82 | return NORMAL; |
| 83 | } |
| 84 | |
| 85 | PP(pp_stringify) |
| 86 | { |
| 87 | dVAR; dSP; dTARGET; |
| 88 | SV * const sv = TOPs; |
| 89 | SETs(TARG); |
| 90 | sv_copypv(TARG, sv); |
| 91 | SvSETMAGIC(TARG); |
| 92 | /* no PUTBACK, SETs doesn't inc/dec SP */ |
| 93 | return NORMAL; |
| 94 | } |
| 95 | |
| 96 | PP(pp_gv) |
| 97 | { |
| 98 | dVAR; dSP; |
| 99 | XPUSHs(MUTABLE_SV(cGVOP_gv)); |
| 100 | RETURN; |
| 101 | } |
| 102 | |
| 103 | PP(pp_and) |
| 104 | { |
| 105 | dVAR; |
| 106 | PERL_ASYNC_CHECK(); |
| 107 | { |
| 108 | /* SP is not used to remove a variable that is saved across the |
| 109 | sv_2bool_flags call in SvTRUE_NN, if a RISC/CISC or low/high machine |
| 110 | register or load/store vs direct mem ops macro is introduced, this |
| 111 | should be a define block between direct PL_stack_sp and dSP operations, |
| 112 | presently, using PL_stack_sp is bias towards CISC cpus */ |
| 113 | SV * const sv = *PL_stack_sp; |
| 114 | if (!SvTRUE_NN(sv)) |
| 115 | return NORMAL; |
| 116 | else { |
| 117 | if (PL_op->op_type == OP_AND) |
| 118 | --PL_stack_sp; |
| 119 | return cLOGOP->op_other; |
| 120 | } |
| 121 | } |
| 122 | } |
| 123 | |
| 124 | PP(pp_sassign) |
| 125 | { |
| 126 | dVAR; dSP; |
| 127 | /* sassign keeps its args in the optree traditionally backwards. |
| 128 | So we pop them differently. |
| 129 | */ |
| 130 | SV *left = POPs; SV *right = TOPs; |
| 131 | |
| 132 | if (PL_op->op_private & OPpASSIGN_BACKWARDS) { |
| 133 | SV * const temp = left; |
| 134 | left = right; right = temp; |
| 135 | } |
| 136 | if (TAINTING_get && TAINT_get && !SvTAINTED(right)) |
| 137 | TAINT_NOT; |
| 138 | if (PL_op->op_private & OPpASSIGN_CV_TO_GV) { |
| 139 | SV * const cv = SvRV(right); |
| 140 | const U32 cv_type = SvTYPE(cv); |
| 141 | const bool is_gv = isGV_with_GP(left); |
| 142 | const bool got_coderef = cv_type == SVt_PVCV || cv_type == SVt_PVFM; |
| 143 | |
| 144 | if (!got_coderef) { |
| 145 | assert(SvROK(cv)); |
| 146 | } |
| 147 | |
| 148 | /* Can do the optimisation if left (LVALUE) is not a typeglob, |
| 149 | right (RVALUE) is a reference to something, and we're in void |
| 150 | context. */ |
| 151 | if (!got_coderef && !is_gv && GIMME_V == G_VOID) { |
| 152 | /* Is the target symbol table currently empty? */ |
| 153 | GV * const gv = gv_fetchsv_nomg(left, GV_NOINIT, SVt_PVGV); |
| 154 | if (SvTYPE(gv) != SVt_PVGV && !SvOK(gv)) { |
| 155 | /* Good. Create a new proxy constant subroutine in the target. |
| 156 | The gv becomes a(nother) reference to the constant. */ |
| 157 | SV *const value = SvRV(cv); |
| 158 | |
| 159 | SvUPGRADE(MUTABLE_SV(gv), SVt_IV); |
| 160 | SvPCS_IMPORTED_on(gv); |
| 161 | SvRV_set(gv, value); |
| 162 | SvREFCNT_inc_simple_void(value); |
| 163 | SETs(left); |
| 164 | RETURN; |
| 165 | } |
| 166 | } |
| 167 | |
| 168 | /* Need to fix things up. */ |
| 169 | if (!is_gv) { |
| 170 | /* Need to fix GV. */ |
| 171 | left = MUTABLE_SV(gv_fetchsv_nomg(left,GV_ADD, SVt_PVGV)); |
| 172 | } |
| 173 | |
| 174 | if (!got_coderef) { |
| 175 | /* We've been returned a constant rather than a full subroutine, |
| 176 | but they expect a subroutine reference to apply. */ |
| 177 | if (SvROK(cv)) { |
| 178 | ENTER_with_name("sassign_coderef"); |
| 179 | SvREFCNT_inc_void(SvRV(cv)); |
| 180 | /* newCONSTSUB takes a reference count on the passed in SV |
| 181 | from us. We set the name to NULL, otherwise we get into |
| 182 | all sorts of fun as the reference to our new sub is |
| 183 | donated to the GV that we're about to assign to. |
| 184 | */ |
| 185 | SvRV_set(right, MUTABLE_SV(newCONSTSUB(GvSTASH(left), NULL, |
| 186 | SvRV(cv)))); |
| 187 | SvREFCNT_dec_NN(cv); |
| 188 | LEAVE_with_name("sassign_coderef"); |
| 189 | } else { |
| 190 | /* What can happen for the corner case *{"BONK"} = \&{"BONK"}; |
| 191 | is that |
| 192 | First: ops for \&{"BONK"}; return us the constant in the |
| 193 | symbol table |
| 194 | Second: ops for *{"BONK"} cause that symbol table entry |
| 195 | (and our reference to it) to be upgraded from RV |
| 196 | to typeblob) |
| 197 | Thirdly: We get here. cv is actually PVGV now, and its |
| 198 | GvCV() is actually the subroutine we're looking for |
| 199 | |
| 200 | So change the reference so that it points to the subroutine |
| 201 | of that typeglob, as that's what they were after all along. |
| 202 | */ |
| 203 | GV *const upgraded = MUTABLE_GV(cv); |
| 204 | CV *const source = GvCV(upgraded); |
| 205 | |
| 206 | assert(source); |
| 207 | assert(CvFLAGS(source) & CVf_CONST); |
| 208 | |
| 209 | SvREFCNT_inc_void(source); |
| 210 | SvREFCNT_dec_NN(upgraded); |
| 211 | SvRV_set(right, MUTABLE_SV(source)); |
| 212 | } |
| 213 | } |
| 214 | |
| 215 | } |
| 216 | if ( |
| 217 | SvTEMP(left) && !SvSMAGICAL(left) && SvREFCNT(left) == 1 && |
| 218 | (!isGV_with_GP(left) || SvFAKE(left)) && ckWARN(WARN_MISC) |
| 219 | ) |
| 220 | Perl_warner(aTHX_ |
| 221 | packWARN(WARN_MISC), "Useless assignment to a temporary" |
| 222 | ); |
| 223 | SvSetMagicSV(left, right); |
| 224 | SETs(left); |
| 225 | RETURN; |
| 226 | } |
| 227 | |
| 228 | PP(pp_cond_expr) |
| 229 | { |
| 230 | dVAR; dSP; |
| 231 | PERL_ASYNC_CHECK(); |
| 232 | if (SvTRUEx(POPs)) |
| 233 | RETURNOP(cLOGOP->op_other); |
| 234 | else |
| 235 | RETURNOP(cLOGOP->op_next); |
| 236 | } |
| 237 | |
| 238 | PP(pp_unstack) |
| 239 | { |
| 240 | dVAR; |
| 241 | PERL_ASYNC_CHECK(); |
| 242 | TAINT_NOT; /* Each statement is presumed innocent */ |
| 243 | PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; |
| 244 | FREETMPS; |
| 245 | if (!(PL_op->op_flags & OPf_SPECIAL)) { |
| 246 | I32 oldsave = PL_scopestack[PL_scopestack_ix - 1]; |
| 247 | LEAVE_SCOPE(oldsave); |
| 248 | } |
| 249 | return NORMAL; |
| 250 | } |
| 251 | |
| 252 | PP(pp_concat) |
| 253 | { |
| 254 | dVAR; dSP; dATARGET; tryAMAGICbin_MG(concat_amg, AMGf_assign); |
| 255 | { |
| 256 | dPOPTOPssrl; |
| 257 | bool lbyte; |
| 258 | STRLEN rlen; |
| 259 | const char *rpv = NULL; |
| 260 | bool rbyte = FALSE; |
| 261 | bool rcopied = FALSE; |
| 262 | |
| 263 | if (TARG == right && right != left) { /* $r = $l.$r */ |
| 264 | rpv = SvPV_nomg_const(right, rlen); |
| 265 | rbyte = !DO_UTF8(right); |
| 266 | right = newSVpvn_flags(rpv, rlen, SVs_TEMP); |
| 267 | rpv = SvPV_const(right, rlen); /* no point setting UTF-8 here */ |
| 268 | rcopied = TRUE; |
| 269 | } |
| 270 | |
| 271 | if (TARG != left) { /* not $l .= $r */ |
| 272 | STRLEN llen; |
| 273 | const char* const lpv = SvPV_nomg_const(left, llen); |
| 274 | lbyte = !DO_UTF8(left); |
| 275 | sv_setpvn(TARG, lpv, llen); |
| 276 | if (!lbyte) |
| 277 | SvUTF8_on(TARG); |
| 278 | else |
| 279 | SvUTF8_off(TARG); |
| 280 | } |
| 281 | else { /* $l .= $r */ |
| 282 | if (!SvOK(TARG)) { |
| 283 | if (left == right && ckWARN(WARN_UNINITIALIZED)) /* $l .= $l */ |
| 284 | report_uninit(right); |
| 285 | sv_setpvs(left, ""); |
| 286 | } |
| 287 | SvPV_force_nomg_nolen(left); |
| 288 | lbyte = !DO_UTF8(left); |
| 289 | if (IN_BYTES) |
| 290 | SvUTF8_off(TARG); |
| 291 | } |
| 292 | |
| 293 | if (!rcopied) { |
| 294 | if (left == right) |
| 295 | /* $r.$r: do magic twice: tied might return different 2nd time */ |
| 296 | SvGETMAGIC(right); |
| 297 | rpv = SvPV_nomg_const(right, rlen); |
| 298 | rbyte = !DO_UTF8(right); |
| 299 | } |
| 300 | if (lbyte != rbyte) { |
| 301 | /* sv_utf8_upgrade_nomg() may reallocate the stack */ |
| 302 | PUTBACK; |
| 303 | if (lbyte) |
| 304 | sv_utf8_upgrade_nomg(TARG); |
| 305 | else { |
| 306 | if (!rcopied) |
| 307 | right = newSVpvn_flags(rpv, rlen, SVs_TEMP); |
| 308 | sv_utf8_upgrade_nomg(right); |
| 309 | rpv = SvPV_nomg_const(right, rlen); |
| 310 | } |
| 311 | SPAGAIN; |
| 312 | } |
| 313 | sv_catpvn_nomg(TARG, rpv, rlen); |
| 314 | |
| 315 | SETTARG; |
| 316 | RETURN; |
| 317 | } |
| 318 | } |
| 319 | |
| 320 | /* push the elements of av onto the stack. |
| 321 | * XXX Note that padav has similar code but without the mg_get(). |
| 322 | * I suspect that the mg_get is no longer needed, but while padav |
| 323 | * differs, it can't share this function */ |
| 324 | |
| 325 | STATIC void |
| 326 | S_pushav(pTHX_ AV* const av) |
| 327 | { |
| 328 | dSP; |
| 329 | const SSize_t maxarg = AvFILL(av) + 1; |
| 330 | EXTEND(SP, maxarg); |
| 331 | if (SvRMAGICAL(av)) { |
| 332 | PADOFFSET i; |
| 333 | for (i=0; i < (PADOFFSET)maxarg; i++) { |
| 334 | SV ** const svp = av_fetch(av, i, FALSE); |
| 335 | /* See note in pp_helem, and bug id #27839 */ |
| 336 | SP[i+1] = svp |
| 337 | ? SvGMAGICAL(*svp) ? (mg_get(*svp), *svp) : *svp |
| 338 | : &PL_sv_undef; |
| 339 | } |
| 340 | } |
| 341 | else { |
| 342 | PADOFFSET i; |
| 343 | for (i=0; i < (PADOFFSET)maxarg; i++) { |
| 344 | SV * const sv = AvARRAY(av)[i]; |
| 345 | SP[i+1] = sv ? sv : &PL_sv_undef; |
| 346 | } |
| 347 | } |
| 348 | SP += maxarg; |
| 349 | PUTBACK; |
| 350 | } |
| 351 | |
| 352 | |
| 353 | /* ($lex1,@lex2,...) or my ($lex1,@lex2,...) */ |
| 354 | |
| 355 | PP(pp_padrange) |
| 356 | { |
| 357 | dVAR; dSP; |
| 358 | PADOFFSET base = PL_op->op_targ; |
| 359 | int count = (int)(PL_op->op_private) & OPpPADRANGE_COUNTMASK; |
| 360 | int i; |
| 361 | if (PL_op->op_flags & OPf_SPECIAL) { |
| 362 | /* fake the RHS of my ($x,$y,..) = @_ */ |
| 363 | PUSHMARK(SP); |
| 364 | S_pushav(aTHX_ GvAVn(PL_defgv)); |
| 365 | SPAGAIN; |
| 366 | } |
| 367 | |
| 368 | /* note, this is only skipped for compile-time-known void cxt */ |
| 369 | if ((PL_op->op_flags & OPf_WANT) != OPf_WANT_VOID) { |
| 370 | EXTEND(SP, count); |
| 371 | PUSHMARK(SP); |
| 372 | for (i = 0; i <count; i++) |
| 373 | *++SP = PAD_SV(base+i); |
| 374 | } |
| 375 | if (PL_op->op_private & OPpLVAL_INTRO) { |
| 376 | SV **svp = &(PAD_SVl(base)); |
| 377 | const UV payload = (UV)( |
| 378 | (base << (OPpPADRANGE_COUNTSHIFT + SAVE_TIGHT_SHIFT)) |
| 379 | | (count << SAVE_TIGHT_SHIFT) |
| 380 | | SAVEt_CLEARPADRANGE); |
| 381 | assert(OPpPADRANGE_COUNTMASK + 1 == (1 <<OPpPADRANGE_COUNTSHIFT)); |
| 382 | assert((payload >> (OPpPADRANGE_COUNTSHIFT+SAVE_TIGHT_SHIFT)) == base); |
| 383 | { |
| 384 | dSS_ADD; |
| 385 | SS_ADD_UV(payload); |
| 386 | SS_ADD_END(1); |
| 387 | } |
| 388 | |
| 389 | for (i = 0; i <count; i++) |
| 390 | SvPADSTALE_off(*svp++); /* mark lexical as active */ |
| 391 | } |
| 392 | RETURN; |
| 393 | } |
| 394 | |
| 395 | |
| 396 | PP(pp_padsv) |
| 397 | { |
| 398 | dVAR; dSP; |
| 399 | EXTEND(SP, 1); |
| 400 | { |
| 401 | OP * const op = PL_op; |
| 402 | /* access PL_curpad once */ |
| 403 | SV ** const padentry = &(PAD_SVl(op->op_targ)); |
| 404 | { |
| 405 | dTARG; |
| 406 | TARG = *padentry; |
| 407 | PUSHs(TARG); |
| 408 | PUTBACK; /* no pop/push after this, TOPs ok */ |
| 409 | } |
| 410 | if (op->op_flags & OPf_MOD) { |
| 411 | if (op->op_private & OPpLVAL_INTRO) |
| 412 | if (!(op->op_private & OPpPAD_STATE)) |
| 413 | save_clearsv(padentry); |
| 414 | if (op->op_private & OPpDEREF) { |
| 415 | /* TOPs is equivalent to TARG here. Using TOPs (SP) rather |
| 416 | than TARG reduces the scope of TARG, so it does not |
| 417 | span the call to save_clearsv, resulting in smaller |
| 418 | machine code. */ |
| 419 | TOPs = vivify_ref(TOPs, op->op_private & OPpDEREF); |
| 420 | } |
| 421 | } |
| 422 | return op->op_next; |
| 423 | } |
| 424 | } |
| 425 | |
| 426 | PP(pp_readline) |
| 427 | { |
| 428 | dVAR; |
| 429 | dSP; |
| 430 | if (TOPs) { |
| 431 | SvGETMAGIC(TOPs); |
| 432 | tryAMAGICunTARGETlist(iter_amg, 0); |
| 433 | PL_last_in_gv = MUTABLE_GV(*PL_stack_sp--); |
| 434 | } |
| 435 | else PL_last_in_gv = PL_argvgv, PL_stack_sp--; |
| 436 | if (!isGV_with_GP(PL_last_in_gv)) { |
| 437 | if (SvROK(PL_last_in_gv) && isGV_with_GP(SvRV(PL_last_in_gv))) |
| 438 | PL_last_in_gv = MUTABLE_GV(SvRV(PL_last_in_gv)); |
| 439 | else { |
| 440 | dSP; |
| 441 | XPUSHs(MUTABLE_SV(PL_last_in_gv)); |
| 442 | PUTBACK; |
| 443 | Perl_pp_rv2gv(aTHX); |
| 444 | PL_last_in_gv = MUTABLE_GV(*PL_stack_sp--); |
| 445 | } |
| 446 | } |
| 447 | return do_readline(); |
| 448 | } |
| 449 | |
| 450 | PP(pp_eq) |
| 451 | { |
| 452 | dVAR; dSP; |
| 453 | SV *left, *right; |
| 454 | |
| 455 | tryAMAGICbin_MG(eq_amg, AMGf_set|AMGf_numeric); |
| 456 | right = POPs; |
| 457 | left = TOPs; |
| 458 | SETs(boolSV( |
| 459 | (SvIOK_notUV(left) && SvIOK_notUV(right)) |
| 460 | ? (SvIVX(left) == SvIVX(right)) |
| 461 | : ( do_ncmp(left, right) == 0) |
| 462 | )); |
| 463 | RETURN; |
| 464 | } |
| 465 | |
| 466 | PP(pp_preinc) |
| 467 | { |
| 468 | dVAR; dSP; |
| 469 | const bool inc = |
| 470 | PL_op->op_type == OP_PREINC || PL_op->op_type == OP_I_PREINC; |
| 471 | if (SvTYPE(TOPs) >= SVt_PVAV || (isGV_with_GP(TOPs) && !SvFAKE(TOPs))) |
| 472 | Perl_croak_no_modify(); |
| 473 | if (!SvREADONLY(TOPs) && !SvGMAGICAL(TOPs) && SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) |
| 474 | && SvIVX(TOPs) != (inc ? IV_MAX : IV_MIN)) |
| 475 | { |
| 476 | SvIV_set(TOPs, SvIVX(TOPs) + (inc ? 1 : -1)); |
| 477 | SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK); |
| 478 | } |
| 479 | else /* Do all the PERL_PRESERVE_IVUV conditionals in sv_inc */ |
| 480 | if (inc) sv_inc(TOPs); |
| 481 | else sv_dec(TOPs); |
| 482 | SvSETMAGIC(TOPs); |
| 483 | return NORMAL; |
| 484 | } |
| 485 | |
| 486 | PP(pp_or) |
| 487 | { |
| 488 | dVAR; dSP; |
| 489 | PERL_ASYNC_CHECK(); |
| 490 | if (SvTRUE(TOPs)) |
| 491 | RETURN; |
| 492 | else { |
| 493 | if (PL_op->op_type == OP_OR) |
| 494 | --SP; |
| 495 | RETURNOP(cLOGOP->op_other); |
| 496 | } |
| 497 | } |
| 498 | |
| 499 | PP(pp_defined) |
| 500 | { |
| 501 | dVAR; dSP; |
| 502 | SV* sv; |
| 503 | bool defined; |
| 504 | const int op_type = PL_op->op_type; |
| 505 | const bool is_dor = (op_type == OP_DOR || op_type == OP_DORASSIGN); |
| 506 | |
| 507 | if (is_dor) { |
| 508 | PERL_ASYNC_CHECK(); |
| 509 | sv = TOPs; |
| 510 | if (!sv || !SvANY(sv)) { |
| 511 | if (op_type == OP_DOR) |
| 512 | --SP; |
| 513 | RETURNOP(cLOGOP->op_other); |
| 514 | } |
| 515 | } |
| 516 | else { |
| 517 | /* OP_DEFINED */ |
| 518 | sv = POPs; |
| 519 | if (!sv || !SvANY(sv)) |
| 520 | RETPUSHNO; |
| 521 | } |
| 522 | |
| 523 | defined = FALSE; |
| 524 | switch (SvTYPE(sv)) { |
| 525 | case SVt_PVAV: |
| 526 | if (AvMAX(sv) >= 0 || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied))) |
| 527 | defined = TRUE; |
| 528 | break; |
| 529 | case SVt_PVHV: |
| 530 | if (HvARRAY(sv) || SvGMAGICAL(sv) || (SvRMAGICAL(sv) && mg_find(sv, PERL_MAGIC_tied))) |
| 531 | defined = TRUE; |
| 532 | break; |
| 533 | case SVt_PVCV: |
| 534 | if (CvROOT(sv) || CvXSUB(sv)) |
| 535 | defined = TRUE; |
| 536 | break; |
| 537 | default: |
| 538 | SvGETMAGIC(sv); |
| 539 | if (SvOK(sv)) |
| 540 | defined = TRUE; |
| 541 | break; |
| 542 | } |
| 543 | |
| 544 | if (is_dor) { |
| 545 | if(defined) |
| 546 | RETURN; |
| 547 | if(op_type == OP_DOR) |
| 548 | --SP; |
| 549 | RETURNOP(cLOGOP->op_other); |
| 550 | } |
| 551 | /* assuming OP_DEFINED */ |
| 552 | if(defined) |
| 553 | RETPUSHYES; |
| 554 | RETPUSHNO; |
| 555 | } |
| 556 | |
| 557 | PP(pp_add) |
| 558 | { |
| 559 | dVAR; dSP; dATARGET; bool useleft; SV *svl, *svr; |
| 560 | tryAMAGICbin_MG(add_amg, AMGf_assign|AMGf_numeric); |
| 561 | svr = TOPs; |
| 562 | svl = TOPm1s; |
| 563 | |
| 564 | useleft = USE_LEFT(svl); |
| 565 | #ifdef PERL_PRESERVE_IVUV |
| 566 | /* We must see if we can perform the addition with integers if possible, |
| 567 | as the integer code detects overflow while the NV code doesn't. |
| 568 | If either argument hasn't had a numeric conversion yet attempt to get |
| 569 | the IV. It's important to do this now, rather than just assuming that |
| 570 | it's not IOK as a PV of "9223372036854775806" may not take well to NV |
| 571 | addition, and an SV which is NOK, NV=6.0 ought to be coerced to |
| 572 | integer in case the second argument is IV=9223372036854775806 |
| 573 | We can (now) rely on sv_2iv to do the right thing, only setting the |
| 574 | public IOK flag if the value in the NV (or PV) slot is truly integer. |
| 575 | |
| 576 | A side effect is that this also aggressively prefers integer maths over |
| 577 | fp maths for integer values. |
| 578 | |
| 579 | How to detect overflow? |
| 580 | |
| 581 | C 99 section 6.2.6.1 says |
| 582 | |
| 583 | The range of nonnegative values of a signed integer type is a subrange |
| 584 | of the corresponding unsigned integer type, and the representation of |
| 585 | the same value in each type is the same. A computation involving |
| 586 | unsigned operands can never overflow, because a result that cannot be |
| 587 | represented by the resulting unsigned integer type is reduced modulo |
| 588 | the number that is one greater than the largest value that can be |
| 589 | represented by the resulting type. |
| 590 | |
| 591 | (the 9th paragraph) |
| 592 | |
| 593 | which I read as "unsigned ints wrap." |
| 594 | |
| 595 | signed integer overflow seems to be classed as "exception condition" |
| 596 | |
| 597 | If an exceptional condition occurs during the evaluation of an |
| 598 | expression (that is, if the result is not mathematically defined or not |
| 599 | in the range of representable values for its type), the behavior is |
| 600 | undefined. |
| 601 | |
| 602 | (6.5, the 5th paragraph) |
| 603 | |
| 604 | I had assumed that on 2s complement machines signed arithmetic would |
| 605 | wrap, hence coded pp_add and pp_subtract on the assumption that |
| 606 | everything perl builds on would be happy. After much wailing and |
| 607 | gnashing of teeth it would seem that irix64 knows its ANSI spec well, |
| 608 | knows that it doesn't need to, and doesn't. Bah. Anyway, the all- |
| 609 | unsigned code below is actually shorter than the old code. :-) |
| 610 | */ |
| 611 | |
| 612 | if (SvIV_please_nomg(svr)) { |
| 613 | /* Unless the left argument is integer in range we are going to have to |
| 614 | use NV maths. Hence only attempt to coerce the right argument if |
| 615 | we know the left is integer. */ |
| 616 | UV auv = 0; |
| 617 | bool auvok = FALSE; |
| 618 | bool a_valid = 0; |
| 619 | |
| 620 | if (!useleft) { |
| 621 | auv = 0; |
| 622 | a_valid = auvok = 1; |
| 623 | /* left operand is undef, treat as zero. + 0 is identity, |
| 624 | Could SETi or SETu right now, but space optimise by not adding |
| 625 | lots of code to speed up what is probably a rarish case. */ |
| 626 | } else { |
| 627 | /* Left operand is defined, so is it IV? */ |
| 628 | if (SvIV_please_nomg(svl)) { |
| 629 | if ((auvok = SvUOK(svl))) |
| 630 | auv = SvUVX(svl); |
| 631 | else { |
| 632 | const IV aiv = SvIVX(svl); |
| 633 | if (aiv >= 0) { |
| 634 | auv = aiv; |
| 635 | auvok = 1; /* Now acting as a sign flag. */ |
| 636 | } else { /* 2s complement assumption for IV_MIN */ |
| 637 | auv = (UV)-aiv; |
| 638 | } |
| 639 | } |
| 640 | a_valid = 1; |
| 641 | } |
| 642 | } |
| 643 | if (a_valid) { |
| 644 | bool result_good = 0; |
| 645 | UV result; |
| 646 | UV buv; |
| 647 | bool buvok = SvUOK(svr); |
| 648 | |
| 649 | if (buvok) |
| 650 | buv = SvUVX(svr); |
| 651 | else { |
| 652 | const IV biv = SvIVX(svr); |
| 653 | if (biv >= 0) { |
| 654 | buv = biv; |
| 655 | buvok = 1; |
| 656 | } else |
| 657 | buv = (UV)-biv; |
| 658 | } |
| 659 | /* ?uvok if value is >= 0. basically, flagged as UV if it's +ve, |
| 660 | else "IV" now, independent of how it came in. |
| 661 | if a, b represents positive, A, B negative, a maps to -A etc |
| 662 | a + b => (a + b) |
| 663 | A + b => -(a - b) |
| 664 | a + B => (a - b) |
| 665 | A + B => -(a + b) |
| 666 | all UV maths. negate result if A negative. |
| 667 | add if signs same, subtract if signs differ. */ |
| 668 | |
| 669 | if (auvok ^ buvok) { |
| 670 | /* Signs differ. */ |
| 671 | if (auv >= buv) { |
| 672 | result = auv - buv; |
| 673 | /* Must get smaller */ |
| 674 | if (result <= auv) |
| 675 | result_good = 1; |
| 676 | } else { |
| 677 | result = buv - auv; |
| 678 | if (result <= buv) { |
| 679 | /* result really should be -(auv-buv). as its negation |
| 680 | of true value, need to swap our result flag */ |
| 681 | auvok = !auvok; |
| 682 | result_good = 1; |
| 683 | } |
| 684 | } |
| 685 | } else { |
| 686 | /* Signs same */ |
| 687 | result = auv + buv; |
| 688 | if (result >= auv) |
| 689 | result_good = 1; |
| 690 | } |
| 691 | if (result_good) { |
| 692 | SP--; |
| 693 | if (auvok) |
| 694 | SETu( result ); |
| 695 | else { |
| 696 | /* Negate result */ |
| 697 | if (result <= (UV)IV_MIN) |
| 698 | SETi( -(IV)result ); |
| 699 | else { |
| 700 | /* result valid, but out of range for IV. */ |
| 701 | SETn( -(NV)result ); |
| 702 | } |
| 703 | } |
| 704 | RETURN; |
| 705 | } /* Overflow, drop through to NVs. */ |
| 706 | } |
| 707 | } |
| 708 | #endif |
| 709 | { |
| 710 | NV value = SvNV_nomg(svr); |
| 711 | (void)POPs; |
| 712 | if (!useleft) { |
| 713 | /* left operand is undef, treat as zero. + 0.0 is identity. */ |
| 714 | SETn(value); |
| 715 | RETURN; |
| 716 | } |
| 717 | SETn( value + SvNV_nomg(svl) ); |
| 718 | RETURN; |
| 719 | } |
| 720 | } |
| 721 | |
| 722 | PP(pp_aelemfast) |
| 723 | { |
| 724 | dVAR; dSP; |
| 725 | AV * const av = PL_op->op_type == OP_AELEMFAST_LEX |
| 726 | ? MUTABLE_AV(PAD_SV(PL_op->op_targ)) : GvAVn(cGVOP_gv); |
| 727 | const U32 lval = PL_op->op_flags & OPf_MOD; |
| 728 | SV** const svp = av_fetch(av, PL_op->op_private, lval); |
| 729 | SV *sv = (svp ? *svp : &PL_sv_undef); |
| 730 | EXTEND(SP, 1); |
| 731 | if (!lval && SvRMAGICAL(av) && SvGMAGICAL(sv)) /* see note in pp_helem() */ |
| 732 | mg_get(sv); |
| 733 | PUSHs(sv); |
| 734 | RETURN; |
| 735 | } |
| 736 | |
| 737 | PP(pp_join) |
| 738 | { |
| 739 | dVAR; dSP; dMARK; dTARGET; |
| 740 | MARK++; |
| 741 | do_join(TARG, *MARK, MARK, SP); |
| 742 | SP = MARK; |
| 743 | SETs(TARG); |
| 744 | RETURN; |
| 745 | } |
| 746 | |
| 747 | PP(pp_pushre) |
| 748 | { |
| 749 | dVAR; dSP; |
| 750 | #ifdef DEBUGGING |
| 751 | /* |
| 752 | * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs |
| 753 | * will be enough to hold an OP*. |
| 754 | */ |
| 755 | SV* const sv = sv_newmortal(); |
| 756 | sv_upgrade(sv, SVt_PVLV); |
| 757 | LvTYPE(sv) = '/'; |
| 758 | Copy(&PL_op, &LvTARGOFF(sv), 1, OP*); |
| 759 | XPUSHs(sv); |
| 760 | #else |
| 761 | XPUSHs(MUTABLE_SV(PL_op)); |
| 762 | #endif |
| 763 | RETURN; |
| 764 | } |
| 765 | |
| 766 | /* Oversized hot code. */ |
| 767 | |
| 768 | PP(pp_print) |
| 769 | { |
| 770 | dVAR; dSP; dMARK; dORIGMARK; |
| 771 | PerlIO *fp; |
| 772 | MAGIC *mg; |
| 773 | GV * const gv |
| 774 | = (PL_op->op_flags & OPf_STACKED) ? MUTABLE_GV(*++MARK) : PL_defoutgv; |
| 775 | IO *io = GvIO(gv); |
| 776 | |
| 777 | if (io |
| 778 | && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar))) |
| 779 | { |
| 780 | had_magic: |
| 781 | if (MARK == ORIGMARK) { |
| 782 | /* If using default handle then we need to make space to |
| 783 | * pass object as 1st arg, so move other args up ... |
| 784 | */ |
| 785 | MEXTEND(SP, 1); |
| 786 | ++MARK; |
| 787 | Move(MARK, MARK + 1, (SP - MARK) + 1, SV*); |
| 788 | ++SP; |
| 789 | } |
| 790 | return Perl_tied_method(aTHX_ SV_CONST(PRINT), mark - 1, MUTABLE_SV(io), |
| 791 | mg, |
| 792 | (G_SCALAR | TIED_METHOD_ARGUMENTS_ON_STACK |
| 793 | | (PL_op->op_type == OP_SAY |
| 794 | ? TIED_METHOD_SAY : 0)), sp - mark); |
| 795 | } |
| 796 | if (!io) { |
| 797 | if ( gv && GvEGVx(gv) && (io = GvIO(GvEGV(gv))) |
| 798 | && (mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar))) |
| 799 | goto had_magic; |
| 800 | report_evil_fh(gv); |
| 801 | SETERRNO(EBADF,RMS_IFI); |
| 802 | goto just_say_no; |
| 803 | } |
| 804 | else if (!(fp = IoOFP(io))) { |
| 805 | if (IoIFP(io)) |
| 806 | report_wrongway_fh(gv, '<'); |
| 807 | else |
| 808 | report_evil_fh(gv); |
| 809 | SETERRNO(EBADF,IoIFP(io)?RMS_FAC:RMS_IFI); |
| 810 | goto just_say_no; |
| 811 | } |
| 812 | else { |
| 813 | SV * const ofs = GvSV(PL_ofsgv); /* $, */ |
| 814 | MARK++; |
| 815 | if (ofs && (SvGMAGICAL(ofs) || SvOK(ofs))) { |
| 816 | while (MARK <= SP) { |
| 817 | if (!do_print(*MARK, fp)) |
| 818 | break; |
| 819 | MARK++; |
| 820 | if (MARK <= SP) { |
| 821 | /* don't use 'ofs' here - it may be invalidated by magic callbacks */ |
| 822 | if (!do_print(GvSV(PL_ofsgv), fp)) { |
| 823 | MARK--; |
| 824 | break; |
| 825 | } |
| 826 | } |
| 827 | } |
| 828 | } |
| 829 | else { |
| 830 | while (MARK <= SP) { |
| 831 | if (!do_print(*MARK, fp)) |
| 832 | break; |
| 833 | MARK++; |
| 834 | } |
| 835 | } |
| 836 | if (MARK <= SP) |
| 837 | goto just_say_no; |
| 838 | else { |
| 839 | if (PL_op->op_type == OP_SAY) { |
| 840 | if (PerlIO_write(fp, "\n", 1) == 0 || PerlIO_error(fp)) |
| 841 | goto just_say_no; |
| 842 | } |
| 843 | else if (PL_ors_sv && SvOK(PL_ors_sv)) |
| 844 | if (!do_print(PL_ors_sv, fp)) /* $\ */ |
| 845 | goto just_say_no; |
| 846 | |
| 847 | if (IoFLAGS(io) & IOf_FLUSH) |
| 848 | if (PerlIO_flush(fp) == EOF) |
| 849 | goto just_say_no; |
| 850 | } |
| 851 | } |
| 852 | SP = ORIGMARK; |
| 853 | XPUSHs(&PL_sv_yes); |
| 854 | RETURN; |
| 855 | |
| 856 | just_say_no: |
| 857 | SP = ORIGMARK; |
| 858 | XPUSHs(&PL_sv_undef); |
| 859 | RETURN; |
| 860 | } |
| 861 | |
| 862 | PP(pp_rv2av) |
| 863 | { |
| 864 | dVAR; dSP; dTOPss; |
| 865 | const I32 gimme = GIMME_V; |
| 866 | static const char an_array[] = "an ARRAY"; |
| 867 | static const char a_hash[] = "a HASH"; |
| 868 | const bool is_pp_rv2av = PL_op->op_type == OP_RV2AV; |
| 869 | const svtype type = is_pp_rv2av ? SVt_PVAV : SVt_PVHV; |
| 870 | |
| 871 | SvGETMAGIC(sv); |
| 872 | if (SvROK(sv)) { |
| 873 | if (SvAMAGIC(sv)) { |
| 874 | sv = amagic_deref_call(sv, is_pp_rv2av ? to_av_amg : to_hv_amg); |
| 875 | } |
| 876 | sv = SvRV(sv); |
| 877 | if (SvTYPE(sv) != type) |
| 878 | /* diag_listed_as: Not an ARRAY reference */ |
| 879 | DIE(aTHX_ "Not %s reference", is_pp_rv2av ? an_array : a_hash); |
| 880 | else if (PL_op->op_flags & OPf_MOD |
| 881 | && PL_op->op_private & OPpLVAL_INTRO) |
| 882 | Perl_croak(aTHX_ "%s", PL_no_localize_ref); |
| 883 | } |
| 884 | else if (SvTYPE(sv) != type) { |
| 885 | GV *gv; |
| 886 | |
| 887 | if (!isGV_with_GP(sv)) { |
| 888 | gv = Perl_softref2xv(aTHX_ sv, is_pp_rv2av ? an_array : a_hash, |
| 889 | type, &sp); |
| 890 | if (!gv) |
| 891 | RETURN; |
| 892 | } |
| 893 | else { |
| 894 | gv = MUTABLE_GV(sv); |
| 895 | } |
| 896 | sv = is_pp_rv2av ? MUTABLE_SV(GvAVn(gv)) : MUTABLE_SV(GvHVn(gv)); |
| 897 | if (PL_op->op_private & OPpLVAL_INTRO) |
| 898 | sv = is_pp_rv2av ? MUTABLE_SV(save_ary(gv)) : MUTABLE_SV(save_hash(gv)); |
| 899 | } |
| 900 | if (PL_op->op_flags & OPf_REF) { |
| 901 | SETs(sv); |
| 902 | RETURN; |
| 903 | } |
| 904 | else if (PL_op->op_private & OPpMAYBE_LVSUB) { |
| 905 | const I32 flags = is_lvalue_sub(); |
| 906 | if (flags && !(flags & OPpENTERSUB_INARGS)) { |
| 907 | if (gimme != G_ARRAY) |
| 908 | goto croak_cant_return; |
| 909 | SETs(sv); |
| 910 | RETURN; |
| 911 | } |
| 912 | } |
| 913 | |
| 914 | if (is_pp_rv2av) { |
| 915 | AV *const av = MUTABLE_AV(sv); |
| 916 | /* The guts of pp_rv2av, with no intending change to preserve history |
| 917 | (until such time as we get tools that can do blame annotation across |
| 918 | whitespace changes. */ |
| 919 | if (gimme == G_ARRAY) { |
| 920 | SP--; |
| 921 | PUTBACK; |
| 922 | S_pushav(aTHX_ av); |
| 923 | SPAGAIN; |
| 924 | } |
| 925 | else if (gimme == G_SCALAR) { |
| 926 | dTARGET; |
| 927 | const SSize_t maxarg = AvFILL(av) + 1; |
| 928 | SETi(maxarg); |
| 929 | } |
| 930 | } else { |
| 931 | /* The guts of pp_rv2hv */ |
| 932 | if (gimme == G_ARRAY) { /* array wanted */ |
| 933 | *PL_stack_sp = sv; |
| 934 | return Perl_do_kv(aTHX); |
| 935 | } |
| 936 | else if ((PL_op->op_private & OPpTRUEBOOL |
| 937 | || ( PL_op->op_private & OPpMAYBE_TRUEBOOL |
| 938 | && block_gimme() == G_VOID )) |
| 939 | && (!SvRMAGICAL(sv) || !mg_find(sv, PERL_MAGIC_tied))) |
| 940 | SETs(HvUSEDKEYS(sv) ? &PL_sv_yes : sv_2mortal(newSViv(0))); |
| 941 | else if (gimme == G_SCALAR) { |
| 942 | dTARGET; |
| 943 | TARG = Perl_hv_scalar(aTHX_ MUTABLE_HV(sv)); |
| 944 | SPAGAIN; |
| 945 | SETTARG; |
| 946 | } |
| 947 | } |
| 948 | RETURN; |
| 949 | |
| 950 | croak_cant_return: |
| 951 | Perl_croak(aTHX_ "Can't return %s to lvalue scalar context", |
| 952 | is_pp_rv2av ? "array" : "hash"); |
| 953 | RETURN; |
| 954 | } |
| 955 | |
| 956 | STATIC void |
| 957 | S_do_oddball(pTHX_ SV **oddkey, SV **firstkey) |
| 958 | { |
| 959 | dVAR; |
| 960 | |
| 961 | PERL_ARGS_ASSERT_DO_ODDBALL; |
| 962 | |
| 963 | if (*oddkey) { |
| 964 | if (ckWARN(WARN_MISC)) { |
| 965 | const char *err; |
| 966 | if (oddkey == firstkey && |
| 967 | SvROK(*oddkey) && |
| 968 | (SvTYPE(SvRV(*oddkey)) == SVt_PVAV || |
| 969 | SvTYPE(SvRV(*oddkey)) == SVt_PVHV)) |
| 970 | { |
| 971 | err = "Reference found where even-sized list expected"; |
| 972 | } |
| 973 | else |
| 974 | err = "Odd number of elements in hash assignment"; |
| 975 | Perl_warner(aTHX_ packWARN(WARN_MISC), "%s", err); |
| 976 | } |
| 977 | |
| 978 | } |
| 979 | } |
| 980 | |
| 981 | PP(pp_aassign) |
| 982 | { |
| 983 | dVAR; dSP; |
| 984 | SV **lastlelem = PL_stack_sp; |
| 985 | SV **lastrelem = PL_stack_base + POPMARK; |
| 986 | SV **firstrelem = PL_stack_base + POPMARK + 1; |
| 987 | SV **firstlelem = lastrelem + 1; |
| 988 | |
| 989 | SV **relem; |
| 990 | SV **lelem; |
| 991 | |
| 992 | SV *sv; |
| 993 | AV *ary; |
| 994 | |
| 995 | I32 gimme; |
| 996 | HV *hash; |
| 997 | SSize_t i; |
| 998 | int magic; |
| 999 | U32 lval = 0; |
| 1000 | |
| 1001 | PL_delaymagic = DM_DELAY; /* catch simultaneous items */ |
| 1002 | gimme = GIMME_V; |
| 1003 | if (gimme == G_ARRAY) |
| 1004 | lval = PL_op->op_flags & OPf_MOD || LVRET; |
| 1005 | |
| 1006 | /* If there's a common identifier on both sides we have to take |
| 1007 | * special care that assigning the identifier on the left doesn't |
| 1008 | * clobber a value on the right that's used later in the list. |
| 1009 | * Don't bother if LHS is just an empty hash or array. |
| 1010 | */ |
| 1011 | |
| 1012 | if ( (PL_op->op_private & OPpASSIGN_COMMON) |
| 1013 | && ( |
| 1014 | firstlelem != lastlelem |
| 1015 | || ! ((sv = *firstlelem)) |
| 1016 | || SvMAGICAL(sv) |
| 1017 | || ! (SvTYPE(sv) == SVt_PVAV || SvTYPE(sv) == SVt_PVHV) |
| 1018 | || (SvTYPE(sv) == SVt_PVAV && AvFILL((AV*)sv) != -1) |
| 1019 | || (SvTYPE(sv) == SVt_PVHV && HvUSEDKEYS((HV*)sv) != 0) |
| 1020 | ) |
| 1021 | ) { |
| 1022 | EXTEND_MORTAL(lastrelem - firstrelem + 1); |
| 1023 | for (relem = firstrelem; relem <= lastrelem; relem++) { |
| 1024 | if ((sv = *relem)) { |
| 1025 | TAINT_NOT; /* Each item is independent */ |
| 1026 | |
| 1027 | /* Dear TODO test in t/op/sort.t, I love you. |
| 1028 | (It's relying on a panic, not a "semi-panic" from newSVsv() |
| 1029 | and then an assertion failure below.) */ |
| 1030 | if (SvIS_FREED(sv)) { |
| 1031 | Perl_croak(aTHX_ "panic: attempt to copy freed scalar %p", |
| 1032 | (void*)sv); |
| 1033 | } |
| 1034 | /* Not newSVsv(), as it does not allow copy-on-write, |
| 1035 | resulting in wasteful copies. We need a second copy of |
| 1036 | a temp here, hence the SV_NOSTEAL. */ |
| 1037 | *relem = sv_mortalcopy_flags(sv,SV_GMAGIC|SV_DO_COW_SVSETSV |
| 1038 | |SV_NOSTEAL); |
| 1039 | } |
| 1040 | } |
| 1041 | } |
| 1042 | |
| 1043 | relem = firstrelem; |
| 1044 | lelem = firstlelem; |
| 1045 | ary = NULL; |
| 1046 | hash = NULL; |
| 1047 | |
| 1048 | while (lelem <= lastlelem) { |
| 1049 | TAINT_NOT; /* Each item stands on its own, taintwise. */ |
| 1050 | sv = *lelem++; |
| 1051 | switch (SvTYPE(sv)) { |
| 1052 | case SVt_PVAV: |
| 1053 | ary = MUTABLE_AV(sv); |
| 1054 | magic = SvMAGICAL(ary) != 0; |
| 1055 | ENTER; |
| 1056 | SAVEFREESV(SvREFCNT_inc_simple_NN(sv)); |
| 1057 | av_clear(ary); |
| 1058 | av_extend(ary, lastrelem - relem); |
| 1059 | i = 0; |
| 1060 | while (relem <= lastrelem) { /* gobble up all the rest */ |
| 1061 | SV **didstore; |
| 1062 | if (*relem) |
| 1063 | SvGETMAGIC(*relem); /* before newSV, in case it dies */ |
| 1064 | sv = newSV(0); |
| 1065 | sv_setsv_nomg(sv, *relem); |
| 1066 | *(relem++) = sv; |
| 1067 | didstore = av_store(ary,i++,sv); |
| 1068 | if (magic) { |
| 1069 | if (!didstore) |
| 1070 | sv_2mortal(sv); |
| 1071 | if (SvSMAGICAL(sv)) |
| 1072 | mg_set(sv); |
| 1073 | } |
| 1074 | TAINT_NOT; |
| 1075 | } |
| 1076 | if (PL_delaymagic & DM_ARRAY_ISA) |
| 1077 | SvSETMAGIC(MUTABLE_SV(ary)); |
| 1078 | LEAVE; |
| 1079 | break; |
| 1080 | case SVt_PVHV: { /* normal hash */ |
| 1081 | SV *tmpstr; |
| 1082 | int odd; |
| 1083 | int duplicates = 0; |
| 1084 | SV** topelem = relem; |
| 1085 | SV **firsthashrelem = relem; |
| 1086 | |
| 1087 | hash = MUTABLE_HV(sv); |
| 1088 | magic = SvMAGICAL(hash) != 0; |
| 1089 | |
| 1090 | odd = ((lastrelem - firsthashrelem)&1)? 0 : 1; |
| 1091 | if ( odd ) { |
| 1092 | do_oddball(lastrelem, firsthashrelem); |
| 1093 | /* we have firstlelem to reuse, it's not needed anymore |
| 1094 | */ |
| 1095 | *(lastrelem+1) = &PL_sv_undef; |
| 1096 | } |
| 1097 | |
| 1098 | ENTER; |
| 1099 | SAVEFREESV(SvREFCNT_inc_simple_NN(sv)); |
| 1100 | hv_clear(hash); |
| 1101 | while (relem < lastrelem+odd) { /* gobble up all the rest */ |
| 1102 | HE *didstore; |
| 1103 | assert(*relem); |
| 1104 | /* Copy the key if aassign is called in lvalue context, |
| 1105 | to avoid having the next op modify our rhs. Copy |
| 1106 | it also if it is gmagical, lest it make the |
| 1107 | hv_store_ent call below croak, leaking the value. */ |
| 1108 | sv = lval || SvGMAGICAL(*relem) |
| 1109 | ? sv_mortalcopy(*relem) |
| 1110 | : *relem; |
| 1111 | relem++; |
| 1112 | assert(*relem); |
| 1113 | SvGETMAGIC(*relem); |
| 1114 | tmpstr = newSV(0); |
| 1115 | sv_setsv_nomg(tmpstr,*relem++); /* value */ |
| 1116 | if (gimme == G_ARRAY) { |
| 1117 | if (hv_exists_ent(hash, sv, 0)) |
| 1118 | /* key overwrites an existing entry */ |
| 1119 | duplicates += 2; |
| 1120 | else { |
| 1121 | /* copy element back: possibly to an earlier |
| 1122 | * stack location if we encountered dups earlier, |
| 1123 | * possibly to a later stack location if odd */ |
| 1124 | *topelem++ = sv; |
| 1125 | *topelem++ = tmpstr; |
| 1126 | } |
| 1127 | } |
| 1128 | didstore = hv_store_ent(hash,sv,tmpstr,0); |
| 1129 | if (magic) { |
| 1130 | if (!didstore) sv_2mortal(tmpstr); |
| 1131 | SvSETMAGIC(tmpstr); |
| 1132 | } |
| 1133 | TAINT_NOT; |
| 1134 | } |
| 1135 | LEAVE; |
| 1136 | if (duplicates && gimme == G_ARRAY) { |
| 1137 | /* at this point we have removed the duplicate key/value |
| 1138 | * pairs from the stack, but the remaining values may be |
| 1139 | * wrong; i.e. with (a 1 a 2 b 3) on the stack we've removed |
| 1140 | * the (a 2), but the stack now probably contains |
| 1141 | * (a <freed> b 3), because { hv_save(a,1); hv_save(a,2) } |
| 1142 | * obliterates the earlier key. So refresh all values. */ |
| 1143 | lastrelem -= duplicates; |
| 1144 | relem = firsthashrelem; |
| 1145 | while (relem < lastrelem+odd) { |
| 1146 | HE *he; |
| 1147 | he = hv_fetch_ent(hash, *relem++, 0, 0); |
| 1148 | *relem++ = (he ? HeVAL(he) : &PL_sv_undef); |
| 1149 | } |
| 1150 | } |
| 1151 | if (odd && gimme == G_ARRAY) lastrelem++; |
| 1152 | } |
| 1153 | break; |
| 1154 | default: |
| 1155 | if (SvIMMORTAL(sv)) { |
| 1156 | if (relem <= lastrelem) |
| 1157 | relem++; |
| 1158 | break; |
| 1159 | } |
| 1160 | if (relem <= lastrelem) { |
| 1161 | if ( |
| 1162 | SvTEMP(sv) && !SvSMAGICAL(sv) && SvREFCNT(sv) == 1 && |
| 1163 | (!isGV_with_GP(sv) || SvFAKE(sv)) && ckWARN(WARN_MISC) |
| 1164 | ) |
| 1165 | Perl_warner(aTHX_ |
| 1166 | packWARN(WARN_MISC), |
| 1167 | "Useless assignment to a temporary" |
| 1168 | ); |
| 1169 | sv_setsv(sv, *relem); |
| 1170 | *(relem++) = sv; |
| 1171 | } |
| 1172 | else |
| 1173 | sv_setsv(sv, &PL_sv_undef); |
| 1174 | SvSETMAGIC(sv); |
| 1175 | break; |
| 1176 | } |
| 1177 | } |
| 1178 | if (PL_delaymagic & ~DM_DELAY) { |
| 1179 | /* Will be used to set PL_tainting below */ |
| 1180 | Uid_t tmp_uid = PerlProc_getuid(); |
| 1181 | Uid_t tmp_euid = PerlProc_geteuid(); |
| 1182 | Gid_t tmp_gid = PerlProc_getgid(); |
| 1183 | Gid_t tmp_egid = PerlProc_getegid(); |
| 1184 | |
| 1185 | if (PL_delaymagic & DM_UID) { |
| 1186 | #ifdef HAS_SETRESUID |
| 1187 | (void)setresuid((PL_delaymagic & DM_RUID) ? PL_delaymagic_uid : (Uid_t)-1, |
| 1188 | (PL_delaymagic & DM_EUID) ? PL_delaymagic_euid : (Uid_t)-1, |
| 1189 | (Uid_t)-1); |
| 1190 | #else |
| 1191 | # ifdef HAS_SETREUID |
| 1192 | (void)setreuid((PL_delaymagic & DM_RUID) ? PL_delaymagic_uid : (Uid_t)-1, |
| 1193 | (PL_delaymagic & DM_EUID) ? PL_delaymagic_euid : (Uid_t)-1); |
| 1194 | # else |
| 1195 | # ifdef HAS_SETRUID |
| 1196 | if ((PL_delaymagic & DM_UID) == DM_RUID) { |
| 1197 | (void)setruid(PL_delaymagic_uid); |
| 1198 | PL_delaymagic &= ~DM_RUID; |
| 1199 | } |
| 1200 | # endif /* HAS_SETRUID */ |
| 1201 | # ifdef HAS_SETEUID |
| 1202 | if ((PL_delaymagic & DM_UID) == DM_EUID) { |
| 1203 | (void)seteuid(PL_delaymagic_euid); |
| 1204 | PL_delaymagic &= ~DM_EUID; |
| 1205 | } |
| 1206 | # endif /* HAS_SETEUID */ |
| 1207 | if (PL_delaymagic & DM_UID) { |
| 1208 | if (PL_delaymagic_uid != PL_delaymagic_euid) |
| 1209 | DIE(aTHX_ "No setreuid available"); |
| 1210 | (void)PerlProc_setuid(PL_delaymagic_uid); |
| 1211 | } |
| 1212 | # endif /* HAS_SETREUID */ |
| 1213 | #endif /* HAS_SETRESUID */ |
| 1214 | tmp_uid = PerlProc_getuid(); |
| 1215 | tmp_euid = PerlProc_geteuid(); |
| 1216 | } |
| 1217 | if (PL_delaymagic & DM_GID) { |
| 1218 | #ifdef HAS_SETRESGID |
| 1219 | (void)setresgid((PL_delaymagic & DM_RGID) ? PL_delaymagic_gid : (Gid_t)-1, |
| 1220 | (PL_delaymagic & DM_EGID) ? PL_delaymagic_egid : (Gid_t)-1, |
| 1221 | (Gid_t)-1); |
| 1222 | #else |
| 1223 | # ifdef HAS_SETREGID |
| 1224 | (void)setregid((PL_delaymagic & DM_RGID) ? PL_delaymagic_gid : (Gid_t)-1, |
| 1225 | (PL_delaymagic & DM_EGID) ? PL_delaymagic_egid : (Gid_t)-1); |
| 1226 | # else |
| 1227 | # ifdef HAS_SETRGID |
| 1228 | if ((PL_delaymagic & DM_GID) == DM_RGID) { |
| 1229 | (void)setrgid(PL_delaymagic_gid); |
| 1230 | PL_delaymagic &= ~DM_RGID; |
| 1231 | } |
| 1232 | # endif /* HAS_SETRGID */ |
| 1233 | # ifdef HAS_SETEGID |
| 1234 | if ((PL_delaymagic & DM_GID) == DM_EGID) { |
| 1235 | (void)setegid(PL_delaymagic_egid); |
| 1236 | PL_delaymagic &= ~DM_EGID; |
| 1237 | } |
| 1238 | # endif /* HAS_SETEGID */ |
| 1239 | if (PL_delaymagic & DM_GID) { |
| 1240 | if (PL_delaymagic_gid != PL_delaymagic_egid) |
| 1241 | DIE(aTHX_ "No setregid available"); |
| 1242 | (void)PerlProc_setgid(PL_delaymagic_gid); |
| 1243 | } |
| 1244 | # endif /* HAS_SETREGID */ |
| 1245 | #endif /* HAS_SETRESGID */ |
| 1246 | tmp_gid = PerlProc_getgid(); |
| 1247 | tmp_egid = PerlProc_getegid(); |
| 1248 | } |
| 1249 | TAINTING_set( TAINTING_get | (tmp_uid && (tmp_euid != tmp_uid || tmp_egid != tmp_gid)) ); |
| 1250 | #ifdef NO_TAINT_SUPPORT |
| 1251 | PERL_UNUSED_VAR(tmp_uid); |
| 1252 | PERL_UNUSED_VAR(tmp_euid); |
| 1253 | PERL_UNUSED_VAR(tmp_gid); |
| 1254 | PERL_UNUSED_VAR(tmp_egid); |
| 1255 | #endif |
| 1256 | } |
| 1257 | PL_delaymagic = 0; |
| 1258 | |
| 1259 | if (gimme == G_VOID) |
| 1260 | SP = firstrelem - 1; |
| 1261 | else if (gimme == G_SCALAR) { |
| 1262 | dTARGET; |
| 1263 | SP = firstrelem; |
| 1264 | SETi(lastrelem - firstrelem + 1); |
| 1265 | } |
| 1266 | else { |
| 1267 | if (ary || hash) |
| 1268 | /* note that in this case *firstlelem may have been overwritten |
| 1269 | by sv_undef in the odd hash case */ |
| 1270 | SP = lastrelem; |
| 1271 | else { |
| 1272 | SP = firstrelem + (lastlelem - firstlelem); |
| 1273 | lelem = firstlelem + (relem - firstrelem); |
| 1274 | while (relem <= SP) |
| 1275 | *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef; |
| 1276 | } |
| 1277 | } |
| 1278 | |
| 1279 | RETURN; |
| 1280 | } |
| 1281 | |
| 1282 | PP(pp_qr) |
| 1283 | { |
| 1284 | dVAR; dSP; |
| 1285 | PMOP * const pm = cPMOP; |
| 1286 | REGEXP * rx = PM_GETRE(pm); |
| 1287 | SV * const pkg = rx ? CALLREG_PACKAGE(rx) : NULL; |
| 1288 | SV * const rv = sv_newmortal(); |
| 1289 | CV **cvp; |
| 1290 | CV *cv; |
| 1291 | |
| 1292 | SvUPGRADE(rv, SVt_IV); |
| 1293 | /* For a subroutine describing itself as "This is a hacky workaround" I'm |
| 1294 | loathe to use it here, but it seems to be the right fix. Or close. |
| 1295 | The key part appears to be that it's essential for pp_qr to return a new |
| 1296 | object (SV), which implies that there needs to be an effective way to |
| 1297 | generate a new SV from the existing SV that is pre-compiled in the |
| 1298 | optree. */ |
| 1299 | SvRV_set(rv, MUTABLE_SV(reg_temp_copy(NULL, rx))); |
| 1300 | SvROK_on(rv); |
| 1301 | |
| 1302 | cvp = &( ReANY((REGEXP *)SvRV(rv))->qr_anoncv); |
| 1303 | if ((cv = *cvp) && CvCLONE(*cvp)) { |
| 1304 | *cvp = cv_clone(cv); |
| 1305 | SvREFCNT_dec_NN(cv); |
| 1306 | } |
| 1307 | |
| 1308 | if (pkg) { |
| 1309 | HV *const stash = gv_stashsv(pkg, GV_ADD); |
| 1310 | SvREFCNT_dec_NN(pkg); |
| 1311 | (void)sv_bless(rv, stash); |
| 1312 | } |
| 1313 | |
| 1314 | if (RX_ISTAINTED(rx)) { |
| 1315 | SvTAINTED_on(rv); |
| 1316 | SvTAINTED_on(SvRV(rv)); |
| 1317 | } |
| 1318 | XPUSHs(rv); |
| 1319 | RETURN; |
| 1320 | } |
| 1321 | |
| 1322 | PP(pp_match) |
| 1323 | { |
| 1324 | dVAR; dSP; dTARG; |
| 1325 | PMOP *pm = cPMOP; |
| 1326 | PMOP *dynpm = pm; |
| 1327 | const char *s; |
| 1328 | const char *strend; |
| 1329 | SSize_t curpos = 0; /* initial pos() or current $+[0] */ |
| 1330 | I32 global; |
| 1331 | U8 r_flags = 0; |
| 1332 | const char *truebase; /* Start of string */ |
| 1333 | REGEXP *rx = PM_GETRE(pm); |
| 1334 | bool rxtainted; |
| 1335 | const I32 gimme = GIMME; |
| 1336 | STRLEN len; |
| 1337 | const I32 oldsave = PL_savestack_ix; |
| 1338 | I32 had_zerolen = 0; |
| 1339 | MAGIC *mg = NULL; |
| 1340 | |
| 1341 | if (PL_op->op_flags & OPf_STACKED) |
| 1342 | TARG = POPs; |
| 1343 | else if (PL_op->op_private & OPpTARGET_MY) |
| 1344 | GETTARGET; |
| 1345 | else { |
| 1346 | TARG = DEFSV; |
| 1347 | EXTEND(SP,1); |
| 1348 | } |
| 1349 | |
| 1350 | PUTBACK; /* EVAL blocks need stack_sp. */ |
| 1351 | /* Skip get-magic if this is a qr// clone, because regcomp has |
| 1352 | already done it. */ |
| 1353 | truebase = ReANY(rx)->mother_re |
| 1354 | ? SvPV_nomg_const(TARG, len) |
| 1355 | : SvPV_const(TARG, len); |
| 1356 | if (!truebase) |
| 1357 | DIE(aTHX_ "panic: pp_match"); |
| 1358 | strend = truebase + len; |
| 1359 | rxtainted = (RX_ISTAINTED(rx) || |
| 1360 | (TAINT_get && (pm->op_pmflags & PMf_RETAINT))); |
| 1361 | TAINT_NOT; |
| 1362 | |
| 1363 | /* We need to know this in case we fail out early - pos() must be reset */ |
| 1364 | global = dynpm->op_pmflags & PMf_GLOBAL; |
| 1365 | |
| 1366 | /* PMdf_USED is set after a ?? matches once */ |
| 1367 | if ( |
| 1368 | #ifdef USE_ITHREADS |
| 1369 | SvREADONLY(PL_regex_pad[pm->op_pmoffset]) |
| 1370 | #else |
| 1371 | pm->op_pmflags & PMf_USED |
| 1372 | #endif |
| 1373 | ) { |
| 1374 | DEBUG_r(PerlIO_printf(Perl_debug_log, "?? already matched once")); |
| 1375 | goto nope; |
| 1376 | } |
| 1377 | |
| 1378 | /* empty pattern special-cased to use last successful pattern if |
| 1379 | possible, except for qr// */ |
| 1380 | if (!ReANY(rx)->mother_re && !RX_PRELEN(rx) |
| 1381 | && PL_curpm) { |
| 1382 | pm = PL_curpm; |
| 1383 | rx = PM_GETRE(pm); |
| 1384 | } |
| 1385 | |
| 1386 | if (RX_MINLEN(rx) >= 0 && (STRLEN)RX_MINLEN(rx) > len) { |
| 1387 | DEBUG_r(PerlIO_printf(Perl_debug_log, "String shorter than min possible regex match (%" |
| 1388 | UVuf" < %"IVdf")\n", |
| 1389 | (UV)len, (IV)RX_MINLEN(rx))); |
| 1390 | goto nope; |
| 1391 | } |
| 1392 | |
| 1393 | /* get pos() if //g */ |
| 1394 | if (global) { |
| 1395 | mg = mg_find_mglob(TARG); |
| 1396 | if (mg && mg->mg_len >= 0) { |
| 1397 | curpos = MgBYTEPOS(mg, TARG, truebase, len); |
| 1398 | /* last time pos() was set, it was zero-length match */ |
| 1399 | if (mg->mg_flags & MGf_MINMATCH) |
| 1400 | had_zerolen = 1; |
| 1401 | } |
| 1402 | } |
| 1403 | |
| 1404 | #ifdef PERL_SAWAMPERSAND |
| 1405 | if ( RX_NPARENS(rx) |
| 1406 | || PL_sawampersand |
| 1407 | || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY)) |
| 1408 | || (dynpm->op_pmflags & PMf_KEEPCOPY) |
| 1409 | ) |
| 1410 | #endif |
| 1411 | { |
| 1412 | r_flags |= (REXEC_COPY_STR|REXEC_COPY_SKIP_PRE); |
| 1413 | /* in @a =~ /(.)/g, we iterate multiple times, but copy the buffer |
| 1414 | * only on the first iteration. Therefore we need to copy $' as well |
| 1415 | * as $&, to make the rest of the string available for captures in |
| 1416 | * subsequent iterations */ |
| 1417 | if (! (global && gimme == G_ARRAY)) |
| 1418 | r_flags |= REXEC_COPY_SKIP_POST; |
| 1419 | }; |
| 1420 | #ifdef PERL_SAWAMPERSAND |
| 1421 | if (dynpm->op_pmflags & PMf_KEEPCOPY) |
| 1422 | /* handle KEEPCOPY in pmop but not rx, eg $r=qr/a/; /$r/p */ |
| 1423 | r_flags &= ~(REXEC_COPY_SKIP_PRE|REXEC_COPY_SKIP_POST); |
| 1424 | #endif |
| 1425 | |
| 1426 | s = truebase; |
| 1427 | |
| 1428 | play_it_again: |
| 1429 | if (global) |
| 1430 | s = truebase + curpos; |
| 1431 | |
| 1432 | if (!CALLREGEXEC(rx, (char*)s, (char *)strend, (char*)truebase, |
| 1433 | had_zerolen, TARG, NULL, r_flags)) |
| 1434 | goto nope; |
| 1435 | |
| 1436 | PL_curpm = pm; |
| 1437 | if (dynpm->op_pmflags & PMf_ONCE) |
| 1438 | #ifdef USE_ITHREADS |
| 1439 | SvREADONLY_on(PL_regex_pad[dynpm->op_pmoffset]); |
| 1440 | #else |
| 1441 | dynpm->op_pmflags |= PMf_USED; |
| 1442 | #endif |
| 1443 | |
| 1444 | if (rxtainted) |
| 1445 | RX_MATCH_TAINTED_on(rx); |
| 1446 | TAINT_IF(RX_MATCH_TAINTED(rx)); |
| 1447 | |
| 1448 | /* update pos */ |
| 1449 | |
| 1450 | if (global && (gimme != G_ARRAY || (dynpm->op_pmflags & PMf_CONTINUE))) { |
| 1451 | if (!mg) |
| 1452 | mg = sv_magicext_mglob(TARG); |
| 1453 | MgBYTEPOS_set(mg, TARG, truebase, RX_OFFS(rx)[0].end); |
| 1454 | if (RX_ZERO_LEN(rx)) |
| 1455 | mg->mg_flags |= MGf_MINMATCH; |
| 1456 | else |
| 1457 | mg->mg_flags &= ~MGf_MINMATCH; |
| 1458 | } |
| 1459 | |
| 1460 | if ((!RX_NPARENS(rx) && !global) || gimme != G_ARRAY) { |
| 1461 | LEAVE_SCOPE(oldsave); |
| 1462 | RETPUSHYES; |
| 1463 | } |
| 1464 | |
| 1465 | /* push captures on stack */ |
| 1466 | |
| 1467 | { |
| 1468 | const I32 nparens = RX_NPARENS(rx); |
| 1469 | I32 i = (global && !nparens) ? 1 : 0; |
| 1470 | |
| 1471 | SPAGAIN; /* EVAL blocks could move the stack. */ |
| 1472 | EXTEND(SP, nparens + i); |
| 1473 | EXTEND_MORTAL(nparens + i); |
| 1474 | for (i = !i; i <= nparens; i++) { |
| 1475 | PUSHs(sv_newmortal()); |
| 1476 | if ((RX_OFFS(rx)[i].start != -1) && RX_OFFS(rx)[i].end != -1 ) { |
| 1477 | const I32 len = RX_OFFS(rx)[i].end - RX_OFFS(rx)[i].start; |
| 1478 | const char * const s = RX_OFFS(rx)[i].start + truebase; |
| 1479 | if (RX_OFFS(rx)[i].end < 0 || RX_OFFS(rx)[i].start < 0 || |
| 1480 | len < 0 || len > strend - s) |
| 1481 | DIE(aTHX_ "panic: pp_match start/end pointers, i=%ld, " |
| 1482 | "start=%ld, end=%ld, s=%p, strend=%p, len=%"UVuf, |
| 1483 | (long) i, (long) RX_OFFS(rx)[i].start, |
| 1484 | (long)RX_OFFS(rx)[i].end, s, strend, (UV) len); |
| 1485 | sv_setpvn(*SP, s, len); |
| 1486 | if (DO_UTF8(TARG) && is_utf8_string((U8*)s, len)) |
| 1487 | SvUTF8_on(*SP); |
| 1488 | } |
| 1489 | } |
| 1490 | if (global) { |
| 1491 | curpos = (UV)RX_OFFS(rx)[0].end; |
| 1492 | had_zerolen = RX_ZERO_LEN(rx); |
| 1493 | PUTBACK; /* EVAL blocks may use stack */ |
| 1494 | r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST; |
| 1495 | goto play_it_again; |
| 1496 | } |
| 1497 | LEAVE_SCOPE(oldsave); |
| 1498 | RETURN; |
| 1499 | } |
| 1500 | /* NOTREACHED */ |
| 1501 | |
| 1502 | nope: |
| 1503 | if (global && !(dynpm->op_pmflags & PMf_CONTINUE)) { |
| 1504 | if (!mg) |
| 1505 | mg = mg_find_mglob(TARG); |
| 1506 | if (mg) |
| 1507 | mg->mg_len = -1; |
| 1508 | } |
| 1509 | LEAVE_SCOPE(oldsave); |
| 1510 | if (gimme == G_ARRAY) |
| 1511 | RETURN; |
| 1512 | RETPUSHNO; |
| 1513 | } |
| 1514 | |
| 1515 | OP * |
| 1516 | Perl_do_readline(pTHX) |
| 1517 | { |
| 1518 | dVAR; dSP; dTARGETSTACKED; |
| 1519 | SV *sv; |
| 1520 | STRLEN tmplen = 0; |
| 1521 | STRLEN offset; |
| 1522 | PerlIO *fp; |
| 1523 | IO * const io = GvIO(PL_last_in_gv); |
| 1524 | const I32 type = PL_op->op_type; |
| 1525 | const I32 gimme = GIMME_V; |
| 1526 | |
| 1527 | if (io) { |
| 1528 | const MAGIC *const mg = SvTIED_mg((const SV *)io, PERL_MAGIC_tiedscalar); |
| 1529 | if (mg) { |
| 1530 | Perl_tied_method(aTHX_ SV_CONST(READLINE), SP, MUTABLE_SV(io), mg, gimme, 0); |
| 1531 | if (gimme == G_SCALAR) { |
| 1532 | SPAGAIN; |
| 1533 | SvSetSV_nosteal(TARG, TOPs); |
| 1534 | SETTARG; |
| 1535 | } |
| 1536 | return NORMAL; |
| 1537 | } |
| 1538 | } |
| 1539 | fp = NULL; |
| 1540 | if (io) { |
| 1541 | fp = IoIFP(io); |
| 1542 | if (!fp) { |
| 1543 | if (IoFLAGS(io) & IOf_ARGV) { |
| 1544 | if (IoFLAGS(io) & IOf_START) { |
| 1545 | IoLINES(io) = 0; |
| 1546 | if (av_len(GvAVn(PL_last_in_gv)) < 0) { |
| 1547 | IoFLAGS(io) &= ~IOf_START; |
| 1548 | do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,NULL); |
| 1549 | SvTAINTED_off(GvSVn(PL_last_in_gv)); /* previous tainting irrelevant */ |
| 1550 | sv_setpvs(GvSVn(PL_last_in_gv), "-"); |
| 1551 | SvSETMAGIC(GvSV(PL_last_in_gv)); |
| 1552 | fp = IoIFP(io); |
| 1553 | goto have_fp; |
| 1554 | } |
| 1555 | } |
| 1556 | fp = nextargv(PL_last_in_gv); |
| 1557 | if (!fp) { /* Note: fp != IoIFP(io) */ |
| 1558 | (void)do_close(PL_last_in_gv, FALSE); /* now it does*/ |
| 1559 | } |
| 1560 | } |
| 1561 | else if (type == OP_GLOB) |
| 1562 | fp = Perl_start_glob(aTHX_ POPs, io); |
| 1563 | } |
| 1564 | else if (type == OP_GLOB) |
| 1565 | SP--; |
| 1566 | else if (IoTYPE(io) == IoTYPE_WRONLY) { |
| 1567 | report_wrongway_fh(PL_last_in_gv, '>'); |
| 1568 | } |
| 1569 | } |
| 1570 | if (!fp) { |
| 1571 | if ((!io || !(IoFLAGS(io) & IOf_START)) |
| 1572 | && ckWARN(WARN_CLOSED) |
| 1573 | && type != OP_GLOB) |
| 1574 | { |
| 1575 | report_evil_fh(PL_last_in_gv); |
| 1576 | } |
| 1577 | if (gimme == G_SCALAR) { |
| 1578 | /* undef TARG, and push that undefined value */ |
| 1579 | if (type != OP_RCATLINE) { |
| 1580 | SV_CHECK_THINKFIRST_COW_DROP(TARG); |
| 1581 | SvOK_off(TARG); |
| 1582 | } |
| 1583 | PUSHTARG; |
| 1584 | } |
| 1585 | RETURN; |
| 1586 | } |
| 1587 | have_fp: |
| 1588 | if (gimme == G_SCALAR) { |
| 1589 | sv = TARG; |
| 1590 | if (type == OP_RCATLINE && SvGMAGICAL(sv)) |
| 1591 | mg_get(sv); |
| 1592 | if (SvROK(sv)) { |
| 1593 | if (type == OP_RCATLINE) |
| 1594 | SvPV_force_nomg_nolen(sv); |
| 1595 | else |
| 1596 | sv_unref(sv); |
| 1597 | } |
| 1598 | else if (isGV_with_GP(sv)) { |
| 1599 | SvPV_force_nomg_nolen(sv); |
| 1600 | } |
| 1601 | SvUPGRADE(sv, SVt_PV); |
| 1602 | tmplen = SvLEN(sv); /* remember if already alloced */ |
| 1603 | if (!tmplen && !SvREADONLY(sv) && !SvIsCOW(sv)) { |
| 1604 | /* try short-buffering it. Please update t/op/readline.t |
| 1605 | * if you change the growth length. |
| 1606 | */ |
| 1607 | Sv_Grow(sv, 80); |
| 1608 | } |
| 1609 | offset = 0; |
| 1610 | if (type == OP_RCATLINE && SvOK(sv)) { |
| 1611 | if (!SvPOK(sv)) { |
| 1612 | SvPV_force_nomg_nolen(sv); |
| 1613 | } |
| 1614 | offset = SvCUR(sv); |
| 1615 | } |
| 1616 | } |
| 1617 | else { |
| 1618 | sv = sv_2mortal(newSV(80)); |
| 1619 | offset = 0; |
| 1620 | } |
| 1621 | |
| 1622 | /* This should not be marked tainted if the fp is marked clean */ |
| 1623 | #define MAYBE_TAINT_LINE(io, sv) \ |
| 1624 | if (!(IoFLAGS(io) & IOf_UNTAINT)) { \ |
| 1625 | TAINT; \ |
| 1626 | SvTAINTED_on(sv); \ |
| 1627 | } |
| 1628 | |
| 1629 | /* delay EOF state for a snarfed empty file */ |
| 1630 | #define SNARF_EOF(gimme,rs,io,sv) \ |
| 1631 | (gimme != G_SCALAR || SvCUR(sv) \ |
| 1632 | || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs)) |
| 1633 | |
| 1634 | for (;;) { |
| 1635 | PUTBACK; |
| 1636 | if (!sv_gets(sv, fp, offset) |
| 1637 | && (type == OP_GLOB |
| 1638 | || SNARF_EOF(gimme, PL_rs, io, sv) |
| 1639 | || PerlIO_error(fp))) |
| 1640 | { |
| 1641 | PerlIO_clearerr(fp); |
| 1642 | if (IoFLAGS(io) & IOf_ARGV) { |
| 1643 | fp = nextargv(PL_last_in_gv); |
| 1644 | if (fp) |
| 1645 | continue; |
| 1646 | (void)do_close(PL_last_in_gv, FALSE); |
| 1647 | } |
| 1648 | else if (type == OP_GLOB) { |
| 1649 | if (!do_close(PL_last_in_gv, FALSE)) { |
| 1650 | Perl_ck_warner(aTHX_ packWARN(WARN_GLOB), |
| 1651 | "glob failed (child exited with status %d%s)", |
| 1652 | (int)(STATUS_CURRENT >> 8), |
| 1653 | (STATUS_CURRENT & 0x80) ? ", core dumped" : ""); |
| 1654 | } |
| 1655 | } |
| 1656 | if (gimme == G_SCALAR) { |
| 1657 | if (type != OP_RCATLINE) { |
| 1658 | SV_CHECK_THINKFIRST_COW_DROP(TARG); |
| 1659 | SvOK_off(TARG); |
| 1660 | } |
| 1661 | SPAGAIN; |
| 1662 | PUSHTARG; |
| 1663 | } |
| 1664 | MAYBE_TAINT_LINE(io, sv); |
| 1665 | RETURN; |
| 1666 | } |
| 1667 | MAYBE_TAINT_LINE(io, sv); |
| 1668 | IoLINES(io)++; |
| 1669 | IoFLAGS(io) |= IOf_NOLINE; |
| 1670 | SvSETMAGIC(sv); |
| 1671 | SPAGAIN; |
| 1672 | XPUSHs(sv); |
| 1673 | if (type == OP_GLOB) { |
| 1674 | const char *t1; |
| 1675 | |
| 1676 | if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) { |
| 1677 | char * const tmps = SvEND(sv) - 1; |
| 1678 | if (*tmps == *SvPVX_const(PL_rs)) { |
| 1679 | *tmps = '\0'; |
| 1680 | SvCUR_set(sv, SvCUR(sv) - 1); |
| 1681 | } |
| 1682 | } |
| 1683 | for (t1 = SvPVX_const(sv); *t1; t1++) |
| 1684 | if (!isALPHANUMERIC(*t1) && |
| 1685 | strchr("$&*(){}[]'\";\\|?<>~`", *t1)) |
| 1686 | break; |
| 1687 | if (*t1 && PerlLIO_lstat(SvPVX_const(sv), &PL_statbuf) < 0) { |
| 1688 | (void)POPs; /* Unmatched wildcard? Chuck it... */ |
| 1689 | continue; |
| 1690 | } |
| 1691 | } else if (SvUTF8(sv)) { /* OP_READLINE, OP_RCATLINE */ |
| 1692 | if (ckWARN(WARN_UTF8)) { |
| 1693 | const U8 * const s = (const U8*)SvPVX_const(sv) + offset; |
| 1694 | const STRLEN len = SvCUR(sv) - offset; |
| 1695 | const U8 *f; |
| 1696 | |
| 1697 | if (!is_utf8_string_loc(s, len, &f)) |
| 1698 | /* Emulate :encoding(utf8) warning in the same case. */ |
| 1699 | Perl_warner(aTHX_ packWARN(WARN_UTF8), |
| 1700 | "utf8 \"\\x%02X\" does not map to Unicode", |
| 1701 | f < (U8*)SvEND(sv) ? *f : 0); |
| 1702 | } |
| 1703 | } |
| 1704 | if (gimme == G_ARRAY) { |
| 1705 | if (SvLEN(sv) - SvCUR(sv) > 20) { |
| 1706 | SvPV_shrink_to_cur(sv); |
| 1707 | } |
| 1708 | sv = sv_2mortal(newSV(80)); |
| 1709 | continue; |
| 1710 | } |
| 1711 | else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) { |
| 1712 | /* try to reclaim a bit of scalar space (only on 1st alloc) */ |
| 1713 | const STRLEN new_len |
| 1714 | = SvCUR(sv) < 60 ? 80 : SvCUR(sv)+40; /* allow some slop */ |
| 1715 | SvPV_renew(sv, new_len); |
| 1716 | } |
| 1717 | RETURN; |
| 1718 | } |
| 1719 | } |
| 1720 | |
| 1721 | PP(pp_helem) |
| 1722 | { |
| 1723 | dVAR; dSP; |
| 1724 | HE* he; |
| 1725 | SV **svp; |
| 1726 | SV * const keysv = POPs; |
| 1727 | HV * const hv = MUTABLE_HV(POPs); |
| 1728 | const U32 lval = PL_op->op_flags & OPf_MOD || LVRET; |
| 1729 | const U32 defer = PL_op->op_private & OPpLVAL_DEFER; |
| 1730 | SV *sv; |
| 1731 | const bool localizing = PL_op->op_private & OPpLVAL_INTRO; |
| 1732 | bool preeminent = TRUE; |
| 1733 | |
| 1734 | if (SvTYPE(hv) != SVt_PVHV) |
| 1735 | RETPUSHUNDEF; |
| 1736 | |
| 1737 | if (localizing) { |
| 1738 | MAGIC *mg; |
| 1739 | HV *stash; |
| 1740 | |
| 1741 | /* If we can determine whether the element exist, |
| 1742 | * Try to preserve the existenceness of a tied hash |
| 1743 | * element by using EXISTS and DELETE if possible. |
| 1744 | * Fallback to FETCH and STORE otherwise. */ |
| 1745 | if (SvCANEXISTDELETE(hv)) |
| 1746 | preeminent = hv_exists_ent(hv, keysv, 0); |
| 1747 | } |
| 1748 | |
| 1749 | he = hv_fetch_ent(hv, keysv, lval && !defer, 0); |
| 1750 | svp = he ? &HeVAL(he) : NULL; |
| 1751 | if (lval) { |
| 1752 | if (!svp || !*svp || *svp == &PL_sv_undef) { |
| 1753 | SV* lv; |
| 1754 | SV* key2; |
| 1755 | if (!defer) { |
| 1756 | DIE(aTHX_ PL_no_helem_sv, SVfARG(keysv)); |
| 1757 | } |
| 1758 | lv = sv_newmortal(); |
| 1759 | sv_upgrade(lv, SVt_PVLV); |
| 1760 | LvTYPE(lv) = 'y'; |
| 1761 | sv_magic(lv, key2 = newSVsv(keysv), PERL_MAGIC_defelem, NULL, 0); |
| 1762 | SvREFCNT_dec_NN(key2); /* sv_magic() increments refcount */ |
| 1763 | LvTARG(lv) = SvREFCNT_inc_simple(hv); |
| 1764 | LvTARGLEN(lv) = 1; |
| 1765 | PUSHs(lv); |
| 1766 | RETURN; |
| 1767 | } |
| 1768 | if (localizing) { |
| 1769 | if (HvNAME_get(hv) && isGV(*svp)) |
| 1770 | save_gp(MUTABLE_GV(*svp), !(PL_op->op_flags & OPf_SPECIAL)); |
| 1771 | else if (preeminent) |
| 1772 | save_helem_flags(hv, keysv, svp, |
| 1773 | (PL_op->op_flags & OPf_SPECIAL) ? 0 : SAVEf_SETMAGIC); |
| 1774 | else |
| 1775 | SAVEHDELETE(hv, keysv); |
| 1776 | } |
| 1777 | else if (PL_op->op_private & OPpDEREF) { |
| 1778 | PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF)); |
| 1779 | RETURN; |
| 1780 | } |
| 1781 | } |
| 1782 | sv = (svp && *svp ? *svp : &PL_sv_undef); |
| 1783 | /* Originally this did a conditional C<sv = sv_mortalcopy(sv)>; this |
| 1784 | * was to make C<local $tied{foo} = $tied{foo}> possible. |
| 1785 | * However, it seems no longer to be needed for that purpose, and |
| 1786 | * introduced a new bug: stuff like C<while ($hash{taintedval} =~ /.../g> |
| 1787 | * would loop endlessly since the pos magic is getting set on the |
| 1788 | * mortal copy and lost. However, the copy has the effect of |
| 1789 | * triggering the get magic, and losing it altogether made things like |
| 1790 | * c<$tied{foo};> in void context no longer do get magic, which some |
| 1791 | * code relied on. Also, delayed triggering of magic on @+ and friends |
| 1792 | * meant the original regex may be out of scope by now. So as a |
| 1793 | * compromise, do the get magic here. (The MGf_GSKIP flag will stop it |
| 1794 | * being called too many times). */ |
| 1795 | if (!lval && SvRMAGICAL(hv) && SvGMAGICAL(sv)) |
| 1796 | mg_get(sv); |
| 1797 | PUSHs(sv); |
| 1798 | RETURN; |
| 1799 | } |
| 1800 | |
| 1801 | PP(pp_iter) |
| 1802 | { |
| 1803 | dVAR; dSP; |
| 1804 | PERL_CONTEXT *cx; |
| 1805 | SV *oldsv; |
| 1806 | SV **itersvp; |
| 1807 | |
| 1808 | EXTEND(SP, 1); |
| 1809 | cx = &cxstack[cxstack_ix]; |
| 1810 | itersvp = CxITERVAR(cx); |
| 1811 | |
| 1812 | switch (CxTYPE(cx)) { |
| 1813 | |
| 1814 | case CXt_LOOP_LAZYSV: /* string increment */ |
| 1815 | { |
| 1816 | SV* cur = cx->blk_loop.state_u.lazysv.cur; |
| 1817 | SV *end = cx->blk_loop.state_u.lazysv.end; |
| 1818 | /* If the maximum is !SvOK(), pp_enteriter substitutes PL_sv_no. |
| 1819 | It has SvPVX of "" and SvCUR of 0, which is what we want. */ |
| 1820 | STRLEN maxlen = 0; |
| 1821 | const char *max = SvPV_const(end, maxlen); |
| 1822 | if (SvNIOK(cur) || SvCUR(cur) > maxlen) |
| 1823 | RETPUSHNO; |
| 1824 | |
| 1825 | oldsv = *itersvp; |
| 1826 | if (SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv)) { |
| 1827 | /* safe to reuse old SV */ |
| 1828 | sv_setsv(oldsv, cur); |
| 1829 | } |
| 1830 | else |
| 1831 | { |
| 1832 | /* we need a fresh SV every time so that loop body sees a |
| 1833 | * completely new SV for closures/references to work as |
| 1834 | * they used to */ |
| 1835 | *itersvp = newSVsv(cur); |
| 1836 | SvREFCNT_dec_NN(oldsv); |
| 1837 | } |
| 1838 | if (strEQ(SvPVX_const(cur), max)) |
| 1839 | sv_setiv(cur, 0); /* terminate next time */ |
| 1840 | else |
| 1841 | sv_inc(cur); |
| 1842 | break; |
| 1843 | } |
| 1844 | |
| 1845 | case CXt_LOOP_LAZYIV: /* integer increment */ |
| 1846 | { |
| 1847 | IV cur = cx->blk_loop.state_u.lazyiv.cur; |
| 1848 | if (cur > cx->blk_loop.state_u.lazyiv.end) |
| 1849 | RETPUSHNO; |
| 1850 | |
| 1851 | oldsv = *itersvp; |
| 1852 | /* don't risk potential race */ |
| 1853 | if (SvREFCNT(oldsv) == 1 && !SvMAGICAL(oldsv)) { |
| 1854 | /* safe to reuse old SV */ |
| 1855 | sv_setiv(oldsv, cur); |
| 1856 | } |
| 1857 | else |
| 1858 | { |
| 1859 | /* we need a fresh SV every time so that loop body sees a |
| 1860 | * completely new SV for closures/references to work as they |
| 1861 | * used to */ |
| 1862 | *itersvp = newSViv(cur); |
| 1863 | SvREFCNT_dec_NN(oldsv); |
| 1864 | } |
| 1865 | |
| 1866 | if (cur == IV_MAX) { |
| 1867 | /* Handle end of range at IV_MAX */ |
| 1868 | cx->blk_loop.state_u.lazyiv.end = IV_MIN; |
| 1869 | } else |
| 1870 | ++cx->blk_loop.state_u.lazyiv.cur; |
| 1871 | break; |
| 1872 | } |
| 1873 | |
| 1874 | case CXt_LOOP_FOR: /* iterate array */ |
| 1875 | { |
| 1876 | |
| 1877 | AV *av = cx->blk_loop.state_u.ary.ary; |
| 1878 | SV *sv; |
| 1879 | bool av_is_stack = FALSE; |
| 1880 | IV ix; |
| 1881 | |
| 1882 | if (!av) { |
| 1883 | av_is_stack = TRUE; |
| 1884 | av = PL_curstack; |
| 1885 | } |
| 1886 | if (PL_op->op_private & OPpITER_REVERSED) { |
| 1887 | ix = --cx->blk_loop.state_u.ary.ix; |
| 1888 | if (ix <= (av_is_stack ? cx->blk_loop.resetsp : -1)) |
| 1889 | RETPUSHNO; |
| 1890 | } |
| 1891 | else { |
| 1892 | ix = ++cx->blk_loop.state_u.ary.ix; |
| 1893 | if (ix > (av_is_stack ? cx->blk_oldsp : AvFILL(av))) |
| 1894 | RETPUSHNO; |
| 1895 | } |
| 1896 | |
| 1897 | if (SvMAGICAL(av) || AvREIFY(av)) { |
| 1898 | SV * const * const svp = av_fetch(av, ix, FALSE); |
| 1899 | sv = svp ? *svp : NULL; |
| 1900 | } |
| 1901 | else { |
| 1902 | sv = AvARRAY(av)[ix]; |
| 1903 | } |
| 1904 | |
| 1905 | if (sv) { |
| 1906 | if (SvIS_FREED(sv)) { |
| 1907 | *itersvp = NULL; |
| 1908 | Perl_croak(aTHX_ "Use of freed value in iteration"); |
| 1909 | } |
| 1910 | if (SvPADTMP(sv) && !IS_PADGV(sv)) |
| 1911 | sv = newSVsv(sv); |
| 1912 | else { |
| 1913 | SvTEMP_off(sv); |
| 1914 | SvREFCNT_inc_simple_void_NN(sv); |
| 1915 | } |
| 1916 | } |
| 1917 | else if (!av_is_stack) { |
| 1918 | sv = newSVavdefelem(av, ix, 0); |
| 1919 | } |
| 1920 | else |
| 1921 | sv = &PL_sv_undef; |
| 1922 | |
| 1923 | oldsv = *itersvp; |
| 1924 | *itersvp = sv; |
| 1925 | SvREFCNT_dec(oldsv); |
| 1926 | break; |
| 1927 | } |
| 1928 | |
| 1929 | default: |
| 1930 | DIE(aTHX_ "panic: pp_iter, type=%u", CxTYPE(cx)); |
| 1931 | } |
| 1932 | RETPUSHYES; |
| 1933 | } |
| 1934 | |
| 1935 | /* |
| 1936 | A description of how taint works in pattern matching and substitution. |
| 1937 | |
| 1938 | This is all conditional on NO_TAINT_SUPPORT not being defined. Under |
| 1939 | NO_TAINT_SUPPORT, taint-related operations should become no-ops. |
| 1940 | |
| 1941 | While the pattern is being assembled/concatenated and then compiled, |
| 1942 | PL_tainted will get set (via TAINT_set) if any component of the pattern |
| 1943 | is tainted, e.g. /.*$tainted/. At the end of pattern compilation, |
| 1944 | the RXf_TAINTED flag is set on the pattern if PL_tainted is set (via |
| 1945 | TAINT_get). |
| 1946 | |
| 1947 | When the pattern is copied, e.g. $r = qr/..../, the SV holding the ref to |
| 1948 | the pattern is marked as tainted. This means that subsequent usage, such |
| 1949 | as /x$r/, will set PL_tainted using TAINT_set, and thus RXf_TAINTED, |
| 1950 | on the new pattern too. |
| 1951 | |
| 1952 | At the start of execution of a pattern, the RXf_TAINTED_SEEN flag on the |
| 1953 | regex is cleared; during execution, locale-variant ops such as POSIXL may |
| 1954 | set RXf_TAINTED_SEEN. |
| 1955 | |
| 1956 | RXf_TAINTED_SEEN is used post-execution by the get magic code |
| 1957 | of $1 et al to indicate whether the returned value should be tainted. |
| 1958 | It is the responsibility of the caller of the pattern (i.e. pp_match, |
| 1959 | pp_subst etc) to set this flag for any other circumstances where $1 needs |
| 1960 | to be tainted. |
| 1961 | |
| 1962 | The taint behaviour of pp_subst (and pp_substcont) is quite complex. |
| 1963 | |
| 1964 | There are three possible sources of taint |
| 1965 | * the source string |
| 1966 | * the pattern (both compile- and run-time, RXf_TAINTED / RXf_TAINTED_SEEN) |
| 1967 | * the replacement string (or expression under /e) |
| 1968 | |
| 1969 | There are four destinations of taint and they are affected by the sources |
| 1970 | according to the rules below: |
| 1971 | |
| 1972 | * the return value (not including /r): |
| 1973 | tainted by the source string and pattern, but only for the |
| 1974 | number-of-iterations case; boolean returns aren't tainted; |
| 1975 | * the modified string (or modified copy under /r): |
| 1976 | tainted by the source string, pattern, and replacement strings; |
| 1977 | * $1 et al: |
| 1978 | tainted by the pattern, and under 'use re "taint"', by the source |
| 1979 | string too; |
| 1980 | * PL_taint - i.e. whether subsequent code (e.g. in a /e block) is tainted: |
| 1981 | should always be unset before executing subsequent code. |
| 1982 | |
| 1983 | The overall action of pp_subst is: |
| 1984 | |
| 1985 | * at the start, set bits in rxtainted indicating the taint status of |
| 1986 | the various sources. |
| 1987 | |
| 1988 | * After each pattern execution, update the SUBST_TAINT_PAT bit in |
| 1989 | rxtainted if RXf_TAINTED_SEEN has been set, to indicate that the |
| 1990 | pattern has subsequently become tainted via locale ops. |
| 1991 | |
| 1992 | * If control is being passed to pp_substcont to execute a /e block, |
| 1993 | save rxtainted in the CXt_SUBST block, for future use by |
| 1994 | pp_substcont. |
| 1995 | |
| 1996 | * Whenever control is being returned to perl code (either by falling |
| 1997 | off the "end" of pp_subst/pp_substcont, or by entering a /e block), |
| 1998 | use the flag bits in rxtainted to make all the appropriate types of |
| 1999 | destination taint visible; e.g. set RXf_TAINTED_SEEN so that $1 |
| 2000 | et al will appear tainted. |
| 2001 | |
| 2002 | pp_match is just a simpler version of the above. |
| 2003 | |
| 2004 | */ |
| 2005 | |
| 2006 | PP(pp_subst) |
| 2007 | { |
| 2008 | dVAR; dSP; dTARG; |
| 2009 | PMOP *pm = cPMOP; |
| 2010 | PMOP *rpm = pm; |
| 2011 | char *s; |
| 2012 | char *strend; |
| 2013 | const char *c; |
| 2014 | STRLEN clen; |
| 2015 | I32 iters = 0; |
| 2016 | I32 maxiters; |
| 2017 | bool once; |
| 2018 | U8 rxtainted = 0; /* holds various SUBST_TAINT_* flag bits. |
| 2019 | See "how taint works" above */ |
| 2020 | char *orig; |
| 2021 | U8 r_flags; |
| 2022 | REGEXP *rx = PM_GETRE(pm); |
| 2023 | STRLEN len; |
| 2024 | int force_on_match = 0; |
| 2025 | const I32 oldsave = PL_savestack_ix; |
| 2026 | STRLEN slen; |
| 2027 | bool doutf8 = FALSE; /* whether replacement is in utf8 */ |
| 2028 | #ifdef PERL_ANY_COW |
| 2029 | bool is_cow; |
| 2030 | #endif |
| 2031 | SV *nsv = NULL; |
| 2032 | /* known replacement string? */ |
| 2033 | SV *dstr = (pm->op_pmflags & PMf_CONST) ? POPs : NULL; |
| 2034 | |
| 2035 | PERL_ASYNC_CHECK(); |
| 2036 | |
| 2037 | if (PL_op->op_flags & OPf_STACKED) |
| 2038 | TARG = POPs; |
| 2039 | else if (PL_op->op_private & OPpTARGET_MY) |
| 2040 | GETTARGET; |
| 2041 | else { |
| 2042 | TARG = DEFSV; |
| 2043 | EXTEND(SP,1); |
| 2044 | } |
| 2045 | |
| 2046 | SvGETMAGIC(TARG); /* must come before cow check */ |
| 2047 | #ifdef PERL_ANY_COW |
| 2048 | /* Awooga. Awooga. "bool" types that are actually char are dangerous, |
| 2049 | because they make integers such as 256 "false". */ |
| 2050 | is_cow = SvIsCOW(TARG) ? TRUE : FALSE; |
| 2051 | #else |
| 2052 | if (SvIsCOW(TARG)) |
| 2053 | sv_force_normal_flags(TARG,0); |
| 2054 | #endif |
| 2055 | if (!(rpm->op_pmflags & PMf_NONDESTRUCT) |
| 2056 | && (SvREADONLY(TARG) |
| 2057 | || ( ((SvTYPE(TARG) == SVt_PVGV && isGV_with_GP(TARG)) |
| 2058 | || SvTYPE(TARG) > SVt_PVLV) |
| 2059 | && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))) |
| 2060 | Perl_croak_no_modify(); |
| 2061 | PUTBACK; |
| 2062 | |
| 2063 | orig = SvPV_nomg(TARG, len); |
| 2064 | /* note we don't (yet) force the var into being a string; if we fail |
| 2065 | * to match, we leave as-is; on successful match howeverm, we *will* |
| 2066 | * coerce into a string, then repeat the match */ |
| 2067 | if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV || SvVOK(TARG)) |
| 2068 | force_on_match = 1; |
| 2069 | |
| 2070 | /* only replace once? */ |
| 2071 | once = !(rpm->op_pmflags & PMf_GLOBAL); |
| 2072 | |
| 2073 | /* See "how taint works" above */ |
| 2074 | if (TAINTING_get) { |
| 2075 | rxtainted = ( |
| 2076 | (SvTAINTED(TARG) ? SUBST_TAINT_STR : 0) |
| 2077 | | (RX_ISTAINTED(rx) ? SUBST_TAINT_PAT : 0) |
| 2078 | | ((pm->op_pmflags & PMf_RETAINT) ? SUBST_TAINT_RETAINT : 0) |
| 2079 | | ((once && !(rpm->op_pmflags & PMf_NONDESTRUCT)) |
| 2080 | ? SUBST_TAINT_BOOLRET : 0)); |
| 2081 | TAINT_NOT; |
| 2082 | } |
| 2083 | |
| 2084 | force_it: |
| 2085 | if (!pm || !orig) |
| 2086 | DIE(aTHX_ "panic: pp_subst, pm=%p, orig=%p", pm, orig); |
| 2087 | |
| 2088 | strend = orig + len; |
| 2089 | slen = DO_UTF8(TARG) ? utf8_length((U8*)orig, (U8*)strend) : len; |
| 2090 | maxiters = 2 * slen + 10; /* We can match twice at each |
| 2091 | position, once with zero-length, |
| 2092 | second time with non-zero. */ |
| 2093 | |
| 2094 | if (!RX_PRELEN(rx) && PL_curpm |
| 2095 | && !ReANY(rx)->mother_re) { |
| 2096 | pm = PL_curpm; |
| 2097 | rx = PM_GETRE(pm); |
| 2098 | } |
| 2099 | |
| 2100 | #ifdef PERL_SAWAMPERSAND |
| 2101 | r_flags = ( RX_NPARENS(rx) |
| 2102 | || PL_sawampersand |
| 2103 | || (RX_EXTFLAGS(rx) & (RXf_EVAL_SEEN|RXf_PMf_KEEPCOPY)) |
| 2104 | || (rpm->op_pmflags & PMf_KEEPCOPY) |
| 2105 | ) |
| 2106 | ? REXEC_COPY_STR |
| 2107 | : 0; |
| 2108 | #else |
| 2109 | r_flags = REXEC_COPY_STR; |
| 2110 | #endif |
| 2111 | |
| 2112 | if (!CALLREGEXEC(rx, orig, strend, orig, 0, TARG, NULL, r_flags)) |
| 2113 | { |
| 2114 | SPAGAIN; |
| 2115 | PUSHs(rpm->op_pmflags & PMf_NONDESTRUCT ? TARG : &PL_sv_no); |
| 2116 | LEAVE_SCOPE(oldsave); |
| 2117 | RETURN; |
| 2118 | } |
| 2119 | PL_curpm = pm; |
| 2120 | |
| 2121 | /* known replacement string? */ |
| 2122 | if (dstr) { |
| 2123 | /* replacement needing upgrading? */ |
| 2124 | if (DO_UTF8(TARG) && !doutf8) { |
| 2125 | nsv = sv_newmortal(); |
| 2126 | SvSetSV(nsv, dstr); |
| 2127 | if (PL_encoding) |
| 2128 | sv_recode_to_utf8(nsv, PL_encoding); |
| 2129 | else |
| 2130 | sv_utf8_upgrade(nsv); |
| 2131 | c = SvPV_const(nsv, clen); |
| 2132 | doutf8 = TRUE; |
| 2133 | } |
| 2134 | else { |
| 2135 | c = SvPV_const(dstr, clen); |
| 2136 | doutf8 = DO_UTF8(dstr); |
| 2137 | } |
| 2138 | |
| 2139 | if (SvTAINTED(dstr)) |
| 2140 | rxtainted |= SUBST_TAINT_REPL; |
| 2141 | } |
| 2142 | else { |
| 2143 | c = NULL; |
| 2144 | doutf8 = FALSE; |
| 2145 | } |
| 2146 | |
| 2147 | /* can do inplace substitution? */ |
| 2148 | if (c |
| 2149 | #ifdef PERL_ANY_COW |
| 2150 | && !is_cow |
| 2151 | #endif |
| 2152 | && (I32)clen <= RX_MINLENRET(rx) |
| 2153 | && ( once |
| 2154 | || !(r_flags & REXEC_COPY_STR) |
| 2155 | || (!SvGMAGICAL(dstr) && !(RX_EXTFLAGS(rx) & RXf_EVAL_SEEN)) |
| 2156 | ) |
| 2157 | && !(RX_EXTFLAGS(rx) & RXf_NO_INPLACE_SUBST) |
| 2158 | && (!doutf8 || SvUTF8(TARG)) |
| 2159 | && !(rpm->op_pmflags & PMf_NONDESTRUCT)) |
| 2160 | { |
| 2161 | |
| 2162 | #ifdef PERL_ANY_COW |
| 2163 | if (SvIsCOW(TARG)) { |
| 2164 | if (!force_on_match) |
| 2165 | goto have_a_cow; |
| 2166 | assert(SvVOK(TARG)); |
| 2167 | } |
| 2168 | #endif |
| 2169 | if (force_on_match) { |
| 2170 | /* redo the first match, this time with the orig var |
| 2171 | * forced into being a string */ |
| 2172 | force_on_match = 0; |
| 2173 | orig = SvPV_force_nomg(TARG, len); |
| 2174 | goto force_it; |
| 2175 | } |
| 2176 | |
| 2177 | if (once) { |
| 2178 | char *d, *m; |
| 2179 | if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */ |
| 2180 | rxtainted |= SUBST_TAINT_PAT; |
| 2181 | m = orig + RX_OFFS(rx)[0].start; |
| 2182 | d = orig + RX_OFFS(rx)[0].end; |
| 2183 | s = orig; |
| 2184 | if (m - s > strend - d) { /* faster to shorten from end */ |
| 2185 | I32 i; |
| 2186 | if (clen) { |
| 2187 | Copy(c, m, clen, char); |
| 2188 | m += clen; |
| 2189 | } |
| 2190 | i = strend - d; |
| 2191 | if (i > 0) { |
| 2192 | Move(d, m, i, char); |
| 2193 | m += i; |
| 2194 | } |
| 2195 | *m = '\0'; |
| 2196 | SvCUR_set(TARG, m - s); |
| 2197 | } |
| 2198 | else { /* faster from front */ |
| 2199 | I32 i = m - s; |
| 2200 | d -= clen; |
| 2201 | if (i > 0) |
| 2202 | Move(s, d - i, i, char); |
| 2203 | sv_chop(TARG, d-i); |
| 2204 | if (clen) |
| 2205 | Copy(c, d, clen, char); |
| 2206 | } |
| 2207 | SPAGAIN; |
| 2208 | PUSHs(&PL_sv_yes); |
| 2209 | } |
| 2210 | else { |
| 2211 | char *d, *m; |
| 2212 | d = s = RX_OFFS(rx)[0].start + orig; |
| 2213 | do { |
| 2214 | I32 i; |
| 2215 | if (iters++ > maxiters) |
| 2216 | DIE(aTHX_ "Substitution loop"); |
| 2217 | if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */ |
| 2218 | rxtainted |= SUBST_TAINT_PAT; |
| 2219 | m = RX_OFFS(rx)[0].start + orig; |
| 2220 | if ((i = m - s)) { |
| 2221 | if (s != d) |
| 2222 | Move(s, d, i, char); |
| 2223 | d += i; |
| 2224 | } |
| 2225 | if (clen) { |
| 2226 | Copy(c, d, clen, char); |
| 2227 | d += clen; |
| 2228 | } |
| 2229 | s = RX_OFFS(rx)[0].end + orig; |
| 2230 | } while (CALLREGEXEC(rx, s, strend, orig, |
| 2231 | s == m, /* don't match same null twice */ |
| 2232 | TARG, NULL, |
| 2233 | REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW)); |
| 2234 | if (s != d) { |
| 2235 | I32 i = strend - s; |
| 2236 | SvCUR_set(TARG, d - SvPVX_const(TARG) + i); |
| 2237 | Move(s, d, i+1, char); /* include the NUL */ |
| 2238 | } |
| 2239 | SPAGAIN; |
| 2240 | mPUSHi((I32)iters); |
| 2241 | } |
| 2242 | } |
| 2243 | else { |
| 2244 | bool first; |
| 2245 | char *m; |
| 2246 | SV *repl; |
| 2247 | if (force_on_match) { |
| 2248 | /* redo the first match, this time with the orig var |
| 2249 | * forced into being a string */ |
| 2250 | force_on_match = 0; |
| 2251 | if (rpm->op_pmflags & PMf_NONDESTRUCT) { |
| 2252 | /* I feel that it should be possible to avoid this mortal copy |
| 2253 | given that the code below copies into a new destination. |
| 2254 | However, I suspect it isn't worth the complexity of |
| 2255 | unravelling the C<goto force_it> for the small number of |
| 2256 | cases where it would be viable to drop into the copy code. */ |
| 2257 | TARG = sv_2mortal(newSVsv(TARG)); |
| 2258 | } |
| 2259 | orig = SvPV_force_nomg(TARG, len); |
| 2260 | goto force_it; |
| 2261 | } |
| 2262 | #ifdef PERL_ANY_COW |
| 2263 | have_a_cow: |
| 2264 | #endif |
| 2265 | if (RX_MATCH_TAINTED(rx)) /* run time pattern taint, eg locale */ |
| 2266 | rxtainted |= SUBST_TAINT_PAT; |
| 2267 | repl = dstr; |
| 2268 | s = RX_OFFS(rx)[0].start + orig; |
| 2269 | dstr = newSVpvn_flags(orig, s-orig, |
| 2270 | SVs_TEMP | (DO_UTF8(TARG) ? SVf_UTF8 : 0)); |
| 2271 | if (!c) { |
| 2272 | PERL_CONTEXT *cx; |
| 2273 | SPAGAIN; |
| 2274 | m = orig; |
| 2275 | /* note that a whole bunch of local vars are saved here for |
| 2276 | * use by pp_substcont: here's a list of them in case you're |
| 2277 | * searching for places in this sub that uses a particular var: |
| 2278 | * iters maxiters r_flags oldsave rxtainted orig dstr targ |
| 2279 | * s m strend rx once */ |
| 2280 | PUSHSUBST(cx); |
| 2281 | RETURNOP(cPMOP->op_pmreplrootu.op_pmreplroot); |
| 2282 | } |
| 2283 | first = TRUE; |
| 2284 | do { |
| 2285 | if (iters++ > maxiters) |
| 2286 | DIE(aTHX_ "Substitution loop"); |
| 2287 | if (RX_MATCH_TAINTED(rx)) |
| 2288 | rxtainted |= SUBST_TAINT_PAT; |
| 2289 | if (RX_MATCH_COPIED(rx) && RX_SUBBEG(rx) != orig) { |
| 2290 | char *old_s = s; |
| 2291 | char *old_orig = orig; |
| 2292 | assert(RX_SUBOFFSET(rx) == 0); |
| 2293 | |
| 2294 | orig = RX_SUBBEG(rx); |
| 2295 | s = orig + (old_s - old_orig); |
| 2296 | strend = s + (strend - old_s); |
| 2297 | } |
| 2298 | m = RX_OFFS(rx)[0].start + orig; |
| 2299 | sv_catpvn_nomg_maybeutf8(dstr, s, m - s, DO_UTF8(TARG)); |
| 2300 | s = RX_OFFS(rx)[0].end + orig; |
| 2301 | if (first) { |
| 2302 | /* replacement already stringified */ |
| 2303 | if (clen) |
| 2304 | sv_catpvn_nomg_maybeutf8(dstr, c, clen, doutf8); |
| 2305 | first = FALSE; |
| 2306 | } |
| 2307 | else { |
| 2308 | if (PL_encoding) { |
| 2309 | if (!nsv) nsv = sv_newmortal(); |
| 2310 | sv_copypv(nsv, repl); |
| 2311 | if (!DO_UTF8(nsv)) sv_recode_to_utf8(nsv, PL_encoding); |
| 2312 | sv_catsv(dstr, nsv); |
| 2313 | } |
| 2314 | else sv_catsv(dstr, repl); |
| 2315 | if (SvTAINTED(repl)) |
| 2316 | rxtainted |= SUBST_TAINT_REPL; |
| 2317 | } |
| 2318 | if (once) |
| 2319 | break; |
| 2320 | } while (CALLREGEXEC(rx, s, strend, orig, s == m, |
| 2321 | TARG, NULL, |
| 2322 | REXEC_NOT_FIRST|REXEC_IGNOREPOS|REXEC_FAIL_ON_UNDERFLOW)); |
| 2323 | sv_catpvn_nomg_maybeutf8(dstr, s, strend - s, DO_UTF8(TARG)); |
| 2324 | |
| 2325 | if (rpm->op_pmflags & PMf_NONDESTRUCT) { |
| 2326 | /* From here on down we're using the copy, and leaving the original |
| 2327 | untouched. */ |
| 2328 | TARG = dstr; |
| 2329 | SPAGAIN; |
| 2330 | PUSHs(dstr); |
| 2331 | } else { |
| 2332 | #ifdef PERL_ANY_COW |
| 2333 | /* The match may make the string COW. If so, brilliant, because |
| 2334 | that's just saved us one malloc, copy and free - the regexp has |
| 2335 | donated the old buffer, and we malloc an entirely new one, rather |
| 2336 | than the regexp malloc()ing a buffer and copying our original, |
| 2337 | only for us to throw it away here during the substitution. */ |
| 2338 | if (SvIsCOW(TARG)) { |
| 2339 | sv_force_normal_flags(TARG, SV_COW_DROP_PV); |
| 2340 | } else |
| 2341 | #endif |
| 2342 | { |
| 2343 | SvPV_free(TARG); |
| 2344 | } |
| 2345 | SvPV_set(TARG, SvPVX(dstr)); |
| 2346 | SvCUR_set(TARG, SvCUR(dstr)); |
| 2347 | SvLEN_set(TARG, SvLEN(dstr)); |
| 2348 | SvFLAGS(TARG) |= SvUTF8(dstr); |
| 2349 | SvPV_set(dstr, NULL); |
| 2350 | |
| 2351 | SPAGAIN; |
| 2352 | mPUSHi((I32)iters); |
| 2353 | } |
| 2354 | } |
| 2355 | |
| 2356 | if (!(rpm->op_pmflags & PMf_NONDESTRUCT)) { |
| 2357 | (void)SvPOK_only_UTF8(TARG); |
| 2358 | } |
| 2359 | |
| 2360 | /* See "how taint works" above */ |
| 2361 | if (TAINTING_get) { |
| 2362 | if ((rxtainted & SUBST_TAINT_PAT) || |
| 2363 | ((rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_RETAINT)) == |
| 2364 | (SUBST_TAINT_STR|SUBST_TAINT_RETAINT)) |
| 2365 | ) |
| 2366 | (RX_MATCH_TAINTED_on(rx)); /* taint $1 et al */ |
| 2367 | |
| 2368 | if (!(rxtainted & SUBST_TAINT_BOOLRET) |
| 2369 | && (rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT)) |
| 2370 | ) |
| 2371 | SvTAINTED_on(TOPs); /* taint return value */ |
| 2372 | else |
| 2373 | SvTAINTED_off(TOPs); /* may have got tainted earlier */ |
| 2374 | |
| 2375 | /* needed for mg_set below */ |
| 2376 | TAINT_set( |
| 2377 | cBOOL(rxtainted & (SUBST_TAINT_STR|SUBST_TAINT_PAT|SUBST_TAINT_REPL)) |
| 2378 | ); |
| 2379 | SvTAINT(TARG); |
| 2380 | } |
| 2381 | SvSETMAGIC(TARG); /* PL_tainted must be correctly set for this mg_set */ |
| 2382 | TAINT_NOT; |
| 2383 | LEAVE_SCOPE(oldsave); |
| 2384 | RETURN; |
| 2385 | } |
| 2386 | |
| 2387 | PP(pp_grepwhile) |
| 2388 | { |
| 2389 | dVAR; dSP; |
| 2390 | |
| 2391 | if (SvTRUEx(POPs)) |
| 2392 | PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr]; |
| 2393 | ++*PL_markstack_ptr; |
| 2394 | FREETMPS; |
| 2395 | LEAVE_with_name("grep_item"); /* exit inner scope */ |
| 2396 | |
| 2397 | /* All done yet? */ |
| 2398 | if (PL_stack_base + *PL_markstack_ptr > SP) { |
| 2399 | I32 items; |
| 2400 | const I32 gimme = GIMME_V; |
| 2401 | |
| 2402 | LEAVE_with_name("grep"); /* exit outer scope */ |
| 2403 | (void)POPMARK; /* pop src */ |
| 2404 | items = --*PL_markstack_ptr - PL_markstack_ptr[-1]; |
| 2405 | (void)POPMARK; /* pop dst */ |
| 2406 | SP = PL_stack_base + POPMARK; /* pop original mark */ |
| 2407 | if (gimme == G_SCALAR) { |
| 2408 | if (PL_op->op_private & OPpGREP_LEX) { |
| 2409 | SV* const sv = sv_newmortal(); |
| 2410 | sv_setiv(sv, items); |
| 2411 | PUSHs(sv); |
| 2412 | } |
| 2413 | else { |
| 2414 | dTARGET; |
| 2415 | XPUSHi(items); |
| 2416 | } |
| 2417 | } |
| 2418 | else if (gimme == G_ARRAY) |
| 2419 | SP += items; |
| 2420 | RETURN; |
| 2421 | } |
| 2422 | else { |
| 2423 | SV *src; |
| 2424 | |
| 2425 | ENTER_with_name("grep_item"); /* enter inner scope */ |
| 2426 | SAVEVPTR(PL_curpm); |
| 2427 | |
| 2428 | src = PL_stack_base[*PL_markstack_ptr]; |
| 2429 | if (SvPADTMP(src) && !IS_PADGV(src)) { |
| 2430 | src = PL_stack_base[*PL_markstack_ptr] = sv_mortalcopy(src); |
| 2431 | PL_tmps_floor++; |
| 2432 | } |
| 2433 | SvTEMP_off(src); |
| 2434 | if (PL_op->op_private & OPpGREP_LEX) |
| 2435 | PAD_SVl(PL_op->op_targ) = src; |
| 2436 | else |
| 2437 | DEFSV_set(src); |
| 2438 | |
| 2439 | RETURNOP(cLOGOP->op_other); |
| 2440 | } |
| 2441 | } |
| 2442 | |
| 2443 | PP(pp_leavesub) |
| 2444 | { |
| 2445 | dVAR; dSP; |
| 2446 | SV **mark; |
| 2447 | SV **newsp; |
| 2448 | PMOP *newpm; |
| 2449 | I32 gimme; |
| 2450 | PERL_CONTEXT *cx; |
| 2451 | SV *sv; |
| 2452 | |
| 2453 | if (CxMULTICALL(&cxstack[cxstack_ix])) |
| 2454 | return 0; |
| 2455 | |
| 2456 | POPBLOCK(cx,newpm); |
| 2457 | cxstack_ix++; /* temporarily protect top context */ |
| 2458 | |
| 2459 | TAINT_NOT; |
| 2460 | if (gimme == G_SCALAR) { |
| 2461 | MARK = newsp + 1; |
| 2462 | if (MARK <= SP) { |
| 2463 | if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) { |
| 2464 | if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1 |
| 2465 | && !SvMAGICAL(TOPs)) { |
| 2466 | *MARK = SvREFCNT_inc(TOPs); |
| 2467 | FREETMPS; |
| 2468 | sv_2mortal(*MARK); |
| 2469 | } |
| 2470 | else { |
| 2471 | sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */ |
| 2472 | FREETMPS; |
| 2473 | *MARK = sv_mortalcopy(sv); |
| 2474 | SvREFCNT_dec_NN(sv); |
| 2475 | } |
| 2476 | } |
| 2477 | else if (SvTEMP(TOPs) && SvREFCNT(TOPs) == 1 |
| 2478 | && !SvMAGICAL(TOPs)) { |
| 2479 | *MARK = TOPs; |
| 2480 | } |
| 2481 | else |
| 2482 | *MARK = sv_mortalcopy(TOPs); |
| 2483 | } |
| 2484 | else { |
| 2485 | MEXTEND(MARK, 0); |
| 2486 | *MARK = &PL_sv_undef; |
| 2487 | } |
| 2488 | SP = MARK; |
| 2489 | } |
| 2490 | else if (gimme == G_ARRAY) { |
| 2491 | for (MARK = newsp + 1; MARK <= SP; MARK++) { |
| 2492 | if (!SvTEMP(*MARK) || SvREFCNT(*MARK) != 1 |
| 2493 | || SvMAGICAL(*MARK)) { |
| 2494 | *MARK = sv_mortalcopy(*MARK); |
| 2495 | TAINT_NOT; /* Each item is independent */ |
| 2496 | } |
| 2497 | } |
| 2498 | } |
| 2499 | PUTBACK; |
| 2500 | |
| 2501 | LEAVE; |
| 2502 | POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */ |
| 2503 | cxstack_ix--; |
| 2504 | PL_curpm = newpm; /* ... and pop $1 et al */ |
| 2505 | |
| 2506 | LEAVESUB(sv); |
| 2507 | return cx->blk_sub.retop; |
| 2508 | } |
| 2509 | |
| 2510 | PP(pp_entersub) |
| 2511 | { |
| 2512 | dVAR; dSP; dPOPss; |
| 2513 | GV *gv; |
| 2514 | CV *cv; |
| 2515 | PERL_CONTEXT *cx; |
| 2516 | I32 gimme; |
| 2517 | const bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0; |
| 2518 | |
| 2519 | if (!sv) |
| 2520 | DIE(aTHX_ "Not a CODE reference"); |
| 2521 | switch (SvTYPE(sv)) { |
| 2522 | /* This is overwhelming the most common case: */ |
| 2523 | case SVt_PVGV: |
| 2524 | we_have_a_glob: |
| 2525 | if (!(cv = GvCVu((const GV *)sv))) { |
| 2526 | HV *stash; |
| 2527 | cv = sv_2cv(sv, &stash, &gv, 0); |
| 2528 | } |
| 2529 | if (!cv) { |
| 2530 | ENTER; |
| 2531 | SAVETMPS; |
| 2532 | goto try_autoload; |
| 2533 | } |
| 2534 | break; |
| 2535 | case SVt_PVLV: |
| 2536 | if(isGV_with_GP(sv)) goto we_have_a_glob; |
| 2537 | /*FALLTHROUGH*/ |
| 2538 | default: |
| 2539 | if (sv == &PL_sv_yes) { /* unfound import, ignore */ |
| 2540 | if (hasargs) |
| 2541 | SP = PL_stack_base + POPMARK; |
| 2542 | else |
| 2543 | (void)POPMARK; |
| 2544 | RETURN; |
| 2545 | } |
| 2546 | SvGETMAGIC(sv); |
| 2547 | if (SvROK(sv)) { |
| 2548 | if (SvAMAGIC(sv)) { |
| 2549 | sv = amagic_deref_call(sv, to_cv_amg); |
| 2550 | /* Don't SPAGAIN here. */ |
| 2551 | } |
| 2552 | } |
| 2553 | else { |
| 2554 | const char *sym; |
| 2555 | STRLEN len; |
| 2556 | if (!SvOK(sv)) |
| 2557 | DIE(aTHX_ PL_no_usym, "a subroutine"); |
| 2558 | sym = SvPV_nomg_const(sv, len); |
| 2559 | if (PL_op->op_private & HINT_STRICT_REFS) |
| 2560 | DIE(aTHX_ "Can't use string (\"%" SVf32 "\"%s) as a subroutine ref while \"strict refs\" in use", sv, len>32 ? "..." : ""); |
| 2561 | cv = get_cvn_flags(sym, len, GV_ADD|SvUTF8(sv)); |
| 2562 | break; |
| 2563 | } |
| 2564 | cv = MUTABLE_CV(SvRV(sv)); |
| 2565 | if (SvTYPE(cv) == SVt_PVCV) |
| 2566 | break; |
| 2567 | /* FALL THROUGH */ |
| 2568 | case SVt_PVHV: |
| 2569 | case SVt_PVAV: |
| 2570 | DIE(aTHX_ "Not a CODE reference"); |
| 2571 | /* This is the second most common case: */ |
| 2572 | case SVt_PVCV: |
| 2573 | cv = MUTABLE_CV(sv); |
| 2574 | break; |
| 2575 | } |
| 2576 | |
| 2577 | ENTER; |
| 2578 | |
| 2579 | retry: |
| 2580 | if (CvCLONE(cv) && ! CvCLONED(cv)) |
| 2581 | DIE(aTHX_ "Closure prototype called"); |
| 2582 | if (!CvROOT(cv) && !CvXSUB(cv)) { |
| 2583 | GV* autogv; |
| 2584 | SV* sub_name; |
| 2585 | |
| 2586 | /* anonymous or undef'd function leaves us no recourse */ |
| 2587 | if (CvANON(cv) || !(gv = CvGV(cv))) { |
| 2588 | if (CvNAMED(cv)) |
| 2589 | DIE(aTHX_ "Undefined subroutine &%"HEKf" called", |
| 2590 | HEKfARG(CvNAME_HEK(cv))); |
| 2591 | DIE(aTHX_ "Undefined subroutine called"); |
| 2592 | } |
| 2593 | |
| 2594 | /* autoloaded stub? */ |
| 2595 | if (cv != GvCV(gv)) { |
| 2596 | cv = GvCV(gv); |
| 2597 | } |
| 2598 | /* should call AUTOLOAD now? */ |
| 2599 | else { |
| 2600 | try_autoload: |
| 2601 | if ((autogv = gv_autoload_pvn(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv), |
| 2602 | GvNAMEUTF8(gv) ? SVf_UTF8 : 0))) |
| 2603 | { |
| 2604 | cv = GvCV(autogv); |
| 2605 | } |
| 2606 | else { |
| 2607 | sorry: |
| 2608 | sub_name = sv_newmortal(); |
| 2609 | gv_efullname3(sub_name, gv, NULL); |
| 2610 | DIE(aTHX_ "Undefined subroutine &%"SVf" called", SVfARG(sub_name)); |
| 2611 | } |
| 2612 | } |
| 2613 | if (!cv) |
| 2614 | goto sorry; |
| 2615 | goto retry; |
| 2616 | } |
| 2617 | |
| 2618 | gimme = GIMME_V; |
| 2619 | if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) { |
| 2620 | Perl_get_db_sub(aTHX_ &sv, cv); |
| 2621 | if (CvISXSUB(cv)) |
| 2622 | PL_curcopdb = PL_curcop; |
| 2623 | if (CvLVALUE(cv)) { |
| 2624 | /* check for lsub that handles lvalue subroutines */ |
| 2625 | cv = GvCV(gv_HVadd(gv_fetchpvs("DB::lsub", GV_ADDMULTI, SVt_PVHV))); |
| 2626 | /* if lsub not found then fall back to DB::sub */ |
| 2627 | if (!cv) cv = GvCV(PL_DBsub); |
| 2628 | } else { |
| 2629 | cv = GvCV(PL_DBsub); |
| 2630 | } |
| 2631 | |
| 2632 | if (!cv || (!CvXSUB(cv) && !CvSTART(cv))) |
| 2633 | DIE(aTHX_ "No DB::sub routine defined"); |
| 2634 | } |
| 2635 | |
| 2636 | if (!(CvISXSUB(cv))) { |
| 2637 | /* This path taken at least 75% of the time */ |
| 2638 | dMARK; |
| 2639 | SSize_t items = SP - MARK; |
| 2640 | PADLIST * const padlist = CvPADLIST(cv); |
| 2641 | PUSHBLOCK(cx, CXt_SUB, MARK); |
| 2642 | PUSHSUB(cx); |
| 2643 | cx->blk_sub.retop = PL_op->op_next; |
| 2644 | CvDEPTH(cv)++; |
| 2645 | if (CvDEPTH(cv) >= 2) { |
| 2646 | PERL_STACK_OVERFLOW_CHECK(); |
| 2647 | pad_push(padlist, CvDEPTH(cv)); |
| 2648 | } |
| 2649 | SAVECOMPPAD(); |
| 2650 | PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv)); |
| 2651 | if (hasargs) { |
| 2652 | AV *const av = MUTABLE_AV(PAD_SVl(0)); |
| 2653 | if (AvREAL(av)) { |
| 2654 | /* @_ is normally not REAL--this should only ever |
| 2655 | * happen when DB::sub() calls things that modify @_ */ |
| 2656 | av_clear(av); |
| 2657 | AvREAL_off(av); |
| 2658 | AvREIFY_on(av); |
| 2659 | } |
| 2660 | cx->blk_sub.savearray = GvAV(PL_defgv); |
| 2661 | GvAV(PL_defgv) = MUTABLE_AV(SvREFCNT_inc_simple(av)); |
| 2662 | CX_CURPAD_SAVE(cx->blk_sub); |
| 2663 | cx->blk_sub.argarray = av; |
| 2664 | ++MARK; |
| 2665 | |
| 2666 | if (items - 1 > AvMAX(av)) { |
| 2667 | SV **ary = AvALLOC(av); |
| 2668 | AvMAX(av) = items - 1; |
| 2669 | Renew(ary, items, SV*); |
| 2670 | AvALLOC(av) = ary; |
| 2671 | AvARRAY(av) = ary; |
| 2672 | } |
| 2673 | |
| 2674 | Copy(MARK,AvARRAY(av),items,SV*); |
| 2675 | AvFILLp(av) = items - 1; |
| 2676 | |
| 2677 | MARK = AvARRAY(av); |
| 2678 | while (items--) { |
| 2679 | if (*MARK) |
| 2680 | { |
| 2681 | if (SvPADTMP(*MARK) && !IS_PADGV(*MARK)) |
| 2682 | *MARK = sv_mortalcopy(*MARK); |
| 2683 | SvTEMP_off(*MARK); |
| 2684 | } |
| 2685 | MARK++; |
| 2686 | } |
| 2687 | } |
| 2688 | SAVETMPS; |
| 2689 | if ((cx->blk_u16 & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO && |
| 2690 | !CvLVALUE(cv)) |
| 2691 | DIE(aTHX_ "Can't modify non-lvalue subroutine call"); |
| 2692 | /* warning must come *after* we fully set up the context |
| 2693 | * stuff so that __WARN__ handlers can safely dounwind() |
| 2694 | * if they want to |
| 2695 | */ |
| 2696 | if (CvDEPTH(cv) == PERL_SUB_DEPTH_WARN && ckWARN(WARN_RECURSION) |
| 2697 | && !(PERLDB_SUB && cv == GvCV(PL_DBsub))) |
| 2698 | sub_crush_depth(cv); |
| 2699 | RETURNOP(CvSTART(cv)); |
| 2700 | } |
| 2701 | else { |
| 2702 | SSize_t markix = TOPMARK; |
| 2703 | |
| 2704 | SAVETMPS; |
| 2705 | PUTBACK; |
| 2706 | |
| 2707 | if (((PL_op->op_private |
| 2708 | & PUSHSUB_GET_LVALUE_MASK(Perl_is_lvalue_sub) |
| 2709 | ) & OPpENTERSUB_LVAL_MASK) == OPpLVAL_INTRO && |
| 2710 | !CvLVALUE(cv)) |
| 2711 | DIE(aTHX_ "Can't modify non-lvalue subroutine call"); |
| 2712 | |
| 2713 | if (!hasargs && GvAV(PL_defgv)) { |
| 2714 | /* Need to copy @_ to stack. Alternative may be to |
| 2715 | * switch stack to @_, and copy return values |
| 2716 | * back. This would allow popping @_ in XSUB, e.g.. XXXX */ |
| 2717 | AV * const av = GvAV(PL_defgv); |
| 2718 | const SSize_t items = AvFILL(av) + 1; |
| 2719 | |
| 2720 | if (items) { |
| 2721 | SSize_t i = 0; |
| 2722 | const bool m = cBOOL(SvRMAGICAL(av)); |
| 2723 | /* Mark is at the end of the stack. */ |
| 2724 | EXTEND(SP, items); |
| 2725 | for (; i < items; ++i) |
| 2726 | { |
| 2727 | SV *sv; |
| 2728 | if (m) { |
| 2729 | SV ** const svp = av_fetch(av, i, 0); |
| 2730 | sv = svp ? *svp : NULL; |
| 2731 | } |
| 2732 | else sv = AvARRAY(av)[i]; |
| 2733 | if (sv) SP[i+1] = sv; |
| 2734 | else { |
| 2735 | SP[i+1] = newSVavdefelem(av, i, 1); |
| 2736 | } |
| 2737 | } |
| 2738 | SP += items; |
| 2739 | PUTBACK ; |
| 2740 | } |
| 2741 | } |
| 2742 | else { |
| 2743 | SV **mark = PL_stack_base + markix; |
| 2744 | SSize_t items = SP - mark; |
| 2745 | while (items--) { |
| 2746 | mark++; |
| 2747 | if (*mark && SvPADTMP(*mark) && !IS_PADGV(*mark)) |
| 2748 | *mark = sv_mortalcopy(*mark); |
| 2749 | } |
| 2750 | } |
| 2751 | /* We assume first XSUB in &DB::sub is the called one. */ |
| 2752 | if (PL_curcopdb) { |
| 2753 | SAVEVPTR(PL_curcop); |
| 2754 | PL_curcop = PL_curcopdb; |
| 2755 | PL_curcopdb = NULL; |
| 2756 | } |
| 2757 | /* Do we need to open block here? XXXX */ |
| 2758 | |
| 2759 | /* CvXSUB(cv) must not be NULL because newXS() refuses NULL xsub address */ |
| 2760 | assert(CvXSUB(cv)); |
| 2761 | CvXSUB(cv)(aTHX_ cv); |
| 2762 | |
| 2763 | /* Enforce some sanity in scalar context. */ |
| 2764 | if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) { |
| 2765 | if (markix > PL_stack_sp - PL_stack_base) |
| 2766 | *(PL_stack_base + markix) = &PL_sv_undef; |
| 2767 | else |
| 2768 | *(PL_stack_base + markix) = *PL_stack_sp; |
| 2769 | PL_stack_sp = PL_stack_base + markix; |
| 2770 | } |
| 2771 | LEAVE; |
| 2772 | return NORMAL; |
| 2773 | } |
| 2774 | } |
| 2775 | |
| 2776 | void |
| 2777 | Perl_sub_crush_depth(pTHX_ CV *cv) |
| 2778 | { |
| 2779 | PERL_ARGS_ASSERT_SUB_CRUSH_DEPTH; |
| 2780 | |
| 2781 | if (CvANON(cv)) |
| 2782 | Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on anonymous subroutine"); |
| 2783 | else { |
| 2784 | HEK *const hek = CvNAME_HEK(cv); |
| 2785 | SV *tmpstr; |
| 2786 | if (hek) { |
| 2787 | tmpstr = sv_2mortal(newSVhek(hek)); |
| 2788 | } |
| 2789 | else { |
| 2790 | tmpstr = sv_newmortal(); |
| 2791 | gv_efullname3(tmpstr, CvGV(cv), NULL); |
| 2792 | } |
| 2793 | Perl_warner(aTHX_ packWARN(WARN_RECURSION), "Deep recursion on subroutine \"%"SVf"\"", |
| 2794 | SVfARG(tmpstr)); |
| 2795 | } |
| 2796 | } |
| 2797 | |
| 2798 | PP(pp_aelem) |
| 2799 | { |
| 2800 | dVAR; dSP; |
| 2801 | SV** svp; |
| 2802 | SV* const elemsv = POPs; |
| 2803 | IV elem = SvIV(elemsv); |
| 2804 | AV *const av = MUTABLE_AV(POPs); |
| 2805 | const U32 lval = PL_op->op_flags & OPf_MOD || LVRET; |
| 2806 | const U32 defer = PL_op->op_private & OPpLVAL_DEFER; |
| 2807 | const bool localizing = PL_op->op_private & OPpLVAL_INTRO; |
| 2808 | bool preeminent = TRUE; |
| 2809 | SV *sv; |
| 2810 | |
| 2811 | if (SvROK(elemsv) && !SvGAMAGIC(elemsv) && ckWARN(WARN_MISC)) |
| 2812 | Perl_warner(aTHX_ packWARN(WARN_MISC), |
| 2813 | "Use of reference \"%"SVf"\" as array index", |
| 2814 | SVfARG(elemsv)); |
| 2815 | if (SvTYPE(av) != SVt_PVAV) |
| 2816 | RETPUSHUNDEF; |
| 2817 | |
| 2818 | if (localizing) { |
| 2819 | MAGIC *mg; |
| 2820 | HV *stash; |
| 2821 | |
| 2822 | /* If we can determine whether the element exist, |
| 2823 | * Try to preserve the existenceness of a tied array |
| 2824 | * element by using EXISTS and DELETE if possible. |
| 2825 | * Fallback to FETCH and STORE otherwise. */ |
| 2826 | if (SvCANEXISTDELETE(av)) |
| 2827 | preeminent = av_exists(av, elem); |
| 2828 | } |
| 2829 | |
| 2830 | svp = av_fetch(av, elem, lval && !defer); |
| 2831 | if (lval) { |
| 2832 | #ifdef PERL_MALLOC_WRAP |
| 2833 | if (SvUOK(elemsv)) { |
| 2834 | const UV uv = SvUV(elemsv); |
| 2835 | elem = uv > IV_MAX ? IV_MAX : uv; |
| 2836 | } |
| 2837 | else if (SvNOK(elemsv)) |
| 2838 | elem = (IV)SvNV(elemsv); |
| 2839 | if (elem > 0) { |
| 2840 | static const char oom_array_extend[] = |
| 2841 | "Out of memory during array extend"; /* Duplicated in av.c */ |
| 2842 | MEM_WRAP_CHECK_1(elem,SV*,oom_array_extend); |
| 2843 | } |
| 2844 | #endif |
| 2845 | if (!svp || !*svp) { |
| 2846 | IV len; |
| 2847 | if (!defer) |
| 2848 | DIE(aTHX_ PL_no_aelem, elem); |
| 2849 | len = av_len(av); |
| 2850 | mPUSHs(newSVavdefelem(av, |
| 2851 | /* Resolve a negative index now, unless it points before the |
| 2852 | beginning of the array, in which case record it for error |
| 2853 | reporting in magic_setdefelem. */ |
| 2854 | elem < 0 && len + elem >= 0 ? len + elem : elem, |
| 2855 | 1)); |
| 2856 | RETURN; |
| 2857 | } |
| 2858 | if (localizing) { |
| 2859 | if (preeminent) |
| 2860 | save_aelem(av, elem, svp); |
| 2861 | else |
| 2862 | SAVEADELETE(av, elem); |
| 2863 | } |
| 2864 | else if (PL_op->op_private & OPpDEREF) { |
| 2865 | PUSHs(vivify_ref(*svp, PL_op->op_private & OPpDEREF)); |
| 2866 | RETURN; |
| 2867 | } |
| 2868 | } |
| 2869 | sv = (svp ? *svp : &PL_sv_undef); |
| 2870 | if (!lval && SvRMAGICAL(av) && SvGMAGICAL(sv)) /* see note in pp_helem() */ |
| 2871 | mg_get(sv); |
| 2872 | PUSHs(sv); |
| 2873 | RETURN; |
| 2874 | } |
| 2875 | |
| 2876 | SV* |
| 2877 | Perl_vivify_ref(pTHX_ SV *sv, U32 to_what) |
| 2878 | { |
| 2879 | PERL_ARGS_ASSERT_VIVIFY_REF; |
| 2880 | |
| 2881 | SvGETMAGIC(sv); |
| 2882 | if (!SvOK(sv)) { |
| 2883 | if (SvREADONLY(sv)) |
| 2884 | Perl_croak_no_modify(); |
| 2885 | prepare_SV_for_RV(sv); |
| 2886 | switch (to_what) { |
| 2887 | case OPpDEREF_SV: |
| 2888 | SvRV_set(sv, newSV(0)); |
| 2889 | break; |
| 2890 | case OPpDEREF_AV: |
| 2891 | SvRV_set(sv, MUTABLE_SV(newAV())); |
| 2892 | break; |
| 2893 | case OPpDEREF_HV: |
| 2894 | SvRV_set(sv, MUTABLE_SV(newHV())); |
| 2895 | break; |
| 2896 | } |
| 2897 | SvROK_on(sv); |
| 2898 | SvSETMAGIC(sv); |
| 2899 | SvGETMAGIC(sv); |
| 2900 | } |
| 2901 | if (SvGMAGICAL(sv)) { |
| 2902 | /* copy the sv without magic to prevent magic from being |
| 2903 | executed twice */ |
| 2904 | SV* msv = sv_newmortal(); |
| 2905 | sv_setsv_nomg(msv, sv); |
| 2906 | return msv; |
| 2907 | } |
| 2908 | return sv; |
| 2909 | } |
| 2910 | |
| 2911 | PP(pp_method) |
| 2912 | { |
| 2913 | dVAR; dSP; |
| 2914 | SV* const sv = TOPs; |
| 2915 | |
| 2916 | if (SvROK(sv)) { |
| 2917 | SV* const rsv = SvRV(sv); |
| 2918 | if (SvTYPE(rsv) == SVt_PVCV) { |
| 2919 | SETs(rsv); |
| 2920 | RETURN; |
| 2921 | } |
| 2922 | } |
| 2923 | |
| 2924 | SETs(method_common(sv, NULL)); |
| 2925 | RETURN; |
| 2926 | } |
| 2927 | |
| 2928 | PP(pp_method_named) |
| 2929 | { |
| 2930 | dVAR; dSP; |
| 2931 | SV* const sv = cSVOP_sv; |
| 2932 | U32 hash = SvSHARED_HASH(sv); |
| 2933 | |
| 2934 | XPUSHs(method_common(sv, &hash)); |
| 2935 | RETURN; |
| 2936 | } |
| 2937 | |
| 2938 | STATIC SV * |
| 2939 | S_method_common(pTHX_ SV* meth, U32* hashp) |
| 2940 | { |
| 2941 | dVAR; |
| 2942 | SV* ob; |
| 2943 | GV* gv; |
| 2944 | HV* stash; |
| 2945 | SV *packsv = NULL; |
| 2946 | SV * const sv = PL_stack_base + TOPMARK == PL_stack_sp |
| 2947 | ? (Perl_croak(aTHX_ "Can't call method \"%"SVf"\" without a " |
| 2948 | "package or object reference", SVfARG(meth)), |
| 2949 | (SV *)NULL) |
| 2950 | : *(PL_stack_base + TOPMARK + 1); |
| 2951 | |
| 2952 | PERL_ARGS_ASSERT_METHOD_COMMON; |
| 2953 | |
| 2954 | if (!sv) |
| 2955 | undefined: |
| 2956 | Perl_croak(aTHX_ "Can't call method \"%"SVf"\" on an undefined value", |
| 2957 | SVfARG(meth)); |
| 2958 | |
| 2959 | SvGETMAGIC(sv); |
| 2960 | if (SvROK(sv)) |
| 2961 | ob = MUTABLE_SV(SvRV(sv)); |
| 2962 | else if (!SvOK(sv)) goto undefined; |
| 2963 | else if (isGV_with_GP(sv)) { |
| 2964 | if (!GvIO(sv)) |
| 2965 | Perl_croak(aTHX_ "Can't call method \"%"SVf"\" " |
| 2966 | "without a package or object reference", |
| 2967 | SVfARG(meth)); |
| 2968 | ob = sv; |
| 2969 | if (SvTYPE(ob) == SVt_PVLV && LvTYPE(ob) == 'y') { |
| 2970 | assert(!LvTARGLEN(ob)); |
| 2971 | ob = LvTARG(ob); |
| 2972 | assert(ob); |
| 2973 | } |
| 2974 | *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV(ob)); |
| 2975 | } |
| 2976 | else { |
| 2977 | /* this isn't a reference */ |
| 2978 | GV* iogv; |
| 2979 | STRLEN packlen; |
| 2980 | const char * const packname = SvPV_nomg_const(sv, packlen); |
| 2981 | const bool packname_is_utf8 = !!SvUTF8(sv); |
| 2982 | const HE* const he = |
| 2983 | (const HE *)hv_common( |
| 2984 | PL_stashcache, NULL, packname, packlen, |
| 2985 | packname_is_utf8 ? HVhek_UTF8 : 0, 0, NULL, 0 |
| 2986 | ); |
| 2987 | |
| 2988 | if (he) { |
| 2989 | stash = INT2PTR(HV*,SvIV(HeVAL(he))); |
| 2990 | DEBUG_o(Perl_deb(aTHX_ "PL_stashcache hit %p for '%"SVf"'\n", |
| 2991 | stash, sv)); |
| 2992 | goto fetch; |
| 2993 | } |
| 2994 | |
| 2995 | if (!(iogv = gv_fetchpvn_flags( |
| 2996 | packname, packlen, SVf_UTF8 * packname_is_utf8, SVt_PVIO |
| 2997 | )) || |
| 2998 | !(ob=MUTABLE_SV(GvIO(iogv)))) |
| 2999 | { |
| 3000 | /* this isn't the name of a filehandle either */ |
| 3001 | if (!packlen) |
| 3002 | { |
| 3003 | Perl_croak(aTHX_ "Can't call method \"%"SVf"\" " |
| 3004 | "without a package or object reference", |
| 3005 | SVfARG(meth)); |
| 3006 | } |
| 3007 | /* assume it's a package name */ |
| 3008 | stash = gv_stashpvn(packname, packlen, packname_is_utf8 ? SVf_UTF8 : 0); |
| 3009 | if (!stash) |
| 3010 | packsv = sv; |
| 3011 | else { |
| 3012 | SV* const ref = newSViv(PTR2IV(stash)); |
| 3013 | (void)hv_store(PL_stashcache, packname, |
| 3014 | packname_is_utf8 ? -(I32)packlen : (I32)packlen, ref, 0); |
| 3015 | DEBUG_o(Perl_deb(aTHX_ "PL_stashcache caching %p for '%"SVf"'\n", |
| 3016 | stash, sv)); |
| 3017 | } |
| 3018 | goto fetch; |
| 3019 | } |
| 3020 | /* it _is_ a filehandle name -- replace with a reference */ |
| 3021 | *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV(MUTABLE_SV(iogv))); |
| 3022 | } |
| 3023 | |
| 3024 | /* if we got here, ob should be an object or a glob */ |
| 3025 | if (!ob || !(SvOBJECT(ob) |
| 3026 | || (isGV_with_GP(ob) |
| 3027 | && (ob = MUTABLE_SV(GvIO((const GV *)ob))) |
| 3028 | && SvOBJECT(ob)))) |
| 3029 | { |
| 3030 | Perl_croak(aTHX_ "Can't call method \"%"SVf"\" on unblessed reference", |
| 3031 | SVfARG((SvSCREAM(meth) && strEQ(SvPV_nolen_const(meth),"isa")) |
| 3032 | ? newSVpvs_flags("DOES", SVs_TEMP) |
| 3033 | : meth)); |
| 3034 | } |
| 3035 | |
| 3036 | stash = SvSTASH(ob); |
| 3037 | |
| 3038 | fetch: |
| 3039 | /* NOTE: stash may be null, hope hv_fetch_ent and |
| 3040 | gv_fetchmethod can cope (it seems they can) */ |
| 3041 | |
| 3042 | /* shortcut for simple names */ |
| 3043 | if (hashp) { |
| 3044 | const HE* const he = hv_fetch_ent(stash, meth, 0, *hashp); |
| 3045 | if (he) { |
| 3046 | gv = MUTABLE_GV(HeVAL(he)); |
| 3047 | if (isGV(gv) && GvCV(gv) && |
| 3048 | (!GvCVGEN(gv) || GvCVGEN(gv) |
| 3049 | == (PL_sub_generation + HvMROMETA(stash)->cache_gen))) |
| 3050 | return MUTABLE_SV(GvCV(gv)); |
| 3051 | } |
| 3052 | } |
| 3053 | |
| 3054 | gv = gv_fetchmethod_sv_flags(stash ? stash : MUTABLE_HV(packsv), |
| 3055 | meth, GV_AUTOLOAD | GV_CROAK); |
| 3056 | |
| 3057 | assert(gv); |
| 3058 | |
| 3059 | return isGV(gv) ? MUTABLE_SV(GvCV(gv)) : MUTABLE_SV(gv); |
| 3060 | } |
| 3061 | |
| 3062 | /* |
| 3063 | * Local variables: |
| 3064 | * c-indentation-style: bsd |
| 3065 | * c-basic-offset: 4 |
| 3066 | * indent-tabs-mode: nil |
| 3067 | * End: |
| 3068 | * |
| 3069 | * ex: set ts=8 sts=4 sw=4 et: |
| 3070 | */ |