3 * Copyright (c) 1991-1997, 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!
31 #define HOP(pos,off) (IN_UTF8 ? utf8_hop(pos, off) : (pos + off))
37 unset_cvowner(void *cvarg)
39 register CV* cv = (CV *) cvarg;
42 #endif /* DEBUGGING */
44 DEBUG_S((PerlIO_printf(PerlIO_stderr(), "%p unsetting CvOWNER of %p:%s\n",
45 thr, cv, SvPEEK((SV*)cv))));
46 MUTEX_LOCK(CvMUTEXP(cv));
47 DEBUG_S(if (CvDEPTH(cv) != 0)
48 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
50 assert(thr == CvOWNER(cv));
52 MUTEX_UNLOCK(CvMUTEXP(cv));
55 #endif /* USE_THREADS */
66 PL_curcop = (COP*)PL_op;
67 TAINT_NOT; /* Each statement is presumed innocent */
68 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
77 if (PL_op->op_private & OPpLVAL_INTRO)
78 PUSHs(save_scalar(cGVOP->op_gv));
80 PUSHs(GvSV(cGVOP->op_gv));
91 PUSHMARK(PL_stack_sp);
101 sv_setpvn(TARG,s,len);
109 XPUSHs((SV*)cGVOP->op_gv);
120 RETURNOP(cLOGOP->op_other);
129 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
131 temp = left; left = right; right = temp;
133 if (PL_tainting && PL_tainted && !SvTAINTED(left))
135 SvSetMagicSV(right, left);
144 RETURNOP(cCONDOP->op_true);
146 RETURNOP(cCONDOP->op_false);
152 TAINT_NOT; /* Each statement is presumed innocent */
153 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
155 oldsave = PL_scopestack[PL_scopestack_ix - 1];
156 LEAVE_SCOPE(oldsave);
162 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
169 sv_setpvn(TARG,s,len);
171 else if (SvGMAGICAL(TARG))
173 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
174 sv_setpv(TARG, ""); /* Suppress warning. */
175 s = SvPV_force(TARG, len);
179 sv_catpvn(TARG,s,len);
181 sv_setpvn(TARG,s,len); /* suppress warning */
191 if (PL_op->op_flags & OPf_MOD) {
192 if (PL_op->op_private & OPpLVAL_INTRO)
193 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
194 else if (PL_op->op_private & OPpDEREF) {
196 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
205 tryAMAGICunTARGET(iter, 0);
206 PL_last_in_gv = (GV*)(*PL_stack_sp--);
207 if (PL_op->op_flags & OPf_SPECIAL) { /* Are called as <$var> */
208 if (SvROK(PL_last_in_gv)) {
209 if (SvTYPE(SvRV(PL_last_in_gv)) != SVt_PVGV)
211 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
212 } else if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
215 XPUSHs((SV*)PL_last_in_gv);
218 PL_last_in_gv = (GV*)(*PL_stack_sp--);
222 return do_readline();
227 djSP; tryAMAGICbinSET(eq,0);
230 SETs(boolSV(TOPn == value));
238 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
240 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
241 SvIVX(TOPs) != IV_MAX)
244 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
259 RETURNOP(cLOGOP->op_other);
265 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
268 SETn( left + right );
276 AV *av = GvAV((GV*)cSVOP->op_sv);
277 U32 lval = PL_op->op_flags & OPf_MOD;
278 SV** svp = av_fetch(av, PL_op->op_private, lval);
279 SV *sv = (svp ? *svp : &PL_sv_undef);
281 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
282 sv = sv_mortalcopy(sv);
289 djSP; dMARK; dTARGET;
291 do_join(TARG, *MARK, MARK, SP);
302 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
303 * will be enough to hold an OP*.
305 SV* sv = sv_newmortal();
306 sv_upgrade(sv, SVt_PVLV);
308 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
316 /* Oversized hot code. */
320 djSP; dMARK; dORIGMARK;
327 if (PL_op->op_flags & OPf_STACKED)
331 if (mg = SvTIED_mg((SV*)gv, 'q')) {
332 if (MARK == ORIGMARK) {
333 /* If using default handle then we need to make space to
334 * pass object as 1st arg, so move other args up ...
338 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
342 *MARK = SvTIED_obj((SV*)gv, mg);
345 perl_call_method("PRINT", G_SCALAR);
353 if (!(io = GvIO(gv))) {
354 if (ckWARN(WARN_UNOPENED)) {
355 SV* sv = sv_newmortal();
356 gv_fullname3(sv, gv, Nullch);
357 warner(WARN_UNOPENED, "Filehandle %s never opened", SvPV(sv,n_a));
360 SETERRNO(EBADF,RMS$_IFI);
363 else if (!(fp = IoOFP(io))) {
364 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
365 SV* sv = sv_newmortal();
366 gv_fullname3(sv, gv, Nullch);
368 warner(WARN_IO, "Filehandle %s opened only for input",
370 else if (ckWARN(WARN_CLOSED))
371 warner(WARN_CLOSED, "print on closed filehandle %s",
374 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
381 if (!do_print(*MARK, fp))
385 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
394 if (!do_print(*MARK, fp))
403 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
406 if (IoFLAGS(io) & IOf_FLUSH)
407 if (PerlIO_flush(fp) == EOF)
428 tryAMAGICunDEREF(to_av);
431 if (SvTYPE(av) != SVt_PVAV)
432 DIE("Not an ARRAY reference");
433 if (PL_op->op_flags & OPf_REF) {
439 if (SvTYPE(sv) == SVt_PVAV) {
441 if (PL_op->op_flags & OPf_REF) {
449 if (SvTYPE(sv) != SVt_PVGV) {
453 if (SvGMAGICAL(sv)) {
459 if (PL_op->op_flags & OPf_REF ||
460 PL_op->op_private & HINT_STRICT_REFS)
461 DIE(PL_no_usym, "an ARRAY");
462 if (ckWARN(WARN_UNINITIALIZED))
463 warner(WARN_UNINITIALIZED, PL_warn_uninit);
464 if (GIMME == G_ARRAY) {
471 if ((PL_op->op_flags & OPf_SPECIAL) &&
472 !(PL_op->op_flags & OPf_MOD))
474 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
479 if (PL_op->op_private & HINT_STRICT_REFS)
480 DIE(PL_no_symref, sym, "an ARRAY");
481 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
488 if (PL_op->op_private & OPpLVAL_INTRO)
490 if (PL_op->op_flags & OPf_REF) {
497 if (GIMME == G_ARRAY) {
498 I32 maxarg = AvFILL(av) + 1;
499 (void)POPs; /* XXXX May be optimized away? */
501 if (SvRMAGICAL(av)) {
503 for (i=0; i < maxarg; i++) {
504 SV **svp = av_fetch(av, i, FALSE);
505 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
509 Copy(AvARRAY(av), SP+1, maxarg, SV*);
515 I32 maxarg = AvFILL(av) + 1;
528 tryAMAGICunDEREF(to_hv);
531 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
532 DIE("Not a HASH reference");
533 if (PL_op->op_flags & OPf_REF) {
539 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
541 if (PL_op->op_flags & OPf_REF) {
549 if (SvTYPE(sv) != SVt_PVGV) {
553 if (SvGMAGICAL(sv)) {
559 if (PL_op->op_flags & OPf_REF ||
560 PL_op->op_private & HINT_STRICT_REFS)
561 DIE(PL_no_usym, "a HASH");
562 if (ckWARN(WARN_UNINITIALIZED))
563 warner(WARN_UNINITIALIZED, PL_warn_uninit);
564 if (GIMME == G_ARRAY) {
571 if ((PL_op->op_flags & OPf_SPECIAL) &&
572 !(PL_op->op_flags & OPf_MOD))
574 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
579 if (PL_op->op_private & HINT_STRICT_REFS)
580 DIE(PL_no_symref, sym, "a HASH");
581 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
588 if (PL_op->op_private & OPpLVAL_INTRO)
590 if (PL_op->op_flags & OPf_REF) {
597 if (GIMME == G_ARRAY) { /* array wanted */
598 *PL_stack_sp = (SV*)hv;
603 if (SvTYPE(hv) == SVt_PVAV)
604 hv = avhv_keys((AV*)hv);
606 sv_setpvf(TARG, "%ld/%ld",
607 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
619 SV **lastlelem = PL_stack_sp;
620 SV **lastrelem = PL_stack_base + POPMARK;
621 SV **firstrelem = PL_stack_base + POPMARK + 1;
622 SV **firstlelem = lastrelem + 1;
635 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
637 /* If there's a common identifier on both sides we have to take
638 * special care that assigning the identifier on the left doesn't
639 * clobber a value on the right that's used later in the list.
641 if (PL_op->op_private & OPpASSIGN_COMMON) {
642 EXTEND_MORTAL(lastrelem - firstrelem + 1);
643 for (relem = firstrelem; relem <= lastrelem; relem++) {
646 TAINT_NOT; /* Each item is independent */
647 *relem = sv_mortalcopy(sv);
656 while (lelem <= lastlelem) {
657 TAINT_NOT; /* Each item stands on its own, taintwise. */
659 switch (SvTYPE(sv)) {
662 magic = SvMAGICAL(ary) != 0;
665 av_extend(ary, lastrelem - relem);
667 while (relem <= lastrelem) { /* gobble up all the rest */
673 didstore = av_store(ary,i++,sv);
687 magic = SvMAGICAL(hash) != 0;
690 while (relem < lastrelem) { /* gobble up all the rest */
695 sv = &PL_sv_no, relem++;
696 tmpstr = NEWSV(29,0);
698 sv_setsv(tmpstr,*relem); /* value */
700 didstore = hv_store_ent(hash,sv,tmpstr,0);
702 if (SvSMAGICAL(tmpstr))
709 if (relem == lastrelem) {
712 if (ckWARN(WARN_UNSAFE)) {
713 if (relem == firstrelem &&
715 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
716 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
717 warner(WARN_UNSAFE, "Reference found where even-sized list expected");
719 warner(WARN_UNSAFE, "Odd number of elements in hash assignment");
721 tmpstr = NEWSV(29,0);
722 didstore = hv_store_ent(hash,*relem,tmpstr,0);
724 if (SvSMAGICAL(tmpstr))
736 if (SvTHINKFIRST(sv)) {
737 if (SvREADONLY(sv) && PL_curcop != &PL_compiling) {
740 if (relem <= lastrelem)
747 if (relem <= lastrelem) {
748 sv_setsv(sv, *relem);
752 sv_setsv(sv, &PL_sv_undef);
757 if (PL_delaymagic & ~DM_DELAY) {
758 if (PL_delaymagic & DM_UID) {
760 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
763 (void)setreuid(PL_uid,PL_euid);
766 if ((PL_delaymagic & DM_UID) == DM_RUID) {
767 (void)setruid(PL_uid);
768 PL_delaymagic &= ~DM_RUID;
770 # endif /* HAS_SETRUID */
772 if ((PL_delaymagic & DM_UID) == DM_EUID) {
773 (void)seteuid(PL_uid);
774 PL_delaymagic &= ~DM_EUID;
776 # endif /* HAS_SETEUID */
777 if (PL_delaymagic & DM_UID) {
778 if (PL_uid != PL_euid)
779 DIE("No setreuid available");
780 (void)PerlProc_setuid(PL_uid);
782 # endif /* HAS_SETREUID */
783 #endif /* HAS_SETRESUID */
784 PL_uid = (int)PerlProc_getuid();
785 PL_euid = (int)PerlProc_geteuid();
787 if (PL_delaymagic & DM_GID) {
789 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
792 (void)setregid(PL_gid,PL_egid);
795 if ((PL_delaymagic & DM_GID) == DM_RGID) {
796 (void)setrgid(PL_gid);
797 PL_delaymagic &= ~DM_RGID;
799 # endif /* HAS_SETRGID */
801 if ((PL_delaymagic & DM_GID) == DM_EGID) {
802 (void)setegid(PL_gid);
803 PL_delaymagic &= ~DM_EGID;
805 # endif /* HAS_SETEGID */
806 if (PL_delaymagic & DM_GID) {
807 if (PL_gid != PL_egid)
808 DIE("No setregid available");
809 (void)PerlProc_setgid(PL_gid);
811 # endif /* HAS_SETREGID */
812 #endif /* HAS_SETRESGID */
813 PL_gid = (int)PerlProc_getgid();
814 PL_egid = (int)PerlProc_getegid();
816 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
823 else if (gimme == G_SCALAR) {
826 SETi(lastrelem - firstrelem + 1);
832 SP = firstrelem + (lastlelem - firstlelem);
833 lelem = firstlelem + (relem - firstrelem);
835 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
843 register PMOP *pm = cPMOP;
844 SV *rv = sv_newmortal();
845 SV *sv = newSVrv(rv, "Regexp");
846 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
853 register PMOP *pm = cPMOP;
860 register REGEXP *rx = pm->op_pmregexp;
865 I32 oldsave = PL_savestack_ix;
866 I32 update_minmatch = 1;
869 if (PL_op->op_flags & OPf_STACKED)
875 PUTBACK; /* EVAL blocks need stack_sp. */
879 DIE("panic: do_match");
880 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
881 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
884 if (pm->op_pmdynflags & PMdf_USED) {
886 if (gimme == G_ARRAY)
891 if (!rx->prelen && PL_curpm) {
893 rx = pm->op_pmregexp;
895 if (rx->minlen > len) goto failure;
899 /* XXXX What part of this is needed with true \G-support? */
900 if (global = pm->op_pmflags & PMf_GLOBAL) {
902 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
903 MAGIC* mg = mg_find(TARG, 'g');
904 if (mg && mg->mg_len >= 0) {
905 if (!(rx->reganch & ROPT_GPOS_SEEN))
906 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
907 minmatch = (mg->mg_flags & MGf_MINMATCH);
912 r_flags = ((gimme != G_ARRAY && !global && rx->nparens)
913 || SvTEMP(TARG) || PL_sawampersand)
914 ? REXEC_COPY_STR : 0;
915 if (SvSCREAM(TARG) && rx->check_substr
916 && SvTYPE(rx->check_substr) == SVt_PVBM
917 && SvVALID(rx->check_substr))
918 r_flags |= REXEC_SCREAM;
920 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
921 SAVEINT(PL_multiline);
922 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
926 if (global && rx->startp[0]) {
928 if ((s + rx->minlen) > strend)
930 if (update_minmatch++)
931 minmatch = had_zerolen;
933 if (rx->check_substr) {
934 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
935 if (r_flags & REXEC_SCREAM) {
939 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
942 b = (char*)HOP((U8*)s, rx->check_offset_min);
943 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
946 if ((rx->reganch & ROPT_CHECK_ALL)
947 && !PL_sawampersand && !SvTAIL(rx->check_substr))
950 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
951 (unsigned char*)strend,
952 rx->check_substr, 0)))
954 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
956 if (s && rx->check_offset_max < s - t) {
957 ++BmUSEFUL(rx->check_substr);
958 s = (char*)HOP((U8*)s, -rx->check_offset_max);
963 /* Now checkstring is fixed, i.e. at fixed offset from the
964 beginning of match, and the match is anchored at s. */
965 else if (!PL_multiline) { /* Anchored near beginning of string. */
967 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
968 if (*SvPVX(rx->check_substr) != *b
969 || ((slen = SvCUR(rx->check_substr)) > 1
970 && memNE(SvPVX(rx->check_substr), b, slen)))
973 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
974 && rx->check_substr == rx->float_substr) {
975 SvREFCNT_dec(rx->check_substr);
976 rx->check_substr = Nullsv; /* opt is being useless */
977 rx->float_substr = Nullsv;
980 if (CALLREGEXEC(rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
983 if (pm->op_pmflags & PMf_ONCE)
984 pm->op_pmdynflags |= PMdf_USED;
993 RX_MATCH_TAINTED_on(rx);
994 TAINT_IF(RX_MATCH_TAINTED(rx));
995 if (gimme == G_ARRAY) {
999 if (global && !iters)
1003 SPAGAIN; /* EVAL blocks could move the stack. */
1004 EXTEND(SP, iters + i);
1005 EXTEND_MORTAL(iters + i);
1006 for (i = !i; i <= iters; i++) {
1007 PUSHs(sv_newmortal());
1009 if ((s = rx->startp[i]) && rx->endp[i] ) {
1010 len = rx->endp[i] - s;
1011 sv_setpvn(*SP, s, len);
1015 truebase = rx->subbeg;
1016 strend = rx->subend;
1017 had_zerolen = (rx->startp[0] && rx->startp[0] == rx->endp[0]);
1018 PUTBACK; /* EVAL blocks may use stack */
1019 r_flags |= REXEC_IGNOREPOS;
1024 LEAVE_SCOPE(oldsave);
1030 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1031 mg = mg_find(TARG, 'g');
1033 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1034 mg = mg_find(TARG, 'g');
1036 if (rx->startp[0]) {
1037 mg->mg_len = rx->endp[0] - rx->subbeg;
1038 if (rx->startp[0] == rx->endp[0])
1039 mg->mg_flags |= MGf_MINMATCH;
1041 mg->mg_flags &= ~MGf_MINMATCH;
1044 LEAVE_SCOPE(oldsave);
1048 yup: /* Confirmed by check_substr */
1050 RX_MATCH_TAINTED_on(rx);
1051 TAINT_IF(RX_MATCH_TAINTED(rx));
1052 ++BmUSEFUL(rx->check_substr);
1054 if (pm->op_pmflags & PMf_ONCE)
1055 pm->op_pmdynflags |= PMdf_USED;
1056 Safefree(rx->subbase);
1057 rx->subbase = Nullch;
1059 rx->subbeg = truebase;
1060 rx->subend = strend;
1062 rx->endp[0] = s + SvCUR(rx->check_substr);
1065 if (PL_sawampersand) {
1068 tmps = rx->subbase = savepvn(t, strend-t);
1070 rx->subend = tmps + (strend-t);
1071 tmps = rx->startp[0] = tmps + (s - t);
1072 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1074 LEAVE_SCOPE(oldsave);
1078 if (rx->check_substr)
1079 ++BmUSEFUL(rx->check_substr);
1082 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1083 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1084 MAGIC* mg = mg_find(TARG, 'g');
1089 LEAVE_SCOPE(oldsave);
1090 if (gimme == G_ARRAY)
1098 dSP; dTARGETSTACKED;
1103 register IO *io = GvIO(PL_last_in_gv);
1104 register I32 type = PL_op->op_type;
1105 I32 gimme = GIMME_V;
1108 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1110 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1113 perl_call_method("READLINE", gimme);
1116 if (gimme == G_SCALAR)
1117 SvSetMagicSV_nosteal(TARG, TOPs);
1124 if (IoFLAGS(io) & IOf_ARGV) {
1125 if (IoFLAGS(io) & IOf_START) {
1126 IoFLAGS(io) &= ~IOf_START;
1128 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1129 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1130 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1131 SvSETMAGIC(GvSV(PL_last_in_gv));
1136 fp = nextargv(PL_last_in_gv);
1137 if (!fp) { /* Note: fp != IoIFP(io) */
1138 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1139 IoFLAGS(io) |= IOf_START;
1142 else if (type == OP_GLOB) {
1143 SV *tmpcmd = NEWSV(55, 0);
1147 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1148 /* since spawning off a process is a real performance hit */
1150 #include <descrip.h>
1151 #include <lib$routines.h>
1154 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1155 char vmsspec[NAM$C_MAXRSS+1];
1156 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1157 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1158 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1161 struct dsc$descriptor_s wilddsc
1162 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1163 struct dsc$descriptor_vs rsdsc
1164 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1165 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1167 /* We could find out if there's an explicit dev/dir or version
1168 by peeking into lib$find_file's internal context at
1169 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1170 but that's unsupported, so I don't want to do it now and
1171 have it bite someone in the future. */
1172 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1173 cp = SvPV(tmpglob,i);
1175 if (cp[i] == ';') hasver = 1;
1177 if (sts) hasver = 1;
1181 hasdir = isunix = 1;
1184 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1189 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1191 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1192 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1193 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1194 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1195 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1196 &dfltdsc,NULL,NULL,NULL))&1)) {
1197 end = rstr + (unsigned long int) *rslt;
1198 if (!hasver) while (*end != ';') end--;
1199 *(end++) = '\n'; *end = '\0';
1200 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1202 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1207 while (*(--begin) != ']' && *begin != '>') ;
1210 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1212 if (cxt) (void)lib$find_file_end(&cxt);
1213 if (ok && sts != RMS$_NMF &&
1214 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1217 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1219 PerlIO_close(tmpfp);
1223 PerlIO_rewind(tmpfp);
1225 IoIFP(io) = fp = tmpfp;
1226 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1233 sv_setpv(tmpcmd, "for a in ");
1234 sv_catsv(tmpcmd, tmpglob);
1235 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1238 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1239 sv_catsv(tmpcmd, tmpglob);
1241 sv_setpv(tmpcmd, "perlglob ");
1242 sv_catsv(tmpcmd, tmpglob);
1243 sv_catpv(tmpcmd, " |");
1248 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1249 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1250 sv_catsv(tmpcmd, tmpglob);
1251 sv_catpv(tmpcmd, "' 2>/dev/null |");
1253 sv_setpv(tmpcmd, "echo ");
1254 sv_catsv(tmpcmd, tmpglob);
1256 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1258 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1261 #endif /* !DOSISH */
1262 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1263 FALSE, O_RDONLY, 0, Nullfp);
1269 else if (type == OP_GLOB)
1273 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START))
1275 "Read on closed filehandle <%s>", GvENAME(PL_last_in_gv));
1276 if (gimme == G_SCALAR) {
1277 (void)SvOK_off(TARG);
1283 if (gimme == G_SCALAR) {
1287 (void)SvUPGRADE(sv, SVt_PV);
1288 tmplen = SvLEN(sv); /* remember if already alloced */
1290 Sv_Grow(sv, 80); /* try short-buffering it */
1291 if (type == OP_RCATLINE)
1297 sv = sv_2mortal(NEWSV(57, 80));
1301 /* flip-flop EOF state for a snarfed empty file */
1302 #define SNARF_EOF(gimme,rs,io,sv) \
1303 ((gimme != G_SCALAR || SvCUR(sv) \
1304 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1305 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1306 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1309 if (!sv_gets(sv, fp, offset)
1310 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1312 PerlIO_clearerr(fp);
1313 if (IoFLAGS(io) & IOf_ARGV) {
1314 fp = nextargv(PL_last_in_gv);
1317 (void)do_close(PL_last_in_gv, FALSE);
1318 IoFLAGS(io) |= IOf_START;
1320 else if (type == OP_GLOB) {
1321 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1323 "glob failed (child exited with status %d%s)",
1324 STATUS_CURRENT >> 8,
1325 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1328 if (gimme == G_SCALAR) {
1329 (void)SvOK_off(TARG);
1334 /* This should not be marked tainted if the fp is marked clean */
1335 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1342 if (type == OP_GLOB) {
1345 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1346 tmps = SvEND(sv) - 1;
1347 if (*tmps == *SvPVX(PL_rs)) {
1352 for (tmps = SvPVX(sv); *tmps; tmps++)
1353 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1354 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1356 if (*tmps && PerlLIO_stat(SvPVX(sv), &PL_statbuf) < 0) {
1357 (void)POPs; /* Unmatched wildcard? Chuck it... */
1361 if (gimme == G_ARRAY) {
1362 if (SvLEN(sv) - SvCUR(sv) > 20) {
1363 SvLEN_set(sv, SvCUR(sv)+1);
1364 Renew(SvPVX(sv), SvLEN(sv), char);
1366 sv = sv_2mortal(NEWSV(58, 80));
1369 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1370 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1374 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1375 Renew(SvPVX(sv), SvLEN(sv), char);
1384 register PERL_CONTEXT *cx;
1385 I32 gimme = OP_GIMME(PL_op, -1);
1388 if (cxstack_ix >= 0)
1389 gimme = cxstack[cxstack_ix].blk_gimme;
1397 PUSHBLOCK(cx, CXt_BLOCK, SP);
1409 U32 lval = PL_op->op_flags & OPf_MOD;
1410 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1413 if (SvTYPE(hv) == SVt_PVHV) {
1414 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1415 svp = he ? &HeVAL(he) : 0;
1417 else if (SvTYPE(hv) == SVt_PVAV) {
1418 if (PL_op->op_private & OPpLVAL_INTRO)
1419 DIE("Can't localize pseudo-hash element");
1420 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1426 if (!svp || *svp == &PL_sv_undef) {
1431 DIE(PL_no_helem, SvPV(keysv, n_a));
1433 lv = sv_newmortal();
1434 sv_upgrade(lv, SVt_PVLV);
1436 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1437 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1438 LvTARG(lv) = SvREFCNT_inc(hv);
1443 if (PL_op->op_private & OPpLVAL_INTRO) {
1444 if (HvNAME(hv) && isGV(*svp))
1445 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1447 save_helem(hv, keysv, svp);
1449 else if (PL_op->op_private & OPpDEREF)
1450 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1452 sv = (svp ? *svp : &PL_sv_undef);
1453 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1454 * Pushing the magical RHS on to the stack is useless, since
1455 * that magic is soon destined to be misled by the local(),
1456 * and thus the later pp_sassign() will fail to mg_get() the
1457 * old value. This should also cure problems with delayed
1458 * mg_get()s. GSAR 98-07-03 */
1459 if (!lval && SvGMAGICAL(sv))
1460 sv = sv_mortalcopy(sv);
1468 register PERL_CONTEXT *cx;
1474 if (PL_op->op_flags & OPf_SPECIAL) {
1475 cx = &cxstack[cxstack_ix];
1476 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1481 gimme = OP_GIMME(PL_op, -1);
1483 if (cxstack_ix >= 0)
1484 gimme = cxstack[cxstack_ix].blk_gimme;
1490 if (gimme == G_VOID)
1492 else if (gimme == G_SCALAR) {
1495 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1498 *MARK = sv_mortalcopy(TOPs);
1501 *MARK = &PL_sv_undef;
1505 else if (gimme == G_ARRAY) {
1506 /* in case LEAVE wipes old return values */
1507 for (mark = newsp + 1; mark <= SP; mark++) {
1508 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1509 *mark = sv_mortalcopy(*mark);
1510 TAINT_NOT; /* Each item is independent */
1514 PL_curpm = newpm; /* Don't pop $1 et al till now */
1524 register PERL_CONTEXT *cx;
1529 cx = &cxstack[cxstack_ix];
1530 if (CxTYPE(cx) != CXt_LOOP)
1531 DIE("panic: pp_iter");
1533 av = cx->blk_loop.iterary;
1534 if (SvTYPE(av) != SVt_PVAV) {
1535 /* iterate ($min .. $max) */
1536 if (cx->blk_loop.iterlval) {
1537 /* string increment */
1538 register SV* cur = cx->blk_loop.iterlval;
1540 char *max = SvPV((SV*)av, maxlen);
1541 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1542 #ifndef USE_THREADS /* don't risk potential race */
1543 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1544 && !SvMAGICAL(*cx->blk_loop.itervar))
1546 /* safe to reuse old SV */
1547 sv_setsv(*cx->blk_loop.itervar, cur);
1552 /* we need a fresh SV every time so that loop body sees a
1553 * completely new SV for closures/references to work as
1555 SvREFCNT_dec(*cx->blk_loop.itervar);
1556 *cx->blk_loop.itervar = newSVsv(cur);
1558 if (strEQ(SvPVX(cur), max))
1559 sv_setiv(cur, 0); /* terminate next time */
1566 /* integer increment */
1567 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1570 #ifndef USE_THREADS /* don't risk potential race */
1571 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1572 && !SvMAGICAL(*cx->blk_loop.itervar))
1574 /* safe to reuse old SV */
1575 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1580 /* we need a fresh SV every time so that loop body sees a
1581 * completely new SV for closures/references to work as they
1583 SvREFCNT_dec(*cx->blk_loop.itervar);
1584 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1590 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1593 SvREFCNT_dec(*cx->blk_loop.itervar);
1595 if (sv = (SvMAGICAL(av))
1596 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1597 : AvARRAY(av)[++cx->blk_loop.iterix])
1601 if (av != PL_curstack && SvIMMORTAL(sv)) {
1602 SV *lv = cx->blk_loop.iterlval;
1603 if (lv && SvREFCNT(lv) > 1) {
1608 SvREFCNT_dec(LvTARG(lv));
1610 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1611 sv_upgrade(lv, SVt_PVLV);
1613 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1615 LvTARG(lv) = SvREFCNT_inc(av);
1616 LvTARGOFF(lv) = cx->blk_loop.iterix;
1617 LvTARGLEN(lv) = (UV) -1;
1621 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1628 register PMOP *pm = cPMOP;
1644 register REGEXP *rx = pm->op_pmregexp;
1646 int force_on_match = 0;
1647 I32 oldsave = PL_savestack_ix;
1648 I32 update_minmatch = 1;
1650 /* known replacement string? */
1651 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1652 if (PL_op->op_flags & OPf_STACKED)
1658 if (SvREADONLY(TARG)
1659 || (SvTYPE(TARG) > SVt_PVLV
1660 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1661 croak(PL_no_modify);
1664 s = SvPV(TARG, len);
1665 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1667 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1668 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1675 DIE("panic: do_subst");
1678 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1679 position, once with zero-length,
1680 second time with non-zero. */
1682 if (!rx->prelen && PL_curpm) {
1684 rx = pm->op_pmregexp;
1686 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1687 ? REXEC_COPY_STR : 0;
1688 if (SvSCREAM(TARG) && rx->check_substr
1689 && SvTYPE(rx->check_substr) == SVt_PVBM
1690 && SvVALID(rx->check_substr))
1691 r_flags |= REXEC_SCREAM;
1692 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1693 SAVEINT(PL_multiline);
1694 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1697 if (rx->check_substr) {
1698 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1699 if (r_flags & REXEC_SCREAM) {
1703 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1706 b = (char*)HOP((U8*)s, rx->check_offset_min);
1707 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
1710 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
1711 (unsigned char*)strend,
1712 rx->check_substr, 0)))
1714 if (s && rx->check_offset_max < s - m) {
1715 ++BmUSEFUL(rx->check_substr);
1716 s = (char*)HOP((U8*)s, -rx->check_offset_max);
1721 /* Now checkstring is fixed, i.e. at fixed offset from the
1722 beginning of match, and the match is anchored at s. */
1723 else if (!PL_multiline) { /* Anchored at beginning of string. */
1725 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
1726 if (*SvPVX(rx->check_substr) != *b
1727 || ((slen = SvCUR(rx->check_substr)) > 1
1728 && memNE(SvPVX(rx->check_substr), b, slen)))
1731 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
1732 && rx->check_substr == rx->float_substr) {
1733 SvREFCNT_dec(rx->check_substr);
1734 rx->check_substr = Nullsv; /* opt is being useless */
1735 rx->float_substr = Nullsv;
1739 /* only replace once? */
1740 once = !(rpm->op_pmflags & PMf_GLOBAL);
1742 /* known replacement string? */
1743 c = dstr ? SvPV(dstr, clen) : Nullch;
1745 /* can do inplace substitution? */
1746 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1747 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1748 if (!CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1751 LEAVE_SCOPE(oldsave);
1754 if (force_on_match) {
1756 s = SvPV_force(TARG, len);
1761 SvSCREAM_off(TARG); /* disable possible screamer */
1763 rxtainted |= RX_MATCH_TAINTED(rx);
1765 m = orig + (rx->startp[0] - rx->subbase);
1766 d = orig + (rx->endp[0] - rx->subbase);
1772 if (m - s > strend - d) { /* faster to shorten from end */
1774 Copy(c, m, clen, char);
1779 Move(d, m, i, char);
1783 SvCUR_set(TARG, m - s);
1786 else if (i = m - s) { /* faster from front */
1794 Copy(c, m, clen, char);
1799 Copy(c, d, clen, char);
1804 TAINT_IF(rxtainted & 1);
1810 if (iters++ > maxiters)
1811 DIE("Substitution loop");
1812 rxtainted |= RX_MATCH_TAINTED(rx);
1817 Move(s, d, i, char);
1821 Copy(c, d, clen, char);
1825 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1826 Nullsv, NULL, 0)); /* don't match same null twice */
1829 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1830 Move(s, d, i+1, char); /* include the NUL */
1832 TAINT_IF(rxtainted & 1);
1834 PUSHs(sv_2mortal(newSViv((I32)iters)));
1836 (void)SvPOK_only(TARG);
1837 TAINT_IF(rxtainted);
1838 if (SvSMAGICAL(TARG)) {
1844 LEAVE_SCOPE(oldsave);
1848 if (CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1849 if (force_on_match) {
1851 s = SvPV_force(TARG, len);
1854 rxtainted |= RX_MATCH_TAINTED(rx);
1855 dstr = NEWSV(25, len);
1856 sv_setpvn(dstr, m, s-m);
1859 register PERL_CONTEXT *cx;
1862 RETURNOP(cPMOP->op_pmreplroot);
1864 r_flags |= REXEC_IGNOREPOS;
1866 if (iters++ > maxiters)
1867 DIE("Substitution loop");
1868 rxtainted |= RX_MATCH_TAINTED(rx);
1869 if (rx->subbase && rx->subbase != orig) {
1874 strend = s + (strend - m);
1877 sv_catpvn(dstr, s, m-s);
1880 sv_catpvn(dstr, c, clen);
1883 } while (CALLREGEXEC(rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1884 sv_catpvn(dstr, s, strend - s);
1886 (void)SvOOK_off(TARG);
1887 Safefree(SvPVX(TARG));
1888 SvPVX(TARG) = SvPVX(dstr);
1889 SvCUR_set(TARG, SvCUR(dstr));
1890 SvLEN_set(TARG, SvLEN(dstr));
1894 TAINT_IF(rxtainted & 1);
1896 PUSHs(sv_2mortal(newSViv((I32)iters)));
1898 (void)SvPOK_only(TARG);
1899 TAINT_IF(rxtainted);
1902 LEAVE_SCOPE(oldsave);
1908 ++BmUSEFUL(rx->check_substr);
1913 LEAVE_SCOPE(oldsave);
1922 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1923 ++*PL_markstack_ptr;
1924 LEAVE; /* exit inner scope */
1927 if (PL_stack_base + *PL_markstack_ptr > SP) {
1929 I32 gimme = GIMME_V;
1931 LEAVE; /* exit outer scope */
1932 (void)POPMARK; /* pop src */
1933 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1934 (void)POPMARK; /* pop dst */
1935 SP = PL_stack_base + POPMARK; /* pop original mark */
1936 if (gimme == G_SCALAR) {
1940 else if (gimme == G_ARRAY)
1947 ENTER; /* enter inner scope */
1950 src = PL_stack_base[*PL_markstack_ptr];
1954 RETURNOP(cLOGOP->op_other);
1965 register PERL_CONTEXT *cx;
1966 struct block_sub cxsub;
1969 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1972 if (gimme == G_SCALAR) {
1975 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1977 *MARK = SvREFCNT_inc(TOPs);
1982 *MARK = sv_mortalcopy(TOPs);
1985 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1988 *MARK = &PL_sv_undef;
1992 else if (gimme == G_ARRAY) {
1993 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1994 if (!SvTEMP(*MARK)) {
1995 *MARK = sv_mortalcopy(*MARK);
1996 TAINT_NOT; /* Each item is independent */
2002 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
2003 PL_curpm = newpm; /* ... and pop $1 et al */
2006 return pop_return();
2010 get_db_sub(SV **svp, CV *cv)
2013 SV *dbsv = GvSV(PL_DBsub);
2015 if (!PERLDB_SUB_NN) {
2019 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2020 || strEQ(GvNAME(gv), "END")
2021 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2022 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2023 && (gv = (GV*)*svp) ))) {
2024 /* Use GV from the stack as a fallback. */
2025 /* GV is potentially non-unique, or contain different CV. */
2026 sv_setsv(dbsv, newRV((SV*)cv));
2029 gv_efullname3(dbsv, gv, Nullch);
2033 SvUPGRADE(dbsv, SVt_PVIV);
2035 SAVEIV(SvIVX(dbsv));
2036 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
2040 PL_curcopdb = PL_curcop;
2041 cv = GvCV(PL_DBsub);
2051 register PERL_CONTEXT *cx;
2053 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2056 DIE("Not a CODE reference");
2057 switch (SvTYPE(sv)) {
2063 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2065 SP = PL_stack_base + POPMARK;
2068 if (SvGMAGICAL(sv)) {
2070 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2073 sym = SvPV(sv, n_a);
2075 DIE(PL_no_usym, "a subroutine");
2076 if (PL_op->op_private & HINT_STRICT_REFS)
2077 DIE(PL_no_symref, sym, "a subroutine");
2078 cv = perl_get_cv(sym, TRUE);
2082 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2083 tryAMAGICunDEREF(to_cv);
2086 if (SvTYPE(cv) == SVt_PVCV)
2091 DIE("Not a CODE reference");
2096 if (!(cv = GvCVu((GV*)sv)))
2097 cv = sv_2cv(sv, &stash, &gv, TRUE);
2106 DIE("Not a CODE reference");
2108 if (!CvROOT(cv) && !CvXSUB(cv)) {
2112 /* anonymous or undef'd function leaves us no recourse */
2113 if (CvANON(cv) || !(gv = CvGV(cv)))
2114 DIE("Undefined subroutine called");
2115 /* autoloaded stub? */
2116 if (cv != GvCV(gv)) {
2120 /* should call AUTOLOAD now? */
2121 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2128 sub_name = sv_newmortal();
2129 gv_efullname3(sub_name, gv, Nullch);
2130 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2134 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2135 cv = get_db_sub(&sv, cv);
2137 DIE("No DBsub routine");
2141 * First we need to check if the sub or method requires locking.
2142 * If so, we gain a lock on the CV, the first argument or the
2143 * stash (for static methods), as appropriate. This has to be
2144 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2145 * reschedule by returning a new op.
2147 MUTEX_LOCK(CvMUTEXP(cv));
2148 if (CvFLAGS(cv) & CVf_LOCKED) {
2150 if (CvFLAGS(cv) & CVf_METHOD) {
2151 if (SP > PL_stack_base + TOPMARK)
2152 sv = *(PL_stack_base + TOPMARK + 1);
2154 MUTEX_UNLOCK(CvMUTEXP(cv));
2155 croak("no argument for locked method call");
2161 char *stashname = SvPV(sv, len);
2162 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2168 MUTEX_UNLOCK(CvMUTEXP(cv));
2169 mg = condpair_magic(sv);
2170 MUTEX_LOCK(MgMUTEXP(mg));
2171 if (MgOWNER(mg) == thr)
2172 MUTEX_UNLOCK(MgMUTEXP(mg));
2175 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2177 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2179 MUTEX_UNLOCK(MgMUTEXP(mg));
2180 save_destructor(unlock_condpair, sv);
2182 MUTEX_LOCK(CvMUTEXP(cv));
2185 * Now we have permission to enter the sub, we must distinguish
2186 * four cases. (0) It's an XSUB (in which case we don't care
2187 * about ownership); (1) it's ours already (and we're recursing);
2188 * (2) it's free (but we may already be using a cached clone);
2189 * (3) another thread owns it. Case (1) is easy: we just use it.
2190 * Case (2) means we look for a clone--if we have one, use it
2191 * otherwise grab ownership of cv. Case (3) means we look for a
2192 * clone (for non-XSUBs) and have to create one if we don't
2194 * Why look for a clone in case (2) when we could just grab
2195 * ownership of cv straight away? Well, we could be recursing,
2196 * i.e. we originally tried to enter cv while another thread
2197 * owned it (hence we used a clone) but it has been freed up
2198 * and we're now recursing into it. It may or may not be "better"
2199 * to use the clone but at least CvDEPTH can be trusted.
2201 if (CvOWNER(cv) == thr || CvXSUB(cv))
2202 MUTEX_UNLOCK(CvMUTEXP(cv));
2204 /* Case (2) or (3) */
2208 * XXX Might it be better to release CvMUTEXP(cv) while we
2209 * do the hv_fetch? We might find someone has pinched it
2210 * when we look again, in which case we would be in case
2211 * (3) instead of (2) so we'd have to clone. Would the fact
2212 * that we released the mutex more quickly make up for this?
2214 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2216 /* We already have a clone to use */
2217 MUTEX_UNLOCK(CvMUTEXP(cv));
2219 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2220 "entersub: %p already has clone %p:%s\n",
2221 thr, cv, SvPEEK((SV*)cv)));
2224 if (CvDEPTH(cv) == 0)
2225 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2228 /* (2) => grab ownership of cv. (3) => make clone */
2232 MUTEX_UNLOCK(CvMUTEXP(cv));
2233 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2234 "entersub: %p grabbing %p:%s in stash %s\n",
2235 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2236 HvNAME(CvSTASH(cv)) : "(none)"));
2238 /* Make a new clone. */
2240 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2241 MUTEX_UNLOCK(CvMUTEXP(cv));
2242 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2243 "entersub: %p cloning %p:%s\n",
2244 thr, cv, SvPEEK((SV*)cv))));
2246 * We're creating a new clone so there's no race
2247 * between the original MUTEX_UNLOCK and the
2248 * SvREFCNT_inc since no one will be trying to undef
2249 * it out from underneath us. At least, I don't think
2252 clonecv = cv_clone(cv);
2253 SvREFCNT_dec(cv); /* finished with this */
2254 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2255 CvOWNER(clonecv) = thr;
2259 DEBUG_S(if (CvDEPTH(cv) != 0)
2260 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2262 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2265 #endif /* USE_THREADS */
2268 if (CvOLDSTYLE(cv)) {
2269 I32 (*fp3)_((int,int,int));
2271 register I32 items = SP - MARK;
2272 /* We dont worry to copy from @_. */
2277 PL_stack_sp = mark + 1;
2278 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2279 items = (*fp3)(CvXSUBANY(cv).any_i32,
2280 MARK - PL_stack_base + 1,
2282 PL_stack_sp = PL_stack_base + items;
2285 I32 markix = TOPMARK;
2290 /* Need to copy @_ to stack. Alternative may be to
2291 * switch stack to @_, and copy return values
2292 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2296 av = (AV*)PL_curpad[0];
2298 av = GvAV(PL_defgv);
2299 #endif /* USE_THREADS */
2300 items = AvFILLp(av) + 1; /* @_ is not tieable */
2303 /* Mark is at the end of the stack. */
2305 Copy(AvARRAY(av), SP + 1, items, SV*);
2310 if (PL_curcopdb) { /* We assume that the first
2311 XSUB in &DB::sub is the
2313 SAVESPTR(PL_curcop);
2314 PL_curcop = PL_curcopdb;
2317 /* Do we need to open block here? XXXX */
2318 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2320 /* Enforce some sanity in scalar context. */
2321 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2322 if (markix > PL_stack_sp - PL_stack_base)
2323 *(PL_stack_base + markix) = &PL_sv_undef;
2325 *(PL_stack_base + markix) = *PL_stack_sp;
2326 PL_stack_sp = PL_stack_base + markix;
2334 register I32 items = SP - MARK;
2335 AV* padlist = CvPADLIST(cv);
2336 SV** svp = AvARRAY(padlist);
2337 push_return(PL_op->op_next);
2338 PUSHBLOCK(cx, CXt_SUB, MARK);
2341 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2342 * that eval'' ops within this sub know the correct lexical space.
2343 * Owing the speed considerations, we choose to search for the cv
2344 * in doeval() instead.
2346 if (CvDEPTH(cv) < 2)
2347 (void)SvREFCNT_inc(cv);
2348 else { /* save temporaries on recursion? */
2349 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2351 AV *newpad = newAV();
2352 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2353 I32 ix = AvFILLp((AV*)svp[1]);
2354 svp = AvARRAY(svp[0]);
2355 for ( ;ix > 0; ix--) {
2356 if (svp[ix] != &PL_sv_undef) {
2357 char *name = SvPVX(svp[ix]);
2358 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2359 || *name == '&') /* anonymous code? */
2361 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2363 else { /* our own lexical */
2365 av_store(newpad, ix, sv = (SV*)newAV());
2366 else if (*name == '%')
2367 av_store(newpad, ix, sv = (SV*)newHV());
2369 av_store(newpad, ix, sv = NEWSV(0,0));
2374 av_store(newpad, ix, sv = NEWSV(0,0));
2378 av = newAV(); /* will be @_ */
2380 av_store(newpad, 0, (SV*)av);
2381 AvFLAGS(av) = AVf_REIFY;
2382 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2383 AvFILLp(padlist) = CvDEPTH(cv);
2384 svp = AvARRAY(padlist);
2389 AV* av = (AV*)PL_curpad[0];
2391 items = AvFILLp(av) + 1;
2393 /* Mark is at the end of the stack. */
2395 Copy(AvARRAY(av), SP + 1, items, SV*);
2400 #endif /* USE_THREADS */
2401 SAVESPTR(PL_curpad);
2402 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2405 #endif /* USE_THREADS */
2411 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2412 "%p entersub preparing @_\n", thr));
2414 av = (AV*)PL_curpad[0];
2420 cx->blk_sub.savearray = GvAV(PL_defgv);
2421 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2422 #endif /* USE_THREADS */
2423 cx->blk_sub.argarray = av;
2426 if (items > AvMAX(av) + 1) {
2428 if (AvARRAY(av) != ary) {
2429 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2430 SvPVX(av) = (char*)ary;
2432 if (items > AvMAX(av) + 1) {
2433 AvMAX(av) = items - 1;
2434 Renew(ary,items,SV*);
2436 SvPVX(av) = (char*)ary;
2439 Copy(MARK,AvARRAY(av),items,SV*);
2440 AvFILLp(av) = items - 1;
2448 /* warning must come *after* we fully set up the context
2449 * stuff so that __WARN__ handlers can safely dounwind()
2452 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2453 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2454 sub_crush_depth(cv);
2456 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2457 "%p entersub returning %p\n", thr, CvSTART(cv)));
2459 RETURNOP(CvSTART(cv));
2464 sub_crush_depth(CV *cv)
2467 warner(WARN_RECURSION, "Deep recursion on anonymous subroutine");
2469 SV* tmpstr = sv_newmortal();
2470 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2471 warner(WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2482 U32 lval = PL_op->op_flags & OPf_MOD;
2483 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2487 elem -= PL_curcop->cop_arybase;
2488 if (SvTYPE(av) != SVt_PVAV)
2490 svp = av_fetch(av, elem, lval && !defer);
2492 if (!svp || *svp == &PL_sv_undef) {
2495 DIE(PL_no_aelem, elem);
2496 lv = sv_newmortal();
2497 sv_upgrade(lv, SVt_PVLV);
2499 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2500 LvTARG(lv) = SvREFCNT_inc(av);
2501 LvTARGOFF(lv) = elem;
2506 if (PL_op->op_private & OPpLVAL_INTRO)
2507 save_aelem(av, elem, svp);
2508 else if (PL_op->op_private & OPpDEREF)
2509 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2511 sv = (svp ? *svp : &PL_sv_undef);
2512 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2513 sv = sv_mortalcopy(sv);
2519 vivify_ref(SV *sv, U32 to_what)
2525 croak(PL_no_modify);
2526 if (SvTYPE(sv) < SVt_RV)
2527 sv_upgrade(sv, SVt_RV);
2528 else if (SvTYPE(sv) >= SVt_PV) {
2529 (void)SvOOK_off(sv);
2530 Safefree(SvPVX(sv));
2531 SvLEN(sv) = SvCUR(sv) = 0;
2535 SvRV(sv) = NEWSV(355,0);
2538 SvRV(sv) = (SV*)newAV();
2541 SvRV(sv) = (SV*)newHV();
2562 if (SvTYPE(sv) == SVt_PVCV) {
2568 name = SvPV(TOPs, packlen);
2569 sv = *(PL_stack_base + TOPMARK + 1);
2580 !(packname = SvPV(sv, packlen)) ||
2581 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2582 !(ob=(SV*)GvIO(iogv)))
2585 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2586 ? !isIDFIRST_utf8((U8*)packname)
2587 : !isIDFIRST(*packname)
2590 DIE("Can't call method \"%s\" %s", name,
2591 SvOK(sv)? "without a package or object reference"
2592 : "on an undefined value");
2594 stash = gv_stashpvn(packname, packlen, TRUE);
2597 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2600 if (!ob || !SvOBJECT(ob))
2601 DIE("Can't call method \"%s\" on unblessed reference", name);
2603 stash = SvSTASH(ob);
2606 gv = gv_fetchmethod(stash, name);
2612 for (p = name; *p; p++) {
2614 sep = p, leaf = p + 1;
2615 else if (*p == ':' && *(p + 1) == ':')
2616 sep = p, leaf = p + 2;
2618 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2619 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2620 packlen = strlen(packname);
2624 packlen = sep - name;
2626 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2627 leaf, (int)packlen, packname);
2629 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);