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;
877 if (global = pm->op_pmflags & PMf_GLOBAL) {
879 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
880 MAGIC* mg = mg_find(TARG, 'g');
881 if (mg && mg->mg_len >= 0) {
882 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
883 minmatch = (mg->mg_flags & MGf_MINMATCH);
888 r_flags = ((gimme != G_ARRAY && !global && rx->nparens)
889 || SvTEMP(TARG) || PL_sawampersand)
890 ? REXEC_COPY_STR : 0;
891 if (SvSCREAM(TARG) && rx->check_substr
892 && SvTYPE(rx->check_substr) == SVt_PVBM
893 && SvVALID(rx->check_substr))
894 r_flags |= REXEC_SCREAM;
896 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
897 SAVEINT(PL_multiline);
898 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
902 if (global && rx->startp[0]) {
904 if ((s + rx->minlen) > strend)
906 if (update_minmatch++)
907 minmatch = (s == rx->startp[0]);
909 if (rx->check_substr) {
910 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
911 if (r_flags & REXEC_SCREAM) {
915 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
918 b = (char*)HOP((U8*)s, rx->check_offset_min);
919 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
922 if ((rx->reganch & ROPT_CHECK_ALL)
923 && !PL_sawampersand && !SvTAIL(rx->check_substr))
926 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
927 (unsigned char*)strend,
928 rx->check_substr, 0)))
930 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
932 if (s && rx->check_offset_max < s - t) {
933 ++BmUSEFUL(rx->check_substr);
934 s = (char*)HOP((U8*)s, -rx->check_offset_max);
939 /* Now checkstring is fixed, i.e. at fixed offset from the
940 beginning of match, and the match is anchored at s. */
941 else if (!PL_multiline) { /* Anchored near beginning of string. */
943 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
944 if (*SvPVX(rx->check_substr) != *b
945 || ((slen = SvCUR(rx->check_substr)) > 1
946 && memNE(SvPVX(rx->check_substr), b, slen)))
949 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
950 && rx->check_substr == rx->float_substr) {
951 SvREFCNT_dec(rx->check_substr);
952 rx->check_substr = Nullsv; /* opt is being useless */
953 rx->float_substr = Nullsv;
956 if (CALLREGEXEC(rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
959 if (pm->op_pmflags & PMf_ONCE)
960 pm->op_pmdynflags |= PMdf_USED;
969 RX_MATCH_TAINTED_on(rx);
970 TAINT_IF(RX_MATCH_TAINTED(rx));
971 if (gimme == G_ARRAY) {
975 if (global && !iters)
979 SPAGAIN; /* EVAL blocks could move the stack. */
980 EXTEND(SP, iters + i);
981 EXTEND_MORTAL(iters + i);
982 for (i = !i; i <= iters; i++) {
983 PUSHs(sv_newmortal());
985 if ((s = rx->startp[i]) && rx->endp[i] ) {
986 len = rx->endp[i] - s;
987 sv_setpvn(*SP, s, len);
991 truebase = rx->subbeg;
993 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
995 PUTBACK; /* EVAL blocks may use stack */
1000 LEAVE_SCOPE(oldsave);
1006 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1007 mg = mg_find(TARG, 'g');
1009 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1010 mg = mg_find(TARG, 'g');
1012 if (rx->startp[0]) {
1013 mg->mg_len = rx->endp[0] - rx->subbeg;
1014 if (rx->startp[0] == rx->endp[0])
1015 mg->mg_flags |= MGf_MINMATCH;
1017 mg->mg_flags &= ~MGf_MINMATCH;
1020 LEAVE_SCOPE(oldsave);
1024 yup: /* Confirmed by check_substr */
1026 RX_MATCH_TAINTED_on(rx);
1027 TAINT_IF(RX_MATCH_TAINTED(rx));
1028 ++BmUSEFUL(rx->check_substr);
1030 if (pm->op_pmflags & PMf_ONCE)
1031 pm->op_pmdynflags |= PMdf_USED;
1032 Safefree(rx->subbase);
1033 rx->subbase = Nullch;
1035 rx->subbeg = truebase;
1036 rx->subend = strend;
1038 rx->endp[0] = s + SvCUR(rx->check_substr);
1041 if (PL_sawampersand) {
1044 tmps = rx->subbase = savepvn(t, strend-t);
1046 rx->subend = tmps + (strend-t);
1047 tmps = rx->startp[0] = tmps + (s - t);
1048 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1050 LEAVE_SCOPE(oldsave);
1054 if (rx->check_substr)
1055 ++BmUSEFUL(rx->check_substr);
1058 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1059 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1060 MAGIC* mg = mg_find(TARG, 'g');
1065 LEAVE_SCOPE(oldsave);
1066 if (gimme == G_ARRAY)
1074 dSP; dTARGETSTACKED;
1079 register IO *io = GvIO(PL_last_in_gv);
1080 register I32 type = PL_op->op_type;
1081 I32 gimme = GIMME_V;
1084 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1086 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1089 perl_call_method("READLINE", gimme);
1092 if (gimme == G_SCALAR)
1093 SvSetMagicSV_nosteal(TARG, TOPs);
1100 if (IoFLAGS(io) & IOf_ARGV) {
1101 if (IoFLAGS(io) & IOf_START) {
1102 IoFLAGS(io) &= ~IOf_START;
1104 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1105 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1106 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1107 SvSETMAGIC(GvSV(PL_last_in_gv));
1112 fp = nextargv(PL_last_in_gv);
1113 if (!fp) { /* Note: fp != IoIFP(io) */
1114 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1115 IoFLAGS(io) |= IOf_START;
1118 else if (type == OP_GLOB) {
1119 SV *tmpcmd = NEWSV(55, 0);
1123 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1124 /* since spawning off a process is a real performance hit */
1126 #include <descrip.h>
1127 #include <lib$routines.h>
1130 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1131 char vmsspec[NAM$C_MAXRSS+1];
1132 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1133 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1134 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1137 struct dsc$descriptor_s wilddsc
1138 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1139 struct dsc$descriptor_vs rsdsc
1140 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1141 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1143 /* We could find out if there's an explicit dev/dir or version
1144 by peeking into lib$find_file's internal context at
1145 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1146 but that's unsupported, so I don't want to do it now and
1147 have it bite someone in the future. */
1148 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1149 cp = SvPV(tmpglob,i);
1151 if (cp[i] == ';') hasver = 1;
1153 if (sts) hasver = 1;
1157 hasdir = isunix = 1;
1160 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1165 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1167 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1168 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1169 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1170 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1171 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1172 &dfltdsc,NULL,NULL,NULL))&1)) {
1173 end = rstr + (unsigned long int) *rslt;
1174 if (!hasver) while (*end != ';') end--;
1175 *(end++) = '\n'; *end = '\0';
1176 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1178 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1183 while (*(--begin) != ']' && *begin != '>') ;
1186 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1188 if (cxt) (void)lib$find_file_end(&cxt);
1189 if (ok && sts != RMS$_NMF &&
1190 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1193 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1195 PerlIO_close(tmpfp);
1199 PerlIO_rewind(tmpfp);
1201 IoIFP(io) = fp = tmpfp;
1202 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1209 sv_setpv(tmpcmd, "for a in ");
1210 sv_catsv(tmpcmd, tmpglob);
1211 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1214 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1215 sv_catsv(tmpcmd, tmpglob);
1217 sv_setpv(tmpcmd, "perlglob ");
1218 sv_catsv(tmpcmd, tmpglob);
1219 sv_catpv(tmpcmd, " |");
1224 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1225 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1226 sv_catsv(tmpcmd, tmpglob);
1227 sv_catpv(tmpcmd, "' 2>/dev/null |");
1229 sv_setpv(tmpcmd, "echo ");
1230 sv_catsv(tmpcmd, tmpglob);
1232 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1234 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1237 #endif /* !DOSISH */
1238 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1239 FALSE, O_RDONLY, 0, Nullfp);
1245 else if (type == OP_GLOB)
1249 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START))
1251 "Read on closed filehandle <%s>", GvENAME(PL_last_in_gv));
1252 if (gimme == G_SCALAR) {
1253 (void)SvOK_off(TARG);
1259 if (gimme == G_SCALAR) {
1263 (void)SvUPGRADE(sv, SVt_PV);
1264 tmplen = SvLEN(sv); /* remember if already alloced */
1266 Sv_Grow(sv, 80); /* try short-buffering it */
1267 if (type == OP_RCATLINE)
1273 sv = sv_2mortal(NEWSV(57, 80));
1277 if (!sv_gets(sv, fp, offset)) {
1278 PerlIO_clearerr(fp);
1279 if (IoFLAGS(io) & IOf_ARGV) {
1280 fp = nextargv(PL_last_in_gv);
1283 (void)do_close(PL_last_in_gv, FALSE);
1284 IoFLAGS(io) |= IOf_START;
1286 else if (type == OP_GLOB) {
1287 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1289 "glob failed (child exited with status %d%s)",
1290 STATUS_CURRENT >> 8,
1291 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1294 if (gimme == G_SCALAR) {
1295 (void)SvOK_off(TARG);
1300 /* This should not be marked tainted if the fp is marked clean */
1301 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1308 if (type == OP_GLOB) {
1311 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1312 tmps = SvEND(sv) - 1;
1313 if (*tmps == *SvPVX(PL_rs)) {
1318 for (tmps = SvPVX(sv); *tmps; tmps++)
1319 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1320 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1322 if (*tmps && PerlLIO_stat(SvPVX(sv), &PL_statbuf) < 0) {
1323 (void)POPs; /* Unmatched wildcard? Chuck it... */
1327 if (gimme == G_ARRAY) {
1328 if (SvLEN(sv) - SvCUR(sv) > 20) {
1329 SvLEN_set(sv, SvCUR(sv)+1);
1330 Renew(SvPVX(sv), SvLEN(sv), char);
1332 sv = sv_2mortal(NEWSV(58, 80));
1335 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1336 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1340 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1341 Renew(SvPVX(sv), SvLEN(sv), char);
1350 register PERL_CONTEXT *cx;
1351 I32 gimme = OP_GIMME(PL_op, -1);
1354 if (cxstack_ix >= 0)
1355 gimme = cxstack[cxstack_ix].blk_gimme;
1363 PUSHBLOCK(cx, CXt_BLOCK, SP);
1375 U32 lval = PL_op->op_flags & OPf_MOD;
1376 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1379 if (SvTYPE(hv) == SVt_PVHV) {
1380 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1381 svp = he ? &HeVAL(he) : 0;
1383 else if (SvTYPE(hv) == SVt_PVAV) {
1384 if (PL_op->op_private & OPpLVAL_INTRO)
1385 DIE("Can't localize pseudo-hash element");
1386 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1392 if (!svp || *svp == &PL_sv_undef) {
1397 DIE(PL_no_helem, SvPV(keysv, n_a));
1399 lv = sv_newmortal();
1400 sv_upgrade(lv, SVt_PVLV);
1402 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1403 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1404 LvTARG(lv) = SvREFCNT_inc(hv);
1409 if (PL_op->op_private & OPpLVAL_INTRO) {
1410 if (HvNAME(hv) && isGV(*svp))
1411 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1413 save_helem(hv, keysv, svp);
1415 else if (PL_op->op_private & OPpDEREF)
1416 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1418 sv = (svp ? *svp : &PL_sv_undef);
1419 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1420 * Pushing the magical RHS on to the stack is useless, since
1421 * that magic is soon destined to be misled by the local(),
1422 * and thus the later pp_sassign() will fail to mg_get() the
1423 * old value. This should also cure problems with delayed
1424 * mg_get()s. GSAR 98-07-03 */
1425 if (!lval && SvGMAGICAL(sv))
1426 sv = sv_mortalcopy(sv);
1434 register PERL_CONTEXT *cx;
1440 if (PL_op->op_flags & OPf_SPECIAL) {
1441 cx = &cxstack[cxstack_ix];
1442 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1447 gimme = OP_GIMME(PL_op, -1);
1449 if (cxstack_ix >= 0)
1450 gimme = cxstack[cxstack_ix].blk_gimme;
1456 if (gimme == G_VOID)
1458 else if (gimme == G_SCALAR) {
1461 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1464 *MARK = sv_mortalcopy(TOPs);
1467 *MARK = &PL_sv_undef;
1471 else if (gimme == G_ARRAY) {
1472 /* in case LEAVE wipes old return values */
1473 for (mark = newsp + 1; mark <= SP; mark++) {
1474 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1475 *mark = sv_mortalcopy(*mark);
1476 TAINT_NOT; /* Each item is independent */
1480 PL_curpm = newpm; /* Don't pop $1 et al till now */
1490 register PERL_CONTEXT *cx;
1495 cx = &cxstack[cxstack_ix];
1496 if (CxTYPE(cx) != CXt_LOOP)
1497 DIE("panic: pp_iter");
1499 av = cx->blk_loop.iterary;
1500 if (SvTYPE(av) != SVt_PVAV) {
1501 /* iterate ($min .. $max) */
1502 if (cx->blk_loop.iterlval) {
1503 /* string increment */
1504 register SV* cur = cx->blk_loop.iterlval;
1506 char *max = SvPV((SV*)av, maxlen);
1507 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1508 #ifndef USE_THREADS /* don't risk potential race */
1509 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1510 && !SvMAGICAL(*cx->blk_loop.itervar))
1512 /* safe to reuse old SV */
1513 sv_setsv(*cx->blk_loop.itervar, cur);
1518 /* we need a fresh SV every time so that loop body sees a
1519 * completely new SV for closures/references to work as
1521 SvREFCNT_dec(*cx->blk_loop.itervar);
1522 *cx->blk_loop.itervar = newSVsv(cur);
1524 if (strEQ(SvPVX(cur), max))
1525 sv_setiv(cur, 0); /* terminate next time */
1532 /* integer increment */
1533 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1536 #ifndef USE_THREADS /* don't risk potential race */
1537 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1538 && !SvMAGICAL(*cx->blk_loop.itervar))
1540 /* safe to reuse old SV */
1541 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1546 /* we need a fresh SV every time so that loop body sees a
1547 * completely new SV for closures/references to work as they
1549 SvREFCNT_dec(*cx->blk_loop.itervar);
1550 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1556 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1559 SvREFCNT_dec(*cx->blk_loop.itervar);
1561 if (sv = (SvMAGICAL(av))
1562 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1563 : AvARRAY(av)[++cx->blk_loop.iterix])
1567 if (av != PL_curstack && SvIMMORTAL(sv)) {
1568 SV *lv = cx->blk_loop.iterlval;
1569 if (lv && SvREFCNT(lv) > 1) {
1574 SvREFCNT_dec(LvTARG(lv));
1576 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1577 sv_upgrade(lv, SVt_PVLV);
1579 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1581 LvTARG(lv) = SvREFCNT_inc(av);
1582 LvTARGOFF(lv) = cx->blk_loop.iterix;
1583 LvTARGLEN(lv) = (UV) -1;
1587 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1594 register PMOP *pm = cPMOP;
1610 register REGEXP *rx = pm->op_pmregexp;
1612 int force_on_match = 0;
1613 I32 oldsave = PL_savestack_ix;
1614 I32 update_minmatch = 1;
1616 /* known replacement string? */
1617 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1618 if (PL_op->op_flags & OPf_STACKED)
1624 if (SvREADONLY(TARG)
1625 || (SvTYPE(TARG) > SVt_PVLV
1626 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1627 croak(PL_no_modify);
1630 s = SvPV(TARG, len);
1631 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1633 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1634 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1641 DIE("panic: do_subst");
1644 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1645 position, once with zero-length,
1646 second time with non-zero. */
1648 if (!rx->prelen && PL_curpm) {
1650 rx = pm->op_pmregexp;
1652 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1653 ? REXEC_COPY_STR : 0;
1654 if (SvSCREAM(TARG) && rx->check_substr
1655 && SvTYPE(rx->check_substr) == SVt_PVBM
1656 && SvVALID(rx->check_substr))
1657 r_flags |= REXEC_SCREAM;
1658 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1659 SAVEINT(PL_multiline);
1660 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1663 if (rx->check_substr) {
1664 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1665 if (r_flags & REXEC_SCREAM) {
1669 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1672 b = (char*)HOP((U8*)s, rx->check_offset_min);
1673 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
1676 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
1677 (unsigned char*)strend,
1678 rx->check_substr, 0)))
1680 if (s && rx->check_offset_max < s - m) {
1681 ++BmUSEFUL(rx->check_substr);
1682 s = (char*)HOP((U8*)s, -rx->check_offset_max);
1687 /* Now checkstring is fixed, i.e. at fixed offset from the
1688 beginning of match, and the match is anchored at s. */
1689 else if (!PL_multiline) { /* Anchored at beginning of string. */
1691 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
1692 if (*SvPVX(rx->check_substr) != *b
1693 || ((slen = SvCUR(rx->check_substr)) > 1
1694 && memNE(SvPVX(rx->check_substr), b, slen)))
1697 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
1698 && rx->check_substr == rx->float_substr) {
1699 SvREFCNT_dec(rx->check_substr);
1700 rx->check_substr = Nullsv; /* opt is being useless */
1701 rx->float_substr = Nullsv;
1705 /* only replace once? */
1706 once = !(rpm->op_pmflags & PMf_GLOBAL);
1708 /* known replacement string? */
1709 c = dstr ? SvPV(dstr, clen) : Nullch;
1711 /* can do inplace substitution? */
1712 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1713 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1714 if (!CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1717 LEAVE_SCOPE(oldsave);
1720 if (force_on_match) {
1722 s = SvPV_force(TARG, len);
1727 SvSCREAM_off(TARG); /* disable possible screamer */
1729 rxtainted |= RX_MATCH_TAINTED(rx);
1731 m = orig + (rx->startp[0] - rx->subbase);
1732 d = orig + (rx->endp[0] - rx->subbase);
1738 if (m - s > strend - d) { /* faster to shorten from end */
1740 Copy(c, m, clen, char);
1745 Move(d, m, i, char);
1749 SvCUR_set(TARG, m - s);
1752 else if (i = m - s) { /* faster from front */
1760 Copy(c, m, clen, char);
1765 Copy(c, d, clen, char);
1770 TAINT_IF(rxtainted & 1);
1776 if (iters++ > maxiters)
1777 DIE("Substitution loop");
1778 rxtainted |= RX_MATCH_TAINTED(rx);
1783 Move(s, d, i, char);
1787 Copy(c, d, clen, char);
1791 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1792 Nullsv, NULL, 0)); /* don't match same null twice */
1795 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1796 Move(s, d, i+1, char); /* include the NUL */
1798 TAINT_IF(rxtainted & 1);
1800 PUSHs(sv_2mortal(newSViv((I32)iters)));
1802 (void)SvPOK_only(TARG);
1803 TAINT_IF(rxtainted);
1804 if (SvSMAGICAL(TARG)) {
1810 LEAVE_SCOPE(oldsave);
1814 if (CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1815 if (force_on_match) {
1817 s = SvPV_force(TARG, len);
1820 rxtainted |= RX_MATCH_TAINTED(rx);
1821 dstr = NEWSV(25, len);
1822 sv_setpvn(dstr, m, s-m);
1825 register PERL_CONTEXT *cx;
1828 RETURNOP(cPMOP->op_pmreplroot);
1831 if (iters++ > maxiters)
1832 DIE("Substitution loop");
1833 rxtainted |= RX_MATCH_TAINTED(rx);
1834 if (rx->subbase && rx->subbase != orig) {
1839 strend = s + (strend - m);
1842 sv_catpvn(dstr, s, m-s);
1845 sv_catpvn(dstr, c, clen);
1848 } while (CALLREGEXEC(rx, s, strend, orig, s == m, Nullsv, NULL, r_flags));
1849 sv_catpvn(dstr, s, strend - s);
1851 (void)SvOOK_off(TARG);
1852 Safefree(SvPVX(TARG));
1853 SvPVX(TARG) = SvPVX(dstr);
1854 SvCUR_set(TARG, SvCUR(dstr));
1855 SvLEN_set(TARG, SvLEN(dstr));
1859 TAINT_IF(rxtainted & 1);
1861 PUSHs(sv_2mortal(newSViv((I32)iters)));
1863 (void)SvPOK_only(TARG);
1864 TAINT_IF(rxtainted);
1867 LEAVE_SCOPE(oldsave);
1873 ++BmUSEFUL(rx->check_substr);
1878 LEAVE_SCOPE(oldsave);
1887 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1888 ++*PL_markstack_ptr;
1889 LEAVE; /* exit inner scope */
1892 if (PL_stack_base + *PL_markstack_ptr > SP) {
1894 I32 gimme = GIMME_V;
1896 LEAVE; /* exit outer scope */
1897 (void)POPMARK; /* pop src */
1898 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1899 (void)POPMARK; /* pop dst */
1900 SP = PL_stack_base + POPMARK; /* pop original mark */
1901 if (gimme == G_SCALAR) {
1905 else if (gimme == G_ARRAY)
1912 ENTER; /* enter inner scope */
1915 src = PL_stack_base[*PL_markstack_ptr];
1919 RETURNOP(cLOGOP->op_other);
1930 register PERL_CONTEXT *cx;
1931 struct block_sub cxsub;
1934 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1937 if (gimme == G_SCALAR) {
1940 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1942 *MARK = SvREFCNT_inc(TOPs);
1947 *MARK = sv_mortalcopy(TOPs);
1950 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1953 *MARK = &PL_sv_undef;
1957 else if (gimme == G_ARRAY) {
1958 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1959 if (!SvTEMP(*MARK)) {
1960 *MARK = sv_mortalcopy(*MARK);
1961 TAINT_NOT; /* Each item is independent */
1967 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1968 PL_curpm = newpm; /* ... and pop $1 et al */
1971 return pop_return();
1975 get_db_sub(SV **svp, CV *cv)
1978 SV *dbsv = GvSV(PL_DBsub);
1980 if (!PERLDB_SUB_NN) {
1984 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1985 || strEQ(GvNAME(gv), "END")
1986 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1987 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1988 && (gv = (GV*)*svp) ))) {
1989 /* Use GV from the stack as a fallback. */
1990 /* GV is potentially non-unique, or contain different CV. */
1991 sv_setsv(dbsv, newRV((SV*)cv));
1994 gv_efullname3(dbsv, gv, Nullch);
1998 SvUPGRADE(dbsv, SVt_PVIV);
2000 SAVEIV(SvIVX(dbsv));
2001 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
2005 PL_curcopdb = PL_curcop;
2006 cv = GvCV(PL_DBsub);
2016 register PERL_CONTEXT *cx;
2018 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2021 DIE("Not a CODE reference");
2022 switch (SvTYPE(sv)) {
2028 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2030 SP = PL_stack_base + POPMARK;
2033 if (SvGMAGICAL(sv)) {
2035 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2038 sym = SvPV(sv, n_a);
2040 DIE(PL_no_usym, "a subroutine");
2041 if (PL_op->op_private & HINT_STRICT_REFS)
2042 DIE(PL_no_symref, sym, "a subroutine");
2043 cv = perl_get_cv(sym, TRUE);
2047 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2048 tryAMAGICunDEREF(to_cv);
2051 if (SvTYPE(cv) == SVt_PVCV)
2056 DIE("Not a CODE reference");
2061 if (!(cv = GvCVu((GV*)sv)))
2062 cv = sv_2cv(sv, &stash, &gv, TRUE);
2071 DIE("Not a CODE reference");
2073 if (!CvROOT(cv) && !CvXSUB(cv)) {
2077 /* anonymous or undef'd function leaves us no recourse */
2078 if (CvANON(cv) || !(gv = CvGV(cv)))
2079 DIE("Undefined subroutine called");
2080 /* autoloaded stub? */
2081 if (cv != GvCV(gv)) {
2085 /* should call AUTOLOAD now? */
2086 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2093 sub_name = sv_newmortal();
2094 gv_efullname3(sub_name, gv, Nullch);
2095 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2099 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2100 cv = get_db_sub(&sv, cv);
2102 DIE("No DBsub routine");
2106 * First we need to check if the sub or method requires locking.
2107 * If so, we gain a lock on the CV, the first argument or the
2108 * stash (for static methods), as appropriate. This has to be
2109 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2110 * reschedule by returning a new op.
2112 MUTEX_LOCK(CvMUTEXP(cv));
2113 if (CvFLAGS(cv) & CVf_LOCKED) {
2115 if (CvFLAGS(cv) & CVf_METHOD) {
2116 if (SP > PL_stack_base + TOPMARK)
2117 sv = *(PL_stack_base + TOPMARK + 1);
2119 MUTEX_UNLOCK(CvMUTEXP(cv));
2120 croak("no argument for locked method call");
2126 char *stashname = SvPV(sv, len);
2127 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2133 MUTEX_UNLOCK(CvMUTEXP(cv));
2134 mg = condpair_magic(sv);
2135 MUTEX_LOCK(MgMUTEXP(mg));
2136 if (MgOWNER(mg) == thr)
2137 MUTEX_UNLOCK(MgMUTEXP(mg));
2140 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2142 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2144 MUTEX_UNLOCK(MgMUTEXP(mg));
2145 save_destructor(unlock_condpair, sv);
2147 MUTEX_LOCK(CvMUTEXP(cv));
2150 * Now we have permission to enter the sub, we must distinguish
2151 * four cases. (0) It's an XSUB (in which case we don't care
2152 * about ownership); (1) it's ours already (and we're recursing);
2153 * (2) it's free (but we may already be using a cached clone);
2154 * (3) another thread owns it. Case (1) is easy: we just use it.
2155 * Case (2) means we look for a clone--if we have one, use it
2156 * otherwise grab ownership of cv. Case (3) means we look for a
2157 * clone (for non-XSUBs) and have to create one if we don't
2159 * Why look for a clone in case (2) when we could just grab
2160 * ownership of cv straight away? Well, we could be recursing,
2161 * i.e. we originally tried to enter cv while another thread
2162 * owned it (hence we used a clone) but it has been freed up
2163 * and we're now recursing into it. It may or may not be "better"
2164 * to use the clone but at least CvDEPTH can be trusted.
2166 if (CvOWNER(cv) == thr || CvXSUB(cv))
2167 MUTEX_UNLOCK(CvMUTEXP(cv));
2169 /* Case (2) or (3) */
2173 * XXX Might it be better to release CvMUTEXP(cv) while we
2174 * do the hv_fetch? We might find someone has pinched it
2175 * when we look again, in which case we would be in case
2176 * (3) instead of (2) so we'd have to clone. Would the fact
2177 * that we released the mutex more quickly make up for this?
2179 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2181 /* We already have a clone to use */
2182 MUTEX_UNLOCK(CvMUTEXP(cv));
2184 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2185 "entersub: %p already has clone %p:%s\n",
2186 thr, cv, SvPEEK((SV*)cv)));
2189 if (CvDEPTH(cv) == 0)
2190 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2193 /* (2) => grab ownership of cv. (3) => make clone */
2197 MUTEX_UNLOCK(CvMUTEXP(cv));
2198 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2199 "entersub: %p grabbing %p:%s in stash %s\n",
2200 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2201 HvNAME(CvSTASH(cv)) : "(none)"));
2203 /* Make a new clone. */
2205 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2206 MUTEX_UNLOCK(CvMUTEXP(cv));
2207 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2208 "entersub: %p cloning %p:%s\n",
2209 thr, cv, SvPEEK((SV*)cv))));
2211 * We're creating a new clone so there's no race
2212 * between the original MUTEX_UNLOCK and the
2213 * SvREFCNT_inc since no one will be trying to undef
2214 * it out from underneath us. At least, I don't think
2217 clonecv = cv_clone(cv);
2218 SvREFCNT_dec(cv); /* finished with this */
2219 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2220 CvOWNER(clonecv) = thr;
2224 DEBUG_S(if (CvDEPTH(cv) != 0)
2225 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2227 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2230 #endif /* USE_THREADS */
2233 if (CvOLDSTYLE(cv)) {
2234 I32 (*fp3)_((int,int,int));
2236 register I32 items = SP - MARK;
2237 /* We dont worry to copy from @_. */
2242 PL_stack_sp = mark + 1;
2243 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2244 items = (*fp3)(CvXSUBANY(cv).any_i32,
2245 MARK - PL_stack_base + 1,
2247 PL_stack_sp = PL_stack_base + items;
2250 I32 markix = TOPMARK;
2255 /* Need to copy @_ to stack. Alternative may be to
2256 * switch stack to @_, and copy return values
2257 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2261 av = (AV*)PL_curpad[0];
2263 av = GvAV(PL_defgv);
2264 #endif /* USE_THREADS */
2265 items = AvFILLp(av) + 1; /* @_ is not tieable */
2268 /* Mark is at the end of the stack. */
2270 Copy(AvARRAY(av), SP + 1, items, SV*);
2275 if (PL_curcopdb) { /* We assume that the first
2276 XSUB in &DB::sub is the
2278 SAVESPTR(PL_curcop);
2279 PL_curcop = PL_curcopdb;
2282 /* Do we need to open block here? XXXX */
2283 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2285 /* Enforce some sanity in scalar context. */
2286 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2287 if (markix > PL_stack_sp - PL_stack_base)
2288 *(PL_stack_base + markix) = &PL_sv_undef;
2290 *(PL_stack_base + markix) = *PL_stack_sp;
2291 PL_stack_sp = PL_stack_base + markix;
2299 register I32 items = SP - MARK;
2300 AV* padlist = CvPADLIST(cv);
2301 SV** svp = AvARRAY(padlist);
2302 push_return(PL_op->op_next);
2303 PUSHBLOCK(cx, CXt_SUB, MARK);
2306 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2307 * that eval'' ops within this sub know the correct lexical space.
2308 * Owing the speed considerations, we choose to search for the cv
2309 * in doeval() instead.
2311 if (CvDEPTH(cv) < 2)
2312 (void)SvREFCNT_inc(cv);
2313 else { /* save temporaries on recursion? */
2314 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2316 AV *newpad = newAV();
2317 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2318 I32 ix = AvFILLp((AV*)svp[1]);
2319 svp = AvARRAY(svp[0]);
2320 for ( ;ix > 0; ix--) {
2321 if (svp[ix] != &PL_sv_undef) {
2322 char *name = SvPVX(svp[ix]);
2323 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2324 || *name == '&') /* anonymous code? */
2326 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2328 else { /* our own lexical */
2330 av_store(newpad, ix, sv = (SV*)newAV());
2331 else if (*name == '%')
2332 av_store(newpad, ix, sv = (SV*)newHV());
2334 av_store(newpad, ix, sv = NEWSV(0,0));
2339 av_store(newpad, ix, sv = NEWSV(0,0));
2343 av = newAV(); /* will be @_ */
2345 av_store(newpad, 0, (SV*)av);
2346 AvFLAGS(av) = AVf_REIFY;
2347 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2348 AvFILLp(padlist) = CvDEPTH(cv);
2349 svp = AvARRAY(padlist);
2354 AV* av = (AV*)PL_curpad[0];
2356 items = AvFILLp(av) + 1;
2358 /* Mark is at the end of the stack. */
2360 Copy(AvARRAY(av), SP + 1, items, SV*);
2365 #endif /* USE_THREADS */
2366 SAVESPTR(PL_curpad);
2367 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2370 #endif /* USE_THREADS */
2376 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2377 "%p entersub preparing @_\n", thr));
2379 av = (AV*)PL_curpad[0];
2385 cx->blk_sub.savearray = GvAV(PL_defgv);
2386 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2387 #endif /* USE_THREADS */
2388 cx->blk_sub.argarray = av;
2391 if (items > AvMAX(av) + 1) {
2393 if (AvARRAY(av) != ary) {
2394 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2395 SvPVX(av) = (char*)ary;
2397 if (items > AvMAX(av) + 1) {
2398 AvMAX(av) = items - 1;
2399 Renew(ary,items,SV*);
2401 SvPVX(av) = (char*)ary;
2404 Copy(MARK,AvARRAY(av),items,SV*);
2405 AvFILLp(av) = items - 1;
2413 /* warning must come *after* we fully set up the context
2414 * stuff so that __WARN__ handlers can safely dounwind()
2417 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2418 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2419 sub_crush_depth(cv);
2421 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2422 "%p entersub returning %p\n", thr, CvSTART(cv)));
2424 RETURNOP(CvSTART(cv));
2429 sub_crush_depth(CV *cv)
2432 warner(WARN_RECURSION, "Deep recursion on anonymous subroutine");
2434 SV* tmpstr = sv_newmortal();
2435 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2436 warner(WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2447 U32 lval = PL_op->op_flags & OPf_MOD;
2448 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2452 elem -= PL_curcop->cop_arybase;
2453 if (SvTYPE(av) != SVt_PVAV)
2455 svp = av_fetch(av, elem, lval && !defer);
2457 if (!svp || *svp == &PL_sv_undef) {
2460 DIE(PL_no_aelem, elem);
2461 lv = sv_newmortal();
2462 sv_upgrade(lv, SVt_PVLV);
2464 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2465 LvTARG(lv) = SvREFCNT_inc(av);
2466 LvTARGOFF(lv) = elem;
2471 if (PL_op->op_private & OPpLVAL_INTRO)
2472 save_aelem(av, elem, svp);
2473 else if (PL_op->op_private & OPpDEREF)
2474 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2476 sv = (svp ? *svp : &PL_sv_undef);
2477 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2478 sv = sv_mortalcopy(sv);
2484 vivify_ref(SV *sv, U32 to_what)
2490 croak(PL_no_modify);
2491 if (SvTYPE(sv) < SVt_RV)
2492 sv_upgrade(sv, SVt_RV);
2493 else if (SvTYPE(sv) >= SVt_PV) {
2494 (void)SvOOK_off(sv);
2495 Safefree(SvPVX(sv));
2496 SvLEN(sv) = SvCUR(sv) = 0;
2500 SvRV(sv) = NEWSV(355,0);
2503 SvRV(sv) = (SV*)newAV();
2506 SvRV(sv) = (SV*)newHV();
2527 if (SvTYPE(sv) == SVt_PVCV) {
2533 name = SvPV(TOPs, packlen);
2534 sv = *(PL_stack_base + TOPMARK + 1);
2545 !(packname = SvPV(sv, packlen)) ||
2546 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2547 !(ob=(SV*)GvIO(iogv)))
2550 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2551 ? !isIDFIRST_utf8((U8*)packname)
2552 : !isIDFIRST(*packname)
2555 DIE("Can't call method \"%s\" %s", name,
2556 SvOK(sv)? "without a package or object reference"
2557 : "on an undefined value");
2559 stash = gv_stashpvn(packname, packlen, TRUE);
2562 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2565 if (!ob || !SvOBJECT(ob))
2566 DIE("Can't call method \"%s\" on unblessed reference", name);
2568 stash = SvSTASH(ob);
2571 gv = gv_fetchmethod(stash, name);
2577 for (p = name; *p; p++) {
2579 sep = p, leaf = p + 1;
2580 else if (*p == ':' && *(p + 1) == ':')
2581 sep = p, leaf = p + 2;
2583 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2584 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2585 packlen = strlen(packname);
2589 packlen = sep - name;
2591 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2592 leaf, (int)packlen, packname);
2594 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);