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 PL_last_in_gv = (GV*)(*PL_stack_sp--);
206 return do_readline();
211 djSP; tryAMAGICbinSET(eq,0);
214 SETs(boolSV(TOPn == value));
222 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
224 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
225 SvIVX(TOPs) != IV_MAX)
228 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
243 RETURNOP(cLOGOP->op_other);
249 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
252 SETn( left + right );
260 AV *av = GvAV((GV*)cSVOP->op_sv);
261 U32 lval = PL_op->op_flags & OPf_MOD;
262 SV** svp = av_fetch(av, PL_op->op_private, lval);
263 SV *sv = (svp ? *svp : &PL_sv_undef);
265 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
266 sv = sv_mortalcopy(sv);
273 djSP; dMARK; dTARGET;
275 do_join(TARG, *MARK, MARK, SP);
286 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
287 * will be enough to hold an OP*.
289 SV* sv = sv_newmortal();
290 sv_upgrade(sv, SVt_PVLV);
292 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
300 /* Oversized hot code. */
304 djSP; dMARK; dORIGMARK;
310 if (PL_op->op_flags & OPf_STACKED)
314 if (SvRMAGICAL(gv) && (mg = mg_find((SV*)gv, 'q'))) {
315 if (MARK == ORIGMARK) {
316 /* If using default handle then we need to make space to
317 * pass object as 1st arg, so move other args up ...
321 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
328 perl_call_method("PRINT", G_SCALAR);
336 if (!(io = GvIO(gv))) {
338 SV* sv = sv_newmortal();
339 gv_fullname3(sv, gv, Nullch);
340 warn("Filehandle %s never opened", SvPV(sv,PL_na));
343 SETERRNO(EBADF,RMS$_IFI);
346 else if (!(fp = IoOFP(io))) {
348 SV* sv = sv_newmortal();
349 gv_fullname3(sv, gv, Nullch);
351 warn("Filehandle %s opened only for input", SvPV(sv,PL_na));
353 warn("print on closed filehandle %s", SvPV(sv,PL_na));
355 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
362 if (!do_print(*MARK, fp))
366 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
375 if (!do_print(*MARK, fp))
384 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
387 if (IoFLAGS(io) & IOf_FLUSH)
388 if (PerlIO_flush(fp) == EOF)
410 if (SvTYPE(av) != SVt_PVAV)
411 DIE("Not an ARRAY reference");
412 if (PL_op->op_flags & OPf_REF) {
418 if (SvTYPE(sv) == SVt_PVAV) {
420 if (PL_op->op_flags & OPf_REF) {
428 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)
446 sym = SvPV(sv,PL_na);
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) {
515 if (SvGMAGICAL(sv)) {
521 if (PL_op->op_flags & OPf_REF ||
522 PL_op->op_private & HINT_STRICT_REFS)
523 DIE(no_usym, "a HASH");
526 if (GIMME == G_ARRAY) {
532 sym = SvPV(sv,PL_na);
533 if (PL_op->op_private & HINT_STRICT_REFS)
534 DIE(no_symref, sym, "a HASH");
535 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
540 if (PL_op->op_private & OPpLVAL_INTRO)
542 if (PL_op->op_flags & OPf_REF) {
549 if (GIMME == G_ARRAY) { /* array wanted */
550 *PL_stack_sp = (SV*)hv;
555 if (SvTYPE(hv) == SVt_PVAV)
556 hv = avhv_keys((AV*)hv);
558 sv_setpvf(TARG, "%ld/%ld",
559 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
571 SV **lastlelem = PL_stack_sp;
572 SV **lastrelem = PL_stack_base + POPMARK;
573 SV **firstrelem = PL_stack_base + POPMARK + 1;
574 SV **firstlelem = lastrelem + 1;
587 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
589 /* If there's a common identifier on both sides we have to take
590 * special care that assigning the identifier on the left doesn't
591 * clobber a value on the right that's used later in the list.
593 if (PL_op->op_private & OPpASSIGN_COMMON) {
594 for (relem = firstrelem; relem <= lastrelem; relem++) {
597 TAINT_NOT; /* Each item is independent */
598 *relem = sv_mortalcopy(sv);
607 while (lelem <= lastlelem) {
608 TAINT_NOT; /* Each item stands on its own, taintwise. */
610 switch (SvTYPE(sv)) {
613 magic = SvMAGICAL(ary) != 0;
616 av_extend(ary, lastrelem - relem);
618 while (relem <= lastrelem) { /* gobble up all the rest */
624 didstore = av_store(ary,i++,sv);
638 magic = SvMAGICAL(hash) != 0;
641 while (relem < lastrelem) { /* gobble up all the rest */
646 sv = &PL_sv_no, relem++;
647 tmpstr = NEWSV(29,0);
649 sv_setsv(tmpstr,*relem); /* value */
651 didstore = hv_store_ent(hash,sv,tmpstr,0);
653 if (SvSMAGICAL(tmpstr))
656 SvREFCNT_dec(tmpstr);
660 if (relem == lastrelem) {
664 if (relem == firstrelem &&
666 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
667 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
668 warn("Reference found where even-sized list expected");
670 warn("Odd number of elements in hash assignment");
672 tmpstr = NEWSV(29,0);
673 didstore = hv_store_ent(hash,*relem,tmpstr,0);
675 if (SvSMAGICAL(tmpstr))
678 SvREFCNT_dec(tmpstr);
687 if (SvTHINKFIRST(sv)) {
688 if (SvREADONLY(sv) && PL_curcop != &PL_compiling) {
691 if (relem <= lastrelem)
698 if (relem <= lastrelem) {
699 sv_setsv(sv, *relem);
703 sv_setsv(sv, &PL_sv_undef);
708 if (PL_delaymagic & ~DM_DELAY) {
709 if (PL_delaymagic & DM_UID) {
711 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
714 (void)setreuid(PL_uid,PL_euid);
717 if ((PL_delaymagic & DM_UID) == DM_RUID) {
718 (void)setruid(PL_uid);
719 PL_delaymagic &= ~DM_RUID;
721 # endif /* HAS_SETRUID */
723 if ((PL_delaymagic & DM_UID) == DM_EUID) {
724 (void)seteuid(PL_uid);
725 PL_delaymagic &= ~DM_EUID;
727 # endif /* HAS_SETEUID */
728 if (PL_delaymagic & DM_UID) {
729 if (PL_uid != PL_euid)
730 DIE("No setreuid available");
731 (void)PerlProc_setuid(PL_uid);
733 # endif /* HAS_SETREUID */
734 #endif /* HAS_SETRESUID */
735 PL_uid = (int)PerlProc_getuid();
736 PL_euid = (int)PerlProc_geteuid();
738 if (PL_delaymagic & DM_GID) {
740 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
743 (void)setregid(PL_gid,PL_egid);
746 if ((PL_delaymagic & DM_GID) == DM_RGID) {
747 (void)setrgid(PL_gid);
748 PL_delaymagic &= ~DM_RGID;
750 # endif /* HAS_SETRGID */
752 if ((PL_delaymagic & DM_GID) == DM_EGID) {
753 (void)setegid(PL_gid);
754 PL_delaymagic &= ~DM_EGID;
756 # endif /* HAS_SETEGID */
757 if (PL_delaymagic & DM_GID) {
758 if (PL_gid != PL_egid)
759 DIE("No setregid available");
760 (void)PerlProc_setgid(PL_gid);
762 # endif /* HAS_SETREGID */
763 #endif /* HAS_SETRESGID */
764 PL_gid = (int)PerlProc_getgid();
765 PL_egid = (int)PerlProc_getegid();
767 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
774 else if (gimme == G_SCALAR) {
777 SETi(lastrelem - firstrelem + 1);
783 SP = firstrelem + (lastlelem - firstlelem);
784 lelem = firstlelem + (relem - firstrelem);
786 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
794 register PMOP *pm = cPMOP;
795 SV *rv = sv_newmortal();
796 SV *sv = newSVrv(rv, "Regexp");
797 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
804 register PMOP *pm = cPMOP;
811 register REGEXP *rx = pm->op_pmregexp;
816 I32 oldsave = PL_savestack_ix;
817 I32 update_minmatch = 1;
820 if (PL_op->op_flags & OPf_STACKED)
826 PUTBACK; /* EVAL blocks need stack_sp. */
830 DIE("panic: do_match");
831 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
832 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
835 if (pm->op_pmdynflags & PMdf_USED) {
837 if (gimme == G_ARRAY)
842 if (!rx->prelen && PL_curpm) {
844 rx = pm->op_pmregexp;
846 if (rx->minlen > len) goto failure;
848 screamer = ( (SvSCREAM(TARG) && rx->check_substr
849 && SvTYPE(rx->check_substr) == SVt_PVBM
850 && SvVALID(rx->check_substr))
853 if (global = pm->op_pmflags & PMf_GLOBAL) {
855 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
856 MAGIC* mg = mg_find(TARG, 'g');
857 if (mg && mg->mg_len >= 0) {
858 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
859 minmatch = (mg->mg_flags & MGf_MINMATCH);
864 safebase = (((gimme == G_ARRAY) || global || !rx->nparens)
865 && !PL_sawampersand);
866 safebase = safebase ? 0 : REXEC_COPY_STR ;
867 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
868 SAVEINT(PL_multiline);
869 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
873 if (global && rx->startp[0]) {
875 if ((s + rx->minlen) > strend)
877 if (update_minmatch++)
878 minmatch = (s == rx->startp[0]);
880 if (rx->check_substr) {
881 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
886 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
889 b = HOP((U8*)s, rx->check_offset_min);
890 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
893 if ((rx->reganch & ROPT_CHECK_ALL)
894 && !PL_sawampersand && !SvTAIL(rx->check_substr))
897 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
898 (unsigned char*)strend,
899 rx->check_substr, 0)))
901 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
903 if (s && rx->check_offset_max < s - t) {
904 ++BmUSEFUL(rx->check_substr);
905 s = HOP((U8*)s, -rx->check_offset_max);
910 /* Now checkstring is fixed, i.e. at fixed offset from the
911 beginning of match, and the match is anchored at s. */
912 else if (!PL_multiline) { /* Anchored near beginning of string. */
914 char *b = HOP((U8*)s, rx->check_offset_min);
915 if (*SvPVX(rx->check_substr) != *b
916 || ((slen = SvCUR(rx->check_substr)) > 1
917 && memNE(SvPVX(rx->check_substr), b, slen)))
920 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
921 && rx->check_substr == rx->float_substr) {
922 SvREFCNT_dec(rx->check_substr);
923 rx->check_substr = Nullsv; /* opt is being useless */
924 rx->float_substr = Nullsv;
927 if (CALLREGEXEC(rx, s, strend, truebase, minmatch,
928 screamer, NULL, safebase))
931 if (pm->op_pmflags & PMf_ONCE)
932 pm->op_pmdynflags |= PMdf_USED;
941 RX_MATCH_TAINTED_on(rx);
942 TAINT_IF(RX_MATCH_TAINTED(rx));
943 if (gimme == G_ARRAY) {
947 if (global && !iters)
951 SPAGAIN; /* EVAL blocks could move the stack. */
952 EXTEND(SP, iters + i);
953 EXTEND_MORTAL(iters + i);
954 for (i = !i; i <= iters; i++) {
955 PUSHs(sv_newmortal());
957 if ((s = rx->startp[i]) && rx->endp[i] ) {
958 len = rx->endp[i] - s;
959 sv_setpvn(*SP, s, len);
963 truebase = rx->subbeg;
965 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
967 PUTBACK; /* EVAL blocks may use stack */
972 LEAVE_SCOPE(oldsave);
978 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
979 mg = mg_find(TARG, 'g');
981 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
982 mg = mg_find(TARG, 'g');
985 mg->mg_len = rx->endp[0] - rx->subbeg;
986 if (rx->startp[0] == rx->endp[0])
987 mg->mg_flags |= MGf_MINMATCH;
989 mg->mg_flags &= ~MGf_MINMATCH;
992 LEAVE_SCOPE(oldsave);
996 yup: /* Confirmed by check_substr */
998 RX_MATCH_TAINTED_on(rx);
999 TAINT_IF(RX_MATCH_TAINTED(rx));
1000 ++BmUSEFUL(rx->check_substr);
1002 if (pm->op_pmflags & PMf_ONCE)
1003 pm->op_pmdynflags |= PMdf_USED;
1004 Safefree(rx->subbase);
1005 rx->subbase = Nullch;
1007 rx->subbeg = truebase;
1008 rx->subend = strend;
1010 rx->endp[0] = s + SvCUR(rx->check_substr);
1013 if (PL_sawampersand) {
1016 tmps = rx->subbase = savepvn(t, strend-t);
1018 rx->subend = tmps + (strend-t);
1019 tmps = rx->startp[0] = tmps + (s - t);
1020 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1022 LEAVE_SCOPE(oldsave);
1026 if (rx->check_substr)
1027 ++BmUSEFUL(rx->check_substr);
1030 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1031 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1032 MAGIC* mg = mg_find(TARG, 'g');
1037 LEAVE_SCOPE(oldsave);
1038 if (gimme == G_ARRAY)
1046 dSP; dTARGETSTACKED;
1051 register IO *io = GvIO(PL_last_in_gv);
1052 register I32 type = PL_op->op_type;
1053 I32 gimme = GIMME_V;
1056 if (SvRMAGICAL(PL_last_in_gv) && (mg = mg_find((SV*)PL_last_in_gv, 'q'))) {
1061 perl_call_method("READLINE", gimme);
1064 if (gimme == G_SCALAR)
1065 SvSetMagicSV_nosteal(TARG, TOPs);
1072 if (IoFLAGS(io) & IOf_ARGV) {
1073 if (IoFLAGS(io) & IOf_START) {
1074 IoFLAGS(io) &= ~IOf_START;
1076 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1077 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1078 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1079 SvSETMAGIC(GvSV(PL_last_in_gv));
1084 fp = nextargv(PL_last_in_gv);
1085 if (!fp) { /* Note: fp != IoIFP(io) */
1086 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1087 IoFLAGS(io) |= IOf_START;
1090 else if (type == OP_GLOB) {
1091 SV *tmpcmd = NEWSV(55, 0);
1095 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1096 /* since spawning off a process is a real performance hit */
1098 #include <descrip.h>
1099 #include <lib$routines.h>
1102 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1103 char vmsspec[NAM$C_MAXRSS+1];
1104 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1105 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1106 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1109 struct dsc$descriptor_s wilddsc
1110 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1111 struct dsc$descriptor_vs rsdsc
1112 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1113 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1115 /* We could find out if there's an explicit dev/dir or version
1116 by peeking into lib$find_file's internal context at
1117 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1118 but that's unsupported, so I don't want to do it now and
1119 have it bite someone in the future. */
1120 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1121 cp = SvPV(tmpglob,i);
1123 if (cp[i] == ';') hasver = 1;
1125 if (sts) hasver = 1;
1129 hasdir = isunix = 1;
1132 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1137 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1139 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1140 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1141 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1142 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1143 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1144 &dfltdsc,NULL,NULL,NULL))&1)) {
1145 end = rstr + (unsigned long int) *rslt;
1146 if (!hasver) while (*end != ';') end--;
1147 *(end++) = '\n'; *end = '\0';
1148 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1150 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1155 while (*(--begin) != ']' && *begin != '>') ;
1158 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1160 if (cxt) (void)lib$find_file_end(&cxt);
1161 if (ok && sts != RMS$_NMF &&
1162 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1165 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1167 PerlIO_close(tmpfp);
1171 PerlIO_rewind(tmpfp);
1173 IoIFP(io) = fp = tmpfp;
1174 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1181 sv_setpv(tmpcmd, "for a in ");
1182 sv_catsv(tmpcmd, tmpglob);
1183 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1186 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1187 sv_catsv(tmpcmd, tmpglob);
1189 sv_setpv(tmpcmd, "perlglob ");
1190 sv_catsv(tmpcmd, tmpglob);
1191 sv_catpv(tmpcmd, " |");
1196 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1197 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1198 sv_catsv(tmpcmd, tmpglob);
1199 sv_catpv(tmpcmd, "' 2>/dev/null |");
1201 sv_setpv(tmpcmd, "echo ");
1202 sv_catsv(tmpcmd, tmpglob);
1204 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1206 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1209 #endif /* !DOSISH */
1210 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1211 FALSE, O_RDONLY, 0, Nullfp);
1217 else if (type == OP_GLOB)
1221 if (PL_dowarn && io && !(IoFLAGS(io) & IOf_START))
1222 warn("Read on closed filehandle <%s>", GvENAME(PL_last_in_gv));
1223 if (gimme == G_SCALAR) {
1224 (void)SvOK_off(TARG);
1230 if (gimme == G_SCALAR) {
1234 (void)SvUPGRADE(sv, SVt_PV);
1235 tmplen = SvLEN(sv); /* remember if already alloced */
1237 Sv_Grow(sv, 80); /* try short-buffering it */
1238 if (type == OP_RCATLINE)
1244 sv = sv_2mortal(NEWSV(57, 80));
1248 if (!sv_gets(sv, fp, offset)) {
1249 PerlIO_clearerr(fp);
1250 if (IoFLAGS(io) & IOf_ARGV) {
1251 fp = nextargv(PL_last_in_gv);
1254 (void)do_close(PL_last_in_gv, FALSE);
1255 IoFLAGS(io) |= IOf_START;
1257 else if (type == OP_GLOB) {
1258 if (!do_close(PL_last_in_gv, FALSE))
1259 warn("internal error: glob failed");
1261 if (gimme == G_SCALAR) {
1262 (void)SvOK_off(TARG);
1267 /* This should not be marked tainted if the fp is marked clean */
1268 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1275 if (type == OP_GLOB) {
1278 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1279 tmps = SvEND(sv) - 1;
1280 if (*tmps == *SvPVX(PL_rs)) {
1285 for (tmps = SvPVX(sv); *tmps; tmps++)
1286 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1287 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1289 if (*tmps && PerlLIO_stat(SvPVX(sv), &PL_statbuf) < 0) {
1290 (void)POPs; /* Unmatched wildcard? Chuck it... */
1294 if (gimme == G_ARRAY) {
1295 if (SvLEN(sv) - SvCUR(sv) > 20) {
1296 SvLEN_set(sv, SvCUR(sv)+1);
1297 Renew(SvPVX(sv), SvLEN(sv), char);
1299 sv = sv_2mortal(NEWSV(58, 80));
1302 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1303 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1307 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1308 Renew(SvPVX(sv), SvLEN(sv), char);
1317 register PERL_CONTEXT *cx;
1318 I32 gimme = OP_GIMME(PL_op, -1);
1321 if (cxstack_ix >= 0)
1322 gimme = cxstack[cxstack_ix].blk_gimme;
1330 PUSHBLOCK(cx, CXt_BLOCK, SP);
1342 U32 lval = PL_op->op_flags & OPf_MOD;
1343 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1346 if (SvTYPE(hv) == SVt_PVHV) {
1347 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1348 svp = he ? &HeVAL(he) : 0;
1350 else if (SvTYPE(hv) == SVt_PVAV) {
1351 if (PL_op->op_private & OPpLVAL_INTRO)
1352 DIE("Can't localize pseudo-hash element");
1353 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1359 if (!svp || *svp == &PL_sv_undef) {
1363 DIE(no_helem, SvPV(keysv, PL_na));
1364 lv = sv_newmortal();
1365 sv_upgrade(lv, SVt_PVLV);
1367 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1368 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1369 LvTARG(lv) = SvREFCNT_inc(hv);
1374 if (PL_op->op_private & OPpLVAL_INTRO) {
1375 if (HvNAME(hv) && isGV(*svp))
1376 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1378 save_helem(hv, keysv, svp);
1380 else if (PL_op->op_private & OPpDEREF)
1381 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1383 sv = (svp ? *svp : &PL_sv_undef);
1384 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1385 * Pushing the magical RHS on to the stack is useless, since
1386 * that magic is soon destined to be misled by the local(),
1387 * and thus the later pp_sassign() will fail to mg_get() the
1388 * old value. This should also cure problems with delayed
1389 * mg_get()s. GSAR 98-07-03 */
1390 if (!lval && SvGMAGICAL(sv))
1391 sv = sv_mortalcopy(sv);
1399 register PERL_CONTEXT *cx;
1405 if (PL_op->op_flags & OPf_SPECIAL) {
1406 cx = &cxstack[cxstack_ix];
1407 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1412 gimme = OP_GIMME(PL_op, -1);
1414 if (cxstack_ix >= 0)
1415 gimme = cxstack[cxstack_ix].blk_gimme;
1421 if (gimme == G_VOID)
1423 else if (gimme == G_SCALAR) {
1426 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1429 *MARK = sv_mortalcopy(TOPs);
1432 *MARK = &PL_sv_undef;
1436 else if (gimme == G_ARRAY) {
1437 /* in case LEAVE wipes old return values */
1438 for (mark = newsp + 1; mark <= SP; mark++) {
1439 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1440 *mark = sv_mortalcopy(*mark);
1441 TAINT_NOT; /* Each item is independent */
1445 PL_curpm = newpm; /* Don't pop $1 et al till now */
1455 register PERL_CONTEXT *cx;
1460 cx = &cxstack[cxstack_ix];
1461 if (cx->cx_type != CXt_LOOP)
1462 DIE("panic: pp_iter");
1464 av = cx->blk_loop.iterary;
1465 if (SvTYPE(av) != SVt_PVAV) {
1466 /* iterate ($min .. $max) */
1467 if (cx->blk_loop.iterlval) {
1468 /* string increment */
1469 register SV* cur = cx->blk_loop.iterlval;
1471 char *max = SvPV((SV*)av, maxlen);
1472 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1473 #ifndef USE_THREADS /* don't risk potential race */
1474 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1475 && !SvMAGICAL(*cx->blk_loop.itervar))
1477 /* safe to reuse old SV */
1478 sv_setsv(*cx->blk_loop.itervar, cur);
1483 /* we need a fresh SV every time so that loop body sees a
1484 * completely new SV for closures/references to work as
1486 SvREFCNT_dec(*cx->blk_loop.itervar);
1487 *cx->blk_loop.itervar = newSVsv(cur);
1489 if (strEQ(SvPVX(cur), max))
1490 sv_setiv(cur, 0); /* terminate next time */
1497 /* integer increment */
1498 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1501 #ifndef USE_THREADS /* don't risk potential race */
1502 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1503 && !SvMAGICAL(*cx->blk_loop.itervar))
1505 /* safe to reuse old SV */
1506 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1511 /* we need a fresh SV every time so that loop body sees a
1512 * completely new SV for closures/references to work as they
1514 SvREFCNT_dec(*cx->blk_loop.itervar);
1515 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1521 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1524 SvREFCNT_dec(*cx->blk_loop.itervar);
1526 if (sv = (SvMAGICAL(av))
1527 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1528 : AvARRAY(av)[++cx->blk_loop.iterix])
1532 if (av != PL_curstack && SvIMMORTAL(sv)) {
1533 SV *lv = cx->blk_loop.iterlval;
1534 if (lv && SvREFCNT(lv) > 1) {
1539 SvREFCNT_dec(LvTARG(lv));
1541 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1542 sv_upgrade(lv, SVt_PVLV);
1544 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1546 LvTARG(lv) = SvREFCNT_inc(av);
1547 LvTARGOFF(lv) = cx->blk_loop.iterix;
1548 LvTARGLEN(lv) = (UV) -1;
1552 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1559 register PMOP *pm = cPMOP;
1575 register REGEXP *rx = pm->op_pmregexp;
1577 int force_on_match = 0;
1578 I32 oldsave = PL_savestack_ix;
1579 I32 update_minmatch = 1;
1582 /* known replacement string? */
1583 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1584 if (PL_op->op_flags & OPf_STACKED)
1590 if (SvREADONLY(TARG)
1591 || (SvTYPE(TARG) > SVt_PVLV
1592 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1596 s = SvPV(TARG, len);
1597 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1599 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1600 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1607 DIE("panic: do_subst");
1610 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1611 position, once with zero-length,
1612 second time with non-zero. */
1614 if (!rx->prelen && PL_curpm) {
1616 rx = pm->op_pmregexp;
1618 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1619 && SvTYPE(rx->check_substr) == SVt_PVBM
1620 && SvVALID(rx->check_substr))
1622 safebase = (!rx->nparens && !PL_sawampersand) ? 0 : REXEC_COPY_STR;
1623 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1624 SAVEINT(PL_multiline);
1625 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1628 if (rx->check_substr) {
1629 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1634 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1637 b = HOP((U8*)s, rx->check_offset_min);
1638 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
1641 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
1642 (unsigned char*)strend,
1643 rx->check_substr, 0)))
1645 if (s && rx->check_offset_max < s - m) {
1646 ++BmUSEFUL(rx->check_substr);
1647 s = HOP((U8*)s, -rx->check_offset_max);
1652 /* Now checkstring is fixed, i.e. at fixed offset from the
1653 beginning of match, and the match is anchored at s. */
1654 else if (!PL_multiline) { /* Anchored at beginning of string. */
1656 char *b = HOP((U8*)s, rx->check_offset_min);
1657 if (*SvPVX(rx->check_substr) != *b
1658 || ((slen = SvCUR(rx->check_substr)) > 1
1659 && memNE(SvPVX(rx->check_substr), b, slen)))
1662 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
1663 && rx->check_substr == rx->float_substr) {
1664 SvREFCNT_dec(rx->check_substr);
1665 rx->check_substr = Nullsv; /* opt is being useless */
1666 rx->float_substr = Nullsv;
1670 /* only replace once? */
1671 once = !(rpm->op_pmflags & PMf_GLOBAL);
1673 /* known replacement string? */
1674 c = dstr ? SvPV(dstr, clen) : Nullch;
1676 /* can do inplace substitution? */
1677 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1678 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1679 if (!CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1682 LEAVE_SCOPE(oldsave);
1685 if (force_on_match) {
1687 s = SvPV_force(TARG, len);
1692 SvSCREAM_off(TARG); /* disable possible screamer */
1694 rxtainted |= RX_MATCH_TAINTED(rx);
1696 m = orig + (rx->startp[0] - rx->subbase);
1697 d = orig + (rx->endp[0] - rx->subbase);
1703 if (m - s > strend - d) { /* faster to shorten from end */
1705 Copy(c, m, clen, char);
1710 Move(d, m, i, char);
1714 SvCUR_set(TARG, m - s);
1717 else if (i = m - s) { /* faster from front */
1725 Copy(c, m, clen, char);
1730 Copy(c, d, clen, char);
1735 TAINT_IF(rxtainted & 1);
1741 if (iters++ > maxiters)
1742 DIE("Substitution loop");
1743 rxtainted |= RX_MATCH_TAINTED(rx);
1748 Move(s, d, i, char);
1752 Copy(c, d, clen, char);
1756 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1757 Nullsv, NULL, 0)); /* don't match same null twice */
1760 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1761 Move(s, d, i+1, char); /* include the NUL */
1763 TAINT_IF(rxtainted & 1);
1765 PUSHs(sv_2mortal(newSViv((I32)iters)));
1767 (void)SvPOK_only(TARG);
1768 TAINT_IF(rxtainted);
1769 if (SvSMAGICAL(TARG)) {
1775 LEAVE_SCOPE(oldsave);
1779 if (CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1780 if (force_on_match) {
1782 s = SvPV_force(TARG, len);
1785 rxtainted |= RX_MATCH_TAINTED(rx);
1786 dstr = NEWSV(25, len);
1787 sv_setpvn(dstr, m, s-m);
1790 register PERL_CONTEXT *cx;
1793 RETURNOP(cPMOP->op_pmreplroot);
1796 if (iters++ > maxiters)
1797 DIE("Substitution loop");
1798 rxtainted |= RX_MATCH_TAINTED(rx);
1799 if (rx->subbase && rx->subbase != orig) {
1804 strend = s + (strend - m);
1807 sv_catpvn(dstr, s, m-s);
1810 sv_catpvn(dstr, c, clen);
1813 } while (CALLREGEXEC(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1814 sv_catpvn(dstr, s, strend - s);
1816 (void)SvOOK_off(TARG);
1817 Safefree(SvPVX(TARG));
1818 SvPVX(TARG) = SvPVX(dstr);
1819 SvCUR_set(TARG, SvCUR(dstr));
1820 SvLEN_set(TARG, SvLEN(dstr));
1824 TAINT_IF(rxtainted & 1);
1826 PUSHs(sv_2mortal(newSViv((I32)iters)));
1828 (void)SvPOK_only(TARG);
1829 TAINT_IF(rxtainted);
1832 LEAVE_SCOPE(oldsave);
1838 ++BmUSEFUL(rx->check_substr);
1843 LEAVE_SCOPE(oldsave);
1852 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1853 ++*PL_markstack_ptr;
1854 LEAVE; /* exit inner scope */
1857 if (PL_stack_base + *PL_markstack_ptr > SP) {
1859 I32 gimme = GIMME_V;
1861 LEAVE; /* exit outer scope */
1862 (void)POPMARK; /* pop src */
1863 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1864 (void)POPMARK; /* pop dst */
1865 SP = PL_stack_base + POPMARK; /* pop original mark */
1866 if (gimme == G_SCALAR) {
1870 else if (gimme == G_ARRAY)
1877 ENTER; /* enter inner scope */
1880 src = PL_stack_base[*PL_markstack_ptr];
1884 RETURNOP(cLOGOP->op_other);
1895 register PERL_CONTEXT *cx;
1896 struct block_sub cxsub;
1899 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1902 if (gimme == G_SCALAR) {
1905 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1907 *MARK = SvREFCNT_inc(TOPs);
1912 *MARK = sv_mortalcopy(TOPs);
1915 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1918 *MARK = &PL_sv_undef;
1922 else if (gimme == G_ARRAY) {
1923 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1924 if (!SvTEMP(*MARK)) {
1925 *MARK = sv_mortalcopy(*MARK);
1926 TAINT_NOT; /* Each item is independent */
1932 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1933 PL_curpm = newpm; /* ... and pop $1 et al */
1936 return pop_return();
1940 get_db_sub(SV **svp, CV *cv)
1943 SV *dbsv = GvSV(PL_DBsub);
1945 if (!PERLDB_SUB_NN) {
1949 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1950 || strEQ(GvNAME(gv), "END")
1951 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1952 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1953 && (gv = (GV*)*svp) ))) {
1954 /* Use GV from the stack as a fallback. */
1955 /* GV is potentially non-unique, or contain different CV. */
1956 sv_setsv(dbsv, newRV((SV*)cv));
1959 gv_efullname3(dbsv, gv, Nullch);
1963 SvUPGRADE(dbsv, SVt_PVIV);
1965 SAVEIV(SvIVX(dbsv));
1966 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1970 PL_curcopdb = PL_curcop;
1971 cv = GvCV(PL_DBsub);
1981 register PERL_CONTEXT *cx;
1983 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
1986 DIE("Not a CODE reference");
1987 switch (SvTYPE(sv)) {
1992 if (sv == &PL_sv_yes) { /* unfound import, ignore */
1994 SP = PL_stack_base + POPMARK;
1997 if (SvGMAGICAL(sv)) {
1999 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2002 sym = SvPV(sv, PL_na);
2004 DIE(no_usym, "a subroutine");
2005 if (PL_op->op_private & HINT_STRICT_REFS)
2006 DIE(no_symref, sym, "a subroutine");
2007 cv = perl_get_cv(sym, TRUE);
2011 if (SvTYPE(cv) == SVt_PVCV)
2016 DIE("Not a CODE reference");
2021 if (!(cv = GvCVu((GV*)sv)))
2022 cv = sv_2cv(sv, &stash, &gv, TRUE);
2031 DIE("Not a CODE reference");
2033 if (!CvROOT(cv) && !CvXSUB(cv)) {
2037 /* anonymous or undef'd function leaves us no recourse */
2038 if (CvANON(cv) || !(gv = CvGV(cv)))
2039 DIE("Undefined subroutine called");
2040 /* autoloaded stub? */
2041 if (cv != GvCV(gv)) {
2045 /* should call AUTOLOAD now? */
2046 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2053 sub_name = sv_newmortal();
2054 gv_efullname3(sub_name, gv, Nullch);
2055 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2059 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2060 cv = get_db_sub(&sv, cv);
2062 DIE("No DBsub routine");
2066 * First we need to check if the sub or method requires locking.
2067 * If so, we gain a lock on the CV, the first argument or the
2068 * stash (for static methods), as appropriate. This has to be
2069 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2070 * reschedule by returning a new op.
2072 MUTEX_LOCK(CvMUTEXP(cv));
2073 if (CvFLAGS(cv) & CVf_LOCKED) {
2075 if (CvFLAGS(cv) & CVf_METHOD) {
2076 if (SP > PL_stack_base + TOPMARK)
2077 sv = *(PL_stack_base + TOPMARK + 1);
2079 MUTEX_UNLOCK(CvMUTEXP(cv));
2080 croak("no argument for locked method call");
2086 char *stashname = SvPV(sv, len);
2087 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2093 MUTEX_UNLOCK(CvMUTEXP(cv));
2094 mg = condpair_magic(sv);
2095 MUTEX_LOCK(MgMUTEXP(mg));
2096 if (MgOWNER(mg) == thr)
2097 MUTEX_UNLOCK(MgMUTEXP(mg));
2100 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2102 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2104 MUTEX_UNLOCK(MgMUTEXP(mg));
2105 SvREFCNT_inc(sv); /* Keep alive until magic_mutexfree */
2106 save_destructor(unlock_condpair, sv);
2108 MUTEX_LOCK(CvMUTEXP(cv));
2111 * Now we have permission to enter the sub, we must distinguish
2112 * four cases. (0) It's an XSUB (in which case we don't care
2113 * about ownership); (1) it's ours already (and we're recursing);
2114 * (2) it's free (but we may already be using a cached clone);
2115 * (3) another thread owns it. Case (1) is easy: we just use it.
2116 * Case (2) means we look for a clone--if we have one, use it
2117 * otherwise grab ownership of cv. Case (3) means we look for a
2118 * clone (for non-XSUBs) and have to create one if we don't
2120 * Why look for a clone in case (2) when we could just grab
2121 * ownership of cv straight away? Well, we could be recursing,
2122 * i.e. we originally tried to enter cv while another thread
2123 * owned it (hence we used a clone) but it has been freed up
2124 * and we're now recursing into it. It may or may not be "better"
2125 * to use the clone but at least CvDEPTH can be trusted.
2127 if (CvOWNER(cv) == thr || CvXSUB(cv))
2128 MUTEX_UNLOCK(CvMUTEXP(cv));
2130 /* Case (2) or (3) */
2134 * XXX Might it be better to release CvMUTEXP(cv) while we
2135 * do the hv_fetch? We might find someone has pinched it
2136 * when we look again, in which case we would be in case
2137 * (3) instead of (2) so we'd have to clone. Would the fact
2138 * that we released the mutex more quickly make up for this?
2141 (svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2143 /* We already have a clone to use */
2144 MUTEX_UNLOCK(CvMUTEXP(cv));
2146 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2147 "entersub: %p already has clone %p:%s\n",
2148 thr, cv, SvPEEK((SV*)cv)));
2151 if (CvDEPTH(cv) == 0)
2152 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2155 /* (2) => grab ownership of cv. (3) => make clone */
2159 MUTEX_UNLOCK(CvMUTEXP(cv));
2160 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2161 "entersub: %p grabbing %p:%s in stash %s\n",
2162 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2163 HvNAME(CvSTASH(cv)) : "(none)"));
2165 /* Make a new clone. */
2167 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2168 MUTEX_UNLOCK(CvMUTEXP(cv));
2169 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2170 "entersub: %p cloning %p:%s\n",
2171 thr, cv, SvPEEK((SV*)cv))));
2173 * We're creating a new clone so there's no race
2174 * between the original MUTEX_UNLOCK and the
2175 * SvREFCNT_inc since no one will be trying to undef
2176 * it out from underneath us. At least, I don't think
2179 clonecv = cv_clone(cv);
2180 SvREFCNT_dec(cv); /* finished with this */
2181 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2182 CvOWNER(clonecv) = thr;
2186 DEBUG_S(if (CvDEPTH(cv) != 0)
2187 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2189 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2192 #endif /* USE_THREADS */
2195 if (CvOLDSTYLE(cv)) {
2196 I32 (*fp3)_((int,int,int));
2198 register I32 items = SP - MARK;
2199 /* We dont worry to copy from @_. */
2204 PL_stack_sp = mark + 1;
2205 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2206 items = (*fp3)(CvXSUBANY(cv).any_i32,
2207 MARK - PL_stack_base + 1,
2209 PL_stack_sp = PL_stack_base + items;
2212 I32 markix = TOPMARK;
2217 /* Need to copy @_ to stack. Alternative may be to
2218 * switch stack to @_, and copy return values
2219 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2223 av = (AV*)PL_curpad[0];
2225 av = GvAV(PL_defgv);
2226 #endif /* USE_THREADS */
2227 items = AvFILLp(av) + 1; /* @_ is not tieable */
2230 /* Mark is at the end of the stack. */
2232 Copy(AvARRAY(av), SP + 1, items, SV*);
2237 if (PL_curcopdb) { /* We assume that the first
2238 XSUB in &DB::sub is the
2240 SAVESPTR(PL_curcop);
2241 PL_curcop = PL_curcopdb;
2244 /* Do we need to open block here? XXXX */
2245 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2247 /* Enforce some sanity in scalar context. */
2248 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2249 if (markix > PL_stack_sp - PL_stack_base)
2250 *(PL_stack_base + markix) = &PL_sv_undef;
2252 *(PL_stack_base + markix) = *PL_stack_sp;
2253 PL_stack_sp = PL_stack_base + markix;
2261 register I32 items = SP - MARK;
2262 AV* padlist = CvPADLIST(cv);
2263 SV** svp = AvARRAY(padlist);
2264 push_return(PL_op->op_next);
2265 PUSHBLOCK(cx, CXt_SUB, MARK);
2268 if (CvDEPTH(cv) < 2)
2269 (void)SvREFCNT_inc(cv);
2270 else { /* save temporaries on recursion? */
2271 if (CvDEPTH(cv) == 100 && PL_dowarn
2272 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2273 sub_crush_depth(cv);
2274 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2276 AV *newpad = newAV();
2277 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2278 I32 ix = AvFILLp((AV*)svp[1]);
2279 svp = AvARRAY(svp[0]);
2280 for ( ;ix > 0; ix--) {
2281 if (svp[ix] != &PL_sv_undef) {
2282 char *name = SvPVX(svp[ix]);
2283 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2284 || *name == '&') /* anonymous code? */
2286 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2288 else { /* our own lexical */
2290 av_store(newpad, ix, sv = (SV*)newAV());
2291 else if (*name == '%')
2292 av_store(newpad, ix, sv = (SV*)newHV());
2294 av_store(newpad, ix, sv = NEWSV(0,0));
2299 av_store(newpad, ix, sv = NEWSV(0,0));
2303 av = newAV(); /* will be @_ */
2305 av_store(newpad, 0, (SV*)av);
2306 AvFLAGS(av) = AVf_REIFY;
2307 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2308 AvFILLp(padlist) = CvDEPTH(cv);
2309 svp = AvARRAY(padlist);
2314 AV* av = (AV*)PL_curpad[0];
2316 items = AvFILLp(av) + 1;
2318 /* Mark is at the end of the stack. */
2320 Copy(AvARRAY(av), SP + 1, items, SV*);
2325 #endif /* USE_THREADS */
2326 SAVESPTR(PL_curpad);
2327 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2330 #endif /* USE_THREADS */
2336 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2337 "%p entersub preparing @_\n", thr));
2339 av = (AV*)PL_curpad[0];
2345 cx->blk_sub.savearray = GvAV(PL_defgv);
2346 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2347 #endif /* USE_THREADS */
2348 cx->blk_sub.argarray = av;
2351 if (items > AvMAX(av) + 1) {
2353 if (AvARRAY(av) != ary) {
2354 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2355 SvPVX(av) = (char*)ary;
2357 if (items > AvMAX(av) + 1) {
2358 AvMAX(av) = items - 1;
2359 Renew(ary,items,SV*);
2361 SvPVX(av) = (char*)ary;
2364 Copy(MARK,AvARRAY(av),items,SV*);
2365 AvFILLp(av) = items - 1;
2374 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2375 "%p entersub returning %p\n", thr, CvSTART(cv)));
2377 RETURNOP(CvSTART(cv));
2382 sub_crush_depth(CV *cv)
2385 warn("Deep recursion on anonymous subroutine");
2387 SV* tmpstr = sv_newmortal();
2388 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2389 warn("Deep recursion on subroutine \"%s\"", SvPVX(tmpstr));
2399 U32 lval = PL_op->op_flags & OPf_MOD;
2400 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2404 elem -= PL_curcop->cop_arybase;
2405 if (SvTYPE(av) != SVt_PVAV)
2407 svp = av_fetch(av, elem, lval && !defer);
2409 if (!svp || *svp == &PL_sv_undef) {
2412 DIE(no_aelem, elem);
2413 lv = sv_newmortal();
2414 sv_upgrade(lv, SVt_PVLV);
2416 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2417 LvTARG(lv) = SvREFCNT_inc(av);
2418 LvTARGOFF(lv) = elem;
2423 if (PL_op->op_private & OPpLVAL_INTRO)
2424 save_aelem(av, elem, svp);
2425 else if (PL_op->op_private & OPpDEREF)
2426 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2428 sv = (svp ? *svp : &PL_sv_undef);
2429 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2430 sv = sv_mortalcopy(sv);
2436 vivify_ref(SV *sv, U32 to_what)
2443 if (SvTYPE(sv) < SVt_RV)
2444 sv_upgrade(sv, SVt_RV);
2445 else if (SvTYPE(sv) >= SVt_PV) {
2446 (void)SvOOK_off(sv);
2447 Safefree(SvPVX(sv));
2448 SvLEN(sv) = SvCUR(sv) = 0;
2452 SvRV(sv) = NEWSV(355,0);
2455 SvRV(sv) = (SV*)newAV();
2458 SvRV(sv) = (SV*)newHV();
2479 if (SvTYPE(sv) == SVt_PVCV) {
2485 name = SvPV(TOPs, PL_na);
2486 sv = *(PL_stack_base + TOPMARK + 1);
2497 !(packname = SvPV(sv, packlen)) ||
2498 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2499 !(ob=(SV*)GvIO(iogv)))
2501 if (!packname || !isIDFIRST(*packname))
2502 DIE("Can't call method \"%s\" %s", name,
2503 SvOK(sv)? "without a package or object reference"
2504 : "on an undefined value");
2505 stash = gv_stashpvn(packname, packlen, TRUE);
2508 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2511 if (!ob || !SvOBJECT(ob))
2512 DIE("Can't call method \"%s\" on unblessed reference", name);
2514 stash = SvSTASH(ob);
2517 gv = gv_fetchmethod(stash, name);
2523 for (p = name; *p; p++) {
2525 sep = p, leaf = p + 1;
2526 else if (*p == ':' && *(p + 1) == ':')
2527 sep = p, leaf = p + 2;
2529 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2530 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2531 packlen = strlen(packname);
2535 packlen = sep - name;
2537 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2538 leaf, (int)packlen, packname);
2540 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);