[perl5.git] / cop.h

/*    cop.h
 *
 *    Copyright (c) 1991-2000, Larry Wall
 *
 *    You may distribute under the terms of either the GNU General Public
 *    License or the Artistic License, as specified in the README file.
 *
 */

struct cop {
    BASEOP
    char *	cop_label;	/* label for this construct */
#ifdef USE_ITHREADS
    char *	cop_stashpv;	/* package line was compiled in */
    char *	cop_file;	/* file name the following line # is from */
#else
    HV *	cop_stash;	/* package line was compiled in */
    GV *	cop_filegv;	/* file the following line # is from */
#endif
    U32		cop_seq;	/* parse sequence number */
    I32		cop_arybase;	/* array base this line was compiled with */
    line_t      cop_line;       /* line # of this command */
    SV *	cop_warnings;	/* lexical warnings bitmask */
};

#define Nullcop Null(COP*)

#ifdef USE_ITHREADS
#  define CopFILE(c)		((c)->cop_file)
#  define CopFILEGV(c)		(CopFILE(c) \
				 ? gv_fetchfile(CopFILE(c)) : Nullgv)
#  define CopFILE_set(c,pv)	((c)->cop_file = savepv(pv))
#  define CopFILESV(c)		(CopFILE(c) \
				 ? GvSV(gv_fetchfile(CopFILE(c))) : Nullsv)
#  define CopFILEAV(c)		(CopFILE(c) \
				 ? GvAV(gv_fetchfile(CopFILE(c))) : Nullav)
#  define CopSTASHPV(c)		((c)->cop_stashpv)
#  define CopSTASHPV_set(c,pv)	((c)->cop_stashpv = ((pv) ? savepv(pv) : Nullch))
#  define CopSTASH(c)		(CopSTASHPV(c) \
				 ? gv_stashpv(CopSTASHPV(c),GV_ADD) : Nullhv)
#  define CopSTASH_set(c,hv)	CopSTASHPV_set(c, (hv) ? HvNAME(hv) : Nullch)
#  define CopSTASH_eq(c,hv)	((hv) 					\
				 && (CopSTASHPV(c) == HvNAME(hv)	\
				     || (CopSTASHPV(c) && HvNAME(hv)	\
					 && strEQ(CopSTASHPV(c), HvNAME(hv)))))
#else
#  define CopFILEGV(c)		((c)->cop_filegv)
#  define CopFILEGV_set(c,gv)	((c)->cop_filegv = (GV*)SvREFCNT_inc(gv))
#  define CopFILE_set(c,pv)	CopFILEGV_set((c), gv_fetchfile(pv))
#  define CopFILESV(c)		(CopFILEGV(c) ? GvSV(CopFILEGV(c)) : Nullsv)
#  define CopFILEAV(c)		(CopFILEGV(c) ? GvAV(CopFILEGV(c)) : Nullav)
#  define CopFILE(c)		(CopFILESV(c) ? SvPVX(CopFILESV(c)) : Nullch)
#  define CopSTASH(c)		((c)->cop_stash)
#  define CopSTASH_set(c,hv)	((c)->cop_stash = (hv))
#  define CopSTASHPV(c)		(CopSTASH(c) ? HvNAME(CopSTASH(c)) : Nullch)
   /* cop_stash is not refcounted */
#  define CopSTASHPV_set(c,pv)	CopSTASH_set((c), gv_stashpv(pv,GV_ADD))
#  define CopSTASH_eq(c,hv)	(CopSTASH(c) == (hv))
#endif /* USE_ITHREADS */

#define CopSTASH_ne(c,hv)	(!CopSTASH_eq(c,hv))
#define CopLINE(c)		((c)->cop_line)
#define CopLINE_inc(c)		(++CopLINE(c))
#define CopLINE_dec(c)		(--CopLINE(c))
#define CopLINE_set(c,l)	(CopLINE(c) = (l))

/*
 * Here we have some enormously heavy (or at least ponderous) wizardry.
 */

/* subroutine context */
struct block_sub {
    CV *	cv;
    GV *	gv;
    GV *	dfoutgv;
#ifndef USE_THREADS
    AV *	savearray;
#endif /* USE_THREADS */
    AV *	argarray;
    U16		olddepth;
    U8		hasargs;
    U8		lval;		/* XXX merge lval and hasargs? */
    SV **	oldcurpad;
};

#define PUSHSUB(cx)							\
	cx->blk_sub.cv = cv;						\
	cx->blk_sub.olddepth = CvDEPTH(cv);				\
	cx->blk_sub.hasargs = hasargs;					\
	cx->blk_sub.lval = PL_op->op_private &                          \
	                      (OPpLVAL_INTRO|OPpENTERSUB_INARGS);

#define PUSHFORMAT(cx)							\
	cx->blk_sub.cv = cv;						\
	cx->blk_sub.gv = gv;						\
	cx->blk_sub.hasargs = 0;					\
	cx->blk_sub.dfoutgv = PL_defoutgv;				\
	(void)SvREFCNT_inc(cx->blk_sub.dfoutgv)

#ifdef USE_THREADS
#  define POP_SAVEARRAY() NOOP
#else
#  define POP_SAVEARRAY()						\
    STMT_START {							\
	SvREFCNT_dec(GvAV(PL_defgv));					\
	GvAV(PL_defgv) = cx->blk_sub.savearray;				\
    } STMT_END
#endif /* USE_THREADS */

/* junk in @_ spells trouble when cloning CVs and in pp_caller(), so don't
 * leave any (a fast av_clear(ary), basically) */
#define CLEAR_ARGARRAY(ary) \
    STMT_START {							\
	AvMAX(ary) += AvARRAY(ary) - AvALLOC(ary);			\
	SvPVX(ary) = (char*)AvALLOC(ary);				\
	AvFILLp(ary) = -1;						\
    } STMT_END

#define POPSUB(cx,sv)							\
    STMT_START {							\
	if (cx->blk_sub.hasargs) {					\
	    POP_SAVEARRAY();						\
	    /* abandon @_ if it got reified */				\
	    if (AvREAL(cx->blk_sub.argarray)) {				\
		SSize_t fill = AvFILLp(cx->blk_sub.argarray);		\
		SvREFCNT_dec(cx->blk_sub.argarray);			\
		cx->blk_sub.argarray = newAV();				\
		av_extend(cx->blk_sub.argarray, fill);			\
		AvFLAGS(cx->blk_sub.argarray) = AVf_REIFY;		\
		cx->blk_sub.oldcurpad[0] = (SV*)cx->blk_sub.argarray;	\
	    }								\
	    else {							\
		CLEAR_ARGARRAY(cx->blk_sub.argarray);			\
	    }								\
	}								\
	sv = (SV*)cx->blk_sub.cv;					\
	if (sv && (CvDEPTH((CV*)sv) = cx->blk_sub.olddepth))		\
	    sv = Nullsv;						\
    } STMT_END

