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!
19 #define PERL_IN_PP_HOT_C
32 #define HOP(pos,off) (IN_UTF8 ? utf8_hop(pos, off) : (pos + off))
37 static void unset_cvowner(pTHXo_ void *cvarg);
38 #endif /* USE_THREADS */
49 PL_curcop = (COP*)PL_op;
50 TAINT_NOT; /* Each statement is presumed innocent */
51 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
60 if (PL_op->op_private & OPpLVAL_INTRO)
61 PUSHs(save_scalar(cGVOP->op_gv));
63 PUSHs(GvSV(cGVOP->op_gv));
74 PUSHMARK(PL_stack_sp);
84 sv_setpvn(TARG,s,len);
92 XPUSHs((SV*)cGVOP->op_gv);
103 RETURNOP(cLOGOP->op_other);
112 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
114 temp = left; left = right; right = temp;
116 if (PL_tainting && PL_tainted && !SvTAINTED(left))
118 SvSetMagicSV(right, left);
127 RETURNOP(cLOGOP->op_other);
129 RETURNOP(cLOGOP->op_next);
135 TAINT_NOT; /* Each statement is presumed innocent */
136 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
138 oldsave = PL_scopestack[PL_scopestack_ix - 1];
139 LEAVE_SCOPE(oldsave);
145 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
152 sv_setpvn(TARG,s,len);
154 else if (SvGMAGICAL(TARG))
156 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
157 sv_setpv(TARG, ""); /* Suppress warning. */
158 s = SvPV_force(TARG, len);
162 sv_catpvn(TARG,s,len);
164 sv_setpvn(TARG,s,len); /* suppress warning */
174 if (PL_op->op_flags & OPf_MOD) {
175 if (PL_op->op_private & OPpLVAL_INTRO)
176 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
177 else if (PL_op->op_private & OPpDEREF) {
179 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
188 tryAMAGICunTARGET(iter, 0);
189 PL_last_in_gv = (GV*)(*PL_stack_sp--);
190 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
191 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
192 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
195 XPUSHs((SV*)PL_last_in_gv);
198 PL_last_in_gv = (GV*)(*PL_stack_sp--);
201 return do_readline();
206 djSP; tryAMAGICbinSET(eq,0);
209 SETs(boolSV(TOPn == value));
217 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
218 Perl_croak(aTHX_ PL_no_modify);
219 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
220 SvIVX(TOPs) != IV_MAX)
223 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
238 RETURNOP(cLOGOP->op_other);
244 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
247 SETn( left + right );
255 AV *av = GvAV((GV*)cSVOP->op_sv);
256 U32 lval = PL_op->op_flags & OPf_MOD;
257 SV** svp = av_fetch(av, PL_op->op_private, lval);
258 SV *sv = (svp ? *svp : &PL_sv_undef);
260 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
261 sv = sv_mortalcopy(sv);
268 djSP; dMARK; dTARGET;
270 do_join(TARG, *MARK, MARK, SP);
281 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
282 * will be enough to hold an OP*.
284 SV* sv = sv_newmortal();
285 sv_upgrade(sv, SVt_PVLV);
287 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
295 /* Oversized hot code. */
299 djSP; dMARK; dORIGMARK;
306 if (PL_op->op_flags & OPf_STACKED)
310 if (mg = SvTIED_mg((SV*)gv, 'q')) {
311 if (MARK == ORIGMARK) {
312 /* If using default handle then we need to make space to
313 * pass object as 1st arg, so move other args up ...
317 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
321 *MARK = SvTIED_obj((SV*)gv, mg);
324 call_method("PRINT", G_SCALAR);
332 if (!(io = GvIO(gv))) {
333 if (ckWARN(WARN_UNOPENED)) {
334 SV* sv = sv_newmortal();
335 gv_efullname3(sv, gv, Nullch);
336 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
339 SETERRNO(EBADF,RMS$_IFI);
342 else if (!(fp = IoOFP(io))) {
343 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
344 SV* sv = sv_newmortal();
345 gv_efullname3(sv, gv, Nullch);
347 Perl_warner(aTHX_ WARN_IO,
348 "Filehandle %s opened only for input",
350 else if (ckWARN(WARN_CLOSED))
351 Perl_warner(aTHX_ WARN_CLOSED,
352 "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)
408 tryAMAGICunDEREF(to_av);
411 if (SvTYPE(av) != SVt_PVAV)
412 DIE(aTHX_ "Not an ARRAY reference");
413 if (PL_op->op_flags & OPf_REF) {
419 if (SvTYPE(sv) == SVt_PVAV) {
421 if (PL_op->op_flags & OPf_REF) {
429 if (SvTYPE(sv) != SVt_PVGV) {
433 if (SvGMAGICAL(sv)) {
439 if (PL_op->op_flags & OPf_REF ||
440 PL_op->op_private & HINT_STRICT_REFS)
441 DIE(aTHX_ PL_no_usym, "an ARRAY");
442 if (ckWARN(WARN_UNINITIALIZED))
443 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
444 if (GIMME == G_ARRAY) {
451 if ((PL_op->op_flags & OPf_SPECIAL) &&
452 !(PL_op->op_flags & OPf_MOD))
454 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
459 if (PL_op->op_private & HINT_STRICT_REFS)
460 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
461 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
468 if (PL_op->op_private & OPpLVAL_INTRO)
470 if (PL_op->op_flags & OPf_REF) {
477 if (GIMME == G_ARRAY) {
478 I32 maxarg = AvFILL(av) + 1;
479 (void)POPs; /* XXXX May be optimized away? */
481 if (SvRMAGICAL(av)) {
483 for (i=0; i < maxarg; i++) {
484 SV **svp = av_fetch(av, i, FALSE);
485 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
489 Copy(AvARRAY(av), SP+1, maxarg, SV*);
495 I32 maxarg = AvFILL(av) + 1;
508 tryAMAGICunDEREF(to_hv);
511 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
512 DIE(aTHX_ "Not a HASH reference");
513 if (PL_op->op_flags & OPf_REF) {
519 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
521 if (PL_op->op_flags & OPf_REF) {
529 if (SvTYPE(sv) != SVt_PVGV) {
533 if (SvGMAGICAL(sv)) {
539 if (PL_op->op_flags & OPf_REF ||
540 PL_op->op_private & HINT_STRICT_REFS)
541 DIE(aTHX_ PL_no_usym, "a HASH");
542 if (ckWARN(WARN_UNINITIALIZED))
543 Perl_warner(aTHX_ WARN_UNINITIALIZED, PL_warn_uninit);
544 if (GIMME == G_ARRAY) {
551 if ((PL_op->op_flags & OPf_SPECIAL) &&
552 !(PL_op->op_flags & OPf_MOD))
554 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
559 if (PL_op->op_private & HINT_STRICT_REFS)
560 DIE(aTHX_ PL_no_symref, sym, "a HASH");
561 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
568 if (PL_op->op_private & OPpLVAL_INTRO)
570 if (PL_op->op_flags & OPf_REF) {
577 if (GIMME == G_ARRAY) { /* array wanted */
578 *PL_stack_sp = (SV*)hv;
583 if (SvTYPE(hv) == SVt_PVAV)
584 hv = avhv_keys((AV*)hv);
586 Perl_sv_setpvf(aTHX_ TARG, "%ld/%ld",
587 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
599 SV **lastlelem = PL_stack_sp;
600 SV **lastrelem = PL_stack_base + POPMARK;
601 SV **firstrelem = PL_stack_base + POPMARK + 1;
602 SV **firstlelem = lastrelem + 1;
615 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
617 /* If there's a common identifier on both sides we have to take
618 * special care that assigning the identifier on the left doesn't
619 * clobber a value on the right that's used later in the list.
621 if (PL_op->op_private & OPpASSIGN_COMMON) {
622 EXTEND_MORTAL(lastrelem - firstrelem + 1);
623 for (relem = firstrelem; relem <= lastrelem; relem++) {
626 TAINT_NOT; /* Each item is independent */
627 *relem = sv_mortalcopy(sv);
636 while (lelem <= lastlelem) {
637 TAINT_NOT; /* Each item stands on its own, taintwise. */
639 switch (SvTYPE(sv)) {
642 magic = SvMAGICAL(ary) != 0;
645 av_extend(ary, lastrelem - relem);
647 while (relem <= lastrelem) { /* gobble up all the rest */
653 didstore = av_store(ary,i++,sv);
667 magic = SvMAGICAL(hash) != 0;
670 while (relem < lastrelem) { /* gobble up all the rest */
675 sv = &PL_sv_no, relem++;
676 tmpstr = NEWSV(29,0);
678 sv_setsv(tmpstr,*relem); /* value */
680 didstore = hv_store_ent(hash,sv,tmpstr,0);
682 if (SvSMAGICAL(tmpstr))
689 if (relem == lastrelem) {
692 if (ckWARN(WARN_UNSAFE)) {
693 if (relem == firstrelem &&
695 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
696 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
697 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
699 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
701 tmpstr = NEWSV(29,0);
702 didstore = hv_store_ent(hash,*relem,tmpstr,0);
704 if (SvSMAGICAL(tmpstr))
716 if (SvIMMORTAL(sv)) {
717 if (relem <= lastrelem)
721 if (relem <= lastrelem) {
722 sv_setsv(sv, *relem);
726 sv_setsv(sv, &PL_sv_undef);
731 if (PL_delaymagic & ~DM_DELAY) {
732 if (PL_delaymagic & DM_UID) {
734 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
737 (void)setreuid(PL_uid,PL_euid);
740 if ((PL_delaymagic & DM_UID) == DM_RUID) {
741 (void)setruid(PL_uid);
742 PL_delaymagic &= ~DM_RUID;
744 # endif /* HAS_SETRUID */
746 if ((PL_delaymagic & DM_UID) == DM_EUID) {
747 (void)seteuid(PL_uid);
748 PL_delaymagic &= ~DM_EUID;
750 # endif /* HAS_SETEUID */
751 if (PL_delaymagic & DM_UID) {
752 if (PL_uid != PL_euid)
753 DIE(aTHX_ "No setreuid available");
754 (void)PerlProc_setuid(PL_uid);
756 # endif /* HAS_SETREUID */
757 #endif /* HAS_SETRESUID */
758 PL_uid = (int)PerlProc_getuid();
759 PL_euid = (int)PerlProc_geteuid();
761 if (PL_delaymagic & DM_GID) {
763 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
766 (void)setregid(PL_gid,PL_egid);
769 if ((PL_delaymagic & DM_GID) == DM_RGID) {
770 (void)setrgid(PL_gid);
771 PL_delaymagic &= ~DM_RGID;
773 # endif /* HAS_SETRGID */
775 if ((PL_delaymagic & DM_GID) == DM_EGID) {
776 (void)setegid(PL_gid);
777 PL_delaymagic &= ~DM_EGID;
779 # endif /* HAS_SETEGID */
780 if (PL_delaymagic & DM_GID) {
781 if (PL_gid != PL_egid)
782 DIE(aTHX_ "No setregid available");
783 (void)PerlProc_setgid(PL_gid);
785 # endif /* HAS_SETREGID */
786 #endif /* HAS_SETRESGID */
787 PL_gid = (int)PerlProc_getgid();
788 PL_egid = (int)PerlProc_getegid();
790 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
797 else if (gimme == G_SCALAR) {
800 SETi(lastrelem - firstrelem + 1);
806 SP = firstrelem + (lastlelem - firstlelem);
807 lelem = firstlelem + (relem - firstrelem);
809 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
817 register PMOP *pm = cPMOP;
818 SV *rv = sv_newmortal();
819 SV *sv = newSVrv(rv, "Regexp");
820 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
827 register PMOP *pm = cPMOP;
832 I32 r_flags = REXEC_CHECKED;
833 char *truebase; /* Start of string */
834 register REGEXP *rx = pm->op_pmregexp;
839 I32 oldsave = PL_savestack_ix;
840 I32 update_minmatch = 1;
843 if (PL_op->op_flags & OPf_STACKED)
849 PUTBACK; /* EVAL blocks need stack_sp. */
853 DIE(aTHX_ "panic: do_match");
854 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
855 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
858 if (pm->op_pmdynflags & PMdf_USED) {
860 if (gimme == G_ARRAY)
865 if (!rx->prelen && PL_curpm) {
867 rx = pm->op_pmregexp;
869 if (rx->minlen > len) goto failure;
873 /* XXXX What part of this is needed with true \G-support? */
874 if (global = pm->op_pmflags & PMf_GLOBAL) {
876 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
877 MAGIC* mg = mg_find(TARG, 'g');
878 if (mg && mg->mg_len >= 0) {
879 if (!(rx->reganch & ROPT_GPOS_SEEN))
880 rx->endp[0] = rx->startp[0] = mg->mg_len;
881 else if (rx->reganch & ROPT_ANCH_GPOS) {
882 r_flags |= REXEC_IGNOREPOS;
883 rx->endp[0] = rx->startp[0] = mg->mg_len;
885 minmatch = (mg->mg_flags & MGf_MINMATCH);
890 if ((gimme != G_ARRAY && !global && rx->nparens)
891 || SvTEMP(TARG) || PL_sawampersand)
892 r_flags |= REXEC_COPY_STR;
894 r_flags |= REXEC_SCREAM;
896 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
897 SAVEINT(PL_multiline);
898 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
902 if (global && rx->startp[0] != -1) {
903 t = s = rx->endp[0] + truebase;
904 if ((s + rx->minlen) > strend)
906 if (update_minmatch++)
907 minmatch = had_zerolen;
909 if (rx->reganch & RE_USE_INTUIT) {
910 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
914 if ( (rx->reganch & ROPT_CHECK_ALL)
916 && ((rx->reganch & ROPT_NOSCAN)
917 || !((rx->reganch & RE_INTUIT_TAIL)
918 && (r_flags & REXEC_SCREAM))))
921 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
924 if (pm->op_pmflags & PMf_ONCE)
925 pm->op_pmdynflags |= PMdf_USED;
934 RX_MATCH_TAINTED_on(rx);
935 TAINT_IF(RX_MATCH_TAINTED(rx));
936 if (gimme == G_ARRAY) {
940 if (global && !iters)
944 SPAGAIN; /* EVAL blocks could move the stack. */
945 EXTEND(SP, iters + i);
946 EXTEND_MORTAL(iters + i);
947 for (i = !i; i <= iters; i++) {
948 PUSHs(sv_newmortal());
950 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
951 len = rx->endp[i] - rx->startp[i];
952 s = rx->startp[i] + truebase;
953 sv_setpvn(*SP, s, len);
957 had_zerolen = (rx->startp[0] != -1
958 && rx->startp[0] == rx->endp[0]);
959 PUTBACK; /* EVAL blocks may use stack */
960 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
965 LEAVE_SCOPE(oldsave);
971 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
972 mg = mg_find(TARG, 'g');
974 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
975 mg = mg_find(TARG, 'g');
977 if (rx->startp[0] != -1) {
978 mg->mg_len = rx->endp[0];
979 if (rx->startp[0] == rx->endp[0])
980 mg->mg_flags |= MGf_MINMATCH;
982 mg->mg_flags &= ~MGf_MINMATCH;
985 LEAVE_SCOPE(oldsave);
989 yup: /* Confirmed by INTUIT */
991 RX_MATCH_TAINTED_on(rx);
992 TAINT_IF(RX_MATCH_TAINTED(rx));
994 if (pm->op_pmflags & PMf_ONCE)
995 pm->op_pmdynflags |= PMdf_USED;
996 if (RX_MATCH_COPIED(rx))
997 Safefree(rx->subbeg);
998 RX_MATCH_COPIED_off(rx);
1001 rx->subbeg = truebase;
1002 rx->startp[0] = s - truebase;
1003 rx->endp[0] = s - truebase + rx->minlen;
1004 rx->sublen = strend - truebase;
1007 if (PL_sawampersand) {
1010 rx->subbeg = savepvn(t, strend - t);
1011 rx->sublen = strend - t;
1012 RX_MATCH_COPIED_on(rx);
1013 off = rx->startp[0] = s - t;
1014 rx->endp[0] = off + rx->minlen;
1016 else { /* startp/endp are used by @- @+. */
1017 rx->startp[0] = s - truebase;
1018 rx->endp[0] = s - truebase + rx->minlen;
1020 LEAVE_SCOPE(oldsave);
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)
1039 Perl_do_readline(pTHX)
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 (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1053 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1056 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)
1214 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1215 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1216 || fp == PerlIO_stderr()))
1218 SV* sv = sv_newmortal();
1219 gv_efullname3(sv, PL_last_in_gv, Nullch);
1220 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1225 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1226 if (type == OP_GLOB)
1227 Perl_warner(aTHX_ WARN_CLOSED,
1228 "glob failed (can't start child: %s)",
1231 SV* sv = sv_newmortal();
1232 gv_efullname3(sv, PL_last_in_gv, Nullch);
1233 Perl_warner(aTHX_ WARN_CLOSED,
1234 "Read on closed filehandle %s",
1238 if (gimme == G_SCALAR) {
1239 (void)SvOK_off(TARG);
1245 if (gimme == G_SCALAR) {
1249 (void)SvUPGRADE(sv, SVt_PV);
1250 tmplen = SvLEN(sv); /* remember if already alloced */
1252 Sv_Grow(sv, 80); /* try short-buffering it */
1253 if (type == OP_RCATLINE)
1259 sv = sv_2mortal(NEWSV(57, 80));
1263 /* flip-flop EOF state for a snarfed empty file */
1264 #define SNARF_EOF(gimme,rs,io,sv) \
1265 ((gimme != G_SCALAR || SvCUR(sv) \
1266 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1267 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1268 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1271 if (!sv_gets(sv, fp, offset)
1272 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1274 PerlIO_clearerr(fp);
1275 if (IoFLAGS(io) & IOf_ARGV) {
1276 fp = nextargv(PL_last_in_gv);
1279 (void)do_close(PL_last_in_gv, FALSE);
1280 IoFLAGS(io) |= IOf_START;
1282 else if (type == OP_GLOB) {
1283 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1284 Perl_warner(aTHX_ WARN_CLOSED,
1285 "glob failed (child exited with status %d%s)",
1286 STATUS_CURRENT >> 8,
1287 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1290 if (gimme == G_SCALAR) {
1291 (void)SvOK_off(TARG);
1296 /* This should not be marked tainted if the fp is marked clean */
1297 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1304 if (type == OP_GLOB) {
1307 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1308 tmps = SvEND(sv) - 1;
1309 if (*tmps == *SvPVX(PL_rs)) {
1314 for (tmps = SvPVX(sv); *tmps; tmps++)
1315 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1316 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1318 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1319 (void)POPs; /* Unmatched wildcard? Chuck it... */
1323 if (gimme == G_ARRAY) {
1324 if (SvLEN(sv) - SvCUR(sv) > 20) {
1325 SvLEN_set(sv, SvCUR(sv)+1);
1326 Renew(SvPVX(sv), SvLEN(sv), char);
1328 sv = sv_2mortal(NEWSV(58, 80));
1331 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1332 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1336 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1337 Renew(SvPVX(sv), SvLEN(sv), char);
1346 register PERL_CONTEXT *cx;
1347 I32 gimme = OP_GIMME(PL_op, -1);
1350 if (cxstack_ix >= 0)
1351 gimme = cxstack[cxstack_ix].blk_gimme;
1359 PUSHBLOCK(cx, CXt_BLOCK, SP);
1371 U32 lval = PL_op->op_flags & OPf_MOD;
1372 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1375 if (SvTYPE(hv) == SVt_PVHV) {
1376 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1377 svp = he ? &HeVAL(he) : 0;
1379 else if (SvTYPE(hv) == SVt_PVAV) {
1380 if (PL_op->op_private & OPpLVAL_INTRO)
1381 DIE(aTHX_ "Can't localize pseudo-hash element");
1382 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1388 if (!svp || *svp == &PL_sv_undef) {
1393 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1395 lv = sv_newmortal();
1396 sv_upgrade(lv, SVt_PVLV);
1398 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1399 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1400 LvTARG(lv) = SvREFCNT_inc(hv);
1405 if (PL_op->op_private & OPpLVAL_INTRO) {
1406 if (HvNAME(hv) && isGV(*svp))
1407 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1409 save_helem(hv, keysv, svp);
1411 else if (PL_op->op_private & OPpDEREF)
1412 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1414 sv = (svp ? *svp : &PL_sv_undef);
1415 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1416 * Pushing the magical RHS on to the stack is useless, since
1417 * that magic is soon destined to be misled by the local(),
1418 * and thus the later pp_sassign() will fail to mg_get() the
1419 * old value. This should also cure problems with delayed
1420 * mg_get()s. GSAR 98-07-03 */
1421 if (!lval && SvGMAGICAL(sv))
1422 sv = sv_mortalcopy(sv);
1430 register PERL_CONTEXT *cx;
1436 if (PL_op->op_flags & OPf_SPECIAL) {
1437 cx = &cxstack[cxstack_ix];
1438 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1443 gimme = OP_GIMME(PL_op, -1);
1445 if (cxstack_ix >= 0)
1446 gimme = cxstack[cxstack_ix].blk_gimme;
1452 if (gimme == G_VOID)
1454 else if (gimme == G_SCALAR) {
1457 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1460 *MARK = sv_mortalcopy(TOPs);
1463 *MARK = &PL_sv_undef;
1467 else if (gimme == G_ARRAY) {
1468 /* in case LEAVE wipes old return values */
1469 for (mark = newsp + 1; mark <= SP; mark++) {
1470 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1471 *mark = sv_mortalcopy(*mark);
1472 TAINT_NOT; /* Each item is independent */
1476 PL_curpm = newpm; /* Don't pop $1 et al till now */
1486 register PERL_CONTEXT *cx;
1491 cx = &cxstack[cxstack_ix];
1492 if (CxTYPE(cx) != CXt_LOOP)
1493 DIE(aTHX_ "panic: pp_iter");
1495 av = cx->blk_loop.iterary;
1496 if (SvTYPE(av) != SVt_PVAV) {
1497 /* iterate ($min .. $max) */
1498 if (cx->blk_loop.iterlval) {
1499 /* string increment */
1500 register SV* cur = cx->blk_loop.iterlval;
1502 char *max = SvPV((SV*)av, maxlen);
1503 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1504 #ifndef USE_THREADS /* don't risk potential race */
1505 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1506 && !SvMAGICAL(*cx->blk_loop.itervar))
1508 /* safe to reuse old SV */
1509 sv_setsv(*cx->blk_loop.itervar, cur);
1514 /* we need a fresh SV every time so that loop body sees a
1515 * completely new SV for closures/references to work as
1517 SvREFCNT_dec(*cx->blk_loop.itervar);
1518 *cx->blk_loop.itervar = newSVsv(cur);
1520 if (strEQ(SvPVX(cur), max))
1521 sv_setiv(cur, 0); /* terminate next time */
1528 /* integer increment */
1529 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1532 #ifndef USE_THREADS /* don't risk potential race */
1533 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1534 && !SvMAGICAL(*cx->blk_loop.itervar))
1536 /* safe to reuse old SV */
1537 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1542 /* we need a fresh SV every time so that loop body sees a
1543 * completely new SV for closures/references to work as they
1545 SvREFCNT_dec(*cx->blk_loop.itervar);
1546 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1552 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1555 SvREFCNT_dec(*cx->blk_loop.itervar);
1557 if (sv = (SvMAGICAL(av))
1558 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1559 : AvARRAY(av)[++cx->blk_loop.iterix])
1563 if (av != PL_curstack && SvIMMORTAL(sv)) {
1564 SV *lv = cx->blk_loop.iterlval;
1565 if (lv && SvREFCNT(lv) > 1) {
1570 SvREFCNT_dec(LvTARG(lv));
1572 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1573 sv_upgrade(lv, SVt_PVLV);
1575 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1577 LvTARG(lv) = SvREFCNT_inc(av);
1578 LvTARGOFF(lv) = cx->blk_loop.iterix;
1579 LvTARGLEN(lv) = (UV) -1;
1583 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1590 register PMOP *pm = cPMOP;
1606 register REGEXP *rx = pm->op_pmregexp;
1608 int force_on_match = 0;
1609 I32 oldsave = PL_savestack_ix;
1610 I32 update_minmatch = 1;
1612 /* known replacement string? */
1613 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1614 if (PL_op->op_flags & OPf_STACKED)
1620 if (SvREADONLY(TARG)
1621 || (SvTYPE(TARG) > SVt_PVLV
1622 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1623 Perl_croak(aTHX_ PL_no_modify);
1626 s = SvPV(TARG, len);
1627 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1629 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1630 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1637 DIE(aTHX_ "panic: do_subst");
1640 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1641 position, once with zero-length,
1642 second time with non-zero. */
1644 if (!rx->prelen && PL_curpm) {
1646 rx = pm->op_pmregexp;
1648 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1649 ? REXEC_COPY_STR : 0;
1651 r_flags |= REXEC_SCREAM;
1652 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1653 SAVEINT(PL_multiline);
1654 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1657 if (rx->reganch & RE_USE_INTUIT) {
1658 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1662 /* How to do it in subst? */
1663 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1665 && ((rx->reganch & ROPT_NOSCAN)
1666 || !((rx->reganch & RE_INTUIT_TAIL)
1667 && (r_flags & REXEC_SCREAM))))
1672 /* only replace once? */
1673 once = !(rpm->op_pmflags & PMf_GLOBAL);
1675 /* known replacement string? */
1676 c = dstr ? SvPV(dstr, clen) : Nullch;
1678 /* can do inplace substitution? */
1679 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1680 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1681 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1682 r_flags | REXEC_CHECKED))
1686 LEAVE_SCOPE(oldsave);
1689 if (force_on_match) {
1691 s = SvPV_force(TARG, len);
1696 SvSCREAM_off(TARG); /* disable possible screamer */
1698 rxtainted |= RX_MATCH_TAINTED(rx);
1699 m = orig + rx->startp[0];
1700 d = orig + rx->endp[0];
1702 if (m - s > strend - d) { /* faster to shorten from end */
1704 Copy(c, m, clen, char);
1709 Move(d, m, i, char);
1713 SvCUR_set(TARG, m - s);
1716 else if (i = m - s) { /* faster from front */
1724 Copy(c, m, clen, char);
1729 Copy(c, d, clen, char);
1734 TAINT_IF(rxtainted & 1);
1740 if (iters++ > maxiters)
1741 DIE(aTHX_ "Substitution loop");
1742 rxtainted |= RX_MATCH_TAINTED(rx);
1743 m = rx->startp[0] + orig;
1747 Move(s, d, i, char);
1751 Copy(c, d, clen, char);
1754 s = rx->endp[0] + orig;
1755 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1757 /* don't match same null twice */
1758 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1761 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1762 Move(s, d, i+1, char); /* include the NUL */
1764 TAINT_IF(rxtainted & 1);
1766 PUSHs(sv_2mortal(newSViv((I32)iters)));
1768 (void)SvPOK_only(TARG);
1769 TAINT_IF(rxtainted);
1770 if (SvSMAGICAL(TARG)) {
1776 LEAVE_SCOPE(oldsave);
1780 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1781 r_flags | REXEC_CHECKED))
1783 if (force_on_match) {
1785 s = SvPV_force(TARG, len);
1788 rxtainted |= RX_MATCH_TAINTED(rx);
1789 dstr = NEWSV(25, len);
1790 sv_setpvn(dstr, m, s-m);
1793 register PERL_CONTEXT *cx;
1796 RETURNOP(cPMOP->op_pmreplroot);
1798 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1800 if (iters++ > maxiters)
1801 DIE(aTHX_ "Substitution loop");
1802 rxtainted |= RX_MATCH_TAINTED(rx);
1803 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1808 strend = s + (strend - m);
1810 m = rx->startp[0] + orig;
1811 sv_catpvn(dstr, s, m-s);
1812 s = rx->endp[0] + orig;
1814 sv_catpvn(dstr, c, clen);
1817 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1818 sv_catpvn(dstr, s, strend - s);
1820 (void)SvOOK_off(TARG);
1821 Safefree(SvPVX(TARG));
1822 SvPVX(TARG) = SvPVX(dstr);
1823 SvCUR_set(TARG, SvCUR(dstr));
1824 SvLEN_set(TARG, SvLEN(dstr));
1828 TAINT_IF(rxtainted & 1);
1830 PUSHs(sv_2mortal(newSViv((I32)iters)));
1832 (void)SvPOK_only(TARG);
1833 TAINT_IF(rxtainted);
1836 LEAVE_SCOPE(oldsave);
1845 LEAVE_SCOPE(oldsave);
1854 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1855 ++*PL_markstack_ptr;
1856 LEAVE; /* exit inner scope */
1859 if (PL_stack_base + *PL_markstack_ptr > SP) {
1861 I32 gimme = GIMME_V;
1863 LEAVE; /* exit outer scope */
1864 (void)POPMARK; /* pop src */
1865 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1866 (void)POPMARK; /* pop dst */
1867 SP = PL_stack_base + POPMARK; /* pop original mark */
1868 if (gimme == G_SCALAR) {
1872 else if (gimme == G_ARRAY)
1879 ENTER; /* enter inner scope */
1882 src = PL_stack_base[*PL_markstack_ptr];
1886 RETURNOP(cLOGOP->op_other);
1897 register PERL_CONTEXT *cx;
1898 struct block_sub cxsub;
1901 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1904 if (gimme == G_SCALAR) {
1907 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1909 *MARK = SvREFCNT_inc(TOPs);
1914 *MARK = sv_mortalcopy(TOPs);
1917 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1920 *MARK = &PL_sv_undef;
1924 else if (gimme == G_ARRAY) {
1925 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1926 if (!SvTEMP(*MARK)) {
1927 *MARK = sv_mortalcopy(*MARK);
1928 TAINT_NOT; /* Each item is independent */
1934 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1935 PL_curpm = newpm; /* ... and pop $1 et al */
1938 return pop_return();
1942 S_get_db_sub(pTHX_ SV **svp, CV *cv)
1945 SV *dbsv = GvSV(PL_DBsub);
1947 if (!PERLDB_SUB_NN) {
1951 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1952 || strEQ(GvNAME(gv), "END")
1953 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1954 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1955 && (gv = (GV*)*svp) ))) {
1956 /* Use GV from the stack as a fallback. */
1957 /* GV is potentially non-unique, or contain different CV. */
1958 sv_setsv(dbsv, newRV((SV*)cv));
1961 gv_efullname3(dbsv, gv, Nullch);
1965 SvUPGRADE(dbsv, SVt_PVIV);
1967 SAVEIV(SvIVX(dbsv));
1968 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1972 PL_curcopdb = PL_curcop;
1973 cv = GvCV(PL_DBsub);
1983 register PERL_CONTEXT *cx;
1985 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
1988 DIE(aTHX_ "Not a CODE reference");
1989 switch (SvTYPE(sv)) {
1995 if (sv == &PL_sv_yes) { /* unfound import, ignore */
1997 SP = PL_stack_base + POPMARK;
2000 if (SvGMAGICAL(sv)) {
2002 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2005 sym = SvPV(sv, n_a);
2007 DIE(aTHX_ PL_no_usym, "a subroutine");
2008 if (PL_op->op_private & HINT_STRICT_REFS)
2009 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2010 cv = get_cv(sym, TRUE);
2014 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2015 tryAMAGICunDEREF(to_cv);
2018 if (SvTYPE(cv) == SVt_PVCV)
2023 DIE(aTHX_ "Not a CODE reference");
2028 if (!(cv = GvCVu((GV*)sv)))
2029 cv = sv_2cv(sv, &stash, &gv, FALSE);
2042 if (!CvROOT(cv) && !CvXSUB(cv)) {
2046 /* anonymous or undef'd function leaves us no recourse */
2047 if (CvANON(cv) || !(gv = CvGV(cv)))
2048 DIE(aTHX_ "Undefined subroutine called");
2050 /* autoloaded stub? */
2051 if (cv != GvCV(gv)) {
2054 /* should call AUTOLOAD now? */
2057 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2064 sub_name = sv_newmortal();
2065 gv_efullname3(sub_name, gv, Nullch);
2066 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2070 DIE(aTHX_ "Not a CODE reference");
2075 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2076 cv = get_db_sub(&sv, cv);
2078 DIE(aTHX_ "No DBsub routine");
2083 * First we need to check if the sub or method requires locking.
2084 * If so, we gain a lock on the CV, the first argument or the
2085 * stash (for static methods), as appropriate. This has to be
2086 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2087 * reschedule by returning a new op.
2089 MUTEX_LOCK(CvMUTEXP(cv));
2090 if (CvFLAGS(cv) & CVf_LOCKED) {
2092 if (CvFLAGS(cv) & CVf_METHOD) {
2093 if (SP > PL_stack_base + TOPMARK)
2094 sv = *(PL_stack_base + TOPMARK + 1);
2096 AV *av = (AV*)PL_curpad[0];
2097 if (hasargs || !av || AvFILLp(av) < 0
2098 || !(sv = AvARRAY(av)[0]))
2100 MUTEX_UNLOCK(CvMUTEXP(cv));
2101 Perl_croak(aTHX_ "no argument for locked method call");
2108 char *stashname = SvPV(sv, len);
2109 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2115 MUTEX_UNLOCK(CvMUTEXP(cv));
2116 mg = condpair_magic(sv);
2117 MUTEX_LOCK(MgMUTEXP(mg));
2118 if (MgOWNER(mg) == thr)
2119 MUTEX_UNLOCK(MgMUTEXP(mg));
2122 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2124 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2126 MUTEX_UNLOCK(MgMUTEXP(mg));
2127 SAVEDESTRUCTOR(Perl_unlock_condpair, sv);
2129 MUTEX_LOCK(CvMUTEXP(cv));
2132 * Now we have permission to enter the sub, we must distinguish
2133 * four cases. (0) It's an XSUB (in which case we don't care
2134 * about ownership); (1) it's ours already (and we're recursing);
2135 * (2) it's free (but we may already be using a cached clone);
2136 * (3) another thread owns it. Case (1) is easy: we just use it.
2137 * Case (2) means we look for a clone--if we have one, use it
2138 * otherwise grab ownership of cv. Case (3) means we look for a
2139 * clone (for non-XSUBs) and have to create one if we don't
2141 * Why look for a clone in case (2) when we could just grab
2142 * ownership of cv straight away? Well, we could be recursing,
2143 * i.e. we originally tried to enter cv while another thread
2144 * owned it (hence we used a clone) but it has been freed up
2145 * and we're now recursing into it. It may or may not be "better"
2146 * to use the clone but at least CvDEPTH can be trusted.
2148 if (CvOWNER(cv) == thr || CvXSUB(cv))
2149 MUTEX_UNLOCK(CvMUTEXP(cv));
2151 /* Case (2) or (3) */
2155 * XXX Might it be better to release CvMUTEXP(cv) while we
2156 * do the hv_fetch? We might find someone has pinched it
2157 * when we look again, in which case we would be in case
2158 * (3) instead of (2) so we'd have to clone. Would the fact
2159 * that we released the mutex more quickly make up for this?
2161 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2163 /* We already have a clone to use */
2164 MUTEX_UNLOCK(CvMUTEXP(cv));
2166 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2167 "entersub: %p already has clone %p:%s\n",
2168 thr, cv, SvPEEK((SV*)cv)));
2171 if (CvDEPTH(cv) == 0)
2172 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2175 /* (2) => grab ownership of cv. (3) => make clone */
2179 MUTEX_UNLOCK(CvMUTEXP(cv));
2180 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2181 "entersub: %p grabbing %p:%s in stash %s\n",
2182 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2183 HvNAME(CvSTASH(cv)) : "(none)"));
2185 /* Make a new clone. */
2187 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2188 MUTEX_UNLOCK(CvMUTEXP(cv));
2189 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2190 "entersub: %p cloning %p:%s\n",
2191 thr, cv, SvPEEK((SV*)cv))));
2193 * We're creating a new clone so there's no race
2194 * between the original MUTEX_UNLOCK and the
2195 * SvREFCNT_inc since no one will be trying to undef
2196 * it out from underneath us. At least, I don't think
2199 clonecv = cv_clone(cv);
2200 SvREFCNT_dec(cv); /* finished with this */
2201 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2202 CvOWNER(clonecv) = thr;
2206 DEBUG_S(if (CvDEPTH(cv) != 0)
2207 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2209 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2212 #endif /* USE_THREADS */
2215 #ifdef PERL_XSUB_OLDSTYLE
2216 if (CvOLDSTYLE(cv)) {
2217 I32 (*fp3)(int,int,int);
2219 register I32 items = SP - MARK;
2220 /* We dont worry to copy from @_. */
2225 PL_stack_sp = mark + 1;
2226 fp3 = (I32(*)(int,int,int)))CvXSUB(cv;
2227 items = (*fp3)(CvXSUBANY(cv).any_i32,
2228 MARK - PL_stack_base + 1,
2230 PL_stack_sp = PL_stack_base + items;
2233 #endif /* PERL_XSUB_OLDSTYLE */
2235 I32 markix = TOPMARK;
2240 /* Need to copy @_ to stack. Alternative may be to
2241 * switch stack to @_, and copy return values
2242 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2246 av = (AV*)PL_curpad[0];
2248 av = GvAV(PL_defgv);
2249 #endif /* USE_THREADS */
2250 items = AvFILLp(av) + 1; /* @_ is not tieable */
2253 /* Mark is at the end of the stack. */
2255 Copy(AvARRAY(av), SP + 1, items, SV*);
2260 /* We assume first XSUB in &DB::sub is the called one. */
2262 SAVESPTR(PL_curcop);
2263 PL_curcop = PL_curcopdb;
2266 /* Do we need to open block here? XXXX */
2267 (void)(*CvXSUB(cv))(aTHXo_ cv);
2269 /* Enforce some sanity in scalar context. */
2270 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2271 if (markix > PL_stack_sp - PL_stack_base)
2272 *(PL_stack_base + markix) = &PL_sv_undef;
2274 *(PL_stack_base + markix) = *PL_stack_sp;
2275 PL_stack_sp = PL_stack_base + markix;
2283 register I32 items = SP - MARK;
2284 AV* padlist = CvPADLIST(cv);
2285 SV** svp = AvARRAY(padlist);
2286 push_return(PL_op->op_next);
2287 PUSHBLOCK(cx, CXt_SUB, MARK);
2290 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2291 * that eval'' ops within this sub know the correct lexical space.
2292 * Owing the speed considerations, we choose to search for the cv
2293 * in doeval() instead.
2295 if (CvDEPTH(cv) < 2)
2296 (void)SvREFCNT_inc(cv);
2297 else { /* save temporaries on recursion? */
2298 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2300 AV *newpad = newAV();
2301 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2302 I32 ix = AvFILLp((AV*)svp[1]);
2303 svp = AvARRAY(svp[0]);
2304 for ( ;ix > 0; ix--) {
2305 if (svp[ix] != &PL_sv_undef) {
2306 char *name = SvPVX(svp[ix]);
2307 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2308 || *name == '&') /* anonymous code? */
2310 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2312 else { /* our own lexical */
2314 av_store(newpad, ix, sv = (SV*)newAV());
2315 else if (*name == '%')
2316 av_store(newpad, ix, sv = (SV*)newHV());
2318 av_store(newpad, ix, sv = NEWSV(0,0));
2323 av_store(newpad, ix, sv = NEWSV(0,0));
2327 av = newAV(); /* will be @_ */
2329 av_store(newpad, 0, (SV*)av);
2330 AvFLAGS(av) = AVf_REIFY;
2331 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2332 AvFILLp(padlist) = CvDEPTH(cv);
2333 svp = AvARRAY(padlist);
2338 AV* av = (AV*)PL_curpad[0];
2340 items = AvFILLp(av) + 1;
2342 /* Mark is at the end of the stack. */
2344 Copy(AvARRAY(av), SP + 1, items, SV*);
2349 #endif /* USE_THREADS */
2350 SAVESPTR(PL_curpad);
2351 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2354 #endif /* USE_THREADS */
2360 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2361 "%p entersub preparing @_\n", thr));
2363 av = (AV*)PL_curpad[0];
2369 cx->blk_sub.savearray = GvAV(PL_defgv);
2370 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2371 #endif /* USE_THREADS */
2372 cx->blk_sub.argarray = av;
2375 if (items > AvMAX(av) + 1) {
2377 if (AvARRAY(av) != ary) {
2378 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2379 SvPVX(av) = (char*)ary;
2381 if (items > AvMAX(av) + 1) {
2382 AvMAX(av) = items - 1;
2383 Renew(ary,items,SV*);
2385 SvPVX(av) = (char*)ary;
2388 Copy(MARK,AvARRAY(av),items,SV*);
2389 AvFILLp(av) = items - 1;
2397 /* warning must come *after* we fully set up the context
2398 * stuff so that __WARN__ handlers can safely dounwind()
2401 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2402 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2403 sub_crush_depth(cv);
2405 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2406 "%p entersub returning %p\n", thr, CvSTART(cv)));
2408 RETURNOP(CvSTART(cv));
2413 Perl_sub_crush_depth(pTHX_ CV *cv)
2416 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2418 SV* tmpstr = sv_newmortal();
2419 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2420 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2431 U32 lval = PL_op->op_flags & OPf_MOD;
2432 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2436 elem -= PL_curcop->cop_arybase;
2437 if (SvTYPE(av) != SVt_PVAV)
2439 svp = av_fetch(av, elem, lval && !defer);
2441 if (!svp || *svp == &PL_sv_undef) {
2444 DIE(aTHX_ PL_no_aelem, elem);
2445 lv = sv_newmortal();
2446 sv_upgrade(lv, SVt_PVLV);
2448 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2449 LvTARG(lv) = SvREFCNT_inc(av);
2450 LvTARGOFF(lv) = elem;
2455 if (PL_op->op_private & OPpLVAL_INTRO)
2456 save_aelem(av, elem, svp);
2457 else if (PL_op->op_private & OPpDEREF)
2458 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2460 sv = (svp ? *svp : &PL_sv_undef);
2461 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2462 sv = sv_mortalcopy(sv);
2468 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2474 Perl_croak(aTHX_ PL_no_modify);
2475 if (SvTYPE(sv) < SVt_RV)
2476 sv_upgrade(sv, SVt_RV);
2477 else if (SvTYPE(sv) >= SVt_PV) {
2478 (void)SvOOK_off(sv);
2479 Safefree(SvPVX(sv));
2480 SvLEN(sv) = SvCUR(sv) = 0;
2484 SvRV(sv) = NEWSV(355,0);
2487 SvRV(sv) = (SV*)newAV();
2490 SvRV(sv) = (SV*)newHV();
2511 if (SvTYPE(sv) == SVt_PVCV) {
2517 name = SvPV(TOPs, packlen);
2518 sv = *(PL_stack_base + TOPMARK + 1);
2529 !(packname = SvPV(sv, packlen)) ||
2530 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2531 !(ob=(SV*)GvIO(iogv)))
2534 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2535 ? !isIDFIRST_utf8((U8*)packname)
2536 : !isIDFIRST(*packname)
2539 DIE(aTHX_ "Can't call method \"%s\" %s", name,
2540 SvOK(sv)? "without a package or object reference"
2541 : "on an undefined value");
2543 stash = gv_stashpvn(packname, packlen, TRUE);
2546 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2549 if (!ob || !SvOBJECT(ob))
2550 DIE(aTHX_ "Can't call method \"%s\" on unblessed reference", name);
2552 stash = SvSTASH(ob);
2555 gv = gv_fetchmethod(stash, name);
2561 for (p = name; *p; p++) {
2563 sep = p, leaf = p + 1;
2564 else if (*p == ':' && *(p + 1) == ':')
2565 sep = p, leaf = p + 2;
2567 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2568 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2569 packlen = strlen(packname);
2573 packlen = sep - name;
2575 DIE(aTHX_ "Can't locate object method \"%s\" via package \"%.*s\"",
2576 leaf, (int)packlen, packname);
2578 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);
2584 unset_cvowner(pTHXo_ void *cvarg)
2586 register CV* cv = (CV *) cvarg;
2589 #endif /* DEBUGGING */
2591 DEBUG_S((PerlIO_printf(PerlIO_stderr(), "%p unsetting CvOWNER of %p:%s\n",
2592 thr, cv, SvPEEK((SV*)cv))));
2593 MUTEX_LOCK(CvMUTEXP(cv));
2594 DEBUG_S(if (CvDEPTH(cv) != 0)
2595 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2597 assert(thr == CvOWNER(cv));
2599 MUTEX_UNLOCK(CvMUTEXP(cv));
2602 #endif /* USE_THREADS */