3 * Copyright (c) 1991-2000, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
29 static void unset_cvowner(pTHXo_ void *cvarg);
30 #endif /* USE_THREADS */
41 PL_curcop = (COP*)PL_op;
42 TAINT_NOT; /* Each statement is presumed innocent */
43 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
52 if (PL_op->op_private & OPpLVAL_INTRO)
53 PUSHs(save_scalar(cGVOP_gv));
55 PUSHs(GvSV(cGVOP_gv));
66 PL_curcop = (COP*)PL_op;
72 PUSHMARK(PL_stack_sp);
82 sv_setpvn(TARG,s,len);
83 if (SvUTF8(TOPs) && !IN_BYTE)
92 XPUSHs((SV*)cGVOP_gv);
103 RETURNOP(cLOGOP->op_other);
111 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
113 temp = left; left = right; right = temp;
115 if (PL_tainting && PL_tainted && !SvTAINTED(left))
117 SvSetMagicSV(right, left);
126 RETURNOP(cLOGOP->op_other);
128 RETURNOP(cLOGOP->op_next);
134 TAINT_NOT; /* Each statement is presumed innocent */
135 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
137 oldsave = PL_scopestack[PL_scopestack_ix - 1];
138 LEAVE_SCOPE(oldsave);
144 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
149 bool left_utf = DO_UTF8(left);
150 bool right_utf = DO_UTF8(right);
152 if (left_utf != right_utf) {
153 if (TARG == right && !right_utf) {
154 sv_utf8_upgrade(TARG); /* Now straight binary copy */
158 /* Set TARG to PV(left), then add right */
162 /* Need a safe copy elsewhere since we're just about to
164 s = strdup(SvPV(right,len));
167 l = SvPV(left, targlen);
169 sv_setpvn(TARG,l,targlen);
171 sv_utf8_upgrade(TARG);
172 /* Extend TARG to length of right (s) */
173 targlen = SvCUR(TARG) + len;
175 /* plus one for each hi-byte char if we have to upgrade */
176 for (c = s; *c; c++) {
181 SvGROW(TARG, targlen+1);
182 /* And now copy, maybe upgrading right to UTF8 on the fly */
183 for (c = SvEND(TARG); *s; s++) {
184 if (*s & 0x80 && !right_utf)
185 c = (char*)uv_to_utf8((U8*)c, *s);
189 SvCUR_set(TARG, targlen);
200 sv_insert(TARG, 0, 0, s, len);
204 sv_setpvn(TARG,s,len);
206 else if (SvGMAGICAL(TARG))
208 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG)
209 sv_setpv(TARG, ""); /* Suppress warning. */
212 #if defined(PERL_Y2KWARN)
213 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_Y2K)) {
215 char *s = SvPV(TARG,n);
216 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
217 && (n == 2 || !isDIGIT(s[n-3])))
219 Perl_warner(aTHX_ WARN_Y2K, "Possible Y2K bug: %s",
220 "about to append an integer to '19'");
224 sv_catpvn(TARG,s,len);
227 sv_setpvn(TARG,s,len); /* suppress warning */
239 if (PL_op->op_flags & OPf_MOD) {
240 if (PL_op->op_private & OPpLVAL_INTRO)
241 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
242 else if (PL_op->op_private & OPpDEREF) {
244 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
253 tryAMAGICunTARGET(iter, 0);
254 PL_last_in_gv = (GV*)(*PL_stack_sp--);
255 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
256 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
257 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
260 XPUSHs((SV*)PL_last_in_gv);
263 PL_last_in_gv = (GV*)(*PL_stack_sp--);
266 return do_readline();
271 djSP; tryAMAGICbinSET(eq,0);
274 SETs(boolSV(TOPn == value));
282 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
283 DIE(aTHX_ PL_no_modify);
284 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
285 SvIVX(TOPs) != IV_MAX)
288 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
303 RETURNOP(cLOGOP->op_other);
309 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
312 SETn( left + right );
320 AV *av = GvAV(cGVOP_gv);
321 U32 lval = PL_op->op_flags & OPf_MOD;
322 SV** svp = av_fetch(av, PL_op->op_private, lval);
323 SV *sv = (svp ? *svp : &PL_sv_undef);
325 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
326 sv = sv_mortalcopy(sv);
333 djSP; dMARK; dTARGET;
335 do_join(TARG, *MARK, MARK, SP);
346 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
347 * will be enough to hold an OP*.
349 SV* sv = sv_newmortal();
350 sv_upgrade(sv, SVt_PVLV);
352 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
360 /* Oversized hot code. */
364 djSP; dMARK; dORIGMARK;
371 if (PL_op->op_flags & OPf_STACKED)
375 if ((mg = SvTIED_mg((SV*)gv, 'q'))) {
376 if (MARK == ORIGMARK) {
377 /* If using default handle then we need to make space to
378 * pass object as 1st arg, so move other args up ...
382 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
386 *MARK = SvTIED_obj((SV*)gv, mg);
389 call_method("PRINT", G_SCALAR);
397 if (!(io = GvIO(gv))) {
398 if (ckWARN(WARN_UNOPENED)) {
399 SV* sv = sv_newmortal();
400 gv_efullname3(sv, gv, Nullch);
401 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
404 SETERRNO(EBADF,RMS$_IFI);
407 else if (!(fp = IoOFP(io))) {
408 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
410 SV* sv = sv_newmortal();
411 gv_efullname3(sv, gv, Nullch);
412 Perl_warner(aTHX_ WARN_IO,
413 "Filehandle %s opened only for input",
416 else if (ckWARN(WARN_CLOSED))
417 report_closed_fh(gv, io, "print", "filehandle");
419 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
426 if (!do_print(*MARK, fp))
430 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
439 if (!do_print(*MARK, fp))
448 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
451 if (IoFLAGS(io) & IOf_FLUSH)
452 if (PerlIO_flush(fp) == EOF)
473 tryAMAGICunDEREF(to_av);
476 if (SvTYPE(av) != SVt_PVAV)
477 DIE(aTHX_ "Not an ARRAY reference");
478 if (PL_op->op_flags & OPf_REF) {
484 if (SvTYPE(sv) == SVt_PVAV) {
486 if (PL_op->op_flags & OPf_REF) {
494 if (SvTYPE(sv) != SVt_PVGV) {
498 if (SvGMAGICAL(sv)) {
504 if (PL_op->op_flags & OPf_REF ||
505 PL_op->op_private & HINT_STRICT_REFS)
506 DIE(aTHX_ PL_no_usym, "an ARRAY");
507 if (ckWARN(WARN_UNINITIALIZED))
509 if (GIMME == G_ARRAY) {
516 if ((PL_op->op_flags & OPf_SPECIAL) &&
517 !(PL_op->op_flags & OPf_MOD))
519 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
521 && (!is_gv_magical(sym,len,0)
522 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV))))
528 if (PL_op->op_private & HINT_STRICT_REFS)
529 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
530 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
537 if (PL_op->op_private & OPpLVAL_INTRO)
539 if (PL_op->op_flags & OPf_REF) {
546 if (GIMME == G_ARRAY) {
547 I32 maxarg = AvFILL(av) + 1;
548 (void)POPs; /* XXXX May be optimized away? */
550 if (SvRMAGICAL(av)) {
552 for (i=0; i < maxarg; i++) {
553 SV **svp = av_fetch(av, i, FALSE);
554 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
558 Copy(AvARRAY(av), SP+1, maxarg, SV*);
564 I32 maxarg = AvFILL(av) + 1;
577 tryAMAGICunDEREF(to_hv);
580 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
581 DIE(aTHX_ "Not a HASH reference");
582 if (PL_op->op_flags & OPf_REF) {
588 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
590 if (PL_op->op_flags & OPf_REF) {
598 if (SvTYPE(sv) != SVt_PVGV) {
602 if (SvGMAGICAL(sv)) {
608 if (PL_op->op_flags & OPf_REF ||
609 PL_op->op_private & HINT_STRICT_REFS)
610 DIE(aTHX_ PL_no_usym, "a HASH");
611 if (ckWARN(WARN_UNINITIALIZED))
613 if (GIMME == G_ARRAY) {
620 if ((PL_op->op_flags & OPf_SPECIAL) &&
621 !(PL_op->op_flags & OPf_MOD))
623 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
625 && (!is_gv_magical(sym,len,0)
626 || !(gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV))))
632 if (PL_op->op_private & HINT_STRICT_REFS)
633 DIE(aTHX_ PL_no_symref, sym, "a HASH");
634 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
641 if (PL_op->op_private & OPpLVAL_INTRO)
643 if (PL_op->op_flags & OPf_REF) {
650 if (GIMME == G_ARRAY) { /* array wanted */
651 *PL_stack_sp = (SV*)hv;
656 if (SvTYPE(hv) == SVt_PVAV)
657 hv = avhv_keys((AV*)hv);
659 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
660 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
670 S_do_maybe_phash(pTHX_ AV *ary, SV **lelem, SV **firstlelem, SV **relem,
676 leftop = ((BINOP*)PL_op)->op_last;
678 assert(leftop->op_type == OP_NULL && leftop->op_targ == OP_LIST);
679 leftop = ((LISTOP*)leftop)->op_first;
681 /* Skip PUSHMARK and each element already assigned to. */
682 for (i = lelem - firstlelem; i > 0; i--) {
683 leftop = leftop->op_sibling;
686 if (leftop->op_type != OP_RV2HV)
691 av_fill(ary, 0); /* clear all but the fields hash */
692 if (lastrelem >= relem) {
693 while (relem < lastrelem) { /* gobble up all the rest */
697 /* Avoid a memory leak when avhv_store_ent dies. */
698 tmpstr = sv_newmortal();
699 sv_setsv(tmpstr,relem[1]); /* value */
701 if (avhv_store_ent(ary,relem[0],tmpstr,0))
702 (void)SvREFCNT_inc(tmpstr);
703 if (SvMAGICAL(ary) != 0 && SvSMAGICAL(tmpstr))
709 if (relem == lastrelem)
715 S_do_oddball(pTHX_ HV *hash, SV **relem, SV **firstrelem)
719 if (ckWARN(WARN_MISC)) {
720 if (relem == firstrelem &&
722 (SvTYPE(SvRV(*relem)) == SVt_PVAV ||
723 SvTYPE(SvRV(*relem)) == SVt_PVHV))
725 Perl_warner(aTHX_ WARN_MISC,
726 "Reference found where even-sized list expected");
729 Perl_warner(aTHX_ WARN_MISC,
730 "Odd number of elements in hash assignment");
732 if (SvTYPE(hash) == SVt_PVAV) {
734 tmpstr = sv_newmortal();
735 if (avhv_store_ent((AV*)hash,*relem,tmpstr,0))
736 (void)SvREFCNT_inc(tmpstr);
737 if (SvMAGICAL(hash) && SvSMAGICAL(tmpstr))
742 tmpstr = NEWSV(29,0);
743 didstore = hv_store_ent(hash,*relem,tmpstr,0);
744 if (SvMAGICAL(hash)) {
745 if (SvSMAGICAL(tmpstr))
758 SV **lastlelem = PL_stack_sp;
759 SV **lastrelem = PL_stack_base + POPMARK;
760 SV **firstrelem = PL_stack_base + POPMARK + 1;
761 SV **firstlelem = lastrelem + 1;
774 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
776 /* If there's a common identifier on both sides we have to take
777 * special care that assigning the identifier on the left doesn't
778 * clobber a value on the right that's used later in the list.
780 if (PL_op->op_private & (OPpASSIGN_COMMON)) {
781 EXTEND_MORTAL(lastrelem - firstrelem + 1);
782 for (relem = firstrelem; relem <= lastrelem; relem++) {
785 TAINT_NOT; /* Each item is independent */
786 *relem = sv_mortalcopy(sv);
796 while (lelem <= lastlelem) {
797 TAINT_NOT; /* Each item stands on its own, taintwise. */
799 switch (SvTYPE(sv)) {
802 magic = SvMAGICAL(ary) != 0;
803 if (PL_op->op_private & OPpASSIGN_HASH) {
804 switch (do_maybe_phash(ary, lelem, firstlelem, relem,
810 do_oddball((HV*)ary, relem, firstrelem);
812 relem = lastrelem + 1;
817 av_extend(ary, lastrelem - relem);
819 while (relem <= lastrelem) { /* gobble up all the rest */
825 didstore = av_store(ary,i++,sv);
835 case SVt_PVHV: { /* normal hash */
839 magic = SvMAGICAL(hash) != 0;
842 while (relem < lastrelem) { /* gobble up all the rest */
847 sv = &PL_sv_no, relem++;
848 tmpstr = NEWSV(29,0);
850 sv_setsv(tmpstr,*relem); /* value */
852 didstore = hv_store_ent(hash,sv,tmpstr,0);
854 if (SvSMAGICAL(tmpstr))
861 if (relem == lastrelem) {
862 do_oddball(hash, relem, firstrelem);
868 if (SvIMMORTAL(sv)) {
869 if (relem <= lastrelem)
873 if (relem <= lastrelem) {
874 sv_setsv(sv, *relem);
878 sv_setsv(sv, &PL_sv_undef);
883 if (PL_delaymagic & ~DM_DELAY) {
884 if (PL_delaymagic & DM_UID) {
886 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
889 (void)setreuid(PL_uid,PL_euid);
892 if ((PL_delaymagic & DM_UID) == DM_RUID) {
893 (void)setruid(PL_uid);
894 PL_delaymagic &= ~DM_RUID;
896 # endif /* HAS_SETRUID */
898 if ((PL_delaymagic & DM_UID) == DM_EUID) {
899 (void)seteuid(PL_uid);
900 PL_delaymagic &= ~DM_EUID;
902 # endif /* HAS_SETEUID */
903 if (PL_delaymagic & DM_UID) {
904 if (PL_uid != PL_euid)
905 DIE(aTHX_ "No setreuid available");
906 (void)PerlProc_setuid(PL_uid);
908 # endif /* HAS_SETREUID */
909 #endif /* HAS_SETRESUID */
910 PL_uid = PerlProc_getuid();
911 PL_euid = PerlProc_geteuid();
913 if (PL_delaymagic & DM_GID) {
915 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
918 (void)setregid(PL_gid,PL_egid);
921 if ((PL_delaymagic & DM_GID) == DM_RGID) {
922 (void)setrgid(PL_gid);
923 PL_delaymagic &= ~DM_RGID;
925 # endif /* HAS_SETRGID */
927 if ((PL_delaymagic & DM_GID) == DM_EGID) {
928 (void)setegid(PL_gid);
929 PL_delaymagic &= ~DM_EGID;
931 # endif /* HAS_SETEGID */
932 if (PL_delaymagic & DM_GID) {
933 if (PL_gid != PL_egid)
934 DIE(aTHX_ "No setregid available");
935 (void)PerlProc_setgid(PL_gid);
937 # endif /* HAS_SETREGID */
938 #endif /* HAS_SETRESGID */
939 PL_gid = PerlProc_getgid();
940 PL_egid = PerlProc_getegid();
942 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
949 else if (gimme == G_SCALAR) {
952 SETi(lastrelem - firstrelem + 1);
958 SP = firstrelem + (lastlelem - firstlelem);
959 lelem = firstlelem + (relem - firstrelem);
961 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
969 register PMOP *pm = cPMOP;
970 SV *rv = sv_newmortal();
971 SV *sv = newSVrv(rv, "Regexp");
972 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
979 register PMOP *pm = cPMOP;
984 I32 r_flags = REXEC_CHECKED;
985 char *truebase; /* Start of string */
986 register REGEXP *rx = pm->op_pmregexp;
991 I32 oldsave = PL_savestack_ix;
992 I32 update_minmatch = 1;
995 if (PL_op->op_flags & OPf_STACKED)
1001 PUTBACK; /* EVAL blocks need stack_sp. */
1002 s = SvPV(TARG, len);
1005 DIE(aTHX_ "panic: do_match");
1006 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1007 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1010 if (pm->op_pmdynflags & PMdf_USED) {
1012 if (gimme == G_ARRAY)
1017 if (!rx->prelen && PL_curpm) {
1019 rx = pm->op_pmregexp;
1021 if (rx->minlen > len) goto failure;
1025 /* XXXX What part of this is needed with true \G-support? */
1026 if ((global = pm->op_pmflags & PMf_GLOBAL)) {
1028 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1029 MAGIC* mg = mg_find(TARG, 'g');
1030 if (mg && mg->mg_len >= 0) {
1031 if (!(rx->reganch & ROPT_GPOS_SEEN))
1032 rx->endp[0] = rx->startp[0] = mg->mg_len;
1033 else if (rx->reganch & ROPT_ANCH_GPOS) {
1034 r_flags |= REXEC_IGNOREPOS;
1035 rx->endp[0] = rx->startp[0] = mg->mg_len;
1037 minmatch = (mg->mg_flags & MGf_MINMATCH);
1038 update_minmatch = 0;
1042 if ((gimme != G_ARRAY && !global && rx->nparens)
1043 || SvTEMP(TARG) || PL_sawampersand)
1044 r_flags |= REXEC_COPY_STR;
1046 r_flags |= REXEC_SCREAM;
1048 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1049 SAVEINT(PL_multiline);
1050 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1054 if (global && rx->startp[0] != -1) {
1055 t = s = rx->endp[0] + truebase;
1056 if ((s + rx->minlen) > strend)
1058 if (update_minmatch++)
1059 minmatch = had_zerolen;
1061 if (rx->reganch & RE_USE_INTUIT) {
1062 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1066 if ( (rx->reganch & ROPT_CHECK_ALL)
1068 && ((rx->reganch & ROPT_NOSCAN)
1069 || !((rx->reganch & RE_INTUIT_TAIL)
1070 && (r_flags & REXEC_SCREAM)))
1071 && !SvROK(TARG)) /* Cannot trust since INTUIT cannot guess ^ */
1074 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
1077 if (pm->op_pmflags & PMf_ONCE)
1078 pm->op_pmdynflags |= PMdf_USED;
1087 RX_MATCH_TAINTED_on(rx);
1088 TAINT_IF(RX_MATCH_TAINTED(rx));
1089 if (gimme == G_ARRAY) {
1092 iters = rx->nparens;
1093 if (global && !iters)
1097 SPAGAIN; /* EVAL blocks could move the stack. */
1098 EXTEND(SP, iters + i);
1099 EXTEND_MORTAL(iters + i);
1100 for (i = !i; i <= iters; i++) {
1101 PUSHs(sv_newmortal());
1103 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
1104 len = rx->endp[i] - rx->startp[i];
1105 s = rx->startp[i] + truebase;
1106 sv_setpvn(*SP, s, len);
1107 if ((pm->op_pmdynflags & PMdf_UTF8) && !IN_BYTE) {
1109 sv_utf8_downgrade(*SP, TRUE);
1114 had_zerolen = (rx->startp[0] != -1
1115 && rx->startp[0] == rx->endp[0]);
1116 PUTBACK; /* EVAL blocks may use stack */
1117 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1122 LEAVE_SCOPE(oldsave);
1128 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
1129 mg = mg_find(TARG, 'g');
1131 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
1132 mg = mg_find(TARG, 'g');
1134 if (rx->startp[0] != -1) {
1135 mg->mg_len = rx->endp[0];
1136 if (rx->startp[0] == rx->endp[0])
1137 mg->mg_flags |= MGf_MINMATCH;
1139 mg->mg_flags &= ~MGf_MINMATCH;
1142 LEAVE_SCOPE(oldsave);
1146 yup: /* Confirmed by INTUIT */
1148 RX_MATCH_TAINTED_on(rx);
1149 TAINT_IF(RX_MATCH_TAINTED(rx));
1151 if (pm->op_pmflags & PMf_ONCE)
1152 pm->op_pmdynflags |= PMdf_USED;
1153 if (RX_MATCH_COPIED(rx))
1154 Safefree(rx->subbeg);
1155 RX_MATCH_COPIED_off(rx);
1156 rx->subbeg = Nullch;
1158 rx->subbeg = truebase;
1159 rx->startp[0] = s - truebase;
1160 rx->endp[0] = s - truebase + rx->minlen;
1161 rx->sublen = strend - truebase;
1164 if (PL_sawampersand) {
1167 rx->subbeg = savepvn(t, strend - t);
1168 rx->sublen = strend - t;
1169 RX_MATCH_COPIED_on(rx);
1170 off = rx->startp[0] = s - t;
1171 rx->endp[0] = off + rx->minlen;
1173 else { /* startp/endp are used by @- @+. */
1174 rx->startp[0] = s - truebase;
1175 rx->endp[0] = s - truebase + rx->minlen;
1177 rx->nparens = rx->lastparen = 0; /* used by @- and @+ */
1178 LEAVE_SCOPE(oldsave);
1183 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1184 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1185 MAGIC* mg = mg_find(TARG, 'g');
1190 LEAVE_SCOPE(oldsave);
1191 if (gimme == G_ARRAY)
1197 Perl_do_readline(pTHX)
1199 dSP; dTARGETSTACKED;
1204 register IO *io = GvIO(PL_last_in_gv);
1205 register I32 type = PL_op->op_type;
1206 I32 gimme = GIMME_V;
1209 if ((mg = SvTIED_mg((SV*)PL_last_in_gv, 'q'))) {
1211 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1214 call_method("READLINE", gimme);
1217 if (gimme == G_SCALAR)
1218 SvSetMagicSV_nosteal(TARG, TOPs);
1225 if (IoFLAGS(io) & IOf_ARGV) {
1226 if (IoFLAGS(io) & IOf_START) {
1228 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1229 IoFLAGS(io) &= ~IOf_START;
1230 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1231 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1232 SvSETMAGIC(GvSV(PL_last_in_gv));
1237 fp = nextargv(PL_last_in_gv);
1238 if (!fp) { /* Note: fp != IoIFP(io) */
1239 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1242 else if (type == OP_GLOB) {
1243 SV *tmpcmd = NEWSV(55, 0);
1247 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1248 /* since spawning off a process is a real performance hit */
1250 #include <descrip.h>
1251 #include <lib$routines.h>
1254 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1255 char vmsspec[NAM$C_MAXRSS+1];
1256 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1257 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1258 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1261 struct dsc$descriptor_s wilddsc
1262 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1263 struct dsc$descriptor_vs rsdsc
1264 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1265 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1267 /* We could find out if there's an explicit dev/dir or version
1268 by peeking into lib$find_file's internal context at
1269 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1270 but that's unsupported, so I don't want to do it now and
1271 have it bite someone in the future. */
1272 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1273 cp = SvPV(tmpglob,i);
1275 if (cp[i] == ';') hasver = 1;
1277 if (sts) hasver = 1;
1281 hasdir = isunix = 1;
1284 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1289 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1291 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1292 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1293 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1294 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1295 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1296 &dfltdsc,NULL,NULL,NULL))&1)) {
1297 end = rstr + (unsigned long int) *rslt;
1298 if (!hasver) while (*end != ';') end--;
1299 *(end++) = '\n'; *end = '\0';
1300 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1302 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1307 while (*(--begin) != ']' && *begin != '>') ;
1310 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1312 if (cxt) (void)lib$find_file_end(&cxt);
1313 if (ok && sts != RMS$_NMF &&
1314 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1317 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1319 PerlIO_close(tmpfp);
1323 PerlIO_rewind(tmpfp);
1325 IoIFP(io) = fp = tmpfp;
1326 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1331 #ifdef MACOS_TRADITIONAL
1332 sv_setpv(tmpcmd, "glob ");
1333 sv_catsv(tmpcmd, tmpglob);
1334 sv_catpv(tmpcmd, " |");
1338 sv_setpv(tmpcmd, "for a in ");
1339 sv_catsv(tmpcmd, tmpglob);
1340 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1343 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1344 sv_catsv(tmpcmd, tmpglob);
1346 sv_setpv(tmpcmd, "perlglob ");
1347 sv_catsv(tmpcmd, tmpglob);
1348 sv_catpv(tmpcmd, " |");
1353 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1354 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1355 sv_catsv(tmpcmd, tmpglob);
1356 sv_catpv(tmpcmd, "' 2>/dev/null |");
1358 sv_setpv(tmpcmd, "echo ");
1359 sv_catsv(tmpcmd, tmpglob);
1361 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1363 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1366 #endif /* !DOSISH */
1367 #endif /* MACOS_TRADITIONAL */
1368 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1369 FALSE, O_RDONLY, 0, Nullfp);
1375 else if (type == OP_GLOB)
1377 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1378 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1379 || fp == PerlIO_stderr()))
1381 SV* sv = sv_newmortal();
1382 gv_efullname3(sv, PL_last_in_gv, Nullch);
1383 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1388 if (ckWARN2(WARN_GLOB,WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1389 if (type == OP_GLOB)
1390 Perl_warner(aTHX_ WARN_GLOB,
1391 "glob failed (can't start child: %s)",
1394 report_closed_fh(PL_last_in_gv, io, "readline", "filehandle");
1396 if (gimme == G_SCALAR) {
1397 (void)SvOK_off(TARG);
1403 if (gimme == G_SCALAR) {
1407 (void)SvUPGRADE(sv, SVt_PV);
1408 tmplen = SvLEN(sv); /* remember if already alloced */
1410 Sv_Grow(sv, 80); /* try short-buffering it */
1411 if (type == OP_RCATLINE)
1417 sv = sv_2mortal(NEWSV(57, 80));
1421 /* delay EOF state for a snarfed empty file */
1422 #define SNARF_EOF(gimme,rs,io,sv) \
1423 (gimme != G_SCALAR || SvCUR(sv) \
1424 || (IoFLAGS(io) & IOf_NOLINE) || !RsSNARF(rs))
1427 if (!sv_gets(sv, fp, offset)
1428 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1430 PerlIO_clearerr(fp);
1431 if (IoFLAGS(io) & IOf_ARGV) {
1432 fp = nextargv(PL_last_in_gv);
1435 (void)do_close(PL_last_in_gv, FALSE);
1437 else if (type == OP_GLOB) {
1438 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_GLOB)) {
1439 Perl_warner(aTHX_ WARN_GLOB,
1440 "glob failed (child exited with status %d%s)",
1441 (int)(STATUS_CURRENT >> 8),
1442 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1445 if (gimme == G_SCALAR) {
1446 (void)SvOK_off(TARG);
1451 /* This should not be marked tainted if the fp is marked clean */
1452 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1457 IoFLAGS(io) |= IOf_NOLINE;
1460 if (type == OP_GLOB) {
1463 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1464 tmps = SvEND(sv) - 1;
1465 if (*tmps == *SvPVX(PL_rs)) {
1470 for (tmps = SvPVX(sv); *tmps; tmps++)
1471 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1472 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1474 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1475 (void)POPs; /* Unmatched wildcard? Chuck it... */
1479 if (gimme == G_ARRAY) {
1480 if (SvLEN(sv) - SvCUR(sv) > 20) {
1481 SvLEN_set(sv, SvCUR(sv)+1);
1482 Renew(SvPVX(sv), SvLEN(sv), char);
1484 sv = sv_2mortal(NEWSV(58, 80));
1487 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1488 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1492 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1493 Renew(SvPVX(sv), SvLEN(sv), char);
1502 register PERL_CONTEXT *cx;
1503 I32 gimme = OP_GIMME(PL_op, -1);
1506 if (cxstack_ix >= 0)
1507 gimme = cxstack[cxstack_ix].blk_gimme;
1515 PUSHBLOCK(cx, CXt_BLOCK, SP);
1527 U32 lval = PL_op->op_flags & OPf_MOD;
1528 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1531 if (SvTYPE(hv) == SVt_PVHV) {
1532 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1533 svp = he ? &HeVAL(he) : 0;
1535 else if (SvTYPE(hv) == SVt_PVAV) {
1536 if (PL_op->op_private & OPpLVAL_INTRO)
1537 DIE(aTHX_ "Can't localize pseudo-hash element");
1538 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1544 if (!svp || *svp == &PL_sv_undef) {
1549 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1551 lv = sv_newmortal();
1552 sv_upgrade(lv, SVt_PVLV);
1554 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1555 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1556 LvTARG(lv) = SvREFCNT_inc(hv);
1561 if (PL_op->op_private & OPpLVAL_INTRO) {
1562 if (HvNAME(hv) && isGV(*svp))
1563 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1565 save_helem(hv, keysv, svp);
1567 else if (PL_op->op_private & OPpDEREF)
1568 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1570 sv = (svp ? *svp : &PL_sv_undef);
1571 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1572 * Pushing the magical RHS on to the stack is useless, since
1573 * that magic is soon destined to be misled by the local(),
1574 * and thus the later pp_sassign() will fail to mg_get() the
1575 * old value. This should also cure problems with delayed
1576 * mg_get()s. GSAR 98-07-03 */
1577 if (!lval && SvGMAGICAL(sv))
1578 sv = sv_mortalcopy(sv);
1586 register PERL_CONTEXT *cx;
1592 if (PL_op->op_flags & OPf_SPECIAL) {
1593 cx = &cxstack[cxstack_ix];
1594 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1599 gimme = OP_GIMME(PL_op, -1);
1601 if (cxstack_ix >= 0)
1602 gimme = cxstack[cxstack_ix].blk_gimme;
1608 if (gimme == G_VOID)
1610 else if (gimme == G_SCALAR) {
1613 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1616 *MARK = sv_mortalcopy(TOPs);
1619 *MARK = &PL_sv_undef;
1623 else if (gimme == G_ARRAY) {
1624 /* in case LEAVE wipes old return values */
1625 for (mark = newsp + 1; mark <= SP; mark++) {
1626 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1627 *mark = sv_mortalcopy(*mark);
1628 TAINT_NOT; /* Each item is independent */
1632 PL_curpm = newpm; /* Don't pop $1 et al till now */
1642 register PERL_CONTEXT *cx;
1648 cx = &cxstack[cxstack_ix];
1649 if (CxTYPE(cx) != CXt_LOOP)
1650 DIE(aTHX_ "panic: pp_iter");
1652 itersvp = CxITERVAR(cx);
1653 av = cx->blk_loop.iterary;
1654 if (SvTYPE(av) != SVt_PVAV) {
1655 /* iterate ($min .. $max) */
1656 if (cx->blk_loop.iterlval) {
1657 /* string increment */
1658 register SV* cur = cx->blk_loop.iterlval;
1660 char *max = SvPV((SV*)av, maxlen);
1661 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1662 #ifndef USE_THREADS /* don't risk potential race */
1663 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1664 /* safe to reuse old SV */
1665 sv_setsv(*itersvp, cur);
1670 /* we need a fresh SV every time so that loop body sees a
1671 * completely new SV for closures/references to work as
1673 SvREFCNT_dec(*itersvp);
1674 *itersvp = newSVsv(cur);
1676 if (strEQ(SvPVX(cur), max))
1677 sv_setiv(cur, 0); /* terminate next time */
1684 /* integer increment */
1685 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1688 #ifndef USE_THREADS /* don't risk potential race */
1689 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1690 /* safe to reuse old SV */
1691 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1696 /* we need a fresh SV every time so that loop body sees a
1697 * completely new SV for closures/references to work as they
1699 SvREFCNT_dec(*itersvp);
1700 *itersvp = newSViv(cx->blk_loop.iterix++);
1706 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1709 SvREFCNT_dec(*itersvp);
1711 if ((sv = SvMAGICAL(av)
1712 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1713 : AvARRAY(av)[++cx->blk_loop.iterix]))
1717 if (av != PL_curstack && SvIMMORTAL(sv)) {
1718 SV *lv = cx->blk_loop.iterlval;
1719 if (lv && SvREFCNT(lv) > 1) {
1724 SvREFCNT_dec(LvTARG(lv));
1726 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1727 sv_upgrade(lv, SVt_PVLV);
1729 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1731 LvTARG(lv) = SvREFCNT_inc(av);
1732 LvTARGOFF(lv) = cx->blk_loop.iterix;
1733 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1737 *itersvp = SvREFCNT_inc(sv);
1744 register PMOP *pm = cPMOP;
1760 register REGEXP *rx = pm->op_pmregexp;
1762 int force_on_match = 0;
1763 I32 oldsave = PL_savestack_ix;
1765 /* known replacement string? */
1766 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1767 if (PL_op->op_flags & OPf_STACKED)
1773 if (SvREADONLY(TARG)
1774 || (SvTYPE(TARG) > SVt_PVLV
1775 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1776 DIE(aTHX_ PL_no_modify);
1779 s = SvPV(TARG, len);
1780 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1782 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1783 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1790 DIE(aTHX_ "panic: do_subst");
1793 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1794 position, once with zero-length,
1795 second time with non-zero. */
1797 if (!rx->prelen && PL_curpm) {
1799 rx = pm->op_pmregexp;
1801 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1802 ? REXEC_COPY_STR : 0;
1804 r_flags |= REXEC_SCREAM;
1805 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1806 SAVEINT(PL_multiline);
1807 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1810 if (rx->reganch & RE_USE_INTUIT) {
1811 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1815 /* How to do it in subst? */
1816 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1818 && ((rx->reganch & ROPT_NOSCAN)
1819 || !((rx->reganch & RE_INTUIT_TAIL)
1820 && (r_flags & REXEC_SCREAM))))
1825 /* only replace once? */
1826 once = !(rpm->op_pmflags & PMf_GLOBAL);
1828 /* known replacement string? */
1829 c = dstr ? SvPV(dstr, clen) : Nullch;
1831 /* can do inplace substitution? */
1832 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1833 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1834 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1835 r_flags | REXEC_CHECKED))
1839 LEAVE_SCOPE(oldsave);
1842 if (force_on_match) {
1844 s = SvPV_force(TARG, len);
1849 SvSCREAM_off(TARG); /* disable possible screamer */
1851 rxtainted |= RX_MATCH_TAINTED(rx);
1852 m = orig + rx->startp[0];
1853 d = orig + rx->endp[0];
1855 if (m - s > strend - d) { /* faster to shorten from end */
1857 Copy(c, m, clen, char);
1862 Move(d, m, i, char);
1866 SvCUR_set(TARG, m - s);
1869 else if ((i = m - s)) { /* faster from front */
1877 Copy(c, m, clen, char);
1882 Copy(c, d, clen, char);
1887 TAINT_IF(rxtainted & 1);
1893 if (iters++ > maxiters)
1894 DIE(aTHX_ "Substitution loop");
1895 rxtainted |= RX_MATCH_TAINTED(rx);
1896 m = rx->startp[0] + orig;
1900 Move(s, d, i, char);
1904 Copy(c, d, clen, char);
1907 s = rx->endp[0] + orig;
1908 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1910 /* don't match same null twice */
1911 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1914 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1915 Move(s, d, i+1, char); /* include the NUL */
1917 TAINT_IF(rxtainted & 1);
1919 PUSHs(sv_2mortal(newSViv((I32)iters)));
1921 (void)SvPOK_only_UTF8(TARG);
1922 TAINT_IF(rxtainted);
1923 if (SvSMAGICAL(TARG)) {
1929 LEAVE_SCOPE(oldsave);
1933 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1934 r_flags | REXEC_CHECKED))
1936 if (force_on_match) {
1938 s = SvPV_force(TARG, len);
1941 rxtainted |= RX_MATCH_TAINTED(rx);
1942 dstr = NEWSV(25, len);
1943 sv_setpvn(dstr, m, s-m);
1946 register PERL_CONTEXT *cx;
1949 RETURNOP(cPMOP->op_pmreplroot);
1951 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1953 if (iters++ > maxiters)
1954 DIE(aTHX_ "Substitution loop");
1955 rxtainted |= RX_MATCH_TAINTED(rx);
1956 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1961 strend = s + (strend - m);
1963 m = rx->startp[0] + orig;
1964 sv_catpvn(dstr, s, m-s);
1965 s = rx->endp[0] + orig;
1967 sv_catpvn(dstr, c, clen);
1970 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1971 sv_catpvn(dstr, s, strend - s);
1973 (void)SvOOK_off(TARG);
1974 Safefree(SvPVX(TARG));
1975 SvPVX(TARG) = SvPVX(dstr);
1976 SvCUR_set(TARG, SvCUR(dstr));
1977 SvLEN_set(TARG, SvLEN(dstr));
1981 TAINT_IF(rxtainted & 1);
1983 PUSHs(sv_2mortal(newSViv((I32)iters)));
1985 (void)SvPOK_only(TARG);
1986 TAINT_IF(rxtainted);
1989 LEAVE_SCOPE(oldsave);
1998 LEAVE_SCOPE(oldsave);
2007 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
2008 ++*PL_markstack_ptr;
2009 LEAVE; /* exit inner scope */
2012 if (PL_stack_base + *PL_markstack_ptr > SP) {
2014 I32 gimme = GIMME_V;
2016 LEAVE; /* exit outer scope */
2017 (void)POPMARK; /* pop src */
2018 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
2019 (void)POPMARK; /* pop dst */
2020 SP = PL_stack_base + POPMARK; /* pop original mark */
2021 if (gimme == G_SCALAR) {
2025 else if (gimme == G_ARRAY)
2032 ENTER; /* enter inner scope */
2035 src = PL_stack_base[*PL_markstack_ptr];
2039 RETURNOP(cLOGOP->op_other);
2050 register PERL_CONTEXT *cx;
2056 if (gimme == G_SCALAR) {
2059 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2061 *MARK = SvREFCNT_inc(TOPs);
2066 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2068 *MARK = sv_mortalcopy(sv);
2073 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2077 *MARK = &PL_sv_undef;
2081 else if (gimme == G_ARRAY) {
2082 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2083 if (!SvTEMP(*MARK)) {
2084 *MARK = sv_mortalcopy(*MARK);
2085 TAINT_NOT; /* Each item is independent */
2091 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2092 PL_curpm = newpm; /* ... and pop $1 et al */
2096 return pop_return();
2099 /* This duplicates the above code because the above code must not
2100 * get any slower by more conditions */
2108 register PERL_CONTEXT *cx;
2115 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
2116 /* We are an argument to a function or grep().
2117 * This kind of lvalueness was legal before lvalue
2118 * subroutines too, so be backward compatible:
2119 * cannot report errors. */
2121 /* Scalar context *is* possible, on the LHS of -> only,
2122 * as in f()->meth(). But this is not an lvalue. */
2123 if (gimme == G_SCALAR)
2125 if (gimme == G_ARRAY) {
2126 if (!CvLVALUE(cx->blk_sub.cv))
2127 goto temporise_array;
2128 EXTEND_MORTAL(SP - newsp);
2129 for (mark = newsp + 1; mark <= SP; mark++) {
2132 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
2133 *mark = sv_mortalcopy(*mark);
2135 /* Can be a localized value subject to deletion. */
2136 PL_tmps_stack[++PL_tmps_ix] = *mark;
2137 (void)SvREFCNT_inc(*mark);
2142 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2143 /* Here we go for robustness, not for speed, so we change all
2144 * the refcounts so the caller gets a live guy. Cannot set
2145 * TEMP, so sv_2mortal is out of question. */
2146 if (!CvLVALUE(cx->blk_sub.cv)) {
2151 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2153 if (gimme == G_SCALAR) {
2157 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2162 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2163 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2165 else { /* Can be a localized value
2166 * subject to deletion. */
2167 PL_tmps_stack[++PL_tmps_ix] = *mark;
2168 (void)SvREFCNT_inc(*mark);
2171 else { /* Should not happen? */
2176 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2177 (MARK > SP ? "Empty array" : "Array"));
2181 else if (gimme == G_ARRAY) {
2182 EXTEND_MORTAL(SP - newsp);
2183 for (mark = newsp + 1; mark <= SP; mark++) {
2184 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2185 /* Might be flattened array after $#array = */
2191 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2192 (*mark != &PL_sv_undef)
2194 ? "a readonly value" : "a temporary")
2195 : "an uninitialized value");
2198 /* Can be a localized value subject to deletion. */
2199 PL_tmps_stack[++PL_tmps_ix] = *mark;
2200 (void)SvREFCNT_inc(*mark);
2206 if (gimme == G_SCALAR) {
2210 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2212 *MARK = SvREFCNT_inc(TOPs);
2217 sv = SvREFCNT_inc(TOPs); /* FREETMPS could clobber it */
2219 *MARK = sv_mortalcopy(sv);
2224 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2228 *MARK = &PL_sv_undef;
2232 else if (gimme == G_ARRAY) {
2234 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2235 if (!SvTEMP(*MARK)) {
2236 *MARK = sv_mortalcopy(*MARK);
2237 TAINT_NOT; /* Each item is independent */
2244 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2245 PL_curpm = newpm; /* ... and pop $1 et al */
2249 return pop_return();
2254 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2257 SV *dbsv = GvSV(PL_DBsub);
2259 if (!PERLDB_SUB_NN) {
2263 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2264 || strEQ(GvNAME(gv), "END")
2265 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2266 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2267 && (gv = (GV*)*svp) ))) {
2268 /* Use GV from the stack as a fallback. */
2269 /* GV is potentially non-unique, or contain different CV. */
2270 sv_setsv(dbsv, newRV((SV*)cv));
2273 gv_efullname3(dbsv, gv, Nullch);
2277 (void)SvUPGRADE(dbsv, SVt_PVIV);
2278 (void)SvIOK_on(dbsv);
2279 SAVEIV(SvIVX(dbsv));
2280 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2284 PL_curcopdb = PL_curcop;
2285 cv = GvCV(PL_DBsub);
2295 register PERL_CONTEXT *cx;
2297 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2300 DIE(aTHX_ "Not a CODE reference");
2301 switch (SvTYPE(sv)) {
2307 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2309 SP = PL_stack_base + POPMARK;
2312 if (SvGMAGICAL(sv)) {
2314 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2317 sym = SvPV(sv, n_a);
2319 DIE(aTHX_ PL_no_usym, "a subroutine");
2320 if (PL_op->op_private & HINT_STRICT_REFS)
2321 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2322 cv = get_cv(sym, TRUE);
2326 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2327 tryAMAGICunDEREF(to_cv);
2330 if (SvTYPE(cv) == SVt_PVCV)
2335 DIE(aTHX_ "Not a CODE reference");
2340 if (!(cv = GvCVu((GV*)sv)))
2341 cv = sv_2cv(sv, &stash, &gv, FALSE);
2354 if (!CvROOT(cv) && !CvXSUB(cv)) {
2358 /* anonymous or undef'd function leaves us no recourse */
2359 if (CvANON(cv) || !(gv = CvGV(cv)))
2360 DIE(aTHX_ "Undefined subroutine called");
2362 /* autoloaded stub? */
2363 if (cv != GvCV(gv)) {
2366 /* should call AUTOLOAD now? */
2369 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2376 sub_name = sv_newmortal();
2377 gv_efullname3(sub_name, gv, Nullch);
2378 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2382 DIE(aTHX_ "Not a CODE reference");
2387 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2388 cv = get_db_sub(&sv, cv);
2390 DIE(aTHX_ "No DBsub routine");
2395 * First we need to check if the sub or method requires locking.
2396 * If so, we gain a lock on the CV, the first argument or the
2397 * stash (for static methods), as appropriate. This has to be
2398 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2399 * reschedule by returning a new op.
2401 MUTEX_LOCK(CvMUTEXP(cv));
2402 if (CvFLAGS(cv) & CVf_LOCKED) {
2404 if (CvFLAGS(cv) & CVf_METHOD) {
2405 if (SP > PL_stack_base + TOPMARK)
2406 sv = *(PL_stack_base + TOPMARK + 1);
2408 AV *av = (AV*)PL_curpad[0];
2409 if (hasargs || !av || AvFILLp(av) < 0
2410 || !(sv = AvARRAY(av)[0]))
2412 MUTEX_UNLOCK(CvMUTEXP(cv));
2413 DIE(aTHX_ "no argument for locked method call");
2420 char *stashname = SvPV(sv, len);
2421 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2427 MUTEX_UNLOCK(CvMUTEXP(cv));
2428 mg = condpair_magic(sv);
2429 MUTEX_LOCK(MgMUTEXP(mg));
2430 if (MgOWNER(mg) == thr)
2431 MUTEX_UNLOCK(MgMUTEXP(mg));
2434 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2436 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2438 MUTEX_UNLOCK(MgMUTEXP(mg));
2439 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2441 MUTEX_LOCK(CvMUTEXP(cv));
2444 * Now we have permission to enter the sub, we must distinguish
2445 * four cases. (0) It's an XSUB (in which case we don't care
2446 * about ownership); (1) it's ours already (and we're recursing);
2447 * (2) it's free (but we may already be using a cached clone);
2448 * (3) another thread owns it. Case (1) is easy: we just use it.
2449 * Case (2) means we look for a clone--if we have one, use it
2450 * otherwise grab ownership of cv. Case (3) means we look for a
2451 * clone (for non-XSUBs) and have to create one if we don't
2453 * Why look for a clone in case (2) when we could just grab
2454 * ownership of cv straight away? Well, we could be recursing,
2455 * i.e. we originally tried to enter cv while another thread
2456 * owned it (hence we used a clone) but it has been freed up
2457 * and we're now recursing into it. It may or may not be "better"
2458 * to use the clone but at least CvDEPTH can be trusted.
2460 if (CvOWNER(cv) == thr || CvXSUB(cv))
2461 MUTEX_UNLOCK(CvMUTEXP(cv));
2463 /* Case (2) or (3) */
2467 * XXX Might it be better to release CvMUTEXP(cv) while we
2468 * do the hv_fetch? We might find someone has pinched it
2469 * when we look again, in which case we would be in case
2470 * (3) instead of (2) so we'd have to clone. Would the fact
2471 * that we released the mutex more quickly make up for this?
2473 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2475 /* We already have a clone to use */
2476 MUTEX_UNLOCK(CvMUTEXP(cv));
2478 DEBUG_S(PerlIO_printf(Perl_debug_log,
2479 "entersub: %p already has clone %p:%s\n",
2480 thr, cv, SvPEEK((SV*)cv)));
2483 if (CvDEPTH(cv) == 0)
2484 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2487 /* (2) => grab ownership of cv. (3) => make clone */
2491 MUTEX_UNLOCK(CvMUTEXP(cv));
2492 DEBUG_S(PerlIO_printf(Perl_debug_log,
2493 "entersub: %p grabbing %p:%s in stash %s\n",
2494 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2495 HvNAME(CvSTASH(cv)) : "(none)"));
2498 /* Make a new clone. */
2500 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2501 MUTEX_UNLOCK(CvMUTEXP(cv));
2502 DEBUG_S((PerlIO_printf(Perl_debug_log,
2503 "entersub: %p cloning %p:%s\n",
2504 thr, cv, SvPEEK((SV*)cv))));
2506 * We're creating a new clone so there's no race
2507 * between the original MUTEX_UNLOCK and the
2508 * SvREFCNT_inc since no one will be trying to undef
2509 * it out from underneath us. At least, I don't think
2512 clonecv = cv_clone(cv);
2513 SvREFCNT_dec(cv); /* finished with this */
2514 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2515 CvOWNER(clonecv) = thr;
2519 DEBUG_S(if (CvDEPTH(cv) != 0)
2520 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2522 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2525 #endif /* USE_THREADS */
2528 #ifdef PERL_XSUB_OLDSTYLE
2529 if (CvOLDSTYLE(cv)) {
2530 I32 (*fp3)(int,int,int);
2532 register I32 items = SP - MARK;
2533 /* We dont worry to copy from @_. */
2538 PL_stack_sp = mark + 1;
2539 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2540 items = (*fp3)(CvXSUBANY(cv).any_i32,
2541 MARK - PL_stack_base + 1,
2543 PL_stack_sp = PL_stack_base + items;
2546 #endif /* PERL_XSUB_OLDSTYLE */
2548 I32 markix = TOPMARK;
2553 /* Need to copy @_ to stack. Alternative may be to
2554 * switch stack to @_, and copy return values
2555 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2559 av = (AV*)PL_curpad[0];
2561 av = GvAV(PL_defgv);
2562 #endif /* USE_THREADS */
2563 items = AvFILLp(av) + 1; /* @_ is not tieable */
2566 /* Mark is at the end of the stack. */
2568 Copy(AvARRAY(av), SP + 1, items, SV*);
2573 /* We assume first XSUB in &DB::sub is the called one. */
2575 SAVEVPTR(PL_curcop);
2576 PL_curcop = PL_curcopdb;
2579 /* Do we need to open block here? XXXX */
2580 (void)(*CvXSUB(cv))(aTHXo_ cv);
2582 /* Enforce some sanity in scalar context. */
2583 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2584 if (markix > PL_stack_sp - PL_stack_base)
2585 *(PL_stack_base + markix) = &PL_sv_undef;
2587 *(PL_stack_base + markix) = *PL_stack_sp;
2588 PL_stack_sp = PL_stack_base + markix;
2596 register I32 items = SP - MARK;
2597 AV* padlist = CvPADLIST(cv);
2598 SV** svp = AvARRAY(padlist);
2599 push_return(PL_op->op_next);
2600 PUSHBLOCK(cx, CXt_SUB, MARK);
2603 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2604 * that eval'' ops within this sub know the correct lexical space.
2605 * Owing the speed considerations, we choose to search for the cv
2606 * in doeval() instead.
2608 if (CvDEPTH(cv) < 2)
2609 (void)SvREFCNT_inc(cv);
2610 else { /* save temporaries on recursion? */
2611 PERL_STACK_OVERFLOW_CHECK();
2612 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2614 AV *newpad = newAV();
2615 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2616 I32 ix = AvFILLp((AV*)svp[1]);
2617 I32 names_fill = AvFILLp((AV*)svp[0]);
2618 svp = AvARRAY(svp[0]);
2619 for ( ;ix > 0; ix--) {
2620 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2621 char *name = SvPVX(svp[ix]);
2622 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2623 || *name == '&') /* anonymous code? */
2625 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2627 else { /* our own lexical */
2629 av_store(newpad, ix, sv = (SV*)newAV());
2630 else if (*name == '%')
2631 av_store(newpad, ix, sv = (SV*)newHV());
2633 av_store(newpad, ix, sv = NEWSV(0,0));
2637 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2638 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2641 av_store(newpad, ix, sv = NEWSV(0,0));
2645 av = newAV(); /* will be @_ */
2647 av_store(newpad, 0, (SV*)av);
2648 AvFLAGS(av) = AVf_REIFY;
2649 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2650 AvFILLp(padlist) = CvDEPTH(cv);
2651 svp = AvARRAY(padlist);
2656 AV* av = (AV*)PL_curpad[0];
2658 items = AvFILLp(av) + 1;
2660 /* Mark is at the end of the stack. */
2662 Copy(AvARRAY(av), SP + 1, items, SV*);
2667 #endif /* USE_THREADS */
2668 SAVEVPTR(PL_curpad);
2669 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2672 #endif /* USE_THREADS */
2678 DEBUG_S(PerlIO_printf(Perl_debug_log,
2679 "%p entersub preparing @_\n", thr));
2681 av = (AV*)PL_curpad[0];
2683 /* @_ is normally not REAL--this should only ever
2684 * happen when DB::sub() calls things that modify @_ */
2690 cx->blk_sub.savearray = GvAV(PL_defgv);
2691 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2692 #endif /* USE_THREADS */
2693 cx->blk_sub.oldcurpad = PL_curpad;
2694 cx->blk_sub.argarray = av;
2697 if (items > AvMAX(av) + 1) {
2699 if (AvARRAY(av) != ary) {
2700 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2701 SvPVX(av) = (char*)ary;
2703 if (items > AvMAX(av) + 1) {
2704 AvMAX(av) = items - 1;
2705 Renew(ary,items,SV*);
2707 SvPVX(av) = (char*)ary;
2710 Copy(MARK,AvARRAY(av),items,SV*);
2711 AvFILLp(av) = items - 1;
2719 /* warning must come *after* we fully set up the context
2720 * stuff so that __WARN__ handlers can safely dounwind()
2723 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2724 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2725 sub_crush_depth(cv);
2727 DEBUG_S(PerlIO_printf(Perl_debug_log,
2728 "%p entersub returning %p\n", thr, CvSTART(cv)));
2730 RETURNOP(CvSTART(cv));
2735 Perl_sub_crush_depth(pTHX_ CV *cv)
2738 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2740 SV* tmpstr = sv_newmortal();
2741 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2742 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2753 U32 lval = PL_op->op_flags & OPf_MOD;
2754 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2758 elem -= PL_curcop->cop_arybase;
2759 if (SvTYPE(av) != SVt_PVAV)
2761 svp = av_fetch(av, elem, lval && !defer);
2763 if (!svp || *svp == &PL_sv_undef) {
2766 DIE(aTHX_ PL_no_aelem, elem);
2767 lv = sv_newmortal();
2768 sv_upgrade(lv, SVt_PVLV);
2770 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2771 LvTARG(lv) = SvREFCNT_inc(av);
2772 LvTARGOFF(lv) = elem;
2777 if (PL_op->op_private & OPpLVAL_INTRO)
2778 save_aelem(av, elem, svp);
2779 else if (PL_op->op_private & OPpDEREF)
2780 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2782 sv = (svp ? *svp : &PL_sv_undef);
2783 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2784 sv = sv_mortalcopy(sv);
2790 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2796 Perl_croak(aTHX_ PL_no_modify);
2797 if (SvTYPE(sv) < SVt_RV)
2798 sv_upgrade(sv, SVt_RV);
2799 else if (SvTYPE(sv) >= SVt_PV) {
2800 (void)SvOOK_off(sv);
2801 Safefree(SvPVX(sv));
2802 SvLEN(sv) = SvCUR(sv) = 0;
2806 SvRV(sv) = NEWSV(355,0);
2809 SvRV(sv) = (SV*)newAV();
2812 SvRV(sv) = (SV*)newHV();
2827 if (SvTYPE(rsv) == SVt_PVCV) {
2833 SETs(method_common(sv, Null(U32*)));
2840 SV* sv = cSVOP->op_sv;
2841 U32 hash = SvUVX(sv);
2843 XPUSHs(method_common(sv, &hash));
2848 S_method_common(pTHX_ SV* meth, U32* hashp)
2859 name = SvPV(meth, namelen);
2860 sv = *(PL_stack_base + TOPMARK + 1);
2871 !(packname = SvPV(sv, packlen)) ||
2872 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2873 !(ob=(SV*)GvIO(iogv)))
2876 ((*(U8*)packname >= 0xc0 && DO_UTF8(sv))
2877 ? !isIDFIRST_utf8((U8*)packname)
2878 : !isIDFIRST(*packname)
2881 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2882 SvOK(sv) ? "without a package or object reference"
2883 : "on an undefined value");
2885 stash = gv_stashpvn(packname, packlen, TRUE);
2888 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2891 if (!ob || !(SvOBJECT(ob)
2892 || (SvTYPE(ob) == SVt_PVGV && (ob = (SV*)GvIO((GV*)ob))
2895 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2899 stash = SvSTASH(ob);
2902 /* shortcut for simple names */
2904 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2906 gv = (GV*)HeVAL(he);
2907 if (isGV(gv) && GvCV(gv) &&
2908 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2909 return (SV*)GvCV(gv);
2913 gv = gv_fetchmethod(stash, name);
2919 for (p = name; *p; p++) {
2921 sep = p, leaf = p + 1;
2922 else if (*p == ':' && *(p + 1) == ':')
2923 sep = p, leaf = p + 2;
2925 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2926 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2927 packlen = strlen(packname);
2931 packlen = sep - name;
2934 "Can't locate object method \"%s\" via package \"%s\"",
2937 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2942 unset_cvowner(pTHXo_ void *cvarg)
2944 register CV* cv = (CV *) cvarg;
2947 #endif /* DEBUGGING */
2949 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2950 thr, cv, SvPEEK((SV*)cv))));
2951 MUTEX_LOCK(CvMUTEXP(cv));
2952 DEBUG_S(if (CvDEPTH(cv) != 0)
2953 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2955 assert(thr == CvOWNER(cv));
2957 MUTEX_UNLOCK(CvMUTEXP(cv));
2960 #endif /* USE_THREADS */