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!
31 #define HOP(pos,off) (IN_UTF8 ? utf8_hop(pos, off) : (pos + off))
37 unset_cvowner(void *cvarg)
39 register CV* cv = (CV *) cvarg;
42 #endif /* DEBUGGING */
44 DEBUG_S((PerlIO_printf(PerlIO_stderr(), "%p unsetting CvOWNER of %p:%s\n",
45 thr, cv, SvPEEK((SV*)cv))));
46 MUTEX_LOCK(CvMUTEXP(cv));
47 DEBUG_S(if (CvDEPTH(cv) != 0)
48 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
50 assert(thr == CvOWNER(cv));
52 MUTEX_UNLOCK(CvMUTEXP(cv));
55 #endif /* USE_THREADS */
66 PL_curcop = (COP*)PL_op;
67 TAINT_NOT; /* Each statement is presumed innocent */
68 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
77 if (PL_op->op_private & OPpLVAL_INTRO)
78 PUSHs(save_scalar(cGVOP->op_gv));
80 PUSHs(GvSV(cGVOP->op_gv));
91 PUSHMARK(PL_stack_sp);
101 sv_setpvn(TARG,s,len);
109 XPUSHs((SV*)cGVOP->op_gv);
120 RETURNOP(cLOGOP->op_other);
129 if (PL_op->op_private & OPpASSIGN_BACKWARDS) {
131 temp = left; left = right; right = temp;
133 if (PL_tainting && PL_tainted && !SvTAINTED(left))
135 SvSetMagicSV(right, left);
144 RETURNOP(cCONDOP->op_true);
146 RETURNOP(cCONDOP->op_false);
152 TAINT_NOT; /* Each statement is presumed innocent */
153 PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
155 oldsave = PL_scopestack[PL_scopestack_ix - 1];
156 LEAVE_SCOPE(oldsave);
162 djSP; dATARGET; tryAMAGICbin(concat,opASSIGN);
169 sv_setpvn(TARG,s,len);
171 else if (SvGMAGICAL(TARG))
173 else if (!SvOK(TARG) && SvTYPE(TARG) <= SVt_PVMG) {
174 sv_setpv(TARG, ""); /* Suppress warning. */
175 s = SvPV_force(TARG, len);
179 sv_catpvn(TARG,s,len);
181 sv_setpvn(TARG,s,len); /* suppress warning */
191 if (PL_op->op_flags & OPf_MOD) {
192 if (PL_op->op_private & OPpLVAL_INTRO)
193 SAVECLEARSV(PL_curpad[PL_op->op_targ]);
194 else if (PL_op->op_private & OPpDEREF) {
196 vivify_ref(PL_curpad[PL_op->op_targ], PL_op->op_private & OPpDEREF);
205 PL_last_in_gv = (GV*)(*PL_stack_sp--);
206 return do_readline();
211 djSP; tryAMAGICbinSET(eq,0);
214 SETs(boolSV(TOPn == value));
222 if (SvREADONLY(TOPs) || SvTYPE(TOPs) > SVt_PVLV)
224 if (SvIOK(TOPs) && !SvNOK(TOPs) && !SvPOK(TOPs) &&
225 SvIVX(TOPs) != IV_MAX)
228 SvFLAGS(TOPs) &= ~(SVp_NOK|SVp_POK);
243 RETURNOP(cLOGOP->op_other);
249 djSP; dATARGET; tryAMAGICbin(add,opASSIGN);
252 SETn( left + right );
260 AV *av = GvAV((GV*)cSVOP->op_sv);
261 U32 lval = PL_op->op_flags & OPf_MOD;
262 SV** svp = av_fetch(av, PL_op->op_private, lval);
263 SV *sv = (svp ? *svp : &PL_sv_undef);
265 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
266 sv = sv_mortalcopy(sv);
273 djSP; dMARK; dTARGET;
275 do_join(TARG, *MARK, MARK, SP);
286 * We ass_u_me that LvTARGOFF() comes first, and that two STRLENs
287 * will be enough to hold an OP*.
289 SV* sv = sv_newmortal();
290 sv_upgrade(sv, SVt_PVLV);
292 Copy(&PL_op, &LvTARGOFF(sv), 1, OP*);
300 /* Oversized hot code. */
304 djSP; dMARK; dORIGMARK;
310 if (PL_op->op_flags & OPf_STACKED)
314 if (mg = SvTIED_mg((SV*)gv, 'q')) {
315 if (MARK == ORIGMARK) {
316 /* If using default handle then we need to make space to
317 * pass object as 1st arg, so move other args up ...
321 Move(MARK, MARK + 1, (SP - MARK) + 1, SV*);
325 *MARK = SvTIED_obj((SV*)gv, mg);
328 perl_call_method("PRINT", G_SCALAR);
336 if (!(io = GvIO(gv))) {
337 if (ckWARN(WARN_UNOPENED)) {
338 SV* sv = sv_newmortal();
339 gv_fullname3(sv, gv, Nullch);
340 warner(WARN_UNOPENED, "Filehandle %s never opened", SvPV(sv,PL_na));
343 SETERRNO(EBADF,RMS$_IFI);
346 else if (!(fp = IoOFP(io))) {
347 if (ckWARN2(WARN_CLOSED, WARN_IO)) {
348 SV* sv = sv_newmortal();
349 gv_fullname3(sv, gv, Nullch);
351 warner(WARN_IO, "Filehandle %s opened only for input",
353 else if (ckWARN(WARN_CLOSED))
354 warner(WARN_CLOSED, "print on closed filehandle %s",
357 SETERRNO(EBADF,IoIFP(io)?RMS$_FAC:RMS$_IFI);
364 if (!do_print(*MARK, fp))
368 if (PerlIO_write(fp, PL_ofs, PL_ofslen) == 0 || PerlIO_error(fp)) {
377 if (!do_print(*MARK, fp))
386 if (PerlIO_write(fp, PL_ors, PL_orslen) == 0 || PerlIO_error(fp))
389 if (IoFLAGS(io) & IOf_FLUSH)
390 if (PerlIO_flush(fp) == EOF)
412 if (SvTYPE(av) != SVt_PVAV)
413 DIE("Not an ARRAY reference");
414 if (PL_op->op_flags & OPf_REF) {
420 if (SvTYPE(sv) == SVt_PVAV) {
422 if (PL_op->op_flags & OPf_REF) {
430 if (SvTYPE(sv) != SVt_PVGV) {
433 if (SvGMAGICAL(sv)) {
439 if (PL_op->op_flags & OPf_REF ||
440 PL_op->op_private & HINT_STRICT_REFS)
441 DIE(no_usym, "an ARRAY");
442 if (ckWARN(WARN_UNINITIALIZED))
443 warner(WARN_UNINITIALIZED, warn_uninit);
444 if (GIMME == G_ARRAY)
448 sym = SvPV(sv,PL_na);
449 if (PL_op->op_private & HINT_STRICT_REFS)
450 DIE(no_symref, sym, "an ARRAY");
451 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVAV);
456 if (PL_op->op_private & OPpLVAL_INTRO)
458 if (PL_op->op_flags & OPf_REF) {
465 if (GIMME == G_ARRAY) {
466 I32 maxarg = AvFILL(av) + 1;
468 if (SvRMAGICAL(av)) {
470 for (i=0; i < maxarg; i++) {
471 SV **svp = av_fetch(av, i, FALSE);
472 SP[i+1] = (svp) ? *svp : &PL_sv_undef;
476 Copy(AvARRAY(av), SP+1, maxarg, SV*);
482 I32 maxarg = AvFILL(av) + 1;
496 if (SvTYPE(hv) != SVt_PVHV && SvTYPE(hv) != SVt_PVAV)
497 DIE("Not a HASH reference");
498 if (PL_op->op_flags & OPf_REF) {
504 if (SvTYPE(sv) == SVt_PVHV || SvTYPE(sv) == SVt_PVAV) {
506 if (PL_op->op_flags & OPf_REF) {
514 if (SvTYPE(sv) != SVt_PVGV) {
517 if (SvGMAGICAL(sv)) {
523 if (PL_op->op_flags & OPf_REF ||
524 PL_op->op_private & HINT_STRICT_REFS)
525 DIE(no_usym, "a HASH");
526 if (ckWARN(WARN_UNINITIALIZED))
527 warner(WARN_UNINITIALIZED, warn_uninit);
528 if (GIMME == G_ARRAY) {
534 sym = SvPV(sv,PL_na);
535 if (PL_op->op_private & HINT_STRICT_REFS)
536 DIE(no_symref, sym, "a HASH");
537 gv = (GV*)gv_fetchpv(sym, TRUE, SVt_PVHV);
542 if (PL_op->op_private & OPpLVAL_INTRO)
544 if (PL_op->op_flags & OPf_REF) {
551 if (GIMME == G_ARRAY) { /* array wanted */
552 *PL_stack_sp = (SV*)hv;
557 if (SvTYPE(hv) == SVt_PVAV)
558 hv = avhv_keys((AV*)hv);
560 sv_setpvf(TARG, "%ld/%ld",
561 (long)HvFILL(hv), (long)HvMAX(hv) + 1);
573 SV **lastlelem = PL_stack_sp;
574 SV **lastrelem = PL_stack_base + POPMARK;
575 SV **firstrelem = PL_stack_base + POPMARK + 1;
576 SV **firstlelem = lastrelem + 1;
589 PL_delaymagic = DM_DELAY; /* catch simultaneous items */
591 /* If there's a common identifier on both sides we have to take
592 * special care that assigning the identifier on the left doesn't
593 * clobber a value on the right that's used later in the list.
595 if (PL_op->op_private & OPpASSIGN_COMMON) {
596 EXTEND_MORTAL(lastrelem - firstrelem + 1);
597 for (relem = firstrelem; relem <= lastrelem; relem++) {
600 TAINT_NOT; /* Each item is independent */
601 *relem = sv_mortalcopy(sv);
610 while (lelem <= lastlelem) {
611 TAINT_NOT; /* Each item stands on its own, taintwise. */
613 switch (SvTYPE(sv)) {
616 magic = SvMAGICAL(ary) != 0;
619 av_extend(ary, lastrelem - relem);
621 while (relem <= lastrelem) { /* gobble up all the rest */
627 didstore = av_store(ary,i++,sv);
641 magic = SvMAGICAL(hash) != 0;
644 while (relem < lastrelem) { /* gobble up all the rest */
649 sv = &PL_sv_no, relem++;
650 tmpstr = NEWSV(29,0);
652 sv_setsv(tmpstr,*relem); /* value */
654 didstore = hv_store_ent(hash,sv,tmpstr,0);
656 if (SvSMAGICAL(tmpstr))
659 SvREFCNT_dec(tmpstr);
663 if (relem == lastrelem) {
666 if (ckWARN(WARN_UNSAFE)) {
667 if (relem == firstrelem &&
669 ( SvTYPE(SvRV(*relem)) == SVt_PVAV ||
670 SvTYPE(SvRV(*relem)) == SVt_PVHV ) )
671 warner(WARN_UNSAFE, "Reference found where even-sized list expected");
673 warner(WARN_UNSAFE, "Odd number of elements in hash assignment");
675 tmpstr = NEWSV(29,0);
676 didstore = hv_store_ent(hash,*relem,tmpstr,0);
678 if (SvSMAGICAL(tmpstr))
681 SvREFCNT_dec(tmpstr);
690 if (SvTHINKFIRST(sv)) {
691 if (SvREADONLY(sv) && PL_curcop != &PL_compiling) {
694 if (relem <= lastrelem)
701 if (relem <= lastrelem) {
702 sv_setsv(sv, *relem);
706 sv_setsv(sv, &PL_sv_undef);
711 if (PL_delaymagic & ~DM_DELAY) {
712 if (PL_delaymagic & DM_UID) {
714 (void)setresuid(PL_uid,PL_euid,(Uid_t)-1);
717 (void)setreuid(PL_uid,PL_euid);
720 if ((PL_delaymagic & DM_UID) == DM_RUID) {
721 (void)setruid(PL_uid);
722 PL_delaymagic &= ~DM_RUID;
724 # endif /* HAS_SETRUID */
726 if ((PL_delaymagic & DM_UID) == DM_EUID) {
727 (void)seteuid(PL_uid);
728 PL_delaymagic &= ~DM_EUID;
730 # endif /* HAS_SETEUID */
731 if (PL_delaymagic & DM_UID) {
732 if (PL_uid != PL_euid)
733 DIE("No setreuid available");
734 (void)PerlProc_setuid(PL_uid);
736 # endif /* HAS_SETREUID */
737 #endif /* HAS_SETRESUID */
738 PL_uid = (int)PerlProc_getuid();
739 PL_euid = (int)PerlProc_geteuid();
741 if (PL_delaymagic & DM_GID) {
743 (void)setresgid(PL_gid,PL_egid,(Gid_t)-1);
746 (void)setregid(PL_gid,PL_egid);
749 if ((PL_delaymagic & DM_GID) == DM_RGID) {
750 (void)setrgid(PL_gid);
751 PL_delaymagic &= ~DM_RGID;
753 # endif /* HAS_SETRGID */
755 if ((PL_delaymagic & DM_GID) == DM_EGID) {
756 (void)setegid(PL_gid);
757 PL_delaymagic &= ~DM_EGID;
759 # endif /* HAS_SETEGID */
760 if (PL_delaymagic & DM_GID) {
761 if (PL_gid != PL_egid)
762 DIE("No setregid available");
763 (void)PerlProc_setgid(PL_gid);
765 # endif /* HAS_SETREGID */
766 #endif /* HAS_SETRESGID */
767 PL_gid = (int)PerlProc_getgid();
768 PL_egid = (int)PerlProc_getegid();
770 PL_tainting |= (PL_uid && (PL_euid != PL_uid || PL_egid != PL_gid));
777 else if (gimme == G_SCALAR) {
780 SETi(lastrelem - firstrelem + 1);
786 SP = firstrelem + (lastlelem - firstlelem);
787 lelem = firstlelem + (relem - firstrelem);
789 *relem++ = (lelem <= lastlelem) ? *lelem++ : &PL_sv_undef;
797 register PMOP *pm = cPMOP;
798 SV *rv = sv_newmortal();
799 SV *sv = newSVrv(rv, "Regexp");
800 sv_magic(sv,(SV*)ReREFCNT_inc(pm->op_pmregexp),'r',0,0);
807 register PMOP *pm = cPMOP;
814 register REGEXP *rx = pm->op_pmregexp;
819 I32 oldsave = PL_savestack_ix;
820 I32 update_minmatch = 1;
823 if (PL_op->op_flags & OPf_STACKED)
829 PUTBACK; /* EVAL blocks need stack_sp. */
833 DIE("panic: do_match");
834 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
835 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
838 if (pm->op_pmdynflags & PMdf_USED) {
840 if (gimme == G_ARRAY)
845 if (!rx->prelen && PL_curpm) {
847 rx = pm->op_pmregexp;
849 if (rx->minlen > len) goto failure;
851 screamer = ( (SvSCREAM(TARG) && rx->check_substr
852 && SvTYPE(rx->check_substr) == SVt_PVBM
853 && SvVALID(rx->check_substr))
856 if (global = pm->op_pmflags & PMf_GLOBAL) {
858 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
859 MAGIC* mg = mg_find(TARG, 'g');
860 if (mg && mg->mg_len >= 0) {
861 rx->endp[0] = rx->startp[0] = s + mg->mg_len;
862 minmatch = (mg->mg_flags & MGf_MINMATCH);
867 safebase = ((gimme != G_ARRAY && !global && rx->nparens)
868 || SvTEMP(TARG) || PL_sawampersand)
869 ? REXEC_COPY_STR : 0;
870 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
871 SAVEINT(PL_multiline);
872 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
876 if (global && rx->startp[0]) {
878 if ((s + rx->minlen) > strend)
880 if (update_minmatch++)
881 minmatch = (s == rx->startp[0]);
883 if (rx->check_substr) {
884 if (!(rx->reganch & ROPT_NOSCAN)) { /* Floating checkstring. */
889 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
892 b = (char*)HOP((U8*)s, rx->check_offset_min);
893 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
896 if ((rx->reganch & ROPT_CHECK_ALL)
897 && !PL_sawampersand && !SvTAIL(rx->check_substr))
900 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
901 (unsigned char*)strend,
902 rx->check_substr, 0)))
904 else if ((rx->reganch & ROPT_CHECK_ALL) && !PL_sawampersand)
906 if (s && rx->check_offset_max < s - t) {
907 ++BmUSEFUL(rx->check_substr);
908 s = (char*)HOP((U8*)s, -rx->check_offset_max);
913 /* Now checkstring is fixed, i.e. at fixed offset from the
914 beginning of match, and the match is anchored at s. */
915 else if (!PL_multiline) { /* Anchored near beginning of string. */
917 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
918 if (*SvPVX(rx->check_substr) != *b
919 || ((slen = SvCUR(rx->check_substr)) > 1
920 && memNE(SvPVX(rx->check_substr), b, slen)))
923 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
924 && rx->check_substr == rx->float_substr) {
925 SvREFCNT_dec(rx->check_substr);
926 rx->check_substr = Nullsv; /* opt is being useless */
927 rx->float_substr = Nullsv;
930 if (CALLREGEXEC(rx, s, strend, truebase, minmatch,
931 screamer, NULL, safebase))
934 if (pm->op_pmflags & PMf_ONCE)
935 pm->op_pmdynflags |= PMdf_USED;
944 RX_MATCH_TAINTED_on(rx);
945 TAINT_IF(RX_MATCH_TAINTED(rx));
946 if (gimme == G_ARRAY) {
950 if (global && !iters)
954 SPAGAIN; /* EVAL blocks could move the stack. */
955 EXTEND(SP, iters + i);
956 EXTEND_MORTAL(iters + i);
957 for (i = !i; i <= iters; i++) {
958 PUSHs(sv_newmortal());
960 if ((s = rx->startp[i]) && rx->endp[i] ) {
961 len = rx->endp[i] - s;
962 sv_setpvn(*SP, s, len);
966 truebase = rx->subbeg;
968 if (rx->startp[0] && rx->startp[0] == rx->endp[0])
970 PUTBACK; /* EVAL blocks may use stack */
975 LEAVE_SCOPE(oldsave);
981 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG))
982 mg = mg_find(TARG, 'g');
984 sv_magic(TARG, (SV*)0, 'g', Nullch, 0);
985 mg = mg_find(TARG, 'g');
988 mg->mg_len = rx->endp[0] - rx->subbeg;
989 if (rx->startp[0] == rx->endp[0])
990 mg->mg_flags |= MGf_MINMATCH;
992 mg->mg_flags &= ~MGf_MINMATCH;
995 LEAVE_SCOPE(oldsave);
999 yup: /* Confirmed by check_substr */
1001 RX_MATCH_TAINTED_on(rx);
1002 TAINT_IF(RX_MATCH_TAINTED(rx));
1003 ++BmUSEFUL(rx->check_substr);
1005 if (pm->op_pmflags & PMf_ONCE)
1006 pm->op_pmdynflags |= PMdf_USED;
1007 Safefree(rx->subbase);
1008 rx->subbase = Nullch;
1010 rx->subbeg = truebase;
1011 rx->subend = strend;
1013 rx->endp[0] = s + SvCUR(rx->check_substr);
1016 if (PL_sawampersand) {
1019 tmps = rx->subbase = savepvn(t, strend-t);
1021 rx->subend = tmps + (strend-t);
1022 tmps = rx->startp[0] = tmps + (s - t);
1023 rx->endp[0] = tmps + SvCUR(rx->check_substr);
1025 LEAVE_SCOPE(oldsave);
1029 if (rx->check_substr)
1030 ++BmUSEFUL(rx->check_substr);
1033 if (global && !(pm->op_pmflags & PMf_CONTINUE)) {
1034 if (SvTYPE(TARG) >= SVt_PVMG && SvMAGIC(TARG)) {
1035 MAGIC* mg = mg_find(TARG, 'g');
1040 LEAVE_SCOPE(oldsave);
1041 if (gimme == G_ARRAY)
1049 dSP; dTARGETSTACKED;
1054 register IO *io = GvIO(PL_last_in_gv);
1055 register I32 type = PL_op->op_type;
1056 I32 gimme = GIMME_V;
1059 if (mg = SvTIED_mg((SV*)PL_last_in_gv, 'q')) {
1061 XPUSHs(SvTIED_obj((SV*)PL_last_in_gv, mg));
1064 perl_call_method("READLINE", gimme);
1067 if (gimme == G_SCALAR)
1068 SvSetMagicSV_nosteal(TARG, TOPs);
1075 if (IoFLAGS(io) & IOf_ARGV) {
1076 if (IoFLAGS(io) & IOf_START) {
1077 IoFLAGS(io) &= ~IOf_START;
1079 if (av_len(GvAVn(PL_last_in_gv)) < 0) {
1080 do_open(PL_last_in_gv,"-",1,FALSE,O_RDONLY,0,Nullfp);
1081 sv_setpvn(GvSV(PL_last_in_gv), "-", 1);
1082 SvSETMAGIC(GvSV(PL_last_in_gv));
1087 fp = nextargv(PL_last_in_gv);
1088 if (!fp) { /* Note: fp != IoIFP(io) */
1089 (void)do_close(PL_last_in_gv, FALSE); /* now it does*/
1090 IoFLAGS(io) |= IOf_START;
1093 else if (type == OP_GLOB) {
1094 SV *tmpcmd = NEWSV(55, 0);
1098 #ifdef VMS /* expand the wildcards right here, rather than opening a pipe, */
1099 /* since spawning off a process is a real performance hit */
1101 #include <descrip.h>
1102 #include <lib$routines.h>
1105 char rslt[NAM$C_MAXRSS+1+sizeof(unsigned short int)] = {'\0','\0'};
1106 char vmsspec[NAM$C_MAXRSS+1];
1107 char *rstr = rslt + sizeof(unsigned short int), *begin, *end, *cp;
1108 char tmpfnam[L_tmpnam] = "SYS$SCRATCH:";
1109 $DESCRIPTOR(dfltdsc,"SYS$DISK:[]*.*;");
1112 struct dsc$descriptor_s wilddsc
1113 = {0, DSC$K_DTYPE_T, DSC$K_CLASS_S, 0};
1114 struct dsc$descriptor_vs rsdsc
1115 = {sizeof rslt, DSC$K_DTYPE_VT, DSC$K_CLASS_VS, rslt};
1116 unsigned long int cxt = 0, sts = 0, ok = 1, hasdir = 0, hasver = 0, isunix = 0;
1118 /* We could find out if there's an explicit dev/dir or version
1119 by peeking into lib$find_file's internal context at
1120 ((struct NAM *)((struct FAB *)cxt)->fab$l_nam)->nam$l_fnb
1121 but that's unsupported, so I don't want to do it now and
1122 have it bite someone in the future. */
1123 strcat(tmpfnam,PerlLIO_tmpnam(NULL));
1124 cp = SvPV(tmpglob,i);
1126 if (cp[i] == ';') hasver = 1;
1128 if (sts) hasver = 1;
1132 hasdir = isunix = 1;
1135 if (cp[i] == ']' || cp[i] == '>' || cp[i] == ':') {
1140 if ((tmpfp = PerlIO_open(tmpfnam,"w+","fop=dlt")) != NULL) {
1142 if (!PerlLIO_stat(SvPVX(tmpglob),&st) && S_ISDIR(st.st_mode))
1143 ok = ((wilddsc.dsc$a_pointer = tovmspath(SvPVX(tmpglob),vmsspec)) != NULL);
1144 else ok = ((wilddsc.dsc$a_pointer = tovmsspec(SvPVX(tmpglob),vmsspec)) != NULL);
1145 if (ok) wilddsc.dsc$w_length = (unsigned short int) strlen(wilddsc.dsc$a_pointer);
1146 while (ok && ((sts = lib$find_file(&wilddsc,&rsdsc,&cxt,
1147 &dfltdsc,NULL,NULL,NULL))&1)) {
1148 end = rstr + (unsigned long int) *rslt;
1149 if (!hasver) while (*end != ';') end--;
1150 *(end++) = '\n'; *end = '\0';
1151 for (cp = rstr; *cp; cp++) *cp = _tolower(*cp);
1153 if (isunix) trim_unixpath(rstr,SvPVX(tmpglob),1);
1158 while (*(--begin) != ']' && *begin != '>') ;
1161 ok = (PerlIO_puts(tmpfp,begin) != EOF);
1163 if (cxt) (void)lib$find_file_end(&cxt);
1164 if (ok && sts != RMS$_NMF &&
1165 sts != RMS$_DNF && sts != RMS$_FNF) ok = 0;
1168 SETERRNO((sts == RMS$_SYN ? EINVAL : EVMSERR),sts);
1170 PerlIO_close(tmpfp);
1174 PerlIO_rewind(tmpfp);
1176 IoIFP(io) = fp = tmpfp;
1177 IoFLAGS(io) &= ~IOf_UNTAINT; /* maybe redundant */
1184 sv_setpv(tmpcmd, "for a in ");
1185 sv_catsv(tmpcmd, tmpglob);
1186 sv_catpv(tmpcmd, "; do echo \"$a\\0\\c\"; done |");
1189 sv_setpv(tmpcmd, "/dev/dosglob/"); /* File System Extension */
1190 sv_catsv(tmpcmd, tmpglob);
1192 sv_setpv(tmpcmd, "perlglob ");
1193 sv_catsv(tmpcmd, tmpglob);
1194 sv_catpv(tmpcmd, " |");
1199 sv_setpvn(tmpcmd, PL_cshname, PL_cshlen);
1200 sv_catpv(tmpcmd, " -cf 'set nonomatch; glob ");
1201 sv_catsv(tmpcmd, tmpglob);
1202 sv_catpv(tmpcmd, "' 2>/dev/null |");
1204 sv_setpv(tmpcmd, "echo ");
1205 sv_catsv(tmpcmd, tmpglob);
1207 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\012\\012\\012\\012'|");
1209 sv_catpv(tmpcmd, "|tr -s ' \t\f\r' '\\n\\n\\n\\n'|");
1212 #endif /* !DOSISH */
1213 (void)do_open(PL_last_in_gv, SvPVX(tmpcmd), SvCUR(tmpcmd),
1214 FALSE, O_RDONLY, 0, Nullfp);
1220 else if (type == OP_GLOB)
1224 if (ckWARN(WARN_CLOSED) && io && !(IoFLAGS(io) & IOf_START))
1226 "Read on closed filehandle <%s>", GvENAME(PL_last_in_gv));
1227 if (gimme == G_SCALAR) {
1228 (void)SvOK_off(TARG);
1234 if (gimme == G_SCALAR) {
1238 (void)SvUPGRADE(sv, SVt_PV);
1239 tmplen = SvLEN(sv); /* remember if already alloced */
1241 Sv_Grow(sv, 80); /* try short-buffering it */
1242 if (type == OP_RCATLINE)
1248 sv = sv_2mortal(NEWSV(57, 80));
1252 if (!sv_gets(sv, fp, offset)) {
1253 PerlIO_clearerr(fp);
1254 if (IoFLAGS(io) & IOf_ARGV) {
1255 fp = nextargv(PL_last_in_gv);
1258 (void)do_close(PL_last_in_gv, FALSE);
1259 IoFLAGS(io) |= IOf_START;
1261 else if (type == OP_GLOB) {
1262 if (!do_close(PL_last_in_gv, FALSE) && ckWARN(WARN_CLOSED)) {
1264 "glob failed (child exited with status %d%s)",
1265 STATUS_CURRENT >> 8,
1266 (STATUS_CURRENT & 0x80) ? ", core dumped" : "");
1269 if (gimme == G_SCALAR) {
1270 (void)SvOK_off(TARG);
1275 /* This should not be marked tainted if the fp is marked clean */
1276 if (!(IoFLAGS(io) & IOf_UNTAINT)) {
1283 if (type == OP_GLOB) {
1286 if (SvCUR(sv) > 0 && SvCUR(PL_rs) > 0) {
1287 tmps = SvEND(sv) - 1;
1288 if (*tmps == *SvPVX(PL_rs)) {
1293 for (tmps = SvPVX(sv); *tmps; tmps++)
1294 if (!isALPHA(*tmps) && !isDIGIT(*tmps) &&
1295 strchr("$&*(){}[]'\";\\|?<>~`", *tmps))
1297 if (*tmps && PerlLIO_stat(SvPVX(sv), &PL_statbuf) < 0) {
1298 (void)POPs; /* Unmatched wildcard? Chuck it... */
1302 if (gimme == G_ARRAY) {
1303 if (SvLEN(sv) - SvCUR(sv) > 20) {
1304 SvLEN_set(sv, SvCUR(sv)+1);
1305 Renew(SvPVX(sv), SvLEN(sv), char);
1307 sv = sv_2mortal(NEWSV(58, 80));
1310 else if (gimme == G_SCALAR && !tmplen && SvLEN(sv) - SvCUR(sv) > 80) {
1311 /* try to reclaim a bit of scalar space (only on 1st alloc) */
1315 SvLEN_set(sv, SvCUR(sv)+40); /* allow some slop */
1316 Renew(SvPVX(sv), SvLEN(sv), char);
1325 register PERL_CONTEXT *cx;
1326 I32 gimme = OP_GIMME(PL_op, -1);
1329 if (cxstack_ix >= 0)
1330 gimme = cxstack[cxstack_ix].blk_gimme;
1338 PUSHBLOCK(cx, CXt_BLOCK, SP);
1350 U32 lval = PL_op->op_flags & OPf_MOD;
1351 U32 defer = PL_op->op_private & OPpLVAL_DEFER;
1354 if (SvTYPE(hv) == SVt_PVHV) {
1355 he = hv_fetch_ent(hv, keysv, lval && !defer, 0);
1356 svp = he ? &HeVAL(he) : 0;
1358 else if (SvTYPE(hv) == SVt_PVAV) {
1359 if (PL_op->op_private & OPpLVAL_INTRO)
1360 DIE("Can't localize pseudo-hash element");
1361 svp = avhv_fetch_ent((AV*)hv, keysv, lval && !defer, 0);
1367 if (!svp || *svp == &PL_sv_undef) {
1371 DIE(no_helem, SvPV(keysv, PL_na));
1372 lv = sv_newmortal();
1373 sv_upgrade(lv, SVt_PVLV);
1375 sv_magic(lv, key2 = newSVsv(keysv), 'y', Nullch, 0);
1376 SvREFCNT_dec(key2); /* sv_magic() increments refcount */
1377 LvTARG(lv) = SvREFCNT_inc(hv);
1382 if (PL_op->op_private & OPpLVAL_INTRO) {
1383 if (HvNAME(hv) && isGV(*svp))
1384 save_gp((GV*)*svp, !(PL_op->op_flags & OPf_SPECIAL));
1386 save_helem(hv, keysv, svp);
1388 else if (PL_op->op_private & OPpDEREF)
1389 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
1391 sv = (svp ? *svp : &PL_sv_undef);
1392 /* This makes C<local $tied{foo} = $tied{foo}> possible.
1393 * Pushing the magical RHS on to the stack is useless, since
1394 * that magic is soon destined to be misled by the local(),
1395 * and thus the later pp_sassign() will fail to mg_get() the
1396 * old value. This should also cure problems with delayed
1397 * mg_get()s. GSAR 98-07-03 */
1398 if (!lval && SvGMAGICAL(sv))
1399 sv = sv_mortalcopy(sv);
1407 register PERL_CONTEXT *cx;
1413 if (PL_op->op_flags & OPf_SPECIAL) {
1414 cx = &cxstack[cxstack_ix];
1415 cx->blk_oldpm = PL_curpm; /* fake block should preserve $1 et al */
1420 gimme = OP_GIMME(PL_op, -1);
1422 if (cxstack_ix >= 0)
1423 gimme = cxstack[cxstack_ix].blk_gimme;
1429 if (gimme == G_VOID)
1431 else if (gimme == G_SCALAR) {
1434 if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1437 *MARK = sv_mortalcopy(TOPs);
1440 *MARK = &PL_sv_undef;
1444 else if (gimme == G_ARRAY) {
1445 /* in case LEAVE wipes old return values */
1446 for (mark = newsp + 1; mark <= SP; mark++) {
1447 if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1448 *mark = sv_mortalcopy(*mark);
1449 TAINT_NOT; /* Each item is independent */
1453 PL_curpm = newpm; /* Don't pop $1 et al till now */
1463 register PERL_CONTEXT *cx;
1468 cx = &cxstack[cxstack_ix];
1469 if (CxTYPE(cx) != CXt_LOOP)
1470 DIE("panic: pp_iter");
1472 av = cx->blk_loop.iterary;
1473 if (SvTYPE(av) != SVt_PVAV) {
1474 /* iterate ($min .. $max) */
1475 if (cx->blk_loop.iterlval) {
1476 /* string increment */
1477 register SV* cur = cx->blk_loop.iterlval;
1479 char *max = SvPV((SV*)av, maxlen);
1480 if (!SvNIOK(cur) && SvCUR(cur) <= maxlen) {
1481 #ifndef USE_THREADS /* don't risk potential race */
1482 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1483 && !SvMAGICAL(*cx->blk_loop.itervar))
1485 /* safe to reuse old SV */
1486 sv_setsv(*cx->blk_loop.itervar, cur);
1491 /* we need a fresh SV every time so that loop body sees a
1492 * completely new SV for closures/references to work as
1494 SvREFCNT_dec(*cx->blk_loop.itervar);
1495 *cx->blk_loop.itervar = newSVsv(cur);
1497 if (strEQ(SvPVX(cur), max))
1498 sv_setiv(cur, 0); /* terminate next time */
1505 /* integer increment */
1506 if (cx->blk_loop.iterix > cx->blk_loop.itermax)
1509 #ifndef USE_THREADS /* don't risk potential race */
1510 if (SvREFCNT(*cx->blk_loop.itervar) == 1
1511 && !SvMAGICAL(*cx->blk_loop.itervar))
1513 /* safe to reuse old SV */
1514 sv_setiv(*cx->blk_loop.itervar, cx->blk_loop.iterix++);
1519 /* we need a fresh SV every time so that loop body sees a
1520 * completely new SV for closures/references to work as they
1522 SvREFCNT_dec(*cx->blk_loop.itervar);
1523 *cx->blk_loop.itervar = newSViv(cx->blk_loop.iterix++);
1529 if (cx->blk_loop.iterix >= (av == PL_curstack ? cx->blk_oldsp : AvFILL(av)))
1532 SvREFCNT_dec(*cx->blk_loop.itervar);
1534 if (sv = (SvMAGICAL(av))
1535 ? *av_fetch(av, ++cx->blk_loop.iterix, FALSE)
1536 : AvARRAY(av)[++cx->blk_loop.iterix])
1540 if (av != PL_curstack && SvIMMORTAL(sv)) {
1541 SV *lv = cx->blk_loop.iterlval;
1542 if (lv && SvREFCNT(lv) > 1) {
1547 SvREFCNT_dec(LvTARG(lv));
1549 lv = cx->blk_loop.iterlval = NEWSV(26, 0);
1550 sv_upgrade(lv, SVt_PVLV);
1552 sv_magic(lv, Nullsv, 'y', Nullch, 0);
1554 LvTARG(lv) = SvREFCNT_inc(av);
1555 LvTARGOFF(lv) = cx->blk_loop.iterix;
1556 LvTARGLEN(lv) = (UV) -1;
1560 *cx->blk_loop.itervar = SvREFCNT_inc(sv);
1567 register PMOP *pm = cPMOP;
1583 register REGEXP *rx = pm->op_pmregexp;
1585 int force_on_match = 0;
1586 I32 oldsave = PL_savestack_ix;
1587 I32 update_minmatch = 1;
1590 /* known replacement string? */
1591 dstr = (pm->op_pmflags & PMf_CONST) ? POPs : Nullsv;
1592 if (PL_op->op_flags & OPf_STACKED)
1598 if (SvREADONLY(TARG)
1599 || (SvTYPE(TARG) > SVt_PVLV
1600 && !(SvTYPE(TARG) == SVt_PVGV && SvFAKE(TARG))))
1604 s = SvPV(TARG, len);
1605 if (!SvPOKp(TARG) || SvTYPE(TARG) == SVt_PVGV)
1607 rxtainted = ((pm->op_pmdynflags & PMdf_TAINTED) ||
1608 (PL_tainted && (pm->op_pmflags & PMf_RETAINT)));
1615 DIE("panic: do_subst");
1618 maxiters = 2*(strend - s) + 10; /* We can match twice at each
1619 position, once with zero-length,
1620 second time with non-zero. */
1622 if (!rx->prelen && PL_curpm) {
1624 rx = pm->op_pmregexp;
1626 screamer = ( (SvSCREAM(TARG) && rx->check_substr
1627 && SvTYPE(rx->check_substr) == SVt_PVBM
1628 && SvVALID(rx->check_substr))
1630 safebase = (rx->nparens || SvTEMP(TARG) || PL_sawampersand)
1631 ? REXEC_COPY_STR : 0;
1632 if (pm->op_pmflags & (PMf_MULTILINE|PMf_SINGLELINE)) {
1633 SAVEINT(PL_multiline);
1634 PL_multiline = pm->op_pmflags & PMf_MULTILINE;
1637 if (rx->check_substr) {
1638 if (!(rx->reganch & ROPT_NOSCAN)) { /* It floats. */
1643 if (PL_screamfirst[BmRARE(rx->check_substr)] < 0)
1646 b = (char*)HOP((U8*)s, rx->check_offset_min);
1647 if (!(s = screaminstr(TARG, rx->check_substr, b - s, 0, &p, 0)))
1650 else if (!(s = fbm_instr((unsigned char*)HOP((U8*)s, rx->check_offset_min),
1651 (unsigned char*)strend,
1652 rx->check_substr, 0)))
1654 if (s && rx->check_offset_max < s - m) {
1655 ++BmUSEFUL(rx->check_substr);
1656 s = (char*)HOP((U8*)s, -rx->check_offset_max);
1661 /* Now checkstring is fixed, i.e. at fixed offset from the
1662 beginning of match, and the match is anchored at s. */
1663 else if (!PL_multiline) { /* Anchored at beginning of string. */
1665 char *b = (char*)HOP((U8*)s, rx->check_offset_min);
1666 if (*SvPVX(rx->check_substr) != *b
1667 || ((slen = SvCUR(rx->check_substr)) > 1
1668 && memNE(SvPVX(rx->check_substr), b, slen)))
1671 if (!(rx->reganch & ROPT_NAUGHTY) && --BmUSEFUL(rx->check_substr) < 0
1672 && rx->check_substr == rx->float_substr) {
1673 SvREFCNT_dec(rx->check_substr);
1674 rx->check_substr = Nullsv; /* opt is being useless */
1675 rx->float_substr = Nullsv;
1679 /* only replace once? */
1680 once = !(rpm->op_pmflags & PMf_GLOBAL);
1682 /* known replacement string? */
1683 c = dstr ? SvPV(dstr, clen) : Nullch;
1685 /* can do inplace substitution? */
1686 if (c && clen <= rx->minlen && (once || !(safebase & REXEC_COPY_STR))
1687 && !(rx->reganch & ROPT_LOOKBEHIND_SEEN)) {
1688 if (!CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1691 LEAVE_SCOPE(oldsave);
1694 if (force_on_match) {
1696 s = SvPV_force(TARG, len);
1701 SvSCREAM_off(TARG); /* disable possible screamer */
1703 rxtainted |= RX_MATCH_TAINTED(rx);
1705 m = orig + (rx->startp[0] - rx->subbase);
1706 d = orig + (rx->endp[0] - rx->subbase);
1712 if (m - s > strend - d) { /* faster to shorten from end */
1714 Copy(c, m, clen, char);
1719 Move(d, m, i, char);
1723 SvCUR_set(TARG, m - s);
1726 else if (i = m - s) { /* faster from front */
1734 Copy(c, m, clen, char);
1739 Copy(c, d, clen, char);
1744 TAINT_IF(rxtainted & 1);
1750 if (iters++ > maxiters)
1751 DIE("Substitution loop");
1752 rxtainted |= RX_MATCH_TAINTED(rx);
1757 Move(s, d, i, char);
1761 Copy(c, d, clen, char);
1765 } while (CALLREGEXEC(rx, s, strend, orig, s == m,
1766 Nullsv, NULL, 0)); /* don't match same null twice */
1769 SvCUR_set(TARG, d - SvPVX(TARG) + i);
1770 Move(s, d, i+1, char); /* include the NUL */
1772 TAINT_IF(rxtainted & 1);
1774 PUSHs(sv_2mortal(newSViv((I32)iters)));
1776 (void)SvPOK_only(TARG);
1777 TAINT_IF(rxtainted);
1778 if (SvSMAGICAL(TARG)) {
1784 LEAVE_SCOPE(oldsave);
1788 if (CALLREGEXEC(rx, s, strend, orig, 0, screamer, NULL, safebase)) {
1789 if (force_on_match) {
1791 s = SvPV_force(TARG, len);
1794 rxtainted |= RX_MATCH_TAINTED(rx);
1795 dstr = NEWSV(25, len);
1796 sv_setpvn(dstr, m, s-m);
1799 register PERL_CONTEXT *cx;
1802 RETURNOP(cPMOP->op_pmreplroot);
1805 if (iters++ > maxiters)
1806 DIE("Substitution loop");
1807 rxtainted |= RX_MATCH_TAINTED(rx);
1808 if (rx->subbase && rx->subbase != orig) {
1813 strend = s + (strend - m);
1816 sv_catpvn(dstr, s, m-s);
1819 sv_catpvn(dstr, c, clen);
1822 } while (CALLREGEXEC(rx, s, strend, orig, s == m, Nullsv, NULL, safebase));
1823 sv_catpvn(dstr, s, strend - s);
1825 (void)SvOOK_off(TARG);
1826 Safefree(SvPVX(TARG));
1827 SvPVX(TARG) = SvPVX(dstr);
1828 SvCUR_set(TARG, SvCUR(dstr));
1829 SvLEN_set(TARG, SvLEN(dstr));
1833 TAINT_IF(rxtainted & 1);
1835 PUSHs(sv_2mortal(newSViv((I32)iters)));
1837 (void)SvPOK_only(TARG);
1838 TAINT_IF(rxtainted);
1841 LEAVE_SCOPE(oldsave);
1847 ++BmUSEFUL(rx->check_substr);
1852 LEAVE_SCOPE(oldsave);
1861 PL_stack_base[PL_markstack_ptr[-1]++] = PL_stack_base[*PL_markstack_ptr];
1862 ++*PL_markstack_ptr;
1863 LEAVE; /* exit inner scope */
1866 if (PL_stack_base + *PL_markstack_ptr > SP) {
1868 I32 gimme = GIMME_V;
1870 LEAVE; /* exit outer scope */
1871 (void)POPMARK; /* pop src */
1872 items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1873 (void)POPMARK; /* pop dst */
1874 SP = PL_stack_base + POPMARK; /* pop original mark */
1875 if (gimme == G_SCALAR) {
1879 else if (gimme == G_ARRAY)
1886 ENTER; /* enter inner scope */
1889 src = PL_stack_base[*PL_markstack_ptr];
1893 RETURNOP(cLOGOP->op_other);
1904 register PERL_CONTEXT *cx;
1905 struct block_sub cxsub;
1908 POPSUB1(cx); /* Delay POPSUB2 until stack values are safe */
1911 if (gimme == G_SCALAR) {
1914 if (cxsub.cv && CvDEPTH(cxsub.cv) > 1) {
1916 *MARK = SvREFCNT_inc(TOPs);
1921 *MARK = sv_mortalcopy(TOPs);
1924 *MARK = SvTEMP(TOPs) ? TOPs : sv_mortalcopy(TOPs);
1927 *MARK = &PL_sv_undef;
1931 else if (gimme == G_ARRAY) {
1932 for (MARK = newsp + 1; MARK <= SP; MARK++) {
1933 if (!SvTEMP(*MARK)) {
1934 *MARK = sv_mortalcopy(*MARK);
1935 TAINT_NOT; /* Each item is independent */
1941 POPSUB2(); /* Stack values are safe: release CV and @_ ... */
1942 PL_curpm = newpm; /* ... and pop $1 et al */
1945 return pop_return();
1949 get_db_sub(SV **svp, CV *cv)
1952 SV *dbsv = GvSV(PL_DBsub);
1954 if (!PERLDB_SUB_NN) {
1958 if ( (CvFLAGS(cv) & (CVf_ANON | CVf_CLONED))
1959 || strEQ(GvNAME(gv), "END")
1960 || ((GvCV(gv) != cv) && /* Could be imported, and old sub redefined. */
1961 !( (SvTYPE(*svp) == SVt_PVGV) && (GvCV((GV*)*svp) == cv)
1962 && (gv = (GV*)*svp) ))) {
1963 /* Use GV from the stack as a fallback. */
1964 /* GV is potentially non-unique, or contain different CV. */
1965 sv_setsv(dbsv, newRV((SV*)cv));
1968 gv_efullname3(dbsv, gv, Nullch);
1972 SvUPGRADE(dbsv, SVt_PVIV);
1974 SAVEIV(SvIVX(dbsv));
1975 SvIVX(dbsv) = (IV)cv; /* Do it the quickest way */
1979 PL_curcopdb = PL_curcop;
1980 cv = GvCV(PL_DBsub);
1990 register PERL_CONTEXT *cx;
1992 bool hasargs = (PL_op->op_flags & OPf_STACKED) != 0;
1995 DIE("Not a CODE reference");
1996 switch (SvTYPE(sv)) {
2001 if (sv == &PL_sv_yes) { /* unfound import, ignore */
2003 SP = PL_stack_base + POPMARK;
2006 if (SvGMAGICAL(sv)) {
2008 sym = SvPOKp(sv) ? SvPVX(sv) : Nullch;
2011 sym = SvPV(sv, PL_na);
2013 DIE(no_usym, "a subroutine");
2014 if (PL_op->op_private & HINT_STRICT_REFS)
2015 DIE(no_symref, sym, "a subroutine");
2016 cv = perl_get_cv(sym, TRUE);
2020 if (SvTYPE(cv) == SVt_PVCV)
2025 DIE("Not a CODE reference");
2030 if (!(cv = GvCVu((GV*)sv)))
2031 cv = sv_2cv(sv, &stash, &gv, TRUE);
2040 DIE("Not a CODE reference");
2042 if (!CvROOT(cv) && !CvXSUB(cv)) {
2046 /* anonymous or undef'd function leaves us no recourse */
2047 if (CvANON(cv) || !(gv = CvGV(cv)))
2048 DIE("Undefined subroutine called");
2049 /* autoloaded stub? */
2050 if (cv != GvCV(gv)) {
2054 /* should call AUTOLOAD now? */
2055 if ((autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv), GvNAMELEN(gv),
2062 sub_name = sv_newmortal();
2063 gv_efullname3(sub_name, gv, Nullch);
2064 DIE("Undefined subroutine &%s called", SvPVX(sub_name));
2068 if ((PL_op->op_private & OPpENTERSUB_DB) && GvCV(PL_DBsub) && !CvNODEBUG(cv))
2069 cv = get_db_sub(&sv, cv);
2071 DIE("No DBsub routine");
2075 * First we need to check if the sub or method requires locking.
2076 * If so, we gain a lock on the CV, the first argument or the
2077 * stash (for static methods), as appropriate. This has to be
2078 * inline because for FAKE_THREADS, COND_WAIT inlines code to
2079 * reschedule by returning a new op.
2081 MUTEX_LOCK(CvMUTEXP(cv));
2082 if (CvFLAGS(cv) & CVf_LOCKED) {
2084 if (CvFLAGS(cv) & CVf_METHOD) {
2085 if (SP > PL_stack_base + TOPMARK)
2086 sv = *(PL_stack_base + TOPMARK + 1);
2088 MUTEX_UNLOCK(CvMUTEXP(cv));
2089 croak("no argument for locked method call");
2095 char *stashname = SvPV(sv, len);
2096 sv = (SV*)gv_stashpvn(stashname, len, TRUE);
2102 MUTEX_UNLOCK(CvMUTEXP(cv));
2103 mg = condpair_magic(sv);
2104 MUTEX_LOCK(MgMUTEXP(mg));
2105 if (MgOWNER(mg) == thr)
2106 MUTEX_UNLOCK(MgMUTEXP(mg));
2109 COND_WAIT(MgOWNERCONDP(mg), MgMUTEXP(mg));
2111 DEBUG_S(PerlIO_printf(PerlIO_stderr(), "%p: pp_entersub lock %p\n",
2113 MUTEX_UNLOCK(MgMUTEXP(mg));
2114 save_destructor(unlock_condpair, sv);
2116 MUTEX_LOCK(CvMUTEXP(cv));
2119 * Now we have permission to enter the sub, we must distinguish
2120 * four cases. (0) It's an XSUB (in which case we don't care
2121 * about ownership); (1) it's ours already (and we're recursing);
2122 * (2) it's free (but we may already be using a cached clone);
2123 * (3) another thread owns it. Case (1) is easy: we just use it.
2124 * Case (2) means we look for a clone--if we have one, use it
2125 * otherwise grab ownership of cv. Case (3) means we look for a
2126 * clone (for non-XSUBs) and have to create one if we don't
2128 * Why look for a clone in case (2) when we could just grab
2129 * ownership of cv straight away? Well, we could be recursing,
2130 * i.e. we originally tried to enter cv while another thread
2131 * owned it (hence we used a clone) but it has been freed up
2132 * and we're now recursing into it. It may or may not be "better"
2133 * to use the clone but at least CvDEPTH can be trusted.
2135 if (CvOWNER(cv) == thr || CvXSUB(cv))
2136 MUTEX_UNLOCK(CvMUTEXP(cv));
2138 /* Case (2) or (3) */
2142 * XXX Might it be better to release CvMUTEXP(cv) while we
2143 * do the hv_fetch? We might find someone has pinched it
2144 * when we look again, in which case we would be in case
2145 * (3) instead of (2) so we'd have to clone. Would the fact
2146 * that we released the mutex more quickly make up for this?
2149 (svp = hv_fetch(thr->cvcache, (char *)cv, sizeof(cv), FALSE)))
2151 /* We already have a clone to use */
2152 MUTEX_UNLOCK(CvMUTEXP(cv));
2154 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2155 "entersub: %p already has clone %p:%s\n",
2156 thr, cv, SvPEEK((SV*)cv)));
2159 if (CvDEPTH(cv) == 0)
2160 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2163 /* (2) => grab ownership of cv. (3) => make clone */
2167 MUTEX_UNLOCK(CvMUTEXP(cv));
2168 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2169 "entersub: %p grabbing %p:%s in stash %s\n",
2170 thr, cv, SvPEEK((SV*)cv), CvSTASH(cv) ?
2171 HvNAME(CvSTASH(cv)) : "(none)"));
2173 /* Make a new clone. */
2175 SvREFCNT_inc(cv); /* don't let it vanish from under us */
2176 MUTEX_UNLOCK(CvMUTEXP(cv));
2177 DEBUG_S((PerlIO_printf(PerlIO_stderr(),
2178 "entersub: %p cloning %p:%s\n",
2179 thr, cv, SvPEEK((SV*)cv))));
2181 * We're creating a new clone so there's no race
2182 * between the original MUTEX_UNLOCK and the
2183 * SvREFCNT_inc since no one will be trying to undef
2184 * it out from underneath us. At least, I don't think
2187 clonecv = cv_clone(cv);
2188 SvREFCNT_dec(cv); /* finished with this */
2189 hv_store(thr->cvcache, (char*)cv, sizeof(cv), (SV*)clonecv,0);
2190 CvOWNER(clonecv) = thr;
2194 DEBUG_S(if (CvDEPTH(cv) != 0)
2195 PerlIO_printf(PerlIO_stderr(), "depth %ld != 0\n",
2197 SAVEDESTRUCTOR(unset_cvowner, (void*) cv);
2200 #endif /* USE_THREADS */
2203 if (CvOLDSTYLE(cv)) {
2204 I32 (*fp3)_((int,int,int));
2206 register I32 items = SP - MARK;
2207 /* We dont worry to copy from @_. */
2212 PL_stack_sp = mark + 1;
2213 fp3 = (I32(*)_((int,int,int)))CvXSUB(cv);
2214 items = (*fp3)(CvXSUBANY(cv).any_i32,
2215 MARK - PL_stack_base + 1,
2217 PL_stack_sp = PL_stack_base + items;
2220 I32 markix = TOPMARK;
2225 /* Need to copy @_ to stack. Alternative may be to
2226 * switch stack to @_, and copy return values
2227 * back. This would allow popping @_ in XSUB, e.g.. XXXX */
2231 av = (AV*)PL_curpad[0];
2233 av = GvAV(PL_defgv);
2234 #endif /* USE_THREADS */
2235 items = AvFILLp(av) + 1; /* @_ is not tieable */
2238 /* Mark is at the end of the stack. */
2240 Copy(AvARRAY(av), SP + 1, items, SV*);
2245 if (PL_curcopdb) { /* We assume that the first
2246 XSUB in &DB::sub is the
2248 SAVESPTR(PL_curcop);
2249 PL_curcop = PL_curcopdb;
2252 /* Do we need to open block here? XXXX */
2253 (void)(*CvXSUB(cv))(cv _PERL_OBJECT_THIS);
2255 /* Enforce some sanity in scalar context. */
2256 if (gimme == G_SCALAR && ++markix != PL_stack_sp - PL_stack_base ) {
2257 if (markix > PL_stack_sp - PL_stack_base)
2258 *(PL_stack_base + markix) = &PL_sv_undef;
2260 *(PL_stack_base + markix) = *PL_stack_sp;
2261 PL_stack_sp = PL_stack_base + markix;
2269 register I32 items = SP - MARK;
2270 AV* padlist = CvPADLIST(cv);
2271 SV** svp = AvARRAY(padlist);
2272 push_return(PL_op->op_next);
2273 PUSHBLOCK(cx, CXt_SUB, MARK);
2276 /* XXX This would be a natural place to set C<PL_compcv = cv> so
2277 * that eval'' ops within this sub know the correct lexical space.
2278 * Owing the speed considerations, we choose to search for the cv
2279 * in doeval() instead.
2281 if (CvDEPTH(cv) < 2)
2282 (void)SvREFCNT_inc(cv);
2283 else { /* save temporaries on recursion? */
2284 if (CvDEPTH(cv) > AvFILLp(padlist)) {
2286 AV *newpad = newAV();
2287 SV **oldpad = AvARRAY(svp[CvDEPTH(cv)-1]);
2288 I32 ix = AvFILLp((AV*)svp[1]);
2289 svp = AvARRAY(svp[0]);
2290 for ( ;ix > 0; ix--) {
2291 if (svp[ix] != &PL_sv_undef) {
2292 char *name = SvPVX(svp[ix]);
2293 if ((SvFLAGS(svp[ix]) & SVf_FAKE) /* outer lexical? */
2294 || *name == '&') /* anonymous code? */
2296 av_store(newpad, ix, SvREFCNT_inc(oldpad[ix]));
2298 else { /* our own lexical */
2300 av_store(newpad, ix, sv = (SV*)newAV());
2301 else if (*name == '%')
2302 av_store(newpad, ix, sv = (SV*)newHV());
2304 av_store(newpad, ix, sv = NEWSV(0,0));
2309 av_store(newpad, ix, sv = NEWSV(0,0));
2313 av = newAV(); /* will be @_ */
2315 av_store(newpad, 0, (SV*)av);
2316 AvFLAGS(av) = AVf_REIFY;
2317 av_store(padlist, CvDEPTH(cv), (SV*)newpad);
2318 AvFILLp(padlist) = CvDEPTH(cv);
2319 svp = AvARRAY(padlist);
2324 AV* av = (AV*)PL_curpad[0];
2326 items = AvFILLp(av) + 1;
2328 /* Mark is at the end of the stack. */
2330 Copy(AvARRAY(av), SP + 1, items, SV*);
2335 #endif /* USE_THREADS */
2336 SAVESPTR(PL_curpad);
2337 PL_curpad = AvARRAY((AV*)svp[CvDEPTH(cv)]);
2340 #endif /* USE_THREADS */
2346 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2347 "%p entersub preparing @_\n", thr));
2349 av = (AV*)PL_curpad[0];
2355 cx->blk_sub.savearray = GvAV(PL_defgv);
2356 GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
2357 #endif /* USE_THREADS */
2358 cx->blk_sub.argarray = av;
2361 if (items > AvMAX(av) + 1) {
2363 if (AvARRAY(av) != ary) {
2364 AvMAX(av) += AvARRAY(av) - AvALLOC(av);
2365 SvPVX(av) = (char*)ary;
2367 if (items > AvMAX(av) + 1) {
2368 AvMAX(av) = items - 1;
2369 Renew(ary,items,SV*);
2371 SvPVX(av) = (char*)ary;
2374 Copy(MARK,AvARRAY(av),items,SV*);
2375 AvFILLp(av) = items - 1;
2383 /* warning must come *after* we fully set up the context
2384 * stuff so that __WARN__ handlers can safely dounwind()
2387 if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION)
2388 && !(PERLDB_SUB && cv == GvCV(PL_DBsub)))
2389 sub_crush_depth(cv);
2391 DEBUG_S(PerlIO_printf(PerlIO_stderr(),
2392 "%p entersub returning %p\n", thr, CvSTART(cv)));
2394 RETURNOP(CvSTART(cv));
2399 sub_crush_depth(CV *cv)
2402 warner(WARN_RECURSION, "Deep recursion on anonymous subroutine");
2404 SV* tmpstr = sv_newmortal();
2405 gv_efullname3(tmpstr, CvGV(cv), Nullch);
2406 warner(WARN_RECURSION, "Deep recursion on subroutine \"%s\"",
2417 U32 lval = PL_op->op_flags & OPf_MOD;
2418 U32 defer = (PL_op->op_private & OPpLVAL_DEFER) && (elem > AvFILL(av));
2422 elem -= PL_curcop->cop_arybase;
2423 if (SvTYPE(av) != SVt_PVAV)
2425 svp = av_fetch(av, elem, lval && !defer);
2427 if (!svp || *svp == &PL_sv_undef) {
2430 DIE(no_aelem, elem);
2431 lv = sv_newmortal();
2432 sv_upgrade(lv, SVt_PVLV);
2434 sv_magic(lv, Nullsv, 'y', Nullch, 0);
2435 LvTARG(lv) = SvREFCNT_inc(av);
2436 LvTARGOFF(lv) = elem;
2441 if (PL_op->op_private & OPpLVAL_INTRO)
2442 save_aelem(av, elem, svp);
2443 else if (PL_op->op_private & OPpDEREF)
2444 vivify_ref(*svp, PL_op->op_private & OPpDEREF);
2446 sv = (svp ? *svp : &PL_sv_undef);
2447 if (!lval && SvGMAGICAL(sv)) /* see note in pp_helem() */
2448 sv = sv_mortalcopy(sv);
2454 vivify_ref(SV *sv, U32 to_what)
2461 if (SvTYPE(sv) < SVt_RV)
2462 sv_upgrade(sv, SVt_RV);
2463 else if (SvTYPE(sv) >= SVt_PV) {
2464 (void)SvOOK_off(sv);
2465 Safefree(SvPVX(sv));
2466 SvLEN(sv) = SvCUR(sv) = 0;
2470 SvRV(sv) = NEWSV(355,0);
2473 SvRV(sv) = (SV*)newAV();
2476 SvRV(sv) = (SV*)newHV();
2497 if (SvTYPE(sv) == SVt_PVCV) {
2503 name = SvPV(TOPs, PL_na);
2504 sv = *(PL_stack_base + TOPMARK + 1);
2515 !(packname = SvPV(sv, packlen)) ||
2516 !(iogv = gv_fetchpv(packname, FALSE, SVt_PVIO)) ||
2517 !(ob=(SV*)GvIO(iogv)))
2520 ((*(U8*)packname >= 0xc0 && IN_UTF8)
2521 ? !isIDFIRST_utf8(packname)
2522 : !isIDFIRST(*packname)
2525 DIE("Can't call method \"%s\" %s", name,
2526 SvOK(sv)? "without a package or object reference"
2527 : "on an undefined value");
2529 stash = gv_stashpvn(packname, packlen, TRUE);
2532 *(PL_stack_base + TOPMARK + 1) = sv_2mortal(newRV((SV*)iogv));
2535 if (!ob || !SvOBJECT(ob))
2536 DIE("Can't call method \"%s\" on unblessed reference", name);
2538 stash = SvSTASH(ob);
2541 gv = gv_fetchmethod(stash, name);
2547 for (p = name; *p; p++) {
2549 sep = p, leaf = p + 1;
2550 else if (*p == ':' && *(p + 1) == ':')
2551 sep = p, leaf = p + 2;
2553 if (!sep || ((sep - name) == 5 && strnEQ(name, "SUPER", 5))) {
2554 packname = HvNAME(sep ? PL_curcop->cop_stash : stash);
2555 packlen = strlen(packname);
2559 packlen = sep - name;
2561 DIE("Can't locate object method \"%s\" via package \"%.*s\"",
2562 leaf, (int)packlen, packname);
2564 SETs(isGV(gv) ? (SV*)GvCV(gv) : (SV*)gv);