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;
849 I32 r_flags = REXEC_CHECKED;
850 char *truebase; /* Start of string */
851 register REGEXP *rx = pm->op_pmregexp;
856 I32 oldsave = PL_savestack_ix;
857 I32 update_minmatch = 1;
860 if (PL_op->op_flags & OPf_STACKED)
866 PUTBACK; /* EVAL blocks need stack_sp. */
870 DIE(aTHX_ "panic: do_match");
871 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
872 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
875 if (pm->op_pmdynflags & PMdf_USED) {
877 if (gimme == G_ARRAY)
882 if (!rx->prelen && PL_curpm) {
884 rx = pm->op_pmregexp;
886 if (rx->minlen > len) goto failure;
890 /* XXXX What part of this is needed with true \G-support? */
891 if (global = pm->op_pmflags & PMf_GLOBAL) {
893 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
894 MAGIC* mg = mg_find(TARG, 'g');
895 if (mg && mg->mg_len >= 0) {
896 if (!(rx->reganch & ROPT_GPOS_SEEN))
897 rx->endp[0] = rx->startp[0] = mg->mg_len;
898 else if (rx->reganch & ROPT_ANCH_GPOS) {
899 r_flags |= REXEC_IGNOREPOS;
900 rx->endp[0] = rx->startp[0] = mg->mg_len;
902 minmatch = (mg->mg_flags & MGf_MINMATCH);
907 if ((gimme != G_ARRAY && !global && rx->nparens)
908 || SvTEMP(TARG) || PL_sawampersand)
909 r_flags |= REXEC_COPY_STR;
911 r_flags |= REXEC_SCREAM;
913 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
914 SAVEINT(PL_multiline);
915 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
919 if (global && rx->startp[0] != -1) {
920 t = s = rx->endp[0] + truebase;
921 if ((s + rx->minlen) > strend)
923 if (update_minmatch++)
924 minmatch = had_zerolen;
926 if (rx->reganch & RE_USE_INTUIT) {
927 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
931 if ( (rx->reganch & ROPT_CHECK_ALL)
933 && ((rx->reganch & ROPT_NOSCAN)
934 || !((rx->reganch & RE_INTUIT_TAIL)
935 && (r_flags & REXEC_SCREAM))))
938 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
941 if (pm->op_pmflags & PMf_ONCE)
942 pm->op_pmdynflags |= PMdf_USED;
951 RX_MATCH_TAINTED_on(rx);
952 TAINT_IF(RX_MATCH_TAINTED(rx));
953 if (gimme == G_ARRAY) {
957 if (global && !iters)
961 SPAGAIN; /* EVAL blocks could move the stack. */
962 EXTEND(SP, iters + i);
963 EXTEND_MORTAL(iters + i);
964 for (i = !i; i <= iters; i++) {
965 PUSHs(sv_newmortal());
967 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
968 len = rx->endp[i] - rx->startp[i];
969 s = rx->startp[i] + truebase;
970 sv_setpvn(*SP, s, len);
974 had_zerolen = (rx->startp[0] != -1
975 && rx->startp[0] == rx->endp[0]);
976 PUTBACK; /* EVAL blocks may use stack */
977 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
982 LEAVE_SCOPE(oldsave);
988 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
989 mg = mg_find(TARG, 'g');
991 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
992 mg = mg_find(TARG, 'g');
994 if (rx->startp[0] != -1) {
995 mg->mg_len = rx->endp[0];
996 if (rx->startp[0] == rx->endp[0])
997 mg->mg_flags |= MGf_MINMATCH;
999 mg->mg_flags &= ~MGf_MINMATCH;
1002 LEAVE_SCOPE(oldsave);
1006 yup: /* Confirmed by INTUIT */
1008 RX_MATCH_TAINTED_on(rx);
1009 TAINT_IF(RX_MATCH_TAINTED(rx));
1011 if (pm->op_pmflags & PMf_ONCE)
1012 pm->op_pmdynflags |= PMdf_USED;
1013 if (RX_MATCH_COPIED(rx))
1014 Safefree(rx->subbeg);
1015 RX_MATCH_COPIED_off(rx);
1016 rx->subbeg = Nullch;
1018 rx->subbeg = truebase;
1019 rx->startp[0] = s - truebase;
1020 rx->endp[0] = s - truebase + rx->minlen;
1021 rx->sublen = strend - truebase;
1024 if (PL_sawampersand) {
1027 rx->subbeg = savepvn(t, strend - t);
1028 rx->sublen = strend - t;
1029 RX_MATCH_COPIED_on(rx);
1030 off = rx->startp[0] = s - t;
1031 rx->endp[0] = off + rx->minlen;
1033 else { /* startp/endp are used by @- @+. */
1034 rx->startp[0] = s - truebase;
1035 rx->endp[0] = s - truebase + rx->minlen;
1037 LEAVE_SCOPE(oldsave);
1042 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1043 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1044 MAGIC* mg = mg_find(TARG, 'g');
1049 LEAVE_SCOPE(oldsave);
1050 if (gimme == G_ARRAY)
1056 Perl_do_readline(pTHX)
1058 dSP; dTARGETSTACKED;
1063 register IO *io = GvIO(PL_last_in_gv);
1064 register I32 type = PL_op->op_type;
1065 I32 gimme = GIMME_V;
1068 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1070 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1073 call_method("READLINE", gimme);
1076 if (gimme == G_SCALAR)
1077 SvSetMagicSV_nosteal(TARG, TOPs);
1084 if (IoFLAGS(io) & IOf_ARGV) {
1085 if (IoFLAGS(io) & IOf_START) {
1086 IoFLAGS(io) &= ~IOf_START;
1088 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1089 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1090 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1091 SvSETMAGIC(GvSV(PL_last_in_gv));
1096 fp = nextargv(PL_last_in_gv);
1097 if (!fp) { /* Note: fp != IoIFP(io) */
1098 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1099 IoFLAGS(io) |= IOf_START;
1102 else if (type == OP_GLOB) {
1103 SV *tmpcmd = NEWSV(55, 0);
1107 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1108 /* since spawning off a process is a real performance hit */
1110 #include <descrip.h>
1111 #include <lib$routines.h>
1114 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1115 char vmsspec[NAM$C_MAXRSS+1];
1116 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1117 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1118 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1121 struct dsc$descriptor_s wilddsc
1122 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1123 struct dsc$descriptor_vs rsdsc
1124 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1125 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1127 /* We could find out if there's an explicit dev/dir or version
1128 by peeking into lib$find_file's internal context at
1129 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1130 but that's unsupported, so I don't want to do it now and
1131 have it bite someone in the future. */
1132 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1133 cp = SvPV(tmpglob,i);
1135 if (cp[i] == ';') hasver = 1;
1137 if (sts) hasver = 1;
1141 hasdir = isunix = 1;
1144 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1149 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1151 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1152 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1153 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1154 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1155 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1156 &dfltdsc,NULL,NULL,NULL))&1)) {
1157 end = rstr + (unsigned long int) *rslt;
1158 if (!hasver) while (*end != ';') end--;
1159 *(end++) = '\n'; *end = '\0';
1160 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1162 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1167 while (*(--begin) != ']' && *begin != '>') ;
1170 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1172 if (cxt) (void)lib$find_file_end(&cxt);
1173 if (ok && sts != RMS$_NMF &&
1174 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1177 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1179 PerlIO_close(tmpfp);
1183 PerlIO_rewind(tmpfp);
1185 IoIFP(io) = fp = tmpfp;
1186 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1193 sv_setpv(tmpcmd, "for a in ");
1194 sv_catsv(tmpcmd, tmpglob);
1195 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1198 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1199 sv_catsv(tmpcmd, tmpglob);
1201 sv_setpv(tmpcmd, "perlglob ");
1202 sv_catsv(tmpcmd, tmpglob);
1203 sv_catpv(tmpcmd, " |");
1208 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1209 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1210 sv_catsv(tmpcmd, tmpglob);
1211 sv_catpv(tmpcmd, "' 2>/dev/null |");
1213 sv_setpv(tmpcmd, "echo ");
1214 sv_catsv(tmpcmd, tmpglob);
1216 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1218 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1221 #endif /* !DOSISH */
1222 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1223 FALSE, O_RDONLY, 0, Nullfp);
1229 else if (type == OP_GLOB)
1233 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1234 if (type == OP_GLOB)
1235 Perl_warner(aTHX_ WARN_CLOSED, "glob failed (can't start child: %s)",
1238 Perl_warner(aTHX_ WARN_CLOSED, "Read on closed filehandle <%s>",
1239 GvENAME(PL_last_in_gv));
1241 if (gimme == G_SCALAR) {
1242 (void)SvOK_off(TARG);
1248 if (gimme == G_SCALAR) {
1252 (void)SvUPGRADE(sv, SVt_PV);
1253 tmplen = SvLEN(sv); /* remember if already alloced */
1255 Sv_Grow(sv, 80); /* try short-buffering it */
1256 if (type == OP_RCATLINE)
1262 sv = sv_2mortal(NEWSV(57, 80));
1266 /* flip-flop EOF state for a snarfed empty file */
1267 #define SNARF_EOF(gimme,rs,io,sv) \
1268 ((gimme != G_SCALAR || SvCUR(sv) \
1269 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1270 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1271 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1274 if (!sv_gets(sv, fp, offset)
1275 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1277 PerlIO_clearerr(fp);
1278 if (IoFLAGS(io) & IOf_ARGV) {
1279 fp = nextargv(PL_last_in_gv);
1282 (void)do_close(PL_last_in_gv, FALSE);
1283 IoFLAGS(io) |= IOf_START;
1285 else if (type == OP_GLOB) {
1286 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1287 Perl_warner(aTHX_ WARN_CLOSED,
1288 "glob failed (child exited with status %d%s)",
1289 STATUS_CURRENT >> 8,
1290 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1293 if (gimme == G_SCALAR) {
1294 (void)SvOK_off(TARG);
1299 /* This should not be marked tainted if the fp is marked clean */
1300 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1307 if (type == OP_GLOB) {
1310 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1311 tmps = SvEND(sv) - 1;
1312 if (*tmps == *SvPVX(PL_rs)) {
1317 for (tmps = SvPVX(sv); *tmps; tmps++)
1318 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1319 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1321 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1322 (void)POPs; /* Unmatched wildcard? Chuck it... */
1326 if (gimme == G_ARRAY) {
1327 if (SvLEN(sv) - SvCUR(sv) > 20) {
1328 SvLEN_set(sv, SvCUR(sv)+1);
1329 Renew(SvPVX(sv), SvLEN(sv), char);
1331 sv = sv_2mortal(NEWSV(58, 80));
1334 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1335 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1339 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1340 Renew(SvPVX(sv), SvLEN(sv), char);
1349 register PERL_CONTEXT *cx;
1350 I32 gimme = OP_GIMME(PL_op, -1);
1353 if (cxstack_ix >= 0)
1354 gimme = cxstack[cxstack_ix].blk_gimme;
1362 PUSHBLOCK(cx, CXt_BLOCK, SP);
1374 U32 lval = PL_op->op_flags & OPf_MOD;
1375 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1378 if (SvTYPE(hv) == SVt_PVHV) {
1379 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1380 svp = he ? &HeVAL(he) : 0;
1382 else if (SvTYPE(hv) == SVt_PVAV) {
1383 if (PL_op->op_private & OPpLVAL_INTRO)
1384 DIE(aTHX_ "Can't localize pseudo-hash element");
1385 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1391 if (!svp || *svp == &PL_sv_undef) {
1396 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1398 lv = sv_newmortal();
1399 sv_upgrade(lv, SVt_PVLV);
1401 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1402 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1403 LvTARG(lv) = SvREFCNT_inc(hv);
1408 if (PL_op->op_private & OPpLVAL_INTRO) {
1409 if (HvNAME(hv) && isGV(*svp))
1410 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1412 save_helem(hv, keysv, svp);
1414 else if (PL_op->op_private & OPpDEREF)
1415 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1417 sv = (svp ? *svp : &PL_sv_undef);
1418 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1419 * Pushing the magical RHS on to the stack is useless, since
1420 * that magic is soon destined to be misled by the local(),
1421 * and thus the later pp_sassign() will fail to mg_get() the
1422 * old value. This should also cure problems with delayed
1423 * mg_get()s. GSAR 98-07-03 */
1424 if (!lval && SvGMAGICAL(sv))
1425 sv = sv_mortalcopy(sv);
1433 register PERL_CONTEXT *cx;
1439 if (PL_op->op_flags & OPf_SPECIAL) {
1440 cx = &cxstack[cxstack_ix];
1441 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1446 gimme = OP_GIMME(PL_op, -1);
1448 if (cxstack_ix >= 0)
1449 gimme = cxstack[cxstack_ix].blk_gimme;
1455 if (gimme == G_VOID)
1457 else if (gimme == G_SCALAR) {
1460 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1463 *MARK = sv_mortalcopy(TOPs);
1466 *MARK = &PL_sv_undef;
1470 else if (gimme == G_ARRAY) {
1471 /* in case LEAVE wipes old return values */
1472 for (mark = newsp + 1; mark <= SP; mark++) {
1473 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1474 *mark = sv_mortalcopy(*mark);
1475 TAINT_NOT; /* Each item is independent */
1479 PL_curpm = newpm; /* Don't pop $1 et al till now */
1489 register PERL_CONTEXT *cx;
1494 cx = &cxstack[cxstack_ix];
1495 if (CxTYPE(cx) != CXt_LOOP)
1496 DIE(aTHX_ "panic: pp_iter");
1498 av = cx->blk_loop.iterary;
1499 if (SvTYPE(av) != SVt_PVAV) {
1500 /* iterate ($min .. $max) */
1501 if (cx->blk_loop.iterlval) {
1502 /* string increment */
1503 register SV* cur = cx->blk_loop.iterlval;
1505 char *max = SvPV((SV*)av, maxlen);
1506 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1507 #ifndef USE_THREADS /* don't risk potential race */
1508 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1509 && !SvMAGICAL(*cx->blk_loop.itervar))
1511 /* safe to reuse old SV */
1512 sv_setsv(*cx->blk_loop.itervar, cur);
1517 /* we need a fresh SV every time so that loop body sees a
1518 * completely new SV for closures/references to work as
1520 SvREFCNT_dec(*cx->blk_loop.itervar);
1521 *cx->blk_loop.itervar = newSVsv(cur);
1523 if (strEQ(SvPVX(cur), max))
1524 sv_setiv(cur, 0); /* terminate next time */
1531 /* integer increment */
1532 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1535 #ifndef USE_THREADS /* don't risk potential race */
1536 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1537 && !SvMAGICAL(*cx->blk_loop.itervar))
1539 /* safe to reuse old SV */
1540 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1545 /* we need a fresh SV every time so that loop body sees a
1546 * completely new SV for closures/references to work as they
1548 SvREFCNT_dec(*cx->blk_loop.itervar);
1549 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1555 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1558 SvREFCNT_dec(*cx->blk_loop.itervar);
1560 if (sv = (SvMAGICAL(av))
1561 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1562 : AvARRAY(av)[++cx->blk_loop.iterix])
1566 if (av != PL_curstack && SvIMMORTAL(sv)) {
1567 SV *lv = cx->blk_loop.iterlval;
1568 if (lv && SvREFCNT(lv) > 1) {
1573 SvREFCNT_dec(LvTARG(lv));
1575 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1576 sv_upgrade(lv, SVt_PVLV);
1578 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1580 LvTARG(lv) = SvREFCNT_inc(av);
1581 LvTARGOFF(lv) = cx->blk_loop.iterix;
1582 LvTARGLEN(lv) = (UV) -1;
1586 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1593 register PMOP *pm = cPMOP;
1609 register REGEXP *rx = pm->op_pmregexp;
1611 int force_on_match = 0;
1612 I32 oldsave = PL_savestack_ix;
1613 I32 update_minmatch = 1;
1615 /* known replacement string? */
1616 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1617 if (PL_op->op_flags & OPf_STACKED)
1623 if (SvREADONLY(TARG)
1624 || (SvTYPE(TARG) > SVt_PVLV
1625 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1626 Perl_croak(aTHX_ PL_no_modify);
1629 s = SvPV(TARG, len);
1630 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1632 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1633 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1640 DIE(aTHX_ "panic: do_subst");
1643 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1644 position, once with zero-length,
1645 second time with non-zero. */
1647 if (!rx->prelen && PL_curpm) {
1649 rx = pm->op_pmregexp;
1651 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1652 ? REXEC_COPY_STR : 0;
1654 r_flags |= REXEC_SCREAM;
1655 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1656 SAVEINT(PL_multiline);
1657 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1660 if (rx->reganch & RE_USE_INTUIT) {
1661 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1665 /* How to do it in subst? */
1666 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1668 && ((rx->reganch & ROPT_NOSCAN)
1669 || !((rx->reganch & RE_INTUIT_TAIL)
1670 && (r_flags & REXEC_SCREAM))))
1675 /* only replace once? */
1676 once = !(rpm->op_pmflags & PMf_GLOBAL);
1678 /* known replacement string? */
1679 c = dstr ? SvPV(dstr, clen) : Nullch;
1681 /* can do inplace substitution? */
1682 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1683 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1684 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1685 r_flags | REXEC_CHECKED))
1689 LEAVE_SCOPE(oldsave);
1692 if (force_on_match) {
1694 s = SvPV_force(TARG, len);
1699 SvSCREAM_off(TARG); /* disable possible screamer */
1701 rxtainted |= RX_MATCH_TAINTED(rx);
1702 m = orig + rx->startp[0];
1703 d = orig + rx->endp[0];
1705 if (m - s > strend - d) { /* faster to shorten from end */
1707 Copy(c, m, clen, char);
1712 Move(d, m, i, char);
1716 SvCUR_set(TARG, m - s);
1719 else if (i = m - s) { /* faster from front */
1727 Copy(c, m, clen, char);
1732 Copy(c, d, clen, char);
1737 TAINT_IF(rxtainted & 1);
1743 if (iters++ > maxiters)
1744 DIE(aTHX_ "Substitution loop");
1745 rxtainted |= RX_MATCH_TAINTED(rx);
1746 m = rx->startp[0] + orig;
1750 Move(s, d, i, char);
1754 Copy(c, d, clen, char);
1757 s = rx->endp[0] + orig;
1758 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1760 /* don't match same null twice */
1761 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1764 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1765 Move(s, d, i+1, char); /* include the NUL */
1767 TAINT_IF(rxtainted & 1);
1769 PUSHs(sv_2mortal(newSViv((I32)iters)));
1771 (void)SvPOK_only(TARG);
1772 TAINT_IF(rxtainted);
1773 if (SvSMAGICAL(TARG)) {
1779 LEAVE_SCOPE(oldsave);
1783 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1784 r_flags | REXEC_CHECKED))
1786 if (force_on_match) {
1788 s = SvPV_force(TARG, len);
1791 rxtainted |= RX_MATCH_TAINTED(rx);
1792 dstr = NEWSV(25, len);
1793 sv_setpvn(dstr, m, s-m);
1796 register PERL_CONTEXT *cx;
1799 RETURNOP(cPMOP->op_pmreplroot);
1801 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1803 if (iters++ > maxiters)
1804 DIE(aTHX_ "Substitution loop");
1805 rxtainted |= RX_MATCH_TAINTED(rx);
1806 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1811 strend = s + (strend - m);
1813 m = rx->startp[0] + orig;
1814 sv_catpvn(dstr, s, m-s);
1815 s = rx->endp[0] + orig;
1817 sv_catpvn(dstr, c, clen);
1820 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1821 sv_catpvn(dstr, s, strend - s);
1823 (void)SvOOK_off(TARG);
1824 Safefree(SvPVX(TARG));
1825 SvPVX(TARG) = SvPVX(dstr);
1826 SvCUR_set(TARG, SvCUR(dstr));
1827 SvLEN_set(TARG, SvLEN(dstr));
1831 TAINT_IF(rxtainted & 1);
1833 PUSHs(sv_2mortal(newSViv((I32)iters)));
1835 (void)SvPOK_only(TARG);
1836 TAINT_IF(rxtainted);
1839 LEAVE_SCOPE(oldsave);
1848 LEAVE_SCOPE(oldsave);
1857 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1858 ++*PL_markstack_ptr;
1859 LEAVE; /* exit inner scope */
1862 if (PL_stack_base + *PL_markstack_ptr > SP) {
1864 I32 gimme = GIMME_V;
1866 LEAVE; /* exit outer scope */
1867 (void)POPMARK; /* pop src */
1868 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1869 (void)POPMARK; /* pop dst */
1870 SP = PL_stack_base + POPMARK; /* pop original mark */
1871 if (gimme == G_SCALAR) {
1875 else if (gimme == G_ARRAY)
1882 ENTER; /* enter inner scope */
1885 src = PL_stack_base[*PL_markstack_ptr];
1889 RETURNOP(cLOGOP->op_other);
1900 register PERL_CONTEXT *cx;
1901 struct block_sub cxsub;
1904 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1907 if (gimme == G_SCALAR) {
1910 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1912 *MARK = SvREFCNT_inc(TOPs);
1917 *MARK = sv_mortalcopy(TOPs);
1920 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1923 *MARK = &PL_sv_undef;
1927 else if (gimme == G_ARRAY) {
1928 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1929 if (!SvTEMP(*MARK)) {
1930 *MARK = sv_mortalcopy(*MARK);
1931 TAINT_NOT; /* Each item is independent */
1937 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1938 PL_curpm = newpm; /* ... and pop $1 et al */
1941 return pop_return();
1945 S_get_db_sub(pTHX_ SV **svp, CV *cv)
1948 SV *dbsv = GvSV(PL_DBsub);
1950 if (!PERLDB_SUB_NN) {
1954 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1955 || strEQ(GvNAME(gv), "END")
1956 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1957 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1958 && (gv = (GV*)*svp) ))) {
1959 /* Use GV from the stack as a fallback. */
1960 /* GV is potentially non-unique, or contain different CV. */
1961 sv_setsv(dbsv, newRV((SV*)cv));
1964 gv_efullname3(dbsv, gv, Nullch);
1968 SvUPGRADE(dbsv, SVt_PVIV);
1970 SAVEIV(SvIVX(dbsv));
1971 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1975 PL_curcopdb = PL_curcop;
1976 cv = GvCV(PL_DBsub);
1986 register PERL_CONTEXT *cx;
1988 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
1991 DIE(aTHX_ "Not a CODE reference");
1992 switch (SvTYPE(sv)) {
1998 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2000 SP = PL_stack_base + POPMARK;
2003 if (SvGMAGICAL(sv)) {
2005 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2008 sym = SvPV(sv, n_a);
2010 DIE(aTHX_ PL_no_usym, "a subroutine");
2011 if (PL_op->op_private & HINT_STRICT_REFS)
2012 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2013 cv = get_cv(sym, TRUE);
2017 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2018 tryAMAGICunDEREF(to_cv);
2021 if (SvTYPE(cv) == SVt_PVCV)
2026 DIE(aTHX_ "Not a CODE reference");
2031 if (!(cv = GvCVu((GV*)sv)))
2032 cv = sv_2cv(sv, &stash, &gv, FALSE);
2045 if (!CvROOT(cv) && !CvXSUB(cv)) {
2049 /* anonymous or undef'd function leaves us no recourse */
2050 if (CvANON(cv) || !(gv = CvGV(cv)))
2051 DIE(aTHX_ "Undefined subroutine called");
2053 /* autoloaded stub? */
2054 if (cv != GvCV(gv)) {
2057 /* should call AUTOLOAD now? */
2060 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2067 sub_name = sv_newmortal();
2068 gv_efullname3(sub_name, gv, Nullch);
2069 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2073 DIE(aTHX_ "Not a CODE reference");
2078 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2079 cv = get_db_sub(&sv, cv);
2081 DIE(aTHX_ "No DBsub routine");
2086 * First we need to check if the sub or method requires locking.
2087 * If so, we gain a lock on the CV, the first argument or the
2088 * stash (for static methods), as appropriate. This has to be
2089 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2090 * reschedule by returning a new op.
2092 MUTEX_LOCK(CvMUTEXP(cv));
2093 if (CvFLAGS(cv) & CVf_LOCKED) {
2095 if (CvFLAGS(cv) & CVf_METHOD) {
2096 if (SP > PL_stack_base + TOPMARK)
2097 sv = *(PL_stack_base + TOPMARK + 1);
2099 AV *av = (AV*)PL_curpad[0];
2100 if (hasargs || !av || AvFILLp(av) < 0
2101 || !(sv = AvARRAY(av)[0]))
2103 MUTEX_UNLOCK(CvMUTEXP(cv));
2104 Perl_croak(aTHX_ "no argument for locked method call");
2111 char *stashname = SvPV(sv, len);
2112 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2118 MUTEX_UNLOCK(CvMUTEXP(cv));
2119 mg = condpair_magic(sv);
2120 MUTEX_LOCK(MgMUTEXP(mg));
2121 if (MgOWNER(mg) == thr)
2122 MUTEX_UNLOCK(MgMUTEXP(mg));
2125 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2127 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2129 MUTEX_UNLOCK(MgMUTEXP(mg));
2130 save_destructor(Perl_unlock_condpair, sv);
2132 MUTEX_LOCK(CvMUTEXP(cv));
2135 * Now we have permission to enter the sub, we must distinguish
2136 * four cases. (0) It's an XSUB (in which case we don't care
2137 * about ownership); (1) it's ours already (and we're recursing);
2138 * (2) it's free (but we may already be using a cached clone);
2139 * (3) another thread owns it. Case (1) is easy: we just use it.
2140 * Case (2) means we look for a clone--if we have one, use it
2141 * otherwise grab ownership of cv. Case (3) means we look for a
2142 * clone (for non-XSUBs) and have to create one if we don't
2144 * Why look for a clone in case (2) when we could just grab
2145 * ownership of cv straight away? Well, we could be recursing,
2146 * i.e. we originally tried to enter cv while another thread
2147 * owned it (hence we used a clone) but it has been freed up
2148 * and we're now recursing into it. It may or may not be "better"
2149 * to use the clone but at least CvDEPTH can be trusted.
2151 if (CvOWNER(cv) == thr || CvXSUB(cv))
2152 MUTEX_UNLOCK(CvMUTEXP(cv));
2154 /* Case (2) or (3) */
2158 * XXX Might it be better to release CvMUTEXP(cv) while we
2159 * do the hv_fetch? We might find someone has pinched it
2160 * when we look again, in which case we would be in case
2161 * (3) instead of (2) so we'd have to clone. Would the fact
2162 * that we released the mutex more quickly make up for this?
2164 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2166 /* We already have a clone to use */
2167 MUTEX_UNLOCK(CvMUTEXP(cv));
2169 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2170 "entersub: %p already has clone %p:%s\n",
2171 thr, cv, SvPEEK((SV*)cv)));
2174 if (CvDEPTH(cv) == 0)
2175 SAVEDESTRUCTOR(S_unset_cvowner, (void*) cv);
2178 /* (2) => grab ownership of cv. (3) => make clone */
2182 MUTEX_UNLOCK(CvMUTEXP(cv));
2183 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2184 "entersub: %p grabbing %p:%s in stash %s\n",
2185 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2186 HvNAME(CvSTASH(cv)) : "(none)"));
2188 /* Make a new clone. */
2190 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2191 MUTEX_UNLOCK(CvMUTEXP(cv));
2192 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2193 "entersub: %p cloning %p:%s\n",
2194 thr, cv, SvPEEK((SV*)cv))));
2196 * We're creating a new clone so there's no race
2197 * between the original MUTEX_UNLOCK and the
2198 * SvREFCNT_inc since no one will be trying to undef
2199 * it out from underneath us. At least, I don't think
2202 clonecv = cv_clone(cv);
2203 SvREFCNT_dec(cv); /* finished with this */
2204 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2205 CvOWNER(clonecv) = thr;
2209 DEBUG_S(if (CvDEPTH(cv) != 0)
2210 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2212 SAVEDESTRUCTOR(S_unset_cvowner, (void*) cv);
2215 #endif /* USE_THREADS */
2218 #ifdef PERL_XSUB_OLDSTYLE
2219 if (CvOLDSTYLE(cv)) {
2220 I32 (*fp3)(int,int,int);
2222 register I32 items = SP - MARK;
2223 /* We dont worry to copy from @_. */
2228 PL_stack_sp = mark + 1;
2229 fp3 = (I32(*)(int,int,int)))CvXSUB(cv;
2230 items = (*fp3)(CvXSUBANY(cv).any_i32,
2231 MARK - PL_stack_base + 1,
2233 PL_stack_sp = PL_stack_base + items;
2236 #endif /* PERL_XSUB_OLDSTYLE */
2238 I32 markix = TOPMARK;
2243 /* Need to copy @_ to stack. Alternative may be to
2244 * switch stack to @_, and copy return values
2245 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2249 av = (AV*)PL_curpad[0];
2251 av = GvAV(PL_defgv);
2252 #endif /* USE_THREADS */
2253 items = AvFILLp(av) + 1; /* @_ is not tieable */
2256 /* Mark is at the end of the stack. */
2258 Copy(AvARRAY(av), SP + 1, items, SV*);
2263 /* We assume first XSUB in &DB::sub is the called one. */
2265 SAVESPTR(PL_curcop);
2266 PL_curcop = PL_curcopdb;
2269 /* Do we need to open block here? XXXX */
2270 (void)(*CvXSUB(cv))(aTHXo_ cv);
2272 /* Enforce some sanity in scalar context. */
2273 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2274 if (markix > PL_stack_sp - PL_stack_base)
2275 *(PL_stack_base + markix) = &PL_sv_undef;
2277 *(PL_stack_base + markix) = *PL_stack_sp;
2278 PL_stack_sp = PL_stack_base + markix;
2286 register I32 items = SP - MARK;
2287 AV* padlist = CvPADLIST(cv);
2288 SV** svp = AvARRAY(padlist);
2289 push_return(PL_op->op_next);
2290 PUSHBLOCK(cx, CXt_SUB, MARK);
2293 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2294 * that eval'' ops within this sub know the correct lexical space.
2295 * Owing the speed considerations, we choose to search for the cv
2296 * in doeval() instead.
2298 if (CvDEPTH(cv) < 2)
2299 (void)SvREFCNT_inc(cv);
2300 else { /* save temporaries on recursion? */
2301 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2303 AV *newpad = newAV();
2304 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2305 I32 ix = AvFILLp((AV*)svp[1]);
2306 svp = AvARRAY(svp[0]);
2307 for ( ;ix > 0; ix--) {
2308 if (svp[ix] != &PL_sv_undef) {
2309 char *name = SvPVX(svp[ix]);
2310 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2311 || *name == '&') /* anonymous code? */
2313 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2315 else { /* our own lexical */
2317 av_store(newpad, ix, sv = (SV*)newAV());
2318 else if (*name == '%')
2319 av_store(newpad, ix, sv = (SV*)newHV());
2321 av_store(newpad, ix, sv = NEWSV(0,0));
2326 av_store(newpad, ix, sv = NEWSV(0,0));
2330 av = newAV(); /* will be @_ */
2332 av_store(newpad, 0, (SV*)av);
2333 AvFLAGS(av) = AVf_REIFY;
2334 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2335 AvFILLp(padlist) = CvDEPTH(cv);
2336 svp = AvARRAY(padlist);
2341 AV* av = (AV*)PL_curpad[0];
2343 items = AvFILLp(av) + 1;
2345 /* Mark is at the end of the stack. */
2347 Copy(AvARRAY(av), SP + 1, items, SV*);
2352 #endif /* USE_THREADS */
2353 SAVESPTR(PL_curpad);
2354 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2357 #endif /* USE_THREADS */
2363 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2364 "%p entersub preparing @_\n", thr));
2366 av = (AV*)PL_curpad[0];
2372 cx->blk_sub.savearray = GvAV(PL_defgv);
2373 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2374 #endif /* USE_THREADS */
2375 cx->blk_sub.argarray = av;
2378 if (items > AvMAX(av) + 1) {
2380 if (AvARRAY(av) != ary) {
2381 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2382 SvPVX(av) = (char*)ary;
2384 if (items > AvMAX(av) + 1) {
2385 AvMAX(av) = items - 1;
2386 Renew(ary,items,SV*);
2388 SvPVX(av) = (char*)ary;
2391 Copy(MARK,AvARRAY(av),items,SV*);
2392 AvFILLp(av) = items - 1;
2400 /* warning must come *after* we fully set up the context
2401 * stuff so that __WARN__ handlers can safely dounwind()
2404 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2405 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2406 sub_crush_depth(cv);
2408 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2409 "%p entersub returning %p\n", thr, CvSTART(cv)));
2411 RETURNOP(CvSTART(cv));
2416 Perl_sub_crush_depth(pTHX_ CV *cv)
2419 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2421 SV* tmpstr = sv_newmortal();
2422 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2423 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2434 U32 lval = PL_op->op_flags & OPf_MOD;
2435 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2439 elem -= PL_curcop->cop_arybase;
2440 if (SvTYPE(av) != SVt_PVAV)
2442 svp = av_fetch(av, elem, lval && !defer);
2444 if (!svp || *svp == &PL_sv_undef) {
2447 DIE(aTHX_ PL_no_aelem, elem);
2448 lv = sv_newmortal();
2449 sv_upgrade(lv, SVt_PVLV);
2451 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2452 LvTARG(lv) = SvREFCNT_inc(av);
2453 LvTARGOFF(lv) = elem;
2458 if (PL_op->op_private & OPpLVAL_INTRO)
2459 save_aelem(av, elem, svp);
2460 else if (PL_op->op_private & OPpDEREF)
2461 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2463 sv = (svp ? *svp : &PL_sv_undef);
2464 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2465 sv = sv_mortalcopy(sv);
2471 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2477 Perl_croak(aTHX_ PL_no_modify);
2478 if (SvTYPE(sv) < SVt_RV)
2479 sv_upgrade(sv, SVt_RV);
2480 else if (SvTYPE(sv) >= SVt_PV) {
2481 (void)SvOOK_off(sv);
2482 Safefree(SvPVX(sv));
2483 SvLEN(sv) = SvCUR(sv) = 0;
2487 SvRV(sv) = NEWSV(355,0);
2490 SvRV(sv) = (SV*)newAV();
2493 SvRV(sv) = (SV*)newHV();
2514 if (SvTYPE(sv) == SVt_PVCV) {
2520 name = SvPV(TOPs, packlen);
2521 sv = *(PL_stack_base + TOPMARK + 1);
2532 !(packname = SvPV(sv, packlen)) ||
2533 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2534 !(ob=(SV*)GvIO(iogv)))
2537 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2538 ? !isIDFIRST_utf8((U8*)packname)
2539 : !isIDFIRST(*packname)
2542 DIE(aTHX_ "Can't call method \"%s\" %s", name,
2543 SvOK(sv)? "without a package or object reference"
2544 : "on an undefined value");
2546 stash = gv_stashpvn(packname, packlen, TRUE);
2549 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2552 if (!ob || !SvOBJECT(ob))
2553 DIE(aTHX_ "Can't call method \"%s\" on unblessed reference", name);
2555 stash = SvSTASH(ob);
2558 gv = gv_fetchmethod(stash, name);
2564 for (p = name; *p; p++) {
2566 sep = p, leaf = p + 1;
2567 else if (*p == ':' && *(p + 1) == ':')
2568 sep = p, leaf = p + 2;
2570 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2571 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2572 packlen = strlen(packname);
2576 packlen = sep - name;
2578 DIE(aTHX_ "Can't locate object method \"%s\" via package \"%.*s\"",
2579 leaf, (int)packlen, packname);
2581 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);