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 */
173 s = (U8*)savepvn((char*)s, len);
175 if (!SvOK(left) && SvTYPE(left) <= SVt_PVMG)
176 sv_setpv(left, ""); /* Suppress warning. */
177 l = (U8*)SvPV(left, targlen);
179 sv_setpvn(TARG, (char*)l, targlen);
181 sv_utf8_upgrade(TARG);
182 /* Extend TARG to length of right (s) */
183 targlen = SvCUR(TARG) + len;
185 /* plus one for each hi-byte char if we have to upgrade */
186 for (c = s; c < s + len; c++) {
191 SvGROW(TARG, targlen+1);
192 /* And now copy, maybe upgrading right to UTF8 on the fly */
193 for (c = (U8*)SvEND(TARG); len--; s++) {
194 if (*s & 0x80 && !right_utf)
195 c = uv_to_utf8(c, *s);
199 SvCUR_set(TARG, targlen);
209 s = (U8*)SvPV(left,len);
211 sv_insert(TARG, 0, 0, (char*)s, len);
215 sv_setpvn(TARG, (char *)s, len);
217 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG)
218 sv_setpv(TARG, ""); /* Suppress warning. */
219 s = (U8*)SvPV(right,len);
221 #if defined(PERL_Y2KWARN)
222 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
224 char *s = SvPV(TARG,n);
225 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
226 && (n == 2 || !isDIGIT(s[n-3])))
228 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
229 "about to append an integer to '19'");
233 sv_catpvn(TARG, (char *)s, len);
236 sv_setpvn(TARG, (char *)s, len); /* suppress warning */
248 if (PL_op->op_flags & OPf_MOD) {
249 if (PL_op->op_private & OPpLVAL_INTRO)
250 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
251 else if (PL_op->op_private & OPpDEREF) {
253 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
262 tryAMAGICunTARGET(iter, 0);
263 PL_last_in_gv = (GV*)(*PL_stack_sp--);
264 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
265 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
266 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
269 XPUSHs((SV*)PL_last_in_gv);
272 PL_last_in_gv = (GV*)(*PL_stack_sp--);
275 return do_readline();
280 djSP; tryAMAGICbinSET(eq,0);
283 SETs(boolSV(TOPn == value));
291 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
292 DIE(aTHX_ PL_no_modify);
293 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
294 SvIVX(TOPs) != IV_MAX)
297 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
312 RETURNOP(cLOGOP->op_other);
318 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
321 SETn( left + right );
329 AV *av = GvAV(cGVOP_gv);
330 U32 lval = PL_op->op_flags & OPf_MOD;
331 SV** svp = av_fetch(av, PL_op->op_private, lval);
332 SV *sv = (svp ? *svp : &PL_sv_undef);
334 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
335 sv = sv_mortalcopy(sv);
342 djSP; dMARK; dTARGET;
344 do_join(TARG, *MARK, MARK, SP);
355 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
356 * will be enough to hold an OP*.
358 SV* sv = sv_newmortal();
359 sv_upgrade(sv, SVt_PVLV);
361 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
369 /* Oversized hot code. */
373 djSP; dMARK; dORIGMARK;
380 if (PL_op->op_flags & OPf_STACKED)
384 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
386 if (MARK == ORIGMARK) {
387 /* If using default handle then we need to make space to
388 * pass object as 1st arg, so move other args up ...
392 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
396 *MARK = SvTIED_obj((SV*)gv, mg);
399 call_method("PRINT", G_SCALAR);
407 if (!(io = GvIO(gv))) {
409 if ((GvEGV(gv)) && (mg = SvTIED_mg((SV*)GvEGV(gv),'q')))
411 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
412 report_evil_fh(gv, io, PL_op->op_type);
413 SETERRNO(EBADF,RMS$_IFI);
416 else if (!(fp = IoOFP(io))) {
417 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
419 /* integrate with report_evil_fh()? */
422 SV* sv = sv_newmortal();
423 gv_efullname4(sv, gv, Nullch, FALSE);
424 name = SvPV_nolen(sv);
427 Perl_warner(aTHX_ WARN_IO,
428 "Filehandle %s opened only for input", name);
430 Perl_warner(aTHX_ WARN_IO,
431 "Filehandle opened only for input");
433 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
434 report_evil_fh(gv, io, PL_op->op_type);
436 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
443 if (!do_print(*MARK, fp))
447 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
456 if (!do_print(*MARK, fp))
465 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
468 if (IoFLAGS(io) & IOf_FLUSH)
469 if (PerlIO_flush(fp) == EOF)
490 tryAMAGICunDEREF(to_av);
493 if (SvTYPE(av) != SVt_PVAV)
494 DIE(aTHX_ "Not an ARRAY reference");
495 if (PL_op->op_flags & OPf_REF) {
501 if (SvTYPE(sv) == SVt_PVAV) {
503 if (PL_op->op_flags & OPf_REF) {
511 if (SvTYPE(sv) != SVt_PVGV) {
515 if (SvGMAGICAL(sv)) {
521 if (PL_op->op_flags & OPf_REF ||
522 PL_op->op_private & HINT_STRICT_REFS)
523 DIE(aTHX_ PL_no_usym, "an ARRAY");
524 if (ckWARN(WARN_UNINITIALIZED))
526 if (GIMME == G_ARRAY) {
533 if ((PL_op->op_flags & OPf_SPECIAL) &&
534 !(PL_op->op_flags & OPf_MOD))
536 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
538 && (!is_gv_magical(sym,len,0)
539 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
545 if (PL_op->op_private & HINT_STRICT_REFS)
546 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
547 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
554 if (PL_op->op_private & OPpLVAL_INTRO)
556 if (PL_op->op_flags & OPf_REF) {
563 if (GIMME == G_ARRAY) {
564 I32 maxarg = AvFILL(av) + 1;
565 (void)POPs; /* XXXX May be optimized away? */
567 if (SvRMAGICAL(av)) {
569 for (i=0; i < maxarg; i++) {
570 SV **svp = av_fetch(av, i, FALSE);
571 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
575 Copy(AvARRAY(av), SP+1, maxarg, SV*);
581 I32 maxarg = AvFILL(av) + 1;
594 tryAMAGICunDEREF(to_hv);
597 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
598 DIE(aTHX_ "Not a HASH reference");
599 if (PL_op->op_flags & OPf_REF) {
605 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
607 if (PL_op->op_flags & OPf_REF) {
615 if (SvTYPE(sv) != SVt_PVGV) {
619 if (SvGMAGICAL(sv)) {
625 if (PL_op->op_flags & OPf_REF ||
626 PL_op->op_private & HINT_STRICT_REFS)
627 DIE(aTHX_ PL_no_usym, "a HASH");
628 if (ckWARN(WARN_UNINITIALIZED))
630 if (GIMME == G_ARRAY) {
637 if ((PL_op->op_flags & OPf_SPECIAL) &&
638 !(PL_op->op_flags & OPf_MOD))
640 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
642 && (!is_gv_magical(sym,len,0)
643 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
649 if (PL_op->op_private & HINT_STRICT_REFS)
650 DIE(aTHX_ PL_no_symref, sym, "a HASH");
651 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
658 if (PL_op->op_private & OPpLVAL_INTRO)
660 if (PL_op->op_flags & OPf_REF) {
667 if (GIMME == G_ARRAY) { /* array wanted */
668 *PL_stack_sp = (SV*)hv;
673 if (SvTYPE(hv) == SVt_PVAV)
674 hv = avhv_keys((AV*)hv);
676 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
677 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
687 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
693 leftop = ((BINOP*)PL_op)->op_last;
695 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
696 leftop = ((LISTOP*)leftop)->op_first;
698 /* Skip PUSHMARK and each element already assigned to. */
699 for (i = lelem - firstlelem; i > 0; i--) {
700 leftop = leftop->op_sibling;
703 if (leftop->op_type != OP_RV2HV)
708 av_fill(ary, 0); /* clear all but the fields hash */
709 if (lastrelem >= relem) {
710 while (relem < lastrelem) { /* gobble up all the rest */
714 /* Avoid a memory leak when avhv_store_ent dies. */
715 tmpstr = sv_newmortal();
716 sv_setsv(tmpstr,relem[1]); /* value */
718 if (avhv_store_ent(ary,relem[0],tmpstr,0))
719 (void)SvREFCNT_inc(tmpstr);
720 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
726 if (relem == lastrelem)
732 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
736 if (ckWARN(WARN_MISC)) {
737 if (relem == firstrelem &&
739 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
740 SvTYPE(SvRV(*relem)) == SVt_PVHV))
742 Perl_warner(aTHX_ WARN_MISC,
743 "Reference found where even-sized list expected");
746 Perl_warner(aTHX_ WARN_MISC,
747 "Odd number of elements in hash assignment");
749 if (SvTYPE(hash) == SVt_PVAV) {
751 tmpstr = sv_newmortal();
752 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
753 (void)SvREFCNT_inc(tmpstr);
754 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
759 tmpstr = NEWSV(29,0);
760 didstore = hv_store_ent(hash,*relem,tmpstr,0);
761 if (SvMAGICAL(hash)) {
762 if (SvSMAGICAL(tmpstr))
775 SV **lastlelem = PL_stack_sp;
776 SV **lastrelem = PL_stack_base + POPMARK;
777 SV **firstrelem = PL_stack_base + POPMARK + 1;
778 SV **firstlelem = lastrelem + 1;
791 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
793 /* If there's a common identifier on both sides we have to take
794 * special care that assigning the identifier on the left doesn't
795 * clobber a value on the right that's used later in the list.
797 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
798 EXTEND_MORTAL(lastrelem - firstrelem + 1);
799 for (relem = firstrelem; relem <= lastrelem; relem++) {
802 TAINT_NOT; /* Each item is independent */
803 *relem = sv_mortalcopy(sv);
813 while (lelem <= lastlelem) {
814 TAINT_NOT; /* Each item stands on its own, taintwise. */
816 switch (SvTYPE(sv)) {
819 magic = SvMAGICAL(ary) != 0;
820 if (PL_op->op_private & OPpASSIGN_HASH) {
821 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
827 do_oddball((HV*)ary, relem, firstrelem);
829 relem = lastrelem + 1;
834 av_extend(ary, lastrelem - relem);
836 while (relem <= lastrelem) { /* gobble up all the rest */
842 didstore = av_store(ary,i++,sv);
852 case SVt_PVHV: { /* normal hash */
856 magic = SvMAGICAL(hash) != 0;
859 while (relem < lastrelem) { /* gobble up all the rest */
864 sv = &PL_sv_no, relem++;
865 tmpstr = NEWSV(29,0);
867 sv_setsv(tmpstr,*relem); /* value */
869 didstore = hv_store_ent(hash,sv,tmpstr,0);
871 if (SvSMAGICAL(tmpstr))
878 if (relem == lastrelem) {
879 do_oddball(hash, relem, firstrelem);
885 if (SvIMMORTAL(sv)) {
886 if (relem <= lastrelem)
890 if (relem <= lastrelem) {
891 sv_setsv(sv, *relem);
895 sv_setsv(sv, &PL_sv_undef);
900 if (PL_delaymagic & ~DM_DELAY) {
901 if (PL_delaymagic & DM_UID) {
903 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
906 (void)setreuid(PL_uid,PL_euid);
909 if ((PL_delaymagic & DM_UID) == DM_RUID) {
910 (void)setruid(PL_uid);
911 PL_delaymagic &= ~DM_RUID;
913 # endif /* HAS_SETRUID */
915 if ((PL_delaymagic & DM_UID) == DM_EUID) {
916 (void)seteuid(PL_uid);
917 PL_delaymagic &= ~DM_EUID;
919 # endif /* HAS_SETEUID */
920 if (PL_delaymagic & DM_UID) {
921 if (PL_uid != PL_euid)
922 DIE(aTHX_ "No setreuid available");
923 (void)PerlProc_setuid(PL_uid);
925 # endif /* HAS_SETREUID */
926 #endif /* HAS_SETRESUID */
927 PL_uid = PerlProc_getuid();
928 PL_euid = PerlProc_geteuid();
930 if (PL_delaymagic & DM_GID) {
932 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
935 (void)setregid(PL_gid,PL_egid);
938 if ((PL_delaymagic & DM_GID) == DM_RGID) {
939 (void)setrgid(PL_gid);
940 PL_delaymagic &= ~DM_RGID;
942 # endif /* HAS_SETRGID */
944 if ((PL_delaymagic & DM_GID) == DM_EGID) {
945 (void)setegid(PL_gid);
946 PL_delaymagic &= ~DM_EGID;
948 # endif /* HAS_SETEGID */
949 if (PL_delaymagic & DM_GID) {
950 if (PL_gid != PL_egid)
951 DIE(aTHX_ "No setregid available");
952 (void)PerlProc_setgid(PL_gid);
954 # endif /* HAS_SETREGID */
955 #endif /* HAS_SETRESGID */
956 PL_gid = PerlProc_getgid();
957 PL_egid = PerlProc_getegid();
959 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
966 else if (gimme == G_SCALAR) {
969 SETi(lastrelem - firstrelem + 1);
975 SP = firstrelem + (lastlelem - firstlelem);
976 lelem = firstlelem + (relem - firstrelem);
978 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
986 register PMOP *pm = cPMOP;
987 SV *rv = sv_newmortal();
988 SV *sv = newSVrv(rv, "Regexp");
989 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
996 register PMOP *pm = cPMOP;
1001 I32 r_flags = REXEC_CHECKED;
1002 char *truebase; /* Start of string */
1003 register REGEXP *rx = pm->op_pmregexp;
1008 I32 oldsave = PL_savestack_ix;
1009 I32 update_minmatch = 1;
1010 I32 had_zerolen = 0;
1012 if (PL_op->op_flags & OPf_STACKED)
1018 PUTBACK; /* EVAL blocks need stack_sp. */
1019 s = SvPV(TARG, len);
1022 DIE(aTHX_ "panic: do_match");
1023 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1024 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1027 if (pm->op_pmdynflags & PMdf_USED) {
1029 if (gimme == G_ARRAY)
1034 if (!rx->prelen && PL_curpm) {
1036 rx = pm->op_pmregexp;
1038 if (rx->minlen > len) goto failure;
1042 /* XXXX What part of this is needed with true \G-support? */
1043 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1045 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1046 MAGIC* mg = mg_find(TARG, 'g');
1047 if (mg && mg->mg_len >= 0) {
1048 if (!(rx->reganch & ROPT_GPOS_SEEN))
1049 rx->endp[0] = rx->startp[0] = mg->mg_len;
1050 else if (rx->reganch & ROPT_ANCH_GPOS) {
1051 r_flags |= REXEC_IGNOREPOS;
1052 rx->endp[0] = rx->startp[0] = mg->mg_len;
1054 minmatch = (mg->mg_flags & MGf_MINMATCH);
1055 update_minmatch = 0;
1059 if ((gimme != G_ARRAY && !global && rx->nparens)
1060 || SvTEMP(TARG) || PL_sawampersand)
1061 r_flags |= REXEC_COPY_STR;
1063 r_flags |= REXEC_SCREAM;
1065 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1066 SAVEINT(PL_multiline);
1067 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1071 if (global && rx->startp[0] != -1) {
1072 t = s = rx->endp[0] + truebase;
1073 if ((s + rx->minlen) > strend)
1075 if (update_minmatch++)
1076 minmatch = had_zerolen;
1078 if (rx->reganch & RE_USE_INTUIT) {
1079 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1083 if ( (rx->reganch & ROPT_CHECK_ALL)
1085 && ((rx->reganch & ROPT_NOSCAN)
1086 || !((rx->reganch & RE_INTUIT_TAIL)
1087 && (r_flags & REXEC_SCREAM)))
1088 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1091 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1094 if (pm->op_pmflags & PMf_ONCE)
1095 pm->op_pmdynflags |= PMdf_USED;
1104 RX_MATCH_TAINTED_on(rx);
1105 TAINT_IF(RX_MATCH_TAINTED(rx));
1106 if (gimme == G_ARRAY) {
1109 iters = rx->nparens;
1110 if (global && !iters)
1114 SPAGAIN; /* EVAL blocks could move the stack. */
1115 EXTEND(SP, iters + i);
1116 EXTEND_MORTAL(iters + i);
1117 for (i = !i; i <= iters; i++) {
1118 PUSHs(sv_newmortal());
1120 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1121 len = rx->endp[i] - rx->startp[i];
1122 s = rx->startp[i] + truebase;
1123 sv_setpvn(*SP, s, len);
1124 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1126 sv_utf8_downgrade(*SP, TRUE);
1131 had_zerolen = (rx->startp[0] != -1
1132 && rx->startp[0] == rx->endp[0]);
1133 PUTBACK; /* EVAL blocks may use stack */
1134 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1139 LEAVE_SCOPE(oldsave);
1145 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1146 mg = mg_find(TARG, 'g');
1148 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1149 mg = mg_find(TARG, 'g');
1151 if (rx->startp[0] != -1) {
1152 mg->mg_len = rx->endp[0];
1153 if (rx->startp[0] == rx->endp[0])
1154 mg->mg_flags |= MGf_MINMATCH;
1156 mg->mg_flags &= ~MGf_MINMATCH;
1159 LEAVE_SCOPE(oldsave);
1163 yup: /* Confirmed by INTUIT */
1165 RX_MATCH_TAINTED_on(rx);
1166 TAINT_IF(RX_MATCH_TAINTED(rx));
1168 if (pm->op_pmflags & PMf_ONCE)
1169 pm->op_pmdynflags |= PMdf_USED;
1170 if (RX_MATCH_COPIED(rx))
1171 Safefree(rx->subbeg);
1172 RX_MATCH_COPIED_off(rx);
1173 rx->subbeg = Nullch;
1175 rx->subbeg = truebase;
1176 rx->startp[0] = s - truebase;
1177 rx->endp[0] = s - truebase + rx->minlen;
1178 rx->sublen = strend - truebase;
1181 if (PL_sawampersand) {
1184 rx->subbeg = savepvn(t, strend - t);
1185 rx->sublen = strend - t;
1186 RX_MATCH_COPIED_on(rx);
1187 off = rx->startp[0] = s - t;
1188 rx->endp[0] = off + rx->minlen;
1190 else { /* startp/endp are used by @- @+. */
1191 rx->startp[0] = s - truebase;
1192 rx->endp[0] = s - truebase + rx->minlen;
1194 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1195 LEAVE_SCOPE(oldsave);
1200 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1201 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1202 MAGIC* mg = mg_find(TARG, 'g');
1207 LEAVE_SCOPE(oldsave);
1208 if (gimme == G_ARRAY)
1214 Perl_do_readline(pTHX)
1216 dSP; dTARGETSTACKED;
1221 register IO *io = GvIO(PL_last_in_gv);
1222 register I32 type = PL_op->op_type;
1223 I32 gimme = GIMME_V;
1226 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1228 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1231 call_method("READLINE", gimme);
1234 if (gimme == G_SCALAR)
1235 SvSetMagicSV_nosteal(TARG, TOPs);
1242 if (IoFLAGS(io) & IOf_ARGV) {
1243 if (IoFLAGS(io) & IOf_START) {
1245 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1246 IoFLAGS(io) &= ~IOf_START;
1247 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1248 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1249 SvSETMAGIC(GvSV(PL_last_in_gv));
1254 fp = nextargv(PL_last_in_gv);
1255 if (!fp) { /* Note: fp != IoIFP(io) */
1256 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1259 else if (type == OP_GLOB) {
1260 SV *tmpcmd = NEWSV(55, 0);
1264 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1265 /* since spawning off a process is a real performance hit */
1267 #include <descrip.h>
1268 #include <lib$routines.h>
1271 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1272 char vmsspec[NAM$C_MAXRSS+1];
1273 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1274 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1275 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1278 struct dsc$descriptor_s wilddsc
1279 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1280 struct dsc$descriptor_vs rsdsc
1281 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1282 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1284 /* We could find out if there's an explicit dev/dir or version
1285 by peeking into lib$find_file's internal context at
1286 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1287 but that's unsupported, so I don't want to do it now and
1288 have it bite someone in the future. */
1289 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1290 cp = SvPV(tmpglob,i);
1292 if (cp[i] == ';') hasver = 1;
1294 if (sts) hasver = 1;
1298 hasdir = isunix = 1;
1301 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1306 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1308 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1309 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1310 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1311 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1312 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1313 &dfltdsc,NULL,NULL,NULL))&1)) {
1314 end = rstr + (unsigned long int) *rslt;
1315 if (!hasver) while (*end != ';') end--;
1316 *(end++) = '\n'; *end = '\0';
1317 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1319 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1324 while (*(--begin) != ']' && *begin != '>') ;
1327 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1329 if (cxt) (void)lib$find_file_end(&cxt);
1330 if (ok && sts != RMS$_NMF &&
1331 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1334 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1336 PerlIO_close(tmpfp);
1340 PerlIO_rewind(tmpfp);
1342 IoIFP(io) = fp = tmpfp;
1343 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1348 #ifdef MACOS_TRADITIONAL
1349 sv_setpv(tmpcmd, "glob ");
1350 sv_catsv(tmpcmd, tmpglob);
1351 sv_catpv(tmpcmd, " |");
1355 sv_setpv(tmpcmd, "for a in ");
1356 sv_catsv(tmpcmd, tmpglob);
1357 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1360 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1361 sv_catsv(tmpcmd, tmpglob);
1363 sv_setpv(tmpcmd, "perlglob ");
1364 sv_catsv(tmpcmd, tmpglob);
1365 sv_catpv(tmpcmd, " |");
1370 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1371 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1372 sv_catsv(tmpcmd, tmpglob);
1373 sv_catpv(tmpcmd, "' 2>/dev/null |");
1375 sv_setpv(tmpcmd, "echo ");
1376 sv_catsv(tmpcmd, tmpglob);
1378 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1380 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1383 #endif /* !DOSISH */
1384 #endif /* MACOS_TRADITIONAL */
1385 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1386 FALSE, O_RDONLY, 0, Nullfp);
1392 else if (type == OP_GLOB)
1394 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1395 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1396 || fp == PerlIO_stderr()))
1398 /* integrate with report_evil_fh()? */
1400 if (isGV(PL_last_in_gv)) { /* can this ever fail? */
1401 SV* sv = sv_newmortal();
1402 gv_efullname4(sv, PL_last_in_gv, Nullch, FALSE);
1403 name = SvPV_nolen(sv);
1406 Perl_warner(aTHX_ WARN_IO,
1407 "Filehandle %s opened only for output", name);
1409 Perl_warner(aTHX_ WARN_IO,
1410 "Filehandle opened only for output");
1414 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1415 if (type == OP_GLOB)
1416 Perl_warner(aTHX_ WARN_GLOB,
1417 "glob failed (can't start child: %s)",
1420 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1422 if (gimme == G_SCALAR) {
1423 (void)SvOK_off(TARG);
1429 if (gimme == G_SCALAR) {
1433 (void)SvUPGRADE(sv, SVt_PV);
1434 tmplen = SvLEN(sv); /* remember if already alloced */
1436 Sv_Grow(sv, 80); /* try short-buffering it */
1437 if (type == OP_RCATLINE)
1443 sv = sv_2mortal(NEWSV(57, 80));
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);
1477 /* This should not be marked tainted if the fp is marked clean */
1478 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1483 IoFLAGS(io) |= IOf_NOLINE;
1486 if (type == OP_GLOB) {
1489 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1490 tmps = SvEND(sv) - 1;
1491 if (*tmps == *SvPVX(PL_rs)) {
1496 for (tmps = SvPVX(sv); *tmps; tmps++)
1497 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1498 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1500 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1501 (void)POPs; /* Unmatched wildcard? Chuck it... */
1505 if (gimme == G_ARRAY) {
1506 if (SvLEN(sv) - SvCUR(sv) > 20) {
1507 SvLEN_set(sv, SvCUR(sv)+1);
1508 Renew(SvPVX(sv), SvLEN(sv), char);
1510 sv = sv_2mortal(NEWSV(58, 80));
1513 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1514 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1518 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1519 Renew(SvPVX(sv), SvLEN(sv), char);
1528 register PERL_CONTEXT *cx;
1529 I32 gimme = OP_GIMME(PL_op, -1);
1532 if (cxstack_ix >= 0)
1533 gimme = cxstack[cxstack_ix].blk_gimme;
1541 PUSHBLOCK(cx, CXt_BLOCK, SP);
1553 U32 lval = PL_op->op_flags & OPf_MOD;
1554 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1556 U32 hash = (SvFAKE(keysv) && SvREADONLY(keysv)) ? SvUVX(keysv) : 0;
1558 if (SvTYPE(hv) == SVt_PVHV) {
1559 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1560 svp = he ? &HeVAL(he) : 0;
1562 else if (SvTYPE(hv) == SVt_PVAV) {
1563 if (PL_op->op_private & OPpLVAL_INTRO)
1564 DIE(aTHX_ "Can't localize pseudo-hash element");
1565 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, hash);
1571 if (!svp || *svp == &PL_sv_undef) {
1576 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1578 lv = sv_newmortal();
1579 sv_upgrade(lv, SVt_PVLV);
1581 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1582 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1583 LvTARG(lv) = SvREFCNT_inc(hv);
1588 if (PL_op->op_private & OPpLVAL_INTRO) {
1589 if (HvNAME(hv) && isGV(*svp))
1590 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1592 save_helem(hv, keysv, svp);
1594 else if (PL_op->op_private & OPpDEREF)
1595 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1597 sv = (svp ? *svp : &PL_sv_undef);
1598 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1599 * Pushing the magical RHS on to the stack is useless, since
1600 * that magic is soon destined to be misled by the local(),
1601 * and thus the later pp_sassign() will fail to mg_get() the
1602 * old value. This should also cure problems with delayed
1603 * mg_get()s. GSAR 98-07-03 */
1604 if (!lval && SvGMAGICAL(sv))
1605 sv = sv_mortalcopy(sv);
1613 register PERL_CONTEXT *cx;
1619 if (PL_op->op_flags & OPf_SPECIAL) {
1620 cx = &cxstack[cxstack_ix];
1621 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1626 gimme = OP_GIMME(PL_op, -1);
1628 if (cxstack_ix >= 0)
1629 gimme = cxstack[cxstack_ix].blk_gimme;
1635 if (gimme == G_VOID)
1637 else if (gimme == G_SCALAR) {
1640 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1643 *MARK = sv_mortalcopy(TOPs);
1646 *MARK = &PL_sv_undef;
1650 else if (gimme == G_ARRAY) {
1651 /* in case LEAVE wipes old return values */
1652 for (mark = newsp + 1; mark <= SP; mark++) {
1653 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1654 *mark = sv_mortalcopy(*mark);
1655 TAINT_NOT; /* Each item is independent */
1659 PL_curpm = newpm; /* Don't pop $1 et al till now */
1669 register PERL_CONTEXT *cx;
1675 cx = &cxstack[cxstack_ix];
1676 if (CxTYPE(cx) != CXt_LOOP)
1677 DIE(aTHX_ "panic: pp_iter");
1679 itersvp = CxITERVAR(cx);
1680 av = cx->blk_loop.iterary;
1681 if (SvTYPE(av) != SVt_PVAV) {
1682 /* iterate ($min .. $max) */
1683 if (cx->blk_loop.iterlval) {
1684 /* string increment */
1685 register SV* cur = cx->blk_loop.iterlval;
1687 char *max = SvPV((SV*)av, maxlen);
1688 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1689 #ifndef USE_THREADS /* don't risk potential race */
1690 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1691 /* safe to reuse old SV */
1692 sv_setsv(*itersvp, cur);
1697 /* we need a fresh SV every time so that loop body sees a
1698 * completely new SV for closures/references to work as
1700 SvREFCNT_dec(*itersvp);
1701 *itersvp = newSVsv(cur);
1703 if (strEQ(SvPVX(cur), max))
1704 sv_setiv(cur, 0); /* terminate next time */
1711 /* integer increment */
1712 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1715 #ifndef USE_THREADS /* don't risk potential race */
1716 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1717 /* safe to reuse old SV */
1718 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1723 /* we need a fresh SV every time so that loop body sees a
1724 * completely new SV for closures/references to work as they
1726 SvREFCNT_dec(*itersvp);
1727 *itersvp = newSViv(cx->blk_loop.iterix++);
1733 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1736 SvREFCNT_dec(*itersvp);
1738 if ((sv = SvMAGICAL(av)
1739 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1740 : AvARRAY(av)[++cx->blk_loop.iterix]))
1744 if (av != PL_curstack && SvIMMORTAL(sv)) {
1745 SV *lv = cx->blk_loop.iterlval;
1746 if (lv && SvREFCNT(lv) > 1) {
1751 SvREFCNT_dec(LvTARG(lv));
1753 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1754 sv_upgrade(lv, SVt_PVLV);
1756 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1758 LvTARG(lv) = SvREFCNT_inc(av);
1759 LvTARGOFF(lv) = cx->blk_loop.iterix;
1760 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1764 *itersvp = SvREFCNT_inc(sv);
1771 register PMOP *pm = cPMOP;
1787 register REGEXP *rx = pm->op_pmregexp;
1789 int force_on_match = 0;
1790 I32 oldsave = PL_savestack_ix;
1792 /* known replacement string? */
1793 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1794 if (PL_op->op_flags & OPf_STACKED)
1800 if (SvFAKE(TARG) && SvREADONLY(TARG))
1801 sv_force_normal(TARG);
1802 if (SvREADONLY(TARG)
1803 || (SvTYPE(TARG) > SVt_PVLV
1804 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1805 DIE(aTHX_ PL_no_modify);
1808 s = SvPV(TARG, len);
1809 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1811 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1812 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1819 DIE(aTHX_ "panic: do_subst");
1822 maxiters = 2*(strend - s) + 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 = dstr ? SvPV(dstr, clen) : Nullch;
1860 /* can do inplace substitution? */
1861 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1862 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1863 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1864 r_flags | REXEC_CHECKED))
1868 LEAVE_SCOPE(oldsave);
1871 if (force_on_match) {
1873 s = SvPV_force(TARG, len);
1878 SvSCREAM_off(TARG); /* disable possible screamer */
1880 rxtainted |= RX_MATCH_TAINTED(rx);
1881 m = orig + rx->startp[0];
1882 d = orig + rx->endp[0];
1884 if (m - s > strend - d) { /* faster to shorten from end */
1886 Copy(c, m, clen, char);
1891 Move(d, m, i, char);
1895 SvCUR_set(TARG, m - s);
1898 else if ((i = m - s)) { /* faster from front */
1906 Copy(c, m, clen, char);
1911 Copy(c, d, clen, char);
1916 TAINT_IF(rxtainted & 1);
1922 if (iters++ > maxiters)
1923 DIE(aTHX_ "Substitution loop");
1924 rxtainted |= RX_MATCH_TAINTED(rx);
1925 m = rx->startp[0] + orig;
1929 Move(s, d, i, char);
1933 Copy(c, d, clen, char);
1936 s = rx->endp[0] + orig;
1937 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1939 /* don't match same null twice */
1940 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1943 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1944 Move(s, d, i+1, char); /* include the NUL */
1946 TAINT_IF(rxtainted & 1);
1948 PUSHs(sv_2mortal(newSViv((I32)iters)));
1950 (void)SvPOK_only_UTF8(TARG);
1951 TAINT_IF(rxtainted);
1952 if (SvSMAGICAL(TARG)) {
1958 LEAVE_SCOPE(oldsave);
1962 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1963 r_flags | REXEC_CHECKED))
1965 if (force_on_match) {
1967 s = SvPV_force(TARG, len);
1970 rxtainted |= RX_MATCH_TAINTED(rx);
1971 dstr = NEWSV(25, len);
1972 sv_setpvn(dstr, m, s-m);
1975 register PERL_CONTEXT *cx;
1978 RETURNOP(cPMOP->op_pmreplroot);
1980 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1982 if (iters++ > maxiters)
1983 DIE(aTHX_ "Substitution loop");
1984 rxtainted |= RX_MATCH_TAINTED(rx);
1985 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1990 strend = s + (strend - m);
1992 m = rx->startp[0] + orig;
1993 sv_catpvn(dstr, s, m-s);
1994 s = rx->endp[0] + orig;
1996 sv_catpvn(dstr, c, clen);
1999 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
2000 sv_catpvn(dstr, s, strend - s);
2002 (void)SvOOK_off(TARG);
2003 Safefree(SvPVX(TARG));
2004 SvPVX(TARG) = SvPVX(dstr);
2005 SvCUR_set(TARG, SvCUR(dstr));
2006 SvLEN_set(TARG, SvLEN(dstr));
2010 TAINT_IF(rxtainted & 1);
2012 PUSHs(sv_2mortal(newSViv((I32)iters)));
2014 (void)SvPOK_only(TARG);
2015 TAINT_IF(rxtainted);
2018 LEAVE_SCOPE(oldsave);
2027 LEAVE_SCOPE(oldsave);
2036 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2037 ++*PL_markstack_ptr;
2038 LEAVE; /* exit inner scope */
2041 if (PL_stack_base + *PL_markstack_ptr > SP) {
2043 I32 gimme = GIMME_V;
2045 LEAVE; /* exit outer scope */
2046 (void)POPMARK; /* pop src */
2047 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2048 (void)POPMARK; /* pop dst */
2049 SP = PL_stack_base + POPMARK; /* pop original mark */
2050 if (gimme == G_SCALAR) {
2054 else if (gimme == G_ARRAY)
2061 ENTER; /* enter inner scope */
2064 src = PL_stack_base[*PL_markstack_ptr];
2068 RETURNOP(cLOGOP->op_other);
2079 register PERL_CONTEXT *cx;
2085 if (gimme == G_SCALAR) {
2088 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2090 *MARK = SvREFCNT_inc(TOPs);
2095 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2097 *MARK = sv_mortalcopy(sv);
2102 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2106 *MARK = &PL_sv_undef;
2110 else if (gimme == G_ARRAY) {
2111 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2112 if (!SvTEMP(*MARK)) {
2113 *MARK = sv_mortalcopy(*MARK);
2114 TAINT_NOT; /* Each item is independent */
2120 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2121 PL_curpm = newpm; /* ... and pop $1 et al */
2125 return pop_return();
2128 /* This duplicates the above code because the above code must not
2129 * get any slower by more conditions */
2137 register PERL_CONTEXT *cx;
2144 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2145 /* We are an argument to a function or grep().
2146 * This kind of lvalueness was legal before lvalue
2147 * subroutines too, so be backward compatible:
2148 * cannot report errors. */
2150 /* Scalar context *is* possible, on the LHS of -> only,
2151 * as in f()->meth(). But this is not an lvalue. */
2152 if (gimme == G_SCALAR)
2154 if (gimme == G_ARRAY) {
2155 if (!CvLVALUE(cx->blk_sub.cv))
2156 goto temporise_array;
2157 EXTEND_MORTAL(SP - newsp);
2158 for (mark = newsp + 1; mark <= SP; mark++) {
2161 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2162 *mark = sv_mortalcopy(*mark);
2164 /* Can be a localized value subject to deletion. */
2165 PL_tmps_stack[++PL_tmps_ix] = *mark;
2166 (void)SvREFCNT_inc(*mark);
2171 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2172 /* Here we go for robustness, not for speed, so we change all
2173 * the refcounts so the caller gets a live guy. Cannot set
2174 * TEMP, so sv_2mortal is out of question. */
2175 if (!CvLVALUE(cx->blk_sub.cv)) {
2180 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2182 if (gimme == G_SCALAR) {
2186 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2191 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2192 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2194 else { /* Can be a localized value
2195 * subject to deletion. */
2196 PL_tmps_stack[++PL_tmps_ix] = *mark;
2197 (void)SvREFCNT_inc(*mark);
2200 else { /* Should not happen? */
2205 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2206 (MARK > SP ? "Empty array" : "Array"));
2210 else if (gimme == G_ARRAY) {
2211 EXTEND_MORTAL(SP - newsp);
2212 for (mark = newsp + 1; mark <= SP; mark++) {
2213 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2214 /* Might be flattened array after $#array = */
2220 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2221 (*mark != &PL_sv_undef)
2223 ? "a readonly value" : "a temporary")
2224 : "an uninitialized value");
2227 /* Can be a localized value subject to deletion. */
2228 PL_tmps_stack[++PL_tmps_ix] = *mark;
2229 (void)SvREFCNT_inc(*mark);
2235 if (gimme == G_SCALAR) {
2239 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2241 *MARK = SvREFCNT_inc(TOPs);
2246 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2248 *MARK = sv_mortalcopy(sv);
2253 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2257 *MARK = &PL_sv_undef;
2261 else if (gimme == G_ARRAY) {
2263 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2264 if (!SvTEMP(*MARK)) {
2265 *MARK = sv_mortalcopy(*MARK);
2266 TAINT_NOT; /* Each item is independent */
2273 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2274 PL_curpm = newpm; /* ... and pop $1 et al */
2278 return pop_return();
2283 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2286 SV *dbsv = GvSV(PL_DBsub);
2288 if (!PERLDB_SUB_NN) {
2292 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2293 || strEQ(GvNAME(gv), "END")
2294 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2295 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2296 && (gv = (GV*)*svp) ))) {
2297 /* Use GV from the stack as a fallback. */
2298 /* GV is potentially non-unique, or contain different CV. */
2299 SV *tmp = newRV((SV*)cv);
2300 sv_setsv(dbsv, tmp);
2304 gv_efullname3(dbsv, gv, Nullch);
2308 (void)SvUPGRADE(dbsv, SVt_PVIV);
2309 (void)SvIOK_on(dbsv);
2310 SAVEIV(SvIVX(dbsv));
2311 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2315 PL_curcopdb = PL_curcop;
2316 cv = GvCV(PL_DBsub);
2326 register PERL_CONTEXT *cx;
2328 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2331 DIE(aTHX_ "Not a CODE reference");
2332 switch (SvTYPE(sv)) {
2338 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2340 SP = PL_stack_base + POPMARK;
2343 if (SvGMAGICAL(sv)) {
2345 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2348 sym = SvPV(sv, n_a);
2350 DIE(aTHX_ PL_no_usym, "a subroutine");
2351 if (PL_op->op_private & HINT_STRICT_REFS)
2352 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2353 cv = get_cv(sym, TRUE);
2357 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2358 tryAMAGICunDEREF(to_cv);
2361 if (SvTYPE(cv) == SVt_PVCV)
2366 DIE(aTHX_ "Not a CODE reference");
2371 if (!(cv = GvCVu((GV*)sv)))
2372 cv = sv_2cv(sv, &stash, &gv, FALSE);
2385 if (!CvROOT(cv) && !CvXSUB(cv)) {
2389 /* anonymous or undef'd function leaves us no recourse */
2390 if (CvANON(cv) || !(gv = CvGV(cv)))
2391 DIE(aTHX_ "Undefined subroutine called");
2393 /* autoloaded stub? */
2394 if (cv != GvCV(gv)) {
2397 /* should call AUTOLOAD now? */
2400 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2407 sub_name = sv_newmortal();
2408 gv_efullname3(sub_name, gv, Nullch);
2409 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2413 DIE(aTHX_ "Not a CODE reference");
2418 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2419 cv = get_db_sub(&sv, cv);
2421 DIE(aTHX_ "No DBsub routine");
2426 * First we need to check if the sub or method requires locking.
2427 * If so, we gain a lock on the CV, the first argument or the
2428 * stash (for static methods), as appropriate. This has to be
2429 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2430 * reschedule by returning a new op.
2432 MUTEX_LOCK(CvMUTEXP(cv));
2433 if (CvFLAGS(cv) & CVf_LOCKED) {
2435 if (CvFLAGS(cv) & CVf_METHOD) {
2436 if (SP > PL_stack_base + TOPMARK)
2437 sv = *(PL_stack_base + TOPMARK + 1);
2439 AV *av = (AV*)PL_curpad[0];
2440 if (hasargs || !av || AvFILLp(av) < 0
2441 || !(sv = AvARRAY(av)[0]))
2443 MUTEX_UNLOCK(CvMUTEXP(cv));
2444 DIE(aTHX_ "no argument for locked method call");
2451 char *stashname = SvPV(sv, len);
2452 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2458 MUTEX_UNLOCK(CvMUTEXP(cv));
2459 mg = condpair_magic(sv);
2460 MUTEX_LOCK(MgMUTEXP(mg));
2461 if (MgOWNER(mg) == thr)
2462 MUTEX_UNLOCK(MgMUTEXP(mg));
2465 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2467 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2469 MUTEX_UNLOCK(MgMUTEXP(mg));
2470 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2472 MUTEX_LOCK(CvMUTEXP(cv));
2475 * Now we have permission to enter the sub, we must distinguish
2476 * four cases. (0) It's an XSUB (in which case we don't care
2477 * about ownership); (1) it's ours already (and we're recursing);
2478 * (2) it's free (but we may already be using a cached clone);
2479 * (3) another thread owns it. Case (1) is easy: we just use it.
2480 * Case (2) means we look for a clone--if we have one, use it
2481 * otherwise grab ownership of cv. Case (3) means we look for a
2482 * clone (for non-XSUBs) and have to create one if we don't
2484 * Why look for a clone in case (2) when we could just grab
2485 * ownership of cv straight away? Well, we could be recursing,
2486 * i.e. we originally tried to enter cv while another thread
2487 * owned it (hence we used a clone) but it has been freed up
2488 * and we're now recursing into it. It may or may not be "better"
2489 * to use the clone but at least CvDEPTH can be trusted.
2491 if (CvOWNER(cv) == thr || CvXSUB(cv))
2492 MUTEX_UNLOCK(CvMUTEXP(cv));
2494 /* Case (2) or (3) */
2498 * XXX Might it be better to release CvMUTEXP(cv) while we
2499 * do the hv_fetch? We might find someone has pinched it
2500 * when we look again, in which case we would be in case
2501 * (3) instead of (2) so we'd have to clone. Would the fact
2502 * that we released the mutex more quickly make up for this?
2504 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2506 /* We already have a clone to use */
2507 MUTEX_UNLOCK(CvMUTEXP(cv));
2509 DEBUG_S(PerlIO_printf(Perl_debug_log,
2510 "entersub: %p already has clone %p:%s\n",
2511 thr, cv, SvPEEK((SV*)cv)));
2514 if (CvDEPTH(cv) == 0)
2515 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2518 /* (2) => grab ownership of cv. (3) => make clone */
2522 MUTEX_UNLOCK(CvMUTEXP(cv));
2523 DEBUG_S(PerlIO_printf(Perl_debug_log,
2524 "entersub: %p grabbing %p:%s in stash %s\n",
2525 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2526 HvNAME(CvSTASH(cv)) : "(none)"));
2529 /* Make a new clone. */
2531 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2532 MUTEX_UNLOCK(CvMUTEXP(cv));
2533 DEBUG_S((PerlIO_printf(Perl_debug_log,
2534 "entersub: %p cloning %p:%s\n",
2535 thr, cv, SvPEEK((SV*)cv))));
2537 * We're creating a new clone so there's no race
2538 * between the original MUTEX_UNLOCK and the
2539 * SvREFCNT_inc since no one will be trying to undef
2540 * it out from underneath us. At least, I don't think
2543 clonecv = cv_clone(cv);
2544 SvREFCNT_dec(cv); /* finished with this */
2545 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2546 CvOWNER(clonecv) = thr;
2550 DEBUG_S(if (CvDEPTH(cv) != 0)
2551 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2553 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2556 #endif /* USE_THREADS */
2559 #ifdef PERL_XSUB_OLDSTYLE
2560 if (CvOLDSTYLE(cv)) {
2561 I32 (*fp3)(int,int,int);
2563 register I32 items = SP - MARK;
2564 /* We dont worry to copy from @_. */
2569 PL_stack_sp = mark + 1;
2570 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2571 items = (*fp3)(CvXSUBANY(cv).any_i32,
2572 MARK - PL_stack_base + 1,
2574 PL_stack_sp = PL_stack_base + items;
2577 #endif /* PERL_XSUB_OLDSTYLE */
2579 I32 markix = TOPMARK;
2584 /* Need to copy @_ to stack. Alternative may be to
2585 * switch stack to @_, and copy return values
2586 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2590 av = (AV*)PL_curpad[0];
2592 av = GvAV(PL_defgv);
2593 #endif /* USE_THREADS */
2594 items = AvFILLp(av) + 1; /* @_ is not tieable */
2597 /* Mark is at the end of the stack. */
2599 Copy(AvARRAY(av), SP + 1, items, SV*);
2604 /* We assume first XSUB in &DB::sub is the called one. */
2606 SAVEVPTR(PL_curcop);
2607 PL_curcop = PL_curcopdb;
2610 /* Do we need to open block here? XXXX */
2611 (void)(*CvXSUB(cv))(aTHXo_ cv);
2613 /* Enforce some sanity in scalar context. */
2614 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2615 if (markix > PL_stack_sp - PL_stack_base)
2616 *(PL_stack_base + markix) = &PL_sv_undef;
2618 *(PL_stack_base + markix) = *PL_stack_sp;
2619 PL_stack_sp = PL_stack_base + markix;
2627 register I32 items = SP - MARK;
2628 AV* padlist = CvPADLIST(cv);
2629 SV** svp = AvARRAY(padlist);
2630 push_return(PL_op->op_next);
2631 PUSHBLOCK(cx, CXt_SUB, MARK);
2634 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2635 * that eval'' ops within this sub know the correct lexical space.
2636 * Owing the speed considerations, we choose to search for the cv
2637 * in doeval() instead.
2639 if (CvDEPTH(cv) < 2)
2640 (void)SvREFCNT_inc(cv);
2641 else { /* save temporaries on recursion? */
2642 PERL_STACK_OVERFLOW_CHECK();
2643 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2645 AV *newpad = newAV();
2646 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2647 I32 ix = AvFILLp((AV*)svp[1]);
2648 I32 names_fill = AvFILLp((AV*)svp[0]);
2649 svp = AvARRAY(svp[0]);
2650 for ( ;ix > 0; ix--) {
2651 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2652 char *name = SvPVX(svp[ix]);
2653 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2654 || *name == '&') /* anonymous code? */
2656 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2658 else { /* our own lexical */
2660 av_store(newpad, ix, sv = (SV*)newAV());
2661 else if (*name == '%')
2662 av_store(newpad, ix, sv = (SV*)newHV());
2664 av_store(newpad, ix, sv = NEWSV(0,0));
2668 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2669 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2672 av_store(newpad, ix, sv = NEWSV(0,0));
2676 av = newAV(); /* will be @_ */
2678 av_store(newpad, 0, (SV*)av);
2679 AvFLAGS(av) = AVf_REIFY;
2680 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2681 AvFILLp(padlist) = CvDEPTH(cv);
2682 svp = AvARRAY(padlist);
2687 AV* av = (AV*)PL_curpad[0];
2689 items = AvFILLp(av) + 1;
2691 /* Mark is at the end of the stack. */
2693 Copy(AvARRAY(av), SP + 1, items, SV*);
2698 #endif /* USE_THREADS */
2699 SAVEVPTR(PL_curpad);
2700 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2703 #endif /* USE_THREADS */
2709 DEBUG_S(PerlIO_printf(Perl_debug_log,
2710 "%p entersub preparing @_\n", thr));
2712 av = (AV*)PL_curpad[0];
2714 /* @_ is normally not REAL--this should only ever
2715 * happen when DB::sub() calls things that modify @_ */
2721 cx->blk_sub.savearray = GvAV(PL_defgv);
2722 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2723 #endif /* USE_THREADS */
2724 cx->blk_sub.oldcurpad = PL_curpad;
2725 cx->blk_sub.argarray = av;
2728 if (items > AvMAX(av) + 1) {
2730 if (AvARRAY(av) != ary) {
2731 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2732 SvPVX(av) = (char*)ary;
2734 if (items > AvMAX(av) + 1) {
2735 AvMAX(av) = items - 1;
2736 Renew(ary,items,SV*);
2738 SvPVX(av) = (char*)ary;
2741 Copy(MARK,AvARRAY(av),items,SV*);
2742 AvFILLp(av) = items - 1;
2750 /* warning must come *after* we fully set up the context
2751 * stuff so that __WARN__ handlers can safely dounwind()
2754 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2755 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2756 sub_crush_depth(cv);
2758 DEBUG_S(PerlIO_printf(Perl_debug_log,
2759 "%p entersub returning %p\n", thr, CvSTART(cv)));
2761 RETURNOP(CvSTART(cv));
2766 Perl_sub_crush_depth(pTHX_ CV *cv)
2769 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2771 SV* tmpstr = sv_newmortal();
2772 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2773 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2784 U32 lval = PL_op->op_flags & OPf_MOD;
2785 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2789 elem -= PL_curcop->cop_arybase;
2790 if (SvTYPE(av) != SVt_PVAV)
2792 svp = av_fetch(av, elem, lval && !defer);
2794 if (!svp || *svp == &PL_sv_undef) {
2797 DIE(aTHX_ PL_no_aelem, elem);
2798 lv = sv_newmortal();
2799 sv_upgrade(lv, SVt_PVLV);
2801 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2802 LvTARG(lv) = SvREFCNT_inc(av);
2803 LvTARGOFF(lv) = elem;
2808 if (PL_op->op_private & OPpLVAL_INTRO)
2809 save_aelem(av, elem, svp);
2810 else if (PL_op->op_private & OPpDEREF)
2811 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2813 sv = (svp ? *svp : &PL_sv_undef);
2814 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2815 sv = sv_mortalcopy(sv);
2821 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2827 Perl_croak(aTHX_ PL_no_modify);
2828 if (SvTYPE(sv) < SVt_RV)
2829 sv_upgrade(sv, SVt_RV);
2830 else if (SvTYPE(sv) >= SVt_PV) {
2831 (void)SvOOK_off(sv);
2832 Safefree(SvPVX(sv));
2833 SvLEN(sv) = SvCUR(sv) = 0;
2837 SvRV(sv) = NEWSV(355,0);
2840 SvRV(sv) = (SV*)newAV();
2843 SvRV(sv) = (SV*)newHV();
2858 if (SvTYPE(rsv) == SVt_PVCV) {
2864 SETs(method_common(sv, Null(U32*)));
2871 SV* sv = cSVOP->op_sv;
2872 U32 hash = SvUVX(sv);
2874 XPUSHs(method_common(sv, &hash));
2879 S_method_common(pTHX_ SV* meth, U32* hashp)
2890 name = SvPV(meth, namelen);
2891 sv = *(PL_stack_base + TOPMARK + 1);
2894 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2905 !(packname = SvPV(sv, packlen)) ||
2906 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2907 !(ob=(SV*)GvIO(iogv)))
2910 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2911 ? !isIDFIRST_utf8((U8*)packname)
2912 : !isIDFIRST(*packname)
2915 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2916 SvOK(sv) ? "without a package or object reference"
2917 : "on an undefined value");
2919 stash = gv_stashpvn(packname, packlen, TRUE);
2922 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2925 if (!ob || !(SvOBJECT(ob)
2926 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2929 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2933 stash = SvSTASH(ob);
2936 /* shortcut for simple names */
2938 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2940 gv = (GV*)HeVAL(he);
2941 if (isGV(gv) && GvCV(gv) &&
2942 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2943 return (SV*)GvCV(gv);
2947 gv = gv_fetchmethod(stash, name);
2954 for (p = name; *p; p++) {
2956 sep = p, leaf = p + 1;
2957 else if (*p == ':' && *(p + 1) == ':')
2958 sep = p, leaf = p + 2;
2960 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2961 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2962 packlen = strlen(packname);
2966 packlen = sep - name;
2968 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2969 if (gv && isGV(gv)) {
2971 "Can't locate object method \"%s\" via package \"%s\"",
2976 "Can't locate object method \"%s\" via package \"%s\""
2977 " (perhaps you forgot to load \"%s\"?)",
2978 leaf, packname, packname);
2981 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2986 unset_cvowner(pTHXo_ void *cvarg)
2988 register CV* cv = (CV *) cvarg;
2991 #endif /* DEBUGGING */
2993 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2994 thr, cv, SvPEEK((SV*)cv))));
2995 MUTEX_LOCK(CvMUTEXP(cv));
2996 DEBUG_S(if (CvDEPTH(cv) != 0)
2997 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2999 assert(thr == CvOWNER(cv));
3001 MUTEX_UNLOCK(CvMUTEXP(cv));
3004 #endif /* USE_THREADS */