3 * Copyright (c) 1991-1999, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
36 static void unset_cvowner(pTHXo_ void *cvarg);
37 #endif /* USE_THREADS */
48 PL_curcop = (COP*)PL_op;
49 TAINT_NOT; /* Each statement is presumed innocent */
50 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
59 if (PL_op->op_private & OPpLVAL_INTRO)
60 PUSHs(save_scalar(cGVOP->op_gv));
62 PUSHs(GvSV(cGVOP->op_gv));
73 PL_curcop = (COP*)PL_op;
79 PUSHMARK(PL_stack_sp);
89 sv_setpvn(TARG,s,len);
97 XPUSHs((SV*)cGVOP->op_gv);
108 RETURNOP(cLOGOP->op_other);
117 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
119 temp = left; left = right; right = temp;
121 if (PL_tainting && PL_tainted && !SvTAINTED(left))
123 SvSetMagicSV(right, left);
132 RETURNOP(cLOGOP->op_other);
134 RETURNOP(cLOGOP->op_next);
140 TAINT_NOT; /* Each statement is presumed innocent */
141 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
143 oldsave = PL_scopestack[PL_scopestack_ix - 1];
144 LEAVE_SCOPE(oldsave);
150 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
157 sv_setpvn(TARG,s,len);
159 else if (SvGMAGICAL(TARG))
161 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
162 sv_setpv(TARG, ""); /* Suppress warning. */
163 s = SvPV_force(TARG, len);
167 #if defined(PERL_Y2KWARN)
168 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_MISC)) {
170 char *s = SvPV(TARG,n);
171 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
172 && (n == 2 || !isDIGIT(s[n-3])))
174 Perl_warner(aTHX_ WARN_MISC, "Possible Y2K bug: %s",
175 "about to append an integer to '19'");
179 sv_catpvn(TARG,s,len);
182 sv_setpvn(TARG,s,len); /* suppress warning */
192 if (PL_op->op_flags & OPf_MOD) {
193 if (PL_op->op_private & OPpLVAL_INTRO)
194 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
195 else if (PL_op->op_private & OPpDEREF) {
197 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
206 tryAMAGICunTARGET(iter, 0);
207 PL_last_in_gv = (GV*)(*PL_stack_sp--);
208 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
209 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
210 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
213 XPUSHs((SV*)PL_last_in_gv);
216 PL_last_in_gv = (GV*)(*PL_stack_sp--);
219 return do_readline();
224 djSP; tryAMAGICbinSET(eq,0);
227 SETs(boolSV(TOPn == value));
235 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
236 Perl_croak(aTHX_ PL_no_modify);
237 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
238 SvIVX(TOPs) != IV_MAX)
241 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
256 RETURNOP(cLOGOP->op_other);
262 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
265 SETn( left + right );
273 AV *av = GvAV((GV*)cSVOP->op_sv);
274 U32 lval = PL_op->op_flags & OPf_MOD;
275 SV** svp = av_fetch(av, PL_op->op_private, lval);
276 SV *sv = (svp ? *svp : &PL_sv_undef);
278 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
279 sv = sv_mortalcopy(sv);
286 djSP; dMARK; dTARGET;
288 do_join(TARG, *MARK, MARK, SP);
299 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
300 * will be enough to hold an OP*.
302 SV* sv = sv_newmortal();
303 sv_upgrade(sv, SVt_PVLV);
305 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
313 /* Oversized hot code. */
317 djSP; dMARK; dORIGMARK;
324 if (PL_op->op_flags & OPf_STACKED)
328 if (mg = SvTIED_mg((SV*)gv, 'q')) {
329 if (MARK == ORIGMARK) {
330 /* If using default handle then we need to make space to
331 * pass object as 1st arg, so move other args up ...
335 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
339 *MARK = SvTIED_obj((SV*)gv, mg);
342 call_method("PRINT", G_SCALAR);
350 if (!(io = GvIO(gv))) {
351 if (ckWARN(WARN_UNOPENED)) {
352 SV* sv = sv_newmortal();
353 gv_efullname3(sv, gv, Nullch);
354 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
357 SETERRNO(EBADF,RMS$_IFI);
360 else if (!(fp = IoOFP(io))) {
361 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
362 SV* sv = sv_newmortal();
363 gv_efullname3(sv, gv, Nullch);
365 Perl_warner(aTHX_ WARN_IO,
366 "Filehandle %s opened only for input",
368 else if (ckWARN(WARN_CLOSED))
369 Perl_warner(aTHX_ WARN_CLOSED,
370 "print on closed filehandle %s", SvPV(sv,n_a));
372 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
379 if (!do_print(*MARK, fp))
383 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
392 if (!do_print(*MARK, fp))
401 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
404 if (IoFLAGS(io) & IOf_FLUSH)
405 if (PerlIO_flush(fp) == EOF)
426 tryAMAGICunDEREF(to_av);
429 if (SvTYPE(av) != SVt_PVAV)
430 DIE(aTHX_ "Not an ARRAY reference");
431 if (PL_op->op_flags & OPf_REF) {
437 if (SvTYPE(sv) == SVt_PVAV) {
439 if (PL_op->op_flags & OPf_REF) {
447 if (SvTYPE(sv) != SVt_PVGV) {
451 if (SvGMAGICAL(sv)) {
457 if (PL_op->op_flags & OPf_REF ||
458 PL_op->op_private & HINT_STRICT_REFS)
459 DIE(aTHX_ PL_no_usym, "an ARRAY");
460 if (ckWARN(WARN_UNINITIALIZED))
461 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
462 if (GIMME == G_ARRAY) {
469 if ((PL_op->op_flags & OPf_SPECIAL) &&
470 !(PL_op->op_flags & OPf_MOD))
472 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
477 if (PL_op->op_private & HINT_STRICT_REFS)
478 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
479 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
486 if (PL_op->op_private & OPpLVAL_INTRO)
488 if (PL_op->op_flags & OPf_REF) {
495 if (GIMME == G_ARRAY) {
496 I32 maxarg = AvFILL(av) + 1;
497 (void)POPs; /* XXXX May be optimized away? */
499 if (SvRMAGICAL(av)) {
501 for (i=0; i < maxarg; i++) {
502 SV **svp = av_fetch(av, i, FALSE);
503 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
507 Copy(AvARRAY(av), SP+1, maxarg, SV*);
513 I32 maxarg = AvFILL(av) + 1;
526 tryAMAGICunDEREF(to_hv);
529 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
530 DIE(aTHX_ "Not a HASH reference");
531 if (PL_op->op_flags & OPf_REF) {
537 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
539 if (PL_op->op_flags & OPf_REF) {
547 if (SvTYPE(sv) != SVt_PVGV) {
551 if (SvGMAGICAL(sv)) {
557 if (PL_op->op_flags & OPf_REF ||
558 PL_op->op_private & HINT_STRICT_REFS)
559 DIE(aTHX_ PL_no_usym, "a HASH");
560 if (ckWARN(WARN_UNINITIALIZED))
561 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
562 if (GIMME == G_ARRAY) {
569 if ((PL_op->op_flags & OPf_SPECIAL) &&
570 !(PL_op->op_flags & OPf_MOD))
572 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
577 if (PL_op->op_private & HINT_STRICT_REFS)
578 DIE(aTHX_ PL_no_symref, sym, "a HASH");
579 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
586 if (PL_op->op_private & OPpLVAL_INTRO)
588 if (PL_op->op_flags & OPf_REF) {
595 if (GIMME == G_ARRAY) { /* array wanted */
596 *PL_stack_sp = (SV*)hv;
601 if (SvTYPE(hv) == SVt_PVAV)
602 hv = avhv_keys((AV*)hv);
605 Perl_sv_setpvf(aTHX_ TARG, "%" PERL_PRId64 "/%" PERL_PRId64,
606 (Quad_t)HvFILL(hv), (Quad_t)HvMAX(hv) + 1);
609 Perl_sv_setpvf(aTHX_ TARG, "%ld/%ld",
610 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
623 SV **lastlelem = PL_stack_sp;
624 SV **lastrelem = PL_stack_base + POPMARK;
625 SV **firstrelem = PL_stack_base + POPMARK + 1;
626 SV **firstlelem = lastrelem + 1;
639 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
641 /* If there's a common identifier on both sides we have to take
642 * special care that assigning the identifier on the left doesn't
643 * clobber a value on the right that's used later in the list.
645 if (PL_op->op_private & OPpASSIGN_COMMON) {
646 EXTEND_MORTAL(lastrelem - firstrelem + 1);
647 for (relem = firstrelem; relem <= lastrelem; relem++) {
650 TAINT_NOT; /* Each item is independent */
651 *relem = sv_mortalcopy(sv);
660 while (lelem <= lastlelem) {
661 TAINT_NOT; /* Each item stands on its own, taintwise. */
663 switch (SvTYPE(sv)) {
666 magic = SvMAGICAL(ary) != 0;
669 av_extend(ary, lastrelem - relem);
671 while (relem <= lastrelem) { /* gobble up all the rest */
677 didstore = av_store(ary,i++,sv);
691 magic = SvMAGICAL(hash) != 0;
694 while (relem < lastrelem) { /* gobble up all the rest */
699 sv = &PL_sv_no, relem++;
700 tmpstr = NEWSV(29,0);
702 sv_setsv(tmpstr,*relem); /* value */
704 didstore = hv_store_ent(hash,sv,tmpstr,0);
706 if (SvSMAGICAL(tmpstr))
713 if (relem == lastrelem) {
716 if (ckWARN(WARN_UNSAFE)) {
717 if (relem == firstrelem &&
719 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
720 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
721 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
723 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
725 tmpstr = NEWSV(29,0);
726 didstore = hv_store_ent(hash,*relem,tmpstr,0);
728 if (SvSMAGICAL(tmpstr))
740 if (SvIMMORTAL(sv)) {
741 if (relem <= lastrelem)
745 if (relem <= lastrelem) {
746 sv_setsv(sv, *relem);
750 sv_setsv(sv, &PL_sv_undef);
755 if (PL_delaymagic & ~DM_DELAY) {
756 if (PL_delaymagic & DM_UID) {
758 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
761 (void)setreuid(PL_uid,PL_euid);
764 if ((PL_delaymagic & DM_UID) == DM_RUID) {
765 (void)setruid(PL_uid);
766 PL_delaymagic &= ~DM_RUID;
768 # endif /* HAS_SETRUID */
770 if ((PL_delaymagic & DM_UID) == DM_EUID) {
771 (void)seteuid(PL_uid);
772 PL_delaymagic &= ~DM_EUID;
774 # endif /* HAS_SETEUID */
775 if (PL_delaymagic & DM_UID) {
776 if (PL_uid != PL_euid)
777 DIE(aTHX_ "No setreuid available");
778 (void)PerlProc_setuid(PL_uid);
780 # endif /* HAS_SETREUID */
781 #endif /* HAS_SETRESUID */
782 PL_uid = PerlProc_getuid();
783 PL_euid = PerlProc_geteuid();
785 if (PL_delaymagic & DM_GID) {
787 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
790 (void)setregid(PL_gid,PL_egid);
793 if ((PL_delaymagic & DM_GID) == DM_RGID) {
794 (void)setrgid(PL_gid);
795 PL_delaymagic &= ~DM_RGID;
797 # endif /* HAS_SETRGID */
799 if ((PL_delaymagic & DM_GID) == DM_EGID) {
800 (void)setegid(PL_gid);
801 PL_delaymagic &= ~DM_EGID;
803 # endif /* HAS_SETEGID */
804 if (PL_delaymagic & DM_GID) {
805 if (PL_gid != PL_egid)
806 DIE(aTHX_ "No setregid available");
807 (void)PerlProc_setgid(PL_gid);
809 # endif /* HAS_SETREGID */
810 #endif /* HAS_SETRESGID */
811 PL_gid = PerlProc_getgid();
812 PL_egid = PerlProc_getegid();
814 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
821 else if (gimme == G_SCALAR) {
824 SETi(lastrelem - firstrelem + 1);
830 SP = firstrelem + (lastlelem - firstlelem);
831 lelem = firstlelem + (relem - firstrelem);
833 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
841 register PMOP *pm = cPMOP;
842 SV *rv = sv_newmortal();
843 SV *sv = newSVrv(rv, "Regexp");
844 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
851 register PMOP *pm = cPMOP;
856 I32 r_flags = REXEC_CHECKED;
857 char *truebase; /* Start of string */
858 register REGEXP *rx = pm->op_pmregexp;
863 I32 oldsave = PL_savestack_ix;
864 I32 update_minmatch = 1;
867 if (PL_op->op_flags & OPf_STACKED)
873 PUTBACK; /* EVAL blocks need stack_sp. */
877 DIE(aTHX_ "panic: do_match");
878 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
879 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
882 if (pm->op_pmdynflags & PMdf_USED) {
884 if (gimme == G_ARRAY)
889 if (!rx->prelen && PL_curpm) {
891 rx = pm->op_pmregexp;
893 if (rx->minlen > len) goto failure;
897 /* XXXX What part of this is needed with true \G-support? */
898 if (global = pm->op_pmflags & PMf_GLOBAL) {
900 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
901 MAGIC* mg = mg_find(TARG, 'g');
902 if (mg && mg->mg_len >= 0) {
903 if (!(rx->reganch & ROPT_GPOS_SEEN))
904 rx->endp[0] = rx->startp[0] = mg->mg_len;
905 else if (rx->reganch & ROPT_ANCH_GPOS) {
906 r_flags |= REXEC_IGNOREPOS;
907 rx->endp[0] = rx->startp[0] = mg->mg_len;
909 minmatch = (mg->mg_flags & MGf_MINMATCH);
914 if ((gimme != G_ARRAY && !global && rx->nparens)
915 || SvTEMP(TARG) || PL_sawampersand)
916 r_flags |= REXEC_COPY_STR;
918 r_flags |= REXEC_SCREAM;
920 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
921 SAVEINT(PL_multiline);
922 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
926 if (global && rx->startp[0] != -1) {
927 t = s = rx->endp[0] + truebase;
928 if ((s + rx->minlen) > strend)
930 if (update_minmatch++)
931 minmatch = had_zerolen;
933 if (rx->reganch & RE_USE_INTUIT) {
934 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
938 if ( (rx->reganch & ROPT_CHECK_ALL)
940 && ((rx->reganch & ROPT_NOSCAN)
941 || !((rx->reganch & RE_INTUIT_TAIL)
942 && (r_flags & REXEC_SCREAM))))
945 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
948 if (pm->op_pmflags & PMf_ONCE)
949 pm->op_pmdynflags |= PMdf_USED;
958 RX_MATCH_TAINTED_on(rx);
959 TAINT_IF(RX_MATCH_TAINTED(rx));
960 if (gimme == G_ARRAY) {
964 if (global && !iters)
968 SPAGAIN; /* EVAL blocks could move the stack. */
969 EXTEND(SP, iters + i);
970 EXTEND_MORTAL(iters + i);
971 for (i = !i; i <= iters; i++) {
972 PUSHs(sv_newmortal());
974 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
975 len = rx->endp[i] - rx->startp[i];
976 s = rx->startp[i] + truebase;
977 sv_setpvn(*SP, s, len);
981 had_zerolen = (rx->startp[0] != -1
982 && rx->startp[0] == rx->endp[0]);
983 PUTBACK; /* EVAL blocks may use stack */
984 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
989 LEAVE_SCOPE(oldsave);
995 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
996 mg = mg_find(TARG, 'g');
998 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
999 mg = mg_find(TARG, 'g');
1001 if (rx->startp[0] != -1) {
1002 mg->mg_len = rx->endp[0];
1003 if (rx->startp[0] == rx->endp[0])
1004 mg->mg_flags |= MGf_MINMATCH;
1006 mg->mg_flags &= ~MGf_MINMATCH;
1009 LEAVE_SCOPE(oldsave);
1013 yup: /* Confirmed by INTUIT */
1015 RX_MATCH_TAINTED_on(rx);
1016 TAINT_IF(RX_MATCH_TAINTED(rx));
1018 if (pm->op_pmflags & PMf_ONCE)
1019 pm->op_pmdynflags |= PMdf_USED;
1020 if (RX_MATCH_COPIED(rx))
1021 Safefree(rx->subbeg);
1022 RX_MATCH_COPIED_off(rx);
1023 rx->subbeg = Nullch;
1025 rx->subbeg = truebase;
1026 rx->startp[0] = s - truebase;
1027 rx->endp[0] = s - truebase + rx->minlen;
1028 rx->sublen = strend - truebase;
1031 if (PL_sawampersand) {
1034 rx->subbeg = savepvn(t, strend - t);
1035 rx->sublen = strend - t;
1036 RX_MATCH_COPIED_on(rx);
1037 off = rx->startp[0] = s - t;
1038 rx->endp[0] = off + rx->minlen;
1040 else { /* startp/endp are used by @- @+. */
1041 rx->startp[0] = s - truebase;
1042 rx->endp[0] = s - truebase + rx->minlen;
1044 LEAVE_SCOPE(oldsave);
1049 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1050 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1051 MAGIC* mg = mg_find(TARG, 'g');
1056 LEAVE_SCOPE(oldsave);
1057 if (gimme == G_ARRAY)
1063 Perl_do_readline(pTHX)
1065 dSP; dTARGETSTACKED;
1070 register IO *io = GvIO(PL_last_in_gv);
1071 register I32 type = PL_op->op_type;
1072 I32 gimme = GIMME_V;
1075 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1077 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1080 call_method("READLINE", gimme);
1083 if (gimme == G_SCALAR)
1084 SvSetMagicSV_nosteal(TARG, TOPs);
1091 if (IoFLAGS(io) & IOf_ARGV) {
1092 if (IoFLAGS(io) & IOf_START) {
1093 IoFLAGS(io) &= ~IOf_START;
1095 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1096 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1097 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1098 SvSETMAGIC(GvSV(PL_last_in_gv));
1103 fp = nextargv(PL_last_in_gv);
1104 if (!fp) { /* Note: fp != IoIFP(io) */
1105 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1106 IoFLAGS(io) |= IOf_START;
1109 else if (type == OP_GLOB) {
1110 SV *tmpcmd = NEWSV(55, 0);
1114 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1115 /* since spawning off a process is a real performance hit */
1117 #include <descrip.h>
1118 #include <lib$routines.h>
1121 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1122 char vmsspec[NAM$C_MAXRSS+1];
1123 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1124 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1125 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1128 struct dsc$descriptor_s wilddsc
1129 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1130 struct dsc$descriptor_vs rsdsc
1131 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1132 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1134 /* We could find out if there's an explicit dev/dir or version
1135 by peeking into lib$find_file's internal context at
1136 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1137 but that's unsupported, so I don't want to do it now and
1138 have it bite someone in the future. */
1139 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1140 cp = SvPV(tmpglob,i);
1142 if (cp[i] == ';') hasver = 1;
1144 if (sts) hasver = 1;
1148 hasdir = isunix = 1;
1151 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1156 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1158 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1159 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1160 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1161 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1162 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1163 &dfltdsc,NULL,NULL,NULL))&1)) {
1164 end = rstr + (unsigned long int) *rslt;
1165 if (!hasver) while (*end != ';') end--;
1166 *(end++) = '\n'; *end = '\0';
1167 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1169 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1174 while (*(--begin) != ']' && *begin != '>') ;
1177 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1179 if (cxt) (void)lib$find_file_end(&cxt);
1180 if (ok && sts != RMS$_NMF &&
1181 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1184 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1186 PerlIO_close(tmpfp);
1190 PerlIO_rewind(tmpfp);
1192 IoIFP(io) = fp = tmpfp;
1193 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1200 sv_setpv(tmpcmd, "for a in ");
1201 sv_catsv(tmpcmd, tmpglob);
1202 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1205 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1206 sv_catsv(tmpcmd, tmpglob);
1208 sv_setpv(tmpcmd, "perlglob ");
1209 sv_catsv(tmpcmd, tmpglob);
1210 sv_catpv(tmpcmd, " |");
1215 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1216 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1217 sv_catsv(tmpcmd, tmpglob);
1218 sv_catpv(tmpcmd, "' 2>/dev/null |");
1220 sv_setpv(tmpcmd, "echo ");
1221 sv_catsv(tmpcmd, tmpglob);
1223 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1225 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1228 #endif /* !DOSISH */
1229 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1230 FALSE, O_RDONLY, 0, Nullfp);
1236 else if (type == OP_GLOB)
1238 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1239 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1240 || fp == PerlIO_stderr()))
1242 SV* sv = sv_newmortal();
1243 gv_efullname3(sv, PL_last_in_gv, Nullch);
1244 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1249 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1250 if (type == OP_GLOB)
1251 Perl_warner(aTHX_ WARN_CLOSED,
1252 "glob failed (can't start child: %s)",
1255 SV* sv = sv_newmortal();
1256 gv_efullname3(sv, PL_last_in_gv, Nullch);
1257 Perl_warner(aTHX_ WARN_CLOSED,
1258 "Read on closed filehandle %s",
1262 if (gimme == G_SCALAR) {
1263 (void)SvOK_off(TARG);
1269 if (gimme == G_SCALAR) {
1273 (void)SvUPGRADE(sv, SVt_PV);
1274 tmplen = SvLEN(sv); /* remember if already alloced */
1276 Sv_Grow(sv, 80); /* try short-buffering it */
1277 if (type == OP_RCATLINE)
1283 sv = sv_2mortal(NEWSV(57, 80));
1287 /* flip-flop EOF state for a snarfed empty file */
1288 #define SNARF_EOF(gimme,rs,io,sv) \
1289 ((gimme != G_SCALAR || SvCUR(sv) \
1290 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1291 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1292 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1295 if (!sv_gets(sv, fp, offset)
1296 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1298 PerlIO_clearerr(fp);
1299 if (IoFLAGS(io) & IOf_ARGV) {
1300 fp = nextargv(PL_last_in_gv);
1303 (void)do_close(PL_last_in_gv, FALSE);
1304 IoFLAGS(io) |= IOf_START;
1306 else if (type == OP_GLOB) {
1307 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1308 Perl_warner(aTHX_ WARN_CLOSED,
1309 "glob failed (child exited with status %d%s)",
1310 STATUS_CURRENT >> 8,
1311 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1314 if (gimme == G_SCALAR) {
1315 (void)SvOK_off(TARG);
1320 /* This should not be marked tainted if the fp is marked clean */
1321 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1328 if (type == OP_GLOB) {
1331 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1332 tmps = SvEND(sv) - 1;
1333 if (*tmps == *SvPVX(PL_rs)) {
1338 for (tmps = SvPVX(sv); *tmps; tmps++)
1339 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1340 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1342 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1343 (void)POPs; /* Unmatched wildcard? Chuck it... */
1347 if (gimme == G_ARRAY) {
1348 if (SvLEN(sv) - SvCUR(sv) > 20) {
1349 SvLEN_set(sv, SvCUR(sv)+1);
1350 Renew(SvPVX(sv), SvLEN(sv), char);
1352 sv = sv_2mortal(NEWSV(58, 80));
1355 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1356 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1360 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1361 Renew(SvPVX(sv), SvLEN(sv), char);
1370 register PERL_CONTEXT *cx;
1371 I32 gimme = OP_GIMME(PL_op, -1);
1374 if (cxstack_ix >= 0)
1375 gimme = cxstack[cxstack_ix].blk_gimme;
1383 PUSHBLOCK(cx, CXt_BLOCK, SP);
1395 U32 lval = PL_op->op_flags & OPf_MOD;
1396 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1399 if (SvTYPE(hv) == SVt_PVHV) {
1400 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1401 svp = he ? &HeVAL(he) : 0;
1403 else if (SvTYPE(hv) == SVt_PVAV) {
1404 if (PL_op->op_private & OPpLVAL_INTRO)
1405 DIE(aTHX_ "Can't localize pseudo-hash element");
1406 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1412 if (!svp || *svp == &PL_sv_undef) {
1417 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1419 lv = sv_newmortal();
1420 sv_upgrade(lv, SVt_PVLV);
1422 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1423 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1424 LvTARG(lv) = SvREFCNT_inc(hv);
1429 if (PL_op->op_private & OPpLVAL_INTRO) {
1430 if (HvNAME(hv) && isGV(*svp))
1431 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1433 save_helem(hv, keysv, svp);
1435 else if (PL_op->op_private & OPpDEREF)
1436 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1438 sv = (svp ? *svp : &PL_sv_undef);
1439 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1440 * Pushing the magical RHS on to the stack is useless, since
1441 * that magic is soon destined to be misled by the local(),
1442 * and thus the later pp_sassign() will fail to mg_get() the
1443 * old value. This should also cure problems with delayed
1444 * mg_get()s. GSAR 98-07-03 */
1445 if (!lval && SvGMAGICAL(sv))
1446 sv = sv_mortalcopy(sv);
1454 register PERL_CONTEXT *cx;
1460 if (PL_op->op_flags & OPf_SPECIAL) {
1461 cx = &cxstack[cxstack_ix];
1462 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1467 gimme = OP_GIMME(PL_op, -1);
1469 if (cxstack_ix >= 0)
1470 gimme = cxstack[cxstack_ix].blk_gimme;
1476 if (gimme == G_VOID)
1478 else if (gimme == G_SCALAR) {
1481 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1484 *MARK = sv_mortalcopy(TOPs);
1487 *MARK = &PL_sv_undef;
1491 else if (gimme == G_ARRAY) {
1492 /* in case LEAVE wipes old return values */
1493 for (mark = newsp + 1; mark <= SP; mark++) {
1494 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1495 *mark = sv_mortalcopy(*mark);
1496 TAINT_NOT; /* Each item is independent */
1500 PL_curpm = newpm; /* Don't pop $1 et al till now */
1510 register PERL_CONTEXT *cx;
1515 cx = &cxstack[cxstack_ix];
1516 if (CxTYPE(cx) != CXt_LOOP)
1517 DIE(aTHX_ "panic: pp_iter");
1519 av = cx->blk_loop.iterary;
1520 if (SvTYPE(av) != SVt_PVAV) {
1521 /* iterate ($min .. $max) */
1522 if (cx->blk_loop.iterlval) {
1523 /* string increment */
1524 register SV* cur = cx->blk_loop.iterlval;
1526 char *max = SvPV((SV*)av, maxlen);
1527 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1528 #ifndef USE_THREADS /* don't risk potential race */
1529 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1530 && !SvMAGICAL(*cx->blk_loop.itervar))
1532 /* safe to reuse old SV */
1533 sv_setsv(*cx->blk_loop.itervar, cur);
1538 /* we need a fresh SV every time so that loop body sees a
1539 * completely new SV for closures/references to work as
1541 SvREFCNT_dec(*cx->blk_loop.itervar);
1542 *cx->blk_loop.itervar = newSVsv(cur);
1544 if (strEQ(SvPVX(cur), max))
1545 sv_setiv(cur, 0); /* terminate next time */
1552 /* integer increment */
1553 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1556 #ifndef USE_THREADS /* don't risk potential race */
1557 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1558 && !SvMAGICAL(*cx->blk_loop.itervar))
1560 /* safe to reuse old SV */
1561 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1566 /* we need a fresh SV every time so that loop body sees a
1567 * completely new SV for closures/references to work as they
1569 SvREFCNT_dec(*cx->blk_loop.itervar);
1570 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1576 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1579 SvREFCNT_dec(*cx->blk_loop.itervar);
1581 if (sv = (SvMAGICAL(av))
1582 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1583 : AvARRAY(av)[++cx->blk_loop.iterix])
1587 if (av != PL_curstack && SvIMMORTAL(sv)) {
1588 SV *lv = cx->blk_loop.iterlval;
1589 if (lv && SvREFCNT(lv) > 1) {
1594 SvREFCNT_dec(LvTARG(lv));
1596 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1597 sv_upgrade(lv, SVt_PVLV);
1599 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1601 LvTARG(lv) = SvREFCNT_inc(av);
1602 LvTARGOFF(lv) = cx->blk_loop.iterix;
1603 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1607 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1614 register PMOP *pm = cPMOP;
1630 register REGEXP *rx = pm->op_pmregexp;
1632 int force_on_match = 0;
1633 I32 oldsave = PL_savestack_ix;
1634 I32 update_minmatch = 1;
1636 /* known replacement string? */
1637 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1638 if (PL_op->op_flags & OPf_STACKED)
1644 if (SvREADONLY(TARG)
1645 || (SvTYPE(TARG) > SVt_PVLV
1646 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1647 Perl_croak(aTHX_ PL_no_modify);
1650 s = SvPV(TARG, len);
1651 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1653 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1654 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1661 DIE(aTHX_ "panic: do_subst");
1664 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1665 position, once with zero-length,
1666 second time with non-zero. */
1668 if (!rx->prelen && PL_curpm) {
1670 rx = pm->op_pmregexp;
1672 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1673 ? REXEC_COPY_STR : 0;
1675 r_flags |= REXEC_SCREAM;
1676 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1677 SAVEINT(PL_multiline);
1678 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1681 if (rx->reganch & RE_USE_INTUIT) {
1682 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1686 /* How to do it in subst? */
1687 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1689 && ((rx->reganch & ROPT_NOSCAN)
1690 || !((rx->reganch & RE_INTUIT_TAIL)
1691 && (r_flags & REXEC_SCREAM))))
1696 /* only replace once? */
1697 once = !(rpm->op_pmflags & PMf_GLOBAL);
1699 /* known replacement string? */
1700 c = dstr ? SvPV(dstr, clen) : Nullch;
1702 /* can do inplace substitution? */
1703 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1704 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1705 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1706 r_flags | REXEC_CHECKED))
1710 LEAVE_SCOPE(oldsave);
1713 if (force_on_match) {
1715 s = SvPV_force(TARG, len);
1720 SvSCREAM_off(TARG); /* disable possible screamer */
1722 rxtainted |= RX_MATCH_TAINTED(rx);
1723 m = orig + rx->startp[0];
1724 d = orig + rx->endp[0];
1726 if (m - s > strend - d) { /* faster to shorten from end */
1728 Copy(c, m, clen, char);
1733 Move(d, m, i, char);
1737 SvCUR_set(TARG, m - s);
1740 else if (i = m - s) { /* faster from front */
1748 Copy(c, m, clen, char);
1753 Copy(c, d, clen, char);
1758 TAINT_IF(rxtainted & 1);
1764 if (iters++ > maxiters)
1765 DIE(aTHX_ "Substitution loop");
1766 rxtainted |= RX_MATCH_TAINTED(rx);
1767 m = rx->startp[0] + orig;
1771 Move(s, d, i, char);
1775 Copy(c, d, clen, char);
1778 s = rx->endp[0] + orig;
1779 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1781 /* don't match same null twice */
1782 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1785 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1786 Move(s, d, i+1, char); /* include the NUL */
1788 TAINT_IF(rxtainted & 1);
1790 PUSHs(sv_2mortal(newSViv((I32)iters)));
1792 (void)SvPOK_only(TARG);
1793 TAINT_IF(rxtainted);
1794 if (SvSMAGICAL(TARG)) {
1800 LEAVE_SCOPE(oldsave);
1804 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1805 r_flags | REXEC_CHECKED))
1807 if (force_on_match) {
1809 s = SvPV_force(TARG, len);
1812 rxtainted |= RX_MATCH_TAINTED(rx);
1813 dstr = NEWSV(25, len);
1814 sv_setpvn(dstr, m, s-m);
1817 register PERL_CONTEXT *cx;
1820 RETURNOP(cPMOP->op_pmreplroot);
1822 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1824 if (iters++ > maxiters)
1825 DIE(aTHX_ "Substitution loop");
1826 rxtainted |= RX_MATCH_TAINTED(rx);
1827 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1832 strend = s + (strend - m);
1834 m = rx->startp[0] + orig;
1835 sv_catpvn(dstr, s, m-s);
1836 s = rx->endp[0] + orig;
1838 sv_catpvn(dstr, c, clen);
1841 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1842 sv_catpvn(dstr, s, strend - s);
1844 (void)SvOOK_off(TARG);
1845 Safefree(SvPVX(TARG));
1846 SvPVX(TARG) = SvPVX(dstr);
1847 SvCUR_set(TARG, SvCUR(dstr));
1848 SvLEN_set(TARG, SvLEN(dstr));
1852 TAINT_IF(rxtainted & 1);
1854 PUSHs(sv_2mortal(newSViv((I32)iters)));
1856 (void)SvPOK_only(TARG);
1857 TAINT_IF(rxtainted);
1860 LEAVE_SCOPE(oldsave);
1869 LEAVE_SCOPE(oldsave);
1878 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1879 ++*PL_markstack_ptr;
1880 LEAVE; /* exit inner scope */
1883 if (PL_stack_base + *PL_markstack_ptr > SP) {
1885 I32 gimme = GIMME_V;
1887 LEAVE; /* exit outer scope */
1888 (void)POPMARK; /* pop src */
1889 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1890 (void)POPMARK; /* pop dst */
1891 SP = PL_stack_base + POPMARK; /* pop original mark */
1892 if (gimme == G_SCALAR) {
1896 else if (gimme == G_ARRAY)
1903 ENTER; /* enter inner scope */
1906 src = PL_stack_base[*PL_markstack_ptr];
1910 RETURNOP(cLOGOP->op_other);
1921 register PERL_CONTEXT *cx;
1922 struct block_sub cxsub;
1925 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1928 if (gimme == G_SCALAR) {
1931 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1933 *MARK = SvREFCNT_inc(TOPs);
1939 *MARK = sv_mortalcopy(TOPs);
1943 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1947 *MARK = &PL_sv_undef;
1951 else if (gimme == G_ARRAY) {
1952 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1953 if (!SvTEMP(*MARK)) {
1954 *MARK = sv_mortalcopy(*MARK);
1955 TAINT_NOT; /* Each item is independent */
1961 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1962 PL_curpm = newpm; /* ... and pop $1 et al */
1965 return pop_return();
1968 /* This duplicates the above code because the above code must not
1969 * get any slower by more conditions */
1977 register PERL_CONTEXT *cx;
1978 struct block_sub cxsub;
1981 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1985 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
1986 /* We are an argument to a function or grep().
1987 * This kind of lvalueness was legal before lvalue
1988 * subroutines too, so be backward compatible:
1989 * cannot report errors. */
1991 /* Scalar context *is* possible, on the LHS of -> only,
1992 * as in f()->meth(). But this is not an lvalue. */
1993 if (gimme == G_SCALAR)
1995 if (gimme == G_ARRAY) {
1996 if (!CvLVALUE(cxsub.cv))
1997 goto temporise_array;
1998 EXTEND_MORTAL(SP - newsp);
1999 for (mark = newsp + 1; mark <= SP; mark++) {
2002 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2003 *mark = sv_mortalcopy(*mark);
2005 /* Can be a localized value subject to deletion. */
2006 PL_tmps_stack[++PL_tmps_ix] = *mark;
2007 SvREFCNT_inc(*mark);
2012 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2013 /* Here we go for robustness, not for speed, so we change all
2014 * the refcounts so the caller gets a live guy. Cannot set
2015 * TEMP, so sv_2mortal is out of question. */
2016 if (!CvLVALUE(cxsub.cv))
2017 Perl_croak(aTHX_ "Can't modify non-lvalue subroutine call");
2018 if (gimme == G_SCALAR) {
2022 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY))
2023 Perl_croak(aTHX_ "Can't return a %s from lvalue subroutine",
2024 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2025 else { /* Can be a localized value
2026 * subject to deletion. */
2027 PL_tmps_stack[++PL_tmps_ix] = *mark;
2028 SvREFCNT_inc(*mark);
2031 else /* Should not happen? */
2032 Perl_croak(aTHX_ "%s returned from lvalue subroutine in scalar context",
2033 (MARK > SP ? "Empty array" : "Array"));
2036 else if (gimme == G_ARRAY) {
2037 EXTEND_MORTAL(SP - newsp);
2038 for (mark = newsp + 1; mark <= SP; mark++) {
2039 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY))
2040 /* Might be flattened array after $#array = */
2041 Perl_croak(aTHX_ "Can't return %s from lvalue subroutine",
2042 (*mark != &PL_sv_undef)
2044 ? "a readonly value" : "a temporary")
2045 : "an uninitialized value");
2048 /* Can be a localized value subject to deletion. */
2049 PL_tmps_stack[++PL_tmps_ix] = *mark;
2050 SvREFCNT_inc(*mark);
2056 if (gimme == G_SCALAR) {
2060 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
2062 *MARK = SvREFCNT_inc(TOPs);
2068 *MARK = sv_mortalcopy(TOPs);
2072 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2076 *MARK = &PL_sv_undef;
2080 else if (gimme == G_ARRAY) {
2082 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2083 if (!SvTEMP(*MARK)) {
2084 *MARK = sv_mortalcopy(*MARK);
2085 TAINT_NOT; /* Each item is independent */
2092 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
2093 PL_curpm = newpm; /* ... and pop $1 et al */
2096 return pop_return();
2101 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2104 SV *dbsv = GvSV(PL_DBsub);
2106 if (!PERLDB_SUB_NN) {
2110 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2111 || strEQ(GvNAME(gv), "END")
2112 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2113 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2114 && (gv = (GV*)*svp) ))) {
2115 /* Use GV from the stack as a fallback. */
2116 /* GV is potentially non-unique, or contain different CV. */
2117 sv_setsv(dbsv, newRV((SV*)cv));
2120 gv_efullname3(dbsv, gv, Nullch);
2124 SvUPGRADE(dbsv, SVt_PVIV);
2126 SAVEIV(SvIVX(dbsv));
2127 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2131 PL_curcopdb = PL_curcop;
2132 cv = GvCV(PL_DBsub);
2142 register PERL_CONTEXT *cx;
2144 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2147 DIE(aTHX_ "Not a CODE reference");
2148 switch (SvTYPE(sv)) {
2154 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2156 SP = PL_stack_base + POPMARK;
2159 if (SvGMAGICAL(sv)) {
2161 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2164 sym = SvPV(sv, n_a);
2166 DIE(aTHX_ PL_no_usym, "a subroutine");
2167 if (PL_op->op_private & HINT_STRICT_REFS)
2168 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2169 cv = get_cv(sym, TRUE);
2173 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2174 tryAMAGICunDEREF(to_cv);
2177 if (SvTYPE(cv) == SVt_PVCV)
2182 DIE(aTHX_ "Not a CODE reference");
2187 if (!(cv = GvCVu((GV*)sv)))
2188 cv = sv_2cv(sv, &stash, &gv, FALSE);
2201 if (!CvROOT(cv) && !CvXSUB(cv)) {
2205 /* anonymous or undef'd function leaves us no recourse */
2206 if (CvANON(cv) || !(gv = CvGV(cv)))
2207 DIE(aTHX_ "Undefined subroutine called");
2209 /* autoloaded stub? */
2210 if (cv != GvCV(gv)) {
2213 /* should call AUTOLOAD now? */
2216 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2223 sub_name = sv_newmortal();
2224 gv_efullname3(sub_name, gv, Nullch);
2225 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2229 DIE(aTHX_ "Not a CODE reference");
2234 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2235 cv = get_db_sub(&sv, cv);
2237 DIE(aTHX_ "No DBsub routine");
2242 * First we need to check if the sub or method requires locking.
2243 * If so, we gain a lock on the CV, the first argument or the
2244 * stash (for static methods), as appropriate. This has to be
2245 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2246 * reschedule by returning a new op.
2248 MUTEX_LOCK(CvMUTEXP(cv));
2249 if (CvFLAGS(cv) & CVf_LOCKED) {
2251 if (CvFLAGS(cv) & CVf_METHOD) {
2252 if (SP > PL_stack_base + TOPMARK)
2253 sv = *(PL_stack_base + TOPMARK + 1);
2255 AV *av = (AV*)PL_curpad[0];
2256 if (hasargs || !av || AvFILLp(av) < 0
2257 || !(sv = AvARRAY(av)[0]))
2259 MUTEX_UNLOCK(CvMUTEXP(cv));
2260 Perl_croak(aTHX_ "no argument for locked method call");
2267 char *stashname = SvPV(sv, len);
2268 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2274 MUTEX_UNLOCK(CvMUTEXP(cv));
2275 mg = condpair_magic(sv);
2276 MUTEX_LOCK(MgMUTEXP(mg));
2277 if (MgOWNER(mg) == thr)
2278 MUTEX_UNLOCK(MgMUTEXP(mg));
2281 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2283 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2285 MUTEX_UNLOCK(MgMUTEXP(mg));
2286 SAVEDESTRUCTOR(Perl_unlock_condpair, sv);
2288 MUTEX_LOCK(CvMUTEXP(cv));
2291 * Now we have permission to enter the sub, we must distinguish
2292 * four cases. (0) It's an XSUB (in which case we don't care
2293 * about ownership); (1) it's ours already (and we're recursing);
2294 * (2) it's free (but we may already be using a cached clone);
2295 * (3) another thread owns it. Case (1) is easy: we just use it.
2296 * Case (2) means we look for a clone--if we have one, use it
2297 * otherwise grab ownership of cv. Case (3) means we look for a
2298 * clone (for non-XSUBs) and have to create one if we don't
2300 * Why look for a clone in case (2) when we could just grab
2301 * ownership of cv straight away? Well, we could be recursing,
2302 * i.e. we originally tried to enter cv while another thread
2303 * owned it (hence we used a clone) but it has been freed up
2304 * and we're now recursing into it. It may or may not be "better"
2305 * to use the clone but at least CvDEPTH can be trusted.
2307 if (CvOWNER(cv) == thr || CvXSUB(cv))
2308 MUTEX_UNLOCK(CvMUTEXP(cv));
2310 /* Case (2) or (3) */
2314 * XXX Might it be better to release CvMUTEXP(cv) while we
2315 * do the hv_fetch? We might find someone has pinched it
2316 * when we look again, in which case we would be in case
2317 * (3) instead of (2) so we'd have to clone. Would the fact
2318 * that we released the mutex more quickly make up for this?
2320 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2322 /* We already have a clone to use */
2323 MUTEX_UNLOCK(CvMUTEXP(cv));
2325 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2326 "entersub: %p already has clone %p:%s\n",
2327 thr, cv, SvPEEK((SV*)cv)));
2330 if (CvDEPTH(cv) == 0)
2331 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2334 /* (2) => grab ownership of cv. (3) => make clone */
2338 MUTEX_UNLOCK(CvMUTEXP(cv));
2339 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2340 "entersub: %p grabbing %p:%s in stash %s\n",
2341 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2342 HvNAME(CvSTASH(cv)) : "(none)"));
2345 /* Make a new clone. */
2347 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2348 MUTEX_UNLOCK(CvMUTEXP(cv));
2349 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2350 "entersub: %p cloning %p:%s\n",
2351 thr, cv, SvPEEK((SV*)cv))));
2353 * We're creating a new clone so there's no race
2354 * between the original MUTEX_UNLOCK and the
2355 * SvREFCNT_inc since no one will be trying to undef
2356 * it out from underneath us. At least, I don't think
2359 clonecv = cv_clone(cv);
2360 SvREFCNT_dec(cv); /* finished with this */
2361 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2362 CvOWNER(clonecv) = thr;
2366 DEBUG_S(if (CvDEPTH(cv) != 0)
2367 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2369 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2372 #endif /* USE_THREADS */
2375 #ifdef PERL_XSUB_OLDSTYLE
2376 if (CvOLDSTYLE(cv)) {
2377 I32 (*fp3)(int,int,int);
2379 register I32 items = SP - MARK;
2380 /* We dont worry to copy from @_. */
2385 PL_stack_sp = mark + 1;
2386 fp3 = (I32(*)(int,int,int)))CvXSUB(cv;
2387 items = (*fp3)(CvXSUBANY(cv).any_i32,
2388 MARK - PL_stack_base + 1,
2390 PL_stack_sp = PL_stack_base + items;
2393 #endif /* PERL_XSUB_OLDSTYLE */
2395 I32 markix = TOPMARK;
2400 /* Need to copy @_ to stack. Alternative may be to
2401 * switch stack to @_, and copy return values
2402 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2406 av = (AV*)PL_curpad[0];
2408 av = GvAV(PL_defgv);
2409 #endif /* USE_THREADS */
2410 items = AvFILLp(av) + 1; /* @_ is not tieable */
2413 /* Mark is at the end of the stack. */
2415 Copy(AvARRAY(av), SP + 1, items, SV*);
2420 /* We assume first XSUB in &DB::sub is the called one. */
2422 SAVESPTR(PL_curcop);
2423 PL_curcop = PL_curcopdb;
2426 /* Do we need to open block here? XXXX */
2427 (void)(*CvXSUB(cv))(aTHXo_ cv);
2429 /* Enforce some sanity in scalar context. */
2430 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2431 if (markix > PL_stack_sp - PL_stack_base)
2432 *(PL_stack_base + markix) = &PL_sv_undef;
2434 *(PL_stack_base + markix) = *PL_stack_sp;
2435 PL_stack_sp = PL_stack_base + markix;
2443 register I32 items = SP - MARK;
2444 AV* padlist = CvPADLIST(cv);
2445 SV** svp = AvARRAY(padlist);
2446 push_return(PL_op->op_next);
2447 PUSHBLOCK(cx, CXt_SUB, MARK);
2450 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2451 * that eval'' ops within this sub know the correct lexical space.
2452 * Owing the speed considerations, we choose to search for the cv
2453 * in doeval() instead.
2455 if (CvDEPTH(cv) < 2)
2456 (void)SvREFCNT_inc(cv);
2457 else { /* save temporaries on recursion? */
2458 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2460 AV *newpad = newAV();
2461 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2462 I32 ix = AvFILLp((AV*)svp[1]);
2463 svp = AvARRAY(svp[0]);
2464 for ( ;ix > 0; ix--) {
2465 if (svp[ix] != &PL_sv_undef) {
2466 char *name = SvPVX(svp[ix]);
2467 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2468 || *name == '&') /* anonymous code? */
2470 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2472 else { /* our own lexical */
2474 av_store(newpad, ix, sv = (SV*)newAV());
2475 else if (*name == '%')
2476 av_store(newpad, ix, sv = (SV*)newHV());
2478 av_store(newpad, ix, sv = NEWSV(0,0));
2483 av_store(newpad, ix, sv = NEWSV(0,0));
2487 av = newAV(); /* will be @_ */
2489 av_store(newpad, 0, (SV*)av);
2490 AvFLAGS(av) = AVf_REIFY;
2491 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2492 AvFILLp(padlist) = CvDEPTH(cv);
2493 svp = AvARRAY(padlist);
2498 AV* av = (AV*)PL_curpad[0];
2500 items = AvFILLp(av) + 1;
2502 /* Mark is at the end of the stack. */
2504 Copy(AvARRAY(av), SP + 1, items, SV*);
2509 #endif /* USE_THREADS */
2510 SAVESPTR(PL_curpad);
2511 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2514 #endif /* USE_THREADS */
2520 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2521 "%p entersub preparing @_\n", thr));
2523 av = (AV*)PL_curpad[0];
2530 cx->blk_sub.savearray = GvAV(PL_defgv);
2531 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2532 #endif /* USE_THREADS */
2533 cx->blk_sub.argarray = av;
2536 if (items > AvMAX(av) + 1) {
2538 if (AvARRAY(av) != ary) {
2539 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2540 SvPVX(av) = (char*)ary;
2542 if (items > AvMAX(av) + 1) {
2543 AvMAX(av) = items - 1;
2544 Renew(ary,items,SV*);
2546 SvPVX(av) = (char*)ary;
2549 Copy(MARK,AvARRAY(av),items,SV*);
2550 AvFILLp(av) = items - 1;
2558 /* warning must come *after* we fully set up the context
2559 * stuff so that __WARN__ handlers can safely dounwind()
2562 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2563 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2564 sub_crush_depth(cv);
2566 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2567 "%p entersub returning %p\n", thr, CvSTART(cv)));
2569 RETURNOP(CvSTART(cv));
2574 Perl_sub_crush_depth(pTHX_ CV *cv)
2577 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2579 SV* tmpstr = sv_newmortal();
2580 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2581 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2592 U32 lval = PL_op->op_flags & OPf_MOD;
2593 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2597 elem -= PL_curcop->cop_arybase;
2598 if (SvTYPE(av) != SVt_PVAV)
2600 svp = av_fetch(av, elem, lval && !defer);
2602 if (!svp || *svp == &PL_sv_undef) {
2605 DIE(aTHX_ PL_no_aelem, elem);
2606 lv = sv_newmortal();
2607 sv_upgrade(lv, SVt_PVLV);
2609 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2610 LvTARG(lv) = SvREFCNT_inc(av);
2611 LvTARGOFF(lv) = elem;
2616 if (PL_op->op_private & OPpLVAL_INTRO)
2617 save_aelem(av, elem, svp);
2618 else if (PL_op->op_private & OPpDEREF)
2619 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2621 sv = (svp ? *svp : &PL_sv_undef);
2622 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2623 sv = sv_mortalcopy(sv);
2629 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2635 Perl_croak(aTHX_ PL_no_modify);
2636 if (SvTYPE(sv) < SVt_RV)
2637 sv_upgrade(sv, SVt_RV);
2638 else if (SvTYPE(sv) >= SVt_PV) {
2639 (void)SvOOK_off(sv);
2640 Safefree(SvPVX(sv));
2641 SvLEN(sv) = SvCUR(sv) = 0;
2645 SvRV(sv) = NEWSV(355,0);
2648 SvRV(sv) = (SV*)newAV();
2651 SvRV(sv) = (SV*)newHV();
2666 if (SvTYPE(rsv) == SVt_PVCV) {
2672 SETs(method_common(sv, Null(U32*)));
2679 SV* sv = cSVOP->op_sv;
2680 U32 hash = SvUVX(sv);
2682 XPUSHs(method_common(sv, &hash));
2687 S_method_common(pTHX_ SV* meth, U32* hashp)
2699 name = SvPV(meth, namelen);
2700 sv = *(PL_stack_base + TOPMARK + 1);
2711 !(packname = SvPV(sv, packlen)) ||
2712 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2713 !(ob=(SV*)GvIO(iogv)))
2716 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2717 ? !isIDFIRST_utf8((U8*)packname)
2718 : !isIDFIRST(*packname)
2721 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2722 SvOK(sv) ? "without a package or object reference"
2723 : "on an undefined value");
2725 stash = gv_stashpvn(packname, packlen, TRUE);
2728 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2731 if (!ob || !SvOBJECT(ob))
2732 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2735 stash = SvSTASH(ob);
2738 /* shortcut for simple names */
2740 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2742 gv = (GV*)HeVAL(he);
2743 if (isGV(gv) && GvCV(gv) &&
2744 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2745 return (SV*)GvCV(gv);
2749 gv = gv_fetchmethod(stash, name);
2755 for (p = name; *p; p++) {
2757 sep = p, leaf = p + 1;
2758 else if (*p == ':' && *(p + 1) == ':')
2759 sep = p, leaf = p + 2;
2761 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2762 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2763 packlen = strlen(packname);
2767 packlen = sep - name;
2770 "Can't locate object method \"%s\" via package \"%s\"",
2773 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2778 unset_cvowner(pTHXo_ void *cvarg)
2780 register CV* cv = (CV *) cvarg;
2783 #endif /* DEBUGGING */
2785 DEBUG_S((PerlIO_printf(PerlIO_stderr(), "%p unsetting CvOWNER of %p:%s\n",
2786 thr, cv, SvPEEK((SV*)cv))));
2787 MUTEX_LOCK(CvMUTEXP(cv));
2788 DEBUG_S(if (CvDEPTH(cv) != 0)
2789 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2791 assert(thr == CvOWNER(cv));
2793 MUTEX_UNLOCK(CvMUTEXP(cv));
2796 #endif /* USE_THREADS */