This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
Change utf8.t to use a \xb7 delimiter once more.
[perl5.git] / cop.h
... / ...
CommitLineData
1/* cop.h
2 *
3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009 by Larry Wall and others
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 *
9 * Control ops (cops) are one of the two ops OP_NEXTSTATE and OP_DBSTATE,
10 * that (loosely speaking) are separate statements.
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,
13 * and thus can be used to determine our current state.
14 */
15
16/* A jmpenv packages the state required to perform a proper non-local jump.
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.
20 *
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
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 { \
103 DEBUG_l({ \
104 int i = 0; JMPENV *p = PL_top_env; \
105 while (p) { i++; p = p->je_prev; } \
106 Perl_deb(aTHX_ "JUMPENV_PUSH level=%d at %s:%d\n", \
107 i, __FILE__, __LINE__);}) \
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 { \
119 DEBUG_l({ \
120 int i = -1; JMPENV *p = PL_top_env; \
121 while (p) { i++; p = p->je_prev; } \
122 Perl_deb(aTHX_ "JUMPENV_POP level=%d at %s:%d\n", \
123 i, __FILE__, __LINE__);}) \
124 assert(PL_top_env == &cur_env); \
125 PL_top_env = cur_env.je_prev; \
126 } STMT_END
127
128#define JMPENV_JUMP(v) \
129 STMT_START { \
130 DEBUG_l({ \
131 int i = -1; JMPENV *p = PL_top_env; \
132 while (p) { i++; p = p->je_prev; } \
133 Perl_deb(aTHX_ "JUMPENV_JUMP(%d) level=%d at %s:%d\n", \
134 (int)v, i, __FILE__, __LINE__);}) \
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) \
139 PerlProc_exit(STATUS_EXIT); \
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)
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
154
155/*
156=head1 COP Hint Hashes
157*/
158
159typedef struct refcounted_he COPHH;
160
161#define COPHH_KEY_UTF8 REFCOUNTED_HE_KEY_UTF8
162
163/*
164=for apidoc Amx|SV *|cophh_fetch_pvn|const COPHH *cophh|const char *keypv|STRLEN keylen|U32 hash|U32 flags
165
166Look up the entry in the cop hints hash I<cophh> with the key specified by
167I<keypv> and I<keylen>. If I<flags> has the C<COPHH_KEY_UTF8> bit set,
168the key octets are interpreted as UTF-8, otherwise they are interpreted
169as Latin-1. I<hash> is a precomputed hash of the key string, or zero if
170it has not been precomputed. Returns a mortal scalar copy of the value
171associated with the key, or C<&PL_sv_placeholder> if there is no value
172associated with the key.
173
174=cut
175*/
176
177#define cophh_fetch_pvn(cophh, keypv, keylen, hash, flags) \
178 Perl_refcounted_he_fetch_pvn(aTHX_ cophh, keypv, keylen, hash, flags)
179
180/*
181=for apidoc Amx|SV *|cophh_fetch_pvs|const COPHH *cophh|const char *key|U32 flags
182
183Like L</cophh_fetch_pvn>, but takes a literal string instead of a
184string/length pair, and no precomputed hash.
185
186=cut
187*/
188
189#define cophh_fetch_pvs(cophh, key, flags) \
190 Perl_refcounted_he_fetch_pvn(aTHX_ cophh, STR_WITH_LEN(key), 0, flags)
191
192/*
193=for apidoc Amx|SV *|cophh_fetch_pv|const COPHH *cophh|const char *key|U32 hash|U32 flags
194
195Like L</cophh_fetch_pvn>, but takes a nul-terminated string instead of
196a string/length pair.
197
198=cut
199*/
200
201#define cophh_fetch_pv(cophh, key, hash, flags) \
202 Perl_refcounted_he_fetch_pv(aTHX_ cophh, key, hash, flags)
203
204/*
205=for apidoc Amx|SV *|cophh_fetch_sv|const COPHH *cophh|SV *key|U32 hash|U32 flags
206
207Like L</cophh_fetch_pvn>, but takes a Perl scalar instead of a
208string/length pair.
209
210=cut
211*/
212
213#define cophh_fetch_sv(cophh, key, hash, flags) \
214 Perl_refcounted_he_fetch_sv(aTHX_ cophh, key, hash, flags)
215
216/*
217=for apidoc Amx|HV *|cophh_2hv|const COPHH *cophh|U32 flags
218
219Generates and returns a standard Perl hash representing the full set of
220key/value pairs in the cop hints hash I<cophh>. I<flags> is currently
221unused and must be zero.
222
223=cut
224*/
225
226#define cophh_2hv(cophh, flags) \
227 Perl_refcounted_he_chain_2hv(aTHX_ cophh, flags)
228
229/*
230=for apidoc Amx|COPHH *|cophh_copy|COPHH *cophh
231
232Make and return a complete copy of the cop hints hash I<cophh>.
233
234=cut
235*/
236
237#define cophh_copy(cophh) Perl_refcounted_he_inc(aTHX_ cophh)
238
239/*
240=for apidoc Amx|void|cophh_free|COPHH *cophh
241
242Discard the cop hints hash I<cophh>, freeing all resources associated
243with it.
244
245=cut
246*/
247
248#define cophh_free(cophh) Perl_refcounted_he_free(aTHX_ cophh)
249
250/*
251=for apidoc Amx|COPHH *|cophh_new_empty
252
253Generate and return a fresh cop hints hash containing no entries.
254
255=cut
256*/
257
258#define cophh_new_empty() ((COPHH *)NULL)
259
260/*
261=for apidoc Amx|COPHH *|cophh_store_pvn|COPHH *cophh|const char *keypv|STRLEN keylen|U32 hash|SV *value|U32 flags
262
263Stores a value, associated with a key, in the cop hints hash I<cophh>,
264and returns the modified hash. The returned hash pointer is in general
265not the same as the hash pointer that was passed in. The input hash is
266consumed by the function, and the pointer to it must not be subsequently
267used. Use L</cophh_copy> if you need both hashes.
268
269The key is specified by I<keypv> and I<keylen>. If I<flags> has the
270C<COPHH_KEY_UTF8> bit set, the key octets are interpreted as UTF-8,
271otherwise they are interpreted as Latin-1. I<hash> is a precomputed
272hash of the key string, or zero if it has not been precomputed.
273
274I<value> is the scalar value to store for this key. I<value> is copied
275by this function, which thus does not take ownership of any reference
276to it, and later changes to the scalar will not be reflected in the
277value visible in the cop hints hash. Complex types of scalar will not
278be stored with referential integrity, but will be coerced to strings.
279
280=cut
281*/
282
283#define cophh_store_pvn(cophh, keypv, keylen, hash, value, flags) \
284 Perl_refcounted_he_new_pvn(aTHX_ cophh, keypv, keylen, hash, value, flags)
285
286/*
287=for apidoc Amx|COPHH *|cophh_store_pvs|const COPHH *cophh|const char *key|SV *value|U32 flags
288
289Like L</cophh_store_pvn>, but takes a literal string instead of a
290string/length pair, and no precomputed hash.
291
292=cut
293*/
294
295#define cophh_store_pvs(cophh, key, value, flags) \
296 Perl_refcounted_he_new_pvn(aTHX_ cophh, STR_WITH_LEN(key), 0, value, flags)
297
298/*
299=for apidoc Amx|COPHH *|cophh_store_pv|const COPHH *cophh|const char *key|U32 hash|SV *value|U32 flags
300
301Like L</cophh_store_pvn>, but takes a nul-terminated string instead of
302a string/length pair.
303
304=cut
305*/
306
307#define cophh_store_pv(cophh, key, hash, value, flags) \
308 Perl_refcounted_he_new_pv(aTHX_ cophh, key, hash, value, flags)
309
310/*
311=for apidoc Amx|COPHH *|cophh_store_sv|const COPHH *cophh|SV *key|U32 hash|SV *value|U32 flags
312
313Like L</cophh_store_pvn>, but takes a Perl scalar instead of a
314string/length pair.
315
316=cut
317*/
318
319#define cophh_store_sv(cophh, key, hash, value, flags) \
320 Perl_refcounted_he_new_sv(aTHX_ cophh, key, hash, value, flags)
321
322/*
323=for apidoc Amx|COPHH *|cophh_delete_pvn|COPHH *cophh|const char *keypv|STRLEN keylen|U32 hash|U32 flags
324
325Delete a key and its associated value from the cop hints hash I<cophh>,
326and returns the modified hash. The returned hash pointer is in general
327not the same as the hash pointer that was passed in. The input hash is
328consumed by the function, and the pointer to it must not be subsequently
329used. Use L</cophh_copy> if you need both hashes.
330
331The key is specified by I<keypv> and I<keylen>. If I<flags> has the
332C<COPHH_KEY_UTF8> bit set, the key octets are interpreted as UTF-8,
333otherwise they are interpreted as Latin-1. I<hash> is a precomputed
334hash of the key string, or zero if it has not been precomputed.
335
336=cut
337*/
338
339#define cophh_delete_pvn(cophh, keypv, keylen, hash, flags) \
340 Perl_refcounted_he_new_pvn(aTHX_ cophh, keypv, keylen, hash, \
341 (SV *)NULL, flags)
342
343/*
344=for apidoc Amx|COPHH *|cophh_delete_pvs|const COPHH *cophh|const char *key|U32 flags
345
346Like L</cophh_delete_pvn>, but takes a literal string instead of a
347string/length pair, and no precomputed hash.
348
349=cut
350*/
351
352#define cophh_delete_pvs(cophh, key, flags) \
353 Perl_refcounted_he_new_pvn(aTHX_ cophh, STR_WITH_LEN(key), 0, \
354 (SV *)NULL, flags)
355
356/*
357=for apidoc Amx|COPHH *|cophh_delete_pv|const COPHH *cophh|const char *key|U32 hash|U32 flags
358
359Like L</cophh_delete_pvn>, but takes a nul-terminated string instead of
360a string/length pair.
361
362=cut
363*/
364
365#define cophh_delete_pv(cophh, key, hash, flags) \
366 Perl_refcounted_he_new_pv(aTHX_ cophh, key, hash, (SV *)NULL, flags)
367
368/*
369=for apidoc Amx|COPHH *|cophh_delete_sv|const COPHH *cophh|SV *key|U32 hash|U32 flags
370
371Like L</cophh_delete_pvn>, but takes a Perl scalar instead of a
372string/length pair.
373
374=cut
375*/
376
377#define cophh_delete_sv(cophh, key, hash, flags) \
378 Perl_refcounted_he_new_sv(aTHX_ cophh, key, hash, (SV *)NULL, flags)
379
380#include "mydtrace.h"
381
382struct cop {
383 BASEOP
384 /* On LP64 putting this here takes advantage of the fact that BASEOP isn't
385 an exact multiple of 8 bytes to save structure padding. */
386 line_t cop_line; /* line # of this command */
387 /* label for this construct is now stored in cop_hints_hash */
388#ifdef USE_ITHREADS
389 char * cop_stashpv; /* package line was compiled in */
390 char * cop_file; /* file name the following line # is from */
391#else
392 HV * cop_stash; /* package line was compiled in */
393 GV * cop_filegv; /* file the following line # is from */
394#endif
395 U32 cop_hints; /* hints bits from pragmata */
396 U32 cop_seq; /* parse sequence number */
397 /* Beware. mg.c and warnings.pl assume the type of this is STRLEN *: */
398 STRLEN * cop_warnings; /* lexical warnings bitmask */
399 /* compile time state of %^H. See the comment in op.c for how this is
400 used to recreate a hash to return from caller. */
401 COPHH * cop_hints_hash;
402};
403
404#ifdef USE_ITHREADS
405# define CopFILE(c) ((c)->cop_file)
406# define CopFILEGV(c) (CopFILE(c) \
407 ? gv_fetchfile(CopFILE(c)) : NULL)
408
409# ifdef NETWARE
410# define CopFILE_set(c,pv) ((c)->cop_file = savepv(pv))
411# define CopFILE_setn(c,pv,l) ((c)->cop_file = savepv((pv),(l)))
412# else
413# define CopFILE_set(c,pv) ((c)->cop_file = savesharedpv(pv))
414# define CopFILE_setn(c,pv,l) ((c)->cop_file = savesharedpvn((pv),(l)))
415# endif
416
417# define CopFILESV(c) (CopFILE(c) \
418 ? GvSV(gv_fetchfile(CopFILE(c))) : NULL)
419# define CopFILEAV(c) (CopFILE(c) \
420 ? GvAV(gv_fetchfile(CopFILE(c))) : NULL)
421# ifdef DEBUGGING
422# define CopFILEAVx(c) (assert(CopFILE(c)), \
423 GvAV(gv_fetchfile(CopFILE(c))))
424# else
425# define CopFILEAVx(c) (GvAV(gv_fetchfile(CopFILE(c))))
426# endif
427# define CopSTASHPV(c) ((c)->cop_stashpv)
428
429# ifdef NETWARE
430# define CopSTASHPV_set(c,pv) ((c)->cop_stashpv = ((pv) ? savepv(pv) : NULL))
431# else
432# define CopSTASHPV_set(c,pv) ((c)->cop_stashpv = savesharedpv(pv))
433# endif
434
435# define CopSTASH(c) (CopSTASHPV(c) \
436 ? gv_stashpv(CopSTASHPV(c),GV_ADD) : NULL)
437# define CopSTASH_set(c,hv) CopSTASHPV_set(c, (hv) ? HvNAME_get(hv) : NULL)
438# define CopSTASH_eq(c,hv) ((hv) && stashpv_hvname_match(c,hv))
439# ifdef NETWARE
440# define CopSTASH_free(c) SAVECOPSTASH_FREE(c)
441# define CopFILE_free(c) SAVECOPFILE_FREE(c)
442# else
443# define CopSTASH_free(c) PerlMemShared_free(CopSTASHPV(c))
444# define CopFILE_free(c) (PerlMemShared_free(CopFILE(c)),(CopFILE(c) = NULL))
445# endif
446#else
447# define CopFILEGV(c) ((c)->cop_filegv)
448# define CopFILEGV_set(c,gv) ((c)->cop_filegv = (GV*)SvREFCNT_inc(gv))
449# define CopFILE_set(c,pv) CopFILEGV_set((c), gv_fetchfile(pv))
450# define CopFILE_setn(c,pv,l) CopFILEGV_set((c), gv_fetchfile_flags((pv),(l),0))
451# define CopFILESV(c) (CopFILEGV(c) ? GvSV(CopFILEGV(c)) : NULL)
452# define CopFILEAV(c) (CopFILEGV(c) ? GvAV(CopFILEGV(c)) : NULL)
453# ifdef DEBUGGING
454# define CopFILEAVx(c) (assert(CopFILEGV(c)), GvAV(CopFILEGV(c)))
455# else
456# define CopFILEAVx(c) (GvAV(CopFILEGV(c)))
457# endif
458# define CopFILE(c) (CopFILEGV(c) && GvSV(CopFILEGV(c)) \
459 ? SvPVX(GvSV(CopFILEGV(c))) : NULL)
460# define CopSTASH(c) ((c)->cop_stash)
461# define CopSTASH_set(c,hv) ((c)->cop_stash = (hv))
462# define CopSTASHPV(c) (CopSTASH(c) ? HvNAME_get(CopSTASH(c)) : NULL)
463 /* cop_stash is not refcounted */
464# define CopSTASHPV_set(c,pv) CopSTASH_set((c), gv_stashpv(pv,GV_ADD))
465# define CopSTASH_eq(c,hv) (CopSTASH(c) == (hv))
466# define CopSTASH_free(c)
467# define CopFILE_free(c) (SvREFCNT_dec(CopFILEGV(c)),(CopFILEGV(c) = NULL))
468
469#endif /* USE_ITHREADS */
470
471#define CopHINTHASH_get(c) ((COPHH*)((c)->cop_hints_hash))
472#define CopHINTHASH_set(c,h) ((c)->cop_hints_hash = (h))
473
474/*
475=head1 COP Hint Reading
476*/
477
478/*
479=for apidoc Am|SV *|cop_hints_fetch_pvn|const COP *cop|const char *keypv|STRLEN keylen|U32 hash|U32 flags
480
481Look up the hint entry in the cop I<cop> with the key specified by
482I<keypv> and I<keylen>. If I<flags> has the C<COPHH_KEY_UTF8> bit set,
483the key octets are interpreted as UTF-8, otherwise they are interpreted
484as Latin-1. I<hash> is a precomputed hash of the key string, or zero if
485it has not been precomputed. Returns a mortal scalar copy of the value
486associated with the key, or C<&PL_sv_placeholder> if there is no value
487associated with the key.
488
489=cut
490*/
491
492#define cop_hints_fetch_pvn(cop, keypv, keylen, hash, flags) \
493 cophh_fetch_pvn(CopHINTHASH_get(cop), keypv, keylen, hash, flags)
494
495/*
496=for apidoc Am|SV *|cop_hints_fetch_pvs|const COP *cop|const char *key|U32 flags
497
498Like L</cop_hints_fetch_pvn>, but takes a literal string instead of a
499string/length pair, and no precomputed hash.
500
501=cut
502*/
503
504#define cop_hints_fetch_pvs(cop, key, flags) \
505 cophh_fetch_pvs(CopHINTHASH_get(cop), key, flags)
506
507/*
508=for apidoc Am|SV *|cop_hints_fetch_pv|const COP *cop|const char *key|U32 hash|U32 flags
509
510Like L</cop_hints_fetch_pvn>, but takes a nul-terminated string instead
511of a string/length pair.
512
513=cut
514*/
515
516#define cop_hints_fetch_pv(cop, key, hash, flags) \
517 cophh_fetch_pv(CopHINTHASH_get(cop), key, hash, flags)
518
519/*
520=for apidoc Am|SV *|cop_hints_fetch_sv|const COP *cop|SV *key|U32 hash|U32 flags
521
522Like L</cop_hints_fetch_pvn>, but takes a Perl scalar instead of a
523string/length pair.
524
525=cut
526*/
527
528#define cop_hints_fetch_sv(cop, key, hash, flags) \
529 cophh_fetch_sv(CopHINTHASH_get(cop), key, hash, flags)
530
531/*
532=for apidoc Am|HV *|cop_hints_2hv|const COP *cop|U32 flags
533
534Generates and returns a standard Perl hash representing the full set of
535hint entries in the cop I<cop>. I<flags> is currently unused and must
536be zero.
537
538=cut
539*/
540
541#define cop_hints_2hv(cop, flags) \
542 cophh_2hv(CopHINTHASH_get(cop), flags)
543
544#define CopLABEL(c) Perl_fetch_cop_label(aTHX_ (c), NULL, NULL)
545#define CopLABEL_alloc(pv) ((pv)?savepv(pv):NULL)
546
547#define CopSTASH_ne(c,hv) (!CopSTASH_eq(c,hv))
548#define CopLINE(c) ((c)->cop_line)
549#define CopLINE_inc(c) (++CopLINE(c))
550#define CopLINE_dec(c) (--CopLINE(c))
551#define CopLINE_set(c,l) (CopLINE(c) = (l))
552
553/* OutCopFILE() is CopFILE for output (caller, die, warn, etc.) */
554#define OutCopFILE(c) CopFILE(c)
555
556/* If $[ is non-zero, it's stored in cop_hints under the key "$[", and
557 HINT_ARYBASE is set to indicate this.
558 Setting it is ineficient due to the need to create 2 mortal SVs, but as
559 using $[ is highly discouraged, no sane Perl code will be using it. */
560#define CopARYBASE_get(c) \
561 ((CopHINTS_get(c) & HINT_ARYBASE) \
562 ? SvIV(cop_hints_fetch_pvs((c), "$[", 0)) \
563 : 0)
564#define CopARYBASE_set(c, b) STMT_START { \
565 if (b || ((c)->cop_hints & HINT_ARYBASE)) { \
566 (c)->cop_hints |= HINT_ARYBASE; \
567 if ((c) == &PL_compiling) { \
568 SV *val = newSViv(b); \
569 (void)hv_stores(GvHV(PL_hintgv), "$[", val); \
570 mg_set(val); \
571 PL_hints |= HINT_ARYBASE; \
572 } else { \
573 CopHINTHASH_set((c), \
574 cophh_store_pvs(CopHINTHASH_get((c)), "$[", \
575 sv_2mortal(newSViv(b)), 0)); \
576 } \
577 } \
578 } STMT_END
579
580/* FIXME NATIVE_HINTS if this is changed from op_private (see perl.h) */
581#define CopHINTS_get(c) ((c)->cop_hints + 0)
582#define CopHINTS_set(c, h) STMT_START { \
583 (c)->cop_hints = (h); \
584 } STMT_END
585
586/*
587 * Here we have some enormously heavy (or at least ponderous) wizardry.
588 */
589
590/* subroutine context */
591struct block_sub {
592 OP * retop; /* op to execute on exit from sub */
593 /* Above here is the same for sub, format and eval. */
594 CV * cv;
595 /* Above here is the same for sub and format. */
596 AV * savearray;
597 AV * argarray;
598 I32 olddepth;
599 PAD *oldcomppad;
600};
601
602
603/* format context */
604struct block_format {
605 OP * retop; /* op to execute on exit from sub */
606 /* Above here is the same for sub, format and eval. */
607 CV * cv;
608 /* Above here is the same for sub and format. */
609 GV * gv;
610 GV * dfoutgv;
611};
612
613/* base for the next two macros. Don't use directly.
614 * Note that the refcnt of the cv is incremented twice; The CX one is
615 * decremented by LEAVESUB, the other by LEAVE. */
616
617#define PUSHSUB_BASE(cx) \
618 ENTRY_PROBE(GvENAME(CvGV(cv)), \
619 CopFILE((const COP *)CvSTART(cv)), \
620 CopLINE((const COP *)CvSTART(cv))); \
621 \
622 cx->blk_sub.cv = cv; \
623 cx->blk_sub.olddepth = CvDEPTH(cv); \
624 cx->cx_type |= (hasargs) ? CXp_HASARGS : 0; \
625 cx->blk_sub.retop = NULL; \
626 if (!CvDEPTH(cv)) { \
627 SvREFCNT_inc_simple_void_NN(cv); \
628 SvREFCNT_inc_simple_void_NN(cv); \
629 SAVEFREESV(cv); \
630 }
631
632
633#define PUSHSUB(cx) \
634 PUSHSUB_BASE(cx) \
635 cx->blk_u16 = PL_op->op_private & \
636 (OPpLVAL_INTRO|OPpENTERSUB_INARGS);
637
638/* variant for use by OP_DBSTATE, where op_private holds hint bits */
639#define PUSHSUB_DB(cx) \
640 PUSHSUB_BASE(cx) \
641 cx->blk_u16 = 0;
642
643
644#define PUSHFORMAT(cx, retop) \
645 cx->blk_format.cv = cv; \
646 cx->blk_format.gv = gv; \
647 cx->blk_format.retop = (retop); \
648 cx->blk_format.dfoutgv = PL_defoutgv; \
649 SvREFCNT_inc_void(cx->blk_format.dfoutgv)
650
651#define POP_SAVEARRAY() \
652 STMT_START { \
653 SvREFCNT_dec(GvAV(PL_defgv)); \
654 GvAV(PL_defgv) = cx->blk_sub.savearray; \
655 } STMT_END
656
657/* junk in @_ spells trouble when cloning CVs and in pp_caller(), so don't
658 * leave any (a fast av_clear(ary), basically) */
659#define CLEAR_ARGARRAY(ary) \
660 STMT_START { \
661 AvMAX(ary) += AvARRAY(ary) - AvALLOC(ary); \
662 AvARRAY(ary) = AvALLOC(ary); \
663 AvFILLp(ary) = -1; \
664 } STMT_END
665
666#define POPSUB(cx,sv) \
667 STMT_START { \
668 RETURN_PROBE(GvENAME(CvGV((const CV*)cx->blk_sub.cv)), \
669 CopFILE((COP*)CvSTART((const CV*)cx->blk_sub.cv)), \
670 CopLINE((COP*)CvSTART((const CV*)cx->blk_sub.cv))); \
671 \
672 if (CxHASARGS(cx)) { \
673 POP_SAVEARRAY(); \
674 /* abandon @_ if it got reified */ \
675 if (AvREAL(cx->blk_sub.argarray)) { \
676 const SSize_t fill = AvFILLp(cx->blk_sub.argarray); \
677 SvREFCNT_dec(cx->blk_sub.argarray); \
678 cx->blk_sub.argarray = newAV(); \
679 av_extend(cx->blk_sub.argarray, fill); \
680 AvREIFY_only(cx->blk_sub.argarray); \
681 CX_CURPAD_SV(cx->blk_sub, 0) = MUTABLE_SV(cx->blk_sub.argarray); \
682 } \
683 else { \
684 CLEAR_ARGARRAY(cx->blk_sub.argarray); \
685 } \
686 } \
687 sv = MUTABLE_SV(cx->blk_sub.cv); \
688 if (sv && (CvDEPTH((const CV*)sv) = cx->blk_sub.olddepth)) \
689 sv = NULL; \
690 } STMT_END
691
692#define LEAVESUB(sv) \
693 STMT_START { \
694 if (sv) \
695 SvREFCNT_dec(sv); \
696 } STMT_END
697
698#define POPFORMAT(cx) \
699 setdefout(cx->blk_format.dfoutgv); \
700 SvREFCNT_dec(cx->blk_format.dfoutgv);
701
702/* eval context */
703struct block_eval {
704 OP * retop; /* op to execute on exit from eval */
705 /* Above here is the same for sub, format and eval. */
706 SV * old_namesv;
707 OP * old_eval_root;
708 SV * cur_text;
709 CV * cv;
710 JMPENV * cur_top_env; /* value of PL_top_env when eval CX created */
711};
712
713/* If we ever need more than 512 op types, change the shift from 7.
714 blku_gimme is actually also only 2 bits, so could be merged with something.
715*/
716
717#define CxOLD_IN_EVAL(cx) (((cx)->blk_u16) & 0x7F)
718#define CxOLD_OP_TYPE(cx) (((cx)->blk_u16) >> 7)
719
720#define PUSHEVAL(cx,n) \
721 STMT_START { \
722 assert(!(PL_in_eval & ~0x7F)); \
723 assert(!(PL_op->op_type & ~0x1FF)); \
724 cx->blk_u16 = (PL_in_eval & 0x7F) | ((U16)PL_op->op_type << 7); \
725 cx->blk_eval.old_namesv = (n ? newSVpv(n,0) : NULL); \
726 cx->blk_eval.old_eval_root = PL_eval_root; \
727 cx->blk_eval.cur_text = PL_parser ? PL_parser->linestr : NULL; \
728 cx->blk_eval.cv = NULL; /* set by doeval(), as applicable */ \
729 cx->blk_eval.retop = NULL; \
730 cx->blk_eval.cur_top_env = PL_top_env; \
731 } STMT_END
732
733#define POPEVAL(cx) \
734 STMT_START { \
735 PL_in_eval = CxOLD_IN_EVAL(cx); \
736 optype = CxOLD_OP_TYPE(cx); \
737 PL_eval_root = cx->blk_eval.old_eval_root; \
738 if (cx->blk_eval.old_namesv) \
739 sv_2mortal(cx->blk_eval.old_namesv); \
740 } STMT_END
741
742/* loop context */
743struct block_loop {
744 I32 resetsp;
745 LOOP * my_op; /* My op, that contains redo, next and last ops. */
746 union { /* different ways of locating the iteration variable */
747 SV **svp;
748 GV *gv;
749 PAD *oldcomppad; /* only used in ITHREADS */
750 } itervar_u;
751 union {
752 struct { /* valid if type is LOOP_FOR or LOOP_PLAIN (but {NULL,0})*/
753 AV * ary; /* use the stack if this is NULL */
754 IV ix;
755 } ary;
756 struct { /* valid if type is LOOP_LAZYIV */
757 IV cur;
758 IV end;
759 } lazyiv;
760 struct { /* valid if type if LOOP_LAZYSV */
761 SV * cur;
762 SV * end; /* maxiumum value (or minimum in reverse) */
763 } lazysv;
764 } state_u;
765};
766
767#ifdef USE_ITHREADS
768# define CxITERVAR_PADSV(c) \
769 &CX_CURPAD_SV( (c)->blk_loop.itervar_u, (c)->blk_loop.my_op->op_targ)
770#else
771# define CxITERVAR_PADSV(c) ((c)->blk_loop.itervar_u.svp)
772#endif
773
774#define CxITERVAR(c) \
775 ((c)->blk_loop.itervar_u.oldcomppad \
776 ? (CxPADLOOP(c) \
777 ? CxITERVAR_PADSV(c) \
778 : &GvSV((c)->blk_loop.itervar_u.gv)) \
779 : (SV**)NULL)
780
781#define CxLABEL(c) (0 + CopLABEL((c)->blk_oldcop))
782#define CxHASARGS(c) (((c)->cx_type & CXp_HASARGS) == CXp_HASARGS)
783#define CxLVAL(c) (0 + (c)->blk_u16)
784
785#define PUSHLOOP_PLAIN(cx, s) \
786 cx->blk_loop.resetsp = s - PL_stack_base; \
787 cx->blk_loop.my_op = cLOOP; \
788 cx->blk_loop.state_u.ary.ary = NULL; \
789 cx->blk_loop.state_u.ary.ix = 0; \
790 cx->blk_loop.itervar_u.svp = NULL;
791
792#define PUSHLOOP_FOR(cx, ivar, s) \
793 cx->blk_loop.resetsp = s - PL_stack_base; \
794 cx->blk_loop.my_op = cLOOP; \
795 cx->blk_loop.state_u.ary.ary = NULL; \
796 cx->blk_loop.state_u.ary.ix = 0; \
797 cx->blk_loop.itervar_u.svp = (SV**)(ivar);
798
799#define POPLOOP(cx) \
800 if (CxTYPE(cx) == CXt_LOOP_LAZYSV) { \
801 SvREFCNT_dec(cx->blk_loop.state_u.lazysv.cur); \
802 SvREFCNT_dec(cx->blk_loop.state_u.lazysv.end); \
803 } \
804 if (CxTYPE(cx) == CXt_LOOP_FOR) \
805 SvREFCNT_dec(cx->blk_loop.state_u.ary.ary);
806
807/* given/when context */
808struct block_givwhen {
809 OP *leave_op;
810};
811
812#define PUSHGIVEN(cx) \
813 cx->blk_givwhen.leave_op = cLOGOP->op_other;
814
815#define PUSHWHEN PUSHGIVEN
816
817/* context common to subroutines, evals and loops */
818struct block {
819 U8 blku_type; /* what kind of context this is */
820 U8 blku_gimme; /* is this block running in list context? */
821 U16 blku_u16; /* used by block_sub and block_eval (so far) */
822 I32 blku_oldsp; /* stack pointer to copy stuff down to */
823 COP * blku_oldcop; /* old curcop pointer */
824 I32 blku_oldmarksp; /* mark stack index */
825 I32 blku_oldscopesp; /* scope stack index */
826 PMOP * blku_oldpm; /* values of pattern match vars */
827
828 union {
829 struct block_sub blku_sub;
830 struct block_format blku_format;
831 struct block_eval blku_eval;
832 struct block_loop blku_loop;
833 struct block_givwhen blku_givwhen;
834 } blk_u;
835};
836#define blk_oldsp cx_u.cx_blk.blku_oldsp
837#define blk_oldcop cx_u.cx_blk.blku_oldcop
838#define blk_oldmarksp cx_u.cx_blk.blku_oldmarksp
839#define blk_oldscopesp cx_u.cx_blk.blku_oldscopesp
840#define blk_oldpm cx_u.cx_blk.blku_oldpm
841#define blk_gimme cx_u.cx_blk.blku_gimme
842#define blk_u16 cx_u.cx_blk.blku_u16
843#define blk_sub cx_u.cx_blk.blk_u.blku_sub
844#define blk_format cx_u.cx_blk.blk_u.blku_format
845#define blk_eval cx_u.cx_blk.blk_u.blku_eval
846#define blk_loop cx_u.cx_blk.blk_u.blku_loop
847#define blk_givwhen cx_u.cx_blk.blk_u.blku_givwhen
848
849#define DEBUG_CX(action) \
850 DEBUG_l( \
851 Perl_deb(aTHX_ "CX %ld %s %s (scope %ld,%ld) at %s:%d\n", \
852 (long)cxstack_ix, \
853 action, \
854 PL_block_type[CxTYPE(&cxstack[cxstack_ix])], \
855 (long)PL_scopestack_ix, \
856 (long)(cxstack[cxstack_ix].blk_oldscopesp), \
857 __FILE__, __LINE__));
858
859/* Enter a block. */
860#define PUSHBLOCK(cx,t,sp) CXINC, cx = &cxstack[cxstack_ix], \
861 cx->cx_type = t, \
862 cx->blk_oldsp = sp - PL_stack_base, \
863 cx->blk_oldcop = PL_curcop, \
864 cx->blk_oldmarksp = PL_markstack_ptr - PL_markstack, \
865 cx->blk_oldscopesp = PL_scopestack_ix, \
866 cx->blk_oldpm = PL_curpm, \
867 cx->blk_gimme = (U8)gimme; \
868 DEBUG_CX("PUSH");
869
870/* Exit a block (RETURN and LAST). */
871#define POPBLOCK(cx,pm) \
872 DEBUG_CX("POP"); \
873 cx = &cxstack[cxstack_ix--], \
874 newsp = PL_stack_base + cx->blk_oldsp, \
875 PL_curcop = cx->blk_oldcop, \
876 PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
877 PL_scopestack_ix = cx->blk_oldscopesp, \
878 pm = cx->blk_oldpm, \
879 gimme = cx->blk_gimme;
880
881/* Continue a block elsewhere (NEXT and REDO). */
882#define TOPBLOCK(cx) \
883 DEBUG_CX("TOP"); \
884 cx = &cxstack[cxstack_ix], \
885 PL_stack_sp = PL_stack_base + cx->blk_oldsp, \
886 PL_markstack_ptr = PL_markstack + cx->blk_oldmarksp, \
887 PL_scopestack_ix = cx->blk_oldscopesp, \
888 PL_curpm = cx->blk_oldpm;
889
890/* substitution context */
891struct subst {
892 U8 sbu_type; /* what kind of context this is */
893 U8 sbu_rflags;
894 U16 sbu_rxtainted; /* matches struct block */
895 I32 sbu_iters;
896 I32 sbu_maxiters;
897 I32 sbu_oldsave;
898 char * sbu_orig;
899 SV * sbu_dstr;
900 SV * sbu_targ;
901 char * sbu_s;
902 char * sbu_m;
903 char * sbu_strend;
904 void * sbu_rxres;
905 REGEXP * sbu_rx;
906};
907#define sb_iters cx_u.cx_subst.sbu_iters
908#define sb_maxiters cx_u.cx_subst.sbu_maxiters
909#define sb_rflags cx_u.cx_subst.sbu_rflags
910#define sb_oldsave cx_u.cx_subst.sbu_oldsave
911#define sb_once cx_u.cx_subst.sbu_once
912#define sb_rxtainted cx_u.cx_subst.sbu_rxtainted
913#define sb_orig cx_u.cx_subst.sbu_orig
914#define sb_dstr cx_u.cx_subst.sbu_dstr
915#define sb_targ cx_u.cx_subst.sbu_targ
916#define sb_s cx_u.cx_subst.sbu_s
917#define sb_m cx_u.cx_subst.sbu_m
918#define sb_strend cx_u.cx_subst.sbu_strend
919#define sb_rxres cx_u.cx_subst.sbu_rxres
920#define sb_rx cx_u.cx_subst.sbu_rx
921
922#ifdef PERL_CORE
923# define PUSHSUBST(cx) CXINC, cx = &cxstack[cxstack_ix], \
924 cx->sb_iters = iters, \
925 cx->sb_maxiters = maxiters, \
926 cx->sb_rflags = r_flags, \
927 cx->sb_oldsave = oldsave, \
928 cx->sb_rxtainted = rxtainted, \
929 cx->sb_orig = orig, \
930 cx->sb_dstr = dstr, \
931 cx->sb_targ = targ, \
932 cx->sb_s = s, \
933 cx->sb_m = m, \
934 cx->sb_strend = strend, \
935 cx->sb_rxres = NULL, \
936 cx->sb_rx = rx, \
937 cx->cx_type = CXt_SUBST | (once ? CXp_ONCE : 0); \
938 rxres_save(&cx->sb_rxres, rx); \
939 (void)ReREFCNT_inc(rx)
940
941# define POPSUBST(cx) cx = &cxstack[cxstack_ix--]; \
942 rxres_free(&cx->sb_rxres); \
943 ReREFCNT_dec(cx->sb_rx)
944#endif
945
946#define CxONCE(cx) ((cx)->cx_type & CXp_ONCE)
947
948struct context {
949 union {
950 struct block cx_blk;
951 struct subst cx_subst;
952 } cx_u;
953};
954#define cx_type cx_u.cx_subst.sbu_type
955
956/* If you re-order these, there is also an array of uppercase names in perl.h
957 and a static array of context names in pp_ctl.c */
958#define CXTYPEMASK 0xf
959#define CXt_NULL 0
960#define CXt_WHEN 1
961#define CXt_BLOCK 2
962/* When micro-optimising :-) keep GIVEN next to the LOOPs, as these 5 share a
963 jump table in pp_ctl.c
964 The first 4 don't have a 'case' in at least one switch statement in pp_ctl.c
965*/
966#define CXt_GIVEN 3
967/* This is first so that CXt_LOOP_FOR|CXt_LOOP_LAZYIV is CXt_LOOP_LAZYIV */
968#define CXt_LOOP_FOR 4
969#define CXt_LOOP_PLAIN 5
970#define CXt_LOOP_LAZYSV 6
971#define CXt_LOOP_LAZYIV 7
972#define CXt_SUB 8
973#define CXt_FORMAT 9
974#define CXt_EVAL 10
975#define CXt_SUBST 11
976/* SUBST doesn't feature in all switch statements. */
977
978/* private flags for CXt_SUB and CXt_NULL
979 However, this is checked in many places which do not check the type, so
980 this bit needs to be kept clear for most everything else. For reasons I
981 haven't investigated, it can coexist with CXp_FOR_DEF */
982#define CXp_MULTICALL 0x10 /* part of a multicall (so don't
983 tear down context on exit). */
984
985/* private flags for CXt_SUB and CXt_FORMAT */
986#define CXp_HASARGS 0x20
987
988/* private flags for CXt_EVAL */
989#define CXp_REAL 0x20 /* truly eval'', not a lookalike */
990#define CXp_TRYBLOCK 0x40 /* eval{}, not eval'' or similar */
991
992/* private flags for CXt_LOOP */
993#define CXp_FOR_DEF 0x10 /* foreach using $_ */
994#define CxPADLOOP(c) ((c)->blk_loop.my_op->op_targ)
995
996/* private flags for CXt_SUBST */
997#define CXp_ONCE 0x10 /* What was sbu_once in struct subst */
998
999#define CxTYPE(c) ((c)->cx_type & CXTYPEMASK)
1000#define CxTYPE_is_LOOP(c) (((c)->cx_type & 0xC) == 0x4)
1001#define CxMULTICALL(c) (((c)->cx_type & CXp_MULTICALL) \
1002 == CXp_MULTICALL)
1003#define CxREALEVAL(c) (((c)->cx_type & (CXTYPEMASK|CXp_REAL)) \
1004 == (CXt_EVAL|CXp_REAL))
1005#define CxTRYBLOCK(c) (((c)->cx_type & (CXTYPEMASK|CXp_TRYBLOCK)) \
1006 == (CXt_EVAL|CXp_TRYBLOCK))
1007#define CxFOREACH(c) (CxTYPE_is_LOOP(c) && CxTYPE(c) != CXt_LOOP_PLAIN)
1008#define CxFOREACHDEF(c) ((CxTYPE_is_LOOP(c) && CxTYPE(c) != CXt_LOOP_PLAIN) \
1009 && ((c)->cx_type & CXp_FOR_DEF))
1010
1011#define CXINC (cxstack_ix < cxstack_max ? ++cxstack_ix : (cxstack_ix = cxinc()))
1012
1013/*
1014=head1 "Gimme" Values
1015*/
1016
1017/*
1018=for apidoc AmU||G_SCALAR
1019Used to indicate scalar context. See C<GIMME_V>, C<GIMME>, and
1020L<perlcall>.
1021
1022=for apidoc AmU||G_ARRAY
1023Used to indicate list context. See C<GIMME_V>, C<GIMME> and
1024L<perlcall>.
1025
1026=for apidoc AmU||G_VOID
1027Used to indicate void context. See C<GIMME_V> and L<perlcall>.
1028
1029=for apidoc AmU||G_DISCARD
1030Indicates that arguments returned from a callback should be discarded. See
1031L<perlcall>.
1032
1033=for apidoc AmU||G_EVAL
1034
1035Used to force a Perl C<eval> wrapper around a callback. See
1036L<perlcall>.
1037
1038=for apidoc AmU||G_NOARGS
1039
1040Indicates that no arguments are being sent to a callback. See
1041L<perlcall>.
1042
1043=cut
1044*/
1045
1046#define G_SCALAR 2
1047#define G_ARRAY 3
1048#define G_VOID 1
1049#define G_WANT 3
1050
1051/* extra flags for Perl_call_* routines */
1052#define G_DISCARD 4 /* Call FREETMPS.
1053 Don't change this without consulting the
1054 hash actions codes defined in hv.h */
1055#define G_EVAL 8 /* Assume eval {} around subroutine call. */
1056#define G_NOARGS 16 /* Don't construct a @_ array. */
1057#define G_KEEPERR 32 /* Warn for errors, don't overwrite $@ */
1058#define G_NODEBUG 64 /* Disable debugging at toplevel. */
1059#define G_METHOD 128 /* Calling method. */
1060#define G_FAKINGEVAL 256 /* Faking an eval context for call_sv or
1061 fold_constants. */
1062#define G_UNDEF_FILL 512 /* Fill the stack with &PL_sv_undef
1063 A special case for UNSHIFT in
1064 Perl_magic_methcall(). */
1065
1066/* flag bits for PL_in_eval */
1067#define EVAL_NULL 0 /* not in an eval */
1068#define EVAL_INEVAL 1 /* some enclosing scope is an eval */
1069#define EVAL_WARNONLY 2 /* used by yywarn() when calling yyerror() */
1070#define EVAL_KEEPERR 4 /* set by Perl_call_sv if G_KEEPERR */
1071#define EVAL_INREQUIRE 8 /* The code is being required. */
1072
1073/* Support for switching (stack and block) contexts.
1074 * This ensures magic doesn't invalidate local stack and cx pointers.
1075 */
1076
1077#define PERLSI_UNKNOWN -1
1078#define PERLSI_UNDEF 0
1079#define PERLSI_MAIN 1
1080#define PERLSI_MAGIC 2
1081#define PERLSI_SORT 3
1082#define PERLSI_SIGNAL 4
1083#define PERLSI_OVERLOAD 5
1084#define PERLSI_DESTROY 6
1085#define PERLSI_WARNHOOK 7
1086#define PERLSI_DIEHOOK 8
1087#define PERLSI_REQUIRE 9
1088
1089struct stackinfo {
1090 AV * si_stack; /* stack for current runlevel */
1091 PERL_CONTEXT * si_cxstack; /* context stack for runlevel */
1092 struct stackinfo * si_prev;
1093 struct stackinfo * si_next;
1094 I32 si_cxix; /* current context index */
1095 I32 si_cxmax; /* maximum allocated index */
1096 I32 si_type; /* type of runlevel */
1097 I32 si_markoff; /* offset where markstack begins for us.
1098 * currently used only with DEBUGGING,
1099 * but not #ifdef-ed for bincompat */
1100};
1101
1102typedef struct stackinfo PERL_SI;
1103
1104#define cxstack (PL_curstackinfo->si_cxstack)
1105#define cxstack_ix (PL_curstackinfo->si_cxix)
1106#define cxstack_max (PL_curstackinfo->si_cxmax)
1107
1108#ifdef DEBUGGING
1109# define SET_MARK_OFFSET \
1110 PL_curstackinfo->si_markoff = PL_markstack_ptr - PL_markstack
1111#else
1112# define SET_MARK_OFFSET NOOP
1113#endif
1114
1115#define PUSHSTACKi(type) \
1116 STMT_START { \
1117 PERL_SI *next = PL_curstackinfo->si_next; \
1118 DEBUG_l({ \
1119 int i = 0; PERL_SI *p = PL_curstackinfo; \
1120 while (p) { i++; p = p->si_prev; } \
1121 Perl_deb(aTHX_ "push STACKINFO %d at %s:%d\n", \
1122 i, __FILE__, __LINE__);}) \
1123 if (!next) { \
1124 next = new_stackinfo(32, 2048/sizeof(PERL_CONTEXT) - 1); \
1125 next->si_prev = PL_curstackinfo; \
1126 PL_curstackinfo->si_next = next; \
1127 } \
1128 next->si_type = type; \
1129 next->si_cxix = -1; \
1130 AvFILLp(next->si_stack) = 0; \
1131 SWITCHSTACK(PL_curstack,next->si_stack); \
1132 PL_curstackinfo = next; \
1133 SET_MARK_OFFSET; \
1134 } STMT_END
1135
1136#define PUSHSTACK PUSHSTACKi(PERLSI_UNKNOWN)
1137
1138/* POPSTACK works with PL_stack_sp, so it may need to be bracketed by
1139 * PUTBACK/SPAGAIN to flush/refresh any local SP that may be active */
1140#define POPSTACK \
1141 STMT_START { \
1142 dSP; \
1143 PERL_SI * const prev = PL_curstackinfo->si_prev; \
1144 DEBUG_l({ \
1145 int i = -1; PERL_SI *p = PL_curstackinfo; \
1146 while (p) { i++; p = p->si_prev; } \
1147 Perl_deb(aTHX_ "pop STACKINFO %d at %s:%d\n", \
1148 i, __FILE__, __LINE__);}) \
1149 if (!prev) { \
1150 PerlIO_printf(Perl_error_log, "panic: POPSTACK\n"); \
1151 my_exit(1); \
1152 } \
1153 SWITCHSTACK(PL_curstack,prev->si_stack); \
1154 /* don't free prev here, free them all at the END{} */ \
1155 PL_curstackinfo = prev; \
1156 } STMT_END
1157
1158#define POPSTACK_TO(s) \
1159 STMT_START { \
1160 while (PL_curstack != s) { \
1161 dounwind(-1); \
1162 POPSTACK; \
1163 } \
1164 } STMT_END
1165
1166#define IN_PERL_COMPILETIME (PL_curcop == &PL_compiling)
1167#define IN_PERL_RUNTIME (PL_curcop != &PL_compiling)
1168
1169/*
1170=head1 Multicall Functions
1171
1172=for apidoc Ams||dMULTICALL
1173Declare local variables for a multicall. See L<perlcall/Lightweight Callbacks>.
1174
1175=for apidoc Ams||PUSH_MULTICALL
1176Opening bracket for a lightweight callback.
1177See L<perlcall/Lightweight Callbacks>.
1178
1179=for apidoc Ams||MULTICALL
1180Make a lightweight callback. See L<perlcall/Lightweight Callbacks>.
1181
1182=for apidoc Ams||POP_MULTICALL
1183Closing bracket for a lightweight callback.
1184See L<perlcall/Lightweight Callbacks>.
1185
1186=cut
1187*/
1188
1189#define dMULTICALL \
1190 SV **newsp; /* set by POPBLOCK */ \
1191 PERL_CONTEXT *cx; \
1192 CV *multicall_cv; \
1193 OP *multicall_cop; \
1194 bool multicall_oldcatch; \
1195 U8 hasargs = 0 /* used by PUSHSUB */
1196
1197#define PUSH_MULTICALL(the_cv) \
1198 STMT_START { \
1199 CV * const _nOnclAshIngNamE_ = the_cv; \
1200 CV * const cv = _nOnclAshIngNamE_; \
1201 AV * const padlist = CvPADLIST(cv); \
1202 ENTER; \
1203 multicall_oldcatch = CATCH_GET; \
1204 SAVETMPS; SAVEVPTR(PL_op); \
1205 CATCH_SET(TRUE); \
1206 PUSHSTACKi(PERLSI_SORT); \
1207 PUSHBLOCK(cx, CXt_SUB|CXp_MULTICALL, PL_stack_sp); \
1208 PUSHSUB(cx); \
1209 if (++CvDEPTH(cv) >= 2) { \
1210 PERL_STACK_OVERFLOW_CHECK(); \
1211 Perl_pad_push(aTHX_ padlist, CvDEPTH(cv)); \
1212 } \
1213 SAVECOMPPAD(); \
1214 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv)); \
1215 multicall_cv = cv; \
1216 multicall_cop = CvSTART(cv); \
1217 } STMT_END
1218
1219#define MULTICALL \
1220 STMT_START { \
1221 PL_op = multicall_cop; \
1222 CALLRUNOPS(aTHX); \
1223 } STMT_END
1224
1225#define POP_MULTICALL \
1226 STMT_START { \
1227 if (! --CvDEPTH(multicall_cv)) \
1228 LEAVESUB(multicall_cv); \
1229 POPBLOCK(cx,PL_curpm); \
1230 POPSTACK; \
1231 CATCH_SET(multicall_oldcatch); \
1232 LEAVE; \
1233 SPAGAIN; \
1234 } STMT_END
1235
1236/*
1237 * Local variables:
1238 * c-indentation-style: bsd
1239 * c-basic-offset: 4
1240 * indent-tabs-mode: t
1241 * End:
1242 *
1243 * ex: set ts=8 sts=4 sw=4 noet:
1244 */