3 * Copyright (c) 1991-2000, Larry Wall
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.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
25 static void unset_cvowner(pTHXo_ void *cvarg);
26 #endif /* USE_THREADS */
37 PL_curcop = (COP*)PL_op;
38 TAINT_NOT; /* Each statement is presumed innocent */
39 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
48 if (PL_op->op_private & OPpLVAL_INTRO)
49 PUSHs(save_scalar(cGVOP_gv));
51 PUSHs(GvSV(cGVOP_gv));
62 PL_curcop = (COP*)PL_op;
68 PUSHMARK(PL_stack_sp);
78 sv_setpvn(TARG,s,len);
90 XPUSHs((SV*)cGVOP_gv);
101 RETURNOP(cLOGOP->op_other);
109 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
111 temp = left; left = right; right = temp;
113 if (PL_tainting && PL_tainted && !SvTAINTED(left))
115 SvSetMagicSV(right, left);
124 RETURNOP(cLOGOP->op_other);
126 RETURNOP(cLOGOP->op_next);
132 TAINT_NOT; /* Each statement is presumed innocent */
133 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
135 oldsave = PL_scopestack[PL_scopestack_ix - 1];
136 LEAVE_SCOPE(oldsave);
142 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
147 if (SvGMAGICAL(left))
149 if (TARG == right && SvGMAGICAL(right))
152 if (TARG == right && left != right)
153 /* Clone since otherwise we cannot prepend. */
154 rcopy = sv_2mortal(newSVsv(right));
157 sv_setsv(TARG, left);
161 /* $right = $right . $right; */
163 char *rpv = SvPV(right, rlen);
165 sv_catpvn(TARG, rpv, rlen);
167 else /* $right = $left . $right; */
168 sv_catsv(TARG, rcopy);
171 if (!SvOK(TARG)) /* Avoid warning when concatenating to undef. */
173 /* $other = $left . $right; */
174 /* $left = $left . $right; */
175 sv_catsv(TARG, right);
178 #if defined(PERL_Y2KWARN)
179 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
181 char *s = SvPV(TARG,n);
182 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
183 && (n == 2 || !isDIGIT(s[n-3])))
185 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
186 "about to append an integer to '19'");
200 if (PL_op->op_flags & OPf_MOD) {
201 if (PL_op->op_private & OPpLVAL_INTRO)
202 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
203 else if (PL_op->op_private & OPpDEREF) {
205 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
214 tryAMAGICunTARGET(iter, 0);
215 PL_last_in_gv = (GV*)(*PL_stack_sp--);
216 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
217 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
218 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
221 XPUSHs((SV*)PL_last_in_gv);
224 PL_last_in_gv = (GV*)(*PL_stack_sp--);
227 return do_readline();
232 djSP; tryAMAGICbinSET(eq,0);
235 SETs(boolSV(TOPn == value));
243 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
244 DIE(aTHX_ PL_no_modify);
245 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
246 SvIVX(TOPs) != IV_MAX)
249 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
264 RETURNOP(cLOGOP->op_other);
270 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
273 SETn( left + right );
281 AV *av = GvAV(cGVOP_gv);
282 U32 lval = PL_op->op_flags & OPf_MOD;
283 SV** svp = av_fetch(av, PL_op->op_private, lval);
284 SV *sv = (svp ? *svp : &PL_sv_undef);
286 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
287 sv = sv_mortalcopy(sv);
294 djSP; dMARK; dTARGET;
296 do_join(TARG, *MARK, MARK, SP);
307 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
308 * will be enough to hold an OP*.
310 SV* sv = sv_newmortal();
311 sv_upgrade(sv, SVt_PVLV);
313 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
321 /* Oversized hot code. */
325 djSP; dMARK; dORIGMARK;
332 if (PL_op->op_flags & OPf_STACKED)
336 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
338 if (MARK == ORIGMARK) {
339 /* If using default handle then we need to make space to
340 * pass object as 1st arg, so move other args up ...
344 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
348 *MARK = SvTIED_obj((SV*)gv, mg);
351 call_method("PRINT", G_SCALAR);
359 if (!(io = GvIO(gv))) {
360 if ((GvEGV(gv)) && (mg = SvTIED_mg((SV*)GvEGV(gv),'q')))
362 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
363 report_evil_fh(gv, io, PL_op->op_type);
364 SETERRNO(EBADF,RMS$_IFI);
367 else if (!(fp = IoOFP(io))) {
368 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
370 /* integrate with report_evil_fh()? */
373 SV* sv = sv_newmortal();
374 gv_efullname4(sv, gv, Nullch, FALSE);
375 name = SvPV_nolen(sv);
378 Perl_warner(aTHX_ WARN_IO,
379 "Filehandle %s opened only for input", name);
381 Perl_warner(aTHX_ WARN_IO,
382 "Filehandle opened only for input");
384 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
385 report_evil_fh(gv, io, PL_op->op_type);
387 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
394 if (!do_print(*MARK, fp))
398 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
407 if (!do_print(*MARK, fp))
416 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
419 if (IoFLAGS(io) & IOf_FLUSH)
420 if (PerlIO_flush(fp) == EOF)
441 tryAMAGICunDEREF(to_av);
444 if (SvTYPE(av) != SVt_PVAV)
445 DIE(aTHX_ "Not an ARRAY reference");
446 if (PL_op->op_flags & OPf_REF) {
451 if (GIMME == G_SCALAR)
452 Perl_croak(aTHX_ "Can't return array to lvalue scalar context");
458 if (SvTYPE(sv) == SVt_PVAV) {
460 if (PL_op->op_flags & OPf_REF) {
465 if (GIMME == G_SCALAR)
466 Perl_croak(aTHX_ "Can't return array to lvalue"
475 if (SvTYPE(sv) != SVt_PVGV) {
479 if (SvGMAGICAL(sv)) {
485 if (PL_op->op_flags & OPf_REF ||
486 PL_op->op_private & HINT_STRICT_REFS)
487 DIE(aTHX_ PL_no_usym, "an ARRAY");
488 if (ckWARN(WARN_UNINITIALIZED))
490 if (GIMME == G_ARRAY) {
497 if ((PL_op->op_flags & OPf_SPECIAL) &&
498 !(PL_op->op_flags & OPf_MOD))
500 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
502 && (!is_gv_magical(sym,len,0)
503 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
509 if (PL_op->op_private & HINT_STRICT_REFS)
510 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
511 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
518 if (PL_op->op_private & OPpLVAL_INTRO)
520 if (PL_op->op_flags & OPf_REF) {
525 if (GIMME == G_SCALAR)
526 Perl_croak(aTHX_ "Can't return array to lvalue"
534 if (GIMME == G_ARRAY) {
535 I32 maxarg = AvFILL(av) + 1;
536 (void)POPs; /* XXXX May be optimized away? */
538 if (SvRMAGICAL(av)) {
540 for (i=0; i < maxarg; i++) {
541 SV **svp = av_fetch(av, i, FALSE);
542 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
546 Copy(AvARRAY(av), SP+1, maxarg, SV*);
552 I32 maxarg = AvFILL(av) + 1;
565 tryAMAGICunDEREF(to_hv);
568 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
569 DIE(aTHX_ "Not a HASH reference");
570 if (PL_op->op_flags & OPf_REF) {
575 if (GIMME == G_SCALAR)
576 Perl_croak(aTHX_ "Can't return hash to lvalue scalar context");
582 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
584 if (PL_op->op_flags & OPf_REF) {
589 if (GIMME == G_SCALAR)
590 Perl_croak(aTHX_ "Can't return hash to lvalue"
599 if (SvTYPE(sv) != SVt_PVGV) {
603 if (SvGMAGICAL(sv)) {
609 if (PL_op->op_flags & OPf_REF ||
610 PL_op->op_private & HINT_STRICT_REFS)
611 DIE(aTHX_ PL_no_usym, "a HASH");
612 if (ckWARN(WARN_UNINITIALIZED))
614 if (GIMME == G_ARRAY) {
621 if ((PL_op->op_flags & OPf_SPECIAL) &&
622 !(PL_op->op_flags & OPf_MOD))
624 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
626 && (!is_gv_magical(sym,len,0)
627 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
633 if (PL_op->op_private & HINT_STRICT_REFS)
634 DIE(aTHX_ PL_no_symref, sym, "a HASH");
635 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
642 if (PL_op->op_private & OPpLVAL_INTRO)
644 if (PL_op->op_flags & OPf_REF) {
649 if (GIMME == G_SCALAR)
650 Perl_croak(aTHX_ "Can't return hash to lvalue"
658 if (GIMME == G_ARRAY) { /* array wanted */
659 *PL_stack_sp = (SV*)hv;
664 if (SvTYPE(hv) == SVt_PVAV)
665 hv = avhv_keys((AV*)hv);
667 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
668 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
678 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
684 leftop = ((BINOP*)PL_op)->op_last;
686 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
687 leftop = ((LISTOP*)leftop)->op_first;
689 /* Skip PUSHMARK and each element already assigned to. */
690 for (i = lelem - firstlelem; i > 0; i--) {
691 leftop = leftop->op_sibling;
694 if (leftop->op_type != OP_RV2HV)
699 av_fill(ary, 0); /* clear all but the fields hash */
700 if (lastrelem >= relem) {
701 while (relem < lastrelem) { /* gobble up all the rest */
705 /* Avoid a memory leak when avhv_store_ent dies. */
706 tmpstr = sv_newmortal();
707 sv_setsv(tmpstr,relem[1]); /* value */
709 if (avhv_store_ent(ary,relem[0],tmpstr,0))
710 (void)SvREFCNT_inc(tmpstr);
711 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
717 if (relem == lastrelem)
723 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
727 if (ckWARN(WARN_MISC)) {
728 if (relem == firstrelem &&
730 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
731 SvTYPE(SvRV(*relem)) == SVt_PVHV))
733 Perl_warner(aTHX_ WARN_MISC,
734 "Reference found where even-sized list expected");
737 Perl_warner(aTHX_ WARN_MISC,
738 "Odd number of elements in hash assignment");
740 if (SvTYPE(hash) == SVt_PVAV) {
742 tmpstr = sv_newmortal();
743 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
744 (void)SvREFCNT_inc(tmpstr);
745 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
750 tmpstr = NEWSV(29,0);
751 didstore = hv_store_ent(hash,*relem,tmpstr,0);
752 if (SvMAGICAL(hash)) {
753 if (SvSMAGICAL(tmpstr))
766 SV **lastlelem = PL_stack_sp;
767 SV **lastrelem = PL_stack_base + POPMARK;
768 SV **firstrelem = PL_stack_base + POPMARK + 1;
769 SV **firstlelem = lastrelem + 1;
782 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
784 /* If there's a common identifier on both sides we have to take
785 * special care that assigning the identifier on the left doesn't
786 * clobber a value on the right that's used later in the list.
788 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
789 EXTEND_MORTAL(lastrelem - firstrelem + 1);
790 for (relem = firstrelem; relem <= lastrelem; relem++) {
793 TAINT_NOT; /* Each item is independent */
794 *relem = sv_mortalcopy(sv);
804 while (lelem <= lastlelem) {
805 TAINT_NOT; /* Each item stands on its own, taintwise. */
807 switch (SvTYPE(sv)) {
810 magic = SvMAGICAL(ary) != 0;
811 if (PL_op->op_private & OPpASSIGN_HASH) {
812 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
818 do_oddball((HV*)ary, relem, firstrelem);
820 relem = lastrelem + 1;
825 av_extend(ary, lastrelem - relem);
827 while (relem <= lastrelem) { /* gobble up all the rest */
833 didstore = av_store(ary,i++,sv);
843 case SVt_PVHV: { /* normal hash */
847 magic = SvMAGICAL(hash) != 0;
850 while (relem < lastrelem) { /* gobble up all the rest */
855 sv = &PL_sv_no, relem++;
856 tmpstr = NEWSV(29,0);
858 sv_setsv(tmpstr,*relem); /* value */
860 didstore = hv_store_ent(hash,sv,tmpstr,0);
862 if (SvSMAGICAL(tmpstr))
869 if (relem == lastrelem) {
870 do_oddball(hash, relem, firstrelem);
876 if (SvIMMORTAL(sv)) {
877 if (relem <= lastrelem)
881 if (relem <= lastrelem) {
882 sv_setsv(sv, *relem);
886 sv_setsv(sv, &PL_sv_undef);
891 if (PL_delaymagic & ~DM_DELAY) {
892 if (PL_delaymagic & DM_UID) {
894 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
897 (void)setreuid(PL_uid,PL_euid);
900 if ((PL_delaymagic & DM_UID) == DM_RUID) {
901 (void)setruid(PL_uid);
902 PL_delaymagic &= ~DM_RUID;
904 # endif /* HAS_SETRUID */
906 if ((PL_delaymagic & DM_UID) == DM_EUID) {
907 (void)seteuid(PL_uid);
908 PL_delaymagic &= ~DM_EUID;
910 # endif /* HAS_SETEUID */
911 if (PL_delaymagic & DM_UID) {
912 if (PL_uid != PL_euid)
913 DIE(aTHX_ "No setreuid available");
914 (void)PerlProc_setuid(PL_uid);
916 # endif /* HAS_SETREUID */
917 #endif /* HAS_SETRESUID */
918 PL_uid = PerlProc_getuid();
919 PL_euid = PerlProc_geteuid();
921 if (PL_delaymagic & DM_GID) {
923 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
926 (void)setregid(PL_gid,PL_egid);
929 if ((PL_delaymagic & DM_GID) == DM_RGID) {
930 (void)setrgid(PL_gid);
931 PL_delaymagic &= ~DM_RGID;
933 # endif /* HAS_SETRGID */
935 if ((PL_delaymagic & DM_GID) == DM_EGID) {
936 (void)setegid(PL_gid);
937 PL_delaymagic &= ~DM_EGID;
939 # endif /* HAS_SETEGID */
940 if (PL_delaymagic & DM_GID) {
941 if (PL_gid != PL_egid)
942 DIE(aTHX_ "No setregid available");
943 (void)PerlProc_setgid(PL_gid);
945 # endif /* HAS_SETREGID */
946 #endif /* HAS_SETRESGID */
947 PL_gid = PerlProc_getgid();
948 PL_egid = PerlProc_getegid();
950 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
957 else if (gimme == G_SCALAR) {
960 SETi(lastrelem - firstrelem + 1);
966 SP = firstrelem + (lastlelem - firstlelem);
967 lelem = firstlelem + (relem - firstrelem);
969 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
977 register PMOP *pm = cPMOP;
978 SV *rv = sv_newmortal();
979 SV *sv = newSVrv(rv, "Regexp");
980 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
987 register PMOP *pm = cPMOP;
992 I32 r_flags = REXEC_CHECKED;
993 char *truebase; /* Start of string */
994 register REGEXP *rx = pm->op_pmregexp;
999 I32 oldsave = PL_savestack_ix;
1000 I32 update_minmatch = 1;
1001 I32 had_zerolen = 0;
1003 if (PL_op->op_flags & OPf_STACKED)
1009 PUTBACK; /* EVAL blocks need stack_sp. */
1010 s = SvPV(TARG, len);
1013 DIE(aTHX_ "panic: pp_match");
1014 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1015 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1018 if (pm->op_pmdynflags & PMdf_USED) {
1020 if (gimme == G_ARRAY)
1025 if (!rx->prelen && PL_curpm) {
1027 rx = pm->op_pmregexp;
1029 if (rx->minlen > len) goto failure;
1033 /* XXXX What part of this is needed with true \G-support? */
1034 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1036 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1037 MAGIC* mg = mg_find(TARG, 'g');
1038 if (mg && mg->mg_len >= 0) {
1039 if (!(rx->reganch & ROPT_GPOS_SEEN))
1040 rx->endp[0] = rx->startp[0] = mg->mg_len;
1041 else if (rx->reganch & ROPT_ANCH_GPOS) {
1042 r_flags |= REXEC_IGNOREPOS;
1043 rx->endp[0] = rx->startp[0] = mg->mg_len;
1045 minmatch = (mg->mg_flags & MGf_MINMATCH);
1046 update_minmatch = 0;
1050 if ((!global && rx->nparens)
1051 || SvTEMP(TARG) || PL_sawampersand)
1052 r_flags |= REXEC_COPY_STR;
1054 r_flags |= REXEC_SCREAM;
1056 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1057 SAVEINT(PL_multiline);
1058 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1062 if (global && rx->startp[0] != -1) {
1063 t = s = rx->endp[0] + truebase;
1064 if ((s + rx->minlen) > strend)
1066 if (update_minmatch++)
1067 minmatch = had_zerolen;
1069 if (rx->reganch & RE_USE_INTUIT &&
1070 DO_UTF8(TARG) == ((rx->reganch & ROPT_UTF8) != 0)) {
1071 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1075 if ( (rx->reganch & ROPT_CHECK_ALL)
1077 && ((rx->reganch & ROPT_NOSCAN)
1078 || !((rx->reganch & RE_INTUIT_TAIL)
1079 && (r_flags & REXEC_SCREAM)))
1080 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1083 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1086 if (pm->op_pmflags & PMf_ONCE)
1087 pm->op_pmdynflags |= PMdf_USED;
1096 RX_MATCH_TAINTED_on(rx);
1097 TAINT_IF(RX_MATCH_TAINTED(rx));
1098 if (gimme == G_ARRAY) {
1101 iters = rx->nparens;
1102 if (global && !iters)
1106 SPAGAIN; /* EVAL blocks could move the stack. */
1107 EXTEND(SP, iters + i);
1108 EXTEND_MORTAL(iters + i);
1109 for (i = !i; i <= iters; i++) {
1110 PUSHs(sv_newmortal());
1112 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1113 len = rx->endp[i] - rx->startp[i];
1114 s = rx->startp[i] + truebase;
1115 sv_setpvn(*SP, s, len);
1116 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1118 sv_utf8_downgrade(*SP, TRUE);
1123 had_zerolen = (rx->startp[0] != -1
1124 && rx->startp[0] == rx->endp[0]);
1125 PUTBACK; /* EVAL blocks may use stack */
1126 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1131 LEAVE_SCOPE(oldsave);
1137 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1138 mg = mg_find(TARG, 'g');
1140 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1141 mg = mg_find(TARG, 'g');
1143 if (rx->startp[0] != -1) {
1144 mg->mg_len = rx->endp[0];
1145 if (rx->startp[0] == rx->endp[0])
1146 mg->mg_flags |= MGf_MINMATCH;
1148 mg->mg_flags &= ~MGf_MINMATCH;
1151 LEAVE_SCOPE(oldsave);
1155 yup: /* Confirmed by INTUIT */
1157 RX_MATCH_TAINTED_on(rx);
1158 TAINT_IF(RX_MATCH_TAINTED(rx));
1160 if (pm->op_pmflags & PMf_ONCE)
1161 pm->op_pmdynflags |= PMdf_USED;
1162 if (RX_MATCH_COPIED(rx))
1163 Safefree(rx->subbeg);
1164 RX_MATCH_COPIED_off(rx);
1165 rx->subbeg = Nullch;
1167 rx->subbeg = truebase;
1168 rx->startp[0] = s - truebase;
1169 rx->endp[0] = s - truebase + rx->minlen;
1170 rx->sublen = strend - truebase;
1173 if (PL_sawampersand) {
1176 rx->subbeg = savepvn(t, strend - t);
1177 rx->sublen = strend - t;
1178 RX_MATCH_COPIED_on(rx);
1179 off = rx->startp[0] = s - t;
1180 rx->endp[0] = off + rx->minlen;
1182 else { /* startp/endp are used by @- @+. */
1183 rx->startp[0] = s - truebase;
1184 rx->endp[0] = s - truebase + rx->minlen;
1186 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1187 LEAVE_SCOPE(oldsave);
1192 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1193 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1194 MAGIC* mg = mg_find(TARG, 'g');
1199 LEAVE_SCOPE(oldsave);
1200 if (gimme == G_ARRAY)
1206 Perl_do_readline(pTHX)
1208 dSP; dTARGETSTACKED;
1213 register IO *io = GvIO(PL_last_in_gv);
1214 register I32 type = PL_op->op_type;
1215 I32 gimme = GIMME_V;
1218 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1220 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1223 call_method("READLINE", gimme);
1226 if (gimme == G_SCALAR)
1227 SvSetMagicSV_nosteal(TARG, TOPs);
1234 if (IoFLAGS(io) & IOf_ARGV) {
1235 if (IoFLAGS(io) & IOf_START) {
1237 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1238 IoFLAGS(io) &= ~IOf_START;
1239 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1240 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1241 SvSETMAGIC(GvSV(PL_last_in_gv));
1246 fp = nextargv(PL_last_in_gv);
1247 if (!fp) { /* Note: fp != IoIFP(io) */
1248 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1251 else if (type == OP_GLOB) {
1252 SV *tmpcmd = NEWSV(55, 0);
1256 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1257 /* since spawning off a process is a real performance hit */
1259 #include <descrip.h>
1260 #include <lib$routines.h>
1263 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1264 char vmsspec[NAM$C_MAXRSS+1];
1265 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1266 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1267 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1270 struct dsc$descriptor_s wilddsc
1271 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1272 struct dsc$descriptor_vs rsdsc
1273 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1274 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1276 /* We could find out if there's an explicit dev/dir or version
1277 by peeking into lib$find_file's internal context at
1278 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1279 but that's unsupported, so I don't want to do it now and
1280 have it bite someone in the future. */
1281 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1282 cp = SvPV(tmpglob,i);
1284 if (cp[i] == ';') hasver = 1;
1286 if (sts) hasver = 1;
1290 hasdir = isunix = 1;
1293 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1298 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1300 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1301 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1302 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1303 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1304 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1305 &dfltdsc,NULL,NULL,NULL))&1)) {
1306 end = rstr + (unsigned long int) *rslt;
1307 if (!hasver) while (*end != ';') end--;
1308 *(end++) = '\n'; *end = '\0';
1309 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1311 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1316 while (*(--begin) != ']' && *begin != '>') ;
1319 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1321 if (cxt) (void)lib$find_file_end(&cxt);
1322 if (ok && sts != RMS$_NMF &&
1323 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1326 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1328 PerlIO_close(tmpfp);
1332 PerlIO_rewind(tmpfp);
1333 IoTYPE(io) = IoTYPE_RDONLY;
1334 IoIFP(io) = fp = tmpfp;
1335 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1340 #ifdef MACOS_TRADITIONAL
1341 sv_setpv(tmpcmd, "glob ");
1342 sv_catsv(tmpcmd, tmpglob);
1343 sv_catpv(tmpcmd, " |");
1347 sv_setpv(tmpcmd, "for a in ");
1348 sv_catsv(tmpcmd, tmpglob);
1349 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1352 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1353 sv_catsv(tmpcmd, tmpglob);
1355 sv_setpv(tmpcmd, "perlglob ");
1356 sv_catsv(tmpcmd, tmpglob);
1357 sv_catpv(tmpcmd, " |");
1362 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1363 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1364 sv_catsv(tmpcmd, tmpglob);
1365 sv_catpv(tmpcmd, "' 2>/dev/null |");
1367 sv_setpv(tmpcmd, "echo ");
1368 sv_catsv(tmpcmd, tmpglob);
1370 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1372 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1375 #endif /* !DOSISH */
1376 #endif /* MACOS_TRADITIONAL */
1377 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1378 FALSE, O_RDONLY, 0, Nullfp);
1384 else if (type == OP_GLOB)
1386 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1387 && (IoTYPE(io) == IoTYPE_WRONLY || fp == PerlIO_stdout()
1388 || fp == PerlIO_stderr()))
1390 /* integrate with report_evil_fh()? */
1392 if (isGV(PL_last_in_gv)) { /* can this ever fail? */
1393 SV* sv = sv_newmortal();
1394 gv_efullname4(sv, PL_last_in_gv, Nullch, FALSE);
1395 name = SvPV_nolen(sv);
1398 Perl_warner(aTHX_ WARN_IO,
1399 "Filehandle %s opened only for output", name);
1401 Perl_warner(aTHX_ WARN_IO,
1402 "Filehandle opened only for output");
1406 if (ckWARN2(WARN_GLOB, WARN_CLOSED)
1407 && (!io || !(IoFLAGS(io) & IOf_START))) {
1408 if (type == OP_GLOB)
1409 Perl_warner(aTHX_ WARN_GLOB,
1410 "glob failed (can't start child: %s)",
1413 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1415 if (gimme == G_SCALAR) {
1416 (void)SvOK_off(TARG);
1422 if (gimme == G_SCALAR) {
1426 (void)SvUPGRADE(sv, SVt_PV);
1427 tmplen = SvLEN(sv); /* remember if already alloced */
1429 Sv_Grow(sv, 80); /* try short-buffering it */
1430 if (type == OP_RCATLINE)
1436 sv = sv_2mortal(NEWSV(57, 80));
1440 /* This should not be marked tainted if the fp is marked clean */
1441 #define MAYBE_TAINT_LINE(io, sv) \
1442 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1447 /* delay EOF state for a snarfed empty file */
1448 #define SNARF_EOF(gimme,rs,io,sv) \
1449 (gimme != G_SCALAR || SvCUR(sv) \
1450 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1453 if (!sv_gets(sv, fp, offset)
1454 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1456 PerlIO_clearerr(fp);
1457 if (IoFLAGS(io) & IOf_ARGV) {
1458 fp = nextargv(PL_last_in_gv);
1461 (void)do_close(PL_last_in_gv, FALSE);
1463 else if (type == OP_GLOB) {
1464 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1465 Perl_warner(aTHX_ WARN_GLOB,
1466 "glob failed (child exited with status %d%s)",
1467 (int)(STATUS_CURRENT >> 8),
1468 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1471 if (gimme == G_SCALAR) {
1472 (void)SvOK_off(TARG);
1475 MAYBE_TAINT_LINE(io, sv);
1478 MAYBE_TAINT_LINE(io, sv);
1480 IoFLAGS(io) |= IOf_NOLINE;
1483 if (type == OP_GLOB) {
1486 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1487 tmps = SvEND(sv) - 1;
1488 if (*tmps == *SvPVX(PL_rs)) {
1493 for (tmps = SvPVX(sv); *tmps; tmps++)
1494 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1495 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1497 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1498 (void)POPs; /* Unmatched wildcard? Chuck it... */
1502 if (gimme == G_ARRAY) {
1503 if (SvLEN(sv) - SvCUR(sv) > 20) {
1504 SvLEN_set(sv, SvCUR(sv)+1);
1505 Renew(SvPVX(sv), SvLEN(sv), char);
1507 sv = sv_2mortal(NEWSV(58, 80));
1510 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1511 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1515 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1516 Renew(SvPVX(sv), SvLEN(sv), char);
1525 register PERL_CONTEXT *cx;
1526 I32 gimme = OP_GIMME(PL_op, -1);
1529 if (cxstack_ix >= 0)
1530 gimme = cxstack[cxstack_ix].blk_gimme;
1538 PUSHBLOCK(cx, CXt_BLOCK, SP);
1550 U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
1551 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1554 if (SvTYPE(hv) == SVt_PVHV) {
1555 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1556 svp = he ? &HeVAL(he) : 0;
1558 else if (SvTYPE(hv) == SVt_PVAV) {
1559 if (PL_op->op_private & OPpLVAL_INTRO)
1560 DIE(aTHX_ "Can't localize pseudo-hash element");
1561 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1567 if (!svp || *svp == &PL_sv_undef) {
1572 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1574 lv = sv_newmortal();
1575 sv_upgrade(lv, SVt_PVLV);
1577 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1578 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1579 LvTARG(lv) = SvREFCNT_inc(hv);
1584 if (PL_op->op_private & OPpLVAL_INTRO) {
1585 if (HvNAME(hv) && isGV(*svp))
1586 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1588 save_helem(hv, keysv, svp);
1590 else if (PL_op->op_private & OPpDEREF)
1591 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1593 sv = (svp ? *svp : &PL_sv_undef);
1594 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1595 * Pushing the magical RHS on to the stack is useless, since
1596 * that magic is soon destined to be misled by the local(),
1597 * and thus the later pp_sassign() will fail to mg_get() the
1598 * old value. This should also cure problems with delayed
1599 * mg_get()s. GSAR 98-07-03 */
1600 if (!lval && SvGMAGICAL(sv))
1601 sv = sv_mortalcopy(sv);
1609 register PERL_CONTEXT *cx;
1615 if (PL_op->op_flags & OPf_SPECIAL) {
1616 cx = &cxstack[cxstack_ix];
1617 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1622 gimme = OP_GIMME(PL_op, -1);
1624 if (cxstack_ix >= 0)
1625 gimme = cxstack[cxstack_ix].blk_gimme;
1631 if (gimme == G_VOID)
1633 else if (gimme == G_SCALAR) {
1636 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1639 *MARK = sv_mortalcopy(TOPs);
1642 *MARK = &PL_sv_undef;
1646 else if (gimme == G_ARRAY) {
1647 /* in case LEAVE wipes old return values */
1648 for (mark = newsp + 1; mark <= SP; mark++) {
1649 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1650 *mark = sv_mortalcopy(*mark);
1651 TAINT_NOT; /* Each item is independent */
1655 PL_curpm = newpm; /* Don't pop $1 et al till now */
1665 register PERL_CONTEXT *cx;
1671 cx = &cxstack[cxstack_ix];
1672 if (CxTYPE(cx) != CXt_LOOP)
1673 DIE(aTHX_ "panic: pp_iter");
1675 itersvp = CxITERVAR(cx);
1676 av = cx->blk_loop.iterary;
1677 if (SvTYPE(av) != SVt_PVAV) {
1678 /* iterate ($min .. $max) */
1679 if (cx->blk_loop.iterlval) {
1680 /* string increment */
1681 register SV* cur = cx->blk_loop.iterlval;
1683 char *max = SvPV((SV*)av, maxlen);
1684 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1685 #ifndef USE_THREADS /* don't risk potential race */
1686 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1687 /* safe to reuse old SV */
1688 sv_setsv(*itersvp, cur);
1693 /* we need a fresh SV every time so that loop body sees a
1694 * completely new SV for closures/references to work as
1696 SvREFCNT_dec(*itersvp);
1697 *itersvp = newSVsv(cur);
1699 if (strEQ(SvPVX(cur), max))
1700 sv_setiv(cur, 0); /* terminate next time */
1707 /* integer increment */
1708 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1711 #ifndef USE_THREADS /* don't risk potential race */
1712 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1713 /* safe to reuse old SV */
1714 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1719 /* we need a fresh SV every time so that loop body sees a
1720 * completely new SV for closures/references to work as they
1722 SvREFCNT_dec(*itersvp);
1723 *itersvp = newSViv(cx->blk_loop.iterix++);
1729 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1732 SvREFCNT_dec(*itersvp);
1734 if ((sv = SvMAGICAL(av)
1735 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1736 : AvARRAY(av)[++cx->blk_loop.iterix]))
1740 if (av != PL_curstack && SvIMMORTAL(sv)) {
1741 SV *lv = cx->blk_loop.iterlval;
1742 if (lv && SvREFCNT(lv) > 1) {
1747 SvREFCNT_dec(LvTARG(lv));
1749 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1750 sv_upgrade(lv, SVt_PVLV);
1752 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1754 LvTARG(lv) = SvREFCNT_inc(av);
1755 LvTARGOFF(lv) = cx->blk_loop.iterix;
1756 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1760 *itersvp = SvREFCNT_inc(sv);
1767 register PMOP *pm = cPMOP;
1769 register SV *dstr, *rstr;
1783 register REGEXP *rx = pm->op_pmregexp;
1785 int force_on_match = 0;
1786 I32 oldsave = PL_savestack_ix;
1790 /* known replacement string? */
1791 rstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1792 if (PL_op->op_flags & OPf_STACKED)
1798 do_utf8 = DO_UTF8(TARG);
1799 if (SvFAKE(TARG) && SvREADONLY(TARG))
1800 sv_force_normal(TARG);
1801 if (SvREADONLY(TARG)
1802 || (SvTYPE(TARG) > SVt_PVLV
1803 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1804 DIE(aTHX_ PL_no_modify);
1807 s = SvPV(TARG, len);
1808 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1810 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1811 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1818 DIE(aTHX_ "panic: pp_subst");
1821 slen = do_utf8 ? utf8_length((U8*)s, (U8*)strend) : len;
1822 maxiters = 2 * slen + 10; /* We can match twice at each
1823 position, once with zero-length,
1824 second time with non-zero. */
1826 if (!rx->prelen && PL_curpm) {
1828 rx = pm->op_pmregexp;
1830 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1831 ? REXEC_COPY_STR : 0;
1833 r_flags |= REXEC_SCREAM;
1834 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1835 SAVEINT(PL_multiline);
1836 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1839 if (rx->reganch & RE_USE_INTUIT) {
1840 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1844 /* How to do it in subst? */
1845 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1847 && ((rx->reganch & ROPT_NOSCAN)
1848 || !((rx->reganch & RE_INTUIT_TAIL)
1849 && (r_flags & REXEC_SCREAM))))
1854 /* only replace once? */
1855 once = !(rpm->op_pmflags & PMf_GLOBAL);
1857 /* known replacement string? */
1858 c = rstr ? SvPV(rstr, clen) : Nullch;
1860 /* can do inplace substitution? */
1861 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1862 && do_utf8 == DO_UTF8(rstr)
1863 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1864 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1865 r_flags | REXEC_CHECKED))
1869 LEAVE_SCOPE(oldsave);
1872 if (force_on_match) {
1874 s = SvPV_force(TARG, len);
1879 SvSCREAM_off(TARG); /* disable possible screamer */
1881 rxtainted |= RX_MATCH_TAINTED(rx);
1882 m = orig + rx->startp[0];
1883 d = orig + rx->endp[0];
1885 if (m - s > strend - d) { /* faster to shorten from end */
1887 Copy(c, m, clen, char);
1892 Move(d, m, i, char);
1896 SvCUR_set(TARG, m - s);
1899 else if ((i = m - s)) { /* faster from front */
1907 Copy(c, m, clen, char);
1912 Copy(c, d, clen, char);
1917 TAINT_IF(rxtainted & 1);
1923 if (iters++ > maxiters)
1924 DIE(aTHX_ "Substitution loop");
1925 rxtainted |= RX_MATCH_TAINTED(rx);
1926 m = rx->startp[0] + orig;
1930 Move(s, d, i, char);
1934 Copy(c, d, clen, char);
1937 s = rx->endp[0] + orig;
1938 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1940 /* don't match same null twice */
1941 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1944 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1945 Move(s, d, i+1, char); /* include the NUL */
1947 TAINT_IF(rxtainted & 1);
1949 PUSHs(sv_2mortal(newSViv((I32)iters)));
1951 (void)SvPOK_only_UTF8(TARG);
1952 TAINT_IF(rxtainted);
1953 if (SvSMAGICAL(TARG)) {
1959 LEAVE_SCOPE(oldsave);
1963 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1964 r_flags | REXEC_CHECKED))
1968 if (force_on_match) {
1970 s = SvPV_force(TARG, len);
1973 rxtainted |= RX_MATCH_TAINTED(rx);
1974 dstr = NEWSV(25, len);
1975 sv_setpvn(dstr, m, s-m);
1980 register PERL_CONTEXT *cx;
1983 RETURNOP(cPMOP->op_pmreplroot);
1985 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1987 if (iters++ > maxiters)
1988 DIE(aTHX_ "Substitution loop");
1989 rxtainted |= RX_MATCH_TAINTED(rx);
1990 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1995 strend = s + (strend - m);
1997 m = rx->startp[0] + orig;
1998 sv_catpvn(dstr, s, m-s);
1999 s = rx->endp[0] + orig;
2001 sv_catsv(dstr, rstr);
2004 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
2005 sv_catpvn(dstr, s, strend - s);
2007 (void)SvOOK_off(TARG);
2008 Safefree(SvPVX(TARG));
2009 SvPVX(TARG) = SvPVX(dstr);
2010 SvCUR_set(TARG, SvCUR(dstr));
2011 SvLEN_set(TARG, SvLEN(dstr));
2012 isutf8 = DO_UTF8(dstr);
2016 TAINT_IF(rxtainted & 1);
2018 PUSHs(sv_2mortal(newSViv((I32)iters)));
2020 (void)SvPOK_only(TARG);
2023 TAINT_IF(rxtainted);
2026 LEAVE_SCOPE(oldsave);
2035 LEAVE_SCOPE(oldsave);
2044 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2045 ++*PL_markstack_ptr;
2046 LEAVE; /* exit inner scope */
2049 if (PL_stack_base + *PL_markstack_ptr > SP) {
2051 I32 gimme = GIMME_V;
2053 LEAVE; /* exit outer scope */
2054 (void)POPMARK; /* pop src */
2055 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2056 (void)POPMARK; /* pop dst */
2057 SP = PL_stack_base + POPMARK; /* pop original mark */
2058 if (gimme == G_SCALAR) {
2062 else if (gimme == G_ARRAY)
2069 ENTER; /* enter inner scope */
2072 src = PL_stack_base[*PL_markstack_ptr];
2076 RETURNOP(cLOGOP->op_other);
2087 register PERL_CONTEXT *cx;
2093 if (gimme == G_SCALAR) {
2096 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2098 *MARK = SvREFCNT_inc(TOPs);
2103 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2105 *MARK = sv_mortalcopy(sv);
2110 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2114 *MARK = &PL_sv_undef;
2118 else if (gimme == G_ARRAY) {
2119 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2120 if (!SvTEMP(*MARK)) {
2121 *MARK = sv_mortalcopy(*MARK);
2122 TAINT_NOT; /* Each item is independent */
2128 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2129 PL_curpm = newpm; /* ... and pop $1 et al */
2133 return pop_return();
2136 /* This duplicates the above code because the above code must not
2137 * get any slower by more conditions */
2145 register PERL_CONTEXT *cx;
2152 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2153 /* We are an argument to a function or grep().
2154 * This kind of lvalueness was legal before lvalue
2155 * subroutines too, so be backward compatible:
2156 * cannot report errors. */
2158 /* Scalar context *is* possible, on the LHS of -> only,
2159 * as in f()->meth(). But this is not an lvalue. */
2160 if (gimme == G_SCALAR)
2162 if (gimme == G_ARRAY) {
2163 if (!CvLVALUE(cx->blk_sub.cv))
2164 goto temporise_array;
2165 EXTEND_MORTAL(SP - newsp);
2166 for (mark = newsp + 1; mark <= SP; mark++) {
2169 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2170 *mark = sv_mortalcopy(*mark);
2172 /* Can be a localized value subject to deletion. */
2173 PL_tmps_stack[++PL_tmps_ix] = *mark;
2174 (void)SvREFCNT_inc(*mark);
2179 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2180 /* Here we go for robustness, not for speed, so we change all
2181 * the refcounts so the caller gets a live guy. Cannot set
2182 * TEMP, so sv_2mortal is out of question. */
2183 if (!CvLVALUE(cx->blk_sub.cv)) {
2188 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2190 if (gimme == G_SCALAR) {
2194 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2199 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2200 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2202 else { /* Can be a localized value
2203 * subject to deletion. */
2204 PL_tmps_stack[++PL_tmps_ix] = *mark;
2205 (void)SvREFCNT_inc(*mark);
2208 else { /* Should not happen? */
2213 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2214 (MARK > SP ? "Empty array" : "Array"));
2218 else if (gimme == G_ARRAY) {
2219 EXTEND_MORTAL(SP - newsp);
2220 for (mark = newsp + 1; mark <= SP; mark++) {
2221 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2222 /* Might be flattened array after $#array = */
2228 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2229 (*mark != &PL_sv_undef)
2231 ? "a readonly value" : "a temporary")
2232 : "an uninitialized value");
2235 /* Can be a localized value subject to deletion. */
2236 PL_tmps_stack[++PL_tmps_ix] = *mark;
2237 (void)SvREFCNT_inc(*mark);
2243 if (gimme == G_SCALAR) {
2247 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2249 *MARK = SvREFCNT_inc(TOPs);
2254 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2256 *MARK = sv_mortalcopy(sv);
2261 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2265 *MARK = &PL_sv_undef;
2269 else if (gimme == G_ARRAY) {
2271 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2272 if (!SvTEMP(*MARK)) {
2273 *MARK = sv_mortalcopy(*MARK);
2274 TAINT_NOT; /* Each item is independent */
2281 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2282 PL_curpm = newpm; /* ... and pop $1 et al */
2286 return pop_return();
2291 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2293 SV *dbsv = GvSV(PL_DBsub);
2295 if (!PERLDB_SUB_NN) {
2299 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2300 || strEQ(GvNAME(gv), "END")
2301 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2302 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2303 && (gv = (GV*)*svp) ))) {
2304 /* Use GV from the stack as a fallback. */
2305 /* GV is potentially non-unique, or contain different CV. */
2306 SV *tmp = newRV((SV*)cv);
2307 sv_setsv(dbsv, tmp);
2311 gv_efullname3(dbsv, gv, Nullch);
2315 (void)SvUPGRADE(dbsv, SVt_PVIV);
2316 (void)SvIOK_on(dbsv);
2317 SAVEIV(SvIVX(dbsv));
2318 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2322 PL_curcopdb = PL_curcop;
2323 cv = GvCV(PL_DBsub);
2333 register PERL_CONTEXT *cx;
2335 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2338 DIE(aTHX_ "Not a CODE reference");
2339 switch (SvTYPE(sv)) {
2345 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2347 SP = PL_stack_base + POPMARK;
2350 if (SvGMAGICAL(sv)) {
2352 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2355 sym = SvPV(sv, n_a);
2357 DIE(aTHX_ PL_no_usym, "a subroutine");
2358 if (PL_op->op_private & HINT_STRICT_REFS)
2359 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2360 cv = get_cv(sym, TRUE);
2364 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2365 tryAMAGICunDEREF(to_cv);
2368 if (SvTYPE(cv) == SVt_PVCV)
2373 DIE(aTHX_ "Not a CODE reference");
2378 if (!(cv = GvCVu((GV*)sv)))
2379 cv = sv_2cv(sv, &stash, &gv, FALSE);
2392 if (!CvROOT(cv) && !CvXSUB(cv)) {
2396 /* anonymous or undef'd function leaves us no recourse */
2397 if (CvANON(cv) || !(gv = CvGV(cv)))
2398 DIE(aTHX_ "Undefined subroutine called");
2400 /* autoloaded stub? */
2401 if (cv != GvCV(gv)) {
2404 /* should call AUTOLOAD now? */
2407 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2414 sub_name = sv_newmortal();
2415 gv_efullname3(sub_name, gv, Nullch);
2416 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2420 DIE(aTHX_ "Not a CODE reference");
2425 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2426 cv = get_db_sub(&sv, cv);
2428 DIE(aTHX_ "No DBsub routine");
2433 * First we need to check if the sub or method requires locking.
2434 * If so, we gain a lock on the CV, the first argument or the
2435 * stash (for static methods), as appropriate. This has to be
2436 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2437 * reschedule by returning a new op.
2439 MUTEX_LOCK(CvMUTEXP(cv));
2440 if (CvFLAGS(cv) & CVf_LOCKED) {
2442 if (CvFLAGS(cv) & CVf_METHOD) {
2443 if (SP > PL_stack_base + TOPMARK)
2444 sv = *(PL_stack_base + TOPMARK + 1);
2446 AV *av = (AV*)PL_curpad[0];
2447 if (hasargs || !av || AvFILLp(av) < 0
2448 || !(sv = AvARRAY(av)[0]))
2450 MUTEX_UNLOCK(CvMUTEXP(cv));
2451 DIE(aTHX_ "no argument for locked method call");
2458 char *stashname = SvPV(sv, len);
2459 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2465 MUTEX_UNLOCK(CvMUTEXP(cv));
2466 mg = condpair_magic(sv);
2467 MUTEX_LOCK(MgMUTEXP(mg));
2468 if (MgOWNER(mg) == thr)
2469 MUTEX_UNLOCK(MgMUTEXP(mg));
2472 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2474 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2476 MUTEX_UNLOCK(MgMUTEXP(mg));
2477 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2479 MUTEX_LOCK(CvMUTEXP(cv));
2482 * Now we have permission to enter the sub, we must distinguish
2483 * four cases. (0) It's an XSUB (in which case we don't care
2484 * about ownership); (1) it's ours already (and we're recursing);
2485 * (2) it's free (but we may already be using a cached clone);
2486 * (3) another thread owns it. Case (1) is easy: we just use it.
2487 * Case (2) means we look for a clone--if we have one, use it
2488 * otherwise grab ownership of cv. Case (3) means we look for a
2489 * clone (for non-XSUBs) and have to create one if we don't
2491 * Why look for a clone in case (2) when we could just grab
2492 * ownership of cv straight away? Well, we could be recursing,
2493 * i.e. we originally tried to enter cv while another thread
2494 * owned it (hence we used a clone) but it has been freed up
2495 * and we're now recursing into it. It may or may not be "better"
2496 * to use the clone but at least CvDEPTH can be trusted.
2498 if (CvOWNER(cv) == thr || CvXSUB(cv))
2499 MUTEX_UNLOCK(CvMUTEXP(cv));
2501 /* Case (2) or (3) */
2505 * XXX Might it be better to release CvMUTEXP(cv) while we
2506 * do the hv_fetch? We might find someone has pinched it
2507 * when we look again, in which case we would be in case
2508 * (3) instead of (2) so we'd have to clone. Would the fact
2509 * that we released the mutex more quickly make up for this?
2511 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2513 /* We already have a clone to use */
2514 MUTEX_UNLOCK(CvMUTEXP(cv));
2516 DEBUG_S(PerlIO_printf(Perl_debug_log,
2517 "entersub: %p already has clone %p:%s\n",
2518 thr, cv, SvPEEK((SV*)cv)));
2521 if (CvDEPTH(cv) == 0)
2522 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2525 /* (2) => grab ownership of cv. (3) => make clone */
2529 MUTEX_UNLOCK(CvMUTEXP(cv));
2530 DEBUG_S(PerlIO_printf(Perl_debug_log,
2531 "entersub: %p grabbing %p:%s in stash %s\n",
2532 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2533 HvNAME(CvSTASH(cv)) : "(none)"));
2536 /* Make a new clone. */
2538 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2539 MUTEX_UNLOCK(CvMUTEXP(cv));
2540 DEBUG_S((PerlIO_printf(Perl_debug_log,
2541 "entersub: %p cloning %p:%s\n",
2542 thr, cv, SvPEEK((SV*)cv))));
2544 * We're creating a new clone so there's no race
2545 * between the original MUTEX_UNLOCK and the
2546 * SvREFCNT_inc since no one will be trying to undef
2547 * it out from underneath us. At least, I don't think
2550 clonecv = cv_clone(cv);
2551 SvREFCNT_dec(cv); /* finished with this */
2552 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2553 CvOWNER(clonecv) = thr;
2557 DEBUG_S(if (CvDEPTH(cv) != 0)
2558 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2560 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2563 #endif /* USE_THREADS */
2566 #ifdef PERL_XSUB_OLDSTYLE
2567 if (CvOLDSTYLE(cv)) {
2568 I32 (*fp3)(int,int,int);
2570 register I32 items = SP - MARK;
2571 /* We dont worry to copy from @_. */
2576 PL_stack_sp = mark + 1;
2577 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2578 items = (*fp3)(CvXSUBANY(cv).any_i32,
2579 MARK - PL_stack_base + 1,
2581 PL_stack_sp = PL_stack_base + items;
2584 #endif /* PERL_XSUB_OLDSTYLE */
2586 I32 markix = TOPMARK;
2591 /* Need to copy @_ to stack. Alternative may be to
2592 * switch stack to @_, and copy return values
2593 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2597 av = (AV*)PL_curpad[0];
2599 av = GvAV(PL_defgv);
2600 #endif /* USE_THREADS */
2601 items = AvFILLp(av) + 1; /* @_ is not tieable */
2604 /* Mark is at the end of the stack. */
2606 Copy(AvARRAY(av), SP + 1, items, SV*);
2611 /* We assume first XSUB in &DB::sub is the called one. */
2613 SAVEVPTR(PL_curcop);
2614 PL_curcop = PL_curcopdb;
2617 /* Do we need to open block here? XXXX */
2618 (void)(*CvXSUB(cv))(aTHXo_ cv);
2620 /* Enforce some sanity in scalar context. */
2621 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2622 if (markix > PL_stack_sp - PL_stack_base)
2623 *(PL_stack_base + markix) = &PL_sv_undef;
2625 *(PL_stack_base + markix) = *PL_stack_sp;
2626 PL_stack_sp = PL_stack_base + markix;
2634 register I32 items = SP - MARK;
2635 AV* padlist = CvPADLIST(cv);
2636 SV** svp = AvARRAY(padlist);
2637 push_return(PL_op->op_next);
2638 PUSHBLOCK(cx, CXt_SUB, MARK);
2641 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2642 * that eval'' ops within this sub know the correct lexical space.
2643 * Owing the speed considerations, we choose to search for the cv
2644 * in doeval() instead.
2646 if (CvDEPTH(cv) < 2)
2647 (void)SvREFCNT_inc(cv);
2648 else { /* save temporaries on recursion? */
2649 PERL_STACK_OVERFLOW_CHECK();
2650 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2652 AV *newpad = newAV();
2653 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2654 I32 ix = AvFILLp((AV*)svp[1]);
2655 I32 names_fill = AvFILLp((AV*)svp[0]);
2656 svp = AvARRAY(svp[0]);
2657 for ( ;ix > 0; ix--) {
2658 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2659 char *name = SvPVX(svp[ix]);
2660 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2661 || *name == '&') /* anonymous code? */
2663 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2665 else { /* our own lexical */
2667 av_store(newpad, ix, sv = (SV*)newAV());
2668 else if (*name == '%')
2669 av_store(newpad, ix, sv = (SV*)newHV());
2671 av_store(newpad, ix, sv = NEWSV(0,0));
2675 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2676 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2679 av_store(newpad, ix, sv = NEWSV(0,0));
2683 av = newAV(); /* will be @_ */
2685 av_store(newpad, 0, (SV*)av);
2686 AvFLAGS(av) = AVf_REIFY;
2687 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2688 AvFILLp(padlist) = CvDEPTH(cv);
2689 svp = AvARRAY(padlist);
2694 AV* av = (AV*)PL_curpad[0];
2696 items = AvFILLp(av) + 1;
2698 /* Mark is at the end of the stack. */
2700 Copy(AvARRAY(av), SP + 1, items, SV*);
2705 #endif /* USE_THREADS */
2706 SAVEVPTR(PL_curpad);
2707 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2710 #endif /* USE_THREADS */
2716 DEBUG_S(PerlIO_printf(Perl_debug_log,
2717 "%p entersub preparing @_\n", thr));
2719 av = (AV*)PL_curpad[0];
2721 /* @_ is normally not REAL--this should only ever
2722 * happen when DB::sub() calls things that modify @_ */
2728 cx->blk_sub.savearray = GvAV(PL_defgv);
2729 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2730 #endif /* USE_THREADS */
2731 cx->blk_sub.oldcurpad = PL_curpad;
2732 cx->blk_sub.argarray = av;
2735 if (items > AvMAX(av) + 1) {
2737 if (AvARRAY(av) != ary) {
2738 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2739 SvPVX(av) = (char*)ary;
2741 if (items > AvMAX(av) + 1) {
2742 AvMAX(av) = items - 1;
2743 Renew(ary,items,SV*);
2745 SvPVX(av) = (char*)ary;
2748 Copy(MARK,AvARRAY(av),items,SV*);
2749 AvFILLp(av) = items - 1;
2757 /* warning must come *after* we fully set up the context
2758 * stuff so that __WARN__ handlers can safely dounwind()
2761 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2762 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2763 sub_crush_depth(cv);
2765 DEBUG_S(PerlIO_printf(Perl_debug_log,
2766 "%p entersub returning %p\n", thr, CvSTART(cv)));
2768 RETURNOP(CvSTART(cv));
2773 Perl_sub_crush_depth(pTHX_ CV *cv)
2776 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2778 SV* tmpstr = sv_newmortal();
2779 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2780 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2791 U32 lval = PL_op->op_flags & OPf_MOD || LVRET;
2792 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2796 elem -= PL_curcop->cop_arybase;
2797 if (SvTYPE(av) != SVt_PVAV)
2799 svp = av_fetch(av, elem, lval && !defer);
2801 if (!svp || *svp == &PL_sv_undef) {
2804 DIE(aTHX_ PL_no_aelem, elem);
2805 lv = sv_newmortal();
2806 sv_upgrade(lv, SVt_PVLV);
2808 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2809 LvTARG(lv) = SvREFCNT_inc(av);
2810 LvTARGOFF(lv) = elem;
2815 if (PL_op->op_private & OPpLVAL_INTRO)
2816 save_aelem(av, elem, svp);
2817 else if (PL_op->op_private & OPpDEREF)
2818 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2820 sv = (svp ? *svp : &PL_sv_undef);
2821 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2822 sv = sv_mortalcopy(sv);
2828 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2834 Perl_croak(aTHX_ PL_no_modify);
2835 if (SvTYPE(sv) < SVt_RV)
2836 sv_upgrade(sv, SVt_RV);
2837 else if (SvTYPE(sv) >= SVt_PV) {
2838 (void)SvOOK_off(sv);
2839 Safefree(SvPVX(sv));
2840 SvLEN(sv) = SvCUR(sv) = 0;
2844 SvRV(sv) = NEWSV(355,0);
2847 SvRV(sv) = (SV*)newAV();
2850 SvRV(sv) = (SV*)newHV();
2865 if (SvTYPE(rsv) == SVt_PVCV) {
2871 SETs(method_common(sv, Null(U32*)));
2878 SV* sv = cSVOP->op_sv;
2879 U32 hash = SvUVX(sv);
2881 XPUSHs(method_common(sv, &hash));
2886 S_method_common(pTHX_ SV* meth, U32* hashp)
2897 name = SvPV(meth, namelen);
2898 sv = *(PL_stack_base + TOPMARK + 1);
2901 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2912 !(packname = SvPV(sv, packlen)) ||
2913 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2914 !(ob=(SV*)GvIO(iogv)))
2917 ((UTF8_IS_START(*packname) && DO_UTF8(sv))
2918 ? !isIDFIRST_utf8((U8*)packname)
2919 : !isIDFIRST(*packname)
2922 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2923 SvOK(sv) ? "without a package or object reference"
2924 : "on an undefined value");
2926 stash = gv_stashpvn(packname, packlen, TRUE);
2929 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2932 if (!ob || !(SvOBJECT(ob)
2933 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2936 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2940 stash = SvSTASH(ob);
2943 /* shortcut for simple names */
2945 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2947 gv = (GV*)HeVAL(he);
2948 if (isGV(gv) && GvCV(gv) &&
2949 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2950 return (SV*)GvCV(gv);
2954 gv = gv_fetchmethod(stash, name);
2961 for (p = name; *p; p++) {
2963 sep = p, leaf = p + 1;
2964 else if (*p == ':' && *(p + 1) == ':')
2965 sep = p, leaf = p + 2;
2967 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2968 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2969 packlen = strlen(packname);
2973 packlen = sep - name;
2975 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2976 if (gv && isGV(gv)) {
2978 "Can't locate object method \"%s\" via package \"%s\"",
2983 "Can't locate object method \"%s\" via package \"%s\""
2984 " (perhaps you forgot to load \"%s\"?)",
2985 leaf, packname, packname);
2988 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2993 unset_cvowner(pTHXo_ void *cvarg)
2995 register CV* cv = (CV *) cvarg;
2997 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2998 thr, cv, SvPEEK((SV*)cv))));
2999 MUTEX_LOCK(CvMUTEXP(cv));
3000 DEBUG_S(if (CvDEPTH(cv) != 0)
3001 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
3003 assert(thr == CvOWNER(cv));
3005 MUTEX_UNLOCK(CvMUTEXP(cv));
3008 #endif /* USE_THREADS */