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 SV** svp = av_fetch(av, op->op_private, op->op_flags & OPf_MOD);
255 PUSHs(svp ? *svp : &sv_undef);
261 djSP; dMARK; dTARGET;
263 do_join(TARG, *MARK, MARK, SP);
274 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
275 * will be enough to hold an OP*.
277 SV* sv = sv_newmortal();
278 sv_upgrade(sv, SVt_PVLV);
280 Copy(&op, &LvTARGOFF(sv), 1, OP*);
288 /* Oversized hot code. */
292 djSP; dMARK; dORIGMARK;
298 if (op->op_flags & OPf_STACKED)
302 if (SvRMAGICAL(gv) && (mg = mg_find((SV*)gv, 'q'))) {
303 if (MARK == ORIGMARK) {
304 /* If using default handle then we need to make space to
305 * pass object as 1st arg, so move other args up ...
309 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
316 perl_call_method("PRINT", G_SCALAR);
324 if (!(io = GvIO(gv))) {
326 SV* sv = sv_newmortal();
327 gv_fullname3(sv, gv, Nullch);
328 warn("Filehandle %s never opened", SvPV(sv,na));
331 SETERRNO(EBADF,RMS$_IFI);
334 else if (!(fp = IoOFP(io))) {
336 SV* sv = sv_newmortal();
337 gv_fullname3(sv, gv, Nullch);
339 warn("Filehandle %s opened only for input", SvPV(sv,na));
341 warn("print on closed filehandle %s", SvPV(sv,na));
343 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
350 if (!do_print(*MARK, fp))
354 if (PerlIO_write(fp, ofs, ofslen) == 0 || PerlIO_error(fp)) {
363 if (!do_print(*MARK, fp))
372 if (PerlIO_write(fp, ors, orslen) == 0 || PerlIO_error(fp))
375 if (IoFLAGS(io) & IOf_FLUSH)
376 if (PerlIO_flush(fp) == EOF)
398 if (SvTYPE(av) != SVt_PVAV)
399 DIE("Not an ARRAY reference");
400 if (op->op_flags & OPf_REF) {
406 if (SvTYPE(sv) == SVt_PVAV) {
408 if (op->op_flags & OPf_REF) {
416 if (SvTYPE(sv) != SVt_PVGV) {
419 if (SvGMAGICAL(sv)) {
425 if (op->op_flags & OPf_REF ||
426 op->op_private & HINT_STRICT_REFS)
427 DIE(no_usym, "an ARRAY");
430 if (GIMME == G_ARRAY)
435 if (op->op_private & HINT_STRICT_REFS)
436 DIE(no_symref, sym, "an ARRAY");
437 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
442 if (op->op_private & OPpLVAL_INTRO)
444 if (op->op_flags & OPf_REF) {
451 if (GIMME == G_ARRAY) {
452 I32 maxarg = AvFILL(av) + 1;
454 if (SvRMAGICAL(av)) {
456 for (i=0; i < maxarg; i++) {
457 SV **svp = av_fetch(av, i, FALSE);
458 SP[i+1] = (svp) ? *svp : &sv_undef;
462 Copy(AvARRAY(av), SP+1, maxarg, SV*);
468 I32 maxarg = AvFILL(av) + 1;
482 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
483 DIE("Not a HASH reference");
484 if (op->op_flags & OPf_REF) {
490 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
492 if (op->op_flags & OPf_REF) {
500 if (SvTYPE(sv) != SVt_PVGV) {
503 if (SvGMAGICAL(sv)) {
509 if (op->op_flags & OPf_REF ||
510 op->op_private & HINT_STRICT_REFS)
511 DIE(no_usym, "a HASH");
514 if (GIMME == G_ARRAY) {
521 if (op->op_private & HINT_STRICT_REFS)
522 DIE(no_symref, sym, "a HASH");
523 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
528 if (op->op_private & OPpLVAL_INTRO)
530 if (op->op_flags & OPf_REF) {
537 if (GIMME == G_ARRAY) { /* array wanted */
543 /* This bit is OK even when hv is really an AV */
545 sv_setpvf(TARG, "%ld/%ld",
546 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
558 SV **lastlelem = stack_sp;
559 SV **lastrelem = stack_base + POPMARK;
560 SV **firstrelem = stack_base + POPMARK + 1;
561 SV **firstlelem = lastrelem + 1;
574 delaymagic = DM_DELAY; /* catch simultaneous items */
576 /* If there's a common identifier on both sides we have to take
577 * special care that assigning the identifier on the left doesn't
578 * clobber a value on the right that's used later in the list.
580 if (op->op_private & OPpASSIGN_COMMON) {
581 for (relem = firstrelem; relem <= lastrelem; relem++) {
584 TAINT_NOT; /* Each item is independent */
585 *relem = sv_mortalcopy(sv);
594 while (lelem <= lastlelem) {
595 TAINT_NOT; /* Each item stands on its own, taintwise. */
597 switch (SvTYPE(sv)) {
600 magic = SvMAGICAL(ary) != 0;
603 av_extend(ary, lastrelem - relem);
605 while (relem <= lastrelem) { /* gobble up all the rest */
611 didstore = av_store(ary,i++,sv);
625 magic = SvMAGICAL(hash) != 0;
628 while (relem < lastrelem) { /* gobble up all the rest */
634 sv = &sv_no, relem++;
635 tmpstr = NEWSV(29,0);
637 sv_setsv(tmpstr,*relem); /* value */
639 didstore = hv_store_ent(hash,sv,tmpstr,0);
641 if (SvSMAGICAL(tmpstr))
644 SvREFCNT_dec(tmpstr);
648 if (relem == lastrelem && dowarn) {
649 if (relem == firstrelem &&
651 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
652 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
653 warn("Reference found where even-sized list expected");
655 warn("Odd number of elements in hash assignment");
660 if (SvTHINKFIRST(sv)) {
661 if (SvREADONLY(sv) && curcop != &compiling) {
662 if (sv != &sv_undef && sv != &sv_yes && sv != &sv_no)
664 if (relem <= lastrelem)
671 if (relem <= lastrelem) {
672 sv_setsv(sv, *relem);
676 sv_setsv(sv, &sv_undef);
681 if (delaymagic & ~DM_DELAY) {
682 if (delaymagic & DM_UID) {
684 (void)setresuid(uid,euid,(Uid_t)-1);
687 (void)setreuid(uid,euid);
690 if ((delaymagic & DM_UID) == DM_RUID) {
692 delaymagic &= ~DM_RUID;
694 # endif /* HAS_SETRUID */
696 if ((delaymagic & DM_UID) == DM_EUID) {
698 delaymagic &= ~DM_EUID;
700 # endif /* HAS_SETEUID */
701 if (delaymagic & DM_UID) {
703 DIE("No setreuid available");
706 # endif /* HAS_SETREUID */
707 #endif /* HAS_SETRESUID */
709 euid = (int)geteuid();
711 if (delaymagic & DM_GID) {
713 (void)setresgid(gid,egid,(Gid_t)-1);
716 (void)setregid(gid,egid);
719 if ((delaymagic & DM_GID) == DM_RGID) {
721 delaymagic &= ~DM_RGID;
723 # endif /* HAS_SETRGID */
725 if ((delaymagic & DM_GID) == DM_EGID) {
727 delaymagic &= ~DM_EGID;
729 # endif /* HAS_SETEGID */
730 if (delaymagic & DM_GID) {
732 DIE("No setregid available");
735 # endif /* HAS_SETREGID */
736 #endif /* HAS_SETRESGID */
738 egid = (int)getegid();
740 tainting |= (uid && (euid != uid || egid != gid));
747 else if (gimme == G_SCALAR) {
750 SETi(lastrelem - firstrelem + 1);
756 SP = firstrelem + (lastlelem - firstlelem);
757 lelem = firstlelem + (relem - firstrelem);
759 *relem++ = (lelem <= lastlelem) ? *lelem++ : &sv_undef;
767 register PMOP *pm = cPMOP;
774 register REGEXP *rx = pm->op_pmregexp;
778 I32 oldsave = savestack_ix;
779 I32 update_minmatch = 1;
782 if (op->op_flags & OPf_STACKED)
788 PUTBACK; /* EVAL blocks need stack_sp. */
792 DIE("panic: do_match");
795 if (pm->op_pmdynflags & PMdf_USED) {
797 if (gimme == G_ARRAY)
802 if (!rx->prelen && curpm) {
804 rx = pm->op_pmregexp;
806 if (rx->minlen > len) goto failure;
808 screamer = ( (SvSCREAM(TARG) && rx->check_substr
809 && SvTYPE(rx->check_substr) == SVt_PVBM
810 && SvVALID(rx->check_substr))
813 if (global = pm->op_pmflags & PMf_GLOBAL) {
815 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
816 MAGIC* mg = mg_find(TARG, 'g');
817 if (mg && mg->mg_len >= 0) {
818 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
819 minmatch = (mg->mg_flags & MGf_MINMATCH);
824 if (!rx->nparens && !global)
825 gimme = G_SCALAR; /* accidental array context? */
826 safebase = (((gimme == G_ARRAY) || global || !rx->nparens)
828 safebase = safebase ? 0 : REXEC_COPY_STR ;
829 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
831 multiline = pm->op_pmflags & PMf_MULTILINE;
835 if (global && rx->startp[0]) {
837 if ((s + rx->minlen) > strend)
839 if (update_minmatch++)
840 minmatch = (s == rx->startp[0]);
842 if (rx->check_substr) {
843 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
847 if (screamfirst[BmRARE(rx->check_substr)] < 0)
849 else if (!(s = screaminstr(TARG, rx->check_substr,
850 rx->check_offset_min, 0, &p, 0)))
852 else if ((rx->reganch & ROPT_CHECK_ALL)
853 && !sawampersand && !SvTAIL(rx->check_substr))
856 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
857 (unsigned char*)strend,
860 else if ((rx->reganch & ROPT_CHECK_ALL) && !sawampersand)
862 if (s && rx->check_offset_max < t - s) {
863 ++BmUSEFUL(rx->check_substr);
864 s -= rx->check_offset_max;
869 /* Now checkstring is fixed, i.e. at fixed offset from the
870 beginning of match, and the match is anchored at s. */
871 else if (!multiline) { /* Anchored near beginning of string. */
873 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
874 || ((slen = SvCUR(rx->check_substr)) > 1
875 && memNE(SvPVX(rx->check_substr),
876 s + rx->check_offset_min, slen)))
879 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
880 && rx->check_substr == rx->float_substr) {
881 SvREFCNT_dec(rx->check_substr);
882 rx->check_substr = Nullsv; /* opt is being useless */
883 rx->float_substr = Nullsv;
886 if (regexec_flags(rx, s, strend, truebase, minmatch,
887 screamer, NULL, safebase))
890 if (pm->op_pmflags & PMf_ONCE)
891 pm->op_pmdynflags |= PMdf_USED;
899 TAINT_IF(RX_MATCH_TAINTED(rx));
900 if (gimme == G_ARRAY) {
904 if (global && !iters)
908 SPAGAIN; /* EVAL blocks could move the stack. */
909 EXTEND(SP, iters + i);
910 EXTEND_MORTAL(iters + i);
911 for (i = !i; i <= iters; i++) {
912 PUSHs(sv_newmortal());
914 if ((s = rx->startp[i]) && rx->endp[i] ) {
915 len = rx->endp[i] - s;
916 sv_setpvn(*SP, s, len);
920 truebase = rx->subbeg;
922 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
924 PUTBACK; /* EVAL blocks may use stack */
927 LEAVE_SCOPE(oldsave);
933 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
934 mg = mg_find(TARG, 'g');
936 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
937 mg = mg_find(TARG, 'g');
940 mg->mg_len = rx->endp[0] - rx->subbeg;
941 if (rx->startp[0] == rx->endp[0])
942 mg->mg_flags |= MGf_MINMATCH;
944 mg->mg_flags &= ~MGf_MINMATCH;
947 LEAVE_SCOPE(oldsave);
951 yup: /* Confirmed by check_substr */
952 TAINT_IF(RX_MATCH_TAINTED(rx));
953 ++BmUSEFUL(rx->check_substr);
955 if (pm->op_pmflags & PMf_ONCE)
956 pm->op_pmdynflags |= PMdf_USED;
957 Safefree(rx->subbase);
958 rx->subbase = Nullch;
960 rx->subbeg = truebase;
963 rx->endp[0] = s + SvCUR(rx->check_substr);
969 tmps = rx->subbase = savepvn(t, strend-t);
971 rx->subend = tmps + (strend-t);
972 tmps = rx->startp[0] = tmps + (s - t);
973 rx->endp[0] = tmps + SvCUR(rx->check_substr);
975 LEAVE_SCOPE(oldsave);
979 if (rx->check_substr)
980 ++BmUSEFUL(rx->check_substr);
983 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
984 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
985 MAGIC* mg = mg_find(TARG, 'g');
990 LEAVE_SCOPE(oldsave);
991 if (gimme == G_ARRAY)
1004 register IO *io = GvIO(last_in_gv);
1005 register I32 type = op->op_type;
1006 I32 gimme = GIMME_V;
1009 if (SvRMAGICAL(last_in_gv) && (mg = mg_find((SV*)last_in_gv, 'q'))) {
1014 perl_call_method("READLINE", gimme);
1017 if (gimme == G_SCALAR)
1018 SvSetMagicSV_nosteal(TARG, TOPs);
1025 if (IoFLAGS(io) & IOf_ARGV) {
1026 if (IoFLAGS(io) & IOf_START) {
1027 IoFLAGS(io) &= ~IOf_START;
1029 if (av_len(GvAVn(last_in_gv)) < 0) {
1030 SV *tmpstr = newSVpv("-", 1); /* assume stdin */
1031 av_push(GvAVn(last_in_gv), tmpstr);
1034 fp = nextargv(last_in_gv);
1035 if (!fp) { /* Note: fp != IoIFP(io) */
1036 (void)do_close(last_in_gv, FALSE); /* now it does*/
1037 IoFLAGS(io) |= IOf_START;
1040 else if (type == OP_GLOB) {
1041 SV *tmpcmd = NEWSV(55, 0);
1045 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1046 /* since spawning off a process is a real performance hit */
1048 #include <descrip.h>
1049 #include <lib$routines.h>
1052 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1053 char vmsspec[NAM$C_MAXRSS+1];
1054 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1055 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1056 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1059 struct dsc$descriptor_s wilddsc
1060 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1061 struct dsc$descriptor_vs rsdsc
1062 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1063 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1065 /* We could find out if there's an explicit dev/dir or version
1066 by peeking into lib$find_file's internal context at
1067 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1068 but that's unsupported, so I don't want to do it now and
1069 have it bite someone in the future. */
1070 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1071 cp = SvPV(tmpglob,i);
1073 if (cp[i] == ';') hasver = 1;
1075 if (sts) hasver = 1;
1079 hasdir = isunix = 1;
1082 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1087 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1089 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1090 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1091 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1092 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1093 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1094 &dfltdsc,NULL,NULL,NULL))&1)) {
1095 end = rstr + (unsigned long int) *rslt;
1096 if (!hasver) while (*end != ';') end--;
1097 *(end++) = '\n'; *end = '\0';
1098 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1100 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1105 while (*(--begin) != ']' && *begin != '>') ;
1108 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1110 if (cxt) (void)lib$find_file_end(&cxt);
1111 if (ok && sts != RMS$_NMF &&
1112 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1115 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1117 PerlIO_close(tmpfp);
1121 PerlIO_rewind(tmpfp);
1123 IoIFP(io) = fp = tmpfp;
1124 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1131 sv_setpv(tmpcmd, "for a in ");
1132 sv_catsv(tmpcmd, tmpglob);
1133 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1136 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1137 sv_catsv(tmpcmd, tmpglob);
1139 sv_setpv(tmpcmd, "perlglob ");
1140 sv_catsv(tmpcmd, tmpglob);
1141 sv_catpv(tmpcmd, " |");
1146 sv_setpvn(tmpcmd, cshname, cshlen);
1147 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1148 sv_catsv(tmpcmd, tmpglob);
1149 sv_catpv(tmpcmd, "' 2>/dev/null |");
1151 sv_setpv(tmpcmd, "echo ");
1152 sv_catsv(tmpcmd, tmpglob);
1154 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1156 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1159 #endif /* !DOSISH */
1160 (void)do_open(last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1161 FALSE, 0, 0, Nullfp);
1167 else if (type == OP_GLOB)
1171 if (dowarn && io && !(IoFLAGS(io) & IOf_START))
1172 warn("Read on closed filehandle <%s>", GvENAME(last_in_gv));
1173 if (gimme == G_SCALAR) {
1174 (void)SvOK_off(TARG);
1179 if (gimme == G_SCALAR) {
1183 (void)SvUPGRADE(sv, SVt_PV);
1184 tmplen = SvLEN(sv); /* remember if already alloced */
1186 Sv_Grow(sv, 80); /* try short-buffering it */
1187 if (type == OP_RCATLINE)
1193 sv = sv_2mortal(NEWSV(57, 80));
1197 if (!sv_gets(sv, fp, offset)) {
1198 PerlIO_clearerr(fp);
1199 if (IoFLAGS(io) & IOf_ARGV) {
1200 fp = nextargv(last_in_gv);
1203 (void)do_close(last_in_gv, FALSE);
1204 IoFLAGS(io) |= IOf_START;
1206 else if (type == OP_GLOB) {
1207 if (do_close(last_in_gv, FALSE) & ~0xFF)
1208 warn("internal error: glob failed");
1210 if (gimme == G_SCALAR) {
1211 (void)SvOK_off(TARG);
1216 /* This should not be marked tainted if the fp is marked clean */
1217 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1224 if (type == OP_GLOB) {
1227 if (SvCUR(sv) > 0 && SvCUR(rs) > 0) {
1228 tmps = SvEND(sv) - 1;
1229 if (*tmps == *SvPVX(rs)) {
1234 for (tmps = SvPVX(sv); *tmps; tmps++)
1235 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1236 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1238 if (*tmps && PerlLIO_stat(SvPVX(sv), &statbuf) < 0) {
1239 (void)POPs; /* Unmatched wildcard? Chuck it... */
1243 if (gimme == G_ARRAY) {
1244 if (SvLEN(sv) - SvCUR(sv) > 20) {
1245 SvLEN_set(sv, SvCUR(sv)+1);
1246 Renew(SvPVX(sv), SvLEN(sv), char);
1248 sv = sv_2mortal(NEWSV(58, 80));
1251 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1252 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1256 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1257 Renew(SvPVX(sv), SvLEN(sv), char);
1266 register PERL_CONTEXT *cx;
1267 I32 gimme = OP_GIMME(op, -1);
1270 if (cxstack_ix >= 0)
1271 gimme = cxstack[cxstack_ix].blk_gimme;
1279 PUSHBLOCK(cx, CXt_BLOCK, SP);
1291 U32 lval = op->op_flags & OPf_MOD;
1292 U32 defer = op->op_private & OPpLVAL_DEFER;
1294 if (SvTYPE(hv) == SVt_PVHV) {
1295 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1296 svp = he ? &HeVAL(he) : 0;
1298 else if (SvTYPE(hv) == SVt_PVAV) {
1299 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1305 if (!svp || *svp == &sv_undef) {
1309 DIE(no_helem, SvPV(keysv, na));
1310 lv = sv_newmortal();
1311 sv_upgrade(lv, SVt_PVLV);
1313 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1314 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1315 LvTARG(lv) = SvREFCNT_inc(hv);
1320 if (op->op_private & OPpLVAL_INTRO) {
1321 if (HvNAME(hv) && isGV(*svp))
1322 save_gp((GV*)*svp, !(op->op_flags & OPf_SPECIAL));
1324 save_helem(hv, keysv, svp);
1326 else if (op->op_private & OPpDEREF)
1327 vivify_ref(*svp, op->op_private & OPpDEREF);
1329 PUSHs(svp ? *svp : &sv_undef);
1336 register PERL_CONTEXT *cx;
1342 if (op->op_flags & OPf_SPECIAL) {
1343 cx = &cxstack[cxstack_ix];
1344 cx->blk_oldpm = curpm; /* fake block should preserve $1 et al */
1349 gimme = OP_GIMME(op, -1);
1351 if (cxstack_ix >= 0)
1352 gimme = cxstack[cxstack_ix].blk_gimme;
1358 if (gimme == G_VOID)
1360 else if (gimme == G_SCALAR) {
1363 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1366 *MARK = sv_mortalcopy(TOPs);
1373 else if (gimme == G_ARRAY) {
1374 /* in case LEAVE wipes old return values */
1375 for (mark = newsp + 1; mark <= SP; mark++) {
1376 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1377 *mark = sv_mortalcopy(*mark);
1378 TAINT_NOT; /* Each item is independent */
1382 curpm = newpm; /* Don't pop $1 et al till now */
1392 register PERL_CONTEXT *cx;
1397 cx = &cxstack[cxstack_ix];
1398 if (cx->cx_type != CXt_LOOP)
1399 DIE("panic: pp_iter");
1401 av = cx->blk_loop.iterary;
1402 if (cx->blk_loop.iterix >= (av == curstack ? cx->blk_oldsp : AvFILL(av)))
1405 SvREFCNT_dec(*cx->blk_loop.itervar);
1407 if (sv = (SvMAGICAL(av))
1408 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1409 : AvARRAY(av)[++cx->blk_loop.iterix])
1413 if (av != curstack && SvIMMORTAL(sv)) {
1414 SV *lv = cx->blk_loop.iterlval;
1415 if (lv && SvREFCNT(lv) > 1) {
1420 SvREFCNT_dec(LvTARG(lv));
1422 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1423 sv_upgrade(lv, SVt_PVLV);
1425 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1427 LvTARG(lv) = SvREFCNT_inc(av);
1428 LvTARGOFF(lv) = cx->blk_loop.iterix;
1429 LvTARGLEN(lv) = (UV) -1;
1433 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1440 register PMOP *pm = cPMOP;
1456 register REGEXP *rx = pm->op_pmregexp;
1458 int force_on_match = 0;
1459 I32 oldsave = savestack_ix;
1460 I32 update_minmatch = 1;
1463 /* known replacement string? */
1464 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1465 if (op->op_flags & OPf_STACKED)
1471 if (SvREADONLY(TARG)
1472 || (SvTYPE(TARG) > SVt_PVLV
1473 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1477 s = SvPV(TARG, len);
1478 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1480 rxtainted = tainted << 1;
1485 DIE("panic: do_subst");
1488 maxiters = (strend - s) + 10;
1490 if (!rx->prelen && curpm) {
1492 rx = pm->op_pmregexp;
1494 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1495 && SvTYPE(rx->check_substr) == SVt_PVBM
1496 && SvVALID(rx->check_substr))
1498 safebase = (!rx->nparens && !sawampersand) ? 0 : REXEC_COPY_STR;
1499 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1501 multiline = pm->op_pmflags & PMf_MULTILINE;
1504 if (rx->check_substr) {
1505 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1509 if (screamfirst[BmRARE(rx->check_substr)] < 0)
1511 else if (!(s = screaminstr(TARG, rx->check_substr, rx->check_offset_min, 0, &p, 0)))
1514 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
1515 (unsigned char*)strend,
1518 if (s && rx->check_offset_max < s - m) {
1519 ++BmUSEFUL(rx->check_substr);
1520 s -= rx->check_offset_max;
1525 /* Now checkstring is fixed, i.e. at fixed offset from the
1526 beginning of match, and the match is anchored at s. */
1527 else if (!multiline) { /* Anchored at beginning of string. */
1529 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
1530 || ((slen = SvCUR(rx->check_substr)) > 1
1531 && memNE(SvPVX(rx->check_substr),
1532 s + rx->check_offset_min, slen)))
1535 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
1536 && rx->check_substr == rx->float_substr) {
1537 SvREFCNT_dec(rx->check_substr);
1538 rx->check_substr = Nullsv; /* opt is being useless */
1539 rx->float_substr = Nullsv;
1543 /* only replace once? */
1544 once = !(rpm->op_pmflags & PMf_GLOBAL);
1546 /* known replacement string? */
1547 c = dstr ? SvPV(dstr, clen) : Nullch;
1549 /* can do inplace substitution? */
1550 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1551 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1552 if (!regexec_flags(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1555 LEAVE_SCOPE(oldsave);
1558 if (force_on_match) {
1560 s = SvPV_force(TARG, len);
1565 SvSCREAM_off(TARG); /* disable possible screamer */
1567 rxtainted |= RX_MATCH_TAINTED(rx);
1569 m = orig + (rx->startp[0] - rx->subbase);
1570 d = orig + (rx->endp[0] - rx->subbase);
1576 if (m - s > strend - d) { /* faster to shorten from end */
1578 Copy(c, m, clen, char);
1583 Move(d, m, i, char);
1587 SvCUR_set(TARG, m - s);
1590 else if (i = m - s) { /* faster from front */
1598 Copy(c, m, clen, char);
1603 Copy(c, d, clen, char);
1608 TAINT_IF(rxtainted & 1);
1614 if (iters++ > maxiters)
1615 DIE("Substitution loop");
1616 rxtainted |= RX_MATCH_TAINTED(rx);
1621 Move(s, d, i, char);
1625 Copy(c, d, clen, char);
1629 } while (regexec_flags(rx, s, strend, orig, s == m,
1630 Nullsv, NULL, 0)); /* don't match same null twice */
1633 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1634 Move(s, d, i+1, char); /* include the NUL */
1636 TAINT_IF(rxtainted & 1);
1638 PUSHs(sv_2mortal(newSViv((I32)iters)));
1640 (void)SvPOK_only(TARG);
1641 TAINT_IF(rxtainted);
1642 if (SvSMAGICAL(TARG)) {
1648 LEAVE_SCOPE(oldsave);
1652 if (regexec_flags(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1653 if (force_on_match) {
1655 s = SvPV_force(TARG, len);
1658 rxtainted |= RX_MATCH_TAINTED(rx);
1659 dstr = NEWSV(25, len);
1660 sv_setpvn(dstr, m, s-m);
1663 register PERL_CONTEXT *cx;
1666 RETURNOP(cPMOP->op_pmreplroot);
1669 if (iters++ > maxiters)
1670 DIE("Substitution loop");
1671 rxtainted |= RX_MATCH_TAINTED(rx);
1672 if (rx->subbase && rx->subbase != orig) {
1677 strend = s + (strend - m);
1680 sv_catpvn(dstr, s, m-s);
1683 sv_catpvn(dstr, c, clen);
1686 } while (regexec_flags(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1687 sv_catpvn(dstr, s, strend - s);
1689 (void)SvOOK_off(TARG);
1690 Safefree(SvPVX(TARG));
1691 SvPVX(TARG) = SvPVX(dstr);
1692 SvCUR_set(TARG, SvCUR(dstr));
1693 SvLEN_set(TARG, SvLEN(dstr));
1697 TAINT_IF(rxtainted & 1);
1699 PUSHs(sv_2mortal(newSViv((I32)iters)));
1701 (void)SvPOK_only(TARG);
1702 TAINT_IF(rxtainted);
1705 LEAVE_SCOPE(oldsave);
1711 ++BmUSEFUL(rx->check_substr);
1716 LEAVE_SCOPE(oldsave);
1725 stack_base[markstack_ptr[-1]++] = stack_base[*markstack_ptr];
1727 LEAVE; /* exit inner scope */
1730 if (stack_base + *markstack_ptr > SP) {
1732 I32 gimme = GIMME_V;
1734 LEAVE; /* exit outer scope */
1735 (void)POPMARK; /* pop src */
1736 items = --*markstack_ptr - markstack_ptr[-1];
1737 (void)POPMARK; /* pop dst */
1738 SP = stack_base + POPMARK; /* pop original mark */
1739 if (gimme == G_SCALAR) {
1743 else if (gimme == G_ARRAY)
1750 ENTER; /* enter inner scope */
1753 src = stack_base[*markstack_ptr];
1757 RETURNOP(cLOGOP->op_other);
1768 register PERL_CONTEXT *cx;
1769 struct block_sub cxsub;
1772 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1775 if (gimme == G_SCALAR) {
1778 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1785 else if (gimme == G_ARRAY) {
1786 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1787 if (!SvTEMP(*MARK)) {
1788 *MARK = sv_mortalcopy(*MARK);
1789 TAINT_NOT; /* Each item is independent */
1795 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1796 curpm = newpm; /* ... and pop $1 et al */
1799 return pop_return();
1803 get_db_sub(SV **svp, CV *cv)
1806 SV *dbsv = GvSV(DBsub);
1808 if (!PERLDB_SUB_NN) {
1812 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1813 || strEQ(GvNAME(gv), "END")
1814 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1815 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1816 && (gv = (GV*)*svp) ))) {
1817 /* Use GV from the stack as a fallback. */
1818 /* GV is potentially non-unique, or contain different CV. */
1819 sv_setsv(dbsv, newRV((SV*)cv));
1822 gv_efullname3(dbsv, gv, Nullch);
1826 SvUPGRADE(dbsv, SVt_PVIV);
1828 SAVEIV(SvIVX(dbsv));
1829 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1844 register PERL_CONTEXT *cx;
1846 bool hasargs = (op->op_flags & OPf_STACKED) != 0;
1849 DIE("Not a CODE reference");
1850 switch (SvTYPE(sv)) {
1855 if (sv == &sv_yes) { /* unfound import, ignore */
1857 SP = stack_base + POPMARK;
1860 if (SvGMAGICAL(sv)) {
1862 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
1867 DIE(no_usym, "a subroutine");
1868 if (op->op_private & HINT_STRICT_REFS)
1869 DIE(no_symref, sym, "a subroutine");
1870 cv = perl_get_cv(sym, TRUE);
1874 if (SvTYPE(cv) == SVt_PVCV)
1879 DIE("Not a CODE reference");
1884 if (!(cv = GvCVu((GV*)sv)))
1885 cv = sv_2cv(sv, &stash, &gv, TRUE);
1894 DIE("Not a CODE reference");
1896 if (!CvROOT(cv) && !CvXSUB(cv)) {
1900 /* anonymous or undef'd function leaves us no recourse */
1901 if (CvANON(cv) || !(gv = CvGV(cv)))
1902 DIE("Undefined subroutine called");
1903 /* autoloaded stub? */
1904 if (cv != GvCV(gv)) {
1908 /* should call AUTOLOAD now? */
1909 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
1916 sub_name = sv_newmortal();
1917 gv_efullname3(sub_name, gv, Nullch);
1918 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
1922 if ((op->op_private & OPpENTERSUB_DB) && GvCV(DBsub) && !CvNODEBUG(cv))
1923 cv = get_db_sub(&sv, cv);
1925 DIE("No DBsub routine");
1929 * First we need to check if the sub or method requires locking.
1930 * If so, we gain a lock on the CV, the first argument or the
1931 * stash (for static methods), as appropriate. This has to be
1932 * inline because for FAKE_THREADS, COND_WAIT inlines code to
1933 * reschedule by returning a new op.
1935 MUTEX_LOCK(CvMUTEXP(cv));
1936 if (CvFLAGS(cv) & CVf_LOCKED) {
1938 if (CvFLAGS(cv) & CVf_METHOD) {
1939 if (SP > stack_base + TOPMARK)
1940 sv = *(stack_base + TOPMARK + 1);
1942 MUTEX_UNLOCK(CvMUTEXP(cv));
1943 croak("no argument for locked method call");
1949 char *stashname = SvPV(sv, len);
1950 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
1956 MUTEX_UNLOCK(CvMUTEXP(cv));
1957 mg = condpair_magic(sv);
1958 MUTEX_LOCK(MgMUTEXP(mg));
1959 if (MgOWNER(mg) == thr)
1960 MUTEX_UNLOCK(MgMUTEXP(mg));
1963 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
1965 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
1967 MUTEX_UNLOCK(MgMUTEXP(mg));
1968 SvREFCNT_inc(sv); /* Keep alive until magic_mutexfree */
1969 save_destructor(unlock_condpair, sv);
1971 MUTEX_LOCK(CvMUTEXP(cv));
1974 * Now we have permission to enter the sub, we must distinguish
1975 * four cases. (0) It's an XSUB (in which case we don't care
1976 * about ownership); (1) it's ours already (and we're recursing);
1977 * (2) it's free (but we may already be using a cached clone);
1978 * (3) another thread owns it. Case (1) is easy: we just use it.
1979 * Case (2) means we look for a clone--if we have one, use it
1980 * otherwise grab ownership of cv. Case (3) means we look for a
1981 * clone (for non-XSUBs) and have to create one if we don't
1983 * Why look for a clone in case (2) when we could just grab
1984 * ownership of cv straight away? Well, we could be recursing,
1985 * i.e. we originally tried to enter cv while another thread
1986 * owned it (hence we used a clone) but it has been freed up
1987 * and we're now recursing into it. It may or may not be "better"
1988 * to use the clone but at least CvDEPTH can be trusted.
1990 if (CvOWNER(cv) == thr || CvXSUB(cv))
1991 MUTEX_UNLOCK(CvMUTEXP(cv));
1993 /* Case (2) or (3) */
1997 * XXX Might it be better to release CvMUTEXP(cv) while we
1998 * do the hv_fetch? We might find someone has pinched it
1999 * when we look again, in which case we would be in case
2000 * (3) instead of (2) so we'd have to clone. Would the fact
2001 * that we released the mutex more quickly make up for this?
2004 (svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2006 /* We already have a clone to use */
2007 MUTEX_UNLOCK(CvMUTEXP(cv));
2009 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2010 "entersub: %p already has clone %p:%s\n",
2011 thr, cv, SvPEEK((SV*)cv)));
2014 if (CvDEPTH(cv) == 0)
2015 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2018 /* (2) => grab ownership of cv. (3) => make clone */
2022 MUTEX_UNLOCK(CvMUTEXP(cv));
2023 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2024 "entersub: %p grabbing %p:%s in stash %s\n",
2025 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2026 HvNAME(CvSTASH(cv)) : "(none)"));
2028 /* Make a new clone. */
2030 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2031 MUTEX_UNLOCK(CvMUTEXP(cv));
2032 DEBUG_L((PerlIO_printf(PerlIO_stderr(),
2033 "entersub: %p cloning %p:%s\n",
2034 thr, cv, SvPEEK((SV*)cv))));
2036 * We're creating a new clone so there's no race
2037 * between the original MUTEX_UNLOCK and the
2038 * SvREFCNT_inc since no one will be trying to undef
2039 * it out from underneath us. At least, I don't think
2042 clonecv = cv_clone(cv);
2043 SvREFCNT_dec(cv); /* finished with this */
2044 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2045 CvOWNER(clonecv) = thr;
2049 DEBUG_L(if (CvDEPTH(cv) != 0)
2050 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2052 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2055 #endif /* USE_THREADS */
2058 if (CvOLDSTYLE(cv)) {
2059 I32 (*fp3)_((int,int,int));
2061 register I32 items = SP - MARK;
2062 /* We dont worry to copy from @_. */
2067 stack_sp = mark + 1;
2068 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2069 items = (*fp3)(CvXSUBANY(cv).any_i32,
2070 MARK - stack_base + 1,
2072 stack_sp = stack_base + items;
2075 I32 markix = TOPMARK;
2080 /* Need to copy @_ to stack. Alternative may be to
2081 * switch stack to @_, and copy return values
2082 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2086 av = (AV*)curpad[0];
2089 #endif /* USE_THREADS */
2090 items = AvFILLp(av) + 1; /* @_ is not tieable */
2093 /* Mark is at the end of the stack. */
2095 Copy(AvARRAY(av), SP + 1, items, SV*);
2100 if (curcopdb) { /* We assume that the first
2101 XSUB in &DB::sub is the
2107 /* Do we need to open block here? XXXX */
2108 (void)(*CvXSUB(cv))(cv);
2110 /* Enforce some sanity in scalar context. */
2111 if (gimme == G_SCALAR && ++markix != stack_sp - stack_base ) {
2112 if (markix > stack_sp - stack_base)
2113 *(stack_base + markix) = &sv_undef;
2115 *(stack_base + markix) = *stack_sp;
2116 stack_sp = stack_base + markix;
2124 register I32 items = SP - MARK;
2125 AV* padlist = CvPADLIST(cv);
2126 SV** svp = AvARRAY(padlist);
2127 push_return(op->op_next);
2128 PUSHBLOCK(cx, CXt_SUB, MARK);
2131 if (CvDEPTH(cv) < 2)
2132 (void)SvREFCNT_inc(cv);
2133 else { /* save temporaries on recursion? */
2134 if (CvDEPTH(cv) == 100 && dowarn
2135 && !(PERLDB_SUB && cv == GvCV(DBsub)))
2136 sub_crush_depth(cv);
2137 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2139 AV *newpad = newAV();
2140 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2141 I32 ix = AvFILLp((AV*)svp[1]);
2142 svp = AvARRAY(svp[0]);
2143 for ( ;ix > 0; ix--) {
2144 if (svp[ix] != &sv_undef) {
2145 char *name = SvPVX(svp[ix]);
2146 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2147 || *name == '&') /* anonymous code? */
2149 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2151 else { /* our own lexical */
2153 av_store(newpad, ix, sv = (SV*)newAV());
2154 else if (*name == '%')
2155 av_store(newpad, ix, sv = (SV*)newHV());
2157 av_store(newpad, ix, sv = NEWSV(0,0));
2162 av_store(newpad, ix, sv = NEWSV(0,0));
2166 av = newAV(); /* will be @_ */
2168 av_store(newpad, 0, (SV*)av);
2169 AvFLAGS(av) = AVf_REIFY;
2170 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2171 AvFILLp(padlist) = CvDEPTH(cv);
2172 svp = AvARRAY(padlist);
2177 AV* av = (AV*)curpad[0];
2179 items = AvFILLp(av) + 1;
2181 /* Mark is at the end of the stack. */
2183 Copy(AvARRAY(av), SP + 1, items, SV*);
2188 #endif /* USE_THREADS */
2190 curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2193 #endif /* USE_THREADS */
2199 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2200 "%p entersub preparing @_\n", thr));
2202 av = (AV*)curpad[0];
2208 cx->blk_sub.savearray = GvAV(defgv);
2209 GvAV(defgv) = (AV*)SvREFCNT_inc(av);
2210 #endif /* USE_THREADS */
2211 cx->blk_sub.argarray = av;
2214 if (items > AvMAX(av) + 1) {
2216 if (AvARRAY(av) != ary) {
2217 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2218 SvPVX(av) = (char*)ary;
2220 if (items > AvMAX(av) + 1) {
2221 AvMAX(av) = items - 1;
2222 Renew(ary,items,SV*);
2224 SvPVX(av) = (char*)ary;
2227 Copy(MARK,AvARRAY(av),items,SV*);
2228 AvFILLp(av) = items - 1;
2237 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2238 "%p entersub returning %p\n", thr, CvSTART(cv)));
2240 RETURNOP(CvSTART(cv));
2245 sub_crush_depth(CV *cv)
2248 warn("Deep recursion on anonymous subroutine");
2250 SV* tmpstr = sv_newmortal();
2251 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2252 warn("Deep recursion on subroutine \"%s\"", SvPVX(tmpstr));
2262 U32 lval = op->op_flags & OPf_MOD;
2263 U32 defer = (op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2266 elem -= curcop->cop_arybase;
2267 if (SvTYPE(av) != SVt_PVAV)
2269 svp = av_fetch(av, elem, lval && !defer);
2271 if (!svp || *svp == &sv_undef) {
2274 DIE(no_aelem, elem);
2275 lv = sv_newmortal();
2276 sv_upgrade(lv, SVt_PVLV);
2278 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2279 LvTARG(lv) = SvREFCNT_inc(av);
2280 LvTARGOFF(lv) = elem;
2285 if (op->op_private & OPpLVAL_INTRO)
2286 save_aelem(av, elem, svp);
2287 else if (op->op_private & OPpDEREF)
2288 vivify_ref(*svp, op->op_private & OPpDEREF);
2290 PUSHs(svp ? *svp : &sv_undef);
2295 vivify_ref(SV *sv, U32 to_what)
2302 if (SvTYPE(sv) < SVt_RV)
2303 sv_upgrade(sv, SVt_RV);
2304 else if (SvTYPE(sv) >= SVt_PV) {
2305 (void)SvOOK_off(sv);
2306 Safefree(SvPVX(sv));
2307 SvLEN(sv) = SvCUR(sv) = 0;
2311 SvRV(sv) = NEWSV(355,0);
2314 SvRV(sv) = (SV*)newAV();
2317 SvRV(sv) = (SV*)newHV();
2338 if (SvTYPE(sv) == SVt_PVCV) {
2344 name = SvPV(TOPs, na);
2345 sv = *(stack_base + TOPMARK + 1);
2356 !(packname = SvPV(sv, packlen)) ||
2357 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2358 !(ob=(SV*)GvIO(iogv)))
2360 if (!packname || !isIDFIRST(*packname))
2361 DIE("Can't call method \"%s\" without a package or object reference", name);
2362 stash = gv_stashpvn(packname, packlen, TRUE);
2365 *(stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2368 if (!ob || !SvOBJECT(ob))
2369 DIE("Can't call method \"%s\" on unblessed reference", name);
2371 stash = SvSTASH(ob);
2374 gv = gv_fetchmethod(stash, name);
2380 for (p = name; *p; p++) {
2382 sep = p, leaf = p + 1;
2383 else if (*p == ':' && *(p + 1) == ':')
2384 sep = p, leaf = p + 2;
2386 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2387 packname = HvNAME(sep ? curcop->cop_stash : stash);
2388 packlen = strlen(packname);
2392 packlen = sep - name;
2394 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2395 leaf, (int)packlen, packname);
2397 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);