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
29 static void unset_cvowner(pTHXo_ void *cvarg);
30 #endif /* USE_THREADS */
41 PL_curcop = (COP*)PL_op;
42 TAINT_NOT; /* Each statement is presumed innocent */
43 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
52 if (PL_op->op_private & OPpLVAL_INTRO)
53 PUSHs(save_scalar(cGVOP_gv));
55 PUSHs(GvSV(cGVOP_gv));
66 PL_curcop = (COP*)PL_op;
72 PUSHMARK(PL_stack_sp);
82 sv_setpvn(TARG,s,len);
83 if (SvUTF8(TOPs) && !IN_BYTE)
92 XPUSHs((SV*)cGVOP_gv);
103 RETURNOP(cLOGOP->op_other);
111 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
113 temp = left; left = right; right = temp;
115 if (PL_tainting && PL_tainted && !SvTAINTED(left))
117 SvSetMagicSV(right, left);
126 RETURNOP(cLOGOP->op_other);
128 RETURNOP(cLOGOP->op_next);
134 TAINT_NOT; /* Each statement is presumed innocent */
135 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
137 oldsave = PL_scopestack[PL_scopestack_ix - 1];
138 LEAVE_SCOPE(oldsave);
144 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
152 if (TARG == right && SvGMAGICAL(right))
154 if (SvGMAGICAL(left))
157 left_utf = DO_UTF8(left);
158 right_utf = DO_UTF8(right);
160 if (left_utf != right_utf) {
161 if (TARG == right && !right_utf) {
162 sv_utf8_upgrade(TARG); /* Now straight binary copy */
166 /* Set TARG to PV(left), then add right */
167 U8 *l, *c, *olds = NULL;
169 s = (U8*)SvPV(right,len);
171 /* Take a copy since we're about to overwrite TARG */
172 olds = s = (U8*)savepvn((char*)s, len);
174 if (!SvOK(left) && SvTYPE(left) <= SVt_PVMG)
175 sv_setpv(left, ""); /* Suppress warning. */
176 l = (U8*)SvPV(left, targlen);
178 sv_setpvn(TARG, (char*)l, targlen);
180 sv_utf8_upgrade(TARG);
181 /* Extend TARG to length of right (s) */
182 targlen = SvCUR(TARG) + len;
184 /* plus one for each hi-byte char if we have to upgrade */
185 for (c = s; c < s + len; c++) {
190 SvGROW(TARG, targlen+1);
191 /* And now copy, maybe upgrading right to UTF8 on the fly */
192 for (c = (U8*)SvEND(TARG); len--; s++) {
193 if (*s & 0x80 && !right_utf)
194 c = uv_to_utf8(c, *s);
198 SvCUR_set(TARG, targlen);
208 s = (U8*)SvPV(left,len);
210 sv_insert(TARG, 0, 0, (char*)s, len);
214 sv_setpvn(TARG, (char *)s, len);
216 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG)
217 sv_setpv(TARG, ""); /* Suppress warning. */
218 s = (U8*)SvPV(right,len);
220 #if defined(PERL_Y2KWARN)
221 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
223 char *s = SvPV(TARG,n);
224 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
225 && (n == 2 || !isDIGIT(s[n-3])))
227 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
228 "about to append an integer to '19'");
232 sv_catpvn(TARG, (char *)s, len);
235 sv_setpvn(TARG, (char *)s, len); /* suppress warning */
247 if (PL_op->op_flags & OPf_MOD) {
248 if (PL_op->op_private & OPpLVAL_INTRO)
249 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
250 else if (PL_op->op_private & OPpDEREF) {
252 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
261 tryAMAGICunTARGET(iter, 0);
262 PL_last_in_gv = (GV*)(*PL_stack_sp--);
263 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
264 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
265 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
268 XPUSHs((SV*)PL_last_in_gv);
271 PL_last_in_gv = (GV*)(*PL_stack_sp--);
274 return do_readline();
279 djSP; tryAMAGICbinSET(eq,0);
282 SETs(boolSV(TOPn == value));
290 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
291 DIE(aTHX_ PL_no_modify);
292 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
293 SvIVX(TOPs) != IV_MAX)
296 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
311 RETURNOP(cLOGOP->op_other);
317 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
320 SETn( left + right );
328 AV *av = GvAV(cGVOP_gv);
329 U32 lval = PL_op->op_flags & OPf_MOD;
330 SV** svp = av_fetch(av, PL_op->op_private, lval);
331 SV *sv = (svp ? *svp : &PL_sv_undef);
333 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
334 sv = sv_mortalcopy(sv);
341 djSP; dMARK; dTARGET;
343 do_join(TARG, *MARK, MARK, SP);
354 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
355 * will be enough to hold an OP*.
357 SV* sv = sv_newmortal();
358 sv_upgrade(sv, SVt_PVLV);
360 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
368 /* Oversized hot code. */
372 djSP; dMARK; dORIGMARK;
379 if (PL_op->op_flags & OPf_STACKED)
383 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
385 if (MARK == ORIGMARK) {
386 /* If using default handle then we need to make space to
387 * pass object as 1st arg, so move other args up ...
391 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
395 *MARK = SvTIED_obj((SV*)gv, mg);
398 call_method("PRINT", G_SCALAR);
406 if (!(io = GvIO(gv))) {
408 if ((GvEGV(gv)) && (mg = SvTIED_mg((SV*)GvEGV(gv),'q')))
410 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
411 report_evil_fh(gv, io, PL_op->op_type);
412 SETERRNO(EBADF,RMS$_IFI);
415 else if (!(fp = IoOFP(io))) {
416 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
418 /* integrate with report_evil_fh()? */
421 SV* sv = sv_newmortal();
422 gv_efullname4(sv, gv, Nullch, FALSE);
423 name = SvPV_nolen(sv);
426 Perl_warner(aTHX_ WARN_IO,
427 "Filehandle %s opened only for input", name);
429 Perl_warner(aTHX_ WARN_IO,
430 "Filehandle opened only for input");
432 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
433 report_evil_fh(gv, io, PL_op->op_type);
435 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
442 if (!do_print(*MARK, fp))
446 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
455 if (!do_print(*MARK, fp))
464 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
467 if (IoFLAGS(io) & IOf_FLUSH)
468 if (PerlIO_flush(fp) == EOF)
489 tryAMAGICunDEREF(to_av);
492 if (SvTYPE(av) != SVt_PVAV)
493 DIE(aTHX_ "Not an ARRAY reference");
494 if (PL_op->op_flags & OPf_REF) {
500 if (SvTYPE(sv) == SVt_PVAV) {
502 if (PL_op->op_flags & OPf_REF) {
510 if (SvTYPE(sv) != SVt_PVGV) {
514 if (SvGMAGICAL(sv)) {
520 if (PL_op->op_flags & OPf_REF ||
521 PL_op->op_private & HINT_STRICT_REFS)
522 DIE(aTHX_ PL_no_usym, "an ARRAY");
523 if (ckWARN(WARN_UNINITIALIZED))
525 if (GIMME == G_ARRAY) {
532 if ((PL_op->op_flags & OPf_SPECIAL) &&
533 !(PL_op->op_flags & OPf_MOD))
535 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
537 && (!is_gv_magical(sym,len,0)
538 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
544 if (PL_op->op_private & HINT_STRICT_REFS)
545 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
546 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
553 if (PL_op->op_private & OPpLVAL_INTRO)
555 if (PL_op->op_flags & OPf_REF) {
562 if (GIMME == G_ARRAY) {
563 I32 maxarg = AvFILL(av) + 1;
564 (void)POPs; /* XXXX May be optimized away? */
566 if (SvRMAGICAL(av)) {
568 for (i=0; i < maxarg; i++) {
569 SV **svp = av_fetch(av, i, FALSE);
570 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
574 Copy(AvARRAY(av), SP+1, maxarg, SV*);
580 I32 maxarg = AvFILL(av) + 1;
593 tryAMAGICunDEREF(to_hv);
596 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
597 DIE(aTHX_ "Not a HASH reference");
598 if (PL_op->op_flags & OPf_REF) {
604 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
606 if (PL_op->op_flags & OPf_REF) {
614 if (SvTYPE(sv) != SVt_PVGV) {
618 if (SvGMAGICAL(sv)) {
624 if (PL_op->op_flags & OPf_REF ||
625 PL_op->op_private & HINT_STRICT_REFS)
626 DIE(aTHX_ PL_no_usym, "a HASH");
627 if (ckWARN(WARN_UNINITIALIZED))
629 if (GIMME == G_ARRAY) {
636 if ((PL_op->op_flags & OPf_SPECIAL) &&
637 !(PL_op->op_flags & OPf_MOD))
639 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
641 && (!is_gv_magical(sym,len,0)
642 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
648 if (PL_op->op_private & HINT_STRICT_REFS)
649 DIE(aTHX_ PL_no_symref, sym, "a HASH");
650 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
657 if (PL_op->op_private & OPpLVAL_INTRO)
659 if (PL_op->op_flags & OPf_REF) {
666 if (GIMME == G_ARRAY) { /* array wanted */
667 *PL_stack_sp = (SV*)hv;
672 if (SvTYPE(hv) == SVt_PVAV)
673 hv = avhv_keys((AV*)hv);
675 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
676 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
686 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
692 leftop = ((BINOP*)PL_op)->op_last;
694 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
695 leftop = ((LISTOP*)leftop)->op_first;
697 /* Skip PUSHMARK and each element already assigned to. */
698 for (i = lelem - firstlelem; i > 0; i--) {
699 leftop = leftop->op_sibling;
702 if (leftop->op_type != OP_RV2HV)
707 av_fill(ary, 0); /* clear all but the fields hash */
708 if (lastrelem >= relem) {
709 while (relem < lastrelem) { /* gobble up all the rest */
713 /* Avoid a memory leak when avhv_store_ent dies. */
714 tmpstr = sv_newmortal();
715 sv_setsv(tmpstr,relem[1]); /* value */
717 if (avhv_store_ent(ary,relem[0],tmpstr,0))
718 (void)SvREFCNT_inc(tmpstr);
719 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
725 if (relem == lastrelem)
731 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
735 if (ckWARN(WARN_MISC)) {
736 if (relem == firstrelem &&
738 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
739 SvTYPE(SvRV(*relem)) == SVt_PVHV))
741 Perl_warner(aTHX_ WARN_MISC,
742 "Reference found where even-sized list expected");
745 Perl_warner(aTHX_ WARN_MISC,
746 "Odd number of elements in hash assignment");
748 if (SvTYPE(hash) == SVt_PVAV) {
750 tmpstr = sv_newmortal();
751 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
752 (void)SvREFCNT_inc(tmpstr);
753 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
758 tmpstr = NEWSV(29,0);
759 didstore = hv_store_ent(hash,*relem,tmpstr,0);
760 if (SvMAGICAL(hash)) {
761 if (SvSMAGICAL(tmpstr))
774 SV **lastlelem = PL_stack_sp;
775 SV **lastrelem = PL_stack_base + POPMARK;
776 SV **firstrelem = PL_stack_base + POPMARK + 1;
777 SV **firstlelem = lastrelem + 1;
790 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
792 /* If there's a common identifier on both sides we have to take
793 * special care that assigning the identifier on the left doesn't
794 * clobber a value on the right that's used later in the list.
796 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
797 EXTEND_MORTAL(lastrelem - firstrelem + 1);
798 for (relem = firstrelem; relem <= lastrelem; relem++) {
801 TAINT_NOT; /* Each item is independent */
802 *relem = sv_mortalcopy(sv);
812 while (lelem <= lastlelem) {
813 TAINT_NOT; /* Each item stands on its own, taintwise. */
815 switch (SvTYPE(sv)) {
818 magic = SvMAGICAL(ary) != 0;
819 if (PL_op->op_private & OPpASSIGN_HASH) {
820 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
826 do_oddball((HV*)ary, relem, firstrelem);
828 relem = lastrelem + 1;
833 av_extend(ary, lastrelem - relem);
835 while (relem <= lastrelem) { /* gobble up all the rest */
841 didstore = av_store(ary,i++,sv);
851 case SVt_PVHV: { /* normal hash */
855 magic = SvMAGICAL(hash) != 0;
858 while (relem < lastrelem) { /* gobble up all the rest */
863 sv = &PL_sv_no, relem++;
864 tmpstr = NEWSV(29,0);
866 sv_setsv(tmpstr,*relem); /* value */
868 didstore = hv_store_ent(hash,sv,tmpstr,0);
870 if (SvSMAGICAL(tmpstr))
877 if (relem == lastrelem) {
878 do_oddball(hash, relem, firstrelem);
884 if (SvIMMORTAL(sv)) {
885 if (relem <= lastrelem)
889 if (relem <= lastrelem) {
890 sv_setsv(sv, *relem);
894 sv_setsv(sv, &PL_sv_undef);
899 if (PL_delaymagic & ~DM_DELAY) {
900 if (PL_delaymagic & DM_UID) {
902 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
905 (void)setreuid(PL_uid,PL_euid);
908 if ((PL_delaymagic & DM_UID) == DM_RUID) {
909 (void)setruid(PL_uid);
910 PL_delaymagic &= ~DM_RUID;
912 # endif /* HAS_SETRUID */
914 if ((PL_delaymagic & DM_UID) == DM_EUID) {
915 (void)seteuid(PL_uid);
916 PL_delaymagic &= ~DM_EUID;
918 # endif /* HAS_SETEUID */
919 if (PL_delaymagic & DM_UID) {
920 if (PL_uid != PL_euid)
921 DIE(aTHX_ "No setreuid available");
922 (void)PerlProc_setuid(PL_uid);
924 # endif /* HAS_SETREUID */
925 #endif /* HAS_SETRESUID */
926 PL_uid = PerlProc_getuid();
927 PL_euid = PerlProc_geteuid();
929 if (PL_delaymagic & DM_GID) {
931 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
934 (void)setregid(PL_gid,PL_egid);
937 if ((PL_delaymagic & DM_GID) == DM_RGID) {
938 (void)setrgid(PL_gid);
939 PL_delaymagic &= ~DM_RGID;
941 # endif /* HAS_SETRGID */
943 if ((PL_delaymagic & DM_GID) == DM_EGID) {
944 (void)setegid(PL_gid);
945 PL_delaymagic &= ~DM_EGID;
947 # endif /* HAS_SETEGID */
948 if (PL_delaymagic & DM_GID) {
949 if (PL_gid != PL_egid)
950 DIE(aTHX_ "No setregid available");
951 (void)PerlProc_setgid(PL_gid);
953 # endif /* HAS_SETREGID */
954 #endif /* HAS_SETRESGID */
955 PL_gid = PerlProc_getgid();
956 PL_egid = PerlProc_getegid();
958 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
965 else if (gimme == G_SCALAR) {
968 SETi(lastrelem - firstrelem + 1);
974 SP = firstrelem + (lastlelem - firstlelem);
975 lelem = firstlelem + (relem - firstrelem);
977 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
985 register PMOP *pm = cPMOP;
986 SV *rv = sv_newmortal();
987 SV *sv = newSVrv(rv, "Regexp");
988 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
995 register PMOP *pm = cPMOP;
1000 I32 r_flags = REXEC_CHECKED;
1001 char *truebase; /* Start of string */
1002 register REGEXP *rx = pm->op_pmregexp;
1007 I32 oldsave = PL_savestack_ix;
1008 I32 update_minmatch = 1;
1009 I32 had_zerolen = 0;
1011 if (PL_op->op_flags & OPf_STACKED)
1017 PUTBACK; /* EVAL blocks need stack_sp. */
1018 s = SvPV(TARG, len);
1021 DIE(aTHX_ "panic: do_match");
1022 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1023 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1026 if (pm->op_pmdynflags & PMdf_USED) {
1028 if (gimme == G_ARRAY)
1033 if (!rx->prelen && PL_curpm) {
1035 rx = pm->op_pmregexp;
1037 if (rx->minlen > len) goto failure;
1041 /* XXXX What part of this is needed with true \G-support? */
1042 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1044 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1045 MAGIC* mg = mg_find(TARG, 'g');
1046 if (mg && mg->mg_len >= 0) {
1047 if (!(rx->reganch & ROPT_GPOS_SEEN))
1048 rx->endp[0] = rx->startp[0] = mg->mg_len;
1049 else if (rx->reganch & ROPT_ANCH_GPOS) {
1050 r_flags |= REXEC_IGNOREPOS;
1051 rx->endp[0] = rx->startp[0] = mg->mg_len;
1053 minmatch = (mg->mg_flags & MGf_MINMATCH);
1054 update_minmatch = 0;
1058 if ((gimme != G_ARRAY && !global && rx->nparens)
1059 || SvTEMP(TARG) || PL_sawampersand)
1060 r_flags |= REXEC_COPY_STR;
1062 r_flags |= REXEC_SCREAM;
1064 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1065 SAVEINT(PL_multiline);
1066 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1070 if (global && rx->startp[0] != -1) {
1071 t = s = rx->endp[0] + truebase;
1072 if ((s + rx->minlen) > strend)
1074 if (update_minmatch++)
1075 minmatch = had_zerolen;
1077 if (rx->reganch & RE_USE_INTUIT) {
1078 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1082 if ( (rx->reganch & ROPT_CHECK_ALL)
1084 && ((rx->reganch & ROPT_NOSCAN)
1085 || !((rx->reganch & RE_INTUIT_TAIL)
1086 && (r_flags & REXEC_SCREAM)))
1087 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1090 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1093 if (pm->op_pmflags & PMf_ONCE)
1094 pm->op_pmdynflags |= PMdf_USED;
1103 RX_MATCH_TAINTED_on(rx);
1104 TAINT_IF(RX_MATCH_TAINTED(rx));
1105 if (gimme == G_ARRAY) {
1108 iters = rx->nparens;
1109 if (global && !iters)
1113 SPAGAIN; /* EVAL blocks could move the stack. */
1114 EXTEND(SP, iters + i);
1115 EXTEND_MORTAL(iters + i);
1116 for (i = !i; i <= iters; i++) {
1117 PUSHs(sv_newmortal());
1119 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1120 len = rx->endp[i] - rx->startp[i];
1121 s = rx->startp[i] + truebase;
1122 sv_setpvn(*SP, s, len);
1123 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1125 sv_utf8_downgrade(*SP, TRUE);
1130 had_zerolen = (rx->startp[0] != -1
1131 && rx->startp[0] == rx->endp[0]);
1132 PUTBACK; /* EVAL blocks may use stack */
1133 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1138 LEAVE_SCOPE(oldsave);
1144 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1145 mg = mg_find(TARG, 'g');
1147 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1148 mg = mg_find(TARG, 'g');
1150 if (rx->startp[0] != -1) {
1151 mg->mg_len = rx->endp[0];
1152 if (rx->startp[0] == rx->endp[0])
1153 mg->mg_flags |= MGf_MINMATCH;
1155 mg->mg_flags &= ~MGf_MINMATCH;
1158 LEAVE_SCOPE(oldsave);
1162 yup: /* Confirmed by INTUIT */
1164 RX_MATCH_TAINTED_on(rx);
1165 TAINT_IF(RX_MATCH_TAINTED(rx));
1167 if (pm->op_pmflags & PMf_ONCE)
1168 pm->op_pmdynflags |= PMdf_USED;
1169 if (RX_MATCH_COPIED(rx))
1170 Safefree(rx->subbeg);
1171 RX_MATCH_COPIED_off(rx);
1172 rx->subbeg = Nullch;
1174 rx->subbeg = truebase;
1175 rx->startp[0] = s - truebase;
1176 rx->endp[0] = s - truebase + rx->minlen;
1177 rx->sublen = strend - truebase;
1180 if (PL_sawampersand) {
1183 rx->subbeg = savepvn(t, strend - t);
1184 rx->sublen = strend - t;
1185 RX_MATCH_COPIED_on(rx);
1186 off = rx->startp[0] = s - t;
1187 rx->endp[0] = off + rx->minlen;
1189 else { /* startp/endp are used by @- @+. */
1190 rx->startp[0] = s - truebase;
1191 rx->endp[0] = s - truebase + rx->minlen;
1193 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1194 LEAVE_SCOPE(oldsave);
1199 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1200 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1201 MAGIC* mg = mg_find(TARG, 'g');
1206 LEAVE_SCOPE(oldsave);
1207 if (gimme == G_ARRAY)
1213 Perl_do_readline(pTHX)
1215 dSP; dTARGETSTACKED;
1220 register IO *io = GvIO(PL_last_in_gv);
1221 register I32 type = PL_op->op_type;
1222 I32 gimme = GIMME_V;
1225 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1227 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1230 call_method("READLINE", gimme);
1233 if (gimme == G_SCALAR)
1234 SvSetMagicSV_nosteal(TARG, TOPs);
1241 if (IoFLAGS(io) & IOf_ARGV) {
1242 if (IoFLAGS(io) & IOf_START) {
1244 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1245 IoFLAGS(io) &= ~IOf_START;
1246 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1247 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1248 SvSETMAGIC(GvSV(PL_last_in_gv));
1253 fp = nextargv(PL_last_in_gv);
1254 if (!fp) { /* Note: fp != IoIFP(io) */
1255 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1258 else if (type == OP_GLOB) {
1259 SV *tmpcmd = NEWSV(55, 0);
1263 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1264 /* since spawning off a process is a real performance hit */
1266 #include <descrip.h>
1267 #include <lib$routines.h>
1270 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1271 char vmsspec[NAM$C_MAXRSS+1];
1272 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1273 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1274 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1277 struct dsc$descriptor_s wilddsc
1278 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1279 struct dsc$descriptor_vs rsdsc
1280 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1281 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1283 /* We could find out if there's an explicit dev/dir or version
1284 by peeking into lib$find_file's internal context at
1285 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1286 but that's unsupported, so I don't want to do it now and
1287 have it bite someone in the future. */
1288 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1289 cp = SvPV(tmpglob,i);
1291 if (cp[i] == ';') hasver = 1;
1293 if (sts) hasver = 1;
1297 hasdir = isunix = 1;
1300 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1305 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1307 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1308 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1309 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1310 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1311 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1312 &dfltdsc,NULL,NULL,NULL))&1)) {
1313 end = rstr + (unsigned long int) *rslt;
1314 if (!hasver) while (*end != ';') end--;
1315 *(end++) = '\n'; *end = '\0';
1316 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1318 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1323 while (*(--begin) != ']' && *begin != '>') ;
1326 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1328 if (cxt) (void)lib$find_file_end(&cxt);
1329 if (ok && sts != RMS$_NMF &&
1330 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1333 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1335 PerlIO_close(tmpfp);
1339 PerlIO_rewind(tmpfp);
1341 IoIFP(io) = fp = tmpfp;
1342 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1347 #ifdef MACOS_TRADITIONAL
1348 sv_setpv(tmpcmd, "glob ");
1349 sv_catsv(tmpcmd, tmpglob);
1350 sv_catpv(tmpcmd, " |");
1354 sv_setpv(tmpcmd, "for a in ");
1355 sv_catsv(tmpcmd, tmpglob);
1356 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1359 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1360 sv_catsv(tmpcmd, tmpglob);
1362 sv_setpv(tmpcmd, "perlglob ");
1363 sv_catsv(tmpcmd, tmpglob);
1364 sv_catpv(tmpcmd, " |");
1369 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1370 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1371 sv_catsv(tmpcmd, tmpglob);
1372 sv_catpv(tmpcmd, "' 2>/dev/null |");
1374 sv_setpv(tmpcmd, "echo ");
1375 sv_catsv(tmpcmd, tmpglob);
1377 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1379 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1382 #endif /* !DOSISH */
1383 #endif /* MACOS_TRADITIONAL */
1384 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1385 FALSE, O_RDONLY, 0, Nullfp);
1391 else if (type == OP_GLOB)
1393 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1394 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1395 || fp == PerlIO_stderr()))
1397 /* integrate with report_evil_fh()? */
1399 if (isGV(PL_last_in_gv)) { /* can this ever fail? */
1400 SV* sv = sv_newmortal();
1401 gv_efullname4(sv, PL_last_in_gv, Nullch, FALSE);
1402 name = SvPV_nolen(sv);
1405 Perl_warner(aTHX_ WARN_IO,
1406 "Filehandle %s opened only for output", name);
1408 Perl_warner(aTHX_ WARN_IO,
1409 "Filehandle opened only for output");
1413 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1414 if (type == OP_GLOB)
1415 Perl_warner(aTHX_ WARN_GLOB,
1416 "glob failed (can't start child: %s)",
1419 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1421 if (gimme == G_SCALAR) {
1422 (void)SvOK_off(TARG);
1428 if (gimme == G_SCALAR) {
1432 (void)SvUPGRADE(sv, SVt_PV);
1433 tmplen = SvLEN(sv); /* remember if already alloced */
1435 Sv_Grow(sv, 80); /* try short-buffering it */
1436 if (type == OP_RCATLINE)
1442 sv = sv_2mortal(NEWSV(57, 80));
1446 /* delay EOF state for a snarfed empty file */
1447 #define SNARF_EOF(gimme,rs,io,sv) \
1448 (gimme != G_SCALAR || SvCUR(sv) \
1449 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1452 if (!sv_gets(sv, fp, offset)
1453 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1455 PerlIO_clearerr(fp);
1456 if (IoFLAGS(io) & IOf_ARGV) {
1457 fp = nextargv(PL_last_in_gv);
1460 (void)do_close(PL_last_in_gv, FALSE);
1462 else if (type == OP_GLOB) {
1463 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1464 Perl_warner(aTHX_ WARN_GLOB,
1465 "glob failed (child exited with status %d%s)",
1466 (int)(STATUS_CURRENT >> 8),
1467 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1470 if (gimme == G_SCALAR) {
1471 (void)SvOK_off(TARG);
1476 /* This should not be marked tainted if the fp is marked clean */
1477 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1482 IoFLAGS(io) |= IOf_NOLINE;
1485 if (type == OP_GLOB) {
1488 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1489 tmps = SvEND(sv) - 1;
1490 if (*tmps == *SvPVX(PL_rs)) {
1495 for (tmps = SvPVX(sv); *tmps; tmps++)
1496 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1497 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1499 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1500 (void)POPs; /* Unmatched wildcard? Chuck it... */
1504 if (gimme == G_ARRAY) {
1505 if (SvLEN(sv) - SvCUR(sv) > 20) {
1506 SvLEN_set(sv, SvCUR(sv)+1);
1507 Renew(SvPVX(sv), SvLEN(sv), char);
1509 sv = sv_2mortal(NEWSV(58, 80));
1512 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1513 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1517 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1518 Renew(SvPVX(sv), SvLEN(sv), char);
1527 register PERL_CONTEXT *cx;
1528 I32 gimme = OP_GIMME(PL_op, -1);
1531 if (cxstack_ix >= 0)
1532 gimme = cxstack[cxstack_ix].blk_gimme;
1540 PUSHBLOCK(cx, CXt_BLOCK, SP);
1552 U32 lval = PL_op->op_flags & OPf_MOD;
1553 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1555 U32 hash = (SvFAKE(keysv) && SvREADONLY(keysv)) ? SvUVX(keysv) : 0;
1557 if (SvTYPE(hv) == SVt_PVHV) {
1558 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1559 svp = he ? &HeVAL(he) : 0;
1561 else if (SvTYPE(hv) == SVt_PVAV) {
1562 if (PL_op->op_private & OPpLVAL_INTRO)
1563 DIE(aTHX_ "Can't localize pseudo-hash element");
1564 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, hash);
1570 if (!svp || *svp == &PL_sv_undef) {
1575 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1577 lv = sv_newmortal();
1578 sv_upgrade(lv, SVt_PVLV);
1580 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1581 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1582 LvTARG(lv) = SvREFCNT_inc(hv);
1587 if (PL_op->op_private & OPpLVAL_INTRO) {
1588 if (HvNAME(hv) && isGV(*svp))
1589 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1591 save_helem(hv, keysv, svp);
1593 else if (PL_op->op_private & OPpDEREF)
1594 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1596 sv = (svp ? *svp : &PL_sv_undef);
1597 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1598 * Pushing the magical RHS on to the stack is useless, since
1599 * that magic is soon destined to be misled by the local(),
1600 * and thus the later pp_sassign() will fail to mg_get() the
1601 * old value. This should also cure problems with delayed
1602 * mg_get()s. GSAR 98-07-03 */
1603 if (!lval && SvGMAGICAL(sv))
1604 sv = sv_mortalcopy(sv);
1612 register PERL_CONTEXT *cx;
1618 if (PL_op->op_flags & OPf_SPECIAL) {
1619 cx = &cxstack[cxstack_ix];
1620 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1625 gimme = OP_GIMME(PL_op, -1);
1627 if (cxstack_ix >= 0)
1628 gimme = cxstack[cxstack_ix].blk_gimme;
1634 if (gimme == G_VOID)
1636 else if (gimme == G_SCALAR) {
1639 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1642 *MARK = sv_mortalcopy(TOPs);
1645 *MARK = &PL_sv_undef;
1649 else if (gimme == G_ARRAY) {
1650 /* in case LEAVE wipes old return values */
1651 for (mark = newsp + 1; mark <= SP; mark++) {
1652 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1653 *mark = sv_mortalcopy(*mark);
1654 TAINT_NOT; /* Each item is independent */
1658 PL_curpm = newpm; /* Don't pop $1 et al till now */
1668 register PERL_CONTEXT *cx;
1674 cx = &cxstack[cxstack_ix];
1675 if (CxTYPE(cx) != CXt_LOOP)
1676 DIE(aTHX_ "panic: pp_iter");
1678 itersvp = CxITERVAR(cx);
1679 av = cx->blk_loop.iterary;
1680 if (SvTYPE(av) != SVt_PVAV) {
1681 /* iterate ($min .. $max) */
1682 if (cx->blk_loop.iterlval) {
1683 /* string increment */
1684 register SV* cur = cx->blk_loop.iterlval;
1686 char *max = SvPV((SV*)av, maxlen);
1687 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1688 #ifndef USE_THREADS /* don't risk potential race */
1689 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1690 /* safe to reuse old SV */
1691 sv_setsv(*itersvp, cur);
1696 /* we need a fresh SV every time so that loop body sees a
1697 * completely new SV for closures/references to work as
1699 SvREFCNT_dec(*itersvp);
1700 *itersvp = newSVsv(cur);
1702 if (strEQ(SvPVX(cur), max))
1703 sv_setiv(cur, 0); /* terminate next time */
1710 /* integer increment */
1711 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1714 #ifndef USE_THREADS /* don't risk potential race */
1715 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1716 /* safe to reuse old SV */
1717 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1722 /* we need a fresh SV every time so that loop body sees a
1723 * completely new SV for closures/references to work as they
1725 SvREFCNT_dec(*itersvp);
1726 *itersvp = newSViv(cx->blk_loop.iterix++);
1732 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1735 SvREFCNT_dec(*itersvp);
1737 if ((sv = SvMAGICAL(av)
1738 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1739 : AvARRAY(av)[++cx->blk_loop.iterix]))
1743 if (av != PL_curstack && SvIMMORTAL(sv)) {
1744 SV *lv = cx->blk_loop.iterlval;
1745 if (lv && SvREFCNT(lv) > 1) {
1750 SvREFCNT_dec(LvTARG(lv));
1752 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1753 sv_upgrade(lv, SVt_PVLV);
1755 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1757 LvTARG(lv) = SvREFCNT_inc(av);
1758 LvTARGOFF(lv) = cx->blk_loop.iterix;
1759 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1763 *itersvp = SvREFCNT_inc(sv);
1770 register PMOP *pm = cPMOP;
1786 register REGEXP *rx = pm->op_pmregexp;
1788 int force_on_match = 0;
1789 I32 oldsave = PL_savestack_ix;
1791 /* known replacement string? */
1792 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1793 if (PL_op->op_flags & OPf_STACKED)
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: do_subst");
1821 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1822 position, once with zero-length,
1823 second time with non-zero. */
1825 if (!rx->prelen && PL_curpm) {
1827 rx = pm->op_pmregexp;
1829 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1830 ? REXEC_COPY_STR : 0;
1832 r_flags |= REXEC_SCREAM;
1833 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1834 SAVEINT(PL_multiline);
1835 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1838 if (rx->reganch & RE_USE_INTUIT) {
1839 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1843 /* How to do it in subst? */
1844 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1846 && ((rx->reganch & ROPT_NOSCAN)
1847 || !((rx->reganch & RE_INTUIT_TAIL)
1848 && (r_flags & REXEC_SCREAM))))
1853 /* only replace once? */
1854 once = !(rpm->op_pmflags & PMf_GLOBAL);
1856 /* known replacement string? */
1857 c = dstr ? SvPV(dstr, clen) : Nullch;
1859 /* can do inplace substitution? */
1860 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1861 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1862 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1863 r_flags | REXEC_CHECKED))
1867 LEAVE_SCOPE(oldsave);
1870 if (force_on_match) {
1872 s = SvPV_force(TARG, len);
1877 SvSCREAM_off(TARG); /* disable possible screamer */
1879 rxtainted |= RX_MATCH_TAINTED(rx);
1880 m = orig + rx->startp[0];
1881 d = orig + rx->endp[0];
1883 if (m - s > strend - d) { /* faster to shorten from end */
1885 Copy(c, m, clen, char);
1890 Move(d, m, i, char);
1894 SvCUR_set(TARG, m - s);
1897 else if ((i = m - s)) { /* faster from front */
1905 Copy(c, m, clen, char);
1910 Copy(c, d, clen, char);
1915 TAINT_IF(rxtainted & 1);
1921 if (iters++ > maxiters)
1922 DIE(aTHX_ "Substitution loop");
1923 rxtainted |= RX_MATCH_TAINTED(rx);
1924 m = rx->startp[0] + orig;
1928 Move(s, d, i, char);
1932 Copy(c, d, clen, char);
1935 s = rx->endp[0] + orig;
1936 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1938 /* don't match same null twice */
1939 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1942 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1943 Move(s, d, i+1, char); /* include the NUL */
1945 TAINT_IF(rxtainted & 1);
1947 PUSHs(sv_2mortal(newSViv((I32)iters)));
1949 (void)SvPOK_only_UTF8(TARG);
1950 TAINT_IF(rxtainted);
1951 if (SvSMAGICAL(TARG)) {
1957 LEAVE_SCOPE(oldsave);
1961 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1962 r_flags | REXEC_CHECKED))
1964 if (force_on_match) {
1966 s = SvPV_force(TARG, len);
1969 rxtainted |= RX_MATCH_TAINTED(rx);
1970 dstr = NEWSV(25, len);
1971 sv_setpvn(dstr, m, s-m);
1974 register PERL_CONTEXT *cx;
1977 RETURNOP(cPMOP->op_pmreplroot);
1979 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1981 if (iters++ > maxiters)
1982 DIE(aTHX_ "Substitution loop");
1983 rxtainted |= RX_MATCH_TAINTED(rx);
1984 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1989 strend = s + (strend - m);
1991 m = rx->startp[0] + orig;
1992 sv_catpvn(dstr, s, m-s);
1993 s = rx->endp[0] + orig;
1995 sv_catpvn(dstr, c, clen);
1998 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1999 sv_catpvn(dstr, s, strend - s);
2001 (void)SvOOK_off(TARG);
2002 Safefree(SvPVX(TARG));
2003 SvPVX(TARG) = SvPVX(dstr);
2004 SvCUR_set(TARG, SvCUR(dstr));
2005 SvLEN_set(TARG, SvLEN(dstr));
2009 TAINT_IF(rxtainted & 1);
2011 PUSHs(sv_2mortal(newSViv((I32)iters)));
2013 (void)SvPOK_only(TARG);
2014 TAINT_IF(rxtainted);
2017 LEAVE_SCOPE(oldsave);
2026 LEAVE_SCOPE(oldsave);
2035 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2036 ++*PL_markstack_ptr;
2037 LEAVE; /* exit inner scope */
2040 if (PL_stack_base + *PL_markstack_ptr > SP) {
2042 I32 gimme = GIMME_V;
2044 LEAVE; /* exit outer scope */
2045 (void)POPMARK; /* pop src */
2046 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2047 (void)POPMARK; /* pop dst */
2048 SP = PL_stack_base + POPMARK; /* pop original mark */
2049 if (gimme == G_SCALAR) {
2053 else if (gimme == G_ARRAY)
2060 ENTER; /* enter inner scope */
2063 src = PL_stack_base[*PL_markstack_ptr];
2067 RETURNOP(cLOGOP->op_other);
2078 register PERL_CONTEXT *cx;
2084 if (gimme == G_SCALAR) {
2087 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2089 *MARK = SvREFCNT_inc(TOPs);
2094 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2096 *MARK = sv_mortalcopy(sv);
2101 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2105 *MARK = &PL_sv_undef;
2109 else if (gimme == G_ARRAY) {
2110 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2111 if (!SvTEMP(*MARK)) {
2112 *MARK = sv_mortalcopy(*MARK);
2113 TAINT_NOT; /* Each item is independent */
2119 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2120 PL_curpm = newpm; /* ... and pop $1 et al */
2124 return pop_return();
2127 /* This duplicates the above code because the above code must not
2128 * get any slower by more conditions */
2136 register PERL_CONTEXT *cx;
2143 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2144 /* We are an argument to a function or grep().
2145 * This kind of lvalueness was legal before lvalue
2146 * subroutines too, so be backward compatible:
2147 * cannot report errors. */
2149 /* Scalar context *is* possible, on the LHS of -> only,
2150 * as in f()->meth(). But this is not an lvalue. */
2151 if (gimme == G_SCALAR)
2153 if (gimme == G_ARRAY) {
2154 if (!CvLVALUE(cx->blk_sub.cv))
2155 goto temporise_array;
2156 EXTEND_MORTAL(SP - newsp);
2157 for (mark = newsp + 1; mark <= SP; mark++) {
2160 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2161 *mark = sv_mortalcopy(*mark);
2163 /* Can be a localized value subject to deletion. */
2164 PL_tmps_stack[++PL_tmps_ix] = *mark;
2165 (void)SvREFCNT_inc(*mark);
2170 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2171 /* Here we go for robustness, not for speed, so we change all
2172 * the refcounts so the caller gets a live guy. Cannot set
2173 * TEMP, so sv_2mortal is out of question. */
2174 if (!CvLVALUE(cx->blk_sub.cv)) {
2179 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2181 if (gimme == G_SCALAR) {
2185 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2190 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2191 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2193 else { /* Can be a localized value
2194 * subject to deletion. */
2195 PL_tmps_stack[++PL_tmps_ix] = *mark;
2196 (void)SvREFCNT_inc(*mark);
2199 else { /* Should not happen? */
2204 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2205 (MARK > SP ? "Empty array" : "Array"));
2209 else if (gimme == G_ARRAY) {
2210 EXTEND_MORTAL(SP - newsp);
2211 for (mark = newsp + 1; mark <= SP; mark++) {
2212 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2213 /* Might be flattened array after $#array = */
2219 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2220 (*mark != &PL_sv_undef)
2222 ? "a readonly value" : "a temporary")
2223 : "an uninitialized value");
2226 /* Can be a localized value subject to deletion. */
2227 PL_tmps_stack[++PL_tmps_ix] = *mark;
2228 (void)SvREFCNT_inc(*mark);
2234 if (gimme == G_SCALAR) {
2238 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2240 *MARK = SvREFCNT_inc(TOPs);
2245 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2247 *MARK = sv_mortalcopy(sv);
2252 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2256 *MARK = &PL_sv_undef;
2260 else if (gimme == G_ARRAY) {
2262 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2263 if (!SvTEMP(*MARK)) {
2264 *MARK = sv_mortalcopy(*MARK);
2265 TAINT_NOT; /* Each item is independent */
2272 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2273 PL_curpm = newpm; /* ... and pop $1 et al */
2277 return pop_return();
2282 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2285 SV *dbsv = GvSV(PL_DBsub);
2287 if (!PERLDB_SUB_NN) {
2291 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2292 || strEQ(GvNAME(gv), "END")
2293 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2294 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2295 && (gv = (GV*)*svp) ))) {
2296 /* Use GV from the stack as a fallback. */
2297 /* GV is potentially non-unique, or contain different CV. */
2298 SV *tmp = newRV((SV*)cv);
2299 sv_setsv(dbsv, tmp);
2303 gv_efullname3(dbsv, gv, Nullch);
2307 (void)SvUPGRADE(dbsv, SVt_PVIV);
2308 (void)SvIOK_on(dbsv);
2309 SAVEIV(SvIVX(dbsv));
2310 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2314 PL_curcopdb = PL_curcop;
2315 cv = GvCV(PL_DBsub);
2325 register PERL_CONTEXT *cx;
2327 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2330 DIE(aTHX_ "Not a CODE reference");
2331 switch (SvTYPE(sv)) {
2337 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2339 SP = PL_stack_base + POPMARK;
2342 if (SvGMAGICAL(sv)) {
2344 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2347 sym = SvPV(sv, n_a);
2349 DIE(aTHX_ PL_no_usym, "a subroutine");
2350 if (PL_op->op_private & HINT_STRICT_REFS)
2351 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2352 cv = get_cv(sym, TRUE);
2356 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2357 tryAMAGICunDEREF(to_cv);
2360 if (SvTYPE(cv) == SVt_PVCV)
2365 DIE(aTHX_ "Not a CODE reference");
2370 if (!(cv = GvCVu((GV*)sv)))
2371 cv = sv_2cv(sv, &stash, &gv, FALSE);
2384 if (!CvROOT(cv) && !CvXSUB(cv)) {
2388 /* anonymous or undef'd function leaves us no recourse */
2389 if (CvANON(cv) || !(gv = CvGV(cv)))
2390 DIE(aTHX_ "Undefined subroutine called");
2392 /* autoloaded stub? */
2393 if (cv != GvCV(gv)) {
2396 /* should call AUTOLOAD now? */
2399 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2406 sub_name = sv_newmortal();
2407 gv_efullname3(sub_name, gv, Nullch);
2408 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2412 DIE(aTHX_ "Not a CODE reference");
2417 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2418 cv = get_db_sub(&sv, cv);
2420 DIE(aTHX_ "No DBsub routine");
2425 * First we need to check if the sub or method requires locking.
2426 * If so, we gain a lock on the CV, the first argument or the
2427 * stash (for static methods), as appropriate. This has to be
2428 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2429 * reschedule by returning a new op.
2431 MUTEX_LOCK(CvMUTEXP(cv));
2432 if (CvFLAGS(cv) & CVf_LOCKED) {
2434 if (CvFLAGS(cv) & CVf_METHOD) {
2435 if (SP > PL_stack_base + TOPMARK)
2436 sv = *(PL_stack_base + TOPMARK + 1);
2438 AV *av = (AV*)PL_curpad[0];
2439 if (hasargs || !av || AvFILLp(av) < 0
2440 || !(sv = AvARRAY(av)[0]))
2442 MUTEX_UNLOCK(CvMUTEXP(cv));
2443 DIE(aTHX_ "no argument for locked method call");
2450 char *stashname = SvPV(sv, len);
2451 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2457 MUTEX_UNLOCK(CvMUTEXP(cv));
2458 mg = condpair_magic(sv);
2459 MUTEX_LOCK(MgMUTEXP(mg));
2460 if (MgOWNER(mg) == thr)
2461 MUTEX_UNLOCK(MgMUTEXP(mg));
2464 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2466 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2468 MUTEX_UNLOCK(MgMUTEXP(mg));
2469 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2471 MUTEX_LOCK(CvMUTEXP(cv));
2474 * Now we have permission to enter the sub, we must distinguish
2475 * four cases. (0) It's an XSUB (in which case we don't care
2476 * about ownership); (1) it's ours already (and we're recursing);
2477 * (2) it's free (but we may already be using a cached clone);
2478 * (3) another thread owns it. Case (1) is easy: we just use it.
2479 * Case (2) means we look for a clone--if we have one, use it
2480 * otherwise grab ownership of cv. Case (3) means we look for a
2481 * clone (for non-XSUBs) and have to create one if we don't
2483 * Why look for a clone in case (2) when we could just grab
2484 * ownership of cv straight away? Well, we could be recursing,
2485 * i.e. we originally tried to enter cv while another thread
2486 * owned it (hence we used a clone) but it has been freed up
2487 * and we're now recursing into it. It may or may not be "better"
2488 * to use the clone but at least CvDEPTH can be trusted.
2490 if (CvOWNER(cv) == thr || CvXSUB(cv))
2491 MUTEX_UNLOCK(CvMUTEXP(cv));
2493 /* Case (2) or (3) */
2497 * XXX Might it be better to release CvMUTEXP(cv) while we
2498 * do the hv_fetch? We might find someone has pinched it
2499 * when we look again, in which case we would be in case
2500 * (3) instead of (2) so we'd have to clone. Would the fact
2501 * that we released the mutex more quickly make up for this?
2503 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2505 /* We already have a clone to use */
2506 MUTEX_UNLOCK(CvMUTEXP(cv));
2508 DEBUG_S(PerlIO_printf(Perl_debug_log,
2509 "entersub: %p already has clone %p:%s\n",
2510 thr, cv, SvPEEK((SV*)cv)));
2513 if (CvDEPTH(cv) == 0)
2514 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2517 /* (2) => grab ownership of cv. (3) => make clone */
2521 MUTEX_UNLOCK(CvMUTEXP(cv));
2522 DEBUG_S(PerlIO_printf(Perl_debug_log,
2523 "entersub: %p grabbing %p:%s in stash %s\n",
2524 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2525 HvNAME(CvSTASH(cv)) : "(none)"));
2528 /* Make a new clone. */
2530 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2531 MUTEX_UNLOCK(CvMUTEXP(cv));
2532 DEBUG_S((PerlIO_printf(Perl_debug_log,
2533 "entersub: %p cloning %p:%s\n",
2534 thr, cv, SvPEEK((SV*)cv))));
2536 * We're creating a new clone so there's no race
2537 * between the original MUTEX_UNLOCK and the
2538 * SvREFCNT_inc since no one will be trying to undef
2539 * it out from underneath us. At least, I don't think
2542 clonecv = cv_clone(cv);
2543 SvREFCNT_dec(cv); /* finished with this */
2544 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2545 CvOWNER(clonecv) = thr;
2549 DEBUG_S(if (CvDEPTH(cv) != 0)
2550 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2552 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2555 #endif /* USE_THREADS */
2558 #ifdef PERL_XSUB_OLDSTYLE
2559 if (CvOLDSTYLE(cv)) {
2560 I32 (*fp3)(int,int,int);
2562 register I32 items = SP - MARK;
2563 /* We dont worry to copy from @_. */
2568 PL_stack_sp = mark + 1;
2569 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2570 items = (*fp3)(CvXSUBANY(cv).any_i32,
2571 MARK - PL_stack_base + 1,
2573 PL_stack_sp = PL_stack_base + items;
2576 #endif /* PERL_XSUB_OLDSTYLE */
2578 I32 markix = TOPMARK;
2583 /* Need to copy @_ to stack. Alternative may be to
2584 * switch stack to @_, and copy return values
2585 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2589 av = (AV*)PL_curpad[0];
2591 av = GvAV(PL_defgv);
2592 #endif /* USE_THREADS */
2593 items = AvFILLp(av) + 1; /* @_ is not tieable */
2596 /* Mark is at the end of the stack. */
2598 Copy(AvARRAY(av), SP + 1, items, SV*);
2603 /* We assume first XSUB in &DB::sub is the called one. */
2605 SAVEVPTR(PL_curcop);
2606 PL_curcop = PL_curcopdb;
2609 /* Do we need to open block here? XXXX */
2610 (void)(*CvXSUB(cv))(aTHXo_ cv);
2612 /* Enforce some sanity in scalar context. */
2613 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2614 if (markix > PL_stack_sp - PL_stack_base)
2615 *(PL_stack_base + markix) = &PL_sv_undef;
2617 *(PL_stack_base + markix) = *PL_stack_sp;
2618 PL_stack_sp = PL_stack_base + markix;
2626 register I32 items = SP - MARK;
2627 AV* padlist = CvPADLIST(cv);
2628 SV** svp = AvARRAY(padlist);
2629 push_return(PL_op->op_next);
2630 PUSHBLOCK(cx, CXt_SUB, MARK);
2633 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2634 * that eval'' ops within this sub know the correct lexical space.
2635 * Owing the speed considerations, we choose to search for the cv
2636 * in doeval() instead.
2638 if (CvDEPTH(cv) < 2)
2639 (void)SvREFCNT_inc(cv);
2640 else { /* save temporaries on recursion? */
2641 PERL_STACK_OVERFLOW_CHECK();
2642 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2644 AV *newpad = newAV();
2645 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2646 I32 ix = AvFILLp((AV*)svp[1]);
2647 I32 names_fill = AvFILLp((AV*)svp[0]);
2648 svp = AvARRAY(svp[0]);
2649 for ( ;ix > 0; ix--) {
2650 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2651 char *name = SvPVX(svp[ix]);
2652 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2653 || *name == '&') /* anonymous code? */
2655 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2657 else { /* our own lexical */
2659 av_store(newpad, ix, sv = (SV*)newAV());
2660 else if (*name == '%')
2661 av_store(newpad, ix, sv = (SV*)newHV());
2663 av_store(newpad, ix, sv = NEWSV(0,0));
2667 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2668 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2671 av_store(newpad, ix, sv = NEWSV(0,0));
2675 av = newAV(); /* will be @_ */
2677 av_store(newpad, 0, (SV*)av);
2678 AvFLAGS(av) = AVf_REIFY;
2679 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2680 AvFILLp(padlist) = CvDEPTH(cv);
2681 svp = AvARRAY(padlist);
2686 AV* av = (AV*)PL_curpad[0];
2688 items = AvFILLp(av) + 1;
2690 /* Mark is at the end of the stack. */
2692 Copy(AvARRAY(av), SP + 1, items, SV*);
2697 #endif /* USE_THREADS */
2698 SAVEVPTR(PL_curpad);
2699 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2702 #endif /* USE_THREADS */
2708 DEBUG_S(PerlIO_printf(Perl_debug_log,
2709 "%p entersub preparing @_\n", thr));
2711 av = (AV*)PL_curpad[0];
2713 /* @_ is normally not REAL--this should only ever
2714 * happen when DB::sub() calls things that modify @_ */
2720 cx->blk_sub.savearray = GvAV(PL_defgv);
2721 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2722 #endif /* USE_THREADS */
2723 cx->blk_sub.oldcurpad = PL_curpad;
2724 cx->blk_sub.argarray = av;
2727 if (items > AvMAX(av) + 1) {
2729 if (AvARRAY(av) != ary) {
2730 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2731 SvPVX(av) = (char*)ary;
2733 if (items > AvMAX(av) + 1) {
2734 AvMAX(av) = items - 1;
2735 Renew(ary,items,SV*);
2737 SvPVX(av) = (char*)ary;
2740 Copy(MARK,AvARRAY(av),items,SV*);
2741 AvFILLp(av) = items - 1;
2749 /* warning must come *after* we fully set up the context
2750 * stuff so that __WARN__ handlers can safely dounwind()
2753 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2754 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2755 sub_crush_depth(cv);
2757 DEBUG_S(PerlIO_printf(Perl_debug_log,
2758 "%p entersub returning %p\n", thr, CvSTART(cv)));
2760 RETURNOP(CvSTART(cv));
2765 Perl_sub_crush_depth(pTHX_ CV *cv)
2768 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2770 SV* tmpstr = sv_newmortal();
2771 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2772 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2783 U32 lval = PL_op->op_flags & OPf_MOD;
2784 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2788 elem -= PL_curcop->cop_arybase;
2789 if (SvTYPE(av) != SVt_PVAV)
2791 svp = av_fetch(av, elem, lval && !defer);
2793 if (!svp || *svp == &PL_sv_undef) {
2796 DIE(aTHX_ PL_no_aelem, elem);
2797 lv = sv_newmortal();
2798 sv_upgrade(lv, SVt_PVLV);
2800 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2801 LvTARG(lv) = SvREFCNT_inc(av);
2802 LvTARGOFF(lv) = elem;
2807 if (PL_op->op_private & OPpLVAL_INTRO)
2808 save_aelem(av, elem, svp);
2809 else if (PL_op->op_private & OPpDEREF)
2810 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2812 sv = (svp ? *svp : &PL_sv_undef);
2813 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2814 sv = sv_mortalcopy(sv);
2820 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2826 Perl_croak(aTHX_ PL_no_modify);
2827 if (SvTYPE(sv) < SVt_RV)
2828 sv_upgrade(sv, SVt_RV);
2829 else if (SvTYPE(sv) >= SVt_PV) {
2830 (void)SvOOK_off(sv);
2831 Safefree(SvPVX(sv));
2832 SvLEN(sv) = SvCUR(sv) = 0;
2836 SvRV(sv) = NEWSV(355,0);
2839 SvRV(sv) = (SV*)newAV();
2842 SvRV(sv) = (SV*)newHV();
2857 if (SvTYPE(rsv) == SVt_PVCV) {
2863 SETs(method_common(sv, Null(U32*)));
2870 SV* sv = cSVOP->op_sv;
2871 U32 hash = SvUVX(sv);
2873 XPUSHs(method_common(sv, &hash));
2878 S_method_common(pTHX_ SV* meth, U32* hashp)
2889 name = SvPV(meth, namelen);
2890 sv = *(PL_stack_base + TOPMARK + 1);
2893 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2904 !(packname = SvPV(sv, packlen)) ||
2905 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2906 !(ob=(SV*)GvIO(iogv)))
2909 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2910 ? !isIDFIRST_utf8((U8*)packname)
2911 : !isIDFIRST(*packname)
2914 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2915 SvOK(sv) ? "without a package or object reference"
2916 : "on an undefined value");
2918 stash = gv_stashpvn(packname, packlen, TRUE);
2921 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2924 if (!ob || !(SvOBJECT(ob)
2925 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2928 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2932 stash = SvSTASH(ob);
2935 /* shortcut for simple names */
2937 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2939 gv = (GV*)HeVAL(he);
2940 if (isGV(gv) && GvCV(gv) &&
2941 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2942 return (SV*)GvCV(gv);
2946 gv = gv_fetchmethod(stash, name);
2953 for (p = name; *p; p++) {
2955 sep = p, leaf = p + 1;
2956 else if (*p == ':' && *(p + 1) == ':')
2957 sep = p, leaf = p + 2;
2959 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2960 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2961 packlen = strlen(packname);
2965 packlen = sep - name;
2967 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2968 if (gv && isGV(gv)) {
2970 "Can't locate object method \"%s\" via package \"%s\"",
2975 "Can't locate object method \"%s\" via package \"%s\""
2976 " (perhaps you forgot to load \"%s\"?)",
2977 leaf, packname, packname);
2980 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2985 unset_cvowner(pTHXo_ void *cvarg)
2987 register CV* cv = (CV *) cvarg;
2990 #endif /* DEBUGGING */
2992 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2993 thr, cv, SvPEEK((SV*)cv))));
2994 MUTEX_LOCK(CvMUTEXP(cv));
2995 DEBUG_S(if (CvDEPTH(cv) != 0)
2996 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2998 assert(thr == CvOWNER(cv));
3000 MUTEX_UNLOCK(CvMUTEXP(cv));
3003 #endif /* USE_THREADS */