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_utf8 = DO_UTF8(left);
154 right_utf8 = DO_UTF8(right);
156 if (left_utf8 != right_utf8) {
157 if (TARG == right && !right_utf8) {
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_utf8 |= 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_utf8 |= 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++) {
188 if (UTF8_IS_CONTINUED(*c))
192 SvGROW(TARG, targlen+1);
193 /* And now copy, maybe upgrading right to UTF8 on the fly */
195 Copy(s, SvEND(TARG), len, U8);
197 for (c = (U8*)SvEND(TARG); len--; s++)
198 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))) {
409 if ((GvEGV(gv)) && (mg = SvTIED_mg((SV*)GvEGV(gv),'q')))
411 if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
412 report_evil_fh(gv, io, PL_op->op_type);
413 SETERRNO(EBADF,RMS$_IFI);
416 else if (!(fp = IoOFP(io))) {
417 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
419 report_evil_fh(gv, io, OP_phoney_INPUT_ONLY);
420 else if (ckWARN2(WARN_UNOPENED,WARN_CLOSED))
421 report_evil_fh(gv, io, PL_op->op_type);
423 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
428 if (PL_ofs_sv && SvOK(PL_ofs_sv)) {
430 if (!do_print(*MARK, fp))
434 if (!do_print(PL_ofs_sv, fp)) { /* $, */
443 if (!do_print(*MARK, fp))
451 if (PL_ors_sv && SvOK(PL_ors_sv))
452 if (!do_print(PL_ors_sv, fp)) /* $\ */
455 if (IoFLAGS(io) & IOf_FLUSH)
456 if (PerlIO_flush(fp) == EOF)
477 tryAMAGICunDEREF(to_av);
480 if (SvTYPE(av) != SVt_PVAV)
481 DIE(aTHX_ "Not an ARRAY reference");
482 if (PL_op->op_flags & OPf_REF) {
488 if (SvTYPE(sv) == SVt_PVAV) {
490 if (PL_op->op_flags & OPf_REF) {
498 if (SvTYPE(sv) != SVt_PVGV) {
502 if (SvGMAGICAL(sv)) {
508 if (PL_op->op_flags & OPf_REF ||
509 PL_op->op_private & HINT_STRICT_REFS)
510 DIE(aTHX_ PL_no_usym, "an ARRAY");
511 if (ckWARN(WARN_UNINITIALIZED))
513 if (GIMME == G_ARRAY) {
520 if ((PL_op->op_flags & OPf_SPECIAL) &&
521 !(PL_op->op_flags & OPf_MOD))
523 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
525 && (!is_gv_magical(sym,len,0)
526 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
532 if (PL_op->op_private & HINT_STRICT_REFS)
533 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
534 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
541 if (PL_op->op_private & OPpLVAL_INTRO)
543 if (PL_op->op_flags & OPf_REF) {
550 if (GIMME == G_ARRAY) {
551 I32 maxarg = AvFILL(av) + 1;
552 (void)POPs; /* XXXX May be optimized away? */
554 if (SvRMAGICAL(av)) {
556 for (i=0; i < maxarg; i++) {
557 SV **svp = av_fetch(av, i, FALSE);
558 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
562 Copy(AvARRAY(av), SP+1, maxarg, SV*);
568 I32 maxarg = AvFILL(av) + 1;
581 tryAMAGICunDEREF(to_hv);
584 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
585 DIE(aTHX_ "Not a HASH reference");
586 if (PL_op->op_flags & OPf_REF) {
592 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
594 if (PL_op->op_flags & OPf_REF) {
602 if (SvTYPE(sv) != SVt_PVGV) {
606 if (SvGMAGICAL(sv)) {
612 if (PL_op->op_flags & OPf_REF ||
613 PL_op->op_private & HINT_STRICT_REFS)
614 DIE(aTHX_ PL_no_usym, "a HASH");
615 if (ckWARN(WARN_UNINITIALIZED))
617 if (GIMME == G_ARRAY) {
624 if ((PL_op->op_flags & OPf_SPECIAL) &&
625 !(PL_op->op_flags & OPf_MOD))
627 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
629 && (!is_gv_magical(sym,len,0)
630 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
636 if (PL_op->op_private & HINT_STRICT_REFS)
637 DIE(aTHX_ PL_no_symref, sym, "a HASH");
638 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
645 if (PL_op->op_private & OPpLVAL_INTRO)
647 if (PL_op->op_flags & OPf_REF) {
654 if (GIMME == G_ARRAY) { /* array wanted */
655 *PL_stack_sp = (SV*)hv;
660 if (SvTYPE(hv) == SVt_PVAV)
661 hv = avhv_keys((AV*)hv);
663 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
664 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
674 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
680 leftop = ((BINOP*)PL_op)->op_last;
682 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
683 leftop = ((LISTOP*)leftop)->op_first;
685 /* Skip PUSHMARK and each element already assigned to. */
686 for (i = lelem - firstlelem; i > 0; i--) {
687 leftop = leftop->op_sibling;
690 if (leftop->op_type != OP_RV2HV)
695 av_fill(ary, 0); /* clear all but the fields hash */
696 if (lastrelem >= relem) {
697 while (relem < lastrelem) { /* gobble up all the rest */
701 /* Avoid a memory leak when avhv_store_ent dies. */
702 tmpstr = sv_newmortal();
703 sv_setsv(tmpstr,relem[1]); /* value */
705 if (avhv_store_ent(ary,relem[0],tmpstr,0))
706 (void)SvREFCNT_inc(tmpstr);
707 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
713 if (relem == lastrelem)
719 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
723 if (ckWARN(WARN_MISC)) {
724 if (relem == firstrelem &&
726 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
727 SvTYPE(SvRV(*relem)) == SVt_PVHV))
729 Perl_warner(aTHX_ WARN_MISC,
730 "Reference found where even-sized list expected");
733 Perl_warner(aTHX_ WARN_MISC,
734 "Odd number of elements in hash assignment");
736 if (SvTYPE(hash) == SVt_PVAV) {
738 tmpstr = sv_newmortal();
739 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
740 (void)SvREFCNT_inc(tmpstr);
741 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
746 tmpstr = NEWSV(29,0);
747 didstore = hv_store_ent(hash,*relem,tmpstr,0);
748 if (SvMAGICAL(hash)) {
749 if (SvSMAGICAL(tmpstr))
762 SV **lastlelem = PL_stack_sp;
763 SV **lastrelem = PL_stack_base + POPMARK;
764 SV **firstrelem = PL_stack_base + POPMARK + 1;
765 SV **firstlelem = lastrelem + 1;
778 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
780 /* If there's a common identifier on both sides we have to take
781 * special care that assigning the identifier on the left doesn't
782 * clobber a value on the right that's used later in the list.
784 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
785 EXTEND_MORTAL(lastrelem - firstrelem + 1);
786 for (relem = firstrelem; relem <= lastrelem; relem++) {
789 TAINT_NOT; /* Each item is independent */
790 *relem = sv_mortalcopy(sv);
800 while (lelem <= lastlelem) {
801 TAINT_NOT; /* Each item stands on its own, taintwise. */
803 switch (SvTYPE(sv)) {
806 magic = SvMAGICAL(ary) != 0;
807 if (PL_op->op_private & OPpASSIGN_HASH) {
808 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
814 do_oddball((HV*)ary, relem, firstrelem);
816 relem = lastrelem + 1;
821 av_extend(ary, lastrelem - relem);
823 while (relem <= lastrelem) { /* gobble up all the rest */
829 didstore = av_store(ary,i++,sv);
839 case SVt_PVHV: { /* normal hash */
843 magic = SvMAGICAL(hash) != 0;
846 while (relem < lastrelem) { /* gobble up all the rest */
851 sv = &PL_sv_no, relem++;
852 tmpstr = NEWSV(29,0);
854 sv_setsv(tmpstr,*relem); /* value */
856 didstore = hv_store_ent(hash,sv,tmpstr,0);
858 if (SvSMAGICAL(tmpstr))
865 if (relem == lastrelem) {
866 do_oddball(hash, relem, firstrelem);
872 if (SvIMMORTAL(sv)) {
873 if (relem <= lastrelem)
877 if (relem <= lastrelem) {
878 sv_setsv(sv, *relem);
882 sv_setsv(sv, &PL_sv_undef);
887 if (PL_delaymagic & ~DM_DELAY) {
888 if (PL_delaymagic & DM_UID) {
890 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
893 (void)setreuid(PL_uid,PL_euid);
896 if ((PL_delaymagic & DM_UID) == DM_RUID) {
897 (void)setruid(PL_uid);
898 PL_delaymagic &= ~DM_RUID;
900 # endif /* HAS_SETRUID */
902 if ((PL_delaymagic & DM_UID) == DM_EUID) {
903 (void)seteuid(PL_uid);
904 PL_delaymagic &= ~DM_EUID;
906 # endif /* HAS_SETEUID */
907 if (PL_delaymagic & DM_UID) {
908 if (PL_uid != PL_euid)
909 DIE(aTHX_ "No setreuid available");
910 (void)PerlProc_setuid(PL_uid);
912 # endif /* HAS_SETREUID */
913 #endif /* HAS_SETRESUID */
914 PL_uid = PerlProc_getuid();
915 PL_euid = PerlProc_geteuid();
917 if (PL_delaymagic & DM_GID) {
919 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
922 (void)setregid(PL_gid,PL_egid);
925 if ((PL_delaymagic & DM_GID) == DM_RGID) {
926 (void)setrgid(PL_gid);
927 PL_delaymagic &= ~DM_RGID;
929 # endif /* HAS_SETRGID */
931 if ((PL_delaymagic & DM_GID) == DM_EGID) {
932 (void)setegid(PL_gid);
933 PL_delaymagic &= ~DM_EGID;
935 # endif /* HAS_SETEGID */
936 if (PL_delaymagic & DM_GID) {
937 if (PL_gid != PL_egid)
938 DIE(aTHX_ "No setregid available");
939 (void)PerlProc_setgid(PL_gid);
941 # endif /* HAS_SETREGID */
942 #endif /* HAS_SETRESGID */
943 PL_gid = PerlProc_getgid();
944 PL_egid = PerlProc_getegid();
946 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
953 else if (gimme == G_SCALAR) {
956 SETi(lastrelem - firstrelem + 1);
962 SP = firstrelem + (lastlelem - firstlelem);
963 lelem = firstlelem + (relem - firstrelem);
965 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
973 register PMOP *pm = cPMOP;
974 SV *rv = sv_newmortal();
975 SV *sv = newSVrv(rv, "Regexp");
976 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
983 register PMOP *pm = cPMOP;
988 I32 r_flags = REXEC_CHECKED;
989 char *truebase; /* Start of string */
990 register REGEXP *rx = pm->op_pmregexp;
995 I32 oldsave = PL_savestack_ix;
996 I32 update_minmatch = 1;
999 if (PL_op->op_flags & OPf_STACKED)
1005 PUTBACK; /* EVAL blocks need stack_sp. */
1006 s = SvPV(TARG, len);
1009 DIE(aTHX_ "panic: do_match");
1010 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1011 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1014 if (pm->op_pmdynflags & PMdf_USED) {
1016 if (gimme == G_ARRAY)
1021 if (!rx->prelen && PL_curpm) {
1023 rx = pm->op_pmregexp;
1025 if (rx->minlen > len) goto failure;
1029 /* XXXX What part of this is needed with true \G-support? */
1030 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1032 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1033 MAGIC* mg = mg_find(TARG, 'g');
1034 if (mg && mg->mg_len >= 0) {
1035 if (!(rx->reganch & ROPT_GPOS_SEEN))
1036 rx->endp[0] = rx->startp[0] = mg->mg_len;
1037 else if (rx->reganch & ROPT_ANCH_GPOS) {
1038 r_flags |= REXEC_IGNOREPOS;
1039 rx->endp[0] = rx->startp[0] = mg->mg_len;
1041 minmatch = (mg->mg_flags & MGf_MINMATCH);
1042 update_minmatch = 0;
1046 if ((gimme != G_ARRAY && !global && rx->nparens)
1047 || SvTEMP(TARG) || PL_sawampersand)
1048 r_flags |= REXEC_COPY_STR;
1050 r_flags |= REXEC_SCREAM;
1052 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1053 SAVEINT(PL_multiline);
1054 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1058 if (global && rx->startp[0] != -1) {
1059 t = s = rx->endp[0] + truebase;
1060 if ((s + rx->minlen) > strend)
1062 if (update_minmatch++)
1063 minmatch = had_zerolen;
1065 if (rx->reganch & RE_USE_INTUIT) {
1066 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1070 if ( (rx->reganch & ROPT_CHECK_ALL)
1072 && ((rx->reganch & ROPT_NOSCAN)
1073 || !((rx->reganch & RE_INTUIT_TAIL)
1074 && (r_flags & REXEC_SCREAM)))
1075 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1078 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1081 if (pm->op_pmflags & PMf_ONCE)
1082 pm->op_pmdynflags |= PMdf_USED;
1091 RX_MATCH_TAINTED_on(rx);
1092 TAINT_IF(RX_MATCH_TAINTED(rx));
1093 if (gimme == G_ARRAY) {
1096 iters = rx->nparens;
1097 if (global && !iters)
1101 SPAGAIN; /* EVAL blocks could move the stack. */
1102 EXTEND(SP, iters + i);
1103 EXTEND_MORTAL(iters + i);
1104 for (i = !i; i <= iters; i++) {
1105 PUSHs(sv_newmortal());
1107 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1108 len = rx->endp[i] - rx->startp[i];
1109 s = rx->startp[i] + truebase;
1110 sv_setpvn(*SP, s, len);
1111 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1113 sv_utf8_downgrade(*SP, TRUE);
1118 had_zerolen = (rx->startp[0] != -1
1119 && rx->startp[0] == rx->endp[0]);
1120 PUTBACK; /* EVAL blocks may use stack */
1121 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1126 LEAVE_SCOPE(oldsave);
1132 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1133 mg = mg_find(TARG, 'g');
1135 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1136 mg = mg_find(TARG, 'g');
1138 if (rx->startp[0] != -1) {
1139 mg->mg_len = rx->endp[0];
1140 if (rx->startp[0] == rx->endp[0])
1141 mg->mg_flags |= MGf_MINMATCH;
1143 mg->mg_flags &= ~MGf_MINMATCH;
1146 LEAVE_SCOPE(oldsave);
1150 yup: /* Confirmed by INTUIT */
1152 RX_MATCH_TAINTED_on(rx);
1153 TAINT_IF(RX_MATCH_TAINTED(rx));
1155 if (pm->op_pmflags & PMf_ONCE)
1156 pm->op_pmdynflags |= PMdf_USED;
1157 if (RX_MATCH_COPIED(rx))
1158 Safefree(rx->subbeg);
1159 RX_MATCH_COPIED_off(rx);
1160 rx->subbeg = Nullch;
1162 rx->subbeg = truebase;
1163 rx->startp[0] = s - truebase;
1164 rx->endp[0] = s - truebase + rx->minlen;
1165 rx->sublen = strend - truebase;
1168 if (PL_sawampersand) {
1171 rx->subbeg = savepvn(t, strend - t);
1172 rx->sublen = strend - t;
1173 RX_MATCH_COPIED_on(rx);
1174 off = rx->startp[0] = s - t;
1175 rx->endp[0] = off + rx->minlen;
1177 else { /* startp/endp are used by @- @+. */
1178 rx->startp[0] = s - truebase;
1179 rx->endp[0] = s - truebase + rx->minlen;
1181 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1182 LEAVE_SCOPE(oldsave);
1187 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1188 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1189 MAGIC* mg = mg_find(TARG, 'g');
1194 LEAVE_SCOPE(oldsave);
1195 if (gimme == G_ARRAY)
1201 Perl_do_readline(pTHX)
1203 dSP; dTARGETSTACKED;
1208 register IO *io = GvIO(PL_last_in_gv);
1209 register I32 type = PL_op->op_type;
1210 I32 gimme = GIMME_V;
1213 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1215 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1218 call_method("READLINE", gimme);
1221 if (gimme == G_SCALAR)
1222 SvSetMagicSV_nosteal(TARG, TOPs);
1229 if (IoFLAGS(io) & IOf_ARGV) {
1230 if (IoFLAGS(io) & IOf_START) {
1232 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1233 IoFLAGS(io) &= ~IOf_START;
1234 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1235 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1236 SvSETMAGIC(GvSV(PL_last_in_gv));
1241 fp = nextargv(PL_last_in_gv);
1242 if (!fp) { /* Note: fp != IoIFP(io) */
1243 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1246 else if (type == OP_GLOB)
1247 fp = Perl_start_glob(aTHX_ POPs, io);
1249 else if (type == OP_GLOB)
1251 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1252 && (IoTYPE(io) == IoTYPE_WRONLY || fp == PerlIO_stdout()
1253 || fp == PerlIO_stderr()))
1254 report_evil_fh(PL_last_in_gv, io, OP_phoney_OUTPUT_ONLY);
1257 if (ckWARN2(WARN_GLOB, WARN_CLOSED)
1258 && (!io || !(IoFLAGS(io) & IOf_START))) {
1259 if (type == OP_GLOB)
1260 Perl_warner(aTHX_ WARN_GLOB,
1261 "glob failed (can't start child: %s)",
1264 report_evil_fh(PL_last_in_gv, io, PL_op->op_type);
1266 if (gimme == G_SCALAR) {
1267 (void)SvOK_off(TARG);
1273 if (gimme == G_SCALAR) {
1277 (void)SvUPGRADE(sv, SVt_PV);
1278 tmplen = SvLEN(sv); /* remember if already alloced */
1280 Sv_Grow(sv, 80); /* try short-buffering it */
1281 if (type == OP_RCATLINE)
1287 sv = sv_2mortal(NEWSV(57, 80));
1291 /* This should not be marked tainted if the fp is marked clean */
1292 #define MAYBE_TAINT_LINE(io, sv) \
1293 if (!(IoFLAGS(io) & IOf_UNTAINT)) { \
1298 /* delay EOF state for a snarfed empty file */
1299 #define SNARF_EOF(gimme,rs,io,sv) \
1300 (gimme != G_SCALAR || SvCUR(sv) \
1301 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1304 if (!sv_gets(sv, fp, offset)
1305 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1307 PerlIO_clearerr(fp);
1308 if (IoFLAGS(io) & IOf_ARGV) {
1309 fp = nextargv(PL_last_in_gv);
1312 (void)do_close(PL_last_in_gv, FALSE);
1314 else if (type == OP_GLOB) {
1315 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1316 Perl_warner(aTHX_ WARN_GLOB,
1317 "glob failed (child exited with status %d%s)",
1318 (int)(STATUS_CURRENT >> 8),
1319 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1322 if (gimme == G_SCALAR) {
1323 (void)SvOK_off(TARG);
1326 MAYBE_TAINT_LINE(io, sv);
1329 MAYBE_TAINT_LINE(io, sv);
1331 IoFLAGS(io) |= IOf_NOLINE;
1334 if (type == OP_GLOB) {
1337 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1338 tmps = SvEND(sv) - 1;
1339 if (*tmps == *SvPVX(PL_rs)) {
1344 for (tmps = SvPVX(sv); *tmps; tmps++)
1345 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1346 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1348 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1349 (void)POPs; /* Unmatched wildcard? Chuck it... */
1353 if (gimme == G_ARRAY) {
1354 if (SvLEN(sv) - SvCUR(sv) > 20) {
1355 SvLEN_set(sv, SvCUR(sv)+1);
1356 Renew(SvPVX(sv), SvLEN(sv), char);
1358 sv = sv_2mortal(NEWSV(58, 80));
1361 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1362 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1366 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1367 Renew(SvPVX(sv), SvLEN(sv), char);
1376 register PERL_CONTEXT *cx;
1377 I32 gimme = OP_GIMME(PL_op, -1);
1380 if (cxstack_ix >= 0)
1381 gimme = cxstack[cxstack_ix].blk_gimme;
1389 PUSHBLOCK(cx, CXt_BLOCK, SP);
1401 U32 lval = PL_op->op_flags & OPf_MOD;
1402 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1404 U32 hash = (SvFAKE(keysv) && SvREADONLY(keysv)) ? SvUVX(keysv) : 0;
1407 if (SvTYPE(hv) == SVt_PVHV) {
1408 if (PL_op->op_private & OPpLVAL_INTRO)
1409 preeminent = SvRMAGICAL(hv) ? 1 : hv_exists_ent(hv, keysv, 0);
1410 he = hv_fetch_ent(hv, keysv, lval && !defer, hash);
1411 svp = he ? &HeVAL(he) : 0;
1413 else if (SvTYPE(hv) == SVt_PVAV) {
1414 if (PL_op->op_private & OPpLVAL_INTRO)
1415 DIE(aTHX_ "Can't localize pseudo-hash element");
1416 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, hash);
1422 if (!svp || *svp == &PL_sv_undef) {
1427 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1429 lv = sv_newmortal();
1430 sv_upgrade(lv, SVt_PVLV);
1432 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1433 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1434 LvTARG(lv) = SvREFCNT_inc(hv);
1439 if (PL_op->op_private & OPpLVAL_INTRO) {
1440 if (HvNAME(hv) && isGV(*svp))
1441 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1445 char *key = SvPV(keysv, keylen);
1446 save_delete(hv, key, keylen);
1448 save_helem(hv, keysv, svp);
1451 else if (PL_op->op_private & OPpDEREF)
1452 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1454 sv = (svp ? *svp : &PL_sv_undef);
1455 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1456 * Pushing the magical RHS on to the stack is useless, since
1457 * that magic is soon destined to be misled by the local(),
1458 * and thus the later pp_sassign() will fail to mg_get() the
1459 * old value. This should also cure problems with delayed
1460 * mg_get()s. GSAR 98-07-03 */
1461 if (!lval && SvGMAGICAL(sv))
1462 sv = sv_mortalcopy(sv);
1470 register PERL_CONTEXT *cx;
1476 if (PL_op->op_flags & OPf_SPECIAL) {
1477 cx = &cxstack[cxstack_ix];
1478 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1483 gimme = OP_GIMME(PL_op, -1);
1485 if (cxstack_ix >= 0)
1486 gimme = cxstack[cxstack_ix].blk_gimme;
1492 if (gimme == G_VOID)
1494 else if (gimme == G_SCALAR) {
1497 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1500 *MARK = sv_mortalcopy(TOPs);
1503 *MARK = &PL_sv_undef;
1507 else if (gimme == G_ARRAY) {
1508 /* in case LEAVE wipes old return values */
1509 for (mark = newsp + 1; mark <= SP; mark++) {
1510 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1511 *mark = sv_mortalcopy(*mark);
1512 TAINT_NOT; /* Each item is independent */
1516 PL_curpm = newpm; /* Don't pop $1 et al till now */
1526 register PERL_CONTEXT *cx;
1532 cx = &cxstack[cxstack_ix];
1533 if (CxTYPE(cx) != CXt_LOOP)
1534 DIE(aTHX_ "panic: pp_iter");
1536 itersvp = CxITERVAR(cx);
1537 av = cx->blk_loop.iterary;
1538 if (SvTYPE(av) != SVt_PVAV) {
1539 /* iterate ($min .. $max) */
1540 if (cx->blk_loop.iterlval) {
1541 /* string increment */
1542 register SV* cur = cx->blk_loop.iterlval;
1544 char *max = SvPV((SV*)av, maxlen);
1545 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1546 #ifndef USE_THREADS /* don't risk potential race */
1547 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1548 /* safe to reuse old SV */
1549 sv_setsv(*itersvp, cur);
1554 /* we need a fresh SV every time so that loop body sees a
1555 * completely new SV for closures/references to work as
1557 SvREFCNT_dec(*itersvp);
1558 *itersvp = newSVsv(cur);
1560 if (strEQ(SvPVX(cur), max))
1561 sv_setiv(cur, 0); /* terminate next time */
1568 /* integer increment */
1569 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1572 #ifndef USE_THREADS /* don't risk potential race */
1573 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1574 /* safe to reuse old SV */
1575 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1580 /* we need a fresh SV every time so that loop body sees a
1581 * completely new SV for closures/references to work as they
1583 SvREFCNT_dec(*itersvp);
1584 *itersvp = newSViv(cx->blk_loop.iterix++);
1590 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1593 SvREFCNT_dec(*itersvp);
1595 if ((sv = SvMAGICAL(av)
1596 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1597 : AvARRAY(av)[++cx->blk_loop.iterix]))
1601 if (av != PL_curstack && SvIMMORTAL(sv)) {
1602 SV *lv = cx->blk_loop.iterlval;
1603 if (lv && SvREFCNT(lv) > 1) {
1608 SvREFCNT_dec(LvTARG(lv));
1610 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1611 sv_upgrade(lv, SVt_PVLV);
1613 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1615 LvTARG(lv) = SvREFCNT_inc(av);
1616 LvTARGOFF(lv) = cx->blk_loop.iterix;
1617 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1621 *itersvp = SvREFCNT_inc(sv);
1628 register PMOP *pm = cPMOP;
1644 register REGEXP *rx = pm->op_pmregexp;
1646 int force_on_match = 0;
1647 I32 oldsave = PL_savestack_ix;
1649 /* known replacement string? */
1650 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1651 if (PL_op->op_flags & OPf_STACKED)
1657 if (SvFAKE(TARG) && SvREADONLY(TARG))
1658 sv_force_normal(TARG);
1659 if (SvREADONLY(TARG)
1660 || (SvTYPE(TARG) > SVt_PVLV
1661 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1662 DIE(aTHX_ PL_no_modify);
1665 s = SvPV(TARG, len);
1666 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1668 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1669 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1676 DIE(aTHX_ "panic: do_subst");
1679 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1680 position, once with zero-length,
1681 second time with non-zero. */
1683 if (!rx->prelen && PL_curpm) {
1685 rx = pm->op_pmregexp;
1687 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1688 ? REXEC_COPY_STR : 0;
1690 r_flags |= REXEC_SCREAM;
1691 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1692 SAVEINT(PL_multiline);
1693 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1696 if (rx->reganch & RE_USE_INTUIT) {
1697 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1701 /* How to do it in subst? */
1702 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1704 && ((rx->reganch & ROPT_NOSCAN)
1705 || !((rx->reganch & RE_INTUIT_TAIL)
1706 && (r_flags & REXEC_SCREAM))))
1711 /* only replace once? */
1712 once = !(rpm->op_pmflags & PMf_GLOBAL);
1714 /* known replacement string? */
1715 c = dstr ? SvPV(dstr, clen) : Nullch;
1717 /* can do inplace substitution? */
1718 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1719 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1720 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1721 r_flags | REXEC_CHECKED))
1725 LEAVE_SCOPE(oldsave);
1728 if (force_on_match) {
1730 s = SvPV_force(TARG, len);
1735 SvSCREAM_off(TARG); /* disable possible screamer */
1737 rxtainted |= RX_MATCH_TAINTED(rx);
1738 m = orig + rx->startp[0];
1739 d = orig + rx->endp[0];
1741 if (m - s > strend - d) { /* faster to shorten from end */
1743 Copy(c, m, clen, char);
1748 Move(d, m, i, char);
1752 SvCUR_set(TARG, m - s);
1755 else if ((i = m - s)) { /* faster from front */
1763 Copy(c, m, clen, char);
1768 Copy(c, d, clen, char);
1773 TAINT_IF(rxtainted & 1);
1779 if (iters++ > maxiters)
1780 DIE(aTHX_ "Substitution loop");
1781 rxtainted |= RX_MATCH_TAINTED(rx);
1782 m = rx->startp[0] + orig;
1786 Move(s, d, i, char);
1790 Copy(c, d, clen, char);
1793 s = rx->endp[0] + orig;
1794 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1796 /* don't match same null twice */
1797 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1800 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1801 Move(s, d, i+1, char); /* include the NUL */
1803 TAINT_IF(rxtainted & 1);
1805 PUSHs(sv_2mortal(newSViv((I32)iters)));
1807 (void)SvPOK_only_UTF8(TARG);
1808 TAINT_IF(rxtainted);
1809 if (SvSMAGICAL(TARG)) {
1815 LEAVE_SCOPE(oldsave);
1819 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1820 r_flags | REXEC_CHECKED))
1822 if (force_on_match) {
1824 s = SvPV_force(TARG, len);
1827 rxtainted |= RX_MATCH_TAINTED(rx);
1828 dstr = NEWSV(25, len);
1829 sv_setpvn(dstr, m, s-m);
1832 register PERL_CONTEXT *cx;
1835 RETURNOP(cPMOP->op_pmreplroot);
1837 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1839 if (iters++ > maxiters)
1840 DIE(aTHX_ "Substitution loop");
1841 rxtainted |= RX_MATCH_TAINTED(rx);
1842 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1847 strend = s + (strend - m);
1849 m = rx->startp[0] + orig;
1850 sv_catpvn(dstr, s, m-s);
1851 s = rx->endp[0] + orig;
1853 sv_catpvn(dstr, c, clen);
1856 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1857 sv_catpvn(dstr, s, strend - s);
1859 (void)SvOOK_off(TARG);
1860 Safefree(SvPVX(TARG));
1861 SvPVX(TARG) = SvPVX(dstr);
1862 SvCUR_set(TARG, SvCUR(dstr));
1863 SvLEN_set(TARG, SvLEN(dstr));
1867 TAINT_IF(rxtainted & 1);
1869 PUSHs(sv_2mortal(newSViv((I32)iters)));
1871 (void)SvPOK_only(TARG);
1872 TAINT_IF(rxtainted);
1875 LEAVE_SCOPE(oldsave);
1884 LEAVE_SCOPE(oldsave);
1893 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1894 ++*PL_markstack_ptr;
1895 LEAVE; /* exit inner scope */
1898 if (PL_stack_base + *PL_markstack_ptr > SP) {
1900 I32 gimme = GIMME_V;
1902 LEAVE; /* exit outer scope */
1903 (void)POPMARK; /* pop src */
1904 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1905 (void)POPMARK; /* pop dst */
1906 SP = PL_stack_base + POPMARK; /* pop original mark */
1907 if (gimme == G_SCALAR) {
1911 else if (gimme == G_ARRAY)
1918 ENTER; /* enter inner scope */
1921 src = PL_stack_base[*PL_markstack_ptr];
1925 RETURNOP(cLOGOP->op_other);
1936 register PERL_CONTEXT *cx;
1942 if (gimme == G_SCALAR) {
1945 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1947 *MARK = SvREFCNT_inc(TOPs);
1952 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
1954 *MARK = sv_mortalcopy(sv);
1959 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1963 *MARK = &PL_sv_undef;
1967 else if (gimme == G_ARRAY) {
1968 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1969 if (!SvTEMP(*MARK)) {
1970 *MARK = sv_mortalcopy(*MARK);
1971 TAINT_NOT; /* Each item is independent */
1977 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
1978 PL_curpm = newpm; /* ... and pop $1 et al */
1982 return pop_return();
1985 /* This duplicates the above code because the above code must not
1986 * get any slower by more conditions */
1994 register PERL_CONTEXT *cx;
2001 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2002 /* We are an argument to a function or grep().
2003 * This kind of lvalueness was legal before lvalue
2004 * subroutines too, so be backward compatible:
2005 * cannot report errors. */
2007 /* Scalar context *is* possible, on the LHS of -> only,
2008 * as in f()->meth(). But this is not an lvalue. */
2009 if (gimme == G_SCALAR)
2011 if (gimme == G_ARRAY) {
2012 if (!CvLVALUE(cx->blk_sub.cv))
2013 goto temporise_array;
2014 EXTEND_MORTAL(SP - newsp);
2015 for (mark = newsp + 1; mark <= SP; mark++) {
2018 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2019 *mark = sv_mortalcopy(*mark);
2021 /* Can be a localized value subject to deletion. */
2022 PL_tmps_stack[++PL_tmps_ix] = *mark;
2023 (void)SvREFCNT_inc(*mark);
2028 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2029 /* Here we go for robustness, not for speed, so we change all
2030 * the refcounts so the caller gets a live guy. Cannot set
2031 * TEMP, so sv_2mortal is out of question. */
2032 if (!CvLVALUE(cx->blk_sub.cv)) {
2037 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2039 if (gimme == G_SCALAR) {
2043 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2048 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2049 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2051 else { /* Can be a localized value
2052 * subject to deletion. */
2053 PL_tmps_stack[++PL_tmps_ix] = *mark;
2054 (void)SvREFCNT_inc(*mark);
2057 else { /* Should not happen? */
2062 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2063 (MARK > SP ? "Empty array" : "Array"));
2067 else if (gimme == G_ARRAY) {
2068 EXTEND_MORTAL(SP - newsp);
2069 for (mark = newsp + 1; mark <= SP; mark++) {
2070 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2071 /* Might be flattened array after $#array = */
2077 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2078 (*mark != &PL_sv_undef)
2080 ? "a readonly value" : "a temporary")
2081 : "an uninitialized value");
2084 /* Can be a localized value subject to deletion. */
2085 PL_tmps_stack[++PL_tmps_ix] = *mark;
2086 (void)SvREFCNT_inc(*mark);
2092 if (gimme == G_SCALAR) {
2096 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2098 *MARK = SvREFCNT_inc(TOPs);
2103 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2105 *MARK = sv_mortalcopy(sv);
2110 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2114 *MARK = &PL_sv_undef;
2118 else if (gimme == G_ARRAY) {
2120 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2121 if (!SvTEMP(*MARK)) {
2122 *MARK = sv_mortalcopy(*MARK);
2123 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();
2140 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2142 SV *dbsv = GvSV(PL_DBsub);
2144 if (!PERLDB_SUB_NN) {
2148 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2149 || strEQ(GvNAME(gv), "END")
2150 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2151 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2152 && (gv = (GV*)*svp) ))) {
2153 /* Use GV from the stack as a fallback. */
2154 /* GV is potentially non-unique, or contain different CV. */
2155 SV *tmp = newRV((SV*)cv);
2156 sv_setsv(dbsv, tmp);
2160 gv_efullname3(dbsv, gv, Nullch);
2164 (void)SvUPGRADE(dbsv, SVt_PVIV);
2165 (void)SvIOK_on(dbsv);
2166 SAVEIV(SvIVX(dbsv));
2167 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2171 PL_curcopdb = PL_curcop;
2172 cv = GvCV(PL_DBsub);
2182 register PERL_CONTEXT *cx;
2184 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2187 DIE(aTHX_ "Not a CODE reference");
2188 switch (SvTYPE(sv)) {
2194 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2196 SP = PL_stack_base + POPMARK;
2199 if (SvGMAGICAL(sv)) {
2201 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2204 sym = SvPV(sv, n_a);
2206 DIE(aTHX_ PL_no_usym, "a subroutine");
2207 if (PL_op->op_private & HINT_STRICT_REFS)
2208 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2209 cv = get_cv(sym, TRUE);
2213 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2214 tryAMAGICunDEREF(to_cv);
2217 if (SvTYPE(cv) == SVt_PVCV)
2222 DIE(aTHX_ "Not a CODE reference");
2227 if (!(cv = GvCVu((GV*)sv)))
2228 cv = sv_2cv(sv, &stash, &gv, FALSE);
2241 if (!CvROOT(cv) && !CvXSUB(cv)) {
2245 /* anonymous or undef'd function leaves us no recourse */
2246 if (CvANON(cv) || !(gv = CvGV(cv)))
2247 DIE(aTHX_ "Undefined subroutine called");
2249 /* autoloaded stub? */
2250 if (cv != GvCV(gv)) {
2253 /* should call AUTOLOAD now? */
2256 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2263 sub_name = sv_newmortal();
2264 gv_efullname3(sub_name, gv, Nullch);
2265 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2269 DIE(aTHX_ "Not a CODE reference");
2274 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2275 cv = get_db_sub(&sv, cv);
2277 DIE(aTHX_ "No DBsub routine");
2282 * First we need to check if the sub or method requires locking.
2283 * If so, we gain a lock on the CV, the first argument or the
2284 * stash (for static methods), as appropriate. This has to be
2285 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2286 * reschedule by returning a new op.
2288 MUTEX_LOCK(CvMUTEXP(cv));
2289 if (CvFLAGS(cv) & CVf_LOCKED) {
2291 if (CvFLAGS(cv) & CVf_METHOD) {
2292 if (SP > PL_stack_base + TOPMARK)
2293 sv = *(PL_stack_base + TOPMARK + 1);
2295 AV *av = (AV*)PL_curpad[0];
2296 if (hasargs || !av || AvFILLp(av) < 0
2297 || !(sv = AvARRAY(av)[0]))
2299 MUTEX_UNLOCK(CvMUTEXP(cv));
2300 DIE(aTHX_ "no argument for locked method call");
2307 char *stashname = SvPV(sv, len);
2308 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2314 MUTEX_UNLOCK(CvMUTEXP(cv));
2315 mg = condpair_magic(sv);
2316 MUTEX_LOCK(MgMUTEXP(mg));
2317 if (MgOWNER(mg) == thr)
2318 MUTEX_UNLOCK(MgMUTEXP(mg));
2321 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2323 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2325 MUTEX_UNLOCK(MgMUTEXP(mg));
2326 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2328 MUTEX_LOCK(CvMUTEXP(cv));
2331 * Now we have permission to enter the sub, we must distinguish
2332 * four cases. (0) It's an XSUB (in which case we don't care
2333 * about ownership); (1) it's ours already (and we're recursing);
2334 * (2) it's free (but we may already be using a cached clone);
2335 * (3) another thread owns it. Case (1) is easy: we just use it.
2336 * Case (2) means we look for a clone--if we have one, use it
2337 * otherwise grab ownership of cv. Case (3) means we look for a
2338 * clone (for non-XSUBs) and have to create one if we don't
2340 * Why look for a clone in case (2) when we could just grab
2341 * ownership of cv straight away? Well, we could be recursing,
2342 * i.e. we originally tried to enter cv while another thread
2343 * owned it (hence we used a clone) but it has been freed up
2344 * and we're now recursing into it. It may or may not be "better"
2345 * to use the clone but at least CvDEPTH can be trusted.
2347 if (CvOWNER(cv) == thr || CvXSUB(cv))
2348 MUTEX_UNLOCK(CvMUTEXP(cv));
2350 /* Case (2) or (3) */
2354 * XXX Might it be better to release CvMUTEXP(cv) while we
2355 * do the hv_fetch? We might find someone has pinched it
2356 * when we look again, in which case we would be in case
2357 * (3) instead of (2) so we'd have to clone. Would the fact
2358 * that we released the mutex more quickly make up for this?
2360 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2362 /* We already have a clone to use */
2363 MUTEX_UNLOCK(CvMUTEXP(cv));
2365 DEBUG_S(PerlIO_printf(Perl_debug_log,
2366 "entersub: %p already has clone %p:%s\n",
2367 thr, cv, SvPEEK((SV*)cv)));
2370 if (CvDEPTH(cv) == 0)
2371 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2374 /* (2) => grab ownership of cv. (3) => make clone */
2378 MUTEX_UNLOCK(CvMUTEXP(cv));
2379 DEBUG_S(PerlIO_printf(Perl_debug_log,
2380 "entersub: %p grabbing %p:%s in stash %s\n",
2381 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2382 HvNAME(CvSTASH(cv)) : "(none)"));
2385 /* Make a new clone. */
2387 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2388 MUTEX_UNLOCK(CvMUTEXP(cv));
2389 DEBUG_S((PerlIO_printf(Perl_debug_log,
2390 "entersub: %p cloning %p:%s\n",
2391 thr, cv, SvPEEK((SV*)cv))));
2393 * We're creating a new clone so there's no race
2394 * between the original MUTEX_UNLOCK and the
2395 * SvREFCNT_inc since no one will be trying to undef
2396 * it out from underneath us. At least, I don't think
2399 clonecv = cv_clone(cv);
2400 SvREFCNT_dec(cv); /* finished with this */
2401 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2402 CvOWNER(clonecv) = thr;
2406 DEBUG_S(if (CvDEPTH(cv) != 0)
2407 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2409 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2412 #endif /* USE_THREADS */
2415 #ifdef PERL_XSUB_OLDSTYLE
2416 if (CvOLDSTYLE(cv)) {
2417 I32 (*fp3)(int,int,int);
2419 register I32 items = SP - MARK;
2420 /* We dont worry to copy from @_. */
2425 PL_stack_sp = mark + 1;
2426 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2427 items = (*fp3)(CvXSUBANY(cv).any_i32,
2428 MARK - PL_stack_base + 1,
2430 PL_stack_sp = PL_stack_base + items;
2433 #endif /* PERL_XSUB_OLDSTYLE */
2435 I32 markix = TOPMARK;
2440 /* Need to copy @_ to stack. Alternative may be to
2441 * switch stack to @_, and copy return values
2442 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2446 av = (AV*)PL_curpad[0];
2448 av = GvAV(PL_defgv);
2449 #endif /* USE_THREADS */
2450 items = AvFILLp(av) + 1; /* @_ is not tieable */
2453 /* Mark is at the end of the stack. */
2455 Copy(AvARRAY(av), SP + 1, items, SV*);
2460 /* We assume first XSUB in &DB::sub is the called one. */
2462 SAVEVPTR(PL_curcop);
2463 PL_curcop = PL_curcopdb;
2466 /* Do we need to open block here? XXXX */
2467 (void)(*CvXSUB(cv))(aTHXo_ cv);
2469 /* Enforce some sanity in scalar context. */
2470 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2471 if (markix > PL_stack_sp - PL_stack_base)
2472 *(PL_stack_base + markix) = &PL_sv_undef;
2474 *(PL_stack_base + markix) = *PL_stack_sp;
2475 PL_stack_sp = PL_stack_base + markix;
2483 register I32 items = SP - MARK;
2484 AV* padlist = CvPADLIST(cv);
2485 SV** svp = AvARRAY(padlist);
2486 push_return(PL_op->op_next);
2487 PUSHBLOCK(cx, CXt_SUB, MARK);
2490 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2491 * that eval'' ops within this sub know the correct lexical space.
2492 * Owing the speed considerations, we choose to search for the cv
2493 * in doeval() instead.
2495 if (CvDEPTH(cv) < 2)
2496 (void)SvREFCNT_inc(cv);
2497 else { /* save temporaries on recursion? */
2498 PERL_STACK_OVERFLOW_CHECK();
2499 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2501 AV *newpad = newAV();
2502 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2503 I32 ix = AvFILLp((AV*)svp[1]);
2504 I32 names_fill = AvFILLp((AV*)svp[0]);
2505 svp = AvARRAY(svp[0]);
2506 for ( ;ix > 0; ix--) {
2507 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2508 char *name = SvPVX(svp[ix]);
2509 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2510 || *name == '&') /* anonymous code? */
2512 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2514 else { /* our own lexical */
2516 av_store(newpad, ix, sv = (SV*)newAV());
2517 else if (*name == '%')
2518 av_store(newpad, ix, sv = (SV*)newHV());
2520 av_store(newpad, ix, sv = NEWSV(0,0));
2524 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2525 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2528 av_store(newpad, ix, sv = NEWSV(0,0));
2532 av = newAV(); /* will be @_ */
2534 av_store(newpad, 0, (SV*)av);
2535 AvFLAGS(av) = AVf_REIFY;
2536 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2537 AvFILLp(padlist) = CvDEPTH(cv);
2538 svp = AvARRAY(padlist);
2543 AV* av = (AV*)PL_curpad[0];
2545 items = AvFILLp(av) + 1;
2547 /* Mark is at the end of the stack. */
2549 Copy(AvARRAY(av), SP + 1, items, SV*);
2554 #endif /* USE_THREADS */
2555 SAVEVPTR(PL_curpad);
2556 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2559 #endif /* USE_THREADS */
2565 DEBUG_S(PerlIO_printf(Perl_debug_log,
2566 "%p entersub preparing @_\n", thr));
2568 av = (AV*)PL_curpad[0];
2570 /* @_ is normally not REAL--this should only ever
2571 * happen when DB::sub() calls things that modify @_ */
2577 cx->blk_sub.savearray = GvAV(PL_defgv);
2578 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2579 #endif /* USE_THREADS */
2580 cx->blk_sub.oldcurpad = PL_curpad;
2581 cx->blk_sub.argarray = av;
2584 if (items > AvMAX(av) + 1) {
2586 if (AvARRAY(av) != ary) {
2587 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2588 SvPVX(av) = (char*)ary;
2590 if (items > AvMAX(av) + 1) {
2591 AvMAX(av) = items - 1;
2592 Renew(ary,items,SV*);
2594 SvPVX(av) = (char*)ary;
2597 Copy(MARK,AvARRAY(av),items,SV*);
2598 AvFILLp(av) = items - 1;
2606 /* warning must come *after* we fully set up the context
2607 * stuff so that __WARN__ handlers can safely dounwind()
2610 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2611 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2612 sub_crush_depth(cv);
2614 DEBUG_S(PerlIO_printf(Perl_debug_log,
2615 "%p entersub returning %p\n", thr, CvSTART(cv)));
2617 RETURNOP(CvSTART(cv));
2622 Perl_sub_crush_depth(pTHX_ CV *cv)
2625 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2627 SV* tmpstr = sv_newmortal();
2628 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2629 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2640 U32 lval = PL_op->op_flags & OPf_MOD;
2641 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2645 elem -= PL_curcop->cop_arybase;
2646 if (SvTYPE(av) != SVt_PVAV)
2648 svp = av_fetch(av, elem, lval && !defer);
2650 if (!svp || *svp == &PL_sv_undef) {
2653 DIE(aTHX_ PL_no_aelem, elem);
2654 lv = sv_newmortal();
2655 sv_upgrade(lv, SVt_PVLV);
2657 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2658 LvTARG(lv) = SvREFCNT_inc(av);
2659 LvTARGOFF(lv) = elem;
2664 if (PL_op->op_private & OPpLVAL_INTRO)
2665 save_aelem(av, elem, svp);
2666 else if (PL_op->op_private & OPpDEREF)
2667 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2669 sv = (svp ? *svp : &PL_sv_undef);
2670 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2671 sv = sv_mortalcopy(sv);
2677 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2683 Perl_croak(aTHX_ PL_no_modify);
2684 if (SvTYPE(sv) < SVt_RV)
2685 sv_upgrade(sv, SVt_RV);
2686 else if (SvTYPE(sv) >= SVt_PV) {
2687 (void)SvOOK_off(sv);
2688 Safefree(SvPVX(sv));
2689 SvLEN(sv) = SvCUR(sv) = 0;
2693 SvRV(sv) = NEWSV(355,0);
2696 SvRV(sv) = (SV*)newAV();
2699 SvRV(sv) = (SV*)newHV();
2714 if (SvTYPE(rsv) == SVt_PVCV) {
2720 SETs(method_common(sv, Null(U32*)));
2727 SV* sv = cSVOP->op_sv;
2728 U32 hash = SvUVX(sv);
2730 XPUSHs(method_common(sv, &hash));
2735 S_method_common(pTHX_ SV* meth, U32* hashp)
2746 name = SvPV(meth, namelen);
2747 sv = *(PL_stack_base + TOPMARK + 1);
2750 Perl_croak(aTHX_ "Can't call method \"%s\" on an undefined value", name);
2761 !(packname = SvPV(sv, packlen)) ||
2762 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2763 !(ob=(SV*)GvIO(iogv)))
2766 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2767 ? !isIDFIRST_utf8((U8*)packname)
2768 : !isIDFIRST(*packname)
2771 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2772 SvOK(sv) ? "without a package or object reference"
2773 : "on an undefined value");
2775 stash = gv_stashpvn(packname, packlen, TRUE);
2778 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2781 if (!ob || !(SvOBJECT(ob)
2782 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2785 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2789 stash = SvSTASH(ob);
2792 /* shortcut for simple names */
2794 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2796 gv = (GV*)HeVAL(he);
2797 if (isGV(gv) && GvCV(gv) &&
2798 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2799 return (SV*)GvCV(gv);
2803 gv = gv_fetchmethod(stash, name);
2810 for (p = name; *p; p++) {
2812 sep = p, leaf = p + 1;
2813 else if (*p == ':' && *(p + 1) == ':')
2814 sep = p, leaf = p + 2;
2816 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2817 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2818 packlen = strlen(packname);
2822 packlen = sep - name;
2824 gv = gv_fetchpv(packname, 0, SVt_PVHV);
2825 if (gv && isGV(gv)) {
2827 "Can't locate object method \"%s\" via package \"%s\"",
2832 "Can't locate object method \"%s\" via package \"%s\""
2833 " (perhaps you forgot to load \"%s\"?)",
2834 leaf, packname, packname);
2837 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2842 unset_cvowner(pTHXo_ void *cvarg)
2844 register CV* cv = (CV *) cvarg;
2846 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2847 thr, cv, SvPEEK((SV*)cv))));
2848 MUTEX_LOCK(CvMUTEXP(cv));
2849 DEBUG_S(if (CvDEPTH(cv) != 0)
2850 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2852 assert(thr == CvOWNER(cv));
2854 MUTEX_UNLOCK(CvMUTEXP(cv));
2857 #endif /* USE_THREADS */