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
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.
9 * Control ops (cops) are one of the two ops OP_NEXTSTATE and OP_DBSTATE,
10 * that (loosely speaking) are statement separators.
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.
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
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).
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.
33 struct jmpenv * je_prev;
34 Sigjmp_buf je_buf; /* uninit if je_prev is NULL */
35 int je_ret; /* last exception thrown */
36 bool je_mustcatch; /* need to call longjmp()? */
37 U16 je_old_delaymagic; /* saved PL_delaymagic */
38 SSize_t je_old_stack_hwm;
41 typedef struct jmpenv JMPENV;
43 #if defined DEBUGGING && !defined DEBUGGING_RE_ONLY
44 # define JE_OLD_STACK_HWM_zero PL_start_env.je_old_stack_hwm = 0
45 # define JE_OLD_STACK_HWM_save(je) \
46 (je).je_old_stack_hwm = PL_curstackinfo->si_stack_hwm
47 # define JE_OLD_STACK_HWM_restore(je) \
48 if (PL_curstackinfo->si_stack_hwm < (je).je_old_stack_hwm) \
49 PL_curstackinfo->si_stack_hwm = (je).je_old_stack_hwm
51 # define JE_OLD_STACK_HWM_zero NOOP
52 # define JE_OLD_STACK_HWM_save(je) NOOP
53 # define JE_OLD_STACK_HWM_restore(je) NOOP
57 * How to build the first jmpenv.
59 * top_env needs to be non-zero. It points to an area
60 * in which longjmp() stuff is stored, as C callstack
61 * info there at least is thread specific this has to
62 * be per-thread. Otherwise a 'die' in a thread gives
63 * that thread the C stack of last thread to do an eval {}!
66 #define JMPENV_BOOTSTRAP \
68 PERL_POISON_EXPR(PoisonNew(&PL_start_env, 1, JMPENV));\
69 PL_top_env = &PL_start_env; \
70 PL_start_env.je_prev = NULL; \
71 PL_start_env.je_ret = -1; \
72 PL_start_env.je_mustcatch = TRUE; \
73 PL_start_env.je_old_delaymagic = 0; \
74 JE_OLD_STACK_HWM_zero; \
78 * PERL_FLEXIBLE_EXCEPTIONS
80 * All the flexible exceptions code has been removed.
81 * See the following threads for details:
83 * Message-Id: 20040713143217.GB1424@plum.flirble.org
84 * https://www.nntp.perl.org/group/perl.perl5.porters/2004/07/msg93041.html
86 * Joshua's original patches (which weren't applied) and discussion:
88 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg01396.html
89 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg01489.html
90 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg01491.html
91 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg01608.html
92 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg02144.html
93 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1998-02/msg02998.html
95 * Chip's reworked patch and discussion:
97 * http://www.xray.mpe.mpg.de/mailing-lists/perl5-porters/1999-03/msg00520.html
99 * The flaw in these patches (which went unnoticed at the time) was
100 * that they moved some code that could potentially die() out of the
101 * region protected by the setjmp()s. This caused exceptions within
102 * END blocks and such to not be handled by the correct setjmp().
104 * The original patches that introduces flexible exceptions were:
106 * https://github.com/Perl/perl5/commit/312caa8e97f1c7ee342a9895c2f0e749625b4929
107 * https://github.com/Perl/perl5/commit/14dd3ad8c9bf82cf09798a22cc89a9862dfd6d1a
111 #define dJMPENV JMPENV cur_env
113 #define JMPENV_PUSH(v) \
116 int i = 0; JMPENV *p = PL_top_env; \
117 while (p) { i++; p = p->je_prev; } \
118 Perl_deb(aTHX_ "JUMPENV_PUSH level=%d at %s:%d\n", \
119 i, __FILE__, __LINE__);}) \
120 cur_env.je_prev = PL_top_env; \
121 JE_OLD_STACK_HWM_save(cur_env); \
122 cur_env.je_ret = PerlProc_setjmp(cur_env.je_buf, SCOPE_SAVES_SIGNAL_MASK); \
123 JE_OLD_STACK_HWM_restore(cur_env); \
124 PL_top_env = &cur_env; \
125 cur_env.je_mustcatch = FALSE; \
126 cur_env.je_old_delaymagic = PL_delaymagic; \
127 (v) = cur_env.je_ret; \
133 int i = -1; JMPENV *p = PL_top_env; \
134 while (p) { i++; p = p->je_prev; } \
135 Perl_deb(aTHX_ "JUMPENV_POP level=%d at %s:%d\n", \
136 i, __FILE__, __LINE__);}) \
137 assert(PL_top_env == &cur_env); \
138 PL_delaymagic = cur_env.je_old_delaymagic; \
139 PL_top_env = cur_env.je_prev; \
142 #define JMPENV_JUMP(v) \
145 int i = -1; JMPENV *p = PL_top_env; \
146 while (p) { i++; p = p->je_prev; } \
147 Perl_deb(aTHX_ "JUMPENV_JUMP(%d) level=%d at %s:%d\n", \
148 (int)v, i, __FILE__, __LINE__);}) \
149 if (PL_top_env->je_prev) \
150 PerlProc_longjmp(PL_top_env->je_buf, (v)); \
152 PerlProc_exit(STATUS_EXIT); \
153 PerlIO_printf(PerlIO_stderr(), "panic: top_env, v=%d\n", (int)v); \
157 #define CATCH_GET (PL_top_env->je_mustcatch)
158 #define CATCH_SET(v) \
162 "JUMPLEVEL set catch %d => %d (for %p) at %s:%d\n", \
163 PL_top_env->je_mustcatch, v, (void*)PL_top_env, \
164 __FILE__, __LINE__);) \
165 PL_top_env->je_mustcatch = (v); \
169 =head1 COP Hint Hashes
172 typedef struct refcounted_he COPHH;
174 #define COPHH_KEY_UTF8 REFCOUNTED_HE_KEY_UTF8
177 =for apidoc Amx|SV *|cophh_fetch_pvn|const COPHH *cophh|const char *keypv|STRLEN keylen|U32 hash|U32 flags
179 Look up the entry in the cop hints hash C<cophh> with the key specified by
180 C<keypv> and C<keylen>. If C<flags> has the C<COPHH_KEY_UTF8> bit set,
181 the key octets are interpreted as UTF-8, otherwise they are interpreted
182 as Latin-1. C<hash> is a precomputed hash of the key string, or zero if
183 it has not been precomputed. Returns a mortal scalar copy of the value
184 associated with the key, or C<&PL_sv_placeholder> if there is no value
185 associated with the key.
187 =for apidoc Amnh||COPHH_KEY_UTF8
192 #define cophh_fetch_pvn(cophh, keypv, keylen, hash, flags) \
193 Perl_refcounted_he_fetch_pvn(aTHX_ cophh, keypv, keylen, hash, flags)
196 =for apidoc Amx|SV *|cophh_fetch_pvs|const COPHH *cophh|"key"|U32 flags
198 Like L</cophh_fetch_pvn>, but takes a literal string instead
199 of a string/length pair, and no precomputed hash.
204 #define cophh_fetch_pvs(cophh, key, flags) \
205 Perl_refcounted_he_fetch_pvn(aTHX_ cophh, STR_WITH_LEN(key), 0, flags)
208 =for apidoc Amx|SV *|cophh_fetch_pv|const COPHH *cophh|const char *key|U32 hash|U32 flags
210 Like L</cophh_fetch_pvn>, but takes a nul-terminated string instead of
211 a string/length pair.
216 #define cophh_fetch_pv(cophh, key, hash, flags) \
217 Perl_refcounted_he_fetch_pv(aTHX_ cophh, key, hash, flags)
220 =for apidoc Amx|SV *|cophh_fetch_sv|const COPHH *cophh|SV *key|U32 hash|U32 flags
222 Like L</cophh_fetch_pvn>, but takes a Perl scalar instead of a
228 #define cophh_fetch_sv(cophh, key, hash, flags) \
229 Perl_refcounted_he_fetch_sv(aTHX_ cophh, key, hash, flags)
232 =for apidoc Amx|HV *|cophh_2hv|const COPHH *cophh|U32 flags
234 Generates and returns a standard Perl hash representing the full set of
235 key/value pairs in the cop hints hash C<cophh>. C<flags> is currently
236 unused and must be zero.
241 #define cophh_2hv(cophh, flags) \
242 Perl_refcounted_he_chain_2hv(aTHX_ cophh, flags)
245 =for apidoc Amx|COPHH *|cophh_copy|COPHH *cophh
247 Make and return a complete copy of the cop hints hash C<cophh>.
252 #define cophh_copy(cophh) Perl_refcounted_he_inc(aTHX_ cophh)
255 =for apidoc Amx|void|cophh_free|COPHH *cophh
257 Discard the cop hints hash C<cophh>, freeing all resources associated
263 #define cophh_free(cophh) Perl_refcounted_he_free(aTHX_ cophh)
266 =for apidoc Amx|COPHH *|cophh_new_empty
268 Generate and return a fresh cop hints hash containing no entries.
273 #define cophh_new_empty() ((COPHH *)NULL)
276 =for apidoc Amx|COPHH *|cophh_store_pvn|COPHH *cophh|const char *keypv|STRLEN keylen|U32 hash|SV *value|U32 flags
278 Stores a value, associated with a key, in the cop hints hash C<cophh>,
279 and returns the modified hash. The returned hash pointer is in general
280 not the same as the hash pointer that was passed in. The input hash is
281 consumed by the function, and the pointer to it must not be subsequently
282 used. Use L</cophh_copy> if you need both hashes.
284 The key is specified by C<keypv> and C<keylen>. If C<flags> has the
285 C<COPHH_KEY_UTF8> bit set, the key octets are interpreted as UTF-8,
286 otherwise they are interpreted as Latin-1. C<hash> is a precomputed
287 hash of the key string, or zero if it has not been precomputed.
289 C<value> is the scalar value to store for this key. C<value> is copied
290 by this function, which thus does not take ownership of any reference
291 to it, and later changes to the scalar will not be reflected in the
292 value visible in the cop hints hash. Complex types of scalar will not
293 be stored with referential integrity, but will be coerced to strings.
298 #define cophh_store_pvn(cophh, keypv, keylen, hash, value, flags) \
299 Perl_refcounted_he_new_pvn(aTHX_ cophh, keypv, keylen, hash, value, flags)
302 =for apidoc Amx|COPHH *|cophh_store_pvs|const COPHH *cophh|"key"|SV *value|U32 flags
304 Like L</cophh_store_pvn>, but takes a literal string instead
305 of a string/length pair, and no precomputed hash.
310 #define cophh_store_pvs(cophh, key, value, flags) \
311 Perl_refcounted_he_new_pvn(aTHX_ cophh, STR_WITH_LEN(key), 0, value, flags)
314 =for apidoc Amx|COPHH *|cophh_store_pv|const COPHH *cophh|const char *key|U32 hash|SV *value|U32 flags
316 Like L</cophh_store_pvn>, but takes a nul-terminated string instead of
317 a string/length pair.
322 #define cophh_store_pv(cophh, key, hash, value, flags) \
323 Perl_refcounted_he_new_pv(aTHX_ cophh, key, hash, value, flags)
326 =for apidoc Amx|COPHH *|cophh_store_sv|const COPHH *cophh|SV *key|U32 hash|SV *value|U32 flags
328 Like L</cophh_store_pvn>, but takes a Perl scalar instead of a
334 #define cophh_store_sv(cophh, key, hash, value, flags) \
335 Perl_refcounted_he_new_sv(aTHX_ cophh, key, hash, value, flags)
338 =for apidoc Amx|COPHH *|cophh_delete_pvn|COPHH *cophh|const char *keypv|STRLEN keylen|U32 hash|U32 flags
340 Delete a key and its associated value from the cop hints hash C<cophh>,
341 and returns the modified hash. The returned hash pointer is in general
342 not the same as the hash pointer that was passed in. The input hash is
343 consumed by the function, and the pointer to it must not be subsequently
344 used. Use L</cophh_copy> if you need both hashes.
346 The key is specified by C<keypv> and C<keylen>. If C<flags> has the
347 C<COPHH_KEY_UTF8> bit set, the key octets are interpreted as UTF-8,
348 otherwise they are interpreted as Latin-1. C<hash> is a precomputed
349 hash of the key string, or zero if it has not been precomputed.
354 #define cophh_delete_pvn(cophh, keypv, keylen, hash, flags) \
355 Perl_refcounted_he_new_pvn(aTHX_ cophh, keypv, keylen, hash, \
359 =for apidoc Amx|COPHH *|cophh_delete_pvs|const COPHH *cophh|"key"|U32 flags
361 Like L</cophh_delete_pvn>, but takes a literal string instead
362 of a string/length pair, and no precomputed hash.
367 #define cophh_delete_pvs(cophh, key, flags) \
368 Perl_refcounted_he_new_pvn(aTHX_ cophh, STR_WITH_LEN(key), 0, \
372 =for apidoc Amx|COPHH *|cophh_delete_pv|const COPHH *cophh|const char *key|U32 hash|U32 flags
374 Like L</cophh_delete_pvn>, but takes a nul-terminated string instead of
375 a string/length pair.
380 #define cophh_delete_pv(cophh, key, hash, flags) \
381 Perl_refcounted_he_new_pv(aTHX_ cophh, key, hash, (SV *)NULL, flags)
384 =for apidoc Amx|COPHH *|cophh_delete_sv|const COPHH *cophh|SV *key|U32 hash|U32 flags
386 Like L</cophh_delete_pvn>, but takes a Perl scalar instead of a
392 #define cophh_delete_sv(cophh, key, hash, flags) \
393 Perl_refcounted_he_new_sv(aTHX_ cophh, key, hash, (SV *)NULL, flags)
395 #include "mydtrace.h"
399 /* On LP64 putting this here takes advantage of the fact that BASEOP isn't
400 an exact multiple of 8 bytes to save structure padding. */
401 line_t cop_line; /* line # of this command */
402 /* label for this construct is now stored in cop_hints_hash */
404 PADOFFSET cop_stashoff; /* offset into PL_stashpad, for the
405 package the line was compiled in */
406 char * cop_file; /* file name the following line # is from */
408 HV * cop_stash; /* package line was compiled in */
409 GV * cop_filegv; /* file the following line # is from */
411 U32 cop_hints; /* hints bits from pragmata */
412 U32 cop_seq; /* parse sequence number */
413 /* Beware. mg.c and warnings.pl assume the type of this is STRLEN *: */
414 STRLEN * cop_warnings; /* lexical warnings bitmask */
415 /* compile time state of %^H. See the comment in op.c for how this is
416 used to recreate a hash to return from caller. */
417 COPHH * cop_hints_hash;
418 /* for now just a bitmask stored here.
419 If we get sufficient features this may become a pointer.
420 How these flags are stored is subject to change without
421 notice. Use the macros to test for features.
427 # define CopFILE(c) ((c)->cop_file)
428 # define CopFILEGV(c) (CopFILE(c) \
429 ? gv_fetchfile(CopFILE(c)) : NULL)
432 # define CopFILE_set(c,pv) ((c)->cop_file = savepv(pv))
433 # define CopFILE_setn(c,pv,l) ((c)->cop_file = savepvn((pv),(l)))
435 # define CopFILE_set(c,pv) ((c)->cop_file = savesharedpv(pv))
436 # define CopFILE_setn(c,pv,l) ((c)->cop_file = savesharedpvn((pv),(l)))
439 # define CopFILESV(c) (CopFILE(c) \
440 ? GvSV(gv_fetchfile(CopFILE(c))) : NULL)
441 # define CopFILEAV(c) (CopFILE(c) \
442 ? GvAV(gv_fetchfile(CopFILE(c))) : NULL)
443 # define CopFILEAVx(c) (assert_(CopFILE(c)) \
444 GvAV(gv_fetchfile(CopFILE(c))))
446 # define CopSTASH(c) PL_stashpad[(c)->cop_stashoff]
447 # define CopSTASH_set(c,hv) ((c)->cop_stashoff = (hv) \
448 ? alloccopstash(hv) \
451 # define CopFILE_free(c) SAVECOPFILE_FREE(c)
453 # define CopFILE_free(c) (PerlMemShared_free(CopFILE(c)),(CopFILE(c) = NULL))
456 # define CopFILEGV(c) ((c)->cop_filegv)
457 # define CopFILEGV_set(c,gv) ((c)->cop_filegv = (GV*)SvREFCNT_inc(gv))
458 # define CopFILE_set(c,pv) CopFILEGV_set((c), gv_fetchfile(pv))
459 # define CopFILE_setn(c,pv,l) CopFILEGV_set((c), gv_fetchfile_flags((pv),(l),0))
460 # define CopFILESV(c) (CopFILEGV(c) ? GvSV(CopFILEGV(c)) : NULL)
461 # define CopFILEAV(c) (CopFILEGV(c) ? GvAV(CopFILEGV(c)) : NULL)
463 # define CopFILEAVx(c) (assert(CopFILEGV(c)), GvAV(CopFILEGV(c)))
465 # define CopFILEAVx(c) (GvAV(CopFILEGV(c)))
467 # define CopFILE(c) (CopFILEGV(c) \
468 ? GvNAME(CopFILEGV(c))+2 : NULL)
469 # define CopSTASH(c) ((c)->cop_stash)
470 # define CopSTASH_set(c,hv) ((c)->cop_stash = (hv))
471 # define CopFILE_free(c) (SvREFCNT_dec(CopFILEGV(c)),(CopFILEGV(c) = NULL))
473 #endif /* USE_ITHREADS */
475 #define CopSTASHPV(c) (CopSTASH(c) ? HvNAME_get(CopSTASH(c)) : NULL)
476 /* cop_stash is not refcounted */
477 #define CopSTASHPV_set(c,pv) CopSTASH_set((c), gv_stashpv(pv,GV_ADD))
478 #define CopSTASH_eq(c,hv) (CopSTASH(c) == (hv))
480 #define CopHINTHASH_get(c) ((COPHH*)((c)->cop_hints_hash))
481 #define CopHINTHASH_set(c,h) ((c)->cop_hints_hash = (h))
484 =head1 COP Hint Reading
488 =for apidoc Am|SV *|cop_hints_fetch_pvn|const COP *cop|const char *keypv|STRLEN keylen|U32 hash|U32 flags
490 Look up the hint entry in the cop C<cop> with the key specified by
491 C<keypv> and C<keylen>. If C<flags> has the C<COPHH_KEY_UTF8> bit set,
492 the key octets are interpreted as UTF-8, otherwise they are interpreted
493 as Latin-1. C<hash> is a precomputed hash of the key string, or zero if
494 it has not been precomputed. Returns a mortal scalar copy of the value
495 associated with the key, or C<&PL_sv_placeholder> if there is no value
496 associated with the key.
501 #define cop_hints_fetch_pvn(cop, keypv, keylen, hash, flags) \
502 cophh_fetch_pvn(CopHINTHASH_get(cop), keypv, keylen, hash, flags)
505 =for apidoc Am|SV *|cop_hints_fetch_pvs|const COP *cop|"key"|U32 flags
507 Like L</cop_hints_fetch_pvn>, but takes a literal string
508 instead of a string/length pair, and no precomputed hash.
513 #define cop_hints_fetch_pvs(cop, key, flags) \
514 cophh_fetch_pvs(CopHINTHASH_get(cop), key, flags)
517 =for apidoc Am|SV *|cop_hints_fetch_pv|const COP *cop|const char *key|U32 hash|U32 flags
519 Like L</cop_hints_fetch_pvn>, but takes a nul-terminated string instead
520 of a string/length pair.
525 #define cop_hints_fetch_pv(cop, key, hash, flags) \
526 cophh_fetch_pv(CopHINTHASH_get(cop), key, hash, flags)
529 =for apidoc Am|SV *|cop_hints_fetch_sv|const COP *cop|SV *key|U32 hash|U32 flags
531 Like L</cop_hints_fetch_pvn>, but takes a Perl scalar instead of a
537 #define cop_hints_fetch_sv(cop, key, hash, flags) \
538 cophh_fetch_sv(CopHINTHASH_get(cop), key, hash, flags)
541 =for apidoc Am|HV *|cop_hints_2hv|const COP *cop|U32 flags
543 Generates and returns a standard Perl hash representing the full set of
544 hint entries in the cop C<cop>. C<flags> is currently unused and must
550 #define cop_hints_2hv(cop, flags) \
551 cophh_2hv(CopHINTHASH_get(cop), flags)
554 =for apidoc Am|const char *|CopLABEL|COP *const cop
556 Returns the label attached to a cop.
558 =for apidoc Am|const char *|CopLABEL_len|COP *const cop|STRLEN *len
560 Returns the label attached to a cop, and stores its length in bytes into
563 =for apidoc Am|const char *|CopLABEL_len_flags|COP *const cop|STRLEN *len|U32 *flags
565 Returns the label attached to a cop, and stores its length in bytes into
566 C<*len>. Upon return, C<*flags> will be set to either C<SVf_UTF8> or 0.
571 #define CopLABEL(c) Perl_cop_fetch_label(aTHX_ (c), NULL, NULL)
572 #define CopLABEL_len(c,len) Perl_cop_fetch_label(aTHX_ (c), len, NULL)
573 #define CopLABEL_len_flags(c,len,flags) Perl_cop_fetch_label(aTHX_ (c), len, flags)
574 #define CopLABEL_alloc(pv) ((pv)?savepv(pv):NULL)
576 #define CopSTASH_ne(c,hv) (!CopSTASH_eq(c,hv))
577 #define CopLINE(c) ((c)->cop_line)
578 #define CopLINE_inc(c) (++CopLINE(c))
579 #define CopLINE_dec(c) (--CopLINE(c))
580 #define CopLINE_set(c,l) (CopLINE(c) = (l))
582 /* OutCopFILE() is CopFILE for output (caller, die, warn, etc.) */
583 #define OutCopFILE(c) CopFILE(c)
585 #define CopHINTS_get(c) ((c)->cop_hints + 0)
586 #define CopHINTS_set(c, h) STMT_START { \
587 (c)->cop_hints = (h); \
591 * Here we have some enormously heavy (or at least ponderous) wizardry.
594 /* subroutine context */
596 OP * retop; /* op to execute on exit from sub */
597 I32 old_cxsubix; /* previous value of si_cxsubix */
598 /* Above here is the same for sub, format and eval. */
599 PAD *prevcomppad; /* the caller's PL_comppad */
601 /* Above here is the same for sub and format. */
608 struct block_format {
609 OP * retop; /* op to execute on exit from sub */
610 I32 old_cxsubix; /* previous value of si_cxsubix */
611 /* Above here is the same for sub, format and eval. */
612 PAD *prevcomppad; /* the caller's PL_comppad */
614 /* Above here is the same for sub and format. */
619 /* return a pointer to the current context */
621 #define CX_CUR() (&cxstack[cxstack_ix])
623 /* free all savestack items back to the watermark of the specified context */
625 #define CX_LEAVE_SCOPE(cx) LEAVE_SCOPE(cx->blk_oldsaveix)
628 /* on debugging builds, poison cx afterwards so we know no code
629 * uses it - because after doing cxstack_ix--, any ties, exceptions etc
630 * may overwrite the current stack frame */
631 # define CX_POP(cx) \
632 assert(CX_CUR() == cx); \
636 # define CX_POP(cx) cxstack_ix--;
640 /* base for the next two macros. Don't use directly.
641 * The context frame holds a reference to the CV so that it can't be
642 * freed while we're executing it */
645 #define CX_PUSHSUB_GET_LVALUE_MASK(func) \
646 /* If the context is indeterminate, then only the lvalue */ \
647 /* flags that the caller also has are applicable. */ \
649 (PL_op->op_flags & OPf_WANT) \
650 ? OPpENTERSUB_LVAL_MASK \
651 : !(PL_op->op_private & OPpENTERSUB_LVAL_MASK) \
652 ? 0 : (U8)func(aTHX) \
656 #define CX_POP_SAVEARRAY(cx) \
658 AV *cx_pop_savearray_av = GvAV(PL_defgv); \
659 GvAV(PL_defgv) = cx->blk_sub.savearray; \
660 cx->blk_sub.savearray = NULL; \
661 SvREFCNT_dec(cx_pop_savearray_av); \
664 /* junk in @_ spells trouble when cloning CVs and in pp_caller(), so don't
665 * leave any (a fast av_clear(ary), basically) */
666 #define CLEAR_ARGARRAY(ary) \
668 AvMAX(ary) += AvARRAY(ary) - AvALLOC(ary); \
669 AvARRAY(ary) = AvALLOC(ary); \
676 OP * retop; /* op to execute on exit from eval */
677 I32 old_cxsubix; /* previous value of si_cxsubix */
678 /* Above here is the same for sub, format and eval. */
683 JMPENV * cur_top_env; /* value of PL_top_env when eval CX created */
686 /* If we ever need more than 512 op types, change the shift from 7.
687 blku_gimme is actually also only 2 bits, so could be merged with something.
690 /* blk_u16 bit usage for eval contexts: */
692 #define CxOLD_IN_EVAL(cx) (((cx)->blk_u16) & 0x3F) /* saved PL in_eval */
693 #define CxEVAL_TXT_REFCNTED(cx) (((cx)->blk_u16) & 0x40) /* cur_text rc++ */
694 #define CxOLD_OP_TYPE(cx) (((cx)->blk_u16) >> 7) /* type of eval op */
698 LOOP * my_op; /* My op, that contains redo, next and last ops. */
699 union { /* different ways of locating the iteration variable */
700 SV **svp; /* for lexicals: address of pad slot */
701 GV *gv; /* for package vars */
703 SV *itersave; /* the original iteration var */
705 struct { /* CXt_LOOP_ARY, C<for (@ary)> */
706 AV *ary; /* array being iterated over */
707 IV ix; /* index relative to base of array */
709 struct { /* CXt_LOOP_LIST, C<for (list)> */
710 I32 basesp; /* first element of list on stack */
711 IV ix; /* index relative to basesp */
713 struct { /* CXt_LOOP_LAZYIV, C<for (1..9)> */
717 struct { /* CXt_LOOP_LAZYSV C<for ('a'..'z')> */
719 SV * end; /* maxiumum value (or minimum in reverse) */
723 PAD *oldcomppad; /* needed to map itervar_u.svp during thread clone */
727 #define CxITERVAR(c) \
729 ? (c)->blk_loop.itervar_u.svp \
730 : ((c)->cx_type & CXp_FOR_GV) \
731 ? &GvSV((c)->blk_loop.itervar_u.gv) \
732 : (SV **)&(c)->blk_loop.itervar_u.gv)
734 #define CxLABEL(c) (0 + CopLABEL((c)->blk_oldcop))
735 #define CxLABEL_len(c,len) (0 + CopLABEL_len((c)->blk_oldcop, len))
736 #define CxLABEL_len_flags(c,len,flags) (0 + CopLABEL_len_flags((c)->blk_oldcop, len, flags))
737 #define CxHASARGS(c) (((c)->cx_type & CXp_HASARGS) == CXp_HASARGS)
739 /* CxLVAL(): the lval flags of the call site: the relevant flag bits from
740 * the op_private field of the calling pp_entersub (or its caller's caller
741 * if the caller's lvalue context isn't known):
742 * OPpLVAL_INTRO: sub used in lvalue context, e.g. f() = 1;
743 * OPpENTERSUB_INARGS (in conjunction with OPpLVAL_INTRO): the
744 * function is being used as a sub arg or as a referent, e.g.
745 * g(...,f(),...) or $r = \f()
746 * OPpDEREF: 2-bit mask indicating e.g. f()->[0].
747 * Note the contrast with CvLVALUE(), which is a property of the sub
748 * rather than the call site.
750 #define CxLVAL(c) (0 + ((c)->blk_u16 & 0xff))
754 /* given/when context */
755 struct block_givwhen {
757 SV *defsv_save; /* the original $_ */
762 /* context common to subroutines, evals and loops */
764 U8 blku_type; /* what kind of context this is */
765 U8 blku_gimme; /* is this block running in list context? */
766 U16 blku_u16; /* used by block_sub and block_eval (so far) */
767 I32 blku_oldsaveix; /* saved PL_savestack_ix */
768 /* all the fields above must be aligned with same-sized fields as sbu */
769 I32 blku_oldsp; /* current sp floor: where nextstate pops to */
770 I32 blku_oldmarksp; /* mark stack index */
771 COP * blku_oldcop; /* old curcop pointer */
772 PMOP * blku_oldpm; /* values of pattern match vars */
773 SSize_t blku_old_tmpsfloor; /* saved PL_tmps_floor */
774 I32 blku_oldscopesp; /* scope stack index */
777 struct block_sub blku_sub;
778 struct block_format blku_format;
779 struct block_eval blku_eval;
780 struct block_loop blku_loop;
781 struct block_givwhen blku_givwhen;
784 #define blk_oldsp cx_u.cx_blk.blku_oldsp
785 #define blk_oldcop cx_u.cx_blk.blku_oldcop
786 #define blk_oldmarksp cx_u.cx_blk.blku_oldmarksp
787 #define blk_oldscopesp cx_u.cx_blk.blku_oldscopesp
788 #define blk_oldpm cx_u.cx_blk.blku_oldpm
789 #define blk_gimme cx_u.cx_blk.blku_gimme
790 #define blk_u16 cx_u.cx_blk.blku_u16
791 #define blk_oldsaveix cx_u.cx_blk.blku_oldsaveix
792 #define blk_old_tmpsfloor cx_u.cx_blk.blku_old_tmpsfloor
793 #define blk_sub cx_u.cx_blk.blk_u.blku_sub
794 #define blk_format cx_u.cx_blk.blk_u.blku_format
795 #define blk_eval cx_u.cx_blk.blk_u.blku_eval
796 #define blk_loop cx_u.cx_blk.blk_u.blku_loop
797 #define blk_givwhen cx_u.cx_blk.blk_u.blku_givwhen
799 #define CX_DEBUG(cx, action) \
801 Perl_deb(aTHX_ "CX %ld %s %s (scope %ld,%ld) (save %ld,%ld) at %s:%d\n",\
804 PL_block_type[CxTYPE(cx)], \
805 (long)PL_scopestack_ix, \
806 (long)(cx->blk_oldscopesp), \
807 (long)PL_savestack_ix, \
808 (long)(cx->blk_oldsaveix), \
809 __FILE__, __LINE__));
813 /* substitution context */
815 U8 sbu_type; /* same as blku_type */
818 I32 sbu_oldsaveix; /* same as blku_oldsaveix */
819 /* all the fields above must be aligned with same-sized fields as blk_u */
821 SSize_t sbu_maxiters;
831 #define sb_iters cx_u.cx_subst.sbu_iters
832 #define sb_maxiters cx_u.cx_subst.sbu_maxiters
833 #define sb_rflags cx_u.cx_subst.sbu_rflags
834 #define sb_rxtainted cx_u.cx_subst.sbu_rxtainted
835 #define sb_orig cx_u.cx_subst.sbu_orig
836 #define sb_dstr cx_u.cx_subst.sbu_dstr
837 #define sb_targ cx_u.cx_subst.sbu_targ
838 #define sb_s cx_u.cx_subst.sbu_s
839 #define sb_m cx_u.cx_subst.sbu_m
840 #define sb_strend cx_u.cx_subst.sbu_strend
841 #define sb_rxres cx_u.cx_subst.sbu_rxres
842 #define sb_rx cx_u.cx_subst.sbu_rx
845 # define CX_PUSHSUBST(cx) CXINC, cx = CX_CUR(), \
846 cx->blk_oldsaveix = oldsave, \
847 cx->sb_iters = iters, \
848 cx->sb_maxiters = maxiters, \
849 cx->sb_rflags = r_flags, \
850 cx->sb_rxtainted = rxtainted, \
851 cx->sb_orig = orig, \
852 cx->sb_dstr = dstr, \
853 cx->sb_targ = targ, \
856 cx->sb_strend = strend, \
857 cx->sb_rxres = NULL, \
859 cx->cx_type = CXt_SUBST | (once ? CXp_ONCE : 0); \
860 rxres_save(&cx->sb_rxres, rx); \
861 (void)ReREFCNT_inc(rx); \
862 SvREFCNT_inc_void_NN(targ)
864 # define CX_POPSUBST(cx) \
867 assert(CxTYPE(cx) == CXt_SUBST); \
868 rxres_free(&cx->sb_rxres); \
872 SvREFCNT_dec_NN(cx->sb_targ); \
876 #define CxONCE(cx) ((cx)->cx_type & CXp_ONCE)
881 struct subst cx_subst;
884 #define cx_type cx_u.cx_subst.sbu_type
886 /* If you re-order these, there is also an array of uppercase names in perl.h
887 and a static array of context names in pp_ctl.c */
888 #define CXTYPEMASK 0xf
889 #define CXt_NULL 0 /* currently only used for sort BLOCK */
892 /* When micro-optimising :-) keep GIVEN next to the LOOPs, as these 5 share a
893 jump table in pp_ctl.c
894 The first 4 don't have a 'case' in at least one switch statement in pp_ctl.c
898 /* be careful of the ordering of these five. Macros like CxTYPE_is_LOOP,
899 * CxFOREACH compare ranges */
900 #define CXt_LOOP_ARY 4 /* for (@ary) { ...; } */
901 #define CXt_LOOP_LAZYSV 5 /* for ('a'..'z') { ...; } */
902 #define CXt_LOOP_LAZYIV 6 /* for (1..9) { ...; } */
903 #define CXt_LOOP_LIST 7 /* for (1,2,3) { ...; } */
904 #define CXt_LOOP_PLAIN 8 /* while (...) { ...; }
905 or plain block { ...; } */
907 #define CXt_FORMAT 10
910 /* SUBST doesn't feature in all switch statements. */
912 /* private flags for CXt_SUB and CXt_FORMAT */
913 #define CXp_MULTICALL 0x10 /* part of a multicall (so don't tear down
914 context on exit). (not CXt_FORMAT) */
915 #define CXp_HASARGS 0x20
916 #define CXp_SUB_RE 0x40 /* code called within regex, i.e. (?{}) */
917 #define CXp_SUB_RE_FAKE 0x80 /* fake sub CX for (?{}) in current scope */
919 /* private flags for CXt_EVAL */
920 #define CXp_REAL 0x20 /* truly eval'', not a lookalike */
921 #define CXp_TRYBLOCK 0x40 /* eval{}, not eval'' or similar */
923 /* private flags for CXt_LOOP */
925 /* this is only set in conjunction with CXp_FOR_GV */
926 #define CXp_FOR_DEF 0x10 /* foreach using $_ */
927 /* these 3 are mutually exclusive */
928 #define CXp_FOR_LVREF 0x20 /* foreach using \$var */
929 #define CXp_FOR_GV 0x40 /* foreach using package var */
930 #define CXp_FOR_PAD 0x80 /* foreach using lexical var */
932 #define CxPADLOOP(c) ((c)->cx_type & CXp_FOR_PAD)
934 /* private flags for CXt_SUBST */
935 #define CXp_ONCE 0x10 /* What was sbu_once in struct subst */
937 #define CxTYPE(c) ((c)->cx_type & CXTYPEMASK)
938 #define CxTYPE_is_LOOP(c) ( CxTYPE(cx) >= CXt_LOOP_ARY \
939 && CxTYPE(cx) <= CXt_LOOP_PLAIN)
940 #define CxMULTICALL(c) ((c)->cx_type & CXp_MULTICALL)
941 #define CxREALEVAL(c) (((c)->cx_type & (CXTYPEMASK|CXp_REAL)) \
942 == (CXt_EVAL|CXp_REAL))
943 #define CxTRYBLOCK(c) (((c)->cx_type & (CXTYPEMASK|CXp_TRYBLOCK)) \
944 == (CXt_EVAL|CXp_TRYBLOCK))
945 #define CxFOREACH(c) ( CxTYPE(cx) >= CXt_LOOP_ARY \
946 && CxTYPE(cx) <= CXt_LOOP_LIST)
948 #define CXINC (cxstack_ix < cxstack_max ? ++cxstack_ix : (cxstack_ix = cxinc()))
951 =head1 "Gimme" Values
955 =for apidoc AmnU||G_SCALAR
956 Used to indicate scalar context. See C<L</GIMME_V>>, C<L</GIMME>>, and
959 =for apidoc AmnU||G_ARRAY
960 Used to indicate list context. See C<L</GIMME_V>>, C<L</GIMME>> and
963 =for apidoc AmnU||G_VOID
964 Used to indicate void context. See C<L</GIMME_V>> and L<perlcall>.
966 =for apidoc AmnU||G_DISCARD
967 Indicates that arguments returned from a callback should be discarded. See
970 =for apidoc AmnU||G_EVAL
972 Used to force a Perl C<eval> wrapper around a callback. See
975 =for apidoc AmnU||G_NOARGS
977 Indicates that no arguments are being sent to a callback. See
988 /* extra flags for Perl_call_* routines */
989 #define G_DISCARD 0x4 /* Call FREETMPS.
990 Don't change this without consulting the
991 hash actions codes defined in hv.h */
992 #define G_EVAL 0x8 /* Assume eval {} around subroutine call. */
993 #define G_NOARGS 0x10 /* Don't construct a @_ array. */
994 #define G_KEEPERR 0x20 /* Warn for errors, don't overwrite $@ */
995 #define G_NODEBUG 0x40 /* Disable debugging at toplevel. */
996 #define G_METHOD 0x80 /* Calling method. */
997 #define G_FAKINGEVAL 0x100 /* Faking an eval context for call_sv or
999 #define G_UNDEF_FILL 0x200 /* Fill the stack with &PL_sv_undef
1000 A special case for UNSHIFT in
1001 Perl_magic_methcall(). */
1002 #define G_WRITING_TO_STDERR 0x400 /* Perl_write_to_stderr() is calling
1003 Perl_magic_methcall(). */
1004 #define G_RE_REPARSING 0x800 /* compiling a run-time /(?{..})/ */
1005 #define G_METHOD_NAMED 0x1000 /* calling named method, eg without :: or ' */
1006 #define G_RETHROW 0x2000 /* eval_sv(): re-throw any error */
1008 /* flag bits for PL_in_eval */
1009 #define EVAL_NULL 0 /* not in an eval */
1010 #define EVAL_INEVAL 1 /* some enclosing scope is an eval */
1011 #define EVAL_WARNONLY 2 /* used by yywarn() when calling yyerror() */
1012 #define EVAL_KEEPERR 4 /* set by Perl_call_sv if G_KEEPERR */
1013 #define EVAL_INREQUIRE 8 /* The code is being required. */
1014 #define EVAL_RE_REPARSING 0x10 /* eval_sv() called with G_RE_REPARSING */
1015 /* if adding extra bits, make sure they can fit in CxOLD_OP_TYPE() */
1017 /* Support for switching (stack and block) contexts.
1018 * This ensures magic doesn't invalidate local stack and cx pointers.
1021 #define PERLSI_UNKNOWN -1
1022 #define PERLSI_UNDEF 0
1023 #define PERLSI_MAIN 1
1024 #define PERLSI_MAGIC 2
1025 #define PERLSI_SORT 3
1026 #define PERLSI_SIGNAL 4
1027 #define PERLSI_OVERLOAD 5
1028 #define PERLSI_DESTROY 6
1029 #define PERLSI_WARNHOOK 7
1030 #define PERLSI_DIEHOOK 8
1031 #define PERLSI_REQUIRE 9
1032 #define PERLSI_MULTICALL 10
1035 AV * si_stack; /* stack for current runlevel */
1036 PERL_CONTEXT * si_cxstack; /* context stack for runlevel */
1037 struct stackinfo * si_prev;
1038 struct stackinfo * si_next;
1039 I32 si_cxix; /* current context index */
1040 I32 si_cxmax; /* maximum allocated index */
1041 I32 si_cxsubix; /* topmost sub/eval/format */
1042 I32 si_type; /* type of runlevel */
1043 I32 si_markoff; /* offset where markstack begins for us.
1044 * currently used only with DEBUGGING,
1045 * but not #ifdef-ed for bincompat */
1046 #if defined DEBUGGING && !defined DEBUGGING_RE_ONLY
1047 /* high water mark: for checking if the stack was correctly extended /
1048 * tested for extension by each pp function */
1049 SSize_t si_stack_hwm;
1054 typedef struct stackinfo PERL_SI;
1056 #define cxstack (PL_curstackinfo->si_cxstack)
1057 #define cxstack_ix (PL_curstackinfo->si_cxix)
1058 #define cxstack_max (PL_curstackinfo->si_cxmax)
1061 # define SET_MARK_OFFSET \
1062 PL_curstackinfo->si_markoff = PL_markstack_ptr - PL_markstack
1064 # define SET_MARK_OFFSET NOOP
1067 #if defined DEBUGGING && !defined DEBUGGING_RE_ONLY
1068 # define PUSHSTACK_INIT_HWM(si) ((si)->si_stack_hwm = 0)
1070 # define PUSHSTACK_INIT_HWM(si) NOOP
1073 #define PUSHSTACKi(type) \
1075 PERL_SI *next = PL_curstackinfo->si_next; \
1077 int i = 0; PERL_SI *p = PL_curstackinfo; \
1078 while (p) { i++; p = p->si_prev; } \
1079 Perl_deb(aTHX_ "push STACKINFO %d at %s:%d\n", \
1080 i, __FILE__, __LINE__);}) \
1082 next = new_stackinfo(32, 2048/sizeof(PERL_CONTEXT) - 1); \
1083 next->si_prev = PL_curstackinfo; \
1084 PL_curstackinfo->si_next = next; \
1086 next->si_type = type; \
1087 next->si_cxix = -1; \
1088 next->si_cxsubix = -1; \
1089 PUSHSTACK_INIT_HWM(next); \
1090 AvFILLp(next->si_stack) = 0; \
1091 SWITCHSTACK(PL_curstack,next->si_stack); \
1092 PL_curstackinfo = next; \
1096 #define PUSHSTACK PUSHSTACKi(PERLSI_UNKNOWN)
1098 /* POPSTACK works with PL_stack_sp, so it may need to be bracketed by
1099 * PUTBACK/SPAGAIN to flush/refresh any local SP that may be active */
1103 PERL_SI * const prev = PL_curstackinfo->si_prev; \
1105 int i = -1; PERL_SI *p = PL_curstackinfo; \
1106 while (p) { i++; p = p->si_prev; } \
1107 Perl_deb(aTHX_ "pop STACKINFO %d at %s:%d\n", \
1108 i, __FILE__, __LINE__);}) \
1110 Perl_croak_popstack(); \
1112 SWITCHSTACK(PL_curstack,prev->si_stack); \
1113 /* don't free prev here, free them all at the END{} */ \
1114 PL_curstackinfo = prev; \
1117 #define POPSTACK_TO(s) \
1119 while (PL_curstack != s) { \
1125 #define IN_PERL_COMPILETIME cBOOL(PL_curcop == &PL_compiling)
1126 #define IN_PERL_RUNTIME cBOOL(PL_curcop != &PL_compiling)
1132 =head1 Multicall Functions
1134 =for apidoc Amns||dMULTICALL
1135 Declare local variables for a multicall. See L<perlcall/LIGHTWEIGHT CALLBACKS>.
1137 =for apidoc Ams||PUSH_MULTICALL|CV* the_cv
1138 Opening bracket for a lightweight callback.
1139 See L<perlcall/LIGHTWEIGHT CALLBACKS>.
1141 =for apidoc Amns||MULTICALL
1142 Make a lightweight callback. See L<perlcall/LIGHTWEIGHT CALLBACKS>.
1144 =for apidoc Amns||POP_MULTICALL
1145 Closing bracket for a lightweight callback.
1146 See L<perlcall/LIGHTWEIGHT CALLBACKS>.
1151 #define dMULTICALL \
1152 OP *multicall_cop; \
1153 bool multicall_oldcatch
1155 #define PUSH_MULTICALL(the_cv) \
1156 PUSH_MULTICALL_FLAGS(the_cv, 0)
1158 /* Like PUSH_MULTICALL, but allows you to specify extra flags
1159 * for the CX stack entry (this isn't part of the public API) */
1161 #define PUSH_MULTICALL_FLAGS(the_cv, flags) \
1164 CV * const _nOnclAshIngNamE_ = the_cv; \
1165 CV * const cv = _nOnclAshIngNamE_; \
1166 PADLIST * const padlist = CvPADLIST(cv); \
1167 multicall_oldcatch = CATCH_GET; \
1169 PUSHSTACKi(PERLSI_MULTICALL); \
1170 cx = cx_pushblock((CXt_SUB|CXp_MULTICALL|flags), (U8)gimme, \
1171 PL_stack_sp, PL_savestack_ix); \
1172 cx_pushsub(cx, cv, NULL, 0); \
1174 if (!(flags & CXp_SUB_RE_FAKE)) \
1176 if (CvDEPTH(cv) >= 2) \
1177 Perl_pad_push(aTHX_ padlist, CvDEPTH(cv)); \
1178 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv)); \
1179 multicall_cop = CvSTART(cv); \
1184 PL_op = multicall_cop; \
1188 #define POP_MULTICALL \
1192 CX_LEAVE_SCOPE(cx); \
1193 cx_popsub_common(cx); \
1194 gimme = cx->blk_gimme; \
1195 PERL_UNUSED_VAR(gimme); /* for API */ \
1199 CATCH_SET(multicall_oldcatch); \
1203 /* Change the CV of an already-pushed MULTICALL CxSUB block.
1204 * (this isn't part of the public API) */
1206 #define CHANGE_MULTICALL_FLAGS(the_cv, flags) \
1208 CV * const _nOnclAshIngNamE_ = the_cv; \
1209 CV * const cv = _nOnclAshIngNamE_; \
1210 PADLIST * const padlist = CvPADLIST(cv); \
1211 PERL_CONTEXT *cx = CX_CUR(); \
1212 assert(CxMULTICALL(cx)); \
1213 cx_popsub_common(cx); \
1214 cx->cx_type = (CXt_SUB|CXp_MULTICALL|flags); \
1215 cx_pushsub(cx, cv, NULL, 0); \
1216 if (!(flags & CXp_SUB_RE_FAKE)) \
1218 if (CvDEPTH(cv) >= 2) \
1219 Perl_pad_push(aTHX_ padlist, CvDEPTH(cv)); \
1220 PAD_SET_CUR_NOSAVE(padlist, CvDEPTH(cv)); \
1221 multicall_cop = CvSTART(cv); \
1224 * ex: set ts=8 sts=4 sw=4 et: