3 * Copyright (c) 1991-1999, 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;
309 if (PL_op->op_flags & OPf_STACKED)
313 if (mg = SvTIED_mg((SV*)gv, 'q')) {
314 if (MARK == ORIGMARK) {
315 /* If using default handle then we need to make space to
316 * pass object as 1st arg, so move other args up ...
320 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
324 *MARK = SvTIED_obj((SV*)gv, mg);
327 perl_call_method("PRINT", G_SCALAR);
335 if (!(io = GvIO(gv))) {
337 SV* sv = sv_newmortal();
338 gv_fullname3(sv, gv, Nullch);
339 warn("Filehandle %s never opened", SvPV(sv,n_a));
342 SETERRNO(EBADF,RMS$_IFI);
345 else if (!(fp = IoOFP(io))) {
347 SV* sv = sv_newmortal();
348 gv_fullname3(sv, gv, Nullch);
350 warn("Filehandle %s opened only for input", SvPV(sv,n_a));
352 warn("print on closed filehandle %s", SvPV(sv,n_a));
354 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
361 if (!do_print(*MARK, fp))
365 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
374 if (!do_print(*MARK, fp))
383 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
386 if (IoFLAGS(io) & IOf_FLUSH)
387 if (PerlIO_flush(fp) == EOF)
409 if (SvTYPE(av) != SVt_PVAV)
410 DIE("Not an ARRAY reference");
411 if (PL_op->op_flags & OPf_REF) {
417 if (SvTYPE(sv) == SVt_PVAV) {
419 if (PL_op->op_flags & OPf_REF) {
427 if (SvTYPE(sv) != SVt_PVGV) {
431 if (SvGMAGICAL(sv)) {
437 if (PL_op->op_flags & OPf_REF ||
438 PL_op->op_private & HINT_STRICT_REFS)
439 DIE(no_usym, "an ARRAY");
442 if (GIMME == G_ARRAY)
447 if (PL_op->op_private & HINT_STRICT_REFS)
448 DIE(no_symref, sym, "an ARRAY");
449 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
454 if (PL_op->op_private & OPpLVAL_INTRO)
456 if (PL_op->op_flags & OPf_REF) {
463 if (GIMME == G_ARRAY) {
464 I32 maxarg = AvFILL(av) + 1;
466 if (SvRMAGICAL(av)) {
468 for (i=0; i < maxarg; i++) {
469 SV **svp = av_fetch(av, i, FALSE);
470 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
474 Copy(AvARRAY(av), SP+1, maxarg, SV*);
480 I32 maxarg = AvFILL(av) + 1;
494 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
495 DIE("Not a HASH reference");
496 if (PL_op->op_flags & OPf_REF) {
502 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
504 if (PL_op->op_flags & OPf_REF) {
512 if (SvTYPE(sv) != SVt_PVGV) {
516 if (SvGMAGICAL(sv)) {
522 if (PL_op->op_flags & OPf_REF ||
523 PL_op->op_private & HINT_STRICT_REFS)
524 DIE(no_usym, "a HASH");
527 if (GIMME == G_ARRAY) {
534 if (PL_op->op_private & HINT_STRICT_REFS)
535 DIE(no_symref, sym, "a HASH");
536 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
541 if (PL_op->op_private & OPpLVAL_INTRO)
543 if (PL_op->op_flags & OPf_REF) {
550 if (GIMME == G_ARRAY) { /* array wanted */
551 *PL_stack_sp = (SV*)hv;
556 if (SvTYPE(hv) == SVt_PVAV)
557 hv = avhv_keys((AV*)hv);
559 sv_setpvf(TARG, "%ld/%ld",
560 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
572 SV **lastlelem = PL_stack_sp;
573 SV **lastrelem = PL_stack_base + POPMARK;
574 SV **firstrelem = PL_stack_base + POPMARK + 1;
575 SV **firstlelem = lastrelem + 1;
588 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
590 /* If there's a common identifier on both sides we have to take
591 * special care that assigning the identifier on the left doesn't
592 * clobber a value on the right that's used later in the list.
594 if (PL_op->op_private & OPpASSIGN_COMMON) {
595 for (relem = firstrelem; relem <= lastrelem; relem++) {
598 TAINT_NOT; /* Each item is independent */
599 *relem = sv_mortalcopy(sv);
608 while (lelem <= lastlelem) {
609 TAINT_NOT; /* Each item stands on its own, taintwise. */
611 switch (SvTYPE(sv)) {
614 magic = SvMAGICAL(ary) != 0;
617 av_extend(ary, lastrelem - relem);
619 while (relem <= lastrelem) { /* gobble up all the rest */
625 didstore = av_store(ary,i++,sv);
639 magic = SvMAGICAL(hash) != 0;
642 while (relem < lastrelem) { /* gobble up all the rest */
647 sv = &PL_sv_no, relem++;
648 tmpstr = NEWSV(29,0);
650 sv_setsv(tmpstr,*relem); /* value */
652 didstore = hv_store_ent(hash,sv,tmpstr,0);
654 if (SvSMAGICAL(tmpstr))
657 SvREFCNT_dec(tmpstr);
661 if (relem == lastrelem) {
665 if (relem == firstrelem &&
667 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
668 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
669 warn("Reference found where even-sized list expected");
671 warn("Odd number of elements in hash assignment");
673 tmpstr = NEWSV(29,0);
674 didstore = hv_store_ent(hash,*relem,tmpstr,0);
676 if (SvSMAGICAL(tmpstr))
679 SvREFCNT_dec(tmpstr);
688 if (SvTHINKFIRST(sv)) {
689 if (SvREADONLY(sv) && PL_curcop != &PL_compiling) {
692 if (relem <= lastrelem)
699 if (relem <= lastrelem) {
700 sv_setsv(sv, *relem);
704 sv_setsv(sv, &PL_sv_undef);
709 if (PL_delaymagic & ~DM_DELAY) {
710 if (PL_delaymagic & DM_UID) {
712 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
715 (void)setreuid(PL_uid,PL_euid);
718 if ((PL_delaymagic & DM_UID) == DM_RUID) {
719 (void)setruid(PL_uid);
720 PL_delaymagic &= ~DM_RUID;
722 # endif /* HAS_SETRUID */
724 if ((PL_delaymagic & DM_UID) == DM_EUID) {
725 (void)seteuid(PL_uid);
726 PL_delaymagic &= ~DM_EUID;
728 # endif /* HAS_SETEUID */
729 if (PL_delaymagic & DM_UID) {
730 if (PL_uid != PL_euid)
731 DIE("No setreuid available");
732 (void)PerlProc_setuid(PL_uid);
734 # endif /* HAS_SETREUID */
735 #endif /* HAS_SETRESUID */
736 PL_uid = (int)PerlProc_getuid();
737 PL_euid = (int)PerlProc_geteuid();
739 if (PL_delaymagic & DM_GID) {
741 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
744 (void)setregid(PL_gid,PL_egid);
747 if ((PL_delaymagic & DM_GID) == DM_RGID) {
748 (void)setrgid(PL_gid);
749 PL_delaymagic &= ~DM_RGID;
751 # endif /* HAS_SETRGID */
753 if ((PL_delaymagic & DM_GID) == DM_EGID) {
754 (void)setegid(PL_gid);
755 PL_delaymagic &= ~DM_EGID;
757 # endif /* HAS_SETEGID */
758 if (PL_delaymagic & DM_GID) {
759 if (PL_gid != PL_egid)
760 DIE("No setregid available");
761 (void)PerlProc_setgid(PL_gid);
763 # endif /* HAS_SETREGID */
764 #endif /* HAS_SETRESGID */
765 PL_gid = (int)PerlProc_getgid();
766 PL_egid = (int)PerlProc_getegid();
768 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
775 else if (gimme == G_SCALAR) {
778 SETi(lastrelem - firstrelem + 1);
784 SP = firstrelem + (lastlelem - firstlelem);
785 lelem = firstlelem + (relem - firstrelem);
787 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
795 register PMOP *pm = cPMOP;
796 SV *rv = sv_newmortal();
797 SV *sv = newSVrv(rv, "Regexp");
798 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
805 register PMOP *pm = cPMOP;
812 register REGEXP *rx = pm->op_pmregexp;
817 I32 oldsave = PL_savestack_ix;
818 I32 update_minmatch = 1;
821 if (PL_op->op_flags & OPf_STACKED)
827 PUTBACK; /* EVAL blocks need stack_sp. */
831 DIE("panic: do_match");
832 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
833 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
836 if (pm->op_pmdynflags & PMdf_USED) {
838 if (gimme == G_ARRAY)
843 if (!rx->prelen && PL_curpm) {
845 rx = pm->op_pmregexp;
847 if (rx->minlen > len) goto failure;
849 screamer = ( (SvSCREAM(TARG) && rx->check_substr
850 && SvTYPE(rx->check_substr) == SVt_PVBM
851 && SvVALID(rx->check_substr))
854 if (global = pm->op_pmflags & PMf_GLOBAL) {
856 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
857 MAGIC* mg = mg_find(TARG, 'g');
858 if (mg && mg->mg_len >= 0) {
859 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
860 minmatch = (mg->mg_flags & MGf_MINMATCH);
865 safebase = ((gimme != G_ARRAY && !global && rx->nparens)
866 || SvTEMP(TARG) || PL_sawampersand)
867 ? REXEC_COPY_STR : 0;
868 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
869 SAVEINT(PL_multiline);
870 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
874 if (global && rx->startp[0]) {
876 if ((s + rx->minlen) > strend)
878 if (update_minmatch++)
879 minmatch = (s == rx->startp[0]);
881 if (rx->check_substr) {
882 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
886 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
888 else if (!(s = screaminstr(TARG, rx->check_substr,
889 rx->check_offset_min, 0, &p, 0)))
891 else if ((rx->reganch & ROPT_CHECK_ALL)
892 && !PL_sawampersand && !SvTAIL(rx->check_substr))
895 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
896 (unsigned char*)strend,
897 rx->check_substr, 0)))
899 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
901 if (s && rx->check_offset_max < s - t) {
902 ++BmUSEFUL(rx->check_substr);
903 s -= rx->check_offset_max;
908 /* Now checkstring is fixed, i.e. at fixed offset from the
909 beginning of match, and the match is anchored at s. */
910 else if (!PL_multiline) { /* Anchored near beginning of string. */
912 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
913 || ((slen = SvCUR(rx->check_substr)) > 1
914 && memNE(SvPVX(rx->check_substr),
915 s + rx->check_offset_min, slen)))
918 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
919 && rx->check_substr == rx->float_substr) {
920 SvREFCNT_dec(rx->check_substr);
921 rx->check_substr = Nullsv; /* opt is being useless */
922 rx->float_substr = Nullsv;
925 if (CALLREGEXEC(rx, s, strend, truebase, minmatch,
926 screamer, NULL, safebase))
929 if (pm->op_pmflags & PMf_ONCE)
930 pm->op_pmdynflags |= PMdf_USED;
939 RX_MATCH_TAINTED_on(rx);
940 TAINT_IF(RX_MATCH_TAINTED(rx));
941 if (gimme == G_ARRAY) {
945 if (global && !iters)
949 SPAGAIN; /* EVAL blocks could move the stack. */
950 EXTEND(SP, iters + i);
951 EXTEND_MORTAL(iters + i);
952 for (i = !i; i <= iters; i++) {
953 PUSHs(sv_newmortal());
955 if ((s = rx->startp[i]) && rx->endp[i] ) {
956 len = rx->endp[i] - s;
957 sv_setpvn(*SP, s, len);
961 truebase = rx->subbeg;
963 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
965 PUTBACK; /* EVAL blocks may use stack */
970 LEAVE_SCOPE(oldsave);
976 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
977 mg = mg_find(TARG, 'g');
979 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
980 mg = mg_find(TARG, 'g');
983 mg->mg_len = rx->endp[0] - rx->subbeg;
984 if (rx->startp[0] == rx->endp[0])
985 mg->mg_flags |= MGf_MINMATCH;
987 mg->mg_flags &= ~MGf_MINMATCH;
990 LEAVE_SCOPE(oldsave);
994 yup: /* Confirmed by check_substr */
996 RX_MATCH_TAINTED_on(rx);
997 TAINT_IF(RX_MATCH_TAINTED(rx));
998 ++BmUSEFUL(rx->check_substr);
1000 if (pm->op_pmflags & PMf_ONCE)
1001 pm->op_pmdynflags |= PMdf_USED;
1002 Safefree(rx->subbase);
1003 rx->subbase = Nullch;
1005 rx->subbeg = truebase;
1006 rx->subend = strend;
1008 rx->endp[0] = s + SvCUR(rx->check_substr);
1011 if (PL_sawampersand) {
1014 tmps = rx->subbase = savepvn(t, strend-t);
1016 rx->subend = tmps + (strend-t);
1017 tmps = rx->startp[0] = tmps + (s - t);
1018 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1020 LEAVE_SCOPE(oldsave);
1024 if (rx->check_substr)
1025 ++BmUSEFUL(rx->check_substr);
1028 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1029 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1030 MAGIC* mg = mg_find(TARG, 'g');
1035 LEAVE_SCOPE(oldsave);
1036 if (gimme == G_ARRAY)
1044 dSP; dTARGETSTACKED;
1049 register IO *io = GvIO(PL_last_in_gv);
1050 register I32 type = PL_op->op_type;
1051 I32 gimme = GIMME_V;
1054 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1056 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1059 perl_call_method("READLINE", gimme);
1062 if (gimme == G_SCALAR)
1063 SvSetMagicSV_nosteal(TARG, TOPs);
1070 if (IoFLAGS(io) & IOf_ARGV) {
1071 if (IoFLAGS(io) & IOf_START) {
1072 IoFLAGS(io) &= ~IOf_START;
1074 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1075 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1076 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1077 SvSETMAGIC(GvSV(PL_last_in_gv));
1082 fp = nextargv(PL_last_in_gv);
1083 if (!fp) { /* Note: fp != IoIFP(io) */
1084 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1085 IoFLAGS(io) |= IOf_START;
1088 else if (type == OP_GLOB) {
1089 SV *tmpcmd = NEWSV(55, 0);
1093 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1094 /* since spawning off a process is a real performance hit */
1096 #include <descrip.h>
1097 #include <lib$routines.h>
1100 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1101 char vmsspec[NAM$C_MAXRSS+1];
1102 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1103 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1104 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1107 struct dsc$descriptor_s wilddsc
1108 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1109 struct dsc$descriptor_vs rsdsc
1110 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1111 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1113 /* We could find out if there's an explicit dev/dir or version
1114 by peeking into lib$find_file's internal context at
1115 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1116 but that's unsupported, so I don't want to do it now and
1117 have it bite someone in the future. */
1118 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1119 cp = SvPV(tmpglob,i);
1121 if (cp[i] == ';') hasver = 1;
1123 if (sts) hasver = 1;
1127 hasdir = isunix = 1;
1130 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1135 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1137 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1138 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1139 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1140 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1141 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1142 &dfltdsc,NULL,NULL,NULL))&1)) {
1143 end = rstr + (unsigned long int) *rslt;
1144 if (!hasver) while (*end != ';') end--;
1145 *(end++) = '\n'; *end = '\0';
1146 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1148 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1153 while (*(--begin) != ']' && *begin != '>') ;
1156 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1158 if (cxt) (void)lib$find_file_end(&cxt);
1159 if (ok && sts != RMS$_NMF &&
1160 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1163 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1165 PerlIO_close(tmpfp);
1169 PerlIO_rewind(tmpfp);
1171 IoIFP(io) = fp = tmpfp;
1172 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1179 sv_setpv(tmpcmd, "for a in ");
1180 sv_catsv(tmpcmd, tmpglob);
1181 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1184 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1185 sv_catsv(tmpcmd, tmpglob);
1187 sv_setpv(tmpcmd, "perlglob ");
1188 sv_catsv(tmpcmd, tmpglob);
1189 sv_catpv(tmpcmd, " |");
1194 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1195 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1196 sv_catsv(tmpcmd, tmpglob);
1197 sv_catpv(tmpcmd, "' 2>/dev/null |");
1199 sv_setpv(tmpcmd, "echo ");
1200 sv_catsv(tmpcmd, tmpglob);
1202 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1204 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1207 #endif /* !DOSISH */
1208 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1209 FALSE, O_RDONLY, 0, Nullfp);
1215 else if (type == OP_GLOB)
1219 if (PL_dowarn && io && !(IoFLAGS(io) & IOf_START))
1220 warn("Read on closed filehandle <%s>", GvENAME(PL_last_in_gv));
1221 if (gimme == G_SCALAR) {
1222 (void)SvOK_off(TARG);
1228 if (gimme == G_SCALAR) {
1232 (void)SvUPGRADE(sv, SVt_PV);
1233 tmplen = SvLEN(sv); /* remember if already alloced */
1235 Sv_Grow(sv, 80); /* try short-buffering it */
1236 if (type == OP_RCATLINE)
1242 sv = sv_2mortal(NEWSV(57, 80));
1246 /* flip-flop EOF state for a snarfed empty file */
1247 #define SNARF_EOF(gimme,rs,io,sv) \
1248 ((gimme != G_SCALAR || SvCUR(sv) \
1249 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1250 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1251 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1254 if (!sv_gets(sv, fp, offset)
1255 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1257 PerlIO_clearerr(fp);
1258 if (IoFLAGS(io) & IOf_ARGV) {
1259 fp = nextargv(PL_last_in_gv);
1262 (void)do_close(PL_last_in_gv, FALSE);
1263 IoFLAGS(io) |= IOf_START;
1265 else if (type == OP_GLOB) {
1266 if (!do_close(PL_last_in_gv, FALSE)) {
1267 warn("glob failed (child exited with status %d%s)",
1268 STATUS_CURRENT >> 8,
1269 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1272 if (gimme == G_SCALAR) {
1273 (void)SvOK_off(TARG);
1278 /* This should not be marked tainted if the fp is marked clean */
1279 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1286 if (type == OP_GLOB) {
1289 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1290 tmps = SvEND(sv) - 1;
1291 if (*tmps == *SvPVX(PL_rs)) {
1296 for (tmps = SvPVX(sv); *tmps; tmps++)
1297 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1298 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1300 if (*tmps && PerlLIO_stat(SvPVX(sv), &PL_statbuf) < 0) {
1301 (void)POPs; /* Unmatched wildcard? Chuck it... */
1305 if (gimme == G_ARRAY) {
1306 if (SvLEN(sv) - SvCUR(sv) > 20) {
1307 SvLEN_set(sv, SvCUR(sv)+1);
1308 Renew(SvPVX(sv), SvLEN(sv), char);
1310 sv = sv_2mortal(NEWSV(58, 80));
1313 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1314 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1318 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1319 Renew(SvPVX(sv), SvLEN(sv), char);
1328 register PERL_CONTEXT *cx;
1329 I32 gimme = OP_GIMME(PL_op, -1);
1332 if (cxstack_ix >= 0)
1333 gimme = cxstack[cxstack_ix].blk_gimme;
1341 PUSHBLOCK(cx, CXt_BLOCK, SP);
1353 U32 lval = PL_op->op_flags & OPf_MOD;
1354 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1357 if (SvTYPE(hv) == SVt_PVHV) {
1358 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1359 svp = he ? &HeVAL(he) : 0;
1361 else if (SvTYPE(hv) == SVt_PVAV) {
1362 if (PL_op->op_private & OPpLVAL_INTRO)
1363 DIE("Can't localize pseudo-hash element");
1364 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1370 if (!svp || *svp == &PL_sv_undef) {
1375 DIE(no_helem, SvPV(keysv, n_a));
1377 lv = sv_newmortal();
1378 sv_upgrade(lv, SVt_PVLV);
1380 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1381 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1382 LvTARG(lv) = SvREFCNT_inc(hv);
1387 if (PL_op->op_private & OPpLVAL_INTRO) {
1388 if (HvNAME(hv) && isGV(*svp))
1389 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1391 save_helem(hv, keysv, svp);
1393 else if (PL_op->op_private & OPpDEREF)
1394 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1396 sv = (svp ? *svp : &PL_sv_undef);
1397 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1398 * Pushing the magical RHS on to the stack is useless, since
1399 * that magic is soon destined to be misled by the local(),
1400 * and thus the later pp_sassign() will fail to mg_get() the
1401 * old value. This should also cure problems with delayed
1402 * mg_get()s. GSAR 98-07-03 */
1403 if (!lval && SvGMAGICAL(sv))
1404 sv = sv_mortalcopy(sv);
1412 register PERL_CONTEXT *cx;
1418 if (PL_op->op_flags & OPf_SPECIAL) {
1419 cx = &cxstack[cxstack_ix];
1420 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1425 gimme = OP_GIMME(PL_op, -1);
1427 if (cxstack_ix >= 0)
1428 gimme = cxstack[cxstack_ix].blk_gimme;
1434 if (gimme == G_VOID)
1436 else if (gimme == G_SCALAR) {
1439 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1442 *MARK = sv_mortalcopy(TOPs);
1445 *MARK = &PL_sv_undef;
1449 else if (gimme == G_ARRAY) {
1450 /* in case LEAVE wipes old return values */
1451 for (mark = newsp + 1; mark <= SP; mark++) {
1452 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1453 *mark = sv_mortalcopy(*mark);
1454 TAINT_NOT; /* Each item is independent */
1458 PL_curpm = newpm; /* Don't pop $1 et al till now */
1468 register PERL_CONTEXT *cx;
1473 cx = &cxstack[cxstack_ix];
1474 if (CxTYPE(cx) != CXt_LOOP)
1475 DIE("panic: pp_iter");
1477 av = cx->blk_loop.iterary;
1478 if (SvTYPE(av) != SVt_PVAV) {
1479 /* iterate ($min .. $max) */
1480 if (cx->blk_loop.iterlval) {
1481 /* string increment */
1482 register SV* cur = cx->blk_loop.iterlval;
1484 char *max = SvPV((SV*)av, maxlen);
1485 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1486 #ifndef USE_THREADS /* don't risk potential race */
1487 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1488 && !SvMAGICAL(*cx->blk_loop.itervar))
1490 /* safe to reuse old SV */
1491 sv_setsv(*cx->blk_loop.itervar, cur);
1496 /* we need a fresh SV every time so that loop body sees a
1497 * completely new SV for closures/references to work as
1499 SvREFCNT_dec(*cx->blk_loop.itervar);
1500 *cx->blk_loop.itervar = newSVsv(cur);
1502 if (strEQ(SvPVX(cur), max))
1503 sv_setiv(cur, 0); /* terminate next time */
1510 /* integer increment */
1511 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1514 #ifndef USE_THREADS /* don't risk potential race */
1515 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1516 && !SvMAGICAL(*cx->blk_loop.itervar))
1518 /* safe to reuse old SV */
1519 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1524 /* we need a fresh SV every time so that loop body sees a
1525 * completely new SV for closures/references to work as they
1527 SvREFCNT_dec(*cx->blk_loop.itervar);
1528 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1534 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1537 SvREFCNT_dec(*cx->blk_loop.itervar);
1539 if (sv = (SvMAGICAL(av))
1540 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1541 : AvARRAY(av)[++cx->blk_loop.iterix])
1545 if (av != PL_curstack && SvIMMORTAL(sv)) {
1546 SV *lv = cx->blk_loop.iterlval;
1547 if (lv && SvREFCNT(lv) > 1) {
1552 SvREFCNT_dec(LvTARG(lv));
1554 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1555 sv_upgrade(lv, SVt_PVLV);
1557 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1559 LvTARG(lv) = SvREFCNT_inc(av);
1560 LvTARGOFF(lv) = cx->blk_loop.iterix;
1561 LvTARGLEN(lv) = (UV) -1;
1565 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1572 register PMOP *pm = cPMOP;
1588 register REGEXP *rx = pm->op_pmregexp;
1590 int force_on_match = 0;
1591 I32 oldsave = PL_savestack_ix;
1592 I32 update_minmatch = 1;
1595 /* known replacement string? */
1596 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1597 if (PL_op->op_flags & OPf_STACKED)
1603 if (SvREADONLY(TARG)
1604 || (SvTYPE(TARG) > SVt_PVLV
1605 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1609 s = SvPV(TARG, len);
1610 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1612 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1613 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1620 DIE("panic: do_subst");
1623 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1624 position, once with zero-length,
1625 second time with non-zero. */
1627 if (!rx->prelen && PL_curpm) {
1629 rx = pm->op_pmregexp;
1631 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1632 && SvTYPE(rx->check_substr) == SVt_PVBM
1633 && SvVALID(rx->check_substr))
1635 safebase = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1636 ? REXEC_COPY_STR : 0;
1637 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1638 SAVEINT(PL_multiline);
1639 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1642 if (rx->check_substr) {
1643 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1647 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1649 else if (!(s = screaminstr(TARG, rx->check_substr, rx->check_offset_min, 0, &p, 0)))
1652 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
1653 (unsigned char*)strend,
1654 rx->check_substr, 0)))
1656 if (s && rx->check_offset_max < s - m) {
1657 ++BmUSEFUL(rx->check_substr);
1658 s -= rx->check_offset_max;
1663 /* Now checkstring is fixed, i.e. at fixed offset from the
1664 beginning of match, and the match is anchored at s. */
1665 else if (!PL_multiline) { /* Anchored at beginning of string. */
1667 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
1668 || ((slen = SvCUR(rx->check_substr)) > 1
1669 && memNE(SvPVX(rx->check_substr),
1670 s + rx->check_offset_min, slen)))
1673 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
1674 && rx->check_substr == rx->float_substr) {
1675 SvREFCNT_dec(rx->check_substr);
1676 rx->check_substr = Nullsv; /* opt is being useless */
1677 rx->float_substr = Nullsv;
1681 /* only replace once? */
1682 once = !(rpm->op_pmflags & PMf_GLOBAL);
1684 /* known replacement string? */
1685 c = dstr ? SvPV(dstr, clen) : Nullch;
1687 /* can do inplace substitution? */
1688 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1689 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1690 if (!CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1693 LEAVE_SCOPE(oldsave);
1696 if (force_on_match) {
1698 s = SvPV_force(TARG, len);
1703 SvSCREAM_off(TARG); /* disable possible screamer */
1705 rxtainted |= RX_MATCH_TAINTED(rx);
1707 m = orig + (rx->startp[0] - rx->subbase);
1708 d = orig + (rx->endp[0] - rx->subbase);
1714 if (m - s > strend - d) { /* faster to shorten from end */
1716 Copy(c, m, clen, char);
1721 Move(d, m, i, char);
1725 SvCUR_set(TARG, m - s);
1728 else if (i = m - s) { /* faster from front */
1736 Copy(c, m, clen, char);
1741 Copy(c, d, clen, char);
1746 TAINT_IF(rxtainted & 1);
1752 if (iters++ > maxiters)
1753 DIE("Substitution loop");
1754 rxtainted |= RX_MATCH_TAINTED(rx);
1759 Move(s, d, i, char);
1763 Copy(c, d, clen, char);
1767 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1768 Nullsv, NULL, 0)); /* don't match same null twice */
1771 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1772 Move(s, d, i+1, char); /* include the NUL */
1774 TAINT_IF(rxtainted & 1);
1776 PUSHs(sv_2mortal(newSViv((I32)iters)));
1778 (void)SvPOK_only(TARG);
1779 TAINT_IF(rxtainted);
1780 if (SvSMAGICAL(TARG)) {
1786 LEAVE_SCOPE(oldsave);
1790 if (CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1791 if (force_on_match) {
1793 s = SvPV_force(TARG, len);
1796 rxtainted |= RX_MATCH_TAINTED(rx);
1797 dstr = NEWSV(25, len);
1798 sv_setpvn(dstr, m, s-m);
1801 register PERL_CONTEXT *cx;
1804 RETURNOP(cPMOP->op_pmreplroot);
1807 if (iters++ > maxiters)
1808 DIE("Substitution loop");
1809 rxtainted |= RX_MATCH_TAINTED(rx);
1810 if (rx->subbase && rx->subbase != orig) {
1815 strend = s + (strend - m);
1818 sv_catpvn(dstr, s, m-s);
1821 sv_catpvn(dstr, c, clen);
1824 } while (CALLREGEXEC(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1825 sv_catpvn(dstr, s, strend - s);
1827 (void)SvOOK_off(TARG);
1828 Safefree(SvPVX(TARG));
1829 SvPVX(TARG) = SvPVX(dstr);
1830 SvCUR_set(TARG, SvCUR(dstr));
1831 SvLEN_set(TARG, SvLEN(dstr));
1835 TAINT_IF(rxtainted & 1);
1837 PUSHs(sv_2mortal(newSViv((I32)iters)));
1839 (void)SvPOK_only(TARG);
1840 TAINT_IF(rxtainted);
1843 LEAVE_SCOPE(oldsave);
1849 ++BmUSEFUL(rx->check_substr);
1854 LEAVE_SCOPE(oldsave);
1863 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1864 ++*PL_markstack_ptr;
1865 LEAVE; /* exit inner scope */
1868 if (PL_stack_base + *PL_markstack_ptr > SP) {
1870 I32 gimme = GIMME_V;
1872 LEAVE; /* exit outer scope */
1873 (void)POPMARK; /* pop src */
1874 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1875 (void)POPMARK; /* pop dst */
1876 SP = PL_stack_base + POPMARK; /* pop original mark */
1877 if (gimme == G_SCALAR) {
1881 else if (gimme == G_ARRAY)
1888 ENTER; /* enter inner scope */
1891 src = PL_stack_base[*PL_markstack_ptr];
1895 RETURNOP(cLOGOP->op_other);
1906 register PERL_CONTEXT *cx;
1907 struct block_sub cxsub;
1910 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1913 if (gimme == G_SCALAR) {
1916 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1918 *MARK = SvREFCNT_inc(TOPs);
1923 *MARK = sv_mortalcopy(TOPs);
1926 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1929 *MARK = &PL_sv_undef;
1933 else if (gimme == G_ARRAY) {
1934 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1935 if (!SvTEMP(*MARK)) {
1936 *MARK = sv_mortalcopy(*MARK);
1937 TAINT_NOT; /* Each item is independent */
1943 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1944 PL_curpm = newpm; /* ... and pop $1 et al */
1947 return pop_return();
1951 get_db_sub(SV **svp, CV *cv)
1954 SV *dbsv = GvSV(PL_DBsub);
1956 if (!PERLDB_SUB_NN) {
1960 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1961 || strEQ(GvNAME(gv), "END")
1962 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1963 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1964 && (gv = (GV*)*svp) ))) {
1965 /* Use GV from the stack as a fallback. */
1966 /* GV is potentially non-unique, or contain different CV. */
1967 sv_setsv(dbsv, newRV((SV*)cv));
1970 gv_efullname3(dbsv, gv, Nullch);
1974 SvUPGRADE(dbsv, SVt_PVIV);
1976 SAVEIV(SvIVX(dbsv));
1977 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1981 PL_curcopdb = PL_curcop;
1982 cv = GvCV(PL_DBsub);
1992 register PERL_CONTEXT *cx;
1994 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
1997 DIE("Not a CODE reference");
1998 switch (SvTYPE(sv)) {
2004 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2006 SP = PL_stack_base + POPMARK;
2009 if (SvGMAGICAL(sv)) {
2011 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2014 sym = SvPV(sv, n_a);
2016 DIE(no_usym, "a subroutine");
2017 if (PL_op->op_private & HINT_STRICT_REFS)
2018 DIE(no_symref, sym, "a subroutine");
2019 cv = perl_get_cv(sym, TRUE);
2023 if (SvTYPE(cv) == SVt_PVCV)
2028 DIE("Not a CODE reference");
2033 if (!(cv = GvCVu((GV*)sv)))
2034 cv = sv_2cv(sv, &stash, &gv, TRUE);
2043 DIE("Not a CODE reference");
2045 if (!CvROOT(cv) && !CvXSUB(cv)) {
2049 /* anonymous or undef'd function leaves us no recourse */
2050 if (CvANON(cv) || !(gv = CvGV(cv)))
2051 DIE("Undefined subroutine called");
2052 /* autoloaded stub? */
2053 if (cv != GvCV(gv)) {
2057 /* should call AUTOLOAD now? */
2058 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2065 sub_name = sv_newmortal();
2066 gv_efullname3(sub_name, gv, Nullch);
2067 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2071 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2072 cv = get_db_sub(&sv, cv);
2074 DIE("No DBsub routine");
2078 * First we need to check if the sub or method requires locking.
2079 * If so, we gain a lock on the CV, the first argument or the
2080 * stash (for static methods), as appropriate. This has to be
2081 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2082 * reschedule by returning a new op.
2084 MUTEX_LOCK(CvMUTEXP(cv));
2085 if (CvFLAGS(cv) & CVf_LOCKED) {
2087 if (CvFLAGS(cv) & CVf_METHOD) {
2088 if (SP > PL_stack_base + TOPMARK)
2089 sv = *(PL_stack_base + TOPMARK + 1);
2091 MUTEX_UNLOCK(CvMUTEXP(cv));
2092 croak("no argument for locked method call");
2098 char *stashname = SvPV(sv, len);
2099 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2105 MUTEX_UNLOCK(CvMUTEXP(cv));
2106 mg = condpair_magic(sv);
2107 MUTEX_LOCK(MgMUTEXP(mg));
2108 if (MgOWNER(mg) == thr)
2109 MUTEX_UNLOCK(MgMUTEXP(mg));
2112 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2114 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2116 MUTEX_UNLOCK(MgMUTEXP(mg));
2117 save_destructor(unlock_condpair, sv);
2119 MUTEX_LOCK(CvMUTEXP(cv));
2122 * Now we have permission to enter the sub, we must distinguish
2123 * four cases. (0) It's an XSUB (in which case we don't care
2124 * about ownership); (1) it's ours already (and we're recursing);
2125 * (2) it's free (but we may already be using a cached clone);
2126 * (3) another thread owns it. Case (1) is easy: we just use it.
2127 * Case (2) means we look for a clone--if we have one, use it
2128 * otherwise grab ownership of cv. Case (3) means we look for a
2129 * clone (for non-XSUBs) and have to create one if we don't
2131 * Why look for a clone in case (2) when we could just grab
2132 * ownership of cv straight away? Well, we could be recursing,
2133 * i.e. we originally tried to enter cv while another thread
2134 * owned it (hence we used a clone) but it has been freed up
2135 * and we're now recursing into it. It may or may not be "better"
2136 * to use the clone but at least CvDEPTH can be trusted.
2138 if (CvOWNER(cv) == thr || CvXSUB(cv))
2139 MUTEX_UNLOCK(CvMUTEXP(cv));
2141 /* Case (2) or (3) */
2145 * XXX Might it be better to release CvMUTEXP(cv) while we
2146 * do the hv_fetch? We might find someone has pinched it
2147 * when we look again, in which case we would be in case
2148 * (3) instead of (2) so we'd have to clone. Would the fact
2149 * that we released the mutex more quickly make up for this?
2151 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2153 /* We already have a clone to use */
2154 MUTEX_UNLOCK(CvMUTEXP(cv));
2156 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2157 "entersub: %p already has clone %p:%s\n",
2158 thr, cv, SvPEEK((SV*)cv)));
2161 if (CvDEPTH(cv) == 0)
2162 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2165 /* (2) => grab ownership of cv. (3) => make clone */
2169 MUTEX_UNLOCK(CvMUTEXP(cv));
2170 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2171 "entersub: %p grabbing %p:%s in stash %s\n",
2172 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2173 HvNAME(CvSTASH(cv)) : "(none)"));
2175 /* Make a new clone. */
2177 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2178 MUTEX_UNLOCK(CvMUTEXP(cv));
2179 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2180 "entersub: %p cloning %p:%s\n",
2181 thr, cv, SvPEEK((SV*)cv))));
2183 * We're creating a new clone so there's no race
2184 * between the original MUTEX_UNLOCK and the
2185 * SvREFCNT_inc since no one will be trying to undef
2186 * it out from underneath us. At least, I don't think
2189 clonecv = cv_clone(cv);
2190 SvREFCNT_dec(cv); /* finished with this */
2191 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2192 CvOWNER(clonecv) = thr;
2196 DEBUG_S(if (CvDEPTH(cv) != 0)
2197 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2199 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2202 #endif /* USE_THREADS */
2205 if (CvOLDSTYLE(cv)) {
2206 I32 (*fp3)_((int,int,int));
2208 register I32 items = SP - MARK;
2209 /* We dont worry to copy from @_. */
2214 PL_stack_sp = mark + 1;
2215 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2216 items = (*fp3)(CvXSUBANY(cv).any_i32,
2217 MARK - PL_stack_base + 1,
2219 PL_stack_sp = PL_stack_base + items;
2222 I32 markix = TOPMARK;
2227 /* Need to copy @_ to stack. Alternative may be to
2228 * switch stack to @_, and copy return values
2229 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2233 av = (AV*)PL_curpad[0];
2235 av = GvAV(PL_defgv);
2236 #endif /* USE_THREADS */
2237 items = AvFILLp(av) + 1; /* @_ is not tieable */
2240 /* Mark is at the end of the stack. */
2242 Copy(AvARRAY(av), SP + 1, items, SV*);
2247 if (PL_curcopdb) { /* We assume that the first
2248 XSUB in &DB::sub is the
2250 SAVESPTR(PL_curcop);
2251 PL_curcop = PL_curcopdb;
2254 /* Do we need to open block here? XXXX */
2255 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2257 /* Enforce some sanity in scalar context. */
2258 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2259 if (markix > PL_stack_sp - PL_stack_base)
2260 *(PL_stack_base + markix) = &PL_sv_undef;
2262 *(PL_stack_base + markix) = *PL_stack_sp;
2263 PL_stack_sp = PL_stack_base + markix;
2271 register I32 items = SP - MARK;
2272 AV* padlist = CvPADLIST(cv);
2273 SV** svp = AvARRAY(padlist);
2274 push_return(PL_op->op_next);
2275 PUSHBLOCK(cx, CXt_SUB, MARK);
2278 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2279 * that eval'' ops within this sub know the correct lexical space.
2280 * Owing the speed considerations, we choose to search for the cv
2281 * in doeval() instead.
2283 if (CvDEPTH(cv) < 2)
2284 (void)SvREFCNT_inc(cv);
2285 else { /* save temporaries on recursion? */
2286 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2288 AV *newpad = newAV();
2289 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2290 I32 ix = AvFILLp((AV*)svp[1]);
2291 svp = AvARRAY(svp[0]);
2292 for ( ;ix > 0; ix--) {
2293 if (svp[ix] != &PL_sv_undef) {
2294 char *name = SvPVX(svp[ix]);
2295 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2296 || *name == '&') /* anonymous code? */
2298 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2300 else { /* our own lexical */
2302 av_store(newpad, ix, sv = (SV*)newAV());
2303 else if (*name == '%')
2304 av_store(newpad, ix, sv = (SV*)newHV());
2306 av_store(newpad, ix, sv = NEWSV(0,0));
2311 av_store(newpad, ix, sv = NEWSV(0,0));
2315 av = newAV(); /* will be @_ */
2317 av_store(newpad, 0, (SV*)av);
2318 AvFLAGS(av) = AVf_REIFY;
2319 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2320 AvFILLp(padlist) = CvDEPTH(cv);
2321 svp = AvARRAY(padlist);
2326 AV* av = (AV*)PL_curpad[0];
2328 items = AvFILLp(av) + 1;
2330 /* Mark is at the end of the stack. */
2332 Copy(AvARRAY(av), SP + 1, items, SV*);
2337 #endif /* USE_THREADS */
2338 SAVESPTR(PL_curpad);
2339 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2342 #endif /* USE_THREADS */
2348 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2349 "%p entersub preparing @_\n", thr));
2351 av = (AV*)PL_curpad[0];
2357 cx->blk_sub.savearray = GvAV(PL_defgv);
2358 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2359 #endif /* USE_THREADS */
2360 cx->blk_sub.argarray = av;
2363 if (items > AvMAX(av) + 1) {
2365 if (AvARRAY(av) != ary) {
2366 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2367 SvPVX(av) = (char*)ary;
2369 if (items > AvMAX(av) + 1) {
2370 AvMAX(av) = items - 1;
2371 Renew(ary,items,SV*);
2373 SvPVX(av) = (char*)ary;
2376 Copy(MARK,AvARRAY(av),items,SV*);
2377 AvFILLp(av) = items - 1;
2385 /* warning must come *after* we fully set up the context
2386 * stuff so that __WARN__ handlers can safely dounwind()
2389 if (CvDEPTH(cv) == 100 && PL_dowarn
2390 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2391 sub_crush_depth(cv);
2393 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2394 "%p entersub returning %p\n", thr, CvSTART(cv)));
2396 RETURNOP(CvSTART(cv));
2401 sub_crush_depth(CV *cv)
2404 warn("Deep recursion on anonymous subroutine");
2406 SV* tmpstr = sv_newmortal();
2407 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2408 warn("Deep recursion on subroutine \"%s\"", SvPVX(tmpstr));
2418 U32 lval = PL_op->op_flags & OPf_MOD;
2419 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2423 elem -= PL_curcop->cop_arybase;
2424 if (SvTYPE(av) != SVt_PVAV)
2426 svp = av_fetch(av, elem, lval && !defer);
2428 if (!svp || *svp == &PL_sv_undef) {
2431 DIE(no_aelem, elem);
2432 lv = sv_newmortal();
2433 sv_upgrade(lv, SVt_PVLV);
2435 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2436 LvTARG(lv) = SvREFCNT_inc(av);
2437 LvTARGOFF(lv) = elem;
2442 if (PL_op->op_private & OPpLVAL_INTRO)
2443 save_aelem(av, elem, svp);
2444 else if (PL_op->op_private & OPpDEREF)
2445 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2447 sv = (svp ? *svp : &PL_sv_undef);
2448 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2449 sv = sv_mortalcopy(sv);
2455 vivify_ref(SV *sv, U32 to_what)
2462 if (SvTYPE(sv) < SVt_RV)
2463 sv_upgrade(sv, SVt_RV);
2464 else if (SvTYPE(sv) >= SVt_PV) {
2465 (void)SvOOK_off(sv);
2466 Safefree(SvPVX(sv));
2467 SvLEN(sv) = SvCUR(sv) = 0;
2471 SvRV(sv) = NEWSV(355,0);
2474 SvRV(sv) = (SV*)newAV();
2477 SvRV(sv) = (SV*)newHV();
2498 if (SvTYPE(sv) == SVt_PVCV) {
2504 name = SvPV(TOPs, packlen);
2505 sv = *(PL_stack_base + TOPMARK + 1);
2516 !(packname = SvPV(sv, packlen)) ||
2517 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2518 !(ob=(SV*)GvIO(iogv)))
2520 if (!packname || !isIDFIRST(*packname))
2521 DIE("Can't call method \"%s\" %s", name,
2522 SvOK(sv)? "without a package or object reference"
2523 : "on an undefined value");
2524 stash = gv_stashpvn(packname, packlen, TRUE);
2527 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2530 if (!ob || !SvOBJECT(ob))
2531 DIE("Can't call method \"%s\" on unblessed reference", name);
2533 stash = SvSTASH(ob);
2536 gv = gv_fetchmethod(stash, name);
2542 for (p = name; *p; p++) {
2544 sep = p, leaf = p + 1;
2545 else if (*p == ':' && *(p + 1) == ':')
2546 sep = p, leaf = p + 2;
2548 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2549 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2550 packlen = strlen(packname);
2554 packlen = sep - name;
2556 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2557 leaf, (int)packlen, packname);
2559 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);