This is a live mirror of the Perl 5 development currently hosted at https://github.com/perl/perl5
[perl #90888] each(ARRAY) on scalar context should wrapped into defined()
[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
PP
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
PP
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
PP
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
NC
1571 /* grep, foreach, subcalls, refgen */
1572 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
a0d0e21e 1573 break;
cea2e8a9 1574 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
638bc118 1575 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
cd06dffe
GS
1576 ? "do block"
1577 : (o->op_type == OP_ENTERSUB
1578 ? "non-lvalue subroutine call"
53e06cf0 1579 : OP_DESC(o))),
22c35a8c 1580 type ? PL_op_desc[type] : "local"));
11343788 1581 return o;
79072805 1582
a0d0e21e
LW
1583 case OP_PREINC:
1584 case OP_PREDEC:
1585 case OP_POW:
1586 case OP_MULTIPLY:
1587 case OP_DIVIDE:
1588 case OP_MODULO:
1589 case OP_REPEAT:
1590 case OP_ADD:
1591 case OP_SUBTRACT:
1592 case OP_CONCAT:
1593 case OP_LEFT_SHIFT:
1594 case OP_RIGHT_SHIFT:
1595 case OP_BIT_AND:
1596 case OP_BIT_XOR:
1597 case OP_BIT_OR:
1598 case OP_I_MULTIPLY:
1599 case OP_I_DIVIDE:
1600 case OP_I_MODULO:
1601 case OP_I_ADD:
1602 case OP_I_SUBTRACT:
11343788 1603 if (!(o->op_flags & OPf_STACKED))
a0d0e21e 1604 goto nomod;
3280af22 1605 PL_modcount++;
a0d0e21e 1606 break;
b2ffa427 1607
79072805 1608 case OP_COND_EXPR:
ddeae0f1 1609 localize = 1;
11343788 1610 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
3ad73efd 1611 op_lvalue(kid, type);
79072805
LW
1612 break;
1613
1614 case OP_RV2AV:
1615 case OP_RV2HV:
11343788 1616 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
e6438c1a 1617 PL_modcount = RETURN_UNLIMITED_NUMBER;
11343788 1618 return o; /* Treat \(@foo) like ordinary list. */
748a9306
LW
1619 }
1620 /* FALL THROUGH */
79072805 1621 case OP_RV2GV:
5dc0d613 1622 if (scalar_mod_type(o, type))
3fe9a6f1 1623 goto nomod;
11343788 1624 ref(cUNOPo->op_first, o->op_type);
79072805 1625 /* FALL THROUGH */
79072805
LW
1626 case OP_ASLICE:
1627 case OP_HSLICE:
78f9721b
SM
1628 if (type == OP_LEAVESUBLV)
1629 o->op_private |= OPpMAYBE_LVSUB;
ddeae0f1 1630 localize = 1;
78f9721b
SM
1631 /* FALL THROUGH */
1632 case OP_AASSIGN:
93a17b20
LW
1633 case OP_NEXTSTATE:
1634 case OP_DBSTATE:
e6438c1a 1635 PL_modcount = RETURN_UNLIMITED_NUMBER;
79072805 1636 break;
28c5b5bc
RGS
1637 case OP_AV2ARYLEN:
1638 PL_hints |= HINT_BLOCK_SCOPE;
1639 if (type == OP_LEAVESUBLV)
1640 o->op_private |= OPpMAYBE_LVSUB;
1641 PL_modcount++;
1642 break;
463ee0b2 1643 case OP_RV2SV:
aeea060c 1644 ref(cUNOPo->op_first, o->op_type);
ddeae0f1 1645 localize = 1;
463ee0b2 1646 /* FALL THROUGH */
79072805 1647 case OP_GV:
3280af22 1648 PL_hints |= HINT_BLOCK_SCOPE;
463ee0b2 1649 case OP_SASSIGN:
bf4b1e52
GS
1650 case OP_ANDASSIGN:
1651 case OP_ORASSIGN:
c963b151 1652 case OP_DORASSIGN:
ddeae0f1
DM
1653 PL_modcount++;
1654 break;
1655
8990e307 1656 case OP_AELEMFAST:
6a077020 1657 localize = -1;
3280af22 1658 PL_modcount++;
8990e307
LW
1659 break;
1660
748a9306
LW
1661 case OP_PADAV:
1662 case OP_PADHV:
e6438c1a 1663 PL_modcount = RETURN_UNLIMITED_NUMBER;
5196be3e
MB
1664 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1665 return o; /* Treat \(@foo) like ordinary list. */
1666 if (scalar_mod_type(o, type))
3fe9a6f1 1667 goto nomod;
78f9721b
SM
1668 if (type == OP_LEAVESUBLV)
1669 o->op_private |= OPpMAYBE_LVSUB;
748a9306
LW
1670 /* FALL THROUGH */
1671 case OP_PADSV:
3280af22 1672 PL_modcount++;
ddeae0f1 1673 if (!type) /* local() */
cea2e8a9 1674 Perl_croak(aTHX_ "Can't localize lexical variable %s",
dd2155a4 1675 PAD_COMPNAME_PV(o->op_targ));
463ee0b2
LW
1676 break;
1677
748a9306 1678 case OP_PUSHMARK:
ddeae0f1 1679 localize = 0;
748a9306 1680 break;
b2ffa427 1681
69969c6f 1682 case OP_KEYS:
d8065907 1683 case OP_RKEYS:
69969c6f
SB
1684 if (type != OP_SASSIGN)
1685 goto nomod;
5d82c453
GA
1686 goto lvalue_func;
1687 case OP_SUBSTR:
1688 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1689 goto nomod;
5f05dabc 1690 /* FALL THROUGH */
a0d0e21e 1691 case OP_POS:
463ee0b2 1692 case OP_VEC:
78f9721b
SM
1693 if (type == OP_LEAVESUBLV)
1694 o->op_private |= OPpMAYBE_LVSUB;
5d82c453 1695 lvalue_func:
11343788
MB
1696 pad_free(o->op_targ);
1697 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
5dc0d613 1698 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
11343788 1699 if (o->op_flags & OPf_KIDS)
3ad73efd 1700 op_lvalue(cBINOPo->op_first->op_sibling, type);
463ee0b2 1701 break;
a0d0e21e 1702
463ee0b2
LW
1703 case OP_AELEM:
1704 case OP_HELEM:
11343788 1705 ref(cBINOPo->op_first, o->op_type);
68dc0745 1706 if (type == OP_ENTERSUB &&
5dc0d613
MB
1707 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1708 o->op_private |= OPpLVAL_DEFER;
78f9721b
SM
1709 if (type == OP_LEAVESUBLV)
1710 o->op_private |= OPpMAYBE_LVSUB;
ddeae0f1 1711 localize = 1;
3280af22 1712 PL_modcount++;
463ee0b2
LW
1713 break;
1714
1715 case OP_SCOPE:
1716 case OP_LEAVE:
1717 case OP_ENTER:
78f9721b 1718 case OP_LINESEQ:
ddeae0f1 1719 localize = 0;
11343788 1720 if (o->op_flags & OPf_KIDS)
3ad73efd 1721 op_lvalue(cLISTOPo->op_last, type);
a0d0e21e
LW
1722 break;
1723
1724 case OP_NULL:
ddeae0f1 1725 localize = 0;
638bc118
GS
1726 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1727 goto nomod;
1728 else if (!(o->op_flags & OPf_KIDS))
463ee0b2 1729 break;
11343788 1730 if (o->op_targ != OP_LIST) {
3ad73efd 1731 op_lvalue(cBINOPo->op_first, type);
a0d0e21e
LW
1732 break;
1733 }
1734 /* FALL THROUGH */
463ee0b2 1735 case OP_LIST:
ddeae0f1 1736 localize = 0;
11343788 1737 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
3ad73efd 1738 op_lvalue(kid, type);
463ee0b2 1739 break;
78f9721b
SM
1740
1741 case OP_RETURN:
1742 if (type != OP_LEAVESUBLV)
1743 goto nomod;
3ad73efd 1744 break; /* op_lvalue()ing was handled by ck_return() */
463ee0b2 1745 }
58d95175 1746
8be1be90
AMS
1747 /* [20011101.069] File test operators interpret OPf_REF to mean that
1748 their argument is a filehandle; thus \stat(".") should not set
1749 it. AMS 20011102 */
1750 if (type == OP_REFGEN &&
ef69c8fc 1751 PL_check[o->op_type] == Perl_ck_ftst)
8be1be90
AMS
1752 return o;
1753
1754 if (type != OP_LEAVESUBLV)
1755 o->op_flags |= OPf_MOD;
1756
1757 if (type == OP_AASSIGN || type == OP_SASSIGN)
1758 o->op_flags |= OPf_SPECIAL|OPf_REF;
ddeae0f1
DM
1759 else if (!type) { /* local() */
1760 switch (localize) {
1761 case 1:
1762 o->op_private |= OPpLVAL_INTRO;
1763 o->op_flags &= ~OPf_SPECIAL;
1764 PL_hints |= HINT_BLOCK_SCOPE;
1765 break;
1766 case 0:
1767 break;
1768 case -1:
a2a5de95
NC
1769 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
1770 "Useless localization of %s", OP_DESC(o));
ddeae0f1 1771 }
463ee0b2 1772 }
8be1be90
AMS
1773 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1774 && type != OP_LEAVESUBLV)
1775 o->op_flags |= OPf_REF;
11343788 1776 return o;
463ee0b2
LW
1777}
1778
8b47453d
FC
1779/* Do not use this. It will be removed after 5.14. */
1780OP *
1781Perl_mod(pTHX_ OP *o, I32 type)
1782{
1783 return op_lvalue(o,type);
1784}
1785
1786
864dbfa3 1787STATIC bool
5f66b61c 1788S_scalar_mod_type(const OP *o, I32 type)
3fe9a6f1 1789{
7918f24d
NC
1790 PERL_ARGS_ASSERT_SCALAR_MOD_TYPE;
1791
3fe9a6f1
PP
1792 switch (type) {
1793 case OP_SASSIGN:
5196be3e 1794 if (o->op_type == OP_RV2GV)
3fe9a6f1
PP
1795 return FALSE;
1796 /* FALL THROUGH */
1797 case OP_PREINC:
1798 case OP_PREDEC:
1799 case OP_POSTINC:
1800 case OP_POSTDEC:
1801 case OP_I_PREINC:
1802 case OP_I_PREDEC:
1803 case OP_I_POSTINC:
1804 case OP_I_POSTDEC:
1805 case OP_POW:
1806 case OP_MULTIPLY:
1807 case OP_DIVIDE:
1808 case OP_MODULO:
1809 case OP_REPEAT:
1810 case OP_ADD:
1811 case OP_SUBTRACT:
1812 case OP_I_MULTIPLY:
1813 case OP_I_DIVIDE:
1814 case OP_I_MODULO:
1815 case OP_I_ADD:
1816 case OP_I_SUBTRACT:
1817 case OP_LEFT_SHIFT:
1818 case OP_RIGHT_SHIFT:
1819 case OP_BIT_AND:
1820 case OP_BIT_XOR:
1821 case OP_BIT_OR:
1822 case OP_CONCAT:
1823 case OP_SUBST:
1824 case OP_TRANS:
bb16bae8 1825 case OP_TRANSR:
49e9fbe6
GS
1826 case OP_READ:
1827 case OP_SYSREAD:
1828 case OP_RECV:
bf4b1e52
GS
1829 case OP_ANDASSIGN:
1830 case OP_ORASSIGN:
410d09fe 1831 case OP_DORASSIGN:
3fe9a6f1
PP
1832 return TRUE;
1833 default:
1834 return FALSE;
1835 }
1836}
1837
35cd451c 1838STATIC bool
5f66b61c 1839S_is_handle_constructor(const OP *o, I32 numargs)
35cd451c 1840{
7918f24d
NC
1841 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
1842
35cd451c
GS
1843 switch (o->op_type) {
1844 case OP_PIPE_OP:
1845 case OP_SOCKPAIR:
504618e9 1846 if (numargs == 2)
35cd451c
GS
1847 return TRUE;
1848 /* FALL THROUGH */
1849 case OP_SYSOPEN:
1850 case OP_OPEN:
ded8aa31 1851 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
35cd451c
GS
1852 case OP_SOCKET:
1853 case OP_OPEN_DIR:
1854 case OP_ACCEPT:
504618e9 1855 if (numargs == 1)
35cd451c 1856 return TRUE;
5f66b61c 1857 /* FALLTHROUGH */
35cd451c
GS
1858 default:
1859 return FALSE;
1860 }
1861}
1862
0d86688d
NC
1863static OP *
1864S_refkids(pTHX_ OP *o, I32 type)
463ee0b2 1865{
11343788 1866 if (o && o->op_flags & OPf_KIDS) {
6867be6d 1867 OP *kid;
11343788 1868 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
463ee0b2
LW
1869 ref(kid, type);
1870 }
11343788 1871 return o;
463ee0b2
LW
1872}
1873
1874OP *
e4c5ccf3 1875Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
463ee0b2 1876{
27da23d5 1877 dVAR;
463ee0b2 1878 OP *kid;
463ee0b2 1879
7918f24d
NC
1880 PERL_ARGS_ASSERT_DOREF;
1881
13765c85 1882 if (!o || (PL_parser && PL_parser->error_count))
11343788 1883 return o;
463ee0b2 1884
11343788 1885 switch (o->op_type) {
a0d0e21e 1886 case OP_ENTERSUB:
afebc493 1887 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
11343788
MB
1888 !(o->op_flags & OPf_STACKED)) {
1889 o->op_type = OP_RV2CV; /* entersub => rv2cv */
22c35a8c 1890 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
11343788 1891 assert(cUNOPo->op_first->op_type == OP_NULL);
93c66552 1892 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
11343788 1893 o->op_flags |= OPf_SPECIAL;
e26df76a 1894 o->op_private &= ~1;
8990e307
LW
1895 }
1896 break;
aeea060c 1897
463ee0b2 1898 case OP_COND_EXPR:
11343788 1899 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
e4c5ccf3 1900 doref(kid, type, set_op_ref);
463ee0b2 1901 break;
8990e307 1902 case OP_RV2SV:
35cd451c
GS
1903 if (type == OP_DEFINED)
1904 o->op_flags |= OPf_SPECIAL; /* don't create GV */
e4c5ccf3 1905 doref(cUNOPo->op_first, o->op_type, set_op_ref);
4633a7c4
LW
1906 /* FALL THROUGH */
1907 case OP_PADSV:
5f05dabc 1908 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
5dc0d613
MB
1909 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1910 : type == OP_RV2HV ? OPpDEREF_HV
1911 : OPpDEREF_SV);
11343788 1912 o->op_flags |= OPf_MOD;
a0d0e21e 1913 }
8990e307 1914 break;
1c846c1f 1915
463ee0b2
LW
1916 case OP_RV2AV:
1917 case OP_RV2HV:
e4c5ccf3
RH
1918 if (set_op_ref)
1919 o->op_flags |= OPf_REF;
8990e307 1920 /* FALL THROUGH */
463ee0b2 1921 case OP_RV2GV:
35cd451c
GS
1922 if (type == OP_DEFINED)
1923 o->op_flags |= OPf_SPECIAL; /* don't create GV */
e4c5ccf3 1924 doref(cUNOPo->op_first, o->op_type, set_op_ref);
463ee0b2 1925 break;
8990e307 1926
463ee0b2
LW
1927 case OP_PADAV:
1928 case OP_PADHV:
e4c5ccf3
RH
1929 if (set_op_ref)
1930 o->op_flags |= OPf_REF;
79072805 1931 break;
aeea060c 1932
8990e307 1933 case OP_SCALAR:
79072805 1934 case OP_NULL:
11343788 1935 if (!(o->op_flags & OPf_KIDS))
463ee0b2 1936 break;
e4c5ccf3 1937 doref(cBINOPo->op_first, type, set_op_ref);
79072805
LW
1938 break;
1939 case OP_AELEM:
1940 case OP_HELEM:
e4c5ccf3 1941 doref(cBINOPo->op_first, o->op_type, set_op_ref);
5f05dabc 1942 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
5dc0d613
MB
1943 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1944 : type == OP_RV2HV ? OPpDEREF_HV
1945 : OPpDEREF_SV);
11343788 1946 o->op_flags |= OPf_MOD;
8990e307 1947 }
79072805
LW
1948 break;
1949
463ee0b2 1950 case OP_SCOPE:
79072805 1951 case OP_LEAVE:
e4c5ccf3
RH
1952 set_op_ref = FALSE;
1953 /* FALL THROUGH */
79072805 1954 case OP_ENTER:
8990e307 1955 case OP_LIST:
11343788 1956 if (!(o->op_flags & OPf_KIDS))
79072805 1957 break;
e4c5ccf3 1958 doref(cLISTOPo->op_last, type, set_op_ref);
79072805 1959 break;
a0d0e21e
LW
1960 default:
1961 break;
79072805 1962 }
11343788 1963 return scalar(o);
8990e307 1964
79072805
LW
1965}
1966
09bef843
SB
1967STATIC OP *
1968S_dup_attrlist(pTHX_ OP *o)
1969{
97aff369 1970 dVAR;
0bd48802 1971 OP *rop;
09bef843 1972
7918f24d
NC
1973 PERL_ARGS_ASSERT_DUP_ATTRLIST;
1974
09bef843
SB
1975 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1976 * where the first kid is OP_PUSHMARK and the remaining ones
1977 * are OP_CONST. We need to push the OP_CONST values.
1978 */
1979 if (o->op_type == OP_CONST)
b37c2d43 1980 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
eb8433b7
NC
1981#ifdef PERL_MAD
1982 else if (o->op_type == OP_NULL)
1d866c12 1983 rop = NULL;
eb8433b7 1984#endif
09bef843
SB
1985 else {
1986 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
5f66b61c 1987 rop = NULL;
09bef843
SB
1988 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1989 if (o->op_type == OP_CONST)
2fcb4757 1990 rop = op_append_elem(OP_LIST, rop,
09bef843 1991 newSVOP(OP_CONST, o->op_flags,
b37c2d43 1992 SvREFCNT_inc_NN(cSVOPo->op_sv)));
09bef843
SB
1993 }
1994 }
1995 return rop;
1996}
1997
1998STATIC void
95f0a2f1 1999S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
09bef843 2000{
27da23d5 2001 dVAR;
09bef843
SB
2002 SV *stashsv;
2003
7918f24d
NC
2004 PERL_ARGS_ASSERT_APPLY_ATTRS;
2005
09bef843
SB
2006 /* fake up C<use attributes $pkg,$rv,@attrs> */
2007 ENTER; /* need to protect against side-effects of 'use' */
5aaec2b4 2008 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
e4783991 2009
09bef843 2010#define ATTRSMODULE "attributes"
95f0a2f1
SB
2011#define ATTRSMODULE_PM "attributes.pm"
2012
2013 if (for_my) {
95f0a2f1 2014 /* Don't force the C<use> if we don't need it. */
a4fc7abc 2015 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
95f0a2f1 2016 if (svp && *svp != &PL_sv_undef)
6f207bd3 2017 NOOP; /* already in %INC */
95f0a2f1
SB
2018 else
2019 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
6136c704 2020 newSVpvs(ATTRSMODULE), NULL);
95f0a2f1
SB
2021 }
2022 else {
2023 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
6136c704
AL
2024 newSVpvs(ATTRSMODULE),
2025 NULL,
2fcb4757 2026 op_prepend_elem(OP_LIST,
95f0a2f1 2027 newSVOP(OP_CONST, 0, stashsv),
2fcb4757 2028 op_prepend_elem(OP_LIST,
95f0a2f1
SB
2029 newSVOP(OP_CONST, 0,
2030 newRV(target)),
2031 dup_attrlist(attrs))));
2032 }
09bef843
SB
2033 LEAVE;
2034}
2035
95f0a2f1
SB
2036STATIC void
2037S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2038{
97aff369 2039 dVAR;
95f0a2f1
SB
2040 OP *pack, *imop, *arg;
2041 SV *meth, *stashsv;
2042
7918f24d
NC
2043 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2044
95f0a2f1
SB
2045 if (!attrs)
2046 return;
2047
2048 assert(target->op_type == OP_PADSV ||
2049 target->op_type == OP_PADHV ||
2050 target->op_type == OP_PADAV);
2051
2052 /* Ensure that attributes.pm is loaded. */
dd2155a4 2053 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
95f0a2f1
SB
2054
2055 /* Need package name for method call. */
6136c704 2056 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
95f0a2f1
SB
2057
2058 /* Build up the real arg-list. */
5aaec2b4
NC
2059 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2060
95f0a2f1
SB
2061 arg = newOP(OP_PADSV, 0);
2062 arg->op_targ = target->op_targ;
2fcb4757 2063 arg = op_prepend_elem(OP_LIST,
95f0a2f1 2064 newSVOP(OP_CONST, 0, stashsv),
2fcb4757 2065 op_prepend_elem(OP_LIST,
95f0a2f1 2066 newUNOP(OP_REFGEN, 0,
3ad73efd 2067 op_lvalue(arg, OP_REFGEN)),
95f0a2f1
SB
2068 dup_attrlist(attrs)));
2069
2070 /* Fake up a method call to import */
18916d0d 2071 meth = newSVpvs_share("import");
95f0a2f1 2072 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2fcb4757
Z
2073 op_append_elem(OP_LIST,
2074 op_prepend_elem(OP_LIST, pack, list(arg)),
95f0a2f1
SB
2075 newSVOP(OP_METHOD_NAMED, 0, meth)));
2076 imop->op_private |= OPpENTERSUB_NOMOD;
2077
2078 /* Combine the ops. */
2fcb4757 2079 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
95f0a2f1
SB
2080}
2081
2082/*
2083=notfor apidoc apply_attrs_string
2084
2085Attempts to apply a list of attributes specified by the C<attrstr> and
2086C<len> arguments to the subroutine identified by the C<cv> argument which
2087is expected to be associated with the package identified by the C<stashpv>
2088argument (see L<attributes>). It gets this wrong, though, in that it
2089does not correctly identify the boundaries of the individual attribute
2090specifications within C<attrstr>. This is not really intended for the
2091public API, but has to be listed here for systems such as AIX which
2092need an explicit export list for symbols. (It's called from XS code
2093in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2094to respect attribute syntax properly would be welcome.
2095
2096=cut
2097*/
2098
be3174d2 2099void
6867be6d
AL
2100Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2101 const char *attrstr, STRLEN len)
be3174d2 2102{
5f66b61c 2103 OP *attrs = NULL;
be3174d2 2104
7918f24d
NC
2105 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2106
be3174d2
GS
2107 if (!len) {
2108 len = strlen(attrstr);
2109 }
2110
2111 while (len) {
2112 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2113 if (len) {
890ce7af 2114 const char * const sstr = attrstr;
be3174d2 2115 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2fcb4757 2116 attrs = op_append_elem(OP_LIST, attrs,
be3174d2
GS
2117 newSVOP(OP_CONST, 0,
2118 newSVpvn(sstr, attrstr-sstr)));
2119 }
2120 }
2121
2122 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
6136c704 2123 newSVpvs(ATTRSMODULE),
2fcb4757 2124 NULL, op_prepend_elem(OP_LIST,
be3174d2 2125 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2fcb4757 2126 op_prepend_elem(OP_LIST,
be3174d2 2127 newSVOP(OP_CONST, 0,
ad64d0ec 2128 newRV(MUTABLE_SV(cv))),
be3174d2
GS
2129 attrs)));
2130}
2131
09bef843 2132STATIC OP *
95f0a2f1 2133S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
93a17b20 2134{
97aff369 2135 dVAR;
93a17b20 2136 I32 type;
a1fba7eb 2137 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
93a17b20 2138
7918f24d
NC
2139 PERL_ARGS_ASSERT_MY_KID;
2140
13765c85 2141 if (!o || (PL_parser && PL_parser->error_count))
11343788 2142 return o;
93a17b20 2143
bc61e325 2144 type = o->op_type;
eb8433b7
NC
2145 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2146 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2147 return o;
2148 }
2149
93a17b20 2150 if (type == OP_LIST) {
6867be6d 2151 OP *kid;
11343788 2152 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
95f0a2f1 2153 my_kid(kid, attrs, imopsp);
eb8433b7
NC
2154 } else if (type == OP_UNDEF
2155#ifdef PERL_MAD
2156 || type == OP_STUB
2157#endif
2158 ) {
7766148a 2159 return o;
77ca0c92
LW
2160 } else if (type == OP_RV2SV || /* "our" declaration */
2161 type == OP_RV2AV ||
2162 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
1ce0b88c 2163 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
fab01b8e 2164 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
952306ac 2165 OP_DESC(o),
12bd6ede
DM
2166 PL_parser->in_my == KEY_our
2167 ? "our"
2168 : PL_parser->in_my == KEY_state ? "state" : "my"));
1ce0b88c 2169 } else if (attrs) {
551405c4 2170 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
12bd6ede
DM
2171 PL_parser->in_my = FALSE;
2172 PL_parser->in_my_stash = NULL;
1ce0b88c
RGS
2173 apply_attrs(GvSTASH(gv),
2174 (type == OP_RV2SV ? GvSV(gv) :
ad64d0ec
NC
2175 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2176 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
1ce0b88c
RGS
2177 attrs, FALSE);
2178 }
192587c2 2179 o->op_private |= OPpOUR_INTRO;
77ca0c92 2180 return o;
95f0a2f1
SB
2181 }
2182 else if (type != OP_PADSV &&
93a17b20
LW
2183 type != OP_PADAV &&
2184 type != OP_PADHV &&
2185 type != OP_PUSHMARK)
2186 {
eb64745e 2187 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
53e06cf0 2188 OP_DESC(o),
12bd6ede
DM
2189 PL_parser->in_my == KEY_our
2190 ? "our"
2191 : PL_parser->in_my == KEY_state ? "state" : "my"));
11343788 2192 return o;
93a17b20 2193 }
09bef843
SB
2194 else if (attrs && type != OP_PUSHMARK) {
2195 HV *stash;
09bef843 2196
12bd6ede
DM
2197 PL_parser->in_my = FALSE;
2198 PL_parser->in_my_stash = NULL;
eb64745e 2199
09bef843 2200 /* check for C<my Dog $spot> when deciding package */
dd2155a4
DM
2201 stash = PAD_COMPNAME_TYPE(o->op_targ);
2202 if (!stash)
09bef843 2203 stash = PL_curstash;
95f0a2f1 2204 apply_attrs_my(stash, o, attrs, imopsp);
09bef843 2205 }
11343788
MB
2206 o->op_flags |= OPf_MOD;
2207 o->op_private |= OPpLVAL_INTRO;
a1fba7eb 2208 if (stately)
952306ac 2209 o->op_private |= OPpPAD_STATE;
11343788 2210 return o;
93a17b20
LW
2211}
2212
2213OP *
09bef843
SB
2214Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2215{
97aff369 2216 dVAR;
0bd48802 2217 OP *rops;
95f0a2f1
SB
2218 int maybe_scalar = 0;
2219
7918f24d
NC
2220 PERL_ARGS_ASSERT_MY_ATTRS;
2221
d2be0de5 2222/* [perl #17376]: this appears to be premature, and results in code such as
c754c3d7 2223 C< our(%x); > executing in list mode rather than void mode */
d2be0de5 2224#if 0
09bef843
SB
2225 if (o->op_flags & OPf_PARENS)
2226 list(o);
95f0a2f1
SB
2227 else
2228 maybe_scalar = 1;
d2be0de5
YST
2229#else
2230 maybe_scalar = 1;
2231#endif
09bef843
SB
2232 if (attrs)
2233 SAVEFREEOP(attrs);
5f66b61c 2234 rops = NULL;
95f0a2f1
SB
2235 o = my_kid(o, attrs, &rops);
2236 if (rops) {
2237 if (maybe_scalar && o->op_type == OP_PADSV) {
2fcb4757 2238 o = scalar(op_append_list(OP_LIST, rops, o));
95f0a2f1
SB
2239 o->op_private |= OPpLVAL_INTRO;
2240 }
2241 else
2fcb4757 2242 o = op_append_list(OP_LIST, o, rops);
95f0a2f1 2243 }
12bd6ede
DM
2244 PL_parser->in_my = FALSE;
2245 PL_parser->in_my_stash = NULL;
eb64745e 2246 return o;
09bef843
SB
2247}
2248
2249OP *
864dbfa3 2250Perl_sawparens(pTHX_ OP *o)
79072805 2251{
96a5add6 2252 PERL_UNUSED_CONTEXT;
79072805
LW
2253 if (o)
2254 o->op_flags |= OPf_PARENS;
2255 return o;
2256}
2257
2258OP *
864dbfa3 2259Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
79072805 2260{
11343788 2261 OP *o;
59f00321 2262 bool ismatchop = 0;
1496a290
AL
2263 const OPCODE ltype = left->op_type;
2264 const OPCODE rtype = right->op_type;
79072805 2265
7918f24d
NC
2266 PERL_ARGS_ASSERT_BIND_MATCH;
2267
1496a290
AL
2268 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2269 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
041457d9 2270 {
1496a290 2271 const char * const desc
bb16bae8
FC
2272 = PL_op_desc[(
2273 rtype == OP_SUBST || rtype == OP_TRANS
2274 || rtype == OP_TRANSR
2275 )
666ea192
JH
2276 ? (int)rtype : OP_MATCH];
2277 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
2278 ? "@array" : "%hash");
9014280d 2279 Perl_warner(aTHX_ packWARN(WARN_MISC),
1c846c1f 2280 "Applying %s to %s will act on scalar(%s)",
599cee73 2281 desc, sample, sample);
2ae324a7
PP
2282 }
2283
1496a290 2284 if (rtype == OP_CONST &&
5cc9e5c9
RH
2285 cSVOPx(right)->op_private & OPpCONST_BARE &&
2286 cSVOPx(right)->op_private & OPpCONST_STRICT)
2287 {
2288 no_bareword_allowed(right);
2289 }
2290
bb16bae8 2291 /* !~ doesn't make sense with /r, so error on it for now */
4f4d7508
DC
2292 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2293 type == OP_NOT)
2294 yyerror("Using !~ with s///r doesn't make sense");
bb16bae8
FC
2295 if (rtype == OP_TRANSR && type == OP_NOT)
2296 yyerror("Using !~ with tr///r doesn't make sense");
4f4d7508 2297
2474a784
FC
2298 ismatchop = (rtype == OP_MATCH ||
2299 rtype == OP_SUBST ||
bb16bae8 2300 rtype == OP_TRANS || rtype == OP_TRANSR)
2474a784 2301 && !(right->op_flags & OPf_SPECIAL);
59f00321
RGS
2302 if (ismatchop && right->op_private & OPpTARGET_MY) {
2303 right->op_targ = 0;
2304 right->op_private &= ~OPpTARGET_MY;
2305 }
2306 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
1496a290
AL
2307 OP *newleft;
2308
79072805 2309 right->op_flags |= OPf_STACKED;
bb16bae8 2310 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
1496a290 2311 ! (rtype == OP_TRANS &&
4f4d7508
DC
2312 right->op_private & OPpTRANS_IDENTICAL) &&
2313 ! (rtype == OP_SUBST &&
2314 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
3ad73efd 2315 newleft = op_lvalue(left, rtype);
1496a290
AL
2316 else
2317 newleft = left;
bb16bae8 2318 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
1496a290 2319 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
79072805 2320 else
2fcb4757 2321 o = op_prepend_elem(rtype, scalar(newleft), right);
79072805 2322 if (type == OP_NOT)
11343788
MB
2323 return newUNOP(OP_NOT, 0, scalar(o));
2324 return o;
79072805
LW
2325 }
2326 else
2327 return bind_match(type, left,
131b3ad0 2328 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
79072805
LW
2329}
2330
2331OP *
864dbfa3 2332Perl_invert(pTHX_ OP *o)
79072805 2333{
11343788 2334 if (!o)
1d866c12 2335 return NULL;
11343788 2336 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
79072805
LW
2337}
2338
3ad73efd
Z
2339/*
2340=for apidoc Amx|OP *|op_scope|OP *o
2341
2342Wraps up an op tree with some additional ops so that at runtime a dynamic
2343scope will be created. The original ops run in the new dynamic scope,
2344and then, provided that they exit normally, the scope will be unwound.
2345The additional ops used to create and unwind the dynamic scope will
2346normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2347instead if the ops are simple enough to not need the full dynamic scope
2348structure.
2349
2350=cut
2351*/
2352
79072805 2353OP *
3ad73efd 2354Perl_op_scope(pTHX_ OP *o)
79072805 2355{
27da23d5 2356 dVAR;
79072805 2357 if (o) {
3280af22 2358 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2fcb4757 2359 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
463ee0b2 2360 o->op_type = OP_LEAVE;
22c35a8c 2361 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
463ee0b2 2362 }
fdb22418
HS
2363 else if (o->op_type == OP_LINESEQ) {
2364 OP *kid;
2365 o->op_type = OP_SCOPE;
2366 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2367 kid = ((LISTOP*)o)->op_first;
59110972 2368 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
fdb22418 2369 op_null(kid);
59110972
RH
2370
2371 /* The following deals with things like 'do {1 for 1}' */
2372 kid = kid->op_sibling;
2373 if (kid &&
2374 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2375 op_null(kid);
2376 }
463ee0b2 2377 }
fdb22418 2378 else
5f66b61c 2379 o = newLISTOP(OP_SCOPE, 0, o, NULL);
79072805
LW
2380 }
2381 return o;
2382}
1930840b 2383
a0d0e21e 2384int
864dbfa3 2385Perl_block_start(pTHX_ int full)
79072805 2386{
97aff369 2387 dVAR;
73d840c0 2388 const int retval = PL_savestack_ix;
1930840b 2389
dd2155a4 2390 pad_block_start(full);
b3ac6de7 2391 SAVEHINTS();
3280af22 2392 PL_hints &= ~HINT_BLOCK_SCOPE;
68da3b2f 2393 SAVECOMPILEWARNINGS();
72dc9ed5 2394 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
1930840b 2395
a88d97bf 2396 CALL_BLOCK_HOOKS(bhk_start, full);
1930840b 2397
a0d0e21e
LW
2398 return retval;
2399}
2400
2401OP*
864dbfa3 2402Perl_block_end(pTHX_ I32 floor, OP *seq)
a0d0e21e 2403{
97aff369 2404 dVAR;
6867be6d 2405 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
1930840b
BM
2406 OP* retval = scalarseq(seq);
2407
a88d97bf 2408 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
1930840b 2409
e9818f4e 2410 LEAVE_SCOPE(floor);
623e6609 2411 CopHINTS_set(&PL_compiling, PL_hints);
a0d0e21e 2412 if (needblockscope)
3280af22 2413 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
dd2155a4 2414 pad_leavemy();
1930840b 2415
a88d97bf 2416 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
1930840b 2417
a0d0e21e
LW
2418 return retval;
2419}
2420
fd85fad2
BM
2421/*
2422=head1 Compile-time scope hooks
2423
3e4ddde5 2424=for apidoc Aox||blockhook_register
fd85fad2
BM
2425
2426Register a set of hooks to be called when the Perl lexical scope changes
2427at compile time. See L<perlguts/"Compile-time scope hooks">.
2428
2429=cut
2430*/
2431
bb6c22e7
BM
2432void
2433Perl_blockhook_register(pTHX_ BHK *hk)
2434{
2435 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2436
2437 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2438}
2439
76e3520e 2440STATIC OP *
cea2e8a9 2441S_newDEFSVOP(pTHX)
54b9620d 2442{
97aff369 2443 dVAR;
f8f98e0a 2444 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
00b1698f 2445 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
59f00321
RGS
2446 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2447 }
2448 else {
551405c4 2449 OP * const o = newOP(OP_PADSV, 0);
59f00321
RGS
2450 o->op_targ = offset;
2451 return o;
2452 }
54b9620d
MB
2453}
2454
a0d0e21e 2455void
864dbfa3 2456Perl_newPROG(pTHX_ OP *o)
a0d0e21e 2457{
97aff369 2458 dVAR;
7918f24d
NC
2459
2460 PERL_ARGS_ASSERT_NEWPROG;
2461
3280af22 2462 if (PL_in_eval) {
b295d113
TH
2463 if (PL_eval_root)
2464 return;
faef0170
HS
2465 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2466 ((PL_in_eval & EVAL_KEEPERR)
2467 ? OPf_SPECIAL : 0), o);
5983a79d
BM
2468 /* don't use LINKLIST, since PL_eval_root might indirect through
2469 * a rather expensive function call and LINKLIST evaluates its
2470 * argument more than once */
2471 PL_eval_start = op_linklist(PL_eval_root);
7934575e
GS
2472 PL_eval_root->op_private |= OPpREFCOUNTED;
2473 OpREFCNT_set(PL_eval_root, 1);
3280af22 2474 PL_eval_root->op_next = 0;
a2efc822 2475 CALL_PEEP(PL_eval_start);
a0d0e21e
LW
2476 }
2477 else {
6be89cf9
AE
2478 if (o->op_type == OP_STUB) {
2479 PL_comppad_name = 0;
2480 PL_compcv = 0;
d2c837a0 2481 S_op_destroy(aTHX_ o);
a0d0e21e 2482 return;
6be89cf9 2483 }
3ad73efd 2484 PL_main_root = op_scope(sawparens(scalarvoid(o)));
3280af22
NIS
2485 PL_curcop = &PL_compiling;
2486 PL_main_start = LINKLIST(PL_main_root);
7934575e
GS
2487 PL_main_root->op_private |= OPpREFCOUNTED;
2488 OpREFCNT_set(PL_main_root, 1);
3280af22 2489 PL_main_root->op_next = 0;
a2efc822 2490 CALL_PEEP(PL_main_start);
3280af22 2491 PL_compcv = 0;
3841441e 2492
4fdae800 2493 /* Register with debugger */
84902520 2494 if (PERLDB_INTER) {
b96d8cd9 2495 CV * const cv = get_cvs("DB::postponed", 0);
3841441e
CS
2496 if (cv) {
2497 dSP;
924508f0 2498 PUSHMARK(SP);
ad64d0ec 2499 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3841441e 2500 PUTBACK;
ad64d0ec 2501 call_sv(MUTABLE_SV(cv), G_DISCARD);
3841441e
CS
2502 }
2503 }
79072805 2504 }
79072805
LW
2505}
2506
2507OP *
864dbfa3 2508Perl_localize(pTHX_ OP *o, I32 lex)
79072805 2509{
97aff369 2510 dVAR;
7918f24d
NC
2511
2512 PERL_ARGS_ASSERT_LOCALIZE;
2513
79072805 2514 if (o->op_flags & OPf_PARENS)
d2be0de5
YST
2515/* [perl #17376]: this appears to be premature, and results in code such as
2516 C< our(%x); > executing in list mode rather than void mode */
2517#if 0
79072805 2518 list(o);
d2be0de5 2519#else
6f207bd3 2520 NOOP;
d2be0de5 2521#endif
8990e307 2522 else {
f06b5848
DM
2523 if ( PL_parser->bufptr > PL_parser->oldbufptr
2524 && PL_parser->bufptr[-1] == ','
041457d9 2525 && ckWARN(WARN_PARENTHESIS))
64420d0d 2526 {
f06b5848 2527 char *s = PL_parser->bufptr;
bac662ee 2528 bool sigil = FALSE;
64420d0d 2529
8473848f 2530 /* some heuristics to detect a potential error */
bac662ee 2531 while (*s && (strchr(", \t\n", *s)))
64420d0d 2532 s++;
8473848f 2533
bac662ee
ST
2534 while (1) {
2535 if (*s && strchr("@$%*", *s) && *++s
2536 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2537 s++;
2538 sigil = TRUE;
2539 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2540 s++;
2541 while (*s && (strchr(", \t\n", *s)))
2542 s++;
2543 }
2544 else
2545 break;
2546 }
2547 if (sigil && (*s == ';' || *s == '=')) {
2548 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
8473848f 2549 "Parentheses missing around \"%s\" list",
12bd6ede
DM
2550 lex
2551 ? (PL_parser->in_my == KEY_our
2552 ? "our"
2553 : PL_parser->in_my == KEY_state
2554 ? "state"
2555 : "my")
2556 : "local");
8473848f 2557 }
8990e307
LW
2558 }
2559 }
93a17b20 2560 if (lex)
eb64745e 2561 o = my(o);
93a17b20 2562 else
3ad73efd 2563 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
12bd6ede
DM
2564 PL_parser->in_my = FALSE;
2565 PL_parser->in_my_stash = NULL;
eb64745e 2566 return o;
79072805
LW
2567}
2568
2569OP *
864dbfa3 2570Perl_jmaybe(pTHX_ OP *o)
79072805 2571{
7918f24d
NC
2572 PERL_ARGS_ASSERT_JMAYBE;
2573
79072805 2574 if (o->op_type == OP_LIST) {
fafc274c 2575 OP * const o2
d4c19fe8 2576 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2fcb4757 2577 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
79072805
LW
2578 }
2579 return o;
2580}
2581
1f676739 2582static OP *
b7783a12 2583S_fold_constants(pTHX_ register OP *o)
79072805 2584{
27da23d5 2585 dVAR;
001d637e 2586 register OP * VOL curop;
eb8433b7 2587 OP *newop;
8ea43dc8 2588 VOL I32 type = o->op_type;
e3cbe32f 2589 SV * VOL sv = NULL;
b7f7fd0b
NC
2590 int ret = 0;
2591 I32 oldscope;
2592 OP *old_next;
5f2d9966
DM
2593 SV * const oldwarnhook = PL_warnhook;
2594 SV * const olddiehook = PL_diehook;
c427f4d2 2595 COP not_compiling;
b7f7fd0b 2596 dJMPENV;
79072805 2597
7918f24d
NC
2598 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2599
22c35a8c 2600 if (PL_opargs[type] & OA_RETSCALAR)
79072805 2601 scalar(o);
b162f9ea 2602 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
ed6116ce 2603 o->op_targ = pad_alloc(type, SVs_PADTMP);
79072805 2604
eac055e9
GS
2605 /* integerize op, unless it happens to be C<-foo>.
2606 * XXX should pp_i_negate() do magic string negation instead? */
2607 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2608 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2609 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2610 {
22c35a8c 2611 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
eac055e9 2612 }
85e6fe83 2613
22c35a8c 2614 if (!(PL_opargs[type] & OA_FOLDCONST))
79072805
LW
2615 goto nope;
2616
de939608 2617 switch (type) {
7a52d87a
GS
2618 case OP_NEGATE:
2619 /* XXX might want a ck_negate() for this */
2620 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2621 break;
de939608
CS
2622 case OP_UCFIRST:
2623 case OP_LCFIRST:
2624 case OP_UC:
2625 case OP_LC:
69dcf70c
MB
2626 case OP_SLT:
2627 case OP_SGT:
2628 case OP_SLE:
2629 case OP_SGE:
2630 case OP_SCMP:
b3fd6149 2631 case OP_SPRINTF:
2de3dbcc
JH
2632 /* XXX what about the numeric ops? */
2633 if (PL_hints & HINT_LOCALE)
de939608 2634 goto nope;
553e7bb0 2635 break;
de939608
CS
2636 }
2637
13765c85 2638 if (PL_parser && PL_parser->error_count)
a0d0e21e
LW
2639 goto nope; /* Don't try to run w/ errors */
2640
79072805 2641 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
1496a290
AL
2642 const OPCODE type = curop->op_type;
2643 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2644 type != OP_LIST &&
2645 type != OP_SCALAR &&
2646 type != OP_NULL &&
2647 type != OP_PUSHMARK)
7a52d87a 2648 {
79072805
LW
2649 goto nope;
2650 }
2651 }
2652
2653 curop = LINKLIST(o);
b7f7fd0b 2654 old_next = o->op_next;
79072805 2655 o->op_next = 0;
533c011a 2656 PL_op = curop;
b7f7fd0b
NC
2657
2658 oldscope = PL_scopestack_ix;
edb2152a 2659 create_eval_scope(G_FAKINGEVAL);
b7f7fd0b 2660
c427f4d2
NC
2661 /* Verify that we don't need to save it: */
2662 assert(PL_curcop == &PL_compiling);
2663 StructCopy(&PL_compiling, &not_compiling, COP);
2664 PL_curcop = &not_compiling;
2665 /* The above ensures that we run with all the correct hints of the
2666 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
2667 assert(IN_PERL_RUNTIME);
5f2d9966
DM
2668 PL_warnhook = PERL_WARNHOOK_FATAL;
2669 PL_diehook = NULL;
b7f7fd0b
NC
2670 JMPENV_PUSH(ret);
2671
2672 switch (ret) {
2673 case 0:
2674 CALLRUNOPS(aTHX);
2675 sv = *(PL_stack_sp--);
523a0f0c
NC
2676 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
2677#ifdef PERL_MAD
2678 /* Can't simply swipe the SV from the pad, because that relies on
2679 the op being freed "real soon now". Under MAD, this doesn't
2680 happen (see the #ifdef below). */
2681 sv = newSVsv(sv);
2682#else
b7f7fd0b 2683 pad_swipe(o->op_targ, FALSE);
523a0f0c
NC
2684#endif
2685 }
b7f7fd0b
NC
2686 else if (SvTEMP(sv)) { /* grab mortal temp? */
2687 SvREFCNT_inc_simple_void(sv);
2688 SvTEMP_off(sv);
2689 }
2690 break;
2691 case 3:
2692 /* Something tried to die. Abandon constant folding. */
2693 /* Pretend the error never happened. */
ab69dbc2 2694 CLEAR_ERRSV();
b7f7fd0b
NC
2695 o->op_next = old_next;
2696 break;
2697 default:
2698 JMPENV_POP;
5f2d9966
DM
2699 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
2700 PL_warnhook = oldwarnhook;
2701 PL_diehook = olddiehook;
2702 /* XXX note that this croak may fail as we've already blown away
2703 * the stack - eg any nested evals */
b7f7fd0b
NC
2704 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
2705 }
b7f7fd0b 2706 JMPENV_POP;
5f2d9966
DM
2707 PL_warnhook = oldwarnhook;
2708 PL_diehook = olddiehook;
c427f4d2 2709 PL_curcop = &PL_compiling;
edb2152a
NC
2710
2711 if (PL_scopestack_ix > oldscope)
2712 delete_eval_scope();
eb8433b7 2713
b7f7fd0b
NC
2714 if (ret)
2715 goto nope;
2716
eb8433b7 2717#ifndef PERL_MAD
79072805 2718 op_free(o);
eb8433b7 2719#endif
de5e01c2 2720 assert(sv);
79072805 2721 if (type == OP_RV2GV)
159b6efe 2722 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
eb8433b7 2723 else
ad64d0ec 2724 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
eb8433b7
NC
2725 op_getmad(o,newop,'f');
2726 return newop;
aeea060c 2727
b7f7fd0b 2728 nope:
79072805
LW
2729 return o;
2730}
2731
1f676739 2732static OP *
b7783a12 2733S_gen_constant_list(pTHX_ register OP *o)
79072805 2734{
27da23d5 2735 dVAR;
79072805 2736 register OP *curop;
6867be6d 2737 const I32 oldtmps_floor = PL_tmps_floor;
79072805 2738
a0d0e21e 2739 list(o);
13765c85 2740 if (PL_parser && PL_parser->error_count)
a0d0e21e
LW
2741 return o; /* Don't attempt to run with errors */
2742
533c011a 2743 PL_op = curop = LINKLIST(o);
a0d0e21e 2744 o->op_next = 0;
a2efc822 2745 CALL_PEEP(curop);
897d3989 2746 Perl_pp_pushmark(aTHX);
cea2e8a9 2747 CALLRUNOPS(aTHX);
533c011a 2748 PL_op = curop;
78c72037
NC
2749 assert (!(curop->op_flags & OPf_SPECIAL));
2750 assert(curop->op_type == OP_RANGE);
897d3989 2751 Perl_pp_anonlist(aTHX);
3280af22 2752 PL_tmps_floor = oldtmps_floor;
79072805
LW
2753
2754 o->op_type = OP_RV2AV;
22c35a8c 2755 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
fb53bbb2
SG
2756 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2757 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
1a0a2ba9 2758 o->op_opt = 0; /* needs to be revisited in rpeep() */
79072805 2759 curop = ((UNOP*)o)->op_first;
b37c2d43 2760 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
eb8433b7
NC
2761#ifdef PERL_MAD
2762 op_getmad(curop,o,'O');
2763#else
79072805 2764 op_free(curop);
eb8433b7 2765#endif
5983a79d 2766 LINKLIST(o);
79072805
LW
2767 return list(o);
2768}
2769
2770OP *
864dbfa3 2771Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
79072805 2772{
27da23d5 2773 dVAR;
11343788 2774 if (!o || o->op_type != OP_LIST)
5f66b61c 2775 o = newLISTOP(OP_LIST, 0, o, NULL);
748a9306 2776 else
5dc0d613 2777 o->op_flags &= ~OPf_WANT;
79072805 2778
22c35a8c 2779 if (!(PL_opargs[type] & OA_MARK))
93c66552 2780 op_null(cLISTOPo->op_first);
8990e307 2781
eb160463 2782 o->op_type = (OPCODE)type;
22c35a8c 2783 o->op_ppaddr = PL_ppaddr[type];
11343788 2784 o->op_flags |= flags;
79072805 2785
11343788 2786 o = CHECKOP(type, o);
fe2774ed 2787 if (o->op_type != (unsigned)type)
11343788 2788 return o;
79072805 2789
11343788 2790 return fold_constants(o);
79072805
LW
2791}
2792
2fcb4757
Z
2793/*
2794=head1 Optree Manipulation Functions
2795*/
2796
79072805
LW
2797/* List constructors */
2798
2fcb4757
Z
2799/*
2800=for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
2801
2802Append an item to the list of ops contained directly within a list-type
2803op, returning the lengthened list. I<first> is the list-type op,
2804and I<last> is the op to append to the list. I<optype> specifies the
2805intended opcode for the list. If I<first> is not already a list of the
2806right type, it will be upgraded into one. If either I<first> or I<last>
2807is null, the other is returned unchanged.
2808
2809=cut
2810*/
2811
79072805 2812OP *
2fcb4757 2813Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
79072805
LW
2814{
2815 if (!first)
2816 return last;
8990e307
LW
2817
2818 if (!last)
79072805 2819 return first;
8990e307 2820
fe2774ed 2821 if (first->op_type != (unsigned)type
155aba94
GS
2822 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2823 {
2824 return newLISTOP(type, 0, first, last);
2825 }
79072805 2826
a0d0e21e
LW
2827 if (first->op_flags & OPf_KIDS)
2828 ((LISTOP*)first)->op_last->op_sibling = last;
2829 else {
2830 first->op_flags |= OPf_KIDS;
2831 ((LISTOP*)first)->op_first = last;
2832 }
2833 ((LISTOP*)first)->op_last = last;
a0d0e21e 2834 return first;
79072805
LW
2835}
2836
2fcb4757
Z
2837/*
2838=for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
2839
2840Concatenate the lists of ops contained directly within two list-type ops,
2841returning the combined list. I<first> and I<last> are the list-type ops
2842to concatenate. I<optype> specifies the intended opcode for the list.
2843If either I<first> or I<last> is not already a list of the right type,
2844it will be upgraded into one. If either I<first> or I<last> is null,
2845the other is returned unchanged.
2846
2847=cut
2848*/
2849
79072805 2850OP *
2fcb4757 2851Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
79072805
LW
2852{
2853 if (!first)
2fcb4757 2854 return last;
8990e307
LW
2855
2856 if (!last)
2fcb4757 2857 return first;
8990e307 2858
fe2774ed 2859 if (first->op_type != (unsigned)type)
2fcb4757 2860 return op_prepend_elem(type, first, last);
8990e307 2861
fe2774ed 2862 if (last->op_type != (unsigned)type)
2fcb4757 2863 return op_append_elem(type, first, last);
79072805 2864
2fcb4757
Z
2865 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
2866 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
117dada2 2867 first->op_flags |= (last->op_flags & OPf_KIDS);
1c846c1f 2868
eb8433b7 2869#ifdef PERL_MAD
2fcb4757
Z
2870 if (((LISTOP*)last)->op_first && first->op_madprop) {
2871 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
eb8433b7
NC
2872 if (mp) {
2873 while (mp->mad_next)
2874 mp = mp->mad_next;
2875 mp->mad_next = first->op_madprop;
2876 }
2877 else {
2fcb4757 2878 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
eb8433b7
NC
2879 }
2880 }
2881 first->op_madprop = last->op_madprop;
2882 last->op_madprop = 0;
2883#endif
2884
2fcb4757 2885 S_op_destroy(aTHX_ last);
238a4c30 2886
2fcb4757 2887 return first;
79072805
LW
2888}
2889
2fcb4757
Z
2890/*
2891=for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
2892
2893Prepend an item to the list of ops contained directly within a list-type
2894op, returning the lengthened list. I<first> is the op to prepend to the
2895list, and I<last> is the list-type op. I<optype> specifies the intended
2896opcode for the list. If I<last> is not already a list of the right type,
2897it will be upgraded into one. If either I<first> or I<last> is null,
2898the other is returned unchanged.
2899
2900=cut
2901*/
2902
79072805 2903OP *
2fcb4757 2904Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
79072805
LW
2905{
2906 if (!first)
2907 return last;
8990e307
LW
2908
2909 if (!last)
79072805 2910 return first;
8990e307 2911
fe2774ed 2912 if (last->op_type == (unsigned)type) {
8990e307
LW
2913 if (type == OP_LIST) { /* already a PUSHMARK there */
2914 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2915 ((LISTOP*)last)->op_first->op_sibling = first;
36a5d4ba
DC
2916 if (!(first->op_flags & OPf_PARENS))
2917 last->op_flags &= ~OPf_PARENS;
8990e307
LW
2918 }
2919 else {
2920 if (!(last->op_flags & OPf_KIDS)) {
2921 ((LISTOP*)last)->op_last = first;
2922 last->op_flags |= OPf_KIDS;
2923 }
2924 first->op_sibling = ((LISTOP*)last)->op_first;
2925 ((LISTOP*)last)->op_first = first;
79072805 2926 }
117dada2 2927 last->op_flags |= OPf_KIDS;
79072805
LW
2928 return last;
2929 }
2930
2931 return newLISTOP(type, 0, first, last);
2932}
2933
2934/* Constructors */
2935
eb8433b7
NC
2936#ifdef PERL_MAD
2937
2938TOKEN *
2939Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
2940{
2941 TOKEN *tk;
99129197 2942 Newxz(tk, 1, TOKEN);
eb8433b7
NC
2943 tk->tk_type = (OPCODE)optype;
2944 tk->tk_type = 12345;
2945 tk->tk_lval = lval;
2946 tk->tk_mad = madprop;
2947 return tk;
2948}
2949
2950void
2951Perl_token_free(pTHX_ TOKEN* tk)
2952{
7918f24d
NC
2953 PERL_ARGS_ASSERT_TOKEN_FREE;
2954
eb8433b7
NC
2955 if (tk->tk_type != 12345)
2956 return;
2957 mad_free(tk->tk_mad);
2958 Safefree(tk);
2959}
2960
2961void
2962Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
2963{
2964 MADPROP* mp;
2965 MADPROP* tm;
7918f24d
NC
2966
2967 PERL_ARGS_ASSERT_TOKEN_GETMAD;
2968
eb8433b7
NC
2969 if (tk->tk_type != 12345) {
2970 Perl_warner(aTHX_ packWARN(WARN_MISC),
2971 "Invalid TOKEN object ignored");
2972 return;
2973 }
2974 tm = tk->tk_mad;
2975 if (!tm)
2976 return;
2977
2978 /* faked up qw list? */
2979 if (slot == '(' &&
2980 tm->mad_type == MAD_SV &&
d503a9ba 2981 SvPVX((SV *)tm->mad_val)[0] == 'q')
eb8433b7
NC
2982 slot = 'x';
2983
2984 if (o) {
2985 mp = o->op_madprop;
2986 if (mp) {
2987 for (;;) {
2988 /* pretend constant fold didn't happen? */
2989 if (mp->mad_key == 'f' &&
2990 (o->op_type == OP_CONST ||
2991 o->op_type == OP_GV) )
2992 {
2993 token_getmad(tk,(OP*)mp->mad_val,slot);
2994 return;
2995 }
2996 if (!mp->mad_next)
2997 break;
2998 mp = mp->mad_next;
2999 }
3000 mp->mad_next = tm;
3001 mp = mp->mad_next;
3002 }
3003 else {
3004 o->op_madprop = tm;
3005 mp = o->op_madprop;
3006 }
3007 if (mp->mad_key == 'X')
3008 mp->mad_key = slot; /* just change the first one */
3009
3010 tk->tk_mad = 0;
3011 }
3012 else
3013 mad_free(tm);
3014 Safefree(tk);
3015}
3016
3017void
3018Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3019{
3020 MADPROP* mp;
3021 if (!from)
3022 return;
3023 if (o) {
3024 mp = o->op_madprop;
3025 if (mp) {
3026 for (;;) {
3027 /* pretend constant fold didn't happen? */
3028 if (mp->mad_key == 'f' &&
3029 (o->op_type == OP_CONST ||
3030 o->op_type == OP_GV) )
3031 {
3032 op_getmad(from,(OP*)mp->mad_val,slot);
3033 return;
3034 }
3035 if (!mp->mad_next)
3036 break;
3037 mp = mp->mad_next;
3038 }
3039 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3040 }
3041 else {
3042 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3043 }
3044 }
3045}
3046
3047void
3048Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3049{
3050 MADPROP* mp;
3051 if (!from)
3052 return;
3053 if (o) {
3054 mp = o->op_madprop;
3055 if (mp) {
3056 for (;;) {
3057 /* pretend constant fold didn't happen? */
3058 if (mp->mad_key == 'f' &&
3059 (o->op_type == OP_CONST ||
3060 o->op_type == OP_GV) )
3061 {
3062 op_getmad(from,(OP*)mp->mad_val,slot);
3063 return;
3064 }
3065 if (!mp->mad_next)
3066 break;
3067 mp = mp->mad_next;
3068 }
3069 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3070 }
3071 else {
3072 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3073 }
3074 }
3075 else {
99129197
NC
3076 PerlIO_printf(PerlIO_stderr(),
3077 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
eb8433b7
NC
3078 op_free(from);
3079 }
3080}
3081
3082void
3083Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3084{
3085 MADPROP* tm;
3086 if (!mp || !o)
3087 return;
3088 if (slot)
3089 mp->mad_key = slot;
3090 tm = o->op_madprop;
3091 o->op_madprop = mp;
3092 for (;;) {
3093 if (!mp->mad_next)
3094 break;
3095 mp = mp->mad_next;
3096 }
3097 mp->mad_next = tm;
3098}
3099
3100void
3101Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3102{
3103 if (!o)
3104 return;
3105 addmad(tm, &(o->op_madprop), slot);
3106}
3107
3108void
3109Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3110{
3111 MADPROP* mp;
3112 if (!tm || !root)
3113 return;
3114 if (slot)
3115 tm->mad_key = slot;
3116 mp = *root;
3117 if (!mp) {
3118 *root = tm;
3119 return;
3120 }
3121 for (;;) {
3122 if (!mp->mad_next)
3123 break;
3124 mp = mp->mad_next;
3125 }
3126 mp->mad_next = tm;
3127}
3128
3129MADPROP *
3130Perl_newMADsv(pTHX_ char key, SV* sv)
3131{
7918f24d
NC
3132 PERL_ARGS_ASSERT_NEWMADSV;
3133
eb8433b7
NC
3134 return newMADPROP(key, MAD_SV, sv, 0);
3135}
3136
3137MADPROP *
d503a9ba 3138Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
eb8433b7 3139{
c111d5f1 3140 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
eb8433b7
NC
3141 mp->mad_next = 0;
3142 mp->mad_key = key;
3143 mp->mad_vlen = vlen;
3144 mp->mad_type = type;
3145 mp->mad_val = val;
3146/* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3147 return mp;
3148}
3149
3150void
3151Perl_mad_free(pTHX_ MADPROP* mp)
3152{
3153/* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3154 if (!mp)
3155 return;
3156 if (mp->mad_next)
3157 mad_free(mp->mad_next);
bc177e6b 3158/* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
eb8433b7
NC
3159 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3160 switch (mp->mad_type) {
3161 case MAD_NULL:
3162 break;
3163 case MAD_PV:
3164 Safefree((char*)mp->mad_val);
3165 break;
3166 case MAD_OP:
3167 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3168 op_free((OP*)mp->mad_val);
3169 break;
3170 case MAD_SV:
ad64d0ec 3171 sv_free(MUTABLE_SV(mp->mad_val));
eb8433b7
NC
3172 break;
3173 default:
3174 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3175 break;
3176 }
c111d5f1 3177 PerlMemShared_free(mp);
eb8433b7
NC
3178}
3179
3180#endif
3181
d67eb5f4
Z
3182/*
3183=head1 Optree construction
3184
3185=for apidoc Am|OP *|newNULLLIST
3186
3187Constructs, checks, and returns a new C<stub> op, which represents an
3188empty list expression.
3189
3190=cut
3191*/
3192
79072805 3193OP *
864dbfa3 3194Perl_newNULLLIST(pTHX)
79072805 3195{
8990e307
LW
3196 return newOP(OP_STUB, 0);
3197}
3198
1f676739 3199static OP *
b7783a12 3200S_force_list(pTHX_ OP *o)
8990e307 3201{
11343788 3202 if (!o || o->op_type != OP_LIST)
5f66b61c 3203 o = newLISTOP(OP_LIST, 0, o, NULL);
93c66552 3204 op_null(o);
11343788 3205 return o;
79072805
LW
3206}
3207
d67eb5f4
Z
3208/*
3209=for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3210
3211Constructs, checks, and returns an op of any list type. I<type> is
3212the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3213C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3214supply up to two ops to be direct children of the list op; they are
3215consumed by this function and become part of the constructed op tree.
3216
3217=cut
3218*/
3219
79072805 3220OP *
864dbfa3 3221Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
79072805 3222{
27da23d5 3223 dVAR;
79072805
LW
3224 LISTOP *listop;
3225
e69777c1
GG
3226 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3227
b7dc083c 3228 NewOp(1101, listop, 1, LISTOP);
79072805 3229
eb160463 3230 listop->op_type = (OPCODE)type;
22c35a8c 3231 listop->op_ppaddr = PL_ppaddr[type];
117dada2
SM
3232 if (first || last)
3233 flags |= OPf_KIDS;
eb160463 3234 listop->op_flags = (U8)flags;
79072805
LW
3235
3236 if (!last && first)
3237 last = first;
3238 else if (!first && last)
3239 first = last;
8990e307
LW
3240 else if (first)
3241 first->op_sibling = last;
79072805
LW
3242 listop->op_first = first;
3243 listop->op_last = last;
8990e307 3244 if (type == OP_LIST) {
551405c4 3245 OP* const pushop = newOP(OP_PUSHMARK, 0);
8990e307
LW
3246 pushop->op_sibling = first;
3247 listop->op_first = pushop;
3248 listop->op_flags |= OPf_KIDS;
3249 if (!last)
3250 listop->op_last = pushop;
3251 }
79072805 3252
463d09e6 3253 return CHECKOP(type, listop);
79072805
LW
3254}
3255
d67eb5f4
Z
3256/*
3257=for apidoc Am|OP *|newOP|I32 type|I32 flags
3258
3259Constructs, checks, and returns an op of any base type (any type that
3260has no extra fields). I<type> is the opcode. I<flags> gives the
3261eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3262of C<op_private>.
3263
3264=cut
3265*/
3266
79072805 3267OP *
864dbfa3 3268Perl_newOP(pTHX_ I32 type, I32 flags)
79072805 3269{
27da23d5 3270 dVAR;
11343788 3271 OP *o;
e69777c1
GG
3272
3273 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3274 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3275 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3276 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3277
b7dc083c 3278 NewOp(1101, o, 1, OP);
eb160463 3279 o->op_type = (OPCODE)type;
22c35a8c 3280 o->op_ppaddr = PL_ppaddr[type];
eb160463 3281 o->op_flags = (U8)flags;
670f3923
DM
3282 o->op_latefree = 0;
3283 o->op_latefreed = 0;
7e5d8ed2 3284 o->op_attached = 0;
79072805 3285
11343788 3286 o->op_next = o;
eb160463 3287 o->op_private = (U8)(0 | (flags >> 8));
22c35a8c 3288 if (PL_opargs[type] & OA_RETSCALAR)
11343788 3289 scalar(o);
22c35a8c 3290 if (PL_opargs[type] & OA_TARGET)
11343788
MB
3291 o->op_targ = pad_alloc(type, SVs_PADTMP);
3292 return CHECKOP(type, o);
79072805
LW
3293}
3294
d67eb5f4
Z
3295/*
3296=for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3297
3298Constructs, checks, and returns an op of any unary type. I<type> is
3299the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3300C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3301bits, the eight bits of C<op_private>, except that the bit with value 1
3302is automatically set. I<first> supplies an optional op to be the direct
3303child of the unary op; it is consumed by this function and become part
3304of the constructed op tree.
3305
3306=cut
3307*/
3308
79072805 3309OP *
864dbfa3 3310Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
79072805 3311{
27da23d5 3312 dVAR;
79072805
LW
3313 UNOP *unop;
3314
e69777c1
GG
3315 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3316 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3317 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3318 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3319 || type == OP_SASSIGN
32e2a35d 3320 || type == OP_ENTERTRY
e69777c1
GG
3321 || type == OP_NULL );
3322
93a17b20 3323 if (!first)
aeea060c 3324 first = newOP(OP_STUB, 0);
22c35a8c 3325 if (PL_opargs[type] & OA_MARK)
8990e307 3326 first = force_list(first);
93a17b20 3327
b7dc083c 3328 NewOp(1101, unop, 1, UNOP);
eb160463 3329 unop->op_type = (OPCODE)type;
22c35a8c 3330 unop->op_ppaddr = PL_ppaddr[type];
79072805 3331 unop->op_first = first;
585ec06d 3332 unop->op_flags = (U8)(flags | OPf_KIDS);
eb160463 3333 unop->op_private = (U8)(1 | (flags >> 8));
e50aee73 3334 unop = (UNOP*) CHECKOP(type, unop);
79072805
LW
3335 if (unop->op_next)
3336 return (OP*)unop;
3337
a0d0e21e 3338 return fold_constants((OP *) unop);
79072805
LW
3339}
3340
d67eb5f4
Z
3341/*
3342=for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3343
3344Constructs, checks, and returns an op of any binary type. I<type>
3345is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3346that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3347the eight bits of C<op_private>, except that the bit with value 1 or
33482 is automatically set as required. I<first> and I<last> supply up to
3349two ops to be the direct children of the binary op; they are consumed
3350by this function and become part of the constructed op tree.
3351
3352=cut
3353*/
3354
79072805 3355OP *
864dbfa3 3356Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
79072805 3357{
27da23d5 3358 dVAR;
79072805 3359 BINOP *binop;
e69777c1
GG
3360
3361 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3362 || type == OP_SASSIGN || type == OP_NULL );
3363
b7dc083c 3364 NewOp(1101, binop, 1, BINOP);
79072805
LW
3365
3366 if (!first)
3367 first = newOP(OP_NULL, 0);
3368
eb160463 3369 binop->op_type = (OPCODE)type;
22c35a8c 3370 binop->op_ppaddr = PL_ppaddr[type];
79072805 3371 binop->op_first = first;
585ec06d 3372 binop->op_flags = (U8)(flags | OPf_KIDS);
79072805
LW
3373 if (!last) {
3374 last = first;
eb160463 3375 binop->op_private = (U8)(1 | (flags >> 8));
79072805
LW
3376 }
3377 else {
eb160463 3378 binop->op_private = (U8)(2 | (flags >> 8));
79072805
LW
3379 first->op_sibling = last;
3380 }
3381
e50aee73 3382 binop = (BINOP*)CHECKOP(type, binop);
eb160463 3383 if (binop->op_next || binop->op_type != (OPCODE)type)
79072805
LW
3384 return (OP*)binop;
3385
7284ab6f 3386 binop->op_last = binop->op_first->op_sibling;
79072805 3387
a0d0e21e 3388 return fold_constants((OP *)binop);
79072805
LW
3389}
3390
5f66b61c
AL
3391static int uvcompare(const void *a, const void *b)
3392 __attribute__nonnull__(1)
3393 __attribute__nonnull__(2)
3394 __attribute__pure__;
abb2c242 3395static int uvcompare(const void *a, const void *b)
2b9d42f0 3396{
e1ec3a88 3397 if (*((const UV *)a) < (*(const UV *)b))
2b9d42f0 3398 return -1;
e1ec3a88 3399 if (*((const UV *)a) > (*(const UV *)b))
2b9d42f0 3400 return 1;
e1ec3a88 3401 if (*((const UV *)a+1) < (*(const UV *)b+1))
2b9d42f0 3402 return -1;
e1ec3a88 3403 if (*((const UV *)a+1) > (*(const UV *)b+1))
2b9d42f0 3404 return 1;
a0ed51b3
LW
3405 return 0;
3406}
3407
0d86688d
NC
3408static OP *
3409S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
79072805 3410{
97aff369 3411 dVAR;
2d03de9c 3412 SV * const tstr = ((SVOP*)expr)->op_sv;
fbbb0949
DM
3413 SV * const rstr =
3414#ifdef PERL_MAD
3415 (repl->op_type == OP_NULL)
3416 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3417#endif
3418 ((SVOP*)repl)->op_sv;
463ee0b2
LW
3419 STRLEN tlen;
3420 STRLEN rlen;
5c144d81
NC
3421 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3422 const U8 *r = (U8*)SvPV_const(rstr, rlen);
79072805
LW
3423 register I32 i;
3424 register I32 j;
9b877dbb 3425 I32 grows = 0;
79072805
LW
3426 register short *tbl;
3427
551405c4
AL
3428 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3429 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3430 I32 del = o->op_private & OPpTRANS_DELETE;
043e41b8 3431 SV* swash;
7918f24d
NC
3432
3433 PERL_ARGS_ASSERT_PMTRANS;
3434
800b4dc4 3435 PL_hints |= HINT_BLOCK_SCOPE;
1c846c1f 3436
036b4402
GS
3437 if (SvUTF8(tstr))
3438 o->op_private |= OPpTRANS_FROM_UTF;
1c846c1f
NIS
3439
3440 if (SvUTF8(rstr))
036b4402 3441 o->op_private |= OPpTRANS_TO_UTF;
79072805 3442
a0ed51b3 3443 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
396482e1 3444 SV* const listsv = newSVpvs("# comment\n");
c445ea15 3445 SV* transv = NULL;
5c144d81
NC
3446 const U8* tend = t + tlen;
3447 const U8* rend = r + rlen;
ba210ebe 3448 STRLEN ulen;
84c133a0
RB
3449 UV tfirst = 1;
3450 UV tlast = 0;
3451 IV tdiff;
3452 UV rfirst = 1;
3453 UV rlast = 0;
3454 IV rdiff;
3455 IV diff;
a0ed51b3
LW
3456 I32 none = 0;
3457 U32 max = 0;
3458 I32 bits;
a0ed51b3 3459 I32 havefinal = 0;
9c5ffd7c 3460 U32 final = 0;
551405c4
AL
3461 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3462 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
bf4a1e57
JH
3463 U8* tsave = NULL;
3464 U8* rsave = NULL;
9f7f3913 3465 const U32 flags = UTF8_ALLOW_DEFAULT;
bf4a1e57
JH
3466
3467 if (!from_utf) {
3468 STRLEN len = tlen;
5c144d81 3469 t = tsave = bytes_to_utf8(t, &len);
bf4a1e57
JH
3470 tend = t + len;
3471 }
3472 if (!to_utf && rlen) {
3473 STRLEN len = rlen;
5c144d81 3474 r = rsave = bytes_to_utf8(r, &len);
bf4a1e57
JH
3475 rend = r + len;
3476 }
a0ed51b3 3477
2b9d42f0
NIS
3478/* There are several snags with this code on EBCDIC:
3479 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3480 2. scan_const() in toke.c has encoded chars in native encoding which makes
3481 ranges at least in EBCDIC 0..255 range the bottom odd.
3482*/
3483
a0ed51b3 3484 if (complement) {
89ebb4a3 3485 U8 tmpbuf[UTF8_MAXBYTES+1];
2b9d42f0 3486 UV *cp;
a0ed51b3 3487 UV nextmin = 0;
a02a5408 3488 Newx(cp, 2*tlen, UV);
a0ed51b3 3489 i = 0;
396482e1 3490 transv = newSVpvs("");
a0ed51b3 3491 while (t < tend) {
9f7f3913 3492 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
2b9d42f0
NIS
3493 t += ulen;
3494 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
a0ed51b3 3495 t++;
9f7f3913 3496 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
2b9d42f0 3497 t += ulen;
a0ed51b3 3498 }
2b9d42f0
NIS
3499 else {
3500 cp[2*i+1] = cp[2*i];
3501 }
3502 i++;
a0ed51b3 3503 }
2b9d42f0 3504 qsort(cp, i, 2*sizeof(UV), uvcompare);
a0ed51b3 3505 for (j = 0; j < i; j++) {
2b9d42f0 3506 UV val = cp[2*j];
a0ed51b3
LW
3507 diff = val - nextmin;
3508 if (diff > 0) {
9041c2e3 3509 t = uvuni_to_utf8(tmpbuf,nextmin);
dfe13c55 3510 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
a0ed51b3 3511 if (diff > 1) {
2b9d42f0 3512 U8 range_mark = UTF_TO_NATIVE(0xff);
9041c2e3 3513 t = uvuni_to_utf8(tmpbuf, val - 1);
2b9d42f0 3514 sv_catpvn(transv, (char *)&range_mark, 1);
dfe13c55 3515 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
a0ed51b3
LW
3516 }
3517 }
2b9d42f0 3518 val = cp[2*j+1];
a0ed51b3
LW
3519 if (val >= nextmin)
3520 nextmin = val + 1;
3521 }
9041c2e3 3522 t = uvuni_to_utf8(tmpbuf,nextmin);
dfe13c55 3523 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
2b9d42f0
NIS
3524 {
3525 U8 range_mark = UTF_TO_NATIVE(0xff);
3526 sv_catpvn(transv, (char *)&range_mark, 1);
3527 }
6247ead0 3528 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
dfe13c55 3529 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
93524f2b 3530 t = (const U8*)SvPVX_const(transv);
a0ed51b3
LW
3531 tlen = SvCUR(transv);
3532 tend = t + tlen;
455d824a 3533 Safefree(cp);
a0ed51b3
LW
3534 }
3535 else if (!rlen && !del) {
3536 r = t; rlen = tlen; rend = tend;
4757a243
LW
3537 }
3538 if (!squash) {
05d340b8 3539 if ((!rlen && !del) || t == r ||
12ae5dfc 3540 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
01ec43d0 3541 {
4757a243 3542 o->op_private |= OPpTRANS_IDENTICAL;
01ec43d0 3543 }
a0ed51b3
LW
3544 }
3545
3546 while (t < tend || tfirst <= tlast) {
3547 /* see if we need more "t" chars */
3548 if (tfirst > tlast) {
9f7f3913 3549 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
a0ed51b3 3550 t += ulen;
2b9d42f0 3551 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
ba210ebe 3552 t++;
9f7f3913 3553 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
a0ed51b3
LW
3554 t += ulen;
3555 }
3556 else
3557 tlast = tfirst;
3558 }
3559
3560 /* now see if we need more "r" chars */
3561 if (rfirst > rlast) {
3562 if (r < rend) {
9f7f3913 3563 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
a0ed51b3 3564 r += ulen;
2b9d42f0 3565 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
ba210ebe 3566 r++;
9f7f3913 3567 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
a0ed51b3
LW
3568 r += ulen;
3569 }
3570 else
3571 rlast = rfirst;
3572 }
3573 else {