#define LEAVESUB(sv)							\
    STMT_START {							\
	if (sv)								\
	    SvREFCNT_dec(sv);						\
    } STMT_END

#define POPFORMAT(cx)							\
	setdefout(cx->blk_sub.dfoutgv);					\
	SvREFCNT_dec(cx->blk_sub.dfoutgv);

/* eval context */
struct block_eval {
    I32		old_in_eval;
    I32		old_op_type;
    SV *	old_namesv;
    OP *	old_eval_root;
    SV *	cur_text;
};

#define PUSHEVAL(cx,n,fgv)						\
    STMT_START {							\
	cx->blk_eval.old_in_eval = PL_in_eval;				\
	cx->blk_eval.old_op_type = PL_op->op_type;			\
	cx->blk_eval.old_namesv = (n ? newSVpv(n,0) : Nullsv);		\
	cx->blk_eval.old_eval_root = PL_eval_root;			\
	cx->blk_eval.cur_text = PL_linestr;				\
    } STMT_END

#define POPEVAL(cx)							\
    STMT_START {							\
	PL_in_eval = cx->blk_eval.old_in_eval;				\
	optype = cx->blk_eval.old_op_type;				\
	PL_eval_root = cx->blk_eval.old_eval_root;			\
	if (cx->blk_eval.old_namesv)					\
	    sv_2mortal(cx->blk_eval.old_namesv);			\
    } STMT_END

/* loop context */
struct block_loop {
    char *	label;
    I32		resetsp;
    OP *	redo_op;
    OP *	next_op;
    OP *	last_op;
#ifdef USE_ITHREADS
    void *	iterdata;
    SV **	oldcurpad;
#else
    SV **	itervar;
#endif
    SV *	itersave;
    SV *	iterlval;
    AV *	iterary;
    IV		iterix;
    IV		itermax;
};

#ifdef USE_ITHREADS
#  define CxITERVAR(c)							\
	((c)->blk_loop.iterdata						\
	 ? (CxPADLOOP(cx) 						\
	    ? &((c)->blk_loop.oldcurpad)[(PADOFFSET)(c)->blk_loop.iterdata]	\
	    : &GvSV((GV*)(c)->blk_loop.iterdata))			\
	 : (SV**)NULL)
#  define CX_ITERDATA_SET(cx,idata)					\
	cx->blk_loop.oldcurpad = PL_curpad;				\
	if ((cx->blk_loop.iterdata = (idata)))				\
	    cx->blk_loop.itersave = SvREFCNT_inc(*CxITERVAR(cx));
#else
#  define CxITERVAR(c)		((c)->blk_loop.itervar)
#  define CX_ITERDATA_SET(cx,ivar)					\
	if ((cx->blk_loop.itervar = (SV**)(ivar)))			\
	    cx->blk_loop.itersave = SvREFCNT_inc(*CxITERVAR(cx));
#endif

#define PUSHLOOP(cx, dat, s)						\
	cx->blk_loop.label = PL_curcop->cop_label;			\
	cx->blk_loop.resetsp = s - PL_stack_base;			\
	cx->blk_loop.redo_op = cLOOP->op_redoop;			\
	cx->blk_loop.next_op = cLOOP->op_nextop;			\
	cx->blk_loop.last_op = cLOOP->op_lastop;			\
	cx->blk_loop.iterlval = Nullsv;					\
	cx->blk_loop.iterary = Nullav;					\
	cx->blk_loop.iterix = -1;					\
	CX_ITERDATA_SET(cx,dat);

#define POPLOOP(cx)							\
	SvREFCNT_dec(cx->blk_loop.iterlval);				\
	if (CxITERVAR(cx)) {						\
	    SV **s_v_p = CxITERVAR(cx);					\
	    sv_2mortal(*s_v_p);						\
	    *s_v_p = cx->blk_loop.itersave;				\
	}								\
	if (cx->blk_loop.iterary && cx->blk_loop.iterary != PL_curstack)\
	    SvREFCNT_dec(cx->blk_loop.iterary);

/* context common to subroutines, evals and loops */
struct block {
    I32		blku_oldsp;	/* stack pointer to copy stuff down to */
    COP *	blku_oldcop;	/* old curcop pointer */
    I32		blku_oldretsp;	/* return stack index */
    I32		blku_oldmarksp;	/* mark stack index */
    I32		blku_oldscopesp;	/* scope stack index */
    PMOP *	blku_oldpm;	/* values of pattern match vars */
    U8		blku_gimme;	/* is this block running in list context? */

    union {
	struct block_sub	blku_sub;
	struct block_eval	blku_eval;
	struct block_loop	blku_loop;
    } blk_u;
};
#define blk_oldsp	cx_u.cx_blk.blku_oldsp
#define blk_oldcop	cx_u.cx_blk.blku_oldcop
#define blk_oldretsp	cx_u.cx_blk.blku_oldretsp
#define blk_oldmarksp	cx_u.cx_blk.blku_oldmarksp
#define blk_oldscopesp	cx_u.cx_blk.blku_oldscopesp
#define blk_oldpm	cx_u.cx_blk.blku_oldpm
#define blk_gimme	cx_u.cx_blk.blku_gimme
#define blk_sub		cx_u.cx_blk.blk_u.blku_sub
#define blk_eval	cx_u.cx_blk.blk_u.blku_eval
#define blk_loop	cx_u.cx_blk.blk_u.blku_loop

/* Enter a block. */
#define PUSHBLOCK(cx,t,sp) CXINC, cx = &cxstack[cxstack_ix],		\
	cx->cx_type		= t,					\
	cx->blk_oldsp		= sp - PL_stack_base,			\
	cx->blk_oldcop		= PL_curcop,				\
	cx->blk_oldmarksp	= PL_markstack_ptr - PL_markstack,	\
	cx->blk_oldscopesp	= PL_scopestack_ix,			\
	cx->blk_oldretsp	= PL_retstack_ix,			\
	cx->blk_oldpm		= PL_curpm,				\
	cx->blk_gimme		= gimme;				\
	DEBUG_l( PerlIO_printf(Perl_debug_log, "Entering block %ld, type %s\n",	\
		    (long)cxstack_ix, PL_block_type[CxTYPE(cx)]); )

