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));
74 PL_curcop = (COP*)PL_op;
80 PUSHMARK(PL_stack_sp);
90 sv_setpvn(TARG,s,len);
109 RETURNOP(cLOGOP->op_other);
118 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
120 temp = left; left = right; right = temp;
122 if (PL_tainting && PL_tainted && !SvTAINTED(left))
124 SvSetMagicSV(right, left);
133 RETURNOP(cLOGOP->op_other);
135 RETURNOP(cLOGOP->op_next);
141 TAINT_NOT; /* Each statement is presumed innocent */
142 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
144 oldsave = PL_scopestack[PL_scopestack_ix - 1];
145 LEAVE_SCOPE(oldsave);
151 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
158 sv_setpvn(TARG,s,len);
160 else if (SvGMAGICAL(TARG))
162 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
163 sv_setpv(TARG, ""); /* Suppress warning. */
164 s = SvPV_force(TARG, len);
168 #if defined(PERL_Y2KWARN)
169 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_MISC)) {
171 char *s = SvPV(TARG,n);
172 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
173 && (n == 2 || !isDIGIT(s[n-3])))
175 Perl_warner(aTHX_ WARN_MISC, "Possible Y2K bug: %s",
176 "about to append an integer to '19'");
180 sv_catpvn(TARG,s,len);
183 sv_setpvn(TARG,s,len); /* suppress warning */
193 if (PL_op->op_flags & OPf_MOD) {
194 if (PL_op->op_private & OPpLVAL_INTRO)
195 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
196 else if (PL_op->op_private & OPpDEREF) {
198 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
207 tryAMAGICunTARGET(iter, 0);
208 PL_last_in_gv = (GV*)(*PL_stack_sp--);
209 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
210 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
211 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
214 XPUSHs((SV*)PL_last_in_gv);
217 PL_last_in_gv = (GV*)(*PL_stack_sp--);
220 return do_readline();
225 djSP; tryAMAGICbinSET(eq,0);
228 SETs(boolSV(TOPn == value));
236 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
237 DIE(aTHX_ PL_no_modify);
238 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
239 SvIVX(TOPs) != IV_MAX)
242 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
257 RETURNOP(cLOGOP->op_other);
263 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
266 SETn( left + right );
274 AV *av = GvAV(cGVOP);
275 U32 lval = PL_op->op_flags & OPf_MOD;
276 SV** svp = av_fetch(av, PL_op->op_private, lval);
277 SV *sv = (svp ? *svp : &PL_sv_undef);
279 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
280 sv = sv_mortalcopy(sv);
287 djSP; dMARK; dTARGET;
289 do_join(TARG, *MARK, MARK, SP);
300 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
301 * will be enough to hold an OP*.
303 SV* sv = sv_newmortal();
304 sv_upgrade(sv, SVt_PVLV);
306 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
314 /* Oversized hot code. */
318 djSP; dMARK; dORIGMARK;
325 if (PL_op->op_flags & OPf_STACKED)
329 if (mg = SvTIED_mg((SV*)gv, 'q')) {
330 if (MARK == ORIGMARK) {
331 /* If using default handle then we need to make space to
332 * pass object as 1st arg, so move other args up ...
336 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
340 *MARK = SvTIED_obj((SV*)gv, mg);
343 call_method("PRINT", G_SCALAR);
351 if (!(io = GvIO(gv))) {
352 if (ckWARN(WARN_UNOPENED)) {
353 SV* sv = sv_newmortal();
354 gv_efullname3(sv, gv, Nullch);
355 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
358 SETERRNO(EBADF,RMS$_IFI);
361 else if (!(fp = IoOFP(io))) {
362 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
363 SV* sv = sv_newmortal();
364 gv_efullname3(sv, gv, Nullch);
366 Perl_warner(aTHX_ WARN_IO,
367 "Filehandle %s opened only for input",
369 else if (ckWARN(WARN_CLOSED))
370 Perl_warner(aTHX_ WARN_CLOSED,
371 "print on closed filehandle %s", SvPV(sv,n_a));
373 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
380 if (!do_print(*MARK, fp))
384 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
393 if (!do_print(*MARK, fp))
402 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
405 if (IoFLAGS(io) & IOf_FLUSH)
406 if (PerlIO_flush(fp) == EOF)
427 tryAMAGICunDEREF(to_av);
430 if (SvTYPE(av) != SVt_PVAV)
431 DIE(aTHX_ "Not an ARRAY reference");
432 if (PL_op->op_flags & OPf_REF) {
438 if (SvTYPE(sv) == SVt_PVAV) {
440 if (PL_op->op_flags & OPf_REF) {
448 if (SvTYPE(sv) != SVt_PVGV) {
452 if (SvGMAGICAL(sv)) {
458 if (PL_op->op_flags & OPf_REF ||
459 PL_op->op_private & HINT_STRICT_REFS)
460 DIE(aTHX_ PL_no_usym, "an ARRAY");
461 if (ckWARN(WARN_UNINITIALIZED))
462 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
463 if (GIMME == G_ARRAY) {
470 if ((PL_op->op_flags & OPf_SPECIAL) &&
471 !(PL_op->op_flags & OPf_MOD))
473 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
478 if (PL_op->op_private & HINT_STRICT_REFS)
479 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
480 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
487 if (PL_op->op_private & OPpLVAL_INTRO)
489 if (PL_op->op_flags & OPf_REF) {
496 if (GIMME == G_ARRAY) {
497 I32 maxarg = AvFILL(av) + 1;
498 (void)POPs; /* XXXX May be optimized away? */
500 if (SvRMAGICAL(av)) {
502 for (i=0; i < maxarg; i++) {
503 SV **svp = av_fetch(av, i, FALSE);
504 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
508 Copy(AvARRAY(av), SP+1, maxarg, SV*);
514 I32 maxarg = AvFILL(av) + 1;
527 tryAMAGICunDEREF(to_hv);
530 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
531 DIE(aTHX_ "Not a HASH reference");
532 if (PL_op->op_flags & OPf_REF) {
538 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
540 if (PL_op->op_flags & OPf_REF) {
548 if (SvTYPE(sv) != SVt_PVGV) {
552 if (SvGMAGICAL(sv)) {
558 if (PL_op->op_flags & OPf_REF ||
559 PL_op->op_private & HINT_STRICT_REFS)
560 DIE(aTHX_ PL_no_usym, "a HASH");
561 if (ckWARN(WARN_UNINITIALIZED))
562 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
563 if (GIMME == G_ARRAY) {
570 if ((PL_op->op_flags & OPf_SPECIAL) &&
571 !(PL_op->op_flags & OPf_MOD))
573 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
578 if (PL_op->op_private & HINT_STRICT_REFS)
579 DIE(aTHX_ PL_no_symref, sym, "a HASH");
580 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
587 if (PL_op->op_private & OPpLVAL_INTRO)
589 if (PL_op->op_flags & OPf_REF) {
596 if (GIMME == G_ARRAY) { /* array wanted */
597 *PL_stack_sp = (SV*)hv;
602 if (SvTYPE(hv) == SVt_PVAV)
603 hv = avhv_keys((AV*)hv);
605 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
606 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
618 SV **lastlelem = PL_stack_sp;
619 SV **lastrelem = PL_stack_base + POPMARK;
620 SV **firstrelem = PL_stack_base + POPMARK + 1;
621 SV **firstlelem = lastrelem + 1;
634 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
636 /* If there's a common identifier on both sides we have to take
637 * special care that assigning the identifier on the left doesn't
638 * clobber a value on the right that's used later in the list.
640 if (PL_op->op_private & OPpASSIGN_COMMON) {
641 EXTEND_MORTAL(lastrelem - firstrelem + 1);
642 for (relem = firstrelem; relem <= lastrelem; relem++) {
645 TAINT_NOT; /* Each item is independent */
646 *relem = sv_mortalcopy(sv);
655 while (lelem <= lastlelem) {
656 TAINT_NOT; /* Each item stands on its own, taintwise. */
658 switch (SvTYPE(sv)) {
661 magic = SvMAGICAL(ary) != 0;
664 av_extend(ary, lastrelem - relem);
666 while (relem <= lastrelem) { /* gobble up all the rest */
672 didstore = av_store(ary,i++,sv);
686 magic = SvMAGICAL(hash) != 0;
689 while (relem < lastrelem) { /* gobble up all the rest */
694 sv = &PL_sv_no, relem++;
695 tmpstr = NEWSV(29,0);
697 sv_setsv(tmpstr,*relem); /* value */
699 didstore = hv_store_ent(hash,sv,tmpstr,0);
701 if (SvSMAGICAL(tmpstr))
708 if (relem == lastrelem) {
711 if (ckWARN(WARN_UNSAFE)) {
712 if (relem == firstrelem &&
714 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
715 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
716 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
718 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
720 tmpstr = NEWSV(29,0);
721 didstore = hv_store_ent(hash,*relem,tmpstr,0);
723 if (SvSMAGICAL(tmpstr))
735 if (SvIMMORTAL(sv)) {
736 if (relem <= lastrelem)
740 if (relem <= lastrelem) {
741 sv_setsv(sv, *relem);
745 sv_setsv(sv, &PL_sv_undef);
750 if (PL_delaymagic & ~DM_DELAY) {
751 if (PL_delaymagic & DM_UID) {
753 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
756 (void)setreuid(PL_uid,PL_euid);
759 if ((PL_delaymagic & DM_UID) == DM_RUID) {
760 (void)setruid(PL_uid);
761 PL_delaymagic &= ~DM_RUID;
763 # endif /* HAS_SETRUID */
765 if ((PL_delaymagic & DM_UID) == DM_EUID) {
766 (void)seteuid(PL_uid);
767 PL_delaymagic &= ~DM_EUID;
769 # endif /* HAS_SETEUID */
770 if (PL_delaymagic & DM_UID) {
771 if (PL_uid != PL_euid)
772 DIE(aTHX_ "No setreuid available");
773 (void)PerlProc_setuid(PL_uid);
775 # endif /* HAS_SETREUID */
776 #endif /* HAS_SETRESUID */
777 PL_uid = PerlProc_getuid();
778 PL_euid = PerlProc_geteuid();
780 if (PL_delaymagic & DM_GID) {
782 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
785 (void)setregid(PL_gid,PL_egid);
788 if ((PL_delaymagic & DM_GID) == DM_RGID) {
789 (void)setrgid(PL_gid);
790 PL_delaymagic &= ~DM_RGID;
792 # endif /* HAS_SETRGID */
794 if ((PL_delaymagic & DM_GID) == DM_EGID) {
795 (void)setegid(PL_gid);
796 PL_delaymagic &= ~DM_EGID;
798 # endif /* HAS_SETEGID */
799 if (PL_delaymagic & DM_GID) {
800 if (PL_gid != PL_egid)
801 DIE(aTHX_ "No setregid available");
802 (void)PerlProc_setgid(PL_gid);
804 # endif /* HAS_SETREGID */
805 #endif /* HAS_SETRESGID */
806 PL_gid = PerlProc_getgid();
807 PL_egid = PerlProc_getegid();
809 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
816 else if (gimme == G_SCALAR) {
819 SETi(lastrelem - firstrelem + 1);
825 SP = firstrelem + (lastlelem - firstlelem);
826 lelem = firstlelem + (relem - firstrelem);
828 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
836 register PMOP *pm = cPMOP;
837 SV *rv = sv_newmortal();
838 SV *sv = newSVrv(rv, "Regexp");
839 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
846 register PMOP *pm = cPMOP;
851 I32 r_flags = REXEC_CHECKED;
852 char *truebase; /* Start of string */
853 register REGEXP *rx = pm->op_pmregexp;
858 I32 oldsave = PL_savestack_ix;
859 I32 update_minmatch = 1;
862 if (PL_op->op_flags & OPf_STACKED)
868 PUTBACK; /* EVAL blocks need stack_sp. */
872 DIE(aTHX_ "panic: do_match");
873 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
874 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
877 if (pm->op_pmdynflags & PMdf_USED) {
879 if (gimme == G_ARRAY)
884 if (!rx->prelen && PL_curpm) {
886 rx = pm->op_pmregexp;
888 if (rx->minlen > len) goto failure;
892 /* XXXX What part of this is needed with true \G-support? */
893 if (global = pm->op_pmflags & PMf_GLOBAL) {
895 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
896 MAGIC* mg = mg_find(TARG, 'g');
897 if (mg && mg->mg_len >= 0) {
898 if (!(rx->reganch & ROPT_GPOS_SEEN))
899 rx->endp[0] = rx->startp[0] = mg->mg_len;
900 else if (rx->reganch & ROPT_ANCH_GPOS) {
901 r_flags |= REXEC_IGNOREPOS;
902 rx->endp[0] = rx->startp[0] = mg->mg_len;
904 minmatch = (mg->mg_flags & MGf_MINMATCH);
909 if ((gimme != G_ARRAY && !global && rx->nparens)
910 || SvTEMP(TARG) || PL_sawampersand)
911 r_flags |= REXEC_COPY_STR;
913 r_flags |= REXEC_SCREAM;
915 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
916 SAVEINT(PL_multiline);
917 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
921 if (global && rx->startp[0] != -1) {
922 t = s = rx->endp[0] + truebase;
923 if ((s + rx->minlen) > strend)
925 if (update_minmatch++)
926 minmatch = had_zerolen;
928 if (rx->reganch & RE_USE_INTUIT) {
929 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
933 if ( (rx->reganch & ROPT_CHECK_ALL)
935 && ((rx->reganch & ROPT_NOSCAN)
936 || !((rx->reganch & RE_INTUIT_TAIL)
937 && (r_flags & REXEC_SCREAM))))
940 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
943 if (pm->op_pmflags & PMf_ONCE)
944 pm->op_pmdynflags |= PMdf_USED;
953 RX_MATCH_TAINTED_on(rx);
954 TAINT_IF(RX_MATCH_TAINTED(rx));
955 if (gimme == G_ARRAY) {
959 if (global && !iters)
963 SPAGAIN; /* EVAL blocks could move the stack. */
964 EXTEND(SP, iters + i);
965 EXTEND_MORTAL(iters + i);
966 for (i = !i; i <= iters; i++) {
967 PUSHs(sv_newmortal());
969 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
970 len = rx->endp[i] - rx->startp[i];
971 s = rx->startp[i] + truebase;
972 sv_setpvn(*SP, s, len);
976 had_zerolen = (rx->startp[0] != -1
977 && rx->startp[0] == rx->endp[0]);
978 PUTBACK; /* EVAL blocks may use stack */
979 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
984 LEAVE_SCOPE(oldsave);
990 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
991 mg = mg_find(TARG, 'g');
993 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
994 mg = mg_find(TARG, 'g');
996 if (rx->startp[0] != -1) {
997 mg->mg_len = rx->endp[0];
998 if (rx->startp[0] == rx->endp[0])
999 mg->mg_flags |= MGf_MINMATCH;
1001 mg->mg_flags &= ~MGf_MINMATCH;
1004 LEAVE_SCOPE(oldsave);
1008 yup: /* Confirmed by INTUIT */
1010 RX_MATCH_TAINTED_on(rx);
1011 TAINT_IF(RX_MATCH_TAINTED(rx));
1013 if (pm->op_pmflags & PMf_ONCE)
1014 pm->op_pmdynflags |= PMdf_USED;
1015 if (RX_MATCH_COPIED(rx))
1016 Safefree(rx->subbeg);
1017 RX_MATCH_COPIED_off(rx);
1018 rx->subbeg = Nullch;
1020 rx->subbeg = truebase;
1021 rx->startp[0] = s - truebase;
1022 rx->endp[0] = s - truebase + rx->minlen;
1023 rx->sublen = strend - truebase;
1026 if (PL_sawampersand) {
1029 rx->subbeg = savepvn(t, strend - t);
1030 rx->sublen = strend - t;
1031 RX_MATCH_COPIED_on(rx);
1032 off = rx->startp[0] = s - t;
1033 rx->endp[0] = off + rx->minlen;
1035 else { /* startp/endp are used by @- @+. */
1036 rx->startp[0] = s - truebase;
1037 rx->endp[0] = s - truebase + rx->minlen;
1039 LEAVE_SCOPE(oldsave);
1044 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1045 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1046 MAGIC* mg = mg_find(TARG, 'g');
1051 LEAVE_SCOPE(oldsave);
1052 if (gimme == G_ARRAY)
1058 Perl_do_readline(pTHX)
1060 dSP; dTARGETSTACKED;
1065 register IO *io = GvIO(PL_last_in_gv);
1066 register I32 type = PL_op->op_type;
1067 I32 gimme = GIMME_V;
1070 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1072 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1075 call_method("READLINE", gimme);
1078 if (gimme == G_SCALAR)
1079 SvSetMagicSV_nosteal(TARG, TOPs);
1086 if (IoFLAGS(io) & IOf_ARGV) {
1087 if (IoFLAGS(io) & IOf_START) {
1089 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1090 IoFLAGS(io) &= ~IOf_START;
1091 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1092 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1093 SvSETMAGIC(GvSV(PL_last_in_gv));
1098 fp = nextargv(PL_last_in_gv);
1099 if (!fp) { /* Note: fp != IoIFP(io) */
1100 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1103 else if (type == OP_GLOB) {
1104 SV *tmpcmd = NEWSV(55, 0);
1108 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1109 /* since spawning off a process is a real performance hit */
1111 #include <descrip.h>
1112 #include <lib$routines.h>
1115 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1116 char vmsspec[NAM$C_MAXRSS+1];
1117 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1118 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1119 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1122 struct dsc$descriptor_s wilddsc
1123 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1124 struct dsc$descriptor_vs rsdsc
1125 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1126 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1128 /* We could find out if there's an explicit dev/dir or version
1129 by peeking into lib$find_file's internal context at
1130 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1131 but that's unsupported, so I don't want to do it now and
1132 have it bite someone in the future. */
1133 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1134 cp = SvPV(tmpglob,i);
1136 if (cp[i] == ';') hasver = 1;
1138 if (sts) hasver = 1;
1142 hasdir = isunix = 1;
1145 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1150 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1152 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1153 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1154 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1155 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1156 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1157 &dfltdsc,NULL,NULL,NULL))&1)) {
1158 end = rstr + (unsigned long int) *rslt;
1159 if (!hasver) while (*end != ';') end--;
1160 *(end++) = '\n'; *end = '\0';
1161 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1163 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1168 while (*(--begin) != ']' && *begin != '>') ;
1171 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1173 if (cxt) (void)lib$find_file_end(&cxt);
1174 if (ok && sts != RMS$_NMF &&
1175 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1178 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1180 PerlIO_close(tmpfp);
1184 PerlIO_rewind(tmpfp);
1186 IoIFP(io) = fp = tmpfp;
1187 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1194 sv_setpv(tmpcmd, "for a in ");
1195 sv_catsv(tmpcmd, tmpglob);
1196 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1199 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1200 sv_catsv(tmpcmd, tmpglob);
1202 sv_setpv(tmpcmd, "perlglob ");
1203 sv_catsv(tmpcmd, tmpglob);
1204 sv_catpv(tmpcmd, " |");
1209 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1210 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1211 sv_catsv(tmpcmd, tmpglob);
1212 sv_catpv(tmpcmd, "' 2>/dev/null |");
1214 sv_setpv(tmpcmd, "echo ");
1215 sv_catsv(tmpcmd, tmpglob);
1217 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1219 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1222 #endif /* !DOSISH */
1223 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1224 FALSE, O_RDONLY, 0, Nullfp);
1230 else if (type == OP_GLOB)
1232 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1233 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1234 || fp == PerlIO_stderr()))
1236 SV* sv = sv_newmortal();
1237 gv_efullname3(sv, PL_last_in_gv, Nullch);
1238 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1243 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1244 if (type == OP_GLOB)
1245 Perl_warner(aTHX_ WARN_CLOSED,
1246 "glob failed (can't start child: %s)",
1249 SV* sv = sv_newmortal();
1250 gv_efullname3(sv, PL_last_in_gv, Nullch);
1251 Perl_warner(aTHX_ WARN_CLOSED,
1252 "Read on closed filehandle %s",
1256 if (gimme == G_SCALAR) {
1257 (void)SvOK_off(TARG);
1263 if (gimme == G_SCALAR) {
1267 (void)SvUPGRADE(sv, SVt_PV);
1268 tmplen = SvLEN(sv); /* remember if already alloced */
1270 Sv_Grow(sv, 80); /* try short-buffering it */
1271 if (type == OP_RCATLINE)
1277 sv = sv_2mortal(NEWSV(57, 80));
1281 /* flip-flop EOF state for a snarfed empty file */
1282 #define SNARF_EOF(gimme,rs,io,sv) \
1283 ((gimme != G_SCALAR || SvCUR(sv) \
1284 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1285 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1286 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1289 if (!sv_gets(sv, fp, offset)
1290 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1292 PerlIO_clearerr(fp);
1293 if (IoFLAGS(io) & IOf_ARGV) {
1294 fp = nextargv(PL_last_in_gv);
1297 (void)do_close(PL_last_in_gv, FALSE);
1299 else if (type == OP_GLOB) {
1300 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1301 Perl_warner(aTHX_ WARN_CLOSED,
1302 "glob failed (child exited with status %d%s)",
1303 STATUS_CURRENT >> 8,
1304 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1307 if (gimme == G_SCALAR) {
1308 (void)SvOK_off(TARG);
1313 /* This should not be marked tainted if the fp is marked clean */
1314 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1321 if (type == OP_GLOB) {
1324 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1325 tmps = SvEND(sv) - 1;
1326 if (*tmps == *SvPVX(PL_rs)) {
1331 for (tmps = SvPVX(sv); *tmps; tmps++)
1332 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1333 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1335 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1336 (void)POPs; /* Unmatched wildcard? Chuck it... */
1340 if (gimme == G_ARRAY) {
1341 if (SvLEN(sv) - SvCUR(sv) > 20) {
1342 SvLEN_set(sv, SvCUR(sv)+1);
1343 Renew(SvPVX(sv), SvLEN(sv), char);
1345 sv = sv_2mortal(NEWSV(58, 80));
1348 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1349 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1353 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1354 Renew(SvPVX(sv), SvLEN(sv), char);
1363 register PERL_CONTEXT *cx;
1364 I32 gimme = OP_GIMME(PL_op, -1);
1367 if (cxstack_ix >= 0)
1368 gimme = cxstack[cxstack_ix].blk_gimme;
1376 PUSHBLOCK(cx, CXt_BLOCK, SP);
1388 U32 lval = PL_op->op_flags & OPf_MOD;
1389 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1392 if (SvTYPE(hv) == SVt_PVHV) {
1393 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1394 svp = he ? &HeVAL(he) : 0;
1396 else if (SvTYPE(hv) == SVt_PVAV) {
1397 if (PL_op->op_private & OPpLVAL_INTRO)
1398 DIE(aTHX_ "Can't localize pseudo-hash element");
1399 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1405 if (!svp || *svp == &PL_sv_undef) {
1410 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1412 lv = sv_newmortal();
1413 sv_upgrade(lv, SVt_PVLV);
1415 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1416 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1417 LvTARG(lv) = SvREFCNT_inc(hv);
1422 if (PL_op->op_private & OPpLVAL_INTRO) {
1423 if (HvNAME(hv) && isGV(*svp))
1424 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1426 save_helem(hv, keysv, svp);
1428 else if (PL_op->op_private & OPpDEREF)
1429 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1431 sv = (svp ? *svp : &PL_sv_undef);
1432 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1433 * Pushing the magical RHS on to the stack is useless, since
1434 * that magic is soon destined to be misled by the local(),
1435 * and thus the later pp_sassign() will fail to mg_get() the
1436 * old value. This should also cure problems with delayed
1437 * mg_get()s. GSAR 98-07-03 */
1438 if (!lval && SvGMAGICAL(sv))
1439 sv = sv_mortalcopy(sv);
1447 register PERL_CONTEXT *cx;
1453 if (PL_op->op_flags & OPf_SPECIAL) {
1454 cx = &cxstack[cxstack_ix];
1455 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1460 gimme = OP_GIMME(PL_op, -1);
1462 if (cxstack_ix >= 0)
1463 gimme = cxstack[cxstack_ix].blk_gimme;
1469 if (gimme == G_VOID)
1471 else if (gimme == G_SCALAR) {
1474 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1477 *MARK = sv_mortalcopy(TOPs);
1480 *MARK = &PL_sv_undef;
1484 else if (gimme == G_ARRAY) {
1485 /* in case LEAVE wipes old return values */
1486 for (mark = newsp + 1; mark <= SP; mark++) {
1487 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1488 *mark = sv_mortalcopy(*mark);
1489 TAINT_NOT; /* Each item is independent */
1493 PL_curpm = newpm; /* Don't pop $1 et al till now */
1503 register PERL_CONTEXT *cx;
1508 cx = &cxstack[cxstack_ix];
1509 if (CxTYPE(cx) != CXt_LOOP)
1510 DIE(aTHX_ "panic: pp_iter");
1512 av = cx->blk_loop.iterary;
1513 if (SvTYPE(av) != SVt_PVAV) {
1514 /* iterate ($min .. $max) */
1515 if (cx->blk_loop.iterlval) {
1516 /* string increment */
1517 register SV* cur = cx->blk_loop.iterlval;
1519 char *max = SvPV((SV*)av, maxlen);
1520 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1521 #ifndef USE_THREADS /* don't risk potential race */
1522 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1523 && !SvMAGICAL(*cx->blk_loop.itervar))
1525 /* safe to reuse old SV */
1526 sv_setsv(*cx->blk_loop.itervar, cur);
1531 /* we need a fresh SV every time so that loop body sees a
1532 * completely new SV for closures/references to work as
1534 SvREFCNT_dec(*cx->blk_loop.itervar);
1535 *cx->blk_loop.itervar = newSVsv(cur);
1537 if (strEQ(SvPVX(cur), max))
1538 sv_setiv(cur, 0); /* terminate next time */
1545 /* integer increment */
1546 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1549 #ifndef USE_THREADS /* don't risk potential race */
1550 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1551 && !SvMAGICAL(*cx->blk_loop.itervar))
1553 /* safe to reuse old SV */
1554 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1559 /* we need a fresh SV every time so that loop body sees a
1560 * completely new SV for closures/references to work as they
1562 SvREFCNT_dec(*cx->blk_loop.itervar);
1563 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1569 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1572 SvREFCNT_dec(*cx->blk_loop.itervar);
1574 if (sv = (SvMAGICAL(av))
1575 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1576 : AvARRAY(av)[++cx->blk_loop.iterix])
1580 if (av != PL_curstack && SvIMMORTAL(sv)) {
1581 SV *lv = cx->blk_loop.iterlval;
1582 if (lv && SvREFCNT(lv) > 1) {
1587 SvREFCNT_dec(LvTARG(lv));
1589 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1590 sv_upgrade(lv, SVt_PVLV);
1592 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1594 LvTARG(lv) = SvREFCNT_inc(av);
1595 LvTARGOFF(lv) = cx->blk_loop.iterix;
1596 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1600 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1607 register PMOP *pm = cPMOP;
1623 register REGEXP *rx = pm->op_pmregexp;
1625 int force_on_match = 0;
1626 I32 oldsave = PL_savestack_ix;
1627 I32 update_minmatch = 1;
1629 /* known replacement string? */
1630 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1631 if (PL_op->op_flags & OPf_STACKED)
1637 if (SvREADONLY(TARG)
1638 || (SvTYPE(TARG) > SVt_PVLV
1639 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1640 DIE(aTHX_ PL_no_modify);
1643 s = SvPV(TARG, len);
1644 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1646 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1647 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1654 DIE(aTHX_ "panic: do_subst");
1657 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1658 position, once with zero-length,
1659 second time with non-zero. */
1661 if (!rx->prelen && PL_curpm) {
1663 rx = pm->op_pmregexp;
1665 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1666 ? REXEC_COPY_STR : 0;
1668 r_flags |= REXEC_SCREAM;
1669 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1670 SAVEINT(PL_multiline);
1671 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1674 if (rx->reganch & RE_USE_INTUIT) {
1675 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1679 /* How to do it in subst? */
1680 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1682 && ((rx->reganch & ROPT_NOSCAN)
1683 || !((rx->reganch & RE_INTUIT_TAIL)
1684 && (r_flags & REXEC_SCREAM))))
1689 /* only replace once? */
1690 once = !(rpm->op_pmflags & PMf_GLOBAL);
1692 /* known replacement string? */
1693 c = dstr ? SvPV(dstr, clen) : Nullch;
1695 /* can do inplace substitution? */
1696 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1697 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1698 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1699 r_flags | REXEC_CHECKED))
1703 LEAVE_SCOPE(oldsave);
1706 if (force_on_match) {
1708 s = SvPV_force(TARG, len);
1713 SvSCREAM_off(TARG); /* disable possible screamer */
1715 rxtainted |= RX_MATCH_TAINTED(rx);
1716 m = orig + rx->startp[0];
1717 d = orig + rx->endp[0];
1719 if (m - s > strend - d) { /* faster to shorten from end */
1721 Copy(c, m, clen, char);
1726 Move(d, m, i, char);
1730 SvCUR_set(TARG, m - s);
1733 else if (i = m - s) { /* faster from front */
1741 Copy(c, m, clen, char);
1746 Copy(c, d, clen, char);
1751 TAINT_IF(rxtainted & 1);
1757 if (iters++ > maxiters)
1758 DIE(aTHX_ "Substitution loop");
1759 rxtainted |= RX_MATCH_TAINTED(rx);
1760 m = rx->startp[0] + orig;
1764 Move(s, d, i, char);
1768 Copy(c, d, clen, char);
1771 s = rx->endp[0] + orig;
1772 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1774 /* don't match same null twice */
1775 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1778 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1779 Move(s, d, i+1, char); /* include the NUL */
1781 TAINT_IF(rxtainted & 1);
1783 PUSHs(sv_2mortal(newSViv((I32)iters)));
1785 (void)SvPOK_only(TARG);
1786 TAINT_IF(rxtainted);
1787 if (SvSMAGICAL(TARG)) {
1793 LEAVE_SCOPE(oldsave);
1797 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1798 r_flags | REXEC_CHECKED))
1800 if (force_on_match) {
1802 s = SvPV_force(TARG, len);
1805 rxtainted |= RX_MATCH_TAINTED(rx);
1806 dstr = NEWSV(25, len);
1807 sv_setpvn(dstr, m, s-m);
1810 register PERL_CONTEXT *cx;
1813 RETURNOP(cPMOP->op_pmreplroot);
1815 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1817 if (iters++ > maxiters)
1818 DIE(aTHX_ "Substitution loop");
1819 rxtainted |= RX_MATCH_TAINTED(rx);
1820 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1825 strend = s + (strend - m);
1827 m = rx->startp[0] + orig;
1828 sv_catpvn(dstr, s, m-s);
1829 s = rx->endp[0] + orig;
1831 sv_catpvn(dstr, c, clen);
1834 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1835 sv_catpvn(dstr, s, strend - s);
1837 (void)SvOOK_off(TARG);
1838 Safefree(SvPVX(TARG));
1839 SvPVX(TARG) = SvPVX(dstr);
1840 SvCUR_set(TARG, SvCUR(dstr));
1841 SvLEN_set(TARG, SvLEN(dstr));
1845 TAINT_IF(rxtainted & 1);
1847 PUSHs(sv_2mortal(newSViv((I32)iters)));
1849 (void)SvPOK_only(TARG);
1850 TAINT_IF(rxtainted);
1853 LEAVE_SCOPE(oldsave);
1862 LEAVE_SCOPE(oldsave);
1871 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1872 ++*PL_markstack_ptr;
1873 LEAVE; /* exit inner scope */
1876 if (PL_stack_base + *PL_markstack_ptr > SP) {
1878 I32 gimme = GIMME_V;
1880 LEAVE; /* exit outer scope */
1881 (void)POPMARK; /* pop src */
1882 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1883 (void)POPMARK; /* pop dst */
1884 SP = PL_stack_base + POPMARK; /* pop original mark */
1885 if (gimme == G_SCALAR) {
1889 else if (gimme == G_ARRAY)
1896 ENTER; /* enter inner scope */
1899 src = PL_stack_base[*PL_markstack_ptr];
1903 RETURNOP(cLOGOP->op_other);
1914 register PERL_CONTEXT *cx;
1920 if (gimme == G_SCALAR) {
1923 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1925 *MARK = SvREFCNT_inc(TOPs);
1931 *MARK = sv_mortalcopy(TOPs);
1935 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1939 *MARK = &PL_sv_undef;
1943 else if (gimme == G_ARRAY) {
1944 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1945 if (!SvTEMP(*MARK)) {
1946 *MARK = sv_mortalcopy(*MARK);
1947 TAINT_NOT; /* Each item is independent */
1953 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
1954 PL_curpm = newpm; /* ... and pop $1 et al */
1958 return pop_return();
1961 /* This duplicates the above code because the above code must not
1962 * get any slower by more conditions */
1970 register PERL_CONTEXT *cx;
1977 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
1978 /* We are an argument to a function or grep().
1979 * This kind of lvalueness was legal before lvalue
1980 * subroutines too, so be backward compatible:
1981 * cannot report errors. */
1983 /* Scalar context *is* possible, on the LHS of -> only,
1984 * as in f()->meth(). But this is not an lvalue. */
1985 if (gimme == G_SCALAR)
1987 if (gimme == G_ARRAY) {
1988 if (!CvLVALUE(cx->blk_sub.cv))
1989 goto temporise_array;
1990 EXTEND_MORTAL(SP - newsp);
1991 for (mark = newsp + 1; mark <= SP; mark++) {
1994 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
1995 *mark = sv_mortalcopy(*mark);
1997 /* Can be a localized value subject to deletion. */
1998 PL_tmps_stack[++PL_tmps_ix] = *mark;
1999 (void)SvREFCNT_inc(*mark);
2004 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2005 /* Here we go for robustness, not for speed, so we change all
2006 * the refcounts so the caller gets a live guy. Cannot set
2007 * TEMP, so sv_2mortal is out of question. */
2008 if (!CvLVALUE(cx->blk_sub.cv)) {
2013 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2015 if (gimme == G_SCALAR) {
2019 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2024 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2025 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2027 else { /* Can be a localized value
2028 * subject to deletion. */
2029 PL_tmps_stack[++PL_tmps_ix] = *mark;
2030 (void)SvREFCNT_inc(*mark);
2033 else { /* Should not happen? */
2038 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2039 (MARK > SP ? "Empty array" : "Array"));
2043 else if (gimme == G_ARRAY) {
2044 EXTEND_MORTAL(SP - newsp);
2045 for (mark = newsp + 1; mark <= SP; mark++) {
2046 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2047 /* Might be flattened array after $#array = */
2053 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2054 (*mark != &PL_sv_undef)
2056 ? "a readonly value" : "a temporary")
2057 : "an uninitialized value");
2061 /* Can be a localized value subject to deletion. */
2062 PL_tmps_stack[++PL_tmps_ix] = *mark;
2063 (void)SvREFCNT_inc(*mark);
2069 if (gimme == G_SCALAR) {
2073 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2075 *MARK = SvREFCNT_inc(TOPs);
2081 *MARK = sv_mortalcopy(TOPs);
2085 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2089 *MARK = &PL_sv_undef;
2093 else if (gimme == G_ARRAY) {
2095 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2096 if (!SvTEMP(*MARK)) {
2097 *MARK = sv_mortalcopy(*MARK);
2098 TAINT_NOT; /* Each item is independent */
2105 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2106 PL_curpm = newpm; /* ... and pop $1 et al */
2110 return pop_return();
2115 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2118 SV *dbsv = GvSV(PL_DBsub);
2120 if (!PERLDB_SUB_NN) {
2124 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2125 || strEQ(GvNAME(gv), "END")
2126 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2127 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2128 && (gv = (GV*)*svp) ))) {
2129 /* Use GV from the stack as a fallback. */
2130 /* GV is potentially non-unique, or contain different CV. */
2131 sv_setsv(dbsv, newRV((SV*)cv));
2134 gv_efullname3(dbsv, gv, Nullch);
2138 SvUPGRADE(dbsv, SVt_PVIV);
2140 SAVEIV(SvIVX(dbsv));
2141 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2145 PL_curcopdb = PL_curcop;
2146 cv = GvCV(PL_DBsub);
2156 register PERL_CONTEXT *cx;
2158 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2161 DIE(aTHX_ "Not a CODE reference");
2162 switch (SvTYPE(sv)) {
2168 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2170 SP = PL_stack_base + POPMARK;
2173 if (SvGMAGICAL(sv)) {
2175 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2178 sym = SvPV(sv, n_a);
2180 DIE(aTHX_ PL_no_usym, "a subroutine");
2181 if (PL_op->op_private & HINT_STRICT_REFS)
2182 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2183 cv = get_cv(sym, TRUE);
2187 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2188 tryAMAGICunDEREF(to_cv);
2191 if (SvTYPE(cv) == SVt_PVCV)
2196 DIE(aTHX_ "Not a CODE reference");
2201 if (!(cv = GvCVu((GV*)sv)))
2202 cv = sv_2cv(sv, &stash, &gv, FALSE);
2215 if (!CvROOT(cv) && !CvXSUB(cv)) {
2219 /* anonymous or undef'd function leaves us no recourse */
2220 if (CvANON(cv) || !(gv = CvGV(cv)))
2221 DIE(aTHX_ "Undefined subroutine called");
2223 /* autoloaded stub? */
2224 if (cv != GvCV(gv)) {
2227 /* should call AUTOLOAD now? */
2230 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2237 sub_name = sv_newmortal();
2238 gv_efullname3(sub_name, gv, Nullch);
2239 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2243 DIE(aTHX_ "Not a CODE reference");
2248 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2249 cv = get_db_sub(&sv, cv);
2251 DIE(aTHX_ "No DBsub routine");
2256 * First we need to check if the sub or method requires locking.
2257 * If so, we gain a lock on the CV, the first argument or the
2258 * stash (for static methods), as appropriate. This has to be
2259 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2260 * reschedule by returning a new op.
2262 MUTEX_LOCK(CvMUTEXP(cv));
2263 if (CvFLAGS(cv) & CVf_LOCKED) {
2265 if (CvFLAGS(cv) & CVf_METHOD) {
2266 if (SP > PL_stack_base + TOPMARK)
2267 sv = *(PL_stack_base + TOPMARK + 1);
2269 AV *av = (AV*)PL_curpad[0];
2270 if (hasargs || !av || AvFILLp(av) < 0
2271 || !(sv = AvARRAY(av)[0]))
2273 MUTEX_UNLOCK(CvMUTEXP(cv));
2274 DIE(aTHX_ "no argument for locked method call");
2281 char *stashname = SvPV(sv, len);
2282 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2288 MUTEX_UNLOCK(CvMUTEXP(cv));
2289 mg = condpair_magic(sv);
2290 MUTEX_LOCK(MgMUTEXP(mg));
2291 if (MgOWNER(mg) == thr)
2292 MUTEX_UNLOCK(MgMUTEXP(mg));
2295 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2297 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2299 MUTEX_UNLOCK(MgMUTEXP(mg));
2300 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2302 MUTEX_LOCK(CvMUTEXP(cv));
2305 * Now we have permission to enter the sub, we must distinguish
2306 * four cases. (0) It's an XSUB (in which case we don't care
2307 * about ownership); (1) it's ours already (and we're recursing);
2308 * (2) it's free (but we may already be using a cached clone);
2309 * (3) another thread owns it. Case (1) is easy: we just use it.
2310 * Case (2) means we look for a clone--if we have one, use it
2311 * otherwise grab ownership of cv. Case (3) means we look for a
2312 * clone (for non-XSUBs) and have to create one if we don't
2314 * Why look for a clone in case (2) when we could just grab
2315 * ownership of cv straight away? Well, we could be recursing,
2316 * i.e. we originally tried to enter cv while another thread
2317 * owned it (hence we used a clone) but it has been freed up
2318 * and we're now recursing into it. It may or may not be "better"
2319 * to use the clone but at least CvDEPTH can be trusted.
2321 if (CvOWNER(cv) == thr || CvXSUB(cv))
2322 MUTEX_UNLOCK(CvMUTEXP(cv));
2324 /* Case (2) or (3) */
2328 * XXX Might it be better to release CvMUTEXP(cv) while we
2329 * do the hv_fetch? We might find someone has pinched it
2330 * when we look again, in which case we would be in case
2331 * (3) instead of (2) so we'd have to clone. Would the fact
2332 * that we released the mutex more quickly make up for this?
2334 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2336 /* We already have a clone to use */
2337 MUTEX_UNLOCK(CvMUTEXP(cv));
2339 DEBUG_S(PerlIO_printf(Perl_debug_log,
2340 "entersub: %p already has clone %p:%s\n",
2341 thr, cv, SvPEEK((SV*)cv)));
2344 if (CvDEPTH(cv) == 0)
2345 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2348 /* (2) => grab ownership of cv. (3) => make clone */
2352 MUTEX_UNLOCK(CvMUTEXP(cv));
2353 DEBUG_S(PerlIO_printf(Perl_debug_log,
2354 "entersub: %p grabbing %p:%s in stash %s\n",
2355 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2356 HvNAME(CvSTASH(cv)) : "(none)"));
2359 /* Make a new clone. */
2361 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2362 MUTEX_UNLOCK(CvMUTEXP(cv));
2363 DEBUG_S((PerlIO_printf(Perl_debug_log,
2364 "entersub: %p cloning %p:%s\n",
2365 thr, cv, SvPEEK((SV*)cv))));
2367 * We're creating a new clone so there's no race
2368 * between the original MUTEX_UNLOCK and the
2369 * SvREFCNT_inc since no one will be trying to undef
2370 * it out from underneath us. At least, I don't think
2373 clonecv = cv_clone(cv);
2374 SvREFCNT_dec(cv); /* finished with this */
2375 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2376 CvOWNER(clonecv) = thr;
2380 DEBUG_S(if (CvDEPTH(cv) != 0)
2381 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2383 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2386 #endif /* USE_THREADS */
2389 #ifdef PERL_XSUB_OLDSTYLE
2390 if (CvOLDSTYLE(cv)) {
2391 I32 (*fp3)(int,int,int);
2393 register I32 items = SP - MARK;
2394 /* We dont worry to copy from @_. */
2399 PL_stack_sp = mark + 1;
2400 fp3 = (I32(*)(int,int,int)))CvXSUB(cv;
2401 items = (*fp3)(CvXSUBANY(cv).any_i32,
2402 MARK - PL_stack_base + 1,
2404 PL_stack_sp = PL_stack_base + items;
2407 #endif /* PERL_XSUB_OLDSTYLE */
2409 I32 markix = TOPMARK;
2414 /* Need to copy @_ to stack. Alternative may be to
2415 * switch stack to @_, and copy return values
2416 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2420 av = (AV*)PL_curpad[0];
2422 av = GvAV(PL_defgv);
2423 #endif /* USE_THREADS */
2424 items = AvFILLp(av) + 1; /* @_ is not tieable */
2427 /* Mark is at the end of the stack. */
2429 Copy(AvARRAY(av), SP + 1, items, SV*);
2434 /* We assume first XSUB in &DB::sub is the called one. */
2436 SAVESPTR(PL_curcop);
2437 PL_curcop = PL_curcopdb;
2440 /* Do we need to open block here? XXXX */
2441 (void)(*CvXSUB(cv))(aTHXo_ cv);
2443 /* Enforce some sanity in scalar context. */
2444 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2445 if (markix > PL_stack_sp - PL_stack_base)
2446 *(PL_stack_base + markix) = &PL_sv_undef;
2448 *(PL_stack_base + markix) = *PL_stack_sp;
2449 PL_stack_sp = PL_stack_base + markix;
2457 register I32 items = SP - MARK;
2458 AV* padlist = CvPADLIST(cv);
2459 SV** svp = AvARRAY(padlist);
2460 push_return(PL_op->op_next);
2461 PUSHBLOCK(cx, CXt_SUB, MARK);
2464 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2465 * that eval'' ops within this sub know the correct lexical space.
2466 * Owing the speed considerations, we choose to search for the cv
2467 * in doeval() instead.
2469 if (CvDEPTH(cv) < 2)
2470 (void)SvREFCNT_inc(cv);
2471 else { /* save temporaries on recursion? */
2472 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2474 AV *newpad = newAV();
2475 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2476 I32 ix = AvFILLp((AV*)svp[1]);
2477 svp = AvARRAY(svp[0]);
2478 for ( ;ix > 0; ix--) {
2479 if (svp[ix] != &PL_sv_undef) {
2480 char *name = SvPVX(svp[ix]);
2481 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2482 || *name == '&') /* anonymous code? */
2484 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2486 else { /* our own lexical */
2488 av_store(newpad, ix, sv = (SV*)newAV());
2489 else if (*name == '%')
2490 av_store(newpad, ix, sv = (SV*)newHV());
2492 av_store(newpad, ix, sv = NEWSV(0,0));
2496 else if (IS_PADGV(oldpad[ix])) {
2497 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2500 av_store(newpad, ix, sv = NEWSV(0,0));
2504 av = newAV(); /* will be @_ */
2506 av_store(newpad, 0, (SV*)av);
2507 AvFLAGS(av) = AVf_REIFY;
2508 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2509 AvFILLp(padlist) = CvDEPTH(cv);
2510 svp = AvARRAY(padlist);
2515 AV* av = (AV*)PL_curpad[0];
2517 items = AvFILLp(av) + 1;
2519 /* Mark is at the end of the stack. */
2521 Copy(AvARRAY(av), SP + 1, items, SV*);
2526 #endif /* USE_THREADS */
2527 SAVESPTR(PL_curpad);
2528 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2531 #endif /* USE_THREADS */
2537 DEBUG_S(PerlIO_printf(Perl_debug_log,
2538 "%p entersub preparing @_\n", thr));
2540 av = (AV*)PL_curpad[0];
2542 /* @_ is normally not REAL--this should only ever
2543 * happen when DB::sub() calls things that modify @_ */
2549 cx->blk_sub.savearray = GvAV(PL_defgv);
2550 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2551 #endif /* USE_THREADS */
2552 cx->blk_sub.argarray = av;
2555 if (items > AvMAX(av) + 1) {
2557 if (AvARRAY(av) != ary) {
2558 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2559 SvPVX(av) = (char*)ary;
2561 if (items > AvMAX(av) + 1) {
2562 AvMAX(av) = items - 1;
2563 Renew(ary,items,SV*);
2565 SvPVX(av) = (char*)ary;
2568 Copy(MARK,AvARRAY(av),items,SV*);
2569 AvFILLp(av) = items - 1;
2577 /* warning must come *after* we fully set up the context
2578 * stuff so that __WARN__ handlers can safely dounwind()
2581 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2582 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2583 sub_crush_depth(cv);
2585 DEBUG_S(PerlIO_printf(Perl_debug_log,
2586 "%p entersub returning %p\n", thr, CvSTART(cv)));
2588 RETURNOP(CvSTART(cv));
2593 Perl_sub_crush_depth(pTHX_ CV *cv)
2596 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2598 SV* tmpstr = sv_newmortal();
2599 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2600 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2611 U32 lval = PL_op->op_flags & OPf_MOD;
2612 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2616 elem -= PL_curcop->cop_arybase;
2617 if (SvTYPE(av) != SVt_PVAV)
2619 svp = av_fetch(av, elem, lval && !defer);
2621 if (!svp || *svp == &PL_sv_undef) {
2624 DIE(aTHX_ PL_no_aelem, elem);
2625 lv = sv_newmortal();
2626 sv_upgrade(lv, SVt_PVLV);
2628 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2629 LvTARG(lv) = SvREFCNT_inc(av);
2630 LvTARGOFF(lv) = elem;
2635 if (PL_op->op_private & OPpLVAL_INTRO)
2636 save_aelem(av, elem, svp);
2637 else if (PL_op->op_private & OPpDEREF)
2638 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2640 sv = (svp ? *svp : &PL_sv_undef);
2641 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2642 sv = sv_mortalcopy(sv);
2648 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2654 Perl_croak(aTHX_ PL_no_modify);
2655 if (SvTYPE(sv) < SVt_RV)
2656 sv_upgrade(sv, SVt_RV);
2657 else if (SvTYPE(sv) >= SVt_PV) {
2658 (void)SvOOK_off(sv);
2659 Safefree(SvPVX(sv));
2660 SvLEN(sv) = SvCUR(sv) = 0;
2664 SvRV(sv) = NEWSV(355,0);
2667 SvRV(sv) = (SV*)newAV();
2670 SvRV(sv) = (SV*)newHV();
2685 if (SvTYPE(rsv) == SVt_PVCV) {
2691 SETs(method_common(sv, Null(U32*)));
2698 SV* sv = cSVOP->op_sv;
2699 U32 hash = SvUVX(sv);
2701 XPUSHs(method_common(sv, &hash));
2706 S_method_common(pTHX_ SV* meth, U32* hashp)
2718 name = SvPV(meth, namelen);
2719 sv = *(PL_stack_base + TOPMARK + 1);
2730 !(packname = SvPV(sv, packlen)) ||
2731 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2732 !(ob=(SV*)GvIO(iogv)))
2735 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2736 ? !isIDFIRST_utf8((U8*)packname)
2737 : !isIDFIRST(*packname)
2740 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2741 SvOK(sv) ? "without a package or object reference"
2742 : "on an undefined value");
2744 stash = gv_stashpvn(packname, packlen, TRUE);
2747 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2750 if (!ob || !SvOBJECT(ob))
2751 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2754 stash = SvSTASH(ob);
2757 /* shortcut for simple names */
2759 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2761 gv = (GV*)HeVAL(he);
2762 if (isGV(gv) && GvCV(gv) &&
2763 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2764 return (SV*)GvCV(gv);
2768 gv = gv_fetchmethod(stash, name);
2774 for (p = name; *p; p++) {
2776 sep = p, leaf = p + 1;
2777 else if (*p == ':' && *(p + 1) == ':')
2778 sep = p, leaf = p + 2;
2780 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2781 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2782 packlen = strlen(packname);
2786 packlen = sep - name;
2789 "Can't locate object method \"%s\" via package \"%s\"",
2792 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2797 unset_cvowner(pTHXo_ void *cvarg)
2799 register CV* cv = (CV *) cvarg;
2802 #endif /* DEBUGGING */
2804 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2805 thr, cv, SvPEEK((SV*)cv))));
2806 MUTEX_LOCK(CvMUTEXP(cv));
2807 DEBUG_S(if (CvDEPTH(cv) != 0)
2808 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2810 assert(thr == CvOWNER(cv));
2812 MUTEX_UNLOCK(CvMUTEXP(cv));
2815 #endif /* USE_THREADS */