3 * Copyright (c) 1991-1999, 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
32 #define HOP(pos,off) (IN_UTF8 ? utf8_hop(pos, off) : (pos + off))
37 static void unset_cvowner(pTHXo_ void *cvarg);
38 #endif /* USE_THREADS */
49 PL_curcop = (COP*)PL_op;
50 TAINT_NOT; /* Each statement is presumed innocent */
51 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
60 if (PL_op->op_private & OPpLVAL_INTRO)
61 PUSHs(save_scalar(cGVOP->op_gv));
63 PUSHs(GvSV(cGVOP->op_gv));
74 PL_curcop = (COP*)PL_op;
80 PUSHMARK(PL_stack_sp);
90 sv_setpvn(TARG,s,len);
98 XPUSHs((SV*)cGVOP->op_gv);
109 RETURNOP(cLOGOP->op_other);
118 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
120 temp = left; left = right; right = temp;
122 if (PL_tainting && PL_tainted && !SvTAINTED(left))
124 SvSetMagicSV(right, left);
133 RETURNOP(cLOGOP->op_other);
135 RETURNOP(cLOGOP->op_next);
141 TAINT_NOT; /* Each statement is presumed innocent */
142 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
144 oldsave = PL_scopestack[PL_scopestack_ix - 1];
145 LEAVE_SCOPE(oldsave);
151 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
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_MISC)) {
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_MISC, "Possible Y2K bug: %s",
176 "about to append an integer to '19'");
180 sv_catpvn(TARG,s,len);
183 sv_setpvn(TARG,s,len); /* suppress warning */
193 if (PL_op->op_flags & OPf_MOD) {
194 if (PL_op->op_private & OPpLVAL_INTRO)
195 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
196 else if (PL_op->op_private & OPpDEREF) {
198 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
207 tryAMAGICunTARGET(iter, 0);
208 PL_last_in_gv = (GV*)(*PL_stack_sp--);
209 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
210 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
211 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
214 XPUSHs((SV*)PL_last_in_gv);
217 PL_last_in_gv = (GV*)(*PL_stack_sp--);
220 return do_readline();
225 djSP; tryAMAGICbinSET(eq,0);
228 SETs(boolSV(TOPn == value));
236 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
237 DIE(aTHX_ PL_no_modify);
238 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
239 SvIVX(TOPs) != IV_MAX)
242 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
257 RETURNOP(cLOGOP->op_other);
263 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
266 SETn( left + right );
274 AV *av = GvAV((GV*)cSVOP->op_sv);
275 U32 lval = PL_op->op_flags & OPf_MOD;
276 SV** svp = av_fetch(av, PL_op->op_private, lval);
277 SV *sv = (svp ? *svp : &PL_sv_undef);
279 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
280 sv = sv_mortalcopy(sv);
287 djSP; dMARK; dTARGET;
289 do_join(TARG, *MARK, MARK, SP);
300 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
301 * will be enough to hold an OP*.
303 SV* sv = sv_newmortal();
304 sv_upgrade(sv, SVt_PVLV);
306 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
314 /* Oversized hot code. */
318 djSP; dMARK; dORIGMARK;
325 if (PL_op->op_flags & OPf_STACKED)
329 if (mg = SvTIED_mg((SV*)gv, 'q')) {
330 if (MARK == ORIGMARK) {
331 /* If using default handle then we need to make space to
332 * pass object as 1st arg, so move other args up ...
336 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
340 *MARK = SvTIED_obj((SV*)gv, mg);
343 call_method("PRINT", G_SCALAR);
351 if (!(io = GvIO(gv))) {
352 if (ckWARN(WARN_UNOPENED)) {
353 SV* sv = sv_newmortal();
354 gv_efullname3(sv, gv, Nullch);
355 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
358 SETERRNO(EBADF,RMS$_IFI);
361 else if (!(fp = IoOFP(io))) {
362 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
363 SV* sv = sv_newmortal();
364 gv_efullname3(sv, gv, Nullch);
366 Perl_warner(aTHX_ WARN_IO,
367 "Filehandle %s opened only for input",
369 else if (ckWARN(WARN_CLOSED))
370 Perl_warner(aTHX_ WARN_CLOSED,
371 "print on closed filehandle %s", SvPV(sv,n_a));
373 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
380 if (!do_print(*MARK, fp))
384 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
393 if (!do_print(*MARK, fp))
402 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
405 if (IoFLAGS(io) & IOf_FLUSH)
406 if (PerlIO_flush(fp) == EOF)
427 tryAMAGICunDEREF(to_av);
430 if (SvTYPE(av) != SVt_PVAV)
431 DIE(aTHX_ "Not an ARRAY reference");
432 if (PL_op->op_flags & OPf_REF) {
438 if (SvTYPE(sv) == SVt_PVAV) {
440 if (PL_op->op_flags & OPf_REF) {
448 if (SvTYPE(sv) != SVt_PVGV) {
452 if (SvGMAGICAL(sv)) {
458 if (PL_op->op_flags & OPf_REF ||
459 PL_op->op_private & HINT_STRICT_REFS)
460 DIE(aTHX_ PL_no_usym, "an ARRAY");
461 if (ckWARN(WARN_UNINITIALIZED))
462 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
463 if (GIMME == G_ARRAY) {
470 if ((PL_op->op_flags & OPf_SPECIAL) &&
471 !(PL_op->op_flags & OPf_MOD))
473 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
478 if (PL_op->op_private & HINT_STRICT_REFS)
479 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
480 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
487 if (PL_op->op_private & OPpLVAL_INTRO)
489 if (PL_op->op_flags & OPf_REF) {
496 if (GIMME == G_ARRAY) {
497 I32 maxarg = AvFILL(av) + 1;
498 (void)POPs; /* XXXX May be optimized away? */
500 if (SvRMAGICAL(av)) {
502 for (i=0; i < maxarg; i++) {
503 SV **svp = av_fetch(av, i, FALSE);
504 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
508 Copy(AvARRAY(av), SP+1, maxarg, SV*);
514 I32 maxarg = AvFILL(av) + 1;
527 tryAMAGICunDEREF(to_hv);
530 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
531 DIE(aTHX_ "Not a HASH reference");
532 if (PL_op->op_flags & OPf_REF) {
538 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
540 if (PL_op->op_flags & OPf_REF) {
548 if (SvTYPE(sv) != SVt_PVGV) {
552 if (SvGMAGICAL(sv)) {
558 if (PL_op->op_flags & OPf_REF ||
559 PL_op->op_private & HINT_STRICT_REFS)
560 DIE(aTHX_ PL_no_usym, "a HASH");
561 if (ckWARN(WARN_UNINITIALIZED))
562 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
563 if (GIMME == G_ARRAY) {
570 if ((PL_op->op_flags & OPf_SPECIAL) &&
571 !(PL_op->op_flags & OPf_MOD))
573 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
578 if (PL_op->op_private & HINT_STRICT_REFS)
579 DIE(aTHX_ PL_no_symref, sym, "a HASH");
580 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
587 if (PL_op->op_private & OPpLVAL_INTRO)
589 if (PL_op->op_flags & OPf_REF) {
596 if (GIMME == G_ARRAY) { /* array wanted */
597 *PL_stack_sp = (SV*)hv;
602 if (SvTYPE(hv) == SVt_PVAV)
603 hv = avhv_keys((AV*)hv);
605 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
606 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
618 SV **lastlelem = PL_stack_sp;
619 SV **lastrelem = PL_stack_base + POPMARK;
620 SV **firstrelem = PL_stack_base + POPMARK + 1;
621 SV **firstlelem = lastrelem + 1;
634 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
636 /* If there's a common identifier on both sides we have to take
637 * special care that assigning the identifier on the left doesn't
638 * clobber a value on the right that's used later in the list.
640 if (PL_op->op_private & OPpASSIGN_COMMON) {
641 EXTEND_MORTAL(lastrelem - firstrelem + 1);
642 for (relem = firstrelem; relem <= lastrelem; relem++) {
645 TAINT_NOT; /* Each item is independent */
646 *relem = sv_mortalcopy(sv);
655 while (lelem <= lastlelem) {
656 TAINT_NOT; /* Each item stands on its own, taintwise. */
658 switch (SvTYPE(sv)) {
661 magic = SvMAGICAL(ary) != 0;
664 av_extend(ary, lastrelem - relem);
666 while (relem <= lastrelem) { /* gobble up all the rest */
672 didstore = av_store(ary,i++,sv);
686 magic = SvMAGICAL(hash) != 0;
689 while (relem < lastrelem) { /* gobble up all the rest */
694 sv = &PL_sv_no, relem++;
695 tmpstr = NEWSV(29,0);
697 sv_setsv(tmpstr,*relem); /* value */
699 didstore = hv_store_ent(hash,sv,tmpstr,0);
701 if (SvSMAGICAL(tmpstr))
708 if (relem == lastrelem) {
711 if (ckWARN(WARN_UNSAFE)) {
712 if (relem == firstrelem &&
714 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
715 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
716 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
718 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
720 tmpstr = NEWSV(29,0);
721 didstore = hv_store_ent(hash,*relem,tmpstr,0);
723 if (SvSMAGICAL(tmpstr))
735 if (SvIMMORTAL(sv)) {
736 if (relem <= lastrelem)
740 if (relem <= lastrelem) {
741 sv_setsv(sv, *relem);
745 sv_setsv(sv, &PL_sv_undef);
750 if (PL_delaymagic & ~DM_DELAY) {
751 if (PL_delaymagic & DM_UID) {
753 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
756 (void)setreuid(PL_uid,PL_euid);
759 if ((PL_delaymagic & DM_UID) == DM_RUID) {
760 (void)setruid(PL_uid);
761 PL_delaymagic &= ~DM_RUID;
763 # endif /* HAS_SETRUID */
765 if ((PL_delaymagic & DM_UID) == DM_EUID) {
766 (void)seteuid(PL_uid);
767 PL_delaymagic &= ~DM_EUID;
769 # endif /* HAS_SETEUID */
770 if (PL_delaymagic & DM_UID) {
771 if (PL_uid != PL_euid)
772 DIE(aTHX_ "No setreuid available");
773 (void)PerlProc_setuid(PL_uid);
775 # endif /* HAS_SETREUID */
776 #endif /* HAS_SETRESUID */
777 PL_uid = PerlProc_getuid();
778 PL_euid = PerlProc_geteuid();
780 if (PL_delaymagic & DM_GID) {
782 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
785 (void)setregid(PL_gid,PL_egid);
788 if ((PL_delaymagic & DM_GID) == DM_RGID) {
789 (void)setrgid(PL_gid);
790 PL_delaymagic &= ~DM_RGID;
792 # endif /* HAS_SETRGID */
794 if ((PL_delaymagic & DM_GID) == DM_EGID) {
795 (void)setegid(PL_gid);
796 PL_delaymagic &= ~DM_EGID;
798 # endif /* HAS_SETEGID */
799 if (PL_delaymagic & DM_GID) {
800 if (PL_gid != PL_egid)
801 DIE(aTHX_ "No setregid available");
802 (void)PerlProc_setgid(PL_gid);
804 # endif /* HAS_SETREGID */
805 #endif /* HAS_SETRESGID */
806 PL_gid = PerlProc_getgid();
807 PL_egid = PerlProc_getegid();
809 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
816 else if (gimme == G_SCALAR) {
819 SETi(lastrelem - firstrelem + 1);
825 SP = firstrelem + (lastlelem - firstlelem);
826 lelem = firstlelem + (relem - firstrelem);
828 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
836 register PMOP *pm = cPMOP;
837 SV *rv = sv_newmortal();
838 SV *sv = newSVrv(rv, "Regexp");
839 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
846 register PMOP *pm = cPMOP;
851 I32 r_flags = REXEC_CHECKED;
852 char *truebase; /* Start of string */
853 register REGEXP *rx = pm->op_pmregexp;
858 I32 oldsave = PL_savestack_ix;
859 I32 update_minmatch = 1;
862 if (PL_op->op_flags & OPf_STACKED)
868 PUTBACK; /* EVAL blocks need stack_sp. */
872 DIE(aTHX_ "panic: do_match");
873 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
874 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
877 if (pm->op_pmdynflags & PMdf_USED) {
879 if (gimme == G_ARRAY)
884 if (!rx->prelen && PL_curpm) {
886 rx = pm->op_pmregexp;
888 if (rx->minlen > len) goto failure;
892 /* XXXX What part of this is needed with true \G-support? */
893 if (global = pm->op_pmflags & PMf_GLOBAL) {
895 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
896 MAGIC* mg = mg_find(TARG, 'g');
897 if (mg && mg->mg_len >= 0) {
898 if (!(rx->reganch & ROPT_GPOS_SEEN))
899 rx->endp[0] = rx->startp[0] = mg->mg_len;
900 else if (rx->reganch & ROPT_ANCH_GPOS) {
901 r_flags |= REXEC_IGNOREPOS;
902 rx->endp[0] = rx->startp[0] = mg->mg_len;
904 minmatch = (mg->mg_flags & MGf_MINMATCH);
909 if ((gimme != G_ARRAY && !global && rx->nparens)
910 || SvTEMP(TARG) || PL_sawampersand)
911 r_flags |= REXEC_COPY_STR;
913 r_flags |= REXEC_SCREAM;
915 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
916 SAVEINT(PL_multiline);
917 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
921 if (global && rx->startp[0] != -1) {
922 t = s = rx->endp[0] + truebase;
923 if ((s + rx->minlen) > strend)
925 if (update_minmatch++)
926 minmatch = had_zerolen;
928 if (rx->reganch & RE_USE_INTUIT) {
929 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
933 if ( (rx->reganch & ROPT_CHECK_ALL)
935 && ((rx->reganch & ROPT_NOSCAN)
936 || !((rx->reganch & RE_INTUIT_TAIL)
937 && (r_flags & REXEC_SCREAM))))
940 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
943 if (pm->op_pmflags & PMf_ONCE)
944 pm->op_pmdynflags |= PMdf_USED;
953 RX_MATCH_TAINTED_on(rx);
954 TAINT_IF(RX_MATCH_TAINTED(rx));
955 if (gimme == G_ARRAY) {
959 if (global && !iters)
963 SPAGAIN; /* EVAL blocks could move the stack. */
964 EXTEND(SP, iters + i);
965 EXTEND_MORTAL(iters + i);
966 for (i = !i; i <= iters; i++) {
967 PUSHs(sv_newmortal());
969 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
970 len = rx->endp[i] - rx->startp[i];
971 s = rx->startp[i] + truebase;
972 sv_setpvn(*SP, s, len);
976 had_zerolen = (rx->startp[0] != -1
977 && rx->startp[0] == rx->endp[0]);
978 PUTBACK; /* EVAL blocks may use stack */
979 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
984 LEAVE_SCOPE(oldsave);
990 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
991 mg = mg_find(TARG, 'g');
993 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
994 mg = mg_find(TARG, 'g');
996 if (rx->startp[0] != -1) {
997 mg->mg_len = rx->endp[0];
998 if (rx->startp[0] == rx->endp[0])
999 mg->mg_flags |= MGf_MINMATCH;
1001 mg->mg_flags &= ~MGf_MINMATCH;
1004 LEAVE_SCOPE(oldsave);
1008 yup: /* Confirmed by INTUIT */
1010 RX_MATCH_TAINTED_on(rx);
1011 TAINT_IF(RX_MATCH_TAINTED(rx));
1013 if (pm->op_pmflags & PMf_ONCE)
1014 pm->op_pmdynflags |= PMdf_USED;
1015 if (RX_MATCH_COPIED(rx))
1016 Safefree(rx->subbeg);
1017 RX_MATCH_COPIED_off(rx);
1018 rx->subbeg = Nullch;
1020 rx->subbeg = truebase;
1021 rx->startp[0] = s - truebase;
1022 rx->endp[0] = s - truebase + rx->minlen;
1023 rx->sublen = strend - truebase;
1026 if (PL_sawampersand) {
1029 rx->subbeg = savepvn(t, strend - t);
1030 rx->sublen = strend - t;
1031 RX_MATCH_COPIED_on(rx);
1032 off = rx->startp[0] = s - t;
1033 rx->endp[0] = off + rx->minlen;
1035 else { /* startp/endp are used by @- @+. */
1036 rx->startp[0] = s - truebase;
1037 rx->endp[0] = s - truebase + rx->minlen;
1039 LEAVE_SCOPE(oldsave);
1044 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1045 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1046 MAGIC* mg = mg_find(TARG, 'g');
1051 LEAVE_SCOPE(oldsave);
1052 if (gimme == G_ARRAY)
1058 Perl_do_readline(pTHX)
1060 dSP; dTARGETSTACKED;
1065 register IO *io = GvIO(PL_last_in_gv);
1066 register I32 type = PL_op->op_type;
1067 I32 gimme = GIMME_V;
1070 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1072 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1075 call_method("READLINE", gimme);
1078 if (gimme == G_SCALAR)
1079 SvSetMagicSV_nosteal(TARG, TOPs);
1086 if (IoFLAGS(io) & IOf_ARGV) {
1087 if (IoFLAGS(io) & IOf_START) {
1088 IoFLAGS(io) &= ~IOf_START;
1090 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1091 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1092 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1093 SvSETMAGIC(GvSV(PL_last_in_gv));
1098 fp = nextargv(PL_last_in_gv);
1099 if (!fp) { /* Note: fp != IoIFP(io) */
1100 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1101 IoFLAGS(io) |= IOf_START;
1104 else if (type == OP_GLOB) {
1105 SV *tmpcmd = NEWSV(55, 0);
1109 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1110 /* since spawning off a process is a real performance hit */
1112 #include <descrip.h>
1113 #include <lib$routines.h>
1116 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1117 char vmsspec[NAM$C_MAXRSS+1];
1118 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1119 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1120 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1123 struct dsc$descriptor_s wilddsc
1124 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1125 struct dsc$descriptor_vs rsdsc
1126 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1127 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1129 /* We could find out if there's an explicit dev/dir or version
1130 by peeking into lib$find_file's internal context at
1131 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1132 but that's unsupported, so I don't want to do it now and
1133 have it bite someone in the future. */
1134 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1135 cp = SvPV(tmpglob,i);
1137 if (cp[i] == ';') hasver = 1;
1139 if (sts) hasver = 1;
1143 hasdir = isunix = 1;
1146 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1151 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1153 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1154 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1155 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1156 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1157 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1158 &dfltdsc,NULL,NULL,NULL))&1)) {
1159 end = rstr + (unsigned long int) *rslt;
1160 if (!hasver) while (*end != ';') end--;
1161 *(end++) = '\n'; *end = '\0';
1162 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1164 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1169 while (*(--begin) != ']' && *begin != '>') ;
1172 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1174 if (cxt) (void)lib$find_file_end(&cxt);
1175 if (ok && sts != RMS$_NMF &&
1176 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1179 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1181 PerlIO_close(tmpfp);
1185 PerlIO_rewind(tmpfp);
1187 IoIFP(io) = fp = tmpfp;
1188 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1195 sv_setpv(tmpcmd, "for a in ");
1196 sv_catsv(tmpcmd, tmpglob);
1197 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1200 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1201 sv_catsv(tmpcmd, tmpglob);
1203 sv_setpv(tmpcmd, "perlglob ");
1204 sv_catsv(tmpcmd, tmpglob);
1205 sv_catpv(tmpcmd, " |");
1210 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1211 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1212 sv_catsv(tmpcmd, tmpglob);
1213 sv_catpv(tmpcmd, "' 2>/dev/null |");
1215 sv_setpv(tmpcmd, "echo ");
1216 sv_catsv(tmpcmd, tmpglob);
1218 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1220 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1223 #endif /* !DOSISH */
1224 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1225 FALSE, O_RDONLY, 0, Nullfp);
1231 else if (type == OP_GLOB)
1233 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1234 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1235 || fp == PerlIO_stderr()))
1237 SV* sv = sv_newmortal();
1238 gv_efullname3(sv, PL_last_in_gv, Nullch);
1239 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1244 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1245 if (type == OP_GLOB)
1246 Perl_warner(aTHX_ WARN_CLOSED,
1247 "glob failed (can't start child: %s)",
1250 SV* sv = sv_newmortal();
1251 gv_efullname3(sv, PL_last_in_gv, Nullch);
1252 Perl_warner(aTHX_ WARN_CLOSED,
1253 "Read on closed filehandle %s",
1257 if (gimme == G_SCALAR) {
1258 (void)SvOK_off(TARG);
1264 if (gimme == G_SCALAR) {
1268 (void)SvUPGRADE(sv, SVt_PV);
1269 tmplen = SvLEN(sv); /* remember if already alloced */
1271 Sv_Grow(sv, 80); /* try short-buffering it */
1272 if (type == OP_RCATLINE)
1278 sv = sv_2mortal(NEWSV(57, 80));
1282 /* flip-flop EOF state for a snarfed empty file */
1283 #define SNARF_EOF(gimme,rs,io,sv) \
1284 ((gimme != G_SCALAR || SvCUR(sv) \
1285 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1286 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1287 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1290 if (!sv_gets(sv, fp, offset)
1291 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1293 PerlIO_clearerr(fp);
1294 if (IoFLAGS(io) & IOf_ARGV) {
1295 fp = nextargv(PL_last_in_gv);
1298 (void)do_close(PL_last_in_gv, FALSE);
1299 IoFLAGS(io) |= IOf_START;
1301 else if (type == OP_GLOB) {
1302 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1303 Perl_warner(aTHX_ WARN_CLOSED,
1304 "glob failed (child exited with status %d%s)",
1305 STATUS_CURRENT >> 8,
1306 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1309 if (gimme == G_SCALAR) {
1310 (void)SvOK_off(TARG);
1315 /* This should not be marked tainted if the fp is marked clean */
1316 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1323 if (type == OP_GLOB) {
1326 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1327 tmps = SvEND(sv) - 1;
1328 if (*tmps == *SvPVX(PL_rs)) {
1333 for (tmps = SvPVX(sv); *tmps; tmps++)
1334 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1335 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1337 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1338 (void)POPs; /* Unmatched wildcard? Chuck it... */
1342 if (gimme == G_ARRAY) {
1343 if (SvLEN(sv) - SvCUR(sv) > 20) {
1344 SvLEN_set(sv, SvCUR(sv)+1);
1345 Renew(SvPVX(sv), SvLEN(sv), char);
1347 sv = sv_2mortal(NEWSV(58, 80));
1350 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1351 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1355 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1356 Renew(SvPVX(sv), SvLEN(sv), char);
1365 register PERL_CONTEXT *cx;
1366 I32 gimme = OP_GIMME(PL_op, -1);
1369 if (cxstack_ix >= 0)
1370 gimme = cxstack[cxstack_ix].blk_gimme;
1378 PUSHBLOCK(cx, CXt_BLOCK, SP);
1390 U32 lval = PL_op->op_flags & OPf_MOD;
1391 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1394 if (SvTYPE(hv) == SVt_PVHV) {
1395 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1396 svp = he ? &HeVAL(he) : 0;
1398 else if (SvTYPE(hv) == SVt_PVAV) {
1399 if (PL_op->op_private & OPpLVAL_INTRO)
1400 DIE(aTHX_ "Can't localize pseudo-hash element");
1401 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1407 if (!svp || *svp == &PL_sv_undef) {
1412 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1414 lv = sv_newmortal();
1415 sv_upgrade(lv, SVt_PVLV);
1417 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1418 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1419 LvTARG(lv) = SvREFCNT_inc(hv);
1424 if (PL_op->op_private & OPpLVAL_INTRO) {
1425 if (HvNAME(hv) && isGV(*svp))
1426 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1428 save_helem(hv, keysv, svp);
1430 else if (PL_op->op_private & OPpDEREF)
1431 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1433 sv = (svp ? *svp : &PL_sv_undef);
1434 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1435 * Pushing the magical RHS on to the stack is useless, since
1436 * that magic is soon destined to be misled by the local(),
1437 * and thus the later pp_sassign() will fail to mg_get() the
1438 * old value. This should also cure problems with delayed
1439 * mg_get()s. GSAR 98-07-03 */
1440 if (!lval && SvGMAGICAL(sv))
1441 sv = sv_mortalcopy(sv);
1449 register PERL_CONTEXT *cx;
1455 if (PL_op->op_flags & OPf_SPECIAL) {
1456 cx = &cxstack[cxstack_ix];
1457 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1462 gimme = OP_GIMME(PL_op, -1);
1464 if (cxstack_ix >= 0)
1465 gimme = cxstack[cxstack_ix].blk_gimme;
1471 if (gimme == G_VOID)
1473 else if (gimme == G_SCALAR) {
1476 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1479 *MARK = sv_mortalcopy(TOPs);
1482 *MARK = &PL_sv_undef;
1486 else if (gimme == G_ARRAY) {
1487 /* in case LEAVE wipes old return values */
1488 for (mark = newsp + 1; mark <= SP; mark++) {
1489 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1490 *mark = sv_mortalcopy(*mark);
1491 TAINT_NOT; /* Each item is independent */
1495 PL_curpm = newpm; /* Don't pop $1 et al till now */
1505 register PERL_CONTEXT *cx;
1510 cx = &cxstack[cxstack_ix];
1511 if (CxTYPE(cx) != CXt_LOOP)
1512 DIE(aTHX_ "panic: pp_iter");
1514 av = cx->blk_loop.iterary;
1515 if (SvTYPE(av) != SVt_PVAV) {
1516 /* iterate ($min .. $max) */
1517 if (cx->blk_loop.iterlval) {
1518 /* string increment */
1519 register SV* cur = cx->blk_loop.iterlval;
1521 char *max = SvPV((SV*)av, maxlen);
1522 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1523 #ifndef USE_THREADS /* don't risk potential race */
1524 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1525 && !SvMAGICAL(*cx->blk_loop.itervar))
1527 /* safe to reuse old SV */
1528 sv_setsv(*cx->blk_loop.itervar, cur);
1533 /* we need a fresh SV every time so that loop body sees a
1534 * completely new SV for closures/references to work as
1536 SvREFCNT_dec(*cx->blk_loop.itervar);
1537 *cx->blk_loop.itervar = newSVsv(cur);
1539 if (strEQ(SvPVX(cur), max))
1540 sv_setiv(cur, 0); /* terminate next time */
1547 /* integer increment */
1548 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1551 #ifndef USE_THREADS /* don't risk potential race */
1552 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1553 && !SvMAGICAL(*cx->blk_loop.itervar))
1555 /* safe to reuse old SV */
1556 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1561 /* we need a fresh SV every time so that loop body sees a
1562 * completely new SV for closures/references to work as they
1564 SvREFCNT_dec(*cx->blk_loop.itervar);
1565 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1571 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1574 SvREFCNT_dec(*cx->blk_loop.itervar);
1576 if (sv = (SvMAGICAL(av))
1577 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1578 : AvARRAY(av)[++cx->blk_loop.iterix])
1582 if (av != PL_curstack && SvIMMORTAL(sv)) {
1583 SV *lv = cx->blk_loop.iterlval;
1584 if (lv && SvREFCNT(lv) > 1) {
1589 SvREFCNT_dec(LvTARG(lv));
1591 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1592 sv_upgrade(lv, SVt_PVLV);
1594 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1596 LvTARG(lv) = SvREFCNT_inc(av);
1597 LvTARGOFF(lv) = cx->blk_loop.iterix;
1598 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1602 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1609 register PMOP *pm = cPMOP;
1625 register REGEXP *rx = pm->op_pmregexp;
1627 int force_on_match = 0;
1628 I32 oldsave = PL_savestack_ix;
1629 I32 update_minmatch = 1;
1631 /* known replacement string? */
1632 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1633 if (PL_op->op_flags & OPf_STACKED)
1639 if (SvREADONLY(TARG)
1640 || (SvTYPE(TARG) > SVt_PVLV
1641 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1642 DIE(aTHX_ PL_no_modify);
1645 s = SvPV(TARG, len);
1646 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1648 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1649 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1656 DIE(aTHX_ "panic: do_subst");
1659 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1660 position, once with zero-length,
1661 second time with non-zero. */
1663 if (!rx->prelen && PL_curpm) {
1665 rx = pm->op_pmregexp;
1667 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1668 ? REXEC_COPY_STR : 0;
1670 r_flags |= REXEC_SCREAM;
1671 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1672 SAVEINT(PL_multiline);
1673 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1676 if (rx->reganch & RE_USE_INTUIT) {
1677 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1681 /* How to do it in subst? */
1682 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1684 && ((rx->reganch & ROPT_NOSCAN)
1685 || !((rx->reganch & RE_INTUIT_TAIL)
1686 && (r_flags & REXEC_SCREAM))))
1691 /* only replace once? */
1692 once = !(rpm->op_pmflags & PMf_GLOBAL);
1694 /* known replacement string? */
1695 c = dstr ? SvPV(dstr, clen) : Nullch;
1697 /* can do inplace substitution? */
1698 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1699 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1700 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1701 r_flags | REXEC_CHECKED))
1705 LEAVE_SCOPE(oldsave);
1708 if (force_on_match) {
1710 s = SvPV_force(TARG, len);
1715 SvSCREAM_off(TARG); /* disable possible screamer */
1717 rxtainted |= RX_MATCH_TAINTED(rx);
1718 m = orig + rx->startp[0];
1719 d = orig + rx->endp[0];
1721 if (m - s > strend - d) { /* faster to shorten from end */
1723 Copy(c, m, clen, char);
1728 Move(d, m, i, char);
1732 SvCUR_set(TARG, m - s);
1735 else if (i = m - s) { /* faster from front */
1743 Copy(c, m, clen, char);
1748 Copy(c, d, clen, char);
1753 TAINT_IF(rxtainted & 1);
1759 if (iters++ > maxiters)
1760 DIE(aTHX_ "Substitution loop");
1761 rxtainted |= RX_MATCH_TAINTED(rx);
1762 m = rx->startp[0] + orig;
1766 Move(s, d, i, char);
1770 Copy(c, d, clen, char);
1773 s = rx->endp[0] + orig;
1774 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1776 /* don't match same null twice */
1777 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1780 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1781 Move(s, d, i+1, char); /* include the NUL */
1783 TAINT_IF(rxtainted & 1);
1785 PUSHs(sv_2mortal(newSViv((I32)iters)));
1787 (void)SvPOK_only(TARG);
1788 TAINT_IF(rxtainted);
1789 if (SvSMAGICAL(TARG)) {
1795 LEAVE_SCOPE(oldsave);
1799 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1800 r_flags | REXEC_CHECKED))
1802 if (force_on_match) {
1804 s = SvPV_force(TARG, len);
1807 rxtainted |= RX_MATCH_TAINTED(rx);
1808 dstr = NEWSV(25, len);
1809 sv_setpvn(dstr, m, s-m);
1812 register PERL_CONTEXT *cx;
1815 RETURNOP(cPMOP->op_pmreplroot);
1817 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1819 if (iters++ > maxiters)
1820 DIE(aTHX_ "Substitution loop");
1821 rxtainted |= RX_MATCH_TAINTED(rx);
1822 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1827 strend = s + (strend - m);
1829 m = rx->startp[0] + orig;
1830 sv_catpvn(dstr, s, m-s);
1831 s = rx->endp[0] + orig;
1833 sv_catpvn(dstr, c, clen);
1836 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1837 sv_catpvn(dstr, s, strend - s);
1839 (void)SvOOK_off(TARG);
1840 Safefree(SvPVX(TARG));
1841 SvPVX(TARG) = SvPVX(dstr);
1842 SvCUR_set(TARG, SvCUR(dstr));
1843 SvLEN_set(TARG, SvLEN(dstr));
1847 TAINT_IF(rxtainted & 1);
1849 PUSHs(sv_2mortal(newSViv((I32)iters)));
1851 (void)SvPOK_only(TARG);
1852 TAINT_IF(rxtainted);
1855 LEAVE_SCOPE(oldsave);
1864 LEAVE_SCOPE(oldsave);
1873 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1874 ++*PL_markstack_ptr;
1875 LEAVE; /* exit inner scope */
1878 if (PL_stack_base + *PL_markstack_ptr > SP) {
1880 I32 gimme = GIMME_V;
1882 LEAVE; /* exit outer scope */
1883 (void)POPMARK; /* pop src */
1884 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1885 (void)POPMARK; /* pop dst */
1886 SP = PL_stack_base + POPMARK; /* pop original mark */
1887 if (gimme == G_SCALAR) {
1891 else if (gimme == G_ARRAY)
1898 ENTER; /* enter inner scope */
1901 src = PL_stack_base[*PL_markstack_ptr];
1905 RETURNOP(cLOGOP->op_other);
1916 register PERL_CONTEXT *cx;
1922 if (gimme == G_SCALAR) {
1925 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1927 *MARK = SvREFCNT_inc(TOPs);
1933 *MARK = sv_mortalcopy(TOPs);
1937 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1941 *MARK = &PL_sv_undef;
1945 else if (gimme == G_ARRAY) {
1946 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1947 if (!SvTEMP(*MARK)) {
1948 *MARK = sv_mortalcopy(*MARK);
1949 TAINT_NOT; /* Each item is independent */
1955 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
1956 PL_curpm = newpm; /* ... and pop $1 et al */
1960 return pop_return();
1963 /* This duplicates the above code because the above code must not
1964 * get any slower by more conditions */
1972 register PERL_CONTEXT *cx;
1979 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
1980 /* We are an argument to a function or grep().
1981 * This kind of lvalueness was legal before lvalue
1982 * subroutines too, so be backward compatible:
1983 * cannot report errors. */
1985 /* Scalar context *is* possible, on the LHS of -> only,
1986 * as in f()->meth(). But this is not an lvalue. */
1987 if (gimme == G_SCALAR)
1989 if (gimme == G_ARRAY) {
1990 if (!CvLVALUE(cx->blk_sub.cv))
1991 goto temporise_array;
1992 EXTEND_MORTAL(SP - newsp);
1993 for (mark = newsp + 1; mark <= SP; mark++) {
1996 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
1997 *mark = sv_mortalcopy(*mark);
1999 /* Can be a localized value subject to deletion. */
2000 PL_tmps_stack[++PL_tmps_ix] = *mark;
2001 (void)SvREFCNT_inc(*mark);
2006 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2007 /* Here we go for robustness, not for speed, so we change all
2008 * the refcounts so the caller gets a live guy. Cannot set
2009 * TEMP, so sv_2mortal is out of question. */
2010 if (!CvLVALUE(cx->blk_sub.cv)) {
2015 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2017 if (gimme == G_SCALAR) {
2021 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2026 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2027 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2029 else { /* Can be a localized value
2030 * subject to deletion. */
2031 PL_tmps_stack[++PL_tmps_ix] = *mark;
2032 (void)SvREFCNT_inc(*mark);
2035 else { /* Should not happen? */
2040 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2041 (MARK > SP ? "Empty array" : "Array"));
2045 else if (gimme == G_ARRAY) {
2046 EXTEND_MORTAL(SP - newsp);
2047 for (mark = newsp + 1; mark <= SP; mark++) {
2048 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2049 /* Might be flattened array after $#array = */
2055 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2056 (*mark != &PL_sv_undef)
2058 ? "a readonly value" : "a temporary")
2059 : "an uninitialized value");
2063 /* Can be a localized value subject to deletion. */
2064 PL_tmps_stack[++PL_tmps_ix] = *mark;
2065 (void)SvREFCNT_inc(*mark);
2071 if (gimme == G_SCALAR) {
2075 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2077 *MARK = SvREFCNT_inc(TOPs);
2083 *MARK = sv_mortalcopy(TOPs);
2087 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2091 *MARK = &PL_sv_undef;
2095 else if (gimme == G_ARRAY) {
2097 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2098 if (!SvTEMP(*MARK)) {
2099 *MARK = sv_mortalcopy(*MARK);
2100 TAINT_NOT; /* Each item is independent */
2107 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2108 PL_curpm = newpm; /* ... and pop $1 et al */
2112 return pop_return();
2117 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2120 SV *dbsv = GvSV(PL_DBsub);
2122 if (!PERLDB_SUB_NN) {
2126 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2127 || strEQ(GvNAME(gv), "END")
2128 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2129 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2130 && (gv = (GV*)*svp) ))) {
2131 /* Use GV from the stack as a fallback. */
2132 /* GV is potentially non-unique, or contain different CV. */
2133 sv_setsv(dbsv, newRV((SV*)cv));
2136 gv_efullname3(dbsv, gv, Nullch);
2140 SvUPGRADE(dbsv, SVt_PVIV);
2142 SAVEIV(SvIVX(dbsv));
2143 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2147 PL_curcopdb = PL_curcop;
2148 cv = GvCV(PL_DBsub);
2158 register PERL_CONTEXT *cx;
2160 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2163 DIE(aTHX_ "Not a CODE reference");
2164 switch (SvTYPE(sv)) {
2170 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2172 SP = PL_stack_base + POPMARK;
2175 if (SvGMAGICAL(sv)) {
2177 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2180 sym = SvPV(sv, n_a);
2182 DIE(aTHX_ PL_no_usym, "a subroutine");
2183 if (PL_op->op_private & HINT_STRICT_REFS)
2184 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2185 cv = get_cv(sym, TRUE);
2189 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2190 tryAMAGICunDEREF(to_cv);
2193 if (SvTYPE(cv) == SVt_PVCV)
2198 DIE(aTHX_ "Not a CODE reference");
2203 if (!(cv = GvCVu((GV*)sv)))
2204 cv = sv_2cv(sv, &stash, &gv, FALSE);
2217 if (!CvROOT(cv) && !CvXSUB(cv)) {
2221 /* anonymous or undef'd function leaves us no recourse */
2222 if (CvANON(cv) || !(gv = CvGV(cv)))
2223 DIE(aTHX_ "Undefined subroutine called");
2225 /* autoloaded stub? */
2226 if (cv != GvCV(gv)) {
2229 /* should call AUTOLOAD now? */
2232 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2239 sub_name = sv_newmortal();
2240 gv_efullname3(sub_name, gv, Nullch);
2241 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2245 DIE(aTHX_ "Not a CODE reference");
2250 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2251 cv = get_db_sub(&sv, cv);
2253 DIE(aTHX_ "No DBsub routine");
2258 * First we need to check if the sub or method requires locking.
2259 * If so, we gain a lock on the CV, the first argument or the
2260 * stash (for static methods), as appropriate. This has to be
2261 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2262 * reschedule by returning a new op.
2264 MUTEX_LOCK(CvMUTEXP(cv));
2265 if (CvFLAGS(cv) & CVf_LOCKED) {
2267 if (CvFLAGS(cv) & CVf_METHOD) {
2268 if (SP > PL_stack_base + TOPMARK)
2269 sv = *(PL_stack_base + TOPMARK + 1);
2271 AV *av = (AV*)PL_curpad[0];
2272 if (hasargs || !av || AvFILLp(av) < 0
2273 || !(sv = AvARRAY(av)[0]))
2275 MUTEX_UNLOCK(CvMUTEXP(cv));
2276 DIE(aTHX_ "no argument for locked method call");
2283 char *stashname = SvPV(sv, len);
2284 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2290 MUTEX_UNLOCK(CvMUTEXP(cv));
2291 mg = condpair_magic(sv);
2292 MUTEX_LOCK(MgMUTEXP(mg));
2293 if (MgOWNER(mg) == thr)
2294 MUTEX_UNLOCK(MgMUTEXP(mg));
2297 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2299 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2301 MUTEX_UNLOCK(MgMUTEXP(mg));
2302 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2304 MUTEX_LOCK(CvMUTEXP(cv));
2307 * Now we have permission to enter the sub, we must distinguish
2308 * four cases. (0) It's an XSUB (in which case we don't care
2309 * about ownership); (1) it's ours already (and we're recursing);
2310 * (2) it's free (but we may already be using a cached clone);
2311 * (3) another thread owns it. Case (1) is easy: we just use it.
2312 * Case (2) means we look for a clone--if we have one, use it
2313 * otherwise grab ownership of cv. Case (3) means we look for a
2314 * clone (for non-XSUBs) and have to create one if we don't
2316 * Why look for a clone in case (2) when we could just grab
2317 * ownership of cv straight away? Well, we could be recursing,
2318 * i.e. we originally tried to enter cv while another thread
2319 * owned it (hence we used a clone) but it has been freed up
2320 * and we're now recursing into it. It may or may not be "better"
2321 * to use the clone but at least CvDEPTH can be trusted.
2323 if (CvOWNER(cv) == thr || CvXSUB(cv))
2324 MUTEX_UNLOCK(CvMUTEXP(cv));
2326 /* Case (2) or (3) */
2330 * XXX Might it be better to release CvMUTEXP(cv) while we
2331 * do the hv_fetch? We might find someone has pinched it
2332 * when we look again, in which case we would be in case
2333 * (3) instead of (2) so we'd have to clone. Would the fact
2334 * that we released the mutex more quickly make up for this?
2336 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2338 /* We already have a clone to use */
2339 MUTEX_UNLOCK(CvMUTEXP(cv));
2341 DEBUG_S(PerlIO_printf(Perl_debug_log,
2342 "entersub: %p already has clone %p:%s\n",
2343 thr, cv, SvPEEK((SV*)cv)));
2346 if (CvDEPTH(cv) == 0)
2347 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2350 /* (2) => grab ownership of cv. (3) => make clone */
2354 MUTEX_UNLOCK(CvMUTEXP(cv));
2355 DEBUG_S(PerlIO_printf(Perl_debug_log,
2356 "entersub: %p grabbing %p:%s in stash %s\n",
2357 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2358 HvNAME(CvSTASH(cv)) : "(none)"));
2361 /* Make a new clone. */
2363 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2364 MUTEX_UNLOCK(CvMUTEXP(cv));
2365 DEBUG_S((PerlIO_printf(Perl_debug_log,
2366 "entersub: %p cloning %p:%s\n",
2367 thr, cv, SvPEEK((SV*)cv))));
2369 * We're creating a new clone so there's no race
2370 * between the original MUTEX_UNLOCK and the
2371 * SvREFCNT_inc since no one will be trying to undef
2372 * it out from underneath us. At least, I don't think
2375 clonecv = cv_clone(cv);
2376 SvREFCNT_dec(cv); /* finished with this */
2377 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2378 CvOWNER(clonecv) = thr;
2382 DEBUG_S(if (CvDEPTH(cv) != 0)
2383 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2385 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2388 #endif /* USE_THREADS */
2391 #ifdef PERL_XSUB_OLDSTYLE
2392 if (CvOLDSTYLE(cv)) {
2393 I32 (*fp3)(int,int,int);
2395 register I32 items = SP - MARK;
2396 /* We dont worry to copy from @_. */
2401 PL_stack_sp = mark + 1;
2402 fp3 = (I32(*)(int,int,int)))CvXSUB(cv;
2403 items = (*fp3)(CvXSUBANY(cv).any_i32,
2404 MARK - PL_stack_base + 1,
2406 PL_stack_sp = PL_stack_base + items;
2409 #endif /* PERL_XSUB_OLDSTYLE */
2411 I32 markix = TOPMARK;
2416 /* Need to copy @_ to stack. Alternative may be to
2417 * switch stack to @_, and copy return values
2418 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2422 av = (AV*)PL_curpad[0];
2424 av = GvAV(PL_defgv);
2425 #endif /* USE_THREADS */
2426 items = AvFILLp(av) + 1; /* @_ is not tieable */
2429 /* Mark is at the end of the stack. */
2431 Copy(AvARRAY(av), SP + 1, items, SV*);
2436 /* We assume first XSUB in &DB::sub is the called one. */
2438 SAVESPTR(PL_curcop);
2439 PL_curcop = PL_curcopdb;
2442 /* Do we need to open block here? XXXX */
2443 (void)(*CvXSUB(cv))(aTHXo_ cv);
2445 /* Enforce some sanity in scalar context. */
2446 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2447 if (markix > PL_stack_sp - PL_stack_base)
2448 *(PL_stack_base + markix) = &PL_sv_undef;
2450 *(PL_stack_base + markix) = *PL_stack_sp;
2451 PL_stack_sp = PL_stack_base + markix;
2459 register I32 items = SP - MARK;
2460 AV* padlist = CvPADLIST(cv);
2461 SV** svp = AvARRAY(padlist);
2462 push_return(PL_op->op_next);
2463 PUSHBLOCK(cx, CXt_SUB, MARK);
2466 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2467 * that eval'' ops within this sub know the correct lexical space.
2468 * Owing the speed considerations, we choose to search for the cv
2469 * in doeval() instead.
2471 if (CvDEPTH(cv) < 2)
2472 (void)SvREFCNT_inc(cv);
2473 else { /* save temporaries on recursion? */
2474 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2476 AV *newpad = newAV();
2477 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2478 I32 ix = AvFILLp((AV*)svp[1]);
2479 svp = AvARRAY(svp[0]);
2480 for ( ;ix > 0; ix--) {
2481 if (svp[ix] != &PL_sv_undef) {
2482 char *name = SvPVX(svp[ix]);
2483 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2484 || *name == '&') /* anonymous code? */
2486 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2488 else { /* our own lexical */
2490 av_store(newpad, ix, sv = (SV*)newAV());
2491 else if (*name == '%')
2492 av_store(newpad, ix, sv = (SV*)newHV());
2494 av_store(newpad, ix, sv = NEWSV(0,0));
2499 av_store(newpad, ix, sv = NEWSV(0,0));
2503 av = newAV(); /* will be @_ */
2505 av_store(newpad, 0, (SV*)av);
2506 AvFLAGS(av) = AVf_REIFY;
2507 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2508 AvFILLp(padlist) = CvDEPTH(cv);
2509 svp = AvARRAY(padlist);
2514 AV* av = (AV*)PL_curpad[0];
2516 items = AvFILLp(av) + 1;
2518 /* Mark is at the end of the stack. */
2520 Copy(AvARRAY(av), SP + 1, items, SV*);
2525 #endif /* USE_THREADS */
2526 SAVESPTR(PL_curpad);
2527 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2530 #endif /* USE_THREADS */
2536 DEBUG_S(PerlIO_printf(Perl_debug_log,
2537 "%p entersub preparing @_\n", thr));
2539 av = (AV*)PL_curpad[0];
2540 assert(!AvREAL(av));
2542 cx->blk_sub.savearray = GvAV(PL_defgv);
2543 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2544 #endif /* USE_THREADS */
2545 cx->blk_sub.argarray = av;
2548 if (items > AvMAX(av) + 1) {
2550 if (AvARRAY(av) != ary) {
2551 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2552 SvPVX(av) = (char*)ary;
2554 if (items > AvMAX(av) + 1) {
2555 AvMAX(av) = items - 1;
2556 Renew(ary,items,SV*);
2558 SvPVX(av) = (char*)ary;
2561 Copy(MARK,AvARRAY(av),items,SV*);
2562 AvFILLp(av) = items - 1;
2570 /* warning must come *after* we fully set up the context
2571 * stuff so that __WARN__ handlers can safely dounwind()
2574 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2575 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2576 sub_crush_depth(cv);
2578 DEBUG_S(PerlIO_printf(Perl_debug_log,
2579 "%p entersub returning %p\n", thr, CvSTART(cv)));
2581 RETURNOP(CvSTART(cv));
2586 Perl_sub_crush_depth(pTHX_ CV *cv)
2589 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2591 SV* tmpstr = sv_newmortal();
2592 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2593 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2604 U32 lval = PL_op->op_flags & OPf_MOD;
2605 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2609 elem -= PL_curcop->cop_arybase;
2610 if (SvTYPE(av) != SVt_PVAV)
2612 svp = av_fetch(av, elem, lval && !defer);
2614 if (!svp || *svp == &PL_sv_undef) {
2617 DIE(aTHX_ PL_no_aelem, elem);
2618 lv = sv_newmortal();
2619 sv_upgrade(lv, SVt_PVLV);
2621 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2622 LvTARG(lv) = SvREFCNT_inc(av);
2623 LvTARGOFF(lv) = elem;
2628 if (PL_op->op_private & OPpLVAL_INTRO)
2629 save_aelem(av, elem, svp);
2630 else if (PL_op->op_private & OPpDEREF)
2631 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2633 sv = (svp ? *svp : &PL_sv_undef);
2634 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2635 sv = sv_mortalcopy(sv);
2641 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2647 Perl_croak(aTHX_ PL_no_modify);
2648 if (SvTYPE(sv) < SVt_RV)
2649 sv_upgrade(sv, SVt_RV);
2650 else if (SvTYPE(sv) >= SVt_PV) {
2651 (void)SvOOK_off(sv);
2652 Safefree(SvPVX(sv));
2653 SvLEN(sv) = SvCUR(sv) = 0;
2657 SvRV(sv) = NEWSV(355,0);
2660 SvRV(sv) = (SV*)newAV();
2663 SvRV(sv) = (SV*)newHV();
2678 if (SvTYPE(rsv) == SVt_PVCV) {
2684 SETs(method_common(sv, Null(U32*)));
2691 SV* sv = cSVOP->op_sv;
2692 U32 hash = SvUVX(sv);
2694 XPUSHs(method_common(sv, &hash));
2699 S_method_common(pTHX_ SV* meth, U32* hashp)
2711 name = SvPV(meth, namelen);
2712 sv = *(PL_stack_base + TOPMARK + 1);
2723 !(packname = SvPV(sv, packlen)) ||
2724 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2725 !(ob=(SV*)GvIO(iogv)))
2728 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2729 ? !isIDFIRST_utf8((U8*)packname)
2730 : !isIDFIRST(*packname)
2733 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2734 SvOK(sv) ? "without a package or object reference"
2735 : "on an undefined value");
2737 stash = gv_stashpvn(packname, packlen, TRUE);
2740 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2743 if (!ob || !SvOBJECT(ob))
2744 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2747 stash = SvSTASH(ob);
2750 /* shortcut for simple names */
2752 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2754 gv = (GV*)HeVAL(he);
2755 if (isGV(gv) && GvCV(gv) &&
2756 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2757 return (SV*)GvCV(gv);
2761 gv = gv_fetchmethod(stash, name);
2767 for (p = name; *p; p++) {
2769 sep = p, leaf = p + 1;
2770 else if (*p == ':' && *(p + 1) == ':')
2771 sep = p, leaf = p + 2;
2773 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2774 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2775 packlen = strlen(packname);
2779 packlen = sep - name;
2782 "Can't locate object method \"%s\" via package \"%s\"",
2785 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2790 unset_cvowner(pTHXo_ void *cvarg)
2792 register CV* cv = (CV *) cvarg;
2795 #endif /* DEBUGGING */
2797 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2798 thr, cv, SvPEEK((SV*)cv))));
2799 MUTEX_LOCK(CvMUTEXP(cv));
2800 DEBUG_S(if (CvDEPTH(cv) != 0)
2801 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2803 assert(thr == CvOWNER(cv));
2805 MUTEX_UNLOCK(CvMUTEXP(cv));
2808 #endif /* USE_THREADS */