| 1 | /* pp_hot.c |
| 2 | * |
| 3 | * Copyright (c) 1991-1999, Larry Wall |
| 4 | * |
| 5 | * You may distribute under the terms of either the GNU General Public |
| 6 | * License or the Artistic License, as specified in the README file. |
| 7 | * |
| 8 | */ |
| 9 | |
| 10 | /* |
| 11 | * Then he heard Merry change the note, and up went the Horn-cry of Buckland, |
| 12 | * shaking the air. |
| 13 | * |
| 14 | * Awake! Awake! Fear, Fire, Foes! Awake! |
| 15 | * Fire, Foes! Awake! |
| 16 | */ |
| 17 | |
| 18 | #include "EXTERN.h" |
| 19 | #define PERL_IN_PP_HOT_C |
| 20 | #include "perl.h" |
| 21 | |
| 22 | #ifdef I_UNISTD |
| 23 | #include <unistd.h> |
| 24 | #endif |
| 25 | #ifdef I_FCNTL |
| 26 | #include <fcntl.h> |
| 27 | #endif |
| 28 | #ifdef I_SYS_FILE |
| 29 | #include <sys/file.h> |
| 30 | #endif |
| 31 | |
| 32 | #define HOP(pos,off) (IN_UTF8 ? utf8_hop(pos, off) : (pos + off)) |
| 33 | |
| 34 | /* Hot code. */ |
| 35 | |
| 36 | #ifdef USE_THREADS |
| 37 | static void unset_cvowner(pTHXo_ void *cvarg); |
| 38 | #endif /* USE_THREADS */ |
| 39 | |
| 40 | PP(pp_const) |
| 41 | { |
| 42 | djSP; |
| 43 | XPUSHs(cSVOP->op_sv); |
| 44 | RETURN; |
| 45 | } |
| 46 | |
| 47 | PP(pp_nextstate) |
| 48 | { |
| 49 | PL_curcop = (COP*)PL_op; |
| 50 | TAINT_NOT; /* Each statement is presumed innocent */ |
| 51 | PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; |
| 52 | FREETMPS; |
| 53 | return NORMAL; |
| 54 | } |
| 55 | |
| 56 | PP(pp_gvsv) |
| 57 | { |
| 58 | djSP; |
| 59 | EXTEND(SP,1); |
| 60 | if (PL_op->op_private & OPpLVAL_INTRO) |
| 61 | PUSHs(save_scalar(cGVOP->op_gv)); |
| 62 | else |
| 63 | PUSHs(GvSV(cGVOP->op_gv)); |
| 64 | RETURN; |
| 65 | } |
| 66 | |
| 67 | PP(pp_null) |
| 68 | { |
| 69 | return NORMAL; |
| 70 | } |
| 71 | |
| 72 | PP(pp_setstate) |
| 73 | { |
| 74 | PL_curcop = (COP*)PL_op; |
| 75 | return NORMAL; |
| 76 | } |
| 77 | |
| 78 | PP(pp_pushmark) |
| 79 | { |
| 80 | PUSHMARK(PL_stack_sp); |
| 81 | return NORMAL; |
| 82 | } |
| 83 | |
| 84 | PP(pp_stringify) |
| 85 | { |
| 86 | djSP; dTARGET; |
| 87 | STRLEN len; |
| 88 | char *s; |
| 89 | s = SvPV(TOPs,len); |
| 90 | sv_setpvn(TARG,s,len); |
| 91 | SETTARG; |
| 92 | RETURN; |
| 93 | } |
| 94 | |
| 95 | PP(pp_gv) |
| 96 | { |
| 97 | djSP; |
| 98 | XPUSHs((SV*)cGVOP->op_gv); |
| 99 | RETURN; |
| 100 | } |
| 101 | |
| 102 | PP(pp_and) |
| 103 | { |
| 104 | djSP; |
| 105 | if (!SvTRUE(TOPs)) |
| 106 | RETURN; |
| 107 | else { |
| 108 | --SP; |
| 109 | RETURNOP(cLOGOP->op_other); |
| 110 | } |
| 111 | } |
| 112 | |
| 113 | PP(pp_sassign) |
| 114 | { |
| 115 | djSP; dPOPTOPssrl; |
| 116 | MAGIC *mg; |
| 117 | |
| 118 | if (PL_op->op_private & OPpASSIGN_BACKWARDS) { |
| 119 | SV *temp; |
| 120 | temp = left; left = right; right = temp; |
| 121 | } |
| 122 | if (PL_tainting && PL_tainted && !SvTAINTED(left)) |
| 123 | TAINT_NOT; |
| 124 | SvSetMagicSV(right, left); |
| 125 | SETs(right); |
| 126 | RETURN; |
| 127 | } |
| 128 | |
| 129 | PP(pp_cond_expr) |
| 130 | { |
| 131 | djSP; |
| 132 | if (SvTRUEx(POPs)) |
| 133 | RETURNOP(cLOGOP->op_other); |
| 134 | else |
| 135 | RETURNOP(cLOGOP->op_next); |
| 136 | } |
| 137 | |
| 138 | PP(pp_unstack) |
| 139 | { |
| 140 | I32 oldsave; |
| 141 | TAINT_NOT; /* Each statement is presumed innocent */ |
| 142 | PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp; |
| 143 | FREETMPS; |
| 144 | oldsave = PL_scopestack[PL_scopestack_ix - 1]; |
| 145 | LEAVE_SCOPE(oldsave); |
| 146 | return NORMAL; |
| 147 | } |
| 148 | |
| 149 | PP(pp_concat) |
| 150 | { |
| 151 | djSP; dATARGET; tryAMAGICbin(concat,opASSIGN); |
| 152 | { |
| 153 | dPOPTOPssrl; |
| 154 | STRLEN len; |
| 155 | char *s; |
| 156 | if (TARG != left) { |
| 157 | s = SvPV(left,len); |
| 158 | sv_setpvn(TARG,s,len); |
| 159 | } |
| 160 | else if (SvGMAGICAL(TARG)) |
| 161 | mg_get(TARG); |
| 162 | else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) { |
| 163 | sv_setpv(TARG, ""); /* Suppress warning. */ |
| 164 | s = SvPV_force(TARG, len); |
| 165 | } |
| 166 | s = SvPV(right,len); |
| 167 | if (SvOK(TARG)) |
| 168 | sv_catpvn(TARG,s,len); |
| 169 | else |
| 170 | sv_setpvn(TARG,s,len); /* suppress warning */ |
| 171 | SETTARG; |
| 172 | RETURN; |
| 173 | } |
| 174 | } |
| 175 | |
| 176 | PP(pp_padsv) |
| 177 | { |
| 178 | djSP; dTARGET; |
| 179 | XPUSHs(TARG); |
| 180 | if (PL_op->op_flags & OPf_MOD) { |
| 181 | if (PL_op->op_private & OPpLVAL_INTRO) |
| 182 | SAVECLEARSV(PL_curpad[PL_op->op_targ]); |
| 183 | else if (PL_op->op_private & OPpDEREF) { |
| 184 | PUTBACK; |
| 185 | vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF); |
| 186 | SPAGAIN; |
| 187 | } |
| 188 | } |
| 189 | RETURN; |
| 190 | } |
| 191 | |
| 192 | PP(pp_readline) |
| 193 | { |
| 194 | tryAMAGICunTARGET(iter, 0); |
| 195 | PL_last_in_gv = (GV*)(*PL_stack_sp--); |
| 196 | if (SvTYPE(PL_last_in_gv) != SVt_PVGV) { |
| 197 | if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV) |
| 198 | PL_last_in_gv = (GV*)SvRV(PL_last_in_gv); |
| 199 | else { |
| 200 | dSP; |
| 201 | XPUSHs((SV*)PL_last_in_gv); |
| 202 | PUTBACK; |
| 203 | pp_rv2gv(); |
| 204 | PL_last_in_gv = (GV*)(*PL_stack_sp--); |
| 205 | } |
| 206 | } |
| 207 | return do_readline(); |
| 208 | } |
| 209 | |
| 210 | PP(pp_eq) |
| 211 | { |
| 212 | djSP; tryAMAGICbinSET(eq,0); |
| 213 | { |
| 214 | dPOPnv; |
| 215 | SETs(boolSV(TOPn == value)); |
| 216 | RETURN; |
| 217 | } |
| 218 | } |
| 219 | |
| 220 | PP(pp_preinc) |
| 221 | { |
| 222 | djSP; |
| 223 | if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV) |
| 224 | Perl_croak(aTHX_ PL_no_modify); |
| 225 | if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) && |
| 226 | SvIVX(TOPs) != IV_MAX) |
| 227 | { |
| 228 | ++SvIVX(TOPs); |
| 229 | SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK); |
| 230 | } |
| 231 | else |
| 232 | sv_inc(TOPs); |
| 233 | SvSETMAGIC(TOPs); |
| 234 | return NORMAL; |
| 235 | } |
| 236 | |
| 237 | PP(pp_or) |
| 238 | { |
| 239 | djSP; |
| 240 | if (SvTRUE(TOPs)) |
| 241 | RETURN; |
| 242 | else { |
| 243 | --SP; |
| 244 | RETURNOP(cLOGOP->op_other); |
| 245 | } |
| 246 | } |
| 247 | |
| 248 | PP(pp_add) |
| 249 | { |
| 250 | djSP; dATARGET; tryAMAGICbin(add,opASSIGN); |
| 251 | { |
| 252 | dPOPTOPnnrl_ul; |
| 253 | SETn( left + right ); |
| 254 | RETURN; |
| 255 | } |
| 256 | } |
| 257 | |
| 258 | PP(pp_aelemfast) |
| 259 | { |
| 260 | djSP; |
| 261 | AV *av = GvAV((GV*)cSVOP->op_sv); |
| 262 | U32 lval = PL_op->op_flags & OPf_MOD; |
| 263 | SV** svp = av_fetch(av, PL_op->op_private, lval); |
| 264 | SV *sv = (svp ? *svp : &PL_sv_undef); |
| 265 | EXTEND(SP, 1); |
| 266 | if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */ |
| 267 | sv = sv_mortalcopy(sv); |
| 268 | PUSHs(sv); |
| 269 | RETURN; |
| 270 | } |
| 271 | |
| 272 | PP(pp_join) |
| 273 | { |
| 274 | djSP; dMARK; dTARGET; |
| 275 | MARK++; |
| 276 | do_join(TARG, *MARK, MARK, SP); |
| 277 | SP = MARK; |
| 278 | SETs(TARG); |
| 279 | RETURN; |
| 280 | } |
| 281 | |
| 282 | PP(pp_pushre) |
| 283 | { |
| 284 | djSP; |
| 285 | #ifdef DEBUGGING |
| 286 | /* |
| 287 | * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs |
| 288 | * will be enough to hold an OP*. |
| 289 | */ |
| 290 | SV* sv = sv_newmortal(); |
| 291 | sv_upgrade(sv, SVt_PVLV); |
| 292 | LvTYPE(sv) = '/'; |
| 293 | Copy(&PL_op, &LvTARGOFF(sv), 1, OP*); |
| 294 | XPUSHs(sv); |
| 295 | #else |
| 296 | XPUSHs((SV*)PL_op); |
| 297 | #endif |
| 298 | RETURN; |
| 299 | } |
| 300 | |
| 301 | /* Oversized hot code. */ |
| 302 | |
| 303 | PP(pp_print) |
| 304 | { |
| 305 | djSP; dMARK; dORIGMARK; |
| 306 | GV *gv; |
| 307 | IO *io; |
| 308 | register PerlIO *fp; |
| 309 | MAGIC *mg; |
| 310 | STRLEN n_a; |
| 311 | |
| 312 | if (PL_op->op_flags & OPf_STACKED) |
| 313 | gv = (GV*)*++MARK; |
| 314 | else |
| 315 | gv = PL_defoutgv; |
| 316 | if (mg = SvTIED_mg((SV*)gv, 'q')) { |
| 317 | if (MARK == ORIGMARK) { |
| 318 | /* If using default handle then we need to make space to |
| 319 | * pass object as 1st arg, so move other args up ... |
| 320 | */ |
| 321 | MEXTEND(SP, 1); |
| 322 | ++MARK; |
| 323 | Move(MARK, MARK + 1, (SP - MARK) + 1, SV*); |
| 324 | ++SP; |
| 325 | } |
| 326 | PUSHMARK(MARK - 1); |
| 327 | *MARK = SvTIED_obj((SV*)gv, mg); |
| 328 | PUTBACK; |
| 329 | ENTER; |
| 330 | call_method("PRINT", G_SCALAR); |
| 331 | LEAVE; |
| 332 | SPAGAIN; |
| 333 | MARK = ORIGMARK + 1; |
| 334 | *MARK = *SP; |
| 335 | SP = MARK; |
| 336 | RETURN; |
| 337 | } |
| 338 | if (!(io = GvIO(gv))) { |
| 339 | if (ckWARN(WARN_UNOPENED)) { |
| 340 | SV* sv = sv_newmortal(); |
| 341 | gv_efullname3(sv, gv, Nullch); |
| 342 | Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened", |
| 343 | SvPV(sv,n_a)); |
| 344 | } |
| 345 | SETERRNO(EBADF,RMS$_IFI); |
| 346 | goto just_say_no; |
| 347 | } |
| 348 | else if (!(fp = IoOFP(io))) { |
| 349 | if (ckWARN2(WARN_CLOSED, WARN_IO)) { |
| 350 | SV* sv = sv_newmortal(); |
| 351 | gv_efullname3(sv, gv, Nullch); |
| 352 | if (IoIFP(io)) |
| 353 | Perl_warner(aTHX_ WARN_IO, |
| 354 | "Filehandle %s opened only for input", |
| 355 | SvPV(sv,n_a)); |
| 356 | else if (ckWARN(WARN_CLOSED)) |
| 357 | Perl_warner(aTHX_ WARN_CLOSED, |
| 358 | "print on closed filehandle %s", SvPV(sv,n_a)); |
| 359 | } |
| 360 | SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI); |
| 361 | goto just_say_no; |
| 362 | } |
| 363 | else { |
| 364 | MARK++; |
| 365 | if (PL_ofslen) { |
| 366 | while (MARK <= SP) { |
| 367 | if (!do_print(*MARK, fp)) |
| 368 | break; |
| 369 | MARK++; |
| 370 | if (MARK <= SP) { |
| 371 | if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) { |
| 372 | MARK--; |
| 373 | break; |
| 374 | } |
| 375 | } |
| 376 | } |
| 377 | } |
| 378 | else { |
| 379 | while (MARK <= SP) { |
| 380 | if (!do_print(*MARK, fp)) |
| 381 | break; |
| 382 | MARK++; |
| 383 | } |
| 384 | } |
| 385 | if (MARK <= SP) |
| 386 | goto just_say_no; |
| 387 | else { |
| 388 | if (PL_orslen) |
| 389 | if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp)) |
| 390 | goto just_say_no; |
| 391 | |
| 392 | if (IoFLAGS(io) & IOf_FLUSH) |
| 393 | if (PerlIO_flush(fp) == EOF) |
| 394 | goto just_say_no; |
| 395 | } |
| 396 | } |
| 397 | SP = ORIGMARK; |
| 398 | PUSHs(&PL_sv_yes); |
| 399 | RETURN; |
| 400 | |
| 401 | just_say_no: |
| 402 | SP = ORIGMARK; |
| 403 | PUSHs(&PL_sv_undef); |
| 404 | RETURN; |
| 405 | } |
| 406 | |
| 407 | PP(pp_rv2av) |
| 408 | { |
| 409 | djSP; dTOPss; |
| 410 | AV *av; |
| 411 | |
| 412 | if (SvROK(sv)) { |
| 413 | wasref: |
| 414 | tryAMAGICunDEREF(to_av); |
| 415 | |
| 416 | av = (AV*)SvRV(sv); |
| 417 | if (SvTYPE(av) != SVt_PVAV) |
| 418 | DIE(aTHX_ "Not an ARRAY reference"); |
| 419 | if (PL_op->op_flags & OPf_REF) { |
| 420 | SETs((SV*)av); |
| 421 | RETURN; |
| 422 | } |
| 423 | } |
| 424 | else { |
| 425 | if (SvTYPE(sv) == SVt_PVAV) { |
| 426 | av = (AV*)sv; |
| 427 | if (PL_op->op_flags & OPf_REF) { |
| 428 | SETs((SV*)av); |
| 429 | RETURN; |
| 430 | } |
| 431 | } |
| 432 | else { |
| 433 | GV *gv; |
| 434 | |
| 435 | if (SvTYPE(sv) != SVt_PVGV) { |
| 436 | char *sym; |
| 437 | STRLEN n_a; |
| 438 | |
| 439 | if (SvGMAGICAL(sv)) { |
| 440 | mg_get(sv); |
| 441 | if (SvROK(sv)) |
| 442 | goto wasref; |
| 443 | } |
| 444 | if (!SvOK(sv)) { |
| 445 | if (PL_op->op_flags & OPf_REF || |
| 446 | PL_op->op_private & HINT_STRICT_REFS) |
| 447 | DIE(aTHX_ PL_no_usym, "an ARRAY"); |
| 448 | if (ckWARN(WARN_UNINITIALIZED)) |
| 449 | Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit); |
| 450 | if (GIMME == G_ARRAY) { |
| 451 | (void)POPs; |
| 452 | RETURN; |
| 453 | } |
| 454 | RETSETUNDEF; |
| 455 | } |
| 456 | sym = SvPV(sv,n_a); |
| 457 | if ((PL_op->op_flags & OPf_SPECIAL) && |
| 458 | !(PL_op->op_flags & OPf_MOD)) |
| 459 | { |
| 460 | gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV); |
| 461 | if (!gv) |
| 462 | RETSETUNDEF; |
| 463 | } |
| 464 | else { |
| 465 | if (PL_op->op_private & HINT_STRICT_REFS) |
| 466 | DIE(aTHX_ PL_no_symref, sym, "an ARRAY"); |
| 467 | gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV); |
| 468 | } |
| 469 | } |
| 470 | else { |
| 471 | gv = (GV*)sv; |
| 472 | } |
| 473 | av = GvAVn(gv); |
| 474 | if (PL_op->op_private & OPpLVAL_INTRO) |
| 475 | av = save_ary(gv); |
| 476 | if (PL_op->op_flags & OPf_REF) { |
| 477 | SETs((SV*)av); |
| 478 | RETURN; |
| 479 | } |
| 480 | } |
| 481 | } |
| 482 | |
| 483 | if (GIMME == G_ARRAY) { |
| 484 | I32 maxarg = AvFILL(av) + 1; |
| 485 | (void)POPs; /* XXXX May be optimized away? */ |
| 486 | EXTEND(SP, maxarg); |
| 487 | if (SvRMAGICAL(av)) { |
| 488 | U32 i; |
| 489 | for (i=0; i < maxarg; i++) { |
| 490 | SV **svp = av_fetch(av, i, FALSE); |
| 491 | SP[i+1] = (svp) ? *svp : &PL_sv_undef; |
| 492 | } |
| 493 | } |
| 494 | else { |
| 495 | Copy(AvARRAY(av), SP+1, maxarg, SV*); |
| 496 | } |
| 497 | SP += maxarg; |
| 498 | } |
| 499 | else { |
| 500 | dTARGET; |
| 501 | I32 maxarg = AvFILL(av) + 1; |
| 502 | SETi(maxarg); |
| 503 | } |
| 504 | RETURN; |
| 505 | } |
| 506 | |
| 507 | PP(pp_rv2hv) |
| 508 | { |
| 509 | djSP; dTOPss; |
| 510 | HV *hv; |
| 511 | |
| 512 | if (SvROK(sv)) { |
| 513 | wasref: |
| 514 | tryAMAGICunDEREF(to_hv); |
| 515 | |
| 516 | hv = (HV*)SvRV(sv); |
| 517 | if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV) |
| 518 | DIE(aTHX_ "Not a HASH reference"); |
| 519 | if (PL_op->op_flags & OPf_REF) { |
| 520 | SETs((SV*)hv); |
| 521 | RETURN; |
| 522 | } |
| 523 | } |
| 524 | else { |
| 525 | if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) { |
| 526 | hv = (HV*)sv; |
| 527 | if (PL_op->op_flags & OPf_REF) { |
| 528 | SETs((SV*)hv); |
| 529 | RETURN; |
| 530 | } |
| 531 | } |
| 532 | else { |
| 533 | GV *gv; |
| 534 | |
| 535 | if (SvTYPE(sv) != SVt_PVGV) { |
| 536 | char *sym; |
| 537 | STRLEN n_a; |
| 538 | |
| 539 | if (SvGMAGICAL(sv)) { |
| 540 | mg_get(sv); |
| 541 | if (SvROK(sv)) |
| 542 | goto wasref; |
| 543 | } |
| 544 | if (!SvOK(sv)) { |
| 545 | if (PL_op->op_flags & OPf_REF || |
| 546 | PL_op->op_private & HINT_STRICT_REFS) |
| 547 | DIE(aTHX_ PL_no_usym, "a HASH"); |
| 548 | if (ckWARN(WARN_UNINITIALIZED)) |
| 549 | Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit); |
| 550 | if (GIMME == G_ARRAY) { |
| 551 | SP--; |
| 552 | RETURN; |
| 553 | } |
| 554 | RETSETUNDEF; |
| 555 | } |
| 556 | sym = SvPV(sv,n_a); |
| 557 | if ((PL_op->op_flags & OPf_SPECIAL) && |
| 558 | !(PL_op->op_flags & OPf_MOD)) |
| 559 | { |
| 560 | gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV); |
| 561 | if (!gv) |
| 562 | RETSETUNDEF; |
| 563 | } |
| 564 | else { |
| 565 | if (PL_op->op_private & HINT_STRICT_REFS) |
| 566 | DIE(aTHX_ PL_no_symref, sym, "a HASH"); |
| 567 | gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV); |
| 568 | } |
| 569 | } |
| 570 | else { |
| 571 | gv = (GV*)sv; |
| 572 | } |
| 573 | hv = GvHVn(gv); |
| 574 | if (PL_op->op_private & OPpLVAL_INTRO) |
| 575 | hv = save_hash(gv); |
| 576 | if (PL_op->op_flags & OPf_REF) { |
| 577 | SETs((SV*)hv); |
| 578 | RETURN; |
| 579 | } |
| 580 | } |
| 581 | } |
| 582 | |
| 583 | if (GIMME == G_ARRAY) { /* array wanted */ |
| 584 | *PL_stack_sp = (SV*)hv; |
| 585 | return do_kv(); |
| 586 | } |
| 587 | else { |
| 588 | dTARGET; |
| 589 | if (SvTYPE(hv) == SVt_PVAV) |
| 590 | hv = avhv_keys((AV*)hv); |
| 591 | if (HvFILL(hv)) |
| 592 | #ifdef IV_IS_QUAD |
| 593 | Perl_sv_setpvf(aTHX_ TARG, "%" PERL_PRId64 "/%" PERL_PRId64, |
| 594 | (Quad_t)HvFILL(hv), (Quad_t)HvMAX(hv) + 1); |
| 595 | #else |
| 596 | Perl_sv_setpvf(aTHX_ TARG, "%ld/%ld", |
| 597 | (long)HvFILL(hv), (long)HvMAX(hv) + 1); |
| 598 | #endif |
| 599 | else |
| 600 | sv_setiv(TARG, 0); |
| 601 | |
| 602 | SETTARG; |
| 603 | RETURN; |
| 604 | } |
| 605 | } |
| 606 | |
| 607 | PP(pp_aassign) |
| 608 | { |
| 609 | djSP; |
| 610 | SV **lastlelem = PL_stack_sp; |
| 611 | SV **lastrelem = PL_stack_base + POPMARK; |
| 612 | SV **firstrelem = PL_stack_base + POPMARK + 1; |
| 613 | SV **firstlelem = lastrelem + 1; |
| 614 | |
| 615 | register SV **relem; |
| 616 | register SV **lelem; |
| 617 | |
| 618 | register SV *sv; |
| 619 | register AV *ary; |
| 620 | |
| 621 | I32 gimme; |
| 622 | HV *hash; |
| 623 | I32 i; |
| 624 | int magic; |
| 625 | |
| 626 | PL_delaymagic = DM_DELAY; /* catch simultaneous items */ |
| 627 | |
| 628 | /* If there's a common identifier on both sides we have to take |
| 629 | * special care that assigning the identifier on the left doesn't |
| 630 | * clobber a value on the right that's used later in the list. |
| 631 | */ |
| 632 | if (PL_op->op_private & OPpASSIGN_COMMON) { |
| 633 | EXTEND_MORTAL(lastrelem - firstrelem + 1); |
| 634 | for (relem = firstrelem; relem <= lastrelem; relem++) { |
| 635 | /*SUPPRESS 560*/ |
| 636 | if (sv = *relem) { |
| 637 | TAINT_NOT; /* Each item is independent */ |
| 638 | *relem = sv_mortalcopy(sv); |
| 639 | } |
| 640 | } |
| 641 | } |
| 642 | |
| 643 | relem = firstrelem; |
| 644 | lelem = firstlelem; |
| 645 | ary = Null(AV*); |
| 646 | hash = Null(HV*); |
| 647 | while (lelem <= lastlelem) { |
| 648 | TAINT_NOT; /* Each item stands on its own, taintwise. */ |
| 649 | sv = *lelem++; |
| 650 | switch (SvTYPE(sv)) { |
| 651 | case SVt_PVAV: |
| 652 | ary = (AV*)sv; |
| 653 | magic = SvMAGICAL(ary) != 0; |
| 654 | |
| 655 | av_clear(ary); |
| 656 | av_extend(ary, lastrelem - relem); |
| 657 | i = 0; |
| 658 | while (relem <= lastrelem) { /* gobble up all the rest */ |
| 659 | SV **didstore; |
| 660 | sv = NEWSV(28,0); |
| 661 | assert(*relem); |
| 662 | sv_setsv(sv,*relem); |
| 663 | *(relem++) = sv; |
| 664 | didstore = av_store(ary,i++,sv); |
| 665 | if (magic) { |
| 666 | if (SvSMAGICAL(sv)) |
| 667 | mg_set(sv); |
| 668 | if (!didstore) |
| 669 | sv_2mortal(sv); |
| 670 | } |
| 671 | TAINT_NOT; |
| 672 | } |
| 673 | break; |
| 674 | case SVt_PVHV: { |
| 675 | SV *tmpstr; |
| 676 | |
| 677 | hash = (HV*)sv; |
| 678 | magic = SvMAGICAL(hash) != 0; |
| 679 | hv_clear(hash); |
| 680 | |
| 681 | while (relem < lastrelem) { /* gobble up all the rest */ |
| 682 | HE *didstore; |
| 683 | if (*relem) |
| 684 | sv = *(relem++); |
| 685 | else |
| 686 | sv = &PL_sv_no, relem++; |
| 687 | tmpstr = NEWSV(29,0); |
| 688 | if (*relem) |
| 689 | sv_setsv(tmpstr,*relem); /* value */ |
| 690 | *(relem++) = tmpstr; |
| 691 | didstore = hv_store_ent(hash,sv,tmpstr,0); |
| 692 | if (magic) { |
| 693 | if (SvSMAGICAL(tmpstr)) |
| 694 | mg_set(tmpstr); |
| 695 | if (!didstore) |
| 696 | sv_2mortal(tmpstr); |
| 697 | } |
| 698 | TAINT_NOT; |
| 699 | } |
| 700 | if (relem == lastrelem) { |
| 701 | if (*relem) { |
| 702 | HE *didstore; |
| 703 | if (ckWARN(WARN_UNSAFE)) { |
| 704 | if (relem == firstrelem && |
| 705 | SvROK(*relem) && |
| 706 | ( SvTYPE(SvRV(*relem)) == SVt_PVAV || |
| 707 | SvTYPE(SvRV(*relem)) == SVt_PVHV ) ) |
| 708 | Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected"); |
| 709 | else |
| 710 | Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment"); |
| 711 | } |
| 712 | tmpstr = NEWSV(29,0); |
| 713 | didstore = hv_store_ent(hash,*relem,tmpstr,0); |
| 714 | if (magic) { |
| 715 | if (SvSMAGICAL(tmpstr)) |
| 716 | mg_set(tmpstr); |
| 717 | if (!didstore) |
| 718 | sv_2mortal(tmpstr); |
| 719 | } |
| 720 | TAINT_NOT; |
| 721 | } |
| 722 | relem++; |
| 723 | } |
| 724 | } |
| 725 | break; |
| 726 | default: |
| 727 | if (SvIMMORTAL(sv)) { |
| 728 | if (relem <= lastrelem) |
| 729 | relem++; |
| 730 | break; |
| 731 | } |
| 732 | if (relem <= lastrelem) { |
| 733 | sv_setsv(sv, *relem); |
| 734 | *(relem++) = sv; |
| 735 | } |
| 736 | else |
| 737 | sv_setsv(sv, &PL_sv_undef); |
| 738 | SvSETMAGIC(sv); |
| 739 | break; |
| 740 | } |
| 741 | } |
| 742 | if (PL_delaymagic & ~DM_DELAY) { |
| 743 | if (PL_delaymagic & DM_UID) { |
| 744 | #ifdef HAS_SETRESUID |
| 745 | (void)setresuid(PL_uid,PL_euid,(Uid_t)-1); |
| 746 | #else |
| 747 | # ifdef HAS_SETREUID |
| 748 | (void)setreuid(PL_uid,PL_euid); |
| 749 | # else |
| 750 | # ifdef HAS_SETRUID |
| 751 | if ((PL_delaymagic & DM_UID) == DM_RUID) { |
| 752 | (void)setruid(PL_uid); |
| 753 | PL_delaymagic &= ~DM_RUID; |
| 754 | } |
| 755 | # endif /* HAS_SETRUID */ |
| 756 | # ifdef HAS_SETEUID |
| 757 | if ((PL_delaymagic & DM_UID) == DM_EUID) { |
| 758 | (void)seteuid(PL_uid); |
| 759 | PL_delaymagic &= ~DM_EUID; |
| 760 | } |
| 761 | # endif /* HAS_SETEUID */ |
| 762 | if (PL_delaymagic & DM_UID) { |
| 763 | if (PL_uid != PL_euid) |
| 764 | DIE(aTHX_ "No setreuid available"); |
| 765 | (void)PerlProc_setuid(PL_uid); |
| 766 | } |
| 767 | # endif /* HAS_SETREUID */ |
| 768 | #endif /* HAS_SETRESUID */ |
| 769 | PL_uid = (int)PerlProc_getuid(); |
| 770 | PL_euid = (int)PerlProc_geteuid(); |
| 771 | } |
| 772 | if (PL_delaymagic & DM_GID) { |
| 773 | #ifdef HAS_SETRESGID |
| 774 | (void)setresgid(PL_gid,PL_egid,(Gid_t)-1); |
| 775 | #else |
| 776 | # ifdef HAS_SETREGID |
| 777 | (void)setregid(PL_gid,PL_egid); |
| 778 | # else |
| 779 | # ifdef HAS_SETRGID |
| 780 | if ((PL_delaymagic & DM_GID) == DM_RGID) { |
| 781 | (void)setrgid(PL_gid); |
| 782 | PL_delaymagic &= ~DM_RGID; |
| 783 | } |
| 784 | # endif /* HAS_SETRGID */ |
| 785 | # ifdef HAS_SETEGID |
| 786 | if ((PL_delaymagic & DM_GID) == DM_EGID) { |
| 787 | (void)setegid(PL_gid); |
| 788 | PL_delaymagic &= ~DM_EGID; |
| 789 | } |
| 790 | # endif /* HAS_SETEGID */ |
| 791 | if (PL_delaymagic & DM_GID) { |
| 792 | if (PL_gid != PL_egid) |
| 793 | DIE(aTHX_ "No setregid available"); |
| 794 | (void)PerlProc_setgid(PL_gid); |
| 795 | } |
| 796 | # endif /* HAS_SETREGID */ |
| 797 | #endif /* HAS_SETRESGID */ |
| 798 | PL_gid = (int)PerlProc_getgid(); |
| 799 | PL_egid = (int)PerlProc_getegid(); |
| 800 | } |
| 801 | PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid)); |
| 802 | } |
| 803 | PL_delaymagic = 0; |
| 804 | |
| 805 | gimme = GIMME_V; |
| 806 | if (gimme == G_VOID) |
| 807 | SP = firstrelem - 1; |
| 808 | else if (gimme == G_SCALAR) { |
| 809 | dTARGET; |
| 810 | SP = firstrelem; |
| 811 | SETi(lastrelem - firstrelem + 1); |
| 812 | } |
| 813 | else { |
| 814 | if (ary || hash) |
| 815 | SP = lastrelem; |
| 816 | else |
| 817 | SP = firstrelem + (lastlelem - firstlelem); |
| 818 | lelem = firstlelem + (relem - firstrelem); |
| 819 | while (relem <= SP) |
| 820 | *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef; |
| 821 | } |
| 822 | RETURN; |
| 823 | } |
| 824 | |
| 825 | PP(pp_qr) |
| 826 | { |
| 827 | djSP; |
| 828 | register PMOP *pm = cPMOP; |
| 829 | SV *rv = sv_newmortal(); |
| 830 | SV *sv = newSVrv(rv, "Regexp"); |
| 831 | sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0); |
| 832 | RETURNX(PUSHs(rv)); |
| 833 | } |
| 834 | |
| 835 | PP(pp_match) |
| 836 | { |
| 837 | djSP; dTARG; |
| 838 | register PMOP *pm = cPMOP; |
| 839 | register char *t; |
| 840 | register char *s; |
| 841 | char *strend; |
| 842 | I32 global; |
| 843 | I32 r_flags = REXEC_CHECKED; |
| 844 | char *truebase; /* Start of string */ |
| 845 | register REGEXP *rx = pm->op_pmregexp; |
| 846 | bool rxtainted; |
| 847 | I32 gimme = GIMME; |
| 848 | STRLEN len; |
| 849 | I32 minmatch = 0; |
| 850 | I32 oldsave = PL_savestack_ix; |
| 851 | I32 update_minmatch = 1; |
| 852 | I32 had_zerolen = 0; |
| 853 | |
| 854 | if (PL_op->op_flags & OPf_STACKED) |
| 855 | TARG = POPs; |
| 856 | else { |
| 857 | TARG = DEFSV; |
| 858 | EXTEND(SP,1); |
| 859 | } |
| 860 | PUTBACK; /* EVAL blocks need stack_sp. */ |
| 861 | s = SvPV(TARG, len); |
| 862 | strend = s + len; |
| 863 | if (!s) |
| 864 | DIE(aTHX_ "panic: do_match"); |
| 865 | rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) || |
| 866 | (PL_tainted && (pm->op_pmflags & PMf_RETAINT))); |
| 867 | TAINT_NOT; |
| 868 | |
| 869 | if (pm->op_pmdynflags & PMdf_USED) { |
| 870 | failure: |
| 871 | if (gimme == G_ARRAY) |
| 872 | RETURN; |
| 873 | RETPUSHNO; |
| 874 | } |
| 875 | |
| 876 | if (!rx->prelen && PL_curpm) { |
| 877 | pm = PL_curpm; |
| 878 | rx = pm->op_pmregexp; |
| 879 | } |
| 880 | if (rx->minlen > len) goto failure; |
| 881 | |
| 882 | truebase = t = s; |
| 883 | |
| 884 | /* XXXX What part of this is needed with true \G-support? */ |
| 885 | if (global = pm->op_pmflags & PMf_GLOBAL) { |
| 886 | rx->startp[0] = -1; |
| 887 | if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) { |
| 888 | MAGIC* mg = mg_find(TARG, 'g'); |
| 889 | if (mg && mg->mg_len >= 0) { |
| 890 | if (!(rx->reganch & ROPT_GPOS_SEEN)) |
| 891 | rx->endp[0] = rx->startp[0] = mg->mg_len; |
| 892 | else if (rx->reganch & ROPT_ANCH_GPOS) { |
| 893 | r_flags |= REXEC_IGNOREPOS; |
| 894 | rx->endp[0] = rx->startp[0] = mg->mg_len; |
| 895 | } |
| 896 | minmatch = (mg->mg_flags & MGf_MINMATCH); |
| 897 | update_minmatch = 0; |
| 898 | } |
| 899 | } |
| 900 | } |
| 901 | if ((gimme != G_ARRAY && !global && rx->nparens) |
| 902 | || SvTEMP(TARG) || PL_sawampersand) |
| 903 | r_flags |= REXEC_COPY_STR; |
| 904 | if (SvSCREAM(TARG)) |
| 905 | r_flags |= REXEC_SCREAM; |
| 906 | |
| 907 | if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) { |
| 908 | SAVEINT(PL_multiline); |
| 909 | PL_multiline = pm->op_pmflags & PMf_MULTILINE; |
| 910 | } |
| 911 | |
| 912 | play_it_again: |
| 913 | if (global && rx->startp[0] != -1) { |
| 914 | t = s = rx->endp[0] + truebase; |
| 915 | if ((s + rx->minlen) > strend) |
| 916 | goto nope; |
| 917 | if (update_minmatch++) |
| 918 | minmatch = had_zerolen; |
| 919 | } |
| 920 | if (rx->reganch & RE_USE_INTUIT) { |
| 921 | s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL); |
| 922 | |
| 923 | if (!s) |
| 924 | goto nope; |
| 925 | if ( (rx->reganch & ROPT_CHECK_ALL) |
| 926 | && !PL_sawampersand |
| 927 | && ((rx->reganch & ROPT_NOSCAN) |
| 928 | || !((rx->reganch & RE_INTUIT_TAIL) |
| 929 | && (r_flags & REXEC_SCREAM)))) |
| 930 | goto yup; |
| 931 | } |
| 932 | if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags)) |
| 933 | { |
| 934 | PL_curpm = pm; |
| 935 | if (pm->op_pmflags & PMf_ONCE) |
| 936 | pm->op_pmdynflags |= PMdf_USED; |
| 937 | goto gotcha; |
| 938 | } |
| 939 | else |
| 940 | goto ret_no; |
| 941 | /*NOTREACHED*/ |
| 942 | |
| 943 | gotcha: |
| 944 | if (rxtainted) |
| 945 | RX_MATCH_TAINTED_on(rx); |
| 946 | TAINT_IF(RX_MATCH_TAINTED(rx)); |
| 947 | if (gimme == G_ARRAY) { |
| 948 | I32 iters, i, len; |
| 949 | |
| 950 | iters = rx->nparens; |
| 951 | if (global && !iters) |
| 952 | i = 1; |
| 953 | else |
| 954 | i = 0; |
| 955 | SPAGAIN; /* EVAL blocks could move the stack. */ |
| 956 | EXTEND(SP, iters + i); |
| 957 | EXTEND_MORTAL(iters + i); |
| 958 | for (i = !i; i <= iters; i++) { |
| 959 | PUSHs(sv_newmortal()); |
| 960 | /*SUPPRESS 560*/ |
| 961 | if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) { |
| 962 | len = rx->endp[i] - rx->startp[i]; |
| 963 | s = rx->startp[i] + truebase; |
| 964 | sv_setpvn(*SP, s, len); |
| 965 | } |
| 966 | } |
| 967 | if (global) { |
| 968 | had_zerolen = (rx->startp[0] != -1 |
| 969 | && rx->startp[0] == rx->endp[0]); |
| 970 | PUTBACK; /* EVAL blocks may use stack */ |
| 971 | r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST; |
| 972 | goto play_it_again; |
| 973 | } |
| 974 | else if (!iters) |
| 975 | XPUSHs(&PL_sv_yes); |
| 976 | LEAVE_SCOPE(oldsave); |
| 977 | RETURN; |
| 978 | } |
| 979 | else { |
| 980 | if (global) { |
| 981 | MAGIC* mg = 0; |
| 982 | if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) |
| 983 | mg = mg_find(TARG, 'g'); |
| 984 | if (!mg) { |
| 985 | sv_magic(TARG, (SV*)0, 'g', Nullch, 0); |
| 986 | mg = mg_find(TARG, 'g'); |
| 987 | } |
| 988 | if (rx->startp[0] != -1) { |
| 989 | mg->mg_len = rx->endp[0]; |
| 990 | if (rx->startp[0] == rx->endp[0]) |
| 991 | mg->mg_flags |= MGf_MINMATCH; |
| 992 | else |
| 993 | mg->mg_flags &= ~MGf_MINMATCH; |
| 994 | } |
| 995 | } |
| 996 | LEAVE_SCOPE(oldsave); |
| 997 | RETPUSHYES; |
| 998 | } |
| 999 | |
| 1000 | yup: /* Confirmed by INTUIT */ |
| 1001 | if (rxtainted) |
| 1002 | RX_MATCH_TAINTED_on(rx); |
| 1003 | TAINT_IF(RX_MATCH_TAINTED(rx)); |
| 1004 | PL_curpm = pm; |
| 1005 | if (pm->op_pmflags & PMf_ONCE) |
| 1006 | pm->op_pmdynflags |= PMdf_USED; |
| 1007 | if (RX_MATCH_COPIED(rx)) |
| 1008 | Safefree(rx->subbeg); |
| 1009 | RX_MATCH_COPIED_off(rx); |
| 1010 | rx->subbeg = Nullch; |
| 1011 | if (global) { |
| 1012 | rx->subbeg = truebase; |
| 1013 | rx->startp[0] = s - truebase; |
| 1014 | rx->endp[0] = s - truebase + rx->minlen; |
| 1015 | rx->sublen = strend - truebase; |
| 1016 | goto gotcha; |
| 1017 | } |
| 1018 | if (PL_sawampersand) { |
| 1019 | I32 off; |
| 1020 | |
| 1021 | rx->subbeg = savepvn(t, strend - t); |
| 1022 | rx->sublen = strend - t; |
| 1023 | RX_MATCH_COPIED_on(rx); |
| 1024 | off = rx->startp[0] = s - t; |
| 1025 | rx->endp[0] = off + rx->minlen; |
| 1026 | } |
| 1027 | else { /* startp/endp are used by @- @+. */ |
| 1028 | rx->startp[0] = s - truebase; |
| 1029 | rx->endp[0] = s - truebase + rx->minlen; |
| 1030 | } |
| 1031 | LEAVE_SCOPE(oldsave); |
| 1032 | RETPUSHYES; |
| 1033 | |
| 1034 | nope: |
| 1035 | ret_no: |
| 1036 | if (global && !(pm->op_pmflags & PMf_CONTINUE)) { |
| 1037 | if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) { |
| 1038 | MAGIC* mg = mg_find(TARG, 'g'); |
| 1039 | if (mg) |
| 1040 | mg->mg_len = -1; |
| 1041 | } |
| 1042 | } |
| 1043 | LEAVE_SCOPE(oldsave); |
| 1044 | if (gimme == G_ARRAY) |
| 1045 | RETURN; |
| 1046 | RETPUSHNO; |
| 1047 | } |
| 1048 | |
| 1049 | OP * |
| 1050 | Perl_do_readline(pTHX) |
| 1051 | { |
| 1052 | dSP; dTARGETSTACKED; |
| 1053 | register SV *sv; |
| 1054 | STRLEN tmplen = 0; |
| 1055 | STRLEN offset; |
| 1056 | PerlIO *fp; |
| 1057 | register IO *io = GvIO(PL_last_in_gv); |
| 1058 | register I32 type = PL_op->op_type; |
| 1059 | I32 gimme = GIMME_V; |
| 1060 | MAGIC *mg; |
| 1061 | |
| 1062 | if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) { |
| 1063 | PUSHMARK(SP); |
| 1064 | XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg)); |
| 1065 | PUTBACK; |
| 1066 | ENTER; |
| 1067 | call_method("READLINE", gimme); |
| 1068 | LEAVE; |
| 1069 | SPAGAIN; |
| 1070 | if (gimme == G_SCALAR) |
| 1071 | SvSetMagicSV_nosteal(TARG, TOPs); |
| 1072 | RETURN; |
| 1073 | } |
| 1074 | fp = Nullfp; |
| 1075 | if (io) { |
| 1076 | fp = IoIFP(io); |
| 1077 | if (!fp) { |
| 1078 | if (IoFLAGS(io) & IOf_ARGV) { |
| 1079 | if (IoFLAGS(io) & IOf_START) { |
| 1080 | IoFLAGS(io) &= ~IOf_START; |
| 1081 | IoLINES(io) = 0; |
| 1082 | if (av_len(GvAVn(PL_last_in_gv)) < 0) { |
| 1083 | do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp); |
| 1084 | sv_setpvn(GvSV(PL_last_in_gv), "-", 1); |
| 1085 | SvSETMAGIC(GvSV(PL_last_in_gv)); |
| 1086 | fp = IoIFP(io); |
| 1087 | goto have_fp; |
| 1088 | } |
| 1089 | } |
| 1090 | fp = nextargv(PL_last_in_gv); |
| 1091 | if (!fp) { /* Note: fp != IoIFP(io) */ |
| 1092 | (void)do_close(PL_last_in_gv, FALSE); /* now it does*/ |
| 1093 | IoFLAGS(io) |= IOf_START; |
| 1094 | } |
| 1095 | } |
| 1096 | else if (type == OP_GLOB) { |
| 1097 | SV *tmpcmd = NEWSV(55, 0); |
| 1098 | SV *tmpglob = POPs; |
| 1099 | ENTER; |
| 1100 | SAVEFREESV(tmpcmd); |
| 1101 | #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */ |
| 1102 | /* since spawning off a process is a real performance hit */ |
| 1103 | { |
| 1104 | #include <descrip.h> |
| 1105 | #include <lib$routines.h> |
| 1106 | #include <nam.h> |
| 1107 | #include <rmsdef.h> |
| 1108 | char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'}; |
| 1109 | char vmsspec[NAM$C_MAXRSS+1]; |
| 1110 | char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp; |
| 1111 | char tmpfnam[L_tmpnam] = "SYS$SCRATCH:"; |
| 1112 | $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;"); |
| 1113 | PerlIO *tmpfp; |
| 1114 | STRLEN i; |
| 1115 | struct dsc$descriptor_s wilddsc |
| 1116 | = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0}; |
| 1117 | struct dsc$descriptor_vs rsdsc |
| 1118 | = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt}; |
| 1119 | unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0; |
| 1120 | |
| 1121 | /* We could find out if there's an explicit dev/dir or version |
| 1122 | by peeking into lib$find_file's internal context at |
| 1123 | ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb |
| 1124 | but that's unsupported, so I don't want to do it now and |
| 1125 | have it bite someone in the future. */ |
| 1126 | strcat(tmpfnam,PerlLIO_tmpnam(NULL)); |
| 1127 | cp = SvPV(tmpglob,i); |
| 1128 | for (; i; i--) { |
| 1129 | if (cp[i] == ';') hasver = 1; |
| 1130 | if (cp[i] == '.') { |
| 1131 | if (sts) hasver = 1; |
| 1132 | else sts = 1; |
| 1133 | } |
| 1134 | if (cp[i] == '/') { |
| 1135 | hasdir = isunix = 1; |
| 1136 | break; |
| 1137 | } |
| 1138 | if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') { |
| 1139 | hasdir = 1; |
| 1140 | break; |
| 1141 | } |
| 1142 | } |
| 1143 | if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) { |
| 1144 | Stat_t st; |
| 1145 | if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode)) |
| 1146 | ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL); |
| 1147 | else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL); |
| 1148 | if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer); |
| 1149 | while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt, |
| 1150 | &dfltdsc,NULL,NULL,NULL))&1)) { |
| 1151 | end = rstr + (unsigned long int) *rslt; |
| 1152 | if (!hasver) while (*end != ';') end--; |
| 1153 | *(end++) = '\n'; *end = '\0'; |
| 1154 | for (cp = rstr; *cp; cp++) *cp = _tolower(*cp); |
| 1155 | if (hasdir) { |
| 1156 | if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1); |
| 1157 | begin = rstr; |
| 1158 | } |
| 1159 | else { |
| 1160 | begin = end; |
| 1161 | while (*(--begin) != ']' && *begin != '>') ; |
| 1162 | ++begin; |
| 1163 | } |
| 1164 | ok = (PerlIO_puts(tmpfp,begin) != EOF); |
| 1165 | } |
| 1166 | if (cxt) (void)lib$find_file_end(&cxt); |
| 1167 | if (ok && sts != RMS$_NMF && |
| 1168 | sts != RMS$_DNF && sts != RMS$_FNF) ok = 0; |
| 1169 | if (!ok) { |
| 1170 | if (!(sts & 1)) { |
| 1171 | SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts); |
| 1172 | } |
| 1173 | PerlIO_close(tmpfp); |
| 1174 | fp = NULL; |
| 1175 | } |
| 1176 | else { |
| 1177 | PerlIO_rewind(tmpfp); |
| 1178 | IoTYPE(io) = '<'; |
| 1179 | IoIFP(io) = fp = tmpfp; |
| 1180 | IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */ |
| 1181 | } |
| 1182 | } |
| 1183 | } |
| 1184 | #else /* !VMS */ |
| 1185 | #ifdef DOSISH |
| 1186 | #ifdef OS2 |
| 1187 | sv_setpv(tmpcmd, "for a in "); |
| 1188 | sv_catsv(tmpcmd, tmpglob); |
| 1189 | sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |"); |
| 1190 | #else |
| 1191 | #ifdef DJGPP |
| 1192 | sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */ |
| 1193 | sv_catsv(tmpcmd, tmpglob); |
| 1194 | #else |
| 1195 | sv_setpv(tmpcmd, "perlglob "); |
| 1196 | sv_catsv(tmpcmd, tmpglob); |
| 1197 | sv_catpv(tmpcmd, " |"); |
| 1198 | #endif /* !DJGPP */ |
| 1199 | #endif /* !OS2 */ |
| 1200 | #else /* !DOSISH */ |
| 1201 | #if defined(CSH) |
| 1202 | sv_setpvn(tmpcmd, PL_cshname, PL_cshlen); |
| 1203 | sv_catpv(tmpcmd, " -cf 'set nonomatch; glob "); |
| 1204 | sv_catsv(tmpcmd, tmpglob); |
| 1205 | sv_catpv(tmpcmd, "' 2>/dev/null |"); |
| 1206 | #else |
| 1207 | sv_setpv(tmpcmd, "echo "); |
| 1208 | sv_catsv(tmpcmd, tmpglob); |
| 1209 | #if 'z' - 'a' == 25 |
| 1210 | sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|"); |
| 1211 | #else |
| 1212 | sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|"); |
| 1213 | #endif |
| 1214 | #endif /* !CSH */ |
| 1215 | #endif /* !DOSISH */ |
| 1216 | (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd), |
| 1217 | FALSE, O_RDONLY, 0, Nullfp); |
| 1218 | fp = IoIFP(io); |
| 1219 | #endif /* !VMS */ |
| 1220 | LEAVE; |
| 1221 | } |
| 1222 | } |
| 1223 | else if (type == OP_GLOB) |
| 1224 | SP--; |
| 1225 | else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */ |
| 1226 | && (IoTYPE(io) == '>' || fp == PerlIO_stdout() |
| 1227 | || fp == PerlIO_stderr())) |
| 1228 | { |
| 1229 | SV* sv = sv_newmortal(); |
| 1230 | gv_efullname3(sv, PL_last_in_gv, Nullch); |
| 1231 | Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output", |
| 1232 | SvPV_nolen(sv)); |
| 1233 | } |
| 1234 | } |
| 1235 | if (!fp) { |
| 1236 | if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) { |
| 1237 | if (type == OP_GLOB) |
| 1238 | Perl_warner(aTHX_ WARN_CLOSED, |
| 1239 | "glob failed (can't start child: %s)", |
| 1240 | Strerror(errno)); |
| 1241 | else { |
| 1242 | SV* sv = sv_newmortal(); |
| 1243 | gv_efullname3(sv, PL_last_in_gv, Nullch); |
| 1244 | Perl_warner(aTHX_ WARN_CLOSED, |
| 1245 | "Read on closed filehandle %s", |
| 1246 | SvPV_nolen(sv)); |
| 1247 | } |
| 1248 | } |
| 1249 | if (gimme == G_SCALAR) { |
| 1250 | (void)SvOK_off(TARG); |
| 1251 | PUSHTARG; |
| 1252 | } |
| 1253 | RETURN; |
| 1254 | } |
| 1255 | have_fp: |
| 1256 | if (gimme == G_SCALAR) { |
| 1257 | sv = TARG; |
| 1258 | if (SvROK(sv)) |
| 1259 | sv_unref(sv); |
| 1260 | (void)SvUPGRADE(sv, SVt_PV); |
| 1261 | tmplen = SvLEN(sv); /* remember if already alloced */ |
| 1262 | if (!tmplen) |
| 1263 | Sv_Grow(sv, 80); /* try short-buffering it */ |
| 1264 | if (type == OP_RCATLINE) |
| 1265 | offset = SvCUR(sv); |
| 1266 | else |
| 1267 | offset = 0; |
| 1268 | } |
| 1269 | else { |
| 1270 | sv = sv_2mortal(NEWSV(57, 80)); |
| 1271 | offset = 0; |
| 1272 | } |
| 1273 | |
| 1274 | /* flip-flop EOF state for a snarfed empty file */ |
| 1275 | #define SNARF_EOF(gimme,rs,io,sv) \ |
| 1276 | ((gimme != G_SCALAR || SvCUR(sv) \ |
| 1277 | || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \ |
| 1278 | ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \ |
| 1279 | : ((IoFLAGS(io) |= IOf_NOLINE), FALSE)) |
| 1280 | |
| 1281 | for (;;) { |
| 1282 | if (!sv_gets(sv, fp, offset) |
| 1283 | && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv))) |
| 1284 | { |
| 1285 | PerlIO_clearerr(fp); |
| 1286 | if (IoFLAGS(io) & IOf_ARGV) { |
| 1287 | fp = nextargv(PL_last_in_gv); |
| 1288 | if (fp) |
| 1289 | continue; |
| 1290 | (void)do_close(PL_last_in_gv, FALSE); |
| 1291 | IoFLAGS(io) |= IOf_START; |
| 1292 | } |
| 1293 | else if (type == OP_GLOB) { |
| 1294 | if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) { |
| 1295 | Perl_warner(aTHX_ WARN_CLOSED, |
| 1296 | "glob failed (child exited with status %d%s)", |
| 1297 | STATUS_CURRENT >> 8, |
| 1298 | (STATUS_CURRENT & 0x80) ? ", core dumped" : ""); |
| 1299 | } |
| 1300 | } |
| 1301 | if (gimme == G_SCALAR) { |
| 1302 | (void)SvOK_off(TARG); |
| 1303 | PUSHTARG; |
| 1304 | } |
| 1305 | RETURN; |
| 1306 | } |
| 1307 | /* This should not be marked tainted if the fp is marked clean */ |
| 1308 | if (!(IoFLAGS(io) & IOf_UNTAINT)) { |
| 1309 | TAINT; |
| 1310 | SvTAINTED_on(sv); |
| 1311 | } |
| 1312 | IoLINES(io)++; |
| 1313 | SvSETMAGIC(sv); |
| 1314 | XPUSHs(sv); |
| 1315 | if (type == OP_GLOB) { |
| 1316 | char *tmps; |
| 1317 | |
| 1318 | if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) { |
| 1319 | tmps = SvEND(sv) - 1; |
| 1320 | if (*tmps == *SvPVX(PL_rs)) { |
| 1321 | *tmps = '\0'; |
| 1322 | SvCUR(sv)--; |
| 1323 | } |
| 1324 | } |
| 1325 | for (tmps = SvPVX(sv); *tmps; tmps++) |
| 1326 | if (!isALPHA(*tmps) && !isDIGIT(*tmps) && |
| 1327 | strchr("$&*(){}[]'\";\\|?<>~`", *tmps)) |
| 1328 | break; |
| 1329 | if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) { |
| 1330 | (void)POPs; /* Unmatched wildcard? Chuck it... */ |
| 1331 | continue; |
| 1332 | } |
| 1333 | } |
| 1334 | if (gimme == G_ARRAY) { |
| 1335 | if (SvLEN(sv) - SvCUR(sv) > 20) { |
| 1336 | SvLEN_set(sv, SvCUR(sv)+1); |
| 1337 | Renew(SvPVX(sv), SvLEN(sv), char); |
| 1338 | } |
| 1339 | sv = sv_2mortal(NEWSV(58, 80)); |
| 1340 | continue; |
| 1341 | } |
| 1342 | else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) { |
| 1343 | /* try to reclaim a bit of scalar space (only on 1st alloc) */ |
| 1344 | if (SvCUR(sv) < 60) |
| 1345 | SvLEN_set(sv, 80); |
| 1346 | else |
| 1347 | SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */ |
| 1348 | Renew(SvPVX(sv), SvLEN(sv), char); |
| 1349 | } |
| 1350 | RETURN; |
| 1351 | } |
| 1352 | } |
| 1353 | |
| 1354 | PP(pp_enter) |
| 1355 | { |
| 1356 | djSP; |
| 1357 | register PERL_CONTEXT *cx; |
| 1358 | I32 gimme = OP_GIMME(PL_op, -1); |
| 1359 | |
| 1360 | if (gimme == -1) { |
| 1361 | if (cxstack_ix >= 0) |
| 1362 | gimme = cxstack[cxstack_ix].blk_gimme; |
| 1363 | else |
| 1364 | gimme = G_SCALAR; |
| 1365 | } |
| 1366 | |
| 1367 | ENTER; |
| 1368 | |
| 1369 | SAVETMPS; |
| 1370 | PUSHBLOCK(cx, CXt_BLOCK, SP); |
| 1371 | |
| 1372 | RETURN; |
| 1373 | } |
| 1374 | |
| 1375 | PP(pp_helem) |
| 1376 | { |
| 1377 | djSP; |
| 1378 | HE* he; |
| 1379 | SV **svp; |
| 1380 | SV *keysv = POPs; |
| 1381 | HV *hv = (HV*)POPs; |
| 1382 | U32 lval = PL_op->op_flags & OPf_MOD; |
| 1383 | U32 defer = PL_op->op_private & OPpLVAL_DEFER; |
| 1384 | SV *sv; |
| 1385 | |
| 1386 | if (SvTYPE(hv) == SVt_PVHV) { |
| 1387 | he = hv_fetch_ent(hv, keysv, lval && !defer, 0); |
| 1388 | svp = he ? &HeVAL(he) : 0; |
| 1389 | } |
| 1390 | else if (SvTYPE(hv) == SVt_PVAV) { |
| 1391 | if (PL_op->op_private & OPpLVAL_INTRO) |
| 1392 | DIE(aTHX_ "Can't localize pseudo-hash element"); |
| 1393 | svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0); |
| 1394 | } |
| 1395 | else { |
| 1396 | RETPUSHUNDEF; |
| 1397 | } |
| 1398 | if (lval) { |
| 1399 | if (!svp || *svp == &PL_sv_undef) { |
| 1400 | SV* lv; |
| 1401 | SV* key2; |
| 1402 | if (!defer) { |
| 1403 | STRLEN n_a; |
| 1404 | DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a)); |
| 1405 | } |
| 1406 | lv = sv_newmortal(); |
| 1407 | sv_upgrade(lv, SVt_PVLV); |
| 1408 | LvTYPE(lv) = 'y'; |
| 1409 | sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0); |
| 1410 | SvREFCNT_dec(key2); /* sv_magic() increments refcount */ |
| 1411 | LvTARG(lv) = SvREFCNT_inc(hv); |
| 1412 | LvTARGLEN(lv) = 1; |
| 1413 | PUSHs(lv); |
| 1414 | RETURN; |
| 1415 | } |
| 1416 | if (PL_op->op_private & OPpLVAL_INTRO) { |
| 1417 | if (HvNAME(hv) && isGV(*svp)) |
| 1418 | save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL)); |
| 1419 | else |
| 1420 | save_helem(hv, keysv, svp); |
| 1421 | } |
| 1422 | else if (PL_op->op_private & OPpDEREF) |
| 1423 | vivify_ref(*svp, PL_op->op_private & OPpDEREF); |
| 1424 | } |
| 1425 | sv = (svp ? *svp : &PL_sv_undef); |
| 1426 | /* This makes C<local $tied{foo} = $tied{foo}> possible. |
| 1427 | * Pushing the magical RHS on to the stack is useless, since |
| 1428 | * that magic is soon destined to be misled by the local(), |
| 1429 | * and thus the later pp_sassign() will fail to mg_get() the |
| 1430 | * old value. This should also cure problems with delayed |
| 1431 | * mg_get()s. GSAR 98-07-03 */ |
| 1432 | if (!lval && SvGMAGICAL(sv)) |
| 1433 | sv = sv_mortalcopy(sv); |
| 1434 | PUSHs(sv); |
| 1435 | RETURN; |
| 1436 | } |
| 1437 | |
| 1438 | PP(pp_leave) |
| 1439 | { |
| 1440 | djSP; |
| 1441 | register PERL_CONTEXT *cx; |
| 1442 | register SV **mark; |
| 1443 | SV **newsp; |
| 1444 | PMOP *newpm; |
| 1445 | I32 gimme; |
| 1446 | |
| 1447 | if (PL_op->op_flags & OPf_SPECIAL) { |
| 1448 | cx = &cxstack[cxstack_ix]; |
| 1449 | cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */ |
| 1450 | } |
| 1451 | |
| 1452 | POPBLOCK(cx,newpm); |
| 1453 | |
| 1454 | gimme = OP_GIMME(PL_op, -1); |
| 1455 | if (gimme == -1) { |
| 1456 | if (cxstack_ix >= 0) |
| 1457 | gimme = cxstack[cxstack_ix].blk_gimme; |
| 1458 | else |
| 1459 | gimme = G_SCALAR; |
| 1460 | } |
| 1461 | |
| 1462 | TAINT_NOT; |
| 1463 | if (gimme == G_VOID) |
| 1464 | SP = newsp; |
| 1465 | else if (gimme == G_SCALAR) { |
| 1466 | MARK = newsp + 1; |
| 1467 | if (MARK <= SP) |
| 1468 | if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP)) |
| 1469 | *MARK = TOPs; |
| 1470 | else |
| 1471 | *MARK = sv_mortalcopy(TOPs); |
| 1472 | else { |
| 1473 | MEXTEND(mark,0); |
| 1474 | *MARK = &PL_sv_undef; |
| 1475 | } |
| 1476 | SP = MARK; |
| 1477 | } |
| 1478 | else if (gimme == G_ARRAY) { |
| 1479 | /* in case LEAVE wipes old return values */ |
| 1480 | for (mark = newsp + 1; mark <= SP; mark++) { |
| 1481 | if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) { |
| 1482 | *mark = sv_mortalcopy(*mark); |
| 1483 | TAINT_NOT; /* Each item is independent */ |
| 1484 | } |
| 1485 | } |
| 1486 | } |
| 1487 | PL_curpm = newpm; /* Don't pop $1 et al till now */ |
| 1488 | |
| 1489 | LEAVE; |
| 1490 | |
| 1491 | RETURN; |
| 1492 | } |
| 1493 | |
| 1494 | PP(pp_iter) |
| 1495 | { |
| 1496 | djSP; |
| 1497 | register PERL_CONTEXT *cx; |
| 1498 | SV* sv; |
| 1499 | AV* av; |
| 1500 | |
| 1501 | EXTEND(SP, 1); |
| 1502 | cx = &cxstack[cxstack_ix]; |
| 1503 | if (CxTYPE(cx) != CXt_LOOP) |
| 1504 | DIE(aTHX_ "panic: pp_iter"); |
| 1505 | |
| 1506 | av = cx->blk_loop.iterary; |
| 1507 | if (SvTYPE(av) != SVt_PVAV) { |
| 1508 | /* iterate ($min .. $max) */ |
| 1509 | if (cx->blk_loop.iterlval) { |
| 1510 | /* string increment */ |
| 1511 | register SV* cur = cx->blk_loop.iterlval; |
| 1512 | STRLEN maxlen; |
| 1513 | char *max = SvPV((SV*)av, maxlen); |
| 1514 | if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) { |
| 1515 | #ifndef USE_THREADS /* don't risk potential race */ |
| 1516 | if (SvREFCNT(*cx->blk_loop.itervar) == 1 |
| 1517 | && !SvMAGICAL(*cx->blk_loop.itervar)) |
| 1518 | { |
| 1519 | /* safe to reuse old SV */ |
| 1520 | sv_setsv(*cx->blk_loop.itervar, cur); |
| 1521 | } |
| 1522 | else |
| 1523 | #endif |
| 1524 | { |
| 1525 | /* we need a fresh SV every time so that loop body sees a |
| 1526 | * completely new SV for closures/references to work as |
| 1527 | * they used to */ |
| 1528 | SvREFCNT_dec(*cx->blk_loop.itervar); |
| 1529 | *cx->blk_loop.itervar = newSVsv(cur); |
| 1530 | } |
| 1531 | if (strEQ(SvPVX(cur), max)) |
| 1532 | sv_setiv(cur, 0); /* terminate next time */ |
| 1533 | else |
| 1534 | sv_inc(cur); |
| 1535 | RETPUSHYES; |
| 1536 | } |
| 1537 | RETPUSHNO; |
| 1538 | } |
| 1539 | /* integer increment */ |
| 1540 | if (cx->blk_loop.iterix > cx->blk_loop.itermax) |
| 1541 | RETPUSHNO; |
| 1542 | |
| 1543 | #ifndef USE_THREADS /* don't risk potential race */ |
| 1544 | if (SvREFCNT(*cx->blk_loop.itervar) == 1 |
| 1545 | && !SvMAGICAL(*cx->blk_loop.itervar)) |
| 1546 | { |
| 1547 | /* safe to reuse old SV */ |
| 1548 | sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++); |
| 1549 | } |
| 1550 | else |
| 1551 | #endif |
| 1552 | { |
| 1553 | /* we need a fresh SV every time so that loop body sees a |
| 1554 | * completely new SV for closures/references to work as they |
| 1555 | * used to */ |
| 1556 | SvREFCNT_dec(*cx->blk_loop.itervar); |
| 1557 | *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++); |
| 1558 | } |
| 1559 | RETPUSHYES; |
| 1560 | } |
| 1561 | |
| 1562 | /* iterate array */ |
| 1563 | if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av))) |
| 1564 | RETPUSHNO; |
| 1565 | |
| 1566 | SvREFCNT_dec(*cx->blk_loop.itervar); |
| 1567 | |
| 1568 | if (sv = (SvMAGICAL(av)) |
| 1569 | ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE) |
| 1570 | : AvARRAY(av)[++cx->blk_loop.iterix]) |
| 1571 | SvTEMP_off(sv); |
| 1572 | else |
| 1573 | sv = &PL_sv_undef; |
| 1574 | if (av != PL_curstack && SvIMMORTAL(sv)) { |
| 1575 | SV *lv = cx->blk_loop.iterlval; |
| 1576 | if (lv && SvREFCNT(lv) > 1) { |
| 1577 | SvREFCNT_dec(lv); |
| 1578 | lv = Nullsv; |
| 1579 | } |
| 1580 | if (lv) |
| 1581 | SvREFCNT_dec(LvTARG(lv)); |
| 1582 | else { |
| 1583 | lv = cx->blk_loop.iterlval = NEWSV(26, 0); |
| 1584 | sv_upgrade(lv, SVt_PVLV); |
| 1585 | LvTYPE(lv) = 'y'; |
| 1586 | sv_magic(lv, Nullsv, 'y', Nullch, 0); |
| 1587 | } |
| 1588 | LvTARG(lv) = SvREFCNT_inc(av); |
| 1589 | LvTARGOFF(lv) = cx->blk_loop.iterix; |
| 1590 | LvTARGLEN(lv) = (UV) -1; |
| 1591 | sv = (SV*)lv; |
| 1592 | } |
| 1593 | |
| 1594 | *cx->blk_loop.itervar = SvREFCNT_inc(sv); |
| 1595 | RETPUSHYES; |
| 1596 | } |
| 1597 | |
| 1598 | PP(pp_subst) |
| 1599 | { |
| 1600 | djSP; dTARG; |
| 1601 | register PMOP *pm = cPMOP; |
| 1602 | PMOP *rpm = pm; |
| 1603 | register SV *dstr; |
| 1604 | register char *s; |
| 1605 | char *strend; |
| 1606 | register char *m; |
| 1607 | char *c; |
| 1608 | register char *d; |
| 1609 | STRLEN clen; |
| 1610 | I32 iters = 0; |
| 1611 | I32 maxiters; |
| 1612 | register I32 i; |
| 1613 | bool once; |
| 1614 | bool rxtainted; |
| 1615 | char *orig; |
| 1616 | I32 r_flags; |
| 1617 | register REGEXP *rx = pm->op_pmregexp; |
| 1618 | STRLEN len; |
| 1619 | int force_on_match = 0; |
| 1620 | I32 oldsave = PL_savestack_ix; |
| 1621 | I32 update_minmatch = 1; |
| 1622 | |
| 1623 | /* known replacement string? */ |
| 1624 | dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv; |
| 1625 | if (PL_op->op_flags & OPf_STACKED) |
| 1626 | TARG = POPs; |
| 1627 | else { |
| 1628 | TARG = DEFSV; |
| 1629 | EXTEND(SP,1); |
| 1630 | } |
| 1631 | if (SvREADONLY(TARG) |
| 1632 | || (SvTYPE(TARG) > SVt_PVLV |
| 1633 | && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG)))) |
| 1634 | Perl_croak(aTHX_ PL_no_modify); |
| 1635 | PUTBACK; |
| 1636 | |
| 1637 | s = SvPV(TARG, len); |
| 1638 | if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV) |
| 1639 | force_on_match = 1; |
| 1640 | rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) || |
| 1641 | (PL_tainted && (pm->op_pmflags & PMf_RETAINT))); |
| 1642 | if (PL_tainted) |
| 1643 | rxtainted |= 2; |
| 1644 | TAINT_NOT; |
| 1645 | |
| 1646 | force_it: |
| 1647 | if (!pm || !s) |
| 1648 | DIE(aTHX_ "panic: do_subst"); |
| 1649 | |
| 1650 | strend = s + len; |
| 1651 | maxiters = 2*(strend - s) + 10; /* We can match twice at each |
| 1652 | position, once with zero-length, |
| 1653 | second time with non-zero. */ |
| 1654 | |
| 1655 | if (!rx->prelen && PL_curpm) { |
| 1656 | pm = PL_curpm; |
| 1657 | rx = pm->op_pmregexp; |
| 1658 | } |
| 1659 | r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand) |
| 1660 | ? REXEC_COPY_STR : 0; |
| 1661 | if (SvSCREAM(TARG)) |
| 1662 | r_flags |= REXEC_SCREAM; |
| 1663 | if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) { |
| 1664 | SAVEINT(PL_multiline); |
| 1665 | PL_multiline = pm->op_pmflags & PMf_MULTILINE; |
| 1666 | } |
| 1667 | orig = m = s; |
| 1668 | if (rx->reganch & RE_USE_INTUIT) { |
| 1669 | s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL); |
| 1670 | |
| 1671 | if (!s) |
| 1672 | goto nope; |
| 1673 | /* How to do it in subst? */ |
| 1674 | /* if ( (rx->reganch & ROPT_CHECK_ALL) |
| 1675 | && !PL_sawampersand |
| 1676 | && ((rx->reganch & ROPT_NOSCAN) |
| 1677 | || !((rx->reganch & RE_INTUIT_TAIL) |
| 1678 | && (r_flags & REXEC_SCREAM)))) |
| 1679 | goto yup; |
| 1680 | */ |
| 1681 | } |
| 1682 | |
| 1683 | /* only replace once? */ |
| 1684 | once = !(rpm->op_pmflags & PMf_GLOBAL); |
| 1685 | |
| 1686 | /* known replacement string? */ |
| 1687 | c = dstr ? SvPV(dstr, clen) : Nullch; |
| 1688 | |
| 1689 | /* can do inplace substitution? */ |
| 1690 | if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR)) |
| 1691 | && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) { |
| 1692 | if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL, |
| 1693 | r_flags | REXEC_CHECKED)) |
| 1694 | { |
| 1695 | SPAGAIN; |
| 1696 | PUSHs(&PL_sv_no); |
| 1697 | LEAVE_SCOPE(oldsave); |
| 1698 | RETURN; |
| 1699 | } |
| 1700 | if (force_on_match) { |
| 1701 | force_on_match = 0; |
| 1702 | s = SvPV_force(TARG, len); |
| 1703 | goto force_it; |
| 1704 | } |
| 1705 | d = s; |
| 1706 | PL_curpm = pm; |
| 1707 | SvSCREAM_off(TARG); /* disable possible screamer */ |
| 1708 | if (once) { |
| 1709 | rxtainted |= RX_MATCH_TAINTED(rx); |
| 1710 | m = orig + rx->startp[0]; |
| 1711 | d = orig + rx->endp[0]; |
| 1712 | s = orig; |
| 1713 | if (m - s > strend - d) { /* faster to shorten from end */ |
| 1714 | if (clen) { |
| 1715 | Copy(c, m, clen, char); |
| 1716 | m += clen; |
| 1717 | } |
| 1718 | i = strend - d; |
| 1719 | if (i > 0) { |
| 1720 | Move(d, m, i, char); |
| 1721 | m += i; |
| 1722 | } |
| 1723 | *m = '\0'; |
| 1724 | SvCUR_set(TARG, m - s); |
| 1725 | } |
| 1726 | /*SUPPRESS 560*/ |
| 1727 | else if (i = m - s) { /* faster from front */ |
| 1728 | d -= clen; |
| 1729 | m = d; |
| 1730 | sv_chop(TARG, d-i); |
| 1731 | s += i; |
| 1732 | while (i--) |
| 1733 | *--d = *--s; |
| 1734 | if (clen) |
| 1735 | Copy(c, m, clen, char); |
| 1736 | } |
| 1737 | else if (clen) { |
| 1738 | d -= clen; |
| 1739 | sv_chop(TARG, d); |
| 1740 | Copy(c, d, clen, char); |
| 1741 | } |
| 1742 | else { |
| 1743 | sv_chop(TARG, d); |
| 1744 | } |
| 1745 | TAINT_IF(rxtainted & 1); |
| 1746 | SPAGAIN; |
| 1747 | PUSHs(&PL_sv_yes); |
| 1748 | } |
| 1749 | else { |
| 1750 | do { |
| 1751 | if (iters++ > maxiters) |
| 1752 | DIE(aTHX_ "Substitution loop"); |
| 1753 | rxtainted |= RX_MATCH_TAINTED(rx); |
| 1754 | m = rx->startp[0] + orig; |
| 1755 | /*SUPPRESS 560*/ |
| 1756 | if (i = m - s) { |
| 1757 | if (s != d) |
| 1758 | Move(s, d, i, char); |
| 1759 | d += i; |
| 1760 | } |
| 1761 | if (clen) { |
| 1762 | Copy(c, d, clen, char); |
| 1763 | d += clen; |
| 1764 | } |
| 1765 | s = rx->endp[0] + orig; |
| 1766 | } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, |
| 1767 | TARG, NULL, |
| 1768 | /* don't match same null twice */ |
| 1769 | REXEC_NOT_FIRST|REXEC_IGNOREPOS)); |
| 1770 | if (s != d) { |
| 1771 | i = strend - s; |
| 1772 | SvCUR_set(TARG, d - SvPVX(TARG) + i); |
| 1773 | Move(s, d, i+1, char); /* include the NUL */ |
| 1774 | } |
| 1775 | TAINT_IF(rxtainted & 1); |
| 1776 | SPAGAIN; |
| 1777 | PUSHs(sv_2mortal(newSViv((I32)iters))); |
| 1778 | } |
| 1779 | (void)SvPOK_only(TARG); |
| 1780 | TAINT_IF(rxtainted); |
| 1781 | if (SvSMAGICAL(TARG)) { |
| 1782 | PUTBACK; |
| 1783 | mg_set(TARG); |
| 1784 | SPAGAIN; |
| 1785 | } |
| 1786 | SvTAINT(TARG); |
| 1787 | LEAVE_SCOPE(oldsave); |
| 1788 | RETURN; |
| 1789 | } |
| 1790 | |
| 1791 | if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL, |
| 1792 | r_flags | REXEC_CHECKED)) |
| 1793 | { |
| 1794 | if (force_on_match) { |
| 1795 | force_on_match = 0; |
| 1796 | s = SvPV_force(TARG, len); |
| 1797 | goto force_it; |
| 1798 | } |
| 1799 | rxtainted |= RX_MATCH_TAINTED(rx); |
| 1800 | dstr = NEWSV(25, len); |
| 1801 | sv_setpvn(dstr, m, s-m); |
| 1802 | PL_curpm = pm; |
| 1803 | if (!c) { |
| 1804 | register PERL_CONTEXT *cx; |
| 1805 | SPAGAIN; |
| 1806 | PUSHSUBST(cx); |
| 1807 | RETURNOP(cPMOP->op_pmreplroot); |
| 1808 | } |
| 1809 | r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST; |
| 1810 | do { |
| 1811 | if (iters++ > maxiters) |
| 1812 | DIE(aTHX_ "Substitution loop"); |
| 1813 | rxtainted |= RX_MATCH_TAINTED(rx); |
| 1814 | if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) { |
| 1815 | m = s; |
| 1816 | s = orig; |
| 1817 | orig = rx->subbeg; |
| 1818 | s = orig + (m - s); |
| 1819 | strend = s + (strend - m); |
| 1820 | } |
| 1821 | m = rx->startp[0] + orig; |
| 1822 | sv_catpvn(dstr, s, m-s); |
| 1823 | s = rx->endp[0] + orig; |
| 1824 | if (clen) |
| 1825 | sv_catpvn(dstr, c, clen); |
| 1826 | if (once) |
| 1827 | break; |
| 1828 | } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags)); |
| 1829 | sv_catpvn(dstr, s, strend - s); |
| 1830 | |
| 1831 | (void)SvOOK_off(TARG); |
| 1832 | Safefree(SvPVX(TARG)); |
| 1833 | SvPVX(TARG) = SvPVX(dstr); |
| 1834 | SvCUR_set(TARG, SvCUR(dstr)); |
| 1835 | SvLEN_set(TARG, SvLEN(dstr)); |
| 1836 | SvPVX(dstr) = 0; |
| 1837 | sv_free(dstr); |
| 1838 | |
| 1839 | TAINT_IF(rxtainted & 1); |
| 1840 | SPAGAIN; |
| 1841 | PUSHs(sv_2mortal(newSViv((I32)iters))); |
| 1842 | |
| 1843 | (void)SvPOK_only(TARG); |
| 1844 | TAINT_IF(rxtainted); |
| 1845 | SvSETMAGIC(TARG); |
| 1846 | SvTAINT(TARG); |
| 1847 | LEAVE_SCOPE(oldsave); |
| 1848 | RETURN; |
| 1849 | } |
| 1850 | goto ret_no; |
| 1851 | |
| 1852 | nope: |
| 1853 | ret_no: |
| 1854 | SPAGAIN; |
| 1855 | PUSHs(&PL_sv_no); |
| 1856 | LEAVE_SCOPE(oldsave); |
| 1857 | RETURN; |
| 1858 | } |
| 1859 | |
| 1860 | PP(pp_grepwhile) |
| 1861 | { |
| 1862 | djSP; |
| 1863 | |
| 1864 | if (SvTRUEx(POPs)) |
| 1865 | PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr]; |
| 1866 | ++*PL_markstack_ptr; |
| 1867 | LEAVE; /* exit inner scope */ |
| 1868 | |
| 1869 | /* All done yet? */ |
| 1870 | if (PL_stack_base + *PL_markstack_ptr > SP) { |
| 1871 | I32 items; |
| 1872 | I32 gimme = GIMME_V; |
| 1873 | |
| 1874 | LEAVE; /* exit outer scope */ |
| 1875 | (void)POPMARK; /* pop src */ |
| 1876 | items = --*PL_markstack_ptr - PL_markstack_ptr[-1]; |
| 1877 | (void)POPMARK; /* pop dst */ |
| 1878 | SP = PL_stack_base + POPMARK; /* pop original mark */ |
| 1879 | if (gimme == G_SCALAR) { |
| 1880 | dTARGET; |
| 1881 | XPUSHi(items); |
| 1882 | } |
| 1883 | else if (gimme == G_ARRAY) |
| 1884 | SP += items; |
| 1885 | RETURN; |
| 1886 | } |
| 1887 | else { |
| 1888 | SV *src; |
| 1889 | |
| 1890 | ENTER; /* enter inner scope */ |
| 1891 | SAVESPTR(PL_curpm); |
| 1892 | |
| 1893 | src = PL_stack_base[*PL_markstack_ptr]; |
| 1894 | SvTEMP_off(src); |
| 1895 | DEFSV = src; |
| 1896 | |
| 1897 | RETURNOP(cLOGOP->op_other); |
| 1898 | } |
| 1899 | } |
| 1900 | |
| 1901 | PP(pp_leavesub) |
| 1902 | { |
| 1903 | djSP; |
| 1904 | SV **mark; |
| 1905 | SV **newsp; |
| 1906 | PMOP *newpm; |
| 1907 | I32 gimme; |
| 1908 | register PERL_CONTEXT *cx; |
| 1909 | struct block_sub cxsub; |
| 1910 | |
| 1911 | POPBLOCK(cx,newpm); |
| 1912 | POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */ |
| 1913 | |
| 1914 | TAINT_NOT; |
| 1915 | if (gimme == G_SCALAR) { |
| 1916 | MARK = newsp + 1; |
| 1917 | if (MARK <= SP) { |
| 1918 | if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) { |
| 1919 | if (SvTEMP(TOPs)) { |
| 1920 | *MARK = SvREFCNT_inc(TOPs); |
| 1921 | FREETMPS; |
| 1922 | sv_2mortal(*MARK); |
| 1923 | } else { |
| 1924 | FREETMPS; |
| 1925 | *MARK = sv_mortalcopy(TOPs); |
| 1926 | } |
| 1927 | } else |
| 1928 | *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs); |
| 1929 | } else { |
| 1930 | MEXTEND(MARK, 0); |
| 1931 | *MARK = &PL_sv_undef; |
| 1932 | } |
| 1933 | SP = MARK; |
| 1934 | } |
| 1935 | else if (gimme == G_ARRAY) { |
| 1936 | for (MARK = newsp + 1; MARK <= SP; MARK++) { |
| 1937 | if (!SvTEMP(*MARK)) { |
| 1938 | *MARK = sv_mortalcopy(*MARK); |
| 1939 | TAINT_NOT; /* Each item is independent */ |
| 1940 | } |
| 1941 | } |
| 1942 | } |
| 1943 | PUTBACK; |
| 1944 | |
| 1945 | POPSUB2(); /* Stack values are safe: release CV and @_ ... */ |
| 1946 | PL_curpm = newpm; /* ... and pop $1 et al */ |
| 1947 | |
| 1948 | LEAVE; |
| 1949 | return pop_return(); |
| 1950 | } |
| 1951 | |
| 1952 | STATIC CV * |
| 1953 | S_get_db_sub(pTHX_ SV **svp, CV *cv) |
| 1954 | { |
| 1955 | dTHR; |
| 1956 | SV *dbsv = GvSV(PL_DBsub); |
| 1957 | |
| 1958 | if (!PERLDB_SUB_NN) { |
| 1959 | GV *gv = CvGV(cv); |
| 1960 | |
| 1961 | save_item(dbsv); |
| 1962 | if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED)) |
| 1963 | || strEQ(GvNAME(gv), "END") |
| 1964 | || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */ |
| 1965 | !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv) |
| 1966 | && (gv = (GV*)*svp) ))) { |
| 1967 | /* Use GV from the stack as a fallback. */ |
| 1968 | /* GV is potentially non-unique, or contain different CV. */ |
| 1969 | sv_setsv(dbsv, newRV((SV*)cv)); |
| 1970 | } |
| 1971 | else { |
| 1972 | gv_efullname3(dbsv, gv, Nullch); |
| 1973 | } |
| 1974 | } |
| 1975 | else { |
| 1976 | SvUPGRADE(dbsv, SVt_PVIV); |
| 1977 | SvIOK_on(dbsv); |
| 1978 | SAVEIV(SvIVX(dbsv)); |
| 1979 | SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */ |
| 1980 | } |
| 1981 | |
| 1982 | if (CvXSUB(cv)) |
| 1983 | PL_curcopdb = PL_curcop; |
| 1984 | cv = GvCV(PL_DBsub); |
| 1985 | return cv; |
| 1986 | } |
| 1987 | |
| 1988 | PP(pp_entersub) |
| 1989 | { |
| 1990 | djSP; dPOPss; |
| 1991 | GV *gv; |
| 1992 | HV *stash; |
| 1993 | register CV *cv; |
| 1994 | register PERL_CONTEXT *cx; |
| 1995 | I32 gimme; |
| 1996 | bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0; |
| 1997 | |
| 1998 | if (!sv) |
| 1999 | DIE(aTHX_ "Not a CODE reference"); |
| 2000 | switch (SvTYPE(sv)) { |
| 2001 | default: |
| 2002 | if (!SvROK(sv)) { |
| 2003 | char *sym; |
| 2004 | STRLEN n_a; |
| 2005 | |
| 2006 | if (sv == &PL_sv_yes) { /* unfound import, ignore */ |
| 2007 | if (hasargs) |
| 2008 | SP = PL_stack_base + POPMARK; |
| 2009 | RETURN; |
| 2010 | } |
| 2011 | if (SvGMAGICAL(sv)) { |
| 2012 | mg_get(sv); |
| 2013 | sym = SvPOKp(sv) ? SvPVX(sv) : Nullch; |
| 2014 | } |
| 2015 | else |
| 2016 | sym = SvPV(sv, n_a); |
| 2017 | if (!sym) |
| 2018 | DIE(aTHX_ PL_no_usym, "a subroutine"); |
| 2019 | if (PL_op->op_private & HINT_STRICT_REFS) |
| 2020 | DIE(aTHX_ PL_no_symref, sym, "a subroutine"); |
| 2021 | cv = get_cv(sym, TRUE); |
| 2022 | break; |
| 2023 | } |
| 2024 | { |
| 2025 | SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */ |
| 2026 | tryAMAGICunDEREF(to_cv); |
| 2027 | } |
| 2028 | cv = (CV*)SvRV(sv); |
| 2029 | if (SvTYPE(cv) == SVt_PVCV) |
| 2030 | break; |
| 2031 | /* FALL THROUGH */ |
| 2032 | case SVt_PVHV: |
| 2033 | case SVt_PVAV: |
| 2034 | DIE(aTHX_ "Not a CODE reference"); |
| 2035 | case SVt_PVCV: |
| 2036 | cv = (CV*)sv; |
| 2037 | break; |
| 2038 | case SVt_PVGV: |
| 2039 | if (!(cv = GvCVu((GV*)sv))) |
| 2040 | cv = sv_2cv(sv, &stash, &gv, FALSE); |
| 2041 | if (!cv) { |
| 2042 | ENTER; |
| 2043 | SAVETMPS; |
| 2044 | goto try_autoload; |
| 2045 | } |
| 2046 | break; |
| 2047 | } |
| 2048 | |
| 2049 | ENTER; |
| 2050 | SAVETMPS; |
| 2051 | |
| 2052 | retry: |
| 2053 | if (!CvROOT(cv) && !CvXSUB(cv)) { |
| 2054 | GV* autogv; |
| 2055 | SV* sub_name; |
| 2056 | |
| 2057 | /* anonymous or undef'd function leaves us no recourse */ |
| 2058 | if (CvANON(cv) || !(gv = CvGV(cv))) |
| 2059 | DIE(aTHX_ "Undefined subroutine called"); |
| 2060 | |
| 2061 | /* autoloaded stub? */ |
| 2062 | if (cv != GvCV(gv)) { |
| 2063 | cv = GvCV(gv); |
| 2064 | } |
| 2065 | /* should call AUTOLOAD now? */ |
| 2066 | else { |
| 2067 | try_autoload: |
| 2068 | if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv), |
| 2069 | FALSE))) |
| 2070 | { |
| 2071 | cv = GvCV(autogv); |
| 2072 | } |
| 2073 | /* sorry */ |
| 2074 | else { |
| 2075 | sub_name = sv_newmortal(); |
| 2076 | gv_efullname3(sub_name, gv, Nullch); |
| 2077 | DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name)); |
| 2078 | } |
| 2079 | } |
| 2080 | if (!cv) |
| 2081 | DIE(aTHX_ "Not a CODE reference"); |
| 2082 | goto retry; |
| 2083 | } |
| 2084 | |
| 2085 | gimme = GIMME_V; |
| 2086 | if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) { |
| 2087 | cv = get_db_sub(&sv, cv); |
| 2088 | if (!cv) |
| 2089 | DIE(aTHX_ "No DBsub routine"); |
| 2090 | } |
| 2091 | |
| 2092 | #ifdef USE_THREADS |
| 2093 | /* |
| 2094 | * First we need to check if the sub or method requires locking. |
| 2095 | * If so, we gain a lock on the CV, the first argument or the |
| 2096 | * stash (for static methods), as appropriate. This has to be |
| 2097 | * inline because for FAKE_THREADS, COND_WAIT inlines code to |
| 2098 | * reschedule by returning a new op. |
| 2099 | */ |
| 2100 | MUTEX_LOCK(CvMUTEXP(cv)); |
| 2101 | if (CvFLAGS(cv) & CVf_LOCKED) { |
| 2102 | MAGIC *mg; |
| 2103 | if (CvFLAGS(cv) & CVf_METHOD) { |
| 2104 | if (SP > PL_stack_base + TOPMARK) |
| 2105 | sv = *(PL_stack_base + TOPMARK + 1); |
| 2106 | else { |
| 2107 | AV *av = (AV*)PL_curpad[0]; |
| 2108 | if (hasargs || !av || AvFILLp(av) < 0 |
| 2109 | || !(sv = AvARRAY(av)[0])) |
| 2110 | { |
| 2111 | MUTEX_UNLOCK(CvMUTEXP(cv)); |
| 2112 | Perl_croak(aTHX_ "no argument for locked method call"); |
| 2113 | } |
| 2114 | } |
| 2115 | if (SvROK(sv)) |
| 2116 | sv = SvRV(sv); |
| 2117 | else { |
| 2118 | STRLEN len; |
| 2119 | char *stashname = SvPV(sv, len); |
| 2120 | sv = (SV*)gv_stashpvn(stashname, len, TRUE); |
| 2121 | } |
| 2122 | } |
| 2123 | else { |
| 2124 | sv = (SV*)cv; |
| 2125 | } |
| 2126 | MUTEX_UNLOCK(CvMUTEXP(cv)); |
| 2127 | mg = condpair_magic(sv); |
| 2128 | MUTEX_LOCK(MgMUTEXP(mg)); |
| 2129 | if (MgOWNER(mg) == thr) |
| 2130 | MUTEX_UNLOCK(MgMUTEXP(mg)); |
| 2131 | else { |
| 2132 | while (MgOWNER(mg)) |
| 2133 | COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg)); |
| 2134 | MgOWNER(mg) = thr; |
| 2135 | DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n", |
| 2136 | thr, sv);) |
| 2137 | MUTEX_UNLOCK(MgMUTEXP(mg)); |
| 2138 | SAVEDESTRUCTOR(Perl_unlock_condpair, sv); |
| 2139 | } |
| 2140 | MUTEX_LOCK(CvMUTEXP(cv)); |
| 2141 | } |
| 2142 | /* |
| 2143 | * Now we have permission to enter the sub, we must distinguish |
| 2144 | * four cases. (0) It's an XSUB (in which case we don't care |
| 2145 | * about ownership); (1) it's ours already (and we're recursing); |
| 2146 | * (2) it's free (but we may already be using a cached clone); |
| 2147 | * (3) another thread owns it. Case (1) is easy: we just use it. |
| 2148 | * Case (2) means we look for a clone--if we have one, use it |
| 2149 | * otherwise grab ownership of cv. Case (3) means we look for a |
| 2150 | * clone (for non-XSUBs) and have to create one if we don't |
| 2151 | * already have one. |
| 2152 | * Why look for a clone in case (2) when we could just grab |
| 2153 | * ownership of cv straight away? Well, we could be recursing, |
| 2154 | * i.e. we originally tried to enter cv while another thread |
| 2155 | * owned it (hence we used a clone) but it has been freed up |
| 2156 | * and we're now recursing into it. It may or may not be "better" |
| 2157 | * to use the clone but at least CvDEPTH can be trusted. |
| 2158 | */ |
| 2159 | if (CvOWNER(cv) == thr || CvXSUB(cv)) |
| 2160 | MUTEX_UNLOCK(CvMUTEXP(cv)); |
| 2161 | else { |
| 2162 | /* Case (2) or (3) */ |
| 2163 | SV **svp; |
| 2164 | |
| 2165 | /* |
| 2166 | * XXX Might it be better to release CvMUTEXP(cv) while we |
| 2167 | * do the hv_fetch? We might find someone has pinched it |
| 2168 | * when we look again, in which case we would be in case |
| 2169 | * (3) instead of (2) so we'd have to clone. Would the fact |
| 2170 | * that we released the mutex more quickly make up for this? |
| 2171 | */ |
| 2172 | if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE))) |
| 2173 | { |
| 2174 | /* We already have a clone to use */ |
| 2175 | MUTEX_UNLOCK(CvMUTEXP(cv)); |
| 2176 | cv = *(CV**)svp; |
| 2177 | DEBUG_S(PerlIO_printf(PerlIO_stderr(), |
| 2178 | "entersub: %p already has clone %p:%s\n", |
| 2179 | thr, cv, SvPEEK((SV*)cv))); |
| 2180 | CvOWNER(cv) = thr; |
| 2181 | SvREFCNT_inc(cv); |
| 2182 | if (CvDEPTH(cv) == 0) |
| 2183 | SAVEDESTRUCTOR(unset_cvowner, (void*) cv); |
| 2184 | } |
| 2185 | else { |
| 2186 | /* (2) => grab ownership of cv. (3) => make clone */ |
| 2187 | if (!CvOWNER(cv)) { |
| 2188 | CvOWNER(cv) = thr; |
| 2189 | SvREFCNT_inc(cv); |
| 2190 | MUTEX_UNLOCK(CvMUTEXP(cv)); |
| 2191 | DEBUG_S(PerlIO_printf(PerlIO_stderr(), |
| 2192 | "entersub: %p grabbing %p:%s in stash %s\n", |
| 2193 | thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ? |
| 2194 | HvNAME(CvSTASH(cv)) : "(none)")); |
| 2195 | } else { |
| 2196 | /* Make a new clone. */ |
| 2197 | CV *clonecv; |
| 2198 | SvREFCNT_inc(cv); /* don't let it vanish from under us */ |
| 2199 | MUTEX_UNLOCK(CvMUTEXP(cv)); |
| 2200 | DEBUG_S((PerlIO_printf(PerlIO_stderr(), |
| 2201 | "entersub: %p cloning %p:%s\n", |
| 2202 | thr, cv, SvPEEK((SV*)cv)))); |
| 2203 | /* |
| 2204 | * We're creating a new clone so there's no race |
| 2205 | * between the original MUTEX_UNLOCK and the |
| 2206 | * SvREFCNT_inc since no one will be trying to undef |
| 2207 | * it out from underneath us. At least, I don't think |
| 2208 | * there's a race... |
| 2209 | */ |
| 2210 | clonecv = cv_clone(cv); |
| 2211 | SvREFCNT_dec(cv); /* finished with this */ |
| 2212 | hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0); |
| 2213 | CvOWNER(clonecv) = thr; |
| 2214 | cv = clonecv; |
| 2215 | SvREFCNT_inc(cv); |
| 2216 | } |
| 2217 | DEBUG_S(if (CvDEPTH(cv) != 0) |
| 2218 | PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n", |
| 2219 | CvDEPTH(cv));); |
| 2220 | SAVEDESTRUCTOR(unset_cvowner, (void*) cv); |
| 2221 | } |
| 2222 | } |
| 2223 | #endif /* USE_THREADS */ |
| 2224 | |
| 2225 | if (CvXSUB(cv)) { |
| 2226 | #ifdef PERL_XSUB_OLDSTYLE |
| 2227 | if (CvOLDSTYLE(cv)) { |
| 2228 | I32 (*fp3)(int,int,int); |
| 2229 | dMARK; |
| 2230 | register I32 items = SP - MARK; |
| 2231 | /* We dont worry to copy from @_. */ |
| 2232 | while (SP > mark) { |
| 2233 | SP[1] = SP[0]; |
| 2234 | SP--; |
| 2235 | } |
| 2236 | PL_stack_sp = mark + 1; |
| 2237 | fp3 = (I32(*)(int,int,int)))CvXSUB(cv; |
| 2238 | items = (*fp3)(CvXSUBANY(cv).any_i32, |
| 2239 | MARK - PL_stack_base + 1, |
| 2240 | items); |
| 2241 | PL_stack_sp = PL_stack_base + items; |
| 2242 | } |
| 2243 | else |
| 2244 | #endif /* PERL_XSUB_OLDSTYLE */ |
| 2245 | { |
| 2246 | I32 markix = TOPMARK; |
| 2247 | |
| 2248 | PUTBACK; |
| 2249 | |
| 2250 | if (!hasargs) { |
| 2251 | /* Need to copy @_ to stack. Alternative may be to |
| 2252 | * switch stack to @_, and copy return values |
| 2253 | * back. This would allow popping @_ in XSUB, e.g.. XXXX */ |
| 2254 | AV* av; |
| 2255 | I32 items; |
| 2256 | #ifdef USE_THREADS |
| 2257 | av = (AV*)PL_curpad[0]; |
| 2258 | #else |
| 2259 | av = GvAV(PL_defgv); |
| 2260 | #endif /* USE_THREADS */ |
| 2261 | items = AvFILLp(av) + 1; /* @_ is not tieable */ |
| 2262 | |
| 2263 | if (items) { |
| 2264 | /* Mark is at the end of the stack. */ |
| 2265 | EXTEND(SP, items); |
| 2266 | Copy(AvARRAY(av), SP + 1, items, SV*); |
| 2267 | SP += items; |
| 2268 | PUTBACK ; |
| 2269 | } |
| 2270 | } |
| 2271 | /* We assume first XSUB in &DB::sub is the called one. */ |
| 2272 | if (PL_curcopdb) { |
| 2273 | SAVESPTR(PL_curcop); |
| 2274 | PL_curcop = PL_curcopdb; |
| 2275 | PL_curcopdb = NULL; |
| 2276 | } |
| 2277 | /* Do we need to open block here? XXXX */ |
| 2278 | (void)(*CvXSUB(cv))(aTHXo_ cv); |
| 2279 | |
| 2280 | /* Enforce some sanity in scalar context. */ |
| 2281 | if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) { |
| 2282 | if (markix > PL_stack_sp - PL_stack_base) |
| 2283 | *(PL_stack_base + markix) = &PL_sv_undef; |
| 2284 | else |
| 2285 | *(PL_stack_base + markix) = *PL_stack_sp; |
| 2286 | PL_stack_sp = PL_stack_base + markix; |
| 2287 | } |
| 2288 | } |
| 2289 | LEAVE; |
| 2290 | return NORMAL; |
| 2291 | } |
| 2292 | else { |
| 2293 | dMARK; |
| 2294 | register I32 items = SP - MARK; |
| 2295 | AV* padlist = CvPADLIST(cv); |
| 2296 | SV** svp = AvARRAY(padlist); |
| 2297 | push_return(PL_op->op_next); |
| 2298 | PUSHBLOCK(cx, CXt_SUB, MARK); |
| 2299 | PUSHSUB(cx); |
| 2300 | CvDEPTH(cv)++; |
| 2301 | /* XXX This would be a natural place to set C<PL_compcv = cv> so |
| 2302 | * that eval'' ops within this sub know the correct lexical space. |
| 2303 | * Owing the speed considerations, we choose to search for the cv |
| 2304 | * in doeval() instead. |
| 2305 | */ |
| 2306 | if (CvDEPTH(cv) < 2) |
| 2307 | (void)SvREFCNT_inc(cv); |
| 2308 | else { /* save temporaries on recursion? */ |
| 2309 | if (CvDEPTH(cv) > AvFILLp(padlist)) { |
| 2310 | AV *av; |
| 2311 | AV *newpad = newAV(); |
| 2312 | SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]); |
| 2313 | I32 ix = AvFILLp((AV*)svp[1]); |
| 2314 | svp = AvARRAY(svp[0]); |
| 2315 | for ( ;ix > 0; ix--) { |
| 2316 | if (svp[ix] != &PL_sv_undef) { |
| 2317 | char *name = SvPVX(svp[ix]); |
| 2318 | if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */ |
| 2319 | || *name == '&') /* anonymous code? */ |
| 2320 | { |
| 2321 | av_store(newpad, ix, SvREFCNT_inc(oldpad[ix])); |
| 2322 | } |
| 2323 | else { /* our own lexical */ |
| 2324 | if (*name == '@') |
| 2325 | av_store(newpad, ix, sv = (SV*)newAV()); |
| 2326 | else if (*name == '%') |
| 2327 | av_store(newpad, ix, sv = (SV*)newHV()); |
| 2328 | else |
| 2329 | av_store(newpad, ix, sv = NEWSV(0,0)); |
| 2330 | SvPADMY_on(sv); |
| 2331 | } |
| 2332 | } |
| 2333 | else { |
| 2334 | av_store(newpad, ix, sv = NEWSV(0,0)); |
| 2335 | SvPADTMP_on(sv); |
| 2336 | } |
| 2337 | } |
| 2338 | av = newAV(); /* will be @_ */ |
| 2339 | av_extend(av, 0); |
| 2340 | av_store(newpad, 0, (SV*)av); |
| 2341 | AvFLAGS(av) = AVf_REIFY; |
| 2342 | av_store(padlist, CvDEPTH(cv), (SV*)newpad); |
| 2343 | AvFILLp(padlist) = CvDEPTH(cv); |
| 2344 | svp = AvARRAY(padlist); |
| 2345 | } |
| 2346 | } |
| 2347 | #ifdef USE_THREADS |
| 2348 | if (!hasargs) { |
| 2349 | AV* av = (AV*)PL_curpad[0]; |
| 2350 | |
| 2351 | items = AvFILLp(av) + 1; |
| 2352 | if (items) { |
| 2353 | /* Mark is at the end of the stack. */ |
| 2354 | EXTEND(SP, items); |
| 2355 | Copy(AvARRAY(av), SP + 1, items, SV*); |
| 2356 | SP += items; |
| 2357 | PUTBACK ; |
| 2358 | } |
| 2359 | } |
| 2360 | #endif /* USE_THREADS */ |
| 2361 | SAVESPTR(PL_curpad); |
| 2362 | PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]); |
| 2363 | #ifndef USE_THREADS |
| 2364 | if (hasargs) |
| 2365 | #endif /* USE_THREADS */ |
| 2366 | { |
| 2367 | AV* av; |
| 2368 | SV** ary; |
| 2369 | |
| 2370 | #if 0 |
| 2371 | DEBUG_S(PerlIO_printf(PerlIO_stderr(), |
| 2372 | "%p entersub preparing @_\n", thr)); |
| 2373 | #endif |
| 2374 | av = (AV*)PL_curpad[0]; |
| 2375 | if (AvREAL(av)) { |
| 2376 | av_clear(av); |
| 2377 | AvREAL_off(av); |
| 2378 | } |
| 2379 | #ifndef USE_THREADS |
| 2380 | cx->blk_sub.savearray = GvAV(PL_defgv); |
| 2381 | GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av); |
| 2382 | #endif /* USE_THREADS */ |
| 2383 | cx->blk_sub.argarray = av; |
| 2384 | ++MARK; |
| 2385 | |
| 2386 | if (items > AvMAX(av) + 1) { |
| 2387 | ary = AvALLOC(av); |
| 2388 | if (AvARRAY(av) != ary) { |
| 2389 | AvMAX(av) += AvARRAY(av) - AvALLOC(av); |
| 2390 | SvPVX(av) = (char*)ary; |
| 2391 | } |
| 2392 | if (items > AvMAX(av) + 1) { |
| 2393 | AvMAX(av) = items - 1; |
| 2394 | Renew(ary,items,SV*); |
| 2395 | AvALLOC(av) = ary; |
| 2396 | SvPVX(av) = (char*)ary; |
| 2397 | } |
| 2398 | } |
| 2399 | Copy(MARK,AvARRAY(av),items,SV*); |
| 2400 | AvFILLp(av) = items - 1; |
| 2401 | |
| 2402 | while (items--) { |
| 2403 | if (*MARK) |
| 2404 | SvTEMP_off(*MARK); |
| 2405 | MARK++; |
| 2406 | } |
| 2407 | } |
| 2408 | /* warning must come *after* we fully set up the context |
| 2409 | * stuff so that __WARN__ handlers can safely dounwind() |
| 2410 | * if they want to |
| 2411 | */ |
| 2412 | if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION) |
| 2413 | && !(PERLDB_SUB && cv == GvCV(PL_DBsub))) |
| 2414 | sub_crush_depth(cv); |
| 2415 | #if 0 |
| 2416 | DEBUG_S(PerlIO_printf(PerlIO_stderr(), |
| 2417 | "%p entersub returning %p\n", thr, CvSTART(cv))); |
| 2418 | #endif |
| 2419 | RETURNOP(CvSTART(cv)); |
| 2420 | } |
| 2421 | } |
| 2422 | |
| 2423 | void |
| 2424 | Perl_sub_crush_depth(pTHX_ CV *cv) |
| 2425 | { |
| 2426 | if (CvANON(cv)) |
| 2427 | Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine"); |
| 2428 | else { |
| 2429 | SV* tmpstr = sv_newmortal(); |
| 2430 | gv_efullname3(tmpstr, CvGV(cv), Nullch); |
| 2431 | Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"", |
| 2432 | SvPVX(tmpstr)); |
| 2433 | } |
| 2434 | } |
| 2435 | |
| 2436 | PP(pp_aelem) |
| 2437 | { |
| 2438 | djSP; |
| 2439 | SV** svp; |
| 2440 | I32 elem = POPi; |
| 2441 | AV* av = (AV*)POPs; |
| 2442 | U32 lval = PL_op->op_flags & OPf_MOD; |
| 2443 | U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av)); |
| 2444 | SV *sv; |
| 2445 | |
| 2446 | if (elem > 0) |
| 2447 | elem -= PL_curcop->cop_arybase; |
| 2448 | if (SvTYPE(av) != SVt_PVAV) |
| 2449 | RETPUSHUNDEF; |
| 2450 | svp = av_fetch(av, elem, lval && !defer); |
| 2451 | if (lval) { |
| 2452 | if (!svp || *svp == &PL_sv_undef) { |
| 2453 | SV* lv; |
| 2454 | if (!defer) |
| 2455 | DIE(aTHX_ PL_no_aelem, elem); |
| 2456 | lv = sv_newmortal(); |
| 2457 | sv_upgrade(lv, SVt_PVLV); |
| 2458 | LvTYPE(lv) = 'y'; |
| 2459 | sv_magic(lv, Nullsv, 'y', Nullch, 0); |
| 2460 | LvTARG(lv) = SvREFCNT_inc(av); |
| 2461 | LvTARGOFF(lv) = elem; |
| 2462 | LvTARGLEN(lv) = 1; |
| 2463 | PUSHs(lv); |
| 2464 | RETURN; |
| 2465 | } |
| 2466 | if (PL_op->op_private & OPpLVAL_INTRO) |
| 2467 | save_aelem(av, elem, svp); |
| 2468 | else if (PL_op->op_private & OPpDEREF) |
| 2469 | vivify_ref(*svp, PL_op->op_private & OPpDEREF); |
| 2470 | } |
| 2471 | sv = (svp ? *svp : &PL_sv_undef); |
| 2472 | if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */ |
| 2473 | sv = sv_mortalcopy(sv); |
| 2474 | PUSHs(sv); |
| 2475 | RETURN; |
| 2476 | } |
| 2477 | |
| 2478 | void |
| 2479 | Perl_vivify_ref(pTHX_ SV *sv, U32 to_what) |
| 2480 | { |
| 2481 | if (SvGMAGICAL(sv)) |
| 2482 | mg_get(sv); |
| 2483 | if (!SvOK(sv)) { |
| 2484 | if (SvREADONLY(sv)) |
| 2485 | Perl_croak(aTHX_ PL_no_modify); |
| 2486 | if (SvTYPE(sv) < SVt_RV) |
| 2487 | sv_upgrade(sv, SVt_RV); |
| 2488 | else if (SvTYPE(sv) >= SVt_PV) { |
| 2489 | (void)SvOOK_off(sv); |
| 2490 | Safefree(SvPVX(sv)); |
| 2491 | SvLEN(sv) = SvCUR(sv) = 0; |
| 2492 | } |
| 2493 | switch (to_what) { |
| 2494 | case OPpDEREF_SV: |
| 2495 | SvRV(sv) = NEWSV(355,0); |
| 2496 | break; |
| 2497 | case OPpDEREF_AV: |
| 2498 | SvRV(sv) = (SV*)newAV(); |
| 2499 | break; |
| 2500 | case OPpDEREF_HV: |
| 2501 | SvRV(sv) = (SV*)newHV(); |
| 2502 | break; |
| 2503 | } |
| 2504 | SvROK_on(sv); |
| 2505 | SvSETMAGIC(sv); |
| 2506 | } |
| 2507 | } |
| 2508 | |
| 2509 | PP(pp_method) |
| 2510 | { |
| 2511 | djSP; |
| 2512 | SV* sv = TOPs; |
| 2513 | |
| 2514 | if (SvROK(sv)) { |
| 2515 | SV* rsv = SvRV(sv); |
| 2516 | if (SvTYPE(rsv) == SVt_PVCV) { |
| 2517 | SETs(rsv); |
| 2518 | RETURN; |
| 2519 | } |
| 2520 | } |
| 2521 | |
| 2522 | SETs(method_common(sv, Null(U32*))); |
| 2523 | RETURN; |
| 2524 | } |
| 2525 | |
| 2526 | PP(pp_method_named) |
| 2527 | { |
| 2528 | djSP; |
| 2529 | SV* sv = cSVOP->op_sv; |
| 2530 | U32 hash = SvUVX(sv); |
| 2531 | |
| 2532 | XPUSHs(method_common(sv, &hash)); |
| 2533 | RETURN; |
| 2534 | } |
| 2535 | |
| 2536 | STATIC SV * |
| 2537 | S_method_common(pTHX_ SV* meth, U32* hashp) |
| 2538 | { |
| 2539 | djSP; |
| 2540 | SV* sv; |
| 2541 | SV* ob; |
| 2542 | GV* gv; |
| 2543 | HV* stash; |
| 2544 | char* name; |
| 2545 | STRLEN namelen; |
| 2546 | char* packname; |
| 2547 | STRLEN packlen; |
| 2548 | |
| 2549 | name = SvPV(meth, namelen); |
| 2550 | sv = *(PL_stack_base + TOPMARK + 1); |
| 2551 | |
| 2552 | if (SvGMAGICAL(sv)) |
| 2553 | mg_get(sv); |
| 2554 | if (SvROK(sv)) |
| 2555 | ob = (SV*)SvRV(sv); |
| 2556 | else { |
| 2557 | GV* iogv; |
| 2558 | |
| 2559 | packname = Nullch; |
| 2560 | if (!SvOK(sv) || |
| 2561 | !(packname = SvPV(sv, packlen)) || |
| 2562 | !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) || |
| 2563 | !(ob=(SV*)GvIO(iogv))) |
| 2564 | { |
| 2565 | if (!packname || |
| 2566 | ((*(U8*)packname >= 0xc0 && IN_UTF8) |
| 2567 | ? !isIDFIRST_utf8((U8*)packname) |
| 2568 | : !isIDFIRST(*packname) |
| 2569 | )) |
| 2570 | { |
| 2571 | Perl_croak(aTHX_ "Can't call method \"%s\" %s", name, |
| 2572 | SvOK(sv) ? "without a package or object reference" |
| 2573 | : "on an undefined value"); |
| 2574 | } |
| 2575 | stash = gv_stashpvn(packname, packlen, TRUE); |
| 2576 | goto fetch; |
| 2577 | } |
| 2578 | *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv)); |
| 2579 | } |
| 2580 | |
| 2581 | if (!ob || !SvOBJECT(ob)) |
| 2582 | Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference", |
| 2583 | name); |
| 2584 | |
| 2585 | stash = SvSTASH(ob); |
| 2586 | |
| 2587 | fetch: |
| 2588 | /* shortcut for simple names */ |
| 2589 | if (hashp) { |
| 2590 | HE* he = hv_fetch_ent(stash, meth, 0, *hashp); |
| 2591 | if (he) { |
| 2592 | gv = (GV*)HeVAL(he); |
| 2593 | if (isGV(gv) && GvCV(gv) && |
| 2594 | (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation)) |
| 2595 | return (SV*)GvCV(gv); |
| 2596 | } |
| 2597 | } |
| 2598 | |
| 2599 | gv = gv_fetchmethod(stash, name); |
| 2600 | if (!gv) { |
| 2601 | char* leaf = name; |
| 2602 | char* sep = Nullch; |
| 2603 | char* p; |
| 2604 | |
| 2605 | for (p = name; *p; p++) { |
| 2606 | if (*p == '\'') |
| 2607 | sep = p, leaf = p + 1; |
| 2608 | else if (*p == ':' && *(p + 1) == ':') |
| 2609 | sep = p, leaf = p + 2; |
| 2610 | } |
| 2611 | if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) { |
| 2612 | packname = HvNAME(sep ? PL_curcop->cop_stash : stash); |
| 2613 | packlen = strlen(packname); |
| 2614 | } |
| 2615 | else { |
| 2616 | packname = name; |
| 2617 | packlen = sep - name; |
| 2618 | } |
| 2619 | Perl_croak(aTHX_ |
| 2620 | "Can't locate object method \"%s\" via package \"%s\"", |
| 2621 | leaf, packname); |
| 2622 | } |
| 2623 | return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv; |
| 2624 | } |
| 2625 | |
| 2626 | #ifdef USE_THREADS |
| 2627 | static void |
| 2628 | unset_cvowner(pTHXo_ void *cvarg) |
| 2629 | { |
| 2630 | register CV* cv = (CV *) cvarg; |
| 2631 | #ifdef DEBUGGING |
| 2632 | dTHR; |
| 2633 | #endif /* DEBUGGING */ |
| 2634 | |
| 2635 | DEBUG_S((PerlIO_printf(PerlIO_stderr(), "%p unsetting CvOWNER of %p:%s\n", |
| 2636 | thr, cv, SvPEEK((SV*)cv)))); |
| 2637 | MUTEX_LOCK(CvMUTEXP(cv)); |
| 2638 | DEBUG_S(if (CvDEPTH(cv) != 0) |
| 2639 | PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n", |
| 2640 | CvDEPTH(cv));); |
| 2641 | assert(thr == CvOWNER(cv)); |
| 2642 | CvOWNER(cv) = 0; |
| 2643 | MUTEX_UNLOCK(CvMUTEXP(cv)); |
| 2644 | SvREFCNT_dec(cv); |
| 2645 | } |
| 2646 | #endif /* USE_THREADS */ |