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_private & HINT_STRICT_REFS)
472 DIE(PL_no_symref, sym, "an ARRAY");
473 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
478 if (PL_op->op_private & OPpLVAL_INTRO)
480 if (PL_op->op_flags & OPf_REF) {
487 if (GIMME == G_ARRAY) {
488 I32 maxarg = AvFILL(av) + 1;
489 (void)POPs; /* XXXX May be optimized away? */
491 if (SvRMAGICAL(av)) {
493 for (i=0; i < maxarg; i++) {
494 SV **svp = av_fetch(av, i, FALSE);
495 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
499 Copy(AvARRAY(av), SP+1, maxarg, SV*);
505 I32 maxarg = AvFILL(av) + 1;
518 tryAMAGICunDEREF(to_hv);
521 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
522 DIE("Not a HASH reference");
523 if (PL_op->op_flags & OPf_REF) {
529 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
531 if (PL_op->op_flags & OPf_REF) {
539 if (SvTYPE(sv) != SVt_PVGV) {
543 if (SvGMAGICAL(sv)) {
549 if (PL_op->op_flags & OPf_REF ||
550 PL_op->op_private & HINT_STRICT_REFS)
551 DIE(PL_no_usym, "a HASH");
552 if (ckWARN(WARN_UNINITIALIZED))
553 warner(WARN_UNINITIALIZED, PL_warn_uninit);
554 if (GIMME == G_ARRAY) {
561 if (PL_op->op_private & HINT_STRICT_REFS)
562 DIE(PL_no_symref, sym, "a HASH");
563 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
568 if (PL_op->op_private & OPpLVAL_INTRO)
570 if (PL_op->op_flags & OPf_REF) {
577 if (GIMME == G_ARRAY) { /* array wanted */
578 *PL_stack_sp = (SV*)hv;
583 if (SvTYPE(hv) == SVt_PVAV)
584 hv = avhv_keys((AV*)hv);
586 sv_setpvf(TARG, "%ld/%ld",
587 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
599 SV **lastlelem = PL_stack_sp;
600 SV **lastrelem = PL_stack_base + POPMARK;
601 SV **firstrelem = PL_stack_base + POPMARK + 1;
602 SV **firstlelem = lastrelem + 1;
615 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
617 /* If there's a common identifier on both sides we have to take
618 * special care that assigning the identifier on the left doesn't
619 * clobber a value on the right that's used later in the list.
621 if (PL_op->op_private & OPpASSIGN_COMMON) {
622 EXTEND_MORTAL(lastrelem - firstrelem + 1);
623 for (relem = firstrelem; relem <= lastrelem; relem++) {
626 TAINT_NOT; /* Each item is independent */
627 *relem = sv_mortalcopy(sv);
636 while (lelem <= lastlelem) {
637 TAINT_NOT; /* Each item stands on its own, taintwise. */
639 switch (SvTYPE(sv)) {
642 magic = SvMAGICAL(ary) != 0;
645 av_extend(ary, lastrelem - relem);
647 while (relem <= lastrelem) { /* gobble up all the rest */
653 didstore = av_store(ary,i++,sv);
667 magic = SvMAGICAL(hash) != 0;
670 while (relem < lastrelem) { /* gobble up all the rest */
675 sv = &PL_sv_no, relem++;
676 tmpstr = NEWSV(29,0);
678 sv_setsv(tmpstr,*relem); /* value */
680 didstore = hv_store_ent(hash,sv,tmpstr,0);
682 if (SvSMAGICAL(tmpstr))
685 SvREFCNT_dec(tmpstr);
689 if (relem == lastrelem) {
692 if (ckWARN(WARN_UNSAFE)) {
693 if (relem == firstrelem &&
695 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
696 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
697 warner(WARN_UNSAFE, "Reference found where even-sized list expected");
699 warner(WARN_UNSAFE, "Odd number of elements in hash assignment");
701 tmpstr = NEWSV(29,0);
702 didstore = hv_store_ent(hash,*relem,tmpstr,0);
704 if (SvSMAGICAL(tmpstr))
707 SvREFCNT_dec(tmpstr);
716 if (SvTHINKFIRST(sv)) {
717 if (SvREADONLY(sv) && PL_curcop != &PL_compiling) {
720 if (relem <= lastrelem)
727 if (relem <= lastrelem) {
728 sv_setsv(sv, *relem);
732 sv_setsv(sv, &PL_sv_undef);
737 if (PL_delaymagic & ~DM_DELAY) {
738 if (PL_delaymagic & DM_UID) {
740 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
743 (void)setreuid(PL_uid,PL_euid);
746 if ((PL_delaymagic & DM_UID) == DM_RUID) {
747 (void)setruid(PL_uid);
748 PL_delaymagic &= ~DM_RUID;
750 # endif /* HAS_SETRUID */
752 if ((PL_delaymagic & DM_UID) == DM_EUID) {
753 (void)seteuid(PL_uid);
754 PL_delaymagic &= ~DM_EUID;
756 # endif /* HAS_SETEUID */
757 if (PL_delaymagic & DM_UID) {
758 if (PL_uid != PL_euid)
759 DIE("No setreuid available");
760 (void)PerlProc_setuid(PL_uid);
762 # endif /* HAS_SETREUID */
763 #endif /* HAS_SETRESUID */
764 PL_uid = (int)PerlProc_getuid();
765 PL_euid = (int)PerlProc_geteuid();
767 if (PL_delaymagic & DM_GID) {
769 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
772 (void)setregid(PL_gid,PL_egid);
775 if ((PL_delaymagic & DM_GID) == DM_RGID) {
776 (void)setrgid(PL_gid);
777 PL_delaymagic &= ~DM_RGID;
779 # endif /* HAS_SETRGID */
781 if ((PL_delaymagic & DM_GID) == DM_EGID) {
782 (void)setegid(PL_gid);
783 PL_delaymagic &= ~DM_EGID;
785 # endif /* HAS_SETEGID */
786 if (PL_delaymagic & DM_GID) {
787 if (PL_gid != PL_egid)
788 DIE("No setregid available");
789 (void)PerlProc_setgid(PL_gid);
791 # endif /* HAS_SETREGID */
792 #endif /* HAS_SETRESGID */
793 PL_gid = (int)PerlProc_getgid();
794 PL_egid = (int)PerlProc_getegid();
796 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
803 else if (gimme == G_SCALAR) {
806 SETi(lastrelem - firstrelem + 1);
812 SP = firstrelem + (lastlelem - firstlelem);
813 lelem = firstlelem + (relem - firstrelem);
815 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
823 register PMOP *pm = cPMOP;
824 SV *rv = sv_newmortal();
825 SV *sv = newSVrv(rv, "Regexp");
826 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
833 register PMOP *pm = cPMOP;
840 register REGEXP *rx = pm->op_pmregexp;
845 I32 oldsave = PL_savestack_ix;
846 I32 update_minmatch = 1;
848 if (PL_op->op_flags & OPf_STACKED)
854 PUTBACK; /* EVAL blocks need stack_sp. */
858 DIE("panic: do_match");
859 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
860 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
863 if (pm->op_pmdynflags & PMdf_USED) {
865 if (gimme == G_ARRAY)
870 if (!rx->prelen && PL_curpm) {
872 rx = pm->op_pmregexp;
874 if (rx->minlen > len) goto failure;
878 /* XXXX What part of this is needed with true \G-support? */
879 if (global = pm->op_pmflags & PMf_GLOBAL) {
881 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
882 MAGIC* mg = mg_find(TARG, 'g');
883 if (mg && mg->mg_len >= 0) {
884 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
885 minmatch = (mg->mg_flags & MGf_MINMATCH);
890 r_flags = ((gimme != G_ARRAY && !global && rx->nparens)
891 || SvTEMP(TARG) || PL_sawampersand)
892 ? REXEC_COPY_STR : 0;
893 if (SvSCREAM(TARG) && rx->check_substr
894 && SvTYPE(rx->check_substr) == SVt_PVBM
895 && SvVALID(rx->check_substr))
896 r_flags |= REXEC_SCREAM;
898 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
899 SAVEINT(PL_multiline);
900 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
904 if (global && rx->startp[0]) {
906 if ((s + rx->minlen) > strend)
908 if (update_minmatch++)
909 minmatch = (s == rx->startp[0]);
911 if (rx->check_substr) {
912 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
913 if (r_flags & REXEC_SCREAM) {
917 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
920 b = (char*)HOP((U8*)s, rx->check_offset_min);
921 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
924 if ((rx->reganch & ROPT_CHECK_ALL)
925 && !PL_sawampersand && !SvTAIL(rx->check_substr))
928 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
929 (unsigned char*)strend,
930 rx->check_substr, 0)))
932 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
934 if (s && rx->check_offset_max < s - t) {
935 ++BmUSEFUL(rx->check_substr);
936 s = (char*)HOP((U8*)s, -rx->check_offset_max);
941 /* Now checkstring is fixed, i.e. at fixed offset from the
942 beginning of match, and the match is anchored at s. */
943 else if (!PL_multiline) { /* Anchored near beginning of string. */
945 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
946 if (*SvPVX(rx->check_substr) != *b
947 || ((slen = SvCUR(rx->check_substr)) > 1
948 && memNE(SvPVX(rx->check_substr), b, slen)))
951 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
952 && rx->check_substr == rx->float_substr) {
953 SvREFCNT_dec(rx->check_substr);
954 rx->check_substr = Nullsv; /* opt is being useless */
955 rx->float_substr = Nullsv;
958 if (CALLREGEXEC(rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
961 if (pm->op_pmflags & PMf_ONCE)
962 pm->op_pmdynflags |= PMdf_USED;
971 RX_MATCH_TAINTED_on(rx);
972 TAINT_IF(RX_MATCH_TAINTED(rx));
973 if (gimme == G_ARRAY) {
977 if (global && !iters)
981 SPAGAIN; /* EVAL blocks could move the stack. */
982 EXTEND(SP, iters + i);
983 EXTEND_MORTAL(iters + i);
984 for (i = !i; i <= iters; i++) {
985 PUSHs(sv_newmortal());
987 if ((s = rx->startp[i]) && rx->endp[i] ) {
988 len = rx->endp[i] - s;
989 sv_setpvn(*SP, s, len);
993 truebase = rx->subbeg;
995 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
997 PUTBACK; /* EVAL blocks may use stack */
998 r_flags |= REXEC_IGNOREPOS;
1003 LEAVE_SCOPE(oldsave);
1009 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1010 mg = mg_find(TARG, 'g');
1012 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1013 mg = mg_find(TARG, 'g');
1015 if (rx->startp[0]) {
1016 mg->mg_len = rx->endp[0] - rx->subbeg;
1017 if (rx->startp[0] == rx->endp[0])
1018 mg->mg_flags |= MGf_MINMATCH;
1020 mg->mg_flags &= ~MGf_MINMATCH;
1023 LEAVE_SCOPE(oldsave);
1027 yup: /* Confirmed by check_substr */
1029 RX_MATCH_TAINTED_on(rx);
1030 TAINT_IF(RX_MATCH_TAINTED(rx));
1031 ++BmUSEFUL(rx->check_substr);
1033 if (pm->op_pmflags & PMf_ONCE)
1034 pm->op_pmdynflags |= PMdf_USED;
1035 Safefree(rx->subbase);
1036 rx->subbase = Nullch;
1038 rx->subbeg = truebase;
1039 rx->subend = strend;
1041 rx->endp[0] = s + SvCUR(rx->check_substr);
1044 if (PL_sawampersand) {
1047 tmps = rx->subbase = savepvn(t, strend-t);
1049 rx->subend = tmps + (strend-t);
1050 tmps = rx->startp[0] = tmps + (s - t);
1051 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1053 LEAVE_SCOPE(oldsave);
1057 if (rx->check_substr)
1058 ++BmUSEFUL(rx->check_substr);
1061 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1062 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1063 MAGIC* mg = mg_find(TARG, 'g');
1068 LEAVE_SCOPE(oldsave);
1069 if (gimme == G_ARRAY)
1077 dSP; dTARGETSTACKED;
1082 register IO *io = GvIO(PL_last_in_gv);
1083 register I32 type = PL_op->op_type;
1084 I32 gimme = GIMME_V;
1087 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1089 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1092 perl_call_method("READLINE", gimme);
1095 if (gimme == G_SCALAR)
1096 SvSetMagicSV_nosteal(TARG, TOPs);
1103 if (IoFLAGS(io) & IOf_ARGV) {
1104 if (IoFLAGS(io) & IOf_START) {
1105 IoFLAGS(io) &= ~IOf_START;
1107 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1108 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1109 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1110 SvSETMAGIC(GvSV(PL_last_in_gv));
1115 fp = nextargv(PL_last_in_gv);
1116 if (!fp) { /* Note: fp != IoIFP(io) */
1117 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1118 IoFLAGS(io) |= IOf_START;
1121 else if (type == OP_GLOB) {
1122 SV *tmpcmd = NEWSV(55, 0);
1126 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1127 /* since spawning off a process is a real performance hit */
1129 #include <descrip.h>
1130 #include <lib$routines.h>
1133 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1134 char vmsspec[NAM$C_MAXRSS+1];
1135 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1136 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1137 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1140 struct dsc$descriptor_s wilddsc
1141 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1142 struct dsc$descriptor_vs rsdsc
1143 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1144 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1146 /* We could find out if there's an explicit dev/dir or version
1147 by peeking into lib$find_file's internal context at
1148 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1149 but that's unsupported, so I don't want to do it now and
1150 have it bite someone in the future. */
1151 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1152 cp = SvPV(tmpglob,i);
1154 if (cp[i] == ';') hasver = 1;
1156 if (sts) hasver = 1;
1160 hasdir = isunix = 1;
1163 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1168 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1170 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1171 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1172 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1173 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1174 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1175 &dfltdsc,NULL,NULL,NULL))&1)) {
1176 end = rstr + (unsigned long int) *rslt;
1177 if (!hasver) while (*end != ';') end--;
1178 *(end++) = '\n'; *end = '\0';
1179 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1181 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1186 while (*(--begin) != ']' && *begin != '>') ;
1189 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1191 if (cxt) (void)lib$find_file_end(&cxt);
1192 if (ok && sts != RMS$_NMF &&
1193 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1196 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1198 PerlIO_close(tmpfp);
1202 PerlIO_rewind(tmpfp);
1204 IoIFP(io) = fp = tmpfp;
1205 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1212 sv_setpv(tmpcmd, "for a in ");
1213 sv_catsv(tmpcmd, tmpglob);
1214 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1217 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1218 sv_catsv(tmpcmd, tmpglob);
1220 sv_setpv(tmpcmd, "perlglob ");
1221 sv_catsv(tmpcmd, tmpglob);
1222 sv_catpv(tmpcmd, " |");
1227 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1228 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1229 sv_catsv(tmpcmd, tmpglob);
1230 sv_catpv(tmpcmd, "' 2>/dev/null |");
1232 sv_setpv(tmpcmd, "echo ");
1233 sv_catsv(tmpcmd, tmpglob);
1235 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1237 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1240 #endif /* !DOSISH */
1241 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1242 FALSE, O_RDONLY, 0, Nullfp);
1248 else if (type == OP_GLOB)
1252 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START))
1254 "Read on closed filehandle <%s>", GvENAME(PL_last_in_gv));
1255 if (gimme == G_SCALAR) {
1256 (void)SvOK_off(TARG);
1262 if (gimme == G_SCALAR) {
1266 (void)SvUPGRADE(sv, SVt_PV);
1267 tmplen = SvLEN(sv); /* remember if already alloced */
1269 Sv_Grow(sv, 80); /* try short-buffering it */
1270 if (type == OP_RCATLINE)
1276 sv = sv_2mortal(NEWSV(57, 80));
1280 if (!sv_gets(sv, fp, offset)) {
1281 PerlIO_clearerr(fp);
1282 if (IoFLAGS(io) & IOf_ARGV) {
1283 fp = nextargv(PL_last_in_gv);
1286 (void)do_close(PL_last_in_gv, FALSE);
1287 IoFLAGS(io) |= IOf_START;
1289 else if (type == OP_GLOB) {
1290 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1292 "glob failed (child exited with status %d%s)",
1293 STATUS_CURRENT >> 8,
1294 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1297 if (gimme == G_SCALAR) {
1298 (void)SvOK_off(TARG);
1303 /* This should not be marked tainted if the fp is marked clean */
1304 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1311 if (type == OP_GLOB) {
1314 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1315 tmps = SvEND(sv) - 1;
1316 if (*tmps == *SvPVX(PL_rs)) {
1321 for (tmps = SvPVX(sv); *tmps; tmps++)
1322 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1323 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1325 if (*tmps && PerlLIO_stat(SvPVX(sv), &PL_statbuf) < 0) {
1326 (void)POPs; /* Unmatched wildcard? Chuck it... */
1330 if (gimme == G_ARRAY) {
1331 if (SvLEN(sv) - SvCUR(sv) > 20) {
1332 SvLEN_set(sv, SvCUR(sv)+1);
1333 Renew(SvPVX(sv), SvLEN(sv), char);
1335 sv = sv_2mortal(NEWSV(58, 80));
1338 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1339 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1343 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1344 Renew(SvPVX(sv), SvLEN(sv), char);
1353 register PERL_CONTEXT *cx;
1354 I32 gimme = OP_GIMME(PL_op, -1);
1357 if (cxstack_ix >= 0)
1358 gimme = cxstack[cxstack_ix].blk_gimme;
1366 PUSHBLOCK(cx, CXt_BLOCK, SP);
1378 U32 lval = PL_op->op_flags & OPf_MOD;
1379 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1382 if (SvTYPE(hv) == SVt_PVHV) {
1383 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1384 svp = he ? &HeVAL(he) : 0;
1386 else if (SvTYPE(hv) == SVt_PVAV) {
1387 if (PL_op->op_private & OPpLVAL_INTRO)
1388 DIE("Can't localize pseudo-hash element");
1389 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1395 if (!svp || *svp == &PL_sv_undef) {
1400 DIE(PL_no_helem, SvPV(keysv, n_a));
1402 lv = sv_newmortal();
1403 sv_upgrade(lv, SVt_PVLV);
1405 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1406 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1407 LvTARG(lv) = SvREFCNT_inc(hv);
1412 if (PL_op->op_private & OPpLVAL_INTRO) {
1413 if (HvNAME(hv) && isGV(*svp))
1414 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1416 save_helem(hv, keysv, svp);
1418 else if (PL_op->op_private & OPpDEREF)
1419 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1421 sv = (svp ? *svp : &PL_sv_undef);
1422 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1423 * Pushing the magical RHS on to the stack is useless, since
1424 * that magic is soon destined to be misled by the local(),
1425 * and thus the later pp_sassign() will fail to mg_get() the
1426 * old value. This should also cure problems with delayed
1427 * mg_get()s. GSAR 98-07-03 */
1428 if (!lval && SvGMAGICAL(sv))
1429 sv = sv_mortalcopy(sv);
1437 register PERL_CONTEXT *cx;
1443 if (PL_op->op_flags & OPf_SPECIAL) {
1444 cx = &cxstack[cxstack_ix];
1445 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1450 gimme = OP_GIMME(PL_op, -1);
1452 if (cxstack_ix >= 0)
1453 gimme = cxstack[cxstack_ix].blk_gimme;
1459 if (gimme == G_VOID)
1461 else if (gimme == G_SCALAR) {
1464 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1467 *MARK = sv_mortalcopy(TOPs);
1470 *MARK = &PL_sv_undef;
1474 else if (gimme == G_ARRAY) {
1475 /* in case LEAVE wipes old return values */
1476 for (mark = newsp + 1; mark <= SP; mark++) {
1477 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1478 *mark = sv_mortalcopy(*mark);
1479 TAINT_NOT; /* Each item is independent */
1483 PL_curpm = newpm; /* Don't pop $1 et al till now */
1493 register PERL_CONTEXT *cx;
1498 cx = &cxstack[cxstack_ix];
1499 if (CxTYPE(cx) != CXt_LOOP)
1500 DIE("panic: pp_iter");
1502 av = cx->blk_loop.iterary;
1503 if (SvTYPE(av) != SVt_PVAV) {
1504 /* iterate ($min .. $max) */
1505 if (cx->blk_loop.iterlval) {
1506 /* string increment */
1507 register SV* cur = cx->blk_loop.iterlval;
1509 char *max = SvPV((SV*)av, maxlen);
1510 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1511 #ifndef USE_THREADS /* don't risk potential race */
1512 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1513 && !SvMAGICAL(*cx->blk_loop.itervar))
1515 /* safe to reuse old SV */
1516 sv_setsv(*cx->blk_loop.itervar, cur);
1521 /* we need a fresh SV every time so that loop body sees a
1522 * completely new SV for closures/references to work as
1524 SvREFCNT_dec(*cx->blk_loop.itervar);
1525 *cx->blk_loop.itervar = newSVsv(cur);
1527 if (strEQ(SvPVX(cur), max))
1528 sv_setiv(cur, 0); /* terminate next time */
1535 /* integer increment */
1536 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1539 #ifndef USE_THREADS /* don't risk potential race */
1540 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1541 && !SvMAGICAL(*cx->blk_loop.itervar))
1543 /* safe to reuse old SV */
1544 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1549 /* we need a fresh SV every time so that loop body sees a
1550 * completely new SV for closures/references to work as they
1552 SvREFCNT_dec(*cx->blk_loop.itervar);
1553 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1559 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1562 SvREFCNT_dec(*cx->blk_loop.itervar);
1564 if (sv = (SvMAGICAL(av))
1565 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1566 : AvARRAY(av)[++cx->blk_loop.iterix])
1570 if (av != PL_curstack && SvIMMORTAL(sv)) {
1571 SV *lv = cx->blk_loop.iterlval;
1572 if (lv && SvREFCNT(lv) > 1) {
1577 SvREFCNT_dec(LvTARG(lv));
1579 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1580 sv_upgrade(lv, SVt_PVLV);
1582 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1584 LvTARG(lv) = SvREFCNT_inc(av);
1585 LvTARGOFF(lv) = cx->blk_loop.iterix;
1586 LvTARGLEN(lv) = (UV) -1;
1590 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1597 register PMOP *pm = cPMOP;
1613 register REGEXP *rx = pm->op_pmregexp;
1615 int force_on_match = 0;
1616 I32 oldsave = PL_savestack_ix;
1617 I32 update_minmatch = 1;
1619 /* known replacement string? */
1620 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1621 if (PL_op->op_flags & OPf_STACKED)
1627 if (SvREADONLY(TARG)
1628 || (SvTYPE(TARG) > SVt_PVLV
1629 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1630 croak(PL_no_modify);
1633 s = SvPV(TARG, len);
1634 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1636 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1637 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1644 DIE("panic: do_subst");
1647 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1648 position, once with zero-length,
1649 second time with non-zero. */
1651 if (!rx->prelen && PL_curpm) {
1653 rx = pm->op_pmregexp;
1655 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1656 ? REXEC_COPY_STR : 0;
1657 if (SvSCREAM(TARG) && rx->check_substr
1658 && SvTYPE(rx->check_substr) == SVt_PVBM
1659 && SvVALID(rx->check_substr))
1660 r_flags |= REXEC_SCREAM;
1661 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1662 SAVEINT(PL_multiline);
1663 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1666 if (rx->check_substr) {
1667 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1668 if (r_flags & REXEC_SCREAM) {
1672 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1675 b = (char*)HOP((U8*)s, rx->check_offset_min);
1676 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
1679 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
1680 (unsigned char*)strend,
1681 rx->check_substr, 0)))
1683 if (s && rx->check_offset_max < s - m) {
1684 ++BmUSEFUL(rx->check_substr);
1685 s = (char*)HOP((U8*)s, -rx->check_offset_max);
1690 /* Now checkstring is fixed, i.e. at fixed offset from the
1691 beginning of match, and the match is anchored at s. */
1692 else if (!PL_multiline) { /* Anchored at beginning of string. */
1694 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
1695 if (*SvPVX(rx->check_substr) != *b
1696 || ((slen = SvCUR(rx->check_substr)) > 1
1697 && memNE(SvPVX(rx->check_substr), b, slen)))
1700 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
1701 && rx->check_substr == rx->float_substr) {
1702 SvREFCNT_dec(rx->check_substr);
1703 rx->check_substr = Nullsv; /* opt is being useless */
1704 rx->float_substr = Nullsv;
1708 /* only replace once? */
1709 once = !(rpm->op_pmflags & PMf_GLOBAL);
1711 /* known replacement string? */
1712 c = dstr ? SvPV(dstr, clen) : Nullch;
1714 /* can do inplace substitution? */
1715 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1716 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1717 if (!CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1720 LEAVE_SCOPE(oldsave);
1723 if (force_on_match) {
1725 s = SvPV_force(TARG, len);
1730 SvSCREAM_off(TARG); /* disable possible screamer */
1732 rxtainted |= RX_MATCH_TAINTED(rx);
1734 m = orig + (rx->startp[0] - rx->subbase);
1735 d = orig + (rx->endp[0] - rx->subbase);
1741 if (m - s > strend - d) { /* faster to shorten from end */
1743 Copy(c, m, clen, char);
1748 Move(d, m, i, char);
1752 SvCUR_set(TARG, m - s);
1755 else if (i = m - s) { /* faster from front */
1763 Copy(c, m, clen, char);
1768 Copy(c, d, clen, char);
1773 TAINT_IF(rxtainted & 1);
1779 if (iters++ > maxiters)
1780 DIE("Substitution loop");
1781 rxtainted |= RX_MATCH_TAINTED(rx);
1786 Move(s, d, i, char);
1790 Copy(c, d, clen, char);
1794 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1795 Nullsv, NULL, 0)); /* don't match same null twice */
1798 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1799 Move(s, d, i+1, char); /* include the NUL */
1801 TAINT_IF(rxtainted & 1);
1803 PUSHs(sv_2mortal(newSViv((I32)iters)));
1805 (void)SvPOK_only(TARG);
1806 TAINT_IF(rxtainted);
1807 if (SvSMAGICAL(TARG)) {
1813 LEAVE_SCOPE(oldsave);
1817 if (CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1818 if (force_on_match) {
1820 s = SvPV_force(TARG, len);
1823 rxtainted |= RX_MATCH_TAINTED(rx);
1824 dstr = NEWSV(25, len);
1825 sv_setpvn(dstr, m, s-m);
1828 register PERL_CONTEXT *cx;
1831 RETURNOP(cPMOP->op_pmreplroot);
1833 r_flags |= REXEC_IGNOREPOS;
1835 if (iters++ > maxiters)
1836 DIE("Substitution loop");
1837 rxtainted |= RX_MATCH_TAINTED(rx);
1838 if (rx->subbase && rx->subbase != orig) {
1843 strend = s + (strend - m);
1846 sv_catpvn(dstr, s, m-s);
1849 sv_catpvn(dstr, c, clen);
1852 } while (CALLREGEXEC(rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1853 sv_catpvn(dstr, s, strend - s);
1855 (void)SvOOK_off(TARG);
1856 Safefree(SvPVX(TARG));
1857 SvPVX(TARG) = SvPVX(dstr);
1858 SvCUR_set(TARG, SvCUR(dstr));
1859 SvLEN_set(TARG, SvLEN(dstr));
1863 TAINT_IF(rxtainted & 1);
1865 PUSHs(sv_2mortal(newSViv((I32)iters)));
1867 (void)SvPOK_only(TARG);
1868 TAINT_IF(rxtainted);
1871 LEAVE_SCOPE(oldsave);
1877 ++BmUSEFUL(rx->check_substr);
1882 LEAVE_SCOPE(oldsave);
1891 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1892 ++*PL_markstack_ptr;
1893 LEAVE; /* exit inner scope */
1896 if (PL_stack_base + *PL_markstack_ptr > SP) {
1898 I32 gimme = GIMME_V;
1900 LEAVE; /* exit outer scope */
1901 (void)POPMARK; /* pop src */
1902 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1903 (void)POPMARK; /* pop dst */
1904 SP = PL_stack_base + POPMARK; /* pop original mark */
1905 if (gimme == G_SCALAR) {
1909 else if (gimme == G_ARRAY)
1916 ENTER; /* enter inner scope */
1919 src = PL_stack_base[*PL_markstack_ptr];
1923 RETURNOP(cLOGOP->op_other);
1934 register PERL_CONTEXT *cx;
1935 struct block_sub cxsub;
1938 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1941 if (gimme == G_SCALAR) {
1944 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1946 *MARK = SvREFCNT_inc(TOPs);
1951 *MARK = sv_mortalcopy(TOPs);
1954 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1957 *MARK = &PL_sv_undef;
1961 else if (gimme == G_ARRAY) {
1962 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1963 if (!SvTEMP(*MARK)) {
1964 *MARK = sv_mortalcopy(*MARK);
1965 TAINT_NOT; /* Each item is independent */
1971 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1972 PL_curpm = newpm; /* ... and pop $1 et al */
1975 return pop_return();
1979 get_db_sub(SV **svp, CV *cv)
1982 SV *dbsv = GvSV(PL_DBsub);
1984 if (!PERLDB_SUB_NN) {
1988 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1989 || strEQ(GvNAME(gv), "END")
1990 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1991 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1992 && (gv = (GV*)*svp) ))) {
1993 /* Use GV from the stack as a fallback. */
1994 /* GV is potentially non-unique, or contain different CV. */
1995 sv_setsv(dbsv, newRV((SV*)cv));
1998 gv_efullname3(dbsv, gv, Nullch);
2002 SvUPGRADE(dbsv, SVt_PVIV);
2004 SAVEIV(SvIVX(dbsv));
2005 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
2009 PL_curcopdb = PL_curcop;
2010 cv = GvCV(PL_DBsub);
2020 register PERL_CONTEXT *cx;
2022 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2025 DIE("Not a CODE reference");
2026 switch (SvTYPE(sv)) {
2032 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2034 SP = PL_stack_base + POPMARK;
2037 if (SvGMAGICAL(sv)) {
2039 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2042 sym = SvPV(sv, n_a);
2044 DIE(PL_no_usym, "a subroutine");
2045 if (PL_op->op_private & HINT_STRICT_REFS)
2046 DIE(PL_no_symref, sym, "a subroutine");
2047 cv = perl_get_cv(sym, TRUE);
2051 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2052 tryAMAGICunDEREF(to_cv);
2055 if (SvTYPE(cv) == SVt_PVCV)
2060 DIE("Not a CODE reference");
2065 if (!(cv = GvCVu((GV*)sv)))
2066 cv = sv_2cv(sv, &stash, &gv, TRUE);
2075 DIE("Not a CODE reference");
2077 if (!CvROOT(cv) && !CvXSUB(cv)) {
2081 /* anonymous or undef'd function leaves us no recourse */
2082 if (CvANON(cv) || !(gv = CvGV(cv)))
2083 DIE("Undefined subroutine called");
2084 /* autoloaded stub? */
2085 if (cv != GvCV(gv)) {
2089 /* should call AUTOLOAD now? */
2090 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2097 sub_name = sv_newmortal();
2098 gv_efullname3(sub_name, gv, Nullch);
2099 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2103 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2104 cv = get_db_sub(&sv, cv);
2106 DIE("No DBsub routine");
2110 * First we need to check if the sub or method requires locking.
2111 * If so, we gain a lock on the CV, the first argument or the
2112 * stash (for static methods), as appropriate. This has to be
2113 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2114 * reschedule by returning a new op.
2116 MUTEX_LOCK(CvMUTEXP(cv));
2117 if (CvFLAGS(cv) & CVf_LOCKED) {
2119 if (CvFLAGS(cv) & CVf_METHOD) {
2120 if (SP > PL_stack_base + TOPMARK)
2121 sv = *(PL_stack_base + TOPMARK + 1);
2123 MUTEX_UNLOCK(CvMUTEXP(cv));
2124 croak("no argument for locked method call");
2130 char *stashname = SvPV(sv, len);
2131 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2137 MUTEX_UNLOCK(CvMUTEXP(cv));
2138 mg = condpair_magic(sv);
2139 MUTEX_LOCK(MgMUTEXP(mg));
2140 if (MgOWNER(mg) == thr)
2141 MUTEX_UNLOCK(MgMUTEXP(mg));
2144 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2146 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2148 MUTEX_UNLOCK(MgMUTEXP(mg));
2149 save_destructor(unlock_condpair, sv);
2151 MUTEX_LOCK(CvMUTEXP(cv));
2154 * Now we have permission to enter the sub, we must distinguish
2155 * four cases. (0) It's an XSUB (in which case we don't care
2156 * about ownership); (1) it's ours already (and we're recursing);
2157 * (2) it's free (but we may already be using a cached clone);
2158 * (3) another thread owns it. Case (1) is easy: we just use it.
2159 * Case (2) means we look for a clone--if we have one, use it
2160 * otherwise grab ownership of cv. Case (3) means we look for a
2161 * clone (for non-XSUBs) and have to create one if we don't
2163 * Why look for a clone in case (2) when we could just grab
2164 * ownership of cv straight away? Well, we could be recursing,
2165 * i.e. we originally tried to enter cv while another thread
2166 * owned it (hence we used a clone) but it has been freed up
2167 * and we're now recursing into it. It may or may not be "better"
2168 * to use the clone but at least CvDEPTH can be trusted.
2170 if (CvOWNER(cv) == thr || CvXSUB(cv))
2171 MUTEX_UNLOCK(CvMUTEXP(cv));
2173 /* Case (2) or (3) */
2177 * XXX Might it be better to release CvMUTEXP(cv) while we
2178 * do the hv_fetch? We might find someone has pinched it
2179 * when we look again, in which case we would be in case
2180 * (3) instead of (2) so we'd have to clone. Would the fact
2181 * that we released the mutex more quickly make up for this?
2183 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2185 /* We already have a clone to use */
2186 MUTEX_UNLOCK(CvMUTEXP(cv));
2188 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2189 "entersub: %p already has clone %p:%s\n",
2190 thr, cv, SvPEEK((SV*)cv)));
2193 if (CvDEPTH(cv) == 0)
2194 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2197 /* (2) => grab ownership of cv. (3) => make clone */
2201 MUTEX_UNLOCK(CvMUTEXP(cv));
2202 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2203 "entersub: %p grabbing %p:%s in stash %s\n",
2204 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2205 HvNAME(CvSTASH(cv)) : "(none)"));
2207 /* Make a new clone. */
2209 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2210 MUTEX_UNLOCK(CvMUTEXP(cv));
2211 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2212 "entersub: %p cloning %p:%s\n",
2213 thr, cv, SvPEEK((SV*)cv))));
2215 * We're creating a new clone so there's no race
2216 * between the original MUTEX_UNLOCK and the
2217 * SvREFCNT_inc since no one will be trying to undef
2218 * it out from underneath us. At least, I don't think
2221 clonecv = cv_clone(cv);
2222 SvREFCNT_dec(cv); /* finished with this */
2223 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2224 CvOWNER(clonecv) = thr;
2228 DEBUG_S(if (CvDEPTH(cv) != 0)
2229 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2231 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2234 #endif /* USE_THREADS */
2237 if (CvOLDSTYLE(cv)) {
2238 I32 (*fp3)_((int,int,int));
2240 register I32 items = SP - MARK;
2241 /* We dont worry to copy from @_. */
2246 PL_stack_sp = mark + 1;
2247 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2248 items = (*fp3)(CvXSUBANY(cv).any_i32,
2249 MARK - PL_stack_base + 1,
2251 PL_stack_sp = PL_stack_base + items;
2254 I32 markix = TOPMARK;
2259 /* Need to copy @_ to stack. Alternative may be to
2260 * switch stack to @_, and copy return values
2261 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2265 av = (AV*)PL_curpad[0];
2267 av = GvAV(PL_defgv);
2268 #endif /* USE_THREADS */
2269 items = AvFILLp(av) + 1; /* @_ is not tieable */
2272 /* Mark is at the end of the stack. */
2274 Copy(AvARRAY(av), SP + 1, items, SV*);
2279 if (PL_curcopdb) { /* We assume that the first
2280 XSUB in &DB::sub is the
2282 SAVESPTR(PL_curcop);
2283 PL_curcop = PL_curcopdb;
2286 /* Do we need to open block here? XXXX */
2287 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2289 /* Enforce some sanity in scalar context. */
2290 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2291 if (markix > PL_stack_sp - PL_stack_base)
2292 *(PL_stack_base + markix) = &PL_sv_undef;
2294 *(PL_stack_base + markix) = *PL_stack_sp;
2295 PL_stack_sp = PL_stack_base + markix;
2303 register I32 items = SP - MARK;
2304 AV* padlist = CvPADLIST(cv);
2305 SV** svp = AvARRAY(padlist);
2306 push_return(PL_op->op_next);
2307 PUSHBLOCK(cx, CXt_SUB, MARK);
2310 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2311 * that eval'' ops within this sub know the correct lexical space.
2312 * Owing the speed considerations, we choose to search for the cv
2313 * in doeval() instead.
2315 if (CvDEPTH(cv) < 2)
2316 (void)SvREFCNT_inc(cv);
2317 else { /* save temporaries on recursion? */
2318 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2320 AV *newpad = newAV();
2321 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2322 I32 ix = AvFILLp((AV*)svp[1]);
2323 svp = AvARRAY(svp[0]);
2324 for ( ;ix > 0; ix--) {
2325 if (svp[ix] != &PL_sv_undef) {
2326 char *name = SvPVX(svp[ix]);
2327 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2328 || *name == '&') /* anonymous code? */
2330 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2332 else { /* our own lexical */
2334 av_store(newpad, ix, sv = (SV*)newAV());
2335 else if (*name == '%')
2336 av_store(newpad, ix, sv = (SV*)newHV());
2338 av_store(newpad, ix, sv = NEWSV(0,0));
2343 av_store(newpad, ix, sv = NEWSV(0,0));
2347 av = newAV(); /* will be @_ */
2349 av_store(newpad, 0, (SV*)av);
2350 AvFLAGS(av) = AVf_REIFY;
2351 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2352 AvFILLp(padlist) = CvDEPTH(cv);
2353 svp = AvARRAY(padlist);
2358 AV* av = (AV*)PL_curpad[0];
2360 items = AvFILLp(av) + 1;
2362 /* Mark is at the end of the stack. */
2364 Copy(AvARRAY(av), SP + 1, items, SV*);
2369 #endif /* USE_THREADS */
2370 SAVESPTR(PL_curpad);
2371 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2374 #endif /* USE_THREADS */
2380 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2381 "%p entersub preparing @_\n", thr));
2383 av = (AV*)PL_curpad[0];
2389 cx->blk_sub.savearray = GvAV(PL_defgv);
2390 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2391 #endif /* USE_THREADS */
2392 cx->blk_sub.argarray = av;
2395 if (items > AvMAX(av) + 1) {
2397 if (AvARRAY(av) != ary) {
2398 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2399 SvPVX(av) = (char*)ary;
2401 if (items > AvMAX(av) + 1) {
2402 AvMAX(av) = items - 1;
2403 Renew(ary,items,SV*);
2405 SvPVX(av) = (char*)ary;
2408 Copy(MARK,AvARRAY(av),items,SV*);
2409 AvFILLp(av) = items - 1;
2417 /* warning must come *after* we fully set up the context
2418 * stuff so that __WARN__ handlers can safely dounwind()
2421 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2422 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2423 sub_crush_depth(cv);
2425 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2426 "%p entersub returning %p\n", thr, CvSTART(cv)));
2428 RETURNOP(CvSTART(cv));
2433 sub_crush_depth(CV *cv)
2436 warner(WARN_RECURSION, "Deep recursion on anonymous subroutine");
2438 SV* tmpstr = sv_newmortal();
2439 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2440 warner(WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2451 U32 lval = PL_op->op_flags & OPf_MOD;
2452 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2456 elem -= PL_curcop->cop_arybase;
2457 if (SvTYPE(av) != SVt_PVAV)
2459 svp = av_fetch(av, elem, lval && !defer);
2461 if (!svp || *svp == &PL_sv_undef) {
2464 DIE(PL_no_aelem, elem);
2465 lv = sv_newmortal();
2466 sv_upgrade(lv, SVt_PVLV);
2468 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2469 LvTARG(lv) = SvREFCNT_inc(av);
2470 LvTARGOFF(lv) = elem;
2475 if (PL_op->op_private & OPpLVAL_INTRO)
2476 save_aelem(av, elem, svp);
2477 else if (PL_op->op_private & OPpDEREF)
2478 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2480 sv = (svp ? *svp : &PL_sv_undef);
2481 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2482 sv = sv_mortalcopy(sv);
2488 vivify_ref(SV *sv, U32 to_what)
2494 croak(PL_no_modify);
2495 if (SvTYPE(sv) < SVt_RV)
2496 sv_upgrade(sv, SVt_RV);
2497 else if (SvTYPE(sv) >= SVt_PV) {
2498 (void)SvOOK_off(sv);
2499 Safefree(SvPVX(sv));
2500 SvLEN(sv) = SvCUR(sv) = 0;
2504 SvRV(sv) = NEWSV(355,0);
2507 SvRV(sv) = (SV*)newAV();
2510 SvRV(sv) = (SV*)newHV();
2531 if (SvTYPE(sv) == SVt_PVCV) {
2537 name = SvPV(TOPs, packlen);
2538 sv = *(PL_stack_base + TOPMARK + 1);
2549 !(packname = SvPV(sv, packlen)) ||
2550 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2551 !(ob=(SV*)GvIO(iogv)))
2554 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2555 ? !isIDFIRST_utf8((U8*)packname)
2556 : !isIDFIRST(*packname)
2559 DIE("Can't call method \"%s\" %s", name,
2560 SvOK(sv)? "without a package or object reference"
2561 : "on an undefined value");
2563 stash = gv_stashpvn(packname, packlen, TRUE);
2566 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2569 if (!ob || !SvOBJECT(ob))
2570 DIE("Can't call method \"%s\" on unblessed reference", name);
2572 stash = SvSTASH(ob);
2575 gv = gv_fetchmethod(stash, name);
2581 for (p = name; *p; p++) {
2583 sep = p, leaf = p + 1;
2584 else if (*p == ':' && *(p + 1) == ':')
2585 sep = p, leaf = p + 2;
2587 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2588 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2589 packlen = strlen(packname);
2593 packlen = sep - name;
2595 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2596 leaf, (int)packlen, packname);
2598 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);