/* Exit a block (RETURN and LAST). */
#define POPBLOCK(cx,pm) cx = &cxstack[cxstack_ix--],			\
	newsp		 = PL_stack_base + cx->blk_oldsp,		\
	PL_curcop	 = cx->blk_oldcop,				\
	PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp,		\
	PL_scopestack_ix = cx->blk_oldscopesp,				\
	PL_retstack_ix	 = cx->blk_oldretsp,				\
	pm		 = cx->blk_oldpm,				\
	gimme		 = cx->blk_gimme;				\
	DEBUG_l( PerlIO_printf(Perl_debug_log, "Leaving block %ld, type %s\n",		\
		    (long)cxstack_ix+1,PL_block_type[CxTYPE(cx)]); )

/* Continue a block elsewhere (NEXT and REDO). */
#define TOPBLOCK(cx) cx  = &cxstack[cxstack_ix],			\
	PL_stack_sp	 = PL_stack_base + cx->blk_oldsp,		\
	PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp,		\
	PL_scopestack_ix = cx->blk_oldscopesp,				\
	PL_retstack_ix	 = cx->blk_oldretsp,				\
	PL_curpm         = cx->blk_oldpm

/* substitution context */
struct subst {
    I32		sbu_iters;
    I32		sbu_maxiters;
    I32		sbu_rflags;
    I32		sbu_oldsave;
    bool	sbu_once;
    bool	sbu_rxtainted;
    char *	sbu_orig;
    SV *	sbu_dstr;
    SV *	sbu_targ;
    char *	sbu_s;
    char *	sbu_m;
    char *	sbu_strend;
    void *	sbu_rxres;
    REGEXP *	sbu_rx;
};
#define sb_iters	cx_u.cx_subst.sbu_iters
#define sb_maxiters	cx_u.cx_subst.sbu_maxiters
#define sb_rflags	cx_u.cx_subst.sbu_rflags
#define sb_oldsave	cx_u.cx_subst.sbu_oldsave
#define sb_once		cx_u.cx_subst.sbu_once
#define sb_rxtainted	cx_u.cx_subst.sbu_rxtainted
#define sb_orig		cx_u.cx_subst.sbu_orig
#define sb_dstr		cx_u.cx_subst.sbu_dstr
#define sb_targ		cx_u.cx_subst.sbu_targ
#define sb_s		cx_u.cx_subst.sbu_s
#define sb_m		cx_u.cx_subst.sbu_m
#define sb_strend	cx_u.cx_subst.sbu_strend
#define sb_rxres	cx_u.cx_subst.sbu_rxres
#define sb_rx		cx_u.cx_subst.sbu_rx

#define PUSHSUBST(cx) CXINC, cx = &cxstack[cxstack_ix],			\
	cx->sb_iters		= iters,				\
	cx->sb_maxiters		= maxiters,				\
	cx->sb_rflags		= r_flags,				\
	cx->sb_oldsave		= oldsave,				\
	cx->sb_once		= once,					\
	cx->sb_rxtainted	= rxtainted,				\
	cx->sb_orig		= orig,					\
	cx->sb_dstr		= dstr,					\
	cx->sb_targ		= targ,					\
	cx->sb_s		= s,					\
	cx->sb_m		= m,					\
	cx->sb_strend		= strend,				\
	cx->sb_rxres		= Null(void*),				\
	cx->sb_rx		= rx,					\
	cx->cx_type		= CXt_SUBST;				\
	rxres_save(&cx->sb_rxres, rx)

#define POPSUBST(cx) cx = &cxstack[cxstack_ix--];			\
	rxres_free(&cx->sb_rxres)

struct context {
    U32		cx_type;	/* what kind of context this is */
    union {
	struct block	cx_blk;
	struct subst	cx_subst;
    } cx_u;
};

#define CXTYPEMASK	0xff
#define CXt_NULL	0
#define CXt_SUB		1
#define CXt_EVAL	2
#define CXt_LOOP	3
#define CXt_SUBST	4
#define CXt_BLOCK	5
#define CXt_FORMAT	6

/* private flags for CXt_EVAL */
#define CXp_REAL	0x00000100	/* truly eval'', not a lookalike */
#define CXp_TRYBLOCK	0x00000200	/* eval{}, not eval'' or similar */

#ifdef USE_ITHREADS
/* private flags for CXt_LOOP */
#  define CXp_PADVAR	0x00000100	/* itervar lives on pad, iterdata
					   has pad offset; if not set,
					   iterdata holds GV* */
#  define CxPADLOOP(c)	(((c)->cx_type & (CXt_LOOP|CXp_PADVAR))		\
			 == (CXt_LOOP|CXp_PADVAR))
#endif

#define CxTYPE(c)	((c)->cx_type & CXTYPEMASK)
#define CxREALEVAL(c)	(((c)->cx_type & (CXt_EVAL|CXp_REAL))		\
			 == (CXt_EVAL|CXp_REAL))
#define CxTRYBLOCK(c)	(((c)->cx_type & (CXt_EVAL|CXp_TRYBLOCK))	\
			 == (CXt_EVAL|CXp_TRYBLOCK))

#define CXINC (cxstack_ix < cxstack_max ? ++cxstack_ix : (cxstack_ix = cxinc()))

/* "gimme" values */

/*
=for apidoc AmU||G_SCALAR
Used to indicate scalar context.  See C<GIMME_V>, C<GIMME>, and
L<perlcall>.

=for apidoc AmU||G_ARRAY
Used to indicate list context.  See C<GIMME_V>, C<GIMME> and
L<perlcall>.

=for apidoc AmU||G_VOID
Used to indicate void context.  See C<GIMME_V> and L<perlcall>.

=for apidoc AmU||G_DISCARD
Indicates that arguments returned from a callback should be discarded.  See
L<perlcall>.

=for apidoc AmU||G_EVAL

Used to force a Perl C<eval> wrapper around a callback.  See
L<perlcall>.

=for apidoc AmU||G_NOARGS

Indicates that no arguments are being sent to a callback.  See
L<perlcall>.

=cut
*/

#define G_SCALAR	0
#define G_ARRAY		1
#define G_VOID		128	/* skip this bit when adding flags below */

/* extra flags for Perl_call_* routines */
#define G_DISCARD	2	/* Call FREETMPS. */
#define G_EVAL		4	/* Assume eval {} around subroutine call. */
#define G_NOARGS	8	/* Don't construct a @_ array. */
#define G_KEEPERR      16	/* Append errors to $@, don't overwrite it */
#define G_NODEBUG      32	/* Disable debugging at toplevel.  */
#define G_METHOD       64       /* Calling method. */

/* flag bits for PL_in_eval */
#define EVAL_NULL	0	/* not in an eval */
#define EVAL_INEVAL	1	/* some enclosing scope is an eval */
#define EVAL_WARNONLY	2	/* used by yywarn() when calling yyerror() */
#define EVAL_KEEPERR	4	/* set by Perl_call_sv if G_KEEPERR */

