This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
https://perl5.git.perl.org / perl5.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
Follow-up to d34a6664
[perl5.git] / op.c
CommitLineData
4b88f280 1#line 2 "op.c"
a0d0e21e 2/* op.c
79072805 3 *
1129b882
NC		 4 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
5 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
79072805
LW		 6 *
7 * You may distribute under the terms of either the GNU General Public
8 * License or the Artistic License, as specified in the README file.
9 *
a0d0e21e
LW		 10 */
11
12/*
4ac71550
TC		 13 * 'You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
14 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
15 * youngest of the Old Took's daughters); and Mr. Drogo was his second
16 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
17 * either way, as the saying is, if you follow me.' --the Gaffer
18 *
19 * [p.23 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
79072805
LW		 20 */
21
166f8a29
DM		 22/* This file contains the functions that create, manipulate and optimize
23 * the OP structures that hold a compiled perl program.
24 *
25 * A Perl program is compiled into a tree of OPs. Each op contains
26 * structural pointers (eg to its siblings and the next op in the
27 * execution sequence), a pointer to the function that would execute the
28 * op, plus any data specific to that op. For example, an OP_CONST op
29 * points to the pp_const() function and to an SV containing the constant
30 * value. When pp_const() is executed, its job is to push that SV onto the
31 * stack.
32 *
33 * OPs are mainly created by the newFOO() functions, which are mainly
34 * called from the parser (in perly.y) as the code is parsed. For example
35 * the Perl code $a + $b * $c would cause the equivalent of the following
36 * to be called (oversimplifying a bit):
37 *
38 * newBINOP(OP_ADD, flags,
39 * newSVREF($a),
40 * newBINOP(OP_MULTIPLY, flags, newSVREF($b), newSVREF($c))
41 * )
42 *
43 * Note that during the build of miniperl, a temporary copy of this file
44 * is made, called opmini.c.
45 */
ccfc67b7 46
61b743bb
DM		 47/*
48Perl's compiler is essentially a 3-pass compiler with interleaved phases:
49
50 A bottom-up pass
51 A top-down pass
52 An execution-order pass
53
54The bottom-up pass is represented by all the "newOP" routines and
55the ck_ routines. The bottom-upness is actually driven by yacc.
56So at the point that a ck_ routine fires, we have no idea what the
57context is, either upward in the syntax tree, or either forward or
58backward in the execution order. (The bottom-up parser builds that
59part of the execution order it knows about, but if you follow the "next"
60links around, you'll find it's actually a closed loop through the
ef9da979 61top level node.)
61b743bb
DM		 62
63Whenever the bottom-up parser gets to a node that supplies context to
64its components, it invokes that portion of the top-down pass that applies
65to that part of the subtree (and marks the top node as processed, so
66if a node further up supplies context, it doesn't have to take the
67plunge again). As a particular subcase of this, as the new node is
68built, it takes all the closed execution loops of its subcomponents
69and links them into a new closed loop for the higher level node. But
70it's still not the real execution order.
71
72The actual execution order is not known till we get a grammar reduction
73to a top-level unit like a subroutine or file that will be called by
74"name" rather than via a "next" pointer. At that point, we can call
75into peep() to do that code's portion of the 3rd pass. It has to be
76recursive, but it's recursive on basic blocks, not on tree nodes.
77*/
78
06e0342d 79/* To implement user lexical pragmas, there needs to be a way at run time to
b3ca2e83
NC		 80 get the compile time state of %^H for that block. Storing %^H in every
81 block (or even COP) would be very expensive, so a different approach is
82 taken. The (running) state of %^H is serialised into a tree of HE-like
83 structs. Stores into %^H are chained onto the current leaf as a struct
84 refcounted_he * with the key and the value. Deletes from %^H are saved
85 with a value of PL_sv_placeholder. The state of %^H at any point can be
86 turned back into a regular HV by walking back up the tree from that point's
06e0342d 87 leaf, ignoring any key you've already seen (placeholder or not), storing
b3ca2e83
NC		 88 the rest into the HV structure, then removing the placeholders. Hence
89 memory is only used to store the %^H deltas from the enclosing COP, rather
90 than the entire %^H on each COP.
91
92 To cause actions on %^H to write out the serialisation records, it has
93 magic type 'H'. This magic (itself) does nothing, but its presence causes
94 the values to gain magic type 'h', which has entries for set and clear.
c28fe1ec 95 C<Perl_magic_sethint> updates C<PL_compiling.cop_hints_hash> with a store
34795b44 96 record, with deletes written by C<Perl_magic_clearhint>. C<SAVEHINTS>
c28fe1ec
NC		 97 saves the current C<PL_compiling.cop_hints_hash> on the save stack, so that
98 it will be correctly restored when any inner compiling scope is exited.
b3ca2e83
NC		 99*/
100
79072805 101#include "EXTERN.h"
864dbfa3 102#define PERL_IN_OP_C
79072805 103#include "perl.h"
77ca0c92 104#include "keywords.h"
79072805 105
16c91539 106#define CALL_PEEP(o) PL_peepp(aTHX_ o)
1a0a2ba9 107#define CALL_RPEEP(o) PL_rpeepp(aTHX_ o)
16c91539 108#define CALL_OPFREEHOOK(o) if (PL_opfreehook) PL_opfreehook(aTHX_ o)
a2efc822 109
238a4c30
NIS		 110#if defined(PL_OP_SLAB_ALLOC)
111
f1fac472
NC		 112#ifdef PERL_DEBUG_READONLY_OPS
113# define PERL_SLAB_SIZE 4096
114# include <sys/mman.h>
115#endif
116
238a4c30
NIS		 117#ifndef PERL_SLAB_SIZE
118#define PERL_SLAB_SIZE 2048
119#endif
120
c7e45529 121void *
e91d68d5 122Perl_Slab_Alloc(pTHX_ size_t sz)
1c846c1f 123{
5186cc12 124 dVAR;
5a8e194f
NIS		 125 /*
126 * To make incrementing use count easy PL_OpSlab is an I32 *
127 * To make inserting the link to slab PL_OpPtr is I32 **
128 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
129 * Add an overhead for pointer to slab and round up as a number of pointers
130 */
131 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
238a4c30 132 if ((PL_OpSpace -= sz) < 0) {
f1fac472
NC		 133#ifdef PERL_DEBUG_READONLY_OPS
134 /* We need to allocate chunk by chunk so that we can control the VM
135 mapping */
5186cc12 136 PL_OpPtr = (I32**) mmap(0, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE,
f1fac472
NC		 137 MAP_ANON|MAP_PRIVATE, -1, 0);
138
139 DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n",
140 (unsigned long) PERL_SLAB_SIZE*sizeof(I32*),
141 PL_OpPtr));
142 if(PL_OpPtr == MAP_FAILED) {
143 perror("mmap failed");
144 abort();
145 }
146#else
277e868c
NC		 147
148 PL_OpPtr = (I32 **) PerlMemShared_calloc(PERL_SLAB_SIZE,sizeof(I32*));
f1fac472 149#endif
083fcd59 150 if (!PL_OpPtr) {
238a4c30
NIS		 151 return NULL;
152 }
5a8e194f
NIS		 153 /* We reserve the 0'th I32 sized chunk as a use count */
154 PL_OpSlab = (I32 *) PL_OpPtr;
155 /* Reduce size by the use count word, and by the size we need.
156 * Latter is to mimic the '-=' in the if() above
157 */
158 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
238a4c30
NIS		 159 /* Allocation pointer starts at the top.
160 Theory: because we build leaves before trunk allocating at end
161 means that at run time access is cache friendly upward
162 */
5a8e194f 163 PL_OpPtr += PERL_SLAB_SIZE;
f1fac472
NC		 164
165#ifdef PERL_DEBUG_READONLY_OPS
166 /* We remember this slab. */
167 /* This implementation isn't efficient, but it is simple. */
5186cc12 168 PL_slabs = (I32**) realloc(PL_slabs, sizeof(I32**) * (PL_slab_count + 1));
f1fac472
NC		 169 PL_slabs[PL_slab_count++] = PL_OpSlab;
170 DEBUG_m(PerlIO_printf(Perl_debug_log, "Allocate %p\n", PL_OpSlab));
171#endif
238a4c30
NIS		 172 }
173 assert( PL_OpSpace >= 0 );
174 /* Move the allocation pointer down */
175 PL_OpPtr -= sz;
5a8e194f 176 assert( PL_OpPtr > (I32 **) PL_OpSlab );
238a4c30
NIS		 177 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
178 (*PL_OpSlab)++; /* Increment use count of slab */
5a8e194f 179 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
238a4c30
NIS		 180 assert( *PL_OpSlab > 0 );
181 return (void *)(PL_OpPtr + 1);
182}
183
f1fac472
NC		 184#ifdef PERL_DEBUG_READONLY_OPS
185void
186Perl_pending_Slabs_to_ro(pTHX) {
187 /* Turn all the allocated op slabs read only. */
188 U32 count = PL_slab_count;
189 I32 **const slabs = PL_slabs;
190
191 /* Reset the array of pending OP slabs, as we're about to turn this lot
192 read only. Also, do it ahead of the loop in case the warn triggers,
193 and a warn handler has an eval */
194
f1fac472
NC		 195 PL_slabs = NULL;
196 PL_slab_count = 0;
197
198 /* Force a new slab for any further allocation. */
199 PL_OpSpace = 0;
200
201 while (count--) {
5892a4d4 202 void *const start = slabs[count];
f1fac472
NC		 203 const size_t size = PERL_SLAB_SIZE* sizeof(I32*);
204 if(mprotect(start, size, PROT_READ)) {
205 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d",
206 start, (unsigned long) size, errno);
207 }
208 }
5892a4d4
NC		 209
210 free(slabs);
f1fac472
NC		 211}
212
213STATIC void
214S_Slab_to_rw(pTHX_ void *op)
215{
216 I32 * const * const ptr = (I32 **) op;
217 I32 * const slab = ptr[-1];
7918f24d
NC		 218
219 PERL_ARGS_ASSERT_SLAB_TO_RW;
220
f1fac472
NC		 221 assert( ptr-1 > (I32 **) slab );
222 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
223 assert( *slab > 0 );
224 if(mprotect(slab, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE)) {
225 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d",
226 slab, (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), errno);
227 }
228}
fc97af9c
NC		 229
230OP *
231Perl_op_refcnt_inc(pTHX_ OP *o)
232{
233 if(o) {
234 Slab_to_rw(o);
235 ++o->op_targ;
236 }
237 return o;
238
239}
240
241PADOFFSET
242Perl_op_refcnt_dec(pTHX_ OP *o)
243{
7918f24d 244 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
fc97af9c
NC		 245 Slab_to_rw(o);
246 return --o->op_targ;
247}
f1fac472
NC		 248#else
249# define Slab_to_rw(op)
250#endif
251
c7e45529
AE		 252void
253Perl_Slab_Free(pTHX_ void *op)
238a4c30 254{
551405c4 255 I32 * const * const ptr = (I32 **) op;
aec46f14 256 I32 * const slab = ptr[-1];
7918f24d 257 PERL_ARGS_ASSERT_SLAB_FREE;
5a8e194f
NIS		 258 assert( ptr-1 > (I32 **) slab );
259 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
238a4c30 260 assert( *slab > 0 );
f1fac472 261 Slab_to_rw(op);
238a4c30 262 if (--(*slab) == 0) {
7e4e8c89
NC		 263# ifdef NETWARE
264# define PerlMemShared PerlMem
265# endif
083fcd59 266
f1fac472 267#ifdef PERL_DEBUG_READONLY_OPS
782a40f1 268 U32 count = PL_slab_count;
f1fac472 269 /* Need to remove this slab from our list of slabs */
782a40f1 270 if (count) {
f1fac472
NC		 271 while (count--) {
272 if (PL_slabs[count] == slab) {
5186cc12 273 dVAR;
f1fac472
NC		 274 /* Found it. Move the entry at the end to overwrite it. */
275 DEBUG_m(PerlIO_printf(Perl_debug_log,
276 "Deallocate %p by moving %p from %lu to %lu\n",
277 PL_OpSlab,
278 PL_slabs[PL_slab_count - 1],
279 PL_slab_count, count));
280 PL_slabs[count] = PL_slabs[--PL_slab_count];
281 /* Could realloc smaller at this point, but probably not
282 worth it. */
fc97af9c
NC		 283 if(munmap(slab, PERL_SLAB_SIZE*sizeof(I32*))) {
284 perror("munmap failed");
285 abort();
286 }
287 break;
f1fac472 288 }
f1fac472
NC		 289 }
290 }
291#else
083fcd59 292 PerlMemShared_free(slab);
f1fac472 293#endif
238a4c30
NIS		 294 if (slab == PL_OpSlab) {
295 PL_OpSpace = 0;
296 }
297 }
b7dc083c 298}
b7dc083c 299#endif
e50aee73 300/*
ce6f1cbc 301 * In the following definition, the ", (OP*)0" is just to make the compiler
a5f75d66 302 * think the expression is of the right type: croak actually does a Siglongjmp.
e50aee73 303 */
11343788 304#define CHECKOP(type,o) \
ce6f1cbc 305 ((PL_op_mask && PL_op_mask[type]) \
5dc0d613 306 ? ( op_free((OP*)o), \
cb77fdf0 307 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
ce6f1cbc 308 (OP*)0 ) \
16c91539 309 : PL_check[type](aTHX_ (OP*)o))
e50aee73 310
e6438c1a 311#define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
c53d7c7d 312
cba5a3b0
DG		 313#define CHANGE_TYPE(o,type) \
314 STMT_START { \
315 o->op_type = (OPCODE)type; \
316 o->op_ppaddr = PL_ppaddr[type]; \
317 } STMT_END
318
8b6b16e7 319STATIC const char*
cea2e8a9 320S_gv_ename(pTHX_ GV *gv)
4633a7c4 321{
46c461b5 322 SV* const tmpsv = sv_newmortal();
7918f24d
NC		 323
324 PERL_ARGS_ASSERT_GV_ENAME;
325
bd61b366 326 gv_efullname3(tmpsv, gv, NULL);
8b6b16e7 327 return SvPV_nolen_const(tmpsv);
4633a7c4
LW		 328}
329
76e3520e 330STATIC OP *
cea2e8a9 331S_no_fh_allowed(pTHX_ OP *o)
79072805 332{
7918f24d
NC		 333 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
334
cea2e8a9 335 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
53e06cf0 336 OP_DESC(o)));
11343788 337 return o;
79072805
LW		 338}
339
76e3520e 340STATIC OP *
bfed75c6 341S_too_few_arguments(pTHX_ OP *o, const char *name)
79072805 342{
7918f24d
NC		 343 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS;
344
cea2e8a9 345 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
11343788 346 return o;
79072805
LW		 347}
348
76e3520e 349STATIC OP *
bfed75c6 350S_too_many_arguments(pTHX_ OP *o, const char *name)
79072805 351{
7918f24d
NC		 352 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS;
353
cea2e8a9 354 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
11343788 355 return o;
79072805
LW		 356}
357
76e3520e 358STATIC void
6867be6d 359S_bad_type(pTHX_ I32 n, const char *t, const char *name, const OP *kid)
8990e307 360{
7918f24d
NC		 361 PERL_ARGS_ASSERT_BAD_TYPE;
362
cea2e8a9 363 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
53e06cf0 364 (int)n, name, t, OP_DESC(kid)));
8990e307
LW		 365}
366
7a52d87a 367STATIC void
6867be6d 368S_no_bareword_allowed(pTHX_ const OP *o)
7a52d87a 369{
7918f24d
NC		 370 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
371
eb8433b7
NC		 372 if (PL_madskills)
373 return; /* various ok barewords are hidden in extra OP_NULL */
5a844595 374 qerror(Perl_mess(aTHX_
35c1215d 375 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
be2597df 376 SVfARG(cSVOPo_sv)));
7a52d87a
GS		 377}
378
79072805
LW		 379/* "register" allocation */
380
381PADOFFSET
d6447115 382Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
93a17b20 383{
97aff369 384 dVAR;
a0d0e21e 385 PADOFFSET off;
12bd6ede 386 const bool is_our = (PL_parser->in_my == KEY_our);
a0d0e21e 387
7918f24d
NC		 388 PERL_ARGS_ASSERT_ALLOCMY;
389
d6447115
NC		 390 if (flags)
391 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
392 (UV)flags);
393
394 /* Until we're using the length for real, cross check that we're being
395 told the truth. */
396 assert(strlen(name) == len);
397
59f00321 398 /* complain about "my $<special_var>" etc etc */
d6447115 399 if (len &&
3edf23ff 400 !(is_our ||
155aba94 401 isALPHA(name[1]) ||
39e02b42 402 (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) ||
d6447115 403 (name[1] == '_' && (*name == '$' || len > 2))))
834a4ddd 404 {
6b58708b 405 /* name[2] is true if strlen(name) > 2 */
c4d0567e 406 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
d6447115
NC		 407 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
408 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
aab6a793 409 PL_parser->in_my == KEY_state ? "state" : "my"));
d1544d85 410 } else {
d6447115 411 yyerror(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
aab6a793 412 PL_parser->in_my == KEY_state ? "state" : "my"));
46fc3d4c 413 }
a0d0e21e 414 }
748a9306 415
dd2155a4 416 /* allocate a spare slot and store the name in that slot */
93a17b20 417
cca43f78 418 off = pad_add_name(name, len,
59cfed7d
NC		 419 is_our ? padadd_OUR :
420 PL_parser->in_my == KEY_state ? padadd_STATE : 0,
12bd6ede 421 PL_parser->in_my_stash,
3edf23ff 422 (is_our
133706a6
RGS		 423 /* $_ is always in main::, even with our */
424 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
5c284bb0 425 : NULL
cca43f78 426 )
dd2155a4 427 );
a74073ad
DM		 428 /* anon sub prototypes contains state vars should always be cloned,
429 * otherwise the state var would be shared between anon subs */
430
431 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
432 CvCLONE_on(PL_compcv);
433
dd2155a4 434 return off;
79072805
LW		 435}
436
d2c837a0
DM		 437/* free the body of an op without examining its contents.
438 * Always use this rather than FreeOp directly */
439
4136a0f7 440static void
d2c837a0
DM		 441S_op_destroy(pTHX_ OP *o)
442{
443 if (o->op_latefree) {
444 o->op_latefreed = 1;
445 return;
446 }
447 FreeOp(o);
448}
449
c4bd3ae5
NC		 450#ifdef USE_ITHREADS
451# define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b)
452#else
453# define forget_pmop(a,b) S_forget_pmop(aTHX_ a)
454#endif
d2c837a0 455
79072805
LW		 456/* Destructor */
457
458void
864dbfa3 459Perl_op_free(pTHX_ OP *o)
79072805 460{
27da23d5 461 dVAR;
acb36ea4 462 OPCODE type;
79072805 463
85594c31 464 if (!o)
79072805 465 return;
670f3923
DM		 466 if (o->op_latefreed) {
467 if (o->op_latefree)
468 return;
469 goto do_free;
470 }
79072805 471
67566ccd 472 type = o->op_type;
7934575e 473 if (o->op_private & OPpREFCOUNTED) {
67566ccd 474 switch (type) {
7934575e
GS		 475 case OP_LEAVESUB:
476 case OP_LEAVESUBLV:
477 case OP_LEAVEEVAL:
478 case OP_LEAVE:
479 case OP_SCOPE:
480 case OP_LEAVEWRITE:
67566ccd
AL		 481 {
482 PADOFFSET refcnt;
7934575e 483 OP_REFCNT_LOCK;
4026c95a 484 refcnt = OpREFCNT_dec(o);
7934575e 485 OP_REFCNT_UNLOCK;
bfd0ff22
NC		 486 if (refcnt) {
487 /* Need to find and remove any pattern match ops from the list
488 we maintain for reset(). */
489 find_and_forget_pmops(o);
4026c95a 490 return;
67566ccd 491 }
bfd0ff22 492 }
7934575e
GS		 493 break;
494 default:
495 break;
496 }
497 }
498
f37b8c3f
VP		 499 /* Call the op_free hook if it has been set. Do it now so that it's called
500 * at the right time for refcounted ops, but still before all of the kids
501 * are freed. */
502 CALL_OPFREEHOOK(o);
503
11343788 504 if (o->op_flags & OPf_KIDS) {
6867be6d 505 register OP *kid, *nextkid;
11343788 506 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
85e6fe83 507 nextkid = kid->op_sibling; /* Get before next freeing kid */
79072805 508 op_free(kid);
85e6fe83 509 }
79072805 510 }
acb36ea4 511
fc97af9c
NC		 512#ifdef PERL_DEBUG_READONLY_OPS
513 Slab_to_rw(o);
514#endif
515
acb36ea4
GS		 516 /* COP* is not cleared by op_clear() so that we may track line
517 * numbers etc even after null() */
cc93af5f
RGS		 518 if (type == OP_NEXTSTATE || type == OP_DBSTATE
519 || (type == OP_NULL /* the COP might have been null'ed */
520 && ((OPCODE)o->op_targ == OP_NEXTSTATE
521 || (OPCODE)o->op_targ == OP_DBSTATE))) {
acb36ea4 522 cop_free((COP*)o);
3235b7a3 523 }
acb36ea4 524
c53f1caa
RU		 525 if (type == OP_NULL)
526 type = (OPCODE)o->op_targ;
527
acb36ea4 528 op_clear(o);
670f3923
DM		 529 if (o->op_latefree) {
530 o->op_latefreed = 1;
531 return;
532 }
533 do_free:
238a4c30 534 FreeOp(o);
4d494880
DM		 535#ifdef DEBUG_LEAKING_SCALARS
536 if (PL_op == o)
5f66b61c 537 PL_op = NULL;
4d494880 538#endif
acb36ea4 539}
79072805 540
93c66552
DM		 541void
542Perl_op_clear(pTHX_ OP *o)
acb36ea4 543{
13137afc 544
27da23d5 545 dVAR;
7918f24d
NC		 546
547 PERL_ARGS_ASSERT_OP_CLEAR;
548
eb8433b7 549#ifdef PERL_MAD
df31c78c
NC		 550 mad_free(o->op_madprop);
551 o->op_madprop = 0;
eb8433b7
NC		 552#endif
553
554 retry:
11343788 555 switch (o->op_type) {
acb36ea4 556 case OP_NULL: /* Was holding old type, if any. */
eb8433b7 557 if (PL_madskills && o->op_targ != OP_NULL) {
61a59f30 558 o->op_type = (Optype)o->op_targ;
eb8433b7
NC		 559 o->op_targ = 0;
560 goto retry;
561 }
4d193d44 562 case OP_ENTERTRY:
acb36ea4 563 case OP_ENTEREVAL: /* Was holding hints. */
acb36ea4 564 o->op_targ = 0;
a0d0e21e 565 break;
a6006777 566 default:
ac4c12e7 567 if (!(o->op_flags & OPf_REF)
ef69c8fc 568 || (PL_check[o->op_type] != Perl_ck_ftst))
a6006777 569 break;
570 /* FALL THROUGH */
463ee0b2 571 case OP_GVSV:
79072805 572 case OP_GV:
a6006777 573 case OP_AELEMFAST:
6a077020
DM		 574 if (! (o->op_type == OP_AELEMFAST && o->op_flags & OPf_SPECIAL)) {
575 /* not an OP_PADAV replacement */
f7461760
Z		 576 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
577#ifdef USE_ITHREADS
578 && PL_curpad
579#endif
580 ? cGVOPo_gv : NULL;
b327b36f
NC		 581 /* It's possible during global destruction that the GV is freed
582 before the optree. Whilst the SvREFCNT_inc is happy to bump from
583 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0
584 will trigger an assertion failure, because the entry to sv_clear
585 checks that the scalar is not already freed. A check of for
586 !SvIS_FREED(gv) turns out to be invalid, because during global
587 destruction the reference count can be forced down to zero
588 (with SVf_BREAK set). In which case raising to 1 and then
589 dropping to 0 triggers cleanup before it should happen. I
590 *think* that this might actually be a general, systematic,
591 weakness of the whole idea of SVf_BREAK, in that code *is*
592 allowed to raise and lower references during global destruction,
593 so any *valid* code that happens to do this during global
594 destruction might well trigger premature cleanup. */
595 bool still_valid = gv && SvREFCNT(gv);
596
597 if (still_valid)
598 SvREFCNT_inc_simple_void(gv);
350de78d 599#ifdef USE_ITHREADS
6a077020
DM		 600 if (cPADOPo->op_padix > 0) {
601 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
602 * may still exist on the pad */
603 pad_swipe(cPADOPo->op_padix, TRUE);
604 cPADOPo->op_padix = 0;
605 }
350de78d 606#else
6a077020 607 SvREFCNT_dec(cSVOPo->op_sv);
a0714e2c 608 cSVOPo->op_sv = NULL;
350de78d 609#endif
b327b36f 610 if (still_valid) {
f7461760
Z		 611 int try_downgrade = SvREFCNT(gv) == 2;
612 SvREFCNT_dec(gv);
613 if (try_downgrade)
614 gv_try_downgrade(gv);
615 }
6a077020 616 }
79072805 617 break;
a1ae71d2 618 case OP_METHOD_NAMED:
79072805 619 case OP_CONST:
996c9baa 620 case OP_HINTSEVAL:
11343788 621 SvREFCNT_dec(cSVOPo->op_sv);
a0714e2c 622 cSVOPo->op_sv = NULL;
3b1c21fa
AB		 623#ifdef USE_ITHREADS
624 /** Bug #15654
625 Even if op_clear does a pad_free for the target of the op,
6a077020 626 pad_free doesn't actually remove the sv that exists in the pad;
3b1c21fa
AB		 627 instead it lives on. This results in that it could be reused as
628 a target later on when the pad was reallocated.
629 **/
630 if(o->op_targ) {
631 pad_swipe(o->op_targ,1);
632 o->op_targ = 0;
633 }
634#endif
79072805 635 break;
748a9306
LW		 636 case OP_GOTO:
637 case OP_NEXT:
638 case OP_LAST:
639 case OP_REDO:
11343788 640 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
748a9306
LW		 641 break;
642 /* FALL THROUGH */
a0d0e21e 643 case OP_TRANS:
bb16bae8 644 case OP_TRANSR:
acb36ea4 645 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
043e41b8
DM		 646#ifdef USE_ITHREADS
647 if (cPADOPo->op_padix > 0) {
648 pad_swipe(cPADOPo->op_padix, TRUE);
649 cPADOPo->op_padix = 0;
650 }
651#else
a0ed51b3 652 SvREFCNT_dec(cSVOPo->op_sv);
a0714e2c 653 cSVOPo->op_sv = NULL;
043e41b8 654#endif
acb36ea4
GS		 655 }
656 else {
ea71c68d 657 PerlMemShared_free(cPVOPo->op_pv);
bd61b366 658 cPVOPo->op_pv = NULL;
acb36ea4 659 }
a0d0e21e
LW		 660 break;
661 case OP_SUBST:
20e98b0f 662 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
971a9dd3 663 goto clear_pmop;
748a9306 664 case OP_PUSHRE:
971a9dd3 665#ifdef USE_ITHREADS
20e98b0f 666 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
dd2155a4
DM		 667 /* No GvIN_PAD_off here, because other references may still
668 * exist on the pad */
20e98b0f 669 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
971a9dd3
GS		 670 }
671#else
ad64d0ec 672 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
971a9dd3
GS		 673#endif
674 /* FALL THROUGH */
a0d0e21e 675 case OP_MATCH:
8782bef2 676 case OP_QR:
971a9dd3 677clear_pmop:
c2b1997a 678 forget_pmop(cPMOPo, 1);
20e98b0f 679 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
9cddf794
NC		 680 /* we use the same protection as the "SAFE" version of the PM_ macros
681 * here since sv_clean_all might release some PMOPs
5f8cb046
DM		 682 * after PL_regex_padav has been cleared
683 * and the clearing of PL_regex_padav needs to
684 * happen before sv_clean_all
685 */
13137afc
AB		 686#ifdef USE_ITHREADS
687 if(PL_regex_pad) { /* We could be in destruction */
402d2eb1 688 const IV offset = (cPMOPo)->op_pmoffset;
9cddf794 689 ReREFCNT_dec(PM_GETRE(cPMOPo));
402d2eb1
NC		 690 PL_regex_pad[offset] = &PL_sv_undef;
691 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
692 sizeof(offset));
13137afc 693 }
9cddf794
NC		 694#else
695 ReREFCNT_dec(PM_GETRE(cPMOPo));
696 PM_SETRE(cPMOPo, NULL);
1eb1540c 697#endif
13137afc 698
a0d0e21e 699 break;
79072805
LW		 700 }
701
743e66e6 702 if (o->op_targ > 0) {
11343788 703 pad_free(o->op_targ);
743e66e6
GS		 704 o->op_targ = 0;
705 }
79072805
LW		 706}
707
76e3520e 708STATIC void
3eb57f73
HS		 709S_cop_free(pTHX_ COP* cop)
710{
7918f24d
NC		 711 PERL_ARGS_ASSERT_COP_FREE;
712
05ec9bb3
NIS		 713 CopFILE_free(cop);
714 CopSTASH_free(cop);
0453d815 715 if (! specialWARN(cop->cop_warnings))
72dc9ed5 716 PerlMemShared_free(cop->cop_warnings);
20439bc7 717 cophh_free(CopHINTHASH_get(cop));
3eb57f73
HS		 718}
719
c2b1997a 720STATIC void
c4bd3ae5
NC		 721S_forget_pmop(pTHX_ PMOP *const o
722#ifdef USE_ITHREADS
723 , U32 flags
724#endif
725 )
c2b1997a
NC		 726{
727 HV * const pmstash = PmopSTASH(o);
7918f24d
NC		 728
729 PERL_ARGS_ASSERT_FORGET_PMOP;
730
c2b1997a 731 if (pmstash && !SvIS_FREED(pmstash)) {
ad64d0ec 732 MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab);
c2b1997a
NC		 733 if (mg) {
734 PMOP **const array = (PMOP**) mg->mg_ptr;
735 U32 count = mg->mg_len / sizeof(PMOP**);
736 U32 i = count;
737
738 while (i--) {
739 if (array[i] == o) {
740 /* Found it. Move the entry at the end to overwrite it. */
741 array[i] = array[--count];
742 mg->mg_len = count * sizeof(PMOP**);
743 /* Could realloc smaller at this point always, but probably
744 not worth it. Probably worth free()ing if we're the
745 last. */
746 if(!count) {
747 Safefree(mg->mg_ptr);
748 mg->mg_ptr = NULL;
749 }
750 break;
751 }
752 }
753 }
754 }
1cdf7faf
NC		 755 if (PL_curpm == o)
756 PL_curpm = NULL;
c4bd3ae5 757#ifdef USE_ITHREADS
c2b1997a
NC		 758 if (flags)
759 PmopSTASH_free(o);
c4bd3ae5 760#endif
c2b1997a
NC		 761}
762
bfd0ff22
NC		 763STATIC void
764S_find_and_forget_pmops(pTHX_ OP *o)
765{
7918f24d
NC		 766 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
767
bfd0ff22
NC		 768 if (o->op_flags & OPf_KIDS) {
769 OP *kid = cUNOPo->op_first;
770 while (kid) {
771 switch (kid->op_type) {
772 case OP_SUBST:
773 case OP_PUSHRE:
774 case OP_MATCH:
775 case OP_QR:
776 forget_pmop((PMOP*)kid, 0);
777 }
778 find_and_forget_pmops(kid);
779 kid = kid->op_sibling;
780 }
781 }
782}
783
93c66552
DM		 784void
785Perl_op_null(pTHX_ OP *o)
8990e307 786{
27da23d5 787 dVAR;
7918f24d
NC		 788
789 PERL_ARGS_ASSERT_OP_NULL;
790
acb36ea4
GS		 791 if (o->op_type == OP_NULL)
792 return;
eb8433b7
NC		 793 if (!PL_madskills)
794 op_clear(o);
11343788
MB		 795 o->op_targ = o->op_type;
796 o->op_type = OP_NULL;
22c35a8c 797 o->op_ppaddr = PL_ppaddr[OP_NULL];
8990e307
LW		 798}
799
4026c95a
SH		 800void
801Perl_op_refcnt_lock(pTHX)
802{
27da23d5 803 dVAR;
96a5add6 804 PERL_UNUSED_CONTEXT;
4026c95a
SH		 805 OP_REFCNT_LOCK;
806}
807
808void
809Perl_op_refcnt_unlock(pTHX)
810{
27da23d5 811 dVAR;
96a5add6 812 PERL_UNUSED_CONTEXT;
4026c95a
SH		 813 OP_REFCNT_UNLOCK;
814}
815
79072805
LW		 816/* Contextualizers */
817
d9088386
Z		 818/*
819=for apidoc Am|OP *|op_contextualize|OP *o|I32 context
820
821Applies a syntactic context to an op tree representing an expression.
822I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>,
823or C<G_VOID> to specify the context to apply. The modified op tree
824is returned.
825
826=cut
827*/
828
829OP *
830Perl_op_contextualize(pTHX_ OP *o, I32 context)
831{
832 PERL_ARGS_ASSERT_OP_CONTEXTUALIZE;
833 switch (context) {
834 case G_SCALAR: return scalar(o);
835 case G_ARRAY: return list(o);
836 case G_VOID: return scalarvoid(o);
837 default:
838 Perl_croak(aTHX_ "panic: op_contextualize bad context");
839 return o;
840 }
841}
842
5983a79d
BM		 843/*
844=head1 Optree Manipulation Functions
79072805 845
5983a79d
BM		 846=for apidoc Am|OP*|op_linklist|OP *o
847This function is the implementation of the L</LINKLIST> macro. It should
848not be called directly.
849
850=cut
851*/
852
853OP *
854Perl_op_linklist(pTHX_ OP *o)
79072805 855{
3edf23ff 856 OP *first;
79072805 857
5983a79d 858 PERL_ARGS_ASSERT_OP_LINKLIST;
7918f24d 859
11343788
MB		 860 if (o->op_next)
861 return o->op_next;
79072805
LW		 862
863 /* establish postfix order */
3edf23ff
AL		 864 first = cUNOPo->op_first;
865 if (first) {
6867be6d 866 register OP *kid;
3edf23ff
AL		 867 o->op_next = LINKLIST(first);
868 kid = first;
869 for (;;) {
870 if (kid->op_sibling) {
79072805 871 kid->op_next = LINKLIST(kid->op_sibling);
3edf23ff
AL		 872 kid = kid->op_sibling;
873 } else {
11343788 874 kid->op_next = o;
3edf23ff
AL		 875 break;
876 }
79072805
LW		 877 }
878 }
879 else
11343788 880 o->op_next = o;
79072805 881
11343788 882 return o->op_next;
79072805
LW		 883}
884
1f676739 885static OP *
2dd5337b 886S_scalarkids(pTHX_ OP *o)
79072805 887{
11343788 888 if (o && o->op_flags & OPf_KIDS) {
bfed75c6 889 OP *kid;
11343788 890 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
79072805
LW		 891 scalar(kid);
892 }
11343788 893 return o;
79072805
LW		 894}
895
76e3520e 896STATIC OP *
cea2e8a9 897S_scalarboolean(pTHX_ OP *o)
8990e307 898{
97aff369 899 dVAR;
7918f24d
NC		 900
901 PERL_ARGS_ASSERT_SCALARBOOLEAN;
902
6b7c6d95
FC		 903 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST
904 && !(cBINOPo->op_first->op_flags & OPf_SPECIAL)) {
d008e5eb 905 if (ckWARN(WARN_SYNTAX)) {
6867be6d 906 const line_t oldline = CopLINE(PL_curcop);
a0d0e21e 907
53a7735b
DM		 908 if (PL_parser && PL_parser->copline != NOLINE)
909 CopLINE_set(PL_curcop, PL_parser->copline);
9014280d 910 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
57843af0 911 CopLINE_set(PL_curcop, oldline);
d008e5eb 912 }
a0d0e21e 913 }
11343788 914 return scalar(o);
8990e307
LW		 915}
916
917OP *
864dbfa3 918Perl_scalar(pTHX_ OP *o)
79072805 919{
27da23d5 920 dVAR;
79072805
LW		 921 OP *kid;
922
a0d0e21e 923 /* assumes no premature commitment */
13765c85
DM		 924 if (!o || (PL_parser && PL_parser->error_count)
925 || (o->op_flags & OPf_WANT)
5dc0d613 926 || o->op_type == OP_RETURN)
7e363e51 927 {
11343788 928 return o;
7e363e51 929 }
79072805 930
5dc0d613 931 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
79072805 932
11343788 933 switch (o->op_type) {
79072805 934 case OP_REPEAT:
11343788 935 scalar(cBINOPo->op_first);
8990e307 936 break;
79072805
LW		 937 case OP_OR:
938 case OP_AND:
939 case OP_COND_EXPR:
11343788 940 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
8990e307 941 scalar(kid);
79072805 942 break;
a0d0e21e 943 /* FALL THROUGH */
a6d8037e 944 case OP_SPLIT:
79072805 945 case OP_MATCH:
8782bef2 946 case OP_QR:
79072805
LW		 947 case OP_SUBST:
948 case OP_NULL:
8990e307 949 default:
11343788
MB		 950 if (o->op_flags & OPf_KIDS) {
951 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
8990e307
LW		 952 scalar(kid);
953 }
79072805
LW		 954 break;
955 case OP_LEAVE:
956 case OP_LEAVETRY:
5dc0d613 957 kid = cLISTOPo->op_first;
54310121 958 scalar(kid);
25b991bf
VP		 959 kid = kid->op_sibling;
960 do_kids:
961 while (kid) {
962 OP *sib = kid->op_sibling;
963 if (sib && kid->op_type != OP_LEAVEWHEN) {
964 if (sib->op_type == OP_BREAK && sib->op_flags & OPf_SPECIAL) {
965 scalar(kid);
966 scalarvoid(sib);
967 break;
968 } else
969 scalarvoid(kid);
970 } else
54310121 971 scalar(kid);
25b991bf 972 kid = sib;
54310121 973 }
11206fdd 974 PL_curcop = &PL_compiling;
54310121 975 break;
748a9306 976 case OP_SCOPE:
79072805 977 case OP_LINESEQ:
8990e307 978 case OP_LIST:
25b991bf
VP		 979 kid = cLISTOPo->op_first;
980 goto do_kids;
a801c63c 981 case OP_SORT:
a2a5de95 982 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
553e7bb0 983 break;
79072805 984 }
11343788 985 return o;
79072805
LW		 986}
987
988OP *
864dbfa3 989Perl_scalarvoid(pTHX_ OP *o)
79072805 990{
27da23d5 991 dVAR;
79072805 992 OP *kid;
c445ea15 993 const char* useless = NULL;
8990e307 994 SV* sv;
2ebea0a1
GS		 995 U8 want;
996
7918f24d
NC		 997 PERL_ARGS_ASSERT_SCALARVOID;
998
eb8433b7
NC		 999 /* trailing mad null ops don't count as "there" for void processing */
1000 if (PL_madskills &&
1001 o->op_type != OP_NULL &&
1002 o->op_sibling &&
1003 o->op_sibling->op_type == OP_NULL)
1004 {
1005 OP *sib;
1006 for (sib = o->op_sibling;
1007 sib && sib->op_type == OP_NULL;
1008 sib = sib->op_sibling) ;
1009
1010 if (!sib)
1011 return o;
1012 }
1013
acb36ea4 1014 if (o->op_type == OP_NEXTSTATE
acb36ea4
GS		 1015 || o->op_type == OP_DBSTATE
1016 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
acb36ea4 1017 || o->op_targ == OP_DBSTATE)))
2ebea0a1 1018 PL_curcop = (COP*)o; /* for warning below */
79072805 1019
54310121 1020 /* assumes no premature commitment */
2ebea0a1 1021 want = o->op_flags & OPf_WANT;
13765c85
DM		 1022 if ((want && want != OPf_WANT_SCALAR)
1023 || (PL_parser && PL_parser->error_count)
25b991bf 1024 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN)
7e363e51 1025 {
11343788 1026 return o;
7e363e51 1027 }
79072805 1028
b162f9ea 1029 if ((o->op_private & OPpTARGET_MY)
7e363e51
GS		 1030 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1031 {
b162f9ea 1032 return scalar(o); /* As if inside SASSIGN */
7e363e51 1033 }
1c846c1f 1034
5dc0d613 1035 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
79072805 1036
11343788 1037 switch (o->op_type) {
79072805 1038 default:
22c35a8c 1039 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
8990e307 1040 break;
36477c24 1041 /* FALL THROUGH */
1042 case OP_REPEAT:
11343788 1043 if (o->op_flags & OPf_STACKED)
8990e307 1044 break;
5d82c453
GA		 1045 goto func_ops;
1046 case OP_SUBSTR:
1047 if (o->op_private == 4)
1048 break;
8990e307
LW		 1049 /* FALL THROUGH */
1050 case OP_GVSV:
1051 case OP_WANTARRAY:
1052 case OP_GV:
74295f0b 1053 case OP_SMARTMATCH:
8990e307
LW		 1054 case OP_PADSV:
1055 case OP_PADAV:
1056 case OP_PADHV:
1057 case OP_PADANY:
1058 case OP_AV2ARYLEN:
8990e307 1059 case OP_REF:
a0d0e21e
LW		 1060 case OP_REFGEN:
1061 case OP_SREFGEN:
8990e307
LW		 1062 case OP_DEFINED:
1063 case OP_HEX:
1064 case OP_OCT:
1065 case OP_LENGTH:
8990e307
LW		 1066 case OP_VEC:
1067 case OP_INDEX:
1068 case OP_RINDEX:
1069 case OP_SPRINTF:
1070 case OP_AELEM:
1071 case OP_AELEMFAST:
1072 case OP_ASLICE:
8990e307
LW		 1073 case OP_HELEM:
1074 case OP_HSLICE:
1075 case OP_UNPACK:
1076 case OP_PACK:
8990e307
LW		 1077 case OP_JOIN:
1078 case OP_LSLICE:
1079 case OP_ANONLIST:
1080 case OP_ANONHASH:
1081 case OP_SORT:
1082 case OP_REVERSE:
1083 case OP_RANGE:
1084 case OP_FLIP:
1085 case OP_FLOP:
1086 case OP_CALLER:
1087 case OP_FILENO:
1088 case OP_EOF:
1089 case OP_TELL:
1090 case OP_GETSOCKNAME:
1091 case OP_GETPEERNAME:
1092 case OP_READLINK:
1093 case OP_TELLDIR:
1094 case OP_GETPPID:
1095 case OP_GETPGRP:
1096 case OP_GETPRIORITY:
1097 case OP_TIME:
1098 case OP_TMS:
1099 case OP_LOCALTIME:
1100 case OP_GMTIME:
1101 case OP_GHBYNAME:
1102 case OP_GHBYADDR:
1103 case OP_GHOSTENT:
1104 case OP_GNBYNAME:
1105 case OP_GNBYADDR:
1106 case OP_GNETENT:
1107 case OP_GPBYNAME:
1108 case OP_GPBYNUMBER:
1109 case OP_GPROTOENT:
1110 case OP_GSBYNAME:
1111 case OP_GSBYPORT:
1112 case OP_GSERVENT:
1113 case OP_GPWNAM:
1114 case OP_GPWUID:
1115 case OP_GGRNAM:
1116 case OP_GGRGID:
1117 case OP_GETLOGIN:
78e1b766 1118 case OP_PROTOTYPE:
5d82c453 1119 func_ops:
64aac5a9 1120 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
74295f0b 1121 /* Otherwise it's "Useless use of grep iterator" */
f5df4782 1122 useless = OP_DESC(o);
75068674
RGS		 1123 break;
1124
1125 case OP_SPLIT:
1126 kid = cLISTOPo->op_first;
1127 if (kid && kid->op_type == OP_PUSHRE
1128#ifdef USE_ITHREADS
1129 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1130#else
1131 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1132#endif
1133 useless = OP_DESC(o);
8990e307
LW		 1134 break;
1135
9f82cd5f
YST		 1136 case OP_NOT:
1137 kid = cUNOPo->op_first;
1138 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
bb16bae8 1139 kid->op_type != OP_TRANS && kid->op_type != OP_TRANSR) {
9f82cd5f
YST		 1140 goto func_ops;
1141 }
1142 useless = "negative pattern binding (!~)";
1143 break;
1144
4f4d7508
DC		 1145 case OP_SUBST:
1146 if (cPMOPo->op_pmflags & PMf_NONDESTRUCT)
8db9069c 1147 useless = "non-destructive substitution (s///r)";
4f4d7508
DC		 1148 break;
1149
bb16bae8
FC		 1150 case OP_TRANSR:
1151 useless = "non-destructive transliteration (tr///r)";
1152 break;
1153
8990e307
LW		 1154 case OP_RV2GV:
1155 case OP_RV2SV:
1156 case OP_RV2AV:
1157 case OP_RV2HV:
192587c2 1158 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
11343788 1159 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
8990e307
LW		 1160 useless = "a variable";
1161 break;
79072805
LW		 1162
1163 case OP_CONST:
7766f137 1164 sv = cSVOPo_sv;
7a52d87a
GS		 1165 if (cSVOPo->op_private & OPpCONST_STRICT)
1166 no_bareword_allowed(o);
1167 else {
d008e5eb 1168 if (ckWARN(WARN_VOID)) {
fa01e093
RGS		 1169 if (SvOK(sv)) {
1170 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1171 "a constant (%"SVf")", sv));
1172 useless = SvPV_nolen(msv);
1173 }
1174 else
1175 useless = "a constant (undef)";
2e0ae2d3 1176 if (o->op_private & OPpCONST_ARYBASE)
d4c19fe8 1177 useless = NULL;
e7fec78e 1178 /* don't warn on optimised away booleans, eg
b5a930ec 1179 * use constant Foo, 5; Foo || print; */
e7fec78e 1180 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
d4c19fe8 1181 useless = NULL;
960b4253
MG		 1182 /* the constants 0 and 1 are permitted as they are
1183 conventionally used as dummies in constructs like
1184 1 while some_condition_with_side_effects; */
e7fec78e 1185 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
d4c19fe8 1186 useless = NULL;
d008e5eb 1187 else if (SvPOK(sv)) {
a52fe3ac
A		 1188 /* perl4's way of mixing documentation and code
1189 (before the invention of POD) was based on a
1190 trick to mix nroff and perl code. The trick was
1191 built upon these three nroff macros being used in
1192 void context. The pink camel has the details in
1193 the script wrapman near page 319. */
6136c704
AL		 1194 const char * const maybe_macro = SvPVX_const(sv);
1195 if (strnEQ(maybe_macro, "di", 2) ||
1196 strnEQ(maybe_macro, "ds", 2) ||
1197 strnEQ(maybe_macro, "ig", 2))
d4c19fe8 1198 useless = NULL;
d008e5eb 1199 }
8990e307
LW		 1200 }
1201 }
93c66552 1202 op_null(o); /* don't execute or even remember it */
79072805
LW		 1203 break;
1204
1205 case OP_POSTINC:
11343788 1206 o->op_type = OP_PREINC; /* pre-increment is faster */
22c35a8c 1207 o->op_ppaddr = PL_ppaddr[OP_PREINC];
79072805
LW		 1208 break;
1209
1210 case OP_POSTDEC:
11343788 1211 o->op_type = OP_PREDEC; /* pre-decrement is faster */
22c35a8c 1212 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
79072805
LW		 1213 break;
1214
679d6c4e
HS		 1215 case OP_I_POSTINC:
1216 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1217 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1218 break;
1219
1220 case OP_I_POSTDEC:
1221 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1222 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1223 break;
1224
79072805
LW		 1225 case OP_OR:
1226 case OP_AND:
edbe35ea
VP		 1227 kid = cLOGOPo->op_first;
1228 if (kid->op_type == OP_NOT
1229 && (kid->op_flags & OPf_KIDS)
1230 && !PL_madskills) {
1231 if (o->op_type == OP_AND) {
1232 o->op_type = OP_OR;
1233 o->op_ppaddr = PL_ppaddr[OP_OR];
1234 } else {
1235 o->op_type = OP_AND;
1236 o->op_ppaddr = PL_ppaddr[OP_AND];
1237 }
1238 op_null(kid);
1239 }
1240
c963b151 1241 case OP_DOR:
79072805 1242 case OP_COND_EXPR:
0d863452
RH		 1243 case OP_ENTERGIVEN:
1244 case OP_ENTERWHEN:
11343788 1245 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
79072805
LW		 1246 scalarvoid(kid);
1247 break;
5aabfad6 1248
a0d0e21e 1249 case OP_NULL:
11343788 1250 if (o->op_flags & OPf_STACKED)
a0d0e21e 1251 break;
5aabfad6 1252 /* FALL THROUGH */
2ebea0a1
GS		 1253 case OP_NEXTSTATE:
1254 case OP_DBSTATE:
79072805
LW		 1255 case OP_ENTERTRY:
1256 case OP_ENTER:
11343788 1257 if (!(o->op_flags & OPf_KIDS))
79072805 1258 break;
54310121 1259 /* FALL THROUGH */
463ee0b2 1260 case OP_SCOPE:
79072805
LW		 1261 case OP_LEAVE:
1262 case OP_LEAVETRY:
a0d0e21e 1263 case OP_LEAVELOOP:
79072805 1264 case OP_LINESEQ:
79072805 1265 case OP_LIST:
0d863452
RH		 1266 case OP_LEAVEGIVEN:
1267 case OP_LEAVEWHEN:
11343788 1268 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
79072805
LW		 1269 scalarvoid(kid);
1270 break;
c90c0ff4 1271 case OP_ENTEREVAL:
5196be3e 1272 scalarkids(o);
c90c0ff4 1273 break;
d6483035 1274 case OP_SCALAR:
5196be3e 1275 return scalar(o);
79072805 1276 }
a2a5de95
NC		 1277 if (useless)
1278 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
11343788 1279 return o;
79072805
LW		 1280}
1281
1f676739 1282static OP *
412da003 1283S_listkids(pTHX_ OP *o)
79072805 1284{
11343788 1285 if (o && o->op_flags & OPf_KIDS) {
6867be6d 1286 OP *kid;
11343788 1287 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
79072805
LW		 1288 list(kid);
1289 }
11343788 1290 return o;
79072805
LW		 1291}
1292
1293OP *
864dbfa3 1294Perl_list(pTHX_ OP *o)
79072805 1295{
27da23d5 1296 dVAR;
79072805
LW		 1297 OP *kid;
1298
a0d0e21e 1299 /* assumes no premature commitment */
13765c85
DM		 1300 if (!o || (o->op_flags & OPf_WANT)
1301 || (PL_parser && PL_parser->error_count)
5dc0d613 1302 || o->op_type == OP_RETURN)
7e363e51 1303 {
11343788 1304 return o;
7e363e51 1305 }
79072805 1306
b162f9ea 1307 if ((o->op_private & OPpTARGET_MY)
7e363e51
GS		 1308 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1309 {
b162f9ea 1310 return o; /* As if inside SASSIGN */
7e363e51 1311 }
1c846c1f 1312
5dc0d613 1313 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
79072805 1314
11343788 1315 switch (o->op_type) {
79072805
LW		 1316 case OP_FLOP:
1317 case OP_REPEAT:
11343788 1318 list(cBINOPo->op_first);
79072805
LW		 1319 break;
1320 case OP_OR:
1321 case OP_AND:
1322 case OP_COND_EXPR:
11343788 1323 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
79072805
LW		 1324 list(kid);
1325 break;
1326 default:
1327 case OP_MATCH:
8782bef2 1328 case OP_QR:
79072805
LW		 1329 case OP_SUBST:
1330 case OP_NULL:
11343788 1331 if (!(o->op_flags & OPf_KIDS))
79072805 1332 break;
11343788
MB		 1333 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1334 list(cBINOPo->op_first);
1335 return gen_constant_list(o);
79072805
LW		 1336 }
1337 case OP_LIST:
11343788 1338 listkids(o);
79072805
LW		 1339 break;
1340 case OP_LEAVE:
1341 case OP_LEAVETRY:
5dc0d613 1342 kid = cLISTOPo->op_first;
54310121 1343 list(kid);
25b991bf
VP		 1344 kid = kid->op_sibling;
1345 do_kids:
1346 while (kid) {
1347 OP *sib = kid->op_sibling;
1348 if (sib && kid->op_type != OP_LEAVEWHEN) {
1349 if (sib->op_type == OP_BREAK && sib->op_flags & OPf_SPECIAL) {
1350 list(kid);
1351 scalarvoid(sib);
1352 break;
1353 } else
1354 scalarvoid(kid);
1355 } else
54310121 1356 list(kid);
25b991bf 1357 kid = sib;
54310121 1358 }
11206fdd 1359 PL_curcop = &PL_compiling;
54310121 1360 break;
748a9306 1361 case OP_SCOPE:
79072805 1362 case OP_LINESEQ:
25b991bf
VP		 1363 kid = cLISTOPo->op_first;
1364 goto do_kids;
79072805 1365 }
11343788 1366 return o;
79072805
LW		 1367}
1368
1f676739 1369static OP *
2dd5337b 1370S_scalarseq(pTHX_ OP *o)
79072805 1371{
97aff369 1372 dVAR;
11343788 1373 if (o) {
1496a290
AL		 1374 const OPCODE type = o->op_type;
1375
1376 if (type == OP_LINESEQ || type == OP_SCOPE ||
1377 type == OP_LEAVE || type == OP_LEAVETRY)
463ee0b2 1378 {
6867be6d 1379 OP *kid;
11343788 1380 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
ed6116ce 1381 if (kid->op_sibling) {
463ee0b2 1382 scalarvoid(kid);
ed6116ce 1383 }
463ee0b2 1384 }
3280af22 1385 PL_curcop = &PL_compiling;
79072805 1386 }
11343788 1387 o->op_flags &= ~OPf_PARENS;
3280af22 1388 if (PL_hints & HINT_BLOCK_SCOPE)
11343788 1389 o->op_flags |= OPf_PARENS;
79072805 1390 }
8990e307 1391 else
11343788
MB		 1392 o = newOP(OP_STUB, 0);
1393 return o;
79072805
LW		 1394}
1395
76e3520e 1396STATIC OP *
cea2e8a9 1397S_modkids(pTHX_ OP *o, I32 type)
79072805 1398{
11343788 1399 if (o && o->op_flags & OPf_KIDS) {
6867be6d 1400 OP *kid;
11343788 1401 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
3ad73efd 1402 op_lvalue(kid, type);
79072805 1403 }
11343788 1404 return o;
79072805
LW		 1405}
1406
3ad73efd
Z		 1407/*
1408=for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
1409
1410Propagate lvalue ("modifiable") context to an op and its children.
1411I<type> represents the context type, roughly based on the type of op that
1412would do the modifying, although C<local()> is represented by OP_NULL,
1413because it has no op type of its own (it is signalled by a flag on
001c3c51
FC		 1414the lvalue op).
1415
1416This function detects things that can't be modified, such as C<$x+1>, and
1417generates errors for them. For example, C<$x+1 = 2> would cause it to be
1418called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN.
1419
1420It also flags things that need to behave specially in an lvalue context,
1421such as C<$$x = 5> which might have to vivify a reference in C<$x>.
3ad73efd
Z		 1422
1423=cut
1424*/
ddeae0f1 1425
79072805 1426OP *
3ad73efd 1427Perl_op_lvalue(pTHX_ OP *o, I32 type)
79072805 1428{
27da23d5 1429 dVAR;
79072805 1430 OP *kid;
ddeae0f1
DM		 1431 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1432 int localize = -1;
79072805 1433
13765c85 1434 if (!o || (PL_parser && PL_parser->error_count))
11343788 1435 return o;
79072805 1436
b162f9ea 1437 if ((o->op_private & OPpTARGET_MY)
7e363e51
GS		 1438 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1439 {
b162f9ea 1440 return o;
7e363e51 1441 }
1c846c1f 1442
11343788 1443 switch (o->op_type) {
68dc0745 1444 case OP_UNDEF:
ddeae0f1 1445 localize = 0;
3280af22 1446 PL_modcount++;
5dc0d613 1447 return o;
a0d0e21e 1448 case OP_CONST:
2e0ae2d3 1449 if (!(o->op_private & OPpCONST_ARYBASE))
a0d0e21e 1450 goto nomod;
54dc0f91 1451 localize = 0;
3280af22 1452 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
fc15ae8f
NC		 1453 CopARYBASE_set(&PL_compiling,
1454 (I32)SvIV(cSVOPx(PL_eval_start)->op_sv));
3280af22 1455 PL_eval_start = 0;
a0d0e21e
LW		 1456 }
1457 else if (!type) {
fc15ae8f
NC		 1458 SAVECOPARYBASE(&PL_compiling);
1459 CopARYBASE_set(&PL_compiling, 0);
a0d0e21e
LW		 1460 }
1461 else if (type == OP_REFGEN)
1462 goto nomod;
1463 else
cea2e8a9 1464 Perl_croak(aTHX_ "That use of $[ is unsupported");
a0d0e21e 1465 break;
5f05dabc 1466 case OP_STUB:
58bde88d 1467 if ((o->op_flags & OPf_PARENS) || PL_madskills)
5f05dabc 1468 break;
1469 goto nomod;
a0d0e21e
LW		 1470 case OP_ENTERSUB:
1471 if ((type == OP_UNDEF || type == OP_REFGEN) &&
11343788
MB		 1472 !(o->op_flags & OPf_STACKED)) {
1473 o->op_type = OP_RV2CV; /* entersub => rv2cv */
e26df76a
NC		 1474 /* The default is to set op_private to the number of children,
1475 which for a UNOP such as RV2CV is always 1. And w're using
1476 the bit for a flag in RV2CV, so we need it clear. */
1477 o->op_private &= ~1;
22c35a8c 1478 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
11343788 1479 assert(cUNOPo->op_first->op_type == OP_NULL);
93c66552 1480 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
79072805
LW		 1481 break;
1482 }
95f0a2f1
SB		 1483 else if (o->op_private & OPpENTERSUB_NOMOD)
1484 return o;
cd06dffe
GS		 1485 else { /* lvalue subroutine call */
1486 o->op_private |= OPpLVAL_INTRO;
e6438c1a 1487 PL_modcount = RETURN_UNLIMITED_NUMBER;
4978d6d9 1488 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
cd06dffe
GS		 1489 /* Backward compatibility mode: */
1490 o->op_private |= OPpENTERSUB_INARGS;
1491 break;
1492 }
1493 else { /* Compile-time error message: */
1494 OP *kid = cUNOPo->op_first;
1495 CV *cv;
1496 OP *okid;
1497
3ea285d1
AL		 1498 if (kid->op_type != OP_PUSHMARK) {
1499 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1500 Perl_croak(aTHX_
1501 "panic: unexpected lvalue entersub "
1502 "args: type/targ %ld:%"UVuf,
1503 (long)kid->op_type, (UV)kid->op_targ);
1504 kid = kLISTOP->op_first;
1505 }
cd06dffe
GS		 1506 while (kid->op_sibling)
1507 kid = kid->op_sibling;
1508 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1509 /* Indirect call */
1510 if (kid->op_type == OP_METHOD_NAMED
1511 || kid->op_type == OP_METHOD)
1512 {
87d7fd28 1513 UNOP *newop;
b2ffa427 1514
87d7fd28 1515 NewOp(1101, newop, 1, UNOP);
349fd7b7
GS		 1516 newop->op_type = OP_RV2CV;
1517 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
5f66b61c 1518 newop->op_first = NULL;
87d7fd28
GS		 1519 newop->op_next = (OP*)newop;
1520 kid->op_sibling = (OP*)newop;
349fd7b7 1521 newop->op_private |= OPpLVAL_INTRO;
e26df76a 1522 newop->op_private &= ~1;
cd06dffe
GS		 1523 break;
1524 }
b2ffa427 1525
cd06dffe
GS		 1526 if (kid->op_type != OP_RV2CV)
1527 Perl_croak(aTHX_
1528 "panic: unexpected lvalue entersub "
55140b79 1529 "entry via type/targ %ld:%"UVuf,
3d811634 1530 (long)kid->op_type, (UV)kid->op_targ);
cd06dffe
GS		 1531 kid->op_private |= OPpLVAL_INTRO;
1532 break; /* Postpone until runtime */
1533 }
b2ffa427
NIS		 1534
1535 okid = kid;
cd06dffe
GS		 1536 kid = kUNOP->op_first;
1537 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1538 kid = kUNOP->op_first;
b2ffa427 1539 if (kid->op_type == OP_NULL)
cd06dffe
GS		 1540 Perl_croak(aTHX_
1541 "Unexpected constant lvalue entersub "
55140b79 1542 "entry via type/targ %ld:%"UVuf,
3d811634 1543 (long)kid->op_type, (UV)kid->op_targ);
cd06dffe
GS		 1544 if (kid->op_type != OP_GV) {
1545 /* Restore RV2CV to check lvalueness */
1546 restore_2cv:
1547 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1548 okid->op_next = kid->op_next;
1549 kid->op_next = okid;
1550 }
1551 else
5f66b61c 1552 okid->op_next = NULL;
cd06dffe
GS		 1553 okid->op_type = OP_RV2CV;
1554 okid->op_targ = 0;
1555 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1556 okid->op_private |= OPpLVAL_INTRO;
e26df76a 1557 okid->op_private &= ~1;
cd06dffe
GS		 1558 break;
1559 }
b2ffa427 1560
638eceb6 1561 cv = GvCV(kGVOP_gv);
1c846c1f 1562 if (!cv)
cd06dffe
GS		 1563 goto restore_2cv;
1564 if (CvLVALUE(cv))
1565 break;
1566 }
1567 }
79072805
LW		 1568 /* FALL THROUGH */
1569 default:
a0d0e21e 1570 nomod:
6fbb66d6 1571 /* grep, foreach, subcalls, refgen */
145b2bbb
FC		 1572 if (type == OP_GREPSTART || type == OP_ENTERSUB
1573 || type == OP_REFGEN || type == OP_LEAVESUBLV)
a0d0e21e 1574 break;
cea2e8a9 1575 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
638bc118 1576 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
cd06dffe
GS		 1577 ? "do block"
1578 : (o->op_type == OP_ENTERSUB
1579 ? "non-lvalue subroutine call"
53e06cf0 1580 : OP_DESC(o))),
22c35a8c 1581 type ? PL_op_desc[type] : "local"));
11343788 1582 return o;
79072805 1583
a0d0e21e
LW		 1584 case OP_PREINC:
1585 case OP_PREDEC:
1586 case OP_POW:
1587 case OP_MULTIPLY:
1588 case OP_DIVIDE:
1589 case OP_MODULO:
1590 case OP_REPEAT:
1591 case OP_ADD:
1592 case OP_SUBTRACT:
1593 case OP_CONCAT:
1594 case OP_LEFT_SHIFT:
1595 case OP_RIGHT_SHIFT:
1596 case OP_BIT_AND:
1597 case OP_BIT_XOR:
1598 case OP_BIT_OR:
1599 case OP_I_MULTIPLY:
1600 case OP_I_DIVIDE:
1601 case OP_I_MODULO:
1602 case OP_I_ADD:
1603 case OP_I_SUBTRACT:
11343788 1604 if (!(o->op_flags & OPf_STACKED))
a0d0e21e 1605 goto nomod;
3280af22 1606 PL_modcount++;
a0d0e21e 1607 break;
b2ffa427 1608
79072805 1609 case OP_COND_EXPR:
ddeae0f1 1610 localize = 1;
11343788 1611 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
3ad73efd 1612 op_lvalue(kid, type);
79072805
LW		 1613 break;
1614
1615 case OP_RV2AV:
1616 case OP_RV2HV:
11343788 1617 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
e6438c1a 1618 PL_modcount = RETURN_UNLIMITED_NUMBER;
11343788 1619 return o; /* Treat \(@foo) like ordinary list. */
748a9306
LW		 1620 }
1621 /* FALL THROUGH */
79072805 1622 case OP_RV2GV:
5dc0d613 1623 if (scalar_mod_type(o, type))
3fe9a6f1 1624 goto nomod;
11343788 1625 ref(cUNOPo->op_first, o->op_type);
79072805 1626 /* FALL THROUGH */
79072805
LW		 1627 case OP_ASLICE:
1628 case OP_HSLICE:
78f9721b
SM		 1629 if (type == OP_LEAVESUBLV)
1630 o->op_private |= OPpMAYBE_LVSUB;
ddeae0f1 1631 localize = 1;
78f9721b
SM		 1632 /* FALL THROUGH */
1633 case OP_AASSIGN:
93a17b20
LW		 1634 case OP_NEXTSTATE:
1635 case OP_DBSTATE:
e6438c1a 1636 PL_modcount = RETURN_UNLIMITED_NUMBER;
79072805 1637 break;
28c5b5bc
RGS		 1638 case OP_AV2ARYLEN:
1639 PL_hints |= HINT_BLOCK_SCOPE;
1640 if (type == OP_LEAVESUBLV)
1641 o->op_private |= OPpMAYBE_LVSUB;
1642 PL_modcount++;
1643 break;
463ee0b2 1644 case OP_RV2SV:
aeea060c 1645 ref(cUNOPo->op_first, o->op_type);
ddeae0f1 1646 localize = 1;
463ee0b2 1647 /* FALL THROUGH */
79072805 1648 case OP_GV:
3280af22 1649 PL_hints |= HINT_BLOCK_SCOPE;
463ee0b2 1650 case OP_SASSIGN:
bf4b1e52
GS		 1651 case OP_ANDASSIGN:
1652 case OP_ORASSIGN:
c963b151 1653 case OP_DORASSIGN:
ddeae0f1
DM		 1654 PL_modcount++;
1655 break;
1656
8990e307 1657 case OP_AELEMFAST:
6a077020 1658 localize = -1;
3280af22 1659 PL_modcount++;
8990e307
LW		 1660 break;
1661
748a9306
LW		 1662 case OP_PADAV:
1663 case OP_PADHV:
e6438c1a 1664 PL_modcount = RETURN_UNLIMITED_NUMBER;
5196be3e
MB		 1665 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1666 return o; /* Treat \(@foo) like ordinary list. */
1667 if (scalar_mod_type(o, type))
3fe9a6f1 1668 goto nomod;
78f9721b
SM		 1669 if (type == OP_LEAVESUBLV)
1670 o->op_private |= OPpMAYBE_LVSUB;
748a9306
LW		 1671 /* FALL THROUGH */
1672 case OP_PADSV:
3280af22 1673 PL_modcount++;
ddeae0f1 1674 if (!type) /* local() */
cea2e8a9 1675 Perl_croak(aTHX_ "Can't localize lexical variable %s",
dd2155a4 1676 PAD_COMPNAME_PV(o->op_targ));
463ee0b2
LW		 1677 break;
1678
748a9306 1679 case OP_PUSHMARK:
ddeae0f1 1680 localize = 0;
748a9306 1681 break;
b2ffa427 1682
69969c6f 1683 case OP_KEYS:
d8065907 1684 case OP_RKEYS:
69969c6f
SB		 1685 if (type != OP_SASSIGN)
1686 goto nomod;
5d82c453
GA		 1687 goto lvalue_func;
1688 case OP_SUBSTR:
1689 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1690 goto nomod;
5f05dabc 1691 /* FALL THROUGH */
a0d0e21e 1692 case OP_POS:
463ee0b2 1693 case OP_VEC:
78f9721b
SM		 1694 if (type == OP_LEAVESUBLV)
1695 o->op_private |= OPpMAYBE_LVSUB;
5d82c453 1696 lvalue_func:
11343788
MB		 1697 pad_free(o->op_targ);
1698 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
5dc0d613 1699 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
11343788 1700 if (o->op_flags & OPf_KIDS)
3ad73efd 1701 op_lvalue(cBINOPo->op_first->op_sibling, type);
463ee0b2 1702 break;
a0d0e21e 1703
463ee0b2
LW		 1704 case OP_AELEM:
1705 case OP_HELEM:
11343788 1706 ref(cBINOPo->op_first, o->op_type);
68dc0745 1707 if (type == OP_ENTERSUB &&
5dc0d613
MB		 1708 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1709 o->op_private |= OPpLVAL_DEFER;
78f9721b
SM		 1710 if (type == OP_LEAVESUBLV)
1711 o->op_private |= OPpMAYBE_LVSUB;
ddeae0f1 1712 localize = 1;
3280af22 1713 PL_modcount++;
463ee0b2
LW		 1714 break;
1715
1716 case OP_SCOPE:
1717 case OP_LEAVE:
1718 case OP_ENTER:
78f9721b 1719 case OP_LINESEQ:
ddeae0f1 1720 localize = 0;
11343788 1721 if (o->op_flags & OPf_KIDS)
3ad73efd 1722 op_lvalue(cLISTOPo->op_last, type);
a0d0e21e
LW		 1723 break;
1724
1725 case OP_NULL:
ddeae0f1 1726 localize = 0;
638bc118
GS		 1727 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1728 goto nomod;
1729 else if (!(o->op_flags & OPf_KIDS))
463ee0b2 1730 break;
11343788 1731 if (o->op_targ != OP_LIST) {
3ad73efd 1732 op_lvalue(cBINOPo->op_first, type);
a0d0e21e
LW		 1733 break;
1734 }
1735 /* FALL THROUGH */
463ee0b2 1736 case OP_LIST:
ddeae0f1 1737 localize = 0;
11343788 1738 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
3ad73efd 1739 op_lvalue(kid, type);
463ee0b2 1740 break;
78f9721b
SM		 1741
1742 case OP_RETURN:
1743 if (type != OP_LEAVESUBLV)
1744 goto nomod;
3ad73efd 1745 break; /* op_lvalue()ing was handled by ck_return() */
463ee0b2 1746 }
58d95175 1747
8be1be90
AMS		 1748 /* [20011101.069] File test operators interpret OPf_REF to mean that
1749 their argument is a filehandle; thus \stat(".") should not set
1750 it. AMS 20011102 */
1751 if (type == OP_REFGEN &&
ef69c8fc 1752 PL_check[o->op_type] == Perl_ck_ftst)
8be1be90
AMS		 1753 return o;
1754
1755 if (type != OP_LEAVESUBLV)
1756 o->op_flags |= OPf_MOD;
1757
1758 if (type == OP_AASSIGN || type == OP_SASSIGN)
1759 o->op_flags |= OPf_SPECIAL|OPf_REF;
ddeae0f1
DM		 1760 else if (!type) { /* local() */
1761 switch (localize) {
1762 case 1:
1763 o->op_private |= OPpLVAL_INTRO;
1764 o->op_flags &= ~OPf_SPECIAL;
1765 PL_hints |= HINT_BLOCK_SCOPE;
1766 break;
1767 case 0:
1768 break;
1769 case -1:
a2a5de95
NC		 1770 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
1771 "Useless localization of %s", OP_DESC(o));
ddeae0f1 1772 }
463ee0b2 1773 }
8be1be90
AMS		 1774 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1775 && type != OP_LEAVESUBLV)
1776 o->op_flags |= OPf_REF;
11343788 1777 return o;
463ee0b2
LW		 1778}
1779
8b47453d
FC		 1780/* Do not use this. It will be removed after 5.14. */
1781OP *
1782Perl_mod(pTHX_ OP *o, I32 type)
1783{
1784 return op_lvalue(o,type);
1785}
1786
1787
864dbfa3 1788STATIC bool
5f66b61c 1789S_scalar_mod_type(const OP *o, I32 type)
3fe9a6f1 1790{
7918f24d
NC		 1791 PERL_ARGS_ASSERT_SCALAR_MOD_TYPE;
1792
3fe9a6f1 1793 switch (type) {
1794 case OP_SASSIGN:
5196be3e 1795 if (o->op_type == OP_RV2GV)
3fe9a6f1 1796 return FALSE;
1797 /* FALL THROUGH */
1798 case OP_PREINC:
1799 case OP_PREDEC:
1800 case OP_POSTINC:
1801 case OP_POSTDEC:
1802 case OP_I_PREINC:
1803 case OP_I_PREDEC:
1804 case OP_I_POSTINC:
1805 case OP_I_POSTDEC:
1806 case OP_POW:
1807 case OP_MULTIPLY:
1808 case OP_DIVIDE:
1809 case OP_MODULO:
1810 case OP_REPEAT:
1811 case OP_ADD:
1812 case OP_SUBTRACT:
1813 case OP_I_MULTIPLY:
1814 case OP_I_DIVIDE:
1815 case OP_I_MODULO:
1816 case OP_I_ADD:
1817 case OP_I_SUBTRACT:
1818 case OP_LEFT_SHIFT:
1819 case OP_RIGHT_SHIFT:
1820 case OP_BIT_AND:
1821 case OP_BIT_XOR:
1822 case OP_BIT_OR:
1823 case OP_CONCAT:
1824 case OP_SUBST:
1825 case OP_TRANS:
bb16bae8 1826 case OP_TRANSR:
49e9fbe6
GS		 1827 case OP_READ:
1828 case OP_SYSREAD:
1829 case OP_RECV:
bf4b1e52
GS		 1830 case OP_ANDASSIGN:
1831 case OP_ORASSIGN:
410d09fe 1832 case OP_DORASSIGN:
3fe9a6f1 1833 return TRUE;
1834 default:
1835 return FALSE;
1836 }
1837}
1838
35cd451c 1839STATIC bool
5f66b61c 1840S_is_handle_constructor(const OP *o, I32 numargs)
35cd451c 1841{
7918f24d
NC		 1842 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
1843
35cd451c
GS		 1844 switch (o->op_type) {
1845 case OP_PIPE_OP:
1846 case OP_SOCKPAIR:
504618e9 1847 if (numargs == 2)
35cd451c
GS		 1848 return TRUE;
1849 /* FALL THROUGH */
1850 case OP_SYSOPEN:
1851 case OP_OPEN:
ded8aa31 1852 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
35cd451c
GS		 1853 case OP_SOCKET:
1854 case OP_OPEN_DIR:
1855 case OP_ACCEPT:
504618e9 1856 if (numargs == 1)
35cd451c 1857 return TRUE;
5f66b61c 1858 /* FALLTHROUGH */
35cd451c
GS		 1859 default:
1860 return FALSE;
1861 }
1862}
1863
0d86688d
NC		 1864static OP *
1865S_refkids(pTHX_ OP *o, I32 type)
463ee0b2 1866{
11343788 1867 if (o && o->op_flags & OPf_KIDS) {
6867be6d 1868 OP *kid;
11343788 1869 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
463ee0b2
LW		 1870 ref(kid, type);
1871 }
11343788 1872 return o;
463ee0b2
LW		 1873}
1874
1875OP *
e4c5ccf3 1876Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
463ee0b2 1877{
27da23d5 1878 dVAR;
463ee0b2 1879 OP *kid;
463ee0b2 1880
7918f24d
NC		 1881 PERL_ARGS_ASSERT_DOREF;
1882
13765c85 1883 if (!o || (PL_parser && PL_parser->error_count))
11343788 1884 return o;
463ee0b2 1885
11343788 1886 switch (o->op_type) {
a0d0e21e 1887 case OP_ENTERSUB:
afebc493 1888 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
11343788
MB		 1889 !(o->op_flags & OPf_STACKED)) {
1890 o->op_type = OP_RV2CV; /* entersub => rv2cv */
22c35a8c 1891 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
11343788 1892 assert(cUNOPo->op_first->op_type == OP_NULL);
93c66552 1893 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
11343788 1894 o->op_flags |= OPf_SPECIAL;
e26df76a 1895 o->op_private &= ~1;
8990e307
LW		 1896 }
1897 break;
aeea060c 1898
463ee0b2 1899 case OP_COND_EXPR:
11343788 1900 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
e4c5ccf3 1901 doref(kid, type, set_op_ref);
463ee0b2 1902 break;
8990e307 1903 case OP_RV2SV:
35cd451c
GS		 1904 if (type == OP_DEFINED)
1905 o->op_flags |= OPf_SPECIAL; /* don't create GV */
e4c5ccf3 1906 doref(cUNOPo->op_first, o->op_type, set_op_ref);
4633a7c4
LW		 1907 /* FALL THROUGH */
1908 case OP_PADSV:
5f05dabc 1909 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
5dc0d613
MB		 1910 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1911 : type == OP_RV2HV ? OPpDEREF_HV
1912 : OPpDEREF_SV);
11343788 1913 o->op_flags |= OPf_MOD;
a0d0e21e 1914 }
8990e307 1915 break;
1c846c1f 1916
463ee0b2
LW		 1917 case OP_RV2AV:
1918 case OP_RV2HV:
e4c5ccf3
RH		 1919 if (set_op_ref)
1920 o->op_flags |= OPf_REF;
8990e307 1921 /* FALL THROUGH */
463ee0b2 1922 case OP_RV2GV:
35cd451c
GS		 1923 if (type == OP_DEFINED)
1924 o->op_flags |= OPf_SPECIAL; /* don't create GV */
e4c5ccf3 1925 doref(cUNOPo->op_first, o->op_type, set_op_ref);
463ee0b2 1926 break;
8990e307 1927
463ee0b2
LW		 1928 case OP_PADAV:
1929 case OP_PADHV:
e4c5ccf3
RH		 1930 if (set_op_ref)
1931 o->op_flags |= OPf_REF;
79072805 1932 break;
aeea060c 1933
8990e307 1934 case OP_SCALAR:
79072805 1935 case OP_NULL:
11343788 1936 if (!(o->op_flags & OPf_KIDS))
463ee0b2 1937 break;
e4c5ccf3 1938 doref(cBINOPo->op_first, type, set_op_ref);
79072805
LW		 1939 break;
1940 case OP_AELEM:
1941 case OP_HELEM:
e4c5ccf3 1942 doref(cBINOPo->op_first, o->op_type, set_op_ref);
5f05dabc 1943 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
5dc0d613
MB		 1944 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1945 : type == OP_RV2HV ? OPpDEREF_HV
1946 : OPpDEREF_SV);
11343788 1947 o->op_flags |= OPf_MOD;
8990e307 1948 }
79072805
LW		 1949 break;
1950
463ee0b2 1951 case OP_SCOPE:
79072805 1952 case OP_LEAVE:
e4c5ccf3
RH		 1953 set_op_ref = FALSE;
1954 /* FALL THROUGH */
79072805 1955 case OP_ENTER:
8990e307 1956 case OP_LIST:
11343788 1957 if (!(o->op_flags & OPf_KIDS))
79072805 1958 break;
e4c5ccf3 1959 doref(cLISTOPo->op_last, type, set_op_ref);
79072805 1960 break;
a0d0e21e
LW		 1961 default:
1962 break;
79072805 1963 }
11343788 1964 return scalar(o);
8990e307 1965
79072805
LW		 1966}
1967
09bef843
SB		 1968STATIC OP *
1969S_dup_attrlist(pTHX_ OP *o)
1970{
97aff369 1971 dVAR;
0bd48802 1972 OP *rop;
09bef843 1973
7918f24d
NC		 1974 PERL_ARGS_ASSERT_DUP_ATTRLIST;
1975
09bef843
SB		 1976 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1977 * where the first kid is OP_PUSHMARK and the remaining ones
1978 * are OP_CONST. We need to push the OP_CONST values.
1979 */
1980 if (o->op_type == OP_CONST)
b37c2d43 1981 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
eb8433b7
NC		 1982#ifdef PERL_MAD
1983 else if (o->op_type == OP_NULL)
1d866c12 1984 rop = NULL;
eb8433b7 1985#endif
09bef843
SB		 1986 else {
1987 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
5f66b61c 1988 rop = NULL;
09bef843
SB		 1989 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1990 if (o->op_type == OP_CONST)
2fcb4757 1991 rop = op_append_elem(OP_LIST, rop,
09bef843 1992 newSVOP(OP_CONST, o->op_flags,
b37c2d43 1993 SvREFCNT_inc_NN(cSVOPo->op_sv)));
09bef843
SB		 1994 }
1995 }
1996 return rop;
1997}
1998
1999STATIC void
95f0a2f1 2000S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
09bef843 2001{
27da23d5 2002 dVAR;
09bef843
SB		 2003 SV *stashsv;
2004
7918f24d
NC		 2005 PERL_ARGS_ASSERT_APPLY_ATTRS;
2006
09bef843
SB		 2007 /* fake up C<use attributes $pkg,$rv,@attrs> */
2008 ENTER; /* need to protect against side-effects of 'use' */
5aaec2b4 2009 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
e4783991 2010
09bef843 2011#define ATTRSMODULE "attributes"
95f0a2f1
SB		 2012#define ATTRSMODULE_PM "attributes.pm"
2013
2014 if (for_my) {
95f0a2f1 2015 /* Don't force the C<use> if we don't need it. */
a4fc7abc 2016 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
95f0a2f1 2017 if (svp && *svp != &PL_sv_undef)
6f207bd3 2018 NOOP; /* already in %INC */
95f0a2f1
SB		 2019 else
2020 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
6136c704 2021 newSVpvs(ATTRSMODULE), NULL);
95f0a2f1
SB		 2022 }
2023 else {
2024 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
6136c704
AL		 2025 newSVpvs(ATTRSMODULE),
2026 NULL,
2fcb4757 2027 op_prepend_elem(OP_LIST,
95f0a2f1 2028 newSVOP(OP_CONST, 0, stashsv),
2fcb4757 2029 op_prepend_elem(OP_LIST,
95f0a2f1
SB		 2030 newSVOP(OP_CONST, 0,
2031 newRV(target)),
2032 dup_attrlist(attrs))));
2033 }
09bef843
SB		 2034 LEAVE;
2035}
2036
95f0a2f1
SB		 2037STATIC void
2038S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2039{
97aff369 2040 dVAR;
95f0a2f1
SB		 2041 OP *pack, *imop, *arg;
2042 SV *meth, *stashsv;
2043
7918f24d
NC		 2044 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2045
95f0a2f1
SB		 2046 if (!attrs)
2047 return;
2048
2049 assert(target->op_type == OP_PADSV ||
2050 target->op_type == OP_PADHV ||
2051 target->op_type == OP_PADAV);
2052
2053 /* Ensure that attributes.pm is loaded. */
dd2155a4 2054 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
95f0a2f1
SB		 2055
2056 /* Need package name for method call. */
6136c704 2057 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
95f0a2f1
SB		 2058
2059 /* Build up the real arg-list. */
5aaec2b4
NC		 2060 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2061
95f0a2f1
SB		 2062 arg = newOP(OP_PADSV, 0);
2063 arg->op_targ = target->op_targ;
2fcb4757 2064 arg = op_prepend_elem(OP_LIST,
95f0a2f1 2065 newSVOP(OP_CONST, 0, stashsv),
2fcb4757 2066 op_prepend_elem(OP_LIST,
95f0a2f1 2067 newUNOP(OP_REFGEN, 0,
3ad73efd 2068 op_lvalue(arg, OP_REFGEN)),
95f0a2f1
SB		 2069 dup_attrlist(attrs)));
2070
2071 /* Fake up a method call to import */
18916d0d 2072 meth = newSVpvs_share("import");
95f0a2f1 2073 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2fcb4757
Z		 2074 op_append_elem(OP_LIST,
2075 op_prepend_elem(OP_LIST, pack, list(arg)),
95f0a2f1
SB		 2076 newSVOP(OP_METHOD_NAMED, 0, meth)));
2077 imop->op_private |= OPpENTERSUB_NOMOD;
2078
2079 /* Combine the ops. */
2fcb4757 2080 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
95f0a2f1
SB		 2081}
2082
2083/*
2084=notfor apidoc apply_attrs_string
2085
2086Attempts to apply a list of attributes specified by the C<attrstr> and
2087C<len> arguments to the subroutine identified by the C<cv> argument which
2088is expected to be associated with the package identified by the C<stashpv>
2089argument (see L<attributes>). It gets this wrong, though, in that it
2090does not correctly identify the boundaries of the individual attribute
2091specifications within C<attrstr>. This is not really intended for the
2092public API, but has to be listed here for systems such as AIX which
2093need an explicit export list for symbols. (It's called from XS code
2094in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2095to respect attribute syntax properly would be welcome.
2096
2097=cut
2098*/
2099
be3174d2 2100void
6867be6d
AL		 2101Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2102 const char *attrstr, STRLEN len)
be3174d2 2103{
5f66b61c 2104 OP *attrs = NULL;
be3174d2 2105
7918f24d
NC		 2106 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2107
be3174d2
GS		 2108 if (!len) {
2109 len = strlen(attrstr);
2110 }
2111
2112 while (len) {
2113 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2114 if (len) {
890ce7af 2115 const char * const sstr = attrstr;
be3174d2 2116 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2fcb4757 2117 attrs = op_append_elem(OP_LIST, attrs,
be3174d2
GS		 2118 newSVOP(OP_CONST, 0,
2119 newSVpvn(sstr, attrstr-sstr)));
2120 }
2121 }
2122
2123 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
6136c704 2124 newSVpvs(ATTRSMODULE),
2fcb4757 2125 NULL, op_prepend_elem(OP_LIST,
be3174d2 2126 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2fcb4757 2127 op_prepend_elem(OP_LIST,
be3174d2 2128 newSVOP(OP_CONST, 0,
ad64d0ec 2129 newRV(MUTABLE_SV(cv))),
be3174d2
GS		 2130 attrs)));
2131}
2132
09bef843 2133STATIC OP *
95f0a2f1 2134S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
93a17b20 2135{
97aff369 2136 dVAR;
93a17b20 2137 I32 type;
a1fba7eb 2138 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
93a17b20 2139
7918f24d
NC		 2140 PERL_ARGS_ASSERT_MY_KID;
2141
13765c85 2142 if (!o || (PL_parser && PL_parser->error_count))
11343788 2143 return o;
93a17b20 2144
bc61e325 2145 type = o->op_type;
eb8433b7
NC		 2146 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2147 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2148 return o;
2149 }
2150
93a17b20 2151 if (type == OP_LIST) {
6867be6d 2152 OP *kid;
11343788 2153 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
95f0a2f1 2154 my_kid(kid, attrs, imopsp);
eb8433b7
NC		 2155 } else if (type == OP_UNDEF
2156#ifdef PERL_MAD
2157 || type == OP_STUB
2158#endif
2159 ) {
7766148a 2160 return o;
77ca0c92
LW		 2161 } else if (type == OP_RV2SV || /* "our" declaration */
2162 type == OP_RV2AV ||
2163 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1ce0b88c 2164 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
fab01b8e 2165 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
952306ac 2166 OP_DESC(o),
12bd6ede
DM		 2167 PL_parser->in_my == KEY_our
2168 ? "our"
2169 : PL_parser->in_my == KEY_state ? "state" : "my"));
1ce0b88c 2170 } else if (attrs) {
551405c4 2171 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
12bd6ede
DM		 2172 PL_parser->in_my = FALSE;
2173 PL_parser->in_my_stash = NULL;
1ce0b88c
RGS		 2174 apply_attrs(GvSTASH(gv),
2175 (type == OP_RV2SV ? GvSV(gv) :
ad64d0ec
NC		 2176 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2177 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
1ce0b88c
RGS		 2178 attrs, FALSE);
2179 }
192587c2 2180 o->op_private |= OPpOUR_INTRO;
77ca0c92 2181 return o;
95f0a2f1
SB		 2182 }
2183 else if (type != OP_PADSV &&
93a17b20
LW		 2184 type != OP_PADAV &&
2185 type != OP_PADHV &&
2186 type != OP_PUSHMARK)
2187 {
eb64745e 2188 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
53e06cf0 2189 OP_DESC(o),
12bd6ede
DM		 2190 PL_parser->in_my == KEY_our
2191 ? "our"
2192 : PL_parser->in_my == KEY_state ? "state" : "my"));
11343788 2193 return o;
93a17b20 2194 }
09bef843
SB		 2195 else if (attrs && type != OP_PUSHMARK) {
2196 HV *stash;
09bef843 2197
12bd6ede
DM		 2198 PL_parser->in_my = FALSE;
2199 PL_parser->in_my_stash = NULL;
eb64745e 2200
09bef843 2201 /* check for C<my Dog $spot> when deciding package */
dd2155a4
DM		 2202 stash = PAD_COMPNAME_TYPE(o->op_targ);
2203 if (!stash)
09bef843 2204 stash = PL_curstash;
95f0a2f1 2205 apply_attrs_my(stash, o, attrs, imopsp);
09bef843 2206 }
11343788
MB		 2207 o->op_flags |= OPf_MOD;
2208 o->op_private |= OPpLVAL_INTRO;
a1fba7eb 2209 if (stately)
952306ac 2210 o->op_private |= OPpPAD_STATE;
11343788 2211 return o;
93a17b20
LW		 2212}
2213
2214OP *
09bef843
SB		 2215Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2216{
97aff369 2217 dVAR;
0bd48802 2218 OP *rops;
95f0a2f1
SB		 2219 int maybe_scalar = 0;
2220
7918f24d
NC		 2221 PERL_ARGS_ASSERT_MY_ATTRS;
2222
d2be0de5 2223/* [perl #17376]: this appears to be premature, and results in code such as
c754c3d7 2224 C< our(%x); > executing in list mode rather than void mode */
d2be0de5 2225#if 0
09bef843
SB		 2226 if (o->op_flags & OPf_PARENS)
2227 list(o);
95f0a2f1
SB		 2228 else
2229 maybe_scalar = 1;
d2be0de5
YST		 2230#else
2231 maybe_scalar = 1;
2232#endif
09bef843
SB		 2233 if (attrs)
2234 SAVEFREEOP(attrs);
5f66b61c 2235 rops = NULL;
95f0a2f1
SB		 2236 o = my_kid(o, attrs, &rops);
2237 if (rops) {
2238 if (maybe_scalar && o->op_type == OP_PADSV) {
2fcb4757 2239 o = scalar(op_append_list(OP_LIST, rops, o));
95f0a2f1
SB		 2240 o->op_private |= OPpLVAL_INTRO;
2241 }
2242 else
2fcb4757 2243 o = op_append_list(OP_LIST, o, rops);
95f0a2f1 2244 }
12bd6ede
DM		 2245 PL_parser->in_my = FALSE;
2246 PL_parser->in_my_stash = NULL;
eb64745e 2247 return o;
09bef843
SB		 2248}
2249
2250OP *
864dbfa3 2251Perl_sawparens(pTHX_ OP *o)
79072805 2252{
96a5add6 2253 PERL_UNUSED_CONTEXT;
79072805
LW		 2254 if (o)
2255 o->op_flags |= OPf_PARENS;
2256 return o;
2257}
2258
2259OP *
864dbfa3 2260Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
79072805 2261{
11343788 2262 OP *o;
59f00321 2263 bool ismatchop = 0;
1496a290
AL		 2264 const OPCODE ltype = left->op_type;
2265 const OPCODE rtype = right->op_type;
79072805 2266
7918f24d
NC		 2267 PERL_ARGS_ASSERT_BIND_MATCH;
2268
1496a290
AL		 2269 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2270 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
041457d9 2271 {
1496a290 2272 const char * const desc
bb16bae8
FC		 2273 = PL_op_desc[(
2274 rtype == OP_SUBST || rtype == OP_TRANS
2275 || rtype == OP_TRANSR
2276 )
666ea192
JH		 2277 ? (int)rtype : OP_MATCH];
2278 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
2279 ? "@array" : "%hash");
9014280d 2280 Perl_warner(aTHX_ packWARN(WARN_MISC),
1c846c1f 2281 "Applying %s to %s will act on scalar(%s)",
599cee73 2282 desc, sample, sample);
2ae324a7 2283 }
2284
1496a290 2285 if (rtype == OP_CONST &&
5cc9e5c9
RH		 2286 cSVOPx(right)->op_private & OPpCONST_BARE &&
2287 cSVOPx(right)->op_private & OPpCONST_STRICT)
2288 {
2289 no_bareword_allowed(right);
2290 }
2291
bb16bae8 2292 /* !~ doesn't make sense with /r, so error on it for now */
4f4d7508
DC		 2293 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2294 type == OP_NOT)
2295 yyerror("Using !~ with s///r doesn't make sense");
bb16bae8
FC		 2296 if (rtype == OP_TRANSR && type == OP_NOT)
2297 yyerror("Using !~ with tr///r doesn't make sense");
4f4d7508 2298
2474a784
FC		 2299 ismatchop = (rtype == OP_MATCH ||
2300 rtype == OP_SUBST ||
bb16bae8 2301 rtype == OP_TRANS || rtype == OP_TRANSR)
2474a784 2302 && !(right->op_flags & OPf_SPECIAL);
59f00321
RGS		 2303 if (ismatchop && right->op_private & OPpTARGET_MY) {
2304 right->op_targ = 0;
2305 right->op_private &= ~OPpTARGET_MY;
2306 }
2307 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
1496a290
AL		 2308 OP *newleft;
2309
79072805 2310 right->op_flags |= OPf_STACKED;
bb16bae8 2311 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
1496a290 2312 ! (rtype == OP_TRANS &&
4f4d7508
DC		 2313 right->op_private & OPpTRANS_IDENTICAL) &&
2314 ! (rtype == OP_SUBST &&
2315 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
3ad73efd 2316 newleft = op_lvalue(left, rtype);
1496a290
AL		 2317 else
2318 newleft = left;
bb16bae8 2319 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
1496a290 2320 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
79072805 2321 else
2fcb4757 2322 o = op_prepend_elem(rtype, scalar(newleft), right);
79072805 2323 if (type == OP_NOT)
11343788
MB		 2324 return newUNOP(OP_NOT, 0, scalar(o));
2325 return o;
79072805
LW		 2326 }
2327 else
2328 return bind_match(type, left,
131b3ad0 2329 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
79072805
LW		 2330}
2331
2332OP *
864dbfa3 2333Perl_invert(pTHX_ OP *o)
79072805 2334{
11343788 2335 if (!o)
1d866c12 2336 return NULL;
11343788 2337 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
79072805
LW		 2338}
2339
3ad73efd
Z		 2340/*
2341=for apidoc Amx|OP *|op_scope|OP *o
2342
2343Wraps up an op tree with some additional ops so that at runtime a dynamic
2344scope will be created. The original ops run in the new dynamic scope,
2345and then, provided that they exit normally, the scope will be unwound.
2346The additional ops used to create and unwind the dynamic scope will
2347normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2348instead if the ops are simple enough to not need the full dynamic scope
2349structure.
2350
2351=cut
2352*/
2353
79072805 2354OP *
3ad73efd 2355Perl_op_scope(pTHX_ OP *o)
79072805 2356{
27da23d5 2357 dVAR;
79072805 2358 if (o) {
3280af22 2359 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2fcb4757 2360 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
463ee0b2 2361 o->op_type = OP_LEAVE;
22c35a8c 2362 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
463ee0b2 2363 }
fdb22418
HS		 2364 else if (o->op_type == OP_LINESEQ) {
2365 OP *kid;
2366 o->op_type = OP_SCOPE;
2367 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2368 kid = ((LISTOP*)o)->op_first;
59110972 2369 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
fdb22418 2370 op_null(kid);
59110972
RH		 2371
2372 /* The following deals with things like 'do {1 for 1}' */
2373 kid = kid->op_sibling;
2374 if (kid &&
2375 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2376 op_null(kid);
2377 }
463ee0b2 2378 }
fdb22418 2379 else
5f66b61c 2380 o = newLISTOP(OP_SCOPE, 0, o, NULL);
79072805
LW		 2381 }
2382 return o;
2383}
1930840b 2384
a0d0e21e 2385int
864dbfa3 2386Perl_block_start(pTHX_ int full)
79072805 2387{
97aff369 2388 dVAR;
73d840c0 2389 const int retval = PL_savestack_ix;
1930840b 2390
dd2155a4 2391 pad_block_start(full);
b3ac6de7 2392 SAVEHINTS();
3280af22 2393 PL_hints &= ~HINT_BLOCK_SCOPE;
68da3b2f 2394 SAVECOMPILEWARNINGS();
72dc9ed5 2395 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
1930840b 2396
a88d97bf 2397 CALL_BLOCK_HOOKS(bhk_start, full);
1930840b 2398
a0d0e21e
LW		 2399 return retval;
2400}
2401
2402OP*
864dbfa3 2403Perl_block_end(pTHX_ I32 floor, OP *seq)
a0d0e21e 2404{
97aff369 2405 dVAR;
6867be6d 2406 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1930840b
BM		 2407 OP* retval = scalarseq(seq);
2408
a88d97bf 2409 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
1930840b 2410
e9818f4e 2411 LEAVE_SCOPE(floor);
623e6609 2412 CopHINTS_set(&PL_compiling, PL_hints);
a0d0e21e 2413 if (needblockscope)
3280af22 2414 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
dd2155a4 2415 pad_leavemy();
1930840b 2416
a88d97bf 2417 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
1930840b 2418
a0d0e21e
LW		 2419 return retval;
2420}
2421
fd85fad2
BM		 2422/*
2423=head1 Compile-time scope hooks
2424
3e4ddde5 2425=for apidoc Aox||blockhook_register
fd85fad2
BM		 2426
2427Register a set of hooks to be called when the Perl lexical scope changes
2428at compile time. See L<perlguts/"Compile-time scope hooks">.
2429
2430=cut
2431*/
2432
bb6c22e7
BM		 2433void
2434Perl_blockhook_register(pTHX_ BHK *hk)
2435{
2436 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2437
2438 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2439}
2440
76e3520e 2441STATIC OP *
cea2e8a9 2442S_newDEFSVOP(pTHX)
54b9620d 2443{
97aff369 2444 dVAR;
f8f98e0a 2445 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
00b1698f 2446 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
59f00321
RGS		 2447 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2448 }
2449 else {
551405c4 2450 OP * const o = newOP(OP_PADSV, 0);
59f00321
RGS		 2451 o->op_targ = offset;
2452 return o;
2453 }
54b9620d
MB		 2454}
2455
a0d0e21e 2456void
864dbfa3 2457Perl_newPROG(pTHX_ OP *o)
a0d0e21e 2458{
97aff369 2459 dVAR;
7918f24d
NC		 2460
2461 PERL_ARGS_ASSERT_NEWPROG;
2462
3280af22 2463 if (PL_in_eval) {
b295d113
TH		 2464 if (PL_eval_root)
2465 return;
faef0170
HS		 2466 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2467 ((PL_in_eval & EVAL_KEEPERR)
2468 ? OPf_SPECIAL : 0), o);
5983a79d
BM		 2469 /* don't use LINKLIST, since PL_eval_root might indirect through
2470 * a rather expensive function call and LINKLIST evaluates its
2471 * argument more than once */
2472 PL_eval_start = op_linklist(PL_eval_root);
7934575e
GS		 2473 PL_eval_root->op_private |= OPpREFCOUNTED;
2474 OpREFCNT_set(PL_eval_root, 1);
3280af22 2475 PL_eval_root->op_next = 0;
a2efc822 2476 CALL_PEEP(PL_eval_start);
a0d0e21e
LW		 2477 }
2478 else {
6be89cf9
AE		 2479 if (o->op_type == OP_STUB) {
2480 PL_comppad_name = 0;
2481 PL_compcv = 0;
d2c837a0 2482 S_op_destroy(aTHX_ o);
a0d0e21e 2483 return;
6be89cf9 2484 }
3ad73efd 2485 PL_main_root = op_scope(sawparens(scalarvoid(o)));
3280af22
NIS		 2486 PL_curcop = &PL_compiling;
2487 PL_main_start = LINKLIST(PL_main_root);
7934575e
GS		 2488 PL_main_root->op_private |= OPpREFCOUNTED;
2489 OpREFCNT_set(PL_main_root, 1);
3280af22 2490 PL_main_root->op_next = 0;
a2efc822 2491 CALL_PEEP(PL_main_start);
3280af22 2492 PL_compcv = 0;
3841441e 2493
4fdae800 2494 /* Register with debugger */
84902520 2495 if (PERLDB_INTER) {
b96d8cd9 2496 CV * const cv = get_cvs("DB::postponed", 0);
3841441e
CS		 2497 if (cv) {
2498 dSP;
924508f0 2499 PUSHMARK(SP);
ad64d0ec 2500 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3841441e 2501 PUTBACK;
ad64d0ec 2502 call_sv(MUTABLE_SV(cv), G_DISCARD);
3841441e
CS		 2503 }
2504 }
79072805 2505 }
79072805
LW		 2506}
2507
2508OP *
864dbfa3 2509Perl_localize(pTHX_ OP *o, I32 lex)
79072805 2510{
97aff369 2511 dVAR;
7918f24d
NC		 2512
2513 PERL_ARGS_ASSERT_LOCALIZE;
2514
79072805 2515 if (o->op_flags & OPf_PARENS)
d2be0de5
YST		 2516/* [perl #17376]: this appears to be premature, and results in code such as
2517 C< our(%x); > executing in list mode rather than void mode */
2518#if 0
79072805 2519 list(o);
d2be0de5 2520#else
6f207bd3 2521 NOOP;
d2be0de5 2522#endif
8990e307 2523 else {
f06b5848
DM		 2524 if ( PL_parser->bufptr > PL_parser->oldbufptr
2525 && PL_parser->bufptr[-1] == ','
041457d9 2526 && ckWARN(WARN_PARENTHESIS))
64420d0d 2527 {
f06b5848 2528 char *s = PL_parser->bufptr;
bac662ee 2529 bool sigil = FALSE;
64420d0d 2530
8473848f 2531 /* some heuristics to detect a potential error */
bac662ee 2532 while (*s && (strchr(", \t\n", *s)))
64420d0d 2533 s++;
8473848f 2534
bac662ee
TS		 2535 while (1) {
2536 if (*s && strchr("@$%*", *s) && *++s
2537 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2538 s++;
2539 sigil = TRUE;
2540 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2541 s++;
2542 while (*s && (strchr(", \t\n", *s)))
2543 s++;
2544 }
2545 else
2546 break;
2547 }
2548 if (sigil && (*s == ';' || *s == '=')) {
2549 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
8473848f 2550 "Parentheses missing around \"%s\" list",
12bd6ede
DM		 2551 lex
2552 ? (PL_parser->in_my == KEY_our
2553 ? "our"
2554 : PL_parser->in_my == KEY_state
2555 ? "state"
2556 : "my")
2557 : "local");
8473848f 2558 }
8990e307
LW		 2559 }
2560 }
93a17b20 2561 if (lex)
eb64745e 2562 o = my(o);
93a17b20 2563 else
3ad73efd 2564 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
12bd6ede
DM		 2565 PL_parser->in_my = FALSE;
2566 PL_parser->in_my_stash = NULL;
eb64745e 2567 return o;
79072805
LW		 2568}
2569
2570OP *
864dbfa3 2571Perl_jmaybe(pTHX_ OP *o)
79072805 2572{
7918f24d
NC		 2573 PERL_ARGS_ASSERT_JMAYBE;
2574
79072805 2575 if (o->op_type == OP_LIST) {
fafc274c 2576 OP * const o2
d4c19fe8 2577 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2fcb4757 2578 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
79072805
LW		 2579 }
2580 return o;
2581}
2582
1f676739 2583static OP *
b7783a12 2584S_fold_constants(pTHX_ register OP *o)
79072805 2585{
27da23d5 2586 dVAR;
001d637e 2587 register OP * VOL curop;
eb8433b7 2588 OP *newop;
8ea43dc8 2589 VOL I32 type = o->op_type;
e3cbe32f 2590 SV * VOL sv = NULL;
b7f7fd0b
NC		 2591 int ret = 0;
2592 I32 oldscope;
2593 OP *old_next;
5f2d9966
DM		 2594 SV * const oldwarnhook = PL_warnhook;
2595 SV * const olddiehook = PL_diehook;
c427f4d2 2596 COP not_compiling;
b7f7fd0b 2597 dJMPENV;
79072805 2598
7918f24d
NC		 2599 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2600
22c35a8c 2601 if (PL_opargs[type] & OA_RETSCALAR)
79072805 2602 scalar(o);
b162f9ea 2603 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
ed6116ce 2604 o->op_targ = pad_alloc(type, SVs_PADTMP);
79072805 2605
eac055e9
GS		 2606 /* integerize op, unless it happens to be C<-foo>.
2607 * XXX should pp_i_negate() do magic string negation instead? */
2608 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2609 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2610 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2611 {
22c35a8c 2612 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
eac055e9 2613 }
85e6fe83 2614
22c35a8c 2615 if (!(PL_opargs[type] & OA_FOLDCONST))
79072805
LW		 2616 goto nope;
2617
de939608 2618 switch (type) {
7a52d87a
GS		 2619 case OP_NEGATE:
2620 /* XXX might want a ck_negate() for this */
2621 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2622 break;
de939608
CS		 2623 case OP_UCFIRST:
2624 case OP_LCFIRST:
2625 case OP_UC:
2626 case OP_LC:
69dcf70c
MB		 2627 case OP_SLT:
2628 case OP_SGT:
2629 case OP_SLE:
2630 case OP_SGE:
2631 case OP_SCMP:
b3fd6149 2632 case OP_SPRINTF:
2de3dbcc
JH		 2633 /* XXX what about the numeric ops? */
2634 if (PL_hints & HINT_LOCALE)
de939608 2635 goto nope;
553e7bb0 2636 break;
de939608
CS		 2637 }
2638
13765c85 2639 if (PL_parser && PL_parser->error_count)
a0d0e21e
LW		 2640 goto nope; /* Don't try to run w/ errors */
2641
79072805 2642 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1496a290
AL		 2643 const OPCODE type = curop->op_type;
2644 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2645 type != OP_LIST &&
2646 type != OP_SCALAR &&
2647 type != OP_NULL &&
2648 type != OP_PUSHMARK)
7a52d87a 2649 {
79072805
LW		 2650 goto nope;
2651 }
2652 }
2653
2654 curop = LINKLIST(o);
b7f7fd0b 2655 old_next = o->op_next;
79072805 2656 o->op_next = 0;
533c011a 2657 PL_op = curop;
b7f7fd0b
NC		 2658
2659 oldscope = PL_scopestack_ix;
edb2152a 2660 create_eval_scope(G_FAKINGEVAL);
b7f7fd0b 2661
c427f4d2
NC		 2662 /* Verify that we don't need to save it: */
2663 assert(PL_curcop == &PL_compiling);
2664 StructCopy(&PL_compiling, &not_compiling, COP);
2665 PL_curcop = &not_compiling;
2666 /* The above ensures that we run with all the correct hints of the
2667 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
2668 assert(IN_PERL_RUNTIME);
5f2d9966
DM		 2669 PL_warnhook = PERL_WARNHOOK_FATAL;
2670 PL_diehook = NULL;
b7f7fd0b
NC		 2671 JMPENV_PUSH(ret);
2672
2673 switch (ret) {
2674 case 0:
2675 CALLRUNOPS(aTHX);
2676 sv = *(PL_stack_sp--);
523a0f0c
NC		 2677 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
2678#ifdef PERL_MAD
2679 /* Can't simply swipe the SV from the pad, because that relies on
2680 the op being freed "real soon now". Under MAD, this doesn't
2681 happen (see the #ifdef below). */
2682 sv = newSVsv(sv);
2683#else
b7f7fd0b 2684 pad_swipe(o->op_targ, FALSE);
523a0f0c
NC		 2685#endif
2686 }
b7f7fd0b
NC		 2687 else if (SvTEMP(sv)) { /* grab mortal temp? */
2688 SvREFCNT_inc_simple_void(sv);
2689 SvTEMP_off(sv);
2690 }
2691 break;
2692 case 3:
2693 /* Something tried to die. Abandon constant folding. */
2694 /* Pretend the error never happened. */
ab69dbc2 2695 CLEAR_ERRSV();
b7f7fd0b
NC		 2696 o->op_next = old_next;
2697 break;
2698 default:
2699 JMPENV_POP;
5f2d9966
DM		 2700 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
2701 PL_warnhook = oldwarnhook;
2702 PL_diehook = olddiehook;
2703 /* XXX note that this croak may fail as we've already blown away
2704 * the stack - eg any nested evals */
b7f7fd0b
NC		 2705 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
2706 }
b7f7fd0b 2707 JMPENV_POP;
5f2d9966
DM		 2708 PL_warnhook = oldwarnhook;
2709 PL_diehook = olddiehook;
c427f4d2 2710 PL_curcop = &PL_compiling;
edb2152a
NC		 2711
2712 if (PL_scopestack_ix > oldscope)
2713 delete_eval_scope();
eb8433b7 2714
b7f7fd0b
NC		 2715 if (ret)
2716 goto nope;
2717
eb8433b7 2718#ifndef PERL_MAD
79072805 2719 op_free(o);
eb8433b7 2720#endif
de5e01c2 2721 assert(sv);
79072805 2722 if (type == OP_RV2GV)
159b6efe 2723 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
eb8433b7 2724 else
ad64d0ec 2725 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
eb8433b7
NC		 2726 op_getmad(o,newop,'f');
2727 return newop;
aeea060c 2728
b7f7fd0b 2729 nope:
79072805
LW		 2730 return o;
2731}
2732
1f676739 2733static OP *
b7783a12 2734S_gen_constant_list(pTHX_ register OP *o)
79072805 2735{
27da23d5 2736 dVAR;
79072805 2737 register OP *curop;
6867be6d 2738 const I32 oldtmps_floor = PL_tmps_floor;
79072805 2739
a0d0e21e 2740 list(o);
13765c85 2741 if (PL_parser && PL_parser->error_count)
a0d0e21e
LW		 2742 return o; /* Don't attempt to run with errors */
2743
533c011a 2744 PL_op = curop = LINKLIST(o);
a0d0e21e 2745 o->op_next = 0;
a2efc822 2746 CALL_PEEP(curop);
897d3989 2747 Perl_pp_pushmark(aTHX);
cea2e8a9 2748 CALLRUNOPS(aTHX);
533c011a 2749 PL_op = curop;
78c72037
NC		 2750 assert (!(curop->op_flags & OPf_SPECIAL));
2751 assert(curop->op_type == OP_RANGE);
897d3989 2752 Perl_pp_anonlist(aTHX);
3280af22 2753 PL_tmps_floor = oldtmps_floor;
79072805
LW		 2754
2755 o->op_type = OP_RV2AV;
22c35a8c 2756 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
fb53bbb2
SG		 2757 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2758 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
1a0a2ba9 2759 o->op_opt = 0; /* needs to be revisited in rpeep() */
79072805 2760 curop = ((UNOP*)o)->op_first;
b37c2d43 2761 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
eb8433b7
NC		 2762#ifdef PERL_MAD
2763 op_getmad(curop,o,'O');
2764#else
79072805 2765 op_free(curop);
eb8433b7 2766#endif
5983a79d 2767 LINKLIST(o);
79072805
LW		 2768 return list(o);
2769}
2770
2771OP *
864dbfa3 2772Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
79072805 2773{
27da23d5 2774 dVAR;
11343788 2775 if (!o || o->op_type != OP_LIST)
5f66b61c 2776 o = newLISTOP(OP_LIST, 0, o, NULL);
748a9306 2777 else
5dc0d613 2778 o->op_flags &= ~OPf_WANT;
79072805 2779
22c35a8c 2780 if (!(PL_opargs[type] & OA_MARK))
93c66552 2781 op_null(cLISTOPo->op_first);
8990e307 2782
eb160463 2783 o->op_type = (OPCODE)type;
22c35a8c 2784 o->op_ppaddr = PL_ppaddr[type];
11343788 2785 o->op_flags |= flags;
79072805 2786
11343788 2787 o = CHECKOP(type, o);
fe2774ed 2788 if (o->op_type != (unsigned)type)
11343788 2789 return o;
79072805 2790
11343788 2791 return fold_constants(o);
79072805
LW		 2792}
2793
2fcb4757
Z		 2794/*
2795=head1 Optree Manipulation Functions
2796*/
2797
79072805
LW		 2798/* List constructors */
2799
2fcb4757
Z		 2800/*
2801=for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
2802
2803Append an item to the list of ops contained directly within a list-type
2804op, returning the lengthened list. I<first> is the list-type op,
2805and I<last> is the op to append to the list. I<optype> specifies the
2806intended opcode for the list. If I<first> is not already a list of the
2807right type, it will be upgraded into one. If either I<first> or I<last>
2808is null, the other is returned unchanged.
2809
2810=cut
2811*/
2812
79072805 2813OP *
2fcb4757 2814Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
79072805
LW		 2815{
2816 if (!first)
2817 return last;
8990e307
LW		 2818
2819 if (!last)
79072805 2820 return first;
8990e307 2821
fe2774ed 2822 if (first->op_type != (unsigned)type
155aba94
GS		 2823 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2824 {
2825 return newLISTOP(type, 0, first, last);
2826 }
79072805 2827
a0d0e21e
LW		 2828 if (first->op_flags & OPf_KIDS)
2829 ((LISTOP*)first)->op_last->op_sibling = last;
2830 else {
2831 first->op_flags |= OPf_KIDS;
2832 ((LISTOP*)first)->op_first = last;
2833 }
2834 ((LISTOP*)first)->op_last = last;
a0d0e21e 2835 return first;
79072805
LW		 2836}
2837
2fcb4757
Z		 2838/*
2839=for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
2840
2841Concatenate the lists of ops contained directly within two list-type ops,
2842returning the combined list. I<first> and I<last> are the list-type ops
2843to concatenate. I<optype> specifies the intended opcode for the list.
2844If either I<first> or I<last> is not already a list of the right type,
2845it will be upgraded into one. If either I<first> or I<last> is null,
2846the other is returned unchanged.
2847
2848=cut
2849*/
2850
79072805 2851OP *
2fcb4757 2852Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
79072805
LW		 2853{
2854 if (!first)
2fcb4757 2855 return last;
8990e307
LW		 2856
2857 if (!last)
2fcb4757 2858 return first;
8990e307 2859
fe2774ed 2860 if (first->op_type != (unsigned)type)
2fcb4757 2861 return op_prepend_elem(type, first, last);
8990e307 2862
fe2774ed 2863 if (last->op_type != (unsigned)type)
2fcb4757 2864 return op_append_elem(type, first, last);
79072805 2865
2fcb4757
Z		 2866 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
2867 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
117dada2 2868 first->op_flags |= (last->op_flags & OPf_KIDS);
1c846c1f 2869
eb8433b7 2870#ifdef PERL_MAD
2fcb4757
Z		 2871 if (((LISTOP*)last)->op_first && first->op_madprop) {
2872 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
eb8433b7
NC		 2873 if (mp) {
2874 while (mp->mad_next)
2875 mp = mp->mad_next;
2876 mp->mad_next = first->op_madprop;
2877 }
2878 else {
2fcb4757 2879 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
eb8433b7
NC		 2880 }
2881 }
2882 first->op_madprop = last->op_madprop;
2883 last->op_madprop = 0;
2884#endif
2885
2fcb4757 2886 S_op_destroy(aTHX_ last);
238a4c30 2887
2fcb4757 2888 return first;
79072805
LW		 2889}
2890
2fcb4757
Z		 2891/*
2892=for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
2893
2894Prepend an item to the list of ops contained directly within a list-type
2895op, returning the lengthened list. I<first> is the op to prepend to the
2896list, and I<last> is the list-type op. I<optype> specifies the intended
2897opcode for the list. If I<last> is not already a list of the right type,
2898it will be upgraded into one. If either I<first> or I<last> is null,
2899the other is returned unchanged.
2900
2901=cut
2902*/
2903
79072805 2904OP *
2fcb4757 2905Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
79072805
LW		 2906{
2907 if (!first)
2908 return last;
8990e307
LW		 2909
2910 if (!last)
79072805 2911 return first;
8990e307 2912
fe2774ed 2913 if (last->op_type == (unsigned)type) {
8990e307
LW		 2914 if (type == OP_LIST) { /* already a PUSHMARK there */
2915 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2916 ((LISTOP*)last)->op_first->op_sibling = first;
36a5d4ba
DC		 2917 if (!(first->op_flags & OPf_PARENS))
2918 last->op_flags &= ~OPf_PARENS;
8990e307
LW		 2919 }
2920 else {
2921 if (!(last->op_flags & OPf_KIDS)) {
2922 ((LISTOP*)last)->op_last = first;
2923 last->op_flags |= OPf_KIDS;
2924 }
2925 first->op_sibling = ((LISTOP*)last)->op_first;
2926 ((LISTOP*)last)->op_first = first;
79072805 2927 }
117dada2 2928 last->op_flags |= OPf_KIDS;
79072805
LW		 2929 return last;
2930 }
2931
2932 return newLISTOP(type, 0, first, last);
2933}
2934
2935/* Constructors */
2936
eb8433b7
NC		 2937#ifdef PERL_MAD
2938
2939TOKEN *
2940Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
2941{
2942 TOKEN *tk;
99129197 2943 Newxz(tk, 1, TOKEN);
eb8433b7
NC		 2944 tk->tk_type = (OPCODE)optype;
2945 tk->tk_type = 12345;
2946 tk->tk_lval = lval;
2947 tk->tk_mad = madprop;
2948 return tk;
2949}
2950
2951void
2952Perl_token_free(pTHX_ TOKEN* tk)
2953{
7918f24d
NC		 2954 PERL_ARGS_ASSERT_TOKEN_FREE;
2955
eb8433b7
NC		 2956 if (tk->tk_type != 12345)
2957 return;
2958 mad_free(tk->tk_mad);
2959 Safefree(tk);
2960}
2961
2962void
2963Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
2964{
2965 MADPROP* mp;
2966 MADPROP* tm;
7918f24d
NC		 2967
2968 PERL_ARGS_ASSERT_TOKEN_GETMAD;
2969
eb8433b7
NC		 2970 if (tk->tk_type != 12345) {
2971 Perl_warner(aTHX_ packWARN(WARN_MISC),
2972 "Invalid TOKEN object ignored");
2973 return;
2974 }
2975 tm = tk->tk_mad;
2976 if (!tm)
2977 return;
2978
2979 /* faked up qw list? */
2980 if (slot == '(' &&
2981 tm->mad_type == MAD_SV &&
d503a9ba 2982 SvPVX((SV *)tm->mad_val)[0] == 'q')
eb8433b7
NC		 2983 slot = 'x';
2984
2985 if (o) {
2986 mp = o->op_madprop;
2987 if (mp) {
2988 for (;;) {
2989 /* pretend constant fold didn't happen? */
2990 if (mp->mad_key == 'f' &&
2991 (o->op_type == OP_CONST ||
2992 o->op_type == OP_GV) )
2993 {
2994 token_getmad(tk,(OP*)mp->mad_val,slot);
2995 return;
2996 }
2997 if (!mp->mad_next)
2998 break;
2999 mp = mp->mad_next;
3000 }
3001 mp->mad_next = tm;
3002 mp = mp->mad_next;
3003 }
3004 else {
3005 o->op_madprop = tm;
3006 mp = o->op_madprop;
3007 }
3008 if (mp->mad_key == 'X')
3009 mp->mad_key = slot; /* just change the first one */
3010
3011 tk->tk_mad = 0;
3012 }
3013 else
3014 mad_free(tm);
3015 Safefree(tk);
3016}
3017
3018void
3019Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3020{
3021 MADPROP* mp;
3022 if (!from)
3023 return;
3024 if (o) {
3025 mp = o->op_madprop;
3026 if (mp) {
3027 for (;;) {
3028 /* pretend constant fold didn't happen? */
3029 if (mp->mad_key == 'f' &&
3030 (o->op_type == OP_CONST ||
3031 o->op_type == OP_GV) )
3032 {
3033 op_getmad(from,(OP*)mp->mad_val,slot);
3034 return;
3035 }
3036 if (!mp->mad_next)
3037 break;
3038 mp = mp->mad_next;
3039 }
3040 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3041 }
3042 else {
3043 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3044 }
3045 }
3046}
3047
3048void
3049Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3050{
3051 MADPROP* mp;
3052 if (!from)
3053 return;
3054 if (o) {
3055 mp = o->op_madprop;
3056 if (mp) {
3057 for (;;) {
3058 /* pretend constant fold didn't happen? */
3059 if (mp->mad_key == 'f' &&
3060 (o->op_type == OP_CONST ||
3061 o->op_type == OP_GV) )
3062 {
3063 op_getmad(from,(OP*)mp->mad_val,slot);
3064 return;
3065 }
3066 if (!mp->mad_next)
3067 break;
3068 mp = mp->mad_next;
3069 }
3070 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3071 }
3072 else {
3073 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3074 }
3075 }
3076 else {
99129197
NC		 3077 PerlIO_printf(PerlIO_stderr(),
3078 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
eb8433b7
NC		 3079 op_free(from);
3080 }
3081}
3082
3083void
3084Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3085{
3086 MADPROP* tm;
3087 if (!mp || !o)
3088 return;
3089 if (slot)
3090 mp->mad_key = slot;
3091 tm = o->op_madprop;
3092 o->op_madprop = mp;
3093 for (;;) {
3094 if (!mp->mad_next)
3095 break;
3096 mp = mp->mad_next;
3097 }
3098 mp->mad_next = tm;
3099}
3100
3101void
3102Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3103{
3104 if (!o)
3105 return;
3106 addmad(tm, &(o->op_madprop), slot);
3107}
3108
3109void
3110Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3111{
3112 MADPROP* mp;
3113 if (!tm || !root)
3114 return;
3115 if (slot)
3116 tm->mad_key = slot;
3117 mp = *root;
3118 if (!mp) {
3119 *root = tm;
3120 return;
3121 }
3122 for (;;) {
3123 if (!mp->mad_next)
3124 break;
3125 mp = mp->mad_next;
3126 }
3127 mp->mad_next = tm;
3128}
3129
3130MADPROP *
3131Perl_newMADsv(pTHX_ char key, SV* sv)
3132{
7918f24d
NC		 3133 PERL_ARGS_ASSERT_NEWMADSV;
3134
eb8433b7
NC		 3135 return newMADPROP(key, MAD_SV, sv, 0);
3136}
3137
3138MADPROP *
d503a9ba 3139Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
eb8433b7 3140{
c111d5f1 3141 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
eb8433b7
NC		 3142 mp->mad_next = 0;
3143 mp->mad_key = key;
3144 mp->mad_vlen = vlen;
3145 mp->mad_type = type;
3146 mp->mad_val = val;
3147/* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3148 return mp;
3149}
3150
3151void
3152Perl_mad_free(pTHX_ MADPROP* mp)
3153{
3154/* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3155 if (!mp)
3156 return;
3157 if (mp->mad_next)
3158 mad_free(mp->mad_next);
bc177e6b 3159/* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
eb8433b7
NC		 3160 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3161 switch (mp->mad_type) {
3162 case MAD_NULL:
3163 break;
3164 case MAD_PV:
3165 Safefree((char*)mp->mad_val);
3166 break;
3167 case MAD_OP:
3168 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3169 op_free((OP*)mp->mad_val);
3170 break;
3171 case MAD_SV:
ad64d0ec 3172 sv_free(MUTABLE_SV(mp->mad_val));
eb8433b7
NC		 3173 break;
3174 default:
3175 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3176 break;
3177 }
c111d5f1 3178 PerlMemShared_free(mp);
eb8433b7
NC		 3179}
3180
3181#endif
3182
d67eb5f4
Z		 3183/*
3184=head1 Optree construction
3185
3186=for apidoc Am|OP *|newNULLLIST
3187
3188Constructs, checks, and returns a new C<stub> op, which represents an
3189empty list expression.
3190
3191=cut
3192*/
3193
79072805 3194OP *
864dbfa3 3195Perl_newNULLLIST(pTHX)
79072805 3196{
8990e307
LW		 3197 return newOP(OP_STUB, 0);
3198}
3199
1f676739 3200static OP *
b7783a12 3201S_force_list(pTHX_ OP *o)
8990e307 3202{
11343788 3203 if (!o || o->op_type != OP_LIST)
5f66b61c 3204 o = newLISTOP(OP_LIST, 0, o, NULL);
93c66552 3205 op_null(o);
11343788 3206 return o;
79072805
LW		 3207}
3208
d67eb5f4
Z		 3209/*
3210=for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3211
3212Constructs, checks, and returns an op of any list type. I<type> is
3213the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3214C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3215supply up to two ops to be direct children of the list op; they are
3216consumed by this function and become part of the constructed op tree.
3217
3218=cut
3219*/
3220
79072805 3221OP *
864dbfa3 3222Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
79072805 3223{
27da23d5 3224 dVAR;
79072805
LW		 3225 LISTOP *listop;
3226
e69777c1
GG		 3227 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3228
b7dc083c 3229 NewOp(1101, listop, 1, LISTOP);
79072805 3230
eb160463 3231 listop->op_type = (OPCODE)type;
22c35a8c 3232 listop->op_ppaddr = PL_ppaddr[type];
117dada2
SM		 3233 if (first || last)
3234 flags |= OPf_KIDS;
eb160463 3235 listop->op_flags = (U8)flags;
79072805
LW		 3236
3237 if (!last && first)
3238 last = first;
3239 else if (!first && last)
3240 first = last;
8990e307
LW		 3241 else if (first)
3242 first->op_sibling = last;
79072805
LW		 3243 listop->op_first = first;
3244 listop->op_last = last;
8990e307 3245 if (type == OP_LIST) {
551405c4 3246 OP* const pushop = newOP(OP_PUSHMARK, 0);
8990e307
LW		 3247 pushop->op_sibling = first;
3248 listop->op_first = pushop;
3249 listop->op_flags |= OPf_KIDS;
3250 if (!last)
3251 listop->op_last = pushop;
3252 }
79072805 3253
463d09e6 3254 return CHECKOP(type, listop);
79072805
LW		 3255}
3256
d67eb5f4
Z		 3257/*
3258=for apidoc Am|OP *|newOP|I32 type|I32 flags
3259
3260Constructs, checks, and returns an op of any base type (any type that
3261has no extra fields). I<type> is the opcode. I<flags> gives the
3262eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3263of C<op_private>.
3264
3265=cut
3266*/
3267
79072805 3268OP *
864dbfa3 3269Perl_newOP(pTHX_ I32 type, I32 flags)
79072805 3270{
27da23d5 3271 dVAR;
11343788 3272 OP *o;
e69777c1
GG		 3273
3274 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3275 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3276 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3277 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3278
b7dc083c 3279 NewOp(1101, o, 1, OP);
eb160463 3280 o->op_type = (OPCODE)type;
22c35a8c 3281 o->op_ppaddr = PL_ppaddr[type];
eb160463 3282 o->op_flags = (U8)flags;
670f3923
DM		 3283 o->op_latefree = 0;
3284 o->op_latefreed = 0;
7e5d8ed2 3285 o->op_attached = 0;
79072805 3286
11343788 3287 o->op_next = o;
eb160463 3288 o->op_private = (U8)(0 | (flags >> 8));
22c35a8c 3289 if (PL_opargs[type] & OA_RETSCALAR)
11343788 3290 scalar(o);
22c35a8c 3291 if (PL_opargs[type] & OA_TARGET)
11343788
MB		 3292 o->op_targ = pad_alloc(type, SVs_PADTMP);
3293 return CHECKOP(type, o);
79072805
LW		 3294}
3295
d67eb5f4
Z		 3296/*
3297=for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3298
3299Constructs, checks, and returns an op of any unary type. I<type> is
3300the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3301C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3302bits, the eight bits of C<op_private>, except that the bit with value 1
3303is automatically set. I<first> supplies an optional op to be the direct
3304child of the unary op; it is consumed by this function and become part
3305of the constructed op tree.
3306
3307=cut
3308*/
3309
79072805 3310OP *
864dbfa3 3311Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
79072805 3312{
27da23d5 3313 dVAR;
79072805
LW		 3314 UNOP *unop;
3315
e69777c1
GG		 3316 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3317 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3318 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3319 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3320 || type == OP_SASSIGN
32e2a35d 3321 || type == OP_ENTERTRY
e69777c1
GG		 3322 || type == OP_NULL );
3323
93a17b20 3324 if (!first)
aeea060c 3325 first = newOP(OP_STUB, 0);
22c35a8c 3326 if (PL_opargs[type] & OA_MARK)
8990e307 3327 first = force_list(first);
93a17b20 3328
b7dc083c 3329 NewOp(1101, unop, 1, UNOP);
eb160463 3330 unop->op_type = (OPCODE)type;
22c35a8c 3331 unop->op_ppaddr = PL_ppaddr[type];
79072805 3332 unop->op_first = first;
585ec06d 3333 unop->op_flags = (U8)(flags | OPf_KIDS);
eb160463 3334 unop->op_private = (U8)(1 | (flags >> 8));
e50aee73 3335 unop = (UNOP*) CHECKOP(type, unop);
79072805
LW		 3336 if (unop->op_next)
3337 return (OP*)unop;
3338
a0d0e21e 3339 return fold_constants((OP *) unop);
79072805
LW		 3340}
3341
d67eb5f4
Z		 3342/*
3343=for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3344
3345Constructs, checks, and returns an op of any binary type. I<type>
3346is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3347that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3348the eight bits of C<op_private>, except that the bit with value 1 or
33492 is automatically set as required. I<first> and I<last> supply up to
3350two ops to be the direct children of the binary op; they are consumed
3351by this function and become part of the constructed op tree.
3352
3353=cut
3354*/
3355
79072805 3356OP *
864dbfa3 3357Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
79072805 3358{
27da23d5 3359 dVAR;
79072805 3360 BINOP *binop;
e69777c1
GG		 3361
3362 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3363 || type == OP_SASSIGN || type == OP_NULL );
3364
b7dc083c 3365 NewOp(1101, binop, 1, BINOP);
79072805
LW		 3366
3367 if (!first)
3368 first = newOP(OP_NULL, 0);
3369
eb160463 3370 binop->op_type = (OPCODE)type;
22c35a8c 3371 binop->op_ppaddr = PL_ppaddr[type];
79072805 3372 binop->op_first = first;
585ec06d 3373 binop->op_flags = (U8)(flags | OPf_KIDS);
79072805
LW		 3374 if (!last) {
3375 last = first;
eb160463 3376 binop->op_private = (U8)(1 | (flags >> 8));
79072805
LW		 3377 }
3378 else {
eb160463 3379 binop->op_private = (U8)(2 | (flags >> 8));
79072805
LW		 3380 first->op_sibling = last;
3381 }
3382
e50aee73 3383 binop = (BINOP*)CHECKOP(type, binop);
eb160463 3384 if (binop->op_next || binop->op_type != (OPCODE)type)
79072805
LW		 3385 return (OP*)binop;
3386
7284ab6f 3387 binop->op_last = binop->op_first->op_sibling;
79072805 3388
a0d0e21e 3389 return fold_constants((OP *)binop);
79072805
LW		 3390}
3391
5f66b61c
AL		 3392static int uvcompare(const void *a, const void *b)
3393 __attribute__nonnull__(1)
3394 __attribute__nonnull__(2)
3395 __attribute__pure__;
abb2c242 3396static int uvcompare(const void *a, const void *b)
2b9d42f0 3397{
e1ec3a88 3398 if (*((const UV *)a) < (*(const UV *)b))
2b9d42f0 3399 return -1;
e1ec3a88 3400 if (*((const UV *)a) > (*(const UV *)b))
2b9d42f0 3401 return 1;
e1ec3a88 3402 if (*((const UV *)a+1) < (*(const UV *)b+1))
2b9d42f0 3403 return -1;
e1ec3a88 3404 if (*((const UV *)a+1) > (*(const UV *)b+1))
2b9d42f0 3405 return 1;
a0ed51b3
LW		 3406 return 0;
3407}
3408
0d86688d
NC		 3409static OP *
3410S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
79072805 3411{
97aff369 3412 dVAR;
2d03de9c 3413 SV * const tstr = ((SVOP*)expr)->op_sv;
fbbb0949
DM		 3414 SV * const rstr =
3415#ifdef PERL_MAD
3416 (repl->op_type == OP_NULL)
3417 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3418#endif
3419 ((SVOP*)repl)->op_sv;
463ee0b2
LW		 3420 STRLEN tlen;
3421 STRLEN rlen;
5c144d81
NC		 3422 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3423 const U8 *r = (U8*)SvPV_const(rstr, rlen);
79072805
LW		 3424 register I32 i;
3425 register I32 j;
9b877dbb 3426 I32 grows = 0;
79072805
LW		 3427 register short *tbl;
3428
551405c4
AL		 3429 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3430 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3431 I32 del = o->op_private & OPpTRANS_DELETE;
043e41b8 3432 SV* swash;
7918f24d
NC		 3433
3434 PERL_ARGS_ASSERT_PMTRANS;
3435
800b4dc4 3436 PL_hints |= HINT_BLOCK_SCOPE;
1c846c1f 3437
036b4402
GS		 3438 if (SvUTF8(tstr))
3439 o->op_private |= OPpTRANS_FROM_UTF;
1c846c1f
NIS		 3440
3441 if (SvUTF8(rstr))
036b4402 3442 o->op_private |= OPpTRANS_TO_UTF;
79072805 3443
a0ed51b3 3444 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
396482e1 3445 SV* const listsv = newSVpvs("# comment\n");
c445ea15 3446 SV* transv = NULL;
5c144d81
NC		 3447 const U8* tend = t + tlen;
3448 const U8* rend = r + rlen;
ba210ebe 3449 STRLEN ulen;
84c133a0
RB		 3450 UV tfirst = 1;
3451 UV tlast = 0;
3452 IV tdiff;
3453 UV rfirst = 1;
3454 UV rlast = 0;
3455 IV rdiff;
3456 IV diff;
a0ed51b3
LW		 3457 I32 none = 0;
3458 U32 max = 0;
3459 I32 bits;
a0ed51b3 3460 I32 havefinal = 0;
9c5ffd7c 3461 U32 final = 0;
551405c4
AL		 3462 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3463 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
bf4a1e57
JH		 3464 U8* tsave = NULL;
3465 U8* rsave = NULL;
9f7f3913 3466 const U32 flags = UTF8_ALLOW_DEFAULT;
bf4a1e57
JH		 3467
3468 if (!from_utf) {
3469 STRLEN len = tlen;
5c144d81 3470 t = tsave = bytes_to_utf8(t, &len);
bf4a1e57
JH		 3471 tend = t + len;
3472 }
3473 if (!to_utf && rlen) {
3474 STRLEN len = rlen;
5c144d81 3475 r = rsave = bytes_to_utf8(r, &len);
bf4a1e57
JH		 3476 rend = r + len;
3477 }
a0ed51b3 3478
2b9d42f0
NIS		 3479/* There are several snags with this code on EBCDIC:
3480 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3481 2. scan_const() in toke.c has encoded chars in native encoding which makes
3482 ranges at least in EBCDIC 0..255 range the bottom odd.
3483*/
3484
a0ed51b3 3485 if (complement) {
89ebb4a3 3486 U8 tmpbuf[UTF8_MAXBYTES+1];
2b9d42f0 3487 UV *cp;
a0ed51b3 3488 UV nextmin = 0;
a02a5408 3489 Newx(cp, 2*tlen, UV);
a0ed51b3 3490 i = 0;
396482e1 3491 transv = newSVpvs("");
a0ed51b3 3492 while (t < tend) {
9f7f3913 3493 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
2b9d42f0
NIS		 3494 t += ulen;
3495 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
a0ed51b3 3496 t++;
9f7f3913 3497 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
2b9d42f0 3498 t += ulen;
a0ed51b3 3499 }
2b9d42f0
NIS		 3500 else {
3501 cp[2*i+1] = cp[2*i];
3502 }
3503 i++;
a0ed51b3 3504 }
2b9d42f0 3505 qsort(cp, i, 2*sizeof(UV), uvcompare);
a0ed51b3 3506 for (j = 0; j < i; j++) {
2b9d42f0 3507 UV val = cp[2*j];
a0ed51b3
LW		 3508 diff = val - nextmin;
3509 if (diff > 0) {
9041c2e3 3510 t = uvuni_to_utf8(tmpbuf,nextmin);
dfe13c55 3511 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
a0ed51b3 3512 if (diff > 1) {
2b9d42f0 3513 U8 range_mark = UTF_TO_NATIVE(0xff);
9041c2e3 3514 t = uvuni_to_utf8(tmpbuf, val - 1);
2b9d42f0 3515 sv_catpvn(transv, (char *)&range_mark, 1);
dfe13c55 3516 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
a0ed51b3
LW		 3517 }
3518 }
2b9d42f0 3519 val = cp[2*j+1];
a0ed51b3
LW		 3520 if (val >= nextmin)
3521 nextmin = val + 1;
3522 }
9041c2e3 3523 t = uvuni_to_utf8(tmpbuf,nextmin);
dfe13c55 3524 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2b9d42f0
NIS		 3525 {
3526 U8 range_mark = UTF_TO_NATIVE(0xff);
3527 sv_catpvn(transv, (char *)&range_mark, 1);
3528 }
6247ead0 3529 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
dfe13c55 3530 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
93524f2b 3531 t = (const U8*)SvPVX_const(transv);
a0ed51b3
LW		 3532 tlen = SvCUR(transv);
3533 tend = t + tlen;
455d824a 3534 Safefree(cp);
a0ed51b3
LW		 3535 }
3536 else if (!rlen && !del) {
3537 r = t; rlen = tlen; rend = tend;
4757a243
LW		 3538 }
3539 if (!squash) {
05d340b8 3540 if ((!rlen && !del) || t == r ||
12ae5dfc 3541 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
01ec43d0 3542 {
4757a243 3543 o->op_private |= OPpTRANS_IDENTICAL;
01ec43d0 3544 }
a0ed51b3
LW		 3545 }
3546
3547 while (t < tend || tfirst <= tlast) {
3548 /* see if we need more "t" chars */
3549 if (tfirst > tlast) {
9f7f3913 3550 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
a0ed51b3 3551 t += ulen;
2b9d42f0 3552 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
ba210ebe 3553 t++;
9f7f3913 3554 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
a0ed51b3
LW		 3555 t += ulen;
3556 }
3557 else
3558 tlast = tfirst;
3559 }
3560
3561 /* now see if we need more "r" chars */
3562 if (rfirst > rlast) {
3563 if (r < rend) {
9f7f3913 3564 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
a0ed51b3 3565 r += ulen;
2b9d42f0 3566 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
ba210ebe 3567 r++;
9f7f3913 3568 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
a0ed51b3
LW		 3569 r += ulen;
3570 }
3571 else
3572 rlast = rfirst;
3573 }