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))))
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);
1060 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1062 sv_utf8_downgrade(*SP, TRUE);
1067 had_zerolen = (rx->startp[0] != -1
1068 && rx->startp[0] == rx->endp[0]);
1069 PUTBACK; /* EVAL blocks may use stack */
1070 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1075 LEAVE_SCOPE(oldsave);
1081 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1082 mg = mg_find(TARG, 'g');
1084 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1085 mg = mg_find(TARG, 'g');
1087 if (rx->startp[0] != -1) {
1088 mg->mg_len = rx->endp[0];
1089 if (rx->startp[0] == rx->endp[0])
1090 mg->mg_flags |= MGf_MINMATCH;
1092 mg->mg_flags &= ~MGf_MINMATCH;
1095 LEAVE_SCOPE(oldsave);
1099 yup: /* Confirmed by INTUIT */
1101 RX_MATCH_TAINTED_on(rx);
1102 TAINT_IF(RX_MATCH_TAINTED(rx));
1104 if (pm->op_pmflags & PMf_ONCE)
1105 pm->op_pmdynflags |= PMdf_USED;
1106 if (RX_MATCH_COPIED(rx))
1107 Safefree(rx->subbeg);
1108 RX_MATCH_COPIED_off(rx);
1109 rx->subbeg = Nullch;
1111 rx->subbeg = truebase;
1112 rx->startp[0] = s - truebase;
1113 rx->endp[0] = s - truebase + rx->minlen;
1114 rx->sublen = strend - truebase;
1117 if (PL_sawampersand) {
1120 rx->subbeg = savepvn(t, strend - t);
1121 rx->sublen = strend - t;
1122 RX_MATCH_COPIED_on(rx);
1123 off = rx->startp[0] = s - t;
1124 rx->endp[0] = off + rx->minlen;
1126 else { /* startp/endp are used by @- @+. */
1127 rx->startp[0] = s - truebase;
1128 rx->endp[0] = s - truebase + rx->minlen;
1130 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1131 LEAVE_SCOPE(oldsave);
1136 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1137 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1138 MAGIC* mg = mg_find(TARG, 'g');
1143 LEAVE_SCOPE(oldsave);
1144 if (gimme == G_ARRAY)
1150 Perl_do_readline(pTHX)
1152 dSP; dTARGETSTACKED;
1157 register IO *io = GvIO(PL_last_in_gv);
1158 register I32 type = PL_op->op_type;
1159 I32 gimme = GIMME_V;
1162 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1164 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1167 call_method("READLINE", gimme);
1170 if (gimme == G_SCALAR)
1171 SvSetMagicSV_nosteal(TARG, TOPs);
1178 if (IoFLAGS(io) & IOf_ARGV) {
1179 if (IoFLAGS(io) & IOf_START) {
1181 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1182 IoFLAGS(io) &= ~IOf_START;
1183 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1184 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1185 SvSETMAGIC(GvSV(PL_last_in_gv));
1190 fp = nextargv(PL_last_in_gv);
1191 if (!fp) { /* Note: fp != IoIFP(io) */
1192 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1195 else if (type == OP_GLOB) {
1196 SV *tmpcmd = NEWSV(55, 0);
1200 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1201 /* since spawning off a process is a real performance hit */
1203 #include <descrip.h>
1204 #include <lib$routines.h>
1207 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1208 char vmsspec[NAM$C_MAXRSS+1];
1209 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1210 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1211 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1214 struct dsc$descriptor_s wilddsc
1215 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1216 struct dsc$descriptor_vs rsdsc
1217 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1218 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1220 /* We could find out if there's an explicit dev/dir or version
1221 by peeking into lib$find_file's internal context at
1222 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1223 but that's unsupported, so I don't want to do it now and
1224 have it bite someone in the future. */
1225 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1226 cp = SvPV(tmpglob,i);
1228 if (cp[i] == ';') hasver = 1;
1230 if (sts) hasver = 1;
1234 hasdir = isunix = 1;
1237 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1242 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1244 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1245 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1246 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1247 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1248 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1249 &dfltdsc,NULL,NULL,NULL))&1)) {
1250 end = rstr + (unsigned long int) *rslt;
1251 if (!hasver) while (*end != ';') end--;
1252 *(end++) = '\n'; *end = '\0';
1253 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1255 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1260 while (*(--begin) != ']' && *begin != '>') ;
1263 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1265 if (cxt) (void)lib$find_file_end(&cxt);
1266 if (ok && sts != RMS$_NMF &&
1267 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1270 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1272 PerlIO_close(tmpfp);
1276 PerlIO_rewind(tmpfp);
1278 IoIFP(io) = fp = tmpfp;
1279 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1284 #ifdef MACOS_TRADITIONAL
1285 sv_setpv(tmpcmd, "glob ");
1286 sv_catsv(tmpcmd, tmpglob);
1287 sv_catpv(tmpcmd, " |");
1291 sv_setpv(tmpcmd, "for a in ");
1292 sv_catsv(tmpcmd, tmpglob);
1293 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1296 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1297 sv_catsv(tmpcmd, tmpglob);
1299 sv_setpv(tmpcmd, "perlglob ");
1300 sv_catsv(tmpcmd, tmpglob);
1301 sv_catpv(tmpcmd, " |");
1306 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1307 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1308 sv_catsv(tmpcmd, tmpglob);
1309 sv_catpv(tmpcmd, "' 2>/dev/null |");
1311 sv_setpv(tmpcmd, "echo ");
1312 sv_catsv(tmpcmd, tmpglob);
1314 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1316 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1319 #endif /* !DOSISH */
1320 #endif /* MACOS_TRADITIONAL */
1321 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1322 FALSE, O_RDONLY, 0, Nullfp);
1328 else if (type == OP_GLOB)
1330 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1331 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1332 || fp == PerlIO_stderr()))
1334 SV* sv = sv_newmortal();
1335 gv_efullname3(sv, PL_last_in_gv, Nullch);
1336 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1341 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1342 if (type == OP_GLOB)
1343 Perl_warner(aTHX_ WARN_GLOB,
1344 "glob failed (can't start child: %s)",
1347 report_closed_fh(PL_last_in_gv, io, "readline", "filehandle");
1349 if (gimme == G_SCALAR) {
1350 (void)SvOK_off(TARG);
1356 if (gimme == G_SCALAR) {
1360 (void)SvUPGRADE(sv, SVt_PV);
1361 tmplen = SvLEN(sv); /* remember if already alloced */
1363 Sv_Grow(sv, 80); /* try short-buffering it */
1364 if (type == OP_RCATLINE)
1370 sv = sv_2mortal(NEWSV(57, 80));
1374 /* delay EOF state for a snarfed empty file */
1375 #define SNARF_EOF(gimme,rs,io,sv) \
1376 (gimme != G_SCALAR || SvCUR(sv) \
1377 || !RsSNARF(rs) || (IoFLAGS(io) & IOf_NOLINE) \
1378 || ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1381 if (!sv_gets(sv, fp, offset)
1382 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1384 PerlIO_clearerr(fp);
1385 if (IoFLAGS(io) & IOf_ARGV) {
1386 fp = nextargv(PL_last_in_gv);
1389 (void)do_close(PL_last_in_gv, FALSE);
1391 else if (type == OP_GLOB) {
1392 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1393 Perl_warner(aTHX_ WARN_GLOB,
1394 "glob failed (child exited with status %d%s)",
1395 (int)(STATUS_CURRENT >> 8),
1396 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1399 if (gimme == G_SCALAR) {
1400 (void)SvOK_off(TARG);
1405 /* This should not be marked tainted if the fp is marked clean */
1406 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1413 if (type == OP_GLOB) {
1416 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1417 tmps = SvEND(sv) - 1;
1418 if (*tmps == *SvPVX(PL_rs)) {
1423 for (tmps = SvPVX(sv); *tmps; tmps++)
1424 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1425 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1427 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1428 (void)POPs; /* Unmatched wildcard? Chuck it... */
1432 if (gimme == G_ARRAY) {
1433 if (SvLEN(sv) - SvCUR(sv) > 20) {
1434 SvLEN_set(sv, SvCUR(sv)+1);
1435 Renew(SvPVX(sv), SvLEN(sv), char);
1437 sv = sv_2mortal(NEWSV(58, 80));
1440 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1441 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1445 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1446 Renew(SvPVX(sv), SvLEN(sv), char);
1455 register PERL_CONTEXT *cx;
1456 I32 gimme = OP_GIMME(PL_op, -1);
1459 if (cxstack_ix >= 0)
1460 gimme = cxstack[cxstack_ix].blk_gimme;
1468 PUSHBLOCK(cx, CXt_BLOCK, SP);
1480 U32 lval = PL_op->op_flags & OPf_MOD;
1481 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1484 if (SvTYPE(hv) == SVt_PVHV) {
1485 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1486 svp = he ? &HeVAL(he) : 0;
1488 else if (SvTYPE(hv) == SVt_PVAV) {
1489 if (PL_op->op_private & OPpLVAL_INTRO)
1490 DIE(aTHX_ "Can't localize pseudo-hash element");
1491 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1497 if (!svp || *svp == &PL_sv_undef) {
1502 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1504 lv = sv_newmortal();
1505 sv_upgrade(lv, SVt_PVLV);
1507 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1508 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1509 LvTARG(lv) = SvREFCNT_inc(hv);
1514 if (PL_op->op_private & OPpLVAL_INTRO) {
1515 if (HvNAME(hv) && isGV(*svp))
1516 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1518 save_helem(hv, keysv, svp);
1520 else if (PL_op->op_private & OPpDEREF)
1521 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1523 sv = (svp ? *svp : &PL_sv_undef);
1524 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1525 * Pushing the magical RHS on to the stack is useless, since
1526 * that magic is soon destined to be misled by the local(),
1527 * and thus the later pp_sassign() will fail to mg_get() the
1528 * old value. This should also cure problems with delayed
1529 * mg_get()s. GSAR 98-07-03 */
1530 if (!lval && SvGMAGICAL(sv))
1531 sv = sv_mortalcopy(sv);
1539 register PERL_CONTEXT *cx;
1545 if (PL_op->op_flags & OPf_SPECIAL) {
1546 cx = &cxstack[cxstack_ix];
1547 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1552 gimme = OP_GIMME(PL_op, -1);
1554 if (cxstack_ix >= 0)
1555 gimme = cxstack[cxstack_ix].blk_gimme;
1561 if (gimme == G_VOID)
1563 else if (gimme == G_SCALAR) {
1566 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1569 *MARK = sv_mortalcopy(TOPs);
1572 *MARK = &PL_sv_undef;
1576 else if (gimme == G_ARRAY) {
1577 /* in case LEAVE wipes old return values */
1578 for (mark = newsp + 1; mark <= SP; mark++) {
1579 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1580 *mark = sv_mortalcopy(*mark);
1581 TAINT_NOT; /* Each item is independent */
1585 PL_curpm = newpm; /* Don't pop $1 et al till now */
1595 register PERL_CONTEXT *cx;
1601 cx = &cxstack[cxstack_ix];
1602 if (CxTYPE(cx) != CXt_LOOP)
1603 DIE(aTHX_ "panic: pp_iter");
1605 itersvp = CxITERVAR(cx);
1606 av = cx->blk_loop.iterary;
1607 if (SvTYPE(av) != SVt_PVAV) {
1608 /* iterate ($min .. $max) */
1609 if (cx->blk_loop.iterlval) {
1610 /* string increment */
1611 register SV* cur = cx->blk_loop.iterlval;
1613 char *max = SvPV((SV*)av, maxlen);
1614 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1615 #ifndef USE_THREADS /* don't risk potential race */
1616 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1617 /* safe to reuse old SV */
1618 sv_setsv(*itersvp, cur);
1623 /* we need a fresh SV every time so that loop body sees a
1624 * completely new SV for closures/references to work as
1626 SvREFCNT_dec(*itersvp);
1627 *itersvp = newSVsv(cur);
1629 if (strEQ(SvPVX(cur), max))
1630 sv_setiv(cur, 0); /* terminate next time */
1637 /* integer increment */
1638 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1641 #ifndef USE_THREADS /* don't risk potential race */
1642 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1643 /* safe to reuse old SV */
1644 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1649 /* we need a fresh SV every time so that loop body sees a
1650 * completely new SV for closures/references to work as they
1652 SvREFCNT_dec(*itersvp);
1653 *itersvp = newSViv(cx->blk_loop.iterix++);
1659 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1662 SvREFCNT_dec(*itersvp);
1664 if ((sv = SvMAGICAL(av)
1665 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1666 : AvARRAY(av)[++cx->blk_loop.iterix]))
1670 if (av != PL_curstack && SvIMMORTAL(sv)) {
1671 SV *lv = cx->blk_loop.iterlval;
1672 if (lv && SvREFCNT(lv) > 1) {
1677 SvREFCNT_dec(LvTARG(lv));
1679 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1680 sv_upgrade(lv, SVt_PVLV);
1682 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1684 LvTARG(lv) = SvREFCNT_inc(av);
1685 LvTARGOFF(lv) = cx->blk_loop.iterix;
1686 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1690 *itersvp = SvREFCNT_inc(sv);
1697 register PMOP *pm = cPMOP;
1713 register REGEXP *rx = pm->op_pmregexp;
1715 int force_on_match = 0;
1716 I32 oldsave = PL_savestack_ix;
1718 /* known replacement string? */
1719 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1720 if (PL_op->op_flags & OPf_STACKED)
1726 if (SvREADONLY(TARG)
1727 || (SvTYPE(TARG) > SVt_PVLV
1728 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1729 DIE(aTHX_ PL_no_modify);
1732 s = SvPV(TARG, len);
1733 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1735 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1736 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1743 DIE(aTHX_ "panic: do_subst");
1746 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1747 position, once with zero-length,
1748 second time with non-zero. */
1750 if (!rx->prelen && PL_curpm) {
1752 rx = pm->op_pmregexp;
1754 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1755 ? REXEC_COPY_STR : 0;
1757 r_flags |= REXEC_SCREAM;
1758 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1759 SAVEINT(PL_multiline);
1760 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1763 if (rx->reganch & RE_USE_INTUIT) {
1764 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1768 /* How to do it in subst? */
1769 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1771 && ((rx->reganch & ROPT_NOSCAN)
1772 || !((rx->reganch & RE_INTUIT_TAIL)
1773 && (r_flags & REXEC_SCREAM))))
1778 /* only replace once? */
1779 once = !(rpm->op_pmflags & PMf_GLOBAL);
1781 /* known replacement string? */
1782 c = dstr ? SvPV(dstr, clen) : Nullch;
1784 /* can do inplace substitution? */
1785 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1786 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1787 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1788 r_flags | REXEC_CHECKED))
1792 LEAVE_SCOPE(oldsave);
1795 if (force_on_match) {
1797 s = SvPV_force(TARG, len);
1802 SvSCREAM_off(TARG); /* disable possible screamer */
1804 rxtainted |= RX_MATCH_TAINTED(rx);
1805 m = orig + rx->startp[0];
1806 d = orig + rx->endp[0];
1808 if (m - s > strend - d) { /* faster to shorten from end */
1810 Copy(c, m, clen, char);
1815 Move(d, m, i, char);
1819 SvCUR_set(TARG, m - s);
1822 else if ((i = m - s)) { /* faster from front */
1830 Copy(c, m, clen, char);
1835 Copy(c, d, clen, char);
1840 TAINT_IF(rxtainted & 1);
1846 if (iters++ > maxiters)
1847 DIE(aTHX_ "Substitution loop");
1848 rxtainted |= RX_MATCH_TAINTED(rx);
1849 m = rx->startp[0] + orig;
1853 Move(s, d, i, char);
1857 Copy(c, d, clen, char);
1860 s = rx->endp[0] + orig;
1861 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1863 /* don't match same null twice */
1864 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1867 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1868 Move(s, d, i+1, char); /* include the NUL */
1870 TAINT_IF(rxtainted & 1);
1872 PUSHs(sv_2mortal(newSViv((I32)iters)));
1874 (void)SvPOK_only(TARG);
1875 TAINT_IF(rxtainted);
1876 if (SvSMAGICAL(TARG)) {
1882 LEAVE_SCOPE(oldsave);
1886 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1887 r_flags | REXEC_CHECKED))
1889 if (force_on_match) {
1891 s = SvPV_force(TARG, len);
1894 rxtainted |= RX_MATCH_TAINTED(rx);
1895 dstr = NEWSV(25, len);
1896 sv_setpvn(dstr, m, s-m);
1899 register PERL_CONTEXT *cx;
1902 RETURNOP(cPMOP->op_pmreplroot);
1904 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1906 if (iters++ > maxiters)
1907 DIE(aTHX_ "Substitution loop");
1908 rxtainted |= RX_MATCH_TAINTED(rx);
1909 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1914 strend = s + (strend - m);
1916 m = rx->startp[0] + orig;
1917 sv_catpvn(dstr, s, m-s);
1918 s = rx->endp[0] + orig;
1920 sv_catpvn(dstr, c, clen);
1923 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1924 sv_catpvn(dstr, s, strend - s);
1926 (void)SvOOK_off(TARG);
1927 Safefree(SvPVX(TARG));
1928 SvPVX(TARG) = SvPVX(dstr);
1929 SvCUR_set(TARG, SvCUR(dstr));
1930 SvLEN_set(TARG, SvLEN(dstr));
1934 TAINT_IF(rxtainted & 1);
1936 PUSHs(sv_2mortal(newSViv((I32)iters)));
1938 (void)SvPOK_only(TARG);
1939 TAINT_IF(rxtainted);
1942 LEAVE_SCOPE(oldsave);
1951 LEAVE_SCOPE(oldsave);
1960 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1961 ++*PL_markstack_ptr;
1962 LEAVE; /* exit inner scope */
1965 if (PL_stack_base + *PL_markstack_ptr > SP) {
1967 I32 gimme = GIMME_V;
1969 LEAVE; /* exit outer scope */
1970 (void)POPMARK; /* pop src */
1971 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1972 (void)POPMARK; /* pop dst */
1973 SP = PL_stack_base + POPMARK; /* pop original mark */
1974 if (gimme == G_SCALAR) {
1978 else if (gimme == G_ARRAY)
1985 ENTER; /* enter inner scope */
1988 src = PL_stack_base[*PL_markstack_ptr];
1992 RETURNOP(cLOGOP->op_other);
2003 register PERL_CONTEXT *cx;
2009 if (gimme == G_SCALAR) {
2012 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2014 *MARK = SvREFCNT_inc(TOPs);
2019 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2021 *MARK = sv_mortalcopy(sv);
2026 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2030 *MARK = &PL_sv_undef;
2034 else if (gimme == G_ARRAY) {
2035 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2036 if (!SvTEMP(*MARK)) {
2037 *MARK = sv_mortalcopy(*MARK);
2038 TAINT_NOT; /* Each item is independent */
2044 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2045 PL_curpm = newpm; /* ... and pop $1 et al */
2049 return pop_return();
2052 /* This duplicates the above code because the above code must not
2053 * get any slower by more conditions */
2061 register PERL_CONTEXT *cx;
2068 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2069 /* We are an argument to a function or grep().
2070 * This kind of lvalueness was legal before lvalue
2071 * subroutines too, so be backward compatible:
2072 * cannot report errors. */
2074 /* Scalar context *is* possible, on the LHS of -> only,
2075 * as in f()->meth(). But this is not an lvalue. */
2076 if (gimme == G_SCALAR)
2078 if (gimme == G_ARRAY) {
2079 if (!CvLVALUE(cx->blk_sub.cv))
2080 goto temporise_array;
2081 EXTEND_MORTAL(SP - newsp);
2082 for (mark = newsp + 1; mark <= SP; mark++) {
2085 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2086 *mark = sv_mortalcopy(*mark);
2088 /* Can be a localized value subject to deletion. */
2089 PL_tmps_stack[++PL_tmps_ix] = *mark;
2090 (void)SvREFCNT_inc(*mark);
2095 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2096 /* Here we go for robustness, not for speed, so we change all
2097 * the refcounts so the caller gets a live guy. Cannot set
2098 * TEMP, so sv_2mortal is out of question. */
2099 if (!CvLVALUE(cx->blk_sub.cv)) {
2104 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2106 if (gimme == G_SCALAR) {
2110 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2115 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2116 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2118 else { /* Can be a localized value
2119 * subject to deletion. */
2120 PL_tmps_stack[++PL_tmps_ix] = *mark;
2121 (void)SvREFCNT_inc(*mark);
2124 else { /* Should not happen? */
2129 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2130 (MARK > SP ? "Empty array" : "Array"));
2134 else if (gimme == G_ARRAY) {
2135 EXTEND_MORTAL(SP - newsp);
2136 for (mark = newsp + 1; mark <= SP; mark++) {
2137 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2138 /* Might be flattened array after $#array = */
2144 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2145 (*mark != &PL_sv_undef)
2147 ? "a readonly value" : "a temporary")
2148 : "an uninitialized value");
2151 /* Can be a localized value subject to deletion. */
2152 PL_tmps_stack[++PL_tmps_ix] = *mark;
2153 (void)SvREFCNT_inc(*mark);
2159 if (gimme == G_SCALAR) {
2163 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2165 *MARK = SvREFCNT_inc(TOPs);
2170 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2172 *MARK = sv_mortalcopy(sv);
2177 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2181 *MARK = &PL_sv_undef;
2185 else if (gimme == G_ARRAY) {
2187 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2188 if (!SvTEMP(*MARK)) {
2189 *MARK = sv_mortalcopy(*MARK);
2190 TAINT_NOT; /* Each item is independent */
2197 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2198 PL_curpm = newpm; /* ... and pop $1 et al */
2202 return pop_return();
2207 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2210 SV *dbsv = GvSV(PL_DBsub);
2212 if (!PERLDB_SUB_NN) {
2216 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2217 || strEQ(GvNAME(gv), "END")
2218 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2219 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2220 && (gv = (GV*)*svp) ))) {
2221 /* Use GV from the stack as a fallback. */
2222 /* GV is potentially non-unique, or contain different CV. */
2223 sv_setsv(dbsv, newRV((SV*)cv));
2226 gv_efullname3(dbsv, gv, Nullch);
2230 (void)SvUPGRADE(dbsv, SVt_PVIV);
2231 (void)SvIOK_on(dbsv);
2232 SAVEIV(SvIVX(dbsv));
2233 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2237 PL_curcopdb = PL_curcop;
2238 cv = GvCV(PL_DBsub);
2248 register PERL_CONTEXT *cx;
2250 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2253 DIE(aTHX_ "Not a CODE reference");
2254 switch (SvTYPE(sv)) {
2260 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2262 SP = PL_stack_base + POPMARK;
2265 if (SvGMAGICAL(sv)) {
2267 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2270 sym = SvPV(sv, n_a);
2272 DIE(aTHX_ PL_no_usym, "a subroutine");
2273 if (PL_op->op_private & HINT_STRICT_REFS)
2274 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2275 cv = get_cv(sym, TRUE);
2279 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2280 tryAMAGICunDEREF(to_cv);
2283 if (SvTYPE(cv) == SVt_PVCV)
2288 DIE(aTHX_ "Not a CODE reference");
2293 if (!(cv = GvCVu((GV*)sv)))
2294 cv = sv_2cv(sv, &stash, &gv, FALSE);
2307 if (!CvROOT(cv) && !CvXSUB(cv)) {
2311 /* anonymous or undef'd function leaves us no recourse */
2312 if (CvANON(cv) || !(gv = CvGV(cv)))
2313 DIE(aTHX_ "Undefined subroutine called");
2315 /* autoloaded stub? */
2316 if (cv != GvCV(gv)) {
2319 /* should call AUTOLOAD now? */
2322 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2329 sub_name = sv_newmortal();
2330 gv_efullname3(sub_name, gv, Nullch);
2331 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2335 DIE(aTHX_ "Not a CODE reference");
2340 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2341 cv = get_db_sub(&sv, cv);
2343 DIE(aTHX_ "No DBsub routine");
2348 * First we need to check if the sub or method requires locking.
2349 * If so, we gain a lock on the CV, the first argument or the
2350 * stash (for static methods), as appropriate. This has to be
2351 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2352 * reschedule by returning a new op.
2354 MUTEX_LOCK(CvMUTEXP(cv));
2355 if (CvFLAGS(cv) & CVf_LOCKED) {
2357 if (CvFLAGS(cv) & CVf_METHOD) {
2358 if (SP > PL_stack_base + TOPMARK)
2359 sv = *(PL_stack_base + TOPMARK + 1);
2361 AV *av = (AV*)PL_curpad[0];
2362 if (hasargs || !av || AvFILLp(av) < 0
2363 || !(sv = AvARRAY(av)[0]))
2365 MUTEX_UNLOCK(CvMUTEXP(cv));
2366 DIE(aTHX_ "no argument for locked method call");
2373 char *stashname = SvPV(sv, len);
2374 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2380 MUTEX_UNLOCK(CvMUTEXP(cv));
2381 mg = condpair_magic(sv);
2382 MUTEX_LOCK(MgMUTEXP(mg));
2383 if (MgOWNER(mg) == thr)
2384 MUTEX_UNLOCK(MgMUTEXP(mg));
2387 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2389 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2391 MUTEX_UNLOCK(MgMUTEXP(mg));
2392 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2394 MUTEX_LOCK(CvMUTEXP(cv));
2397 * Now we have permission to enter the sub, we must distinguish
2398 * four cases. (0) It's an XSUB (in which case we don't care
2399 * about ownership); (1) it's ours already (and we're recursing);
2400 * (2) it's free (but we may already be using a cached clone);
2401 * (3) another thread owns it. Case (1) is easy: we just use it.
2402 * Case (2) means we look for a clone--if we have one, use it
2403 * otherwise grab ownership of cv. Case (3) means we look for a
2404 * clone (for non-XSUBs) and have to create one if we don't
2406 * Why look for a clone in case (2) when we could just grab
2407 * ownership of cv straight away? Well, we could be recursing,
2408 * i.e. we originally tried to enter cv while another thread
2409 * owned it (hence we used a clone) but it has been freed up
2410 * and we're now recursing into it. It may or may not be "better"
2411 * to use the clone but at least CvDEPTH can be trusted.
2413 if (CvOWNER(cv) == thr || CvXSUB(cv))
2414 MUTEX_UNLOCK(CvMUTEXP(cv));
2416 /* Case (2) or (3) */
2420 * XXX Might it be better to release CvMUTEXP(cv) while we
2421 * do the hv_fetch? We might find someone has pinched it
2422 * when we look again, in which case we would be in case
2423 * (3) instead of (2) so we'd have to clone. Would the fact
2424 * that we released the mutex more quickly make up for this?
2426 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2428 /* We already have a clone to use */
2429 MUTEX_UNLOCK(CvMUTEXP(cv));
2431 DEBUG_S(PerlIO_printf(Perl_debug_log,
2432 "entersub: %p already has clone %p:%s\n",
2433 thr, cv, SvPEEK((SV*)cv)));
2436 if (CvDEPTH(cv) == 0)
2437 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2440 /* (2) => grab ownership of cv. (3) => make clone */
2444 MUTEX_UNLOCK(CvMUTEXP(cv));
2445 DEBUG_S(PerlIO_printf(Perl_debug_log,
2446 "entersub: %p grabbing %p:%s in stash %s\n",
2447 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2448 HvNAME(CvSTASH(cv)) : "(none)"));
2451 /* Make a new clone. */
2453 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2454 MUTEX_UNLOCK(CvMUTEXP(cv));
2455 DEBUG_S((PerlIO_printf(Perl_debug_log,
2456 "entersub: %p cloning %p:%s\n",
2457 thr, cv, SvPEEK((SV*)cv))));
2459 * We're creating a new clone so there's no race
2460 * between the original MUTEX_UNLOCK and the
2461 * SvREFCNT_inc since no one will be trying to undef
2462 * it out from underneath us. At least, I don't think
2465 clonecv = cv_clone(cv);
2466 SvREFCNT_dec(cv); /* finished with this */
2467 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2468 CvOWNER(clonecv) = thr;
2472 DEBUG_S(if (CvDEPTH(cv) != 0)
2473 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2475 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2478 #endif /* USE_THREADS */
2481 #ifdef PERL_XSUB_OLDSTYLE
2482 if (CvOLDSTYLE(cv)) {
2483 I32 (*fp3)(int,int,int);
2485 register I32 items = SP - MARK;
2486 /* We dont worry to copy from @_. */
2491 PL_stack_sp = mark + 1;
2492 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2493 items = (*fp3)(CvXSUBANY(cv).any_i32,
2494 MARK - PL_stack_base + 1,
2496 PL_stack_sp = PL_stack_base + items;
2499 #endif /* PERL_XSUB_OLDSTYLE */
2501 I32 markix = TOPMARK;
2506 /* Need to copy @_ to stack. Alternative may be to
2507 * switch stack to @_, and copy return values
2508 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2512 av = (AV*)PL_curpad[0];
2514 av = GvAV(PL_defgv);
2515 #endif /* USE_THREADS */
2516 items = AvFILLp(av) + 1; /* @_ is not tieable */
2519 /* Mark is at the end of the stack. */
2521 Copy(AvARRAY(av), SP + 1, items, SV*);
2526 /* We assume first XSUB in &DB::sub is the called one. */
2528 SAVEVPTR(PL_curcop);
2529 PL_curcop = PL_curcopdb;
2532 /* Do we need to open block here? XXXX */
2533 (void)(*CvXSUB(cv))(aTHXo_ cv);
2535 /* Enforce some sanity in scalar context. */
2536 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2537 if (markix > PL_stack_sp - PL_stack_base)
2538 *(PL_stack_base + markix) = &PL_sv_undef;
2540 *(PL_stack_base + markix) = *PL_stack_sp;
2541 PL_stack_sp = PL_stack_base + markix;
2549 register I32 items = SP - MARK;
2550 AV* padlist = CvPADLIST(cv);
2551 SV** svp = AvARRAY(padlist);
2552 push_return(PL_op->op_next);
2553 PUSHBLOCK(cx, CXt_SUB, MARK);
2556 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2557 * that eval'' ops within this sub know the correct lexical space.
2558 * Owing the speed considerations, we choose to search for the cv
2559 * in doeval() instead.
2561 if (CvDEPTH(cv) < 2)
2562 (void)SvREFCNT_inc(cv);
2563 else { /* save temporaries on recursion? */
2564 PERL_STACK_OVERFLOW_CHECK();
2565 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2567 AV *newpad = newAV();
2568 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2569 I32 ix = AvFILLp((AV*)svp[1]);
2570 I32 names_fill = AvFILLp((AV*)svp[0]);
2571 svp = AvARRAY(svp[0]);
2572 for ( ;ix > 0; ix--) {
2573 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2574 char *name = SvPVX(svp[ix]);
2575 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2576 || *name == '&') /* anonymous code? */
2578 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2580 else { /* our own lexical */
2582 av_store(newpad, ix, sv = (SV*)newAV());
2583 else if (*name == '%')
2584 av_store(newpad, ix, sv = (SV*)newHV());
2586 av_store(newpad, ix, sv = NEWSV(0,0));
2590 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2591 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2594 av_store(newpad, ix, sv = NEWSV(0,0));
2598 av = newAV(); /* will be @_ */
2600 av_store(newpad, 0, (SV*)av);
2601 AvFLAGS(av) = AVf_REIFY;
2602 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2603 AvFILLp(padlist) = CvDEPTH(cv);
2604 svp = AvARRAY(padlist);
2609 AV* av = (AV*)PL_curpad[0];
2611 items = AvFILLp(av) + 1;
2613 /* Mark is at the end of the stack. */
2615 Copy(AvARRAY(av), SP + 1, items, SV*);
2620 #endif /* USE_THREADS */
2621 SAVEVPTR(PL_curpad);
2622 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2625 #endif /* USE_THREADS */
2631 DEBUG_S(PerlIO_printf(Perl_debug_log,
2632 "%p entersub preparing @_\n", thr));
2634 av = (AV*)PL_curpad[0];
2636 /* @_ is normally not REAL--this should only ever
2637 * happen when DB::sub() calls things that modify @_ */
2643 cx->blk_sub.savearray = GvAV(PL_defgv);
2644 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2645 #endif /* USE_THREADS */
2646 cx->blk_sub.argarray = av;
2649 if (items > AvMAX(av) + 1) {
2651 if (AvARRAY(av) != ary) {
2652 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2653 SvPVX(av) = (char*)ary;
2655 if (items > AvMAX(av) + 1) {
2656 AvMAX(av) = items - 1;
2657 Renew(ary,items,SV*);
2659 SvPVX(av) = (char*)ary;
2662 Copy(MARK,AvARRAY(av),items,SV*);
2663 AvFILLp(av) = items - 1;
2671 /* warning must come *after* we fully set up the context
2672 * stuff so that __WARN__ handlers can safely dounwind()
2675 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2676 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2677 sub_crush_depth(cv);
2679 DEBUG_S(PerlIO_printf(Perl_debug_log,
2680 "%p entersub returning %p\n", thr, CvSTART(cv)));
2682 RETURNOP(CvSTART(cv));
2687 Perl_sub_crush_depth(pTHX_ CV *cv)
2690 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2692 SV* tmpstr = sv_newmortal();
2693 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2694 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2705 U32 lval = PL_op->op_flags & OPf_MOD;
2706 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2710 elem -= PL_curcop->cop_arybase;
2711 if (SvTYPE(av) != SVt_PVAV)
2713 svp = av_fetch(av, elem, lval && !defer);
2715 if (!svp || *svp == &PL_sv_undef) {
2718 DIE(aTHX_ PL_no_aelem, elem);
2719 lv = sv_newmortal();
2720 sv_upgrade(lv, SVt_PVLV);
2722 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2723 LvTARG(lv) = SvREFCNT_inc(av);
2724 LvTARGOFF(lv) = elem;
2729 if (PL_op->op_private & OPpLVAL_INTRO)
2730 save_aelem(av, elem, svp);
2731 else if (PL_op->op_private & OPpDEREF)
2732 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2734 sv = (svp ? *svp : &PL_sv_undef);
2735 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2736 sv = sv_mortalcopy(sv);
2742 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2748 Perl_croak(aTHX_ PL_no_modify);
2749 if (SvTYPE(sv) < SVt_RV)
2750 sv_upgrade(sv, SVt_RV);
2751 else if (SvTYPE(sv) >= SVt_PV) {
2752 (void)SvOOK_off(sv);
2753 Safefree(SvPVX(sv));
2754 SvLEN(sv) = SvCUR(sv) = 0;
2758 SvRV(sv) = NEWSV(355,0);
2761 SvRV(sv) = (SV*)newAV();
2764 SvRV(sv) = (SV*)newHV();
2779 if (SvTYPE(rsv) == SVt_PVCV) {
2785 SETs(method_common(sv, Null(U32*)));
2792 SV* sv = cSVOP->op_sv;
2793 U32 hash = SvUVX(sv);
2795 XPUSHs(method_common(sv, &hash));
2800 S_method_common(pTHX_ SV* meth, U32* hashp)
2811 name = SvPV(meth, namelen);
2812 sv = *(PL_stack_base + TOPMARK + 1);
2823 !(packname = SvPV(sv, packlen)) ||
2824 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2825 !(ob=(SV*)GvIO(iogv)))
2828 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2829 ? !isIDFIRST_utf8((U8*)packname)
2830 : !isIDFIRST(*packname)
2833 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2834 SvOK(sv) ? "without a package or object reference"
2835 : "on an undefined value");
2837 stash = gv_stashpvn(packname, packlen, TRUE);
2840 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2843 if (!ob || !(SvOBJECT(ob)
2844 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2847 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2851 stash = SvSTASH(ob);
2854 /* shortcut for simple names */
2856 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2858 gv = (GV*)HeVAL(he);
2859 if (isGV(gv) && GvCV(gv) &&
2860 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2861 return (SV*)GvCV(gv);
2865 gv = gv_fetchmethod(stash, name);
2871 for (p = name; *p; p++) {
2873 sep = p, leaf = p + 1;
2874 else if (*p == ':' && *(p + 1) == ':')
2875 sep = p, leaf = p + 2;
2877 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2878 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2879 packlen = strlen(packname);
2883 packlen = sep - name;
2886 "Can't locate object method \"%s\" via package \"%s\"",
2889 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2894 unset_cvowner(pTHXo_ void *cvarg)
2896 register CV* cv = (CV *) cvarg;
2899 #endif /* DEBUGGING */
2901 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2902 thr, cv, SvPEEK((SV*)cv))));
2903 MUTEX_LOCK(CvMUTEXP(cv));
2904 DEBUG_S(if (CvDEPTH(cv) != 0)
2905 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2907 assert(thr == CvOWNER(cv));
2909 MUTEX_UNLOCK(CvMUTEXP(cv));
2912 #endif /* USE_THREADS */