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);
149 bool left_utf = DO_UTF8(left);
150 bool right_utf = DO_UTF8(right);
152 if (left_utf != right_utf) {
153 if (TARG == right && !right_utf) {
154 sv_utf8_upgrade(TARG); /* Now straight binary copy */
158 /* Set TARG to PV(left), then add right */
159 U8 *l, *c, *olds = NULL;
161 s = (U8*)SvPV(right,len);
163 /* Take a copy since we're about to overwrite TARG */
164 olds = s = (U8*)savepvn((char*)s, len);
166 if (SvGMAGICAL(left))
168 else if (!SvOK(left) && SvTYPE(left) <= SVt_PVMG)
169 sv_setpv(left, ""); /* Suppress warning. */
170 l = (U8*)SvPV(left, targlen);
172 sv_setpvn(TARG, (char*)l, targlen);
174 sv_utf8_upgrade(TARG);
175 /* Extend TARG to length of right (s) */
176 targlen = SvCUR(TARG) + len;
178 /* plus one for each hi-byte char if we have to upgrade */
179 for (c = s; c < s + len; c++) {
184 SvGROW(TARG, targlen+1);
185 /* And now copy, maybe upgrading right to UTF8 on the fly */
186 for (c = (U8*)SvEND(TARG); len--; s++) {
187 if (*s & 0x80 && !right_utf)
188 c = uv_to_utf8(c, *s);
192 SvCUR_set(TARG, targlen);
202 s = (U8*)SvPV(left,len);
204 sv_insert(TARG, 0, 0, (char*)s, len);
208 sv_setpvn(TARG, (char *)s, len);
210 else if (SvGMAGICAL(TARG))
212 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG)
213 sv_setpv(TARG, ""); /* Suppress warning. */
214 s = (U8*)SvPV(right,len);
216 #if defined(PERL_Y2KWARN)
217 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
219 char *s = SvPV(TARG,n);
220 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
221 && (n == 2 || !isDIGIT(s[n-3])))
223 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
224 "about to append an integer to '19'");
228 sv_catpvn(TARG, (char *)s, len);
231 sv_setpvn(TARG, (char *)s, len); /* suppress warning */
243 if (PL_op->op_flags & OPf_MOD) {
244 if (PL_op->op_private & OPpLVAL_INTRO)
245 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
246 else if (PL_op->op_private & OPpDEREF) {
248 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
257 tryAMAGICunTARGET(iter, 0);
258 PL_last_in_gv = (GV*)(*PL_stack_sp--);
259 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
260 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
261 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
264 XPUSHs((SV*)PL_last_in_gv);
267 PL_last_in_gv = (GV*)(*PL_stack_sp--);
270 return do_readline();
275 djSP; tryAMAGICbinSET(eq,0);
278 SETs(boolSV(TOPn == value));
286 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
287 DIE(aTHX_ PL_no_modify);
288 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
289 SvIVX(TOPs) != IV_MAX)
292 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
307 RETURNOP(cLOGOP->op_other);
313 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
316 SETn( left + right );
324 AV *av = GvAV(cGVOP_gv);
325 U32 lval = PL_op->op_flags & OPf_MOD;
326 SV** svp = av_fetch(av, PL_op->op_private, lval);
327 SV *sv = (svp ? *svp : &PL_sv_undef);
329 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
330 sv = sv_mortalcopy(sv);
337 djSP; dMARK; dTARGET;
339 do_join(TARG, *MARK, MARK, SP);
350 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
351 * will be enough to hold an OP*.
353 SV* sv = sv_newmortal();
354 sv_upgrade(sv, SVt_PVLV);
356 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
364 /* Oversized hot code. */
368 djSP; dMARK; dORIGMARK;
375 if (PL_op->op_flags & OPf_STACKED)
379 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
381 if (MARK == ORIGMARK) {
382 /* If using default handle then we need to make space to
383 * pass object as 1st arg, so move other args up ...
387 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
391 *MARK = SvTIED_obj((SV*)gv, mg);
394 call_method("PRINT", G_SCALAR);
402 if (!(io = GvIO(gv))) {
404 if ((GvEGV(gv)) && (mg = SvTIED_mg((SV*)GvEGV(gv),'q')))
406 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
407 report_evil_fh(gv, io, PL_op->op_type);
408 SETERRNO(EBADF,RMS$_IFI);
411 else if (!(fp = IoOFP(io))) {
412 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
414 /* integrate with report_evil_fh()? */
417 SV* sv = sv_newmortal();
418 gv_efullname4(sv, gv, Nullch, FALSE);
419 name = SvPV_nolen(sv);
422 Perl_warner(aTHX_ WARN_IO,
423 "Filehandle %s opened only for input", name);
425 Perl_warner(aTHX_ WARN_IO,
426 "Filehandle opened only for input");
428 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
429 report_evil_fh(gv, io, PL_op->op_type);
431 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
438 if (!do_print(*MARK, fp))
442 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
451 if (!do_print(*MARK, fp))
460 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
463 if (IoFLAGS(io) & IOf_FLUSH)
464 if (PerlIO_flush(fp) == EOF)
485 tryAMAGICunDEREF(to_av);
488 if (SvTYPE(av) != SVt_PVAV)
489 DIE(aTHX_ "Not an ARRAY reference");
490 if (PL_op->op_flags & OPf_REF) {
496 if (SvTYPE(sv) == SVt_PVAV) {
498 if (PL_op->op_flags & OPf_REF) {
506 if (SvTYPE(sv) != SVt_PVGV) {
510 if (SvGMAGICAL(sv)) {
516 if (PL_op->op_flags & OPf_REF ||
517 PL_op->op_private & HINT_STRICT_REFS)
518 DIE(aTHX_ PL_no_usym, "an ARRAY");
519 if (ckWARN(WARN_UNINITIALIZED))
521 if (GIMME == G_ARRAY) {
528 if ((PL_op->op_flags & OPf_SPECIAL) &&
529 !(PL_op->op_flags & OPf_MOD))
531 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
533 && (!is_gv_magical(sym,len,0)
534 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
540 if (PL_op->op_private & HINT_STRICT_REFS)
541 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
542 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
549 if (PL_op->op_private & OPpLVAL_INTRO)
551 if (PL_op->op_flags & OPf_REF) {
558 if (GIMME == G_ARRAY) {
559 I32 maxarg = AvFILL(av) + 1;
560 (void)POPs; /* XXXX May be optimized away? */
562 if (SvRMAGICAL(av)) {
564 for (i=0; i < maxarg; i++) {
565 SV **svp = av_fetch(av, i, FALSE);
566 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
570 Copy(AvARRAY(av), SP+1, maxarg, SV*);
576 I32 maxarg = AvFILL(av) + 1;
589 tryAMAGICunDEREF(to_hv);
592 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
593 DIE(aTHX_ "Not a HASH reference");
594 if (PL_op->op_flags & OPf_REF) {
600 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
602 if (PL_op->op_flags & OPf_REF) {
610 if (SvTYPE(sv) != SVt_PVGV) {
614 if (SvGMAGICAL(sv)) {
620 if (PL_op->op_flags & OPf_REF ||
621 PL_op->op_private & HINT_STRICT_REFS)
622 DIE(aTHX_ PL_no_usym, "a HASH");
623 if (ckWARN(WARN_UNINITIALIZED))
625 if (GIMME == G_ARRAY) {
632 if ((PL_op->op_flags & OPf_SPECIAL) &&
633 !(PL_op->op_flags & OPf_MOD))
635 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
637 && (!is_gv_magical(sym,len,0)
638 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
644 if (PL_op->op_private & HINT_STRICT_REFS)
645 DIE(aTHX_ PL_no_symref, sym, "a HASH");
646 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
653 if (PL_op->op_private & OPpLVAL_INTRO)
655 if (PL_op->op_flags & OPf_REF) {
662 if (GIMME == G_ARRAY) { /* array wanted */
663 *PL_stack_sp = (SV*)hv;
668 if (SvTYPE(hv) == SVt_PVAV)
669 hv = avhv_keys((AV*)hv);
671 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
672 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
682 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
688 leftop = ((BINOP*)PL_op)->op_last;
690 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
691 leftop = ((LISTOP*)leftop)->op_first;
693 /* Skip PUSHMARK and each element already assigned to. */
694 for (i = lelem - firstlelem; i > 0; i--) {
695 leftop = leftop->op_sibling;
698 if (leftop->op_type != OP_RV2HV)
703 av_fill(ary, 0); /* clear all but the fields hash */
704 if (lastrelem >= relem) {
705 while (relem < lastrelem) { /* gobble up all the rest */
709 /* Avoid a memory leak when avhv_store_ent dies. */
710 tmpstr = sv_newmortal();
711 sv_setsv(tmpstr,relem[1]); /* value */
713 if (avhv_store_ent(ary,relem[0],tmpstr,0))
714 (void)SvREFCNT_inc(tmpstr);
715 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
721 if (relem == lastrelem)
727 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
731 if (ckWARN(WARN_MISC)) {
732 if (relem == firstrelem &&
734 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
735 SvTYPE(SvRV(*relem)) == SVt_PVHV))
737 Perl_warner(aTHX_ WARN_MISC,
738 "Reference found where even-sized list expected");
741 Perl_warner(aTHX_ WARN_MISC,
742 "Odd number of elements in hash assignment");
744 if (SvTYPE(hash) == SVt_PVAV) {
746 tmpstr = sv_newmortal();
747 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
748 (void)SvREFCNT_inc(tmpstr);
749 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
754 tmpstr = NEWSV(29,0);
755 didstore = hv_store_ent(hash,*relem,tmpstr,0);
756 if (SvMAGICAL(hash)) {
757 if (SvSMAGICAL(tmpstr))
770 SV **lastlelem = PL_stack_sp;
771 SV **lastrelem = PL_stack_base + POPMARK;
772 SV **firstrelem = PL_stack_base + POPMARK + 1;
773 SV **firstlelem = lastrelem + 1;
786 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
788 /* If there's a common identifier on both sides we have to take
789 * special care that assigning the identifier on the left doesn't
790 * clobber a value on the right that's used later in the list.
792 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
793 EXTEND_MORTAL(lastrelem - firstrelem + 1);
794 for (relem = firstrelem; relem <= lastrelem; relem++) {
797 TAINT_NOT; /* Each item is independent */
798 *relem = sv_mortalcopy(sv);
808 while (lelem <= lastlelem) {
809 TAINT_NOT; /* Each item stands on its own, taintwise. */
811 switch (SvTYPE(sv)) {
814 magic = SvMAGICAL(ary) != 0;
815 if (PL_op->op_private & OPpASSIGN_HASH) {
816 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
822 do_oddball((HV*)ary, relem, firstrelem);
824 relem = lastrelem + 1;
829 av_extend(ary, lastrelem - relem);
831 while (relem <= lastrelem) { /* gobble up all the rest */
837 didstore = av_store(ary,i++,sv);
847 case SVt_PVHV: { /* normal hash */
851 magic = SvMAGICAL(hash) != 0;
854 while (relem < lastrelem) { /* gobble up all the rest */
859 sv = &PL_sv_no, relem++;
860 tmpstr = NEWSV(29,0);
862 sv_setsv(tmpstr,*relem); /* value */
864 didstore = hv_store_ent(hash,sv,tmpstr,0);
866 if (SvSMAGICAL(tmpstr))
873 if (relem == lastrelem) {
874 do_oddball(hash, relem, firstrelem);
880 if (SvIMMORTAL(sv)) {
881 if (relem <= lastrelem)
885 if (relem <= lastrelem) {
886 sv_setsv(sv, *relem);
890 sv_setsv(sv, &PL_sv_undef);
895 if (PL_delaymagic & ~DM_DELAY) {
896 if (PL_delaymagic & DM_UID) {
898 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
901 (void)setreuid(PL_uid,PL_euid);
904 if ((PL_delaymagic & DM_UID) == DM_RUID) {
905 (void)setruid(PL_uid);
906 PL_delaymagic &= ~DM_RUID;
908 # endif /* HAS_SETRUID */
910 if ((PL_delaymagic & DM_UID) == DM_EUID) {
911 (void)seteuid(PL_uid);
912 PL_delaymagic &= ~DM_EUID;
914 # endif /* HAS_SETEUID */
915 if (PL_delaymagic & DM_UID) {
916 if (PL_uid != PL_euid)
917 DIE(aTHX_ "No setreuid available");
918 (void)PerlProc_setuid(PL_uid);
920 # endif /* HAS_SETREUID */
921 #endif /* HAS_SETRESUID */
922 PL_uid = PerlProc_getuid();
923 PL_euid = PerlProc_geteuid();
925 if (PL_delaymagic & DM_GID) {
927 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
930 (void)setregid(PL_gid,PL_egid);
933 if ((PL_delaymagic & DM_GID) == DM_RGID) {
934 (void)setrgid(PL_gid);
935 PL_delaymagic &= ~DM_RGID;
937 # endif /* HAS_SETRGID */
939 if ((PL_delaymagic & DM_GID) == DM_EGID) {
940 (void)setegid(PL_gid);
941 PL_delaymagic &= ~DM_EGID;
943 # endif /* HAS_SETEGID */
944 if (PL_delaymagic & DM_GID) {
945 if (PL_gid != PL_egid)
946 DIE(aTHX_ "No setregid available");
947 (void)PerlProc_setgid(PL_gid);
949 # endif /* HAS_SETREGID */
950 #endif /* HAS_SETRESGID */
951 PL_gid = PerlProc_getgid();
952 PL_egid = PerlProc_getegid();
954 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
961 else if (gimme == G_SCALAR) {
964 SETi(lastrelem - firstrelem + 1);
970 SP = firstrelem + (lastlelem - firstlelem);
971 lelem = firstlelem + (relem - firstrelem);
973 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
981 register PMOP *pm = cPMOP;
982 SV *rv = sv_newmortal();
983 SV *sv = newSVrv(rv, "Regexp");
984 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
991 register PMOP *pm = cPMOP;
996 I32 r_flags = REXEC_CHECKED;
997 char *truebase; /* Start of string */
998 register REGEXP *rx = pm->op_pmregexp;
1003 I32 oldsave = PL_savestack_ix;
1004 I32 update_minmatch = 1;
1005 I32 had_zerolen = 0;
1007 if (PL_op->op_flags & OPf_STACKED)
1013 PUTBACK; /* EVAL blocks need stack_sp. */
1014 s = SvPV(TARG, len);
1017 DIE(aTHX_ "panic: do_match");
1018 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1019 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1022 if (pm->op_pmdynflags & PMdf_USED) {
1024 if (gimme == G_ARRAY)
1029 if (!rx->prelen && PL_curpm) {
1031 rx = pm->op_pmregexp;
1033 if (rx->minlen > len) goto failure;
1037 /* XXXX What part of this is needed with true \G-support? */
1038 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1040 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1041 MAGIC* mg = mg_find(TARG, 'g');
1042 if (mg && mg->mg_len >= 0) {
1043 if (!(rx->reganch & ROPT_GPOS_SEEN))
1044 rx->endp[0] = rx->startp[0] = mg->mg_len;
1045 else if (rx->reganch & ROPT_ANCH_GPOS) {
1046 r_flags |= REXEC_IGNOREPOS;
1047 rx->endp[0] = rx->startp[0] = mg->mg_len;
1049 minmatch = (mg->mg_flags & MGf_MINMATCH);
1050 update_minmatch = 0;
1054 if ((gimme != G_ARRAY && !global && rx->nparens)
1055 || SvTEMP(TARG) || PL_sawampersand)
1056 r_flags |= REXEC_COPY_STR;
1058 r_flags |= REXEC_SCREAM;
1060 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1061 SAVEINT(PL_multiline);
1062 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1066 if (global && rx->startp[0] != -1) {
1067 t = s = rx->endp[0] + truebase;
1068 if ((s + rx->minlen) > strend)
1070 if (update_minmatch++)
1071 minmatch = had_zerolen;
1073 if (rx->reganch & RE_USE_INTUIT) {
1074 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1078 if ( (rx->reganch & ROPT_CHECK_ALL)
1080 && ((rx->reganch & ROPT_NOSCAN)
1081 || !((rx->reganch & RE_INTUIT_TAIL)
1082 && (r_flags & REXEC_SCREAM)))
1083 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1086 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1089 if (pm->op_pmflags & PMf_ONCE)
1090 pm->op_pmdynflags |= PMdf_USED;
1099 RX_MATCH_TAINTED_on(rx);
1100 TAINT_IF(RX_MATCH_TAINTED(rx));
1101 if (gimme == G_ARRAY) {
1104 iters = rx->nparens;
1105 if (global && !iters)
1109 SPAGAIN; /* EVAL blocks could move the stack. */
1110 EXTEND(SP, iters + i);
1111 EXTEND_MORTAL(iters + i);
1112 for (i = !i; i <= iters; i++) {
1113 PUSHs(sv_newmortal());
1115 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1116 len = rx->endp[i] - rx->startp[i];
1117 s = rx->startp[i] + truebase;
1118 sv_setpvn(*SP, s, len);
1119 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1121 sv_utf8_downgrade(*SP, TRUE);
1126 had_zerolen = (rx->startp[0] != -1
1127 && rx->startp[0] == rx->endp[0]);
1128 PUTBACK; /* EVAL blocks may use stack */
1129 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1134 LEAVE_SCOPE(oldsave);
1140 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1141 mg = mg_find(TARG, 'g');
1143 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1144 mg = mg_find(TARG, 'g');
1146 if (rx->startp[0] != -1) {
1147 mg->mg_len = rx->endp[0];
1148 if (rx->startp[0] == rx->endp[0])
1149 mg->mg_flags |= MGf_MINMATCH;
1151 mg->mg_flags &= ~MGf_MINMATCH;
1154 LEAVE_SCOPE(oldsave);
1158 yup: /* Confirmed by INTUIT */
1160 RX_MATCH_TAINTED_on(rx);
1161 TAINT_IF(RX_MATCH_TAINTED(rx));
1163 if (pm->op_pmflags & PMf_ONCE)
1164 pm->op_pmdynflags |= PMdf_USED;
1165 if (RX_MATCH_COPIED(rx))
1166 Safefree(rx->subbeg);
1167 RX_MATCH_COPIED_off(rx);
1168 rx->subbeg = Nullch;
1170 rx->subbeg = truebase;
1171 rx->startp[0] = s - truebase;
1172 rx->endp[0] = s - truebase + rx->minlen;
1173 rx->sublen = strend - truebase;
1176 if (PL_sawampersand) {
1179 rx->subbeg = savepvn(t, strend - t);
1180 rx->sublen = strend - t;
1181 RX_MATCH_COPIED_on(rx);
1182 off = rx->startp[0] = s - t;
1183 rx->endp[0] = off + rx->minlen;
1185 else { /* startp/endp are used by @- @+. */
1186 rx->startp[0] = s - truebase;
1187 rx->endp[0] = s - truebase + rx->minlen;
1189 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1190 LEAVE_SCOPE(oldsave);
1195 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1196 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1197 MAGIC* mg = mg_find(TARG, 'g');
1202 LEAVE_SCOPE(oldsave);
1203 if (gimme == G_ARRAY)
1209 Perl_do_readline(pTHX)
1211 dSP; dTARGETSTACKED;
1216 register IO *io = GvIO(PL_last_in_gv);
1217 register I32 type = PL_op->op_type;
1218 I32 gimme = GIMME_V;
1221 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1223 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1226 call_method("READLINE", gimme);
1229 if (gimme == G_SCALAR)
1230 SvSetMagicSV_nosteal(TARG, TOPs);
1237 if (IoFLAGS(io) & IOf_ARGV) {
1238 if (IoFLAGS(io) & IOf_START) {
1240 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1241 IoFLAGS(io) &= ~IOf_START;
1242 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1243 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1244 SvSETMAGIC(GvSV(PL_last_in_gv));
1249 fp = nextargv(PL_last_in_gv);
1250 if (!fp) { /* Note: fp != IoIFP(io) */
1251 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1254 else if (type == OP_GLOB) {
1255 SV *tmpcmd = NEWSV(55, 0);
1259 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1260 /* since spawning off a process is a real performance hit */
1262 #include <descrip.h>
1263 #include <lib$routines.h>
1266 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1267 char vmsspec[NAM$C_MAXRSS+1];
1268 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1269 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1270 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1273 struct dsc$descriptor_s wilddsc
1274 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1275 struct dsc$descriptor_vs rsdsc
1276 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1277 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1279 /* We could find out if there's an explicit dev/dir or version
1280 by peeking into lib$find_file's internal context at
1281 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1282 but that's unsupported, so I don't want to do it now and
1283 have it bite someone in the future. */
1284 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1285 cp = SvPV(tmpglob,i);
1287 if (cp[i] == ';') hasver = 1;
1289 if (sts) hasver = 1;
1293 hasdir = isunix = 1;
1296 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1301 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1303 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1304 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1305 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1306 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1307 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1308 &dfltdsc,NULL,NULL,NULL))&1)) {
1309 end = rstr + (unsigned long int) *rslt;
1310 if (!hasver) while (*end != ';') end--;
1311 *(end++) = '\n'; *end = '\0';
1312 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1314 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1319 while (*(--begin) != ']' && *begin != '>') ;
1322 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1324 if (cxt) (void)lib$find_file_end(&cxt);
1325 if (ok && sts != RMS$_NMF &&
1326 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1329 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1331 PerlIO_close(tmpfp);
1335 PerlIO_rewind(tmpfp);
1337 IoIFP(io) = fp = tmpfp;
1338 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1343 #ifdef MACOS_TRADITIONAL
1344 sv_setpv(tmpcmd, "glob ");
1345 sv_catsv(tmpcmd, tmpglob);
1346 sv_catpv(tmpcmd, " |");
1350 sv_setpv(tmpcmd, "for a in ");
1351 sv_catsv(tmpcmd, tmpglob);
1352 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1355 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1356 sv_catsv(tmpcmd, tmpglob);
1358 sv_setpv(tmpcmd, "perlglob ");
1359 sv_catsv(tmpcmd, tmpglob);
1360 sv_catpv(tmpcmd, " |");
1365 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1366 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1367 sv_catsv(tmpcmd, tmpglob);
1368 sv_catpv(tmpcmd, "' 2>/dev/null |");
1370 sv_setpv(tmpcmd, "echo ");
1371 sv_catsv(tmpcmd, tmpglob);
1373 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1375 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1378 #endif /* !DOSISH */
1379 #endif /* MACOS_TRADITIONAL */
1380 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1381 FALSE, O_RDONLY, 0, Nullfp);
1387 else if (type == OP_GLOB)
1389 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1390 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1391 || fp == PerlIO_stderr()))
1393 /* integrate with report_evil_fh()? */
1395 if (isGV(PL_last_in_gv)) { /* can this ever fail? */
1396 SV* sv = sv_newmortal();
1397 gv_efullname4(sv, PL_last_in_gv, Nullch, FALSE);
1398 name = SvPV_nolen(sv);
1401 Perl_warner(aTHX_ WARN_IO,
1402 "Filehandle %s opened only for output", name);
1404 Perl_warner(aTHX_ WARN_IO,
1405 "Filehandle opened only for output");
1409 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1410 if (type == OP_GLOB)
1411 Perl_warner(aTHX_ WARN_GLOB,
1412 "glob failed (can't start child: %s)",
1415 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1417 if (gimme == G_SCALAR) {
1418 (void)SvOK_off(TARG);
1424 if (gimme == G_SCALAR) {
1428 (void)SvUPGRADE(sv, SVt_PV);
1429 tmplen = SvLEN(sv); /* remember if already alloced */
1431 Sv_Grow(sv, 80); /* try short-buffering it */
1432 if (type == OP_RCATLINE)
1438 sv = sv_2mortal(NEWSV(57, 80));
1442 /* delay EOF state for a snarfed empty file */
1443 #define SNARF_EOF(gimme,rs,io,sv) \
1444 (gimme != G_SCALAR || SvCUR(sv) \
1445 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1448 if (!sv_gets(sv, fp, offset)
1449 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1451 PerlIO_clearerr(fp);
1452 if (IoFLAGS(io) & IOf_ARGV) {
1453 fp = nextargv(PL_last_in_gv);
1456 (void)do_close(PL_last_in_gv, FALSE);
1458 else if (type == OP_GLOB) {
1459 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1460 Perl_warner(aTHX_ WARN_GLOB,
1461 "glob failed (child exited with status %d%s)",
1462 (int)(STATUS_CURRENT >> 8),
1463 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1466 if (gimme == G_SCALAR) {
1467 (void)SvOK_off(TARG);
1472 /* This should not be marked tainted if the fp is marked clean */
1473 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1478 IoFLAGS(io) |= IOf_NOLINE;
1481 if (type == OP_GLOB) {
1484 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1485 tmps = SvEND(sv) - 1;
1486 if (*tmps == *SvPVX(PL_rs)) {
1491 for (tmps = SvPVX(sv); *tmps; tmps++)
1492 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1493 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1495 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1496 (void)POPs; /* Unmatched wildcard? Chuck it... */
1500 if (gimme == G_ARRAY) {
1501 if (SvLEN(sv) - SvCUR(sv) > 20) {
1502 SvLEN_set(sv, SvCUR(sv)+1);
1503 Renew(SvPVX(sv), SvLEN(sv), char);
1505 sv = sv_2mortal(NEWSV(58, 80));
1508 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1509 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1513 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1514 Renew(SvPVX(sv), SvLEN(sv), char);
1523 register PERL_CONTEXT *cx;
1524 I32 gimme = OP_GIMME(PL_op, -1);
1527 if (cxstack_ix >= 0)
1528 gimme = cxstack[cxstack_ix].blk_gimme;
1536 PUSHBLOCK(cx, CXt_BLOCK, SP);
1548 U32 lval = PL_op->op_flags & OPf_MOD;
1549 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1551 U32 hash = (SvFAKE(keysv) && SvREADONLY(keysv)) ? SvUVX(keysv) : 0;
1553 if (SvTYPE(hv) == SVt_PVHV) {
1554 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1555 svp = he ? &HeVAL(he) : 0;
1557 else if (SvTYPE(hv) == SVt_PVAV) {
1558 if (PL_op->op_private & OPpLVAL_INTRO)
1559 DIE(aTHX_ "Can't localize pseudo-hash element");
1560 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, hash);
1566 if (!svp || *svp == &PL_sv_undef) {
1571 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1573 lv = sv_newmortal();
1574 sv_upgrade(lv, SVt_PVLV);
1576 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1577 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1578 LvTARG(lv) = SvREFCNT_inc(hv);
1583 if (PL_op->op_private & OPpLVAL_INTRO) {
1584 if (HvNAME(hv) && isGV(*svp))
1585 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1587 save_helem(hv, keysv, svp);
1589 else if (PL_op->op_private & OPpDEREF)
1590 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1592 sv = (svp ? *svp : &PL_sv_undef);
1593 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1594 * Pushing the magical RHS on to the stack is useless, since
1595 * that magic is soon destined to be misled by the local(),
1596 * and thus the later pp_sassign() will fail to mg_get() the
1597 * old value. This should also cure problems with delayed
1598 * mg_get()s. GSAR 98-07-03 */
1599 if (!lval && SvGMAGICAL(sv))
1600 sv = sv_mortalcopy(sv);
1608 register PERL_CONTEXT *cx;
1614 if (PL_op->op_flags & OPf_SPECIAL) {
1615 cx = &cxstack[cxstack_ix];
1616 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1621 gimme = OP_GIMME(PL_op, -1);
1623 if (cxstack_ix >= 0)
1624 gimme = cxstack[cxstack_ix].blk_gimme;
1630 if (gimme == G_VOID)
1632 else if (gimme == G_SCALAR) {
1635 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1638 *MARK = sv_mortalcopy(TOPs);
1641 *MARK = &PL_sv_undef;
1645 else if (gimme == G_ARRAY) {
1646 /* in case LEAVE wipes old return values */
1647 for (mark = newsp + 1; mark <= SP; mark++) {
1648 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1649 *mark = sv_mortalcopy(*mark);
1650 TAINT_NOT; /* Each item is independent */
1654 PL_curpm = newpm; /* Don't pop $1 et al till now */
1664 register PERL_CONTEXT *cx;
1670 cx = &cxstack[cxstack_ix];
1671 if (CxTYPE(cx) != CXt_LOOP)
1672 DIE(aTHX_ "panic: pp_iter");
1674 itersvp = CxITERVAR(cx);
1675 av = cx->blk_loop.iterary;
1676 if (SvTYPE(av) != SVt_PVAV) {
1677 /* iterate ($min .. $max) */
1678 if (cx->blk_loop.iterlval) {
1679 /* string increment */
1680 register SV* cur = cx->blk_loop.iterlval;
1682 char *max = SvPV((SV*)av, maxlen);
1683 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1684 #ifndef USE_THREADS /* don't risk potential race */
1685 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1686 /* safe to reuse old SV */
1687 sv_setsv(*itersvp, cur);
1692 /* we need a fresh SV every time so that loop body sees a
1693 * completely new SV for closures/references to work as
1695 SvREFCNT_dec(*itersvp);
1696 *itersvp = newSVsv(cur);
1698 if (strEQ(SvPVX(cur), max))
1699 sv_setiv(cur, 0); /* terminate next time */
1706 /* integer increment */
1707 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1710 #ifndef USE_THREADS /* don't risk potential race */
1711 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1712 /* safe to reuse old SV */
1713 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1718 /* we need a fresh SV every time so that loop body sees a
1719 * completely new SV for closures/references to work as they
1721 SvREFCNT_dec(*itersvp);
1722 *itersvp = newSViv(cx->blk_loop.iterix++);
1728 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1731 SvREFCNT_dec(*itersvp);
1733 if ((sv = SvMAGICAL(av)
1734 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1735 : AvARRAY(av)[++cx->blk_loop.iterix]))
1739 if (av != PL_curstack && SvIMMORTAL(sv)) {
1740 SV *lv = cx->blk_loop.iterlval;
1741 if (lv && SvREFCNT(lv) > 1) {
1746 SvREFCNT_dec(LvTARG(lv));
1748 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1749 sv_upgrade(lv, SVt_PVLV);
1751 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1753 LvTARG(lv) = SvREFCNT_inc(av);
1754 LvTARGOFF(lv) = cx->blk_loop.iterix;
1755 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1759 *itersvp = SvREFCNT_inc(sv);
1766 register PMOP *pm = cPMOP;
1782 register REGEXP *rx = pm->op_pmregexp;
1784 int force_on_match = 0;
1785 I32 oldsave = PL_savestack_ix;
1787 /* known replacement string? */
1788 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1789 if (PL_op->op_flags & OPf_STACKED)
1795 if (SvFAKE(TARG) && SvREADONLY(TARG))
1796 sv_force_normal(TARG);
1797 if (SvREADONLY(TARG)
1798 || (SvTYPE(TARG) > SVt_PVLV
1799 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1800 DIE(aTHX_ PL_no_modify);
1803 s = SvPV(TARG, len);
1804 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1806 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1807 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1814 DIE(aTHX_ "panic: do_subst");
1817 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1818 position, once with zero-length,
1819 second time with non-zero. */
1821 if (!rx->prelen && PL_curpm) {
1823 rx = pm->op_pmregexp;
1825 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1826 ? REXEC_COPY_STR : 0;
1828 r_flags |= REXEC_SCREAM;
1829 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1830 SAVEINT(PL_multiline);
1831 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1834 if (rx->reganch & RE_USE_INTUIT) {
1835 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1839 /* How to do it in subst? */
1840 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1842 && ((rx->reganch & ROPT_NOSCAN)
1843 || !((rx->reganch & RE_INTUIT_TAIL)
1844 && (r_flags & REXEC_SCREAM))))
1849 /* only replace once? */
1850 once = !(rpm->op_pmflags & PMf_GLOBAL);
1852 /* known replacement string? */
1853 c = dstr ? SvPV(dstr, clen) : Nullch;
1855 /* can do inplace substitution? */
1856 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1857 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1858 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1859 r_flags | REXEC_CHECKED))
1863 LEAVE_SCOPE(oldsave);
1866 if (force_on_match) {
1868 s = SvPV_force(TARG, len);
1873 SvSCREAM_off(TARG); /* disable possible screamer */
1875 rxtainted |= RX_MATCH_TAINTED(rx);
1876 m = orig + rx->startp[0];
1877 d = orig + rx->endp[0];
1879 if (m - s > strend - d) { /* faster to shorten from end */
1881 Copy(c, m, clen, char);
1886 Move(d, m, i, char);
1890 SvCUR_set(TARG, m - s);
1893 else if ((i = m - s)) { /* faster from front */
1901 Copy(c, m, clen, char);
1906 Copy(c, d, clen, char);
1911 TAINT_IF(rxtainted & 1);
1917 if (iters++ > maxiters)
1918 DIE(aTHX_ "Substitution loop");
1919 rxtainted |= RX_MATCH_TAINTED(rx);
1920 m = rx->startp[0] + orig;
1924 Move(s, d, i, char);
1928 Copy(c, d, clen, char);
1931 s = rx->endp[0] + orig;
1932 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1934 /* don't match same null twice */
1935 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1938 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1939 Move(s, d, i+1, char); /* include the NUL */
1941 TAINT_IF(rxtainted & 1);
1943 PUSHs(sv_2mortal(newSViv((I32)iters)));
1945 (void)SvPOK_only_UTF8(TARG);
1946 TAINT_IF(rxtainted);
1947 if (SvSMAGICAL(TARG)) {
1953 LEAVE_SCOPE(oldsave);
1957 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1958 r_flags | REXEC_CHECKED))
1960 if (force_on_match) {
1962 s = SvPV_force(TARG, len);
1965 rxtainted |= RX_MATCH_TAINTED(rx);
1966 dstr = NEWSV(25, len);
1967 sv_setpvn(dstr, m, s-m);
1970 register PERL_CONTEXT *cx;
1973 RETURNOP(cPMOP->op_pmreplroot);
1975 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1977 if (iters++ > maxiters)
1978 DIE(aTHX_ "Substitution loop");
1979 rxtainted |= RX_MATCH_TAINTED(rx);
1980 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1985 strend = s + (strend - m);
1987 m = rx->startp[0] + orig;
1988 sv_catpvn(dstr, s, m-s);
1989 s = rx->endp[0] + orig;
1991 sv_catpvn(dstr, c, clen);
1994 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1995 sv_catpvn(dstr, s, strend - s);
1997 (void)SvOOK_off(TARG);
1998 Safefree(SvPVX(TARG));
1999 SvPVX(TARG) = SvPVX(dstr);
2000 SvCUR_set(TARG, SvCUR(dstr));
2001 SvLEN_set(TARG, SvLEN(dstr));
2005 TAINT_IF(rxtainted & 1);
2007 PUSHs(sv_2mortal(newSViv((I32)iters)));
2009 (void)SvPOK_only(TARG);
2010 TAINT_IF(rxtainted);
2013 LEAVE_SCOPE(oldsave);
2022 LEAVE_SCOPE(oldsave);
2031 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2032 ++*PL_markstack_ptr;
2033 LEAVE; /* exit inner scope */
2036 if (PL_stack_base + *PL_markstack_ptr > SP) {
2038 I32 gimme = GIMME_V;
2040 LEAVE; /* exit outer scope */
2041 (void)POPMARK; /* pop src */
2042 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2043 (void)POPMARK; /* pop dst */
2044 SP = PL_stack_base + POPMARK; /* pop original mark */
2045 if (gimme == G_SCALAR) {
2049 else if (gimme == G_ARRAY)
2056 ENTER; /* enter inner scope */
2059 src = PL_stack_base[*PL_markstack_ptr];
2063 RETURNOP(cLOGOP->op_other);
2074 register PERL_CONTEXT *cx;
2080 if (gimme == G_SCALAR) {
2083 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2085 *MARK = SvREFCNT_inc(TOPs);
2090 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2092 *MARK = sv_mortalcopy(sv);
2097 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2101 *MARK = &PL_sv_undef;
2105 else if (gimme == G_ARRAY) {
2106 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2107 if (!SvTEMP(*MARK)) {
2108 *MARK = sv_mortalcopy(*MARK);
2109 TAINT_NOT; /* Each item is independent */
2115 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2116 PL_curpm = newpm; /* ... and pop $1 et al */
2120 return pop_return();
2123 /* This duplicates the above code because the above code must not
2124 * get any slower by more conditions */
2132 register PERL_CONTEXT *cx;
2139 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2140 /* We are an argument to a function or grep().
2141 * This kind of lvalueness was legal before lvalue
2142 * subroutines too, so be backward compatible:
2143 * cannot report errors. */
2145 /* Scalar context *is* possible, on the LHS of -> only,
2146 * as in f()->meth(). But this is not an lvalue. */
2147 if (gimme == G_SCALAR)
2149 if (gimme == G_ARRAY) {
2150 if (!CvLVALUE(cx->blk_sub.cv))
2151 goto temporise_array;
2152 EXTEND_MORTAL(SP - newsp);
2153 for (mark = newsp + 1; mark <= SP; mark++) {
2156 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2157 *mark = sv_mortalcopy(*mark);
2159 /* Can be a localized value subject to deletion. */
2160 PL_tmps_stack[++PL_tmps_ix] = *mark;
2161 (void)SvREFCNT_inc(*mark);
2166 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2167 /* Here we go for robustness, not for speed, so we change all
2168 * the refcounts so the caller gets a live guy. Cannot set
2169 * TEMP, so sv_2mortal is out of question. */
2170 if (!CvLVALUE(cx->blk_sub.cv)) {
2175 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2177 if (gimme == G_SCALAR) {
2181 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2186 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2187 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2189 else { /* Can be a localized value
2190 * subject to deletion. */
2191 PL_tmps_stack[++PL_tmps_ix] = *mark;
2192 (void)SvREFCNT_inc(*mark);
2195 else { /* Should not happen? */
2200 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2201 (MARK > SP ? "Empty array" : "Array"));
2205 else if (gimme == G_ARRAY) {
2206 EXTEND_MORTAL(SP - newsp);
2207 for (mark = newsp + 1; mark <= SP; mark++) {
2208 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2209 /* Might be flattened array after $#array = */
2215 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2216 (*mark != &PL_sv_undef)
2218 ? "a readonly value" : "a temporary")
2219 : "an uninitialized value");
2222 /* Can be a localized value subject to deletion. */
2223 PL_tmps_stack[++PL_tmps_ix] = *mark;
2224 (void)SvREFCNT_inc(*mark);
2230 if (gimme == G_SCALAR) {
2234 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2236 *MARK = SvREFCNT_inc(TOPs);
2241 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2243 *MARK = sv_mortalcopy(sv);
2248 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2252 *MARK = &PL_sv_undef;
2256 else if (gimme == G_ARRAY) {
2258 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2259 if (!SvTEMP(*MARK)) {
2260 *MARK = sv_mortalcopy(*MARK);
2261 TAINT_NOT; /* Each item is independent */
2268 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2269 PL_curpm = newpm; /* ... and pop $1 et al */
2273 return pop_return();
2278 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2281 SV *dbsv = GvSV(PL_DBsub);
2283 if (!PERLDB_SUB_NN) {
2287 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2288 || strEQ(GvNAME(gv), "END")
2289 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2290 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2291 && (gv = (GV*)*svp) ))) {
2292 /* Use GV from the stack as a fallback. */
2293 /* GV is potentially non-unique, or contain different CV. */
2294 SV *tmp = newRV((SV*)cv);
2295 sv_setsv(dbsv, tmp);
2299 gv_efullname3(dbsv, gv, Nullch);
2303 (void)SvUPGRADE(dbsv, SVt_PVIV);
2304 (void)SvIOK_on(dbsv);
2305 SAVEIV(SvIVX(dbsv));
2306 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2310 PL_curcopdb = PL_curcop;
2311 cv = GvCV(PL_DBsub);
2321 register PERL_CONTEXT *cx;
2323 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2326 DIE(aTHX_ "Not a CODE reference");
2327 switch (SvTYPE(sv)) {
2333 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2335 SP = PL_stack_base + POPMARK;
2338 if (SvGMAGICAL(sv)) {
2340 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2343 sym = SvPV(sv, n_a);
2345 DIE(aTHX_ PL_no_usym, "a subroutine");
2346 if (PL_op->op_private & HINT_STRICT_REFS)
2347 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2348 cv = get_cv(sym, TRUE);
2352 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2353 tryAMAGICunDEREF(to_cv);
2356 if (SvTYPE(cv) == SVt_PVCV)
2361 DIE(aTHX_ "Not a CODE reference");
2366 if (!(cv = GvCVu((GV*)sv)))
2367 cv = sv_2cv(sv, &stash, &gv, FALSE);
2380 if (!CvROOT(cv) && !CvXSUB(cv)) {
2384 /* anonymous or undef'd function leaves us no recourse */
2385 if (CvANON(cv) || !(gv = CvGV(cv)))
2386 DIE(aTHX_ "Undefined subroutine called");
2388 /* autoloaded stub? */
2389 if (cv != GvCV(gv)) {
2392 /* should call AUTOLOAD now? */
2395 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2402 sub_name = sv_newmortal();
2403 gv_efullname3(sub_name, gv, Nullch);
2404 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2408 DIE(aTHX_ "Not a CODE reference");
2413 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2414 cv = get_db_sub(&sv, cv);
2416 DIE(aTHX_ "No DBsub routine");
2421 * First we need to check if the sub or method requires locking.
2422 * If so, we gain a lock on the CV, the first argument or the
2423 * stash (for static methods), as appropriate. This has to be
2424 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2425 * reschedule by returning a new op.
2427 MUTEX_LOCK(CvMUTEXP(cv));
2428 if (CvFLAGS(cv) & CVf_LOCKED) {
2430 if (CvFLAGS(cv) & CVf_METHOD) {
2431 if (SP > PL_stack_base + TOPMARK)
2432 sv = *(PL_stack_base + TOPMARK + 1);
2434 AV *av = (AV*)PL_curpad[0];
2435 if (hasargs || !av || AvFILLp(av) < 0
2436 || !(sv = AvARRAY(av)[0]))
2438 MUTEX_UNLOCK(CvMUTEXP(cv));
2439 DIE(aTHX_ "no argument for locked method call");
2446 char *stashname = SvPV(sv, len);
2447 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2453 MUTEX_UNLOCK(CvMUTEXP(cv));
2454 mg = condpair_magic(sv);
2455 MUTEX_LOCK(MgMUTEXP(mg));
2456 if (MgOWNER(mg) == thr)
2457 MUTEX_UNLOCK(MgMUTEXP(mg));
2460 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2462 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2464 MUTEX_UNLOCK(MgMUTEXP(mg));
2465 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2467 MUTEX_LOCK(CvMUTEXP(cv));
2470 * Now we have permission to enter the sub, we must distinguish
2471 * four cases. (0) It's an XSUB (in which case we don't care
2472 * about ownership); (1) it's ours already (and we're recursing);
2473 * (2) it's free (but we may already be using a cached clone);
2474 * (3) another thread owns it. Case (1) is easy: we just use it.
2475 * Case (2) means we look for a clone--if we have one, use it
2476 * otherwise grab ownership of cv. Case (3) means we look for a
2477 * clone (for non-XSUBs) and have to create one if we don't
2479 * Why look for a clone in case (2) when we could just grab
2480 * ownership of cv straight away? Well, we could be recursing,
2481 * i.e. we originally tried to enter cv while another thread
2482 * owned it (hence we used a clone) but it has been freed up
2483 * and we're now recursing into it. It may or may not be "better"
2484 * to use the clone but at least CvDEPTH can be trusted.
2486 if (CvOWNER(cv) == thr || CvXSUB(cv))
2487 MUTEX_UNLOCK(CvMUTEXP(cv));
2489 /* Case (2) or (3) */
2493 * XXX Might it be better to release CvMUTEXP(cv) while we
2494 * do the hv_fetch? We might find someone has pinched it
2495 * when we look again, in which case we would be in case
2496 * (3) instead of (2) so we'd have to clone. Would the fact
2497 * that we released the mutex more quickly make up for this?
2499 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2501 /* We already have a clone to use */
2502 MUTEX_UNLOCK(CvMUTEXP(cv));
2504 DEBUG_S(PerlIO_printf(Perl_debug_log,
2505 "entersub: %p already has clone %p:%s\n",
2506 thr, cv, SvPEEK((SV*)cv)));
2509 if (CvDEPTH(cv) == 0)
2510 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2513 /* (2) => grab ownership of cv. (3) => make clone */
2517 MUTEX_UNLOCK(CvMUTEXP(cv));
2518 DEBUG_S(PerlIO_printf(Perl_debug_log,
2519 "entersub: %p grabbing %p:%s in stash %s\n",
2520 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2521 HvNAME(CvSTASH(cv)) : "(none)"));
2524 /* Make a new clone. */
2526 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2527 MUTEX_UNLOCK(CvMUTEXP(cv));
2528 DEBUG_S((PerlIO_printf(Perl_debug_log,
2529 "entersub: %p cloning %p:%s\n",
2530 thr, cv, SvPEEK((SV*)cv))));
2532 * We're creating a new clone so there's no race
2533 * between the original MUTEX_UNLOCK and the
2534 * SvREFCNT_inc since no one will be trying to undef
2535 * it out from underneath us. At least, I don't think
2538 clonecv = cv_clone(cv);
2539 SvREFCNT_dec(cv); /* finished with this */
2540 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2541 CvOWNER(clonecv) = thr;
2545 DEBUG_S(if (CvDEPTH(cv) != 0)
2546 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2548 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2551 #endif /* USE_THREADS */
2554 #ifdef PERL_XSUB_OLDSTYLE
2555 if (CvOLDSTYLE(cv)) {
2556 I32 (*fp3)(int,int,int);
2558 register I32 items = SP - MARK;
2559 /* We dont worry to copy from @_. */
2564 PL_stack_sp = mark + 1;
2565 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2566 items = (*fp3)(CvXSUBANY(cv).any_i32,
2567 MARK - PL_stack_base + 1,
2569 PL_stack_sp = PL_stack_base + items;
2572 #endif /* PERL_XSUB_OLDSTYLE */
2574 I32 markix = TOPMARK;
2579 /* Need to copy @_ to stack. Alternative may be to
2580 * switch stack to @_, and copy return values
2581 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2585 av = (AV*)PL_curpad[0];
2587 av = GvAV(PL_defgv);
2588 #endif /* USE_THREADS */
2589 items = AvFILLp(av) + 1; /* @_ is not tieable */
2592 /* Mark is at the end of the stack. */
2594 Copy(AvARRAY(av), SP + 1, items, SV*);
2599 /* We assume first XSUB in &DB::sub is the called one. */
2601 SAVEVPTR(PL_curcop);
2602 PL_curcop = PL_curcopdb;
2605 /* Do we need to open block here? XXXX */
2606 (void)(*CvXSUB(cv))(aTHXo_ cv);
2608 /* Enforce some sanity in scalar context. */
2609 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2610 if (markix > PL_stack_sp - PL_stack_base)
2611 *(PL_stack_base + markix) = &PL_sv_undef;
2613 *(PL_stack_base + markix) = *PL_stack_sp;
2614 PL_stack_sp = PL_stack_base + markix;
2622 register I32 items = SP - MARK;
2623 AV* padlist = CvPADLIST(cv);
2624 SV** svp = AvARRAY(padlist);
2625 push_return(PL_op->op_next);
2626 PUSHBLOCK(cx, CXt_SUB, MARK);
2629 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2630 * that eval'' ops within this sub know the correct lexical space.
2631 * Owing the speed considerations, we choose to search for the cv
2632 * in doeval() instead.
2634 if (CvDEPTH(cv) < 2)
2635 (void)SvREFCNT_inc(cv);
2636 else { /* save temporaries on recursion? */
2637 PERL_STACK_OVERFLOW_CHECK();
2638 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2640 AV *newpad = newAV();
2641 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2642 I32 ix = AvFILLp((AV*)svp[1]);
2643 I32 names_fill = AvFILLp((AV*)svp[0]);
2644 svp = AvARRAY(svp[0]);
2645 for ( ;ix > 0; ix--) {
2646 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2647 char *name = SvPVX(svp[ix]);
2648 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2649 || *name == '&') /* anonymous code? */
2651 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2653 else { /* our own lexical */
2655 av_store(newpad, ix, sv = (SV*)newAV());
2656 else if (*name == '%')
2657 av_store(newpad, ix, sv = (SV*)newHV());
2659 av_store(newpad, ix, sv = NEWSV(0,0));
2663 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2664 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2667 av_store(newpad, ix, sv = NEWSV(0,0));
2671 av = newAV(); /* will be @_ */
2673 av_store(newpad, 0, (SV*)av);
2674 AvFLAGS(av) = AVf_REIFY;
2675 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2676 AvFILLp(padlist) = CvDEPTH(cv);
2677 svp = AvARRAY(padlist);
2682 AV* av = (AV*)PL_curpad[0];
2684 items = AvFILLp(av) + 1;
2686 /* Mark is at the end of the stack. */
2688 Copy(AvARRAY(av), SP + 1, items, SV*);
2693 #endif /* USE_THREADS */
2694 SAVEVPTR(PL_curpad);
2695 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2698 #endif /* USE_THREADS */
2704 DEBUG_S(PerlIO_printf(Perl_debug_log,
2705 "%p entersub preparing @_\n", thr));
2707 av = (AV*)PL_curpad[0];
2709 /* @_ is normally not REAL--this should only ever
2710 * happen when DB::sub() calls things that modify @_ */
2716 cx->blk_sub.savearray = GvAV(PL_defgv);
2717 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2718 #endif /* USE_THREADS */
2719 cx->blk_sub.oldcurpad = PL_curpad;
2720 cx->blk_sub.argarray = av;
2723 if (items > AvMAX(av) + 1) {
2725 if (AvARRAY(av) != ary) {
2726 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2727 SvPVX(av) = (char*)ary;
2729 if (items > AvMAX(av) + 1) {
2730 AvMAX(av) = items - 1;
2731 Renew(ary,items,SV*);
2733 SvPVX(av) = (char*)ary;
2736 Copy(MARK,AvARRAY(av),items,SV*);
2737 AvFILLp(av) = items - 1;
2745 /* warning must come *after* we fully set up the context
2746 * stuff so that __WARN__ handlers can safely dounwind()
2749 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2750 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2751 sub_crush_depth(cv);
2753 DEBUG_S(PerlIO_printf(Perl_debug_log,
2754 "%p entersub returning %p\n", thr, CvSTART(cv)));
2756 RETURNOP(CvSTART(cv));
2761 Perl_sub_crush_depth(pTHX_ CV *cv)
2764 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2766 SV* tmpstr = sv_newmortal();
2767 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2768 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2779 U32 lval = PL_op->op_flags & OPf_MOD;
2780 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2784 elem -= PL_curcop->cop_arybase;
2785 if (SvTYPE(av) != SVt_PVAV)
2787 svp = av_fetch(av, elem, lval && !defer);
2789 if (!svp || *svp == &PL_sv_undef) {
2792 DIE(aTHX_ PL_no_aelem, elem);
2793 lv = sv_newmortal();
2794 sv_upgrade(lv, SVt_PVLV);
2796 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2797 LvTARG(lv) = SvREFCNT_inc(av);
2798 LvTARGOFF(lv) = elem;
2803 if (PL_op->op_private & OPpLVAL_INTRO)
2804 save_aelem(av, elem, svp);
2805 else if (PL_op->op_private & OPpDEREF)
2806 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2808 sv = (svp ? *svp : &PL_sv_undef);
2809 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2810 sv = sv_mortalcopy(sv);
2816 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2822 Perl_croak(aTHX_ PL_no_modify);
2823 if (SvTYPE(sv) < SVt_RV)
2824 sv_upgrade(sv, SVt_RV);
2825 else if (SvTYPE(sv) >= SVt_PV) {
2826 (void)SvOOK_off(sv);
2827 Safefree(SvPVX(sv));
2828 SvLEN(sv) = SvCUR(sv) = 0;
2832 SvRV(sv) = NEWSV(355,0);
2835 SvRV(sv) = (SV*)newAV();
2838 SvRV(sv) = (SV*)newHV();
2853 if (SvTYPE(rsv) == SVt_PVCV) {
2859 SETs(method_common(sv, Null(U32*)));
2866 SV* sv = cSVOP->op_sv;
2867 U32 hash = SvUVX(sv);
2869 XPUSHs(method_common(sv, &hash));
2874 S_method_common(pTHX_ SV* meth, U32* hashp)
2885 name = SvPV(meth, namelen);
2886 sv = *(PL_stack_base + TOPMARK + 1);
2889 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2900 !(packname = SvPV(sv, packlen)) ||
2901 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2902 !(ob=(SV*)GvIO(iogv)))
2905 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2906 ? !isIDFIRST_utf8((U8*)packname)
2907 : !isIDFIRST(*packname)
2910 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2911 SvOK(sv) ? "without a package or object reference"
2912 : "on an undefined value");
2914 stash = gv_stashpvn(packname, packlen, TRUE);
2917 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2920 if (!ob || !(SvOBJECT(ob)
2921 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2924 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2928 stash = SvSTASH(ob);
2931 /* shortcut for simple names */
2933 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2935 gv = (GV*)HeVAL(he);
2936 if (isGV(gv) && GvCV(gv) &&
2937 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2938 return (SV*)GvCV(gv);
2942 gv = gv_fetchmethod(stash, name);
2949 for (p = name; *p; p++) {
2951 sep = p, leaf = p + 1;
2952 else if (*p == ':' && *(p + 1) == ':')
2953 sep = p, leaf = p + 2;
2955 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2956 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2957 packlen = strlen(packname);
2961 packlen = sep - name;
2963 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2964 if (gv && isGV(gv)) {
2966 "Can't locate object method \"%s\" via package \"%s\"",
2971 "Can't locate object method \"%s\" via package \"%s\""
2972 " (perhaps you forgot to load \"%s\"?)",
2973 leaf, packname, packname);
2976 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2981 unset_cvowner(pTHXo_ void *cvarg)
2983 register CV* cv = (CV *) cvarg;
2986 #endif /* DEBUGGING */
2988 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2989 thr, cv, SvPEEK((SV*)cv))));
2990 MUTEX_LOCK(CvMUTEXP(cv));
2991 DEBUG_S(if (CvDEPTH(cv) != 0)
2992 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2994 assert(thr == CvOWNER(cv));
2996 MUTEX_UNLOCK(CvMUTEXP(cv));
2999 #endif /* USE_THREADS */