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))
42 # define CopSTASH_eq(c,hv) (hv \
43 && (CopSTASHPV(c) == HvNAME(hv) \
44 || (CopSTASHPV(c) && HvNAME(hv) \
45 && strEQ(CopSTASHPV(c), HvNAME(hv)))))
47 # define CopFILEGV(c) ((c)->cop_filegv)
48 # define CopFILEGV_set(c,gv) ((c)->cop_filegv = gv)
49 # define CopFILE_set(c,pv) ((c)->cop_filegv = gv_fetchfile(pv))
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)
54 # define CopSTASH_set(c,hv) ((c)->cop_stash = hv)
55 # define CopSTASHPV(c) (CopSTASH(c) ? HvNAME(CopSTASH(c)) : Nullch)
56 # define CopSTASHPV_set(c,pv) CopSTASH_set(c, gv_stashpv(pv,GV_ADD))
57 # define CopSTASH_eq(c,hv) (CopSTASH(c) == hv)
58 #endif /* USE_ITHREADS */
60 #define CopSTASH_ne(c,hv) (!CopSTASH_eq(c,hv))
61 #define CopLINE(c) ((c)->cop_line)
62 #define CopLINE_inc(c) (++CopLINE(c))
63 #define CopLINE_dec(c) (--CopLINE(c))
64 #define CopLINE_set(c,l) (CopLINE(c) = (l))
67 * Here we have some enormously heavy (or at least ponderous) wizardry.
70 /* subroutine context */
77 #endif /* USE_THREADS */
81 U8 lval; /* XXX merge lval and hasargs? */
85 cx->blk_sub.cv = cv; \
86 cx->blk_sub.olddepth = CvDEPTH(cv); \
87 cx->blk_sub.hasargs = hasargs; \
88 cx->blk_sub.lval = PL_op->op_private & \
89 (OPpLVAL_INTRO|OPpENTERSUB_INARGS);
91 #define PUSHFORMAT(cx) \
92 cx->blk_sub.cv = cv; \
93 cx->blk_sub.gv = gv; \
94 cx->blk_sub.hasargs = 0; \
95 cx->blk_sub.dfoutgv = PL_defoutgv; \
96 (void)SvREFCNT_inc(cx->blk_sub.dfoutgv)
99 #define POPSAVEARRAY() NOOP
101 #define POPSAVEARRAY() \
103 SvREFCNT_dec(GvAV(PL_defgv)); \
104 GvAV(PL_defgv) = cx->blk_sub.savearray; \
106 #endif /* USE_THREADS */
108 #define POPSUB(cx,sv) \
110 if (cx->blk_sub.hasargs) { \
112 /* abandon @_ if it got reified */ \
113 if (AvREAL(cx->blk_sub.argarray)) { \
114 SSize_t fill = AvFILLp(cx->blk_sub.argarray); \
115 SvREFCNT_dec(cx->blk_sub.argarray); \
116 cx->blk_sub.argarray = newAV(); \
117 av_extend(cx->blk_sub.argarray, fill); \
118 AvFLAGS(cx->blk_sub.argarray) = AVf_REIFY; \
119 PL_curpad[0] = (SV*)cx->blk_sub.argarray; \
122 sv = (SV*)cx->blk_sub.cv; \
123 if (sv && (CvDEPTH((CV*)sv) = cx->blk_sub.olddepth)) \
127 #define LEAVESUB(sv) \
133 #define POPFORMAT(cx) \
134 setdefout(cx->blk_sub.dfoutgv); \
135 SvREFCNT_dec(cx->blk_sub.dfoutgv);
146 #define PUSHEVAL(cx,n,fgv) \
147 cx->blk_eval.old_in_eval = PL_in_eval; \
148 cx->blk_eval.old_op_type = PL_op->op_type; \
149 cx->blk_eval.old_name = n; \
150 cx->blk_eval.old_eval_root = PL_eval_root; \
151 cx->blk_eval.cur_text = PL_linestr;
153 #define POPEVAL(cx) \
154 PL_in_eval = cx->blk_eval.old_in_eval; \
155 optype = cx->blk_eval.old_op_type; \
156 PL_eval_root = cx->blk_eval.old_eval_root;
173 #define PUSHLOOP(cx, ivar, s) \
174 cx->blk_loop.label = PL_curcop->cop_label; \
175 cx->blk_loop.resetsp = s - PL_stack_base; \
176 cx->blk_loop.redo_op = cLOOP->op_redoop; \
177 cx->blk_loop.next_op = cLOOP->op_nextop; \
178 cx->blk_loop.last_op = cLOOP->op_lastop; \
179 if (cx->blk_loop.itervar = (ivar)) \
180 cx->blk_loop.itersave = SvREFCNT_inc(*cx->blk_loop.itervar);\
181 cx->blk_loop.iterlval = Nullsv; \
182 cx->blk_loop.iterary = Nullav; \
183 cx->blk_loop.iterix = -1;
185 #define POPLOOP(cx) \
186 SvREFCNT_dec(cx->blk_loop.iterlval); \
187 if (cx->blk_loop.itervar) { \
188 sv_2mortal(*(cx->blk_loop.itervar)); \
189 *(cx->blk_loop.itervar) = cx->blk_loop.itersave; \
191 if (cx->blk_loop.iterary && cx->blk_loop.iterary != PL_curstack)\
192 SvREFCNT_dec(cx->blk_loop.iterary);
194 /* context common to subroutines, evals and loops */
196 I32 blku_oldsp; /* stack pointer to copy stuff down to */
197 COP * blku_oldcop; /* old curcop pointer */
198 I32 blku_oldretsp; /* return stack index */
199 I32 blku_oldmarksp; /* mark stack index */
200 I32 blku_oldscopesp; /* scope stack index */
201 PMOP * blku_oldpm; /* values of pattern match vars */
202 U8 blku_gimme; /* is this block running in list context? */
205 struct block_sub blku_sub;
206 struct block_eval blku_eval;
207 struct block_loop blku_loop;
210 #define blk_oldsp cx_u.cx_blk.blku_oldsp
211 #define blk_oldcop cx_u.cx_blk.blku_oldcop
212 #define blk_oldretsp cx_u.cx_blk.blku_oldretsp
213 #define blk_oldmarksp cx_u.cx_blk.blku_oldmarksp
214 #define blk_oldscopesp cx_u.cx_blk.blku_oldscopesp
215 #define blk_oldpm cx_u.cx_blk.blku_oldpm
216 #define blk_gimme cx_u.cx_blk.blku_gimme
217 #define blk_sub cx_u.cx_blk.blk_u.blku_sub
218 #define blk_eval cx_u.cx_blk.blk_u.blku_eval
219 #define blk_loop cx_u.cx_blk.blk_u.blku_loop
222 #define PUSHBLOCK(cx,t,sp) CXINC, cx = &cxstack[cxstack_ix], \
224 cx->blk_oldsp = sp - PL_stack_base, \
225 cx->blk_oldcop = PL_curcop, \
226 cx->blk_oldmarksp = PL_markstack_ptr - PL_markstack, \
227 cx->blk_oldscopesp = PL_scopestack_ix, \
228 cx->blk_oldretsp = PL_retstack_ix, \
229 cx->blk_oldpm = PL_curpm, \
230 cx->blk_gimme = gimme; \
231 DEBUG_l( PerlIO_printf(Perl_debug_log, "Entering block %ld, type %s\n", \
232 (long)cxstack_ix, PL_block_type[CxTYPE(cx)]); )
234 /* Exit a block (RETURN and LAST). */
235 #define POPBLOCK(cx,pm) cx = &cxstack[cxstack_ix--], \
236 newsp = PL_stack_base + cx->blk_oldsp, \
237 PL_curcop = cx->blk_oldcop, \
238 PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
239 PL_scopestack_ix = cx->blk_oldscopesp, \
240 PL_retstack_ix = cx->blk_oldretsp, \
241 pm = cx->blk_oldpm, \
242 gimme = cx->blk_gimme; \
243 DEBUG_l( PerlIO_printf(Perl_debug_log, "Leaving block %ld, type %s\n", \
244 (long)cxstack_ix+1,PL_block_type[CxTYPE(cx)]); )
246 /* Continue a block elsewhere (NEXT and REDO). */
247 #define TOPBLOCK(cx) cx = &cxstack[cxstack_ix], \
248 PL_stack_sp = PL_stack_base + cx->blk_oldsp, \
249 PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
250 PL_scopestack_ix = cx->blk_oldscopesp, \
251 PL_retstack_ix = cx->blk_oldretsp, \
252 PL_curpm = cx->blk_oldpm
254 /* substitution context */
271 #define sb_iters cx_u.cx_subst.sbu_iters
272 #define sb_maxiters cx_u.cx_subst.sbu_maxiters
273 #define sb_rflags cx_u.cx_subst.sbu_rflags
274 #define sb_oldsave cx_u.cx_subst.sbu_oldsave
275 #define sb_once cx_u.cx_subst.sbu_once
276 #define sb_rxtainted cx_u.cx_subst.sbu_rxtainted
277 #define sb_orig cx_u.cx_subst.sbu_orig
278 #define sb_dstr cx_u.cx_subst.sbu_dstr
279 #define sb_targ cx_u.cx_subst.sbu_targ
280 #define sb_s cx_u.cx_subst.sbu_s
281 #define sb_m cx_u.cx_subst.sbu_m
282 #define sb_strend cx_u.cx_subst.sbu_strend
283 #define sb_rxres cx_u.cx_subst.sbu_rxres
284 #define sb_rx cx_u.cx_subst.sbu_rx
286 #define PUSHSUBST(cx) CXINC, cx = &cxstack[cxstack_ix], \
287 cx->sb_iters = iters, \
288 cx->sb_maxiters = maxiters, \
289 cx->sb_rflags = r_flags, \
290 cx->sb_oldsave = oldsave, \
291 cx->sb_once = once, \
292 cx->sb_rxtainted = rxtainted, \
293 cx->sb_orig = orig, \
294 cx->sb_dstr = dstr, \
295 cx->sb_targ = targ, \
298 cx->sb_strend = strend, \
299 cx->sb_rxres = Null(void*), \
301 cx->cx_type = CXt_SUBST; \
302 rxres_save(&cx->sb_rxres, rx)
304 #define POPSUBST(cx) cx = &cxstack[cxstack_ix--]; \
305 rxres_free(&cx->sb_rxres)
308 U32 cx_type; /* what kind of context this is */
311 struct subst cx_subst;
315 #define CXTYPEMASK 0xff
323 /* private flags for CXt_EVAL */
324 #define CXp_REAL 0x00000100 /* truly eval'', not a lookalike */
326 #define CxTYPE(c) ((c)->cx_type & CXTYPEMASK)
327 #define CxREALEVAL(c) (((c)->cx_type & (CXt_EVAL|CXp_REAL)) == (CXt_EVAL|CXp_REAL))
329 #define CXINC (cxstack_ix < cxstack_max ? ++cxstack_ix : (cxstack_ix = cxinc()))
334 #define G_VOID 128 /* skip this bit when adding flags below */
336 /* extra flags for Perl_call_* routines */
337 #define G_DISCARD 2 /* Call FREETMPS. */
338 #define G_EVAL 4 /* Assume eval {} around subroutine call. */
339 #define G_NOARGS 8 /* Don't construct a @_ array. */
340 #define G_KEEPERR 16 /* Append errors to $@, don't overwrite it */
341 #define G_NODEBUG 32 /* Disable debugging at toplevel. */
343 /* flag bits for PL_in_eval */
344 #define EVAL_NULL 0 /* not in an eval */
345 #define EVAL_INEVAL 1 /* some enclosing scope is an eval */
346 #define EVAL_WARNONLY 2 /* used by yywarn() when calling yyerror() */
347 #define EVAL_KEEPERR 4 /* set by Perl_call_sv if G_KEEPERR */
349 /* Support for switching (stack and block) contexts.
350 * This ensures magic doesn't invalidate local stack and cx pointers.
353 #define PERLSI_UNKNOWN -1
354 #define PERLSI_UNDEF 0
355 #define PERLSI_MAIN 1
356 #define PERLSI_MAGIC 2
357 #define PERLSI_SORT 3
358 #define PERLSI_SIGNAL 4
359 #define PERLSI_OVERLOAD 5
360 #define PERLSI_DESTROY 6
361 #define PERLSI_WARNHOOK 7
362 #define PERLSI_DIEHOOK 8
363 #define PERLSI_REQUIRE 9
366 AV * si_stack; /* stack for current runlevel */
367 PERL_CONTEXT * si_cxstack; /* context stack for runlevel */
368 I32 si_cxix; /* current context index */
369 I32 si_cxmax; /* maximum allocated index */
370 I32 si_type; /* type of runlevel */
371 struct stackinfo * si_prev;
372 struct stackinfo * si_next;
373 I32 si_markoff; /* offset where markstack begins for us.
374 * currently used only with DEBUGGING,
375 * but not #ifdef-ed for bincompat */
378 typedef struct stackinfo PERL_SI;
380 #define cxstack (PL_curstackinfo->si_cxstack)
381 #define cxstack_ix (PL_curstackinfo->si_cxix)
382 #define cxstack_max (PL_curstackinfo->si_cxmax)
385 # define SET_MARK_OFFSET \
386 PL_curstackinfo->si_markoff = PL_markstack_ptr - PL_markstack
388 # define SET_MARK_OFFSET NOOP
391 #define PUSHSTACKi(type) \
393 PERL_SI *next = PL_curstackinfo->si_next; \
395 next = new_stackinfo(32, 2048/sizeof(PERL_CONTEXT) - 1); \
396 next->si_prev = PL_curstackinfo; \
397 PL_curstackinfo->si_next = next; \
399 next->si_type = type; \
400 next->si_cxix = -1; \
401 AvFILLp(next->si_stack) = 0; \
402 SWITCHSTACK(PL_curstack,next->si_stack); \
403 PL_curstackinfo = next; \
407 #define PUSHSTACK PUSHSTACKi(PERLSI_UNKNOWN)
409 /* POPSTACK works with PL_stack_sp, so it may need to be bracketed by
410 * PUTBACK/SPAGAIN to flush/refresh any local SP that may be active */
414 PERL_SI *prev = PL_curstackinfo->si_prev; \
416 PerlIO_printf(Perl_error_log, "panic: POPSTACK\n"); \
419 SWITCHSTACK(PL_curstack,prev->si_stack); \
420 /* don't free prev here, free them all at the END{} */ \
421 PL_curstackinfo = prev; \
424 #define POPSTACK_TO(s) \
426 while (PL_curstack != s) { \