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 sv_catpvn(TARG,s,len);
170 sv_setpvn(TARG,s,len); /* suppress warning */
180 if (PL_op->op_flags & OPf_MOD) {
181 if (PL_op->op_private & OPpLVAL_INTRO)
182 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
183 else if (PL_op->op_private & OPpDEREF) {
185 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
194 tryAMAGICunTARGET(iter, 0);
195 PL_last_in_gv = (GV*)(*PL_stack_sp--);
196 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
197 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
198 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
201 XPUSHs((SV*)PL_last_in_gv);
204 PL_last_in_gv = (GV*)(*PL_stack_sp--);
207 return do_readline();
212 djSP; tryAMAGICbinSET(eq,0);
215 SETs(boolSV(TOPn == value));
223 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
224 Perl_croak(aTHX_ PL_no_modify);
225 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
226 SvIVX(TOPs) != IV_MAX)
229 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
244 RETURNOP(cLOGOP->op_other);
250 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
253 SETn( left + right );
261 AV *av = GvAV((GV*)cSVOP->op_sv);
262 U32 lval = PL_op->op_flags & OPf_MOD;
263 SV** svp = av_fetch(av, PL_op->op_private, lval);
264 SV *sv = (svp ? *svp : &PL_sv_undef);
266 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
267 sv = sv_mortalcopy(sv);
274 djSP; dMARK; dTARGET;
276 do_join(TARG, *MARK, MARK, SP);
287 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
288 * will be enough to hold an OP*.
290 SV* sv = sv_newmortal();
291 sv_upgrade(sv, SVt_PVLV);
293 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
301 /* Oversized hot code. */
305 djSP; dMARK; dORIGMARK;
312 if (PL_op->op_flags & OPf_STACKED)
316 if (mg = SvTIED_mg((SV*)gv, 'q')) {
317 if (MARK == ORIGMARK) {
318 /* If using default handle then we need to make space to
319 * pass object as 1st arg, so move other args up ...
323 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
327 *MARK = SvTIED_obj((SV*)gv, mg);
330 call_method("PRINT", G_SCALAR);
338 if (!(io = GvIO(gv))) {
339 if (ckWARN(WARN_UNOPENED)) {
340 SV* sv = sv_newmortal();
341 gv_efullname3(sv, gv, Nullch);
342 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
345 SETERRNO(EBADF,RMS$_IFI);
348 else if (!(fp = IoOFP(io))) {
349 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
350 SV* sv = sv_newmortal();
351 gv_efullname3(sv, gv, Nullch);
353 Perl_warner(aTHX_ WARN_IO,
354 "Filehandle %s opened only for input",
356 else if (ckWARN(WARN_CLOSED))
357 Perl_warner(aTHX_ WARN_CLOSED,
358 "print on closed filehandle %s", SvPV(sv,n_a));
360 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
367 if (!do_print(*MARK, fp))
371 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
380 if (!do_print(*MARK, fp))
389 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
392 if (IoFLAGS(io) & IOf_FLUSH)
393 if (PerlIO_flush(fp) == EOF)
414 tryAMAGICunDEREF(to_av);
417 if (SvTYPE(av) != SVt_PVAV)
418 DIE(aTHX_ "Not an ARRAY reference");
419 if (PL_op->op_flags & OPf_REF) {
425 if (SvTYPE(sv) == SVt_PVAV) {
427 if (PL_op->op_flags & OPf_REF) {
435 if (SvTYPE(sv) != SVt_PVGV) {
439 if (SvGMAGICAL(sv)) {
445 if (PL_op->op_flags & OPf_REF ||
446 PL_op->op_private & HINT_STRICT_REFS)
447 DIE(aTHX_ PL_no_usym, "an ARRAY");
448 if (ckWARN(WARN_UNINITIALIZED))
449 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
450 if (GIMME == G_ARRAY) {
457 if ((PL_op->op_flags & OPf_SPECIAL) &&
458 !(PL_op->op_flags & OPf_MOD))
460 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
465 if (PL_op->op_private & HINT_STRICT_REFS)
466 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
467 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
474 if (PL_op->op_private & OPpLVAL_INTRO)
476 if (PL_op->op_flags & OPf_REF) {
483 if (GIMME == G_ARRAY) {
484 I32 maxarg = AvFILL(av) + 1;
485 (void)POPs; /* XXXX May be optimized away? */
487 if (SvRMAGICAL(av)) {
489 for (i=0; i < maxarg; i++) {
490 SV **svp = av_fetch(av, i, FALSE);
491 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
495 Copy(AvARRAY(av), SP+1, maxarg, SV*);
501 I32 maxarg = AvFILL(av) + 1;
514 tryAMAGICunDEREF(to_hv);
517 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
518 DIE(aTHX_ "Not a HASH reference");
519 if (PL_op->op_flags & OPf_REF) {
525 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
527 if (PL_op->op_flags & OPf_REF) {
535 if (SvTYPE(sv) != SVt_PVGV) {
539 if (SvGMAGICAL(sv)) {
545 if (PL_op->op_flags & OPf_REF ||
546 PL_op->op_private & HINT_STRICT_REFS)
547 DIE(aTHX_ PL_no_usym, "a HASH");
548 if (ckWARN(WARN_UNINITIALIZED))
549 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
550 if (GIMME == G_ARRAY) {
557 if ((PL_op->op_flags & OPf_SPECIAL) &&
558 !(PL_op->op_flags & OPf_MOD))
560 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
565 if (PL_op->op_private & HINT_STRICT_REFS)
566 DIE(aTHX_ PL_no_symref, sym, "a HASH");
567 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
574 if (PL_op->op_private & OPpLVAL_INTRO)
576 if (PL_op->op_flags & OPf_REF) {
583 if (GIMME == G_ARRAY) { /* array wanted */
584 *PL_stack_sp = (SV*)hv;
589 if (SvTYPE(hv) == SVt_PVAV)
590 hv = avhv_keys((AV*)hv);
593 Perl_sv_setpvf(aTHX_ TARG, "%" PERL_PRId64 "/%" PERL_PRId64,
594 (Quad_t)HvFILL(hv), (Quad_t)HvMAX(hv) + 1);
597 Perl_sv_setpvf(aTHX_ TARG, "%ld/%ld",
598 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
611 SV **lastlelem = PL_stack_sp;
612 SV **lastrelem = PL_stack_base + POPMARK;
613 SV **firstrelem = PL_stack_base + POPMARK + 1;
614 SV **firstlelem = lastrelem + 1;
627 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
629 /* If there's a common identifier on both sides we have to take
630 * special care that assigning the identifier on the left doesn't
631 * clobber a value on the right that's used later in the list.
633 if (PL_op->op_private & OPpASSIGN_COMMON) {
634 EXTEND_MORTAL(lastrelem - firstrelem + 1);
635 for (relem = firstrelem; relem <= lastrelem; relem++) {
638 TAINT_NOT; /* Each item is independent */
639 *relem = sv_mortalcopy(sv);
648 while (lelem <= lastlelem) {
649 TAINT_NOT; /* Each item stands on its own, taintwise. */
651 switch (SvTYPE(sv)) {
654 magic = SvMAGICAL(ary) != 0;
657 av_extend(ary, lastrelem - relem);
659 while (relem <= lastrelem) { /* gobble up all the rest */
665 didstore = av_store(ary,i++,sv);
679 magic = SvMAGICAL(hash) != 0;
682 while (relem < lastrelem) { /* gobble up all the rest */
687 sv = &PL_sv_no, relem++;
688 tmpstr = NEWSV(29,0);
690 sv_setsv(tmpstr,*relem); /* value */
692 didstore = hv_store_ent(hash,sv,tmpstr,0);
694 if (SvSMAGICAL(tmpstr))
701 if (relem == lastrelem) {
704 if (ckWARN(WARN_UNSAFE)) {
705 if (relem == firstrelem &&
707 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
708 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
709 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
711 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
713 tmpstr = NEWSV(29,0);
714 didstore = hv_store_ent(hash,*relem,tmpstr,0);
716 if (SvSMAGICAL(tmpstr))
728 if (SvIMMORTAL(sv)) {
729 if (relem <= lastrelem)
733 if (relem <= lastrelem) {
734 sv_setsv(sv, *relem);
738 sv_setsv(sv, &PL_sv_undef);
743 if (PL_delaymagic & ~DM_DELAY) {
744 if (PL_delaymagic & DM_UID) {
746 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
749 (void)setreuid(PL_uid,PL_euid);
752 if ((PL_delaymagic & DM_UID) == DM_RUID) {
753 (void)setruid(PL_uid);
754 PL_delaymagic &= ~DM_RUID;
756 # endif /* HAS_SETRUID */
758 if ((PL_delaymagic & DM_UID) == DM_EUID) {
759 (void)seteuid(PL_uid);
760 PL_delaymagic &= ~DM_EUID;
762 # endif /* HAS_SETEUID */
763 if (PL_delaymagic & DM_UID) {
764 if (PL_uid != PL_euid)
765 DIE(aTHX_ "No setreuid available");
766 (void)PerlProc_setuid(PL_uid);
768 # endif /* HAS_SETREUID */
769 #endif /* HAS_SETRESUID */
770 PL_uid = PerlProc_getuid();
771 PL_euid = PerlProc_geteuid();
773 if (PL_delaymagic & DM_GID) {
775 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
778 (void)setregid(PL_gid,PL_egid);
781 if ((PL_delaymagic & DM_GID) == DM_RGID) {
782 (void)setrgid(PL_gid);
783 PL_delaymagic &= ~DM_RGID;
785 # endif /* HAS_SETRGID */
787 if ((PL_delaymagic & DM_GID) == DM_EGID) {
788 (void)setegid(PL_gid);
789 PL_delaymagic &= ~DM_EGID;
791 # endif /* HAS_SETEGID */
792 if (PL_delaymagic & DM_GID) {
793 if (PL_gid != PL_egid)
794 DIE(aTHX_ "No setregid available");
795 (void)PerlProc_setgid(PL_gid);
797 # endif /* HAS_SETREGID */
798 #endif /* HAS_SETRESGID */
799 PL_gid = PerlProc_getgid();
800 PL_egid = PerlProc_getegid();
802 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
809 else if (gimme == G_SCALAR) {
812 SETi(lastrelem - firstrelem + 1);
818 SP = firstrelem + (lastlelem - firstlelem);
819 lelem = firstlelem + (relem - firstrelem);
821 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
829 register PMOP *pm = cPMOP;
830 SV *rv = sv_newmortal();
831 SV *sv = newSVrv(rv, "Regexp");
832 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
839 register PMOP *pm = cPMOP;
844 I32 r_flags = REXEC_CHECKED;
845 char *truebase; /* Start of string */
846 register REGEXP *rx = pm->op_pmregexp;
851 I32 oldsave = PL_savestack_ix;
852 I32 update_minmatch = 1;
855 if (PL_op->op_flags & OPf_STACKED)
861 PUTBACK; /* EVAL blocks need stack_sp. */
865 DIE(aTHX_ "panic: do_match");
866 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
867 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
870 if (pm->op_pmdynflags & PMdf_USED) {
872 if (gimme == G_ARRAY)
877 if (!rx->prelen && PL_curpm) {
879 rx = pm->op_pmregexp;
881 if (rx->minlen > len) goto failure;
885 /* XXXX What part of this is needed with true \G-support? */
886 if (global = pm->op_pmflags & PMf_GLOBAL) {
888 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
889 MAGIC* mg = mg_find(TARG, 'g');
890 if (mg && mg->mg_len >= 0) {
891 if (!(rx->reganch & ROPT_GPOS_SEEN))
892 rx->endp[0] = rx->startp[0] = mg->mg_len;
893 else if (rx->reganch & ROPT_ANCH_GPOS) {
894 r_flags |= REXEC_IGNOREPOS;
895 rx->endp[0] = rx->startp[0] = mg->mg_len;
897 minmatch = (mg->mg_flags & MGf_MINMATCH);
902 if ((gimme != G_ARRAY && !global && rx->nparens)
903 || SvTEMP(TARG) || PL_sawampersand)
904 r_flags |= REXEC_COPY_STR;
906 r_flags |= REXEC_SCREAM;
908 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
909 SAVEINT(PL_multiline);
910 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
914 if (global && rx->startp[0] != -1) {
915 t = s = rx->endp[0] + truebase;
916 if ((s + rx->minlen) > strend)
918 if (update_minmatch++)
919 minmatch = had_zerolen;
921 if (rx->reganch & RE_USE_INTUIT) {
922 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
926 if ( (rx->reganch & ROPT_CHECK_ALL)
928 && ((rx->reganch & ROPT_NOSCAN)
929 || !((rx->reganch & RE_INTUIT_TAIL)
930 && (r_flags & REXEC_SCREAM))))
933 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
936 if (pm->op_pmflags & PMf_ONCE)
937 pm->op_pmdynflags |= PMdf_USED;
946 RX_MATCH_TAINTED_on(rx);
947 TAINT_IF(RX_MATCH_TAINTED(rx));
948 if (gimme == G_ARRAY) {
952 if (global && !iters)
956 SPAGAIN; /* EVAL blocks could move the stack. */
957 EXTEND(SP, iters + i);
958 EXTEND_MORTAL(iters + i);
959 for (i = !i; i <= iters; i++) {
960 PUSHs(sv_newmortal());
962 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
963 len = rx->endp[i] - rx->startp[i];
964 s = rx->startp[i] + truebase;
965 sv_setpvn(*SP, s, len);
969 had_zerolen = (rx->startp[0] != -1
970 && rx->startp[0] == rx->endp[0]);
971 PUTBACK; /* EVAL blocks may use stack */
972 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
977 LEAVE_SCOPE(oldsave);
983 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
984 mg = mg_find(TARG, 'g');
986 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
987 mg = mg_find(TARG, 'g');
989 if (rx->startp[0] != -1) {
990 mg->mg_len = rx->endp[0];
991 if (rx->startp[0] == rx->endp[0])
992 mg->mg_flags |= MGf_MINMATCH;
994 mg->mg_flags &= ~MGf_MINMATCH;
997 LEAVE_SCOPE(oldsave);
1001 yup: /* Confirmed by INTUIT */
1003 RX_MATCH_TAINTED_on(rx);
1004 TAINT_IF(RX_MATCH_TAINTED(rx));
1006 if (pm->op_pmflags & PMf_ONCE)
1007 pm->op_pmdynflags |= PMdf_USED;
1008 if (RX_MATCH_COPIED(rx))
1009 Safefree(rx->subbeg);
1010 RX_MATCH_COPIED_off(rx);
1011 rx->subbeg = Nullch;
1013 rx->subbeg = truebase;
1014 rx->startp[0] = s - truebase;
1015 rx->endp[0] = s - truebase + rx->minlen;
1016 rx->sublen = strend - truebase;
1019 if (PL_sawampersand) {
1022 rx->subbeg = savepvn(t, strend - t);
1023 rx->sublen = strend - t;
1024 RX_MATCH_COPIED_on(rx);
1025 off = rx->startp[0] = s - t;
1026 rx->endp[0] = off + rx->minlen;
1028 else { /* startp/endp are used by @- @+. */
1029 rx->startp[0] = s - truebase;
1030 rx->endp[0] = s - truebase + rx->minlen;
1032 LEAVE_SCOPE(oldsave);
1037 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1038 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1039 MAGIC* mg = mg_find(TARG, 'g');
1044 LEAVE_SCOPE(oldsave);
1045 if (gimme == G_ARRAY)
1051 Perl_do_readline(pTHX)
1053 dSP; dTARGETSTACKED;
1058 register IO *io = GvIO(PL_last_in_gv);
1059 register I32 type = PL_op->op_type;
1060 I32 gimme = GIMME_V;
1063 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1065 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1068 call_method("READLINE", gimme);
1071 if (gimme == G_SCALAR)
1072 SvSetMagicSV_nosteal(TARG, TOPs);
1079 if (IoFLAGS(io) & IOf_ARGV) {
1080 if (IoFLAGS(io) & IOf_START) {
1081 IoFLAGS(io) &= ~IOf_START;
1083 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1084 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1085 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1086 SvSETMAGIC(GvSV(PL_last_in_gv));
1091 fp = nextargv(PL_last_in_gv);
1092 if (!fp) { /* Note: fp != IoIFP(io) */
1093 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1094 IoFLAGS(io) |= IOf_START;
1097 else if (type == OP_GLOB) {
1098 SV *tmpcmd = NEWSV(55, 0);
1102 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1103 /* since spawning off a process is a real performance hit */
1105 #include <descrip.h>
1106 #include <lib$routines.h>
1109 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1110 char vmsspec[NAM$C_MAXRSS+1];
1111 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1112 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1113 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1116 struct dsc$descriptor_s wilddsc
1117 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1118 struct dsc$descriptor_vs rsdsc
1119 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1120 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1122 /* We could find out if there's an explicit dev/dir or version
1123 by peeking into lib$find_file's internal context at
1124 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1125 but that's unsupported, so I don't want to do it now and
1126 have it bite someone in the future. */
1127 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1128 cp = SvPV(tmpglob,i);
1130 if (cp[i] == ';') hasver = 1;
1132 if (sts) hasver = 1;
1136 hasdir = isunix = 1;
1139 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1144 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1146 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1147 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1148 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1149 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1150 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1151 &dfltdsc,NULL,NULL,NULL))&1)) {
1152 end = rstr + (unsigned long int) *rslt;
1153 if (!hasver) while (*end != ';') end--;
1154 *(end++) = '\n'; *end = '\0';
1155 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1157 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1162 while (*(--begin) != ']' && *begin != '>') ;
1165 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1167 if (cxt) (void)lib$find_file_end(&cxt);
1168 if (ok && sts != RMS$_NMF &&
1169 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1172 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1174 PerlIO_close(tmpfp);
1178 PerlIO_rewind(tmpfp);
1180 IoIFP(io) = fp = tmpfp;
1181 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1188 sv_setpv(tmpcmd, "for a in ");
1189 sv_catsv(tmpcmd, tmpglob);
1190 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1193 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1194 sv_catsv(tmpcmd, tmpglob);
1196 sv_setpv(tmpcmd, "perlglob ");
1197 sv_catsv(tmpcmd, tmpglob);
1198 sv_catpv(tmpcmd, " |");
1203 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1204 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1205 sv_catsv(tmpcmd, tmpglob);
1206 sv_catpv(tmpcmd, "' 2>/dev/null |");
1208 sv_setpv(tmpcmd, "echo ");
1209 sv_catsv(tmpcmd, tmpglob);
1211 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1213 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1216 #endif /* !DOSISH */
1217 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1218 FALSE, O_RDONLY, 0, Nullfp);
1224 else if (type == OP_GLOB)
1226 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1227 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1228 || fp == PerlIO_stderr()))
1230 SV* sv = sv_newmortal();
1231 gv_efullname3(sv, PL_last_in_gv, Nullch);
1232 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1237 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1238 if (type == OP_GLOB)
1239 Perl_warner(aTHX_ WARN_CLOSED,
1240 "glob failed (can't start child: %s)",
1243 SV* sv = sv_newmortal();
1244 gv_efullname3(sv, PL_last_in_gv, Nullch);
1245 Perl_warner(aTHX_ WARN_CLOSED,
1246 "Read on closed filehandle %s",
1250 if (gimme == G_SCALAR) {
1251 (void)SvOK_off(TARG);
1257 if (gimme == G_SCALAR) {
1261 (void)SvUPGRADE(sv, SVt_PV);
1262 tmplen = SvLEN(sv); /* remember if already alloced */
1264 Sv_Grow(sv, 80); /* try short-buffering it */
1265 if (type == OP_RCATLINE)
1271 sv = sv_2mortal(NEWSV(57, 80));
1275 /* flip-flop EOF state for a snarfed empty file */
1276 #define SNARF_EOF(gimme,rs,io,sv) \
1277 ((gimme != G_SCALAR || SvCUR(sv) \
1278 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1279 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1280 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1283 if (!sv_gets(sv, fp, offset)
1284 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1286 PerlIO_clearerr(fp);
1287 if (IoFLAGS(io) & IOf_ARGV) {
1288 fp = nextargv(PL_last_in_gv);
1291 (void)do_close(PL_last_in_gv, FALSE);
1292 IoFLAGS(io) |= IOf_START;
1294 else if (type == OP_GLOB) {
1295 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1296 Perl_warner(aTHX_ WARN_CLOSED,
1297 "glob failed (child exited with status %d%s)",
1298 STATUS_CURRENT >> 8,
1299 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1302 if (gimme == G_SCALAR) {
1303 (void)SvOK_off(TARG);
1308 /* This should not be marked tainted if the fp is marked clean */
1309 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1316 if (type == OP_GLOB) {
1319 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1320 tmps = SvEND(sv) - 1;
1321 if (*tmps == *SvPVX(PL_rs)) {
1326 for (tmps = SvPVX(sv); *tmps; tmps++)
1327 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1328 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1330 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1331 (void)POPs; /* Unmatched wildcard? Chuck it... */
1335 if (gimme == G_ARRAY) {
1336 if (SvLEN(sv) - SvCUR(sv) > 20) {
1337 SvLEN_set(sv, SvCUR(sv)+1);
1338 Renew(SvPVX(sv), SvLEN(sv), char);
1340 sv = sv_2mortal(NEWSV(58, 80));
1343 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1344 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1348 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1349 Renew(SvPVX(sv), SvLEN(sv), char);
1358 register PERL_CONTEXT *cx;
1359 I32 gimme = OP_GIMME(PL_op, -1);
1362 if (cxstack_ix >= 0)
1363 gimme = cxstack[cxstack_ix].blk_gimme;
1371 PUSHBLOCK(cx, CXt_BLOCK, SP);
1383 U32 lval = PL_op->op_flags & OPf_MOD;
1384 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1387 if (SvTYPE(hv) == SVt_PVHV) {
1388 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1389 svp = he ? &HeVAL(he) : 0;
1391 else if (SvTYPE(hv) == SVt_PVAV) {
1392 if (PL_op->op_private & OPpLVAL_INTRO)
1393 DIE(aTHX_ "Can't localize pseudo-hash element");
1394 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1400 if (!svp || *svp == &PL_sv_undef) {
1405 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1407 lv = sv_newmortal();
1408 sv_upgrade(lv, SVt_PVLV);
1410 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1411 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1412 LvTARG(lv) = SvREFCNT_inc(hv);
1417 if (PL_op->op_private & OPpLVAL_INTRO) {
1418 if (HvNAME(hv) && isGV(*svp))
1419 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1421 save_helem(hv, keysv, svp);
1423 else if (PL_op->op_private & OPpDEREF)
1424 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1426 sv = (svp ? *svp : &PL_sv_undef);
1427 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1428 * Pushing the magical RHS on to the stack is useless, since
1429 * that magic is soon destined to be misled by the local(),
1430 * and thus the later pp_sassign() will fail to mg_get() the
1431 * old value. This should also cure problems with delayed
1432 * mg_get()s. GSAR 98-07-03 */
1433 if (!lval && SvGMAGICAL(sv))
1434 sv = sv_mortalcopy(sv);
1442 register PERL_CONTEXT *cx;
1448 if (PL_op->op_flags & OPf_SPECIAL) {
1449 cx = &cxstack[cxstack_ix];
1450 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1455 gimme = OP_GIMME(PL_op, -1);
1457 if (cxstack_ix >= 0)
1458 gimme = cxstack[cxstack_ix].blk_gimme;
1464 if (gimme == G_VOID)
1466 else if (gimme == G_SCALAR) {
1469 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1472 *MARK = sv_mortalcopy(TOPs);
1475 *MARK = &PL_sv_undef;
1479 else if (gimme == G_ARRAY) {
1480 /* in case LEAVE wipes old return values */
1481 for (mark = newsp + 1; mark <= SP; mark++) {
1482 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1483 *mark = sv_mortalcopy(*mark);
1484 TAINT_NOT; /* Each item is independent */
1488 PL_curpm = newpm; /* Don't pop $1 et al till now */
1498 register PERL_CONTEXT *cx;
1503 cx = &cxstack[cxstack_ix];
1504 if (CxTYPE(cx) != CXt_LOOP)
1505 DIE(aTHX_ "panic: pp_iter");
1507 av = cx->blk_loop.iterary;
1508 if (SvTYPE(av) != SVt_PVAV) {
1509 /* iterate ($min .. $max) */
1510 if (cx->blk_loop.iterlval) {
1511 /* string increment */
1512 register SV* cur = cx->blk_loop.iterlval;
1514 char *max = SvPV((SV*)av, maxlen);
1515 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1516 #ifndef USE_THREADS /* don't risk potential race */
1517 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1518 && !SvMAGICAL(*cx->blk_loop.itervar))
1520 /* safe to reuse old SV */
1521 sv_setsv(*cx->blk_loop.itervar, cur);
1526 /* we need a fresh SV every time so that loop body sees a
1527 * completely new SV for closures/references to work as
1529 SvREFCNT_dec(*cx->blk_loop.itervar);
1530 *cx->blk_loop.itervar = newSVsv(cur);
1532 if (strEQ(SvPVX(cur), max))
1533 sv_setiv(cur, 0); /* terminate next time */
1540 /* integer increment */
1541 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1544 #ifndef USE_THREADS /* don't risk potential race */
1545 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1546 && !SvMAGICAL(*cx->blk_loop.itervar))
1548 /* safe to reuse old SV */
1549 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1554 /* we need a fresh SV every time so that loop body sees a
1555 * completely new SV for closures/references to work as they
1557 SvREFCNT_dec(*cx->blk_loop.itervar);
1558 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1564 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1567 SvREFCNT_dec(*cx->blk_loop.itervar);
1569 if (sv = (SvMAGICAL(av))
1570 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1571 : AvARRAY(av)[++cx->blk_loop.iterix])
1575 if (av != PL_curstack && SvIMMORTAL(sv)) {
1576 SV *lv = cx->blk_loop.iterlval;
1577 if (lv && SvREFCNT(lv) > 1) {
1582 SvREFCNT_dec(LvTARG(lv));
1584 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1585 sv_upgrade(lv, SVt_PVLV);
1587 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1589 LvTARG(lv) = SvREFCNT_inc(av);
1590 LvTARGOFF(lv) = cx->blk_loop.iterix;
1591 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1595 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1602 register PMOP *pm = cPMOP;
1618 register REGEXP *rx = pm->op_pmregexp;
1620 int force_on_match = 0;
1621 I32 oldsave = PL_savestack_ix;
1622 I32 update_minmatch = 1;
1624 /* known replacement string? */
1625 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1626 if (PL_op->op_flags & OPf_STACKED)
1632 if (SvREADONLY(TARG)
1633 || (SvTYPE(TARG) > SVt_PVLV
1634 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1635 Perl_croak(aTHX_ PL_no_modify);
1638 s = SvPV(TARG, len);
1639 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1641 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1642 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1649 DIE(aTHX_ "panic: do_subst");
1652 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1653 position, once with zero-length,
1654 second time with non-zero. */
1656 if (!rx->prelen && PL_curpm) {
1658 rx = pm->op_pmregexp;
1660 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1661 ? REXEC_COPY_STR : 0;
1663 r_flags |= REXEC_SCREAM;
1664 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1665 SAVEINT(PL_multiline);
1666 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1669 if (rx->reganch & RE_USE_INTUIT) {
1670 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1674 /* How to do it in subst? */
1675 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1677 && ((rx->reganch & ROPT_NOSCAN)
1678 || !((rx->reganch & RE_INTUIT_TAIL)
1679 && (r_flags & REXEC_SCREAM))))
1684 /* only replace once? */
1685 once = !(rpm->op_pmflags & PMf_GLOBAL);
1687 /* known replacement string? */
1688 c = dstr ? SvPV(dstr, clen) : Nullch;
1690 /* can do inplace substitution? */
1691 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1692 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1693 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1694 r_flags | REXEC_CHECKED))
1698 LEAVE_SCOPE(oldsave);
1701 if (force_on_match) {
1703 s = SvPV_force(TARG, len);
1708 SvSCREAM_off(TARG); /* disable possible screamer */
1710 rxtainted |= RX_MATCH_TAINTED(rx);
1711 m = orig + rx->startp[0];
1712 d = orig + rx->endp[0];
1714 if (m - s > strend - d) { /* faster to shorten from end */
1716 Copy(c, m, clen, char);
1721 Move(d, m, i, char);
1725 SvCUR_set(TARG, m - s);
1728 else if (i = m - s) { /* faster from front */
1736 Copy(c, m, clen, char);
1741 Copy(c, d, clen, char);
1746 TAINT_IF(rxtainted & 1);
1752 if (iters++ > maxiters)
1753 DIE(aTHX_ "Substitution loop");
1754 rxtainted |= RX_MATCH_TAINTED(rx);
1755 m = rx->startp[0] + orig;
1759 Move(s, d, i, char);
1763 Copy(c, d, clen, char);
1766 s = rx->endp[0] + orig;
1767 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1769 /* don't match same null twice */
1770 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1773 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1774 Move(s, d, i+1, char); /* include the NUL */
1776 TAINT_IF(rxtainted & 1);
1778 PUSHs(sv_2mortal(newSViv((I32)iters)));
1780 (void)SvPOK_only(TARG);
1781 TAINT_IF(rxtainted);
1782 if (SvSMAGICAL(TARG)) {
1788 LEAVE_SCOPE(oldsave);
1792 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1793 r_flags | REXEC_CHECKED))
1795 if (force_on_match) {
1797 s = SvPV_force(TARG, len);
1800 rxtainted |= RX_MATCH_TAINTED(rx);
1801 dstr = NEWSV(25, len);
1802 sv_setpvn(dstr, m, s-m);
1805 register PERL_CONTEXT *cx;
1808 RETURNOP(cPMOP->op_pmreplroot);
1810 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1812 if (iters++ > maxiters)
1813 DIE(aTHX_ "Substitution loop");
1814 rxtainted |= RX_MATCH_TAINTED(rx);
1815 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1820 strend = s + (strend - m);
1822 m = rx->startp[0] + orig;
1823 sv_catpvn(dstr, s, m-s);
1824 s = rx->endp[0] + orig;
1826 sv_catpvn(dstr, c, clen);
1829 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1830 sv_catpvn(dstr, s, strend - s);
1832 (void)SvOOK_off(TARG);
1833 Safefree(SvPVX(TARG));
1834 SvPVX(TARG) = SvPVX(dstr);
1835 SvCUR_set(TARG, SvCUR(dstr));
1836 SvLEN_set(TARG, SvLEN(dstr));
1840 TAINT_IF(rxtainted & 1);
1842 PUSHs(sv_2mortal(newSViv((I32)iters)));
1844 (void)SvPOK_only(TARG);
1845 TAINT_IF(rxtainted);
1848 LEAVE_SCOPE(oldsave);
1857 LEAVE_SCOPE(oldsave);
1866 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1867 ++*PL_markstack_ptr;
1868 LEAVE; /* exit inner scope */
1871 if (PL_stack_base + *PL_markstack_ptr > SP) {
1873 I32 gimme = GIMME_V;
1875 LEAVE; /* exit outer scope */
1876 (void)POPMARK; /* pop src */
1877 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1878 (void)POPMARK; /* pop dst */
1879 SP = PL_stack_base + POPMARK; /* pop original mark */
1880 if (gimme == G_SCALAR) {
1884 else if (gimme == G_ARRAY)
1891 ENTER; /* enter inner scope */
1894 src = PL_stack_base[*PL_markstack_ptr];
1898 RETURNOP(cLOGOP->op_other);
1909 register PERL_CONTEXT *cx;
1910 struct block_sub cxsub;
1913 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1916 if (gimme == G_SCALAR) {
1919 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1921 *MARK = SvREFCNT_inc(TOPs);
1927 *MARK = sv_mortalcopy(TOPs);
1931 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1935 *MARK = &PL_sv_undef;
1939 else if (gimme == G_ARRAY) {
1940 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1941 if (!SvTEMP(*MARK)) {
1942 *MARK = sv_mortalcopy(*MARK);
1943 TAINT_NOT; /* Each item is independent */
1949 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1950 PL_curpm = newpm; /* ... and pop $1 et al */
1953 return pop_return();
1956 /* This duplicates the above code because the above code must not
1957 * get any slower by more conditions */
1965 register PERL_CONTEXT *cx;
1966 struct block_sub cxsub;
1969 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1973 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
1974 /* We are an argument to a function or grep().
1975 * This kind of lvalueness was legal before lvalue
1976 * subroutines too, so be backward compatible:
1977 * cannot report errors. */
1979 /* Scalar context *is* possible, on the LHS of -> only,
1980 * as in f()->meth(). But this is not an lvalue. */
1981 if (gimme == G_SCALAR)
1983 if (gimme == G_ARRAY) {
1984 if (!CvLVALUE(cxsub.cv))
1985 goto temporise_array;
1986 EXTEND_MORTAL(SP - newsp);
1987 for (mark = newsp + 1; mark <= SP; mark++) {
1990 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
1991 *mark = sv_mortalcopy(*mark);
1993 /* Can be a localized value subject to deletion. */
1994 PL_tmps_stack[++PL_tmps_ix] = *mark;
1995 SvREFCNT_inc(*mark);
2000 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2001 /* Here we go for robustness, not for speed, so we change all
2002 * the refcounts so the caller gets a live guy. Cannot set
2003 * TEMP, so sv_2mortal is out of question. */
2004 if (!CvLVALUE(cxsub.cv))
2005 Perl_croak(aTHX_ "Can't modify non-lvalue subroutine call");
2006 if (gimme == G_SCALAR) {
2010 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY))
2011 Perl_croak(aTHX_ "Can't return a %s from lvalue subroutine",
2012 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2013 else { /* Can be a localized value
2014 * subject to deletion. */
2015 PL_tmps_stack[++PL_tmps_ix] = *mark;
2016 SvREFCNT_inc(*mark);
2019 else /* Should not happen? */
2020 Perl_croak(aTHX_ "%s returned from lvalue subroutine in scalar context",
2021 (MARK > SP ? "Empty array" : "Array"));
2024 else if (gimme == G_ARRAY) {
2025 EXTEND_MORTAL(SP - newsp);
2026 for (mark = newsp + 1; mark <= SP; mark++) {
2027 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY))
2028 /* Might be flattened array after $#array = */
2029 Perl_croak(aTHX_ "Can't return %s from lvalue subroutine",
2030 (*mark != &PL_sv_undef)
2032 ? "a readonly value" : "a temporary")
2033 : "an uninitialized value");
2036 /* Can be a localized value subject to deletion. */
2037 PL_tmps_stack[++PL_tmps_ix] = *mark;
2038 SvREFCNT_inc(*mark);
2044 if (gimme == G_SCALAR) {
2048 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
2050 *MARK = SvREFCNT_inc(TOPs);
2056 *MARK = sv_mortalcopy(TOPs);
2060 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2064 *MARK = &PL_sv_undef;
2068 else if (gimme == G_ARRAY) {
2070 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2071 if (!SvTEMP(*MARK)) {
2072 *MARK = sv_mortalcopy(*MARK);
2073 TAINT_NOT; /* Each item is independent */
2080 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
2081 PL_curpm = newpm; /* ... and pop $1 et al */
2084 return pop_return();
2089 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2092 SV *dbsv = GvSV(PL_DBsub);
2094 if (!PERLDB_SUB_NN) {
2098 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2099 || strEQ(GvNAME(gv), "END")
2100 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2101 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2102 && (gv = (GV*)*svp) ))) {
2103 /* Use GV from the stack as a fallback. */
2104 /* GV is potentially non-unique, or contain different CV. */
2105 sv_setsv(dbsv, newRV((SV*)cv));
2108 gv_efullname3(dbsv, gv, Nullch);
2112 SvUPGRADE(dbsv, SVt_PVIV);
2114 SAVEIV(SvIVX(dbsv));
2115 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2119 PL_curcopdb = PL_curcop;
2120 cv = GvCV(PL_DBsub);
2130 register PERL_CONTEXT *cx;
2132 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2135 DIE(aTHX_ "Not a CODE reference");
2136 switch (SvTYPE(sv)) {
2142 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2144 SP = PL_stack_base + POPMARK;
2147 if (SvGMAGICAL(sv)) {
2149 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2152 sym = SvPV(sv, n_a);
2154 DIE(aTHX_ PL_no_usym, "a subroutine");
2155 if (PL_op->op_private & HINT_STRICT_REFS)
2156 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2157 cv = get_cv(sym, TRUE);
2161 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2162 tryAMAGICunDEREF(to_cv);
2165 if (SvTYPE(cv) == SVt_PVCV)
2170 DIE(aTHX_ "Not a CODE reference");
2175 if (!(cv = GvCVu((GV*)sv)))
2176 cv = sv_2cv(sv, &stash, &gv, FALSE);
2189 if (!CvROOT(cv) && !CvXSUB(cv)) {
2193 /* anonymous or undef'd function leaves us no recourse */
2194 if (CvANON(cv) || !(gv = CvGV(cv)))
2195 DIE(aTHX_ "Undefined subroutine called");
2197 /* autoloaded stub? */
2198 if (cv != GvCV(gv)) {
2201 /* should call AUTOLOAD now? */
2204 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2211 sub_name = sv_newmortal();
2212 gv_efullname3(sub_name, gv, Nullch);
2213 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2217 DIE(aTHX_ "Not a CODE reference");
2222 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2223 cv = get_db_sub(&sv, cv);
2225 DIE(aTHX_ "No DBsub routine");
2230 * First we need to check if the sub or method requires locking.
2231 * If so, we gain a lock on the CV, the first argument or the
2232 * stash (for static methods), as appropriate. This has to be
2233 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2234 * reschedule by returning a new op.
2236 MUTEX_LOCK(CvMUTEXP(cv));
2237 if (CvFLAGS(cv) & CVf_LOCKED) {
2239 if (CvFLAGS(cv) & CVf_METHOD) {
2240 if (SP > PL_stack_base + TOPMARK)
2241 sv = *(PL_stack_base + TOPMARK + 1);
2243 AV *av = (AV*)PL_curpad[0];
2244 if (hasargs || !av || AvFILLp(av) < 0
2245 || !(sv = AvARRAY(av)[0]))
2247 MUTEX_UNLOCK(CvMUTEXP(cv));
2248 Perl_croak(aTHX_ "no argument for locked method call");
2255 char *stashname = SvPV(sv, len);
2256 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2262 MUTEX_UNLOCK(CvMUTEXP(cv));
2263 mg = condpair_magic(sv);
2264 MUTEX_LOCK(MgMUTEXP(mg));
2265 if (MgOWNER(mg) == thr)
2266 MUTEX_UNLOCK(MgMUTEXP(mg));
2269 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2271 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2273 MUTEX_UNLOCK(MgMUTEXP(mg));
2274 SAVEDESTRUCTOR(Perl_unlock_condpair, sv);
2276 MUTEX_LOCK(CvMUTEXP(cv));
2279 * Now we have permission to enter the sub, we must distinguish
2280 * four cases. (0) It's an XSUB (in which case we don't care
2281 * about ownership); (1) it's ours already (and we're recursing);
2282 * (2) it's free (but we may already be using a cached clone);
2283 * (3) another thread owns it. Case (1) is easy: we just use it.
2284 * Case (2) means we look for a clone--if we have one, use it
2285 * otherwise grab ownership of cv. Case (3) means we look for a
2286 * clone (for non-XSUBs) and have to create one if we don't
2288 * Why look for a clone in case (2) when we could just grab
2289 * ownership of cv straight away? Well, we could be recursing,
2290 * i.e. we originally tried to enter cv while another thread
2291 * owned it (hence we used a clone) but it has been freed up
2292 * and we're now recursing into it. It may or may not be "better"
2293 * to use the clone but at least CvDEPTH can be trusted.
2295 if (CvOWNER(cv) == thr || CvXSUB(cv))
2296 MUTEX_UNLOCK(CvMUTEXP(cv));
2298 /* Case (2) or (3) */
2302 * XXX Might it be better to release CvMUTEXP(cv) while we
2303 * do the hv_fetch? We might find someone has pinched it
2304 * when we look again, in which case we would be in case
2305 * (3) instead of (2) so we'd have to clone. Would the fact
2306 * that we released the mutex more quickly make up for this?
2308 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2310 /* We already have a clone to use */
2311 MUTEX_UNLOCK(CvMUTEXP(cv));
2313 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2314 "entersub: %p already has clone %p:%s\n",
2315 thr, cv, SvPEEK((SV*)cv)));
2318 if (CvDEPTH(cv) == 0)
2319 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2322 /* (2) => grab ownership of cv. (3) => make clone */
2326 MUTEX_UNLOCK(CvMUTEXP(cv));
2327 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2328 "entersub: %p grabbing %p:%s in stash %s\n",
2329 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2330 HvNAME(CvSTASH(cv)) : "(none)"));
2333 /* Make a new clone. */
2335 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2336 MUTEX_UNLOCK(CvMUTEXP(cv));
2337 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2338 "entersub: %p cloning %p:%s\n",
2339 thr, cv, SvPEEK((SV*)cv))));
2341 * We're creating a new clone so there's no race
2342 * between the original MUTEX_UNLOCK and the
2343 * SvREFCNT_inc since no one will be trying to undef
2344 * it out from underneath us. At least, I don't think
2347 clonecv = cv_clone(cv);
2348 SvREFCNT_dec(cv); /* finished with this */
2349 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2350 CvOWNER(clonecv) = thr;
2354 DEBUG_S(if (CvDEPTH(cv) != 0)
2355 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2357 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2360 #endif /* USE_THREADS */
2363 #ifdef PERL_XSUB_OLDSTYLE
2364 if (CvOLDSTYLE(cv)) {
2365 I32 (*fp3)(int,int,int);
2367 register I32 items = SP - MARK;
2368 /* We dont worry to copy from @_. */
2373 PL_stack_sp = mark + 1;
2374 fp3 = (I32(*)(int,int,int)))CvXSUB(cv;
2375 items = (*fp3)(CvXSUBANY(cv).any_i32,
2376 MARK - PL_stack_base + 1,
2378 PL_stack_sp = PL_stack_base + items;
2381 #endif /* PERL_XSUB_OLDSTYLE */
2383 I32 markix = TOPMARK;
2388 /* Need to copy @_ to stack. Alternative may be to
2389 * switch stack to @_, and copy return values
2390 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2394 av = (AV*)PL_curpad[0];
2396 av = GvAV(PL_defgv);
2397 #endif /* USE_THREADS */
2398 items = AvFILLp(av) + 1; /* @_ is not tieable */
2401 /* Mark is at the end of the stack. */
2403 Copy(AvARRAY(av), SP + 1, items, SV*);
2408 /* We assume first XSUB in &DB::sub is the called one. */
2410 SAVESPTR(PL_curcop);
2411 PL_curcop = PL_curcopdb;
2414 /* Do we need to open block here? XXXX */
2415 (void)(*CvXSUB(cv))(aTHXo_ cv);
2417 /* Enforce some sanity in scalar context. */
2418 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2419 if (markix > PL_stack_sp - PL_stack_base)
2420 *(PL_stack_base + markix) = &PL_sv_undef;
2422 *(PL_stack_base + markix) = *PL_stack_sp;
2423 PL_stack_sp = PL_stack_base + markix;
2431 register I32 items = SP - MARK;
2432 AV* padlist = CvPADLIST(cv);
2433 SV** svp = AvARRAY(padlist);
2434 push_return(PL_op->op_next);
2435 PUSHBLOCK(cx, CXt_SUB, MARK);
2438 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2439 * that eval'' ops within this sub know the correct lexical space.
2440 * Owing the speed considerations, we choose to search for the cv
2441 * in doeval() instead.
2443 if (CvDEPTH(cv) < 2)
2444 (void)SvREFCNT_inc(cv);
2445 else { /* save temporaries on recursion? */
2446 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2448 AV *newpad = newAV();
2449 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2450 I32 ix = AvFILLp((AV*)svp[1]);
2451 svp = AvARRAY(svp[0]);
2452 for ( ;ix > 0; ix--) {
2453 if (svp[ix] != &PL_sv_undef) {
2454 char *name = SvPVX(svp[ix]);
2455 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2456 || *name == '&') /* anonymous code? */
2458 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2460 else { /* our own lexical */
2462 av_store(newpad, ix, sv = (SV*)newAV());
2463 else if (*name == '%')
2464 av_store(newpad, ix, sv = (SV*)newHV());
2466 av_store(newpad, ix, sv = NEWSV(0,0));
2471 av_store(newpad, ix, sv = NEWSV(0,0));
2475 av = newAV(); /* will be @_ */
2477 av_store(newpad, 0, (SV*)av);
2478 AvFLAGS(av) = AVf_REIFY;
2479 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2480 AvFILLp(padlist) = CvDEPTH(cv);
2481 svp = AvARRAY(padlist);
2486 AV* av = (AV*)PL_curpad[0];
2488 items = AvFILLp(av) + 1;
2490 /* Mark is at the end of the stack. */
2492 Copy(AvARRAY(av), SP + 1, items, SV*);
2497 #endif /* USE_THREADS */
2498 SAVESPTR(PL_curpad);
2499 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2502 #endif /* USE_THREADS */
2508 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2509 "%p entersub preparing @_\n", thr));
2511 av = (AV*)PL_curpad[0];
2518 cx->blk_sub.savearray = GvAV(PL_defgv);
2519 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2520 #endif /* USE_THREADS */
2521 cx->blk_sub.argarray = av;
2524 if (items > AvMAX(av) + 1) {
2526 if (AvARRAY(av) != ary) {
2527 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2528 SvPVX(av) = (char*)ary;
2530 if (items > AvMAX(av) + 1) {
2531 AvMAX(av) = items - 1;
2532 Renew(ary,items,SV*);
2534 SvPVX(av) = (char*)ary;
2537 Copy(MARK,AvARRAY(av),items,SV*);
2538 AvFILLp(av) = items - 1;
2546 /* warning must come *after* we fully set up the context
2547 * stuff so that __WARN__ handlers can safely dounwind()
2550 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2551 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2552 sub_crush_depth(cv);
2554 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2555 "%p entersub returning %p\n", thr, CvSTART(cv)));
2557 RETURNOP(CvSTART(cv));
2562 Perl_sub_crush_depth(pTHX_ CV *cv)
2565 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2567 SV* tmpstr = sv_newmortal();
2568 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2569 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2580 U32 lval = PL_op->op_flags & OPf_MOD;
2581 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2585 elem -= PL_curcop->cop_arybase;
2586 if (SvTYPE(av) != SVt_PVAV)
2588 svp = av_fetch(av, elem, lval && !defer);
2590 if (!svp || *svp == &PL_sv_undef) {
2593 DIE(aTHX_ PL_no_aelem, elem);
2594 lv = sv_newmortal();
2595 sv_upgrade(lv, SVt_PVLV);
2597 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2598 LvTARG(lv) = SvREFCNT_inc(av);
2599 LvTARGOFF(lv) = elem;
2604 if (PL_op->op_private & OPpLVAL_INTRO)
2605 save_aelem(av, elem, svp);
2606 else if (PL_op->op_private & OPpDEREF)
2607 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2609 sv = (svp ? *svp : &PL_sv_undef);
2610 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2611 sv = sv_mortalcopy(sv);
2617 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2623 Perl_croak(aTHX_ PL_no_modify);
2624 if (SvTYPE(sv) < SVt_RV)
2625 sv_upgrade(sv, SVt_RV);
2626 else if (SvTYPE(sv) >= SVt_PV) {
2627 (void)SvOOK_off(sv);
2628 Safefree(SvPVX(sv));
2629 SvLEN(sv) = SvCUR(sv) = 0;
2633 SvRV(sv) = NEWSV(355,0);
2636 SvRV(sv) = (SV*)newAV();
2639 SvRV(sv) = (SV*)newHV();
2654 if (SvTYPE(rsv) == SVt_PVCV) {
2660 SETs(method_common(sv, Null(U32*)));
2667 SV* sv = cSVOP->op_sv;
2668 U32 hash = SvUVX(sv);
2670 XPUSHs(method_common(sv, &hash));
2675 S_method_common(pTHX_ SV* meth, U32* hashp)
2687 name = SvPV(meth, namelen);
2688 sv = *(PL_stack_base + TOPMARK + 1);
2699 !(packname = SvPV(sv, packlen)) ||
2700 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2701 !(ob=(SV*)GvIO(iogv)))
2704 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2705 ? !isIDFIRST_utf8((U8*)packname)
2706 : !isIDFIRST(*packname)
2709 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2710 SvOK(sv) ? "without a package or object reference"
2711 : "on an undefined value");
2713 stash = gv_stashpvn(packname, packlen, TRUE);
2716 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2719 if (!ob || !SvOBJECT(ob))
2720 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2723 stash = SvSTASH(ob);
2726 /* shortcut for simple names */
2728 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2730 gv = (GV*)HeVAL(he);
2731 if (isGV(gv) && GvCV(gv) &&
2732 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2733 return (SV*)GvCV(gv);
2737 gv = gv_fetchmethod(stash, name);
2743 for (p = name; *p; p++) {
2745 sep = p, leaf = p + 1;
2746 else if (*p == ':' && *(p + 1) == ':')
2747 sep = p, leaf = p + 2;
2749 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2750 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2751 packlen = strlen(packname);
2755 packlen = sep - name;
2758 "Can't locate object method \"%s\" via package \"%s\"",
2761 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2766 unset_cvowner(pTHXo_ void *cvarg)
2768 register CV* cv = (CV *) cvarg;
2771 #endif /* DEBUGGING */
2773 DEBUG_S((PerlIO_printf(PerlIO_stderr(), "%p unsetting CvOWNER of %p:%s\n",
2774 thr, cv, SvPEEK((SV*)cv))));
2775 MUTEX_LOCK(CvMUTEXP(cv));
2776 DEBUG_S(if (CvDEPTH(cv) != 0)
2777 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2779 assert(thr == CvOWNER(cv));
2781 MUTEX_UNLOCK(CvMUTEXP(cv));
2784 #endif /* USE_THREADS */