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);
152 if (TARG == right && SvGMAGICAL(right))
154 if (SvGMAGICAL(left))
157 left_utf = DO_UTF8(left);
158 right_utf = DO_UTF8(right);
160 if (left_utf != right_utf) {
161 if (TARG == right && !right_utf) {
162 sv_utf8_upgrade(TARG); /* Now straight binary copy */
166 /* Set TARG to PV(left), then add right */
167 U8 *l, *c, *olds = NULL;
169 s = (U8*)SvPV(right,len);
170 right_utf |= DO_UTF8(right);
172 /* Take a copy since we're about to overwrite TARG */
173 olds = s = (U8*)savepvn((char*)s, len);
175 if (!SvOK(left) && SvTYPE(left) <= SVt_PVMG) {
176 if (SvREADONLY(left))
177 left = sv_2mortal(newSVsv(left));
179 sv_setpv(left, ""); /* Suppress warning. */
181 l = (U8*)SvPV(left, targlen);
182 left_utf |= DO_UTF8(left);
184 sv_setpvn(TARG, (char*)l, targlen);
186 sv_utf8_upgrade(TARG);
187 /* Extend TARG to length of right (s) */
188 targlen = SvCUR(TARG) + len;
190 /* plus one for each hi-byte char if we have to upgrade */
191 for (c = s; c < s + len; c++) {
196 SvGROW(TARG, targlen+1);
197 /* And now copy, maybe upgrading right to UTF8 on the fly */
198 for (c = (U8*)SvEND(TARG); len--; s++) {
199 if (*s & 0x80 && !right_utf)
200 c = uv_to_utf8(c, *s);
204 SvCUR_set(TARG, targlen);
214 s = (U8*)SvPV(left,len);
216 sv_insert(TARG, 0, 0, (char*)s, len);
220 sv_setpvn(TARG, (char *)s, len);
222 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG)
223 sv_setpv(TARG, ""); /* Suppress warning. */
224 s = (U8*)SvPV(right,len);
226 #if defined(PERL_Y2KWARN)
227 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
229 char *s = SvPV(TARG,n);
230 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
231 && (n == 2 || !isDIGIT(s[n-3])))
233 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
234 "about to append an integer to '19'");
238 sv_catpvn(TARG, (char *)s, len);
241 sv_setpvn(TARG, (char *)s, len); /* suppress warning */
253 if (PL_op->op_flags & OPf_MOD) {
254 if (PL_op->op_private & OPpLVAL_INTRO)
255 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
256 else if (PL_op->op_private & OPpDEREF) {
258 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
267 tryAMAGICunTARGET(iter, 0);
268 PL_last_in_gv = (GV*)(*PL_stack_sp--);
269 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
270 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
271 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
274 XPUSHs((SV*)PL_last_in_gv);
277 PL_last_in_gv = (GV*)(*PL_stack_sp--);
280 return do_readline();
285 djSP; tryAMAGICbinSET(eq,0);
288 SETs(boolSV(TOPn == value));
296 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
297 DIE(aTHX_ PL_no_modify);
298 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
299 SvIVX(TOPs) != IV_MAX)
302 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
317 RETURNOP(cLOGOP->op_other);
323 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
326 SETn( left + right );
334 AV *av = GvAV(cGVOP_gv);
335 U32 lval = PL_op->op_flags & OPf_MOD;
336 SV** svp = av_fetch(av, PL_op->op_private, lval);
337 SV *sv = (svp ? *svp : &PL_sv_undef);
339 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
340 sv = sv_mortalcopy(sv);
347 djSP; dMARK; dTARGET;
349 do_join(TARG, *MARK, MARK, SP);
360 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
361 * will be enough to hold an OP*.
363 SV* sv = sv_newmortal();
364 sv_upgrade(sv, SVt_PVLV);
366 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
374 /* Oversized hot code. */
378 djSP; dMARK; dORIGMARK;
385 if (PL_op->op_flags & OPf_STACKED)
389 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
391 if (MARK == ORIGMARK) {
392 /* If using default handle then we need to make space to
393 * pass object as 1st arg, so move other args up ...
397 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
401 *MARK = SvTIED_obj((SV*)gv, mg);
404 call_method("PRINT", G_SCALAR);
412 if (!(io = GvIO(gv))) {
414 if ((GvEGV(gv)) && (mg = SvTIED_mg((SV*)GvEGV(gv),'q')))
416 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
417 report_evil_fh(gv, io, PL_op->op_type);
418 SETERRNO(EBADF,RMS$_IFI);
421 else if (!(fp = IoOFP(io))) {
422 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
424 /* integrate with report_evil_fh()? */
427 SV* sv = sv_newmortal();
428 gv_efullname4(sv, gv, Nullch, FALSE);
429 name = SvPV_nolen(sv);
432 Perl_warner(aTHX_ WARN_IO,
433 "Filehandle %s opened only for input", name);
435 Perl_warner(aTHX_ WARN_IO,
436 "Filehandle opened only for input");
438 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
439 report_evil_fh(gv, io, PL_op->op_type);
441 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
448 if (!do_print(*MARK, fp))
452 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
461 if (!do_print(*MARK, fp))
470 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
473 if (IoFLAGS(io) & IOf_FLUSH)
474 if (PerlIO_flush(fp) == EOF)
495 tryAMAGICunDEREF(to_av);
498 if (SvTYPE(av) != SVt_PVAV)
499 DIE(aTHX_ "Not an ARRAY reference");
500 if (PL_op->op_flags & OPf_REF) {
506 if (SvTYPE(sv) == SVt_PVAV) {
508 if (PL_op->op_flags & OPf_REF) {
516 if (SvTYPE(sv) != SVt_PVGV) {
520 if (SvGMAGICAL(sv)) {
526 if (PL_op->op_flags & OPf_REF ||
527 PL_op->op_private & HINT_STRICT_REFS)
528 DIE(aTHX_ PL_no_usym, "an ARRAY");
529 if (ckWARN(WARN_UNINITIALIZED))
531 if (GIMME == G_ARRAY) {
538 if ((PL_op->op_flags & OPf_SPECIAL) &&
539 !(PL_op->op_flags & OPf_MOD))
541 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
543 && (!is_gv_magical(sym,len,0)
544 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
550 if (PL_op->op_private & HINT_STRICT_REFS)
551 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
552 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
559 if (PL_op->op_private & OPpLVAL_INTRO)
561 if (PL_op->op_flags & OPf_REF) {
568 if (GIMME == G_ARRAY) {
569 I32 maxarg = AvFILL(av) + 1;
570 (void)POPs; /* XXXX May be optimized away? */
572 if (SvRMAGICAL(av)) {
574 for (i=0; i < maxarg; i++) {
575 SV **svp = av_fetch(av, i, FALSE);
576 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
580 Copy(AvARRAY(av), SP+1, maxarg, SV*);
586 I32 maxarg = AvFILL(av) + 1;
599 tryAMAGICunDEREF(to_hv);
602 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
603 DIE(aTHX_ "Not a HASH reference");
604 if (PL_op->op_flags & OPf_REF) {
610 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
612 if (PL_op->op_flags & OPf_REF) {
620 if (SvTYPE(sv) != SVt_PVGV) {
624 if (SvGMAGICAL(sv)) {
630 if (PL_op->op_flags & OPf_REF ||
631 PL_op->op_private & HINT_STRICT_REFS)
632 DIE(aTHX_ PL_no_usym, "a HASH");
633 if (ckWARN(WARN_UNINITIALIZED))
635 if (GIMME == G_ARRAY) {
642 if ((PL_op->op_flags & OPf_SPECIAL) &&
643 !(PL_op->op_flags & OPf_MOD))
645 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
647 && (!is_gv_magical(sym,len,0)
648 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
654 if (PL_op->op_private & HINT_STRICT_REFS)
655 DIE(aTHX_ PL_no_symref, sym, "a HASH");
656 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
663 if (PL_op->op_private & OPpLVAL_INTRO)
665 if (PL_op->op_flags & OPf_REF) {
672 if (GIMME == G_ARRAY) { /* array wanted */
673 *PL_stack_sp = (SV*)hv;
678 if (SvTYPE(hv) == SVt_PVAV)
679 hv = avhv_keys((AV*)hv);
681 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
682 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
692 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
698 leftop = ((BINOP*)PL_op)->op_last;
700 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
701 leftop = ((LISTOP*)leftop)->op_first;
703 /* Skip PUSHMARK and each element already assigned to. */
704 for (i = lelem - firstlelem; i > 0; i--) {
705 leftop = leftop->op_sibling;
708 if (leftop->op_type != OP_RV2HV)
713 av_fill(ary, 0); /* clear all but the fields hash */
714 if (lastrelem >= relem) {
715 while (relem < lastrelem) { /* gobble up all the rest */
719 /* Avoid a memory leak when avhv_store_ent dies. */
720 tmpstr = sv_newmortal();
721 sv_setsv(tmpstr,relem[1]); /* value */
723 if (avhv_store_ent(ary,relem[0],tmpstr,0))
724 (void)SvREFCNT_inc(tmpstr);
725 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
731 if (relem == lastrelem)
737 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
741 if (ckWARN(WARN_MISC)) {
742 if (relem == firstrelem &&
744 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
745 SvTYPE(SvRV(*relem)) == SVt_PVHV))
747 Perl_warner(aTHX_ WARN_MISC,
748 "Reference found where even-sized list expected");
751 Perl_warner(aTHX_ WARN_MISC,
752 "Odd number of elements in hash assignment");
754 if (SvTYPE(hash) == SVt_PVAV) {
756 tmpstr = sv_newmortal();
757 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
758 (void)SvREFCNT_inc(tmpstr);
759 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
764 tmpstr = NEWSV(29,0);
765 didstore = hv_store_ent(hash,*relem,tmpstr,0);
766 if (SvMAGICAL(hash)) {
767 if (SvSMAGICAL(tmpstr))
780 SV **lastlelem = PL_stack_sp;
781 SV **lastrelem = PL_stack_base + POPMARK;
782 SV **firstrelem = PL_stack_base + POPMARK + 1;
783 SV **firstlelem = lastrelem + 1;
796 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
798 /* If there's a common identifier on both sides we have to take
799 * special care that assigning the identifier on the left doesn't
800 * clobber a value on the right that's used later in the list.
802 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
803 EXTEND_MORTAL(lastrelem - firstrelem + 1);
804 for (relem = firstrelem; relem <= lastrelem; relem++) {
807 TAINT_NOT; /* Each item is independent */
808 *relem = sv_mortalcopy(sv);
818 while (lelem <= lastlelem) {
819 TAINT_NOT; /* Each item stands on its own, taintwise. */
821 switch (SvTYPE(sv)) {
824 magic = SvMAGICAL(ary) != 0;
825 if (PL_op->op_private & OPpASSIGN_HASH) {
826 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
832 do_oddball((HV*)ary, relem, firstrelem);
834 relem = lastrelem + 1;
839 av_extend(ary, lastrelem - relem);
841 while (relem <= lastrelem) { /* gobble up all the rest */
847 didstore = av_store(ary,i++,sv);
857 case SVt_PVHV: { /* normal hash */
861 magic = SvMAGICAL(hash) != 0;
864 while (relem < lastrelem) { /* gobble up all the rest */
869 sv = &PL_sv_no, relem++;
870 tmpstr = NEWSV(29,0);
872 sv_setsv(tmpstr,*relem); /* value */
874 didstore = hv_store_ent(hash,sv,tmpstr,0);
876 if (SvSMAGICAL(tmpstr))
883 if (relem == lastrelem) {
884 do_oddball(hash, relem, firstrelem);
890 if (SvIMMORTAL(sv)) {
891 if (relem <= lastrelem)
895 if (relem <= lastrelem) {
896 sv_setsv(sv, *relem);
900 sv_setsv(sv, &PL_sv_undef);
905 if (PL_delaymagic & ~DM_DELAY) {
906 if (PL_delaymagic & DM_UID) {
908 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
911 (void)setreuid(PL_uid,PL_euid);
914 if ((PL_delaymagic & DM_UID) == DM_RUID) {
915 (void)setruid(PL_uid);
916 PL_delaymagic &= ~DM_RUID;
918 # endif /* HAS_SETRUID */
920 if ((PL_delaymagic & DM_UID) == DM_EUID) {
921 (void)seteuid(PL_uid);
922 PL_delaymagic &= ~DM_EUID;
924 # endif /* HAS_SETEUID */
925 if (PL_delaymagic & DM_UID) {
926 if (PL_uid != PL_euid)
927 DIE(aTHX_ "No setreuid available");
928 (void)PerlProc_setuid(PL_uid);
930 # endif /* HAS_SETREUID */
931 #endif /* HAS_SETRESUID */
932 PL_uid = PerlProc_getuid();
933 PL_euid = PerlProc_geteuid();
935 if (PL_delaymagic & DM_GID) {
937 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
940 (void)setregid(PL_gid,PL_egid);
943 if ((PL_delaymagic & DM_GID) == DM_RGID) {
944 (void)setrgid(PL_gid);
945 PL_delaymagic &= ~DM_RGID;
947 # endif /* HAS_SETRGID */
949 if ((PL_delaymagic & DM_GID) == DM_EGID) {
950 (void)setegid(PL_gid);
951 PL_delaymagic &= ~DM_EGID;
953 # endif /* HAS_SETEGID */
954 if (PL_delaymagic & DM_GID) {
955 if (PL_gid != PL_egid)
956 DIE(aTHX_ "No setregid available");
957 (void)PerlProc_setgid(PL_gid);
959 # endif /* HAS_SETREGID */
960 #endif /* HAS_SETRESGID */
961 PL_gid = PerlProc_getgid();
962 PL_egid = PerlProc_getegid();
964 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
971 else if (gimme == G_SCALAR) {
974 SETi(lastrelem - firstrelem + 1);
980 SP = firstrelem + (lastlelem - firstlelem);
981 lelem = firstlelem + (relem - firstrelem);
983 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
991 register PMOP *pm = cPMOP;
992 SV *rv = sv_newmortal();
993 SV *sv = newSVrv(rv, "Regexp");
994 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
1001 register PMOP *pm = cPMOP;
1006 I32 r_flags = REXEC_CHECKED;
1007 char *truebase; /* Start of string */
1008 register REGEXP *rx = pm->op_pmregexp;
1013 I32 oldsave = PL_savestack_ix;
1014 I32 update_minmatch = 1;
1015 I32 had_zerolen = 0;
1017 if (PL_op->op_flags & OPf_STACKED)
1023 PUTBACK; /* EVAL blocks need stack_sp. */
1024 s = SvPV(TARG, len);
1027 DIE(aTHX_ "panic: do_match");
1028 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1029 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1032 if (pm->op_pmdynflags & PMdf_USED) {
1034 if (gimme == G_ARRAY)
1039 if (!rx->prelen && PL_curpm) {
1041 rx = pm->op_pmregexp;
1043 if (rx->minlen > len) goto failure;
1047 /* XXXX What part of this is needed with true \G-support? */
1048 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1050 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1051 MAGIC* mg = mg_find(TARG, 'g');
1052 if (mg && mg->mg_len >= 0) {
1053 if (!(rx->reganch & ROPT_GPOS_SEEN))
1054 rx->endp[0] = rx->startp[0] = mg->mg_len;
1055 else if (rx->reganch & ROPT_ANCH_GPOS) {
1056 r_flags |= REXEC_IGNOREPOS;
1057 rx->endp[0] = rx->startp[0] = mg->mg_len;
1059 minmatch = (mg->mg_flags & MGf_MINMATCH);
1060 update_minmatch = 0;
1064 if ((gimme != G_ARRAY && !global && rx->nparens)
1065 || SvTEMP(TARG) || PL_sawampersand)
1066 r_flags |= REXEC_COPY_STR;
1068 r_flags |= REXEC_SCREAM;
1070 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1071 SAVEINT(PL_multiline);
1072 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1076 if (global && rx->startp[0] != -1) {
1077 t = s = rx->endp[0] + truebase;
1078 if ((s + rx->minlen) > strend)
1080 if (update_minmatch++)
1081 minmatch = had_zerolen;
1083 if (rx->reganch & RE_USE_INTUIT) {
1084 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1088 if ( (rx->reganch & ROPT_CHECK_ALL)
1090 && ((rx->reganch & ROPT_NOSCAN)
1091 || !((rx->reganch & RE_INTUIT_TAIL)
1092 && (r_flags & REXEC_SCREAM)))
1093 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1096 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1099 if (pm->op_pmflags & PMf_ONCE)
1100 pm->op_pmdynflags |= PMdf_USED;
1109 RX_MATCH_TAINTED_on(rx);
1110 TAINT_IF(RX_MATCH_TAINTED(rx));
1111 if (gimme == G_ARRAY) {
1114 iters = rx->nparens;
1115 if (global && !iters)
1119 SPAGAIN; /* EVAL blocks could move the stack. */
1120 EXTEND(SP, iters + i);
1121 EXTEND_MORTAL(iters + i);
1122 for (i = !i; i <= iters; i++) {
1123 PUSHs(sv_newmortal());
1125 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1126 len = rx->endp[i] - rx->startp[i];
1127 s = rx->startp[i] + truebase;
1128 sv_setpvn(*SP, s, len);
1129 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1131 sv_utf8_downgrade(*SP, TRUE);
1136 had_zerolen = (rx->startp[0] != -1
1137 && rx->startp[0] == rx->endp[0]);
1138 PUTBACK; /* EVAL blocks may use stack */
1139 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1144 LEAVE_SCOPE(oldsave);
1150 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1151 mg = mg_find(TARG, 'g');
1153 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1154 mg = mg_find(TARG, 'g');
1156 if (rx->startp[0] != -1) {
1157 mg->mg_len = rx->endp[0];
1158 if (rx->startp[0] == rx->endp[0])
1159 mg->mg_flags |= MGf_MINMATCH;
1161 mg->mg_flags &= ~MGf_MINMATCH;
1164 LEAVE_SCOPE(oldsave);
1168 yup: /* Confirmed by INTUIT */
1170 RX_MATCH_TAINTED_on(rx);
1171 TAINT_IF(RX_MATCH_TAINTED(rx));
1173 if (pm->op_pmflags & PMf_ONCE)
1174 pm->op_pmdynflags |= PMdf_USED;
1175 if (RX_MATCH_COPIED(rx))
1176 Safefree(rx->subbeg);
1177 RX_MATCH_COPIED_off(rx);
1178 rx->subbeg = Nullch;
1180 rx->subbeg = truebase;
1181 rx->startp[0] = s - truebase;
1182 rx->endp[0] = s - truebase + rx->minlen;
1183 rx->sublen = strend - truebase;
1186 if (PL_sawampersand) {
1189 rx->subbeg = savepvn(t, strend - t);
1190 rx->sublen = strend - t;
1191 RX_MATCH_COPIED_on(rx);
1192 off = rx->startp[0] = s - t;
1193 rx->endp[0] = off + rx->minlen;
1195 else { /* startp/endp are used by @- @+. */
1196 rx->startp[0] = s - truebase;
1197 rx->endp[0] = s - truebase + rx->minlen;
1199 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1200 LEAVE_SCOPE(oldsave);
1205 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1206 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1207 MAGIC* mg = mg_find(TARG, 'g');
1212 LEAVE_SCOPE(oldsave);
1213 if (gimme == G_ARRAY)
1219 Perl_do_readline(pTHX)
1221 dSP; dTARGETSTACKED;
1226 register IO *io = GvIO(PL_last_in_gv);
1227 register I32 type = PL_op->op_type;
1228 I32 gimme = GIMME_V;
1231 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1233 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1236 call_method("READLINE", gimme);
1239 if (gimme == G_SCALAR)
1240 SvSetMagicSV_nosteal(TARG, TOPs);
1247 if (IoFLAGS(io) & IOf_ARGV) {
1248 if (IoFLAGS(io) & IOf_START) {
1250 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1251 IoFLAGS(io) &= ~IOf_START;
1252 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1253 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1254 SvSETMAGIC(GvSV(PL_last_in_gv));
1259 fp = nextargv(PL_last_in_gv);
1260 if (!fp) { /* Note: fp != IoIFP(io) */
1261 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1264 else if (type == OP_GLOB) {
1265 SV *tmpcmd = NEWSV(55, 0);
1269 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1270 /* since spawning off a process is a real performance hit */
1272 #include <descrip.h>
1273 #include <lib$routines.h>
1276 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1277 char vmsspec[NAM$C_MAXRSS+1];
1278 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1279 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1280 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1283 struct dsc$descriptor_s wilddsc
1284 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1285 struct dsc$descriptor_vs rsdsc
1286 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1287 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1289 /* We could find out if there's an explicit dev/dir or version
1290 by peeking into lib$find_file's internal context at
1291 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1292 but that's unsupported, so I don't want to do it now and
1293 have it bite someone in the future. */
1294 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1295 cp = SvPV(tmpglob,i);
1297 if (cp[i] == ';') hasver = 1;
1299 if (sts) hasver = 1;
1303 hasdir = isunix = 1;
1306 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1311 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1313 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1314 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1315 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1316 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1317 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1318 &dfltdsc,NULL,NULL,NULL))&1)) {
1319 end = rstr + (unsigned long int) *rslt;
1320 if (!hasver) while (*end != ';') end--;
1321 *(end++) = '\n'; *end = '\0';
1322 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1324 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1329 while (*(--begin) != ']' && *begin != '>') ;
1332 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1334 if (cxt) (void)lib$find_file_end(&cxt);
1335 if (ok && sts != RMS$_NMF &&
1336 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1339 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1341 PerlIO_close(tmpfp);
1345 PerlIO_rewind(tmpfp);
1346 IoTYPE(io) = IoTYPE_RDONLY;
1347 IoIFP(io) = fp = tmpfp;
1348 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1353 #ifdef MACOS_TRADITIONAL
1354 sv_setpv(tmpcmd, "glob ");
1355 sv_catsv(tmpcmd, tmpglob);
1356 sv_catpv(tmpcmd, " |");
1360 sv_setpv(tmpcmd, "for a in ");
1361 sv_catsv(tmpcmd, tmpglob);
1362 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1365 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1366 sv_catsv(tmpcmd, tmpglob);
1368 sv_setpv(tmpcmd, "perlglob ");
1369 sv_catsv(tmpcmd, tmpglob);
1370 sv_catpv(tmpcmd, " |");
1375 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1376 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1377 sv_catsv(tmpcmd, tmpglob);
1378 sv_catpv(tmpcmd, "' 2>/dev/null |");
1380 sv_setpv(tmpcmd, "echo ");
1381 sv_catsv(tmpcmd, tmpglob);
1383 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1385 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1388 #endif /* !DOSISH */
1389 #endif /* MACOS_TRADITIONAL */
1390 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1391 FALSE, O_RDONLY, 0, Nullfp);
1397 else if (type == OP_GLOB)
1399 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1400 && (IoTYPE(io) == IoTYPE_WRONLY || fp == PerlIO_stdout()
1401 || fp == PerlIO_stderr()))
1403 /* integrate with report_evil_fh()? */
1405 if (isGV(PL_last_in_gv)) { /* can this ever fail? */
1406 SV* sv = sv_newmortal();
1407 gv_efullname4(sv, PL_last_in_gv, Nullch, FALSE);
1408 name = SvPV_nolen(sv);
1411 Perl_warner(aTHX_ WARN_IO,
1412 "Filehandle %s opened only for output", name);
1414 Perl_warner(aTHX_ WARN_IO,
1415 "Filehandle opened only for output");
1419 if (ckWARN2(WARN_GLOB, WARN_CLOSED)
1420 && (!io || !(IoFLAGS(io) & IOf_START))) {
1421 if (type == OP_GLOB)
1422 Perl_warner(aTHX_ WARN_GLOB,
1423 "glob failed (can't start child: %s)",
1426 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1428 if (gimme == G_SCALAR) {
1429 (void)SvOK_off(TARG);
1435 if (gimme == G_SCALAR) {
1439 (void)SvUPGRADE(sv, SVt_PV);
1440 tmplen = SvLEN(sv); /* remember if already alloced */
1442 Sv_Grow(sv, 80); /* try short-buffering it */
1443 if (type == OP_RCATLINE)
1449 sv = sv_2mortal(NEWSV(57, 80));
1453 /* This should not be marked tainted if the fp is marked clean */
1454 #define MAYBE_TAINT_LINE(io, sv) \
1455 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1460 /* delay EOF state for a snarfed empty file */
1461 #define SNARF_EOF(gimme,rs,io,sv) \
1462 (gimme != G_SCALAR || SvCUR(sv) \
1463 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1466 if (!sv_gets(sv, fp, offset)
1467 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1469 PerlIO_clearerr(fp);
1470 if (IoFLAGS(io) & IOf_ARGV) {
1471 fp = nextargv(PL_last_in_gv);
1474 (void)do_close(PL_last_in_gv, FALSE);
1476 else if (type == OP_GLOB) {
1477 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1478 Perl_warner(aTHX_ WARN_GLOB,
1479 "glob failed (child exited with status %d%s)",
1480 (int)(STATUS_CURRENT >> 8),
1481 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1484 if (gimme == G_SCALAR) {
1485 (void)SvOK_off(TARG);
1488 MAYBE_TAINT_LINE(io, sv);
1491 MAYBE_TAINT_LINE(io, sv);
1493 IoFLAGS(io) |= IOf_NOLINE;
1496 if (type == OP_GLOB) {
1499 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1500 tmps = SvEND(sv) - 1;
1501 if (*tmps == *SvPVX(PL_rs)) {
1506 for (tmps = SvPVX(sv); *tmps; tmps++)
1507 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1508 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1510 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1511 (void)POPs; /* Unmatched wildcard? Chuck it... */
1515 if (gimme == G_ARRAY) {
1516 if (SvLEN(sv) - SvCUR(sv) > 20) {
1517 SvLEN_set(sv, SvCUR(sv)+1);
1518 Renew(SvPVX(sv), SvLEN(sv), char);
1520 sv = sv_2mortal(NEWSV(58, 80));
1523 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1524 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1528 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1529 Renew(SvPVX(sv), SvLEN(sv), char);
1538 register PERL_CONTEXT *cx;
1539 I32 gimme = OP_GIMME(PL_op, -1);
1542 if (cxstack_ix >= 0)
1543 gimme = cxstack[cxstack_ix].blk_gimme;
1551 PUSHBLOCK(cx, CXt_BLOCK, SP);
1563 U32 lval = PL_op->op_flags & OPf_MOD;
1564 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1566 U32 hash = (SvFAKE(keysv) && SvREADONLY(keysv)) ? SvUVX(keysv) : 0;
1568 if (SvTYPE(hv) == SVt_PVHV) {
1569 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1570 svp = he ? &HeVAL(he) : 0;
1572 else if (SvTYPE(hv) == SVt_PVAV) {
1573 if (PL_op->op_private & OPpLVAL_INTRO)
1574 DIE(aTHX_ "Can't localize pseudo-hash element");
1575 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, hash);
1581 if (!svp || *svp == &PL_sv_undef) {
1586 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1588 lv = sv_newmortal();
1589 sv_upgrade(lv, SVt_PVLV);
1591 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1592 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1593 LvTARG(lv) = SvREFCNT_inc(hv);
1598 if (PL_op->op_private & OPpLVAL_INTRO) {
1599 if (HvNAME(hv) && isGV(*svp))
1600 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1602 save_helem(hv, keysv, svp);
1604 else if (PL_op->op_private & OPpDEREF)
1605 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1607 sv = (svp ? *svp : &PL_sv_undef);
1608 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1609 * Pushing the magical RHS on to the stack is useless, since
1610 * that magic is soon destined to be misled by the local(),
1611 * and thus the later pp_sassign() will fail to mg_get() the
1612 * old value. This should also cure problems with delayed
1613 * mg_get()s. GSAR 98-07-03 */
1614 if (!lval && SvGMAGICAL(sv))
1615 sv = sv_mortalcopy(sv);
1623 register PERL_CONTEXT *cx;
1629 if (PL_op->op_flags & OPf_SPECIAL) {
1630 cx = &cxstack[cxstack_ix];
1631 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1636 gimme = OP_GIMME(PL_op, -1);
1638 if (cxstack_ix >= 0)
1639 gimme = cxstack[cxstack_ix].blk_gimme;
1645 if (gimme == G_VOID)
1647 else if (gimme == G_SCALAR) {
1650 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1653 *MARK = sv_mortalcopy(TOPs);
1656 *MARK = &PL_sv_undef;
1660 else if (gimme == G_ARRAY) {
1661 /* in case LEAVE wipes old return values */
1662 for (mark = newsp + 1; mark <= SP; mark++) {
1663 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1664 *mark = sv_mortalcopy(*mark);
1665 TAINT_NOT; /* Each item is independent */
1669 PL_curpm = newpm; /* Don't pop $1 et al till now */
1679 register PERL_CONTEXT *cx;
1685 cx = &cxstack[cxstack_ix];
1686 if (CxTYPE(cx) != CXt_LOOP)
1687 DIE(aTHX_ "panic: pp_iter");
1689 itersvp = CxITERVAR(cx);
1690 av = cx->blk_loop.iterary;
1691 if (SvTYPE(av) != SVt_PVAV) {
1692 /* iterate ($min .. $max) */
1693 if (cx->blk_loop.iterlval) {
1694 /* string increment */
1695 register SV* cur = cx->blk_loop.iterlval;
1697 char *max = SvPV((SV*)av, maxlen);
1698 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1699 #ifndef USE_THREADS /* don't risk potential race */
1700 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1701 /* safe to reuse old SV */
1702 sv_setsv(*itersvp, cur);
1707 /* we need a fresh SV every time so that loop body sees a
1708 * completely new SV for closures/references to work as
1710 SvREFCNT_dec(*itersvp);
1711 *itersvp = newSVsv(cur);
1713 if (strEQ(SvPVX(cur), max))
1714 sv_setiv(cur, 0); /* terminate next time */
1721 /* integer increment */
1722 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1725 #ifndef USE_THREADS /* don't risk potential race */
1726 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1727 /* safe to reuse old SV */
1728 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1733 /* we need a fresh SV every time so that loop body sees a
1734 * completely new SV for closures/references to work as they
1736 SvREFCNT_dec(*itersvp);
1737 *itersvp = newSViv(cx->blk_loop.iterix++);
1743 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1746 SvREFCNT_dec(*itersvp);
1748 if ((sv = SvMAGICAL(av)
1749 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1750 : AvARRAY(av)[++cx->blk_loop.iterix]))
1754 if (av != PL_curstack && SvIMMORTAL(sv)) {
1755 SV *lv = cx->blk_loop.iterlval;
1756 if (lv && SvREFCNT(lv) > 1) {
1761 SvREFCNT_dec(LvTARG(lv));
1763 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1764 sv_upgrade(lv, SVt_PVLV);
1766 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1768 LvTARG(lv) = SvREFCNT_inc(av);
1769 LvTARGOFF(lv) = cx->blk_loop.iterix;
1770 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1774 *itersvp = SvREFCNT_inc(sv);
1781 register PMOP *pm = cPMOP;
1797 register REGEXP *rx = pm->op_pmregexp;
1799 int force_on_match = 0;
1800 I32 oldsave = PL_savestack_ix;
1802 /* known replacement string? */
1803 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1804 if (PL_op->op_flags & OPf_STACKED)
1810 if (SvFAKE(TARG) && SvREADONLY(TARG))
1811 sv_force_normal(TARG);
1812 if (SvREADONLY(TARG)
1813 || (SvTYPE(TARG) > SVt_PVLV
1814 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1815 DIE(aTHX_ PL_no_modify);
1818 s = SvPV(TARG, len);
1819 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1821 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1822 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1829 DIE(aTHX_ "panic: do_subst");
1832 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1833 position, once with zero-length,
1834 second time with non-zero. */
1836 if (!rx->prelen && PL_curpm) {
1838 rx = pm->op_pmregexp;
1840 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1841 ? REXEC_COPY_STR : 0;
1843 r_flags |= REXEC_SCREAM;
1844 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1845 SAVEINT(PL_multiline);
1846 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1849 if (rx->reganch & RE_USE_INTUIT) {
1850 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1854 /* How to do it in subst? */
1855 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1857 && ((rx->reganch & ROPT_NOSCAN)
1858 || !((rx->reganch & RE_INTUIT_TAIL)
1859 && (r_flags & REXEC_SCREAM))))
1864 /* only replace once? */
1865 once = !(rpm->op_pmflags & PMf_GLOBAL);
1867 /* known replacement string? */
1868 c = dstr ? SvPV(dstr, clen) : Nullch;
1870 /* can do inplace substitution? */
1871 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1872 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1873 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1874 r_flags | REXEC_CHECKED))
1878 LEAVE_SCOPE(oldsave);
1881 if (force_on_match) {
1883 s = SvPV_force(TARG, len);
1888 SvSCREAM_off(TARG); /* disable possible screamer */
1890 rxtainted |= RX_MATCH_TAINTED(rx);
1891 m = orig + rx->startp[0];
1892 d = orig + rx->endp[0];
1894 if (m - s > strend - d) { /* faster to shorten from end */
1896 Copy(c, m, clen, char);
1901 Move(d, m, i, char);
1905 SvCUR_set(TARG, m - s);
1908 else if ((i = m - s)) { /* faster from front */
1916 Copy(c, m, clen, char);
1921 Copy(c, d, clen, char);
1926 TAINT_IF(rxtainted & 1);
1932 if (iters++ > maxiters)
1933 DIE(aTHX_ "Substitution loop");
1934 rxtainted |= RX_MATCH_TAINTED(rx);
1935 m = rx->startp[0] + orig;
1939 Move(s, d, i, char);
1943 Copy(c, d, clen, char);
1946 s = rx->endp[0] + orig;
1947 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1949 /* don't match same null twice */
1950 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1953 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1954 Move(s, d, i+1, char); /* include the NUL */
1956 TAINT_IF(rxtainted & 1);
1958 PUSHs(sv_2mortal(newSViv((I32)iters)));
1960 (void)SvPOK_only_UTF8(TARG);
1961 TAINT_IF(rxtainted);
1962 if (SvSMAGICAL(TARG)) {
1968 LEAVE_SCOPE(oldsave);
1972 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1973 r_flags | REXEC_CHECKED))
1975 if (force_on_match) {
1977 s = SvPV_force(TARG, len);
1980 rxtainted |= RX_MATCH_TAINTED(rx);
1981 dstr = NEWSV(25, len);
1982 sv_setpvn(dstr, m, s-m);
1985 register PERL_CONTEXT *cx;
1988 RETURNOP(cPMOP->op_pmreplroot);
1990 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1992 if (iters++ > maxiters)
1993 DIE(aTHX_ "Substitution loop");
1994 rxtainted |= RX_MATCH_TAINTED(rx);
1995 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
2000 strend = s + (strend - m);
2002 m = rx->startp[0] + orig;
2003 sv_catpvn(dstr, s, m-s);
2004 s = rx->endp[0] + orig;
2006 sv_catpvn(dstr, c, clen);
2009 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
2010 sv_catpvn(dstr, s, strend - s);
2012 (void)SvOOK_off(TARG);
2013 Safefree(SvPVX(TARG));
2014 SvPVX(TARG) = SvPVX(dstr);
2015 SvCUR_set(TARG, SvCUR(dstr));
2016 SvLEN_set(TARG, SvLEN(dstr));
2020 TAINT_IF(rxtainted & 1);
2022 PUSHs(sv_2mortal(newSViv((I32)iters)));
2024 (void)SvPOK_only(TARG);
2025 TAINT_IF(rxtainted);
2028 LEAVE_SCOPE(oldsave);
2037 LEAVE_SCOPE(oldsave);
2046 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2047 ++*PL_markstack_ptr;
2048 LEAVE; /* exit inner scope */
2051 if (PL_stack_base + *PL_markstack_ptr > SP) {
2053 I32 gimme = GIMME_V;
2055 LEAVE; /* exit outer scope */
2056 (void)POPMARK; /* pop src */
2057 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2058 (void)POPMARK; /* pop dst */
2059 SP = PL_stack_base + POPMARK; /* pop original mark */
2060 if (gimme == G_SCALAR) {
2064 else if (gimme == G_ARRAY)
2071 ENTER; /* enter inner scope */
2074 src = PL_stack_base[*PL_markstack_ptr];
2078 RETURNOP(cLOGOP->op_other);
2089 register PERL_CONTEXT *cx;
2095 if (gimme == G_SCALAR) {
2098 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2100 *MARK = SvREFCNT_inc(TOPs);
2105 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2107 *MARK = sv_mortalcopy(sv);
2112 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2116 *MARK = &PL_sv_undef;
2120 else if (gimme == G_ARRAY) {
2121 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2122 if (!SvTEMP(*MARK)) {
2123 *MARK = sv_mortalcopy(*MARK);
2124 TAINT_NOT; /* Each item is independent */
2130 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2131 PL_curpm = newpm; /* ... and pop $1 et al */
2135 return pop_return();
2138 /* This duplicates the above code because the above code must not
2139 * get any slower by more conditions */
2147 register PERL_CONTEXT *cx;
2154 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2155 /* We are an argument to a function or grep().
2156 * This kind of lvalueness was legal before lvalue
2157 * subroutines too, so be backward compatible:
2158 * cannot report errors. */
2160 /* Scalar context *is* possible, on the LHS of -> only,
2161 * as in f()->meth(). But this is not an lvalue. */
2162 if (gimme == G_SCALAR)
2164 if (gimme == G_ARRAY) {
2165 if (!CvLVALUE(cx->blk_sub.cv))
2166 goto temporise_array;
2167 EXTEND_MORTAL(SP - newsp);
2168 for (mark = newsp + 1; mark <= SP; mark++) {
2171 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2172 *mark = sv_mortalcopy(*mark);
2174 /* Can be a localized value subject to deletion. */
2175 PL_tmps_stack[++PL_tmps_ix] = *mark;
2176 (void)SvREFCNT_inc(*mark);
2181 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2182 /* Here we go for robustness, not for speed, so we change all
2183 * the refcounts so the caller gets a live guy. Cannot set
2184 * TEMP, so sv_2mortal is out of question. */
2185 if (!CvLVALUE(cx->blk_sub.cv)) {
2190 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2192 if (gimme == G_SCALAR) {
2196 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2201 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2202 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2204 else { /* Can be a localized value
2205 * subject to deletion. */
2206 PL_tmps_stack[++PL_tmps_ix] = *mark;
2207 (void)SvREFCNT_inc(*mark);
2210 else { /* Should not happen? */
2215 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2216 (MARK > SP ? "Empty array" : "Array"));
2220 else if (gimme == G_ARRAY) {
2221 EXTEND_MORTAL(SP - newsp);
2222 for (mark = newsp + 1; mark <= SP; mark++) {
2223 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2224 /* Might be flattened array after $#array = */
2230 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2231 (*mark != &PL_sv_undef)
2233 ? "a readonly value" : "a temporary")
2234 : "an uninitialized value");
2237 /* Can be a localized value subject to deletion. */
2238 PL_tmps_stack[++PL_tmps_ix] = *mark;
2239 (void)SvREFCNT_inc(*mark);
2245 if (gimme == G_SCALAR) {
2249 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2251 *MARK = SvREFCNT_inc(TOPs);
2256 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2258 *MARK = sv_mortalcopy(sv);
2263 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2267 *MARK = &PL_sv_undef;
2271 else if (gimme == G_ARRAY) {
2273 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2274 if (!SvTEMP(*MARK)) {
2275 *MARK = sv_mortalcopy(*MARK);
2276 TAINT_NOT; /* Each item is independent */
2283 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2284 PL_curpm = newpm; /* ... and pop $1 et al */
2288 return pop_return();
2293 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2296 SV *dbsv = GvSV(PL_DBsub);
2298 if (!PERLDB_SUB_NN) {
2302 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2303 || strEQ(GvNAME(gv), "END")
2304 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2305 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2306 && (gv = (GV*)*svp) ))) {
2307 /* Use GV from the stack as a fallback. */
2308 /* GV is potentially non-unique, or contain different CV. */
2309 SV *tmp = newRV((SV*)cv);
2310 sv_setsv(dbsv, tmp);
2314 gv_efullname3(dbsv, gv, Nullch);
2318 (void)SvUPGRADE(dbsv, SVt_PVIV);
2319 (void)SvIOK_on(dbsv);
2320 SAVEIV(SvIVX(dbsv));
2321 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2325 PL_curcopdb = PL_curcop;
2326 cv = GvCV(PL_DBsub);
2336 register PERL_CONTEXT *cx;
2338 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2341 DIE(aTHX_ "Not a CODE reference");
2342 switch (SvTYPE(sv)) {
2348 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2350 SP = PL_stack_base + POPMARK;
2353 if (SvGMAGICAL(sv)) {
2355 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2358 sym = SvPV(sv, n_a);
2360 DIE(aTHX_ PL_no_usym, "a subroutine");
2361 if (PL_op->op_private & HINT_STRICT_REFS)
2362 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2363 cv = get_cv(sym, TRUE);
2367 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2368 tryAMAGICunDEREF(to_cv);
2371 if (SvTYPE(cv) == SVt_PVCV)
2376 DIE(aTHX_ "Not a CODE reference");
2381 if (!(cv = GvCVu((GV*)sv)))
2382 cv = sv_2cv(sv, &stash, &gv, FALSE);
2395 if (!CvROOT(cv) && !CvXSUB(cv)) {
2399 /* anonymous or undef'd function leaves us no recourse */
2400 if (CvANON(cv) || !(gv = CvGV(cv)))
2401 DIE(aTHX_ "Undefined subroutine called");
2403 /* autoloaded stub? */
2404 if (cv != GvCV(gv)) {
2407 /* should call AUTOLOAD now? */
2410 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2417 sub_name = sv_newmortal();
2418 gv_efullname3(sub_name, gv, Nullch);
2419 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2423 DIE(aTHX_ "Not a CODE reference");
2428 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2429 cv = get_db_sub(&sv, cv);
2431 DIE(aTHX_ "No DBsub routine");
2436 * First we need to check if the sub or method requires locking.
2437 * If so, we gain a lock on the CV, the first argument or the
2438 * stash (for static methods), as appropriate. This has to be
2439 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2440 * reschedule by returning a new op.
2442 MUTEX_LOCK(CvMUTEXP(cv));
2443 if (CvFLAGS(cv) & CVf_LOCKED) {
2445 if (CvFLAGS(cv) & CVf_METHOD) {
2446 if (SP > PL_stack_base + TOPMARK)
2447 sv = *(PL_stack_base + TOPMARK + 1);
2449 AV *av = (AV*)PL_curpad[0];
2450 if (hasargs || !av || AvFILLp(av) < 0
2451 || !(sv = AvARRAY(av)[0]))
2453 MUTEX_UNLOCK(CvMUTEXP(cv));
2454 DIE(aTHX_ "no argument for locked method call");
2461 char *stashname = SvPV(sv, len);
2462 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2468 MUTEX_UNLOCK(CvMUTEXP(cv));
2469 mg = condpair_magic(sv);
2470 MUTEX_LOCK(MgMUTEXP(mg));
2471 if (MgOWNER(mg) == thr)
2472 MUTEX_UNLOCK(MgMUTEXP(mg));
2475 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2477 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2479 MUTEX_UNLOCK(MgMUTEXP(mg));
2480 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2482 MUTEX_LOCK(CvMUTEXP(cv));
2485 * Now we have permission to enter the sub, we must distinguish
2486 * four cases. (0) It's an XSUB (in which case we don't care
2487 * about ownership); (1) it's ours already (and we're recursing);
2488 * (2) it's free (but we may already be using a cached clone);
2489 * (3) another thread owns it. Case (1) is easy: we just use it.
2490 * Case (2) means we look for a clone--if we have one, use it
2491 * otherwise grab ownership of cv. Case (3) means we look for a
2492 * clone (for non-XSUBs) and have to create one if we don't
2494 * Why look for a clone in case (2) when we could just grab
2495 * ownership of cv straight away? Well, we could be recursing,
2496 * i.e. we originally tried to enter cv while another thread
2497 * owned it (hence we used a clone) but it has been freed up
2498 * and we're now recursing into it. It may or may not be "better"
2499 * to use the clone but at least CvDEPTH can be trusted.
2501 if (CvOWNER(cv) == thr || CvXSUB(cv))
2502 MUTEX_UNLOCK(CvMUTEXP(cv));
2504 /* Case (2) or (3) */
2508 * XXX Might it be better to release CvMUTEXP(cv) while we
2509 * do the hv_fetch? We might find someone has pinched it
2510 * when we look again, in which case we would be in case
2511 * (3) instead of (2) so we'd have to clone. Would the fact
2512 * that we released the mutex more quickly make up for this?
2514 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2516 /* We already have a clone to use */
2517 MUTEX_UNLOCK(CvMUTEXP(cv));
2519 DEBUG_S(PerlIO_printf(Perl_debug_log,
2520 "entersub: %p already has clone %p:%s\n",
2521 thr, cv, SvPEEK((SV*)cv)));
2524 if (CvDEPTH(cv) == 0)
2525 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2528 /* (2) => grab ownership of cv. (3) => make clone */
2532 MUTEX_UNLOCK(CvMUTEXP(cv));
2533 DEBUG_S(PerlIO_printf(Perl_debug_log,
2534 "entersub: %p grabbing %p:%s in stash %s\n",
2535 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2536 HvNAME(CvSTASH(cv)) : "(none)"));
2539 /* Make a new clone. */
2541 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2542 MUTEX_UNLOCK(CvMUTEXP(cv));
2543 DEBUG_S((PerlIO_printf(Perl_debug_log,
2544 "entersub: %p cloning %p:%s\n",
2545 thr, cv, SvPEEK((SV*)cv))));
2547 * We're creating a new clone so there's no race
2548 * between the original MUTEX_UNLOCK and the
2549 * SvREFCNT_inc since no one will be trying to undef
2550 * it out from underneath us. At least, I don't think
2553 clonecv = cv_clone(cv);
2554 SvREFCNT_dec(cv); /* finished with this */
2555 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2556 CvOWNER(clonecv) = thr;
2560 DEBUG_S(if (CvDEPTH(cv) != 0)
2561 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2563 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2566 #endif /* USE_THREADS */
2569 #ifdef PERL_XSUB_OLDSTYLE
2570 if (CvOLDSTYLE(cv)) {
2571 I32 (*fp3)(int,int,int);
2573 register I32 items = SP - MARK;
2574 /* We dont worry to copy from @_. */
2579 PL_stack_sp = mark + 1;
2580 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2581 items = (*fp3)(CvXSUBANY(cv).any_i32,
2582 MARK - PL_stack_base + 1,
2584 PL_stack_sp = PL_stack_base + items;
2587 #endif /* PERL_XSUB_OLDSTYLE */
2589 I32 markix = TOPMARK;
2594 /* Need to copy @_ to stack. Alternative may be to
2595 * switch stack to @_, and copy return values
2596 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2600 av = (AV*)PL_curpad[0];
2602 av = GvAV(PL_defgv);
2603 #endif /* USE_THREADS */
2604 items = AvFILLp(av) + 1; /* @_ is not tieable */
2607 /* Mark is at the end of the stack. */
2609 Copy(AvARRAY(av), SP + 1, items, SV*);
2614 /* We assume first XSUB in &DB::sub is the called one. */
2616 SAVEVPTR(PL_curcop);
2617 PL_curcop = PL_curcopdb;
2620 /* Do we need to open block here? XXXX */
2621 (void)(*CvXSUB(cv))(aTHXo_ cv);
2623 /* Enforce some sanity in scalar context. */
2624 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2625 if (markix > PL_stack_sp - PL_stack_base)
2626 *(PL_stack_base + markix) = &PL_sv_undef;
2628 *(PL_stack_base + markix) = *PL_stack_sp;
2629 PL_stack_sp = PL_stack_base + markix;
2637 register I32 items = SP - MARK;
2638 AV* padlist = CvPADLIST(cv);
2639 SV** svp = AvARRAY(padlist);
2640 push_return(PL_op->op_next);
2641 PUSHBLOCK(cx, CXt_SUB, MARK);
2644 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2645 * that eval'' ops within this sub know the correct lexical space.
2646 * Owing the speed considerations, we choose to search for the cv
2647 * in doeval() instead.
2649 if (CvDEPTH(cv) < 2)
2650 (void)SvREFCNT_inc(cv);
2651 else { /* save temporaries on recursion? */
2652 PERL_STACK_OVERFLOW_CHECK();
2653 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2655 AV *newpad = newAV();
2656 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2657 I32 ix = AvFILLp((AV*)svp[1]);
2658 I32 names_fill = AvFILLp((AV*)svp[0]);
2659 svp = AvARRAY(svp[0]);
2660 for ( ;ix > 0; ix--) {
2661 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2662 char *name = SvPVX(svp[ix]);
2663 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2664 || *name == '&') /* anonymous code? */
2666 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2668 else { /* our own lexical */
2670 av_store(newpad, ix, sv = (SV*)newAV());
2671 else if (*name == '%')
2672 av_store(newpad, ix, sv = (SV*)newHV());
2674 av_store(newpad, ix, sv = NEWSV(0,0));
2678 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2679 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2682 av_store(newpad, ix, sv = NEWSV(0,0));
2686 av = newAV(); /* will be @_ */
2688 av_store(newpad, 0, (SV*)av);
2689 AvFLAGS(av) = AVf_REIFY;
2690 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2691 AvFILLp(padlist) = CvDEPTH(cv);
2692 svp = AvARRAY(padlist);
2697 AV* av = (AV*)PL_curpad[0];
2699 items = AvFILLp(av) + 1;
2701 /* Mark is at the end of the stack. */
2703 Copy(AvARRAY(av), SP + 1, items, SV*);
2708 #endif /* USE_THREADS */
2709 SAVEVPTR(PL_curpad);
2710 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2713 #endif /* USE_THREADS */
2719 DEBUG_S(PerlIO_printf(Perl_debug_log,
2720 "%p entersub preparing @_\n", thr));
2722 av = (AV*)PL_curpad[0];
2724 /* @_ is normally not REAL--this should only ever
2725 * happen when DB::sub() calls things that modify @_ */
2731 cx->blk_sub.savearray = GvAV(PL_defgv);
2732 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2733 #endif /* USE_THREADS */
2734 cx->blk_sub.oldcurpad = PL_curpad;
2735 cx->blk_sub.argarray = av;
2738 if (items > AvMAX(av) + 1) {
2740 if (AvARRAY(av) != ary) {
2741 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2742 SvPVX(av) = (char*)ary;
2744 if (items > AvMAX(av) + 1) {
2745 AvMAX(av) = items - 1;
2746 Renew(ary,items,SV*);
2748 SvPVX(av) = (char*)ary;
2751 Copy(MARK,AvARRAY(av),items,SV*);
2752 AvFILLp(av) = items - 1;
2760 /* warning must come *after* we fully set up the context
2761 * stuff so that __WARN__ handlers can safely dounwind()
2764 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2765 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2766 sub_crush_depth(cv);
2768 DEBUG_S(PerlIO_printf(Perl_debug_log,
2769 "%p entersub returning %p\n", thr, CvSTART(cv)));
2771 RETURNOP(CvSTART(cv));
2776 Perl_sub_crush_depth(pTHX_ CV *cv)
2779 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2781 SV* tmpstr = sv_newmortal();
2782 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2783 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2794 U32 lval = PL_op->op_flags & OPf_MOD;
2795 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2799 elem -= PL_curcop->cop_arybase;
2800 if (SvTYPE(av) != SVt_PVAV)
2802 svp = av_fetch(av, elem, lval && !defer);
2804 if (!svp || *svp == &PL_sv_undef) {
2807 DIE(aTHX_ PL_no_aelem, elem);
2808 lv = sv_newmortal();
2809 sv_upgrade(lv, SVt_PVLV);
2811 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2812 LvTARG(lv) = SvREFCNT_inc(av);
2813 LvTARGOFF(lv) = elem;
2818 if (PL_op->op_private & OPpLVAL_INTRO)
2819 save_aelem(av, elem, svp);
2820 else if (PL_op->op_private & OPpDEREF)
2821 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2823 sv = (svp ? *svp : &PL_sv_undef);
2824 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2825 sv = sv_mortalcopy(sv);
2831 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2837 Perl_croak(aTHX_ PL_no_modify);
2838 if (SvTYPE(sv) < SVt_RV)
2839 sv_upgrade(sv, SVt_RV);
2840 else if (SvTYPE(sv) >= SVt_PV) {
2841 (void)SvOOK_off(sv);
2842 Safefree(SvPVX(sv));
2843 SvLEN(sv) = SvCUR(sv) = 0;
2847 SvRV(sv) = NEWSV(355,0);
2850 SvRV(sv) = (SV*)newAV();
2853 SvRV(sv) = (SV*)newHV();
2868 if (SvTYPE(rsv) == SVt_PVCV) {
2874 SETs(method_common(sv, Null(U32*)));
2881 SV* sv = cSVOP->op_sv;
2882 U32 hash = SvUVX(sv);
2884 XPUSHs(method_common(sv, &hash));
2889 S_method_common(pTHX_ SV* meth, U32* hashp)
2900 name = SvPV(meth, namelen);
2901 sv = *(PL_stack_base + TOPMARK + 1);
2904 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2915 !(packname = SvPV(sv, packlen)) ||
2916 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2917 !(ob=(SV*)GvIO(iogv)))
2920 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2921 ? !isIDFIRST_utf8((U8*)packname)
2922 : !isIDFIRST(*packname)
2925 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2926 SvOK(sv) ? "without a package or object reference"
2927 : "on an undefined value");
2929 stash = gv_stashpvn(packname, packlen, TRUE);
2932 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2935 if (!ob || !(SvOBJECT(ob)
2936 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2939 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2943 stash = SvSTASH(ob);
2946 /* shortcut for simple names */
2948 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2950 gv = (GV*)HeVAL(he);
2951 if (isGV(gv) && GvCV(gv) &&
2952 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2953 return (SV*)GvCV(gv);
2957 gv = gv_fetchmethod(stash, name);
2964 for (p = name; *p; p++) {
2966 sep = p, leaf = p + 1;
2967 else if (*p == ':' && *(p + 1) == ':')
2968 sep = p, leaf = p + 2;
2970 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2971 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2972 packlen = strlen(packname);
2976 packlen = sep - name;
2978 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2979 if (gv && isGV(gv)) {
2981 "Can't locate object method \"%s\" via package \"%s\"",
2986 "Can't locate object method \"%s\" via package \"%s\""
2987 " (perhaps you forgot to load \"%s\"?)",
2988 leaf, packname, packname);
2991 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2996 unset_cvowner(pTHXo_ void *cvarg)
2998 register CV* cv = (CV *) cvarg;
3001 #endif /* DEBUGGING */
3003 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
3004 thr, cv, SvPEEK((SV*)cv))));
3005 MUTEX_LOCK(CvMUTEXP(cv));
3006 DEBUG_S(if (CvDEPTH(cv) != 0)
3007 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
3009 assert(thr == CvOWNER(cv));
3011 MUTEX_UNLOCK(CvMUTEXP(cv));
3014 #endif /* USE_THREADS */