3 * Copyright (c) 1991-1999, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
32 #define HOP(pos,off) (IN_UTF8 ? utf8_hop(pos, off) : (pos + off))
38 S_unset_cvowner(pTHX_ void *cvarg)
40 register CV* cv = (CV *) cvarg;
43 #endif /* DEBUGGING */
45 DEBUG_S((PerlIO_printf(PerlIO_stderr(), "%p unsetting CvOWNER of %p:%s\n",
46 thr, cv, SvPEEK((SV*)cv))));
47 MUTEX_LOCK(CvMUTEXP(cv));
48 DEBUG_S(if (CvDEPTH(cv) != 0)
49 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
51 assert(thr == CvOWNER(cv));
53 MUTEX_UNLOCK(CvMUTEXP(cv));
56 #endif /* USE_THREADS */
67 PL_curcop = (COP*)PL_op;
68 TAINT_NOT; /* Each statement is presumed innocent */
69 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
78 if (PL_op->op_private & OPpLVAL_INTRO)
79 PUSHs(save_scalar(cGVOP->op_gv));
81 PUSHs(GvSV(cGVOP->op_gv));
92 PUSHMARK(PL_stack_sp);
102 sv_setpvn(TARG,s,len);
110 XPUSHs((SV*)cGVOP->op_gv);
121 RETURNOP(cLOGOP->op_other);
130 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
132 temp = left; left = right; right = temp;
134 if (PL_tainting && PL_tainted && !SvTAINTED(left))
136 SvSetMagicSV(right, left);
145 RETURNOP(cCONDOP->op_true);
147 RETURNOP(cCONDOP->op_false);
153 TAINT_NOT; /* Each statement is presumed innocent */
154 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
156 oldsave = PL_scopestack[PL_scopestack_ix - 1];
157 LEAVE_SCOPE(oldsave);
163 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
170 sv_setpvn(TARG,s,len);
172 else if (SvGMAGICAL(TARG))
174 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
175 sv_setpv(TARG, ""); /* Suppress warning. */
176 s = SvPV_force(TARG, len);
180 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_fullname3(sv, gv, Nullch);
354 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened", SvPV(sv,n_a));
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_fullname3(sv, gv, Nullch);
365 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for input",
367 else if (ckWARN(WARN_CLOSED))
368 Perl_warner(aTHX_ WARN_CLOSED, "print on closed filehandle %s",
371 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
378 if (!do_print(*MARK, fp))
382 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
391 if (!do_print(*MARK, fp))
400 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
403 if (IoFLAGS(io) & IOf_FLUSH)
404 if (PerlIO_flush(fp) == EOF)
425 tryAMAGICunDEREF(to_av);
428 if (SvTYPE(av) != SVt_PVAV)
429 DIE(aTHX_ "Not an ARRAY reference");
430 if (PL_op->op_flags & OPf_REF) {
436 if (SvTYPE(sv) == SVt_PVAV) {
438 if (PL_op->op_flags & OPf_REF) {
446 if (SvTYPE(sv) != SVt_PVGV) {
450 if (SvGMAGICAL(sv)) {
456 if (PL_op->op_flags & OPf_REF ||
457 PL_op->op_private & HINT_STRICT_REFS)
458 DIE(aTHX_ PL_no_usym, "an ARRAY");
459 if (ckWARN(WARN_UNINITIALIZED))
460 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
461 if (GIMME == G_ARRAY) {
468 if ((PL_op->op_flags & OPf_SPECIAL) &&
469 !(PL_op->op_flags & OPf_MOD))
471 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
476 if (PL_op->op_private & HINT_STRICT_REFS)
477 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
478 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
485 if (PL_op->op_private & OPpLVAL_INTRO)
487 if (PL_op->op_flags & OPf_REF) {
494 if (GIMME == G_ARRAY) {
495 I32 maxarg = AvFILL(av) + 1;
496 (void)POPs; /* XXXX May be optimized away? */
498 if (SvRMAGICAL(av)) {
500 for (i=0; i < maxarg; i++) {
501 SV **svp = av_fetch(av, i, FALSE);
502 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
506 Copy(AvARRAY(av), SP+1, maxarg, SV*);
512 I32 maxarg = AvFILL(av) + 1;
525 tryAMAGICunDEREF(to_hv);
528 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
529 DIE(aTHX_ "Not a HASH reference");
530 if (PL_op->op_flags & OPf_REF) {
536 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
538 if (PL_op->op_flags & OPf_REF) {
546 if (SvTYPE(sv) != SVt_PVGV) {
550 if (SvGMAGICAL(sv)) {
556 if (PL_op->op_flags & OPf_REF ||
557 PL_op->op_private & HINT_STRICT_REFS)
558 DIE(aTHX_ PL_no_usym, "a HASH");
559 if (ckWARN(WARN_UNINITIALIZED))
560 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
561 if (GIMME == G_ARRAY) {
568 if ((PL_op->op_flags & OPf_SPECIAL) &&
569 !(PL_op->op_flags & OPf_MOD))
571 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
576 if (PL_op->op_private & HINT_STRICT_REFS)
577 DIE(aTHX_ PL_no_symref, sym, "a HASH");
578 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
585 if (PL_op->op_private & OPpLVAL_INTRO)
587 if (PL_op->op_flags & OPf_REF) {
594 if (GIMME == G_ARRAY) { /* array wanted */
595 *PL_stack_sp = (SV*)hv;
600 if (SvTYPE(hv) == SVt_PVAV)
601 hv = avhv_keys((AV*)hv);
603 Perl_sv_setpvf(aTHX_ TARG, "%ld/%ld",
604 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
616 SV **lastlelem = PL_stack_sp;
617 SV **lastrelem = PL_stack_base + POPMARK;
618 SV **firstrelem = PL_stack_base + POPMARK + 1;
619 SV **firstlelem = lastrelem + 1;
632 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
634 /* If there's a common identifier on both sides we have to take
635 * special care that assigning the identifier on the left doesn't
636 * clobber a value on the right that's used later in the list.
638 if (PL_op->op_private & OPpASSIGN_COMMON) {
639 EXTEND_MORTAL(lastrelem - firstrelem + 1);
640 for (relem = firstrelem; relem <= lastrelem; relem++) {
643 TAINT_NOT; /* Each item is independent */
644 *relem = sv_mortalcopy(sv);
653 while (lelem <= lastlelem) {
654 TAINT_NOT; /* Each item stands on its own, taintwise. */
656 switch (SvTYPE(sv)) {
659 magic = SvMAGICAL(ary) != 0;
662 av_extend(ary, lastrelem - relem);
664 while (relem <= lastrelem) { /* gobble up all the rest */
670 didstore = av_store(ary,i++,sv);
684 magic = SvMAGICAL(hash) != 0;
687 while (relem < lastrelem) { /* gobble up all the rest */
692 sv = &PL_sv_no, relem++;
693 tmpstr = NEWSV(29,0);
695 sv_setsv(tmpstr,*relem); /* value */
697 didstore = hv_store_ent(hash,sv,tmpstr,0);
699 if (SvSMAGICAL(tmpstr))
706 if (relem == lastrelem) {
709 if (ckWARN(WARN_UNSAFE)) {
710 if (relem == firstrelem &&
712 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
713 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
714 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
716 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
718 tmpstr = NEWSV(29,0);
719 didstore = hv_store_ent(hash,*relem,tmpstr,0);
721 if (SvSMAGICAL(tmpstr))
733 if (SvIMMORTAL(sv)) {
734 if (relem <= lastrelem)
738 if (relem <= lastrelem) {
739 sv_setsv(sv, *relem);
743 sv_setsv(sv, &PL_sv_undef);
748 if (PL_delaymagic & ~DM_DELAY) {
749 if (PL_delaymagic & DM_UID) {
751 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
754 (void)setreuid(PL_uid,PL_euid);
757 if ((PL_delaymagic & DM_UID) == DM_RUID) {
758 (void)setruid(PL_uid);
759 PL_delaymagic &= ~DM_RUID;
761 # endif /* HAS_SETRUID */
763 if ((PL_delaymagic & DM_UID) == DM_EUID) {
764 (void)seteuid(PL_uid);
765 PL_delaymagic &= ~DM_EUID;
767 # endif /* HAS_SETEUID */
768 if (PL_delaymagic & DM_UID) {
769 if (PL_uid != PL_euid)
770 DIE(aTHX_ "No setreuid available");
771 (void)PerlProc_setuid(PL_uid);
773 # endif /* HAS_SETREUID */
774 #endif /* HAS_SETRESUID */
775 PL_uid = (int)PerlProc_getuid();
776 PL_euid = (int)PerlProc_geteuid();
778 if (PL_delaymagic & DM_GID) {
780 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
783 (void)setregid(PL_gid,PL_egid);
786 if ((PL_delaymagic & DM_GID) == DM_RGID) {
787 (void)setrgid(PL_gid);
788 PL_delaymagic &= ~DM_RGID;
790 # endif /* HAS_SETRGID */
792 if ((PL_delaymagic & DM_GID) == DM_EGID) {
793 (void)setegid(PL_gid);
794 PL_delaymagic &= ~DM_EGID;
796 # endif /* HAS_SETEGID */
797 if (PL_delaymagic & DM_GID) {
798 if (PL_gid != PL_egid)
799 DIE(aTHX_ "No setregid available");
800 (void)PerlProc_setgid(PL_gid);
802 # endif /* HAS_SETREGID */
803 #endif /* HAS_SETRESGID */
804 PL_gid = (int)PerlProc_getgid();
805 PL_egid = (int)PerlProc_getegid();
807 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
814 else if (gimme == G_SCALAR) {
817 SETi(lastrelem - firstrelem + 1);
823 SP = firstrelem + (lastlelem - firstlelem);
824 lelem = firstlelem + (relem - firstrelem);
826 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
834 register PMOP *pm = cPMOP;
835 SV *rv = sv_newmortal();
836 SV *sv = newSVrv(rv, "Regexp");
837 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
844 register PMOP *pm = cPMOP;
850 char *truebase; /* Start of string, may be
851 relocated if REx engine
852 copies the string. */
853 register REGEXP *rx = pm->op_pmregexp;
858 I32 oldsave = PL_savestack_ix;
859 I32 update_minmatch = 1;
862 if (PL_op->op_flags & OPf_STACKED)
868 PUTBACK; /* EVAL blocks need stack_sp. */
872 DIE(aTHX_ "panic: do_match");
873 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
874 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
877 if (pm->op_pmdynflags & PMdf_USED) {
879 if (gimme == G_ARRAY)
884 if (!rx->prelen && PL_curpm) {
886 rx = pm->op_pmregexp;
888 if (rx->minlen > len) goto failure;
892 /* XXXX What part of this is needed with true \G-support? */
893 if (global = pm->op_pmflags & PMf_GLOBAL) {
895 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
896 MAGIC* mg = mg_find(TARG, 'g');
897 if (mg && mg->mg_len >= 0) {
898 if (!(rx->reganch & ROPT_GPOS_SEEN))
899 rx->endp[0] = rx->startp[0] = mg->mg_len;
900 else if (rx->reganch & ROPT_ANCH_GPOS) {
901 r_flags |= REXEC_IGNOREPOS;
902 rx->endp[0] = rx->startp[0] = mg->mg_len;
904 minmatch = (mg->mg_flags & MGf_MINMATCH);
909 if ((gimme != G_ARRAY && !global && rx->nparens)
910 || SvTEMP(TARG) || PL_sawampersand)
911 r_flags |= REXEC_COPY_STR;
912 if (SvSCREAM(TARG) && rx->check_substr
913 && SvTYPE(rx->check_substr) == SVt_PVBM
914 && SvVALID(rx->check_substr))
915 r_flags |= REXEC_SCREAM;
917 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
918 SAVEINT(PL_multiline);
919 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
923 if (global && rx->startp[0] != -1) {
924 t = s = rx->endp[0] + truebase;
925 if ((s + rx->minlen) > strend)
927 if (update_minmatch++)
928 minmatch = had_zerolen;
930 if (rx->check_substr) {
931 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
932 SV *c = rx->check_substr;
934 if (r_flags & REXEC_SCREAM) {
938 if (PL_screamfirst[BmRARE(c)] < 0
939 && !( BmRARE(c) == '\n' && (BmPREVIOUS(c) == SvCUR(c) - 1)
943 b = (char*)HOP((U8*)s, rx->check_offset_min);
944 if (!(s = screaminstr(TARG, c, b - s, 0, &p, 0)))
947 if ((rx->reganch & ROPT_CHECK_ALL)
948 && !PL_sawampersand && !SvTAIL(c))
951 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
952 (unsigned char*)strend, c,
953 PL_multiline ? FBMrf_MULTILINE : 0)))
955 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
957 if (s && rx->check_offset_max < s - t) {
959 s = (char*)HOP((U8*)s, -rx->check_offset_max);
964 /* Now checkstring is fixed, i.e. at fixed offset from the
965 beginning of match, and the match is anchored at s. */
966 else if (!PL_multiline) { /* Anchored near beginning of string. */
968 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
970 if (SvTAIL(rx->check_substr)) {
971 slen = SvCUR(rx->check_substr); /* >= 1 */
973 if ( strend - b > slen || strend - b < slen - 1 )
975 if ( strend - b == slen && strend[-1] != '\n')
977 /* Now should match b[0..slen-2] */
979 if (slen && (*SvPVX(rx->check_substr) != *b
981 && memNE(SvPVX(rx->check_substr), b, slen))))
983 if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
985 } else { /* Assume len > 0 */
986 if (*SvPVX(rx->check_substr) != *b
987 || ((slen = SvCUR(rx->check_substr)) > 1
988 && memNE(SvPVX(rx->check_substr), b, slen)))
990 if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
994 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
995 && rx->check_substr == rx->float_substr) {
996 SvREFCNT_dec(rx->check_substr);
997 rx->check_substr = Nullsv; /* opt is being useless */
998 rx->float_substr = Nullsv;
1001 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1004 if (pm->op_pmflags & PMf_ONCE)
1005 pm->op_pmdynflags |= PMdf_USED;
1014 RX_MATCH_TAINTED_on(rx);
1015 TAINT_IF(RX_MATCH_TAINTED(rx));
1016 if (gimme == G_ARRAY) {
1019 iters = rx->nparens;
1020 if (global && !iters)
1024 SPAGAIN; /* EVAL blocks could move the stack. */
1025 EXTEND(SP, iters + i);
1026 EXTEND_MORTAL(iters + i);
1027 for (i = !i; i <= iters; i++) {
1028 PUSHs(sv_newmortal());
1030 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1031 len = rx->endp[i] - rx->startp[i];
1032 s = rx->startp[i] + truebase;
1033 sv_setpvn(*SP, s, len);
1037 had_zerolen = (rx->startp[0] != -1
1038 && rx->startp[0] == rx->endp[0]);
1039 PUTBACK; /* EVAL blocks may use stack */
1040 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1045 LEAVE_SCOPE(oldsave);
1051 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1052 mg = mg_find(TARG, 'g');
1054 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1055 mg = mg_find(TARG, 'g');
1057 if (rx->startp[0] != -1) {
1058 mg->mg_len = rx->endp[0];
1059 if (rx->startp[0] == rx->endp[0])
1060 mg->mg_flags |= MGf_MINMATCH;
1062 mg->mg_flags &= ~MGf_MINMATCH;
1065 LEAVE_SCOPE(oldsave);
1069 yup: /* Confirmed by check_substr */
1071 RX_MATCH_TAINTED_on(rx);
1072 TAINT_IF(RX_MATCH_TAINTED(rx));
1073 ++BmUSEFUL(rx->check_substr);
1075 if (pm->op_pmflags & PMf_ONCE)
1076 pm->op_pmdynflags |= PMdf_USED;
1077 if (RX_MATCH_COPIED(rx))
1078 Safefree(rx->subbeg);
1079 RX_MATCH_COPIED_off(rx);
1080 rx->subbeg = Nullch;
1082 rx->subbeg = truebase;
1083 rx->startp[0] = s - truebase;
1084 rx->endp[0] = s - truebase + SvCUR(rx->check_substr);
1085 rx->sublen = strend - truebase;
1088 if (PL_sawampersand) {
1091 rx->subbeg = savepvn(t, strend - t);
1092 rx->sublen = strend - t;
1093 RX_MATCH_COPIED_on(rx);
1094 off = rx->startp[0] = s - t;
1095 rx->endp[0] = off + SvCUR(rx->check_substr);
1097 else { /* startp/endp are used by @- @+. */
1098 rx->startp[0] = s - truebase;
1099 rx->endp[0] = s - truebase + SvCUR(rx->check_substr);
1101 LEAVE_SCOPE(oldsave);
1105 if (rx->check_substr)
1106 ++BmUSEFUL(rx->check_substr);
1109 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1110 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1111 MAGIC* mg = mg_find(TARG, 'g');
1116 LEAVE_SCOPE(oldsave);
1117 if (gimme == G_ARRAY)
1123 Perl_do_readline(pTHX)
1125 dSP; dTARGETSTACKED;
1130 register IO *io = GvIO(PL_last_in_gv);
1131 register I32 type = PL_op->op_type;
1132 I32 gimme = GIMME_V;
1135 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1137 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1140 call_method("READLINE", gimme);
1143 if (gimme == G_SCALAR)
1144 SvSetMagicSV_nosteal(TARG, TOPs);
1151 if (IoFLAGS(io) & IOf_ARGV) {
1152 if (IoFLAGS(io) & IOf_START) {
1153 IoFLAGS(io) &= ~IOf_START;
1155 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1156 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1157 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1158 SvSETMAGIC(GvSV(PL_last_in_gv));
1163 fp = nextargv(PL_last_in_gv);
1164 if (!fp) { /* Note: fp != IoIFP(io) */
1165 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1166 IoFLAGS(io) |= IOf_START;
1169 else if (type == OP_GLOB) {
1170 SV *tmpcmd = NEWSV(55, 0);
1174 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1175 /* since spawning off a process is a real performance hit */
1177 #include <descrip.h>
1178 #include <lib$routines.h>
1181 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1182 char vmsspec[NAM$C_MAXRSS+1];
1183 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1184 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1185 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1188 struct dsc$descriptor_s wilddsc
1189 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1190 struct dsc$descriptor_vs rsdsc
1191 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1192 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1194 /* We could find out if there's an explicit dev/dir or version
1195 by peeking into lib$find_file's internal context at
1196 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1197 but that's unsupported, so I don't want to do it now and
1198 have it bite someone in the future. */
1199 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1200 cp = SvPV(tmpglob,i);
1202 if (cp[i] == ';') hasver = 1;
1204 if (sts) hasver = 1;
1208 hasdir = isunix = 1;
1211 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1216 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1218 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1219 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1220 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1221 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1222 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1223 &dfltdsc,NULL,NULL,NULL))&1)) {
1224 end = rstr + (unsigned long int) *rslt;
1225 if (!hasver) while (*end != ';') end--;
1226 *(end++) = '\n'; *end = '\0';
1227 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1229 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1234 while (*(--begin) != ']' && *begin != '>') ;
1237 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1239 if (cxt) (void)lib$find_file_end(&cxt);
1240 if (ok && sts != RMS$_NMF &&
1241 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1244 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1246 PerlIO_close(tmpfp);
1250 PerlIO_rewind(tmpfp);
1252 IoIFP(io) = fp = tmpfp;
1253 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1260 sv_setpv(tmpcmd, "for a in ");
1261 sv_catsv(tmpcmd, tmpglob);
1262 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1265 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1266 sv_catsv(tmpcmd, tmpglob);
1269 sv_setpv(tmpcmd, "for a in ");
1270 sv_catsv(tmpcmd, tmpglob);
1271 sv_catpv(tmpcmd, "; do echo -e \"$a\\0\\c\"; done |");
1273 sv_setpv(tmpcmd, "perlglob ");
1274 sv_catsv(tmpcmd, tmpglob);
1275 sv_catpv(tmpcmd, " |");
1276 #endif /* !CYGWIN */
1281 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1282 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1283 sv_catsv(tmpcmd, tmpglob);
1284 sv_catpv(tmpcmd, "' 2>/dev/null |");
1286 sv_setpv(tmpcmd, "echo ");
1287 sv_catsv(tmpcmd, tmpglob);
1289 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1291 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1294 #endif /* !DOSISH */
1295 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1296 FALSE, O_RDONLY, 0, Nullfp);
1302 else if (type == OP_GLOB)
1306 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1307 if (type == OP_GLOB)
1308 Perl_warner(aTHX_ WARN_CLOSED, "glob failed (can't start child: %s)",
1311 Perl_warner(aTHX_ WARN_CLOSED, "Read on closed filehandle <%s>",
1312 GvENAME(PL_last_in_gv));
1314 if (gimme == G_SCALAR) {
1315 (void)SvOK_off(TARG);
1321 if (gimme == G_SCALAR) {
1325 (void)SvUPGRADE(sv, SVt_PV);
1326 tmplen = SvLEN(sv); /* remember if already alloced */
1328 Sv_Grow(sv, 80); /* try short-buffering it */
1329 if (type == OP_RCATLINE)
1335 sv = sv_2mortal(NEWSV(57, 80));
1339 /* flip-flop EOF state for a snarfed empty file */
1340 #define SNARF_EOF(gimme,rs,io,sv) \
1341 ((gimme != G_SCALAR || SvCUR(sv) \
1342 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1343 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1344 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1347 if (!sv_gets(sv, fp, offset)
1348 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1350 PerlIO_clearerr(fp);
1351 if (IoFLAGS(io) & IOf_ARGV) {
1352 fp = nextargv(PL_last_in_gv);
1355 (void)do_close(PL_last_in_gv, FALSE);
1356 IoFLAGS(io) |= IOf_START;
1358 else if (type == OP_GLOB) {
1359 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1360 Perl_warner(aTHX_ WARN_CLOSED,
1361 "glob failed (child exited with status %d%s)",
1362 STATUS_CURRENT >> 8,
1363 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1366 if (gimme == G_SCALAR) {
1367 (void)SvOK_off(TARG);
1372 /* This should not be marked tainted if the fp is marked clean */
1373 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1380 if (type == OP_GLOB) {
1383 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1384 tmps = SvEND(sv) - 1;
1385 if (*tmps == *SvPVX(PL_rs)) {
1390 for (tmps = SvPVX(sv); *tmps; tmps++)
1391 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1392 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1394 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1395 (void)POPs; /* Unmatched wildcard? Chuck it... */
1399 if (gimme == G_ARRAY) {
1400 if (SvLEN(sv) - SvCUR(sv) > 20) {
1401 SvLEN_set(sv, SvCUR(sv)+1);
1402 Renew(SvPVX(sv), SvLEN(sv), char);
1404 sv = sv_2mortal(NEWSV(58, 80));
1407 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1408 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1412 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1413 Renew(SvPVX(sv), SvLEN(sv), char);
1422 register PERL_CONTEXT *cx;
1423 I32 gimme = OP_GIMME(PL_op, -1);
1426 if (cxstack_ix >= 0)
1427 gimme = cxstack[cxstack_ix].blk_gimme;
1435 PUSHBLOCK(cx, CXt_BLOCK, SP);
1447 U32 lval = PL_op->op_flags & OPf_MOD;
1448 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1451 if (SvTYPE(hv) == SVt_PVHV) {
1452 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1453 svp = he ? &HeVAL(he) : 0;
1455 else if (SvTYPE(hv) == SVt_PVAV) {
1456 if (PL_op->op_private & OPpLVAL_INTRO)
1457 DIE(aTHX_ "Can't localize pseudo-hash element");
1458 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1464 if (!svp || *svp == &PL_sv_undef) {
1469 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1471 lv = sv_newmortal();
1472 sv_upgrade(lv, SVt_PVLV);
1474 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1475 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1476 LvTARG(lv) = SvREFCNT_inc(hv);
1481 if (PL_op->op_private & OPpLVAL_INTRO) {
1482 if (HvNAME(hv) && isGV(*svp))
1483 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1485 save_helem(hv, keysv, svp);
1487 else if (PL_op->op_private & OPpDEREF)
1488 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1490 sv = (svp ? *svp : &PL_sv_undef);
1491 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1492 * Pushing the magical RHS on to the stack is useless, since
1493 * that magic is soon destined to be misled by the local(),
1494 * and thus the later pp_sassign() will fail to mg_get() the
1495 * old value. This should also cure problems with delayed
1496 * mg_get()s. GSAR 98-07-03 */
1497 if (!lval && SvGMAGICAL(sv))
1498 sv = sv_mortalcopy(sv);
1506 register PERL_CONTEXT *cx;
1512 if (PL_op->op_flags & OPf_SPECIAL) {
1513 cx = &cxstack[cxstack_ix];
1514 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1519 gimme = OP_GIMME(PL_op, -1);
1521 if (cxstack_ix >= 0)
1522 gimme = cxstack[cxstack_ix].blk_gimme;
1528 if (gimme == G_VOID)
1530 else if (gimme == G_SCALAR) {
1533 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1536 *MARK = sv_mortalcopy(TOPs);
1539 *MARK = &PL_sv_undef;
1543 else if (gimme == G_ARRAY) {
1544 /* in case LEAVE wipes old return values */
1545 for (mark = newsp + 1; mark <= SP; mark++) {
1546 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1547 *mark = sv_mortalcopy(*mark);
1548 TAINT_NOT; /* Each item is independent */
1552 PL_curpm = newpm; /* Don't pop $1 et al till now */
1562 register PERL_CONTEXT *cx;
1567 cx = &cxstack[cxstack_ix];
1568 if (CxTYPE(cx) != CXt_LOOP)
1569 DIE(aTHX_ "panic: pp_iter");
1571 av = cx->blk_loop.iterary;
1572 if (SvTYPE(av) != SVt_PVAV) {
1573 /* iterate ($min .. $max) */
1574 if (cx->blk_loop.iterlval) {
1575 /* string increment */
1576 register SV* cur = cx->blk_loop.iterlval;
1578 char *max = SvPV((SV*)av, maxlen);
1579 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1580 #ifndef USE_THREADS /* don't risk potential race */
1581 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1582 && !SvMAGICAL(*cx->blk_loop.itervar))
1584 /* safe to reuse old SV */
1585 sv_setsv(*cx->blk_loop.itervar, cur);
1590 /* we need a fresh SV every time so that loop body sees a
1591 * completely new SV for closures/references to work as
1593 SvREFCNT_dec(*cx->blk_loop.itervar);
1594 *cx->blk_loop.itervar = newSVsv(cur);
1596 if (strEQ(SvPVX(cur), max))
1597 sv_setiv(cur, 0); /* terminate next time */
1604 /* integer increment */
1605 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1608 #ifndef USE_THREADS /* don't risk potential race */
1609 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1610 && !SvMAGICAL(*cx->blk_loop.itervar))
1612 /* safe to reuse old SV */
1613 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1618 /* we need a fresh SV every time so that loop body sees a
1619 * completely new SV for closures/references to work as they
1621 SvREFCNT_dec(*cx->blk_loop.itervar);
1622 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1628 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1631 SvREFCNT_dec(*cx->blk_loop.itervar);
1633 if (sv = (SvMAGICAL(av))
1634 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1635 : AvARRAY(av)[++cx->blk_loop.iterix])
1639 if (av != PL_curstack && SvIMMORTAL(sv)) {
1640 SV *lv = cx->blk_loop.iterlval;
1641 if (lv && SvREFCNT(lv) > 1) {
1646 SvREFCNT_dec(LvTARG(lv));
1648 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1649 sv_upgrade(lv, SVt_PVLV);
1651 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1653 LvTARG(lv) = SvREFCNT_inc(av);
1654 LvTARGOFF(lv) = cx->blk_loop.iterix;
1655 LvTARGLEN(lv) = (UV) -1;
1659 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1666 register PMOP *pm = cPMOP;
1682 register REGEXP *rx = pm->op_pmregexp;
1684 int force_on_match = 0;
1685 I32 oldsave = PL_savestack_ix;
1686 I32 update_minmatch = 1;
1688 /* known replacement string? */
1689 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1690 if (PL_op->op_flags & OPf_STACKED)
1696 if (SvREADONLY(TARG)
1697 || (SvTYPE(TARG) > SVt_PVLV
1698 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1699 Perl_croak(aTHX_ PL_no_modify);
1702 s = SvPV(TARG, len);
1703 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1705 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1706 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1713 DIE(aTHX_ "panic: do_subst");
1716 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1717 position, once with zero-length,
1718 second time with non-zero. */
1720 if (!rx->prelen && PL_curpm) {
1722 rx = pm->op_pmregexp;
1724 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1725 ? REXEC_COPY_STR : 0;
1726 if (SvSCREAM(TARG) && rx->check_substr
1727 && SvTYPE(rx->check_substr) == SVt_PVBM
1728 && SvVALID(rx->check_substr))
1729 r_flags |= REXEC_SCREAM;
1730 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1731 SAVEINT(PL_multiline);
1732 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1735 if (rx->check_substr) {
1736 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1737 if (r_flags & REXEC_SCREAM) {
1741 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1744 b = (char*)HOP((U8*)s, rx->check_offset_min);
1745 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
1748 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
1749 (unsigned char*)strend,
1751 PL_multiline ? FBMrf_MULTILINE : 0)))
1753 if (s && rx->check_offset_max < s - m) {
1754 ++BmUSEFUL(rx->check_substr);
1755 s = (char*)HOP((U8*)s, -rx->check_offset_max);
1760 /* Now checkstring is fixed, i.e. at fixed offset from the
1761 beginning of match, and the match is anchored at s. */
1762 else if (!PL_multiline) { /* Anchored at beginning of string. */
1764 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
1765 if (*SvPVX(rx->check_substr) != *b
1766 || ((slen = SvCUR(rx->check_substr)) > 1
1767 && memNE(SvPVX(rx->check_substr), b, slen)))
1770 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
1771 && rx->check_substr == rx->float_substr) {
1772 SvREFCNT_dec(rx->check_substr);
1773 rx->check_substr = Nullsv; /* opt is being useless */
1774 rx->float_substr = Nullsv;
1778 /* only replace once? */
1779 once = !(rpm->op_pmflags & PMf_GLOBAL);
1781 /* known replacement string? */
1782 c = dstr ? SvPV(dstr, clen) : Nullch;
1784 /* can do inplace substitution? */
1785 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1786 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1787 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1790 LEAVE_SCOPE(oldsave);
1793 if (force_on_match) {
1795 s = SvPV_force(TARG, len);
1800 SvSCREAM_off(TARG); /* disable possible screamer */
1802 rxtainted |= RX_MATCH_TAINTED(rx);
1803 m = orig + rx->startp[0];
1804 d = orig + rx->endp[0];
1806 if (m - s > strend - d) { /* faster to shorten from end */
1808 Copy(c, m, clen, char);
1813 Move(d, m, i, char);
1817 SvCUR_set(TARG, m - s);
1820 else if (i = m - s) { /* faster from front */
1828 Copy(c, m, clen, char);
1833 Copy(c, d, clen, char);
1838 TAINT_IF(rxtainted & 1);
1844 if (iters++ > maxiters)
1845 DIE(aTHX_ "Substitution loop");
1846 rxtainted |= RX_MATCH_TAINTED(rx);
1847 m = rx->startp[0] + orig;
1851 Move(s, d, i, char);
1855 Copy(c, d, clen, char);
1858 s = rx->endp[0] + orig;
1859 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1860 Nullsv, NULL, REXEC_NOT_FIRST)); /* don't match same null twice */
1863 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1864 Move(s, d, i+1, char); /* include the NUL */
1866 TAINT_IF(rxtainted & 1);
1868 PUSHs(sv_2mortal(newSViv((I32)iters)));
1870 (void)SvPOK_only(TARG);
1871 TAINT_IF(rxtainted);
1872 if (SvSMAGICAL(TARG)) {
1878 LEAVE_SCOPE(oldsave);
1882 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1883 if (force_on_match) {
1885 s = SvPV_force(TARG, len);
1888 rxtainted |= RX_MATCH_TAINTED(rx);
1889 dstr = NEWSV(25, len);
1890 sv_setpvn(dstr, m, s-m);
1893 register PERL_CONTEXT *cx;
1896 RETURNOP(cPMOP->op_pmreplroot);
1898 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1900 if (iters++ > maxiters)
1901 DIE(aTHX_ "Substitution loop");
1902 rxtainted |= RX_MATCH_TAINTED(rx);
1903 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1908 strend = s + (strend - m);
1910 m = rx->startp[0] + orig;
1911 sv_catpvn(dstr, s, m-s);
1912 s = rx->endp[0] + orig;
1914 sv_catpvn(dstr, c, clen);
1917 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1918 sv_catpvn(dstr, s, strend - s);
1920 (void)SvOOK_off(TARG);
1921 Safefree(SvPVX(TARG));
1922 SvPVX(TARG) = SvPVX(dstr);
1923 SvCUR_set(TARG, SvCUR(dstr));
1924 SvLEN_set(TARG, SvLEN(dstr));
1928 TAINT_IF(rxtainted & 1);
1930 PUSHs(sv_2mortal(newSViv((I32)iters)));
1932 (void)SvPOK_only(TARG);
1933 TAINT_IF(rxtainted);
1936 LEAVE_SCOPE(oldsave);
1942 ++BmUSEFUL(rx->check_substr);
1947 LEAVE_SCOPE(oldsave);
1956 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1957 ++*PL_markstack_ptr;
1958 LEAVE; /* exit inner scope */
1961 if (PL_stack_base + *PL_markstack_ptr > SP) {
1963 I32 gimme = GIMME_V;
1965 LEAVE; /* exit outer scope */
1966 (void)POPMARK; /* pop src */
1967 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1968 (void)POPMARK; /* pop dst */
1969 SP = PL_stack_base + POPMARK; /* pop original mark */
1970 if (gimme == G_SCALAR) {
1974 else if (gimme == G_ARRAY)
1981 ENTER; /* enter inner scope */
1984 src = PL_stack_base[*PL_markstack_ptr];
1988 RETURNOP(cLOGOP->op_other);
1999 register PERL_CONTEXT *cx;
2000 struct block_sub cxsub;
2003 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
2006 if (gimme == G_SCALAR) {
2009 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
2011 *MARK = SvREFCNT_inc(TOPs);
2016 *MARK = sv_mortalcopy(TOPs);
2019 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2022 *MARK = &PL_sv_undef;
2026 else if (gimme == G_ARRAY) {
2027 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2028 if (!SvTEMP(*MARK)) {
2029 *MARK = sv_mortalcopy(*MARK);
2030 TAINT_NOT; /* Each item is independent */
2036 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
2037 PL_curpm = newpm; /* ... and pop $1 et al */
2040 return pop_return();
2044 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2047 SV *dbsv = GvSV(PL_DBsub);
2049 if (!PERLDB_SUB_NN) {
2053 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2054 || strEQ(GvNAME(gv), "END")
2055 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2056 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2057 && (gv = (GV*)*svp) ))) {
2058 /* Use GV from the stack as a fallback. */
2059 /* GV is potentially non-unique, or contain different CV. */
2060 sv_setsv(dbsv, newRV((SV*)cv));
2063 gv_efullname3(dbsv, gv, Nullch);
2067 SvUPGRADE(dbsv, SVt_PVIV);
2069 SAVEIV(SvIVX(dbsv));
2070 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
2074 PL_curcopdb = PL_curcop;
2075 cv = GvCV(PL_DBsub);
2085 register PERL_CONTEXT *cx;
2087 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2090 DIE(aTHX_ "Not a CODE reference");
2091 switch (SvTYPE(sv)) {
2097 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2099 SP = PL_stack_base + POPMARK;
2102 if (SvGMAGICAL(sv)) {
2104 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2107 sym = SvPV(sv, n_a);
2109 DIE(aTHX_ PL_no_usym, "a subroutine");
2110 if (PL_op->op_private & HINT_STRICT_REFS)
2111 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2112 cv = get_cv(sym, TRUE);
2116 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2117 tryAMAGICunDEREF(to_cv);
2120 if (SvTYPE(cv) == SVt_PVCV)
2125 DIE(aTHX_ "Not a CODE reference");
2130 if (!(cv = GvCVu((GV*)sv)))
2131 cv = sv_2cv(sv, &stash, &gv, FALSE);
2144 if (!CvROOT(cv) && !CvXSUB(cv)) {
2148 /* anonymous or undef'd function leaves us no recourse */
2149 if (CvANON(cv) || !(gv = CvGV(cv)))
2150 DIE(aTHX_ "Undefined subroutine called");
2152 /* autoloaded stub? */
2153 if (cv != GvCV(gv)) {
2156 /* should call AUTOLOAD now? */
2159 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2166 sub_name = sv_newmortal();
2167 gv_efullname3(sub_name, gv, Nullch);
2168 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2172 DIE(aTHX_ "Not a CODE reference");
2177 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2178 cv = get_db_sub(&sv, cv);
2180 DIE(aTHX_ "No DBsub routine");
2185 * First we need to check if the sub or method requires locking.
2186 * If so, we gain a lock on the CV, the first argument or the
2187 * stash (for static methods), as appropriate. This has to be
2188 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2189 * reschedule by returning a new op.
2191 MUTEX_LOCK(CvMUTEXP(cv));
2192 if (CvFLAGS(cv) & CVf_LOCKED) {
2194 if (CvFLAGS(cv) & CVf_METHOD) {
2195 if (SP > PL_stack_base + TOPMARK)
2196 sv = *(PL_stack_base + TOPMARK + 1);
2198 AV *av = (AV*)PL_curpad[0];
2199 if (hasargs || !av || AvFILLp(av) < 0
2200 || !(sv = AvARRAY(av)[0]))
2202 MUTEX_UNLOCK(CvMUTEXP(cv));
2203 Perl_croak(aTHX_ "no argument for locked method call");
2210 char *stashname = SvPV(sv, len);
2211 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2217 MUTEX_UNLOCK(CvMUTEXP(cv));
2218 mg = condpair_magic(sv);
2219 MUTEX_LOCK(MgMUTEXP(mg));
2220 if (MgOWNER(mg) == thr)
2221 MUTEX_UNLOCK(MgMUTEXP(mg));
2224 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2226 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2228 MUTEX_UNLOCK(MgMUTEXP(mg));
2229 save_destructor(Perl_unlock_condpair, sv);
2231 MUTEX_LOCK(CvMUTEXP(cv));
2234 * Now we have permission to enter the sub, we must distinguish
2235 * four cases. (0) It's an XSUB (in which case we don't care
2236 * about ownership); (1) it's ours already (and we're recursing);
2237 * (2) it's free (but we may already be using a cached clone);
2238 * (3) another thread owns it. Case (1) is easy: we just use it.
2239 * Case (2) means we look for a clone--if we have one, use it
2240 * otherwise grab ownership of cv. Case (3) means we look for a
2241 * clone (for non-XSUBs) and have to create one if we don't
2243 * Why look for a clone in case (2) when we could just grab
2244 * ownership of cv straight away? Well, we could be recursing,
2245 * i.e. we originally tried to enter cv while another thread
2246 * owned it (hence we used a clone) but it has been freed up
2247 * and we're now recursing into it. It may or may not be "better"
2248 * to use the clone but at least CvDEPTH can be trusted.
2250 if (CvOWNER(cv) == thr || CvXSUB(cv))
2251 MUTEX_UNLOCK(CvMUTEXP(cv));
2253 /* Case (2) or (3) */
2257 * XXX Might it be better to release CvMUTEXP(cv) while we
2258 * do the hv_fetch? We might find someone has pinched it
2259 * when we look again, in which case we would be in case
2260 * (3) instead of (2) so we'd have to clone. Would the fact
2261 * that we released the mutex more quickly make up for this?
2263 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2265 /* We already have a clone to use */
2266 MUTEX_UNLOCK(CvMUTEXP(cv));
2268 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2269 "entersub: %p already has clone %p:%s\n",
2270 thr, cv, SvPEEK((SV*)cv)));
2273 if (CvDEPTH(cv) == 0)
2274 SAVEDESTRUCTOR(S_unset_cvowner, (void*) cv);
2277 /* (2) => grab ownership of cv. (3) => make clone */
2281 MUTEX_UNLOCK(CvMUTEXP(cv));
2282 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2283 "entersub: %p grabbing %p:%s in stash %s\n",
2284 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2285 HvNAME(CvSTASH(cv)) : "(none)"));
2287 /* Make a new clone. */
2289 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2290 MUTEX_UNLOCK(CvMUTEXP(cv));
2291 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2292 "entersub: %p cloning %p:%s\n",
2293 thr, cv, SvPEEK((SV*)cv))));
2295 * We're creating a new clone so there's no race
2296 * between the original MUTEX_UNLOCK and the
2297 * SvREFCNT_inc since no one will be trying to undef
2298 * it out from underneath us. At least, I don't think
2301 clonecv = cv_clone(cv);
2302 SvREFCNT_dec(cv); /* finished with this */
2303 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2304 CvOWNER(clonecv) = thr;
2308 DEBUG_S(if (CvDEPTH(cv) != 0)
2309 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2311 SAVEDESTRUCTOR(S_unset_cvowner, (void*) cv);
2314 #endif /* USE_THREADS */
2317 #ifdef PERL_XSUB_OLDSTYLE
2318 if (CvOLDSTYLE(cv)) {
2319 I32 (*fp3)(int,int,int);
2321 register I32 items = SP - MARK;
2322 /* We dont worry to copy from @_. */
2327 PL_stack_sp = mark + 1;
2328 fp3 = (I32(*)(int,int,int)))CvXSUB(cv;
2329 items = (*fp3)(CvXSUBANY(cv).any_i32,
2330 MARK - PL_stack_base + 1,
2332 PL_stack_sp = PL_stack_base + items;
2335 #endif /* PERL_XSUB_OLDSTYLE */
2337 I32 markix = TOPMARK;
2342 /* Need to copy @_ to stack. Alternative may be to
2343 * switch stack to @_, and copy return values
2344 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2348 av = (AV*)PL_curpad[0];
2350 av = GvAV(PL_defgv);
2351 #endif /* USE_THREADS */
2352 items = AvFILLp(av) + 1; /* @_ is not tieable */
2355 /* Mark is at the end of the stack. */
2357 Copy(AvARRAY(av), SP + 1, items, SV*);
2362 /* We assume first XSUB in &DB::sub is the called one. */
2364 SAVESPTR(PL_curcop);
2365 PL_curcop = PL_curcopdb;
2368 /* Do we need to open block here? XXXX */
2369 (void)(*CvXSUB(cv))(aTHXo_ cv);
2371 /* Enforce some sanity in scalar context. */
2372 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2373 if (markix > PL_stack_sp - PL_stack_base)
2374 *(PL_stack_base + markix) = &PL_sv_undef;
2376 *(PL_stack_base + markix) = *PL_stack_sp;
2377 PL_stack_sp = PL_stack_base + markix;
2385 register I32 items = SP - MARK;
2386 AV* padlist = CvPADLIST(cv);
2387 SV** svp = AvARRAY(padlist);
2388 push_return(PL_op->op_next);
2389 PUSHBLOCK(cx, CXt_SUB, MARK);
2392 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2393 * that eval'' ops within this sub know the correct lexical space.
2394 * Owing the speed considerations, we choose to search for the cv
2395 * in doeval() instead.
2397 if (CvDEPTH(cv) < 2)
2398 (void)SvREFCNT_inc(cv);
2399 else { /* save temporaries on recursion? */
2400 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2402 AV *newpad = newAV();
2403 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2404 I32 ix = AvFILLp((AV*)svp[1]);
2405 svp = AvARRAY(svp[0]);
2406 for ( ;ix > 0; ix--) {
2407 if (svp[ix] != &PL_sv_undef) {
2408 char *name = SvPVX(svp[ix]);
2409 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2410 || *name == '&') /* anonymous code? */
2412 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2414 else { /* our own lexical */
2416 av_store(newpad, ix, sv = (SV*)newAV());
2417 else if (*name == '%')
2418 av_store(newpad, ix, sv = (SV*)newHV());
2420 av_store(newpad, ix, sv = NEWSV(0,0));
2425 av_store(newpad, ix, sv = NEWSV(0,0));
2429 av = newAV(); /* will be @_ */
2431 av_store(newpad, 0, (SV*)av);
2432 AvFLAGS(av) = AVf_REIFY;
2433 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2434 AvFILLp(padlist) = CvDEPTH(cv);
2435 svp = AvARRAY(padlist);
2440 AV* av = (AV*)PL_curpad[0];
2442 items = AvFILLp(av) + 1;
2444 /* Mark is at the end of the stack. */
2446 Copy(AvARRAY(av), SP + 1, items, SV*);
2451 #endif /* USE_THREADS */
2452 SAVESPTR(PL_curpad);
2453 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2456 #endif /* USE_THREADS */
2462 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2463 "%p entersub preparing @_\n", thr));
2465 av = (AV*)PL_curpad[0];
2471 cx->blk_sub.savearray = GvAV(PL_defgv);
2472 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2473 #endif /* USE_THREADS */
2474 cx->blk_sub.argarray = av;
2477 if (items > AvMAX(av) + 1) {
2479 if (AvARRAY(av) != ary) {
2480 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2481 SvPVX(av) = (char*)ary;
2483 if (items > AvMAX(av) + 1) {
2484 AvMAX(av) = items - 1;
2485 Renew(ary,items,SV*);
2487 SvPVX(av) = (char*)ary;
2490 Copy(MARK,AvARRAY(av),items,SV*);
2491 AvFILLp(av) = items - 1;
2499 /* warning must come *after* we fully set up the context
2500 * stuff so that __WARN__ handlers can safely dounwind()
2503 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2504 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2505 sub_crush_depth(cv);
2507 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2508 "%p entersub returning %p\n", thr, CvSTART(cv)));
2510 RETURNOP(CvSTART(cv));
2515 Perl_sub_crush_depth(pTHX_ CV *cv)
2518 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2520 SV* tmpstr = sv_newmortal();
2521 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2522 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2533 U32 lval = PL_op->op_flags & OPf_MOD;
2534 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2538 elem -= PL_curcop->cop_arybase;
2539 if (SvTYPE(av) != SVt_PVAV)
2541 svp = av_fetch(av, elem, lval && !defer);
2543 if (!svp || *svp == &PL_sv_undef) {
2546 DIE(aTHX_ PL_no_aelem, elem);
2547 lv = sv_newmortal();
2548 sv_upgrade(lv, SVt_PVLV);
2550 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2551 LvTARG(lv) = SvREFCNT_inc(av);
2552 LvTARGOFF(lv) = elem;
2557 if (PL_op->op_private & OPpLVAL_INTRO)
2558 save_aelem(av, elem, svp);
2559 else if (PL_op->op_private & OPpDEREF)
2560 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2562 sv = (svp ? *svp : &PL_sv_undef);
2563 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2564 sv = sv_mortalcopy(sv);
2570 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2576 Perl_croak(aTHX_ PL_no_modify);
2577 if (SvTYPE(sv) < SVt_RV)
2578 sv_upgrade(sv, SVt_RV);
2579 else if (SvTYPE(sv) >= SVt_PV) {
2580 (void)SvOOK_off(sv);
2581 Safefree(SvPVX(sv));
2582 SvLEN(sv) = SvCUR(sv) = 0;
2586 SvRV(sv) = NEWSV(355,0);
2589 SvRV(sv) = (SV*)newAV();
2592 SvRV(sv) = (SV*)newHV();
2613 if (SvTYPE(sv) == SVt_PVCV) {
2619 name = SvPV(TOPs, packlen);
2620 sv = *(PL_stack_base + TOPMARK + 1);
2631 !(packname = SvPV(sv, packlen)) ||
2632 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2633 !(ob=(SV*)GvIO(iogv)))
2636 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2637 ? !isIDFIRST_utf8((U8*)packname)
2638 : !isIDFIRST(*packname)
2641 DIE(aTHX_ "Can't call method \"%s\" %s", name,
2642 SvOK(sv)? "without a package or object reference"
2643 : "on an undefined value");
2645 stash = gv_stashpvn(packname, packlen, TRUE);
2648 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2651 if (!ob || !SvOBJECT(ob))
2652 DIE(aTHX_ "Can't call method \"%s\" on unblessed reference", name);
2654 stash = SvSTASH(ob);
2657 gv = gv_fetchmethod(stash, name);
2663 for (p = name; *p; p++) {
2665 sep = p, leaf = p + 1;
2666 else if (*p == ':' && *(p + 1) == ':')
2667 sep = p, leaf = p + 2;
2669 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2670 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2671 packlen = strlen(packname);
2675 packlen = sep - name;
2677 DIE(aTHX_ "Can't locate object method \"%s\" via package \"%.*s\"",
2678 leaf, (int)packlen, packname);
2680 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);