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 */
14 char * cop_stashpv; /* package line was compiled in */
15 char * cop_file; /* file name the following line # is from */
17 HV * cop_stash; /* package line was compiled in */
18 GV * cop_filegv; /* file the following line # is from */
20 U32 cop_seq; /* parse sequence number */
21 I32 cop_arybase; /* array base this line was compiled with */
22 line_t cop_line; /* line # of this command */
23 SV * cop_warnings; /* lexical warnings bitmask */
26 #define Nullcop Null(COP*)
29 # define CopFILE(c) ((c)->cop_file)
30 # define CopFILEGV(c) (CopFILE(c) \
31 ? gv_fetchfile(CopFILE(c)) : Nullgv)
32 # define CopFILE_set(c,pv) ((c)->cop_file = savepv(pv)) /* XXX */
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)
37 # define CopSTASHPV(c) ((c)->cop_stashpv)
38 # define CopSTASHPV_set(c,pv) ((c)->cop_stashpv = savepv(pv)) /* XXX */
39 # define CopSTASH(c) (CopSTASHPV(c) \
40 ? gv_stashpv(CopSTASHPV(c),GV_ADD) : Nullhv)
41 # define CopSTASH_set(c,hv) CopSTASHPV_set(c, HvNAME(hv))
43 # define CopFILEGV(c) ((c)->cop_filegv)
44 # define CopFILEGV_set(c,gv) ((c)->cop_filegv = gv)
45 # define CopFILE_set(c,pv) ((c)->cop_filegv = gv_fetchfile(pv))
46 # define CopFILESV(c) (CopFILEGV(c) ? GvSV(CopFILEGV(c)) : Nullsv)
47 # define CopFILEAV(c) (CopFILEGV(c) ? GvAV(CopFILEGV(c)) : Nullav)
48 # define CopFILE(c) (CopFILESV(c) ? SvPVX(CopFILESV(c)) : Nullch)
49 # define CopSTASH(c) ((c)->cop_stash)
50 # define CopSTASH_set(c,hv) ((c)->cop_stash = hv)
51 # define CopSTASHPV(c) (CopSTASH(c) ? HvNAME(CopSTASH(c)) : Nullch)
52 # define CopSTASHPV_set(c,pv) CopSTASH_set(c, gv_stashpv(pv,GV_ADD))
53 #endif /* USE_ITHREADS */
55 #define CopLINE(c) ((c)->cop_line)
56 #define CopLINE_inc(c) (++CopLINE(c))
57 #define CopLINE_dec(c) (--CopLINE(c))
58 #define CopLINE_set(c,l) (CopLINE(c) = (l))
61 * Here we have some enormously heavy (or at least ponderous) wizardry.
64 /* subroutine context */
71 #endif /* USE_THREADS */
75 U8 lval; /* XXX merge lval and hasargs? */
79 cx->blk_sub.cv = cv; \
80 cx->blk_sub.olddepth = CvDEPTH(cv); \
81 cx->blk_sub.hasargs = hasargs; \
82 cx->blk_sub.lval = PL_op->op_private & \
83 (OPpLVAL_INTRO|OPpENTERSUB_INARGS);
85 #define PUSHFORMAT(cx) \
86 cx->blk_sub.cv = cv; \
87 cx->blk_sub.gv = gv; \
88 cx->blk_sub.hasargs = 0; \
89 cx->blk_sub.dfoutgv = PL_defoutgv; \
90 (void)SvREFCNT_inc(cx->blk_sub.dfoutgv)
93 #define POPSAVEARRAY() NOOP
95 #define POPSAVEARRAY() \
97 SvREFCNT_dec(GvAV(PL_defgv)); \
98 GvAV(PL_defgv) = cx->blk_sub.savearray; \
100 #endif /* USE_THREADS */
102 #define POPSUB(cx,sv) \
104 if (cx->blk_sub.hasargs) { \
106 /* abandon @_ if it got reified */ \
107 if (AvREAL(cx->blk_sub.argarray)) { \
108 SSize_t fill = AvFILLp(cx->blk_sub.argarray); \
109 SvREFCNT_dec(cx->blk_sub.argarray); \
110 cx->blk_sub.argarray = newAV(); \
111 av_extend(cx->blk_sub.argarray, fill); \
112 AvFLAGS(cx->blk_sub.argarray) = AVf_REIFY; \
113 PL_curpad[0] = (SV*)cx->blk_sub.argarray; \
116 sv = (SV*)cx->blk_sub.cv; \
117 if (sv && (CvDEPTH((CV*)sv) = cx->blk_sub.olddepth)) \
121 #define LEAVESUB(sv) \
127 #define POPFORMAT(cx) \
128 setdefout(cx->blk_sub.dfoutgv); \
129 SvREFCNT_dec(cx->blk_sub.dfoutgv);
140 #define PUSHEVAL(cx,n,fgv) \
141 cx->blk_eval.old_in_eval = PL_in_eval; \
142 cx->blk_eval.old_op_type = PL_op->op_type; \
143 cx->blk_eval.old_name = n; \
144 cx->blk_eval.old_eval_root = PL_eval_root; \
145 cx->blk_eval.cur_text = PL_linestr;
147 #define POPEVAL(cx) \
148 PL_in_eval = cx->blk_eval.old_in_eval; \
149 optype = cx->blk_eval.old_op_type; \
150 PL_eval_root = cx->blk_eval.old_eval_root;
167 #define PUSHLOOP(cx, ivar, s) \
168 cx->blk_loop.label = PL_curcop->cop_label; \
169 cx->blk_loop.resetsp = s - PL_stack_base; \
170 cx->blk_loop.redo_op = cLOOP->op_redoop; \
171 cx->blk_loop.next_op = cLOOP->op_nextop; \
172 cx->blk_loop.last_op = cLOOP->op_lastop; \
173 if (cx->blk_loop.itervar = (ivar)) \
174 cx->blk_loop.itersave = SvREFCNT_inc(*cx->blk_loop.itervar);\
175 cx->blk_loop.iterlval = Nullsv; \
176 cx->blk_loop.iterary = Nullav; \
177 cx->blk_loop.iterix = -1;
179 #define POPLOOP(cx) \
180 SvREFCNT_dec(cx->blk_loop.iterlval); \
181 if (cx->blk_loop.itervar) { \
182 sv_2mortal(*(cx->blk_loop.itervar)); \
183 *(cx->blk_loop.itervar) = cx->blk_loop.itersave; \
185 if (cx->blk_loop.iterary && cx->blk_loop.iterary != PL_curstack)\
186 SvREFCNT_dec(cx->blk_loop.iterary);
188 /* context common to subroutines, evals and loops */
190 I32 blku_oldsp; /* stack pointer to copy stuff down to */
191 COP * blku_oldcop; /* old curcop pointer */
192 I32 blku_oldretsp; /* return stack index */
193 I32 blku_oldmarksp; /* mark stack index */
194 I32 blku_oldscopesp; /* scope stack index */
195 PMOP * blku_oldpm; /* values of pattern match vars */
196 U8 blku_gimme; /* is this block running in list context? */
199 struct block_sub blku_sub;
200 struct block_eval blku_eval;
201 struct block_loop blku_loop;
204 #define blk_oldsp cx_u.cx_blk.blku_oldsp
205 #define blk_oldcop cx_u.cx_blk.blku_oldcop
206 #define blk_oldretsp cx_u.cx_blk.blku_oldretsp
207 #define blk_oldmarksp cx_u.cx_blk.blku_oldmarksp
208 #define blk_oldscopesp cx_u.cx_blk.blku_oldscopesp
209 #define blk_oldpm cx_u.cx_blk.blku_oldpm
210 #define blk_gimme cx_u.cx_blk.blku_gimme
211 #define blk_sub cx_u.cx_blk.blk_u.blku_sub
212 #define blk_eval cx_u.cx_blk.blk_u.blku_eval
213 #define blk_loop cx_u.cx_blk.blk_u.blku_loop
216 #define PUSHBLOCK(cx,t,sp) CXINC, cx = &cxstack[cxstack_ix], \
218 cx->blk_oldsp = sp - PL_stack_base, \
219 cx->blk_oldcop = PL_curcop, \
220 cx->blk_oldmarksp = PL_markstack_ptr - PL_markstack, \
221 cx->blk_oldscopesp = PL_scopestack_ix, \
222 cx->blk_oldretsp = PL_retstack_ix, \
223 cx->blk_oldpm = PL_curpm, \
224 cx->blk_gimme = gimme; \
225 DEBUG_l( PerlIO_printf(Perl_debug_log, "Entering block %ld, type %s\n", \
226 (long)cxstack_ix, PL_block_type[CxTYPE(cx)]); )
228 /* Exit a block (RETURN and LAST). */
229 #define POPBLOCK(cx,pm) cx = &cxstack[cxstack_ix--], \
230 newsp = PL_stack_base + cx->blk_oldsp, \
231 PL_curcop = cx->blk_oldcop, \
232 PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
233 PL_scopestack_ix = cx->blk_oldscopesp, \
234 PL_retstack_ix = cx->blk_oldretsp, \
235 pm = cx->blk_oldpm, \
236 gimme = cx->blk_gimme; \
237 DEBUG_l( PerlIO_printf(Perl_debug_log, "Leaving block %ld, type %s\n", \
238 (long)cxstack_ix+1,PL_block_type[CxTYPE(cx)]); )
240 /* Continue a block elsewhere (NEXT and REDO). */
241 #define TOPBLOCK(cx) cx = &cxstack[cxstack_ix], \
242 PL_stack_sp = PL_stack_base + cx->blk_oldsp, \
243 PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
244 PL_scopestack_ix = cx->blk_oldscopesp, \
245 PL_retstack_ix = cx->blk_oldretsp, \
246 PL_curpm = cx->blk_oldpm
248 /* substitution context */
265 #define sb_iters cx_u.cx_subst.sbu_iters
266 #define sb_maxiters cx_u.cx_subst.sbu_maxiters
267 #define sb_rflags cx_u.cx_subst.sbu_rflags
268 #define sb_oldsave cx_u.cx_subst.sbu_oldsave
269 #define sb_once cx_u.cx_subst.sbu_once
270 #define sb_rxtainted cx_u.cx_subst.sbu_rxtainted
271 #define sb_orig cx_u.cx_subst.sbu_orig
272 #define sb_dstr cx_u.cx_subst.sbu_dstr
273 #define sb_targ cx_u.cx_subst.sbu_targ
274 #define sb_s cx_u.cx_subst.sbu_s
275 #define sb_m cx_u.cx_subst.sbu_m
276 #define sb_strend cx_u.cx_subst.sbu_strend
277 #define sb_rxres cx_u.cx_subst.sbu_rxres
278 #define sb_rx cx_u.cx_subst.sbu_rx
280 #define PUSHSUBST(cx) CXINC, cx = &cxstack[cxstack_ix], \
281 cx->sb_iters = iters, \
282 cx->sb_maxiters = maxiters, \
283 cx->sb_rflags = r_flags, \
284 cx->sb_oldsave = oldsave, \
285 cx->sb_once = once, \
286 cx->sb_rxtainted = rxtainted, \
287 cx->sb_orig = orig, \
288 cx->sb_dstr = dstr, \
289 cx->sb_targ = targ, \
292 cx->sb_strend = strend, \
293 cx->sb_rxres = Null(void*), \
295 cx->cx_type = CXt_SUBST; \
296 rxres_save(&cx->sb_rxres, rx)
298 #define POPSUBST(cx) cx = &cxstack[cxstack_ix--]; \
299 rxres_free(&cx->sb_rxres)
302 U32 cx_type; /* what kind of context this is */
305 struct subst cx_subst;
309 #define CXTYPEMASK 0xff
317 /* private flags for CXt_EVAL */
318 #define CXp_REAL 0x00000100 /* truly eval'', not a lookalike */
320 #define CxTYPE(c) ((c)->cx_type & CXTYPEMASK)
321 #define CxREALEVAL(c) (((c)->cx_type & (CXt_EVAL|CXp_REAL)) == (CXt_EVAL|CXp_REAL))
323 #define CXINC (cxstack_ix < cxstack_max ? ++cxstack_ix : (cxstack_ix = cxinc()))
328 #define G_VOID 128 /* skip this bit when adding flags below */
330 /* extra flags for Perl_call_* routines */
331 #define G_DISCARD 2 /* Call FREETMPS. */
332 #define G_EVAL 4 /* Assume eval {} around subroutine call. */
333 #define G_NOARGS 8 /* Don't construct a @_ array. */
334 #define G_KEEPERR 16 /* Append errors to $@, don't overwrite it */
335 #define G_NODEBUG 32 /* Disable debugging at toplevel. */
337 /* flag bits for PL_in_eval */
338 #define EVAL_NULL 0 /* not in an eval */
339 #define EVAL_INEVAL 1 /* some enclosing scope is an eval */
340 #define EVAL_WARNONLY 2 /* used by yywarn() when calling yyerror() */
341 #define EVAL_KEEPERR 4 /* set by Perl_call_sv if G_KEEPERR */
343 /* Support for switching (stack and block) contexts.
344 * This ensures magic doesn't invalidate local stack and cx pointers.
347 #define PERLSI_UNKNOWN -1
348 #define PERLSI_UNDEF 0
349 #define PERLSI_MAIN 1
350 #define PERLSI_MAGIC 2
351 #define PERLSI_SORT 3
352 #define PERLSI_SIGNAL 4
353 #define PERLSI_OVERLOAD 5
354 #define PERLSI_DESTROY 6
355 #define PERLSI_WARNHOOK 7
356 #define PERLSI_DIEHOOK 8
357 #define PERLSI_REQUIRE 9
360 AV * si_stack; /* stack for current runlevel */
361 PERL_CONTEXT * si_cxstack; /* context stack for runlevel */
362 I32 si_cxix; /* current context index */
363 I32 si_cxmax; /* maximum allocated index */
364 I32 si_type; /* type of runlevel */
365 struct stackinfo * si_prev;
366 struct stackinfo * si_next;
367 I32 * si_markbase; /* where markstack begins for us.
368 * currently used only with DEBUGGING,
369 * but not #ifdef-ed for bincompat */
372 typedef struct stackinfo PERL_SI;
374 #define cxstack (PL_curstackinfo->si_cxstack)
375 #define cxstack_ix (PL_curstackinfo->si_cxix)
376 #define cxstack_max (PL_curstackinfo->si_cxmax)
379 # define SET_MARKBASE PL_curstackinfo->si_markbase = PL_markstack_ptr
381 # define SET_MARKBASE NOOP
384 #define PUSHSTACKi(type) \
386 PERL_SI *next = PL_curstackinfo->si_next; \
388 next = new_stackinfo(32, 2048/sizeof(PERL_CONTEXT) - 1); \
389 next->si_prev = PL_curstackinfo; \
390 PL_curstackinfo->si_next = next; \
392 next->si_type = type; \
393 next->si_cxix = -1; \
394 AvFILLp(next->si_stack) = 0; \
395 SWITCHSTACK(PL_curstack,next->si_stack); \
396 PL_curstackinfo = next; \
400 #define PUSHSTACK PUSHSTACKi(PERLSI_UNKNOWN)
402 /* POPSTACK works with PL_stack_sp, so it may need to be bracketed by
403 * PUTBACK/SPAGAIN to flush/refresh any local SP that may be active */
407 PERL_SI *prev = PL_curstackinfo->si_prev; \
409 PerlIO_printf(Perl_error_log, "panic: POPSTACK\n"); \
412 SWITCHSTACK(PL_curstack,prev->si_stack); \
413 /* don't free prev here, free them all at the END{} */ \
414 PL_curstackinfo = prev; \
417 #define POPSTACK_TO(s) \
419 while (PL_curstack != s) { \