3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
25 static void unset_cvowner(pTHXo_ void *cvarg);
26 #endif /* USE_THREADS */
37 PL_curcop = (COP*)PL_op;
38 TAINT_NOT; /* Each statement is presumed innocent */
39 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
48 if (PL_op->op_private & OPpLVAL_INTRO)
49 PUSHs(save_scalar(cGVOP_gv));
51 PUSHs(GvSV(cGVOP_gv));
62 PL_curcop = (COP*)PL_op;
68 PUSHMARK(PL_stack_sp);
78 sv_setpvn(TARG,s,len);
79 if (SvUTF8(TOPs) && !IN_BYTE)
88 XPUSHs((SV*)cGVOP_gv);
99 RETURNOP(cLOGOP->op_other);
107 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
109 temp = left; left = right; right = temp;
111 if (PL_tainting && PL_tainted && !SvTAINTED(left))
113 SvSetMagicSV(right, left);
122 RETURNOP(cLOGOP->op_other);
124 RETURNOP(cLOGOP->op_next);
130 TAINT_NOT; /* Each statement is presumed innocent */
131 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
133 oldsave = PL_scopestack[PL_scopestack_ix - 1];
134 LEAVE_SCOPE(oldsave);
140 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
148 if (TARG == right && SvGMAGICAL(right))
150 if (SvGMAGICAL(left))
153 left_utf = DO_UTF8(left);
154 right_utf = DO_UTF8(right);
156 if (left_utf != right_utf) {
157 if (TARG == right && !right_utf) {
158 sv_utf8_upgrade(TARG); /* Now straight binary copy */
162 /* Set TARG to PV(left), then add right */
163 U8 *l, *c, *olds = NULL;
165 s = (U8*)SvPV(right,len);
166 right_utf |= DO_UTF8(right);
168 /* Take a copy since we're about to overwrite TARG */
169 olds = s = (U8*)savepvn((char*)s, len);
171 if (!SvOK(left) && SvTYPE(left) <= SVt_PVMG) {
172 if (SvREADONLY(left))
173 left = sv_2mortal(newSVsv(left));
175 sv_setpv(left, ""); /* Suppress warning. */
177 l = (U8*)SvPV(left, targlen);
178 left_utf |= DO_UTF8(left);
180 sv_setpvn(TARG, (char*)l, targlen);
182 sv_utf8_upgrade(TARG);
183 /* Extend TARG to length of right (s) */
184 targlen = SvCUR(TARG) + len;
186 /* plus one for each hi-byte char if we have to upgrade */
187 for (c = s; c < s + len; c++) {
192 SvGROW(TARG, targlen+1);
193 /* And now copy, maybe upgrading right to UTF8 on the fly */
194 for (c = (U8*)SvEND(TARG); len--; s++) {
195 if (*s & 0x80 && !right_utf)
196 c = uv_to_utf8(c, *s);
200 SvCUR_set(TARG, targlen);
210 s = (U8*)SvPV(left,len);
212 sv_insert(TARG, 0, 0, (char*)s, len);
216 sv_setpvn(TARG, (char *)s, len);
218 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG)
219 sv_setpv(TARG, ""); /* Suppress warning. */
220 s = (U8*)SvPV(right,len);
222 #if defined(PERL_Y2KWARN)
223 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
225 char *s = SvPV(TARG,n);
226 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
227 && (n == 2 || !isDIGIT(s[n-3])))
229 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
230 "about to append an integer to '19'");
234 sv_catpvn(TARG, (char *)s, len);
237 sv_setpvn(TARG, (char *)s, len); /* suppress warning */
249 if (PL_op->op_flags & OPf_MOD) {
250 if (PL_op->op_private & OPpLVAL_INTRO)
251 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
252 else if (PL_op->op_private & OPpDEREF) {
254 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
263 tryAMAGICunTARGET(iter, 0);
264 PL_last_in_gv = (GV*)(*PL_stack_sp--);
265 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
266 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
267 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
270 XPUSHs((SV*)PL_last_in_gv);
273 PL_last_in_gv = (GV*)(*PL_stack_sp--);
276 return do_readline();
281 djSP; tryAMAGICbinSET(eq,0);
284 SETs(boolSV(TOPn == value));
292 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
293 DIE(aTHX_ PL_no_modify);
294 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
295 SvIVX(TOPs) != IV_MAX)
298 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
313 RETURNOP(cLOGOP->op_other);
319 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
322 SETn( left + right );
330 AV *av = GvAV(cGVOP_gv);
331 U32 lval = PL_op->op_flags & OPf_MOD;
332 SV** svp = av_fetch(av, PL_op->op_private, lval);
333 SV *sv = (svp ? *svp : &PL_sv_undef);
335 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
336 sv = sv_mortalcopy(sv);
343 djSP; dMARK; dTARGET;
345 do_join(TARG, *MARK, MARK, SP);
356 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
357 * will be enough to hold an OP*.
359 SV* sv = sv_newmortal();
360 sv_upgrade(sv, SVt_PVLV);
362 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
370 /* Oversized hot code. */
374 djSP; dMARK; dORIGMARK;
381 if (PL_op->op_flags & OPf_STACKED)
385 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
387 if (MARK == ORIGMARK) {
388 /* If using default handle then we need to make space to
389 * pass object as 1st arg, so move other args up ...
393 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
397 *MARK = SvTIED_obj((SV*)gv, mg);
400 call_method("PRINT", G_SCALAR);
408 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);
1341 IoTYPE(io) = IoTYPE_RDONLY;
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) == IoTYPE_WRONLY || 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)
1415 && (!io || !(IoFLAGS(io) & IOf_START))) {
1416 if (type == OP_GLOB)
1417 Perl_warner(aTHX_ WARN_GLOB,
1418 "glob failed (can't start child: %s)",
1421 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1423 if (gimme == G_SCALAR) {
1424 (void)SvOK_off(TARG);
1430 if (gimme == G_SCALAR) {
1434 (void)SvUPGRADE(sv, SVt_PV);
1435 tmplen = SvLEN(sv); /* remember if already alloced */
1437 Sv_Grow(sv, 80); /* try short-buffering it */
1438 if (type == OP_RCATLINE)
1444 sv = sv_2mortal(NEWSV(57, 80));
1448 /* This should not be marked tainted if the fp is marked clean */
1449 #define MAYBE_TAINT_LINE(io, sv) \
1450 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1455 /* delay EOF state for a snarfed empty file */
1456 #define SNARF_EOF(gimme,rs,io,sv) \
1457 (gimme != G_SCALAR || SvCUR(sv) \
1458 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1461 if (!sv_gets(sv, fp, offset)
1462 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1464 PerlIO_clearerr(fp);
1465 if (IoFLAGS(io) & IOf_ARGV) {
1466 fp = nextargv(PL_last_in_gv);
1469 (void)do_close(PL_last_in_gv, FALSE);
1471 else if (type == OP_GLOB) {
1472 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1473 Perl_warner(aTHX_ WARN_GLOB,
1474 "glob failed (child exited with status %d%s)",
1475 (int)(STATUS_CURRENT >> 8),
1476 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1479 if (gimme == G_SCALAR) {
1480 (void)SvOK_off(TARG);
1483 MAYBE_TAINT_LINE(io, sv);
1486 MAYBE_TAINT_LINE(io, sv);
1488 IoFLAGS(io) |= IOf_NOLINE;
1491 if (type == OP_GLOB) {
1494 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1495 tmps = SvEND(sv) - 1;
1496 if (*tmps == *SvPVX(PL_rs)) {
1501 for (tmps = SvPVX(sv); *tmps; tmps++)
1502 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1503 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1505 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1506 (void)POPs; /* Unmatched wildcard? Chuck it... */
1510 if (gimme == G_ARRAY) {
1511 if (SvLEN(sv) - SvCUR(sv) > 20) {
1512 SvLEN_set(sv, SvCUR(sv)+1);
1513 Renew(SvPVX(sv), SvLEN(sv), char);
1515 sv = sv_2mortal(NEWSV(58, 80));
1518 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1519 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1523 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1524 Renew(SvPVX(sv), SvLEN(sv), char);
1533 register PERL_CONTEXT *cx;
1534 I32 gimme = OP_GIMME(PL_op, -1);
1537 if (cxstack_ix >= 0)
1538 gimme = cxstack[cxstack_ix].blk_gimme;
1546 PUSHBLOCK(cx, CXt_BLOCK, SP);
1558 U32 lval = PL_op->op_flags & OPf_MOD;
1559 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1561 U32 hash = (SvFAKE(keysv) && SvREADONLY(keysv)) ? SvUVX(keysv) : 0;
1563 if (SvTYPE(hv) == SVt_PVHV) {
1564 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1565 svp = he ? &HeVAL(he) : 0;
1567 else if (SvTYPE(hv) == SVt_PVAV) {
1568 if (PL_op->op_private & OPpLVAL_INTRO)
1569 DIE(aTHX_ "Can't localize pseudo-hash element");
1570 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, hash);
1576 if (!svp || *svp == &PL_sv_undef) {
1581 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1583 lv = sv_newmortal();
1584 sv_upgrade(lv, SVt_PVLV);
1586 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1587 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1588 LvTARG(lv) = SvREFCNT_inc(hv);
1593 if (PL_op->op_private & OPpLVAL_INTRO) {
1594 if (HvNAME(hv) && isGV(*svp))
1595 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1597 save_helem(hv, keysv, svp);
1599 else if (PL_op->op_private & OPpDEREF)
1600 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1602 sv = (svp ? *svp : &PL_sv_undef);
1603 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1604 * Pushing the magical RHS on to the stack is useless, since
1605 * that magic is soon destined to be misled by the local(),
1606 * and thus the later pp_sassign() will fail to mg_get() the
1607 * old value. This should also cure problems with delayed
1608 * mg_get()s. GSAR 98-07-03 */
1609 if (!lval && SvGMAGICAL(sv))
1610 sv = sv_mortalcopy(sv);
1618 register PERL_CONTEXT *cx;
1624 if (PL_op->op_flags & OPf_SPECIAL) {
1625 cx = &cxstack[cxstack_ix];
1626 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1631 gimme = OP_GIMME(PL_op, -1);
1633 if (cxstack_ix >= 0)
1634 gimme = cxstack[cxstack_ix].blk_gimme;
1640 if (gimme == G_VOID)
1642 else if (gimme == G_SCALAR) {
1645 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1648 *MARK = sv_mortalcopy(TOPs);
1651 *MARK = &PL_sv_undef;
1655 else if (gimme == G_ARRAY) {
1656 /* in case LEAVE wipes old return values */
1657 for (mark = newsp + 1; mark <= SP; mark++) {
1658 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1659 *mark = sv_mortalcopy(*mark);
1660 TAINT_NOT; /* Each item is independent */
1664 PL_curpm = newpm; /* Don't pop $1 et al till now */
1674 register PERL_CONTEXT *cx;
1680 cx = &cxstack[cxstack_ix];
1681 if (CxTYPE(cx) != CXt_LOOP)
1682 DIE(aTHX_ "panic: pp_iter");
1684 itersvp = CxITERVAR(cx);
1685 av = cx->blk_loop.iterary;
1686 if (SvTYPE(av) != SVt_PVAV) {
1687 /* iterate ($min .. $max) */
1688 if (cx->blk_loop.iterlval) {
1689 /* string increment */
1690 register SV* cur = cx->blk_loop.iterlval;
1692 char *max = SvPV((SV*)av, maxlen);
1693 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1694 #ifndef USE_THREADS /* don't risk potential race */
1695 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1696 /* safe to reuse old SV */
1697 sv_setsv(*itersvp, cur);
1702 /* we need a fresh SV every time so that loop body sees a
1703 * completely new SV for closures/references to work as
1705 SvREFCNT_dec(*itersvp);
1706 *itersvp = newSVsv(cur);
1708 if (strEQ(SvPVX(cur), max))
1709 sv_setiv(cur, 0); /* terminate next time */
1716 /* integer increment */
1717 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1720 #ifndef USE_THREADS /* don't risk potential race */
1721 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1722 /* safe to reuse old SV */
1723 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1728 /* we need a fresh SV every time so that loop body sees a
1729 * completely new SV for closures/references to work as they
1731 SvREFCNT_dec(*itersvp);
1732 *itersvp = newSViv(cx->blk_loop.iterix++);
1738 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1741 SvREFCNT_dec(*itersvp);
1743 if ((sv = SvMAGICAL(av)
1744 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1745 : AvARRAY(av)[++cx->blk_loop.iterix]))
1749 if (av != PL_curstack && SvIMMORTAL(sv)) {
1750 SV *lv = cx->blk_loop.iterlval;
1751 if (lv && SvREFCNT(lv) > 1) {
1756 SvREFCNT_dec(LvTARG(lv));
1758 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1759 sv_upgrade(lv, SVt_PVLV);
1761 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1763 LvTARG(lv) = SvREFCNT_inc(av);
1764 LvTARGOFF(lv) = cx->blk_loop.iterix;
1765 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1769 *itersvp = SvREFCNT_inc(sv);
1776 register PMOP *pm = cPMOP;
1792 register REGEXP *rx = pm->op_pmregexp;
1794 int force_on_match = 0;
1795 I32 oldsave = PL_savestack_ix;
1797 /* known replacement string? */
1798 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1799 if (PL_op->op_flags & OPf_STACKED)
1805 if (SvFAKE(TARG) && SvREADONLY(TARG))
1806 sv_force_normal(TARG);
1807 if (SvREADONLY(TARG)
1808 || (SvTYPE(TARG) > SVt_PVLV
1809 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1810 DIE(aTHX_ PL_no_modify);
1813 s = SvPV(TARG, len);
1814 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1816 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1817 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1824 DIE(aTHX_ "panic: do_subst");
1827 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1828 position, once with zero-length,
1829 second time with non-zero. */
1831 if (!rx->prelen && PL_curpm) {
1833 rx = pm->op_pmregexp;
1835 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1836 ? REXEC_COPY_STR : 0;
1838 r_flags |= REXEC_SCREAM;
1839 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1840 SAVEINT(PL_multiline);
1841 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1844 if (rx->reganch & RE_USE_INTUIT) {
1845 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1849 /* How to do it in subst? */
1850 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1852 && ((rx->reganch & ROPT_NOSCAN)
1853 || !((rx->reganch & RE_INTUIT_TAIL)
1854 && (r_flags & REXEC_SCREAM))))
1859 /* only replace once? */
1860 once = !(rpm->op_pmflags & PMf_GLOBAL);
1862 /* known replacement string? */
1863 c = dstr ? SvPV(dstr, clen) : Nullch;
1865 /* can do inplace substitution? */
1866 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1867 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1868 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1869 r_flags | REXEC_CHECKED))
1873 LEAVE_SCOPE(oldsave);
1876 if (force_on_match) {
1878 s = SvPV_force(TARG, len);
1883 SvSCREAM_off(TARG); /* disable possible screamer */
1885 rxtainted |= RX_MATCH_TAINTED(rx);
1886 m = orig + rx->startp[0];
1887 d = orig + rx->endp[0];
1889 if (m - s > strend - d) { /* faster to shorten from end */
1891 Copy(c, m, clen, char);
1896 Move(d, m, i, char);
1900 SvCUR_set(TARG, m - s);
1903 else if ((i = m - s)) { /* faster from front */
1911 Copy(c, m, clen, char);
1916 Copy(c, d, clen, char);
1921 TAINT_IF(rxtainted & 1);
1927 if (iters++ > maxiters)
1928 DIE(aTHX_ "Substitution loop");
1929 rxtainted |= RX_MATCH_TAINTED(rx);
1930 m = rx->startp[0] + orig;
1934 Move(s, d, i, char);
1938 Copy(c, d, clen, char);
1941 s = rx->endp[0] + orig;
1942 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1944 /* don't match same null twice */
1945 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1948 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1949 Move(s, d, i+1, char); /* include the NUL */
1951 TAINT_IF(rxtainted & 1);
1953 PUSHs(sv_2mortal(newSViv((I32)iters)));
1955 (void)SvPOK_only_UTF8(TARG);
1956 TAINT_IF(rxtainted);
1957 if (SvSMAGICAL(TARG)) {
1963 LEAVE_SCOPE(oldsave);
1967 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1968 r_flags | REXEC_CHECKED))
1970 if (force_on_match) {
1972 s = SvPV_force(TARG, len);
1975 rxtainted |= RX_MATCH_TAINTED(rx);
1976 dstr = NEWSV(25, len);
1977 sv_setpvn(dstr, m, s-m);
1980 register PERL_CONTEXT *cx;
1983 RETURNOP(cPMOP->op_pmreplroot);
1985 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1987 if (iters++ > maxiters)
1988 DIE(aTHX_ "Substitution loop");
1989 rxtainted |= RX_MATCH_TAINTED(rx);
1990 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1995 strend = s + (strend - m);
1997 m = rx->startp[0] + orig;
1998 sv_catpvn(dstr, s, m-s);
1999 s = rx->endp[0] + orig;
2001 sv_catpvn(dstr, c, clen);
2004 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
2005 sv_catpvn(dstr, s, strend - s);
2007 (void)SvOOK_off(TARG);
2008 Safefree(SvPVX(TARG));
2009 SvPVX(TARG) = SvPVX(dstr);
2010 SvCUR_set(TARG, SvCUR(dstr));
2011 SvLEN_set(TARG, SvLEN(dstr));
2015 TAINT_IF(rxtainted & 1);
2017 PUSHs(sv_2mortal(newSViv((I32)iters)));
2019 (void)SvPOK_only(TARG);
2020 TAINT_IF(rxtainted);
2023 LEAVE_SCOPE(oldsave);
2032 LEAVE_SCOPE(oldsave);
2041 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2042 ++*PL_markstack_ptr;
2043 LEAVE; /* exit inner scope */
2046 if (PL_stack_base + *PL_markstack_ptr > SP) {
2048 I32 gimme = GIMME_V;
2050 LEAVE; /* exit outer scope */
2051 (void)POPMARK; /* pop src */
2052 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2053 (void)POPMARK; /* pop dst */
2054 SP = PL_stack_base + POPMARK; /* pop original mark */
2055 if (gimme == G_SCALAR) {
2059 else if (gimme == G_ARRAY)
2066 ENTER; /* enter inner scope */
2069 src = PL_stack_base[*PL_markstack_ptr];
2073 RETURNOP(cLOGOP->op_other);
2084 register PERL_CONTEXT *cx;
2090 if (gimme == G_SCALAR) {
2093 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2095 *MARK = SvREFCNT_inc(TOPs);
2100 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2102 *MARK = sv_mortalcopy(sv);
2107 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2111 *MARK = &PL_sv_undef;
2115 else if (gimme == G_ARRAY) {
2116 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2117 if (!SvTEMP(*MARK)) {
2118 *MARK = sv_mortalcopy(*MARK);
2119 TAINT_NOT; /* Each item is independent */
2125 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2126 PL_curpm = newpm; /* ... and pop $1 et al */
2130 return pop_return();
2133 /* This duplicates the above code because the above code must not
2134 * get any slower by more conditions */
2142 register PERL_CONTEXT *cx;
2149 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2150 /* We are an argument to a function or grep().
2151 * This kind of lvalueness was legal before lvalue
2152 * subroutines too, so be backward compatible:
2153 * cannot report errors. */
2155 /* Scalar context *is* possible, on the LHS of -> only,
2156 * as in f()->meth(). But this is not an lvalue. */
2157 if (gimme == G_SCALAR)
2159 if (gimme == G_ARRAY) {
2160 if (!CvLVALUE(cx->blk_sub.cv))
2161 goto temporise_array;
2162 EXTEND_MORTAL(SP - newsp);
2163 for (mark = newsp + 1; mark <= SP; mark++) {
2166 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2167 *mark = sv_mortalcopy(*mark);
2169 /* Can be a localized value subject to deletion. */
2170 PL_tmps_stack[++PL_tmps_ix] = *mark;
2171 (void)SvREFCNT_inc(*mark);
2176 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2177 /* Here we go for robustness, not for speed, so we change all
2178 * the refcounts so the caller gets a live guy. Cannot set
2179 * TEMP, so sv_2mortal is out of question. */
2180 if (!CvLVALUE(cx->blk_sub.cv)) {
2185 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2187 if (gimme == G_SCALAR) {
2191 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2196 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2197 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2199 else { /* Can be a localized value
2200 * subject to deletion. */
2201 PL_tmps_stack[++PL_tmps_ix] = *mark;
2202 (void)SvREFCNT_inc(*mark);
2205 else { /* Should not happen? */
2210 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2211 (MARK > SP ? "Empty array" : "Array"));
2215 else if (gimme == G_ARRAY) {
2216 EXTEND_MORTAL(SP - newsp);
2217 for (mark = newsp + 1; mark <= SP; mark++) {
2218 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2219 /* Might be flattened array after $#array = */
2225 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2226 (*mark != &PL_sv_undef)
2228 ? "a readonly value" : "a temporary")
2229 : "an uninitialized value");
2232 /* Can be a localized value subject to deletion. */
2233 PL_tmps_stack[++PL_tmps_ix] = *mark;
2234 (void)SvREFCNT_inc(*mark);
2240 if (gimme == G_SCALAR) {
2244 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2246 *MARK = SvREFCNT_inc(TOPs);
2251 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2253 *MARK = sv_mortalcopy(sv);
2258 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2262 *MARK = &PL_sv_undef;
2266 else if (gimme == G_ARRAY) {
2268 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2269 if (!SvTEMP(*MARK)) {
2270 *MARK = sv_mortalcopy(*MARK);
2271 TAINT_NOT; /* Each item is independent */
2278 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2279 PL_curpm = newpm; /* ... and pop $1 et al */
2283 return pop_return();
2288 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2290 SV *dbsv = GvSV(PL_DBsub);
2292 if (!PERLDB_SUB_NN) {
2296 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2297 || strEQ(GvNAME(gv), "END")
2298 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2299 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2300 && (gv = (GV*)*svp) ))) {
2301 /* Use GV from the stack as a fallback. */
2302 /* GV is potentially non-unique, or contain different CV. */
2303 SV *tmp = newRV((SV*)cv);
2304 sv_setsv(dbsv, tmp);
2308 gv_efullname3(dbsv, gv, Nullch);
2312 (void)SvUPGRADE(dbsv, SVt_PVIV);
2313 (void)SvIOK_on(dbsv);
2314 SAVEIV(SvIVX(dbsv));
2315 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2319 PL_curcopdb = PL_curcop;
2320 cv = GvCV(PL_DBsub);
2330 register PERL_CONTEXT *cx;
2332 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2335 DIE(aTHX_ "Not a CODE reference");
2336 switch (SvTYPE(sv)) {
2342 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2344 SP = PL_stack_base + POPMARK;
2347 if (SvGMAGICAL(sv)) {
2349 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2352 sym = SvPV(sv, n_a);
2354 DIE(aTHX_ PL_no_usym, "a subroutine");
2355 if (PL_op->op_private & HINT_STRICT_REFS)
2356 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2357 cv = get_cv(sym, TRUE);
2361 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2362 tryAMAGICunDEREF(to_cv);
2365 if (SvTYPE(cv) == SVt_PVCV)
2370 DIE(aTHX_ "Not a CODE reference");
2375 if (!(cv = GvCVu((GV*)sv)))
2376 cv = sv_2cv(sv, &stash, &gv, FALSE);
2389 if (!CvROOT(cv) && !CvXSUB(cv)) {
2393 /* anonymous or undef'd function leaves us no recourse */
2394 if (CvANON(cv) || !(gv = CvGV(cv)))
2395 DIE(aTHX_ "Undefined subroutine called");
2397 /* autoloaded stub? */
2398 if (cv != GvCV(gv)) {
2401 /* should call AUTOLOAD now? */
2404 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2411 sub_name = sv_newmortal();
2412 gv_efullname3(sub_name, gv, Nullch);
2413 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2417 DIE(aTHX_ "Not a CODE reference");
2422 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2423 cv = get_db_sub(&sv, cv);
2425 DIE(aTHX_ "No DBsub routine");
2430 * First we need to check if the sub or method requires locking.
2431 * If so, we gain a lock on the CV, the first argument or the
2432 * stash (for static methods), as appropriate. This has to be
2433 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2434 * reschedule by returning a new op.
2436 MUTEX_LOCK(CvMUTEXP(cv));
2437 if (CvFLAGS(cv) & CVf_LOCKED) {
2439 if (CvFLAGS(cv) & CVf_METHOD) {
2440 if (SP > PL_stack_base + TOPMARK)
2441 sv = *(PL_stack_base + TOPMARK + 1);
2443 AV *av = (AV*)PL_curpad[0];
2444 if (hasargs || !av || AvFILLp(av) < 0
2445 || !(sv = AvARRAY(av)[0]))
2447 MUTEX_UNLOCK(CvMUTEXP(cv));
2448 DIE(aTHX_ "no argument for locked method call");
2455 char *stashname = SvPV(sv, len);
2456 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2462 MUTEX_UNLOCK(CvMUTEXP(cv));
2463 mg = condpair_magic(sv);
2464 MUTEX_LOCK(MgMUTEXP(mg));
2465 if (MgOWNER(mg) == thr)
2466 MUTEX_UNLOCK(MgMUTEXP(mg));
2469 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2471 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2473 MUTEX_UNLOCK(MgMUTEXP(mg));
2474 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2476 MUTEX_LOCK(CvMUTEXP(cv));
2479 * Now we have permission to enter the sub, we must distinguish
2480 * four cases. (0) It's an XSUB (in which case we don't care
2481 * about ownership); (1) it's ours already (and we're recursing);
2482 * (2) it's free (but we may already be using a cached clone);
2483 * (3) another thread owns it. Case (1) is easy: we just use it.
2484 * Case (2) means we look for a clone--if we have one, use it
2485 * otherwise grab ownership of cv. Case (3) means we look for a
2486 * clone (for non-XSUBs) and have to create one if we don't
2488 * Why look for a clone in case (2) when we could just grab
2489 * ownership of cv straight away? Well, we could be recursing,
2490 * i.e. we originally tried to enter cv while another thread
2491 * owned it (hence we used a clone) but it has been freed up
2492 * and we're now recursing into it. It may or may not be "better"
2493 * to use the clone but at least CvDEPTH can be trusted.
2495 if (CvOWNER(cv) == thr || CvXSUB(cv))
2496 MUTEX_UNLOCK(CvMUTEXP(cv));
2498 /* Case (2) or (3) */
2502 * XXX Might it be better to release CvMUTEXP(cv) while we
2503 * do the hv_fetch? We might find someone has pinched it
2504 * when we look again, in which case we would be in case
2505 * (3) instead of (2) so we'd have to clone. Would the fact
2506 * that we released the mutex more quickly make up for this?
2508 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2510 /* We already have a clone to use */
2511 MUTEX_UNLOCK(CvMUTEXP(cv));
2513 DEBUG_S(PerlIO_printf(Perl_debug_log,
2514 "entersub: %p already has clone %p:%s\n",
2515 thr, cv, SvPEEK((SV*)cv)));
2518 if (CvDEPTH(cv) == 0)
2519 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2522 /* (2) => grab ownership of cv. (3) => make clone */
2526 MUTEX_UNLOCK(CvMUTEXP(cv));
2527 DEBUG_S(PerlIO_printf(Perl_debug_log,
2528 "entersub: %p grabbing %p:%s in stash %s\n",
2529 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2530 HvNAME(CvSTASH(cv)) : "(none)"));
2533 /* Make a new clone. */
2535 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2536 MUTEX_UNLOCK(CvMUTEXP(cv));
2537 DEBUG_S((PerlIO_printf(Perl_debug_log,
2538 "entersub: %p cloning %p:%s\n",
2539 thr, cv, SvPEEK((SV*)cv))));
2541 * We're creating a new clone so there's no race
2542 * between the original MUTEX_UNLOCK and the
2543 * SvREFCNT_inc since no one will be trying to undef
2544 * it out from underneath us. At least, I don't think
2547 clonecv = cv_clone(cv);
2548 SvREFCNT_dec(cv); /* finished with this */
2549 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2550 CvOWNER(clonecv) = thr;
2554 DEBUG_S(if (CvDEPTH(cv) != 0)
2555 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2557 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2560 #endif /* USE_THREADS */
2563 #ifdef PERL_XSUB_OLDSTYLE
2564 if (CvOLDSTYLE(cv)) {
2565 I32 (*fp3)(int,int,int);
2567 register I32 items = SP - MARK;
2568 /* We dont worry to copy from @_. */
2573 PL_stack_sp = mark + 1;
2574 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2575 items = (*fp3)(CvXSUBANY(cv).any_i32,
2576 MARK - PL_stack_base + 1,
2578 PL_stack_sp = PL_stack_base + items;
2581 #endif /* PERL_XSUB_OLDSTYLE */
2583 I32 markix = TOPMARK;
2588 /* Need to copy @_ to stack. Alternative may be to
2589 * switch stack to @_, and copy return values
2590 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2594 av = (AV*)PL_curpad[0];
2596 av = GvAV(PL_defgv);
2597 #endif /* USE_THREADS */
2598 items = AvFILLp(av) + 1; /* @_ is not tieable */
2601 /* Mark is at the end of the stack. */
2603 Copy(AvARRAY(av), SP + 1, items, SV*);
2608 /* We assume first XSUB in &DB::sub is the called one. */
2610 SAVEVPTR(PL_curcop);
2611 PL_curcop = PL_curcopdb;
2614 /* Do we need to open block here? XXXX */
2615 (void)(*CvXSUB(cv))(aTHXo_ cv);
2617 /* Enforce some sanity in scalar context. */
2618 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2619 if (markix > PL_stack_sp - PL_stack_base)
2620 *(PL_stack_base + markix) = &PL_sv_undef;
2622 *(PL_stack_base + markix) = *PL_stack_sp;
2623 PL_stack_sp = PL_stack_base + markix;
2631 register I32 items = SP - MARK;
2632 AV* padlist = CvPADLIST(cv);
2633 SV** svp = AvARRAY(padlist);
2634 push_return(PL_op->op_next);
2635 PUSHBLOCK(cx, CXt_SUB, MARK);
2638 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2639 * that eval'' ops within this sub know the correct lexical space.
2640 * Owing the speed considerations, we choose to search for the cv
2641 * in doeval() instead.
2643 if (CvDEPTH(cv) < 2)
2644 (void)SvREFCNT_inc(cv);
2645 else { /* save temporaries on recursion? */
2646 PERL_STACK_OVERFLOW_CHECK();
2647 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2649 AV *newpad = newAV();
2650 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2651 I32 ix = AvFILLp((AV*)svp[1]);
2652 I32 names_fill = AvFILLp((AV*)svp[0]);
2653 svp = AvARRAY(svp[0]);
2654 for ( ;ix > 0; ix--) {
2655 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2656 char *name = SvPVX(svp[ix]);
2657 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2658 || *name == '&') /* anonymous code? */
2660 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2662 else { /* our own lexical */
2664 av_store(newpad, ix, sv = (SV*)newAV());
2665 else if (*name == '%')
2666 av_store(newpad, ix, sv = (SV*)newHV());
2668 av_store(newpad, ix, sv = NEWSV(0,0));
2672 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2673 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2676 av_store(newpad, ix, sv = NEWSV(0,0));
2680 av = newAV(); /* will be @_ */
2682 av_store(newpad, 0, (SV*)av);
2683 AvFLAGS(av) = AVf_REIFY;
2684 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2685 AvFILLp(padlist) = CvDEPTH(cv);
2686 svp = AvARRAY(padlist);
2691 AV* av = (AV*)PL_curpad[0];
2693 items = AvFILLp(av) + 1;
2695 /* Mark is at the end of the stack. */
2697 Copy(AvARRAY(av), SP + 1, items, SV*);
2702 #endif /* USE_THREADS */
2703 SAVEVPTR(PL_curpad);
2704 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2707 #endif /* USE_THREADS */
2713 DEBUG_S(PerlIO_printf(Perl_debug_log,
2714 "%p entersub preparing @_\n", thr));
2716 av = (AV*)PL_curpad[0];
2718 /* @_ is normally not REAL--this should only ever
2719 * happen when DB::sub() calls things that modify @_ */
2725 cx->blk_sub.savearray = GvAV(PL_defgv);
2726 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2727 #endif /* USE_THREADS */
2728 cx->blk_sub.oldcurpad = PL_curpad;
2729 cx->blk_sub.argarray = av;
2732 if (items > AvMAX(av) + 1) {
2734 if (AvARRAY(av) != ary) {
2735 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2736 SvPVX(av) = (char*)ary;
2738 if (items > AvMAX(av) + 1) {
2739 AvMAX(av) = items - 1;
2740 Renew(ary,items,SV*);
2742 SvPVX(av) = (char*)ary;
2745 Copy(MARK,AvARRAY(av),items,SV*);
2746 AvFILLp(av) = items - 1;
2754 /* warning must come *after* we fully set up the context
2755 * stuff so that __WARN__ handlers can safely dounwind()
2758 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2759 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2760 sub_crush_depth(cv);
2762 DEBUG_S(PerlIO_printf(Perl_debug_log,
2763 "%p entersub returning %p\n", thr, CvSTART(cv)));
2765 RETURNOP(CvSTART(cv));
2770 Perl_sub_crush_depth(pTHX_ CV *cv)
2773 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2775 SV* tmpstr = sv_newmortal();
2776 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2777 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2788 U32 lval = PL_op->op_flags & OPf_MOD;
2789 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2793 elem -= PL_curcop->cop_arybase;
2794 if (SvTYPE(av) != SVt_PVAV)
2796 svp = av_fetch(av, elem, lval && !defer);
2798 if (!svp || *svp == &PL_sv_undef) {
2801 DIE(aTHX_ PL_no_aelem, elem);
2802 lv = sv_newmortal();
2803 sv_upgrade(lv, SVt_PVLV);
2805 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2806 LvTARG(lv) = SvREFCNT_inc(av);
2807 LvTARGOFF(lv) = elem;
2812 if (PL_op->op_private & OPpLVAL_INTRO)
2813 save_aelem(av, elem, svp);
2814 else if (PL_op->op_private & OPpDEREF)
2815 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2817 sv = (svp ? *svp : &PL_sv_undef);
2818 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2819 sv = sv_mortalcopy(sv);
2825 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2831 Perl_croak(aTHX_ PL_no_modify);
2832 if (SvTYPE(sv) < SVt_RV)
2833 sv_upgrade(sv, SVt_RV);
2834 else if (SvTYPE(sv) >= SVt_PV) {
2835 (void)SvOOK_off(sv);
2836 Safefree(SvPVX(sv));
2837 SvLEN(sv) = SvCUR(sv) = 0;
2841 SvRV(sv) = NEWSV(355,0);
2844 SvRV(sv) = (SV*)newAV();
2847 SvRV(sv) = (SV*)newHV();
2862 if (SvTYPE(rsv) == SVt_PVCV) {
2868 SETs(method_common(sv, Null(U32*)));
2875 SV* sv = cSVOP->op_sv;
2876 U32 hash = SvUVX(sv);
2878 XPUSHs(method_common(sv, &hash));
2883 S_method_common(pTHX_ SV* meth, U32* hashp)
2894 name = SvPV(meth, namelen);
2895 sv = *(PL_stack_base + TOPMARK + 1);
2898 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2909 !(packname = SvPV(sv, packlen)) ||
2910 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2911 !(ob=(SV*)GvIO(iogv)))
2914 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2915 ? !isIDFIRST_utf8((U8*)packname)
2916 : !isIDFIRST(*packname)
2919 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2920 SvOK(sv) ? "without a package or object reference"
2921 : "on an undefined value");
2923 stash = gv_stashpvn(packname, packlen, TRUE);
2926 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2929 if (!ob || !(SvOBJECT(ob)
2930 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2933 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2937 stash = SvSTASH(ob);
2940 /* shortcut for simple names */
2942 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2944 gv = (GV*)HeVAL(he);
2945 if (isGV(gv) && GvCV(gv) &&
2946 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2947 return (SV*)GvCV(gv);
2951 gv = gv_fetchmethod(stash, name);
2958 for (p = name; *p; p++) {
2960 sep = p, leaf = p + 1;
2961 else if (*p == ':' && *(p + 1) == ':')
2962 sep = p, leaf = p + 2;
2964 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2965 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2966 packlen = strlen(packname);
2970 packlen = sep - name;
2972 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2973 if (gv && isGV(gv)) {
2975 "Can't locate object method \"%s\" via package \"%s\"",
2980 "Can't locate object method \"%s\" via package \"%s\""
2981 " (perhaps you forgot to load \"%s\"?)",
2982 leaf, packname, packname);
2985 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2990 unset_cvowner(pTHXo_ void *cvarg)
2992 register CV* cv = (CV *) cvarg;
2994 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2995 thr, cv, SvPEEK((SV*)cv))));
2996 MUTEX_LOCK(CvMUTEXP(cv));
2997 DEBUG_S(if (CvDEPTH(cv) != 0)
2998 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
3000 assert(thr == CvOWNER(cv));
3002 MUTEX_UNLOCK(CvMUTEXP(cv));
3005 #endif /* USE_THREADS */