/* Support for switching (stack and block) contexts.
 * This ensures magic doesn't invalidate local stack and cx pointers.
 */

#define PERLSI_UNKNOWN		-1
#define PERLSI_UNDEF		0
#define PERLSI_MAIN		1
#define PERLSI_MAGIC		2
#define PERLSI_SORT		3
#define PERLSI_SIGNAL		4
#define PERLSI_OVERLOAD		5
#define PERLSI_DESTROY		6
#define PERLSI_WARNHOOK		7
#define PERLSI_DIEHOOK		8
#define PERLSI_REQUIRE		9

struct stackinfo {
    AV *		si_stack;	/* stack for current runlevel */
    PERL_CONTEXT *	si_cxstack;	/* context stack for runlevel */
    I32			si_cxix;	/* current context index */
    I32			si_cxmax;	/* maximum allocated index */
    I32			si_type;	/* type of runlevel */
    struct stackinfo *	si_prev;
    struct stackinfo *	si_next;
    I32			si_markoff;	/* offset where markstack begins for us.
					 * currently used only with DEBUGGING,
					 * but not #ifdef-ed for bincompat */
};

typedef struct stackinfo PERL_SI;

#define cxstack		(PL_curstackinfo->si_cxstack)
#define cxstack_ix	(PL_curstackinfo->si_cxix)
#define cxstack_max	(PL_curstackinfo->si_cxmax)

#ifdef DEBUGGING
#  define	SET_MARK_OFFSET \
    PL_curstackinfo->si_markoff = PL_markstack_ptr - PL_markstack
#else
#  define	SET_MARK_OFFSET NOOP
#endif

#define PUSHSTACKi(type) \
    STMT_START {							\
	PERL_SI *next = PL_curstackinfo->si_next;			\
	if (!next) {							\
	    next = new_stackinfo(32, 2048/sizeof(PERL_CONTEXT) - 1);	\
	    next->si_prev = PL_curstackinfo;				\
	    PL_curstackinfo->si_next = next;				\
	}								\
	next->si_type = type;						\
	next->si_cxix = -1;						\
	AvFILLp(next->si_stack) = 0;					\
	SWITCHSTACK(PL_curstack,next->si_stack);			\
	PL_curstackinfo = next;						\
	SET_MARK_OFFSET;						\
    } STMT_END

#define PUSHSTACK PUSHSTACKi(PERLSI_UNKNOWN)

/* POPSTACK works with PL_stack_sp, so it may need to be bracketed by
 * PUTBACK/SPAGAIN to flush/refresh any local SP that may be active */
#define POPSTACK \
    STMT_START {							\
	djSP;								\
	PERL_SI *prev = PL_curstackinfo->si_prev;			\
	if (!prev) {							\
	    PerlIO_printf(Perl_error_log, "panic: POPSTACK\n");		\
	    my_exit(1);							\
	}								\
	SWITCHSTACK(PL_curstack,prev->si_stack);			\
	/* don't free prev here, free them all at the END{} */		\
	PL_curstackinfo = prev;						\
    } STMT_END

#define POPSTACK_TO(s) \
    STMT_START {							\
	while (PL_curstack != s) {					\
	    dounwind(-1);						\
	    POPSTACK;							\
	}								\
    } STMT_END
Commit	Line	Data
a0d0e21e	1	/* cop.h
79072805	2	*
3818b22b	3	* Copyright (c) 1991-2000, Larry Wall
79072805 LW	4	*
	5	* You may distribute under the terms of either the GNU General Public
	6	* License or the Artistic License, as specified in the README file.
	7	*
79072805 LW	8	*/
79072805 LW	9
79072805 LW	10	struct cop {
79072805 LW	11	BASEOP
a0d0e21e	12	char * cop_label; /* label for this construct */
57843af0	13	#ifdef USE_ITHREADS
11faa288	14	char * cop_stashpv; /* package line was compiled in */
57843af0 GS	15	char * cop_file; /* file name the following line # is from */
57843af0 GS	16	#else
11faa288	17	HV * cop_stash; /* package line was compiled in */
79072805	18	GV * cop_filegv; /* file the following line # is from */
57843af0	19	#endif
a0d0e21e LW	20	U32 cop_seq; /* parse sequence number */
a0d0e21e LW	21	I32 cop_arybase; /* array base this line was compiled with */
79072805	22	line_t cop_line; /* line # of this command */
599cee73	23	SV * cop_warnings; /* lexical warnings bitmask */
79072805 LW	24	};
	25
	26	#define Nullcop Null(COP*)
	27
57843af0 GS	28	#ifdef USE_ITHREADS
	29	# define CopFILE(c) ((c)->cop_file)
	30	# define CopFILEGV(c) (CopFILE(c) \
	31	? gv_fetchfile(CopFILE(c)) : Nullgv)
f4dd75d9	32	# define CopFILE_set(c,pv) ((c)->cop_file = savepv(pv))
57843af0 GS	33	# define CopFILESV(c) (CopFILE(c) \
	34	? GvSV(gv_fetchfile(CopFILE(c))) : Nullsv)
	35	# define CopFILEAV(c) (CopFILE(c) \
	36	? GvAV(gv_fetchfile(CopFILE(c))) : Nullav)
57843af0	37	# define CopSTASHPV(c) ((c)->cop_stashpv)
7b910cb8	38	# define CopSTASHPV_set(c,pv) ((c)->cop_stashpv = ((pv) ? savepv(pv) : Nullch))
11faa288 GS	39	# define CopSTASH(c) (CopSTASHPV(c) \
11faa288 GS	40	? gv_stashpv(CopSTASHPV(c),GV_ADD) : Nullhv)
7b910cb8	41	# define CopSTASH_set(c,hv) CopSTASHPV_set(c, (hv) ? HvNAME(hv) : Nullch)
f4dd75d9	42	# define CopSTASH_eq(c,hv) ((hv) \
ed094faf GS	43	&& (CopSTASHPV(c) == HvNAME(hv) \
	44	\|\| (CopSTASHPV(c) && HvNAME(hv) \
	45	&& strEQ(CopSTASHPV(c), HvNAME(hv)))))
57843af0 GS	46	#else
57843af0 GS	47	# define CopFILEGV(c) ((c)->cop_filegv)
f4dd75d9 GS	48	# define CopFILEGV_set(c,gv) ((c)->cop_filegv = (GV*)SvREFCNT_inc(gv))
f4dd75d9 GS	49	# define CopFILE_set(c,pv) CopFILEGV_set((c), gv_fetchfile(pv))
57843af0 GS	50	# define CopFILESV(c) (CopFILEGV(c) ? GvSV(CopFILEGV(c)) : Nullsv)
	51	# define CopFILEAV(c) (CopFILEGV(c) ? GvAV(CopFILEGV(c)) : Nullav)
	52	# define CopFILE(c) (CopFILESV(c) ? SvPVX(CopFILESV(c)) : Nullch)
	53	# define CopSTASH(c) ((c)->cop_stash)
