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
36 static void unset_cvowner(pTHXo_ void *cvarg);
37 #endif /* USE_THREADS */
48 PL_curcop = (COP*)PL_op;
49 TAINT_NOT; /* Each statement is presumed innocent */
50 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
59 if (PL_op->op_private & OPpLVAL_INTRO)
60 PUSHs(save_scalar(cGVOP_gv));
62 PUSHs(GvSV(cGVOP_gv));
73 PL_curcop = (COP*)PL_op;
79 PUSHMARK(PL_stack_sp);
89 sv_setpvn(TARG,s,len);
97 XPUSHs((SV*)cGVOP_gv);
108 RETURNOP(cLOGOP->op_other);
117 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
119 temp = left; left = right; right = temp;
121 if (PL_tainting && PL_tainted && !SvTAINTED(left))
123 SvSetMagicSV(right, left);
132 RETURNOP(cLOGOP->op_other);
134 RETURNOP(cLOGOP->op_next);
140 TAINT_NOT; /* Each statement is presumed innocent */
141 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
143 oldsave = PL_scopestack[PL_scopestack_ix - 1];
144 LEAVE_SCOPE(oldsave);
150 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
157 sv_setpvn(TARG,s,len);
159 else if (SvGMAGICAL(TARG))
161 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
162 sv_setpv(TARG, ""); /* Suppress warning. */
163 s = SvPV_force(TARG, len);
167 #if defined(PERL_Y2KWARN)
168 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_MISC)) {
170 char *s = SvPV(TARG,n);
171 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
172 && (n == 2 || !isDIGIT(s[n-3])))
174 Perl_warner(aTHX_ WARN_MISC, "Possible Y2K bug: %s",
175 "about to append an integer to '19'");
179 sv_catpvn(TARG,s,len);
182 sv_setpvn(TARG,s,len); /* suppress warning */
192 if (PL_op->op_flags & OPf_MOD) {
193 if (PL_op->op_private & OPpLVAL_INTRO)
194 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
195 else if (PL_op->op_private & OPpDEREF) {
197 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
206 tryAMAGICunTARGET(iter, 0);
207 PL_last_in_gv = (GV*)(*PL_stack_sp--);
208 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
209 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
210 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
213 XPUSHs((SV*)PL_last_in_gv);
216 PL_last_in_gv = (GV*)(*PL_stack_sp--);
219 return do_readline();
224 djSP; tryAMAGICbinSET(eq,0);
227 SETs(boolSV(TOPn == value));
235 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
236 DIE(aTHX_ PL_no_modify);
237 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
238 SvIVX(TOPs) != IV_MAX)
241 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
256 RETURNOP(cLOGOP->op_other);
262 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
265 SETn( left + right );
273 AV *av = GvAV(cGVOP_gv);
274 U32 lval = PL_op->op_flags & OPf_MOD;
275 SV** svp = av_fetch(av, PL_op->op_private, lval);
276 SV *sv = (svp ? *svp : &PL_sv_undef);
278 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
279 sv = sv_mortalcopy(sv);
286 djSP; dMARK; dTARGET;
288 do_join(TARG, *MARK, MARK, SP);
299 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
300 * will be enough to hold an OP*.
302 SV* sv = sv_newmortal();
303 sv_upgrade(sv, SVt_PVLV);
305 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
313 /* Oversized hot code. */
317 djSP; dMARK; dORIGMARK;
324 if (PL_op->op_flags & OPf_STACKED)
328 if (mg = SvTIED_mg((SV*)gv, 'q')) {
329 if (MARK == ORIGMARK) {
330 /* If using default handle then we need to make space to
331 * pass object as 1st arg, so move other args up ...
335 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
339 *MARK = SvTIED_obj((SV*)gv, mg);
342 call_method("PRINT", G_SCALAR);
350 if (!(io = GvIO(gv))) {
351 if (ckWARN(WARN_UNOPENED)) {
352 SV* sv = sv_newmortal();
353 gv_efullname3(sv, gv, Nullch);
354 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
357 SETERRNO(EBADF,RMS$_IFI);
360 else if (!(fp = IoOFP(io))) {
361 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
362 SV* sv = sv_newmortal();
363 gv_efullname3(sv, gv, Nullch);
365 Perl_warner(aTHX_ WARN_IO,
366 "Filehandle %s opened only for input",
368 else if (ckWARN(WARN_CLOSED))
369 Perl_warner(aTHX_ WARN_CLOSED,
370 "print() on closed filehandle %s", SvPV(sv,n_a));
372 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
379 if (!do_print(*MARK, fp))
383 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
392 if (!do_print(*MARK, fp))
401 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
404 if (IoFLAGS(io) & IOf_FLUSH)
405 if (PerlIO_flush(fp) == EOF)
426 tryAMAGICunDEREF(to_av);
429 if (SvTYPE(av) != SVt_PVAV)
430 DIE(aTHX_ "Not an ARRAY reference");
431 if (PL_op->op_flags & OPf_REF) {
437 if (SvTYPE(sv) == SVt_PVAV) {
439 if (PL_op->op_flags & OPf_REF) {
447 if (SvTYPE(sv) != SVt_PVGV) {
451 if (SvGMAGICAL(sv)) {
457 if (PL_op->op_flags & OPf_REF ||
458 PL_op->op_private & HINT_STRICT_REFS)
459 DIE(aTHX_ PL_no_usym, "an ARRAY");
460 if (ckWARN(WARN_UNINITIALIZED))
462 if (GIMME == G_ARRAY) {
469 if ((PL_op->op_flags & OPf_SPECIAL) &&
470 !(PL_op->op_flags & OPf_MOD))
472 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
477 if (PL_op->op_private & HINT_STRICT_REFS)
478 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
479 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
486 if (PL_op->op_private & OPpLVAL_INTRO)
488 if (PL_op->op_flags & OPf_REF) {
495 if (GIMME == G_ARRAY) {
496 I32 maxarg = AvFILL(av) + 1;
497 (void)POPs; /* XXXX May be optimized away? */
499 if (SvRMAGICAL(av)) {
501 for (i=0; i < maxarg; i++) {
502 SV **svp = av_fetch(av, i, FALSE);
503 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
507 Copy(AvARRAY(av), SP+1, maxarg, SV*);
513 I32 maxarg = AvFILL(av) + 1;
526 tryAMAGICunDEREF(to_hv);
529 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
530 DIE(aTHX_ "Not a HASH reference");
531 if (PL_op->op_flags & OPf_REF) {
537 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
539 if (PL_op->op_flags & OPf_REF) {
547 if (SvTYPE(sv) != SVt_PVGV) {
551 if (SvGMAGICAL(sv)) {
557 if (PL_op->op_flags & OPf_REF ||
558 PL_op->op_private & HINT_STRICT_REFS)
559 DIE(aTHX_ PL_no_usym, "a HASH");
560 if (ckWARN(WARN_UNINITIALIZED))
562 if (GIMME == G_ARRAY) {
569 if ((PL_op->op_flags & OPf_SPECIAL) &&
570 !(PL_op->op_flags & OPf_MOD))
572 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
577 if (PL_op->op_private & HINT_STRICT_REFS)
578 DIE(aTHX_ PL_no_symref, sym, "a HASH");
579 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
586 if (PL_op->op_private & OPpLVAL_INTRO)
588 if (PL_op->op_flags & OPf_REF) {
595 if (GIMME == G_ARRAY) { /* array wanted */
596 *PL_stack_sp = (SV*)hv;
601 if (SvTYPE(hv) == SVt_PVAV)
602 hv = avhv_keys((AV*)hv);
604 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
605 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
617 SV **lastlelem = PL_stack_sp;
618 SV **lastrelem = PL_stack_base + POPMARK;
619 SV **firstrelem = PL_stack_base + POPMARK + 1;
620 SV **firstlelem = lastrelem + 1;
633 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
635 /* If there's a common identifier on both sides we have to take
636 * special care that assigning the identifier on the left doesn't
637 * clobber a value on the right that's used later in the list.
639 if (PL_op->op_private & OPpASSIGN_COMMON) {
640 EXTEND_MORTAL(lastrelem - firstrelem + 1);
641 for (relem = firstrelem; relem <= lastrelem; relem++) {
644 TAINT_NOT; /* Each item is independent */
645 *relem = sv_mortalcopy(sv);
654 while (lelem <= lastlelem) {
655 TAINT_NOT; /* Each item stands on its own, taintwise. */
657 switch (SvTYPE(sv)) {
660 magic = SvMAGICAL(ary) != 0;
663 av_extend(ary, lastrelem - relem);
665 while (relem <= lastrelem) { /* gobble up all the rest */
671 didstore = av_store(ary,i++,sv);
685 magic = SvMAGICAL(hash) != 0;
688 while (relem < lastrelem) { /* gobble up all the rest */
693 sv = &PL_sv_no, relem++;
694 tmpstr = NEWSV(29,0);
696 sv_setsv(tmpstr,*relem); /* value */
698 didstore = hv_store_ent(hash,sv,tmpstr,0);
700 if (SvSMAGICAL(tmpstr))
707 if (relem == lastrelem) {
710 if (ckWARN(WARN_UNSAFE)) {
711 if (relem == firstrelem &&
713 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
714 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
715 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
717 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
719 tmpstr = NEWSV(29,0);
720 didstore = hv_store_ent(hash,*relem,tmpstr,0);
722 if (SvSMAGICAL(tmpstr))
734 if (SvIMMORTAL(sv)) {
735 if (relem <= lastrelem)
739 if (relem <= lastrelem) {
740 sv_setsv(sv, *relem);
744 sv_setsv(sv, &PL_sv_undef);
749 if (PL_delaymagic & ~DM_DELAY) {
750 if (PL_delaymagic & DM_UID) {
752 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
755 (void)setreuid(PL_uid,PL_euid);
758 if ((PL_delaymagic & DM_UID) == DM_RUID) {
759 (void)setruid(PL_uid);
760 PL_delaymagic &= ~DM_RUID;
762 # endif /* HAS_SETRUID */
764 if ((PL_delaymagic & DM_UID) == DM_EUID) {
765 (void)seteuid(PL_uid);
766 PL_delaymagic &= ~DM_EUID;
768 # endif /* HAS_SETEUID */
769 if (PL_delaymagic & DM_UID) {
770 if (PL_uid != PL_euid)
771 DIE(aTHX_ "No setreuid available");
772 (void)PerlProc_setuid(PL_uid);
774 # endif /* HAS_SETREUID */
775 #endif /* HAS_SETRESUID */
776 PL_uid = PerlProc_getuid();
777 PL_euid = PerlProc_geteuid();
779 if (PL_delaymagic & DM_GID) {
781 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
784 (void)setregid(PL_gid,PL_egid);
787 if ((PL_delaymagic & DM_GID) == DM_RGID) {
788 (void)setrgid(PL_gid);
789 PL_delaymagic &= ~DM_RGID;
791 # endif /* HAS_SETRGID */
793 if ((PL_delaymagic & DM_GID) == DM_EGID) {
794 (void)setegid(PL_gid);
795 PL_delaymagic &= ~DM_EGID;
797 # endif /* HAS_SETEGID */
798 if (PL_delaymagic & DM_GID) {
799 if (PL_gid != PL_egid)
800 DIE(aTHX_ "No setregid available");
801 (void)PerlProc_setgid(PL_gid);
803 # endif /* HAS_SETREGID */
804 #endif /* HAS_SETRESGID */
805 PL_gid = PerlProc_getgid();
806 PL_egid = PerlProc_getegid();
808 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
815 else if (gimme == G_SCALAR) {
818 SETi(lastrelem - firstrelem + 1);
824 SP = firstrelem + (lastlelem - firstlelem);
825 lelem = firstlelem + (relem - firstrelem);
827 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
835 register PMOP *pm = cPMOP;
836 SV *rv = sv_newmortal();
837 SV *sv = newSVrv(rv, "Regexp");
838 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
845 register PMOP *pm = cPMOP;
850 I32 r_flags = REXEC_CHECKED;
851 char *truebase; /* Start of string */
852 register REGEXP *rx = pm->op_pmregexp;
857 I32 oldsave = PL_savestack_ix;
858 I32 update_minmatch = 1;
861 if (PL_op->op_flags & OPf_STACKED)
867 PUTBACK; /* EVAL blocks need stack_sp. */
871 DIE(aTHX_ "panic: do_match");
872 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
873 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
876 if (pm->op_pmdynflags & PMdf_USED) {
878 if (gimme == G_ARRAY)
883 if (!rx->prelen && PL_curpm) {
885 rx = pm->op_pmregexp;
887 if (rx->minlen > len) goto failure;
891 /* XXXX What part of this is needed with true \G-support? */
892 if (global = pm->op_pmflags & PMf_GLOBAL) {
894 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
895 MAGIC* mg = mg_find(TARG, 'g');
896 if (mg && mg->mg_len >= 0) {
897 if (!(rx->reganch & ROPT_GPOS_SEEN))
898 rx->endp[0] = rx->startp[0] = mg->mg_len;
899 else if (rx->reganch & ROPT_ANCH_GPOS) {
900 r_flags |= REXEC_IGNOREPOS;
901 rx->endp[0] = rx->startp[0] = mg->mg_len;
903 minmatch = (mg->mg_flags & MGf_MINMATCH);
908 if ((gimme != G_ARRAY && !global && rx->nparens)
909 || SvTEMP(TARG) || PL_sawampersand)
910 r_flags |= REXEC_COPY_STR;
912 r_flags |= REXEC_SCREAM;
914 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
915 SAVEINT(PL_multiline);
916 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
920 if (global && rx->startp[0] != -1) {
921 t = s = rx->endp[0] + truebase;
922 if ((s + rx->minlen) > strend)
924 if (update_minmatch++)
925 minmatch = had_zerolen;
927 if (rx->reganch & RE_USE_INTUIT) {
928 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
932 if ( (rx->reganch & ROPT_CHECK_ALL)
934 && ((rx->reganch & ROPT_NOSCAN)
935 || !((rx->reganch & RE_INTUIT_TAIL)
936 && (r_flags & REXEC_SCREAM))))
939 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
942 if (pm->op_pmflags & PMf_ONCE)
943 pm->op_pmdynflags |= PMdf_USED;
952 RX_MATCH_TAINTED_on(rx);
953 TAINT_IF(RX_MATCH_TAINTED(rx));
954 if (gimme == G_ARRAY) {
958 if (global && !iters)
962 SPAGAIN; /* EVAL blocks could move the stack. */
963 EXTEND(SP, iters + i);
964 EXTEND_MORTAL(iters + i);
965 for (i = !i; i <= iters; i++) {
966 PUSHs(sv_newmortal());
968 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
969 len = rx->endp[i] - rx->startp[i];
970 s = rx->startp[i] + truebase;
971 sv_setpvn(*SP, s, len);
975 had_zerolen = (rx->startp[0] != -1
976 && rx->startp[0] == rx->endp[0]);
977 PUTBACK; /* EVAL blocks may use stack */
978 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
983 LEAVE_SCOPE(oldsave);
989 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
990 mg = mg_find(TARG, 'g');
992 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
993 mg = mg_find(TARG, 'g');
995 if (rx->startp[0] != -1) {
996 mg->mg_len = rx->endp[0];
997 if (rx->startp[0] == rx->endp[0])
998 mg->mg_flags |= MGf_MINMATCH;
1000 mg->mg_flags &= ~MGf_MINMATCH;
1003 LEAVE_SCOPE(oldsave);
1007 yup: /* Confirmed by INTUIT */
1009 RX_MATCH_TAINTED_on(rx);
1010 TAINT_IF(RX_MATCH_TAINTED(rx));
1012 if (pm->op_pmflags & PMf_ONCE)
1013 pm->op_pmdynflags |= PMdf_USED;
1014 if (RX_MATCH_COPIED(rx))
1015 Safefree(rx->subbeg);
1016 RX_MATCH_COPIED_off(rx);
1017 rx->subbeg = Nullch;
1019 rx->subbeg = truebase;
1020 rx->startp[0] = s - truebase;
1021 rx->endp[0] = s - truebase + rx->minlen;
1022 rx->sublen = strend - truebase;
1025 if (PL_sawampersand) {
1028 rx->subbeg = savepvn(t, strend - t);
1029 rx->sublen = strend - t;
1030 RX_MATCH_COPIED_on(rx);
1031 off = rx->startp[0] = s - t;
1032 rx->endp[0] = off + rx->minlen;
1034 else { /* startp/endp are used by @- @+. */
1035 rx->startp[0] = s - truebase;
1036 rx->endp[0] = s - truebase + rx->minlen;
1038 LEAVE_SCOPE(oldsave);
1043 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1044 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1045 MAGIC* mg = mg_find(TARG, 'g');
1050 LEAVE_SCOPE(oldsave);
1051 if (gimme == G_ARRAY)
1057 Perl_do_readline(pTHX)
1059 dSP; dTARGETSTACKED;
1064 register IO *io = GvIO(PL_last_in_gv);
1065 register I32 type = PL_op->op_type;
1066 I32 gimme = GIMME_V;
1069 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1071 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1074 call_method("READLINE", gimme);
1077 if (gimme == G_SCALAR)
1078 SvSetMagicSV_nosteal(TARG, TOPs);
1085 if (IoFLAGS(io) & IOf_ARGV) {
1086 if (IoFLAGS(io) & IOf_START) {
1088 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1089 IoFLAGS(io) &= ~IOf_START;
1090 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1091 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1092 SvSETMAGIC(GvSV(PL_last_in_gv));
1097 fp = nextargv(PL_last_in_gv);
1098 if (!fp) { /* Note: fp != IoIFP(io) */
1099 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1102 else if (type == OP_GLOB) {
1103 SV *tmpcmd = NEWSV(55, 0);
1107 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1108 /* since spawning off a process is a real performance hit */
1110 #include <descrip.h>
1111 #include <lib$routines.h>
1114 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1115 char vmsspec[NAM$C_MAXRSS+1];
1116 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1117 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1118 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1121 struct dsc$descriptor_s wilddsc
1122 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1123 struct dsc$descriptor_vs rsdsc
1124 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1125 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1127 /* We could find out if there's an explicit dev/dir or version
1128 by peeking into lib$find_file's internal context at
1129 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1130 but that's unsupported, so I don't want to do it now and
1131 have it bite someone in the future. */
1132 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1133 cp = SvPV(tmpglob,i);
1135 if (cp[i] == ';') hasver = 1;
1137 if (sts) hasver = 1;
1141 hasdir = isunix = 1;
1144 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1149 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1151 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1152 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1153 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1154 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1155 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1156 &dfltdsc,NULL,NULL,NULL))&1)) {
1157 end = rstr + (unsigned long int) *rslt;
1158 if (!hasver) while (*end != ';') end--;
1159 *(end++) = '\n'; *end = '\0';
1160 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1162 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1167 while (*(--begin) != ']' && *begin != '>') ;
1170 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1172 if (cxt) (void)lib$find_file_end(&cxt);
1173 if (ok && sts != RMS$_NMF &&
1174 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1177 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1179 PerlIO_close(tmpfp);
1183 PerlIO_rewind(tmpfp);
1185 IoIFP(io) = fp = tmpfp;
1186 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1191 #ifdef MACOS_TRADITIONAL
1192 sv_setpv(tmpcmd, "glob ");
1193 sv_catsv(tmpcmd, tmpglob);
1194 sv_catpv(tmpcmd, " |");
1198 sv_setpv(tmpcmd, "for a in ");
1199 sv_catsv(tmpcmd, tmpglob);
1200 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1203 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1204 sv_catsv(tmpcmd, tmpglob);
1206 sv_setpv(tmpcmd, "perlglob ");
1207 sv_catsv(tmpcmd, tmpglob);
1208 sv_catpv(tmpcmd, " |");
1213 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1214 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1215 sv_catsv(tmpcmd, tmpglob);
1216 sv_catpv(tmpcmd, "' 2>/dev/null |");
1218 sv_setpv(tmpcmd, "echo ");
1219 sv_catsv(tmpcmd, tmpglob);
1221 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1223 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1226 #endif /* !DOSISH */
1227 #endif /* MACOS_TRADITIONAL */
1228 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1229 FALSE, O_RDONLY, 0, Nullfp);
1235 else if (type == OP_GLOB)
1237 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1238 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1239 || fp == PerlIO_stderr()))
1241 SV* sv = sv_newmortal();
1242 gv_efullname3(sv, PL_last_in_gv, Nullch);
1243 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1248 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1249 if (type == OP_GLOB)
1250 Perl_warner(aTHX_ WARN_CLOSED,
1251 "glob failed (can't start child: %s)",
1254 SV* sv = sv_newmortal();
1255 gv_efullname3(sv, PL_last_in_gv, Nullch);
1256 Perl_warner(aTHX_ WARN_CLOSED,
1257 "readline() on closed filehandle %s",
1261 if (gimme == G_SCALAR) {
1262 (void)SvOK_off(TARG);
1268 if (gimme == G_SCALAR) {
1272 (void)SvUPGRADE(sv, SVt_PV);
1273 tmplen = SvLEN(sv); /* remember if already alloced */
1275 Sv_Grow(sv, 80); /* try short-buffering it */
1276 if (type == OP_RCATLINE)
1282 sv = sv_2mortal(NEWSV(57, 80));
1286 /* delay EOF state for a snarfed empty file */
1287 #define SNARF_EOF(gimme,rs,io,sv) \
1288 (gimme != G_SCALAR || SvCUR(sv) \
1289 || !RsSNARF(rs) || (IoFLAGS(io) & IOf_NOLINE) \
1290 || ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1293 if (!sv_gets(sv, fp, offset)
1294 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1296 PerlIO_clearerr(fp);
1297 if (IoFLAGS(io) & IOf_ARGV) {
1298 fp = nextargv(PL_last_in_gv);
1301 (void)do_close(PL_last_in_gv, FALSE);
1303 else if (type == OP_GLOB) {
1304 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1305 Perl_warner(aTHX_ WARN_CLOSED,
1306 "glob failed (child exited with status %d%s)",
1307 STATUS_CURRENT >> 8,
1308 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1311 if (gimme == G_SCALAR) {
1312 (void)SvOK_off(TARG);
1317 /* This should not be marked tainted if the fp is marked clean */
1318 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1325 if (type == OP_GLOB) {
1328 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1329 tmps = SvEND(sv) - 1;
1330 if (*tmps == *SvPVX(PL_rs)) {
1335 for (tmps = SvPVX(sv); *tmps; tmps++)
1336 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1337 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1339 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1340 (void)POPs; /* Unmatched wildcard? Chuck it... */
1344 if (gimme == G_ARRAY) {
1345 if (SvLEN(sv) - SvCUR(sv) > 20) {
1346 SvLEN_set(sv, SvCUR(sv)+1);
1347 Renew(SvPVX(sv), SvLEN(sv), char);
1349 sv = sv_2mortal(NEWSV(58, 80));
1352 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1353 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1357 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1358 Renew(SvPVX(sv), SvLEN(sv), char);
1367 register PERL_CONTEXT *cx;
1368 I32 gimme = OP_GIMME(PL_op, -1);
1371 if (cxstack_ix >= 0)
1372 gimme = cxstack[cxstack_ix].blk_gimme;
1380 PUSHBLOCK(cx, CXt_BLOCK, SP);
1392 U32 lval = PL_op->op_flags & OPf_MOD;
1393 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1396 if (SvTYPE(hv) == SVt_PVHV) {
1397 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1398 svp = he ? &HeVAL(he) : 0;
1400 else if (SvTYPE(hv) == SVt_PVAV) {
1401 if (PL_op->op_private & OPpLVAL_INTRO)
1402 DIE(aTHX_ "Can't localize pseudo-hash element");
1403 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1409 if (!svp || *svp == &PL_sv_undef) {
1414 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1416 lv = sv_newmortal();
1417 sv_upgrade(lv, SVt_PVLV);
1419 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1420 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1421 LvTARG(lv) = SvREFCNT_inc(hv);
1426 if (PL_op->op_private & OPpLVAL_INTRO) {
1427 if (HvNAME(hv) && isGV(*svp))
1428 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1430 save_helem(hv, keysv, svp);
1432 else if (PL_op->op_private & OPpDEREF)
1433 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1435 sv = (svp ? *svp : &PL_sv_undef);
1436 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1437 * Pushing the magical RHS on to the stack is useless, since
1438 * that magic is soon destined to be misled by the local(),
1439 * and thus the later pp_sassign() will fail to mg_get() the
1440 * old value. This should also cure problems with delayed
1441 * mg_get()s. GSAR 98-07-03 */
1442 if (!lval && SvGMAGICAL(sv))
1443 sv = sv_mortalcopy(sv);
1451 register PERL_CONTEXT *cx;
1457 if (PL_op->op_flags & OPf_SPECIAL) {
1458 cx = &cxstack[cxstack_ix];
1459 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1464 gimme = OP_GIMME(PL_op, -1);
1466 if (cxstack_ix >= 0)
1467 gimme = cxstack[cxstack_ix].blk_gimme;
1473 if (gimme == G_VOID)
1475 else if (gimme == G_SCALAR) {
1478 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1481 *MARK = sv_mortalcopy(TOPs);
1484 *MARK = &PL_sv_undef;
1488 else if (gimme == G_ARRAY) {
1489 /* in case LEAVE wipes old return values */
1490 for (mark = newsp + 1; mark <= SP; mark++) {
1491 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1492 *mark = sv_mortalcopy(*mark);
1493 TAINT_NOT; /* Each item is independent */
1497 PL_curpm = newpm; /* Don't pop $1 et al till now */
1507 register PERL_CONTEXT *cx;
1513 cx = &cxstack[cxstack_ix];
1514 if (CxTYPE(cx) != CXt_LOOP)
1515 DIE(aTHX_ "panic: pp_iter");
1517 itersvp = CxITERVAR(cx);
1518 av = cx->blk_loop.iterary;
1519 if (SvTYPE(av) != SVt_PVAV) {
1520 /* iterate ($min .. $max) */
1521 if (cx->blk_loop.iterlval) {
1522 /* string increment */
1523 register SV* cur = cx->blk_loop.iterlval;
1525 char *max = SvPV((SV*)av, maxlen);
1526 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1527 #ifndef USE_THREADS /* don't risk potential race */
1528 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1529 /* safe to reuse old SV */
1530 sv_setsv(*itersvp, cur);
1535 /* we need a fresh SV every time so that loop body sees a
1536 * completely new SV for closures/references to work as
1538 SvREFCNT_dec(*itersvp);
1539 *itersvp = newSVsv(cur);
1541 if (strEQ(SvPVX(cur), max))
1542 sv_setiv(cur, 0); /* terminate next time */
1549 /* integer increment */
1550 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1553 #ifndef USE_THREADS /* don't risk potential race */
1554 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1555 /* safe to reuse old SV */
1556 sv_setiv(*itersvp, 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(*itersvp);
1565 *itersvp = newSViv(cx->blk_loop.iterix++);
1571 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1574 SvREFCNT_dec(*itersvp);
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 *itersvp = 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 SAVEVPTR(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 PERL_STACK_OVERFLOW_CHECK();
2475 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2477 AV *newpad = newAV();
2478 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2479 I32 ix = AvFILLp((AV*)svp[1]);
2480 I32 names_fill = AvFILLp((AV*)svp[0]);
2481 svp = AvARRAY(svp[0]);
2482 for ( ;ix > 0; ix--) {
2483 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2484 char *name = SvPVX(svp[ix]);
2485 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2486 || *name == '&') /* anonymous code? */
2488 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2490 else { /* our own lexical */
2492 av_store(newpad, ix, sv = (SV*)newAV());
2493 else if (*name == '%')
2494 av_store(newpad, ix, sv = (SV*)newHV());
2496 av_store(newpad, ix, sv = NEWSV(0,0));
2500 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2501 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2504 av_store(newpad, ix, sv = NEWSV(0,0));
2508 av = newAV(); /* will be @_ */
2510 av_store(newpad, 0, (SV*)av);
2511 AvFLAGS(av) = AVf_REIFY;
2512 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2513 AvFILLp(padlist) = CvDEPTH(cv);
2514 svp = AvARRAY(padlist);
2519 AV* av = (AV*)PL_curpad[0];
2521 items = AvFILLp(av) + 1;
2523 /* Mark is at the end of the stack. */
2525 Copy(AvARRAY(av), SP + 1, items, SV*);
2530 #endif /* USE_THREADS */
2531 SAVEVPTR(PL_curpad);
2532 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2535 #endif /* USE_THREADS */
2541 DEBUG_S(PerlIO_printf(Perl_debug_log,
2542 "%p entersub preparing @_\n", thr));
2544 av = (AV*)PL_curpad[0];
2546 /* @_ is normally not REAL--this should only ever
2547 * happen when DB::sub() calls things that modify @_ */
2553 cx->blk_sub.savearray = GvAV(PL_defgv);
2554 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2555 #endif /* USE_THREADS */
2556 cx->blk_sub.argarray = av;
2559 if (items > AvMAX(av) + 1) {
2561 if (AvARRAY(av) != ary) {
2562 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2563 SvPVX(av) = (char*)ary;
2565 if (items > AvMAX(av) + 1) {
2566 AvMAX(av) = items - 1;
2567 Renew(ary,items,SV*);
2569 SvPVX(av) = (char*)ary;
2572 Copy(MARK,AvARRAY(av),items,SV*);
2573 AvFILLp(av) = items - 1;
2581 /* warning must come *after* we fully set up the context
2582 * stuff so that __WARN__ handlers can safely dounwind()
2585 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2586 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2587 sub_crush_depth(cv);
2589 DEBUG_S(PerlIO_printf(Perl_debug_log,
2590 "%p entersub returning %p\n", thr, CvSTART(cv)));
2592 RETURNOP(CvSTART(cv));
2597 Perl_sub_crush_depth(pTHX_ CV *cv)
2600 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2602 SV* tmpstr = sv_newmortal();
2603 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2604 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2615 U32 lval = PL_op->op_flags & OPf_MOD;
2616 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2620 elem -= PL_curcop->cop_arybase;
2621 if (SvTYPE(av) != SVt_PVAV)
2623 svp = av_fetch(av, elem, lval && !defer);
2625 if (!svp || *svp == &PL_sv_undef) {
2628 DIE(aTHX_ PL_no_aelem, elem);
2629 lv = sv_newmortal();
2630 sv_upgrade(lv, SVt_PVLV);
2632 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2633 LvTARG(lv) = SvREFCNT_inc(av);
2634 LvTARGOFF(lv) = elem;
2639 if (PL_op->op_private & OPpLVAL_INTRO)
2640 save_aelem(av, elem, svp);
2641 else if (PL_op->op_private & OPpDEREF)
2642 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2644 sv = (svp ? *svp : &PL_sv_undef);
2645 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2646 sv = sv_mortalcopy(sv);
2652 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2658 Perl_croak(aTHX_ PL_no_modify);
2659 if (SvTYPE(sv) < SVt_RV)
2660 sv_upgrade(sv, SVt_RV);
2661 else if (SvTYPE(sv) >= SVt_PV) {
2662 (void)SvOOK_off(sv);
2663 Safefree(SvPVX(sv));
2664 SvLEN(sv) = SvCUR(sv) = 0;
2668 SvRV(sv) = NEWSV(355,0);
2671 SvRV(sv) = (SV*)newAV();
2674 SvRV(sv) = (SV*)newHV();
2689 if (SvTYPE(rsv) == SVt_PVCV) {
2695 SETs(method_common(sv, Null(U32*)));
2702 SV* sv = cSVOP->op_sv;
2703 U32 hash = SvUVX(sv);
2705 XPUSHs(method_common(sv, &hash));
2710 S_method_common(pTHX_ SV* meth, U32* hashp)
2722 name = SvPV(meth, namelen);
2723 sv = *(PL_stack_base + TOPMARK + 1);
2734 !(packname = SvPV(sv, packlen)) ||
2735 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2736 !(ob=(SV*)GvIO(iogv)))
2739 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2740 ? !isIDFIRST_utf8((U8*)packname)
2741 : !isIDFIRST(*packname)
2744 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2745 SvOK(sv) ? "without a package or object reference"
2746 : "on an undefined value");
2748 stash = gv_stashpvn(packname, packlen, TRUE);
2751 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2754 if (!ob || !SvOBJECT(ob))
2755 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2758 stash = SvSTASH(ob);
2761 /* shortcut for simple names */
2763 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2765 gv = (GV*)HeVAL(he);
2766 if (isGV(gv) && GvCV(gv) &&
2767 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2768 return (SV*)GvCV(gv);
2772 gv = gv_fetchmethod(stash, name);
2778 for (p = name; *p; p++) {
2780 sep = p, leaf = p + 1;
2781 else if (*p == ':' && *(p + 1) == ':')
2782 sep = p, leaf = p + 2;
2784 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2785 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2786 packlen = strlen(packname);
2790 packlen = sep - name;
2793 "Can't locate object method \"%s\" via package \"%s\"",
2796 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2801 unset_cvowner(pTHXo_ void *cvarg)
2803 register CV* cv = (CV *) cvarg;
2806 #endif /* DEBUGGING */
2808 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2809 thr, cv, SvPEEK((SV*)cv))));
2810 MUTEX_LOCK(CvMUTEXP(cv));
2811 DEBUG_S(if (CvDEPTH(cv) != 0)
2812 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2814 assert(thr == CvOWNER(cv));
2816 MUTEX_UNLOCK(CvMUTEXP(cv));
2819 #endif /* USE_THREADS */