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;
162 /* Need a safe copy elsewhere since we're just about to
164 olds = (U8*)SvPV(right,len);
165 s = (U8*)savepv((char*)olds);
168 s = (U8*)SvPV(right,len);
169 l = (U8*)SvPV(left, targlen);
171 sv_setpvn(TARG, (char*)l, targlen);
173 sv_utf8_upgrade(TARG);
174 /* Extend TARG to length of right (s) */
175 targlen = SvCUR(TARG) + len;
177 /* plus one for each hi-byte char if we have to upgrade */
178 for (c = s; *c; c++) {
183 SvGROW(TARG, targlen+1);
184 /* And now copy, maybe upgrading right to UTF8 on the fly */
185 for (c = (U8*)SvEND(TARG); *s; s++) {
186 if (*s & 0x80 && !right_utf)
187 c = uv_to_utf8(c, *s);
191 SvCUR_set(TARG, targlen);
201 s = (U8*)SvPV(left,len);
203 sv_insert(TARG, 0, 0, (char*)s, len);
207 sv_setpvn(TARG, (char *)s, len);
209 else if (SvGMAGICAL(TARG))
211 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG)
212 sv_setpv(TARG, ""); /* Suppress warning. */
213 s = (U8*)SvPV(right,len);
215 #if defined(PERL_Y2KWARN)
216 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
218 char *s = SvPV(TARG,n);
219 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
220 && (n == 2 || !isDIGIT(s[n-3])))
222 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
223 "about to append an integer to '19'");
227 sv_catpvn(TARG, (char *)s, len);
230 sv_setpvn(TARG, (char *)s, len); /* suppress warning */
242 if (PL_op->op_flags & OPf_MOD) {
243 if (PL_op->op_private & OPpLVAL_INTRO)
244 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
245 else if (PL_op->op_private & OPpDEREF) {
247 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
256 tryAMAGICunTARGET(iter, 0);
257 PL_last_in_gv = (GV*)(*PL_stack_sp--);
258 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
259 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
260 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
263 XPUSHs((SV*)PL_last_in_gv);
266 PL_last_in_gv = (GV*)(*PL_stack_sp--);
269 return do_readline();
274 djSP; tryAMAGICbinSET(eq,0);
277 SETs(boolSV(TOPn == value));
285 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
286 DIE(aTHX_ PL_no_modify);
287 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
288 SvIVX(TOPs) != IV_MAX)
291 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
306 RETURNOP(cLOGOP->op_other);
312 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
315 SETn( left + right );
323 AV *av = GvAV(cGVOP_gv);
324 U32 lval = PL_op->op_flags & OPf_MOD;
325 SV** svp = av_fetch(av, PL_op->op_private, lval);
326 SV *sv = (svp ? *svp : &PL_sv_undef);
328 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
329 sv = sv_mortalcopy(sv);
336 djSP; dMARK; dTARGET;
338 do_join(TARG, *MARK, MARK, SP);
349 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
350 * will be enough to hold an OP*.
352 SV* sv = sv_newmortal();
353 sv_upgrade(sv, SVt_PVLV);
355 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
363 /* Oversized hot code. */
367 djSP; dMARK; dORIGMARK;
374 if (PL_op->op_flags & OPf_STACKED)
378 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
379 if (MARK == ORIGMARK) {
380 /* If using default handle then we need to make space to
381 * pass object as 1st arg, so move other args up ...
385 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
389 *MARK = SvTIED_obj((SV*)gv, mg);
392 call_method("PRINT", G_SCALAR);
400 if (!(io = GvIO(gv))) {
402 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
403 report_evil_fh(gv, io, PL_op->op_type);
404 SETERRNO(EBADF,RMS$_IFI);
407 else if (!(fp = IoOFP(io))) {
408 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
410 /* integrate with report_evil_fh()? */
413 SV* sv = sv_newmortal();
414 gv_efullname4(sv, gv, Nullch, FALSE);
415 name = SvPV_nolen(sv);
418 Perl_warner(aTHX_ WARN_IO,
419 "Filehandle %s opened only for input", name);
421 Perl_warner(aTHX_ WARN_IO,
422 "Filehandle opened only for input");
424 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
425 report_evil_fh(gv, io, PL_op->op_type);
427 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
434 if (!do_print(*MARK, fp))
438 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
447 if (!do_print(*MARK, fp))
456 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
459 if (IoFLAGS(io) & IOf_FLUSH)
460 if (PerlIO_flush(fp) == EOF)
481 tryAMAGICunDEREF(to_av);
484 if (SvTYPE(av) != SVt_PVAV)
485 DIE(aTHX_ "Not an ARRAY reference");
486 if (PL_op->op_flags & OPf_REF) {
492 if (SvTYPE(sv) == SVt_PVAV) {
494 if (PL_op->op_flags & OPf_REF) {
502 if (SvTYPE(sv) != SVt_PVGV) {
506 if (SvGMAGICAL(sv)) {
512 if (PL_op->op_flags & OPf_REF ||
513 PL_op->op_private & HINT_STRICT_REFS)
514 DIE(aTHX_ PL_no_usym, "an ARRAY");
515 if (ckWARN(WARN_UNINITIALIZED))
517 if (GIMME == G_ARRAY) {
524 if ((PL_op->op_flags & OPf_SPECIAL) &&
525 !(PL_op->op_flags & OPf_MOD))
527 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
529 && (!is_gv_magical(sym,len,0)
530 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
536 if (PL_op->op_private & HINT_STRICT_REFS)
537 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
538 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
545 if (PL_op->op_private & OPpLVAL_INTRO)
547 if (PL_op->op_flags & OPf_REF) {
554 if (GIMME == G_ARRAY) {
555 I32 maxarg = AvFILL(av) + 1;
556 (void)POPs; /* XXXX May be optimized away? */
558 if (SvRMAGICAL(av)) {
560 for (i=0; i < maxarg; i++) {
561 SV **svp = av_fetch(av, i, FALSE);
562 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
566 Copy(AvARRAY(av), SP+1, maxarg, SV*);
572 I32 maxarg = AvFILL(av) + 1;
585 tryAMAGICunDEREF(to_hv);
588 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
589 DIE(aTHX_ "Not a HASH reference");
590 if (PL_op->op_flags & OPf_REF) {
596 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
598 if (PL_op->op_flags & OPf_REF) {
606 if (SvTYPE(sv) != SVt_PVGV) {
610 if (SvGMAGICAL(sv)) {
616 if (PL_op->op_flags & OPf_REF ||
617 PL_op->op_private & HINT_STRICT_REFS)
618 DIE(aTHX_ PL_no_usym, "a HASH");
619 if (ckWARN(WARN_UNINITIALIZED))
621 if (GIMME == G_ARRAY) {
628 if ((PL_op->op_flags & OPf_SPECIAL) &&
629 !(PL_op->op_flags & OPf_MOD))
631 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
633 && (!is_gv_magical(sym,len,0)
634 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
640 if (PL_op->op_private & HINT_STRICT_REFS)
641 DIE(aTHX_ PL_no_symref, sym, "a HASH");
642 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
649 if (PL_op->op_private & OPpLVAL_INTRO)
651 if (PL_op->op_flags & OPf_REF) {
658 if (GIMME == G_ARRAY) { /* array wanted */
659 *PL_stack_sp = (SV*)hv;
664 if (SvTYPE(hv) == SVt_PVAV)
665 hv = avhv_keys((AV*)hv);
667 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
668 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
678 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
684 leftop = ((BINOP*)PL_op)->op_last;
686 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
687 leftop = ((LISTOP*)leftop)->op_first;
689 /* Skip PUSHMARK and each element already assigned to. */
690 for (i = lelem - firstlelem; i > 0; i--) {
691 leftop = leftop->op_sibling;
694 if (leftop->op_type != OP_RV2HV)
699 av_fill(ary, 0); /* clear all but the fields hash */
700 if (lastrelem >= relem) {
701 while (relem < lastrelem) { /* gobble up all the rest */
705 /* Avoid a memory leak when avhv_store_ent dies. */
706 tmpstr = sv_newmortal();
707 sv_setsv(tmpstr,relem[1]); /* value */
709 if (avhv_store_ent(ary,relem[0],tmpstr,0))
710 (void)SvREFCNT_inc(tmpstr);
711 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
717 if (relem == lastrelem)
723 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
727 if (ckWARN(WARN_MISC)) {
728 if (relem == firstrelem &&
730 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
731 SvTYPE(SvRV(*relem)) == SVt_PVHV))
733 Perl_warner(aTHX_ WARN_MISC,
734 "Reference found where even-sized list expected");
737 Perl_warner(aTHX_ WARN_MISC,
738 "Odd number of elements in hash assignment");
740 if (SvTYPE(hash) == SVt_PVAV) {
742 tmpstr = sv_newmortal();
743 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
744 (void)SvREFCNT_inc(tmpstr);
745 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
750 tmpstr = NEWSV(29,0);
751 didstore = hv_store_ent(hash,*relem,tmpstr,0);
752 if (SvMAGICAL(hash)) {
753 if (SvSMAGICAL(tmpstr))
766 SV **lastlelem = PL_stack_sp;
767 SV **lastrelem = PL_stack_base + POPMARK;
768 SV **firstrelem = PL_stack_base + POPMARK + 1;
769 SV **firstlelem = lastrelem + 1;
782 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
784 /* If there's a common identifier on both sides we have to take
785 * special care that assigning the identifier on the left doesn't
786 * clobber a value on the right that's used later in the list.
788 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
789 EXTEND_MORTAL(lastrelem - firstrelem + 1);
790 for (relem = firstrelem; relem <= lastrelem; relem++) {
793 TAINT_NOT; /* Each item is independent */
794 *relem = sv_mortalcopy(sv);
804 while (lelem <= lastlelem) {
805 TAINT_NOT; /* Each item stands on its own, taintwise. */
807 switch (SvTYPE(sv)) {
810 magic = SvMAGICAL(ary) != 0;
811 if (PL_op->op_private & OPpASSIGN_HASH) {
812 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
818 do_oddball((HV*)ary, relem, firstrelem);
820 relem = lastrelem + 1;
825 av_extend(ary, lastrelem - relem);
827 while (relem <= lastrelem) { /* gobble up all the rest */
833 didstore = av_store(ary,i++,sv);
843 case SVt_PVHV: { /* normal hash */
847 magic = SvMAGICAL(hash) != 0;
850 while (relem < lastrelem) { /* gobble up all the rest */
855 sv = &PL_sv_no, relem++;
856 tmpstr = NEWSV(29,0);
858 sv_setsv(tmpstr,*relem); /* value */
860 didstore = hv_store_ent(hash,sv,tmpstr,0);
862 if (SvSMAGICAL(tmpstr))
869 if (relem == lastrelem) {
870 do_oddball(hash, relem, firstrelem);
876 if (SvIMMORTAL(sv)) {
877 if (relem <= lastrelem)
881 if (relem <= lastrelem) {
882 sv_setsv(sv, *relem);
886 sv_setsv(sv, &PL_sv_undef);
891 if (PL_delaymagic & ~DM_DELAY) {
892 if (PL_delaymagic & DM_UID) {
894 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
897 (void)setreuid(PL_uid,PL_euid);
900 if ((PL_delaymagic & DM_UID) == DM_RUID) {
901 (void)setruid(PL_uid);
902 PL_delaymagic &= ~DM_RUID;
904 # endif /* HAS_SETRUID */
906 if ((PL_delaymagic & DM_UID) == DM_EUID) {
907 (void)seteuid(PL_uid);
908 PL_delaymagic &= ~DM_EUID;
910 # endif /* HAS_SETEUID */
911 if (PL_delaymagic & DM_UID) {
912 if (PL_uid != PL_euid)
913 DIE(aTHX_ "No setreuid available");
914 (void)PerlProc_setuid(PL_uid);
916 # endif /* HAS_SETREUID */
917 #endif /* HAS_SETRESUID */
918 PL_uid = PerlProc_getuid();
919 PL_euid = PerlProc_geteuid();
921 if (PL_delaymagic & DM_GID) {
923 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
926 (void)setregid(PL_gid,PL_egid);
929 if ((PL_delaymagic & DM_GID) == DM_RGID) {
930 (void)setrgid(PL_gid);
931 PL_delaymagic &= ~DM_RGID;
933 # endif /* HAS_SETRGID */
935 if ((PL_delaymagic & DM_GID) == DM_EGID) {
936 (void)setegid(PL_gid);
937 PL_delaymagic &= ~DM_EGID;
939 # endif /* HAS_SETEGID */
940 if (PL_delaymagic & DM_GID) {
941 if (PL_gid != PL_egid)
942 DIE(aTHX_ "No setregid available");
943 (void)PerlProc_setgid(PL_gid);
945 # endif /* HAS_SETREGID */
946 #endif /* HAS_SETRESGID */
947 PL_gid = PerlProc_getgid();
948 PL_egid = PerlProc_getegid();
950 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
957 else if (gimme == G_SCALAR) {
960 SETi(lastrelem - firstrelem + 1);
966 SP = firstrelem + (lastlelem - firstlelem);
967 lelem = firstlelem + (relem - firstrelem);
969 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
977 register PMOP *pm = cPMOP;
978 SV *rv = sv_newmortal();
979 SV *sv = newSVrv(rv, "Regexp");
980 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
987 register PMOP *pm = cPMOP;
992 I32 r_flags = REXEC_CHECKED;
993 char *truebase; /* Start of string */
994 register REGEXP *rx = pm->op_pmregexp;
999 I32 oldsave = PL_savestack_ix;
1000 I32 update_minmatch = 1;
1001 I32 had_zerolen = 0;
1003 if (PL_op->op_flags & OPf_STACKED)
1009 PUTBACK; /* EVAL blocks need stack_sp. */
1010 s = SvPV(TARG, len);
1013 DIE(aTHX_ "panic: do_match");
1014 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1015 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1018 if (pm->op_pmdynflags & PMdf_USED) {
1020 if (gimme == G_ARRAY)
1025 if (!rx->prelen && PL_curpm) {
1027 rx = pm->op_pmregexp;
1029 if (rx->minlen > len) goto failure;
1033 /* XXXX What part of this is needed with true \G-support? */
1034 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1036 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1037 MAGIC* mg = mg_find(TARG, 'g');
1038 if (mg && mg->mg_len >= 0) {
1039 if (!(rx->reganch & ROPT_GPOS_SEEN))
1040 rx->endp[0] = rx->startp[0] = mg->mg_len;
1041 else if (rx->reganch & ROPT_ANCH_GPOS) {
1042 r_flags |= REXEC_IGNOREPOS;
1043 rx->endp[0] = rx->startp[0] = mg->mg_len;
1045 minmatch = (mg->mg_flags & MGf_MINMATCH);
1046 update_minmatch = 0;
1050 if ((gimme != G_ARRAY && !global && rx->nparens)
1051 || SvTEMP(TARG) || PL_sawampersand)
1052 r_flags |= REXEC_COPY_STR;
1054 r_flags |= REXEC_SCREAM;
1056 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1057 SAVEINT(PL_multiline);
1058 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1062 if (global && rx->startp[0] != -1) {
1063 t = s = rx->endp[0] + truebase;
1064 if ((s + rx->minlen) > strend)
1066 if (update_minmatch++)
1067 minmatch = had_zerolen;
1069 if (rx->reganch & RE_USE_INTUIT) {
1070 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1074 if ( (rx->reganch & ROPT_CHECK_ALL)
1076 && ((rx->reganch & ROPT_NOSCAN)
1077 || !((rx->reganch & RE_INTUIT_TAIL)
1078 && (r_flags & REXEC_SCREAM)))
1079 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1082 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1085 if (pm->op_pmflags & PMf_ONCE)
1086 pm->op_pmdynflags |= PMdf_USED;
1095 RX_MATCH_TAINTED_on(rx);
1096 TAINT_IF(RX_MATCH_TAINTED(rx));
1097 if (gimme == G_ARRAY) {
1100 iters = rx->nparens;
1101 if (global && !iters)
1105 SPAGAIN; /* EVAL blocks could move the stack. */
1106 EXTEND(SP, iters + i);
1107 EXTEND_MORTAL(iters + i);
1108 for (i = !i; i <= iters; i++) {
1109 PUSHs(sv_newmortal());
1111 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1112 len = rx->endp[i] - rx->startp[i];
1113 s = rx->startp[i] + truebase;
1114 sv_setpvn(*SP, s, len);
1115 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1117 sv_utf8_downgrade(*SP, TRUE);
1122 had_zerolen = (rx->startp[0] != -1
1123 && rx->startp[0] == rx->endp[0]);
1124 PUTBACK; /* EVAL blocks may use stack */
1125 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1130 LEAVE_SCOPE(oldsave);
1136 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1137 mg = mg_find(TARG, 'g');
1139 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1140 mg = mg_find(TARG, 'g');
1142 if (rx->startp[0] != -1) {
1143 mg->mg_len = rx->endp[0];
1144 if (rx->startp[0] == rx->endp[0])
1145 mg->mg_flags |= MGf_MINMATCH;
1147 mg->mg_flags &= ~MGf_MINMATCH;
1150 LEAVE_SCOPE(oldsave);
1154 yup: /* Confirmed by INTUIT */
1156 RX_MATCH_TAINTED_on(rx);
1157 TAINT_IF(RX_MATCH_TAINTED(rx));
1159 if (pm->op_pmflags & PMf_ONCE)
1160 pm->op_pmdynflags |= PMdf_USED;
1161 if (RX_MATCH_COPIED(rx))
1162 Safefree(rx->subbeg);
1163 RX_MATCH_COPIED_off(rx);
1164 rx->subbeg = Nullch;
1166 rx->subbeg = truebase;
1167 rx->startp[0] = s - truebase;
1168 rx->endp[0] = s - truebase + rx->minlen;
1169 rx->sublen = strend - truebase;
1172 if (PL_sawampersand) {
1175 rx->subbeg = savepvn(t, strend - t);
1176 rx->sublen = strend - t;
1177 RX_MATCH_COPIED_on(rx);
1178 off = rx->startp[0] = s - t;
1179 rx->endp[0] = off + rx->minlen;
1181 else { /* startp/endp are used by @- @+. */
1182 rx->startp[0] = s - truebase;
1183 rx->endp[0] = s - truebase + rx->minlen;
1185 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1186 LEAVE_SCOPE(oldsave);
1191 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1192 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1193 MAGIC* mg = mg_find(TARG, 'g');
1198 LEAVE_SCOPE(oldsave);
1199 if (gimme == G_ARRAY)
1205 Perl_do_readline(pTHX)
1207 dSP; dTARGETSTACKED;
1212 register IO *io = GvIO(PL_last_in_gv);
1213 register I32 type = PL_op->op_type;
1214 I32 gimme = GIMME_V;
1217 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1219 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1222 call_method("READLINE", gimme);
1225 if (gimme == G_SCALAR)
1226 SvSetMagicSV_nosteal(TARG, TOPs);
1233 if (IoFLAGS(io) & IOf_ARGV) {
1234 if (IoFLAGS(io) & IOf_START) {
1236 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1237 IoFLAGS(io) &= ~IOf_START;
1238 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1239 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1240 SvSETMAGIC(GvSV(PL_last_in_gv));
1245 fp = nextargv(PL_last_in_gv);
1246 if (!fp) { /* Note: fp != IoIFP(io) */
1247 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1250 else if (type == OP_GLOB) {
1251 SV *tmpcmd = NEWSV(55, 0);
1255 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1256 /* since spawning off a process is a real performance hit */
1258 #include <descrip.h>
1259 #include <lib$routines.h>
1262 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1263 char vmsspec[NAM$C_MAXRSS+1];
1264 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1265 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1266 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1269 struct dsc$descriptor_s wilddsc
1270 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1271 struct dsc$descriptor_vs rsdsc
1272 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1273 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1275 /* We could find out if there's an explicit dev/dir or version
1276 by peeking into lib$find_file's internal context at
1277 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1278 but that's unsupported, so I don't want to do it now and
1279 have it bite someone in the future. */
1280 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1281 cp = SvPV(tmpglob,i);
1283 if (cp[i] == ';') hasver = 1;
1285 if (sts) hasver = 1;
1289 hasdir = isunix = 1;
1292 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1297 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1299 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1300 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1301 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1302 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1303 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1304 &dfltdsc,NULL,NULL,NULL))&1)) {
1305 end = rstr + (unsigned long int) *rslt;
1306 if (!hasver) while (*end != ';') end--;
1307 *(end++) = '\n'; *end = '\0';
1308 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1310 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1315 while (*(--begin) != ']' && *begin != '>') ;
1318 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1320 if (cxt) (void)lib$find_file_end(&cxt);
1321 if (ok && sts != RMS$_NMF &&
1322 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1325 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1327 PerlIO_close(tmpfp);
1331 PerlIO_rewind(tmpfp);
1333 IoIFP(io) = fp = tmpfp;
1334 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1339 #ifdef MACOS_TRADITIONAL
1340 sv_setpv(tmpcmd, "glob ");
1341 sv_catsv(tmpcmd, tmpglob);
1342 sv_catpv(tmpcmd, " |");
1346 sv_setpv(tmpcmd, "for a in ");
1347 sv_catsv(tmpcmd, tmpglob);
1348 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1351 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1352 sv_catsv(tmpcmd, tmpglob);
1354 sv_setpv(tmpcmd, "perlglob ");
1355 sv_catsv(tmpcmd, tmpglob);
1356 sv_catpv(tmpcmd, " |");
1361 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1362 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1363 sv_catsv(tmpcmd, tmpglob);
1364 sv_catpv(tmpcmd, "' 2>/dev/null |");
1366 sv_setpv(tmpcmd, "echo ");
1367 sv_catsv(tmpcmd, tmpglob);
1369 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1371 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1374 #endif /* !DOSISH */
1375 #endif /* MACOS_TRADITIONAL */
1376 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1377 FALSE, O_RDONLY, 0, Nullfp);
1383 else if (type == OP_GLOB)
1385 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1386 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1387 || fp == PerlIO_stderr()))
1389 /* integrate with report_evil_fh()? */
1391 if (isGV(PL_last_in_gv)) { /* can this ever fail? */
1392 SV* sv = sv_newmortal();
1393 gv_efullname4(sv, PL_last_in_gv, Nullch, FALSE);
1394 name = SvPV_nolen(sv);
1397 Perl_warner(aTHX_ WARN_IO,
1398 "Filehandle %s opened only for output", name);
1400 Perl_warner(aTHX_ WARN_IO,
1401 "Filehandle opened only for output");
1405 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1406 if (type == OP_GLOB)
1407 Perl_warner(aTHX_ WARN_GLOB,
1408 "glob failed (can't start child: %s)",
1411 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1413 if (gimme == G_SCALAR) {
1414 (void)SvOK_off(TARG);
1420 if (gimme == G_SCALAR) {
1424 (void)SvUPGRADE(sv, SVt_PV);
1425 tmplen = SvLEN(sv); /* remember if already alloced */
1427 Sv_Grow(sv, 80); /* try short-buffering it */
1428 if (type == OP_RCATLINE)
1434 sv = sv_2mortal(NEWSV(57, 80));
1438 /* delay EOF state for a snarfed empty file */
1439 #define SNARF_EOF(gimme,rs,io,sv) \
1440 (gimme != G_SCALAR || SvCUR(sv) \
1441 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1444 if (!sv_gets(sv, fp, offset)
1445 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1447 PerlIO_clearerr(fp);
1448 if (IoFLAGS(io) & IOf_ARGV) {
1449 fp = nextargv(PL_last_in_gv);
1452 (void)do_close(PL_last_in_gv, FALSE);
1454 else if (type == OP_GLOB) {
1455 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1456 Perl_warner(aTHX_ WARN_GLOB,
1457 "glob failed (child exited with status %d%s)",
1458 (int)(STATUS_CURRENT >> 8),
1459 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1462 if (gimme == G_SCALAR) {
1463 (void)SvOK_off(TARG);
1468 /* This should not be marked tainted if the fp is marked clean */
1469 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1474 IoFLAGS(io) |= IOf_NOLINE;
1477 if (type == OP_GLOB) {
1480 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1481 tmps = SvEND(sv) - 1;
1482 if (*tmps == *SvPVX(PL_rs)) {
1487 for (tmps = SvPVX(sv); *tmps; tmps++)
1488 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1489 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1491 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1492 (void)POPs; /* Unmatched wildcard? Chuck it... */
1496 if (gimme == G_ARRAY) {
1497 if (SvLEN(sv) - SvCUR(sv) > 20) {
1498 SvLEN_set(sv, SvCUR(sv)+1);
1499 Renew(SvPVX(sv), SvLEN(sv), char);
1501 sv = sv_2mortal(NEWSV(58, 80));
1504 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1505 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1509 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1510 Renew(SvPVX(sv), SvLEN(sv), char);
1519 register PERL_CONTEXT *cx;
1520 I32 gimme = OP_GIMME(PL_op, -1);
1523 if (cxstack_ix >= 0)
1524 gimme = cxstack[cxstack_ix].blk_gimme;
1532 PUSHBLOCK(cx, CXt_BLOCK, SP);
1544 U32 lval = PL_op->op_flags & OPf_MOD;
1545 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1548 if (SvTYPE(hv) == SVt_PVHV) {
1549 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1550 svp = he ? &HeVAL(he) : 0;
1552 else if (SvTYPE(hv) == SVt_PVAV) {
1553 if (PL_op->op_private & OPpLVAL_INTRO)
1554 DIE(aTHX_ "Can't localize pseudo-hash element");
1555 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1561 if (!svp || *svp == &PL_sv_undef) {
1566 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1568 lv = sv_newmortal();
1569 sv_upgrade(lv, SVt_PVLV);
1571 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1572 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1573 LvTARG(lv) = SvREFCNT_inc(hv);
1578 if (PL_op->op_private & OPpLVAL_INTRO) {
1579 if (HvNAME(hv) && isGV(*svp))
1580 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1582 save_helem(hv, keysv, svp);
1584 else if (PL_op->op_private & OPpDEREF)
1585 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1587 sv = (svp ? *svp : &PL_sv_undef);
1588 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1589 * Pushing the magical RHS on to the stack is useless, since
1590 * that magic is soon destined to be misled by the local(),
1591 * and thus the later pp_sassign() will fail to mg_get() the
1592 * old value. This should also cure problems with delayed
1593 * mg_get()s. GSAR 98-07-03 */
1594 if (!lval && SvGMAGICAL(sv))
1595 sv = sv_mortalcopy(sv);
1603 register PERL_CONTEXT *cx;
1609 if (PL_op->op_flags & OPf_SPECIAL) {
1610 cx = &cxstack[cxstack_ix];
1611 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1616 gimme = OP_GIMME(PL_op, -1);
1618 if (cxstack_ix >= 0)
1619 gimme = cxstack[cxstack_ix].blk_gimme;
1625 if (gimme == G_VOID)
1627 else if (gimme == G_SCALAR) {
1630 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1633 *MARK = sv_mortalcopy(TOPs);
1636 *MARK = &PL_sv_undef;
1640 else if (gimme == G_ARRAY) {
1641 /* in case LEAVE wipes old return values */
1642 for (mark = newsp + 1; mark <= SP; mark++) {
1643 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1644 *mark = sv_mortalcopy(*mark);
1645 TAINT_NOT; /* Each item is independent */
1649 PL_curpm = newpm; /* Don't pop $1 et al till now */
1659 register PERL_CONTEXT *cx;
1665 cx = &cxstack[cxstack_ix];
1666 if (CxTYPE(cx) != CXt_LOOP)
1667 DIE(aTHX_ "panic: pp_iter");
1669 itersvp = CxITERVAR(cx);
1670 av = cx->blk_loop.iterary;
1671 if (SvTYPE(av) != SVt_PVAV) {
1672 /* iterate ($min .. $max) */
1673 if (cx->blk_loop.iterlval) {
1674 /* string increment */
1675 register SV* cur = cx->blk_loop.iterlval;
1677 char *max = SvPV((SV*)av, maxlen);
1678 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1679 #ifndef USE_THREADS /* don't risk potential race */
1680 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1681 /* safe to reuse old SV */
1682 sv_setsv(*itersvp, cur);
1687 /* we need a fresh SV every time so that loop body sees a
1688 * completely new SV for closures/references to work as
1690 SvREFCNT_dec(*itersvp);
1691 *itersvp = newSVsv(cur);
1693 if (strEQ(SvPVX(cur), max))
1694 sv_setiv(cur, 0); /* terminate next time */
1701 /* integer increment */
1702 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1705 #ifndef USE_THREADS /* don't risk potential race */
1706 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1707 /* safe to reuse old SV */
1708 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1713 /* we need a fresh SV every time so that loop body sees a
1714 * completely new SV for closures/references to work as they
1716 SvREFCNT_dec(*itersvp);
1717 *itersvp = newSViv(cx->blk_loop.iterix++);
1723 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1726 SvREFCNT_dec(*itersvp);
1728 if ((sv = SvMAGICAL(av)
1729 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1730 : AvARRAY(av)[++cx->blk_loop.iterix]))
1734 if (av != PL_curstack && SvIMMORTAL(sv)) {
1735 SV *lv = cx->blk_loop.iterlval;
1736 if (lv && SvREFCNT(lv) > 1) {
1741 SvREFCNT_dec(LvTARG(lv));
1743 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1744 sv_upgrade(lv, SVt_PVLV);
1746 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1748 LvTARG(lv) = SvREFCNT_inc(av);
1749 LvTARGOFF(lv) = cx->blk_loop.iterix;
1750 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1754 *itersvp = SvREFCNT_inc(sv);
1761 register PMOP *pm = cPMOP;
1777 register REGEXP *rx = pm->op_pmregexp;
1779 int force_on_match = 0;
1780 I32 oldsave = PL_savestack_ix;
1782 /* known replacement string? */
1783 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1784 if (PL_op->op_flags & OPf_STACKED)
1790 if (SvREADONLY(TARG)
1791 || (SvTYPE(TARG) > SVt_PVLV
1792 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1793 DIE(aTHX_ PL_no_modify);
1796 s = SvPV(TARG, len);
1797 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1799 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1800 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1807 DIE(aTHX_ "panic: do_subst");
1810 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1811 position, once with zero-length,
1812 second time with non-zero. */
1814 if (!rx->prelen && PL_curpm) {
1816 rx = pm->op_pmregexp;
1818 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1819 ? REXEC_COPY_STR : 0;
1821 r_flags |= REXEC_SCREAM;
1822 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1823 SAVEINT(PL_multiline);
1824 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1827 if (rx->reganch & RE_USE_INTUIT) {
1828 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1832 /* How to do it in subst? */
1833 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1835 && ((rx->reganch & ROPT_NOSCAN)
1836 || !((rx->reganch & RE_INTUIT_TAIL)
1837 && (r_flags & REXEC_SCREAM))))
1842 /* only replace once? */
1843 once = !(rpm->op_pmflags & PMf_GLOBAL);
1845 /* known replacement string? */
1846 c = dstr ? SvPV(dstr, clen) : Nullch;
1848 /* can do inplace substitution? */
1849 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1850 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1851 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1852 r_flags | REXEC_CHECKED))
1856 LEAVE_SCOPE(oldsave);
1859 if (force_on_match) {
1861 s = SvPV_force(TARG, len);
1866 SvSCREAM_off(TARG); /* disable possible screamer */
1868 rxtainted |= RX_MATCH_TAINTED(rx);
1869 m = orig + rx->startp[0];
1870 d = orig + rx->endp[0];
1872 if (m - s > strend - d) { /* faster to shorten from end */
1874 Copy(c, m, clen, char);
1879 Move(d, m, i, char);
1883 SvCUR_set(TARG, m - s);
1886 else if ((i = m - s)) { /* faster from front */
1894 Copy(c, m, clen, char);
1899 Copy(c, d, clen, char);
1904 TAINT_IF(rxtainted & 1);
1910 if (iters++ > maxiters)
1911 DIE(aTHX_ "Substitution loop");
1912 rxtainted |= RX_MATCH_TAINTED(rx);
1913 m = rx->startp[0] + orig;
1917 Move(s, d, i, char);
1921 Copy(c, d, clen, char);
1924 s = rx->endp[0] + orig;
1925 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1927 /* don't match same null twice */
1928 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1931 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1932 Move(s, d, i+1, char); /* include the NUL */
1934 TAINT_IF(rxtainted & 1);
1936 PUSHs(sv_2mortal(newSViv((I32)iters)));
1938 (void)SvPOK_only_UTF8(TARG);
1939 TAINT_IF(rxtainted);
1940 if (SvSMAGICAL(TARG)) {
1946 LEAVE_SCOPE(oldsave);
1950 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1951 r_flags | REXEC_CHECKED))
1953 if (force_on_match) {
1955 s = SvPV_force(TARG, len);
1958 rxtainted |= RX_MATCH_TAINTED(rx);
1959 dstr = NEWSV(25, len);
1960 sv_setpvn(dstr, m, s-m);
1963 register PERL_CONTEXT *cx;
1966 RETURNOP(cPMOP->op_pmreplroot);
1968 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1970 if (iters++ > maxiters)
1971 DIE(aTHX_ "Substitution loop");
1972 rxtainted |= RX_MATCH_TAINTED(rx);
1973 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1978 strend = s + (strend - m);
1980 m = rx->startp[0] + orig;
1981 sv_catpvn(dstr, s, m-s);
1982 s = rx->endp[0] + orig;
1984 sv_catpvn(dstr, c, clen);
1987 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1988 sv_catpvn(dstr, s, strend - s);
1990 (void)SvOOK_off(TARG);
1991 Safefree(SvPVX(TARG));
1992 SvPVX(TARG) = SvPVX(dstr);
1993 SvCUR_set(TARG, SvCUR(dstr));
1994 SvLEN_set(TARG, SvLEN(dstr));
1998 TAINT_IF(rxtainted & 1);
2000 PUSHs(sv_2mortal(newSViv((I32)iters)));
2002 (void)SvPOK_only(TARG);
2003 TAINT_IF(rxtainted);
2006 LEAVE_SCOPE(oldsave);
2015 LEAVE_SCOPE(oldsave);
2024 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2025 ++*PL_markstack_ptr;
2026 LEAVE; /* exit inner scope */
2029 if (PL_stack_base + *PL_markstack_ptr > SP) {
2031 I32 gimme = GIMME_V;
2033 LEAVE; /* exit outer scope */
2034 (void)POPMARK; /* pop src */
2035 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2036 (void)POPMARK; /* pop dst */
2037 SP = PL_stack_base + POPMARK; /* pop original mark */
2038 if (gimme == G_SCALAR) {
2042 else if (gimme == G_ARRAY)
2049 ENTER; /* enter inner scope */
2052 src = PL_stack_base[*PL_markstack_ptr];
2056 RETURNOP(cLOGOP->op_other);
2067 register PERL_CONTEXT *cx;
2073 if (gimme == G_SCALAR) {
2076 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2078 *MARK = SvREFCNT_inc(TOPs);
2083 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2085 *MARK = sv_mortalcopy(sv);
2090 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2094 *MARK = &PL_sv_undef;
2098 else if (gimme == G_ARRAY) {
2099 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2100 if (!SvTEMP(*MARK)) {
2101 *MARK = sv_mortalcopy(*MARK);
2102 TAINT_NOT; /* Each item is independent */
2108 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2109 PL_curpm = newpm; /* ... and pop $1 et al */
2113 return pop_return();
2116 /* This duplicates the above code because the above code must not
2117 * get any slower by more conditions */
2125 register PERL_CONTEXT *cx;
2132 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2133 /* We are an argument to a function or grep().
2134 * This kind of lvalueness was legal before lvalue
2135 * subroutines too, so be backward compatible:
2136 * cannot report errors. */
2138 /* Scalar context *is* possible, on the LHS of -> only,
2139 * as in f()->meth(). But this is not an lvalue. */
2140 if (gimme == G_SCALAR)
2142 if (gimme == G_ARRAY) {
2143 if (!CvLVALUE(cx->blk_sub.cv))
2144 goto temporise_array;
2145 EXTEND_MORTAL(SP - newsp);
2146 for (mark = newsp + 1; mark <= SP; mark++) {
2149 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2150 *mark = sv_mortalcopy(*mark);
2152 /* Can be a localized value subject to deletion. */
2153 PL_tmps_stack[++PL_tmps_ix] = *mark;
2154 (void)SvREFCNT_inc(*mark);
2159 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2160 /* Here we go for robustness, not for speed, so we change all
2161 * the refcounts so the caller gets a live guy. Cannot set
2162 * TEMP, so sv_2mortal is out of question. */
2163 if (!CvLVALUE(cx->blk_sub.cv)) {
2168 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2170 if (gimme == G_SCALAR) {
2174 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2179 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2180 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2182 else { /* Can be a localized value
2183 * subject to deletion. */
2184 PL_tmps_stack[++PL_tmps_ix] = *mark;
2185 (void)SvREFCNT_inc(*mark);
2188 else { /* Should not happen? */
2193 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2194 (MARK > SP ? "Empty array" : "Array"));
2198 else if (gimme == G_ARRAY) {
2199 EXTEND_MORTAL(SP - newsp);
2200 for (mark = newsp + 1; mark <= SP; mark++) {
2201 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2202 /* Might be flattened array after $#array = */
2208 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2209 (*mark != &PL_sv_undef)
2211 ? "a readonly value" : "a temporary")
2212 : "an uninitialized value");
2215 /* Can be a localized value subject to deletion. */
2216 PL_tmps_stack[++PL_tmps_ix] = *mark;
2217 (void)SvREFCNT_inc(*mark);
2223 if (gimme == G_SCALAR) {
2227 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2229 *MARK = SvREFCNT_inc(TOPs);
2234 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2236 *MARK = sv_mortalcopy(sv);
2241 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2245 *MARK = &PL_sv_undef;
2249 else if (gimme == G_ARRAY) {
2251 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2252 if (!SvTEMP(*MARK)) {
2253 *MARK = sv_mortalcopy(*MARK);
2254 TAINT_NOT; /* Each item is independent */
2261 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2262 PL_curpm = newpm; /* ... and pop $1 et al */
2266 return pop_return();
2271 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2274 SV *dbsv = GvSV(PL_DBsub);
2276 if (!PERLDB_SUB_NN) {
2280 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2281 || strEQ(GvNAME(gv), "END")
2282 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2283 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2284 && (gv = (GV*)*svp) ))) {
2285 /* Use GV from the stack as a fallback. */
2286 /* GV is potentially non-unique, or contain different CV. */
2287 SV *tmp = newRV((SV*)cv);
2288 sv_setsv(dbsv, tmp);
2292 gv_efullname3(dbsv, gv, Nullch);
2296 (void)SvUPGRADE(dbsv, SVt_PVIV);
2297 (void)SvIOK_on(dbsv);
2298 SAVEIV(SvIVX(dbsv));
2299 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2303 PL_curcopdb = PL_curcop;
2304 cv = GvCV(PL_DBsub);
2314 register PERL_CONTEXT *cx;
2316 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2319 DIE(aTHX_ "Not a CODE reference");
2320 switch (SvTYPE(sv)) {
2326 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2328 SP = PL_stack_base + POPMARK;
2331 if (SvGMAGICAL(sv)) {
2333 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2336 sym = SvPV(sv, n_a);
2338 DIE(aTHX_ PL_no_usym, "a subroutine");
2339 if (PL_op->op_private & HINT_STRICT_REFS)
2340 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2341 cv = get_cv(sym, TRUE);
2345 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2346 tryAMAGICunDEREF(to_cv);
2349 if (SvTYPE(cv) == SVt_PVCV)
2354 DIE(aTHX_ "Not a CODE reference");
2359 if (!(cv = GvCVu((GV*)sv)))
2360 cv = sv_2cv(sv, &stash, &gv, FALSE);
2373 if (!CvROOT(cv) && !CvXSUB(cv)) {
2377 /* anonymous or undef'd function leaves us no recourse */
2378 if (CvANON(cv) || !(gv = CvGV(cv)))
2379 DIE(aTHX_ "Undefined subroutine called");
2381 /* autoloaded stub? */
2382 if (cv != GvCV(gv)) {
2385 /* should call AUTOLOAD now? */
2388 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2395 sub_name = sv_newmortal();
2396 gv_efullname3(sub_name, gv, Nullch);
2397 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2401 DIE(aTHX_ "Not a CODE reference");
2406 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2407 cv = get_db_sub(&sv, cv);
2409 DIE(aTHX_ "No DBsub routine");
2414 * First we need to check if the sub or method requires locking.
2415 * If so, we gain a lock on the CV, the first argument or the
2416 * stash (for static methods), as appropriate. This has to be
2417 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2418 * reschedule by returning a new op.
2420 MUTEX_LOCK(CvMUTEXP(cv));
2421 if (CvFLAGS(cv) & CVf_LOCKED) {
2423 if (CvFLAGS(cv) & CVf_METHOD) {
2424 if (SP > PL_stack_base + TOPMARK)
2425 sv = *(PL_stack_base + TOPMARK + 1);
2427 AV *av = (AV*)PL_curpad[0];
2428 if (hasargs || !av || AvFILLp(av) < 0
2429 || !(sv = AvARRAY(av)[0]))
2431 MUTEX_UNLOCK(CvMUTEXP(cv));
2432 DIE(aTHX_ "no argument for locked method call");
2439 char *stashname = SvPV(sv, len);
2440 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2446 MUTEX_UNLOCK(CvMUTEXP(cv));
2447 mg = condpair_magic(sv);
2448 MUTEX_LOCK(MgMUTEXP(mg));
2449 if (MgOWNER(mg) == thr)
2450 MUTEX_UNLOCK(MgMUTEXP(mg));
2453 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2455 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2457 MUTEX_UNLOCK(MgMUTEXP(mg));
2458 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2460 MUTEX_LOCK(CvMUTEXP(cv));
2463 * Now we have permission to enter the sub, we must distinguish
2464 * four cases. (0) It's an XSUB (in which case we don't care
2465 * about ownership); (1) it's ours already (and we're recursing);
2466 * (2) it's free (but we may already be using a cached clone);
2467 * (3) another thread owns it. Case (1) is easy: we just use it.
2468 * Case (2) means we look for a clone--if we have one, use it
2469 * otherwise grab ownership of cv. Case (3) means we look for a
2470 * clone (for non-XSUBs) and have to create one if we don't
2472 * Why look for a clone in case (2) when we could just grab
2473 * ownership of cv straight away? Well, we could be recursing,
2474 * i.e. we originally tried to enter cv while another thread
2475 * owned it (hence we used a clone) but it has been freed up
2476 * and we're now recursing into it. It may or may not be "better"
2477 * to use the clone but at least CvDEPTH can be trusted.
2479 if (CvOWNER(cv) == thr || CvXSUB(cv))
2480 MUTEX_UNLOCK(CvMUTEXP(cv));
2482 /* Case (2) or (3) */
2486 * XXX Might it be better to release CvMUTEXP(cv) while we
2487 * do the hv_fetch? We might find someone has pinched it
2488 * when we look again, in which case we would be in case
2489 * (3) instead of (2) so we'd have to clone. Would the fact
2490 * that we released the mutex more quickly make up for this?
2492 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2494 /* We already have a clone to use */
2495 MUTEX_UNLOCK(CvMUTEXP(cv));
2497 DEBUG_S(PerlIO_printf(Perl_debug_log,
2498 "entersub: %p already has clone %p:%s\n",
2499 thr, cv, SvPEEK((SV*)cv)));
2502 if (CvDEPTH(cv) == 0)
2503 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2506 /* (2) => grab ownership of cv. (3) => make clone */
2510 MUTEX_UNLOCK(CvMUTEXP(cv));
2511 DEBUG_S(PerlIO_printf(Perl_debug_log,
2512 "entersub: %p grabbing %p:%s in stash %s\n",
2513 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2514 HvNAME(CvSTASH(cv)) : "(none)"));
2517 /* Make a new clone. */
2519 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2520 MUTEX_UNLOCK(CvMUTEXP(cv));
2521 DEBUG_S((PerlIO_printf(Perl_debug_log,
2522 "entersub: %p cloning %p:%s\n",
2523 thr, cv, SvPEEK((SV*)cv))));
2525 * We're creating a new clone so there's no race
2526 * between the original MUTEX_UNLOCK and the
2527 * SvREFCNT_inc since no one will be trying to undef
2528 * it out from underneath us. At least, I don't think
2531 clonecv = cv_clone(cv);
2532 SvREFCNT_dec(cv); /* finished with this */
2533 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2534 CvOWNER(clonecv) = thr;
2538 DEBUG_S(if (CvDEPTH(cv) != 0)
2539 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2541 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2544 #endif /* USE_THREADS */
2547 #ifdef PERL_XSUB_OLDSTYLE
2548 if (CvOLDSTYLE(cv)) {
2549 I32 (*fp3)(int,int,int);
2551 register I32 items = SP - MARK;
2552 /* We dont worry to copy from @_. */
2557 PL_stack_sp = mark + 1;
2558 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2559 items = (*fp3)(CvXSUBANY(cv).any_i32,
2560 MARK - PL_stack_base + 1,
2562 PL_stack_sp = PL_stack_base + items;
2565 #endif /* PERL_XSUB_OLDSTYLE */
2567 I32 markix = TOPMARK;
2572 /* Need to copy @_ to stack. Alternative may be to
2573 * switch stack to @_, and copy return values
2574 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2578 av = (AV*)PL_curpad[0];
2580 av = GvAV(PL_defgv);
2581 #endif /* USE_THREADS */
2582 items = AvFILLp(av) + 1; /* @_ is not tieable */
2585 /* Mark is at the end of the stack. */
2587 Copy(AvARRAY(av), SP + 1, items, SV*);
2592 /* We assume first XSUB in &DB::sub is the called one. */
2594 SAVEVPTR(PL_curcop);
2595 PL_curcop = PL_curcopdb;
2598 /* Do we need to open block here? XXXX */
2599 (void)(*CvXSUB(cv))(aTHXo_ cv);
2601 /* Enforce some sanity in scalar context. */
2602 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2603 if (markix > PL_stack_sp - PL_stack_base)
2604 *(PL_stack_base + markix) = &PL_sv_undef;
2606 *(PL_stack_base + markix) = *PL_stack_sp;
2607 PL_stack_sp = PL_stack_base + markix;
2615 register I32 items = SP - MARK;
2616 AV* padlist = CvPADLIST(cv);
2617 SV** svp = AvARRAY(padlist);
2618 push_return(PL_op->op_next);
2619 PUSHBLOCK(cx, CXt_SUB, MARK);
2622 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2623 * that eval'' ops within this sub know the correct lexical space.
2624 * Owing the speed considerations, we choose to search for the cv
2625 * in doeval() instead.
2627 if (CvDEPTH(cv) < 2)
2628 (void)SvREFCNT_inc(cv);
2629 else { /* save temporaries on recursion? */
2630 PERL_STACK_OVERFLOW_CHECK();
2631 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2633 AV *newpad = newAV();
2634 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2635 I32 ix = AvFILLp((AV*)svp[1]);
2636 I32 names_fill = AvFILLp((AV*)svp[0]);
2637 svp = AvARRAY(svp[0]);
2638 for ( ;ix > 0; ix--) {
2639 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2640 char *name = SvPVX(svp[ix]);
2641 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2642 || *name == '&') /* anonymous code? */
2644 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2646 else { /* our own lexical */
2648 av_store(newpad, ix, sv = (SV*)newAV());
2649 else if (*name == '%')
2650 av_store(newpad, ix, sv = (SV*)newHV());
2652 av_store(newpad, ix, sv = NEWSV(0,0));
2656 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2657 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2660 av_store(newpad, ix, sv = NEWSV(0,0));
2664 av = newAV(); /* will be @_ */
2666 av_store(newpad, 0, (SV*)av);
2667 AvFLAGS(av) = AVf_REIFY;
2668 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2669 AvFILLp(padlist) = CvDEPTH(cv);
2670 svp = AvARRAY(padlist);
2675 AV* av = (AV*)PL_curpad[0];
2677 items = AvFILLp(av) + 1;
2679 /* Mark is at the end of the stack. */
2681 Copy(AvARRAY(av), SP + 1, items, SV*);
2686 #endif /* USE_THREADS */
2687 SAVEVPTR(PL_curpad);
2688 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2691 #endif /* USE_THREADS */
2697 DEBUG_S(PerlIO_printf(Perl_debug_log,
2698 "%p entersub preparing @_\n", thr));
2700 av = (AV*)PL_curpad[0];
2702 /* @_ is normally not REAL--this should only ever
2703 * happen when DB::sub() calls things that modify @_ */
2709 cx->blk_sub.savearray = GvAV(PL_defgv);
2710 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2711 #endif /* USE_THREADS */
2712 cx->blk_sub.oldcurpad = PL_curpad;
2713 cx->blk_sub.argarray = av;
2716 if (items > AvMAX(av) + 1) {
2718 if (AvARRAY(av) != ary) {
2719 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2720 SvPVX(av) = (char*)ary;
2722 if (items > AvMAX(av) + 1) {
2723 AvMAX(av) = items - 1;
2724 Renew(ary,items,SV*);
2726 SvPVX(av) = (char*)ary;
2729 Copy(MARK,AvARRAY(av),items,SV*);
2730 AvFILLp(av) = items - 1;
2738 /* warning must come *after* we fully set up the context
2739 * stuff so that __WARN__ handlers can safely dounwind()
2742 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2743 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2744 sub_crush_depth(cv);
2746 DEBUG_S(PerlIO_printf(Perl_debug_log,
2747 "%p entersub returning %p\n", thr, CvSTART(cv)));
2749 RETURNOP(CvSTART(cv));
2754 Perl_sub_crush_depth(pTHX_ CV *cv)
2757 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2759 SV* tmpstr = sv_newmortal();
2760 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2761 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2772 U32 lval = PL_op->op_flags & OPf_MOD;
2773 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2777 elem -= PL_curcop->cop_arybase;
2778 if (SvTYPE(av) != SVt_PVAV)
2780 svp = av_fetch(av, elem, lval && !defer);
2782 if (!svp || *svp == &PL_sv_undef) {
2785 DIE(aTHX_ PL_no_aelem, elem);
2786 lv = sv_newmortal();
2787 sv_upgrade(lv, SVt_PVLV);
2789 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2790 LvTARG(lv) = SvREFCNT_inc(av);
2791 LvTARGOFF(lv) = elem;
2796 if (PL_op->op_private & OPpLVAL_INTRO)
2797 save_aelem(av, elem, svp);
2798 else if (PL_op->op_private & OPpDEREF)
2799 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2801 sv = (svp ? *svp : &PL_sv_undef);
2802 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2803 sv = sv_mortalcopy(sv);
2809 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2815 Perl_croak(aTHX_ PL_no_modify);
2816 if (SvTYPE(sv) < SVt_RV)
2817 sv_upgrade(sv, SVt_RV);
2818 else if (SvTYPE(sv) >= SVt_PV) {
2819 (void)SvOOK_off(sv);
2820 Safefree(SvPVX(sv));
2821 SvLEN(sv) = SvCUR(sv) = 0;
2825 SvRV(sv) = NEWSV(355,0);
2828 SvRV(sv) = (SV*)newAV();
2831 SvRV(sv) = (SV*)newHV();
2846 if (SvTYPE(rsv) == SVt_PVCV) {
2852 SETs(method_common(sv, Null(U32*)));
2859 SV* sv = cSVOP->op_sv;
2860 U32 hash = SvUVX(sv);
2862 XPUSHs(method_common(sv, &hash));
2867 S_method_common(pTHX_ SV* meth, U32* hashp)
2878 name = SvPV(meth, namelen);
2879 sv = *(PL_stack_base + TOPMARK + 1);
2890 !(packname = SvPV(sv, packlen)) ||
2891 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2892 !(ob=(SV*)GvIO(iogv)))
2895 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2896 ? !isIDFIRST_utf8((U8*)packname)
2897 : !isIDFIRST(*packname)
2900 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2901 SvOK(sv) ? "without a package or object reference"
2902 : "on an undefined value");
2904 stash = gv_stashpvn(packname, packlen, TRUE);
2907 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2910 if (!ob || !(SvOBJECT(ob)
2911 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2914 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2918 stash = SvSTASH(ob);
2921 /* shortcut for simple names */
2923 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2925 gv = (GV*)HeVAL(he);
2926 if (isGV(gv) && GvCV(gv) &&
2927 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2928 return (SV*)GvCV(gv);
2932 gv = gv_fetchmethod(stash, name);
2939 for (p = name; *p; p++) {
2941 sep = p, leaf = p + 1;
2942 else if (*p == ':' && *(p + 1) == ':')
2943 sep = p, leaf = p + 2;
2945 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2946 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2947 packlen = strlen(packname);
2951 packlen = sep - name;
2953 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2954 if (gv && isGV(gv)) {
2956 "Can't locate object method \"%s\" via package \"%s\"",
2961 "Can't locate object method \"%s\" via package \"%s\""
2962 " (perhaps you forgot to load \"%s\"?)",
2963 leaf, packname, packname);
2966 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2971 unset_cvowner(pTHXo_ void *cvarg)
2973 register CV* cv = (CV *) cvarg;
2976 #endif /* DEBUGGING */
2978 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2979 thr, cv, SvPEEK((SV*)cv))));
2980 MUTEX_LOCK(CvMUTEXP(cv));
2981 DEBUG_S(if (CvDEPTH(cv) != 0)
2982 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2984 assert(thr == CvOWNER(cv));
2986 MUTEX_UNLOCK(CvMUTEXP(cv));
2989 #endif /* USE_THREADS */