f4dd75d9	54	# define CopSTASH_set(c,hv) ((c)->cop_stash = (hv))
57843af0	55	# define CopSTASHPV(c) (CopSTASH(c) ? HvNAME(CopSTASH(c)) : Nullch)
f4dd75d9 GS	56	/* cop_stash is not refcounted */
	57	# define CopSTASHPV_set(c,pv) CopSTASH_set((c), gv_stashpv(pv,GV_ADD))
	58	# define CopSTASH_eq(c,hv) (CopSTASH(c) == (hv))
57843af0 GS	59	#endif /* USE_ITHREADS */
57843af0 GS	60
ed094faf	61	#define CopSTASH_ne(c,hv) (!CopSTASH_eq(c,hv))
cc49e20b	62	#define CopLINE(c) ((c)->cop_line)
57843af0 GS	63	#define CopLINE_inc(c) (++CopLINE(c))
	64	#define CopLINE_dec(c) (--CopLINE(c))
	65	#define CopLINE_set(c,l) (CopLINE(c) = (l))
cc49e20b	66
79072805 LW	67	/*
	68	* Here we have some enormously heavy (or at least ponderous) wizardry.
	69	*/
	70
	71	/* subroutine context */
	72	struct block_sub {
	73	CV * cv;
	74	GV * gv;
463ee0b2	75	GV * dfoutgv;
6d4ff0d2	76	#ifndef USE_THREADS
79072805	77	AV * savearray;
6d4ff0d2	78	#endif /* USE_THREADS */
79072805 LW	79	AV * argarray;
	80	U16 olddepth;
	81	U8 hasargs;
cd06dffe	82	U8 lval; /* XXX merge lval and hasargs? */
7032098e	83	SV ** oldcurpad;
79072805 LW	84	};
	85
	86	#define PUSHSUB(cx) \
	87	cx->blk_sub.cv = cv; \
79072805	88	cx->blk_sub.olddepth = CvDEPTH(cv); \
cd06dffe GS	89	cx->blk_sub.hasargs = hasargs; \
	90	cx->blk_sub.lval = PL_op->op_private & \
	91	(OPpLVAL_INTRO\|OPpENTERSUB_INARGS);
79072805 LW	92
	93	#define PUSHFORMAT(cx) \
	94	cx->blk_sub.cv = cv; \
	95	cx->blk_sub.gv = gv; \
4633a7c4	96	cx->blk_sub.hasargs = 0; \
3280af22	97	cx->blk_sub.dfoutgv = PL_defoutgv; \
4633a7c4	98	(void)SvREFCNT_inc(cx->blk_sub.dfoutgv)
79072805	99
6d4ff0d2	100	#ifdef USE_THREADS
7766f137	101	# define POP_SAVEARRAY() NOOP
6d4ff0d2	102	#else
7766f137	103	# define POP_SAVEARRAY() \
6d4ff0d2	104	STMT_START { \
3280af22	105	SvREFCNT_dec(GvAV(PL_defgv)); \
a8bba7fa	106	GvAV(PL_defgv) = cx->blk_sub.savearray; \
6d4ff0d2 MB	107	} STMT_END
	108	#endif /* USE_THREADS */
	109
ecf8e9dd	110	/* junk in @_ spells trouble when cloning CVs and in pp_caller(), so don't
8e09340b GS	111	* leave any (a fast av_clear(ary), basically) */
	112	#define CLEAR_ARGARRAY(ary) \
	113	STMT_START { \
	114	AvMAX(ary) += AvARRAY(ary) - AvALLOC(ary); \
	115	SvPVX(ary) = (char*)AvALLOC(ary); \
	116	AvFILLp(ary) = -1; \
	117	} STMT_END
7766f137	118
b0d9ce38 GS	119	#define POPSUB(cx,sv) \
b0d9ce38 GS	120	STMT_START { \
a8bba7fa	121	if (cx->blk_sub.hasargs) { \
7766f137	122	POP_SAVEARRAY(); \
d8b46c1b	123	/* abandon @_ if it got reified */ \
a8bba7fa GS	124	if (AvREAL(cx->blk_sub.argarray)) { \
	125	SSize_t fill = AvFILLp(cx->blk_sub.argarray); \
	126	SvREFCNT_dec(cx->blk_sub.argarray); \
	127	cx->blk_sub.argarray = newAV(); \
	128	av_extend(cx->blk_sub.argarray, fill); \
	129	AvFLAGS(cx->blk_sub.argarray) = AVf_REIFY; \
7032098e	130	cx->blk_sub.oldcurpad[0] = (SV*)cx->blk_sub.argarray; \
d8b46c1b	131	} \
7766f137	132	else { \
8e09340b	133	CLEAR_ARGARRAY(cx->blk_sub.argarray); \
7766f137	134	} \
79072805	135	} \
b0d9ce38 GS	136	sv = (SV*)cx->blk_sub.cv; \
	137	if (sv && (CvDEPTH((CV*)sv) = cx->blk_sub.olddepth)) \
	138	sv = Nullsv; \
	139	} STMT_END
	140
	141	#define LEAVESUB(sv) \
	142	STMT_START { \
	143	if (sv) \
	144	SvREFCNT_dec(sv); \
	145	} STMT_END
79072805 LW	146
79072805 LW	147	#define POPFORMAT(cx) \
4633a7c4 LW	148	setdefout(cx->blk_sub.dfoutgv); \
4633a7c4 LW	149	SvREFCNT_dec(cx->blk_sub.dfoutgv);
79072805 LW	150
	151	/* eval context */
	152	struct block_eval {
	153	I32 old_in_eval;
	154	I32 old_op_type;
0f79a09d	155	SV * old_namesv;
79072805	156	OP * old_eval_root;
748a9306	157	SV * cur_text;
79072805 LW	158	};
79072805 LW	159
8990e307	160	#define PUSHEVAL(cx,n,fgv) \
0f79a09d	161	STMT_START { \
3280af22	162	cx->blk_eval.old_in_eval = PL_in_eval; \
a8bba7fa	163	cx->blk_eval.old_op_type = PL_op->op_type; \
0f79a09d	164	cx->blk_eval.old_namesv = (n ? newSVpv(n,0) : Nullsv); \
a8bba7fa	165	cx->blk_eval.old_eval_root = PL_eval_root; \
0f79a09d GS	166	cx->blk_eval.cur_text = PL_linestr; \
0f79a09d GS	167	} STMT_END
79072805 LW	168
79072805 LW	169	#define POPEVAL(cx) \
0f79a09d	170	STMT_START { \
3280af22	171	PL_in_eval = cx->blk_eval.old_in_eval; \
79072805	172	optype = cx->blk_eval.old_op_type; \
7766f137	173	PL_eval_root = cx->blk_eval.old_eval_root; \
0f79a09d GS	174	if (cx->blk_eval.old_namesv) \
	175	sv_2mortal(cx->blk_eval.old_namesv); \
	176	} STMT_END
