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);
112 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
114 temp = left; left = right; right = temp;
116 if (PL_tainting && PL_tainted && !SvTAINTED(left))
118 SvSetMagicSV(right, left);
127 RETURNOP(cLOGOP->op_other);
129 RETURNOP(cLOGOP->op_next);
135 TAINT_NOT; /* Each statement is presumed innocent */
136 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
138 oldsave = PL_scopestack[PL_scopestack_ix - 1];
139 LEAVE_SCOPE(oldsave);
145 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
154 sv_insert(TARG, 0, 0, s, len);
158 sv_setpvn(TARG,s,len);
160 else if (SvGMAGICAL(TARG))
162 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
163 sv_setpv(TARG, ""); /* Suppress warning. */
164 s = SvPV_force(TARG, len);
168 #if defined(PERL_Y2KWARN)
169 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
171 char *s = SvPV(TARG,n);
172 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
173 && (n == 2 || !isDIGIT(s[n-3])))
175 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
176 "about to append an integer to '19'");
181 sv_utf8_upgrade(TARG);
182 sv_catpvn(TARG,s,len);
187 else if (!SvUTF8(right)) {
192 sv_setpvn(TARG,s,len); /* suppress warning */
202 if (PL_op->op_flags & OPf_MOD) {
203 if (PL_op->op_private & OPpLVAL_INTRO)
204 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
205 else if (PL_op->op_private & OPpDEREF) {
207 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
216 tryAMAGICunTARGET(iter, 0);
217 PL_last_in_gv = (GV*)(*PL_stack_sp--);
218 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
219 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
220 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
223 XPUSHs((SV*)PL_last_in_gv);
226 PL_last_in_gv = (GV*)(*PL_stack_sp--);
229 return do_readline();
234 djSP; tryAMAGICbinSET(eq,0);
237 SETs(boolSV(TOPn == value));
245 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
246 DIE(aTHX_ PL_no_modify);
247 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
248 SvIVX(TOPs) != IV_MAX)
251 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
266 RETURNOP(cLOGOP->op_other);
272 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
275 SETn( left + right );
283 AV *av = GvAV(cGVOP_gv);
284 U32 lval = PL_op->op_flags & OPf_MOD;
285 SV** svp = av_fetch(av, PL_op->op_private, lval);
286 SV *sv = (svp ? *svp : &PL_sv_undef);
288 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
289 sv = sv_mortalcopy(sv);
296 djSP; dMARK; dTARGET;
298 do_join(TARG, *MARK, MARK, SP);
309 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
310 * will be enough to hold an OP*.
312 SV* sv = sv_newmortal();
313 sv_upgrade(sv, SVt_PVLV);
315 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
323 /* Oversized hot code. */
327 djSP; dMARK; dORIGMARK;
334 if (PL_op->op_flags & OPf_STACKED)
338 if (mg = SvTIED_mg((SV*)gv, 'q')) {
339 if (MARK == ORIGMARK) {
340 /* If using default handle then we need to make space to
341 * pass object as 1st arg, so move other args up ...
345 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
349 *MARK = SvTIED_obj((SV*)gv, mg);
352 call_method("PRINT", G_SCALAR);
360 if (!(io = GvIO(gv))) {
361 if (ckWARN(WARN_UNOPENED)) {
362 SV* sv = sv_newmortal();
363 gv_efullname3(sv, gv, Nullch);
364 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
367 SETERRNO(EBADF,RMS$_IFI);
370 else if (!(fp = IoOFP(io))) {
371 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
373 SV* sv = sv_newmortal();
374 gv_efullname3(sv, gv, Nullch);
375 Perl_warner(aTHX_ WARN_IO,
376 "Filehandle %s opened only for input",
379 else if (ckWARN(WARN_CLOSED))
380 report_closed_fh(gv, io, "print", "filehandle");
382 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
389 if (!do_print(*MARK, fp))
393 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
402 if (!do_print(*MARK, fp))
411 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
414 if (IoFLAGS(io) & IOf_FLUSH)
415 if (PerlIO_flush(fp) == EOF)
436 tryAMAGICunDEREF(to_av);
439 if (SvTYPE(av) != SVt_PVAV)
440 DIE(aTHX_ "Not an ARRAY reference");
441 if (PL_op->op_flags & OPf_REF) {
447 if (SvTYPE(sv) == SVt_PVAV) {
449 if (PL_op->op_flags & OPf_REF) {
457 if (SvTYPE(sv) != SVt_PVGV) {
461 if (SvGMAGICAL(sv)) {
467 if (PL_op->op_flags & OPf_REF ||
468 PL_op->op_private & HINT_STRICT_REFS)
469 DIE(aTHX_ PL_no_usym, "an ARRAY");
470 if (ckWARN(WARN_UNINITIALIZED))
472 if (GIMME == G_ARRAY) {
479 if ((PL_op->op_flags & OPf_SPECIAL) &&
480 !(PL_op->op_flags & OPf_MOD))
482 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
487 if (PL_op->op_private & HINT_STRICT_REFS)
488 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
489 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
496 if (PL_op->op_private & OPpLVAL_INTRO)
498 if (PL_op->op_flags & OPf_REF) {
505 if (GIMME == G_ARRAY) {
506 I32 maxarg = AvFILL(av) + 1;
507 (void)POPs; /* XXXX May be optimized away? */
509 if (SvRMAGICAL(av)) {
511 for (i=0; i < maxarg; i++) {
512 SV **svp = av_fetch(av, i, FALSE);
513 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
517 Copy(AvARRAY(av), SP+1, maxarg, SV*);
523 I32 maxarg = AvFILL(av) + 1;
536 tryAMAGICunDEREF(to_hv);
539 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
540 DIE(aTHX_ "Not a HASH reference");
541 if (PL_op->op_flags & OPf_REF) {
547 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
549 if (PL_op->op_flags & OPf_REF) {
557 if (SvTYPE(sv) != SVt_PVGV) {
561 if (SvGMAGICAL(sv)) {
567 if (PL_op->op_flags & OPf_REF ||
568 PL_op->op_private & HINT_STRICT_REFS)
569 DIE(aTHX_ PL_no_usym, "a HASH");
570 if (ckWARN(WARN_UNINITIALIZED))
572 if (GIMME == G_ARRAY) {
579 if ((PL_op->op_flags & OPf_SPECIAL) &&
580 !(PL_op->op_flags & OPf_MOD))
582 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
587 if (PL_op->op_private & HINT_STRICT_REFS)
588 DIE(aTHX_ PL_no_symref, sym, "a HASH");
589 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
596 if (PL_op->op_private & OPpLVAL_INTRO)
598 if (PL_op->op_flags & OPf_REF) {
605 if (GIMME == G_ARRAY) { /* array wanted */
606 *PL_stack_sp = (SV*)hv;
611 if (SvTYPE(hv) == SVt_PVAV)
612 hv = avhv_keys((AV*)hv);
614 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
615 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
625 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
632 leftop = ((BINOP*)PL_op)->op_last;
634 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
635 leftop = ((LISTOP*)leftop)->op_first;
637 /* Skip PUSHMARK and each element already assigned to. */
638 for (i = lelem - firstlelem; i > 0; i--) {
639 leftop = leftop->op_sibling;
642 if (leftop->op_type != OP_RV2HV)
647 av_fill(ary, 0); /* clear all but the fields hash */
648 if (lastrelem >= relem) {
649 while (relem < lastrelem) { /* gobble up all the rest */
653 /* Avoid a memory leak when avhv_store_ent dies. */
654 tmpstr = sv_newmortal();
655 sv_setsv(tmpstr,relem[1]); /* value */
657 if (avhv_store_ent(ary,relem[0],tmpstr,0))
658 SvREFCNT_inc(tmpstr);
659 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
665 if (relem == lastrelem)
671 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
675 if (ckWARN(WARN_MISC)) {
676 if (relem == firstrelem &&
678 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
679 SvTYPE(SvRV(*relem)) == SVt_PVHV))
681 Perl_warner(aTHX_ WARN_MISC,
682 "Reference found where even-sized list expected");
685 Perl_warner(aTHX_ WARN_MISC,
686 "Odd number of elements in hash assignment");
688 if (SvTYPE(hash) == SVt_PVAV) {
690 tmpstr = sv_newmortal();
691 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
692 SvREFCNT_inc(tmpstr);
693 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
698 tmpstr = NEWSV(29,0);
699 didstore = hv_store_ent(hash,*relem,tmpstr,0);
700 if (SvMAGICAL(hash)) {
701 if (SvSMAGICAL(tmpstr))
714 SV **lastlelem = PL_stack_sp;
715 SV **lastrelem = PL_stack_base + POPMARK;
716 SV **firstrelem = PL_stack_base + POPMARK + 1;
717 SV **firstlelem = lastrelem + 1;
730 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
732 /* If there's a common identifier on both sides we have to take
733 * special care that assigning the identifier on the left doesn't
734 * clobber a value on the right that's used later in the list.
736 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
737 EXTEND_MORTAL(lastrelem - firstrelem + 1);
738 for (relem = firstrelem; relem <= lastrelem; relem++) {
741 TAINT_NOT; /* Each item is independent */
742 *relem = sv_mortalcopy(sv);
752 while (lelem <= lastlelem) {
753 TAINT_NOT; /* Each item stands on its own, taintwise. */
755 switch (SvTYPE(sv)) {
758 magic = SvMAGICAL(ary) != 0;
759 if (PL_op->op_private & OPpASSIGN_HASH) {
760 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
766 do_oddball((HV*)ary, relem, firstrelem);
768 relem = lastrelem + 1;
773 av_extend(ary, lastrelem - relem);
775 while (relem <= lastrelem) { /* gobble up all the rest */
781 didstore = av_store(ary,i++,sv);
791 case SVt_PVHV: { /* normal hash */
795 magic = SvMAGICAL(hash) != 0;
798 while (relem < lastrelem) { /* gobble up all the rest */
803 sv = &PL_sv_no, relem++;
804 tmpstr = NEWSV(29,0);
806 sv_setsv(tmpstr,*relem); /* value */
808 didstore = hv_store_ent(hash,sv,tmpstr,0);
810 if (SvSMAGICAL(tmpstr))
817 if (relem == lastrelem) {
818 do_oddball(hash, relem, firstrelem);
824 if (SvIMMORTAL(sv)) {
825 if (relem <= lastrelem)
829 if (relem <= lastrelem) {
830 sv_setsv(sv, *relem);
834 sv_setsv(sv, &PL_sv_undef);
839 if (PL_delaymagic & ~DM_DELAY) {
840 if (PL_delaymagic & DM_UID) {
842 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
845 (void)setreuid(PL_uid,PL_euid);
848 if ((PL_delaymagic & DM_UID) == DM_RUID) {
849 (void)setruid(PL_uid);
850 PL_delaymagic &= ~DM_RUID;
852 # endif /* HAS_SETRUID */
854 if ((PL_delaymagic & DM_UID) == DM_EUID) {
855 (void)seteuid(PL_uid);
856 PL_delaymagic &= ~DM_EUID;
858 # endif /* HAS_SETEUID */
859 if (PL_delaymagic & DM_UID) {
860 if (PL_uid != PL_euid)
861 DIE(aTHX_ "No setreuid available");
862 (void)PerlProc_setuid(PL_uid);
864 # endif /* HAS_SETREUID */
865 #endif /* HAS_SETRESUID */
866 PL_uid = PerlProc_getuid();
867 PL_euid = PerlProc_geteuid();
869 if (PL_delaymagic & DM_GID) {
871 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
874 (void)setregid(PL_gid,PL_egid);
877 if ((PL_delaymagic & DM_GID) == DM_RGID) {
878 (void)setrgid(PL_gid);
879 PL_delaymagic &= ~DM_RGID;
881 # endif /* HAS_SETRGID */
883 if ((PL_delaymagic & DM_GID) == DM_EGID) {
884 (void)setegid(PL_gid);
885 PL_delaymagic &= ~DM_EGID;
887 # endif /* HAS_SETEGID */
888 if (PL_delaymagic & DM_GID) {
889 if (PL_gid != PL_egid)
890 DIE(aTHX_ "No setregid available");
891 (void)PerlProc_setgid(PL_gid);
893 # endif /* HAS_SETREGID */
894 #endif /* HAS_SETRESGID */
895 PL_gid = PerlProc_getgid();
896 PL_egid = PerlProc_getegid();
898 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
905 else if (gimme == G_SCALAR) {
908 SETi(lastrelem - firstrelem + 1);
914 SP = firstrelem + (lastlelem - firstlelem);
915 lelem = firstlelem + (relem - firstrelem);
917 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
925 register PMOP *pm = cPMOP;
926 SV *rv = sv_newmortal();
927 SV *sv = newSVrv(rv, "Regexp");
928 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
935 register PMOP *pm = cPMOP;
940 I32 r_flags = REXEC_CHECKED;
941 char *truebase; /* Start of string */
942 register REGEXP *rx = pm->op_pmregexp;
947 I32 oldsave = PL_savestack_ix;
948 I32 update_minmatch = 1;
951 if (PL_op->op_flags & OPf_STACKED)
957 PUTBACK; /* EVAL blocks need stack_sp. */
961 DIE(aTHX_ "panic: do_match");
962 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
963 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
966 if (pm->op_pmdynflags & PMdf_USED) {
968 if (gimme == G_ARRAY)
973 if (!rx->prelen && PL_curpm) {
975 rx = pm->op_pmregexp;
977 if (rx->minlen > len) goto failure;
981 /* XXXX What part of this is needed with true \G-support? */
982 if (global = pm->op_pmflags & PMf_GLOBAL) {
984 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
985 MAGIC* mg = mg_find(TARG, 'g');
986 if (mg && mg->mg_len >= 0) {
987 if (!(rx->reganch & ROPT_GPOS_SEEN))
988 rx->endp[0] = rx->startp[0] = mg->mg_len;
989 else if (rx->reganch & ROPT_ANCH_GPOS) {
990 r_flags |= REXEC_IGNOREPOS;
991 rx->endp[0] = rx->startp[0] = mg->mg_len;
993 minmatch = (mg->mg_flags & MGf_MINMATCH);
998 if ((gimme != G_ARRAY && !global && rx->nparens)
999 || SvTEMP(TARG) || PL_sawampersand)
1000 r_flags |= REXEC_COPY_STR;
1002 r_flags |= REXEC_SCREAM;
1004 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1005 SAVEINT(PL_multiline);
1006 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1010 if (global && rx->startp[0] != -1) {
1011 t = s = rx->endp[0] + truebase;
1012 if ((s + rx->minlen) > strend)
1014 if (update_minmatch++)
1015 minmatch = had_zerolen;
1017 if (rx->reganch & RE_USE_INTUIT) {
1018 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1022 if ( (rx->reganch & ROPT_CHECK_ALL)
1024 && ((rx->reganch & ROPT_NOSCAN)
1025 || !((rx->reganch & RE_INTUIT_TAIL)
1026 && (r_flags & REXEC_SCREAM))))
1029 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1032 if (pm->op_pmflags & PMf_ONCE)
1033 pm->op_pmdynflags |= PMdf_USED;
1042 RX_MATCH_TAINTED_on(rx);
1043 TAINT_IF(RX_MATCH_TAINTED(rx));
1044 if (gimme == G_ARRAY) {
1047 iters = rx->nparens;
1048 if (global && !iters)
1052 SPAGAIN; /* EVAL blocks could move the stack. */
1053 EXTEND(SP, iters + i);
1054 EXTEND_MORTAL(iters + i);
1055 for (i = !i; i <= iters; i++) {
1056 PUSHs(sv_newmortal());
1058 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1059 len = rx->endp[i] - rx->startp[i];
1060 s = rx->startp[i] + truebase;
1061 sv_setpvn(*SP, s, len);
1065 had_zerolen = (rx->startp[0] != -1
1066 && rx->startp[0] == rx->endp[0]);
1067 PUTBACK; /* EVAL blocks may use stack */
1068 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1073 LEAVE_SCOPE(oldsave);
1079 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1080 mg = mg_find(TARG, 'g');
1082 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1083 mg = mg_find(TARG, 'g');
1085 if (rx->startp[0] != -1) {
1086 mg->mg_len = rx->endp[0];
1087 if (rx->startp[0] == rx->endp[0])
1088 mg->mg_flags |= MGf_MINMATCH;
1090 mg->mg_flags &= ~MGf_MINMATCH;
1093 LEAVE_SCOPE(oldsave);
1097 yup: /* Confirmed by INTUIT */
1099 RX_MATCH_TAINTED_on(rx);
1100 TAINT_IF(RX_MATCH_TAINTED(rx));
1102 if (pm->op_pmflags & PMf_ONCE)
1103 pm->op_pmdynflags |= PMdf_USED;
1104 if (RX_MATCH_COPIED(rx))
1105 Safefree(rx->subbeg);
1106 RX_MATCH_COPIED_off(rx);
1107 rx->subbeg = Nullch;
1109 rx->subbeg = truebase;
1110 rx->startp[0] = s - truebase;
1111 rx->endp[0] = s - truebase + rx->minlen;
1112 rx->sublen = strend - truebase;
1115 if (PL_sawampersand) {
1118 rx->subbeg = savepvn(t, strend - t);
1119 rx->sublen = strend - t;
1120 RX_MATCH_COPIED_on(rx);
1121 off = rx->startp[0] = s - t;
1122 rx->endp[0] = off + rx->minlen;
1124 else { /* startp/endp are used by @- @+. */
1125 rx->startp[0] = s - truebase;
1126 rx->endp[0] = s - truebase + rx->minlen;
1128 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1129 LEAVE_SCOPE(oldsave);
1134 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1135 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1136 MAGIC* mg = mg_find(TARG, 'g');
1141 LEAVE_SCOPE(oldsave);
1142 if (gimme == G_ARRAY)
1148 Perl_do_readline(pTHX)
1150 dSP; dTARGETSTACKED;
1155 register IO *io = GvIO(PL_last_in_gv);
1156 register I32 type = PL_op->op_type;
1157 I32 gimme = GIMME_V;
1160 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1162 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1165 call_method("READLINE", gimme);
1168 if (gimme == G_SCALAR)
1169 SvSetMagicSV_nosteal(TARG, TOPs);
1176 if (IoFLAGS(io) & IOf_ARGV) {
1177 if (IoFLAGS(io) & IOf_START) {
1179 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1180 IoFLAGS(io) &= ~IOf_START;
1181 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1182 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1183 SvSETMAGIC(GvSV(PL_last_in_gv));
1188 fp = nextargv(PL_last_in_gv);
1189 if (!fp) { /* Note: fp != IoIFP(io) */
1190 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1193 else if (type == OP_GLOB) {
1194 SV *tmpcmd = NEWSV(55, 0);
1198 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1199 /* since spawning off a process is a real performance hit */
1201 #include <descrip.h>
1202 #include <lib$routines.h>
1205 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1206 char vmsspec[NAM$C_MAXRSS+1];
1207 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1208 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1209 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1212 struct dsc$descriptor_s wilddsc
1213 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1214 struct dsc$descriptor_vs rsdsc
1215 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1216 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1218 /* We could find out if there's an explicit dev/dir or version
1219 by peeking into lib$find_file's internal context at
1220 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1221 but that's unsupported, so I don't want to do it now and
1222 have it bite someone in the future. */
1223 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1224 cp = SvPV(tmpglob,i);
1226 if (cp[i] == ';') hasver = 1;
1228 if (sts) hasver = 1;
1232 hasdir = isunix = 1;
1235 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1240 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1242 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1243 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1244 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1245 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1246 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1247 &dfltdsc,NULL,NULL,NULL))&1)) {
1248 end = rstr + (unsigned long int) *rslt;
1249 if (!hasver) while (*end != ';') end--;
1250 *(end++) = '\n'; *end = '\0';
1251 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1253 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1258 while (*(--begin) != ']' && *begin != '>') ;
1261 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1263 if (cxt) (void)lib$find_file_end(&cxt);
1264 if (ok && sts != RMS$_NMF &&
1265 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1268 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1270 PerlIO_close(tmpfp);
1274 PerlIO_rewind(tmpfp);
1276 IoIFP(io) = fp = tmpfp;
1277 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1282 #ifdef MACOS_TRADITIONAL
1283 sv_setpv(tmpcmd, "glob ");
1284 sv_catsv(tmpcmd, tmpglob);
1285 sv_catpv(tmpcmd, " |");
1289 sv_setpv(tmpcmd, "for a in ");
1290 sv_catsv(tmpcmd, tmpglob);
1291 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1294 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1295 sv_catsv(tmpcmd, tmpglob);
1297 sv_setpv(tmpcmd, "perlglob ");
1298 sv_catsv(tmpcmd, tmpglob);
1299 sv_catpv(tmpcmd, " |");
1304 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1305 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1306 sv_catsv(tmpcmd, tmpglob);
1307 sv_catpv(tmpcmd, "' 2>/dev/null |");
1309 sv_setpv(tmpcmd, "echo ");
1310 sv_catsv(tmpcmd, tmpglob);
1312 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1314 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1317 #endif /* !DOSISH */
1318 #endif /* MACOS_TRADITIONAL */
1319 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1320 FALSE, O_RDONLY, 0, Nullfp);
1326 else if (type == OP_GLOB)
1328 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1329 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1330 || fp == PerlIO_stderr()))
1332 SV* sv = sv_newmortal();
1333 gv_efullname3(sv, PL_last_in_gv, Nullch);
1334 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1339 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1340 if (type == OP_GLOB)
1341 Perl_warner(aTHX_ WARN_GLOB,
1342 "glob failed (can't start child: %s)",
1345 report_closed_fh(PL_last_in_gv, io, "readline", "filehandle");
1347 if (gimme == G_SCALAR) {
1348 (void)SvOK_off(TARG);
1354 if (gimme == G_SCALAR) {
1358 (void)SvUPGRADE(sv, SVt_PV);
1359 tmplen = SvLEN(sv); /* remember if already alloced */
1361 Sv_Grow(sv, 80); /* try short-buffering it */
1362 if (type == OP_RCATLINE)
1368 sv = sv_2mortal(NEWSV(57, 80));
1372 /* delay EOF state for a snarfed empty file */
1373 #define SNARF_EOF(gimme,rs,io,sv) \
1374 (gimme != G_SCALAR || SvCUR(sv) \
1375 || !RsSNARF(rs) || (IoFLAGS(io) & IOf_NOLINE) \
1376 || ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1379 if (!sv_gets(sv, fp, offset)
1380 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1382 PerlIO_clearerr(fp);
1383 if (IoFLAGS(io) & IOf_ARGV) {
1384 fp = nextargv(PL_last_in_gv);
1387 (void)do_close(PL_last_in_gv, FALSE);
1389 else if (type == OP_GLOB) {
1390 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1391 Perl_warner(aTHX_ WARN_GLOB,
1392 "glob failed (child exited with status %d%s)",
1393 (int)(STATUS_CURRENT >> 8),
1394 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1397 if (gimme == G_SCALAR) {
1398 (void)SvOK_off(TARG);
1403 /* This should not be marked tainted if the fp is marked clean */
1404 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1411 if (type == OP_GLOB) {
1414 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1415 tmps = SvEND(sv) - 1;
1416 if (*tmps == *SvPVX(PL_rs)) {
1421 for (tmps = SvPVX(sv); *tmps; tmps++)
1422 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1423 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1425 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1426 (void)POPs; /* Unmatched wildcard? Chuck it... */
1430 if (gimme == G_ARRAY) {
1431 if (SvLEN(sv) - SvCUR(sv) > 20) {
1432 SvLEN_set(sv, SvCUR(sv)+1);
1433 Renew(SvPVX(sv), SvLEN(sv), char);
1435 sv = sv_2mortal(NEWSV(58, 80));
1438 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1439 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1443 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1444 Renew(SvPVX(sv), SvLEN(sv), char);
1453 register PERL_CONTEXT *cx;
1454 I32 gimme = OP_GIMME(PL_op, -1);
1457 if (cxstack_ix >= 0)
1458 gimme = cxstack[cxstack_ix].blk_gimme;
1466 PUSHBLOCK(cx, CXt_BLOCK, SP);
1478 U32 lval = PL_op->op_flags & OPf_MOD;
1479 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1482 if (SvTYPE(hv) == SVt_PVHV) {
1483 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1484 svp = he ? &HeVAL(he) : 0;
1486 else if (SvTYPE(hv) == SVt_PVAV) {
1487 if (PL_op->op_private & OPpLVAL_INTRO)
1488 DIE(aTHX_ "Can't localize pseudo-hash element");
1489 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1495 if (!svp || *svp == &PL_sv_undef) {
1500 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1502 lv = sv_newmortal();
1503 sv_upgrade(lv, SVt_PVLV);
1505 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1506 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1507 LvTARG(lv) = SvREFCNT_inc(hv);
1512 if (PL_op->op_private & OPpLVAL_INTRO) {
1513 if (HvNAME(hv) && isGV(*svp))
1514 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1516 save_helem(hv, keysv, svp);
1518 else if (PL_op->op_private & OPpDEREF)
1519 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1521 sv = (svp ? *svp : &PL_sv_undef);
1522 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1523 * Pushing the magical RHS on to the stack is useless, since
1524 * that magic is soon destined to be misled by the local(),
1525 * and thus the later pp_sassign() will fail to mg_get() the
1526 * old value. This should also cure problems with delayed
1527 * mg_get()s. GSAR 98-07-03 */
1528 if (!lval && SvGMAGICAL(sv))
1529 sv = sv_mortalcopy(sv);
1537 register PERL_CONTEXT *cx;
1543 if (PL_op->op_flags & OPf_SPECIAL) {
1544 cx = &cxstack[cxstack_ix];
1545 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1550 gimme = OP_GIMME(PL_op, -1);
1552 if (cxstack_ix >= 0)
1553 gimme = cxstack[cxstack_ix].blk_gimme;
1559 if (gimme == G_VOID)
1561 else if (gimme == G_SCALAR) {
1564 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1567 *MARK = sv_mortalcopy(TOPs);
1570 *MARK = &PL_sv_undef;
1574 else if (gimme == G_ARRAY) {
1575 /* in case LEAVE wipes old return values */
1576 for (mark = newsp + 1; mark <= SP; mark++) {
1577 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1578 *mark = sv_mortalcopy(*mark);
1579 TAINT_NOT; /* Each item is independent */
1583 PL_curpm = newpm; /* Don't pop $1 et al till now */
1593 register PERL_CONTEXT *cx;
1599 cx = &cxstack[cxstack_ix];
1600 if (CxTYPE(cx) != CXt_LOOP)
1601 DIE(aTHX_ "panic: pp_iter");
1603 itersvp = CxITERVAR(cx);
1604 av = cx->blk_loop.iterary;
1605 if (SvTYPE(av) != SVt_PVAV) {
1606 /* iterate ($min .. $max) */
1607 if (cx->blk_loop.iterlval) {
1608 /* string increment */
1609 register SV* cur = cx->blk_loop.iterlval;
1611 char *max = SvPV((SV*)av, maxlen);
1612 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1613 #ifndef USE_THREADS /* don't risk potential race */
1614 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1615 /* safe to reuse old SV */
1616 sv_setsv(*itersvp, cur);
1621 /* we need a fresh SV every time so that loop body sees a
1622 * completely new SV for closures/references to work as
1624 SvREFCNT_dec(*itersvp);
1625 *itersvp = newSVsv(cur);
1627 if (strEQ(SvPVX(cur), max))
1628 sv_setiv(cur, 0); /* terminate next time */
1635 /* integer increment */
1636 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1639 #ifndef USE_THREADS /* don't risk potential race */
1640 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1641 /* safe to reuse old SV */
1642 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1647 /* we need a fresh SV every time so that loop body sees a
1648 * completely new SV for closures/references to work as they
1650 SvREFCNT_dec(*itersvp);
1651 *itersvp = newSViv(cx->blk_loop.iterix++);
1657 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1660 SvREFCNT_dec(*itersvp);
1662 if (sv = (SvMAGICAL(av))
1663 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1664 : AvARRAY(av)[++cx->blk_loop.iterix])
1668 if (av != PL_curstack && SvIMMORTAL(sv)) {
1669 SV *lv = cx->blk_loop.iterlval;
1670 if (lv && SvREFCNT(lv) > 1) {
1675 SvREFCNT_dec(LvTARG(lv));
1677 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1678 sv_upgrade(lv, SVt_PVLV);
1680 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1682 LvTARG(lv) = SvREFCNT_inc(av);
1683 LvTARGOFF(lv) = cx->blk_loop.iterix;
1684 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1688 *itersvp = SvREFCNT_inc(sv);
1695 register PMOP *pm = cPMOP;
1711 register REGEXP *rx = pm->op_pmregexp;
1713 int force_on_match = 0;
1714 I32 oldsave = PL_savestack_ix;
1715 I32 update_minmatch = 1;
1717 /* known replacement string? */
1718 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1719 if (PL_op->op_flags & OPf_STACKED)
1725 if (SvREADONLY(TARG)
1726 || (SvTYPE(TARG) > SVt_PVLV
1727 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1728 DIE(aTHX_ PL_no_modify);
1731 s = SvPV(TARG, len);
1732 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1734 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1735 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1742 DIE(aTHX_ "panic: do_subst");
1745 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1746 position, once with zero-length,
1747 second time with non-zero. */
1749 if (!rx->prelen && PL_curpm) {
1751 rx = pm->op_pmregexp;
1753 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1754 ? REXEC_COPY_STR : 0;
1756 r_flags |= REXEC_SCREAM;
1757 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1758 SAVEINT(PL_multiline);
1759 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1762 if (rx->reganch & RE_USE_INTUIT) {
1763 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1767 /* How to do it in subst? */
1768 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1770 && ((rx->reganch & ROPT_NOSCAN)
1771 || !((rx->reganch & RE_INTUIT_TAIL)
1772 && (r_flags & REXEC_SCREAM))))
1777 /* only replace once? */
1778 once = !(rpm->op_pmflags & PMf_GLOBAL);
1780 /* known replacement string? */
1781 c = dstr ? SvPV(dstr, clen) : Nullch;
1783 /* can do inplace substitution? */
1784 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1785 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1786 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1787 r_flags | REXEC_CHECKED))
1791 LEAVE_SCOPE(oldsave);
1794 if (force_on_match) {
1796 s = SvPV_force(TARG, len);
1801 SvSCREAM_off(TARG); /* disable possible screamer */
1803 rxtainted |= RX_MATCH_TAINTED(rx);
1804 m = orig + rx->startp[0];
1805 d = orig + rx->endp[0];
1807 if (m - s > strend - d) { /* faster to shorten from end */
1809 Copy(c, m, clen, char);
1814 Move(d, m, i, char);
1818 SvCUR_set(TARG, m - s);
1821 else if (i = m - s) { /* faster from front */
1829 Copy(c, m, clen, char);
1834 Copy(c, d, clen, char);
1839 TAINT_IF(rxtainted & 1);
1845 if (iters++ > maxiters)
1846 DIE(aTHX_ "Substitution loop");
1847 rxtainted |= RX_MATCH_TAINTED(rx);
1848 m = rx->startp[0] + orig;
1852 Move(s, d, i, char);
1856 Copy(c, d, clen, char);
1859 s = rx->endp[0] + orig;
1860 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1862 /* don't match same null twice */
1863 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1866 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1867 Move(s, d, i+1, char); /* include the NUL */
1869 TAINT_IF(rxtainted & 1);
1871 PUSHs(sv_2mortal(newSViv((I32)iters)));
1873 (void)SvPOK_only(TARG);
1874 TAINT_IF(rxtainted);
1875 if (SvSMAGICAL(TARG)) {
1881 LEAVE_SCOPE(oldsave);
1885 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1886 r_flags | REXEC_CHECKED))
1888 if (force_on_match) {
1890 s = SvPV_force(TARG, len);
1893 rxtainted |= RX_MATCH_TAINTED(rx);
1894 dstr = NEWSV(25, len);
1895 sv_setpvn(dstr, m, s-m);
1898 register PERL_CONTEXT *cx;
1901 RETURNOP(cPMOP->op_pmreplroot);
1903 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1905 if (iters++ > maxiters)
1906 DIE(aTHX_ "Substitution loop");
1907 rxtainted |= RX_MATCH_TAINTED(rx);
1908 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1913 strend = s + (strend - m);
1915 m = rx->startp[0] + orig;
1916 sv_catpvn(dstr, s, m-s);
1917 s = rx->endp[0] + orig;
1919 sv_catpvn(dstr, c, clen);
1922 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1923 sv_catpvn(dstr, s, strend - s);
1925 (void)SvOOK_off(TARG);
1926 Safefree(SvPVX(TARG));
1927 SvPVX(TARG) = SvPVX(dstr);
1928 SvCUR_set(TARG, SvCUR(dstr));
1929 SvLEN_set(TARG, SvLEN(dstr));
1933 TAINT_IF(rxtainted & 1);
1935 PUSHs(sv_2mortal(newSViv((I32)iters)));
1937 (void)SvPOK_only(TARG);
1938 TAINT_IF(rxtainted);
1941 LEAVE_SCOPE(oldsave);
1950 LEAVE_SCOPE(oldsave);
1959 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1960 ++*PL_markstack_ptr;
1961 LEAVE; /* exit inner scope */
1964 if (PL_stack_base + *PL_markstack_ptr > SP) {
1966 I32 gimme = GIMME_V;
1968 LEAVE; /* exit outer scope */
1969 (void)POPMARK; /* pop src */
1970 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1971 (void)POPMARK; /* pop dst */
1972 SP = PL_stack_base + POPMARK; /* pop original mark */
1973 if (gimme == G_SCALAR) {
1977 else if (gimme == G_ARRAY)
1984 ENTER; /* enter inner scope */
1987 src = PL_stack_base[*PL_markstack_ptr];
1991 RETURNOP(cLOGOP->op_other);
2002 register PERL_CONTEXT *cx;
2008 if (gimme == G_SCALAR) {
2011 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2013 *MARK = SvREFCNT_inc(TOPs);
2019 *MARK = sv_mortalcopy(TOPs);
2023 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2027 *MARK = &PL_sv_undef;
2031 else if (gimme == G_ARRAY) {
2032 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2033 if (!SvTEMP(*MARK)) {
2034 *MARK = sv_mortalcopy(*MARK);
2035 TAINT_NOT; /* Each item is independent */
2041 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2042 PL_curpm = newpm; /* ... and pop $1 et al */
2046 return pop_return();
2049 /* This duplicates the above code because the above code must not
2050 * get any slower by more conditions */
2058 register PERL_CONTEXT *cx;
2065 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2066 /* We are an argument to a function or grep().
2067 * This kind of lvalueness was legal before lvalue
2068 * subroutines too, so be backward compatible:
2069 * cannot report errors. */
2071 /* Scalar context *is* possible, on the LHS of -> only,
2072 * as in f()->meth(). But this is not an lvalue. */
2073 if (gimme == G_SCALAR)
2075 if (gimme == G_ARRAY) {
2076 if (!CvLVALUE(cx->blk_sub.cv))
2077 goto temporise_array;
2078 EXTEND_MORTAL(SP - newsp);
2079 for (mark = newsp + 1; mark <= SP; mark++) {
2082 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2083 *mark = sv_mortalcopy(*mark);
2085 /* Can be a localized value subject to deletion. */
2086 PL_tmps_stack[++PL_tmps_ix] = *mark;
2087 (void)SvREFCNT_inc(*mark);
2092 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2093 /* Here we go for robustness, not for speed, so we change all
2094 * the refcounts so the caller gets a live guy. Cannot set
2095 * TEMP, so sv_2mortal is out of question. */
2096 if (!CvLVALUE(cx->blk_sub.cv)) {
2101 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2103 if (gimme == G_SCALAR) {
2107 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2112 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2113 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2115 else { /* Can be a localized value
2116 * subject to deletion. */
2117 PL_tmps_stack[++PL_tmps_ix] = *mark;
2118 (void)SvREFCNT_inc(*mark);
2121 else { /* Should not happen? */
2126 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2127 (MARK > SP ? "Empty array" : "Array"));
2131 else if (gimme == G_ARRAY) {
2132 EXTEND_MORTAL(SP - newsp);
2133 for (mark = newsp + 1; mark <= SP; mark++) {
2134 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2135 /* Might be flattened array after $#array = */
2141 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2142 (*mark != &PL_sv_undef)
2144 ? "a readonly value" : "a temporary")
2145 : "an uninitialized value");
2149 /* Can be a localized value subject to deletion. */
2150 PL_tmps_stack[++PL_tmps_ix] = *mark;
2151 (void)SvREFCNT_inc(*mark);
2157 if (gimme == G_SCALAR) {
2161 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2163 *MARK = SvREFCNT_inc(TOPs);
2169 *MARK = sv_mortalcopy(TOPs);
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 SvUPGRADE(dbsv, SVt_PVIV);
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)
2808 name = SvPV(meth, namelen);
2809 sv = *(PL_stack_base + TOPMARK + 1);
2820 !(packname = SvPV(sv, packlen)) ||
2821 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2822 !(ob=(SV*)GvIO(iogv)))
2825 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2826 ? !isIDFIRST_utf8((U8*)packname)
2827 : !isIDFIRST(*packname)
2830 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2831 SvOK(sv) ? "without a package or object reference"
2832 : "on an undefined value");
2834 stash = gv_stashpvn(packname, packlen, TRUE);
2837 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2840 if (!ob || !(SvOBJECT(ob)
2841 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2844 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2848 stash = SvSTASH(ob);
2851 /* shortcut for simple names */
2853 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2855 gv = (GV*)HeVAL(he);
2856 if (isGV(gv) && GvCV(gv) &&
2857 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2858 return (SV*)GvCV(gv);
2862 gv = gv_fetchmethod(stash, name);
2868 for (p = name; *p; p++) {
2870 sep = p, leaf = p + 1;
2871 else if (*p == ':' && *(p + 1) == ':')
2872 sep = p, leaf = p + 2;
2874 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2875 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2876 packlen = strlen(packname);
2880 packlen = sep - name;
2883 "Can't locate object method \"%s\" via package \"%s\"",
2886 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2891 unset_cvowner(pTHXo_ void *cvarg)
2893 register CV* cv = (CV *) cvarg;
2896 #endif /* DEBUGGING */
2898 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2899 thr, cv, SvPEEK((SV*)cv))));
2900 MUTEX_LOCK(CvMUTEXP(cv));
2901 DEBUG_S(if (CvDEPTH(cv) != 0)
2902 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2904 assert(thr == CvOWNER(cv));
2906 MUTEX_UNLOCK(CvMUTEXP(cv));
2909 #endif /* USE_THREADS */