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!
35 unset_cvowner(void *cvarg)
37 register CV* cv = (CV *) cvarg;
40 #endif /* DEBUGGING */
42 DEBUG_S((PerlIO_printf(PerlIO_stderr(), "%p unsetting CvOWNER of %p:%s\n",
43 thr, cv, SvPEEK((SV*)cv))));
44 MUTEX_LOCK(CvMUTEXP(cv));
45 DEBUG_S(if (CvDEPTH(cv) != 0)
46 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
48 assert(thr == CvOWNER(cv));
50 MUTEX_UNLOCK(CvMUTEXP(cv));
53 #endif /* USE_THREADS */
64 PL_curcop = (COP*)PL_op;
65 TAINT_NOT; /* Each statement is presumed innocent */
66 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
75 if (PL_op->op_private & OPpLVAL_INTRO)
76 PUSHs(save_scalar(cGVOP->op_gv));
78 PUSHs(GvSV(cGVOP->op_gv));
89 PUSHMARK(PL_stack_sp);
99 sv_setpvn(TARG,s,len);
107 XPUSHs((SV*)cGVOP->op_gv);
118 RETURNOP(cLOGOP->op_other);
127 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
129 temp = left; left = right; right = temp;
131 if (PL_tainting && PL_tainted && !SvTAINTED(left))
133 SvSetMagicSV(right, left);
142 RETURNOP(cCONDOP->op_true);
144 RETURNOP(cCONDOP->op_false);
150 TAINT_NOT; /* Each statement is presumed innocent */
151 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
153 oldsave = PL_scopestack[PL_scopestack_ix - 1];
154 LEAVE_SCOPE(oldsave);
160 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
167 sv_setpvn(TARG,s,len);
169 else if (SvGMAGICAL(TARG))
171 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
172 sv_setpv(TARG, ""); /* Suppress warning. */
173 s = SvPV_force(TARG, len);
177 sv_catpvn(TARG,s,len);
179 sv_setpvn(TARG,s,len); /* suppress warning */
189 if (PL_op->op_flags & OPf_MOD) {
190 if (PL_op->op_private & OPpLVAL_INTRO)
191 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
192 else if (PL_op->op_private & OPpDEREF) {
194 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
203 PL_last_in_gv = (GV*)(*PL_stack_sp--);
204 return do_readline();
209 djSP; tryAMAGICbinSET(eq,0);
212 SETs(boolSV(TOPn == value));
220 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
222 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
223 SvIVX(TOPs) != IV_MAX)
226 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
241 RETURNOP(cLOGOP->op_other);
247 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
250 SETn( left + right );
258 AV *av = GvAV((GV*)cSVOP->op_sv);
259 U32 lval = PL_op->op_flags & OPf_MOD;
260 SV** svp = av_fetch(av, PL_op->op_private, lval);
261 SV *sv = (svp ? *svp : &PL_sv_undef);
263 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
264 sv = sv_mortalcopy(sv);
271 djSP; dMARK; dTARGET;
273 do_join(TARG, *MARK, MARK, SP);
284 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
285 * will be enough to hold an OP*.
287 SV* sv = sv_newmortal();
288 sv_upgrade(sv, SVt_PVLV);
290 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
298 /* Oversized hot code. */
302 djSP; dMARK; dORIGMARK;
308 if (PL_op->op_flags & OPf_STACKED)
312 if (SvRMAGICAL(gv) && (mg = mg_find((SV*)gv, 'q'))) {
313 if (MARK == ORIGMARK) {
314 /* If using default handle then we need to make space to
315 * pass object as 1st arg, so move other args up ...
319 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
326 perl_call_method("PRINT", G_SCALAR);
334 if (!(io = GvIO(gv))) {
336 SV* sv = sv_newmortal();
337 gv_fullname3(sv, gv, Nullch);
338 warn("Filehandle %s never opened", SvPV(sv,PL_na));
341 SETERRNO(EBADF,RMS$_IFI);
344 else if (!(fp = IoOFP(io))) {
346 SV* sv = sv_newmortal();
347 gv_fullname3(sv, gv, Nullch);
349 warn("Filehandle %s opened only for input", SvPV(sv,PL_na));
351 warn("print on closed filehandle %s", SvPV(sv,PL_na));
353 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
360 if (!do_print(*MARK, fp))
364 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
373 if (!do_print(*MARK, fp))
382 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
385 if (IoFLAGS(io) & IOf_FLUSH)
386 if (PerlIO_flush(fp) == EOF)
408 if (SvTYPE(av) != SVt_PVAV)
409 DIE("Not an ARRAY reference");
410 if (PL_op->op_flags & OPf_REF) {
416 if (SvTYPE(sv) == SVt_PVAV) {
418 if (PL_op->op_flags & OPf_REF) {
426 if (SvTYPE(sv) != SVt_PVGV) {
429 if (SvGMAGICAL(sv)) {
435 if (PL_op->op_flags & OPf_REF ||
436 PL_op->op_private & HINT_STRICT_REFS)
437 DIE(no_usym, "an ARRAY");
440 if (GIMME == G_ARRAY)
444 sym = SvPV(sv,PL_na);
445 if (PL_op->op_private & HINT_STRICT_REFS)
446 DIE(no_symref, sym, "an ARRAY");
447 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
452 if (PL_op->op_private & OPpLVAL_INTRO)
454 if (PL_op->op_flags & OPf_REF) {
461 if (GIMME == G_ARRAY) {
462 I32 maxarg = AvFILL(av) + 1;
464 if (SvRMAGICAL(av)) {
466 for (i=0; i < maxarg; i++) {
467 SV **svp = av_fetch(av, i, FALSE);
468 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
472 Copy(AvARRAY(av), SP+1, maxarg, SV*);
478 I32 maxarg = AvFILL(av) + 1;
492 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
493 DIE("Not a HASH reference");
494 if (PL_op->op_flags & OPf_REF) {
500 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
502 if (PL_op->op_flags & OPf_REF) {
510 if (SvTYPE(sv) != SVt_PVGV) {
513 if (SvGMAGICAL(sv)) {
519 if (PL_op->op_flags & OPf_REF ||
520 PL_op->op_private & HINT_STRICT_REFS)
521 DIE(no_usym, "a HASH");
524 if (GIMME == G_ARRAY) {
530 sym = SvPV(sv,PL_na);
531 if (PL_op->op_private & HINT_STRICT_REFS)
532 DIE(no_symref, sym, "a HASH");
533 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
538 if (PL_op->op_private & OPpLVAL_INTRO)
540 if (PL_op->op_flags & OPf_REF) {
547 if (GIMME == G_ARRAY) { /* array wanted */
548 *PL_stack_sp = (SV*)hv;
553 if (SvTYPE(hv) == SVt_PVAV)
554 hv = avhv_keys((AV*)hv);
556 sv_setpvf(TARG, "%ld/%ld",
557 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
569 SV **lastlelem = PL_stack_sp;
570 SV **lastrelem = PL_stack_base + POPMARK;
571 SV **firstrelem = PL_stack_base + POPMARK + 1;
572 SV **firstlelem = lastrelem + 1;
585 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
587 /* If there's a common identifier on both sides we have to take
588 * special care that assigning the identifier on the left doesn't
589 * clobber a value on the right that's used later in the list.
591 if (PL_op->op_private & OPpASSIGN_COMMON) {
592 for (relem = firstrelem; relem <= lastrelem; relem++) {
595 TAINT_NOT; /* Each item is independent */
596 *relem = sv_mortalcopy(sv);
605 while (lelem <= lastlelem) {
606 TAINT_NOT; /* Each item stands on its own, taintwise. */
608 switch (SvTYPE(sv)) {
611 magic = SvMAGICAL(ary) != 0;
614 av_extend(ary, lastrelem - relem);
616 while (relem <= lastrelem) { /* gobble up all the rest */
622 didstore = av_store(ary,i++,sv);
636 magic = SvMAGICAL(hash) != 0;
639 while (relem < lastrelem) { /* gobble up all the rest */
644 sv = &PL_sv_no, relem++;
645 tmpstr = NEWSV(29,0);
647 sv_setsv(tmpstr,*relem); /* value */
649 didstore = hv_store_ent(hash,sv,tmpstr,0);
651 if (SvSMAGICAL(tmpstr))
654 SvREFCNT_dec(tmpstr);
658 if (relem == lastrelem) {
662 if (relem == firstrelem &&
664 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
665 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
666 warn("Reference found where even-sized list expected");
668 warn("Odd number of elements in hash assignment");
670 tmpstr = NEWSV(29,0);
671 didstore = hv_store_ent(hash,*relem,tmpstr,0);
673 if (SvSMAGICAL(tmpstr))
676 SvREFCNT_dec(tmpstr);
685 if (SvTHINKFIRST(sv)) {
686 if (SvREADONLY(sv) && PL_curcop != &PL_compiling) {
689 if (relem <= lastrelem)
696 if (relem <= lastrelem) {
697 sv_setsv(sv, *relem);
701 sv_setsv(sv, &PL_sv_undef);
706 if (PL_delaymagic & ~DM_DELAY) {
707 if (PL_delaymagic & DM_UID) {
709 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
712 (void)setreuid(PL_uid,PL_euid);
715 if ((PL_delaymagic & DM_UID) == DM_RUID) {
716 (void)setruid(PL_uid);
717 PL_delaymagic &= ~DM_RUID;
719 # endif /* HAS_SETRUID */
721 if ((PL_delaymagic & DM_UID) == DM_EUID) {
722 (void)seteuid(PL_uid);
723 PL_delaymagic &= ~DM_EUID;
725 # endif /* HAS_SETEUID */
726 if (PL_delaymagic & DM_UID) {
727 if (PL_uid != PL_euid)
728 DIE("No setreuid available");
729 (void)PerlProc_setuid(PL_uid);
731 # endif /* HAS_SETREUID */
732 #endif /* HAS_SETRESUID */
733 PL_uid = (int)PerlProc_getuid();
734 PL_euid = (int)PerlProc_geteuid();
736 if (PL_delaymagic & DM_GID) {
738 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
741 (void)setregid(PL_gid,PL_egid);
744 if ((PL_delaymagic & DM_GID) == DM_RGID) {
745 (void)setrgid(PL_gid);
746 PL_delaymagic &= ~DM_RGID;
748 # endif /* HAS_SETRGID */
750 if ((PL_delaymagic & DM_GID) == DM_EGID) {
751 (void)setegid(PL_gid);
752 PL_delaymagic &= ~DM_EGID;
754 # endif /* HAS_SETEGID */
755 if (PL_delaymagic & DM_GID) {
756 if (PL_gid != PL_egid)
757 DIE("No setregid available");
758 (void)PerlProc_setgid(PL_gid);
760 # endif /* HAS_SETREGID */
761 #endif /* HAS_SETRESGID */
762 PL_gid = (int)PerlProc_getgid();
763 PL_egid = (int)PerlProc_getegid();
765 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
772 else if (gimme == G_SCALAR) {
775 SETi(lastrelem - firstrelem + 1);
781 SP = firstrelem + (lastlelem - firstlelem);
782 lelem = firstlelem + (relem - firstrelem);
784 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
792 register PMOP *pm = cPMOP;
793 SV *rv = sv_newmortal();
794 SV *sv = newSVrv(rv, "Regexp");
795 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
802 register PMOP *pm = cPMOP;
809 register REGEXP *rx = pm->op_pmregexp;
814 I32 oldsave = PL_savestack_ix;
815 I32 update_minmatch = 1;
818 if (PL_op->op_flags & OPf_STACKED)
824 PUTBACK; /* EVAL blocks need stack_sp. */
828 DIE("panic: do_match");
829 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
830 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
833 if (pm->op_pmdynflags & PMdf_USED) {
835 if (gimme == G_ARRAY)
840 if (!rx->prelen && PL_curpm) {
842 rx = pm->op_pmregexp;
844 if (rx->minlen > len) goto failure;
846 screamer = ( (SvSCREAM(TARG) && rx->check_substr
847 && SvTYPE(rx->check_substr) == SVt_PVBM
848 && SvVALID(rx->check_substr))
851 if (global = pm->op_pmflags & PMf_GLOBAL) {
853 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
854 MAGIC* mg = mg_find(TARG, 'g');
855 if (mg && mg->mg_len >= 0) {
856 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
857 minmatch = (mg->mg_flags & MGf_MINMATCH);
862 safebase = (((gimme == G_ARRAY) || global || !rx->nparens)
863 && !PL_sawampersand);
864 safebase = safebase ? 0 : REXEC_COPY_STR ;
865 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
866 SAVEINT(PL_multiline);
867 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
871 if (global && rx->startp[0]) {
873 if ((s + rx->minlen) > strend)
875 if (update_minmatch++)
876 minmatch = (s == rx->startp[0]);
878 if (rx->check_substr) {
879 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
883 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
885 else if (!(s = screaminstr(TARG, rx->check_substr,
886 rx->check_offset_min, 0, &p, 0)))
888 else if ((rx->reganch & ROPT_CHECK_ALL)
889 && !PL_sawampersand && !SvTAIL(rx->check_substr))
892 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
893 (unsigned char*)strend,
894 rx->check_substr, 0)))
896 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
898 if (s && rx->check_offset_max < s - t) {
899 ++BmUSEFUL(rx->check_substr);
900 s -= rx->check_offset_max;
905 /* Now checkstring is fixed, i.e. at fixed offset from the
906 beginning of match, and the match is anchored at s. */
907 else if (!PL_multiline) { /* Anchored near beginning of string. */
909 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
910 || ((slen = SvCUR(rx->check_substr)) > 1
911 && memNE(SvPVX(rx->check_substr),
912 s + rx->check_offset_min, slen)))
915 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
916 && rx->check_substr == rx->float_substr) {
917 SvREFCNT_dec(rx->check_substr);
918 rx->check_substr = Nullsv; /* opt is being useless */
919 rx->float_substr = Nullsv;
922 if (CALLREGEXEC(rx, s, strend, truebase, minmatch,
923 screamer, NULL, safebase))
926 if (pm->op_pmflags & PMf_ONCE)
927 pm->op_pmdynflags |= PMdf_USED;
936 RX_MATCH_TAINTED_on(rx);
937 TAINT_IF(RX_MATCH_TAINTED(rx));
938 if (gimme == G_ARRAY) {
942 if (global && !iters)
946 SPAGAIN; /* EVAL blocks could move the stack. */
947 EXTEND(SP, iters + i);
948 EXTEND_MORTAL(iters + i);
949 for (i = !i; i <= iters; i++) {
950 PUSHs(sv_newmortal());
952 if ((s = rx->startp[i]) && rx->endp[i] ) {
953 len = rx->endp[i] - s;
954 sv_setpvn(*SP, s, len);
958 truebase = rx->subbeg;
960 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
962 PUTBACK; /* EVAL blocks may use stack */
967 LEAVE_SCOPE(oldsave);
973 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
974 mg = mg_find(TARG, 'g');
976 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
977 mg = mg_find(TARG, 'g');
980 mg->mg_len = rx->endp[0] - rx->subbeg;
981 if (rx->startp[0] == rx->endp[0])
982 mg->mg_flags |= MGf_MINMATCH;
984 mg->mg_flags &= ~MGf_MINMATCH;
987 LEAVE_SCOPE(oldsave);
991 yup: /* Confirmed by check_substr */
993 RX_MATCH_TAINTED_on(rx);
994 TAINT_IF(RX_MATCH_TAINTED(rx));
995 ++BmUSEFUL(rx->check_substr);
997 if (pm->op_pmflags & PMf_ONCE)
998 pm->op_pmdynflags |= PMdf_USED;
999 Safefree(rx->subbase);
1000 rx->subbase = Nullch;
1002 rx->subbeg = truebase;
1003 rx->subend = strend;
1005 rx->endp[0] = s + SvCUR(rx->check_substr);
1008 if (PL_sawampersand) {
1011 tmps = rx->subbase = savepvn(t, strend-t);
1013 rx->subend = tmps + (strend-t);
1014 tmps = rx->startp[0] = tmps + (s - t);
1015 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1017 LEAVE_SCOPE(oldsave);
1021 if (rx->check_substr)
1022 ++BmUSEFUL(rx->check_substr);
1025 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1026 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1027 MAGIC* mg = mg_find(TARG, 'g');
1032 LEAVE_SCOPE(oldsave);
1033 if (gimme == G_ARRAY)
1041 dSP; dTARGETSTACKED;
1046 register IO *io = GvIO(PL_last_in_gv);
1047 register I32 type = PL_op->op_type;
1048 I32 gimme = GIMME_V;
1051 if (SvRMAGICAL(PL_last_in_gv) && (mg = mg_find((SV*)PL_last_in_gv, 'q'))) {
1056 perl_call_method("READLINE", gimme);
1059 if (gimme == G_SCALAR)
1060 SvSetMagicSV_nosteal(TARG, TOPs);
1067 if (IoFLAGS(io) & IOf_ARGV) {
1068 if (IoFLAGS(io) & IOf_START) {
1069 IoFLAGS(io) &= ~IOf_START;
1071 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1072 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1073 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1074 SvSETMAGIC(GvSV(PL_last_in_gv));
1079 fp = nextargv(PL_last_in_gv);
1080 if (!fp) { /* Note: fp != IoIFP(io) */
1081 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1082 IoFLAGS(io) |= IOf_START;
1085 else if (type == OP_GLOB) {
1086 SV *tmpcmd = NEWSV(55, 0);
1090 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1091 /* since spawning off a process is a real performance hit */
1093 #include <descrip.h>
1094 #include <lib$routines.h>
1097 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1098 char vmsspec[NAM$C_MAXRSS+1];
1099 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1100 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1101 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1104 struct dsc$descriptor_s wilddsc
1105 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1106 struct dsc$descriptor_vs rsdsc
1107 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1108 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1110 /* We could find out if there's an explicit dev/dir or version
1111 by peeking into lib$find_file's internal context at
1112 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1113 but that's unsupported, so I don't want to do it now and
1114 have it bite someone in the future. */
1115 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1116 cp = SvPV(tmpglob,i);
1118 if (cp[i] == ';') hasver = 1;
1120 if (sts) hasver = 1;
1124 hasdir = isunix = 1;
1127 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1132 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1134 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1135 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1136 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1137 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1138 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1139 &dfltdsc,NULL,NULL,NULL))&1)) {
1140 end = rstr + (unsigned long int) *rslt;
1141 if (!hasver) while (*end != ';') end--;
1142 *(end++) = '\n'; *end = '\0';
1143 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1145 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1150 while (*(--begin) != ']' && *begin != '>') ;
1153 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1155 if (cxt) (void)lib$find_file_end(&cxt);
1156 if (ok && sts != RMS$_NMF &&
1157 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1160 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1162 PerlIO_close(tmpfp);
1166 PerlIO_rewind(tmpfp);
1168 IoIFP(io) = fp = tmpfp;
1169 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1176 sv_setpv(tmpcmd, "for a in ");
1177 sv_catsv(tmpcmd, tmpglob);
1178 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1181 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1182 sv_catsv(tmpcmd, tmpglob);
1184 sv_setpv(tmpcmd, "perlglob ");
1185 sv_catsv(tmpcmd, tmpglob);
1186 sv_catpv(tmpcmd, " |");
1191 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1192 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1193 sv_catsv(tmpcmd, tmpglob);
1194 sv_catpv(tmpcmd, "' 2>/dev/null |");
1196 sv_setpv(tmpcmd, "echo ");
1197 sv_catsv(tmpcmd, tmpglob);
1199 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1201 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1204 #endif /* !DOSISH */
1205 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1206 FALSE, O_RDONLY, 0, Nullfp);
1212 else if (type == OP_GLOB)
1216 if (PL_dowarn && io && !(IoFLAGS(io) & IOf_START))
1217 warn("Read on closed filehandle <%s>", GvENAME(PL_last_in_gv));
1218 if (gimme == G_SCALAR) {
1219 (void)SvOK_off(TARG);
1225 if (gimme == G_SCALAR) {
1229 (void)SvUPGRADE(sv, SVt_PV);
1230 tmplen = SvLEN(sv); /* remember if already alloced */
1232 Sv_Grow(sv, 80); /* try short-buffering it */
1233 if (type == OP_RCATLINE)
1239 sv = sv_2mortal(NEWSV(57, 80));
1243 if (!sv_gets(sv, fp, offset)) {
1244 PerlIO_clearerr(fp);
1245 if (IoFLAGS(io) & IOf_ARGV) {
1246 fp = nextargv(PL_last_in_gv);
1249 (void)do_close(PL_last_in_gv, FALSE);
1250 IoFLAGS(io) |= IOf_START;
1252 else if (type == OP_GLOB) {
1253 if (!do_close(PL_last_in_gv, FALSE))
1254 warn("internal error: glob failed");
1256 if (gimme == G_SCALAR) {
1257 (void)SvOK_off(TARG);
1262 /* This should not be marked tainted if the fp is marked clean */
1263 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1270 if (type == OP_GLOB) {
1273 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1274 tmps = SvEND(sv) - 1;
1275 if (*tmps == *SvPVX(PL_rs)) {
1280 for (tmps = SvPVX(sv); *tmps; tmps++)
1281 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1282 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1284 if (*tmps && PerlLIO_stat(SvPVX(sv), &PL_statbuf) < 0) {
1285 (void)POPs; /* Unmatched wildcard? Chuck it... */
1289 if (gimme == G_ARRAY) {
1290 if (SvLEN(sv) - SvCUR(sv) > 20) {
1291 SvLEN_set(sv, SvCUR(sv)+1);
1292 Renew(SvPVX(sv), SvLEN(sv), char);
1294 sv = sv_2mortal(NEWSV(58, 80));
1297 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1298 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1302 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1303 Renew(SvPVX(sv), SvLEN(sv), char);
1312 register PERL_CONTEXT *cx;
1313 I32 gimme = OP_GIMME(PL_op, -1);
1316 if (cxstack_ix >= 0)
1317 gimme = cxstack[cxstack_ix].blk_gimme;
1325 PUSHBLOCK(cx, CXt_BLOCK, SP);
1337 U32 lval = PL_op->op_flags & OPf_MOD;
1338 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1341 if (SvTYPE(hv) == SVt_PVHV) {
1342 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1343 svp = he ? &HeVAL(he) : 0;
1345 else if (SvTYPE(hv) == SVt_PVAV) {
1346 if (PL_op->op_private & OPpLVAL_INTRO)
1347 DIE("Can't localize pseudo-hash element");
1348 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1354 if (!svp || *svp == &PL_sv_undef) {
1358 DIE(no_helem, SvPV(keysv, PL_na));
1359 lv = sv_newmortal();
1360 sv_upgrade(lv, SVt_PVLV);
1362 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1363 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1364 LvTARG(lv) = SvREFCNT_inc(hv);
1369 if (PL_op->op_private & OPpLVAL_INTRO) {
1370 if (HvNAME(hv) && isGV(*svp))
1371 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1373 save_helem(hv, keysv, svp);
1375 else if (PL_op->op_private & OPpDEREF)
1376 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1378 sv = (svp ? *svp : &PL_sv_undef);
1379 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1380 * Pushing the magical RHS on to the stack is useless, since
1381 * that magic is soon destined to be misled by the local(),
1382 * and thus the later pp_sassign() will fail to mg_get() the
1383 * old value. This should also cure problems with delayed
1384 * mg_get()s. GSAR 98-07-03 */
1385 if (!lval && SvGMAGICAL(sv))
1386 sv = sv_mortalcopy(sv);
1394 register PERL_CONTEXT *cx;
1400 if (PL_op->op_flags & OPf_SPECIAL) {
1401 cx = &cxstack[cxstack_ix];
1402 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1407 gimme = OP_GIMME(PL_op, -1);
1409 if (cxstack_ix >= 0)
1410 gimme = cxstack[cxstack_ix].blk_gimme;
1416 if (gimme == G_VOID)
1418 else if (gimme == G_SCALAR) {
1421 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1424 *MARK = sv_mortalcopy(TOPs);
1427 *MARK = &PL_sv_undef;
1431 else if (gimme == G_ARRAY) {
1432 /* in case LEAVE wipes old return values */
1433 for (mark = newsp + 1; mark <= SP; mark++) {
1434 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1435 *mark = sv_mortalcopy(*mark);
1436 TAINT_NOT; /* Each item is independent */
1440 PL_curpm = newpm; /* Don't pop $1 et al till now */
1450 register PERL_CONTEXT *cx;
1455 cx = &cxstack[cxstack_ix];
1456 if (cx->cx_type != CXt_LOOP)
1457 DIE("panic: pp_iter");
1459 av = cx->blk_loop.iterary;
1460 if (SvTYPE(av) != SVt_PVAV) {
1461 /* iterate ($min .. $max) */
1462 if (cx->blk_loop.iterlval) {
1463 /* string increment */
1464 register SV* cur = cx->blk_loop.iterlval;
1466 char *max = SvPV((SV*)av, maxlen);
1467 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1468 #ifndef USE_THREADS /* don't risk potential race */
1469 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1470 && !SvMAGICAL(*cx->blk_loop.itervar))
1472 /* safe to reuse old SV */
1473 sv_setsv(*cx->blk_loop.itervar, cur);
1478 /* we need a fresh SV every time so that loop body sees a
1479 * completely new SV for closures/references to work as
1481 SvREFCNT_dec(*cx->blk_loop.itervar);
1482 *cx->blk_loop.itervar = newSVsv(cur);
1484 if (strEQ(SvPVX(cur), max))
1485 sv_setiv(cur, 0); /* terminate next time */
1492 /* integer increment */
1493 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1496 #ifndef USE_THREADS /* don't risk potential race */
1497 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1498 && !SvMAGICAL(*cx->blk_loop.itervar))
1500 /* safe to reuse old SV */
1501 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1506 /* we need a fresh SV every time so that loop body sees a
1507 * completely new SV for closures/references to work as they
1509 SvREFCNT_dec(*cx->blk_loop.itervar);
1510 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1516 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1519 SvREFCNT_dec(*cx->blk_loop.itervar);
1521 if (sv = (SvMAGICAL(av))
1522 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1523 : AvARRAY(av)[++cx->blk_loop.iterix])
1527 if (av != PL_curstack && SvIMMORTAL(sv)) {
1528 SV *lv = cx->blk_loop.iterlval;
1529 if (lv && SvREFCNT(lv) > 1) {
1534 SvREFCNT_dec(LvTARG(lv));
1536 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1537 sv_upgrade(lv, SVt_PVLV);
1539 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1541 LvTARG(lv) = SvREFCNT_inc(av);
1542 LvTARGOFF(lv) = cx->blk_loop.iterix;
1543 LvTARGLEN(lv) = (UV) -1;
1547 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1554 register PMOP *pm = cPMOP;
1570 register REGEXP *rx = pm->op_pmregexp;
1572 int force_on_match = 0;
1573 I32 oldsave = PL_savestack_ix;
1574 I32 update_minmatch = 1;
1577 /* known replacement string? */
1578 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1579 if (PL_op->op_flags & OPf_STACKED)
1585 if (SvREADONLY(TARG)
1586 || (SvTYPE(TARG) > SVt_PVLV
1587 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1591 s = SvPV(TARG, len);
1592 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1594 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1595 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1602 DIE("panic: do_subst");
1605 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1606 position, once with zero-length,
1607 second time with non-zero. */
1609 if (!rx->prelen && PL_curpm) {
1611 rx = pm->op_pmregexp;
1613 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1614 && SvTYPE(rx->check_substr) == SVt_PVBM
1615 && SvVALID(rx->check_substr))
1617 safebase = (!rx->nparens && !PL_sawampersand) ? 0 : REXEC_COPY_STR;
1618 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1619 SAVEINT(PL_multiline);
1620 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1623 if (rx->check_substr) {
1624 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1628 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1630 else if (!(s = screaminstr(TARG, rx->check_substr, rx->check_offset_min, 0, &p, 0)))
1633 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
1634 (unsigned char*)strend,
1635 rx->check_substr, 0)))
1637 if (s && rx->check_offset_max < s - m) {
1638 ++BmUSEFUL(rx->check_substr);
1639 s -= rx->check_offset_max;
1644 /* Now checkstring is fixed, i.e. at fixed offset from the
1645 beginning of match, and the match is anchored at s. */
1646 else if (!PL_multiline) { /* Anchored at beginning of string. */
1648 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
1649 || ((slen = SvCUR(rx->check_substr)) > 1
1650 && memNE(SvPVX(rx->check_substr),
1651 s + rx->check_offset_min, slen)))
1654 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
1655 && rx->check_substr == rx->float_substr) {
1656 SvREFCNT_dec(rx->check_substr);
1657 rx->check_substr = Nullsv; /* opt is being useless */
1658 rx->float_substr = Nullsv;
1662 /* only replace once? */
1663 once = !(rpm->op_pmflags & PMf_GLOBAL);
1665 /* known replacement string? */
1666 c = dstr ? SvPV(dstr, clen) : Nullch;
1668 /* can do inplace substitution? */
1669 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1670 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1671 if (!CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1674 LEAVE_SCOPE(oldsave);
1677 if (force_on_match) {
1679 s = SvPV_force(TARG, len);
1684 SvSCREAM_off(TARG); /* disable possible screamer */
1686 rxtainted |= RX_MATCH_TAINTED(rx);
1688 m = orig + (rx->startp[0] - rx->subbase);
1689 d = orig + (rx->endp[0] - rx->subbase);
1695 if (m - s > strend - d) { /* faster to shorten from end */
1697 Copy(c, m, clen, char);
1702 Move(d, m, i, char);
1706 SvCUR_set(TARG, m - s);
1709 else if (i = m - s) { /* faster from front */
1717 Copy(c, m, clen, char);
1722 Copy(c, d, clen, char);
1727 TAINT_IF(rxtainted & 1);
1733 if (iters++ > maxiters)
1734 DIE("Substitution loop");
1735 rxtainted |= RX_MATCH_TAINTED(rx);
1740 Move(s, d, i, char);
1744 Copy(c, d, clen, char);
1748 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1749 Nullsv, NULL, 0)); /* don't match same null twice */
1752 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1753 Move(s, d, i+1, char); /* include the NUL */
1755 TAINT_IF(rxtainted & 1);
1757 PUSHs(sv_2mortal(newSViv((I32)iters)));
1759 (void)SvPOK_only(TARG);
1760 TAINT_IF(rxtainted);
1761 if (SvSMAGICAL(TARG)) {
1767 LEAVE_SCOPE(oldsave);
1771 if (CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1772 if (force_on_match) {
1774 s = SvPV_force(TARG, len);
1777 rxtainted |= RX_MATCH_TAINTED(rx);
1778 dstr = NEWSV(25, len);
1779 sv_setpvn(dstr, m, s-m);
1782 register PERL_CONTEXT *cx;
1785 RETURNOP(cPMOP->op_pmreplroot);
1788 if (iters++ > maxiters)
1789 DIE("Substitution loop");
1790 rxtainted |= RX_MATCH_TAINTED(rx);
1791 if (rx->subbase && rx->subbase != orig) {
1796 strend = s + (strend - m);
1799 sv_catpvn(dstr, s, m-s);
1802 sv_catpvn(dstr, c, clen);
1805 } while (CALLREGEXEC(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1806 sv_catpvn(dstr, s, strend - s);
1808 (void)SvOOK_off(TARG);
1809 Safefree(SvPVX(TARG));
1810 SvPVX(TARG) = SvPVX(dstr);
1811 SvCUR_set(TARG, SvCUR(dstr));
1812 SvLEN_set(TARG, SvLEN(dstr));
1816 TAINT_IF(rxtainted & 1);
1818 PUSHs(sv_2mortal(newSViv((I32)iters)));
1820 (void)SvPOK_only(TARG);
1821 TAINT_IF(rxtainted);
1824 LEAVE_SCOPE(oldsave);
1830 ++BmUSEFUL(rx->check_substr);
1835 LEAVE_SCOPE(oldsave);
1844 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1845 ++*PL_markstack_ptr;
1846 LEAVE; /* exit inner scope */
1849 if (PL_stack_base + *PL_markstack_ptr > SP) {
1851 I32 gimme = GIMME_V;
1853 LEAVE; /* exit outer scope */
1854 (void)POPMARK; /* pop src */
1855 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1856 (void)POPMARK; /* pop dst */
1857 SP = PL_stack_base + POPMARK; /* pop original mark */
1858 if (gimme == G_SCALAR) {
1862 else if (gimme == G_ARRAY)
1869 ENTER; /* enter inner scope */
1872 src = PL_stack_base[*PL_markstack_ptr];
1876 RETURNOP(cLOGOP->op_other);
1887 register PERL_CONTEXT *cx;
1888 struct block_sub cxsub;
1891 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1894 if (gimme == G_SCALAR) {
1897 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1899 *MARK = SvREFCNT_inc(TOPs);
1904 *MARK = sv_mortalcopy(TOPs);
1907 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1910 *MARK = &PL_sv_undef;
1914 else if (gimme == G_ARRAY) {
1915 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1916 if (!SvTEMP(*MARK)) {
1917 *MARK = sv_mortalcopy(*MARK);
1918 TAINT_NOT; /* Each item is independent */
1924 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1925 PL_curpm = newpm; /* ... and pop $1 et al */
1928 return pop_return();
1932 get_db_sub(SV **svp, CV *cv)
1935 SV *dbsv = GvSV(PL_DBsub);
1937 if (!PERLDB_SUB_NN) {
1941 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1942 || strEQ(GvNAME(gv), "END")
1943 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1944 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1945 && (gv = (GV*)*svp) ))) {
1946 /* Use GV from the stack as a fallback. */
1947 /* GV is potentially non-unique, or contain different CV. */
1948 sv_setsv(dbsv, newRV((SV*)cv));
1951 gv_efullname3(dbsv, gv, Nullch);
1955 SvUPGRADE(dbsv, SVt_PVIV);
1957 SAVEIV(SvIVX(dbsv));
1958 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1962 PL_curcopdb = PL_curcop;
1963 cv = GvCV(PL_DBsub);
1973 register PERL_CONTEXT *cx;
1975 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
1978 DIE("Not a CODE reference");
1979 switch (SvTYPE(sv)) {
1984 if (sv == &PL_sv_yes) { /* unfound import, ignore */
1986 SP = PL_stack_base + POPMARK;
1989 if (SvGMAGICAL(sv)) {
1991 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
1994 sym = SvPV(sv, PL_na);
1996 DIE(no_usym, "a subroutine");
1997 if (PL_op->op_private & HINT_STRICT_REFS)
1998 DIE(no_symref, sym, "a subroutine");
1999 cv = perl_get_cv(sym, TRUE);
2003 if (SvTYPE(cv) == SVt_PVCV)
2008 DIE("Not a CODE reference");
2013 if (!(cv = GvCVu((GV*)sv)))
2014 cv = sv_2cv(sv, &stash, &gv, TRUE);
2023 DIE("Not a CODE reference");
2025 if (!CvROOT(cv) && !CvXSUB(cv)) {
2029 /* anonymous or undef'd function leaves us no recourse */
2030 if (CvANON(cv) || !(gv = CvGV(cv)))
2031 DIE("Undefined subroutine called");
2032 /* autoloaded stub? */
2033 if (cv != GvCV(gv)) {
2037 /* should call AUTOLOAD now? */
2038 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2045 sub_name = sv_newmortal();
2046 gv_efullname3(sub_name, gv, Nullch);
2047 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2051 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2052 cv = get_db_sub(&sv, cv);
2054 DIE("No DBsub routine");
2058 * First we need to check if the sub or method requires locking.
2059 * If so, we gain a lock on the CV, the first argument or the
2060 * stash (for static methods), as appropriate. This has to be
2061 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2062 * reschedule by returning a new op.
2064 MUTEX_LOCK(CvMUTEXP(cv));
2065 if (CvFLAGS(cv) & CVf_LOCKED) {
2067 if (CvFLAGS(cv) & CVf_METHOD) {
2068 if (SP > PL_stack_base + TOPMARK)
2069 sv = *(PL_stack_base + TOPMARK + 1);
2071 MUTEX_UNLOCK(CvMUTEXP(cv));
2072 croak("no argument for locked method call");
2078 char *stashname = SvPV(sv, len);
2079 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2085 MUTEX_UNLOCK(CvMUTEXP(cv));
2086 mg = condpair_magic(sv);
2087 MUTEX_LOCK(MgMUTEXP(mg));
2088 if (MgOWNER(mg) == thr)
2089 MUTEX_UNLOCK(MgMUTEXP(mg));
2092 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2094 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2096 MUTEX_UNLOCK(MgMUTEXP(mg));
2097 SvREFCNT_inc(sv); /* Keep alive until magic_mutexfree */
2098 save_destructor(unlock_condpair, sv);
2100 MUTEX_LOCK(CvMUTEXP(cv));
2103 * Now we have permission to enter the sub, we must distinguish
2104 * four cases. (0) It's an XSUB (in which case we don't care
2105 * about ownership); (1) it's ours already (and we're recursing);
2106 * (2) it's free (but we may already be using a cached clone);
2107 * (3) another thread owns it. Case (1) is easy: we just use it.
2108 * Case (2) means we look for a clone--if we have one, use it
2109 * otherwise grab ownership of cv. Case (3) means we look for a
2110 * clone (for non-XSUBs) and have to create one if we don't
2112 * Why look for a clone in case (2) when we could just grab
2113 * ownership of cv straight away? Well, we could be recursing,
2114 * i.e. we originally tried to enter cv while another thread
2115 * owned it (hence we used a clone) but it has been freed up
2116 * and we're now recursing into it. It may or may not be "better"
2117 * to use the clone but at least CvDEPTH can be trusted.
2119 if (CvOWNER(cv) == thr || CvXSUB(cv))
2120 MUTEX_UNLOCK(CvMUTEXP(cv));
2122 /* Case (2) or (3) */
2126 * XXX Might it be better to release CvMUTEXP(cv) while we
2127 * do the hv_fetch? We might find someone has pinched it
2128 * when we look again, in which case we would be in case
2129 * (3) instead of (2) so we'd have to clone. Would the fact
2130 * that we released the mutex more quickly make up for this?
2133 (svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2135 /* We already have a clone to use */
2136 MUTEX_UNLOCK(CvMUTEXP(cv));
2138 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2139 "entersub: %p already has clone %p:%s\n",
2140 thr, cv, SvPEEK((SV*)cv)));
2143 if (CvDEPTH(cv) == 0)
2144 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2147 /* (2) => grab ownership of cv. (3) => make clone */
2151 MUTEX_UNLOCK(CvMUTEXP(cv));
2152 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2153 "entersub: %p grabbing %p:%s in stash %s\n",
2154 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2155 HvNAME(CvSTASH(cv)) : "(none)"));
2157 /* Make a new clone. */
2159 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2160 MUTEX_UNLOCK(CvMUTEXP(cv));
2161 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2162 "entersub: %p cloning %p:%s\n",
2163 thr, cv, SvPEEK((SV*)cv))));
2165 * We're creating a new clone so there's no race
2166 * between the original MUTEX_UNLOCK and the
2167 * SvREFCNT_inc since no one will be trying to undef
2168 * it out from underneath us. At least, I don't think
2171 clonecv = cv_clone(cv);
2172 SvREFCNT_dec(cv); /* finished with this */
2173 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2174 CvOWNER(clonecv) = thr;
2178 DEBUG_S(if (CvDEPTH(cv) != 0)
2179 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2181 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2184 #endif /* USE_THREADS */
2187 if (CvOLDSTYLE(cv)) {
2188 I32 (*fp3)_((int,int,int));
2190 register I32 items = SP - MARK;
2191 /* We dont worry to copy from @_. */
2196 PL_stack_sp = mark + 1;
2197 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2198 items = (*fp3)(CvXSUBANY(cv).any_i32,
2199 MARK - PL_stack_base + 1,
2201 PL_stack_sp = PL_stack_base + items;
2204 I32 markix = TOPMARK;
2209 /* Need to copy @_ to stack. Alternative may be to
2210 * switch stack to @_, and copy return values
2211 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2215 av = (AV*)PL_curpad[0];
2217 av = GvAV(PL_defgv);
2218 #endif /* USE_THREADS */
2219 items = AvFILLp(av) + 1; /* @_ is not tieable */
2222 /* Mark is at the end of the stack. */
2224 Copy(AvARRAY(av), SP + 1, items, SV*);
2229 if (PL_curcopdb) { /* We assume that the first
2230 XSUB in &DB::sub is the
2232 SAVESPTR(PL_curcop);
2233 PL_curcop = PL_curcopdb;
2236 /* Do we need to open block here? XXXX */
2237 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2239 /* Enforce some sanity in scalar context. */
2240 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2241 if (markix > PL_stack_sp - PL_stack_base)
2242 *(PL_stack_base + markix) = &PL_sv_undef;
2244 *(PL_stack_base + markix) = *PL_stack_sp;
2245 PL_stack_sp = PL_stack_base + markix;
2253 register I32 items = SP - MARK;
2254 AV* padlist = CvPADLIST(cv);
2255 SV** svp = AvARRAY(padlist);
2256 push_return(PL_op->op_next);
2257 PUSHBLOCK(cx, CXt_SUB, MARK);
2260 if (CvDEPTH(cv) < 2)
2261 (void)SvREFCNT_inc(cv);
2262 else { /* save temporaries on recursion? */
2263 if (CvDEPTH(cv) == 100 && PL_dowarn
2264 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2265 sub_crush_depth(cv);
2266 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2268 AV *newpad = newAV();
2269 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2270 I32 ix = AvFILLp((AV*)svp[1]);
2271 svp = AvARRAY(svp[0]);
2272 for ( ;ix > 0; ix--) {
2273 if (svp[ix] != &PL_sv_undef) {
2274 char *name = SvPVX(svp[ix]);
2275 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2276 || *name == '&') /* anonymous code? */
2278 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2280 else { /* our own lexical */
2282 av_store(newpad, ix, sv = (SV*)newAV());
2283 else if (*name == '%')
2284 av_store(newpad, ix, sv = (SV*)newHV());
2286 av_store(newpad, ix, sv = NEWSV(0,0));
2291 av_store(newpad, ix, sv = NEWSV(0,0));
2295 av = newAV(); /* will be @_ */
2297 av_store(newpad, 0, (SV*)av);
2298 AvFLAGS(av) = AVf_REIFY;
2299 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2300 AvFILLp(padlist) = CvDEPTH(cv);
2301 svp = AvARRAY(padlist);
2306 AV* av = (AV*)PL_curpad[0];
2308 items = AvFILLp(av) + 1;
2310 /* Mark is at the end of the stack. */
2312 Copy(AvARRAY(av), SP + 1, items, SV*);
2317 #endif /* USE_THREADS */
2318 SAVESPTR(PL_curpad);
2319 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2322 #endif /* USE_THREADS */
2328 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2329 "%p entersub preparing @_\n", thr));
2331 av = (AV*)PL_curpad[0];
2337 cx->blk_sub.savearray = GvAV(PL_defgv);
2338 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2339 #endif /* USE_THREADS */
2340 cx->blk_sub.argarray = av;
2343 if (items > AvMAX(av) + 1) {
2345 if (AvARRAY(av) != ary) {
2346 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2347 SvPVX(av) = (char*)ary;
2349 if (items > AvMAX(av) + 1) {
2350 AvMAX(av) = items - 1;
2351 Renew(ary,items,SV*);
2353 SvPVX(av) = (char*)ary;
2356 Copy(MARK,AvARRAY(av),items,SV*);
2357 AvFILLp(av) = items - 1;
2366 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2367 "%p entersub returning %p\n", thr, CvSTART(cv)));
2369 RETURNOP(CvSTART(cv));
2374 sub_crush_depth(CV *cv)
2377 warn("Deep recursion on anonymous subroutine");
2379 SV* tmpstr = sv_newmortal();
2380 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2381 warn("Deep recursion on subroutine \"%s\"", SvPVX(tmpstr));
2391 U32 lval = PL_op->op_flags & OPf_MOD;
2392 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2396 elem -= PL_curcop->cop_arybase;
2397 if (SvTYPE(av) != SVt_PVAV)
2399 svp = av_fetch(av, elem, lval && !defer);
2401 if (!svp || *svp == &PL_sv_undef) {
2404 DIE(no_aelem, elem);
2405 lv = sv_newmortal();
2406 sv_upgrade(lv, SVt_PVLV);
2408 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2409 LvTARG(lv) = SvREFCNT_inc(av);
2410 LvTARGOFF(lv) = elem;
2415 if (PL_op->op_private & OPpLVAL_INTRO)
2416 save_aelem(av, elem, svp);
2417 else if (PL_op->op_private & OPpDEREF)
2418 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2420 sv = (svp ? *svp : &PL_sv_undef);
2421 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2422 sv = sv_mortalcopy(sv);
2428 vivify_ref(SV *sv, U32 to_what)
2435 if (SvTYPE(sv) < SVt_RV)
2436 sv_upgrade(sv, SVt_RV);
2437 else if (SvTYPE(sv) >= SVt_PV) {
2438 (void)SvOOK_off(sv);
2439 Safefree(SvPVX(sv));
2440 SvLEN(sv) = SvCUR(sv) = 0;
2444 SvRV(sv) = NEWSV(355,0);
2447 SvRV(sv) = (SV*)newAV();
2450 SvRV(sv) = (SV*)newHV();
2471 if (SvTYPE(sv) == SVt_PVCV) {
2477 name = SvPV(TOPs, PL_na);
2478 sv = *(PL_stack_base + TOPMARK + 1);
2489 !(packname = SvPV(sv, packlen)) ||
2490 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2491 !(ob=(SV*)GvIO(iogv)))
2493 if (!packname || !isIDFIRST(*packname))
2494 DIE("Can't call method \"%s\" %s", name,
2495 SvOK(sv)? "without a package or object reference"
2496 : "on an undefined value");
2497 stash = gv_stashpvn(packname, packlen, TRUE);
2500 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2503 if (!ob || !SvOBJECT(ob))
2504 DIE("Can't call method \"%s\" on unblessed reference", name);
2506 stash = SvSTASH(ob);
2509 gv = gv_fetchmethod(stash, name);
2515 for (p = name; *p; p++) {
2517 sep = p, leaf = p + 1;
2518 else if (*p == ':' && *(p + 1) == ':')
2519 sep = p, leaf = p + 2;
2521 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2522 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2523 packlen = strlen(packname);
2527 packlen = sep - name;
2529 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2530 leaf, (int)packlen, packname);
2532 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);