3 * Copyright (c) 1991-1999, Larry Wall
5 * You may distribute under the terms of either the GNU General Public
6 * License or the Artistic License, as specified in the README file.
12 char * cop_label; /* label for this construct */
13 HV * cop_stash; /* package line was compiled in */
14 GV * cop_filegv; /* file the following line # is from */
15 U32 cop_seq; /* parse sequence number */
16 I32 cop_arybase; /* array base this line was compiled with */
17 line_t cop_line; /* line # of this command */
18 SV * cop_warnings; /* lexical warnings bitmask */
21 #define Nullcop Null(COP*)
24 * Here we have some enormously heavy (or at least ponderous) wizardry.
27 /* subroutine context */
34 #endif /* USE_THREADS */
38 U8 lval; /* XXX merge lval and hasargs? */
42 cx->blk_sub.cv = cv; \
43 cx->blk_sub.olddepth = CvDEPTH(cv); \
44 cx->blk_sub.hasargs = hasargs; \
45 cx->blk_sub.lval = PL_op->op_private & \
46 (OPpLVAL_INTRO|OPpENTERSUB_INARGS);
48 #define PUSHFORMAT(cx) \
49 cx->blk_sub.cv = cv; \
50 cx->blk_sub.gv = gv; \
51 cx->blk_sub.hasargs = 0; \
52 cx->blk_sub.dfoutgv = PL_defoutgv; \
53 (void)SvREFCNT_inc(cx->blk_sub.dfoutgv)
56 #define POPSAVEARRAY() NOOP
58 #define POPSAVEARRAY() \
60 SvREFCNT_dec(GvAV(PL_defgv)); \
61 GvAV(PL_defgv) = cx->blk_sub.savearray; \
63 #endif /* USE_THREADS */
66 if (cx->blk_sub.hasargs) { \
68 /* abandon @_ if it got reified */ \
69 if (AvREAL(cx->blk_sub.argarray)) { \
70 SSize_t fill = AvFILLp(cx->blk_sub.argarray); \
71 SvREFCNT_dec(cx->blk_sub.argarray); \
72 cx->blk_sub.argarray = newAV(); \
73 av_extend(cx->blk_sub.argarray, fill); \
74 AvFLAGS(cx->blk_sub.argarray) = AVf_REIFY; \
75 PL_curpad[0] = (SV*)cx->blk_sub.argarray; \
78 if (cx->blk_sub.cv) { \
79 if (!(CvDEPTH(cx->blk_sub.cv) = cx->blk_sub.olddepth)) \
80 SvREFCNT_dec(cx->blk_sub.cv); \
83 #define POPFORMAT(cx) \
84 setdefout(cx->blk_sub.dfoutgv); \
85 SvREFCNT_dec(cx->blk_sub.dfoutgv);
96 #define PUSHEVAL(cx,n,fgv) \
97 cx->blk_eval.old_in_eval = PL_in_eval; \
98 cx->blk_eval.old_op_type = PL_op->op_type; \
99 cx->blk_eval.old_name = n; \
100 cx->blk_eval.old_eval_root = PL_eval_root; \
101 cx->blk_eval.cur_text = PL_linestr;
103 #define POPEVAL(cx) \
104 PL_in_eval = cx->blk_eval.old_in_eval; \
105 optype = cx->blk_eval.old_op_type; \
106 PL_eval_root = cx->blk_eval.old_eval_root;
123 #define PUSHLOOP(cx, ivar, s) \
124 cx->blk_loop.label = PL_curcop->cop_label; \
125 cx->blk_loop.resetsp = s - PL_stack_base; \
126 cx->blk_loop.redo_op = cLOOP->op_redoop; \
127 cx->blk_loop.next_op = cLOOP->op_nextop; \
128 cx->blk_loop.last_op = cLOOP->op_lastop; \
129 if (cx->blk_loop.itervar = (ivar)) \
130 cx->blk_loop.itersave = SvREFCNT_inc(*cx->blk_loop.itervar);\
131 cx->blk_loop.iterlval = Nullsv; \
132 cx->blk_loop.iterary = Nullav; \
133 cx->blk_loop.iterix = -1;
135 #define POPLOOP(cx) \
136 SvREFCNT_dec(cx->blk_loop.iterlval); \
137 if (cx->blk_loop.itervar) { \
138 sv_2mortal(*(cx->blk_loop.itervar)); \
139 *(cx->blk_loop.itervar) = cx->blk_loop.itersave; \
141 if (cx->blk_loop.iterary && cx->blk_loop.iterary != PL_curstack)\
142 SvREFCNT_dec(cx->blk_loop.iterary);
144 /* context common to subroutines, evals and loops */
146 I32 blku_oldsp; /* stack pointer to copy stuff down to */
147 COP * blku_oldcop; /* old curcop pointer */
148 I32 blku_oldretsp; /* return stack index */
149 I32 blku_oldmarksp; /* mark stack index */
150 I32 blku_oldscopesp; /* scope stack index */
151 PMOP * blku_oldpm; /* values of pattern match vars */
152 U8 blku_gimme; /* is this block running in list context? */
155 struct block_sub blku_sub;
156 struct block_eval blku_eval;
157 struct block_loop blku_loop;
160 #define blk_oldsp cx_u.cx_blk.blku_oldsp
161 #define blk_oldcop cx_u.cx_blk.blku_oldcop
162 #define blk_oldretsp cx_u.cx_blk.blku_oldretsp
163 #define blk_oldmarksp cx_u.cx_blk.blku_oldmarksp
164 #define blk_oldscopesp cx_u.cx_blk.blku_oldscopesp
165 #define blk_oldpm cx_u.cx_blk.blku_oldpm
166 #define blk_gimme cx_u.cx_blk.blku_gimme
167 #define blk_sub cx_u.cx_blk.blk_u.blku_sub
168 #define blk_eval cx_u.cx_blk.blk_u.blku_eval
169 #define blk_loop cx_u.cx_blk.blk_u.blku_loop
172 #define PUSHBLOCK(cx,t,sp) CXINC, cx = &cxstack[cxstack_ix], \
174 cx->blk_oldsp = sp - PL_stack_base, \
175 cx->blk_oldcop = PL_curcop, \
176 cx->blk_oldmarksp = PL_markstack_ptr - PL_markstack, \
177 cx->blk_oldscopesp = PL_scopestack_ix, \
178 cx->blk_oldretsp = PL_retstack_ix, \
179 cx->blk_oldpm = PL_curpm, \
180 cx->blk_gimme = gimme; \
181 DEBUG_l( PerlIO_printf(Perl_debug_log, "Entering block %ld, type %s\n", \
182 (long)cxstack_ix, PL_block_type[CxTYPE(cx)]); )
184 /* Exit a block (RETURN and LAST). */
185 #define POPBLOCK(cx,pm) cx = &cxstack[cxstack_ix--], \
186 newsp = PL_stack_base + cx->blk_oldsp, \
187 PL_curcop = cx->blk_oldcop, \
188 PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
189 PL_scopestack_ix = cx->blk_oldscopesp, \
190 PL_retstack_ix = cx->blk_oldretsp, \
191 pm = cx->blk_oldpm, \
192 gimme = cx->blk_gimme; \
193 DEBUG_l( PerlIO_printf(Perl_debug_log, "Leaving block %ld, type %s\n", \
194 (long)cxstack_ix+1,PL_block_type[CxTYPE(cx)]); )
196 /* Continue a block elsewhere (NEXT and REDO). */
197 #define TOPBLOCK(cx) cx = &cxstack[cxstack_ix], \
198 PL_stack_sp = PL_stack_base + cx->blk_oldsp, \
199 PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
200 PL_scopestack_ix = cx->blk_oldscopesp, \
201 PL_retstack_ix = cx->blk_oldretsp, \
202 PL_curpm = cx->blk_oldpm
204 /* substitution context */
221 #define sb_iters cx_u.cx_subst.sbu_iters
222 #define sb_maxiters cx_u.cx_subst.sbu_maxiters
223 #define sb_rflags cx_u.cx_subst.sbu_rflags
224 #define sb_oldsave cx_u.cx_subst.sbu_oldsave
225 #define sb_once cx_u.cx_subst.sbu_once
226 #define sb_rxtainted cx_u.cx_subst.sbu_rxtainted
227 #define sb_orig cx_u.cx_subst.sbu_orig
228 #define sb_dstr cx_u.cx_subst.sbu_dstr
229 #define sb_targ cx_u.cx_subst.sbu_targ
230 #define sb_s cx_u.cx_subst.sbu_s
231 #define sb_m cx_u.cx_subst.sbu_m
232 #define sb_strend cx_u.cx_subst.sbu_strend
233 #define sb_rxres cx_u.cx_subst.sbu_rxres
234 #define sb_rx cx_u.cx_subst.sbu_rx
236 #define PUSHSUBST(cx) CXINC, cx = &cxstack[cxstack_ix], \
237 cx->sb_iters = iters, \
238 cx->sb_maxiters = maxiters, \
239 cx->sb_rflags = r_flags, \
240 cx->sb_oldsave = oldsave, \
241 cx->sb_once = once, \
242 cx->sb_rxtainted = rxtainted, \
243 cx->sb_orig = orig, \
244 cx->sb_dstr = dstr, \
245 cx->sb_targ = targ, \
248 cx->sb_strend = strend, \
249 cx->sb_rxres = Null(void*), \
251 cx->cx_type = CXt_SUBST; \
252 rxres_save(&cx->sb_rxres, rx)
254 #define POPSUBST(cx) cx = &cxstack[cxstack_ix--]; \
255 rxres_free(&cx->sb_rxres)
258 U32 cx_type; /* what kind of context this is */
261 struct subst cx_subst;
265 #define CXTYPEMASK 0xff
273 /* private flags for CXt_EVAL */
274 #define CXp_REAL 0x00000100 /* truly eval'', not a lookalike */
276 #define CxTYPE(c) ((c)->cx_type & CXTYPEMASK)
277 #define CxREALEVAL(c) (((c)->cx_type & (CXt_EVAL|CXp_REAL)) == (CXt_EVAL|CXp_REAL))
279 #define CXINC (cxstack_ix < cxstack_max ? ++cxstack_ix : (cxstack_ix = cxinc()))
284 #define G_VOID 128 /* skip this bit when adding flags below */
286 /* extra flags for Perl_call_* routines */
287 #define G_DISCARD 2 /* Call FREETMPS. */
288 #define G_EVAL 4 /* Assume eval {} around subroutine call. */
289 #define G_NOARGS 8 /* Don't construct a @_ array. */
290 #define G_KEEPERR 16 /* Append errors to $@, don't overwrite it */
291 #define G_NODEBUG 32 /* Disable debugging at toplevel. */
292 #define G_NOCATCH 64 /* Don't do CATCH_SET() */
294 /* flag bits for PL_in_eval */
295 #define EVAL_NULL 0 /* not in an eval */
296 #define EVAL_INEVAL 1 /* some enclosing scope is an eval */
297 #define EVAL_WARNONLY 2 /* used by yywarn() when calling yyerror() */
298 #define EVAL_KEEPERR 4 /* set by Perl_call_sv if G_KEEPERR */
300 /* Support for switching (stack and block) contexts.
301 * This ensures magic doesn't invalidate local stack and cx pointers.
304 #define PERLSI_UNKNOWN -1
305 #define PERLSI_UNDEF 0
306 #define PERLSI_MAIN 1
307 #define PERLSI_MAGIC 2
308 #define PERLSI_SORT 3
309 #define PERLSI_SIGNAL 4
310 #define PERLSI_OVERLOAD 5
311 #define PERLSI_DESTROY 6
312 #define PERLSI_WARNHOOK 7
313 #define PERLSI_DIEHOOK 8
314 #define PERLSI_REQUIRE 9
317 AV * si_stack; /* stack for current runlevel */
318 PERL_CONTEXT * si_cxstack; /* context stack for runlevel */
319 I32 si_cxix; /* current context index */
320 I32 si_cxmax; /* maximum allocated index */
321 I32 si_type; /* type of runlevel */
322 struct stackinfo * si_prev;
323 struct stackinfo * si_next;
324 I32 * si_markbase; /* where markstack begins for us.
325 * currently used only with DEBUGGING,
326 * but not #ifdef-ed for bincompat */
329 typedef struct stackinfo PERL_SI;
331 #define cxstack (PL_curstackinfo->si_cxstack)
332 #define cxstack_ix (PL_curstackinfo->si_cxix)
333 #define cxstack_max (PL_curstackinfo->si_cxmax)
336 # define SET_MARKBASE PL_curstackinfo->si_markbase = PL_markstack_ptr
338 # define SET_MARKBASE NOOP
341 #define PUSHSTACKi(type) \
343 PERL_SI *next = PL_curstackinfo->si_next; \
345 next = new_stackinfo(32, 2048/sizeof(PERL_CONTEXT) - 1); \
346 next->si_prev = PL_curstackinfo; \
347 PL_curstackinfo->si_next = next; \
349 next->si_type = type; \
350 next->si_cxix = -1; \
351 AvFILLp(next->si_stack) = 0; \
352 SWITCHSTACK(PL_curstack,next->si_stack); \
353 PL_curstackinfo = next; \
357 #define PUSHSTACK PUSHSTACKi(PERLSI_UNKNOWN)
359 /* POPSTACK works with PL_stack_sp, so it may need to be bracketed by
360 * PUTBACK/SPAGAIN to flush/refresh any local SP that may be active */
364 PERL_SI *prev = PL_curstackinfo->si_prev; \
366 PerlIO_printf(Perl_error_log, "panic: POPSTACK\n"); \
369 SWITCHSTACK(PL_curstack,prev->si_stack); \
370 /* don't free prev here, free them all at the END{} */ \
371 PL_curstackinfo = prev; \
374 #define POPSTACK_TO(s) \
376 while (PL_curstack != s) { \