3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
29 static void unset_cvowner(pTHXo_ void *cvarg);
30 #endif /* USE_THREADS */
41 PL_curcop = (COP*)PL_op;
42 TAINT_NOT; /* Each statement is presumed innocent */
43 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
52 if (PL_op->op_private & OPpLVAL_INTRO)
53 PUSHs(save_scalar(cGVOP_gv));
55 PUSHs(GvSV(cGVOP_gv));
66 PL_curcop = (COP*)PL_op;
72 PUSHMARK(PL_stack_sp);
82 sv_setpvn(TARG,s,len);
83 if (SvUTF8(TOPs) && !IN_BYTE)
92 XPUSHs((SV*)cGVOP_gv);
103 RETURNOP(cLOGOP->op_other);
111 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
113 temp = left; left = right; right = temp;
115 if (PL_tainting && PL_tainted && !SvTAINTED(left))
117 SvSetMagicSV(right, left);
126 RETURNOP(cLOGOP->op_other);
128 RETURNOP(cLOGOP->op_next);
134 TAINT_NOT; /* Each statement is presumed innocent */
135 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
137 oldsave = PL_scopestack[PL_scopestack_ix - 1];
138 LEAVE_SCOPE(oldsave);
144 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
149 bool left_utf = DO_UTF8(left);
150 bool right_utf = DO_UTF8(right);
153 if (right_utf && !left_utf)
154 sv_utf8_upgrade(left);
158 if (left_utf && !right_utf)
159 sv_utf8_upgrade(right);
160 sv_insert(TARG, 0, 0, s, len);
161 if (left_utf || right_utf)
166 sv_setpvn(TARG,s,len);
168 else if (SvGMAGICAL(TARG)) {
170 if (right_utf && !left_utf)
171 sv_utf8_upgrade(left);
173 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
174 sv_setpv(TARG, ""); /* Suppress warning. */
175 s = SvPV_force(TARG, len);
177 if (left_utf && !right_utf)
178 sv_utf8_upgrade(right);
181 #if defined(PERL_Y2KWARN)
182 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
184 char *s = SvPV(TARG,n);
185 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
186 && (n == 2 || !isDIGIT(s[n-3])))
188 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
189 "about to append an integer to '19'");
193 sv_catpvn(TARG,s,len);
196 sv_setpvn(TARG,s,len); /* suppress warning */
197 if (left_utf || right_utf)
208 if (PL_op->op_flags & OPf_MOD) {
209 if (PL_op->op_private & OPpLVAL_INTRO)
210 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
211 else if (PL_op->op_private & OPpDEREF) {
213 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
222 tryAMAGICunTARGET(iter, 0);
223 PL_last_in_gv = (GV*)(*PL_stack_sp--);
224 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
225 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
226 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
229 XPUSHs((SV*)PL_last_in_gv);
232 PL_last_in_gv = (GV*)(*PL_stack_sp--);
235 return do_readline();
240 djSP; tryAMAGICbinSET(eq,0);
243 SETs(boolSV(TOPn == value));
251 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
252 DIE(aTHX_ PL_no_modify);
253 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
254 SvIVX(TOPs) != IV_MAX)
257 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
272 RETURNOP(cLOGOP->op_other);
278 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
281 SETn( left + right );
289 AV *av = GvAV(cGVOP_gv);
290 U32 lval = PL_op->op_flags & OPf_MOD;
291 SV** svp = av_fetch(av, PL_op->op_private, lval);
292 SV *sv = (svp ? *svp : &PL_sv_undef);
294 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
295 sv = sv_mortalcopy(sv);
302 djSP; dMARK; dTARGET;
304 do_join(TARG, *MARK, MARK, SP);
315 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
316 * will be enough to hold an OP*.
318 SV* sv = sv_newmortal();
319 sv_upgrade(sv, SVt_PVLV);
321 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
329 /* Oversized hot code. */
333 djSP; dMARK; dORIGMARK;
340 if (PL_op->op_flags & OPf_STACKED)
344 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
345 if (MARK == ORIGMARK) {
346 /* If using default handle then we need to make space to
347 * pass object as 1st arg, so move other args up ...
351 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
355 *MARK = SvTIED_obj((SV*)gv, mg);
358 call_method("PRINT", G_SCALAR);
366 if (!(io = GvIO(gv))) {
367 if (ckWARN(WARN_UNOPENED)) {
368 SV* sv = sv_newmortal();
369 gv_efullname3(sv, gv, Nullch);
370 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
373 SETERRNO(EBADF,RMS$_IFI);
376 else if (!(fp = IoOFP(io))) {
377 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
379 SV* sv = sv_newmortal();
380 gv_efullname3(sv, gv, Nullch);
381 Perl_warner(aTHX_ WARN_IO,
382 "Filehandle %s opened only for input",
385 else if (ckWARN(WARN_CLOSED))
386 report_closed_fh(gv, io, "print", "filehandle");
388 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
395 if (!do_print(*MARK, fp))
399 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
408 if (!do_print(*MARK, fp))
417 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
420 if (IoFLAGS(io) & IOf_FLUSH)
421 if (PerlIO_flush(fp) == EOF)
442 tryAMAGICunDEREF(to_av);
445 if (SvTYPE(av) != SVt_PVAV)
446 DIE(aTHX_ "Not an ARRAY reference");
447 if (PL_op->op_flags & OPf_REF) {
453 if (SvTYPE(sv) == SVt_PVAV) {
455 if (PL_op->op_flags & OPf_REF) {
463 if (SvTYPE(sv) != SVt_PVGV) {
467 if (SvGMAGICAL(sv)) {
473 if (PL_op->op_flags & OPf_REF ||
474 PL_op->op_private & HINT_STRICT_REFS)
475 DIE(aTHX_ PL_no_usym, "an ARRAY");
476 if (ckWARN(WARN_UNINITIALIZED))
478 if (GIMME == G_ARRAY) {
485 if ((PL_op->op_flags & OPf_SPECIAL) &&
486 !(PL_op->op_flags & OPf_MOD))
488 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
493 if (PL_op->op_private & HINT_STRICT_REFS)
494 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
495 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
502 if (PL_op->op_private & OPpLVAL_INTRO)
504 if (PL_op->op_flags & OPf_REF) {
511 if (GIMME == G_ARRAY) {
512 I32 maxarg = AvFILL(av) + 1;
513 (void)POPs; /* XXXX May be optimized away? */
515 if (SvRMAGICAL(av)) {
517 for (i=0; i < maxarg; i++) {
518 SV **svp = av_fetch(av, i, FALSE);
519 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
523 Copy(AvARRAY(av), SP+1, maxarg, SV*);
529 I32 maxarg = AvFILL(av) + 1;
542 tryAMAGICunDEREF(to_hv);
545 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
546 DIE(aTHX_ "Not a HASH reference");
547 if (PL_op->op_flags & OPf_REF) {
553 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
555 if (PL_op->op_flags & OPf_REF) {
563 if (SvTYPE(sv) != SVt_PVGV) {
567 if (SvGMAGICAL(sv)) {
573 if (PL_op->op_flags & OPf_REF ||
574 PL_op->op_private & HINT_STRICT_REFS)
575 DIE(aTHX_ PL_no_usym, "a HASH");
576 if (ckWARN(WARN_UNINITIALIZED))
578 if (GIMME == G_ARRAY) {
585 if ((PL_op->op_flags & OPf_SPECIAL) &&
586 !(PL_op->op_flags & OPf_MOD))
588 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
593 if (PL_op->op_private & HINT_STRICT_REFS)
594 DIE(aTHX_ PL_no_symref, sym, "a HASH");
595 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
602 if (PL_op->op_private & OPpLVAL_INTRO)
604 if (PL_op->op_flags & OPf_REF) {
611 if (GIMME == G_ARRAY) { /* array wanted */
612 *PL_stack_sp = (SV*)hv;
617 if (SvTYPE(hv) == SVt_PVAV)
618 hv = avhv_keys((AV*)hv);
620 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
621 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
631 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
637 leftop = ((BINOP*)PL_op)->op_last;
639 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
640 leftop = ((LISTOP*)leftop)->op_first;
642 /* Skip PUSHMARK and each element already assigned to. */
643 for (i = lelem - firstlelem; i > 0; i--) {
644 leftop = leftop->op_sibling;
647 if (leftop->op_type != OP_RV2HV)
652 av_fill(ary, 0); /* clear all but the fields hash */
653 if (lastrelem >= relem) {
654 while (relem < lastrelem) { /* gobble up all the rest */
658 /* Avoid a memory leak when avhv_store_ent dies. */
659 tmpstr = sv_newmortal();
660 sv_setsv(tmpstr,relem[1]); /* value */
662 if (avhv_store_ent(ary,relem[0],tmpstr,0))
663 (void)SvREFCNT_inc(tmpstr);
664 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
670 if (relem == lastrelem)
676 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
680 if (ckWARN(WARN_MISC)) {
681 if (relem == firstrelem &&
683 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
684 SvTYPE(SvRV(*relem)) == SVt_PVHV))
686 Perl_warner(aTHX_ WARN_MISC,
687 "Reference found where even-sized list expected");
690 Perl_warner(aTHX_ WARN_MISC,
691 "Odd number of elements in hash assignment");
693 if (SvTYPE(hash) == SVt_PVAV) {
695 tmpstr = sv_newmortal();
696 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
697 (void)SvREFCNT_inc(tmpstr);
698 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
703 tmpstr = NEWSV(29,0);
704 didstore = hv_store_ent(hash,*relem,tmpstr,0);
705 if (SvMAGICAL(hash)) {
706 if (SvSMAGICAL(tmpstr))
719 SV **lastlelem = PL_stack_sp;
720 SV **lastrelem = PL_stack_base + POPMARK;
721 SV **firstrelem = PL_stack_base + POPMARK + 1;
722 SV **firstlelem = lastrelem + 1;
735 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
737 /* If there's a common identifier on both sides we have to take
738 * special care that assigning the identifier on the left doesn't
739 * clobber a value on the right that's used later in the list.
741 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
742 EXTEND_MORTAL(lastrelem - firstrelem + 1);
743 for (relem = firstrelem; relem <= lastrelem; relem++) {
746 TAINT_NOT; /* Each item is independent */
747 *relem = sv_mortalcopy(sv);
757 while (lelem <= lastlelem) {
758 TAINT_NOT; /* Each item stands on its own, taintwise. */
760 switch (SvTYPE(sv)) {
763 magic = SvMAGICAL(ary) != 0;
764 if (PL_op->op_private & OPpASSIGN_HASH) {
765 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
771 do_oddball((HV*)ary, relem, firstrelem);
773 relem = lastrelem + 1;
778 av_extend(ary, lastrelem - relem);
780 while (relem <= lastrelem) { /* gobble up all the rest */
786 didstore = av_store(ary,i++,sv);
796 case SVt_PVHV: { /* normal hash */
800 magic = SvMAGICAL(hash) != 0;
803 while (relem < lastrelem) { /* gobble up all the rest */
808 sv = &PL_sv_no, relem++;
809 tmpstr = NEWSV(29,0);
811 sv_setsv(tmpstr,*relem); /* value */
813 didstore = hv_store_ent(hash,sv,tmpstr,0);
815 if (SvSMAGICAL(tmpstr))
822 if (relem == lastrelem) {
823 do_oddball(hash, relem, firstrelem);
829 if (SvIMMORTAL(sv)) {
830 if (relem <= lastrelem)
834 if (relem <= lastrelem) {
835 sv_setsv(sv, *relem);
839 sv_setsv(sv, &PL_sv_undef);
844 if (PL_delaymagic & ~DM_DELAY) {
845 if (PL_delaymagic & DM_UID) {
847 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
850 (void)setreuid(PL_uid,PL_euid);
853 if ((PL_delaymagic & DM_UID) == DM_RUID) {
854 (void)setruid(PL_uid);
855 PL_delaymagic &= ~DM_RUID;
857 # endif /* HAS_SETRUID */
859 if ((PL_delaymagic & DM_UID) == DM_EUID) {
860 (void)seteuid(PL_uid);
861 PL_delaymagic &= ~DM_EUID;
863 # endif /* HAS_SETEUID */
864 if (PL_delaymagic & DM_UID) {
865 if (PL_uid != PL_euid)
866 DIE(aTHX_ "No setreuid available");
867 (void)PerlProc_setuid(PL_uid);
869 # endif /* HAS_SETREUID */
870 #endif /* HAS_SETRESUID */
871 PL_uid = PerlProc_getuid();
872 PL_euid = PerlProc_geteuid();
874 if (PL_delaymagic & DM_GID) {
876 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
879 (void)setregid(PL_gid,PL_egid);
882 if ((PL_delaymagic & DM_GID) == DM_RGID) {
883 (void)setrgid(PL_gid);
884 PL_delaymagic &= ~DM_RGID;
886 # endif /* HAS_SETRGID */
888 if ((PL_delaymagic & DM_GID) == DM_EGID) {
889 (void)setegid(PL_gid);
890 PL_delaymagic &= ~DM_EGID;
892 # endif /* HAS_SETEGID */
893 if (PL_delaymagic & DM_GID) {
894 if (PL_gid != PL_egid)
895 DIE(aTHX_ "No setregid available");
896 (void)PerlProc_setgid(PL_gid);
898 # endif /* HAS_SETREGID */
899 #endif /* HAS_SETRESGID */
900 PL_gid = PerlProc_getgid();
901 PL_egid = PerlProc_getegid();
903 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
910 else if (gimme == G_SCALAR) {
913 SETi(lastrelem - firstrelem + 1);
919 SP = firstrelem + (lastlelem - firstlelem);
920 lelem = firstlelem + (relem - firstrelem);
922 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
930 register PMOP *pm = cPMOP;
931 SV *rv = sv_newmortal();
932 SV *sv = newSVrv(rv, "Regexp");
933 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
940 register PMOP *pm = cPMOP;
945 I32 r_flags = REXEC_CHECKED;
946 char *truebase; /* Start of string */
947 register REGEXP *rx = pm->op_pmregexp;
952 I32 oldsave = PL_savestack_ix;
953 I32 update_minmatch = 1;
956 if (PL_op->op_flags & OPf_STACKED)
962 PUTBACK; /* EVAL blocks need stack_sp. */
966 DIE(aTHX_ "panic: do_match");
967 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
968 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
971 if (pm->op_pmdynflags & PMdf_USED) {
973 if (gimme == G_ARRAY)
978 if (!rx->prelen && PL_curpm) {
980 rx = pm->op_pmregexp;
982 if (rx->minlen > len) goto failure;
986 /* XXXX What part of this is needed with true \G-support? */
987 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
989 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
990 MAGIC* mg = mg_find(TARG, 'g');
991 if (mg && mg->mg_len >= 0) {
992 if (!(rx->reganch & ROPT_GPOS_SEEN))
993 rx->endp[0] = rx->startp[0] = mg->mg_len;
994 else if (rx->reganch & ROPT_ANCH_GPOS) {
995 r_flags |= REXEC_IGNOREPOS;
996 rx->endp[0] = rx->startp[0] = mg->mg_len;
998 minmatch = (mg->mg_flags & MGf_MINMATCH);
1003 if ((gimme != G_ARRAY && !global && rx->nparens)
1004 || SvTEMP(TARG) || PL_sawampersand)
1005 r_flags |= REXEC_COPY_STR;
1007 r_flags |= REXEC_SCREAM;
1009 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1010 SAVEINT(PL_multiline);
1011 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1015 if (global && rx->startp[0] != -1) {
1016 t = s = rx->endp[0] + truebase;
1017 if ((s + rx->minlen) > strend)
1019 if (update_minmatch++)
1020 minmatch = had_zerolen;
1022 if (rx->reganch & RE_USE_INTUIT) {
1023 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1027 if ( (rx->reganch & ROPT_CHECK_ALL)
1029 && ((rx->reganch & ROPT_NOSCAN)
1030 || !((rx->reganch & RE_INTUIT_TAIL)
1031 && (r_flags & REXEC_SCREAM)))
1032 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1035 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1038 if (pm->op_pmflags & PMf_ONCE)
1039 pm->op_pmdynflags |= PMdf_USED;
1048 RX_MATCH_TAINTED_on(rx);
1049 TAINT_IF(RX_MATCH_TAINTED(rx));
1050 if (gimme == G_ARRAY) {
1053 iters = rx->nparens;
1054 if (global && !iters)
1058 SPAGAIN; /* EVAL blocks could move the stack. */
1059 EXTEND(SP, iters + i);
1060 EXTEND_MORTAL(iters + i);
1061 for (i = !i; i <= iters; i++) {
1062 PUSHs(sv_newmortal());
1064 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1065 len = rx->endp[i] - rx->startp[i];
1066 s = rx->startp[i] + truebase;
1067 sv_setpvn(*SP, s, len);
1068 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1070 sv_utf8_downgrade(*SP, TRUE);
1075 had_zerolen = (rx->startp[0] != -1
1076 && rx->startp[0] == rx->endp[0]);
1077 PUTBACK; /* EVAL blocks may use stack */
1078 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1083 LEAVE_SCOPE(oldsave);
1089 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1090 mg = mg_find(TARG, 'g');
1092 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1093 mg = mg_find(TARG, 'g');
1095 if (rx->startp[0] != -1) {
1096 mg->mg_len = rx->endp[0];
1097 if (rx->startp[0] == rx->endp[0])
1098 mg->mg_flags |= MGf_MINMATCH;
1100 mg->mg_flags &= ~MGf_MINMATCH;
1103 LEAVE_SCOPE(oldsave);
1107 yup: /* Confirmed by INTUIT */
1109 RX_MATCH_TAINTED_on(rx);
1110 TAINT_IF(RX_MATCH_TAINTED(rx));
1112 if (pm->op_pmflags & PMf_ONCE)
1113 pm->op_pmdynflags |= PMdf_USED;
1114 if (RX_MATCH_COPIED(rx))
1115 Safefree(rx->subbeg);
1116 RX_MATCH_COPIED_off(rx);
1117 rx->subbeg = Nullch;
1119 rx->subbeg = truebase;
1120 rx->startp[0] = s - truebase;
1121 rx->endp[0] = s - truebase + rx->minlen;
1122 rx->sublen = strend - truebase;
1125 if (PL_sawampersand) {
1128 rx->subbeg = savepvn(t, strend - t);
1129 rx->sublen = strend - t;
1130 RX_MATCH_COPIED_on(rx);
1131 off = rx->startp[0] = s - t;
1132 rx->endp[0] = off + rx->minlen;
1134 else { /* startp/endp are used by @- @+. */
1135 rx->startp[0] = s - truebase;
1136 rx->endp[0] = s - truebase + rx->minlen;
1138 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1139 LEAVE_SCOPE(oldsave);
1144 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1145 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1146 MAGIC* mg = mg_find(TARG, 'g');
1151 LEAVE_SCOPE(oldsave);
1152 if (gimme == G_ARRAY)
1158 Perl_do_readline(pTHX)
1160 dSP; dTARGETSTACKED;
1165 register IO *io = GvIO(PL_last_in_gv);
1166 register I32 type = PL_op->op_type;
1167 I32 gimme = GIMME_V;
1170 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1172 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1175 call_method("READLINE", gimme);
1178 if (gimme == G_SCALAR)
1179 SvSetMagicSV_nosteal(TARG, TOPs);
1186 if (IoFLAGS(io) & IOf_ARGV) {
1187 if (IoFLAGS(io) & IOf_START) {
1189 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1190 IoFLAGS(io) &= ~IOf_START;
1191 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1192 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1193 SvSETMAGIC(GvSV(PL_last_in_gv));
1198 fp = nextargv(PL_last_in_gv);
1199 if (!fp) { /* Note: fp != IoIFP(io) */
1200 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1203 else if (type == OP_GLOB) {
1204 SV *tmpcmd = NEWSV(55, 0);
1208 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1209 /* since spawning off a process is a real performance hit */
1211 #include <descrip.h>
1212 #include <lib$routines.h>
1215 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1216 char vmsspec[NAM$C_MAXRSS+1];
1217 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1218 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1219 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1222 struct dsc$descriptor_s wilddsc
1223 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1224 struct dsc$descriptor_vs rsdsc
1225 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1226 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1228 /* We could find out if there's an explicit dev/dir or version
1229 by peeking into lib$find_file's internal context at
1230 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1231 but that's unsupported, so I don't want to do it now and
1232 have it bite someone in the future. */
1233 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1234 cp = SvPV(tmpglob,i);
1236 if (cp[i] == ';') hasver = 1;
1238 if (sts) hasver = 1;
1242 hasdir = isunix = 1;
1245 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1250 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1252 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1253 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1254 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1255 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1256 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1257 &dfltdsc,NULL,NULL,NULL))&1)) {
1258 end = rstr + (unsigned long int) *rslt;
1259 if (!hasver) while (*end != ';') end--;
1260 *(end++) = '\n'; *end = '\0';
1261 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1263 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1268 while (*(--begin) != ']' && *begin != '>') ;
1271 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1273 if (cxt) (void)lib$find_file_end(&cxt);
1274 if (ok && sts != RMS$_NMF &&
1275 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1278 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1280 PerlIO_close(tmpfp);
1284 PerlIO_rewind(tmpfp);
1286 IoIFP(io) = fp = tmpfp;
1287 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1292 #ifdef MACOS_TRADITIONAL
1293 sv_setpv(tmpcmd, "glob ");
1294 sv_catsv(tmpcmd, tmpglob);
1295 sv_catpv(tmpcmd, " |");
1299 sv_setpv(tmpcmd, "for a in ");
1300 sv_catsv(tmpcmd, tmpglob);
1301 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1304 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1305 sv_catsv(tmpcmd, tmpglob);
1307 sv_setpv(tmpcmd, "perlglob ");
1308 sv_catsv(tmpcmd, tmpglob);
1309 sv_catpv(tmpcmd, " |");
1314 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1315 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1316 sv_catsv(tmpcmd, tmpglob);
1317 sv_catpv(tmpcmd, "' 2>/dev/null |");
1319 sv_setpv(tmpcmd, "echo ");
1320 sv_catsv(tmpcmd, tmpglob);
1322 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1324 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1327 #endif /* !DOSISH */
1328 #endif /* MACOS_TRADITIONAL */
1329 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1330 FALSE, O_RDONLY, 0, Nullfp);
1336 else if (type == OP_GLOB)
1338 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1339 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1340 || fp == PerlIO_stderr()))
1342 SV* sv = sv_newmortal();
1343 gv_efullname3(sv, PL_last_in_gv, Nullch);
1344 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1349 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1350 if (type == OP_GLOB)
1351 Perl_warner(aTHX_ WARN_GLOB,
1352 "glob failed (can't start child: %s)",
1355 report_closed_fh(PL_last_in_gv, io, "readline", "filehandle");
1357 if (gimme == G_SCALAR) {
1358 (void)SvOK_off(TARG);
1364 if (gimme == G_SCALAR) {
1368 (void)SvUPGRADE(sv, SVt_PV);
1369 tmplen = SvLEN(sv); /* remember if already alloced */
1371 Sv_Grow(sv, 80); /* try short-buffering it */
1372 if (type == OP_RCATLINE)
1378 sv = sv_2mortal(NEWSV(57, 80));
1382 /* delay EOF state for a snarfed empty file */
1383 #define SNARF_EOF(gimme,rs,io,sv) \
1384 (gimme != G_SCALAR || SvCUR(sv) \
1385 || !RsSNARF(rs) || (IoFLAGS(io) & IOf_NOLINE) \
1386 || ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1389 if (!sv_gets(sv, fp, offset)
1390 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1392 PerlIO_clearerr(fp);
1393 if (IoFLAGS(io) & IOf_ARGV) {
1394 fp = nextargv(PL_last_in_gv);
1397 (void)do_close(PL_last_in_gv, FALSE);
1399 else if (type == OP_GLOB) {
1400 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1401 Perl_warner(aTHX_ WARN_GLOB,
1402 "glob failed (child exited with status %d%s)",
1403 (int)(STATUS_CURRENT >> 8),
1404 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1407 if (gimme == G_SCALAR) {
1408 (void)SvOK_off(TARG);
1413 /* This should not be marked tainted if the fp is marked clean */
1414 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1421 if (type == OP_GLOB) {
1424 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1425 tmps = SvEND(sv) - 1;
1426 if (*tmps == *SvPVX(PL_rs)) {
1431 for (tmps = SvPVX(sv); *tmps; tmps++)
1432 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1433 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1435 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1436 (void)POPs; /* Unmatched wildcard? Chuck it... */
1440 if (gimme == G_ARRAY) {
1441 if (SvLEN(sv) - SvCUR(sv) > 20) {
1442 SvLEN_set(sv, SvCUR(sv)+1);
1443 Renew(SvPVX(sv), SvLEN(sv), char);
1445 sv = sv_2mortal(NEWSV(58, 80));
1448 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1449 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1453 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1454 Renew(SvPVX(sv), SvLEN(sv), char);
1463 register PERL_CONTEXT *cx;
1464 I32 gimme = OP_GIMME(PL_op, -1);
1467 if (cxstack_ix >= 0)
1468 gimme = cxstack[cxstack_ix].blk_gimme;
1476 PUSHBLOCK(cx, CXt_BLOCK, SP);
1488 U32 lval = PL_op->op_flags & OPf_MOD;
1489 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1492 if (SvTYPE(hv) == SVt_PVHV) {
1493 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1494 svp = he ? &HeVAL(he) : 0;
1496 else if (SvTYPE(hv) == SVt_PVAV) {
1497 if (PL_op->op_private & OPpLVAL_INTRO)
1498 DIE(aTHX_ "Can't localize pseudo-hash element");
1499 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1505 if (!svp || *svp == &PL_sv_undef) {
1510 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1512 lv = sv_newmortal();
1513 sv_upgrade(lv, SVt_PVLV);
1515 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1516 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1517 LvTARG(lv) = SvREFCNT_inc(hv);
1522 if (PL_op->op_private & OPpLVAL_INTRO) {
1523 if (HvNAME(hv) && isGV(*svp))
1524 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1526 save_helem(hv, keysv, svp);
1528 else if (PL_op->op_private & OPpDEREF)
1529 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1531 sv = (svp ? *svp : &PL_sv_undef);
1532 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1533 * Pushing the magical RHS on to the stack is useless, since
1534 * that magic is soon destined to be misled by the local(),
1535 * and thus the later pp_sassign() will fail to mg_get() the
1536 * old value. This should also cure problems with delayed
1537 * mg_get()s. GSAR 98-07-03 */
1538 if (!lval && SvGMAGICAL(sv))
1539 sv = sv_mortalcopy(sv);
1547 register PERL_CONTEXT *cx;
1553 if (PL_op->op_flags & OPf_SPECIAL) {
1554 cx = &cxstack[cxstack_ix];
1555 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1560 gimme = OP_GIMME(PL_op, -1);
1562 if (cxstack_ix >= 0)
1563 gimme = cxstack[cxstack_ix].blk_gimme;
1569 if (gimme == G_VOID)
1571 else if (gimme == G_SCALAR) {
1574 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1577 *MARK = sv_mortalcopy(TOPs);
1580 *MARK = &PL_sv_undef;
1584 else if (gimme == G_ARRAY) {
1585 /* in case LEAVE wipes old return values */
1586 for (mark = newsp + 1; mark <= SP; mark++) {
1587 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1588 *mark = sv_mortalcopy(*mark);
1589 TAINT_NOT; /* Each item is independent */
1593 PL_curpm = newpm; /* Don't pop $1 et al till now */
1603 register PERL_CONTEXT *cx;
1609 cx = &cxstack[cxstack_ix];
1610 if (CxTYPE(cx) != CXt_LOOP)
1611 DIE(aTHX_ "panic: pp_iter");
1613 itersvp = CxITERVAR(cx);
1614 av = cx->blk_loop.iterary;
1615 if (SvTYPE(av) != SVt_PVAV) {
1616 /* iterate ($min .. $max) */
1617 if (cx->blk_loop.iterlval) {
1618 /* string increment */
1619 register SV* cur = cx->blk_loop.iterlval;
1621 char *max = SvPV((SV*)av, maxlen);
1622 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1623 #ifndef USE_THREADS /* don't risk potential race */
1624 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1625 /* safe to reuse old SV */
1626 sv_setsv(*itersvp, cur);
1631 /* we need a fresh SV every time so that loop body sees a
1632 * completely new SV for closures/references to work as
1634 SvREFCNT_dec(*itersvp);
1635 *itersvp = newSVsv(cur);
1637 if (strEQ(SvPVX(cur), max))
1638 sv_setiv(cur, 0); /* terminate next time */
1645 /* integer increment */
1646 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1649 #ifndef USE_THREADS /* don't risk potential race */
1650 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1651 /* safe to reuse old SV */
1652 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1657 /* we need a fresh SV every time so that loop body sees a
1658 * completely new SV for closures/references to work as they
1660 SvREFCNT_dec(*itersvp);
1661 *itersvp = newSViv(cx->blk_loop.iterix++);
1667 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1670 SvREFCNT_dec(*itersvp);
1672 if ((sv = SvMAGICAL(av)
1673 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1674 : AvARRAY(av)[++cx->blk_loop.iterix]))
1678 if (av != PL_curstack && SvIMMORTAL(sv)) {
1679 SV *lv = cx->blk_loop.iterlval;
1680 if (lv && SvREFCNT(lv) > 1) {
1685 SvREFCNT_dec(LvTARG(lv));
1687 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1688 sv_upgrade(lv, SVt_PVLV);
1690 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1692 LvTARG(lv) = SvREFCNT_inc(av);
1693 LvTARGOFF(lv) = cx->blk_loop.iterix;
1694 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1698 *itersvp = SvREFCNT_inc(sv);
1705 register PMOP *pm = cPMOP;
1721 register REGEXP *rx = pm->op_pmregexp;
1723 int force_on_match = 0;
1724 I32 oldsave = PL_savestack_ix;
1726 /* known replacement string? */
1727 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1728 if (PL_op->op_flags & OPf_STACKED)
1734 if (SvREADONLY(TARG)
1735 || (SvTYPE(TARG) > SVt_PVLV
1736 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1737 DIE(aTHX_ PL_no_modify);
1740 s = SvPV(TARG, len);
1741 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1743 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1744 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1751 DIE(aTHX_ "panic: do_subst");
1754 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1755 position, once with zero-length,
1756 second time with non-zero. */
1758 if (!rx->prelen && PL_curpm) {
1760 rx = pm->op_pmregexp;
1762 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1763 ? REXEC_COPY_STR : 0;
1765 r_flags |= REXEC_SCREAM;
1766 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1767 SAVEINT(PL_multiline);
1768 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1771 if (rx->reganch & RE_USE_INTUIT) {
1772 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1776 /* How to do it in subst? */
1777 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1779 && ((rx->reganch & ROPT_NOSCAN)
1780 || !((rx->reganch & RE_INTUIT_TAIL)
1781 && (r_flags & REXEC_SCREAM))))
1786 /* only replace once? */
1787 once = !(rpm->op_pmflags & PMf_GLOBAL);
1789 /* known replacement string? */
1790 c = dstr ? SvPV(dstr, clen) : Nullch;
1792 /* can do inplace substitution? */
1793 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1794 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1795 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1796 r_flags | REXEC_CHECKED))
1800 LEAVE_SCOPE(oldsave);
1803 if (force_on_match) {
1805 s = SvPV_force(TARG, len);
1810 SvSCREAM_off(TARG); /* disable possible screamer */
1812 rxtainted |= RX_MATCH_TAINTED(rx);
1813 m = orig + rx->startp[0];
1814 d = orig + rx->endp[0];
1816 if (m - s > strend - d) { /* faster to shorten from end */
1818 Copy(c, m, clen, char);
1823 Move(d, m, i, char);
1827 SvCUR_set(TARG, m - s);
1830 else if ((i = m - s)) { /* faster from front */
1838 Copy(c, m, clen, char);
1843 Copy(c, d, clen, char);
1848 TAINT_IF(rxtainted & 1);
1854 if (iters++ > maxiters)
1855 DIE(aTHX_ "Substitution loop");
1856 rxtainted |= RX_MATCH_TAINTED(rx);
1857 m = rx->startp[0] + orig;
1861 Move(s, d, i, char);
1865 Copy(c, d, clen, char);
1868 s = rx->endp[0] + orig;
1869 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1871 /* don't match same null twice */
1872 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1875 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1876 Move(s, d, i+1, char); /* include the NUL */
1878 TAINT_IF(rxtainted & 1);
1880 PUSHs(sv_2mortal(newSViv((I32)iters)));
1882 (void)SvPOK_only(TARG);
1883 TAINT_IF(rxtainted);
1884 if (SvSMAGICAL(TARG)) {
1890 LEAVE_SCOPE(oldsave);
1894 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1895 r_flags | REXEC_CHECKED))
1897 if (force_on_match) {
1899 s = SvPV_force(TARG, len);
1902 rxtainted |= RX_MATCH_TAINTED(rx);
1903 dstr = NEWSV(25, len);
1904 sv_setpvn(dstr, m, s-m);
1907 register PERL_CONTEXT *cx;
1910 RETURNOP(cPMOP->op_pmreplroot);
1912 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1914 if (iters++ > maxiters)
1915 DIE(aTHX_ "Substitution loop");
1916 rxtainted |= RX_MATCH_TAINTED(rx);
1917 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1922 strend = s + (strend - m);
1924 m = rx->startp[0] + orig;
1925 sv_catpvn(dstr, s, m-s);
1926 s = rx->endp[0] + orig;
1928 sv_catpvn(dstr, c, clen);
1931 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1932 sv_catpvn(dstr, s, strend - s);
1934 (void)SvOOK_off(TARG);
1935 Safefree(SvPVX(TARG));
1936 SvPVX(TARG) = SvPVX(dstr);
1937 SvCUR_set(TARG, SvCUR(dstr));
1938 SvLEN_set(TARG, SvLEN(dstr));
1942 TAINT_IF(rxtainted & 1);
1944 PUSHs(sv_2mortal(newSViv((I32)iters)));
1946 (void)SvPOK_only(TARG);
1947 TAINT_IF(rxtainted);
1950 LEAVE_SCOPE(oldsave);
1959 LEAVE_SCOPE(oldsave);
1968 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1969 ++*PL_markstack_ptr;
1970 LEAVE; /* exit inner scope */
1973 if (PL_stack_base + *PL_markstack_ptr > SP) {
1975 I32 gimme = GIMME_V;
1977 LEAVE; /* exit outer scope */
1978 (void)POPMARK; /* pop src */
1979 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1980 (void)POPMARK; /* pop dst */
1981 SP = PL_stack_base + POPMARK; /* pop original mark */
1982 if (gimme == G_SCALAR) {
1986 else if (gimme == G_ARRAY)
1993 ENTER; /* enter inner scope */
1996 src = PL_stack_base[*PL_markstack_ptr];
2000 RETURNOP(cLOGOP->op_other);
2011 register PERL_CONTEXT *cx;
2017 if (gimme == G_SCALAR) {
2020 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2022 *MARK = SvREFCNT_inc(TOPs);
2027 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2029 *MARK = sv_mortalcopy(sv);
2034 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2038 *MARK = &PL_sv_undef;
2042 else if (gimme == G_ARRAY) {
2043 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2044 if (!SvTEMP(*MARK)) {
2045 *MARK = sv_mortalcopy(*MARK);
2046 TAINT_NOT; /* Each item is independent */
2052 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2053 PL_curpm = newpm; /* ... and pop $1 et al */
2057 return pop_return();
2060 /* This duplicates the above code because the above code must not
2061 * get any slower by more conditions */
2069 register PERL_CONTEXT *cx;
2076 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2077 /* We are an argument to a function or grep().
2078 * This kind of lvalueness was legal before lvalue
2079 * subroutines too, so be backward compatible:
2080 * cannot report errors. */
2082 /* Scalar context *is* possible, on the LHS of -> only,
2083 * as in f()->meth(). But this is not an lvalue. */
2084 if (gimme == G_SCALAR)
2086 if (gimme == G_ARRAY) {
2087 if (!CvLVALUE(cx->blk_sub.cv))
2088 goto temporise_array;
2089 EXTEND_MORTAL(SP - newsp);
2090 for (mark = newsp + 1; mark <= SP; mark++) {
2093 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2094 *mark = sv_mortalcopy(*mark);
2096 /* Can be a localized value subject to deletion. */
2097 PL_tmps_stack[++PL_tmps_ix] = *mark;
2098 (void)SvREFCNT_inc(*mark);
2103 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2104 /* Here we go for robustness, not for speed, so we change all
2105 * the refcounts so the caller gets a live guy. Cannot set
2106 * TEMP, so sv_2mortal is out of question. */
2107 if (!CvLVALUE(cx->blk_sub.cv)) {
2112 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2114 if (gimme == G_SCALAR) {
2118 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2123 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2124 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2126 else { /* Can be a localized value
2127 * subject to deletion. */
2128 PL_tmps_stack[++PL_tmps_ix] = *mark;
2129 (void)SvREFCNT_inc(*mark);
2132 else { /* Should not happen? */
2137 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2138 (MARK > SP ? "Empty array" : "Array"));
2142 else if (gimme == G_ARRAY) {
2143 EXTEND_MORTAL(SP - newsp);
2144 for (mark = newsp + 1; mark <= SP; mark++) {
2145 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2146 /* Might be flattened array after $#array = */
2152 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2153 (*mark != &PL_sv_undef)
2155 ? "a readonly value" : "a temporary")
2156 : "an uninitialized value");
2159 /* Can be a localized value subject to deletion. */
2160 PL_tmps_stack[++PL_tmps_ix] = *mark;
2161 (void)SvREFCNT_inc(*mark);
2167 if (gimme == G_SCALAR) {
2171 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2173 *MARK = SvREFCNT_inc(TOPs);
2178 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2180 *MARK = sv_mortalcopy(sv);
2185 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2189 *MARK = &PL_sv_undef;
2193 else if (gimme == G_ARRAY) {
2195 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2196 if (!SvTEMP(*MARK)) {
2197 *MARK = sv_mortalcopy(*MARK);
2198 TAINT_NOT; /* Each item is independent */
2205 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2206 PL_curpm = newpm; /* ... and pop $1 et al */
2210 return pop_return();
2215 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2218 SV *dbsv = GvSV(PL_DBsub);
2220 if (!PERLDB_SUB_NN) {
2224 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2225 || strEQ(GvNAME(gv), "END")
2226 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2227 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2228 && (gv = (GV*)*svp) ))) {
2229 /* Use GV from the stack as a fallback. */
2230 /* GV is potentially non-unique, or contain different CV. */
2231 sv_setsv(dbsv, newRV((SV*)cv));
2234 gv_efullname3(dbsv, gv, Nullch);
2238 (void)SvUPGRADE(dbsv, SVt_PVIV);
2239 (void)SvIOK_on(dbsv);
2240 SAVEIV(SvIVX(dbsv));
2241 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2245 PL_curcopdb = PL_curcop;
2246 cv = GvCV(PL_DBsub);
2256 register PERL_CONTEXT *cx;
2258 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2261 DIE(aTHX_ "Not a CODE reference");
2262 switch (SvTYPE(sv)) {
2268 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2270 SP = PL_stack_base + POPMARK;
2273 if (SvGMAGICAL(sv)) {
2275 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2278 sym = SvPV(sv, n_a);
2280 DIE(aTHX_ PL_no_usym, "a subroutine");
2281 if (PL_op->op_private & HINT_STRICT_REFS)
2282 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2283 cv = get_cv(sym, TRUE);
2287 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2288 tryAMAGICunDEREF(to_cv);
2291 if (SvTYPE(cv) == SVt_PVCV)
2296 DIE(aTHX_ "Not a CODE reference");
2301 if (!(cv = GvCVu((GV*)sv)))
2302 cv = sv_2cv(sv, &stash, &gv, FALSE);
2315 if (!CvROOT(cv) && !CvXSUB(cv)) {
2319 /* anonymous or undef'd function leaves us no recourse */
2320 if (CvANON(cv) || !(gv = CvGV(cv)))
2321 DIE(aTHX_ "Undefined subroutine called");
2323 /* autoloaded stub? */
2324 if (cv != GvCV(gv)) {
2327 /* should call AUTOLOAD now? */
2330 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2337 sub_name = sv_newmortal();
2338 gv_efullname3(sub_name, gv, Nullch);
2339 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2343 DIE(aTHX_ "Not a CODE reference");
2348 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2349 cv = get_db_sub(&sv, cv);
2351 DIE(aTHX_ "No DBsub routine");
2356 * First we need to check if the sub or method requires locking.
2357 * If so, we gain a lock on the CV, the first argument or the
2358 * stash (for static methods), as appropriate. This has to be
2359 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2360 * reschedule by returning a new op.
2362 MUTEX_LOCK(CvMUTEXP(cv));
2363 if (CvFLAGS(cv) & CVf_LOCKED) {
2365 if (CvFLAGS(cv) & CVf_METHOD) {
2366 if (SP > PL_stack_base + TOPMARK)
2367 sv = *(PL_stack_base + TOPMARK + 1);
2369 AV *av = (AV*)PL_curpad[0];
2370 if (hasargs || !av || AvFILLp(av) < 0
2371 || !(sv = AvARRAY(av)[0]))
2373 MUTEX_UNLOCK(CvMUTEXP(cv));
2374 DIE(aTHX_ "no argument for locked method call");
2381 char *stashname = SvPV(sv, len);
2382 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2388 MUTEX_UNLOCK(CvMUTEXP(cv));
2389 mg = condpair_magic(sv);
2390 MUTEX_LOCK(MgMUTEXP(mg));
2391 if (MgOWNER(mg) == thr)
2392 MUTEX_UNLOCK(MgMUTEXP(mg));
2395 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2397 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2399 MUTEX_UNLOCK(MgMUTEXP(mg));
2400 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2402 MUTEX_LOCK(CvMUTEXP(cv));
2405 * Now we have permission to enter the sub, we must distinguish
2406 * four cases. (0) It's an XSUB (in which case we don't care
2407 * about ownership); (1) it's ours already (and we're recursing);
2408 * (2) it's free (but we may already be using a cached clone);
2409 * (3) another thread owns it. Case (1) is easy: we just use it.
2410 * Case (2) means we look for a clone--if we have one, use it
2411 * otherwise grab ownership of cv. Case (3) means we look for a
2412 * clone (for non-XSUBs) and have to create one if we don't
2414 * Why look for a clone in case (2) when we could just grab
2415 * ownership of cv straight away? Well, we could be recursing,
2416 * i.e. we originally tried to enter cv while another thread
2417 * owned it (hence we used a clone) but it has been freed up
2418 * and we're now recursing into it. It may or may not be "better"
2419 * to use the clone but at least CvDEPTH can be trusted.
2421 if (CvOWNER(cv) == thr || CvXSUB(cv))
2422 MUTEX_UNLOCK(CvMUTEXP(cv));
2424 /* Case (2) or (3) */
2428 * XXX Might it be better to release CvMUTEXP(cv) while we
2429 * do the hv_fetch? We might find someone has pinched it
2430 * when we look again, in which case we would be in case
2431 * (3) instead of (2) so we'd have to clone. Would the fact
2432 * that we released the mutex more quickly make up for this?
2434 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2436 /* We already have a clone to use */
2437 MUTEX_UNLOCK(CvMUTEXP(cv));
2439 DEBUG_S(PerlIO_printf(Perl_debug_log,
2440 "entersub: %p already has clone %p:%s\n",
2441 thr, cv, SvPEEK((SV*)cv)));
2444 if (CvDEPTH(cv) == 0)
2445 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2448 /* (2) => grab ownership of cv. (3) => make clone */
2452 MUTEX_UNLOCK(CvMUTEXP(cv));
2453 DEBUG_S(PerlIO_printf(Perl_debug_log,
2454 "entersub: %p grabbing %p:%s in stash %s\n",
2455 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2456 HvNAME(CvSTASH(cv)) : "(none)"));
2459 /* Make a new clone. */
2461 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2462 MUTEX_UNLOCK(CvMUTEXP(cv));
2463 DEBUG_S((PerlIO_printf(Perl_debug_log,
2464 "entersub: %p cloning %p:%s\n",
2465 thr, cv, SvPEEK((SV*)cv))));
2467 * We're creating a new clone so there's no race
2468 * between the original MUTEX_UNLOCK and the
2469 * SvREFCNT_inc since no one will be trying to undef
2470 * it out from underneath us. At least, I don't think
2473 clonecv = cv_clone(cv);
2474 SvREFCNT_dec(cv); /* finished with this */
2475 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2476 CvOWNER(clonecv) = thr;
2480 DEBUG_S(if (CvDEPTH(cv) != 0)
2481 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2483 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2486 #endif /* USE_THREADS */
2489 #ifdef PERL_XSUB_OLDSTYLE
2490 if (CvOLDSTYLE(cv)) {
2491 I32 (*fp3)(int,int,int);
2493 register I32 items = SP - MARK;
2494 /* We dont worry to copy from @_. */
2499 PL_stack_sp = mark + 1;
2500 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2501 items = (*fp3)(CvXSUBANY(cv).any_i32,
2502 MARK - PL_stack_base + 1,
2504 PL_stack_sp = PL_stack_base + items;
2507 #endif /* PERL_XSUB_OLDSTYLE */
2509 I32 markix = TOPMARK;
2514 /* Need to copy @_ to stack. Alternative may be to
2515 * switch stack to @_, and copy return values
2516 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2520 av = (AV*)PL_curpad[0];
2522 av = GvAV(PL_defgv);
2523 #endif /* USE_THREADS */
2524 items = AvFILLp(av) + 1; /* @_ is not tieable */
2527 /* Mark is at the end of the stack. */
2529 Copy(AvARRAY(av), SP + 1, items, SV*);
2534 /* We assume first XSUB in &DB::sub is the called one. */
2536 SAVEVPTR(PL_curcop);
2537 PL_curcop = PL_curcopdb;
2540 /* Do we need to open block here? XXXX */
2541 (void)(*CvXSUB(cv))(aTHXo_ cv);
2543 /* Enforce some sanity in scalar context. */
2544 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2545 if (markix > PL_stack_sp - PL_stack_base)
2546 *(PL_stack_base + markix) = &PL_sv_undef;
2548 *(PL_stack_base + markix) = *PL_stack_sp;
2549 PL_stack_sp = PL_stack_base + markix;
2557 register I32 items = SP - MARK;
2558 AV* padlist = CvPADLIST(cv);
2559 SV** svp = AvARRAY(padlist);
2560 push_return(PL_op->op_next);
2561 PUSHBLOCK(cx, CXt_SUB, MARK);
2564 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2565 * that eval'' ops within this sub know the correct lexical space.
2566 * Owing the speed considerations, we choose to search for the cv
2567 * in doeval() instead.
2569 if (CvDEPTH(cv) < 2)
2570 (void)SvREFCNT_inc(cv);
2571 else { /* save temporaries on recursion? */
2572 PERL_STACK_OVERFLOW_CHECK();
2573 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2575 AV *newpad = newAV();
2576 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2577 I32 ix = AvFILLp((AV*)svp[1]);
2578 I32 names_fill = AvFILLp((AV*)svp[0]);
2579 svp = AvARRAY(svp[0]);
2580 for ( ;ix > 0; ix--) {
2581 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2582 char *name = SvPVX(svp[ix]);
2583 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2584 || *name == '&') /* anonymous code? */
2586 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2588 else { /* our own lexical */
2590 av_store(newpad, ix, sv = (SV*)newAV());
2591 else if (*name == '%')
2592 av_store(newpad, ix, sv = (SV*)newHV());
2594 av_store(newpad, ix, sv = NEWSV(0,0));
2598 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2599 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2602 av_store(newpad, ix, sv = NEWSV(0,0));
2606 av = newAV(); /* will be @_ */
2608 av_store(newpad, 0, (SV*)av);
2609 AvFLAGS(av) = AVf_REIFY;
2610 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2611 AvFILLp(padlist) = CvDEPTH(cv);
2612 svp = AvARRAY(padlist);
2617 AV* av = (AV*)PL_curpad[0];
2619 items = AvFILLp(av) + 1;
2621 /* Mark is at the end of the stack. */
2623 Copy(AvARRAY(av), SP + 1, items, SV*);
2628 #endif /* USE_THREADS */
2629 SAVEVPTR(PL_curpad);
2630 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2633 #endif /* USE_THREADS */
2639 DEBUG_S(PerlIO_printf(Perl_debug_log,
2640 "%p entersub preparing @_\n", thr));
2642 av = (AV*)PL_curpad[0];
2644 /* @_ is normally not REAL--this should only ever
2645 * happen when DB::sub() calls things that modify @_ */
2651 cx->blk_sub.savearray = GvAV(PL_defgv);
2652 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2653 #endif /* USE_THREADS */
2654 cx->blk_sub.argarray = av;
2657 if (items > AvMAX(av) + 1) {
2659 if (AvARRAY(av) != ary) {
2660 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2661 SvPVX(av) = (char*)ary;
2663 if (items > AvMAX(av) + 1) {
2664 AvMAX(av) = items - 1;
2665 Renew(ary,items,SV*);
2667 SvPVX(av) = (char*)ary;
2670 Copy(MARK,AvARRAY(av),items,SV*);
2671 AvFILLp(av) = items - 1;
2679 /* warning must come *after* we fully set up the context
2680 * stuff so that __WARN__ handlers can safely dounwind()
2683 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2684 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2685 sub_crush_depth(cv);
2687 DEBUG_S(PerlIO_printf(Perl_debug_log,
2688 "%p entersub returning %p\n", thr, CvSTART(cv)));
2690 RETURNOP(CvSTART(cv));
2695 Perl_sub_crush_depth(pTHX_ CV *cv)
2698 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2700 SV* tmpstr = sv_newmortal();
2701 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2702 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2713 U32 lval = PL_op->op_flags & OPf_MOD;
2714 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2718 elem -= PL_curcop->cop_arybase;
2719 if (SvTYPE(av) != SVt_PVAV)
2721 svp = av_fetch(av, elem, lval && !defer);
2723 if (!svp || *svp == &PL_sv_undef) {
2726 DIE(aTHX_ PL_no_aelem, elem);
2727 lv = sv_newmortal();
2728 sv_upgrade(lv, SVt_PVLV);
2730 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2731 LvTARG(lv) = SvREFCNT_inc(av);
2732 LvTARGOFF(lv) = elem;
2737 if (PL_op->op_private & OPpLVAL_INTRO)
2738 save_aelem(av, elem, svp);
2739 else if (PL_op->op_private & OPpDEREF)
2740 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2742 sv = (svp ? *svp : &PL_sv_undef);
2743 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2744 sv = sv_mortalcopy(sv);
2750 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2756 Perl_croak(aTHX_ PL_no_modify);
2757 if (SvTYPE(sv) < SVt_RV)
2758 sv_upgrade(sv, SVt_RV);
2759 else if (SvTYPE(sv) >= SVt_PV) {
2760 (void)SvOOK_off(sv);
2761 Safefree(SvPVX(sv));
2762 SvLEN(sv) = SvCUR(sv) = 0;
2766 SvRV(sv) = NEWSV(355,0);
2769 SvRV(sv) = (SV*)newAV();
2772 SvRV(sv) = (SV*)newHV();
2787 if (SvTYPE(rsv) == SVt_PVCV) {
2793 SETs(method_common(sv, Null(U32*)));
2800 SV* sv = cSVOP->op_sv;
2801 U32 hash = SvUVX(sv);
2803 XPUSHs(method_common(sv, &hash));
2808 S_method_common(pTHX_ SV* meth, U32* hashp)
2819 name = SvPV(meth, namelen);
2820 sv = *(PL_stack_base + TOPMARK + 1);
2831 !(packname = SvPV(sv, packlen)) ||
2832 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2833 !(ob=(SV*)GvIO(iogv)))
2836 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2837 ? !isIDFIRST_utf8((U8*)packname)
2838 : !isIDFIRST(*packname)
2841 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2842 SvOK(sv) ? "without a package or object reference"
2843 : "on an undefined value");
2845 stash = gv_stashpvn(packname, packlen, TRUE);
2848 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2851 if (!ob || !(SvOBJECT(ob)
2852 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2855 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2859 stash = SvSTASH(ob);
2862 /* shortcut for simple names */
2864 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2866 gv = (GV*)HeVAL(he);
2867 if (isGV(gv) && GvCV(gv) &&
2868 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2869 return (SV*)GvCV(gv);
2873 gv = gv_fetchmethod(stash, name);
2879 for (p = name; *p; p++) {
2881 sep = p, leaf = p + 1;
2882 else if (*p == ':' && *(p + 1) == ':')
2883 sep = p, leaf = p + 2;
2885 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2886 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2887 packlen = strlen(packname);
2891 packlen = sep - name;
2894 "Can't locate object method \"%s\" via package \"%s\"",
2897 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2902 unset_cvowner(pTHXo_ void *cvarg)
2904 register CV* cv = (CV *) cvarg;
2907 #endif /* DEBUGGING */
2909 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2910 thr, cv, SvPEEK((SV*)cv))));
2911 MUTEX_LOCK(CvMUTEXP(cv));
2912 DEBUG_S(if (CvDEPTH(cv) != 0)
2913 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2915 assert(thr == CvOWNER(cv));
2917 MUTEX_UNLOCK(CvMUTEXP(cv));
2920 #endif /* USE_THREADS */