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 if (SvTYPE(hv) == SVt_PVAV)
548 hv = avhv_keys((AV*)hv);
550 sv_setpvf(TARG, "%ld/%ld",
551 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
563 SV **lastlelem = stack_sp;
564 SV **lastrelem = stack_base + POPMARK;
565 SV **firstrelem = stack_base + POPMARK + 1;
566 SV **firstlelem = lastrelem + 1;
579 delaymagic = DM_DELAY; /* catch simultaneous items */
581 /* If there's a common identifier on both sides we have to take
582 * special care that assigning the identifier on the left doesn't
583 * clobber a value on the right that's used later in the list.
585 if (op->op_private & OPpASSIGN_COMMON) {
586 for (relem = firstrelem; relem <= lastrelem; relem++) {
589 TAINT_NOT; /* Each item is independent */
590 *relem = sv_mortalcopy(sv);
599 while (lelem <= lastlelem) {
600 TAINT_NOT; /* Each item stands on its own, taintwise. */
602 switch (SvTYPE(sv)) {
605 magic = SvMAGICAL(ary) != 0;
608 av_extend(ary, lastrelem - relem);
610 while (relem <= lastrelem) { /* gobble up all the rest */
616 didstore = av_store(ary,i++,sv);
630 magic = SvMAGICAL(hash) != 0;
633 while (relem < lastrelem) { /* gobble up all the rest */
638 sv = &sv_no, relem++;
639 tmpstr = NEWSV(29,0);
641 sv_setsv(tmpstr,*relem); /* value */
643 didstore = hv_store_ent(hash,sv,tmpstr,0);
645 if (SvSMAGICAL(tmpstr))
648 SvREFCNT_dec(tmpstr);
652 if (relem == lastrelem) {
656 if (relem == firstrelem &&
658 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
659 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
660 warn("Reference found where even-sized list expected");
662 warn("Odd number of elements in hash assignment");
664 tmpstr = NEWSV(29,0);
665 didstore = hv_store_ent(hash,*relem,tmpstr,0);
667 if (SvSMAGICAL(tmpstr))
670 SvREFCNT_dec(tmpstr);
679 if (SvTHINKFIRST(sv)) {
680 if (SvREADONLY(sv) && curcop != &compiling) {
683 if (relem <= lastrelem)
690 if (relem <= lastrelem) {
691 sv_setsv(sv, *relem);
695 sv_setsv(sv, &sv_undef);
700 if (delaymagic & ~DM_DELAY) {
701 if (delaymagic & DM_UID) {
703 (void)setresuid(uid,euid,(Uid_t)-1);
706 (void)setreuid(uid,euid);
709 if ((delaymagic & DM_UID) == DM_RUID) {
711 delaymagic &= ~DM_RUID;
713 # endif /* HAS_SETRUID */
715 if ((delaymagic & DM_UID) == DM_EUID) {
717 delaymagic &= ~DM_EUID;
719 # endif /* HAS_SETEUID */
720 if (delaymagic & DM_UID) {
722 DIE("No setreuid available");
723 (void)PerlProc_setuid(uid);
725 # endif /* HAS_SETREUID */
726 #endif /* HAS_SETRESUID */
727 uid = (int)PerlProc_getuid();
728 euid = (int)PerlProc_geteuid();
730 if (delaymagic & DM_GID) {
732 (void)setresgid(gid,egid,(Gid_t)-1);
735 (void)setregid(gid,egid);
738 if ((delaymagic & DM_GID) == DM_RGID) {
740 delaymagic &= ~DM_RGID;
742 # endif /* HAS_SETRGID */
744 if ((delaymagic & DM_GID) == DM_EGID) {
746 delaymagic &= ~DM_EGID;
748 # endif /* HAS_SETEGID */
749 if (delaymagic & DM_GID) {
751 DIE("No setregid available");
752 (void)PerlProc_setgid(gid);
754 # endif /* HAS_SETREGID */
755 #endif /* HAS_SETRESGID */
756 gid = (int)PerlProc_getgid();
757 egid = (int)PerlProc_getegid();
759 tainting |= (uid && (euid != uid || egid != gid));
766 else if (gimme == G_SCALAR) {
769 SETi(lastrelem - firstrelem + 1);
775 SP = firstrelem + (lastlelem - firstlelem);
776 lelem = firstlelem + (relem - firstrelem);
778 *relem++ = (lelem <= lastlelem) ? *lelem++ : &sv_undef;
786 register PMOP *pm = cPMOP;
793 register REGEXP *rx = pm->op_pmregexp;
798 I32 oldsave = savestack_ix;
799 I32 update_minmatch = 1;
802 if (op->op_flags & OPf_STACKED)
808 PUTBACK; /* EVAL blocks need stack_sp. */
812 DIE("panic: do_match");
813 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
814 (tainted && (pm->op_pmflags & PMf_RETAINT)));
817 if (pm->op_pmdynflags & PMdf_USED) {
819 if (gimme == G_ARRAY)
824 if (!rx->prelen && curpm) {
826 rx = pm->op_pmregexp;
828 if (rx->minlen > len) goto failure;
830 screamer = ( (SvSCREAM(TARG) && rx->check_substr
831 && SvTYPE(rx->check_substr) == SVt_PVBM
832 && SvVALID(rx->check_substr))
835 if (global = pm->op_pmflags & PMf_GLOBAL) {
837 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
838 MAGIC* mg = mg_find(TARG, 'g');
839 if (mg && mg->mg_len >= 0) {
840 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
841 minmatch = (mg->mg_flags & MGf_MINMATCH);
846 if (!rx->nparens && !global)
847 gimme = G_SCALAR; /* accidental array context? */
848 safebase = (((gimme == G_ARRAY) || global || !rx->nparens)
850 safebase = safebase ? 0 : REXEC_COPY_STR ;
851 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
853 multiline = pm->op_pmflags & PMf_MULTILINE;
857 if (global && rx->startp[0]) {
859 if ((s + rx->minlen) > strend)
861 if (update_minmatch++)
862 minmatch = (s == rx->startp[0]);
864 if (rx->check_substr) {
865 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
869 if (screamfirst[BmRARE(rx->check_substr)] < 0)
871 else if (!(s = screaminstr(TARG, rx->check_substr,
872 rx->check_offset_min, 0, &p, 0)))
874 else if ((rx->reganch & ROPT_CHECK_ALL)
875 && !sawampersand && !SvTAIL(rx->check_substr))
878 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
879 (unsigned char*)strend,
880 rx->check_substr, 0)))
882 else if ((rx->reganch & ROPT_CHECK_ALL) && !sawampersand)
884 if (s && rx->check_offset_max < s - t) {
885 ++BmUSEFUL(rx->check_substr);
886 s -= rx->check_offset_max;
891 /* Now checkstring is fixed, i.e. at fixed offset from the
892 beginning of match, and the match is anchored at s. */
893 else if (!multiline) { /* Anchored near beginning of string. */
895 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
896 || ((slen = SvCUR(rx->check_substr)) > 1
897 && memNE(SvPVX(rx->check_substr),
898 s + rx->check_offset_min, slen)))
901 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
902 && rx->check_substr == rx->float_substr) {
903 SvREFCNT_dec(rx->check_substr);
904 rx->check_substr = Nullsv; /* opt is being useless */
905 rx->float_substr = Nullsv;
908 if (regexec_flags(rx, s, strend, truebase, minmatch,
909 screamer, NULL, safebase))
912 if (pm->op_pmflags & PMf_ONCE)
913 pm->op_pmdynflags |= PMdf_USED;
922 RX_MATCH_TAINTED_on(rx);
923 TAINT_IF(RX_MATCH_TAINTED(rx));
924 if (gimme == G_ARRAY) {
928 if (global && !iters)
932 SPAGAIN; /* EVAL blocks could move the stack. */
933 EXTEND(SP, iters + i);
934 EXTEND_MORTAL(iters + i);
935 for (i = !i; i <= iters; i++) {
936 PUSHs(sv_newmortal());
938 if ((s = rx->startp[i]) && rx->endp[i] ) {
939 len = rx->endp[i] - s;
940 sv_setpvn(*SP, s, len);
944 truebase = rx->subbeg;
946 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
948 PUTBACK; /* EVAL blocks may use stack */
951 LEAVE_SCOPE(oldsave);
957 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
958 mg = mg_find(TARG, 'g');
960 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
961 mg = mg_find(TARG, 'g');
964 mg->mg_len = rx->endp[0] - rx->subbeg;
965 if (rx->startp[0] == rx->endp[0])
966 mg->mg_flags |= MGf_MINMATCH;
968 mg->mg_flags &= ~MGf_MINMATCH;
971 LEAVE_SCOPE(oldsave);
975 yup: /* Confirmed by check_substr */
977 RX_MATCH_TAINTED_on(rx);
978 TAINT_IF(RX_MATCH_TAINTED(rx));
979 ++BmUSEFUL(rx->check_substr);
981 if (pm->op_pmflags & PMf_ONCE)
982 pm->op_pmdynflags |= PMdf_USED;
983 Safefree(rx->subbase);
984 rx->subbase = Nullch;
986 rx->subbeg = truebase;
989 rx->endp[0] = s + SvCUR(rx->check_substr);
995 tmps = rx->subbase = savepvn(t, strend-t);
997 rx->subend = tmps + (strend-t);
998 tmps = rx->startp[0] = tmps + (s - t);
999 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1001 LEAVE_SCOPE(oldsave);
1005 if (rx->check_substr)
1006 ++BmUSEFUL(rx->check_substr);
1009 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1010 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1011 MAGIC* mg = mg_find(TARG, 'g');
1016 LEAVE_SCOPE(oldsave);
1017 if (gimme == G_ARRAY)
1025 dSP; dTARGETSTACKED;
1030 register IO *io = GvIO(last_in_gv);
1031 register I32 type = op->op_type;
1032 I32 gimme = GIMME_V;
1035 if (SvRMAGICAL(last_in_gv) && (mg = mg_find((SV*)last_in_gv, 'q'))) {
1040 perl_call_method("READLINE", gimme);
1043 if (gimme == G_SCALAR)
1044 SvSetMagicSV_nosteal(TARG, TOPs);
1051 if (IoFLAGS(io) & IOf_ARGV) {
1052 if (IoFLAGS(io) & IOf_START) {
1053 IoFLAGS(io) &= ~IOf_START;
1055 if (av_len(GvAVn(last_in_gv)) < 0) {
1056 do_open(last_in_gv,"-",1,FALSE,0,0,Nullfp);
1057 sv_setpvn(GvSV(last_in_gv), "-", 1);
1058 SvSETMAGIC(GvSV(last_in_gv));
1063 fp = nextargv(last_in_gv);
1064 if (!fp) { /* Note: fp != IoIFP(io) */
1065 (void)do_close(last_in_gv, FALSE); /* now it does*/
1066 IoFLAGS(io) |= IOf_START;
1069 else if (type == OP_GLOB) {
1070 SV *tmpcmd = NEWSV(55, 0);
1074 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1075 /* since spawning off a process is a real performance hit */
1077 #include <descrip.h>
1078 #include <lib$routines.h>
1081 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1082 char vmsspec[NAM$C_MAXRSS+1];
1083 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1084 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1085 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1088 struct dsc$descriptor_s wilddsc
1089 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1090 struct dsc$descriptor_vs rsdsc
1091 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1092 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1094 /* We could find out if there's an explicit dev/dir or version
1095 by peeking into lib$find_file's internal context at
1096 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1097 but that's unsupported, so I don't want to do it now and
1098 have it bite someone in the future. */
1099 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1100 cp = SvPV(tmpglob,i);
1102 if (cp[i] == ';') hasver = 1;
1104 if (sts) hasver = 1;
1108 hasdir = isunix = 1;
1111 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1116 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1118 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1119 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1120 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1121 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1122 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1123 &dfltdsc,NULL,NULL,NULL))&1)) {
1124 end = rstr + (unsigned long int) *rslt;
1125 if (!hasver) while (*end != ';') end--;
1126 *(end++) = '\n'; *end = '\0';
1127 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1129 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1134 while (*(--begin) != ']' && *begin != '>') ;
1137 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1139 if (cxt) (void)lib$find_file_end(&cxt);
1140 if (ok && sts != RMS$_NMF &&
1141 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1144 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1146 PerlIO_close(tmpfp);
1150 PerlIO_rewind(tmpfp);
1152 IoIFP(io) = fp = tmpfp;
1153 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1160 sv_setpv(tmpcmd, "for a in ");
1161 sv_catsv(tmpcmd, tmpglob);
1162 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1165 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1166 sv_catsv(tmpcmd, tmpglob);
1168 sv_setpv(tmpcmd, "perlglob ");
1169 sv_catsv(tmpcmd, tmpglob);
1170 sv_catpv(tmpcmd, " |");
1175 sv_setpvn(tmpcmd, cshname, cshlen);
1176 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1177 sv_catsv(tmpcmd, tmpglob);
1178 sv_catpv(tmpcmd, "' 2>/dev/null |");
1180 sv_setpv(tmpcmd, "echo ");
1181 sv_catsv(tmpcmd, tmpglob);
1183 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1185 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1188 #endif /* !DOSISH */
1189 (void)do_open(last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1190 FALSE, 0, 0, Nullfp);
1196 else if (type == OP_GLOB)
1200 if (dowarn && io && !(IoFLAGS(io) & IOf_START))
1201 warn("Read on closed filehandle <%s>", GvENAME(last_in_gv));
1202 if (gimme == G_SCALAR) {
1203 (void)SvOK_off(TARG);
1209 if (gimme == G_SCALAR) {
1213 (void)SvUPGRADE(sv, SVt_PV);
1214 tmplen = SvLEN(sv); /* remember if already alloced */
1216 Sv_Grow(sv, 80); /* try short-buffering it */
1217 if (type == OP_RCATLINE)
1223 sv = sv_2mortal(NEWSV(57, 80));
1227 if (!sv_gets(sv, fp, offset)) {
1228 PerlIO_clearerr(fp);
1229 if (IoFLAGS(io) & IOf_ARGV) {
1230 fp = nextargv(last_in_gv);
1233 (void)do_close(last_in_gv, FALSE);
1234 IoFLAGS(io) |= IOf_START;
1236 else if (type == OP_GLOB) {
1237 if (do_close(last_in_gv, FALSE) & ~0xFF)
1238 warn("internal error: glob failed");
1240 if (gimme == G_SCALAR) {
1241 (void)SvOK_off(TARG);
1246 /* This should not be marked tainted if the fp is marked clean */
1247 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1254 if (type == OP_GLOB) {
1257 if (SvCUR(sv) > 0 && SvCUR(rs) > 0) {
1258 tmps = SvEND(sv) - 1;
1259 if (*tmps == *SvPVX(rs)) {
1264 for (tmps = SvPVX(sv); *tmps; tmps++)
1265 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1266 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1268 if (*tmps && PerlLIO_stat(SvPVX(sv), &statbuf) < 0) {
1269 (void)POPs; /* Unmatched wildcard? Chuck it... */
1273 if (gimme == G_ARRAY) {
1274 if (SvLEN(sv) - SvCUR(sv) > 20) {
1275 SvLEN_set(sv, SvCUR(sv)+1);
1276 Renew(SvPVX(sv), SvLEN(sv), char);
1278 sv = sv_2mortal(NEWSV(58, 80));
1281 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1282 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1286 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1287 Renew(SvPVX(sv), SvLEN(sv), char);
1296 register PERL_CONTEXT *cx;
1297 I32 gimme = OP_GIMME(op, -1);
1300 if (cxstack_ix >= 0)
1301 gimme = cxstack[cxstack_ix].blk_gimme;
1309 PUSHBLOCK(cx, CXt_BLOCK, SP);
1321 U32 lval = op->op_flags & OPf_MOD;
1322 U32 defer = op->op_private & OPpLVAL_DEFER;
1325 if (SvTYPE(hv) == SVt_PVHV) {
1326 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1327 svp = he ? &HeVAL(he) : 0;
1329 else if (SvTYPE(hv) == SVt_PVAV) {
1330 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1336 if (!svp || *svp == &sv_undef) {
1340 DIE(no_helem, SvPV(keysv, na));
1341 lv = sv_newmortal();
1342 sv_upgrade(lv, SVt_PVLV);
1344 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1345 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1346 LvTARG(lv) = SvREFCNT_inc(hv);
1351 if (op->op_private & OPpLVAL_INTRO) {
1352 if (HvNAME(hv) && isGV(*svp))
1353 save_gp((GV*)*svp, !(op->op_flags & OPf_SPECIAL));
1355 save_helem(hv, keysv, svp);
1357 else if (op->op_private & OPpDEREF)
1358 vivify_ref(*svp, op->op_private & OPpDEREF);
1360 sv = (svp ? *svp : &sv_undef);
1361 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1362 * Pushing the magical RHS on to the stack is useless, since
1363 * that magic is soon destined to be misled by the local(),
1364 * and thus the later pp_sassign() will fail to mg_get() the
1365 * old value. This should also cure problems with delayed
1366 * mg_get()s. GSAR 98-07-03 */
1367 if (!lval && SvGMAGICAL(sv))
1368 sv = sv_mortalcopy(sv);
1376 register PERL_CONTEXT *cx;
1382 if (op->op_flags & OPf_SPECIAL) {
1383 cx = &cxstack[cxstack_ix];
1384 cx->blk_oldpm = curpm; /* fake block should preserve $1 et al */
1389 gimme = OP_GIMME(op, -1);
1391 if (cxstack_ix >= 0)
1392 gimme = cxstack[cxstack_ix].blk_gimme;
1398 if (gimme == G_VOID)
1400 else if (gimme == G_SCALAR) {
1403 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1406 *MARK = sv_mortalcopy(TOPs);
1413 else if (gimme == G_ARRAY) {
1414 /* in case LEAVE wipes old return values */
1415 for (mark = newsp + 1; mark <= SP; mark++) {
1416 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1417 *mark = sv_mortalcopy(*mark);
1418 TAINT_NOT; /* Each item is independent */
1422 curpm = newpm; /* Don't pop $1 et al till now */
1432 register PERL_CONTEXT *cx;
1437 cx = &cxstack[cxstack_ix];
1438 if (cx->cx_type != CXt_LOOP)
1439 DIE("panic: pp_iter");
1441 av = cx->blk_loop.iterary;
1442 if (SvTYPE(av) != SVt_PVAV) {
1443 /* iterate ($min .. $max) */
1444 if (cx->blk_loop.iterlval) {
1445 /* string increment */
1446 register SV* cur = cx->blk_loop.iterlval;
1448 char *max = SvPV((SV*)av, maxlen);
1449 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1450 sv_setsv(*cx->blk_loop.itervar, cur);
1451 if (strEQ(SvPVX(cur), max))
1452 sv_setiv(cur, 0); /* terminate next time */
1459 /* integer increment */
1460 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1463 /* we know that the loop index SV is IV capable, so we can save
1464 * some time by doing the essential work of sv_setiv() ourself.
1466 sv = *cx->blk_loop.itervar;
1467 (void)SvIOK_only(sv);
1468 SvIVX(sv) = cx->blk_loop.iterix++;
1474 if (cx->blk_loop.iterix >= (av == curstack ? cx->blk_oldsp : AvFILL(av)))
1477 SvREFCNT_dec(*cx->blk_loop.itervar);
1479 if (sv = (SvMAGICAL(av))
1480 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1481 : AvARRAY(av)[++cx->blk_loop.iterix])
1485 if (av != curstack && SvIMMORTAL(sv)) {
1486 SV *lv = cx->blk_loop.iterlval;
1487 if (lv && SvREFCNT(lv) > 1) {
1492 SvREFCNT_dec(LvTARG(lv));
1494 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1495 sv_upgrade(lv, SVt_PVLV);
1497 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1499 LvTARG(lv) = SvREFCNT_inc(av);
1500 LvTARGOFF(lv) = cx->blk_loop.iterix;
1501 LvTARGLEN(lv) = (UV) -1;
1505 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1512 register PMOP *pm = cPMOP;
1528 register REGEXP *rx = pm->op_pmregexp;
1530 int force_on_match = 0;
1531 I32 oldsave = savestack_ix;
1532 I32 update_minmatch = 1;
1535 /* known replacement string? */
1536 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1537 if (op->op_flags & OPf_STACKED)
1543 if (SvREADONLY(TARG)
1544 || (SvTYPE(TARG) > SVt_PVLV
1545 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1549 s = SvPV(TARG, len);
1550 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1552 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1553 (tainted && (pm->op_pmflags & PMf_RETAINT)));
1560 DIE("panic: do_subst");
1563 maxiters = (strend - s) + 10;
1565 if (!rx->prelen && curpm) {
1567 rx = pm->op_pmregexp;
1569 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1570 && SvTYPE(rx->check_substr) == SVt_PVBM
1571 && SvVALID(rx->check_substr))
1573 safebase = (!rx->nparens && !sawampersand) ? 0 : REXEC_COPY_STR;
1574 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1576 multiline = pm->op_pmflags & PMf_MULTILINE;
1579 if (rx->check_substr) {
1580 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1584 if (screamfirst[BmRARE(rx->check_substr)] < 0)
1586 else if (!(s = screaminstr(TARG, rx->check_substr, rx->check_offset_min, 0, &p, 0)))
1589 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
1590 (unsigned char*)strend,
1591 rx->check_substr, 0)))
1593 if (s && rx->check_offset_max < s - m) {
1594 ++BmUSEFUL(rx->check_substr);
1595 s -= rx->check_offset_max;
1600 /* Now checkstring is fixed, i.e. at fixed offset from the
1601 beginning of match, and the match is anchored at s. */
1602 else if (!multiline) { /* Anchored at beginning of string. */
1604 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
1605 || ((slen = SvCUR(rx->check_substr)) > 1
1606 && memNE(SvPVX(rx->check_substr),
1607 s + rx->check_offset_min, slen)))
1610 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
1611 && rx->check_substr == rx->float_substr) {
1612 SvREFCNT_dec(rx->check_substr);
1613 rx->check_substr = Nullsv; /* opt is being useless */
1614 rx->float_substr = Nullsv;
1618 /* only replace once? */
1619 once = !(rpm->op_pmflags & PMf_GLOBAL);
1621 /* known replacement string? */
1622 c = dstr ? SvPV(dstr, clen) : Nullch;
1624 /* can do inplace substitution? */
1625 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1626 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1627 if (!regexec_flags(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1630 LEAVE_SCOPE(oldsave);
1633 if (force_on_match) {
1635 s = SvPV_force(TARG, len);
1640 SvSCREAM_off(TARG); /* disable possible screamer */
1642 rxtainted |= RX_MATCH_TAINTED(rx);
1644 m = orig + (rx->startp[0] - rx->subbase);
1645 d = orig + (rx->endp[0] - rx->subbase);
1651 if (m - s > strend - d) { /* faster to shorten from end */
1653 Copy(c, m, clen, char);
1658 Move(d, m, i, char);
1662 SvCUR_set(TARG, m - s);
1665 else if (i = m - s) { /* faster from front */
1673 Copy(c, m, clen, char);
1678 Copy(c, d, clen, char);
1683 TAINT_IF(rxtainted & 1);
1689 if (iters++ > maxiters)
1690 DIE("Substitution loop");
1691 rxtainted |= RX_MATCH_TAINTED(rx);
1696 Move(s, d, i, char);
1700 Copy(c, d, clen, char);
1704 } while (regexec_flags(rx, s, strend, orig, s == m,
1705 Nullsv, NULL, 0)); /* don't match same null twice */
1708 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1709 Move(s, d, i+1, char); /* include the NUL */
1711 TAINT_IF(rxtainted & 1);
1713 PUSHs(sv_2mortal(newSViv((I32)iters)));
1715 (void)SvPOK_only(TARG);
1716 TAINT_IF(rxtainted);
1717 if (SvSMAGICAL(TARG)) {
1723 LEAVE_SCOPE(oldsave);
1727 if (regexec_flags(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1728 if (force_on_match) {
1730 s = SvPV_force(TARG, len);
1733 rxtainted |= RX_MATCH_TAINTED(rx);
1734 dstr = NEWSV(25, len);
1735 sv_setpvn(dstr, m, s-m);
1738 register PERL_CONTEXT *cx;
1741 RETURNOP(cPMOP->op_pmreplroot);
1744 if (iters++ > maxiters)
1745 DIE("Substitution loop");
1746 rxtainted |= RX_MATCH_TAINTED(rx);
1747 if (rx->subbase && rx->subbase != orig) {
1752 strend = s + (strend - m);
1755 sv_catpvn(dstr, s, m-s);
1758 sv_catpvn(dstr, c, clen);
1761 } while (regexec_flags(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1762 sv_catpvn(dstr, s, strend - s);
1764 (void)SvOOK_off(TARG);
1765 Safefree(SvPVX(TARG));
1766 SvPVX(TARG) = SvPVX(dstr);
1767 SvCUR_set(TARG, SvCUR(dstr));
1768 SvLEN_set(TARG, SvLEN(dstr));
1772 TAINT_IF(rxtainted & 1);
1774 PUSHs(sv_2mortal(newSViv((I32)iters)));
1776 (void)SvPOK_only(TARG);
1777 TAINT_IF(rxtainted);
1780 LEAVE_SCOPE(oldsave);
1786 ++BmUSEFUL(rx->check_substr);
1791 LEAVE_SCOPE(oldsave);
1800 stack_base[markstack_ptr[-1]++] = stack_base[*markstack_ptr];
1802 LEAVE; /* exit inner scope */
1805 if (stack_base + *markstack_ptr > SP) {
1807 I32 gimme = GIMME_V;
1809 LEAVE; /* exit outer scope */
1810 (void)POPMARK; /* pop src */
1811 items = --*markstack_ptr - markstack_ptr[-1];
1812 (void)POPMARK; /* pop dst */
1813 SP = stack_base + POPMARK; /* pop original mark */
1814 if (gimme == G_SCALAR) {
1818 else if (gimme == G_ARRAY)
1825 ENTER; /* enter inner scope */
1828 src = stack_base[*markstack_ptr];
1832 RETURNOP(cLOGOP->op_other);
1843 register PERL_CONTEXT *cx;
1844 struct block_sub cxsub;
1847 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1850 if (gimme == G_SCALAR) {
1853 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1855 *MARK = SvREFCNT_inc(TOPs);
1860 *MARK = sv_mortalcopy(TOPs);
1863 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1870 else if (gimme == G_ARRAY) {
1871 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1872 if (!SvTEMP(*MARK)) {
1873 *MARK = sv_mortalcopy(*MARK);
1874 TAINT_NOT; /* Each item is independent */
1880 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1881 curpm = newpm; /* ... and pop $1 et al */
1884 return pop_return();
1888 get_db_sub(SV **svp, CV *cv)
1891 SV *dbsv = GvSV(DBsub);
1893 if (!PERLDB_SUB_NN) {
1897 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1898 || strEQ(GvNAME(gv), "END")
1899 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1900 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1901 && (gv = (GV*)*svp) ))) {
1902 /* Use GV from the stack as a fallback. */
1903 /* GV is potentially non-unique, or contain different CV. */
1904 sv_setsv(dbsv, newRV((SV*)cv));
1907 gv_efullname3(dbsv, gv, Nullch);
1911 SvUPGRADE(dbsv, SVt_PVIV);
1913 SAVEIV(SvIVX(dbsv));
1914 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1929 register PERL_CONTEXT *cx;
1931 bool hasargs = (op->op_flags & OPf_STACKED) != 0;
1934 DIE("Not a CODE reference");
1935 switch (SvTYPE(sv)) {
1940 if (sv == &sv_yes) { /* unfound import, ignore */
1942 SP = stack_base + POPMARK;
1945 if (SvGMAGICAL(sv)) {
1947 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
1952 DIE(no_usym, "a subroutine");
1953 if (op->op_private & HINT_STRICT_REFS)
1954 DIE(no_symref, sym, "a subroutine");
1955 cv = perl_get_cv(sym, TRUE);
1959 if (SvTYPE(cv) == SVt_PVCV)
1964 DIE("Not a CODE reference");
1969 if (!(cv = GvCVu((GV*)sv)))
1970 cv = sv_2cv(sv, &stash, &gv, TRUE);
1979 DIE("Not a CODE reference");
1981 if (!CvROOT(cv) && !CvXSUB(cv)) {
1985 /* anonymous or undef'd function leaves us no recourse */
1986 if (CvANON(cv) || !(gv = CvGV(cv)))
1987 DIE("Undefined subroutine called");
1988 /* autoloaded stub? */
1989 if (cv != GvCV(gv)) {
1993 /* should call AUTOLOAD now? */
1994 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2001 sub_name = sv_newmortal();
2002 gv_efullname3(sub_name, gv, Nullch);
2003 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2007 if ((op->op_private & OPpENTERSUB_DB) && GvCV(DBsub) && !CvNODEBUG(cv))
2008 cv = get_db_sub(&sv, cv);
2010 DIE("No DBsub routine");
2014 * First we need to check if the sub or method requires locking.
2015 * If so, we gain a lock on the CV, the first argument or the
2016 * stash (for static methods), as appropriate. This has to be
2017 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2018 * reschedule by returning a new op.
2020 MUTEX_LOCK(CvMUTEXP(cv));
2021 if (CvFLAGS(cv) & CVf_LOCKED) {
2023 if (CvFLAGS(cv) & CVf_METHOD) {
2024 if (SP > stack_base + TOPMARK)
2025 sv = *(stack_base + TOPMARK + 1);
2027 MUTEX_UNLOCK(CvMUTEXP(cv));
2028 croak("no argument for locked method call");
2034 char *stashname = SvPV(sv, len);
2035 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2041 MUTEX_UNLOCK(CvMUTEXP(cv));
2042 mg = condpair_magic(sv);
2043 MUTEX_LOCK(MgMUTEXP(mg));
2044 if (MgOWNER(mg) == thr)
2045 MUTEX_UNLOCK(MgMUTEXP(mg));
2048 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2050 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2052 MUTEX_UNLOCK(MgMUTEXP(mg));
2053 SvREFCNT_inc(sv); /* Keep alive until magic_mutexfree */
2054 save_destructor(unlock_condpair, sv);
2056 MUTEX_LOCK(CvMUTEXP(cv));
2059 * Now we have permission to enter the sub, we must distinguish
2060 * four cases. (0) It's an XSUB (in which case we don't care
2061 * about ownership); (1) it's ours already (and we're recursing);
2062 * (2) it's free (but we may already be using a cached clone);
2063 * (3) another thread owns it. Case (1) is easy: we just use it.
2064 * Case (2) means we look for a clone--if we have one, use it
2065 * otherwise grab ownership of cv. Case (3) means we look for a
2066 * clone (for non-XSUBs) and have to create one if we don't
2068 * Why look for a clone in case (2) when we could just grab
2069 * ownership of cv straight away? Well, we could be recursing,
2070 * i.e. we originally tried to enter cv while another thread
2071 * owned it (hence we used a clone) but it has been freed up
2072 * and we're now recursing into it. It may or may not be "better"
2073 * to use the clone but at least CvDEPTH can be trusted.
2075 if (CvOWNER(cv) == thr || CvXSUB(cv))
2076 MUTEX_UNLOCK(CvMUTEXP(cv));
2078 /* Case (2) or (3) */
2082 * XXX Might it be better to release CvMUTEXP(cv) while we
2083 * do the hv_fetch? We might find someone has pinched it
2084 * when we look again, in which case we would be in case
2085 * (3) instead of (2) so we'd have to clone. Would the fact
2086 * that we released the mutex more quickly make up for this?
2089 (svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2091 /* We already have a clone to use */
2092 MUTEX_UNLOCK(CvMUTEXP(cv));
2094 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2095 "entersub: %p already has clone %p:%s\n",
2096 thr, cv, SvPEEK((SV*)cv)));
2099 if (CvDEPTH(cv) == 0)
2100 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2103 /* (2) => grab ownership of cv. (3) => make clone */
2107 MUTEX_UNLOCK(CvMUTEXP(cv));
2108 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2109 "entersub: %p grabbing %p:%s in stash %s\n",
2110 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2111 HvNAME(CvSTASH(cv)) : "(none)"));
2113 /* Make a new clone. */
2115 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2116 MUTEX_UNLOCK(CvMUTEXP(cv));
2117 DEBUG_L((PerlIO_printf(PerlIO_stderr(),
2118 "entersub: %p cloning %p:%s\n",
2119 thr, cv, SvPEEK((SV*)cv))));
2121 * We're creating a new clone so there's no race
2122 * between the original MUTEX_UNLOCK and the
2123 * SvREFCNT_inc since no one will be trying to undef
2124 * it out from underneath us. At least, I don't think
2127 clonecv = cv_clone(cv);
2128 SvREFCNT_dec(cv); /* finished with this */
2129 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2130 CvOWNER(clonecv) = thr;
2134 DEBUG_L(if (CvDEPTH(cv) != 0)
2135 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2137 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2140 #endif /* USE_THREADS */
2143 if (CvOLDSTYLE(cv)) {
2144 I32 (*fp3)_((int,int,int));
2146 register I32 items = SP - MARK;
2147 /* We dont worry to copy from @_. */
2152 stack_sp = mark + 1;
2153 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2154 items = (*fp3)(CvXSUBANY(cv).any_i32,
2155 MARK - stack_base + 1,
2157 stack_sp = stack_base + items;
2160 I32 markix = TOPMARK;
2165 /* Need to copy @_ to stack. Alternative may be to
2166 * switch stack to @_, and copy return values
2167 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2171 av = (AV*)curpad[0];
2174 #endif /* USE_THREADS */
2175 items = AvFILLp(av) + 1; /* @_ is not tieable */
2178 /* Mark is at the end of the stack. */
2180 Copy(AvARRAY(av), SP + 1, items, SV*);
2185 if (curcopdb) { /* We assume that the first
2186 XSUB in &DB::sub is the
2192 /* Do we need to open block here? XXXX */
2193 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2195 /* Enforce some sanity in scalar context. */
2196 if (gimme == G_SCALAR && ++markix != stack_sp - stack_base ) {
2197 if (markix > stack_sp - stack_base)
2198 *(stack_base + markix) = &sv_undef;
2200 *(stack_base + markix) = *stack_sp;
2201 stack_sp = stack_base + markix;
2209 register I32 items = SP - MARK;
2210 AV* padlist = CvPADLIST(cv);
2211 SV** svp = AvARRAY(padlist);
2212 push_return(op->op_next);
2213 PUSHBLOCK(cx, CXt_SUB, MARK);
2216 if (CvDEPTH(cv) < 2)
2217 (void)SvREFCNT_inc(cv);
2218 else { /* save temporaries on recursion? */
2219 if (CvDEPTH(cv) == 100 && dowarn
2220 && !(PERLDB_SUB && cv == GvCV(DBsub)))
2221 sub_crush_depth(cv);
2222 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2224 AV *newpad = newAV();
2225 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2226 I32 ix = AvFILLp((AV*)svp[1]);
2227 svp = AvARRAY(svp[0]);
2228 for ( ;ix > 0; ix--) {
2229 if (svp[ix] != &sv_undef) {
2230 char *name = SvPVX(svp[ix]);
2231 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2232 || *name == '&') /* anonymous code? */
2234 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2236 else { /* our own lexical */
2238 av_store(newpad, ix, sv = (SV*)newAV());
2239 else if (*name == '%')
2240 av_store(newpad, ix, sv = (SV*)newHV());
2242 av_store(newpad, ix, sv = NEWSV(0,0));
2247 av_store(newpad, ix, sv = NEWSV(0,0));
2251 av = newAV(); /* will be @_ */
2253 av_store(newpad, 0, (SV*)av);
2254 AvFLAGS(av) = AVf_REIFY;
2255 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2256 AvFILLp(padlist) = CvDEPTH(cv);
2257 svp = AvARRAY(padlist);
2262 AV* av = (AV*)curpad[0];
2264 items = AvFILLp(av) + 1;
2266 /* Mark is at the end of the stack. */
2268 Copy(AvARRAY(av), SP + 1, items, SV*);
2273 #endif /* USE_THREADS */
2275 curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2278 #endif /* USE_THREADS */
2284 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2285 "%p entersub preparing @_\n", thr));
2287 av = (AV*)curpad[0];
2293 cx->blk_sub.savearray = GvAV(defgv);
2294 GvAV(defgv) = (AV*)SvREFCNT_inc(av);
2295 #endif /* USE_THREADS */
2296 cx->blk_sub.argarray = av;
2299 if (items > AvMAX(av) + 1) {
2301 if (AvARRAY(av) != ary) {
2302 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2303 SvPVX(av) = (char*)ary;
2305 if (items > AvMAX(av) + 1) {
2306 AvMAX(av) = items - 1;
2307 Renew(ary,items,SV*);
2309 SvPVX(av) = (char*)ary;
2312 Copy(MARK,AvARRAY(av),items,SV*);
2313 AvFILLp(av) = items - 1;
2322 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2323 "%p entersub returning %p\n", thr, CvSTART(cv)));
2325 RETURNOP(CvSTART(cv));
2330 sub_crush_depth(CV *cv)
2333 warn("Deep recursion on anonymous subroutine");
2335 SV* tmpstr = sv_newmortal();
2336 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2337 warn("Deep recursion on subroutine \"%s\"", SvPVX(tmpstr));
2347 U32 lval = op->op_flags & OPf_MOD;
2348 U32 defer = (op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2352 elem -= curcop->cop_arybase;
2353 if (SvTYPE(av) != SVt_PVAV)
2355 svp = av_fetch(av, elem, lval && !defer);
2357 if (!svp || *svp == &sv_undef) {
2360 DIE(no_aelem, elem);
2361 lv = sv_newmortal();
2362 sv_upgrade(lv, SVt_PVLV);
2364 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2365 LvTARG(lv) = SvREFCNT_inc(av);
2366 LvTARGOFF(lv) = elem;
2371 if (op->op_private & OPpLVAL_INTRO)
2372 save_aelem(av, elem, svp);
2373 else if (op->op_private & OPpDEREF)
2374 vivify_ref(*svp, op->op_private & OPpDEREF);
2376 sv = (svp ? *svp : &sv_undef);
2377 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2378 sv = sv_mortalcopy(sv);
2384 vivify_ref(SV *sv, U32 to_what)
2391 if (SvTYPE(sv) < SVt_RV)
2392 sv_upgrade(sv, SVt_RV);
2393 else if (SvTYPE(sv) >= SVt_PV) {
2394 (void)SvOOK_off(sv);
2395 Safefree(SvPVX(sv));
2396 SvLEN(sv) = SvCUR(sv) = 0;
2400 SvRV(sv) = NEWSV(355,0);
2403 SvRV(sv) = (SV*)newAV();
2406 SvRV(sv) = (SV*)newHV();
2427 if (SvTYPE(sv) == SVt_PVCV) {
2433 name = SvPV(TOPs, na);
2434 sv = *(stack_base + TOPMARK + 1);
2445 !(packname = SvPV(sv, packlen)) ||
2446 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2447 !(ob=(SV*)GvIO(iogv)))
2449 if (!packname || !isIDFIRST(*packname))
2450 DIE("Can't call method \"%s\" without a package or object reference", name);
2451 stash = gv_stashpvn(packname, packlen, TRUE);
2454 *(stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2457 if (!ob || !SvOBJECT(ob))
2458 DIE("Can't call method \"%s\" on unblessed reference", name);
2460 stash = SvSTASH(ob);
2463 gv = gv_fetchmethod(stash, name);
2469 for (p = name; *p; p++) {
2471 sep = p, leaf = p + 1;
2472 else if (*p == ':' && *(p + 1) == ':')
2473 sep = p, leaf = p + 2;
2475 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2476 packname = HvNAME(sep ? curcop->cop_stash : stash);
2477 packlen = strlen(packname);
2481 packlen = sep - name;
2483 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2484 leaf, (int)packlen, packname);
2486 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);