3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
25 static void unset_cvowner(pTHXo_ void *cvarg);
26 #endif /* USE_THREADS */
37 PL_curcop = (COP*)PL_op;
38 TAINT_NOT; /* Each statement is presumed innocent */
39 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
48 if (PL_op->op_private & OPpLVAL_INTRO)
49 PUSHs(save_scalar(cGVOP_gv));
51 PUSHs(GvSV(cGVOP_gv));
62 PL_curcop = (COP*)PL_op;
68 PUSHMARK(PL_stack_sp);
78 sv_setpvn(TARG,s,len);
79 if (SvUTF8(TOPs) && !IN_BYTE)
88 XPUSHs((SV*)cGVOP_gv);
99 RETURNOP(cLOGOP->op_other);
107 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
109 temp = left; left = right; right = temp;
111 if (PL_tainting && PL_tainted && !SvTAINTED(left))
113 SvSetMagicSV(right, left);
122 RETURNOP(cLOGOP->op_other);
124 RETURNOP(cLOGOP->op_next);
130 TAINT_NOT; /* Each statement is presumed innocent */
131 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
133 oldsave = PL_scopestack[PL_scopestack_ix - 1];
134 LEAVE_SCOPE(oldsave);
140 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
148 if (TARG == right && SvGMAGICAL(right))
150 if (SvGMAGICAL(left))
153 left_utf = DO_UTF8(left);
154 right_utf = DO_UTF8(right);
156 if (left_utf != right_utf) {
157 if (TARG == right && !right_utf) {
158 sv_utf8_upgrade(TARG); /* Now straight binary copy */
162 /* Set TARG to PV(left), then add right */
163 U8 *l, *c, *olds = NULL;
165 s = (U8*)SvPV(right,len);
166 right_utf |= DO_UTF8(right);
168 /* Take a copy since we're about to overwrite TARG */
169 olds = s = (U8*)savepvn((char*)s, len);
171 if (!SvOK(left) && SvTYPE(left) <= SVt_PVMG) {
172 if (SvREADONLY(left))
173 left = sv_2mortal(newSVsv(left));
175 sv_setpv(left, ""); /* Suppress warning. */
177 l = (U8*)SvPV(left, targlen);
178 left_utf |= DO_UTF8(left);
180 sv_setpvn(TARG, (char*)l, targlen);
182 sv_utf8_upgrade(TARG);
183 /* Extend TARG to length of right (s) */
184 targlen = SvCUR(TARG) + len;
186 /* plus one for each hi-byte char if we have to upgrade */
187 for (c = s; c < s + len; c++) {
192 SvGROW(TARG, targlen+1);
193 /* And now copy, maybe upgrading right to UTF8 on the fly */
194 for (c = (U8*)SvEND(TARG); len--; s++) {
195 if (*s & 0x80 && !right_utf)
196 c = uv_to_utf8(c, *s);
200 SvCUR_set(TARG, targlen);
210 s = (U8*)SvPV(left,len);
212 sv_insert(TARG, 0, 0, (char*)s, len);
216 sv_setpvn(TARG, (char *)s, len);
218 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG)
219 sv_setpv(TARG, ""); /* Suppress warning. */
220 s = (U8*)SvPV(right,len);
222 #if defined(PERL_Y2KWARN)
223 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
225 char *s = SvPV(TARG,n);
226 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
227 && (n == 2 || !isDIGIT(s[n-3])))
229 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
230 "about to append an integer to '19'");
234 sv_catpvn(TARG, (char *)s, len);
237 sv_setpvn(TARG, (char *)s, len); /* suppress warning */
249 if (PL_op->op_flags & OPf_MOD) {
250 if (PL_op->op_private & OPpLVAL_INTRO)
251 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
252 else if (PL_op->op_private & OPpDEREF) {
254 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
263 tryAMAGICunTARGET(iter, 0);
264 PL_last_in_gv = (GV*)(*PL_stack_sp--);
265 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
266 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
267 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
270 XPUSHs((SV*)PL_last_in_gv);
273 PL_last_in_gv = (GV*)(*PL_stack_sp--);
276 return do_readline();
281 djSP; tryAMAGICbinSET(eq,0);
284 SETs(boolSV(TOPn == value));
292 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
293 DIE(aTHX_ PL_no_modify);
294 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
295 SvIVX(TOPs) != IV_MAX)
298 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
313 RETURNOP(cLOGOP->op_other);
319 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
322 SETn( left + right );
330 AV *av = GvAV(cGVOP_gv);
331 U32 lval = PL_op->op_flags & OPf_MOD;
332 SV** svp = av_fetch(av, PL_op->op_private, lval);
333 SV *sv = (svp ? *svp : &PL_sv_undef);
335 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
336 sv = sv_mortalcopy(sv);
343 djSP; dMARK; dTARGET;
345 do_join(TARG, *MARK, MARK, SP);
356 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
357 * will be enough to hold an OP*.
359 SV* sv = sv_newmortal();
360 sv_upgrade(sv, SVt_PVLV);
362 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
370 /* Oversized hot code. */
374 djSP; dMARK; dORIGMARK;
381 if (PL_op->op_flags & OPf_STACKED)
385 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
387 if (MARK == ORIGMARK) {
388 /* If using default handle then we need to make space to
389 * pass object as 1st arg, so move other args up ...
393 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
397 *MARK = SvTIED_obj((SV*)gv, mg);
400 call_method("PRINT", G_SCALAR);
408 if (!(io = GvIO(gv))) {
410 if ((GvEGV(gv)) && (mg = SvTIED_mg((SV*)GvEGV(gv),'q')))
412 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
413 report_evil_fh(gv, io, PL_op->op_type);
414 SETERRNO(EBADF,RMS$_IFI);
417 else if (!(fp = IoOFP(io))) {
418 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
420 /* integrate with report_evil_fh()? */
423 SV* sv = sv_newmortal();
424 gv_efullname4(sv, gv, Nullch, FALSE);
425 name = SvPV_nolen(sv);
428 Perl_warner(aTHX_ WARN_IO,
429 "Filehandle %s opened only for input", name);
431 Perl_warner(aTHX_ WARN_IO,
432 "Filehandle opened only for input");
434 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
435 report_evil_fh(gv, io, PL_op->op_type);
437 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
444 if (!do_print(*MARK, fp))
448 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
457 if (!do_print(*MARK, fp))
466 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
469 if (IoFLAGS(io) & IOf_FLUSH)
470 if (PerlIO_flush(fp) == EOF)
491 tryAMAGICunDEREF(to_av);
494 if (SvTYPE(av) != SVt_PVAV)
495 DIE(aTHX_ "Not an ARRAY reference");
496 if (PL_op->op_flags & OPf_REF) {
502 if (SvTYPE(sv) == SVt_PVAV) {
504 if (PL_op->op_flags & OPf_REF) {
512 if (SvTYPE(sv) != SVt_PVGV) {
516 if (SvGMAGICAL(sv)) {
522 if (PL_op->op_flags & OPf_REF ||
523 PL_op->op_private & HINT_STRICT_REFS)
524 DIE(aTHX_ PL_no_usym, "an ARRAY");
525 if (ckWARN(WARN_UNINITIALIZED))
527 if (GIMME == G_ARRAY) {
534 if ((PL_op->op_flags & OPf_SPECIAL) &&
535 !(PL_op->op_flags & OPf_MOD))
537 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
539 && (!is_gv_magical(sym,len,0)
540 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
546 if (PL_op->op_private & HINT_STRICT_REFS)
547 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
548 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
555 if (PL_op->op_private & OPpLVAL_INTRO)
557 if (PL_op->op_flags & OPf_REF) {
564 if (GIMME == G_ARRAY) {
565 I32 maxarg = AvFILL(av) + 1;
566 (void)POPs; /* XXXX May be optimized away? */
568 if (SvRMAGICAL(av)) {
570 for (i=0; i < maxarg; i++) {
571 SV **svp = av_fetch(av, i, FALSE);
572 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
576 Copy(AvARRAY(av), SP+1, maxarg, SV*);
582 I32 maxarg = AvFILL(av) + 1;
595 tryAMAGICunDEREF(to_hv);
598 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
599 DIE(aTHX_ "Not a HASH reference");
600 if (PL_op->op_flags & OPf_REF) {
606 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
608 if (PL_op->op_flags & OPf_REF) {
616 if (SvTYPE(sv) != SVt_PVGV) {
620 if (SvGMAGICAL(sv)) {
626 if (PL_op->op_flags & OPf_REF ||
627 PL_op->op_private & HINT_STRICT_REFS)
628 DIE(aTHX_ PL_no_usym, "a HASH");
629 if (ckWARN(WARN_UNINITIALIZED))
631 if (GIMME == G_ARRAY) {
638 if ((PL_op->op_flags & OPf_SPECIAL) &&
639 !(PL_op->op_flags & OPf_MOD))
641 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
643 && (!is_gv_magical(sym,len,0)
644 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
650 if (PL_op->op_private & HINT_STRICT_REFS)
651 DIE(aTHX_ PL_no_symref, sym, "a HASH");
652 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
659 if (PL_op->op_private & OPpLVAL_INTRO)
661 if (PL_op->op_flags & OPf_REF) {
668 if (GIMME == G_ARRAY) { /* array wanted */
669 *PL_stack_sp = (SV*)hv;
674 if (SvTYPE(hv) == SVt_PVAV)
675 hv = avhv_keys((AV*)hv);
677 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
678 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
688 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
694 leftop = ((BINOP*)PL_op)->op_last;
696 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
697 leftop = ((LISTOP*)leftop)->op_first;
699 /* Skip PUSHMARK and each element already assigned to. */
700 for (i = lelem - firstlelem; i > 0; i--) {
701 leftop = leftop->op_sibling;
704 if (leftop->op_type != OP_RV2HV)
709 av_fill(ary, 0); /* clear all but the fields hash */
710 if (lastrelem >= relem) {
711 while (relem < lastrelem) { /* gobble up all the rest */
715 /* Avoid a memory leak when avhv_store_ent dies. */
716 tmpstr = sv_newmortal();
717 sv_setsv(tmpstr,relem[1]); /* value */
719 if (avhv_store_ent(ary,relem[0],tmpstr,0))
720 (void)SvREFCNT_inc(tmpstr);
721 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
727 if (relem == lastrelem)
733 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
737 if (ckWARN(WARN_MISC)) {
738 if (relem == firstrelem &&
740 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
741 SvTYPE(SvRV(*relem)) == SVt_PVHV))
743 Perl_warner(aTHX_ WARN_MISC,
744 "Reference found where even-sized list expected");
747 Perl_warner(aTHX_ WARN_MISC,
748 "Odd number of elements in hash assignment");
750 if (SvTYPE(hash) == SVt_PVAV) {
752 tmpstr = sv_newmortal();
753 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
754 (void)SvREFCNT_inc(tmpstr);
755 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
760 tmpstr = NEWSV(29,0);
761 didstore = hv_store_ent(hash,*relem,tmpstr,0);
762 if (SvMAGICAL(hash)) {
763 if (SvSMAGICAL(tmpstr))
776 SV **lastlelem = PL_stack_sp;
777 SV **lastrelem = PL_stack_base + POPMARK;
778 SV **firstrelem = PL_stack_base + POPMARK + 1;
779 SV **firstlelem = lastrelem + 1;
792 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
794 /* If there's a common identifier on both sides we have to take
795 * special care that assigning the identifier on the left doesn't
796 * clobber a value on the right that's used later in the list.
798 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
799 EXTEND_MORTAL(lastrelem - firstrelem + 1);
800 for (relem = firstrelem; relem <= lastrelem; relem++) {
803 TAINT_NOT; /* Each item is independent */
804 *relem = sv_mortalcopy(sv);
814 while (lelem <= lastlelem) {
815 TAINT_NOT; /* Each item stands on its own, taintwise. */
817 switch (SvTYPE(sv)) {
820 magic = SvMAGICAL(ary) != 0;
821 if (PL_op->op_private & OPpASSIGN_HASH) {
822 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
828 do_oddball((HV*)ary, relem, firstrelem);
830 relem = lastrelem + 1;
835 av_extend(ary, lastrelem - relem);
837 while (relem <= lastrelem) { /* gobble up all the rest */
843 didstore = av_store(ary,i++,sv);
853 case SVt_PVHV: { /* normal hash */
857 magic = SvMAGICAL(hash) != 0;
860 while (relem < lastrelem) { /* gobble up all the rest */
865 sv = &PL_sv_no, relem++;
866 tmpstr = NEWSV(29,0);
868 sv_setsv(tmpstr,*relem); /* value */
870 didstore = hv_store_ent(hash,sv,tmpstr,0);
872 if (SvSMAGICAL(tmpstr))
879 if (relem == lastrelem) {
880 do_oddball(hash, relem, firstrelem);
886 if (SvIMMORTAL(sv)) {
887 if (relem <= lastrelem)
891 if (relem <= lastrelem) {
892 sv_setsv(sv, *relem);
896 sv_setsv(sv, &PL_sv_undef);
901 if (PL_delaymagic & ~DM_DELAY) {
902 if (PL_delaymagic & DM_UID) {
904 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
907 (void)setreuid(PL_uid,PL_euid);
910 if ((PL_delaymagic & DM_UID) == DM_RUID) {
911 (void)setruid(PL_uid);
912 PL_delaymagic &= ~DM_RUID;
914 # endif /* HAS_SETRUID */
916 if ((PL_delaymagic & DM_UID) == DM_EUID) {
917 (void)seteuid(PL_uid);
918 PL_delaymagic &= ~DM_EUID;
920 # endif /* HAS_SETEUID */
921 if (PL_delaymagic & DM_UID) {
922 if (PL_uid != PL_euid)
923 DIE(aTHX_ "No setreuid available");
924 (void)PerlProc_setuid(PL_uid);
926 # endif /* HAS_SETREUID */
927 #endif /* HAS_SETRESUID */
928 PL_uid = PerlProc_getuid();
929 PL_euid = PerlProc_geteuid();
931 if (PL_delaymagic & DM_GID) {
933 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
936 (void)setregid(PL_gid,PL_egid);
939 if ((PL_delaymagic & DM_GID) == DM_RGID) {
940 (void)setrgid(PL_gid);
941 PL_delaymagic &= ~DM_RGID;
943 # endif /* HAS_SETRGID */
945 if ((PL_delaymagic & DM_GID) == DM_EGID) {
946 (void)setegid(PL_gid);
947 PL_delaymagic &= ~DM_EGID;
949 # endif /* HAS_SETEGID */
950 if (PL_delaymagic & DM_GID) {
951 if (PL_gid != PL_egid)
952 DIE(aTHX_ "No setregid available");
953 (void)PerlProc_setgid(PL_gid);
955 # endif /* HAS_SETREGID */
956 #endif /* HAS_SETRESGID */
957 PL_gid = PerlProc_getgid();
958 PL_egid = PerlProc_getegid();
960 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
967 else if (gimme == G_SCALAR) {
970 SETi(lastrelem - firstrelem + 1);
976 SP = firstrelem + (lastlelem - firstlelem);
977 lelem = firstlelem + (relem - firstrelem);
979 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
987 register PMOP *pm = cPMOP;
988 SV *rv = sv_newmortal();
989 SV *sv = newSVrv(rv, "Regexp");
990 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
997 register PMOP *pm = cPMOP;
1002 I32 r_flags = REXEC_CHECKED;
1003 char *truebase; /* Start of string */
1004 register REGEXP *rx = pm->op_pmregexp;
1009 I32 oldsave = PL_savestack_ix;
1010 I32 update_minmatch = 1;
1011 I32 had_zerolen = 0;
1013 if (PL_op->op_flags & OPf_STACKED)
1019 PUTBACK; /* EVAL blocks need stack_sp. */
1020 s = SvPV(TARG, len);
1023 DIE(aTHX_ "panic: do_match");
1024 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1025 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1028 if (pm->op_pmdynflags & PMdf_USED) {
1030 if (gimme == G_ARRAY)
1035 if (!rx->prelen && PL_curpm) {
1037 rx = pm->op_pmregexp;
1039 if (rx->minlen > len) goto failure;
1043 /* XXXX What part of this is needed with true \G-support? */
1044 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1046 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1047 MAGIC* mg = mg_find(TARG, 'g');
1048 if (mg && mg->mg_len >= 0) {
1049 if (!(rx->reganch & ROPT_GPOS_SEEN))
1050 rx->endp[0] = rx->startp[0] = mg->mg_len;
1051 else if (rx->reganch & ROPT_ANCH_GPOS) {
1052 r_flags |= REXEC_IGNOREPOS;
1053 rx->endp[0] = rx->startp[0] = mg->mg_len;
1055 minmatch = (mg->mg_flags & MGf_MINMATCH);
1056 update_minmatch = 0;
1060 if ((gimme != G_ARRAY && !global && rx->nparens)
1061 || SvTEMP(TARG) || PL_sawampersand)
1062 r_flags |= REXEC_COPY_STR;
1064 r_flags |= REXEC_SCREAM;
1066 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1067 SAVEINT(PL_multiline);
1068 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1072 if (global && rx->startp[0] != -1) {
1073 t = s = rx->endp[0] + truebase;
1074 if ((s + rx->minlen) > strend)
1076 if (update_minmatch++)
1077 minmatch = had_zerolen;
1079 if (rx->reganch & RE_USE_INTUIT) {
1080 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1084 if ( (rx->reganch & ROPT_CHECK_ALL)
1086 && ((rx->reganch & ROPT_NOSCAN)
1087 || !((rx->reganch & RE_INTUIT_TAIL)
1088 && (r_flags & REXEC_SCREAM)))
1089 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1092 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1095 if (pm->op_pmflags & PMf_ONCE)
1096 pm->op_pmdynflags |= PMdf_USED;
1105 RX_MATCH_TAINTED_on(rx);
1106 TAINT_IF(RX_MATCH_TAINTED(rx));
1107 if (gimme == G_ARRAY) {
1110 iters = rx->nparens;
1111 if (global && !iters)
1115 SPAGAIN; /* EVAL blocks could move the stack. */
1116 EXTEND(SP, iters + i);
1117 EXTEND_MORTAL(iters + i);
1118 for (i = !i; i <= iters; i++) {
1119 PUSHs(sv_newmortal());
1121 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1122 len = rx->endp[i] - rx->startp[i];
1123 s = rx->startp[i] + truebase;
1124 sv_setpvn(*SP, s, len);
1125 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1127 sv_utf8_downgrade(*SP, TRUE);
1132 had_zerolen = (rx->startp[0] != -1
1133 && rx->startp[0] == rx->endp[0]);
1134 PUTBACK; /* EVAL blocks may use stack */
1135 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1140 LEAVE_SCOPE(oldsave);
1146 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1147 mg = mg_find(TARG, 'g');
1149 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1150 mg = mg_find(TARG, 'g');
1152 if (rx->startp[0] != -1) {
1153 mg->mg_len = rx->endp[0];
1154 if (rx->startp[0] == rx->endp[0])
1155 mg->mg_flags |= MGf_MINMATCH;
1157 mg->mg_flags &= ~MGf_MINMATCH;
1160 LEAVE_SCOPE(oldsave);
1164 yup: /* Confirmed by INTUIT */
1166 RX_MATCH_TAINTED_on(rx);
1167 TAINT_IF(RX_MATCH_TAINTED(rx));
1169 if (pm->op_pmflags & PMf_ONCE)
1170 pm->op_pmdynflags |= PMdf_USED;
1171 if (RX_MATCH_COPIED(rx))
1172 Safefree(rx->subbeg);
1173 RX_MATCH_COPIED_off(rx);
1174 rx->subbeg = Nullch;
1176 rx->subbeg = truebase;
1177 rx->startp[0] = s - truebase;
1178 rx->endp[0] = s - truebase + rx->minlen;
1179 rx->sublen = strend - truebase;
1182 if (PL_sawampersand) {
1185 rx->subbeg = savepvn(t, strend - t);
1186 rx->sublen = strend - t;
1187 RX_MATCH_COPIED_on(rx);
1188 off = rx->startp[0] = s - t;
1189 rx->endp[0] = off + rx->minlen;
1191 else { /* startp/endp are used by @- @+. */
1192 rx->startp[0] = s - truebase;
1193 rx->endp[0] = s - truebase + rx->minlen;
1195 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1196 LEAVE_SCOPE(oldsave);
1201 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1202 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1203 MAGIC* mg = mg_find(TARG, 'g');
1208 LEAVE_SCOPE(oldsave);
1209 if (gimme == G_ARRAY)
1215 Perl_do_readline(pTHX)
1217 dSP; dTARGETSTACKED;
1222 register IO *io = GvIO(PL_last_in_gv);
1223 register I32 type = PL_op->op_type;
1224 I32 gimme = GIMME_V;
1227 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1229 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1232 call_method("READLINE", gimme);
1235 if (gimme == G_SCALAR)
1236 SvSetMagicSV_nosteal(TARG, TOPs);
1243 if (IoFLAGS(io) & IOf_ARGV) {
1244 if (IoFLAGS(io) & IOf_START) {
1246 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1247 IoFLAGS(io) &= ~IOf_START;
1248 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1249 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1250 SvSETMAGIC(GvSV(PL_last_in_gv));
1255 fp = nextargv(PL_last_in_gv);
1256 if (!fp) { /* Note: fp != IoIFP(io) */
1257 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1260 else if (type == OP_GLOB) {
1261 SV *tmpcmd = NEWSV(55, 0);
1265 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1266 /* since spawning off a process is a real performance hit */
1268 #include <descrip.h>
1269 #include <lib$routines.h>
1272 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1273 char vmsspec[NAM$C_MAXRSS+1];
1274 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1275 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1276 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1279 struct dsc$descriptor_s wilddsc
1280 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1281 struct dsc$descriptor_vs rsdsc
1282 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1283 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1285 /* We could find out if there's an explicit dev/dir or version
1286 by peeking into lib$find_file's internal context at
1287 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1288 but that's unsupported, so I don't want to do it now and
1289 have it bite someone in the future. */
1290 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1291 cp = SvPV(tmpglob,i);
1293 if (cp[i] == ';') hasver = 1;
1295 if (sts) hasver = 1;
1299 hasdir = isunix = 1;
1302 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1307 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1309 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1310 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1311 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1312 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1313 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1314 &dfltdsc,NULL,NULL,NULL))&1)) {
1315 end = rstr + (unsigned long int) *rslt;
1316 if (!hasver) while (*end != ';') end--;
1317 *(end++) = '\n'; *end = '\0';
1318 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1320 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1325 while (*(--begin) != ']' && *begin != '>') ;
1328 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1330 if (cxt) (void)lib$find_file_end(&cxt);
1331 if (ok && sts != RMS$_NMF &&
1332 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1335 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1337 PerlIO_close(tmpfp);
1341 PerlIO_rewind(tmpfp);
1342 IoTYPE(io) = IoTYPE_RDONLY;
1343 IoIFP(io) = fp = tmpfp;
1344 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1349 #ifdef MACOS_TRADITIONAL
1350 sv_setpv(tmpcmd, "glob ");
1351 sv_catsv(tmpcmd, tmpglob);
1352 sv_catpv(tmpcmd, " |");
1356 sv_setpv(tmpcmd, "for a in ");
1357 sv_catsv(tmpcmd, tmpglob);
1358 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1361 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1362 sv_catsv(tmpcmd, tmpglob);
1364 sv_setpv(tmpcmd, "perlglob ");
1365 sv_catsv(tmpcmd, tmpglob);
1366 sv_catpv(tmpcmd, " |");
1371 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1372 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1373 sv_catsv(tmpcmd, tmpglob);
1374 sv_catpv(tmpcmd, "' 2>/dev/null |");
1376 sv_setpv(tmpcmd, "echo ");
1377 sv_catsv(tmpcmd, tmpglob);
1379 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1381 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1384 #endif /* !DOSISH */
1385 #endif /* MACOS_TRADITIONAL */
1386 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1387 FALSE, O_RDONLY, 0, Nullfp);
1393 else if (type == OP_GLOB)
1395 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1396 && (IoTYPE(io) == IoTYPE_WRONLY || fp == PerlIO_stdout()
1397 || fp == PerlIO_stderr()))
1399 /* integrate with report_evil_fh()? */
1401 if (isGV(PL_last_in_gv)) { /* can this ever fail? */
1402 SV* sv = sv_newmortal();
1403 gv_efullname4(sv, PL_last_in_gv, Nullch, FALSE);
1404 name = SvPV_nolen(sv);
1407 Perl_warner(aTHX_ WARN_IO,
1408 "Filehandle %s opened only for output", name);
1410 Perl_warner(aTHX_ WARN_IO,
1411 "Filehandle opened only for output");
1415 if (ckWARN2(WARN_GLOB, WARN_CLOSED)
1416 && (!io || !(IoFLAGS(io) & IOf_START))) {
1417 if (type == OP_GLOB)
1418 Perl_warner(aTHX_ WARN_GLOB,
1419 "glob failed (can't start child: %s)",
1422 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1424 if (gimme == G_SCALAR) {
1425 (void)SvOK_off(TARG);
1431 if (gimme == G_SCALAR) {
1435 (void)SvUPGRADE(sv, SVt_PV);
1436 tmplen = SvLEN(sv); /* remember if already alloced */
1438 Sv_Grow(sv, 80); /* try short-buffering it */
1439 if (type == OP_RCATLINE)
1445 sv = sv_2mortal(NEWSV(57, 80));
1449 /* This should not be marked tainted if the fp is marked clean */
1450 #define MAYBE_TAINT_LINE(io, sv) \
1451 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1456 /* delay EOF state for a snarfed empty file */
1457 #define SNARF_EOF(gimme,rs,io,sv) \
1458 (gimme != G_SCALAR || SvCUR(sv) \
1459 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1462 if (!sv_gets(sv, fp, offset)
1463 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1465 PerlIO_clearerr(fp);
1466 if (IoFLAGS(io) & IOf_ARGV) {
1467 fp = nextargv(PL_last_in_gv);
1470 (void)do_close(PL_last_in_gv, FALSE);
1472 else if (type == OP_GLOB) {
1473 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1474 Perl_warner(aTHX_ WARN_GLOB,
1475 "glob failed (child exited with status %d%s)",
1476 (int)(STATUS_CURRENT >> 8),
1477 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1480 if (gimme == G_SCALAR) {
1481 (void)SvOK_off(TARG);
1484 MAYBE_TAINT_LINE(io, sv);
1487 MAYBE_TAINT_LINE(io, sv);
1489 IoFLAGS(io) |= IOf_NOLINE;
1492 if (type == OP_GLOB) {
1495 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1496 tmps = SvEND(sv) - 1;
1497 if (*tmps == *SvPVX(PL_rs)) {
1502 for (tmps = SvPVX(sv); *tmps; tmps++)
1503 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1504 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1506 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1507 (void)POPs; /* Unmatched wildcard? Chuck it... */
1511 if (gimme == G_ARRAY) {
1512 if (SvLEN(sv) - SvCUR(sv) > 20) {
1513 SvLEN_set(sv, SvCUR(sv)+1);
1514 Renew(SvPVX(sv), SvLEN(sv), char);
1516 sv = sv_2mortal(NEWSV(58, 80));
1519 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1520 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1524 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1525 Renew(SvPVX(sv), SvLEN(sv), char);
1534 register PERL_CONTEXT *cx;
1535 I32 gimme = OP_GIMME(PL_op, -1);
1538 if (cxstack_ix >= 0)
1539 gimme = cxstack[cxstack_ix].blk_gimme;
1547 PUSHBLOCK(cx, CXt_BLOCK, SP);
1559 U32 lval = PL_op->op_flags & OPf_MOD;
1560 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1562 U32 hash = (SvFAKE(keysv) && SvREADONLY(keysv)) ? SvUVX(keysv) : 0;
1564 if (SvTYPE(hv) == SVt_PVHV) {
1565 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1566 svp = he ? &HeVAL(he) : 0;
1568 else if (SvTYPE(hv) == SVt_PVAV) {
1569 if (PL_op->op_private & OPpLVAL_INTRO)
1570 DIE(aTHX_ "Can't localize pseudo-hash element");
1571 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, hash);
1577 if (!svp || *svp == &PL_sv_undef) {
1582 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1584 lv = sv_newmortal();
1585 sv_upgrade(lv, SVt_PVLV);
1587 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1588 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1589 LvTARG(lv) = SvREFCNT_inc(hv);
1594 if (PL_op->op_private & OPpLVAL_INTRO) {
1595 if (HvNAME(hv) && isGV(*svp))
1596 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1598 save_helem(hv, keysv, svp);
1600 else if (PL_op->op_private & OPpDEREF)
1601 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1603 sv = (svp ? *svp : &PL_sv_undef);
1604 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1605 * Pushing the magical RHS on to the stack is useless, since
1606 * that magic is soon destined to be misled by the local(),
1607 * and thus the later pp_sassign() will fail to mg_get() the
1608 * old value. This should also cure problems with delayed
1609 * mg_get()s. GSAR 98-07-03 */
1610 if (!lval && SvGMAGICAL(sv))
1611 sv = sv_mortalcopy(sv);
1619 register PERL_CONTEXT *cx;
1625 if (PL_op->op_flags & OPf_SPECIAL) {
1626 cx = &cxstack[cxstack_ix];
1627 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1632 gimme = OP_GIMME(PL_op, -1);
1634 if (cxstack_ix >= 0)
1635 gimme = cxstack[cxstack_ix].blk_gimme;
1641 if (gimme == G_VOID)
1643 else if (gimme == G_SCALAR) {
1646 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1649 *MARK = sv_mortalcopy(TOPs);
1652 *MARK = &PL_sv_undef;
1656 else if (gimme == G_ARRAY) {
1657 /* in case LEAVE wipes old return values */
1658 for (mark = newsp + 1; mark <= SP; mark++) {
1659 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1660 *mark = sv_mortalcopy(*mark);
1661 TAINT_NOT; /* Each item is independent */
1665 PL_curpm = newpm; /* Don't pop $1 et al till now */
1675 register PERL_CONTEXT *cx;
1681 cx = &cxstack[cxstack_ix];
1682 if (CxTYPE(cx) != CXt_LOOP)
1683 DIE(aTHX_ "panic: pp_iter");
1685 itersvp = CxITERVAR(cx);
1686 av = cx->blk_loop.iterary;
1687 if (SvTYPE(av) != SVt_PVAV) {
1688 /* iterate ($min .. $max) */
1689 if (cx->blk_loop.iterlval) {
1690 /* string increment */
1691 register SV* cur = cx->blk_loop.iterlval;
1693 char *max = SvPV((SV*)av, maxlen);
1694 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1695 #ifndef USE_THREADS /* don't risk potential race */
1696 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1697 /* safe to reuse old SV */
1698 sv_setsv(*itersvp, cur);
1703 /* we need a fresh SV every time so that loop body sees a
1704 * completely new SV for closures/references to work as
1706 SvREFCNT_dec(*itersvp);
1707 *itersvp = newSVsv(cur);
1709 if (strEQ(SvPVX(cur), max))
1710 sv_setiv(cur, 0); /* terminate next time */
1717 /* integer increment */
1718 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1721 #ifndef USE_THREADS /* don't risk potential race */
1722 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1723 /* safe to reuse old SV */
1724 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1729 /* we need a fresh SV every time so that loop body sees a
1730 * completely new SV for closures/references to work as they
1732 SvREFCNT_dec(*itersvp);
1733 *itersvp = newSViv(cx->blk_loop.iterix++);
1739 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1742 SvREFCNT_dec(*itersvp);
1744 if ((sv = SvMAGICAL(av)
1745 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1746 : AvARRAY(av)[++cx->blk_loop.iterix]))
1750 if (av != PL_curstack && SvIMMORTAL(sv)) {
1751 SV *lv = cx->blk_loop.iterlval;
1752 if (lv && SvREFCNT(lv) > 1) {
1757 SvREFCNT_dec(LvTARG(lv));
1759 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1760 sv_upgrade(lv, SVt_PVLV);
1762 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1764 LvTARG(lv) = SvREFCNT_inc(av);
1765 LvTARGOFF(lv) = cx->blk_loop.iterix;
1766 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1770 *itersvp = SvREFCNT_inc(sv);
1777 register PMOP *pm = cPMOP;
1793 register REGEXP *rx = pm->op_pmregexp;
1795 int force_on_match = 0;
1796 I32 oldsave = PL_savestack_ix;
1798 /* known replacement string? */
1799 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1800 if (PL_op->op_flags & OPf_STACKED)
1806 if (SvFAKE(TARG) && SvREADONLY(TARG))
1807 sv_force_normal(TARG);
1808 if (SvREADONLY(TARG)
1809 || (SvTYPE(TARG) > SVt_PVLV
1810 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1811 DIE(aTHX_ PL_no_modify);
1814 s = SvPV(TARG, len);
1815 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1817 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1818 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1825 DIE(aTHX_ "panic: do_subst");
1828 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1829 position, once with zero-length,
1830 second time with non-zero. */
1832 if (!rx->prelen && PL_curpm) {
1834 rx = pm->op_pmregexp;
1836 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1837 ? REXEC_COPY_STR : 0;
1839 r_flags |= REXEC_SCREAM;
1840 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1841 SAVEINT(PL_multiline);
1842 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1845 if (rx->reganch & RE_USE_INTUIT) {
1846 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1850 /* How to do it in subst? */
1851 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1853 && ((rx->reganch & ROPT_NOSCAN)
1854 || !((rx->reganch & RE_INTUIT_TAIL)
1855 && (r_flags & REXEC_SCREAM))))
1860 /* only replace once? */
1861 once = !(rpm->op_pmflags & PMf_GLOBAL);
1863 /* known replacement string? */
1864 c = dstr ? SvPV(dstr, clen) : Nullch;
1866 /* can do inplace substitution? */
1867 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1868 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1869 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1870 r_flags | REXEC_CHECKED))
1874 LEAVE_SCOPE(oldsave);
1877 if (force_on_match) {
1879 s = SvPV_force(TARG, len);
1884 SvSCREAM_off(TARG); /* disable possible screamer */
1886 rxtainted |= RX_MATCH_TAINTED(rx);
1887 m = orig + rx->startp[0];
1888 d = orig + rx->endp[0];
1890 if (m - s > strend - d) { /* faster to shorten from end */
1892 Copy(c, m, clen, char);
1897 Move(d, m, i, char);
1901 SvCUR_set(TARG, m - s);
1904 else if ((i = m - s)) { /* faster from front */
1912 Copy(c, m, clen, char);
1917 Copy(c, d, clen, char);
1922 TAINT_IF(rxtainted & 1);
1928 if (iters++ > maxiters)
1929 DIE(aTHX_ "Substitution loop");
1930 rxtainted |= RX_MATCH_TAINTED(rx);
1931 m = rx->startp[0] + orig;
1935 Move(s, d, i, char);
1939 Copy(c, d, clen, char);
1942 s = rx->endp[0] + orig;
1943 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1945 /* don't match same null twice */
1946 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1949 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1950 Move(s, d, i+1, char); /* include the NUL */
1952 TAINT_IF(rxtainted & 1);
1954 PUSHs(sv_2mortal(newSViv((I32)iters)));
1956 (void)SvPOK_only_UTF8(TARG);
1957 TAINT_IF(rxtainted);
1958 if (SvSMAGICAL(TARG)) {
1964 LEAVE_SCOPE(oldsave);
1968 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1969 r_flags | REXEC_CHECKED))
1971 if (force_on_match) {
1973 s = SvPV_force(TARG, len);
1976 rxtainted |= RX_MATCH_TAINTED(rx);
1977 dstr = NEWSV(25, len);
1978 sv_setpvn(dstr, m, s-m);
1981 register PERL_CONTEXT *cx;
1984 RETURNOP(cPMOP->op_pmreplroot);
1986 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1988 if (iters++ > maxiters)
1989 DIE(aTHX_ "Substitution loop");
1990 rxtainted |= RX_MATCH_TAINTED(rx);
1991 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1996 strend = s + (strend - m);
1998 m = rx->startp[0] + orig;
1999 sv_catpvn(dstr, s, m-s);
2000 s = rx->endp[0] + orig;
2002 sv_catpvn(dstr, c, clen);
2005 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
2006 sv_catpvn(dstr, s, strend - s);
2008 (void)SvOOK_off(TARG);
2009 Safefree(SvPVX(TARG));
2010 SvPVX(TARG) = SvPVX(dstr);
2011 SvCUR_set(TARG, SvCUR(dstr));
2012 SvLEN_set(TARG, SvLEN(dstr));
2016 TAINT_IF(rxtainted & 1);
2018 PUSHs(sv_2mortal(newSViv((I32)iters)));
2020 (void)SvPOK_only(TARG);
2021 TAINT_IF(rxtainted);
2024 LEAVE_SCOPE(oldsave);
2033 LEAVE_SCOPE(oldsave);
2042 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2043 ++*PL_markstack_ptr;
2044 LEAVE; /* exit inner scope */
2047 if (PL_stack_base + *PL_markstack_ptr > SP) {
2049 I32 gimme = GIMME_V;
2051 LEAVE; /* exit outer scope */
2052 (void)POPMARK; /* pop src */
2053 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2054 (void)POPMARK; /* pop dst */
2055 SP = PL_stack_base + POPMARK; /* pop original mark */
2056 if (gimme == G_SCALAR) {
2060 else if (gimme == G_ARRAY)
2067 ENTER; /* enter inner scope */
2070 src = PL_stack_base[*PL_markstack_ptr];
2074 RETURNOP(cLOGOP->op_other);
2085 register PERL_CONTEXT *cx;
2091 if (gimme == G_SCALAR) {
2094 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2096 *MARK = SvREFCNT_inc(TOPs);
2101 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2103 *MARK = sv_mortalcopy(sv);
2108 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2112 *MARK = &PL_sv_undef;
2116 else if (gimme == G_ARRAY) {
2117 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2118 if (!SvTEMP(*MARK)) {
2119 *MARK = sv_mortalcopy(*MARK);
2120 TAINT_NOT; /* Each item is independent */
2126 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2127 PL_curpm = newpm; /* ... and pop $1 et al */
2131 return pop_return();
2134 /* This duplicates the above code because the above code must not
2135 * get any slower by more conditions */
2143 register PERL_CONTEXT *cx;
2150 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2151 /* We are an argument to a function or grep().
2152 * This kind of lvalueness was legal before lvalue
2153 * subroutines too, so be backward compatible:
2154 * cannot report errors. */
2156 /* Scalar context *is* possible, on the LHS of -> only,
2157 * as in f()->meth(). But this is not an lvalue. */
2158 if (gimme == G_SCALAR)
2160 if (gimme == G_ARRAY) {
2161 if (!CvLVALUE(cx->blk_sub.cv))
2162 goto temporise_array;
2163 EXTEND_MORTAL(SP - newsp);
2164 for (mark = newsp + 1; mark <= SP; mark++) {
2167 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2168 *mark = sv_mortalcopy(*mark);
2170 /* Can be a localized value subject to deletion. */
2171 PL_tmps_stack[++PL_tmps_ix] = *mark;
2172 (void)SvREFCNT_inc(*mark);
2177 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2178 /* Here we go for robustness, not for speed, so we change all
2179 * the refcounts so the caller gets a live guy. Cannot set
2180 * TEMP, so sv_2mortal is out of question. */
2181 if (!CvLVALUE(cx->blk_sub.cv)) {
2186 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2188 if (gimme == G_SCALAR) {
2192 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2197 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2198 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2200 else { /* Can be a localized value
2201 * subject to deletion. */
2202 PL_tmps_stack[++PL_tmps_ix] = *mark;
2203 (void)SvREFCNT_inc(*mark);
2206 else { /* Should not happen? */
2211 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2212 (MARK > SP ? "Empty array" : "Array"));
2216 else if (gimme == G_ARRAY) {
2217 EXTEND_MORTAL(SP - newsp);
2218 for (mark = newsp + 1; mark <= SP; mark++) {
2219 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2220 /* Might be flattened array after $#array = */
2226 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2227 (*mark != &PL_sv_undef)
2229 ? "a readonly value" : "a temporary")
2230 : "an uninitialized value");
2233 /* Can be a localized value subject to deletion. */
2234 PL_tmps_stack[++PL_tmps_ix] = *mark;
2235 (void)SvREFCNT_inc(*mark);
2241 if (gimme == G_SCALAR) {
2245 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2247 *MARK = SvREFCNT_inc(TOPs);
2252 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2254 *MARK = sv_mortalcopy(sv);
2259 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2263 *MARK = &PL_sv_undef;
2267 else if (gimme == G_ARRAY) {
2269 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2270 if (!SvTEMP(*MARK)) {
2271 *MARK = sv_mortalcopy(*MARK);
2272 TAINT_NOT; /* Each item is independent */
2279 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2280 PL_curpm = newpm; /* ... and pop $1 et al */
2284 return pop_return();
2289 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2292 SV *dbsv = GvSV(PL_DBsub);
2294 if (!PERLDB_SUB_NN) {
2298 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2299 || strEQ(GvNAME(gv), "END")
2300 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2301 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2302 && (gv = (GV*)*svp) ))) {
2303 /* Use GV from the stack as a fallback. */
2304 /* GV is potentially non-unique, or contain different CV. */
2305 SV *tmp = newRV((SV*)cv);
2306 sv_setsv(dbsv, tmp);
2310 gv_efullname3(dbsv, gv, Nullch);
2314 (void)SvUPGRADE(dbsv, SVt_PVIV);
2315 (void)SvIOK_on(dbsv);
2316 SAVEIV(SvIVX(dbsv));
2317 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2321 PL_curcopdb = PL_curcop;
2322 cv = GvCV(PL_DBsub);
2332 register PERL_CONTEXT *cx;
2334 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2337 DIE(aTHX_ "Not a CODE reference");
2338 switch (SvTYPE(sv)) {
2344 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2346 SP = PL_stack_base + POPMARK;
2349 if (SvGMAGICAL(sv)) {
2351 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2354 sym = SvPV(sv, n_a);
2356 DIE(aTHX_ PL_no_usym, "a subroutine");
2357 if (PL_op->op_private & HINT_STRICT_REFS)
2358 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2359 cv = get_cv(sym, TRUE);
2363 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2364 tryAMAGICunDEREF(to_cv);
2367 if (SvTYPE(cv) == SVt_PVCV)
2372 DIE(aTHX_ "Not a CODE reference");
2377 if (!(cv = GvCVu((GV*)sv)))
2378 cv = sv_2cv(sv, &stash, &gv, FALSE);
2391 if (!CvROOT(cv) && !CvXSUB(cv)) {
2395 /* anonymous or undef'd function leaves us no recourse */
2396 if (CvANON(cv) || !(gv = CvGV(cv)))
2397 DIE(aTHX_ "Undefined subroutine called");
2399 /* autoloaded stub? */
2400 if (cv != GvCV(gv)) {
2403 /* should call AUTOLOAD now? */
2406 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2413 sub_name = sv_newmortal();
2414 gv_efullname3(sub_name, gv, Nullch);
2415 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2419 DIE(aTHX_ "Not a CODE reference");
2424 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2425 cv = get_db_sub(&sv, cv);
2427 DIE(aTHX_ "No DBsub routine");
2432 * First we need to check if the sub or method requires locking.
2433 * If so, we gain a lock on the CV, the first argument or the
2434 * stash (for static methods), as appropriate. This has to be
2435 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2436 * reschedule by returning a new op.
2438 MUTEX_LOCK(CvMUTEXP(cv));
2439 if (CvFLAGS(cv) & CVf_LOCKED) {
2441 if (CvFLAGS(cv) & CVf_METHOD) {
2442 if (SP > PL_stack_base + TOPMARK)
2443 sv = *(PL_stack_base + TOPMARK + 1);
2445 AV *av = (AV*)PL_curpad[0];
2446 if (hasargs || !av || AvFILLp(av) < 0
2447 || !(sv = AvARRAY(av)[0]))
2449 MUTEX_UNLOCK(CvMUTEXP(cv));
2450 DIE(aTHX_ "no argument for locked method call");
2457 char *stashname = SvPV(sv, len);
2458 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2464 MUTEX_UNLOCK(CvMUTEXP(cv));
2465 mg = condpair_magic(sv);
2466 MUTEX_LOCK(MgMUTEXP(mg));
2467 if (MgOWNER(mg) == thr)
2468 MUTEX_UNLOCK(MgMUTEXP(mg));
2471 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2473 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2475 MUTEX_UNLOCK(MgMUTEXP(mg));
2476 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2478 MUTEX_LOCK(CvMUTEXP(cv));
2481 * Now we have permission to enter the sub, we must distinguish
2482 * four cases. (0) It's an XSUB (in which case we don't care
2483 * about ownership); (1) it's ours already (and we're recursing);
2484 * (2) it's free (but we may already be using a cached clone);
2485 * (3) another thread owns it. Case (1) is easy: we just use it.
2486 * Case (2) means we look for a clone--if we have one, use it
2487 * otherwise grab ownership of cv. Case (3) means we look for a
2488 * clone (for non-XSUBs) and have to create one if we don't
2490 * Why look for a clone in case (2) when we could just grab
2491 * ownership of cv straight away? Well, we could be recursing,
2492 * i.e. we originally tried to enter cv while another thread
2493 * owned it (hence we used a clone) but it has been freed up
2494 * and we're now recursing into it. It may or may not be "better"
2495 * to use the clone but at least CvDEPTH can be trusted.
2497 if (CvOWNER(cv) == thr || CvXSUB(cv))
2498 MUTEX_UNLOCK(CvMUTEXP(cv));
2500 /* Case (2) or (3) */
2504 * XXX Might it be better to release CvMUTEXP(cv) while we
2505 * do the hv_fetch? We might find someone has pinched it
2506 * when we look again, in which case we would be in case
2507 * (3) instead of (2) so we'd have to clone. Would the fact
2508 * that we released the mutex more quickly make up for this?
2510 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2512 /* We already have a clone to use */
2513 MUTEX_UNLOCK(CvMUTEXP(cv));
2515 DEBUG_S(PerlIO_printf(Perl_debug_log,
2516 "entersub: %p already has clone %p:%s\n",
2517 thr, cv, SvPEEK((SV*)cv)));
2520 if (CvDEPTH(cv) == 0)
2521 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2524 /* (2) => grab ownership of cv. (3) => make clone */
2528 MUTEX_UNLOCK(CvMUTEXP(cv));
2529 DEBUG_S(PerlIO_printf(Perl_debug_log,
2530 "entersub: %p grabbing %p:%s in stash %s\n",
2531 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2532 HvNAME(CvSTASH(cv)) : "(none)"));
2535 /* Make a new clone. */
2537 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2538 MUTEX_UNLOCK(CvMUTEXP(cv));
2539 DEBUG_S((PerlIO_printf(Perl_debug_log,
2540 "entersub: %p cloning %p:%s\n",
2541 thr, cv, SvPEEK((SV*)cv))));
2543 * We're creating a new clone so there's no race
2544 * between the original MUTEX_UNLOCK and the
2545 * SvREFCNT_inc since no one will be trying to undef
2546 * it out from underneath us. At least, I don't think
2549 clonecv = cv_clone(cv);
2550 SvREFCNT_dec(cv); /* finished with this */
2551 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2552 CvOWNER(clonecv) = thr;
2556 DEBUG_S(if (CvDEPTH(cv) != 0)
2557 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2559 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2562 #endif /* USE_THREADS */
2565 #ifdef PERL_XSUB_OLDSTYLE
2566 if (CvOLDSTYLE(cv)) {
2567 I32 (*fp3)(int,int,int);
2569 register I32 items = SP - MARK;
2570 /* We dont worry to copy from @_. */
2575 PL_stack_sp = mark + 1;
2576 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2577 items = (*fp3)(CvXSUBANY(cv).any_i32,
2578 MARK - PL_stack_base + 1,
2580 PL_stack_sp = PL_stack_base + items;
2583 #endif /* PERL_XSUB_OLDSTYLE */
2585 I32 markix = TOPMARK;
2590 /* Need to copy @_ to stack. Alternative may be to
2591 * switch stack to @_, and copy return values
2592 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2596 av = (AV*)PL_curpad[0];
2598 av = GvAV(PL_defgv);
2599 #endif /* USE_THREADS */
2600 items = AvFILLp(av) + 1; /* @_ is not tieable */
2603 /* Mark is at the end of the stack. */
2605 Copy(AvARRAY(av), SP + 1, items, SV*);
2610 /* We assume first XSUB in &DB::sub is the called one. */
2612 SAVEVPTR(PL_curcop);
2613 PL_curcop = PL_curcopdb;
2616 /* Do we need to open block here? XXXX */
2617 (void)(*CvXSUB(cv))(aTHXo_ cv);
2619 /* Enforce some sanity in scalar context. */
2620 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2621 if (markix > PL_stack_sp - PL_stack_base)
2622 *(PL_stack_base + markix) = &PL_sv_undef;
2624 *(PL_stack_base + markix) = *PL_stack_sp;
2625 PL_stack_sp = PL_stack_base + markix;
2633 register I32 items = SP - MARK;
2634 AV* padlist = CvPADLIST(cv);
2635 SV** svp = AvARRAY(padlist);
2636 push_return(PL_op->op_next);
2637 PUSHBLOCK(cx, CXt_SUB, MARK);
2640 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2641 * that eval'' ops within this sub know the correct lexical space.
2642 * Owing the speed considerations, we choose to search for the cv
2643 * in doeval() instead.
2645 if (CvDEPTH(cv) < 2)
2646 (void)SvREFCNT_inc(cv);
2647 else { /* save temporaries on recursion? */
2648 PERL_STACK_OVERFLOW_CHECK();
2649 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2651 AV *newpad = newAV();
2652 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2653 I32 ix = AvFILLp((AV*)svp[1]);
2654 I32 names_fill = AvFILLp((AV*)svp[0]);
2655 svp = AvARRAY(svp[0]);
2656 for ( ;ix > 0; ix--) {
2657 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2658 char *name = SvPVX(svp[ix]);
2659 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2660 || *name == '&') /* anonymous code? */
2662 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2664 else { /* our own lexical */
2666 av_store(newpad, ix, sv = (SV*)newAV());
2667 else if (*name == '%')
2668 av_store(newpad, ix, sv = (SV*)newHV());
2670 av_store(newpad, ix, sv = NEWSV(0,0));
2674 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2675 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2678 av_store(newpad, ix, sv = NEWSV(0,0));
2682 av = newAV(); /* will be @_ */
2684 av_store(newpad, 0, (SV*)av);
2685 AvFLAGS(av) = AVf_REIFY;
2686 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2687 AvFILLp(padlist) = CvDEPTH(cv);
2688 svp = AvARRAY(padlist);
2693 AV* av = (AV*)PL_curpad[0];
2695 items = AvFILLp(av) + 1;
2697 /* Mark is at the end of the stack. */
2699 Copy(AvARRAY(av), SP + 1, items, SV*);
2704 #endif /* USE_THREADS */
2705 SAVEVPTR(PL_curpad);
2706 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2709 #endif /* USE_THREADS */
2715 DEBUG_S(PerlIO_printf(Perl_debug_log,
2716 "%p entersub preparing @_\n", thr));
2718 av = (AV*)PL_curpad[0];
2720 /* @_ is normally not REAL--this should only ever
2721 * happen when DB::sub() calls things that modify @_ */
2727 cx->blk_sub.savearray = GvAV(PL_defgv);
2728 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2729 #endif /* USE_THREADS */
2730 cx->blk_sub.oldcurpad = PL_curpad;
2731 cx->blk_sub.argarray = av;
2734 if (items > AvMAX(av) + 1) {
2736 if (AvARRAY(av) != ary) {
2737 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2738 SvPVX(av) = (char*)ary;
2740 if (items > AvMAX(av) + 1) {
2741 AvMAX(av) = items - 1;
2742 Renew(ary,items,SV*);
2744 SvPVX(av) = (char*)ary;
2747 Copy(MARK,AvARRAY(av),items,SV*);
2748 AvFILLp(av) = items - 1;
2756 /* warning must come *after* we fully set up the context
2757 * stuff so that __WARN__ handlers can safely dounwind()
2760 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2761 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2762 sub_crush_depth(cv);
2764 DEBUG_S(PerlIO_printf(Perl_debug_log,
2765 "%p entersub returning %p\n", thr, CvSTART(cv)));
2767 RETURNOP(CvSTART(cv));
2772 Perl_sub_crush_depth(pTHX_ CV *cv)
2775 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2777 SV* tmpstr = sv_newmortal();
2778 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2779 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2790 U32 lval = PL_op->op_flags & OPf_MOD;
2791 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2795 elem -= PL_curcop->cop_arybase;
2796 if (SvTYPE(av) != SVt_PVAV)
2798 svp = av_fetch(av, elem, lval && !defer);
2800 if (!svp || *svp == &PL_sv_undef) {
2803 DIE(aTHX_ PL_no_aelem, elem);
2804 lv = sv_newmortal();
2805 sv_upgrade(lv, SVt_PVLV);
2807 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2808 LvTARG(lv) = SvREFCNT_inc(av);
2809 LvTARGOFF(lv) = elem;
2814 if (PL_op->op_private & OPpLVAL_INTRO)
2815 save_aelem(av, elem, svp);
2816 else if (PL_op->op_private & OPpDEREF)
2817 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2819 sv = (svp ? *svp : &PL_sv_undef);
2820 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2821 sv = sv_mortalcopy(sv);
2827 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2833 Perl_croak(aTHX_ PL_no_modify);
2834 if (SvTYPE(sv) < SVt_RV)
2835 sv_upgrade(sv, SVt_RV);
2836 else if (SvTYPE(sv) >= SVt_PV) {
2837 (void)SvOOK_off(sv);
2838 Safefree(SvPVX(sv));
2839 SvLEN(sv) = SvCUR(sv) = 0;
2843 SvRV(sv) = NEWSV(355,0);
2846 SvRV(sv) = (SV*)newAV();
2849 SvRV(sv) = (SV*)newHV();
2864 if (SvTYPE(rsv) == SVt_PVCV) {
2870 SETs(method_common(sv, Null(U32*)));
2877 SV* sv = cSVOP->op_sv;
2878 U32 hash = SvUVX(sv);
2880 XPUSHs(method_common(sv, &hash));
2885 S_method_common(pTHX_ SV* meth, U32* hashp)
2896 name = SvPV(meth, namelen);
2897 sv = *(PL_stack_base + TOPMARK + 1);
2900 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2911 !(packname = SvPV(sv, packlen)) ||
2912 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2913 !(ob=(SV*)GvIO(iogv)))
2916 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2917 ? !isIDFIRST_utf8((U8*)packname)
2918 : !isIDFIRST(*packname)
2921 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2922 SvOK(sv) ? "without a package or object reference"
2923 : "on an undefined value");
2925 stash = gv_stashpvn(packname, packlen, TRUE);
2928 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2931 if (!ob || !(SvOBJECT(ob)
2932 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2935 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2939 stash = SvSTASH(ob);
2942 /* shortcut for simple names */
2944 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2946 gv = (GV*)HeVAL(he);
2947 if (isGV(gv) && GvCV(gv) &&
2948 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2949 return (SV*)GvCV(gv);
2953 gv = gv_fetchmethod(stash, name);
2960 for (p = name; *p; p++) {
2962 sep = p, leaf = p + 1;
2963 else if (*p == ':' && *(p + 1) == ':')
2964 sep = p, leaf = p + 2;
2966 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2967 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2968 packlen = strlen(packname);
2972 packlen = sep - name;
2974 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2975 if (gv && isGV(gv)) {
2977 "Can't locate object method \"%s\" via package \"%s\"",
2982 "Can't locate object method \"%s\" via package \"%s\""
2983 " (perhaps you forgot to load \"%s\"?)",
2984 leaf, packname, packname);
2987 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2992 unset_cvowner(pTHXo_ void *cvarg)
2994 register CV* cv = (CV *) cvarg;
2997 #endif /* DEBUGGING */
2999 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
3000 thr, cv, SvPEEK((SV*)cv))));
3001 MUTEX_LOCK(CvMUTEXP(cv));
3002 DEBUG_S(if (CvDEPTH(cv) != 0)
3003 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
3005 assert(thr == CvOWNER(cv));
3007 MUTEX_UNLOCK(CvMUTEXP(cv));
3010 #endif /* USE_THREADS */