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;
920 RX_MATCH_TAINTED_SET(rx, rxtainted);
921 if (gimme == G_ARRAY) {
925 if (global && !iters)
929 SPAGAIN; /* EVAL blocks could move the stack. */
930 EXTEND(SP, iters + i);
931 EXTEND_MORTAL(iters + i);
932 for (i = !i; i <= iters; i++) {
933 PUSHs(sv_newmortal());
935 if ((s = rx->startp[i]) && rx->endp[i] ) {
936 len = rx->endp[i] - s;
937 sv_setpvn(*SP, s, len);
941 truebase = rx->subbeg;
943 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
945 PUTBACK; /* EVAL blocks may use stack */
948 LEAVE_SCOPE(oldsave);
954 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
955 mg = mg_find(TARG, 'g');
957 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
958 mg = mg_find(TARG, 'g');
961 mg->mg_len = rx->endp[0] - rx->subbeg;
962 if (rx->startp[0] == rx->endp[0])
963 mg->mg_flags |= MGf_MINMATCH;
965 mg->mg_flags &= ~MGf_MINMATCH;
968 LEAVE_SCOPE(oldsave);
972 yup: /* Confirmed by check_substr */
973 RX_MATCH_TAINTED_SET(rx, rxtainted);
974 ++BmUSEFUL(rx->check_substr);
976 if (pm->op_pmflags & PMf_ONCE)
977 pm->op_pmdynflags |= PMdf_USED;
978 Safefree(rx->subbase);
979 rx->subbase = Nullch;
981 rx->subbeg = truebase;
984 rx->endp[0] = s + SvCUR(rx->check_substr);
990 tmps = rx->subbase = savepvn(t, strend-t);
992 rx->subend = tmps + (strend-t);
993 tmps = rx->startp[0] = tmps + (s - t);
994 rx->endp[0] = tmps + SvCUR(rx->check_substr);
996 LEAVE_SCOPE(oldsave);
1000 if (rx->check_substr)
1001 ++BmUSEFUL(rx->check_substr);
1004 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1005 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1006 MAGIC* mg = mg_find(TARG, 'g');
1011 LEAVE_SCOPE(oldsave);
1012 if (gimme == G_ARRAY)
1020 dSP; dTARGETSTACKED;
1025 register IO *io = GvIO(last_in_gv);
1026 register I32 type = op->op_type;
1027 I32 gimme = GIMME_V;
1030 if (SvRMAGICAL(last_in_gv) && (mg = mg_find((SV*)last_in_gv, 'q'))) {
1035 perl_call_method("READLINE", gimme);
1038 if (gimme == G_SCALAR)
1039 SvSetMagicSV_nosteal(TARG, TOPs);
1046 if (IoFLAGS(io) & IOf_ARGV) {
1047 if (IoFLAGS(io) & IOf_START) {
1048 IoFLAGS(io) &= ~IOf_START;
1050 if (av_len(GvAVn(last_in_gv)) < 0) {
1051 do_open(last_in_gv,"-",1,FALSE,0,0,Nullfp);
1052 sv_setpvn(GvSV(last_in_gv), "-", 1);
1053 SvSETMAGIC(GvSV(last_in_gv));
1058 fp = nextargv(last_in_gv);
1059 if (!fp) { /* Note: fp != IoIFP(io) */
1060 (void)do_close(last_in_gv, FALSE); /* now it does*/
1061 IoFLAGS(io) |= IOf_START;
1064 else if (type == OP_GLOB) {
1065 SV *tmpcmd = NEWSV(55, 0);
1069 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1070 /* since spawning off a process is a real performance hit */
1072 #include <descrip.h>
1073 #include <lib$routines.h>
1076 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1077 char vmsspec[NAM$C_MAXRSS+1];
1078 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1079 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1080 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1083 struct dsc$descriptor_s wilddsc
1084 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1085 struct dsc$descriptor_vs rsdsc
1086 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1087 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1089 /* We could find out if there's an explicit dev/dir or version
1090 by peeking into lib$find_file's internal context at
1091 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1092 but that's unsupported, so I don't want to do it now and
1093 have it bite someone in the future. */
1094 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1095 cp = SvPV(tmpglob,i);
1097 if (cp[i] == ';') hasver = 1;
1099 if (sts) hasver = 1;
1103 hasdir = isunix = 1;
1106 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1111 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1113 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1114 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1115 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1116 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1117 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1118 &dfltdsc,NULL,NULL,NULL))&1)) {
1119 end = rstr + (unsigned long int) *rslt;
1120 if (!hasver) while (*end != ';') end--;
1121 *(end++) = '\n'; *end = '\0';
1122 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1124 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1129 while (*(--begin) != ']' && *begin != '>') ;
1132 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1134 if (cxt) (void)lib$find_file_end(&cxt);
1135 if (ok && sts != RMS$_NMF &&
1136 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1139 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1141 PerlIO_close(tmpfp);
1145 PerlIO_rewind(tmpfp);
1147 IoIFP(io) = fp = tmpfp;
1148 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1155 sv_setpv(tmpcmd, "for a in ");
1156 sv_catsv(tmpcmd, tmpglob);
1157 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1160 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1161 sv_catsv(tmpcmd, tmpglob);
1163 sv_setpv(tmpcmd, "perlglob ");
1164 sv_catsv(tmpcmd, tmpglob);
1165 sv_catpv(tmpcmd, " |");
1170 sv_setpvn(tmpcmd, cshname, cshlen);
1171 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1172 sv_catsv(tmpcmd, tmpglob);
1173 sv_catpv(tmpcmd, "' 2>/dev/null |");
1175 sv_setpv(tmpcmd, "echo ");
1176 sv_catsv(tmpcmd, tmpglob);
1178 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1180 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1183 #endif /* !DOSISH */
1184 (void)do_open(last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1185 FALSE, 0, 0, Nullfp);
1191 else if (type == OP_GLOB)
1195 if (dowarn && io && !(IoFLAGS(io) & IOf_START))
1196 warn("Read on closed filehandle <%s>", GvENAME(last_in_gv));
1197 if (gimme == G_SCALAR) {
1198 (void)SvOK_off(TARG);
1204 if (gimme == G_SCALAR) {
1208 (void)SvUPGRADE(sv, SVt_PV);
1209 tmplen = SvLEN(sv); /* remember if already alloced */
1211 Sv_Grow(sv, 80); /* try short-buffering it */
1212 if (type == OP_RCATLINE)
1218 sv = sv_2mortal(NEWSV(57, 80));
1222 if (!sv_gets(sv, fp, offset)) {
1223 PerlIO_clearerr(fp);
1224 if (IoFLAGS(io) & IOf_ARGV) {
1225 fp = nextargv(last_in_gv);
1228 (void)do_close(last_in_gv, FALSE);
1229 IoFLAGS(io) |= IOf_START;
1231 else if (type == OP_GLOB) {
1232 if (do_close(last_in_gv, FALSE) & ~0xFF)
1233 warn("internal error: glob failed");
1235 if (gimme == G_SCALAR) {
1236 (void)SvOK_off(TARG);
1241 /* This should not be marked tainted if the fp is marked clean */
1242 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1249 if (type == OP_GLOB) {
1252 if (SvCUR(sv) > 0 && SvCUR(rs) > 0) {
1253 tmps = SvEND(sv) - 1;
1254 if (*tmps == *SvPVX(rs)) {
1259 for (tmps = SvPVX(sv); *tmps; tmps++)
1260 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1261 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1263 if (*tmps && PerlLIO_stat(SvPVX(sv), &statbuf) < 0) {
1264 (void)POPs; /* Unmatched wildcard? Chuck it... */
1268 if (gimme == G_ARRAY) {
1269 if (SvLEN(sv) - SvCUR(sv) > 20) {
1270 SvLEN_set(sv, SvCUR(sv)+1);
1271 Renew(SvPVX(sv), SvLEN(sv), char);
1273 sv = sv_2mortal(NEWSV(58, 80));
1276 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1277 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1281 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1282 Renew(SvPVX(sv), SvLEN(sv), char);
1291 register PERL_CONTEXT *cx;
1292 I32 gimme = OP_GIMME(op, -1);
1295 if (cxstack_ix >= 0)
1296 gimme = cxstack[cxstack_ix].blk_gimme;
1304 PUSHBLOCK(cx, CXt_BLOCK, SP);
1316 U32 lval = op->op_flags & OPf_MOD;
1317 U32 defer = op->op_private & OPpLVAL_DEFER;
1320 if (SvTYPE(hv) == SVt_PVHV) {
1321 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1322 svp = he ? &HeVAL(he) : 0;
1324 else if (SvTYPE(hv) == SVt_PVAV) {
1325 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1331 if (!svp || *svp == &sv_undef) {
1335 DIE(no_helem, SvPV(keysv, na));
1336 lv = sv_newmortal();
1337 sv_upgrade(lv, SVt_PVLV);
1339 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1340 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1341 LvTARG(lv) = SvREFCNT_inc(hv);
1346 if (op->op_private & OPpLVAL_INTRO) {
1347 if (HvNAME(hv) && isGV(*svp))
1348 save_gp((GV*)*svp, !(op->op_flags & OPf_SPECIAL));
1350 save_helem(hv, keysv, svp);
1352 else if (op->op_private & OPpDEREF)
1353 vivify_ref(*svp, op->op_private & OPpDEREF);
1355 sv = (svp ? *svp : &sv_undef);
1356 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1357 * Pushing the magical RHS on to the stack is useless, since
1358 * that magic is soon destined to be misled by the local(),
1359 * and thus the later pp_sassign() will fail to mg_get() the
1360 * old value. This should also cure problems with delayed
1361 * mg_get()s. GSAR 98-07-03 */
1362 if (!lval && SvGMAGICAL(sv))
1363 sv = sv_mortalcopy(sv);
1371 register PERL_CONTEXT *cx;
1377 if (op->op_flags & OPf_SPECIAL) {
1378 cx = &cxstack[cxstack_ix];
1379 cx->blk_oldpm = curpm; /* fake block should preserve $1 et al */
1384 gimme = OP_GIMME(op, -1);
1386 if (cxstack_ix >= 0)
1387 gimme = cxstack[cxstack_ix].blk_gimme;
1393 if (gimme == G_VOID)
1395 else if (gimme == G_SCALAR) {
1398 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1401 *MARK = sv_mortalcopy(TOPs);
1408 else if (gimme == G_ARRAY) {
1409 /* in case LEAVE wipes old return values */
1410 for (mark = newsp + 1; mark <= SP; mark++) {
1411 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1412 *mark = sv_mortalcopy(*mark);
1413 TAINT_NOT; /* Each item is independent */
1417 curpm = newpm; /* Don't pop $1 et al till now */
1427 register PERL_CONTEXT *cx;
1432 cx = &cxstack[cxstack_ix];
1433 if (cx->cx_type != CXt_LOOP)
1434 DIE("panic: pp_iter");
1436 av = cx->blk_loop.iterary;
1437 if (SvTYPE(av) != SVt_PVAV) {
1438 /* iterate ($min .. $max) */
1439 if (cx->blk_loop.iterlval) {
1440 /* string increment */
1441 register SV* cur = cx->blk_loop.iterlval;
1443 char *max = SvPV((SV*)av, maxlen);
1444 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1445 sv_setsv(*cx->blk_loop.itervar, cur);
1446 if (strEQ(SvPVX(cur), max))
1447 sv_setiv(cur, 0); /* terminate next time */
1454 /* integer increment */
1455 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1457 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1462 if (cx->blk_loop.iterix >= (av == curstack ? cx->blk_oldsp : AvFILL(av)))
1465 SvREFCNT_dec(*cx->blk_loop.itervar);
1467 if (sv = (SvMAGICAL(av))
1468 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1469 : AvARRAY(av)[++cx->blk_loop.iterix])
1473 if (av != curstack && SvIMMORTAL(sv)) {
1474 SV *lv = cx->blk_loop.iterlval;
1475 if (lv && SvREFCNT(lv) > 1) {
1480 SvREFCNT_dec(LvTARG(lv));
1482 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1483 sv_upgrade(lv, SVt_PVLV);
1485 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1487 LvTARG(lv) = SvREFCNT_inc(av);
1488 LvTARGOFF(lv) = cx->blk_loop.iterix;
1489 LvTARGLEN(lv) = (UV) -1;
1493 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1500 register PMOP *pm = cPMOP;
1516 register REGEXP *rx = pm->op_pmregexp;
1518 int force_on_match = 0;
1519 I32 oldsave = savestack_ix;
1520 I32 update_minmatch = 1;
1523 /* known replacement string? */
1524 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1525 if (op->op_flags & OPf_STACKED)
1531 if (SvREADONLY(TARG)
1532 || (SvTYPE(TARG) > SVt_PVLV
1533 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1537 s = SvPV(TARG, len);
1538 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1540 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1541 (tainted && (pm->op_pmflags & PMf_RETAINT)));
1548 DIE("panic: do_subst");
1551 maxiters = (strend - s) + 10;
1553 if (!rx->prelen && curpm) {
1555 rx = pm->op_pmregexp;
1557 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1558 && SvTYPE(rx->check_substr) == SVt_PVBM
1559 && SvVALID(rx->check_substr))
1561 safebase = (!rx->nparens && !sawampersand) ? 0 : REXEC_COPY_STR;
1562 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1564 multiline = pm->op_pmflags & PMf_MULTILINE;
1567 if (rx->check_substr) {
1568 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1572 if (screamfirst[BmRARE(rx->check_substr)] < 0)
1574 else if (!(s = screaminstr(TARG, rx->check_substr, rx->check_offset_min, 0, &p, 0)))
1577 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
1578 (unsigned char*)strend,
1579 rx->check_substr, 0)))
1581 if (s && rx->check_offset_max < s - m) {
1582 ++BmUSEFUL(rx->check_substr);
1583 s -= rx->check_offset_max;
1588 /* Now checkstring is fixed, i.e. at fixed offset from the
1589 beginning of match, and the match is anchored at s. */
1590 else if (!multiline) { /* Anchored at beginning of string. */
1592 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
1593 || ((slen = SvCUR(rx->check_substr)) > 1
1594 && memNE(SvPVX(rx->check_substr),
1595 s + rx->check_offset_min, slen)))
1598 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
1599 && rx->check_substr == rx->float_substr) {
1600 SvREFCNT_dec(rx->check_substr);
1601 rx->check_substr = Nullsv; /* opt is being useless */
1602 rx->float_substr = Nullsv;
1606 /* only replace once? */
1607 once = !(rpm->op_pmflags & PMf_GLOBAL);
1609 /* known replacement string? */
1610 c = dstr ? SvPV(dstr, clen) : Nullch;
1612 /* can do inplace substitution? */
1613 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1614 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1615 if (!regexec_flags(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1618 LEAVE_SCOPE(oldsave);
1621 if (force_on_match) {
1623 s = SvPV_force(TARG, len);
1628 SvSCREAM_off(TARG); /* disable possible screamer */
1630 rxtainted |= RX_MATCH_TAINTED(rx);
1632 m = orig + (rx->startp[0] - rx->subbase);
1633 d = orig + (rx->endp[0] - rx->subbase);
1639 if (m - s > strend - d) { /* faster to shorten from end */
1641 Copy(c, m, clen, char);
1646 Move(d, m, i, char);
1650 SvCUR_set(TARG, m - s);
1653 else if (i = m - s) { /* faster from front */
1661 Copy(c, m, clen, char);
1666 Copy(c, d, clen, char);
1671 TAINT_IF(rxtainted & 1);
1677 if (iters++ > maxiters)
1678 DIE("Substitution loop");
1679 rxtainted |= RX_MATCH_TAINTED(rx);
1684 Move(s, d, i, char);
1688 Copy(c, d, clen, char);
1692 } while (regexec_flags(rx, s, strend, orig, s == m,
1693 Nullsv, NULL, 0)); /* don't match same null twice */
1696 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1697 Move(s, d, i+1, char); /* include the NUL */
1699 TAINT_IF(rxtainted & 1);
1701 PUSHs(sv_2mortal(newSViv((I32)iters)));
1703 (void)SvPOK_only(TARG);
1704 TAINT_IF(rxtainted);
1705 if (SvSMAGICAL(TARG)) {
1711 LEAVE_SCOPE(oldsave);
1715 if (regexec_flags(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1716 if (force_on_match) {
1718 s = SvPV_force(TARG, len);
1721 rxtainted |= RX_MATCH_TAINTED(rx);
1722 dstr = NEWSV(25, len);
1723 sv_setpvn(dstr, m, s-m);
1726 register PERL_CONTEXT *cx;
1729 RETURNOP(cPMOP->op_pmreplroot);
1732 if (iters++ > maxiters)
1733 DIE("Substitution loop");
1734 rxtainted |= RX_MATCH_TAINTED(rx);
1735 if (rx->subbase && rx->subbase != orig) {
1740 strend = s + (strend - m);
1743 sv_catpvn(dstr, s, m-s);
1746 sv_catpvn(dstr, c, clen);
1749 } while (regexec_flags(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1750 sv_catpvn(dstr, s, strend - s);
1752 (void)SvOOK_off(TARG);
1753 Safefree(SvPVX(TARG));
1754 SvPVX(TARG) = SvPVX(dstr);
1755 SvCUR_set(TARG, SvCUR(dstr));
1756 SvLEN_set(TARG, SvLEN(dstr));
1760 TAINT_IF(rxtainted & 1);
1762 PUSHs(sv_2mortal(newSViv((I32)iters)));
1764 (void)SvPOK_only(TARG);
1765 TAINT_IF(rxtainted);
1768 LEAVE_SCOPE(oldsave);
1774 ++BmUSEFUL(rx->check_substr);
1779 LEAVE_SCOPE(oldsave);
1788 stack_base[markstack_ptr[-1]++] = stack_base[*markstack_ptr];
1790 LEAVE; /* exit inner scope */
1793 if (stack_base + *markstack_ptr > SP) {
1795 I32 gimme = GIMME_V;
1797 LEAVE; /* exit outer scope */
1798 (void)POPMARK; /* pop src */
1799 items = --*markstack_ptr - markstack_ptr[-1];
1800 (void)POPMARK; /* pop dst */
1801 SP = stack_base + POPMARK; /* pop original mark */
1802 if (gimme == G_SCALAR) {
1806 else if (gimme == G_ARRAY)
1813 ENTER; /* enter inner scope */
1816 src = stack_base[*markstack_ptr];
1820 RETURNOP(cLOGOP->op_other);
1831 register PERL_CONTEXT *cx;
1832 struct block_sub cxsub;
1835 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1838 if (gimme == G_SCALAR) {
1841 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1843 *MARK = SvREFCNT_inc(TOPs);
1848 *MARK = sv_mortalcopy(TOPs);
1851 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1858 else if (gimme == G_ARRAY) {
1859 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1860 if (!SvTEMP(*MARK)) {
1861 *MARK = sv_mortalcopy(*MARK);
1862 TAINT_NOT; /* Each item is independent */
1868 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1869 curpm = newpm; /* ... and pop $1 et al */
1872 return pop_return();
1876 get_db_sub(SV **svp, CV *cv)
1879 SV *dbsv = GvSV(DBsub);
1881 if (!PERLDB_SUB_NN) {
1885 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1886 || strEQ(GvNAME(gv), "END")
1887 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1888 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1889 && (gv = (GV*)*svp) ))) {
1890 /* Use GV from the stack as a fallback. */
1891 /* GV is potentially non-unique, or contain different CV. */
1892 sv_setsv(dbsv, newRV((SV*)cv));
1895 gv_efullname3(dbsv, gv, Nullch);
1899 SvUPGRADE(dbsv, SVt_PVIV);
1901 SAVEIV(SvIVX(dbsv));
1902 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1917 register PERL_CONTEXT *cx;
1919 bool hasargs = (op->op_flags & OPf_STACKED) != 0;
1922 DIE("Not a CODE reference");
1923 switch (SvTYPE(sv)) {
1928 if (sv == &sv_yes) { /* unfound import, ignore */
1930 SP = stack_base + POPMARK;
1933 if (SvGMAGICAL(sv)) {
1935 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
1940 DIE(no_usym, "a subroutine");
1941 if (op->op_private & HINT_STRICT_REFS)
1942 DIE(no_symref, sym, "a subroutine");
1943 cv = perl_get_cv(sym, TRUE);
1947 if (SvTYPE(cv) == SVt_PVCV)
1952 DIE("Not a CODE reference");
1957 if (!(cv = GvCVu((GV*)sv)))
1958 cv = sv_2cv(sv, &stash, &gv, TRUE);
1967 DIE("Not a CODE reference");
1969 if (!CvROOT(cv) && !CvXSUB(cv)) {
1973 /* anonymous or undef'd function leaves us no recourse */
1974 if (CvANON(cv) || !(gv = CvGV(cv)))
1975 DIE("Undefined subroutine called");
1976 /* autoloaded stub? */
1977 if (cv != GvCV(gv)) {
1981 /* should call AUTOLOAD now? */
1982 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
1989 sub_name = sv_newmortal();
1990 gv_efullname3(sub_name, gv, Nullch);
1991 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
1995 if ((op->op_private & OPpENTERSUB_DB) && GvCV(DBsub) && !CvNODEBUG(cv))
1996 cv = get_db_sub(&sv, cv);
1998 DIE("No DBsub routine");
2002 * First we need to check if the sub or method requires locking.
2003 * If so, we gain a lock on the CV, the first argument or the
2004 * stash (for static methods), as appropriate. This has to be
2005 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2006 * reschedule by returning a new op.
2008 MUTEX_LOCK(CvMUTEXP(cv));
2009 if (CvFLAGS(cv) & CVf_LOCKED) {
2011 if (CvFLAGS(cv) & CVf_METHOD) {
2012 if (SP > stack_base + TOPMARK)
2013 sv = *(stack_base + TOPMARK + 1);
2015 MUTEX_UNLOCK(CvMUTEXP(cv));
2016 croak("no argument for locked method call");
2022 char *stashname = SvPV(sv, len);
2023 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2029 MUTEX_UNLOCK(CvMUTEXP(cv));
2030 mg = condpair_magic(sv);
2031 MUTEX_LOCK(MgMUTEXP(mg));
2032 if (MgOWNER(mg) == thr)
2033 MUTEX_UNLOCK(MgMUTEXP(mg));
2036 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2038 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2040 MUTEX_UNLOCK(MgMUTEXP(mg));
2041 SvREFCNT_inc(sv); /* Keep alive until magic_mutexfree */
2042 save_destructor(unlock_condpair, sv);
2044 MUTEX_LOCK(CvMUTEXP(cv));
2047 * Now we have permission to enter the sub, we must distinguish
2048 * four cases. (0) It's an XSUB (in which case we don't care
2049 * about ownership); (1) it's ours already (and we're recursing);
2050 * (2) it's free (but we may already be using a cached clone);
2051 * (3) another thread owns it. Case (1) is easy: we just use it.
2052 * Case (2) means we look for a clone--if we have one, use it
2053 * otherwise grab ownership of cv. Case (3) means we look for a
2054 * clone (for non-XSUBs) and have to create one if we don't
2056 * Why look for a clone in case (2) when we could just grab
2057 * ownership of cv straight away? Well, we could be recursing,
2058 * i.e. we originally tried to enter cv while another thread
2059 * owned it (hence we used a clone) but it has been freed up
2060 * and we're now recursing into it. It may or may not be "better"
2061 * to use the clone but at least CvDEPTH can be trusted.
2063 if (CvOWNER(cv) == thr || CvXSUB(cv))
2064 MUTEX_UNLOCK(CvMUTEXP(cv));
2066 /* Case (2) or (3) */
2070 * XXX Might it be better to release CvMUTEXP(cv) while we
2071 * do the hv_fetch? We might find someone has pinched it
2072 * when we look again, in which case we would be in case
2073 * (3) instead of (2) so we'd have to clone. Would the fact
2074 * that we released the mutex more quickly make up for this?
2077 (svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2079 /* We already have a clone to use */
2080 MUTEX_UNLOCK(CvMUTEXP(cv));
2082 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2083 "entersub: %p already has clone %p:%s\n",
2084 thr, cv, SvPEEK((SV*)cv)));
2087 if (CvDEPTH(cv) == 0)
2088 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2091 /* (2) => grab ownership of cv. (3) => make clone */
2095 MUTEX_UNLOCK(CvMUTEXP(cv));
2096 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2097 "entersub: %p grabbing %p:%s in stash %s\n",
2098 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2099 HvNAME(CvSTASH(cv)) : "(none)"));
2101 /* Make a new clone. */
2103 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2104 MUTEX_UNLOCK(CvMUTEXP(cv));
2105 DEBUG_L((PerlIO_printf(PerlIO_stderr(),
2106 "entersub: %p cloning %p:%s\n",
2107 thr, cv, SvPEEK((SV*)cv))));
2109 * We're creating a new clone so there's no race
2110 * between the original MUTEX_UNLOCK and the
2111 * SvREFCNT_inc since no one will be trying to undef
2112 * it out from underneath us. At least, I don't think
2115 clonecv = cv_clone(cv);
2116 SvREFCNT_dec(cv); /* finished with this */
2117 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2118 CvOWNER(clonecv) = thr;
2122 DEBUG_L(if (CvDEPTH(cv) != 0)
2123 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2125 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2128 #endif /* USE_THREADS */
2131 if (CvOLDSTYLE(cv)) {
2132 I32 (*fp3)_((int,int,int));
2134 register I32 items = SP - MARK;
2135 /* We dont worry to copy from @_. */
2140 stack_sp = mark + 1;
2141 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2142 items = (*fp3)(CvXSUBANY(cv).any_i32,
2143 MARK - stack_base + 1,
2145 stack_sp = stack_base + items;
2148 I32 markix = TOPMARK;
2153 /* Need to copy @_ to stack. Alternative may be to
2154 * switch stack to @_, and copy return values
2155 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2159 av = (AV*)curpad[0];
2162 #endif /* USE_THREADS */
2163 items = AvFILLp(av) + 1; /* @_ is not tieable */
2166 /* Mark is at the end of the stack. */
2168 Copy(AvARRAY(av), SP + 1, items, SV*);
2173 if (curcopdb) { /* We assume that the first
2174 XSUB in &DB::sub is the
2180 /* Do we need to open block here? XXXX */
2181 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2183 /* Enforce some sanity in scalar context. */
2184 if (gimme == G_SCALAR && ++markix != stack_sp - stack_base ) {
2185 if (markix > stack_sp - stack_base)
2186 *(stack_base + markix) = &sv_undef;
2188 *(stack_base + markix) = *stack_sp;
2189 stack_sp = stack_base + markix;
2197 register I32 items = SP - MARK;
2198 AV* padlist = CvPADLIST(cv);
2199 SV** svp = AvARRAY(padlist);
2200 push_return(op->op_next);
2201 PUSHBLOCK(cx, CXt_SUB, MARK);
2204 if (CvDEPTH(cv) < 2)
2205 (void)SvREFCNT_inc(cv);
2206 else { /* save temporaries on recursion? */
2207 if (CvDEPTH(cv) == 100 && dowarn
2208 && !(PERLDB_SUB && cv == GvCV(DBsub)))
2209 sub_crush_depth(cv);
2210 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2212 AV *newpad = newAV();
2213 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2214 I32 ix = AvFILLp((AV*)svp[1]);
2215 svp = AvARRAY(svp[0]);
2216 for ( ;ix > 0; ix--) {
2217 if (svp[ix] != &sv_undef) {
2218 char *name = SvPVX(svp[ix]);
2219 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2220 || *name == '&') /* anonymous code? */
2222 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2224 else { /* our own lexical */
2226 av_store(newpad, ix, sv = (SV*)newAV());
2227 else if (*name == '%')
2228 av_store(newpad, ix, sv = (SV*)newHV());
2230 av_store(newpad, ix, sv = NEWSV(0,0));
2235 av_store(newpad, ix, sv = NEWSV(0,0));
2239 av = newAV(); /* will be @_ */
2241 av_store(newpad, 0, (SV*)av);
2242 AvFLAGS(av) = AVf_REIFY;
2243 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2244 AvFILLp(padlist) = CvDEPTH(cv);
2245 svp = AvARRAY(padlist);
2250 AV* av = (AV*)curpad[0];
2252 items = AvFILLp(av) + 1;
2254 /* Mark is at the end of the stack. */
2256 Copy(AvARRAY(av), SP + 1, items, SV*);
2261 #endif /* USE_THREADS */
2263 curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2266 #endif /* USE_THREADS */
2272 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2273 "%p entersub preparing @_\n", thr));
2275 av = (AV*)curpad[0];
2281 cx->blk_sub.savearray = GvAV(defgv);
2282 GvAV(defgv) = (AV*)SvREFCNT_inc(av);
2283 #endif /* USE_THREADS */
2284 cx->blk_sub.argarray = av;
2287 if (items > AvMAX(av) + 1) {
2289 if (AvARRAY(av) != ary) {
2290 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2291 SvPVX(av) = (char*)ary;
2293 if (items > AvMAX(av) + 1) {
2294 AvMAX(av) = items - 1;
2295 Renew(ary,items,SV*);
2297 SvPVX(av) = (char*)ary;
2300 Copy(MARK,AvARRAY(av),items,SV*);
2301 AvFILLp(av) = items - 1;
2310 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2311 "%p entersub returning %p\n", thr, CvSTART(cv)));
2313 RETURNOP(CvSTART(cv));
2318 sub_crush_depth(CV *cv)
2321 warn("Deep recursion on anonymous subroutine");
2323 SV* tmpstr = sv_newmortal();
2324 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2325 warn("Deep recursion on subroutine \"%s\"", SvPVX(tmpstr));
2335 U32 lval = op->op_flags & OPf_MOD;
2336 U32 defer = (op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2340 elem -= curcop->cop_arybase;
2341 if (SvTYPE(av) != SVt_PVAV)
2343 svp = av_fetch(av, elem, lval && !defer);
2345 if (!svp || *svp == &sv_undef) {
2348 DIE(no_aelem, elem);
2349 lv = sv_newmortal();
2350 sv_upgrade(lv, SVt_PVLV);
2352 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2353 LvTARG(lv) = SvREFCNT_inc(av);
2354 LvTARGOFF(lv) = elem;
2359 if (op->op_private & OPpLVAL_INTRO)
2360 save_aelem(av, elem, svp);
2361 else if (op->op_private & OPpDEREF)
2362 vivify_ref(*svp, op->op_private & OPpDEREF);
2364 sv = (svp ? *svp : &sv_undef);
2365 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2366 sv = sv_mortalcopy(sv);
2372 vivify_ref(SV *sv, U32 to_what)
2379 if (SvTYPE(sv) < SVt_RV)
2380 sv_upgrade(sv, SVt_RV);
2381 else if (SvTYPE(sv) >= SVt_PV) {
2382 (void)SvOOK_off(sv);
2383 Safefree(SvPVX(sv));
2384 SvLEN(sv) = SvCUR(sv) = 0;
2388 SvRV(sv) = NEWSV(355,0);
2391 SvRV(sv) = (SV*)newAV();
2394 SvRV(sv) = (SV*)newHV();
2415 if (SvTYPE(sv) == SVt_PVCV) {
2421 name = SvPV(TOPs, na);
2422 sv = *(stack_base + TOPMARK + 1);
2433 !(packname = SvPV(sv, packlen)) ||
2434 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2435 !(ob=(SV*)GvIO(iogv)))
2437 if (!packname || !isIDFIRST(*packname))
2438 DIE("Can't call method \"%s\" without a package or object reference", name);
2439 stash = gv_stashpvn(packname, packlen, TRUE);
2442 *(stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2445 if (!ob || !SvOBJECT(ob))
2446 DIE("Can't call method \"%s\" on unblessed reference", name);
2448 stash = SvSTASH(ob);
2451 gv = gv_fetchmethod(stash, name);
2457 for (p = name; *p; p++) {
2459 sep = p, leaf = p + 1;
2460 else if (*p == ':' && *(p + 1) == ':')
2461 sep = p, leaf = p + 2;
2463 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2464 packname = HvNAME(sep ? curcop->cop_stash : stash);
2465 packlen = strlen(packname);
2469 packlen = sep - name;
2471 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2472 leaf, (int)packlen, packname);
2474 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);