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 if (PL_op->op_private & OPpLVAL_INTRO)
1341 DIE("Can't localize pseudo-hash element");
1342 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1348 if (!svp || *svp == &PL_sv_undef) {
1352 DIE(no_helem, SvPV(keysv, PL_na));
1353 lv = sv_newmortal();
1354 sv_upgrade(lv, SVt_PVLV);
1356 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1357 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1358 LvTARG(lv) = SvREFCNT_inc(hv);
1363 if (PL_op->op_private & OPpLVAL_INTRO) {
1364 if (HvNAME(hv) && isGV(*svp))
1365 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1367 save_helem(hv, keysv, svp);
1369 else if (PL_op->op_private & OPpDEREF)
1370 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1372 sv = (svp ? *svp : &PL_sv_undef);
1373 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1374 * Pushing the magical RHS on to the stack is useless, since
1375 * that magic is soon destined to be misled by the local(),
1376 * and thus the later pp_sassign() will fail to mg_get() the
1377 * old value. This should also cure problems with delayed
1378 * mg_get()s. GSAR 98-07-03 */
1379 if (!lval && SvGMAGICAL(sv))
1380 sv = sv_mortalcopy(sv);
1388 register PERL_CONTEXT *cx;
1394 if (PL_op->op_flags & OPf_SPECIAL) {
1395 cx = &cxstack[cxstack_ix];
1396 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1401 gimme = OP_GIMME(PL_op, -1);
1403 if (cxstack_ix >= 0)
1404 gimme = cxstack[cxstack_ix].blk_gimme;
1410 if (gimme == G_VOID)
1412 else if (gimme == G_SCALAR) {
1415 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1418 *MARK = sv_mortalcopy(TOPs);
1421 *MARK = &PL_sv_undef;
1425 else if (gimme == G_ARRAY) {
1426 /* in case LEAVE wipes old return values */
1427 for (mark = newsp + 1; mark <= SP; mark++) {
1428 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1429 *mark = sv_mortalcopy(*mark);
1430 TAINT_NOT; /* Each item is independent */
1434 PL_curpm = newpm; /* Don't pop $1 et al till now */
1444 register PERL_CONTEXT *cx;
1449 cx = &cxstack[cxstack_ix];
1450 if (cx->cx_type != CXt_LOOP)
1451 DIE("panic: pp_iter");
1453 av = cx->blk_loop.iterary;
1454 if (SvTYPE(av) != SVt_PVAV) {
1455 /* iterate ($min .. $max) */
1456 if (cx->blk_loop.iterlval) {
1457 /* string increment */
1458 register SV* cur = cx->blk_loop.iterlval;
1460 char *max = SvPV((SV*)av, maxlen);
1461 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1462 #ifndef USE_THREADS /* don't risk potential race */
1463 if (SvREFCNT(*cx->blk_loop.itervar) == 1) {
1464 /* safe to reuse old SV */
1465 sv_setsv(*cx->blk_loop.itervar, cur);
1470 /* we need a fresh SV every time so that loop body sees a
1471 * completely new SV for closures/references to work as
1473 SvREFCNT_dec(*cx->blk_loop.itervar);
1474 *cx->blk_loop.itervar = newSVsv(cur);
1476 if (strEQ(SvPVX(cur), max))
1477 sv_setiv(cur, 0); /* terminate next time */
1484 /* integer increment */
1485 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1488 #ifndef USE_THREADS /* don't risk potential race */
1489 if (SvREFCNT(*cx->blk_loop.itervar) == 1) {
1490 /* safe to reuse old SV */
1491 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1496 /* we need a fresh SV every time so that loop body sees a
1497 * completely new SV for closures/references to work as they
1499 SvREFCNT_dec(*cx->blk_loop.itervar);
1500 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1506 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1509 SvREFCNT_dec(*cx->blk_loop.itervar);
1511 if (sv = (SvMAGICAL(av))
1512 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1513 : AvARRAY(av)[++cx->blk_loop.iterix])
1517 if (av != PL_curstack && SvIMMORTAL(sv)) {
1518 SV *lv = cx->blk_loop.iterlval;
1519 if (lv && SvREFCNT(lv) > 1) {
1524 SvREFCNT_dec(LvTARG(lv));
1526 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1527 sv_upgrade(lv, SVt_PVLV);
1529 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1531 LvTARG(lv) = SvREFCNT_inc(av);
1532 LvTARGOFF(lv) = cx->blk_loop.iterix;
1533 LvTARGLEN(lv) = (UV) -1;
1537 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1544 register PMOP *pm = cPMOP;
1560 register REGEXP *rx = pm->op_pmregexp;
1562 int force_on_match = 0;
1563 I32 oldsave = PL_savestack_ix;
1564 I32 update_minmatch = 1;
1567 /* known replacement string? */
1568 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1569 if (PL_op->op_flags & OPf_STACKED)
1575 if (SvREADONLY(TARG)
1576 || (SvTYPE(TARG) > SVt_PVLV
1577 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1581 s = SvPV(TARG, len);
1582 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1584 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1585 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1592 DIE("panic: do_subst");
1595 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1596 position, once with zero-length,
1597 second time with non-zero. */
1599 if (!rx->prelen && PL_curpm) {
1601 rx = pm->op_pmregexp;
1603 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1604 && SvTYPE(rx->check_substr) == SVt_PVBM
1605 && SvVALID(rx->check_substr))
1607 safebase = (!rx->nparens && !PL_sawampersand) ? 0 : REXEC_COPY_STR;
1608 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1609 SAVEINT(PL_multiline);
1610 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1613 if (rx->check_substr) {
1614 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1618 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1620 else if (!(s = screaminstr(TARG, rx->check_substr, rx->check_offset_min, 0, &p, 0)))
1623 else if (!(s = fbm_instr((unsigned char*)s + rx->check_offset_min,
1624 (unsigned char*)strend,
1625 rx->check_substr, 0)))
1627 if (s && rx->check_offset_max < s - m) {
1628 ++BmUSEFUL(rx->check_substr);
1629 s -= rx->check_offset_max;
1634 /* Now checkstring is fixed, i.e. at fixed offset from the
1635 beginning of match, and the match is anchored at s. */
1636 else if (!PL_multiline) { /* Anchored at beginning of string. */
1638 if (*SvPVX(rx->check_substr) != s[rx->check_offset_min]
1639 || ((slen = SvCUR(rx->check_substr)) > 1
1640 && memNE(SvPVX(rx->check_substr),
1641 s + rx->check_offset_min, slen)))
1644 if (!rx->naughty && --BmUSEFUL(rx->check_substr) < 0
1645 && rx->check_substr == rx->float_substr) {
1646 SvREFCNT_dec(rx->check_substr);
1647 rx->check_substr = Nullsv; /* opt is being useless */
1648 rx->float_substr = Nullsv;
1652 /* only replace once? */
1653 once = !(rpm->op_pmflags & PMf_GLOBAL);
1655 /* known replacement string? */
1656 c = dstr ? SvPV(dstr, clen) : Nullch;
1658 /* can do inplace substitution? */
1659 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1660 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1661 if (!CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1664 LEAVE_SCOPE(oldsave);
1667 if (force_on_match) {
1669 s = SvPV_force(TARG, len);
1674 SvSCREAM_off(TARG); /* disable possible screamer */
1676 rxtainted |= RX_MATCH_TAINTED(rx);
1678 m = orig + (rx->startp[0] - rx->subbase);
1679 d = orig + (rx->endp[0] - rx->subbase);
1685 if (m - s > strend - d) { /* faster to shorten from end */
1687 Copy(c, m, clen, char);
1692 Move(d, m, i, char);
1696 SvCUR_set(TARG, m - s);
1699 else if (i = m - s) { /* faster from front */
1707 Copy(c, m, clen, char);
1712 Copy(c, d, clen, char);
1717 TAINT_IF(rxtainted & 1);
1723 if (iters++ > maxiters)
1724 DIE("Substitution loop");
1725 rxtainted |= RX_MATCH_TAINTED(rx);
1730 Move(s, d, i, char);
1734 Copy(c, d, clen, char);
1738 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1739 Nullsv, NULL, 0)); /* don't match same null twice */
1742 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1743 Move(s, d, i+1, char); /* include the NUL */
1745 TAINT_IF(rxtainted & 1);
1747 PUSHs(sv_2mortal(newSViv((I32)iters)));
1749 (void)SvPOK_only(TARG);
1750 TAINT_IF(rxtainted);
1751 if (SvSMAGICAL(TARG)) {
1757 LEAVE_SCOPE(oldsave);
1761 if (CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1762 if (force_on_match) {
1764 s = SvPV_force(TARG, len);
1767 rxtainted |= RX_MATCH_TAINTED(rx);
1768 dstr = NEWSV(25, len);
1769 sv_setpvn(dstr, m, s-m);
1772 register PERL_CONTEXT *cx;
1775 RETURNOP(cPMOP->op_pmreplroot);
1778 if (iters++ > maxiters)
1779 DIE("Substitution loop");
1780 rxtainted |= RX_MATCH_TAINTED(rx);
1781 if (rx->subbase && rx->subbase != orig) {
1786 strend = s + (strend - m);
1789 sv_catpvn(dstr, s, m-s);
1792 sv_catpvn(dstr, c, clen);
1795 } while (CALLREGEXEC(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1796 sv_catpvn(dstr, s, strend - s);
1798 (void)SvOOK_off(TARG);
1799 Safefree(SvPVX(TARG));
1800 SvPVX(TARG) = SvPVX(dstr);
1801 SvCUR_set(TARG, SvCUR(dstr));
1802 SvLEN_set(TARG, SvLEN(dstr));
1806 TAINT_IF(rxtainted & 1);
1808 PUSHs(sv_2mortal(newSViv((I32)iters)));
1810 (void)SvPOK_only(TARG);
1811 TAINT_IF(rxtainted);
1814 LEAVE_SCOPE(oldsave);
1820 ++BmUSEFUL(rx->check_substr);
1825 LEAVE_SCOPE(oldsave);
1834 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1835 ++*PL_markstack_ptr;
1836 LEAVE; /* exit inner scope */
1839 if (PL_stack_base + *PL_markstack_ptr > SP) {
1841 I32 gimme = GIMME_V;
1843 LEAVE; /* exit outer scope */
1844 (void)POPMARK; /* pop src */
1845 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1846 (void)POPMARK; /* pop dst */
1847 SP = PL_stack_base + POPMARK; /* pop original mark */
1848 if (gimme == G_SCALAR) {
1852 else if (gimme == G_ARRAY)
1859 ENTER; /* enter inner scope */
1862 src = PL_stack_base[*PL_markstack_ptr];
1866 RETURNOP(cLOGOP->op_other);
1877 register PERL_CONTEXT *cx;
1878 struct block_sub cxsub;
1881 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1884 if (gimme == G_SCALAR) {
1887 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1889 *MARK = SvREFCNT_inc(TOPs);
1894 *MARK = sv_mortalcopy(TOPs);
1897 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1900 *MARK = &PL_sv_undef;
1904 else if (gimme == G_ARRAY) {
1905 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1906 if (!SvTEMP(*MARK)) {
1907 *MARK = sv_mortalcopy(*MARK);
1908 TAINT_NOT; /* Each item is independent */
1914 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1915 PL_curpm = newpm; /* ... and pop $1 et al */
1918 return pop_return();
1922 get_db_sub(SV **svp, CV *cv)
1925 SV *dbsv = GvSV(PL_DBsub);
1927 if (!PERLDB_SUB_NN) {
1931 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1932 || strEQ(GvNAME(gv), "END")
1933 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1934 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1935 && (gv = (GV*)*svp) ))) {
1936 /* Use GV from the stack as a fallback. */
1937 /* GV is potentially non-unique, or contain different CV. */
1938 sv_setsv(dbsv, newRV((SV*)cv));
1941 gv_efullname3(dbsv, gv, Nullch);
1945 SvUPGRADE(dbsv, SVt_PVIV);
1947 SAVEIV(SvIVX(dbsv));
1948 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1952 PL_curcopdb = PL_curcop;
1953 cv = GvCV(PL_DBsub);
1963 register PERL_CONTEXT *cx;
1965 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
1968 DIE("Not a CODE reference");
1969 switch (SvTYPE(sv)) {
1974 if (sv == &PL_sv_yes) { /* unfound import, ignore */
1976 SP = PL_stack_base + POPMARK;
1979 if (SvGMAGICAL(sv)) {
1981 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
1984 sym = SvPV(sv, PL_na);
1986 DIE(no_usym, "a subroutine");
1987 if (PL_op->op_private & HINT_STRICT_REFS)
1988 DIE(no_symref, sym, "a subroutine");
1989 cv = perl_get_cv(sym, TRUE);
1993 if (SvTYPE(cv) == SVt_PVCV)
1998 DIE("Not a CODE reference");
2003 if (!(cv = GvCVu((GV*)sv)))
2004 cv = sv_2cv(sv, &stash, &gv, TRUE);
2013 DIE("Not a CODE reference");
2015 if (!CvROOT(cv) && !CvXSUB(cv)) {
2019 /* anonymous or undef'd function leaves us no recourse */
2020 if (CvANON(cv) || !(gv = CvGV(cv)))
2021 DIE("Undefined subroutine called");
2022 /* autoloaded stub? */
2023 if (cv != GvCV(gv)) {
2027 /* should call AUTOLOAD now? */
2028 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2035 sub_name = sv_newmortal();
2036 gv_efullname3(sub_name, gv, Nullch);
2037 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2041 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2042 cv = get_db_sub(&sv, cv);
2044 DIE("No DBsub routine");
2048 * First we need to check if the sub or method requires locking.
2049 * If so, we gain a lock on the CV, the first argument or the
2050 * stash (for static methods), as appropriate. This has to be
2051 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2052 * reschedule by returning a new op.
2054 MUTEX_LOCK(CvMUTEXP(cv));
2055 if (CvFLAGS(cv) & CVf_LOCKED) {
2057 if (CvFLAGS(cv) & CVf_METHOD) {
2058 if (SP > PL_stack_base + TOPMARK)
2059 sv = *(PL_stack_base + TOPMARK + 1);
2061 MUTEX_UNLOCK(CvMUTEXP(cv));
2062 croak("no argument for locked method call");
2068 char *stashname = SvPV(sv, len);
2069 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2075 MUTEX_UNLOCK(CvMUTEXP(cv));
2076 mg = condpair_magic(sv);
2077 MUTEX_LOCK(MgMUTEXP(mg));
2078 if (MgOWNER(mg) == thr)
2079 MUTEX_UNLOCK(MgMUTEXP(mg));
2082 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2084 DEBUG_L(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2086 MUTEX_UNLOCK(MgMUTEXP(mg));
2087 SvREFCNT_inc(sv); /* Keep alive until magic_mutexfree */
2088 save_destructor(unlock_condpair, sv);
2090 MUTEX_LOCK(CvMUTEXP(cv));
2093 * Now we have permission to enter the sub, we must distinguish
2094 * four cases. (0) It's an XSUB (in which case we don't care
2095 * about ownership); (1) it's ours already (and we're recursing);
2096 * (2) it's free (but we may already be using a cached clone);
2097 * (3) another thread owns it. Case (1) is easy: we just use it.
2098 * Case (2) means we look for a clone--if we have one, use it
2099 * otherwise grab ownership of cv. Case (3) means we look for a
2100 * clone (for non-XSUBs) and have to create one if we don't
2102 * Why look for a clone in case (2) when we could just grab
2103 * ownership of cv straight away? Well, we could be recursing,
2104 * i.e. we originally tried to enter cv while another thread
2105 * owned it (hence we used a clone) but it has been freed up
2106 * and we're now recursing into it. It may or may not be "better"
2107 * to use the clone but at least CvDEPTH can be trusted.
2109 if (CvOWNER(cv) == thr || CvXSUB(cv))
2110 MUTEX_UNLOCK(CvMUTEXP(cv));
2112 /* Case (2) or (3) */
2116 * XXX Might it be better to release CvMUTEXP(cv) while we
2117 * do the hv_fetch? We might find someone has pinched it
2118 * when we look again, in which case we would be in case
2119 * (3) instead of (2) so we'd have to clone. Would the fact
2120 * that we released the mutex more quickly make up for this?
2123 (svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2125 /* We already have a clone to use */
2126 MUTEX_UNLOCK(CvMUTEXP(cv));
2128 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2129 "entersub: %p already has clone %p:%s\n",
2130 thr, cv, SvPEEK((SV*)cv)));
2133 if (CvDEPTH(cv) == 0)
2134 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2137 /* (2) => grab ownership of cv. (3) => make clone */
2141 MUTEX_UNLOCK(CvMUTEXP(cv));
2142 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2143 "entersub: %p grabbing %p:%s in stash %s\n",
2144 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2145 HvNAME(CvSTASH(cv)) : "(none)"));
2147 /* Make a new clone. */
2149 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2150 MUTEX_UNLOCK(CvMUTEXP(cv));
2151 DEBUG_L((PerlIO_printf(PerlIO_stderr(),
2152 "entersub: %p cloning %p:%s\n",
2153 thr, cv, SvPEEK((SV*)cv))));
2155 * We're creating a new clone so there's no race
2156 * between the original MUTEX_UNLOCK and the
2157 * SvREFCNT_inc since no one will be trying to undef
2158 * it out from underneath us. At least, I don't think
2161 clonecv = cv_clone(cv);
2162 SvREFCNT_dec(cv); /* finished with this */
2163 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2164 CvOWNER(clonecv) = thr;
2168 DEBUG_L(if (CvDEPTH(cv) != 0)
2169 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2171 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2174 #endif /* USE_THREADS */
2177 if (CvOLDSTYLE(cv)) {
2178 I32 (*fp3)_((int,int,int));
2180 register I32 items = SP - MARK;
2181 /* We dont worry to copy from @_. */
2186 PL_stack_sp = mark + 1;
2187 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2188 items = (*fp3)(CvXSUBANY(cv).any_i32,
2189 MARK - PL_stack_base + 1,
2191 PL_stack_sp = PL_stack_base + items;
2194 I32 markix = TOPMARK;
2199 /* Need to copy @_ to stack. Alternative may be to
2200 * switch stack to @_, and copy return values
2201 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2205 av = (AV*)PL_curpad[0];
2207 av = GvAV(PL_defgv);
2208 #endif /* USE_THREADS */
2209 items = AvFILLp(av) + 1; /* @_ is not tieable */
2212 /* Mark is at the end of the stack. */
2214 Copy(AvARRAY(av), SP + 1, items, SV*);
2219 if (PL_curcopdb) { /* We assume that the first
2220 XSUB in &DB::sub is the
2222 SAVESPTR(PL_curcop);
2223 PL_curcop = PL_curcopdb;
2226 /* Do we need to open block here? XXXX */
2227 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2229 /* Enforce some sanity in scalar context. */
2230 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2231 if (markix > PL_stack_sp - PL_stack_base)
2232 *(PL_stack_base + markix) = &PL_sv_undef;
2234 *(PL_stack_base + markix) = *PL_stack_sp;
2235 PL_stack_sp = PL_stack_base + markix;
2243 register I32 items = SP - MARK;
2244 AV* padlist = CvPADLIST(cv);
2245 SV** svp = AvARRAY(padlist);
2246 push_return(PL_op->op_next);
2247 PUSHBLOCK(cx, CXt_SUB, MARK);
2250 if (CvDEPTH(cv) < 2)
2251 (void)SvREFCNT_inc(cv);
2252 else { /* save temporaries on recursion? */
2253 if (CvDEPTH(cv) == 100 && PL_dowarn
2254 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2255 sub_crush_depth(cv);
2256 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2258 AV *newpad = newAV();
2259 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2260 I32 ix = AvFILLp((AV*)svp[1]);
2261 svp = AvARRAY(svp[0]);
2262 for ( ;ix > 0; ix--) {
2263 if (svp[ix] != &PL_sv_undef) {
2264 char *name = SvPVX(svp[ix]);
2265 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2266 || *name == '&') /* anonymous code? */
2268 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2270 else { /* our own lexical */
2272 av_store(newpad, ix, sv = (SV*)newAV());
2273 else if (*name == '%')
2274 av_store(newpad, ix, sv = (SV*)newHV());
2276 av_store(newpad, ix, sv = NEWSV(0,0));
2281 av_store(newpad, ix, sv = NEWSV(0,0));
2285 av = newAV(); /* will be @_ */
2287 av_store(newpad, 0, (SV*)av);
2288 AvFLAGS(av) = AVf_REIFY;
2289 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2290 AvFILLp(padlist) = CvDEPTH(cv);
2291 svp = AvARRAY(padlist);
2296 AV* av = (AV*)PL_curpad[0];
2298 items = AvFILLp(av) + 1;
2300 /* Mark is at the end of the stack. */
2302 Copy(AvARRAY(av), SP + 1, items, SV*);
2307 #endif /* USE_THREADS */
2308 SAVESPTR(PL_curpad);
2309 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2312 #endif /* USE_THREADS */
2318 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2319 "%p entersub preparing @_\n", thr));
2321 av = (AV*)PL_curpad[0];
2327 cx->blk_sub.savearray = GvAV(PL_defgv);
2328 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2329 #endif /* USE_THREADS */
2330 cx->blk_sub.argarray = av;
2333 if (items > AvMAX(av) + 1) {
2335 if (AvARRAY(av) != ary) {
2336 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2337 SvPVX(av) = (char*)ary;
2339 if (items > AvMAX(av) + 1) {
2340 AvMAX(av) = items - 1;
2341 Renew(ary,items,SV*);
2343 SvPVX(av) = (char*)ary;
2346 Copy(MARK,AvARRAY(av),items,SV*);
2347 AvFILLp(av) = items - 1;
2356 DEBUG_L(PerlIO_printf(PerlIO_stderr(),
2357 "%p entersub returning %p\n", thr, CvSTART(cv)));
2359 RETURNOP(CvSTART(cv));
2364 sub_crush_depth(CV *cv)
2367 warn("Deep recursion on anonymous subroutine");
2369 SV* tmpstr = sv_newmortal();
2370 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2371 warn("Deep recursion on subroutine \"%s\"", SvPVX(tmpstr));
2381 U32 lval = PL_op->op_flags & OPf_MOD;
2382 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2386 elem -= PL_curcop->cop_arybase;
2387 if (SvTYPE(av) != SVt_PVAV)
2389 svp = av_fetch(av, elem, lval && !defer);
2391 if (!svp || *svp == &PL_sv_undef) {
2394 DIE(no_aelem, elem);
2395 lv = sv_newmortal();
2396 sv_upgrade(lv, SVt_PVLV);
2398 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2399 LvTARG(lv) = SvREFCNT_inc(av);
2400 LvTARGOFF(lv) = elem;
2405 if (PL_op->op_private & OPpLVAL_INTRO)
2406 save_aelem(av, elem, svp);
2407 else if (PL_op->op_private & OPpDEREF)
2408 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2410 sv = (svp ? *svp : &PL_sv_undef);
2411 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2412 sv = sv_mortalcopy(sv);
2418 vivify_ref(SV *sv, U32 to_what)
2425 if (SvTYPE(sv) < SVt_RV)
2426 sv_upgrade(sv, SVt_RV);
2427 else if (SvTYPE(sv) >= SVt_PV) {
2428 (void)SvOOK_off(sv);
2429 Safefree(SvPVX(sv));
2430 SvLEN(sv) = SvCUR(sv) = 0;
2434 SvRV(sv) = NEWSV(355,0);
2437 SvRV(sv) = (SV*)newAV();
2440 SvRV(sv) = (SV*)newHV();
2461 if (SvTYPE(sv) == SVt_PVCV) {
2467 name = SvPV(TOPs, PL_na);
2468 sv = *(PL_stack_base + TOPMARK + 1);
2479 !(packname = SvPV(sv, packlen)) ||
2480 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2481 !(ob=(SV*)GvIO(iogv)))
2483 if (!packname || !isIDFIRST(*packname))
2484 DIE("Can't call method \"%s\" %s", name,
2485 SvOK(sv)? "without a package or object reference"
2486 : "on an undefined value");
2487 stash = gv_stashpvn(packname, packlen, TRUE);
2490 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2493 if (!ob || !SvOBJECT(ob))
2494 DIE("Can't call method \"%s\" on unblessed reference", name);
2496 stash = SvSTASH(ob);
2499 gv = gv_fetchmethod(stash, name);
2505 for (p = name; *p; p++) {
2507 sep = p, leaf = p + 1;
2508 else if (*p == ':' && *(p + 1) == ':')
2509 sep = p, leaf = p + 2;
2511 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2512 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2513 packlen = strlen(packname);
2517 packlen = sep - name;
2519 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2520 leaf, (int)packlen, packname);
2522 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);