3 * Copyright (c) 1991-1999, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
11 * Then he heard Merry change the note, and up went the Horn-cry of Buckland,
14 * Awake! Awake! Fear, Fire, Foes! Awake!
19 #define PERL_IN_PP_HOT_C
32 #define HOP(pos,off) (IN_UTF8 ? utf8_hop(pos, off) : (pos + off))
37 static void unset_cvowner(pTHXo_ void *cvarg);
38 #endif /* USE_THREADS */
49 PL_curcop = (COP*)PL_op;
50 TAINT_NOT; /* Each statement is presumed innocent */
51 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
60 if (PL_op->op_private & OPpLVAL_INTRO)
61 PUSHs(save_scalar(cGVOP_gv));
63 PUSHs(GvSV(cGVOP_gv));
74 PL_curcop = (COP*)PL_op;
80 PUSHMARK(PL_stack_sp);
90 sv_setpvn(TARG,s,len);
98 XPUSHs((SV*)cGVOP_gv);
109 RETURNOP(cLOGOP->op_other);
118 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
120 temp = left; left = right; right = temp;
122 if (PL_tainting && PL_tainted && !SvTAINTED(left))
124 SvSetMagicSV(right, left);
133 RETURNOP(cLOGOP->op_other);
135 RETURNOP(cLOGOP->op_next);
141 TAINT_NOT; /* Each statement is presumed innocent */
142 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
144 oldsave = PL_scopestack[PL_scopestack_ix - 1];
145 LEAVE_SCOPE(oldsave);
151 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
158 sv_setpvn(TARG,s,len);
160 else if (SvGMAGICAL(TARG))
162 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
163 sv_setpv(TARG, ""); /* Suppress warning. */
164 s = SvPV_force(TARG, len);
168 #if defined(PERL_Y2KWARN)
169 if ((SvIOK(right) || SvNOK(right)) && ckWARN(WARN_MISC)) {
171 char *s = SvPV(TARG,n);
172 if (n >= 2 && s[n-2] == '1' && s[n-1] == '9'
173 && (n == 2 || !isDIGIT(s[n-3])))
175 Perl_warner(aTHX_ WARN_MISC, "Possible Y2K bug: %s",
176 "about to append an integer to '19'");
180 sv_catpvn(TARG,s,len);
183 sv_setpvn(TARG,s,len); /* suppress warning */
193 if (PL_op->op_flags & OPf_MOD) {
194 if (PL_op->op_private & OPpLVAL_INTRO)
195 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
196 else if (PL_op->op_private & OPpDEREF) {
198 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
207 tryAMAGICunTARGET(iter, 0);
208 PL_last_in_gv = (GV*)(*PL_stack_sp--);
209 if (SvTYPE(PL_last_in_gv) != SVt_PVGV) {
210 if (SvROK(PL_last_in_gv) && SvTYPE(SvRV(PL_last_in_gv)) == SVt_PVGV)
211 PL_last_in_gv = (GV*)SvRV(PL_last_in_gv);
214 XPUSHs((SV*)PL_last_in_gv);
217 PL_last_in_gv = (GV*)(*PL_stack_sp--);
220 return do_readline();
225 djSP; tryAMAGICbinSET(eq,0);
228 SETs(boolSV(TOPn == value));
236 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
237 DIE(aTHX_ PL_no_modify);
238 if (SvIOK_notUV(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
239 SvIVX(TOPs) != IV_MAX)
242 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
257 RETURNOP(cLOGOP->op_other);
263 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
266 SETn( left + right );
274 AV *av = GvAV(cGVOP_gv);
275 U32 lval = PL_op->op_flags & OPf_MOD;
276 SV** svp = av_fetch(av, PL_op->op_private, lval);
277 SV *sv = (svp ? *svp : &PL_sv_undef);
279 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
280 sv = sv_mortalcopy(sv);
287 djSP; dMARK; dTARGET;
289 do_join(TARG, *MARK, MARK, SP);
300 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
301 * will be enough to hold an OP*.
303 SV* sv = sv_newmortal();
304 sv_upgrade(sv, SVt_PVLV);
306 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
314 /* Oversized hot code. */
318 djSP; dMARK; dORIGMARK;
325 if (PL_op->op_flags & OPf_STACKED)
329 if (mg = SvTIED_mg((SV*)gv, 'q')) {
330 if (MARK == ORIGMARK) {
331 /* If using default handle then we need to make space to
332 * pass object as 1st arg, so move other args up ...
336 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
340 *MARK = SvTIED_obj((SV*)gv, mg);
343 call_method("PRINT", G_SCALAR);
351 if (!(io = GvIO(gv))) {
352 if (ckWARN(WARN_UNOPENED)) {
353 SV* sv = sv_newmortal();
354 gv_efullname3(sv, gv, Nullch);
355 Perl_warner(aTHX_ WARN_UNOPENED, "Filehandle %s never opened",
358 SETERRNO(EBADF,RMS$_IFI);
361 else if (!(fp = IoOFP(io))) {
362 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
363 SV* sv = sv_newmortal();
364 gv_efullname3(sv, gv, Nullch);
366 Perl_warner(aTHX_ WARN_IO,
367 "Filehandle %s opened only for input",
369 else if (ckWARN(WARN_CLOSED))
370 Perl_warner(aTHX_ WARN_CLOSED,
371 "print on closed filehandle %s", SvPV(sv,n_a));
373 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
380 if (!do_print(*MARK, fp))
384 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
393 if (!do_print(*MARK, fp))
402 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
405 if (IoFLAGS(io) & IOf_FLUSH)
406 if (PerlIO_flush(fp) == EOF)
427 tryAMAGICunDEREF(to_av);
430 if (SvTYPE(av) != SVt_PVAV)
431 DIE(aTHX_ "Not an ARRAY reference");
432 if (PL_op->op_flags & OPf_REF) {
438 if (SvTYPE(sv) == SVt_PVAV) {
440 if (PL_op->op_flags & OPf_REF) {
448 if (SvTYPE(sv) != SVt_PVGV) {
452 if (SvGMAGICAL(sv)) {
458 if (PL_op->op_flags & OPf_REF ||
459 PL_op->op_private & HINT_STRICT_REFS)
460 DIE(aTHX_ PL_no_usym, "an ARRAY");
461 if (ckWARN(WARN_UNINITIALIZED))
463 if (GIMME == G_ARRAY) {
470 if ((PL_op->op_flags & OPf_SPECIAL) &&
471 !(PL_op->op_flags & OPf_MOD))
473 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVAV);
478 if (PL_op->op_private & HINT_STRICT_REFS)
479 DIE(aTHX_ PL_no_symref, sym, "an ARRAY");
480 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
487 if (PL_op->op_private & OPpLVAL_INTRO)
489 if (PL_op->op_flags & OPf_REF) {
496 if (GIMME == G_ARRAY) {
497 I32 maxarg = AvFILL(av) + 1;
498 (void)POPs; /* XXXX May be optimized away? */
500 if (SvRMAGICAL(av)) {
502 for (i=0; i < maxarg; i++) {
503 SV **svp = av_fetch(av, i, FALSE);
504 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
508 Copy(AvARRAY(av), SP+1, maxarg, SV*);
514 I32 maxarg = AvFILL(av) + 1;
527 tryAMAGICunDEREF(to_hv);
530 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
531 DIE(aTHX_ "Not a HASH reference");
532 if (PL_op->op_flags & OPf_REF) {
538 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
540 if (PL_op->op_flags & OPf_REF) {
548 if (SvTYPE(sv) != SVt_PVGV) {
552 if (SvGMAGICAL(sv)) {
558 if (PL_op->op_flags & OPf_REF ||
559 PL_op->op_private & HINT_STRICT_REFS)
560 DIE(aTHX_ PL_no_usym, "a HASH");
561 if (ckWARN(WARN_UNINITIALIZED))
563 if (GIMME == G_ARRAY) {
570 if ((PL_op->op_flags & OPf_SPECIAL) &&
571 !(PL_op->op_flags & OPf_MOD))
573 gv = (GV*)gv_fetchpv(sym, FALSE, SVt_PVHV);
578 if (PL_op->op_private & HINT_STRICT_REFS)
579 DIE(aTHX_ PL_no_symref, sym, "a HASH");
580 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
587 if (PL_op->op_private & OPpLVAL_INTRO)
589 if (PL_op->op_flags & OPf_REF) {
596 if (GIMME == G_ARRAY) { /* array wanted */
597 *PL_stack_sp = (SV*)hv;
602 if (SvTYPE(hv) == SVt_PVAV)
603 hv = avhv_keys((AV*)hv);
605 Perl_sv_setpvf(aTHX_ TARG, "%"IVdf"/%"IVdf,
606 (IV)HvFILL(hv), (IV)HvMAX(hv) + 1);
618 SV **lastlelem = PL_stack_sp;
619 SV **lastrelem = PL_stack_base + POPMARK;
620 SV **firstrelem = PL_stack_base + POPMARK + 1;
621 SV **firstlelem = lastrelem + 1;
634 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
636 /* If there's a common identifier on both sides we have to take
637 * special care that assigning the identifier on the left doesn't
638 * clobber a value on the right that's used later in the list.
640 if (PL_op->op_private & OPpASSIGN_COMMON) {
641 EXTEND_MORTAL(lastrelem - firstrelem + 1);
642 for (relem = firstrelem; relem <= lastrelem; relem++) {
645 TAINT_NOT; /* Each item is independent */
646 *relem = sv_mortalcopy(sv);
655 while (lelem <= lastlelem) {
656 TAINT_NOT; /* Each item stands on its own, taintwise. */
658 switch (SvTYPE(sv)) {
661 magic = SvMAGICAL(ary) != 0;
664 av_extend(ary, lastrelem - relem);
666 while (relem <= lastrelem) { /* gobble up all the rest */
672 didstore = av_store(ary,i++,sv);
686 magic = SvMAGICAL(hash) != 0;
689 while (relem < lastrelem) { /* gobble up all the rest */
694 sv = &PL_sv_no, relem++;
695 tmpstr = NEWSV(29,0);
697 sv_setsv(tmpstr,*relem); /* value */
699 didstore = hv_store_ent(hash,sv,tmpstr,0);
701 if (SvSMAGICAL(tmpstr))
708 if (relem == lastrelem) {
711 if (ckWARN(WARN_UNSAFE)) {
712 if (relem == firstrelem &&
714 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
715 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
716 Perl_warner(aTHX_ WARN_UNSAFE, "Reference found where even-sized list expected");
718 Perl_warner(aTHX_ WARN_UNSAFE, "Odd number of elements in hash assignment");
720 tmpstr = NEWSV(29,0);
721 didstore = hv_store_ent(hash,*relem,tmpstr,0);
723 if (SvSMAGICAL(tmpstr))
735 if (SvIMMORTAL(sv)) {
736 if (relem <= lastrelem)
740 if (relem <= lastrelem) {
741 sv_setsv(sv, *relem);
745 sv_setsv(sv, &PL_sv_undef);
750 if (PL_delaymagic & ~DM_DELAY) {
751 if (PL_delaymagic & DM_UID) {
753 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
756 (void)setreuid(PL_uid,PL_euid);
759 if ((PL_delaymagic & DM_UID) == DM_RUID) {
760 (void)setruid(PL_uid);
761 PL_delaymagic &= ~DM_RUID;
763 # endif /* HAS_SETRUID */
765 if ((PL_delaymagic & DM_UID) == DM_EUID) {
766 (void)seteuid(PL_uid);
767 PL_delaymagic &= ~DM_EUID;
769 # endif /* HAS_SETEUID */
770 if (PL_delaymagic & DM_UID) {
771 if (PL_uid != PL_euid)
772 DIE(aTHX_ "No setreuid available");
773 (void)PerlProc_setuid(PL_uid);
775 # endif /* HAS_SETREUID */
776 #endif /* HAS_SETRESUID */
777 PL_uid = PerlProc_getuid();
778 PL_euid = PerlProc_geteuid();
780 if (PL_delaymagic & DM_GID) {
782 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
785 (void)setregid(PL_gid,PL_egid);
788 if ((PL_delaymagic & DM_GID) == DM_RGID) {
789 (void)setrgid(PL_gid);
790 PL_delaymagic &= ~DM_RGID;
792 # endif /* HAS_SETRGID */
794 if ((PL_delaymagic & DM_GID) == DM_EGID) {
795 (void)setegid(PL_gid);
796 PL_delaymagic &= ~DM_EGID;
798 # endif /* HAS_SETEGID */
799 if (PL_delaymagic & DM_GID) {
800 if (PL_gid != PL_egid)
801 DIE(aTHX_ "No setregid available");
802 (void)PerlProc_setgid(PL_gid);
804 # endif /* HAS_SETREGID */
805 #endif /* HAS_SETRESGID */
806 PL_gid = PerlProc_getgid();
807 PL_egid = PerlProc_getegid();
809 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
816 else if (gimme == G_SCALAR) {
819 SETi(lastrelem - firstrelem + 1);
825 SP = firstrelem + (lastlelem - firstlelem);
826 lelem = firstlelem + (relem - firstrelem);
828 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
836 register PMOP *pm = cPMOP;
837 SV *rv = sv_newmortal();
838 SV *sv = newSVrv(rv, "Regexp");
839 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
846 register PMOP *pm = cPMOP;
851 I32 r_flags = REXEC_CHECKED;
852 char *truebase; /* Start of string */
853 register REGEXP *rx = pm->op_pmregexp;
858 I32 oldsave = PL_savestack_ix;
859 I32 update_minmatch = 1;
862 if (PL_op->op_flags & OPf_STACKED)
868 PUTBACK; /* EVAL blocks need stack_sp. */
872 DIE(aTHX_ "panic: do_match");
873 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
874 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
877 if (pm->op_pmdynflags & PMdf_USED) {
879 if (gimme == G_ARRAY)
884 if (!rx->prelen && PL_curpm) {
886 rx = pm->op_pmregexp;
888 if (rx->minlen > len) goto failure;
892 /* XXXX What part of this is needed with true \G-support? */
893 if (global = pm->op_pmflags & PMf_GLOBAL) {
895 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
896 MAGIC* mg = mg_find(TARG, 'g');
897 if (mg && mg->mg_len >= 0) {
898 if (!(rx->reganch & ROPT_GPOS_SEEN))
899 rx->endp[0] = rx->startp[0] = mg->mg_len;
900 else if (rx->reganch & ROPT_ANCH_GPOS) {
901 r_flags |= REXEC_IGNOREPOS;
902 rx->endp[0] = rx->startp[0] = mg->mg_len;
904 minmatch = (mg->mg_flags & MGf_MINMATCH);
909 if ((gimme != G_ARRAY && !global && rx->nparens)
910 || SvTEMP(TARG) || PL_sawampersand)
911 r_flags |= REXEC_COPY_STR;
913 r_flags |= REXEC_SCREAM;
915 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
916 SAVEINT(PL_multiline);
917 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
921 if (global && rx->startp[0] != -1) {
922 t = s = rx->endp[0] + truebase;
923 if ((s + rx->minlen) > strend)
925 if (update_minmatch++)
926 minmatch = had_zerolen;
928 if (rx->reganch & RE_USE_INTUIT) {
929 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
933 if ( (rx->reganch & ROPT_CHECK_ALL)
935 && ((rx->reganch & ROPT_NOSCAN)
936 || !((rx->reganch & RE_INTUIT_TAIL)
937 && (r_flags & REXEC_SCREAM))))
940 if (CALLREGEXEC(aTHX_ rx, s, strend, truebase, minmatch, TARG, NULL, r_flags))
943 if (pm->op_pmflags & PMf_ONCE)
944 pm->op_pmdynflags |= PMdf_USED;
953 RX_MATCH_TAINTED_on(rx);
954 TAINT_IF(RX_MATCH_TAINTED(rx));
955 if (gimme == G_ARRAY) {
959 if (global && !iters)
963 SPAGAIN; /* EVAL blocks could move the stack. */
964 EXTEND(SP, iters + i);
965 EXTEND_MORTAL(iters + i);
966 for (i = !i; i <= iters; i++) {
967 PUSHs(sv_newmortal());
969 if ((rx->startp[i] != -1) && rx->endp[i] != -1 ) {
970 len = rx->endp[i] - rx->startp[i];
971 s = rx->startp[i] + truebase;
972 sv_setpvn(*SP, s, len);
976 had_zerolen = (rx->startp[0] != -1
977 && rx->startp[0] == rx->endp[0]);
978 PUTBACK; /* EVAL blocks may use stack */
979 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
984 LEAVE_SCOPE(oldsave);
990 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
991 mg = mg_find(TARG, 'g');
993 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
994 mg = mg_find(TARG, 'g');
996 if (rx->startp[0] != -1) {
997 mg->mg_len = rx->endp[0];
998 if (rx->startp[0] == rx->endp[0])
999 mg->mg_flags |= MGf_MINMATCH;
1001 mg->mg_flags &= ~MGf_MINMATCH;
1004 LEAVE_SCOPE(oldsave);
1008 yup: /* Confirmed by INTUIT */
1010 RX_MATCH_TAINTED_on(rx);
1011 TAINT_IF(RX_MATCH_TAINTED(rx));
1013 if (pm->op_pmflags & PMf_ONCE)
1014 pm->op_pmdynflags |= PMdf_USED;
1015 if (RX_MATCH_COPIED(rx))
1016 Safefree(rx->subbeg);
1017 RX_MATCH_COPIED_off(rx);
1018 rx->subbeg = Nullch;
1020 rx->subbeg = truebase;
1021 rx->startp[0] = s - truebase;
1022 rx->endp[0] = s - truebase + rx->minlen;
1023 rx->sublen = strend - truebase;
1026 if (PL_sawampersand) {
1029 rx->subbeg = savepvn(t, strend - t);
1030 rx->sublen = strend - t;
1031 RX_MATCH_COPIED_on(rx);
1032 off = rx->startp[0] = s - t;
1033 rx->endp[0] = off + rx->minlen;
1035 else { /* startp/endp are used by @- @+. */
1036 rx->startp[0] = s - truebase;
1037 rx->endp[0] = s - truebase + rx->minlen;
1039 LEAVE_SCOPE(oldsave);
1044 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1045 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1046 MAGIC* mg = mg_find(TARG, 'g');
1051 LEAVE_SCOPE(oldsave);
1052 if (gimme == G_ARRAY)
1058 Perl_do_readline(pTHX)
1060 dSP; dTARGETSTACKED;
1065 register IO *io = GvIO(PL_last_in_gv);
1066 register I32 type = PL_op->op_type;
1067 I32 gimme = GIMME_V;
1070 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1072 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1075 call_method("READLINE", gimme);
1078 if (gimme == G_SCALAR)
1079 SvSetMagicSV_nosteal(TARG, TOPs);
1086 if (IoFLAGS(io) & IOf_ARGV) {
1087 if (IoFLAGS(io) & IOf_START) {
1089 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1090 IoFLAGS(io) &= ~IOf_START;
1091 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1092 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1093 SvSETMAGIC(GvSV(PL_last_in_gv));
1098 fp = nextargv(PL_last_in_gv);
1099 if (!fp) { /* Note: fp != IoIFP(io) */
1100 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1103 else if (type == OP_GLOB) {
1104 SV *tmpcmd = NEWSV(55, 0);
1108 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1109 /* since spawning off a process is a real performance hit */
1111 #include <descrip.h>
1112 #include <lib$routines.h>
1115 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1116 char vmsspec[NAM$C_MAXRSS+1];
1117 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1118 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1119 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1122 struct dsc$descriptor_s wilddsc
1123 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1124 struct dsc$descriptor_vs rsdsc
1125 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1126 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1128 /* We could find out if there's an explicit dev/dir or version
1129 by peeking into lib$find_file's internal context at
1130 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1131 but that's unsupported, so I don't want to do it now and
1132 have it bite someone in the future. */
1133 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1134 cp = SvPV(tmpglob,i);
1136 if (cp[i] == ';') hasver = 1;
1138 if (sts) hasver = 1;
1142 hasdir = isunix = 1;
1145 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1150 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1152 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1153 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1154 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1155 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1156 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1157 &dfltdsc,NULL,NULL,NULL))&1)) {
1158 end = rstr + (unsigned long int) *rslt;
1159 if (!hasver) while (*end != ';') end--;
1160 *(end++) = '\n'; *end = '\0';
1161 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1163 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1168 while (*(--begin) != ']' && *begin != '>') ;
1171 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1173 if (cxt) (void)lib$find_file_end(&cxt);
1174 if (ok && sts != RMS$_NMF &&
1175 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1178 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1180 PerlIO_close(tmpfp);
1184 PerlIO_rewind(tmpfp);
1186 IoIFP(io) = fp = tmpfp;
1187 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1192 #ifdef MACOS_TRADITIONAL
1193 sv_setpv(tmpcmd, "glob ");
1194 sv_catsv(tmpcmd, tmpglob);
1195 sv_catpv(tmpcmd, " |");
1199 sv_setpv(tmpcmd, "for a in ");
1200 sv_catsv(tmpcmd, tmpglob);
1201 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1204 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1205 sv_catsv(tmpcmd, tmpglob);
1207 sv_setpv(tmpcmd, "perlglob ");
1208 sv_catsv(tmpcmd, tmpglob);
1209 sv_catpv(tmpcmd, " |");
1214 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1215 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1216 sv_catsv(tmpcmd, tmpglob);
1217 sv_catpv(tmpcmd, "' 2>/dev/null |");
1219 sv_setpv(tmpcmd, "echo ");
1220 sv_catsv(tmpcmd, tmpglob);
1222 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1224 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1227 #endif /* !DOSISH */
1228 #endif /* MACOS_TRADITIONAL */
1229 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1230 FALSE, O_RDONLY, 0, Nullfp);
1236 else if (type == OP_GLOB)
1238 else if (ckWARN(WARN_IO) /* stdout/stderr or other write fh */
1239 && (IoTYPE(io) == '>' || fp == PerlIO_stdout()
1240 || fp == PerlIO_stderr()))
1242 SV* sv = sv_newmortal();
1243 gv_efullname3(sv, PL_last_in_gv, Nullch);
1244 Perl_warner(aTHX_ WARN_IO, "Filehandle %s opened only for output",
1249 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START)) {
1250 if (type == OP_GLOB)
1251 Perl_warner(aTHX_ WARN_CLOSED,
1252 "glob failed (can't start child: %s)",
1255 SV* sv = sv_newmortal();
1256 gv_efullname3(sv, PL_last_in_gv, Nullch);
1257 Perl_warner(aTHX_ WARN_CLOSED,
1258 "Read on closed filehandle %s",
1262 if (gimme == G_SCALAR) {
1263 (void)SvOK_off(TARG);
1269 if (gimme == G_SCALAR) {
1273 (void)SvUPGRADE(sv, SVt_PV);
1274 tmplen = SvLEN(sv); /* remember if already alloced */
1276 Sv_Grow(sv, 80); /* try short-buffering it */
1277 if (type == OP_RCATLINE)
1283 sv = sv_2mortal(NEWSV(57, 80));
1287 /* flip-flop EOF state for a snarfed empty file */
1288 #define SNARF_EOF(gimme,rs,io,sv) \
1289 ((gimme != G_SCALAR || SvCUR(sv) \
1290 || (IoFLAGS(io) & IOf_NOLINE) || IoLINES(io) || !RsSNARF(rs)) \
1291 ? ((IoFLAGS(io) &= ~IOf_NOLINE), TRUE) \
1292 : ((IoFLAGS(io) |= IOf_NOLINE), FALSE))
1295 if (!sv_gets(sv, fp, offset)
1296 && (type == OP_GLOB || SNARF_EOF(gimme, PL_rs, io, sv)))
1298 PerlIO_clearerr(fp);
1299 if (IoFLAGS(io) & IOf_ARGV) {
1300 fp = nextargv(PL_last_in_gv);
1303 (void)do_close(PL_last_in_gv, FALSE);
1305 else if (type == OP_GLOB) {
1306 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1307 Perl_warner(aTHX_ WARN_CLOSED,
1308 "glob failed (child exited with status %d%s)",
1309 STATUS_CURRENT >> 8,
1310 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1313 if (gimme == G_SCALAR) {
1314 (void)SvOK_off(TARG);
1319 /* This should not be marked tainted if the fp is marked clean */
1320 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1327 if (type == OP_GLOB) {
1330 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1331 tmps = SvEND(sv) - 1;
1332 if (*tmps == *SvPVX(PL_rs)) {
1337 for (tmps = SvPVX(sv); *tmps; tmps++)
1338 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1339 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1341 if (*tmps && PerlLIO_lstat(SvPVX(sv), &PL_statbuf) < 0) {
1342 (void)POPs; /* Unmatched wildcard? Chuck it... */
1346 if (gimme == G_ARRAY) {
1347 if (SvLEN(sv) - SvCUR(sv) > 20) {
1348 SvLEN_set(sv, SvCUR(sv)+1);
1349 Renew(SvPVX(sv), SvLEN(sv), char);
1351 sv = sv_2mortal(NEWSV(58, 80));
1354 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1355 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1359 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1360 Renew(SvPVX(sv), SvLEN(sv), char);
1369 register PERL_CONTEXT *cx;
1370 I32 gimme = OP_GIMME(PL_op, -1);
1373 if (cxstack_ix >= 0)
1374 gimme = cxstack[cxstack_ix].blk_gimme;
1382 PUSHBLOCK(cx, CXt_BLOCK, SP);
1394 U32 lval = PL_op->op_flags & OPf_MOD;
1395 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1398 if (SvTYPE(hv) == SVt_PVHV) {
1399 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1400 svp = he ? &HeVAL(he) : 0;
1402 else if (SvTYPE(hv) == SVt_PVAV) {
1403 if (PL_op->op_private & OPpLVAL_INTRO)
1404 DIE(aTHX_ "Can't localize pseudo-hash element");
1405 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1411 if (!svp || *svp == &PL_sv_undef) {
1416 DIE(aTHX_ PL_no_helem, SvPV(keysv, n_a));
1418 lv = sv_newmortal();
1419 sv_upgrade(lv, SVt_PVLV);
1421 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1422 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1423 LvTARG(lv) = SvREFCNT_inc(hv);
1428 if (PL_op->op_private & OPpLVAL_INTRO) {
1429 if (HvNAME(hv) && isGV(*svp))
1430 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1432 save_helem(hv, keysv, svp);
1434 else if (PL_op->op_private & OPpDEREF)
1435 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1437 sv = (svp ? *svp : &PL_sv_undef);
1438 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1439 * Pushing the magical RHS on to the stack is useless, since
1440 * that magic is soon destined to be misled by the local(),
1441 * and thus the later pp_sassign() will fail to mg_get() the
1442 * old value. This should also cure problems with delayed
1443 * mg_get()s. GSAR 98-07-03 */
1444 if (!lval && SvGMAGICAL(sv))
1445 sv = sv_mortalcopy(sv);
1453 register PERL_CONTEXT *cx;
1459 if (PL_op->op_flags & OPf_SPECIAL) {
1460 cx = &cxstack[cxstack_ix];
1461 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1466 gimme = OP_GIMME(PL_op, -1);
1468 if (cxstack_ix >= 0)
1469 gimme = cxstack[cxstack_ix].blk_gimme;
1475 if (gimme == G_VOID)
1477 else if (gimme == G_SCALAR) {
1480 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1483 *MARK = sv_mortalcopy(TOPs);
1486 *MARK = &PL_sv_undef;
1490 else if (gimme == G_ARRAY) {
1491 /* in case LEAVE wipes old return values */
1492 for (mark = newsp + 1; mark <= SP; mark++) {
1493 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1494 *mark = sv_mortalcopy(*mark);
1495 TAINT_NOT; /* Each item is independent */
1499 PL_curpm = newpm; /* Don't pop $1 et al till now */
1509 register PERL_CONTEXT *cx;
1515 cx = &cxstack[cxstack_ix];
1516 if (CxTYPE(cx) != CXt_LOOP)
1517 DIE(aTHX_ "panic: pp_iter");
1519 itersvp = CxITERVAR(cx);
1520 av = cx->blk_loop.iterary;
1521 if (SvTYPE(av) != SVt_PVAV) {
1522 /* iterate ($min .. $max) */
1523 if (cx->blk_loop.iterlval) {
1524 /* string increment */
1525 register SV* cur = cx->blk_loop.iterlval;
1527 char *max = SvPV((SV*)av, maxlen);
1528 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1529 #ifndef USE_THREADS /* don't risk potential race */
1530 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1531 /* safe to reuse old SV */
1532 sv_setsv(*itersvp, cur);
1537 /* we need a fresh SV every time so that loop body sees a
1538 * completely new SV for closures/references to work as
1540 SvREFCNT_dec(*itersvp);
1541 *itersvp = newSVsv(cur);
1543 if (strEQ(SvPVX(cur), max))
1544 sv_setiv(cur, 0); /* terminate next time */
1551 /* integer increment */
1552 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1555 #ifndef USE_THREADS /* don't risk potential race */
1556 if (SvREFCNT(*itersvp) == 1 && !SvMAGICAL(*itersvp)) {
1557 /* safe to reuse old SV */
1558 sv_setiv(*itersvp, cx->blk_loop.iterix++);
1563 /* we need a fresh SV every time so that loop body sees a
1564 * completely new SV for closures/references to work as they
1566 SvREFCNT_dec(*itersvp);
1567 *itersvp = newSViv(cx->blk_loop.iterix++);
1573 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1576 SvREFCNT_dec(*itersvp);
1578 if (sv = (SvMAGICAL(av))
1579 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1580 : AvARRAY(av)[++cx->blk_loop.iterix])
1584 if (av != PL_curstack && SvIMMORTAL(sv)) {
1585 SV *lv = cx->blk_loop.iterlval;
1586 if (lv && SvREFCNT(lv) > 1) {
1591 SvREFCNT_dec(LvTARG(lv));
1593 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1594 sv_upgrade(lv, SVt_PVLV);
1596 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1598 LvTARG(lv) = SvREFCNT_inc(av);
1599 LvTARGOFF(lv) = cx->blk_loop.iterix;
1600 LvTARGLEN(lv) = (STRLEN)UV_MAX;
1604 *itersvp = SvREFCNT_inc(sv);
1611 register PMOP *pm = cPMOP;
1627 register REGEXP *rx = pm->op_pmregexp;
1629 int force_on_match = 0;
1630 I32 oldsave = PL_savestack_ix;
1631 I32 update_minmatch = 1;
1633 /* known replacement string? */
1634 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1635 if (PL_op->op_flags & OPf_STACKED)
1641 if (SvREADONLY(TARG)
1642 || (SvTYPE(TARG) > SVt_PVLV
1643 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1644 DIE(aTHX_ PL_no_modify);
1647 s = SvPV(TARG, len);
1648 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1650 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1651 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1658 DIE(aTHX_ "panic: do_subst");
1661 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1662 position, once with zero-length,
1663 second time with non-zero. */
1665 if (!rx->prelen && PL_curpm) {
1667 rx = pm->op_pmregexp;
1669 r_flags = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1670 ? REXEC_COPY_STR : 0;
1672 r_flags |= REXEC_SCREAM;
1673 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1674 SAVEINT(PL_multiline);
1675 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1678 if (rx->reganch & RE_USE_INTUIT) {
1679 s = CALLREG_INTUIT_START(aTHX_ rx, TARG, s, strend, r_flags, NULL);
1683 /* How to do it in subst? */
1684 /* if ( (rx->reganch & ROPT_CHECK_ALL)
1686 && ((rx->reganch & ROPT_NOSCAN)
1687 || !((rx->reganch & RE_INTUIT_TAIL)
1688 && (r_flags & REXEC_SCREAM))))
1693 /* only replace once? */
1694 once = !(rpm->op_pmflags & PMf_GLOBAL);
1696 /* known replacement string? */
1697 c = dstr ? SvPV(dstr, clen) : Nullch;
1699 /* can do inplace substitution? */
1700 if (c && clen <= rx->minlen && (once || !(r_flags & REXEC_COPY_STR))
1701 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1702 if (!CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1703 r_flags | REXEC_CHECKED))
1707 LEAVE_SCOPE(oldsave);
1710 if (force_on_match) {
1712 s = SvPV_force(TARG, len);
1717 SvSCREAM_off(TARG); /* disable possible screamer */
1719 rxtainted |= RX_MATCH_TAINTED(rx);
1720 m = orig + rx->startp[0];
1721 d = orig + rx->endp[0];
1723 if (m - s > strend - d) { /* faster to shorten from end */
1725 Copy(c, m, clen, char);
1730 Move(d, m, i, char);
1734 SvCUR_set(TARG, m - s);
1737 else if (i = m - s) { /* faster from front */
1745 Copy(c, m, clen, char);
1750 Copy(c, d, clen, char);
1755 TAINT_IF(rxtainted & 1);
1761 if (iters++ > maxiters)
1762 DIE(aTHX_ "Substitution loop");
1763 rxtainted |= RX_MATCH_TAINTED(rx);
1764 m = rx->startp[0] + orig;
1768 Move(s, d, i, char);
1772 Copy(c, d, clen, char);
1775 s = rx->endp[0] + orig;
1776 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m,
1778 /* don't match same null twice */
1779 REXEC_NOT_FIRST|REXEC_IGNOREPOS));
1782 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1783 Move(s, d, i+1, char); /* include the NUL */
1785 TAINT_IF(rxtainted & 1);
1787 PUSHs(sv_2mortal(newSViv((I32)iters)));
1789 (void)SvPOK_only(TARG);
1790 TAINT_IF(rxtainted);
1791 if (SvSMAGICAL(TARG)) {
1797 LEAVE_SCOPE(oldsave);
1801 if (CALLREGEXEC(aTHX_ rx, s, strend, orig, 0, TARG, NULL,
1802 r_flags | REXEC_CHECKED))
1804 if (force_on_match) {
1806 s = SvPV_force(TARG, len);
1809 rxtainted |= RX_MATCH_TAINTED(rx);
1810 dstr = NEWSV(25, len);
1811 sv_setpvn(dstr, m, s-m);
1814 register PERL_CONTEXT *cx;
1817 RETURNOP(cPMOP->op_pmreplroot);
1819 r_flags |= REXEC_IGNOREPOS | REXEC_NOT_FIRST;
1821 if (iters++ > maxiters)
1822 DIE(aTHX_ "Substitution loop");
1823 rxtainted |= RX_MATCH_TAINTED(rx);
1824 if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1829 strend = s + (strend - m);
1831 m = rx->startp[0] + orig;
1832 sv_catpvn(dstr, s, m-s);
1833 s = rx->endp[0] + orig;
1835 sv_catpvn(dstr, c, clen);
1838 } while (CALLREGEXEC(aTHX_ rx, s, strend, orig, s == m, TARG, NULL, r_flags));
1839 sv_catpvn(dstr, s, strend - s);
1841 (void)SvOOK_off(TARG);
1842 Safefree(SvPVX(TARG));
1843 SvPVX(TARG) = SvPVX(dstr);
1844 SvCUR_set(TARG, SvCUR(dstr));
1845 SvLEN_set(TARG, SvLEN(dstr));
1849 TAINT_IF(rxtainted & 1);
1851 PUSHs(sv_2mortal(newSViv((I32)iters)));
1853 (void)SvPOK_only(TARG);
1854 TAINT_IF(rxtainted);
1857 LEAVE_SCOPE(oldsave);
1866 LEAVE_SCOPE(oldsave);
1875 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1876 ++*PL_markstack_ptr;
1877 LEAVE; /* exit inner scope */
1880 if (PL_stack_base + *PL_markstack_ptr > SP) {
1882 I32 gimme = GIMME_V;
1884 LEAVE; /* exit outer scope */
1885 (void)POPMARK; /* pop src */
1886 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1887 (void)POPMARK; /* pop dst */
1888 SP = PL_stack_base + POPMARK; /* pop original mark */
1889 if (gimme == G_SCALAR) {
1893 else if (gimme == G_ARRAY)
1900 ENTER; /* enter inner scope */
1903 src = PL_stack_base[*PL_markstack_ptr];
1907 RETURNOP(cLOGOP->op_other);
1918 register PERL_CONTEXT *cx;
1924 if (gimme == G_SCALAR) {
1927 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1929 *MARK = SvREFCNT_inc(TOPs);
1935 *MARK = sv_mortalcopy(TOPs);
1939 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1943 *MARK = &PL_sv_undef;
1947 else if (gimme == G_ARRAY) {
1948 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1949 if (!SvTEMP(*MARK)) {
1950 *MARK = sv_mortalcopy(*MARK);
1951 TAINT_NOT; /* Each item is independent */
1957 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
1958 PL_curpm = newpm; /* ... and pop $1 et al */
1962 return pop_return();
1965 /* This duplicates the above code because the above code must not
1966 * get any slower by more conditions */
1974 register PERL_CONTEXT *cx;
1981 if (cx->blk_sub.lval & OPpENTERSUB_INARGS) {
1982 /* We are an argument to a function or grep().
1983 * This kind of lvalueness was legal before lvalue
1984 * subroutines too, so be backward compatible:
1985 * cannot report errors. */
1987 /* Scalar context *is* possible, on the LHS of -> only,
1988 * as in f()->meth(). But this is not an lvalue. */
1989 if (gimme == G_SCALAR)
1991 if (gimme == G_ARRAY) {
1992 if (!CvLVALUE(cx->blk_sub.cv))
1993 goto temporise_array;
1994 EXTEND_MORTAL(SP - newsp);
1995 for (mark = newsp + 1; mark <= SP; mark++) {
1998 else if (SvFLAGS(*mark) & (SVs_PADTMP | SVf_READONLY))
1999 *mark = sv_mortalcopy(*mark);
2001 /* Can be a localized value subject to deletion. */
2002 PL_tmps_stack[++PL_tmps_ix] = *mark;
2003 (void)SvREFCNT_inc(*mark);
2008 else if (cx->blk_sub.lval) { /* Leave it as it is if we can. */
2009 /* Here we go for robustness, not for speed, so we change all
2010 * the refcounts so the caller gets a live guy. Cannot set
2011 * TEMP, so sv_2mortal is out of question. */
2012 if (!CvLVALUE(cx->blk_sub.cv)) {
2017 DIE(aTHX_ "Can't modify non-lvalue subroutine call");
2019 if (gimme == G_SCALAR) {
2023 if (SvFLAGS(TOPs) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2028 DIE(aTHX_ "Can't return a %s from lvalue subroutine",
2029 SvREADONLY(TOPs) ? "readonly value" : "temporary");
2031 else { /* Can be a localized value
2032 * subject to deletion. */
2033 PL_tmps_stack[++PL_tmps_ix] = *mark;
2034 (void)SvREFCNT_inc(*mark);
2037 else { /* Should not happen? */
2042 DIE(aTHX_ "%s returned from lvalue subroutine in scalar context",
2043 (MARK > SP ? "Empty array" : "Array"));
2047 else if (gimme == G_ARRAY) {
2048 EXTEND_MORTAL(SP - newsp);
2049 for (mark = newsp + 1; mark <= SP; mark++) {
2050 if (SvFLAGS(*mark) & (SVs_TEMP | SVs_PADTMP | SVf_READONLY)) {
2051 /* Might be flattened array after $#array = */
2057 DIE(aTHX_ "Can't return %s from lvalue subroutine",
2058 (*mark != &PL_sv_undef)
2060 ? "a readonly value" : "a temporary")
2061 : "an uninitialized value");
2065 /* Can be a localized value subject to deletion. */
2066 PL_tmps_stack[++PL_tmps_ix] = *mark;
2067 (void)SvREFCNT_inc(*mark);
2073 if (gimme == G_SCALAR) {
2077 if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
2079 *MARK = SvREFCNT_inc(TOPs);
2085 *MARK = sv_mortalcopy(TOPs);
2089 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
2093 *MARK = &PL_sv_undef;
2097 else if (gimme == G_ARRAY) {
2099 for (MARK = newsp + 1; MARK <= SP; MARK++) {
2100 if (!SvTEMP(*MARK)) {
2101 *MARK = sv_mortalcopy(*MARK);
2102 TAINT_NOT; /* Each item is independent */
2109 POPSUB(cx,sv); /* Stack values are safe: release CV and @_ ... */
2110 PL_curpm = newpm; /* ... and pop $1 et al */
2114 return pop_return();
2119 S_get_db_sub(pTHX_ SV **svp, CV *cv)
2122 SV *dbsv = GvSV(PL_DBsub);
2124 if (!PERLDB_SUB_NN) {
2128 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
2129 || strEQ(GvNAME(gv), "END")
2130 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
2131 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
2132 && (gv = (GV*)*svp) ))) {
2133 /* Use GV from the stack as a fallback. */
2134 /* GV is potentially non-unique, or contain different CV. */
2135 sv_setsv(dbsv, newRV((SV*)cv));
2138 gv_efullname3(dbsv, gv, Nullch);
2142 SvUPGRADE(dbsv, SVt_PVIV);
2144 SAVEIV(SvIVX(dbsv));
2145 SvIVX(dbsv) = PTR2IV(cv); /* Do it the quickest way */
2149 PL_curcopdb = PL_curcop;
2150 cv = GvCV(PL_DBsub);
2160 register PERL_CONTEXT *cx;
2162 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
2165 DIE(aTHX_ "Not a CODE reference");
2166 switch (SvTYPE(sv)) {
2172 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2174 SP = PL_stack_base + POPMARK;
2177 if (SvGMAGICAL(sv)) {
2179 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2182 sym = SvPV(sv, n_a);
2184 DIE(aTHX_ PL_no_usym, "a subroutine");
2185 if (PL_op->op_private & HINT_STRICT_REFS)
2186 DIE(aTHX_ PL_no_symref, sym, "a subroutine");
2187 cv = get_cv(sym, TRUE);
2191 SV **sp = &sv; /* Used in tryAMAGICunDEREF macro. */
2192 tryAMAGICunDEREF(to_cv);
2195 if (SvTYPE(cv) == SVt_PVCV)
2200 DIE(aTHX_ "Not a CODE reference");
2205 if (!(cv = GvCVu((GV*)sv)))
2206 cv = sv_2cv(sv, &stash, &gv, FALSE);
2219 if (!CvROOT(cv) && !CvXSUB(cv)) {
2223 /* anonymous or undef'd function leaves us no recourse */
2224 if (CvANON(cv) || !(gv = CvGV(cv)))
2225 DIE(aTHX_ "Undefined subroutine called");
2227 /* autoloaded stub? */
2228 if (cv != GvCV(gv)) {
2231 /* should call AUTOLOAD now? */
2234 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2241 sub_name = sv_newmortal();
2242 gv_efullname3(sub_name, gv, Nullch);
2243 DIE(aTHX_ "Undefined subroutine &%s called", SvPVX(sub_name));
2247 DIE(aTHX_ "Not a CODE reference");
2252 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv)) {
2253 cv = get_db_sub(&sv, cv);
2255 DIE(aTHX_ "No DBsub routine");
2260 * First we need to check if the sub or method requires locking.
2261 * If so, we gain a lock on the CV, the first argument or the
2262 * stash (for static methods), as appropriate. This has to be
2263 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2264 * reschedule by returning a new op.
2266 MUTEX_LOCK(CvMUTEXP(cv));
2267 if (CvFLAGS(cv) & CVf_LOCKED) {
2269 if (CvFLAGS(cv) & CVf_METHOD) {
2270 if (SP > PL_stack_base + TOPMARK)
2271 sv = *(PL_stack_base + TOPMARK + 1);
2273 AV *av = (AV*)PL_curpad[0];
2274 if (hasargs || !av || AvFILLp(av) < 0
2275 || !(sv = AvARRAY(av)[0]))
2277 MUTEX_UNLOCK(CvMUTEXP(cv));
2278 DIE(aTHX_ "no argument for locked method call");
2285 char *stashname = SvPV(sv, len);
2286 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2292 MUTEX_UNLOCK(CvMUTEXP(cv));
2293 mg = condpair_magic(sv);
2294 MUTEX_LOCK(MgMUTEXP(mg));
2295 if (MgOWNER(mg) == thr)
2296 MUTEX_UNLOCK(MgMUTEXP(mg));
2299 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2301 DEBUG_S(PerlIO_printf(Perl_debug_log, "%p: pp_entersub lock %p\n",
2303 MUTEX_UNLOCK(MgMUTEXP(mg));
2304 SAVEDESTRUCTOR_X(Perl_unlock_condpair, sv);
2306 MUTEX_LOCK(CvMUTEXP(cv));
2309 * Now we have permission to enter the sub, we must distinguish
2310 * four cases. (0) It's an XSUB (in which case we don't care
2311 * about ownership); (1) it's ours already (and we're recursing);
2312 * (2) it's free (but we may already be using a cached clone);
2313 * (3) another thread owns it. Case (1) is easy: we just use it.
2314 * Case (2) means we look for a clone--if we have one, use it
2315 * otherwise grab ownership of cv. Case (3) means we look for a
2316 * clone (for non-XSUBs) and have to create one if we don't
2318 * Why look for a clone in case (2) when we could just grab
2319 * ownership of cv straight away? Well, we could be recursing,
2320 * i.e. we originally tried to enter cv while another thread
2321 * owned it (hence we used a clone) but it has been freed up
2322 * and we're now recursing into it. It may or may not be "better"
2323 * to use the clone but at least CvDEPTH can be trusted.
2325 if (CvOWNER(cv) == thr || CvXSUB(cv))
2326 MUTEX_UNLOCK(CvMUTEXP(cv));
2328 /* Case (2) or (3) */
2332 * XXX Might it be better to release CvMUTEXP(cv) while we
2333 * do the hv_fetch? We might find someone has pinched it
2334 * when we look again, in which case we would be in case
2335 * (3) instead of (2) so we'd have to clone. Would the fact
2336 * that we released the mutex more quickly make up for this?
2338 if ((svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2340 /* We already have a clone to use */
2341 MUTEX_UNLOCK(CvMUTEXP(cv));
2343 DEBUG_S(PerlIO_printf(Perl_debug_log,
2344 "entersub: %p already has clone %p:%s\n",
2345 thr, cv, SvPEEK((SV*)cv)));
2348 if (CvDEPTH(cv) == 0)
2349 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2352 /* (2) => grab ownership of cv. (3) => make clone */
2356 MUTEX_UNLOCK(CvMUTEXP(cv));
2357 DEBUG_S(PerlIO_printf(Perl_debug_log,
2358 "entersub: %p grabbing %p:%s in stash %s\n",
2359 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2360 HvNAME(CvSTASH(cv)) : "(none)"));
2363 /* Make a new clone. */
2365 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2366 MUTEX_UNLOCK(CvMUTEXP(cv));
2367 DEBUG_S((PerlIO_printf(Perl_debug_log,
2368 "entersub: %p cloning %p:%s\n",
2369 thr, cv, SvPEEK((SV*)cv))));
2371 * We're creating a new clone so there's no race
2372 * between the original MUTEX_UNLOCK and the
2373 * SvREFCNT_inc since no one will be trying to undef
2374 * it out from underneath us. At least, I don't think
2377 clonecv = cv_clone(cv);
2378 SvREFCNT_dec(cv); /* finished with this */
2379 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2380 CvOWNER(clonecv) = thr;
2384 DEBUG_S(if (CvDEPTH(cv) != 0)
2385 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2387 SAVEDESTRUCTOR_X(unset_cvowner, (void*) cv);
2390 #endif /* USE_THREADS */
2393 #ifdef PERL_XSUB_OLDSTYLE
2394 if (CvOLDSTYLE(cv)) {
2395 I32 (*fp3)(int,int,int);
2397 register I32 items = SP - MARK;
2398 /* We dont worry to copy from @_. */
2403 PL_stack_sp = mark + 1;
2404 fp3 = (I32(*)(int,int,int))CvXSUB(cv);
2405 items = (*fp3)(CvXSUBANY(cv).any_i32,
2406 MARK - PL_stack_base + 1,
2408 PL_stack_sp = PL_stack_base + items;
2411 #endif /* PERL_XSUB_OLDSTYLE */
2413 I32 markix = TOPMARK;
2418 /* Need to copy @_ to stack. Alternative may be to
2419 * switch stack to @_, and copy return values
2420 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2424 av = (AV*)PL_curpad[0];
2426 av = GvAV(PL_defgv);
2427 #endif /* USE_THREADS */
2428 items = AvFILLp(av) + 1; /* @_ is not tieable */
2431 /* Mark is at the end of the stack. */
2433 Copy(AvARRAY(av), SP + 1, items, SV*);
2438 /* We assume first XSUB in &DB::sub is the called one. */
2440 SAVEVPTR(PL_curcop);
2441 PL_curcop = PL_curcopdb;
2444 /* Do we need to open block here? XXXX */
2445 (void)(*CvXSUB(cv))(aTHXo_ cv);
2447 /* Enforce some sanity in scalar context. */
2448 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2449 if (markix > PL_stack_sp - PL_stack_base)
2450 *(PL_stack_base + markix) = &PL_sv_undef;
2452 *(PL_stack_base + markix) = *PL_stack_sp;
2453 PL_stack_sp = PL_stack_base + markix;
2461 register I32 items = SP - MARK;
2462 AV* padlist = CvPADLIST(cv);
2463 SV** svp = AvARRAY(padlist);
2464 push_return(PL_op->op_next);
2465 PUSHBLOCK(cx, CXt_SUB, MARK);
2468 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2469 * that eval'' ops within this sub know the correct lexical space.
2470 * Owing the speed considerations, we choose to search for the cv
2471 * in doeval() instead.
2473 if (CvDEPTH(cv) < 2)
2474 (void)SvREFCNT_inc(cv);
2475 else { /* save temporaries on recursion? */
2476 PERL_STACK_OVERFLOW_CHECK();
2477 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2479 AV *newpad = newAV();
2480 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2481 I32 ix = AvFILLp((AV*)svp[1]);
2482 I32 names_fill = AvFILLp((AV*)svp[0]);
2483 svp = AvARRAY(svp[0]);
2484 for ( ;ix > 0; ix--) {
2485 if (names_fill >= ix && svp[ix] != &PL_sv_undef) {
2486 char *name = SvPVX(svp[ix]);
2487 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2488 || *name == '&') /* anonymous code? */
2490 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2492 else { /* our own lexical */
2494 av_store(newpad, ix, sv = (SV*)newAV());
2495 else if (*name == '%')
2496 av_store(newpad, ix, sv = (SV*)newHV());
2498 av_store(newpad, ix, sv = NEWSV(0,0));
2502 else if (IS_PADGV(oldpad[ix]) || IS_PADCONST(oldpad[ix])) {
2503 av_store(newpad, ix, sv = SvREFCNT_inc(oldpad[ix]));
2506 av_store(newpad, ix, sv = NEWSV(0,0));
2510 av = newAV(); /* will be @_ */
2512 av_store(newpad, 0, (SV*)av);
2513 AvFLAGS(av) = AVf_REIFY;
2514 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2515 AvFILLp(padlist) = CvDEPTH(cv);
2516 svp = AvARRAY(padlist);
2521 AV* av = (AV*)PL_curpad[0];
2523 items = AvFILLp(av) + 1;
2525 /* Mark is at the end of the stack. */
2527 Copy(AvARRAY(av), SP + 1, items, SV*);
2532 #endif /* USE_THREADS */
2533 SAVEVPTR(PL_curpad);
2534 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2537 #endif /* USE_THREADS */
2543 DEBUG_S(PerlIO_printf(Perl_debug_log,
2544 "%p entersub preparing @_\n", thr));
2546 av = (AV*)PL_curpad[0];
2548 /* @_ is normally not REAL--this should only ever
2549 * happen when DB::sub() calls things that modify @_ */
2555 cx->blk_sub.savearray = GvAV(PL_defgv);
2556 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2557 #endif /* USE_THREADS */
2558 cx->blk_sub.argarray = av;
2561 if (items > AvMAX(av) + 1) {
2563 if (AvARRAY(av) != ary) {
2564 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2565 SvPVX(av) = (char*)ary;
2567 if (items > AvMAX(av) + 1) {
2568 AvMAX(av) = items - 1;
2569 Renew(ary,items,SV*);
2571 SvPVX(av) = (char*)ary;
2574 Copy(MARK,AvARRAY(av),items,SV*);
2575 AvFILLp(av) = items - 1;
2583 /* warning must come *after* we fully set up the context
2584 * stuff so that __WARN__ handlers can safely dounwind()
2587 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2588 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2589 sub_crush_depth(cv);
2591 DEBUG_S(PerlIO_printf(Perl_debug_log,
2592 "%p entersub returning %p\n", thr, CvSTART(cv)));
2594 RETURNOP(CvSTART(cv));
2599 Perl_sub_crush_depth(pTHX_ CV *cv)
2602 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on anonymous subroutine");
2604 SV* tmpstr = sv_newmortal();
2605 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2606 Perl_warner(aTHX_ WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2617 U32 lval = PL_op->op_flags & OPf_MOD;
2618 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2622 elem -= PL_curcop->cop_arybase;
2623 if (SvTYPE(av) != SVt_PVAV)
2625 svp = av_fetch(av, elem, lval && !defer);
2627 if (!svp || *svp == &PL_sv_undef) {
2630 DIE(aTHX_ PL_no_aelem, elem);
2631 lv = sv_newmortal();
2632 sv_upgrade(lv, SVt_PVLV);
2634 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2635 LvTARG(lv) = SvREFCNT_inc(av);
2636 LvTARGOFF(lv) = elem;
2641 if (PL_op->op_private & OPpLVAL_INTRO)
2642 save_aelem(av, elem, svp);
2643 else if (PL_op->op_private & OPpDEREF)
2644 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2646 sv = (svp ? *svp : &PL_sv_undef);
2647 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2648 sv = sv_mortalcopy(sv);
2654 Perl_vivify_ref(pTHX_ SV *sv, U32 to_what)
2660 Perl_croak(aTHX_ PL_no_modify);
2661 if (SvTYPE(sv) < SVt_RV)
2662 sv_upgrade(sv, SVt_RV);
2663 else if (SvTYPE(sv) >= SVt_PV) {
2664 (void)SvOOK_off(sv);
2665 Safefree(SvPVX(sv));
2666 SvLEN(sv) = SvCUR(sv) = 0;
2670 SvRV(sv) = NEWSV(355,0);
2673 SvRV(sv) = (SV*)newAV();
2676 SvRV(sv) = (SV*)newHV();
2691 if (SvTYPE(rsv) == SVt_PVCV) {
2697 SETs(method_common(sv, Null(U32*)));
2704 SV* sv = cSVOP->op_sv;
2705 U32 hash = SvUVX(sv);
2707 XPUSHs(method_common(sv, &hash));
2712 S_method_common(pTHX_ SV* meth, U32* hashp)
2724 name = SvPV(meth, namelen);
2725 sv = *(PL_stack_base + TOPMARK + 1);
2736 !(packname = SvPV(sv, packlen)) ||
2737 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2738 !(ob=(SV*)GvIO(iogv)))
2741 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2742 ? !isIDFIRST_utf8((U8*)packname)
2743 : !isIDFIRST(*packname)
2746 Perl_croak(aTHX_ "Can't call method \"%s\" %s", name,
2747 SvOK(sv) ? "without a package or object reference"
2748 : "on an undefined value");
2750 stash = gv_stashpvn(packname, packlen, TRUE);
2753 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2756 if (!ob || !SvOBJECT(ob))
2757 Perl_croak(aTHX_ "Can't call method \"%s\" on unblessed reference",
2760 stash = SvSTASH(ob);
2763 /* shortcut for simple names */
2765 HE* he = hv_fetch_ent(stash, meth, 0, *hashp);
2767 gv = (GV*)HeVAL(he);
2768 if (isGV(gv) && GvCV(gv) &&
2769 (!GvCVGEN(gv) || GvCVGEN(gv) == PL_sub_generation))
2770 return (SV*)GvCV(gv);
2774 gv = gv_fetchmethod(stash, name);
2780 for (p = name; *p; p++) {
2782 sep = p, leaf = p + 1;
2783 else if (*p == ':' && *(p + 1) == ':')
2784 sep = p, leaf = p + 2;
2786 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2787 packname = sep ? CopSTASHPV(PL_curcop) : HvNAME(stash);
2788 packlen = strlen(packname);
2792 packlen = sep - name;
2795 "Can't locate object method \"%s\" via package \"%s\"",
2798 return isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv;
2803 unset_cvowner(pTHXo_ void *cvarg)
2805 register CV* cv = (CV *) cvarg;
2808 #endif /* DEBUGGING */
2810 DEBUG_S((PerlIO_printf(Perl_debug_log, "%p unsetting CvOWNER of %p:%s\n",
2811 thr, cv, SvPEEK((SV*)cv))));
2812 MUTEX_LOCK(CvMUTEXP(cv));
2813 DEBUG_S(if (CvDEPTH(cv) != 0)
2814 PerlIO_printf(Perl_debug_log, "depth %ld != 0\n",
2816 assert(thr == CvOWNER(cv));
2818 MUTEX_UNLOCK(CvMUTEXP(cv));
2821 #endif /* USE_THREADS */