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 if (!(rx->reganch & ROPT_GPOS_SEEN))
885 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
886 minmatch = (mg->mg_flags & MGf_MINMATCH);
891 r_flags = ((gimme != G_ARRAY && !global && rx->nparens)
892 || SvTEMP(TARG) || PL_sawampersand)
893 ? REXEC_COPY_STR : 0;
894 if (SvSCREAM(TARG) && rx->check_substr
895 && SvTYPE(rx->check_substr) == SVt_PVBM
896 && SvVALID(rx->check_substr))
897 r_flags |= REXEC_SCREAM;
899 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
900 SAVEINT(PL_multiline);
901 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
905 if (global && rx->startp[0]) {
907 if ((s + rx->minlen) > strend)
909 if (update_minmatch++)
910 minmatch = (s == rx->startp[0]);
912 if (rx->check_substr) {
913 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
914 if (r_flags & REXEC_SCREAM) {
918 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
921 b = (char*)HOP((U8*)s, rx->check_offset_min);
922 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
925 if ((rx->reganch & ROPT_CHECK_ALL)
926 && !PL_sawampersand && !SvTAIL(rx->check_substr))
929 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
930 (unsigned char*)strend,
931 rx->check_substr, 0)))
933 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
935 if (s && rx->check_offset_max < s - t) {
936 ++BmUSEFUL(rx->check_substr);
937 s = (char*)HOP((U8*)s, -rx->check_offset_max);
942 /* Now checkstring is fixed, i.e. at fixed offset from the
943 beginning of match, and the match is anchored at s. */
944 else if (!PL_multiline) { /* Anchored near beginning of string. */
946 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
947 if (*SvPVX(rx->check_substr) != *b
948 || ((slen = SvCUR(rx->check_substr)) > 1
949 && memNE(SvPVX(rx->check_substr), b, slen)))
952 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
953 && rx->check_substr == rx->float_substr) {
954 SvREFCNT_dec(rx->check_substr);
955 rx->check_substr = Nullsv; /* opt is being useless */
956 rx->float_substr = Nullsv;
959 if (CALLREGEXEC(rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
962 if (pm->op_pmflags & PMf_ONCE)
963 pm->op_pmdynflags |= PMdf_USED;
972 RX_MATCH_TAINTED_on(rx);
973 TAINT_IF(RX_MATCH_TAINTED(rx));
974 if (gimme == G_ARRAY) {
978 if (global && !iters)
982 SPAGAIN; /* EVAL blocks could move the stack. */
983 EXTEND(SP, iters + i);
984 EXTEND_MORTAL(iters + i);
985 for (i = !i; i <= iters; i++) {
986 PUSHs(sv_newmortal());
988 if ((s = rx->startp[i]) && rx->endp[i] ) {
989 len = rx->endp[i] - s;
990 sv_setpvn(*SP, s, len);
994 truebase = rx->subbeg;
996 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
998 PUTBACK; /* EVAL blocks may use stack */
999 r_flags |= REXEC_IGNOREPOS;
1004 LEAVE_SCOPE(oldsave);
1010 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1011 mg = mg_find(TARG, 'g');
1013 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1014 mg = mg_find(TARG, 'g');
1016 if (rx->startp[0]) {
1017 mg->mg_len = rx->endp[0] - rx->subbeg;
1018 if (rx->startp[0] == rx->endp[0])
1019 mg->mg_flags |= MGf_MINMATCH;
1021 mg->mg_flags &= ~MGf_MINMATCH;
1024 LEAVE_SCOPE(oldsave);
1028 yup: /* Confirmed by check_substr */
1030 RX_MATCH_TAINTED_on(rx);
1031 TAINT_IF(RX_MATCH_TAINTED(rx));
1032 ++BmUSEFUL(rx->check_substr);
1034 if (pm->op_pmflags & PMf_ONCE)
1035 pm->op_pmdynflags |= PMdf_USED;
1036 Safefree(rx->subbase);
1037 rx->subbase = Nullch;
1039 rx->subbeg = truebase;
1040 rx->subend = strend;
1042 rx->endp[0] = s + SvCUR(rx->check_substr);
1045 if (PL_sawampersand) {
1048 tmps = rx->subbase = savepvn(t, strend-t);
1050 rx->subend = tmps + (strend-t);
1051 tmps = rx->startp[0] = tmps + (s - t);
1052 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1054 LEAVE_SCOPE(oldsave);
1058 if (rx->check_substr)
1059 ++BmUSEFUL(rx->check_substr);
1062 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1063 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1064 MAGIC* mg = mg_find(TARG, 'g');
1069 LEAVE_SCOPE(oldsave);
1070 if (gimme == G_ARRAY)
1078 dSP; dTARGETSTACKED;
1083 register IO *io = GvIO(PL_last_in_gv);
1084 register I32 type = PL_op->op_type;
1085 I32 gimme = GIMME_V;
1088 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1090 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1093 perl_call_method("READLINE", gimme);
1096 if (gimme == G_SCALAR)
1097 SvSetMagicSV_nosteal(TARG, TOPs);
1104 if (IoFLAGS(io) & IOf_ARGV) {
1105 if (IoFLAGS(io) & IOf_START) {
1106 IoFLAGS(io) &= ~IOf_START;
1108 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1109 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1110 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1111 SvSETMAGIC(GvSV(PL_last_in_gv));
1116 fp = nextargv(PL_last_in_gv);
1117 if (!fp) { /* Note: fp != IoIFP(io) */
1118 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1119 IoFLAGS(io) |= IOf_START;
1122 else if (type == OP_GLOB) {
1123 SV *tmpcmd = NEWSV(55, 0);
1127 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1128 /* since spawning off a process is a real performance hit */
1130 #include <descrip.h>
1131 #include <lib$routines.h>
1134 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1135 char vmsspec[NAM$C_MAXRSS+1];
1136 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1137 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1138 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1141 struct dsc$descriptor_s wilddsc
1142 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1143 struct dsc$descriptor_vs rsdsc
1144 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1145 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1147 /* We could find out if there's an explicit dev/dir or version
1148 by peeking into lib$find_file's internal context at
1149 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1150 but that's unsupported, so I don't want to do it now and
1151 have it bite someone in the future. */
1152 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1153 cp = SvPV(tmpglob,i);
1155 if (cp[i] == ';') hasver = 1;
1157 if (sts) hasver = 1;
1161 hasdir = isunix = 1;
1164 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1169 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1171 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1172 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1173 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1174 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1175 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1176 &dfltdsc,NULL,NULL,NULL))&1)) {
1177 end = rstr + (unsigned long int) *rslt;
1178 if (!hasver) while (*end != ';') end--;
1179 *(end++) = '\n'; *end = '\0';
1180 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1182 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1187 while (*(--begin) != ']' && *begin != '>') ;
1190 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1192 if (cxt) (void)lib$find_file_end(&cxt);
1193 if (ok && sts != RMS$_NMF &&
1194 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1197 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1199 PerlIO_close(tmpfp);
1203 PerlIO_rewind(tmpfp);
1205 IoIFP(io) = fp = tmpfp;
1206 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1213 sv_setpv(tmpcmd, "for a in ");
1214 sv_catsv(tmpcmd, tmpglob);
1215 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1218 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1219 sv_catsv(tmpcmd, tmpglob);
1221 sv_setpv(tmpcmd, "perlglob ");
1222 sv_catsv(tmpcmd, tmpglob);
1223 sv_catpv(tmpcmd, " |");
1228 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1229 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1230 sv_catsv(tmpcmd, tmpglob);
1231 sv_catpv(tmpcmd, "' 2>/dev/null |");
1233 sv_setpv(tmpcmd, "echo ");
1234 sv_catsv(tmpcmd, tmpglob);
1236 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1238 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1241 #endif /* !DOSISH */
1242 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1243 FALSE, O_RDONLY, 0, Nullfp);
1249 else if (type == OP_GLOB)
1253 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START))
1255 "Read on closed filehandle <%s>", GvENAME(PL_last_in_gv));
1256 if (gimme == G_SCALAR) {
1257 (void)SvOK_off(TARG);
1263 if (gimme == G_SCALAR) {
1267 (void)SvUPGRADE(sv, SVt_PV);
1268 tmplen = SvLEN(sv); /* remember if already alloced */
1270 Sv_Grow(sv, 80); /* try short-buffering it */
1271 if (type == OP_RCATLINE)
1277 sv = sv_2mortal(NEWSV(57, 80));
1281 if (!sv_gets(sv, fp, offset)) {
1282 PerlIO_clearerr(fp);
1283 if (IoFLAGS(io) & IOf_ARGV) {
1284 fp = nextargv(PL_last_in_gv);
1287 (void)do_close(PL_last_in_gv, FALSE);
1288 IoFLAGS(io) |= IOf_START;
1290 else if (type == OP_GLOB) {
1291 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1293 "glob failed (child exited with status %d%s)",
1294 STATUS_CURRENT >> 8,
1295 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1298 if (gimme == G_SCALAR) {
1299 (void)SvOK_off(TARG);
1304 /* This should not be marked tainted if the fp is marked clean */
1305 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1312 if (type == OP_GLOB) {
1315 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1316 tmps = SvEND(sv) - 1;
1317 if (*tmps == *SvPVX(PL_rs)) {
1322 for (tmps = SvPVX(sv); *tmps; tmps++)
1323 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1324 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1326 if (*tmps && PerlLIO_stat(SvPVX(sv), &PL_statbuf) < 0) {
1327 (void)POPs; /* Unmatched wildcard? Chuck it... */
1331 if (gimme == G_ARRAY) {
1332 if (SvLEN(sv) - SvCUR(sv) > 20) {
1333 SvLEN_set(sv, SvCUR(sv)+1);
1334 Renew(SvPVX(sv), SvLEN(sv), char);
1336 sv = sv_2mortal(NEWSV(58, 80));
1339 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1340 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1344 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1345 Renew(SvPVX(sv), SvLEN(sv), char);
1354 register PERL_CONTEXT *cx;
1355 I32 gimme = OP_GIMME(PL_op, -1);
1358 if (cxstack_ix >= 0)
1359 gimme = cxstack[cxstack_ix].blk_gimme;
1367 PUSHBLOCK(cx, CXt_BLOCK, SP);
1379 U32 lval = PL_op->op_flags & OPf_MOD;
1380 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1383 if (SvTYPE(hv) == SVt_PVHV) {
1384 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1385 svp = he ? &HeVAL(he) : 0;
1387 else if (SvTYPE(hv) == SVt_PVAV) {
1388 if (PL_op->op_private & OPpLVAL_INTRO)
1389 DIE("Can't localize pseudo-hash element");
1390 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1396 if (!svp || *svp == &PL_sv_undef) {
1401 DIE(PL_no_helem, SvPV(keysv, n_a));
1403 lv = sv_newmortal();
1404 sv_upgrade(lv, SVt_PVLV);
1406 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1407 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1408 LvTARG(lv) = SvREFCNT_inc(hv);
1413 if (PL_op->op_private & OPpLVAL_INTRO) {
1414 if (HvNAME(hv) && isGV(*svp))
1415 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1417 save_helem(hv, keysv, svp);
1419 else if (PL_op->op_private & OPpDEREF)
1420 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1422 sv = (svp ? *svp : &PL_sv_undef);
1423 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1424 * Pushing the magical RHS on to the stack is useless, since
1425 * that magic is soon destined to be misled by the local(),
1426 * and thus the later pp_sassign() will fail to mg_get() the
1427 * old value. This should also cure problems with delayed
1428 * mg_get()s. GSAR 98-07-03 */
1429 if (!lval && SvGMAGICAL(sv))
1430 sv = sv_mortalcopy(sv);
1438 register PERL_CONTEXT *cx;
1444 if (PL_op->op_flags & OPf_SPECIAL) {
1445 cx = &cxstack[cxstack_ix];
1446 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1451 gimme = OP_GIMME(PL_op, -1);
1453 if (cxstack_ix >= 0)
1454 gimme = cxstack[cxstack_ix].blk_gimme;
1460 if (gimme == G_VOID)
1462 else if (gimme == G_SCALAR) {
1465 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1468 *MARK = sv_mortalcopy(TOPs);
1471 *MARK = &PL_sv_undef;
1475 else if (gimme == G_ARRAY) {
1476 /* in case LEAVE wipes old return values */
1477 for (mark = newsp + 1; mark <= SP; mark++) {
1478 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1479 *mark = sv_mortalcopy(*mark);
1480 TAINT_NOT; /* Each item is independent */
1484 PL_curpm = newpm; /* Don't pop $1 et al till now */
1494 register PERL_CONTEXT *cx;
1499 cx = &cxstack[cxstack_ix];
1500 if (CxTYPE(cx) != CXt_LOOP)
1501 DIE("panic: pp_iter");
1503 av = cx->blk_loop.iterary;
1504 if (SvTYPE(av) != SVt_PVAV) {
1505 /* iterate ($min .. $max) */
1506 if (cx->blk_loop.iterlval) {
1507 /* string increment */
1508 register SV* cur = cx->blk_loop.iterlval;
1510 char *max = SvPV((SV*)av, maxlen);
1511 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1512 #ifndef USE_THREADS /* don't risk potential race */
1513 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1514 && !SvMAGICAL(*cx->blk_loop.itervar))
1516 /* safe to reuse old SV */
1517 sv_setsv(*cx->blk_loop.itervar, cur);
1522 /* we need a fresh SV every time so that loop body sees a
1523 * completely new SV for closures/references to work as
1525 SvREFCNT_dec(*cx->blk_loop.itervar);
1526 *cx->blk_loop.itervar = newSVsv(cur);
1528 if (strEQ(SvPVX(cur), max))
1529 sv_setiv(cur, 0); /* terminate next time */
1536 /* integer increment */
1537 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1540 #ifndef USE_THREADS /* don't risk potential race */
1541 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1542 && !SvMAGICAL(*cx->blk_loop.itervar))
1544 /* safe to reuse old SV */
1545 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1550 /* we need a fresh SV every time so that loop body sees a
1551 * completely new SV for closures/references to work as they
1553 SvREFCNT_dec(*cx->blk_loop.itervar);
1554 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1560 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1563 SvREFCNT_dec(*cx->blk_loop.itervar);
1565 if (sv = (SvMAGICAL(av))
1566 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1567 : AvARRAY(av)[++cx->blk_loop.iterix])
1571 if (av != PL_curstack && SvIMMORTAL(sv)) {
1572 SV *lv = cx->blk_loop.iterlval;
1573 if (lv && SvREFCNT(lv) > 1) {
1578 SvREFCNT_dec(LvTARG(lv));
1580 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1581 sv_upgrade(lv, SVt_PVLV);
1583 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1585 LvTARG(lv) = SvREFCNT_inc(av);
1586 LvTARGOFF(lv) = cx->blk_loop.iterix;
1587 LvTARGLEN(lv) = (UV) -1;
1591 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1598 register PMOP *pm = cPMOP;
1614 register REGEXP *rx = pm->op_pmregexp;
1616 int force_on_match = 0;
1617 I32 oldsave = PL_savestack_ix;
1618 I32 update_minmatch = 1;
1620 /* known replacement string? */
1621 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1622 if (PL_op->op_flags & OPf_STACKED)
1628 if (SvREADONLY(TARG)
1629 || (SvTYPE(TARG) > SVt_PVLV
1630 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1631 croak(PL_no_modify);
1634 s = SvPV(TARG, len);
1635 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1637 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1638 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1645 DIE("panic: do_subst");
1648 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1649 position, once with zero-length,
1650 second time with non-zero. */
1652 if (!rx->prelen && PL_curpm) {
1654 rx = pm->op_pmregexp;
1656 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1657 ? REXEC_COPY_STR : 0;
1658 if (SvSCREAM(TARG) && rx->check_substr
1659 && SvTYPE(rx->check_substr) == SVt_PVBM
1660 && SvVALID(rx->check_substr))
1661 r_flags |= REXEC_SCREAM;
1662 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1663 SAVEINT(PL_multiline);
1664 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1667 if (rx->check_substr) {
1668 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1669 if (r_flags & REXEC_SCREAM) {
1673 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1676 b = (char*)HOP((U8*)s, rx->check_offset_min);
1677 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
1680 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
1681 (unsigned char*)strend,
1682 rx->check_substr, 0)))
1684 if (s && rx->check_offset_max < s - m) {
1685 ++BmUSEFUL(rx->check_substr);
1686 s = (char*)HOP((U8*)s, -rx->check_offset_max);
1691 /* Now checkstring is fixed, i.e. at fixed offset from the
1692 beginning of match, and the match is anchored at s. */
1693 else if (!PL_multiline) { /* Anchored at beginning of string. */
1695 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
1696 if (*SvPVX(rx->check_substr) != *b
1697 || ((slen = SvCUR(rx->check_substr)) > 1
1698 && memNE(SvPVX(rx->check_substr), b, slen)))
1701 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
1702 && rx->check_substr == rx->float_substr) {
1703 SvREFCNT_dec(rx->check_substr);
1704 rx->check_substr = Nullsv; /* opt is being useless */
1705 rx->float_substr = Nullsv;
1709 /* only replace once? */
1710 once = !(rpm->op_pmflags & PMf_GLOBAL);
1712 /* known replacement string? */
1713 c = dstr ? SvPV(dstr, clen) : Nullch;
1715 /* can do inplace substitution? */
1716 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1717 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1718 if (!CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1721 LEAVE_SCOPE(oldsave);
1724 if (force_on_match) {
1726 s = SvPV_force(TARG, len);
1731 SvSCREAM_off(TARG); /* disable possible screamer */
1733 rxtainted |= RX_MATCH_TAINTED(rx);
1735 m = orig + (rx->startp[0] - rx->subbase);
1736 d = orig + (rx->endp[0] - rx->subbase);
1742 if (m - s > strend - d) { /* faster to shorten from end */
1744 Copy(c, m, clen, char);
1749 Move(d, m, i, char);
1753 SvCUR_set(TARG, m - s);
1756 else if (i = m - s) { /* faster from front */
1764 Copy(c, m, clen, char);
1769 Copy(c, d, clen, char);
1774 TAINT_IF(rxtainted & 1);
1780 if (iters++ > maxiters)
1781 DIE("Substitution loop");
1782 rxtainted |= RX_MATCH_TAINTED(rx);
1787 Move(s, d, i, char);
1791 Copy(c, d, clen, char);
1795 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1796 Nullsv, NULL, 0)); /* don't match same null twice */
1799 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1800 Move(s, d, i+1, char); /* include the NUL */
1802 TAINT_IF(rxtainted & 1);
1804 PUSHs(sv_2mortal(newSViv((I32)iters)));
1806 (void)SvPOK_only(TARG);
1807 TAINT_IF(rxtainted);
1808 if (SvSMAGICAL(TARG)) {
1814 LEAVE_SCOPE(oldsave);
1818 if (CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1819 if (force_on_match) {
1821 s = SvPV_force(TARG, len);
1824 rxtainted |= RX_MATCH_TAINTED(rx);
1825 dstr = NEWSV(25, len);
1826 sv_setpvn(dstr, m, s-m);
1829 register PERL_CONTEXT *cx;
1832 RETURNOP(cPMOP->op_pmreplroot);
1834 r_flags |= REXEC_IGNOREPOS;
1836 if (iters++ > maxiters)
1837 DIE("Substitution loop");
1838 rxtainted |= RX_MATCH_TAINTED(rx);
1839 if (rx->subbase && rx->subbase != orig) {
1844 strend = s + (strend - m);
1847 sv_catpvn(dstr, s, m-s);
1850 sv_catpvn(dstr, c, clen);
1853 } while (CALLREGEXEC(rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1854 sv_catpvn(dstr, s, strend - s);
1856 (void)SvOOK_off(TARG);
1857 Safefree(SvPVX(TARG));
1858 SvPVX(TARG) = SvPVX(dstr);
1859 SvCUR_set(TARG, SvCUR(dstr));
1860 SvLEN_set(TARG, SvLEN(dstr));
1864 TAINT_IF(rxtainted & 1);
1866 PUSHs(sv_2mortal(newSViv((I32)iters)));
1868 (void)SvPOK_only(TARG);
1869 TAINT_IF(rxtainted);
1872 LEAVE_SCOPE(oldsave);
1878 ++BmUSEFUL(rx->check_substr);
1883 LEAVE_SCOPE(oldsave);
1892 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1893 ++*PL_markstack_ptr;
1894 LEAVE; /* exit inner scope */
1897 if (PL_stack_base + *PL_markstack_ptr > SP) {
1899 I32 gimme = GIMME_V;
1901 LEAVE; /* exit outer scope */
1902 (void)POPMARK; /* pop src */
1903 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1904 (void)POPMARK; /* pop dst */
1905 SP = PL_stack_base + POPMARK; /* pop original mark */
1906 if (gimme == G_SCALAR) {
1910 else if (gimme == G_ARRAY)
1917 ENTER; /* enter inner scope */
1920 src = PL_stack_base[*PL_markstack_ptr];
1924 RETURNOP(cLOGOP->op_other);
1935 register PERL_CONTEXT *cx;
1936 struct block_sub cxsub;
1939 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1942 if (gimme == G_SCALAR) {
1945 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1947 *MARK = SvREFCNT_inc(TOPs);
1952 *MARK = sv_mortalcopy(TOPs);
1955 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1958 *MARK = &PL_sv_undef;
1962 else if (gimme == G_ARRAY) {
1963 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1964 if (!SvTEMP(*MARK)) {
1965 *MARK = sv_mortalcopy(*MARK);
1966 TAINT_NOT; /* Each item is independent */
1972 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1973 PL_curpm = newpm; /* ... and pop $1 et al */
1976 return pop_return();
1980 get_db_sub(SV **svp, CV *cv)
1983 SV *dbsv = GvSV(PL_DBsub);
1985 if (!PERLDB_SUB_NN) {
1989 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1990 || strEQ(GvNAME(gv), "END")
1991 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1992 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1993 && (gv = (GV*)*svp) ))) {
1994 /* Use GV from the stack as a fallback. */
1995 /* GV is potentially non-unique, or contain different CV. */
1996 sv_setsv(dbsv, newRV((SV*)cv));
1999 gv_efullname3(dbsv, gv, Nullch);
2003 SvUPGRADE(dbsv, SVt_PVIV);
2005 SAVEIV(SvIVX(dbsv));
2006 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
2010 PL_curcopdb = PL_curcop;
2011 cv = GvCV(PL_DBsub);
2021 register PERL_CONTEXT *cx;
2023 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2026 DIE("Not a CODE reference");
2027 switch (SvTYPE(sv)) {
2033 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2035 SP = PL_stack_base + POPMARK;
2038 if (SvGMAGICAL(sv)) {
2040 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2043 sym = SvPV(sv, n_a);
2045 DIE(PL_no_usym, "a subroutine");
2046 if (PL_op->op_private & HINT_STRICT_REFS)
2047 DIE(PL_no_symref, sym, "a subroutine");
2048 cv = perl_get_cv(sym, TRUE);
2052 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2053 tryAMAGICunDEREF(to_cv);
2056 if (SvTYPE(cv) == SVt_PVCV)
2061 DIE("Not a CODE reference");
2066 if (!(cv = GvCVu((GV*)sv)))
2067 cv = sv_2cv(sv, &stash, &gv, TRUE);
2076 DIE("Not a CODE reference");
2078 if (!CvROOT(cv) && !CvXSUB(cv)) {
2082 /* anonymous or undef'd function leaves us no recourse */
2083 if (CvANON(cv) || !(gv = CvGV(cv)))
2084 DIE("Undefined subroutine called");
2085 /* autoloaded stub? */
2086 if (cv != GvCV(gv)) {
2090 /* should call AUTOLOAD now? */
2091 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2098 sub_name = sv_newmortal();
2099 gv_efullname3(sub_name, gv, Nullch);
2100 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2104 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2105 cv = get_db_sub(&sv, cv);
2107 DIE("No DBsub routine");
2111 * First we need to check if the sub or method requires locking.
2112 * If so, we gain a lock on the CV, the first argument or the
2113 * stash (for static methods), as appropriate. This has to be
2114 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2115 * reschedule by returning a new op.
2117 MUTEX_LOCK(CvMUTEXP(cv));
2118 if (CvFLAGS(cv) & CVf_LOCKED) {
2120 if (CvFLAGS(cv) & CVf_METHOD) {
2121 if (SP > PL_stack_base + TOPMARK)
2122 sv = *(PL_stack_base + TOPMARK + 1);
2124 MUTEX_UNLOCK(CvMUTEXP(cv));
2125 croak("no argument for locked method call");
2131 char *stashname = SvPV(sv, len);
2132 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2138 MUTEX_UNLOCK(CvMUTEXP(cv));
2139 mg = condpair_magic(sv);
2140 MUTEX_LOCK(MgMUTEXP(mg));
2141 if (MgOWNER(mg) == thr)
2142 MUTEX_UNLOCK(MgMUTEXP(mg));
2145 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2147 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2149 MUTEX_UNLOCK(MgMUTEXP(mg));
2150 save_destructor(unlock_condpair, sv);
2152 MUTEX_LOCK(CvMUTEXP(cv));
2155 * Now we have permission to enter the sub, we must distinguish
2156 * four cases. (0) It's an XSUB (in which case we don't care
2157 * about ownership); (1) it's ours already (and we're recursing);
2158 * (2) it's free (but we may already be using a cached clone);
2159 * (3) another thread owns it. Case (1) is easy: we just use it.
2160 * Case (2) means we look for a clone--if we have one, use it
2161 * otherwise grab ownership of cv. Case (3) means we look for a
2162 * clone (for non-XSUBs) and have to create one if we don't
2164 * Why look for a clone in case (2) when we could just grab
2165 * ownership of cv straight away? Well, we could be recursing,
2166 * i.e. we originally tried to enter cv while another thread
2167 * owned it (hence we used a clone) but it has been freed up
2168 * and we're now recursing into it. It may or may not be "better"
2169 * to use the clone but at least CvDEPTH can be trusted.
2171 if (CvOWNER(cv) == thr || CvXSUB(cv))
2172 MUTEX_UNLOCK(CvMUTEXP(cv));
2174 /* Case (2) or (3) */
2178 * XXX Might it be better to release CvMUTEXP(cv) while we
2179 * do the hv_fetch? We might find someone has pinched it
2180 * when we look again, in which case we would be in case
2181 * (3) instead of (2) so we'd have to clone. Would the fact
2182 * that we released the mutex more quickly make up for this?
2184 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2186 /* We already have a clone to use */
2187 MUTEX_UNLOCK(CvMUTEXP(cv));
2189 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2190 "entersub: %p already has clone %p:%s\n",
2191 thr, cv, SvPEEK((SV*)cv)));
2194 if (CvDEPTH(cv) == 0)
2195 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2198 /* (2) => grab ownership of cv. (3) => make clone */
2202 MUTEX_UNLOCK(CvMUTEXP(cv));
2203 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2204 "entersub: %p grabbing %p:%s in stash %s\n",
2205 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2206 HvNAME(CvSTASH(cv)) : "(none)"));
2208 /* Make a new clone. */
2210 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2211 MUTEX_UNLOCK(CvMUTEXP(cv));
2212 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2213 "entersub: %p cloning %p:%s\n",
2214 thr, cv, SvPEEK((SV*)cv))));
2216 * We're creating a new clone so there's no race
2217 * between the original MUTEX_UNLOCK and the
2218 * SvREFCNT_inc since no one will be trying to undef
2219 * it out from underneath us. At least, I don't think
2222 clonecv = cv_clone(cv);
2223 SvREFCNT_dec(cv); /* finished with this */
2224 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2225 CvOWNER(clonecv) = thr;
2229 DEBUG_S(if (CvDEPTH(cv) != 0)
2230 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2232 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2235 #endif /* USE_THREADS */
2238 if (CvOLDSTYLE(cv)) {
2239 I32 (*fp3)_((int,int,int));
2241 register I32 items = SP - MARK;
2242 /* We dont worry to copy from @_. */
2247 PL_stack_sp = mark + 1;
2248 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2249 items = (*fp3)(CvXSUBANY(cv).any_i32,
2250 MARK - PL_stack_base + 1,
2252 PL_stack_sp = PL_stack_base + items;
2255 I32 markix = TOPMARK;
2260 /* Need to copy @_ to stack. Alternative may be to
2261 * switch stack to @_, and copy return values
2262 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2266 av = (AV*)PL_curpad[0];
2268 av = GvAV(PL_defgv);
2269 #endif /* USE_THREADS */
2270 items = AvFILLp(av) + 1; /* @_ is not tieable */
2273 /* Mark is at the end of the stack. */
2275 Copy(AvARRAY(av), SP + 1, items, SV*);
2280 if (PL_curcopdb) { /* We assume that the first
2281 XSUB in &DB::sub is the
2283 SAVESPTR(PL_curcop);
2284 PL_curcop = PL_curcopdb;
2287 /* Do we need to open block here? XXXX */
2288 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2290 /* Enforce some sanity in scalar context. */
2291 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2292 if (markix > PL_stack_sp - PL_stack_base)
2293 *(PL_stack_base + markix) = &PL_sv_undef;
2295 *(PL_stack_base + markix) = *PL_stack_sp;
2296 PL_stack_sp = PL_stack_base + markix;
2304 register I32 items = SP - MARK;
2305 AV* padlist = CvPADLIST(cv);
2306 SV** svp = AvARRAY(padlist);
2307 push_return(PL_op->op_next);
2308 PUSHBLOCK(cx, CXt_SUB, MARK);
2311 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2312 * that eval'' ops within this sub know the correct lexical space.
2313 * Owing the speed considerations, we choose to search for the cv
2314 * in doeval() instead.
2316 if (CvDEPTH(cv) < 2)
2317 (void)SvREFCNT_inc(cv);
2318 else { /* save temporaries on recursion? */
2319 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2321 AV *newpad = newAV();
2322 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2323 I32 ix = AvFILLp((AV*)svp[1]);
2324 svp = AvARRAY(svp[0]);
2325 for ( ;ix > 0; ix--) {
2326 if (svp[ix] != &PL_sv_undef) {
2327 char *name = SvPVX(svp[ix]);
2328 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2329 || *name == '&') /* anonymous code? */
2331 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2333 else { /* our own lexical */
2335 av_store(newpad, ix, sv = (SV*)newAV());
2336 else if (*name == '%')
2337 av_store(newpad, ix, sv = (SV*)newHV());
2339 av_store(newpad, ix, sv = NEWSV(0,0));
2344 av_store(newpad, ix, sv = NEWSV(0,0));
2348 av = newAV(); /* will be @_ */
2350 av_store(newpad, 0, (SV*)av);
2351 AvFLAGS(av) = AVf_REIFY;
2352 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2353 AvFILLp(padlist) = CvDEPTH(cv);
2354 svp = AvARRAY(padlist);
2359 AV* av = (AV*)PL_curpad[0];
2361 items = AvFILLp(av) + 1;
2363 /* Mark is at the end of the stack. */
2365 Copy(AvARRAY(av), SP + 1, items, SV*);
2370 #endif /* USE_THREADS */
2371 SAVESPTR(PL_curpad);
2372 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2375 #endif /* USE_THREADS */
2381 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2382 "%p entersub preparing @_\n", thr));
2384 av = (AV*)PL_curpad[0];
2390 cx->blk_sub.savearray = GvAV(PL_defgv);
2391 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2392 #endif /* USE_THREADS */
2393 cx->blk_sub.argarray = av;
2396 if (items > AvMAX(av) + 1) {
2398 if (AvARRAY(av) != ary) {
2399 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2400 SvPVX(av) = (char*)ary;
2402 if (items > AvMAX(av) + 1) {
2403 AvMAX(av) = items - 1;
2404 Renew(ary,items,SV*);
2406 SvPVX(av) = (char*)ary;
2409 Copy(MARK,AvARRAY(av),items,SV*);
2410 AvFILLp(av) = items - 1;
2418 /* warning must come *after* we fully set up the context
2419 * stuff so that __WARN__ handlers can safely dounwind()
2422 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2423 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2424 sub_crush_depth(cv);
2426 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2427 "%p entersub returning %p\n", thr, CvSTART(cv)));
2429 RETURNOP(CvSTART(cv));
2434 sub_crush_depth(CV *cv)
2437 warner(WARN_RECURSION, "Deep recursion on anonymous subroutine");
2439 SV* tmpstr = sv_newmortal();
2440 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2441 warner(WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2452 U32 lval = PL_op->op_flags & OPf_MOD;
2453 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2457 elem -= PL_curcop->cop_arybase;
2458 if (SvTYPE(av) != SVt_PVAV)
2460 svp = av_fetch(av, elem, lval && !defer);
2462 if (!svp || *svp == &PL_sv_undef) {
2465 DIE(PL_no_aelem, elem);
2466 lv = sv_newmortal();
2467 sv_upgrade(lv, SVt_PVLV);
2469 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2470 LvTARG(lv) = SvREFCNT_inc(av);
2471 LvTARGOFF(lv) = elem;
2476 if (PL_op->op_private & OPpLVAL_INTRO)
2477 save_aelem(av, elem, svp);
2478 else if (PL_op->op_private & OPpDEREF)
2479 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2481 sv = (svp ? *svp : &PL_sv_undef);
2482 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2483 sv = sv_mortalcopy(sv);
2489 vivify_ref(SV *sv, U32 to_what)
2495 croak(PL_no_modify);
2496 if (SvTYPE(sv) < SVt_RV)
2497 sv_upgrade(sv, SVt_RV);
2498 else if (SvTYPE(sv) >= SVt_PV) {
2499 (void)SvOOK_off(sv);
2500 Safefree(SvPVX(sv));
2501 SvLEN(sv) = SvCUR(sv) = 0;
2505 SvRV(sv) = NEWSV(355,0);
2508 SvRV(sv) = (SV*)newAV();
2511 SvRV(sv) = (SV*)newHV();
2532 if (SvTYPE(sv) == SVt_PVCV) {
2538 name = SvPV(TOPs, packlen);
2539 sv = *(PL_stack_base + TOPMARK + 1);
2550 !(packname = SvPV(sv, packlen)) ||
2551 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2552 !(ob=(SV*)GvIO(iogv)))
2555 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2556 ? !isIDFIRST_utf8((U8*)packname)
2557 : !isIDFIRST(*packname)
2560 DIE("Can't call method \"%s\" %s", name,
2561 SvOK(sv)? "without a package or object reference"
2562 : "on an undefined value");
2564 stash = gv_stashpvn(packname, packlen, TRUE);
2567 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2570 if (!ob || !SvOBJECT(ob))
2571 DIE("Can't call method \"%s\" on unblessed reference", name);
2573 stash = SvSTASH(ob);
2576 gv = gv_fetchmethod(stash, name);
2582 for (p = name; *p; p++) {
2584 sep = p, leaf = p + 1;
2585 else if (*p == ':' && *(p + 1) == ':')
2586 sep = p, leaf = p + 2;
2588 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2589 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2590 packlen = strlen(packname);
2594 packlen = sep - name;
2596 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2597 leaf, (int)packlen, packname);
2599 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);