79072805 LW	177
	178	/* loop context */
	179	struct block_loop {
	180	char * label;
	181	I32 resetsp;
	182	OP * redo_op;
	183	OP * next_op;
	184	OP * last_op;
7766f137 GS	185	#ifdef USE_ITHREADS
7766f137 GS	186	void * iterdata;
9e509370	187	SV ** oldcurpad;
7766f137	188	#else
79072805	189	SV ** itervar;
7766f137	190	#endif
79072805	191	SV * itersave;
5f05dabc	192	SV * iterlval;
79072805	193	AV * iterary;
89ea2908 GA	194	IV iterix;
89ea2908 GA	195	IV itermax;
79072805 LW	196	};
79072805 LW	197
7766f137 GS	198	#ifdef USE_ITHREADS
	199	# define CxITERVAR(c) \
	200	((c)->blk_loop.iterdata \
	201	? (CxPADLOOP(cx) \
9e509370	202	? &((c)->blk_loop.oldcurpad)[(PADOFFSET)(c)->blk_loop.iterdata] \
7766f137 GS	203	: &GvSV((GV*)(c)->blk_loop.iterdata)) \
	204	: (SV**)NULL)
	205	# define CX_ITERDATA_SET(cx,idata) \
9e509370	206	cx->blk_loop.oldcurpad = PL_curpad; \
155aba94	207	if ((cx->blk_loop.iterdata = (idata))) \
7766f137 GS	208	cx->blk_loop.itersave = SvREFCNT_inc(*CxITERVAR(cx));
	209	#else
	210	# define CxITERVAR(c) ((c)->blk_loop.itervar)
	211	# define CX_ITERDATA_SET(cx,ivar) \
155aba94	212	if ((cx->blk_loop.itervar = (SV**)(ivar))) \
7766f137 GS	213	cx->blk_loop.itersave = SvREFCNT_inc(*CxITERVAR(cx));
	214	#endif
	215
	216	#define PUSHLOOP(cx, dat, s) \
38a230cb GS	217	cx->blk_loop.label = PL_curcop->cop_label; \
38a230cb GS	218	cx->blk_loop.resetsp = s - PL_stack_base; \
79072805 LW	219	cx->blk_loop.redo_op = cLOOP->op_redoop; \
	220	cx->blk_loop.next_op = cLOOP->op_nextop; \
	221	cx->blk_loop.last_op = cLOOP->op_lastop; \
44a8e56a	222	cx->blk_loop.iterlval = Nullsv; \
44a8e56a	223	cx->blk_loop.iterary = Nullav; \
7766f137 GS	224	cx->blk_loop.iterix = -1; \
7766f137 GS	225	CX_ITERDATA_SET(cx,dat);
79072805 LW	226
79072805 LW	227	#define POPLOOP(cx) \
a8bba7fa	228	SvREFCNT_dec(cx->blk_loop.iterlval); \
7766f137 GS	229	if (CxITERVAR(cx)) { \
	230	SV **s_v_p = CxITERVAR(cx); \
	231	sv_2mortal(*s_v_p); \
	232	*s_v_p = cx->blk_loop.itersave; \
44a8e56a	233	} \
a8bba7fa GS	234	if (cx->blk_loop.iterary && cx->blk_loop.iterary != PL_curstack)\
a8bba7fa GS	235	SvREFCNT_dec(cx->blk_loop.iterary);
79072805 LW	236
	237	/* context common to subroutines, evals and loops */
	238	struct block {
	239	I32 blku_oldsp; /* stack pointer to copy stuff down to */
	240	COP * blku_oldcop; /* old curcop pointer */
	241	I32 blku_oldretsp; /* return stack index */
	242	I32 blku_oldmarksp; /* mark stack index */
	243	I32 blku_oldscopesp; /* scope stack index */
	244	PMOP * blku_oldpm; /* values of pattern match vars */
	245	U8 blku_gimme; /* is this block running in list context? */
	246
	247	union {
	248	struct block_sub blku_sub;
	249	struct block_eval blku_eval;
	250	struct block_loop blku_loop;
	251	} blk_u;
	252	};
	253	#define blk_oldsp cx_u.cx_blk.blku_oldsp
	254	#define blk_oldcop cx_u.cx_blk.blku_oldcop
	255	#define blk_oldretsp cx_u.cx_blk.blku_oldretsp
	256	#define blk_oldmarksp cx_u.cx_blk.blku_oldmarksp
	257	#define blk_oldscopesp cx_u.cx_blk.blku_oldscopesp
	258	#define blk_oldpm cx_u.cx_blk.blku_oldpm
	259	#define blk_gimme cx_u.cx_blk.blku_gimme
	260	#define blk_sub cx_u.cx_blk.blk_u.blku_sub
	261	#define blk_eval cx_u.cx_blk.blk_u.blku_eval
	262	#define blk_loop cx_u.cx_blk.blk_u.blku_loop
	263
	264	/* Enter a block. */
8990e307	265	#define PUSHBLOCK(cx,t,sp) CXINC, cx = &cxstack[cxstack_ix], \
79072805	266	cx->cx_type = t, \
3280af22 NIS	267	cx->blk_oldsp = sp - PL_stack_base, \
3280af22 NIS	268	cx->blk_oldcop = PL_curcop, \
1aff0e91	269	cx->blk_oldmarksp = PL_markstack_ptr - PL_markstack, \
3280af22	270	cx->blk_oldscopesp = PL_scopestack_ix, \
1aff0e91	271	cx->blk_oldretsp = PL_retstack_ix, \
3280af22	272	cx->blk_oldpm = PL_curpm, \
79072805	273	cx->blk_gimme = gimme; \
bf49b057	274	DEBUG_l( PerlIO_printf(Perl_debug_log, "Entering block %ld, type %s\n", \
1aff0e91	275	(long)cxstack_ix, PL_block_type[CxTYPE(cx)]); )
79072805 LW	276
79072805 LW	277	/* Exit a block (RETURN and LAST). */
a0d0e21e	278	#define POPBLOCK(cx,pm) cx = &cxstack[cxstack_ix--], \
1aff0e91	279	newsp = PL_stack_base + cx->blk_oldsp, \
3280af22 NIS	280	PL_curcop = cx->blk_oldcop, \
	281	PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
	282	PL_scopestack_ix = cx->blk_oldscopesp, \
	283	PL_retstack_ix = cx->blk_oldretsp, \
	284	pm = cx->blk_oldpm, \
	285	gimme = cx->blk_gimme; \
