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'");
188 sv_utf8_upgrade(TARG);
189 sv_catpvn(TARG,s,len);
194 else if (!SvUTF8(right)) {
199 sv_setpvn(TARG,s,len); /* suppress warning */
209 if (PL_op->op_flags & OPf_MOD) {
210 if (PL_op->op_private & OPpLVAL_INTRO)
211 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
212 else if (PL_op->op_private & OPpDEREF) {
214 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
223 tryAMAGICunTARGET(iter, 0);
224 PL_last_in_gv = (GV*)(*PL_stack_sp--);
225 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
226 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
227 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
230 XPUSHs((SV*)PL_last_in_gv);
233 PL_last_in_gv = (GV*)(*PL_stack_sp--);
236 return do_readline();
241 djSP; tryAMAGICbinSET(eq,0);
244 SETs(boolSV(TOPn == value));
252 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
253 DIE(aTHX_ PL_no_modify);
254 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
255 SvIVX(TOPs) != IV_MAX)
258 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
273 RETURNOP(cLOGOP->op_other);
279 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
282 SETn( left + right );
290 AV *av = GvAV(cGVOP_gv);
291 U32 lval = PL_op->op_flags & OPf_MOD;
292 SV** svp = av_fetch(av, PL_op->op_private, lval);
293 SV *sv = (svp ? *svp : &PL_sv_undef);
295 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
296 sv = sv_mortalcopy(sv);
303 djSP; dMARK; dTARGET;
305 do_join(TARG, *MARK, MARK, SP);
316 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
317 * will be enough to hold an OP*.
319 SV* sv = sv_newmortal();
320 sv_upgrade(sv, SVt_PVLV);
322 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
330 /* Oversized hot code. */
334 djSP; dMARK; dORIGMARK;
341 if (PL_op->op_flags & OPf_STACKED)
345 if (mg = SvTIED_mg((SV*)gv, 'q')) {
346 if (MARK == ORIGMARK) {
347 /* If using default handle then we need to make space to
348 * pass object as 1st arg, so move other args up ...
352 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
356 *MARK = SvTIED_obj((SV*)gv, mg);
359 call_method("PRINT", G_SCALAR);
367 if (!(io = GvIO(gv))) {
368 if (ckWARN(WARN_UNOPENED)) {
369 SV* sv = sv_newmortal();
370 gv_efullname3(sv, gv, Nullch);
371 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
374 SETERRNO(EBADF,RMS$_IFI);
377 else if (!(fp = IoOFP(io))) {
378 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
380 SV* sv = sv_newmortal();
381 gv_efullname3(sv, gv, Nullch);
382 Perl_warner(aTHX_ WARN_IO,
383 "Filehandle %s opened only for input",
386 else if (ckWARN(WARN_CLOSED))
387 report_closed_fh(gv, io, "print", "filehandle");
389 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
396 if (!do_print(*MARK, fp))
400 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
409 if (!do_print(*MARK, fp))
418 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
421 if (IoFLAGS(io) & IOf_FLUSH)
422 if (PerlIO_flush(fp) == EOF)
443 tryAMAGICunDEREF(to_av);
446 if (SvTYPE(av) != SVt_PVAV)
447 DIE(aTHX_ "Not an ARRAY reference");
448 if (PL_op->op_flags & OPf_REF) {
454 if (SvTYPE(sv) == SVt_PVAV) {
456 if (PL_op->op_flags & OPf_REF) {
464 if (SvTYPE(sv) != SVt_PVGV) {
468 if (SvGMAGICAL(sv)) {
474 if (PL_op->op_flags & OPf_REF ||
475 PL_op->op_private & HINT_STRICT_REFS)
476 DIE(aTHX_ PL_no_usym, "an ARRAY");
477 if (ckWARN(WARN_UNINITIALIZED))
479 if (GIMME == G_ARRAY) {
486 if ((PL_op->op_flags & OPf_SPECIAL) &&
487 !(PL_op->op_flags & OPf_MOD))
489 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
494 if (PL_op->op_private & HINT_STRICT_REFS)
495 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
496 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
503 if (PL_op->op_private & OPpLVAL_INTRO)
505 if (PL_op->op_flags & OPf_REF) {
512 if (GIMME == G_ARRAY) {
513 I32 maxarg = AvFILL(av) + 1;
514 (void)POPs; /* XXXX May be optimized away? */
516 if (SvRMAGICAL(av)) {
518 for (i=0; i < maxarg; i++) {
519 SV **svp = av_fetch(av, i, FALSE);
520 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
524 Copy(AvARRAY(av), SP+1, maxarg, SV*);
530 I32 maxarg = AvFILL(av) + 1;
543 tryAMAGICunDEREF(to_hv);
546 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
547 DIE(aTHX_ "Not a HASH reference");
548 if (PL_op->op_flags & OPf_REF) {
554 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
556 if (PL_op->op_flags & OPf_REF) {
564 if (SvTYPE(sv) != SVt_PVGV) {
568 if (SvGMAGICAL(sv)) {
574 if (PL_op->op_flags & OPf_REF ||
575 PL_op->op_private & HINT_STRICT_REFS)
576 DIE(aTHX_ PL_no_usym, "a HASH");
577 if (ckWARN(WARN_UNINITIALIZED))
579 if (GIMME == G_ARRAY) {
586 if ((PL_op->op_flags & OPf_SPECIAL) &&
587 !(PL_op->op_flags & OPf_MOD))
589 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
594 if (PL_op->op_private & HINT_STRICT_REFS)
595 DIE(aTHX_ PL_no_symref, sym, "a HASH");
596 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
603 if (PL_op->op_private & OPpLVAL_INTRO)
605 if (PL_op->op_flags & OPf_REF) {
612 if (GIMME == G_ARRAY) { /* array wanted */
613 *PL_stack_sp = (SV*)hv;
618 if (SvTYPE(hv) == SVt_PVAV)
619 hv = avhv_keys((AV*)hv);
621 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
622 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
634 SV **lastlelem = PL_stack_sp;
635 SV **lastrelem = PL_stack_base + POPMARK;
636 SV **firstrelem = PL_stack_base + POPMARK + 1;
637 SV **firstlelem = lastrelem + 1;
650 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
652 /* If there's a common identifier on both sides we have to take
653 * special care that assigning the identifier on the left doesn't
654 * clobber a value on the right that's used later in the list.
656 if (PL_op->op_private & OPpASSIGN_COMMON) {
657 EXTEND_MORTAL(lastrelem - firstrelem + 1);
658 for (relem = firstrelem; relem <= lastrelem; relem++) {
661 TAINT_NOT; /* Each item is independent */
662 *relem = sv_mortalcopy(sv);
671 while (lelem <= lastlelem) {
672 TAINT_NOT; /* Each item stands on its own, taintwise. */
674 switch (SvTYPE(sv)) {
677 magic = SvMAGICAL(ary) != 0;
680 av_extend(ary, lastrelem - relem);
682 while (relem <= lastrelem) { /* gobble up all the rest */
688 didstore = av_store(ary,i++,sv);
702 magic = SvMAGICAL(hash) != 0;
705 while (relem < lastrelem) { /* gobble up all the rest */
710 sv = &PL_sv_no, relem++;
711 tmpstr = NEWSV(29,0);
713 sv_setsv(tmpstr,*relem); /* value */
715 didstore = hv_store_ent(hash,sv,tmpstr,0);
717 if (SvSMAGICAL(tmpstr))
724 if (relem == lastrelem) {
727 if (ckWARN(WARN_UNSAFE)) {
728 if (relem == firstrelem &&
730 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
731 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
732 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
734 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
736 tmpstr = NEWSV(29,0);
737 didstore = hv_store_ent(hash,*relem,tmpstr,0);
739 if (SvSMAGICAL(tmpstr))
751 if (SvIMMORTAL(sv)) {
752 if (relem <= lastrelem)
756 if (relem <= lastrelem) {
757 sv_setsv(sv, *relem);
761 sv_setsv(sv, &PL_sv_undef);
766 if (PL_delaymagic & ~DM_DELAY) {
767 if (PL_delaymagic & DM_UID) {
769 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
772 (void)setreuid(PL_uid,PL_euid);
775 if ((PL_delaymagic & DM_UID) == DM_RUID) {
776 (void)setruid(PL_uid);
777 PL_delaymagic &= ~DM_RUID;
779 # endif /* HAS_SETRUID */
781 if ((PL_delaymagic & DM_UID) == DM_EUID) {
782 (void)seteuid(PL_uid);
783 PL_delaymagic &= ~DM_EUID;
785 # endif /* HAS_SETEUID */
786 if (PL_delaymagic & DM_UID) {
787 if (PL_uid != PL_euid)
788 DIE(aTHX_ "No setreuid available");
789 (void)PerlProc_setuid(PL_uid);
791 # endif /* HAS_SETREUID */
792 #endif /* HAS_SETRESUID */
793 PL_uid = PerlProc_getuid();
794 PL_euid = PerlProc_geteuid();
796 if (PL_delaymagic & DM_GID) {
798 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
801 (void)setregid(PL_gid,PL_egid);
804 if ((PL_delaymagic & DM_GID) == DM_RGID) {
805 (void)setrgid(PL_gid);
806 PL_delaymagic &= ~DM_RGID;
808 # endif /* HAS_SETRGID */
810 if ((PL_delaymagic & DM_GID) == DM_EGID) {
811 (void)setegid(PL_gid);
812 PL_delaymagic &= ~DM_EGID;
814 # endif /* HAS_SETEGID */
815 if (PL_delaymagic & DM_GID) {
816 if (PL_gid != PL_egid)
817 DIE(aTHX_ "No setregid available");
818 (void)PerlProc_setgid(PL_gid);
820 # endif /* HAS_SETREGID */
821 #endif /* HAS_SETRESGID */
822 PL_gid = PerlProc_getgid();
823 PL_egid = PerlProc_getegid();
825 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
832 else if (gimme == G_SCALAR) {
835 SETi(lastrelem - firstrelem + 1);
841 SP = firstrelem + (lastlelem - firstlelem);
842 lelem = firstlelem + (relem - firstrelem);
844 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
852 register PMOP *pm = cPMOP;
853 SV *rv = sv_newmortal();
854 SV *sv = newSVrv(rv, "Regexp");
855 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
862 register PMOP *pm = cPMOP;
867 I32 r_flags = REXEC_CHECKED;
868 char *truebase; /* Start of string */
869 register REGEXP *rx = pm->op_pmregexp;
874 I32 oldsave = PL_savestack_ix;
875 I32 update_minmatch = 1;
878 if (PL_op->op_flags & OPf_STACKED)
884 PUTBACK; /* EVAL blocks need stack_sp. */
888 DIE(aTHX_ "panic: do_match");
889 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
890 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
893 if (pm->op_pmdynflags & PMdf_USED) {
895 if (gimme == G_ARRAY)
900 if (!rx->prelen && PL_curpm) {
902 rx = pm->op_pmregexp;
904 if (rx->minlen > len) goto failure;
908 /* XXXX What part of this is needed with true \G-support? */
909 if (global = pm->op_pmflags & PMf_GLOBAL) {
911 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
912 MAGIC* mg = mg_find(TARG, 'g');
913 if (mg && mg->mg_len >= 0) {
914 if (!(rx->reganch & ROPT_GPOS_SEEN))
915 rx->endp[0] = rx->startp[0] = mg->mg_len;
916 else if (rx->reganch & ROPT_ANCH_GPOS) {
917 r_flags |= REXEC_IGNOREPOS;
918 rx->endp[0] = rx->startp[0] = mg->mg_len;
920 minmatch = (mg->mg_flags & MGf_MINMATCH);
925 if ((gimme != G_ARRAY && !global && rx->nparens)
926 || SvTEMP(TARG) || PL_sawampersand)
927 r_flags |= REXEC_COPY_STR;
929 r_flags |= REXEC_SCREAM;
931 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
932 SAVEINT(PL_multiline);
933 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
937 if (global && rx->startp[0] != -1) {
938 t = s = rx->endp[0] + truebase;
939 if ((s + rx->minlen) > strend)
941 if (update_minmatch++)
942 minmatch = had_zerolen;
944 if (rx->reganch & RE_USE_INTUIT) {
945 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
949 if ( (rx->reganch & ROPT_CHECK_ALL)
951 && ((rx->reganch & ROPT_NOSCAN)
952 || !((rx->reganch & RE_INTUIT_TAIL)
953 && (r_flags & REXEC_SCREAM))))
956 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
959 if (pm->op_pmflags & PMf_ONCE)
960 pm->op_pmdynflags |= PMdf_USED;
969 RX_MATCH_TAINTED_on(rx);
970 TAINT_IF(RX_MATCH_TAINTED(rx));
971 if (gimme == G_ARRAY) {
975 if (global && !iters)
979 SPAGAIN; /* EVAL blocks could move the stack. */
980 EXTEND(SP, iters + i);
981 EXTEND_MORTAL(iters + i);
982 for (i = !i; i <= iters; i++) {
983 PUSHs(sv_newmortal());
985 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
986 len = rx->endp[i] - rx->startp[i];
987 s = rx->startp[i] + truebase;
988 sv_setpvn(*SP, s, len);
992 had_zerolen = (rx->startp[0] != -1
993 && rx->startp[0] == rx->endp[0]);
994 PUTBACK; /* EVAL blocks may use stack */
995 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1000 LEAVE_SCOPE(oldsave);
1006 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1007 mg = mg_find(TARG, 'g');
1009 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1010 mg = mg_find(TARG, 'g');
1012 if (rx->startp[0] != -1) {
1013 mg->mg_len = rx->endp[0];
1014 if (rx->startp[0] == rx->endp[0])
1015 mg->mg_flags |= MGf_MINMATCH;
1017 mg->mg_flags &= ~MGf_MINMATCH;
1020 LEAVE_SCOPE(oldsave);
1024 yup: /* Confirmed by INTUIT */
1026 RX_MATCH_TAINTED_on(rx);
1027 TAINT_IF(RX_MATCH_TAINTED(rx));
1029 if (pm->op_pmflags & PMf_ONCE)
1030 pm->op_pmdynflags |= PMdf_USED;
1031 if (RX_MATCH_COPIED(rx))
1032 Safefree(rx->subbeg);
1033 RX_MATCH_COPIED_off(rx);
1034 rx->subbeg = Nullch;
1036 rx->subbeg = truebase;
1037 rx->startp[0] = s - truebase;
1038 rx->endp[0] = s - truebase + rx->minlen;
1039 rx->sublen = strend - truebase;
1042 if (PL_sawampersand) {
1045 rx->subbeg = savepvn(t, strend - t);
1046 rx->sublen = strend - t;
1047 RX_MATCH_COPIED_on(rx);
1048 off = rx->startp[0] = s - t;
1049 rx->endp[0] = off + rx->minlen;
1051 else { /* startp/endp are used by @- @+. */
1052 rx->startp[0] = s - truebase;
1053 rx->endp[0] = s - truebase + rx->minlen;
1055 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1056 LEAVE_SCOPE(oldsave);
1061 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1062 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1063 MAGIC* mg = mg_find(TARG, 'g');
1068 LEAVE_SCOPE(oldsave);
1069 if (gimme == G_ARRAY)
1075 Perl_do_readline(pTHX)
1077 dSP; dTARGETSTACKED;
1082 register IO *io = GvIO(PL_last_in_gv);
1083 register I32 type = PL_op->op_type;
1084 I32 gimme = GIMME_V;
1087 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1089 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1092 call_method("READLINE", gimme);
1095 if (gimme == G_SCALAR)
1096 SvSetMagicSV_nosteal(TARG, TOPs);
1103 if (IoFLAGS(io) & IOf_ARGV) {
1104 if (IoFLAGS(io) & IOf_START) {
1106 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1107 IoFLAGS(io) &= ~IOf_START;
1108 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1109 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1110 SvSETMAGIC(GvSV(PL_last_in_gv));
1115 fp = nextargv(PL_last_in_gv);
1116 if (!fp) { /* Note: fp != IoIFP(io) */
1117 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1120 else if (type == OP_GLOB) {
1121 SV *tmpcmd = NEWSV(55, 0);
1125 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1126 /* since spawning off a process is a real performance hit */
1128 #include <descrip.h>
1129 #include <lib$routines.h>
1132 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1133 char vmsspec[NAM$C_MAXRSS+1];
1134 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1135 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1136 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1139 struct dsc$descriptor_s wilddsc
1140 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1141 struct dsc$descriptor_vs rsdsc
1142 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1143 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1145 /* We could find out if there's an explicit dev/dir or version
1146 by peeking into lib$find_file's internal context at
1147 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1148 but that's unsupported, so I don't want to do it now and
1149 have it bite someone in the future. */
1150 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1151 cp = SvPV(tmpglob,i);
1153 if (cp[i] == ';') hasver = 1;
1155 if (sts) hasver = 1;
1159 hasdir = isunix = 1;
1162 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1167 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1169 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1170 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1171 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1172 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1173 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1174 &dfltdsc,NULL,NULL,NULL))&1)) {
1175 end = rstr + (unsigned long int) *rslt;
1176 if (!hasver) while (*end != ';') end--;
1177 *(end++) = '\n'; *end = '\0';
1178 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1180 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1185 while (*(--begin) != ']' && *begin != '>') ;
1188 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1190 if (cxt) (void)lib$find_file_end(&cxt);
1191 if (ok && sts != RMS$_NMF &&
1192 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1195 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1197 PerlIO_close(tmpfp);
1201 PerlIO_rewind(tmpfp);
1203 IoIFP(io) = fp = tmpfp;
1204 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1209 #ifdef MACOS_TRADITIONAL
1210 sv_setpv(tmpcmd, "glob ");
1211 sv_catsv(tmpcmd, tmpglob);
1212 sv_catpv(tmpcmd, " |");
1216 sv_setpv(tmpcmd, "for a in ");
1217 sv_catsv(tmpcmd, tmpglob);
1218 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1221 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1222 sv_catsv(tmpcmd, tmpglob);
1224 sv_setpv(tmpcmd, "perlglob ");
1225 sv_catsv(tmpcmd, tmpglob);
1226 sv_catpv(tmpcmd, " |");
1231 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1232 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1233 sv_catsv(tmpcmd, tmpglob);
1234 sv_catpv(tmpcmd, "' 2>/dev/null |");
1236 sv_setpv(tmpcmd, "echo ");
1237 sv_catsv(tmpcmd, tmpglob);
1239 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1241 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1244 #endif /* !DOSISH */
1245 #endif /* MACOS_TRADITIONAL */
1246 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1247 FALSE, O_RDONLY, 0, Nullfp);
1253 else if (type == OP_GLOB)
1255 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1256 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1257 || fp == PerlIO_stderr()))
1259 SV* sv = sv_newmortal();
1260 gv_efullname3(sv, PL_last_in_gv, Nullch);
1261 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1266 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1267 if (type == OP_GLOB)
1268 Perl_warner(aTHX_ WARN_CLOSED,
1269 "glob failed (can't start child: %s)",
1272 report_closed_fh(PL_last_in_gv, io, "readline", "filehandle");
1274 if (gimme == G_SCALAR) {
1275 (void)SvOK_off(TARG);
1281 if (gimme == G_SCALAR) {
1285 (void)SvUPGRADE(sv, SVt_PV);
1286 tmplen = SvLEN(sv); /* remember if already alloced */
1288 Sv_Grow(sv, 80); /* try short-buffering it */
1289 if (type == OP_RCATLINE)
1295 sv = sv_2mortal(NEWSV(57, 80));
1299 /* delay EOF state for a snarfed empty file */
1300 #define SNARF_EOF(gimme,rs,io,sv) \
1301 (gimme != G_SCALAR || SvCUR(sv) \
1302 || !RsSNARF(rs) || (IoFLAGS(io) & IOf_NOLINE) \
1303 || ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1306 if (!sv_gets(sv, fp, offset)
1307 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1309 PerlIO_clearerr(fp);
1310 if (IoFLAGS(io) & IOf_ARGV) {
1311 fp = nextargv(PL_last_in_gv);
1314 (void)do_close(PL_last_in_gv, FALSE);
1316 else if (type == OP_GLOB) {
1317 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1318 Perl_warner(aTHX_ WARN_CLOSED,
1319 "glob failed (child exited with status %d%s)",
1320 (int)(STATUS_CURRENT >> 8),
1321 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1324 if (gimme == G_SCALAR) {
1325 (void)SvOK_off(TARG);
1330 /* This should not be marked tainted if the fp is marked clean */
1331 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1338 if (type == OP_GLOB) {
1341 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1342 tmps = SvEND(sv) - 1;
1343 if (*tmps == *SvPVX(PL_rs)) {
1348 for (tmps = SvPVX(sv); *tmps; tmps++)
1349 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1350 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1352 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1353 (void)POPs; /* Unmatched wildcard? Chuck it... */
1357 if (gimme == G_ARRAY) {
1358 if (SvLEN(sv) - SvCUR(sv) > 20) {
1359 SvLEN_set(sv, SvCUR(sv)+1);
1360 Renew(SvPVX(sv), SvLEN(sv), char);
1362 sv = sv_2mortal(NEWSV(58, 80));
1365 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1366 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1370 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1371 Renew(SvPVX(sv), SvLEN(sv), char);
1380 register PERL_CONTEXT *cx;
1381 I32 gimme = OP_GIMME(PL_op, -1);
1384 if (cxstack_ix >= 0)
1385 gimme = cxstack[cxstack_ix].blk_gimme;
1393 PUSHBLOCK(cx, CXt_BLOCK, SP);
1405 U32 lval = PL_op->op_flags & OPf_MOD;
1406 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1409 if (SvTYPE(hv) == SVt_PVHV) {
1410 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1411 svp = he ? &HeVAL(he) : 0;
1413 else if (SvTYPE(hv) == SVt_PVAV) {
1414 if (PL_op->op_private & OPpLVAL_INTRO)
1415 DIE(aTHX_ "Can't localize pseudo-hash element");
1416 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1422 if (!svp || *svp == &PL_sv_undef) {
1427 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1429 lv = sv_newmortal();
1430 sv_upgrade(lv, SVt_PVLV);
1432 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1433 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1434 LvTARG(lv) = SvREFCNT_inc(hv);
1439 if (PL_op->op_private & OPpLVAL_INTRO) {
1440 if (HvNAME(hv) && isGV(*svp))
1441 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1443 save_helem(hv, keysv, svp);
1445 else if (PL_op->op_private & OPpDEREF)
1446 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1448 sv = (svp ? *svp : &PL_sv_undef);
1449 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1450 * Pushing the magical RHS on to the stack is useless, since
1451 * that magic is soon destined to be misled by the local(),
1452 * and thus the later pp_sassign() will fail to mg_get() the
1453 * old value. This should also cure problems with delayed
1454 * mg_get()s. GSAR 98-07-03 */
1455 if (!lval && SvGMAGICAL(sv))
1456 sv = sv_mortalcopy(sv);
1464 register PERL_CONTEXT *cx;
1470 if (PL_op->op_flags & OPf_SPECIAL) {
1471 cx = &cxstack[cxstack_ix];
1472 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1477 gimme = OP_GIMME(PL_op, -1);
1479 if (cxstack_ix >= 0)
1480 gimme = cxstack[cxstack_ix].blk_gimme;
1486 if (gimme == G_VOID)
1488 else if (gimme == G_SCALAR) {
1491 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1494 *MARK = sv_mortalcopy(TOPs);
1497 *MARK = &PL_sv_undef;
1501 else if (gimme == G_ARRAY) {
1502 /* in case LEAVE wipes old return values */
1503 for (mark = newsp + 1; mark <= SP; mark++) {
1504 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1505 *mark = sv_mortalcopy(*mark);
1506 TAINT_NOT; /* Each item is independent */
1510 PL_curpm = newpm; /* Don't pop $1 et al till now */
1520 register PERL_CONTEXT *cx;
1526 cx = &cxstack[cxstack_ix];
1527 if (CxTYPE(cx) != CXt_LOOP)
1528 DIE(aTHX_ "panic: pp_iter");
1530 itersvp = CxITERVAR(cx);
1531 av = cx->blk_loop.iterary;
1532 if (SvTYPE(av) != SVt_PVAV) {
1533 /* iterate ($min .. $max) */
1534 if (cx->blk_loop.iterlval) {
1535 /* string increment */
1536 register SV* cur = cx->blk_loop.iterlval;
1538 char *max = SvPV((SV*)av, maxlen);
1539 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1540 #ifndef USE_THREADS /* don't risk potential race */
1541 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1542 /* safe to reuse old SV */
1543 sv_setsv(*itersvp, cur);
1548 /* we need a fresh SV every time so that loop body sees a
1549 * completely new SV for closures/references to work as
1551 SvREFCNT_dec(*itersvp);
1552 *itersvp = newSVsv(cur);
1554 if (strEQ(SvPVX(cur), max))
1555 sv_setiv(cur, 0); /* terminate next time */
1562 /* integer increment */
1563 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1566 #ifndef USE_THREADS /* don't risk potential race */
1567 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1568 /* safe to reuse old SV */
1569 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1574 /* we need a fresh SV every time so that loop body sees a
1575 * completely new SV for closures/references to work as they
1577 SvREFCNT_dec(*itersvp);
1578 *itersvp = newSViv(cx->blk_loop.iterix++);
1584 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1587 SvREFCNT_dec(*itersvp);
1589 if (sv = (SvMAGICAL(av))
1590 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1591 : AvARRAY(av)[++cx->blk_loop.iterix])
1595 if (av != PL_curstack && SvIMMORTAL(sv)) {
1596 SV *lv = cx->blk_loop.iterlval;
1597 if (lv && SvREFCNT(lv) > 1) {
1602 SvREFCNT_dec(LvTARG(lv));
1604 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1605 sv_upgrade(lv, SVt_PVLV);
1607 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1609 LvTARG(lv) = SvREFCNT_inc(av);
1610 LvTARGOFF(lv) = cx->blk_loop.iterix;
1611 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1615 *itersvp = SvREFCNT_inc(sv);
1622 register PMOP *pm = cPMOP;
1638 register REGEXP *rx = pm->op_pmregexp;
1640 int force_on_match = 0;
1641 I32 oldsave = PL_savestack_ix;
1642 I32 update_minmatch = 1;
1644 /* known replacement string? */
1645 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1646 if (PL_op->op_flags & OPf_STACKED)
1652 if (SvREADONLY(TARG)
1653 || (SvTYPE(TARG) > SVt_PVLV
1654 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1655 DIE(aTHX_ PL_no_modify);
1658 s = SvPV(TARG, len);
1659 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1661 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1662 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1669 DIE(aTHX_ "panic: do_subst");
1672 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1673 position, once with zero-length,
1674 second time with non-zero. */
1676 if (!rx->prelen && PL_curpm) {
1678 rx = pm->op_pmregexp;
1680 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1681 ? REXEC_COPY_STR : 0;
1683 r_flags |= REXEC_SCREAM;
1684 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1685 SAVEINT(PL_multiline);
1686 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1689 if (rx->reganch & RE_USE_INTUIT) {
1690 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1694 /* How to do it in subst? */
1695 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1697 && ((rx->reganch & ROPT_NOSCAN)
1698 || !((rx->reganch & RE_INTUIT_TAIL)
1699 && (r_flags & REXEC_SCREAM))))
1704 /* only replace once? */
1705 once = !(rpm->op_pmflags & PMf_GLOBAL);
1707 /* known replacement string? */
1708 c = dstr ? SvPV(dstr, clen) : Nullch;
1710 /* can do inplace substitution? */
1711 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1712 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1713 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1714 r_flags | REXEC_CHECKED))
1718 LEAVE_SCOPE(oldsave);
1721 if (force_on_match) {
1723 s = SvPV_force(TARG, len);
1728 SvSCREAM_off(TARG); /* disable possible screamer */
1730 rxtainted |= RX_MATCH_TAINTED(rx);
1731 m = orig + rx->startp[0];
1732 d = orig + rx->endp[0];
1734 if (m - s > strend - d) { /* faster to shorten from end */
1736 Copy(c, m, clen, char);
1741 Move(d, m, i, char);
1745 SvCUR_set(TARG, m - s);
1748 else if (i = m - s) { /* faster from front */
1756 Copy(c, m, clen, char);
1761 Copy(c, d, clen, char);
1766 TAINT_IF(rxtainted & 1);
1772 if (iters++ > maxiters)
1773 DIE(aTHX_ "Substitution loop");
1774 rxtainted |= RX_MATCH_TAINTED(rx);
1775 m = rx->startp[0] + orig;
1779 Move(s, d, i, char);
1783 Copy(c, d, clen, char);
1786 s = rx->endp[0] + orig;
1787 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1789 /* don't match same null twice */
1790 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1793 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1794 Move(s, d, i+1, char); /* include the NUL */
1796 TAINT_IF(rxtainted & 1);
1798 PUSHs(sv_2mortal(newSViv((I32)iters)));
1800 (void)SvPOK_only(TARG);
1801 TAINT_IF(rxtainted);
1802 if (SvSMAGICAL(TARG)) {
1808 LEAVE_SCOPE(oldsave);
1812 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1813 r_flags | REXEC_CHECKED))
1815 if (force_on_match) {
1817 s = SvPV_force(TARG, len);
1820 rxtainted |= RX_MATCH_TAINTED(rx);
1821 dstr = NEWSV(25, len);
1822 sv_setpvn(dstr, m, s-m);
1825 register PERL_CONTEXT *cx;
1828 RETURNOP(cPMOP->op_pmreplroot);
1830 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1832 if (iters++ > maxiters)
1833 DIE(aTHX_ "Substitution loop");
1834 rxtainted |= RX_MATCH_TAINTED(rx);
1835 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1840 strend = s + (strend - m);
1842 m = rx->startp[0] + orig;
1843 sv_catpvn(dstr, s, m-s);
1844 s = rx->endp[0] + orig;
1846 sv_catpvn(dstr, c, clen);
1849 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1850 sv_catpvn(dstr, s, strend - s);
1852 (void)SvOOK_off(TARG);
1853 Safefree(SvPVX(TARG));
1854 SvPVX(TARG) = SvPVX(dstr);
1855 SvCUR_set(TARG, SvCUR(dstr));
1856 SvLEN_set(TARG, SvLEN(dstr));
1860 TAINT_IF(rxtainted & 1);
1862 PUSHs(sv_2mortal(newSViv((I32)iters)));
1864 (void)SvPOK_only(TARG);
1865 TAINT_IF(rxtainted);
1868 LEAVE_SCOPE(oldsave);
1877 LEAVE_SCOPE(oldsave);
1886 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1887 ++*PL_markstack_ptr;
1888 LEAVE; /* exit inner scope */
1891 if (PL_stack_base + *PL_markstack_ptr > SP) {
1893 I32 gimme = GIMME_V;
1895 LEAVE; /* exit outer scope */
1896 (void)POPMARK; /* pop src */
1897 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1898 (void)POPMARK; /* pop dst */
1899 SP = PL_stack_base + POPMARK; /* pop original mark */
1900 if (gimme == G_SCALAR) {
1904 else if (gimme == G_ARRAY)
1911 ENTER; /* enter inner scope */
1914 src = PL_stack_base[*PL_markstack_ptr];
1918 RETURNOP(cLOGOP->op_other);
1929 register PERL_CONTEXT *cx;
1935 if (gimme == G_SCALAR) {
1938 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1940 *MARK = SvREFCNT_inc(TOPs);
1946 *MARK = sv_mortalcopy(TOPs);
1950 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1954 *MARK = &PL_sv_undef;
1958 else if (gimme == G_ARRAY) {
1959 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1960 if (!SvTEMP(*MARK)) {
1961 *MARK = sv_mortalcopy(*MARK);
1962 TAINT_NOT; /* Each item is independent */
1968 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
1969 PL_curpm = newpm; /* ... and pop $1 et al */
1973 return pop_return();
1976 /* This duplicates the above code because the above code must not
1977 * get any slower by more conditions */
1985 register PERL_CONTEXT *cx;
1992 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
1993 /* We are an argument to a function or grep().
1994 * This kind of lvalueness was legal before lvalue
1995 * subroutines too, so be backward compatible:
1996 * cannot report errors. */
1998 /* Scalar context *is* possible, on the LHS of -> only,
1999 * as in f()->meth(). But this is not an lvalue. */
2000 if (gimme == G_SCALAR)
2002 if (gimme == G_ARRAY) {
2003 if (!CvLVALUE(cx->blk_sub.cv))
2004 goto temporise_array;
2005 EXTEND_MORTAL(SP - newsp);
2006 for (mark = newsp + 1; mark <= SP; mark++) {
2009 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2010 *mark = sv_mortalcopy(*mark);
2012 /* Can be a localized value subject to deletion. */
2013 PL_tmps_stack[++PL_tmps_ix] = *mark;
2014 (void)SvREFCNT_inc(*mark);
2019 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2020 /* Here we go for robustness, not for speed, so we change all
2021 * the refcounts so the caller gets a live guy. Cannot set
2022 * TEMP, so sv_2mortal is out of question. */
2023 if (!CvLVALUE(cx->blk_sub.cv)) {
2028 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2030 if (gimme == G_SCALAR) {
2034 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2039 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2040 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2042 else { /* Can be a localized value
2043 * subject to deletion. */
2044 PL_tmps_stack[++PL_tmps_ix] = *mark;
2045 (void)SvREFCNT_inc(*mark);
2048 else { /* Should not happen? */
2053 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2054 (MARK > SP ? "Empty array" : "Array"));
2058 else if (gimme == G_ARRAY) {
2059 EXTEND_MORTAL(SP - newsp);
2060 for (mark = newsp + 1; mark <= SP; mark++) {
2061 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2062 /* Might be flattened array after $#array = */
2068 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2069 (*mark != &PL_sv_undef)
2071 ? "a readonly value" : "a temporary")
2072 : "an uninitialized value");
2076 /* Can be a localized value subject to deletion. */
2077 PL_tmps_stack[++PL_tmps_ix] = *mark;
2078 (void)SvREFCNT_inc(*mark);
2084 if (gimme == G_SCALAR) {
2088 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2090 *MARK = SvREFCNT_inc(TOPs);
2096 *MARK = sv_mortalcopy(TOPs);
2100 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2104 *MARK = &PL_sv_undef;
2108 else if (gimme == G_ARRAY) {
2110 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2111 if (!SvTEMP(*MARK)) {
2112 *MARK = sv_mortalcopy(*MARK);
2113 TAINT_NOT; /* Each item is independent */
2120 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2121 PL_curpm = newpm; /* ... and pop $1 et al */
2125 return pop_return();
2130 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2133 SV *dbsv = GvSV(PL_DBsub);
2135 if (!PERLDB_SUB_NN) {
2139 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2140 || strEQ(GvNAME(gv), "END")
2141 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2142 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2143 && (gv = (GV*)*svp) ))) {
2144 /* Use GV from the stack as a fallback. */
2145 /* GV is potentially non-unique, or contain different CV. */
2146 sv_setsv(dbsv, newRV((SV*)cv));
2149 gv_efullname3(dbsv, gv, Nullch);
2153 SvUPGRADE(dbsv, SVt_PVIV);
2155 SAVEIV(SvIVX(dbsv));
2156 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2160 PL_curcopdb = PL_curcop;
2161 cv = GvCV(PL_DBsub);
2171 register PERL_CONTEXT *cx;
2173 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2176 DIE(aTHX_ "Not a CODE reference");
2177 switch (SvTYPE(sv)) {
2183 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2185 SP = PL_stack_base + POPMARK;
2188 if (SvGMAGICAL(sv)) {
2190 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2193 sym = SvPV(sv, n_a);
2195 DIE(aTHX_ PL_no_usym, "a subroutine");
2196 if (PL_op->op_private & HINT_STRICT_REFS)
2197 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2198 cv = get_cv(sym, TRUE);
2202 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2203 tryAMAGICunDEREF(to_cv);
2206 if (SvTYPE(cv) == SVt_PVCV)
2211 DIE(aTHX_ "Not a CODE reference");
2216 if (!(cv = GvCVu((GV*)sv)))
2217 cv = sv_2cv(sv, &stash, &gv, FALSE);
2230 if (!CvROOT(cv) && !CvXSUB(cv)) {
2234 /* anonymous or undef'd function leaves us no recourse */
2235 if (CvANON(cv) || !(gv = CvGV(cv)))
2236 DIE(aTHX_ "Undefined subroutine called");
2238 /* autoloaded stub? */
2239 if (cv != GvCV(gv)) {
2242 /* should call AUTOLOAD now? */
2245 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2252 sub_name = sv_newmortal();
2253 gv_efullname3(sub_name, gv, Nullch);
2254 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2258 DIE(aTHX_ "Not a CODE reference");
2263 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2264 cv = get_db_sub(&sv, cv);
2266 DIE(aTHX_ "No DBsub routine");
2271 * First we need to check if the sub or method requires locking.
2272 * If so, we gain a lock on the CV, the first argument or the
2273 * stash (for static methods), as appropriate. This has to be
2274 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2275 * reschedule by returning a new op.
2277 MUTEX_LOCK(CvMUTEXP(cv));
2278 if (CvFLAGS(cv) & CVf_LOCKED) {
2280 if (CvFLAGS(cv) & CVf_METHOD) {
2281 if (SP > PL_stack_base + TOPMARK)
2282 sv = *(PL_stack_base + TOPMARK + 1);
2284 AV *av = (AV*)PL_curpad[0];
2285 if (hasargs || !av || AvFILLp(av) < 0
2286 || !(sv = AvARRAY(av)[0]))
2288 MUTEX_UNLOCK(CvMUTEXP(cv));
2289 DIE(aTHX_ "no argument for locked method call");
2296 char *stashname = SvPV(sv, len);
2297 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2303 MUTEX_UNLOCK(CvMUTEXP(cv));
2304 mg = condpair_magic(sv);
2305 MUTEX_LOCK(MgMUTEXP(mg));
2306 if (MgOWNER(mg) == thr)
2307 MUTEX_UNLOCK(MgMUTEXP(mg));
2310 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2312 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2314 MUTEX_UNLOCK(MgMUTEXP(mg));
2315 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2317 MUTEX_LOCK(CvMUTEXP(cv));
2320 * Now we have permission to enter the sub, we must distinguish
2321 * four cases. (0) It's an XSUB (in which case we don't care
2322 * about ownership); (1) it's ours already (and we're recursing);
2323 * (2) it's free (but we may already be using a cached clone);
2324 * (3) another thread owns it. Case (1) is easy: we just use it.
2325 * Case (2) means we look for a clone--if we have one, use it
2326 * otherwise grab ownership of cv. Case (3) means we look for a
2327 * clone (for non-XSUBs) and have to create one if we don't
2329 * Why look for a clone in case (2) when we could just grab
2330 * ownership of cv straight away? Well, we could be recursing,
2331 * i.e. we originally tried to enter cv while another thread
2332 * owned it (hence we used a clone) but it has been freed up
2333 * and we're now recursing into it. It may or may not be "better"
2334 * to use the clone but at least CvDEPTH can be trusted.
2336 if (CvOWNER(cv) == thr || CvXSUB(cv))
2337 MUTEX_UNLOCK(CvMUTEXP(cv));
2339 /* Case (2) or (3) */
2343 * XXX Might it be better to release CvMUTEXP(cv) while we
2344 * do the hv_fetch? We might find someone has pinched it
2345 * when we look again, in which case we would be in case
2346 * (3) instead of (2) so we'd have to clone. Would the fact
2347 * that we released the mutex more quickly make up for this?
2349 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2351 /* We already have a clone to use */
2352 MUTEX_UNLOCK(CvMUTEXP(cv));
2354 DEBUG_S(PerlIO_printf(Perl_debug_log,
2355 "entersub: %p already has clone %p:%s\n",
2356 thr, cv, SvPEEK((SV*)cv)));
2359 if (CvDEPTH(cv) == 0)
2360 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2363 /* (2) => grab ownership of cv. (3) => make clone */
2367 MUTEX_UNLOCK(CvMUTEXP(cv));
2368 DEBUG_S(PerlIO_printf(Perl_debug_log,
2369 "entersub: %p grabbing %p:%s in stash %s\n",
2370 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2371 HvNAME(CvSTASH(cv)) : "(none)"));
2374 /* Make a new clone. */
2376 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2377 MUTEX_UNLOCK(CvMUTEXP(cv));
2378 DEBUG_S((PerlIO_printf(Perl_debug_log,
2379 "entersub: %p cloning %p:%s\n",
2380 thr, cv, SvPEEK((SV*)cv))));
2382 * We're creating a new clone so there's no race
2383 * between the original MUTEX_UNLOCK and the
2384 * SvREFCNT_inc since no one will be trying to undef
2385 * it out from underneath us. At least, I don't think
2388 clonecv = cv_clone(cv);
2389 SvREFCNT_dec(cv); /* finished with this */
2390 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2391 CvOWNER(clonecv) = thr;
2395 DEBUG_S(if (CvDEPTH(cv) != 0)
2396 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2398 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2401 #endif /* USE_THREADS */
2404 #ifdef PERL_XSUB_OLDSTYLE
2405 if (CvOLDSTYLE(cv)) {
2406 I32 (*fp3)(int,int,int);
2408 register I32 items = SP - MARK;
2409 /* We dont worry to copy from @_. */
2414 PL_stack_sp = mark + 1;
2415 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2416 items = (*fp3)(CvXSUBANY(cv).any_i32,
2417 MARK - PL_stack_base + 1,
2419 PL_stack_sp = PL_stack_base + items;
2422 #endif /* PERL_XSUB_OLDSTYLE */
2424 I32 markix = TOPMARK;
2429 /* Need to copy @_ to stack. Alternative may be to
2430 * switch stack to @_, and copy return values
2431 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2435 av = (AV*)PL_curpad[0];
2437 av = GvAV(PL_defgv);
2438 #endif /* USE_THREADS */
2439 items = AvFILLp(av) + 1; /* @_ is not tieable */
2442 /* Mark is at the end of the stack. */
2444 Copy(AvARRAY(av), SP + 1, items, SV*);
2449 /* We assume first XSUB in &DB::sub is the called one. */
2451 SAVEVPTR(PL_curcop);
2452 PL_curcop = PL_curcopdb;
2455 /* Do we need to open block here? XXXX */
2456 (void)(*CvXSUB(cv))(aTHXo_ cv);
2458 /* Enforce some sanity in scalar context. */
2459 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2460 if (markix > PL_stack_sp - PL_stack_base)
2461 *(PL_stack_base + markix) = &PL_sv_undef;
2463 *(PL_stack_base + markix) = *PL_stack_sp;
2464 PL_stack_sp = PL_stack_base + markix;
2472 register I32 items = SP - MARK;
2473 AV* padlist = CvPADLIST(cv);
2474 SV** svp = AvARRAY(padlist);
2475 push_return(PL_op->op_next);
2476 PUSHBLOCK(cx, CXt_SUB, MARK);
2479 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2480 * that eval'' ops within this sub know the correct lexical space.
2481 * Owing the speed considerations, we choose to search for the cv
2482 * in doeval() instead.
2484 if (CvDEPTH(cv) < 2)
2485 (void)SvREFCNT_inc(cv);
2486 else { /* save temporaries on recursion? */
2487 PERL_STACK_OVERFLOW_CHECK();
2488 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2490 AV *newpad = newAV();
2491 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2492 I32 ix = AvFILLp((AV*)svp[1]);
2493 I32 names_fill = AvFILLp((AV*)svp[0]);
2494 svp = AvARRAY(svp[0]);
2495 for ( ;ix > 0; ix--) {
2496 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2497 char *name = SvPVX(svp[ix]);
2498 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2499 || *name == '&') /* anonymous code? */
2501 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2503 else { /* our own lexical */
2505 av_store(newpad, ix, sv = (SV*)newAV());
2506 else if (*name == '%')
2507 av_store(newpad, ix, sv = (SV*)newHV());
2509 av_store(newpad, ix, sv = NEWSV(0,0));
2513 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2514 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2517 av_store(newpad, ix, sv = NEWSV(0,0));
2521 av = newAV(); /* will be @_ */
2523 av_store(newpad, 0, (SV*)av);
2524 AvFLAGS(av) = AVf_REIFY;
2525 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2526 AvFILLp(padlist) = CvDEPTH(cv);
2527 svp = AvARRAY(padlist);
2532 AV* av = (AV*)PL_curpad[0];
2534 items = AvFILLp(av) + 1;
2536 /* Mark is at the end of the stack. */
2538 Copy(AvARRAY(av), SP + 1, items, SV*);
2543 #endif /* USE_THREADS */
2544 SAVEVPTR(PL_curpad);
2545 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2548 #endif /* USE_THREADS */
2554 DEBUG_S(PerlIO_printf(Perl_debug_log,
2555 "%p entersub preparing @_\n", thr));
2557 av = (AV*)PL_curpad[0];
2559 /* @_ is normally not REAL--this should only ever
2560 * happen when DB::sub() calls things that modify @_ */
2566 cx->blk_sub.savearray = GvAV(PL_defgv);
2567 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2568 #endif /* USE_THREADS */
2569 cx->blk_sub.argarray = av;
2572 if (items > AvMAX(av) + 1) {
2574 if (AvARRAY(av) != ary) {
2575 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2576 SvPVX(av) = (char*)ary;
2578 if (items > AvMAX(av) + 1) {
2579 AvMAX(av) = items - 1;
2580 Renew(ary,items,SV*);
2582 SvPVX(av) = (char*)ary;
2585 Copy(MARK,AvARRAY(av),items,SV*);
2586 AvFILLp(av) = items - 1;
2594 /* warning must come *after* we fully set up the context
2595 * stuff so that __WARN__ handlers can safely dounwind()
2598 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2599 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2600 sub_crush_depth(cv);
2602 DEBUG_S(PerlIO_printf(Perl_debug_log,
2603 "%p entersub returning %p\n", thr, CvSTART(cv)));
2605 RETURNOP(CvSTART(cv));
2610 Perl_sub_crush_depth(pTHX_ CV *cv)
2613 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2615 SV* tmpstr = sv_newmortal();
2616 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2617 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2628 U32 lval = PL_op->op_flags & OPf_MOD;
2629 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2633 elem -= PL_curcop->cop_arybase;
2634 if (SvTYPE(av) != SVt_PVAV)
2636 svp = av_fetch(av, elem, lval && !defer);
2638 if (!svp || *svp == &PL_sv_undef) {
2641 DIE(aTHX_ PL_no_aelem, elem);
2642 lv = sv_newmortal();
2643 sv_upgrade(lv, SVt_PVLV);
2645 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2646 LvTARG(lv) = SvREFCNT_inc(av);
2647 LvTARGOFF(lv) = elem;
2652 if (PL_op->op_private & OPpLVAL_INTRO)
2653 save_aelem(av, elem, svp);
2654 else if (PL_op->op_private & OPpDEREF)
2655 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2657 sv = (svp ? *svp : &PL_sv_undef);
2658 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2659 sv = sv_mortalcopy(sv);
2665 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2671 Perl_croak(aTHX_ PL_no_modify);
2672 if (SvTYPE(sv) < SVt_RV)
2673 sv_upgrade(sv, SVt_RV);
2674 else if (SvTYPE(sv) >= SVt_PV) {
2675 (void)SvOOK_off(sv);
2676 Safefree(SvPVX(sv));
2677 SvLEN(sv) = SvCUR(sv) = 0;
2681 SvRV(sv) = NEWSV(355,0);
2684 SvRV(sv) = (SV*)newAV();
2687 SvRV(sv) = (SV*)newHV();
2702 if (SvTYPE(rsv) == SVt_PVCV) {
2708 SETs(method_common(sv, Null(U32*)));
2715 SV* sv = cSVOP->op_sv;
2716 U32 hash = SvUVX(sv);
2718 XPUSHs(method_common(sv, &hash));
2723 S_method_common(pTHX_ SV* meth, U32* hashp)
2735 name = SvPV(meth, namelen);
2736 sv = *(PL_stack_base + TOPMARK + 1);
2747 !(packname = SvPV(sv, packlen)) ||
2748 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2749 !(ob=(SV*)GvIO(iogv)))
2752 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2753 ? !isIDFIRST_utf8((U8*)packname)
2754 : !isIDFIRST(*packname)
2757 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2758 SvOK(sv) ? "without a package or object reference"
2759 : "on an undefined value");
2761 stash = gv_stashpvn(packname, packlen, TRUE);
2764 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2767 if (!ob || !SvOBJECT(ob))
2768 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2771 stash = SvSTASH(ob);
2774 /* shortcut for simple names */
2776 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2778 gv = (GV*)HeVAL(he);
2779 if (isGV(gv) && GvCV(gv) &&
2780 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2781 return (SV*)GvCV(gv);
2785 gv = gv_fetchmethod(stash, name);
2791 for (p = name; *p; p++) {
2793 sep = p, leaf = p + 1;
2794 else if (*p == ':' && *(p + 1) == ':')
2795 sep = p, leaf = p + 2;
2797 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2798 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2799 packlen = strlen(packname);
2803 packlen = sep - name;
2806 "Can't locate object method \"%s\" via package \"%s\"",
2809 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2814 unset_cvowner(pTHXo_ void *cvarg)
2816 register CV* cv = (CV *) cvarg;
2819 #endif /* DEBUGGING */
2821 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2822 thr, cv, SvPEEK((SV*)cv))));
2823 MUTEX_LOCK(CvMUTEXP(cv));
2824 DEBUG_S(if (CvDEPTH(cv) != 0)
2825 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2827 assert(thr == CvOWNER(cv));
2829 MUTEX_UNLOCK(CvMUTEXP(cv));
2832 #endif /* USE_THREADS */