This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
[perl #94484] Custom ops trip assertions in new*OP
[perl5.git] / op.h
CommitLineData
a0d0e21e 1/* op.h
79072805 2 *
1129b882
NC
3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 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 *
79072805
LW
9 */
10
11/*
12 * The fields of BASEOP are:
13 * op_next Pointer to next ppcode to execute after this one.
14 * (Top level pre-grafted op points to first op,
15 * but this is replaced when op is grafted in, when
16 * this op will point to the real next op, and the new
17 * parent takes over role of remembering starting op.)
18 * op_ppaddr Pointer to current ppcode's function.
19 * op_type The type of the operation.
2814eb74
PJ
20 * op_opt Whether or not the op has been optimised by the
21 * peephole optimiser.
8be227ab 22 * op_slabbed allocated via opslab
90840c5d
RU
23 * op_static tell op_free() to skip PerlMemShared_free(), when
24 * !op_slabbed.
bb38a9e0 25 * op_savefree on savestack via SAVEFREEOP
3513c740 26 * op_folded Result/remainder of a constant fold operation.
29e61fd9
DM
27 * op_lastsib this op is is the last sibling
28 * op_spare One spare bit
79072805
LW
29 * op_flags Flags common to all operations. See OPf_* below.
30 * op_private Flags peculiar to a particular operation (BUT,
31 * by default, set to the number of children until
32 * the operation is privatized by a check routine,
33 * which may or may not check number of children).
34 */
1850c8f9 35#include "op_reg_common.h"
79072805 36
79072805 37#define OPCODE U16
79072805 38
61a59f30 39typedef PERL_BITFIELD16 Optype;
0053d415 40
0f4eea8f
DL
41#ifdef BASEOP_DEFINITION
42#define BASEOP BASEOP_DEFINITION
43#else
79072805
LW
44#define BASEOP \
45 OP* op_next; \
46 OP* op_sibling; \
16c91539 47 OP* (*op_ppaddr)(pTHX); \
79072805 48 PADOFFSET op_targ; \
654eccd5
JD
49 PERL_BITFIELD16 op_type:9; \
50 PERL_BITFIELD16 op_opt:1; \
8be227ab 51 PERL_BITFIELD16 op_slabbed:1; \
bb38a9e0 52 PERL_BITFIELD16 op_savefree:1; \
90840c5d 53 PERL_BITFIELD16 op_static:1; \
3513c740 54 PERL_BITFIELD16 op_folded:1; \
ea726588 55 PERL_BITFIELD16 op_lastsib:1; \
29e61fd9 56 PERL_BITFIELD16 op_spare:1; \
a0d0e21e
LW
57 U8 op_flags; \
58 U8 op_private;
0f4eea8f 59#endif
79072805 60
0053d415
JD
61/* If op_type:9 is changed to :10, also change PUSHEVAL in cop.h.
62 Also, if the type of op_type is ever changed (e.g. to PERL_BITFIELD32)
63 then all the other bit-fields before/after it should change their
64 types too to let VC pack them into the same 4 byte integer.*/
17347a51 65
fe615074 66/* for efficiency, requires OPf_WANT_VOID == G_VOID etc */
54310121 67#define OP_GIMME(op,dfl) \
fe615074 68 (((op)->op_flags & OPf_WANT) ? ((op)->op_flags & OPf_WANT) : dfl)
54310121 69
2f8edad0 70#define OP_GIMME_REVERSE(flags) ((flags) & G_WANT)
4f911530 71
954c1994 72/*
ccfc67b7
JH
73=head1 "Gimme" Values
74
954c1994
GS
75=for apidoc Amn|U32|GIMME_V
76The XSUB-writer's equivalent to Perl's C<wantarray>. Returns C<G_VOID>,
91e74348 77C<G_SCALAR> or C<G_ARRAY> for void, scalar or list context,
72d33970 78respectively. See L<perlcall> for a usage example.
954c1994
GS
79
80=for apidoc Amn|U32|GIMME
81A backward-compatible version of C<GIMME_V> which can only return
82C<G_SCALAR> or C<G_ARRAY>; in a void context, it returns C<G_SCALAR>.
83Deprecated. Use C<GIMME_V> instead.
84
85=cut
86*/
87
533c011a 88#define GIMME_V OP_GIMME(PL_op, block_gimme())
79072805
LW
89
90/* Public flags */
54310121
PP
91
92#define OPf_WANT 3 /* Mask for "want" bits: */
93#define OPf_WANT_VOID 1 /* Want nothing */
94#define OPf_WANT_SCALAR 2 /* Want single value */
95#define OPf_WANT_LIST 3 /* Want list of any length */
79072805
LW
96#define OPf_KIDS 4 /* There is a firstborn child. */
97#define OPf_PARENS 8 /* This operator was parenthesized. */
463ee0b2 98 /* (Or block needs explicit scope entry.) */
a0d0e21e
LW
99#define OPf_REF 16 /* Certified reference. */
100 /* (Return container, not containee). */
101#define OPf_MOD 32 /* Will modify (lvalue). */
102#define OPf_STACKED 64 /* Some arg is arriving on the stack. */
79072805
LW
103#define OPf_SPECIAL 128 /* Do something weird for this op: */
104 /* On local LVAL, don't init local value. */
105 /* On OP_SORT, subroutine is inlined. */
106 /* On OP_NOT, inversion was implicit. */
a0d0e21e 107 /* On OP_LEAVE, don't restore curpm. */
79072805
LW
108 /* On truncate, we truncate filehandle */
109 /* On control verbs, we saw no label */
110 /* On flipflop, we saw ... instead of .. */
111 /* On UNOPs, saw bare parens, e.g. eof(). */
a2167ea9 112 /* On OP_NULL, saw a "do". */
afebc493 113 /* On OP_EXISTS, treat av as av, not avhv. */
f2ec2afd 114 /* On OP_(ENTER|LEAVE)EVAL, don't clear $@ */
dbc200c5 115 /* On pushre, rx is used as part of split, e.g. split " " */
497711e7 116 /* On regcomp, "use re 'eval'" was in scope */
17fda545
NC
117 /* On RV2[ACGHS]V, don't create GV--in
118 defined()*/
5df8de69
DM
119 /* On OP_DBSTATE, indicates breakpoint
120 * (runtime property) */
6b514a0d 121 /* On OP_REQUIRE, was seen as CORE::require */
fc7debfb
FC
122 /* On OP_(ENTER|LEAVE)WHEN, there's
123 no condition */
0d863452 124 /* On OP_SMARTMATCH, an implicit smartmatch */
78c72037
NC
125 /* On OP_ANONHASH and OP_ANONLIST, create a
126 reference to the new anon hash or array */
fedf30e1
DM
127 /* On OP_HELEM, OP_MULTIDEREF and OP_HSLICE,
128 localization will be followed by assignment,
129 so do not wipe the target if it is special
130 (e.g. a glob or a magic SV) */
2474a784
FC
131 /* On OP_MATCH, OP_SUBST & OP_TRANS, the
132 operand of a logical or conditional
133 that was optimised away, so it should
134 not be bound via =~ */
6b7c6d95 135 /* On OP_CONST, from a constant CV */
d67594ff
FC
136 /* On OP_GLOB, two meanings:
137 - Before ck_glob, called as CORE::glob
138 - After ck_glob, use Perl glob function
139 */
d5524600 140 /* On OP_PADRANGE, push @_ */
7d1d69cb 141 /* On OP_DUMP, has no label */
205681b5 142 /* On OP_UNSTACK, in a C-style for loop */
6d4eed21
FC
143/* There is no room in op_flags for this one, so it has its own bit-
144 field member (op_folded) instead. The flag is only used to tell
145 op_convert_list to set op_folded. */
146#define OPf_FOLDED 1<<16
79072805 147
54310121 148/* old names; don't use in new code, but don't break them, either */
d91ab173
GS
149#define OPf_LIST OPf_WANT_LIST
150#define OPf_KNOW OPf_WANT
954c1994 151
54310121 152#define GIMME \
62a559b8
NIS
153 (PL_op->op_flags & OPf_WANT \
154 ? ((PL_op->op_flags & OPf_WANT) == OPf_WANT_LIST \
d91ab173
GS
155 ? G_ARRAY \
156 : G_SCALAR) \
157 : dowantarray())
54310121 158
1dafeec8 159
f3574cc6
DM
160/* NOTE: OPp* flags are now auto-generated and defined in opcode.h,
161 * from data in regen/op_private */
d41ff1b8 162
a0d0e21e 163
59f00321 164#define OPpTRANS_ALL (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF|OPpTRANS_IDENTICAL|OPpTRANS_SQUASH|OPpTRANS_COMPLEMENT|OPpTRANS_GROWS|OPpTRANS_DELETE)
79072805 165
97e1065a 166
97e1065a 167
f3574cc6
DM
168/* Mask for OP_ENTERSUB flags, the absence of which must be propagated
169 in dynamic context */
777d9014
FC
170#define OPpENTERSUB_LVAL_MASK (OPpLVAL_INTRO|OPpENTERSUB_INARGS)
171
5db1eb8d 172
2f7c6295
DM
173/* things that can be elements of op_aux */
174typedef union {
175 PADOFFSET pad_offset;
176 SV *sv;
177 IV iv;
178 UV uv;
179} UNOP_AUX_item;
180
fedf30e1
DM
181#ifdef USE_ITHREADS
182# define UNOP_AUX_item_sv(item) PAD_SVl((item)->pad_offset);
183#else
184# define UNOP_AUX_item_sv(item) ((item)->sv);
185#endif
186
187
188
60041a09 189
79072805
LW
190struct op {
191 BASEOP
192};
193
194struct unop {
195 BASEOP
196 OP * op_first;
197};
198
2f7c6295
DM
199struct unop_aux {
200 BASEOP
201 OP *op_first;
202 UNOP_AUX_item *op_aux;
203};
204
79072805
LW
205struct binop {
206 BASEOP
207 OP * op_first;
208 OP * op_last;
209};
210
211struct logop {
212 BASEOP
213 OP * op_first;
214 OP * op_other;
215};
216
79072805
LW
217struct listop {
218 BASEOP
219 OP * op_first;
220 OP * op_last;
79072805
LW
221};
222
b46e009d 223struct methop {
224 BASEOP
225 union {
226 /* op_u.op_first *must* be aligned the same as the op_first
227 * field of the other op types, and op_u.op_meth_sv *must*
228 * be aligned with op_sv */
229 OP* op_first; /* optree for method name */
230 SV* op_meth_sv; /* static method name */
231 } op_u;
810bd8b7 232#ifdef USE_ITHREADS
233 PADOFFSET op_rclass_targ; /* pad index for redirect class */
234#else
235 SV* op_rclass_sv; /* static redirect class $o->A::meth() */
236#endif
b46e009d 237};
238
79072805
LW
239struct pmop {
240 BASEOP
241 OP * op_first;
242 OP * op_last;
1fcf4c12 243#ifdef USE_ITHREADS
784e50c8 244 PADOFFSET op_pmoffset;
1fcf4c12
AB
245#else
246 REGEXP * op_pmregexp; /* compiled expression */
247#endif
69bdead3 248 U32 op_pmflags;
29f2e912 249 union {
20e98b0f
NC
250 OP * op_pmreplroot; /* For OP_SUBST */
251#ifdef USE_ITHREADS
252 PADOFFSET op_pmtargetoff; /* For OP_PUSHRE */
253#else
254 GV * op_pmtargetgv;
255#endif
256 } op_pmreplrootu;
257 union {
29f2e912 258 OP * op_pmreplstart; /* Only used in OP_SUBST */
cb55de95 259#ifdef USE_ITHREADS
23083432 260 PADOFFSET op_pmstashoff; /* Only used in OP_MATCH, with PMf_ONCE set */
cb55de95 261#else
29f2e912 262 HV * op_pmstash;
cb55de95 263#endif
29f2e912 264 } op_pmstashstartu;
68e2671b 265 OP * op_code_list; /* list of (?{}) code blocks */
79072805 266};
a0d0e21e 267
1fcf4c12 268#ifdef USE_ITHREADS
14a49a24
NC
269#define PM_GETRE(o) (SvTYPE(PL_regex_pad[(o)->op_pmoffset]) == SVt_REGEXP \
270 ? (REGEXP*)(PL_regex_pad[(o)->op_pmoffset]) : NULL)
ede1273d
NC
271/* The assignment is just to enforce type safety (or at least get a warning).
272 */
14a49a24
NC
273/* With first class regexps not via a reference one needs to assign
274 &PL_sv_undef under ithreads. (This would probably work unthreaded, but NULL
275 is cheaper. I guess we could allow NULL, but the check above would get
276 more complex, and we'd have an AV with (SV*)NULL in it, which feels bad */
277/* BEWARE - something that calls this macro passes (r) which has a side
278 effect. */
ede1273d 279#define PM_SETRE(o,r) STMT_START { \
b1bc3f34 280 REGEXP *const _pm_setre = (r); \
7948fc08 281 assert(_pm_setre); \
b1bc3f34 282 PL_regex_pad[(o)->op_pmoffset] = MUTABLE_SV(_pm_setre); \
ede1273d 283 } STMT_END
1fcf4c12 284#else
b9ed2502
AB
285#define PM_GETRE(o) ((o)->op_pmregexp)
286#define PM_SETRE(o,r) ((o)->op_pmregexp = (r))
1fcf4c12 287#endif
4825b64b 288
a6cd0fea
KW
289/* Currently these PMf flags occupy a single 32-bit word. Not all bits are
290 * currently used. The lower bits are shared with their corresponding RXf flag
291 * bits, up to but not including _RXf_PMf_SHIFT_NEXT. The unused bits
292 * immediately follow; finally the used Pmf-only (unshared) bits, so that the
293 * highest bit in the word is used. This gathers all the unused bits as a pool
294 * in the middle, like so: 11111111111111110000001111111111
295 * where the '1's represent used bits, and the '0's unused. This design allows
296 * us to allocate off one end of the pool if we need to add a shared bit, and
297 * off the other end if we need a non-shared bit, without disturbing the other
298 * bits. This maximizes the likelihood of being able to change things without
299 * breaking binary compatibility.
300 *
301 * To add shared bits, do so in op_reg_common.h. This should change
302 * _RXf_PMf_SHIFT_NEXT so that things won't compile. Then come to regexp.h and
303 * op.h and adjust the constant adders in the definitions of PMf_BASE_SHIFT and
304 * Pmf_BASE_SHIFT down by the number of shared bits you added. That's it.
305 * Things should be binary compatible. But if either of these gets to having
306 * to subtract rather than add, leave at 0 and adjust all the entries below
307 * that are in terms of this according. But if the first one of those is
308 * already PMf_BASE_SHIFT+0, there are no bits left, and a redesign is in
309 * order.
310 *
311 * To remove unshared bits, just delete its entry. If you're where breaking
312 * binary compatibility is ok to do, you might want to adjust things to move
313 * the newly opened space so that it gets absorbed into the common pool.
314 *
315 * To add unshared bits, first use up any gaps in the middle. Otherwise,
316 * allocate off the low end until you get to PMf_BASE_SHIFT+0. If that isn't
317 * enough, move PMf_BASE_SHIFT down (if possible) and add the new bit at the
318 * other end instead; this preserves binary compatibility. */
334afb3e 319#define PMf_BASE_SHIFT (_RXf_PMf_SHIFT_NEXT+4)
f4a4cecb 320
ef07e810 321/* 'use re "taint"' in scope: taint $1 etc. if target tainted */
9cba692b 322#define PMf_RETAINT (1U<<(PMf_BASE_SHIFT+5))
c737faaf 323
c0f1c194
KW
324/* match successfully only once per reset, with related flag RXf_USED in
325 * re->extflags holding state. This is used only for ?? matches, and only on
326 * OP_MATCH and OP_QR */
9cba692b 327#define PMf_ONCE (1U<<(PMf_BASE_SHIFT+6))
1850c8f9 328
d234778b 329/* PMf_ONCE, i.e. ?pat?, has matched successfully. Not used under threading. */
9cba692b 330#define PMf_USED (1U<<(PMf_BASE_SHIFT+7))
1850c8f9
KW
331
332/* subst replacement is constant */
9cba692b 333#define PMf_CONST (1U<<(PMf_BASE_SHIFT+8))
c737faaf 334
1850c8f9 335/* keep 1st runtime pattern forever */
9cba692b 336#define PMf_KEEP (1U<<(PMf_BASE_SHIFT+9))
4da3eb8b 337
9cba692b 338#define PMf_GLOBAL (1U<<(PMf_BASE_SHIFT+10)) /* pattern had a g modifier */
c737faaf 339
1850c8f9 340/* don't reset pos() if //g fails */
9cba692b 341#define PMf_CONTINUE (1U<<(PMf_BASE_SHIFT+11))
1850c8f9
KW
342
343/* evaluating replacement as expr */
9cba692b 344#define PMf_EVAL (1U<<(PMf_BASE_SHIFT+12))
c0f1c194
KW
345
346/* Return substituted string instead of modifying it. */
9cba692b 347#define PMf_NONDESTRUCT (1U<<(PMf_BASE_SHIFT+13))
e357fc67 348
d63c20f2 349/* the pattern has a CV attached (currently only under qr/...(?{}).../) */
9cba692b 350#define PMf_HAS_CV (1U<<(PMf_BASE_SHIFT+14))
d63c20f2 351
867940b8
DM
352/* op_code_list is private; don't free it etc. It may well point to
353 * code within another sub, with different pad etc */
9cba692b 354#define PMf_CODELIST_PRIVATE (1U<<(PMf_BASE_SHIFT+15))
867940b8 355
2a92a973
DM
356/* the PMOP is a QR (we should be able to detect that from the op type,
357 * but the regex compilation API passes just the pm flags, not the op
358 * itself */
9cba692b
KW
359#define PMf_IS_QR (1U<<(PMf_BASE_SHIFT+16))
360#define PMf_USE_RE_EVAL (1U<<(PMf_BASE_SHIFT+17)) /* use re'eval' in scope */
a6cd0fea
KW
361
362/* See comments at the beginning of these defines about adding bits. The
363 * highest bit position should be used, so that if PMf_BASE_SHIFT gets
364 * increased, the #error below will be triggered so that you will be reminded
365 * to adjust things at the other end to keep the bit positions unchanged */
366#if PMf_BASE_SHIFT+17 > 31
32cdcf9d 367# error Too many PMf_ bits used. See above and regnodes.h for any spare in middle
1850c8f9 368#endif
79072805 369
cb55de95 370#ifdef USE_ITHREADS
05ec9bb3 371
23083432
FC
372# define PmopSTASH(o) ((o)->op_pmflags & PMf_ONCE \
373 ? PL_stashpad[(o)->op_pmstashstartu.op_pmstashoff] \
374 : NULL)
375# define PmopSTASH_set(o,hv) \
376 (assert_((o)->op_pmflags & PMf_ONCE) \
377 (o)->op_pmstashstartu.op_pmstashoff = \
01f44973 378 (hv) ? alloccopstash(hv) : 0)
cb55de95 379#else
29f2e912
NC
380# define PmopSTASH(o) \
381 (((o)->op_pmflags & PMf_ONCE) ? (o)->op_pmstashstartu.op_pmstash : NULL)
382# if defined (DEBUGGING) && defined(__GNUC__) && !defined(PERL_GCC_BRACE_GROUPS_FORBIDDEN)
383# define PmopSTASH_set(o,hv) ({ \
384 assert((o)->op_pmflags & PMf_ONCE); \
385 ((o)->op_pmstashstartu.op_pmstash = (hv)); \
386 })
387# else
388# define PmopSTASH_set(o,hv) ((o)->op_pmstashstartu.op_pmstash = (hv))
389# endif
cb55de95 390#endif
23083432
FC
391#define PmopSTASHPV(o) (PmopSTASH(o) ? HvNAME_get(PmopSTASH(o)) : NULL)
392 /* op_pmstashstartu.op_pmstash is not refcounted */
393#define PmopSTASHPV_set(o,pv) PmopSTASH_set((o), gv_stashpv(pv,GV_ADD))
cb55de95 394
79072805
LW
395struct svop {
396 BASEOP
397 SV * op_sv;
398};
399
7934575e 400struct padop {
79072805 401 BASEOP
7934575e 402 PADOFFSET op_padix;
79072805
LW
403};
404
405struct pvop {
406 BASEOP
407 char * op_pv;
408};
409
79072805
LW
410struct loop {
411 BASEOP
412 OP * op_first;
413 OP * op_last;
79072805
LW
414 OP * op_redoop;
415 OP * op_nextop;
416 OP * op_lastop;
417};
418
350de78d 419#define cUNOPx(o) ((UNOP*)o)
2f7c6295 420#define cUNOP_AUXx(o) ((UNOP_AUX*)o)
350de78d
GS
421#define cBINOPx(o) ((BINOP*)o)
422#define cLISTOPx(o) ((LISTOP*)o)
423#define cLOGOPx(o) ((LOGOP*)o)
424#define cPMOPx(o) ((PMOP*)o)
425#define cSVOPx(o) ((SVOP*)o)
426#define cPADOPx(o) ((PADOP*)o)
427#define cPVOPx(o) ((PVOP*)o)
428#define cCOPx(o) ((COP*)o)
429#define cLOOPx(o) ((LOOP*)o)
b46e009d 430#define cMETHOPx(o) ((METHOP*)o)
350de78d
GS
431
432#define cUNOP cUNOPx(PL_op)
2f7c6295 433#define cUNOP_AUX cUNOP_AUXx(PL_op)
350de78d
GS
434#define cBINOP cBINOPx(PL_op)
435#define cLISTOP cLISTOPx(PL_op)
436#define cLOGOP cLOGOPx(PL_op)
437#define cPMOP cPMOPx(PL_op)
438#define cSVOP cSVOPx(PL_op)
439#define cPADOP cPADOPx(PL_op)
440#define cPVOP cPVOPx(PL_op)
441#define cCOP cCOPx(PL_op)
442#define cLOOP cLOOPx(PL_op)
443
444#define cUNOPo cUNOPx(o)
2f7c6295 445#define cUNOP_AUXo cUNOP_AUXx(o)
350de78d
GS
446#define cBINOPo cBINOPx(o)
447#define cLISTOPo cLISTOPx(o)
448#define cLOGOPo cLOGOPx(o)
449#define cPMOPo cPMOPx(o)
450#define cSVOPo cSVOPx(o)
451#define cPADOPo cPADOPx(o)
452#define cPVOPo cPVOPx(o)
453#define cCOPo cCOPx(o)
454#define cLOOPo cLOOPx(o)
455
456#define kUNOP cUNOPx(kid)
2f7c6295 457#define kUNOP_AUX cUNOP_AUXx(kid)
350de78d
GS
458#define kBINOP cBINOPx(kid)
459#define kLISTOP cLISTOPx(kid)
460#define kLOGOP cLOGOPx(kid)
461#define kPMOP cPMOPx(kid)
462#define kSVOP cSVOPx(kid)
463#define kPADOP cPADOPx(kid)
464#define kPVOP cPVOPx(kid)
465#define kCOP cCOPx(kid)
466#define kLOOP cLOOPx(kid)
467
468
469#ifdef USE_ITHREADS
dd2155a4 470# define cGVOPx_gv(o) ((GV*)PAD_SVl(cPADOPx(o)->op_padix))
9429039d
FC
471# ifndef PERL_CORE
472# define IS_PADGV(v) (v && isGV(v))
473# define IS_PADCONST(v) \
f5a0fd1e 474 (v && (SvREADONLY(v) || (SvIsCOW(v) && !SvLEN(v))))
9429039d 475# endif
7766f137 476# define cSVOPx_sv(v) (cSVOPx(v)->op_sv \
dd2155a4 477 ? cSVOPx(v)->op_sv : PAD_SVl((v)->op_targ))
638eceb6 478# define cSVOPx_svp(v) (cSVOPx(v)->op_sv \
dd2155a4 479 ? &cSVOPx(v)->op_sv : &PAD_SVl((v)->op_targ))
810bd8b7 480# define cMETHOPx_rclass(v) PAD_SVl(cMETHOPx(v)->op_rclass_targ)
350de78d 481#else
638eceb6 482# define cGVOPx_gv(o) ((GV*)cSVOPx(o)->op_sv)
9429039d
FC
483# ifndef PERL_CORE
484# define IS_PADGV(v) FALSE
485# define IS_PADCONST(v) FALSE
486# endif
7766f137 487# define cSVOPx_sv(v) (cSVOPx(v)->op_sv)
638eceb6 488# define cSVOPx_svp(v) (&cSVOPx(v)->op_sv)
810bd8b7 489# define cMETHOPx_rclass(v) (cMETHOPx(v)->op_rclass_sv)
350de78d 490#endif
79072805 491
b46e009d 492# define cMETHOPx_meth(v) cSVOPx_sv(v)
493
638eceb6
GS
494#define cGVOP_gv cGVOPx_gv(PL_op)
495#define cGVOPo_gv cGVOPx_gv(o)
496#define kGVOP_gv cGVOPx_gv(kid)
497#define cSVOP_sv cSVOPx_sv(PL_op)
498#define cSVOPo_sv cSVOPx_sv(o)
499#define kSVOP_sv cSVOPx_sv(kid)
7766f137 500
bcabcc50
NC
501#ifndef PERL_CORE
502# define Nullop ((OP*)NULL)
503#endif
79072805 504
cee4176c 505/* Lowest byte of PL_opargs */
a0d0e21e
LW
506#define OA_MARK 1
507#define OA_FOLDCONST 2
508#define OA_RETSCALAR 4
509#define OA_TARGET 8
903fd87c 510#define OA_TARGLEX 16
a0d0e21e
LW
511#define OA_OTHERINT 32
512#define OA_DANGEROUS 64
513#define OA_DEFGV 128
514
738ec380 515/* The next 4 bits (8..11) encode op class information */
903fd87c 516#define OCSHIFT 8
b162f9ea
IZ
517
518#define OA_CLASS_MASK (15 << OCSHIFT)
519
520#define OA_BASEOP (0 << OCSHIFT)
521#define OA_UNOP (1 << OCSHIFT)
522#define OA_BINOP (2 << OCSHIFT)
523#define OA_LOGOP (3 << OCSHIFT)
1a67a97c
SM
524#define OA_LISTOP (4 << OCSHIFT)
525#define OA_PMOP (5 << OCSHIFT)
526#define OA_SVOP (6 << OCSHIFT)
7934575e 527#define OA_PADOP (7 << OCSHIFT)
1a67a97c
SM
528#define OA_PVOP_OR_SVOP (8 << OCSHIFT)
529#define OA_LOOP (9 << OCSHIFT)
530#define OA_COP (10 << OCSHIFT)
531#define OA_BASEOP_OR_UNOP (11 << OCSHIFT)
532#define OA_FILESTATOP (12 << OCSHIFT)
533#define OA_LOOPEXOP (13 << OCSHIFT)
b46e009d 534#define OA_METHOP (14 << OCSHIFT)
2f7c6295 535#define OA_UNOP_AUX (15 << OCSHIFT)
b162f9ea 536
738ec380
DM
537/* Each remaining nybble of PL_opargs (i.e. bits 12..15, 16..19 etc)
538 * encode the type for each arg */
903fd87c 539#define OASHIFT 12
a0d0e21e 540
a0d0e21e
LW
541#define OA_SCALAR 1
542#define OA_LIST 2
543#define OA_AVREF 3
544#define OA_HVREF 4
545#define OA_CVREF 5
546#define OA_FILEREF 6
547#define OA_SCALARREF 7
548#define OA_OPTIONAL 8
549
d3c72c2a
DM
550/* Op_REFCNT is a reference count at the head of each op tree: needed
551 * since the tree is shared between threads, and between cloned closure
552 * copies in the same thread. OP_REFCNT_LOCK/UNLOCK is used when modifying
553 * this count.
554 * The same mutex is used to protect the refcounts of the reg_trie_data
555 * and reg_ac_data structures, which are shared between duplicated
556 * regexes.
557 */
558
534825c4
GS
559#ifdef USE_ITHREADS
560# define OP_REFCNT_INIT MUTEX_INIT(&PL_op_mutex)
4026c95a
SH
561# ifdef PERL_CORE
562# define OP_REFCNT_LOCK MUTEX_LOCK(&PL_op_mutex)
563# define OP_REFCNT_UNLOCK MUTEX_UNLOCK(&PL_op_mutex)
564# else
565# define OP_REFCNT_LOCK op_refcnt_lock()
566# define OP_REFCNT_UNLOCK op_refcnt_unlock()
567# endif
534825c4 568# define OP_REFCNT_TERM MUTEX_DESTROY(&PL_op_mutex)
534825c4
GS
569#else
570# define OP_REFCNT_INIT NOOP
571# define OP_REFCNT_LOCK NOOP
572# define OP_REFCNT_UNLOCK NOOP
573# define OP_REFCNT_TERM NOOP
534825c4 574#endif
e4783991 575
282f25c9 576#define OpREFCNT_set(o,n) ((o)->op_targ = (n))
fc97af9c
NC
577#ifdef PERL_DEBUG_READONLY_OPS
578# define OpREFCNT_inc(o) Perl_op_refcnt_inc(aTHX_ o)
579# define OpREFCNT_dec(o) Perl_op_refcnt_dec(aTHX_ o)
580#else
581# define OpREFCNT_inc(o) ((o) ? (++(o)->op_targ, (o)) : NULL)
582# define OpREFCNT_dec(o) (--(o)->op_targ)
583#endif
282f25c9 584
e4783991 585/* flags used by Perl_load_module() */
ec6d81ab
RGS
586#define PERL_LOADMOD_DENY 0x1 /* no Module */
587#define PERL_LOADMOD_NOIMPORT 0x2 /* use Module () */
466f50cc
FC
588#define PERL_LOADMOD_IMPORT_OPS 0x4 /* import arguments
589 are passed as a sin-
590 gle op tree, not a
591 list of SVs */
e5dd39fc 592
30d9c59b 593#if defined(PERL_IN_PERLY_C) || defined(PERL_IN_OP_C) || defined(PERL_IN_TOKE_C)
e4c5ccf3 594#define ref(o, type) doref(o, type, TRUE)
a0c21aa1 595#endif
e4c5ccf3 596
5983a79d
BM
597/*
598=head1 Optree Manipulation Functions
599
600=for apidoc Am|OP*|LINKLIST|OP *o
601Given the root of an optree, link the tree in execution order using the
72d33970 602C<op_next> pointers and return the first op executed. If this has
5983a79d 603already been done, it will not be redone, and C<< o->op_next >> will be
72d33970 604returned. If C<< o->op_next >> is not already set, I<o> should be at
5983a79d
BM
605least an C<UNOP>.
606
607=cut
608*/
609
610#define LINKLIST(o) ((o)->op_next ? (o)->op_next : op_linklist((OP*)o))
611
33f36c71
NC
612/* no longer used anywhere in core */
613#ifndef PERL_CORE
46471bde 614#define cv_ckproto(cv, gv, p) \
f717afa7 615 cv_ckproto_len_flags((cv), (gv), (p), (p) ? strlen(p) : 0, 0)
33f36c71
NC
616#endif
617
7d0905b9
NC
618#ifdef PERL_CORE
619# define my(o) my_attrs((o), NULL)
620#endif
621
e5dd39fc 622#ifdef USE_REENTRANT_API
10bc17b6 623#include "reentr.h"
e5dd39fc
AB
624#endif
625
c7e45529 626#define NewOp(m,var,c,type) \
e91d68d5 627 (var = (type *) Perl_Slab_Alloc(aTHX_ c*sizeof(type)))
c7e45529 628#define NewOpSz(m,var,size) \
e91d68d5 629 (var = (OP *) Perl_Slab_Alloc(aTHX_ size))
c7e45529 630#define FreeOp(p) Perl_Slab_Free(aTHX_ p)
8be227ab
FC
631
632/*
633 * The per-CV op slabs consist of a header (the opslab struct) and a bunch
634 * of space for allocating op slots, each of which consists of two pointers
635 * followed by an op. The first pointer points to the next op slot. The
636 * second points to the slab. At the end of the slab is a null pointer,
637 * so that slot->opslot_next - slot can be used to determine the size
638 * of the op.
639 *
640 * Each CV can have multiple slabs; opslab_next points to the next slab, to
641 * form a chain. All bookkeeping is done on the first slab, which is where
642 * all the op slots point.
643 *
644 * Freed ops are marked as freed and attached to the freed chain
645 * via op_next pointers.
646 *
647 * When there is more than one slab, the second slab in the slab chain is
648 * assumed to be the one with free space available. It is used when allo-
649 * cating an op if there are no freed ops available or big enough.
650 */
651
7aef8e5b 652#ifdef PERL_CORE
8be227ab
FC
653struct opslot {
654 /* keep opslot_next first */
655 OPSLOT * opslot_next; /* next slot */
656 OPSLAB * opslot_slab; /* owner */
657 OP opslot_op; /* the op itself */
658};
659
660struct opslab {
661 OPSLOT * opslab_first; /* first op in this slab */
662 OPSLAB * opslab_next; /* next slab */
663 OP * opslab_freed; /* chain of freed ops */
664 size_t opslab_refcnt; /* number of ops */
3107b51f
FC
665# ifdef PERL_DEBUG_READONLY_OPS
666 U16 opslab_size; /* size of slab in pointers */
667 bool opslab_readonly;
668# endif
8be227ab
FC
669 OPSLOT opslab_slots; /* slots begin here */
670};
671
672# define OPSLOT_HEADER STRUCT_OFFSET(OPSLOT, opslot_op)
673# define OPSLOT_HEADER_P (OPSLOT_HEADER/sizeof(I32 *))
c7724415 674# define OpSLOT(o) (assert_(o->op_slabbed) \
8be227ab 675 (OPSLOT *)(((char *)o)-OPSLOT_HEADER))
8be227ab
FC
676# define OpSLAB(o) OpSLOT(o)->opslot_slab
677# define OpslabREFCNT_dec(slab) \
678 (((slab)->opslab_refcnt == 1) \
679 ? opslab_free_nopad(slab) \
680 : (void)--(slab)->opslab_refcnt)
681 /* Variant that does not null out the pads */
682# define OpslabREFCNT_dec_padok(slab) \
683 (((slab)->opslab_refcnt == 1) \
684 ? opslab_free(slab) \
685 : (void)--(slab)->opslab_refcnt)
c7e45529 686#endif
598921a7 687
1930840b 688struct block_hooks {
52db365a 689 U32 bhk_flags;
1930840b
BM
690 void (*bhk_start) (pTHX_ int full);
691 void (*bhk_pre_end) (pTHX_ OP **seq);
692 void (*bhk_post_end) (pTHX_ OP **seq);
52db365a 693 void (*bhk_eval) (pTHX_ OP *const saveop);
1930840b
BM
694};
695
fd85fad2
BM
696/*
697=head1 Compile-time scope hooks
698
3e4ddde5 699=for apidoc mx|U32|BhkFLAGS|BHK *hk
fd85fad2
BM
700Return the BHK's flags.
701
3e4ddde5 702=for apidoc mx|void *|BhkENTRY|BHK *hk|which
72d33970
FC
703Return an entry from the BHK structure. I<which> is a preprocessor token
704indicating which entry to return. If the appropriate flag is not set
705this will return NULL. The type of the return value depends on which
fd85fad2
BM
706entry you ask for.
707
3e4ddde5 708=for apidoc Amx|void|BhkENTRY_set|BHK *hk|which|void *ptr
fd85fad2 709Set an entry in the BHK structure, and set the flags to indicate it is
72d33970 710valid. I<which> is a preprocessing token indicating which entry to set.
fd85fad2
BM
711The type of I<ptr> depends on the entry.
712
3e4ddde5 713=for apidoc Amx|void|BhkDISABLE|BHK *hk|which
a3e07c87 714Temporarily disable an entry in this BHK structure, by clearing the
72d33970 715appropriate flag. I<which> is a preprocessor token indicating which
a3e07c87
BM
716entry to disable.
717
3e4ddde5 718=for apidoc Amx|void|BhkENABLE|BHK *hk|which
a3e07c87 719Re-enable an entry in this BHK structure, by setting the appropriate
72d33970 720flag. I<which> is a preprocessor token indicating which entry to enable.
a3e07c87
BM
721This will assert (under -DDEBUGGING) if the entry doesn't contain a valid
722pointer.
723
3e4ddde5 724=for apidoc mx|void|CALL_BLOCK_HOOKS|which|arg
72d33970 725Call all the registered block hooks for type I<which>. I<which> is a
fd85fad2
BM
726preprocessing token; the type of I<arg> depends on I<which>.
727
728=cut
729*/
730
52db365a
BM
731#define BhkFLAGS(hk) ((hk)->bhk_flags)
732
a88d97bf
BM
733#define BHKf_bhk_start 0x01
734#define BHKf_bhk_pre_end 0x02
735#define BHKf_bhk_post_end 0x04
736#define BHKf_bhk_eval 0x08
52db365a
BM
737
738#define BhkENTRY(hk, which) \
a88d97bf 739 ((BhkFLAGS(hk) & BHKf_ ## which) ? ((hk)->which) : NULL)
52db365a 740
a3e07c87
BM
741#define BhkENABLE(hk, which) \
742 STMT_START { \
743 BhkFLAGS(hk) |= BHKf_ ## which; \
744 assert(BhkENTRY(hk, which)); \
745 } STMT_END
746
747#define BhkDISABLE(hk, which) \
748 STMT_START { \
749 BhkFLAGS(hk) &= ~(BHKf_ ## which); \
750 } STMT_END
751
52db365a
BM
752#define BhkENTRY_set(hk, which, ptr) \
753 STMT_START { \
a88d97bf 754 (hk)->which = ptr; \
a3e07c87 755 BhkENABLE(hk, which); \
52db365a
BM
756 } STMT_END
757
1930840b
BM
758#define CALL_BLOCK_HOOKS(which, arg) \
759 STMT_START { \
760 if (PL_blockhooks) { \
c70927a6 761 SSize_t i; \
b9f2b683 762 for (i = av_tindex(PL_blockhooks); i >= 0; i--) { \
1930840b 763 SV *sv = AvARRAY(PL_blockhooks)[i]; \
52db365a 764 BHK *hk; \
1930840b
BM
765 \
766 assert(SvIOK(sv)); \
767 if (SvUOK(sv)) \
52db365a 768 hk = INT2PTR(BHK *, SvUVX(sv)); \
1930840b 769 else \
52db365a 770 hk = INT2PTR(BHK *, SvIVX(sv)); \
1930840b 771 \
52db365a 772 if (BhkENTRY(hk, which)) \
16c91539 773 BhkENTRY(hk, which)(aTHX_ arg); \
1930840b
BM
774 } \
775 } \
776 } STMT_END
777
d9088386
Z
778/* flags for rv2cv_op_cv */
779
780#define RV2CVOPCV_MARK_EARLY 0x00000001
781#define RV2CVOPCV_RETURN_NAME_GV 0x00000002
211a4342 782#define RV2CVOPCV_RETURN_STUB 0x00000004
9c98a81f
FC
783#ifdef PERL_CORE /* behaviour of this flag is subject to change: */
784# define RV2CVOPCV_MAYBE_NAME_GV 0x00000008
785#endif
786#define RV2CVOPCV_FLAG_MASK 0x0000000f /* all of the above */
d9088386 787
d3d7d28f
FC
788#define op_lvalue(op,t) Perl_op_lvalue_flags(aTHX_ op,t,0)
789
f5d552b4
FC
790/* flags for op_lvalue_flags */
791
792#define OP_LVALUE_NO_CROAK 1
793
9733086d
BM
794/*
795=head1 Custom Operators
796
797=for apidoc Am|U32|XopFLAGS|XOP *xop
798Return the XOP's flags.
799
800=for apidoc Am||XopENTRY|XOP *xop|which
72d33970
FC
801Return a member of the XOP structure. I<which> is a cpp token
802indicating which entry to return. If the member is not set
803this will return a default value. The return type depends
804on I<which>. This macro evaluates its arguments more than
805once. If you are using C<Perl_custom_op_xop> to retreive a
ae103e09
DD
806C<XOP *> from a C<OP *>, use the more efficient L</XopENTRYCUSTOM> instead.
807
808=for apidoc Am||XopENTRYCUSTOM|const OP *o|which
809Exactly like C<XopENTRY(XopENTRY(Perl_custom_op_xop(aTHX_ o), which)> but more
72d33970 810efficient. The I<which> parameter is identical to L</XopENTRY>.
9733086d
BM
811
812=for apidoc Am|void|XopENTRY_set|XOP *xop|which|value
72d33970
FC
813Set a member of the XOP structure. I<which> is a cpp token
814indicating which entry to set. See L<perlguts/"Custom Operators">
815for details about the available members and how
816they are used. This macro evaluates its argument
ae103e09 817more than once.
9733086d
BM
818
819=for apidoc Am|void|XopDISABLE|XOP *xop|which
820Temporarily disable a member of the XOP, by clearing the appropriate flag.
821
822=for apidoc Am|void|XopENABLE|XOP *xop|which
823Reenable a member of the XOP which has been disabled.
824
825=cut
826*/
827
1830b3d9
BM
828struct custom_op {
829 U32 xop_flags;
830 const char *xop_name;
831 const char *xop_desc;
832 U32 xop_class;
833 void (*xop_peep)(pTHX_ OP *o, OP *oldop);
834};
835
ae103e09
DD
836/* return value of Perl_custom_op_get_field, similar to void * then casting but
837 the U32 doesn't need truncation on 64 bit platforms in the caller, also
838 for easier macro writing */
839typedef union {
840 const char *xop_name;
841 const char *xop_desc;
842 U32 xop_class;
843 void (*xop_peep)(pTHX_ OP *o, OP *oldop);
844 XOP *xop_ptr;
845} XOPRETANY;
846
1830b3d9
BM
847#define XopFLAGS(xop) ((xop)->xop_flags)
848
849#define XOPf_xop_name 0x01
850#define XOPf_xop_desc 0x02
851#define XOPf_xop_class 0x04
852#define XOPf_xop_peep 0x08
853
ae103e09
DD
854/* used by Perl_custom_op_get_field for option checking */
855typedef enum {
856 XOPe_xop_ptr = 0, /* just get the XOP *, don't look inside it */
857 XOPe_xop_name = XOPf_xop_name,
858 XOPe_xop_desc = XOPf_xop_desc,
859 XOPe_xop_class = XOPf_xop_class,
4a3798ca 860 XOPe_xop_peep = XOPf_xop_peep
ae103e09
DD
861} xop_flags_enum;
862
1830b3d9
BM
863#define XOPd_xop_name PL_op_name[OP_CUSTOM]
864#define XOPd_xop_desc PL_op_desc[OP_CUSTOM]
865#define XOPd_xop_class OA_BASEOP
866#define XOPd_xop_peep ((Perl_cpeep_t)0)
867
868#define XopENTRY_set(xop, which, to) \
869 STMT_START { \
870 (xop)->which = (to); \
871 (xop)->xop_flags |= XOPf_ ## which; \
872 } STMT_END
873
874#define XopENTRY(xop, which) \
875 ((XopFLAGS(xop) & XOPf_ ## which) ? (xop)->which : XOPd_ ## which)
876
ae103e09
DD
877#define XopENTRYCUSTOM(o, which) \
878 (Perl_custom_op_get_field(aTHX_ o, XOPe_ ## which).which)
879
1830b3d9
BM
880#define XopDISABLE(xop, which) ((xop)->xop_flags &= ~XOPf_ ## which)
881#define XopENABLE(xop, which) \
882 STMT_START { \
883 (xop)->xop_flags |= XOPf_ ## which; \
884 assert(XopENTRY(xop, which)); \
885 } STMT_END
886
ae103e09
DD
887#define Perl_custom_op_xop(x) \
888 (Perl_custom_op_get_field(x, XOPe_xop_ptr).xop_ptr)
889
9733086d
BM
890/*
891=head1 Optree Manipulation Functions
892
893=for apidoc Am|const char *|OP_NAME|OP *o
72d33970 894Return the name of the provided OP. For core ops this looks up the name
9733086d
BM
895from the op_type; for custom ops from the op_ppaddr.
896
897=for apidoc Am|const char *|OP_DESC|OP *o
898Return a short description of the provided OP.
899
900=for apidoc Am|U32|OP_CLASS|OP *o
901Return the class of the provided OP: that is, which of the *OP
72d33970 902structures it uses. For core ops this currently gets the information out
9733086d
BM
903of PL_opargs, which does not always accurately reflect the type used.
904For custom ops the type is returned from the registration, and it is up
72d33970 905to the registree to ensure it is accurate. The value returned will be
9733086d
BM
906one of the OA_* constants from op.h.
907
437e3a7d 908=for apidoc Am|bool|OP_TYPE_IS|OP *o, Optype type
11ee9dd6
SM
909Returns true if the given OP is not a NULL pointer
910and if it is of the given type.
911
912The negation of this macro, C<OP_TYPE_ISNT> is also available
913as well as C<OP_TYPE_IS_NN> and C<OP_TYPE_ISNT_NN> which elide
914the NULL pointer check.
915
916=for apidoc Am|bool|OP_TYPE_IS_OR_WAS|OP *o, Optype type
917Returns true if the given OP is not a NULL pointer and
918if it is of the given type or used to be before being
919replaced by an OP of type OP_NULL.
920
921The negation of this macro, C<OP_TYPE_ISNT_AND_WASNT>
922is also available as well as C<OP_TYPE_IS_OR_WAS_NN>
923and C<OP_TYPE_ISNT_AND_WASNT_NN> which elide
924the NULL pointer check.
925
1ed44841
DM
926=for apidoc Am|bool|OP_HAS_SIBLING|OP *o
927Returns true if o has a sibling
928
929=for apidoc Am|bool|OP_SIBLING|OP *o
930Returns the sibling of o, or NULL if there is no sibling
931
932=for apidoc Am|bool|OP_SIBLING_set|OP *o|OP *sib
933Sets the sibling of o to sib
934
9733086d
BM
935=cut
936*/
937
1830b3d9 938#define OP_NAME(o) ((o)->op_type == OP_CUSTOM \
ae103e09 939 ? XopENTRYCUSTOM(o, xop_name) \
1830b3d9
BM
940 : PL_op_name[(o)->op_type])
941#define OP_DESC(o) ((o)->op_type == OP_CUSTOM \
ae103e09 942 ? XopENTRYCUSTOM(o, xop_desc) \
1830b3d9
BM
943 : PL_op_desc[(o)->op_type])
944#define OP_CLASS(o) ((o)->op_type == OP_CUSTOM \
ae103e09 945 ? XopENTRYCUSTOM(o, xop_class) \
1830b3d9
BM
946 : (PL_opargs[(o)->op_type] & OA_CLASS_MASK))
947
437e3a7d 948#define OP_TYPE_IS(o, type) ((o) && (o)->op_type == (type))
11ee9dd6
SM
949#define OP_TYPE_IS_NN(o, type) ((o)->op_type == (type))
950#define OP_TYPE_ISNT(o, type) ((o) && (o)->op_type != (type))
951#define OP_TYPE_ISNT_NN(o, type) ((o)->op_type != (type))
952
953#define OP_TYPE_IS_OR_WAS_NN(o, type) \
954 ( ((o)->op_type == OP_NULL \
955 ? (o)->op_targ \
956 : (o)->op_type) \
957 == (type) )
958
959#define OP_TYPE_IS_OR_WAS(o, type) \
960 ( (o) && OP_TYPE_IS_OR_WAS_NN(o, type) )
961
962#define OP_TYPE_ISNT_AND_WASNT_NN(o, type) \
963 ( ((o)->op_type == OP_NULL \
964 ? (o)->op_targ \
965 : (o)->op_type) \
966 != (type) )
967
968#define OP_TYPE_ISNT_AND_WASNT(o, type) \
969 ( (o) && OP_TYPE_ISNT_AND_WASNT_NN(o, type) )
437e3a7d 970
29e61fd9
DM
971#ifdef PERL_OP_PARENT
972# define OP_HAS_SIBLING(o) (!cBOOL((o)->op_lastsib))
973# define OP_SIBLING(o) (0 + (o)->op_lastsib ? NULL : (o)->op_sibling)
974# define OP_SIBLING_set(o, sib) ((o)->op_sibling = (sib))
975#else
976# define OP_HAS_SIBLING(o) (cBOOL((o)->op_sibling))
977# define OP_SIBLING(o) (0 + (o)->op_sibling)
978# define OP_SIBLING_set(o, sib) ((o)->op_sibling = (sib))
979#endif
1ed44841 980
e8f91c91
DD
981#define newATTRSUB(f, o, p, a, b) Perl_newATTRSUB_x(aTHX_ f, o, p, a, b, FALSE)
982#define newSUB(f, o, p, b) newATTRSUB((f), (o), (p), NULL, (b))
7bff8c33 983
3f2908ec 984/*
e8570548
Z
985=head1 Hook manipulation
986*/
987
988#ifdef USE_ITHREADS
989# define OP_CHECK_MUTEX_INIT MUTEX_INIT(&PL_check_mutex)
990# define OP_CHECK_MUTEX_LOCK MUTEX_LOCK(&PL_check_mutex)
991# define OP_CHECK_MUTEX_UNLOCK MUTEX_UNLOCK(&PL_check_mutex)
992# define OP_CHECK_MUTEX_TERM MUTEX_DESTROY(&PL_check_mutex)
993#else
994# define OP_CHECK_MUTEX_INIT NOOP
995# define OP_CHECK_MUTEX_LOCK NOOP
996# define OP_CHECK_MUTEX_UNLOCK NOOP
997# define OP_CHECK_MUTEX_TERM NOOP
998#endif
999
fedf30e1
DM
1000
1001/* Stuff for OP_MULTDEREF/pp_multideref. */
1002
1003/* actions */
1004
1005/* Load another word of actions/flag bits. Must be 0 */
1006#define MDEREF_reload 0
1007
1008#define MDEREF_AV_pop_rv2av_aelem 1
1009#define MDEREF_AV_gvsv_vivify_rv2av_aelem 2
1010#define MDEREF_AV_padsv_vivify_rv2av_aelem 3
1011#define MDEREF_AV_vivify_rv2av_aelem 4
1012#define MDEREF_AV_padav_aelem 5
1013#define MDEREF_AV_gvav_aelem 6
1014
1015#define MDEREF_HV_pop_rv2hv_helem 8
1016#define MDEREF_HV_gvsv_vivify_rv2hv_helem 9
1017#define MDEREF_HV_padsv_vivify_rv2hv_helem 10
1018#define MDEREF_HV_vivify_rv2hv_helem 11
1019#define MDEREF_HV_padhv_helem 12
1020#define MDEREF_HV_gvhv_helem 13
1021
1022#define MDEREF_ACTION_MASK 0xf
1023
1024/* key / index type */
1025
1026#define MDEREF_INDEX_none 0x00 /* run external ops to generate index */
1027#define MDEREF_INDEX_const 0x10 /* index is const PV/UV */
1028#define MDEREF_INDEX_padsv 0x20 /* index is lexical var */
1029#define MDEREF_INDEX_gvsv 0x30 /* index is GV */
1030
1031#define MDEREF_INDEX_MASK 0x30
1032
1033/* bit flags */
1034
1035#define MDEREF_FLAG_last 0x40 /* the last [ah]elem; PL_op flags apply */
1036
1037#define MDEREF_MASK 0x7F
1038#define MDEREF_SHIFT 7
1039
1040
e8570548 1041/*
3f2908ec
NC
1042 * Local variables:
1043 * c-indentation-style: bsd
1044 * c-basic-offset: 4
14d04a33 1045 * indent-tabs-mode: nil
3f2908ec
NC
1046 * End:
1047 *
14d04a33 1048 * ex: set ts=8 sts=4 sw=4 et:
3f2908ec 1049 */