1N/A/* pp_ctl.c
1N/A *
1N/A * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999,
1N/A * 2000, 2001, 2002, 2003, 2004, by Larry Wall and others
1N/A *
1N/A * You may distribute under the terms of either the GNU General Public
1N/A * License or the Artistic License, as specified in the README file.
1N/A *
1N/A */
1N/A
1N/A/*
1N/A * Now far ahead the Road has gone,
1N/A * And I must follow, if I can,
1N/A * Pursuing it with eager feet,
1N/A * Until it joins some larger way
1N/A * Where many paths and errands meet.
1N/A * And whither then? I cannot say.
1N/A */
1N/A
1N/A#include "EXTERN.h"
1N/A#define PERL_IN_PP_CTL_C
1N/A#include "perl.h"
1N/A
1N/A#ifndef WORD_ALIGN
1N/A#define WORD_ALIGN sizeof(U32)
1N/A#endif
1N/A
1N/A#define DOCATCH(o) ((CATCH_GET == TRUE) ? docatch(o) : (o))
1N/A
1N/Astatic I32 run_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen);
1N/A
1N/APP(pp_wantarray)
1N/A{
1N/A dSP;
1N/A I32 cxix;
1N/A EXTEND(SP, 1);
1N/A
1N/A cxix = dopoptosub(cxstack_ix);
1N/A if (cxix < 0)
1N/A RETPUSHUNDEF;
1N/A
1N/A switch (cxstack[cxix].blk_gimme) {
1N/A case G_ARRAY:
1N/A RETPUSHYES;
1N/A case G_SCALAR:
1N/A RETPUSHNO;
1N/A default:
1N/A RETPUSHUNDEF;
1N/A }
1N/A}
1N/A
1N/APP(pp_regcmaybe)
1N/A{
1N/A return NORMAL;
1N/A}
1N/A
1N/APP(pp_regcreset)
1N/A{
1N/A /* XXXX Should store the old value to allow for tie/overload - and
1N/A restore in regcomp, where marked with XXXX. */
1N/A PL_reginterp_cnt = 0;
1N/A TAINT_NOT;
1N/A return NORMAL;
1N/A}
1N/A
1N/APP(pp_regcomp)
1N/A{
1N/A dSP;
1N/A register PMOP *pm = (PMOP*)cLOGOP->op_other;
1N/A register char *t;
1N/A SV *tmpstr;
1N/A STRLEN len;
1N/A MAGIC *mg = Null(MAGIC*);
1N/A
1N/A tmpstr = POPs;
1N/A
1N/A /* prevent recompiling under /o and ithreads. */
1N/A#if defined(USE_ITHREADS) || defined(USE_5005THREADS)
1N/A if (pm->op_pmflags & PMf_KEEP && PM_GETRE(pm))
1N/A RETURN;
1N/A#endif
1N/A
1N/A if (SvROK(tmpstr)) {
1N/A SV *sv = SvRV(tmpstr);
1N/A if(SvMAGICAL(sv))
1N/A mg = mg_find(sv, PERL_MAGIC_qr);
1N/A }
1N/A if (mg) {
1N/A regexp *re = (regexp *)mg->mg_obj;
1N/A ReREFCNT_dec(PM_GETRE(pm));
1N/A PM_SETRE(pm, ReREFCNT_inc(re));
1N/A }
1N/A else {
1N/A t = SvPV(tmpstr, len);
1N/A
1N/A /* Check against the last compiled regexp. */
1N/A if (!PM_GETRE(pm) || !PM_GETRE(pm)->precomp ||
1N/A PM_GETRE(pm)->prelen != (I32)len ||
1N/A memNE(PM_GETRE(pm)->precomp, t, len))
1N/A {
1N/A if (PM_GETRE(pm)) {
1N/A ReREFCNT_dec(PM_GETRE(pm));
1N/A PM_SETRE(pm, Null(REGEXP*)); /* crucial if regcomp aborts */
1N/A }
1N/A if (PL_op->op_flags & OPf_SPECIAL)
1N/A PL_reginterp_cnt = I32_MAX; /* Mark as safe. */
1N/A
1N/A pm->op_pmflags = pm->op_pmpermflags; /* reset case sensitivity */
1N/A if (DO_UTF8(tmpstr))
1N/A pm->op_pmdynflags |= PMdf_DYN_UTF8;
1N/A else {
1N/A pm->op_pmdynflags &= ~PMdf_DYN_UTF8;
1N/A if (pm->op_pmdynflags & PMdf_UTF8)
1N/A t = (char*)bytes_to_utf8((U8*)t, &len);
1N/A }
1N/A PM_SETRE(pm, CALLREGCOMP(aTHX_ t, t + len, pm));
1N/A if (!DO_UTF8(tmpstr) && (pm->op_pmdynflags & PMdf_UTF8))
1N/A Safefree(t);
1N/A PL_reginterp_cnt = 0; /* XXXX Be extra paranoid - needed
1N/A inside tie/overload accessors. */
1N/A }
1N/A }
1N/A
1N/A#ifndef INCOMPLETE_TAINTS
1N/A if (PL_tainting) {
1N/A if (PL_tainted)
1N/A pm->op_pmdynflags |= PMdf_TAINTED;
1N/A else
1N/A pm->op_pmdynflags &= ~PMdf_TAINTED;
1N/A }
1N/A#endif
1N/A
1N/A if (!PM_GETRE(pm)->prelen && PL_curpm)
1N/A pm = PL_curpm;
1N/A else if (strEQ("\\s+", PM_GETRE(pm)->precomp))
1N/A pm->op_pmflags |= PMf_WHITE;
1N/A else
1N/A pm->op_pmflags &= ~PMf_WHITE;
1N/A
1N/A /* XXX runtime compiled output needs to move to the pad */
1N/A if (pm->op_pmflags & PMf_KEEP) {
1N/A pm->op_private &= ~OPpRUNTIME; /* no point compiling again */
1N/A#if !defined(USE_ITHREADS) && !defined(USE_5005THREADS)
1N/A /* XXX can't change the optree at runtime either */
1N/A cLOGOP->op_first->op_next = PL_op->op_next;
1N/A#endif
1N/A }
1N/A RETURN;
1N/A}
1N/A
1N/APP(pp_substcont)
1N/A{
1N/A dSP;
1N/A register PMOP *pm = (PMOP*) cLOGOP->op_other;
1N/A register PERL_CONTEXT *cx = &cxstack[cxstack_ix];
1N/A register SV *dstr = cx->sb_dstr;
1N/A register char *s = cx->sb_s;
1N/A register char *m = cx->sb_m;
1N/A char *orig = cx->sb_orig;
1N/A register REGEXP *rx = cx->sb_rx;
1N/A SV *nsv = Nullsv;
1N/A REGEXP *old = PM_GETRE(pm);
1N/A if(old != rx) {
1N/A if(old)
1N/A ReREFCNT_dec(old);
1N/A PM_SETRE(pm,rx);
1N/A }
1N/A
1N/A rxres_restore(&cx->sb_rxres, rx);
1N/A RX_MATCH_UTF8_set(rx, SvUTF8(cx->sb_targ));
1N/A
1N/A if (cx->sb_iters++) {
1N/A I32 saviters = cx->sb_iters;
1N/A if (cx->sb_iters > cx->sb_maxiters)
1N/A DIE(aTHX_ "Substitution loop");
1N/A
1N/A if (!(cx->sb_rxtainted & 2) && SvTAINTED(TOPs))
1N/A cx->sb_rxtainted |= 2;
1N/A sv_catsv(dstr, POPs);
1N/A
1N/A /* Are we done */
1N/A if (cx->sb_once || !CALLREGEXEC(aTHX_ rx, s, cx->sb_strend, orig,
1N/A s == m, cx->sb_targ, NULL,
1N/A ((cx->sb_rflags & REXEC_COPY_STR)
1N/A ? (REXEC_IGNOREPOS|REXEC_NOT_FIRST)
1N/A : (REXEC_COPY_STR|REXEC_IGNOREPOS|REXEC_NOT_FIRST))))
1N/A {
1N/A SV *targ = cx->sb_targ;
1N/A
1N/A assert(cx->sb_strend >= s);
1N/A if(cx->sb_strend > s) {
1N/A if (DO_UTF8(dstr) && !SvUTF8(targ))
1N/A sv_catpvn_utf8_upgrade(dstr, s, cx->sb_strend - s, nsv);
1N/A else
1N/A sv_catpvn(dstr, s, cx->sb_strend - s);
1N/A }
1N/A cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
1N/A
1N/A (void)SvOOK_off(targ);
1N/A if (SvLEN(targ))
1N/A Safefree(SvPVX(targ));
1N/A SvPVX(targ) = SvPVX(dstr);
1N/A SvCUR_set(targ, SvCUR(dstr));
1N/A SvLEN_set(targ, SvLEN(dstr));
1N/A if (DO_UTF8(dstr))
1N/A SvUTF8_on(targ);
1N/A SvPVX(dstr) = 0;
1N/A sv_free(dstr);
1N/A
1N/A TAINT_IF(cx->sb_rxtainted & 1);
1N/A PUSHs(sv_2mortal(newSViv(saviters - 1)));
1N/A
1N/A (void)SvPOK_only_UTF8(targ);
1N/A TAINT_IF(cx->sb_rxtainted);
1N/A SvSETMAGIC(targ);
1N/A SvTAINT(targ);
1N/A
1N/A LEAVE_SCOPE(cx->sb_oldsave);
1N/A ReREFCNT_dec(rx);
1N/A POPSUBST(cx);
1N/A RETURNOP(pm->op_next);
1N/A }
1N/A cx->sb_iters = saviters;
1N/A }
1N/A if (RX_MATCH_COPIED(rx) && rx->subbeg != orig) {
1N/A m = s;
1N/A s = orig;
1N/A cx->sb_orig = orig = rx->subbeg;
1N/A s = orig + (m - s);
1N/A cx->sb_strend = s + (cx->sb_strend - m);
1N/A }
1N/A cx->sb_m = m = rx->startp[0] + orig;
1N/A if (m > s) {
1N/A if (DO_UTF8(dstr) && !SvUTF8(cx->sb_targ))
1N/A sv_catpvn_utf8_upgrade(dstr, s, m - s, nsv);
1N/A else
1N/A sv_catpvn(dstr, s, m-s);
1N/A }
1N/A cx->sb_s = rx->endp[0] + orig;
1N/A { /* Update the pos() information. */
1N/A SV *sv = cx->sb_targ;
1N/A MAGIC *mg;
1N/A I32 i;
1N/A if (SvTYPE(sv) < SVt_PVMG)
1N/A (void)SvUPGRADE(sv, SVt_PVMG);
1N/A if (!(mg = mg_find(sv, PERL_MAGIC_regex_global))) {
1N/A sv_magic(sv, Nullsv, PERL_MAGIC_regex_global, Nullch, 0);
1N/A mg = mg_find(sv, PERL_MAGIC_regex_global);
1N/A }
1N/A i = m - orig;
1N/A if (DO_UTF8(sv))
1N/A sv_pos_b2u(sv, &i);
1N/A mg->mg_len = i;
1N/A }
1N/A if (old != rx)
1N/A ReREFCNT_inc(rx);
1N/A cx->sb_rxtainted |= RX_MATCH_TAINTED(rx);
1N/A rxres_save(&cx->sb_rxres, rx);
1N/A RETURNOP(pm->op_pmreplstart);
1N/A}
1N/A
1N/Avoid
1N/APerl_rxres_save(pTHX_ void **rsp, REGEXP *rx)
1N/A{
1N/A UV *p = (UV*)*rsp;
1N/A U32 i;
1N/A
1N/A if (!p || p[1] < rx->nparens) {
1N/A i = 6 + rx->nparens * 2;
1N/A if (!p)
1N/A New(501, p, i, UV);
1N/A else
1N/A Renew(p, i, UV);
1N/A *rsp = (void*)p;
1N/A }
1N/A
1N/A *p++ = PTR2UV(RX_MATCH_COPIED(rx) ? rx->subbeg : Nullch);
1N/A RX_MATCH_COPIED_off(rx);
1N/A
1N/A *p++ = rx->nparens;
1N/A
1N/A *p++ = PTR2UV(rx->subbeg);
1N/A *p++ = (UV)rx->sublen;
1N/A for (i = 0; i <= rx->nparens; ++i) {
1N/A *p++ = (UV)rx->startp[i];
1N/A *p++ = (UV)rx->endp[i];
1N/A }
1N/A}
1N/A
1N/Avoid
1N/APerl_rxres_restore(pTHX_ void **rsp, REGEXP *rx)
1N/A{
1N/A UV *p = (UV*)*rsp;
1N/A U32 i;
1N/A
1N/A if (RX_MATCH_COPIED(rx))
1N/A Safefree(rx->subbeg);
1N/A RX_MATCH_COPIED_set(rx, *p);
1N/A *p++ = 0;
1N/A
1N/A rx->nparens = *p++;
1N/A
1N/A rx->subbeg = INT2PTR(char*,*p++);
1N/A rx->sublen = (I32)(*p++);
1N/A for (i = 0; i <= rx->nparens; ++i) {
1N/A rx->startp[i] = (I32)(*p++);
1N/A rx->endp[i] = (I32)(*p++);
1N/A }
1N/A}
1N/A
1N/Avoid
1N/APerl_rxres_free(pTHX_ void **rsp)
1N/A{
1N/A UV *p = (UV*)*rsp;
1N/A
1N/A if (p) {
1N/A Safefree(INT2PTR(char*,*p));
1N/A Safefree(p);
1N/A *rsp = Null(void*);
1N/A }
1N/A}
1N/A
1N/APP(pp_formline)
1N/A{
1N/A dSP; dMARK; dORIGMARK;
1N/A register SV *tmpForm = *++MARK;
1N/A register U32 *fpc;
1N/A register char *t;
1N/A register char *f;
1N/A register char *s;
1N/A register char *send;
1N/A register I32 arg;
1N/A register SV *sv = Nullsv;
1N/A char *item = Nullch;
1N/A I32 itemsize = 0;
1N/A I32 fieldsize = 0;
1N/A I32 lines = 0;
1N/A bool chopspace = (strchr(PL_chopset, ' ') != Nullch);
1N/A char *chophere = Nullch;
1N/A char *linemark = Nullch;
1N/A NV value;
1N/A bool gotsome = FALSE;
1N/A STRLEN len;
1N/A STRLEN fudge = SvCUR(tmpForm) * (IN_BYTES ? 1 : 3) + 1;
1N/A bool item_is_utf8 = FALSE;
1N/A bool targ_is_utf8 = FALSE;
1N/A SV * nsv = Nullsv;
1N/A OP * parseres = 0;
1N/A char *fmt;
1N/A bool oneline;
1N/A
1N/A if (!SvMAGICAL(tmpForm) || !SvCOMPILED(tmpForm)) {
1N/A if (SvREADONLY(tmpForm)) {
1N/A SvREADONLY_off(tmpForm);
1N/A parseres = doparseform(tmpForm);
1N/A SvREADONLY_on(tmpForm);
1N/A }
1N/A else
1N/A parseres = doparseform(tmpForm);
1N/A if (parseres)
1N/A return parseres;
1N/A }
1N/A SvPV_force(PL_formtarget, len);
1N/A if (DO_UTF8(PL_formtarget))
1N/A targ_is_utf8 = TRUE;
1N/A t = SvGROW(PL_formtarget, len + fudge + 1); /* XXX SvCUR bad */
1N/A t += len;
1N/A f = SvPV(tmpForm, len);
1N/A /* need to jump to the next word */
1N/A s = f + len + WORD_ALIGN - SvCUR(tmpForm) % WORD_ALIGN;
1N/A
1N/A fpc = (U32*)s;
1N/A
1N/A for (;;) {
1N/A DEBUG_f( {
1N/A char *name = "???";
1N/A arg = -1;
1N/A switch (*fpc) {
1N/A case FF_LITERAL: arg = fpc[1]; name = "LITERAL"; break;
1N/A case FF_BLANK: arg = fpc[1]; name = "BLANK"; break;
1N/A case FF_SKIP: arg = fpc[1]; name = "SKIP"; break;
1N/A case FF_FETCH: arg = fpc[1]; name = "FETCH"; break;
1N/A case FF_DECIMAL: arg = fpc[1]; name = "DECIMAL"; break;
1N/A
1N/A case FF_CHECKNL: name = "CHECKNL"; break;
1N/A case FF_CHECKCHOP: name = "CHECKCHOP"; break;
1N/A case FF_SPACE: name = "SPACE"; break;
1N/A case FF_HALFSPACE: name = "HALFSPACE"; break;
1N/A case FF_ITEM: name = "ITEM"; break;
1N/A case FF_CHOP: name = "CHOP"; break;
1N/A case FF_LINEGLOB: name = "LINEGLOB"; break;
1N/A case FF_NEWLINE: name = "NEWLINE"; break;
1N/A case FF_MORE: name = "MORE"; break;
1N/A case FF_LINEMARK: name = "LINEMARK"; break;
1N/A case FF_END: name = "END"; break;
1N/A case FF_0DECIMAL: name = "0DECIMAL"; break;
1N/A case FF_LINESNGL: name = "LINESNGL"; break;
1N/A }
1N/A if (arg >= 0)
1N/A PerlIO_printf(Perl_debug_log, "%-16s%ld\n", name, (long) arg);
1N/A else
1N/A PerlIO_printf(Perl_debug_log, "%-16s\n", name);
1N/A } );
1N/A switch (*fpc++) {
1N/A case FF_LINEMARK:
1N/A linemark = t;
1N/A lines++;
1N/A gotsome = FALSE;
1N/A break;
1N/A
1N/A case FF_LITERAL:
1N/A arg = *fpc++;
1N/A if (targ_is_utf8 && !SvUTF8(tmpForm)) {
1N/A SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
1N/A *t = '\0';
1N/A sv_catpvn_utf8_upgrade(PL_formtarget, f, arg, nsv);
1N/A t = SvEND(PL_formtarget);
1N/A break;
1N/A }
1N/A if (!targ_is_utf8 && DO_UTF8(tmpForm)) {
1N/A SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
1N/A *t = '\0';
1N/A sv_utf8_upgrade(PL_formtarget);
1N/A SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
1N/A t = SvEND(PL_formtarget);
1N/A targ_is_utf8 = TRUE;
1N/A }
1N/A while (arg--)
1N/A *t++ = *f++;
1N/A break;
1N/A
1N/A case FF_SKIP:
1N/A f += *fpc++;
1N/A break;
1N/A
1N/A case FF_FETCH:
1N/A arg = *fpc++;
1N/A f += arg;
1N/A fieldsize = arg;
1N/A
1N/A if (MARK < SP)
1N/A sv = *++MARK;
1N/A else {
1N/A sv = &PL_sv_no;
1N/A if (ckWARN(WARN_SYNTAX))
1N/A Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Not enough format arguments");
1N/A }
1N/A break;
1N/A
1N/A case FF_CHECKNL:
1N/A item = s = SvPV(sv, len);
1N/A itemsize = len;
1N/A if (DO_UTF8(sv)) {
1N/A itemsize = sv_len_utf8(sv);
1N/A if (itemsize != (I32)len) {
1N/A I32 itembytes;
1N/A if (itemsize > fieldsize) {
1N/A itemsize = fieldsize;
1N/A itembytes = itemsize;
1N/A sv_pos_u2b(sv, &itembytes, 0);
1N/A }
1N/A else
1N/A itembytes = len;
1N/A send = chophere = s + itembytes;
1N/A while (s < send) {
1N/A if (*s & ~31)
1N/A gotsome = TRUE;
1N/A else if (*s == '\n')
1N/A break;
1N/A s++;
1N/A }
1N/A item_is_utf8 = TRUE;
1N/A itemsize = s - item;
1N/A sv_pos_b2u(sv, &itemsize);
1N/A break;
1N/A }
1N/A }
1N/A item_is_utf8 = FALSE;
1N/A if (itemsize > fieldsize)
1N/A itemsize = fieldsize;
1N/A send = chophere = s + itemsize;
1N/A while (s < send) {
1N/A if (*s & ~31)
1N/A gotsome = TRUE;
1N/A else if (*s == '\n')
1N/A break;
1N/A s++;
1N/A }
1N/A itemsize = s - item;
1N/A break;
1N/A
1N/A case FF_CHECKCHOP:
1N/A item = s = SvPV(sv, len);
1N/A itemsize = len;
1N/A if (DO_UTF8(sv)) {
1N/A itemsize = sv_len_utf8(sv);
1N/A if (itemsize != (I32)len) {
1N/A I32 itembytes;
1N/A if (itemsize <= fieldsize) {
1N/A send = chophere = s + itemsize;
1N/A while (s < send) {
1N/A if (*s == '\r') {
1N/A itemsize = s - item;
1N/A chophere = s;
1N/A break;
1N/A }
1N/A if (*s++ & ~31)
1N/A gotsome = TRUE;
1N/A }
1N/A }
1N/A else {
1N/A itemsize = fieldsize;
1N/A itembytes = itemsize;
1N/A sv_pos_u2b(sv, &itembytes, 0);
1N/A send = chophere = s + itembytes;
1N/A while (s < send || (s == send && isSPACE(*s))) {
1N/A if (isSPACE(*s)) {
1N/A if (chopspace)
1N/A chophere = s;
1N/A if (*s == '\r')
1N/A break;
1N/A }
1N/A else {
1N/A if (*s & ~31)
1N/A gotsome = TRUE;
1N/A if (strchr(PL_chopset, *s))
1N/A chophere = s + 1;
1N/A }
1N/A s++;
1N/A }
1N/A itemsize = chophere - item;
1N/A sv_pos_b2u(sv, &itemsize);
1N/A }
1N/A item_is_utf8 = TRUE;
1N/A break;
1N/A }
1N/A }
1N/A item_is_utf8 = FALSE;
1N/A if (itemsize <= fieldsize) {
1N/A send = chophere = s + itemsize;
1N/A while (s < send) {
1N/A if (*s == '\r') {
1N/A itemsize = s - item;
1N/A chophere = s;
1N/A break;
1N/A }
1N/A if (*s++ & ~31)
1N/A gotsome = TRUE;
1N/A }
1N/A }
1N/A else {
1N/A itemsize = fieldsize;
1N/A send = chophere = s + itemsize;
1N/A while (s < send || (s == send && isSPACE(*s))) {
1N/A if (isSPACE(*s)) {
1N/A if (chopspace)
1N/A chophere = s;
1N/A if (*s == '\r')
1N/A break;
1N/A }
1N/A else {
1N/A if (*s & ~31)
1N/A gotsome = TRUE;
1N/A if (strchr(PL_chopset, *s))
1N/A chophere = s + 1;
1N/A }
1N/A s++;
1N/A }
1N/A itemsize = chophere - item;
1N/A }
1N/A break;
1N/A
1N/A case FF_SPACE:
1N/A arg = fieldsize - itemsize;
1N/A if (arg) {
1N/A fieldsize -= arg;
1N/A while (arg-- > 0)
1N/A *t++ = ' ';
1N/A }
1N/A break;
1N/A
1N/A case FF_HALFSPACE:
1N/A arg = fieldsize - itemsize;
1N/A if (arg) {
1N/A arg /= 2;
1N/A fieldsize -= arg;
1N/A while (arg-- > 0)
1N/A *t++ = ' ';
1N/A }
1N/A break;
1N/A
1N/A case FF_ITEM:
1N/A arg = itemsize;
1N/A s = item;
1N/A if (item_is_utf8) {
1N/A if (!targ_is_utf8) {
1N/A SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
1N/A *t = '\0';
1N/A sv_utf8_upgrade(PL_formtarget);
1N/A SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
1N/A t = SvEND(PL_formtarget);
1N/A targ_is_utf8 = TRUE;
1N/A }
1N/A while (arg--) {
1N/A if (UTF8_IS_CONTINUED(*s)) {
1N/A STRLEN skip = UTF8SKIP(s);
1N/A switch (skip) {
1N/A default:
1N/A Move(s,t,skip,char);
1N/A s += skip;
1N/A t += skip;
1N/A break;
1N/A case 7: *t++ = *s++;
1N/A case 6: *t++ = *s++;
1N/A case 5: *t++ = *s++;
1N/A case 4: *t++ = *s++;
1N/A case 3: *t++ = *s++;
1N/A case 2: *t++ = *s++;
1N/A case 1: *t++ = *s++;
1N/A }
1N/A }
1N/A else {
1N/A if ( !((*t++ = *s++) & ~31) )
1N/A t[-1] = ' ';
1N/A }
1N/A }
1N/A break;
1N/A }
1N/A if (targ_is_utf8 && !item_is_utf8) {
1N/A SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
1N/A *t = '\0';
1N/A sv_catpvn_utf8_upgrade(PL_formtarget, s, arg, nsv);
1N/A for (; t < SvEND(PL_formtarget); t++) {
1N/A#ifdef EBCDIC
1N/A int ch = *t;
1N/A if (iscntrl(ch))
1N/A#else
1N/A if (!(*t & ~31))
1N/A#endif
1N/A *t = ' ';
1N/A }
1N/A break;
1N/A }
1N/A while (arg--) {
1N/A#ifdef EBCDIC
1N/A int ch = *t++ = *s++;
1N/A if (iscntrl(ch))
1N/A#else
1N/A if ( !((*t++ = *s++) & ~31) )
1N/A#endif
1N/A t[-1] = ' ';
1N/A }
1N/A break;
1N/A
1N/A case FF_CHOP:
1N/A s = chophere;
1N/A if (chopspace) {
1N/A while (*s && isSPACE(*s))
1N/A s++;
1N/A }
1N/A sv_chop(sv,s);
1N/A SvSETMAGIC(sv);
1N/A break;
1N/A
1N/A case FF_LINESNGL:
1N/A chopspace = 0;
1N/A oneline = TRUE;
1N/A goto ff_line;
1N/A case FF_LINEGLOB:
1N/A oneline = FALSE;
1N/A ff_line:
1N/A item = s = SvPV(sv, len);
1N/A itemsize = len;
1N/A if ((item_is_utf8 = DO_UTF8(sv)))
1N/A itemsize = sv_len_utf8(sv);
1N/A if (itemsize) {
1N/A bool chopped = FALSE;
1N/A gotsome = TRUE;
1N/A send = s + len;
1N/A chophere = s + itemsize;
1N/A while (s < send) {
1N/A if (*s++ == '\n') {
1N/A if (oneline) {
1N/A chopped = TRUE;
1N/A chophere = s;
1N/A break;
1N/A } else {
1N/A if (s == send) {
1N/A itemsize--;
1N/A chopped = TRUE;
1N/A } else
1N/A lines++;
1N/A }
1N/A }
1N/A }
1N/A SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
1N/A if (targ_is_utf8)
1N/A SvUTF8_on(PL_formtarget);
1N/A if (oneline) {
1N/A SvCUR_set(sv, chophere - item);
1N/A sv_catsv(PL_formtarget, sv);
1N/A SvCUR_set(sv, itemsize);
1N/A } else
1N/A sv_catsv(PL_formtarget, sv);
1N/A if (chopped)
1N/A SvCUR_set(PL_formtarget, SvCUR(PL_formtarget) - 1);
1N/A SvGROW(PL_formtarget, SvCUR(PL_formtarget) + fudge + 1);
1N/A t = SvPVX(PL_formtarget) + SvCUR(PL_formtarget);
1N/A if (item_is_utf8)
1N/A targ_is_utf8 = TRUE;
1N/A }
1N/A break;
1N/A
1N/A case FF_0DECIMAL:
1N/A arg = *fpc++;
1N/A#if defined(USE_LONG_DOUBLE)
1N/A fmt = (arg & 256) ? "%#0*.*" PERL_PRIfldbl : "%0*.*" PERL_PRIfldbl;
1N/A#else
1N/A fmt = (arg & 256) ? "%#0*.*f" : "%0*.*f";
1N/A#endif
1N/A goto ff_dec;
1N/A case FF_DECIMAL:
1N/A arg = *fpc++;
1N/A#if defined(USE_LONG_DOUBLE)
1N/A fmt = (arg & 256) ? "%#*.*" PERL_PRIfldbl : "%*.*" PERL_PRIfldbl;
1N/A#else
1N/A fmt = (arg & 256) ? "%#*.*f" : "%*.*f";
1N/A#endif
1N/A ff_dec:
1N/A /* If the field is marked with ^ and the value is undefined,
1N/A blank it out. */
1N/A if ((arg & 512) && !SvOK(sv)) {
1N/A arg = fieldsize;
1N/A while (arg--)
1N/A *t++ = ' ';
1N/A break;
1N/A }
1N/A gotsome = TRUE;
1N/A value = SvNV(sv);
1N/A /* overflow evidence */
1N/A if (num_overflow(value, fieldsize, arg)) {
1N/A arg = fieldsize;
1N/A while (arg--)
1N/A *t++ = '#';
1N/A break;
1N/A }
1N/A /* Formats aren't yet marked for locales, so assume "yes". */
1N/A {
1N/A STORE_NUMERIC_STANDARD_SET_LOCAL();
1N/A sprintf(t, fmt, (int) fieldsize, (int) arg & 255, value);
1N/A RESTORE_NUMERIC_STANDARD();
1N/A }
1N/A t += fieldsize;
1N/A break;
1N/A
1N/A case FF_NEWLINE:
1N/A f++;
1N/A while (t-- > linemark && *t == ' ') ;
1N/A t++;
1N/A *t++ = '\n';
1N/A break;
1N/A
1N/A case FF_BLANK:
1N/A arg = *fpc++;
1N/A if (gotsome) {
1N/A if (arg) { /* repeat until fields exhausted? */
1N/A *t = '\0';
1N/A SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
1N/A lines += FmLINES(PL_formtarget);
1N/A if (lines == 200) {
1N/A arg = t - linemark;
1N/A if (strnEQ(linemark, linemark - arg, arg))
1N/A DIE(aTHX_ "Runaway format");
1N/A }
1N/A if (targ_is_utf8)
1N/A SvUTF8_on(PL_formtarget);
1N/A FmLINES(PL_formtarget) = lines;
1N/A SP = ORIGMARK;
1N/A RETURNOP(cLISTOP->op_first);
1N/A }
1N/A }
1N/A else {
1N/A t = linemark;
1N/A lines--;
1N/A }
1N/A break;
1N/A
1N/A case FF_MORE:
1N/A s = chophere;
1N/A send = item + len;
1N/A if (chopspace) {
1N/A while (*s && isSPACE(*s) && s < send)
1N/A s++;
1N/A }
1N/A if (s < send) {
1N/A arg = fieldsize - itemsize;
1N/A if (arg) {
1N/A fieldsize -= arg;
1N/A while (arg-- > 0)
1N/A *t++ = ' ';
1N/A }
1N/A s = t - 3;
1N/A if (strnEQ(s," ",3)) {
1N/A while (s > SvPVX(PL_formtarget) && isSPACE(s[-1]))
1N/A s--;
1N/A }
1N/A *s++ = '.';
1N/A *s++ = '.';
1N/A *s++ = '.';
1N/A }
1N/A break;
1N/A
1N/A case FF_END:
1N/A *t = '\0';
1N/A SvCUR_set(PL_formtarget, t - SvPVX(PL_formtarget));
1N/A if (targ_is_utf8)
1N/A SvUTF8_on(PL_formtarget);
1N/A FmLINES(PL_formtarget) += lines;
1N/A SP = ORIGMARK;
1N/A RETPUSHYES;
1N/A }
1N/A }
1N/A}
1N/A
1N/APP(pp_grepstart)
1N/A{
1N/A dSP;
1N/A SV *src;
1N/A
1N/A if (PL_stack_base + *PL_markstack_ptr == SP) {
1N/A (void)POPMARK;
1N/A if (GIMME_V == G_SCALAR)
1N/A XPUSHs(sv_2mortal(newSViv(0)));
1N/A RETURNOP(PL_op->op_next->op_next);
1N/A }
1N/A PL_stack_sp = PL_stack_base + *PL_markstack_ptr + 1;
1N/A pp_pushmark(); /* push dst */
1N/A pp_pushmark(); /* push src */
1N/A ENTER; /* enter outer scope */
1N/A
1N/A SAVETMPS;
1N/A /* SAVE_DEFSV does *not* suffice here for USE_5005THREADS */
1N/A SAVESPTR(DEFSV);
1N/A ENTER; /* enter inner scope */
1N/A SAVEVPTR(PL_curpm);
1N/A
1N/A src = PL_stack_base[*PL_markstack_ptr];
1N/A SvTEMP_off(src);
1N/A DEFSV = src;
1N/A
1N/A PUTBACK;
1N/A if (PL_op->op_type == OP_MAPSTART)
1N/A pp_pushmark(); /* push top */
1N/A return ((LOGOP*)PL_op->op_next)->op_other;
1N/A}
1N/A
1N/APP(pp_mapstart)
1N/A{
1N/A DIE(aTHX_ "panic: mapstart"); /* uses grepstart */
1N/A}
1N/A
1N/APP(pp_mapwhile)
1N/A{
1N/A dSP;
1N/A I32 gimme = GIMME_V;
1N/A I32 items = (SP - PL_stack_base) - *PL_markstack_ptr; /* how many new items */
1N/A I32 count;
1N/A I32 shift;
1N/A SV** src;
1N/A SV** dst;
1N/A
1N/A /* first, move source pointer to the next item in the source list */
1N/A ++PL_markstack_ptr[-1];
1N/A
1N/A /* if there are new items, push them into the destination list */
1N/A if (items && gimme != G_VOID) {
1N/A /* might need to make room back there first */
1N/A if (items > PL_markstack_ptr[-1] - PL_markstack_ptr[-2]) {
1N/A /* XXX this implementation is very pessimal because the stack
1N/A * is repeatedly extended for every set of items. Is possible
1N/A * to do this without any stack extension or copying at all
1N/A * by maintaining a separate list over which the map iterates
1N/A * (like foreach does). --gsar */
1N/A
1N/A /* everything in the stack after the destination list moves
1N/A * towards the end the stack by the amount of room needed */
1N/A shift = items - (PL_markstack_ptr[-1] - PL_markstack_ptr[-2]);
1N/A
1N/A /* items to shift up (accounting for the moved source pointer) */
1N/A count = (SP - PL_stack_base) - (PL_markstack_ptr[-1] - 1);
1N/A
1N/A /* This optimization is by Ben Tilly and it does
1N/A * things differently from what Sarathy (gsar)
1N/A * is describing. The downside of this optimization is
1N/A * that leaves "holes" (uninitialized and hopefully unused areas)
1N/A * to the Perl stack, but on the other hand this
1N/A * shouldn't be a problem. If Sarathy's idea gets
1N/A * implemented, this optimization should become
1N/A * irrelevant. --jhi */
1N/A if (shift < count)
1N/A shift = count; /* Avoid shifting too often --Ben Tilly */
1N/A
1N/A EXTEND(SP,shift);
1N/A src = SP;
1N/A dst = (SP += shift);
1N/A PL_markstack_ptr[-1] += shift;
1N/A *PL_markstack_ptr += shift;
1N/A while (count--)
1N/A *dst-- = *src--;
1N/A }
1N/A /* copy the new items down to the destination list */
1N/A dst = PL_stack_base + (PL_markstack_ptr[-2] += items) - 1;
1N/A if (gimme == G_ARRAY) {
1N/A while (items-- > 0)
1N/A *dst-- = SvTEMP(TOPs) ? POPs : sv_mortalcopy(POPs);
1N/A }
1N/A else {
1N/A /* scalar context: we don't care about which values map returns
1N/A * (we use undef here). And so we certainly don't want to do mortal
1N/A * copies of meaningless values. */
1N/A while (items-- > 0) {
1N/A (void)POPs;
1N/A *dst-- = &PL_sv_undef;
1N/A }
1N/A }
1N/A }
1N/A LEAVE; /* exit inner scope */
1N/A
1N/A /* All done yet? */
1N/A if (PL_markstack_ptr[-1] > *PL_markstack_ptr) {
1N/A
1N/A (void)POPMARK; /* pop top */
1N/A LEAVE; /* exit outer scope */
1N/A (void)POPMARK; /* pop src */
1N/A items = --*PL_markstack_ptr - PL_markstack_ptr[-1];
1N/A (void)POPMARK; /* pop dst */
1N/A SP = PL_stack_base + POPMARK; /* pop original mark */
1N/A if (gimme == G_SCALAR) {
1N/A dTARGET;
1N/A XPUSHi(items);
1N/A }
1N/A else if (gimme == G_ARRAY)
1N/A SP += items;
1N/A RETURN;
1N/A }
1N/A else {
1N/A SV *src;
1N/A
1N/A ENTER; /* enter inner scope */
1N/A SAVEVPTR(PL_curpm);
1N/A
1N/A /* set $_ to the new source item */
1N/A src = PL_stack_base[PL_markstack_ptr[-1]];
1N/A SvTEMP_off(src);
1N/A DEFSV = src;
1N/A
1N/A RETURNOP(cLOGOP->op_other);
1N/A }
1N/A}
1N/A
1N/A/* Range stuff. */
1N/A
1N/APP(pp_range)
1N/A{
1N/A if (GIMME == G_ARRAY)
1N/A return NORMAL;
1N/A if (SvTRUEx(PAD_SV(PL_op->op_targ)))
1N/A return cLOGOP->op_other;
1N/A else
1N/A return NORMAL;
1N/A}
1N/A
1N/APP(pp_flip)
1N/A{
1N/A dSP;
1N/A
1N/A if (GIMME == G_ARRAY) {
1N/A RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1N/A }
1N/A else {
1N/A dTOPss;
1N/A SV *targ = PAD_SV(PL_op->op_targ);
1N/A int flip = 0;
1N/A
1N/A if (PL_op->op_private & OPpFLIP_LINENUM) {
1N/A if (GvIO(PL_last_in_gv)) {
1N/A flip = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1N/A }
1N/A else {
1N/A GV *gv = gv_fetchpv(".", TRUE, SVt_PV);
1N/A if (gv && GvSV(gv)) flip = SvIV(sv) == SvIV(GvSV(gv));
1N/A }
1N/A } else {
1N/A flip = SvTRUE(sv);
1N/A }
1N/A if (flip) {
1N/A sv_setiv(PAD_SV(cUNOP->op_first->op_targ), 1);
1N/A if (PL_op->op_flags & OPf_SPECIAL) {
1N/A sv_setiv(targ, 1);
1N/A SETs(targ);
1N/A RETURN;
1N/A }
1N/A else {
1N/A sv_setiv(targ, 0);
1N/A SP--;
1N/A RETURNOP(((LOGOP*)cUNOP->op_first)->op_other);
1N/A }
1N/A }
1N/A sv_setpv(TARG, "");
1N/A SETs(targ);
1N/A RETURN;
1N/A }
1N/A}
1N/A
1N/A/* This code tries to decide if "$left .. $right" should use the
1N/A magical string increment, or if the range is numeric (we make
1N/A an exception for .."0" [#18165]). AMS 20021031. */
1N/A
1N/A#define RANGE_IS_NUMERIC(left,right) ( \
1N/A SvNIOKp(left) || (SvOK(left) && !SvPOKp(left)) || \
1N/A SvNIOKp(right) || (SvOK(right) && !SvPOKp(right)) || \
1N/A (((!SvOK(left) && SvOK(right)) || (looks_like_number(left) && \
1N/A SvPOKp(left) && *SvPVX(left) != '0')) && looks_like_number(right)))
1N/A
1N/APP(pp_flop)
1N/A{
1N/A dSP;
1N/A
1N/A if (GIMME == G_ARRAY) {
1N/A dPOPPOPssrl;
1N/A register IV i, j;
1N/A register SV *sv;
1N/A IV max;
1N/A
1N/A if (SvGMAGICAL(left))
1N/A mg_get(left);
1N/A if (SvGMAGICAL(right))
1N/A mg_get(right);
1N/A
1N/A if (RANGE_IS_NUMERIC(left,right)) {
1N/A if ((SvOK(left) && SvNV(left) < IV_MIN) ||
1N/A (SvOK(right) && SvNV(right) > IV_MAX))
1N/A DIE(aTHX_ "Range iterator outside integer range");
1N/A i = SvIV(left);
1N/A max = SvIV(right);
1N/A if (max >= i) {
1N/A j = max - i + 1;
1N/A EXTEND_MORTAL(j);
1N/A EXTEND(SP, j);
1N/A }
1N/A else
1N/A j = 0;
1N/A while (j--) {
1N/A sv = sv_2mortal(newSViv(i++));
1N/A PUSHs(sv);
1N/A }
1N/A }
1N/A else {
1N/A SV *final = sv_mortalcopy(right);
1N/A STRLEN len, n_a;
1N/A char *tmps = SvPV(final, len);
1N/A
1N/A sv = sv_mortalcopy(left);
1N/A SvPV_force(sv,n_a);
1N/A while (!SvNIOKp(sv) && SvCUR(sv) <= len) {
1N/A XPUSHs(sv);
1N/A if (strEQ(SvPVX(sv),tmps))
1N/A break;
1N/A sv = sv_2mortal(newSVsv(sv));
1N/A sv_inc(sv);
1N/A }
1N/A }
1N/A }
1N/A else {
1N/A dTOPss;
1N/A SV *targ = PAD_SV(cUNOP->op_first->op_targ);
1N/A int flop = 0;
1N/A sv_inc(targ);
1N/A
1N/A if (PL_op->op_private & OPpFLIP_LINENUM) {
1N/A if (GvIO(PL_last_in_gv)) {
1N/A flop = SvIV(sv) == (IV)IoLINES(GvIOp(PL_last_in_gv));
1N/A }
1N/A else {
1N/A GV *gv = gv_fetchpv(".", TRUE, SVt_PV);
1N/A if (gv && GvSV(gv)) flop = SvIV(sv) == SvIV(GvSV(gv));
1N/A }
1N/A }
1N/A else {
1N/A flop = SvTRUE(sv);
1N/A }
1N/A
1N/A if (flop) {
1N/A sv_setiv(PAD_SV(((UNOP*)cUNOP->op_first)->op_first->op_targ), 0);
1N/A sv_catpv(targ, "E0");
1N/A }
1N/A SETs(targ);
1N/A }
1N/A
1N/A RETURN;
1N/A}
1N/A
1N/A/* Control. */
1N/A
1N/Astatic char *context_name[] = {
1N/A "pseudo-block",
1N/A "subroutine",
1N/A "eval",
1N/A "loop",
1N/A "substitution",
1N/A "block",
1N/A "format"
1N/A};
1N/A
1N/ASTATIC I32
1N/AS_dopoptolabel(pTHX_ char *label)
1N/A{
1N/A register I32 i;
1N/A register PERL_CONTEXT *cx;
1N/A
1N/A for (i = cxstack_ix; i >= 0; i--) {
1N/A cx = &cxstack[i];
1N/A switch (CxTYPE(cx)) {
1N/A case CXt_SUBST:
1N/A case CXt_SUB:
1N/A case CXt_FORMAT:
1N/A case CXt_EVAL:
1N/A case CXt_NULL:
1N/A if (ckWARN(WARN_EXITING))
1N/A Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1N/A context_name[CxTYPE(cx)], OP_NAME(PL_op));
1N/A if (CxTYPE(cx) == CXt_NULL)
1N/A return -1;
1N/A break;
1N/A case CXt_LOOP:
1N/A if (!cx->blk_loop.label ||
1N/A strNE(label, cx->blk_loop.label) ) {
1N/A DEBUG_l(Perl_deb(aTHX_ "(Skipping label #%ld %s)\n",
1N/A (long)i, cx->blk_loop.label));
1N/A continue;
1N/A }
1N/A DEBUG_l( Perl_deb(aTHX_ "(Found label #%ld %s)\n", (long)i, label));
1N/A return i;
1N/A }
1N/A }
1N/A return i;
1N/A}
1N/A
1N/AI32
1N/APerl_dowantarray(pTHX)
1N/A{
1N/A I32 gimme = block_gimme();
1N/A return (gimme == G_VOID) ? G_SCALAR : gimme;
1N/A}
1N/A
1N/AI32
1N/APerl_block_gimme(pTHX)
1N/A{
1N/A I32 cxix;
1N/A
1N/A cxix = dopoptosub(cxstack_ix);
1N/A if (cxix < 0)
1N/A return G_VOID;
1N/A
1N/A switch (cxstack[cxix].blk_gimme) {
1N/A case G_VOID:
1N/A return G_VOID;
1N/A case G_SCALAR:
1N/A return G_SCALAR;
1N/A case G_ARRAY:
1N/A return G_ARRAY;
1N/A default:
1N/A Perl_croak(aTHX_ "panic: bad gimme: %d\n", cxstack[cxix].blk_gimme);
1N/A /* NOTREACHED */
1N/A return 0;
1N/A }
1N/A}
1N/A
1N/AI32
1N/APerl_is_lvalue_sub(pTHX)
1N/A{
1N/A I32 cxix;
1N/A
1N/A cxix = dopoptosub(cxstack_ix);
1N/A assert(cxix >= 0); /* We should only be called from inside subs */
1N/A
1N/A if (cxstack[cxix].blk_sub.lval && CvLVALUE(cxstack[cxix].blk_sub.cv))
1N/A return cxstack[cxix].blk_sub.lval;
1N/A else
1N/A return 0;
1N/A}
1N/A
1N/ASTATIC I32
1N/AS_dopoptosub(pTHX_ I32 startingblock)
1N/A{
1N/A return dopoptosub_at(cxstack, startingblock);
1N/A}
1N/A
1N/ASTATIC I32
1N/AS_dopoptosub_at(pTHX_ PERL_CONTEXT *cxstk, I32 startingblock)
1N/A{
1N/A I32 i;
1N/A register PERL_CONTEXT *cx;
1N/A for (i = startingblock; i >= 0; i--) {
1N/A cx = &cxstk[i];
1N/A switch (CxTYPE(cx)) {
1N/A default:
1N/A continue;
1N/A case CXt_EVAL:
1N/A case CXt_SUB:
1N/A case CXt_FORMAT:
1N/A DEBUG_l( Perl_deb(aTHX_ "(Found sub #%ld)\n", (long)i));
1N/A return i;
1N/A }
1N/A }
1N/A return i;
1N/A}
1N/A
1N/ASTATIC I32
1N/AS_dopoptoeval(pTHX_ I32 startingblock)
1N/A{
1N/A I32 i;
1N/A register PERL_CONTEXT *cx;
1N/A for (i = startingblock; i >= 0; i--) {
1N/A cx = &cxstack[i];
1N/A switch (CxTYPE(cx)) {
1N/A default:
1N/A continue;
1N/A case CXt_EVAL:
1N/A DEBUG_l( Perl_deb(aTHX_ "(Found eval #%ld)\n", (long)i));
1N/A return i;
1N/A }
1N/A }
1N/A return i;
1N/A}
1N/A
1N/ASTATIC I32
1N/AS_dopoptoloop(pTHX_ I32 startingblock)
1N/A{
1N/A I32 i;
1N/A register PERL_CONTEXT *cx;
1N/A for (i = startingblock; i >= 0; i--) {
1N/A cx = &cxstack[i];
1N/A switch (CxTYPE(cx)) {
1N/A case CXt_SUBST:
1N/A case CXt_SUB:
1N/A case CXt_FORMAT:
1N/A case CXt_EVAL:
1N/A case CXt_NULL:
1N/A if (ckWARN(WARN_EXITING))
1N/A Perl_warner(aTHX_ packWARN(WARN_EXITING), "Exiting %s via %s",
1N/A context_name[CxTYPE(cx)], OP_NAME(PL_op));
1N/A if ((CxTYPE(cx)) == CXt_NULL)
1N/A return -1;
1N/A break;
1N/A case CXt_LOOP:
1N/A DEBUG_l( Perl_deb(aTHX_ "(Found loop #%ld)\n", (long)i));
1N/A return i;
1N/A }
1N/A }
1N/A return i;
1N/A}
1N/A
1N/Avoid
1N/APerl_dounwind(pTHX_ I32 cxix)
1N/A{
1N/A register PERL_CONTEXT *cx;
1N/A I32 optype;
1N/A
1N/A while (cxstack_ix > cxix) {
1N/A SV *sv;
1N/A cx = &cxstack[cxstack_ix];
1N/A DEBUG_l(PerlIO_printf(Perl_debug_log, "Unwinding block %ld, type %s\n",
1N/A (long) cxstack_ix, PL_block_type[CxTYPE(cx)]));
1N/A /* Note: we don't need to restore the base context info till the end. */
1N/A switch (CxTYPE(cx)) {
1N/A case CXt_SUBST:
1N/A POPSUBST(cx);
1N/A continue; /* not break */
1N/A case CXt_SUB:
1N/A POPSUB(cx,sv);
1N/A LEAVESUB(sv);
1N/A break;
1N/A case CXt_EVAL:
1N/A POPEVAL(cx);
1N/A break;
1N/A case CXt_LOOP:
1N/A POPLOOP(cx);
1N/A break;
1N/A case CXt_NULL:
1N/A break;
1N/A case CXt_FORMAT:
1N/A POPFORMAT(cx);
1N/A break;
1N/A }
1N/A cxstack_ix--;
1N/A }
1N/A}
1N/A
1N/Avoid
1N/APerl_qerror(pTHX_ SV *err)
1N/A{
1N/A if (PL_in_eval)
1N/A sv_catsv(ERRSV, err);
1N/A else if (PL_errors)
1N/A sv_catsv(PL_errors, err);
1N/A else
1N/A Perl_warn(aTHX_ "%"SVf, err);
1N/A ++PL_error_count;
1N/A}
1N/A
1N/AOP *
1N/APerl_die_where(pTHX_ char *message, STRLEN msglen)
1N/A{
1N/A STRLEN n_a;
1N/A
1N/A if (PL_in_eval) {
1N/A I32 cxix;
1N/A register PERL_CONTEXT *cx;
1N/A I32 gimme;
1N/A SV **newsp;
1N/A
1N/A if (message) {
1N/A if (PL_in_eval & EVAL_KEEPERR) {
1N/A static char prefix[] = "\t(in cleanup) ";
1N/A SV *err = ERRSV;
1N/A char *e = Nullch;
1N/A if (!SvPOK(err))
1N/A sv_setpv(err,"");
1N/A else if (SvCUR(err) >= sizeof(prefix)+msglen-1) {
1N/A e = SvPV(err, n_a);
1N/A e += n_a - msglen;
1N/A if (*e != *message || strNE(e,message))
1N/A e = Nullch;
1N/A }
1N/A if (!e) {
1N/A SvGROW(err, SvCUR(err)+sizeof(prefix)+msglen);
1N/A sv_catpvn(err, prefix, sizeof(prefix)-1);
1N/A sv_catpvn(err, message, msglen);
1N/A if (ckWARN(WARN_MISC)) {
1N/A STRLEN start = SvCUR(err)-msglen-sizeof(prefix)+1;
1N/A Perl_warner(aTHX_ packWARN(WARN_MISC), SvPVX(err)+start);
1N/A }
1N/A }
1N/A }
1N/A else {
1N/A sv_setpvn(ERRSV, message, msglen);
1N/A }
1N/A }
1N/A
1N/A while ((cxix = dopoptoeval(cxstack_ix)) < 0
1N/A && PL_curstackinfo->si_prev)
1N/A {
1N/A dounwind(-1);
1N/A POPSTACK;
1N/A }
1N/A
1N/A if (cxix >= 0) {
1N/A I32 optype;
1N/A
1N/A if (cxix < cxstack_ix)
1N/A dounwind(cxix);
1N/A
1N/A POPBLOCK(cx,PL_curpm);
1N/A if (CxTYPE(cx) != CXt_EVAL) {
1N/A if (!message)
1N/A message = SvPVx(ERRSV, msglen);
1N/A PerlIO_write(Perl_error_log, "panic: die ", 11);
1N/A PerlIO_write(Perl_error_log, message, msglen);
1N/A my_exit(1);
1N/A }
1N/A POPEVAL(cx);
1N/A
1N/A if (gimme == G_SCALAR)
1N/A *++newsp = &PL_sv_undef;
1N/A PL_stack_sp = newsp;
1N/A
1N/A LEAVE;
1N/A
1N/A /* LEAVE could clobber PL_curcop (see save_re_context())
1N/A * XXX it might be better to find a way to avoid messing with
1N/A * PL_curcop in save_re_context() instead, but this is a more
1N/A * minimal fix --GSAR */
1N/A PL_curcop = cx->blk_oldcop;
1N/A
1N/A if (optype == OP_REQUIRE) {
1N/A char* msg = SvPVx(ERRSV, n_a);
1N/A DIE(aTHX_ "%sCompilation failed in require",
1N/A *msg ? msg : "Unknown error\n");
1N/A }
1N/A return pop_return();
1N/A }
1N/A }
1N/A if (!message)
1N/A message = SvPVx(ERRSV, msglen);
1N/A
1N/A write_to_stderr(message, msglen);
1N/A my_failure_exit();
1N/A /* NOTREACHED */
1N/A return 0;
1N/A}
1N/A
1N/APP(pp_xor)
1N/A{
1N/A dSP; dPOPTOPssrl;
1N/A if (SvTRUE(left) != SvTRUE(right))
1N/A RETSETYES;
1N/A else
1N/A RETSETNO;
1N/A}
1N/A
1N/APP(pp_andassign)
1N/A{
1N/A dSP;
1N/A if (!SvTRUE(TOPs))
1N/A RETURN;
1N/A else
1N/A RETURNOP(cLOGOP->op_other);
1N/A}
1N/A
1N/APP(pp_orassign)
1N/A{
1N/A dSP;
1N/A if (SvTRUE(TOPs))
1N/A RETURN;
1N/A else
1N/A RETURNOP(cLOGOP->op_other);
1N/A}
1N/A
1N/APP(pp_caller)
1N/A{
1N/A dSP;
1N/A register I32 cxix = dopoptosub(cxstack_ix);
1N/A register PERL_CONTEXT *cx;
1N/A register PERL_CONTEXT *ccstack = cxstack;
1N/A PERL_SI *top_si = PL_curstackinfo;
1N/A I32 dbcxix;
1N/A I32 gimme;
1N/A char *stashname;
1N/A SV *sv;
1N/A I32 count = 0;
1N/A
1N/A if (MAXARG)
1N/A count = POPi;
1N/A
1N/A for (;;) {
1N/A /* we may be in a higher stacklevel, so dig down deeper */
1N/A while (cxix < 0 && top_si->si_type != PERLSI_MAIN) {
1N/A top_si = top_si->si_prev;
1N/A ccstack = top_si->si_cxstack;
1N/A cxix = dopoptosub_at(ccstack, top_si->si_cxix);
1N/A }
1N/A if (cxix < 0) {
1N/A if (GIMME != G_ARRAY) {
1N/A EXTEND(SP, 1);
1N/A RETPUSHUNDEF;
1N/A }
1N/A RETURN;
1N/A }
1N/A if (PL_DBsub && cxix >= 0 &&
1N/A ccstack[cxix].blk_sub.cv == GvCV(PL_DBsub))
1N/A count++;
1N/A if (!count--)
1N/A break;
1N/A cxix = dopoptosub_at(ccstack, cxix - 1);
1N/A }
1N/A
1N/A cx = &ccstack[cxix];
1N/A if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1N/A dbcxix = dopoptosub_at(ccstack, cxix - 1);
1N/A /* We expect that ccstack[dbcxix] is CXt_SUB, anyway, the
1N/A field below is defined for any cx. */
1N/A if (PL_DBsub && dbcxix >= 0 && ccstack[dbcxix].blk_sub.cv == GvCV(PL_DBsub))
1N/A cx = &ccstack[dbcxix];
1N/A }
1N/A
1N/A stashname = CopSTASHPV(cx->blk_oldcop);
1N/A if (GIMME != G_ARRAY) {
1N/A EXTEND(SP, 1);
1N/A if (!stashname)
1N/A PUSHs(&PL_sv_undef);
1N/A else {
1N/A dTARGET;
1N/A sv_setpv(TARG, stashname);
1N/A PUSHs(TARG);
1N/A }
1N/A RETURN;
1N/A }
1N/A
1N/A EXTEND(SP, 10);
1N/A
1N/A if (!stashname)
1N/A PUSHs(&PL_sv_undef);
1N/A else
1N/A PUSHs(sv_2mortal(newSVpv(stashname, 0)));
1N/A PUSHs(sv_2mortal(newSVpv(OutCopFILE(cx->blk_oldcop), 0)));
1N/A PUSHs(sv_2mortal(newSViv((I32)CopLINE(cx->blk_oldcop))));
1N/A if (!MAXARG)
1N/A RETURN;
1N/A if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1N/A GV *cvgv = CvGV(ccstack[cxix].blk_sub.cv);
1N/A /* So is ccstack[dbcxix]. */
1N/A if (isGV(cvgv)) {
1N/A sv = NEWSV(49, 0);
1N/A gv_efullname3(sv, cvgv, Nullch);
1N/A PUSHs(sv_2mortal(sv));
1N/A PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1N/A }
1N/A else {
1N/A PUSHs(sv_2mortal(newSVpvn("(unknown)",9)));
1N/A PUSHs(sv_2mortal(newSViv((I32)cx->blk_sub.hasargs)));
1N/A }
1N/A }
1N/A else {
1N/A PUSHs(sv_2mortal(newSVpvn("(eval)",6)));
1N/A PUSHs(sv_2mortal(newSViv(0)));
1N/A }
1N/A gimme = (I32)cx->blk_gimme;
1N/A if (gimme == G_VOID)
1N/A PUSHs(&PL_sv_undef);
1N/A else
1N/A PUSHs(sv_2mortal(newSViv(gimme & G_ARRAY)));
1N/A if (CxTYPE(cx) == CXt_EVAL) {
1N/A /* eval STRING */
1N/A if (cx->blk_eval.old_op_type == OP_ENTEREVAL) {
1N/A PUSHs(cx->blk_eval.cur_text);
1N/A PUSHs(&PL_sv_no);
1N/A }
1N/A /* require */
1N/A else if (cx->blk_eval.old_namesv) {
1N/A PUSHs(sv_2mortal(newSVsv(cx->blk_eval.old_namesv)));
1N/A PUSHs(&PL_sv_yes);
1N/A }
1N/A /* eval BLOCK (try blocks have old_namesv == 0) */
1N/A else {
1N/A PUSHs(&PL_sv_undef);
1N/A PUSHs(&PL_sv_undef);
1N/A }
1N/A }
1N/A else {
1N/A PUSHs(&PL_sv_undef);
1N/A PUSHs(&PL_sv_undef);
1N/A }
1N/A if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs
1N/A && CopSTASH_eq(PL_curcop, PL_debstash))
1N/A {
1N/A AV *ary = cx->blk_sub.argarray;
1N/A int off = AvARRAY(ary) - AvALLOC(ary);
1N/A
1N/A if (!PL_dbargs) {
1N/A GV* tmpgv;
1N/A PL_dbargs = GvAV(gv_AVadd(tmpgv = gv_fetchpv("DB::args", TRUE,
1N/A SVt_PVAV)));
1N/A GvMULTI_on(tmpgv);
1N/A AvREAL_off(PL_dbargs); /* XXX should be REIFY (see av.h) */
1N/A }
1N/A
1N/A if (AvMAX(PL_dbargs) < AvFILLp(ary) + off)
1N/A av_extend(PL_dbargs, AvFILLp(ary) + off);
1N/A Copy(AvALLOC(ary), AvARRAY(PL_dbargs), AvFILLp(ary) + 1 + off, SV*);
1N/A AvFILLp(PL_dbargs) = AvFILLp(ary) + off;
1N/A }
1N/A /* XXX only hints propagated via op_private are currently
1N/A * visible (others are not easily accessible, since they
1N/A * use the global PL_hints) */
1N/A PUSHs(sv_2mortal(newSViv((I32)cx->blk_oldcop->op_private &
1N/A HINT_PRIVATE_MASK)));
1N/A {
1N/A SV * mask ;
1N/A SV * old_warnings = cx->blk_oldcop->cop_warnings ;
1N/A
1N/A if (old_warnings == pWARN_NONE ||
1N/A (old_warnings == pWARN_STD && (PL_dowarn & G_WARN_ON) == 0))
1N/A mask = newSVpvn(WARN_NONEstring, WARNsize) ;
1N/A else if (old_warnings == pWARN_ALL ||
1N/A (old_warnings == pWARN_STD && PL_dowarn & G_WARN_ON))
1N/A mask = newSVpvn(WARN_ALLstring, WARNsize) ;
1N/A else
1N/A mask = newSVsv(old_warnings);
1N/A PUSHs(sv_2mortal(mask));
1N/A }
1N/A RETURN;
1N/A}
1N/A
1N/APP(pp_reset)
1N/A{
1N/A dSP;
1N/A char *tmps;
1N/A STRLEN n_a;
1N/A
1N/A if (MAXARG < 1)
1N/A tmps = "";
1N/A else
1N/A tmps = POPpx;
1N/A sv_reset(tmps, CopSTASH(PL_curcop));
1N/A PUSHs(&PL_sv_yes);
1N/A RETURN;
1N/A}
1N/A
1N/APP(pp_lineseq)
1N/A{
1N/A return NORMAL;
1N/A}
1N/A
1N/A/* like pp_nextstate, but used instead when the debugger is active */
1N/A
1N/APP(pp_dbstate)
1N/A{
1N/A PL_curcop = (COP*)PL_op;
1N/A TAINT_NOT; /* Each statement is presumed innocent */
1N/A PL_stack_sp = PL_stack_base + cxstack[cxstack_ix].blk_oldsp;
1N/A FREETMPS;
1N/A
1N/A if (PL_op->op_flags & OPf_SPECIAL /* breakpoint */
1N/A || SvIV(PL_DBsingle) || SvIV(PL_DBsignal) || SvIV(PL_DBtrace))
1N/A {
1N/A dSP;
1N/A register CV *cv;
1N/A register PERL_CONTEXT *cx;
1N/A I32 gimme = G_ARRAY;
1N/A U8 hasargs;
1N/A GV *gv;
1N/A
1N/A gv = PL_DBgv;
1N/A cv = GvCV(gv);
1N/A if (!cv)
1N/A DIE(aTHX_ "No DB::DB routine defined");
1N/A
1N/A if (CvDEPTH(cv) >= 1 && !(PL_debug & DEBUG_DB_RECURSE_FLAG))
1N/A /* don't do recursive DB::DB call */
1N/A return NORMAL;
1N/A
1N/A ENTER;
1N/A SAVETMPS;
1N/A
1N/A SAVEI32(PL_debug);
1N/A SAVESTACK_POS();
1N/A PL_debug = 0;
1N/A hasargs = 0;
1N/A SPAGAIN;
1N/A
1N/A push_return(PL_op->op_next);
1N/A PUSHBLOCK(cx, CXt_SUB, SP);
1N/A PUSHSUB_DB(cx);
1N/A CvDEPTH(cv)++;
1N/A PAD_SET_CUR(CvPADLIST(cv),1);
1N/A RETURNOP(CvSTART(cv));
1N/A }
1N/A else
1N/A return NORMAL;
1N/A}
1N/A
1N/APP(pp_scope)
1N/A{
1N/A return NORMAL;
1N/A}
1N/A
1N/APP(pp_enteriter)
1N/A{
1N/A dSP; dMARK;
1N/A register PERL_CONTEXT *cx;
1N/A I32 gimme = GIMME_V;
1N/A SV **svp;
1N/A U32 cxtype = CXt_LOOP;
1N/A#ifdef USE_ITHREADS
1N/A void *iterdata;
1N/A#endif
1N/A
1N/A ENTER;
1N/A SAVETMPS;
1N/A
1N/A#ifdef USE_5005THREADS
1N/A if (PL_op->op_flags & OPf_SPECIAL) {
1N/A svp = &THREADSV(PL_op->op_targ); /* per-thread variable */
1N/A SAVEGENERICSV(*svp);
1N/A *svp = NEWSV(0,0);
1N/A }
1N/A else
1N/A#endif /* USE_5005THREADS */
1N/A if (PL_op->op_targ) {
1N/A#ifndef USE_ITHREADS
1N/A svp = &PAD_SVl(PL_op->op_targ); /* "my" variable */
1N/A SAVESPTR(*svp);
1N/A#else
1N/A SAVEPADSV(PL_op->op_targ);
1N/A iterdata = INT2PTR(void*, PL_op->op_targ);
1N/A cxtype |= CXp_PADVAR;
1N/A#endif
1N/A }
1N/A else {
1N/A GV *gv = (GV*)POPs;
1N/A svp = &GvSV(gv); /* symbol table variable */
1N/A SAVEGENERICSV(*svp);
1N/A *svp = NEWSV(0,0);
1N/A#ifdef USE_ITHREADS
1N/A iterdata = (void*)gv;
1N/A#endif
1N/A }
1N/A
1N/A ENTER;
1N/A
1N/A PUSHBLOCK(cx, cxtype, SP);
1N/A#ifdef USE_ITHREADS
1N/A PUSHLOOP(cx, iterdata, MARK);
1N/A#else
1N/A PUSHLOOP(cx, svp, MARK);
1N/A#endif
1N/A if (PL_op->op_flags & OPf_STACKED) {
1N/A cx->blk_loop.iterary = (AV*)SvREFCNT_inc(POPs);
1N/A if (SvTYPE(cx->blk_loop.iterary) != SVt_PVAV) {
1N/A dPOPss;
1N/A SV *right = (SV*)cx->blk_loop.iterary;
1N/A if (RANGE_IS_NUMERIC(sv,right)) {
1N/A if ((SvOK(sv) && SvNV(sv) < IV_MIN) ||
1N/A (SvOK(right) && SvNV(right) >= IV_MAX))
1N/A DIE(aTHX_ "Range iterator outside integer range");
1N/A cx->blk_loop.iterix = SvIV(sv);
1N/A cx->blk_loop.itermax = SvIV(right);
1N/A }
1N/A else {
1N/A STRLEN n_a;
1N/A cx->blk_loop.iterlval = newSVsv(sv);
1N/A (void) SvPV_force(cx->blk_loop.iterlval,n_a);
1N/A (void) SvPV(right,n_a);
1N/A }
1N/A }
1N/A }
1N/A else {
1N/A cx->blk_loop.iterary = PL_curstack;
1N/A AvFILLp(PL_curstack) = SP - PL_stack_base;
1N/A cx->blk_loop.iterix = MARK - PL_stack_base;
1N/A }
1N/A
1N/A RETURN;
1N/A}
1N/A
1N/APP(pp_enterloop)
1N/A{
1N/A dSP;
1N/A register PERL_CONTEXT *cx;
1N/A I32 gimme = GIMME_V;
1N/A
1N/A ENTER;
1N/A SAVETMPS;
1N/A ENTER;
1N/A
1N/A PUSHBLOCK(cx, CXt_LOOP, SP);
1N/A PUSHLOOP(cx, 0, SP);
1N/A
1N/A RETURN;
1N/A}
1N/A
1N/APP(pp_leaveloop)
1N/A{
1N/A dSP;
1N/A register PERL_CONTEXT *cx;
1N/A I32 gimme;
1N/A SV **newsp;
1N/A PMOP *newpm;
1N/A SV **mark;
1N/A
1N/A POPBLOCK(cx,newpm);
1N/A mark = newsp;
1N/A newsp = PL_stack_base + cx->blk_loop.resetsp;
1N/A
1N/A TAINT_NOT;
1N/A if (gimme == G_VOID)
1N/A ; /* do nothing */
1N/A else if (gimme == G_SCALAR) {
1N/A if (mark < SP)
1N/A *++newsp = sv_mortalcopy(*SP);
1N/A else
1N/A *++newsp = &PL_sv_undef;
1N/A }
1N/A else {
1N/A while (mark < SP) {
1N/A *++newsp = sv_mortalcopy(*++mark);
1N/A TAINT_NOT; /* Each item is independent */
1N/A }
1N/A }
1N/A SP = newsp;
1N/A PUTBACK;
1N/A
1N/A POPLOOP(cx); /* Stack values are safe: release loop vars ... */
1N/A PL_curpm = newpm; /* ... and pop $1 et al */
1N/A
1N/A LEAVE;
1N/A LEAVE;
1N/A
1N/A return NORMAL;
1N/A}
1N/A
1N/APP(pp_return)
1N/A{
1N/A dSP; dMARK;
1N/A I32 cxix;
1N/A register PERL_CONTEXT *cx;
1N/A bool popsub2 = FALSE;
1N/A bool clear_errsv = FALSE;
1N/A I32 gimme;
1N/A SV **newsp;
1N/A PMOP *newpm;
1N/A I32 optype = 0;
1N/A SV *sv;
1N/A
1N/A if (PL_curstackinfo->si_type == PERLSI_SORT) {
1N/A if (cxstack_ix == PL_sortcxix
1N/A || dopoptosub(cxstack_ix) <= PL_sortcxix)
1N/A {
1N/A if (cxstack_ix > PL_sortcxix)
1N/A dounwind(PL_sortcxix);
1N/A AvARRAY(PL_curstack)[1] = *SP;
1N/A PL_stack_sp = PL_stack_base + 1;
1N/A return 0;
1N/A }
1N/A }
1N/A
1N/A cxix = dopoptosub(cxstack_ix);
1N/A if (cxix < 0)
1N/A DIE(aTHX_ "Can't return outside a subroutine");
1N/A if (cxix < cxstack_ix)
1N/A dounwind(cxix);
1N/A
1N/A POPBLOCK(cx,newpm);
1N/A switch (CxTYPE(cx)) {
1N/A case CXt_SUB:
1N/A popsub2 = TRUE;
1N/A cxstack_ix++; /* preserve cx entry on stack for use by POPSUB */
1N/A break;
1N/A case CXt_EVAL:
1N/A if (!(PL_in_eval & EVAL_KEEPERR))
1N/A clear_errsv = TRUE;
1N/A POPEVAL(cx);
1N/A if (CxTRYBLOCK(cx))
1N/A break;
1N/A lex_end();
1N/A if (optype == OP_REQUIRE &&
1N/A (MARK == SP || (gimme == G_SCALAR && !SvTRUE(*SP))) )
1N/A {
1N/A /* Unassume the success we assumed earlier. */
1N/A SV *nsv = cx->blk_eval.old_namesv;
1N/A (void)hv_delete(GvHVn(PL_incgv), SvPVX(nsv), SvCUR(nsv), G_DISCARD);
1N/A DIE(aTHX_ "%"SVf" did not return a true value", nsv);
1N/A }
1N/A break;
1N/A case CXt_FORMAT:
1N/A POPFORMAT(cx);
1N/A break;
1N/A default:
1N/A DIE(aTHX_ "panic: return");
1N/A }
1N/A
1N/A TAINT_NOT;
1N/A if (gimme == G_SCALAR) {
1N/A if (MARK < SP) {
1N/A if (popsub2) {
1N/A if (cx->blk_sub.cv && CvDEPTH(cx->blk_sub.cv) > 1) {
1N/A if (SvTEMP(TOPs)) {
1N/A *++newsp = SvREFCNT_inc(*SP);
1N/A FREETMPS;
1N/A sv_2mortal(*newsp);
1N/A }
1N/A else {
1N/A sv = SvREFCNT_inc(*SP); /* FREETMPS could clobber it */
1N/A FREETMPS;
1N/A *++newsp = sv_mortalcopy(sv);
1N/A SvREFCNT_dec(sv);
1N/A }
1N/A }
1N/A else
1N/A *++newsp = (SvTEMP(*SP)) ? *SP : sv_mortalcopy(*SP);
1N/A }
1N/A else
1N/A *++newsp = sv_mortalcopy(*SP);
1N/A }
1N/A else
1N/A *++newsp = &PL_sv_undef;
1N/A }
1N/A else if (gimme == G_ARRAY) {
1N/A while (++MARK <= SP) {
1N/A *++newsp = (popsub2 && SvTEMP(*MARK))
1N/A ? *MARK : sv_mortalcopy(*MARK);
1N/A TAINT_NOT; /* Each item is independent */
1N/A }
1N/A }
1N/A PL_stack_sp = newsp;
1N/A
1N/A LEAVE;
1N/A /* Stack values are safe: */
1N/A if (popsub2) {
1N/A cxstack_ix--;
1N/A POPSUB(cx,sv); /* release CV and @_ ... */
1N/A }
1N/A else
1N/A sv = Nullsv;
1N/A PL_curpm = newpm; /* ... and pop $1 et al */
1N/A
1N/A LEAVESUB(sv);
1N/A if (clear_errsv)
1N/A sv_setpv(ERRSV,"");
1N/A return pop_return();
1N/A}
1N/A
1N/APP(pp_last)
1N/A{
1N/A dSP;
1N/A I32 cxix;
1N/A register PERL_CONTEXT *cx;
1N/A I32 pop2 = 0;
1N/A I32 gimme;
1N/A I32 optype;
1N/A OP *nextop;
1N/A SV **newsp;
1N/A PMOP *newpm;
1N/A SV **mark;
1N/A SV *sv = Nullsv;
1N/A
1N/A if (PL_op->op_flags & OPf_SPECIAL) {
1N/A cxix = dopoptoloop(cxstack_ix);
1N/A if (cxix < 0)
1N/A DIE(aTHX_ "Can't \"last\" outside a loop block");
1N/A }
1N/A else {
1N/A cxix = dopoptolabel(cPVOP->op_pv);
1N/A if (cxix < 0)
1N/A DIE(aTHX_ "Label not found for \"last %s\"", cPVOP->op_pv);
1N/A }
1N/A if (cxix < cxstack_ix)
1N/A dounwind(cxix);
1N/A
1N/A POPBLOCK(cx,newpm);
1N/A cxstack_ix++; /* temporarily protect top context */
1N/A mark = newsp;
1N/A switch (CxTYPE(cx)) {
1N/A case CXt_LOOP:
1N/A pop2 = CXt_LOOP;
1N/A newsp = PL_stack_base + cx->blk_loop.resetsp;
1N/A nextop = cx->blk_loop.last_op->op_next;
1N/A break;
1N/A case CXt_SUB:
1N/A pop2 = CXt_SUB;
1N/A nextop = pop_return();
1N/A break;
1N/A case CXt_EVAL:
1N/A POPEVAL(cx);
1N/A nextop = pop_return();
1N/A break;
1N/A case CXt_FORMAT:
1N/A POPFORMAT(cx);
1N/A nextop = pop_return();
1N/A break;
1N/A default:
1N/A DIE(aTHX_ "panic: last");
1N/A }
1N/A
1N/A TAINT_NOT;
1N/A if (gimme == G_SCALAR) {
1N/A if (MARK < SP)
1N/A *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*SP))
1N/A ? *SP : sv_mortalcopy(*SP);
1N/A else
1N/A *++newsp = &PL_sv_undef;
1N/A }
1N/A else if (gimme == G_ARRAY) {
1N/A while (++MARK <= SP) {
1N/A *++newsp = ((pop2 == CXt_SUB) && SvTEMP(*MARK))
1N/A ? *MARK : sv_mortalcopy(*MARK);
1N/A TAINT_NOT; /* Each item is independent */
1N/A }
1N/A }
1N/A SP = newsp;
1N/A PUTBACK;
1N/A
1N/A LEAVE;
1N/A cxstack_ix--;
1N/A /* Stack values are safe: */
1N/A switch (pop2) {
1N/A case CXt_LOOP:
1N/A POPLOOP(cx); /* release loop vars ... */
1N/A LEAVE;
1N/A break;
1N/A case CXt_SUB:
1N/A POPSUB(cx,sv); /* release CV and @_ ... */
1N/A break;
1N/A }
1N/A PL_curpm = newpm; /* ... and pop $1 et al */
1N/A
1N/A LEAVESUB(sv);
1N/A return nextop;
1N/A}
1N/A
1N/APP(pp_next)
1N/A{
1N/A I32 cxix;
1N/A register PERL_CONTEXT *cx;
1N/A I32 inner;
1N/A
1N/A if (PL_op->op_flags & OPf_SPECIAL) {
1N/A cxix = dopoptoloop(cxstack_ix);
1N/A if (cxix < 0)
1N/A DIE(aTHX_ "Can't \"next\" outside a loop block");
1N/A }
1N/A else {
1N/A cxix = dopoptolabel(cPVOP->op_pv);
1N/A if (cxix < 0)
1N/A DIE(aTHX_ "Label not found for \"next %s\"", cPVOP->op_pv);
1N/A }
1N/A if (cxix < cxstack_ix)
1N/A dounwind(cxix);
1N/A
1N/A /* clear off anything above the scope we're re-entering, but
1N/A * save the rest until after a possible continue block */
1N/A inner = PL_scopestack_ix;
1N/A TOPBLOCK(cx);
1N/A if (PL_scopestack_ix < inner)
1N/A leave_scope(PL_scopestack[PL_scopestack_ix]);
1N/A return cx->blk_loop.next_op;
1N/A}
1N/A
1N/APP(pp_redo)
1N/A{
1N/A I32 cxix;
1N/A register PERL_CONTEXT *cx;
1N/A I32 oldsave;
1N/A
1N/A if (PL_op->op_flags & OPf_SPECIAL) {
1N/A cxix = dopoptoloop(cxstack_ix);
1N/A if (cxix < 0)
1N/A DIE(aTHX_ "Can't \"redo\" outside a loop block");
1N/A }
1N/A else {
1N/A cxix = dopoptolabel(cPVOP->op_pv);
1N/A if (cxix < 0)
1N/A DIE(aTHX_ "Label not found for \"redo %s\"", cPVOP->op_pv);
1N/A }
1N/A if (cxix < cxstack_ix)
1N/A dounwind(cxix);
1N/A
1N/A TOPBLOCK(cx);
1N/A oldsave = PL_scopestack[PL_scopestack_ix - 1];
1N/A LEAVE_SCOPE(oldsave);
1N/A FREETMPS;
1N/A return cx->blk_loop.redo_op;
1N/A}
1N/A
1N/ASTATIC OP *
1N/AS_dofindlabel(pTHX_ OP *o, char *label, OP **opstack, OP **oplimit)
1N/A{
1N/A OP *kid = Nullop;
1N/A OP **ops = opstack;
1N/A static char too_deep[] = "Target of goto is too deeply nested";
1N/A
1N/A if (ops >= oplimit)
1N/A Perl_croak(aTHX_ too_deep);
1N/A if (o->op_type == OP_LEAVE ||
1N/A o->op_type == OP_SCOPE ||
1N/A o->op_type == OP_LEAVELOOP ||
1N/A o->op_type == OP_LEAVESUB ||
1N/A o->op_type == OP_LEAVETRY)
1N/A {
1N/A *ops++ = cUNOPo->op_first;
1N/A if (ops >= oplimit)
1N/A Perl_croak(aTHX_ too_deep);
1N/A }
1N/A *ops = 0;
1N/A if (o->op_flags & OPf_KIDS) {
1N/A /* First try all the kids at this level, since that's likeliest. */
1N/A for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1N/A if ((kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) &&
1N/A kCOP->cop_label && strEQ(kCOP->cop_label, label))
1N/A return kid;
1N/A }
1N/A for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) {
1N/A if (kid == PL_lastgotoprobe)
1N/A continue;
1N/A if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
1N/A if (ops == opstack)
1N/A *ops++ = kid;
1N/A else if (ops[-1]->op_type == OP_NEXTSTATE ||
1N/A ops[-1]->op_type == OP_DBSTATE)
1N/A ops[-1] = kid;
1N/A else
1N/A *ops++ = kid;
1N/A }
1N/A if ((o = dofindlabel(kid, label, ops, oplimit)))
1N/A return o;
1N/A }
1N/A }
1N/A *ops = 0;
1N/A return 0;
1N/A}
1N/A
1N/APP(pp_dump)
1N/A{
1N/A return pp_goto();
1N/A /*NOTREACHED*/
1N/A}
1N/A
1N/APP(pp_goto)
1N/A{
1N/A dSP;
1N/A OP *retop = 0;
1N/A I32 ix;
1N/A register PERL_CONTEXT *cx;
1N/A#define GOTO_DEPTH 64
1N/A OP *enterops[GOTO_DEPTH];
1N/A char *label;
1N/A int do_dump = (PL_op->op_type == OP_DUMP);
1N/A static char must_have_label[] = "goto must have label";
1N/A AV *oldav = Nullav;
1N/A
1N/A label = 0;
1N/A if (PL_op->op_flags & OPf_STACKED) {
1N/A SV *sv = POPs;
1N/A STRLEN n_a;
1N/A
1N/A /* This egregious kludge implements goto &subroutine */
1N/A if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV) {
1N/A I32 cxix;
1N/A register PERL_CONTEXT *cx;
1N/A CV* cv = (CV*)SvRV(sv);
1N/A SV** mark;
1N/A I32 items = 0;
1N/A I32 oldsave;
1N/A
1N/A retry:
1N/A if (!CvROOT(cv) && !CvXSUB(cv)) {
1N/A GV *gv = CvGV(cv);
1N/A GV *autogv;
1N/A if (gv) {
1N/A SV *tmpstr;
1N/A /* autoloaded stub? */
1N/A if (cv != GvCV(gv) && (cv = GvCV(gv)))
1N/A goto retry;
1N/A autogv = gv_autoload4(GvSTASH(gv), GvNAME(gv),
1N/A GvNAMELEN(gv), FALSE);
1N/A if (autogv && (cv = GvCV(autogv)))
1N/A goto retry;
1N/A tmpstr = sv_newmortal();
1N/A gv_efullname3(tmpstr, gv, Nullch);
1N/A DIE(aTHX_ "Goto undefined subroutine &%"SVf"",tmpstr);
1N/A }
1N/A DIE(aTHX_ "Goto undefined subroutine");
1N/A }
1N/A
1N/A /* First do some returnish stuff. */
1N/A SvREFCNT_inc(cv); /* avoid premature free during unwind */
1N/A FREETMPS;
1N/A cxix = dopoptosub(cxstack_ix);
1N/A if (cxix < 0)
1N/A DIE(aTHX_ "Can't goto subroutine outside a subroutine");
1N/A if (cxix < cxstack_ix)
1N/A dounwind(cxix);
1N/A TOPBLOCK(cx);
1N/A if (CxREALEVAL(cx))
1N/A DIE(aTHX_ "Can't goto subroutine from an eval-string");
1N/A mark = PL_stack_sp;
1N/A if (CxTYPE(cx) == CXt_SUB && cx->blk_sub.hasargs) {
1N/A /* put @_ back onto stack */
1N/A AV* av = cx->blk_sub.argarray;
1N/A
1N/A items = AvFILLp(av) + 1;
1N/A PL_stack_sp++;
1N/A EXTEND(PL_stack_sp, items); /* @_ could have been extended. */
1N/A Copy(AvARRAY(av), PL_stack_sp, items, SV*);
1N/A PL_stack_sp += items;
1N/A#ifndef USE_5005THREADS
1N/A SvREFCNT_dec(GvAV(PL_defgv));
1N/A GvAV(PL_defgv) = cx->blk_sub.savearray;
1N/A#endif /* USE_5005THREADS */
1N/A /* abandon @_ if it got reified */
1N/A if (AvREAL(av)) {
1N/A oldav = av; /* delay until return */
1N/A av = newAV();
1N/A av_extend(av, items-1);
1N/A AvFLAGS(av) = AVf_REIFY;
1N/A PAD_SVl(0) = (SV*)(cx->blk_sub.argarray = av);
1N/A }
1N/A else
1N/A CLEAR_ARGARRAY(av);
1N/A }
1N/A else if (CvXSUB(cv)) { /* put GvAV(defgv) back onto stack */
1N/A AV* av;
1N/A#ifdef USE_5005THREADS
1N/A av = (AV*)PAD_SVl(0);
1N/A#else
1N/A av = GvAV(PL_defgv);
1N/A#endif
1N/A items = AvFILLp(av) + 1;
1N/A PL_stack_sp++;
1N/A EXTEND(PL_stack_sp, items); /* @_ could have been extended. */
1N/A Copy(AvARRAY(av), PL_stack_sp, items, SV*);
1N/A PL_stack_sp += items;
1N/A }
1N/A if (CxTYPE(cx) == CXt_SUB &&
1N/A !(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth))
1N/A SvREFCNT_dec(cx->blk_sub.cv);
1N/A oldsave = PL_scopestack[PL_scopestack_ix - 1];
1N/A LEAVE_SCOPE(oldsave);
1N/A
1N/A /* Now do some callish stuff. */
1N/A SAVETMPS;
1N/A /* For reified @_, delay freeing till return from new sub */
1N/A if (oldav)
1N/A SAVEFREESV((SV*)oldav);
1N/A SAVEFREESV(cv); /* later, undo the 'avoid premature free' hack */
1N/A if (CvXSUB(cv)) {
1N/A#ifdef PERL_XSUB_OLDSTYLE
1N/A if (CvOLDSTYLE(cv)) {
1N/A I32 (*fp3)(int,int,int);
1N/A while (SP > mark) {
1N/A SP[1] = SP[0];
1N/A SP--;
1N/A }
1N/A fp3 = (I32(*)(int,int,int))CvXSUB(cv);
1N/A items = (*fp3)(CvXSUBANY(cv).any_i32,
1N/A mark - PL_stack_base + 1,
1N/A items);
1N/A SP = PL_stack_base + items;
1N/A }
1N/A else
1N/A#endif /* PERL_XSUB_OLDSTYLE */
1N/A {
1N/A SV **newsp;
1N/A I32 gimme;
1N/A
1N/A PL_stack_sp--; /* There is no cv arg. */
1N/A /* Push a mark for the start of arglist */
1N/A PUSHMARK(mark);
1N/A (void)(*CvXSUB(cv))(aTHX_ cv);
1N/A /* Pop the current context like a decent sub should */
1N/A POPBLOCK(cx, PL_curpm);
1N/A /* Do _not_ use PUTBACK, keep the XSUB's return stack! */
1N/A }
1N/A LEAVE;
1N/A return pop_return();
1N/A }
1N/A else {
1N/A AV* padlist = CvPADLIST(cv);
1N/A if (CxTYPE(cx) == CXt_EVAL) {
1N/A PL_in_eval = cx->blk_eval.old_in_eval;
1N/A PL_eval_root = cx->blk_eval.old_eval_root;
1N/A cx->cx_type = CXt_SUB;
1N/A cx->blk_sub.hasargs = 0;
1N/A }
1N/A cx->blk_sub.cv = cv;
1N/A cx->blk_sub.olddepth = (U16)CvDEPTH(cv);
1N/A
1N/A CvDEPTH(cv)++;
1N/A if (CvDEPTH(cv) < 2)
1N/A (void)SvREFCNT_inc(cv);
1N/A else {
1N/A if (CvDEPTH(cv) == 100 && ckWARN(WARN_RECURSION))
1N/A sub_crush_depth(cv);
1N/A pad_push(padlist, CvDEPTH(cv), cx->blk_sub.hasargs);
1N/A }
1N/A#ifdef USE_5005THREADS
1N/A if (!cx->blk_sub.hasargs) {
1N/A AV* av = (AV*)PAD_SVl(0);
1N/A
1N/A items = AvFILLp(av) + 1;
1N/A if (items) {
1N/A /* Mark is at the end of the stack. */
1N/A EXTEND(SP, items);
1N/A Copy(AvARRAY(av), SP + 1, items, SV*);
1N/A SP += items;
1N/A PUTBACK ;
1N/A }
1N/A }
1N/A#endif /* USE_5005THREADS */
1N/A PAD_SET_CUR(padlist, CvDEPTH(cv));
1N/A#ifndef USE_5005THREADS
1N/A if (cx->blk_sub.hasargs)
1N/A#endif /* USE_5005THREADS */
1N/A {
1N/A AV* av = (AV*)PAD_SVl(0);
1N/A SV** ary;
1N/A
1N/A#ifndef USE_5005THREADS
1N/A cx->blk_sub.savearray = GvAV(PL_defgv);
1N/A GvAV(PL_defgv) = (AV*)SvREFCNT_inc(av);
1N/A#endif /* USE_5005THREADS */
1N/A CX_CURPAD_SAVE(cx->blk_sub);
1N/A cx->blk_sub.argarray = av;
1N/A ++mark;
1N/A
1N/A if (items >= AvMAX(av) + 1) {
1N/A ary = AvALLOC(av);
1N/A if (AvARRAY(av) != ary) {
1N/A AvMAX(av) += AvARRAY(av) - AvALLOC(av);
1N/A SvPVX(av) = (char*)ary;
1N/A }
1N/A if (items >= AvMAX(av) + 1) {
1N/A AvMAX(av) = items - 1;
1N/A Renew(ary,items+1,SV*);
1N/A AvALLOC(av) = ary;
1N/A SvPVX(av) = (char*)ary;
1N/A }
1N/A }
1N/A Copy(mark,AvARRAY(av),items,SV*);
1N/A AvFILLp(av) = items - 1;
1N/A assert(!AvREAL(av));
1N/A while (items--) {
1N/A if (*mark)
1N/A SvTEMP_off(*mark);
1N/A mark++;
1N/A }
1N/A }
1N/A if (PERLDB_SUB) { /* Checking curstash breaks DProf. */
1N/A /*
1N/A * We do not care about using sv to call CV;
1N/A * it's for informational purposes only.
1N/A */
1N/A SV *sv = GvSV(PL_DBsub);
1N/A CV *gotocv;
1N/A
1N/A if (PERLDB_SUB_NN) {
1N/A (void)SvUPGRADE(sv, SVt_PVIV);
1N/A (void)SvIOK_on(sv);
1N/A SAVEIV(SvIVX(sv));
1N/A SvIVX(sv) = PTR2IV(cv); /* Do it the quickest way */
1N/A } else {
1N/A save_item(sv);
1N/A gv_efullname3(sv, CvGV(cv), Nullch);
1N/A }
1N/A if ( PERLDB_GOTO
1N/A && (gotocv = get_cv("DB::goto", FALSE)) ) {
1N/A PUSHMARK( PL_stack_sp );
1N/A call_sv((SV*)gotocv, G_SCALAR | G_NODEBUG);
1N/A PL_stack_sp--;
1N/A }
1N/A }
1N/A RETURNOP(CvSTART(cv));
1N/A }
1N/A }
1N/A else {
1N/A label = SvPV(sv,n_a);
1N/A if (!(do_dump || *label))
1N/A DIE(aTHX_ must_have_label);
1N/A }
1N/A }
1N/A else if (PL_op->op_flags & OPf_SPECIAL) {
1N/A if (! do_dump)
1N/A DIE(aTHX_ must_have_label);
1N/A }
1N/A else
1N/A label = cPVOP->op_pv;
1N/A
1N/A if (label && *label) {
1N/A OP *gotoprobe = 0;
1N/A bool leaving_eval = FALSE;
1N/A bool in_block = FALSE;
1N/A PERL_CONTEXT *last_eval_cx = 0;
1N/A
1N/A /* find label */
1N/A
1N/A PL_lastgotoprobe = 0;
1N/A *enterops = 0;
1N/A for (ix = cxstack_ix; ix >= 0; ix--) {
1N/A cx = &cxstack[ix];
1N/A switch (CxTYPE(cx)) {
1N/A case CXt_EVAL:
1N/A leaving_eval = TRUE;
1N/A if (!CxTRYBLOCK(cx)) {
1N/A gotoprobe = (last_eval_cx ?
1N/A last_eval_cx->blk_eval.old_eval_root :
1N/A PL_eval_root);
1N/A last_eval_cx = cx;
1N/A break;
1N/A }
1N/A /* else fall through */
1N/A case CXt_LOOP:
1N/A gotoprobe = cx->blk_oldcop->op_sibling;
1N/A break;
1N/A case CXt_SUBST:
1N/A continue;
1N/A case CXt_BLOCK:
1N/A if (ix) {
1N/A gotoprobe = cx->blk_oldcop->op_sibling;
1N/A in_block = TRUE;
1N/A } else
1N/A gotoprobe = PL_main_root;
1N/A break;
1N/A case CXt_SUB:
1N/A if (CvDEPTH(cx->blk_sub.cv)) {
1N/A gotoprobe = CvROOT(cx->blk_sub.cv);
1N/A break;
1N/A }
1N/A /* FALL THROUGH */
1N/A case CXt_FORMAT:
1N/A case CXt_NULL:
1N/A DIE(aTHX_ "Can't \"goto\" out of a pseudo block");
1N/A default:
1N/A if (ix)
1N/A DIE(aTHX_ "panic: goto");
1N/A gotoprobe = PL_main_root;
1N/A break;
1N/A }
1N/A if (gotoprobe) {
1N/A retop = dofindlabel(gotoprobe, label,
1N/A enterops, enterops + GOTO_DEPTH);
1N/A if (retop)
1N/A break;
1N/A }
1N/A PL_lastgotoprobe = gotoprobe;
1N/A }
1N/A if (!retop)
1N/A DIE(aTHX_ "Can't find label %s", label);
1N/A
1N/A /* if we're leaving an eval, check before we pop any frames
1N/A that we're not going to punt, otherwise the error
1N/A won't be caught */
1N/A
1N/A if (leaving_eval && *enterops && enterops[1]) {
1N/A I32 i;
1N/A for (i = 1; enterops[i]; i++)
1N/A if (enterops[i]->op_type == OP_ENTERITER)
1N/A DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
1N/A }
1N/A
1N/A /* pop unwanted frames */
1N/A
1N/A if (ix < cxstack_ix) {
1N/A I32 oldsave;
1N/A
1N/A if (ix < 0)
1N/A ix = 0;
1N/A dounwind(ix);
1N/A TOPBLOCK(cx);
1N/A oldsave = PL_scopestack[PL_scopestack_ix];
1N/A LEAVE_SCOPE(oldsave);
1N/A }
1N/A
1N/A /* push wanted frames */
1N/A
1N/A if (*enterops && enterops[1]) {
1N/A OP *oldop = PL_op;
1N/A ix = enterops[1]->op_type == OP_ENTER && in_block ? 2 : 1;
1N/A for (; enterops[ix]; ix++) {
1N/A PL_op = enterops[ix];
1N/A /* Eventually we may want to stack the needed arguments
1N/A * for each op. For now, we punt on the hard ones. */
1N/A if (PL_op->op_type == OP_ENTERITER)
1N/A DIE(aTHX_ "Can't \"goto\" into the middle of a foreach loop");
1N/A CALL_FPTR(PL_op->op_ppaddr)(aTHX);
1N/A }
1N/A PL_op = oldop;
1N/A }
1N/A }
1N/A
1N/A if (do_dump) {
1N/A#ifdef VMS
1N/A if (!retop) retop = PL_main_start;
1N/A#endif
1N/A PL_restartop = retop;
1N/A PL_do_undump = TRUE;
1N/A
1N/A my_unexec();
1N/A
1N/A PL_restartop = 0; /* hmm, must be GNU unexec().. */
1N/A PL_do_undump = FALSE;
1N/A }
1N/A
1N/A RETURNOP(retop);
1N/A}
1N/A
1N/APP(pp_exit)
1N/A{
1N/A dSP;
1N/A I32 anum;
1N/A
1N/A if (MAXARG < 1)
1N/A anum = 0;
1N/A else {
1N/A anum = SvIVx(POPs);
1N/A#ifdef VMS
1N/A if (anum == 1 && (PL_op->op_private & OPpEXIT_VMSISH))
1N/A anum = 0;
1N/A VMSISH_HUSHED = VMSISH_HUSHED || (PL_op->op_private & OPpHUSH_VMSISH);
1N/A#endif
1N/A }
1N/A PL_exit_flags |= PERL_EXIT_EXPECTED;
1N/A my_exit(anum);
1N/A PUSHs(&PL_sv_undef);
1N/A RETURN;
1N/A}
1N/A
1N/A#ifdef NOTYET
1N/APP(pp_nswitch)
1N/A{
1N/A dSP;
1N/A NV value = SvNVx(GvSV(cCOP->cop_gv));
1N/A register I32 match = I_32(value);
1N/A
1N/A if (value < 0.0) {
1N/A if (((NV)match) > value)
1N/A --match; /* was fractional--truncate other way */
1N/A }
1N/A match -= cCOP->uop.scop.scop_offset;
1N/A if (match < 0)
1N/A match = 0;
1N/A else if (match > cCOP->uop.scop.scop_max)
1N/A match = cCOP->uop.scop.scop_max;
1N/A PL_op = cCOP->uop.scop.scop_next[match];
1N/A RETURNOP(PL_op);
1N/A}
1N/A
1N/APP(pp_cswitch)
1N/A{
1N/A dSP;
1N/A register I32 match;
1N/A
1N/A if (PL_multiline)
1N/A PL_op = PL_op->op_next; /* can't assume anything */
1N/A else {
1N/A STRLEN n_a;
1N/A match = *(SvPVx(GvSV(cCOP->cop_gv), n_a)) & 255;
1N/A match -= cCOP->uop.scop.scop_offset;
1N/A if (match < 0)
1N/A match = 0;
1N/A else if (match > cCOP->uop.scop.scop_max)
1N/A match = cCOP->uop.scop.scop_max;
1N/A PL_op = cCOP->uop.scop.scop_next[match];
1N/A }
1N/A RETURNOP(PL_op);
1N/A}
1N/A#endif
1N/A
1N/A/* Eval. */
1N/A
1N/ASTATIC void
1N/AS_save_lines(pTHX_ AV *array, SV *sv)
1N/A{
1N/A register char *s = SvPVX(sv);
1N/A register char *send = SvPVX(sv) + SvCUR(sv);
1N/A register char *t;
1N/A register I32 line = 1;
1N/A
1N/A while (s && s < send) {
1N/A SV *tmpstr = NEWSV(85,0);
1N/A
1N/A sv_upgrade(tmpstr, SVt_PVMG);
1N/A t = strchr(s, '\n');
1N/A if (t)
1N/A t++;
1N/A else
1N/A t = send;
1N/A
1N/A sv_setpvn(tmpstr, s, t - s);
1N/A av_store(array, line++, tmpstr);
1N/A s = t;
1N/A }
1N/A}
1N/A
1N/A#ifdef PERL_FLEXIBLE_EXCEPTIONS
1N/ASTATIC void *
1N/AS_docatch_body(pTHX_ va_list args)
1N/A{
1N/A return docatch_body();
1N/A}
1N/A#endif
1N/A
1N/ASTATIC void *
1N/AS_docatch_body(pTHX)
1N/A{
1N/A CALLRUNOPS(aTHX);
1N/A return NULL;
1N/A}
1N/A
1N/ASTATIC OP *
1N/AS_docatch(pTHX_ OP *o)
1N/A{
1N/A int ret;
1N/A OP *oldop = PL_op;
1N/A OP *retop;
1N/A volatile PERL_SI *cursi = PL_curstackinfo;
1N/A dJMPENV;
1N/A
1N/A#ifdef DEBUGGING
1N/A assert(CATCH_GET == TRUE);
1N/A#endif
1N/A PL_op = o;
1N/A
1N/A /* Normally, the leavetry at the end of this block of ops will
1N/A * pop an op off the return stack and continue there. By setting
1N/A * the op to Nullop, we force an exit from the inner runops()
1N/A * loop. DAPM.
1N/A */
1N/A retop = pop_return();
1N/A push_return(Nullop);
1N/A
1N/A#ifdef PERL_FLEXIBLE_EXCEPTIONS
1N/A redo_body:
1N/A CALLPROTECT(aTHX_ pcur_env, &ret, MEMBER_TO_FPTR(S_docatch_body));
1N/A#else
1N/A JMPENV_PUSH(ret);
1N/A#endif
1N/A switch (ret) {
1N/A case 0:
1N/A#ifndef PERL_FLEXIBLE_EXCEPTIONS
1N/A redo_body:
1N/A docatch_body();
1N/A#endif
1N/A break;
1N/A case 3:
1N/A /* die caught by an inner eval - continue inner loop */
1N/A if (PL_restartop && cursi == PL_curstackinfo) {
1N/A PL_op = PL_restartop;
1N/A PL_restartop = 0;
1N/A goto redo_body;
1N/A }
1N/A /* a die in this eval - continue in outer loop */
1N/A if (!PL_restartop)
1N/A break;
1N/A /* FALL THROUGH */
1N/A default:
1N/A JMPENV_POP;
1N/A PL_op = oldop;
1N/A JMPENV_JUMP(ret);
1N/A /* NOTREACHED */
1N/A }
1N/A JMPENV_POP;
1N/A PL_op = oldop;
1N/A return retop;
1N/A}
1N/A
1N/AOP *
1N/APerl_sv_compile_2op(pTHX_ SV *sv, OP** startop, char *code, PAD** padp)
1N/A/* sv Text to convert to OP tree. */
1N/A/* startop op_free() this to undo. */
1N/A/* code Short string id of the caller. */
1N/A{
1N/A dSP; /* Make POPBLOCK work. */
1N/A PERL_CONTEXT *cx;
1N/A SV **newsp;
1N/A I32 gimme = 0; /* SUSPECT - INITIALZE TO WHAT? NI-S */
1N/A I32 optype;
1N/A OP dummy;
1N/A OP *rop;
1N/A char tbuf[TYPE_DIGITS(long) + 12 + 10];
1N/A char *tmpbuf = tbuf;
1N/A char *safestr;
1N/A int runtime;
1N/A CV* runcv = Nullcv; /* initialise to avoid compiler warnings */
1N/A
1N/A ENTER;
1N/A lex_start(sv);
1N/A SAVETMPS;
1N/A /* switch to eval mode */
1N/A
1N/A if (IN_PERL_COMPILETIME) {
1N/A SAVECOPSTASH_FREE(&PL_compiling);
1N/A CopSTASH_set(&PL_compiling, PL_curstash);
1N/A }
1N/A if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
1N/A SV *sv = sv_newmortal();
1N/A Perl_sv_setpvf(aTHX_ sv, "_<(%.10seval %lu)[%s:%"IVdf"]",
1N/A code, (unsigned long)++PL_evalseq,
1N/A CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
1N/A tmpbuf = SvPVX(sv);
1N/A }
1N/A else
1N/A sprintf(tmpbuf, "_<(%.10s_eval %lu)", code, (unsigned long)++PL_evalseq);
1N/A SAVECOPFILE_FREE(&PL_compiling);
1N/A CopFILE_set(&PL_compiling, tmpbuf+2);
1N/A SAVECOPLINE(&PL_compiling);
1N/A CopLINE_set(&PL_compiling, 1);
1N/A /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
1N/A deleting the eval's FILEGV from the stash before gv_check() runs
1N/A (i.e. before run-time proper). To work around the coredump that
1N/A ensues, we always turn GvMULTI_on for any globals that were
1N/A introduced within evals. See force_ident(). GSAR 96-10-12 */
1N/A safestr = savepv(tmpbuf);
1N/A SAVEDELETE(PL_defstash, safestr, strlen(safestr));
1N/A SAVEHINTS();
1N/A#ifdef OP_IN_REGISTER
1N/A PL_opsave = op;
1N/A#else
1N/A SAVEVPTR(PL_op);
1N/A#endif
1N/A
1N/A /* we get here either during compilation, or via pp_regcomp at runtime */
1N/A runtime = IN_PERL_RUNTIME;
1N/A if (runtime)
1N/A runcv = find_runcv(NULL);
1N/A
1N/A PL_op = &dummy;
1N/A PL_op->op_type = OP_ENTEREVAL;
1N/A PL_op->op_flags = 0; /* Avoid uninit warning. */
1N/A PUSHBLOCK(cx, CXt_EVAL|(IN_PERL_COMPILETIME ? 0 : CXp_REAL), SP);
1N/A PUSHEVAL(cx, 0, Nullgv);
1N/A
1N/A if (runtime)
1N/A rop = doeval(G_SCALAR, startop, runcv, PL_curcop->cop_seq);
1N/A else
1N/A rop = doeval(G_SCALAR, startop, PL_compcv, PL_cop_seqmax);
1N/A POPBLOCK(cx,PL_curpm);
1N/A POPEVAL(cx);
1N/A
1N/A (*startop)->op_type = OP_NULL;
1N/A (*startop)->op_ppaddr = PL_ppaddr[OP_NULL];
1N/A lex_end();
1N/A /* XXX DAPM do this properly one year */
1N/A *padp = (AV*)SvREFCNT_inc(PL_comppad);
1N/A LEAVE;
1N/A if (IN_PERL_COMPILETIME)
1N/A PL_compiling.op_private = (U8)(PL_hints & HINT_PRIVATE_MASK);
1N/A#ifdef OP_IN_REGISTER
1N/A op = PL_opsave;
1N/A#endif
1N/A return rop;
1N/A}
1N/A
1N/A
1N/A/*
1N/A=for apidoc find_runcv
1N/A
1N/ALocate the CV corresponding to the currently executing sub or eval.
1N/AIf db_seqp is non_null, skip CVs that are in the DB package and populate
1N/A*db_seqp with the cop sequence number at the point that the DB:: code was
1N/Aentered. (allows debuggers to eval in the scope of the breakpoint rather
1N/Athan in in the scope of the debuger itself).
1N/A
1N/A=cut
1N/A*/
1N/A
1N/ACV*
1N/APerl_find_runcv(pTHX_ U32 *db_seqp)
1N/A{
1N/A I32 ix;
1N/A PERL_SI *si;
1N/A PERL_CONTEXT *cx;
1N/A
1N/A if (db_seqp)
1N/A *db_seqp = PL_curcop->cop_seq;
1N/A for (si = PL_curstackinfo; si; si = si->si_prev) {
1N/A for (ix = si->si_cxix; ix >= 0; ix--) {
1N/A cx = &(si->si_cxstack[ix]);
1N/A if (CxTYPE(cx) == CXt_SUB || CxTYPE(cx) == CXt_FORMAT) {
1N/A CV *cv = cx->blk_sub.cv;
1N/A /* skip DB:: code */
1N/A if (db_seqp && PL_debstash && CvSTASH(cv) == PL_debstash) {
1N/A *db_seqp = cx->blk_oldcop->cop_seq;
1N/A continue;
1N/A }
1N/A return cv;
1N/A }
1N/A else if (CxTYPE(cx) == CXt_EVAL && !CxTRYBLOCK(cx))
1N/A return PL_compcv;
1N/A }
1N/A }
1N/A return PL_main_cv;
1N/A}
1N/A
1N/A
1N/A/* Compile a require/do, an eval '', or a /(?{...})/.
1N/A * In the last case, startop is non-null, and contains the address of
1N/A * a pointer that should be set to the just-compiled code.
1N/A * outside is the lexically enclosing CV (if any) that invoked us.
1N/A */
1N/A
1N/A/* With USE_5005THREADS, eval_owner must be held on entry to doeval */
1N/ASTATIC OP *
1N/AS_doeval(pTHX_ int gimme, OP** startop, CV* outside, U32 seq)
1N/A{
1N/A dSP;
1N/A OP *saveop = PL_op;
1N/A
1N/A PL_in_eval = ((saveop && saveop->op_type == OP_REQUIRE)
1N/A ? (EVAL_INREQUIRE | (PL_in_eval & EVAL_INEVAL))
1N/A : EVAL_INEVAL);
1N/A
1N/A PUSHMARK(SP);
1N/A
1N/A SAVESPTR(PL_compcv);
1N/A PL_compcv = (CV*)NEWSV(1104,0);
1N/A sv_upgrade((SV *)PL_compcv, SVt_PVCV);
1N/A CvEVAL_on(PL_compcv);
1N/A assert(CxTYPE(&cxstack[cxstack_ix]) == CXt_EVAL);
1N/A cxstack[cxstack_ix].blk_eval.cv = PL_compcv;
1N/A
1N/A#ifdef USE_5005THREADS
1N/A CvOWNER(PL_compcv) = 0;
1N/A New(666, CvMUTEXP(PL_compcv), 1, perl_mutex);
1N/A MUTEX_INIT(CvMUTEXP(PL_compcv));
1N/A#endif /* USE_5005THREADS */
1N/A
1N/A CvOUTSIDE_SEQ(PL_compcv) = seq;
1N/A CvOUTSIDE(PL_compcv) = (CV*)SvREFCNT_inc(outside);
1N/A
1N/A /* set up a scratch pad */
1N/A
1N/A CvPADLIST(PL_compcv) = pad_new(padnew_SAVE);
1N/A
1N/A
1N/A SAVEMORTALIZESV(PL_compcv); /* must remain until end of current statement */
1N/A
1N/A /* make sure we compile in the right package */
1N/A
1N/A if (CopSTASH_ne(PL_curcop, PL_curstash)) {
1N/A SAVESPTR(PL_curstash);
1N/A PL_curstash = CopSTASH(PL_curcop);
1N/A }
1N/A SAVESPTR(PL_beginav);
1N/A PL_beginav = newAV();
1N/A SAVEFREESV(PL_beginav);
1N/A SAVEI32(PL_error_count);
1N/A
1N/A /* try to compile it */
1N/A
1N/A PL_eval_root = Nullop;
1N/A PL_error_count = 0;
1N/A PL_curcop = &PL_compiling;
1N/A PL_curcop->cop_arybase = 0;
1N/A if (saveop && saveop->op_flags & OPf_SPECIAL)
1N/A PL_in_eval |= EVAL_KEEPERR;
1N/A else
1N/A sv_setpv(ERRSV,"");
1N/A if (yyparse() || PL_error_count || !PL_eval_root) {
1N/A SV **newsp; /* Used by POPBLOCK. */
1N/A PERL_CONTEXT *cx;
1N/A I32 optype = 0; /* Might be reset by POPEVAL. */
1N/A STRLEN n_a;
1N/A
1N/A PL_op = saveop;
1N/A if (PL_eval_root) {
1N/A op_free(PL_eval_root);
1N/A PL_eval_root = Nullop;
1N/A }
1N/A SP = PL_stack_base + POPMARK; /* pop original mark */
1N/A if (!startop) {
1N/A POPBLOCK(cx,PL_curpm);
1N/A POPEVAL(cx);
1N/A pop_return();
1N/A }
1N/A lex_end();
1N/A LEAVE;
1N/A if (optype == OP_REQUIRE) {
1N/A char* msg = SvPVx(ERRSV, n_a);
1N/A DIE(aTHX_ "%sCompilation failed in require",
1N/A *msg ? msg : "Unknown error\n");
1N/A }
1N/A else if (startop) {
1N/A char* msg = SvPVx(ERRSV, n_a);
1N/A
1N/A POPBLOCK(cx,PL_curpm);
1N/A POPEVAL(cx);
1N/A Perl_croak(aTHX_ "%sCompilation failed in regexp",
1N/A (*msg ? msg : "Unknown error\n"));
1N/A }
1N/A else {
1N/A char* msg = SvPVx(ERRSV, n_a);
1N/A if (!*msg) {
1N/A sv_setpv(ERRSV, "Compilation error");
1N/A }
1N/A }
1N/A#ifdef USE_5005THREADS
1N/A MUTEX_LOCK(&PL_eval_mutex);
1N/A PL_eval_owner = 0;
1N/A COND_SIGNAL(&PL_eval_cond);
1N/A MUTEX_UNLOCK(&PL_eval_mutex);
1N/A#endif /* USE_5005THREADS */
1N/A RETPUSHUNDEF;
1N/A }
1N/A CopLINE_set(&PL_compiling, 0);
1N/A if (startop) {
1N/A *startop = PL_eval_root;
1N/A } else
1N/A SAVEFREEOP(PL_eval_root);
1N/A
1N/A /* Set the context for this new optree.
1N/A * If the last op is an OP_REQUIRE, force scalar context.
1N/A * Otherwise, propagate the context from the eval(). */
1N/A if (PL_eval_root->op_type == OP_LEAVEEVAL
1N/A && cUNOPx(PL_eval_root)->op_first->op_type == OP_LINESEQ
1N/A && cLISTOPx(cUNOPx(PL_eval_root)->op_first)->op_last->op_type
1N/A == OP_REQUIRE)
1N/A scalar(PL_eval_root);
1N/A else if (gimme & G_VOID)
1N/A scalarvoid(PL_eval_root);
1N/A else if (gimme & G_ARRAY)
1N/A list(PL_eval_root);
1N/A else
1N/A scalar(PL_eval_root);
1N/A
1N/A DEBUG_x(dump_eval());
1N/A
1N/A /* Register with debugger: */
1N/A if (PERLDB_INTER && saveop->op_type == OP_REQUIRE) {
1N/A CV *cv = get_cv("DB::postponed", FALSE);
1N/A if (cv) {
1N/A dSP;
1N/A PUSHMARK(SP);
1N/A XPUSHs((SV*)CopFILEGV(&PL_compiling));
1N/A PUTBACK;
1N/A call_sv((SV*)cv, G_DISCARD);
1N/A }
1N/A }
1N/A
1N/A /* compiled okay, so do it */
1N/A
1N/A CvDEPTH(PL_compcv) = 1;
1N/A SP = PL_stack_base + POPMARK; /* pop original mark */
1N/A PL_op = saveop; /* The caller may need it. */
1N/A PL_lex_state = LEX_NOTPARSING; /* $^S needs this. */
1N/A#ifdef USE_5005THREADS
1N/A MUTEX_LOCK(&PL_eval_mutex);
1N/A PL_eval_owner = 0;
1N/A COND_SIGNAL(&PL_eval_cond);
1N/A MUTEX_UNLOCK(&PL_eval_mutex);
1N/A#endif /* USE_5005THREADS */
1N/A
1N/A RETURNOP(PL_eval_start);
1N/A}
1N/A
1N/ASTATIC PerlIO *
1N/AS_doopen_pm(pTHX_ const char *name, const char *mode)
1N/A{
1N/A#ifndef PERL_DISABLE_PMC
1N/A STRLEN namelen = strlen(name);
1N/A PerlIO *fp;
1N/A
1N/A if (namelen > 3 && strEQ(name + namelen - 3, ".pm")) {
1N/A SV *pmcsv = Perl_newSVpvf(aTHX_ "%s%c", name, 'c');
1N/A char *pmc = SvPV_nolen(pmcsv);
1N/A Stat_t pmstat;
1N/A Stat_t pmcstat;
1N/A if (PerlLIO_stat(pmc, &pmcstat) < 0) {
1N/A fp = PerlIO_open(name, mode);
1N/A }
1N/A else {
1N/A if (PerlLIO_stat(name, &pmstat) < 0 ||
1N/A pmstat.st_mtime < pmcstat.st_mtime)
1N/A {
1N/A fp = PerlIO_open(pmc, mode);
1N/A }
1N/A else {
1N/A fp = PerlIO_open(name, mode);
1N/A }
1N/A }
1N/A SvREFCNT_dec(pmcsv);
1N/A }
1N/A else {
1N/A fp = PerlIO_open(name, mode);
1N/A }
1N/A return fp;
1N/A#else
1N/A return PerlIO_open(name, mode);
1N/A#endif /* !PERL_DISABLE_PMC */
1N/A}
1N/A
1N/APP(pp_require)
1N/A{
1N/A dSP;
1N/A register PERL_CONTEXT *cx;
1N/A SV *sv;
1N/A char *name;
1N/A STRLEN len;
1N/A char *tryname = Nullch;
1N/A SV *namesv = Nullsv;
1N/A SV** svp;
1N/A I32 gimme = GIMME_V;
1N/A PerlIO *tryrsfp = 0;
1N/A STRLEN n_a;
1N/A int filter_has_file = 0;
1N/A GV *filter_child_proc = 0;
1N/A SV *filter_state = 0;
1N/A SV *filter_sub = 0;
1N/A SV *hook_sv = 0;
1N/A SV *encoding;
1N/A OP *op;
1N/A
1N/A sv = POPs;
1N/A if (SvNIOKp(sv) && PL_op->op_type != OP_DOFILE) {
1N/A if (SvPOK(sv) && SvNOK(sv) && SvNV(sv)) { /* require v5.6.1 */
1N/A UV rev = 0, ver = 0, sver = 0;
1N/A STRLEN len;
1N/A U8 *s = (U8*)SvPVX(sv);
1N/A U8 *end = (U8*)SvPVX(sv) + SvCUR(sv);
1N/A if (s < end) {
1N/A rev = utf8n_to_uvchr(s, end - s, &len, 0);
1N/A s += len;
1N/A if (s < end) {
1N/A ver = utf8n_to_uvchr(s, end - s, &len, 0);
1N/A s += len;
1N/A if (s < end)
1N/A sver = utf8n_to_uvchr(s, end - s, &len, 0);
1N/A }
1N/A }
1N/A if (PERL_REVISION < rev
1N/A || (PERL_REVISION == rev
1N/A && (PERL_VERSION < ver
1N/A || (PERL_VERSION == ver
1N/A && PERL_SUBVERSION < sver))))
1N/A {
1N/A DIE(aTHX_ "Perl v%"UVuf".%"UVuf".%"UVuf" required--this is only "
1N/A "v%d.%d.%d, stopped", rev, ver, sver, PERL_REVISION,
1N/A PERL_VERSION, PERL_SUBVERSION);
1N/A }
1N/A RETPUSHYES;
1N/A }
1N/A else if (!SvPOKp(sv)) { /* require 5.005_03 */
1N/A if ((NV)PERL_REVISION + ((NV)PERL_VERSION/(NV)1000)
1N/A + ((NV)PERL_SUBVERSION/(NV)1000000)
1N/A + 0.00000099 < SvNV(sv))
1N/A {
1N/A NV nrev = SvNV(sv);
1N/A UV rev = (UV)nrev;
1N/A NV nver = (nrev - rev) * 1000;
1N/A UV ver = (UV)(nver + 0.0009);
1N/A NV nsver = (nver - ver) * 1000;
1N/A UV sver = (UV)(nsver + 0.0009);
1N/A
1N/A /* help out with the "use 5.6" confusion */
1N/A if (sver == 0 && (rev > 5 || (rev == 5 && ver >= 100))) {
1N/A DIE(aTHX_ "Perl v%"UVuf".%"UVuf".%"UVuf" required"
1N/A " (did you mean v%"UVuf".%03"UVuf"?)--"
1N/A "this is only v%d.%d.%d, stopped",
1N/A rev, ver, sver, rev, ver/100,
1N/A PERL_REVISION, PERL_VERSION, PERL_SUBVERSION);
1N/A }
1N/A else {
1N/A DIE(aTHX_ "Perl v%"UVuf".%"UVuf".%"UVuf" required--"
1N/A "this is only v%d.%d.%d, stopped",
1N/A rev, ver, sver, PERL_REVISION, PERL_VERSION,
1N/A PERL_SUBVERSION);
1N/A }
1N/A }
1N/A RETPUSHYES;
1N/A }
1N/A }
1N/A name = SvPV(sv, len);
1N/A if (!(name && len > 0 && *name))
1N/A DIE(aTHX_ "Null filename used");
1N/A TAINT_PROPER("require");
1N/A if (PL_op->op_type == OP_REQUIRE &&
1N/A (svp = hv_fetch(GvHVn(PL_incgv), name, len, 0)) &&
1N/A *svp != &PL_sv_undef)
1N/A RETPUSHYES;
1N/A
1N/A /* prepare to compile file */
1N/A
1N/A if (path_is_absolute(name)) {
1N/A tryname = name;
1N/A tryrsfp = doopen_pm(name,PERL_SCRIPT_MODE);
1N/A }
1N/A#ifdef MACOS_TRADITIONAL
1N/A if (!tryrsfp) {
1N/A char newname[256];
1N/A
1N/A MacPerl_CanonDir(name, newname, 1);
1N/A if (path_is_absolute(newname)) {
1N/A tryname = newname;
1N/A tryrsfp = doopen_pm(newname,PERL_SCRIPT_MODE);
1N/A }
1N/A }
1N/A#endif
1N/A if (!tryrsfp) {
1N/A AV *ar = GvAVn(PL_incgv);
1N/A I32 i;
1N/A#ifdef VMS
1N/A char *unixname;
1N/A if ((unixname = tounixspec(name, Nullch)) != Nullch)
1N/A#endif
1N/A {
1N/A namesv = NEWSV(806, 0);
1N/A for (i = 0; i <= AvFILL(ar); i++) {
1N/A SV *dirsv = *av_fetch(ar, i, TRUE);
1N/A
1N/A if (SvROK(dirsv)) {
1N/A int count;
1N/A SV *loader = dirsv;
1N/A
1N/A if (SvTYPE(SvRV(loader)) == SVt_PVAV
1N/A && !sv_isobject(loader))
1N/A {
1N/A loader = *av_fetch((AV *)SvRV(loader), 0, TRUE);
1N/A }
1N/A
1N/A Perl_sv_setpvf(aTHX_ namesv, "/loader/0x%"UVxf"/%s",
1N/A PTR2UV(SvRV(dirsv)), name);
1N/A tryname = SvPVX(namesv);
1N/A tryrsfp = 0;
1N/A
1N/A ENTER;
1N/A SAVETMPS;
1N/A EXTEND(SP, 2);
1N/A
1N/A PUSHMARK(SP);
1N/A PUSHs(dirsv);
1N/A PUSHs(sv);
1N/A PUTBACK;
1N/A if (sv_isobject(loader))
1N/A count = call_method("INC", G_ARRAY);
1N/A else
1N/A count = call_sv(loader, G_ARRAY);
1N/A SPAGAIN;
1N/A
1N/A if (count > 0) {
1N/A int i = 0;
1N/A SV *arg;
1N/A
1N/A SP -= count - 1;
1N/A arg = SP[i++];
1N/A
1N/A if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVGV) {
1N/A arg = SvRV(arg);
1N/A }
1N/A
1N/A if (SvTYPE(arg) == SVt_PVGV) {
1N/A IO *io = GvIO((GV *)arg);
1N/A
1N/A ++filter_has_file;
1N/A
1N/A if (io) {
1N/A tryrsfp = IoIFP(io);
1N/A if (IoTYPE(io) == IoTYPE_PIPE) {
1N/A /* reading from a child process doesn't
1N/A nest -- when returning from reading
1N/A the inner module, the outer one is
1N/A unreadable (closed?) I've tried to
1N/A save the gv to manage the lifespan of
1N/A the pipe, but this didn't help. XXX */
1N/A filter_child_proc = (GV *)arg;
1N/A (void)SvREFCNT_inc(filter_child_proc);
1N/A }
1N/A else {
1N/A if (IoOFP(io) && IoOFP(io) != IoIFP(io)) {
1N/A PerlIO_close(IoOFP(io));
1N/A }
1N/A IoIFP(io) = Nullfp;
1N/A IoOFP(io) = Nullfp;
1N/A }
1N/A }
1N/A
1N/A if (i < count) {
1N/A arg = SP[i++];
1N/A }
1N/A }
1N/A
1N/A if (SvROK(arg) && SvTYPE(SvRV(arg)) == SVt_PVCV) {
1N/A filter_sub = arg;
1N/A (void)SvREFCNT_inc(filter_sub);
1N/A
1N/A if (i < count) {
1N/A filter_state = SP[i];
1N/A (void)SvREFCNT_inc(filter_state);
1N/A }
1N/A
1N/A if (tryrsfp == 0) {
1N/A tryrsfp = PerlIO_open("/dev/null",
1N/A PERL_SCRIPT_MODE);
1N/A }
1N/A }
1N/A SP--;
1N/A }
1N/A
1N/A PUTBACK;
1N/A FREETMPS;
1N/A LEAVE;
1N/A
1N/A if (tryrsfp) {
1N/A hook_sv = dirsv;
1N/A break;
1N/A }
1N/A
1N/A filter_has_file = 0;
1N/A if (filter_child_proc) {
1N/A SvREFCNT_dec(filter_child_proc);
1N/A filter_child_proc = 0;
1N/A }
1N/A if (filter_state) {
1N/A SvREFCNT_dec(filter_state);
1N/A filter_state = 0;
1N/A }
1N/A if (filter_sub) {
1N/A SvREFCNT_dec(filter_sub);
1N/A filter_sub = 0;
1N/A }
1N/A }
1N/A else {
1N/A if (!path_is_absolute(name)
1N/A#ifdef MACOS_TRADITIONAL
1N/A /* We consider paths of the form :a:b ambiguous and interpret them first
1N/A as global then as local
1N/A */
1N/A || (*name == ':' && name[1] != ':' && strchr(name+2, ':'))
1N/A#endif
1N/A ) {
1N/A char *dir = SvPVx(dirsv, n_a);
1N/A#ifdef MACOS_TRADITIONAL
1N/A char buf1[256];
1N/A char buf2[256];
1N/A
1N/A MacPerl_CanonDir(name, buf2, 1);
1N/A Perl_sv_setpvf(aTHX_ namesv, "%s%s", MacPerl_CanonDir(dir, buf1, 0), buf2+(buf2[0] == ':'));
1N/A#else
1N/A#ifdef VMS
1N/A char *unixdir;
1N/A if ((unixdir = tounixpath(dir, Nullch)) == Nullch)
1N/A continue;
1N/A sv_setpv(namesv, unixdir);
1N/A sv_catpv(namesv, unixname);
1N/A#else
1N/A Perl_sv_setpvf(aTHX_ namesv, "%s/%s", dir, name);
1N/A#endif
1N/A#endif
1N/A TAINT_PROPER("require");
1N/A tryname = SvPVX(namesv);
1N/A tryrsfp = doopen_pm(tryname, PERL_SCRIPT_MODE);
1N/A if (tryrsfp) {
1N/A if (tryname[0] == '.' && tryname[1] == '/')
1N/A tryname += 2;
1N/A break;
1N/A }
1N/A }
1N/A }
1N/A }
1N/A }
1N/A }
1N/A SAVECOPFILE_FREE(&PL_compiling);
1N/A CopFILE_set(&PL_compiling, tryrsfp ? tryname : name);
1N/A SvREFCNT_dec(namesv);
1N/A if (!tryrsfp) {
1N/A if (PL_op->op_type == OP_REQUIRE) {
1N/A char *msgstr = name;
1N/A if (namesv) { /* did we lookup @INC? */
1N/A SV *msg = sv_2mortal(newSVpv(msgstr,0));
1N/A SV *dirmsgsv = NEWSV(0, 0);
1N/A AV *ar = GvAVn(PL_incgv);
1N/A I32 i;
1N/A sv_catpvn(msg, " in @INC", 8);
1N/A if (instr(SvPVX(msg), ".h "))
1N/A sv_catpv(msg, " (change .h to .ph maybe?)");
1N/A if (instr(SvPVX(msg), ".ph "))
1N/A sv_catpv(msg, " (did you run h2ph?)");
1N/A sv_catpv(msg, " (@INC contains:");
1N/A for (i = 0; i <= AvFILL(ar); i++) {
1N/A char *dir = SvPVx(*av_fetch(ar, i, TRUE), n_a);
1N/A Perl_sv_setpvf(aTHX_ dirmsgsv, " %s", dir);
1N/A sv_catsv(msg, dirmsgsv);
1N/A }
1N/A sv_catpvn(msg, ")", 1);
1N/A SvREFCNT_dec(dirmsgsv);
1N/A msgstr = SvPV_nolen(msg);
1N/A }
1N/A DIE(aTHX_ "Can't locate %s", msgstr);
1N/A }
1N/A
1N/A RETPUSHUNDEF;
1N/A }
1N/A else
1N/A SETERRNO(0, SS_NORMAL);
1N/A
1N/A /* Assume success here to prevent recursive requirement. */
1N/A len = strlen(name);
1N/A /* Check whether a hook in @INC has already filled %INC */
1N/A if (!hook_sv || !(svp = hv_fetch(GvHVn(PL_incgv), name, len, 0))) {
1N/A (void)hv_store(GvHVn(PL_incgv), name, len,
1N/A (hook_sv ? SvREFCNT_inc(hook_sv)
1N/A : newSVpv(CopFILE(&PL_compiling), 0)),
1N/A 0 );
1N/A }
1N/A
1N/A ENTER;
1N/A SAVETMPS;
1N/A lex_start(sv_2mortal(newSVpvn("",0)));
1N/A SAVEGENERICSV(PL_rsfp_filters);
1N/A PL_rsfp_filters = Nullav;
1N/A
1N/A PL_rsfp = tryrsfp;
1N/A SAVEHINTS();
1N/A PL_hints = 0;
1N/A SAVESPTR(PL_compiling.cop_warnings);
1N/A if (PL_dowarn & G_WARN_ALL_ON)
1N/A PL_compiling.cop_warnings = pWARN_ALL ;
1N/A else if (PL_dowarn & G_WARN_ALL_OFF)
1N/A PL_compiling.cop_warnings = pWARN_NONE ;
1N/A else if (PL_taint_warn)
1N/A PL_compiling.cop_warnings = newSVpvn(WARN_TAINTstring, WARNsize);
1N/A else
1N/A PL_compiling.cop_warnings = pWARN_STD ;
1N/A SAVESPTR(PL_compiling.cop_io);
1N/A PL_compiling.cop_io = Nullsv;
1N/A
1N/A if (filter_sub || filter_child_proc) {
1N/A SV *datasv = filter_add(run_user_filter, Nullsv);
1N/A IoLINES(datasv) = filter_has_file;
1N/A IoFMT_GV(datasv) = (GV *)filter_child_proc;
1N/A IoTOP_GV(datasv) = (GV *)filter_state;
1N/A IoBOTTOM_GV(datasv) = (GV *)filter_sub;
1N/A }
1N/A
1N/A /* switch to eval mode */
1N/A push_return(PL_op->op_next);
1N/A PUSHBLOCK(cx, CXt_EVAL, SP);
1N/A PUSHEVAL(cx, name, Nullgv);
1N/A
1N/A SAVECOPLINE(&PL_compiling);
1N/A CopLINE_set(&PL_compiling, 0);
1N/A
1N/A PUTBACK;
1N/A#ifdef USE_5005THREADS
1N/A MUTEX_LOCK(&PL_eval_mutex);
1N/A if (PL_eval_owner && PL_eval_owner != thr)
1N/A while (PL_eval_owner)
1N/A COND_WAIT(&PL_eval_cond, &PL_eval_mutex);
1N/A PL_eval_owner = thr;
1N/A MUTEX_UNLOCK(&PL_eval_mutex);
1N/A#endif /* USE_5005THREADS */
1N/A
1N/A /* Store and reset encoding. */
1N/A encoding = PL_encoding;
1N/A PL_encoding = Nullsv;
1N/A
1N/A op = DOCATCH(doeval(gimme, NULL, Nullcv, PL_curcop->cop_seq));
1N/A
1N/A /* Restore encoding. */
1N/A PL_encoding = encoding;
1N/A
1N/A return op;
1N/A}
1N/A
1N/APP(pp_dofile)
1N/A{
1N/A return pp_require();
1N/A}
1N/A
1N/APP(pp_entereval)
1N/A{
1N/A dSP;
1N/A register PERL_CONTEXT *cx;
1N/A dPOPss;
1N/A I32 gimme = GIMME_V, was = PL_sub_generation;
1N/A char tbuf[TYPE_DIGITS(long) + 12];
1N/A char *tmpbuf = tbuf;
1N/A char *safestr;
1N/A STRLEN len;
1N/A OP *ret;
1N/A CV* runcv;
1N/A U32 seq;
1N/A
1N/A if (!SvPV(sv,len))
1N/A RETPUSHUNDEF;
1N/A TAINT_PROPER("eval");
1N/A
1N/A ENTER;
1N/A lex_start(sv);
1N/A SAVETMPS;
1N/A
1N/A /* switch to eval mode */
1N/A
1N/A if (PERLDB_NAMEEVAL && CopLINE(PL_curcop)) {
1N/A SV *sv = sv_newmortal();
1N/A Perl_sv_setpvf(aTHX_ sv, "_<(eval %lu)[%s:%"IVdf"]",
1N/A (unsigned long)++PL_evalseq,
1N/A CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
1N/A tmpbuf = SvPVX(sv);
1N/A }
1N/A else
1N/A sprintf(tmpbuf, "_<(eval %lu)", (unsigned long)++PL_evalseq);
1N/A SAVECOPFILE_FREE(&PL_compiling);
1N/A CopFILE_set(&PL_compiling, tmpbuf+2);
1N/A SAVECOPLINE(&PL_compiling);
1N/A CopLINE_set(&PL_compiling, 1);
1N/A /* XXX For C<eval "...">s within BEGIN {} blocks, this ends up
1N/A deleting the eval's FILEGV from the stash before gv_check() runs
1N/A (i.e. before run-time proper). To work around the coredump that
1N/A ensues, we always turn GvMULTI_on for any globals that were
1N/A introduced within evals. See force_ident(). GSAR 96-10-12 */
1N/A safestr = savepv(tmpbuf);
1N/A SAVEDELETE(PL_defstash, safestr, strlen(safestr));
1N/A SAVEHINTS();
1N/A PL_hints = PL_op->op_targ;
1N/A SAVESPTR(PL_compiling.cop_warnings);
1N/A if (specialWARN(PL_curcop->cop_warnings))
1N/A PL_compiling.cop_warnings = PL_curcop->cop_warnings;
1N/A else {
1N/A PL_compiling.cop_warnings = newSVsv(PL_curcop->cop_warnings);
1N/A SAVEFREESV(PL_compiling.cop_warnings);
1N/A }
1N/A SAVESPTR(PL_compiling.cop_io);
1N/A if (specialCopIO(PL_curcop->cop_io))
1N/A PL_compiling.cop_io = PL_curcop->cop_io;
1N/A else {
1N/A PL_compiling.cop_io = newSVsv(PL_curcop->cop_io);
1N/A SAVEFREESV(PL_compiling.cop_io);
1N/A }
1N/A /* special case: an eval '' executed within the DB package gets lexically
1N/A * placed in the first non-DB CV rather than the current CV - this
1N/A * allows the debugger to execute code, find lexicals etc, in the
1N/A * scope of the code being debugged. Passing &seq gets find_runcv
1N/A * to do the dirty work for us */
1N/A runcv = find_runcv(&seq);
1N/A
1N/A push_return(PL_op->op_next);
1N/A PUSHBLOCK(cx, (CXt_EVAL|CXp_REAL), SP);
1N/A PUSHEVAL(cx, 0, Nullgv);
1N/A
1N/A /* prepare to compile string */
1N/A
1N/A if (PERLDB_LINE && PL_curstash != PL_debstash)
1N/A save_lines(CopFILEAV(&PL_compiling), PL_linestr);
1N/A PUTBACK;
1N/A#ifdef USE_5005THREADS
1N/A MUTEX_LOCK(&PL_eval_mutex);
1N/A if (PL_eval_owner && PL_eval_owner != thr)
1N/A while (PL_eval_owner)
1N/A COND_WAIT(&PL_eval_cond, &PL_eval_mutex);
1N/A PL_eval_owner = thr;
1N/A MUTEX_UNLOCK(&PL_eval_mutex);
1N/A#endif /* USE_5005THREADS */
1N/A ret = doeval(gimme, NULL, runcv, seq);
1N/A if (PERLDB_INTER && was != (I32)PL_sub_generation /* Some subs defined here. */
1N/A && ret != PL_op->op_next) { /* Successive compilation. */
1N/A strcpy(safestr, "_<(eval )"); /* Anything fake and short. */
1N/A }
1N/A return DOCATCH(ret);
1N/A}
1N/A
1N/APP(pp_leaveeval)
1N/A{
1N/A dSP;
1N/A register SV **mark;
1N/A SV **newsp;
1N/A PMOP *newpm;
1N/A I32 gimme;
1N/A register PERL_CONTEXT *cx;
1N/A OP *retop;
1N/A U8 save_flags = PL_op -> op_flags;
1N/A I32 optype;
1N/A
1N/A POPBLOCK(cx,newpm);
1N/A POPEVAL(cx);
1N/A retop = pop_return();
1N/A
1N/A TAINT_NOT;
1N/A if (gimme == G_VOID)
1N/A MARK = newsp;
1N/A else if (gimme == G_SCALAR) {
1N/A MARK = newsp + 1;
1N/A if (MARK <= SP) {
1N/A if (SvFLAGS(TOPs) & SVs_TEMP)
1N/A *MARK = TOPs;
1N/A else
1N/A *MARK = sv_mortalcopy(TOPs);
1N/A }
1N/A else {
1N/A MEXTEND(mark,0);
1N/A *MARK = &PL_sv_undef;
1N/A }
1N/A SP = MARK;
1N/A }
1N/A else {
1N/A /* in case LEAVE wipes old return values */
1N/A for (mark = newsp + 1; mark <= SP; mark++) {
1N/A if (!(SvFLAGS(*mark) & SVs_TEMP)) {
1N/A *mark = sv_mortalcopy(*mark);
1N/A TAINT_NOT; /* Each item is independent */
1N/A }
1N/A }
1N/A }
1N/A PL_curpm = newpm; /* Don't pop $1 et al till now */
1N/A
1N/A#ifdef DEBUGGING
1N/A assert(CvDEPTH(PL_compcv) == 1);
1N/A#endif
1N/A CvDEPTH(PL_compcv) = 0;
1N/A lex_end();
1N/A
1N/A if (optype == OP_REQUIRE &&
1N/A !(gimme == G_SCALAR ? SvTRUE(*SP) : SP > newsp))
1N/A {
1N/A /* Unassume the success we assumed earlier. */
1N/A SV *nsv = cx->blk_eval.old_namesv;
1N/A (void)hv_delete(GvHVn(PL_incgv), SvPVX(nsv), SvCUR(nsv), G_DISCARD);
1N/A retop = Perl_die(aTHX_ "%"SVf" did not return a true value", nsv);
1N/A /* die_where() did LEAVE, or we won't be here */
1N/A }
1N/A else {
1N/A LEAVE;
1N/A if (!(save_flags & OPf_SPECIAL))
1N/A sv_setpv(ERRSV,"");
1N/A }
1N/A
1N/A RETURNOP(retop);
1N/A}
1N/A
1N/APP(pp_entertry)
1N/A{
1N/A dSP;
1N/A register PERL_CONTEXT *cx;
1N/A I32 gimme = GIMME_V;
1N/A
1N/A ENTER;
1N/A SAVETMPS;
1N/A
1N/A push_return(cLOGOP->op_other->op_next);
1N/A PUSHBLOCK(cx, (CXt_EVAL|CXp_TRYBLOCK), SP);
1N/A PUSHEVAL(cx, 0, 0);
1N/A
1N/A PL_in_eval = EVAL_INEVAL;
1N/A sv_setpv(ERRSV,"");
1N/A PUTBACK;
1N/A return DOCATCH(PL_op->op_next);
1N/A}
1N/A
1N/APP(pp_leavetry)
1N/A{
1N/A dSP;
1N/A register SV **mark;
1N/A SV **newsp;
1N/A PMOP *newpm;
1N/A OP* retop;
1N/A I32 gimme;
1N/A register PERL_CONTEXT *cx;
1N/A I32 optype;
1N/A
1N/A POPBLOCK(cx,newpm);
1N/A POPEVAL(cx);
1N/A retop = pop_return();
1N/A
1N/A TAINT_NOT;
1N/A if (gimme == G_VOID)
1N/A SP = newsp;
1N/A else if (gimme == G_SCALAR) {
1N/A MARK = newsp + 1;
1N/A if (MARK <= SP) {
1N/A if (SvFLAGS(TOPs) & (SVs_PADTMP|SVs_TEMP))
1N/A *MARK = TOPs;
1N/A else
1N/A *MARK = sv_mortalcopy(TOPs);
1N/A }
1N/A else {
1N/A MEXTEND(mark,0);
1N/A *MARK = &PL_sv_undef;
1N/A }
1N/A SP = MARK;
1N/A }
1N/A else {
1N/A /* in case LEAVE wipes old return values */
1N/A for (mark = newsp + 1; mark <= SP; mark++) {
1N/A if (!(SvFLAGS(*mark) & (SVs_PADTMP|SVs_TEMP))) {
1N/A *mark = sv_mortalcopy(*mark);
1N/A TAINT_NOT; /* Each item is independent */
1N/A }
1N/A }
1N/A }
1N/A PL_curpm = newpm; /* Don't pop $1 et al till now */
1N/A
1N/A LEAVE;
1N/A sv_setpv(ERRSV,"");
1N/A RETURNOP(retop);
1N/A}
1N/A
1N/ASTATIC OP *
1N/AS_doparseform(pTHX_ SV *sv)
1N/A{
1N/A STRLEN len;
1N/A register char *s = SvPV_force(sv, len);
1N/A register char *send = s + len;
1N/A register char *base = Nullch;
1N/A register I32 skipspaces = 0;
1N/A bool noblank = FALSE;
1N/A bool repeat = FALSE;
1N/A bool postspace = FALSE;
1N/A U32 *fops;
1N/A register U32 *fpc;
1N/A U32 *linepc = 0;
1N/A register I32 arg;
1N/A bool ischop;
1N/A bool unchopnum = FALSE;
1N/A int maxops = 12; /* FF_LINEMARK + FF_END + 10 (\0 without preceding \n) */
1N/A
1N/A if (len == 0)
1N/A Perl_croak(aTHX_ "Null picture in formline");
1N/A
1N/A /* estimate the buffer size needed */
1N/A for (base = s; s <= send; s++) {
1N/A if (*s == '\n' || *s == '@' || *s == '^')
1N/A maxops += 10;
1N/A }
1N/A s = base;
1N/A base = Nullch;
1N/A
1N/A New(804, fops, maxops, U32);
1N/A fpc = fops;
1N/A
1N/A if (s < send) {
1N/A linepc = fpc;
1N/A *fpc++ = FF_LINEMARK;
1N/A noblank = repeat = FALSE;
1N/A base = s;
1N/A }
1N/A
1N/A while (s <= send) {
1N/A switch (*s++) {
1N/A default:
1N/A skipspaces = 0;
1N/A continue;
1N/A
1N/A case '~':
1N/A if (*s == '~') {
1N/A repeat = TRUE;
1N/A *s = ' ';
1N/A }
1N/A noblank = TRUE;
1N/A s[-1] = ' ';
1N/A /* FALL THROUGH */
1N/A case ' ': case '\t':
1N/A skipspaces++;
1N/A continue;
1N/A case 0:
1N/A if (s < send) {
1N/A skipspaces = 0;
1N/A continue;
1N/A } /* else FALL THROUGH */
1N/A case '\n':
1N/A arg = s - base;
1N/A skipspaces++;
1N/A arg -= skipspaces;
1N/A if (arg) {
1N/A if (postspace)
1N/A *fpc++ = FF_SPACE;
1N/A *fpc++ = FF_LITERAL;
1N/A *fpc++ = (U16)arg;
1N/A }
1N/A postspace = FALSE;
1N/A if (s <= send)
1N/A skipspaces--;
1N/A if (skipspaces) {
1N/A *fpc++ = FF_SKIP;
1N/A *fpc++ = (U16)skipspaces;
1N/A }
1N/A skipspaces = 0;
1N/A if (s <= send)
1N/A *fpc++ = FF_NEWLINE;
1N/A if (noblank) {
1N/A *fpc++ = FF_BLANK;
1N/A if (repeat)
1N/A arg = fpc - linepc + 1;
1N/A else
1N/A arg = 0;
1N/A *fpc++ = (U16)arg;
1N/A }
1N/A if (s < send) {
1N/A linepc = fpc;
1N/A *fpc++ = FF_LINEMARK;
1N/A noblank = repeat = FALSE;
1N/A base = s;
1N/A }
1N/A else
1N/A s++;
1N/A continue;
1N/A
1N/A case '@':
1N/A case '^':
1N/A ischop = s[-1] == '^';
1N/A
1N/A if (postspace) {
1N/A *fpc++ = FF_SPACE;
1N/A postspace = FALSE;
1N/A }
1N/A arg = (s - base) - 1;
1N/A if (arg) {
1N/A *fpc++ = FF_LITERAL;
1N/A *fpc++ = (U16)arg;
1N/A }
1N/A
1N/A base = s - 1;
1N/A *fpc++ = FF_FETCH;
1N/A if (*s == '*') {
1N/A s++;
1N/A *fpc++ = 2; /* skip the @* or ^* */
1N/A if (ischop) {
1N/A *fpc++ = FF_LINESNGL;
1N/A *fpc++ = FF_CHOP;
1N/A } else
1N/A *fpc++ = FF_LINEGLOB;
1N/A }
1N/A else if (*s == '#' || (*s == '.' && s[1] == '#')) {
1N/A arg = ischop ? 512 : 0;
1N/A base = s - 1;
1N/A while (*s == '#')
1N/A s++;
1N/A if (*s == '.') {
1N/A char *f;
1N/A s++;
1N/A f = s;
1N/A while (*s == '#')
1N/A s++;
1N/A arg |= 256 + (s - f);
1N/A }
1N/A *fpc++ = s - base; /* fieldsize for FETCH */
1N/A *fpc++ = FF_DECIMAL;
1N/A *fpc++ = (U16)arg;
1N/A unchopnum |= ! ischop;
1N/A }
1N/A else if (*s == '0' && s[1] == '#') { /* Zero padded decimals */
1N/A arg = ischop ? 512 : 0;
1N/A base = s - 1;
1N/A s++; /* skip the '0' first */
1N/A while (*s == '#')
1N/A s++;
1N/A if (*s == '.') {
1N/A char *f;
1N/A s++;
1N/A f = s;
1N/A while (*s == '#')
1N/A s++;
1N/A arg |= 256 + (s - f);
1N/A }
1N/A *fpc++ = s - base; /* fieldsize for FETCH */
1N/A *fpc++ = FF_0DECIMAL;
1N/A *fpc++ = (U16)arg;
1N/A unchopnum |= ! ischop;
1N/A }
1N/A else {
1N/A I32 prespace = 0;
1N/A bool ismore = FALSE;
1N/A
1N/A if (*s == '>') {
1N/A while (*++s == '>') ;
1N/A prespace = FF_SPACE;
1N/A }
1N/A else if (*s == '|') {
1N/A while (*++s == '|') ;
1N/A prespace = FF_HALFSPACE;
1N/A postspace = TRUE;
1N/A }
1N/A else {
1N/A if (*s == '<')
1N/A while (*++s == '<') ;
1N/A postspace = TRUE;
1N/A }
1N/A if (*s == '.' && s[1] == '.' && s[2] == '.') {
1N/A s += 3;
1N/A ismore = TRUE;
1N/A }
1N/A *fpc++ = s - base; /* fieldsize for FETCH */
1N/A
1N/A *fpc++ = ischop ? FF_CHECKCHOP : FF_CHECKNL;
1N/A
1N/A if (prespace)
1N/A *fpc++ = (U16)prespace;
1N/A *fpc++ = FF_ITEM;
1N/A if (ismore)
1N/A *fpc++ = FF_MORE;
1N/A if (ischop)
1N/A *fpc++ = FF_CHOP;
1N/A }
1N/A base = s;
1N/A skipspaces = 0;
1N/A continue;
1N/A }
1N/A }
1N/A *fpc++ = FF_END;
1N/A
1N/A assert (fpc <= fops + maxops); /* ensure our buffer estimate was valid */
1N/A arg = fpc - fops;
1N/A { /* need to jump to the next word */
1N/A int z;
1N/A z = WORD_ALIGN - SvCUR(sv) % WORD_ALIGN;
1N/A SvGROW(sv, SvCUR(sv) + z + arg * sizeof(U32) + 4);
1N/A s = SvPVX(sv) + SvCUR(sv) + z;
1N/A }
1N/A Copy(fops, s, arg, U32);
1N/A Safefree(fops);
1N/A sv_magic(sv, Nullsv, PERL_MAGIC_fm, Nullch, 0);
1N/A SvCOMPILED_on(sv);
1N/A
1N/A if (unchopnum && repeat)
1N/A DIE(aTHX_ "Repeated format line will never terminate (~~ and @#)");
1N/A return 0;
1N/A}
1N/A
1N/A
1N/ASTATIC bool
1N/AS_num_overflow(NV value, I32 fldsize, I32 frcsize)
1N/A{
1N/A /* Can value be printed in fldsize chars, using %*.*f ? */
1N/A NV pwr = 1;
1N/A NV eps = 0.5;
1N/A bool res = FALSE;
1N/A int intsize = fldsize - (value < 0 ? 1 : 0);
1N/A
1N/A if (frcsize & 256)
1N/A intsize--;
1N/A frcsize &= 255;
1N/A intsize -= frcsize;
1N/A
1N/A while (intsize--) pwr *= 10.0;
1N/A while (frcsize--) eps /= 10.0;
1N/A
1N/A if( value >= 0 ){
1N/A if (value + eps >= pwr)
1N/A res = TRUE;
1N/A } else {
1N/A if (value - eps <= -pwr)
1N/A res = TRUE;
1N/A }
1N/A return res;
1N/A}
1N/A
1N/Astatic I32
1N/Arun_user_filter(pTHX_ int idx, SV *buf_sv, int maxlen)
1N/A{
1N/A SV *datasv = FILTER_DATA(idx);
1N/A int filter_has_file = IoLINES(datasv);
1N/A GV *filter_child_proc = (GV *)IoFMT_GV(datasv);
1N/A SV *filter_state = (SV *)IoTOP_GV(datasv);
1N/A SV *filter_sub = (SV *)IoBOTTOM_GV(datasv);
1N/A int len = 0;
1N/A
1N/A /* I was having segfault trouble under Linux 2.2.5 after a
1N/A parse error occured. (Had to hack around it with a test
1N/A for PL_error_count == 0.) Solaris doesn't segfault --
1N/A not sure where the trouble is yet. XXX */
1N/A
1N/A if (filter_has_file) {
1N/A len = FILTER_READ(idx+1, buf_sv, maxlen);
1N/A }
1N/A
1N/A if (filter_sub && len >= 0) {
1N/A dSP;
1N/A int count;
1N/A
1N/A ENTER;
1N/A SAVE_DEFSV;
1N/A SAVETMPS;
1N/A EXTEND(SP, 2);
1N/A
1N/A DEFSV = buf_sv;
1N/A PUSHMARK(SP);
1N/A PUSHs(sv_2mortal(newSViv(maxlen)));
1N/A if (filter_state) {
1N/A PUSHs(filter_state);
1N/A }
1N/A PUTBACK;
1N/A count = call_sv(filter_sub, G_SCALAR);
1N/A SPAGAIN;
1N/A
1N/A if (count > 0) {
1N/A SV *out = POPs;
1N/A if (SvOK(out)) {
1N/A len = SvIV(out);
1N/A }
1N/A }
1N/A
1N/A PUTBACK;
1N/A FREETMPS;
1N/A LEAVE;
1N/A }
1N/A
1N/A if (len <= 0) {
1N/A IoLINES(datasv) = 0;
1N/A if (filter_child_proc) {
1N/A SvREFCNT_dec(filter_child_proc);
1N/A IoFMT_GV(datasv) = Nullgv;
1N/A }
1N/A if (filter_state) {
1N/A SvREFCNT_dec(filter_state);
1N/A IoTOP_GV(datasv) = Nullgv;
1N/A }
1N/A if (filter_sub) {
1N/A SvREFCNT_dec(filter_sub);
1N/A IoBOTTOM_GV(datasv) = Nullgv;
1N/A }
1N/A filter_del(run_user_filter);
1N/A }
1N/A
1N/A return len;
1N/A}
1N/A
1N/A/* perhaps someone can come up with a better name for
1N/A this? it is not really "absolute", per se ... */
1N/Astatic bool
1N/AS_path_is_absolute(pTHX_ char *name)
1N/A{
1N/A if (PERL_FILE_IS_ABSOLUTE(name)
1N/A#ifdef MACOS_TRADITIONAL
1N/A || (*name == ':'))
1N/A#else
1N/A || (*name == '.' && (name[1] == '/' ||
1N/A (name[1] == '.' && name[2] == '/'))))
1N/A#endif
1N/A {
1N/A return TRUE;
1N/A }
1N/A else
1N/A return FALSE;
1N/A}