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_utf8 = DO_UTF8(left);
154 right_utf8 = DO_UTF8(right);
156 if (left_utf8 != right_utf8) {
157 if (TARG == right && !right_utf8) {
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_utf8 |= 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_utf8 |= 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++) {
188 if (UTF8_IS_CONTINUED(*c))
192 SvGROW(TARG, targlen+1);
193 /* And now copy, maybe upgrading right to UTF8 on the fly */
195 Copy(s, SvEND(TARG), len, U8);
197 for (c = (U8*)SvEND(TARG); len--; s++)
198 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 report_evil_fh(gv, io, OP_phoney_INPUT_ONLY);
420 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
421 report_evil_fh(gv, io, PL_op->op_type);
423 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
430 if (!do_print(*MARK, fp))
434 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
443 if (!do_print(*MARK, fp))
452 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
455 if (IoFLAGS(io) & IOf_FLUSH)
456 if (PerlIO_flush(fp) == EOF)
477 tryAMAGICunDEREF(to_av);
480 if (SvTYPE(av) != SVt_PVAV)
481 DIE(aTHX_ "Not an ARRAY reference");
482 if (PL_op->op_flags & OPf_REF) {
488 if (SvTYPE(sv) == SVt_PVAV) {
490 if (PL_op->op_flags & OPf_REF) {
498 if (SvTYPE(sv) != SVt_PVGV) {
502 if (SvGMAGICAL(sv)) {
508 if (PL_op->op_flags & OPf_REF ||
509 PL_op->op_private & HINT_STRICT_REFS)
510 DIE(aTHX_ PL_no_usym, "an ARRAY");
511 if (ckWARN(WARN_UNINITIALIZED))
513 if (GIMME == G_ARRAY) {
520 if ((PL_op->op_flags & OPf_SPECIAL) &&
521 !(PL_op->op_flags & OPf_MOD))
523 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
525 && (!is_gv_magical(sym,len,0)
526 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
532 if (PL_op->op_private & HINT_STRICT_REFS)
533 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
534 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
541 if (PL_op->op_private & OPpLVAL_INTRO)
543 if (PL_op->op_flags & OPf_REF) {
550 if (GIMME == G_ARRAY) {
551 I32 maxarg = AvFILL(av) + 1;
552 (void)POPs; /* XXXX May be optimized away? */
554 if (SvRMAGICAL(av)) {
556 for (i=0; i < maxarg; i++) {
557 SV **svp = av_fetch(av, i, FALSE);
558 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
562 Copy(AvARRAY(av), SP+1, maxarg, SV*);
568 I32 maxarg = AvFILL(av) + 1;
581 tryAMAGICunDEREF(to_hv);
584 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
585 DIE(aTHX_ "Not a HASH reference");
586 if (PL_op->op_flags & OPf_REF) {
592 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
594 if (PL_op->op_flags & OPf_REF) {
602 if (SvTYPE(sv) != SVt_PVGV) {
606 if (SvGMAGICAL(sv)) {
612 if (PL_op->op_flags & OPf_REF ||
613 PL_op->op_private & HINT_STRICT_REFS)
614 DIE(aTHX_ PL_no_usym, "a HASH");
615 if (ckWARN(WARN_UNINITIALIZED))
617 if (GIMME == G_ARRAY) {
624 if ((PL_op->op_flags & OPf_SPECIAL) &&
625 !(PL_op->op_flags & OPf_MOD))
627 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
629 && (!is_gv_magical(sym,len,0)
630 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
636 if (PL_op->op_private & HINT_STRICT_REFS)
637 DIE(aTHX_ PL_no_symref, sym, "a HASH");
638 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
645 if (PL_op->op_private & OPpLVAL_INTRO)
647 if (PL_op->op_flags & OPf_REF) {
654 if (GIMME == G_ARRAY) { /* array wanted */
655 *PL_stack_sp = (SV*)hv;
660 if (SvTYPE(hv) == SVt_PVAV)
661 hv = avhv_keys((AV*)hv);
663 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
664 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
674 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
680 leftop = ((BINOP*)PL_op)->op_last;
682 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
683 leftop = ((LISTOP*)leftop)->op_first;
685 /* Skip PUSHMARK and each element already assigned to. */
686 for (i = lelem - firstlelem; i > 0; i--) {
687 leftop = leftop->op_sibling;
690 if (leftop->op_type != OP_RV2HV)
695 av_fill(ary, 0); /* clear all but the fields hash */
696 if (lastrelem >= relem) {
697 while (relem < lastrelem) { /* gobble up all the rest */
701 /* Avoid a memory leak when avhv_store_ent dies. */
702 tmpstr = sv_newmortal();
703 sv_setsv(tmpstr,relem[1]); /* value */
705 if (avhv_store_ent(ary,relem[0],tmpstr,0))
706 (void)SvREFCNT_inc(tmpstr);
707 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
713 if (relem == lastrelem)
719 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
723 if (ckWARN(WARN_MISC)) {
724 if (relem == firstrelem &&
726 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
727 SvTYPE(SvRV(*relem)) == SVt_PVHV))
729 Perl_warner(aTHX_ WARN_MISC,
730 "Reference found where even-sized list expected");
733 Perl_warner(aTHX_ WARN_MISC,
734 "Odd number of elements in hash assignment");
736 if (SvTYPE(hash) == SVt_PVAV) {
738 tmpstr = sv_newmortal();
739 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
740 (void)SvREFCNT_inc(tmpstr);
741 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
746 tmpstr = NEWSV(29,0);
747 didstore = hv_store_ent(hash,*relem,tmpstr,0);
748 if (SvMAGICAL(hash)) {
749 if (SvSMAGICAL(tmpstr))
762 SV **lastlelem = PL_stack_sp;
763 SV **lastrelem = PL_stack_base + POPMARK;
764 SV **firstrelem = PL_stack_base + POPMARK + 1;
765 SV **firstlelem = lastrelem + 1;
778 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
780 /* If there's a common identifier on both sides we have to take
781 * special care that assigning the identifier on the left doesn't
782 * clobber a value on the right that's used later in the list.
784 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
785 EXTEND_MORTAL(lastrelem - firstrelem + 1);
786 for (relem = firstrelem; relem <= lastrelem; relem++) {
789 TAINT_NOT; /* Each item is independent */
790 *relem = sv_mortalcopy(sv);
800 while (lelem <= lastlelem) {
801 TAINT_NOT; /* Each item stands on its own, taintwise. */
803 switch (SvTYPE(sv)) {
806 magic = SvMAGICAL(ary) != 0;
807 if (PL_op->op_private & OPpASSIGN_HASH) {
808 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
814 do_oddball((HV*)ary, relem, firstrelem);
816 relem = lastrelem + 1;
821 av_extend(ary, lastrelem - relem);
823 while (relem <= lastrelem) { /* gobble up all the rest */
829 didstore = av_store(ary,i++,sv);
839 case SVt_PVHV: { /* normal hash */
843 magic = SvMAGICAL(hash) != 0;
846 while (relem < lastrelem) { /* gobble up all the rest */
851 sv = &PL_sv_no, relem++;
852 tmpstr = NEWSV(29,0);
854 sv_setsv(tmpstr,*relem); /* value */
856 didstore = hv_store_ent(hash,sv,tmpstr,0);
858 if (SvSMAGICAL(tmpstr))
865 if (relem == lastrelem) {
866 do_oddball(hash, relem, firstrelem);
872 if (SvIMMORTAL(sv)) {
873 if (relem <= lastrelem)
877 if (relem <= lastrelem) {
878 sv_setsv(sv, *relem);
882 sv_setsv(sv, &PL_sv_undef);
887 if (PL_delaymagic & ~DM_DELAY) {
888 if (PL_delaymagic & DM_UID) {
890 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
893 (void)setreuid(PL_uid,PL_euid);
896 if ((PL_delaymagic & DM_UID) == DM_RUID) {
897 (void)setruid(PL_uid);
898 PL_delaymagic &= ~DM_RUID;
900 # endif /* HAS_SETRUID */
902 if ((PL_delaymagic & DM_UID) == DM_EUID) {
903 (void)seteuid(PL_uid);
904 PL_delaymagic &= ~DM_EUID;
906 # endif /* HAS_SETEUID */
907 if (PL_delaymagic & DM_UID) {
908 if (PL_uid != PL_euid)
909 DIE(aTHX_ "No setreuid available");
910 (void)PerlProc_setuid(PL_uid);
912 # endif /* HAS_SETREUID */
913 #endif /* HAS_SETRESUID */
914 PL_uid = PerlProc_getuid();
915 PL_euid = PerlProc_geteuid();
917 if (PL_delaymagic & DM_GID) {
919 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
922 (void)setregid(PL_gid,PL_egid);
925 if ((PL_delaymagic & DM_GID) == DM_RGID) {
926 (void)setrgid(PL_gid);
927 PL_delaymagic &= ~DM_RGID;
929 # endif /* HAS_SETRGID */
931 if ((PL_delaymagic & DM_GID) == DM_EGID) {
932 (void)setegid(PL_gid);
933 PL_delaymagic &= ~DM_EGID;
935 # endif /* HAS_SETEGID */
936 if (PL_delaymagic & DM_GID) {
937 if (PL_gid != PL_egid)
938 DIE(aTHX_ "No setregid available");
939 (void)PerlProc_setgid(PL_gid);
941 # endif /* HAS_SETREGID */
942 #endif /* HAS_SETRESGID */
943 PL_gid = PerlProc_getgid();
944 PL_egid = PerlProc_getegid();
946 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
953 else if (gimme == G_SCALAR) {
956 SETi(lastrelem - firstrelem + 1);
962 SP = firstrelem + (lastlelem - firstlelem);
963 lelem = firstlelem + (relem - firstrelem);
965 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
973 register PMOP *pm = cPMOP;
974 SV *rv = sv_newmortal();
975 SV *sv = newSVrv(rv, "Regexp");
976 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
983 register PMOP *pm = cPMOP;
988 I32 r_flags = REXEC_CHECKED;
989 char *truebase; /* Start of string */
990 register REGEXP *rx = pm->op_pmregexp;
995 I32 oldsave = PL_savestack_ix;
996 I32 update_minmatch = 1;
999 if (PL_op->op_flags & OPf_STACKED)
1005 PUTBACK; /* EVAL blocks need stack_sp. */
1006 s = SvPV(TARG, len);
1009 DIE(aTHX_ "panic: do_match");
1010 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1011 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1014 if (pm->op_pmdynflags & PMdf_USED) {
1016 if (gimme == G_ARRAY)
1021 if (!rx->prelen && PL_curpm) {
1023 rx = pm->op_pmregexp;
1025 if (rx->minlen > len) goto failure;
1029 /* XXXX What part of this is needed with true \G-support? */
1030 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1032 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1033 MAGIC* mg = mg_find(TARG, 'g');
1034 if (mg && mg->mg_len >= 0) {
1035 if (!(rx->reganch & ROPT_GPOS_SEEN))
1036 rx->endp[0] = rx->startp[0] = mg->mg_len;
1037 else if (rx->reganch & ROPT_ANCH_GPOS) {
1038 r_flags |= REXEC_IGNOREPOS;
1039 rx->endp[0] = rx->startp[0] = mg->mg_len;
1041 minmatch = (mg->mg_flags & MGf_MINMATCH);
1042 update_minmatch = 0;
1046 if ((gimme != G_ARRAY && !global && rx->nparens)
1047 || SvTEMP(TARG) || PL_sawampersand)
1048 r_flags |= REXEC_COPY_STR;
1050 r_flags |= REXEC_SCREAM;
1052 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1053 SAVEINT(PL_multiline);
1054 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1058 if (global && rx->startp[0] != -1) {
1059 t = s = rx->endp[0] + truebase;
1060 if ((s + rx->minlen) > strend)
1062 if (update_minmatch++)
1063 minmatch = had_zerolen;
1065 if (rx->reganch & RE_USE_INTUIT) {
1066 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1070 if ( (rx->reganch & ROPT_CHECK_ALL)
1072 && ((rx->reganch & ROPT_NOSCAN)
1073 || !((rx->reganch & RE_INTUIT_TAIL)
1074 && (r_flags & REXEC_SCREAM)))
1075 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1078 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1081 if (pm->op_pmflags & PMf_ONCE)
1082 pm->op_pmdynflags |= PMdf_USED;
1091 RX_MATCH_TAINTED_on(rx);
1092 TAINT_IF(RX_MATCH_TAINTED(rx));
1093 if (gimme == G_ARRAY) {
1096 iters = rx->nparens;
1097 if (global && !iters)
1101 SPAGAIN; /* EVAL blocks could move the stack. */
1102 EXTEND(SP, iters + i);
1103 EXTEND_MORTAL(iters + i);
1104 for (i = !i; i <= iters; i++) {
1105 PUSHs(sv_newmortal());
1107 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1108 len = rx->endp[i] - rx->startp[i];
1109 s = rx->startp[i] + truebase;
1110 sv_setpvn(*SP, s, len);
1111 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1113 sv_utf8_downgrade(*SP, TRUE);
1118 had_zerolen = (rx->startp[0] != -1
1119 && rx->startp[0] == rx->endp[0]);
1120 PUTBACK; /* EVAL blocks may use stack */
1121 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1126 LEAVE_SCOPE(oldsave);
1132 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1133 mg = mg_find(TARG, 'g');
1135 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1136 mg = mg_find(TARG, 'g');
1138 if (rx->startp[0] != -1) {
1139 mg->mg_len = rx->endp[0];
1140 if (rx->startp[0] == rx->endp[0])
1141 mg->mg_flags |= MGf_MINMATCH;
1143 mg->mg_flags &= ~MGf_MINMATCH;
1146 LEAVE_SCOPE(oldsave);
1150 yup: /* Confirmed by INTUIT */
1152 RX_MATCH_TAINTED_on(rx);
1153 TAINT_IF(RX_MATCH_TAINTED(rx));
1155 if (pm->op_pmflags & PMf_ONCE)
1156 pm->op_pmdynflags |= PMdf_USED;
1157 if (RX_MATCH_COPIED(rx))
1158 Safefree(rx->subbeg);
1159 RX_MATCH_COPIED_off(rx);
1160 rx->subbeg = Nullch;
1162 rx->subbeg = truebase;
1163 rx->startp[0] = s - truebase;
1164 rx->endp[0] = s - truebase + rx->minlen;
1165 rx->sublen = strend - truebase;
1168 if (PL_sawampersand) {
1171 rx->subbeg = savepvn(t, strend - t);
1172 rx->sublen = strend - t;
1173 RX_MATCH_COPIED_on(rx);
1174 off = rx->startp[0] = s - t;
1175 rx->endp[0] = off + rx->minlen;
1177 else { /* startp/endp are used by @- @+. */
1178 rx->startp[0] = s - truebase;
1179 rx->endp[0] = s - truebase + rx->minlen;
1181 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1182 LEAVE_SCOPE(oldsave);
1187 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1188 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1189 MAGIC* mg = mg_find(TARG, 'g');
1194 LEAVE_SCOPE(oldsave);
1195 if (gimme == G_ARRAY)
1201 Perl_do_readline(pTHX)
1203 dSP; dTARGETSTACKED;
1208 register IO *io = GvIO(PL_last_in_gv);
1209 register I32 type = PL_op->op_type;
1210 I32 gimme = GIMME_V;
1213 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1215 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1218 call_method("READLINE", gimme);
1221 if (gimme == G_SCALAR)
1222 SvSetMagicSV_nosteal(TARG, TOPs);
1229 if (IoFLAGS(io) & IOf_ARGV) {
1230 if (IoFLAGS(io) & IOf_START) {
1232 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1233 IoFLAGS(io) &= ~IOf_START;
1234 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1235 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1236 SvSETMAGIC(GvSV(PL_last_in_gv));
1241 fp = nextargv(PL_last_in_gv);
1242 if (!fp) { /* Note: fp != IoIFP(io) */
1243 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1246 else if (type == OP_GLOB) {
1247 SV *tmpcmd = NEWSV(55, 0);
1251 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1252 /* since spawning off a process is a real performance hit */
1254 #include <descrip.h>
1255 #include <lib$routines.h>
1258 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1259 char vmsspec[NAM$C_MAXRSS+1];
1260 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1261 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1262 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1265 struct dsc$descriptor_s wilddsc
1266 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1267 struct dsc$descriptor_vs rsdsc
1268 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1269 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1271 /* We could find out if there's an explicit dev/dir or version
1272 by peeking into lib$find_file's internal context at
1273 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1274 but that's unsupported, so I don't want to do it now and
1275 have it bite someone in the future. */
1276 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1277 cp = SvPV(tmpglob,i);
1279 if (cp[i] == ';') hasver = 1;
1281 if (sts) hasver = 1;
1285 hasdir = isunix = 1;
1288 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1293 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1295 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1296 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1297 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1298 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1299 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1300 &dfltdsc,NULL,NULL,NULL))&1)) {
1301 end = rstr + (unsigned long int) *rslt;
1302 if (!hasver) while (*end != ';') end--;
1303 *(end++) = '\n'; *end = '\0';
1304 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1306 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1311 while (*(--begin) != ']' && *begin != '>') ;
1314 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1316 if (cxt) (void)lib$find_file_end(&cxt);
1317 if (ok && sts != RMS$_NMF &&
1318 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1321 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1323 PerlIO_close(tmpfp);
1327 PerlIO_rewind(tmpfp);
1328 IoTYPE(io) = IoTYPE_RDONLY;
1329 IoIFP(io) = fp = tmpfp;
1330 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1335 #ifdef MACOS_TRADITIONAL
1336 sv_setpv(tmpcmd, "glob ");
1337 sv_catsv(tmpcmd, tmpglob);
1338 sv_catpv(tmpcmd, " |");
1342 sv_setpv(tmpcmd, "for a in ");
1343 sv_catsv(tmpcmd, tmpglob);
1344 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1347 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1348 sv_catsv(tmpcmd, tmpglob);
1350 sv_setpv(tmpcmd, "perlglob ");
1351 sv_catsv(tmpcmd, tmpglob);
1352 sv_catpv(tmpcmd, " |");
1357 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1358 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1359 sv_catsv(tmpcmd, tmpglob);
1360 sv_catpv(tmpcmd, "' 2>/dev/null |");
1362 sv_setpv(tmpcmd, "echo ");
1363 sv_catsv(tmpcmd, tmpglob);
1365 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1367 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1370 #endif /* !DOSISH */
1371 #endif /* MACOS_TRADITIONAL */
1372 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1373 FALSE, O_RDONLY, 0, Nullfp);
1379 else if (type == OP_GLOB)
1381 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1382 && (IoTYPE(io) == IoTYPE_WRONLY || fp == PerlIO_stdout()
1383 || fp == PerlIO_stderr()))
1384 report_evil_fh(PL_last_in_gv, io, OP_phoney_OUTPUT_ONLY);
1387 if (ckWARN2(WARN_GLOB, WARN_CLOSED)
1388 && (!io || !(IoFLAGS(io) & IOf_START))) {
1389 if (type == OP_GLOB)
1390 Perl_warner(aTHX_ WARN_GLOB,
1391 "glob failed (can't start child: %s)",
1394 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1396 if (gimme == G_SCALAR) {
1397 (void)SvOK_off(TARG);
1403 if (gimme == G_SCALAR) {
1407 (void)SvUPGRADE(sv, SVt_PV);
1408 tmplen = SvLEN(sv); /* remember if already alloced */
1410 Sv_Grow(sv, 80); /* try short-buffering it */
1411 if (type == OP_RCATLINE)
1417 sv = sv_2mortal(NEWSV(57, 80));
1421 /* This should not be marked tainted if the fp is marked clean */
1422 #define MAYBE_TAINT_LINE(io, sv) \
1423 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1428 /* delay EOF state for a snarfed empty file */
1429 #define SNARF_EOF(gimme,rs,io,sv) \
1430 (gimme != G_SCALAR || SvCUR(sv) \
1431 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1434 if (!sv_gets(sv, fp, offset)
1435 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1437 PerlIO_clearerr(fp);
1438 if (IoFLAGS(io) & IOf_ARGV) {
1439 fp = nextargv(PL_last_in_gv);
1442 (void)do_close(PL_last_in_gv, FALSE);
1444 else if (type == OP_GLOB) {
1445 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1446 Perl_warner(aTHX_ WARN_GLOB,
1447 "glob failed (child exited with status %d%s)",
1448 (int)(STATUS_CURRENT >> 8),
1449 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1452 if (gimme == G_SCALAR) {
1453 (void)SvOK_off(TARG);
1456 MAYBE_TAINT_LINE(io, sv);
1459 MAYBE_TAINT_LINE(io, sv);
1461 IoFLAGS(io) |= IOf_NOLINE;
1464 if (type == OP_GLOB) {
1467 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1468 tmps = SvEND(sv) - 1;
1469 if (*tmps == *SvPVX(PL_rs)) {
1474 for (tmps = SvPVX(sv); *tmps; tmps++)
1475 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1476 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1478 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1479 (void)POPs; /* Unmatched wildcard? Chuck it... */
1483 if (gimme == G_ARRAY) {
1484 if (SvLEN(sv) - SvCUR(sv) > 20) {
1485 SvLEN_set(sv, SvCUR(sv)+1);
1486 Renew(SvPVX(sv), SvLEN(sv), char);
1488 sv = sv_2mortal(NEWSV(58, 80));
1491 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1492 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1496 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1497 Renew(SvPVX(sv), SvLEN(sv), char);
1506 register PERL_CONTEXT *cx;
1507 I32 gimme = OP_GIMME(PL_op, -1);
1510 if (cxstack_ix >= 0)
1511 gimme = cxstack[cxstack_ix].blk_gimme;
1519 PUSHBLOCK(cx, CXt_BLOCK, SP);
1531 U32 lval = PL_op->op_flags & OPf_MOD;
1532 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1534 U32 hash = (SvFAKE(keysv) && SvREADONLY(keysv)) ? SvUVX(keysv) : 0;
1536 if (SvTYPE(hv) == SVt_PVHV) {
1537 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1538 svp = he ? &HeVAL(he) : 0;
1540 else if (SvTYPE(hv) == SVt_PVAV) {
1541 if (PL_op->op_private & OPpLVAL_INTRO)
1542 DIE(aTHX_ "Can't localize pseudo-hash element");
1543 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, hash);
1549 if (!svp || *svp == &PL_sv_undef) {
1554 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1556 lv = sv_newmortal();
1557 sv_upgrade(lv, SVt_PVLV);
1559 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1560 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1561 LvTARG(lv) = SvREFCNT_inc(hv);
1566 if (PL_op->op_private & OPpLVAL_INTRO) {
1567 if (HvNAME(hv) && isGV(*svp))
1568 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1570 save_helem(hv, keysv, svp);
1572 else if (PL_op->op_private & OPpDEREF)
1573 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1575 sv = (svp ? *svp : &PL_sv_undef);
1576 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1577 * Pushing the magical RHS on to the stack is useless, since
1578 * that magic is soon destined to be misled by the local(),
1579 * and thus the later pp_sassign() will fail to mg_get() the
1580 * old value. This should also cure problems with delayed
1581 * mg_get()s. GSAR 98-07-03 */
1582 if (!lval && SvGMAGICAL(sv))
1583 sv = sv_mortalcopy(sv);
1591 register PERL_CONTEXT *cx;
1597 if (PL_op->op_flags & OPf_SPECIAL) {
1598 cx = &cxstack[cxstack_ix];
1599 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1604 gimme = OP_GIMME(PL_op, -1);
1606 if (cxstack_ix >= 0)
1607 gimme = cxstack[cxstack_ix].blk_gimme;
1613 if (gimme == G_VOID)
1615 else if (gimme == G_SCALAR) {
1618 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1621 *MARK = sv_mortalcopy(TOPs);
1624 *MARK = &PL_sv_undef;
1628 else if (gimme == G_ARRAY) {
1629 /* in case LEAVE wipes old return values */
1630 for (mark = newsp + 1; mark <= SP; mark++) {
1631 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1632 *mark = sv_mortalcopy(*mark);
1633 TAINT_NOT; /* Each item is independent */
1637 PL_curpm = newpm; /* Don't pop $1 et al till now */
1647 register PERL_CONTEXT *cx;
1653 cx = &cxstack[cxstack_ix];
1654 if (CxTYPE(cx) != CXt_LOOP)
1655 DIE(aTHX_ "panic: pp_iter");
1657 itersvp = CxITERVAR(cx);
1658 av = cx->blk_loop.iterary;
1659 if (SvTYPE(av) != SVt_PVAV) {
1660 /* iterate ($min .. $max) */
1661 if (cx->blk_loop.iterlval) {
1662 /* string increment */
1663 register SV* cur = cx->blk_loop.iterlval;
1665 char *max = SvPV((SV*)av, maxlen);
1666 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1667 #ifndef USE_THREADS /* don't risk potential race */
1668 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1669 /* safe to reuse old SV */
1670 sv_setsv(*itersvp, cur);
1675 /* we need a fresh SV every time so that loop body sees a
1676 * completely new SV for closures/references to work as
1678 SvREFCNT_dec(*itersvp);
1679 *itersvp = newSVsv(cur);
1681 if (strEQ(SvPVX(cur), max))
1682 sv_setiv(cur, 0); /* terminate next time */
1689 /* integer increment */
1690 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1693 #ifndef USE_THREADS /* don't risk potential race */
1694 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1695 /* safe to reuse old SV */
1696 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1701 /* we need a fresh SV every time so that loop body sees a
1702 * completely new SV for closures/references to work as they
1704 SvREFCNT_dec(*itersvp);
1705 *itersvp = newSViv(cx->blk_loop.iterix++);
1711 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1714 SvREFCNT_dec(*itersvp);
1716 if ((sv = SvMAGICAL(av)
1717 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1718 : AvARRAY(av)[++cx->blk_loop.iterix]))
1722 if (av != PL_curstack && SvIMMORTAL(sv)) {
1723 SV *lv = cx->blk_loop.iterlval;
1724 if (lv && SvREFCNT(lv) > 1) {
1729 SvREFCNT_dec(LvTARG(lv));
1731 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1732 sv_upgrade(lv, SVt_PVLV);
1734 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1736 LvTARG(lv) = SvREFCNT_inc(av);
1737 LvTARGOFF(lv) = cx->blk_loop.iterix;
1738 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1742 *itersvp = SvREFCNT_inc(sv);
1749 register PMOP *pm = cPMOP;
1765 register REGEXP *rx = pm->op_pmregexp;
1767 int force_on_match = 0;
1768 I32 oldsave = PL_savestack_ix;
1770 /* known replacement string? */
1771 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1772 if (PL_op->op_flags & OPf_STACKED)
1778 if (SvFAKE(TARG) && SvREADONLY(TARG))
1779 sv_force_normal(TARG);
1780 if (SvREADONLY(TARG)
1781 || (SvTYPE(TARG) > SVt_PVLV
1782 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1783 DIE(aTHX_ PL_no_modify);
1786 s = SvPV(TARG, len);
1787 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1789 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1790 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1797 DIE(aTHX_ "panic: do_subst");
1800 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1801 position, once with zero-length,
1802 second time with non-zero. */
1804 if (!rx->prelen && PL_curpm) {
1806 rx = pm->op_pmregexp;
1808 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1809 ? REXEC_COPY_STR : 0;
1811 r_flags |= REXEC_SCREAM;
1812 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1813 SAVEINT(PL_multiline);
1814 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1817 if (rx->reganch & RE_USE_INTUIT) {
1818 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1822 /* How to do it in subst? */
1823 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1825 && ((rx->reganch & ROPT_NOSCAN)
1826 || !((rx->reganch & RE_INTUIT_TAIL)
1827 && (r_flags & REXEC_SCREAM))))
1832 /* only replace once? */
1833 once = !(rpm->op_pmflags & PMf_GLOBAL);
1835 /* known replacement string? */
1836 c = dstr ? SvPV(dstr, clen) : Nullch;
1838 /* can do inplace substitution? */
1839 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1840 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1841 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1842 r_flags | REXEC_CHECKED))
1846 LEAVE_SCOPE(oldsave);
1849 if (force_on_match) {
1851 s = SvPV_force(TARG, len);
1856 SvSCREAM_off(TARG); /* disable possible screamer */
1858 rxtainted |= RX_MATCH_TAINTED(rx);
1859 m = orig + rx->startp[0];
1860 d = orig + rx->endp[0];
1862 if (m - s > strend - d) { /* faster to shorten from end */
1864 Copy(c, m, clen, char);
1869 Move(d, m, i, char);
1873 SvCUR_set(TARG, m - s);
1876 else if ((i = m - s)) { /* faster from front */
1884 Copy(c, m, clen, char);
1889 Copy(c, d, clen, char);
1894 TAINT_IF(rxtainted & 1);
1900 if (iters++ > maxiters)
1901 DIE(aTHX_ "Substitution loop");
1902 rxtainted |= RX_MATCH_TAINTED(rx);
1903 m = rx->startp[0] + orig;
1907 Move(s, d, i, char);
1911 Copy(c, d, clen, char);
1914 s = rx->endp[0] + orig;
1915 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1917 /* don't match same null twice */
1918 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1921 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1922 Move(s, d, i+1, char); /* include the NUL */
1924 TAINT_IF(rxtainted & 1);
1926 PUSHs(sv_2mortal(newSViv((I32)iters)));
1928 (void)SvPOK_only_UTF8(TARG);
1929 TAINT_IF(rxtainted);
1930 if (SvSMAGICAL(TARG)) {
1936 LEAVE_SCOPE(oldsave);
1940 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1941 r_flags | REXEC_CHECKED))
1943 if (force_on_match) {
1945 s = SvPV_force(TARG, len);
1948 rxtainted |= RX_MATCH_TAINTED(rx);
1949 dstr = NEWSV(25, len);
1950 sv_setpvn(dstr, m, s-m);
1953 register PERL_CONTEXT *cx;
1956 RETURNOP(cPMOP->op_pmreplroot);
1958 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1960 if (iters++ > maxiters)
1961 DIE(aTHX_ "Substitution loop");
1962 rxtainted |= RX_MATCH_TAINTED(rx);
1963 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1968 strend = s + (strend - m);
1970 m = rx->startp[0] + orig;
1971 sv_catpvn(dstr, s, m-s);
1972 s = rx->endp[0] + orig;
1974 sv_catpvn(dstr, c, clen);
1977 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1978 sv_catpvn(dstr, s, strend - s);
1980 (void)SvOOK_off(TARG);
1981 Safefree(SvPVX(TARG));
1982 SvPVX(TARG) = SvPVX(dstr);
1983 SvCUR_set(TARG, SvCUR(dstr));
1984 SvLEN_set(TARG, SvLEN(dstr));
1988 TAINT_IF(rxtainted & 1);
1990 PUSHs(sv_2mortal(newSViv((I32)iters)));
1992 (void)SvPOK_only(TARG);
1993 TAINT_IF(rxtainted);
1996 LEAVE_SCOPE(oldsave);
2005 LEAVE_SCOPE(oldsave);
2014 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2015 ++*PL_markstack_ptr;
2016 LEAVE; /* exit inner scope */
2019 if (PL_stack_base + *PL_markstack_ptr > SP) {
2021 I32 gimme = GIMME_V;
2023 LEAVE; /* exit outer scope */
2024 (void)POPMARK; /* pop src */
2025 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2026 (void)POPMARK; /* pop dst */
2027 SP = PL_stack_base + POPMARK; /* pop original mark */
2028 if (gimme == G_SCALAR) {
2032 else if (gimme == G_ARRAY)
2039 ENTER; /* enter inner scope */
2042 src = PL_stack_base[*PL_markstack_ptr];
2046 RETURNOP(cLOGOP->op_other);
2057 register PERL_CONTEXT *cx;
2063 if (gimme == G_SCALAR) {
2066 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2068 *MARK = SvREFCNT_inc(TOPs);
2073 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2075 *MARK = sv_mortalcopy(sv);
2080 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2084 *MARK = &PL_sv_undef;
2088 else if (gimme == G_ARRAY) {
2089 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2090 if (!SvTEMP(*MARK)) {
2091 *MARK = sv_mortalcopy(*MARK);
2092 TAINT_NOT; /* Each item is independent */
2098 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2099 PL_curpm = newpm; /* ... and pop $1 et al */
2103 return pop_return();
2106 /* This duplicates the above code because the above code must not
2107 * get any slower by more conditions */
2115 register PERL_CONTEXT *cx;
2122 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2123 /* We are an argument to a function or grep().
2124 * This kind of lvalueness was legal before lvalue
2125 * subroutines too, so be backward compatible:
2126 * cannot report errors. */
2128 /* Scalar context *is* possible, on the LHS of -> only,
2129 * as in f()->meth(). But this is not an lvalue. */
2130 if (gimme == G_SCALAR)
2132 if (gimme == G_ARRAY) {
2133 if (!CvLVALUE(cx->blk_sub.cv))
2134 goto temporise_array;
2135 EXTEND_MORTAL(SP - newsp);
2136 for (mark = newsp + 1; mark <= SP; mark++) {
2139 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2140 *mark = sv_mortalcopy(*mark);
2142 /* Can be a localized value subject to deletion. */
2143 PL_tmps_stack[++PL_tmps_ix] = *mark;
2144 (void)SvREFCNT_inc(*mark);
2149 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2150 /* Here we go for robustness, not for speed, so we change all
2151 * the refcounts so the caller gets a live guy. Cannot set
2152 * TEMP, so sv_2mortal is out of question. */
2153 if (!CvLVALUE(cx->blk_sub.cv)) {
2158 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2160 if (gimme == G_SCALAR) {
2164 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2169 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2170 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2172 else { /* Can be a localized value
2173 * subject to deletion. */
2174 PL_tmps_stack[++PL_tmps_ix] = *mark;
2175 (void)SvREFCNT_inc(*mark);
2178 else { /* Should not happen? */
2183 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2184 (MARK > SP ? "Empty array" : "Array"));
2188 else if (gimme == G_ARRAY) {
2189 EXTEND_MORTAL(SP - newsp);
2190 for (mark = newsp + 1; mark <= SP; mark++) {
2191 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2192 /* Might be flattened array after $#array = */
2198 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2199 (*mark != &PL_sv_undef)
2201 ? "a readonly value" : "a temporary")
2202 : "an uninitialized value");
2205 /* Can be a localized value subject to deletion. */
2206 PL_tmps_stack[++PL_tmps_ix] = *mark;
2207 (void)SvREFCNT_inc(*mark);
2213 if (gimme == G_SCALAR) {
2217 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2219 *MARK = SvREFCNT_inc(TOPs);
2224 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2226 *MARK = sv_mortalcopy(sv);
2231 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2235 *MARK = &PL_sv_undef;
2239 else if (gimme == G_ARRAY) {
2241 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2242 if (!SvTEMP(*MARK)) {
2243 *MARK = sv_mortalcopy(*MARK);
2244 TAINT_NOT; /* Each item is independent */
2251 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2252 PL_curpm = newpm; /* ... and pop $1 et al */
2256 return pop_return();
2261 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2263 SV *dbsv = GvSV(PL_DBsub);
2265 if (!PERLDB_SUB_NN) {
2269 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2270 || strEQ(GvNAME(gv), "END")
2271 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2272 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2273 && (gv = (GV*)*svp) ))) {
2274 /* Use GV from the stack as a fallback. */
2275 /* GV is potentially non-unique, or contain different CV. */
2276 SV *tmp = newRV((SV*)cv);
2277 sv_setsv(dbsv, tmp);
2281 gv_efullname3(dbsv, gv, Nullch);
2285 (void)SvUPGRADE(dbsv, SVt_PVIV);
2286 (void)SvIOK_on(dbsv);
2287 SAVEIV(SvIVX(dbsv));
2288 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2292 PL_curcopdb = PL_curcop;
2293 cv = GvCV(PL_DBsub);
2303 register PERL_CONTEXT *cx;
2305 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2308 DIE(aTHX_ "Not a CODE reference");
2309 switch (SvTYPE(sv)) {
2315 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2317 SP = PL_stack_base + POPMARK;
2320 if (SvGMAGICAL(sv)) {
2322 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2325 sym = SvPV(sv, n_a);
2327 DIE(aTHX_ PL_no_usym, "a subroutine");
2328 if (PL_op->op_private & HINT_STRICT_REFS)
2329 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2330 cv = get_cv(sym, TRUE);
2334 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2335 tryAMAGICunDEREF(to_cv);
2338 if (SvTYPE(cv) == SVt_PVCV)
2343 DIE(aTHX_ "Not a CODE reference");
2348 if (!(cv = GvCVu((GV*)sv)))
2349 cv = sv_2cv(sv, &stash, &gv, FALSE);
2362 if (!CvROOT(cv) && !CvXSUB(cv)) {
2366 /* anonymous or undef'd function leaves us no recourse */
2367 if (CvANON(cv) || !(gv = CvGV(cv)))
2368 DIE(aTHX_ "Undefined subroutine called");
2370 /* autoloaded stub? */
2371 if (cv != GvCV(gv)) {
2374 /* should call AUTOLOAD now? */
2377 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2384 sub_name = sv_newmortal();
2385 gv_efullname3(sub_name, gv, Nullch);
2386 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2390 DIE(aTHX_ "Not a CODE reference");
2395 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2396 cv = get_db_sub(&sv, cv);
2398 DIE(aTHX_ "No DBsub routine");
2403 * First we need to check if the sub or method requires locking.
2404 * If so, we gain a lock on the CV, the first argument or the
2405 * stash (for static methods), as appropriate. This has to be
2406 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2407 * reschedule by returning a new op.
2409 MUTEX_LOCK(CvMUTEXP(cv));
2410 if (CvFLAGS(cv) & CVf_LOCKED) {
2412 if (CvFLAGS(cv) & CVf_METHOD) {
2413 if (SP > PL_stack_base + TOPMARK)
2414 sv = *(PL_stack_base + TOPMARK + 1);
2416 AV *av = (AV*)PL_curpad[0];
2417 if (hasargs || !av || AvFILLp(av) < 0
2418 || !(sv = AvARRAY(av)[0]))
2420 MUTEX_UNLOCK(CvMUTEXP(cv));
2421 DIE(aTHX_ "no argument for locked method call");
2428 char *stashname = SvPV(sv, len);
2429 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2435 MUTEX_UNLOCK(CvMUTEXP(cv));
2436 mg = condpair_magic(sv);
2437 MUTEX_LOCK(MgMUTEXP(mg));
2438 if (MgOWNER(mg) == thr)
2439 MUTEX_UNLOCK(MgMUTEXP(mg));
2442 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2444 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2446 MUTEX_UNLOCK(MgMUTEXP(mg));
2447 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2449 MUTEX_LOCK(CvMUTEXP(cv));
2452 * Now we have permission to enter the sub, we must distinguish
2453 * four cases. (0) It's an XSUB (in which case we don't care
2454 * about ownership); (1) it's ours already (and we're recursing);
2455 * (2) it's free (but we may already be using a cached clone);
2456 * (3) another thread owns it. Case (1) is easy: we just use it.
2457 * Case (2) means we look for a clone--if we have one, use it
2458 * otherwise grab ownership of cv. Case (3) means we look for a
2459 * clone (for non-XSUBs) and have to create one if we don't
2461 * Why look for a clone in case (2) when we could just grab
2462 * ownership of cv straight away? Well, we could be recursing,
2463 * i.e. we originally tried to enter cv while another thread
2464 * owned it (hence we used a clone) but it has been freed up
2465 * and we're now recursing into it. It may or may not be "better"
2466 * to use the clone but at least CvDEPTH can be trusted.
2468 if (CvOWNER(cv) == thr || CvXSUB(cv))
2469 MUTEX_UNLOCK(CvMUTEXP(cv));
2471 /* Case (2) or (3) */
2475 * XXX Might it be better to release CvMUTEXP(cv) while we
2476 * do the hv_fetch? We might find someone has pinched it
2477 * when we look again, in which case we would be in case
2478 * (3) instead of (2) so we'd have to clone. Would the fact
2479 * that we released the mutex more quickly make up for this?
2481 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2483 /* We already have a clone to use */
2484 MUTEX_UNLOCK(CvMUTEXP(cv));
2486 DEBUG_S(PerlIO_printf(Perl_debug_log,
2487 "entersub: %p already has clone %p:%s\n",
2488 thr, cv, SvPEEK((SV*)cv)));
2491 if (CvDEPTH(cv) == 0)
2492 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2495 /* (2) => grab ownership of cv. (3) => make clone */
2499 MUTEX_UNLOCK(CvMUTEXP(cv));
2500 DEBUG_S(PerlIO_printf(Perl_debug_log,
2501 "entersub: %p grabbing %p:%s in stash %s\n",
2502 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2503 HvNAME(CvSTASH(cv)) : "(none)"));
2506 /* Make a new clone. */
2508 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2509 MUTEX_UNLOCK(CvMUTEXP(cv));
2510 DEBUG_S((PerlIO_printf(Perl_debug_log,
2511 "entersub: %p cloning %p:%s\n",
2512 thr, cv, SvPEEK((SV*)cv))));
2514 * We're creating a new clone so there's no race
2515 * between the original MUTEX_UNLOCK and the
2516 * SvREFCNT_inc since no one will be trying to undef
2517 * it out from underneath us. At least, I don't think
2520 clonecv = cv_clone(cv);
2521 SvREFCNT_dec(cv); /* finished with this */
2522 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2523 CvOWNER(clonecv) = thr;
2527 DEBUG_S(if (CvDEPTH(cv) != 0)
2528 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2530 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2533 #endif /* USE_THREADS */
2536 #ifdef PERL_XSUB_OLDSTYLE
2537 if (CvOLDSTYLE(cv)) {
2538 I32 (*fp3)(int,int,int);
2540 register I32 items = SP - MARK;
2541 /* We dont worry to copy from @_. */
2546 PL_stack_sp = mark + 1;
2547 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2548 items = (*fp3)(CvXSUBANY(cv).any_i32,
2549 MARK - PL_stack_base + 1,
2551 PL_stack_sp = PL_stack_base + items;
2554 #endif /* PERL_XSUB_OLDSTYLE */
2556 I32 markix = TOPMARK;
2561 /* Need to copy @_ to stack. Alternative may be to
2562 * switch stack to @_, and copy return values
2563 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2567 av = (AV*)PL_curpad[0];
2569 av = GvAV(PL_defgv);
2570 #endif /* USE_THREADS */
2571 items = AvFILLp(av) + 1; /* @_ is not tieable */
2574 /* Mark is at the end of the stack. */
2576 Copy(AvARRAY(av), SP + 1, items, SV*);
2581 /* We assume first XSUB in &DB::sub is the called one. */
2583 SAVEVPTR(PL_curcop);
2584 PL_curcop = PL_curcopdb;
2587 /* Do we need to open block here? XXXX */
2588 (void)(*CvXSUB(cv))(aTHXo_ cv);
2590 /* Enforce some sanity in scalar context. */
2591 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2592 if (markix > PL_stack_sp - PL_stack_base)
2593 *(PL_stack_base + markix) = &PL_sv_undef;
2595 *(PL_stack_base + markix) = *PL_stack_sp;
2596 PL_stack_sp = PL_stack_base + markix;
2604 register I32 items = SP - MARK;
2605 AV* padlist = CvPADLIST(cv);
2606 SV** svp = AvARRAY(padlist);
2607 push_return(PL_op->op_next);
2608 PUSHBLOCK(cx, CXt_SUB, MARK);
2611 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2612 * that eval'' ops within this sub know the correct lexical space.
2613 * Owing the speed considerations, we choose to search for the cv
2614 * in doeval() instead.
2616 if (CvDEPTH(cv) < 2)
2617 (void)SvREFCNT_inc(cv);
2618 else { /* save temporaries on recursion? */
2619 PERL_STACK_OVERFLOW_CHECK();
2620 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2622 AV *newpad = newAV();
2623 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2624 I32 ix = AvFILLp((AV*)svp[1]);
2625 I32 names_fill = AvFILLp((AV*)svp[0]);
2626 svp = AvARRAY(svp[0]);
2627 for ( ;ix > 0; ix--) {
2628 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2629 char *name = SvPVX(svp[ix]);
2630 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2631 || *name == '&') /* anonymous code? */
2633 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2635 else { /* our own lexical */
2637 av_store(newpad, ix, sv = (SV*)newAV());
2638 else if (*name == '%')
2639 av_store(newpad, ix, sv = (SV*)newHV());
2641 av_store(newpad, ix, sv = NEWSV(0,0));
2645 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2646 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2649 av_store(newpad, ix, sv = NEWSV(0,0));
2653 av = newAV(); /* will be @_ */
2655 av_store(newpad, 0, (SV*)av);
2656 AvFLAGS(av) = AVf_REIFY;
2657 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2658 AvFILLp(padlist) = CvDEPTH(cv);
2659 svp = AvARRAY(padlist);
2664 AV* av = (AV*)PL_curpad[0];
2666 items = AvFILLp(av) + 1;
2668 /* Mark is at the end of the stack. */
2670 Copy(AvARRAY(av), SP + 1, items, SV*);
2675 #endif /* USE_THREADS */
2676 SAVEVPTR(PL_curpad);
2677 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2680 #endif /* USE_THREADS */
2686 DEBUG_S(PerlIO_printf(Perl_debug_log,
2687 "%p entersub preparing @_\n", thr));
2689 av = (AV*)PL_curpad[0];
2691 /* @_ is normally not REAL--this should only ever
2692 * happen when DB::sub() calls things that modify @_ */
2698 cx->blk_sub.savearray = GvAV(PL_defgv);
2699 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2700 #endif /* USE_THREADS */
2701 cx->blk_sub.oldcurpad = PL_curpad;
2702 cx->blk_sub.argarray = av;
2705 if (items > AvMAX(av) + 1) {
2707 if (AvARRAY(av) != ary) {
2708 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2709 SvPVX(av) = (char*)ary;
2711 if (items > AvMAX(av) + 1) {
2712 AvMAX(av) = items - 1;
2713 Renew(ary,items,SV*);
2715 SvPVX(av) = (char*)ary;
2718 Copy(MARK,AvARRAY(av),items,SV*);
2719 AvFILLp(av) = items - 1;
2727 /* warning must come *after* we fully set up the context
2728 * stuff so that __WARN__ handlers can safely dounwind()
2731 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2732 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2733 sub_crush_depth(cv);
2735 DEBUG_S(PerlIO_printf(Perl_debug_log,
2736 "%p entersub returning %p\n", thr, CvSTART(cv)));
2738 RETURNOP(CvSTART(cv));
2743 Perl_sub_crush_depth(pTHX_ CV *cv)
2746 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2748 SV* tmpstr = sv_newmortal();
2749 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2750 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2761 U32 lval = PL_op->op_flags & OPf_MOD;
2762 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2766 elem -= PL_curcop->cop_arybase;
2767 if (SvTYPE(av) != SVt_PVAV)
2769 svp = av_fetch(av, elem, lval && !defer);
2771 if (!svp || *svp == &PL_sv_undef) {
2774 DIE(aTHX_ PL_no_aelem, elem);
2775 lv = sv_newmortal();
2776 sv_upgrade(lv, SVt_PVLV);
2778 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2779 LvTARG(lv) = SvREFCNT_inc(av);
2780 LvTARGOFF(lv) = elem;
2785 if (PL_op->op_private & OPpLVAL_INTRO)
2786 save_aelem(av, elem, svp);
2787 else if (PL_op->op_private & OPpDEREF)
2788 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2790 sv = (svp ? *svp : &PL_sv_undef);
2791 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2792 sv = sv_mortalcopy(sv);
2798 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2804 Perl_croak(aTHX_ PL_no_modify);
2805 if (SvTYPE(sv) < SVt_RV)
2806 sv_upgrade(sv, SVt_RV);
2807 else if (SvTYPE(sv) >= SVt_PV) {
2808 (void)SvOOK_off(sv);
2809 Safefree(SvPVX(sv));
2810 SvLEN(sv) = SvCUR(sv) = 0;
2814 SvRV(sv) = NEWSV(355,0);
2817 SvRV(sv) = (SV*)newAV();
2820 SvRV(sv) = (SV*)newHV();
2835 if (SvTYPE(rsv) == SVt_PVCV) {
2841 SETs(method_common(sv, Null(U32*)));
2848 SV* sv = cSVOP->op_sv;
2849 U32 hash = SvUVX(sv);
2851 XPUSHs(method_common(sv, &hash));
2856 S_method_common(pTHX_ SV* meth, U32* hashp)
2867 name = SvPV(meth, namelen);
2868 sv = *(PL_stack_base + TOPMARK + 1);
2871 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2882 !(packname = SvPV(sv, packlen)) ||
2883 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2884 !(ob=(SV*)GvIO(iogv)))
2887 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2888 ? !isIDFIRST_utf8((U8*)packname)
2889 : !isIDFIRST(*packname)
2892 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2893 SvOK(sv) ? "without a package or object reference"
2894 : "on an undefined value");
2896 stash = gv_stashpvn(packname, packlen, TRUE);
2899 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2902 if (!ob || !(SvOBJECT(ob)
2903 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2906 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2910 stash = SvSTASH(ob);
2913 /* shortcut for simple names */
2915 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2917 gv = (GV*)HeVAL(he);
2918 if (isGV(gv) && GvCV(gv) &&
2919 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2920 return (SV*)GvCV(gv);
2924 gv = gv_fetchmethod(stash, name);
2931 for (p = name; *p; p++) {
2933 sep = p, leaf = p + 1;
2934 else if (*p == ':' && *(p + 1) == ':')
2935 sep = p, leaf = p + 2;
2937 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2938 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2939 packlen = strlen(packname);
2943 packlen = sep - name;
2945 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2946 if (gv && isGV(gv)) {
2948 "Can't locate object method \"%s\" via package \"%s\"",
2953 "Can't locate object method \"%s\" via package \"%s\""
2954 " (perhaps you forgot to load \"%s\"?)",
2955 leaf, packname, packname);
2958 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2963 unset_cvowner(pTHXo_ void *cvarg)
2965 register CV* cv = (CV *) cvarg;
2967 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2968 thr, cv, SvPEEK((SV*)cv))));
2969 MUTEX_LOCK(CvMUTEXP(cv));
2970 DEBUG_S(if (CvDEPTH(cv) != 0)
2971 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2973 assert(thr == CvOWNER(cv));
2975 MUTEX_UNLOCK(CvMUTEXP(cv));
2978 #endif /* USE_THREADS */