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;
326 if (PL_op->op_flags & OPf_STACKED)
330 if (mg = SvTIED_mg((SV*)gv, 'q')) {
331 if (MARK == ORIGMARK) {
332 /* If using default handle then we need to make space to
333 * pass object as 1st arg, so move other args up ...
337 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
341 *MARK = SvTIED_obj((SV*)gv, mg);
344 perl_call_method("PRINT", G_SCALAR);
352 if (!(io = GvIO(gv))) {
353 if (ckWARN(WARN_UNOPENED)) {
354 SV* sv = sv_newmortal();
355 gv_fullname3(sv, gv, Nullch);
356 warner(WARN_UNOPENED, "Filehandle %s never opened", SvPV(sv,PL_na));
359 SETERRNO(EBADF,RMS$_IFI);
362 else if (!(fp = IoOFP(io))) {
363 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
364 SV* sv = sv_newmortal();
365 gv_fullname3(sv, gv, Nullch);
367 warner(WARN_IO, "Filehandle %s opened only for input",
369 else if (ckWARN(WARN_CLOSED))
370 warner(WARN_CLOSED, "print on closed filehandle %s",
373 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
380 if (!do_print(*MARK, fp))
384 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
393 if (!do_print(*MARK, fp))
402 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
405 if (IoFLAGS(io) & IOf_FLUSH)
406 if (PerlIO_flush(fp) == EOF)
427 tryAMAGICunDEREF(to_av);
430 if (SvTYPE(av) != SVt_PVAV)
431 DIE("Not an ARRAY reference");
432 if (PL_op->op_flags & OPf_REF) {
438 if (SvTYPE(sv) == SVt_PVAV) {
440 if (PL_op->op_flags & OPf_REF) {
448 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(PL_no_usym, "an ARRAY");
460 if (ckWARN(WARN_UNINITIALIZED))
461 warner(WARN_UNINITIALIZED, PL_warn_uninit);
462 if (GIMME == G_ARRAY) {
468 sym = SvPV(sv,PL_na);
469 if (PL_op->op_private & HINT_STRICT_REFS)
470 DIE(PL_no_symref, sym, "an ARRAY");
471 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
476 if (PL_op->op_private & OPpLVAL_INTRO)
478 if (PL_op->op_flags & OPf_REF) {
485 if (GIMME == G_ARRAY) {
486 I32 maxarg = AvFILL(av) + 1;
487 POPs; /* XXXX May be optimized away? */
489 if (SvRMAGICAL(av)) {
491 for (i=0; i < maxarg; i++) {
492 SV **svp = av_fetch(av, i, FALSE);
493 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
497 Copy(AvARRAY(av), SP+1, maxarg, SV*);
503 I32 maxarg = AvFILL(av) + 1;
516 tryAMAGICunDEREF(to_hv);
519 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
520 DIE("Not a HASH reference");
521 if (PL_op->op_flags & OPf_REF) {
527 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
529 if (PL_op->op_flags & OPf_REF) {
537 if (SvTYPE(sv) != SVt_PVGV) {
540 if (SvGMAGICAL(sv)) {
546 if (PL_op->op_flags & OPf_REF ||
547 PL_op->op_private & HINT_STRICT_REFS)
548 DIE(PL_no_usym, "a HASH");
549 if (ckWARN(WARN_UNINITIALIZED))
550 warner(WARN_UNINITIALIZED, PL_warn_uninit);
551 if (GIMME == G_ARRAY) {
557 sym = SvPV(sv,PL_na);
558 if (PL_op->op_private & HINT_STRICT_REFS)
559 DIE(PL_no_symref, sym, "a HASH");
560 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
565 if (PL_op->op_private & OPpLVAL_INTRO)
567 if (PL_op->op_flags & OPf_REF) {
574 if (GIMME == G_ARRAY) { /* array wanted */
575 *PL_stack_sp = (SV*)hv;
580 if (SvTYPE(hv) == SVt_PVAV)
581 hv = avhv_keys((AV*)hv);
583 sv_setpvf(TARG, "%ld/%ld",
584 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
596 SV **lastlelem = PL_stack_sp;
597 SV **lastrelem = PL_stack_base + POPMARK;
598 SV **firstrelem = PL_stack_base + POPMARK + 1;
599 SV **firstlelem = lastrelem + 1;
612 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
614 /* If there's a common identifier on both sides we have to take
615 * special care that assigning the identifier on the left doesn't
616 * clobber a value on the right that's used later in the list.
618 if (PL_op->op_private & OPpASSIGN_COMMON) {
619 EXTEND_MORTAL(lastrelem - firstrelem + 1);
620 for (relem = firstrelem; relem <= lastrelem; relem++) {
623 TAINT_NOT; /* Each item is independent */
624 *relem = sv_mortalcopy(sv);
633 while (lelem <= lastlelem) {
634 TAINT_NOT; /* Each item stands on its own, taintwise. */
636 switch (SvTYPE(sv)) {
639 magic = SvMAGICAL(ary) != 0;
642 av_extend(ary, lastrelem - relem);
644 while (relem <= lastrelem) { /* gobble up all the rest */
650 didstore = av_store(ary,i++,sv);
664 magic = SvMAGICAL(hash) != 0;
667 while (relem < lastrelem) { /* gobble up all the rest */
672 sv = &PL_sv_no, relem++;
673 tmpstr = NEWSV(29,0);
675 sv_setsv(tmpstr,*relem); /* value */
677 didstore = hv_store_ent(hash,sv,tmpstr,0);
679 if (SvSMAGICAL(tmpstr))
682 SvREFCNT_dec(tmpstr);
686 if (relem == lastrelem) {
689 if (ckWARN(WARN_UNSAFE)) {
690 if (relem == firstrelem &&
692 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
693 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
694 warner(WARN_UNSAFE, "Reference found where even-sized list expected");
696 warner(WARN_UNSAFE, "Odd number of elements in hash assignment");
698 tmpstr = NEWSV(29,0);
699 didstore = hv_store_ent(hash,*relem,tmpstr,0);
701 if (SvSMAGICAL(tmpstr))
704 SvREFCNT_dec(tmpstr);
713 if (SvTHINKFIRST(sv)) {
714 if (SvREADONLY(sv) && PL_curcop != &PL_compiling) {
717 if (relem <= lastrelem)
724 if (relem <= lastrelem) {
725 sv_setsv(sv, *relem);
729 sv_setsv(sv, &PL_sv_undef);
734 if (PL_delaymagic & ~DM_DELAY) {
735 if (PL_delaymagic & DM_UID) {
737 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
740 (void)setreuid(PL_uid,PL_euid);
743 if ((PL_delaymagic & DM_UID) == DM_RUID) {
744 (void)setruid(PL_uid);
745 PL_delaymagic &= ~DM_RUID;
747 # endif /* HAS_SETRUID */
749 if ((PL_delaymagic & DM_UID) == DM_EUID) {
750 (void)seteuid(PL_uid);
751 PL_delaymagic &= ~DM_EUID;
753 # endif /* HAS_SETEUID */
754 if (PL_delaymagic & DM_UID) {
755 if (PL_uid != PL_euid)
756 DIE("No setreuid available");
757 (void)PerlProc_setuid(PL_uid);
759 # endif /* HAS_SETREUID */
760 #endif /* HAS_SETRESUID */
761 PL_uid = (int)PerlProc_getuid();
762 PL_euid = (int)PerlProc_geteuid();
764 if (PL_delaymagic & DM_GID) {
766 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
769 (void)setregid(PL_gid,PL_egid);
772 if ((PL_delaymagic & DM_GID) == DM_RGID) {
773 (void)setrgid(PL_gid);
774 PL_delaymagic &= ~DM_RGID;
776 # endif /* HAS_SETRGID */
778 if ((PL_delaymagic & DM_GID) == DM_EGID) {
779 (void)setegid(PL_gid);
780 PL_delaymagic &= ~DM_EGID;
782 # endif /* HAS_SETEGID */
783 if (PL_delaymagic & DM_GID) {
784 if (PL_gid != PL_egid)
785 DIE("No setregid available");
786 (void)PerlProc_setgid(PL_gid);
788 # endif /* HAS_SETREGID */
789 #endif /* HAS_SETRESGID */
790 PL_gid = (int)PerlProc_getgid();
791 PL_egid = (int)PerlProc_getegid();
793 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
800 else if (gimme == G_SCALAR) {
803 SETi(lastrelem - firstrelem + 1);
809 SP = firstrelem + (lastlelem - firstlelem);
810 lelem = firstlelem + (relem - firstrelem);
812 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
820 register PMOP *pm = cPMOP;
821 SV *rv = sv_newmortal();
822 SV *sv = newSVrv(rv, "Regexp");
823 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
830 register PMOP *pm = cPMOP;
837 register REGEXP *rx = pm->op_pmregexp;
842 I32 oldsave = PL_savestack_ix;
843 I32 update_minmatch = 1;
845 if (PL_op->op_flags & OPf_STACKED)
851 PUTBACK; /* EVAL blocks need stack_sp. */
855 DIE("panic: do_match");
856 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
857 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
860 if (pm->op_pmdynflags & PMdf_USED) {
862 if (gimme == G_ARRAY)
867 if (!rx->prelen && PL_curpm) {
869 rx = pm->op_pmregexp;
871 if (rx->minlen > len) goto failure;
874 if (global = pm->op_pmflags & PMf_GLOBAL) {
876 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
877 MAGIC* mg = mg_find(TARG, 'g');
878 if (mg && mg->mg_len >= 0) {
879 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
880 minmatch = (mg->mg_flags & MGf_MINMATCH);
885 r_flags = ((gimme != G_ARRAY && !global && rx->nparens)
886 || SvTEMP(TARG) || PL_sawampersand)
887 ? REXEC_COPY_STR : 0;
888 if (SvSCREAM(TARG) && rx->check_substr
889 && SvTYPE(rx->check_substr) == SVt_PVBM
890 && SvVALID(rx->check_substr))
891 r_flags |= REXEC_SCREAM;
893 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
894 SAVEINT(PL_multiline);
895 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
899 if (global && rx->startp[0]) {
901 if ((s + rx->minlen) > strend)
903 if (update_minmatch++)
904 minmatch = (s == rx->startp[0]);
906 if (rx->check_substr) {
907 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
908 if (r_flags & REXEC_SCREAM) {
912 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
915 b = (char*)HOP((U8*)s, rx->check_offset_min);
916 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
919 if ((rx->reganch & ROPT_CHECK_ALL)
920 && !PL_sawampersand && !SvTAIL(rx->check_substr))
923 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
924 (unsigned char*)strend,
925 rx->check_substr, 0)))
927 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
929 if (s && rx->check_offset_max < s - t) {
930 ++BmUSEFUL(rx->check_substr);
931 s = (char*)HOP((U8*)s, -rx->check_offset_max);
936 /* Now checkstring is fixed, i.e. at fixed offset from the
937 beginning of match, and the match is anchored at s. */
938 else if (!PL_multiline) { /* Anchored near beginning of string. */
940 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
941 if (*SvPVX(rx->check_substr) != *b
942 || ((slen = SvCUR(rx->check_substr)) > 1
943 && memNE(SvPVX(rx->check_substr), b, slen)))
946 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
947 && rx->check_substr == rx->float_substr) {
948 SvREFCNT_dec(rx->check_substr);
949 rx->check_substr = Nullsv; /* opt is being useless */
950 rx->float_substr = Nullsv;
953 if (CALLREGEXEC(rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
956 if (pm->op_pmflags & PMf_ONCE)
957 pm->op_pmdynflags |= PMdf_USED;
966 RX_MATCH_TAINTED_on(rx);
967 TAINT_IF(RX_MATCH_TAINTED(rx));
968 if (gimme == G_ARRAY) {
972 if (global && !iters)
976 SPAGAIN; /* EVAL blocks could move the stack. */
977 EXTEND(SP, iters + i);
978 EXTEND_MORTAL(iters + i);
979 for (i = !i; i <= iters; i++) {
980 PUSHs(sv_newmortal());
982 if ((s = rx->startp[i]) && rx->endp[i] ) {
983 len = rx->endp[i] - s;
984 sv_setpvn(*SP, s, len);
988 truebase = rx->subbeg;
990 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
992 PUTBACK; /* EVAL blocks may use stack */
997 LEAVE_SCOPE(oldsave);
1003 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1004 mg = mg_find(TARG, 'g');
1006 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1007 mg = mg_find(TARG, 'g');
1009 if (rx->startp[0]) {
1010 mg->mg_len = rx->endp[0] - rx->subbeg;
1011 if (rx->startp[0] == rx->endp[0])
1012 mg->mg_flags |= MGf_MINMATCH;
1014 mg->mg_flags &= ~MGf_MINMATCH;
1017 LEAVE_SCOPE(oldsave);
1021 yup: /* Confirmed by check_substr */
1023 RX_MATCH_TAINTED_on(rx);
1024 TAINT_IF(RX_MATCH_TAINTED(rx));
1025 ++BmUSEFUL(rx->check_substr);
1027 if (pm->op_pmflags & PMf_ONCE)
1028 pm->op_pmdynflags |= PMdf_USED;
1029 Safefree(rx->subbase);
1030 rx->subbase = Nullch;
1032 rx->subbeg = truebase;
1033 rx->subend = strend;
1035 rx->endp[0] = s + SvCUR(rx->check_substr);
1038 if (PL_sawampersand) {
1041 tmps = rx->subbase = savepvn(t, strend-t);
1043 rx->subend = tmps + (strend-t);
1044 tmps = rx->startp[0] = tmps + (s - t);
1045 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1047 LEAVE_SCOPE(oldsave);
1051 if (rx->check_substr)
1052 ++BmUSEFUL(rx->check_substr);
1055 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1056 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1057 MAGIC* mg = mg_find(TARG, 'g');
1062 LEAVE_SCOPE(oldsave);
1063 if (gimme == G_ARRAY)
1071 dSP; dTARGETSTACKED;
1076 register IO *io = GvIO(PL_last_in_gv);
1077 register I32 type = PL_op->op_type;
1078 I32 gimme = GIMME_V;
1081 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1083 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1086 perl_call_method("READLINE", gimme);
1089 if (gimme == G_SCALAR)
1090 SvSetMagicSV_nosteal(TARG, TOPs);
1097 if (IoFLAGS(io) & IOf_ARGV) {
1098 if (IoFLAGS(io) & IOf_START) {
1099 IoFLAGS(io) &= ~IOf_START;
1101 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1102 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1103 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1104 SvSETMAGIC(GvSV(PL_last_in_gv));
1109 fp = nextargv(PL_last_in_gv);
1110 if (!fp) { /* Note: fp != IoIFP(io) */
1111 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1112 IoFLAGS(io) |= IOf_START;
1115 else if (type == OP_GLOB) {
1116 SV *tmpcmd = NEWSV(55, 0);
1120 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1121 /* since spawning off a process is a real performance hit */
1123 #include <descrip.h>
1124 #include <lib$routines.h>
1127 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1128 char vmsspec[NAM$C_MAXRSS+1];
1129 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1130 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1131 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1134 struct dsc$descriptor_s wilddsc
1135 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1136 struct dsc$descriptor_vs rsdsc
1137 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1138 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1140 /* We could find out if there's an explicit dev/dir or version
1141 by peeking into lib$find_file's internal context at
1142 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1143 but that's unsupported, so I don't want to do it now and
1144 have it bite someone in the future. */
1145 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1146 cp = SvPV(tmpglob,i);
1148 if (cp[i] == ';') hasver = 1;
1150 if (sts) hasver = 1;
1154 hasdir = isunix = 1;
1157 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1162 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1164 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1165 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1166 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1167 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1168 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1169 &dfltdsc,NULL,NULL,NULL))&1)) {
1170 end = rstr + (unsigned long int) *rslt;
1171 if (!hasver) while (*end != ';') end--;
1172 *(end++) = '\n'; *end = '\0';
1173 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1175 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1180 while (*(--begin) != ']' && *begin != '>') ;
1183 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1185 if (cxt) (void)lib$find_file_end(&cxt);
1186 if (ok && sts != RMS$_NMF &&
1187 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1190 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1192 PerlIO_close(tmpfp);
1196 PerlIO_rewind(tmpfp);
1198 IoIFP(io) = fp = tmpfp;
1199 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1206 sv_setpv(tmpcmd, "for a in ");
1207 sv_catsv(tmpcmd, tmpglob);
1208 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1211 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1212 sv_catsv(tmpcmd, tmpglob);
1214 sv_setpv(tmpcmd, "perlglob ");
1215 sv_catsv(tmpcmd, tmpglob);
1216 sv_catpv(tmpcmd, " |");
1221 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1222 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1223 sv_catsv(tmpcmd, tmpglob);
1224 sv_catpv(tmpcmd, "' 2>/dev/null |");
1226 sv_setpv(tmpcmd, "echo ");
1227 sv_catsv(tmpcmd, tmpglob);
1229 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1231 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1234 #endif /* !DOSISH */
1235 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1236 FALSE, O_RDONLY, 0, Nullfp);
1242 else if (type == OP_GLOB)
1246 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START))
1248 "Read on closed filehandle <%s>", GvENAME(PL_last_in_gv));
1249 if (gimme == G_SCALAR) {
1250 (void)SvOK_off(TARG);
1256 if (gimme == G_SCALAR) {
1260 (void)SvUPGRADE(sv, SVt_PV);
1261 tmplen = SvLEN(sv); /* remember if already alloced */
1263 Sv_Grow(sv, 80); /* try short-buffering it */
1264 if (type == OP_RCATLINE)
1270 sv = sv_2mortal(NEWSV(57, 80));
1274 if (!sv_gets(sv, fp, offset)) {
1275 PerlIO_clearerr(fp);
1276 if (IoFLAGS(io) & IOf_ARGV) {
1277 fp = nextargv(PL_last_in_gv);
1280 (void)do_close(PL_last_in_gv, FALSE);
1281 IoFLAGS(io) |= IOf_START;
1283 else if (type == OP_GLOB) {
1284 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1286 "glob failed (child exited with status %d%s)",
1287 STATUS_CURRENT >> 8,
1288 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1291 if (gimme == G_SCALAR) {
1292 (void)SvOK_off(TARG);
1297 /* This should not be marked tainted if the fp is marked clean */
1298 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1305 if (type == OP_GLOB) {
1308 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1309 tmps = SvEND(sv) - 1;
1310 if (*tmps == *SvPVX(PL_rs)) {
1315 for (tmps = SvPVX(sv); *tmps; tmps++)
1316 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1317 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1319 if (*tmps && PerlLIO_stat(SvPVX(sv), &PL_statbuf) < 0) {
1320 (void)POPs; /* Unmatched wildcard? Chuck it... */
1324 if (gimme == G_ARRAY) {
1325 if (SvLEN(sv) - SvCUR(sv) > 20) {
1326 SvLEN_set(sv, SvCUR(sv)+1);
1327 Renew(SvPVX(sv), SvLEN(sv), char);
1329 sv = sv_2mortal(NEWSV(58, 80));
1332 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1333 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1337 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1338 Renew(SvPVX(sv), SvLEN(sv), char);
1347 register PERL_CONTEXT *cx;
1348 I32 gimme = OP_GIMME(PL_op, -1);
1351 if (cxstack_ix >= 0)
1352 gimme = cxstack[cxstack_ix].blk_gimme;
1360 PUSHBLOCK(cx, CXt_BLOCK, SP);
1372 U32 lval = PL_op->op_flags & OPf_MOD;
1373 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1376 if (SvTYPE(hv) == SVt_PVHV) {
1377 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1378 svp = he ? &HeVAL(he) : 0;
1380 else if (SvTYPE(hv) == SVt_PVAV) {
1381 if (PL_op->op_private & OPpLVAL_INTRO)
1382 DIE("Can't localize pseudo-hash element");
1383 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1389 if (!svp || *svp == &PL_sv_undef) {
1393 DIE(PL_no_helem, SvPV(keysv, PL_na));
1394 lv = sv_newmortal();
1395 sv_upgrade(lv, SVt_PVLV);
1397 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1398 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1399 LvTARG(lv) = SvREFCNT_inc(hv);
1404 if (PL_op->op_private & OPpLVAL_INTRO) {
1405 if (HvNAME(hv) && isGV(*svp))
1406 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1408 save_helem(hv, keysv, svp);
1410 else if (PL_op->op_private & OPpDEREF)
1411 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1413 sv = (svp ? *svp : &PL_sv_undef);
1414 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1415 * Pushing the magical RHS on to the stack is useless, since
1416 * that magic is soon destined to be misled by the local(),
1417 * and thus the later pp_sassign() will fail to mg_get() the
1418 * old value. This should also cure problems with delayed
1419 * mg_get()s. GSAR 98-07-03 */
1420 if (!lval && SvGMAGICAL(sv))
1421 sv = sv_mortalcopy(sv);
1429 register PERL_CONTEXT *cx;
1435 if (PL_op->op_flags & OPf_SPECIAL) {
1436 cx = &cxstack[cxstack_ix];
1437 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1442 gimme = OP_GIMME(PL_op, -1);
1444 if (cxstack_ix >= 0)
1445 gimme = cxstack[cxstack_ix].blk_gimme;
1451 if (gimme == G_VOID)
1453 else if (gimme == G_SCALAR) {
1456 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1459 *MARK = sv_mortalcopy(TOPs);
1462 *MARK = &PL_sv_undef;
1466 else if (gimme == G_ARRAY) {
1467 /* in case LEAVE wipes old return values */
1468 for (mark = newsp + 1; mark <= SP; mark++) {
1469 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1470 *mark = sv_mortalcopy(*mark);
1471 TAINT_NOT; /* Each item is independent */
1475 PL_curpm = newpm; /* Don't pop $1 et al till now */
1485 register PERL_CONTEXT *cx;
1490 cx = &cxstack[cxstack_ix];
1491 if (CxTYPE(cx) != CXt_LOOP)
1492 DIE("panic: pp_iter");
1494 av = cx->blk_loop.iterary;
1495 if (SvTYPE(av) != SVt_PVAV) {
1496 /* iterate ($min .. $max) */
1497 if (cx->blk_loop.iterlval) {
1498 /* string increment */
1499 register SV* cur = cx->blk_loop.iterlval;
1501 char *max = SvPV((SV*)av, maxlen);
1502 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1503 #ifndef USE_THREADS /* don't risk potential race */
1504 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1505 && !SvMAGICAL(*cx->blk_loop.itervar))
1507 /* safe to reuse old SV */
1508 sv_setsv(*cx->blk_loop.itervar, cur);
1513 /* we need a fresh SV every time so that loop body sees a
1514 * completely new SV for closures/references to work as
1516 SvREFCNT_dec(*cx->blk_loop.itervar);
1517 *cx->blk_loop.itervar = newSVsv(cur);
1519 if (strEQ(SvPVX(cur), max))
1520 sv_setiv(cur, 0); /* terminate next time */
1527 /* integer increment */
1528 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1531 #ifndef USE_THREADS /* don't risk potential race */
1532 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1533 && !SvMAGICAL(*cx->blk_loop.itervar))
1535 /* safe to reuse old SV */
1536 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1541 /* we need a fresh SV every time so that loop body sees a
1542 * completely new SV for closures/references to work as they
1544 SvREFCNT_dec(*cx->blk_loop.itervar);
1545 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1551 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1554 SvREFCNT_dec(*cx->blk_loop.itervar);
1556 if (sv = (SvMAGICAL(av))
1557 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1558 : AvARRAY(av)[++cx->blk_loop.iterix])
1562 if (av != PL_curstack && SvIMMORTAL(sv)) {
1563 SV *lv = cx->blk_loop.iterlval;
1564 if (lv && SvREFCNT(lv) > 1) {
1569 SvREFCNT_dec(LvTARG(lv));
1571 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1572 sv_upgrade(lv, SVt_PVLV);
1574 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1576 LvTARG(lv) = SvREFCNT_inc(av);
1577 LvTARGOFF(lv) = cx->blk_loop.iterix;
1578 LvTARGLEN(lv) = (UV) -1;
1582 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1589 register PMOP *pm = cPMOP;
1605 register REGEXP *rx = pm->op_pmregexp;
1607 int force_on_match = 0;
1608 I32 oldsave = PL_savestack_ix;
1609 I32 update_minmatch = 1;
1611 /* known replacement string? */
1612 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1613 if (PL_op->op_flags & OPf_STACKED)
1619 if (SvREADONLY(TARG)
1620 || (SvTYPE(TARG) > SVt_PVLV
1621 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1622 croak(PL_no_modify);
1625 s = SvPV(TARG, len);
1626 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1628 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1629 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1636 DIE("panic: do_subst");
1639 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1640 position, once with zero-length,
1641 second time with non-zero. */
1643 if (!rx->prelen && PL_curpm) {
1645 rx = pm->op_pmregexp;
1647 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1648 ? REXEC_COPY_STR : 0;
1649 if (SvSCREAM(TARG) && rx->check_substr
1650 && SvTYPE(rx->check_substr) == SVt_PVBM
1651 && SvVALID(rx->check_substr))
1652 r_flags |= REXEC_SCREAM;
1653 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1654 SAVEINT(PL_multiline);
1655 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1658 if (rx->check_substr) {
1659 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1660 if (r_flags & REXEC_SCREAM) {
1664 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1667 b = (char*)HOP((U8*)s, rx->check_offset_min);
1668 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
1671 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
1672 (unsigned char*)strend,
1673 rx->check_substr, 0)))
1675 if (s && rx->check_offset_max < s - m) {
1676 ++BmUSEFUL(rx->check_substr);
1677 s = (char*)HOP((U8*)s, -rx->check_offset_max);
1682 /* Now checkstring is fixed, i.e. at fixed offset from the
1683 beginning of match, and the match is anchored at s. */
1684 else if (!PL_multiline) { /* Anchored at beginning of string. */
1686 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
1687 if (*SvPVX(rx->check_substr) != *b
1688 || ((slen = SvCUR(rx->check_substr)) > 1
1689 && memNE(SvPVX(rx->check_substr), b, slen)))
1692 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
1693 && rx->check_substr == rx->float_substr) {
1694 SvREFCNT_dec(rx->check_substr);
1695 rx->check_substr = Nullsv; /* opt is being useless */
1696 rx->float_substr = Nullsv;
1700 /* only replace once? */
1701 once = !(rpm->op_pmflags & PMf_GLOBAL);
1703 /* known replacement string? */
1704 c = dstr ? SvPV(dstr, clen) : Nullch;
1706 /* can do inplace substitution? */
1707 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1708 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1709 if (!CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1712 LEAVE_SCOPE(oldsave);
1715 if (force_on_match) {
1717 s = SvPV_force(TARG, len);
1722 SvSCREAM_off(TARG); /* disable possible screamer */
1724 rxtainted |= RX_MATCH_TAINTED(rx);
1726 m = orig + (rx->startp[0] - rx->subbase);
1727 d = orig + (rx->endp[0] - rx->subbase);
1733 if (m - s > strend - d) { /* faster to shorten from end */
1735 Copy(c, m, clen, char);
1740 Move(d, m, i, char);
1744 SvCUR_set(TARG, m - s);
1747 else if (i = m - s) { /* faster from front */
1755 Copy(c, m, clen, char);
1760 Copy(c, d, clen, char);
1765 TAINT_IF(rxtainted & 1);
1771 if (iters++ > maxiters)
1772 DIE("Substitution loop");
1773 rxtainted |= RX_MATCH_TAINTED(rx);
1778 Move(s, d, i, char);
1782 Copy(c, d, clen, char);
1786 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1787 Nullsv, NULL, 0)); /* don't match same null twice */
1790 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1791 Move(s, d, i+1, char); /* include the NUL */
1793 TAINT_IF(rxtainted & 1);
1795 PUSHs(sv_2mortal(newSViv((I32)iters)));
1797 (void)SvPOK_only(TARG);
1798 TAINT_IF(rxtainted);
1799 if (SvSMAGICAL(TARG)) {
1805 LEAVE_SCOPE(oldsave);
1809 if (CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1810 if (force_on_match) {
1812 s = SvPV_force(TARG, len);
1815 rxtainted |= RX_MATCH_TAINTED(rx);
1816 dstr = NEWSV(25, len);
1817 sv_setpvn(dstr, m, s-m);
1820 register PERL_CONTEXT *cx;
1823 RETURNOP(cPMOP->op_pmreplroot);
1826 if (iters++ > maxiters)
1827 DIE("Substitution loop");
1828 rxtainted |= RX_MATCH_TAINTED(rx);
1829 if (rx->subbase && rx->subbase != orig) {
1834 strend = s + (strend - m);
1837 sv_catpvn(dstr, s, m-s);
1840 sv_catpvn(dstr, c, clen);
1843 } while (CALLREGEXEC(rx, s, strend, orig, s == m, Nullsv, NULL, r_flags));
1844 sv_catpvn(dstr, s, strend - s);
1846 (void)SvOOK_off(TARG);
1847 Safefree(SvPVX(TARG));
1848 SvPVX(TARG) = SvPVX(dstr);
1849 SvCUR_set(TARG, SvCUR(dstr));
1850 SvLEN_set(TARG, SvLEN(dstr));
1854 TAINT_IF(rxtainted & 1);
1856 PUSHs(sv_2mortal(newSViv((I32)iters)));
1858 (void)SvPOK_only(TARG);
1859 TAINT_IF(rxtainted);
1862 LEAVE_SCOPE(oldsave);
1868 ++BmUSEFUL(rx->check_substr);
1873 LEAVE_SCOPE(oldsave);
1882 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1883 ++*PL_markstack_ptr;
1884 LEAVE; /* exit inner scope */
1887 if (PL_stack_base + *PL_markstack_ptr > SP) {
1889 I32 gimme = GIMME_V;
1891 LEAVE; /* exit outer scope */
1892 (void)POPMARK; /* pop src */
1893 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1894 (void)POPMARK; /* pop dst */
1895 SP = PL_stack_base + POPMARK; /* pop original mark */
1896 if (gimme == G_SCALAR) {
1900 else if (gimme == G_ARRAY)
1907 ENTER; /* enter inner scope */
1910 src = PL_stack_base[*PL_markstack_ptr];
1914 RETURNOP(cLOGOP->op_other);
1925 register PERL_CONTEXT *cx;
1926 struct block_sub cxsub;
1929 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1932 if (gimme == G_SCALAR) {
1935 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1937 *MARK = SvREFCNT_inc(TOPs);
1942 *MARK = sv_mortalcopy(TOPs);
1945 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1948 *MARK = &PL_sv_undef;
1952 else if (gimme == G_ARRAY) {
1953 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1954 if (!SvTEMP(*MARK)) {
1955 *MARK = sv_mortalcopy(*MARK);
1956 TAINT_NOT; /* Each item is independent */
1962 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1963 PL_curpm = newpm; /* ... and pop $1 et al */
1966 return pop_return();
1970 get_db_sub(SV **svp, CV *cv)
1973 SV *dbsv = GvSV(PL_DBsub);
1975 if (!PERLDB_SUB_NN) {
1979 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1980 || strEQ(GvNAME(gv), "END")
1981 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1982 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1983 && (gv = (GV*)*svp) ))) {
1984 /* Use GV from the stack as a fallback. */
1985 /* GV is potentially non-unique, or contain different CV. */
1986 sv_setsv(dbsv, newRV((SV*)cv));
1989 gv_efullname3(dbsv, gv, Nullch);
1993 SvUPGRADE(dbsv, SVt_PVIV);
1995 SAVEIV(SvIVX(dbsv));
1996 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
2000 PL_curcopdb = PL_curcop;
2001 cv = GvCV(PL_DBsub);
2011 register PERL_CONTEXT *cx;
2013 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2016 DIE("Not a CODE reference");
2017 switch (SvTYPE(sv)) {
2022 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2024 SP = PL_stack_base + POPMARK;
2027 if (SvGMAGICAL(sv)) {
2029 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2032 sym = SvPV(sv, PL_na);
2034 DIE(PL_no_usym, "a subroutine");
2035 if (PL_op->op_private & HINT_STRICT_REFS)
2036 DIE(PL_no_symref, sym, "a subroutine");
2037 cv = perl_get_cv(sym, TRUE);
2041 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2042 tryAMAGICunDEREF(to_cv);
2045 if (SvTYPE(cv) == SVt_PVCV)
2050 DIE("Not a CODE reference");
2055 if (!(cv = GvCVu((GV*)sv)))
2056 cv = sv_2cv(sv, &stash, &gv, TRUE);
2065 DIE("Not a CODE reference");
2067 if (!CvROOT(cv) && !CvXSUB(cv)) {
2071 /* anonymous or undef'd function leaves us no recourse */
2072 if (CvANON(cv) || !(gv = CvGV(cv)))
2073 DIE("Undefined subroutine called");
2074 /* autoloaded stub? */
2075 if (cv != GvCV(gv)) {
2079 /* should call AUTOLOAD now? */
2080 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2087 sub_name = sv_newmortal();
2088 gv_efullname3(sub_name, gv, Nullch);
2089 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2093 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2094 cv = get_db_sub(&sv, cv);
2096 DIE("No DBsub routine");
2100 * First we need to check if the sub or method requires locking.
2101 * If so, we gain a lock on the CV, the first argument or the
2102 * stash (for static methods), as appropriate. This has to be
2103 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2104 * reschedule by returning a new op.
2106 MUTEX_LOCK(CvMUTEXP(cv));
2107 if (CvFLAGS(cv) & CVf_LOCKED) {
2109 if (CvFLAGS(cv) & CVf_METHOD) {
2110 if (SP > PL_stack_base + TOPMARK)
2111 sv = *(PL_stack_base + TOPMARK + 1);
2113 MUTEX_UNLOCK(CvMUTEXP(cv));
2114 croak("no argument for locked method call");
2120 char *stashname = SvPV(sv, len);
2121 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2127 MUTEX_UNLOCK(CvMUTEXP(cv));
2128 mg = condpair_magic(sv);
2129 MUTEX_LOCK(MgMUTEXP(mg));
2130 if (MgOWNER(mg) == thr)
2131 MUTEX_UNLOCK(MgMUTEXP(mg));
2134 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2136 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2138 MUTEX_UNLOCK(MgMUTEXP(mg));
2139 save_destructor(unlock_condpair, sv);
2141 MUTEX_LOCK(CvMUTEXP(cv));
2144 * Now we have permission to enter the sub, we must distinguish
2145 * four cases. (0) It's an XSUB (in which case we don't care
2146 * about ownership); (1) it's ours already (and we're recursing);
2147 * (2) it's free (but we may already be using a cached clone);
2148 * (3) another thread owns it. Case (1) is easy: we just use it.
2149 * Case (2) means we look for a clone--if we have one, use it
2150 * otherwise grab ownership of cv. Case (3) means we look for a
2151 * clone (for non-XSUBs) and have to create one if we don't
2153 * Why look for a clone in case (2) when we could just grab
2154 * ownership of cv straight away? Well, we could be recursing,
2155 * i.e. we originally tried to enter cv while another thread
2156 * owned it (hence we used a clone) but it has been freed up
2157 * and we're now recursing into it. It may or may not be "better"
2158 * to use the clone but at least CvDEPTH can be trusted.
2160 if (CvOWNER(cv) == thr || CvXSUB(cv))
2161 MUTEX_UNLOCK(CvMUTEXP(cv));
2163 /* Case (2) or (3) */
2167 * XXX Might it be better to release CvMUTEXP(cv) while we
2168 * do the hv_fetch? We might find someone has pinched it
2169 * when we look again, in which case we would be in case
2170 * (3) instead of (2) so we'd have to clone. Would the fact
2171 * that we released the mutex more quickly make up for this?
2173 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2175 /* We already have a clone to use */
2176 MUTEX_UNLOCK(CvMUTEXP(cv));
2178 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2179 "entersub: %p already has clone %p:%s\n",
2180 thr, cv, SvPEEK((SV*)cv)));
2183 if (CvDEPTH(cv) == 0)
2184 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2187 /* (2) => grab ownership of cv. (3) => make clone */
2191 MUTEX_UNLOCK(CvMUTEXP(cv));
2192 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2193 "entersub: %p grabbing %p:%s in stash %s\n",
2194 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2195 HvNAME(CvSTASH(cv)) : "(none)"));
2197 /* Make a new clone. */
2199 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2200 MUTEX_UNLOCK(CvMUTEXP(cv));
2201 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2202 "entersub: %p cloning %p:%s\n",
2203 thr, cv, SvPEEK((SV*)cv))));
2205 * We're creating a new clone so there's no race
2206 * between the original MUTEX_UNLOCK and the
2207 * SvREFCNT_inc since no one will be trying to undef
2208 * it out from underneath us. At least, I don't think
2211 clonecv = cv_clone(cv);
2212 SvREFCNT_dec(cv); /* finished with this */
2213 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2214 CvOWNER(clonecv) = thr;
2218 DEBUG_S(if (CvDEPTH(cv) != 0)
2219 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2221 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2224 #endif /* USE_THREADS */
2227 if (CvOLDSTYLE(cv)) {
2228 I32 (*fp3)_((int,int,int));
2230 register I32 items = SP - MARK;
2231 /* We dont worry to copy from @_. */
2236 PL_stack_sp = mark + 1;
2237 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2238 items = (*fp3)(CvXSUBANY(cv).any_i32,
2239 MARK - PL_stack_base + 1,
2241 PL_stack_sp = PL_stack_base + items;
2244 I32 markix = TOPMARK;
2249 /* Need to copy @_ to stack. Alternative may be to
2250 * switch stack to @_, and copy return values
2251 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2255 av = (AV*)PL_curpad[0];
2257 av = GvAV(PL_defgv);
2258 #endif /* USE_THREADS */
2259 items = AvFILLp(av) + 1; /* @_ is not tieable */
2262 /* Mark is at the end of the stack. */
2264 Copy(AvARRAY(av), SP + 1, items, SV*);
2269 if (PL_curcopdb) { /* We assume that the first
2270 XSUB in &DB::sub is the
2272 SAVESPTR(PL_curcop);
2273 PL_curcop = PL_curcopdb;
2276 /* Do we need to open block here? XXXX */
2277 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2279 /* Enforce some sanity in scalar context. */
2280 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2281 if (markix > PL_stack_sp - PL_stack_base)
2282 *(PL_stack_base + markix) = &PL_sv_undef;
2284 *(PL_stack_base + markix) = *PL_stack_sp;
2285 PL_stack_sp = PL_stack_base + markix;
2293 register I32 items = SP - MARK;
2294 AV* padlist = CvPADLIST(cv);
2295 SV** svp = AvARRAY(padlist);
2296 push_return(PL_op->op_next);
2297 PUSHBLOCK(cx, CXt_SUB, MARK);
2300 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2301 * that eval'' ops within this sub know the correct lexical space.
2302 * Owing the speed considerations, we choose to search for the cv
2303 * in doeval() instead.
2305 if (CvDEPTH(cv) < 2)
2306 (void)SvREFCNT_inc(cv);
2307 else { /* save temporaries on recursion? */
2308 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2310 AV *newpad = newAV();
2311 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2312 I32 ix = AvFILLp((AV*)svp[1]);
2313 svp = AvARRAY(svp[0]);
2314 for ( ;ix > 0; ix--) {
2315 if (svp[ix] != &PL_sv_undef) {
2316 char *name = SvPVX(svp[ix]);
2317 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2318 || *name == '&') /* anonymous code? */
2320 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2322 else { /* our own lexical */
2324 av_store(newpad, ix, sv = (SV*)newAV());
2325 else if (*name == '%')
2326 av_store(newpad, ix, sv = (SV*)newHV());
2328 av_store(newpad, ix, sv = NEWSV(0,0));
2333 av_store(newpad, ix, sv = NEWSV(0,0));
2337 av = newAV(); /* will be @_ */
2339 av_store(newpad, 0, (SV*)av);
2340 AvFLAGS(av) = AVf_REIFY;
2341 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2342 AvFILLp(padlist) = CvDEPTH(cv);
2343 svp = AvARRAY(padlist);
2348 AV* av = (AV*)PL_curpad[0];
2350 items = AvFILLp(av) + 1;
2352 /* Mark is at the end of the stack. */
2354 Copy(AvARRAY(av), SP + 1, items, SV*);
2359 #endif /* USE_THREADS */
2360 SAVESPTR(PL_curpad);
2361 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2364 #endif /* USE_THREADS */
2370 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2371 "%p entersub preparing @_\n", thr));
2373 av = (AV*)PL_curpad[0];
2379 cx->blk_sub.savearray = GvAV(PL_defgv);
2380 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2381 #endif /* USE_THREADS */
2382 cx->blk_sub.argarray = av;
2385 if (items > AvMAX(av) + 1) {
2387 if (AvARRAY(av) != ary) {
2388 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2389 SvPVX(av) = (char*)ary;
2391 if (items > AvMAX(av) + 1) {
2392 AvMAX(av) = items - 1;
2393 Renew(ary,items,SV*);
2395 SvPVX(av) = (char*)ary;
2398 Copy(MARK,AvARRAY(av),items,SV*);
2399 AvFILLp(av) = items - 1;
2407 /* warning must come *after* we fully set up the context
2408 * stuff so that __WARN__ handlers can safely dounwind()
2411 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2412 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2413 sub_crush_depth(cv);
2415 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2416 "%p entersub returning %p\n", thr, CvSTART(cv)));
2418 RETURNOP(CvSTART(cv));
2423 sub_crush_depth(CV *cv)
2426 warner(WARN_RECURSION, "Deep recursion on anonymous subroutine");
2428 SV* tmpstr = sv_newmortal();
2429 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2430 warner(WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2441 U32 lval = PL_op->op_flags & OPf_MOD;
2442 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2446 elem -= PL_curcop->cop_arybase;
2447 if (SvTYPE(av) != SVt_PVAV)
2449 svp = av_fetch(av, elem, lval && !defer);
2451 if (!svp || *svp == &PL_sv_undef) {
2454 DIE(PL_no_aelem, elem);
2455 lv = sv_newmortal();
2456 sv_upgrade(lv, SVt_PVLV);
2458 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2459 LvTARG(lv) = SvREFCNT_inc(av);
2460 LvTARGOFF(lv) = elem;
2465 if (PL_op->op_private & OPpLVAL_INTRO)
2466 save_aelem(av, elem, svp);
2467 else if (PL_op->op_private & OPpDEREF)
2468 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2470 sv = (svp ? *svp : &PL_sv_undef);
2471 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2472 sv = sv_mortalcopy(sv);
2478 vivify_ref(SV *sv, U32 to_what)
2484 croak(PL_no_modify);
2485 if (SvTYPE(sv) < SVt_RV)
2486 sv_upgrade(sv, SVt_RV);
2487 else if (SvTYPE(sv) >= SVt_PV) {
2488 (void)SvOOK_off(sv);
2489 Safefree(SvPVX(sv));
2490 SvLEN(sv) = SvCUR(sv) = 0;
2494 SvRV(sv) = NEWSV(355,0);
2497 SvRV(sv) = (SV*)newAV();
2500 SvRV(sv) = (SV*)newHV();
2521 if (SvTYPE(sv) == SVt_PVCV) {
2527 name = SvPV(TOPs, PL_na);
2528 sv = *(PL_stack_base + TOPMARK + 1);
2539 !(packname = SvPV(sv, packlen)) ||
2540 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2541 !(ob=(SV*)GvIO(iogv)))
2544 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2545 ? !isIDFIRST_utf8((U8*)packname)
2546 : !isIDFIRST(*packname)
2549 DIE("Can't call method \"%s\" %s", name,
2550 SvOK(sv)? "without a package or object reference"
2551 : "on an undefined value");
2553 stash = gv_stashpvn(packname, packlen, TRUE);
2556 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2559 if (!ob || !SvOBJECT(ob))
2560 DIE("Can't call method \"%s\" on unblessed reference", name);
2562 stash = SvSTASH(ob);
2565 gv = gv_fetchmethod(stash, name);
2571 for (p = name; *p; p++) {
2573 sep = p, leaf = p + 1;
2574 else if (*p == ':' && *(p + 1) == ':')
2575 sep = p, leaf = p + 2;
2577 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2578 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2579 packlen = strlen(packname);
2583 packlen = sep - name;
2585 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2586 leaf, (int)packlen, packname);
2588 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);