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
36 static void unset_cvowner(pTHXo_ void *cvarg);
37 #endif /* USE_THREADS */
48 PL_curcop = (COP*)PL_op;
49 TAINT_NOT; /* Each statement is presumed innocent */
50 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
59 if (PL_op->op_private & OPpLVAL_INTRO)
60 PUSHs(save_scalar(cGVOP_gv));
62 PUSHs(GvSV(cGVOP_gv));
73 PL_curcop = (COP*)PL_op;
79 PUSHMARK(PL_stack_sp);
89 sv_setpvn(TARG,s,len);
97 XPUSHs((SV*)cGVOP_gv);
108 RETURNOP(cLOGOP->op_other);
117 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
119 temp = left; left = right; right = temp;
121 if (PL_tainting && PL_tainted && !SvTAINTED(left))
123 SvSetMagicSV(right, left);
132 RETURNOP(cLOGOP->op_other);
134 RETURNOP(cLOGOP->op_next);
140 TAINT_NOT; /* Each statement is presumed innocent */
141 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
143 oldsave = PL_scopestack[PL_scopestack_ix - 1];
144 LEAVE_SCOPE(oldsave);
150 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
159 sv_insert(TARG, 0, 0, s, len);
163 sv_setpvn(TARG,s,len);
165 else if (SvGMAGICAL(TARG))
167 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
168 sv_setpv(TARG, ""); /* Suppress warning. */
169 s = SvPV_force(TARG, len);
173 #if defined(PERL_Y2KWARN)
174 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_MISC)) {
176 char *s = SvPV(TARG,n);
177 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
178 && (n == 2 || !isDIGIT(s[n-3])))
180 Perl_warner(aTHX_ WARN_MISC, "Possible Y2K bug: %s",
181 "about to append an integer to '19'");
185 sv_catpvn(TARG,s,len);
188 sv_setpvn(TARG,s,len); /* suppress warning */
198 if (PL_op->op_flags & OPf_MOD) {
199 if (PL_op->op_private & OPpLVAL_INTRO)
200 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
201 else if (PL_op->op_private & OPpDEREF) {
203 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
212 tryAMAGICunTARGET(iter, 0);
213 PL_last_in_gv = (GV*)(*PL_stack_sp--);
214 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
215 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
216 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
219 XPUSHs((SV*)PL_last_in_gv);
222 PL_last_in_gv = (GV*)(*PL_stack_sp--);
225 return do_readline();
230 djSP; tryAMAGICbinSET(eq,0);
233 SETs(boolSV(TOPn == value));
241 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
242 DIE(aTHX_ PL_no_modify);
243 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
244 SvIVX(TOPs) != IV_MAX)
247 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
262 RETURNOP(cLOGOP->op_other);
268 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
271 SETn( left + right );
279 AV *av = GvAV(cGVOP_gv);
280 U32 lval = PL_op->op_flags & OPf_MOD;
281 SV** svp = av_fetch(av, PL_op->op_private, lval);
282 SV *sv = (svp ? *svp : &PL_sv_undef);
284 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
285 sv = sv_mortalcopy(sv);
292 djSP; dMARK; dTARGET;
294 do_join(TARG, *MARK, MARK, SP);
305 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
306 * will be enough to hold an OP*.
308 SV* sv = sv_newmortal();
309 sv_upgrade(sv, SVt_PVLV);
311 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
319 /* Oversized hot code. */
323 djSP; dMARK; dORIGMARK;
330 if (PL_op->op_flags & OPf_STACKED)
334 if (mg = SvTIED_mg((SV*)gv, 'q')) {
335 if (MARK == ORIGMARK) {
336 /* If using default handle then we need to make space to
337 * pass object as 1st arg, so move other args up ...
341 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
345 *MARK = SvTIED_obj((SV*)gv, mg);
348 call_method("PRINT", G_SCALAR);
356 if (!(io = GvIO(gv))) {
357 if (ckWARN(WARN_UNOPENED)) {
358 SV* sv = sv_newmortal();
359 gv_efullname3(sv, gv, Nullch);
360 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
363 SETERRNO(EBADF,RMS$_IFI);
366 else if (!(fp = IoOFP(io))) {
367 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
369 SV* sv = sv_newmortal();
370 gv_efullname3(sv, gv, Nullch);
371 Perl_warner(aTHX_ WARN_IO,
372 "Filehandle %s opened only for input",
375 else if (ckWARN(WARN_CLOSED))
376 report_closed_fh(gv, io, "print", "filehandle");
378 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
385 if (!do_print(*MARK, fp))
389 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
398 if (!do_print(*MARK, fp))
407 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
410 if (IoFLAGS(io) & IOf_FLUSH)
411 if (PerlIO_flush(fp) == EOF)
432 tryAMAGICunDEREF(to_av);
435 if (SvTYPE(av) != SVt_PVAV)
436 DIE(aTHX_ "Not an ARRAY reference");
437 if (PL_op->op_flags & OPf_REF) {
443 if (SvTYPE(sv) == SVt_PVAV) {
445 if (PL_op->op_flags & OPf_REF) {
453 if (SvTYPE(sv) != SVt_PVGV) {
457 if (SvGMAGICAL(sv)) {
463 if (PL_op->op_flags & OPf_REF ||
464 PL_op->op_private & HINT_STRICT_REFS)
465 DIE(aTHX_ PL_no_usym, "an ARRAY");
466 if (ckWARN(WARN_UNINITIALIZED))
468 if (GIMME == G_ARRAY) {
475 if ((PL_op->op_flags & OPf_SPECIAL) &&
476 !(PL_op->op_flags & OPf_MOD))
478 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
483 if (PL_op->op_private & HINT_STRICT_REFS)
484 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
485 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
492 if (PL_op->op_private & OPpLVAL_INTRO)
494 if (PL_op->op_flags & OPf_REF) {
501 if (GIMME == G_ARRAY) {
502 I32 maxarg = AvFILL(av) + 1;
503 (void)POPs; /* XXXX May be optimized away? */
505 if (SvRMAGICAL(av)) {
507 for (i=0; i < maxarg; i++) {
508 SV **svp = av_fetch(av, i, FALSE);
509 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
513 Copy(AvARRAY(av), SP+1, maxarg, SV*);
519 I32 maxarg = AvFILL(av) + 1;
532 tryAMAGICunDEREF(to_hv);
535 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
536 DIE(aTHX_ "Not a HASH reference");
537 if (PL_op->op_flags & OPf_REF) {
543 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
545 if (PL_op->op_flags & OPf_REF) {
553 if (SvTYPE(sv) != SVt_PVGV) {
557 if (SvGMAGICAL(sv)) {
563 if (PL_op->op_flags & OPf_REF ||
564 PL_op->op_private & HINT_STRICT_REFS)
565 DIE(aTHX_ PL_no_usym, "a HASH");
566 if (ckWARN(WARN_UNINITIALIZED))
568 if (GIMME == G_ARRAY) {
575 if ((PL_op->op_flags & OPf_SPECIAL) &&
576 !(PL_op->op_flags & OPf_MOD))
578 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
583 if (PL_op->op_private & HINT_STRICT_REFS)
584 DIE(aTHX_ PL_no_symref, sym, "a HASH");
585 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
592 if (PL_op->op_private & OPpLVAL_INTRO)
594 if (PL_op->op_flags & OPf_REF) {
601 if (GIMME == G_ARRAY) { /* array wanted */
602 *PL_stack_sp = (SV*)hv;
607 if (SvTYPE(hv) == SVt_PVAV)
608 hv = avhv_keys((AV*)hv);
610 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
611 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
623 SV **lastlelem = PL_stack_sp;
624 SV **lastrelem = PL_stack_base + POPMARK;
625 SV **firstrelem = PL_stack_base + POPMARK + 1;
626 SV **firstlelem = lastrelem + 1;
639 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
641 /* If there's a common identifier on both sides we have to take
642 * special care that assigning the identifier on the left doesn't
643 * clobber a value on the right that's used later in the list.
645 if (PL_op->op_private & OPpASSIGN_COMMON) {
646 EXTEND_MORTAL(lastrelem - firstrelem + 1);
647 for (relem = firstrelem; relem <= lastrelem; relem++) {
650 TAINT_NOT; /* Each item is independent */
651 *relem = sv_mortalcopy(sv);
660 while (lelem <= lastlelem) {
661 TAINT_NOT; /* Each item stands on its own, taintwise. */
663 switch (SvTYPE(sv)) {
666 magic = SvMAGICAL(ary) != 0;
669 av_extend(ary, lastrelem - relem);
671 while (relem <= lastrelem) { /* gobble up all the rest */
677 didstore = av_store(ary,i++,sv);
691 magic = SvMAGICAL(hash) != 0;
694 while (relem < lastrelem) { /* gobble up all the rest */
699 sv = &PL_sv_no, relem++;
700 tmpstr = NEWSV(29,0);
702 sv_setsv(tmpstr,*relem); /* value */
704 didstore = hv_store_ent(hash,sv,tmpstr,0);
706 if (SvSMAGICAL(tmpstr))
713 if (relem == lastrelem) {
716 if (ckWARN(WARN_UNSAFE)) {
717 if (relem == firstrelem &&
719 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
720 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
721 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
723 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
725 tmpstr = NEWSV(29,0);
726 didstore = hv_store_ent(hash,*relem,tmpstr,0);
728 if (SvSMAGICAL(tmpstr))
740 if (SvIMMORTAL(sv)) {
741 if (relem <= lastrelem)
745 if (relem <= lastrelem) {
746 sv_setsv(sv, *relem);
750 sv_setsv(sv, &PL_sv_undef);
755 if (PL_delaymagic & ~DM_DELAY) {
756 if (PL_delaymagic & DM_UID) {
758 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
761 (void)setreuid(PL_uid,PL_euid);
764 if ((PL_delaymagic & DM_UID) == DM_RUID) {
765 (void)setruid(PL_uid);
766 PL_delaymagic &= ~DM_RUID;
768 # endif /* HAS_SETRUID */
770 if ((PL_delaymagic & DM_UID) == DM_EUID) {
771 (void)seteuid(PL_uid);
772 PL_delaymagic &= ~DM_EUID;
774 # endif /* HAS_SETEUID */
775 if (PL_delaymagic & DM_UID) {
776 if (PL_uid != PL_euid)
777 DIE(aTHX_ "No setreuid available");
778 (void)PerlProc_setuid(PL_uid);
780 # endif /* HAS_SETREUID */
781 #endif /* HAS_SETRESUID */
782 PL_uid = PerlProc_getuid();
783 PL_euid = PerlProc_geteuid();
785 if (PL_delaymagic & DM_GID) {
787 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
790 (void)setregid(PL_gid,PL_egid);
793 if ((PL_delaymagic & DM_GID) == DM_RGID) {
794 (void)setrgid(PL_gid);
795 PL_delaymagic &= ~DM_RGID;
797 # endif /* HAS_SETRGID */
799 if ((PL_delaymagic & DM_GID) == DM_EGID) {
800 (void)setegid(PL_gid);
801 PL_delaymagic &= ~DM_EGID;
803 # endif /* HAS_SETEGID */
804 if (PL_delaymagic & DM_GID) {
805 if (PL_gid != PL_egid)
806 DIE(aTHX_ "No setregid available");
807 (void)PerlProc_setgid(PL_gid);
809 # endif /* HAS_SETREGID */
810 #endif /* HAS_SETRESGID */
811 PL_gid = PerlProc_getgid();
812 PL_egid = PerlProc_getegid();
814 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
821 else if (gimme == G_SCALAR) {
824 SETi(lastrelem - firstrelem + 1);
830 SP = firstrelem + (lastlelem - firstlelem);
831 lelem = firstlelem + (relem - firstrelem);
833 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
841 register PMOP *pm = cPMOP;
842 SV *rv = sv_newmortal();
843 SV *sv = newSVrv(rv, "Regexp");
844 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
851 register PMOP *pm = cPMOP;
856 I32 r_flags = REXEC_CHECKED;
857 char *truebase; /* Start of string */
858 register REGEXP *rx = pm->op_pmregexp;
863 I32 oldsave = PL_savestack_ix;
864 I32 update_minmatch = 1;
867 if (PL_op->op_flags & OPf_STACKED)
873 PUTBACK; /* EVAL blocks need stack_sp. */
877 DIE(aTHX_ "panic: do_match");
878 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
879 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
882 if (pm->op_pmdynflags & PMdf_USED) {
884 if (gimme == G_ARRAY)
889 if (!rx->prelen && PL_curpm) {
891 rx = pm->op_pmregexp;
893 if (rx->minlen > len) goto failure;
897 /* XXXX What part of this is needed with true \G-support? */
898 if (global = pm->op_pmflags & PMf_GLOBAL) {
900 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
901 MAGIC* mg = mg_find(TARG, 'g');
902 if (mg && mg->mg_len >= 0) {
903 if (!(rx->reganch & ROPT_GPOS_SEEN))
904 rx->endp[0] = rx->startp[0] = mg->mg_len;
905 else if (rx->reganch & ROPT_ANCH_GPOS) {
906 r_flags |= REXEC_IGNOREPOS;
907 rx->endp[0] = rx->startp[0] = mg->mg_len;
909 minmatch = (mg->mg_flags & MGf_MINMATCH);
914 if ((gimme != G_ARRAY && !global && rx->nparens)
915 || SvTEMP(TARG) || PL_sawampersand)
916 r_flags |= REXEC_COPY_STR;
918 r_flags |= REXEC_SCREAM;
920 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
921 SAVEINT(PL_multiline);
922 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
926 if (global && rx->startp[0] != -1) {
927 t = s = rx->endp[0] + truebase;
928 if ((s + rx->minlen) > strend)
930 if (update_minmatch++)
931 minmatch = had_zerolen;
933 if (rx->reganch & RE_USE_INTUIT) {
934 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
938 if ( (rx->reganch & ROPT_CHECK_ALL)
940 && ((rx->reganch & ROPT_NOSCAN)
941 || !((rx->reganch & RE_INTUIT_TAIL)
942 && (r_flags & REXEC_SCREAM))))
945 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
948 if (pm->op_pmflags & PMf_ONCE)
949 pm->op_pmdynflags |= PMdf_USED;
958 RX_MATCH_TAINTED_on(rx);
959 TAINT_IF(RX_MATCH_TAINTED(rx));
960 if (gimme == G_ARRAY) {
964 if (global && !iters)
968 SPAGAIN; /* EVAL blocks could move the stack. */
969 EXTEND(SP, iters + i);
970 EXTEND_MORTAL(iters + i);
971 for (i = !i; i <= iters; i++) {
972 PUSHs(sv_newmortal());
974 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
975 len = rx->endp[i] - rx->startp[i];
976 s = rx->startp[i] + truebase;
977 sv_setpvn(*SP, s, len);
981 had_zerolen = (rx->startp[0] != -1
982 && rx->startp[0] == rx->endp[0]);
983 PUTBACK; /* EVAL blocks may use stack */
984 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
989 LEAVE_SCOPE(oldsave);
995 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
996 mg = mg_find(TARG, 'g');
998 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
999 mg = mg_find(TARG, 'g');
1001 if (rx->startp[0] != -1) {
1002 mg->mg_len = rx->endp[0];
1003 if (rx->startp[0] == rx->endp[0])
1004 mg->mg_flags |= MGf_MINMATCH;
1006 mg->mg_flags &= ~MGf_MINMATCH;
1009 LEAVE_SCOPE(oldsave);
1013 yup: /* Confirmed by INTUIT */
1015 RX_MATCH_TAINTED_on(rx);
1016 TAINT_IF(RX_MATCH_TAINTED(rx));
1018 if (pm->op_pmflags & PMf_ONCE)
1019 pm->op_pmdynflags |= PMdf_USED;
1020 if (RX_MATCH_COPIED(rx))
1021 Safefree(rx->subbeg);
1022 RX_MATCH_COPIED_off(rx);
1023 rx->subbeg = Nullch;
1025 rx->subbeg = truebase;
1026 rx->startp[0] = s - truebase;
1027 rx->endp[0] = s - truebase + rx->minlen;
1028 rx->sublen = strend - truebase;
1031 if (PL_sawampersand) {
1034 rx->subbeg = savepvn(t, strend - t);
1035 rx->sublen = strend - t;
1036 RX_MATCH_COPIED_on(rx);
1037 off = rx->startp[0] = s - t;
1038 rx->endp[0] = off + rx->minlen;
1040 else { /* startp/endp are used by @- @+. */
1041 rx->startp[0] = s - truebase;
1042 rx->endp[0] = s - truebase + rx->minlen;
1044 LEAVE_SCOPE(oldsave);
1049 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1050 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1051 MAGIC* mg = mg_find(TARG, 'g');
1056 LEAVE_SCOPE(oldsave);
1057 if (gimme == G_ARRAY)
1063 Perl_do_readline(pTHX)
1065 dSP; dTARGETSTACKED;
1070 register IO *io = GvIO(PL_last_in_gv);
1071 register I32 type = PL_op->op_type;
1072 I32 gimme = GIMME_V;
1075 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1077 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1080 call_method("READLINE", gimme);
1083 if (gimme == G_SCALAR)
1084 SvSetMagicSV_nosteal(TARG, TOPs);
1091 if (IoFLAGS(io) & IOf_ARGV) {
1092 if (IoFLAGS(io) & IOf_START) {
1094 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1095 IoFLAGS(io) &= ~IOf_START;
1096 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1097 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1098 SvSETMAGIC(GvSV(PL_last_in_gv));
1103 fp = nextargv(PL_last_in_gv);
1104 if (!fp) { /* Note: fp != IoIFP(io) */
1105 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1108 else if (type == OP_GLOB) {
1109 SV *tmpcmd = NEWSV(55, 0);
1113 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1114 /* since spawning off a process is a real performance hit */
1116 #include <descrip.h>
1117 #include <lib$routines.h>
1120 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1121 char vmsspec[NAM$C_MAXRSS+1];
1122 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1123 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1124 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1127 struct dsc$descriptor_s wilddsc
1128 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1129 struct dsc$descriptor_vs rsdsc
1130 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1131 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1133 /* We could find out if there's an explicit dev/dir or version
1134 by peeking into lib$find_file's internal context at
1135 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1136 but that's unsupported, so I don't want to do it now and
1137 have it bite someone in the future. */
1138 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1139 cp = SvPV(tmpglob,i);
1141 if (cp[i] == ';') hasver = 1;
1143 if (sts) hasver = 1;
1147 hasdir = isunix = 1;
1150 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1155 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1157 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1158 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1159 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1160 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1161 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1162 &dfltdsc,NULL,NULL,NULL))&1)) {
1163 end = rstr + (unsigned long int) *rslt;
1164 if (!hasver) while (*end != ';') end--;
1165 *(end++) = '\n'; *end = '\0';
1166 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1168 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1173 while (*(--begin) != ']' && *begin != '>') ;
1176 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1178 if (cxt) (void)lib$find_file_end(&cxt);
1179 if (ok && sts != RMS$_NMF &&
1180 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1183 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1185 PerlIO_close(tmpfp);
1189 PerlIO_rewind(tmpfp);
1191 IoIFP(io) = fp = tmpfp;
1192 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1197 #ifdef MACOS_TRADITIONAL
1198 sv_setpv(tmpcmd, "glob ");
1199 sv_catsv(tmpcmd, tmpglob);
1200 sv_catpv(tmpcmd, " |");
1204 sv_setpv(tmpcmd, "for a in ");
1205 sv_catsv(tmpcmd, tmpglob);
1206 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1209 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1210 sv_catsv(tmpcmd, tmpglob);
1212 sv_setpv(tmpcmd, "perlglob ");
1213 sv_catsv(tmpcmd, tmpglob);
1214 sv_catpv(tmpcmd, " |");
1219 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1220 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1221 sv_catsv(tmpcmd, tmpglob);
1222 sv_catpv(tmpcmd, "' 2>/dev/null |");
1224 sv_setpv(tmpcmd, "echo ");
1225 sv_catsv(tmpcmd, tmpglob);
1227 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1229 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1232 #endif /* !DOSISH */
1233 #endif /* MACOS_TRADITIONAL */
1234 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1235 FALSE, O_RDONLY, 0, Nullfp);
1241 else if (type == OP_GLOB)
1243 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1244 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1245 || fp == PerlIO_stderr()))
1247 SV* sv = sv_newmortal();
1248 gv_efullname3(sv, PL_last_in_gv, Nullch);
1249 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1254 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1255 if (type == OP_GLOB)
1256 Perl_warner(aTHX_ WARN_CLOSED,
1257 "glob failed (can't start child: %s)",
1260 report_closed_fh(PL_last_in_gv, io, "readline", "filehandle");
1262 if (gimme == G_SCALAR) {
1263 (void)SvOK_off(TARG);
1269 if (gimme == G_SCALAR) {
1273 (void)SvUPGRADE(sv, SVt_PV);
1274 tmplen = SvLEN(sv); /* remember if already alloced */
1276 Sv_Grow(sv, 80); /* try short-buffering it */
1277 if (type == OP_RCATLINE)
1283 sv = sv_2mortal(NEWSV(57, 80));
1287 /* delay EOF state for a snarfed empty file */
1288 #define SNARF_EOF(gimme,rs,io,sv) \
1289 (gimme != G_SCALAR || SvCUR(sv) \
1290 || !RsSNARF(rs) || (IoFLAGS(io) & IOf_NOLINE) \
1291 || ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1294 if (!sv_gets(sv, fp, offset)
1295 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1297 PerlIO_clearerr(fp);
1298 if (IoFLAGS(io) & IOf_ARGV) {
1299 fp = nextargv(PL_last_in_gv);
1302 (void)do_close(PL_last_in_gv, FALSE);
1304 else if (type == OP_GLOB) {
1305 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1306 Perl_warner(aTHX_ WARN_CLOSED,
1307 "glob failed (child exited with status %d%s)",
1308 (int)(STATUS_CURRENT >> 8),
1309 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1312 if (gimme == G_SCALAR) {
1313 (void)SvOK_off(TARG);
1318 /* This should not be marked tainted if the fp is marked clean */
1319 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1326 if (type == OP_GLOB) {
1329 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1330 tmps = SvEND(sv) - 1;
1331 if (*tmps == *SvPVX(PL_rs)) {
1336 for (tmps = SvPVX(sv); *tmps; tmps++)
1337 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1338 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1340 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1341 (void)POPs; /* Unmatched wildcard? Chuck it... */
1345 if (gimme == G_ARRAY) {
1346 if (SvLEN(sv) - SvCUR(sv) > 20) {
1347 SvLEN_set(sv, SvCUR(sv)+1);
1348 Renew(SvPVX(sv), SvLEN(sv), char);
1350 sv = sv_2mortal(NEWSV(58, 80));
1353 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1354 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1358 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1359 Renew(SvPVX(sv), SvLEN(sv), char);
1368 register PERL_CONTEXT *cx;
1369 I32 gimme = OP_GIMME(PL_op, -1);
1372 if (cxstack_ix >= 0)
1373 gimme = cxstack[cxstack_ix].blk_gimme;
1381 PUSHBLOCK(cx, CXt_BLOCK, SP);
1393 U32 lval = PL_op->op_flags & OPf_MOD;
1394 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1397 if (SvTYPE(hv) == SVt_PVHV) {
1398 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1399 svp = he ? &HeVAL(he) : 0;
1401 else if (SvTYPE(hv) == SVt_PVAV) {
1402 if (PL_op->op_private & OPpLVAL_INTRO)
1403 DIE(aTHX_ "Can't localize pseudo-hash element");
1404 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1410 if (!svp || *svp == &PL_sv_undef) {
1415 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1417 lv = sv_newmortal();
1418 sv_upgrade(lv, SVt_PVLV);
1420 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1421 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1422 LvTARG(lv) = SvREFCNT_inc(hv);
1427 if (PL_op->op_private & OPpLVAL_INTRO) {
1428 if (HvNAME(hv) && isGV(*svp))
1429 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1431 save_helem(hv, keysv, svp);
1433 else if (PL_op->op_private & OPpDEREF)
1434 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1436 sv = (svp ? *svp : &PL_sv_undef);
1437 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1438 * Pushing the magical RHS on to the stack is useless, since
1439 * that magic is soon destined to be misled by the local(),
1440 * and thus the later pp_sassign() will fail to mg_get() the
1441 * old value. This should also cure problems with delayed
1442 * mg_get()s. GSAR 98-07-03 */
1443 if (!lval && SvGMAGICAL(sv))
1444 sv = sv_mortalcopy(sv);
1452 register PERL_CONTEXT *cx;
1458 if (PL_op->op_flags & OPf_SPECIAL) {
1459 cx = &cxstack[cxstack_ix];
1460 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1465 gimme = OP_GIMME(PL_op, -1);
1467 if (cxstack_ix >= 0)
1468 gimme = cxstack[cxstack_ix].blk_gimme;
1474 if (gimme == G_VOID)
1476 else if (gimme == G_SCALAR) {
1479 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1482 *MARK = sv_mortalcopy(TOPs);
1485 *MARK = &PL_sv_undef;
1489 else if (gimme == G_ARRAY) {
1490 /* in case LEAVE wipes old return values */
1491 for (mark = newsp + 1; mark <= SP; mark++) {
1492 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1493 *mark = sv_mortalcopy(*mark);
1494 TAINT_NOT; /* Each item is independent */
1498 PL_curpm = newpm; /* Don't pop $1 et al till now */
1508 register PERL_CONTEXT *cx;
1514 cx = &cxstack[cxstack_ix];
1515 if (CxTYPE(cx) != CXt_LOOP)
1516 DIE(aTHX_ "panic: pp_iter");
1518 itersvp = CxITERVAR(cx);
1519 av = cx->blk_loop.iterary;
1520 if (SvTYPE(av) != SVt_PVAV) {
1521 /* iterate ($min .. $max) */
1522 if (cx->blk_loop.iterlval) {
1523 /* string increment */
1524 register SV* cur = cx->blk_loop.iterlval;
1526 char *max = SvPV((SV*)av, maxlen);
1527 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1528 #ifndef USE_THREADS /* don't risk potential race */
1529 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1530 /* safe to reuse old SV */
1531 sv_setsv(*itersvp, cur);
1536 /* we need a fresh SV every time so that loop body sees a
1537 * completely new SV for closures/references to work as
1539 SvREFCNT_dec(*itersvp);
1540 *itersvp = newSVsv(cur);
1542 if (strEQ(SvPVX(cur), max))
1543 sv_setiv(cur, 0); /* terminate next time */
1550 /* integer increment */
1551 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1554 #ifndef USE_THREADS /* don't risk potential race */
1555 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1556 /* safe to reuse old SV */
1557 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1562 /* we need a fresh SV every time so that loop body sees a
1563 * completely new SV for closures/references to work as they
1565 SvREFCNT_dec(*itersvp);
1566 *itersvp = newSViv(cx->blk_loop.iterix++);
1572 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1575 SvREFCNT_dec(*itersvp);
1577 if (sv = (SvMAGICAL(av))
1578 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1579 : AvARRAY(av)[++cx->blk_loop.iterix])
1583 if (av != PL_curstack && SvIMMORTAL(sv)) {
1584 SV *lv = cx->blk_loop.iterlval;
1585 if (lv && SvREFCNT(lv) > 1) {
1590 SvREFCNT_dec(LvTARG(lv));
1592 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1593 sv_upgrade(lv, SVt_PVLV);
1595 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1597 LvTARG(lv) = SvREFCNT_inc(av);
1598 LvTARGOFF(lv) = cx->blk_loop.iterix;
1599 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1603 *itersvp = SvREFCNT_inc(sv);
1610 register PMOP *pm = cPMOP;
1626 register REGEXP *rx = pm->op_pmregexp;
1628 int force_on_match = 0;
1629 I32 oldsave = PL_savestack_ix;
1630 I32 update_minmatch = 1;
1632 /* known replacement string? */
1633 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1634 if (PL_op->op_flags & OPf_STACKED)
1640 if (SvREADONLY(TARG)
1641 || (SvTYPE(TARG) > SVt_PVLV
1642 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1643 DIE(aTHX_ PL_no_modify);
1646 s = SvPV(TARG, len);
1647 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1649 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1650 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1657 DIE(aTHX_ "panic: do_subst");
1660 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1661 position, once with zero-length,
1662 second time with non-zero. */
1664 if (!rx->prelen && PL_curpm) {
1666 rx = pm->op_pmregexp;
1668 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1669 ? REXEC_COPY_STR : 0;
1671 r_flags |= REXEC_SCREAM;
1672 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1673 SAVEINT(PL_multiline);
1674 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1677 if (rx->reganch & RE_USE_INTUIT) {
1678 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1682 /* How to do it in subst? */
1683 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1685 && ((rx->reganch & ROPT_NOSCAN)
1686 || !((rx->reganch & RE_INTUIT_TAIL)
1687 && (r_flags & REXEC_SCREAM))))
1692 /* only replace once? */
1693 once = !(rpm->op_pmflags & PMf_GLOBAL);
1695 /* known replacement string? */
1696 c = dstr ? SvPV(dstr, clen) : Nullch;
1698 /* can do inplace substitution? */
1699 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1700 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1701 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1702 r_flags | REXEC_CHECKED))
1706 LEAVE_SCOPE(oldsave);
1709 if (force_on_match) {
1711 s = SvPV_force(TARG, len);
1716 SvSCREAM_off(TARG); /* disable possible screamer */
1718 rxtainted |= RX_MATCH_TAINTED(rx);
1719 m = orig + rx->startp[0];
1720 d = orig + rx->endp[0];
1722 if (m - s > strend - d) { /* faster to shorten from end */
1724 Copy(c, m, clen, char);
1729 Move(d, m, i, char);
1733 SvCUR_set(TARG, m - s);
1736 else if (i = m - s) { /* faster from front */
1744 Copy(c, m, clen, char);
1749 Copy(c, d, clen, char);
1754 TAINT_IF(rxtainted & 1);
1760 if (iters++ > maxiters)
1761 DIE(aTHX_ "Substitution loop");
1762 rxtainted |= RX_MATCH_TAINTED(rx);
1763 m = rx->startp[0] + orig;
1767 Move(s, d, i, char);
1771 Copy(c, d, clen, char);
1774 s = rx->endp[0] + orig;
1775 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1777 /* don't match same null twice */
1778 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1781 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1782 Move(s, d, i+1, char); /* include the NUL */
1784 TAINT_IF(rxtainted & 1);
1786 PUSHs(sv_2mortal(newSViv((I32)iters)));
1788 (void)SvPOK_only(TARG);
1789 TAINT_IF(rxtainted);
1790 if (SvSMAGICAL(TARG)) {
1796 LEAVE_SCOPE(oldsave);
1800 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1801 r_flags | REXEC_CHECKED))
1803 if (force_on_match) {
1805 s = SvPV_force(TARG, len);
1808 rxtainted |= RX_MATCH_TAINTED(rx);
1809 dstr = NEWSV(25, len);
1810 sv_setpvn(dstr, m, s-m);
1813 register PERL_CONTEXT *cx;
1816 RETURNOP(cPMOP->op_pmreplroot);
1818 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1820 if (iters++ > maxiters)
1821 DIE(aTHX_ "Substitution loop");
1822 rxtainted |= RX_MATCH_TAINTED(rx);
1823 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1828 strend = s + (strend - m);
1830 m = rx->startp[0] + orig;
1831 sv_catpvn(dstr, s, m-s);
1832 s = rx->endp[0] + orig;
1834 sv_catpvn(dstr, c, clen);
1837 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1838 sv_catpvn(dstr, s, strend - s);
1840 (void)SvOOK_off(TARG);
1841 Safefree(SvPVX(TARG));
1842 SvPVX(TARG) = SvPVX(dstr);
1843 SvCUR_set(TARG, SvCUR(dstr));
1844 SvLEN_set(TARG, SvLEN(dstr));
1848 TAINT_IF(rxtainted & 1);
1850 PUSHs(sv_2mortal(newSViv((I32)iters)));
1852 (void)SvPOK_only(TARG);
1853 TAINT_IF(rxtainted);
1856 LEAVE_SCOPE(oldsave);
1865 LEAVE_SCOPE(oldsave);
1874 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1875 ++*PL_markstack_ptr;
1876 LEAVE; /* exit inner scope */
1879 if (PL_stack_base + *PL_markstack_ptr > SP) {
1881 I32 gimme = GIMME_V;
1883 LEAVE; /* exit outer scope */
1884 (void)POPMARK; /* pop src */
1885 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1886 (void)POPMARK; /* pop dst */
1887 SP = PL_stack_base + POPMARK; /* pop original mark */
1888 if (gimme == G_SCALAR) {
1892 else if (gimme == G_ARRAY)
1899 ENTER; /* enter inner scope */
1902 src = PL_stack_base[*PL_markstack_ptr];
1906 RETURNOP(cLOGOP->op_other);
1917 register PERL_CONTEXT *cx;
1923 if (gimme == G_SCALAR) {
1926 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1928 *MARK = SvREFCNT_inc(TOPs);
1934 *MARK = sv_mortalcopy(TOPs);
1938 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1942 *MARK = &PL_sv_undef;
1946 else if (gimme == G_ARRAY) {
1947 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1948 if (!SvTEMP(*MARK)) {
1949 *MARK = sv_mortalcopy(*MARK);
1950 TAINT_NOT; /* Each item is independent */
1956 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
1957 PL_curpm = newpm; /* ... and pop $1 et al */
1961 return pop_return();
1964 /* This duplicates the above code because the above code must not
1965 * get any slower by more conditions */
1973 register PERL_CONTEXT *cx;
1980 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
1981 /* We are an argument to a function or grep().
1982 * This kind of lvalueness was legal before lvalue
1983 * subroutines too, so be backward compatible:
1984 * cannot report errors. */
1986 /* Scalar context *is* possible, on the LHS of -> only,
1987 * as in f()->meth(). But this is not an lvalue. */
1988 if (gimme == G_SCALAR)
1990 if (gimme == G_ARRAY) {
1991 if (!CvLVALUE(cx->blk_sub.cv))
1992 goto temporise_array;
1993 EXTEND_MORTAL(SP - newsp);
1994 for (mark = newsp + 1; mark <= SP; mark++) {
1997 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
1998 *mark = sv_mortalcopy(*mark);
2000 /* Can be a localized value subject to deletion. */
2001 PL_tmps_stack[++PL_tmps_ix] = *mark;
2002 (void)SvREFCNT_inc(*mark);
2007 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2008 /* Here we go for robustness, not for speed, so we change all
2009 * the refcounts so the caller gets a live guy. Cannot set
2010 * TEMP, so sv_2mortal is out of question. */
2011 if (!CvLVALUE(cx->blk_sub.cv)) {
2016 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2018 if (gimme == G_SCALAR) {
2022 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2027 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2028 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2030 else { /* Can be a localized value
2031 * subject to deletion. */
2032 PL_tmps_stack[++PL_tmps_ix] = *mark;
2033 (void)SvREFCNT_inc(*mark);
2036 else { /* Should not happen? */
2041 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2042 (MARK > SP ? "Empty array" : "Array"));
2046 else if (gimme == G_ARRAY) {
2047 EXTEND_MORTAL(SP - newsp);
2048 for (mark = newsp + 1; mark <= SP; mark++) {
2049 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2050 /* Might be flattened array after $#array = */
2056 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2057 (*mark != &PL_sv_undef)
2059 ? "a readonly value" : "a temporary")
2060 : "an uninitialized value");
2064 /* Can be a localized value subject to deletion. */
2065 PL_tmps_stack[++PL_tmps_ix] = *mark;
2066 (void)SvREFCNT_inc(*mark);
2072 if (gimme == G_SCALAR) {
2076 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2078 *MARK = SvREFCNT_inc(TOPs);
2084 *MARK = sv_mortalcopy(TOPs);
2088 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2092 *MARK = &PL_sv_undef;
2096 else if (gimme == G_ARRAY) {
2098 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2099 if (!SvTEMP(*MARK)) {
2100 *MARK = sv_mortalcopy(*MARK);
2101 TAINT_NOT; /* Each item is independent */
2108 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2109 PL_curpm = newpm; /* ... and pop $1 et al */
2113 return pop_return();
2118 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2121 SV *dbsv = GvSV(PL_DBsub);
2123 if (!PERLDB_SUB_NN) {
2127 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2128 || strEQ(GvNAME(gv), "END")
2129 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2130 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2131 && (gv = (GV*)*svp) ))) {
2132 /* Use GV from the stack as a fallback. */
2133 /* GV is potentially non-unique, or contain different CV. */
2134 sv_setsv(dbsv, newRV((SV*)cv));
2137 gv_efullname3(dbsv, gv, Nullch);
2141 SvUPGRADE(dbsv, SVt_PVIV);
2143 SAVEIV(SvIVX(dbsv));
2144 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2148 PL_curcopdb = PL_curcop;
2149 cv = GvCV(PL_DBsub);
2159 register PERL_CONTEXT *cx;
2161 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2164 DIE(aTHX_ "Not a CODE reference");
2165 switch (SvTYPE(sv)) {
2171 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2173 SP = PL_stack_base + POPMARK;
2176 if (SvGMAGICAL(sv)) {
2178 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2181 sym = SvPV(sv, n_a);
2183 DIE(aTHX_ PL_no_usym, "a subroutine");
2184 if (PL_op->op_private & HINT_STRICT_REFS)
2185 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2186 cv = get_cv(sym, TRUE);
2190 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2191 tryAMAGICunDEREF(to_cv);
2194 if (SvTYPE(cv) == SVt_PVCV)
2199 DIE(aTHX_ "Not a CODE reference");
2204 if (!(cv = GvCVu((GV*)sv)))
2205 cv = sv_2cv(sv, &stash, &gv, FALSE);
2218 if (!CvROOT(cv) && !CvXSUB(cv)) {
2222 /* anonymous or undef'd function leaves us no recourse */
2223 if (CvANON(cv) || !(gv = CvGV(cv)))
2224 DIE(aTHX_ "Undefined subroutine called");
2226 /* autoloaded stub? */
2227 if (cv != GvCV(gv)) {
2230 /* should call AUTOLOAD now? */
2233 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2240 sub_name = sv_newmortal();
2241 gv_efullname3(sub_name, gv, Nullch);
2242 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2246 DIE(aTHX_ "Not a CODE reference");
2251 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2252 cv = get_db_sub(&sv, cv);
2254 DIE(aTHX_ "No DBsub routine");
2259 * First we need to check if the sub or method requires locking.
2260 * If so, we gain a lock on the CV, the first argument or the
2261 * stash (for static methods), as appropriate. This has to be
2262 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2263 * reschedule by returning a new op.
2265 MUTEX_LOCK(CvMUTEXP(cv));
2266 if (CvFLAGS(cv) & CVf_LOCKED) {
2268 if (CvFLAGS(cv) & CVf_METHOD) {
2269 if (SP > PL_stack_base + TOPMARK)
2270 sv = *(PL_stack_base + TOPMARK + 1);
2272 AV *av = (AV*)PL_curpad[0];
2273 if (hasargs || !av || AvFILLp(av) < 0
2274 || !(sv = AvARRAY(av)[0]))
2276 MUTEX_UNLOCK(CvMUTEXP(cv));
2277 DIE(aTHX_ "no argument for locked method call");
2284 char *stashname = SvPV(sv, len);
2285 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2291 MUTEX_UNLOCK(CvMUTEXP(cv));
2292 mg = condpair_magic(sv);
2293 MUTEX_LOCK(MgMUTEXP(mg));
2294 if (MgOWNER(mg) == thr)
2295 MUTEX_UNLOCK(MgMUTEXP(mg));
2298 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2300 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2302 MUTEX_UNLOCK(MgMUTEXP(mg));
2303 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2305 MUTEX_LOCK(CvMUTEXP(cv));
2308 * Now we have permission to enter the sub, we must distinguish
2309 * four cases. (0) It's an XSUB (in which case we don't care
2310 * about ownership); (1) it's ours already (and we're recursing);
2311 * (2) it's free (but we may already be using a cached clone);
2312 * (3) another thread owns it. Case (1) is easy: we just use it.
2313 * Case (2) means we look for a clone--if we have one, use it
2314 * otherwise grab ownership of cv. Case (3) means we look for a
2315 * clone (for non-XSUBs) and have to create one if we don't
2317 * Why look for a clone in case (2) when we could just grab
2318 * ownership of cv straight away? Well, we could be recursing,
2319 * i.e. we originally tried to enter cv while another thread
2320 * owned it (hence we used a clone) but it has been freed up
2321 * and we're now recursing into it. It may or may not be "better"
2322 * to use the clone but at least CvDEPTH can be trusted.
2324 if (CvOWNER(cv) == thr || CvXSUB(cv))
2325 MUTEX_UNLOCK(CvMUTEXP(cv));
2327 /* Case (2) or (3) */
2331 * XXX Might it be better to release CvMUTEXP(cv) while we
2332 * do the hv_fetch? We might find someone has pinched it
2333 * when we look again, in which case we would be in case
2334 * (3) instead of (2) so we'd have to clone. Would the fact
2335 * that we released the mutex more quickly make up for this?
2337 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2339 /* We already have a clone to use */
2340 MUTEX_UNLOCK(CvMUTEXP(cv));
2342 DEBUG_S(PerlIO_printf(Perl_debug_log,
2343 "entersub: %p already has clone %p:%s\n",
2344 thr, cv, SvPEEK((SV*)cv)));
2347 if (CvDEPTH(cv) == 0)
2348 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2351 /* (2) => grab ownership of cv. (3) => make clone */
2355 MUTEX_UNLOCK(CvMUTEXP(cv));
2356 DEBUG_S(PerlIO_printf(Perl_debug_log,
2357 "entersub: %p grabbing %p:%s in stash %s\n",
2358 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2359 HvNAME(CvSTASH(cv)) : "(none)"));
2362 /* Make a new clone. */
2364 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2365 MUTEX_UNLOCK(CvMUTEXP(cv));
2366 DEBUG_S((PerlIO_printf(Perl_debug_log,
2367 "entersub: %p cloning %p:%s\n",
2368 thr, cv, SvPEEK((SV*)cv))));
2370 * We're creating a new clone so there's no race
2371 * between the original MUTEX_UNLOCK and the
2372 * SvREFCNT_inc since no one will be trying to undef
2373 * it out from underneath us. At least, I don't think
2376 clonecv = cv_clone(cv);
2377 SvREFCNT_dec(cv); /* finished with this */
2378 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2379 CvOWNER(clonecv) = thr;
2383 DEBUG_S(if (CvDEPTH(cv) != 0)
2384 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2386 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2389 #endif /* USE_THREADS */
2392 #ifdef PERL_XSUB_OLDSTYLE
2393 if (CvOLDSTYLE(cv)) {
2394 I32 (*fp3)(int,int,int);
2396 register I32 items = SP - MARK;
2397 /* We dont worry to copy from @_. */
2402 PL_stack_sp = mark + 1;
2403 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2404 items = (*fp3)(CvXSUBANY(cv).any_i32,
2405 MARK - PL_stack_base + 1,
2407 PL_stack_sp = PL_stack_base + items;
2410 #endif /* PERL_XSUB_OLDSTYLE */
2412 I32 markix = TOPMARK;
2417 /* Need to copy @_ to stack. Alternative may be to
2418 * switch stack to @_, and copy return values
2419 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2423 av = (AV*)PL_curpad[0];
2425 av = GvAV(PL_defgv);
2426 #endif /* USE_THREADS */
2427 items = AvFILLp(av) + 1; /* @_ is not tieable */
2430 /* Mark is at the end of the stack. */
2432 Copy(AvARRAY(av), SP + 1, items, SV*);
2437 /* We assume first XSUB in &DB::sub is the called one. */
2439 SAVEVPTR(PL_curcop);
2440 PL_curcop = PL_curcopdb;
2443 /* Do we need to open block here? XXXX */
2444 (void)(*CvXSUB(cv))(aTHXo_ cv);
2446 /* Enforce some sanity in scalar context. */
2447 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2448 if (markix > PL_stack_sp - PL_stack_base)
2449 *(PL_stack_base + markix) = &PL_sv_undef;
2451 *(PL_stack_base + markix) = *PL_stack_sp;
2452 PL_stack_sp = PL_stack_base + markix;
2460 register I32 items = SP - MARK;
2461 AV* padlist = CvPADLIST(cv);
2462 SV** svp = AvARRAY(padlist);
2463 push_return(PL_op->op_next);
2464 PUSHBLOCK(cx, CXt_SUB, MARK);
2467 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2468 * that eval'' ops within this sub know the correct lexical space.
2469 * Owing the speed considerations, we choose to search for the cv
2470 * in doeval() instead.
2472 if (CvDEPTH(cv) < 2)
2473 (void)SvREFCNT_inc(cv);
2474 else { /* save temporaries on recursion? */
2475 PERL_STACK_OVERFLOW_CHECK();
2476 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2478 AV *newpad = newAV();
2479 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2480 I32 ix = AvFILLp((AV*)svp[1]);
2481 I32 names_fill = AvFILLp((AV*)svp[0]);
2482 svp = AvARRAY(svp[0]);
2483 for ( ;ix > 0; ix--) {
2484 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2485 char *name = SvPVX(svp[ix]);
2486 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2487 || *name == '&') /* anonymous code? */
2489 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2491 else { /* our own lexical */
2493 av_store(newpad, ix, sv = (SV*)newAV());
2494 else if (*name == '%')
2495 av_store(newpad, ix, sv = (SV*)newHV());
2497 av_store(newpad, ix, sv = NEWSV(0,0));
2501 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2502 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2505 av_store(newpad, ix, sv = NEWSV(0,0));
2509 av = newAV(); /* will be @_ */
2511 av_store(newpad, 0, (SV*)av);
2512 AvFLAGS(av) = AVf_REIFY;
2513 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2514 AvFILLp(padlist) = CvDEPTH(cv);
2515 svp = AvARRAY(padlist);
2520 AV* av = (AV*)PL_curpad[0];
2522 items = AvFILLp(av) + 1;
2524 /* Mark is at the end of the stack. */
2526 Copy(AvARRAY(av), SP + 1, items, SV*);
2531 #endif /* USE_THREADS */
2532 SAVEVPTR(PL_curpad);
2533 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2536 #endif /* USE_THREADS */
2542 DEBUG_S(PerlIO_printf(Perl_debug_log,
2543 "%p entersub preparing @_\n", thr));
2545 av = (AV*)PL_curpad[0];
2547 /* @_ is normally not REAL--this should only ever
2548 * happen when DB::sub() calls things that modify @_ */
2554 cx->blk_sub.savearray = GvAV(PL_defgv);
2555 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2556 #endif /* USE_THREADS */
2557 cx->blk_sub.argarray = av;
2560 if (items > AvMAX(av) + 1) {
2562 if (AvARRAY(av) != ary) {
2563 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2564 SvPVX(av) = (char*)ary;
2566 if (items > AvMAX(av) + 1) {
2567 AvMAX(av) = items - 1;
2568 Renew(ary,items,SV*);
2570 SvPVX(av) = (char*)ary;
2573 Copy(MARK,AvARRAY(av),items,SV*);
2574 AvFILLp(av) = items - 1;
2582 /* warning must come *after* we fully set up the context
2583 * stuff so that __WARN__ handlers can safely dounwind()
2586 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2587 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2588 sub_crush_depth(cv);
2590 DEBUG_S(PerlIO_printf(Perl_debug_log,
2591 "%p entersub returning %p\n", thr, CvSTART(cv)));
2593 RETURNOP(CvSTART(cv));
2598 Perl_sub_crush_depth(pTHX_ CV *cv)
2601 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2603 SV* tmpstr = sv_newmortal();
2604 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2605 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2616 U32 lval = PL_op->op_flags & OPf_MOD;
2617 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2621 elem -= PL_curcop->cop_arybase;
2622 if (SvTYPE(av) != SVt_PVAV)
2624 svp = av_fetch(av, elem, lval && !defer);
2626 if (!svp || *svp == &PL_sv_undef) {
2629 DIE(aTHX_ PL_no_aelem, elem);
2630 lv = sv_newmortal();
2631 sv_upgrade(lv, SVt_PVLV);
2633 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2634 LvTARG(lv) = SvREFCNT_inc(av);
2635 LvTARGOFF(lv) = elem;
2640 if (PL_op->op_private & OPpLVAL_INTRO)
2641 save_aelem(av, elem, svp);
2642 else if (PL_op->op_private & OPpDEREF)
2643 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2645 sv = (svp ? *svp : &PL_sv_undef);
2646 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2647 sv = sv_mortalcopy(sv);
2653 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2659 Perl_croak(aTHX_ PL_no_modify);
2660 if (SvTYPE(sv) < SVt_RV)
2661 sv_upgrade(sv, SVt_RV);
2662 else if (SvTYPE(sv) >= SVt_PV) {
2663 (void)SvOOK_off(sv);
2664 Safefree(SvPVX(sv));
2665 SvLEN(sv) = SvCUR(sv) = 0;
2669 SvRV(sv) = NEWSV(355,0);
2672 SvRV(sv) = (SV*)newAV();
2675 SvRV(sv) = (SV*)newHV();
2690 if (SvTYPE(rsv) == SVt_PVCV) {
2696 SETs(method_common(sv, Null(U32*)));
2703 SV* sv = cSVOP->op_sv;
2704 U32 hash = SvUVX(sv);
2706 XPUSHs(method_common(sv, &hash));
2711 S_method_common(pTHX_ SV* meth, U32* hashp)
2723 name = SvPV(meth, namelen);
2724 sv = *(PL_stack_base + TOPMARK + 1);
2735 !(packname = SvPV(sv, packlen)) ||
2736 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2737 !(ob=(SV*)GvIO(iogv)))
2740 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2741 ? !isIDFIRST_utf8((U8*)packname)
2742 : !isIDFIRST(*packname)
2745 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2746 SvOK(sv) ? "without a package or object reference"
2747 : "on an undefined value");
2749 stash = gv_stashpvn(packname, packlen, TRUE);
2752 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2755 if (!ob || !SvOBJECT(ob))
2756 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2759 stash = SvSTASH(ob);
2762 /* shortcut for simple names */
2764 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2766 gv = (GV*)HeVAL(he);
2767 if (isGV(gv) && GvCV(gv) &&
2768 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2769 return (SV*)GvCV(gv);
2773 gv = gv_fetchmethod(stash, name);
2779 for (p = name; *p; p++) {
2781 sep = p, leaf = p + 1;
2782 else if (*p == ':' && *(p + 1) == ':')
2783 sep = p, leaf = p + 2;
2785 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2786 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2787 packlen = strlen(packname);
2791 packlen = sep - name;
2794 "Can't locate object method \"%s\" via package \"%s\"",
2797 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2802 unset_cvowner(pTHXo_ void *cvarg)
2804 register CV* cv = (CV *) cvarg;
2807 #endif /* DEBUGGING */
2809 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2810 thr, cv, SvPEEK((SV*)cv))));
2811 MUTEX_LOCK(CvMUTEXP(cv));
2812 DEBUG_S(if (CvDEPTH(cv) != 0)
2813 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2815 assert(thr == CvOWNER(cv));
2817 MUTEX_UNLOCK(CvMUTEXP(cv));
2820 #endif /* USE_THREADS */