bf49b057	286	DEBUG_l( PerlIO_printf(Perl_debug_log, "Leaving block %ld, type %s\n", \
22c35a8c	287	(long)cxstack_ix+1,PL_block_type[CxTYPE(cx)]); )
79072805 LW	288
79072805 LW	289	/* Continue a block elsewhere (NEXT and REDO). */
3280af22	290	#define TOPBLOCK(cx) cx = &cxstack[cxstack_ix], \
1aff0e91	291	PL_stack_sp = PL_stack_base + cx->blk_oldsp, \
3280af22 NIS	292	PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
3280af22 NIS	293	PL_scopestack_ix = cx->blk_oldscopesp, \
2158dd9b GS	294	PL_retstack_ix = cx->blk_oldretsp, \
2158dd9b GS	295	PL_curpm = cx->blk_oldpm
79072805 LW	296
	297	/* substitution context */
	298	struct subst {
	299	I32 sbu_iters;
	300	I32 sbu_maxiters;
22e551b9	301	I32 sbu_rflags;
4633a7c4	302	I32 sbu_oldsave;
71be2cbc	303	bool sbu_once;
71be2cbc	304	bool sbu_rxtainted;
79072805 LW	305	char * sbu_orig;
	306	SV * sbu_dstr;
	307	SV * sbu_targ;
	308	char * sbu_s;
	309	char * sbu_m;
	310	char * sbu_strend;
c90c0ff4	311	void * sbu_rxres;
c07a80fd	312	REGEXP * sbu_rx;
79072805 LW	313	};
	314	#define sb_iters cx_u.cx_subst.sbu_iters
	315	#define sb_maxiters cx_u.cx_subst.sbu_maxiters
22e551b9	316	#define sb_rflags cx_u.cx_subst.sbu_rflags
4633a7c4	317	#define sb_oldsave cx_u.cx_subst.sbu_oldsave
71be2cbc	318	#define sb_once cx_u.cx_subst.sbu_once
71be2cbc	319	#define sb_rxtainted cx_u.cx_subst.sbu_rxtainted
79072805 LW	320	#define sb_orig cx_u.cx_subst.sbu_orig
	321	#define sb_dstr cx_u.cx_subst.sbu_dstr
	322	#define sb_targ cx_u.cx_subst.sbu_targ
	323	#define sb_s cx_u.cx_subst.sbu_s
	324	#define sb_m cx_u.cx_subst.sbu_m
	325	#define sb_strend cx_u.cx_subst.sbu_strend
c90c0ff4	326	#define sb_rxres cx_u.cx_subst.sbu_rxres
c07a80fd	327	#define sb_rx cx_u.cx_subst.sbu_rx
79072805 LW	328
	329	#define PUSHSUBST(cx) CXINC, cx = &cxstack[cxstack_ix], \
	330	cx->sb_iters = iters, \
	331	cx->sb_maxiters = maxiters, \
22e551b9	332	cx->sb_rflags = r_flags, \
4633a7c4	333	cx->sb_oldsave = oldsave, \
71be2cbc	334	cx->sb_once = once, \
71be2cbc	335	cx->sb_rxtainted = rxtainted, \
79072805 LW	336	cx->sb_orig = orig, \
	337	cx->sb_dstr = dstr, \
	338	cx->sb_targ = targ, \
	339	cx->sb_s = s, \
	340	cx->sb_m = m, \
	341	cx->sb_strend = strend, \
c90c0ff4	342	cx->sb_rxres = Null(void*), \
c07a80fd	343	cx->sb_rx = rx, \
c90c0ff4	344	cx->cx_type = CXt_SUBST; \
c90c0ff4	345	rxres_save(&cx->sb_rxres, rx)
79072805	346
c90c0ff4	347	#define POPSUBST(cx) cx = &cxstack[cxstack_ix--]; \
c90c0ff4	348	rxres_free(&cx->sb_rxres)
79072805 LW	349
79072805 LW	350	struct context {
6b35e009	351	U32 cx_type; /* what kind of context this is */
79072805 LW	352	union {
	353	struct block cx_blk;
	354	struct subst cx_subst;
	355	} cx_u;
	356	};
6b35e009 GS	357
6b35e009 GS	358	#define CXTYPEMASK 0xff
79072805 LW	359	#define CXt_NULL 0
	360	#define CXt_SUB 1
	361	#define CXt_EVAL 2
	362	#define CXt_LOOP 3
	363	#define CXt_SUBST 4
	364	#define CXt_BLOCK 5
7766f137	365	#define CXt_FORMAT 6
79072805	366
6b35e009 GS	367	/* private flags for CXt_EVAL */
6b35e009 GS	368	#define CXp_REAL 0x00000100 /* truly eval'', not a lookalike */
1d76a5c3	369	#define CXp_TRYBLOCK 0x00000200 /* eval{}, not eval'' or similar */
6b35e009	370
7766f137 GS	371	#ifdef USE_ITHREADS
	372	/* private flags for CXt_LOOP */
	373	# define CXp_PADVAR 0x00000100 /* itervar lives on pad, iterdata
	374	has pad offset; if not set,
	375	iterdata holds GV* */
	376	# define CxPADLOOP(c) (((c)->cx_type & (CXt_LOOP\|CXp_PADVAR)) \
	377	== (CXt_LOOP\|CXp_PADVAR))
	378	#endif
	379
6b35e009	380	#define CxTYPE(c) ((c)->cx_type & CXTYPEMASK)
7766f137 GS	381	#define CxREALEVAL(c) (((c)->cx_type & (CXt_EVAL\|CXp_REAL)) \
7766f137 GS	382	== (CXt_EVAL\|CXp_REAL))
1d76a5c3 GS	383	#define CxTRYBLOCK(c) (((c)->cx_type & (CXt_EVAL\|CXp_TRYBLOCK)) \
1d76a5c3 GS	384	== (CXt_EVAL\|CXp_TRYBLOCK))
6b35e009	385
79072805 LW	386	#define CXINC (cxstack_ix < cxstack_max ? ++cxstack_ix : (cxstack_ix = cxinc()))
	387
	388	/* "gimme" values */
