3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
29 static void unset_cvowner(pTHXo_ void *cvarg);
30 #endif /* USE_THREADS */
41 PL_curcop = (COP*)PL_op;
42 TAINT_NOT; /* Each statement is presumed innocent */
43 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
52 if (PL_op->op_private & OPpLVAL_INTRO)
53 PUSHs(save_scalar(cGVOP_gv));
55 PUSHs(GvSV(cGVOP_gv));
66 PL_curcop = (COP*)PL_op;
72 PUSHMARK(PL_stack_sp);
82 sv_setpvn(TARG,s,len);
83 if (SvUTF8(TOPs) && !IN_BYTE)
92 XPUSHs((SV*)cGVOP_gv);
103 RETURNOP(cLOGOP->op_other);
111 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
113 temp = left; left = right; right = temp;
115 if (PL_tainting && PL_tainted && !SvTAINTED(left))
117 SvSetMagicSV(right, left);
126 RETURNOP(cLOGOP->op_other);
128 RETURNOP(cLOGOP->op_next);
134 TAINT_NOT; /* Each statement is presumed innocent */
135 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
137 oldsave = PL_scopestack[PL_scopestack_ix - 1];
138 LEAVE_SCOPE(oldsave);
144 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
149 bool left_utf = DO_UTF8(left);
150 bool right_utf = DO_UTF8(right);
152 if (left_utf != right_utf) {
153 if (TARG == right && !right_utf) {
154 sv_utf8_upgrade(TARG); /* Now straight binary copy */
158 /* Set TARG to PV(left), then add right */
159 U8 *l, *c, *olds = NULL;
161 s = (U8*)SvPV(right,len);
163 /* Take a copy since we're about to overwrite TARG */
164 olds = s = (U8*)savepvn((char*)s, len);
166 if (SvGMAGICAL(left))
168 else if (!SvOK(left) && SvTYPE(left) <= SVt_PVMG)
169 sv_setpv(left, ""); /* Suppress warning. */
170 l = (U8*)SvPV(left, targlen);
172 sv_setpvn(TARG, (char*)l, targlen);
174 sv_utf8_upgrade(TARG);
175 /* Extend TARG to length of right (s) */
176 targlen = SvCUR(TARG) + len;
178 /* plus one for each hi-byte char if we have to upgrade */
179 for (c = s; c < s + len; c++) {
184 SvGROW(TARG, targlen+1);
185 /* And now copy, maybe upgrading right to UTF8 on the fly */
186 for (c = (U8*)SvEND(TARG); len--; s++) {
187 if (*s & 0x80 && !right_utf)
188 c = uv_to_utf8(c, *s);
192 SvCUR_set(TARG, targlen);
202 s = (U8*)SvPV(left,len);
204 sv_insert(TARG, 0, 0, (char*)s, len);
208 sv_setpvn(TARG, (char *)s, len);
210 else if (SvGMAGICAL(TARG))
212 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG)
213 sv_setpv(TARG, ""); /* Suppress warning. */
214 s = (U8*)SvPV(right,len);
216 #if defined(PERL_Y2KWARN)
217 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
219 char *s = SvPV(TARG,n);
220 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
221 && (n == 2 || !isDIGIT(s[n-3])))
223 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
224 "about to append an integer to '19'");
228 sv_catpvn(TARG, (char *)s, len);
231 sv_setpvn(TARG, (char *)s, len); /* suppress warning */
243 if (PL_op->op_flags & OPf_MOD) {
244 if (PL_op->op_private & OPpLVAL_INTRO)
245 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
246 else if (PL_op->op_private & OPpDEREF) {
248 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
257 tryAMAGICunTARGET(iter, 0);
258 PL_last_in_gv = (GV*)(*PL_stack_sp--);
259 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
260 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
261 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
264 XPUSHs((SV*)PL_last_in_gv);
267 PL_last_in_gv = (GV*)(*PL_stack_sp--);
270 return do_readline();
275 djSP; tryAMAGICbinSET(eq,0);
278 SETs(boolSV(TOPn == value));
286 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
287 DIE(aTHX_ PL_no_modify);
288 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
289 SvIVX(TOPs) != IV_MAX)
292 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
307 RETURNOP(cLOGOP->op_other);
313 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
316 SETn( left + right );
324 AV *av = GvAV(cGVOP_gv);
325 U32 lval = PL_op->op_flags & OPf_MOD;
326 SV** svp = av_fetch(av, PL_op->op_private, lval);
327 SV *sv = (svp ? *svp : &PL_sv_undef);
329 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
330 sv = sv_mortalcopy(sv);
337 djSP; dMARK; dTARGET;
339 do_join(TARG, *MARK, MARK, SP);
350 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
351 * will be enough to hold an OP*.
353 SV* sv = sv_newmortal();
354 sv_upgrade(sv, SVt_PVLV);
356 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
364 /* Oversized hot code. */
368 djSP; dMARK; dORIGMARK;
375 if (PL_op->op_flags & OPf_STACKED)
379 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
380 if (MARK == ORIGMARK) {
381 /* If using default handle then we need to make space to
382 * pass object as 1st arg, so move other args up ...
386 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
390 *MARK = SvTIED_obj((SV*)gv, mg);
393 call_method("PRINT", G_SCALAR);
401 if (!(io = GvIO(gv))) {
403 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
404 report_evil_fh(gv, io, PL_op->op_type);
405 SETERRNO(EBADF,RMS$_IFI);
408 else if (!(fp = IoOFP(io))) {
409 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
411 /* integrate with report_evil_fh()? */
414 SV* sv = sv_newmortal();
415 gv_efullname4(sv, gv, Nullch, FALSE);
416 name = SvPV_nolen(sv);
419 Perl_warner(aTHX_ WARN_IO,
420 "Filehandle %s opened only for input", name);
422 Perl_warner(aTHX_ WARN_IO,
423 "Filehandle opened only for input");
425 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
426 report_evil_fh(gv, io, PL_op->op_type);
428 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
435 if (!do_print(*MARK, fp))
439 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
448 if (!do_print(*MARK, fp))
457 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
460 if (IoFLAGS(io) & IOf_FLUSH)
461 if (PerlIO_flush(fp) == EOF)
482 tryAMAGICunDEREF(to_av);
485 if (SvTYPE(av) != SVt_PVAV)
486 DIE(aTHX_ "Not an ARRAY reference");
487 if (PL_op->op_flags & OPf_REF) {
493 if (SvTYPE(sv) == SVt_PVAV) {
495 if (PL_op->op_flags & OPf_REF) {
503 if (SvTYPE(sv) != SVt_PVGV) {
507 if (SvGMAGICAL(sv)) {
513 if (PL_op->op_flags & OPf_REF ||
514 PL_op->op_private & HINT_STRICT_REFS)
515 DIE(aTHX_ PL_no_usym, "an ARRAY");
516 if (ckWARN(WARN_UNINITIALIZED))
518 if (GIMME == G_ARRAY) {
525 if ((PL_op->op_flags & OPf_SPECIAL) &&
526 !(PL_op->op_flags & OPf_MOD))
528 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
530 && (!is_gv_magical(sym,len,0)
531 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
537 if (PL_op->op_private & HINT_STRICT_REFS)
538 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
539 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
546 if (PL_op->op_private & OPpLVAL_INTRO)
548 if (PL_op->op_flags & OPf_REF) {
555 if (GIMME == G_ARRAY) {
556 I32 maxarg = AvFILL(av) + 1;
557 (void)POPs; /* XXXX May be optimized away? */
559 if (SvRMAGICAL(av)) {
561 for (i=0; i < maxarg; i++) {
562 SV **svp = av_fetch(av, i, FALSE);
563 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
567 Copy(AvARRAY(av), SP+1, maxarg, SV*);
573 I32 maxarg = AvFILL(av) + 1;
586 tryAMAGICunDEREF(to_hv);
589 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
590 DIE(aTHX_ "Not a HASH reference");
591 if (PL_op->op_flags & OPf_REF) {
597 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
599 if (PL_op->op_flags & OPf_REF) {
607 if (SvTYPE(sv) != SVt_PVGV) {
611 if (SvGMAGICAL(sv)) {
617 if (PL_op->op_flags & OPf_REF ||
618 PL_op->op_private & HINT_STRICT_REFS)
619 DIE(aTHX_ PL_no_usym, "a HASH");
620 if (ckWARN(WARN_UNINITIALIZED))
622 if (GIMME == G_ARRAY) {
629 if ((PL_op->op_flags & OPf_SPECIAL) &&
630 !(PL_op->op_flags & OPf_MOD))
632 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
634 && (!is_gv_magical(sym,len,0)
635 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
641 if (PL_op->op_private & HINT_STRICT_REFS)
642 DIE(aTHX_ PL_no_symref, sym, "a HASH");
643 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
650 if (PL_op->op_private & OPpLVAL_INTRO)
652 if (PL_op->op_flags & OPf_REF) {
659 if (GIMME == G_ARRAY) { /* array wanted */
660 *PL_stack_sp = (SV*)hv;
665 if (SvTYPE(hv) == SVt_PVAV)
666 hv = avhv_keys((AV*)hv);
668 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
669 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
679 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
685 leftop = ((BINOP*)PL_op)->op_last;
687 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
688 leftop = ((LISTOP*)leftop)->op_first;
690 /* Skip PUSHMARK and each element already assigned to. */
691 for (i = lelem - firstlelem; i > 0; i--) {
692 leftop = leftop->op_sibling;
695 if (leftop->op_type != OP_RV2HV)
700 av_fill(ary, 0); /* clear all but the fields hash */
701 if (lastrelem >= relem) {
702 while (relem < lastrelem) { /* gobble up all the rest */
706 /* Avoid a memory leak when avhv_store_ent dies. */
707 tmpstr = sv_newmortal();
708 sv_setsv(tmpstr,relem[1]); /* value */
710 if (avhv_store_ent(ary,relem[0],tmpstr,0))
711 (void)SvREFCNT_inc(tmpstr);
712 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
718 if (relem == lastrelem)
724 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
728 if (ckWARN(WARN_MISC)) {
729 if (relem == firstrelem &&
731 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
732 SvTYPE(SvRV(*relem)) == SVt_PVHV))
734 Perl_warner(aTHX_ WARN_MISC,
735 "Reference found where even-sized list expected");
738 Perl_warner(aTHX_ WARN_MISC,
739 "Odd number of elements in hash assignment");
741 if (SvTYPE(hash) == SVt_PVAV) {
743 tmpstr = sv_newmortal();
744 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
745 (void)SvREFCNT_inc(tmpstr);
746 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
751 tmpstr = NEWSV(29,0);
752 didstore = hv_store_ent(hash,*relem,tmpstr,0);
753 if (SvMAGICAL(hash)) {
754 if (SvSMAGICAL(tmpstr))
767 SV **lastlelem = PL_stack_sp;
768 SV **lastrelem = PL_stack_base + POPMARK;
769 SV **firstrelem = PL_stack_base + POPMARK + 1;
770 SV **firstlelem = lastrelem + 1;
783 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
785 /* If there's a common identifier on both sides we have to take
786 * special care that assigning the identifier on the left doesn't
787 * clobber a value on the right that's used later in the list.
789 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
790 EXTEND_MORTAL(lastrelem - firstrelem + 1);
791 for (relem = firstrelem; relem <= lastrelem; relem++) {
794 TAINT_NOT; /* Each item is independent */
795 *relem = sv_mortalcopy(sv);
805 while (lelem <= lastlelem) {
806 TAINT_NOT; /* Each item stands on its own, taintwise. */
808 switch (SvTYPE(sv)) {
811 magic = SvMAGICAL(ary) != 0;
812 if (PL_op->op_private & OPpASSIGN_HASH) {
813 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
819 do_oddball((HV*)ary, relem, firstrelem);
821 relem = lastrelem + 1;
826 av_extend(ary, lastrelem - relem);
828 while (relem <= lastrelem) { /* gobble up all the rest */
834 didstore = av_store(ary,i++,sv);
844 case SVt_PVHV: { /* normal hash */
848 magic = SvMAGICAL(hash) != 0;
851 while (relem < lastrelem) { /* gobble up all the rest */
856 sv = &PL_sv_no, relem++;
857 tmpstr = NEWSV(29,0);
859 sv_setsv(tmpstr,*relem); /* value */
861 didstore = hv_store_ent(hash,sv,tmpstr,0);
863 if (SvSMAGICAL(tmpstr))
870 if (relem == lastrelem) {
871 do_oddball(hash, relem, firstrelem);
877 if (SvIMMORTAL(sv)) {
878 if (relem <= lastrelem)
882 if (relem <= lastrelem) {
883 sv_setsv(sv, *relem);
887 sv_setsv(sv, &PL_sv_undef);
892 if (PL_delaymagic & ~DM_DELAY) {
893 if (PL_delaymagic & DM_UID) {
895 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
898 (void)setreuid(PL_uid,PL_euid);
901 if ((PL_delaymagic & DM_UID) == DM_RUID) {
902 (void)setruid(PL_uid);
903 PL_delaymagic &= ~DM_RUID;
905 # endif /* HAS_SETRUID */
907 if ((PL_delaymagic & DM_UID) == DM_EUID) {
908 (void)seteuid(PL_uid);
909 PL_delaymagic &= ~DM_EUID;
911 # endif /* HAS_SETEUID */
912 if (PL_delaymagic & DM_UID) {
913 if (PL_uid != PL_euid)
914 DIE(aTHX_ "No setreuid available");
915 (void)PerlProc_setuid(PL_uid);
917 # endif /* HAS_SETREUID */
918 #endif /* HAS_SETRESUID */
919 PL_uid = PerlProc_getuid();
920 PL_euid = PerlProc_geteuid();
922 if (PL_delaymagic & DM_GID) {
924 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
927 (void)setregid(PL_gid,PL_egid);
930 if ((PL_delaymagic & DM_GID) == DM_RGID) {
931 (void)setrgid(PL_gid);
932 PL_delaymagic &= ~DM_RGID;
934 # endif /* HAS_SETRGID */
936 if ((PL_delaymagic & DM_GID) == DM_EGID) {
937 (void)setegid(PL_gid);
938 PL_delaymagic &= ~DM_EGID;
940 # endif /* HAS_SETEGID */
941 if (PL_delaymagic & DM_GID) {
942 if (PL_gid != PL_egid)
943 DIE(aTHX_ "No setregid available");
944 (void)PerlProc_setgid(PL_gid);
946 # endif /* HAS_SETREGID */
947 #endif /* HAS_SETRESGID */
948 PL_gid = PerlProc_getgid();
949 PL_egid = PerlProc_getegid();
951 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
958 else if (gimme == G_SCALAR) {
961 SETi(lastrelem - firstrelem + 1);
967 SP = firstrelem + (lastlelem - firstlelem);
968 lelem = firstlelem + (relem - firstrelem);
970 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
978 register PMOP *pm = cPMOP;
979 SV *rv = sv_newmortal();
980 SV *sv = newSVrv(rv, "Regexp");
981 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
988 register PMOP *pm = cPMOP;
993 I32 r_flags = REXEC_CHECKED;
994 char *truebase; /* Start of string */
995 register REGEXP *rx = pm->op_pmregexp;
1000 I32 oldsave = PL_savestack_ix;
1001 I32 update_minmatch = 1;
1002 I32 had_zerolen = 0;
1004 if (PL_op->op_flags & OPf_STACKED)
1010 PUTBACK; /* EVAL blocks need stack_sp. */
1011 s = SvPV(TARG, len);
1014 DIE(aTHX_ "panic: do_match");
1015 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1016 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1019 if (pm->op_pmdynflags & PMdf_USED) {
1021 if (gimme == G_ARRAY)
1026 if (!rx->prelen && PL_curpm) {
1028 rx = pm->op_pmregexp;
1030 if (rx->minlen > len) goto failure;
1034 /* XXXX What part of this is needed with true \G-support? */
1035 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1037 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1038 MAGIC* mg = mg_find(TARG, 'g');
1039 if (mg && mg->mg_len >= 0) {
1040 if (!(rx->reganch & ROPT_GPOS_SEEN))
1041 rx->endp[0] = rx->startp[0] = mg->mg_len;
1042 else if (rx->reganch & ROPT_ANCH_GPOS) {
1043 r_flags |= REXEC_IGNOREPOS;
1044 rx->endp[0] = rx->startp[0] = mg->mg_len;
1046 minmatch = (mg->mg_flags & MGf_MINMATCH);
1047 update_minmatch = 0;
1051 if ((gimme != G_ARRAY && !global && rx->nparens)
1052 || SvTEMP(TARG) || PL_sawampersand)
1053 r_flags |= REXEC_COPY_STR;
1055 r_flags |= REXEC_SCREAM;
1057 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1058 SAVEINT(PL_multiline);
1059 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1063 if (global && rx->startp[0] != -1) {
1064 t = s = rx->endp[0] + truebase;
1065 if ((s + rx->minlen) > strend)
1067 if (update_minmatch++)
1068 minmatch = had_zerolen;
1070 if (rx->reganch & RE_USE_INTUIT) {
1071 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1075 if ( (rx->reganch & ROPT_CHECK_ALL)
1077 && ((rx->reganch & ROPT_NOSCAN)
1078 || !((rx->reganch & RE_INTUIT_TAIL)
1079 && (r_flags & REXEC_SCREAM)))
1080 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1083 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1086 if (pm->op_pmflags & PMf_ONCE)
1087 pm->op_pmdynflags |= PMdf_USED;
1096 RX_MATCH_TAINTED_on(rx);
1097 TAINT_IF(RX_MATCH_TAINTED(rx));
1098 if (gimme == G_ARRAY) {
1101 iters = rx->nparens;
1102 if (global && !iters)
1106 SPAGAIN; /* EVAL blocks could move the stack. */
1107 EXTEND(SP, iters + i);
1108 EXTEND_MORTAL(iters + i);
1109 for (i = !i; i <= iters; i++) {
1110 PUSHs(sv_newmortal());
1112 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1113 len = rx->endp[i] - rx->startp[i];
1114 s = rx->startp[i] + truebase;
1115 sv_setpvn(*SP, s, len);
1116 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1118 sv_utf8_downgrade(*SP, TRUE);
1123 had_zerolen = (rx->startp[0] != -1
1124 && rx->startp[0] == rx->endp[0]);
1125 PUTBACK; /* EVAL blocks may use stack */
1126 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1131 LEAVE_SCOPE(oldsave);
1137 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1138 mg = mg_find(TARG, 'g');
1140 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1141 mg = mg_find(TARG, 'g');
1143 if (rx->startp[0] != -1) {
1144 mg->mg_len = rx->endp[0];
1145 if (rx->startp[0] == rx->endp[0])
1146 mg->mg_flags |= MGf_MINMATCH;
1148 mg->mg_flags &= ~MGf_MINMATCH;
1151 LEAVE_SCOPE(oldsave);
1155 yup: /* Confirmed by INTUIT */
1157 RX_MATCH_TAINTED_on(rx);
1158 TAINT_IF(RX_MATCH_TAINTED(rx));
1160 if (pm->op_pmflags & PMf_ONCE)
1161 pm->op_pmdynflags |= PMdf_USED;
1162 if (RX_MATCH_COPIED(rx))
1163 Safefree(rx->subbeg);
1164 RX_MATCH_COPIED_off(rx);
1165 rx->subbeg = Nullch;
1167 rx->subbeg = truebase;
1168 rx->startp[0] = s - truebase;
1169 rx->endp[0] = s - truebase + rx->minlen;
1170 rx->sublen = strend - truebase;
1173 if (PL_sawampersand) {
1176 rx->subbeg = savepvn(t, strend - t);
1177 rx->sublen = strend - t;
1178 RX_MATCH_COPIED_on(rx);
1179 off = rx->startp[0] = s - t;
1180 rx->endp[0] = off + rx->minlen;
1182 else { /* startp/endp are used by @- @+. */
1183 rx->startp[0] = s - truebase;
1184 rx->endp[0] = s - truebase + rx->minlen;
1186 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1187 LEAVE_SCOPE(oldsave);
1192 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1193 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1194 MAGIC* mg = mg_find(TARG, 'g');
1199 LEAVE_SCOPE(oldsave);
1200 if (gimme == G_ARRAY)
1206 Perl_do_readline(pTHX)
1208 dSP; dTARGETSTACKED;
1213 register IO *io = GvIO(PL_last_in_gv);
1214 register I32 type = PL_op->op_type;
1215 I32 gimme = GIMME_V;
1218 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1220 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1223 call_method("READLINE", gimme);
1226 if (gimme == G_SCALAR)
1227 SvSetMagicSV_nosteal(TARG, TOPs);
1234 if (IoFLAGS(io) & IOf_ARGV) {
1235 if (IoFLAGS(io) & IOf_START) {
1237 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1238 IoFLAGS(io) &= ~IOf_START;
1239 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1240 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1241 SvSETMAGIC(GvSV(PL_last_in_gv));
1246 fp = nextargv(PL_last_in_gv);
1247 if (!fp) { /* Note: fp != IoIFP(io) */
1248 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1251 else if (type == OP_GLOB) {
1252 SV *tmpcmd = NEWSV(55, 0);
1256 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1257 /* since spawning off a process is a real performance hit */
1259 #include <descrip.h>
1260 #include <lib$routines.h>
1263 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1264 char vmsspec[NAM$C_MAXRSS+1];
1265 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1266 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1267 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1270 struct dsc$descriptor_s wilddsc
1271 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1272 struct dsc$descriptor_vs rsdsc
1273 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1274 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1276 /* We could find out if there's an explicit dev/dir or version
1277 by peeking into lib$find_file's internal context at
1278 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1279 but that's unsupported, so I don't want to do it now and
1280 have it bite someone in the future. */
1281 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1282 cp = SvPV(tmpglob,i);
1284 if (cp[i] == ';') hasver = 1;
1286 if (sts) hasver = 1;
1290 hasdir = isunix = 1;
1293 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1298 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1300 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1301 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1302 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1303 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1304 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1305 &dfltdsc,NULL,NULL,NULL))&1)) {
1306 end = rstr + (unsigned long int) *rslt;
1307 if (!hasver) while (*end != ';') end--;
1308 *(end++) = '\n'; *end = '\0';
1309 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1311 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1316 while (*(--begin) != ']' && *begin != '>') ;
1319 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1321 if (cxt) (void)lib$find_file_end(&cxt);
1322 if (ok && sts != RMS$_NMF &&
1323 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1326 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1328 PerlIO_close(tmpfp);
1332 PerlIO_rewind(tmpfp);
1334 IoIFP(io) = fp = tmpfp;
1335 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1340 #ifdef MACOS_TRADITIONAL
1341 sv_setpv(tmpcmd, "glob ");
1342 sv_catsv(tmpcmd, tmpglob);
1343 sv_catpv(tmpcmd, " |");
1347 sv_setpv(tmpcmd, "for a in ");
1348 sv_catsv(tmpcmd, tmpglob);
1349 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1352 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1353 sv_catsv(tmpcmd, tmpglob);
1355 sv_setpv(tmpcmd, "perlglob ");
1356 sv_catsv(tmpcmd, tmpglob);
1357 sv_catpv(tmpcmd, " |");
1362 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1363 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1364 sv_catsv(tmpcmd, tmpglob);
1365 sv_catpv(tmpcmd, "' 2>/dev/null |");
1367 sv_setpv(tmpcmd, "echo ");
1368 sv_catsv(tmpcmd, tmpglob);
1370 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1372 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1375 #endif /* !DOSISH */
1376 #endif /* MACOS_TRADITIONAL */
1377 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1378 FALSE, O_RDONLY, 0, Nullfp);
1384 else if (type == OP_GLOB)
1386 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1387 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1388 || fp == PerlIO_stderr()))
1390 /* integrate with report_evil_fh()? */
1392 if (isGV(PL_last_in_gv)) { /* can this ever fail? */
1393 SV* sv = sv_newmortal();
1394 gv_efullname4(sv, PL_last_in_gv, Nullch, FALSE);
1395 name = SvPV_nolen(sv);
1398 Perl_warner(aTHX_ WARN_IO,
1399 "Filehandle %s opened only for output", name);
1401 Perl_warner(aTHX_ WARN_IO,
1402 "Filehandle opened only for output");
1406 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1407 if (type == OP_GLOB)
1408 Perl_warner(aTHX_ WARN_GLOB,
1409 "glob failed (can't start child: %s)",
1412 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1414 if (gimme == G_SCALAR) {
1415 (void)SvOK_off(TARG);
1421 if (gimme == G_SCALAR) {
1425 (void)SvUPGRADE(sv, SVt_PV);
1426 tmplen = SvLEN(sv); /* remember if already alloced */
1428 Sv_Grow(sv, 80); /* try short-buffering it */
1429 if (type == OP_RCATLINE)
1435 sv = sv_2mortal(NEWSV(57, 80));
1439 /* delay EOF state for a snarfed empty file */
1440 #define SNARF_EOF(gimme,rs,io,sv) \
1441 (gimme != G_SCALAR || SvCUR(sv) \
1442 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1445 if (!sv_gets(sv, fp, offset)
1446 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1448 PerlIO_clearerr(fp);
1449 if (IoFLAGS(io) & IOf_ARGV) {
1450 fp = nextargv(PL_last_in_gv);
1453 (void)do_close(PL_last_in_gv, FALSE);
1455 else if (type == OP_GLOB) {
1456 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1457 Perl_warner(aTHX_ WARN_GLOB,
1458 "glob failed (child exited with status %d%s)",
1459 (int)(STATUS_CURRENT >> 8),
1460 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1463 if (gimme == G_SCALAR) {
1464 (void)SvOK_off(TARG);
1469 /* This should not be marked tainted if the fp is marked clean */
1470 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1475 IoFLAGS(io) |= IOf_NOLINE;
1478 if (type == OP_GLOB) {
1481 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1482 tmps = SvEND(sv) - 1;
1483 if (*tmps == *SvPVX(PL_rs)) {
1488 for (tmps = SvPVX(sv); *tmps; tmps++)
1489 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1490 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1492 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1493 (void)POPs; /* Unmatched wildcard? Chuck it... */
1497 if (gimme == G_ARRAY) {
1498 if (SvLEN(sv) - SvCUR(sv) > 20) {
1499 SvLEN_set(sv, SvCUR(sv)+1);
1500 Renew(SvPVX(sv), SvLEN(sv), char);
1502 sv = sv_2mortal(NEWSV(58, 80));
1505 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1506 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1510 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1511 Renew(SvPVX(sv), SvLEN(sv), char);
1520 register PERL_CONTEXT *cx;
1521 I32 gimme = OP_GIMME(PL_op, -1);
1524 if (cxstack_ix >= 0)
1525 gimme = cxstack[cxstack_ix].blk_gimme;
1533 PUSHBLOCK(cx, CXt_BLOCK, SP);
1545 U32 lval = PL_op->op_flags & OPf_MOD;
1546 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1548 U32 hash = (SvFAKE(keysv) && SvREADONLY(keysv)) ? SvUVX(keysv) : 0;
1550 if (SvTYPE(hv) == SVt_PVHV) {
1551 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1552 svp = he ? &HeVAL(he) : 0;
1554 else if (SvTYPE(hv) == SVt_PVAV) {
1555 if (PL_op->op_private & OPpLVAL_INTRO)
1556 DIE(aTHX_ "Can't localize pseudo-hash element");
1557 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, hash);
1563 if (!svp || *svp == &PL_sv_undef) {
1568 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1570 lv = sv_newmortal();
1571 sv_upgrade(lv, SVt_PVLV);
1573 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1574 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1575 LvTARG(lv) = SvREFCNT_inc(hv);
1580 if (PL_op->op_private & OPpLVAL_INTRO) {
1581 if (HvNAME(hv) && isGV(*svp))
1582 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1584 save_helem(hv, keysv, svp);
1586 else if (PL_op->op_private & OPpDEREF)
1587 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1589 sv = (svp ? *svp : &PL_sv_undef);
1590 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1591 * Pushing the magical RHS on to the stack is useless, since
1592 * that magic is soon destined to be misled by the local(),
1593 * and thus the later pp_sassign() will fail to mg_get() the
1594 * old value. This should also cure problems with delayed
1595 * mg_get()s. GSAR 98-07-03 */
1596 if (!lval && SvGMAGICAL(sv))
1597 sv = sv_mortalcopy(sv);
1605 register PERL_CONTEXT *cx;
1611 if (PL_op->op_flags & OPf_SPECIAL) {
1612 cx = &cxstack[cxstack_ix];
1613 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1618 gimme = OP_GIMME(PL_op, -1);
1620 if (cxstack_ix >= 0)
1621 gimme = cxstack[cxstack_ix].blk_gimme;
1627 if (gimme == G_VOID)
1629 else if (gimme == G_SCALAR) {
1632 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1635 *MARK = sv_mortalcopy(TOPs);
1638 *MARK = &PL_sv_undef;
1642 else if (gimme == G_ARRAY) {
1643 /* in case LEAVE wipes old return values */
1644 for (mark = newsp + 1; mark <= SP; mark++) {
1645 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1646 *mark = sv_mortalcopy(*mark);
1647 TAINT_NOT; /* Each item is independent */
1651 PL_curpm = newpm; /* Don't pop $1 et al till now */
1661 register PERL_CONTEXT *cx;
1667 cx = &cxstack[cxstack_ix];
1668 if (CxTYPE(cx) != CXt_LOOP)
1669 DIE(aTHX_ "panic: pp_iter");
1671 itersvp = CxITERVAR(cx);
1672 av = cx->blk_loop.iterary;
1673 if (SvTYPE(av) != SVt_PVAV) {
1674 /* iterate ($min .. $max) */
1675 if (cx->blk_loop.iterlval) {
1676 /* string increment */
1677 register SV* cur = cx->blk_loop.iterlval;
1679 char *max = SvPV((SV*)av, maxlen);
1680 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1681 #ifndef USE_THREADS /* don't risk potential race */
1682 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1683 /* safe to reuse old SV */
1684 sv_setsv(*itersvp, cur);
1689 /* we need a fresh SV every time so that loop body sees a
1690 * completely new SV for closures/references to work as
1692 SvREFCNT_dec(*itersvp);
1693 *itersvp = newSVsv(cur);
1695 if (strEQ(SvPVX(cur), max))
1696 sv_setiv(cur, 0); /* terminate next time */
1703 /* integer increment */
1704 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1707 #ifndef USE_THREADS /* don't risk potential race */
1708 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1709 /* safe to reuse old SV */
1710 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1715 /* we need a fresh SV every time so that loop body sees a
1716 * completely new SV for closures/references to work as they
1718 SvREFCNT_dec(*itersvp);
1719 *itersvp = newSViv(cx->blk_loop.iterix++);
1725 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1728 SvREFCNT_dec(*itersvp);
1730 if ((sv = SvMAGICAL(av)
1731 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1732 : AvARRAY(av)[++cx->blk_loop.iterix]))
1736 if (av != PL_curstack && SvIMMORTAL(sv)) {
1737 SV *lv = cx->blk_loop.iterlval;
1738 if (lv && SvREFCNT(lv) > 1) {
1743 SvREFCNT_dec(LvTARG(lv));
1745 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1746 sv_upgrade(lv, SVt_PVLV);
1748 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1750 LvTARG(lv) = SvREFCNT_inc(av);
1751 LvTARGOFF(lv) = cx->blk_loop.iterix;
1752 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1756 *itersvp = SvREFCNT_inc(sv);
1763 register PMOP *pm = cPMOP;
1779 register REGEXP *rx = pm->op_pmregexp;
1781 int force_on_match = 0;
1782 I32 oldsave = PL_savestack_ix;
1784 /* known replacement string? */
1785 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1786 if (PL_op->op_flags & OPf_STACKED)
1792 if (SvFAKE(TARG) && SvREADONLY(TARG))
1793 sv_force_normal(TARG);
1794 if (SvREADONLY(TARG)
1795 || (SvTYPE(TARG) > SVt_PVLV
1796 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1797 DIE(aTHX_ PL_no_modify);
1800 s = SvPV(TARG, len);
1801 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1803 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1804 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1811 DIE(aTHX_ "panic: do_subst");
1814 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1815 position, once with zero-length,
1816 second time with non-zero. */
1818 if (!rx->prelen && PL_curpm) {
1820 rx = pm->op_pmregexp;
1822 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1823 ? REXEC_COPY_STR : 0;
1825 r_flags |= REXEC_SCREAM;
1826 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1827 SAVEINT(PL_multiline);
1828 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1831 if (rx->reganch & RE_USE_INTUIT) {
1832 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1836 /* How to do it in subst? */
1837 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1839 && ((rx->reganch & ROPT_NOSCAN)
1840 || !((rx->reganch & RE_INTUIT_TAIL)
1841 && (r_flags & REXEC_SCREAM))))
1846 /* only replace once? */
1847 once = !(rpm->op_pmflags & PMf_GLOBAL);
1849 /* known replacement string? */
1850 c = dstr ? SvPV(dstr, clen) : Nullch;
1852 /* can do inplace substitution? */
1853 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1854 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1855 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1856 r_flags | REXEC_CHECKED))
1860 LEAVE_SCOPE(oldsave);
1863 if (force_on_match) {
1865 s = SvPV_force(TARG, len);
1870 SvSCREAM_off(TARG); /* disable possible screamer */
1872 rxtainted |= RX_MATCH_TAINTED(rx);
1873 m = orig + rx->startp[0];
1874 d = orig + rx->endp[0];
1876 if (m - s > strend - d) { /* faster to shorten from end */
1878 Copy(c, m, clen, char);
1883 Move(d, m, i, char);
1887 SvCUR_set(TARG, m - s);
1890 else if ((i = m - s)) { /* faster from front */
1898 Copy(c, m, clen, char);
1903 Copy(c, d, clen, char);
1908 TAINT_IF(rxtainted & 1);
1914 if (iters++ > maxiters)
1915 DIE(aTHX_ "Substitution loop");
1916 rxtainted |= RX_MATCH_TAINTED(rx);
1917 m = rx->startp[0] + orig;
1921 Move(s, d, i, char);
1925 Copy(c, d, clen, char);
1928 s = rx->endp[0] + orig;
1929 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1931 /* don't match same null twice */
1932 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1935 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1936 Move(s, d, i+1, char); /* include the NUL */
1938 TAINT_IF(rxtainted & 1);
1940 PUSHs(sv_2mortal(newSViv((I32)iters)));
1942 (void)SvPOK_only_UTF8(TARG);
1943 TAINT_IF(rxtainted);
1944 if (SvSMAGICAL(TARG)) {
1950 LEAVE_SCOPE(oldsave);
1954 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1955 r_flags | REXEC_CHECKED))
1957 if (force_on_match) {
1959 s = SvPV_force(TARG, len);
1962 rxtainted |= RX_MATCH_TAINTED(rx);
1963 dstr = NEWSV(25, len);
1964 sv_setpvn(dstr, m, s-m);
1967 register PERL_CONTEXT *cx;
1970 RETURNOP(cPMOP->op_pmreplroot);
1972 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1974 if (iters++ > maxiters)
1975 DIE(aTHX_ "Substitution loop");
1976 rxtainted |= RX_MATCH_TAINTED(rx);
1977 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1982 strend = s + (strend - m);
1984 m = rx->startp[0] + orig;
1985 sv_catpvn(dstr, s, m-s);
1986 s = rx->endp[0] + orig;
1988 sv_catpvn(dstr, c, clen);
1991 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1992 sv_catpvn(dstr, s, strend - s);
1994 (void)SvOOK_off(TARG);
1995 Safefree(SvPVX(TARG));
1996 SvPVX(TARG) = SvPVX(dstr);
1997 SvCUR_set(TARG, SvCUR(dstr));
1998 SvLEN_set(TARG, SvLEN(dstr));
2002 TAINT_IF(rxtainted & 1);
2004 PUSHs(sv_2mortal(newSViv((I32)iters)));
2006 (void)SvPOK_only(TARG);
2007 TAINT_IF(rxtainted);
2010 LEAVE_SCOPE(oldsave);
2019 LEAVE_SCOPE(oldsave);
2028 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2029 ++*PL_markstack_ptr;
2030 LEAVE; /* exit inner scope */
2033 if (PL_stack_base + *PL_markstack_ptr > SP) {
2035 I32 gimme = GIMME_V;
2037 LEAVE; /* exit outer scope */
2038 (void)POPMARK; /* pop src */
2039 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2040 (void)POPMARK; /* pop dst */
2041 SP = PL_stack_base + POPMARK; /* pop original mark */
2042 if (gimme == G_SCALAR) {
2046 else if (gimme == G_ARRAY)
2053 ENTER; /* enter inner scope */
2056 src = PL_stack_base[*PL_markstack_ptr];
2060 RETURNOP(cLOGOP->op_other);
2071 register PERL_CONTEXT *cx;
2077 if (gimme == G_SCALAR) {
2080 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2082 *MARK = SvREFCNT_inc(TOPs);
2087 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2089 *MARK = sv_mortalcopy(sv);
2094 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2098 *MARK = &PL_sv_undef;
2102 else if (gimme == G_ARRAY) {
2103 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2104 if (!SvTEMP(*MARK)) {
2105 *MARK = sv_mortalcopy(*MARK);
2106 TAINT_NOT; /* Each item is independent */
2112 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2113 PL_curpm = newpm; /* ... and pop $1 et al */
2117 return pop_return();
2120 /* This duplicates the above code because the above code must not
2121 * get any slower by more conditions */
2129 register PERL_CONTEXT *cx;
2136 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2137 /* We are an argument to a function or grep().
2138 * This kind of lvalueness was legal before lvalue
2139 * subroutines too, so be backward compatible:
2140 * cannot report errors. */
2142 /* Scalar context *is* possible, on the LHS of -> only,
2143 * as in f()->meth(). But this is not an lvalue. */
2144 if (gimme == G_SCALAR)
2146 if (gimme == G_ARRAY) {
2147 if (!CvLVALUE(cx->blk_sub.cv))
2148 goto temporise_array;
2149 EXTEND_MORTAL(SP - newsp);
2150 for (mark = newsp + 1; mark <= SP; mark++) {
2153 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2154 *mark = sv_mortalcopy(*mark);
2156 /* Can be a localized value subject to deletion. */
2157 PL_tmps_stack[++PL_tmps_ix] = *mark;
2158 (void)SvREFCNT_inc(*mark);
2163 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2164 /* Here we go for robustness, not for speed, so we change all
2165 * the refcounts so the caller gets a live guy. Cannot set
2166 * TEMP, so sv_2mortal is out of question. */
2167 if (!CvLVALUE(cx->blk_sub.cv)) {
2172 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2174 if (gimme == G_SCALAR) {
2178 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2183 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2184 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2186 else { /* Can be a localized value
2187 * subject to deletion. */
2188 PL_tmps_stack[++PL_tmps_ix] = *mark;
2189 (void)SvREFCNT_inc(*mark);
2192 else { /* Should not happen? */
2197 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2198 (MARK > SP ? "Empty array" : "Array"));
2202 else if (gimme == G_ARRAY) {
2203 EXTEND_MORTAL(SP - newsp);
2204 for (mark = newsp + 1; mark <= SP; mark++) {
2205 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2206 /* Might be flattened array after $#array = */
2212 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2213 (*mark != &PL_sv_undef)
2215 ? "a readonly value" : "a temporary")
2216 : "an uninitialized value");
2219 /* Can be a localized value subject to deletion. */
2220 PL_tmps_stack[++PL_tmps_ix] = *mark;
2221 (void)SvREFCNT_inc(*mark);
2227 if (gimme == G_SCALAR) {
2231 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2233 *MARK = SvREFCNT_inc(TOPs);
2238 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2240 *MARK = sv_mortalcopy(sv);
2245 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2249 *MARK = &PL_sv_undef;
2253 else if (gimme == G_ARRAY) {
2255 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2256 if (!SvTEMP(*MARK)) {
2257 *MARK = sv_mortalcopy(*MARK);
2258 TAINT_NOT; /* Each item is independent */
2265 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2266 PL_curpm = newpm; /* ... and pop $1 et al */
2270 return pop_return();
2275 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2278 SV *dbsv = GvSV(PL_DBsub);
2280 if (!PERLDB_SUB_NN) {
2284 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2285 || strEQ(GvNAME(gv), "END")
2286 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2287 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2288 && (gv = (GV*)*svp) ))) {
2289 /* Use GV from the stack as a fallback. */
2290 /* GV is potentially non-unique, or contain different CV. */
2291 SV *tmp = newRV((SV*)cv);
2292 sv_setsv(dbsv, tmp);
2296 gv_efullname3(dbsv, gv, Nullch);
2300 (void)SvUPGRADE(dbsv, SVt_PVIV);
2301 (void)SvIOK_on(dbsv);
2302 SAVEIV(SvIVX(dbsv));
2303 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2307 PL_curcopdb = PL_curcop;
2308 cv = GvCV(PL_DBsub);
2318 register PERL_CONTEXT *cx;
2320 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2323 DIE(aTHX_ "Not a CODE reference");
2324 switch (SvTYPE(sv)) {
2330 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2332 SP = PL_stack_base + POPMARK;
2335 if (SvGMAGICAL(sv)) {
2337 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2340 sym = SvPV(sv, n_a);
2342 DIE(aTHX_ PL_no_usym, "a subroutine");
2343 if (PL_op->op_private & HINT_STRICT_REFS)
2344 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2345 cv = get_cv(sym, TRUE);
2349 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2350 tryAMAGICunDEREF(to_cv);
2353 if (SvTYPE(cv) == SVt_PVCV)
2358 DIE(aTHX_ "Not a CODE reference");
2363 if (!(cv = GvCVu((GV*)sv)))
2364 cv = sv_2cv(sv, &stash, &gv, FALSE);
2377 if (!CvROOT(cv) && !CvXSUB(cv)) {
2381 /* anonymous or undef'd function leaves us no recourse */
2382 if (CvANON(cv) || !(gv = CvGV(cv)))
2383 DIE(aTHX_ "Undefined subroutine called");
2385 /* autoloaded stub? */
2386 if (cv != GvCV(gv)) {
2389 /* should call AUTOLOAD now? */
2392 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2399 sub_name = sv_newmortal();
2400 gv_efullname3(sub_name, gv, Nullch);
2401 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2405 DIE(aTHX_ "Not a CODE reference");
2410 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2411 cv = get_db_sub(&sv, cv);
2413 DIE(aTHX_ "No DBsub routine");
2418 * First we need to check if the sub or method requires locking.
2419 * If so, we gain a lock on the CV, the first argument or the
2420 * stash (for static methods), as appropriate. This has to be
2421 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2422 * reschedule by returning a new op.
2424 MUTEX_LOCK(CvMUTEXP(cv));
2425 if (CvFLAGS(cv) & CVf_LOCKED) {
2427 if (CvFLAGS(cv) & CVf_METHOD) {
2428 if (SP > PL_stack_base + TOPMARK)
2429 sv = *(PL_stack_base + TOPMARK + 1);
2431 AV *av = (AV*)PL_curpad[0];
2432 if (hasargs || !av || AvFILLp(av) < 0
2433 || !(sv = AvARRAY(av)[0]))
2435 MUTEX_UNLOCK(CvMUTEXP(cv));
2436 DIE(aTHX_ "no argument for locked method call");
2443 char *stashname = SvPV(sv, len);
2444 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2450 MUTEX_UNLOCK(CvMUTEXP(cv));
2451 mg = condpair_magic(sv);
2452 MUTEX_LOCK(MgMUTEXP(mg));
2453 if (MgOWNER(mg) == thr)
2454 MUTEX_UNLOCK(MgMUTEXP(mg));
2457 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2459 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2461 MUTEX_UNLOCK(MgMUTEXP(mg));
2462 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2464 MUTEX_LOCK(CvMUTEXP(cv));
2467 * Now we have permission to enter the sub, we must distinguish
2468 * four cases. (0) It's an XSUB (in which case we don't care
2469 * about ownership); (1) it's ours already (and we're recursing);
2470 * (2) it's free (but we may already be using a cached clone);
2471 * (3) another thread owns it. Case (1) is easy: we just use it.
2472 * Case (2) means we look for a clone--if we have one, use it
2473 * otherwise grab ownership of cv. Case (3) means we look for a
2474 * clone (for non-XSUBs) and have to create one if we don't
2476 * Why look for a clone in case (2) when we could just grab
2477 * ownership of cv straight away? Well, we could be recursing,
2478 * i.e. we originally tried to enter cv while another thread
2479 * owned it (hence we used a clone) but it has been freed up
2480 * and we're now recursing into it. It may or may not be "better"
2481 * to use the clone but at least CvDEPTH can be trusted.
2483 if (CvOWNER(cv) == thr || CvXSUB(cv))
2484 MUTEX_UNLOCK(CvMUTEXP(cv));
2486 /* Case (2) or (3) */
2490 * XXX Might it be better to release CvMUTEXP(cv) while we
2491 * do the hv_fetch? We might find someone has pinched it
2492 * when we look again, in which case we would be in case
2493 * (3) instead of (2) so we'd have to clone. Would the fact
2494 * that we released the mutex more quickly make up for this?
2496 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2498 /* We already have a clone to use */
2499 MUTEX_UNLOCK(CvMUTEXP(cv));
2501 DEBUG_S(PerlIO_printf(Perl_debug_log,
2502 "entersub: %p already has clone %p:%s\n",
2503 thr, cv, SvPEEK((SV*)cv)));
2506 if (CvDEPTH(cv) == 0)
2507 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2510 /* (2) => grab ownership of cv. (3) => make clone */
2514 MUTEX_UNLOCK(CvMUTEXP(cv));
2515 DEBUG_S(PerlIO_printf(Perl_debug_log,
2516 "entersub: %p grabbing %p:%s in stash %s\n",
2517 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2518 HvNAME(CvSTASH(cv)) : "(none)"));
2521 /* Make a new clone. */
2523 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2524 MUTEX_UNLOCK(CvMUTEXP(cv));
2525 DEBUG_S((PerlIO_printf(Perl_debug_log,
2526 "entersub: %p cloning %p:%s\n",
2527 thr, cv, SvPEEK((SV*)cv))));
2529 * We're creating a new clone so there's no race
2530 * between the original MUTEX_UNLOCK and the
2531 * SvREFCNT_inc since no one will be trying to undef
2532 * it out from underneath us. At least, I don't think
2535 clonecv = cv_clone(cv);
2536 SvREFCNT_dec(cv); /* finished with this */
2537 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2538 CvOWNER(clonecv) = thr;
2542 DEBUG_S(if (CvDEPTH(cv) != 0)
2543 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2545 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2548 #endif /* USE_THREADS */
2551 #ifdef PERL_XSUB_OLDSTYLE
2552 if (CvOLDSTYLE(cv)) {
2553 I32 (*fp3)(int,int,int);
2555 register I32 items = SP - MARK;
2556 /* We dont worry to copy from @_. */
2561 PL_stack_sp = mark + 1;
2562 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2563 items = (*fp3)(CvXSUBANY(cv).any_i32,
2564 MARK - PL_stack_base + 1,
2566 PL_stack_sp = PL_stack_base + items;
2569 #endif /* PERL_XSUB_OLDSTYLE */
2571 I32 markix = TOPMARK;
2576 /* Need to copy @_ to stack. Alternative may be to
2577 * switch stack to @_, and copy return values
2578 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2582 av = (AV*)PL_curpad[0];
2584 av = GvAV(PL_defgv);
2585 #endif /* USE_THREADS */
2586 items = AvFILLp(av) + 1; /* @_ is not tieable */
2589 /* Mark is at the end of the stack. */
2591 Copy(AvARRAY(av), SP + 1, items, SV*);
2596 /* We assume first XSUB in &DB::sub is the called one. */
2598 SAVEVPTR(PL_curcop);
2599 PL_curcop = PL_curcopdb;
2602 /* Do we need to open block here? XXXX */
2603 (void)(*CvXSUB(cv))(aTHXo_ cv);
2605 /* Enforce some sanity in scalar context. */
2606 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2607 if (markix > PL_stack_sp - PL_stack_base)
2608 *(PL_stack_base + markix) = &PL_sv_undef;
2610 *(PL_stack_base + markix) = *PL_stack_sp;
2611 PL_stack_sp = PL_stack_base + markix;
2619 register I32 items = SP - MARK;
2620 AV* padlist = CvPADLIST(cv);
2621 SV** svp = AvARRAY(padlist);
2622 push_return(PL_op->op_next);
2623 PUSHBLOCK(cx, CXt_SUB, MARK);
2626 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2627 * that eval'' ops within this sub know the correct lexical space.
2628 * Owing the speed considerations, we choose to search for the cv
2629 * in doeval() instead.
2631 if (CvDEPTH(cv) < 2)
2632 (void)SvREFCNT_inc(cv);
2633 else { /* save temporaries on recursion? */
2634 PERL_STACK_OVERFLOW_CHECK();
2635 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2637 AV *newpad = newAV();
2638 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2639 I32 ix = AvFILLp((AV*)svp[1]);
2640 I32 names_fill = AvFILLp((AV*)svp[0]);
2641 svp = AvARRAY(svp[0]);
2642 for ( ;ix > 0; ix--) {
2643 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2644 char *name = SvPVX(svp[ix]);
2645 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2646 || *name == '&') /* anonymous code? */
2648 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2650 else { /* our own lexical */
2652 av_store(newpad, ix, sv = (SV*)newAV());
2653 else if (*name == '%')
2654 av_store(newpad, ix, sv = (SV*)newHV());
2656 av_store(newpad, ix, sv = NEWSV(0,0));
2660 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2661 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2664 av_store(newpad, ix, sv = NEWSV(0,0));
2668 av = newAV(); /* will be @_ */
2670 av_store(newpad, 0, (SV*)av);
2671 AvFLAGS(av) = AVf_REIFY;
2672 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2673 AvFILLp(padlist) = CvDEPTH(cv);
2674 svp = AvARRAY(padlist);
2679 AV* av = (AV*)PL_curpad[0];
2681 items = AvFILLp(av) + 1;
2683 /* Mark is at the end of the stack. */
2685 Copy(AvARRAY(av), SP + 1, items, SV*);
2690 #endif /* USE_THREADS */
2691 SAVEVPTR(PL_curpad);
2692 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2695 #endif /* USE_THREADS */
2701 DEBUG_S(PerlIO_printf(Perl_debug_log,
2702 "%p entersub preparing @_\n", thr));
2704 av = (AV*)PL_curpad[0];
2706 /* @_ is normally not REAL--this should only ever
2707 * happen when DB::sub() calls things that modify @_ */
2713 cx->blk_sub.savearray = GvAV(PL_defgv);
2714 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2715 #endif /* USE_THREADS */
2716 cx->blk_sub.oldcurpad = PL_curpad;
2717 cx->blk_sub.argarray = av;
2720 if (items > AvMAX(av) + 1) {
2722 if (AvARRAY(av) != ary) {
2723 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2724 SvPVX(av) = (char*)ary;
2726 if (items > AvMAX(av) + 1) {
2727 AvMAX(av) = items - 1;
2728 Renew(ary,items,SV*);
2730 SvPVX(av) = (char*)ary;
2733 Copy(MARK,AvARRAY(av),items,SV*);
2734 AvFILLp(av) = items - 1;
2742 /* warning must come *after* we fully set up the context
2743 * stuff so that __WARN__ handlers can safely dounwind()
2746 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2747 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2748 sub_crush_depth(cv);
2750 DEBUG_S(PerlIO_printf(Perl_debug_log,
2751 "%p entersub returning %p\n", thr, CvSTART(cv)));
2753 RETURNOP(CvSTART(cv));
2758 Perl_sub_crush_depth(pTHX_ CV *cv)
2761 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2763 SV* tmpstr = sv_newmortal();
2764 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2765 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2776 U32 lval = PL_op->op_flags & OPf_MOD;
2777 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2781 elem -= PL_curcop->cop_arybase;
2782 if (SvTYPE(av) != SVt_PVAV)
2784 svp = av_fetch(av, elem, lval && !defer);
2786 if (!svp || *svp == &PL_sv_undef) {
2789 DIE(aTHX_ PL_no_aelem, elem);
2790 lv = sv_newmortal();
2791 sv_upgrade(lv, SVt_PVLV);
2793 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2794 LvTARG(lv) = SvREFCNT_inc(av);
2795 LvTARGOFF(lv) = elem;
2800 if (PL_op->op_private & OPpLVAL_INTRO)
2801 save_aelem(av, elem, svp);
2802 else if (PL_op->op_private & OPpDEREF)
2803 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2805 sv = (svp ? *svp : &PL_sv_undef);
2806 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2807 sv = sv_mortalcopy(sv);
2813 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2819 Perl_croak(aTHX_ PL_no_modify);
2820 if (SvTYPE(sv) < SVt_RV)
2821 sv_upgrade(sv, SVt_RV);
2822 else if (SvTYPE(sv) >= SVt_PV) {
2823 (void)SvOOK_off(sv);
2824 Safefree(SvPVX(sv));
2825 SvLEN(sv) = SvCUR(sv) = 0;
2829 SvRV(sv) = NEWSV(355,0);
2832 SvRV(sv) = (SV*)newAV();
2835 SvRV(sv) = (SV*)newHV();
2850 if (SvTYPE(rsv) == SVt_PVCV) {
2856 SETs(method_common(sv, Null(U32*)));
2863 SV* sv = cSVOP->op_sv;
2864 U32 hash = SvUVX(sv);
2866 XPUSHs(method_common(sv, &hash));
2871 S_method_common(pTHX_ SV* meth, U32* hashp)
2882 name = SvPV(meth, namelen);
2883 sv = *(PL_stack_base + TOPMARK + 1);
2886 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2897 !(packname = SvPV(sv, packlen)) ||
2898 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2899 !(ob=(SV*)GvIO(iogv)))
2902 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2903 ? !isIDFIRST_utf8((U8*)packname)
2904 : !isIDFIRST(*packname)
2907 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2908 SvOK(sv) ? "without a package or object reference"
2909 : "on an undefined value");
2911 stash = gv_stashpvn(packname, packlen, TRUE);
2914 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2917 if (!ob || !(SvOBJECT(ob)
2918 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2921 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2925 stash = SvSTASH(ob);
2928 /* shortcut for simple names */
2930 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2932 gv = (GV*)HeVAL(he);
2933 if (isGV(gv) && GvCV(gv) &&
2934 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2935 return (SV*)GvCV(gv);
2939 gv = gv_fetchmethod(stash, name);
2946 for (p = name; *p; p++) {
2948 sep = p, leaf = p + 1;
2949 else if (*p == ':' && *(p + 1) == ':')
2950 sep = p, leaf = p + 2;
2952 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2953 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2954 packlen = strlen(packname);
2958 packlen = sep - name;
2960 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2961 if (gv && isGV(gv)) {
2963 "Can't locate object method \"%s\" via package \"%s\"",
2968 "Can't locate object method \"%s\" via package \"%s\""
2969 " (perhaps you forgot to load \"%s\"?)",
2970 leaf, packname, packname);
2973 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2978 unset_cvowner(pTHXo_ void *cvarg)
2980 register CV* cv = (CV *) cvarg;
2983 #endif /* DEBUGGING */
2985 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2986 thr, cv, SvPEEK((SV*)cv))));
2987 MUTEX_LOCK(CvMUTEXP(cv));
2988 DEBUG_S(if (CvDEPTH(cv) != 0)
2989 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2991 assert(thr == CvOWNER(cv));
2993 MUTEX_UNLOCK(CvMUTEXP(cv));
2996 #endif /* USE_THREADS */