This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
eliminate next_op from struct block_loop
[perl5.git] / cop.h
CommitLineData
a0d0e21e 1/* cop.h
79072805 2 *
1129b882 3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
8622e0e2 4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 by Larry Wall and others
79072805
LW
5 *
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
8 *
8622e0e2
RU
9 * Control ops (cops) are one of the two ops OP_NEXTSTATE and OP_DBSTATE,
10 * that (loosely speaking) are separate statements.
3ffa1527
JH
11 * They hold information important for lexical state and error reporting.
12 * At run time, PL_curcop is set to point to the most recently executed cop,
a3985cdc 13 * and thus can be used to determine our current state.
79072805
LW
14 */
15
0d2925a6 16/* A jmpenv packages the state required to perform a proper non-local jump.
1c98cc53
DM
17 * Note that there is a PL_start_env initialized when perl starts, and
18 * PL_top_env points to this initially, so PL_top_env should always be
19 * non-null.
0d2925a6 20 *
1c98cc53
DM
21 * Existence of a non-null PL_top_env->je_prev implies it is valid to call
22 * longjmp() at that runlevel (we make sure PL_start_env.je_prev is always
0d2925a6
DM
23 * null to ensure this).
24 *
25 * je_mustcatch, when set at any runlevel to TRUE, means eval ops must
26 * establish a local jmpenv to handle exception traps. Care must be taken
27 * to restore the previous value of je_mustcatch before exiting the
28 * stack frame iff JMPENV_PUSH was not called in that stack frame.
29 * GSAR 97-03-27
30 */
31
32struct jmpenv {
33 struct jmpenv * je_prev;
34 Sigjmp_buf je_buf; /* only for use if !je_throw */
35 int je_ret; /* last exception thrown */
36 bool je_mustcatch; /* need to call longjmp()? */
37};
38
39typedef struct jmpenv JMPENV;
40
41#ifdef OP_IN_REGISTER
42#define OP_REG_TO_MEM PL_opsave = op
43#define OP_MEM_TO_REG op = PL_opsave
44#else
45#define OP_REG_TO_MEM NOOP
46#define OP_MEM_TO_REG NOOP
47#endif
48
49/*
50 * How to build the first jmpenv.
51 *
52 * top_env needs to be non-zero. It points to an area
53 * in which longjmp() stuff is stored, as C callstack
54 * info there at least is thread specific this has to
55 * be per-thread. Otherwise a 'die' in a thread gives
56 * that thread the C stack of last thread to do an eval {}!
57 */
58
59#define JMPENV_BOOTSTRAP \
60 STMT_START { \
61 Zero(&PL_start_env, 1, JMPENV); \
62 PL_start_env.je_ret = -1; \
63 PL_start_env.je_mustcatch = TRUE; \
64 PL_top_env = &PL_start_env; \
65 } STMT_END
66
67/*
68 * PERL_FLEXIBLE_EXCEPTIONS
69 *
70 * All the flexible exceptions code has been removed.
71 * See the following threads for details:
72 *
73 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/2004-07/msg00378.html
74 *
75 * Joshua's original patches (which weren't applied) and discussion:
76 *
77 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg01396.html
78 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg01489.html
79 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg01491.html
80 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg01608.html
81 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg02144.html
82 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg02998.html
83 *
84 * Chip's reworked patch and discussion:
85 *
86 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1999-03/msg00520.html
87 *
88 * The flaw in these patches (which went unnoticed at the time) was
89 * that they moved some code that could potentially die() out of the
90 * region protected by the setjmp()s. This caused exceptions within
91 * END blocks and such to not be handled by the correct setjmp().
92 *
93 * The original patches that introduces flexible exceptions were:
94 *
95 * http://public.activestate.com/cgi-bin/perlbrowse?patch=3386
96 * http://public.activestate.com/cgi-bin/perlbrowse?patch=5162
97 */
98
99#define dJMPENV JMPENV cur_env
100
101#define JMPENV_PUSH(v) \
102 STMT_START { \
1c98cc53
DM
103 DEBUG_l({ \
104 int i = 0; JMPENV *p = PL_top_env; \
105 while (p) { i++; p = p->je_prev; } \
91e35ba1
DM
106 Perl_deb(aTHX_ "JUMPENV_PUSH level=%d at %s:%d\n", \
107 i, __FILE__, __LINE__);}) \
0d2925a6
DM
108 cur_env.je_prev = PL_top_env; \
109 OP_REG_TO_MEM; \
110 cur_env.je_ret = PerlProc_setjmp(cur_env.je_buf, SCOPE_SAVES_SIGNAL_MASK); \
111 OP_MEM_TO_REG; \
112 PL_top_env = &cur_env; \
113 cur_env.je_mustcatch = FALSE; \
114 (v) = cur_env.je_ret; \
115 } STMT_END
116
117#define JMPENV_POP \
118 STMT_START { \
1c98cc53
DM
119 DEBUG_l({ \
120 int i = -1; JMPENV *p = PL_top_env; \
121 while (p) { i++; p = p->je_prev; } \
91e35ba1
DM
122 Perl_deb(aTHX_ "JUMPENV_POP level=%d at %s:%d\n", \
123 i, __FILE__, __LINE__);}) \
d3ab86be 124 assert(PL_top_env == &cur_env); \
0d2925a6
DM
125 PL_top_env = cur_env.je_prev; \
126 } STMT_END
127
128#define JMPENV_JUMP(v) \
129 STMT_START { \
1c98cc53
DM
130 DEBUG_l({ \
131 int i = -1; JMPENV *p = PL_top_env; \
132 while (p) { i++; p = p->je_prev; } \
91e35ba1
DM
133 Perl_deb(aTHX_ "JUMPENV_JUMP(%d) level=%d at %s:%d\n", \
134 (int)v, i, __FILE__, __LINE__);}) \
0d2925a6
DM
135 OP_REG_TO_MEM; \
136 if (PL_top_env->je_prev) \
137 PerlProc_longjmp(PL_top_env->je_buf, (v)); \
138 if ((v) == 2) \
37038d91 139 PerlProc_exit(STATUS_EXIT); \
0d2925a6
DM
140 PerlIO_printf(PerlIO_stderr(), "panic: top_env\n"); \
141 PerlProc_exit(1); \
142 } STMT_END
143
144#define CATCH_GET (PL_top_env->je_mustcatch)
1c98cc53
DM
145#define CATCH_SET(v) \
146 STMT_START { \
147 DEBUG_l( \
148 Perl_deb(aTHX_ \
149 "JUMPLEVEL set catch %d => %d (for %p) at %s:%d\n", \
150 PL_top_env->je_mustcatch, v, (void*)PL_top_env, \
151 __FILE__, __LINE__);) \
152 PL_top_env->je_mustcatch = (v); \
153 } STMT_END
0d2925a6
DM
154
155
5ac1e9b2 156#include "mydtrace.h"
0d2925a6 157
79072805
LW
158struct cop {
159 BASEOP
d7f23a06
NC
160 /* On LP64 putting this here takes advantage of the fact that BASEOP isn't
161 an exact multiple of 8 bytes to save structure padding. */
162 line_t cop_line; /* line # of this command */
dca6062a 163 /* label for this construct is now stored in cop_hints_hash */
57843af0 164#ifdef USE_ITHREADS
11faa288 165 char * cop_stashpv; /* package line was compiled in */
57843af0
GS
166 char * cop_file; /* file name the following line # is from */
167#else
11faa288 168 HV * cop_stash; /* package line was compiled in */
79072805 169 GV * cop_filegv; /* file the following line # is from */
57843af0 170#endif
d5ec2987 171 U32 cop_hints; /* hints bits from pragmata */
a0d0e21e 172 U32 cop_seq; /* parse sequence number */
72dc9ed5
NC
173 /* Beware. mg.c and warnings.pl assume the type of this is STRLEN *: */
174 STRLEN * cop_warnings; /* lexical warnings bitmask */
b3ca2e83
NC
175 /* compile time state of %^H. See the comment in op.c for how this is
176 used to recreate a hash to return from caller. */
c28fe1ec 177 struct refcounted_he * cop_hints_hash;
79072805
LW
178};
179
57843af0
GS
180#ifdef USE_ITHREADS
181# define CopFILE(c) ((c)->cop_file)
182# define CopFILEGV(c) (CopFILE(c) \
a0714e2c 183 ? gv_fetchfile(CopFILE(c)) : NULL)
083fcd59 184
7e4e8c89
NC
185# ifdef NETWARE
186# define CopFILE_set(c,pv) ((c)->cop_file = savepv(pv))
d9095cec 187# define CopFILE_setn(c,pv,l) ((c)->cop_file = savepv((pv),(l)))
7e4e8c89
NC
188# else
189# define CopFILE_set(c,pv) ((c)->cop_file = savesharedpv(pv))
d9095cec 190# define CopFILE_setn(c,pv,l) ((c)->cop_file = savesharedpvn((pv),(l)))
7e4e8c89 191# endif
083fcd59 192
57843af0 193# define CopFILESV(c) (CopFILE(c) \
a0714e2c 194 ? GvSV(gv_fetchfile(CopFILE(c))) : NULL)
57843af0 195# define CopFILEAV(c) (CopFILE(c) \
7d49f689 196 ? GvAV(gv_fetchfile(CopFILE(c))) : NULL)
8688788e
SH
197# ifdef DEBUGGING
198# define CopFILEAVx(c) (assert(CopFILE(c)), \
36c7798d 199 GvAV(gv_fetchfile(CopFILE(c))))
8688788e
SH
200# else
201# define CopFILEAVx(c) (GvAV(gv_fetchfile(CopFILE(c))))
202# endif
57843af0 203# define CopSTASHPV(c) ((c)->cop_stashpv)
083fcd59 204
7e4e8c89 205# ifdef NETWARE
bd61b366 206# define CopSTASHPV_set(c,pv) ((c)->cop_stashpv = ((pv) ? savepv(pv) : NULL))
7e4e8c89
NC
207# else
208# define CopSTASHPV_set(c,pv) ((c)->cop_stashpv = savesharedpv(pv))
209# endif
083fcd59 210
11faa288 211# define CopSTASH(c) (CopSTASHPV(c) \
5c284bb0 212 ? gv_stashpv(CopSTASHPV(c),GV_ADD) : NULL)
bd61b366 213# define CopSTASH_set(c,hv) CopSTASHPV_set(c, (hv) ? HvNAME_get(hv) : NULL)
ed221c57 214# define CopSTASH_eq(c,hv) ((hv) && stashpv_hvname_match(c,hv))
7e4e8c89
NC
215# ifdef NETWARE
216# define CopSTASH_free(c) SAVECOPSTASH_FREE(c)
7e4e8c89
NC
217# define CopFILE_free(c) SAVECOPFILE_FREE(c)
218# else
ed221c57 219# define CopSTASH_free(c) PerlMemShared_free(CopSTASHPV(c))
bd61b366 220# define CopFILE_free(c) (PerlMemShared_free(CopFILE(c)),(CopFILE(c) = NULL))
7e4e8c89 221# endif
57843af0
GS
222#else
223# define CopFILEGV(c) ((c)->cop_filegv)
f4dd75d9
GS
224# define CopFILEGV_set(c,gv) ((c)->cop_filegv = (GV*)SvREFCNT_inc(gv))
225# define CopFILE_set(c,pv) CopFILEGV_set((c), gv_fetchfile(pv))
d9095cec 226# define CopFILE_setn(c,pv,l) CopFILEGV_set((c), gv_fetchfile_flags((pv),(l),0))
a0714e2c 227# define CopFILESV(c) (CopFILEGV(c) ? GvSV(CopFILEGV(c)) : NULL)
7d49f689 228# define CopFILEAV(c) (CopFILEGV(c) ? GvAV(CopFILEGV(c)) : NULL)
8688788e
SH
229# ifdef DEBUGGING
230# define CopFILEAVx(c) (assert(CopFILEGV(c)), GvAV(CopFILEGV(c)))
231# else
232# define CopFILEAVx(c) (GvAV(CopFILEGV(c)))
233# endif
be46dfad
RGS
234# define CopFILE(c) (CopFILEGV(c) && GvSV(CopFILEGV(c)) \
235 ? SvPVX(GvSV(CopFILEGV(c))) : NULL)
57843af0 236# define CopSTASH(c) ((c)->cop_stash)
f4dd75d9 237# define CopSTASH_set(c,hv) ((c)->cop_stash = (hv))
bd61b366 238# define CopSTASHPV(c) (CopSTASH(c) ? HvNAME_get(CopSTASH(c)) : NULL)
f4dd75d9
GS
239 /* cop_stash is not refcounted */
240# define CopSTASHPV_set(c,pv) CopSTASH_set((c), gv_stashpv(pv,GV_ADD))
241# define CopSTASH_eq(c,hv) (CopSTASH(c) == (hv))
05ec9bb3 242# define CopSTASH_free(c)
a0714e2c 243# define CopFILE_free(c) (SvREFCNT_dec(CopFILEGV(c)),(CopFILEGV(c) = NULL))
05ec9bb3 244
57843af0 245#endif /* USE_ITHREADS */
d6747b7a 246#define CopLABEL(c) Perl_fetch_cop_label(aTHX_ (c), NULL, NULL)
dca6062a 247#define CopLABEL_alloc(pv) ((pv)?savepv(pv):NULL)
57843af0 248
ed094faf 249#define CopSTASH_ne(c,hv) (!CopSTASH_eq(c,hv))
cc49e20b 250#define CopLINE(c) ((c)->cop_line)
57843af0
GS
251#define CopLINE_inc(c) (++CopLINE(c))
252#define CopLINE_dec(c) (--CopLINE(c))
253#define CopLINE_set(c,l) (CopLINE(c) = (l))
cc49e20b 254
248c2a4d 255/* OutCopFILE() is CopFILE for output (caller, die, warn, etc.) */
e37778c2 256#define OutCopFILE(c) CopFILE(c)
248c2a4d 257
7b0bddfa
NC
258/* If $[ is non-zero, it's stored in cop_hints under the key "$[", and
259 HINT_ARYBASE is set to indicate this.
260 Setting it is ineficient due to the need to create 2 mortal SVs, but as
261 using $[ is highly discouraged, no sane Perl code will be using it. */
262#define CopARYBASE_get(c) \
263 ((CopHINTS_get(c) & HINT_ARYBASE) \
c28fe1ec
NC
264 ? SvIV(Perl_refcounted_he_fetch(aTHX_ (c)->cop_hints_hash, 0, \
265 "$[", 2, 0, 0)) \
7b0bddfa
NC
266 : 0)
267#define CopARYBASE_set(c, b) STMT_START { \
d5ec2987
NC
268 if (b || ((c)->cop_hints & HINT_ARYBASE)) { \
269 (c)->cop_hints |= HINT_ARYBASE; \
f747ebd6
Z
270 if ((c) == &PL_compiling) { \
271 SV *val = newSViv(b); \
272 (void)hv_stores(GvHV(PL_hintgv), "$[", val); \
273 mg_set(val); \
274 PL_hints |= HINT_ARYBASE; \
275 } else { \
276 (c)->cop_hints_hash \
277 = Perl_refcounted_he_new(aTHX_ (c)->cop_hints_hash, \
84bafc02 278 newSVpvs_flags("$[", SVs_TEMP), \
7b0bddfa 279 sv_2mortal(newSViv(b))); \
f747ebd6 280 } \
7b0bddfa
NC
281 } \
282 } STMT_END
fc15ae8f 283
623e6609 284/* FIXME NATIVE_HINTS if this is changed from op_private (see perl.h) */
d5ec2987 285#define CopHINTS_get(c) ((c)->cop_hints + 0)
623e6609 286#define CopHINTS_set(c, h) STMT_START { \
d5ec2987 287 (c)->cop_hints = (h); \
623e6609
NC
288 } STMT_END
289
79072805
LW
290/*
291 * Here we have some enormously heavy (or at least ponderous) wizardry.
292 */
293
294/* subroutine context */
295struct block_sub {
f9c764c5 296 OP * retop; /* op to execute on exit from sub */
8e663997
NC
297 /* Above here is the same for sub, format and eval. */
298 CV * cv;
f9c764c5 299 /* Above here is the same for sub and format. */
79072805
LW
300 AV * savearray;
301 AV * argarray;
bb172083 302 I32 olddepth;
f3548bdc 303 PAD *oldcomppad;
f9c764c5
NC
304};
305
306
307/* format context */
308struct block_format {
f39bc417 309 OP * retop; /* op to execute on exit from sub */
8e663997
NC
310 /* Above here is the same for sub, format and eval. */
311 CV * cv;
f9c764c5
NC
312 /* Above here is the same for sub and format. */
313 GV * gv;
314 GV * dfoutgv;
79072805
LW
315};
316
b36bdeca
DM
317/* base for the next two macros. Don't use directly.
318 * Note that the refcnt of the cv is incremented twice; The CX one is
319 * decremented by LEAVESUB, the other by LEAVE. */
320
ee98a1d6 321#define PUSHSUB_BASE(cx) \
5ac1e9b2 322 ENTRY_PROBE(GvENAME(CvGV(cv)), \
c6903450
NC
323 CopFILE((const COP *)CvSTART(cv)), \
324 CopLINE((const COP *)CvSTART(cv))); \
5ac1e9b2 325 \
79072805 326 cx->blk_sub.cv = cv; \
b8f55b69 327 cx->blk_sub.olddepth = CvDEPTH(cv); \
ae423868 328 cx->cx_type |= (hasargs) ? CXp_HASARGS : 0; \
5f66b61c 329 cx->blk_sub.retop = NULL; \
b36bdeca 330 if (!CvDEPTH(cv)) { \
74c765eb
AL
331 SvREFCNT_inc_simple_void_NN(cv); \
332 SvREFCNT_inc_simple_void_NN(cv); \
b36bdeca
DM
333 SAVEFREESV(cv); \
334 }
335
ee98a1d6
DM
336
337#define PUSHSUB(cx) \
338 PUSHSUB_BASE(cx) \
446d0787 339 cx->blk_u16 = PL_op->op_private & \
cc8d50a7 340 (OPpLVAL_INTRO|OPpENTERSUB_INARGS);
79072805 341
ee98a1d6
DM
342/* variant for use by OP_DBSTATE, where op_private holds hint bits */
343#define PUSHSUB_DB(cx) \
344 PUSHSUB_BASE(cx) \
446d0787 345 cx->blk_u16 = 0;
ee98a1d6
DM
346
347
10067d9a 348#define PUSHFORMAT(cx, retop) \
f9c764c5
NC
349 cx->blk_format.cv = cv; \
350 cx->blk_format.gv = gv; \
351 cx->blk_format.retop = (retop); \
f9c764c5
NC
352 cx->blk_format.dfoutgv = PL_defoutgv; \
353 SvREFCNT_inc_void(cx->blk_format.dfoutgv)
79072805 354
3db8f154 355#define POP_SAVEARRAY() \
6d4ff0d2 356 STMT_START { \
3280af22 357 SvREFCNT_dec(GvAV(PL_defgv)); \
a8bba7fa 358 GvAV(PL_defgv) = cx->blk_sub.savearray; \
6d4ff0d2 359 } STMT_END
6d4ff0d2 360
ecf8e9dd 361/* junk in @_ spells trouble when cloning CVs and in pp_caller(), so don't
8e09340b
GS
362 * leave any (a fast av_clear(ary), basically) */
363#define CLEAR_ARGARRAY(ary) \
364 STMT_START { \
365 AvMAX(ary) += AvARRAY(ary) - AvALLOC(ary); \
9c6bc640 366 AvARRAY(ary) = AvALLOC(ary); \
8e09340b
GS
367 AvFILLp(ary) = -1; \
368 } STMT_END
7766f137 369
b0d9ce38
GS
370#define POPSUB(cx,sv) \
371 STMT_START { \
8f629a87
NC
372 RETURN_PROBE(GvENAME(CvGV((const CV*)cx->blk_sub.cv)), \
373 CopFILE((COP*)CvSTART((const CV*)cx->blk_sub.cv)), \
374 CopLINE((COP*)CvSTART((const CV*)cx->blk_sub.cv))); \
5ac1e9b2 375 \
bafb2adc 376 if (CxHASARGS(cx)) { \
7766f137 377 POP_SAVEARRAY(); \
d8b46c1b 378 /* abandon @_ if it got reified */ \
a8bba7fa 379 if (AvREAL(cx->blk_sub.argarray)) { \
e2d306cb 380 const SSize_t fill = AvFILLp(cx->blk_sub.argarray); \
a8bba7fa
GS
381 SvREFCNT_dec(cx->blk_sub.argarray); \
382 cx->blk_sub.argarray = newAV(); \
383 av_extend(cx->blk_sub.argarray, fill); \
11ca45c0 384 AvREIFY_only(cx->blk_sub.argarray); \
b1bc3f34 385 CX_CURPAD_SV(cx->blk_sub, 0) = MUTABLE_SV(cx->blk_sub.argarray); \
d8b46c1b 386 } \
7766f137 387 else { \
8e09340b 388 CLEAR_ARGARRAY(cx->blk_sub.argarray); \
7766f137 389 } \
79072805 390 } \
b1bc3f34 391 sv = MUTABLE_SV(cx->blk_sub.cv); \
8f629a87 392 if (sv && (CvDEPTH((const CV*)sv) = cx->blk_sub.olddepth)) \
a0714e2c 393 sv = NULL; \
b0d9ce38
GS
394 } STMT_END
395
396#define LEAVESUB(sv) \
397 STMT_START { \
398 if (sv) \
399 SvREFCNT_dec(sv); \
400 } STMT_END
79072805
LW
401
402#define POPFORMAT(cx) \
f9c764c5
NC
403 setdefout(cx->blk_format.dfoutgv); \
404 SvREFCNT_dec(cx->blk_format.dfoutgv);
79072805
LW
405
406/* eval context */
407struct block_eval {
8e663997
NC
408 OP * retop; /* op to execute on exit from eval */
409 /* Above here is the same for sub, format and eval. */
0f79a09d 410 SV * old_namesv;
79072805 411 OP * old_eval_root;
748a9306 412 SV * cur_text;
2090ab20 413 CV * cv;
abd70938 414 JMPENV * cur_top_env; /* value of PL_top_env when eval CX created */
79072805
LW
415};
416
17347a51
NC
417/* If we ever need more than 512 op types, change the shift from 7.
418 blku_gimme is actually also only 2 bits, so could be merged with something.
419*/
420
421#define CxOLD_IN_EVAL(cx) (((cx)->blk_u16) & 0x7F)
422#define CxOLD_OP_TYPE(cx) (((cx)->blk_u16) >> 7)
85a64632 423
6b75f042 424#define PUSHEVAL(cx,n) \
0f79a09d 425 STMT_START { \
17347a51
NC
426 assert(!(PL_in_eval & ~0x7F)); \
427 assert(!(PL_op->op_type & ~0x1FF)); \
428 cx->blk_u16 = (PL_in_eval & 0x7F) | ((U16)PL_op->op_type << 7); \
a0714e2c 429 cx->blk_eval.old_namesv = (n ? newSVpv(n,0) : NULL); \
a8bba7fa 430 cx->blk_eval.old_eval_root = PL_eval_root; \
bdc0bf6f 431 cx->blk_eval.cur_text = PL_parser ? PL_parser->linestr : NULL; \
601f1833 432 cx->blk_eval.cv = NULL; /* set by doeval(), as applicable */ \
5f66b61c 433 cx->blk_eval.retop = NULL; \
abd70938 434 cx->blk_eval.cur_top_env = PL_top_env; \
0f79a09d 435 } STMT_END
79072805
LW
436
437#define POPEVAL(cx) \
0f79a09d 438 STMT_START { \
85a64632
NC
439 PL_in_eval = CxOLD_IN_EVAL(cx); \
440 optype = CxOLD_OP_TYPE(cx); \
7766f137 441 PL_eval_root = cx->blk_eval.old_eval_root; \
0f79a09d
GS
442 if (cx->blk_eval.old_namesv) \
443 sv_2mortal(cx->blk_eval.old_namesv); \
444 } STMT_END
79072805
LW
445
446/* loop context */
447struct block_loop {
79072805 448 I32 resetsp;
022eaa24 449 LOOP * my_op; /* My op, that contains redo, next and last ops. */
7766f137 450#ifdef USE_ITHREADS
e846cb92
NC
451 PAD *oldcomppad; /* Also used for the GV, if targoffset is 0 */
452 /* This is also accesible via cx->blk_loop.my_op->op_targ */
453 PADOFFSET targoffset;
7766f137 454#else
79072805 455 SV ** itervar;
7766f137 456#endif
493b0a3c 457 union {
d01136d6
BS
458 struct { /* valid if type is LOOP_FOR or LOOP_PLAIN (but {NULL,0})*/
459 AV * ary; /* use the stack if this is NULL */
460 IV ix;
461 } ary;
462 struct { /* valid if type is LOOP_LAZYIV */
463 IV cur;
464 IV end;
465 } lazyiv;
466 struct { /* valid if type if LOOP_LAZYSV */
467 SV * cur;
468 SV * end; /* maxiumum value (or minimum in reverse) */
469 } lazysv;
470 } state_u;
79072805
LW
471};
472
7766f137
GS
473#ifdef USE_ITHREADS
474# define CxITERVAR(c) \
e846cb92
NC
475 ((c)->blk_loop.oldcomppad \
476 ? (CxPADLOOP(c) \
477 ? &CX_CURPAD_SV( (c)->blk_loop, (c)->blk_loop.targoffset ) \
478 : &GvSV((GV*)(c)->blk_loop.oldcomppad)) \
7766f137 479 : (SV**)NULL)
e846cb92
NC
480# define CX_ITERDATA_SET(cx,idata,o) \
481 if ((cx->blk_loop.targoffset = (o))) \
482 CX_CURPAD_SAVE(cx->blk_loop); \
483 else \
484 cx->blk_loop.oldcomppad = (idata);
7766f137
GS
485#else
486# define CxITERVAR(c) ((c)->blk_loop.itervar)
e846cb92 487# define CX_ITERDATA_SET(cx,ivar,o) \
09edbca0 488 cx->blk_loop.itervar = (SV**)(ivar);
7766f137 489#endif
b1cf8b36 490#define CxLABEL(c) (0 + CopLABEL((c)->blk_oldcop))
ae423868 491#define CxHASARGS(c) (((c)->cx_type & CXp_HASARGS) == CXp_HASARGS)
446d0787 492#define CxLVAL(c) (0 + (c)->blk_u16)
7766f137 493
3b719c58
NC
494#define PUSHLOOP_PLAIN(cx, s) \
495 cx->blk_loop.resetsp = s - PL_stack_base; \
496 cx->blk_loop.my_op = cLOOP; \
d01136d6
BS
497 cx->blk_loop.state_u.ary.ary = NULL; \
498 cx->blk_loop.state_u.ary.ix = 0; \
e846cb92 499 CX_ITERDATA_SET(cx, NULL, 0);
3b719c58 500
e846cb92 501#define PUSHLOOP_FOR(cx, dat, s, offset) \
38a230cb 502 cx->blk_loop.resetsp = s - PL_stack_base; \
022eaa24 503 cx->blk_loop.my_op = cLOOP; \
d01136d6
BS
504 cx->blk_loop.state_u.ary.ary = NULL; \
505 cx->blk_loop.state_u.ary.ix = 0; \
e846cb92 506 CX_ITERDATA_SET(cx, dat, offset);
79072805
LW
507
508#define POPLOOP(cx) \
d01136d6
BS
509 if (CxTYPE(cx) == CXt_LOOP_LAZYSV) { \
510 SvREFCNT_dec(cx->blk_loop.state_u.lazysv.cur); \
511 SvREFCNT_dec(cx->blk_loop.state_u.lazysv.end); \
512 } \
d01136d6
BS
513 if (CxTYPE(cx) == CXt_LOOP_FOR) \
514 SvREFCNT_dec(cx->blk_loop.state_u.ary.ary);
79072805 515
0d863452
RH
516/* given/when context */
517struct block_givwhen {
518 OP *leave_op;
519};
520
521#define PUSHGIVEN(cx) \
522 cx->blk_givwhen.leave_op = cLOGOP->op_other;
523
524#define PUSHWHEN PUSHGIVEN
525
79072805
LW
526/* context common to subroutines, evals and loops */
527struct block {
446d0787 528 U8 blku_type; /* what kind of context this is */
2e0df0e8 529 U8 blku_gimme; /* is this block running in list context? */
17347a51 530 U16 blku_u16; /* used by block_sub and block_eval (so far) */
79072805
LW
531 I32 blku_oldsp; /* stack pointer to copy stuff down to */
532 COP * blku_oldcop; /* old curcop pointer */
79072805
LW
533 I32 blku_oldmarksp; /* mark stack index */
534 I32 blku_oldscopesp; /* scope stack index */
535 PMOP * blku_oldpm; /* values of pattern match vars */
79072805
LW
536
537 union {
538 struct block_sub blku_sub;
f9c764c5 539 struct block_format blku_format;
79072805
LW
540 struct block_eval blku_eval;
541 struct block_loop blku_loop;
0d863452 542 struct block_givwhen blku_givwhen;
79072805
LW
543 } blk_u;
544};
545#define blk_oldsp cx_u.cx_blk.blku_oldsp
546#define blk_oldcop cx_u.cx_blk.blku_oldcop
79072805
LW
547#define blk_oldmarksp cx_u.cx_blk.blku_oldmarksp
548#define blk_oldscopesp cx_u.cx_blk.blku_oldscopesp
549#define blk_oldpm cx_u.cx_blk.blku_oldpm
550#define blk_gimme cx_u.cx_blk.blku_gimme
446d0787 551#define blk_u16 cx_u.cx_blk.blku_u16
79072805 552#define blk_sub cx_u.cx_blk.blk_u.blku_sub
f9c764c5 553#define blk_format cx_u.cx_blk.blk_u.blku_format
79072805
LW
554#define blk_eval cx_u.cx_blk.blk_u.blku_eval
555#define blk_loop cx_u.cx_blk.blk_u.blku_loop
0d863452 556#define blk_givwhen cx_u.cx_blk.blk_u.blku_givwhen
79072805 557
1c98cc53 558#define DEBUG_CX(action) \
d9f81b50 559 DEBUG_l( \
1c98cc53
DM
560 Perl_deb(aTHX_ "CX %ld %s %s (scope %ld,%ld) at %s:%d\n", \
561 (long)cxstack_ix, \
562 action, \
563 PL_block_type[CxTYPE(&cxstack[cxstack_ix])], \
564 (long)PL_scopestack_ix, \
565 (long)(cxstack[cxstack_ix].blk_oldscopesp), \
d9f81b50 566 __FILE__, __LINE__));
1c98cc53 567
79072805 568/* Enter a block. */
8990e307 569#define PUSHBLOCK(cx,t,sp) CXINC, cx = &cxstack[cxstack_ix], \
79072805 570 cx->cx_type = t, \
3280af22
NIS
571 cx->blk_oldsp = sp - PL_stack_base, \
572 cx->blk_oldcop = PL_curcop, \
1aff0e91 573 cx->blk_oldmarksp = PL_markstack_ptr - PL_markstack, \
3280af22 574 cx->blk_oldscopesp = PL_scopestack_ix, \
3280af22 575 cx->blk_oldpm = PL_curpm, \
eb160463 576 cx->blk_gimme = (U8)gimme; \
1c98cc53 577 DEBUG_CX("PUSH");
79072805
LW
578
579/* Exit a block (RETURN and LAST). */
1c98cc53
DM
580#define POPBLOCK(cx,pm) \
581 DEBUG_CX("POP"); \
582 cx = &cxstack[cxstack_ix--], \
1aff0e91 583 newsp = PL_stack_base + cx->blk_oldsp, \
3280af22
NIS
584 PL_curcop = cx->blk_oldcop, \
585 PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
586 PL_scopestack_ix = cx->blk_oldscopesp, \
3280af22 587 pm = cx->blk_oldpm, \
1c98cc53 588 gimme = cx->blk_gimme;
79072805
LW
589
590/* Continue a block elsewhere (NEXT and REDO). */
1c98cc53
DM
591#define TOPBLOCK(cx) \
592 DEBUG_CX("TOP"); \
593 cx = &cxstack[cxstack_ix], \
1aff0e91 594 PL_stack_sp = PL_stack_base + cx->blk_oldsp, \
3280af22
NIS
595 PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
596 PL_scopestack_ix = cx->blk_oldscopesp, \
1c98cc53 597 PL_curpm = cx->blk_oldpm;
79072805
LW
598
599/* substitution context */
600struct subst {
446d0787 601 U8 sbu_type; /* what kind of context this is */
1ed74d04 602 U8 sbu_rflags;
446d0787 603 U16 sbu_rxtainted; /* matches struct block */
79072805
LW
604 I32 sbu_iters;
605 I32 sbu_maxiters;
4633a7c4 606 I32 sbu_oldsave;
79072805
LW
607 char * sbu_orig;
608 SV * sbu_dstr;
609 SV * sbu_targ;
610 char * sbu_s;
611 char * sbu_m;
612 char * sbu_strend;
c90c0ff4 613 void * sbu_rxres;
c07a80fd 614 REGEXP * sbu_rx;
79072805
LW
615};
616#define sb_iters cx_u.cx_subst.sbu_iters
617#define sb_maxiters cx_u.cx_subst.sbu_maxiters
22e551b9 618#define sb_rflags cx_u.cx_subst.sbu_rflags
4633a7c4 619#define sb_oldsave cx_u.cx_subst.sbu_oldsave
71be2cbc
PP
620#define sb_once cx_u.cx_subst.sbu_once
621#define sb_rxtainted cx_u.cx_subst.sbu_rxtainted
79072805
LW
622#define sb_orig cx_u.cx_subst.sbu_orig
623#define sb_dstr cx_u.cx_subst.sbu_dstr
624#define sb_targ cx_u.cx_subst.sbu_targ
625#define sb_s cx_u.cx_subst.sbu_s
626#define sb_m cx_u.cx_subst.sbu_m
627#define sb_strend cx_u.cx_subst.sbu_strend
c90c0ff4 628#define sb_rxres cx_u.cx_subst.sbu_rxres
c07a80fd 629#define sb_rx cx_u.cx_subst.sbu_rx
79072805 630
9c105995
NC
631#ifdef PERL_CORE
632# define PUSHSUBST(cx) CXINC, cx = &cxstack[cxstack_ix], \
79072805
LW
633 cx->sb_iters = iters, \
634 cx->sb_maxiters = maxiters, \
22e551b9 635 cx->sb_rflags = r_flags, \
4633a7c4 636 cx->sb_oldsave = oldsave, \
71be2cbc 637 cx->sb_rxtainted = rxtainted, \
79072805
LW
638 cx->sb_orig = orig, \
639 cx->sb_dstr = dstr, \
640 cx->sb_targ = targ, \
641 cx->sb_s = s, \
642 cx->sb_m = m, \
643 cx->sb_strend = strend, \
4608196e 644 cx->sb_rxres = NULL, \
c07a80fd 645 cx->sb_rx = rx, \
1ed74d04 646 cx->cx_type = CXt_SUBST | (once ? CXp_ONCE : 0); \
e22ae1e2 647 rxres_save(&cx->sb_rxres, rx); \
b69b0499 648 (void)ReREFCNT_inc(rx)
79072805 649
9c105995 650# define POPSUBST(cx) cx = &cxstack[cxstack_ix--]; \
e22ae1e2
DM
651 rxres_free(&cx->sb_rxres); \
652 ReREFCNT_dec(cx->sb_rx)
9c105995
NC
653#endif
654
655#define CxONCE(cx) ((cx)->cx_type & CXp_ONCE)
79072805
LW
656
657struct context {
79072805
LW
658 union {
659 struct block cx_blk;
660 struct subst cx_subst;
661 } cx_u;
662};
2e0df0e8 663#define cx_type cx_u.cx_subst.sbu_type
6b35e009 664
76753e7f
NC
665/* If you re-order these, there is also an array of uppercase names in perl.h
666 and a static array of context names in pp_ctl.c */
3701055e 667#define CXTYPEMASK 0xf
79072805 668#define CXt_NULL 0
76753e7f
NC
669#define CXt_WHEN 1
670#define CXt_BLOCK 2
671/* When micro-optimising :-) keep GIVEN next to the LOOPs, as these 5 share a
672 jump table in pp_ctl.c
673 The first 4 don't have a 'case' in at least one switch statement in pp_ctl.c
674*/
675#define CXt_GIVEN 3
c6fdafd0 676/* This is first so that CXt_LOOP_FOR|CXt_LOOP_LAZYIV is CXt_LOOP_LAZYIV */
76753e7f
NC
677#define CXt_LOOP_FOR 4
678#define CXt_LOOP_PLAIN 5
679#define CXt_LOOP_LAZYSV 6
680#define CXt_LOOP_LAZYIV 7
681#define CXt_SUB 8
682#define CXt_FORMAT 9
683#define CXt_EVAL 10
684#define CXt_SUBST 11
685/* SUBST doesn't feature in all switch statements. */
79072805 686
3701055e
NC
687/* private flags for CXt_SUB and CXt_NULL
688 However, this is checked in many places which do not check the type, so
689 this bit needs to be kept clear for most everything else. For reasons I
690 haven't investigated, it can coexist with CXp_FOR_DEF */
1f27d788
NC
691#define CXp_MULTICALL 0x10 /* part of a multicall (so don't
692 tear down context on exit). */
9850bf21 693
ae423868 694/* private flags for CXt_SUB and CXt_FORMAT */
1f27d788 695#define CXp_HASARGS 0x20
ae423868 696
6b35e009 697/* private flags for CXt_EVAL */
1f27d788
NC
698#define CXp_REAL 0x20 /* truly eval'', not a lookalike */
699#define CXp_TRYBLOCK 0x40 /* eval{}, not eval'' or similar */
6b35e009 700
7766f137 701/* private flags for CXt_LOOP */
1f27d788 702#define CXp_FOR_DEF 0x10 /* foreach using $_ */
0d863452 703#ifdef USE_ITHREADS
e846cb92 704# define CxPADLOOP(c) ((c)->blk_loop.targoffset)
7766f137 705#endif
e846cb92 706
1ed74d04
NC
707/* private flags for CXt_SUBST */
708#define CXp_ONCE 0x10 /* What was sbu_once in struct subst */
7766f137 709
6b35e009 710#define CxTYPE(c) ((c)->cx_type & CXTYPEMASK)
76753e7f 711#define CxTYPE_is_LOOP(c) (((c)->cx_type & 0xC) == 0x4)
9850bf21
RH
712#define CxMULTICALL(c) (((c)->cx_type & CXp_MULTICALL) \
713 == CXp_MULTICALL)
0588a150 714#define CxREALEVAL(c) (((c)->cx_type & (CXTYPEMASK|CXp_REAL)) \
7766f137 715 == (CXt_EVAL|CXp_REAL))
0588a150 716#define CxTRYBLOCK(c) (((c)->cx_type & (CXTYPEMASK|CXp_TRYBLOCK)) \
1d76a5c3 717 == (CXt_EVAL|CXp_TRYBLOCK))
3b719c58
NC
718#define CxFOREACH(c) (CxTYPE_is_LOOP(c) && CxTYPE(c) != CXt_LOOP_PLAIN)
719#define CxFOREACHDEF(c) ((CxTYPE_is_LOOP(c) && CxTYPE(c) != CXt_LOOP_PLAIN) \
720 && ((c)->cx_type & CXp_FOR_DEF))
6b35e009 721
109bf713 722#define CXINC (cxstack_ix < cxstack_max ? ++cxstack_ix : (cxstack_ix = cxinc()))
79072805 723
ccfc67b7
JH
724/*
725=head1 "Gimme" Values
726*/
954c1994
GS
727
728/*
729=for apidoc AmU||G_SCALAR
730Used to indicate scalar context. See C<GIMME_V>, C<GIMME>, and
731L<perlcall>.
732
733=for apidoc AmU||G_ARRAY
91e74348 734Used to indicate list context. See C<GIMME_V>, C<GIMME> and
954c1994
GS
735L<perlcall>.
736
737=for apidoc AmU||G_VOID
738Used to indicate void context. See C<GIMME_V> and L<perlcall>.
739
740=for apidoc AmU||G_DISCARD
741Indicates that arguments returned from a callback should be discarded. See
742L<perlcall>.
743
744=for apidoc AmU||G_EVAL
745
746Used to force a Perl C<eval> wrapper around a callback. See
747L<perlcall>.
748
749=for apidoc AmU||G_NOARGS
750
751Indicates that no arguments are being sent to a callback. See
752L<perlcall>.
753
754=cut
755*/
756
2f8edad0
NC
757#define G_SCALAR 2
758#define G_ARRAY 3
759#define G_VOID 1
760#define G_WANT 3
79072805 761
864dbfa3 762/* extra flags for Perl_call_* routines */
2f8edad0 763#define G_DISCARD 4 /* Call FREETMPS.
b54b4831
NC
764 Don't change this without consulting the
765 hash actions codes defined in hv.h */
2f8edad0
NC
766#define G_EVAL 8 /* Assume eval {} around subroutine call. */
767#define G_NOARGS 16 /* Don't construct a @_ array. */
7ce09284 768#define G_KEEPERR 32 /* Warn for errors, don't overwrite $@ */
2f8edad0
NC
769#define G_NODEBUG 64 /* Disable debugging at toplevel. */
770#define G_METHOD 128 /* Calling method. */
c40f1585 771#define G_FAKINGEVAL 256 /* Faking an eval context for call_sv or
edb2152a 772 fold_constants. */
67549bd2
NC
773#define G_UNDEF_FILL 512 /* Fill the stack with &PL_sv_undef
774 A special case for UNSHIFT in
775 Perl_magic_methcall(). */
e336de0d 776
faef0170
HS
777/* flag bits for PL_in_eval */
778#define EVAL_NULL 0 /* not in an eval */
779#define EVAL_INEVAL 1 /* some enclosing scope is an eval */
780#define EVAL_WARNONLY 2 /* used by yywarn() when calling yyerror() */
864dbfa3 781#define EVAL_KEEPERR 4 /* set by Perl_call_sv if G_KEEPERR */
6dc8a9e4 782#define EVAL_INREQUIRE 8 /* The code is being required. */
faef0170 783
e336de0d
GS
784/* Support for switching (stack and block) contexts.
785 * This ensures magic doesn't invalidate local stack and cx pointers.
786 */
787
e788e7d3
GS
788#define PERLSI_UNKNOWN -1
789#define PERLSI_UNDEF 0
790#define PERLSI_MAIN 1
791#define PERLSI_MAGIC 2
792#define PERLSI_SORT 3
793#define PERLSI_SIGNAL 4
794#define PERLSI_OVERLOAD 5
795#define PERLSI_DESTROY 6
796#define PERLSI_WARNHOOK 7
797#define PERLSI_DIEHOOK 8
798#define PERLSI_REQUIRE 9
e336de0d
GS
799
800struct stackinfo {
801 AV * si_stack; /* stack for current runlevel */
802 PERL_CONTEXT * si_cxstack; /* context stack for runlevel */
9bd87817
NC
803 struct stackinfo * si_prev;
804 struct stackinfo * si_next;
e336de0d
GS
805 I32 si_cxix; /* current context index */
806 I32 si_cxmax; /* maximum allocated index */
807 I32 si_type; /* type of runlevel */
ce2f7c3b 808 I32 si_markoff; /* offset where markstack begins for us.
e336de0d
GS
809 * currently used only with DEBUGGING,
810 * but not #ifdef-ed for bincompat */
811};
812
813typedef struct stackinfo PERL_SI;
814
3280af22
NIS
815#define cxstack (PL_curstackinfo->si_cxstack)
816#define cxstack_ix (PL_curstackinfo->si_cxix)
817#define cxstack_max (PL_curstackinfo->si_cxmax)
e336de0d
GS
818
819#ifdef DEBUGGING
ce2f7c3b
GS
820# define SET_MARK_OFFSET \
821 PL_curstackinfo->si_markoff = PL_markstack_ptr - PL_markstack
e336de0d 822#else
ce2f7c3b 823# define SET_MARK_OFFSET NOOP
e336de0d
GS
824#endif
825
d3acc0f7 826#define PUSHSTACKi(type) \
e336de0d 827 STMT_START { \
3280af22 828 PERL_SI *next = PL_curstackinfo->si_next; \
1c98cc53
DM
829 DEBUG_l({ \
830 int i = 0; PERL_SI *p = PL_curstackinfo; \
831 while (p) { i++; p = p->si_prev; } \
832 Perl_deb(aTHX_ "push STACKINFO %d at %s:%d\n", \
833 i, __FILE__, __LINE__);}) \
e336de0d
GS
834 if (!next) { \
835 next = new_stackinfo(32, 2048/sizeof(PERL_CONTEXT) - 1); \
3280af22
NIS
836 next->si_prev = PL_curstackinfo; \
837 PL_curstackinfo->si_next = next; \
e336de0d
GS
838 } \
839 next->si_type = type; \
840 next->si_cxix = -1; \
841 AvFILLp(next->si_stack) = 0; \
3280af22
NIS
842 SWITCHSTACK(PL_curstack,next->si_stack); \
843 PL_curstackinfo = next; \
ce2f7c3b 844 SET_MARK_OFFSET; \
e336de0d
GS
845 } STMT_END
846
e788e7d3 847#define PUSHSTACK PUSHSTACKi(PERLSI_UNKNOWN)
d3acc0f7 848
3095d977
GS
849/* POPSTACK works with PL_stack_sp, so it may need to be bracketed by
850 * PUTBACK/SPAGAIN to flush/refresh any local SP that may be active */
d3acc0f7 851#define POPSTACK \
e336de0d 852 STMT_START { \
39644a26 853 dSP; \
c4420975 854 PERL_SI * const prev = PL_curstackinfo->si_prev; \
1c98cc53
DM
855 DEBUG_l({ \
856 int i = -1; PERL_SI *p = PL_curstackinfo; \
857 while (p) { i++; p = p->si_prev; } \
858 Perl_deb(aTHX_ "pop STACKINFO %d at %s:%d\n", \
859 i, __FILE__, __LINE__);}) \
e336de0d 860 if (!prev) { \
bf49b057 861 PerlIO_printf(Perl_error_log, "panic: POPSTACK\n"); \
e336de0d
GS
862 my_exit(1); \
863 } \
3280af22 864 SWITCHSTACK(PL_curstack,prev->si_stack); \
e336de0d 865 /* don't free prev here, free them all at the END{} */ \
3280af22 866 PL_curstackinfo = prev; \
e336de0d
GS
867 } STMT_END
868
869#define POPSTACK_TO(s) \
870 STMT_START { \
3280af22 871 while (PL_curstack != s) { \
bac4b2ad 872 dounwind(-1); \
d3acc0f7 873 POPSTACK; \
bac4b2ad 874 } \
e336de0d 875 } STMT_END
923e4eb5
JH
876
877#define IN_PERL_COMPILETIME (PL_curcop == &PL_compiling)
878#define IN_PERL_RUNTIME (PL_curcop != &PL_compiling)
879
9850bf21
RH
880/*
881=head1 Multicall Functions
882
883=for apidoc Ams||dMULTICALL
884Declare local variables for a multicall. See L<perlcall/Lightweight Callbacks>.
885
886=for apidoc Ams||PUSH_MULTICALL
887Opening bracket for a lightweight callback.
888See L<perlcall/Lightweight Callbacks>.
889
890=for apidoc Ams||MULTICALL
891Make a lightweight callback. See L<perlcall/Lightweight Callbacks>.
892
893=for apidoc Ams||POP_MULTICALL
894Closing bracket for a lightweight callback.
895See L<perlcall/Lightweight Callbacks>.
896
897=cut
898*/
899
900#define dMULTICALL \
901 SV **newsp; /* set by POPBLOCK */ \
902 PERL_CONTEXT *cx; \
82f35e8b 903 CV *multicall_cv; \
9850bf21
RH
904 OP *multicall_cop; \
905 bool multicall_oldcatch; \
906 U8 hasargs = 0 /* used by PUSHSUB */
907
82f35e8b 908#define PUSH_MULTICALL(the_cv) \
9850bf21 909 STMT_START { \
0bcc34c2
AL
910 CV * const _nOnclAshIngNamE_ = the_cv; \
911 CV * const cv = _nOnclAshIngNamE_; \
912 AV * const padlist = CvPADLIST(cv); \
9850bf21
RH
913 ENTER; \
914 multicall_oldcatch = CATCH_GET; \
915 SAVETMPS; SAVEVPTR(PL_op); \
916 CATCH_SET(TRUE); \
1bbbfc50 917 PUSHSTACKi(PERLSI_SORT); \
9850bf21
RH
918 PUSHBLOCK(cx, CXt_SUB|CXp_MULTICALL, PL_stack_sp); \
919 PUSHSUB(cx); \
920 if (++CvDEPTH(cv) >= 2) { \
921 PERL_STACK_OVERFLOW_CHECK(); \
922 Perl_pad_push(aTHX_ padlist, CvDEPTH(cv)); \
923 } \
924 SAVECOMPPAD(); \
925 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv)); \
82f35e8b 926 multicall_cv = cv; \
9850bf21
RH
927 multicall_cop = CvSTART(cv); \
928 } STMT_END
929
930#define MULTICALL \
931 STMT_START { \
932 PL_op = multicall_cop; \
933 CALLRUNOPS(aTHX); \
934 } STMT_END
935
936#define POP_MULTICALL \
937 STMT_START { \
82f35e8b
RH
938 LEAVESUB(multicall_cv); \
939 CvDEPTH(multicall_cv)--; \
9850bf21 940 POPBLOCK(cx,PL_curpm); \
1bbbfc50 941 POPSTACK; \
9850bf21
RH
942 CATCH_SET(multicall_oldcatch); \
943 LEAVE; \
1bbbfc50 944 SPAGAIN; \
9850bf21 945 } STMT_END
b3ca2e83
NC
946
947/*
948 * Local variables:
949 * c-indentation-style: bsd
950 * c-basic-offset: 4
951 * indent-tabs-mode: t
952 * End:
953 *
954 * ex: set ts=8 sts=4 sw=4 noet:
955 */