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 */
58 PL_curcop = (COP*)PL_op;
59 TAINT_NOT; /* Each statement is presumed innocent */
60 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
69 if (PL_op->op_private & OPpLVAL_INTRO)
70 PUSHs(save_scalar(cGVOP->op_gv));
72 PUSHs(GvSV(cGVOP->op_gv));
83 PUSHMARK(PL_stack_sp);
93 sv_setpvn(TARG,s,len);
101 XPUSHs((SV*)cGVOP->op_gv);
112 RETURNOP(cLOGOP->op_other);
121 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
123 temp = left; left = right; right = temp;
125 if (PL_tainting && PL_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 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
147 oldsave = PL_scopestack[PL_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 (PL_op->op_flags & OPf_MOD) {
184 if (PL_op->op_private & OPpLVAL_INTRO)
185 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
186 else if (PL_op->op_private & OPpDEREF) {
188 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
197 PL_last_in_gv = (GV*)(*PL_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 = PL_op->op_flags & OPf_MOD;
254 SV** svp = av_fetch(av, PL_op->op_private, lval);
255 SV *sv = (svp ? *svp : &PL_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(&PL_op, &LvTARGOFF(sv), 1, OP*);
292 /* Oversized hot code. */
296 djSP; dMARK; dORIGMARK;
302 if (PL_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,PL_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,PL_na));
345 warn("print on closed filehandle %s", SvPV(sv,PL_na));
347 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
354 if (!do_print(*MARK, fp))
358 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
367 if (!do_print(*MARK, fp))
376 if (PerlIO_write(fp, PL_ors, PL_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 (PL_op->op_flags & OPf_REF) {
410 if (SvTYPE(sv) == SVt_PVAV) {
412 if (PL_op->op_flags & OPf_REF) {
420 if (SvTYPE(sv) != SVt_PVGV) {
423 if (SvGMAGICAL(sv)) {
429 if (PL_op->op_flags & OPf_REF ||
430 PL_op->op_private & HINT_STRICT_REFS)
431 DIE(no_usym, "an ARRAY");
434 if (GIMME == G_ARRAY)
438 sym = SvPV(sv,PL_na);
439 if (PL_op->op_private & HINT_STRICT_REFS)
440 DIE(no_symref, sym, "an ARRAY");
441 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
446 if (PL_op->op_private & OPpLVAL_INTRO)
448 if (PL_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 : &PL_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 (PL_op->op_flags & OPf_REF) {
494 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
496 if (PL_op->op_flags & OPf_REF) {
504 if (SvTYPE(sv) != SVt_PVGV) {
507 if (SvGMAGICAL(sv)) {
513 if (PL_op->op_flags & OPf_REF ||
514 PL_op->op_private & HINT_STRICT_REFS)
515 DIE(no_usym, "a HASH");
518 if (GIMME == G_ARRAY) {
524 sym = SvPV(sv,PL_na);
525 if (PL_op->op_private & HINT_STRICT_REFS)
526 DIE(no_symref, sym, "a HASH");
527 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
532 if (PL_op->op_private & OPpLVAL_INTRO)
534 if (PL_op->op_flags & OPf_REF) {
541 if (GIMME == G_ARRAY) { /* array wanted */
542 *PL_stack_sp = (SV*)hv;
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 = PL_stack_sp;
564 SV **lastrelem = PL_stack_base + POPMARK;
565 SV **firstrelem = PL_stack_base + POPMARK + 1;
566 SV **firstlelem = lastrelem + 1;
579 PL_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 (PL_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 = &PL_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) && PL_curcop != &PL_compiling) {
683 if (relem <= lastrelem)
690 if (relem <= lastrelem) {
691 sv_setsv(sv, *relem);
695 sv_setsv(sv, &PL_sv_undef);
700 if (PL_delaymagic & ~DM_DELAY) {
701 if (PL_delaymagic & DM_UID) {
703 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
706 (void)setreuid(PL_uid,PL_euid);
709 if ((PL_delaymagic & DM_UID) == DM_RUID) {
710 (void)setruid(PL_uid);
711 PL_delaymagic &= ~DM_RUID;
713 # endif /* HAS_SETRUID */
715 if ((PL_delaymagic & DM_UID) == DM_EUID) {
716 (void)seteuid(PL_uid);
717 PL_delaymagic &= ~DM_EUID;
719 # endif /* HAS_SETEUID */
720 if (PL_delaymagic & DM_UID) {
721 if (PL_uid != PL_euid)
722 DIE("No setreuid available");
723 (void)PerlProc_setuid(PL_uid);
725 # endif /* HAS_SETREUID */
726 #endif /* HAS_SETRESUID */
727 PL_uid = (int)PerlProc_getuid();
728 PL_euid = (int)PerlProc_geteuid();
730 if (PL_delaymagic & DM_GID) {
732 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
735 (void)setregid(PL_gid,PL_egid);
738 if ((PL_delaymagic & DM_GID) == DM_RGID) {
739 (void)setrgid(PL_gid);
740 PL_delaymagic &= ~DM_RGID;
742 # endif /* HAS_SETRGID */
744 if ((PL_delaymagic & DM_GID) == DM_EGID) {
745 (void)setegid(PL_gid);
746 PL_delaymagic &= ~DM_EGID;
748 # endif /* HAS_SETEGID */
749 if (PL_delaymagic & DM_GID) {
750 if (PL_gid != PL_egid)
751 DIE("No setregid available");
752 (void)PerlProc_setgid(PL_gid);
754 # endif /* HAS_SETREGID */
755 #endif /* HAS_SETRESGID */
756 PL_gid = (int)PerlProc_getgid();
757 PL_egid = (int)PerlProc_getegid();
759 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_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++ : &PL_sv_undef;
786 register PMOP *pm = cPMOP;
787 SV *rv = sv_newmortal();
788 SV *sv = newSVrv(rv, "Regexp");
789 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
796 register PMOP *pm = cPMOP;
803 register REGEXP *rx = pm->op_pmregexp;
808 I32 oldsave = PL_savestack_ix;
809 I32 update_minmatch = 1;
812 if (PL_op->op_flags & OPf_STACKED)
818 PUTBACK; /* EVAL blocks need stack_sp. */
822 DIE("panic: do_match");
823 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
824 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
827 if (pm->op_pmdynflags & PMdf_USED) {
829 if (gimme == G_ARRAY)
834 if (!rx->prelen && PL_curpm) {
836 rx = pm->op_pmregexp;
838 if (rx->minlen > len) goto failure;
840 screamer = ( (SvSCREAM(TARG) && rx->check_substr
841 && SvTYPE(rx->check_substr) == SVt_PVBM
842 && SvVALID(rx->check_substr))
845 if (global = pm->op_pmflags & PMf_GLOBAL) {
847 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
848 MAGIC* mg = mg_find(TARG, 'g');
849 if (mg && mg->mg_len >= 0) {
850 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
851 minmatch = (mg->mg_flags & MGf_MINMATCH);
856 safebase = (((gimme == G_ARRAY) || global || !rx->nparens)
857 && !PL_sawampersand);
858 safebase = safebase ? 0 : REXEC_COPY_STR ;
859 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
860 SAVEINT(PL_multiline);
861 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
865 if (global && rx->startp[0]) {
867 if ((s + rx->minlen) > strend)
869 if (update_minmatch++)
870 minmatch = (s == rx->startp[0]);
872 if (rx->check_substr) {
873 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
877 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
879 else if (!(s = screaminstr(TARG, rx->check_substr,
880 rx->check_offset_min, 0, &p, 0)))
882 else if ((rx->reganch & ROPT_CHECK_ALL)
883 && !PL_sawampersand && !SvTAIL(rx->check_substr))
886 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
887 (unsigned char*)strend,
888 rx->check_substr, 0)))
890 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
892 if (s && rx->check_offset_max < s - t) {
893 ++BmUSEFUL(rx->check_substr);
894 s -= rx->check_offset_max;
899 /* Now checkstring is fixed, i.e. at fixed offset from the
900 beginning of match, and the match is anchored at s. */
901 else if (!PL_multiline) { /* Anchored near beginning of string. */
903 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
904 || ((slen = SvCUR(rx->check_substr)) > 1
905 && memNE(SvPVX(rx->check_substr),
906 s + rx->check_offset_min, slen)))
909 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
910 && rx->check_substr == rx->float_substr) {
911 SvREFCNT_dec(rx->check_substr);
912 rx->check_substr = Nullsv; /* opt is being useless */
913 rx->float_substr = Nullsv;
916 if (CALLREGEXEC(rx, s, strend, truebase, minmatch,
917 screamer, NULL, safebase))
920 if (pm->op_pmflags & PMf_ONCE)
921 pm->op_pmdynflags |= PMdf_USED;
930 RX_MATCH_TAINTED_on(rx);
931 TAINT_IF(RX_MATCH_TAINTED(rx));
932 if (gimme == G_ARRAY) {
936 if (global && !iters)
940 SPAGAIN; /* EVAL blocks could move the stack. */
941 EXTEND(SP, iters + i);
942 EXTEND_MORTAL(iters + i);
943 for (i = !i; i <= iters; i++) {
944 PUSHs(sv_newmortal());
946 if ((s = rx->startp[i]) && rx->endp[i] ) {
947 len = rx->endp[i] - s;
948 sv_setpvn(*SP, s, len);
952 truebase = rx->subbeg;
954 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
956 PUTBACK; /* EVAL blocks may use stack */
961 LEAVE_SCOPE(oldsave);
967 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
968 mg = mg_find(TARG, 'g');
970 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
971 mg = mg_find(TARG, 'g');
974 mg->mg_len = rx->endp[0] - rx->subbeg;
975 if (rx->startp[0] == rx->endp[0])
976 mg->mg_flags |= MGf_MINMATCH;
978 mg->mg_flags &= ~MGf_MINMATCH;
981 LEAVE_SCOPE(oldsave);
985 yup: /* Confirmed by check_substr */
987 RX_MATCH_TAINTED_on(rx);
988 TAINT_IF(RX_MATCH_TAINTED(rx));
989 ++BmUSEFUL(rx->check_substr);
991 if (pm->op_pmflags & PMf_ONCE)
992 pm->op_pmdynflags |= PMdf_USED;
993 Safefree(rx->subbase);
994 rx->subbase = Nullch;
996 rx->subbeg = truebase;
999 rx->endp[0] = s + SvCUR(rx->check_substr);
1002 if (PL_sawampersand) {
1005 tmps = rx->subbase = savepvn(t, strend-t);
1007 rx->subend = tmps + (strend-t);
1008 tmps = rx->startp[0] = tmps + (s - t);
1009 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1011 LEAVE_SCOPE(oldsave);
1015 if (rx->check_substr)
1016 ++BmUSEFUL(rx->check_substr);
1019 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1020 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1021 MAGIC* mg = mg_find(TARG, 'g');
1026 LEAVE_SCOPE(oldsave);
1027 if (gimme == G_ARRAY)
1035 dSP; dTARGETSTACKED;
1040 register IO *io = GvIO(PL_last_in_gv);
1041 register I32 type = PL_op->op_type;
1042 I32 gimme = GIMME_V;
1045 if (SvRMAGICAL(PL_last_in_gv) && (mg = mg_find((SV*)PL_last_in_gv, 'q'))) {
1050 perl_call_method("READLINE", gimme);
1053 if (gimme == G_SCALAR)
1054 SvSetMagicSV_nosteal(TARG, TOPs);
1061 if (IoFLAGS(io) & IOf_ARGV) {
1062 if (IoFLAGS(io) & IOf_START) {
1063 IoFLAGS(io) &= ~IOf_START;
1065 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1066 do_open(PL_last_in_gv,"-",1,FALSE,0,0,Nullfp);
1067 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1068 SvSETMAGIC(GvSV(PL_last_in_gv));
1073 fp = nextargv(PL_last_in_gv);
1074 if (!fp) { /* Note: fp != IoIFP(io) */
1075 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1076 IoFLAGS(io) |= IOf_START;
1079 else if (type == OP_GLOB) {
1080 SV *tmpcmd = NEWSV(55, 0);
1084 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1085 /* since spawning off a process is a real performance hit */
1087 #include <descrip.h>
1088 #include <lib$routines.h>
1091 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1092 char vmsspec[NAM$C_MAXRSS+1];
1093 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1094 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1095 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1098 struct dsc$descriptor_s wilddsc
1099 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1100 struct dsc$descriptor_vs rsdsc
1101 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1102 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1104 /* We could find out if there's an explicit dev/dir or version
1105 by peeking into lib$find_file's internal context at
1106 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1107 but that's unsupported, so I don't want to do it now and
1108 have it bite someone in the future. */
1109 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1110 cp = SvPV(tmpglob,i);
1112 if (cp[i] == ';') hasver = 1;
1114 if (sts) hasver = 1;
1118 hasdir = isunix = 1;
1121 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1126 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1128 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1129 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1130 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1131 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1132 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1133 &dfltdsc,NULL,NULL,NULL))&1)) {
1134 end = rstr + (unsigned long int) *rslt;
1135 if (!hasver) while (*end != ';') end--;
1136 *(end++) = '\n'; *end = '\0';
1137 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1139 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1144 while (*(--begin) != ']' && *begin != '>') ;
1147 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1149 if (cxt) (void)lib$find_file_end(&cxt);
1150 if (ok && sts != RMS$_NMF &&
1151 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1154 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1156 PerlIO_close(tmpfp);
1160 PerlIO_rewind(tmpfp);
1162 IoIFP(io) = fp = tmpfp;
1163 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1170 sv_setpv(tmpcmd, "for a in ");
1171 sv_catsv(tmpcmd, tmpglob);
1172 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1175 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1176 sv_catsv(tmpcmd, tmpglob);
1178 sv_setpv(tmpcmd, "perlglob ");
1179 sv_catsv(tmpcmd, tmpglob);
1180 sv_catpv(tmpcmd, " |");
1185 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1186 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1187 sv_catsv(tmpcmd, tmpglob);
1188 sv_catpv(tmpcmd, "' 2>/dev/null |");
1190 sv_setpv(tmpcmd, "echo ");
1191 sv_catsv(tmpcmd, tmpglob);
1193 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1195 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1198 #endif /* !DOSISH */
1199 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1200 FALSE, 0, 0, Nullfp);
1206 else if (type == OP_GLOB)
1210 if (PL_dowarn && io && !(IoFLAGS(io) & IOf_START))
1211 warn("Read on closed filehandle <%s>", GvENAME(PL_last_in_gv));
1212 if (gimme == G_SCALAR) {
1213 (void)SvOK_off(TARG);
1219 if (gimme == G_SCALAR) {
1223 (void)SvUPGRADE(sv, SVt_PV);
1224 tmplen = SvLEN(sv); /* remember if already alloced */
1226 Sv_Grow(sv, 80); /* try short-buffering it */
1227 if (type == OP_RCATLINE)
1233 sv = sv_2mortal(NEWSV(57, 80));
1237 if (!sv_gets(sv, fp, offset)) {
1238 PerlIO_clearerr(fp);
1239 if (IoFLAGS(io) & IOf_ARGV) {
1240 fp = nextargv(PL_last_in_gv);
1243 (void)do_close(PL_last_in_gv, FALSE);
1244 IoFLAGS(io) |= IOf_START;
1246 else if (type == OP_GLOB) {
1247 if (do_close(PL_last_in_gv, FALSE) & ~0xFF)
1248 warn("internal error: glob failed");
1250 if (gimme == G_SCALAR) {
1251 (void)SvOK_off(TARG);
1256 /* This should not be marked tainted if the fp is marked clean */
1257 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1264 if (type == OP_GLOB) {
1267 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1268 tmps = SvEND(sv) - 1;
1269 if (*tmps == *SvPVX(PL_rs)) {
1274 for (tmps = SvPVX(sv); *tmps; tmps++)
1275 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1276 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1278 if (*tmps && PerlLIO_stat(SvPVX(sv), &PL_statbuf) < 0) {
1279 (void)POPs; /* Unmatched wildcard? Chuck it... */
1283 if (gimme == G_ARRAY) {
1284 if (SvLEN(sv) - SvCUR(sv) > 20) {
1285 SvLEN_set(sv, SvCUR(sv)+1);
1286 Renew(SvPVX(sv), SvLEN(sv), char);
1288 sv = sv_2mortal(NEWSV(58, 80));
1291 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1292 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1296 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1297 Renew(SvPVX(sv), SvLEN(sv), char);
1306 register PERL_CONTEXT *cx;
1307 I32 gimme = OP_GIMME(PL_op, -1);
1310 if (cxstack_ix >= 0)
1311 gimme = cxstack[cxstack_ix].blk_gimme;
1319 PUSHBLOCK(cx, CXt_BLOCK, SP);
1331 U32 lval = PL_op->op_flags & OPf_MOD;
1332 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1335 if (SvTYPE(hv) == SVt_PVHV) {
1336 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1337 svp = he ? &HeVAL(he) : 0;
1339 else if (SvTYPE(hv) == SVt_PVAV) {
1340 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1346 if (!svp || *svp == &PL_sv_undef) {
1350 DIE(no_helem, SvPV(keysv, PL_na));
1351 lv = sv_newmortal();
1352 sv_upgrade(lv, SVt_PVLV);
1354 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1355 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1356 LvTARG(lv) = SvREFCNT_inc(hv);
1361 if (PL_op->op_private & OPpLVAL_INTRO) {
1362 if (HvNAME(hv) && isGV(*svp))
1363 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1365 save_helem(hv, keysv, svp);
1367 else if (PL_op->op_private & OPpDEREF)
1368 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1370 sv = (svp ? *svp : &PL_sv_undef);
1371 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1372 * Pushing the magical RHS on to the stack is useless, since
1373 * that magic is soon destined to be misled by the local(),
1374 * and thus the later pp_sassign() will fail to mg_get() the
1375 * old value. This should also cure problems with delayed
1376 * mg_get()s. GSAR 98-07-03 */
1377 if (!lval && SvGMAGICAL(sv))
1378 sv = sv_mortalcopy(sv);
1386 register PERL_CONTEXT *cx;
1392 if (PL_op->op_flags & OPf_SPECIAL) {
1393 cx = &cxstack[cxstack_ix];
1394 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1399 gimme = OP_GIMME(PL_op, -1);
1401 if (cxstack_ix >= 0)
1402 gimme = cxstack[cxstack_ix].blk_gimme;
1408 if (gimme == G_VOID)
1410 else if (gimme == G_SCALAR) {
1413 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1416 *MARK = sv_mortalcopy(TOPs);
1419 *MARK = &PL_sv_undef;
1423 else if (gimme == G_ARRAY) {
1424 /* in case LEAVE wipes old return values */
1425 for (mark = newsp + 1; mark <= SP; mark++) {
1426 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1427 *mark = sv_mortalcopy(*mark);
1428 TAINT_NOT; /* Each item is independent */
1432 PL_curpm = newpm; /* Don't pop $1 et al till now */
1442 register PERL_CONTEXT *cx;
1447 cx = &cxstack[cxstack_ix];
1448 if (cx->cx_type != CXt_LOOP)
1449 DIE("panic: pp_iter");
1451 av = cx->blk_loop.iterary;
1452 if (SvTYPE(av) != SVt_PVAV) {
1453 /* iterate ($min .. $max) */
1454 if (cx->blk_loop.iterlval) {
1455 /* string increment */
1456 register SV* cur = cx->blk_loop.iterlval;
1458 char *max = SvPV((SV*)av, maxlen);
1459 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1460 #ifndef USE_THREADS /* don't risk potential race */
1461 if (SvREFCNT(*cx->blk_loop.itervar) == 1) {
1462 /* safe to reuse old SV */
1463 sv_setsv(*cx->blk_loop.itervar, cur);
1468 /* we need a fresh SV every time so that loop body sees a
1469 * completely new SV for closures/references to work as
1471 SvREFCNT_dec(*cx->blk_loop.itervar);
1472 *cx->blk_loop.itervar = newSVsv(cur);
1474 if (strEQ(SvPVX(cur), max))
1475 sv_setiv(cur, 0); /* terminate next time */
1482 /* integer increment */
1483 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1486 #ifndef USE_THREADS /* don't risk potential race */
1487 if (SvREFCNT(*cx->blk_loop.itervar) == 1) {
1488 /* safe to reuse old SV */
1489 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1494 /* we need a fresh SV every time so that loop body sees a
1495 * completely new SV for closures/references to work as they
1497 SvREFCNT_dec(*cx->blk_loop.itervar);
1498 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1504 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1507 SvREFCNT_dec(*cx->blk_loop.itervar);
1509 if (sv = (SvMAGICAL(av))
1510 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1511 : AvARRAY(av)[++cx->blk_loop.iterix])
1515 if (av != PL_curstack && SvIMMORTAL(sv)) {
1516 SV *lv = cx->blk_loop.iterlval;
1517 if (lv && SvREFCNT(lv) > 1) {
1522 SvREFCNT_dec(LvTARG(lv));
1524 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1525 sv_upgrade(lv, SVt_PVLV);
1527 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1529 LvTARG(lv) = SvREFCNT_inc(av);
1530 LvTARGOFF(lv) = cx->blk_loop.iterix;
1531 LvTARGLEN(lv) = (UV) -1;
1535 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1542 register PMOP *pm = cPMOP;
1558 register REGEXP *rx = pm->op_pmregexp;
1560 int force_on_match = 0;
1561 I32 oldsave = PL_savestack_ix;
1562 I32 update_minmatch = 1;
1565 /* known replacement string? */
1566 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1567 if (PL_op->op_flags & OPf_STACKED)
1573 if (SvREADONLY(TARG)
1574 || (SvTYPE(TARG) > SVt_PVLV
1575 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1579 s = SvPV(TARG, len);
1580 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1582 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1583 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1590 DIE("panic: do_subst");
1593 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1594 position, once with zero-length,
1595 second time with non-zero. */
1597 if (!rx->prelen && PL_curpm) {
1599 rx = pm->op_pmregexp;
1601 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1602 && SvTYPE(rx->check_substr) == SVt_PVBM
1603 && SvVALID(rx->check_substr))
1605 safebase = (!rx->nparens && !PL_sawampersand) ? 0 : REXEC_COPY_STR;
1606 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1607 SAVEINT(PL_multiline);
1608 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1611 if (rx->check_substr) {
1612 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1616 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1618 else if (!(s = screaminstr(TARG, rx->check_substr, rx->check_offset_min, 0, &p, 0)))
1621 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
1622 (unsigned char*)strend,
1623 rx->check_substr, 0)))
1625 if (s && rx->check_offset_max < s - m) {
1626 ++BmUSEFUL(rx->check_substr);
1627 s -= rx->check_offset_max;
1632 /* Now checkstring is fixed, i.e. at fixed offset from the
1633 beginning of match, and the match is anchored at s. */
1634 else if (!PL_multiline) { /* Anchored at beginning of string. */
1636 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
1637 || ((slen = SvCUR(rx->check_substr)) > 1
1638 && memNE(SvPVX(rx->check_substr),
1639 s + rx->check_offset_min, slen)))
1642 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
1643 && rx->check_substr == rx->float_substr) {
1644 SvREFCNT_dec(rx->check_substr);
1645 rx->check_substr = Nullsv; /* opt is being useless */
1646 rx->float_substr = Nullsv;
1650 /* only replace once? */
1651 once = !(rpm->op_pmflags & PMf_GLOBAL);
1653 /* known replacement string? */
1654 c = dstr ? SvPV(dstr, clen) : Nullch;
1656 /* can do inplace substitution? */
1657 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1658 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1659 if (!CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1662 LEAVE_SCOPE(oldsave);
1665 if (force_on_match) {
1667 s = SvPV_force(TARG, len);
1672 SvSCREAM_off(TARG); /* disable possible screamer */
1674 rxtainted |= RX_MATCH_TAINTED(rx);
1676 m = orig + (rx->startp[0] - rx->subbase);
1677 d = orig + (rx->endp[0] - rx->subbase);
1683 if (m - s > strend - d) { /* faster to shorten from end */
1685 Copy(c, m, clen, char);
1690 Move(d, m, i, char);
1694 SvCUR_set(TARG, m - s);
1697 else if (i = m - s) { /* faster from front */
1705 Copy(c, m, clen, char);
1710 Copy(c, d, clen, char);
1715 TAINT_IF(rxtainted & 1);
1721 if (iters++ > maxiters)
1722 DIE("Substitution loop");
1723 rxtainted |= RX_MATCH_TAINTED(rx);
1728 Move(s, d, i, char);
1732 Copy(c, d, clen, char);
1736 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1737 Nullsv, NULL, 0)); /* don't match same null twice */
1740 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1741 Move(s, d, i+1, char); /* include the NUL */
1743 TAINT_IF(rxtainted & 1);
1745 PUSHs(sv_2mortal(newSViv((I32)iters)));
1747 (void)SvPOK_only(TARG);
1748 TAINT_IF(rxtainted);
1749 if (SvSMAGICAL(TARG)) {
1755 LEAVE_SCOPE(oldsave);
1759 if (CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1760 if (force_on_match) {
1762 s = SvPV_force(TARG, len);
1765 rxtainted |= RX_MATCH_TAINTED(rx);
1766 dstr = NEWSV(25, len);
1767 sv_setpvn(dstr, m, s-m);
1770 register PERL_CONTEXT *cx;
1773 RETURNOP(cPMOP->op_pmreplroot);
1776 if (iters++ > maxiters)
1777 DIE("Substitution loop");
1778 rxtainted |= RX_MATCH_TAINTED(rx);
1779 if (rx->subbase && rx->subbase != orig) {
1784 strend = s + (strend - m);
1787 sv_catpvn(dstr, s, m-s);
1790 sv_catpvn(dstr, c, clen);
1793 } while (CALLREGEXEC(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1794 sv_catpvn(dstr, s, strend - s);
1796 (void)SvOOK_off(TARG);
1797 Safefree(SvPVX(TARG));
1798 SvPVX(TARG) = SvPVX(dstr);
1799 SvCUR_set(TARG, SvCUR(dstr));
1800 SvLEN_set(TARG, SvLEN(dstr));
1804 TAINT_IF(rxtainted & 1);
1806 PUSHs(sv_2mortal(newSViv((I32)iters)));
1808 (void)SvPOK_only(TARG);
1809 TAINT_IF(rxtainted);
1812 LEAVE_SCOPE(oldsave);
1818 ++BmUSEFUL(rx->check_substr);
1823 LEAVE_SCOPE(oldsave);
1832 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1833 ++*PL_markstack_ptr;
1834 LEAVE; /* exit inner scope */
1837 if (PL_stack_base + *PL_markstack_ptr > SP) {
1839 I32 gimme = GIMME_V;
1841 LEAVE; /* exit outer scope */
1842 (void)POPMARK; /* pop src */
1843 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1844 (void)POPMARK; /* pop dst */
1845 SP = PL_stack_base + POPMARK; /* pop original mark */
1846 if (gimme == G_SCALAR) {
1850 else if (gimme == G_ARRAY)
1857 ENTER; /* enter inner scope */
1860 src = PL_stack_base[*PL_markstack_ptr];
1864 RETURNOP(cLOGOP->op_other);
1875 register PERL_CONTEXT *cx;
1876 struct block_sub cxsub;
1879 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1882 if (gimme == G_SCALAR) {
1885 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1887 *MARK = SvREFCNT_inc(TOPs);
1892 *MARK = sv_mortalcopy(TOPs);
1895 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1898 *MARK = &PL_sv_undef;
1902 else if (gimme == G_ARRAY) {
1903 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1904 if (!SvTEMP(*MARK)) {
1905 *MARK = sv_mortalcopy(*MARK);
1906 TAINT_NOT; /* Each item is independent */
1912 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1913 PL_curpm = newpm; /* ... and pop $1 et al */
1916 return pop_return();
1920 get_db_sub(SV **svp, CV *cv)
1923 SV *dbsv = GvSV(PL_DBsub);
1925 if (!PERLDB_SUB_NN) {
1929 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1930 || strEQ(GvNAME(gv), "END")
1931 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1932 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1933 && (gv = (GV*)*svp) ))) {
1934 /* Use GV from the stack as a fallback. */
1935 /* GV is potentially non-unique, or contain different CV. */
1936 sv_setsv(dbsv, newRV((SV*)cv));
1939 gv_efullname3(dbsv, gv, Nullch);
1943 SvUPGRADE(dbsv, SVt_PVIV);
1945 SAVEIV(SvIVX(dbsv));
1946 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1950 PL_curcopdb = PL_curcop;
1951 cv = GvCV(PL_DBsub);
1961 register PERL_CONTEXT *cx;
1963 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
1966 DIE("Not a CODE reference");
1967 switch (SvTYPE(sv)) {
1972 if (sv == &PL_sv_yes) { /* unfound import, ignore */
1974 SP = PL_stack_base + POPMARK;
1977 if (SvGMAGICAL(sv)) {
1979 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
1982 sym = SvPV(sv, PL_na);
1984 DIE(no_usym, "a subroutine");
1985 if (PL_op->op_private & HINT_STRICT_REFS)
1986 DIE(no_symref, sym, "a subroutine");
1987 cv = perl_get_cv(sym, TRUE);
1991 if (SvTYPE(cv) == SVt_PVCV)
1996 DIE("Not a CODE reference");
2001 if (!(cv = GvCVu((GV*)sv)))
2002 cv = sv_2cv(sv, &stash, &gv, TRUE);
2011 DIE("Not a CODE reference");
2013 if (!CvROOT(cv) && !CvXSUB(cv)) {
2017 /* anonymous or undef'd function leaves us no recourse */
2018 if (CvANON(cv) || !(gv = CvGV(cv)))
2019 DIE("Undefined subroutine called");
2020 /* autoloaded stub? */
2021 if (cv != GvCV(gv)) {
2025 /* should call AUTOLOAD now? */
2026 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2033 sub_name = sv_newmortal();
2034 gv_efullname3(sub_name, gv, Nullch);
2035 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2039 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2040 cv = get_db_sub(&sv, cv);
2042 DIE("No DBsub routine");
2046 * First we need to check if the sub or method requires locking.
2047 * If so, we gain a lock on the CV, the first argument or the
2048 * stash (for static methods), as appropriate. This has to be
2049 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2050 * reschedule by returning a new op.
2052 MUTEX_LOCK(CvMUTEXP(cv));
2053 if (CvFLAGS(cv) & CVf_LOCKED) {
2055 if (CvFLAGS(cv) & CVf_METHOD) {
2056 if (SP > PL_stack_base + TOPMARK)
2057 sv = *(PL_stack_base + TOPMARK + 1);
2059 MUTEX_UNLOCK(CvMUTEXP(cv));
2060 croak("no argument for locked method call");
2066 char *stashname = SvPV(sv, len);
2067 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2073 MUTEX_UNLOCK(CvMUTEXP(cv));
2074 mg = condpair_magic(sv);
2075 MUTEX_LOCK(MgMUTEXP(mg));
2076 if (MgOWNER(mg) == thr)
2077 MUTEX_UNLOCK(MgMUTEXP(mg));
2080 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2082 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2084 MUTEX_UNLOCK(MgMUTEXP(mg));
2085 SvREFCNT_inc(sv); /* Keep alive until magic_mutexfree */
2086 save_destructor(unlock_condpair, sv);
2088 MUTEX_LOCK(CvMUTEXP(cv));
2091 * Now we have permission to enter the sub, we must distinguish
2092 * four cases. (0) It's an XSUB (in which case we don't care
2093 * about ownership); (1) it's ours already (and we're recursing);
2094 * (2) it's free (but we may already be using a cached clone);
2095 * (3) another thread owns it. Case (1) is easy: we just use it.
2096 * Case (2) means we look for a clone--if we have one, use it
2097 * otherwise grab ownership of cv. Case (3) means we look for a
2098 * clone (for non-XSUBs) and have to create one if we don't
2100 * Why look for a clone in case (2) when we could just grab
2101 * ownership of cv straight away? Well, we could be recursing,
2102 * i.e. we originally tried to enter cv while another thread
2103 * owned it (hence we used a clone) but it has been freed up
2104 * and we're now recursing into it. It may or may not be "better"
2105 * to use the clone but at least CvDEPTH can be trusted.
2107 if (CvOWNER(cv) == thr || CvXSUB(cv))
2108 MUTEX_UNLOCK(CvMUTEXP(cv));
2110 /* Case (2) or (3) */
2114 * XXX Might it be better to release CvMUTEXP(cv) while we
2115 * do the hv_fetch? We might find someone has pinched it
2116 * when we look again, in which case we would be in case
2117 * (3) instead of (2) so we'd have to clone. Would the fact
2118 * that we released the mutex more quickly make up for this?
2121 (svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2123 /* We already have a clone to use */
2124 MUTEX_UNLOCK(CvMUTEXP(cv));
2126 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2127 "entersub: %p already has clone %p:%s\n",
2128 thr, cv, SvPEEK((SV*)cv)));
2131 if (CvDEPTH(cv) == 0)
2132 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2135 /* (2) => grab ownership of cv. (3) => make clone */
2139 MUTEX_UNLOCK(CvMUTEXP(cv));
2140 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2141 "entersub: %p grabbing %p:%s in stash %s\n",
2142 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2143 HvNAME(CvSTASH(cv)) : "(none)"));
2145 /* Make a new clone. */
2147 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2148 MUTEX_UNLOCK(CvMUTEXP(cv));
2149 DEBUG_L((PerlIO_printf(PerlIO_stderr(),
2150 "entersub: %p cloning %p:%s\n",
2151 thr, cv, SvPEEK((SV*)cv))));
2153 * We're creating a new clone so there's no race
2154 * between the original MUTEX_UNLOCK and the
2155 * SvREFCNT_inc since no one will be trying to undef
2156 * it out from underneath us. At least, I don't think
2159 clonecv = cv_clone(cv);
2160 SvREFCNT_dec(cv); /* finished with this */
2161 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2162 CvOWNER(clonecv) = thr;
2166 DEBUG_L(if (CvDEPTH(cv) != 0)
2167 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2169 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2172 #endif /* USE_THREADS */
2175 if (CvOLDSTYLE(cv)) {
2176 I32 (*fp3)_((int,int,int));
2178 register I32 items = SP - MARK;
2179 /* We dont worry to copy from @_. */
2184 PL_stack_sp = mark + 1;
2185 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2186 items = (*fp3)(CvXSUBANY(cv).any_i32,
2187 MARK - PL_stack_base + 1,
2189 PL_stack_sp = PL_stack_base + items;
2192 I32 markix = TOPMARK;
2197 /* Need to copy @_ to stack. Alternative may be to
2198 * switch stack to @_, and copy return values
2199 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2203 av = (AV*)PL_curpad[0];
2205 av = GvAV(PL_defgv);
2206 #endif /* USE_THREADS */
2207 items = AvFILLp(av) + 1; /* @_ is not tieable */
2210 /* Mark is at the end of the stack. */
2212 Copy(AvARRAY(av), SP + 1, items, SV*);
2217 if (PL_curcopdb) { /* We assume that the first
2218 XSUB in &DB::sub is the
2220 SAVESPTR(PL_curcop);
2221 PL_curcop = PL_curcopdb;
2224 /* Do we need to open block here? XXXX */
2225 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2227 /* Enforce some sanity in scalar context. */
2228 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2229 if (markix > PL_stack_sp - PL_stack_base)
2230 *(PL_stack_base + markix) = &PL_sv_undef;
2232 *(PL_stack_base + markix) = *PL_stack_sp;
2233 PL_stack_sp = PL_stack_base + markix;
2241 register I32 items = SP - MARK;
2242 AV* padlist = CvPADLIST(cv);
2243 SV** svp = AvARRAY(padlist);
2244 push_return(PL_op->op_next);
2245 PUSHBLOCK(cx, CXt_SUB, MARK);
2248 if (CvDEPTH(cv) < 2)
2249 (void)SvREFCNT_inc(cv);
2250 else { /* save temporaries on recursion? */
2251 if (CvDEPTH(cv) == 100 && PL_dowarn
2252 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2253 sub_crush_depth(cv);
2254 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2256 AV *newpad = newAV();
2257 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2258 I32 ix = AvFILLp((AV*)svp[1]);
2259 svp = AvARRAY(svp[0]);
2260 for ( ;ix > 0; ix--) {
2261 if (svp[ix] != &PL_sv_undef) {
2262 char *name = SvPVX(svp[ix]);
2263 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2264 || *name == '&') /* anonymous code? */
2266 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2268 else { /* our own lexical */
2270 av_store(newpad, ix, sv = (SV*)newAV());
2271 else if (*name == '%')
2272 av_store(newpad, ix, sv = (SV*)newHV());
2274 av_store(newpad, ix, sv = NEWSV(0,0));
2279 av_store(newpad, ix, sv = NEWSV(0,0));
2283 av = newAV(); /* will be @_ */
2285 av_store(newpad, 0, (SV*)av);
2286 AvFLAGS(av) = AVf_REIFY;
2287 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2288 AvFILLp(padlist) = CvDEPTH(cv);
2289 svp = AvARRAY(padlist);
2294 AV* av = (AV*)PL_curpad[0];
2296 items = AvFILLp(av) + 1;
2298 /* Mark is at the end of the stack. */
2300 Copy(AvARRAY(av), SP + 1, items, SV*);
2305 #endif /* USE_THREADS */
2306 SAVESPTR(PL_curpad);
2307 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2310 #endif /* USE_THREADS */
2316 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2317 "%p entersub preparing @_\n", thr));
2319 av = (AV*)PL_curpad[0];
2325 cx->blk_sub.savearray = GvAV(PL_defgv);
2326 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2327 #endif /* USE_THREADS */
2328 cx->blk_sub.argarray = av;
2331 if (items > AvMAX(av) + 1) {
2333 if (AvARRAY(av) != ary) {
2334 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2335 SvPVX(av) = (char*)ary;
2337 if (items > AvMAX(av) + 1) {
2338 AvMAX(av) = items - 1;
2339 Renew(ary,items,SV*);
2341 SvPVX(av) = (char*)ary;
2344 Copy(MARK,AvARRAY(av),items,SV*);
2345 AvFILLp(av) = items - 1;
2354 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2355 "%p entersub returning %p\n", thr, CvSTART(cv)));
2357 RETURNOP(CvSTART(cv));
2362 sub_crush_depth(CV *cv)
2365 warn("Deep recursion on anonymous subroutine");
2367 SV* tmpstr = sv_newmortal();
2368 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2369 warn("Deep recursion on subroutine \"%s\"", SvPVX(tmpstr));
2379 U32 lval = PL_op->op_flags & OPf_MOD;
2380 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2384 elem -= PL_curcop->cop_arybase;
2385 if (SvTYPE(av) != SVt_PVAV)
2387 svp = av_fetch(av, elem, lval && !defer);
2389 if (!svp || *svp == &PL_sv_undef) {
2392 DIE(no_aelem, elem);
2393 lv = sv_newmortal();
2394 sv_upgrade(lv, SVt_PVLV);
2396 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2397 LvTARG(lv) = SvREFCNT_inc(av);
2398 LvTARGOFF(lv) = elem;
2403 if (PL_op->op_private & OPpLVAL_INTRO)
2404 save_aelem(av, elem, svp);
2405 else if (PL_op->op_private & OPpDEREF)
2406 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2408 sv = (svp ? *svp : &PL_sv_undef);
2409 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2410 sv = sv_mortalcopy(sv);
2416 vivify_ref(SV *sv, U32 to_what)
2423 if (SvTYPE(sv) < SVt_RV)
2424 sv_upgrade(sv, SVt_RV);
2425 else if (SvTYPE(sv) >= SVt_PV) {
2426 (void)SvOOK_off(sv);
2427 Safefree(SvPVX(sv));
2428 SvLEN(sv) = SvCUR(sv) = 0;
2432 SvRV(sv) = NEWSV(355,0);
2435 SvRV(sv) = (SV*)newAV();
2438 SvRV(sv) = (SV*)newHV();
2459 if (SvTYPE(sv) == SVt_PVCV) {
2465 name = SvPV(TOPs, PL_na);
2466 sv = *(PL_stack_base + TOPMARK + 1);
2477 !(packname = SvPV(sv, packlen)) ||
2478 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2479 !(ob=(SV*)GvIO(iogv)))
2481 if (!packname || !isIDFIRST(*packname))
2482 DIE("Can't call method \"%s\" %s", name,
2483 SvOK(sv)? "without a package or object reference"
2484 : "on an undefined value");
2485 stash = gv_stashpvn(packname, packlen, TRUE);
2488 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2491 if (!ob || !SvOBJECT(ob))
2492 DIE("Can't call method \"%s\" on unblessed reference", name);
2494 stash = SvSTASH(ob);
2497 gv = gv_fetchmethod(stash, name);
2503 for (p = name; *p; p++) {
2505 sep = p, leaf = p + 1;
2506 else if (*p == ':' && *(p + 1) == ':')
2507 sep = p, leaf = p + 2;
2509 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2510 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2511 packlen = strlen(packname);
2515 packlen = sep - name;
2517 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2518 leaf, (int)packlen, packname);
2520 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);