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 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 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))))
1027 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1030 if (pm->op_pmflags & PMf_ONCE)
1031 pm->op_pmdynflags |= PMdf_USED;
1040 RX_MATCH_TAINTED_on(rx);
1041 TAINT_IF(RX_MATCH_TAINTED(rx));
1042 if (gimme == G_ARRAY) {
1045 iters = rx->nparens;
1046 if (global && !iters)
1050 SPAGAIN; /* EVAL blocks could move the stack. */
1051 EXTEND(SP, iters + i);
1052 EXTEND_MORTAL(iters + i);
1053 for (i = !i; i <= iters; i++) {
1054 PUSHs(sv_newmortal());
1056 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1057 len = rx->endp[i] - rx->startp[i];
1058 s = rx->startp[i] + truebase;
1059 sv_setpvn(*SP, s, len);
1063 had_zerolen = (rx->startp[0] != -1
1064 && rx->startp[0] == rx->endp[0]);
1065 PUTBACK; /* EVAL blocks may use stack */
1066 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1071 LEAVE_SCOPE(oldsave);
1077 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1078 mg = mg_find(TARG, 'g');
1080 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1081 mg = mg_find(TARG, 'g');
1083 if (rx->startp[0] != -1) {
1084 mg->mg_len = rx->endp[0];
1085 if (rx->startp[0] == rx->endp[0])
1086 mg->mg_flags |= MGf_MINMATCH;
1088 mg->mg_flags &= ~MGf_MINMATCH;
1091 LEAVE_SCOPE(oldsave);
1095 yup: /* Confirmed by INTUIT */
1097 RX_MATCH_TAINTED_on(rx);
1098 TAINT_IF(RX_MATCH_TAINTED(rx));
1100 if (pm->op_pmflags & PMf_ONCE)
1101 pm->op_pmdynflags |= PMdf_USED;
1102 if (RX_MATCH_COPIED(rx))
1103 Safefree(rx->subbeg);
1104 RX_MATCH_COPIED_off(rx);
1105 rx->subbeg = Nullch;
1107 rx->subbeg = truebase;
1108 rx->startp[0] = s - truebase;
1109 rx->endp[0] = s - truebase + rx->minlen;
1110 rx->sublen = strend - truebase;
1113 if (PL_sawampersand) {
1116 rx->subbeg = savepvn(t, strend - t);
1117 rx->sublen = strend - t;
1118 RX_MATCH_COPIED_on(rx);
1119 off = rx->startp[0] = s - t;
1120 rx->endp[0] = off + rx->minlen;
1122 else { /* startp/endp are used by @- @+. */
1123 rx->startp[0] = s - truebase;
1124 rx->endp[0] = s - truebase + rx->minlen;
1126 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1127 LEAVE_SCOPE(oldsave);
1132 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1133 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1134 MAGIC* mg = mg_find(TARG, 'g');
1139 LEAVE_SCOPE(oldsave);
1140 if (gimme == G_ARRAY)
1146 Perl_do_readline(pTHX)
1148 dSP; dTARGETSTACKED;
1153 register IO *io = GvIO(PL_last_in_gv);
1154 register I32 type = PL_op->op_type;
1155 I32 gimme = GIMME_V;
1158 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1160 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1163 call_method("READLINE", gimme);
1166 if (gimme == G_SCALAR)
1167 SvSetMagicSV_nosteal(TARG, TOPs);
1174 if (IoFLAGS(io) & IOf_ARGV) {
1175 if (IoFLAGS(io) & IOf_START) {
1177 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1178 IoFLAGS(io) &= ~IOf_START;
1179 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1180 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1181 SvSETMAGIC(GvSV(PL_last_in_gv));
1186 fp = nextargv(PL_last_in_gv);
1187 if (!fp) { /* Note: fp != IoIFP(io) */
1188 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1191 else if (type == OP_GLOB) {
1192 SV *tmpcmd = NEWSV(55, 0);
1196 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1197 /* since spawning off a process is a real performance hit */
1199 #include <descrip.h>
1200 #include <lib$routines.h>
1203 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1204 char vmsspec[NAM$C_MAXRSS+1];
1205 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1206 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1207 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1210 struct dsc$descriptor_s wilddsc
1211 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1212 struct dsc$descriptor_vs rsdsc
1213 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1214 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1216 /* We could find out if there's an explicit dev/dir or version
1217 by peeking into lib$find_file's internal context at
1218 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1219 but that's unsupported, so I don't want to do it now and
1220 have it bite someone in the future. */
1221 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1222 cp = SvPV(tmpglob,i);
1224 if (cp[i] == ';') hasver = 1;
1226 if (sts) hasver = 1;
1230 hasdir = isunix = 1;
1233 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1238 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1240 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1241 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1242 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1243 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1244 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1245 &dfltdsc,NULL,NULL,NULL))&1)) {
1246 end = rstr + (unsigned long int) *rslt;
1247 if (!hasver) while (*end != ';') end--;
1248 *(end++) = '\n'; *end = '\0';
1249 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1251 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1256 while (*(--begin) != ']' && *begin != '>') ;
1259 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1261 if (cxt) (void)lib$find_file_end(&cxt);
1262 if (ok && sts != RMS$_NMF &&
1263 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1266 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1268 PerlIO_close(tmpfp);
1272 PerlIO_rewind(tmpfp);
1274 IoIFP(io) = fp = tmpfp;
1275 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1280 #ifdef MACOS_TRADITIONAL
1281 sv_setpv(tmpcmd, "glob ");
1282 sv_catsv(tmpcmd, tmpglob);
1283 sv_catpv(tmpcmd, " |");
1287 sv_setpv(tmpcmd, "for a in ");
1288 sv_catsv(tmpcmd, tmpglob);
1289 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1292 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1293 sv_catsv(tmpcmd, tmpglob);
1295 sv_setpv(tmpcmd, "perlglob ");
1296 sv_catsv(tmpcmd, tmpglob);
1297 sv_catpv(tmpcmd, " |");
1302 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1303 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1304 sv_catsv(tmpcmd, tmpglob);
1305 sv_catpv(tmpcmd, "' 2>/dev/null |");
1307 sv_setpv(tmpcmd, "echo ");
1308 sv_catsv(tmpcmd, tmpglob);
1310 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1312 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1315 #endif /* !DOSISH */
1316 #endif /* MACOS_TRADITIONAL */
1317 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1318 FALSE, O_RDONLY, 0, Nullfp);
1324 else if (type == OP_GLOB)
1326 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1327 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1328 || fp == PerlIO_stderr()))
1330 SV* sv = sv_newmortal();
1331 gv_efullname3(sv, PL_last_in_gv, Nullch);
1332 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1337 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1338 if (type == OP_GLOB)
1339 Perl_warner(aTHX_ WARN_GLOB,
1340 "glob failed (can't start child: %s)",
1343 report_closed_fh(PL_last_in_gv, io, "readline", "filehandle");
1345 if (gimme == G_SCALAR) {
1346 (void)SvOK_off(TARG);
1352 if (gimme == G_SCALAR) {
1356 (void)SvUPGRADE(sv, SVt_PV);
1357 tmplen = SvLEN(sv); /* remember if already alloced */
1359 Sv_Grow(sv, 80); /* try short-buffering it */
1360 if (type == OP_RCATLINE)
1366 sv = sv_2mortal(NEWSV(57, 80));
1370 /* delay EOF state for a snarfed empty file */
1371 #define SNARF_EOF(gimme,rs,io,sv) \
1372 (gimme != G_SCALAR || SvCUR(sv) \
1373 || !RsSNARF(rs) || (IoFLAGS(io) & IOf_NOLINE) \
1374 || ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1377 if (!sv_gets(sv, fp, offset)
1378 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1380 PerlIO_clearerr(fp);
1381 if (IoFLAGS(io) & IOf_ARGV) {
1382 fp = nextargv(PL_last_in_gv);
1385 (void)do_close(PL_last_in_gv, FALSE);
1387 else if (type == OP_GLOB) {
1388 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1389 Perl_warner(aTHX_ WARN_GLOB,
1390 "glob failed (child exited with status %d%s)",
1391 (int)(STATUS_CURRENT >> 8),
1392 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1395 if (gimme == G_SCALAR) {
1396 (void)SvOK_off(TARG);
1401 /* This should not be marked tainted if the fp is marked clean */
1402 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1409 if (type == OP_GLOB) {
1412 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1413 tmps = SvEND(sv) - 1;
1414 if (*tmps == *SvPVX(PL_rs)) {
1419 for (tmps = SvPVX(sv); *tmps; tmps++)
1420 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1421 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1423 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1424 (void)POPs; /* Unmatched wildcard? Chuck it... */
1428 if (gimme == G_ARRAY) {
1429 if (SvLEN(sv) - SvCUR(sv) > 20) {
1430 SvLEN_set(sv, SvCUR(sv)+1);
1431 Renew(SvPVX(sv), SvLEN(sv), char);
1433 sv = sv_2mortal(NEWSV(58, 80));
1436 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1437 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1441 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1442 Renew(SvPVX(sv), SvLEN(sv), char);
1451 register PERL_CONTEXT *cx;
1452 I32 gimme = OP_GIMME(PL_op, -1);
1455 if (cxstack_ix >= 0)
1456 gimme = cxstack[cxstack_ix].blk_gimme;
1464 PUSHBLOCK(cx, CXt_BLOCK, SP);
1476 U32 lval = PL_op->op_flags & OPf_MOD;
1477 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1480 if (SvTYPE(hv) == SVt_PVHV) {
1481 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1482 svp = he ? &HeVAL(he) : 0;
1484 else if (SvTYPE(hv) == SVt_PVAV) {
1485 if (PL_op->op_private & OPpLVAL_INTRO)
1486 DIE(aTHX_ "Can't localize pseudo-hash element");
1487 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1493 if (!svp || *svp == &PL_sv_undef) {
1498 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1500 lv = sv_newmortal();
1501 sv_upgrade(lv, SVt_PVLV);
1503 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1504 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1505 LvTARG(lv) = SvREFCNT_inc(hv);
1510 if (PL_op->op_private & OPpLVAL_INTRO) {
1511 if (HvNAME(hv) && isGV(*svp))
1512 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1514 save_helem(hv, keysv, svp);
1516 else if (PL_op->op_private & OPpDEREF)
1517 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1519 sv = (svp ? *svp : &PL_sv_undef);
1520 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1521 * Pushing the magical RHS on to the stack is useless, since
1522 * that magic is soon destined to be misled by the local(),
1523 * and thus the later pp_sassign() will fail to mg_get() the
1524 * old value. This should also cure problems with delayed
1525 * mg_get()s. GSAR 98-07-03 */
1526 if (!lval && SvGMAGICAL(sv))
1527 sv = sv_mortalcopy(sv);
1535 register PERL_CONTEXT *cx;
1541 if (PL_op->op_flags & OPf_SPECIAL) {
1542 cx = &cxstack[cxstack_ix];
1543 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1548 gimme = OP_GIMME(PL_op, -1);
1550 if (cxstack_ix >= 0)
1551 gimme = cxstack[cxstack_ix].blk_gimme;
1557 if (gimme == G_VOID)
1559 else if (gimme == G_SCALAR) {
1562 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1565 *MARK = sv_mortalcopy(TOPs);
1568 *MARK = &PL_sv_undef;
1572 else if (gimme == G_ARRAY) {
1573 /* in case LEAVE wipes old return values */
1574 for (mark = newsp + 1; mark <= SP; mark++) {
1575 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1576 *mark = sv_mortalcopy(*mark);
1577 TAINT_NOT; /* Each item is independent */
1581 PL_curpm = newpm; /* Don't pop $1 et al till now */
1591 register PERL_CONTEXT *cx;
1597 cx = &cxstack[cxstack_ix];
1598 if (CxTYPE(cx) != CXt_LOOP)
1599 DIE(aTHX_ "panic: pp_iter");
1601 itersvp = CxITERVAR(cx);
1602 av = cx->blk_loop.iterary;
1603 if (SvTYPE(av) != SVt_PVAV) {
1604 /* iterate ($min .. $max) */
1605 if (cx->blk_loop.iterlval) {
1606 /* string increment */
1607 register SV* cur = cx->blk_loop.iterlval;
1609 char *max = SvPV((SV*)av, maxlen);
1610 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1611 #ifndef USE_THREADS /* don't risk potential race */
1612 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1613 /* safe to reuse old SV */
1614 sv_setsv(*itersvp, cur);
1619 /* we need a fresh SV every time so that loop body sees a
1620 * completely new SV for closures/references to work as
1622 SvREFCNT_dec(*itersvp);
1623 *itersvp = newSVsv(cur);
1625 if (strEQ(SvPVX(cur), max))
1626 sv_setiv(cur, 0); /* terminate next time */
1633 /* integer increment */
1634 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1637 #ifndef USE_THREADS /* don't risk potential race */
1638 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1639 /* safe to reuse old SV */
1640 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1645 /* we need a fresh SV every time so that loop body sees a
1646 * completely new SV for closures/references to work as they
1648 SvREFCNT_dec(*itersvp);
1649 *itersvp = newSViv(cx->blk_loop.iterix++);
1655 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1658 SvREFCNT_dec(*itersvp);
1660 if ((sv = SvMAGICAL(av)
1661 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1662 : AvARRAY(av)[++cx->blk_loop.iterix]))
1666 if (av != PL_curstack && SvIMMORTAL(sv)) {
1667 SV *lv = cx->blk_loop.iterlval;
1668 if (lv && SvREFCNT(lv) > 1) {
1673 SvREFCNT_dec(LvTARG(lv));
1675 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1676 sv_upgrade(lv, SVt_PVLV);
1678 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1680 LvTARG(lv) = SvREFCNT_inc(av);
1681 LvTARGOFF(lv) = cx->blk_loop.iterix;
1682 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1686 *itersvp = SvREFCNT_inc(sv);
1693 register PMOP *pm = cPMOP;
1709 register REGEXP *rx = pm->op_pmregexp;
1711 int force_on_match = 0;
1712 I32 oldsave = PL_savestack_ix;
1714 /* known replacement string? */
1715 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1716 if (PL_op->op_flags & OPf_STACKED)
1722 if (SvREADONLY(TARG)
1723 || (SvTYPE(TARG) > SVt_PVLV
1724 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1725 DIE(aTHX_ PL_no_modify);
1728 s = SvPV(TARG, len);
1729 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1731 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1732 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1739 DIE(aTHX_ "panic: do_subst");
1742 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1743 position, once with zero-length,
1744 second time with non-zero. */
1746 if (!rx->prelen && PL_curpm) {
1748 rx = pm->op_pmregexp;
1750 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1751 ? REXEC_COPY_STR : 0;
1753 r_flags |= REXEC_SCREAM;
1754 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1755 SAVEINT(PL_multiline);
1756 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1759 if (rx->reganch & RE_USE_INTUIT) {
1760 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1764 /* How to do it in subst? */
1765 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1767 && ((rx->reganch & ROPT_NOSCAN)
1768 || !((rx->reganch & RE_INTUIT_TAIL)
1769 && (r_flags & REXEC_SCREAM))))
1774 /* only replace once? */
1775 once = !(rpm->op_pmflags & PMf_GLOBAL);
1777 /* known replacement string? */
1778 c = dstr ? SvPV(dstr, clen) : Nullch;
1780 /* can do inplace substitution? */
1781 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1782 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1783 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1784 r_flags | REXEC_CHECKED))
1788 LEAVE_SCOPE(oldsave);
1791 if (force_on_match) {
1793 s = SvPV_force(TARG, len);
1798 SvSCREAM_off(TARG); /* disable possible screamer */
1800 rxtainted |= RX_MATCH_TAINTED(rx);
1801 m = orig + rx->startp[0];
1802 d = orig + rx->endp[0];
1804 if (m - s > strend - d) { /* faster to shorten from end */
1806 Copy(c, m, clen, char);
1811 Move(d, m, i, char);
1815 SvCUR_set(TARG, m - s);
1818 else if ((i = m - s)) { /* faster from front */
1826 Copy(c, m, clen, char);
1831 Copy(c, d, clen, char);
1836 TAINT_IF(rxtainted & 1);
1842 if (iters++ > maxiters)
1843 DIE(aTHX_ "Substitution loop");
1844 rxtainted |= RX_MATCH_TAINTED(rx);
1845 m = rx->startp[0] + orig;
1849 Move(s, d, i, char);
1853 Copy(c, d, clen, char);
1856 s = rx->endp[0] + orig;
1857 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1859 /* don't match same null twice */
1860 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1863 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1864 Move(s, d, i+1, char); /* include the NUL */
1866 TAINT_IF(rxtainted & 1);
1868 PUSHs(sv_2mortal(newSViv((I32)iters)));
1870 (void)SvPOK_only(TARG);
1871 TAINT_IF(rxtainted);
1872 if (SvSMAGICAL(TARG)) {
1878 LEAVE_SCOPE(oldsave);
1882 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1883 r_flags | REXEC_CHECKED))
1885 if (force_on_match) {
1887 s = SvPV_force(TARG, len);
1890 rxtainted |= RX_MATCH_TAINTED(rx);
1891 dstr = NEWSV(25, len);
1892 sv_setpvn(dstr, m, s-m);
1895 register PERL_CONTEXT *cx;
1898 RETURNOP(cPMOP->op_pmreplroot);
1900 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1902 if (iters++ > maxiters)
1903 DIE(aTHX_ "Substitution loop");
1904 rxtainted |= RX_MATCH_TAINTED(rx);
1905 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1910 strend = s + (strend - m);
1912 m = rx->startp[0] + orig;
1913 sv_catpvn(dstr, s, m-s);
1914 s = rx->endp[0] + orig;
1916 sv_catpvn(dstr, c, clen);
1919 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1920 sv_catpvn(dstr, s, strend - s);
1922 (void)SvOOK_off(TARG);
1923 Safefree(SvPVX(TARG));
1924 SvPVX(TARG) = SvPVX(dstr);
1925 SvCUR_set(TARG, SvCUR(dstr));
1926 SvLEN_set(TARG, SvLEN(dstr));
1930 TAINT_IF(rxtainted & 1);
1932 PUSHs(sv_2mortal(newSViv((I32)iters)));
1934 (void)SvPOK_only(TARG);
1935 TAINT_IF(rxtainted);
1938 LEAVE_SCOPE(oldsave);
1947 LEAVE_SCOPE(oldsave);
1956 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1957 ++*PL_markstack_ptr;
1958 LEAVE; /* exit inner scope */
1961 if (PL_stack_base + *PL_markstack_ptr > SP) {
1963 I32 gimme = GIMME_V;
1965 LEAVE; /* exit outer scope */
1966 (void)POPMARK; /* pop src */
1967 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1968 (void)POPMARK; /* pop dst */
1969 SP = PL_stack_base + POPMARK; /* pop original mark */
1970 if (gimme == G_SCALAR) {
1974 else if (gimme == G_ARRAY)
1981 ENTER; /* enter inner scope */
1984 src = PL_stack_base[*PL_markstack_ptr];
1988 RETURNOP(cLOGOP->op_other);
1999 register PERL_CONTEXT *cx;
2005 if (gimme == G_SCALAR) {
2008 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2010 *MARK = SvREFCNT_inc(TOPs);
2015 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2017 *MARK = sv_mortalcopy(sv);
2022 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2026 *MARK = &PL_sv_undef;
2030 else if (gimme == G_ARRAY) {
2031 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2032 if (!SvTEMP(*MARK)) {
2033 *MARK = sv_mortalcopy(*MARK);
2034 TAINT_NOT; /* Each item is independent */
2040 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2041 PL_curpm = newpm; /* ... and pop $1 et al */
2045 return pop_return();
2048 /* This duplicates the above code because the above code must not
2049 * get any slower by more conditions */
2057 register PERL_CONTEXT *cx;
2064 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2065 /* We are an argument to a function or grep().
2066 * This kind of lvalueness was legal before lvalue
2067 * subroutines too, so be backward compatible:
2068 * cannot report errors. */
2070 /* Scalar context *is* possible, on the LHS of -> only,
2071 * as in f()->meth(). But this is not an lvalue. */
2072 if (gimme == G_SCALAR)
2074 if (gimme == G_ARRAY) {
2075 if (!CvLVALUE(cx->blk_sub.cv))
2076 goto temporise_array;
2077 EXTEND_MORTAL(SP - newsp);
2078 for (mark = newsp + 1; mark <= SP; mark++) {
2081 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2082 *mark = sv_mortalcopy(*mark);
2084 /* Can be a localized value subject to deletion. */
2085 PL_tmps_stack[++PL_tmps_ix] = *mark;
2086 (void)SvREFCNT_inc(*mark);
2091 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2092 /* Here we go for robustness, not for speed, so we change all
2093 * the refcounts so the caller gets a live guy. Cannot set
2094 * TEMP, so sv_2mortal is out of question. */
2095 if (!CvLVALUE(cx->blk_sub.cv)) {
2100 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2102 if (gimme == G_SCALAR) {
2106 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2111 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2112 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2114 else { /* Can be a localized value
2115 * subject to deletion. */
2116 PL_tmps_stack[++PL_tmps_ix] = *mark;
2117 (void)SvREFCNT_inc(*mark);
2120 else { /* Should not happen? */
2125 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2126 (MARK > SP ? "Empty array" : "Array"));
2130 else if (gimme == G_ARRAY) {
2131 EXTEND_MORTAL(SP - newsp);
2132 for (mark = newsp + 1; mark <= SP; mark++) {
2133 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2134 /* Might be flattened array after $#array = */
2140 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2141 (*mark != &PL_sv_undef)
2143 ? "a readonly value" : "a temporary")
2144 : "an uninitialized value");
2147 /* Can be a localized value subject to deletion. */
2148 PL_tmps_stack[++PL_tmps_ix] = *mark;
2149 (void)SvREFCNT_inc(*mark);
2155 if (gimme == G_SCALAR) {
2159 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2161 *MARK = SvREFCNT_inc(TOPs);
2166 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2168 *MARK = sv_mortalcopy(sv);
2173 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2177 *MARK = &PL_sv_undef;
2181 else if (gimme == G_ARRAY) {
2183 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2184 if (!SvTEMP(*MARK)) {
2185 *MARK = sv_mortalcopy(*MARK);
2186 TAINT_NOT; /* Each item is independent */
2193 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2194 PL_curpm = newpm; /* ... and pop $1 et al */
2198 return pop_return();
2203 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2206 SV *dbsv = GvSV(PL_DBsub);
2208 if (!PERLDB_SUB_NN) {
2212 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2213 || strEQ(GvNAME(gv), "END")
2214 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2215 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2216 && (gv = (GV*)*svp) ))) {
2217 /* Use GV from the stack as a fallback. */
2218 /* GV is potentially non-unique, or contain different CV. */
2219 sv_setsv(dbsv, newRV((SV*)cv));
2222 gv_efullname3(dbsv, gv, Nullch);
2226 (void)SvUPGRADE(dbsv, SVt_PVIV);
2227 (void)SvIOK_on(dbsv);
2228 SAVEIV(SvIVX(dbsv));
2229 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2233 PL_curcopdb = PL_curcop;
2234 cv = GvCV(PL_DBsub);
2244 register PERL_CONTEXT *cx;
2246 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2249 DIE(aTHX_ "Not a CODE reference");
2250 switch (SvTYPE(sv)) {
2256 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2258 SP = PL_stack_base + POPMARK;
2261 if (SvGMAGICAL(sv)) {
2263 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2266 sym = SvPV(sv, n_a);
2268 DIE(aTHX_ PL_no_usym, "a subroutine");
2269 if (PL_op->op_private & HINT_STRICT_REFS)
2270 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2271 cv = get_cv(sym, TRUE);
2275 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2276 tryAMAGICunDEREF(to_cv);
2279 if (SvTYPE(cv) == SVt_PVCV)
2284 DIE(aTHX_ "Not a CODE reference");
2289 if (!(cv = GvCVu((GV*)sv)))
2290 cv = sv_2cv(sv, &stash, &gv, FALSE);
2303 if (!CvROOT(cv) && !CvXSUB(cv)) {
2307 /* anonymous or undef'd function leaves us no recourse */
2308 if (CvANON(cv) || !(gv = CvGV(cv)))
2309 DIE(aTHX_ "Undefined subroutine called");
2311 /* autoloaded stub? */
2312 if (cv != GvCV(gv)) {
2315 /* should call AUTOLOAD now? */
2318 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2325 sub_name = sv_newmortal();
2326 gv_efullname3(sub_name, gv, Nullch);
2327 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2331 DIE(aTHX_ "Not a CODE reference");
2336 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2337 cv = get_db_sub(&sv, cv);
2339 DIE(aTHX_ "No DBsub routine");
2344 * First we need to check if the sub or method requires locking.
2345 * If so, we gain a lock on the CV, the first argument or the
2346 * stash (for static methods), as appropriate. This has to be
2347 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2348 * reschedule by returning a new op.
2350 MUTEX_LOCK(CvMUTEXP(cv));
2351 if (CvFLAGS(cv) & CVf_LOCKED) {
2353 if (CvFLAGS(cv) & CVf_METHOD) {
2354 if (SP > PL_stack_base + TOPMARK)
2355 sv = *(PL_stack_base + TOPMARK + 1);
2357 AV *av = (AV*)PL_curpad[0];
2358 if (hasargs || !av || AvFILLp(av) < 0
2359 || !(sv = AvARRAY(av)[0]))
2361 MUTEX_UNLOCK(CvMUTEXP(cv));
2362 DIE(aTHX_ "no argument for locked method call");
2369 char *stashname = SvPV(sv, len);
2370 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2376 MUTEX_UNLOCK(CvMUTEXP(cv));
2377 mg = condpair_magic(sv);
2378 MUTEX_LOCK(MgMUTEXP(mg));
2379 if (MgOWNER(mg) == thr)
2380 MUTEX_UNLOCK(MgMUTEXP(mg));
2383 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2385 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2387 MUTEX_UNLOCK(MgMUTEXP(mg));
2388 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2390 MUTEX_LOCK(CvMUTEXP(cv));
2393 * Now we have permission to enter the sub, we must distinguish
2394 * four cases. (0) It's an XSUB (in which case we don't care
2395 * about ownership); (1) it's ours already (and we're recursing);
2396 * (2) it's free (but we may already be using a cached clone);
2397 * (3) another thread owns it. Case (1) is easy: we just use it.
2398 * Case (2) means we look for a clone--if we have one, use it
2399 * otherwise grab ownership of cv. Case (3) means we look for a
2400 * clone (for non-XSUBs) and have to create one if we don't
2402 * Why look for a clone in case (2) when we could just grab
2403 * ownership of cv straight away? Well, we could be recursing,
2404 * i.e. we originally tried to enter cv while another thread
2405 * owned it (hence we used a clone) but it has been freed up
2406 * and we're now recursing into it. It may or may not be "better"
2407 * to use the clone but at least CvDEPTH can be trusted.
2409 if (CvOWNER(cv) == thr || CvXSUB(cv))
2410 MUTEX_UNLOCK(CvMUTEXP(cv));
2412 /* Case (2) or (3) */
2416 * XXX Might it be better to release CvMUTEXP(cv) while we
2417 * do the hv_fetch? We might find someone has pinched it
2418 * when we look again, in which case we would be in case
2419 * (3) instead of (2) so we'd have to clone. Would the fact
2420 * that we released the mutex more quickly make up for this?
2422 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2424 /* We already have a clone to use */
2425 MUTEX_UNLOCK(CvMUTEXP(cv));
2427 DEBUG_S(PerlIO_printf(Perl_debug_log,
2428 "entersub: %p already has clone %p:%s\n",
2429 thr, cv, SvPEEK((SV*)cv)));
2432 if (CvDEPTH(cv) == 0)
2433 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2436 /* (2) => grab ownership of cv. (3) => make clone */
2440 MUTEX_UNLOCK(CvMUTEXP(cv));
2441 DEBUG_S(PerlIO_printf(Perl_debug_log,
2442 "entersub: %p grabbing %p:%s in stash %s\n",
2443 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2444 HvNAME(CvSTASH(cv)) : "(none)"));
2447 /* Make a new clone. */
2449 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2450 MUTEX_UNLOCK(CvMUTEXP(cv));
2451 DEBUG_S((PerlIO_printf(Perl_debug_log,
2452 "entersub: %p cloning %p:%s\n",
2453 thr, cv, SvPEEK((SV*)cv))));
2455 * We're creating a new clone so there's no race
2456 * between the original MUTEX_UNLOCK and the
2457 * SvREFCNT_inc since no one will be trying to undef
2458 * it out from underneath us. At least, I don't think
2461 clonecv = cv_clone(cv);
2462 SvREFCNT_dec(cv); /* finished with this */
2463 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2464 CvOWNER(clonecv) = thr;
2468 DEBUG_S(if (CvDEPTH(cv) != 0)
2469 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2471 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2474 #endif /* USE_THREADS */
2477 #ifdef PERL_XSUB_OLDSTYLE
2478 if (CvOLDSTYLE(cv)) {
2479 I32 (*fp3)(int,int,int);
2481 register I32 items = SP - MARK;
2482 /* We dont worry to copy from @_. */
2487 PL_stack_sp = mark + 1;
2488 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2489 items = (*fp3)(CvXSUBANY(cv).any_i32,
2490 MARK - PL_stack_base + 1,
2492 PL_stack_sp = PL_stack_base + items;
2495 #endif /* PERL_XSUB_OLDSTYLE */
2497 I32 markix = TOPMARK;
2502 /* Need to copy @_ to stack. Alternative may be to
2503 * switch stack to @_, and copy return values
2504 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2508 av = (AV*)PL_curpad[0];
2510 av = GvAV(PL_defgv);
2511 #endif /* USE_THREADS */
2512 items = AvFILLp(av) + 1; /* @_ is not tieable */
2515 /* Mark is at the end of the stack. */
2517 Copy(AvARRAY(av), SP + 1, items, SV*);
2522 /* We assume first XSUB in &DB::sub is the called one. */
2524 SAVEVPTR(PL_curcop);
2525 PL_curcop = PL_curcopdb;
2528 /* Do we need to open block here? XXXX */
2529 (void)(*CvXSUB(cv))(aTHXo_ cv);
2531 /* Enforce some sanity in scalar context. */
2532 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2533 if (markix > PL_stack_sp - PL_stack_base)
2534 *(PL_stack_base + markix) = &PL_sv_undef;
2536 *(PL_stack_base + markix) = *PL_stack_sp;
2537 PL_stack_sp = PL_stack_base + markix;
2545 register I32 items = SP - MARK;
2546 AV* padlist = CvPADLIST(cv);
2547 SV** svp = AvARRAY(padlist);
2548 push_return(PL_op->op_next);
2549 PUSHBLOCK(cx, CXt_SUB, MARK);
2552 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2553 * that eval'' ops within this sub know the correct lexical space.
2554 * Owing the speed considerations, we choose to search for the cv
2555 * in doeval() instead.
2557 if (CvDEPTH(cv) < 2)
2558 (void)SvREFCNT_inc(cv);
2559 else { /* save temporaries on recursion? */
2560 PERL_STACK_OVERFLOW_CHECK();
2561 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2563 AV *newpad = newAV();
2564 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2565 I32 ix = AvFILLp((AV*)svp[1]);
2566 I32 names_fill = AvFILLp((AV*)svp[0]);
2567 svp = AvARRAY(svp[0]);
2568 for ( ;ix > 0; ix--) {
2569 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2570 char *name = SvPVX(svp[ix]);
2571 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2572 || *name == '&') /* anonymous code? */
2574 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2576 else { /* our own lexical */
2578 av_store(newpad, ix, sv = (SV*)newAV());
2579 else if (*name == '%')
2580 av_store(newpad, ix, sv = (SV*)newHV());
2582 av_store(newpad, ix, sv = NEWSV(0,0));
2586 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2587 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2590 av_store(newpad, ix, sv = NEWSV(0,0));
2594 av = newAV(); /* will be @_ */
2596 av_store(newpad, 0, (SV*)av);
2597 AvFLAGS(av) = AVf_REIFY;
2598 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2599 AvFILLp(padlist) = CvDEPTH(cv);
2600 svp = AvARRAY(padlist);
2605 AV* av = (AV*)PL_curpad[0];
2607 items = AvFILLp(av) + 1;
2609 /* Mark is at the end of the stack. */
2611 Copy(AvARRAY(av), SP + 1, items, SV*);
2616 #endif /* USE_THREADS */
2617 SAVEVPTR(PL_curpad);
2618 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2621 #endif /* USE_THREADS */
2627 DEBUG_S(PerlIO_printf(Perl_debug_log,
2628 "%p entersub preparing @_\n", thr));
2630 av = (AV*)PL_curpad[0];
2632 /* @_ is normally not REAL--this should only ever
2633 * happen when DB::sub() calls things that modify @_ */
2639 cx->blk_sub.savearray = GvAV(PL_defgv);
2640 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2641 #endif /* USE_THREADS */
2642 cx->blk_sub.argarray = av;
2645 if (items > AvMAX(av) + 1) {
2647 if (AvARRAY(av) != ary) {
2648 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2649 SvPVX(av) = (char*)ary;
2651 if (items > AvMAX(av) + 1) {
2652 AvMAX(av) = items - 1;
2653 Renew(ary,items,SV*);
2655 SvPVX(av) = (char*)ary;
2658 Copy(MARK,AvARRAY(av),items,SV*);
2659 AvFILLp(av) = items - 1;
2667 /* warning must come *after* we fully set up the context
2668 * stuff so that __WARN__ handlers can safely dounwind()
2671 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2672 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2673 sub_crush_depth(cv);
2675 DEBUG_S(PerlIO_printf(Perl_debug_log,
2676 "%p entersub returning %p\n", thr, CvSTART(cv)));
2678 RETURNOP(CvSTART(cv));
2683 Perl_sub_crush_depth(pTHX_ CV *cv)
2686 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2688 SV* tmpstr = sv_newmortal();
2689 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2690 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2701 U32 lval = PL_op->op_flags & OPf_MOD;
2702 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2706 elem -= PL_curcop->cop_arybase;
2707 if (SvTYPE(av) != SVt_PVAV)
2709 svp = av_fetch(av, elem, lval && !defer);
2711 if (!svp || *svp == &PL_sv_undef) {
2714 DIE(aTHX_ PL_no_aelem, elem);
2715 lv = sv_newmortal();
2716 sv_upgrade(lv, SVt_PVLV);
2718 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2719 LvTARG(lv) = SvREFCNT_inc(av);
2720 LvTARGOFF(lv) = elem;
2725 if (PL_op->op_private & OPpLVAL_INTRO)
2726 save_aelem(av, elem, svp);
2727 else if (PL_op->op_private & OPpDEREF)
2728 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2730 sv = (svp ? *svp : &PL_sv_undef);
2731 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2732 sv = sv_mortalcopy(sv);
2738 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2744 Perl_croak(aTHX_ PL_no_modify);
2745 if (SvTYPE(sv) < SVt_RV)
2746 sv_upgrade(sv, SVt_RV);
2747 else if (SvTYPE(sv) >= SVt_PV) {
2748 (void)SvOOK_off(sv);
2749 Safefree(SvPVX(sv));
2750 SvLEN(sv) = SvCUR(sv) = 0;
2754 SvRV(sv) = NEWSV(355,0);
2757 SvRV(sv) = (SV*)newAV();
2760 SvRV(sv) = (SV*)newHV();
2775 if (SvTYPE(rsv) == SVt_PVCV) {
2781 SETs(method_common(sv, Null(U32*)));
2788 SV* sv = cSVOP->op_sv;
2789 U32 hash = SvUVX(sv);
2791 XPUSHs(method_common(sv, &hash));
2796 S_method_common(pTHX_ SV* meth, U32* hashp)
2807 name = SvPV(meth, namelen);
2808 sv = *(PL_stack_base + TOPMARK + 1);
2819 !(packname = SvPV(sv, packlen)) ||
2820 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2821 !(ob=(SV*)GvIO(iogv)))
2824 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2825 ? !isIDFIRST_utf8((U8*)packname)
2826 : !isIDFIRST(*packname)
2829 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2830 SvOK(sv) ? "without a package or object reference"
2831 : "on an undefined value");
2833 stash = gv_stashpvn(packname, packlen, TRUE);
2836 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2839 if (!ob || !(SvOBJECT(ob)
2840 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2843 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2847 stash = SvSTASH(ob);
2850 /* shortcut for simple names */
2852 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2854 gv = (GV*)HeVAL(he);
2855 if (isGV(gv) && GvCV(gv) &&
2856 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2857 return (SV*)GvCV(gv);
2861 gv = gv_fetchmethod(stash, name);
2867 for (p = name; *p; p++) {
2869 sep = p, leaf = p + 1;
2870 else if (*p == ':' && *(p + 1) == ':')
2871 sep = p, leaf = p + 2;
2873 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2874 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2875 packlen = strlen(packname);
2879 packlen = sep - name;
2882 "Can't locate object method \"%s\" via package \"%s\"",
2885 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2890 unset_cvowner(pTHXo_ void *cvarg)
2892 register CV* cv = (CV *) cvarg;
2895 #endif /* DEBUGGING */
2897 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2898 thr, cv, SvPEEK((SV*)cv))));
2899 MUTEX_LOCK(CvMUTEXP(cv));
2900 DEBUG_S(if (CvDEPTH(cv) != 0)
2901 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2903 assert(thr == CvOWNER(cv));
2905 MUTEX_UNLOCK(CvMUTEXP(cv));
2908 #endif /* USE_THREADS */