954c1994 GS	389
	390	/*
	391	=for apidoc AmU\|\|G_SCALAR
	392	Used to indicate scalar context. See C<GIMME_V>, C<GIMME>, and
	393	L<perlcall>.
	394
	395	=for apidoc AmU\|\|G_ARRAY
91e74348	396	Used to indicate list context. See C<GIMME_V>, C<GIMME> and
954c1994 GS	397	L<perlcall>.
	398
	399	=for apidoc AmU\|\|G_VOID
	400	Used to indicate void context. See C<GIMME_V> and L<perlcall>.
	401
	402	=for apidoc AmU\|\|G_DISCARD
	403	Indicates that arguments returned from a callback should be discarded. See
	404	L<perlcall>.
	405
	406	=for apidoc AmU\|\|G_EVAL
	407
	408	Used to force a Perl C<eval> wrapper around a callback. See
	409	L<perlcall>.
	410
	411	=for apidoc AmU\|\|G_NOARGS
	412
	413	Indicates that no arguments are being sent to a callback. See
	414	L<perlcall>.
	415
	416	=cut
	417	*/
	418
a0d0e21e LW	419	#define G_SCALAR 0
a0d0e21e LW	420	#define G_ARRAY 1
54310121	421	#define G_VOID 128 /* skip this bit when adding flags below */
79072805	422
864dbfa3	423	/* extra flags for Perl_call_* routines */
a0d0e21e LW	424	#define G_DISCARD 2 /* Call FREETMPS. */
	425	#define G_EVAL 4 /* Assume eval {} around subroutine call. */
	426	#define G_NOARGS 8 /* Don't construct a @_ array. */
54310121	427	#define G_KEEPERR 16 /* Append errors to $@, don't overwrite it */
491527d0	428	#define G_NODEBUG 32 /* Disable debugging at toplevel. */
968b3946	429	#define G_METHOD 64 /* Calling method. */
e336de0d	430
faef0170 HS	431	/* flag bits for PL_in_eval */
	432	#define EVAL_NULL 0 /* not in an eval */
	433	#define EVAL_INEVAL 1 /* some enclosing scope is an eval */
	434	#define EVAL_WARNONLY 2 /* used by yywarn() when calling yyerror() */
864dbfa3	435	#define EVAL_KEEPERR 4 /* set by Perl_call_sv if G_KEEPERR */
faef0170	436
e336de0d GS	437	/* Support for switching (stack and block) contexts.
	438	* This ensures magic doesn't invalidate local stack and cx pointers.
	439	*/
	440
e788e7d3 GS	441	#define PERLSI_UNKNOWN -1
	442	#define PERLSI_UNDEF 0
	443	#define PERLSI_MAIN 1
	444	#define PERLSI_MAGIC 2
	445	#define PERLSI_SORT 3
	446	#define PERLSI_SIGNAL 4
	447	#define PERLSI_OVERLOAD 5
	448	#define PERLSI_DESTROY 6
	449	#define PERLSI_WARNHOOK 7
	450	#define PERLSI_DIEHOOK 8
	451	#define PERLSI_REQUIRE 9
e336de0d GS	452
	453	struct stackinfo {
	454	AV * si_stack; /* stack for current runlevel */
	455	PERL_CONTEXT * si_cxstack; /* context stack for runlevel */
	456	I32 si_cxix; /* current context index */
	457	I32 si_cxmax; /* maximum allocated index */
	458	I32 si_type; /* type of runlevel */
	459	struct stackinfo * si_prev;
	460	struct stackinfo * si_next;
ce2f7c3b	461	I32 si_markoff; /* offset where markstack begins for us.
e336de0d GS	462	* currently used only with DEBUGGING,
	463	* but not #ifdef-ed for bincompat */
	464	};
	465
	466	typedef struct stackinfo PERL_SI;
	467
3280af22 NIS	468	#define cxstack (PL_curstackinfo->si_cxstack)
	469	#define cxstack_ix (PL_curstackinfo->si_cxix)
	470	#define cxstack_max (PL_curstackinfo->si_cxmax)
e336de0d GS	471
e336de0d GS	472	#ifdef DEBUGGING
ce2f7c3b GS	473	# define SET_MARK_OFFSET \
ce2f7c3b GS	474	PL_curstackinfo->si_markoff = PL_markstack_ptr - PL_markstack
e336de0d	475	#else
ce2f7c3b	476	# define SET_MARK_OFFSET NOOP
e336de0d GS	477	#endif
e336de0d GS	478
d3acc0f7	479	#define PUSHSTACKi(type) \
e336de0d	480	STMT_START { \
3280af22	481	PERL_SI *next = PL_curstackinfo->si_next; \
e336de0d GS	482	if (!next) { \
e336de0d GS	483	next = new_stackinfo(32, 2048/sizeof(PERL_CONTEXT) - 1); \
3280af22 NIS	484	next->si_prev = PL_curstackinfo; \
3280af22 NIS	485	PL_curstackinfo->si_next = next; \
e336de0d GS	486	} \
	487	next->si_type = type; \
	488	next->si_cxix = -1; \
	489	AvFILLp(next->si_stack) = 0; \
3280af22 NIS	490	SWITCHSTACK(PL_curstack,next->si_stack); \
3280af22 NIS	491	PL_curstackinfo = next; \
ce2f7c3b	492	SET_MARK_OFFSET; \
e336de0d GS	493	} STMT_END
e336de0d GS	494
e788e7d3	495	#define PUSHSTACK PUSHSTACKi(PERLSI_UNKNOWN)
d3acc0f7	496
3095d977 GS	497	/* POPSTACK works with PL_stack_sp, so it may need to be bracketed by
3095d977 GS	498	* PUTBACK/SPAGAIN to flush/refresh any local SP that may be active */
d3acc0f7	499	#define POPSTACK \
e336de0d	500	STMT_START { \
de616352	501	djSP; \
3280af22	502	PERL_SI *prev = PL_curstackinfo->si_prev; \
e336de0d	503	if (!prev) { \
bf49b057	504	PerlIO_printf(Perl_error_log, "panic: POPSTACK\n"); \
e336de0d GS	505	my_exit(1); \
e336de0d GS	506	} \
3280af22	507	SWITCHSTACK(PL_curstack,prev->si_stack); \
e336de0d	508	/* don't free prev here, free them all at the END{} */ \
3280af22	509	PL_curstackinfo = prev; \
e336de0d GS	510	} STMT_END
	511
	512	#define POPSTACK_TO(s) \
	513	STMT_START { \
3280af22	514	while (PL_curstack != s) { \
bac4b2ad	515	dounwind(-1); \
d3acc0f7	516	POPSTACK; \
bac4b2ad	517	} \
e336de0d	518	} STMT_END