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(cLOGOP->op_other);
147 RETURNOP(cLOGOP->op_next);
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_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);
604 Perl_sv_setpvf(aTHX_ TARG, "%ld/%ld",
605 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
617 SV **lastlelem = PL_stack_sp;
618 SV **lastrelem = PL_stack_base + POPMARK;
619 SV **firstrelem = PL_stack_base + POPMARK + 1;
620 SV **firstlelem = lastrelem + 1;
633 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
635 /* If there's a common identifier on both sides we have to take
636 * special care that assigning the identifier on the left doesn't
637 * clobber a value on the right that's used later in the list.
639 if (PL_op->op_private & OPpASSIGN_COMMON) {
640 EXTEND_MORTAL(lastrelem - firstrelem + 1);
641 for (relem = firstrelem; relem <= lastrelem; relem++) {
644 TAINT_NOT; /* Each item is independent */
645 *relem = sv_mortalcopy(sv);
654 while (lelem <= lastlelem) {
655 TAINT_NOT; /* Each item stands on its own, taintwise. */
657 switch (SvTYPE(sv)) {
660 magic = SvMAGICAL(ary) != 0;
663 av_extend(ary, lastrelem - relem);
665 while (relem <= lastrelem) { /* gobble up all the rest */
671 didstore = av_store(ary,i++,sv);
685 magic = SvMAGICAL(hash) != 0;
688 while (relem < lastrelem) { /* gobble up all the rest */
693 sv = &PL_sv_no, relem++;
694 tmpstr = NEWSV(29,0);
696 sv_setsv(tmpstr,*relem); /* value */
698 didstore = hv_store_ent(hash,sv,tmpstr,0);
700 if (SvSMAGICAL(tmpstr))
707 if (relem == lastrelem) {
710 if (ckWARN(WARN_UNSAFE)) {
711 if (relem == firstrelem &&
713 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
714 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
715 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
717 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
719 tmpstr = NEWSV(29,0);
720 didstore = hv_store_ent(hash,*relem,tmpstr,0);
722 if (SvSMAGICAL(tmpstr))
734 if (SvIMMORTAL(sv)) {
735 if (relem <= lastrelem)
739 if (relem <= lastrelem) {
740 sv_setsv(sv, *relem);
744 sv_setsv(sv, &PL_sv_undef);
749 if (PL_delaymagic & ~DM_DELAY) {
750 if (PL_delaymagic & DM_UID) {
752 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
755 (void)setreuid(PL_uid,PL_euid);
758 if ((PL_delaymagic & DM_UID) == DM_RUID) {
759 (void)setruid(PL_uid);
760 PL_delaymagic &= ~DM_RUID;
762 # endif /* HAS_SETRUID */
764 if ((PL_delaymagic & DM_UID) == DM_EUID) {
765 (void)seteuid(PL_uid);
766 PL_delaymagic &= ~DM_EUID;
768 # endif /* HAS_SETEUID */
769 if (PL_delaymagic & DM_UID) {
770 if (PL_uid != PL_euid)
771 DIE(aTHX_ "No setreuid available");
772 (void)PerlProc_setuid(PL_uid);
774 # endif /* HAS_SETREUID */
775 #endif /* HAS_SETRESUID */
776 PL_uid = (int)PerlProc_getuid();
777 PL_euid = (int)PerlProc_geteuid();
779 if (PL_delaymagic & DM_GID) {
781 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
784 (void)setregid(PL_gid,PL_egid);
787 if ((PL_delaymagic & DM_GID) == DM_RGID) {
788 (void)setrgid(PL_gid);
789 PL_delaymagic &= ~DM_RGID;
791 # endif /* HAS_SETRGID */
793 if ((PL_delaymagic & DM_GID) == DM_EGID) {
794 (void)setegid(PL_gid);
795 PL_delaymagic &= ~DM_EGID;
797 # endif /* HAS_SETEGID */
798 if (PL_delaymagic & DM_GID) {
799 if (PL_gid != PL_egid)
800 DIE(aTHX_ "No setregid available");
801 (void)PerlProc_setgid(PL_gid);
803 # endif /* HAS_SETREGID */
804 #endif /* HAS_SETRESGID */
805 PL_gid = (int)PerlProc_getgid();
806 PL_egid = (int)PerlProc_getegid();
808 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
815 else if (gimme == G_SCALAR) {
818 SETi(lastrelem - firstrelem + 1);
824 SP = firstrelem + (lastlelem - firstlelem);
825 lelem = firstlelem + (relem - firstrelem);
827 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
835 register PMOP *pm = cPMOP;
836 SV *rv = sv_newmortal();
837 SV *sv = newSVrv(rv, "Regexp");
838 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
845 register PMOP *pm = cPMOP;
850 I32 r_flags = REXEC_CHECKED;
851 char *truebase; /* Start of string */
852 register REGEXP *rx = pm->op_pmregexp;
857 I32 oldsave = PL_savestack_ix;
858 I32 update_minmatch = 1;
861 if (PL_op->op_flags & OPf_STACKED)
867 PUTBACK; /* EVAL blocks need stack_sp. */
871 DIE(aTHX_ "panic: do_match");
872 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
873 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
876 if (pm->op_pmdynflags & PMdf_USED) {
878 if (gimme == G_ARRAY)
883 if (!rx->prelen && PL_curpm) {
885 rx = pm->op_pmregexp;
887 if (rx->minlen > len) goto failure;
891 /* XXXX What part of this is needed with true \G-support? */
892 if (global = pm->op_pmflags & PMf_GLOBAL) {
894 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
895 MAGIC* mg = mg_find(TARG, 'g');
896 if (mg && mg->mg_len >= 0) {
897 if (!(rx->reganch & ROPT_GPOS_SEEN))
898 rx->endp[0] = rx->startp[0] = mg->mg_len;
899 else if (rx->reganch & ROPT_ANCH_GPOS) {
900 r_flags |= REXEC_IGNOREPOS;
901 rx->endp[0] = rx->startp[0] = mg->mg_len;
903 minmatch = (mg->mg_flags & MGf_MINMATCH);
908 if ((gimme != G_ARRAY && !global && rx->nparens)
909 || SvTEMP(TARG) || PL_sawampersand)
910 r_flags |= REXEC_COPY_STR;
912 r_flags |= REXEC_SCREAM;
914 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
915 SAVEINT(PL_multiline);
916 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
920 if (global && rx->startp[0] != -1) {
921 t = s = rx->endp[0] + truebase;
922 if ((s + rx->minlen) > strend)
924 if (update_minmatch++)
925 minmatch = had_zerolen;
927 if (rx->reganch & RE_USE_INTUIT) {
928 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
932 if ( (rx->reganch & ROPT_CHECK_ALL)
934 && ((rx->reganch & ROPT_NOSCAN)
935 || !((rx->reganch & RE_INTUIT_TAIL)
936 && (r_flags & REXEC_SCREAM))))
939 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
942 if (pm->op_pmflags & PMf_ONCE)
943 pm->op_pmdynflags |= PMdf_USED;
952 RX_MATCH_TAINTED_on(rx);
953 TAINT_IF(RX_MATCH_TAINTED(rx));
954 if (gimme == G_ARRAY) {
958 if (global && !iters)
962 SPAGAIN; /* EVAL blocks could move the stack. */
963 EXTEND(SP, iters + i);
964 EXTEND_MORTAL(iters + i);
965 for (i = !i; i <= iters; i++) {
966 PUSHs(sv_newmortal());
968 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
969 len = rx->endp[i] - rx->startp[i];
970 s = rx->startp[i] + truebase;
971 sv_setpvn(*SP, s, len);
975 had_zerolen = (rx->startp[0] != -1
976 && rx->startp[0] == rx->endp[0]);
977 PUTBACK; /* EVAL blocks may use stack */
978 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
983 LEAVE_SCOPE(oldsave);
989 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
990 mg = mg_find(TARG, 'g');
992 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
993 mg = mg_find(TARG, 'g');
995 if (rx->startp[0] != -1) {
996 mg->mg_len = rx->endp[0];
997 if (rx->startp[0] == rx->endp[0])
998 mg->mg_flags |= MGf_MINMATCH;
1000 mg->mg_flags &= ~MGf_MINMATCH;
1003 LEAVE_SCOPE(oldsave);
1007 yup: /* Confirmed by INTUIT */
1009 RX_MATCH_TAINTED_on(rx);
1010 TAINT_IF(RX_MATCH_TAINTED(rx));
1012 if (pm->op_pmflags & PMf_ONCE)
1013 pm->op_pmdynflags |= PMdf_USED;
1014 if (RX_MATCH_COPIED(rx))
1015 Safefree(rx->subbeg);
1016 RX_MATCH_COPIED_off(rx);
1017 rx->subbeg = Nullch;
1019 rx->subbeg = truebase;
1020 rx->startp[0] = s - truebase;
1021 rx->endp[0] = s - truebase + rx->minlen;
1022 rx->sublen = strend - truebase;
1025 if (PL_sawampersand) {
1028 rx->subbeg = savepvn(t, strend - t);
1029 rx->sublen = strend - t;
1030 RX_MATCH_COPIED_on(rx);
1031 off = rx->startp[0] = s - t;
1032 rx->endp[0] = off + rx->minlen;
1034 else { /* startp/endp are used by @- @+. */
1035 rx->startp[0] = s - truebase;
1036 rx->endp[0] = s - truebase + rx->minlen;
1038 LEAVE_SCOPE(oldsave);
1043 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1044 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1045 MAGIC* mg = mg_find(TARG, 'g');
1050 LEAVE_SCOPE(oldsave);
1051 if (gimme == G_ARRAY)
1057 Perl_do_readline(pTHX)
1059 dSP; dTARGETSTACKED;
1064 register IO *io = GvIO(PL_last_in_gv);
1065 register I32 type = PL_op->op_type;
1066 I32 gimme = GIMME_V;
1069 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1071 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1074 call_method("READLINE", gimme);
1077 if (gimme == G_SCALAR)
1078 SvSetMagicSV_nosteal(TARG, TOPs);
1085 if (IoFLAGS(io) & IOf_ARGV) {
1086 if (IoFLAGS(io) & IOf_START) {
1087 IoFLAGS(io) &= ~IOf_START;
1089 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1090 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1091 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1092 SvSETMAGIC(GvSV(PL_last_in_gv));
1097 fp = nextargv(PL_last_in_gv);
1098 if (!fp) { /* Note: fp != IoIFP(io) */
1099 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1100 IoFLAGS(io) |= IOf_START;
1103 else if (type == OP_GLOB) {
1104 SV *tmpcmd = NEWSV(55, 0);
1108 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1109 /* since spawning off a process is a real performance hit */
1111 #include <descrip.h>
1112 #include <lib$routines.h>
1115 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1116 char vmsspec[NAM$C_MAXRSS+1];
1117 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1118 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1119 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1122 struct dsc$descriptor_s wilddsc
1123 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1124 struct dsc$descriptor_vs rsdsc
1125 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1126 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1128 /* We could find out if there's an explicit dev/dir or version
1129 by peeking into lib$find_file's internal context at
1130 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1131 but that's unsupported, so I don't want to do it now and
1132 have it bite someone in the future. */
1133 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1134 cp = SvPV(tmpglob,i);
1136 if (cp[i] == ';') hasver = 1;
1138 if (sts) hasver = 1;
1142 hasdir = isunix = 1;
1145 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1150 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1152 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1153 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1154 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1155 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1156 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1157 &dfltdsc,NULL,NULL,NULL))&1)) {
1158 end = rstr + (unsigned long int) *rslt;
1159 if (!hasver) while (*end != ';') end--;
1160 *(end++) = '\n'; *end = '\0';
1161 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1163 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1168 while (*(--begin) != ']' && *begin != '>') ;
1171 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1173 if (cxt) (void)lib$find_file_end(&cxt);
1174 if (ok && sts != RMS$_NMF &&
1175 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1178 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1180 PerlIO_close(tmpfp);
1184 PerlIO_rewind(tmpfp);
1186 IoIFP(io) = fp = tmpfp;
1187 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1194 sv_setpv(tmpcmd, "for a in ");
1195 sv_catsv(tmpcmd, tmpglob);
1196 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1199 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1200 sv_catsv(tmpcmd, tmpglob);
1202 sv_setpv(tmpcmd, "perlglob ");
1203 sv_catsv(tmpcmd, tmpglob);
1204 sv_catpv(tmpcmd, " |");
1209 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1210 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1211 sv_catsv(tmpcmd, tmpglob);
1212 sv_catpv(tmpcmd, "' 2>/dev/null |");
1214 sv_setpv(tmpcmd, "echo ");
1215 sv_catsv(tmpcmd, tmpglob);
1217 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1219 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1222 #endif /* !DOSISH */
1223 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1224 FALSE, O_RDONLY, 0, Nullfp);
1230 else if (type == OP_GLOB)
1232 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1233 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1234 || fp == PerlIO_stderr()))
1236 SV* sv = sv_newmortal();
1237 gv_efullname3(sv, PL_last_in_gv, Nullch);
1238 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1243 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1244 if (type == OP_GLOB)
1245 Perl_warner(aTHX_ WARN_CLOSED,
1246 "glob failed (can't start child: %s)",
1249 SV* sv = sv_newmortal();
1250 gv_efullname3(sv, PL_last_in_gv, Nullch);
1251 Perl_warner(aTHX_ WARN_CLOSED,
1252 "Read on closed filehandle %s",
1256 if (gimme == G_SCALAR) {
1257 (void)SvOK_off(TARG);
1263 if (gimme == G_SCALAR) {
1267 (void)SvUPGRADE(sv, SVt_PV);
1268 tmplen = SvLEN(sv); /* remember if already alloced */
1270 Sv_Grow(sv, 80); /* try short-buffering it */
1271 if (type == OP_RCATLINE)
1277 sv = sv_2mortal(NEWSV(57, 80));
1281 /* flip-flop EOF state for a snarfed empty file */
1282 #define SNARF_EOF(gimme,rs,io,sv) \
1283 ((gimme != G_SCALAR || SvCUR(sv) \
1284 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1285 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1286 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1289 if (!sv_gets(sv, fp, offset)
1290 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1292 PerlIO_clearerr(fp);
1293 if (IoFLAGS(io) & IOf_ARGV) {
1294 fp = nextargv(PL_last_in_gv);
1297 (void)do_close(PL_last_in_gv, FALSE);
1298 IoFLAGS(io) |= IOf_START;
1300 else if (type == OP_GLOB) {
1301 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1302 Perl_warner(aTHX_ WARN_CLOSED,
1303 "glob failed (child exited with status %d%s)",
1304 STATUS_CURRENT >> 8,
1305 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1308 if (gimme == G_SCALAR) {
1309 (void)SvOK_off(TARG);
1314 /* This should not be marked tainted if the fp is marked clean */
1315 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1322 if (type == OP_GLOB) {
1325 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1326 tmps = SvEND(sv) - 1;
1327 if (*tmps == *SvPVX(PL_rs)) {
1332 for (tmps = SvPVX(sv); *tmps; tmps++)
1333 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1334 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1336 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1337 (void)POPs; /* Unmatched wildcard? Chuck it... */
1341 if (gimme == G_ARRAY) {
1342 if (SvLEN(sv) - SvCUR(sv) > 20) {
1343 SvLEN_set(sv, SvCUR(sv)+1);
1344 Renew(SvPVX(sv), SvLEN(sv), char);
1346 sv = sv_2mortal(NEWSV(58, 80));
1349 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1350 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1354 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1355 Renew(SvPVX(sv), SvLEN(sv), char);
1364 register PERL_CONTEXT *cx;
1365 I32 gimme = OP_GIMME(PL_op, -1);
1368 if (cxstack_ix >= 0)
1369 gimme = cxstack[cxstack_ix].blk_gimme;
1377 PUSHBLOCK(cx, CXt_BLOCK, SP);
1389 U32 lval = PL_op->op_flags & OPf_MOD;
1390 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1393 if (SvTYPE(hv) == SVt_PVHV) {
1394 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1395 svp = he ? &HeVAL(he) : 0;
1397 else if (SvTYPE(hv) == SVt_PVAV) {
1398 if (PL_op->op_private & OPpLVAL_INTRO)
1399 DIE(aTHX_ "Can't localize pseudo-hash element");
1400 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1406 if (!svp || *svp == &PL_sv_undef) {
1411 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1413 lv = sv_newmortal();
1414 sv_upgrade(lv, SVt_PVLV);
1416 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1417 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1418 LvTARG(lv) = SvREFCNT_inc(hv);
1423 if (PL_op->op_private & OPpLVAL_INTRO) {
1424 if (HvNAME(hv) && isGV(*svp))
1425 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1427 save_helem(hv, keysv, svp);
1429 else if (PL_op->op_private & OPpDEREF)
1430 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1432 sv = (svp ? *svp : &PL_sv_undef);
1433 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1434 * Pushing the magical RHS on to the stack is useless, since
1435 * that magic is soon destined to be misled by the local(),
1436 * and thus the later pp_sassign() will fail to mg_get() the
1437 * old value. This should also cure problems with delayed
1438 * mg_get()s. GSAR 98-07-03 */
1439 if (!lval && SvGMAGICAL(sv))
1440 sv = sv_mortalcopy(sv);
1448 register PERL_CONTEXT *cx;
1454 if (PL_op->op_flags & OPf_SPECIAL) {
1455 cx = &cxstack[cxstack_ix];
1456 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1461 gimme = OP_GIMME(PL_op, -1);
1463 if (cxstack_ix >= 0)
1464 gimme = cxstack[cxstack_ix].blk_gimme;
1470 if (gimme == G_VOID)
1472 else if (gimme == G_SCALAR) {
1475 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1478 *MARK = sv_mortalcopy(TOPs);
1481 *MARK = &PL_sv_undef;
1485 else if (gimme == G_ARRAY) {
1486 /* in case LEAVE wipes old return values */
1487 for (mark = newsp + 1; mark <= SP; mark++) {
1488 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1489 *mark = sv_mortalcopy(*mark);
1490 TAINT_NOT; /* Each item is independent */
1494 PL_curpm = newpm; /* Don't pop $1 et al till now */
1504 register PERL_CONTEXT *cx;
1509 cx = &cxstack[cxstack_ix];
1510 if (CxTYPE(cx) != CXt_LOOP)
1511 DIE(aTHX_ "panic: pp_iter");
1513 av = cx->blk_loop.iterary;
1514 if (SvTYPE(av) != SVt_PVAV) {
1515 /* iterate ($min .. $max) */
1516 if (cx->blk_loop.iterlval) {
1517 /* string increment */
1518 register SV* cur = cx->blk_loop.iterlval;
1520 char *max = SvPV((SV*)av, maxlen);
1521 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1522 #ifndef USE_THREADS /* don't risk potential race */
1523 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1524 && !SvMAGICAL(*cx->blk_loop.itervar))
1526 /* safe to reuse old SV */
1527 sv_setsv(*cx->blk_loop.itervar, cur);
1532 /* we need a fresh SV every time so that loop body sees a
1533 * completely new SV for closures/references to work as
1535 SvREFCNT_dec(*cx->blk_loop.itervar);
1536 *cx->blk_loop.itervar = newSVsv(cur);
1538 if (strEQ(SvPVX(cur), max))
1539 sv_setiv(cur, 0); /* terminate next time */
1546 /* integer increment */
1547 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1550 #ifndef USE_THREADS /* don't risk potential race */
1551 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1552 && !SvMAGICAL(*cx->blk_loop.itervar))
1554 /* safe to reuse old SV */
1555 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1560 /* we need a fresh SV every time so that loop body sees a
1561 * completely new SV for closures/references to work as they
1563 SvREFCNT_dec(*cx->blk_loop.itervar);
1564 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1570 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1573 SvREFCNT_dec(*cx->blk_loop.itervar);
1575 if (sv = (SvMAGICAL(av))
1576 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1577 : AvARRAY(av)[++cx->blk_loop.iterix])
1581 if (av != PL_curstack && SvIMMORTAL(sv)) {
1582 SV *lv = cx->blk_loop.iterlval;
1583 if (lv && SvREFCNT(lv) > 1) {
1588 SvREFCNT_dec(LvTARG(lv));
1590 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1591 sv_upgrade(lv, SVt_PVLV);
1593 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1595 LvTARG(lv) = SvREFCNT_inc(av);
1596 LvTARGOFF(lv) = cx->blk_loop.iterix;
1597 LvTARGLEN(lv) = (UV) -1;
1601 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1608 register PMOP *pm = cPMOP;
1624 register REGEXP *rx = pm->op_pmregexp;
1626 int force_on_match = 0;
1627 I32 oldsave = PL_savestack_ix;
1628 I32 update_minmatch = 1;
1630 /* known replacement string? */
1631 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1632 if (PL_op->op_flags & OPf_STACKED)
1638 if (SvREADONLY(TARG)
1639 || (SvTYPE(TARG) > SVt_PVLV
1640 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1641 Perl_croak(aTHX_ PL_no_modify);
1644 s = SvPV(TARG, len);
1645 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1647 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1648 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1655 DIE(aTHX_ "panic: do_subst");
1658 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1659 position, once with zero-length,
1660 second time with non-zero. */
1662 if (!rx->prelen && PL_curpm) {
1664 rx = pm->op_pmregexp;
1666 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1667 ? REXEC_COPY_STR : 0;
1669 r_flags |= REXEC_SCREAM;
1670 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1671 SAVEINT(PL_multiline);
1672 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1675 if (rx->reganch & RE_USE_INTUIT) {
1676 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1680 /* How to do it in subst? */
1681 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1683 && ((rx->reganch & ROPT_NOSCAN)
1684 || !((rx->reganch & RE_INTUIT_TAIL)
1685 && (r_flags & REXEC_SCREAM))))
1690 /* only replace once? */
1691 once = !(rpm->op_pmflags & PMf_GLOBAL);
1693 /* known replacement string? */
1694 c = dstr ? SvPV(dstr, clen) : Nullch;
1696 /* can do inplace substitution? */
1697 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1698 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1699 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1700 r_flags | REXEC_CHECKED))
1704 LEAVE_SCOPE(oldsave);
1707 if (force_on_match) {
1709 s = SvPV_force(TARG, len);
1714 SvSCREAM_off(TARG); /* disable possible screamer */
1716 rxtainted |= RX_MATCH_TAINTED(rx);
1717 m = orig + rx->startp[0];
1718 d = orig + rx->endp[0];
1720 if (m - s > strend - d) { /* faster to shorten from end */
1722 Copy(c, m, clen, char);
1727 Move(d, m, i, char);
1731 SvCUR_set(TARG, m - s);
1734 else if (i = m - s) { /* faster from front */
1742 Copy(c, m, clen, char);
1747 Copy(c, d, clen, char);
1752 TAINT_IF(rxtainted & 1);
1758 if (iters++ > maxiters)
1759 DIE(aTHX_ "Substitution loop");
1760 rxtainted |= RX_MATCH_TAINTED(rx);
1761 m = rx->startp[0] + orig;
1765 Move(s, d, i, char);
1769 Copy(c, d, clen, char);
1772 s = rx->endp[0] + orig;
1773 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1775 /* don't match same null twice */
1776 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1779 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1780 Move(s, d, i+1, char); /* include the NUL */
1782 TAINT_IF(rxtainted & 1);
1784 PUSHs(sv_2mortal(newSViv((I32)iters)));
1786 (void)SvPOK_only(TARG);
1787 TAINT_IF(rxtainted);
1788 if (SvSMAGICAL(TARG)) {
1794 LEAVE_SCOPE(oldsave);
1798 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1799 r_flags | REXEC_CHECKED))
1801 if (force_on_match) {
1803 s = SvPV_force(TARG, len);
1806 rxtainted |= RX_MATCH_TAINTED(rx);
1807 dstr = NEWSV(25, len);
1808 sv_setpvn(dstr, m, s-m);
1811 register PERL_CONTEXT *cx;
1814 RETURNOP(cPMOP->op_pmreplroot);
1816 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1818 if (iters++ > maxiters)
1819 DIE(aTHX_ "Substitution loop");
1820 rxtainted |= RX_MATCH_TAINTED(rx);
1821 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1826 strend = s + (strend - m);
1828 m = rx->startp[0] + orig;
1829 sv_catpvn(dstr, s, m-s);
1830 s = rx->endp[0] + orig;
1832 sv_catpvn(dstr, c, clen);
1835 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1836 sv_catpvn(dstr, s, strend - s);
1838 (void)SvOOK_off(TARG);
1839 Safefree(SvPVX(TARG));
1840 SvPVX(TARG) = SvPVX(dstr);
1841 SvCUR_set(TARG, SvCUR(dstr));
1842 SvLEN_set(TARG, SvLEN(dstr));
1846 TAINT_IF(rxtainted & 1);
1848 PUSHs(sv_2mortal(newSViv((I32)iters)));
1850 (void)SvPOK_only(TARG);
1851 TAINT_IF(rxtainted);
1854 LEAVE_SCOPE(oldsave);
1863 LEAVE_SCOPE(oldsave);
1872 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1873 ++*PL_markstack_ptr;
1874 LEAVE; /* exit inner scope */
1877 if (PL_stack_base + *PL_markstack_ptr > SP) {
1879 I32 gimme = GIMME_V;
1881 LEAVE; /* exit outer scope */
1882 (void)POPMARK; /* pop src */
1883 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1884 (void)POPMARK; /* pop dst */
1885 SP = PL_stack_base + POPMARK; /* pop original mark */
1886 if (gimme == G_SCALAR) {
1890 else if (gimme == G_ARRAY)
1897 ENTER; /* enter inner scope */
1900 src = PL_stack_base[*PL_markstack_ptr];
1904 RETURNOP(cLOGOP->op_other);
1915 register PERL_CONTEXT *cx;
1916 struct block_sub cxsub;
1919 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1922 if (gimme == G_SCALAR) {
1925 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1927 *MARK = SvREFCNT_inc(TOPs);
1932 *MARK = sv_mortalcopy(TOPs);
1935 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1938 *MARK = &PL_sv_undef;
1942 else if (gimme == G_ARRAY) {
1943 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1944 if (!SvTEMP(*MARK)) {
1945 *MARK = sv_mortalcopy(*MARK);
1946 TAINT_NOT; /* Each item is independent */
1952 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1953 PL_curpm = newpm; /* ... and pop $1 et al */
1956 return pop_return();
1960 S_get_db_sub(pTHX_ SV **svp, CV *cv)
1963 SV *dbsv = GvSV(PL_DBsub);
1965 if (!PERLDB_SUB_NN) {
1969 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1970 || strEQ(GvNAME(gv), "END")
1971 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1972 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1973 && (gv = (GV*)*svp) ))) {
1974 /* Use GV from the stack as a fallback. */
1975 /* GV is potentially non-unique, or contain different CV. */
1976 sv_setsv(dbsv, newRV((SV*)cv));
1979 gv_efullname3(dbsv, gv, Nullch);
1983 SvUPGRADE(dbsv, SVt_PVIV);
1985 SAVEIV(SvIVX(dbsv));
1986 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1990 PL_curcopdb = PL_curcop;
1991 cv = GvCV(PL_DBsub);
2001 register PERL_CONTEXT *cx;
2003 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2006 DIE(aTHX_ "Not a CODE reference");
2007 switch (SvTYPE(sv)) {
2013 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2015 SP = PL_stack_base + POPMARK;
2018 if (SvGMAGICAL(sv)) {
2020 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2023 sym = SvPV(sv, n_a);
2025 DIE(aTHX_ PL_no_usym, "a subroutine");
2026 if (PL_op->op_private & HINT_STRICT_REFS)
2027 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2028 cv = get_cv(sym, TRUE);
2032 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2033 tryAMAGICunDEREF(to_cv);
2036 if (SvTYPE(cv) == SVt_PVCV)
2041 DIE(aTHX_ "Not a CODE reference");
2046 if (!(cv = GvCVu((GV*)sv)))
2047 cv = sv_2cv(sv, &stash, &gv, FALSE);
2060 if (!CvROOT(cv) && !CvXSUB(cv)) {
2064 /* anonymous or undef'd function leaves us no recourse */
2065 if (CvANON(cv) || !(gv = CvGV(cv)))
2066 DIE(aTHX_ "Undefined subroutine called");
2068 /* autoloaded stub? */
2069 if (cv != GvCV(gv)) {
2072 /* should call AUTOLOAD now? */
2075 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2082 sub_name = sv_newmortal();
2083 gv_efullname3(sub_name, gv, Nullch);
2084 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2088 DIE(aTHX_ "Not a CODE reference");
2093 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2094 cv = get_db_sub(&sv, cv);
2096 DIE(aTHX_ "No DBsub routine");
2101 * First we need to check if the sub or method requires locking.
2102 * If so, we gain a lock on the CV, the first argument or the
2103 * stash (for static methods), as appropriate. This has to be
2104 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2105 * reschedule by returning a new op.
2107 MUTEX_LOCK(CvMUTEXP(cv));
2108 if (CvFLAGS(cv) & CVf_LOCKED) {
2110 if (CvFLAGS(cv) & CVf_METHOD) {
2111 if (SP > PL_stack_base + TOPMARK)
2112 sv = *(PL_stack_base + TOPMARK + 1);
2114 AV *av = (AV*)PL_curpad[0];
2115 if (hasargs || !av || AvFILLp(av) < 0
2116 || !(sv = AvARRAY(av)[0]))
2118 MUTEX_UNLOCK(CvMUTEXP(cv));
2119 Perl_croak(aTHX_ "no argument for locked method call");
2126 char *stashname = SvPV(sv, len);
2127 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2133 MUTEX_UNLOCK(CvMUTEXP(cv));
2134 mg = condpair_magic(sv);
2135 MUTEX_LOCK(MgMUTEXP(mg));
2136 if (MgOWNER(mg) == thr)
2137 MUTEX_UNLOCK(MgMUTEXP(mg));
2140 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2142 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2144 MUTEX_UNLOCK(MgMUTEXP(mg));
2145 save_destructor(Perl_unlock_condpair, sv);
2147 MUTEX_LOCK(CvMUTEXP(cv));
2150 * Now we have permission to enter the sub, we must distinguish
2151 * four cases. (0) It's an XSUB (in which case we don't care
2152 * about ownership); (1) it's ours already (and we're recursing);
2153 * (2) it's free (but we may already be using a cached clone);
2154 * (3) another thread owns it. Case (1) is easy: we just use it.
2155 * Case (2) means we look for a clone--if we have one, use it
2156 * otherwise grab ownership of cv. Case (3) means we look for a
2157 * clone (for non-XSUBs) and have to create one if we don't
2159 * Why look for a clone in case (2) when we could just grab
2160 * ownership of cv straight away? Well, we could be recursing,
2161 * i.e. we originally tried to enter cv while another thread
2162 * owned it (hence we used a clone) but it has been freed up
2163 * and we're now recursing into it. It may or may not be "better"
2164 * to use the clone but at least CvDEPTH can be trusted.
2166 if (CvOWNER(cv) == thr || CvXSUB(cv))
2167 MUTEX_UNLOCK(CvMUTEXP(cv));
2169 /* Case (2) or (3) */
2173 * XXX Might it be better to release CvMUTEXP(cv) while we
2174 * do the hv_fetch? We might find someone has pinched it
2175 * when we look again, in which case we would be in case
2176 * (3) instead of (2) so we'd have to clone. Would the fact
2177 * that we released the mutex more quickly make up for this?
2179 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2181 /* We already have a clone to use */
2182 MUTEX_UNLOCK(CvMUTEXP(cv));
2184 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2185 "entersub: %p already has clone %p:%s\n",
2186 thr, cv, SvPEEK((SV*)cv)));
2189 if (CvDEPTH(cv) == 0)
2190 SAVEDESTRUCTOR(S_unset_cvowner, (void*) cv);
2193 /* (2) => grab ownership of cv. (3) => make clone */
2197 MUTEX_UNLOCK(CvMUTEXP(cv));
2198 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2199 "entersub: %p grabbing %p:%s in stash %s\n",
2200 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2201 HvNAME(CvSTASH(cv)) : "(none)"));
2203 /* Make a new clone. */
2205 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2206 MUTEX_UNLOCK(CvMUTEXP(cv));
2207 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2208 "entersub: %p cloning %p:%s\n",
2209 thr, cv, SvPEEK((SV*)cv))));
2211 * We're creating a new clone so there's no race
2212 * between the original MUTEX_UNLOCK and the
2213 * SvREFCNT_inc since no one will be trying to undef
2214 * it out from underneath us. At least, I don't think
2217 clonecv = cv_clone(cv);
2218 SvREFCNT_dec(cv); /* finished with this */
2219 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2220 CvOWNER(clonecv) = thr;
2224 DEBUG_S(if (CvDEPTH(cv) != 0)
2225 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2227 SAVEDESTRUCTOR(S_unset_cvowner, (void*) cv);
2230 #endif /* USE_THREADS */
2233 #ifdef PERL_XSUB_OLDSTYLE
2234 if (CvOLDSTYLE(cv)) {
2235 I32 (*fp3)(int,int,int);
2237 register I32 items = SP - MARK;
2238 /* We dont worry to copy from @_. */
2243 PL_stack_sp = mark + 1;
2244 fp3 = (I32(*)(int,int,int)))CvXSUB(cv;
2245 items = (*fp3)(CvXSUBANY(cv).any_i32,
2246 MARK - PL_stack_base + 1,
2248 PL_stack_sp = PL_stack_base + items;
2251 #endif /* PERL_XSUB_OLDSTYLE */
2253 I32 markix = TOPMARK;
2258 /* Need to copy @_ to stack. Alternative may be to
2259 * switch stack to @_, and copy return values
2260 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2264 av = (AV*)PL_curpad[0];
2266 av = GvAV(PL_defgv);
2267 #endif /* USE_THREADS */
2268 items = AvFILLp(av) + 1; /* @_ is not tieable */
2271 /* Mark is at the end of the stack. */
2273 Copy(AvARRAY(av), SP + 1, items, SV*);
2278 /* We assume first XSUB in &DB::sub is the called one. */
2280 SAVESPTR(PL_curcop);
2281 PL_curcop = PL_curcopdb;
2284 /* Do we need to open block here? XXXX */
2285 (void)(*CvXSUB(cv))(aTHXo_ cv);
2287 /* Enforce some sanity in scalar context. */
2288 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2289 if (markix > PL_stack_sp - PL_stack_base)
2290 *(PL_stack_base + markix) = &PL_sv_undef;
2292 *(PL_stack_base + markix) = *PL_stack_sp;
2293 PL_stack_sp = PL_stack_base + markix;
2301 register I32 items = SP - MARK;
2302 AV* padlist = CvPADLIST(cv);
2303 SV** svp = AvARRAY(padlist);
2304 push_return(PL_op->op_next);
2305 PUSHBLOCK(cx, CXt_SUB, MARK);
2308 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2309 * that eval'' ops within this sub know the correct lexical space.
2310 * Owing the speed considerations, we choose to search for the cv
2311 * in doeval() instead.
2313 if (CvDEPTH(cv) < 2)
2314 (void)SvREFCNT_inc(cv);
2315 else { /* save temporaries on recursion? */
2316 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2318 AV *newpad = newAV();
2319 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2320 I32 ix = AvFILLp((AV*)svp[1]);
2321 svp = AvARRAY(svp[0]);
2322 for ( ;ix > 0; ix--) {
2323 if (svp[ix] != &PL_sv_undef) {
2324 char *name = SvPVX(svp[ix]);
2325 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2326 || *name == '&') /* anonymous code? */
2328 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2330 else { /* our own lexical */
2332 av_store(newpad, ix, sv = (SV*)newAV());
2333 else if (*name == '%')
2334 av_store(newpad, ix, sv = (SV*)newHV());
2336 av_store(newpad, ix, sv = NEWSV(0,0));
2341 av_store(newpad, ix, sv = NEWSV(0,0));
2345 av = newAV(); /* will be @_ */
2347 av_store(newpad, 0, (SV*)av);
2348 AvFLAGS(av) = AVf_REIFY;
2349 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2350 AvFILLp(padlist) = CvDEPTH(cv);
2351 svp = AvARRAY(padlist);
2356 AV* av = (AV*)PL_curpad[0];
2358 items = AvFILLp(av) + 1;
2360 /* Mark is at the end of the stack. */
2362 Copy(AvARRAY(av), SP + 1, items, SV*);
2367 #endif /* USE_THREADS */
2368 SAVESPTR(PL_curpad);
2369 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2372 #endif /* USE_THREADS */
2378 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2379 "%p entersub preparing @_\n", thr));
2381 av = (AV*)PL_curpad[0];
2387 cx->blk_sub.savearray = GvAV(PL_defgv);
2388 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2389 #endif /* USE_THREADS */
2390 cx->blk_sub.argarray = av;
2393 if (items > AvMAX(av) + 1) {
2395 if (AvARRAY(av) != ary) {
2396 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2397 SvPVX(av) = (char*)ary;
2399 if (items > AvMAX(av) + 1) {
2400 AvMAX(av) = items - 1;
2401 Renew(ary,items,SV*);
2403 SvPVX(av) = (char*)ary;
2406 Copy(MARK,AvARRAY(av),items,SV*);
2407 AvFILLp(av) = items - 1;
2415 /* warning must come *after* we fully set up the context
2416 * stuff so that __WARN__ handlers can safely dounwind()
2419 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2420 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2421 sub_crush_depth(cv);
2423 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2424 "%p entersub returning %p\n", thr, CvSTART(cv)));
2426 RETURNOP(CvSTART(cv));
2431 Perl_sub_crush_depth(pTHX_ CV *cv)
2434 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2436 SV* tmpstr = sv_newmortal();
2437 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2438 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2449 U32 lval = PL_op->op_flags & OPf_MOD;
2450 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2454 elem -= PL_curcop->cop_arybase;
2455 if (SvTYPE(av) != SVt_PVAV)
2457 svp = av_fetch(av, elem, lval && !defer);
2459 if (!svp || *svp == &PL_sv_undef) {
2462 DIE(aTHX_ PL_no_aelem, elem);
2463 lv = sv_newmortal();
2464 sv_upgrade(lv, SVt_PVLV);
2466 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2467 LvTARG(lv) = SvREFCNT_inc(av);
2468 LvTARGOFF(lv) = elem;
2473 if (PL_op->op_private & OPpLVAL_INTRO)
2474 save_aelem(av, elem, svp);
2475 else if (PL_op->op_private & OPpDEREF)
2476 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2478 sv = (svp ? *svp : &PL_sv_undef);
2479 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2480 sv = sv_mortalcopy(sv);
2486 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2492 Perl_croak(aTHX_ PL_no_modify);
2493 if (SvTYPE(sv) < SVt_RV)
2494 sv_upgrade(sv, SVt_RV);
2495 else if (SvTYPE(sv) >= SVt_PV) {
2496 (void)SvOOK_off(sv);
2497 Safefree(SvPVX(sv));
2498 SvLEN(sv) = SvCUR(sv) = 0;
2502 SvRV(sv) = NEWSV(355,0);
2505 SvRV(sv) = (SV*)newAV();
2508 SvRV(sv) = (SV*)newHV();
2529 if (SvTYPE(sv) == SVt_PVCV) {
2535 name = SvPV(TOPs, packlen);
2536 sv = *(PL_stack_base + TOPMARK + 1);
2547 !(packname = SvPV(sv, packlen)) ||
2548 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2549 !(ob=(SV*)GvIO(iogv)))
2552 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2553 ? !isIDFIRST_utf8((U8*)packname)
2554 : !isIDFIRST(*packname)
2557 DIE(aTHX_ "Can't call method \"%s\" %s", name,
2558 SvOK(sv)? "without a package or object reference"
2559 : "on an undefined value");
2561 stash = gv_stashpvn(packname, packlen, TRUE);
2564 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2567 if (!ob || !SvOBJECT(ob))
2568 DIE(aTHX_ "Can't call method \"%s\" on unblessed reference", name);
2570 stash = SvSTASH(ob);
2573 gv = gv_fetchmethod(stash, name);
2579 for (p = name; *p; p++) {
2581 sep = p, leaf = p + 1;
2582 else if (*p == ':' && *(p + 1) == ':')
2583 sep = p, leaf = p + 2;
2585 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2586 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2587 packlen = strlen(packname);
2591 packlen = sep - name;
2593 DIE(aTHX_ "Can't locate object method \"%s\" via package \"%.*s\"",
2594 leaf, (int)packlen, packname);
2596 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);