3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
29 static void unset_cvowner(pTHXo_ void *cvarg);
30 #endif /* USE_THREADS */
41 PL_curcop = (COP*)PL_op;
42 TAINT_NOT; /* Each statement is presumed innocent */
43 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
52 if (PL_op->op_private & OPpLVAL_INTRO)
53 PUSHs(save_scalar(cGVOP_gv));
55 PUSHs(GvSV(cGVOP_gv));
66 PL_curcop = (COP*)PL_op;
72 PUSHMARK(PL_stack_sp);
82 sv_setpvn(TARG,s,len);
83 if (SvUTF8(TOPs) && !IN_BYTE)
92 XPUSHs((SV*)cGVOP_gv);
103 RETURNOP(cLOGOP->op_other);
111 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
113 temp = left; left = right; right = temp;
115 if (PL_tainting && PL_tainted && !SvTAINTED(left))
117 SvSetMagicSV(right, left);
126 RETURNOP(cLOGOP->op_other);
128 RETURNOP(cLOGOP->op_next);
134 TAINT_NOT; /* Each statement is presumed innocent */
135 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
137 oldsave = PL_scopestack[PL_scopestack_ix - 1];
138 LEAVE_SCOPE(oldsave);
144 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
149 bool left_utf = DO_UTF8(left);
150 bool right_utf = DO_UTF8(right);
152 if (left_utf != right_utf) {
153 if (TARG == right && !right_utf) {
154 sv_utf8_upgrade(TARG); /* Now straight binary copy */
158 /* Set TARG to PV(left), then add right */
159 U8 *l, *c, *olds = NULL;
161 s = (U8*)SvPV(right,len);
163 /* Take a copy since we're about to overwrite TARG */
164 olds = s = (U8*)savepvn((char*)s, len);
166 l = (U8*)SvPV(left, targlen);
168 sv_setpvn(TARG, (char*)l, targlen);
170 sv_utf8_upgrade(TARG);
171 /* Extend TARG to length of right (s) */
172 targlen = SvCUR(TARG) + len;
174 /* plus one for each hi-byte char if we have to upgrade */
175 for (c = s; c < s + len; c++) {
180 SvGROW(TARG, targlen+1);
181 /* And now copy, maybe upgrading right to UTF8 on the fly */
182 for (c = (U8*)SvEND(TARG); len--; s++) {
183 if (*s & 0x80 && !right_utf)
184 c = uv_to_utf8(c, *s);
188 SvCUR_set(TARG, targlen);
198 s = (U8*)SvPV(left,len);
200 sv_insert(TARG, 0, 0, (char*)s, len);
204 sv_setpvn(TARG, (char *)s, len);
206 else if (SvGMAGICAL(TARG))
208 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG)
209 sv_setpv(TARG, ""); /* Suppress warning. */
210 s = (U8*)SvPV(right,len);
212 #if defined(PERL_Y2KWARN)
213 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
215 char *s = SvPV(TARG,n);
216 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
217 && (n == 2 || !isDIGIT(s[n-3])))
219 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
220 "about to append an integer to '19'");
224 sv_catpvn(TARG, (char *)s, len);
227 sv_setpvn(TARG, (char *)s, len); /* suppress warning */
239 if (PL_op->op_flags & OPf_MOD) {
240 if (PL_op->op_private & OPpLVAL_INTRO)
241 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
242 else if (PL_op->op_private & OPpDEREF) {
244 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
253 tryAMAGICunTARGET(iter, 0);
254 PL_last_in_gv = (GV*)(*PL_stack_sp--);
255 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
256 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
257 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
260 XPUSHs((SV*)PL_last_in_gv);
263 PL_last_in_gv = (GV*)(*PL_stack_sp--);
266 return do_readline();
271 djSP; tryAMAGICbinSET(eq,0);
274 SETs(boolSV(TOPn == value));
282 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
283 DIE(aTHX_ PL_no_modify);
284 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
285 SvIVX(TOPs) != IV_MAX)
288 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
303 RETURNOP(cLOGOP->op_other);
309 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
312 SETn( left + right );
320 AV *av = GvAV(cGVOP_gv);
321 U32 lval = PL_op->op_flags & OPf_MOD;
322 SV** svp = av_fetch(av, PL_op->op_private, lval);
323 SV *sv = (svp ? *svp : &PL_sv_undef);
325 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
326 sv = sv_mortalcopy(sv);
333 djSP; dMARK; dTARGET;
335 do_join(TARG, *MARK, MARK, SP);
346 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
347 * will be enough to hold an OP*.
349 SV* sv = sv_newmortal();
350 sv_upgrade(sv, SVt_PVLV);
352 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
360 /* Oversized hot code. */
364 djSP; dMARK; dORIGMARK;
371 if (PL_op->op_flags & OPf_STACKED)
375 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
376 if (MARK == ORIGMARK) {
377 /* If using default handle then we need to make space to
378 * pass object as 1st arg, so move other args up ...
382 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
386 *MARK = SvTIED_obj((SV*)gv, mg);
389 call_method("PRINT", G_SCALAR);
397 if (!(io = GvIO(gv))) {
399 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
400 report_evil_fh(gv, io, PL_op->op_type);
401 SETERRNO(EBADF,RMS$_IFI);
404 else if (!(fp = IoOFP(io))) {
405 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
407 /* integrate with report_evil_fh()? */
410 SV* sv = sv_newmortal();
411 gv_efullname4(sv, gv, Nullch, FALSE);
412 name = SvPV_nolen(sv);
415 Perl_warner(aTHX_ WARN_IO,
416 "Filehandle %s opened only for input", name);
418 Perl_warner(aTHX_ WARN_IO,
419 "Filehandle opened only for input");
421 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
422 report_evil_fh(gv, io, PL_op->op_type);
424 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
431 if (!do_print(*MARK, fp))
435 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
444 if (!do_print(*MARK, fp))
453 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
456 if (IoFLAGS(io) & IOf_FLUSH)
457 if (PerlIO_flush(fp) == EOF)
478 tryAMAGICunDEREF(to_av);
481 if (SvTYPE(av) != SVt_PVAV)
482 DIE(aTHX_ "Not an ARRAY reference");
483 if (PL_op->op_flags & OPf_REF) {
489 if (SvTYPE(sv) == SVt_PVAV) {
491 if (PL_op->op_flags & OPf_REF) {
499 if (SvTYPE(sv) != SVt_PVGV) {
503 if (SvGMAGICAL(sv)) {
509 if (PL_op->op_flags & OPf_REF ||
510 PL_op->op_private & HINT_STRICT_REFS)
511 DIE(aTHX_ PL_no_usym, "an ARRAY");
512 if (ckWARN(WARN_UNINITIALIZED))
514 if (GIMME == G_ARRAY) {
521 if ((PL_op->op_flags & OPf_SPECIAL) &&
522 !(PL_op->op_flags & OPf_MOD))
524 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
526 && (!is_gv_magical(sym,len,0)
527 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
533 if (PL_op->op_private & HINT_STRICT_REFS)
534 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
535 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
542 if (PL_op->op_private & OPpLVAL_INTRO)
544 if (PL_op->op_flags & OPf_REF) {
551 if (GIMME == G_ARRAY) {
552 I32 maxarg = AvFILL(av) + 1;
553 (void)POPs; /* XXXX May be optimized away? */
555 if (SvRMAGICAL(av)) {
557 for (i=0; i < maxarg; i++) {
558 SV **svp = av_fetch(av, i, FALSE);
559 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
563 Copy(AvARRAY(av), SP+1, maxarg, SV*);
569 I32 maxarg = AvFILL(av) + 1;
582 tryAMAGICunDEREF(to_hv);
585 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
586 DIE(aTHX_ "Not a HASH reference");
587 if (PL_op->op_flags & OPf_REF) {
593 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
595 if (PL_op->op_flags & OPf_REF) {
603 if (SvTYPE(sv) != SVt_PVGV) {
607 if (SvGMAGICAL(sv)) {
613 if (PL_op->op_flags & OPf_REF ||
614 PL_op->op_private & HINT_STRICT_REFS)
615 DIE(aTHX_ PL_no_usym, "a HASH");
616 if (ckWARN(WARN_UNINITIALIZED))
618 if (GIMME == G_ARRAY) {
625 if ((PL_op->op_flags & OPf_SPECIAL) &&
626 !(PL_op->op_flags & OPf_MOD))
628 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
630 && (!is_gv_magical(sym,len,0)
631 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
637 if (PL_op->op_private & HINT_STRICT_REFS)
638 DIE(aTHX_ PL_no_symref, sym, "a HASH");
639 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
646 if (PL_op->op_private & OPpLVAL_INTRO)
648 if (PL_op->op_flags & OPf_REF) {
655 if (GIMME == G_ARRAY) { /* array wanted */
656 *PL_stack_sp = (SV*)hv;
661 if (SvTYPE(hv) == SVt_PVAV)
662 hv = avhv_keys((AV*)hv);
664 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
665 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
675 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
681 leftop = ((BINOP*)PL_op)->op_last;
683 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
684 leftop = ((LISTOP*)leftop)->op_first;
686 /* Skip PUSHMARK and each element already assigned to. */
687 for (i = lelem - firstlelem; i > 0; i--) {
688 leftop = leftop->op_sibling;
691 if (leftop->op_type != OP_RV2HV)
696 av_fill(ary, 0); /* clear all but the fields hash */
697 if (lastrelem >= relem) {
698 while (relem < lastrelem) { /* gobble up all the rest */
702 /* Avoid a memory leak when avhv_store_ent dies. */
703 tmpstr = sv_newmortal();
704 sv_setsv(tmpstr,relem[1]); /* value */
706 if (avhv_store_ent(ary,relem[0],tmpstr,0))
707 (void)SvREFCNT_inc(tmpstr);
708 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
714 if (relem == lastrelem)
720 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
724 if (ckWARN(WARN_MISC)) {
725 if (relem == firstrelem &&
727 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
728 SvTYPE(SvRV(*relem)) == SVt_PVHV))
730 Perl_warner(aTHX_ WARN_MISC,
731 "Reference found where even-sized list expected");
734 Perl_warner(aTHX_ WARN_MISC,
735 "Odd number of elements in hash assignment");
737 if (SvTYPE(hash) == SVt_PVAV) {
739 tmpstr = sv_newmortal();
740 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
741 (void)SvREFCNT_inc(tmpstr);
742 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
747 tmpstr = NEWSV(29,0);
748 didstore = hv_store_ent(hash,*relem,tmpstr,0);
749 if (SvMAGICAL(hash)) {
750 if (SvSMAGICAL(tmpstr))
763 SV **lastlelem = PL_stack_sp;
764 SV **lastrelem = PL_stack_base + POPMARK;
765 SV **firstrelem = PL_stack_base + POPMARK + 1;
766 SV **firstlelem = lastrelem + 1;
779 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
781 /* If there's a common identifier on both sides we have to take
782 * special care that assigning the identifier on the left doesn't
783 * clobber a value on the right that's used later in the list.
785 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
786 EXTEND_MORTAL(lastrelem - firstrelem + 1);
787 for (relem = firstrelem; relem <= lastrelem; relem++) {
790 TAINT_NOT; /* Each item is independent */
791 *relem = sv_mortalcopy(sv);
801 while (lelem <= lastlelem) {
802 TAINT_NOT; /* Each item stands on its own, taintwise. */
804 switch (SvTYPE(sv)) {
807 magic = SvMAGICAL(ary) != 0;
808 if (PL_op->op_private & OPpASSIGN_HASH) {
809 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
815 do_oddball((HV*)ary, relem, firstrelem);
817 relem = lastrelem + 1;
822 av_extend(ary, lastrelem - relem);
824 while (relem <= lastrelem) { /* gobble up all the rest */
830 didstore = av_store(ary,i++,sv);
840 case SVt_PVHV: { /* normal hash */
844 magic = SvMAGICAL(hash) != 0;
847 while (relem < lastrelem) { /* gobble up all the rest */
852 sv = &PL_sv_no, relem++;
853 tmpstr = NEWSV(29,0);
855 sv_setsv(tmpstr,*relem); /* value */
857 didstore = hv_store_ent(hash,sv,tmpstr,0);
859 if (SvSMAGICAL(tmpstr))
866 if (relem == lastrelem) {
867 do_oddball(hash, relem, firstrelem);
873 if (SvIMMORTAL(sv)) {
874 if (relem <= lastrelem)
878 if (relem <= lastrelem) {
879 sv_setsv(sv, *relem);
883 sv_setsv(sv, &PL_sv_undef);
888 if (PL_delaymagic & ~DM_DELAY) {
889 if (PL_delaymagic & DM_UID) {
891 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
894 (void)setreuid(PL_uid,PL_euid);
897 if ((PL_delaymagic & DM_UID) == DM_RUID) {
898 (void)setruid(PL_uid);
899 PL_delaymagic &= ~DM_RUID;
901 # endif /* HAS_SETRUID */
903 if ((PL_delaymagic & DM_UID) == DM_EUID) {
904 (void)seteuid(PL_uid);
905 PL_delaymagic &= ~DM_EUID;
907 # endif /* HAS_SETEUID */
908 if (PL_delaymagic & DM_UID) {
909 if (PL_uid != PL_euid)
910 DIE(aTHX_ "No setreuid available");
911 (void)PerlProc_setuid(PL_uid);
913 # endif /* HAS_SETREUID */
914 #endif /* HAS_SETRESUID */
915 PL_uid = PerlProc_getuid();
916 PL_euid = PerlProc_geteuid();
918 if (PL_delaymagic & DM_GID) {
920 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
923 (void)setregid(PL_gid,PL_egid);
926 if ((PL_delaymagic & DM_GID) == DM_RGID) {
927 (void)setrgid(PL_gid);
928 PL_delaymagic &= ~DM_RGID;
930 # endif /* HAS_SETRGID */
932 if ((PL_delaymagic & DM_GID) == DM_EGID) {
933 (void)setegid(PL_gid);
934 PL_delaymagic &= ~DM_EGID;
936 # endif /* HAS_SETEGID */
937 if (PL_delaymagic & DM_GID) {
938 if (PL_gid != PL_egid)
939 DIE(aTHX_ "No setregid available");
940 (void)PerlProc_setgid(PL_gid);
942 # endif /* HAS_SETREGID */
943 #endif /* HAS_SETRESGID */
944 PL_gid = PerlProc_getgid();
945 PL_egid = PerlProc_getegid();
947 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
954 else if (gimme == G_SCALAR) {
957 SETi(lastrelem - firstrelem + 1);
963 SP = firstrelem + (lastlelem - firstlelem);
964 lelem = firstlelem + (relem - firstrelem);
966 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
974 register PMOP *pm = cPMOP;
975 SV *rv = sv_newmortal();
976 SV *sv = newSVrv(rv, "Regexp");
977 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
984 register PMOP *pm = cPMOP;
989 I32 r_flags = REXEC_CHECKED;
990 char *truebase; /* Start of string */
991 register REGEXP *rx = pm->op_pmregexp;
996 I32 oldsave = PL_savestack_ix;
997 I32 update_minmatch = 1;
1000 if (PL_op->op_flags & OPf_STACKED)
1006 PUTBACK; /* EVAL blocks need stack_sp. */
1007 s = SvPV(TARG, len);
1010 DIE(aTHX_ "panic: do_match");
1011 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1012 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1015 if (pm->op_pmdynflags & PMdf_USED) {
1017 if (gimme == G_ARRAY)
1022 if (!rx->prelen && PL_curpm) {
1024 rx = pm->op_pmregexp;
1026 if (rx->minlen > len) goto failure;
1030 /* XXXX What part of this is needed with true \G-support? */
1031 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1033 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1034 MAGIC* mg = mg_find(TARG, 'g');
1035 if (mg && mg->mg_len >= 0) {
1036 if (!(rx->reganch & ROPT_GPOS_SEEN))
1037 rx->endp[0] = rx->startp[0] = mg->mg_len;
1038 else if (rx->reganch & ROPT_ANCH_GPOS) {
1039 r_flags |= REXEC_IGNOREPOS;
1040 rx->endp[0] = rx->startp[0] = mg->mg_len;
1042 minmatch = (mg->mg_flags & MGf_MINMATCH);
1043 update_minmatch = 0;
1047 if ((gimme != G_ARRAY && !global && rx->nparens)
1048 || SvTEMP(TARG) || PL_sawampersand)
1049 r_flags |= REXEC_COPY_STR;
1051 r_flags |= REXEC_SCREAM;
1053 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1054 SAVEINT(PL_multiline);
1055 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1059 if (global && rx->startp[0] != -1) {
1060 t = s = rx->endp[0] + truebase;
1061 if ((s + rx->minlen) > strend)
1063 if (update_minmatch++)
1064 minmatch = had_zerolen;
1066 if (rx->reganch & RE_USE_INTUIT) {
1067 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1071 if ( (rx->reganch & ROPT_CHECK_ALL)
1073 && ((rx->reganch & ROPT_NOSCAN)
1074 || !((rx->reganch & RE_INTUIT_TAIL)
1075 && (r_flags & REXEC_SCREAM)))
1076 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1079 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1082 if (pm->op_pmflags & PMf_ONCE)
1083 pm->op_pmdynflags |= PMdf_USED;
1092 RX_MATCH_TAINTED_on(rx);
1093 TAINT_IF(RX_MATCH_TAINTED(rx));
1094 if (gimme == G_ARRAY) {
1097 iters = rx->nparens;
1098 if (global && !iters)
1102 SPAGAIN; /* EVAL blocks could move the stack. */
1103 EXTEND(SP, iters + i);
1104 EXTEND_MORTAL(iters + i);
1105 for (i = !i; i <= iters; i++) {
1106 PUSHs(sv_newmortal());
1108 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1109 len = rx->endp[i] - rx->startp[i];
1110 s = rx->startp[i] + truebase;
1111 sv_setpvn(*SP, s, len);
1112 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1114 sv_utf8_downgrade(*SP, TRUE);
1119 had_zerolen = (rx->startp[0] != -1
1120 && rx->startp[0] == rx->endp[0]);
1121 PUTBACK; /* EVAL blocks may use stack */
1122 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1127 LEAVE_SCOPE(oldsave);
1133 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1134 mg = mg_find(TARG, 'g');
1136 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1137 mg = mg_find(TARG, 'g');
1139 if (rx->startp[0] != -1) {
1140 mg->mg_len = rx->endp[0];
1141 if (rx->startp[0] == rx->endp[0])
1142 mg->mg_flags |= MGf_MINMATCH;
1144 mg->mg_flags &= ~MGf_MINMATCH;
1147 LEAVE_SCOPE(oldsave);
1151 yup: /* Confirmed by INTUIT */
1153 RX_MATCH_TAINTED_on(rx);
1154 TAINT_IF(RX_MATCH_TAINTED(rx));
1156 if (pm->op_pmflags & PMf_ONCE)
1157 pm->op_pmdynflags |= PMdf_USED;
1158 if (RX_MATCH_COPIED(rx))
1159 Safefree(rx->subbeg);
1160 RX_MATCH_COPIED_off(rx);
1161 rx->subbeg = Nullch;
1163 rx->subbeg = truebase;
1164 rx->startp[0] = s - truebase;
1165 rx->endp[0] = s - truebase + rx->minlen;
1166 rx->sublen = strend - truebase;
1169 if (PL_sawampersand) {
1172 rx->subbeg = savepvn(t, strend - t);
1173 rx->sublen = strend - t;
1174 RX_MATCH_COPIED_on(rx);
1175 off = rx->startp[0] = s - t;
1176 rx->endp[0] = off + rx->minlen;
1178 else { /* startp/endp are used by @- @+. */
1179 rx->startp[0] = s - truebase;
1180 rx->endp[0] = s - truebase + rx->minlen;
1182 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1183 LEAVE_SCOPE(oldsave);
1188 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1189 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1190 MAGIC* mg = mg_find(TARG, 'g');
1195 LEAVE_SCOPE(oldsave);
1196 if (gimme == G_ARRAY)
1202 Perl_do_readline(pTHX)
1204 dSP; dTARGETSTACKED;
1209 register IO *io = GvIO(PL_last_in_gv);
1210 register I32 type = PL_op->op_type;
1211 I32 gimme = GIMME_V;
1214 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1216 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1219 call_method("READLINE", gimme);
1222 if (gimme == G_SCALAR)
1223 SvSetMagicSV_nosteal(TARG, TOPs);
1230 if (IoFLAGS(io) & IOf_ARGV) {
1231 if (IoFLAGS(io) & IOf_START) {
1233 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1234 IoFLAGS(io) &= ~IOf_START;
1235 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1236 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1237 SvSETMAGIC(GvSV(PL_last_in_gv));
1242 fp = nextargv(PL_last_in_gv);
1243 if (!fp) { /* Note: fp != IoIFP(io) */
1244 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1247 else if (type == OP_GLOB) {
1248 SV *tmpcmd = NEWSV(55, 0);
1252 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1253 /* since spawning off a process is a real performance hit */
1255 #include <descrip.h>
1256 #include <lib$routines.h>
1259 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1260 char vmsspec[NAM$C_MAXRSS+1];
1261 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1262 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1263 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1266 struct dsc$descriptor_s wilddsc
1267 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1268 struct dsc$descriptor_vs rsdsc
1269 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1270 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1272 /* We could find out if there's an explicit dev/dir or version
1273 by peeking into lib$find_file's internal context at
1274 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1275 but that's unsupported, so I don't want to do it now and
1276 have it bite someone in the future. */
1277 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1278 cp = SvPV(tmpglob,i);
1280 if (cp[i] == ';') hasver = 1;
1282 if (sts) hasver = 1;
1286 hasdir = isunix = 1;
1289 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1294 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1296 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1297 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1298 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1299 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1300 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1301 &dfltdsc,NULL,NULL,NULL))&1)) {
1302 end = rstr + (unsigned long int) *rslt;
1303 if (!hasver) while (*end != ';') end--;
1304 *(end++) = '\n'; *end = '\0';
1305 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1307 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1312 while (*(--begin) != ']' && *begin != '>') ;
1315 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1317 if (cxt) (void)lib$find_file_end(&cxt);
1318 if (ok && sts != RMS$_NMF &&
1319 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1322 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1324 PerlIO_close(tmpfp);
1328 PerlIO_rewind(tmpfp);
1330 IoIFP(io) = fp = tmpfp;
1331 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1336 #ifdef MACOS_TRADITIONAL
1337 sv_setpv(tmpcmd, "glob ");
1338 sv_catsv(tmpcmd, tmpglob);
1339 sv_catpv(tmpcmd, " |");
1343 sv_setpv(tmpcmd, "for a in ");
1344 sv_catsv(tmpcmd, tmpglob);
1345 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1348 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1349 sv_catsv(tmpcmd, tmpglob);
1351 sv_setpv(tmpcmd, "perlglob ");
1352 sv_catsv(tmpcmd, tmpglob);
1353 sv_catpv(tmpcmd, " |");
1358 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1359 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1360 sv_catsv(tmpcmd, tmpglob);
1361 sv_catpv(tmpcmd, "' 2>/dev/null |");
1363 sv_setpv(tmpcmd, "echo ");
1364 sv_catsv(tmpcmd, tmpglob);
1366 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1368 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1371 #endif /* !DOSISH */
1372 #endif /* MACOS_TRADITIONAL */
1373 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1374 FALSE, O_RDONLY, 0, Nullfp);
1380 else if (type == OP_GLOB)
1382 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1383 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1384 || fp == PerlIO_stderr()))
1386 /* integrate with report_evil_fh()? */
1388 if (isGV(PL_last_in_gv)) { /* can this ever fail? */
1389 SV* sv = sv_newmortal();
1390 gv_efullname4(sv, PL_last_in_gv, Nullch, FALSE);
1391 name = SvPV_nolen(sv);
1394 Perl_warner(aTHX_ WARN_IO,
1395 "Filehandle %s opened only for output", name);
1397 Perl_warner(aTHX_ WARN_IO,
1398 "Filehandle opened only for output");
1402 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1403 if (type == OP_GLOB)
1404 Perl_warner(aTHX_ WARN_GLOB,
1405 "glob failed (can't start child: %s)",
1408 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1410 if (gimme == G_SCALAR) {
1411 (void)SvOK_off(TARG);
1417 if (gimme == G_SCALAR) {
1421 (void)SvUPGRADE(sv, SVt_PV);
1422 tmplen = SvLEN(sv); /* remember if already alloced */
1424 Sv_Grow(sv, 80); /* try short-buffering it */
1425 if (type == OP_RCATLINE)
1431 sv = sv_2mortal(NEWSV(57, 80));
1435 /* delay EOF state for a snarfed empty file */
1436 #define SNARF_EOF(gimme,rs,io,sv) \
1437 (gimme != G_SCALAR || SvCUR(sv) \
1438 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1441 if (!sv_gets(sv, fp, offset)
1442 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1444 PerlIO_clearerr(fp);
1445 if (IoFLAGS(io) & IOf_ARGV) {
1446 fp = nextargv(PL_last_in_gv);
1449 (void)do_close(PL_last_in_gv, FALSE);
1451 else if (type == OP_GLOB) {
1452 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1453 Perl_warner(aTHX_ WARN_GLOB,
1454 "glob failed (child exited with status %d%s)",
1455 (int)(STATUS_CURRENT >> 8),
1456 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1459 if (gimme == G_SCALAR) {
1460 (void)SvOK_off(TARG);
1465 /* This should not be marked tainted if the fp is marked clean */
1466 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1471 IoFLAGS(io) |= IOf_NOLINE;
1474 if (type == OP_GLOB) {
1477 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1478 tmps = SvEND(sv) - 1;
1479 if (*tmps == *SvPVX(PL_rs)) {
1484 for (tmps = SvPVX(sv); *tmps; tmps++)
1485 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1486 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1488 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1489 (void)POPs; /* Unmatched wildcard? Chuck it... */
1493 if (gimme == G_ARRAY) {
1494 if (SvLEN(sv) - SvCUR(sv) > 20) {
1495 SvLEN_set(sv, SvCUR(sv)+1);
1496 Renew(SvPVX(sv), SvLEN(sv), char);
1498 sv = sv_2mortal(NEWSV(58, 80));
1501 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1502 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1506 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1507 Renew(SvPVX(sv), SvLEN(sv), char);
1516 register PERL_CONTEXT *cx;
1517 I32 gimme = OP_GIMME(PL_op, -1);
1520 if (cxstack_ix >= 0)
1521 gimme = cxstack[cxstack_ix].blk_gimme;
1529 PUSHBLOCK(cx, CXt_BLOCK, SP);
1541 U32 lval = PL_op->op_flags & OPf_MOD;
1542 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1544 U32 hash = (SvFAKE(keysv) && SvREADONLY(keysv)) ? SvUVX(keysv) : 0;
1546 if (SvTYPE(hv) == SVt_PVHV) {
1547 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1548 svp = he ? &HeVAL(he) : 0;
1550 else if (SvTYPE(hv) == SVt_PVAV) {
1551 if (PL_op->op_private & OPpLVAL_INTRO)
1552 DIE(aTHX_ "Can't localize pseudo-hash element");
1553 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, hash);
1559 if (!svp || *svp == &PL_sv_undef) {
1564 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1566 lv = sv_newmortal();
1567 sv_upgrade(lv, SVt_PVLV);
1569 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1570 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1571 LvTARG(lv) = SvREFCNT_inc(hv);
1576 if (PL_op->op_private & OPpLVAL_INTRO) {
1577 if (HvNAME(hv) && isGV(*svp))
1578 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1580 save_helem(hv, keysv, svp);
1582 else if (PL_op->op_private & OPpDEREF)
1583 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1585 sv = (svp ? *svp : &PL_sv_undef);
1586 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1587 * Pushing the magical RHS on to the stack is useless, since
1588 * that magic is soon destined to be misled by the local(),
1589 * and thus the later pp_sassign() will fail to mg_get() the
1590 * old value. This should also cure problems with delayed
1591 * mg_get()s. GSAR 98-07-03 */
1592 if (!lval && SvGMAGICAL(sv))
1593 sv = sv_mortalcopy(sv);
1601 register PERL_CONTEXT *cx;
1607 if (PL_op->op_flags & OPf_SPECIAL) {
1608 cx = &cxstack[cxstack_ix];
1609 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1614 gimme = OP_GIMME(PL_op, -1);
1616 if (cxstack_ix >= 0)
1617 gimme = cxstack[cxstack_ix].blk_gimme;
1623 if (gimme == G_VOID)
1625 else if (gimme == G_SCALAR) {
1628 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1631 *MARK = sv_mortalcopy(TOPs);
1634 *MARK = &PL_sv_undef;
1638 else if (gimme == G_ARRAY) {
1639 /* in case LEAVE wipes old return values */
1640 for (mark = newsp + 1; mark <= SP; mark++) {
1641 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1642 *mark = sv_mortalcopy(*mark);
1643 TAINT_NOT; /* Each item is independent */
1647 PL_curpm = newpm; /* Don't pop $1 et al till now */
1657 register PERL_CONTEXT *cx;
1663 cx = &cxstack[cxstack_ix];
1664 if (CxTYPE(cx) != CXt_LOOP)
1665 DIE(aTHX_ "panic: pp_iter");
1667 itersvp = CxITERVAR(cx);
1668 av = cx->blk_loop.iterary;
1669 if (SvTYPE(av) != SVt_PVAV) {
1670 /* iterate ($min .. $max) */
1671 if (cx->blk_loop.iterlval) {
1672 /* string increment */
1673 register SV* cur = cx->blk_loop.iterlval;
1675 char *max = SvPV((SV*)av, maxlen);
1676 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1677 #ifndef USE_THREADS /* don't risk potential race */
1678 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1679 /* safe to reuse old SV */
1680 sv_setsv(*itersvp, cur);
1685 /* we need a fresh SV every time so that loop body sees a
1686 * completely new SV for closures/references to work as
1688 SvREFCNT_dec(*itersvp);
1689 *itersvp = newSVsv(cur);
1691 if (strEQ(SvPVX(cur), max))
1692 sv_setiv(cur, 0); /* terminate next time */
1699 /* integer increment */
1700 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1703 #ifndef USE_THREADS /* don't risk potential race */
1704 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1705 /* safe to reuse old SV */
1706 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1711 /* we need a fresh SV every time so that loop body sees a
1712 * completely new SV for closures/references to work as they
1714 SvREFCNT_dec(*itersvp);
1715 *itersvp = newSViv(cx->blk_loop.iterix++);
1721 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1724 SvREFCNT_dec(*itersvp);
1726 if ((sv = SvMAGICAL(av)
1727 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1728 : AvARRAY(av)[++cx->blk_loop.iterix]))
1732 if (av != PL_curstack && SvIMMORTAL(sv)) {
1733 SV *lv = cx->blk_loop.iterlval;
1734 if (lv && SvREFCNT(lv) > 1) {
1739 SvREFCNT_dec(LvTARG(lv));
1741 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1742 sv_upgrade(lv, SVt_PVLV);
1744 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1746 LvTARG(lv) = SvREFCNT_inc(av);
1747 LvTARGOFF(lv) = cx->blk_loop.iterix;
1748 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1752 *itersvp = SvREFCNT_inc(sv);
1759 register PMOP *pm = cPMOP;
1775 register REGEXP *rx = pm->op_pmregexp;
1777 int force_on_match = 0;
1778 I32 oldsave = PL_savestack_ix;
1780 /* known replacement string? */
1781 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1782 if (PL_op->op_flags & OPf_STACKED)
1788 if (SvREADONLY(TARG)
1789 || (SvTYPE(TARG) > SVt_PVLV
1790 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1791 DIE(aTHX_ PL_no_modify);
1794 s = SvPV(TARG, len);
1795 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1797 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1798 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1805 DIE(aTHX_ "panic: do_subst");
1808 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1809 position, once with zero-length,
1810 second time with non-zero. */
1812 if (!rx->prelen && PL_curpm) {
1814 rx = pm->op_pmregexp;
1816 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1817 ? REXEC_COPY_STR : 0;
1819 r_flags |= REXEC_SCREAM;
1820 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1821 SAVEINT(PL_multiline);
1822 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1825 if (rx->reganch & RE_USE_INTUIT) {
1826 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1830 /* How to do it in subst? */
1831 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1833 && ((rx->reganch & ROPT_NOSCAN)
1834 || !((rx->reganch & RE_INTUIT_TAIL)
1835 && (r_flags & REXEC_SCREAM))))
1840 /* only replace once? */
1841 once = !(rpm->op_pmflags & PMf_GLOBAL);
1843 /* known replacement string? */
1844 c = dstr ? SvPV(dstr, clen) : Nullch;
1846 /* can do inplace substitution? */
1847 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1848 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1849 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1850 r_flags | REXEC_CHECKED))
1854 LEAVE_SCOPE(oldsave);
1857 if (force_on_match) {
1859 s = SvPV_force(TARG, len);
1864 SvSCREAM_off(TARG); /* disable possible screamer */
1866 rxtainted |= RX_MATCH_TAINTED(rx);
1867 m = orig + rx->startp[0];
1868 d = orig + rx->endp[0];
1870 if (m - s > strend - d) { /* faster to shorten from end */
1872 Copy(c, m, clen, char);
1877 Move(d, m, i, char);
1881 SvCUR_set(TARG, m - s);
1884 else if ((i = m - s)) { /* faster from front */
1892 Copy(c, m, clen, char);
1897 Copy(c, d, clen, char);
1902 TAINT_IF(rxtainted & 1);
1908 if (iters++ > maxiters)
1909 DIE(aTHX_ "Substitution loop");
1910 rxtainted |= RX_MATCH_TAINTED(rx);
1911 m = rx->startp[0] + orig;
1915 Move(s, d, i, char);
1919 Copy(c, d, clen, char);
1922 s = rx->endp[0] + orig;
1923 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1925 /* don't match same null twice */
1926 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1929 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1930 Move(s, d, i+1, char); /* include the NUL */
1932 TAINT_IF(rxtainted & 1);
1934 PUSHs(sv_2mortal(newSViv((I32)iters)));
1936 (void)SvPOK_only_UTF8(TARG);
1937 TAINT_IF(rxtainted);
1938 if (SvSMAGICAL(TARG)) {
1944 LEAVE_SCOPE(oldsave);
1948 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1949 r_flags | REXEC_CHECKED))
1951 if (force_on_match) {
1953 s = SvPV_force(TARG, len);
1956 rxtainted |= RX_MATCH_TAINTED(rx);
1957 dstr = NEWSV(25, len);
1958 sv_setpvn(dstr, m, s-m);
1961 register PERL_CONTEXT *cx;
1964 RETURNOP(cPMOP->op_pmreplroot);
1966 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1968 if (iters++ > maxiters)
1969 DIE(aTHX_ "Substitution loop");
1970 rxtainted |= RX_MATCH_TAINTED(rx);
1971 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1976 strend = s + (strend - m);
1978 m = rx->startp[0] + orig;
1979 sv_catpvn(dstr, s, m-s);
1980 s = rx->endp[0] + orig;
1982 sv_catpvn(dstr, c, clen);
1985 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1986 sv_catpvn(dstr, s, strend - s);
1988 (void)SvOOK_off(TARG);
1989 Safefree(SvPVX(TARG));
1990 SvPVX(TARG) = SvPVX(dstr);
1991 SvCUR_set(TARG, SvCUR(dstr));
1992 SvLEN_set(TARG, SvLEN(dstr));
1996 TAINT_IF(rxtainted & 1);
1998 PUSHs(sv_2mortal(newSViv((I32)iters)));
2000 (void)SvPOK_only(TARG);
2001 TAINT_IF(rxtainted);
2004 LEAVE_SCOPE(oldsave);
2013 LEAVE_SCOPE(oldsave);
2022 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2023 ++*PL_markstack_ptr;
2024 LEAVE; /* exit inner scope */
2027 if (PL_stack_base + *PL_markstack_ptr > SP) {
2029 I32 gimme = GIMME_V;
2031 LEAVE; /* exit outer scope */
2032 (void)POPMARK; /* pop src */
2033 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2034 (void)POPMARK; /* pop dst */
2035 SP = PL_stack_base + POPMARK; /* pop original mark */
2036 if (gimme == G_SCALAR) {
2040 else if (gimme == G_ARRAY)
2047 ENTER; /* enter inner scope */
2050 src = PL_stack_base[*PL_markstack_ptr];
2054 RETURNOP(cLOGOP->op_other);
2065 register PERL_CONTEXT *cx;
2071 if (gimme == G_SCALAR) {
2074 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2076 *MARK = SvREFCNT_inc(TOPs);
2081 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2083 *MARK = sv_mortalcopy(sv);
2088 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2092 *MARK = &PL_sv_undef;
2096 else if (gimme == G_ARRAY) {
2097 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2098 if (!SvTEMP(*MARK)) {
2099 *MARK = sv_mortalcopy(*MARK);
2100 TAINT_NOT; /* Each item is independent */
2106 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2107 PL_curpm = newpm; /* ... and pop $1 et al */
2111 return pop_return();
2114 /* This duplicates the above code because the above code must not
2115 * get any slower by more conditions */
2123 register PERL_CONTEXT *cx;
2130 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2131 /* We are an argument to a function or grep().
2132 * This kind of lvalueness was legal before lvalue
2133 * subroutines too, so be backward compatible:
2134 * cannot report errors. */
2136 /* Scalar context *is* possible, on the LHS of -> only,
2137 * as in f()->meth(). But this is not an lvalue. */
2138 if (gimme == G_SCALAR)
2140 if (gimme == G_ARRAY) {
2141 if (!CvLVALUE(cx->blk_sub.cv))
2142 goto temporise_array;
2143 EXTEND_MORTAL(SP - newsp);
2144 for (mark = newsp + 1; mark <= SP; mark++) {
2147 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2148 *mark = sv_mortalcopy(*mark);
2150 /* Can be a localized value subject to deletion. */
2151 PL_tmps_stack[++PL_tmps_ix] = *mark;
2152 (void)SvREFCNT_inc(*mark);
2157 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2158 /* Here we go for robustness, not for speed, so we change all
2159 * the refcounts so the caller gets a live guy. Cannot set
2160 * TEMP, so sv_2mortal is out of question. */
2161 if (!CvLVALUE(cx->blk_sub.cv)) {
2166 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2168 if (gimme == G_SCALAR) {
2172 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2177 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2178 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2180 else { /* Can be a localized value
2181 * subject to deletion. */
2182 PL_tmps_stack[++PL_tmps_ix] = *mark;
2183 (void)SvREFCNT_inc(*mark);
2186 else { /* Should not happen? */
2191 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2192 (MARK > SP ? "Empty array" : "Array"));
2196 else if (gimme == G_ARRAY) {
2197 EXTEND_MORTAL(SP - newsp);
2198 for (mark = newsp + 1; mark <= SP; mark++) {
2199 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2200 /* Might be flattened array after $#array = */
2206 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2207 (*mark != &PL_sv_undef)
2209 ? "a readonly value" : "a temporary")
2210 : "an uninitialized value");
2213 /* Can be a localized value subject to deletion. */
2214 PL_tmps_stack[++PL_tmps_ix] = *mark;
2215 (void)SvREFCNT_inc(*mark);
2221 if (gimme == G_SCALAR) {
2225 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2227 *MARK = SvREFCNT_inc(TOPs);
2232 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2234 *MARK = sv_mortalcopy(sv);
2239 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2243 *MARK = &PL_sv_undef;
2247 else if (gimme == G_ARRAY) {
2249 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2250 if (!SvTEMP(*MARK)) {
2251 *MARK = sv_mortalcopy(*MARK);
2252 TAINT_NOT; /* Each item is independent */
2259 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2260 PL_curpm = newpm; /* ... and pop $1 et al */
2264 return pop_return();
2269 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2272 SV *dbsv = GvSV(PL_DBsub);
2274 if (!PERLDB_SUB_NN) {
2278 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2279 || strEQ(GvNAME(gv), "END")
2280 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2281 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2282 && (gv = (GV*)*svp) ))) {
2283 /* Use GV from the stack as a fallback. */
2284 /* GV is potentially non-unique, or contain different CV. */
2285 SV *tmp = newRV((SV*)cv);
2286 sv_setsv(dbsv, tmp);
2290 gv_efullname3(dbsv, gv, Nullch);
2294 (void)SvUPGRADE(dbsv, SVt_PVIV);
2295 (void)SvIOK_on(dbsv);
2296 SAVEIV(SvIVX(dbsv));
2297 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2301 PL_curcopdb = PL_curcop;
2302 cv = GvCV(PL_DBsub);
2312 register PERL_CONTEXT *cx;
2314 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2317 DIE(aTHX_ "Not a CODE reference");
2318 switch (SvTYPE(sv)) {
2324 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2326 SP = PL_stack_base + POPMARK;
2329 if (SvGMAGICAL(sv)) {
2331 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2334 sym = SvPV(sv, n_a);
2336 DIE(aTHX_ PL_no_usym, "a subroutine");
2337 if (PL_op->op_private & HINT_STRICT_REFS)
2338 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2339 cv = get_cv(sym, TRUE);
2343 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2344 tryAMAGICunDEREF(to_cv);
2347 if (SvTYPE(cv) == SVt_PVCV)
2352 DIE(aTHX_ "Not a CODE reference");
2357 if (!(cv = GvCVu((GV*)sv)))
2358 cv = sv_2cv(sv, &stash, &gv, FALSE);
2371 if (!CvROOT(cv) && !CvXSUB(cv)) {
2375 /* anonymous or undef'd function leaves us no recourse */
2376 if (CvANON(cv) || !(gv = CvGV(cv)))
2377 DIE(aTHX_ "Undefined subroutine called");
2379 /* autoloaded stub? */
2380 if (cv != GvCV(gv)) {
2383 /* should call AUTOLOAD now? */
2386 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2393 sub_name = sv_newmortal();
2394 gv_efullname3(sub_name, gv, Nullch);
2395 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2399 DIE(aTHX_ "Not a CODE reference");
2404 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2405 cv = get_db_sub(&sv, cv);
2407 DIE(aTHX_ "No DBsub routine");
2412 * First we need to check if the sub or method requires locking.
2413 * If so, we gain a lock on the CV, the first argument or the
2414 * stash (for static methods), as appropriate. This has to be
2415 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2416 * reschedule by returning a new op.
2418 MUTEX_LOCK(CvMUTEXP(cv));
2419 if (CvFLAGS(cv) & CVf_LOCKED) {
2421 if (CvFLAGS(cv) & CVf_METHOD) {
2422 if (SP > PL_stack_base + TOPMARK)
2423 sv = *(PL_stack_base + TOPMARK + 1);
2425 AV *av = (AV*)PL_curpad[0];
2426 if (hasargs || !av || AvFILLp(av) < 0
2427 || !(sv = AvARRAY(av)[0]))
2429 MUTEX_UNLOCK(CvMUTEXP(cv));
2430 DIE(aTHX_ "no argument for locked method call");
2437 char *stashname = SvPV(sv, len);
2438 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2444 MUTEX_UNLOCK(CvMUTEXP(cv));
2445 mg = condpair_magic(sv);
2446 MUTEX_LOCK(MgMUTEXP(mg));
2447 if (MgOWNER(mg) == thr)
2448 MUTEX_UNLOCK(MgMUTEXP(mg));
2451 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2453 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2455 MUTEX_UNLOCK(MgMUTEXP(mg));
2456 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2458 MUTEX_LOCK(CvMUTEXP(cv));
2461 * Now we have permission to enter the sub, we must distinguish
2462 * four cases. (0) It's an XSUB (in which case we don't care
2463 * about ownership); (1) it's ours already (and we're recursing);
2464 * (2) it's free (but we may already be using a cached clone);
2465 * (3) another thread owns it. Case (1) is easy: we just use it.
2466 * Case (2) means we look for a clone--if we have one, use it
2467 * otherwise grab ownership of cv. Case (3) means we look for a
2468 * clone (for non-XSUBs) and have to create one if we don't
2470 * Why look for a clone in case (2) when we could just grab
2471 * ownership of cv straight away? Well, we could be recursing,
2472 * i.e. we originally tried to enter cv while another thread
2473 * owned it (hence we used a clone) but it has been freed up
2474 * and we're now recursing into it. It may or may not be "better"
2475 * to use the clone but at least CvDEPTH can be trusted.
2477 if (CvOWNER(cv) == thr || CvXSUB(cv))
2478 MUTEX_UNLOCK(CvMUTEXP(cv));
2480 /* Case (2) or (3) */
2484 * XXX Might it be better to release CvMUTEXP(cv) while we
2485 * do the hv_fetch? We might find someone has pinched it
2486 * when we look again, in which case we would be in case
2487 * (3) instead of (2) so we'd have to clone. Would the fact
2488 * that we released the mutex more quickly make up for this?
2490 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2492 /* We already have a clone to use */
2493 MUTEX_UNLOCK(CvMUTEXP(cv));
2495 DEBUG_S(PerlIO_printf(Perl_debug_log,
2496 "entersub: %p already has clone %p:%s\n",
2497 thr, cv, SvPEEK((SV*)cv)));
2500 if (CvDEPTH(cv) == 0)
2501 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2504 /* (2) => grab ownership of cv. (3) => make clone */
2508 MUTEX_UNLOCK(CvMUTEXP(cv));
2509 DEBUG_S(PerlIO_printf(Perl_debug_log,
2510 "entersub: %p grabbing %p:%s in stash %s\n",
2511 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2512 HvNAME(CvSTASH(cv)) : "(none)"));
2515 /* Make a new clone. */
2517 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2518 MUTEX_UNLOCK(CvMUTEXP(cv));
2519 DEBUG_S((PerlIO_printf(Perl_debug_log,
2520 "entersub: %p cloning %p:%s\n",
2521 thr, cv, SvPEEK((SV*)cv))));
2523 * We're creating a new clone so there's no race
2524 * between the original MUTEX_UNLOCK and the
2525 * SvREFCNT_inc since no one will be trying to undef
2526 * it out from underneath us. At least, I don't think
2529 clonecv = cv_clone(cv);
2530 SvREFCNT_dec(cv); /* finished with this */
2531 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2532 CvOWNER(clonecv) = thr;
2536 DEBUG_S(if (CvDEPTH(cv) != 0)
2537 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2539 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2542 #endif /* USE_THREADS */
2545 #ifdef PERL_XSUB_OLDSTYLE
2546 if (CvOLDSTYLE(cv)) {
2547 I32 (*fp3)(int,int,int);
2549 register I32 items = SP - MARK;
2550 /* We dont worry to copy from @_. */
2555 PL_stack_sp = mark + 1;
2556 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2557 items = (*fp3)(CvXSUBANY(cv).any_i32,
2558 MARK - PL_stack_base + 1,
2560 PL_stack_sp = PL_stack_base + items;
2563 #endif /* PERL_XSUB_OLDSTYLE */
2565 I32 markix = TOPMARK;
2570 /* Need to copy @_ to stack. Alternative may be to
2571 * switch stack to @_, and copy return values
2572 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2576 av = (AV*)PL_curpad[0];
2578 av = GvAV(PL_defgv);
2579 #endif /* USE_THREADS */
2580 items = AvFILLp(av) + 1; /* @_ is not tieable */
2583 /* Mark is at the end of the stack. */
2585 Copy(AvARRAY(av), SP + 1, items, SV*);
2590 /* We assume first XSUB in &DB::sub is the called one. */
2592 SAVEVPTR(PL_curcop);
2593 PL_curcop = PL_curcopdb;
2596 /* Do we need to open block here? XXXX */
2597 (void)(*CvXSUB(cv))(aTHXo_ cv);
2599 /* Enforce some sanity in scalar context. */
2600 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2601 if (markix > PL_stack_sp - PL_stack_base)
2602 *(PL_stack_base + markix) = &PL_sv_undef;
2604 *(PL_stack_base + markix) = *PL_stack_sp;
2605 PL_stack_sp = PL_stack_base + markix;
2613 register I32 items = SP - MARK;
2614 AV* padlist = CvPADLIST(cv);
2615 SV** svp = AvARRAY(padlist);
2616 push_return(PL_op->op_next);
2617 PUSHBLOCK(cx, CXt_SUB, MARK);
2620 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2621 * that eval'' ops within this sub know the correct lexical space.
2622 * Owing the speed considerations, we choose to search for the cv
2623 * in doeval() instead.
2625 if (CvDEPTH(cv) < 2)
2626 (void)SvREFCNT_inc(cv);
2627 else { /* save temporaries on recursion? */
2628 PERL_STACK_OVERFLOW_CHECK();
2629 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2631 AV *newpad = newAV();
2632 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2633 I32 ix = AvFILLp((AV*)svp[1]);
2634 I32 names_fill = AvFILLp((AV*)svp[0]);
2635 svp = AvARRAY(svp[0]);
2636 for ( ;ix > 0; ix--) {
2637 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2638 char *name = SvPVX(svp[ix]);
2639 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2640 || *name == '&') /* anonymous code? */
2642 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2644 else { /* our own lexical */
2646 av_store(newpad, ix, sv = (SV*)newAV());
2647 else if (*name == '%')
2648 av_store(newpad, ix, sv = (SV*)newHV());
2650 av_store(newpad, ix, sv = NEWSV(0,0));
2654 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2655 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2658 av_store(newpad, ix, sv = NEWSV(0,0));
2662 av = newAV(); /* will be @_ */
2664 av_store(newpad, 0, (SV*)av);
2665 AvFLAGS(av) = AVf_REIFY;
2666 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2667 AvFILLp(padlist) = CvDEPTH(cv);
2668 svp = AvARRAY(padlist);
2673 AV* av = (AV*)PL_curpad[0];
2675 items = AvFILLp(av) + 1;
2677 /* Mark is at the end of the stack. */
2679 Copy(AvARRAY(av), SP + 1, items, SV*);
2684 #endif /* USE_THREADS */
2685 SAVEVPTR(PL_curpad);
2686 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2689 #endif /* USE_THREADS */
2695 DEBUG_S(PerlIO_printf(Perl_debug_log,
2696 "%p entersub preparing @_\n", thr));
2698 av = (AV*)PL_curpad[0];
2700 /* @_ is normally not REAL--this should only ever
2701 * happen when DB::sub() calls things that modify @_ */
2707 cx->blk_sub.savearray = GvAV(PL_defgv);
2708 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2709 #endif /* USE_THREADS */
2710 cx->blk_sub.oldcurpad = PL_curpad;
2711 cx->blk_sub.argarray = av;
2714 if (items > AvMAX(av) + 1) {
2716 if (AvARRAY(av) != ary) {
2717 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2718 SvPVX(av) = (char*)ary;
2720 if (items > AvMAX(av) + 1) {
2721 AvMAX(av) = items - 1;
2722 Renew(ary,items,SV*);
2724 SvPVX(av) = (char*)ary;
2727 Copy(MARK,AvARRAY(av),items,SV*);
2728 AvFILLp(av) = items - 1;
2736 /* warning must come *after* we fully set up the context
2737 * stuff so that __WARN__ handlers can safely dounwind()
2740 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2741 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2742 sub_crush_depth(cv);
2744 DEBUG_S(PerlIO_printf(Perl_debug_log,
2745 "%p entersub returning %p\n", thr, CvSTART(cv)));
2747 RETURNOP(CvSTART(cv));
2752 Perl_sub_crush_depth(pTHX_ CV *cv)
2755 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2757 SV* tmpstr = sv_newmortal();
2758 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2759 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2770 U32 lval = PL_op->op_flags & OPf_MOD;
2771 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2775 elem -= PL_curcop->cop_arybase;
2776 if (SvTYPE(av) != SVt_PVAV)
2778 svp = av_fetch(av, elem, lval && !defer);
2780 if (!svp || *svp == &PL_sv_undef) {
2783 DIE(aTHX_ PL_no_aelem, elem);
2784 lv = sv_newmortal();
2785 sv_upgrade(lv, SVt_PVLV);
2787 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2788 LvTARG(lv) = SvREFCNT_inc(av);
2789 LvTARGOFF(lv) = elem;
2794 if (PL_op->op_private & OPpLVAL_INTRO)
2795 save_aelem(av, elem, svp);
2796 else if (PL_op->op_private & OPpDEREF)
2797 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2799 sv = (svp ? *svp : &PL_sv_undef);
2800 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2801 sv = sv_mortalcopy(sv);
2807 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2813 Perl_croak(aTHX_ PL_no_modify);
2814 if (SvTYPE(sv) < SVt_RV)
2815 sv_upgrade(sv, SVt_RV);
2816 else if (SvTYPE(sv) >= SVt_PV) {
2817 (void)SvOOK_off(sv);
2818 Safefree(SvPVX(sv));
2819 SvLEN(sv) = SvCUR(sv) = 0;
2823 SvRV(sv) = NEWSV(355,0);
2826 SvRV(sv) = (SV*)newAV();
2829 SvRV(sv) = (SV*)newHV();
2844 if (SvTYPE(rsv) == SVt_PVCV) {
2850 SETs(method_common(sv, Null(U32*)));
2857 SV* sv = cSVOP->op_sv;
2858 U32 hash = SvUVX(sv);
2860 XPUSHs(method_common(sv, &hash));
2865 S_method_common(pTHX_ SV* meth, U32* hashp)
2876 name = SvPV(meth, namelen);
2877 sv = *(PL_stack_base + TOPMARK + 1);
2880 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2891 !(packname = SvPV(sv, packlen)) ||
2892 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2893 !(ob=(SV*)GvIO(iogv)))
2896 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2897 ? !isIDFIRST_utf8((U8*)packname)
2898 : !isIDFIRST(*packname)
2901 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2902 SvOK(sv) ? "without a package or object reference"
2903 : "on an undefined value");
2905 stash = gv_stashpvn(packname, packlen, TRUE);
2908 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2911 if (!ob || !(SvOBJECT(ob)
2912 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2915 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2919 stash = SvSTASH(ob);
2922 /* shortcut for simple names */
2924 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2926 gv = (GV*)HeVAL(he);
2927 if (isGV(gv) && GvCV(gv) &&
2928 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2929 return (SV*)GvCV(gv);
2933 gv = gv_fetchmethod(stash, name);
2940 for (p = name; *p; p++) {
2942 sep = p, leaf = p + 1;
2943 else if (*p == ':' && *(p + 1) == ':')
2944 sep = p, leaf = p + 2;
2946 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2947 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2948 packlen = strlen(packname);
2952 packlen = sep - name;
2954 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2955 if (gv && isGV(gv)) {
2957 "Can't locate object method \"%s\" via package \"%s\"",
2962 "Can't locate object method \"%s\" via package \"%s\""
2963 " (perhaps you forgot to load \"%s\"?)",
2964 leaf, packname, packname);
2967 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2972 unset_cvowner(pTHXo_ void *cvarg)
2974 register CV* cv = (CV *) cvarg;
2977 #endif /* DEBUGGING */
2979 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2980 thr, cv, SvPEEK((SV*)cv))));
2981 MUTEX_LOCK(CvMUTEXP(cv));
2982 DEBUG_S(if (CvDEPTH(cv) != 0)
2983 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2985 assert(thr == CvOWNER(cv));
2987 MUTEX_UNLOCK(CvMUTEXP(cv));
2990 #endif /* USE_THREADS */