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