3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
36 static void unset_cvowner(pTHXo_ void *cvarg);
37 #endif /* USE_THREADS */
48 PL_curcop = (COP*)PL_op;
49 TAINT_NOT; /* Each statement is presumed innocent */
50 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
59 if (PL_op->op_private & OPpLVAL_INTRO)
60 PUSHs(save_scalar(cGVOP_gv));
62 PUSHs(GvSV(cGVOP_gv));
73 PL_curcop = (COP*)PL_op;
79 PUSHMARK(PL_stack_sp);
89 sv_setpvn(TARG,s,len);
90 if (SvUTF8(TOPs) && !IN_BYTE)
99 XPUSHs((SV*)cGVOP_gv);
110 RETURNOP(cLOGOP->op_other);
119 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
121 temp = left; left = right; right = temp;
123 if (PL_tainting && PL_tainted && !SvTAINTED(left))
125 SvSetMagicSV(right, left);
134 RETURNOP(cLOGOP->op_other);
136 RETURNOP(cLOGOP->op_next);
142 TAINT_NOT; /* Each statement is presumed innocent */
143 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
145 oldsave = PL_scopestack[PL_scopestack_ix - 1];
146 LEAVE_SCOPE(oldsave);
152 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
161 sv_insert(TARG, 0, 0, s, len);
165 sv_setpvn(TARG,s,len);
167 else if (SvGMAGICAL(TARG))
169 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
170 sv_setpv(TARG, ""); /* Suppress warning. */
171 s = SvPV_force(TARG, len);
175 #if defined(PERL_Y2KWARN)
176 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_MISC)) {
178 char *s = SvPV(TARG,n);
179 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
180 && (n == 2 || !isDIGIT(s[n-3])))
182 Perl_warner(aTHX_ WARN_MISC, "Possible Y2K bug: %s",
183 "about to append an integer to '19'");
187 sv_catpvn(TARG,s,len);
190 sv_setpvn(TARG,s,len); /* suppress warning */
200 if (PL_op->op_flags & OPf_MOD) {
201 if (PL_op->op_private & OPpLVAL_INTRO)
202 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
203 else if (PL_op->op_private & OPpDEREF) {
205 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
214 tryAMAGICunTARGET(iter, 0);
215 PL_last_in_gv = (GV*)(*PL_stack_sp--);
216 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
217 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
218 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
221 XPUSHs((SV*)PL_last_in_gv);
224 PL_last_in_gv = (GV*)(*PL_stack_sp--);
227 return do_readline();
232 djSP; tryAMAGICbinSET(eq,0);
235 SETs(boolSV(TOPn == value));
243 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
244 DIE(aTHX_ PL_no_modify);
245 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
246 SvIVX(TOPs) != IV_MAX)
249 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
264 RETURNOP(cLOGOP->op_other);
270 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
273 SETn( left + right );
281 AV *av = GvAV(cGVOP_gv);
282 U32 lval = PL_op->op_flags & OPf_MOD;
283 SV** svp = av_fetch(av, PL_op->op_private, lval);
284 SV *sv = (svp ? *svp : &PL_sv_undef);
286 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
287 sv = sv_mortalcopy(sv);
294 djSP; dMARK; dTARGET;
296 do_join(TARG, *MARK, MARK, SP);
307 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
308 * will be enough to hold an OP*.
310 SV* sv = sv_newmortal();
311 sv_upgrade(sv, SVt_PVLV);
313 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
321 /* Oversized hot code. */
325 djSP; dMARK; dORIGMARK;
332 if (PL_op->op_flags & OPf_STACKED)
336 if (mg = SvTIED_mg((SV*)gv, 'q')) {
337 if (MARK == ORIGMARK) {
338 /* If using default handle then we need to make space to
339 * pass object as 1st arg, so move other args up ...
343 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
347 *MARK = SvTIED_obj((SV*)gv, mg);
350 call_method("PRINT", G_SCALAR);
358 if (!(io = GvIO(gv))) {
359 if (ckWARN(WARN_UNOPENED)) {
360 SV* sv = sv_newmortal();
361 gv_efullname3(sv, gv, Nullch);
362 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
365 SETERRNO(EBADF,RMS$_IFI);
368 else if (!(fp = IoOFP(io))) {
369 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
371 SV* sv = sv_newmortal();
372 gv_efullname3(sv, gv, Nullch);
373 Perl_warner(aTHX_ WARN_IO,
374 "Filehandle %s opened only for input",
377 else if (ckWARN(WARN_CLOSED))
378 report_closed_fh(gv, io, "print", "filehandle");
380 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
387 if (!do_print(*MARK, fp))
391 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
400 if (!do_print(*MARK, fp))
409 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
412 if (IoFLAGS(io) & IOf_FLUSH)
413 if (PerlIO_flush(fp) == EOF)
434 tryAMAGICunDEREF(to_av);
437 if (SvTYPE(av) != SVt_PVAV)
438 DIE(aTHX_ "Not an ARRAY reference");
439 if (PL_op->op_flags & OPf_REF) {
445 if (SvTYPE(sv) == SVt_PVAV) {
447 if (PL_op->op_flags & OPf_REF) {
455 if (SvTYPE(sv) != SVt_PVGV) {
459 if (SvGMAGICAL(sv)) {
465 if (PL_op->op_flags & OPf_REF ||
466 PL_op->op_private & HINT_STRICT_REFS)
467 DIE(aTHX_ PL_no_usym, "an ARRAY");
468 if (ckWARN(WARN_UNINITIALIZED))
470 if (GIMME == G_ARRAY) {
477 if ((PL_op->op_flags & OPf_SPECIAL) &&
478 !(PL_op->op_flags & OPf_MOD))
480 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
485 if (PL_op->op_private & HINT_STRICT_REFS)
486 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
487 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
494 if (PL_op->op_private & OPpLVAL_INTRO)
496 if (PL_op->op_flags & OPf_REF) {
503 if (GIMME == G_ARRAY) {
504 I32 maxarg = AvFILL(av) + 1;
505 (void)POPs; /* XXXX May be optimized away? */
507 if (SvRMAGICAL(av)) {
509 for (i=0; i < maxarg; i++) {
510 SV **svp = av_fetch(av, i, FALSE);
511 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
515 Copy(AvARRAY(av), SP+1, maxarg, SV*);
521 I32 maxarg = AvFILL(av) + 1;
534 tryAMAGICunDEREF(to_hv);
537 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
538 DIE(aTHX_ "Not a HASH reference");
539 if (PL_op->op_flags & OPf_REF) {
545 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
547 if (PL_op->op_flags & OPf_REF) {
555 if (SvTYPE(sv) != SVt_PVGV) {
559 if (SvGMAGICAL(sv)) {
565 if (PL_op->op_flags & OPf_REF ||
566 PL_op->op_private & HINT_STRICT_REFS)
567 DIE(aTHX_ PL_no_usym, "a HASH");
568 if (ckWARN(WARN_UNINITIALIZED))
570 if (GIMME == G_ARRAY) {
577 if ((PL_op->op_flags & OPf_SPECIAL) &&
578 !(PL_op->op_flags & OPf_MOD))
580 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
585 if (PL_op->op_private & HINT_STRICT_REFS)
586 DIE(aTHX_ PL_no_symref, sym, "a HASH");
587 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
594 if (PL_op->op_private & OPpLVAL_INTRO)
596 if (PL_op->op_flags & OPf_REF) {
603 if (GIMME == G_ARRAY) { /* array wanted */
604 *PL_stack_sp = (SV*)hv;
609 if (SvTYPE(hv) == SVt_PVAV)
610 hv = avhv_keys((AV*)hv);
612 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
613 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
625 SV **lastlelem = PL_stack_sp;
626 SV **lastrelem = PL_stack_base + POPMARK;
627 SV **firstrelem = PL_stack_base + POPMARK + 1;
628 SV **firstlelem = lastrelem + 1;
641 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
643 /* If there's a common identifier on both sides we have to take
644 * special care that assigning the identifier on the left doesn't
645 * clobber a value on the right that's used later in the list.
647 if (PL_op->op_private & OPpASSIGN_COMMON) {
648 EXTEND_MORTAL(lastrelem - firstrelem + 1);
649 for (relem = firstrelem; relem <= lastrelem; relem++) {
652 TAINT_NOT; /* Each item is independent */
653 *relem = sv_mortalcopy(sv);
662 while (lelem <= lastlelem) {
663 TAINT_NOT; /* Each item stands on its own, taintwise. */
665 switch (SvTYPE(sv)) {
668 magic = SvMAGICAL(ary) != 0;
671 av_extend(ary, lastrelem - relem);
673 while (relem <= lastrelem) { /* gobble up all the rest */
679 didstore = av_store(ary,i++,sv);
693 magic = SvMAGICAL(hash) != 0;
696 while (relem < lastrelem) { /* gobble up all the rest */
701 sv = &PL_sv_no, relem++;
702 tmpstr = NEWSV(29,0);
704 sv_setsv(tmpstr,*relem); /* value */
706 didstore = hv_store_ent(hash,sv,tmpstr,0);
708 if (SvSMAGICAL(tmpstr))
715 if (relem == lastrelem) {
718 if (ckWARN(WARN_UNSAFE)) {
719 if (relem == firstrelem &&
721 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
722 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
723 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
725 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
727 tmpstr = NEWSV(29,0);
728 didstore = hv_store_ent(hash,*relem,tmpstr,0);
730 if (SvSMAGICAL(tmpstr))
742 if (SvIMMORTAL(sv)) {
743 if (relem <= lastrelem)
747 if (relem <= lastrelem) {
748 sv_setsv(sv, *relem);
752 sv_setsv(sv, &PL_sv_undef);
757 if (PL_delaymagic & ~DM_DELAY) {
758 if (PL_delaymagic & DM_UID) {
760 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
763 (void)setreuid(PL_uid,PL_euid);
766 if ((PL_delaymagic & DM_UID) == DM_RUID) {
767 (void)setruid(PL_uid);
768 PL_delaymagic &= ~DM_RUID;
770 # endif /* HAS_SETRUID */
772 if ((PL_delaymagic & DM_UID) == DM_EUID) {
773 (void)seteuid(PL_uid);
774 PL_delaymagic &= ~DM_EUID;
776 # endif /* HAS_SETEUID */
777 if (PL_delaymagic & DM_UID) {
778 if (PL_uid != PL_euid)
779 DIE(aTHX_ "No setreuid available");
780 (void)PerlProc_setuid(PL_uid);
782 # endif /* HAS_SETREUID */
783 #endif /* HAS_SETRESUID */
784 PL_uid = PerlProc_getuid();
785 PL_euid = PerlProc_geteuid();
787 if (PL_delaymagic & DM_GID) {
789 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
792 (void)setregid(PL_gid,PL_egid);
795 if ((PL_delaymagic & DM_GID) == DM_RGID) {
796 (void)setrgid(PL_gid);
797 PL_delaymagic &= ~DM_RGID;
799 # endif /* HAS_SETRGID */
801 if ((PL_delaymagic & DM_GID) == DM_EGID) {
802 (void)setegid(PL_gid);
803 PL_delaymagic &= ~DM_EGID;
805 # endif /* HAS_SETEGID */
806 if (PL_delaymagic & DM_GID) {
807 if (PL_gid != PL_egid)
808 DIE(aTHX_ "No setregid available");
809 (void)PerlProc_setgid(PL_gid);
811 # endif /* HAS_SETREGID */
812 #endif /* HAS_SETRESGID */
813 PL_gid = PerlProc_getgid();
814 PL_egid = PerlProc_getegid();
816 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
823 else if (gimme == G_SCALAR) {
826 SETi(lastrelem - firstrelem + 1);
832 SP = firstrelem + (lastlelem - firstlelem);
833 lelem = firstlelem + (relem - firstrelem);
835 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
843 register PMOP *pm = cPMOP;
844 SV *rv = sv_newmortal();
845 SV *sv = newSVrv(rv, "Regexp");
846 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
853 register PMOP *pm = cPMOP;
858 I32 r_flags = REXEC_CHECKED;
859 char *truebase; /* Start of string */
860 register REGEXP *rx = pm->op_pmregexp;
865 I32 oldsave = PL_savestack_ix;
866 I32 update_minmatch = 1;
869 if (PL_op->op_flags & OPf_STACKED)
875 PUTBACK; /* EVAL blocks need stack_sp. */
879 DIE(aTHX_ "panic: do_match");
880 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
881 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
884 if (pm->op_pmdynflags & PMdf_USED) {
886 if (gimme == G_ARRAY)
891 if (!rx->prelen && PL_curpm) {
893 rx = pm->op_pmregexp;
895 if (rx->minlen > len) goto failure;
899 /* XXXX What part of this is needed with true \G-support? */
900 if (global = pm->op_pmflags & PMf_GLOBAL) {
902 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
903 MAGIC* mg = mg_find(TARG, 'g');
904 if (mg && mg->mg_len >= 0) {
905 if (!(rx->reganch & ROPT_GPOS_SEEN))
906 rx->endp[0] = rx->startp[0] = mg->mg_len;
907 else if (rx->reganch & ROPT_ANCH_GPOS) {
908 r_flags |= REXEC_IGNOREPOS;
909 rx->endp[0] = rx->startp[0] = mg->mg_len;
911 minmatch = (mg->mg_flags & MGf_MINMATCH);
916 if ((gimme != G_ARRAY && !global && rx->nparens)
917 || SvTEMP(TARG) || PL_sawampersand)
918 r_flags |= REXEC_COPY_STR;
920 r_flags |= REXEC_SCREAM;
922 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
923 SAVEINT(PL_multiline);
924 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
928 if (global && rx->startp[0] != -1) {
929 t = s = rx->endp[0] + truebase;
930 if ((s + rx->minlen) > strend)
932 if (update_minmatch++)
933 minmatch = had_zerolen;
935 if (rx->reganch & RE_USE_INTUIT) {
936 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
940 if ( (rx->reganch & ROPT_CHECK_ALL)
942 && ((rx->reganch & ROPT_NOSCAN)
943 || !((rx->reganch & RE_INTUIT_TAIL)
944 && (r_flags & REXEC_SCREAM))))
947 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
950 if (pm->op_pmflags & PMf_ONCE)
951 pm->op_pmdynflags |= PMdf_USED;
960 RX_MATCH_TAINTED_on(rx);
961 TAINT_IF(RX_MATCH_TAINTED(rx));
962 if (gimme == G_ARRAY) {
966 if (global && !iters)
970 SPAGAIN; /* EVAL blocks could move the stack. */
971 EXTEND(SP, iters + i);
972 EXTEND_MORTAL(iters + i);
973 for (i = !i; i <= iters; i++) {
974 PUSHs(sv_newmortal());
976 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
977 len = rx->endp[i] - rx->startp[i];
978 s = rx->startp[i] + truebase;
979 sv_setpvn(*SP, s, len);
983 had_zerolen = (rx->startp[0] != -1
984 && rx->startp[0] == rx->endp[0]);
985 PUTBACK; /* EVAL blocks may use stack */
986 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
991 LEAVE_SCOPE(oldsave);
997 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
998 mg = mg_find(TARG, 'g');
1000 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1001 mg = mg_find(TARG, 'g');
1003 if (rx->startp[0] != -1) {
1004 mg->mg_len = rx->endp[0];
1005 if (rx->startp[0] == rx->endp[0])
1006 mg->mg_flags |= MGf_MINMATCH;
1008 mg->mg_flags &= ~MGf_MINMATCH;
1011 LEAVE_SCOPE(oldsave);
1015 yup: /* Confirmed by INTUIT */
1017 RX_MATCH_TAINTED_on(rx);
1018 TAINT_IF(RX_MATCH_TAINTED(rx));
1020 if (pm->op_pmflags & PMf_ONCE)
1021 pm->op_pmdynflags |= PMdf_USED;
1022 if (RX_MATCH_COPIED(rx))
1023 Safefree(rx->subbeg);
1024 RX_MATCH_COPIED_off(rx);
1025 rx->subbeg = Nullch;
1027 rx->subbeg = truebase;
1028 rx->startp[0] = s - truebase;
1029 rx->endp[0] = s - truebase + rx->minlen;
1030 rx->sublen = strend - truebase;
1033 if (PL_sawampersand) {
1036 rx->subbeg = savepvn(t, strend - t);
1037 rx->sublen = strend - t;
1038 RX_MATCH_COPIED_on(rx);
1039 off = rx->startp[0] = s - t;
1040 rx->endp[0] = off + rx->minlen;
1042 else { /* startp/endp are used by @- @+. */
1043 rx->startp[0] = s - truebase;
1044 rx->endp[0] = s - truebase + rx->minlen;
1046 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1047 LEAVE_SCOPE(oldsave);
1052 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1053 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1054 MAGIC* mg = mg_find(TARG, 'g');
1059 LEAVE_SCOPE(oldsave);
1060 if (gimme == G_ARRAY)
1066 Perl_do_readline(pTHX)
1068 dSP; dTARGETSTACKED;
1073 register IO *io = GvIO(PL_last_in_gv);
1074 register I32 type = PL_op->op_type;
1075 I32 gimme = GIMME_V;
1078 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1080 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1083 call_method("READLINE", gimme);
1086 if (gimme == G_SCALAR)
1087 SvSetMagicSV_nosteal(TARG, TOPs);
1094 if (IoFLAGS(io) & IOf_ARGV) {
1095 if (IoFLAGS(io) & IOf_START) {
1097 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1098 IoFLAGS(io) &= ~IOf_START;
1099 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1100 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1101 SvSETMAGIC(GvSV(PL_last_in_gv));
1106 fp = nextargv(PL_last_in_gv);
1107 if (!fp) { /* Note: fp != IoIFP(io) */
1108 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1111 else if (type == OP_GLOB) {
1112 SV *tmpcmd = NEWSV(55, 0);
1116 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1117 /* since spawning off a process is a real performance hit */
1119 #include <descrip.h>
1120 #include <lib$routines.h>
1123 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1124 char vmsspec[NAM$C_MAXRSS+1];
1125 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1126 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1127 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1130 struct dsc$descriptor_s wilddsc
1131 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1132 struct dsc$descriptor_vs rsdsc
1133 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1134 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1136 /* We could find out if there's an explicit dev/dir or version
1137 by peeking into lib$find_file's internal context at
1138 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1139 but that's unsupported, so I don't want to do it now and
1140 have it bite someone in the future. */
1141 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1142 cp = SvPV(tmpglob,i);
1144 if (cp[i] == ';') hasver = 1;
1146 if (sts) hasver = 1;
1150 hasdir = isunix = 1;
1153 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1158 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1160 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1161 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1162 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1163 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1164 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1165 &dfltdsc,NULL,NULL,NULL))&1)) {
1166 end = rstr + (unsigned long int) *rslt;
1167 if (!hasver) while (*end != ';') end--;
1168 *(end++) = '\n'; *end = '\0';
1169 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1171 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1176 while (*(--begin) != ']' && *begin != '>') ;
1179 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1181 if (cxt) (void)lib$find_file_end(&cxt);
1182 if (ok && sts != RMS$_NMF &&
1183 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1186 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1188 PerlIO_close(tmpfp);
1192 PerlIO_rewind(tmpfp);
1194 IoIFP(io) = fp = tmpfp;
1195 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1200 #ifdef MACOS_TRADITIONAL
1201 sv_setpv(tmpcmd, "glob ");
1202 sv_catsv(tmpcmd, tmpglob);
1203 sv_catpv(tmpcmd, " |");
1207 sv_setpv(tmpcmd, "for a in ");
1208 sv_catsv(tmpcmd, tmpglob);
1209 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1212 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1213 sv_catsv(tmpcmd, tmpglob);
1215 sv_setpv(tmpcmd, "perlglob ");
1216 sv_catsv(tmpcmd, tmpglob);
1217 sv_catpv(tmpcmd, " |");
1222 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1223 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1224 sv_catsv(tmpcmd, tmpglob);
1225 sv_catpv(tmpcmd, "' 2>/dev/null |");
1227 sv_setpv(tmpcmd, "echo ");
1228 sv_catsv(tmpcmd, tmpglob);
1230 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1232 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1235 #endif /* !DOSISH */
1236 #endif /* MACOS_TRADITIONAL */
1237 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1238 FALSE, O_RDONLY, 0, Nullfp);
1244 else if (type == OP_GLOB)
1246 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1247 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1248 || fp == PerlIO_stderr()))
1250 SV* sv = sv_newmortal();
1251 gv_efullname3(sv, PL_last_in_gv, Nullch);
1252 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1257 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1258 if (type == OP_GLOB)
1259 Perl_warner(aTHX_ WARN_CLOSED,
1260 "glob failed (can't start child: %s)",
1263 report_closed_fh(PL_last_in_gv, io, "readline", "filehandle");
1265 if (gimme == G_SCALAR) {
1266 (void)SvOK_off(TARG);
1272 if (gimme == G_SCALAR) {
1276 (void)SvUPGRADE(sv, SVt_PV);
1277 tmplen = SvLEN(sv); /* remember if already alloced */
1279 Sv_Grow(sv, 80); /* try short-buffering it */
1280 if (type == OP_RCATLINE)
1286 sv = sv_2mortal(NEWSV(57, 80));
1290 /* delay EOF state for a snarfed empty file */
1291 #define SNARF_EOF(gimme,rs,io,sv) \
1292 (gimme != G_SCALAR || SvCUR(sv) \
1293 || !RsSNARF(rs) || (IoFLAGS(io) & IOf_NOLINE) \
1294 || ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1297 if (!sv_gets(sv, fp, offset)
1298 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1300 PerlIO_clearerr(fp);
1301 if (IoFLAGS(io) & IOf_ARGV) {
1302 fp = nextargv(PL_last_in_gv);
1305 (void)do_close(PL_last_in_gv, FALSE);
1307 else if (type == OP_GLOB) {
1308 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1309 Perl_warner(aTHX_ WARN_CLOSED,
1310 "glob failed (child exited with status %d%s)",
1311 (int)(STATUS_CURRENT >> 8),
1312 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1315 if (gimme == G_SCALAR) {
1316 (void)SvOK_off(TARG);
1321 /* This should not be marked tainted if the fp is marked clean */
1322 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1329 if (type == OP_GLOB) {
1332 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1333 tmps = SvEND(sv) - 1;
1334 if (*tmps == *SvPVX(PL_rs)) {
1339 for (tmps = SvPVX(sv); *tmps; tmps++)
1340 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1341 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1343 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1344 (void)POPs; /* Unmatched wildcard? Chuck it... */
1348 if (gimme == G_ARRAY) {
1349 if (SvLEN(sv) - SvCUR(sv) > 20) {
1350 SvLEN_set(sv, SvCUR(sv)+1);
1351 Renew(SvPVX(sv), SvLEN(sv), char);
1353 sv = sv_2mortal(NEWSV(58, 80));
1356 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1357 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1361 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1362 Renew(SvPVX(sv), SvLEN(sv), char);
1371 register PERL_CONTEXT *cx;
1372 I32 gimme = OP_GIMME(PL_op, -1);
1375 if (cxstack_ix >= 0)
1376 gimme = cxstack[cxstack_ix].blk_gimme;
1384 PUSHBLOCK(cx, CXt_BLOCK, SP);
1396 U32 lval = PL_op->op_flags & OPf_MOD;
1397 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1400 if (SvTYPE(hv) == SVt_PVHV) {
1401 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1402 svp = he ? &HeVAL(he) : 0;
1404 else if (SvTYPE(hv) == SVt_PVAV) {
1405 if (PL_op->op_private & OPpLVAL_INTRO)
1406 DIE(aTHX_ "Can't localize pseudo-hash element");
1407 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1413 if (!svp || *svp == &PL_sv_undef) {
1418 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1420 lv = sv_newmortal();
1421 sv_upgrade(lv, SVt_PVLV);
1423 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1424 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1425 LvTARG(lv) = SvREFCNT_inc(hv);
1430 if (PL_op->op_private & OPpLVAL_INTRO) {
1431 if (HvNAME(hv) && isGV(*svp))
1432 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1434 save_helem(hv, keysv, svp);
1436 else if (PL_op->op_private & OPpDEREF)
1437 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1439 sv = (svp ? *svp : &PL_sv_undef);
1440 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1441 * Pushing the magical RHS on to the stack is useless, since
1442 * that magic is soon destined to be misled by the local(),
1443 * and thus the later pp_sassign() will fail to mg_get() the
1444 * old value. This should also cure problems with delayed
1445 * mg_get()s. GSAR 98-07-03 */
1446 if (!lval && SvGMAGICAL(sv))
1447 sv = sv_mortalcopy(sv);
1455 register PERL_CONTEXT *cx;
1461 if (PL_op->op_flags & OPf_SPECIAL) {
1462 cx = &cxstack[cxstack_ix];
1463 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1468 gimme = OP_GIMME(PL_op, -1);
1470 if (cxstack_ix >= 0)
1471 gimme = cxstack[cxstack_ix].blk_gimme;
1477 if (gimme == G_VOID)
1479 else if (gimme == G_SCALAR) {
1482 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1485 *MARK = sv_mortalcopy(TOPs);
1488 *MARK = &PL_sv_undef;
1492 else if (gimme == G_ARRAY) {
1493 /* in case LEAVE wipes old return values */
1494 for (mark = newsp + 1; mark <= SP; mark++) {
1495 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1496 *mark = sv_mortalcopy(*mark);
1497 TAINT_NOT; /* Each item is independent */
1501 PL_curpm = newpm; /* Don't pop $1 et al till now */
1511 register PERL_CONTEXT *cx;
1517 cx = &cxstack[cxstack_ix];
1518 if (CxTYPE(cx) != CXt_LOOP)
1519 DIE(aTHX_ "panic: pp_iter");
1521 itersvp = CxITERVAR(cx);
1522 av = cx->blk_loop.iterary;
1523 if (SvTYPE(av) != SVt_PVAV) {
1524 /* iterate ($min .. $max) */
1525 if (cx->blk_loop.iterlval) {
1526 /* string increment */
1527 register SV* cur = cx->blk_loop.iterlval;
1529 char *max = SvPV((SV*)av, maxlen);
1530 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1531 #ifndef USE_THREADS /* don't risk potential race */
1532 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1533 /* safe to reuse old SV */
1534 sv_setsv(*itersvp, cur);
1539 /* we need a fresh SV every time so that loop body sees a
1540 * completely new SV for closures/references to work as
1542 SvREFCNT_dec(*itersvp);
1543 *itersvp = newSVsv(cur);
1545 if (strEQ(SvPVX(cur), max))
1546 sv_setiv(cur, 0); /* terminate next time */
1553 /* integer increment */
1554 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1557 #ifndef USE_THREADS /* don't risk potential race */
1558 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1559 /* safe to reuse old SV */
1560 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1565 /* we need a fresh SV every time so that loop body sees a
1566 * completely new SV for closures/references to work as they
1568 SvREFCNT_dec(*itersvp);
1569 *itersvp = newSViv(cx->blk_loop.iterix++);
1575 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1578 SvREFCNT_dec(*itersvp);
1580 if (sv = (SvMAGICAL(av))
1581 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1582 : AvARRAY(av)[++cx->blk_loop.iterix])
1586 if (av != PL_curstack && SvIMMORTAL(sv)) {
1587 SV *lv = cx->blk_loop.iterlval;
1588 if (lv && SvREFCNT(lv) > 1) {
1593 SvREFCNT_dec(LvTARG(lv));
1595 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1596 sv_upgrade(lv, SVt_PVLV);
1598 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1600 LvTARG(lv) = SvREFCNT_inc(av);
1601 LvTARGOFF(lv) = cx->blk_loop.iterix;
1602 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1606 *itersvp = SvREFCNT_inc(sv);
1613 register PMOP *pm = cPMOP;
1629 register REGEXP *rx = pm->op_pmregexp;
1631 int force_on_match = 0;
1632 I32 oldsave = PL_savestack_ix;
1633 I32 update_minmatch = 1;
1635 /* known replacement string? */
1636 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1637 if (PL_op->op_flags & OPf_STACKED)
1643 if (SvREADONLY(TARG)
1644 || (SvTYPE(TARG) > SVt_PVLV
1645 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1646 DIE(aTHX_ PL_no_modify);
1649 s = SvPV(TARG, len);
1650 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1652 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1653 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1660 DIE(aTHX_ "panic: do_subst");
1663 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1664 position, once with zero-length,
1665 second time with non-zero. */
1667 if (!rx->prelen && PL_curpm) {
1669 rx = pm->op_pmregexp;
1671 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1672 ? REXEC_COPY_STR : 0;
1674 r_flags |= REXEC_SCREAM;
1675 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1676 SAVEINT(PL_multiline);
1677 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1680 if (rx->reganch & RE_USE_INTUIT) {
1681 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1685 /* How to do it in subst? */
1686 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1688 && ((rx->reganch & ROPT_NOSCAN)
1689 || !((rx->reganch & RE_INTUIT_TAIL)
1690 && (r_flags & REXEC_SCREAM))))
1695 /* only replace once? */
1696 once = !(rpm->op_pmflags & PMf_GLOBAL);
1698 /* known replacement string? */
1699 c = dstr ? SvPV(dstr, clen) : Nullch;
1701 /* can do inplace substitution? */
1702 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1703 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1704 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1705 r_flags | REXEC_CHECKED))
1709 LEAVE_SCOPE(oldsave);
1712 if (force_on_match) {
1714 s = SvPV_force(TARG, len);
1719 SvSCREAM_off(TARG); /* disable possible screamer */
1721 rxtainted |= RX_MATCH_TAINTED(rx);
1722 m = orig + rx->startp[0];
1723 d = orig + rx->endp[0];
1725 if (m - s > strend - d) { /* faster to shorten from end */
1727 Copy(c, m, clen, char);
1732 Move(d, m, i, char);
1736 SvCUR_set(TARG, m - s);
1739 else if (i = m - s) { /* faster from front */
1747 Copy(c, m, clen, char);
1752 Copy(c, d, clen, char);
1757 TAINT_IF(rxtainted & 1);
1763 if (iters++ > maxiters)
1764 DIE(aTHX_ "Substitution loop");
1765 rxtainted |= RX_MATCH_TAINTED(rx);
1766 m = rx->startp[0] + orig;
1770 Move(s, d, i, char);
1774 Copy(c, d, clen, char);
1777 s = rx->endp[0] + orig;
1778 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1780 /* don't match same null twice */
1781 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1784 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1785 Move(s, d, i+1, char); /* include the NUL */
1787 TAINT_IF(rxtainted & 1);
1789 PUSHs(sv_2mortal(newSViv((I32)iters)));
1791 (void)SvPOK_only(TARG);
1792 TAINT_IF(rxtainted);
1793 if (SvSMAGICAL(TARG)) {
1799 LEAVE_SCOPE(oldsave);
1803 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1804 r_flags | REXEC_CHECKED))
1806 if (force_on_match) {
1808 s = SvPV_force(TARG, len);
1811 rxtainted |= RX_MATCH_TAINTED(rx);
1812 dstr = NEWSV(25, len);
1813 sv_setpvn(dstr, m, s-m);
1816 register PERL_CONTEXT *cx;
1819 RETURNOP(cPMOP->op_pmreplroot);
1821 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1823 if (iters++ > maxiters)
1824 DIE(aTHX_ "Substitution loop");
1825 rxtainted |= RX_MATCH_TAINTED(rx);
1826 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1831 strend = s + (strend - m);
1833 m = rx->startp[0] + orig;
1834 sv_catpvn(dstr, s, m-s);
1835 s = rx->endp[0] + orig;
1837 sv_catpvn(dstr, c, clen);
1840 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1841 sv_catpvn(dstr, s, strend - s);
1843 (void)SvOOK_off(TARG);
1844 Safefree(SvPVX(TARG));
1845 SvPVX(TARG) = SvPVX(dstr);
1846 SvCUR_set(TARG, SvCUR(dstr));
1847 SvLEN_set(TARG, SvLEN(dstr));
1851 TAINT_IF(rxtainted & 1);
1853 PUSHs(sv_2mortal(newSViv((I32)iters)));
1855 (void)SvPOK_only(TARG);
1856 TAINT_IF(rxtainted);
1859 LEAVE_SCOPE(oldsave);
1868 LEAVE_SCOPE(oldsave);
1877 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1878 ++*PL_markstack_ptr;
1879 LEAVE; /* exit inner scope */
1882 if (PL_stack_base + *PL_markstack_ptr > SP) {
1884 I32 gimme = GIMME_V;
1886 LEAVE; /* exit outer scope */
1887 (void)POPMARK; /* pop src */
1888 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1889 (void)POPMARK; /* pop dst */
1890 SP = PL_stack_base + POPMARK; /* pop original mark */
1891 if (gimme == G_SCALAR) {
1895 else if (gimme == G_ARRAY)
1902 ENTER; /* enter inner scope */
1905 src = PL_stack_base[*PL_markstack_ptr];
1909 RETURNOP(cLOGOP->op_other);
1920 register PERL_CONTEXT *cx;
1926 if (gimme == G_SCALAR) {
1929 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1931 *MARK = SvREFCNT_inc(TOPs);
1937 *MARK = sv_mortalcopy(TOPs);
1941 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1945 *MARK = &PL_sv_undef;
1949 else if (gimme == G_ARRAY) {
1950 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1951 if (!SvTEMP(*MARK)) {
1952 *MARK = sv_mortalcopy(*MARK);
1953 TAINT_NOT; /* Each item is independent */
1959 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
1960 PL_curpm = newpm; /* ... and pop $1 et al */
1964 return pop_return();
1967 /* This duplicates the above code because the above code must not
1968 * get any slower by more conditions */
1976 register PERL_CONTEXT *cx;
1983 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
1984 /* We are an argument to a function or grep().
1985 * This kind of lvalueness was legal before lvalue
1986 * subroutines too, so be backward compatible:
1987 * cannot report errors. */
1989 /* Scalar context *is* possible, on the LHS of -> only,
1990 * as in f()->meth(). But this is not an lvalue. */
1991 if (gimme == G_SCALAR)
1993 if (gimme == G_ARRAY) {
1994 if (!CvLVALUE(cx->blk_sub.cv))
1995 goto temporise_array;
1996 EXTEND_MORTAL(SP - newsp);
1997 for (mark = newsp + 1; mark <= SP; mark++) {
2000 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2001 *mark = sv_mortalcopy(*mark);
2003 /* Can be a localized value subject to deletion. */
2004 PL_tmps_stack[++PL_tmps_ix] = *mark;
2005 (void)SvREFCNT_inc(*mark);
2010 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2011 /* Here we go for robustness, not for speed, so we change all
2012 * the refcounts so the caller gets a live guy. Cannot set
2013 * TEMP, so sv_2mortal is out of question. */
2014 if (!CvLVALUE(cx->blk_sub.cv)) {
2019 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2021 if (gimme == G_SCALAR) {
2025 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2030 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2031 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2033 else { /* Can be a localized value
2034 * subject to deletion. */
2035 PL_tmps_stack[++PL_tmps_ix] = *mark;
2036 (void)SvREFCNT_inc(*mark);
2039 else { /* Should not happen? */
2044 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2045 (MARK > SP ? "Empty array" : "Array"));
2049 else if (gimme == G_ARRAY) {
2050 EXTEND_MORTAL(SP - newsp);
2051 for (mark = newsp + 1; mark <= SP; mark++) {
2052 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2053 /* Might be flattened array after $#array = */
2059 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2060 (*mark != &PL_sv_undef)
2062 ? "a readonly value" : "a temporary")
2063 : "an uninitialized value");
2067 /* Can be a localized value subject to deletion. */
2068 PL_tmps_stack[++PL_tmps_ix] = *mark;
2069 (void)SvREFCNT_inc(*mark);
2075 if (gimme == G_SCALAR) {
2079 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2081 *MARK = SvREFCNT_inc(TOPs);
2087 *MARK = sv_mortalcopy(TOPs);
2091 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2095 *MARK = &PL_sv_undef;
2099 else if (gimme == G_ARRAY) {
2101 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2102 if (!SvTEMP(*MARK)) {
2103 *MARK = sv_mortalcopy(*MARK);
2104 TAINT_NOT; /* Each item is independent */
2111 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2112 PL_curpm = newpm; /* ... and pop $1 et al */
2116 return pop_return();
2121 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2124 SV *dbsv = GvSV(PL_DBsub);
2126 if (!PERLDB_SUB_NN) {
2130 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2131 || strEQ(GvNAME(gv), "END")
2132 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2133 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2134 && (gv = (GV*)*svp) ))) {
2135 /* Use GV from the stack as a fallback. */
2136 /* GV is potentially non-unique, or contain different CV. */
2137 sv_setsv(dbsv, newRV((SV*)cv));
2140 gv_efullname3(dbsv, gv, Nullch);
2144 SvUPGRADE(dbsv, SVt_PVIV);
2146 SAVEIV(SvIVX(dbsv));
2147 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2151 PL_curcopdb = PL_curcop;
2152 cv = GvCV(PL_DBsub);
2162 register PERL_CONTEXT *cx;
2164 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2167 DIE(aTHX_ "Not a CODE reference");
2168 switch (SvTYPE(sv)) {
2174 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2176 SP = PL_stack_base + POPMARK;
2179 if (SvGMAGICAL(sv)) {
2181 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2184 sym = SvPV(sv, n_a);
2186 DIE(aTHX_ PL_no_usym, "a subroutine");
2187 if (PL_op->op_private & HINT_STRICT_REFS)
2188 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2189 cv = get_cv(sym, TRUE);
2193 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2194 tryAMAGICunDEREF(to_cv);
2197 if (SvTYPE(cv) == SVt_PVCV)
2202 DIE(aTHX_ "Not a CODE reference");
2207 if (!(cv = GvCVu((GV*)sv)))
2208 cv = sv_2cv(sv, &stash, &gv, FALSE);
2221 if (!CvROOT(cv) && !CvXSUB(cv)) {
2225 /* anonymous or undef'd function leaves us no recourse */
2226 if (CvANON(cv) || !(gv = CvGV(cv)))
2227 DIE(aTHX_ "Undefined subroutine called");
2229 /* autoloaded stub? */
2230 if (cv != GvCV(gv)) {
2233 /* should call AUTOLOAD now? */
2236 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2243 sub_name = sv_newmortal();
2244 gv_efullname3(sub_name, gv, Nullch);
2245 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2249 DIE(aTHX_ "Not a CODE reference");
2254 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2255 cv = get_db_sub(&sv, cv);
2257 DIE(aTHX_ "No DBsub routine");
2262 * First we need to check if the sub or method requires locking.
2263 * If so, we gain a lock on the CV, the first argument or the
2264 * stash (for static methods), as appropriate. This has to be
2265 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2266 * reschedule by returning a new op.
2268 MUTEX_LOCK(CvMUTEXP(cv));
2269 if (CvFLAGS(cv) & CVf_LOCKED) {
2271 if (CvFLAGS(cv) & CVf_METHOD) {
2272 if (SP > PL_stack_base + TOPMARK)
2273 sv = *(PL_stack_base + TOPMARK + 1);
2275 AV *av = (AV*)PL_curpad[0];
2276 if (hasargs || !av || AvFILLp(av) < 0
2277 || !(sv = AvARRAY(av)[0]))
2279 MUTEX_UNLOCK(CvMUTEXP(cv));
2280 DIE(aTHX_ "no argument for locked method call");
2287 char *stashname = SvPV(sv, len);
2288 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2294 MUTEX_UNLOCK(CvMUTEXP(cv));
2295 mg = condpair_magic(sv);
2296 MUTEX_LOCK(MgMUTEXP(mg));
2297 if (MgOWNER(mg) == thr)
2298 MUTEX_UNLOCK(MgMUTEXP(mg));
2301 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2303 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2305 MUTEX_UNLOCK(MgMUTEXP(mg));
2306 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2308 MUTEX_LOCK(CvMUTEXP(cv));
2311 * Now we have permission to enter the sub, we must distinguish
2312 * four cases. (0) It's an XSUB (in which case we don't care
2313 * about ownership); (1) it's ours already (and we're recursing);
2314 * (2) it's free (but we may already be using a cached clone);
2315 * (3) another thread owns it. Case (1) is easy: we just use it.
2316 * Case (2) means we look for a clone--if we have one, use it
2317 * otherwise grab ownership of cv. Case (3) means we look for a
2318 * clone (for non-XSUBs) and have to create one if we don't
2320 * Why look for a clone in case (2) when we could just grab
2321 * ownership of cv straight away? Well, we could be recursing,
2322 * i.e. we originally tried to enter cv while another thread
2323 * owned it (hence we used a clone) but it has been freed up
2324 * and we're now recursing into it. It may or may not be "better"
2325 * to use the clone but at least CvDEPTH can be trusted.
2327 if (CvOWNER(cv) == thr || CvXSUB(cv))
2328 MUTEX_UNLOCK(CvMUTEXP(cv));
2330 /* Case (2) or (3) */
2334 * XXX Might it be better to release CvMUTEXP(cv) while we
2335 * do the hv_fetch? We might find someone has pinched it
2336 * when we look again, in which case we would be in case
2337 * (3) instead of (2) so we'd have to clone. Would the fact
2338 * that we released the mutex more quickly make up for this?
2340 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2342 /* We already have a clone to use */
2343 MUTEX_UNLOCK(CvMUTEXP(cv));
2345 DEBUG_S(PerlIO_printf(Perl_debug_log,
2346 "entersub: %p already has clone %p:%s\n",
2347 thr, cv, SvPEEK((SV*)cv)));
2350 if (CvDEPTH(cv) == 0)
2351 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2354 /* (2) => grab ownership of cv. (3) => make clone */
2358 MUTEX_UNLOCK(CvMUTEXP(cv));
2359 DEBUG_S(PerlIO_printf(Perl_debug_log,
2360 "entersub: %p grabbing %p:%s in stash %s\n",
2361 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2362 HvNAME(CvSTASH(cv)) : "(none)"));
2365 /* Make a new clone. */
2367 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2368 MUTEX_UNLOCK(CvMUTEXP(cv));
2369 DEBUG_S((PerlIO_printf(Perl_debug_log,
2370 "entersub: %p cloning %p:%s\n",
2371 thr, cv, SvPEEK((SV*)cv))));
2373 * We're creating a new clone so there's no race
2374 * between the original MUTEX_UNLOCK and the
2375 * SvREFCNT_inc since no one will be trying to undef
2376 * it out from underneath us. At least, I don't think
2379 clonecv = cv_clone(cv);
2380 SvREFCNT_dec(cv); /* finished with this */
2381 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2382 CvOWNER(clonecv) = thr;
2386 DEBUG_S(if (CvDEPTH(cv) != 0)
2387 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2389 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2392 #endif /* USE_THREADS */
2395 #ifdef PERL_XSUB_OLDSTYLE
2396 if (CvOLDSTYLE(cv)) {
2397 I32 (*fp3)(int,int,int);
2399 register I32 items = SP - MARK;
2400 /* We dont worry to copy from @_. */
2405 PL_stack_sp = mark + 1;
2406 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2407 items = (*fp3)(CvXSUBANY(cv).any_i32,
2408 MARK - PL_stack_base + 1,
2410 PL_stack_sp = PL_stack_base + items;
2413 #endif /* PERL_XSUB_OLDSTYLE */
2415 I32 markix = TOPMARK;
2420 /* Need to copy @_ to stack. Alternative may be to
2421 * switch stack to @_, and copy return values
2422 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2426 av = (AV*)PL_curpad[0];
2428 av = GvAV(PL_defgv);
2429 #endif /* USE_THREADS */
2430 items = AvFILLp(av) + 1; /* @_ is not tieable */
2433 /* Mark is at the end of the stack. */
2435 Copy(AvARRAY(av), SP + 1, items, SV*);
2440 /* We assume first XSUB in &DB::sub is the called one. */
2442 SAVEVPTR(PL_curcop);
2443 PL_curcop = PL_curcopdb;
2446 /* Do we need to open block here? XXXX */
2447 (void)(*CvXSUB(cv))(aTHXo_ cv);
2449 /* Enforce some sanity in scalar context. */
2450 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2451 if (markix > PL_stack_sp - PL_stack_base)
2452 *(PL_stack_base + markix) = &PL_sv_undef;
2454 *(PL_stack_base + markix) = *PL_stack_sp;
2455 PL_stack_sp = PL_stack_base + markix;
2463 register I32 items = SP - MARK;
2464 AV* padlist = CvPADLIST(cv);
2465 SV** svp = AvARRAY(padlist);
2466 push_return(PL_op->op_next);
2467 PUSHBLOCK(cx, CXt_SUB, MARK);
2470 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2471 * that eval'' ops within this sub know the correct lexical space.
2472 * Owing the speed considerations, we choose to search for the cv
2473 * in doeval() instead.
2475 if (CvDEPTH(cv) < 2)
2476 (void)SvREFCNT_inc(cv);
2477 else { /* save temporaries on recursion? */
2478 PERL_STACK_OVERFLOW_CHECK();
2479 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2481 AV *newpad = newAV();
2482 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2483 I32 ix = AvFILLp((AV*)svp[1]);
2484 I32 names_fill = AvFILLp((AV*)svp[0]);
2485 svp = AvARRAY(svp[0]);
2486 for ( ;ix > 0; ix--) {
2487 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2488 char *name = SvPVX(svp[ix]);
2489 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2490 || *name == '&') /* anonymous code? */
2492 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2494 else { /* our own lexical */
2496 av_store(newpad, ix, sv = (SV*)newAV());
2497 else if (*name == '%')
2498 av_store(newpad, ix, sv = (SV*)newHV());
2500 av_store(newpad, ix, sv = NEWSV(0,0));
2504 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2505 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2508 av_store(newpad, ix, sv = NEWSV(0,0));
2512 av = newAV(); /* will be @_ */
2514 av_store(newpad, 0, (SV*)av);
2515 AvFLAGS(av) = AVf_REIFY;
2516 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2517 AvFILLp(padlist) = CvDEPTH(cv);
2518 svp = AvARRAY(padlist);
2523 AV* av = (AV*)PL_curpad[0];
2525 items = AvFILLp(av) + 1;
2527 /* Mark is at the end of the stack. */
2529 Copy(AvARRAY(av), SP + 1, items, SV*);
2534 #endif /* USE_THREADS */
2535 SAVEVPTR(PL_curpad);
2536 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2539 #endif /* USE_THREADS */
2545 DEBUG_S(PerlIO_printf(Perl_debug_log,
2546 "%p entersub preparing @_\n", thr));
2548 av = (AV*)PL_curpad[0];
2550 /* @_ is normally not REAL--this should only ever
2551 * happen when DB::sub() calls things that modify @_ */
2557 cx->blk_sub.savearray = GvAV(PL_defgv);
2558 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2559 #endif /* USE_THREADS */
2560 cx->blk_sub.argarray = av;
2563 if (items > AvMAX(av) + 1) {
2565 if (AvARRAY(av) != ary) {
2566 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2567 SvPVX(av) = (char*)ary;
2569 if (items > AvMAX(av) + 1) {
2570 AvMAX(av) = items - 1;
2571 Renew(ary,items,SV*);
2573 SvPVX(av) = (char*)ary;
2576 Copy(MARK,AvARRAY(av),items,SV*);
2577 AvFILLp(av) = items - 1;
2585 /* warning must come *after* we fully set up the context
2586 * stuff so that __WARN__ handlers can safely dounwind()
2589 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2590 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2591 sub_crush_depth(cv);
2593 DEBUG_S(PerlIO_printf(Perl_debug_log,
2594 "%p entersub returning %p\n", thr, CvSTART(cv)));
2596 RETURNOP(CvSTART(cv));
2601 Perl_sub_crush_depth(pTHX_ CV *cv)
2604 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2606 SV* tmpstr = sv_newmortal();
2607 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2608 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2619 U32 lval = PL_op->op_flags & OPf_MOD;
2620 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2624 elem -= PL_curcop->cop_arybase;
2625 if (SvTYPE(av) != SVt_PVAV)
2627 svp = av_fetch(av, elem, lval && !defer);
2629 if (!svp || *svp == &PL_sv_undef) {
2632 DIE(aTHX_ PL_no_aelem, elem);
2633 lv = sv_newmortal();
2634 sv_upgrade(lv, SVt_PVLV);
2636 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2637 LvTARG(lv) = SvREFCNT_inc(av);
2638 LvTARGOFF(lv) = elem;
2643 if (PL_op->op_private & OPpLVAL_INTRO)
2644 save_aelem(av, elem, svp);
2645 else if (PL_op->op_private & OPpDEREF)
2646 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2648 sv = (svp ? *svp : &PL_sv_undef);
2649 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2650 sv = sv_mortalcopy(sv);
2656 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2662 Perl_croak(aTHX_ PL_no_modify);
2663 if (SvTYPE(sv) < SVt_RV)
2664 sv_upgrade(sv, SVt_RV);
2665 else if (SvTYPE(sv) >= SVt_PV) {
2666 (void)SvOOK_off(sv);
2667 Safefree(SvPVX(sv));
2668 SvLEN(sv) = SvCUR(sv) = 0;
2672 SvRV(sv) = NEWSV(355,0);
2675 SvRV(sv) = (SV*)newAV();
2678 SvRV(sv) = (SV*)newHV();
2693 if (SvTYPE(rsv) == SVt_PVCV) {
2699 SETs(method_common(sv, Null(U32*)));
2706 SV* sv = cSVOP->op_sv;
2707 U32 hash = SvUVX(sv);
2709 XPUSHs(method_common(sv, &hash));
2714 S_method_common(pTHX_ SV* meth, U32* hashp)
2726 name = SvPV(meth, namelen);
2727 sv = *(PL_stack_base + TOPMARK + 1);
2738 !(packname = SvPV(sv, packlen)) ||
2739 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2740 !(ob=(SV*)GvIO(iogv)))
2743 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2744 ? !isIDFIRST_utf8((U8*)packname)
2745 : !isIDFIRST(*packname)
2748 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2749 SvOK(sv) ? "without a package or object reference"
2750 : "on an undefined value");
2752 stash = gv_stashpvn(packname, packlen, TRUE);
2755 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2758 if (!ob || !SvOBJECT(ob))
2759 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2762 stash = SvSTASH(ob);
2765 /* shortcut for simple names */
2767 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2769 gv = (GV*)HeVAL(he);
2770 if (isGV(gv) && GvCV(gv) &&
2771 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2772 return (SV*)GvCV(gv);
2776 gv = gv_fetchmethod(stash, name);
2782 for (p = name; *p; p++) {
2784 sep = p, leaf = p + 1;
2785 else if (*p == ':' && *(p + 1) == ':')
2786 sep = p, leaf = p + 2;
2788 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2789 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2790 packlen = strlen(packname);
2794 packlen = sep - name;
2797 "Can't locate object method \"%s\" via package \"%s\"",
2800 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2805 unset_cvowner(pTHXo_ void *cvarg)
2807 register CV* cv = (CV *) cvarg;
2810 #endif /* DEBUGGING */
2812 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2813 thr, cv, SvPEEK((SV*)cv))));
2814 MUTEX_LOCK(CvMUTEXP(cv));
2815 DEBUG_S(if (CvDEPTH(cv) != 0)
2816 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2818 assert(thr == CvOWNER(cv));
2820 MUTEX_UNLOCK(CvMUTEXP(cv));
2823 #endif /* USE_THREADS */