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)
187 vivify_ref(curpad[op->op_targ], op->op_private & OPpDEREF);
194 last_in_gv = (GV*)(*stack_sp--);
195 return do_readline();
200 djSP; tryAMAGICbinSET(eq,0);
203 SETs(boolSV(TOPn == value));
211 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
213 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
214 SvIVX(TOPs) != IV_MAX)
217 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
232 RETURNOP(cLOGOP->op_other);
238 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
241 SETn( left + right );
249 AV *av = GvAV((GV*)cSVOP->op_sv);
250 SV** svp = av_fetch(av, op->op_private, op->op_flags & OPf_MOD);
251 PUSHs(svp ? *svp : &sv_undef);
257 djSP; dMARK; dTARGET;
259 do_join(TARG, *MARK, MARK, SP);
270 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
271 * will be enough to hold an OP*.
273 SV* sv = sv_newmortal();
274 sv_upgrade(sv, SVt_PVLV);
276 Copy(&op, &LvTARGOFF(sv), 1, OP*);
284 /* Oversized hot code. */
288 djSP; dMARK; dORIGMARK;
294 if (op->op_flags & OPf_STACKED)
298 if (SvMAGICAL(gv) && (mg = mg_find((SV*)gv, 'q'))) {
299 if (MARK == ORIGMARK) {
302 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
309 perl_call_method("PRINT", G_SCALAR);
317 if (!(io = GvIO(gv))) {
319 SV* sv = sv_newmortal();
320 gv_fullname3(sv, gv, Nullch);
321 warn("Filehandle %s never opened", SvPV(sv,na));
324 SETERRNO(EBADF,RMS$_IFI);
327 else if (!(fp = IoOFP(io))) {
329 SV* sv = sv_newmortal();
330 gv_fullname3(sv, gv, Nullch);
332 warn("Filehandle %s opened only for input", SvPV(sv,na));
334 warn("print on closed filehandle %s", SvPV(sv,na));
336 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
343 if (!do_print(*MARK, fp))
347 if (PerlIO_write(fp, ofs, ofslen) == 0 || PerlIO_error(fp)) {
356 if (!do_print(*MARK, fp))
365 if (PerlIO_write(fp, ors, orslen) == 0 || PerlIO_error(fp))
368 if (IoFLAGS(io) & IOf_FLUSH)
369 if (PerlIO_flush(fp) == EOF)
391 if (SvTYPE(av) != SVt_PVAV)
392 DIE("Not an ARRAY reference");
393 if (op->op_flags & OPf_REF) {
399 if (SvTYPE(sv) == SVt_PVAV) {
401 if (op->op_flags & OPf_REF) {
409 if (SvTYPE(sv) != SVt_PVGV) {
412 if (SvGMAGICAL(sv)) {
418 if (op->op_flags & OPf_REF ||
419 op->op_private & HINT_STRICT_REFS)
420 DIE(no_usym, "an ARRAY");
423 if (GIMME == G_ARRAY)
428 if (op->op_private & HINT_STRICT_REFS)
429 DIE(no_symref, sym, "an ARRAY");
430 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
435 if (op->op_private & OPpLVAL_INTRO)
437 if (op->op_flags & OPf_REF) {
444 if (GIMME == G_ARRAY) {
445 I32 maxarg = AvFILL(av) + 1;
447 Copy(AvARRAY(av), SP+1, maxarg, SV*);
452 I32 maxarg = AvFILL(av) + 1;
466 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
467 DIE("Not a HASH reference");
468 if (op->op_flags & OPf_REF) {
474 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
476 if (op->op_flags & OPf_REF) {
484 if (SvTYPE(sv) != SVt_PVGV) {
487 if (SvGMAGICAL(sv)) {
493 if (op->op_flags & OPf_REF ||
494 op->op_private & HINT_STRICT_REFS)
495 DIE(no_usym, "a HASH");
498 if (GIMME == G_ARRAY) {
505 if (op->op_private & HINT_STRICT_REFS)
506 DIE(no_symref, sym, "a HASH");
507 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
512 if (op->op_private & OPpLVAL_INTRO)
514 if (op->op_flags & OPf_REF) {
521 if (GIMME == G_ARRAY) { /* array wanted */
527 /* This bit is OK even when hv is really an AV */
529 sv_setpvf(TARG, "%ld/%ld",
530 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
542 SV **lastlelem = stack_sp;
543 SV **lastrelem = stack_base + POPMARK;
544 SV **firstrelem = stack_base + POPMARK + 1;
545 SV **firstlelem = lastrelem + 1;
558 delaymagic = DM_DELAY; /* catch simultaneous items */
560 /* If there's a common identifier on both sides we have to take
561 * special care that assigning the identifier on the left doesn't
562 * clobber a value on the right that's used later in the list.
564 if (op->op_private & OPpASSIGN_COMMON) {
565 for (relem = firstrelem; relem <= lastrelem; relem++) {
568 TAINT_NOT; /* Each item is independent */
569 *relem = sv_mortalcopy(sv);
578 while (lelem <= lastlelem) {
579 TAINT_NOT; /* Each item stands on its own, taintwise. */
581 switch (SvTYPE(sv)) {
584 magic = SvMAGICAL(ary) != 0;
587 av_extend(ary, lastrelem - relem);
589 while (relem <= lastrelem) { /* gobble up all the rest */
595 didstore = av_store(ary,i++,sv);
609 magic = SvMAGICAL(hash) != 0;
612 while (relem < lastrelem) { /* gobble up all the rest */
618 sv = &sv_no, relem++;
619 tmpstr = NEWSV(29,0);
621 sv_setsv(tmpstr,*relem); /* value */
623 didstore = hv_store_ent(hash,sv,tmpstr,0);
625 if (SvSMAGICAL(tmpstr))
628 SvREFCNT_dec(tmpstr);
632 if (relem == lastrelem && dowarn)
633 warn("Odd number of elements in hash list");
637 if (SvTHINKFIRST(sv)) {
638 if (SvREADONLY(sv) && curcop != &compiling) {
639 if (sv != &sv_undef && sv != &sv_yes && sv != &sv_no)
641 if (relem <= lastrelem)
648 if (relem <= lastrelem) {
649 sv_setsv(sv, *relem);
653 sv_setsv(sv, &sv_undef);
658 if (delaymagic & ~DM_DELAY) {
659 if (delaymagic & DM_UID) {
661 (void)setresuid(uid,euid,(Uid_t)-1);
664 (void)setreuid(uid,euid);
667 if ((delaymagic & DM_UID) == DM_RUID) {
669 delaymagic &= ~DM_RUID;
671 # endif /* HAS_SETRUID */
673 if ((delaymagic & DM_UID) == DM_EUID) {
675 delaymagic &= ~DM_EUID;
677 # endif /* HAS_SETEUID */
678 if (delaymagic & DM_UID) {
680 DIE("No setreuid available");
683 # endif /* HAS_SETREUID */
684 #endif /* HAS_SETRESUID */
686 euid = (int)geteuid();
688 if (delaymagic & DM_GID) {
690 (void)setresgid(gid,egid,(Gid_t)-1);
693 (void)setregid(gid,egid);
696 if ((delaymagic & DM_GID) == DM_RGID) {
698 delaymagic &= ~DM_RGID;
700 # endif /* HAS_SETRGID */
702 if ((delaymagic & DM_GID) == DM_EGID) {
704 delaymagic &= ~DM_EGID;
706 # endif /* HAS_SETEGID */
707 if (delaymagic & DM_GID) {
709 DIE("No setregid available");
712 # endif /* HAS_SETREGID */
713 #endif /* HAS_SETRESGID */
715 egid = (int)getegid();
717 tainting |= (uid && (euid != uid || egid != gid));
724 else if (gimme == G_SCALAR) {
727 SETi(lastrelem - firstrelem + 1);
733 SP = firstrelem + (lastlelem - firstlelem);
734 lelem = firstlelem + (relem - firstrelem);
736 *relem++ = (lelem <= lastlelem) ? *lelem++ : &sv_undef;
744 register PMOP *pm = cPMOP;
751 register REGEXP *rx = pm->op_pmregexp;
755 I32 oldsave = savestack_ix;
756 I32 update_minmatch = 1;
759 if (op->op_flags & OPf_STACKED)
765 PUTBACK; /* EVAL blocks need stack_sp. */
769 DIE("panic: do_match");
772 if (pm->op_pmflags & PMf_USED) {
774 if (gimme == G_ARRAY)
779 if (!rx->prelen && curpm) {
781 rx = pm->op_pmregexp;
783 if (rx->minlen > len) goto failure;
785 screamer = ( (SvSCREAM(TARG) && rx->check_substr
786 && SvTYPE(rx->check_substr) == SVt_PVBM
787 && SvVALID(rx->check_substr))
790 if (global = pm->op_pmflags & PMf_GLOBAL) {
792 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
793 MAGIC* mg = mg_find(TARG, 'g');
794 if (mg && mg->mg_len >= 0) {
795 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
796 minmatch = (mg->mg_flags & MGf_MINMATCH);
801 if (!rx->nparens && !global)
802 gimme = G_SCALAR; /* accidental array context? */
803 safebase = (((gimme == G_ARRAY) || global || !rx->nparens)
805 safebase = safebase ? 0 : REXEC_COPY_STR ;
806 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
808 multiline = pm->op_pmflags & PMf_MULTILINE;
812 if (global && rx->startp[0]) {
814 if ((s + rx->minlen) > strend)
816 if (update_minmatch++)
817 minmatch = (s == rx->startp[0]);
819 if (rx->check_substr) {
820 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
824 if (screamfirst[BmRARE(rx->check_substr)] < 0)
826 else if (!(s = screaminstr(TARG, rx->check_substr,
827 rx->check_offset_min, 0, &p, 0)))
829 else if ((rx->reganch & ROPT_CHECK_ALL)
830 && !sawampersand && !SvTAIL(rx->check_substr))
833 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
834 (unsigned char*)strend,
837 else if ((rx->reganch & ROPT_CHECK_ALL) && !sawampersand)
839 if (s && rx->check_offset_max < t - s) {
840 ++BmUSEFUL(rx->check_substr);
841 s -= rx->check_offset_max;
846 /* Now checkstring is fixed, i.e. at fixed offset from the
847 beginning of match, and the match is anchored at s. */
848 else if (!multiline) { /* Anchored near beginning of string. */
850 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
851 || ((slen = SvCUR(rx->check_substr)) > 1
852 && memNE(SvPVX(rx->check_substr),
853 s + rx->check_offset_min, slen)))
856 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
857 && rx->check_substr == rx->float_substr) {
858 SvREFCNT_dec(rx->check_substr);
859 rx->check_substr = Nullsv; /* opt is being useless */
860 rx->float_substr = Nullsv;
863 if (regexec_flags(rx, s, strend, truebase, minmatch,
864 screamer, NULL, safebase))
867 if (pm->op_pmflags & PMf_ONCE)
868 pm->op_pmflags |= PMf_USED;
876 TAINT_IF(RX_MATCH_TAINTED(rx));
877 if (gimme == G_ARRAY) {
881 if (global && !iters)
885 SPAGAIN; /* EVAL blocks could move the stack. */
886 EXTEND(SP, iters + i);
887 EXTEND_MORTAL(iters + i);
888 for (i = !i; i <= iters; i++) {
889 PUSHs(sv_newmortal());
891 if ((s = rx->startp[i]) && rx->endp[i] ) {
892 len = rx->endp[i] - s;
893 sv_setpvn(*SP, s, len);
897 truebase = rx->subbeg;
899 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
901 PUTBACK; /* EVAL blocks may use stack */
904 LEAVE_SCOPE(oldsave);
910 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
911 mg = mg_find(TARG, 'g');
913 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
914 mg = mg_find(TARG, 'g');
917 mg->mg_len = rx->endp[0] - rx->subbeg;
918 if (rx->startp[0] == rx->endp[0])
919 mg->mg_flags |= MGf_MINMATCH;
921 mg->mg_flags &= ~MGf_MINMATCH;
924 LEAVE_SCOPE(oldsave);
928 yup: /* Confirmed by check_substr */
929 TAINT_IF(RX_MATCH_TAINTED(rx));
930 ++BmUSEFUL(rx->check_substr);
932 if (pm->op_pmflags & PMf_ONCE)
933 pm->op_pmflags |= PMf_USED;
934 Safefree(rx->subbase);
935 rx->subbase = Nullch;
937 rx->subbeg = truebase;
940 rx->endp[0] = s + SvCUR(rx->check_substr);
946 tmps = rx->subbase = savepvn(t, strend-t);
948 rx->subend = tmps + (strend-t);
949 tmps = rx->startp[0] = tmps + (s - t);
950 rx->endp[0] = tmps + SvCUR(rx->check_substr);
952 LEAVE_SCOPE(oldsave);
956 if (rx->check_substr)
957 ++BmUSEFUL(rx->check_substr);
960 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
961 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
962 MAGIC* mg = mg_find(TARG, 'g');
967 LEAVE_SCOPE(oldsave);
968 if (gimme == G_ARRAY)
981 register IO *io = GvIO(last_in_gv);
982 register I32 type = op->op_type;
986 if (SvMAGICAL(last_in_gv) && (mg = mg_find((SV*)last_in_gv, 'q'))) {
991 perl_call_method("READLINE", gimme);
994 if (gimme == G_SCALAR)
995 SvSetMagicSV_nosteal(TARG, TOPs);
1002 if (IoFLAGS(io) & IOf_ARGV) {
1003 if (IoFLAGS(io) & IOf_START) {
1004 IoFLAGS(io) &= ~IOf_START;
1006 if (av_len(GvAVn(last_in_gv)) < 0) {
1007 SV *tmpstr = newSVpv("-", 1); /* assume stdin */
1008 av_push(GvAVn(last_in_gv), tmpstr);
1011 fp = nextargv(last_in_gv);
1012 if (!fp) { /* Note: fp != IoIFP(io) */
1013 (void)do_close(last_in_gv, FALSE); /* now it does*/
1014 IoFLAGS(io) |= IOf_START;
1017 else if (type == OP_GLOB) {
1018 SV *tmpcmd = NEWSV(55, 0);
1022 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1023 /* since spawning off a process is a real performance hit */
1025 #include <descrip.h>
1026 #include <lib$routines.h>
1029 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1030 char vmsspec[NAM$C_MAXRSS+1];
1031 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1032 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1033 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1036 struct dsc$descriptor_s wilddsc
1037 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1038 struct dsc$descriptor_vs rsdsc
1039 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1040 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1042 /* We could find out if there's an explicit dev/dir or version
1043 by peeking into lib$find_file's internal context at
1044 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1045 but that's unsupported, so I don't want to do it now and
1046 have it bite someone in the future. */
1047 strcat(tmpfnam,tmpnam(NULL));
1048 cp = SvPV(tmpglob,i);
1050 if (cp[i] == ';') hasver = 1;
1052 if (sts) hasver = 1;
1056 hasdir = isunix = 1;
1059 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1064 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1065 ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1066 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1067 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1068 &dfltdsc,NULL,NULL,NULL))&1)) {
1069 end = rstr + (unsigned long int) *rslt;
1070 if (!hasver) while (*end != ';') end--;
1071 *(end++) = '\n'; *end = '\0';
1072 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1074 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1079 while (*(--begin) != ']' && *begin != '>') ;
1082 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1084 if (cxt) (void)lib$find_file_end(&cxt);
1085 if (ok && sts != RMS$_NMF &&
1086 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1089 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1091 PerlIO_close(tmpfp);
1095 PerlIO_rewind(tmpfp);
1097 IoIFP(io) = fp = tmpfp;
1098 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1105 sv_setpv(tmpcmd, "for a in ");
1106 sv_catsv(tmpcmd, tmpglob);
1107 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1110 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1111 sv_catsv(tmpcmd, tmpglob);
1113 sv_setpv(tmpcmd, "perlglob ");
1114 sv_catsv(tmpcmd, tmpglob);
1115 sv_catpv(tmpcmd, " |");
1120 sv_setpvn(tmpcmd, cshname, cshlen);
1121 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1122 sv_catsv(tmpcmd, tmpglob);
1123 sv_catpv(tmpcmd, "' 2>/dev/null |");
1125 sv_setpv(tmpcmd, "echo ");
1126 sv_catsv(tmpcmd, tmpglob);
1128 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1130 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1133 #endif /* !DOSISH */
1134 (void)do_open(last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1135 FALSE, 0, 0, Nullfp);
1141 else if (type == OP_GLOB)
1145 if (dowarn && io && !(IoFLAGS(io) & IOf_START))
1146 warn("Read on closed filehandle <%s>", GvENAME(last_in_gv));
1147 if (gimme == G_SCALAR) {
1148 (void)SvOK_off(TARG);
1153 if (gimme == G_SCALAR) {
1157 (void)SvUPGRADE(sv, SVt_PV);
1158 tmplen = SvLEN(sv); /* remember if already alloced */
1160 Sv_Grow(sv, 80); /* try short-buffering it */
1161 if (type == OP_RCATLINE)
1167 sv = sv_2mortal(NEWSV(57, 80));
1171 if (!sv_gets(sv, fp, offset)) {
1172 PerlIO_clearerr(fp);
1173 if (IoFLAGS(io) & IOf_ARGV) {
1174 fp = nextargv(last_in_gv);
1177 (void)do_close(last_in_gv, FALSE);
1178 IoFLAGS(io) |= IOf_START;
1180 else if (type == OP_GLOB) {
1181 if (do_close(last_in_gv, FALSE) & ~0xFF)
1182 warn("internal error: glob failed");
1184 if (gimme == G_SCALAR) {
1185 (void)SvOK_off(TARG);
1190 /* This should not be marked tainted if the fp is marked clean */
1191 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1198 if (type == OP_GLOB) {
1201 if (SvCUR(sv) > 0 && SvCUR(rs) > 0) {
1202 tmps = SvEND(sv) - 1;
1203 if (*tmps == *SvPVX(rs)) {
1208 for (tmps = SvPVX(sv); *tmps; tmps++)
1209 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1210 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1212 if (*tmps && Stat(SvPVX(sv), &statbuf) < 0) {
1213 (void)POPs; /* Unmatched wildcard? Chuck it... */
1217 if (gimme == G_ARRAY) {
1218 if (SvLEN(sv) - SvCUR(sv) > 20) {
1219 SvLEN_set(sv, SvCUR(sv)+1);
1220 Renew(SvPVX(sv), SvLEN(sv), char);
1222 sv = sv_2mortal(NEWSV(58, 80));
1225 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1226 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1230 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1231 Renew(SvPVX(sv), SvLEN(sv), char);
1240 register PERL_CONTEXT *cx;
1241 I32 gimme = OP_GIMME(op, -1);
1244 if (cxstack_ix >= 0)
1245 gimme = cxstack[cxstack_ix].blk_gimme;
1253 PUSHBLOCK(cx, CXt_BLOCK, sp);
1265 U32 lval = op->op_flags & OPf_MOD;
1266 U32 defer = op->op_private & OPpLVAL_DEFER;
1268 if (SvTYPE(hv) == SVt_PVHV) {
1269 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1270 svp = he ? &HeVAL(he) : 0;
1272 else if (SvTYPE(hv) == SVt_PVAV) {
1273 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1279 if (!svp || *svp == &sv_undef) {
1283 DIE(no_helem, SvPV(keysv, na));
1284 lv = sv_newmortal();
1285 sv_upgrade(lv, SVt_PVLV);
1287 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1288 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1289 LvTARG(lv) = SvREFCNT_inc(hv);
1294 if (op->op_private & OPpLVAL_INTRO) {
1295 if (HvNAME(hv) && isGV(*svp))
1296 save_gp((GV*)*svp, !(op->op_flags & OPf_SPECIAL));
1300 else if (op->op_private & OPpDEREF)
1301 vivify_ref(*svp, op->op_private & OPpDEREF);
1303 PUSHs(svp ? *svp : &sv_undef);
1310 register PERL_CONTEXT *cx;
1316 if (op->op_flags & OPf_SPECIAL) {
1317 cx = &cxstack[cxstack_ix];
1318 cx->blk_oldpm = curpm; /* fake block should preserve $1 et al */
1323 gimme = OP_GIMME(op, -1);
1325 if (cxstack_ix >= 0)
1326 gimme = cxstack[cxstack_ix].blk_gimme;
1332 if (gimme == G_VOID)
1334 else if (gimme == G_SCALAR) {
1337 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1340 *MARK = sv_mortalcopy(TOPs);
1347 else if (gimme == G_ARRAY) {
1348 /* in case LEAVE wipes old return values */
1349 for (mark = newsp + 1; mark <= SP; mark++) {
1350 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1351 *mark = sv_mortalcopy(*mark);
1352 TAINT_NOT; /* Each item is independent */
1356 curpm = newpm; /* Don't pop $1 et al till now */
1366 register PERL_CONTEXT *cx;
1371 cx = &cxstack[cxstack_ix];
1372 if (cx->cx_type != CXt_LOOP)
1373 DIE("panic: pp_iter");
1375 av = cx->blk_loop.iterary;
1376 if (cx->blk_loop.iterix >= (av == curstack ? cx->blk_oldsp : AvFILL(av)))
1379 SvREFCNT_dec(*cx->blk_loop.itervar);
1381 if (sv = AvARRAY(av)[++cx->blk_loop.iterix])
1385 if (av != curstack && SvIMMORTAL(sv)) {
1386 SV *lv = cx->blk_loop.iterlval;
1387 if (lv && SvREFCNT(lv) > 1) {
1392 SvREFCNT_dec(LvTARG(lv));
1394 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1395 sv_upgrade(lv, SVt_PVLV);
1397 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1399 LvTARG(lv) = SvREFCNT_inc(av);
1400 LvTARGOFF(lv) = cx->blk_loop.iterix;
1401 LvTARGLEN(lv) = (UV) -1;
1405 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1412 register PMOP *pm = cPMOP;
1428 register REGEXP *rx = pm->op_pmregexp;
1430 int force_on_match = 0;
1431 I32 oldsave = savestack_ix;
1432 I32 update_minmatch = 1;
1435 /* known replacement string? */
1436 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1437 if (op->op_flags & OPf_STACKED)
1443 if (SvREADONLY(TARG)
1444 || (SvTYPE(TARG) > SVt_PVLV
1445 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1447 s = SvPV(TARG, len);
1448 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1454 DIE("panic: do_subst");
1457 maxiters = (strend - s) + 10;
1459 if (!rx->prelen && curpm) {
1461 rx = pm->op_pmregexp;
1463 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1464 && SvTYPE(rx->check_substr) == SVt_PVBM
1465 && SvVALID(rx->check_substr))
1467 safebase = (!rx->nparens && !sawampersand) ? 0 : REXEC_COPY_STR;
1468 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1470 multiline = pm->op_pmflags & PMf_MULTILINE;
1473 if (rx->check_substr) {
1474 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1478 if (screamfirst[BmRARE(rx->check_substr)] < 0)
1480 else if (!(s = screaminstr(TARG, rx->check_substr, rx->check_offset_min, 0, &p, 0)))
1483 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
1484 (unsigned char*)strend,
1487 if (s && rx->check_offset_max < s - m) {
1488 ++BmUSEFUL(rx->check_substr);
1489 s -= rx->check_offset_max;
1494 /* Now checkstring is fixed, i.e. at fixed offset from the
1495 beginning of match, and the match is anchored at s. */
1496 else if (!multiline) { /* Anchored at beginning of string. */
1498 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
1499 || ((slen = SvCUR(rx->check_substr)) > 1
1500 && memNE(SvPVX(rx->check_substr),
1501 s + rx->check_offset_min, slen)))
1504 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
1505 && rx->check_substr == rx->float_substr) {
1506 SvREFCNT_dec(rx->check_substr);
1507 rx->check_substr = Nullsv; /* opt is being useless */
1508 rx->float_substr = Nullsv;
1512 /* only replace once? */
1513 once = !(rpm->op_pmflags & PMf_GLOBAL);
1515 /* known replacement string? */
1516 c = dstr ? SvPV(dstr, clen) : Nullch;
1518 /* can do inplace substitution? */
1519 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1520 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1521 if (!regexec_flags(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1523 LEAVE_SCOPE(oldsave);
1526 if (force_on_match) {
1528 s = SvPV_force(TARG, len);
1533 SvSCREAM_off(TARG); /* disable possible screamer */
1535 rxtainted = RX_MATCH_TAINTED(rx);
1537 m = orig + (rx->startp[0] - rx->subbase);
1538 d = orig + (rx->endp[0] - rx->subbase);
1544 if (m - s > strend - d) { /* faster to shorten from end */
1546 Copy(c, m, clen, char);
1551 Move(d, m, i, char);
1555 SvCUR_set(TARG, m - s);
1558 else if (i = m - s) { /* faster from front */
1566 Copy(c, m, clen, char);
1571 Copy(c, d, clen, char);
1576 TAINT_IF(rxtainted);
1582 if (iters++ > maxiters)
1583 DIE("Substitution loop");
1584 rxtainted |= RX_MATCH_TAINTED(rx);
1589 Move(s, d, i, char);
1593 Copy(c, d, clen, char);
1597 } while (regexec_flags(rx, s, strend, orig, s == m,
1598 Nullsv, NULL, 0)); /* don't match same null twice */
1601 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1602 Move(s, d, i+1, char); /* include the NUL */
1604 TAINT_IF(rxtainted);
1605 PUSHs(sv_2mortal(newSViv((I32)iters)));
1607 (void)SvPOK_only(TARG);
1610 LEAVE_SCOPE(oldsave);
1614 if (regexec_flags(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1615 if (force_on_match) {
1617 s = SvPV_force(TARG, len);
1620 rxtainted = RX_MATCH_TAINTED(rx);
1621 dstr = NEWSV(25, sv_len(TARG));
1622 sv_setpvn(dstr, m, s-m);
1625 register PERL_CONTEXT *cx;
1627 RETURNOP(cPMOP->op_pmreplroot);
1630 if (iters++ > maxiters)
1631 DIE("Substitution loop");
1632 rxtainted |= RX_MATCH_TAINTED(rx);
1633 if (rx->subbase && rx->subbase != orig) {
1638 strend = s + (strend - m);
1641 sv_catpvn(dstr, s, m-s);
1644 sv_catpvn(dstr, c, clen);
1647 } while (regexec_flags(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1648 sv_catpvn(dstr, s, strend - s);
1650 TAINT_IF(rxtainted);
1652 (void)SvOOK_off(TARG);
1653 Safefree(SvPVX(TARG));
1654 SvPVX(TARG) = SvPVX(dstr);
1655 SvCUR_set(TARG, SvCUR(dstr));
1656 SvLEN_set(TARG, SvLEN(dstr));
1660 (void)SvPOK_only(TARG);
1663 PUSHs(sv_2mortal(newSViv((I32)iters)));
1664 LEAVE_SCOPE(oldsave);
1670 ++BmUSEFUL(rx->check_substr);
1674 LEAVE_SCOPE(oldsave);
1683 stack_base[markstack_ptr[-1]++] = stack_base[*markstack_ptr];
1685 LEAVE; /* exit inner scope */
1688 if (stack_base + *markstack_ptr > sp) {
1690 I32 gimme = GIMME_V;
1692 LEAVE; /* exit outer scope */
1693 (void)POPMARK; /* pop src */
1694 items = --*markstack_ptr - markstack_ptr[-1];
1695 (void)POPMARK; /* pop dst */
1696 SP = stack_base + POPMARK; /* pop original mark */
1697 if (gimme == G_SCALAR) {
1701 else if (gimme == G_ARRAY)
1708 ENTER; /* enter inner scope */
1711 src = stack_base[*markstack_ptr];
1715 RETURNOP(cLOGOP->op_other);
1726 register PERL_CONTEXT *cx;
1727 struct block_sub cxsub;
1730 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1733 if (gimme == G_SCALAR) {
1736 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1743 else if (gimme == G_ARRAY) {
1744 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1745 if (!SvTEMP(*MARK)) {
1746 *MARK = sv_mortalcopy(*MARK);
1747 TAINT_NOT; /* Each item is independent */
1753 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1754 curpm = newpm; /* ... and pop $1 et al */
1757 return pop_return();
1761 get_db_sub(SV **svp, CV *cv)
1770 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1771 || strEQ(GvNAME(gv), "END")
1772 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1773 !( (SvTYPE(oldsv) == SVt_PVGV) && (GvCV((GV*)oldsv) == cv)
1774 && (gv = (GV*)oldsv) ))) {
1775 /* Use GV from the stack as a fallback. */
1776 /* GV is potentially non-unique, or contain different CV. */
1777 sv_setsv(*svp, newRV((SV*)cv));
1780 gv_efullname3(*svp, gv, Nullch);
1794 register PERL_CONTEXT *cx;
1796 bool hasargs = (op->op_flags & OPf_STACKED) != 0;
1799 DIE("Not a CODE reference");
1800 switch (SvTYPE(sv)) {
1805 if (sv == &sv_yes) { /* unfound import, ignore */
1807 SP = stack_base + POPMARK;
1810 if (SvGMAGICAL(sv)) {
1812 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
1817 DIE(no_usym, "a subroutine");
1818 if (op->op_private & HINT_STRICT_REFS)
1819 DIE(no_symref, sym, "a subroutine");
1820 cv = perl_get_cv(sym, TRUE);
1824 if (SvTYPE(cv) == SVt_PVCV)
1829 DIE("Not a CODE reference");
1834 if (!(cv = GvCVu((GV*)sv)))
1835 cv = sv_2cv(sv, &stash, &gv, TRUE);
1844 DIE("Not a CODE reference");
1846 if (!CvROOT(cv) && !CvXSUB(cv)) {
1850 /* anonymous or undef'd function leaves us no recourse */
1851 if (CvANON(cv) || !(gv = CvGV(cv)))
1852 DIE("Undefined subroutine called");
1853 /* autoloaded stub? */
1854 if (cv != GvCV(gv)) {
1858 /* should call AUTOLOAD now? */
1859 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
1866 sub_name = sv_newmortal();
1867 gv_efullname3(sub_name, gv, Nullch);
1868 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
1872 if ((op->op_private & OPpENTERSUB_DB) && GvCV(DBsub) && !CvNODEBUG(cv))
1873 cv = get_db_sub(&sv, cv);
1875 DIE("No DBsub routine");
1879 * First we need to check if the sub or method requires locking.
1880 * If so, we gain a lock on the CV, the first argument or the
1881 * stash (for static methods), as appropriate. This has to be
1882 * inline because for FAKE_THREADS, COND_WAIT inlines code to
1883 * reschedule by returning a new op.
1885 MUTEX_LOCK(CvMUTEXP(cv));
1886 if (CvFLAGS(cv) & CVf_LOCKED) {
1888 if (CvFLAGS(cv) & CVf_METHOD) {
1889 if (SP > stack_base + TOPMARK)
1890 sv = *(stack_base + TOPMARK + 1);
1892 MUTEX_UNLOCK(CvMUTEXP(cv));
1893 croak("no argument for locked method call");
1899 char *stashname = SvPV(sv, len);
1900 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
1906 MUTEX_UNLOCK(CvMUTEXP(cv));
1907 mg = condpair_magic(sv);
1908 MUTEX_LOCK(MgMUTEXP(mg));
1909 if (MgOWNER(mg) == thr)
1910 MUTEX_UNLOCK(MgMUTEXP(mg));
1913 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
1915 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
1917 MUTEX_UNLOCK(MgMUTEXP(mg));
1918 SvREFCNT_inc(sv); /* Keep alive until magic_mutexfree */
1919 save_destructor(unlock_condpair, sv);
1921 MUTEX_LOCK(CvMUTEXP(cv));
1924 * Now we have permission to enter the sub, we must distinguish
1925 * four cases. (0) It's an XSUB (in which case we don't care
1926 * about ownership); (1) it's ours already (and we're recursing);
1927 * (2) it's free (but we may already be using a cached clone);
1928 * (3) another thread owns it. Case (1) is easy: we just use it.
1929 * Case (2) means we look for a clone--if we have one, use it
1930 * otherwise grab ownership of cv. Case (3) means we look for a
1931 * clone (for non-XSUBs) and have to create one if we don't
1933 * Why look for a clone in case (2) when we could just grab
1934 * ownership of cv straight away? Well, we could be recursing,
1935 * i.e. we originally tried to enter cv while another thread
1936 * owned it (hence we used a clone) but it has been freed up
1937 * and we're now recursing into it. It may or may not be "better"
1938 * to use the clone but at least CvDEPTH can be trusted.
1940 if (CvOWNER(cv) == thr || CvXSUB(cv))
1941 MUTEX_UNLOCK(CvMUTEXP(cv));
1943 /* Case (2) or (3) */
1947 * XXX Might it be better to release CvMUTEXP(cv) while we
1948 * do the hv_fetch? We might find someone has pinched it
1949 * when we look again, in which case we would be in case
1950 * (3) instead of (2) so we'd have to clone. Would the fact
1951 * that we released the mutex more quickly make up for this?
1953 svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE);
1955 /* We already have a clone to use */
1956 MUTEX_UNLOCK(CvMUTEXP(cv));
1958 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1959 "entersub: %p already has clone %p:%s\n",
1960 thr, cv, SvPEEK((SV*)cv)));
1963 if (CvDEPTH(cv) == 0)
1964 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
1967 /* (2) => grab ownership of cv. (3) => make clone */
1971 MUTEX_UNLOCK(CvMUTEXP(cv));
1972 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
1973 "entersub: %p grabbing %p:%s in stash %s\n",
1974 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
1975 HvNAME(CvSTASH(cv)) : "(none)"));
1977 /* Make a new clone. */
1979 SvREFCNT_inc(cv); /* don't let it vanish from under us */
1980 MUTEX_UNLOCK(CvMUTEXP(cv));
1981 DEBUG_L((PerlIO_printf(PerlIO_stderr(),
1982 "entersub: %p cloning %p:%s\n",
1983 thr, cv, SvPEEK((SV*)cv))));
1985 * We're creating a new clone so there's no race
1986 * between the original MUTEX_UNLOCK and the
1987 * SvREFCNT_inc since no one will be trying to undef
1988 * it out from underneath us. At least, I don't think
1991 clonecv = cv_clone(cv);
1992 SvREFCNT_dec(cv); /* finished with this */
1993 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
1994 CvOWNER(clonecv) = thr;
1998 DEBUG_L(if (CvDEPTH(cv) != 0)
1999 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2001 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2004 #endif /* USE_THREADS */
2009 if (CvOLDSTYLE(cv)) {
2010 I32 (*fp3)_((int,int,int));
2012 register I32 items = SP - MARK;
2013 /* We dont worry to copy from @_. */
2018 stack_sp = mark + 1;
2019 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2020 items = (*fp3)(CvXSUBANY(cv).any_i32,
2021 MARK - stack_base + 1,
2023 stack_sp = stack_base + items;
2026 I32 markix = TOPMARK;
2031 /* Need to copy @_ to stack. Alternative may be to
2032 * switch stack to @_, and copy return values
2033 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2037 av = (AV*)curpad[0];
2040 #endif /* USE_THREADS */
2041 items = AvFILL(av) + 1;
2044 /* Mark is at the end of the stack. */
2046 Copy(AvARRAY(av), sp + 1, items, SV*);
2051 if (curcopdb) { /* We assume that the first
2052 XSUB in &DB::sub is the
2058 /* Do we need to open block here? XXXX */
2059 (void)(*CvXSUB(cv))(cv);
2061 /* Enforce some sanity in scalar context. */
2062 if (gimme == G_SCALAR && ++markix != stack_sp - stack_base ) {
2063 if (markix > stack_sp - stack_base)
2064 *(stack_base + markix) = &sv_undef;
2066 *(stack_base + markix) = *stack_sp;
2067 stack_sp = stack_base + markix;
2075 register I32 items = SP - MARK;
2076 AV* padlist = CvPADLIST(cv);
2077 SV** svp = AvARRAY(padlist);
2078 push_return(op->op_next);
2079 PUSHBLOCK(cx, CXt_SUB, MARK);
2082 if (CvDEPTH(cv) < 2)
2083 (void)SvREFCNT_inc(cv);
2084 else { /* save temporaries on recursion? */
2085 if (CvDEPTH(cv) == 100 && dowarn
2086 && !(PERLDB_SUB && cv == GvCV(DBsub)))
2087 sub_crush_depth(cv);
2088 if (CvDEPTH(cv) > AvFILL(padlist)) {
2090 AV *newpad = newAV();
2091 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2092 I32 ix = AvFILL((AV*)svp[1]);
2093 svp = AvARRAY(svp[0]);
2094 for ( ;ix > 0; ix--) {
2095 if (svp[ix] != &sv_undef) {
2096 char *name = SvPVX(svp[ix]);
2097 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2098 || *name == '&') /* anonymous code? */
2100 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2102 else { /* our own lexical */
2104 av_store(newpad, ix, sv = (SV*)newAV());
2105 else if (*name == '%')
2106 av_store(newpad, ix, sv = (SV*)newHV());
2108 av_store(newpad, ix, sv = NEWSV(0,0));
2113 av_store(newpad, ix, sv = NEWSV(0,0));
2117 av = newAV(); /* will be @_ */
2119 av_store(newpad, 0, (SV*)av);
2120 AvFLAGS(av) = AVf_REIFY;
2121 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2122 AvFILL(padlist) = CvDEPTH(cv);
2123 svp = AvARRAY(padlist);
2128 AV* av = (AV*)curpad[0];
2130 items = AvFILL(av) + 1;
2132 /* Mark is at the end of the stack. */
2134 Copy(AvARRAY(av), sp + 1, items, SV*);
2139 #endif /* USE_THREADS */
2141 curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2144 #endif /* USE_THREADS */
2150 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2151 "%p entersub preparing @_\n", thr));
2153 av = (AV*)curpad[0];
2159 cx->blk_sub.savearray = GvAV(defgv);
2160 GvAV(defgv) = (AV*)SvREFCNT_inc(av);
2161 #endif /* USE_THREADS */
2162 cx->blk_sub.argarray = av;
2165 if (items > AvMAX(av) + 1) {
2167 if (AvARRAY(av) != ary) {
2168 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2169 SvPVX(av) = (char*)ary;
2171 if (items > AvMAX(av) + 1) {
2172 AvMAX(av) = items - 1;
2173 Renew(ary,items,SV*);
2175 SvPVX(av) = (char*)ary;
2178 Copy(MARK,AvARRAY(av),items,SV*);
2179 AvFILL(av) = items - 1;
2188 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2189 "%p entersub returning %p\n", thr, CvSTART(cv)));
2191 RETURNOP(CvSTART(cv));
2196 sub_crush_depth(CV *cv)
2199 warn("Deep recursion on anonymous subroutine");
2201 SV* tmpstr = sv_newmortal();
2202 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2203 warn("Deep recursion on subroutine \"%s\"", SvPVX(tmpstr));
2213 U32 lval = op->op_flags & OPf_MOD;
2214 U32 defer = (op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2217 elem -= curcop->cop_arybase;
2218 if (SvTYPE(av) != SVt_PVAV)
2220 svp = av_fetch(av, elem, lval && !defer);
2222 if (!svp || *svp == &sv_undef) {
2225 DIE(no_aelem, elem);
2226 lv = sv_newmortal();
2227 sv_upgrade(lv, SVt_PVLV);
2229 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2230 LvTARG(lv) = SvREFCNT_inc(av);
2231 LvTARGOFF(lv) = elem;
2236 if (op->op_private & OPpLVAL_INTRO)
2238 else if (op->op_private & OPpDEREF)
2239 vivify_ref(*svp, op->op_private & OPpDEREF);
2241 PUSHs(svp ? *svp : &sv_undef);
2246 vivify_ref(SV *sv, U32 to_what)
2253 if (SvTYPE(sv) < SVt_RV)
2254 sv_upgrade(sv, SVt_RV);
2255 else if (SvTYPE(sv) >= SVt_PV) {
2256 (void)SvOOK_off(sv);
2257 Safefree(SvPVX(sv));
2258 SvLEN(sv) = SvCUR(sv) = 0;
2262 SvRV(sv) = newSV(0);
2265 SvRV(sv) = (SV*)newAV();
2268 SvRV(sv) = (SV*)newHV();
2289 if (SvTYPE(sv) == SVt_PVCV) {
2295 name = SvPV(TOPs, na);
2296 sv = *(stack_base + TOPMARK + 1);
2307 !(packname = SvPV(sv, packlen)) ||
2308 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2309 !(ob=(SV*)GvIO(iogv)))
2311 if (!packname || !isIDFIRST(*packname))
2312 DIE("Can't call method \"%s\" without a package or object reference", name);
2313 stash = gv_stashpvn(packname, packlen, TRUE);
2316 *(stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2319 if (!ob || !SvOBJECT(ob))
2320 DIE("Can't call method \"%s\" on unblessed reference", name);
2322 stash = SvSTASH(ob);
2325 gv = gv_fetchmethod(stash, name);
2331 for (p = name; *p; p++) {
2333 sep = p, leaf = p + 1;
2334 else if (*p == ':' && *(p + 1) == ':')
2335 sep = p, leaf = p + 2;
2337 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2338 packname = HvNAME(sep ? curcop->cop_stash : stash);
2339 packlen = strlen(packname);
2343 packlen = sep - name;
2345 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2346 leaf, (int)packlen, packname);
2348 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);