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);
153 sv_insert(TARG, 0, 0, s, len);
157 sv_setpvn(TARG,s,len);
159 else if (SvGMAGICAL(TARG))
161 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
162 sv_setpv(TARG, ""); /* Suppress warning. */
163 s = SvPV_force(TARG, len);
167 #if defined(PERL_Y2KWARN)
168 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
170 char *s = SvPV(TARG,n);
171 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
172 && (n == 2 || !isDIGIT(s[n-3])))
174 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
175 "about to append an integer to '19'");
180 sv_utf8_upgrade(TARG);
181 sv_catpvn(TARG,s,len);
186 else if (!SvUTF8(right)) {
191 sv_setpvn(TARG,s,len); /* suppress warning */
201 if (PL_op->op_flags & OPf_MOD) {
202 if (PL_op->op_private & OPpLVAL_INTRO)
203 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
204 else if (PL_op->op_private & OPpDEREF) {
206 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
215 tryAMAGICunTARGET(iter, 0);
216 PL_last_in_gv = (GV*)(*PL_stack_sp--);
217 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
218 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
219 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
222 XPUSHs((SV*)PL_last_in_gv);
225 PL_last_in_gv = (GV*)(*PL_stack_sp--);
228 return do_readline();
233 djSP; tryAMAGICbinSET(eq,0);
236 SETs(boolSV(TOPn == value));
244 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
245 DIE(aTHX_ PL_no_modify);
246 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
247 SvIVX(TOPs) != IV_MAX)
250 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
265 RETURNOP(cLOGOP->op_other);
271 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
274 SETn( left + right );
282 AV *av = GvAV(cGVOP_gv);
283 U32 lval = PL_op->op_flags & OPf_MOD;
284 SV** svp = av_fetch(av, PL_op->op_private, lval);
285 SV *sv = (svp ? *svp : &PL_sv_undef);
287 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
288 sv = sv_mortalcopy(sv);
295 djSP; dMARK; dTARGET;
297 do_join(TARG, *MARK, MARK, SP);
308 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
309 * will be enough to hold an OP*.
311 SV* sv = sv_newmortal();
312 sv_upgrade(sv, SVt_PVLV);
314 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
322 /* Oversized hot code. */
326 djSP; dMARK; dORIGMARK;
333 if (PL_op->op_flags & OPf_STACKED)
337 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
338 if (MARK == ORIGMARK) {
339 /* If using default handle then we need to make space to
340 * pass object as 1st arg, so move other args up ...
344 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
348 *MARK = SvTIED_obj((SV*)gv, mg);
351 call_method("PRINT", G_SCALAR);
359 if (!(io = GvIO(gv))) {
360 if (ckWARN(WARN_UNOPENED)) {
361 SV* sv = sv_newmortal();
362 gv_efullname3(sv, gv, Nullch);
363 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
366 SETERRNO(EBADF,RMS$_IFI);
369 else if (!(fp = IoOFP(io))) {
370 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
372 SV* sv = sv_newmortal();
373 gv_efullname3(sv, gv, Nullch);
374 Perl_warner(aTHX_ WARN_IO,
375 "Filehandle %s opened only for input",
378 else if (ckWARN(WARN_CLOSED))
379 report_closed_fh(gv, io, "print", "filehandle");
381 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
388 if (!do_print(*MARK, fp))
392 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
401 if (!do_print(*MARK, fp))
410 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
413 if (IoFLAGS(io) & IOf_FLUSH)
414 if (PerlIO_flush(fp) == EOF)
435 tryAMAGICunDEREF(to_av);
438 if (SvTYPE(av) != SVt_PVAV)
439 DIE(aTHX_ "Not an ARRAY reference");
440 if (PL_op->op_flags & OPf_REF) {
446 if (SvTYPE(sv) == SVt_PVAV) {
448 if (PL_op->op_flags & OPf_REF) {
456 if (SvTYPE(sv) != SVt_PVGV) {
460 if (SvGMAGICAL(sv)) {
466 if (PL_op->op_flags & OPf_REF ||
467 PL_op->op_private & HINT_STRICT_REFS)
468 DIE(aTHX_ PL_no_usym, "an ARRAY");
469 if (ckWARN(WARN_UNINITIALIZED))
471 if (GIMME == G_ARRAY) {
478 if ((PL_op->op_flags & OPf_SPECIAL) &&
479 !(PL_op->op_flags & OPf_MOD))
481 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
486 if (PL_op->op_private & HINT_STRICT_REFS)
487 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
488 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
495 if (PL_op->op_private & OPpLVAL_INTRO)
497 if (PL_op->op_flags & OPf_REF) {
504 if (GIMME == G_ARRAY) {
505 I32 maxarg = AvFILL(av) + 1;
506 (void)POPs; /* XXXX May be optimized away? */
508 if (SvRMAGICAL(av)) {
510 for (i=0; i < maxarg; i++) {
511 SV **svp = av_fetch(av, i, FALSE);
512 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
516 Copy(AvARRAY(av), SP+1, maxarg, SV*);
522 I32 maxarg = AvFILL(av) + 1;
535 tryAMAGICunDEREF(to_hv);
538 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
539 DIE(aTHX_ "Not a HASH reference");
540 if (PL_op->op_flags & OPf_REF) {
546 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
548 if (PL_op->op_flags & OPf_REF) {
556 if (SvTYPE(sv) != SVt_PVGV) {
560 if (SvGMAGICAL(sv)) {
566 if (PL_op->op_flags & OPf_REF ||
567 PL_op->op_private & HINT_STRICT_REFS)
568 DIE(aTHX_ PL_no_usym, "a HASH");
569 if (ckWARN(WARN_UNINITIALIZED))
571 if (GIMME == G_ARRAY) {
578 if ((PL_op->op_flags & OPf_SPECIAL) &&
579 !(PL_op->op_flags & OPf_MOD))
581 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
586 if (PL_op->op_private & HINT_STRICT_REFS)
587 DIE(aTHX_ PL_no_symref, sym, "a HASH");
588 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
595 if (PL_op->op_private & OPpLVAL_INTRO)
597 if (PL_op->op_flags & OPf_REF) {
604 if (GIMME == G_ARRAY) { /* array wanted */
605 *PL_stack_sp = (SV*)hv;
610 if (SvTYPE(hv) == SVt_PVAV)
611 hv = avhv_keys((AV*)hv);
613 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
614 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
624 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
630 leftop = ((BINOP*)PL_op)->op_last;
632 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
633 leftop = ((LISTOP*)leftop)->op_first;
635 /* Skip PUSHMARK and each element already assigned to. */
636 for (i = lelem - firstlelem; i > 0; i--) {
637 leftop = leftop->op_sibling;
640 if (leftop->op_type != OP_RV2HV)
645 av_fill(ary, 0); /* clear all but the fields hash */
646 if (lastrelem >= relem) {
647 while (relem < lastrelem) { /* gobble up all the rest */
651 /* Avoid a memory leak when avhv_store_ent dies. */
652 tmpstr = sv_newmortal();
653 sv_setsv(tmpstr,relem[1]); /* value */
655 if (avhv_store_ent(ary,relem[0],tmpstr,0))
656 (void)SvREFCNT_inc(tmpstr);
657 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
663 if (relem == lastrelem)
669 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
673 if (ckWARN(WARN_MISC)) {
674 if (relem == firstrelem &&
676 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
677 SvTYPE(SvRV(*relem)) == SVt_PVHV))
679 Perl_warner(aTHX_ WARN_MISC,
680 "Reference found where even-sized list expected");
683 Perl_warner(aTHX_ WARN_MISC,
684 "Odd number of elements in hash assignment");
686 if (SvTYPE(hash) == SVt_PVAV) {
688 tmpstr = sv_newmortal();
689 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
690 (void)SvREFCNT_inc(tmpstr);
691 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
696 tmpstr = NEWSV(29,0);
697 didstore = hv_store_ent(hash,*relem,tmpstr,0);
698 if (SvMAGICAL(hash)) {
699 if (SvSMAGICAL(tmpstr))
712 SV **lastlelem = PL_stack_sp;
713 SV **lastrelem = PL_stack_base + POPMARK;
714 SV **firstrelem = PL_stack_base + POPMARK + 1;
715 SV **firstlelem = lastrelem + 1;
728 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
730 /* If there's a common identifier on both sides we have to take
731 * special care that assigning the identifier on the left doesn't
732 * clobber a value on the right that's used later in the list.
734 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
735 EXTEND_MORTAL(lastrelem - firstrelem + 1);
736 for (relem = firstrelem; relem <= lastrelem; relem++) {
739 TAINT_NOT; /* Each item is independent */
740 *relem = sv_mortalcopy(sv);
750 while (lelem <= lastlelem) {
751 TAINT_NOT; /* Each item stands on its own, taintwise. */
753 switch (SvTYPE(sv)) {
756 magic = SvMAGICAL(ary) != 0;
757 if (PL_op->op_private & OPpASSIGN_HASH) {
758 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
764 do_oddball((HV*)ary, relem, firstrelem);
766 relem = lastrelem + 1;
771 av_extend(ary, lastrelem - relem);
773 while (relem <= lastrelem) { /* gobble up all the rest */
779 didstore = av_store(ary,i++,sv);
789 case SVt_PVHV: { /* normal hash */
793 magic = SvMAGICAL(hash) != 0;
796 while (relem < lastrelem) { /* gobble up all the rest */
801 sv = &PL_sv_no, relem++;
802 tmpstr = NEWSV(29,0);
804 sv_setsv(tmpstr,*relem); /* value */
806 didstore = hv_store_ent(hash,sv,tmpstr,0);
808 if (SvSMAGICAL(tmpstr))
815 if (relem == lastrelem) {
816 do_oddball(hash, relem, firstrelem);
822 if (SvIMMORTAL(sv)) {
823 if (relem <= lastrelem)
827 if (relem <= lastrelem) {
828 sv_setsv(sv, *relem);
832 sv_setsv(sv, &PL_sv_undef);
837 if (PL_delaymagic & ~DM_DELAY) {
838 if (PL_delaymagic & DM_UID) {
840 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
843 (void)setreuid(PL_uid,PL_euid);
846 if ((PL_delaymagic & DM_UID) == DM_RUID) {
847 (void)setruid(PL_uid);
848 PL_delaymagic &= ~DM_RUID;
850 # endif /* HAS_SETRUID */
852 if ((PL_delaymagic & DM_UID) == DM_EUID) {
853 (void)seteuid(PL_uid);
854 PL_delaymagic &= ~DM_EUID;
856 # endif /* HAS_SETEUID */
857 if (PL_delaymagic & DM_UID) {
858 if (PL_uid != PL_euid)
859 DIE(aTHX_ "No setreuid available");
860 (void)PerlProc_setuid(PL_uid);
862 # endif /* HAS_SETREUID */
863 #endif /* HAS_SETRESUID */
864 PL_uid = PerlProc_getuid();
865 PL_euid = PerlProc_geteuid();
867 if (PL_delaymagic & DM_GID) {
869 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
872 (void)setregid(PL_gid,PL_egid);
875 if ((PL_delaymagic & DM_GID) == DM_RGID) {
876 (void)setrgid(PL_gid);
877 PL_delaymagic &= ~DM_RGID;
879 # endif /* HAS_SETRGID */
881 if ((PL_delaymagic & DM_GID) == DM_EGID) {
882 (void)setegid(PL_gid);
883 PL_delaymagic &= ~DM_EGID;
885 # endif /* HAS_SETEGID */
886 if (PL_delaymagic & DM_GID) {
887 if (PL_gid != PL_egid)
888 DIE(aTHX_ "No setregid available");
889 (void)PerlProc_setgid(PL_gid);
891 # endif /* HAS_SETREGID */
892 #endif /* HAS_SETRESGID */
893 PL_gid = PerlProc_getgid();
894 PL_egid = PerlProc_getegid();
896 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
903 else if (gimme == G_SCALAR) {
906 SETi(lastrelem - firstrelem + 1);
912 SP = firstrelem + (lastlelem - firstlelem);
913 lelem = firstlelem + (relem - firstrelem);
915 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
923 register PMOP *pm = cPMOP;
924 SV *rv = sv_newmortal();
925 SV *sv = newSVrv(rv, "Regexp");
926 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
933 register PMOP *pm = cPMOP;
938 I32 r_flags = REXEC_CHECKED;
939 char *truebase; /* Start of string */
940 register REGEXP *rx = pm->op_pmregexp;
945 I32 oldsave = PL_savestack_ix;
946 I32 update_minmatch = 1;
949 if (PL_op->op_flags & OPf_STACKED)
955 PUTBACK; /* EVAL blocks need stack_sp. */
959 DIE(aTHX_ "panic: do_match");
960 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
961 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
964 if (pm->op_pmdynflags & PMdf_USED) {
966 if (gimme == G_ARRAY)
971 if (!rx->prelen && PL_curpm) {
973 rx = pm->op_pmregexp;
975 if (rx->minlen > len) goto failure;
979 /* XXXX What part of this is needed with true \G-support? */
980 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
982 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
983 MAGIC* mg = mg_find(TARG, 'g');
984 if (mg && mg->mg_len >= 0) {
985 if (!(rx->reganch & ROPT_GPOS_SEEN))
986 rx->endp[0] = rx->startp[0] = mg->mg_len;
987 else if (rx->reganch & ROPT_ANCH_GPOS) {
988 r_flags |= REXEC_IGNOREPOS;
989 rx->endp[0] = rx->startp[0] = mg->mg_len;
991 minmatch = (mg->mg_flags & MGf_MINMATCH);
996 if ((gimme != G_ARRAY && !global && rx->nparens)
997 || SvTEMP(TARG) || PL_sawampersand)
998 r_flags |= REXEC_COPY_STR;
1000 r_flags |= REXEC_SCREAM;
1002 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1003 SAVEINT(PL_multiline);
1004 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1008 if (global && rx->startp[0] != -1) {
1009 t = s = rx->endp[0] + truebase;
1010 if ((s + rx->minlen) > strend)
1012 if (update_minmatch++)
1013 minmatch = had_zerolen;
1015 if (rx->reganch & RE_USE_INTUIT) {
1016 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1020 if ( (rx->reganch & ROPT_CHECK_ALL)
1022 && ((rx->reganch & ROPT_NOSCAN)
1023 || !((rx->reganch & RE_INTUIT_TAIL)
1024 && (r_flags & REXEC_SCREAM)))
1025 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1028 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1031 if (pm->op_pmflags & PMf_ONCE)
1032 pm->op_pmdynflags |= PMdf_USED;
1041 RX_MATCH_TAINTED_on(rx);
1042 TAINT_IF(RX_MATCH_TAINTED(rx));
1043 if (gimme == G_ARRAY) {
1046 iters = rx->nparens;
1047 if (global && !iters)
1051 SPAGAIN; /* EVAL blocks could move the stack. */
1052 EXTEND(SP, iters + i);
1053 EXTEND_MORTAL(iters + i);
1054 for (i = !i; i <= iters; i++) {
1055 PUSHs(sv_newmortal());
1057 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1058 len = rx->endp[i] - rx->startp[i];
1059 s = rx->startp[i] + truebase;
1060 sv_setpvn(*SP, s, len);
1061 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1063 sv_utf8_downgrade(*SP, TRUE);
1068 had_zerolen = (rx->startp[0] != -1
1069 && rx->startp[0] == rx->endp[0]);
1070 PUTBACK; /* EVAL blocks may use stack */
1071 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1076 LEAVE_SCOPE(oldsave);
1082 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1083 mg = mg_find(TARG, 'g');
1085 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1086 mg = mg_find(TARG, 'g');
1088 if (rx->startp[0] != -1) {
1089 mg->mg_len = rx->endp[0];
1090 if (rx->startp[0] == rx->endp[0])
1091 mg->mg_flags |= MGf_MINMATCH;
1093 mg->mg_flags &= ~MGf_MINMATCH;
1096 LEAVE_SCOPE(oldsave);
1100 yup: /* Confirmed by INTUIT */
1102 RX_MATCH_TAINTED_on(rx);
1103 TAINT_IF(RX_MATCH_TAINTED(rx));
1105 if (pm->op_pmflags & PMf_ONCE)
1106 pm->op_pmdynflags |= PMdf_USED;
1107 if (RX_MATCH_COPIED(rx))
1108 Safefree(rx->subbeg);
1109 RX_MATCH_COPIED_off(rx);
1110 rx->subbeg = Nullch;
1112 rx->subbeg = truebase;
1113 rx->startp[0] = s - truebase;
1114 rx->endp[0] = s - truebase + rx->minlen;
1115 rx->sublen = strend - truebase;
1118 if (PL_sawampersand) {
1121 rx->subbeg = savepvn(t, strend - t);
1122 rx->sublen = strend - t;
1123 RX_MATCH_COPIED_on(rx);
1124 off = rx->startp[0] = s - t;
1125 rx->endp[0] = off + rx->minlen;
1127 else { /* startp/endp are used by @- @+. */
1128 rx->startp[0] = s - truebase;
1129 rx->endp[0] = s - truebase + rx->minlen;
1131 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1132 LEAVE_SCOPE(oldsave);
1137 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1138 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1139 MAGIC* mg = mg_find(TARG, 'g');
1144 LEAVE_SCOPE(oldsave);
1145 if (gimme == G_ARRAY)
1151 Perl_do_readline(pTHX)
1153 dSP; dTARGETSTACKED;
1158 register IO *io = GvIO(PL_last_in_gv);
1159 register I32 type = PL_op->op_type;
1160 I32 gimme = GIMME_V;
1163 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1165 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1168 call_method("READLINE", gimme);
1171 if (gimme == G_SCALAR)
1172 SvSetMagicSV_nosteal(TARG, TOPs);
1179 if (IoFLAGS(io) & IOf_ARGV) {
1180 if (IoFLAGS(io) & IOf_START) {
1182 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1183 IoFLAGS(io) &= ~IOf_START;
1184 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1185 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1186 SvSETMAGIC(GvSV(PL_last_in_gv));
1191 fp = nextargv(PL_last_in_gv);
1192 if (!fp) { /* Note: fp != IoIFP(io) */
1193 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1196 else if (type == OP_GLOB) {
1197 SV *tmpcmd = NEWSV(55, 0);
1201 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1202 /* since spawning off a process is a real performance hit */
1204 #include <descrip.h>
1205 #include <lib$routines.h>
1208 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1209 char vmsspec[NAM$C_MAXRSS+1];
1210 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1211 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1212 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1215 struct dsc$descriptor_s wilddsc
1216 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1217 struct dsc$descriptor_vs rsdsc
1218 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1219 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1221 /* We could find out if there's an explicit dev/dir or version
1222 by peeking into lib$find_file's internal context at
1223 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1224 but that's unsupported, so I don't want to do it now and
1225 have it bite someone in the future. */
1226 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1227 cp = SvPV(tmpglob,i);
1229 if (cp[i] == ';') hasver = 1;
1231 if (sts) hasver = 1;
1235 hasdir = isunix = 1;
1238 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1243 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1245 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1246 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1247 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1248 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1249 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1250 &dfltdsc,NULL,NULL,NULL))&1)) {
1251 end = rstr + (unsigned long int) *rslt;
1252 if (!hasver) while (*end != ';') end--;
1253 *(end++) = '\n'; *end = '\0';
1254 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1256 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1261 while (*(--begin) != ']' && *begin != '>') ;
1264 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1266 if (cxt) (void)lib$find_file_end(&cxt);
1267 if (ok && sts != RMS$_NMF &&
1268 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1271 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1273 PerlIO_close(tmpfp);
1277 PerlIO_rewind(tmpfp);
1279 IoIFP(io) = fp = tmpfp;
1280 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1285 #ifdef MACOS_TRADITIONAL
1286 sv_setpv(tmpcmd, "glob ");
1287 sv_catsv(tmpcmd, tmpglob);
1288 sv_catpv(tmpcmd, " |");
1292 sv_setpv(tmpcmd, "for a in ");
1293 sv_catsv(tmpcmd, tmpglob);
1294 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1297 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1298 sv_catsv(tmpcmd, tmpglob);
1300 sv_setpv(tmpcmd, "perlglob ");
1301 sv_catsv(tmpcmd, tmpglob);
1302 sv_catpv(tmpcmd, " |");
1307 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1308 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1309 sv_catsv(tmpcmd, tmpglob);
1310 sv_catpv(tmpcmd, "' 2>/dev/null |");
1312 sv_setpv(tmpcmd, "echo ");
1313 sv_catsv(tmpcmd, tmpglob);
1315 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1317 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1320 #endif /* !DOSISH */
1321 #endif /* MACOS_TRADITIONAL */
1322 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1323 FALSE, O_RDONLY, 0, Nullfp);
1329 else if (type == OP_GLOB)
1331 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1332 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1333 || fp == PerlIO_stderr()))
1335 SV* sv = sv_newmortal();
1336 gv_efullname3(sv, PL_last_in_gv, Nullch);
1337 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1342 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1343 if (type == OP_GLOB)
1344 Perl_warner(aTHX_ WARN_GLOB,
1345 "glob failed (can't start child: %s)",
1348 report_closed_fh(PL_last_in_gv, io, "readline", "filehandle");
1350 if (gimme == G_SCALAR) {
1351 (void)SvOK_off(TARG);
1357 if (gimme == G_SCALAR) {
1361 (void)SvUPGRADE(sv, SVt_PV);
1362 tmplen = SvLEN(sv); /* remember if already alloced */
1364 Sv_Grow(sv, 80); /* try short-buffering it */
1365 if (type == OP_RCATLINE)
1371 sv = sv_2mortal(NEWSV(57, 80));
1375 /* delay EOF state for a snarfed empty file */
1376 #define SNARF_EOF(gimme,rs,io,sv) \
1377 (gimme != G_SCALAR || SvCUR(sv) \
1378 || !RsSNARF(rs) || (IoFLAGS(io) & IOf_NOLINE) \
1379 || ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1382 if (!sv_gets(sv, fp, offset)
1383 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1385 PerlIO_clearerr(fp);
1386 if (IoFLAGS(io) & IOf_ARGV) {
1387 fp = nextargv(PL_last_in_gv);
1390 (void)do_close(PL_last_in_gv, FALSE);
1392 else if (type == OP_GLOB) {
1393 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1394 Perl_warner(aTHX_ WARN_GLOB,
1395 "glob failed (child exited with status %d%s)",
1396 (int)(STATUS_CURRENT >> 8),
1397 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1400 if (gimme == G_SCALAR) {
1401 (void)SvOK_off(TARG);
1406 /* This should not be marked tainted if the fp is marked clean */
1407 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1414 if (type == OP_GLOB) {
1417 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1418 tmps = SvEND(sv) - 1;
1419 if (*tmps == *SvPVX(PL_rs)) {
1424 for (tmps = SvPVX(sv); *tmps; tmps++)
1425 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1426 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1428 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1429 (void)POPs; /* Unmatched wildcard? Chuck it... */
1433 if (gimme == G_ARRAY) {
1434 if (SvLEN(sv) - SvCUR(sv) > 20) {
1435 SvLEN_set(sv, SvCUR(sv)+1);
1436 Renew(SvPVX(sv), SvLEN(sv), char);
1438 sv = sv_2mortal(NEWSV(58, 80));
1441 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1442 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1446 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1447 Renew(SvPVX(sv), SvLEN(sv), char);
1456 register PERL_CONTEXT *cx;
1457 I32 gimme = OP_GIMME(PL_op, -1);
1460 if (cxstack_ix >= 0)
1461 gimme = cxstack[cxstack_ix].blk_gimme;
1469 PUSHBLOCK(cx, CXt_BLOCK, SP);
1481 U32 lval = PL_op->op_flags & OPf_MOD;
1482 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1485 if (SvTYPE(hv) == SVt_PVHV) {
1486 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1487 svp = he ? &HeVAL(he) : 0;
1489 else if (SvTYPE(hv) == SVt_PVAV) {
1490 if (PL_op->op_private & OPpLVAL_INTRO)
1491 DIE(aTHX_ "Can't localize pseudo-hash element");
1492 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1498 if (!svp || *svp == &PL_sv_undef) {
1503 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1505 lv = sv_newmortal();
1506 sv_upgrade(lv, SVt_PVLV);
1508 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1509 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1510 LvTARG(lv) = SvREFCNT_inc(hv);
1515 if (PL_op->op_private & OPpLVAL_INTRO) {
1516 if (HvNAME(hv) && isGV(*svp))
1517 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1519 save_helem(hv, keysv, svp);
1521 else if (PL_op->op_private & OPpDEREF)
1522 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1524 sv = (svp ? *svp : &PL_sv_undef);
1525 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1526 * Pushing the magical RHS on to the stack is useless, since
1527 * that magic is soon destined to be misled by the local(),
1528 * and thus the later pp_sassign() will fail to mg_get() the
1529 * old value. This should also cure problems with delayed
1530 * mg_get()s. GSAR 98-07-03 */
1531 if (!lval && SvGMAGICAL(sv))
1532 sv = sv_mortalcopy(sv);
1540 register PERL_CONTEXT *cx;
1546 if (PL_op->op_flags & OPf_SPECIAL) {
1547 cx = &cxstack[cxstack_ix];
1548 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1553 gimme = OP_GIMME(PL_op, -1);
1555 if (cxstack_ix >= 0)
1556 gimme = cxstack[cxstack_ix].blk_gimme;
1562 if (gimme == G_VOID)
1564 else if (gimme == G_SCALAR) {
1567 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1570 *MARK = sv_mortalcopy(TOPs);
1573 *MARK = &PL_sv_undef;
1577 else if (gimme == G_ARRAY) {
1578 /* in case LEAVE wipes old return values */
1579 for (mark = newsp + 1; mark <= SP; mark++) {
1580 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1581 *mark = sv_mortalcopy(*mark);
1582 TAINT_NOT; /* Each item is independent */
1586 PL_curpm = newpm; /* Don't pop $1 et al till now */
1596 register PERL_CONTEXT *cx;
1602 cx = &cxstack[cxstack_ix];
1603 if (CxTYPE(cx) != CXt_LOOP)
1604 DIE(aTHX_ "panic: pp_iter");
1606 itersvp = CxITERVAR(cx);
1607 av = cx->blk_loop.iterary;
1608 if (SvTYPE(av) != SVt_PVAV) {
1609 /* iterate ($min .. $max) */
1610 if (cx->blk_loop.iterlval) {
1611 /* string increment */
1612 register SV* cur = cx->blk_loop.iterlval;
1614 char *max = SvPV((SV*)av, maxlen);
1615 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1616 #ifndef USE_THREADS /* don't risk potential race */
1617 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1618 /* safe to reuse old SV */
1619 sv_setsv(*itersvp, cur);
1624 /* we need a fresh SV every time so that loop body sees a
1625 * completely new SV for closures/references to work as
1627 SvREFCNT_dec(*itersvp);
1628 *itersvp = newSVsv(cur);
1630 if (strEQ(SvPVX(cur), max))
1631 sv_setiv(cur, 0); /* terminate next time */
1638 /* integer increment */
1639 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1642 #ifndef USE_THREADS /* don't risk potential race */
1643 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1644 /* safe to reuse old SV */
1645 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1650 /* we need a fresh SV every time so that loop body sees a
1651 * completely new SV for closures/references to work as they
1653 SvREFCNT_dec(*itersvp);
1654 *itersvp = newSViv(cx->blk_loop.iterix++);
1660 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1663 SvREFCNT_dec(*itersvp);
1665 if ((sv = SvMAGICAL(av)
1666 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1667 : AvARRAY(av)[++cx->blk_loop.iterix]))
1671 if (av != PL_curstack && SvIMMORTAL(sv)) {
1672 SV *lv = cx->blk_loop.iterlval;
1673 if (lv && SvREFCNT(lv) > 1) {
1678 SvREFCNT_dec(LvTARG(lv));
1680 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1681 sv_upgrade(lv, SVt_PVLV);
1683 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1685 LvTARG(lv) = SvREFCNT_inc(av);
1686 LvTARGOFF(lv) = cx->blk_loop.iterix;
1687 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1691 *itersvp = SvREFCNT_inc(sv);
1698 register PMOP *pm = cPMOP;
1714 register REGEXP *rx = pm->op_pmregexp;
1716 int force_on_match = 0;
1717 I32 oldsave = PL_savestack_ix;
1719 /* known replacement string? */
1720 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1721 if (PL_op->op_flags & OPf_STACKED)
1727 if (SvREADONLY(TARG)
1728 || (SvTYPE(TARG) > SVt_PVLV
1729 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1730 DIE(aTHX_ PL_no_modify);
1733 s = SvPV(TARG, len);
1734 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1736 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1737 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1744 DIE(aTHX_ "panic: do_subst");
1747 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1748 position, once with zero-length,
1749 second time with non-zero. */
1751 if (!rx->prelen && PL_curpm) {
1753 rx = pm->op_pmregexp;
1755 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1756 ? REXEC_COPY_STR : 0;
1758 r_flags |= REXEC_SCREAM;
1759 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1760 SAVEINT(PL_multiline);
1761 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1764 if (rx->reganch & RE_USE_INTUIT) {
1765 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1769 /* How to do it in subst? */
1770 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1772 && ((rx->reganch & ROPT_NOSCAN)
1773 || !((rx->reganch & RE_INTUIT_TAIL)
1774 && (r_flags & REXEC_SCREAM))))
1779 /* only replace once? */
1780 once = !(rpm->op_pmflags & PMf_GLOBAL);
1782 /* known replacement string? */
1783 c = dstr ? SvPV(dstr, clen) : Nullch;
1785 /* can do inplace substitution? */
1786 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1787 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1788 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1789 r_flags | REXEC_CHECKED))
1793 LEAVE_SCOPE(oldsave);
1796 if (force_on_match) {
1798 s = SvPV_force(TARG, len);
1803 SvSCREAM_off(TARG); /* disable possible screamer */
1805 rxtainted |= RX_MATCH_TAINTED(rx);
1806 m = orig + rx->startp[0];
1807 d = orig + rx->endp[0];
1809 if (m - s > strend - d) { /* faster to shorten from end */
1811 Copy(c, m, clen, char);
1816 Move(d, m, i, char);
1820 SvCUR_set(TARG, m - s);
1823 else if ((i = m - s)) { /* faster from front */
1831 Copy(c, m, clen, char);
1836 Copy(c, d, clen, char);
1841 TAINT_IF(rxtainted & 1);
1847 if (iters++ > maxiters)
1848 DIE(aTHX_ "Substitution loop");
1849 rxtainted |= RX_MATCH_TAINTED(rx);
1850 m = rx->startp[0] + orig;
1854 Move(s, d, i, char);
1858 Copy(c, d, clen, char);
1861 s = rx->endp[0] + orig;
1862 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1864 /* don't match same null twice */
1865 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1868 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1869 Move(s, d, i+1, char); /* include the NUL */
1871 TAINT_IF(rxtainted & 1);
1873 PUSHs(sv_2mortal(newSViv((I32)iters)));
1875 (void)SvPOK_only(TARG);
1876 TAINT_IF(rxtainted);
1877 if (SvSMAGICAL(TARG)) {
1883 LEAVE_SCOPE(oldsave);
1887 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1888 r_flags | REXEC_CHECKED))
1890 if (force_on_match) {
1892 s = SvPV_force(TARG, len);
1895 rxtainted |= RX_MATCH_TAINTED(rx);
1896 dstr = NEWSV(25, len);
1897 sv_setpvn(dstr, m, s-m);
1900 register PERL_CONTEXT *cx;
1903 RETURNOP(cPMOP->op_pmreplroot);
1905 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1907 if (iters++ > maxiters)
1908 DIE(aTHX_ "Substitution loop");
1909 rxtainted |= RX_MATCH_TAINTED(rx);
1910 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1915 strend = s + (strend - m);
1917 m = rx->startp[0] + orig;
1918 sv_catpvn(dstr, s, m-s);
1919 s = rx->endp[0] + orig;
1921 sv_catpvn(dstr, c, clen);
1924 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1925 sv_catpvn(dstr, s, strend - s);
1927 (void)SvOOK_off(TARG);
1928 Safefree(SvPVX(TARG));
1929 SvPVX(TARG) = SvPVX(dstr);
1930 SvCUR_set(TARG, SvCUR(dstr));
1931 SvLEN_set(TARG, SvLEN(dstr));
1935 TAINT_IF(rxtainted & 1);
1937 PUSHs(sv_2mortal(newSViv((I32)iters)));
1939 (void)SvPOK_only(TARG);
1940 TAINT_IF(rxtainted);
1943 LEAVE_SCOPE(oldsave);
1952 LEAVE_SCOPE(oldsave);
1961 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1962 ++*PL_markstack_ptr;
1963 LEAVE; /* exit inner scope */
1966 if (PL_stack_base + *PL_markstack_ptr > SP) {
1968 I32 gimme = GIMME_V;
1970 LEAVE; /* exit outer scope */
1971 (void)POPMARK; /* pop src */
1972 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1973 (void)POPMARK; /* pop dst */
1974 SP = PL_stack_base + POPMARK; /* pop original mark */
1975 if (gimme == G_SCALAR) {
1979 else if (gimme == G_ARRAY)
1986 ENTER; /* enter inner scope */
1989 src = PL_stack_base[*PL_markstack_ptr];
1993 RETURNOP(cLOGOP->op_other);
2004 register PERL_CONTEXT *cx;
2010 if (gimme == G_SCALAR) {
2013 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2015 *MARK = SvREFCNT_inc(TOPs);
2020 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2022 *MARK = sv_mortalcopy(sv);
2027 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2031 *MARK = &PL_sv_undef;
2035 else if (gimme == G_ARRAY) {
2036 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2037 if (!SvTEMP(*MARK)) {
2038 *MARK = sv_mortalcopy(*MARK);
2039 TAINT_NOT; /* Each item is independent */
2045 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2046 PL_curpm = newpm; /* ... and pop $1 et al */
2050 return pop_return();
2053 /* This duplicates the above code because the above code must not
2054 * get any slower by more conditions */
2062 register PERL_CONTEXT *cx;
2069 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2070 /* We are an argument to a function or grep().
2071 * This kind of lvalueness was legal before lvalue
2072 * subroutines too, so be backward compatible:
2073 * cannot report errors. */
2075 /* Scalar context *is* possible, on the LHS of -> only,
2076 * as in f()->meth(). But this is not an lvalue. */
2077 if (gimme == G_SCALAR)
2079 if (gimme == G_ARRAY) {
2080 if (!CvLVALUE(cx->blk_sub.cv))
2081 goto temporise_array;
2082 EXTEND_MORTAL(SP - newsp);
2083 for (mark = newsp + 1; mark <= SP; mark++) {
2086 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2087 *mark = sv_mortalcopy(*mark);
2089 /* Can be a localized value subject to deletion. */
2090 PL_tmps_stack[++PL_tmps_ix] = *mark;
2091 (void)SvREFCNT_inc(*mark);
2096 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2097 /* Here we go for robustness, not for speed, so we change all
2098 * the refcounts so the caller gets a live guy. Cannot set
2099 * TEMP, so sv_2mortal is out of question. */
2100 if (!CvLVALUE(cx->blk_sub.cv)) {
2105 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2107 if (gimme == G_SCALAR) {
2111 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2116 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2117 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2119 else { /* Can be a localized value
2120 * subject to deletion. */
2121 PL_tmps_stack[++PL_tmps_ix] = *mark;
2122 (void)SvREFCNT_inc(*mark);
2125 else { /* Should not happen? */
2130 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2131 (MARK > SP ? "Empty array" : "Array"));
2135 else if (gimme == G_ARRAY) {
2136 EXTEND_MORTAL(SP - newsp);
2137 for (mark = newsp + 1; mark <= SP; mark++) {
2138 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2139 /* Might be flattened array after $#array = */
2145 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2146 (*mark != &PL_sv_undef)
2148 ? "a readonly value" : "a temporary")
2149 : "an uninitialized value");
2152 /* Can be a localized value subject to deletion. */
2153 PL_tmps_stack[++PL_tmps_ix] = *mark;
2154 (void)SvREFCNT_inc(*mark);
2160 if (gimme == G_SCALAR) {
2164 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2166 *MARK = SvREFCNT_inc(TOPs);
2171 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2173 *MARK = sv_mortalcopy(sv);
2178 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2182 *MARK = &PL_sv_undef;
2186 else if (gimme == G_ARRAY) {
2188 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2189 if (!SvTEMP(*MARK)) {
2190 *MARK = sv_mortalcopy(*MARK);
2191 TAINT_NOT; /* Each item is independent */
2198 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2199 PL_curpm = newpm; /* ... and pop $1 et al */
2203 return pop_return();
2208 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2211 SV *dbsv = GvSV(PL_DBsub);
2213 if (!PERLDB_SUB_NN) {
2217 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2218 || strEQ(GvNAME(gv), "END")
2219 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2220 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2221 && (gv = (GV*)*svp) ))) {
2222 /* Use GV from the stack as a fallback. */
2223 /* GV is potentially non-unique, or contain different CV. */
2224 sv_setsv(dbsv, newRV((SV*)cv));
2227 gv_efullname3(dbsv, gv, Nullch);
2231 (void)SvUPGRADE(dbsv, SVt_PVIV);
2232 (void)SvIOK_on(dbsv);
2233 SAVEIV(SvIVX(dbsv));
2234 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2238 PL_curcopdb = PL_curcop;
2239 cv = GvCV(PL_DBsub);
2249 register PERL_CONTEXT *cx;
2251 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2254 DIE(aTHX_ "Not a CODE reference");
2255 switch (SvTYPE(sv)) {
2261 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2263 SP = PL_stack_base + POPMARK;
2266 if (SvGMAGICAL(sv)) {
2268 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2271 sym = SvPV(sv, n_a);
2273 DIE(aTHX_ PL_no_usym, "a subroutine");
2274 if (PL_op->op_private & HINT_STRICT_REFS)
2275 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2276 cv = get_cv(sym, TRUE);
2280 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2281 tryAMAGICunDEREF(to_cv);
2284 if (SvTYPE(cv) == SVt_PVCV)
2289 DIE(aTHX_ "Not a CODE reference");
2294 if (!(cv = GvCVu((GV*)sv)))
2295 cv = sv_2cv(sv, &stash, &gv, FALSE);
2308 if (!CvROOT(cv) && !CvXSUB(cv)) {
2312 /* anonymous or undef'd function leaves us no recourse */
2313 if (CvANON(cv) || !(gv = CvGV(cv)))
2314 DIE(aTHX_ "Undefined subroutine called");
2316 /* autoloaded stub? */
2317 if (cv != GvCV(gv)) {
2320 /* should call AUTOLOAD now? */
2323 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2330 sub_name = sv_newmortal();
2331 gv_efullname3(sub_name, gv, Nullch);
2332 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2336 DIE(aTHX_ "Not a CODE reference");
2341 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2342 cv = get_db_sub(&sv, cv);
2344 DIE(aTHX_ "No DBsub routine");
2349 * First we need to check if the sub or method requires locking.
2350 * If so, we gain a lock on the CV, the first argument or the
2351 * stash (for static methods), as appropriate. This has to be
2352 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2353 * reschedule by returning a new op.
2355 MUTEX_LOCK(CvMUTEXP(cv));
2356 if (CvFLAGS(cv) & CVf_LOCKED) {
2358 if (CvFLAGS(cv) & CVf_METHOD) {
2359 if (SP > PL_stack_base + TOPMARK)
2360 sv = *(PL_stack_base + TOPMARK + 1);
2362 AV *av = (AV*)PL_curpad[0];
2363 if (hasargs || !av || AvFILLp(av) < 0
2364 || !(sv = AvARRAY(av)[0]))
2366 MUTEX_UNLOCK(CvMUTEXP(cv));
2367 DIE(aTHX_ "no argument for locked method call");
2374 char *stashname = SvPV(sv, len);
2375 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2381 MUTEX_UNLOCK(CvMUTEXP(cv));
2382 mg = condpair_magic(sv);
2383 MUTEX_LOCK(MgMUTEXP(mg));
2384 if (MgOWNER(mg) == thr)
2385 MUTEX_UNLOCK(MgMUTEXP(mg));
2388 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2390 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2392 MUTEX_UNLOCK(MgMUTEXP(mg));
2393 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2395 MUTEX_LOCK(CvMUTEXP(cv));
2398 * Now we have permission to enter the sub, we must distinguish
2399 * four cases. (0) It's an XSUB (in which case we don't care
2400 * about ownership); (1) it's ours already (and we're recursing);
2401 * (2) it's free (but we may already be using a cached clone);
2402 * (3) another thread owns it. Case (1) is easy: we just use it.
2403 * Case (2) means we look for a clone--if we have one, use it
2404 * otherwise grab ownership of cv. Case (3) means we look for a
2405 * clone (for non-XSUBs) and have to create one if we don't
2407 * Why look for a clone in case (2) when we could just grab
2408 * ownership of cv straight away? Well, we could be recursing,
2409 * i.e. we originally tried to enter cv while another thread
2410 * owned it (hence we used a clone) but it has been freed up
2411 * and we're now recursing into it. It may or may not be "better"
2412 * to use the clone but at least CvDEPTH can be trusted.
2414 if (CvOWNER(cv) == thr || CvXSUB(cv))
2415 MUTEX_UNLOCK(CvMUTEXP(cv));
2417 /* Case (2) or (3) */
2421 * XXX Might it be better to release CvMUTEXP(cv) while we
2422 * do the hv_fetch? We might find someone has pinched it
2423 * when we look again, in which case we would be in case
2424 * (3) instead of (2) so we'd have to clone. Would the fact
2425 * that we released the mutex more quickly make up for this?
2427 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2429 /* We already have a clone to use */
2430 MUTEX_UNLOCK(CvMUTEXP(cv));
2432 DEBUG_S(PerlIO_printf(Perl_debug_log,
2433 "entersub: %p already has clone %p:%s\n",
2434 thr, cv, SvPEEK((SV*)cv)));
2437 if (CvDEPTH(cv) == 0)
2438 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2441 /* (2) => grab ownership of cv. (3) => make clone */
2445 MUTEX_UNLOCK(CvMUTEXP(cv));
2446 DEBUG_S(PerlIO_printf(Perl_debug_log,
2447 "entersub: %p grabbing %p:%s in stash %s\n",
2448 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2449 HvNAME(CvSTASH(cv)) : "(none)"));
2452 /* Make a new clone. */
2454 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2455 MUTEX_UNLOCK(CvMUTEXP(cv));
2456 DEBUG_S((PerlIO_printf(Perl_debug_log,
2457 "entersub: %p cloning %p:%s\n",
2458 thr, cv, SvPEEK((SV*)cv))));
2460 * We're creating a new clone so there's no race
2461 * between the original MUTEX_UNLOCK and the
2462 * SvREFCNT_inc since no one will be trying to undef
2463 * it out from underneath us. At least, I don't think
2466 clonecv = cv_clone(cv);
2467 SvREFCNT_dec(cv); /* finished with this */
2468 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2469 CvOWNER(clonecv) = thr;
2473 DEBUG_S(if (CvDEPTH(cv) != 0)
2474 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2476 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2479 #endif /* USE_THREADS */
2482 #ifdef PERL_XSUB_OLDSTYLE
2483 if (CvOLDSTYLE(cv)) {
2484 I32 (*fp3)(int,int,int);
2486 register I32 items = SP - MARK;
2487 /* We dont worry to copy from @_. */
2492 PL_stack_sp = mark + 1;
2493 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2494 items = (*fp3)(CvXSUBANY(cv).any_i32,
2495 MARK - PL_stack_base + 1,
2497 PL_stack_sp = PL_stack_base + items;
2500 #endif /* PERL_XSUB_OLDSTYLE */
2502 I32 markix = TOPMARK;
2507 /* Need to copy @_ to stack. Alternative may be to
2508 * switch stack to @_, and copy return values
2509 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2513 av = (AV*)PL_curpad[0];
2515 av = GvAV(PL_defgv);
2516 #endif /* USE_THREADS */
2517 items = AvFILLp(av) + 1; /* @_ is not tieable */
2520 /* Mark is at the end of the stack. */
2522 Copy(AvARRAY(av), SP + 1, items, SV*);
2527 /* We assume first XSUB in &DB::sub is the called one. */
2529 SAVEVPTR(PL_curcop);
2530 PL_curcop = PL_curcopdb;
2533 /* Do we need to open block here? XXXX */
2534 (void)(*CvXSUB(cv))(aTHXo_ cv);
2536 /* Enforce some sanity in scalar context. */
2537 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2538 if (markix > PL_stack_sp - PL_stack_base)
2539 *(PL_stack_base + markix) = &PL_sv_undef;
2541 *(PL_stack_base + markix) = *PL_stack_sp;
2542 PL_stack_sp = PL_stack_base + markix;
2550 register I32 items = SP - MARK;
2551 AV* padlist = CvPADLIST(cv);
2552 SV** svp = AvARRAY(padlist);
2553 push_return(PL_op->op_next);
2554 PUSHBLOCK(cx, CXt_SUB, MARK);
2557 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2558 * that eval'' ops within this sub know the correct lexical space.
2559 * Owing the speed considerations, we choose to search for the cv
2560 * in doeval() instead.
2562 if (CvDEPTH(cv) < 2)
2563 (void)SvREFCNT_inc(cv);
2564 else { /* save temporaries on recursion? */
2565 PERL_STACK_OVERFLOW_CHECK();
2566 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2568 AV *newpad = newAV();
2569 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2570 I32 ix = AvFILLp((AV*)svp[1]);
2571 I32 names_fill = AvFILLp((AV*)svp[0]);
2572 svp = AvARRAY(svp[0]);
2573 for ( ;ix > 0; ix--) {
2574 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2575 char *name = SvPVX(svp[ix]);
2576 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2577 || *name == '&') /* anonymous code? */
2579 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2581 else { /* our own lexical */
2583 av_store(newpad, ix, sv = (SV*)newAV());
2584 else if (*name == '%')
2585 av_store(newpad, ix, sv = (SV*)newHV());
2587 av_store(newpad, ix, sv = NEWSV(0,0));
2591 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2592 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2595 av_store(newpad, ix, sv = NEWSV(0,0));
2599 av = newAV(); /* will be @_ */
2601 av_store(newpad, 0, (SV*)av);
2602 AvFLAGS(av) = AVf_REIFY;
2603 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2604 AvFILLp(padlist) = CvDEPTH(cv);
2605 svp = AvARRAY(padlist);
2610 AV* av = (AV*)PL_curpad[0];
2612 items = AvFILLp(av) + 1;
2614 /* Mark is at the end of the stack. */
2616 Copy(AvARRAY(av), SP + 1, items, SV*);
2621 #endif /* USE_THREADS */
2622 SAVEVPTR(PL_curpad);
2623 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2626 #endif /* USE_THREADS */
2632 DEBUG_S(PerlIO_printf(Perl_debug_log,
2633 "%p entersub preparing @_\n", thr));
2635 av = (AV*)PL_curpad[0];
2637 /* @_ is normally not REAL--this should only ever
2638 * happen when DB::sub() calls things that modify @_ */
2644 cx->blk_sub.savearray = GvAV(PL_defgv);
2645 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2646 #endif /* USE_THREADS */
2647 cx->blk_sub.argarray = av;
2650 if (items > AvMAX(av) + 1) {
2652 if (AvARRAY(av) != ary) {
2653 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2654 SvPVX(av) = (char*)ary;
2656 if (items > AvMAX(av) + 1) {
2657 AvMAX(av) = items - 1;
2658 Renew(ary,items,SV*);
2660 SvPVX(av) = (char*)ary;
2663 Copy(MARK,AvARRAY(av),items,SV*);
2664 AvFILLp(av) = items - 1;
2672 /* warning must come *after* we fully set up the context
2673 * stuff so that __WARN__ handlers can safely dounwind()
2676 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2677 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2678 sub_crush_depth(cv);
2680 DEBUG_S(PerlIO_printf(Perl_debug_log,
2681 "%p entersub returning %p\n", thr, CvSTART(cv)));
2683 RETURNOP(CvSTART(cv));
2688 Perl_sub_crush_depth(pTHX_ CV *cv)
2691 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2693 SV* tmpstr = sv_newmortal();
2694 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2695 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2706 U32 lval = PL_op->op_flags & OPf_MOD;
2707 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2711 elem -= PL_curcop->cop_arybase;
2712 if (SvTYPE(av) != SVt_PVAV)
2714 svp = av_fetch(av, elem, lval && !defer);
2716 if (!svp || *svp == &PL_sv_undef) {
2719 DIE(aTHX_ PL_no_aelem, elem);
2720 lv = sv_newmortal();
2721 sv_upgrade(lv, SVt_PVLV);
2723 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2724 LvTARG(lv) = SvREFCNT_inc(av);
2725 LvTARGOFF(lv) = elem;
2730 if (PL_op->op_private & OPpLVAL_INTRO)
2731 save_aelem(av, elem, svp);
2732 else if (PL_op->op_private & OPpDEREF)
2733 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2735 sv = (svp ? *svp : &PL_sv_undef);
2736 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2737 sv = sv_mortalcopy(sv);
2743 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2749 Perl_croak(aTHX_ PL_no_modify);
2750 if (SvTYPE(sv) < SVt_RV)
2751 sv_upgrade(sv, SVt_RV);
2752 else if (SvTYPE(sv) >= SVt_PV) {
2753 (void)SvOOK_off(sv);
2754 Safefree(SvPVX(sv));
2755 SvLEN(sv) = SvCUR(sv) = 0;
2759 SvRV(sv) = NEWSV(355,0);
2762 SvRV(sv) = (SV*)newAV();
2765 SvRV(sv) = (SV*)newHV();
2780 if (SvTYPE(rsv) == SVt_PVCV) {
2786 SETs(method_common(sv, Null(U32*)));
2793 SV* sv = cSVOP->op_sv;
2794 U32 hash = SvUVX(sv);
2796 XPUSHs(method_common(sv, &hash));
2801 S_method_common(pTHX_ SV* meth, U32* hashp)
2812 name = SvPV(meth, namelen);
2813 sv = *(PL_stack_base + TOPMARK + 1);
2824 !(packname = SvPV(sv, packlen)) ||
2825 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2826 !(ob=(SV*)GvIO(iogv)))
2829 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2830 ? !isIDFIRST_utf8((U8*)packname)
2831 : !isIDFIRST(*packname)
2834 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2835 SvOK(sv) ? "without a package or object reference"
2836 : "on an undefined value");
2838 stash = gv_stashpvn(packname, packlen, TRUE);
2841 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2844 if (!ob || !(SvOBJECT(ob)
2845 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2848 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2852 stash = SvSTASH(ob);
2855 /* shortcut for simple names */
2857 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2859 gv = (GV*)HeVAL(he);
2860 if (isGV(gv) && GvCV(gv) &&
2861 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2862 return (SV*)GvCV(gv);
2866 gv = gv_fetchmethod(stash, name);
2872 for (p = name; *p; p++) {
2874 sep = p, leaf = p + 1;
2875 else if (*p == ':' && *(p + 1) == ':')
2876 sep = p, leaf = p + 2;
2878 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2879 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2880 packlen = strlen(packname);
2884 packlen = sep - name;
2887 "Can't locate object method \"%s\" via package \"%s\"",
2890 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2895 unset_cvowner(pTHXo_ void *cvarg)
2897 register CV* cv = (CV *) cvarg;
2900 #endif /* DEBUGGING */
2902 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2903 thr, cv, SvPEEK((SV*)cv))));
2904 MUTEX_LOCK(CvMUTEXP(cv));
2905 DEBUG_S(if (CvDEPTH(cv) != 0)
2906 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2908 assert(thr == CvOWNER(cv));
2910 MUTEX_UNLOCK(CvMUTEXP(cv));
2913 #endif /* USE_THREADS */