3 * Copyright (c) 1991-1997, 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!
29 unset_cvowner(void *cvarg)
31 register CV* cv = (CV *) cvarg;
34 #endif /* DEBUGGING */
36 DEBUG_L((PerlIO_printf(PerlIO_stderr(), "%p unsetting CvOWNER of %p:%s\n",
37 thr, cv, SvPEEK((SV*)cv))));
38 MUTEX_LOCK(CvMUTEXP(cv));
39 DEBUG_L(if (CvDEPTH(cv) != 0)
40 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
42 assert(thr == CvOWNER(cv));
44 MUTEX_UNLOCK(CvMUTEXP(cv));
47 #endif /* USE_THREADS */
59 TAINT_NOT; /* Each statement is presumed innocent */
60 stack_sp = stack_base + cxstack[cxstack_ix].blk_oldsp;
69 if (op->op_private & OPpLVAL_INTRO)
70 PUSHs(save_scalar(cGVOP->op_gv));
72 PUSHs(GvSV(cGVOP->op_gv));
93 sv_setpvn(TARG,s,len);
101 XPUSHs((SV*)cGVOP->op_gv);
112 RETURNOP(cLOGOP->op_other);
121 if (op->op_private & OPpASSIGN_BACKWARDS) {
123 temp = left; left = right; right = temp;
125 if (tainting && tainted && !SvTAINTED(left))
127 SvSetMagicSV(right, left);
136 RETURNOP(cCONDOP->op_true);
138 RETURNOP(cCONDOP->op_false);
144 TAINT_NOT; /* Each statement is presumed innocent */
145 stack_sp = stack_base + cxstack[cxstack_ix].blk_oldsp;
147 oldsave = scopestack[scopestack_ix - 1];
148 LEAVE_SCOPE(oldsave);
154 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
161 sv_setpvn(TARG,s,len);
163 else if (SvGMAGICAL(TARG))
165 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
166 sv_setpv(TARG, ""); /* Suppress warning. */
167 s = SvPV_force(TARG, len);
171 sv_catpvn(TARG,s,len);
173 sv_setpvn(TARG,s,len); /* suppress warning */
183 if (op->op_flags & OPf_MOD) {
184 if (op->op_private & OPpLVAL_INTRO)
185 SAVECLEARSV(curpad[op->op_targ]);
186 else if (op->op_private & OPpDEREF) {
188 vivify_ref(curpad[op->op_targ], op->op_private & OPpDEREF);
197 last_in_gv = (GV*)(*stack_sp--);
198 return do_readline();
203 djSP; tryAMAGICbinSET(eq,0);
206 SETs(boolSV(TOPn == value));
214 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
216 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
217 SvIVX(TOPs) != IV_MAX)
220 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
235 RETURNOP(cLOGOP->op_other);
241 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
244 SETn( left + right );
252 AV *av = GvAV((GV*)cSVOP->op_sv);
253 U32 lval = op->op_flags & OPf_MOD;
254 SV** svp = av_fetch(av, op->op_private, lval);
255 SV *sv = (svp ? *svp : &sv_undef);
257 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
258 sv = sv_mortalcopy(sv);
265 djSP; dMARK; dTARGET;
267 do_join(TARG, *MARK, MARK, SP);
278 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
279 * will be enough to hold an OP*.
281 SV* sv = sv_newmortal();
282 sv_upgrade(sv, SVt_PVLV);
284 Copy(&op, &LvTARGOFF(sv), 1, OP*);
292 /* Oversized hot code. */
296 djSP; dMARK; dORIGMARK;
302 if (op->op_flags & OPf_STACKED)
306 if (SvRMAGICAL(gv) && (mg = mg_find((SV*)gv, 'q'))) {
307 if (MARK == ORIGMARK) {
308 /* If using default handle then we need to make space to
309 * pass object as 1st arg, so move other args up ...
313 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
320 perl_call_method("PRINT", G_SCALAR);
328 if (!(io = GvIO(gv))) {
330 SV* sv = sv_newmortal();
331 gv_fullname3(sv, gv, Nullch);
332 warn("Filehandle %s never opened", SvPV(sv,na));
335 SETERRNO(EBADF,RMS$_IFI);
338 else if (!(fp = IoOFP(io))) {
340 SV* sv = sv_newmortal();
341 gv_fullname3(sv, gv, Nullch);
343 warn("Filehandle %s opened only for input", SvPV(sv,na));
345 warn("print on closed filehandle %s", SvPV(sv,na));
347 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
354 if (!do_print(*MARK, fp))
358 if (PerlIO_write(fp, ofs, ofslen) == 0 || PerlIO_error(fp)) {
367 if (!do_print(*MARK, fp))
376 if (PerlIO_write(fp, ors, orslen) == 0 || PerlIO_error(fp))
379 if (IoFLAGS(io) & IOf_FLUSH)
380 if (PerlIO_flush(fp) == EOF)
402 if (SvTYPE(av) != SVt_PVAV)
403 DIE("Not an ARRAY reference");
404 if (op->op_flags & OPf_REF) {
410 if (SvTYPE(sv) == SVt_PVAV) {
412 if (op->op_flags & OPf_REF) {
420 if (SvTYPE(sv) != SVt_PVGV) {
423 if (SvGMAGICAL(sv)) {
429 if (op->op_flags & OPf_REF ||
430 op->op_private & HINT_STRICT_REFS)
431 DIE(no_usym, "an ARRAY");
434 if (GIMME == G_ARRAY)
439 if (op->op_private & HINT_STRICT_REFS)
440 DIE(no_symref, sym, "an ARRAY");
441 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
446 if (op->op_private & OPpLVAL_INTRO)
448 if (op->op_flags & OPf_REF) {
455 if (GIMME == G_ARRAY) {
456 I32 maxarg = AvFILL(av) + 1;
458 if (SvRMAGICAL(av)) {
460 for (i=0; i < maxarg; i++) {
461 SV **svp = av_fetch(av, i, FALSE);
462 SP[i+1] = (svp) ? *svp : &sv_undef;
466 Copy(AvARRAY(av), SP+1, maxarg, SV*);
472 I32 maxarg = AvFILL(av) + 1;
486 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
487 DIE("Not a HASH reference");
488 if (op->op_flags & OPf_REF) {
494 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
496 if (op->op_flags & OPf_REF) {
504 if (SvTYPE(sv) != SVt_PVGV) {
507 if (SvGMAGICAL(sv)) {
513 if (op->op_flags & OPf_REF ||
514 op->op_private & HINT_STRICT_REFS)
515 DIE(no_usym, "a HASH");
518 if (GIMME == G_ARRAY) {
525 if (op->op_private & HINT_STRICT_REFS)
526 DIE(no_symref, sym, "a HASH");
527 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
532 if (op->op_private & OPpLVAL_INTRO)
534 if (op->op_flags & OPf_REF) {
541 if (GIMME == G_ARRAY) { /* array wanted */
547 /* This bit is OK even when hv is really an AV */
549 sv_setpvf(TARG, "%ld/%ld",
550 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
562 SV **lastlelem = stack_sp;
563 SV **lastrelem = stack_base + POPMARK;
564 SV **firstrelem = stack_base + POPMARK + 1;
565 SV **firstlelem = lastrelem + 1;
578 delaymagic = DM_DELAY; /* catch simultaneous items */
580 /* If there's a common identifier on both sides we have to take
581 * special care that assigning the identifier on the left doesn't
582 * clobber a value on the right that's used later in the list.
584 if (op->op_private & OPpASSIGN_COMMON) {
585 for (relem = firstrelem; relem <= lastrelem; relem++) {
588 TAINT_NOT; /* Each item is independent */
589 *relem = sv_mortalcopy(sv);
598 while (lelem <= lastlelem) {
599 TAINT_NOT; /* Each item stands on its own, taintwise. */
601 switch (SvTYPE(sv)) {
604 magic = SvMAGICAL(ary) != 0;
607 av_extend(ary, lastrelem - relem);
609 while (relem <= lastrelem) { /* gobble up all the rest */
615 didstore = av_store(ary,i++,sv);
629 magic = SvMAGICAL(hash) != 0;
632 while (relem < lastrelem) { /* gobble up all the rest */
637 sv = &sv_no, relem++;
638 tmpstr = NEWSV(29,0);
640 sv_setsv(tmpstr,*relem); /* value */
642 didstore = hv_store_ent(hash,sv,tmpstr,0);
644 if (SvSMAGICAL(tmpstr))
647 SvREFCNT_dec(tmpstr);
651 if (relem == lastrelem) {
655 if (relem == firstrelem &&
657 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
658 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
659 warn("Reference found where even-sized list expected");
661 warn("Odd number of elements in hash assignment");
663 tmpstr = NEWSV(29,0);
664 didstore = hv_store_ent(hash,*relem,tmpstr,0);
666 if (SvSMAGICAL(tmpstr))
669 SvREFCNT_dec(tmpstr);
678 if (SvTHINKFIRST(sv)) {
679 if (SvREADONLY(sv) && curcop != &compiling) {
682 if (relem <= lastrelem)
689 if (relem <= lastrelem) {
690 sv_setsv(sv, *relem);
694 sv_setsv(sv, &sv_undef);
699 if (delaymagic & ~DM_DELAY) {
700 if (delaymagic & DM_UID) {
702 (void)setresuid(uid,euid,(Uid_t)-1);
705 (void)setreuid(uid,euid);
708 if ((delaymagic & DM_UID) == DM_RUID) {
710 delaymagic &= ~DM_RUID;
712 # endif /* HAS_SETRUID */
714 if ((delaymagic & DM_UID) == DM_EUID) {
716 delaymagic &= ~DM_EUID;
718 # endif /* HAS_SETEUID */
719 if (delaymagic & DM_UID) {
721 DIE("No setreuid available");
722 (void)PerlProc_setuid(uid);
724 # endif /* HAS_SETREUID */
725 #endif /* HAS_SETRESUID */
726 uid = (int)PerlProc_getuid();
727 euid = (int)PerlProc_geteuid();
729 if (delaymagic & DM_GID) {
731 (void)setresgid(gid,egid,(Gid_t)-1);
734 (void)setregid(gid,egid);
737 if ((delaymagic & DM_GID) == DM_RGID) {
739 delaymagic &= ~DM_RGID;
741 # endif /* HAS_SETRGID */
743 if ((delaymagic & DM_GID) == DM_EGID) {
745 delaymagic &= ~DM_EGID;
747 # endif /* HAS_SETEGID */
748 if (delaymagic & DM_GID) {
750 DIE("No setregid available");
751 (void)PerlProc_setgid(gid);
753 # endif /* HAS_SETREGID */
754 #endif /* HAS_SETRESGID */
755 gid = (int)PerlProc_getgid();
756 egid = (int)PerlProc_getegid();
758 tainting |= (uid && (euid != uid || egid != gid));
765 else if (gimme == G_SCALAR) {
768 SETi(lastrelem - firstrelem + 1);
774 SP = firstrelem + (lastlelem - firstlelem);
775 lelem = firstlelem + (relem - firstrelem);
777 *relem++ = (lelem <= lastlelem) ? *lelem++ : &sv_undef;
785 register PMOP *pm = cPMOP;
792 register REGEXP *rx = pm->op_pmregexp;
797 I32 oldsave = savestack_ix;
798 I32 update_minmatch = 1;
801 if (op->op_flags & OPf_STACKED)
807 PUTBACK; /* EVAL blocks need stack_sp. */
811 DIE("panic: do_match");
812 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
813 (tainted && (pm->op_pmflags & PMf_RETAINT)));
816 if (pm->op_pmdynflags & PMdf_USED) {
818 if (gimme == G_ARRAY)
823 if (!rx->prelen && curpm) {
825 rx = pm->op_pmregexp;
827 if (rx->minlen > len) goto failure;
829 screamer = ( (SvSCREAM(TARG) && rx->check_substr
830 && SvTYPE(rx->check_substr) == SVt_PVBM
831 && SvVALID(rx->check_substr))
834 if (global = pm->op_pmflags & PMf_GLOBAL) {
836 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
837 MAGIC* mg = mg_find(TARG, 'g');
838 if (mg && mg->mg_len >= 0) {
839 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
840 minmatch = (mg->mg_flags & MGf_MINMATCH);
845 if (!rx->nparens && !global)
846 gimme = G_SCALAR; /* accidental array context? */
847 safebase = (((gimme == G_ARRAY) || global || !rx->nparens)
849 safebase = safebase ? 0 : REXEC_COPY_STR ;
850 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
852 multiline = pm->op_pmflags & PMf_MULTILINE;
856 if (global && rx->startp[0]) {
858 if ((s + rx->minlen) > strend)
860 if (update_minmatch++)
861 minmatch = (s == rx->startp[0]);
863 if (rx->check_substr) {
864 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
868 if (screamfirst[BmRARE(rx->check_substr)] < 0)
870 else if (!(s = screaminstr(TARG, rx->check_substr,
871 rx->check_offset_min, 0, &p, 0)))
873 else if ((rx->reganch & ROPT_CHECK_ALL)
874 && !sawampersand && !SvTAIL(rx->check_substr))
877 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
878 (unsigned char*)strend,
879 rx->check_substr, 0)))
881 else if ((rx->reganch & ROPT_CHECK_ALL) && !sawampersand)
883 if (s && rx->check_offset_max < t - s) {
884 ++BmUSEFUL(rx->check_substr);
885 s -= rx->check_offset_max;
890 /* Now checkstring is fixed, i.e. at fixed offset from the
891 beginning of match, and the match is anchored at s. */
892 else if (!multiline) { /* Anchored near beginning of string. */
894 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
895 || ((slen = SvCUR(rx->check_substr)) > 1
896 && memNE(SvPVX(rx->check_substr),
897 s + rx->check_offset_min, slen)))
900 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
901 && rx->check_substr == rx->float_substr) {
902 SvREFCNT_dec(rx->check_substr);
903 rx->check_substr = Nullsv; /* opt is being useless */
904 rx->float_substr = Nullsv;
907 if (regexec_flags(rx, s, strend, truebase, minmatch,
908 screamer, NULL, safebase))
911 if (pm->op_pmflags & PMf_ONCE)
912 pm->op_pmdynflags |= PMdf_USED;
921 RX_MATCH_TAINTED_on(rx);
922 TAINT_IF(RX_MATCH_TAINTED(rx));
923 if (gimme == G_ARRAY) {
927 if (global && !iters)
931 SPAGAIN; /* EVAL blocks could move the stack. */
932 EXTEND(SP, iters + i);
933 EXTEND_MORTAL(iters + i);
934 for (i = !i; i <= iters; i++) {
935 PUSHs(sv_newmortal());
937 if ((s = rx->startp[i]) && rx->endp[i] ) {
938 len = rx->endp[i] - s;
939 sv_setpvn(*SP, s, len);
943 truebase = rx->subbeg;
945 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
947 PUTBACK; /* EVAL blocks may use stack */
950 LEAVE_SCOPE(oldsave);
956 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
957 mg = mg_find(TARG, 'g');
959 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
960 mg = mg_find(TARG, 'g');
963 mg->mg_len = rx->endp[0] - rx->subbeg;
964 if (rx->startp[0] == rx->endp[0])
965 mg->mg_flags |= MGf_MINMATCH;
967 mg->mg_flags &= ~MGf_MINMATCH;
970 LEAVE_SCOPE(oldsave);
974 yup: /* Confirmed by check_substr */
976 RX_MATCH_TAINTED_on(rx);
977 TAINT_IF(RX_MATCH_TAINTED(rx));
978 ++BmUSEFUL(rx->check_substr);
980 if (pm->op_pmflags & PMf_ONCE)
981 pm->op_pmdynflags |= PMdf_USED;
982 Safefree(rx->subbase);
983 rx->subbase = Nullch;
985 rx->subbeg = truebase;
988 rx->endp[0] = s + SvCUR(rx->check_substr);
994 tmps = rx->subbase = savepvn(t, strend-t);
996 rx->subend = tmps + (strend-t);
997 tmps = rx->startp[0] = tmps + (s - t);
998 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1000 LEAVE_SCOPE(oldsave);
1004 if (rx->check_substr)
1005 ++BmUSEFUL(rx->check_substr);
1008 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1009 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1010 MAGIC* mg = mg_find(TARG, 'g');
1015 LEAVE_SCOPE(oldsave);
1016 if (gimme == G_ARRAY)
1024 dSP; dTARGETSTACKED;
1029 register IO *io = GvIO(last_in_gv);
1030 register I32 type = op->op_type;
1031 I32 gimme = GIMME_V;
1034 if (SvRMAGICAL(last_in_gv) && (mg = mg_find((SV*)last_in_gv, 'q'))) {
1039 perl_call_method("READLINE", gimme);
1042 if (gimme == G_SCALAR)
1043 SvSetMagicSV_nosteal(TARG, TOPs);
1050 if (IoFLAGS(io) & IOf_ARGV) {
1051 if (IoFLAGS(io) & IOf_START) {
1052 IoFLAGS(io) &= ~IOf_START;
1054 if (av_len(GvAVn(last_in_gv)) < 0) {
1055 do_open(last_in_gv,"-",1,FALSE,0,0,Nullfp);
1056 sv_setpvn(GvSV(last_in_gv), "-", 1);
1057 SvSETMAGIC(GvSV(last_in_gv));
1062 fp = nextargv(last_in_gv);
1063 if (!fp) { /* Note: fp != IoIFP(io) */
1064 (void)do_close(last_in_gv, FALSE); /* now it does*/
1065 IoFLAGS(io) |= IOf_START;
1068 else if (type == OP_GLOB) {
1069 SV *tmpcmd = NEWSV(55, 0);
1073 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1074 /* since spawning off a process is a real performance hit */
1076 #include <descrip.h>
1077 #include <lib$routines.h>
1080 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1081 char vmsspec[NAM$C_MAXRSS+1];
1082 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1083 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1084 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1087 struct dsc$descriptor_s wilddsc
1088 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1089 struct dsc$descriptor_vs rsdsc
1090 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1091 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1093 /* We could find out if there's an explicit dev/dir or version
1094 by peeking into lib$find_file's internal context at
1095 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1096 but that's unsupported, so I don't want to do it now and
1097 have it bite someone in the future. */
1098 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1099 cp = SvPV(tmpglob,i);
1101 if (cp[i] == ';') hasver = 1;
1103 if (sts) hasver = 1;
1107 hasdir = isunix = 1;
1110 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1115 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1117 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1118 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1119 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1120 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1121 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1122 &dfltdsc,NULL,NULL,NULL))&1)) {
1123 end = rstr + (unsigned long int) *rslt;
1124 if (!hasver) while (*end != ';') end--;
1125 *(end++) = '\n'; *end = '\0';
1126 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1128 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1133 while (*(--begin) != ']' && *begin != '>') ;
1136 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1138 if (cxt) (void)lib$find_file_end(&cxt);
1139 if (ok && sts != RMS$_NMF &&
1140 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1143 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1145 PerlIO_close(tmpfp);
1149 PerlIO_rewind(tmpfp);
1151 IoIFP(io) = fp = tmpfp;
1152 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1159 sv_setpv(tmpcmd, "for a in ");
1160 sv_catsv(tmpcmd, tmpglob);
1161 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1164 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1165 sv_catsv(tmpcmd, tmpglob);
1167 sv_setpv(tmpcmd, "perlglob ");
1168 sv_catsv(tmpcmd, tmpglob);
1169 sv_catpv(tmpcmd, " |");
1174 sv_setpvn(tmpcmd, cshname, cshlen);
1175 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1176 sv_catsv(tmpcmd, tmpglob);
1177 sv_catpv(tmpcmd, "' 2>/dev/null |");
1179 sv_setpv(tmpcmd, "echo ");
1180 sv_catsv(tmpcmd, tmpglob);
1182 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1184 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1187 #endif /* !DOSISH */
1188 (void)do_open(last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1189 FALSE, 0, 0, Nullfp);
1195 else if (type == OP_GLOB)
1199 if (dowarn && io && !(IoFLAGS(io) & IOf_START))
1200 warn("Read on closed filehandle <%s>", GvENAME(last_in_gv));
1201 if (gimme == G_SCALAR) {
1202 (void)SvOK_off(TARG);
1208 if (gimme == G_SCALAR) {
1212 (void)SvUPGRADE(sv, SVt_PV);
1213 tmplen = SvLEN(sv); /* remember if already alloced */
1215 Sv_Grow(sv, 80); /* try short-buffering it */
1216 if (type == OP_RCATLINE)
1222 sv = sv_2mortal(NEWSV(57, 80));
1226 if (!sv_gets(sv, fp, offset)) {
1227 PerlIO_clearerr(fp);
1228 if (IoFLAGS(io) & IOf_ARGV) {
1229 fp = nextargv(last_in_gv);
1232 (void)do_close(last_in_gv, FALSE);
1233 IoFLAGS(io) |= IOf_START;
1235 else if (type == OP_GLOB) {
1236 if (do_close(last_in_gv, FALSE) & ~0xFF)
1237 warn("internal error: glob failed");
1239 if (gimme == G_SCALAR) {
1240 (void)SvOK_off(TARG);
1245 /* This should not be marked tainted if the fp is marked clean */
1246 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1253 if (type == OP_GLOB) {
1256 if (SvCUR(sv) > 0 && SvCUR(rs) > 0) {
1257 tmps = SvEND(sv) - 1;
1258 if (*tmps == *SvPVX(rs)) {
1263 for (tmps = SvPVX(sv); *tmps; tmps++)
1264 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1265 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1267 if (*tmps && PerlLIO_stat(SvPVX(sv), &statbuf) < 0) {
1268 (void)POPs; /* Unmatched wildcard? Chuck it... */
1272 if (gimme == G_ARRAY) {
1273 if (SvLEN(sv) - SvCUR(sv) > 20) {
1274 SvLEN_set(sv, SvCUR(sv)+1);
1275 Renew(SvPVX(sv), SvLEN(sv), char);
1277 sv = sv_2mortal(NEWSV(58, 80));
1280 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1281 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1285 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1286 Renew(SvPVX(sv), SvLEN(sv), char);
1295 register PERL_CONTEXT *cx;
1296 I32 gimme = OP_GIMME(op, -1);
1299 if (cxstack_ix >= 0)
1300 gimme = cxstack[cxstack_ix].blk_gimme;
1308 PUSHBLOCK(cx, CXt_BLOCK, SP);
1320 U32 lval = op->op_flags & OPf_MOD;
1321 U32 defer = op->op_private & OPpLVAL_DEFER;
1324 if (SvTYPE(hv) == SVt_PVHV) {
1325 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1326 svp = he ? &HeVAL(he) : 0;
1328 else if (SvTYPE(hv) == SVt_PVAV) {
1329 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1335 if (!svp || *svp == &sv_undef) {
1339 DIE(no_helem, SvPV(keysv, na));
1340 lv = sv_newmortal();
1341 sv_upgrade(lv, SVt_PVLV);
1343 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1344 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1345 LvTARG(lv) = SvREFCNT_inc(hv);
1350 if (op->op_private & OPpLVAL_INTRO) {
1351 if (HvNAME(hv) && isGV(*svp))
1352 save_gp((GV*)*svp, !(op->op_flags & OPf_SPECIAL));
1354 save_helem(hv, keysv, svp);
1356 else if (op->op_private & OPpDEREF)
1357 vivify_ref(*svp, op->op_private & OPpDEREF);
1359 sv = (svp ? *svp : &sv_undef);
1360 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1361 * Pushing the magical RHS on to the stack is useless, since
1362 * that magic is soon destined to be misled by the local(),
1363 * and thus the later pp_sassign() will fail to mg_get() the
1364 * old value. This should also cure problems with delayed
1365 * mg_get()s. GSAR 98-07-03 */
1366 if (!lval && SvGMAGICAL(sv))
1367 sv = sv_mortalcopy(sv);
1375 register PERL_CONTEXT *cx;
1381 if (op->op_flags & OPf_SPECIAL) {
1382 cx = &cxstack[cxstack_ix];
1383 cx->blk_oldpm = curpm; /* fake block should preserve $1 et al */
1388 gimme = OP_GIMME(op, -1);
1390 if (cxstack_ix >= 0)
1391 gimme = cxstack[cxstack_ix].blk_gimme;
1397 if (gimme == G_VOID)
1399 else if (gimme == G_SCALAR) {
1402 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1405 *MARK = sv_mortalcopy(TOPs);
1412 else if (gimme == G_ARRAY) {
1413 /* in case LEAVE wipes old return values */
1414 for (mark = newsp + 1; mark <= SP; mark++) {
1415 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1416 *mark = sv_mortalcopy(*mark);
1417 TAINT_NOT; /* Each item is independent */
1421 curpm = newpm; /* Don't pop $1 et al till now */
1431 register PERL_CONTEXT *cx;
1436 cx = &cxstack[cxstack_ix];
1437 if (cx->cx_type != CXt_LOOP)
1438 DIE("panic: pp_iter");
1440 av = cx->blk_loop.iterary;
1441 if (SvTYPE(av) != SVt_PVAV) {
1442 /* iterate ($min .. $max) */
1443 if (cx->blk_loop.iterlval) {
1444 /* string increment */
1445 register SV* cur = cx->blk_loop.iterlval;
1447 char *max = SvPV((SV*)av, maxlen);
1448 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1449 sv_setsv(*cx->blk_loop.itervar, cur);
1450 if (strEQ(SvPVX(cur), max))
1451 sv_setiv(cur, 0); /* terminate next time */
1458 /* integer increment */
1459 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1461 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1466 if (cx->blk_loop.iterix >= (av == curstack ? cx->blk_oldsp : AvFILL(av)))
1469 SvREFCNT_dec(*cx->blk_loop.itervar);
1471 if (sv = (SvMAGICAL(av))
1472 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1473 : AvARRAY(av)[++cx->blk_loop.iterix])
1477 if (av != curstack && SvIMMORTAL(sv)) {
1478 SV *lv = cx->blk_loop.iterlval;
1479 if (lv && SvREFCNT(lv) > 1) {
1484 SvREFCNT_dec(LvTARG(lv));
1486 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1487 sv_upgrade(lv, SVt_PVLV);
1489 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1491 LvTARG(lv) = SvREFCNT_inc(av);
1492 LvTARGOFF(lv) = cx->blk_loop.iterix;
1493 LvTARGLEN(lv) = (UV) -1;
1497 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1504 register PMOP *pm = cPMOP;
1520 register REGEXP *rx = pm->op_pmregexp;
1522 int force_on_match = 0;
1523 I32 oldsave = savestack_ix;
1524 I32 update_minmatch = 1;
1527 /* known replacement string? */
1528 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1529 if (op->op_flags & OPf_STACKED)
1535 if (SvREADONLY(TARG)
1536 || (SvTYPE(TARG) > SVt_PVLV
1537 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1541 s = SvPV(TARG, len);
1542 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1544 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1545 (tainted && (pm->op_pmflags & PMf_RETAINT)));
1552 DIE("panic: do_subst");
1555 maxiters = (strend - s) + 10;
1557 if (!rx->prelen && curpm) {
1559 rx = pm->op_pmregexp;
1561 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1562 && SvTYPE(rx->check_substr) == SVt_PVBM
1563 && SvVALID(rx->check_substr))
1565 safebase = (!rx->nparens && !sawampersand) ? 0 : REXEC_COPY_STR;
1566 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1568 multiline = pm->op_pmflags & PMf_MULTILINE;
1571 if (rx->check_substr) {
1572 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1576 if (screamfirst[BmRARE(rx->check_substr)] < 0)
1578 else if (!(s = screaminstr(TARG, rx->check_substr, rx->check_offset_min, 0, &p, 0)))
1581 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
1582 (unsigned char*)strend,
1583 rx->check_substr, 0)))
1585 if (s && rx->check_offset_max < s - m) {
1586 ++BmUSEFUL(rx->check_substr);
1587 s -= rx->check_offset_max;
1592 /* Now checkstring is fixed, i.e. at fixed offset from the
1593 beginning of match, and the match is anchored at s. */
1594 else if (!multiline) { /* Anchored at beginning of string. */
1596 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
1597 || ((slen = SvCUR(rx->check_substr)) > 1
1598 && memNE(SvPVX(rx->check_substr),
1599 s + rx->check_offset_min, slen)))
1602 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
1603 && rx->check_substr == rx->float_substr) {
1604 SvREFCNT_dec(rx->check_substr);
1605 rx->check_substr = Nullsv; /* opt is being useless */
1606 rx->float_substr = Nullsv;
1610 /* only replace once? */
1611 once = !(rpm->op_pmflags & PMf_GLOBAL);
1613 /* known replacement string? */
1614 c = dstr ? SvPV(dstr, clen) : Nullch;
1616 /* can do inplace substitution? */
1617 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1618 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1619 if (!regexec_flags(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1622 LEAVE_SCOPE(oldsave);
1625 if (force_on_match) {
1627 s = SvPV_force(TARG, len);
1632 SvSCREAM_off(TARG); /* disable possible screamer */
1634 rxtainted |= RX_MATCH_TAINTED(rx);
1636 m = orig + (rx->startp[0] - rx->subbase);
1637 d = orig + (rx->endp[0] - rx->subbase);
1643 if (m - s > strend - d) { /* faster to shorten from end */
1645 Copy(c, m, clen, char);
1650 Move(d, m, i, char);
1654 SvCUR_set(TARG, m - s);
1657 else if (i = m - s) { /* faster from front */
1665 Copy(c, m, clen, char);
1670 Copy(c, d, clen, char);
1675 TAINT_IF(rxtainted & 1);
1681 if (iters++ > maxiters)
1682 DIE("Substitution loop");
1683 rxtainted |= RX_MATCH_TAINTED(rx);
1688 Move(s, d, i, char);
1692 Copy(c, d, clen, char);
1696 } while (regexec_flags(rx, s, strend, orig, s == m,
1697 Nullsv, NULL, 0)); /* don't match same null twice */
1700 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1701 Move(s, d, i+1, char); /* include the NUL */
1703 TAINT_IF(rxtainted & 1);
1705 PUSHs(sv_2mortal(newSViv((I32)iters)));
1707 (void)SvPOK_only(TARG);
1708 TAINT_IF(rxtainted);
1709 if (SvSMAGICAL(TARG)) {
1715 LEAVE_SCOPE(oldsave);
1719 if (regexec_flags(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1720 if (force_on_match) {
1722 s = SvPV_force(TARG, len);
1725 rxtainted |= RX_MATCH_TAINTED(rx);
1726 dstr = NEWSV(25, len);
1727 sv_setpvn(dstr, m, s-m);
1730 register PERL_CONTEXT *cx;
1733 RETURNOP(cPMOP->op_pmreplroot);
1736 if (iters++ > maxiters)
1737 DIE("Substitution loop");
1738 rxtainted |= RX_MATCH_TAINTED(rx);
1739 if (rx->subbase && rx->subbase != orig) {
1744 strend = s + (strend - m);
1747 sv_catpvn(dstr, s, m-s);
1750 sv_catpvn(dstr, c, clen);
1753 } while (regexec_flags(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1754 sv_catpvn(dstr, s, strend - s);
1756 (void)SvOOK_off(TARG);
1757 Safefree(SvPVX(TARG));
1758 SvPVX(TARG) = SvPVX(dstr);
1759 SvCUR_set(TARG, SvCUR(dstr));
1760 SvLEN_set(TARG, SvLEN(dstr));
1764 TAINT_IF(rxtainted & 1);
1766 PUSHs(sv_2mortal(newSViv((I32)iters)));
1768 (void)SvPOK_only(TARG);
1769 TAINT_IF(rxtainted);
1772 LEAVE_SCOPE(oldsave);
1778 ++BmUSEFUL(rx->check_substr);
1783 LEAVE_SCOPE(oldsave);
1792 stack_base[markstack_ptr[-1]++] = stack_base[*markstack_ptr];
1794 LEAVE; /* exit inner scope */
1797 if (stack_base + *markstack_ptr > SP) {
1799 I32 gimme = GIMME_V;
1801 LEAVE; /* exit outer scope */
1802 (void)POPMARK; /* pop src */
1803 items = --*markstack_ptr - markstack_ptr[-1];
1804 (void)POPMARK; /* pop dst */
1805 SP = stack_base + POPMARK; /* pop original mark */
1806 if (gimme == G_SCALAR) {
1810 else if (gimme == G_ARRAY)
1817 ENTER; /* enter inner scope */
1820 src = stack_base[*markstack_ptr];
1824 RETURNOP(cLOGOP->op_other);
1835 register PERL_CONTEXT *cx;
1836 struct block_sub cxsub;
1839 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1842 if (gimme == G_SCALAR) {
1845 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1847 *MARK = SvREFCNT_inc(TOPs);
1852 *MARK = sv_mortalcopy(TOPs);
1855 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1862 else if (gimme == G_ARRAY) {
1863 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1864 if (!SvTEMP(*MARK)) {
1865 *MARK = sv_mortalcopy(*MARK);
1866 TAINT_NOT; /* Each item is independent */
1872 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1873 curpm = newpm; /* ... and pop $1 et al */
1876 return pop_return();
1880 get_db_sub(SV **svp, CV *cv)
1883 SV *dbsv = GvSV(DBsub);
1885 if (!PERLDB_SUB_NN) {
1889 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1890 || strEQ(GvNAME(gv), "END")
1891 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1892 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1893 && (gv = (GV*)*svp) ))) {
1894 /* Use GV from the stack as a fallback. */
1895 /* GV is potentially non-unique, or contain different CV. */
1896 sv_setsv(dbsv, newRV((SV*)cv));
1899 gv_efullname3(dbsv, gv, Nullch);
1903 SvUPGRADE(dbsv, SVt_PVIV);
1905 SAVEIV(SvIVX(dbsv));
1906 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1921 register PERL_CONTEXT *cx;
1923 bool hasargs = (op->op_flags & OPf_STACKED) != 0;
1926 DIE("Not a CODE reference");
1927 switch (SvTYPE(sv)) {
1932 if (sv == &sv_yes) { /* unfound import, ignore */
1934 SP = stack_base + POPMARK;
1937 if (SvGMAGICAL(sv)) {
1939 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
1944 DIE(no_usym, "a subroutine");
1945 if (op->op_private & HINT_STRICT_REFS)
1946 DIE(no_symref, sym, "a subroutine");
1947 cv = perl_get_cv(sym, TRUE);
1951 if (SvTYPE(cv) == SVt_PVCV)
1956 DIE("Not a CODE reference");
1961 if (!(cv = GvCVu((GV*)sv)))
1962 cv = sv_2cv(sv, &stash, &gv, TRUE);
1971 DIE("Not a CODE reference");
1973 if (!CvROOT(cv) && !CvXSUB(cv)) {
1977 /* anonymous or undef'd function leaves us no recourse */
1978 if (CvANON(cv) || !(gv = CvGV(cv)))
1979 DIE("Undefined subroutine called");
1980 /* autoloaded stub? */
1981 if (cv != GvCV(gv)) {
1985 /* should call AUTOLOAD now? */
1986 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
1993 sub_name = sv_newmortal();
1994 gv_efullname3(sub_name, gv, Nullch);
1995 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
1999 if ((op->op_private & OPpENTERSUB_DB) && GvCV(DBsub) && !CvNODEBUG(cv))
2000 cv = get_db_sub(&sv, cv);
2002 DIE("No DBsub routine");
2006 * First we need to check if the sub or method requires locking.
2007 * If so, we gain a lock on the CV, the first argument or the
2008 * stash (for static methods), as appropriate. This has to be
2009 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2010 * reschedule by returning a new op.
2012 MUTEX_LOCK(CvMUTEXP(cv));
2013 if (CvFLAGS(cv) & CVf_LOCKED) {
2015 if (CvFLAGS(cv) & CVf_METHOD) {
2016 if (SP > stack_base + TOPMARK)
2017 sv = *(stack_base + TOPMARK + 1);
2019 MUTEX_UNLOCK(CvMUTEXP(cv));
2020 croak("no argument for locked method call");
2026 char *stashname = SvPV(sv, len);
2027 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2033 MUTEX_UNLOCK(CvMUTEXP(cv));
2034 mg = condpair_magic(sv);
2035 MUTEX_LOCK(MgMUTEXP(mg));
2036 if (MgOWNER(mg) == thr)
2037 MUTEX_UNLOCK(MgMUTEXP(mg));
2040 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2042 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2044 MUTEX_UNLOCK(MgMUTEXP(mg));
2045 SvREFCNT_inc(sv); /* Keep alive until magic_mutexfree */
2046 save_destructor(unlock_condpair, sv);
2048 MUTEX_LOCK(CvMUTEXP(cv));
2051 * Now we have permission to enter the sub, we must distinguish
2052 * four cases. (0) It's an XSUB (in which case we don't care
2053 * about ownership); (1) it's ours already (and we're recursing);
2054 * (2) it's free (but we may already be using a cached clone);
2055 * (3) another thread owns it. Case (1) is easy: we just use it.
2056 * Case (2) means we look for a clone--if we have one, use it
2057 * otherwise grab ownership of cv. Case (3) means we look for a
2058 * clone (for non-XSUBs) and have to create one if we don't
2060 * Why look for a clone in case (2) when we could just grab
2061 * ownership of cv straight away? Well, we could be recursing,
2062 * i.e. we originally tried to enter cv while another thread
2063 * owned it (hence we used a clone) but it has been freed up
2064 * and we're now recursing into it. It may or may not be "better"
2065 * to use the clone but at least CvDEPTH can be trusted.
2067 if (CvOWNER(cv) == thr || CvXSUB(cv))
2068 MUTEX_UNLOCK(CvMUTEXP(cv));
2070 /* Case (2) or (3) */
2074 * XXX Might it be better to release CvMUTEXP(cv) while we
2075 * do the hv_fetch? We might find someone has pinched it
2076 * when we look again, in which case we would be in case
2077 * (3) instead of (2) so we'd have to clone. Would the fact
2078 * that we released the mutex more quickly make up for this?
2081 (svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2083 /* We already have a clone to use */
2084 MUTEX_UNLOCK(CvMUTEXP(cv));
2086 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2087 "entersub: %p already has clone %p:%s\n",
2088 thr, cv, SvPEEK((SV*)cv)));
2091 if (CvDEPTH(cv) == 0)
2092 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2095 /* (2) => grab ownership of cv. (3) => make clone */
2099 MUTEX_UNLOCK(CvMUTEXP(cv));
2100 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2101 "entersub: %p grabbing %p:%s in stash %s\n",
2102 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2103 HvNAME(CvSTASH(cv)) : "(none)"));
2105 /* Make a new clone. */
2107 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2108 MUTEX_UNLOCK(CvMUTEXP(cv));
2109 DEBUG_L((PerlIO_printf(PerlIO_stderr(),
2110 "entersub: %p cloning %p:%s\n",
2111 thr, cv, SvPEEK((SV*)cv))));
2113 * We're creating a new clone so there's no race
2114 * between the original MUTEX_UNLOCK and the
2115 * SvREFCNT_inc since no one will be trying to undef
2116 * it out from underneath us. At least, I don't think
2119 clonecv = cv_clone(cv);
2120 SvREFCNT_dec(cv); /* finished with this */
2121 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2122 CvOWNER(clonecv) = thr;
2126 DEBUG_L(if (CvDEPTH(cv) != 0)
2127 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2129 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2132 #endif /* USE_THREADS */
2135 if (CvOLDSTYLE(cv)) {
2136 I32 (*fp3)_((int,int,int));
2138 register I32 items = SP - MARK;
2139 /* We dont worry to copy from @_. */
2144 stack_sp = mark + 1;
2145 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2146 items = (*fp3)(CvXSUBANY(cv).any_i32,
2147 MARK - stack_base + 1,
2149 stack_sp = stack_base + items;
2152 I32 markix = TOPMARK;
2157 /* Need to copy @_ to stack. Alternative may be to
2158 * switch stack to @_, and copy return values
2159 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2163 av = (AV*)curpad[0];
2166 #endif /* USE_THREADS */
2167 items = AvFILLp(av) + 1; /* @_ is not tieable */
2170 /* Mark is at the end of the stack. */
2172 Copy(AvARRAY(av), SP + 1, items, SV*);
2177 if (curcopdb) { /* We assume that the first
2178 XSUB in &DB::sub is the
2184 /* Do we need to open block here? XXXX */
2185 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2187 /* Enforce some sanity in scalar context. */
2188 if (gimme == G_SCALAR && ++markix != stack_sp - stack_base ) {
2189 if (markix > stack_sp - stack_base)
2190 *(stack_base + markix) = &sv_undef;
2192 *(stack_base + markix) = *stack_sp;
2193 stack_sp = stack_base + markix;
2201 register I32 items = SP - MARK;
2202 AV* padlist = CvPADLIST(cv);
2203 SV** svp = AvARRAY(padlist);
2204 push_return(op->op_next);
2205 PUSHBLOCK(cx, CXt_SUB, MARK);
2208 if (CvDEPTH(cv) < 2)
2209 (void)SvREFCNT_inc(cv);
2210 else { /* save temporaries on recursion? */
2211 if (CvDEPTH(cv) == 100 && dowarn
2212 && !(PERLDB_SUB && cv == GvCV(DBsub)))
2213 sub_crush_depth(cv);
2214 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2216 AV *newpad = newAV();
2217 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2218 I32 ix = AvFILLp((AV*)svp[1]);
2219 svp = AvARRAY(svp[0]);
2220 for ( ;ix > 0; ix--) {
2221 if (svp[ix] != &sv_undef) {
2222 char *name = SvPVX(svp[ix]);
2223 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2224 || *name == '&') /* anonymous code? */
2226 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2228 else { /* our own lexical */
2230 av_store(newpad, ix, sv = (SV*)newAV());
2231 else if (*name == '%')
2232 av_store(newpad, ix, sv = (SV*)newHV());
2234 av_store(newpad, ix, sv = NEWSV(0,0));
2239 av_store(newpad, ix, sv = NEWSV(0,0));
2243 av = newAV(); /* will be @_ */
2245 av_store(newpad, 0, (SV*)av);
2246 AvFLAGS(av) = AVf_REIFY;
2247 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2248 AvFILLp(padlist) = CvDEPTH(cv);
2249 svp = AvARRAY(padlist);
2254 AV* av = (AV*)curpad[0];
2256 items = AvFILLp(av) + 1;
2258 /* Mark is at the end of the stack. */
2260 Copy(AvARRAY(av), SP + 1, items, SV*);
2265 #endif /* USE_THREADS */
2267 curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2270 #endif /* USE_THREADS */
2276 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2277 "%p entersub preparing @_\n", thr));
2279 av = (AV*)curpad[0];
2285 cx->blk_sub.savearray = GvAV(defgv);
2286 GvAV(defgv) = (AV*)SvREFCNT_inc(av);
2287 #endif /* USE_THREADS */
2288 cx->blk_sub.argarray = av;
2291 if (items > AvMAX(av) + 1) {
2293 if (AvARRAY(av) != ary) {
2294 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2295 SvPVX(av) = (char*)ary;
2297 if (items > AvMAX(av) + 1) {
2298 AvMAX(av) = items - 1;
2299 Renew(ary,items,SV*);
2301 SvPVX(av) = (char*)ary;
2304 Copy(MARK,AvARRAY(av),items,SV*);
2305 AvFILLp(av) = items - 1;
2314 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2315 "%p entersub returning %p\n", thr, CvSTART(cv)));
2317 RETURNOP(CvSTART(cv));
2322 sub_crush_depth(CV *cv)
2325 warn("Deep recursion on anonymous subroutine");
2327 SV* tmpstr = sv_newmortal();
2328 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2329 warn("Deep recursion on subroutine \"%s\"", SvPVX(tmpstr));
2339 U32 lval = op->op_flags & OPf_MOD;
2340 U32 defer = (op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2344 elem -= curcop->cop_arybase;
2345 if (SvTYPE(av) != SVt_PVAV)
2347 svp = av_fetch(av, elem, lval && !defer);
2349 if (!svp || *svp == &sv_undef) {
2352 DIE(no_aelem, elem);
2353 lv = sv_newmortal();
2354 sv_upgrade(lv, SVt_PVLV);
2356 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2357 LvTARG(lv) = SvREFCNT_inc(av);
2358 LvTARGOFF(lv) = elem;
2363 if (op->op_private & OPpLVAL_INTRO)
2364 save_aelem(av, elem, svp);
2365 else if (op->op_private & OPpDEREF)
2366 vivify_ref(*svp, op->op_private & OPpDEREF);
2368 sv = (svp ? *svp : &sv_undef);
2369 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2370 sv = sv_mortalcopy(sv);
2376 vivify_ref(SV *sv, U32 to_what)
2383 if (SvTYPE(sv) < SVt_RV)
2384 sv_upgrade(sv, SVt_RV);
2385 else if (SvTYPE(sv) >= SVt_PV) {
2386 (void)SvOOK_off(sv);
2387 Safefree(SvPVX(sv));
2388 SvLEN(sv) = SvCUR(sv) = 0;
2392 SvRV(sv) = NEWSV(355,0);
2395 SvRV(sv) = (SV*)newAV();
2398 SvRV(sv) = (SV*)newHV();
2419 if (SvTYPE(sv) == SVt_PVCV) {
2425 name = SvPV(TOPs, na);
2426 sv = *(stack_base + TOPMARK + 1);
2437 !(packname = SvPV(sv, packlen)) ||
2438 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2439 !(ob=(SV*)GvIO(iogv)))
2441 if (!packname || !isIDFIRST(*packname))
2442 DIE("Can't call method \"%s\" without a package or object reference", name);
2443 stash = gv_stashpvn(packname, packlen, TRUE);
2446 *(stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2449 if (!ob || !SvOBJECT(ob))
2450 DIE("Can't call method \"%s\" on unblessed reference", name);
2452 stash = SvSTASH(ob);
2455 gv = gv_fetchmethod(stash, name);
2461 for (p = name; *p; p++) {
2463 sep = p, leaf = p + 1;
2464 else if (*p == ':' && *(p + 1) == ':')
2465 sep = p, leaf = p + 2;
2467 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2468 packname = HvNAME(sep ? curcop->cop_stash : stash);
2469 packlen = strlen(packname);
2473 packlen = sep - name;
2475 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2476 leaf, (int)packlen, packname);
2478 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);