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!
31 #define HOP(pos,off) (IN_UTF8 ? utf8_hop(pos, off) : (pos + off))
37 unset_cvowner(void *cvarg)
39 register CV* cv = (CV *) cvarg;
42 #endif /* DEBUGGING */
44 DEBUG_S((PerlIO_printf(PerlIO_stderr(), "%p unsetting CvOWNER of %p:%s\n",
45 thr, cv, SvPEEK((SV*)cv))));
46 MUTEX_LOCK(CvMUTEXP(cv));
47 DEBUG_S(if (CvDEPTH(cv) != 0)
48 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
50 assert(thr == CvOWNER(cv));
52 MUTEX_UNLOCK(CvMUTEXP(cv));
55 #endif /* USE_THREADS */
66 PL_curcop = (COP*)PL_op;
67 TAINT_NOT; /* Each statement is presumed innocent */
68 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
77 if (PL_op->op_private & OPpLVAL_INTRO)
78 PUSHs(save_scalar(cGVOP->op_gv));
80 PUSHs(GvSV(cGVOP->op_gv));
91 PUSHMARK(PL_stack_sp);
101 sv_setpvn(TARG,s,len);
109 XPUSHs((SV*)cGVOP->op_gv);
120 RETURNOP(cLOGOP->op_other);
129 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
131 temp = left; left = right; right = temp;
133 if (PL_tainting && PL_tainted && !SvTAINTED(left))
135 SvSetMagicSV(right, left);
144 RETURNOP(cCONDOP->op_true);
146 RETURNOP(cCONDOP->op_false);
152 TAINT_NOT; /* Each statement is presumed innocent */
153 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
155 oldsave = PL_scopestack[PL_scopestack_ix - 1];
156 LEAVE_SCOPE(oldsave);
162 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
169 sv_setpvn(TARG,s,len);
171 else if (SvGMAGICAL(TARG))
173 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
174 sv_setpv(TARG, ""); /* Suppress warning. */
175 s = SvPV_force(TARG, len);
179 sv_catpvn(TARG,s,len);
181 sv_setpvn(TARG,s,len); /* suppress warning */
191 if (PL_op->op_flags & OPf_MOD) {
192 if (PL_op->op_private & OPpLVAL_INTRO)
193 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
194 else if (PL_op->op_private & OPpDEREF) {
196 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
205 tryAMAGICunTARGET(iter, 0);
206 PL_last_in_gv = (GV*)(*PL_stack_sp--);
207 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
208 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
209 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
212 XPUSHs((SV*)PL_last_in_gv);
215 PL_last_in_gv = (GV*)(*PL_stack_sp--);
218 return do_readline();
223 djSP; tryAMAGICbinSET(eq,0);
226 SETs(boolSV(TOPn == value));
234 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
236 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
237 SvIVX(TOPs) != IV_MAX)
240 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
255 RETURNOP(cLOGOP->op_other);
261 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
264 SETn( left + right );
272 AV *av = GvAV((GV*)cSVOP->op_sv);
273 U32 lval = PL_op->op_flags & OPf_MOD;
274 SV** svp = av_fetch(av, PL_op->op_private, lval);
275 SV *sv = (svp ? *svp : &PL_sv_undef);
277 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
278 sv = sv_mortalcopy(sv);
285 djSP; dMARK; dTARGET;
287 do_join(TARG, *MARK, MARK, SP);
298 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
299 * will be enough to hold an OP*.
301 SV* sv = sv_newmortal();
302 sv_upgrade(sv, SVt_PVLV);
304 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
312 /* Oversized hot code. */
316 djSP; dMARK; dORIGMARK;
323 if (PL_op->op_flags & OPf_STACKED)
327 if (mg = SvTIED_mg((SV*)gv, 'q')) {
328 if (MARK == ORIGMARK) {
329 /* If using default handle then we need to make space to
330 * pass object as 1st arg, so move other args up ...
334 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
338 *MARK = SvTIED_obj((SV*)gv, mg);
341 perl_call_method("PRINT", G_SCALAR);
349 if (!(io = GvIO(gv))) {
350 if (ckWARN(WARN_UNOPENED)) {
351 SV* sv = sv_newmortal();
352 gv_fullname3(sv, gv, Nullch);
353 warner(WARN_UNOPENED, "Filehandle %s never opened", SvPV(sv,n_a));
356 SETERRNO(EBADF,RMS$_IFI);
359 else if (!(fp = IoOFP(io))) {
360 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
361 SV* sv = sv_newmortal();
362 gv_fullname3(sv, gv, Nullch);
364 warner(WARN_IO, "Filehandle %s opened only for input",
366 else if (ckWARN(WARN_CLOSED))
367 warner(WARN_CLOSED, "print on closed filehandle %s",
370 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
377 if (!do_print(*MARK, fp))
381 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
390 if (!do_print(*MARK, fp))
399 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
402 if (IoFLAGS(io) & IOf_FLUSH)
403 if (PerlIO_flush(fp) == EOF)
424 tryAMAGICunDEREF(to_av);
427 if (SvTYPE(av) != SVt_PVAV)
428 DIE("Not an ARRAY reference");
429 if (PL_op->op_flags & OPf_REF) {
435 if (SvTYPE(sv) == SVt_PVAV) {
437 if (PL_op->op_flags & OPf_REF) {
445 if (SvTYPE(sv) != SVt_PVGV) {
449 if (SvGMAGICAL(sv)) {
455 if (PL_op->op_flags & OPf_REF ||
456 PL_op->op_private & HINT_STRICT_REFS)
457 DIE(PL_no_usym, "an ARRAY");
458 if (ckWARN(WARN_UNINITIALIZED))
459 warner(WARN_UNINITIALIZED, PL_warn_uninit);
460 if (GIMME == G_ARRAY) {
467 if ((PL_op->op_flags & OPf_SPECIAL) &&
468 !(PL_op->op_flags & OPf_MOD))
470 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
475 if (PL_op->op_private & HINT_STRICT_REFS)
476 DIE(PL_no_symref, sym, "an ARRAY");
477 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
484 if (PL_op->op_private & OPpLVAL_INTRO)
486 if (PL_op->op_flags & OPf_REF) {
493 if (GIMME == G_ARRAY) {
494 I32 maxarg = AvFILL(av) + 1;
495 (void)POPs; /* XXXX May be optimized away? */
497 if (SvRMAGICAL(av)) {
499 for (i=0; i < maxarg; i++) {
500 SV **svp = av_fetch(av, i, FALSE);
501 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
505 Copy(AvARRAY(av), SP+1, maxarg, SV*);
511 I32 maxarg = AvFILL(av) + 1;
524 tryAMAGICunDEREF(to_hv);
527 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
528 DIE("Not a HASH reference");
529 if (PL_op->op_flags & OPf_REF) {
535 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
537 if (PL_op->op_flags & OPf_REF) {
545 if (SvTYPE(sv) != SVt_PVGV) {
549 if (SvGMAGICAL(sv)) {
555 if (PL_op->op_flags & OPf_REF ||
556 PL_op->op_private & HINT_STRICT_REFS)
557 DIE(PL_no_usym, "a HASH");
558 if (ckWARN(WARN_UNINITIALIZED))
559 warner(WARN_UNINITIALIZED, PL_warn_uninit);
560 if (GIMME == G_ARRAY) {
567 if ((PL_op->op_flags & OPf_SPECIAL) &&
568 !(PL_op->op_flags & OPf_MOD))
570 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
575 if (PL_op->op_private & HINT_STRICT_REFS)
576 DIE(PL_no_symref, sym, "a HASH");
577 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
584 if (PL_op->op_private & OPpLVAL_INTRO)
586 if (PL_op->op_flags & OPf_REF) {
593 if (GIMME == G_ARRAY) { /* array wanted */
594 *PL_stack_sp = (SV*)hv;
599 if (SvTYPE(hv) == SVt_PVAV)
600 hv = avhv_keys((AV*)hv);
602 sv_setpvf(TARG, "%ld/%ld",
603 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
615 SV **lastlelem = PL_stack_sp;
616 SV **lastrelem = PL_stack_base + POPMARK;
617 SV **firstrelem = PL_stack_base + POPMARK + 1;
618 SV **firstlelem = lastrelem + 1;
631 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
633 /* If there's a common identifier on both sides we have to take
634 * special care that assigning the identifier on the left doesn't
635 * clobber a value on the right that's used later in the list.
637 if (PL_op->op_private & OPpASSIGN_COMMON) {
638 EXTEND_MORTAL(lastrelem - firstrelem + 1);
639 for (relem = firstrelem; relem <= lastrelem; relem++) {
642 TAINT_NOT; /* Each item is independent */
643 *relem = sv_mortalcopy(sv);
652 while (lelem <= lastlelem) {
653 TAINT_NOT; /* Each item stands on its own, taintwise. */
655 switch (SvTYPE(sv)) {
658 magic = SvMAGICAL(ary) != 0;
661 av_extend(ary, lastrelem - relem);
663 while (relem <= lastrelem) { /* gobble up all the rest */
669 didstore = av_store(ary,i++,sv);
683 magic = SvMAGICAL(hash) != 0;
686 while (relem < lastrelem) { /* gobble up all the rest */
691 sv = &PL_sv_no, relem++;
692 tmpstr = NEWSV(29,0);
694 sv_setsv(tmpstr,*relem); /* value */
696 didstore = hv_store_ent(hash,sv,tmpstr,0);
698 if (SvSMAGICAL(tmpstr))
705 if (relem == lastrelem) {
708 if (ckWARN(WARN_UNSAFE)) {
709 if (relem == firstrelem &&
711 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
712 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
713 warner(WARN_UNSAFE, "Reference found where even-sized list expected");
715 warner(WARN_UNSAFE, "Odd number of elements in hash assignment");
717 tmpstr = NEWSV(29,0);
718 didstore = hv_store_ent(hash,*relem,tmpstr,0);
720 if (SvSMAGICAL(tmpstr))
732 if (SvIMMORTAL(sv)) {
733 if (relem <= lastrelem)
737 if (relem <= lastrelem) {
738 sv_setsv(sv, *relem);
742 sv_setsv(sv, &PL_sv_undef);
747 if (PL_delaymagic & ~DM_DELAY) {
748 if (PL_delaymagic & DM_UID) {
750 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
753 (void)setreuid(PL_uid,PL_euid);
756 if ((PL_delaymagic & DM_UID) == DM_RUID) {
757 (void)setruid(PL_uid);
758 PL_delaymagic &= ~DM_RUID;
760 # endif /* HAS_SETRUID */
762 if ((PL_delaymagic & DM_UID) == DM_EUID) {
763 (void)seteuid(PL_uid);
764 PL_delaymagic &= ~DM_EUID;
766 # endif /* HAS_SETEUID */
767 if (PL_delaymagic & DM_UID) {
768 if (PL_uid != PL_euid)
769 DIE("No setreuid available");
770 (void)PerlProc_setuid(PL_uid);
772 # endif /* HAS_SETREUID */
773 #endif /* HAS_SETRESUID */
774 PL_uid = (int)PerlProc_getuid();
775 PL_euid = (int)PerlProc_geteuid();
777 if (PL_delaymagic & DM_GID) {
779 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
782 (void)setregid(PL_gid,PL_egid);
785 if ((PL_delaymagic & DM_GID) == DM_RGID) {
786 (void)setrgid(PL_gid);
787 PL_delaymagic &= ~DM_RGID;
789 # endif /* HAS_SETRGID */
791 if ((PL_delaymagic & DM_GID) == DM_EGID) {
792 (void)setegid(PL_gid);
793 PL_delaymagic &= ~DM_EGID;
795 # endif /* HAS_SETEGID */
796 if (PL_delaymagic & DM_GID) {
797 if (PL_gid != PL_egid)
798 DIE("No setregid available");
799 (void)PerlProc_setgid(PL_gid);
801 # endif /* HAS_SETREGID */
802 #endif /* HAS_SETRESGID */
803 PL_gid = (int)PerlProc_getgid();
804 PL_egid = (int)PerlProc_getegid();
806 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
813 else if (gimme == G_SCALAR) {
816 SETi(lastrelem - firstrelem + 1);
822 SP = firstrelem + (lastlelem - firstlelem);
823 lelem = firstlelem + (relem - firstrelem);
825 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
833 register PMOP *pm = cPMOP;
834 SV *rv = sv_newmortal();
835 SV *sv = newSVrv(rv, "Regexp");
836 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
843 register PMOP *pm = cPMOP;
849 char *truebase; /* Start of string, may be
850 relocated if REx engine
851 copies the string. */
852 register REGEXP *rx = pm->op_pmregexp;
857 I32 oldsave = PL_savestack_ix;
858 I32 update_minmatch = 1;
861 if (PL_op->op_flags & OPf_STACKED)
867 PUTBACK; /* EVAL blocks need stack_sp. */
871 DIE("panic: do_match");
872 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
873 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
876 if (pm->op_pmdynflags & PMdf_USED) {
878 if (gimme == G_ARRAY)
883 if (!rx->prelen && PL_curpm) {
885 rx = pm->op_pmregexp;
887 if (rx->minlen > len) goto failure;
891 /* XXXX What part of this is needed with true \G-support? */
892 if (global = pm->op_pmflags & PMf_GLOBAL) {
894 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
895 MAGIC* mg = mg_find(TARG, 'g');
896 if (mg && mg->mg_len >= 0) {
897 if (!(rx->reganch & ROPT_GPOS_SEEN))
898 rx->endp[0] = rx->startp[0] = mg->mg_len;
899 else if (rx->reganch & ROPT_ANCH_GPOS) {
900 r_flags |= REXEC_IGNOREPOS;
901 rx->endp[0] = rx->startp[0] = mg->mg_len;
903 minmatch = (mg->mg_flags & MGf_MINMATCH);
908 if ((gimme != G_ARRAY && !global && rx->nparens)
909 || SvTEMP(TARG) || PL_sawampersand)
910 r_flags |= REXEC_COPY_STR;
911 if (SvSCREAM(TARG) && rx->check_substr
912 && SvTYPE(rx->check_substr) == SVt_PVBM
913 && SvVALID(rx->check_substr))
914 r_flags |= REXEC_SCREAM;
916 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
917 SAVEINT(PL_multiline);
918 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
922 if (global && rx->startp[0] != -1) {
923 t = s = rx->endp[0] + truebase;
924 if ((s + rx->minlen) > strend)
926 if (update_minmatch++)
927 minmatch = had_zerolen;
929 if (rx->check_substr) {
930 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
931 SV *c = rx->check_substr;
933 if (r_flags & REXEC_SCREAM) {
937 if (PL_screamfirst[BmRARE(c)] < 0
938 && !( BmRARE(c) == '\n' && (BmPREVIOUS(c) == SvCUR(c) - 1)
942 b = (char*)HOP((U8*)s, rx->check_offset_min);
943 if (!(s = screaminstr(TARG, c, b - s, 0, &p, 0)))
946 if ((rx->reganch & ROPT_CHECK_ALL)
947 && !PL_sawampersand && !SvTAIL(c))
950 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
951 (unsigned char*)strend, c,
952 PL_multiline ? FBMrf_MULTILINE : 0)))
954 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
956 if (s && rx->check_offset_max < s - t) {
958 s = (char*)HOP((U8*)s, -rx->check_offset_max);
963 /* Now checkstring is fixed, i.e. at fixed offset from the
964 beginning of match, and the match is anchored at s. */
965 else if (!PL_multiline) { /* Anchored near beginning of string. */
967 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
969 if (SvTAIL(rx->check_substr)) {
970 slen = SvCUR(rx->check_substr); /* >= 1 */
972 if ( strend - b > slen || strend - b < slen - 1 )
974 if ( strend - b == slen && strend[-1] != '\n')
976 /* Now should match b[0..slen-2] */
978 if (slen && (*SvPVX(rx->check_substr) != *b
980 && memNE(SvPVX(rx->check_substr), b, slen))))
982 if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
984 } else { /* Assume len > 0 */
985 if (*SvPVX(rx->check_substr) != *b
986 || ((slen = SvCUR(rx->check_substr)) > 1
987 && memNE(SvPVX(rx->check_substr), b, slen)))
989 if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
993 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
994 && rx->check_substr == rx->float_substr) {
995 SvREFCNT_dec(rx->check_substr);
996 rx->check_substr = Nullsv; /* opt is being useless */
997 rx->float_substr = Nullsv;
1000 if (CALLREGEXEC(rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1003 if (pm->op_pmflags & PMf_ONCE)
1004 pm->op_pmdynflags |= PMdf_USED;
1013 RX_MATCH_TAINTED_on(rx);
1014 TAINT_IF(RX_MATCH_TAINTED(rx));
1015 if (gimme == G_ARRAY) {
1018 iters = rx->nparens;
1019 if (global && !iters)
1023 SPAGAIN; /* EVAL blocks could move the stack. */
1024 EXTEND(SP, iters + i);
1025 EXTEND_MORTAL(iters + i);
1026 for (i = !i; i <= iters; i++) {
1027 PUSHs(sv_newmortal());
1029 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1030 len = rx->endp[i] - rx->startp[i];
1031 s = rx->startp[i] + truebase;
1032 sv_setpvn(*SP, s, len);
1036 had_zerolen = (rx->startp[0] != -1
1037 && rx->startp[0] == rx->endp[0]);
1038 PUTBACK; /* EVAL blocks may use stack */
1039 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1044 LEAVE_SCOPE(oldsave);
1050 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1051 mg = mg_find(TARG, 'g');
1053 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1054 mg = mg_find(TARG, 'g');
1056 if (rx->startp[0] != -1) {
1057 mg->mg_len = rx->endp[0];
1058 if (rx->startp[0] == rx->endp[0])
1059 mg->mg_flags |= MGf_MINMATCH;
1061 mg->mg_flags &= ~MGf_MINMATCH;
1064 LEAVE_SCOPE(oldsave);
1068 yup: /* Confirmed by check_substr */
1070 RX_MATCH_TAINTED_on(rx);
1071 TAINT_IF(RX_MATCH_TAINTED(rx));
1072 ++BmUSEFUL(rx->check_substr);
1074 if (pm->op_pmflags & PMf_ONCE)
1075 pm->op_pmdynflags |= PMdf_USED;
1076 if (RX_MATCH_COPIED(rx))
1077 Safefree(rx->subbeg);
1078 RX_MATCH_COPIED_off(rx);
1079 rx->subbeg = Nullch;
1081 rx->subbeg = truebase;
1082 rx->startp[0] = s - truebase;
1083 rx->endp[0] = s - truebase + SvCUR(rx->check_substr);
1084 rx->sublen = strend - truebase;
1087 if (PL_sawampersand) {
1090 rx->subbeg = savepvn(t, strend - t);
1091 rx->sublen = strend - t;
1092 RX_MATCH_COPIED_on(rx);
1093 off = rx->startp[0] = s - t;
1094 rx->endp[0] = off + SvCUR(rx->check_substr);
1096 else { /* startp/endp are used by @- @+. */
1097 rx->startp[0] = s - truebase;
1098 rx->endp[0] = s - truebase + SvCUR(rx->check_substr);
1100 LEAVE_SCOPE(oldsave);
1104 if (rx->check_substr)
1105 ++BmUSEFUL(rx->check_substr);
1108 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1109 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1110 MAGIC* mg = mg_find(TARG, 'g');
1115 LEAVE_SCOPE(oldsave);
1116 if (gimme == G_ARRAY)
1124 dSP; dTARGETSTACKED;
1129 register IO *io = GvIO(PL_last_in_gv);
1130 register I32 type = PL_op->op_type;
1131 I32 gimme = GIMME_V;
1134 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1136 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1139 perl_call_method("READLINE", gimme);
1142 if (gimme == G_SCALAR)
1143 SvSetMagicSV_nosteal(TARG, TOPs);
1150 if (IoFLAGS(io) & IOf_ARGV) {
1151 if (IoFLAGS(io) & IOf_START) {
1152 IoFLAGS(io) &= ~IOf_START;
1154 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1155 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1156 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1157 SvSETMAGIC(GvSV(PL_last_in_gv));
1162 fp = nextargv(PL_last_in_gv);
1163 if (!fp) { /* Note: fp != IoIFP(io) */
1164 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1165 IoFLAGS(io) |= IOf_START;
1168 else if (type == OP_GLOB) {
1169 SV *tmpcmd = NEWSV(55, 0);
1173 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1174 /* since spawning off a process is a real performance hit */
1176 #include <descrip.h>
1177 #include <lib$routines.h>
1180 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1181 char vmsspec[NAM$C_MAXRSS+1];
1182 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1183 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1184 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1187 struct dsc$descriptor_s wilddsc
1188 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1189 struct dsc$descriptor_vs rsdsc
1190 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1191 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1193 /* We could find out if there's an explicit dev/dir or version
1194 by peeking into lib$find_file's internal context at
1195 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1196 but that's unsupported, so I don't want to do it now and
1197 have it bite someone in the future. */
1198 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1199 cp = SvPV(tmpglob,i);
1201 if (cp[i] == ';') hasver = 1;
1203 if (sts) hasver = 1;
1207 hasdir = isunix = 1;
1210 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1215 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1217 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1218 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1219 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1220 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1221 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1222 &dfltdsc,NULL,NULL,NULL))&1)) {
1223 end = rstr + (unsigned long int) *rslt;
1224 if (!hasver) while (*end != ';') end--;
1225 *(end++) = '\n'; *end = '\0';
1226 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1228 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1233 while (*(--begin) != ']' && *begin != '>') ;
1236 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1238 if (cxt) (void)lib$find_file_end(&cxt);
1239 if (ok && sts != RMS$_NMF &&
1240 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1243 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1245 PerlIO_close(tmpfp);
1249 PerlIO_rewind(tmpfp);
1251 IoIFP(io) = fp = tmpfp;
1252 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1259 sv_setpv(tmpcmd, "for a in ");
1260 sv_catsv(tmpcmd, tmpglob);
1261 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1264 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1265 sv_catsv(tmpcmd, tmpglob);
1268 sv_setpv(tmpcmd, "for a in ");
1269 sv_catsv(tmpcmd, tmpglob);
1270 sv_catpv(tmpcmd, "; do echo -e \"$a\\0\\c\"; done |");
1272 sv_setpv(tmpcmd, "perlglob ");
1273 sv_catsv(tmpcmd, tmpglob);
1274 sv_catpv(tmpcmd, " |");
1275 #endif /* !CYGWIN */
1280 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1281 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1282 sv_catsv(tmpcmd, tmpglob);
1283 sv_catpv(tmpcmd, "' 2>/dev/null |");
1285 sv_setpv(tmpcmd, "echo ");
1286 sv_catsv(tmpcmd, tmpglob);
1288 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1290 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1293 #endif /* !DOSISH */
1294 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1295 FALSE, O_RDONLY, 0, Nullfp);
1301 else if (type == OP_GLOB)
1305 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1306 if (type == OP_GLOB)
1307 warner(WARN_CLOSED, "glob failed (can't start child: %s)",
1310 warner(WARN_CLOSED, "Read on closed filehandle <%s>",
1311 GvENAME(PL_last_in_gv));
1313 if (gimme == G_SCALAR) {
1314 (void)SvOK_off(TARG);
1320 if (gimme == G_SCALAR) {
1324 (void)SvUPGRADE(sv, SVt_PV);
1325 tmplen = SvLEN(sv); /* remember if already alloced */
1327 Sv_Grow(sv, 80); /* try short-buffering it */
1328 if (type == OP_RCATLINE)
1334 sv = sv_2mortal(NEWSV(57, 80));
1338 /* flip-flop EOF state for a snarfed empty file */
1339 #define SNARF_EOF(gimme,rs,io,sv) \
1340 ((gimme != G_SCALAR || SvCUR(sv) \
1341 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1342 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1343 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1346 if (!sv_gets(sv, fp, offset)
1347 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1349 PerlIO_clearerr(fp);
1350 if (IoFLAGS(io) & IOf_ARGV) {
1351 fp = nextargv(PL_last_in_gv);
1354 (void)do_close(PL_last_in_gv, FALSE);
1355 IoFLAGS(io) |= IOf_START;
1357 else if (type == OP_GLOB) {
1358 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1360 "glob failed (child exited with status %d%s)",
1361 STATUS_CURRENT >> 8,
1362 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1365 if (gimme == G_SCALAR) {
1366 (void)SvOK_off(TARG);
1371 /* This should not be marked tainted if the fp is marked clean */
1372 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1379 if (type == OP_GLOB) {
1382 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1383 tmps = SvEND(sv) - 1;
1384 if (*tmps == *SvPVX(PL_rs)) {
1389 for (tmps = SvPVX(sv); *tmps; tmps++)
1390 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1391 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1393 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1394 (void)POPs; /* Unmatched wildcard? Chuck it... */
1398 if (gimme == G_ARRAY) {
1399 if (SvLEN(sv) - SvCUR(sv) > 20) {
1400 SvLEN_set(sv, SvCUR(sv)+1);
1401 Renew(SvPVX(sv), SvLEN(sv), char);
1403 sv = sv_2mortal(NEWSV(58, 80));
1406 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1407 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1411 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1412 Renew(SvPVX(sv), SvLEN(sv), char);
1421 register PERL_CONTEXT *cx;
1422 I32 gimme = OP_GIMME(PL_op, -1);
1425 if (cxstack_ix >= 0)
1426 gimme = cxstack[cxstack_ix].blk_gimme;
1434 PUSHBLOCK(cx, CXt_BLOCK, SP);
1446 U32 lval = PL_op->op_flags & OPf_MOD;
1447 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1450 if (SvTYPE(hv) == SVt_PVHV) {
1451 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1452 svp = he ? &HeVAL(he) : 0;
1454 else if (SvTYPE(hv) == SVt_PVAV) {
1455 if (PL_op->op_private & OPpLVAL_INTRO)
1456 DIE("Can't localize pseudo-hash element");
1457 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1463 if (!svp || *svp == &PL_sv_undef) {
1468 DIE(PL_no_helem, SvPV(keysv, n_a));
1470 lv = sv_newmortal();
1471 sv_upgrade(lv, SVt_PVLV);
1473 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1474 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1475 LvTARG(lv) = SvREFCNT_inc(hv);
1480 if (PL_op->op_private & OPpLVAL_INTRO) {
1481 if (HvNAME(hv) && isGV(*svp))
1482 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1484 save_helem(hv, keysv, svp);
1486 else if (PL_op->op_private & OPpDEREF)
1487 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1489 sv = (svp ? *svp : &PL_sv_undef);
1490 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1491 * Pushing the magical RHS on to the stack is useless, since
1492 * that magic is soon destined to be misled by the local(),
1493 * and thus the later pp_sassign() will fail to mg_get() the
1494 * old value. This should also cure problems with delayed
1495 * mg_get()s. GSAR 98-07-03 */
1496 if (!lval && SvGMAGICAL(sv))
1497 sv = sv_mortalcopy(sv);
1505 register PERL_CONTEXT *cx;
1511 if (PL_op->op_flags & OPf_SPECIAL) {
1512 cx = &cxstack[cxstack_ix];
1513 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1518 gimme = OP_GIMME(PL_op, -1);
1520 if (cxstack_ix >= 0)
1521 gimme = cxstack[cxstack_ix].blk_gimme;
1527 if (gimme == G_VOID)
1529 else if (gimme == G_SCALAR) {
1532 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1535 *MARK = sv_mortalcopy(TOPs);
1538 *MARK = &PL_sv_undef;
1542 else if (gimme == G_ARRAY) {
1543 /* in case LEAVE wipes old return values */
1544 for (mark = newsp + 1; mark <= SP; mark++) {
1545 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1546 *mark = sv_mortalcopy(*mark);
1547 TAINT_NOT; /* Each item is independent */
1551 PL_curpm = newpm; /* Don't pop $1 et al till now */
1561 register PERL_CONTEXT *cx;
1566 cx = &cxstack[cxstack_ix];
1567 if (CxTYPE(cx) != CXt_LOOP)
1568 DIE("panic: pp_iter");
1570 av = cx->blk_loop.iterary;
1571 if (SvTYPE(av) != SVt_PVAV) {
1572 /* iterate ($min .. $max) */
1573 if (cx->blk_loop.iterlval) {
1574 /* string increment */
1575 register SV* cur = cx->blk_loop.iterlval;
1577 char *max = SvPV((SV*)av, maxlen);
1578 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1579 #ifndef USE_THREADS /* don't risk potential race */
1580 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1581 && !SvMAGICAL(*cx->blk_loop.itervar))
1583 /* safe to reuse old SV */
1584 sv_setsv(*cx->blk_loop.itervar, cur);
1589 /* we need a fresh SV every time so that loop body sees a
1590 * completely new SV for closures/references to work as
1592 SvREFCNT_dec(*cx->blk_loop.itervar);
1593 *cx->blk_loop.itervar = newSVsv(cur);
1595 if (strEQ(SvPVX(cur), max))
1596 sv_setiv(cur, 0); /* terminate next time */
1603 /* integer increment */
1604 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1607 #ifndef USE_THREADS /* don't risk potential race */
1608 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1609 && !SvMAGICAL(*cx->blk_loop.itervar))
1611 /* safe to reuse old SV */
1612 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1617 /* we need a fresh SV every time so that loop body sees a
1618 * completely new SV for closures/references to work as they
1620 SvREFCNT_dec(*cx->blk_loop.itervar);
1621 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1627 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1630 SvREFCNT_dec(*cx->blk_loop.itervar);
1632 if (sv = (SvMAGICAL(av))
1633 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1634 : AvARRAY(av)[++cx->blk_loop.iterix])
1638 if (av != PL_curstack && SvIMMORTAL(sv)) {
1639 SV *lv = cx->blk_loop.iterlval;
1640 if (lv && SvREFCNT(lv) > 1) {
1645 SvREFCNT_dec(LvTARG(lv));
1647 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1648 sv_upgrade(lv, SVt_PVLV);
1650 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1652 LvTARG(lv) = SvREFCNT_inc(av);
1653 LvTARGOFF(lv) = cx->blk_loop.iterix;
1654 LvTARGLEN(lv) = (UV) -1;
1658 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1665 register PMOP *pm = cPMOP;
1681 register REGEXP *rx = pm->op_pmregexp;
1683 int force_on_match = 0;
1684 I32 oldsave = PL_savestack_ix;
1685 I32 update_minmatch = 1;
1687 /* known replacement string? */
1688 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1689 if (PL_op->op_flags & OPf_STACKED)
1695 if (SvREADONLY(TARG)
1696 || (SvTYPE(TARG) > SVt_PVLV
1697 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1698 croak(PL_no_modify);
1701 s = SvPV(TARG, len);
1702 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1704 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1705 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1712 DIE("panic: do_subst");
1715 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1716 position, once with zero-length,
1717 second time with non-zero. */
1719 if (!rx->prelen && PL_curpm) {
1721 rx = pm->op_pmregexp;
1723 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1724 ? REXEC_COPY_STR : 0;
1725 if (SvSCREAM(TARG) && rx->check_substr
1726 && SvTYPE(rx->check_substr) == SVt_PVBM
1727 && SvVALID(rx->check_substr))
1728 r_flags |= REXEC_SCREAM;
1729 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1730 SAVEINT(PL_multiline);
1731 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1734 if (rx->check_substr) {
1735 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1736 if (r_flags & REXEC_SCREAM) {
1740 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1743 b = (char*)HOP((U8*)s, rx->check_offset_min);
1744 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
1747 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
1748 (unsigned char*)strend,
1750 PL_multiline ? FBMrf_MULTILINE : 0)))
1752 if (s && rx->check_offset_max < s - m) {
1753 ++BmUSEFUL(rx->check_substr);
1754 s = (char*)HOP((U8*)s, -rx->check_offset_max);
1759 /* Now checkstring is fixed, i.e. at fixed offset from the
1760 beginning of match, and the match is anchored at s. */
1761 else if (!PL_multiline) { /* Anchored at beginning of string. */
1763 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
1764 if (*SvPVX(rx->check_substr) != *b
1765 || ((slen = SvCUR(rx->check_substr)) > 1
1766 && memNE(SvPVX(rx->check_substr), b, slen)))
1769 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
1770 && rx->check_substr == rx->float_substr) {
1771 SvREFCNT_dec(rx->check_substr);
1772 rx->check_substr = Nullsv; /* opt is being useless */
1773 rx->float_substr = Nullsv;
1777 /* only replace once? */
1778 once = !(rpm->op_pmflags & PMf_GLOBAL);
1780 /* known replacement string? */
1781 c = dstr ? SvPV(dstr, clen) : Nullch;
1783 /* can do inplace substitution? */
1784 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1785 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1786 if (!CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1789 LEAVE_SCOPE(oldsave);
1792 if (force_on_match) {
1794 s = SvPV_force(TARG, len);
1799 SvSCREAM_off(TARG); /* disable possible screamer */
1801 rxtainted |= RX_MATCH_TAINTED(rx);
1802 m = orig + rx->startp[0];
1803 d = orig + rx->endp[0];
1805 if (m - s > strend - d) { /* faster to shorten from end */
1807 Copy(c, m, clen, char);
1812 Move(d, m, i, char);
1816 SvCUR_set(TARG, m - s);
1819 else if (i = m - s) { /* faster from front */
1827 Copy(c, m, clen, char);
1832 Copy(c, d, clen, char);
1837 TAINT_IF(rxtainted & 1);
1843 if (iters++ > maxiters)
1844 DIE("Substitution loop");
1845 rxtainted |= RX_MATCH_TAINTED(rx);
1846 m = rx->startp[0] + orig;
1850 Move(s, d, i, char);
1854 Copy(c, d, clen, char);
1857 s = rx->endp[0] + orig;
1858 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1859 Nullsv, NULL, REXEC_NOT_FIRST)); /* don't match same null twice */
1862 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1863 Move(s, d, i+1, char); /* include the NUL */
1865 TAINT_IF(rxtainted & 1);
1867 PUSHs(sv_2mortal(newSViv((I32)iters)));
1869 (void)SvPOK_only(TARG);
1870 TAINT_IF(rxtainted);
1871 if (SvSMAGICAL(TARG)) {
1877 LEAVE_SCOPE(oldsave);
1881 if (CALLREGEXEC(rx, s, strend, orig, 0, TARG, NULL, r_flags)) {
1882 if (force_on_match) {
1884 s = SvPV_force(TARG, len);
1887 rxtainted |= RX_MATCH_TAINTED(rx);
1888 dstr = NEWSV(25, len);
1889 sv_setpvn(dstr, m, s-m);
1892 register PERL_CONTEXT *cx;
1895 RETURNOP(cPMOP->op_pmreplroot);
1897 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1899 if (iters++ > maxiters)
1900 DIE("Substitution loop");
1901 rxtainted |= RX_MATCH_TAINTED(rx);
1902 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1907 strend = s + (strend - m);
1909 m = rx->startp[0] + orig;
1910 sv_catpvn(dstr, s, m-s);
1911 s = rx->endp[0] + orig;
1913 sv_catpvn(dstr, c, clen);
1916 } while (CALLREGEXEC(rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1917 sv_catpvn(dstr, s, strend - s);
1919 (void)SvOOK_off(TARG);
1920 Safefree(SvPVX(TARG));
1921 SvPVX(TARG) = SvPVX(dstr);
1922 SvCUR_set(TARG, SvCUR(dstr));
1923 SvLEN_set(TARG, SvLEN(dstr));
1927 TAINT_IF(rxtainted & 1);
1929 PUSHs(sv_2mortal(newSViv((I32)iters)));
1931 (void)SvPOK_only(TARG);
1932 TAINT_IF(rxtainted);
1935 LEAVE_SCOPE(oldsave);
1941 ++BmUSEFUL(rx->check_substr);
1946 LEAVE_SCOPE(oldsave);
1955 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1956 ++*PL_markstack_ptr;
1957 LEAVE; /* exit inner scope */
1960 if (PL_stack_base + *PL_markstack_ptr > SP) {
1962 I32 gimme = GIMME_V;
1964 LEAVE; /* exit outer scope */
1965 (void)POPMARK; /* pop src */
1966 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1967 (void)POPMARK; /* pop dst */
1968 SP = PL_stack_base + POPMARK; /* pop original mark */
1969 if (gimme == G_SCALAR) {
1973 else if (gimme == G_ARRAY)
1980 ENTER; /* enter inner scope */
1983 src = PL_stack_base[*PL_markstack_ptr];
1987 RETURNOP(cLOGOP->op_other);
1998 register PERL_CONTEXT *cx;
1999 struct block_sub cxsub;
2002 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
2005 if (gimme == G_SCALAR) {
2008 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
2010 *MARK = SvREFCNT_inc(TOPs);
2015 *MARK = sv_mortalcopy(TOPs);
2018 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2021 *MARK = &PL_sv_undef;
2025 else if (gimme == G_ARRAY) {
2026 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2027 if (!SvTEMP(*MARK)) {
2028 *MARK = sv_mortalcopy(*MARK);
2029 TAINT_NOT; /* Each item is independent */
2035 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
2036 PL_curpm = newpm; /* ... and pop $1 et al */
2039 return pop_return();
2043 get_db_sub(SV **svp, CV *cv)
2046 SV *dbsv = GvSV(PL_DBsub);
2048 if (!PERLDB_SUB_NN) {
2052 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2053 || strEQ(GvNAME(gv), "END")
2054 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2055 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2056 && (gv = (GV*)*svp) ))) {
2057 /* Use GV from the stack as a fallback. */
2058 /* GV is potentially non-unique, or contain different CV. */
2059 sv_setsv(dbsv, newRV((SV*)cv));
2062 gv_efullname3(dbsv, gv, Nullch);
2066 SvUPGRADE(dbsv, SVt_PVIV);
2068 SAVEIV(SvIVX(dbsv));
2069 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
2073 PL_curcopdb = PL_curcop;
2074 cv = GvCV(PL_DBsub);
2084 register PERL_CONTEXT *cx;
2086 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2089 DIE("Not a CODE reference");
2090 switch (SvTYPE(sv)) {
2096 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2098 SP = PL_stack_base + POPMARK;
2101 if (SvGMAGICAL(sv)) {
2103 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2106 sym = SvPV(sv, n_a);
2108 DIE(PL_no_usym, "a subroutine");
2109 if (PL_op->op_private & HINT_STRICT_REFS)
2110 DIE(PL_no_symref, sym, "a subroutine");
2111 cv = perl_get_cv(sym, TRUE);
2115 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2116 tryAMAGICunDEREF(to_cv);
2119 if (SvTYPE(cv) == SVt_PVCV)
2124 DIE("Not a CODE reference");
2129 if (!(cv = GvCVu((GV*)sv)))
2130 cv = sv_2cv(sv, &stash, &gv, FALSE);
2143 if (!CvROOT(cv) && !CvXSUB(cv)) {
2147 /* anonymous or undef'd function leaves us no recourse */
2148 if (CvANON(cv) || !(gv = CvGV(cv)))
2149 DIE("Undefined subroutine called");
2151 /* autoloaded stub? */
2152 if (cv != GvCV(gv)) {
2155 /* should call AUTOLOAD now? */
2158 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2165 sub_name = sv_newmortal();
2166 gv_efullname3(sub_name, gv, Nullch);
2167 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2171 DIE("Not a CODE reference");
2176 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2177 cv = get_db_sub(&sv, cv);
2179 DIE("No DBsub routine");
2184 * First we need to check if the sub or method requires locking.
2185 * If so, we gain a lock on the CV, the first argument or the
2186 * stash (for static methods), as appropriate. This has to be
2187 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2188 * reschedule by returning a new op.
2190 MUTEX_LOCK(CvMUTEXP(cv));
2191 if (CvFLAGS(cv) & CVf_LOCKED) {
2193 if (CvFLAGS(cv) & CVf_METHOD) {
2194 if (SP > PL_stack_base + TOPMARK)
2195 sv = *(PL_stack_base + TOPMARK + 1);
2197 AV *av = (AV*)PL_curpad[0];
2198 if (hasargs || !av || AvFILLp(av) < 0
2199 || !(sv = AvARRAY(av)[0]))
2201 MUTEX_UNLOCK(CvMUTEXP(cv));
2202 croak("no argument for locked method call");
2209 char *stashname = SvPV(sv, len);
2210 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2216 MUTEX_UNLOCK(CvMUTEXP(cv));
2217 mg = condpair_magic(sv);
2218 MUTEX_LOCK(MgMUTEXP(mg));
2219 if (MgOWNER(mg) == thr)
2220 MUTEX_UNLOCK(MgMUTEXP(mg));
2223 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2225 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2227 MUTEX_UNLOCK(MgMUTEXP(mg));
2228 save_destructor(unlock_condpair, sv);
2230 MUTEX_LOCK(CvMUTEXP(cv));
2233 * Now we have permission to enter the sub, we must distinguish
2234 * four cases. (0) It's an XSUB (in which case we don't care
2235 * about ownership); (1) it's ours already (and we're recursing);
2236 * (2) it's free (but we may already be using a cached clone);
2237 * (3) another thread owns it. Case (1) is easy: we just use it.
2238 * Case (2) means we look for a clone--if we have one, use it
2239 * otherwise grab ownership of cv. Case (3) means we look for a
2240 * clone (for non-XSUBs) and have to create one if we don't
2242 * Why look for a clone in case (2) when we could just grab
2243 * ownership of cv straight away? Well, we could be recursing,
2244 * i.e. we originally tried to enter cv while another thread
2245 * owned it (hence we used a clone) but it has been freed up
2246 * and we're now recursing into it. It may or may not be "better"
2247 * to use the clone but at least CvDEPTH can be trusted.
2249 if (CvOWNER(cv) == thr || CvXSUB(cv))
2250 MUTEX_UNLOCK(CvMUTEXP(cv));
2252 /* Case (2) or (3) */
2256 * XXX Might it be better to release CvMUTEXP(cv) while we
2257 * do the hv_fetch? We might find someone has pinched it
2258 * when we look again, in which case we would be in case
2259 * (3) instead of (2) so we'd have to clone. Would the fact
2260 * that we released the mutex more quickly make up for this?
2262 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2264 /* We already have a clone to use */
2265 MUTEX_UNLOCK(CvMUTEXP(cv));
2267 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2268 "entersub: %p already has clone %p:%s\n",
2269 thr, cv, SvPEEK((SV*)cv)));
2272 if (CvDEPTH(cv) == 0)
2273 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2276 /* (2) => grab ownership of cv. (3) => make clone */
2280 MUTEX_UNLOCK(CvMUTEXP(cv));
2281 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2282 "entersub: %p grabbing %p:%s in stash %s\n",
2283 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2284 HvNAME(CvSTASH(cv)) : "(none)"));
2286 /* Make a new clone. */
2288 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2289 MUTEX_UNLOCK(CvMUTEXP(cv));
2290 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2291 "entersub: %p cloning %p:%s\n",
2292 thr, cv, SvPEEK((SV*)cv))));
2294 * We're creating a new clone so there's no race
2295 * between the original MUTEX_UNLOCK and the
2296 * SvREFCNT_inc since no one will be trying to undef
2297 * it out from underneath us. At least, I don't think
2300 clonecv = cv_clone(cv);
2301 SvREFCNT_dec(cv); /* finished with this */
2302 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2303 CvOWNER(clonecv) = thr;
2307 DEBUG_S(if (CvDEPTH(cv) != 0)
2308 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2310 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2313 #endif /* USE_THREADS */
2316 #ifdef PERL_XSUB_OLDSTYLE
2317 if (CvOLDSTYLE(cv)) {
2318 I32 (*fp3)_((int,int,int));
2320 register I32 items = SP - MARK;
2321 /* We dont worry to copy from @_. */
2326 PL_stack_sp = mark + 1;
2327 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2328 items = (*fp3)(CvXSUBANY(cv).any_i32,
2329 MARK - PL_stack_base + 1,
2331 PL_stack_sp = PL_stack_base + items;
2334 #endif /* PERL_XSUB_OLDSTYLE */
2336 I32 markix = TOPMARK;
2341 /* Need to copy @_ to stack. Alternative may be to
2342 * switch stack to @_, and copy return values
2343 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2347 av = (AV*)PL_curpad[0];
2349 av = GvAV(PL_defgv);
2350 #endif /* USE_THREADS */
2351 items = AvFILLp(av) + 1; /* @_ is not tieable */
2354 /* Mark is at the end of the stack. */
2356 Copy(AvARRAY(av), SP + 1, items, SV*);
2361 /* We assume first XSUB in &DB::sub is the called one. */
2363 SAVESPTR(PL_curcop);
2364 PL_curcop = PL_curcopdb;
2367 /* Do we need to open block here? XXXX */
2368 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2370 /* Enforce some sanity in scalar context. */
2371 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2372 if (markix > PL_stack_sp - PL_stack_base)
2373 *(PL_stack_base + markix) = &PL_sv_undef;
2375 *(PL_stack_base + markix) = *PL_stack_sp;
2376 PL_stack_sp = PL_stack_base + markix;
2384 register I32 items = SP - MARK;
2385 AV* padlist = CvPADLIST(cv);
2386 SV** svp = AvARRAY(padlist);
2387 push_return(PL_op->op_next);
2388 PUSHBLOCK(cx, CXt_SUB, MARK);
2391 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2392 * that eval'' ops within this sub know the correct lexical space.
2393 * Owing the speed considerations, we choose to search for the cv
2394 * in doeval() instead.
2396 if (CvDEPTH(cv) < 2)
2397 (void)SvREFCNT_inc(cv);
2398 else { /* save temporaries on recursion? */
2399 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2401 AV *newpad = newAV();
2402 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2403 I32 ix = AvFILLp((AV*)svp[1]);
2404 svp = AvARRAY(svp[0]);
2405 for ( ;ix > 0; ix--) {
2406 if (svp[ix] != &PL_sv_undef) {
2407 char *name = SvPVX(svp[ix]);
2408 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2409 || *name == '&') /* anonymous code? */
2411 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2413 else { /* our own lexical */
2415 av_store(newpad, ix, sv = (SV*)newAV());
2416 else if (*name == '%')
2417 av_store(newpad, ix, sv = (SV*)newHV());
2419 av_store(newpad, ix, sv = NEWSV(0,0));
2424 av_store(newpad, ix, sv = NEWSV(0,0));
2428 av = newAV(); /* will be @_ */
2430 av_store(newpad, 0, (SV*)av);
2431 AvFLAGS(av) = AVf_REIFY;
2432 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2433 AvFILLp(padlist) = CvDEPTH(cv);
2434 svp = AvARRAY(padlist);
2439 AV* av = (AV*)PL_curpad[0];
2441 items = AvFILLp(av) + 1;
2443 /* Mark is at the end of the stack. */
2445 Copy(AvARRAY(av), SP + 1, items, SV*);
2450 #endif /* USE_THREADS */
2451 SAVESPTR(PL_curpad);
2452 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2455 #endif /* USE_THREADS */
2461 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2462 "%p entersub preparing @_\n", thr));
2464 av = (AV*)PL_curpad[0];
2470 cx->blk_sub.savearray = GvAV(PL_defgv);
2471 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2472 #endif /* USE_THREADS */
2473 cx->blk_sub.argarray = av;
2476 if (items > AvMAX(av) + 1) {
2478 if (AvARRAY(av) != ary) {
2479 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2480 SvPVX(av) = (char*)ary;
2482 if (items > AvMAX(av) + 1) {
2483 AvMAX(av) = items - 1;
2484 Renew(ary,items,SV*);
2486 SvPVX(av) = (char*)ary;
2489 Copy(MARK,AvARRAY(av),items,SV*);
2490 AvFILLp(av) = items - 1;
2498 /* warning must come *after* we fully set up the context
2499 * stuff so that __WARN__ handlers can safely dounwind()
2502 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2503 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2504 sub_crush_depth(cv);
2506 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2507 "%p entersub returning %p\n", thr, CvSTART(cv)));
2509 RETURNOP(CvSTART(cv));
2514 sub_crush_depth(CV *cv)
2517 warner(WARN_RECURSION, "Deep recursion on anonymous subroutine");
2519 SV* tmpstr = sv_newmortal();
2520 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2521 warner(WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2532 U32 lval = PL_op->op_flags & OPf_MOD;
2533 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2537 elem -= PL_curcop->cop_arybase;
2538 if (SvTYPE(av) != SVt_PVAV)
2540 svp = av_fetch(av, elem, lval && !defer);
2542 if (!svp || *svp == &PL_sv_undef) {
2545 DIE(PL_no_aelem, elem);
2546 lv = sv_newmortal();
2547 sv_upgrade(lv, SVt_PVLV);
2549 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2550 LvTARG(lv) = SvREFCNT_inc(av);
2551 LvTARGOFF(lv) = elem;
2556 if (PL_op->op_private & OPpLVAL_INTRO)
2557 save_aelem(av, elem, svp);
2558 else if (PL_op->op_private & OPpDEREF)
2559 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2561 sv = (svp ? *svp : &PL_sv_undef);
2562 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2563 sv = sv_mortalcopy(sv);
2569 vivify_ref(SV *sv, U32 to_what)
2575 croak(PL_no_modify);
2576 if (SvTYPE(sv) < SVt_RV)
2577 sv_upgrade(sv, SVt_RV);
2578 else if (SvTYPE(sv) >= SVt_PV) {
2579 (void)SvOOK_off(sv);
2580 Safefree(SvPVX(sv));
2581 SvLEN(sv) = SvCUR(sv) = 0;
2585 SvRV(sv) = NEWSV(355,0);
2588 SvRV(sv) = (SV*)newAV();
2591 SvRV(sv) = (SV*)newHV();
2612 if (SvTYPE(sv) == SVt_PVCV) {
2618 name = SvPV(TOPs, packlen);
2619 sv = *(PL_stack_base + TOPMARK + 1);
2630 !(packname = SvPV(sv, packlen)) ||
2631 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2632 !(ob=(SV*)GvIO(iogv)))
2635 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2636 ? !isIDFIRST_utf8((U8*)packname)
2637 : !isIDFIRST(*packname)
2640 DIE("Can't call method \"%s\" %s", name,
2641 SvOK(sv)? "without a package or object reference"
2642 : "on an undefined value");
2644 stash = gv_stashpvn(packname, packlen, TRUE);
2647 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2650 if (!ob || !SvOBJECT(ob))
2651 DIE("Can't call method \"%s\" on unblessed reference", name);
2653 stash = SvSTASH(ob);
2656 gv = gv_fetchmethod(stash, name);
2662 for (p = name; *p; p++) {
2664 sep = p, leaf = p + 1;
2665 else if (*p == ':' && *(p + 1) == ':')
2666 sep = p, leaf = p + 2;
2668 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2669 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2670 packlen = strlen(packname);
2674 packlen = sep - name;
2676 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2677 leaf, (int)packlen, packname);
2679 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);