3 * Copyright (c) 1991-2000, 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
29 static void unset_cvowner(pTHXo_ void *cvarg);
30 #endif /* USE_THREADS */
41 PL_curcop = (COP*)PL_op;
42 TAINT_NOT; /* Each statement is presumed innocent */
43 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
52 if (PL_op->op_private & OPpLVAL_INTRO)
53 PUSHs(save_scalar(cGVOP_gv));
55 PUSHs(GvSV(cGVOP_gv));
66 PL_curcop = (COP*)PL_op;
72 PUSHMARK(PL_stack_sp);
82 sv_setpvn(TARG,s,len);
83 if (SvUTF8(TOPs) && !IN_BYTE)
92 XPUSHs((SV*)cGVOP_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);
154 sv_insert(TARG, 0, 0, s, len);
158 sv_setpvn(TARG,s,len);
160 else if (SvGMAGICAL(TARG))
162 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
163 sv_setpv(TARG, ""); /* Suppress warning. */
164 s = SvPV_force(TARG, len);
168 #if defined(PERL_Y2KWARN)
169 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
171 char *s = SvPV(TARG,n);
172 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
173 && (n == 2 || !isDIGIT(s[n-3])))
175 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
176 "about to append an integer to '19'");
181 sv_utf8_upgrade(TARG);
182 sv_catpvn(TARG,s,len);
187 else if (!SvUTF8(right)) {
192 sv_setpvn(TARG,s,len); /* suppress warning */
202 if (PL_op->op_flags & OPf_MOD) {
203 if (PL_op->op_private & OPpLVAL_INTRO)
204 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
205 else if (PL_op->op_private & OPpDEREF) {
207 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
216 tryAMAGICunTARGET(iter, 0);
217 PL_last_in_gv = (GV*)(*PL_stack_sp--);
218 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
219 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
220 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
223 XPUSHs((SV*)PL_last_in_gv);
226 PL_last_in_gv = (GV*)(*PL_stack_sp--);
229 return do_readline();
234 djSP; tryAMAGICbinSET(eq,0);
237 SETs(boolSV(TOPn == value));
245 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
246 DIE(aTHX_ PL_no_modify);
247 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
248 SvIVX(TOPs) != IV_MAX)
251 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
266 RETURNOP(cLOGOP->op_other);
272 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
275 SETn( left + right );
283 AV *av = GvAV(cGVOP_gv);
284 U32 lval = PL_op->op_flags & OPf_MOD;
285 SV** svp = av_fetch(av, PL_op->op_private, lval);
286 SV *sv = (svp ? *svp : &PL_sv_undef);
288 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
289 sv = sv_mortalcopy(sv);
296 djSP; dMARK; dTARGET;
298 do_join(TARG, *MARK, MARK, SP);
309 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
310 * will be enough to hold an OP*.
312 SV* sv = sv_newmortal();
313 sv_upgrade(sv, SVt_PVLV);
315 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
323 /* Oversized hot code. */
327 djSP; dMARK; dORIGMARK;
334 if (PL_op->op_flags & OPf_STACKED)
338 if (mg = SvTIED_mg((SV*)gv, 'q')) {
339 if (MARK == ORIGMARK) {
340 /* If using default handle then we need to make space to
341 * pass object as 1st arg, so move other args up ...
345 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
349 *MARK = SvTIED_obj((SV*)gv, mg);
352 call_method("PRINT", G_SCALAR);
360 if (!(io = GvIO(gv))) {
361 if (ckWARN(WARN_UNOPENED)) {
362 SV* sv = sv_newmortal();
363 gv_efullname3(sv, gv, Nullch);
364 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
367 SETERRNO(EBADF,RMS$_IFI);
370 else if (!(fp = IoOFP(io))) {
371 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
373 SV* sv = sv_newmortal();
374 gv_efullname3(sv, gv, Nullch);
375 Perl_warner(aTHX_ WARN_IO,
376 "Filehandle %s opened only for input",
379 else if (ckWARN(WARN_CLOSED))
380 report_closed_fh(gv, io, "print", "filehandle");
382 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
389 if (!do_print(*MARK, fp))
393 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
402 if (!do_print(*MARK, fp))
411 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
414 if (IoFLAGS(io) & IOf_FLUSH)
415 if (PerlIO_flush(fp) == EOF)
436 tryAMAGICunDEREF(to_av);
439 if (SvTYPE(av) != SVt_PVAV)
440 DIE(aTHX_ "Not an ARRAY reference");
441 if (PL_op->op_flags & OPf_REF) {
447 if (SvTYPE(sv) == SVt_PVAV) {
449 if (PL_op->op_flags & OPf_REF) {
457 if (SvTYPE(sv) != SVt_PVGV) {
461 if (SvGMAGICAL(sv)) {
467 if (PL_op->op_flags & OPf_REF ||
468 PL_op->op_private & HINT_STRICT_REFS)
469 DIE(aTHX_ PL_no_usym, "an ARRAY");
470 if (ckWARN(WARN_UNINITIALIZED))
472 if (GIMME == G_ARRAY) {
479 if ((PL_op->op_flags & OPf_SPECIAL) &&
480 !(PL_op->op_flags & OPf_MOD))
482 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
487 if (PL_op->op_private & HINT_STRICT_REFS)
488 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
489 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
496 if (PL_op->op_private & OPpLVAL_INTRO)
498 if (PL_op->op_flags & OPf_REF) {
505 if (GIMME == G_ARRAY) {
506 I32 maxarg = AvFILL(av) + 1;
507 (void)POPs; /* XXXX May be optimized away? */
509 if (SvRMAGICAL(av)) {
511 for (i=0; i < maxarg; i++) {
512 SV **svp = av_fetch(av, i, FALSE);
513 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
517 Copy(AvARRAY(av), SP+1, maxarg, SV*);
523 I32 maxarg = AvFILL(av) + 1;
536 tryAMAGICunDEREF(to_hv);
539 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
540 DIE(aTHX_ "Not a HASH reference");
541 if (PL_op->op_flags & OPf_REF) {
547 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
549 if (PL_op->op_flags & OPf_REF) {
557 if (SvTYPE(sv) != SVt_PVGV) {
561 if (SvGMAGICAL(sv)) {
567 if (PL_op->op_flags & OPf_REF ||
568 PL_op->op_private & HINT_STRICT_REFS)
569 DIE(aTHX_ PL_no_usym, "a HASH");
570 if (ckWARN(WARN_UNINITIALIZED))
572 if (GIMME == G_ARRAY) {
579 if ((PL_op->op_flags & OPf_SPECIAL) &&
580 !(PL_op->op_flags & OPf_MOD))
582 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
587 if (PL_op->op_private & HINT_STRICT_REFS)
588 DIE(aTHX_ PL_no_symref, sym, "a HASH");
589 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
596 if (PL_op->op_private & OPpLVAL_INTRO)
598 if (PL_op->op_flags & OPf_REF) {
605 if (GIMME == G_ARRAY) { /* array wanted */
606 *PL_stack_sp = (SV*)hv;
611 if (SvTYPE(hv) == SVt_PVAV)
612 hv = avhv_keys((AV*)hv);
614 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
615 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
627 SV **lastlelem = PL_stack_sp;
628 SV **lastrelem = PL_stack_base + POPMARK;
629 SV **firstrelem = PL_stack_base + POPMARK + 1;
630 SV **firstlelem = lastrelem + 1;
643 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
645 /* If there's a common identifier on both sides we have to take
646 * special care that assigning the identifier on the left doesn't
647 * clobber a value on the right that's used later in the list.
649 if (PL_op->op_private & OPpASSIGN_COMMON) {
650 EXTEND_MORTAL(lastrelem - firstrelem + 1);
651 for (relem = firstrelem; relem <= lastrelem; relem++) {
654 TAINT_NOT; /* Each item is independent */
655 *relem = sv_mortalcopy(sv);
664 while (lelem <= lastlelem) {
665 TAINT_NOT; /* Each item stands on its own, taintwise. */
667 switch (SvTYPE(sv)) {
670 magic = SvMAGICAL(ary) != 0;
673 av_extend(ary, lastrelem - relem);
675 while (relem <= lastrelem) { /* gobble up all the rest */
681 didstore = av_store(ary,i++,sv);
695 magic = SvMAGICAL(hash) != 0;
698 while (relem < lastrelem) { /* gobble up all the rest */
703 sv = &PL_sv_no, relem++;
704 tmpstr = NEWSV(29,0);
706 sv_setsv(tmpstr,*relem); /* value */
708 didstore = hv_store_ent(hash,sv,tmpstr,0);
710 if (SvSMAGICAL(tmpstr))
717 if (relem == lastrelem) {
720 if (ckWARN(WARN_MISC)) {
721 if (relem == firstrelem &&
723 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
724 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
725 Perl_warner(aTHX_ WARN_MISC, "Reference found where even-sized list expected");
727 Perl_warner(aTHX_ WARN_MISC, "Odd number of elements in hash assignment");
729 tmpstr = NEWSV(29,0);
730 didstore = hv_store_ent(hash,*relem,tmpstr,0);
732 if (SvSMAGICAL(tmpstr))
744 if (SvIMMORTAL(sv)) {
745 if (relem <= lastrelem)
749 if (relem <= lastrelem) {
750 sv_setsv(sv, *relem);
754 sv_setsv(sv, &PL_sv_undef);
759 if (PL_delaymagic & ~DM_DELAY) {
760 if (PL_delaymagic & DM_UID) {
762 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
765 (void)setreuid(PL_uid,PL_euid);
768 if ((PL_delaymagic & DM_UID) == DM_RUID) {
769 (void)setruid(PL_uid);
770 PL_delaymagic &= ~DM_RUID;
772 # endif /* HAS_SETRUID */
774 if ((PL_delaymagic & DM_UID) == DM_EUID) {
775 (void)seteuid(PL_uid);
776 PL_delaymagic &= ~DM_EUID;
778 # endif /* HAS_SETEUID */
779 if (PL_delaymagic & DM_UID) {
780 if (PL_uid != PL_euid)
781 DIE(aTHX_ "No setreuid available");
782 (void)PerlProc_setuid(PL_uid);
784 # endif /* HAS_SETREUID */
785 #endif /* HAS_SETRESUID */
786 PL_uid = PerlProc_getuid();
787 PL_euid = PerlProc_geteuid();
789 if (PL_delaymagic & DM_GID) {
791 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
794 (void)setregid(PL_gid,PL_egid);
797 if ((PL_delaymagic & DM_GID) == DM_RGID) {
798 (void)setrgid(PL_gid);
799 PL_delaymagic &= ~DM_RGID;
801 # endif /* HAS_SETRGID */
803 if ((PL_delaymagic & DM_GID) == DM_EGID) {
804 (void)setegid(PL_gid);
805 PL_delaymagic &= ~DM_EGID;
807 # endif /* HAS_SETEGID */
808 if (PL_delaymagic & DM_GID) {
809 if (PL_gid != PL_egid)
810 DIE(aTHX_ "No setregid available");
811 (void)PerlProc_setgid(PL_gid);
813 # endif /* HAS_SETREGID */
814 #endif /* HAS_SETRESGID */
815 PL_gid = PerlProc_getgid();
816 PL_egid = PerlProc_getegid();
818 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
825 else if (gimme == G_SCALAR) {
828 SETi(lastrelem - firstrelem + 1);
834 SP = firstrelem + (lastlelem - firstlelem);
835 lelem = firstlelem + (relem - firstrelem);
837 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
845 register PMOP *pm = cPMOP;
846 SV *rv = sv_newmortal();
847 SV *sv = newSVrv(rv, "Regexp");
848 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
855 register PMOP *pm = cPMOP;
860 I32 r_flags = REXEC_CHECKED;
861 char *truebase; /* Start of string */
862 register REGEXP *rx = pm->op_pmregexp;
867 I32 oldsave = PL_savestack_ix;
868 I32 update_minmatch = 1;
871 if (PL_op->op_flags & OPf_STACKED)
877 PUTBACK; /* EVAL blocks need stack_sp. */
881 DIE(aTHX_ "panic: do_match");
882 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
883 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
886 if (pm->op_pmdynflags & PMdf_USED) {
888 if (gimme == G_ARRAY)
893 if (!rx->prelen && PL_curpm) {
895 rx = pm->op_pmregexp;
897 if (rx->minlen > len) goto failure;
901 /* XXXX What part of this is needed with true \G-support? */
902 if (global = pm->op_pmflags & PMf_GLOBAL) {
904 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
905 MAGIC* mg = mg_find(TARG, 'g');
906 if (mg && mg->mg_len >= 0) {
907 if (!(rx->reganch & ROPT_GPOS_SEEN))
908 rx->endp[0] = rx->startp[0] = mg->mg_len;
909 else if (rx->reganch & ROPT_ANCH_GPOS) {
910 r_flags |= REXEC_IGNOREPOS;
911 rx->endp[0] = rx->startp[0] = mg->mg_len;
913 minmatch = (mg->mg_flags & MGf_MINMATCH);
918 if ((gimme != G_ARRAY && !global && rx->nparens)
919 || SvTEMP(TARG) || PL_sawampersand)
920 r_flags |= REXEC_COPY_STR;
922 r_flags |= REXEC_SCREAM;
924 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
925 SAVEINT(PL_multiline);
926 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
930 if (global && rx->startp[0] != -1) {
931 t = s = rx->endp[0] + truebase;
932 if ((s + rx->minlen) > strend)
934 if (update_minmatch++)
935 minmatch = had_zerolen;
937 if (rx->reganch & RE_USE_INTUIT) {
938 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
942 if ( (rx->reganch & ROPT_CHECK_ALL)
944 && ((rx->reganch & ROPT_NOSCAN)
945 || !((rx->reganch & RE_INTUIT_TAIL)
946 && (r_flags & REXEC_SCREAM))))
949 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
952 if (pm->op_pmflags & PMf_ONCE)
953 pm->op_pmdynflags |= PMdf_USED;
962 RX_MATCH_TAINTED_on(rx);
963 TAINT_IF(RX_MATCH_TAINTED(rx));
964 if (gimme == G_ARRAY) {
968 if (global && !iters)
972 SPAGAIN; /* EVAL blocks could move the stack. */
973 EXTEND(SP, iters + i);
974 EXTEND_MORTAL(iters + i);
975 for (i = !i; i <= iters; i++) {
976 PUSHs(sv_newmortal());
978 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
979 len = rx->endp[i] - rx->startp[i];
980 s = rx->startp[i] + truebase;
981 sv_setpvn(*SP, s, len);
985 had_zerolen = (rx->startp[0] != -1
986 && rx->startp[0] == rx->endp[0]);
987 PUTBACK; /* EVAL blocks may use stack */
988 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
993 LEAVE_SCOPE(oldsave);
999 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1000 mg = mg_find(TARG, 'g');
1002 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1003 mg = mg_find(TARG, 'g');
1005 if (rx->startp[0] != -1) {
1006 mg->mg_len = rx->endp[0];
1007 if (rx->startp[0] == rx->endp[0])
1008 mg->mg_flags |= MGf_MINMATCH;
1010 mg->mg_flags &= ~MGf_MINMATCH;
1013 LEAVE_SCOPE(oldsave);
1017 yup: /* Confirmed by INTUIT */
1019 RX_MATCH_TAINTED_on(rx);
1020 TAINT_IF(RX_MATCH_TAINTED(rx));
1022 if (pm->op_pmflags & PMf_ONCE)
1023 pm->op_pmdynflags |= PMdf_USED;
1024 if (RX_MATCH_COPIED(rx))
1025 Safefree(rx->subbeg);
1026 RX_MATCH_COPIED_off(rx);
1027 rx->subbeg = Nullch;
1029 rx->subbeg = truebase;
1030 rx->startp[0] = s - truebase;
1031 rx->endp[0] = s - truebase + rx->minlen;
1032 rx->sublen = strend - truebase;
1035 if (PL_sawampersand) {
1038 rx->subbeg = savepvn(t, strend - t);
1039 rx->sublen = strend - t;
1040 RX_MATCH_COPIED_on(rx);
1041 off = rx->startp[0] = s - t;
1042 rx->endp[0] = off + rx->minlen;
1044 else { /* startp/endp are used by @- @+. */
1045 rx->startp[0] = s - truebase;
1046 rx->endp[0] = s - truebase + rx->minlen;
1048 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1049 LEAVE_SCOPE(oldsave);
1054 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1055 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1056 MAGIC* mg = mg_find(TARG, 'g');
1061 LEAVE_SCOPE(oldsave);
1062 if (gimme == G_ARRAY)
1068 Perl_do_readline(pTHX)
1070 dSP; dTARGETSTACKED;
1075 register IO *io = GvIO(PL_last_in_gv);
1076 register I32 type = PL_op->op_type;
1077 I32 gimme = GIMME_V;
1080 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1082 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1085 call_method("READLINE", gimme);
1088 if (gimme == G_SCALAR)
1089 SvSetMagicSV_nosteal(TARG, TOPs);
1096 if (IoFLAGS(io) & IOf_ARGV) {
1097 if (IoFLAGS(io) & IOf_START) {
1099 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1100 IoFLAGS(io) &= ~IOf_START;
1101 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1102 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1103 SvSETMAGIC(GvSV(PL_last_in_gv));
1108 fp = nextargv(PL_last_in_gv);
1109 if (!fp) { /* Note: fp != IoIFP(io) */
1110 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1113 else if (type == OP_GLOB) {
1114 SV *tmpcmd = NEWSV(55, 0);
1118 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1119 /* since spawning off a process is a real performance hit */
1121 #include <descrip.h>
1122 #include <lib$routines.h>
1125 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1126 char vmsspec[NAM$C_MAXRSS+1];
1127 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1128 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1129 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1132 struct dsc$descriptor_s wilddsc
1133 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1134 struct dsc$descriptor_vs rsdsc
1135 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1136 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1138 /* We could find out if there's an explicit dev/dir or version
1139 by peeking into lib$find_file's internal context at
1140 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1141 but that's unsupported, so I don't want to do it now and
1142 have it bite someone in the future. */
1143 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1144 cp = SvPV(tmpglob,i);
1146 if (cp[i] == ';') hasver = 1;
1148 if (sts) hasver = 1;
1152 hasdir = isunix = 1;
1155 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1160 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1162 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1163 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1164 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1165 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1166 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1167 &dfltdsc,NULL,NULL,NULL))&1)) {
1168 end = rstr + (unsigned long int) *rslt;
1169 if (!hasver) while (*end != ';') end--;
1170 *(end++) = '\n'; *end = '\0';
1171 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1173 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1178 while (*(--begin) != ']' && *begin != '>') ;
1181 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1183 if (cxt) (void)lib$find_file_end(&cxt);
1184 if (ok && sts != RMS$_NMF &&
1185 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1188 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1190 PerlIO_close(tmpfp);
1194 PerlIO_rewind(tmpfp);
1196 IoIFP(io) = fp = tmpfp;
1197 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1202 #ifdef MACOS_TRADITIONAL
1203 sv_setpv(tmpcmd, "glob ");
1204 sv_catsv(tmpcmd, tmpglob);
1205 sv_catpv(tmpcmd, " |");
1209 sv_setpv(tmpcmd, "for a in ");
1210 sv_catsv(tmpcmd, tmpglob);
1211 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1214 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1215 sv_catsv(tmpcmd, tmpglob);
1217 sv_setpv(tmpcmd, "perlglob ");
1218 sv_catsv(tmpcmd, tmpglob);
1219 sv_catpv(tmpcmd, " |");
1224 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1225 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1226 sv_catsv(tmpcmd, tmpglob);
1227 sv_catpv(tmpcmd, "' 2>/dev/null |");
1229 sv_setpv(tmpcmd, "echo ");
1230 sv_catsv(tmpcmd, tmpglob);
1232 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1234 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1237 #endif /* !DOSISH */
1238 #endif /* MACOS_TRADITIONAL */
1239 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1240 FALSE, O_RDONLY, 0, Nullfp);
1246 else if (type == OP_GLOB)
1248 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1249 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1250 || fp == PerlIO_stderr()))
1252 SV* sv = sv_newmortal();
1253 gv_efullname3(sv, PL_last_in_gv, Nullch);
1254 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1259 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1260 if (type == OP_GLOB)
1261 Perl_warner(aTHX_ WARN_GLOB,
1262 "glob failed (can't start child: %s)",
1265 report_closed_fh(PL_last_in_gv, io, "readline", "filehandle");
1267 if (gimme == G_SCALAR) {
1268 (void)SvOK_off(TARG);
1274 if (gimme == G_SCALAR) {
1278 (void)SvUPGRADE(sv, SVt_PV);
1279 tmplen = SvLEN(sv); /* remember if already alloced */
1281 Sv_Grow(sv, 80); /* try short-buffering it */
1282 if (type == OP_RCATLINE)
1288 sv = sv_2mortal(NEWSV(57, 80));
1292 /* delay EOF state for a snarfed empty file */
1293 #define SNARF_EOF(gimme,rs,io,sv) \
1294 (gimme != G_SCALAR || SvCUR(sv) \
1295 || !RsSNARF(rs) || (IoFLAGS(io) & IOf_NOLINE) \
1296 || ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1299 if (!sv_gets(sv, fp, offset)
1300 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1302 PerlIO_clearerr(fp);
1303 if (IoFLAGS(io) & IOf_ARGV) {
1304 fp = nextargv(PL_last_in_gv);
1307 (void)do_close(PL_last_in_gv, FALSE);
1309 else if (type == OP_GLOB) {
1310 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1311 Perl_warner(aTHX_ WARN_GLOB,
1312 "glob failed (child exited with status %d%s)",
1313 (int)(STATUS_CURRENT >> 8),
1314 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1317 if (gimme == G_SCALAR) {
1318 (void)SvOK_off(TARG);
1323 /* This should not be marked tainted if the fp is marked clean */
1324 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1331 if (type == OP_GLOB) {
1334 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1335 tmps = SvEND(sv) - 1;
1336 if (*tmps == *SvPVX(PL_rs)) {
1341 for (tmps = SvPVX(sv); *tmps; tmps++)
1342 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1343 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1345 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1346 (void)POPs; /* Unmatched wildcard? Chuck it... */
1350 if (gimme == G_ARRAY) {
1351 if (SvLEN(sv) - SvCUR(sv) > 20) {
1352 SvLEN_set(sv, SvCUR(sv)+1);
1353 Renew(SvPVX(sv), SvLEN(sv), char);
1355 sv = sv_2mortal(NEWSV(58, 80));
1358 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1359 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1363 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1364 Renew(SvPVX(sv), SvLEN(sv), char);
1373 register PERL_CONTEXT *cx;
1374 I32 gimme = OP_GIMME(PL_op, -1);
1377 if (cxstack_ix >= 0)
1378 gimme = cxstack[cxstack_ix].blk_gimme;
1386 PUSHBLOCK(cx, CXt_BLOCK, SP);
1398 U32 lval = PL_op->op_flags & OPf_MOD;
1399 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1402 if (SvTYPE(hv) == SVt_PVHV) {
1403 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1404 svp = he ? &HeVAL(he) : 0;
1406 else if (SvTYPE(hv) == SVt_PVAV) {
1407 if (PL_op->op_private & OPpLVAL_INTRO)
1408 DIE(aTHX_ "Can't localize pseudo-hash element");
1409 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1415 if (!svp || *svp == &PL_sv_undef) {
1420 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1422 lv = sv_newmortal();
1423 sv_upgrade(lv, SVt_PVLV);
1425 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1426 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1427 LvTARG(lv) = SvREFCNT_inc(hv);
1432 if (PL_op->op_private & OPpLVAL_INTRO) {
1433 if (HvNAME(hv) && isGV(*svp))
1434 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1436 save_helem(hv, keysv, svp);
1438 else if (PL_op->op_private & OPpDEREF)
1439 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1441 sv = (svp ? *svp : &PL_sv_undef);
1442 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1443 * Pushing the magical RHS on to the stack is useless, since
1444 * that magic is soon destined to be misled by the local(),
1445 * and thus the later pp_sassign() will fail to mg_get() the
1446 * old value. This should also cure problems with delayed
1447 * mg_get()s. GSAR 98-07-03 */
1448 if (!lval && SvGMAGICAL(sv))
1449 sv = sv_mortalcopy(sv);
1457 register PERL_CONTEXT *cx;
1463 if (PL_op->op_flags & OPf_SPECIAL) {
1464 cx = &cxstack[cxstack_ix];
1465 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1470 gimme = OP_GIMME(PL_op, -1);
1472 if (cxstack_ix >= 0)
1473 gimme = cxstack[cxstack_ix].blk_gimme;
1479 if (gimme == G_VOID)
1481 else if (gimme == G_SCALAR) {
1484 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1487 *MARK = sv_mortalcopy(TOPs);
1490 *MARK = &PL_sv_undef;
1494 else if (gimme == G_ARRAY) {
1495 /* in case LEAVE wipes old return values */
1496 for (mark = newsp + 1; mark <= SP; mark++) {
1497 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1498 *mark = sv_mortalcopy(*mark);
1499 TAINT_NOT; /* Each item is independent */
1503 PL_curpm = newpm; /* Don't pop $1 et al till now */
1513 register PERL_CONTEXT *cx;
1519 cx = &cxstack[cxstack_ix];
1520 if (CxTYPE(cx) != CXt_LOOP)
1521 DIE(aTHX_ "panic: pp_iter");
1523 itersvp = CxITERVAR(cx);
1524 av = cx->blk_loop.iterary;
1525 if (SvTYPE(av) != SVt_PVAV) {
1526 /* iterate ($min .. $max) */
1527 if (cx->blk_loop.iterlval) {
1528 /* string increment */
1529 register SV* cur = cx->blk_loop.iterlval;
1531 char *max = SvPV((SV*)av, maxlen);
1532 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1533 #ifndef USE_THREADS /* don't risk potential race */
1534 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1535 /* safe to reuse old SV */
1536 sv_setsv(*itersvp, cur);
1541 /* we need a fresh SV every time so that loop body sees a
1542 * completely new SV for closures/references to work as
1544 SvREFCNT_dec(*itersvp);
1545 *itersvp = newSVsv(cur);
1547 if (strEQ(SvPVX(cur), max))
1548 sv_setiv(cur, 0); /* terminate next time */
1555 /* integer increment */
1556 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1559 #ifndef USE_THREADS /* don't risk potential race */
1560 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1561 /* safe to reuse old SV */
1562 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1567 /* we need a fresh SV every time so that loop body sees a
1568 * completely new SV for closures/references to work as they
1570 SvREFCNT_dec(*itersvp);
1571 *itersvp = newSViv(cx->blk_loop.iterix++);
1577 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1580 SvREFCNT_dec(*itersvp);
1582 if (sv = (SvMAGICAL(av))
1583 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1584 : AvARRAY(av)[++cx->blk_loop.iterix])
1588 if (av != PL_curstack && SvIMMORTAL(sv)) {
1589 SV *lv = cx->blk_loop.iterlval;
1590 if (lv && SvREFCNT(lv) > 1) {
1595 SvREFCNT_dec(LvTARG(lv));
1597 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1598 sv_upgrade(lv, SVt_PVLV);
1600 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1602 LvTARG(lv) = SvREFCNT_inc(av);
1603 LvTARGOFF(lv) = cx->blk_loop.iterix;
1604 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1608 *itersvp = SvREFCNT_inc(sv);
1615 register PMOP *pm = cPMOP;
1631 register REGEXP *rx = pm->op_pmregexp;
1633 int force_on_match = 0;
1634 I32 oldsave = PL_savestack_ix;
1635 I32 update_minmatch = 1;
1637 /* known replacement string? */
1638 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1639 if (PL_op->op_flags & OPf_STACKED)
1645 if (SvREADONLY(TARG)
1646 || (SvTYPE(TARG) > SVt_PVLV
1647 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1648 DIE(aTHX_ PL_no_modify);
1651 s = SvPV(TARG, len);
1652 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1654 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1655 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1662 DIE(aTHX_ "panic: do_subst");
1665 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1666 position, once with zero-length,
1667 second time with non-zero. */
1669 if (!rx->prelen && PL_curpm) {
1671 rx = pm->op_pmregexp;
1673 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1674 ? REXEC_COPY_STR : 0;
1676 r_flags |= REXEC_SCREAM;
1677 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1678 SAVEINT(PL_multiline);
1679 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1682 if (rx->reganch & RE_USE_INTUIT) {
1683 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1687 /* How to do it in subst? */
1688 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1690 && ((rx->reganch & ROPT_NOSCAN)
1691 || !((rx->reganch & RE_INTUIT_TAIL)
1692 && (r_flags & REXEC_SCREAM))))
1697 /* only replace once? */
1698 once = !(rpm->op_pmflags & PMf_GLOBAL);
1700 /* known replacement string? */
1701 c = dstr ? SvPV(dstr, clen) : Nullch;
1703 /* can do inplace substitution? */
1704 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1705 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1706 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1707 r_flags | REXEC_CHECKED))
1711 LEAVE_SCOPE(oldsave);
1714 if (force_on_match) {
1716 s = SvPV_force(TARG, len);
1721 SvSCREAM_off(TARG); /* disable possible screamer */
1723 rxtainted |= RX_MATCH_TAINTED(rx);
1724 m = orig + rx->startp[0];
1725 d = orig + rx->endp[0];
1727 if (m - s > strend - d) { /* faster to shorten from end */
1729 Copy(c, m, clen, char);
1734 Move(d, m, i, char);
1738 SvCUR_set(TARG, m - s);
1741 else if (i = m - s) { /* faster from front */
1749 Copy(c, m, clen, char);
1754 Copy(c, d, clen, char);
1759 TAINT_IF(rxtainted & 1);
1765 if (iters++ > maxiters)
1766 DIE(aTHX_ "Substitution loop");
1767 rxtainted |= RX_MATCH_TAINTED(rx);
1768 m = rx->startp[0] + orig;
1772 Move(s, d, i, char);
1776 Copy(c, d, clen, char);
1779 s = rx->endp[0] + orig;
1780 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1782 /* don't match same null twice */
1783 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1786 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1787 Move(s, d, i+1, char); /* include the NUL */
1789 TAINT_IF(rxtainted & 1);
1791 PUSHs(sv_2mortal(newSViv((I32)iters)));
1793 (void)SvPOK_only(TARG);
1794 TAINT_IF(rxtainted);
1795 if (SvSMAGICAL(TARG)) {
1801 LEAVE_SCOPE(oldsave);
1805 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1806 r_flags | REXEC_CHECKED))
1808 if (force_on_match) {
1810 s = SvPV_force(TARG, len);
1813 rxtainted |= RX_MATCH_TAINTED(rx);
1814 dstr = NEWSV(25, len);
1815 sv_setpvn(dstr, m, s-m);
1818 register PERL_CONTEXT *cx;
1821 RETURNOP(cPMOP->op_pmreplroot);
1823 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1825 if (iters++ > maxiters)
1826 DIE(aTHX_ "Substitution loop");
1827 rxtainted |= RX_MATCH_TAINTED(rx);
1828 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1833 strend = s + (strend - m);
1835 m = rx->startp[0] + orig;
1836 sv_catpvn(dstr, s, m-s);
1837 s = rx->endp[0] + orig;
1839 sv_catpvn(dstr, c, clen);
1842 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1843 sv_catpvn(dstr, s, strend - s);
1845 (void)SvOOK_off(TARG);
1846 Safefree(SvPVX(TARG));
1847 SvPVX(TARG) = SvPVX(dstr);
1848 SvCUR_set(TARG, SvCUR(dstr));
1849 SvLEN_set(TARG, SvLEN(dstr));
1853 TAINT_IF(rxtainted & 1);
1855 PUSHs(sv_2mortal(newSViv((I32)iters)));
1857 (void)SvPOK_only(TARG);
1858 TAINT_IF(rxtainted);
1861 LEAVE_SCOPE(oldsave);
1870 LEAVE_SCOPE(oldsave);
1879 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1880 ++*PL_markstack_ptr;
1881 LEAVE; /* exit inner scope */
1884 if (PL_stack_base + *PL_markstack_ptr > SP) {
1886 I32 gimme = GIMME_V;
1888 LEAVE; /* exit outer scope */
1889 (void)POPMARK; /* pop src */
1890 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1891 (void)POPMARK; /* pop dst */
1892 SP = PL_stack_base + POPMARK; /* pop original mark */
1893 if (gimme == G_SCALAR) {
1897 else if (gimme == G_ARRAY)
1904 ENTER; /* enter inner scope */
1907 src = PL_stack_base[*PL_markstack_ptr];
1911 RETURNOP(cLOGOP->op_other);
1922 register PERL_CONTEXT *cx;
1928 if (gimme == G_SCALAR) {
1931 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1933 *MARK = SvREFCNT_inc(TOPs);
1939 *MARK = sv_mortalcopy(TOPs);
1943 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1947 *MARK = &PL_sv_undef;
1951 else if (gimme == G_ARRAY) {
1952 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1953 if (!SvTEMP(*MARK)) {
1954 *MARK = sv_mortalcopy(*MARK);
1955 TAINT_NOT; /* Each item is independent */
1961 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
1962 PL_curpm = newpm; /* ... and pop $1 et al */
1966 return pop_return();
1969 /* This duplicates the above code because the above code must not
1970 * get any slower by more conditions */
1978 register PERL_CONTEXT *cx;
1985 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
1986 /* We are an argument to a function or grep().
1987 * This kind of lvalueness was legal before lvalue
1988 * subroutines too, so be backward compatible:
1989 * cannot report errors. */
1991 /* Scalar context *is* possible, on the LHS of -> only,
1992 * as in f()->meth(). But this is not an lvalue. */
1993 if (gimme == G_SCALAR)
1995 if (gimme == G_ARRAY) {
1996 if (!CvLVALUE(cx->blk_sub.cv))
1997 goto temporise_array;
1998 EXTEND_MORTAL(SP - newsp);
1999 for (mark = newsp + 1; mark <= SP; mark++) {
2002 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2003 *mark = sv_mortalcopy(*mark);
2005 /* Can be a localized value subject to deletion. */
2006 PL_tmps_stack[++PL_tmps_ix] = *mark;
2007 (void)SvREFCNT_inc(*mark);
2012 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2013 /* Here we go for robustness, not for speed, so we change all
2014 * the refcounts so the caller gets a live guy. Cannot set
2015 * TEMP, so sv_2mortal is out of question. */
2016 if (!CvLVALUE(cx->blk_sub.cv)) {
2021 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2023 if (gimme == G_SCALAR) {
2027 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2032 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2033 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2035 else { /* Can be a localized value
2036 * subject to deletion. */
2037 PL_tmps_stack[++PL_tmps_ix] = *mark;
2038 (void)SvREFCNT_inc(*mark);
2041 else { /* Should not happen? */
2046 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2047 (MARK > SP ? "Empty array" : "Array"));
2051 else if (gimme == G_ARRAY) {
2052 EXTEND_MORTAL(SP - newsp);
2053 for (mark = newsp + 1; mark <= SP; mark++) {
2054 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2055 /* Might be flattened array after $#array = */
2061 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2062 (*mark != &PL_sv_undef)
2064 ? "a readonly value" : "a temporary")
2065 : "an uninitialized value");
2069 /* Can be a localized value subject to deletion. */
2070 PL_tmps_stack[++PL_tmps_ix] = *mark;
2071 (void)SvREFCNT_inc(*mark);
2077 if (gimme == G_SCALAR) {
2081 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2083 *MARK = SvREFCNT_inc(TOPs);
2089 *MARK = sv_mortalcopy(TOPs);
2093 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2097 *MARK = &PL_sv_undef;
2101 else if (gimme == G_ARRAY) {
2103 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2104 if (!SvTEMP(*MARK)) {
2105 *MARK = sv_mortalcopy(*MARK);
2106 TAINT_NOT; /* Each item is independent */
2113 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2114 PL_curpm = newpm; /* ... and pop $1 et al */
2118 return pop_return();
2123 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2126 SV *dbsv = GvSV(PL_DBsub);
2128 if (!PERLDB_SUB_NN) {
2132 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2133 || strEQ(GvNAME(gv), "END")
2134 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2135 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2136 && (gv = (GV*)*svp) ))) {
2137 /* Use GV from the stack as a fallback. */
2138 /* GV is potentially non-unique, or contain different CV. */
2139 sv_setsv(dbsv, newRV((SV*)cv));
2142 gv_efullname3(dbsv, gv, Nullch);
2146 SvUPGRADE(dbsv, SVt_PVIV);
2148 SAVEIV(SvIVX(dbsv));
2149 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2153 PL_curcopdb = PL_curcop;
2154 cv = GvCV(PL_DBsub);
2164 register PERL_CONTEXT *cx;
2166 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2169 DIE(aTHX_ "Not a CODE reference");
2170 switch (SvTYPE(sv)) {
2176 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2178 SP = PL_stack_base + POPMARK;
2181 if (SvGMAGICAL(sv)) {
2183 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2186 sym = SvPV(sv, n_a);
2188 DIE(aTHX_ PL_no_usym, "a subroutine");
2189 if (PL_op->op_private & HINT_STRICT_REFS)
2190 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2191 cv = get_cv(sym, TRUE);
2195 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2196 tryAMAGICunDEREF(to_cv);
2199 if (SvTYPE(cv) == SVt_PVCV)
2204 DIE(aTHX_ "Not a CODE reference");
2209 if (!(cv = GvCVu((GV*)sv)))
2210 cv = sv_2cv(sv, &stash, &gv, FALSE);
2223 if (!CvROOT(cv) && !CvXSUB(cv)) {
2227 /* anonymous or undef'd function leaves us no recourse */
2228 if (CvANON(cv) || !(gv = CvGV(cv)))
2229 DIE(aTHX_ "Undefined subroutine called");
2231 /* autoloaded stub? */
2232 if (cv != GvCV(gv)) {
2235 /* should call AUTOLOAD now? */
2238 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2245 sub_name = sv_newmortal();
2246 gv_efullname3(sub_name, gv, Nullch);
2247 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2251 DIE(aTHX_ "Not a CODE reference");
2256 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2257 cv = get_db_sub(&sv, cv);
2259 DIE(aTHX_ "No DBsub routine");
2264 * First we need to check if the sub or method requires locking.
2265 * If so, we gain a lock on the CV, the first argument or the
2266 * stash (for static methods), as appropriate. This has to be
2267 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2268 * reschedule by returning a new op.
2270 MUTEX_LOCK(CvMUTEXP(cv));
2271 if (CvFLAGS(cv) & CVf_LOCKED) {
2273 if (CvFLAGS(cv) & CVf_METHOD) {
2274 if (SP > PL_stack_base + TOPMARK)
2275 sv = *(PL_stack_base + TOPMARK + 1);
2277 AV *av = (AV*)PL_curpad[0];
2278 if (hasargs || !av || AvFILLp(av) < 0
2279 || !(sv = AvARRAY(av)[0]))
2281 MUTEX_UNLOCK(CvMUTEXP(cv));
2282 DIE(aTHX_ "no argument for locked method call");
2289 char *stashname = SvPV(sv, len);
2290 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2296 MUTEX_UNLOCK(CvMUTEXP(cv));
2297 mg = condpair_magic(sv);
2298 MUTEX_LOCK(MgMUTEXP(mg));
2299 if (MgOWNER(mg) == thr)
2300 MUTEX_UNLOCK(MgMUTEXP(mg));
2303 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2305 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2307 MUTEX_UNLOCK(MgMUTEXP(mg));
2308 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2310 MUTEX_LOCK(CvMUTEXP(cv));
2313 * Now we have permission to enter the sub, we must distinguish
2314 * four cases. (0) It's an XSUB (in which case we don't care
2315 * about ownership); (1) it's ours already (and we're recursing);
2316 * (2) it's free (but we may already be using a cached clone);
2317 * (3) another thread owns it. Case (1) is easy: we just use it.
2318 * Case (2) means we look for a clone--if we have one, use it
2319 * otherwise grab ownership of cv. Case (3) means we look for a
2320 * clone (for non-XSUBs) and have to create one if we don't
2322 * Why look for a clone in case (2) when we could just grab
2323 * ownership of cv straight away? Well, we could be recursing,
2324 * i.e. we originally tried to enter cv while another thread
2325 * owned it (hence we used a clone) but it has been freed up
2326 * and we're now recursing into it. It may or may not be "better"
2327 * to use the clone but at least CvDEPTH can be trusted.
2329 if (CvOWNER(cv) == thr || CvXSUB(cv))
2330 MUTEX_UNLOCK(CvMUTEXP(cv));
2332 /* Case (2) or (3) */
2336 * XXX Might it be better to release CvMUTEXP(cv) while we
2337 * do the hv_fetch? We might find someone has pinched it
2338 * when we look again, in which case we would be in case
2339 * (3) instead of (2) so we'd have to clone. Would the fact
2340 * that we released the mutex more quickly make up for this?
2342 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2344 /* We already have a clone to use */
2345 MUTEX_UNLOCK(CvMUTEXP(cv));
2347 DEBUG_S(PerlIO_printf(Perl_debug_log,
2348 "entersub: %p already has clone %p:%s\n",
2349 thr, cv, SvPEEK((SV*)cv)));
2352 if (CvDEPTH(cv) == 0)
2353 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2356 /* (2) => grab ownership of cv. (3) => make clone */
2360 MUTEX_UNLOCK(CvMUTEXP(cv));
2361 DEBUG_S(PerlIO_printf(Perl_debug_log,
2362 "entersub: %p grabbing %p:%s in stash %s\n",
2363 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2364 HvNAME(CvSTASH(cv)) : "(none)"));
2367 /* Make a new clone. */
2369 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2370 MUTEX_UNLOCK(CvMUTEXP(cv));
2371 DEBUG_S((PerlIO_printf(Perl_debug_log,
2372 "entersub: %p cloning %p:%s\n",
2373 thr, cv, SvPEEK((SV*)cv))));
2375 * We're creating a new clone so there's no race
2376 * between the original MUTEX_UNLOCK and the
2377 * SvREFCNT_inc since no one will be trying to undef
2378 * it out from underneath us. At least, I don't think
2381 clonecv = cv_clone(cv);
2382 SvREFCNT_dec(cv); /* finished with this */
2383 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2384 CvOWNER(clonecv) = thr;
2388 DEBUG_S(if (CvDEPTH(cv) != 0)
2389 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2391 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2394 #endif /* USE_THREADS */
2397 #ifdef PERL_XSUB_OLDSTYLE
2398 if (CvOLDSTYLE(cv)) {
2399 I32 (*fp3)(int,int,int);
2401 register I32 items = SP - MARK;
2402 /* We dont worry to copy from @_. */
2407 PL_stack_sp = mark + 1;
2408 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2409 items = (*fp3)(CvXSUBANY(cv).any_i32,
2410 MARK - PL_stack_base + 1,
2412 PL_stack_sp = PL_stack_base + items;
2415 #endif /* PERL_XSUB_OLDSTYLE */
2417 I32 markix = TOPMARK;
2422 /* Need to copy @_ to stack. Alternative may be to
2423 * switch stack to @_, and copy return values
2424 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2428 av = (AV*)PL_curpad[0];
2430 av = GvAV(PL_defgv);
2431 #endif /* USE_THREADS */
2432 items = AvFILLp(av) + 1; /* @_ is not tieable */
2435 /* Mark is at the end of the stack. */
2437 Copy(AvARRAY(av), SP + 1, items, SV*);
2442 /* We assume first XSUB in &DB::sub is the called one. */
2444 SAVEVPTR(PL_curcop);
2445 PL_curcop = PL_curcopdb;
2448 /* Do we need to open block here? XXXX */
2449 (void)(*CvXSUB(cv))(aTHXo_ cv);
2451 /* Enforce some sanity in scalar context. */
2452 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2453 if (markix > PL_stack_sp - PL_stack_base)
2454 *(PL_stack_base + markix) = &PL_sv_undef;
2456 *(PL_stack_base + markix) = *PL_stack_sp;
2457 PL_stack_sp = PL_stack_base + markix;
2465 register I32 items = SP - MARK;
2466 AV* padlist = CvPADLIST(cv);
2467 SV** svp = AvARRAY(padlist);
2468 push_return(PL_op->op_next);
2469 PUSHBLOCK(cx, CXt_SUB, MARK);
2472 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2473 * that eval'' ops within this sub know the correct lexical space.
2474 * Owing the speed considerations, we choose to search for the cv
2475 * in doeval() instead.
2477 if (CvDEPTH(cv) < 2)
2478 (void)SvREFCNT_inc(cv);
2479 else { /* save temporaries on recursion? */
2480 PERL_STACK_OVERFLOW_CHECK();
2481 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2483 AV *newpad = newAV();
2484 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2485 I32 ix = AvFILLp((AV*)svp[1]);
2486 I32 names_fill = AvFILLp((AV*)svp[0]);
2487 svp = AvARRAY(svp[0]);
2488 for ( ;ix > 0; ix--) {
2489 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2490 char *name = SvPVX(svp[ix]);
2491 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2492 || *name == '&') /* anonymous code? */
2494 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2496 else { /* our own lexical */
2498 av_store(newpad, ix, sv = (SV*)newAV());
2499 else if (*name == '%')
2500 av_store(newpad, ix, sv = (SV*)newHV());
2502 av_store(newpad, ix, sv = NEWSV(0,0));
2506 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2507 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2510 av_store(newpad, ix, sv = NEWSV(0,0));
2514 av = newAV(); /* will be @_ */
2516 av_store(newpad, 0, (SV*)av);
2517 AvFLAGS(av) = AVf_REIFY;
2518 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2519 AvFILLp(padlist) = CvDEPTH(cv);
2520 svp = AvARRAY(padlist);
2525 AV* av = (AV*)PL_curpad[0];
2527 items = AvFILLp(av) + 1;
2529 /* Mark is at the end of the stack. */
2531 Copy(AvARRAY(av), SP + 1, items, SV*);
2536 #endif /* USE_THREADS */
2537 SAVEVPTR(PL_curpad);
2538 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2541 #endif /* USE_THREADS */
2547 DEBUG_S(PerlIO_printf(Perl_debug_log,
2548 "%p entersub preparing @_\n", thr));
2550 av = (AV*)PL_curpad[0];
2552 /* @_ is normally not REAL--this should only ever
2553 * happen when DB::sub() calls things that modify @_ */
2559 cx->blk_sub.savearray = GvAV(PL_defgv);
2560 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2561 #endif /* USE_THREADS */
2562 cx->blk_sub.argarray = av;
2565 if (items > AvMAX(av) + 1) {
2567 if (AvARRAY(av) != ary) {
2568 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2569 SvPVX(av) = (char*)ary;
2571 if (items > AvMAX(av) + 1) {
2572 AvMAX(av) = items - 1;
2573 Renew(ary,items,SV*);
2575 SvPVX(av) = (char*)ary;
2578 Copy(MARK,AvARRAY(av),items,SV*);
2579 AvFILLp(av) = items - 1;
2587 /* warning must come *after* we fully set up the context
2588 * stuff so that __WARN__ handlers can safely dounwind()
2591 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2592 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2593 sub_crush_depth(cv);
2595 DEBUG_S(PerlIO_printf(Perl_debug_log,
2596 "%p entersub returning %p\n", thr, CvSTART(cv)));
2598 RETURNOP(CvSTART(cv));
2603 Perl_sub_crush_depth(pTHX_ CV *cv)
2606 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2608 SV* tmpstr = sv_newmortal();
2609 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2610 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2621 U32 lval = PL_op->op_flags & OPf_MOD;
2622 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2626 elem -= PL_curcop->cop_arybase;
2627 if (SvTYPE(av) != SVt_PVAV)
2629 svp = av_fetch(av, elem, lval && !defer);
2631 if (!svp || *svp == &PL_sv_undef) {
2634 DIE(aTHX_ PL_no_aelem, elem);
2635 lv = sv_newmortal();
2636 sv_upgrade(lv, SVt_PVLV);
2638 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2639 LvTARG(lv) = SvREFCNT_inc(av);
2640 LvTARGOFF(lv) = elem;
2645 if (PL_op->op_private & OPpLVAL_INTRO)
2646 save_aelem(av, elem, svp);
2647 else if (PL_op->op_private & OPpDEREF)
2648 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2650 sv = (svp ? *svp : &PL_sv_undef);
2651 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2652 sv = sv_mortalcopy(sv);
2658 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2664 Perl_croak(aTHX_ PL_no_modify);
2665 if (SvTYPE(sv) < SVt_RV)
2666 sv_upgrade(sv, SVt_RV);
2667 else if (SvTYPE(sv) >= SVt_PV) {
2668 (void)SvOOK_off(sv);
2669 Safefree(SvPVX(sv));
2670 SvLEN(sv) = SvCUR(sv) = 0;
2674 SvRV(sv) = NEWSV(355,0);
2677 SvRV(sv) = (SV*)newAV();
2680 SvRV(sv) = (SV*)newHV();
2695 if (SvTYPE(rsv) == SVt_PVCV) {
2701 SETs(method_common(sv, Null(U32*)));
2708 SV* sv = cSVOP->op_sv;
2709 U32 hash = SvUVX(sv);
2711 XPUSHs(method_common(sv, &hash));
2716 S_method_common(pTHX_ SV* meth, U32* hashp)
2728 name = SvPV(meth, namelen);
2729 sv = *(PL_stack_base + TOPMARK + 1);
2740 !(packname = SvPV(sv, packlen)) ||
2741 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2742 !(ob=(SV*)GvIO(iogv)))
2745 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2746 ? !isIDFIRST_utf8((U8*)packname)
2747 : !isIDFIRST(*packname)
2750 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2751 SvOK(sv) ? "without a package or object reference"
2752 : "on an undefined value");
2754 stash = gv_stashpvn(packname, packlen, TRUE);
2757 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2760 if (!ob || !(SvOBJECT(ob)
2761 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2764 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2768 stash = SvSTASH(ob);
2771 /* shortcut for simple names */
2773 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2775 gv = (GV*)HeVAL(he);
2776 if (isGV(gv) && GvCV(gv) &&
2777 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2778 return (SV*)GvCV(gv);
2782 gv = gv_fetchmethod(stash, name);
2788 for (p = name; *p; p++) {
2790 sep = p, leaf = p + 1;
2791 else if (*p == ':' && *(p + 1) == ':')
2792 sep = p, leaf = p + 2;
2794 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2795 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2796 packlen = strlen(packname);
2800 packlen = sep - name;
2803 "Can't locate object method \"%s\" via package \"%s\"",
2806 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2811 unset_cvowner(pTHXo_ void *cvarg)
2813 register CV* cv = (CV *) cvarg;
2816 #endif /* DEBUGGING */
2818 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2819 thr, cv, SvPEEK((SV*)cv))));
2820 MUTEX_LOCK(CvMUTEXP(cv));
2821 DEBUG_S(if (CvDEPTH(cv) != 0)
2822 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2824 assert(thr == CvOWNER(cv));
2826 MUTEX_UNLOCK(CvMUTEXP(cv));
2829 #endif /* USE_THREADS */