Commit | Line | Data |
---|---|---|
4b88f280 | 1 | #line 2 "op.c" |
a0d0e21e | 2 | /* op.c |
79072805 | 3 | * |
1129b882 NC |
4 | * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000, |
5 | * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others | |
79072805 LW |
6 | * |
7 | * You may distribute under the terms of either the GNU General Public | |
8 | * License or the Artistic License, as specified in the README file. | |
9 | * | |
a0d0e21e LW |
10 | */ |
11 | ||
12 | /* | |
4ac71550 TC |
13 | * 'You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was |
14 | * our Mr. Bilbo's first cousin on the mother's side (her mother being the | |
15 | * youngest of the Old Took's daughters); and Mr. Drogo was his second | |
16 | * cousin. So Mr. Frodo is his first *and* second cousin, once removed | |
17 | * either way, as the saying is, if you follow me.' --the Gaffer | |
18 | * | |
19 | * [p.23 of _The Lord of the Rings_, I/i: "A Long-Expected Party"] | |
79072805 LW |
20 | */ |
21 | ||
166f8a29 DM |
22 | /* This file contains the functions that create, manipulate and optimize |
23 | * the OP structures that hold a compiled perl program. | |
24 | * | |
25 | * A Perl program is compiled into a tree of OPs. Each op contains | |
26 | * structural pointers (eg to its siblings and the next op in the | |
27 | * execution sequence), a pointer to the function that would execute the | |
28 | * op, plus any data specific to that op. For example, an OP_CONST op | |
29 | * points to the pp_const() function and to an SV containing the constant | |
30 | * value. When pp_const() is executed, its job is to push that SV onto the | |
31 | * stack. | |
32 | * | |
33 | * OPs are mainly created by the newFOO() functions, which are mainly | |
34 | * called from the parser (in perly.y) as the code is parsed. For example | |
35 | * the Perl code $a + $b * $c would cause the equivalent of the following | |
36 | * to be called (oversimplifying a bit): | |
37 | * | |
38 | * newBINOP(OP_ADD, flags, | |
39 | * newSVREF($a), | |
40 | * newBINOP(OP_MULTIPLY, flags, newSVREF($b), newSVREF($c)) | |
41 | * ) | |
42 | * | |
43 | * Note that during the build of miniperl, a temporary copy of this file | |
44 | * is made, called opmini.c. | |
45 | */ | |
ccfc67b7 | 46 | |
61b743bb DM |
47 | /* |
48 | Perl's compiler is essentially a 3-pass compiler with interleaved phases: | |
49 | ||
50 | A bottom-up pass | |
51 | A top-down pass | |
52 | An execution-order pass | |
53 | ||
54 | The bottom-up pass is represented by all the "newOP" routines and | |
55 | the ck_ routines. The bottom-upness is actually driven by yacc. | |
56 | So at the point that a ck_ routine fires, we have no idea what the | |
57 | context is, either upward in the syntax tree, or either forward or | |
58 | backward in the execution order. (The bottom-up parser builds that | |
59 | part of the execution order it knows about, but if you follow the "next" | |
60 | links around, you'll find it's actually a closed loop through the | |
ef9da979 | 61 | top level node.) |
61b743bb DM |
62 | |
63 | Whenever the bottom-up parser gets to a node that supplies context to | |
64 | its components, it invokes that portion of the top-down pass that applies | |
65 | to that part of the subtree (and marks the top node as processed, so | |
66 | if a node further up supplies context, it doesn't have to take the | |
67 | plunge again). As a particular subcase of this, as the new node is | |
68 | built, it takes all the closed execution loops of its subcomponents | |
69 | and links them into a new closed loop for the higher level node. But | |
70 | it's still not the real execution order. | |
71 | ||
72 | The actual execution order is not known till we get a grammar reduction | |
73 | to a top-level unit like a subroutine or file that will be called by | |
74 | "name" rather than via a "next" pointer. At that point, we can call | |
75 | into peep() to do that code's portion of the 3rd pass. It has to be | |
76 | recursive, but it's recursive on basic blocks, not on tree nodes. | |
77 | */ | |
78 | ||
06e0342d | 79 | /* To implement user lexical pragmas, there needs to be a way at run time to |
b3ca2e83 NC |
80 | get the compile time state of %^H for that block. Storing %^H in every |
81 | block (or even COP) would be very expensive, so a different approach is | |
82 | taken. The (running) state of %^H is serialised into a tree of HE-like | |
83 | structs. Stores into %^H are chained onto the current leaf as a struct | |
84 | refcounted_he * with the key and the value. Deletes from %^H are saved | |
85 | with a value of PL_sv_placeholder. The state of %^H at any point can be | |
86 | turned back into a regular HV by walking back up the tree from that point's | |
06e0342d | 87 | leaf, ignoring any key you've already seen (placeholder or not), storing |
b3ca2e83 NC |
88 | the rest into the HV structure, then removing the placeholders. Hence |
89 | memory is only used to store the %^H deltas from the enclosing COP, rather | |
90 | than the entire %^H on each COP. | |
91 | ||
92 | To cause actions on %^H to write out the serialisation records, it has | |
93 | magic type 'H'. This magic (itself) does nothing, but its presence causes | |
94 | the values to gain magic type 'h', which has entries for set and clear. | |
c28fe1ec | 95 | C<Perl_magic_sethint> updates C<PL_compiling.cop_hints_hash> with a store |
34795b44 | 96 | record, with deletes written by C<Perl_magic_clearhint>. C<SAVEHINTS> |
c28fe1ec NC |
97 | saves the current C<PL_compiling.cop_hints_hash> on the save stack, so that |
98 | it will be correctly restored when any inner compiling scope is exited. | |
b3ca2e83 NC |
99 | */ |
100 | ||
79072805 | 101 | #include "EXTERN.h" |
864dbfa3 | 102 | #define PERL_IN_OP_C |
79072805 | 103 | #include "perl.h" |
77ca0c92 | 104 | #include "keywords.h" |
79072805 | 105 | |
16c91539 | 106 | #define CALL_PEEP(o) PL_peepp(aTHX_ o) |
1a0a2ba9 | 107 | #define CALL_RPEEP(o) PL_rpeepp(aTHX_ o) |
16c91539 | 108 | #define CALL_OPFREEHOOK(o) if (PL_opfreehook) PL_opfreehook(aTHX_ o) |
a2efc822 | 109 | |
238a4c30 NIS |
110 | #if defined(PL_OP_SLAB_ALLOC) |
111 | ||
f1fac472 NC |
112 | #ifdef PERL_DEBUG_READONLY_OPS |
113 | # define PERL_SLAB_SIZE 4096 | |
114 | # include <sys/mman.h> | |
115 | #endif | |
116 | ||
238a4c30 NIS |
117 | #ifndef PERL_SLAB_SIZE |
118 | #define PERL_SLAB_SIZE 2048 | |
119 | #endif | |
120 | ||
c7e45529 | 121 | void * |
e91d68d5 | 122 | Perl_Slab_Alloc(pTHX_ size_t sz) |
1c846c1f | 123 | { |
5186cc12 | 124 | dVAR; |
5a8e194f NIS |
125 | /* |
126 | * To make incrementing use count easy PL_OpSlab is an I32 * | |
127 | * To make inserting the link to slab PL_OpPtr is I32 ** | |
128 | * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments | |
129 | * Add an overhead for pointer to slab and round up as a number of pointers | |
130 | */ | |
131 | sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *); | |
238a4c30 | 132 | if ((PL_OpSpace -= sz) < 0) { |
f1fac472 NC |
133 | #ifdef PERL_DEBUG_READONLY_OPS |
134 | /* We need to allocate chunk by chunk so that we can control the VM | |
135 | mapping */ | |
5186cc12 | 136 | PL_OpPtr = (I32**) mmap(0, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE, |
f1fac472 NC |
137 | MAP_ANON|MAP_PRIVATE, -1, 0); |
138 | ||
139 | DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n", | |
140 | (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), | |
141 | PL_OpPtr)); | |
142 | if(PL_OpPtr == MAP_FAILED) { | |
143 | perror("mmap failed"); | |
144 | abort(); | |
145 | } | |
146 | #else | |
277e868c NC |
147 | |
148 | PL_OpPtr = (I32 **) PerlMemShared_calloc(PERL_SLAB_SIZE,sizeof(I32*)); | |
f1fac472 | 149 | #endif |
083fcd59 | 150 | if (!PL_OpPtr) { |
238a4c30 NIS |
151 | return NULL; |
152 | } | |
5a8e194f NIS |
153 | /* We reserve the 0'th I32 sized chunk as a use count */ |
154 | PL_OpSlab = (I32 *) PL_OpPtr; | |
155 | /* Reduce size by the use count word, and by the size we need. | |
156 | * Latter is to mimic the '-=' in the if() above | |
157 | */ | |
158 | PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz; | |
238a4c30 NIS |
159 | /* Allocation pointer starts at the top. |
160 | Theory: because we build leaves before trunk allocating at end | |
161 | means that at run time access is cache friendly upward | |
162 | */ | |
5a8e194f | 163 | PL_OpPtr += PERL_SLAB_SIZE; |
f1fac472 NC |
164 | |
165 | #ifdef PERL_DEBUG_READONLY_OPS | |
166 | /* We remember this slab. */ | |
167 | /* This implementation isn't efficient, but it is simple. */ | |
5186cc12 | 168 | PL_slabs = (I32**) realloc(PL_slabs, sizeof(I32**) * (PL_slab_count + 1)); |
f1fac472 NC |
169 | PL_slabs[PL_slab_count++] = PL_OpSlab; |
170 | DEBUG_m(PerlIO_printf(Perl_debug_log, "Allocate %p\n", PL_OpSlab)); | |
171 | #endif | |
238a4c30 NIS |
172 | } |
173 | assert( PL_OpSpace >= 0 ); | |
174 | /* Move the allocation pointer down */ | |
175 | PL_OpPtr -= sz; | |
5a8e194f | 176 | assert( PL_OpPtr > (I32 **) PL_OpSlab ); |
238a4c30 NIS |
177 | *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */ |
178 | (*PL_OpSlab)++; /* Increment use count of slab */ | |
5a8e194f | 179 | assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) ); |
238a4c30 NIS |
180 | assert( *PL_OpSlab > 0 ); |
181 | return (void *)(PL_OpPtr + 1); | |
182 | } | |
183 | ||
f1fac472 NC |
184 | #ifdef PERL_DEBUG_READONLY_OPS |
185 | void | |
186 | Perl_pending_Slabs_to_ro(pTHX) { | |
187 | /* Turn all the allocated op slabs read only. */ | |
188 | U32 count = PL_slab_count; | |
189 | I32 **const slabs = PL_slabs; | |
190 | ||
191 | /* Reset the array of pending OP slabs, as we're about to turn this lot | |
192 | read only. Also, do it ahead of the loop in case the warn triggers, | |
193 | and a warn handler has an eval */ | |
194 | ||
f1fac472 NC |
195 | PL_slabs = NULL; |
196 | PL_slab_count = 0; | |
197 | ||
198 | /* Force a new slab for any further allocation. */ | |
199 | PL_OpSpace = 0; | |
200 | ||
201 | while (count--) { | |
5892a4d4 | 202 | void *const start = slabs[count]; |
f1fac472 NC |
203 | const size_t size = PERL_SLAB_SIZE* sizeof(I32*); |
204 | if(mprotect(start, size, PROT_READ)) { | |
205 | Perl_warn(aTHX_ "mprotect for %p %lu failed with %d", | |
206 | start, (unsigned long) size, errno); | |
207 | } | |
208 | } | |
5892a4d4 NC |
209 | |
210 | free(slabs); | |
f1fac472 NC |
211 | } |
212 | ||
213 | STATIC void | |
214 | S_Slab_to_rw(pTHX_ void *op) | |
215 | { | |
216 | I32 * const * const ptr = (I32 **) op; | |
217 | I32 * const slab = ptr[-1]; | |
7918f24d NC |
218 | |
219 | PERL_ARGS_ASSERT_SLAB_TO_RW; | |
220 | ||
f1fac472 NC |
221 | assert( ptr-1 > (I32 **) slab ); |
222 | assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) ); | |
223 | assert( *slab > 0 ); | |
224 | if(mprotect(slab, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE)) { | |
225 | Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d", | |
226 | slab, (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), errno); | |
227 | } | |
228 | } | |
fc97af9c NC |
229 | |
230 | OP * | |
231 | Perl_op_refcnt_inc(pTHX_ OP *o) | |
232 | { | |
233 | if(o) { | |
234 | Slab_to_rw(o); | |
235 | ++o->op_targ; | |
236 | } | |
237 | return o; | |
238 | ||
239 | } | |
240 | ||
241 | PADOFFSET | |
242 | Perl_op_refcnt_dec(pTHX_ OP *o) | |
243 | { | |
7918f24d | 244 | PERL_ARGS_ASSERT_OP_REFCNT_DEC; |
fc97af9c NC |
245 | Slab_to_rw(o); |
246 | return --o->op_targ; | |
247 | } | |
f1fac472 NC |
248 | #else |
249 | # define Slab_to_rw(op) | |
250 | #endif | |
251 | ||
c7e45529 AE |
252 | void |
253 | Perl_Slab_Free(pTHX_ void *op) | |
238a4c30 | 254 | { |
551405c4 | 255 | I32 * const * const ptr = (I32 **) op; |
aec46f14 | 256 | I32 * const slab = ptr[-1]; |
7918f24d | 257 | PERL_ARGS_ASSERT_SLAB_FREE; |
5a8e194f NIS |
258 | assert( ptr-1 > (I32 **) slab ); |
259 | assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) ); | |
238a4c30 | 260 | assert( *slab > 0 ); |
f1fac472 | 261 | Slab_to_rw(op); |
238a4c30 | 262 | if (--(*slab) == 0) { |
7e4e8c89 NC |
263 | # ifdef NETWARE |
264 | # define PerlMemShared PerlMem | |
265 | # endif | |
083fcd59 | 266 | |
f1fac472 | 267 | #ifdef PERL_DEBUG_READONLY_OPS |
782a40f1 | 268 | U32 count = PL_slab_count; |
f1fac472 | 269 | /* Need to remove this slab from our list of slabs */ |
782a40f1 | 270 | if (count) { |
f1fac472 NC |
271 | while (count--) { |
272 | if (PL_slabs[count] == slab) { | |
5186cc12 | 273 | dVAR; |
f1fac472 NC |
274 | /* Found it. Move the entry at the end to overwrite it. */ |
275 | DEBUG_m(PerlIO_printf(Perl_debug_log, | |
276 | "Deallocate %p by moving %p from %lu to %lu\n", | |
277 | PL_OpSlab, | |
278 | PL_slabs[PL_slab_count - 1], | |
279 | PL_slab_count, count)); | |
280 | PL_slabs[count] = PL_slabs[--PL_slab_count]; | |
281 | /* Could realloc smaller at this point, but probably not | |
282 | worth it. */ | |
fc97af9c NC |
283 | if(munmap(slab, PERL_SLAB_SIZE*sizeof(I32*))) { |
284 | perror("munmap failed"); | |
285 | abort(); | |
286 | } | |
287 | break; | |
f1fac472 | 288 | } |
f1fac472 NC |
289 | } |
290 | } | |
291 | #else | |
083fcd59 | 292 | PerlMemShared_free(slab); |
f1fac472 | 293 | #endif |
238a4c30 NIS |
294 | if (slab == PL_OpSlab) { |
295 | PL_OpSpace = 0; | |
296 | } | |
297 | } | |
b7dc083c | 298 | } |
b7dc083c | 299 | #endif |
e50aee73 | 300 | /* |
ce6f1cbc | 301 | * In the following definition, the ", (OP*)0" is just to make the compiler |
a5f75d66 | 302 | * think the expression is of the right type: croak actually does a Siglongjmp. |
e50aee73 | 303 | */ |
11343788 | 304 | #define CHECKOP(type,o) \ |
ce6f1cbc | 305 | ((PL_op_mask && PL_op_mask[type]) \ |
5dc0d613 | 306 | ? ( op_free((OP*)o), \ |
cb77fdf0 | 307 | Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \ |
ce6f1cbc | 308 | (OP*)0 ) \ |
16c91539 | 309 | : PL_check[type](aTHX_ (OP*)o)) |
e50aee73 | 310 | |
e6438c1a | 311 | #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2) |
c53d7c7d | 312 | |
8b6b16e7 | 313 | STATIC const char* |
cea2e8a9 | 314 | S_gv_ename(pTHX_ GV *gv) |
4633a7c4 | 315 | { |
46c461b5 | 316 | SV* const tmpsv = sv_newmortal(); |
7918f24d NC |
317 | |
318 | PERL_ARGS_ASSERT_GV_ENAME; | |
319 | ||
bd61b366 | 320 | gv_efullname3(tmpsv, gv, NULL); |
8b6b16e7 | 321 | return SvPV_nolen_const(tmpsv); |
4633a7c4 LW |
322 | } |
323 | ||
76e3520e | 324 | STATIC OP * |
cea2e8a9 | 325 | S_no_fh_allowed(pTHX_ OP *o) |
79072805 | 326 | { |
7918f24d NC |
327 | PERL_ARGS_ASSERT_NO_FH_ALLOWED; |
328 | ||
cea2e8a9 | 329 | yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function", |
53e06cf0 | 330 | OP_DESC(o))); |
11343788 | 331 | return o; |
79072805 LW |
332 | } |
333 | ||
76e3520e | 334 | STATIC OP * |
bfed75c6 | 335 | S_too_few_arguments(pTHX_ OP *o, const char *name) |
79072805 | 336 | { |
7918f24d NC |
337 | PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS; |
338 | ||
cea2e8a9 | 339 | yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name)); |
11343788 | 340 | return o; |
79072805 LW |
341 | } |
342 | ||
76e3520e | 343 | STATIC OP * |
bfed75c6 | 344 | S_too_many_arguments(pTHX_ OP *o, const char *name) |
79072805 | 345 | { |
7918f24d NC |
346 | PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS; |
347 | ||
cea2e8a9 | 348 | yyerror(Perl_form(aTHX_ "Too many arguments for %s", name)); |
11343788 | 349 | return o; |
79072805 LW |
350 | } |
351 | ||
76e3520e | 352 | STATIC void |
6867be6d | 353 | S_bad_type(pTHX_ I32 n, const char *t, const char *name, const OP *kid) |
8990e307 | 354 | { |
7918f24d NC |
355 | PERL_ARGS_ASSERT_BAD_TYPE; |
356 | ||
cea2e8a9 | 357 | yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)", |
53e06cf0 | 358 | (int)n, name, t, OP_DESC(kid))); |
8990e307 LW |
359 | } |
360 | ||
7a52d87a | 361 | STATIC void |
6867be6d | 362 | S_no_bareword_allowed(pTHX_ const OP *o) |
7a52d87a | 363 | { |
7918f24d NC |
364 | PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED; |
365 | ||
eb8433b7 NC |
366 | if (PL_madskills) |
367 | return; /* various ok barewords are hidden in extra OP_NULL */ | |
5a844595 | 368 | qerror(Perl_mess(aTHX_ |
35c1215d | 369 | "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use", |
be2597df | 370 | SVfARG(cSVOPo_sv))); |
7a52d87a GS |
371 | } |
372 | ||
79072805 LW |
373 | /* "register" allocation */ |
374 | ||
375 | PADOFFSET | |
d6447115 | 376 | Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags) |
93a17b20 | 377 | { |
97aff369 | 378 | dVAR; |
a0d0e21e | 379 | PADOFFSET off; |
12bd6ede | 380 | const bool is_our = (PL_parser->in_my == KEY_our); |
a0d0e21e | 381 | |
7918f24d NC |
382 | PERL_ARGS_ASSERT_ALLOCMY; |
383 | ||
d6447115 NC |
384 | if (flags) |
385 | Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf, | |
386 | (UV)flags); | |
387 | ||
388 | /* Until we're using the length for real, cross check that we're being | |
389 | told the truth. */ | |
390 | assert(strlen(name) == len); | |
391 | ||
59f00321 | 392 | /* complain about "my $<special_var>" etc etc */ |
d6447115 | 393 | if (len && |
3edf23ff | 394 | !(is_our || |
155aba94 | 395 | isALPHA(name[1]) || |
39e02b42 | 396 | (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) || |
d6447115 | 397 | (name[1] == '_' && (*name == '$' || len > 2)))) |
834a4ddd | 398 | { |
6b58708b | 399 | /* name[2] is true if strlen(name) > 2 */ |
c4d0567e | 400 | if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) { |
d6447115 NC |
401 | yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"", |
402 | name[0], toCTRL(name[1]), (int)(len - 2), name + 2, | |
aab6a793 | 403 | PL_parser->in_my == KEY_state ? "state" : "my")); |
d1544d85 | 404 | } else { |
d6447115 | 405 | yyerror(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name, |
aab6a793 | 406 | PL_parser->in_my == KEY_state ? "state" : "my")); |
46fc3d4c | 407 | } |
a0d0e21e | 408 | } |
748a9306 | 409 | |
dd2155a4 | 410 | /* allocate a spare slot and store the name in that slot */ |
93a17b20 | 411 | |
cca43f78 | 412 | off = pad_add_name(name, len, |
59cfed7d NC |
413 | is_our ? padadd_OUR : |
414 | PL_parser->in_my == KEY_state ? padadd_STATE : 0, | |
12bd6ede | 415 | PL_parser->in_my_stash, |
3edf23ff | 416 | (is_our |
133706a6 RGS |
417 | /* $_ is always in main::, even with our */ |
418 | ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash) | |
5c284bb0 | 419 | : NULL |
cca43f78 | 420 | ) |
dd2155a4 | 421 | ); |
a74073ad DM |
422 | /* anon sub prototypes contains state vars should always be cloned, |
423 | * otherwise the state var would be shared between anon subs */ | |
424 | ||
425 | if (PL_parser->in_my == KEY_state && CvANON(PL_compcv)) | |
426 | CvCLONE_on(PL_compcv); | |
427 | ||
dd2155a4 | 428 | return off; |
79072805 LW |
429 | } |
430 | ||
d2c837a0 DM |
431 | /* free the body of an op without examining its contents. |
432 | * Always use this rather than FreeOp directly */ | |
433 | ||
4136a0f7 | 434 | static void |
d2c837a0 DM |
435 | S_op_destroy(pTHX_ OP *o) |
436 | { | |
437 | if (o->op_latefree) { | |
438 | o->op_latefreed = 1; | |
439 | return; | |
440 | } | |
441 | FreeOp(o); | |
442 | } | |
443 | ||
c4bd3ae5 NC |
444 | #ifdef USE_ITHREADS |
445 | # define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b) | |
446 | #else | |
447 | # define forget_pmop(a,b) S_forget_pmop(aTHX_ a) | |
448 | #endif | |
d2c837a0 | 449 | |
79072805 LW |
450 | /* Destructor */ |
451 | ||
452 | void | |
864dbfa3 | 453 | Perl_op_free(pTHX_ OP *o) |
79072805 | 454 | { |
27da23d5 | 455 | dVAR; |
acb36ea4 | 456 | OPCODE type; |
79072805 | 457 | |
85594c31 | 458 | if (!o) |
79072805 | 459 | return; |
670f3923 DM |
460 | if (o->op_latefreed) { |
461 | if (o->op_latefree) | |
462 | return; | |
463 | goto do_free; | |
464 | } | |
79072805 | 465 | |
67566ccd | 466 | type = o->op_type; |
7934575e | 467 | if (o->op_private & OPpREFCOUNTED) { |
67566ccd | 468 | switch (type) { |
7934575e GS |
469 | case OP_LEAVESUB: |
470 | case OP_LEAVESUBLV: | |
471 | case OP_LEAVEEVAL: | |
472 | case OP_LEAVE: | |
473 | case OP_SCOPE: | |
474 | case OP_LEAVEWRITE: | |
67566ccd AL |
475 | { |
476 | PADOFFSET refcnt; | |
7934575e | 477 | OP_REFCNT_LOCK; |
4026c95a | 478 | refcnt = OpREFCNT_dec(o); |
7934575e | 479 | OP_REFCNT_UNLOCK; |
bfd0ff22 NC |
480 | if (refcnt) { |
481 | /* Need to find and remove any pattern match ops from the list | |
482 | we maintain for reset(). */ | |
483 | find_and_forget_pmops(o); | |
4026c95a | 484 | return; |
67566ccd | 485 | } |
bfd0ff22 | 486 | } |
7934575e GS |
487 | break; |
488 | default: | |
489 | break; | |
490 | } | |
491 | } | |
492 | ||
f37b8c3f VP |
493 | /* Call the op_free hook if it has been set. Do it now so that it's called |
494 | * at the right time for refcounted ops, but still before all of the kids | |
495 | * are freed. */ | |
496 | CALL_OPFREEHOOK(o); | |
497 | ||
11343788 | 498 | if (o->op_flags & OPf_KIDS) { |
6867be6d | 499 | register OP *kid, *nextkid; |
11343788 | 500 | for (kid = cUNOPo->op_first; kid; kid = nextkid) { |
85e6fe83 | 501 | nextkid = kid->op_sibling; /* Get before next freeing kid */ |
79072805 | 502 | op_free(kid); |
85e6fe83 | 503 | } |
79072805 | 504 | } |
acb36ea4 | 505 | |
fc97af9c NC |
506 | #ifdef PERL_DEBUG_READONLY_OPS |
507 | Slab_to_rw(o); | |
508 | #endif | |
509 | ||
acb36ea4 GS |
510 | /* COP* is not cleared by op_clear() so that we may track line |
511 | * numbers etc even after null() */ | |
cc93af5f RGS |
512 | if (type == OP_NEXTSTATE || type == OP_DBSTATE |
513 | || (type == OP_NULL /* the COP might have been null'ed */ | |
514 | && ((OPCODE)o->op_targ == OP_NEXTSTATE | |
515 | || (OPCODE)o->op_targ == OP_DBSTATE))) { | |
acb36ea4 | 516 | cop_free((COP*)o); |
3235b7a3 | 517 | } |
acb36ea4 | 518 | |
c53f1caa RU |
519 | if (type == OP_NULL) |
520 | type = (OPCODE)o->op_targ; | |
521 | ||
acb36ea4 | 522 | op_clear(o); |
670f3923 DM |
523 | if (o->op_latefree) { |
524 | o->op_latefreed = 1; | |
525 | return; | |
526 | } | |
527 | do_free: | |
238a4c30 | 528 | FreeOp(o); |
4d494880 DM |
529 | #ifdef DEBUG_LEAKING_SCALARS |
530 | if (PL_op == o) | |
5f66b61c | 531 | PL_op = NULL; |
4d494880 | 532 | #endif |
acb36ea4 | 533 | } |
79072805 | 534 | |
93c66552 DM |
535 | void |
536 | Perl_op_clear(pTHX_ OP *o) | |
acb36ea4 | 537 | { |
13137afc | 538 | |
27da23d5 | 539 | dVAR; |
7918f24d NC |
540 | |
541 | PERL_ARGS_ASSERT_OP_CLEAR; | |
542 | ||
eb8433b7 NC |
543 | #ifdef PERL_MAD |
544 | /* if (o->op_madprop && o->op_madprop->mad_next) | |
545 | abort(); */ | |
3cc8d589 NC |
546 | /* FIXME for MAD - if I uncomment these two lines t/op/pack.t fails with |
547 | "modification of a read only value" for a reason I can't fathom why. | |
548 | It's the "" stringification of $_, where $_ was set to '' in a foreach | |
04a4d38e NC |
549 | loop, but it defies simplification into a small test case. |
550 | However, commenting them out has caused ext/List/Util/t/weak.t to fail | |
551 | the last test. */ | |
3cc8d589 NC |
552 | /* |
553 | mad_free(o->op_madprop); | |
554 | o->op_madprop = 0; | |
555 | */ | |
eb8433b7 NC |
556 | #endif |
557 | ||
558 | retry: | |
11343788 | 559 | switch (o->op_type) { |
acb36ea4 | 560 | case OP_NULL: /* Was holding old type, if any. */ |
eb8433b7 | 561 | if (PL_madskills && o->op_targ != OP_NULL) { |
61a59f30 | 562 | o->op_type = (Optype)o->op_targ; |
eb8433b7 NC |
563 | o->op_targ = 0; |
564 | goto retry; | |
565 | } | |
4d193d44 | 566 | case OP_ENTERTRY: |
acb36ea4 | 567 | case OP_ENTEREVAL: /* Was holding hints. */ |
acb36ea4 | 568 | o->op_targ = 0; |
a0d0e21e | 569 | break; |
a6006777 | 570 | default: |
ac4c12e7 | 571 | if (!(o->op_flags & OPf_REF) |
ef69c8fc | 572 | || (PL_check[o->op_type] != Perl_ck_ftst)) |
a6006777 | 573 | break; |
574 | /* FALL THROUGH */ | |
463ee0b2 | 575 | case OP_GVSV: |
79072805 | 576 | case OP_GV: |
a6006777 | 577 | case OP_AELEMFAST: |
6a077020 DM |
578 | if (! (o->op_type == OP_AELEMFAST && o->op_flags & OPf_SPECIAL)) { |
579 | /* not an OP_PADAV replacement */ | |
f7461760 Z |
580 | GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV) |
581 | #ifdef USE_ITHREADS | |
582 | && PL_curpad | |
583 | #endif | |
584 | ? cGVOPo_gv : NULL; | |
b327b36f NC |
585 | /* It's possible during global destruction that the GV is freed |
586 | before the optree. Whilst the SvREFCNT_inc is happy to bump from | |
587 | 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0 | |
588 | will trigger an assertion failure, because the entry to sv_clear | |
589 | checks that the scalar is not already freed. A check of for | |
590 | !SvIS_FREED(gv) turns out to be invalid, because during global | |
591 | destruction the reference count can be forced down to zero | |
592 | (with SVf_BREAK set). In which case raising to 1 and then | |
593 | dropping to 0 triggers cleanup before it should happen. I | |
594 | *think* that this might actually be a general, systematic, | |
595 | weakness of the whole idea of SVf_BREAK, in that code *is* | |
596 | allowed to raise and lower references during global destruction, | |
597 | so any *valid* code that happens to do this during global | |
598 | destruction might well trigger premature cleanup. */ | |
599 | bool still_valid = gv && SvREFCNT(gv); | |
600 | ||
601 | if (still_valid) | |
602 | SvREFCNT_inc_simple_void(gv); | |
350de78d | 603 | #ifdef USE_ITHREADS |
6a077020 DM |
604 | if (cPADOPo->op_padix > 0) { |
605 | /* No GvIN_PAD_off(cGVOPo_gv) here, because other references | |
606 | * may still exist on the pad */ | |
607 | pad_swipe(cPADOPo->op_padix, TRUE); | |
608 | cPADOPo->op_padix = 0; | |
609 | } | |
350de78d | 610 | #else |
6a077020 | 611 | SvREFCNT_dec(cSVOPo->op_sv); |
a0714e2c | 612 | cSVOPo->op_sv = NULL; |
350de78d | 613 | #endif |
b327b36f | 614 | if (still_valid) { |
f7461760 Z |
615 | int try_downgrade = SvREFCNT(gv) == 2; |
616 | SvREFCNT_dec(gv); | |
617 | if (try_downgrade) | |
618 | gv_try_downgrade(gv); | |
619 | } | |
6a077020 | 620 | } |
79072805 | 621 | break; |
a1ae71d2 | 622 | case OP_METHOD_NAMED: |
79072805 | 623 | case OP_CONST: |
996c9baa | 624 | case OP_HINTSEVAL: |
11343788 | 625 | SvREFCNT_dec(cSVOPo->op_sv); |
a0714e2c | 626 | cSVOPo->op_sv = NULL; |
3b1c21fa AB |
627 | #ifdef USE_ITHREADS |
628 | /** Bug #15654 | |
629 | Even if op_clear does a pad_free for the target of the op, | |
6a077020 | 630 | pad_free doesn't actually remove the sv that exists in the pad; |
3b1c21fa AB |
631 | instead it lives on. This results in that it could be reused as |
632 | a target later on when the pad was reallocated. | |
633 | **/ | |
634 | if(o->op_targ) { | |
635 | pad_swipe(o->op_targ,1); | |
636 | o->op_targ = 0; | |
637 | } | |
638 | #endif | |
79072805 | 639 | break; |
748a9306 LW |
640 | case OP_GOTO: |
641 | case OP_NEXT: | |
642 | case OP_LAST: | |
643 | case OP_REDO: | |
11343788 | 644 | if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS)) |
748a9306 LW |
645 | break; |
646 | /* FALL THROUGH */ | |
a0d0e21e | 647 | case OP_TRANS: |
acb36ea4 | 648 | if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) { |
043e41b8 DM |
649 | #ifdef USE_ITHREADS |
650 | if (cPADOPo->op_padix > 0) { | |
651 | pad_swipe(cPADOPo->op_padix, TRUE); | |
652 | cPADOPo->op_padix = 0; | |
653 | } | |
654 | #else | |
a0ed51b3 | 655 | SvREFCNT_dec(cSVOPo->op_sv); |
a0714e2c | 656 | cSVOPo->op_sv = NULL; |
043e41b8 | 657 | #endif |
acb36ea4 GS |
658 | } |
659 | else { | |
ea71c68d | 660 | PerlMemShared_free(cPVOPo->op_pv); |
bd61b366 | 661 | cPVOPo->op_pv = NULL; |
acb36ea4 | 662 | } |
a0d0e21e LW |
663 | break; |
664 | case OP_SUBST: | |
20e98b0f | 665 | op_free(cPMOPo->op_pmreplrootu.op_pmreplroot); |
971a9dd3 | 666 | goto clear_pmop; |
748a9306 | 667 | case OP_PUSHRE: |
971a9dd3 | 668 | #ifdef USE_ITHREADS |
20e98b0f | 669 | if (cPMOPo->op_pmreplrootu.op_pmtargetoff) { |
dd2155a4 DM |
670 | /* No GvIN_PAD_off here, because other references may still |
671 | * exist on the pad */ | |
20e98b0f | 672 | pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE); |
971a9dd3 GS |
673 | } |
674 | #else | |
ad64d0ec | 675 | SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv)); |
971a9dd3 GS |
676 | #endif |
677 | /* FALL THROUGH */ | |
a0d0e21e | 678 | case OP_MATCH: |
8782bef2 | 679 | case OP_QR: |
971a9dd3 | 680 | clear_pmop: |
c2b1997a | 681 | forget_pmop(cPMOPo, 1); |
20e98b0f | 682 | cPMOPo->op_pmreplrootu.op_pmreplroot = NULL; |
9cddf794 NC |
683 | /* we use the same protection as the "SAFE" version of the PM_ macros |
684 | * here since sv_clean_all might release some PMOPs | |
5f8cb046 DM |
685 | * after PL_regex_padav has been cleared |
686 | * and the clearing of PL_regex_padav needs to | |
687 | * happen before sv_clean_all | |
688 | */ | |
13137afc AB |
689 | #ifdef USE_ITHREADS |
690 | if(PL_regex_pad) { /* We could be in destruction */ | |
402d2eb1 | 691 | const IV offset = (cPMOPo)->op_pmoffset; |
9cddf794 | 692 | ReREFCNT_dec(PM_GETRE(cPMOPo)); |
402d2eb1 NC |
693 | PL_regex_pad[offset] = &PL_sv_undef; |
694 | sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset, | |
695 | sizeof(offset)); | |
13137afc | 696 | } |
9cddf794 NC |
697 | #else |
698 | ReREFCNT_dec(PM_GETRE(cPMOPo)); | |
699 | PM_SETRE(cPMOPo, NULL); | |
1eb1540c | 700 | #endif |
13137afc | 701 | |
a0d0e21e | 702 | break; |
79072805 LW |
703 | } |
704 | ||
743e66e6 | 705 | if (o->op_targ > 0) { |
11343788 | 706 | pad_free(o->op_targ); |
743e66e6 GS |
707 | o->op_targ = 0; |
708 | } | |
79072805 LW |
709 | } |
710 | ||
76e3520e | 711 | STATIC void |
3eb57f73 HS |
712 | S_cop_free(pTHX_ COP* cop) |
713 | { | |
7918f24d NC |
714 | PERL_ARGS_ASSERT_COP_FREE; |
715 | ||
05ec9bb3 NIS |
716 | CopFILE_free(cop); |
717 | CopSTASH_free(cop); | |
0453d815 | 718 | if (! specialWARN(cop->cop_warnings)) |
72dc9ed5 | 719 | PerlMemShared_free(cop->cop_warnings); |
c28fe1ec | 720 | Perl_refcounted_he_free(aTHX_ cop->cop_hints_hash); |
3eb57f73 HS |
721 | } |
722 | ||
c2b1997a | 723 | STATIC void |
c4bd3ae5 NC |
724 | S_forget_pmop(pTHX_ PMOP *const o |
725 | #ifdef USE_ITHREADS | |
726 | , U32 flags | |
727 | #endif | |
728 | ) | |
c2b1997a NC |
729 | { |
730 | HV * const pmstash = PmopSTASH(o); | |
7918f24d NC |
731 | |
732 | PERL_ARGS_ASSERT_FORGET_PMOP; | |
733 | ||
c2b1997a | 734 | if (pmstash && !SvIS_FREED(pmstash)) { |
ad64d0ec | 735 | MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab); |
c2b1997a NC |
736 | if (mg) { |
737 | PMOP **const array = (PMOP**) mg->mg_ptr; | |
738 | U32 count = mg->mg_len / sizeof(PMOP**); | |
739 | U32 i = count; | |
740 | ||
741 | while (i--) { | |
742 | if (array[i] == o) { | |
743 | /* Found it. Move the entry at the end to overwrite it. */ | |
744 | array[i] = array[--count]; | |
745 | mg->mg_len = count * sizeof(PMOP**); | |
746 | /* Could realloc smaller at this point always, but probably | |
747 | not worth it. Probably worth free()ing if we're the | |
748 | last. */ | |
749 | if(!count) { | |
750 | Safefree(mg->mg_ptr); | |
751 | mg->mg_ptr = NULL; | |
752 | } | |
753 | break; | |
754 | } | |
755 | } | |
756 | } | |
757 | } | |
1cdf7faf NC |
758 | if (PL_curpm == o) |
759 | PL_curpm = NULL; | |
c4bd3ae5 | 760 | #ifdef USE_ITHREADS |
c2b1997a NC |
761 | if (flags) |
762 | PmopSTASH_free(o); | |
c4bd3ae5 | 763 | #endif |
c2b1997a NC |
764 | } |
765 | ||
bfd0ff22 NC |
766 | STATIC void |
767 | S_find_and_forget_pmops(pTHX_ OP *o) | |
768 | { | |
7918f24d NC |
769 | PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS; |
770 | ||
bfd0ff22 NC |
771 | if (o->op_flags & OPf_KIDS) { |
772 | OP *kid = cUNOPo->op_first; | |
773 | while (kid) { | |
774 | switch (kid->op_type) { | |
775 | case OP_SUBST: | |
776 | case OP_PUSHRE: | |
777 | case OP_MATCH: | |
778 | case OP_QR: | |
779 | forget_pmop((PMOP*)kid, 0); | |
780 | } | |
781 | find_and_forget_pmops(kid); | |
782 | kid = kid->op_sibling; | |
783 | } | |
784 | } | |
785 | } | |
786 | ||
93c66552 DM |
787 | void |
788 | Perl_op_null(pTHX_ OP *o) | |
8990e307 | 789 | { |
27da23d5 | 790 | dVAR; |
7918f24d NC |
791 | |
792 | PERL_ARGS_ASSERT_OP_NULL; | |
793 | ||
acb36ea4 GS |
794 | if (o->op_type == OP_NULL) |
795 | return; | |
eb8433b7 NC |
796 | if (!PL_madskills) |
797 | op_clear(o); | |
11343788 MB |
798 | o->op_targ = o->op_type; |
799 | o->op_type = OP_NULL; | |
22c35a8c | 800 | o->op_ppaddr = PL_ppaddr[OP_NULL]; |
8990e307 LW |
801 | } |
802 | ||
4026c95a SH |
803 | void |
804 | Perl_op_refcnt_lock(pTHX) | |
805 | { | |
27da23d5 | 806 | dVAR; |
96a5add6 | 807 | PERL_UNUSED_CONTEXT; |
4026c95a SH |
808 | OP_REFCNT_LOCK; |
809 | } | |
810 | ||
811 | void | |
812 | Perl_op_refcnt_unlock(pTHX) | |
813 | { | |
27da23d5 | 814 | dVAR; |
96a5add6 | 815 | PERL_UNUSED_CONTEXT; |
4026c95a SH |
816 | OP_REFCNT_UNLOCK; |
817 | } | |
818 | ||
79072805 LW |
819 | /* Contextualizers */ |
820 | ||
d9088386 Z |
821 | /* |
822 | =for apidoc Am|OP *|op_contextualize|OP *o|I32 context | |
823 | ||
824 | Applies a syntactic context to an op tree representing an expression. | |
825 | I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>, | |
826 | or C<G_VOID> to specify the context to apply. The modified op tree | |
827 | is returned. | |
828 | ||
829 | =cut | |
830 | */ | |
831 | ||
832 | OP * | |
833 | Perl_op_contextualize(pTHX_ OP *o, I32 context) | |
834 | { | |
835 | PERL_ARGS_ASSERT_OP_CONTEXTUALIZE; | |
836 | switch (context) { | |
837 | case G_SCALAR: return scalar(o); | |
838 | case G_ARRAY: return list(o); | |
839 | case G_VOID: return scalarvoid(o); | |
840 | default: | |
841 | Perl_croak(aTHX_ "panic: op_contextualize bad context"); | |
842 | return o; | |
843 | } | |
844 | } | |
845 | ||
5983a79d BM |
846 | /* |
847 | =head1 Optree Manipulation Functions | |
79072805 | 848 | |
5983a79d BM |
849 | =for apidoc Am|OP*|op_linklist|OP *o |
850 | This function is the implementation of the L</LINKLIST> macro. It should | |
851 | not be called directly. | |
852 | ||
853 | =cut | |
854 | */ | |
855 | ||
856 | OP * | |
857 | Perl_op_linklist(pTHX_ OP *o) | |
79072805 | 858 | { |
3edf23ff | 859 | OP *first; |
79072805 | 860 | |
5983a79d | 861 | PERL_ARGS_ASSERT_OP_LINKLIST; |
7918f24d | 862 | |
11343788 MB |
863 | if (o->op_next) |
864 | return o->op_next; | |
79072805 LW |
865 | |
866 | /* establish postfix order */ | |
3edf23ff AL |
867 | first = cUNOPo->op_first; |
868 | if (first) { | |
6867be6d | 869 | register OP *kid; |
3edf23ff AL |
870 | o->op_next = LINKLIST(first); |
871 | kid = first; | |
872 | for (;;) { | |
873 | if (kid->op_sibling) { | |
79072805 | 874 | kid->op_next = LINKLIST(kid->op_sibling); |
3edf23ff AL |
875 | kid = kid->op_sibling; |
876 | } else { | |
11343788 | 877 | kid->op_next = o; |
3edf23ff AL |
878 | break; |
879 | } | |
79072805 LW |
880 | } |
881 | } | |
882 | else | |
11343788 | 883 | o->op_next = o; |
79072805 | 884 | |
11343788 | 885 | return o->op_next; |
79072805 LW |
886 | } |
887 | ||
1f676739 | 888 | static OP * |
2dd5337b | 889 | S_scalarkids(pTHX_ OP *o) |
79072805 | 890 | { |
11343788 | 891 | if (o && o->op_flags & OPf_KIDS) { |
bfed75c6 | 892 | OP *kid; |
11343788 | 893 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
79072805 LW |
894 | scalar(kid); |
895 | } | |
11343788 | 896 | return o; |
79072805 LW |
897 | } |
898 | ||
76e3520e | 899 | STATIC OP * |
cea2e8a9 | 900 | S_scalarboolean(pTHX_ OP *o) |
8990e307 | 901 | { |
97aff369 | 902 | dVAR; |
7918f24d NC |
903 | |
904 | PERL_ARGS_ASSERT_SCALARBOOLEAN; | |
905 | ||
d008e5eb | 906 | if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) { |
d008e5eb | 907 | if (ckWARN(WARN_SYNTAX)) { |
6867be6d | 908 | const line_t oldline = CopLINE(PL_curcop); |
a0d0e21e | 909 | |
53a7735b DM |
910 | if (PL_parser && PL_parser->copline != NOLINE) |
911 | CopLINE_set(PL_curcop, PL_parser->copline); | |
9014280d | 912 | Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be =="); |
57843af0 | 913 | CopLINE_set(PL_curcop, oldline); |
d008e5eb | 914 | } |
a0d0e21e | 915 | } |
11343788 | 916 | return scalar(o); |
8990e307 LW |
917 | } |
918 | ||
919 | OP * | |
864dbfa3 | 920 | Perl_scalar(pTHX_ OP *o) |
79072805 | 921 | { |
27da23d5 | 922 | dVAR; |
79072805 LW |
923 | OP *kid; |
924 | ||
a0d0e21e | 925 | /* assumes no premature commitment */ |
13765c85 DM |
926 | if (!o || (PL_parser && PL_parser->error_count) |
927 | || (o->op_flags & OPf_WANT) | |
5dc0d613 | 928 | || o->op_type == OP_RETURN) |
7e363e51 | 929 | { |
11343788 | 930 | return o; |
7e363e51 | 931 | } |
79072805 | 932 | |
5dc0d613 | 933 | o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR; |
79072805 | 934 | |
11343788 | 935 | switch (o->op_type) { |
79072805 | 936 | case OP_REPEAT: |
11343788 | 937 | scalar(cBINOPo->op_first); |
8990e307 | 938 | break; |
79072805 LW |
939 | case OP_OR: |
940 | case OP_AND: | |
941 | case OP_COND_EXPR: | |
11343788 | 942 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
8990e307 | 943 | scalar(kid); |
79072805 | 944 | break; |
a0d0e21e | 945 | /* FALL THROUGH */ |
a6d8037e | 946 | case OP_SPLIT: |
79072805 | 947 | case OP_MATCH: |
8782bef2 | 948 | case OP_QR: |
79072805 LW |
949 | case OP_SUBST: |
950 | case OP_NULL: | |
8990e307 | 951 | default: |
11343788 MB |
952 | if (o->op_flags & OPf_KIDS) { |
953 | for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) | |
8990e307 LW |
954 | scalar(kid); |
955 | } | |
79072805 LW |
956 | break; |
957 | case OP_LEAVE: | |
958 | case OP_LEAVETRY: | |
5dc0d613 | 959 | kid = cLISTOPo->op_first; |
54310121 | 960 | scalar(kid); |
25b991bf VP |
961 | kid = kid->op_sibling; |
962 | do_kids: | |
963 | while (kid) { | |
964 | OP *sib = kid->op_sibling; | |
965 | if (sib && kid->op_type != OP_LEAVEWHEN) { | |
966 | if (sib->op_type == OP_BREAK && sib->op_flags & OPf_SPECIAL) { | |
967 | scalar(kid); | |
968 | scalarvoid(sib); | |
969 | break; | |
970 | } else | |
971 | scalarvoid(kid); | |
972 | } else | |
54310121 | 973 | scalar(kid); |
25b991bf | 974 | kid = sib; |
54310121 | 975 | } |
11206fdd | 976 | PL_curcop = &PL_compiling; |
54310121 | 977 | break; |
748a9306 | 978 | case OP_SCOPE: |
79072805 | 979 | case OP_LINESEQ: |
8990e307 | 980 | case OP_LIST: |
25b991bf VP |
981 | kid = cLISTOPo->op_first; |
982 | goto do_kids; | |
a801c63c | 983 | case OP_SORT: |
a2a5de95 | 984 | Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context"); |
553e7bb0 | 985 | break; |
79072805 | 986 | } |
11343788 | 987 | return o; |
79072805 LW |
988 | } |
989 | ||
990 | OP * | |
864dbfa3 | 991 | Perl_scalarvoid(pTHX_ OP *o) |
79072805 | 992 | { |
27da23d5 | 993 | dVAR; |
79072805 | 994 | OP *kid; |
c445ea15 | 995 | const char* useless = NULL; |
8990e307 | 996 | SV* sv; |
2ebea0a1 GS |
997 | U8 want; |
998 | ||
7918f24d NC |
999 | PERL_ARGS_ASSERT_SCALARVOID; |
1000 | ||
eb8433b7 NC |
1001 | /* trailing mad null ops don't count as "there" for void processing */ |
1002 | if (PL_madskills && | |
1003 | o->op_type != OP_NULL && | |
1004 | o->op_sibling && | |
1005 | o->op_sibling->op_type == OP_NULL) | |
1006 | { | |
1007 | OP *sib; | |
1008 | for (sib = o->op_sibling; | |
1009 | sib && sib->op_type == OP_NULL; | |
1010 | sib = sib->op_sibling) ; | |
1011 | ||
1012 | if (!sib) | |
1013 | return o; | |
1014 | } | |
1015 | ||
acb36ea4 | 1016 | if (o->op_type == OP_NEXTSTATE |
acb36ea4 GS |
1017 | || o->op_type == OP_DBSTATE |
1018 | || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE | |
acb36ea4 | 1019 | || o->op_targ == OP_DBSTATE))) |
2ebea0a1 | 1020 | PL_curcop = (COP*)o; /* for warning below */ |
79072805 | 1021 | |
54310121 | 1022 | /* assumes no premature commitment */ |
2ebea0a1 | 1023 | want = o->op_flags & OPf_WANT; |
13765c85 DM |
1024 | if ((want && want != OPf_WANT_SCALAR) |
1025 | || (PL_parser && PL_parser->error_count) | |
25b991bf | 1026 | || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN) |
7e363e51 | 1027 | { |
11343788 | 1028 | return o; |
7e363e51 | 1029 | } |
79072805 | 1030 | |
b162f9ea | 1031 | if ((o->op_private & OPpTARGET_MY) |
7e363e51 GS |
1032 | && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */ |
1033 | { | |
b162f9ea | 1034 | return scalar(o); /* As if inside SASSIGN */ |
7e363e51 | 1035 | } |
1c846c1f | 1036 | |
5dc0d613 | 1037 | o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID; |
79072805 | 1038 | |
11343788 | 1039 | switch (o->op_type) { |
79072805 | 1040 | default: |
22c35a8c | 1041 | if (!(PL_opargs[o->op_type] & OA_FOLDCONST)) |
8990e307 | 1042 | break; |
36477c24 | 1043 | /* FALL THROUGH */ |
1044 | case OP_REPEAT: | |
11343788 | 1045 | if (o->op_flags & OPf_STACKED) |
8990e307 | 1046 | break; |
5d82c453 GA |
1047 | goto func_ops; |
1048 | case OP_SUBSTR: | |
1049 | if (o->op_private == 4) | |
1050 | break; | |
8990e307 LW |
1051 | /* FALL THROUGH */ |
1052 | case OP_GVSV: | |
1053 | case OP_WANTARRAY: | |
1054 | case OP_GV: | |
74295f0b | 1055 | case OP_SMARTMATCH: |
8990e307 LW |
1056 | case OP_PADSV: |
1057 | case OP_PADAV: | |
1058 | case OP_PADHV: | |
1059 | case OP_PADANY: | |
1060 | case OP_AV2ARYLEN: | |
8990e307 | 1061 | case OP_REF: |
a0d0e21e LW |
1062 | case OP_REFGEN: |
1063 | case OP_SREFGEN: | |
8990e307 LW |
1064 | case OP_DEFINED: |
1065 | case OP_HEX: | |
1066 | case OP_OCT: | |
1067 | case OP_LENGTH: | |
8990e307 LW |
1068 | case OP_VEC: |
1069 | case OP_INDEX: | |
1070 | case OP_RINDEX: | |
1071 | case OP_SPRINTF: | |
1072 | case OP_AELEM: | |
1073 | case OP_AELEMFAST: | |
1074 | case OP_ASLICE: | |
8990e307 LW |
1075 | case OP_HELEM: |
1076 | case OP_HSLICE: | |
1077 | case OP_UNPACK: | |
1078 | case OP_PACK: | |
8990e307 LW |
1079 | case OP_JOIN: |
1080 | case OP_LSLICE: | |
1081 | case OP_ANONLIST: | |
1082 | case OP_ANONHASH: | |
1083 | case OP_SORT: | |
1084 | case OP_REVERSE: | |
1085 | case OP_RANGE: | |
1086 | case OP_FLIP: | |
1087 | case OP_FLOP: | |
1088 | case OP_CALLER: | |
1089 | case OP_FILENO: | |
1090 | case OP_EOF: | |
1091 | case OP_TELL: | |
1092 | case OP_GETSOCKNAME: | |
1093 | case OP_GETPEERNAME: | |
1094 | case OP_READLINK: | |
1095 | case OP_TELLDIR: | |
1096 | case OP_GETPPID: | |
1097 | case OP_GETPGRP: | |
1098 | case OP_GETPRIORITY: | |
1099 | case OP_TIME: | |
1100 | case OP_TMS: | |
1101 | case OP_LOCALTIME: | |
1102 | case OP_GMTIME: | |
1103 | case OP_GHBYNAME: | |
1104 | case OP_GHBYADDR: | |
1105 | case OP_GHOSTENT: | |
1106 | case OP_GNBYNAME: | |
1107 | case OP_GNBYADDR: | |
1108 | case OP_GNETENT: | |
1109 | case OP_GPBYNAME: | |
1110 | case OP_GPBYNUMBER: | |
1111 | case OP_GPROTOENT: | |
1112 | case OP_GSBYNAME: | |
1113 | case OP_GSBYPORT: | |
1114 | case OP_GSERVENT: | |
1115 | case OP_GPWNAM: | |
1116 | case OP_GPWUID: | |
1117 | case OP_GGRNAM: | |
1118 | case OP_GGRGID: | |
1119 | case OP_GETLOGIN: | |
78e1b766 | 1120 | case OP_PROTOTYPE: |
5d82c453 | 1121 | func_ops: |
64aac5a9 | 1122 | if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO))) |
74295f0b | 1123 | /* Otherwise it's "Useless use of grep iterator" */ |
f5df4782 | 1124 | useless = OP_DESC(o); |
75068674 RGS |
1125 | break; |
1126 | ||
1127 | case OP_SPLIT: | |
1128 | kid = cLISTOPo->op_first; | |
1129 | if (kid && kid->op_type == OP_PUSHRE | |
1130 | #ifdef USE_ITHREADS | |
1131 | && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff) | |
1132 | #else | |
1133 | && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv) | |
1134 | #endif | |
1135 | useless = OP_DESC(o); | |
8990e307 LW |
1136 | break; |
1137 | ||
9f82cd5f YST |
1138 | case OP_NOT: |
1139 | kid = cUNOPo->op_first; | |
1140 | if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST && | |
1141 | kid->op_type != OP_TRANS) { | |
1142 | goto func_ops; | |
1143 | } | |
1144 | useless = "negative pattern binding (!~)"; | |
1145 | break; | |
1146 | ||
4f4d7508 DC |
1147 | case OP_SUBST: |
1148 | if (cPMOPo->op_pmflags & PMf_NONDESTRUCT) | |
1149 | useless = "Non-destructive substitution (s///r)"; | |
1150 | break; | |
1151 | ||
8990e307 LW |
1152 | case OP_RV2GV: |
1153 | case OP_RV2SV: | |
1154 | case OP_RV2AV: | |
1155 | case OP_RV2HV: | |
192587c2 | 1156 | if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) && |
11343788 | 1157 | (!o->op_sibling || o->op_sibling->op_type != OP_READLINE)) |
8990e307 LW |
1158 | useless = "a variable"; |
1159 | break; | |
79072805 LW |
1160 | |
1161 | case OP_CONST: | |
7766f137 | 1162 | sv = cSVOPo_sv; |
7a52d87a GS |
1163 | if (cSVOPo->op_private & OPpCONST_STRICT) |
1164 | no_bareword_allowed(o); | |
1165 | else { | |
d008e5eb | 1166 | if (ckWARN(WARN_VOID)) { |
fa01e093 RGS |
1167 | if (SvOK(sv)) { |
1168 | SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_ | |
1169 | "a constant (%"SVf")", sv)); | |
1170 | useless = SvPV_nolen(msv); | |
1171 | } | |
1172 | else | |
1173 | useless = "a constant (undef)"; | |
2e0ae2d3 | 1174 | if (o->op_private & OPpCONST_ARYBASE) |
d4c19fe8 | 1175 | useless = NULL; |
e7fec78e | 1176 | /* don't warn on optimised away booleans, eg |
b5a930ec | 1177 | * use constant Foo, 5; Foo || print; */ |
e7fec78e | 1178 | if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT) |
d4c19fe8 | 1179 | useless = NULL; |
960b4253 MG |
1180 | /* the constants 0 and 1 are permitted as they are |
1181 | conventionally used as dummies in constructs like | |
1182 | 1 while some_condition_with_side_effects; */ | |
e7fec78e | 1183 | else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0)) |
d4c19fe8 | 1184 | useless = NULL; |
d008e5eb | 1185 | else if (SvPOK(sv)) { |
a52fe3ac A |
1186 | /* perl4's way of mixing documentation and code |
1187 | (before the invention of POD) was based on a | |
1188 | trick to mix nroff and perl code. The trick was | |
1189 | built upon these three nroff macros being used in | |
1190 | void context. The pink camel has the details in | |
1191 | the script wrapman near page 319. */ | |
6136c704 AL |
1192 | const char * const maybe_macro = SvPVX_const(sv); |
1193 | if (strnEQ(maybe_macro, "di", 2) || | |
1194 | strnEQ(maybe_macro, "ds", 2) || | |
1195 | strnEQ(maybe_macro, "ig", 2)) | |
d4c19fe8 | 1196 | useless = NULL; |
d008e5eb | 1197 | } |
8990e307 LW |
1198 | } |
1199 | } | |
93c66552 | 1200 | op_null(o); /* don't execute or even remember it */ |
79072805 LW |
1201 | break; |
1202 | ||
1203 | case OP_POSTINC: | |
11343788 | 1204 | o->op_type = OP_PREINC; /* pre-increment is faster */ |
22c35a8c | 1205 | o->op_ppaddr = PL_ppaddr[OP_PREINC]; |
79072805 LW |
1206 | break; |
1207 | ||
1208 | case OP_POSTDEC: | |
11343788 | 1209 | o->op_type = OP_PREDEC; /* pre-decrement is faster */ |
22c35a8c | 1210 | o->op_ppaddr = PL_ppaddr[OP_PREDEC]; |
79072805 LW |
1211 | break; |
1212 | ||
679d6c4e HS |
1213 | case OP_I_POSTINC: |
1214 | o->op_type = OP_I_PREINC; /* pre-increment is faster */ | |
1215 | o->op_ppaddr = PL_ppaddr[OP_I_PREINC]; | |
1216 | break; | |
1217 | ||
1218 | case OP_I_POSTDEC: | |
1219 | o->op_type = OP_I_PREDEC; /* pre-decrement is faster */ | |
1220 | o->op_ppaddr = PL_ppaddr[OP_I_PREDEC]; | |
1221 | break; | |
1222 | ||
79072805 LW |
1223 | case OP_OR: |
1224 | case OP_AND: | |
edbe35ea VP |
1225 | kid = cLOGOPo->op_first; |
1226 | if (kid->op_type == OP_NOT | |
1227 | && (kid->op_flags & OPf_KIDS) | |
1228 | && !PL_madskills) { | |
1229 | if (o->op_type == OP_AND) { | |
1230 | o->op_type = OP_OR; | |
1231 | o->op_ppaddr = PL_ppaddr[OP_OR]; | |
1232 | } else { | |
1233 | o->op_type = OP_AND; | |
1234 | o->op_ppaddr = PL_ppaddr[OP_AND]; | |
1235 | } | |
1236 | op_null(kid); | |
1237 | } | |
1238 | ||
c963b151 | 1239 | case OP_DOR: |
79072805 | 1240 | case OP_COND_EXPR: |
0d863452 RH |
1241 | case OP_ENTERGIVEN: |
1242 | case OP_ENTERWHEN: | |
11343788 | 1243 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
79072805 LW |
1244 | scalarvoid(kid); |
1245 | break; | |
5aabfad6 | 1246 | |
a0d0e21e | 1247 | case OP_NULL: |
11343788 | 1248 | if (o->op_flags & OPf_STACKED) |
a0d0e21e | 1249 | break; |
5aabfad6 | 1250 | /* FALL THROUGH */ |
2ebea0a1 GS |
1251 | case OP_NEXTSTATE: |
1252 | case OP_DBSTATE: | |
79072805 LW |
1253 | case OP_ENTERTRY: |
1254 | case OP_ENTER: | |
11343788 | 1255 | if (!(o->op_flags & OPf_KIDS)) |
79072805 | 1256 | break; |
54310121 | 1257 | /* FALL THROUGH */ |
463ee0b2 | 1258 | case OP_SCOPE: |
79072805 LW |
1259 | case OP_LEAVE: |
1260 | case OP_LEAVETRY: | |
a0d0e21e | 1261 | case OP_LEAVELOOP: |
79072805 | 1262 | case OP_LINESEQ: |
79072805 | 1263 | case OP_LIST: |
0d863452 RH |
1264 | case OP_LEAVEGIVEN: |
1265 | case OP_LEAVEWHEN: | |
11343788 | 1266 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
79072805 LW |
1267 | scalarvoid(kid); |
1268 | break; | |
c90c0ff4 | 1269 | case OP_ENTEREVAL: |
5196be3e | 1270 | scalarkids(o); |
c90c0ff4 | 1271 | break; |
d6483035 | 1272 | case OP_SCALAR: |
5196be3e | 1273 | return scalar(o); |
79072805 | 1274 | } |
a2a5de95 NC |
1275 | if (useless) |
1276 | Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless); | |
11343788 | 1277 | return o; |
79072805 LW |
1278 | } |
1279 | ||
1f676739 | 1280 | static OP * |
412da003 | 1281 | S_listkids(pTHX_ OP *o) |
79072805 | 1282 | { |
11343788 | 1283 | if (o && o->op_flags & OPf_KIDS) { |
6867be6d | 1284 | OP *kid; |
11343788 | 1285 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
79072805 LW |
1286 | list(kid); |
1287 | } | |
11343788 | 1288 | return o; |
79072805 LW |
1289 | } |
1290 | ||
1291 | OP * | |
864dbfa3 | 1292 | Perl_list(pTHX_ OP *o) |
79072805 | 1293 | { |
27da23d5 | 1294 | dVAR; |
79072805 LW |
1295 | OP *kid; |
1296 | ||
a0d0e21e | 1297 | /* assumes no premature commitment */ |
13765c85 DM |
1298 | if (!o || (o->op_flags & OPf_WANT) |
1299 | || (PL_parser && PL_parser->error_count) | |
5dc0d613 | 1300 | || o->op_type == OP_RETURN) |
7e363e51 | 1301 | { |
11343788 | 1302 | return o; |
7e363e51 | 1303 | } |
79072805 | 1304 | |
b162f9ea | 1305 | if ((o->op_private & OPpTARGET_MY) |
7e363e51 GS |
1306 | && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */ |
1307 | { | |
b162f9ea | 1308 | return o; /* As if inside SASSIGN */ |
7e363e51 | 1309 | } |
1c846c1f | 1310 | |
5dc0d613 | 1311 | o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST; |
79072805 | 1312 | |
11343788 | 1313 | switch (o->op_type) { |
79072805 LW |
1314 | case OP_FLOP: |
1315 | case OP_REPEAT: | |
11343788 | 1316 | list(cBINOPo->op_first); |
79072805 LW |
1317 | break; |
1318 | case OP_OR: | |
1319 | case OP_AND: | |
1320 | case OP_COND_EXPR: | |
11343788 | 1321 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
79072805 LW |
1322 | list(kid); |
1323 | break; | |
1324 | default: | |
1325 | case OP_MATCH: | |
8782bef2 | 1326 | case OP_QR: |
79072805 LW |
1327 | case OP_SUBST: |
1328 | case OP_NULL: | |
11343788 | 1329 | if (!(o->op_flags & OPf_KIDS)) |
79072805 | 1330 | break; |
11343788 MB |
1331 | if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) { |
1332 | list(cBINOPo->op_first); | |
1333 | return gen_constant_list(o); | |
79072805 LW |
1334 | } |
1335 | case OP_LIST: | |
11343788 | 1336 | listkids(o); |
79072805 LW |
1337 | break; |
1338 | case OP_LEAVE: | |
1339 | case OP_LEAVETRY: | |
5dc0d613 | 1340 | kid = cLISTOPo->op_first; |
54310121 | 1341 | list(kid); |
25b991bf VP |
1342 | kid = kid->op_sibling; |
1343 | do_kids: | |
1344 | while (kid) { | |
1345 | OP *sib = kid->op_sibling; | |
1346 | if (sib && kid->op_type != OP_LEAVEWHEN) { | |
1347 | if (sib->op_type == OP_BREAK && sib->op_flags & OPf_SPECIAL) { | |
1348 | list(kid); | |
1349 | scalarvoid(sib); | |
1350 | break; | |
1351 | } else | |
1352 | scalarvoid(kid); | |
1353 | } else | |
54310121 | 1354 | list(kid); |
25b991bf | 1355 | kid = sib; |
54310121 | 1356 | } |
11206fdd | 1357 | PL_curcop = &PL_compiling; |
54310121 | 1358 | break; |
748a9306 | 1359 | case OP_SCOPE: |
79072805 | 1360 | case OP_LINESEQ: |
25b991bf VP |
1361 | kid = cLISTOPo->op_first; |
1362 | goto do_kids; | |
79072805 | 1363 | } |
11343788 | 1364 | return o; |
79072805 LW |
1365 | } |
1366 | ||
1f676739 | 1367 | static OP * |
2dd5337b | 1368 | S_scalarseq(pTHX_ OP *o) |
79072805 | 1369 | { |
97aff369 | 1370 | dVAR; |
11343788 | 1371 | if (o) { |
1496a290 AL |
1372 | const OPCODE type = o->op_type; |
1373 | ||
1374 | if (type == OP_LINESEQ || type == OP_SCOPE || | |
1375 | type == OP_LEAVE || type == OP_LEAVETRY) | |
463ee0b2 | 1376 | { |
6867be6d | 1377 | OP *kid; |
11343788 | 1378 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) { |
ed6116ce | 1379 | if (kid->op_sibling) { |
463ee0b2 | 1380 | scalarvoid(kid); |
ed6116ce | 1381 | } |
463ee0b2 | 1382 | } |
3280af22 | 1383 | PL_curcop = &PL_compiling; |
79072805 | 1384 | } |
11343788 | 1385 | o->op_flags &= ~OPf_PARENS; |
3280af22 | 1386 | if (PL_hints & HINT_BLOCK_SCOPE) |
11343788 | 1387 | o->op_flags |= OPf_PARENS; |
79072805 | 1388 | } |
8990e307 | 1389 | else |
11343788 MB |
1390 | o = newOP(OP_STUB, 0); |
1391 | return o; | |
79072805 LW |
1392 | } |
1393 | ||
76e3520e | 1394 | STATIC OP * |
cea2e8a9 | 1395 | S_modkids(pTHX_ OP *o, I32 type) |
79072805 | 1396 | { |
11343788 | 1397 | if (o && o->op_flags & OPf_KIDS) { |
6867be6d | 1398 | OP *kid; |
11343788 | 1399 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
463ee0b2 | 1400 | mod(kid, type); |
79072805 | 1401 | } |
11343788 | 1402 | return o; |
79072805 LW |
1403 | } |
1404 | ||
ff7298cb | 1405 | /* Propagate lvalue ("modifiable") context to an op and its children. |
ddeae0f1 DM |
1406 | * 'type' represents the context type, roughly based on the type of op that |
1407 | * would do the modifying, although local() is represented by OP_NULL. | |
1408 | * It's responsible for detecting things that can't be modified, flag | |
1409 | * things that need to behave specially in an lvalue context (e.g., "$$x = 5" | |
1410 | * might have to vivify a reference in $x), and so on. | |
1411 | * | |
1412 | * For example, "$a+1 = 2" would cause mod() to be called with o being | |
1413 | * OP_ADD and type being OP_SASSIGN, and would output an error. | |
1414 | */ | |
1415 | ||
79072805 | 1416 | OP * |
864dbfa3 | 1417 | Perl_mod(pTHX_ OP *o, I32 type) |
79072805 | 1418 | { |
27da23d5 | 1419 | dVAR; |
79072805 | 1420 | OP *kid; |
ddeae0f1 DM |
1421 | /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */ |
1422 | int localize = -1; | |
79072805 | 1423 | |
13765c85 | 1424 | if (!o || (PL_parser && PL_parser->error_count)) |
11343788 | 1425 | return o; |
79072805 | 1426 | |
b162f9ea | 1427 | if ((o->op_private & OPpTARGET_MY) |
7e363e51 GS |
1428 | && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */ |
1429 | { | |
b162f9ea | 1430 | return o; |
7e363e51 | 1431 | } |
1c846c1f | 1432 | |
11343788 | 1433 | switch (o->op_type) { |
68dc0745 | 1434 | case OP_UNDEF: |
ddeae0f1 | 1435 | localize = 0; |
3280af22 | 1436 | PL_modcount++; |
5dc0d613 | 1437 | return o; |
a0d0e21e | 1438 | case OP_CONST: |
2e0ae2d3 | 1439 | if (!(o->op_private & OPpCONST_ARYBASE)) |
a0d0e21e | 1440 | goto nomod; |
54dc0f91 | 1441 | localize = 0; |
3280af22 | 1442 | if (PL_eval_start && PL_eval_start->op_type == OP_CONST) { |
fc15ae8f NC |
1443 | CopARYBASE_set(&PL_compiling, |
1444 | (I32)SvIV(cSVOPx(PL_eval_start)->op_sv)); | |
3280af22 | 1445 | PL_eval_start = 0; |
a0d0e21e LW |
1446 | } |
1447 | else if (!type) { | |
fc15ae8f NC |
1448 | SAVECOPARYBASE(&PL_compiling); |
1449 | CopARYBASE_set(&PL_compiling, 0); | |
a0d0e21e LW |
1450 | } |
1451 | else if (type == OP_REFGEN) | |
1452 | goto nomod; | |
1453 | else | |
cea2e8a9 | 1454 | Perl_croak(aTHX_ "That use of $[ is unsupported"); |
a0d0e21e | 1455 | break; |
5f05dabc | 1456 | case OP_STUB: |
58bde88d | 1457 | if ((o->op_flags & OPf_PARENS) || PL_madskills) |
5f05dabc | 1458 | break; |
1459 | goto nomod; | |
a0d0e21e LW |
1460 | case OP_ENTERSUB: |
1461 | if ((type == OP_UNDEF || type == OP_REFGEN) && | |
11343788 MB |
1462 | !(o->op_flags & OPf_STACKED)) { |
1463 | o->op_type = OP_RV2CV; /* entersub => rv2cv */ | |
e26df76a NC |
1464 | /* The default is to set op_private to the number of children, |
1465 | which for a UNOP such as RV2CV is always 1. And w're using | |
1466 | the bit for a flag in RV2CV, so we need it clear. */ | |
1467 | o->op_private &= ~1; | |
22c35a8c | 1468 | o->op_ppaddr = PL_ppaddr[OP_RV2CV]; |
11343788 | 1469 | assert(cUNOPo->op_first->op_type == OP_NULL); |
93c66552 | 1470 | op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */ |
79072805 LW |
1471 | break; |
1472 | } | |
95f0a2f1 SB |
1473 | else if (o->op_private & OPpENTERSUB_NOMOD) |
1474 | return o; | |
cd06dffe GS |
1475 | else { /* lvalue subroutine call */ |
1476 | o->op_private |= OPpLVAL_INTRO; | |
e6438c1a | 1477 | PL_modcount = RETURN_UNLIMITED_NUMBER; |
4978d6d9 | 1478 | if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) { |
cd06dffe GS |
1479 | /* Backward compatibility mode: */ |
1480 | o->op_private |= OPpENTERSUB_INARGS; | |
1481 | break; | |
1482 | } | |
1483 | else { /* Compile-time error message: */ | |
1484 | OP *kid = cUNOPo->op_first; | |
1485 | CV *cv; | |
1486 | OP *okid; | |
1487 | ||
3ea285d1 AL |
1488 | if (kid->op_type != OP_PUSHMARK) { |
1489 | if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST) | |
1490 | Perl_croak(aTHX_ | |
1491 | "panic: unexpected lvalue entersub " | |
1492 | "args: type/targ %ld:%"UVuf, | |
1493 | (long)kid->op_type, (UV)kid->op_targ); | |
1494 | kid = kLISTOP->op_first; | |
1495 | } | |
cd06dffe GS |
1496 | while (kid->op_sibling) |
1497 | kid = kid->op_sibling; | |
1498 | if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) { | |
1499 | /* Indirect call */ | |
1500 | if (kid->op_type == OP_METHOD_NAMED | |
1501 | || kid->op_type == OP_METHOD) | |
1502 | { | |
87d7fd28 | 1503 | UNOP *newop; |
b2ffa427 | 1504 | |
87d7fd28 | 1505 | NewOp(1101, newop, 1, UNOP); |
349fd7b7 GS |
1506 | newop->op_type = OP_RV2CV; |
1507 | newop->op_ppaddr = PL_ppaddr[OP_RV2CV]; | |
5f66b61c | 1508 | newop->op_first = NULL; |
87d7fd28 GS |
1509 | newop->op_next = (OP*)newop; |
1510 | kid->op_sibling = (OP*)newop; | |
349fd7b7 | 1511 | newop->op_private |= OPpLVAL_INTRO; |
e26df76a | 1512 | newop->op_private &= ~1; |
cd06dffe GS |
1513 | break; |
1514 | } | |
b2ffa427 | 1515 | |
cd06dffe GS |
1516 | if (kid->op_type != OP_RV2CV) |
1517 | Perl_croak(aTHX_ | |
1518 | "panic: unexpected lvalue entersub " | |
55140b79 | 1519 | "entry via type/targ %ld:%"UVuf, |
3d811634 | 1520 | (long)kid->op_type, (UV)kid->op_targ); |
cd06dffe GS |
1521 | kid->op_private |= OPpLVAL_INTRO; |
1522 | break; /* Postpone until runtime */ | |
1523 | } | |
b2ffa427 NIS |
1524 | |
1525 | okid = kid; | |
cd06dffe GS |
1526 | kid = kUNOP->op_first; |
1527 | if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV) | |
1528 | kid = kUNOP->op_first; | |
b2ffa427 | 1529 | if (kid->op_type == OP_NULL) |
cd06dffe GS |
1530 | Perl_croak(aTHX_ |
1531 | "Unexpected constant lvalue entersub " | |
55140b79 | 1532 | "entry via type/targ %ld:%"UVuf, |
3d811634 | 1533 | (long)kid->op_type, (UV)kid->op_targ); |
cd06dffe GS |
1534 | if (kid->op_type != OP_GV) { |
1535 | /* Restore RV2CV to check lvalueness */ | |
1536 | restore_2cv: | |
1537 | if (kid->op_next && kid->op_next != kid) { /* Happens? */ | |
1538 | okid->op_next = kid->op_next; | |
1539 | kid->op_next = okid; | |
1540 | } | |
1541 | else | |
5f66b61c | 1542 | okid->op_next = NULL; |
cd06dffe GS |
1543 | okid->op_type = OP_RV2CV; |
1544 | okid->op_targ = 0; | |
1545 | okid->op_ppaddr = PL_ppaddr[OP_RV2CV]; | |
1546 | okid->op_private |= OPpLVAL_INTRO; | |
e26df76a | 1547 | okid->op_private &= ~1; |
cd06dffe GS |
1548 | break; |
1549 | } | |
b2ffa427 | 1550 | |
638eceb6 | 1551 | cv = GvCV(kGVOP_gv); |
1c846c1f | 1552 | if (!cv) |
cd06dffe GS |
1553 | goto restore_2cv; |
1554 | if (CvLVALUE(cv)) | |
1555 | break; | |
1556 | } | |
1557 | } | |
79072805 LW |
1558 | /* FALL THROUGH */ |
1559 | default: | |
a0d0e21e | 1560 | nomod: |
6fbb66d6 NC |
1561 | /* grep, foreach, subcalls, refgen */ |
1562 | if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) | |
a0d0e21e | 1563 | break; |
cea2e8a9 | 1564 | yyerror(Perl_form(aTHX_ "Can't modify %s in %s", |
638bc118 | 1565 | (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL) |
cd06dffe GS |
1566 | ? "do block" |
1567 | : (o->op_type == OP_ENTERSUB | |
1568 | ? "non-lvalue subroutine call" | |
53e06cf0 | 1569 | : OP_DESC(o))), |
22c35a8c | 1570 | type ? PL_op_desc[type] : "local")); |
11343788 | 1571 | return o; |
79072805 | 1572 | |
a0d0e21e LW |
1573 | case OP_PREINC: |
1574 | case OP_PREDEC: | |
1575 | case OP_POW: | |
1576 | case OP_MULTIPLY: | |
1577 | case OP_DIVIDE: | |
1578 | case OP_MODULO: | |
1579 | case OP_REPEAT: | |
1580 | case OP_ADD: | |
1581 | case OP_SUBTRACT: | |
1582 | case OP_CONCAT: | |
1583 | case OP_LEFT_SHIFT: | |
1584 | case OP_RIGHT_SHIFT: | |
1585 | case OP_BIT_AND: | |
1586 | case OP_BIT_XOR: | |
1587 | case OP_BIT_OR: | |
1588 | case OP_I_MULTIPLY: | |
1589 | case OP_I_DIVIDE: | |
1590 | case OP_I_MODULO: | |
1591 | case OP_I_ADD: | |
1592 | case OP_I_SUBTRACT: | |
11343788 | 1593 | if (!(o->op_flags & OPf_STACKED)) |
a0d0e21e | 1594 | goto nomod; |
3280af22 | 1595 | PL_modcount++; |
a0d0e21e | 1596 | break; |
b2ffa427 | 1597 | |
79072805 | 1598 | case OP_COND_EXPR: |
ddeae0f1 | 1599 | localize = 1; |
11343788 | 1600 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
463ee0b2 | 1601 | mod(kid, type); |
79072805 LW |
1602 | break; |
1603 | ||
1604 | case OP_RV2AV: | |
1605 | case OP_RV2HV: | |
11343788 | 1606 | if (type == OP_REFGEN && o->op_flags & OPf_PARENS) { |
e6438c1a | 1607 | PL_modcount = RETURN_UNLIMITED_NUMBER; |
11343788 | 1608 | return o; /* Treat \(@foo) like ordinary list. */ |
748a9306 LW |
1609 | } |
1610 | /* FALL THROUGH */ | |
79072805 | 1611 | case OP_RV2GV: |
5dc0d613 | 1612 | if (scalar_mod_type(o, type)) |
3fe9a6f1 | 1613 | goto nomod; |
11343788 | 1614 | ref(cUNOPo->op_first, o->op_type); |
79072805 | 1615 | /* FALL THROUGH */ |
79072805 LW |
1616 | case OP_ASLICE: |
1617 | case OP_HSLICE: | |
78f9721b SM |
1618 | if (type == OP_LEAVESUBLV) |
1619 | o->op_private |= OPpMAYBE_LVSUB; | |
ddeae0f1 | 1620 | localize = 1; |
78f9721b SM |
1621 | /* FALL THROUGH */ |
1622 | case OP_AASSIGN: | |
93a17b20 LW |
1623 | case OP_NEXTSTATE: |
1624 | case OP_DBSTATE: | |
e6438c1a | 1625 | PL_modcount = RETURN_UNLIMITED_NUMBER; |
79072805 | 1626 | break; |
28c5b5bc RGS |
1627 | case OP_AV2ARYLEN: |
1628 | PL_hints |= HINT_BLOCK_SCOPE; | |
1629 | if (type == OP_LEAVESUBLV) | |
1630 | o->op_private |= OPpMAYBE_LVSUB; | |
1631 | PL_modcount++; | |
1632 | break; | |
463ee0b2 | 1633 | case OP_RV2SV: |
aeea060c | 1634 | ref(cUNOPo->op_first, o->op_type); |
ddeae0f1 | 1635 | localize = 1; |
463ee0b2 | 1636 | /* FALL THROUGH */ |
79072805 | 1637 | case OP_GV: |
3280af22 | 1638 | PL_hints |= HINT_BLOCK_SCOPE; |
463ee0b2 | 1639 | case OP_SASSIGN: |
bf4b1e52 GS |
1640 | case OP_ANDASSIGN: |
1641 | case OP_ORASSIGN: | |
c963b151 | 1642 | case OP_DORASSIGN: |
ddeae0f1 DM |
1643 | PL_modcount++; |
1644 | break; | |
1645 | ||
8990e307 | 1646 | case OP_AELEMFAST: |
6a077020 | 1647 | localize = -1; |
3280af22 | 1648 | PL_modcount++; |
8990e307 LW |
1649 | break; |
1650 | ||
748a9306 LW |
1651 | case OP_PADAV: |
1652 | case OP_PADHV: | |
e6438c1a | 1653 | PL_modcount = RETURN_UNLIMITED_NUMBER; |
5196be3e MB |
1654 | if (type == OP_REFGEN && o->op_flags & OPf_PARENS) |
1655 | return o; /* Treat \(@foo) like ordinary list. */ | |
1656 | if (scalar_mod_type(o, type)) | |
3fe9a6f1 | 1657 | goto nomod; |
78f9721b SM |
1658 | if (type == OP_LEAVESUBLV) |
1659 | o->op_private |= OPpMAYBE_LVSUB; | |
748a9306 LW |
1660 | /* FALL THROUGH */ |
1661 | case OP_PADSV: | |
3280af22 | 1662 | PL_modcount++; |
ddeae0f1 | 1663 | if (!type) /* local() */ |
cea2e8a9 | 1664 | Perl_croak(aTHX_ "Can't localize lexical variable %s", |
dd2155a4 | 1665 | PAD_COMPNAME_PV(o->op_targ)); |
463ee0b2 LW |
1666 | break; |
1667 | ||
748a9306 | 1668 | case OP_PUSHMARK: |
ddeae0f1 | 1669 | localize = 0; |
748a9306 | 1670 | break; |
b2ffa427 | 1671 | |
69969c6f SB |
1672 | case OP_KEYS: |
1673 | if (type != OP_SASSIGN) | |
1674 | goto nomod; | |
5d82c453 GA |
1675 | goto lvalue_func; |
1676 | case OP_SUBSTR: | |
1677 | if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */ | |
1678 | goto nomod; | |
5f05dabc | 1679 | /* FALL THROUGH */ |
a0d0e21e | 1680 | case OP_POS: |
463ee0b2 | 1681 | case OP_VEC: |
78f9721b SM |
1682 | if (type == OP_LEAVESUBLV) |
1683 | o->op_private |= OPpMAYBE_LVSUB; | |
5d82c453 | 1684 | lvalue_func: |
11343788 MB |
1685 | pad_free(o->op_targ); |
1686 | o->op_targ = pad_alloc(o->op_type, SVs_PADMY); | |
5dc0d613 | 1687 | assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL); |
11343788 MB |
1688 | if (o->op_flags & OPf_KIDS) |
1689 | mod(cBINOPo->op_first->op_sibling, type); | |
463ee0b2 | 1690 | break; |
a0d0e21e | 1691 | |
463ee0b2 LW |
1692 | case OP_AELEM: |
1693 | case OP_HELEM: | |
11343788 | 1694 | ref(cBINOPo->op_first, o->op_type); |
68dc0745 | 1695 | if (type == OP_ENTERSUB && |
5dc0d613 MB |
1696 | !(o->op_private & (OPpLVAL_INTRO | OPpDEREF))) |
1697 | o->op_private |= OPpLVAL_DEFER; | |
78f9721b SM |
1698 | if (type == OP_LEAVESUBLV) |
1699 | o->op_private |= OPpMAYBE_LVSUB; | |
ddeae0f1 | 1700 | localize = 1; |
3280af22 | 1701 | PL_modcount++; |
463ee0b2 LW |
1702 | break; |
1703 | ||
1704 | case OP_SCOPE: | |
1705 | case OP_LEAVE: | |
1706 | case OP_ENTER: | |
78f9721b | 1707 | case OP_LINESEQ: |
ddeae0f1 | 1708 | localize = 0; |
11343788 MB |
1709 | if (o->op_flags & OPf_KIDS) |
1710 | mod(cLISTOPo->op_last, type); | |
a0d0e21e LW |
1711 | break; |
1712 | ||
1713 | case OP_NULL: | |
ddeae0f1 | 1714 | localize = 0; |
638bc118 GS |
1715 | if (o->op_flags & OPf_SPECIAL) /* do BLOCK */ |
1716 | goto nomod; | |
1717 | else if (!(o->op_flags & OPf_KIDS)) | |
463ee0b2 | 1718 | break; |
11343788 MB |
1719 | if (o->op_targ != OP_LIST) { |
1720 | mod(cBINOPo->op_first, type); | |
a0d0e21e LW |
1721 | break; |
1722 | } | |
1723 | /* FALL THROUGH */ | |
463ee0b2 | 1724 | case OP_LIST: |
ddeae0f1 | 1725 | localize = 0; |
11343788 | 1726 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
463ee0b2 LW |
1727 | mod(kid, type); |
1728 | break; | |
78f9721b SM |
1729 | |
1730 | case OP_RETURN: | |
1731 | if (type != OP_LEAVESUBLV) | |
1732 | goto nomod; | |
1733 | break; /* mod()ing was handled by ck_return() */ | |
463ee0b2 | 1734 | } |
58d95175 | 1735 | |
8be1be90 AMS |
1736 | /* [20011101.069] File test operators interpret OPf_REF to mean that |
1737 | their argument is a filehandle; thus \stat(".") should not set | |
1738 | it. AMS 20011102 */ | |
1739 | if (type == OP_REFGEN && | |
ef69c8fc | 1740 | PL_check[o->op_type] == Perl_ck_ftst) |
8be1be90 AMS |
1741 | return o; |
1742 | ||
1743 | if (type != OP_LEAVESUBLV) | |
1744 | o->op_flags |= OPf_MOD; | |
1745 | ||
1746 | if (type == OP_AASSIGN || type == OP_SASSIGN) | |
1747 | o->op_flags |= OPf_SPECIAL|OPf_REF; | |
ddeae0f1 DM |
1748 | else if (!type) { /* local() */ |
1749 | switch (localize) { | |
1750 | case 1: | |
1751 | o->op_private |= OPpLVAL_INTRO; | |
1752 | o->op_flags &= ~OPf_SPECIAL; | |
1753 | PL_hints |= HINT_BLOCK_SCOPE; | |
1754 | break; | |
1755 | case 0: | |
1756 | break; | |
1757 | case -1: | |
a2a5de95 NC |
1758 | Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), |
1759 | "Useless localization of %s", OP_DESC(o)); | |
ddeae0f1 | 1760 | } |
463ee0b2 | 1761 | } |
8be1be90 AMS |
1762 | else if (type != OP_GREPSTART && type != OP_ENTERSUB |
1763 | && type != OP_LEAVESUBLV) | |
1764 | o->op_flags |= OPf_REF; | |
11343788 | 1765 | return o; |
463ee0b2 LW |
1766 | } |
1767 | ||
864dbfa3 | 1768 | STATIC bool |
5f66b61c | 1769 | S_scalar_mod_type(const OP *o, I32 type) |
3fe9a6f1 | 1770 | { |
7918f24d NC |
1771 | PERL_ARGS_ASSERT_SCALAR_MOD_TYPE; |
1772 | ||
3fe9a6f1 | 1773 | switch (type) { |
1774 | case OP_SASSIGN: | |
5196be3e | 1775 | if (o->op_type == OP_RV2GV) |
3fe9a6f1 | 1776 | return FALSE; |
1777 | /* FALL THROUGH */ | |
1778 | case OP_PREINC: | |
1779 | case OP_PREDEC: | |
1780 | case OP_POSTINC: | |
1781 | case OP_POSTDEC: | |
1782 | case OP_I_PREINC: | |
1783 | case OP_I_PREDEC: | |
1784 | case OP_I_POSTINC: | |
1785 | case OP_I_POSTDEC: | |
1786 | case OP_POW: | |
1787 | case OP_MULTIPLY: | |
1788 | case OP_DIVIDE: | |
1789 | case OP_MODULO: | |
1790 | case OP_REPEAT: | |
1791 | case OP_ADD: | |
1792 | case OP_SUBTRACT: | |
1793 | case OP_I_MULTIPLY: | |
1794 | case OP_I_DIVIDE: | |
1795 | case OP_I_MODULO: | |
1796 | case OP_I_ADD: | |
1797 | case OP_I_SUBTRACT: | |
1798 | case OP_LEFT_SHIFT: | |
1799 | case OP_RIGHT_SHIFT: | |
1800 | case OP_BIT_AND: | |
1801 | case OP_BIT_XOR: | |
1802 | case OP_BIT_OR: | |
1803 | case OP_CONCAT: | |
1804 | case OP_SUBST: | |
1805 | case OP_TRANS: | |
49e9fbe6 GS |
1806 | case OP_READ: |
1807 | case OP_SYSREAD: | |
1808 | case OP_RECV: | |
bf4b1e52 GS |
1809 | case OP_ANDASSIGN: |
1810 | case OP_ORASSIGN: | |
410d09fe | 1811 | case OP_DORASSIGN: |
3fe9a6f1 | 1812 | return TRUE; |
1813 | default: | |
1814 | return FALSE; | |
1815 | } | |
1816 | } | |
1817 | ||
35cd451c | 1818 | STATIC bool |
5f66b61c | 1819 | S_is_handle_constructor(const OP *o, I32 numargs) |
35cd451c | 1820 | { |
7918f24d NC |
1821 | PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR; |
1822 | ||
35cd451c GS |
1823 | switch (o->op_type) { |
1824 | case OP_PIPE_OP: | |
1825 | case OP_SOCKPAIR: | |
504618e9 | 1826 | if (numargs == 2) |
35cd451c GS |
1827 | return TRUE; |
1828 | /* FALL THROUGH */ | |
1829 | case OP_SYSOPEN: | |
1830 | case OP_OPEN: | |
ded8aa31 | 1831 | case OP_SELECT: /* XXX c.f. SelectSaver.pm */ |
35cd451c GS |
1832 | case OP_SOCKET: |
1833 | case OP_OPEN_DIR: | |
1834 | case OP_ACCEPT: | |
504618e9 | 1835 | if (numargs == 1) |
35cd451c | 1836 | return TRUE; |
5f66b61c | 1837 | /* FALLTHROUGH */ |
35cd451c GS |
1838 | default: |
1839 | return FALSE; | |
1840 | } | |
1841 | } | |
1842 | ||
0d86688d NC |
1843 | static OP * |
1844 | S_refkids(pTHX_ OP *o, I32 type) | |
463ee0b2 | 1845 | { |
11343788 | 1846 | if (o && o->op_flags & OPf_KIDS) { |
6867be6d | 1847 | OP *kid; |
11343788 | 1848 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
463ee0b2 LW |
1849 | ref(kid, type); |
1850 | } | |
11343788 | 1851 | return o; |
463ee0b2 LW |
1852 | } |
1853 | ||
1854 | OP * | |
e4c5ccf3 | 1855 | Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref) |
463ee0b2 | 1856 | { |
27da23d5 | 1857 | dVAR; |
463ee0b2 | 1858 | OP *kid; |
463ee0b2 | 1859 | |
7918f24d NC |
1860 | PERL_ARGS_ASSERT_DOREF; |
1861 | ||
13765c85 | 1862 | if (!o || (PL_parser && PL_parser->error_count)) |
11343788 | 1863 | return o; |
463ee0b2 | 1864 | |
11343788 | 1865 | switch (o->op_type) { |
a0d0e21e | 1866 | case OP_ENTERSUB: |
afebc493 | 1867 | if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) && |
11343788 MB |
1868 | !(o->op_flags & OPf_STACKED)) { |
1869 | o->op_type = OP_RV2CV; /* entersub => rv2cv */ | |
22c35a8c | 1870 | o->op_ppaddr = PL_ppaddr[OP_RV2CV]; |
11343788 | 1871 | assert(cUNOPo->op_first->op_type == OP_NULL); |
93c66552 | 1872 | op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */ |
11343788 | 1873 | o->op_flags |= OPf_SPECIAL; |
e26df76a | 1874 | o->op_private &= ~1; |
8990e307 LW |
1875 | } |
1876 | break; | |
aeea060c | 1877 | |
463ee0b2 | 1878 | case OP_COND_EXPR: |
11343788 | 1879 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
e4c5ccf3 | 1880 | doref(kid, type, set_op_ref); |
463ee0b2 | 1881 | break; |
8990e307 | 1882 | case OP_RV2SV: |
35cd451c GS |
1883 | if (type == OP_DEFINED) |
1884 | o->op_flags |= OPf_SPECIAL; /* don't create GV */ | |
e4c5ccf3 | 1885 | doref(cUNOPo->op_first, o->op_type, set_op_ref); |
4633a7c4 LW |
1886 | /* FALL THROUGH */ |
1887 | case OP_PADSV: | |
5f05dabc | 1888 | if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) { |
5dc0d613 MB |
1889 | o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV |
1890 | : type == OP_RV2HV ? OPpDEREF_HV | |
1891 | : OPpDEREF_SV); | |
11343788 | 1892 | o->op_flags |= OPf_MOD; |
a0d0e21e | 1893 | } |
8990e307 | 1894 | break; |
1c846c1f | 1895 | |
463ee0b2 LW |
1896 | case OP_RV2AV: |
1897 | case OP_RV2HV: | |
e4c5ccf3 RH |
1898 | if (set_op_ref) |
1899 | o->op_flags |= OPf_REF; | |
8990e307 | 1900 | /* FALL THROUGH */ |
463ee0b2 | 1901 | case OP_RV2GV: |
35cd451c GS |
1902 | if (type == OP_DEFINED) |
1903 | o->op_flags |= OPf_SPECIAL; /* don't create GV */ | |
e4c5ccf3 | 1904 | doref(cUNOPo->op_first, o->op_type, set_op_ref); |
463ee0b2 | 1905 | break; |
8990e307 | 1906 | |
463ee0b2 LW |
1907 | case OP_PADAV: |
1908 | case OP_PADHV: | |
e4c5ccf3 RH |
1909 | if (set_op_ref) |
1910 | o->op_flags |= OPf_REF; | |
79072805 | 1911 | break; |
aeea060c | 1912 | |
8990e307 | 1913 | case OP_SCALAR: |
79072805 | 1914 | case OP_NULL: |
11343788 | 1915 | if (!(o->op_flags & OPf_KIDS)) |
463ee0b2 | 1916 | break; |
e4c5ccf3 | 1917 | doref(cBINOPo->op_first, type, set_op_ref); |
79072805 LW |
1918 | break; |
1919 | case OP_AELEM: | |
1920 | case OP_HELEM: | |
e4c5ccf3 | 1921 | doref(cBINOPo->op_first, o->op_type, set_op_ref); |
5f05dabc | 1922 | if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) { |
5dc0d613 MB |
1923 | o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV |
1924 | : type == OP_RV2HV ? OPpDEREF_HV | |
1925 | : OPpDEREF_SV); | |
11343788 | 1926 | o->op_flags |= OPf_MOD; |
8990e307 | 1927 | } |
79072805 LW |
1928 | break; |
1929 | ||
463ee0b2 | 1930 | case OP_SCOPE: |
79072805 | 1931 | case OP_LEAVE: |
e4c5ccf3 RH |
1932 | set_op_ref = FALSE; |
1933 | /* FALL THROUGH */ | |
79072805 | 1934 | case OP_ENTER: |
8990e307 | 1935 | case OP_LIST: |
11343788 | 1936 | if (!(o->op_flags & OPf_KIDS)) |
79072805 | 1937 | break; |
e4c5ccf3 | 1938 | doref(cLISTOPo->op_last, type, set_op_ref); |
79072805 | 1939 | break; |
a0d0e21e LW |
1940 | default: |
1941 | break; | |
79072805 | 1942 | } |
11343788 | 1943 | return scalar(o); |
8990e307 | 1944 | |
79072805 LW |
1945 | } |
1946 | ||
09bef843 SB |
1947 | STATIC OP * |
1948 | S_dup_attrlist(pTHX_ OP *o) | |
1949 | { | |
97aff369 | 1950 | dVAR; |
0bd48802 | 1951 | OP *rop; |
09bef843 | 1952 | |
7918f24d NC |
1953 | PERL_ARGS_ASSERT_DUP_ATTRLIST; |
1954 | ||
09bef843 SB |
1955 | /* An attrlist is either a simple OP_CONST or an OP_LIST with kids, |
1956 | * where the first kid is OP_PUSHMARK and the remaining ones | |
1957 | * are OP_CONST. We need to push the OP_CONST values. | |
1958 | */ | |
1959 | if (o->op_type == OP_CONST) | |
b37c2d43 | 1960 | rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv)); |
eb8433b7 NC |
1961 | #ifdef PERL_MAD |
1962 | else if (o->op_type == OP_NULL) | |
1d866c12 | 1963 | rop = NULL; |
eb8433b7 | 1964 | #endif |
09bef843 SB |
1965 | else { |
1966 | assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS)); | |
5f66b61c | 1967 | rop = NULL; |
09bef843 SB |
1968 | for (o = cLISTOPo->op_first; o; o=o->op_sibling) { |
1969 | if (o->op_type == OP_CONST) | |
2fcb4757 | 1970 | rop = op_append_elem(OP_LIST, rop, |
09bef843 | 1971 | newSVOP(OP_CONST, o->op_flags, |
b37c2d43 | 1972 | SvREFCNT_inc_NN(cSVOPo->op_sv))); |
09bef843 SB |
1973 | } |
1974 | } | |
1975 | return rop; | |
1976 | } | |
1977 | ||
1978 | STATIC void | |
95f0a2f1 | 1979 | S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my) |
09bef843 | 1980 | { |
27da23d5 | 1981 | dVAR; |
09bef843 SB |
1982 | SV *stashsv; |
1983 | ||
7918f24d NC |
1984 | PERL_ARGS_ASSERT_APPLY_ATTRS; |
1985 | ||
09bef843 SB |
1986 | /* fake up C<use attributes $pkg,$rv,@attrs> */ |
1987 | ENTER; /* need to protect against side-effects of 'use' */ | |
5aaec2b4 | 1988 | stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no; |
e4783991 | 1989 | |
09bef843 | 1990 | #define ATTRSMODULE "attributes" |
95f0a2f1 SB |
1991 | #define ATTRSMODULE_PM "attributes.pm" |
1992 | ||
1993 | if (for_my) { | |
95f0a2f1 | 1994 | /* Don't force the C<use> if we don't need it. */ |
a4fc7abc | 1995 | SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE); |
95f0a2f1 | 1996 | if (svp && *svp != &PL_sv_undef) |
6f207bd3 | 1997 | NOOP; /* already in %INC */ |
95f0a2f1 SB |
1998 | else |
1999 | Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT, | |
6136c704 | 2000 | newSVpvs(ATTRSMODULE), NULL); |
95f0a2f1 SB |
2001 | } |
2002 | else { | |
2003 | Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS, | |
6136c704 AL |
2004 | newSVpvs(ATTRSMODULE), |
2005 | NULL, | |
2fcb4757 | 2006 | op_prepend_elem(OP_LIST, |
95f0a2f1 | 2007 | newSVOP(OP_CONST, 0, stashsv), |
2fcb4757 | 2008 | op_prepend_elem(OP_LIST, |
95f0a2f1 SB |
2009 | newSVOP(OP_CONST, 0, |
2010 | newRV(target)), | |
2011 | dup_attrlist(attrs)))); | |
2012 | } | |
09bef843 SB |
2013 | LEAVE; |
2014 | } | |
2015 | ||
95f0a2f1 SB |
2016 | STATIC void |
2017 | S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp) | |
2018 | { | |
97aff369 | 2019 | dVAR; |
95f0a2f1 SB |
2020 | OP *pack, *imop, *arg; |
2021 | SV *meth, *stashsv; | |
2022 | ||
7918f24d NC |
2023 | PERL_ARGS_ASSERT_APPLY_ATTRS_MY; |
2024 | ||
95f0a2f1 SB |
2025 | if (!attrs) |
2026 | return; | |
2027 | ||
2028 | assert(target->op_type == OP_PADSV || | |
2029 | target->op_type == OP_PADHV || | |
2030 | target->op_type == OP_PADAV); | |
2031 | ||
2032 | /* Ensure that attributes.pm is loaded. */ | |
dd2155a4 | 2033 | apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE); |
95f0a2f1 SB |
2034 | |
2035 | /* Need package name for method call. */ | |
6136c704 | 2036 | pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE)); |
95f0a2f1 SB |
2037 | |
2038 | /* Build up the real arg-list. */ | |
5aaec2b4 NC |
2039 | stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no; |
2040 | ||
95f0a2f1 SB |
2041 | arg = newOP(OP_PADSV, 0); |
2042 | arg->op_targ = target->op_targ; | |
2fcb4757 | 2043 | arg = op_prepend_elem(OP_LIST, |
95f0a2f1 | 2044 | newSVOP(OP_CONST, 0, stashsv), |
2fcb4757 | 2045 | op_prepend_elem(OP_LIST, |
95f0a2f1 SB |
2046 | newUNOP(OP_REFGEN, 0, |
2047 | mod(arg, OP_REFGEN)), | |
2048 | dup_attrlist(attrs))); | |
2049 | ||
2050 | /* Fake up a method call to import */ | |
18916d0d | 2051 | meth = newSVpvs_share("import"); |
95f0a2f1 | 2052 | imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID, |
2fcb4757 Z |
2053 | op_append_elem(OP_LIST, |
2054 | op_prepend_elem(OP_LIST, pack, list(arg)), | |
95f0a2f1 SB |
2055 | newSVOP(OP_METHOD_NAMED, 0, meth))); |
2056 | imop->op_private |= OPpENTERSUB_NOMOD; | |
2057 | ||
2058 | /* Combine the ops. */ | |
2fcb4757 | 2059 | *imopsp = op_append_elem(OP_LIST, *imopsp, imop); |
95f0a2f1 SB |
2060 | } |
2061 | ||
2062 | /* | |
2063 | =notfor apidoc apply_attrs_string | |
2064 | ||
2065 | Attempts to apply a list of attributes specified by the C<attrstr> and | |
2066 | C<len> arguments to the subroutine identified by the C<cv> argument which | |
2067 | is expected to be associated with the package identified by the C<stashpv> | |
2068 | argument (see L<attributes>). It gets this wrong, though, in that it | |
2069 | does not correctly identify the boundaries of the individual attribute | |
2070 | specifications within C<attrstr>. This is not really intended for the | |
2071 | public API, but has to be listed here for systems such as AIX which | |
2072 | need an explicit export list for symbols. (It's called from XS code | |
2073 | in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it | |
2074 | to respect attribute syntax properly would be welcome. | |
2075 | ||
2076 | =cut | |
2077 | */ | |
2078 | ||
be3174d2 | 2079 | void |
6867be6d AL |
2080 | Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv, |
2081 | const char *attrstr, STRLEN len) | |
be3174d2 | 2082 | { |
5f66b61c | 2083 | OP *attrs = NULL; |
be3174d2 | 2084 | |
7918f24d NC |
2085 | PERL_ARGS_ASSERT_APPLY_ATTRS_STRING; |
2086 | ||
be3174d2 GS |
2087 | if (!len) { |
2088 | len = strlen(attrstr); | |
2089 | } | |
2090 | ||
2091 | while (len) { | |
2092 | for (; isSPACE(*attrstr) && len; --len, ++attrstr) ; | |
2093 | if (len) { | |
890ce7af | 2094 | const char * const sstr = attrstr; |
be3174d2 | 2095 | for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ; |
2fcb4757 | 2096 | attrs = op_append_elem(OP_LIST, attrs, |
be3174d2 GS |
2097 | newSVOP(OP_CONST, 0, |
2098 | newSVpvn(sstr, attrstr-sstr))); | |
2099 | } | |
2100 | } | |
2101 | ||
2102 | Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS, | |
6136c704 | 2103 | newSVpvs(ATTRSMODULE), |
2fcb4757 | 2104 | NULL, op_prepend_elem(OP_LIST, |
be3174d2 | 2105 | newSVOP(OP_CONST, 0, newSVpv(stashpv,0)), |
2fcb4757 | 2106 | op_prepend_elem(OP_LIST, |
be3174d2 | 2107 | newSVOP(OP_CONST, 0, |
ad64d0ec | 2108 | newRV(MUTABLE_SV(cv))), |
be3174d2 GS |
2109 | attrs))); |
2110 | } | |
2111 | ||
09bef843 | 2112 | STATIC OP * |
95f0a2f1 | 2113 | S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp) |
93a17b20 | 2114 | { |
97aff369 | 2115 | dVAR; |
93a17b20 LW |
2116 | I32 type; |
2117 | ||
7918f24d NC |
2118 | PERL_ARGS_ASSERT_MY_KID; |
2119 | ||
13765c85 | 2120 | if (!o || (PL_parser && PL_parser->error_count)) |
11343788 | 2121 | return o; |
93a17b20 | 2122 | |
bc61e325 | 2123 | type = o->op_type; |
eb8433b7 NC |
2124 | if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) { |
2125 | (void)my_kid(cUNOPo->op_first, attrs, imopsp); | |
2126 | return o; | |
2127 | } | |
2128 | ||
93a17b20 | 2129 | if (type == OP_LIST) { |
6867be6d | 2130 | OP *kid; |
11343788 | 2131 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
95f0a2f1 | 2132 | my_kid(kid, attrs, imopsp); |
eb8433b7 NC |
2133 | } else if (type == OP_UNDEF |
2134 | #ifdef PERL_MAD | |
2135 | || type == OP_STUB | |
2136 | #endif | |
2137 | ) { | |
7766148a | 2138 | return o; |
77ca0c92 LW |
2139 | } else if (type == OP_RV2SV || /* "our" declaration */ |
2140 | type == OP_RV2AV || | |
2141 | type == OP_RV2HV) { /* XXX does this let anything illegal in? */ | |
1ce0b88c | 2142 | if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */ |
fab01b8e | 2143 | yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"", |
952306ac | 2144 | OP_DESC(o), |
12bd6ede DM |
2145 | PL_parser->in_my == KEY_our |
2146 | ? "our" | |
2147 | : PL_parser->in_my == KEY_state ? "state" : "my")); | |
1ce0b88c | 2148 | } else if (attrs) { |
551405c4 | 2149 | GV * const gv = cGVOPx_gv(cUNOPo->op_first); |
12bd6ede DM |
2150 | PL_parser->in_my = FALSE; |
2151 | PL_parser->in_my_stash = NULL; | |
1ce0b88c RGS |
2152 | apply_attrs(GvSTASH(gv), |
2153 | (type == OP_RV2SV ? GvSV(gv) : | |
ad64d0ec NC |
2154 | type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) : |
2155 | type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)), | |
1ce0b88c RGS |
2156 | attrs, FALSE); |
2157 | } | |
192587c2 | 2158 | o->op_private |= OPpOUR_INTRO; |
77ca0c92 | 2159 | return o; |
95f0a2f1 SB |
2160 | } |
2161 | else if (type != OP_PADSV && | |
93a17b20 LW |
2162 | type != OP_PADAV && |
2163 | type != OP_PADHV && | |
2164 | type != OP_PUSHMARK) | |
2165 | { | |
eb64745e | 2166 | yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"", |
53e06cf0 | 2167 | OP_DESC(o), |
12bd6ede DM |
2168 | PL_parser->in_my == KEY_our |
2169 | ? "our" | |
2170 | : PL_parser->in_my == KEY_state ? "state" : "my")); | |
11343788 | 2171 | return o; |
93a17b20 | 2172 | } |
09bef843 SB |
2173 | else if (attrs && type != OP_PUSHMARK) { |
2174 | HV *stash; | |
09bef843 | 2175 | |
12bd6ede DM |
2176 | PL_parser->in_my = FALSE; |
2177 | PL_parser->in_my_stash = NULL; | |
eb64745e | 2178 | |
09bef843 | 2179 | /* check for C<my Dog $spot> when deciding package */ |
dd2155a4 DM |
2180 | stash = PAD_COMPNAME_TYPE(o->op_targ); |
2181 | if (!stash) | |
09bef843 | 2182 | stash = PL_curstash; |
95f0a2f1 | 2183 | apply_attrs_my(stash, o, attrs, imopsp); |
09bef843 | 2184 | } |
11343788 MB |
2185 | o->op_flags |= OPf_MOD; |
2186 | o->op_private |= OPpLVAL_INTRO; | |
12bd6ede | 2187 | if (PL_parser->in_my == KEY_state) |
952306ac | 2188 | o->op_private |= OPpPAD_STATE; |
11343788 | 2189 | return o; |
93a17b20 LW |
2190 | } |
2191 | ||
2192 | OP * | |
09bef843 SB |
2193 | Perl_my_attrs(pTHX_ OP *o, OP *attrs) |
2194 | { | |
97aff369 | 2195 | dVAR; |
0bd48802 | 2196 | OP *rops; |
95f0a2f1 SB |
2197 | int maybe_scalar = 0; |
2198 | ||
7918f24d NC |
2199 | PERL_ARGS_ASSERT_MY_ATTRS; |
2200 | ||
d2be0de5 | 2201 | /* [perl #17376]: this appears to be premature, and results in code such as |
c754c3d7 | 2202 | C< our(%x); > executing in list mode rather than void mode */ |
d2be0de5 | 2203 | #if 0 |
09bef843 SB |
2204 | if (o->op_flags & OPf_PARENS) |
2205 | list(o); | |
95f0a2f1 SB |
2206 | else |
2207 | maybe_scalar = 1; | |
d2be0de5 YST |
2208 | #else |
2209 | maybe_scalar = 1; | |
2210 | #endif | |
09bef843 SB |
2211 | if (attrs) |
2212 | SAVEFREEOP(attrs); | |
5f66b61c | 2213 | rops = NULL; |
95f0a2f1 SB |
2214 | o = my_kid(o, attrs, &rops); |
2215 | if (rops) { | |
2216 | if (maybe_scalar && o->op_type == OP_PADSV) { | |
2fcb4757 | 2217 | o = scalar(op_append_list(OP_LIST, rops, o)); |
95f0a2f1 SB |
2218 | o->op_private |= OPpLVAL_INTRO; |
2219 | } | |
2220 | else | |
2fcb4757 | 2221 | o = op_append_list(OP_LIST, o, rops); |
95f0a2f1 | 2222 | } |
12bd6ede DM |
2223 | PL_parser->in_my = FALSE; |
2224 | PL_parser->in_my_stash = NULL; | |
eb64745e | 2225 | return o; |
09bef843 SB |
2226 | } |
2227 | ||
2228 | OP * | |
864dbfa3 | 2229 | Perl_sawparens(pTHX_ OP *o) |
79072805 | 2230 | { |
96a5add6 | 2231 | PERL_UNUSED_CONTEXT; |
79072805 LW |
2232 | if (o) |
2233 | o->op_flags |= OPf_PARENS; | |
2234 | return o; | |
2235 | } | |
2236 | ||
2237 | OP * | |
864dbfa3 | 2238 | Perl_bind_match(pTHX_ I32 type, OP *left, OP *right) |
79072805 | 2239 | { |
11343788 | 2240 | OP *o; |
59f00321 | 2241 | bool ismatchop = 0; |
1496a290 AL |
2242 | const OPCODE ltype = left->op_type; |
2243 | const OPCODE rtype = right->op_type; | |
79072805 | 2244 | |
7918f24d NC |
2245 | PERL_ARGS_ASSERT_BIND_MATCH; |
2246 | ||
1496a290 AL |
2247 | if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV |
2248 | || ltype == OP_PADHV) && ckWARN(WARN_MISC)) | |
041457d9 | 2249 | { |
1496a290 | 2250 | const char * const desc |
666ea192 JH |
2251 | = PL_op_desc[(rtype == OP_SUBST || rtype == OP_TRANS) |
2252 | ? (int)rtype : OP_MATCH]; | |
2253 | const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV) | |
2254 | ? "@array" : "%hash"); | |
9014280d | 2255 | Perl_warner(aTHX_ packWARN(WARN_MISC), |
1c846c1f | 2256 | "Applying %s to %s will act on scalar(%s)", |
599cee73 | 2257 | desc, sample, sample); |
2ae324a7 | 2258 | } |
2259 | ||
1496a290 | 2260 | if (rtype == OP_CONST && |
5cc9e5c9 RH |
2261 | cSVOPx(right)->op_private & OPpCONST_BARE && |
2262 | cSVOPx(right)->op_private & OPpCONST_STRICT) | |
2263 | { | |
2264 | no_bareword_allowed(right); | |
2265 | } | |
2266 | ||
4f4d7508 DC |
2267 | /* !~ doesn't make sense with s///r, so error on it for now */ |
2268 | if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) && | |
2269 | type == OP_NOT) | |
2270 | yyerror("Using !~ with s///r doesn't make sense"); | |
2271 | ||
2474a784 FC |
2272 | ismatchop = (rtype == OP_MATCH || |
2273 | rtype == OP_SUBST || | |
2274 | rtype == OP_TRANS) | |
2275 | && !(right->op_flags & OPf_SPECIAL); | |
59f00321 RGS |
2276 | if (ismatchop && right->op_private & OPpTARGET_MY) { |
2277 | right->op_targ = 0; | |
2278 | right->op_private &= ~OPpTARGET_MY; | |
2279 | } | |
2280 | if (!(right->op_flags & OPf_STACKED) && ismatchop) { | |
1496a290 AL |
2281 | OP *newleft; |
2282 | ||
79072805 | 2283 | right->op_flags |= OPf_STACKED; |
1496a290 AL |
2284 | if (rtype != OP_MATCH && |
2285 | ! (rtype == OP_TRANS && | |
4f4d7508 DC |
2286 | right->op_private & OPpTRANS_IDENTICAL) && |
2287 | ! (rtype == OP_SUBST && | |
2288 | (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT))) | |
1496a290 AL |
2289 | newleft = mod(left, rtype); |
2290 | else | |
2291 | newleft = left; | |
79072805 | 2292 | if (right->op_type == OP_TRANS) |
1496a290 | 2293 | o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right); |
79072805 | 2294 | else |
2fcb4757 | 2295 | o = op_prepend_elem(rtype, scalar(newleft), right); |
79072805 | 2296 | if (type == OP_NOT) |
11343788 MB |
2297 | return newUNOP(OP_NOT, 0, scalar(o)); |
2298 | return o; | |
79072805 LW |
2299 | } |
2300 | else | |
2301 | return bind_match(type, left, | |
131b3ad0 | 2302 | pmruntime(newPMOP(OP_MATCH, 0), right, 0)); |
79072805 LW |
2303 | } |
2304 | ||
2305 | OP * | |
864dbfa3 | 2306 | Perl_invert(pTHX_ OP *o) |
79072805 | 2307 | { |
11343788 | 2308 | if (!o) |
1d866c12 | 2309 | return NULL; |
11343788 | 2310 | return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o)); |
79072805 LW |
2311 | } |
2312 | ||
2313 | OP * | |
864dbfa3 | 2314 | Perl_scope(pTHX_ OP *o) |
79072805 | 2315 | { |
27da23d5 | 2316 | dVAR; |
79072805 | 2317 | if (o) { |
3280af22 | 2318 | if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) { |
2fcb4757 | 2319 | o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o); |
463ee0b2 | 2320 | o->op_type = OP_LEAVE; |
22c35a8c | 2321 | o->op_ppaddr = PL_ppaddr[OP_LEAVE]; |
463ee0b2 | 2322 | } |
fdb22418 HS |
2323 | else if (o->op_type == OP_LINESEQ) { |
2324 | OP *kid; | |
2325 | o->op_type = OP_SCOPE; | |
2326 | o->op_ppaddr = PL_ppaddr[OP_SCOPE]; | |
2327 | kid = ((LISTOP*)o)->op_first; | |
59110972 | 2328 | if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) { |
fdb22418 | 2329 | op_null(kid); |
59110972 RH |
2330 | |
2331 | /* The following deals with things like 'do {1 for 1}' */ | |
2332 | kid = kid->op_sibling; | |
2333 | if (kid && | |
2334 | (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)) | |
2335 | op_null(kid); | |
2336 | } | |
463ee0b2 | 2337 | } |
fdb22418 | 2338 | else |
5f66b61c | 2339 | o = newLISTOP(OP_SCOPE, 0, o, NULL); |
79072805 LW |
2340 | } |
2341 | return o; | |
2342 | } | |
1930840b | 2343 | |
a0d0e21e | 2344 | int |
864dbfa3 | 2345 | Perl_block_start(pTHX_ int full) |
79072805 | 2346 | { |
97aff369 | 2347 | dVAR; |
73d840c0 | 2348 | const int retval = PL_savestack_ix; |
1930840b | 2349 | |
dd2155a4 | 2350 | pad_block_start(full); |
b3ac6de7 | 2351 | SAVEHINTS(); |
3280af22 | 2352 | PL_hints &= ~HINT_BLOCK_SCOPE; |
68da3b2f | 2353 | SAVECOMPILEWARNINGS(); |
72dc9ed5 | 2354 | PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings); |
1930840b | 2355 | |
a88d97bf | 2356 | CALL_BLOCK_HOOKS(bhk_start, full); |
1930840b | 2357 | |
a0d0e21e LW |
2358 | return retval; |
2359 | } | |
2360 | ||
2361 | OP* | |
864dbfa3 | 2362 | Perl_block_end(pTHX_ I32 floor, OP *seq) |
a0d0e21e | 2363 | { |
97aff369 | 2364 | dVAR; |
6867be6d | 2365 | const int needblockscope = PL_hints & HINT_BLOCK_SCOPE; |
1930840b BM |
2366 | OP* retval = scalarseq(seq); |
2367 | ||
a88d97bf | 2368 | CALL_BLOCK_HOOKS(bhk_pre_end, &retval); |
1930840b | 2369 | |
e9818f4e | 2370 | LEAVE_SCOPE(floor); |
623e6609 | 2371 | CopHINTS_set(&PL_compiling, PL_hints); |
a0d0e21e | 2372 | if (needblockscope) |
3280af22 | 2373 | PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */ |
dd2155a4 | 2374 | pad_leavemy(); |
1930840b | 2375 | |
a88d97bf | 2376 | CALL_BLOCK_HOOKS(bhk_post_end, &retval); |
1930840b | 2377 | |
a0d0e21e LW |
2378 | return retval; |
2379 | } | |
2380 | ||
fd85fad2 BM |
2381 | /* |
2382 | =head1 Compile-time scope hooks | |
2383 | ||
2384 | =for apidoc Ao||blockhook_register | |
2385 | ||
2386 | Register a set of hooks to be called when the Perl lexical scope changes | |
2387 | at compile time. See L<perlguts/"Compile-time scope hooks">. | |
2388 | ||
2389 | =cut | |
2390 | */ | |
2391 | ||
bb6c22e7 BM |
2392 | void |
2393 | Perl_blockhook_register(pTHX_ BHK *hk) | |
2394 | { | |
2395 | PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER; | |
2396 | ||
2397 | Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk))); | |
2398 | } | |
2399 | ||
76e3520e | 2400 | STATIC OP * |
cea2e8a9 | 2401 | S_newDEFSVOP(pTHX) |
54b9620d | 2402 | { |
97aff369 | 2403 | dVAR; |
f8f98e0a | 2404 | const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0); |
00b1698f | 2405 | if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) { |
59f00321 RGS |
2406 | return newSVREF(newGVOP(OP_GV, 0, PL_defgv)); |
2407 | } | |
2408 | else { | |
551405c4 | 2409 | OP * const o = newOP(OP_PADSV, 0); |
59f00321 RGS |
2410 | o->op_targ = offset; |
2411 | return o; | |
2412 | } | |
54b9620d MB |
2413 | } |
2414 | ||
a0d0e21e | 2415 | void |
864dbfa3 | 2416 | Perl_newPROG(pTHX_ OP *o) |
a0d0e21e | 2417 | { |
97aff369 | 2418 | dVAR; |
7918f24d NC |
2419 | |
2420 | PERL_ARGS_ASSERT_NEWPROG; | |
2421 | ||
3280af22 | 2422 | if (PL_in_eval) { |
b295d113 TH |
2423 | if (PL_eval_root) |
2424 | return; | |
faef0170 HS |
2425 | PL_eval_root = newUNOP(OP_LEAVEEVAL, |
2426 | ((PL_in_eval & EVAL_KEEPERR) | |
2427 | ? OPf_SPECIAL : 0), o); | |
5983a79d BM |
2428 | /* don't use LINKLIST, since PL_eval_root might indirect through |
2429 | * a rather expensive function call and LINKLIST evaluates its | |
2430 | * argument more than once */ | |
2431 | PL_eval_start = op_linklist(PL_eval_root); | |
7934575e GS |
2432 | PL_eval_root->op_private |= OPpREFCOUNTED; |
2433 | OpREFCNT_set(PL_eval_root, 1); | |
3280af22 | 2434 | PL_eval_root->op_next = 0; |
a2efc822 | 2435 | CALL_PEEP(PL_eval_start); |
a0d0e21e LW |
2436 | } |
2437 | else { | |
6be89cf9 AE |
2438 | if (o->op_type == OP_STUB) { |
2439 | PL_comppad_name = 0; | |
2440 | PL_compcv = 0; | |
d2c837a0 | 2441 | S_op_destroy(aTHX_ o); |
a0d0e21e | 2442 | return; |
6be89cf9 | 2443 | } |
3280af22 NIS |
2444 | PL_main_root = scope(sawparens(scalarvoid(o))); |
2445 | PL_curcop = &PL_compiling; | |
2446 | PL_main_start = LINKLIST(PL_main_root); | |
7934575e GS |
2447 | PL_main_root->op_private |= OPpREFCOUNTED; |
2448 | OpREFCNT_set(PL_main_root, 1); | |
3280af22 | 2449 | PL_main_root->op_next = 0; |
a2efc822 | 2450 | CALL_PEEP(PL_main_start); |
3280af22 | 2451 | PL_compcv = 0; |
3841441e | 2452 | |
4fdae800 | 2453 | /* Register with debugger */ |
84902520 | 2454 | if (PERLDB_INTER) { |
b96d8cd9 | 2455 | CV * const cv = get_cvs("DB::postponed", 0); |
3841441e CS |
2456 | if (cv) { |
2457 | dSP; | |
924508f0 | 2458 | PUSHMARK(SP); |
ad64d0ec | 2459 | XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling))); |
3841441e | 2460 | PUTBACK; |
ad64d0ec | 2461 | call_sv(MUTABLE_SV(cv), G_DISCARD); |
3841441e CS |
2462 | } |
2463 | } | |
79072805 | 2464 | } |
79072805 LW |
2465 | } |
2466 | ||
2467 | OP * | |
864dbfa3 | 2468 | Perl_localize(pTHX_ OP *o, I32 lex) |
79072805 | 2469 | { |
97aff369 | 2470 | dVAR; |
7918f24d NC |
2471 | |
2472 | PERL_ARGS_ASSERT_LOCALIZE; | |
2473 | ||
79072805 | 2474 | if (o->op_flags & OPf_PARENS) |
d2be0de5 YST |
2475 | /* [perl #17376]: this appears to be premature, and results in code such as |
2476 | C< our(%x); > executing in list mode rather than void mode */ | |
2477 | #if 0 | |
79072805 | 2478 | list(o); |
d2be0de5 | 2479 | #else |
6f207bd3 | 2480 | NOOP; |
d2be0de5 | 2481 | #endif |
8990e307 | 2482 | else { |
f06b5848 DM |
2483 | if ( PL_parser->bufptr > PL_parser->oldbufptr |
2484 | && PL_parser->bufptr[-1] == ',' | |
041457d9 | 2485 | && ckWARN(WARN_PARENTHESIS)) |
64420d0d | 2486 | { |
f06b5848 | 2487 | char *s = PL_parser->bufptr; |
bac662ee | 2488 | bool sigil = FALSE; |
64420d0d | 2489 | |
8473848f | 2490 | /* some heuristics to detect a potential error */ |
bac662ee | 2491 | while (*s && (strchr(", \t\n", *s))) |
64420d0d | 2492 | s++; |
8473848f | 2493 | |
bac662ee TS |
2494 | while (1) { |
2495 | if (*s && strchr("@$%*", *s) && *++s | |
2496 | && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) { | |
2497 | s++; | |
2498 | sigil = TRUE; | |
2499 | while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) | |
2500 | s++; | |
2501 | while (*s && (strchr(", \t\n", *s))) | |
2502 | s++; | |
2503 | } | |
2504 | else | |
2505 | break; | |
2506 | } | |
2507 | if (sigil && (*s == ';' || *s == '=')) { | |
2508 | Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS), | |
8473848f | 2509 | "Parentheses missing around \"%s\" list", |
12bd6ede DM |
2510 | lex |
2511 | ? (PL_parser->in_my == KEY_our | |
2512 | ? "our" | |
2513 | : PL_parser->in_my == KEY_state | |
2514 | ? "state" | |
2515 | : "my") | |
2516 | : "local"); | |
8473848f | 2517 | } |
8990e307 LW |
2518 | } |
2519 | } | |
93a17b20 | 2520 | if (lex) |
eb64745e | 2521 | o = my(o); |
93a17b20 | 2522 | else |
eb64745e | 2523 | o = mod(o, OP_NULL); /* a bit kludgey */ |
12bd6ede DM |
2524 | PL_parser->in_my = FALSE; |
2525 | PL_parser->in_my_stash = NULL; | |
eb64745e | 2526 | return o; |
79072805 LW |
2527 | } |
2528 | ||
2529 | OP * | |
864dbfa3 | 2530 | Perl_jmaybe(pTHX_ OP *o) |
79072805 | 2531 | { |
7918f24d NC |
2532 | PERL_ARGS_ASSERT_JMAYBE; |
2533 | ||
79072805 | 2534 | if (o->op_type == OP_LIST) { |
fafc274c | 2535 | OP * const o2 |
d4c19fe8 | 2536 | = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV))); |
2fcb4757 | 2537 | o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o)); |
79072805 LW |
2538 | } |
2539 | return o; | |
2540 | } | |
2541 | ||
1f676739 | 2542 | static OP * |
b7783a12 | 2543 | S_fold_constants(pTHX_ register OP *o) |
79072805 | 2544 | { |
27da23d5 | 2545 | dVAR; |
001d637e | 2546 | register OP * VOL curop; |
eb8433b7 | 2547 | OP *newop; |
8ea43dc8 | 2548 | VOL I32 type = o->op_type; |
e3cbe32f | 2549 | SV * VOL sv = NULL; |
b7f7fd0b NC |
2550 | int ret = 0; |
2551 | I32 oldscope; | |
2552 | OP *old_next; | |
5f2d9966 DM |
2553 | SV * const oldwarnhook = PL_warnhook; |
2554 | SV * const olddiehook = PL_diehook; | |
c427f4d2 | 2555 | COP not_compiling; |
b7f7fd0b | 2556 | dJMPENV; |
79072805 | 2557 | |
7918f24d NC |
2558 | PERL_ARGS_ASSERT_FOLD_CONSTANTS; |
2559 | ||
22c35a8c | 2560 | if (PL_opargs[type] & OA_RETSCALAR) |
79072805 | 2561 | scalar(o); |
b162f9ea | 2562 | if (PL_opargs[type] & OA_TARGET && !o->op_targ) |
ed6116ce | 2563 | o->op_targ = pad_alloc(type, SVs_PADTMP); |
79072805 | 2564 | |
eac055e9 GS |
2565 | /* integerize op, unless it happens to be C<-foo>. |
2566 | * XXX should pp_i_negate() do magic string negation instead? */ | |
2567 | if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER) | |
2568 | && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST | |
2569 | && (cUNOPo->op_first->op_private & OPpCONST_BARE))) | |
2570 | { | |
22c35a8c | 2571 | o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)]; |
eac055e9 | 2572 | } |
85e6fe83 | 2573 | |
22c35a8c | 2574 | if (!(PL_opargs[type] & OA_FOLDCONST)) |
79072805 LW |
2575 | goto nope; |
2576 | ||
de939608 | 2577 | switch (type) { |
7a52d87a GS |
2578 | case OP_NEGATE: |
2579 | /* XXX might want a ck_negate() for this */ | |
2580 | cUNOPo->op_first->op_private &= ~OPpCONST_STRICT; | |
2581 | break; | |
de939608 CS |
2582 | case OP_UCFIRST: |
2583 | case OP_LCFIRST: | |
2584 | case OP_UC: | |
2585 | case OP_LC: | |
69dcf70c MB |
2586 | case OP_SLT: |
2587 | case OP_SGT: | |
2588 | case OP_SLE: | |
2589 | case OP_SGE: | |
2590 | case OP_SCMP: | |
2de3dbcc JH |
2591 | /* XXX what about the numeric ops? */ |
2592 | if (PL_hints & HINT_LOCALE) | |
de939608 | 2593 | goto nope; |
553e7bb0 | 2594 | break; |
de939608 CS |
2595 | } |
2596 | ||
13765c85 | 2597 | if (PL_parser && PL_parser->error_count) |
a0d0e21e LW |
2598 | goto nope; /* Don't try to run w/ errors */ |
2599 | ||
79072805 | 2600 | for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) { |
1496a290 AL |
2601 | const OPCODE type = curop->op_type; |
2602 | if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) && | |
2603 | type != OP_LIST && | |
2604 | type != OP_SCALAR && | |
2605 | type != OP_NULL && | |
2606 | type != OP_PUSHMARK) | |
7a52d87a | 2607 | { |
79072805 LW |
2608 | goto nope; |
2609 | } | |
2610 | } | |
2611 | ||
2612 | curop = LINKLIST(o); | |
b7f7fd0b | 2613 | old_next = o->op_next; |
79072805 | 2614 | o->op_next = 0; |
533c011a | 2615 | PL_op = curop; |
b7f7fd0b NC |
2616 | |
2617 | oldscope = PL_scopestack_ix; | |
edb2152a | 2618 | create_eval_scope(G_FAKINGEVAL); |
b7f7fd0b | 2619 | |
c427f4d2 NC |
2620 | /* Verify that we don't need to save it: */ |
2621 | assert(PL_curcop == &PL_compiling); | |
2622 | StructCopy(&PL_compiling, ¬_compiling, COP); | |
2623 | PL_curcop = ¬_compiling; | |
2624 | /* The above ensures that we run with all the correct hints of the | |
2625 | currently compiling COP, but that IN_PERL_RUNTIME is not true. */ | |
2626 | assert(IN_PERL_RUNTIME); | |
5f2d9966 DM |
2627 | PL_warnhook = PERL_WARNHOOK_FATAL; |
2628 | PL_diehook = NULL; | |
b7f7fd0b NC |
2629 | JMPENV_PUSH(ret); |
2630 | ||
2631 | switch (ret) { | |
2632 | case 0: | |
2633 | CALLRUNOPS(aTHX); | |
2634 | sv = *(PL_stack_sp--); | |
2635 | if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */ | |
2636 | pad_swipe(o->op_targ, FALSE); | |
2637 | else if (SvTEMP(sv)) { /* grab mortal temp? */ | |
2638 | SvREFCNT_inc_simple_void(sv); | |
2639 | SvTEMP_off(sv); | |
2640 | } | |
2641 | break; | |
2642 | case 3: | |
2643 | /* Something tried to die. Abandon constant folding. */ | |
2644 | /* Pretend the error never happened. */ | |
ab69dbc2 | 2645 | CLEAR_ERRSV(); |
b7f7fd0b NC |
2646 | o->op_next = old_next; |
2647 | break; | |
2648 | default: | |
2649 | JMPENV_POP; | |
5f2d9966 DM |
2650 | /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */ |
2651 | PL_warnhook = oldwarnhook; | |
2652 | PL_diehook = olddiehook; | |
2653 | /* XXX note that this croak may fail as we've already blown away | |
2654 | * the stack - eg any nested evals */ | |
b7f7fd0b NC |
2655 | Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret); |
2656 | } | |
b7f7fd0b | 2657 | JMPENV_POP; |
5f2d9966 DM |
2658 | PL_warnhook = oldwarnhook; |
2659 | PL_diehook = olddiehook; | |
c427f4d2 | 2660 | PL_curcop = &PL_compiling; |
edb2152a NC |
2661 | |
2662 | if (PL_scopestack_ix > oldscope) | |
2663 | delete_eval_scope(); | |
eb8433b7 | 2664 | |
b7f7fd0b NC |
2665 | if (ret) |
2666 | goto nope; | |
2667 | ||
eb8433b7 | 2668 | #ifndef PERL_MAD |
79072805 | 2669 | op_free(o); |
eb8433b7 | 2670 | #endif |
de5e01c2 | 2671 | assert(sv); |
79072805 | 2672 | if (type == OP_RV2GV) |
159b6efe | 2673 | newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv)); |
eb8433b7 | 2674 | else |
ad64d0ec | 2675 | newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv)); |
eb8433b7 NC |
2676 | op_getmad(o,newop,'f'); |
2677 | return newop; | |
aeea060c | 2678 | |
b7f7fd0b | 2679 | nope: |
79072805 LW |
2680 | return o; |
2681 | } | |
2682 | ||
1f676739 | 2683 | static OP * |
b7783a12 | 2684 | S_gen_constant_list(pTHX_ register OP *o) |
79072805 | 2685 | { |
27da23d5 | 2686 | dVAR; |
79072805 | 2687 | register OP *curop; |
6867be6d | 2688 | const I32 oldtmps_floor = PL_tmps_floor; |
79072805 | 2689 | |
a0d0e21e | 2690 | list(o); |
13765c85 | 2691 | if (PL_parser && PL_parser->error_count) |
a0d0e21e LW |
2692 | return o; /* Don't attempt to run with errors */ |
2693 | ||
533c011a | 2694 | PL_op = curop = LINKLIST(o); |
a0d0e21e | 2695 | o->op_next = 0; |
a2efc822 | 2696 | CALL_PEEP(curop); |
cea2e8a9 GS |
2697 | pp_pushmark(); |
2698 | CALLRUNOPS(aTHX); | |
533c011a | 2699 | PL_op = curop; |
78c72037 NC |
2700 | assert (!(curop->op_flags & OPf_SPECIAL)); |
2701 | assert(curop->op_type == OP_RANGE); | |
cea2e8a9 | 2702 | pp_anonlist(); |
3280af22 | 2703 | PL_tmps_floor = oldtmps_floor; |
79072805 LW |
2704 | |
2705 | o->op_type = OP_RV2AV; | |
22c35a8c | 2706 | o->op_ppaddr = PL_ppaddr[OP_RV2AV]; |
fb53bbb2 SG |
2707 | o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */ |
2708 | o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */ | |
1a0a2ba9 | 2709 | o->op_opt = 0; /* needs to be revisited in rpeep() */ |
79072805 | 2710 | curop = ((UNOP*)o)->op_first; |
b37c2d43 | 2711 | ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--)); |
eb8433b7 NC |
2712 | #ifdef PERL_MAD |
2713 | op_getmad(curop,o,'O'); | |
2714 | #else | |
79072805 | 2715 | op_free(curop); |
eb8433b7 | 2716 | #endif |
5983a79d | 2717 | LINKLIST(o); |
79072805 LW |
2718 | return list(o); |
2719 | } | |
2720 | ||
2721 | OP * | |
864dbfa3 | 2722 | Perl_convert(pTHX_ I32 type, I32 flags, OP *o) |
79072805 | 2723 | { |
27da23d5 | 2724 | dVAR; |
11343788 | 2725 | if (!o || o->op_type != OP_LIST) |
5f66b61c | 2726 | o = newLISTOP(OP_LIST, 0, o, NULL); |
748a9306 | 2727 | else |
5dc0d613 | 2728 | o->op_flags &= ~OPf_WANT; |
79072805 | 2729 | |
22c35a8c | 2730 | if (!(PL_opargs[type] & OA_MARK)) |
93c66552 | 2731 | op_null(cLISTOPo->op_first); |
8990e307 | 2732 | |
eb160463 | 2733 | o->op_type = (OPCODE)type; |
22c35a8c | 2734 | o->op_ppaddr = PL_ppaddr[type]; |
11343788 | 2735 | o->op_flags |= flags; |
79072805 | 2736 | |
11343788 | 2737 | o = CHECKOP(type, o); |
fe2774ed | 2738 | if (o->op_type != (unsigned)type) |
11343788 | 2739 | return o; |
79072805 | 2740 | |
11343788 | 2741 | return fold_constants(o); |
79072805 LW |
2742 | } |
2743 | ||
2fcb4757 Z |
2744 | /* |
2745 | =head1 Optree Manipulation Functions | |
2746 | */ | |
2747 | ||
79072805 LW |
2748 | /* List constructors */ |
2749 | ||
2fcb4757 Z |
2750 | /* |
2751 | =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last | |
2752 | ||
2753 | Append an item to the list of ops contained directly within a list-type | |
2754 | op, returning the lengthened list. I<first> is the list-type op, | |
2755 | and I<last> is the op to append to the list. I<optype> specifies the | |
2756 | intended opcode for the list. If I<first> is not already a list of the | |
2757 | right type, it will be upgraded into one. If either I<first> or I<last> | |
2758 | is null, the other is returned unchanged. | |
2759 | ||
2760 | =cut | |
2761 | */ | |
2762 | ||
79072805 | 2763 | OP * |
2fcb4757 | 2764 | Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last) |
79072805 LW |
2765 | { |
2766 | if (!first) | |
2767 | return last; | |
8990e307 LW |
2768 | |
2769 | if (!last) | |
79072805 | 2770 | return first; |
8990e307 | 2771 | |
fe2774ed | 2772 | if (first->op_type != (unsigned)type |
155aba94 GS |
2773 | || (type == OP_LIST && (first->op_flags & OPf_PARENS))) |
2774 | { | |
2775 | return newLISTOP(type, 0, first, last); | |
2776 | } | |
79072805 | 2777 | |
a0d0e21e LW |
2778 | if (first->op_flags & OPf_KIDS) |
2779 | ((LISTOP*)first)->op_last->op_sibling = last; | |
2780 | else { | |
2781 | first->op_flags |= OPf_KIDS; | |
2782 | ((LISTOP*)first)->op_first = last; | |
2783 | } | |
2784 | ((LISTOP*)first)->op_last = last; | |
a0d0e21e | 2785 | return first; |
79072805 LW |
2786 | } |
2787 | ||
2fcb4757 Z |
2788 | /* |
2789 | =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last | |
2790 | ||
2791 | Concatenate the lists of ops contained directly within two list-type ops, | |
2792 | returning the combined list. I<first> and I<last> are the list-type ops | |
2793 | to concatenate. I<optype> specifies the intended opcode for the list. | |
2794 | If either I<first> or I<last> is not already a list of the right type, | |
2795 | it will be upgraded into one. If either I<first> or I<last> is null, | |
2796 | the other is returned unchanged. | |
2797 | ||
2798 | =cut | |
2799 | */ | |
2800 | ||
79072805 | 2801 | OP * |
2fcb4757 | 2802 | Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last) |
79072805 LW |
2803 | { |
2804 | if (!first) | |
2fcb4757 | 2805 | return last; |
8990e307 LW |
2806 | |
2807 | if (!last) | |
2fcb4757 | 2808 | return first; |
8990e307 | 2809 | |
fe2774ed | 2810 | if (first->op_type != (unsigned)type) |
2fcb4757 | 2811 | return op_prepend_elem(type, first, last); |
8990e307 | 2812 | |
fe2774ed | 2813 | if (last->op_type != (unsigned)type) |
2fcb4757 | 2814 | return op_append_elem(type, first, last); |
79072805 | 2815 | |
2fcb4757 Z |
2816 | ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first; |
2817 | ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last; | |
117dada2 | 2818 | first->op_flags |= (last->op_flags & OPf_KIDS); |
1c846c1f | 2819 | |
eb8433b7 | 2820 | #ifdef PERL_MAD |
2fcb4757 Z |
2821 | if (((LISTOP*)last)->op_first && first->op_madprop) { |
2822 | MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop; | |
eb8433b7 NC |
2823 | if (mp) { |
2824 | while (mp->mad_next) | |
2825 | mp = mp->mad_next; | |
2826 | mp->mad_next = first->op_madprop; | |
2827 | } | |
2828 | else { | |
2fcb4757 | 2829 | ((LISTOP*)last)->op_first->op_madprop = first->op_madprop; |
eb8433b7 NC |
2830 | } |
2831 | } | |
2832 | first->op_madprop = last->op_madprop; | |
2833 | last->op_madprop = 0; | |
2834 | #endif | |
2835 | ||
2fcb4757 | 2836 | S_op_destroy(aTHX_ last); |
238a4c30 | 2837 | |
2fcb4757 | 2838 | return first; |
79072805 LW |
2839 | } |
2840 | ||
2fcb4757 Z |
2841 | /* |
2842 | =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last | |
2843 | ||
2844 | Prepend an item to the list of ops contained directly within a list-type | |
2845 | op, returning the lengthened list. I<first> is the op to prepend to the | |
2846 | list, and I<last> is the list-type op. I<optype> specifies the intended | |
2847 | opcode for the list. If I<last> is not already a list of the right type, | |
2848 | it will be upgraded into one. If either I<first> or I<last> is null, | |
2849 | the other is returned unchanged. | |
2850 | ||
2851 | =cut | |
2852 | */ | |
2853 | ||
79072805 | 2854 | OP * |
2fcb4757 | 2855 | Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last) |
79072805 LW |
2856 | { |
2857 | if (!first) | |
2858 | return last; | |
8990e307 LW |
2859 | |
2860 | if (!last) | |
79072805 | 2861 | return first; |
8990e307 | 2862 | |
fe2774ed | 2863 | if (last->op_type == (unsigned)type) { |
8990e307 LW |
2864 | if (type == OP_LIST) { /* already a PUSHMARK there */ |
2865 | first->op_sibling = ((LISTOP*)last)->op_first->op_sibling; | |
2866 | ((LISTOP*)last)->op_first->op_sibling = first; | |
36a5d4ba DC |
2867 | if (!(first->op_flags & OPf_PARENS)) |
2868 | last->op_flags &= ~OPf_PARENS; | |
8990e307 LW |
2869 | } |
2870 | else { | |
2871 | if (!(last->op_flags & OPf_KIDS)) { | |
2872 | ((LISTOP*)last)->op_last = first; | |
2873 | last->op_flags |= OPf_KIDS; | |
2874 | } | |
2875 | first->op_sibling = ((LISTOP*)last)->op_first; | |
2876 | ((LISTOP*)last)->op_first = first; | |
79072805 | 2877 | } |
117dada2 | 2878 | last->op_flags |= OPf_KIDS; |
79072805 LW |
2879 | return last; |
2880 | } | |
2881 | ||
2882 | return newLISTOP(type, 0, first, last); | |
2883 | } | |
2884 | ||
2885 | /* Constructors */ | |
2886 | ||
eb8433b7 NC |
2887 | #ifdef PERL_MAD |
2888 | ||
2889 | TOKEN * | |
2890 | Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop) | |
2891 | { | |
2892 | TOKEN *tk; | |
99129197 | 2893 | Newxz(tk, 1, TOKEN); |
eb8433b7 NC |
2894 | tk->tk_type = (OPCODE)optype; |
2895 | tk->tk_type = 12345; | |
2896 | tk->tk_lval = lval; | |
2897 | tk->tk_mad = madprop; | |
2898 | return tk; | |
2899 | } | |
2900 | ||
2901 | void | |
2902 | Perl_token_free(pTHX_ TOKEN* tk) | |
2903 | { | |
7918f24d NC |
2904 | PERL_ARGS_ASSERT_TOKEN_FREE; |
2905 | ||
eb8433b7 NC |
2906 | if (tk->tk_type != 12345) |
2907 | return; | |
2908 | mad_free(tk->tk_mad); | |
2909 | Safefree(tk); | |
2910 | } | |
2911 | ||
2912 | void | |
2913 | Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot) | |
2914 | { | |
2915 | MADPROP* mp; | |
2916 | MADPROP* tm; | |
7918f24d NC |
2917 | |
2918 | PERL_ARGS_ASSERT_TOKEN_GETMAD; | |
2919 | ||
eb8433b7 NC |
2920 | if (tk->tk_type != 12345) { |
2921 | Perl_warner(aTHX_ packWARN(WARN_MISC), | |
2922 | "Invalid TOKEN object ignored"); | |
2923 | return; | |
2924 | } | |
2925 | tm = tk->tk_mad; | |
2926 | if (!tm) | |
2927 | return; | |
2928 | ||
2929 | /* faked up qw list? */ | |
2930 | if (slot == '(' && | |
2931 | tm->mad_type == MAD_SV && | |
d503a9ba | 2932 | SvPVX((SV *)tm->mad_val)[0] == 'q') |
eb8433b7 NC |
2933 | slot = 'x'; |
2934 | ||
2935 | if (o) { | |
2936 | mp = o->op_madprop; | |
2937 | if (mp) { | |
2938 | for (;;) { | |
2939 | /* pretend constant fold didn't happen? */ | |
2940 | if (mp->mad_key == 'f' && | |
2941 | (o->op_type == OP_CONST || | |
2942 | o->op_type == OP_GV) ) | |
2943 | { | |
2944 | token_getmad(tk,(OP*)mp->mad_val,slot); | |
2945 | return; | |
2946 | } | |
2947 | if (!mp->mad_next) | |
2948 | break; | |
2949 | mp = mp->mad_next; | |
2950 | } | |
2951 | mp->mad_next = tm; | |
2952 | mp = mp->mad_next; | |
2953 | } | |
2954 | else { | |
2955 | o->op_madprop = tm; | |
2956 | mp = o->op_madprop; | |
2957 | } | |
2958 | if (mp->mad_key == 'X') | |
2959 | mp->mad_key = slot; /* just change the first one */ | |
2960 | ||
2961 | tk->tk_mad = 0; | |
2962 | } | |
2963 | else | |
2964 | mad_free(tm); | |
2965 | Safefree(tk); | |
2966 | } | |
2967 | ||
2968 | void | |
2969 | Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot) | |
2970 | { | |
2971 | MADPROP* mp; | |
2972 | if (!from) | |
2973 | return; | |
2974 | if (o) { | |
2975 | mp = o->op_madprop; | |
2976 | if (mp) { | |
2977 | for (;;) { | |
2978 | /* pretend constant fold didn't happen? */ | |
2979 | if (mp->mad_key == 'f' && | |
2980 | (o->op_type == OP_CONST || | |
2981 | o->op_type == OP_GV) ) | |
2982 | { | |
2983 | op_getmad(from,(OP*)mp->mad_val,slot); | |
2984 | return; | |
2985 | } | |
2986 | if (!mp->mad_next) | |
2987 | break; | |
2988 | mp = mp->mad_next; | |
2989 | } | |
2990 | mp->mad_next = newMADPROP(slot,MAD_OP,from,0); | |
2991 | } | |
2992 | else { | |
2993 | o->op_madprop = newMADPROP(slot,MAD_OP,from,0); | |
2994 | } | |
2995 | } | |
2996 | } | |
2997 | ||
2998 | void | |
2999 | Perl_op_getmad(pTHX_ OP* from, OP* o, char slot) | |
3000 | { | |
3001 | MADPROP* mp; | |
3002 | if (!from) | |
3003 | return; | |
3004 | if (o) { | |
3005 | mp = o->op_madprop; | |
3006 | if (mp) { | |
3007 | for (;;) { | |
3008 | /* pretend constant fold didn't happen? */ | |
3009 | if (mp->mad_key == 'f' && | |
3010 | (o->op_type == OP_CONST || | |
3011 | o->op_type == OP_GV) ) | |
3012 | { | |
3013 | op_getmad(from,(OP*)mp->mad_val,slot); | |
3014 | return; | |
3015 | } | |
3016 | if (!mp->mad_next) | |
3017 | break; | |
3018 | mp = mp->mad_next; | |
3019 | } | |
3020 | mp->mad_next = newMADPROP(slot,MAD_OP,from,1); | |
3021 | } | |
3022 | else { | |
3023 | o->op_madprop = newMADPROP(slot,MAD_OP,from,1); | |
3024 | } | |
3025 | } | |
3026 | else { | |
99129197 NC |
3027 | PerlIO_printf(PerlIO_stderr(), |
3028 | "DESTROYING op = %0"UVxf"\n", PTR2UV(from)); | |
eb8433b7 NC |
3029 | op_free(from); |
3030 | } | |
3031 | } | |
3032 | ||
3033 | void | |
3034 | Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot) | |
3035 | { | |
3036 | MADPROP* tm; | |
3037 | if (!mp || !o) | |
3038 | return; | |
3039 | if (slot) | |
3040 | mp->mad_key = slot; | |
3041 | tm = o->op_madprop; | |
3042 | o->op_madprop = mp; | |
3043 | for (;;) { | |
3044 | if (!mp->mad_next) | |
3045 | break; | |
3046 | mp = mp->mad_next; | |
3047 | } | |
3048 | mp->mad_next = tm; | |
3049 | } | |
3050 | ||
3051 | void | |
3052 | Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot) | |
3053 | { | |
3054 | if (!o) | |
3055 | return; | |
3056 | addmad(tm, &(o->op_madprop), slot); | |
3057 | } | |
3058 | ||
3059 | void | |
3060 | Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot) | |
3061 | { | |
3062 | MADPROP* mp; | |
3063 | if (!tm || !root) | |
3064 | return; | |
3065 | if (slot) | |
3066 | tm->mad_key = slot; | |
3067 | mp = *root; | |
3068 | if (!mp) { | |
3069 | *root = tm; | |
3070 | return; | |
3071 | } | |
3072 | for (;;) { | |
3073 | if (!mp->mad_next) | |
3074 | break; | |
3075 | mp = mp->mad_next; | |
3076 | } | |
3077 | mp->mad_next = tm; | |
3078 | } | |
3079 | ||
3080 | MADPROP * | |
3081 | Perl_newMADsv(pTHX_ char key, SV* sv) | |
3082 | { | |
7918f24d NC |
3083 | PERL_ARGS_ASSERT_NEWMADSV; |
3084 | ||
eb8433b7 NC |
3085 | return newMADPROP(key, MAD_SV, sv, 0); |
3086 | } | |
3087 | ||
3088 | MADPROP * | |
d503a9ba | 3089 | Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen) |
eb8433b7 NC |
3090 | { |
3091 | MADPROP *mp; | |
99129197 | 3092 | Newxz(mp, 1, MADPROP); |
eb8433b7 NC |
3093 | mp->mad_next = 0; |
3094 | mp->mad_key = key; | |
3095 | mp->mad_vlen = vlen; | |
3096 | mp->mad_type = type; | |
3097 | mp->mad_val = val; | |
3098 | /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */ | |
3099 | return mp; | |
3100 | } | |
3101 | ||
3102 | void | |
3103 | Perl_mad_free(pTHX_ MADPROP* mp) | |
3104 | { | |
3105 | /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */ | |
3106 | if (!mp) | |
3107 | return; | |
3108 | if (mp->mad_next) | |
3109 | mad_free(mp->mad_next); | |
bc177e6b | 3110 | /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen) |
eb8433b7 NC |
3111 | PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */ |
3112 | switch (mp->mad_type) { | |
3113 | case MAD_NULL: | |
3114 | break; | |
3115 | case MAD_PV: | |
3116 | Safefree((char*)mp->mad_val); | |
3117 | break; | |
3118 | case MAD_OP: | |
3119 | if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */ | |
3120 | op_free((OP*)mp->mad_val); | |
3121 | break; | |
3122 | case MAD_SV: | |
ad64d0ec | 3123 | sv_free(MUTABLE_SV(mp->mad_val)); |
eb8433b7 NC |
3124 | break; |
3125 | default: | |
3126 | PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n"); | |
3127 | break; | |
3128 | } | |
3129 | Safefree(mp); | |
3130 | } | |
3131 | ||
3132 | #endif | |
3133 | ||
d67eb5f4 Z |
3134 | /* |
3135 | =head1 Optree construction | |
3136 | ||
3137 | =for apidoc Am|OP *|newNULLLIST | |
3138 | ||
3139 | Constructs, checks, and returns a new C<stub> op, which represents an | |
3140 | empty list expression. | |
3141 | ||
3142 | =cut | |
3143 | */ | |
3144 | ||
79072805 | 3145 | OP * |
864dbfa3 | 3146 | Perl_newNULLLIST(pTHX) |
79072805 | 3147 | { |
8990e307 LW |
3148 | return newOP(OP_STUB, 0); |
3149 | } | |
3150 | ||
1f676739 | 3151 | static OP * |
b7783a12 | 3152 | S_force_list(pTHX_ OP *o) |
8990e307 | 3153 | { |
11343788 | 3154 | if (!o || o->op_type != OP_LIST) |
5f66b61c | 3155 | o = newLISTOP(OP_LIST, 0, o, NULL); |
93c66552 | 3156 | op_null(o); |
11343788 | 3157 | return o; |
79072805 LW |
3158 | } |
3159 | ||
d67eb5f4 Z |
3160 | /* |
3161 | =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last | |
3162 | ||
3163 | Constructs, checks, and returns an op of any list type. I<type> is | |
3164 | the opcode. I<flags> gives the eight bits of C<op_flags>, except that | |
3165 | C<OPf_KIDS> will be set automatically if required. I<first> and I<last> | |
3166 | supply up to two ops to be direct children of the list op; they are | |
3167 | consumed by this function and become part of the constructed op tree. | |
3168 | ||
3169 | =cut | |
3170 | */ | |
3171 | ||
79072805 | 3172 | OP * |
864dbfa3 | 3173 | Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last) |
79072805 | 3174 | { |
27da23d5 | 3175 | dVAR; |
79072805 LW |
3176 | LISTOP *listop; |
3177 | ||
e69777c1 GG |
3178 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP); |
3179 | ||
b7dc083c | 3180 | NewOp(1101, listop, 1, LISTOP); |
79072805 | 3181 | |
eb160463 | 3182 | listop->op_type = (OPCODE)type; |
22c35a8c | 3183 | listop->op_ppaddr = PL_ppaddr[type]; |
117dada2 SM |
3184 | if (first || last) |
3185 | flags |= OPf_KIDS; | |
eb160463 | 3186 | listop->op_flags = (U8)flags; |
79072805 LW |
3187 | |
3188 | if (!last && first) | |
3189 | last = first; | |
3190 | else if (!first && last) | |
3191 | first = last; | |
8990e307 LW |
3192 | else if (first) |
3193 | first->op_sibling = last; | |
79072805 LW |
3194 | listop->op_first = first; |
3195 | listop->op_last = last; | |
8990e307 | 3196 | if (type == OP_LIST) { |
551405c4 | 3197 | OP* const pushop = newOP(OP_PUSHMARK, 0); |
8990e307 LW |
3198 | pushop->op_sibling = first; |
3199 | listop->op_first = pushop; | |
3200 | listop->op_flags |= OPf_KIDS; | |
3201 | if (!last) | |
3202 | listop->op_last = pushop; | |
3203 | } | |
79072805 | 3204 | |
463d09e6 | 3205 | return CHECKOP(type, listop); |
79072805 LW |
3206 | } |
3207 | ||
d67eb5f4 Z |
3208 | /* |
3209 | =for apidoc Am|OP *|newOP|I32 type|I32 flags | |
3210 | ||
3211 | Constructs, checks, and returns an op of any base type (any type that | |
3212 | has no extra fields). I<type> is the opcode. I<flags> gives the | |
3213 | eight bits of C<op_flags>, and, shifted up eight bits, the eight bits | |
3214 | of C<op_private>. | |
3215 | ||
3216 | =cut | |
3217 | */ | |
3218 | ||
79072805 | 3219 | OP * |
864dbfa3 | 3220 | Perl_newOP(pTHX_ I32 type, I32 flags) |
79072805 | 3221 | { |
27da23d5 | 3222 | dVAR; |
11343788 | 3223 | OP *o; |
e69777c1 GG |
3224 | |
3225 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP | |
3226 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP | |
3227 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP | |
3228 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP); | |
3229 | ||
b7dc083c | 3230 | NewOp(1101, o, 1, OP); |
eb160463 | 3231 | o->op_type = (OPCODE)type; |
22c35a8c | 3232 | o->op_ppaddr = PL_ppaddr[type]; |
eb160463 | 3233 | o->op_flags = (U8)flags; |
670f3923 DM |
3234 | o->op_latefree = 0; |
3235 | o->op_latefreed = 0; | |
7e5d8ed2 | 3236 | o->op_attached = 0; |
79072805 | 3237 | |
11343788 | 3238 | o->op_next = o; |
eb160463 | 3239 | o->op_private = (U8)(0 | (flags >> 8)); |
22c35a8c | 3240 | if (PL_opargs[type] & OA_RETSCALAR) |
11343788 | 3241 | scalar(o); |
22c35a8c | 3242 | if (PL_opargs[type] & OA_TARGET) |
11343788 MB |
3243 | o->op_targ = pad_alloc(type, SVs_PADTMP); |
3244 | return CHECKOP(type, o); | |
79072805 LW |
3245 | } |
3246 | ||
d67eb5f4 Z |
3247 | /* |
3248 | =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first | |
3249 | ||
3250 | Constructs, checks, and returns an op of any unary type. I<type> is | |
3251 | the opcode. I<flags> gives the eight bits of C<op_flags>, except that | |
3252 | C<OPf_KIDS> will be set automatically if required, and, shifted up eight | |
3253 | bits, the eight bits of C<op_private>, except that the bit with value 1 | |
3254 | is automatically set. I<first> supplies an optional op to be the direct | |
3255 | child of the unary op; it is consumed by this function and become part | |
3256 | of the constructed op tree. | |
3257 | ||
3258 | =cut | |
3259 | */ | |
3260 | ||
79072805 | 3261 | OP * |
864dbfa3 | 3262 | Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first) |
79072805 | 3263 | { |
27da23d5 | 3264 | dVAR; |
79072805 LW |
3265 | UNOP *unop; |
3266 | ||
e69777c1 GG |
3267 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP |
3268 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP | |
3269 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP | |
3270 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP | |
3271 | || type == OP_SASSIGN | |
32e2a35d | 3272 | || type == OP_ENTERTRY |
e69777c1 GG |
3273 | || type == OP_NULL ); |
3274 | ||
93a17b20 | 3275 | if (!first) |
aeea060c | 3276 | first = newOP(OP_STUB, 0); |
22c35a8c | 3277 | if (PL_opargs[type] & OA_MARK) |
8990e307 | 3278 | first = force_list(first); |
93a17b20 | 3279 | |
b7dc083c | 3280 | NewOp(1101, unop, 1, UNOP); |
eb160463 | 3281 | unop->op_type = (OPCODE)type; |
22c35a8c | 3282 | unop->op_ppaddr = PL_ppaddr[type]; |
79072805 | 3283 | unop->op_first = first; |
585ec06d | 3284 | unop->op_flags = (U8)(flags | OPf_KIDS); |
eb160463 | 3285 | unop->op_private = (U8)(1 | (flags >> 8)); |
e50aee73 | 3286 | unop = (UNOP*) CHECKOP(type, unop); |
79072805 LW |
3287 | if (unop->op_next) |
3288 | return (OP*)unop; | |
3289 | ||
a0d0e21e | 3290 | return fold_constants((OP *) unop); |
79072805 LW |
3291 | } |
3292 | ||
d67eb5f4 Z |
3293 | /* |
3294 | =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last | |
3295 | ||
3296 | Constructs, checks, and returns an op of any binary type. I<type> | |
3297 | is the opcode. I<flags> gives the eight bits of C<op_flags>, except | |
3298 | that C<OPf_KIDS> will be set automatically, and, shifted up eight bits, | |
3299 | the eight bits of C<op_private>, except that the bit with value 1 or | |
3300 | 2 is automatically set as required. I<first> and I<last> supply up to | |
3301 | two ops to be the direct children of the binary op; they are consumed | |
3302 | by this function and become part of the constructed op tree. | |
3303 | ||
3304 | =cut | |
3305 | */ | |
3306 | ||
79072805 | 3307 | OP * |
864dbfa3 | 3308 | Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last) |
79072805 | 3309 | { |
27da23d5 | 3310 | dVAR; |
79072805 | 3311 | BINOP *binop; |
e69777c1 GG |
3312 | |
3313 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP | |
3314 | || type == OP_SASSIGN || type == OP_NULL ); | |
3315 | ||
b7dc083c | 3316 | NewOp(1101, binop, 1, BINOP); |
79072805 LW |
3317 | |
3318 | if (!first) | |
3319 | first = newOP(OP_NULL, 0); | |
3320 | ||
eb160463 | 3321 | binop->op_type = (OPCODE)type; |
22c35a8c | 3322 | binop->op_ppaddr = PL_ppaddr[type]; |
79072805 | 3323 | binop->op_first = first; |
585ec06d | 3324 | binop->op_flags = (U8)(flags | OPf_KIDS); |
79072805 LW |
3325 | if (!last) { |
3326 | last = first; | |
eb160463 | 3327 | binop->op_private = (U8)(1 | (flags >> 8)); |
79072805 LW |
3328 | } |
3329 | else { | |
eb160463 | 3330 | binop->op_private = (U8)(2 | (flags >> 8)); |
79072805 LW |
3331 | first->op_sibling = last; |
3332 | } | |
3333 | ||
e50aee73 | 3334 | binop = (BINOP*)CHECKOP(type, binop); |
eb160463 | 3335 | if (binop->op_next || binop->op_type != (OPCODE)type) |
79072805 LW |
3336 | return (OP*)binop; |
3337 | ||
7284ab6f | 3338 | binop->op_last = binop->op_first->op_sibling; |
79072805 | 3339 | |
a0d0e21e | 3340 | return fold_constants((OP *)binop); |
79072805 LW |
3341 | } |
3342 | ||
5f66b61c AL |
3343 | static int uvcompare(const void *a, const void *b) |
3344 | __attribute__nonnull__(1) | |
3345 | __attribute__nonnull__(2) | |
3346 | __attribute__pure__; | |
abb2c242 | 3347 | static int uvcompare(const void *a, const void *b) |
2b9d42f0 | 3348 | { |
e1ec3a88 | 3349 | if (*((const UV *)a) < (*(const UV *)b)) |
2b9d42f0 | 3350 | return -1; |
e1ec3a88 | 3351 | if (*((const UV *)a) > (*(const UV *)b)) |
2b9d42f0 | 3352 | return 1; |
e1ec3a88 | 3353 | if (*((const UV *)a+1) < (*(const UV *)b+1)) |
2b9d42f0 | 3354 | return -1; |
e1ec3a88 | 3355 | if (*((const UV *)a+1) > (*(const UV *)b+1)) |
2b9d42f0 | 3356 | return 1; |
a0ed51b3 LW |
3357 | return 0; |
3358 | } | |
3359 | ||
0d86688d NC |
3360 | static OP * |
3361 | S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl) | |
79072805 | 3362 | { |
97aff369 | 3363 | dVAR; |
2d03de9c | 3364 | SV * const tstr = ((SVOP*)expr)->op_sv; |
fbbb0949 DM |
3365 | SV * const rstr = |
3366 | #ifdef PERL_MAD | |
3367 | (repl->op_type == OP_NULL) | |
3368 | ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv : | |
3369 | #endif | |
3370 | ((SVOP*)repl)->op_sv; | |
463ee0b2 LW |
3371 | STRLEN tlen; |
3372 | STRLEN rlen; | |
5c144d81 NC |
3373 | const U8 *t = (U8*)SvPV_const(tstr, tlen); |
3374 | const U8 *r = (U8*)SvPV_const(rstr, rlen); | |
79072805 LW |
3375 | register I32 i; |
3376 | register I32 j; | |
9b877dbb | 3377 | I32 grows = 0; |
79072805 LW |
3378 | register short *tbl; |
3379 | ||
551405c4 AL |
3380 | const I32 complement = o->op_private & OPpTRANS_COMPLEMENT; |
3381 | const I32 squash = o->op_private & OPpTRANS_SQUASH; | |
3382 | I32 del = o->op_private & OPpTRANS_DELETE; | |
043e41b8 | 3383 | SV* swash; |
7918f24d NC |
3384 | |
3385 | PERL_ARGS_ASSERT_PMTRANS; | |
3386 | ||
800b4dc4 | 3387 | PL_hints |= HINT_BLOCK_SCOPE; |
1c846c1f | 3388 | |
036b4402 GS |
3389 | if (SvUTF8(tstr)) |
3390 | o->op_private |= OPpTRANS_FROM_UTF; | |
1c846c1f NIS |
3391 | |
3392 | if (SvUTF8(rstr)) | |
036b4402 | 3393 | o->op_private |= OPpTRANS_TO_UTF; |
79072805 | 3394 | |
a0ed51b3 | 3395 | if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) { |
396482e1 | 3396 | SV* const listsv = newSVpvs("# comment\n"); |
c445ea15 | 3397 | SV* transv = NULL; |
5c144d81 NC |
3398 | const U8* tend = t + tlen; |
3399 | const U8* rend = r + rlen; | |
ba210ebe | 3400 | STRLEN ulen; |
84c133a0 RB |
3401 | UV tfirst = 1; |
3402 | UV tlast = 0; | |
3403 | IV tdiff; | |
3404 | UV rfirst = 1; | |
3405 | UV rlast = 0; | |
3406 | IV rdiff; | |
3407 | IV diff; | |
a0ed51b3 LW |
3408 | I32 none = 0; |
3409 | U32 max = 0; | |
3410 | I32 bits; | |
a0ed51b3 | 3411 | I32 havefinal = 0; |
9c5ffd7c | 3412 | U32 final = 0; |
551405c4 AL |
3413 | const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF; |
3414 | const I32 to_utf = o->op_private & OPpTRANS_TO_UTF; | |
bf4a1e57 JH |
3415 | U8* tsave = NULL; |
3416 | U8* rsave = NULL; | |
9f7f3913 | 3417 | const U32 flags = UTF8_ALLOW_DEFAULT; |
bf4a1e57 JH |
3418 | |
3419 | if (!from_utf) { | |
3420 | STRLEN len = tlen; | |
5c144d81 | 3421 | t = tsave = bytes_to_utf8(t, &len); |
bf4a1e57 JH |
3422 | tend = t + len; |
3423 | } | |
3424 | if (!to_utf && rlen) { | |
3425 | STRLEN len = rlen; | |
5c144d81 | 3426 | r = rsave = bytes_to_utf8(r, &len); |
bf4a1e57 JH |
3427 | rend = r + len; |
3428 | } | |
a0ed51b3 | 3429 | |
2b9d42f0 NIS |
3430 | /* There are several snags with this code on EBCDIC: |
3431 | 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes). | |
3432 | 2. scan_const() in toke.c has encoded chars in native encoding which makes | |
3433 | ranges at least in EBCDIC 0..255 range the bottom odd. | |
3434 | */ | |
3435 | ||
a0ed51b3 | 3436 | if (complement) { |
89ebb4a3 | 3437 | U8 tmpbuf[UTF8_MAXBYTES+1]; |
2b9d42f0 | 3438 | UV *cp; |
a0ed51b3 | 3439 | UV nextmin = 0; |
a02a5408 | 3440 | Newx(cp, 2*tlen, UV); |
a0ed51b3 | 3441 | i = 0; |
396482e1 | 3442 | transv = newSVpvs(""); |
a0ed51b3 | 3443 | while (t < tend) { |
9f7f3913 | 3444 | cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags); |
2b9d42f0 NIS |
3445 | t += ulen; |
3446 | if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { | |
a0ed51b3 | 3447 | t++; |
9f7f3913 | 3448 | cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags); |
2b9d42f0 | 3449 | t += ulen; |
a0ed51b3 | 3450 | } |
2b9d42f0 NIS |
3451 | else { |
3452 | cp[2*i+1] = cp[2*i]; | |
3453 | } | |
3454 | i++; | |
a0ed51b3 | 3455 | } |
2b9d42f0 | 3456 | qsort(cp, i, 2*sizeof(UV), uvcompare); |
a0ed51b3 | 3457 | for (j = 0; j < i; j++) { |
2b9d42f0 | 3458 | UV val = cp[2*j]; |
a0ed51b3 LW |
3459 | diff = val - nextmin; |
3460 | if (diff > 0) { | |
9041c2e3 | 3461 | t = uvuni_to_utf8(tmpbuf,nextmin); |
dfe13c55 | 3462 | sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf); |
a0ed51b3 | 3463 | if (diff > 1) { |
2b9d42f0 | 3464 | U8 range_mark = UTF_TO_NATIVE(0xff); |
9041c2e3 | 3465 | t = uvuni_to_utf8(tmpbuf, val - 1); |
2b9d42f0 | 3466 | sv_catpvn(transv, (char *)&range_mark, 1); |
dfe13c55 | 3467 | sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf); |
a0ed51b3 LW |
3468 | } |
3469 | } | |
2b9d42f0 | 3470 | val = cp[2*j+1]; |
a0ed51b3 LW |
3471 | if (val >= nextmin) |
3472 | nextmin = val + 1; | |
3473 | } | |
9041c2e3 | 3474 | t = uvuni_to_utf8(tmpbuf,nextmin); |
dfe13c55 | 3475 | sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf); |
2b9d42f0 NIS |
3476 | { |
3477 | U8 range_mark = UTF_TO_NATIVE(0xff); | |
3478 | sv_catpvn(transv, (char *)&range_mark, 1); | |
3479 | } | |
b851fbc1 JH |
3480 | t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff, |
3481 | UNICODE_ALLOW_SUPER); | |
dfe13c55 | 3482 | sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf); |
93524f2b | 3483 | t = (const U8*)SvPVX_const(transv); |
a0ed51b3 LW |
3484 | tlen = SvCUR(transv); |
3485 | tend = t + tlen; | |
455d824a | 3486 | Safefree(cp); |
a0ed51b3 LW |
3487 | } |
3488 | else if (!rlen && !del) { | |
3489 | r = t; rlen = tlen; rend = tend; | |
4757a243 LW |
3490 | } |
3491 | if (!squash) { | |
05d340b8 | 3492 | if ((!rlen && !del) || t == r || |
12ae5dfc | 3493 | (tlen == rlen && memEQ((char *)t, (char *)r, tlen))) |
01ec43d0 | 3494 | { |
4757a243 | 3495 | o->op_private |= OPpTRANS_IDENTICAL; |
01ec43d0 | 3496 | } |
a0ed51b3 LW |
3497 | } |
3498 | ||
3499 | while (t < tend || tfirst <= tlast) { | |
3500 | /* see if we need more "t" chars */ | |
3501 | if (tfirst > tlast) { | |
9f7f3913 | 3502 | tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags); |
a0ed51b3 | 3503 | t += ulen; |
2b9d42f0 | 3504 | if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */ |
ba210ebe | 3505 | t++; |
9f7f3913 | 3506 | tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags); |
a0ed51b3 LW |
3507 | t += ulen; |
3508 | } | |
3509 | else | |
3510 | tlast = tfirst; | |
3511 | } | |
3512 | ||
3513 | /* now see if we need more "r" chars */ | |
3514 | if (rfirst > rlast) { | |
3515 | if (r < rend) { | |
9f7f3913 | 3516 | rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags); |
a0ed51b3 | 3517 | r += ulen; |
2b9d42f0 | 3518 | if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */ |
ba210ebe | 3519 | r++; |
9f7f3913 | 3520 | rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags); |
a0ed51b3 LW |
3521 | r += ulen; |
3522 | } | |
3523 | else | |
3524 | rlast = rfirst; | |
3525 | } | |
3526 | else { | |
3527 | if (!havefinal++) | |
3528 | final = rlast; | |
3529 | rfirst = rlast = 0xffffffff; | |
3530 | } | |
3531 | } | |
3532 | ||
3533 | /* now see which range will peter our first, if either. */ | |
3534 | tdiff = tlast - tfirst; | |
3535 | rdiff = rlast - rfirst; | |
3536 | ||
3537 | if (tdiff <= rdiff) | |
3538 | diff = tdiff; | |
3539 | else | |
3540 | diff = rdiff; | |
3541 | ||
3542 | if (rfirst == 0xffffffff) { | |
3543 | diff = tdiff; /* oops, pretend rdiff is infinite */ | |
3544 | if (diff > 0) | |
894356b3 GS |
3545 | Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n", |
3546 | (long)tfirst, (long)tlast); | |
a0ed51b3 | 3547 | else |
894356b3 | 3548 | Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst); |
a0ed51b3 LW |
3549 | } |
3550 | else { | |
3551 | if (diff > 0) | |
894356b3 GS |
3552 | Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n", |
3553 | (long)tfirst, (long)(tfirst + diff), | |
3554 | (long)rfirst); | |
a0ed51b3 | 3555 | else |
894356b3 GS |
3556 | Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n", |
3557 | (long)tfirst, (long)rfirst); | |
a0ed51b3 LW |
3558 | |
3559 | if (rfirst + diff > max) | |
3560 | max = rfirst + diff; | |
9b877dbb | 3561 | if (!grows) |
45005bfb JH |
3562 | grows = (tfirst < rfirst && |
3563 | UNISKIP(tfirst) < UNISKIP(rfirst + diff)); | |
3564 | rfirst += diff + 1; | |
a0ed51b3 LW |
3565 | } |
3566 | tfirst += diff + 1; | |
3567 | } | |
3568 | ||
3569 | none = ++max; | |
3570 | if (del) | |
3571 | del = ++max; | |
3572 | ||
3573 | if (max > 0xffff) | |
3574 | bits = 32; | |
3575 | else if (max > 0xff) | |
3576 | bits = 16; | |
3577 | else | |
3578 | bits = 8; | |
3579 | ||
ea71c68d | 3580 | PerlMemShared_free(cPVOPo->op_pv); |
b3123a61 | 3581 | cPVOPo->op_pv = NULL; |
043e41b8 | 3582 | |
ad64d0ec | 3583 | swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none)); |
043e41b8 DM |
3584 | #ifdef USE_ITHREADS |
3585 | cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP); | |
3586 | SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix)); | |
3587 | PAD_SETSV(cPADOPo->op_padix, swash); | |
3588 | SvPADTMP_on(swash); | |
a5446a64 | 3589 | SvREADONLY_on(swash); |
043e41b8 DM |
3590 | #else |
3591 | cSVOPo->op_sv = swash; | |
3592 | #endif | |
a0ed51b3 | 3593 | SvREFCNT_dec(listsv); |
b37c2d43 | 3594 | SvREFCNT_dec(transv); |
a0ed51b3 | 3595 | |
45005bfb | 3596 | if (!del && havefinal && rlen) |
85fbaab2 | 3597 | (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5, |
b448e4fe | 3598 | newSVuv((UV)final), 0); |
a0ed51b3 | 3599 | |
9b877dbb | 3600 | if (grows) |
a0ed51b3 LW |
3601 | o->op_private |= OPpTRANS_GROWS; |
3602 | ||
b37c2d43 AL |
3603 | Safefree(tsave); |
3604 | Safefree(rsave); | |
9b877dbb | 3605 | |
eb8433b7 NC |
3606 | #ifdef PERL_MAD |
3607 | op_getmad(expr,o,'e'); | |
3608 | op_getmad(repl,o,'r'); | |
3609 | #else | |
a0ed51b3 LW |
3610 | op_free(expr); |
3611 | op_free(repl); | |
eb8433b7 | 3612 | #endif |
a0ed51b3 LW |
3613 | return o; |
3614 | } | |
3615 | ||
3616 | tbl = (short*)cPVOPo->op_pv; | |
79072805 LW |
3617 | if (complement) { |
3618 | Zero(tbl, 256, short); | |
eb160463 | 3619 | for (i = 0; i < (I32)tlen; i++) |
ec49126f | 3620 | tbl[t[i]] = -1; |
79072805 LW |
3621 | for (i = 0, j = 0; i < 256; i++) { |
3622 | if (!tbl[i]) { | |
eb160463 | 3623 | if (j >= (I32)rlen) { |
a0ed51b3 | 3624 | if (del) |
79072805 LW |
3625 | tbl[i] = -2; |
3626 | else if (rlen) | |
ec49126f | 3627 | tbl[i] = r[j-1]; |
79072805 | 3628 | else |
eb160463 | 3629 | tbl[i] = (short)i; |
79072805 | 3630 | } |
9b877dbb IH |
3631 | else { |
3632 | if (i < 128 && r[j] >= 128) | |
3633 | grows = 1; | |
ec49126f | 3634 | tbl[i] = r[j++]; |
9b877dbb | 3635 | } |
79072805 LW |
3636 | } |
3637 | } | |
05d340b8 JH |
3638 | if (!del) { |
3639 | if (!rlen) { | |
3640 | j = rlen; | |
3641 | if (!squash) | |
3642 | o->op_private |= OPpTRANS_IDENTICAL; | |
3643 | } | |
eb160463 | 3644 | else if (j >= (I32)rlen) |
05d340b8 | 3645 | j = rlen - 1; |
10db182f | 3646 | else { |
aa1f7c5b JH |
3647 | tbl = |
3648 | (short *) | |
3649 | PerlMemShared_realloc(tbl, | |
3650 | (0x101+rlen-j) * sizeof(short)); | |
10db182f YO |
3651 | cPVOPo->op_pv = (char*)tbl; |
3652 | } | |
585ec06d | 3653 | tbl[0x100] = (short)(rlen - j); |
eb160463 | 3654 | for (i=0; i < (I32)rlen - j; i++) |
8973db79 JH |
3655 | tbl[0x101+i] = r[j+i]; |
3656 | } | |
79072805 LW |
3657 | } |
3658 | else { | |
a0ed51b3 | 3659 | if (!rlen && !del) { |
79072805 | 3660 | r = t; rlen = tlen; |
5d06d08e | 3661 | if (!squash) |
4757a243 | 3662 | o->op_private |= OPpTRANS_IDENTICAL; |
79072805 | 3663 | } |
94bfe852 RGS |
3664 | else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) { |
3665 | o->op_private |= OPpTRANS_IDENTICAL; | |
3666 | } | |
79072805 LW |
3667 | for (i = 0; i < 256; i++) |
3668 | tbl[i] = -1; | |
eb160463 GS |
3669 | for (i = 0, j = 0; i < (I32)tlen; i++,j++) { |
3670 | if (j >= (I32)rlen) { | |
a0ed51b3 | 3671 | if (del) { |
ec49126f | 3672 | if (tbl[t[i]] == -1) |
3673 | tbl[t[i]] = -2; | |
79072805 LW |
3674 | continue; |
3675 | } | |
3676 | --j; | |
3677 | } | |
9b877dbb IH |
3678 | if (tbl[t[i]] == -1) { |
3679 | if (t[i] < 128 && r[j] >= 128) | |
3680 | grows = 1; | |
ec49126f | 3681 | tbl[t[i]] = r[j]; |
9b877dbb | 3682 | } |
79072805 LW |
3683 | } |
3684 | } | |
b08e453b | 3685 | |
a2a5de95 NC |
3686 | if(del && rlen == tlen) { |
3687 | Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator"); | |
3688 | } else if(rlen > tlen) { | |
3689 | Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list"); | |
b08e453b RB |
3690 | } |
3691 | ||
9b877dbb IH |
3692 | if (grows) |
3693 | o->op_private |= OPpTRANS_GROWS; | |
eb8433b7 NC |
3694 | #ifdef PERL_MAD |
3695 | op_getmad(expr,o,'e'); | |
3696 | op_getmad(repl,o,'r'); | |
3697 | #else | |
79072805 LW |
3698 | op_free(expr); |
3699 | op_free(repl); | |
eb8433b7 | 3700 | #endif |
79072805 | 3701 | |
11343788 | 3702 | return o; |
79072805 LW |
3703 | } |
3704 | ||
d67eb5f4 Z |
3705 | /* |
3706 | =for apidoc Am|OP *|newPMOP|I32 type|I32 flags | |
3707 | ||
3708 | Constructs, checks, and returns an op of any pattern matching type. | |
3709 | I<type> is the opcode. I<flags> gives the eight bits of C<op_flags> | |
3710 | and, shifted up eight bits, the eight bits of C<op_private>. | |
3711 | ||
3712 | =cut | |
3713 | */ | |
3714 | ||
79072805 | 3715 | OP * |
864dbfa3 | 3716 | Perl_newPMOP(pTHX_ I32 type, I32 flags) |
79072805 | 3717 | { |
27da23d5 | 3718 | dVAR; |
79072805 LW |
3719 | PMOP *pmop; |
3720 | ||
e69777c1 GG |
3721 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP); |
3722 | ||
b7dc083c | 3723 | NewOp(1101, pmop, 1, PMOP); |
eb160463 | 3724 | pmop->op_type = (OPCODE)type; |
22c35a8c | 3725 | pmop->op_ppaddr = PL_ppaddr[type]; |
eb160463 GS |
3726 | pmop->op_flags = (U8)flags; |
3727 | pmop->op_private = (U8)(0 | (flags >> 8)); | |
79072805 | 3728 | |
3280af22 | 3729 | if (PL_hints & HINT_RE_TAINT) |
c737faaf | 3730 | pmop->op_pmflags |= PMf_RETAINT; |
9de15fec | 3731 | if (PL_hints & HINT_LOCALE) { |
c737faaf | 3732 | pmop->op_pmflags |= PMf_LOCALE; |
9de15fec KW |
3733 | } |
3734 | else if ((! (PL_hints & HINT_BYTES)) && (PL_hints & HINT_UNI_8_BIT)) { | |
3735 | pmop->op_pmflags |= RXf_PMf_UNICODE; | |
3736 | } | |
c737faaf | 3737 | |
36477c24 | 3738 | |
debc9467 | 3739 | #ifdef USE_ITHREADS |
402d2eb1 NC |
3740 | assert(SvPOK(PL_regex_pad[0])); |
3741 | if (SvCUR(PL_regex_pad[0])) { | |
3742 | /* Pop off the "packed" IV from the end. */ | |
3743 | SV *const repointer_list = PL_regex_pad[0]; | |
3744 | const char *p = SvEND(repointer_list) - sizeof(IV); | |
3745 | const IV offset = *((IV*)p); | |
3746 | ||
3747 | assert(SvCUR(repointer_list) % sizeof(IV) == 0); | |
3748 | ||
3749 | SvEND_set(repointer_list, p); | |
3750 | ||
110f3028 | 3751 | pmop->op_pmoffset = offset; |
14a49a24 NC |
3752 | /* This slot should be free, so assert this: */ |
3753 | assert(PL_regex_pad[offset] == &PL_sv_undef); | |
551405c4 | 3754 | } else { |
14a49a24 | 3755 | SV * const repointer = &PL_sv_undef; |
9a8b6709 | 3756 | av_push(PL_regex_padav, repointer); |
551405c4 AL |
3757 | pmop->op_pmoffset = av_len(PL_regex_padav); |
3758 | PL_regex_pad = AvARRAY(PL_regex_padav); | |
13137afc | 3759 | } |
debc9467 | 3760 | #endif |
1eb1540c | 3761 | |
463d09e6 | 3762 | return CHECKOP(type, pmop); |
79072805 LW |
3763 | } |
3764 | ||
131b3ad0 DM |
3765 | /* Given some sort of match op o, and an expression expr containing a |
3766 | * pattern, either compile expr into a regex and attach it to o (if it's | |
3767 | * constant), or convert expr into a runtime regcomp op sequence (if it's | |
3768 | * not) | |
3769 | * | |
3770 | * isreg indicates that the pattern is part of a regex construct, eg | |
3771 | * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or | |
3772 | * split "pattern", which aren't. In the former case, expr will be a list | |
3773 | * if the pattern contains more than one term (eg /a$b/) or if it contains | |
3774 | * a replacement, ie s/// or tr///. | |
3775 | */ | |
3776 | ||
79072805 | 3777 | OP * |
131b3ad0 | 3778 | Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg) |
79072805 | 3779 | { |
27da23d5 | 3780 | dVAR; |
79072805 LW |
3781 | PMOP *pm; |
3782 | LOGOP *rcop; | |
ce862d02 | 3783 | I32 repl_has_vars = 0; |
5f66b61c | 3784 | OP* repl = NULL; |
131b3ad0 DM |
3785 | bool reglist; |
3786 | ||
7918f24d NC |
3787 | PERL_ARGS_ASSERT_PMRUNTIME; |
3788 | ||
131b3ad0 DM |
3789 | if (o->op_type == OP_SUBST || o->op_type == OP_TRANS) { |
3790 | /* last element in list is the replacement; pop it */ | |
3791 | OP* kid; | |
3792 | repl = cLISTOPx(expr)->op_last; | |
3793 | kid = cLISTOPx(expr)->op_first; | |
3794 | while (kid->op_sibling != repl) | |
3795 | kid = kid->op_sibling; | |
5f66b61c | 3796 | kid->op_sibling = NULL; |
131b3ad0 DM |
3797 | cLISTOPx(expr)->op_last = kid; |
3798 | } | |
79072805 | 3799 | |
131b3ad0 DM |
3800 | if (isreg && expr->op_type == OP_LIST && |
3801 | cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last) | |
3802 | { | |
3803 | /* convert single element list to element */ | |
0bd48802 | 3804 | OP* const oe = expr; |
131b3ad0 | 3805 | expr = cLISTOPx(oe)->op_first->op_sibling; |
5f66b61c AL |
3806 | cLISTOPx(oe)->op_first->op_sibling = NULL; |
3807 | cLISTOPx(oe)->op_last = NULL; | |
131b3ad0 DM |
3808 | op_free(oe); |
3809 | } | |
3810 | ||
3811 | if (o->op_type == OP_TRANS) { | |
11343788 | 3812 | return pmtrans(o, expr, repl); |
131b3ad0 DM |
3813 | } |
3814 | ||
3815 | reglist = isreg && expr->op_type == OP_LIST; | |
3816 | if (reglist) | |
3817 | op_null(expr); | |
79072805 | 3818 | |
3280af22 | 3819 | PL_hints |= HINT_BLOCK_SCOPE; |
11343788 | 3820 | pm = (PMOP*)o; |
79072805 LW |
3821 | |
3822 | if (expr->op_type == OP_CONST) { | |
b9ad30b4 | 3823 | SV *pat = ((SVOP*)expr)->op_sv; |
c737faaf | 3824 | U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME; |
5c144d81 | 3825 | |
0ac6acae AB |
3826 | if (o->op_flags & OPf_SPECIAL) |
3827 | pm_flags |= RXf_SPLIT; | |
5c144d81 | 3828 | |
b9ad30b4 NC |
3829 | if (DO_UTF8(pat)) { |
3830 | assert (SvUTF8(pat)); | |
3831 | } else if (SvUTF8(pat)) { | |
3832 | /* Not doing UTF-8, despite what the SV says. Is this only if we're | |
3833 | trapped in use 'bytes'? */ | |
3834 | /* Make a copy of the octet sequence, but without the flag on, as | |
3835 | the compiler now honours the SvUTF8 flag on pat. */ | |
3836 | STRLEN len; | |
3837 | const char *const p = SvPV(pat, len); | |
3838 | pat = newSVpvn_flags(p, len, SVs_TEMP); | |
3839 | } | |
0ac6acae | 3840 | |
3ab4a224 | 3841 | PM_SETRE(pm, CALLREGCOMP(pat, pm_flags)); |
c737faaf | 3842 | |
eb8433b7 NC |
3843 | #ifdef PERL_MAD |
3844 | op_getmad(expr,(OP*)pm,'e'); | |
3845 | #else | |
79072805 | 3846 | op_free(expr); |
eb8433b7 | 3847 | #endif |
79072805 LW |
3848 | } |
3849 | else { | |
3280af22 | 3850 | if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) |
1c846c1f | 3851 | expr = newUNOP((!(PL_hints & HINT_RE_EVAL) |
2cd61cdb IZ |
3852 | ? OP_REGCRESET |
3853 | : OP_REGCMAYBE),0,expr); | |
463ee0b2 | 3854 | |
b7dc083c | 3855 | NewOp(1101, rcop, 1, LOGOP); |
79072805 | 3856 | rcop->op_type = OP_REGCOMP; |
22c35a8c | 3857 | rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP]; |
79072805 | 3858 | rcop->op_first = scalar(expr); |
131b3ad0 DM |
3859 | rcop->op_flags |= OPf_KIDS |
3860 | | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0) | |
3861 | | (reglist ? OPf_STACKED : 0); | |
79072805 | 3862 | rcop->op_private = 1; |
11343788 | 3863 | rcop->op_other = o; |
131b3ad0 DM |
3864 | if (reglist) |
3865 | rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP); | |
3866 | ||
b5c19bd7 DM |
3867 | /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */ |
3868 | PL_cv_has_eval = 1; | |
79072805 LW |
3869 | |
3870 | /* establish postfix order */ | |
3280af22 | 3871 | if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) { |
463ee0b2 LW |
3872 | LINKLIST(expr); |
3873 | rcop->op_next = expr; | |
3874 | ((UNOP*)expr)->op_first->op_next = (OP*)rcop; | |
3875 | } | |
3876 | else { | |
3877 | rcop->op_next = LINKLIST(expr); | |
3878 | expr->op_next = (OP*)rcop; | |
3879 | } | |
79072805 | 3880 | |
2fcb4757 | 3881 | op_prepend_elem(o->op_type, scalar((OP*)rcop), o); |
79072805 LW |
3882 | } |
3883 | ||
3884 | if (repl) { | |
748a9306 | 3885 | OP *curop; |
0244c3a4 | 3886 | if (pm->op_pmflags & PMf_EVAL) { |
6136c704 | 3887 | curop = NULL; |
670a9cb2 DM |
3888 | if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end) |
3889 | CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end); | |
0244c3a4 | 3890 | } |
748a9306 LW |
3891 | else if (repl->op_type == OP_CONST) |
3892 | curop = repl; | |
79072805 | 3893 | else { |
c445ea15 | 3894 | OP *lastop = NULL; |
79072805 | 3895 | for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) { |
e80b829c | 3896 | if (curop->op_type == OP_SCOPE |
10250113 | 3897 | || curop->op_type == OP_LEAVE |
e80b829c | 3898 | || (PL_opargs[curop->op_type] & OA_DANGEROUS)) { |
79072805 | 3899 | if (curop->op_type == OP_GV) { |
6136c704 | 3900 | GV * const gv = cGVOPx_gv(curop); |
ce862d02 | 3901 | repl_has_vars = 1; |
f702bf4a | 3902 | if (strchr("&`'123456789+-\016\022", *GvENAME(gv))) |
79072805 LW |
3903 | break; |
3904 | } | |
3905 | else if (curop->op_type == OP_RV2CV) | |
3906 | break; | |
3907 | else if (curop->op_type == OP_RV2SV || | |
3908 | curop->op_type == OP_RV2AV || | |
3909 | curop->op_type == OP_RV2HV || | |
3910 | curop->op_type == OP_RV2GV) { | |
3911 | if (lastop && lastop->op_type != OP_GV) /*funny deref?*/ | |
3912 | break; | |
3913 | } | |
748a9306 LW |
3914 | else if (curop->op_type == OP_PADSV || |
3915 | curop->op_type == OP_PADAV || | |
3916 | curop->op_type == OP_PADHV || | |
e80b829c RGS |
3917 | curop->op_type == OP_PADANY) |
3918 | { | |
ce862d02 | 3919 | repl_has_vars = 1; |
748a9306 | 3920 | } |
1167e5da | 3921 | else if (curop->op_type == OP_PUSHRE) |
6f207bd3 | 3922 | NOOP; /* Okay here, dangerous in newASSIGNOP */ |
79072805 LW |
3923 | else |
3924 | break; | |
3925 | } | |
3926 | lastop = curop; | |
3927 | } | |
748a9306 | 3928 | } |
ce862d02 | 3929 | if (curop == repl |
e80b829c RGS |
3930 | && !(repl_has_vars |
3931 | && (!PM_GETRE(pm) | |
07bc277f | 3932 | || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN))) |
3be69782 | 3933 | { |
748a9306 | 3934 | pm->op_pmflags |= PMf_CONST; /* const for long enough */ |
2fcb4757 | 3935 | op_prepend_elem(o->op_type, scalar(repl), o); |
748a9306 LW |
3936 | } |
3937 | else { | |
aaa362c4 | 3938 | if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */ |
ce862d02 | 3939 | pm->op_pmflags |= PMf_MAYBE_CONST; |
ce862d02 | 3940 | } |
b7dc083c | 3941 | NewOp(1101, rcop, 1, LOGOP); |
748a9306 | 3942 | rcop->op_type = OP_SUBSTCONT; |
22c35a8c | 3943 | rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT]; |
748a9306 LW |
3944 | rcop->op_first = scalar(repl); |
3945 | rcop->op_flags |= OPf_KIDS; | |
3946 | rcop->op_private = 1; | |
11343788 | 3947 | rcop->op_other = o; |
748a9306 LW |
3948 | |
3949 | /* establish postfix order */ | |
3950 | rcop->op_next = LINKLIST(repl); | |
3951 | repl->op_next = (OP*)rcop; | |
3952 | ||
20e98b0f | 3953 | pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop); |
29f2e912 NC |
3954 | assert(!(pm->op_pmflags & PMf_ONCE)); |
3955 | pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop); | |
748a9306 | 3956 | rcop->op_next = 0; |
79072805 LW |
3957 | } |
3958 | } | |
3959 | ||
3960 | return (OP*)pm; | |
3961 | } | |
3962 | ||
d67eb5f4 Z |
3963 | /* |
3964 | =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv | |
3965 | ||
3966 | Constructs, checks, and returns an op of any type that involves an | |
3967 | embedded SV. I<type> is the opcode. I<flags> gives the eight bits | |
3968 | of C<op_flags>. I<sv> gives the SV to embed in the op; this function | |
3969 | takes ownership of one reference to it. | |
3970 | ||
3971 | =cut | |
3972 | */ | |
3973 | ||
79072805 | 3974 | OP * |
864dbfa3 | 3975 | Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv) |
79072805 | 3976 | { |
27da23d5 | 3977 | dVAR; |
79072805 | 3978 | SVOP *svop; |
7918f24d NC |
3979 | |
3980 | PERL_ARGS_ASSERT_NEWSVOP; | |
3981 | ||
e69777c1 GG |
3982 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP |
3983 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP | |
3984 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP); | |
3985 | ||
b7dc083c | 3986 | NewOp(1101, svop, 1, SVOP); |
eb160463 | 3987 | svop->op_type = (OPCODE)type; |
22c35a8c | 3988 | svop->op_ppaddr = PL_ppaddr[type]; |
79072805 LW |
3989 | svop->op_sv = sv; |
3990 | svop->op_next = (OP*)svop; | |
eb160463 | 3991 | svop->op_flags = (U8)flags; |
22c35a8c | 3992 | if (PL_opargs[type] & OA_RETSCALAR) |
463ee0b2 | 3993 | scalar((OP*)svop); |
22c35a8c | 3994 | if (PL_opargs[type] & OA_TARGET) |
ed6116ce | 3995 | svop->op_targ = pad_alloc(type, SVs_PADTMP); |
e50aee73 | 3996 | return CHECKOP(type, svop); |
79072805 LW |
3997 | } |
3998 | ||
392d04bb | 3999 | #ifdef USE_ITHREADS |
d67eb5f4 Z |
4000 | |
4001 | /* | |
4002 | =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv | |
4003 | ||
4004 | Constructs, checks, and returns an op of any type that involves a | |
4005 | reference to a pad element. I<type> is the opcode. I<flags> gives the | |
4006 | eight bits of C<op_flags>. A pad slot is automatically allocated, and | |
4007 | is populated with I<sv>; this function takes ownership of one reference | |
4008 | to it. | |
4009 | ||
4010 | This function only exists if Perl has been compiled to use ithreads. | |
4011 | ||
4012 | =cut | |
4013 | */ | |
4014 | ||
79072805 | 4015 | OP * |
350de78d GS |
4016 | Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv) |
4017 | { | |
27da23d5 | 4018 | dVAR; |
350de78d | 4019 | PADOP *padop; |
7918f24d NC |
4020 | |
4021 | PERL_ARGS_ASSERT_NEWPADOP; | |
4022 | ||
e69777c1 GG |
4023 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP |
4024 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP | |
4025 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP); | |
4026 | ||
350de78d | 4027 | NewOp(1101, padop, 1, PADOP); |
eb160463 | 4028 | padop->op_type = (OPCODE)type; |
350de78d GS |
4029 | padop->op_ppaddr = PL_ppaddr[type]; |
4030 | padop->op_padix = pad_alloc(type, SVs_PADTMP); | |
dd2155a4 DM |
4031 | SvREFCNT_dec(PAD_SVl(padop->op_padix)); |
4032 | PAD_SETSV(padop->op_padix, sv); | |
58182927 NC |
4033 | assert(sv); |
4034 | SvPADTMP_on(sv); | |
350de78d | 4035 | padop->op_next = (OP*)padop; |
eb160463 | 4036 | padop->op_flags = (U8)flags; |
350de78d GS |
4037 | if (PL_opargs[type] & OA_RETSCALAR) |
4038 | scalar((OP*)padop); | |
4039 | if (PL_opargs[type] & OA_TARGET) | |
4040 | padop->op_targ = pad_alloc(type, SVs_PADTMP); | |
4041 | return CHECKOP(type, padop); | |
4042 | } | |
d67eb5f4 Z |
4043 | |
4044 | #endif /* !USE_ITHREADS */ | |
4045 | ||
4046 | /* | |
4047 | =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv | |
4048 | ||
4049 | Constructs, checks, and returns an op of any type that involves an | |
4050 | embedded reference to a GV. I<type> is the opcode. I<flags> gives the | |
4051 | eight bits of C<op_flags>. I<gv> identifies the GV that the op should | |
4052 | reference; calling this function does not transfer ownership of any | |
4053 | reference to it. | |
4054 | ||
4055 | =cut | |
4056 | */ | |
350de78d GS |
4057 | |
4058 | OP * | |
864dbfa3 | 4059 | Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv) |
79072805 | 4060 | { |
27da23d5 | 4061 | dVAR; |
7918f24d NC |
4062 | |
4063 | PERL_ARGS_ASSERT_NEWGVOP; | |
4064 | ||
350de78d | 4065 | #ifdef USE_ITHREADS |
58182927 | 4066 | GvIN_PAD_on(gv); |
ff8997d7 | 4067 | return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv)); |
350de78d | 4068 | #else |
ff8997d7 | 4069 | return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv)); |
350de78d | 4070 | #endif |
79072805 LW |
4071 | } |
4072 | ||
d67eb5f4 Z |
4073 | /* |
4074 | =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv | |
4075 | ||
4076 | Constructs, checks, and returns an op of any type that involves an | |
4077 | embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives | |
4078 | the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which | |
4079 | must have been allocated using L</PerlMemShared_malloc>; the memory will | |
4080 | be freed when the op is destroyed. | |
4081 | ||
4082 | =cut | |
4083 | */ | |
4084 | ||
79072805 | 4085 | OP * |
864dbfa3 | 4086 | Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv) |
79072805 | 4087 | { |
27da23d5 | 4088 | dVAR; |
79072805 | 4089 | PVOP *pvop; |
e69777c1 GG |
4090 | |
4091 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP | |
4092 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP); | |
4093 | ||
b7dc083c | 4094 | NewOp(1101, pvop, 1, PVOP); |
eb160463 | 4095 | pvop->op_type = (OPCODE)type; |
22c35a8c | 4096 | pvop->op_ppaddr = PL_ppaddr[type]; |
79072805 LW |
4097 | pvop->op_pv = pv; |
4098 | pvop->op_next = (OP*)pvop; | |
eb160463 | 4099 | pvop->op_flags = (U8)flags; |
22c35a8c | 4100 | if (PL_opargs[type] & OA_RETSCALAR) |
463ee0b2 | 4101 | scalar((OP*)pvop); |
22c35a8c | 4102 | if (PL_opargs[type] & OA_TARGET) |
ed6116ce | 4103 | pvop->op_targ = pad_alloc(type, SVs_PADTMP); |
e50aee73 | 4104 | return CHECKOP(type, pvop); |
79072805 LW |
4105 | } |
4106 | ||
eb8433b7 NC |
4107 | #ifdef PERL_MAD |
4108 | OP* | |
4109 | #else | |
79072805 | 4110 | void |
eb8433b7 | 4111 | #endif |
864dbfa3 | 4112 | Perl_package(pTHX_ OP *o) |
79072805 | 4113 | { |
97aff369 | 4114 | dVAR; |
bf070237 | 4115 | SV *const sv = cSVOPo->op_sv; |
eb8433b7 NC |
4116 | #ifdef PERL_MAD |
4117 | OP *pegop; | |
4118 | #endif | |
79072805 | 4119 | |
7918f24d NC |
4120 | PERL_ARGS_ASSERT_PACKAGE; |
4121 | ||
3280af22 NIS |
4122 | save_hptr(&PL_curstash); |
4123 | save_item(PL_curstname); | |
de11ba31 | 4124 | |
bf070237 | 4125 | PL_curstash = gv_stashsv(sv, GV_ADD); |
e1a479c5 | 4126 | |
bf070237 | 4127 | sv_setsv(PL_curstname, sv); |
de11ba31 | 4128 | |
7ad382f4 | 4129 | PL_hints |= HINT_BLOCK_SCOPE; |
53a7735b DM |
4130 | PL_parser->copline = NOLINE; |
4131 | PL_parser->expect = XSTATE; | |
eb8433b7 NC |
4132 | |
4133 | #ifndef PERL_MAD | |
4134 | op_free(o); | |
4135 | #else | |
4136 | if (!PL_madskills) { | |
4137 | op_free(o); | |
1d866c12 | 4138 | return NULL; |
eb8433b7 NC |
4139 | } |
4140 | ||
4141 | pegop = newOP(OP_NULL,0); | |
4142 | op_getmad(o,pegop,'P'); | |
4143 | return pegop; | |
4144 | #endif | |
79072805 LW |
4145 | } |
4146 | ||
6fa4d285 DG |
4147 | void |
4148 | Perl_package_version( pTHX_ OP *v ) | |
4149 | { | |
4150 | dVAR; | |
458818ec | 4151 | U32 savehints = PL_hints; |
6fa4d285 | 4152 | PERL_ARGS_ASSERT_PACKAGE_VERSION; |
458818ec | 4153 | PL_hints &= ~HINT_STRICT_VARS; |
e92f586b | 4154 | sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv ); |
458818ec | 4155 | PL_hints = savehints; |
6fa4d285 DG |
4156 | op_free(v); |
4157 | } | |
4158 | ||
eb8433b7 NC |
4159 | #ifdef PERL_MAD |
4160 | OP* | |
4161 | #else | |
85e6fe83 | 4162 | void |
eb8433b7 | 4163 | #endif |
88d95a4d | 4164 | Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg) |
85e6fe83 | 4165 | { |
97aff369 | 4166 | dVAR; |
a0d0e21e | 4167 | OP *pack; |
a0d0e21e | 4168 | OP *imop; |
b1cb66bf | 4169 | OP *veop; |
eb8433b7 NC |
4170 | #ifdef PERL_MAD |
4171 | OP *pegop = newOP(OP_NULL,0); | |
4172 | #endif | |
85e6fe83 | 4173 | |
7918f24d NC |
4174 | PERL_ARGS_ASSERT_UTILIZE; |
4175 | ||
88d95a4d | 4176 | if (idop->op_type != OP_CONST) |
cea2e8a9 | 4177 | Perl_croak(aTHX_ "Module name must be constant"); |
85e6fe83 | 4178 | |
eb8433b7 NC |
4179 | if (PL_madskills) |
4180 | op_getmad(idop,pegop,'U'); | |
4181 | ||
5f66b61c | 4182 | veop = NULL; |
b1cb66bf | 4183 | |
aec46f14 | 4184 | if (version) { |
551405c4 | 4185 | SV * const vesv = ((SVOP*)version)->op_sv; |
b1cb66bf | 4186 | |
eb8433b7 NC |
4187 | if (PL_madskills) |
4188 | op_getmad(version,pegop,'V'); | |
aec46f14 | 4189 | if (!arg && !SvNIOKp(vesv)) { |
b1cb66bf | 4190 | arg = version; |
4191 | } | |
4192 | else { | |
4193 | OP *pack; | |
0f79a09d | 4194 | SV *meth; |
b1cb66bf | 4195 | |
44dcb63b | 4196 | if (version->op_type != OP_CONST || !SvNIOKp(vesv)) |
fe13d51d | 4197 | Perl_croak(aTHX_ "Version number must be a constant number"); |
b1cb66bf | 4198 | |
88d95a4d JH |
4199 | /* Make copy of idop so we don't free it twice */ |
4200 | pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv)); | |
b1cb66bf | 4201 | |
4202 | /* Fake up a method call to VERSION */ | |
18916d0d | 4203 | meth = newSVpvs_share("VERSION"); |
b1cb66bf | 4204 | veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL, |
2fcb4757 Z |
4205 | op_append_elem(OP_LIST, |
4206 | op_prepend_elem(OP_LIST, pack, list(version)), | |
0f79a09d | 4207 | newSVOP(OP_METHOD_NAMED, 0, meth))); |
b1cb66bf | 4208 | } |
4209 | } | |
aeea060c | 4210 | |
a0d0e21e | 4211 | /* Fake up an import/unimport */ |
eb8433b7 NC |
4212 | if (arg && arg->op_type == OP_STUB) { |
4213 | if (PL_madskills) | |
4214 | op_getmad(arg,pegop,'S'); | |
4633a7c4 | 4215 | imop = arg; /* no import on explicit () */ |
eb8433b7 | 4216 | } |
88d95a4d | 4217 | else if (SvNIOKp(((SVOP*)idop)->op_sv)) { |
5f66b61c | 4218 | imop = NULL; /* use 5.0; */ |
468aa647 RGS |
4219 | if (!aver) |
4220 | idop->op_private |= OPpCONST_NOVER; | |
b1cb66bf | 4221 | } |
4633a7c4 | 4222 | else { |
0f79a09d GS |
4223 | SV *meth; |
4224 | ||
eb8433b7 NC |
4225 | if (PL_madskills) |
4226 | op_getmad(arg,pegop,'A'); | |
4227 | ||
88d95a4d JH |
4228 | /* Make copy of idop so we don't free it twice */ |
4229 | pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv)); | |
0f79a09d GS |
4230 | |
4231 | /* Fake up a method call to import/unimport */ | |
427d62a4 | 4232 | meth = aver |
18916d0d | 4233 | ? newSVpvs_share("import") : newSVpvs_share("unimport"); |
4633a7c4 | 4234 | imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL, |
2fcb4757 Z |
4235 | op_append_elem(OP_LIST, |
4236 | op_prepend_elem(OP_LIST, pack, list(arg)), | |
0f79a09d | 4237 | newSVOP(OP_METHOD_NAMED, 0, meth))); |
4633a7c4 LW |
4238 | } |
4239 | ||
a0d0e21e | 4240 | /* Fake up the BEGIN {}, which does its thing immediately. */ |
09bef843 | 4241 | newATTRSUB(floor, |
18916d0d | 4242 | newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")), |
5f66b61c AL |
4243 | NULL, |
4244 | NULL, | |
2fcb4757 Z |
4245 | op_append_elem(OP_LINESEQ, |
4246 | op_append_elem(OP_LINESEQ, | |
bd61b366 SS |
4247 | newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)), |
4248 | newSTATEOP(0, NULL, veop)), | |
4249 | newSTATEOP(0, NULL, imop) )); | |
85e6fe83 | 4250 | |
70f5e4ed JH |
4251 | /* The "did you use incorrect case?" warning used to be here. |
4252 | * The problem is that on case-insensitive filesystems one | |
4253 | * might get false positives for "use" (and "require"): | |
4254 | * "use Strict" or "require CARP" will work. This causes | |
4255 | * portability problems for the script: in case-strict | |
4256 | * filesystems the script will stop working. | |
4257 | * | |
4258 | * The "incorrect case" warning checked whether "use Foo" | |
4259 | * imported "Foo" to your namespace, but that is wrong, too: | |
4260 | * there is no requirement nor promise in the language that | |
4261 | * a Foo.pm should or would contain anything in package "Foo". | |
4262 | * | |
4263 | * There is very little Configure-wise that can be done, either: | |
4264 | * the case-sensitivity of the build filesystem of Perl does not | |
4265 | * help in guessing the case-sensitivity of the runtime environment. | |
4266 | */ | |
18fc9488 | 4267 | |
c305c6a0 | 4268 | PL_hints |= HINT_BLOCK_SCOPE; |
53a7735b DM |
4269 | PL_parser->copline = NOLINE; |
4270 | PL_parser->expect = XSTATE; | |
8ec8fbef | 4271 | PL_cop_seqmax++; /* Purely for B::*'s benefit */ |
eb8433b7 NC |
4272 | |
4273 | #ifdef PERL_MAD | |
4274 | if (!PL_madskills) { | |
4275 | /* FIXME - don't allocate pegop if !PL_madskills */ | |
4276 | op_free(pegop); | |
1d866c12 | 4277 | return NULL; |
eb8433b7 NC |
4278 | } |
4279 | return pegop; | |
4280 | #endif | |
85e6fe83 LW |
4281 | } |
4282 | ||
7d3fb230 | 4283 | /* |
ccfc67b7 JH |
4284 | =head1 Embedding Functions |
4285 | ||
7d3fb230 BS |
4286 | =for apidoc load_module |
4287 | ||
4288 | Loads the module whose name is pointed to by the string part of name. | |
4289 | Note that the actual module name, not its filename, should be given. | |
4290 | Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of | |
4291 | PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS | |
4292 | (or 0 for no flags). ver, if specified, provides version semantics | |
4293 | similar to C<use Foo::Bar VERSION>. The optional trailing SV* | |
4294 | arguments can be used to specify arguments to the module's import() | |
76f108ac JD |
4295 | method, similar to C<use Foo::Bar VERSION LIST>. They must be |
4296 | terminated with a final NULL pointer. Note that this list can only | |
4297 | be omitted when the PERL_LOADMOD_NOIMPORT flag has been used. | |
4298 | Otherwise at least a single NULL pointer to designate the default | |
4299 | import list is required. | |
7d3fb230 BS |
4300 | |
4301 | =cut */ | |
4302 | ||
e4783991 GS |
4303 | void |
4304 | Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...) | |
4305 | { | |
4306 | va_list args; | |
7918f24d NC |
4307 | |
4308 | PERL_ARGS_ASSERT_LOAD_MODULE; | |
4309 | ||
e4783991 GS |
4310 | va_start(args, ver); |
4311 | vload_module(flags, name, ver, &args); | |
4312 | va_end(args); | |
4313 | } | |
4314 | ||
4315 | #ifdef PERL_IMPLICIT_CONTEXT | |
4316 | void | |
4317 | Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...) | |
4318 | { | |
4319 | dTHX; | |
4320 | va_list args; | |
7918f24d | 4321 | PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT; |
e4783991 GS |
4322 | va_start(args, ver); |
4323 | vload_module(flags, name, ver, &args); | |
4324 | va_end(args); | |
4325 | } | |
4326 | #endif | |
4327 | ||
4328 | void | |
4329 | Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args) | |
4330 | { | |
97aff369 | 4331 | dVAR; |
551405c4 | 4332 | OP *veop, *imop; |
551405c4 | 4333 | OP * const modname = newSVOP(OP_CONST, 0, name); |
7918f24d NC |
4334 | |
4335 | PERL_ARGS_ASSERT_VLOAD_MODULE; | |
4336 | ||
e4783991 GS |
4337 | modname->op_private |= OPpCONST_BARE; |
4338 | if (ver) { | |
4339 | veop = newSVOP(OP_CONST, 0, ver); | |
4340 | } | |
4341 | else | |
5f66b61c | 4342 | veop = NULL; |
e4783991 GS |
4343 | if (flags & PERL_LOADMOD_NOIMPORT) { |
4344 | imop = sawparens(newNULLLIST()); | |
4345 | } | |
4346 | else if (flags & PERL_LOADMOD_IMPORT_OPS) { | |
4347 | imop = va_arg(*args, OP*); | |
4348 | } | |
4349 | else { | |
4350 | SV *sv; | |
5f66b61c | 4351 | imop = NULL; |
e4783991 GS |
4352 | sv = va_arg(*args, SV*); |
4353 | while (sv) { | |
2fcb4757 | 4354 | imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv)); |
e4783991 GS |
4355 | sv = va_arg(*args, SV*); |
4356 | } | |
4357 | } | |
81885997 | 4358 | |
53a7735b DM |
4359 | /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure |
4360 | * that it has a PL_parser to play with while doing that, and also | |
4361 | * that it doesn't mess with any existing parser, by creating a tmp | |
4362 | * new parser with lex_start(). This won't actually be used for much, | |
4363 | * since pp_require() will create another parser for the real work. */ | |
4364 | ||
4365 | ENTER; | |
4366 | SAVEVPTR(PL_curcop); | |
5486870f | 4367 | lex_start(NULL, NULL, FALSE); |
53a7735b DM |
4368 | utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0), |
4369 | veop, modname, imop); | |
4370 | LEAVE; | |
e4783991 GS |
4371 | } |
4372 | ||
79072805 | 4373 | OP * |
850e8516 | 4374 | Perl_dofile(pTHX_ OP *term, I32 force_builtin) |
78ca652e | 4375 | { |
97aff369 | 4376 | dVAR; |
78ca652e | 4377 | OP *doop; |
a0714e2c | 4378 | GV *gv = NULL; |
78ca652e | 4379 | |
7918f24d NC |
4380 | PERL_ARGS_ASSERT_DOFILE; |
4381 | ||
850e8516 | 4382 | if (!force_builtin) { |
fafc274c | 4383 | gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV); |
850e8516 | 4384 | if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) { |
a4fc7abc | 4385 | GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE); |
a0714e2c | 4386 | gv = gvp ? *gvp : NULL; |
850e8516 RGS |
4387 | } |
4388 | } | |
78ca652e | 4389 | |
b9f751c0 | 4390 | if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) { |
78ca652e | 4391 | doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED, |
2fcb4757 | 4392 | op_append_elem(OP_LIST, term, |
78ca652e | 4393 | scalar(newUNOP(OP_RV2CV, 0, |
d4c19fe8 | 4394 | newGVOP(OP_GV, 0, gv)))))); |
78ca652e GS |
4395 | } |
4396 | else { | |
4397 | doop = newUNOP(OP_DOFILE, 0, scalar(term)); | |
4398 | } | |
4399 | return doop; | |
4400 | } | |
4401 | ||
d67eb5f4 Z |
4402 | /* |
4403 | =head1 Optree construction | |
4404 | ||
4405 | =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval | |
4406 | ||
4407 | Constructs, checks, and returns an C<lslice> (list slice) op. I<flags> | |
4408 | gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will | |
4409 | be set automatically, and, shifted up eight bits, the eight bits of | |
4410 | C<op_private>, except that the bit with value 1 or 2 is automatically | |
4411 | set as required. I<listval> and I<subscript> supply the parameters of | |
4412 | the slice; they are consumed by this function and become part of the | |
4413 | constructed op tree. | |
4414 | ||
4415 | =cut | |
4416 | */ | |
4417 | ||
78ca652e | 4418 | OP * |
864dbfa3 | 4419 | Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval) |
79072805 LW |
4420 | { |
4421 | return newBINOP(OP_LSLICE, flags, | |
8990e307 LW |
4422 | list(force_list(subscript)), |
4423 | list(force_list(listval)) ); | |
79072805 LW |
4424 | } |
4425 | ||
76e3520e | 4426 | STATIC I32 |
504618e9 | 4427 | S_is_list_assignment(pTHX_ register const OP *o) |
79072805 | 4428 | { |
1496a290 AL |
4429 | unsigned type; |
4430 | U8 flags; | |
4431 | ||
11343788 | 4432 | if (!o) |
79072805 LW |
4433 | return TRUE; |
4434 | ||
1496a290 | 4435 | if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS)) |
11343788 | 4436 | o = cUNOPo->op_first; |
79072805 | 4437 | |
1496a290 AL |
4438 | flags = o->op_flags; |
4439 | type = o->op_type; | |
4440 | if (type == OP_COND_EXPR) { | |
504618e9 AL |
4441 | const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling); |
4442 | const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling); | |
79072805 LW |
4443 | |
4444 | if (t && f) | |
4445 | return TRUE; | |
4446 | if (t || f) | |
4447 | yyerror("Assignment to both a list and a scalar"); | |
4448 | return FALSE; | |
4449 | } | |
4450 | ||
1496a290 AL |
4451 | if (type == OP_LIST && |
4452 | (flags & OPf_WANT) == OPf_WANT_SCALAR && | |
95f0a2f1 SB |
4453 | o->op_private & OPpLVAL_INTRO) |
4454 | return FALSE; | |
4455 | ||
1496a290 AL |
4456 | if (type == OP_LIST || flags & OPf_PARENS || |
4457 | type == OP_RV2AV || type == OP_RV2HV || | |
4458 | type == OP_ASLICE || type == OP_HSLICE) | |
79072805 LW |
4459 | return TRUE; |
4460 | ||
1496a290 | 4461 | if (type == OP_PADAV || type == OP_PADHV) |
93a17b20 LW |
4462 | return TRUE; |
4463 | ||
1496a290 | 4464 | if (type == OP_RV2SV) |
79072805 LW |
4465 | return FALSE; |
4466 | ||
4467 | return FALSE; | |
4468 | } | |
4469 | ||
d67eb5f4 Z |
4470 | /* |
4471 | =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right | |
4472 | ||
4473 | Constructs, checks, and returns an assignment op. I<left> and I<right> | |
4474 | supply the parameters of the assignment; they are consumed by this | |
4475 | function and become part of the constructed op tree. | |
4476 | ||
4477 | If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then | |
4478 | a suitable conditional optree is constructed. If I<optype> is the opcode | |
4479 | of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that | |
4480 | performs the binary operation and assigns the result to the left argument. | |
4481 | Either way, if I<optype> is non-zero then I<flags> has no effect. | |
4482 | ||
4483 | If I<optype> is zero, then a plain scalar or list assignment is | |
4484 | constructed. Which type of assignment it is is automatically determined. | |
4485 | I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS> | |
4486 | will be set automatically, and, shifted up eight bits, the eight bits | |
4487 | of C<op_private>, except that the bit with value 1 or 2 is automatically | |
4488 | set as required. | |
4489 | ||
4490 | =cut | |
4491 | */ | |
4492 | ||
79072805 | 4493 | OP * |
864dbfa3 | 4494 | Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right) |
79072805 | 4495 | { |
97aff369 | 4496 | dVAR; |
11343788 | 4497 | OP *o; |
79072805 | 4498 | |
a0d0e21e | 4499 | if (optype) { |
c963b151 | 4500 | if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) { |
a0d0e21e LW |
4501 | return newLOGOP(optype, 0, |
4502 | mod(scalar(left), optype), | |
4503 | newUNOP(OP_SASSIGN, 0, scalar(right))); | |
4504 | } | |
4505 | else { | |
4506 | return newBINOP(optype, OPf_STACKED, | |
4507 | mod(scalar(left), optype), scalar(right)); | |
4508 | } | |
4509 | } | |
4510 | ||
504618e9 | 4511 | if (is_list_assignment(left)) { |
6dbe9451 NC |
4512 | static const char no_list_state[] = "Initialization of state variables" |
4513 | " in list context currently forbidden"; | |
10c8fecd | 4514 | OP *curop; |
fafafbaf | 4515 | bool maybe_common_vars = TRUE; |
10c8fecd | 4516 | |
3280af22 | 4517 | PL_modcount = 0; |
dbfe47cf RD |
4518 | /* Grandfathering $[ assignment here. Bletch.*/ |
4519 | /* Only simple assignments like C<< ($[) = 1 >> are allowed */ | |
fe5bfecd | 4520 | PL_eval_start = (left->op_type == OP_CONST) ? right : NULL; |
463ee0b2 | 4521 | left = mod(left, OP_AASSIGN); |
3280af22 NIS |
4522 | if (PL_eval_start) |
4523 | PL_eval_start = 0; | |
dbfe47cf | 4524 | else if (left->op_type == OP_CONST) { |
f175a6ef | 4525 | deprecate("assignment to $["); |
eb8433b7 | 4526 | /* FIXME for MAD */ |
dbfe47cf RD |
4527 | /* Result of assignment is always 1 (or we'd be dead already) */ |
4528 | return newSVOP(OP_CONST, 0, newSViv(1)); | |
a0d0e21e | 4529 | } |
10c8fecd GS |
4530 | curop = list(force_list(left)); |
4531 | o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop); | |
eb160463 | 4532 | o->op_private = (U8)(0 | (flags >> 8)); |
dd2155a4 | 4533 | |
fafafbaf RD |
4534 | if ((left->op_type == OP_LIST |
4535 | || (left->op_type == OP_NULL && left->op_targ == OP_LIST))) | |
4536 | { | |
4537 | OP* lop = ((LISTOP*)left)->op_first; | |
4538 | maybe_common_vars = FALSE; | |
4539 | while (lop) { | |
4540 | if (lop->op_type == OP_PADSV || | |
4541 | lop->op_type == OP_PADAV || | |
4542 | lop->op_type == OP_PADHV || | |
4543 | lop->op_type == OP_PADANY) { | |
4544 | if (!(lop->op_private & OPpLVAL_INTRO)) | |
4545 | maybe_common_vars = TRUE; | |
4546 | ||
4547 | if (lop->op_private & OPpPAD_STATE) { | |
4548 | if (left->op_private & OPpLVAL_INTRO) { | |
4549 | /* Each variable in state($a, $b, $c) = ... */ | |
4550 | } | |
4551 | else { | |
4552 | /* Each state variable in | |
4553 | (state $a, my $b, our $c, $d, undef) = ... */ | |
4554 | } | |
4555 | yyerror(no_list_state); | |
4556 | } else { | |
4557 | /* Each my variable in | |
4558 | (state $a, my $b, our $c, $d, undef) = ... */ | |
4559 | } | |
4560 | } else if (lop->op_type == OP_UNDEF || | |
4561 | lop->op_type == OP_PUSHMARK) { | |
4562 | /* undef may be interesting in | |
4563 | (state $a, undef, state $c) */ | |
4564 | } else { | |
4565 | /* Other ops in the list. */ | |
4566 | maybe_common_vars = TRUE; | |
4567 | } | |
4568 | lop = lop->op_sibling; | |
4569 | } | |
4570 | } | |
4571 | else if ((left->op_private & OPpLVAL_INTRO) | |
4572 | && ( left->op_type == OP_PADSV | |
4573 | || left->op_type == OP_PADAV | |
4574 | || left->op_type == OP_PADHV | |
4575 | || left->op_type == OP_PADANY)) | |
4576 | { | |
0f907b96 | 4577 | if (left->op_type == OP_PADSV) maybe_common_vars = FALSE; |
fafafbaf RD |
4578 | if (left->op_private & OPpPAD_STATE) { |
4579 | /* All single variable list context state assignments, hence | |
4580 | state ($a) = ... | |
4581 | (state $a) = ... | |
4582 | state @a = ... | |
4583 | state (@a) = ... | |
4584 | (state @a) = ... | |
4585 | state %a = ... | |
4586 | state (%a) = ... | |
4587 | (state %a) = ... | |
4588 | */ | |
4589 | yyerror(no_list_state); | |
4590 | } | |
4591 | } | |
4592 | ||
dd2155a4 DM |
4593 | /* PL_generation sorcery: |
4594 | * an assignment like ($a,$b) = ($c,$d) is easier than | |
4595 | * ($a,$b) = ($c,$a), since there is no need for temporary vars. | |
4596 | * To detect whether there are common vars, the global var | |
4597 | * PL_generation is incremented for each assign op we compile. | |
4598 | * Then, while compiling the assign op, we run through all the | |
4599 | * variables on both sides of the assignment, setting a spare slot | |
4600 | * in each of them to PL_generation. If any of them already have | |
4601 | * that value, we know we've got commonality. We could use a | |
4602 | * single bit marker, but then we'd have to make 2 passes, first | |
4603 | * to clear the flag, then to test and set it. To find somewhere | |
931b58fb | 4604 | * to store these values, evil chicanery is done with SvUVX(). |
dd2155a4 DM |
4605 | */ |
4606 | ||
fafafbaf | 4607 | if (maybe_common_vars) { |
11343788 | 4608 | OP *lastop = o; |
3280af22 | 4609 | PL_generation++; |
11343788 | 4610 | for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) { |
22c35a8c | 4611 | if (PL_opargs[curop->op_type] & OA_DANGEROUS) { |
79072805 | 4612 | if (curop->op_type == OP_GV) { |
638eceb6 | 4613 | GV *gv = cGVOPx_gv(curop); |
169d2d72 NC |
4614 | if (gv == PL_defgv |
4615 | || (int)GvASSIGN_GENERATION(gv) == PL_generation) | |
79072805 | 4616 | break; |
169d2d72 | 4617 | GvASSIGN_GENERATION_set(gv, PL_generation); |
79072805 | 4618 | } |
748a9306 LW |
4619 | else if (curop->op_type == OP_PADSV || |
4620 | curop->op_type == OP_PADAV || | |
4621 | curop->op_type == OP_PADHV || | |
dd2155a4 DM |
4622 | curop->op_type == OP_PADANY) |
4623 | { | |
4624 | if (PAD_COMPNAME_GEN(curop->op_targ) | |
92251a1e | 4625 | == (STRLEN)PL_generation) |
748a9306 | 4626 | break; |
b162af07 | 4627 | PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation); |
dd2155a4 | 4628 | |
748a9306 | 4629 | } |
79072805 LW |
4630 | else if (curop->op_type == OP_RV2CV) |
4631 | break; | |
4632 | else if (curop->op_type == OP_RV2SV || | |
4633 | curop->op_type == OP_RV2AV || | |
4634 | curop->op_type == OP_RV2HV || | |
4635 | curop->op_type == OP_RV2GV) { | |
4636 | if (lastop->op_type != OP_GV) /* funny deref? */ | |
4637 | break; | |
4638 | } | |
1167e5da | 4639 | else if (curop->op_type == OP_PUSHRE) { |
b3f5893f | 4640 | #ifdef USE_ITHREADS |
20e98b0f | 4641 | if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) { |
159b6efe | 4642 | GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff)); |
169d2d72 NC |
4643 | if (gv == PL_defgv |
4644 | || (int)GvASSIGN_GENERATION(gv) == PL_generation) | |
1167e5da | 4645 | break; |
169d2d72 | 4646 | GvASSIGN_GENERATION_set(gv, PL_generation); |
20e98b0f NC |
4647 | } |
4648 | #else | |
4649 | GV *const gv | |
4650 | = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv; | |
4651 | if (gv) { | |
4652 | if (gv == PL_defgv | |
4653 | || (int)GvASSIGN_GENERATION(gv) == PL_generation) | |
4654 | break; | |
169d2d72 | 4655 | GvASSIGN_GENERATION_set(gv, PL_generation); |
b2ffa427 | 4656 | } |
20e98b0f | 4657 | #endif |
1167e5da | 4658 | } |
79072805 LW |
4659 | else |
4660 | break; | |
4661 | } | |
4662 | lastop = curop; | |
4663 | } | |
11343788 | 4664 | if (curop != o) |
10c8fecd | 4665 | o->op_private |= OPpASSIGN_COMMON; |
461824dc | 4666 | } |
9fdc7570 | 4667 | |
e9cc17ba | 4668 | if (right && right->op_type == OP_SPLIT && !PL_madskills) { |
1496a290 AL |
4669 | OP* tmpop = ((LISTOP*)right)->op_first; |
4670 | if (tmpop && (tmpop->op_type == OP_PUSHRE)) { | |
551405c4 | 4671 | PMOP * const pm = (PMOP*)tmpop; |
c07a80fd | 4672 | if (left->op_type == OP_RV2AV && |
4673 | !(left->op_private & OPpLVAL_INTRO) && | |
11343788 | 4674 | !(o->op_private & OPpASSIGN_COMMON) ) |
c07a80fd | 4675 | { |
4676 | tmpop = ((UNOP*)left)->op_first; | |
20e98b0f NC |
4677 | if (tmpop->op_type == OP_GV |
4678 | #ifdef USE_ITHREADS | |
4679 | && !pm->op_pmreplrootu.op_pmtargetoff | |
4680 | #else | |
4681 | && !pm->op_pmreplrootu.op_pmtargetgv | |
4682 | #endif | |
4683 | ) { | |
971a9dd3 | 4684 | #ifdef USE_ITHREADS |
20e98b0f NC |
4685 | pm->op_pmreplrootu.op_pmtargetoff |
4686 | = cPADOPx(tmpop)->op_padix; | |
971a9dd3 GS |
4687 | cPADOPx(tmpop)->op_padix = 0; /* steal it */ |
4688 | #else | |
20e98b0f | 4689 | pm->op_pmreplrootu.op_pmtargetgv |
159b6efe | 4690 | = MUTABLE_GV(cSVOPx(tmpop)->op_sv); |
a0714e2c | 4691 | cSVOPx(tmpop)->op_sv = NULL; /* steal it */ |
971a9dd3 | 4692 | #endif |
c07a80fd | 4693 | pm->op_pmflags |= PMf_ONCE; |
11343788 | 4694 | tmpop = cUNOPo->op_first; /* to list (nulled) */ |
c07a80fd | 4695 | tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */ |
5f66b61c | 4696 | tmpop->op_sibling = NULL; /* don't free split */ |
c07a80fd | 4697 | right->op_next = tmpop->op_next; /* fix starting loc */ |
11343788 | 4698 | op_free(o); /* blow off assign */ |
54310121 | 4699 | right->op_flags &= ~OPf_WANT; |
a5f75d66 | 4700 | /* "I don't know and I don't care." */ |
c07a80fd | 4701 | return right; |
4702 | } | |
4703 | } | |
4704 | else { | |
e6438c1a | 4705 | if (PL_modcount < RETURN_UNLIMITED_NUMBER && |
c07a80fd | 4706 | ((LISTOP*)right)->op_last->op_type == OP_CONST) |
4707 | { | |
4708 | SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv; | |
b8de32d5 | 4709 | if (SvIOK(sv) && SvIVX(sv) == 0) |
3280af22 | 4710 | sv_setiv(sv, PL_modcount+1); |
c07a80fd | 4711 | } |
4712 | } | |
4713 | } | |
4714 | } | |
11343788 | 4715 | return o; |
79072805 LW |
4716 | } |
4717 | if (!right) | |
4718 | right = newOP(OP_UNDEF, 0); | |
4719 | if (right->op_type == OP_READLINE) { | |
4720 | right->op_flags |= OPf_STACKED; | |
463ee0b2 | 4721 | return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right)); |
79072805 | 4722 | } |
a0d0e21e | 4723 | else { |
3280af22 | 4724 | PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/ |
11343788 | 4725 | o = newBINOP(OP_SASSIGN, flags, |
463ee0b2 | 4726 | scalar(right), mod(scalar(left), OP_SASSIGN) ); |
3280af22 NIS |
4727 | if (PL_eval_start) |
4728 | PL_eval_start = 0; | |
748a9306 | 4729 | else { |
27aaedc1 | 4730 | if (!PL_madskills) { /* assignment to $[ is ignored when making a mad dump */ |
55b67815 | 4731 | deprecate("assignment to $["); |
27aaedc1 GG |
4732 | op_free(o); |
4733 | o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling))); | |
4734 | o->op_private |= OPpCONST_ARYBASE; | |
4735 | } | |
a0d0e21e LW |
4736 | } |
4737 | } | |
11343788 | 4738 | return o; |
79072805 LW |
4739 | } |
4740 | ||
d67eb5f4 Z |
4741 | /* |
4742 | =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o | |
4743 | ||
4744 | Constructs a state op (COP). The state op is normally a C<nextstate> op, | |
4745 | but will be a C<dbstate> op if debugging is enabled for currently-compiled | |
4746 | code. The state op is populated from L</PL_curcop> (or L</PL_compiling>). | |
4747 | If I<label> is non-null, it supplies the name of a label to attach to | |
4748 | the state op; this function takes ownership of the memory pointed at by | |
4749 | I<label>, and will free it. I<flags> gives the eight bits of C<op_flags> | |
4750 | for the state op. | |
4751 | ||
4752 | If I<o> is null, the state op is returned. Otherwise the state op is | |
4753 | combined with I<o> into a C<lineseq> list op, which is returned. I<o> | |
4754 | is consumed by this function and becomes part of the returned op tree. | |
4755 | ||
4756 | =cut | |
4757 | */ | |
4758 | ||
79072805 | 4759 | OP * |
864dbfa3 | 4760 | Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o) |
79072805 | 4761 | { |
27da23d5 | 4762 | dVAR; |
e1ec3a88 | 4763 | const U32 seq = intro_my(); |
79072805 LW |
4764 | register COP *cop; |
4765 | ||
b7dc083c | 4766 | NewOp(1101, cop, 1, COP); |
57843af0 | 4767 | if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) { |
8990e307 | 4768 | cop->op_type = OP_DBSTATE; |
22c35a8c | 4769 | cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ]; |
8990e307 LW |
4770 | } |
4771 | else { | |
4772 | cop->op_type = OP_NEXTSTATE; | |
22c35a8c | 4773 | cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ]; |
8990e307 | 4774 | } |
eb160463 | 4775 | cop->op_flags = (U8)flags; |
623e6609 | 4776 | CopHINTS_set(cop, PL_hints); |
ff0cee69 | 4777 | #ifdef NATIVE_HINTS |
4778 | cop->op_private |= NATIVE_HINTS; | |
4779 | #endif | |
623e6609 | 4780 | CopHINTS_set(&PL_compiling, CopHINTS_get(cop)); |
79072805 LW |
4781 | cop->op_next = (OP*)cop; |
4782 | ||
bbce6d69 | 4783 | cop->cop_seq = seq; |
7b0bddfa | 4784 | /* CopARYBASE is now "virtual", in that it's stored as a flag bit in |
c28fe1ec NC |
4785 | CopHINTS and a possible value in cop_hints_hash, so no need to copy it. |
4786 | */ | |
72dc9ed5 | 4787 | cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings); |
c28fe1ec NC |
4788 | cop->cop_hints_hash = PL_curcop->cop_hints_hash; |
4789 | if (cop->cop_hints_hash) { | |
cbb1fbea | 4790 | HINTS_REFCNT_LOCK; |
c28fe1ec | 4791 | cop->cop_hints_hash->refcounted_he_refcnt++; |
cbb1fbea | 4792 | HINTS_REFCNT_UNLOCK; |
b3ca2e83 | 4793 | } |
dca6062a | 4794 | if (label) { |
a77ac40c | 4795 | Perl_store_cop_label(aTHX_ cop, label, strlen(label), 0); |
dca6062a NC |
4796 | |
4797 | PL_hints |= HINT_BLOCK_SCOPE; | |
4798 | /* It seems that we need to defer freeing this pointer, as other parts | |
4799 | of the grammar end up wanting to copy it after this op has been | |
4800 | created. */ | |
4801 | SAVEFREEPV(label); | |
dca6062a | 4802 | } |
79072805 | 4803 | |
53a7735b | 4804 | if (PL_parser && PL_parser->copline == NOLINE) |
57843af0 | 4805 | CopLINE_set(cop, CopLINE(PL_curcop)); |
79072805 | 4806 | else { |
53a7735b DM |
4807 | CopLINE_set(cop, PL_parser->copline); |
4808 | if (PL_parser) | |
4809 | PL_parser->copline = NOLINE; | |
79072805 | 4810 | } |
57843af0 | 4811 | #ifdef USE_ITHREADS |
f4dd75d9 | 4812 | CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */ |
57843af0 | 4813 | #else |
f4dd75d9 | 4814 | CopFILEGV_set(cop, CopFILEGV(PL_curcop)); |
57843af0 | 4815 | #endif |
11faa288 | 4816 | CopSTASH_set(cop, PL_curstash); |
79072805 | 4817 | |
65269a95 TB |
4818 | if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) { |
4819 | /* this line can have a breakpoint - store the cop in IV */ | |
80a702cd RGS |
4820 | AV *av = CopFILEAVx(PL_curcop); |
4821 | if (av) { | |
4822 | SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE); | |
4823 | if (svp && *svp != &PL_sv_undef ) { | |
4824 | (void)SvIOK_on(*svp); | |
4825 | SvIV_set(*svp, PTR2IV(cop)); | |
4826 | } | |
1eb1540c | 4827 | } |
93a17b20 LW |
4828 | } |
4829 | ||
f6f3a1fe RGS |
4830 | if (flags & OPf_SPECIAL) |
4831 | op_null((OP*)cop); | |
2fcb4757 | 4832 | return op_prepend_elem(OP_LINESEQ, (OP*)cop, o); |
79072805 LW |
4833 | } |
4834 | ||
d67eb5f4 Z |
4835 | /* |
4836 | =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other | |
4837 | ||
4838 | Constructs, checks, and returns a logical (flow control) op. I<type> | |
4839 | is the opcode. I<flags> gives the eight bits of C<op_flags>, except | |
4840 | that C<OPf_KIDS> will be set automatically, and, shifted up eight bits, | |
4841 | the eight bits of C<op_private>, except that the bit with value 1 is | |
4842 | automatically set. I<first> supplies the expression controlling the | |
4843 | flow, and I<other> supplies the side (alternate) chain of ops; they are | |
4844 | consumed by this function and become part of the constructed op tree. | |
4845 | ||
4846 | =cut | |
4847 | */ | |
bbce6d69 | 4848 | |
79072805 | 4849 | OP * |
864dbfa3 | 4850 | Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other) |
79072805 | 4851 | { |
27da23d5 | 4852 | dVAR; |
7918f24d NC |
4853 | |
4854 | PERL_ARGS_ASSERT_NEWLOGOP; | |
4855 | ||
883ffac3 CS |
4856 | return new_logop(type, flags, &first, &other); |
4857 | } | |
4858 | ||
3bd495df | 4859 | STATIC OP * |
71c4dbc3 VP |
4860 | S_search_const(pTHX_ OP *o) |
4861 | { | |
4862 | PERL_ARGS_ASSERT_SEARCH_CONST; | |
4863 | ||
4864 | switch (o->op_type) { | |
4865 | case OP_CONST: | |
4866 | return o; | |
4867 | case OP_NULL: | |
4868 | if (o->op_flags & OPf_KIDS) | |
4869 | return search_const(cUNOPo->op_first); | |
4870 | break; | |
4871 | case OP_LEAVE: | |
4872 | case OP_SCOPE: | |
4873 | case OP_LINESEQ: | |
4874 | { | |
4875 | OP *kid; | |
4876 | if (!(o->op_flags & OPf_KIDS)) | |
4877 | return NULL; | |
4878 | kid = cLISTOPo->op_first; | |
4879 | do { | |
4880 | switch (kid->op_type) { | |
4881 | case OP_ENTER: | |
4882 | case OP_NULL: | |
4883 | case OP_NEXTSTATE: | |
4884 | kid = kid->op_sibling; | |
4885 | break; | |
4886 | default: | |
4887 | if (kid != cLISTOPo->op_last) | |
4888 | return NULL; | |
4889 | goto last; | |
4890 | } | |
4891 | } while (kid); | |
4892 | if (!kid) | |
4893 | kid = cLISTOPo->op_last; | |
4894 | last: | |
4895 | return search_const(kid); | |
4896 | } | |
4897 | } | |
4898 | ||
4899 | return NULL; | |
4900 | } | |
4901 | ||
4902 | STATIC OP * | |
cea2e8a9 | 4903 | S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp) |
883ffac3 | 4904 | { |
27da23d5 | 4905 | dVAR; |
79072805 | 4906 | LOGOP *logop; |
11343788 | 4907 | OP *o; |
71c4dbc3 VP |
4908 | OP *first; |
4909 | OP *other; | |
4910 | OP *cstop = NULL; | |
edbe35ea | 4911 | int prepend_not = 0; |
79072805 | 4912 | |
7918f24d NC |
4913 | PERL_ARGS_ASSERT_NEW_LOGOP; |
4914 | ||
71c4dbc3 VP |
4915 | first = *firstp; |
4916 | other = *otherp; | |
4917 | ||
a0d0e21e LW |
4918 | if (type == OP_XOR) /* Not short circuit, but here by precedence. */ |
4919 | return newBINOP(type, flags, scalar(first), scalar(other)); | |
4920 | ||
e69777c1 GG |
4921 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP); |
4922 | ||
8990e307 | 4923 | scalarboolean(first); |
edbe35ea | 4924 | /* optimize AND and OR ops that have NOTs as children */ |
68726e16 | 4925 | if (first->op_type == OP_NOT |
b6214b80 | 4926 | && (first->op_flags & OPf_KIDS) |
edbe35ea VP |
4927 | && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */ |
4928 | || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */ | |
b6214b80 | 4929 | && !PL_madskills) { |
79072805 LW |
4930 | if (type == OP_AND || type == OP_OR) { |
4931 | if (type == OP_AND) | |
4932 | type = OP_OR; | |
4933 | else | |
4934 | type = OP_AND; | |
07f3cdf5 | 4935 | op_null(first); |
edbe35ea | 4936 | if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */ |
07f3cdf5 | 4937 | op_null(other); |
edbe35ea VP |
4938 | prepend_not = 1; /* prepend a NOT op later */ |
4939 | } | |
79072805 LW |
4940 | } |
4941 | } | |
71c4dbc3 VP |
4942 | /* search for a constant op that could let us fold the test */ |
4943 | if ((cstop = search_const(first))) { | |
4944 | if (cstop->op_private & OPpCONST_STRICT) | |
4945 | no_bareword_allowed(cstop); | |
a2a5de95 NC |
4946 | else if ((cstop->op_private & OPpCONST_BARE)) |
4947 | Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional"); | |
71c4dbc3 VP |
4948 | if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) || |
4949 | (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) || | |
4950 | (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) { | |
5f66b61c | 4951 | *firstp = NULL; |
d6fee5c7 DM |
4952 | if (other->op_type == OP_CONST) |
4953 | other->op_private |= OPpCONST_SHORTCIRCUIT; | |
eb8433b7 NC |
4954 | if (PL_madskills) { |
4955 | OP *newop = newUNOP(OP_NULL, 0, other); | |
4956 | op_getmad(first, newop, '1'); | |
4957 | newop->op_targ = type; /* set "was" field */ | |
4958 | return newop; | |
4959 | } | |
4960 | op_free(first); | |
dd3e51dc VP |
4961 | if (other->op_type == OP_LEAVE) |
4962 | other = newUNOP(OP_NULL, OPf_SPECIAL, other); | |
2474a784 FC |
4963 | else if (other->op_type == OP_MATCH |
4964 | || other->op_type == OP_SUBST | |
4965 | || other->op_type == OP_TRANS) | |
4966 | /* Mark the op as being unbindable with =~ */ | |
4967 | other->op_flags |= OPf_SPECIAL; | |
79072805 LW |
4968 | return other; |
4969 | } | |
4970 | else { | |
7921d0f2 | 4971 | /* check for C<my $x if 0>, or C<my($x,$y) if 0> */ |
6867be6d | 4972 | const OP *o2 = other; |
7921d0f2 DM |
4973 | if ( ! (o2->op_type == OP_LIST |
4974 | && (( o2 = cUNOPx(o2)->op_first)) | |
4975 | && o2->op_type == OP_PUSHMARK | |
4976 | && (( o2 = o2->op_sibling)) ) | |
4977 | ) | |
4978 | o2 = other; | |
4979 | if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV | |
4980 | || o2->op_type == OP_PADHV) | |
4981 | && o2->op_private & OPpLVAL_INTRO | |
a2a5de95 | 4982 | && !(o2->op_private & OPpPAD_STATE)) |
7921d0f2 | 4983 | { |
d1d15184 NC |
4984 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
4985 | "Deprecated use of my() in false conditional"); | |
7921d0f2 DM |
4986 | } |
4987 | ||
5f66b61c | 4988 | *otherp = NULL; |
d6fee5c7 DM |
4989 | if (first->op_type == OP_CONST) |
4990 | first->op_private |= OPpCONST_SHORTCIRCUIT; | |
eb8433b7 NC |
4991 | if (PL_madskills) { |
4992 | first = newUNOP(OP_NULL, 0, first); | |
4993 | op_getmad(other, first, '2'); | |
4994 | first->op_targ = type; /* set "was" field */ | |
4995 | } | |
4996 | else | |
4997 | op_free(other); | |
79072805 LW |
4998 | return first; |
4999 | } | |
5000 | } | |
041457d9 DM |
5001 | else if ((first->op_flags & OPf_KIDS) && type != OP_DOR |
5002 | && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */ | |
59e10468 | 5003 | { |
b22e6366 AL |
5004 | const OP * const k1 = ((UNOP*)first)->op_first; |
5005 | const OP * const k2 = k1->op_sibling; | |
a6006777 | 5006 | OPCODE warnop = 0; |
5007 | switch (first->op_type) | |
5008 | { | |
5009 | case OP_NULL: | |
5010 | if (k2 && k2->op_type == OP_READLINE | |
5011 | && (k2->op_flags & OPf_STACKED) | |
1c846c1f | 5012 | && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR)) |
72b16652 | 5013 | { |
a6006777 | 5014 | warnop = k2->op_type; |
72b16652 | 5015 | } |
a6006777 | 5016 | break; |
5017 | ||
5018 | case OP_SASSIGN: | |
68dc0745 | 5019 | if (k1->op_type == OP_READDIR |
5020 | || k1->op_type == OP_GLOB | |
72b16652 | 5021 | || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB) |
68dc0745 | 5022 | || k1->op_type == OP_EACH) |
72b16652 GS |
5023 | { |
5024 | warnop = ((k1->op_type == OP_NULL) | |
eb160463 | 5025 | ? (OPCODE)k1->op_targ : k1->op_type); |
72b16652 | 5026 | } |
a6006777 | 5027 | break; |
5028 | } | |
8ebc5c01 | 5029 | if (warnop) { |
6867be6d | 5030 | const line_t oldline = CopLINE(PL_curcop); |
53a7735b | 5031 | CopLINE_set(PL_curcop, PL_parser->copline); |
9014280d | 5032 | Perl_warner(aTHX_ packWARN(WARN_MISC), |
599cee73 | 5033 | "Value of %s%s can be \"0\"; test with defined()", |
22c35a8c | 5034 | PL_op_desc[warnop], |
68dc0745 | 5035 | ((warnop == OP_READLINE || warnop == OP_GLOB) |
5036 | ? " construct" : "() operator")); | |
57843af0 | 5037 | CopLINE_set(PL_curcop, oldline); |
8ebc5c01 | 5038 | } |
a6006777 | 5039 | } |
79072805 LW |
5040 | |
5041 | if (!other) | |
5042 | return first; | |
5043 | ||
c963b151 | 5044 | if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN) |
a0d0e21e LW |
5045 | other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */ |
5046 | ||
b7dc083c | 5047 | NewOp(1101, logop, 1, LOGOP); |
79072805 | 5048 | |
eb160463 | 5049 | logop->op_type = (OPCODE)type; |
22c35a8c | 5050 | logop->op_ppaddr = PL_ppaddr[type]; |
79072805 | 5051 | logop->op_first = first; |
585ec06d | 5052 | logop->op_flags = (U8)(flags | OPf_KIDS); |
79072805 | 5053 | logop->op_other = LINKLIST(other); |
eb160463 | 5054 | logop->op_private = (U8)(1 | (flags >> 8)); |
79072805 LW |
5055 | |
5056 | /* establish postfix order */ | |
5057 | logop->op_next = LINKLIST(first); | |
5058 | first->op_next = (OP*)logop; | |
5059 | first->op_sibling = other; | |
5060 | ||
463d09e6 RGS |
5061 | CHECKOP(type,logop); |
5062 | ||
edbe35ea | 5063 | o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop); |
11343788 | 5064 | other->op_next = o; |
79072805 | 5065 | |
11343788 | 5066 | return o; |
79072805 LW |
5067 | } |
5068 | ||
d67eb5f4 Z |
5069 | /* |
5070 | =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop | |
5071 | ||
5072 | Constructs, checks, and returns a conditional-expression (C<cond_expr>) | |
5073 | op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS> | |
5074 | will be set automatically, and, shifted up eight bits, the eight bits of | |
5075 | C<op_private>, except that the bit with value 1 is automatically set. | |
5076 | I<first> supplies the expression selecting between the two branches, | |
5077 | and I<trueop> and I<falseop> supply the branches; they are consumed by | |
5078 | this function and become part of the constructed op tree. | |
5079 | ||
5080 | =cut | |
5081 | */ | |
5082 | ||
79072805 | 5083 | OP * |
864dbfa3 | 5084 | Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop) |
79072805 | 5085 | { |
27da23d5 | 5086 | dVAR; |
1a67a97c SM |
5087 | LOGOP *logop; |
5088 | OP *start; | |
11343788 | 5089 | OP *o; |
71c4dbc3 | 5090 | OP *cstop; |
79072805 | 5091 | |
7918f24d NC |
5092 | PERL_ARGS_ASSERT_NEWCONDOP; |
5093 | ||
b1cb66bf | 5094 | if (!falseop) |
5095 | return newLOGOP(OP_AND, 0, first, trueop); | |
5096 | if (!trueop) | |
5097 | return newLOGOP(OP_OR, 0, first, falseop); | |
79072805 | 5098 | |
8990e307 | 5099 | scalarboolean(first); |
71c4dbc3 | 5100 | if ((cstop = search_const(first))) { |
5b6782b2 | 5101 | /* Left or right arm of the conditional? */ |
71c4dbc3 | 5102 | const bool left = SvTRUE(((SVOP*)cstop)->op_sv); |
5b6782b2 NC |
5103 | OP *live = left ? trueop : falseop; |
5104 | OP *const dead = left ? falseop : trueop; | |
71c4dbc3 VP |
5105 | if (cstop->op_private & OPpCONST_BARE && |
5106 | cstop->op_private & OPpCONST_STRICT) { | |
5107 | no_bareword_allowed(cstop); | |
b22e6366 | 5108 | } |
5b6782b2 NC |
5109 | if (PL_madskills) { |
5110 | /* This is all dead code when PERL_MAD is not defined. */ | |
5111 | live = newUNOP(OP_NULL, 0, live); | |
5112 | op_getmad(first, live, 'C'); | |
5113 | op_getmad(dead, live, left ? 'e' : 't'); | |
5114 | } else { | |
5115 | op_free(first); | |
5116 | op_free(dead); | |
79072805 | 5117 | } |
ef9da979 FC |
5118 | if (live->op_type == OP_LEAVE) |
5119 | live = newUNOP(OP_NULL, OPf_SPECIAL, live); | |
2474a784 FC |
5120 | else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST |
5121 | || live->op_type == OP_TRANS) | |
5122 | /* Mark the op as being unbindable with =~ */ | |
5123 | live->op_flags |= OPf_SPECIAL; | |
5b6782b2 | 5124 | return live; |
79072805 | 5125 | } |
1a67a97c SM |
5126 | NewOp(1101, logop, 1, LOGOP); |
5127 | logop->op_type = OP_COND_EXPR; | |
5128 | logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR]; | |
5129 | logop->op_first = first; | |
585ec06d | 5130 | logop->op_flags = (U8)(flags | OPf_KIDS); |
eb160463 | 5131 | logop->op_private = (U8)(1 | (flags >> 8)); |
1a67a97c SM |
5132 | logop->op_other = LINKLIST(trueop); |
5133 | logop->op_next = LINKLIST(falseop); | |
79072805 | 5134 | |
463d09e6 RGS |
5135 | CHECKOP(OP_COND_EXPR, /* that's logop->op_type */ |
5136 | logop); | |
79072805 LW |
5137 | |
5138 | /* establish postfix order */ | |
1a67a97c SM |
5139 | start = LINKLIST(first); |
5140 | first->op_next = (OP*)logop; | |
79072805 | 5141 | |
b1cb66bf | 5142 | first->op_sibling = trueop; |
5143 | trueop->op_sibling = falseop; | |
1a67a97c | 5144 | o = newUNOP(OP_NULL, 0, (OP*)logop); |
79072805 | 5145 | |
1a67a97c | 5146 | trueop->op_next = falseop->op_next = o; |
79072805 | 5147 | |
1a67a97c | 5148 | o->op_next = start; |
11343788 | 5149 | return o; |
79072805 LW |
5150 | } |
5151 | ||
d67eb5f4 Z |
5152 | /* |
5153 | =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right | |
5154 | ||
5155 | Constructs and returns a C<range> op, with subordinate C<flip> and | |
5156 | C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the | |
5157 | C<flip> op and, shifted up eight bits, the eight bits of C<op_private> | |
5158 | for both the C<flip> and C<range> ops, except that the bit with value | |
5159 | 1 is automatically set. I<left> and I<right> supply the expressions | |
5160 | controlling the endpoints of the range; they are consumed by this function | |
5161 | and become part of the constructed op tree. | |
5162 | ||
5163 | =cut | |
5164 | */ | |
5165 | ||
79072805 | 5166 | OP * |
864dbfa3 | 5167 | Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right) |
79072805 | 5168 | { |
27da23d5 | 5169 | dVAR; |
1a67a97c | 5170 | LOGOP *range; |
79072805 LW |
5171 | OP *flip; |
5172 | OP *flop; | |
1a67a97c | 5173 | OP *leftstart; |
11343788 | 5174 | OP *o; |
79072805 | 5175 | |
7918f24d NC |
5176 | PERL_ARGS_ASSERT_NEWRANGE; |
5177 | ||
1a67a97c | 5178 | NewOp(1101, range, 1, LOGOP); |
79072805 | 5179 | |
1a67a97c SM |
5180 | range->op_type = OP_RANGE; |
5181 | range->op_ppaddr = PL_ppaddr[OP_RANGE]; | |
5182 | range->op_first = left; | |
5183 | range->op_flags = OPf_KIDS; | |
5184 | leftstart = LINKLIST(left); | |
5185 | range->op_other = LINKLIST(right); | |
eb160463 | 5186 | range->op_private = (U8)(1 | (flags >> 8)); |
79072805 LW |
5187 | |
5188 | left->op_sibling = right; | |
5189 | ||
1a67a97c SM |
5190 | range->op_next = (OP*)range; |
5191 | flip = newUNOP(OP_FLIP, flags, (OP*)range); | |
79072805 | 5192 | flop = newUNOP(OP_FLOP, 0, flip); |
11343788 | 5193 | o = newUNOP(OP_NULL, 0, flop); |
5983a79d | 5194 | LINKLIST(flop); |
1a67a97c | 5195 | range->op_next = leftstart; |
79072805 LW |
5196 | |
5197 | left->op_next = flip; | |
5198 | right->op_next = flop; | |
5199 | ||
1a67a97c SM |
5200 | range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY); |
5201 | sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV); | |
ed6116ce | 5202 | flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY); |
79072805 LW |
5203 | sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV); |
5204 | ||
5205 | flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0; | |
5206 | flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0; | |
5207 | ||
11343788 | 5208 | flip->op_next = o; |
79072805 | 5209 | if (!flip->op_private || !flop->op_private) |
5983a79d | 5210 | LINKLIST(o); /* blow off optimizer unless constant */ |
79072805 | 5211 | |
11343788 | 5212 | return o; |
79072805 LW |
5213 | } |
5214 | ||
d67eb5f4 Z |
5215 | /* |
5216 | =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block | |
5217 | ||
5218 | Constructs, checks, and returns an op tree expressing a loop. This is | |
5219 | only a loop in the control flow through the op tree; it does not have | |
5220 | the heavyweight loop structure that allows exiting the loop by C<last> | |
5221 | and suchlike. I<flags> gives the eight bits of C<op_flags> for the | |
5222 | top-level op, except that some bits will be set automatically as required. | |
5223 | I<expr> supplies the expression controlling loop iteration, and I<block> | |
5224 | supplies the body of the loop; they are consumed by this function and | |
5225 | become part of the constructed op tree. I<debuggable> is currently | |
5226 | unused and should always be 1. | |
5227 | ||
5228 | =cut | |
5229 | */ | |
5230 | ||
79072805 | 5231 | OP * |
864dbfa3 | 5232 | Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block) |
79072805 | 5233 | { |
97aff369 | 5234 | dVAR; |
463ee0b2 | 5235 | OP* listop; |
11343788 | 5236 | OP* o; |
73d840c0 | 5237 | const bool once = block && block->op_flags & OPf_SPECIAL && |
a0d0e21e | 5238 | (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL); |
46c461b5 AL |
5239 | |
5240 | PERL_UNUSED_ARG(debuggable); | |
93a17b20 | 5241 | |
463ee0b2 LW |
5242 | if (expr) { |
5243 | if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv)) | |
5244 | return block; /* do {} while 0 does once */ | |
114c60ec BG |
5245 | if (expr->op_type == OP_READLINE |
5246 | || expr->op_type == OP_READDIR | |
5247 | || expr->op_type == OP_GLOB | |
fb73857a | 5248 | || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) { |
774d564b | 5249 | expr = newUNOP(OP_DEFINED, 0, |
54b9620d | 5250 | newASSIGNOP(0, newDEFSVOP(), 0, expr) ); |
55d729e4 | 5251 | } else if (expr->op_flags & OPf_KIDS) { |
46c461b5 AL |
5252 | const OP * const k1 = ((UNOP*)expr)->op_first; |
5253 | const OP * const k2 = k1 ? k1->op_sibling : NULL; | |
55d729e4 | 5254 | switch (expr->op_type) { |
1c846c1f | 5255 | case OP_NULL: |
114c60ec | 5256 | if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR) |
55d729e4 | 5257 | && (k2->op_flags & OPf_STACKED) |
1c846c1f | 5258 | && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR)) |
55d729e4 | 5259 | expr = newUNOP(OP_DEFINED, 0, expr); |
1c846c1f | 5260 | break; |
55d729e4 GS |
5261 | |
5262 | case OP_SASSIGN: | |
06dc7ac6 | 5263 | if (k1 && (k1->op_type == OP_READDIR |
55d729e4 | 5264 | || k1->op_type == OP_GLOB |
6531c3e6 | 5265 | || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB) |
06dc7ac6 | 5266 | || k1->op_type == OP_EACH)) |
55d729e4 GS |
5267 | expr = newUNOP(OP_DEFINED, 0, expr); |
5268 | break; | |
5269 | } | |
774d564b | 5270 | } |
463ee0b2 | 5271 | } |
93a17b20 | 5272 | |
2fcb4757 | 5273 | /* if block is null, the next op_append_elem() would put UNSTACK, a scalar |
e1548254 RGS |
5274 | * op, in listop. This is wrong. [perl #27024] */ |
5275 | if (!block) | |
5276 | block = newOP(OP_NULL, 0); | |
2fcb4757 | 5277 | listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0)); |
883ffac3 | 5278 | o = new_logop(OP_AND, 0, &expr, &listop); |
463ee0b2 | 5279 | |
883ffac3 CS |
5280 | if (listop) |
5281 | ((LISTOP*)listop)->op_last->op_next = LINKLIST(o); | |
79072805 | 5282 | |
11343788 MB |
5283 | if (once && o != listop) |
5284 | o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other; | |
79072805 | 5285 | |
11343788 MB |
5286 | if (o == listop) |
5287 | o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */ | |
748a9306 | 5288 | |
11343788 MB |
5289 | o->op_flags |= flags; |
5290 | o = scope(o); | |
5291 | o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/ | |
5292 | return o; | |
79072805 LW |
5293 | } |
5294 | ||
d67eb5f4 Z |
5295 | /* |
5296 | =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|I32 whileline|OP *expr|OP *block|OP *cont|I32 has_my | |
5297 | ||
5298 | Constructs, checks, and returns an op tree expressing a C<while> loop. | |
5299 | This is a heavyweight loop, with structure that allows exiting the loop | |
5300 | by C<last> and suchlike. | |
5301 | ||
5302 | I<loop> is an optional preconstructed C<enterloop> op to use in the | |
5303 | loop; if it is null then a suitable op will be constructed automatically. | |
5304 | I<expr> supplies the loop's controlling expression. I<block> supplies the | |
5305 | main body of the loop, and I<cont> optionally supplies a C<continue> block | |
5306 | that operates as a second half of the body. All of these optree inputs | |
5307 | are consumed by this function and become part of the constructed op tree. | |
5308 | ||
5309 | I<flags> gives the eight bits of C<op_flags> for the C<leaveloop> | |
5310 | op and, shifted up eight bits, the eight bits of C<op_private> for | |
5311 | the C<leaveloop> op, except that (in both cases) some bits will be set | |
5312 | automatically. I<debuggable> is currently unused and should always be 1. | |
5313 | I<whileline> is the line number that should be attributed to the loop's | |
5314 | controlling expression. I<has_my> can be supplied as true to force the | |
5315 | loop body to be enclosed in its own scope. | |
5316 | ||
5317 | =cut | |
5318 | */ | |
5319 | ||
79072805 | 5320 | OP * |
a034e688 DM |
5321 | Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32 |
5322 | whileline, OP *expr, OP *block, OP *cont, I32 has_my) | |
79072805 | 5323 | { |
27da23d5 | 5324 | dVAR; |
79072805 | 5325 | OP *redo; |
c445ea15 | 5326 | OP *next = NULL; |
79072805 | 5327 | OP *listop; |
11343788 | 5328 | OP *o; |
1ba6ee2b | 5329 | U8 loopflags = 0; |
46c461b5 AL |
5330 | |
5331 | PERL_UNUSED_ARG(debuggable); | |
79072805 | 5332 | |
2d03de9c | 5333 | if (expr) { |
114c60ec BG |
5334 | if (expr->op_type == OP_READLINE |
5335 | || expr->op_type == OP_READDIR | |
5336 | || expr->op_type == OP_GLOB | |
2d03de9c AL |
5337 | || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) { |
5338 | expr = newUNOP(OP_DEFINED, 0, | |
5339 | newASSIGNOP(0, newDEFSVOP(), 0, expr) ); | |
5340 | } else if (expr->op_flags & OPf_KIDS) { | |
5341 | const OP * const k1 = ((UNOP*)expr)->op_first; | |
5342 | const OP * const k2 = (k1) ? k1->op_sibling : NULL; | |
5343 | switch (expr->op_type) { | |
5344 | case OP_NULL: | |
114c60ec | 5345 | if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR) |
2d03de9c AL |
5346 | && (k2->op_flags & OPf_STACKED) |
5347 | && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR)) | |
5348 | expr = newUNOP(OP_DEFINED, 0, expr); | |
5349 | break; | |
55d729e4 | 5350 | |
2d03de9c | 5351 | case OP_SASSIGN: |
72c8de1a | 5352 | if (k1 && (k1->op_type == OP_READDIR |
2d03de9c AL |
5353 | || k1->op_type == OP_GLOB |
5354 | || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB) | |
72c8de1a | 5355 | || k1->op_type == OP_EACH)) |
2d03de9c AL |
5356 | expr = newUNOP(OP_DEFINED, 0, expr); |
5357 | break; | |
5358 | } | |
55d729e4 | 5359 | } |
748a9306 | 5360 | } |
79072805 LW |
5361 | |
5362 | if (!block) | |
5363 | block = newOP(OP_NULL, 0); | |
a034e688 | 5364 | else if (cont || has_my) { |
87246558 GS |
5365 | block = scope(block); |
5366 | } | |
79072805 | 5367 | |
1ba6ee2b | 5368 | if (cont) { |
79072805 | 5369 | next = LINKLIST(cont); |
1ba6ee2b | 5370 | } |
fb73857a | 5371 | if (expr) { |
551405c4 | 5372 | OP * const unstack = newOP(OP_UNSTACK, 0); |
85538317 GS |
5373 | if (!next) |
5374 | next = unstack; | |
2fcb4757 | 5375 | cont = op_append_elem(OP_LINESEQ, cont, unstack); |
fb73857a | 5376 | } |
79072805 | 5377 | |
ce3e5c45 | 5378 | assert(block); |
2fcb4757 | 5379 | listop = op_append_list(OP_LINESEQ, block, cont); |
ce3e5c45 | 5380 | assert(listop); |
79072805 LW |
5381 | redo = LINKLIST(listop); |
5382 | ||
5383 | if (expr) { | |
53a7735b | 5384 | PL_parser->copline = (line_t)whileline; |
883ffac3 CS |
5385 | scalar(listop); |
5386 | o = new_logop(OP_AND, 0, &expr, &listop); | |
11343788 | 5387 | if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) { |
85e6fe83 | 5388 | op_free(expr); /* oops, it's a while (0) */ |
463ee0b2 | 5389 | op_free((OP*)loop); |
5f66b61c | 5390 | return NULL; /* listop already freed by new_logop */ |
463ee0b2 | 5391 | } |
883ffac3 | 5392 | if (listop) |
497b47a8 | 5393 | ((LISTOP*)listop)->op_last->op_next = |
883ffac3 | 5394 | (o == listop ? redo : LINKLIST(o)); |
79072805 LW |
5395 | } |
5396 | else | |
11343788 | 5397 | o = listop; |
79072805 LW |
5398 | |
5399 | if (!loop) { | |
b7dc083c | 5400 | NewOp(1101,loop,1,LOOP); |
79072805 | 5401 | loop->op_type = OP_ENTERLOOP; |
22c35a8c | 5402 | loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP]; |
79072805 LW |
5403 | loop->op_private = 0; |
5404 | loop->op_next = (OP*)loop; | |
5405 | } | |
5406 | ||
11343788 | 5407 | o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o); |
79072805 LW |
5408 | |
5409 | loop->op_redoop = redo; | |
11343788 | 5410 | loop->op_lastop = o; |
1ba6ee2b | 5411 | o->op_private |= loopflags; |
79072805 LW |
5412 | |
5413 | if (next) | |
5414 | loop->op_nextop = next; | |
5415 | else | |
11343788 | 5416 | loop->op_nextop = o; |
79072805 | 5417 | |
11343788 MB |
5418 | o->op_flags |= flags; |
5419 | o->op_private |= (flags >> 8); | |
5420 | return o; | |
79072805 LW |
5421 | } |
5422 | ||
d67eb5f4 Z |
5423 | /* |
5424 | =for apidoc Am|OP *|newFOROP|I32 flags|char *label|line_t forline|OP *sv|OP *expr|OP *block|OP *cont | |
5425 | ||
5426 | Constructs, checks, and returns an op tree expressing a C<foreach> | |
5427 | loop (iteration through a list of values). This is a heavyweight loop, | |
5428 | with structure that allows exiting the loop by C<last> and suchlike. | |
5429 | ||
5430 | I<sv> optionally supplies the variable that will be aliased to each | |
5431 | item in turn; if null, it defaults to C<$_> (either lexical or global). | |
5432 | I<expr> supplies the list of values to iterate over. I<block> supplies | |
5433 | the main body of the loop, and I<cont> optionally supplies a C<continue> | |
5434 | block that operates as a second half of the body. All of these optree | |
5435 | inputs are consumed by this function and become part of the constructed | |
5436 | op tree. | |
5437 | ||
5438 | I<flags> gives the eight bits of C<op_flags> for the C<leaveloop> | |
5439 | op and, shifted up eight bits, the eight bits of C<op_private> for | |
5440 | the C<leaveloop> op, except that (in both cases) some bits will be set | |
5441 | automatically. I<forline> is the line number that should be attributed | |
5442 | to the loop's list expression. If I<label> is non-null, it supplies | |
5443 | the name of a label to attach to the state op at the start of the loop; | |
5444 | this function takes ownership of the memory pointed at by I<label>, | |
5445 | and will free it. | |
5446 | ||
5447 | =cut | |
5448 | */ | |
5449 | ||
79072805 | 5450 | OP * |
66a1b24b | 5451 | Perl_newFOROP(pTHX_ I32 flags, char *label, line_t forline, OP *sv, OP *expr, OP *block, OP *cont) |
79072805 | 5452 | { |
27da23d5 | 5453 | dVAR; |
79072805 | 5454 | LOOP *loop; |
fb73857a | 5455 | OP *wop; |
4bbc6d12 | 5456 | PADOFFSET padoff = 0; |
4633a7c4 | 5457 | I32 iterflags = 0; |
241416b8 | 5458 | I32 iterpflags = 0; |
d4c19fe8 | 5459 | OP *madsv = NULL; |
79072805 | 5460 | |
7918f24d NC |
5461 | PERL_ARGS_ASSERT_NEWFOROP; |
5462 | ||
79072805 | 5463 | if (sv) { |
85e6fe83 | 5464 | if (sv->op_type == OP_RV2SV) { /* symbol table variable */ |
241416b8 | 5465 | iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */ |
748a9306 | 5466 | sv->op_type = OP_RV2GV; |
22c35a8c | 5467 | sv->op_ppaddr = PL_ppaddr[OP_RV2GV]; |
0be9a6bb RH |
5468 | |
5469 | /* The op_type check is needed to prevent a possible segfault | |
5470 | * if the loop variable is undeclared and 'strict vars' is in | |
5471 | * effect. This is illegal but is nonetheless parsed, so we | |
5472 | * may reach this point with an OP_CONST where we're expecting | |
5473 | * an OP_GV. | |
5474 | */ | |
5475 | if (cUNOPx(sv)->op_first->op_type == OP_GV | |
5476 | && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv) | |
0d863452 | 5477 | iterpflags |= OPpITER_DEF; |
79072805 | 5478 | } |
85e6fe83 | 5479 | else if (sv->op_type == OP_PADSV) { /* private variable */ |
241416b8 | 5480 | iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */ |
85e6fe83 | 5481 | padoff = sv->op_targ; |
eb8433b7 NC |
5482 | if (PL_madskills) |
5483 | madsv = sv; | |
5484 | else { | |
5485 | sv->op_targ = 0; | |
5486 | op_free(sv); | |
5487 | } | |
5f66b61c | 5488 | sv = NULL; |
85e6fe83 | 5489 | } |
79072805 | 5490 | else |
cea2e8a9 | 5491 | Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]); |
f8503592 NC |
5492 | if (padoff) { |
5493 | SV *const namesv = PAD_COMPNAME_SV(padoff); | |
5494 | STRLEN len; | |
5495 | const char *const name = SvPV_const(namesv, len); | |
5496 | ||
5497 | if (len == 2 && name[0] == '$' && name[1] == '_') | |
5498 | iterpflags |= OPpITER_DEF; | |
5499 | } | |
79072805 LW |
5500 | } |
5501 | else { | |
f8f98e0a | 5502 | const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0); |
00b1698f | 5503 | if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) { |
aabe9514 RGS |
5504 | sv = newGVOP(OP_GV, 0, PL_defgv); |
5505 | } | |
5506 | else { | |
5507 | padoff = offset; | |
aabe9514 | 5508 | } |
0d863452 | 5509 | iterpflags |= OPpITER_DEF; |
79072805 | 5510 | } |
5f05dabc | 5511 | if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) { |
89ea2908 | 5512 | expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART); |
4633a7c4 LW |
5513 | iterflags |= OPf_STACKED; |
5514 | } | |
89ea2908 GA |
5515 | else if (expr->op_type == OP_NULL && |
5516 | (expr->op_flags & OPf_KIDS) && | |
5517 | ((BINOP*)expr)->op_first->op_type == OP_FLOP) | |
5518 | { | |
5519 | /* Basically turn for($x..$y) into the same as for($x,$y), but we | |
5520 | * set the STACKED flag to indicate that these values are to be | |
5521 | * treated as min/max values by 'pp_iterinit'. | |
5522 | */ | |
d4c19fe8 | 5523 | const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first; |
551405c4 | 5524 | LOGOP* const range = (LOGOP*) flip->op_first; |
66a1b24b AL |
5525 | OP* const left = range->op_first; |
5526 | OP* const right = left->op_sibling; | |
5152d7c7 | 5527 | LISTOP* listop; |
89ea2908 GA |
5528 | |
5529 | range->op_flags &= ~OPf_KIDS; | |
5f66b61c | 5530 | range->op_first = NULL; |
89ea2908 | 5531 | |
5152d7c7 | 5532 | listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right); |
1a67a97c SM |
5533 | listop->op_first->op_next = range->op_next; |
5534 | left->op_next = range->op_other; | |
5152d7c7 GS |
5535 | right->op_next = (OP*)listop; |
5536 | listop->op_next = listop->op_first; | |
89ea2908 | 5537 | |
eb8433b7 NC |
5538 | #ifdef PERL_MAD |
5539 | op_getmad(expr,(OP*)listop,'O'); | |
5540 | #else | |
89ea2908 | 5541 | op_free(expr); |
eb8433b7 | 5542 | #endif |
5152d7c7 | 5543 | expr = (OP*)(listop); |
93c66552 | 5544 | op_null(expr); |
89ea2908 GA |
5545 | iterflags |= OPf_STACKED; |
5546 | } | |
5547 | else { | |
5548 | expr = mod(force_list(expr), OP_GREPSTART); | |
5549 | } | |
5550 | ||
4633a7c4 | 5551 | loop = (LOOP*)list(convert(OP_ENTERITER, iterflags, |
2fcb4757 | 5552 | op_append_elem(OP_LIST, expr, scalar(sv)))); |
85e6fe83 | 5553 | assert(!loop->op_next); |
241416b8 | 5554 | /* for my $x () sets OPpLVAL_INTRO; |
14f338dc | 5555 | * for our $x () sets OPpOUR_INTRO */ |
c5661c80 | 5556 | loop->op_private = (U8)iterpflags; |
b7dc083c | 5557 | #ifdef PL_OP_SLAB_ALLOC |
155aba94 GS |
5558 | { |
5559 | LOOP *tmp; | |
5560 | NewOp(1234,tmp,1,LOOP); | |
bd5f3bc4 | 5561 | Copy(loop,tmp,1,LISTOP); |
bfafaa29 | 5562 | S_op_destroy(aTHX_ (OP*)loop); |
155aba94 GS |
5563 | loop = tmp; |
5564 | } | |
b7dc083c | 5565 | #else |
10edeb5d | 5566 | loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP)); |
1c846c1f | 5567 | #endif |
85e6fe83 | 5568 | loop->op_targ = padoff; |
a034e688 | 5569 | wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont, 0); |
eb8433b7 NC |
5570 | if (madsv) |
5571 | op_getmad(madsv, (OP*)loop, 'v'); | |
53a7735b | 5572 | PL_parser->copline = forline; |
fb73857a | 5573 | return newSTATEOP(0, label, wop); |
79072805 LW |
5574 | } |
5575 | ||
d67eb5f4 Z |
5576 | /* |
5577 | =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label | |
5578 | ||
5579 | Constructs, checks, and returns a loop-exiting op (such as C<goto> | |
5580 | or C<last>). I<type> is the opcode. I<label> supplies the parameter | |
5581 | determining the target of the op; it is consumed by this function and | |
5582 | become part of the constructed op tree. | |
5583 | ||
5584 | =cut | |
5585 | */ | |
5586 | ||
8990e307 | 5587 | OP* |
864dbfa3 | 5588 | Perl_newLOOPEX(pTHX_ I32 type, OP *label) |
8990e307 | 5589 | { |
97aff369 | 5590 | dVAR; |
11343788 | 5591 | OP *o; |
2d8e6c8d | 5592 | |
7918f24d NC |
5593 | PERL_ARGS_ASSERT_NEWLOOPEX; |
5594 | ||
e69777c1 GG |
5595 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP); |
5596 | ||
8990e307 | 5597 | if (type != OP_GOTO || label->op_type == OP_CONST) { |
cdaebead MB |
5598 | /* "last()" means "last" */ |
5599 | if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS)) | |
5600 | o = newOP(type, OPf_SPECIAL); | |
5601 | else { | |
ea71c68d | 5602 | o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST |
4ea561bc | 5603 | ? SvPV_nolen_const(((SVOP*)label)->op_sv) |
666ea192 | 5604 | : "")); |
cdaebead | 5605 | } |
eb8433b7 NC |
5606 | #ifdef PERL_MAD |
5607 | op_getmad(label,o,'L'); | |
5608 | #else | |
8990e307 | 5609 | op_free(label); |
eb8433b7 | 5610 | #endif |
8990e307 LW |
5611 | } |
5612 | else { | |
e3aba57a RGS |
5613 | /* Check whether it's going to be a goto &function */ |
5614 | if (label->op_type == OP_ENTERSUB | |
5615 | && !(label->op_flags & OPf_STACKED)) | |
a0d0e21e | 5616 | label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN)); |
11343788 | 5617 | o = newUNOP(type, OPf_STACKED, label); |
8990e307 | 5618 | } |
3280af22 | 5619 | PL_hints |= HINT_BLOCK_SCOPE; |
11343788 | 5620 | return o; |
8990e307 LW |
5621 | } |
5622 | ||
0d863452 RH |
5623 | /* if the condition is a literal array or hash |
5624 | (or @{ ... } etc), make a reference to it. | |
5625 | */ | |
5626 | STATIC OP * | |
5627 | S_ref_array_or_hash(pTHX_ OP *cond) | |
5628 | { | |
5629 | if (cond | |
5630 | && (cond->op_type == OP_RV2AV | |
5631 | || cond->op_type == OP_PADAV | |
5632 | || cond->op_type == OP_RV2HV | |
5633 | || cond->op_type == OP_PADHV)) | |
5634 | ||
5635 | return newUNOP(OP_REFGEN, | |
5636 | 0, mod(cond, OP_REFGEN)); | |
5637 | ||
329a333e DL |
5638 | else if(cond |
5639 | && (cond->op_type == OP_ASLICE | |
5640 | || cond->op_type == OP_HSLICE)) { | |
5641 | ||
5642 | /* anonlist now needs a list from this op, was previously used in | |
5643 | * scalar context */ | |
5644 | cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF); | |
5645 | cond->op_flags |= OPf_WANT_LIST; | |
5646 | ||
5647 | return newANONLIST(mod(cond, OP_ANONLIST)); | |
5648 | } | |
5649 | ||
0d863452 RH |
5650 | else |
5651 | return cond; | |
5652 | } | |
5653 | ||
5654 | /* These construct the optree fragments representing given() | |
5655 | and when() blocks. | |
5656 | ||
5657 | entergiven and enterwhen are LOGOPs; the op_other pointer | |
5658 | points up to the associated leave op. We need this so we | |
5659 | can put it in the context and make break/continue work. | |
5660 | (Also, of course, pp_enterwhen will jump straight to | |
5661 | op_other if the match fails.) | |
5662 | */ | |
5663 | ||
4136a0f7 | 5664 | STATIC OP * |
0d863452 RH |
5665 | S_newGIVWHENOP(pTHX_ OP *cond, OP *block, |
5666 | I32 enter_opcode, I32 leave_opcode, | |
5667 | PADOFFSET entertarg) | |
5668 | { | |
97aff369 | 5669 | dVAR; |
0d863452 RH |
5670 | LOGOP *enterop; |
5671 | OP *o; | |
5672 | ||
7918f24d NC |
5673 | PERL_ARGS_ASSERT_NEWGIVWHENOP; |
5674 | ||
0d863452 | 5675 | NewOp(1101, enterop, 1, LOGOP); |
61a59f30 | 5676 | enterop->op_type = (Optype)enter_opcode; |
0d863452 RH |
5677 | enterop->op_ppaddr = PL_ppaddr[enter_opcode]; |
5678 | enterop->op_flags = (U8) OPf_KIDS; | |
5679 | enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg); | |
5680 | enterop->op_private = 0; | |
5681 | ||
5682 | o = newUNOP(leave_opcode, 0, (OP *) enterop); | |
5683 | ||
5684 | if (cond) { | |
5685 | enterop->op_first = scalar(cond); | |
5686 | cond->op_sibling = block; | |
5687 | ||
5688 | o->op_next = LINKLIST(cond); | |
5689 | cond->op_next = (OP *) enterop; | |
5690 | } | |
5691 | else { | |
5692 | /* This is a default {} block */ | |
5693 | enterop->op_first = block; | |
5694 | enterop->op_flags |= OPf_SPECIAL; | |
5695 | ||
5696 | o->op_next = (OP *) enterop; | |
5697 | } | |
5698 | ||
5699 | CHECKOP(enter_opcode, enterop); /* Currently does nothing, since | |
5700 | entergiven and enterwhen both | |
5701 | use ck_null() */ | |
5702 | ||
5703 | enterop->op_next = LINKLIST(block); | |
5704 | block->op_next = enterop->op_other = o; | |
5705 | ||
5706 | return o; | |
5707 | } | |
5708 | ||
5709 | /* Does this look like a boolean operation? For these purposes | |
5710 | a boolean operation is: | |
5711 | - a subroutine call [*] | |
5712 | - a logical connective | |
5713 | - a comparison operator | |
5714 | - a filetest operator, with the exception of -s -M -A -C | |
5715 | - defined(), exists() or eof() | |
5716 | - /$re/ or $foo =~ /$re/ | |
5717 | ||
5718 | [*] possibly surprising | |
5719 | */ | |
4136a0f7 | 5720 | STATIC bool |
ef519e13 | 5721 | S_looks_like_bool(pTHX_ const OP *o) |
0d863452 | 5722 | { |
97aff369 | 5723 | dVAR; |
7918f24d NC |
5724 | |
5725 | PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL; | |
5726 | ||
0d863452 RH |
5727 | switch(o->op_type) { |
5728 | case OP_OR: | |
f92e1a16 | 5729 | case OP_DOR: |
0d863452 RH |
5730 | return looks_like_bool(cLOGOPo->op_first); |
5731 | ||
5732 | case OP_AND: | |
5733 | return ( | |
5734 | looks_like_bool(cLOGOPo->op_first) | |
5735 | && looks_like_bool(cLOGOPo->op_first->op_sibling)); | |
5736 | ||
1e1d4b91 | 5737 | case OP_NULL: |
08fe1c44 | 5738 | case OP_SCALAR: |
1e1d4b91 JJ |
5739 | return ( |
5740 | o->op_flags & OPf_KIDS | |
5741 | && looks_like_bool(cUNOPo->op_first)); | |
5742 | ||
0d863452 RH |
5743 | case OP_ENTERSUB: |
5744 | ||
5745 | case OP_NOT: case OP_XOR: | |
0d863452 RH |
5746 | |
5747 | case OP_EQ: case OP_NE: case OP_LT: | |
5748 | case OP_GT: case OP_LE: case OP_GE: | |
5749 | ||
5750 | case OP_I_EQ: case OP_I_NE: case OP_I_LT: | |
5751 | case OP_I_GT: case OP_I_LE: case OP_I_GE: | |
5752 | ||
5753 | case OP_SEQ: case OP_SNE: case OP_SLT: | |
5754 | case OP_SGT: case OP_SLE: case OP_SGE: | |
5755 | ||
5756 | case OP_SMARTMATCH: | |
5757 | ||
5758 | case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC: | |
5759 | case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC: | |
5760 | case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED: | |
5761 | case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR: | |
5762 | case OP_FTBLK: case OP_FTFILE: case OP_FTDIR: | |
5763 | case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID: | |
5764 | case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY: | |
5765 | case OP_FTTEXT: case OP_FTBINARY: | |
5766 | ||
5767 | case OP_DEFINED: case OP_EXISTS: | |
5768 | case OP_MATCH: case OP_EOF: | |
5769 | ||
f118ea0d RGS |
5770 | case OP_FLOP: |
5771 | ||
0d863452 RH |
5772 | return TRUE; |
5773 | ||
5774 | case OP_CONST: | |
5775 | /* Detect comparisons that have been optimized away */ | |
5776 | if (cSVOPo->op_sv == &PL_sv_yes | |
5777 | || cSVOPo->op_sv == &PL_sv_no) | |
5778 | ||
5779 | return TRUE; | |
6e03d743 RGS |
5780 | else |
5781 | return FALSE; | |
6e03d743 | 5782 | |
0d863452 RH |
5783 | /* FALL THROUGH */ |
5784 | default: | |
5785 | return FALSE; | |
5786 | } | |
5787 | } | |
5788 | ||
d67eb5f4 Z |
5789 | /* |
5790 | =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off | |
5791 | ||
5792 | Constructs, checks, and returns an op tree expressing a C<given> block. | |
5793 | I<cond> supplies the expression that will be locally assigned to a lexical | |
5794 | variable, and I<block> supplies the body of the C<given> construct; they | |
5795 | are consumed by this function and become part of the constructed op tree. | |
5796 | I<defsv_off> is the pad offset of the scalar lexical variable that will | |
5797 | be affected. | |
5798 | ||
5799 | =cut | |
5800 | */ | |
5801 | ||
0d863452 RH |
5802 | OP * |
5803 | Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off) | |
5804 | { | |
97aff369 | 5805 | dVAR; |
7918f24d | 5806 | PERL_ARGS_ASSERT_NEWGIVENOP; |
0d863452 RH |
5807 | return newGIVWHENOP( |
5808 | ref_array_or_hash(cond), | |
5809 | block, | |
5810 | OP_ENTERGIVEN, OP_LEAVEGIVEN, | |
5811 | defsv_off); | |
5812 | } | |
5813 | ||
d67eb5f4 Z |
5814 | /* |
5815 | =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block | |
5816 | ||
5817 | Constructs, checks, and returns an op tree expressing a C<when> block. | |
5818 | I<cond> supplies the test expression, and I<block> supplies the block | |
5819 | that will be executed if the test evaluates to true; they are consumed | |
5820 | by this function and become part of the constructed op tree. I<cond> | |
5821 | will be interpreted DWIMically, often as a comparison against C<$_>, | |
5822 | and may be null to generate a C<default> block. | |
5823 | ||
5824 | =cut | |
5825 | */ | |
5826 | ||
0d863452 RH |
5827 | OP * |
5828 | Perl_newWHENOP(pTHX_ OP *cond, OP *block) | |
5829 | { | |
ef519e13 | 5830 | const bool cond_llb = (!cond || looks_like_bool(cond)); |
0d863452 RH |
5831 | OP *cond_op; |
5832 | ||
7918f24d NC |
5833 | PERL_ARGS_ASSERT_NEWWHENOP; |
5834 | ||
0d863452 RH |
5835 | if (cond_llb) |
5836 | cond_op = cond; | |
5837 | else { | |
5838 | cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL, | |
5839 | newDEFSVOP(), | |
5840 | scalar(ref_array_or_hash(cond))); | |
5841 | } | |
5842 | ||
5843 | return newGIVWHENOP( | |
5844 | cond_op, | |
2fcb4757 | 5845 | op_append_elem(block->op_type, block, newOP(OP_BREAK, OPf_SPECIAL)), |
0d863452 RH |
5846 | OP_ENTERWHEN, OP_LEAVEWHEN, 0); |
5847 | } | |
5848 | ||
7dafbf52 | 5849 | /* |
d67eb5f4 Z |
5850 | =head1 Embedding Functions |
5851 | ||
7dafbf52 DM |
5852 | =for apidoc cv_undef |
5853 | ||
5854 | Clear out all the active components of a CV. This can happen either | |
5855 | by an explicit C<undef &foo>, or by the reference count going to zero. | |
5856 | In the former case, we keep the CvOUTSIDE pointer, so that any anonymous | |
5857 | children can still follow the full lexical scope chain. | |
5858 | ||
5859 | =cut | |
5860 | */ | |
5861 | ||
79072805 | 5862 | void |
864dbfa3 | 5863 | Perl_cv_undef(pTHX_ CV *cv) |
79072805 | 5864 | { |
27da23d5 | 5865 | dVAR; |
503de470 | 5866 | |
7918f24d NC |
5867 | PERL_ARGS_ASSERT_CV_UNDEF; |
5868 | ||
503de470 DM |
5869 | DEBUG_X(PerlIO_printf(Perl_debug_log, |
5870 | "CV undef: cv=0x%"UVxf" comppad=0x%"UVxf"\n", | |
5871 | PTR2UV(cv), PTR2UV(PL_comppad)) | |
5872 | ); | |
5873 | ||
a636914a | 5874 | #ifdef USE_ITHREADS |
aed2304a | 5875 | if (CvFILE(cv) && !CvISXSUB(cv)) { |
35f1c1c7 | 5876 | /* for XSUBs CvFILE point directly to static memory; __FILE__ */ |
a636914a | 5877 | Safefree(CvFILE(cv)); |
a636914a | 5878 | } |
b3123a61 | 5879 | CvFILE(cv) = NULL; |
a636914a RH |
5880 | #endif |
5881 | ||
aed2304a | 5882 | if (!CvISXSUB(cv) && CvROOT(cv)) { |
bb172083 | 5883 | if (SvTYPE(cv) == SVt_PVCV && CvDEPTH(cv)) |
cea2e8a9 | 5884 | Perl_croak(aTHX_ "Can't undef active subroutine"); |
8990e307 | 5885 | ENTER; |
a0d0e21e | 5886 | |
f3548bdc | 5887 | PAD_SAVE_SETNULLPAD(); |
a0d0e21e | 5888 | |
282f25c9 | 5889 | op_free(CvROOT(cv)); |
5f66b61c AL |
5890 | CvROOT(cv) = NULL; |
5891 | CvSTART(cv) = NULL; | |
8990e307 | 5892 | LEAVE; |
79072805 | 5893 | } |
ad64d0ec | 5894 | SvPOK_off(MUTABLE_SV(cv)); /* forget prototype */ |
b3f91e91 | 5895 | CvGV_set(cv, NULL); |
a3985cdc DM |
5896 | |
5897 | pad_undef(cv); | |
5898 | ||
7dafbf52 DM |
5899 | /* remove CvOUTSIDE unless this is an undef rather than a free */ |
5900 | if (!SvREFCNT(cv) && CvOUTSIDE(cv)) { | |
5901 | if (!CvWEAKOUTSIDE(cv)) | |
5902 | SvREFCNT_dec(CvOUTSIDE(cv)); | |
601f1833 | 5903 | CvOUTSIDE(cv) = NULL; |
7dafbf52 | 5904 | } |
beab0874 | 5905 | if (CvCONST(cv)) { |
ad64d0ec | 5906 | SvREFCNT_dec(MUTABLE_SV(CvXSUBANY(cv).any_ptr)); |
beab0874 JT |
5907 | CvCONST_off(cv); |
5908 | } | |
d04ba589 | 5909 | if (CvISXSUB(cv) && CvXSUB(cv)) { |
96a5add6 | 5910 | CvXSUB(cv) = NULL; |
50762d59 | 5911 | } |
cfc1e951 | 5912 | /* delete all flags except WEAKOUTSIDE and CVGV_RC, which indicate the |
803f2748 | 5913 | * ref status of CvOUTSIDE and CvGV */ |
cfc1e951 | 5914 | CvFLAGS(cv) &= (CVf_WEAKOUTSIDE|CVf_CVGV_RC); |
79072805 LW |
5915 | } |
5916 | ||
3fe9a6f1 | 5917 | void |
cbf82dd0 NC |
5918 | Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p, |
5919 | const STRLEN len) | |
5920 | { | |
7918f24d NC |
5921 | PERL_ARGS_ASSERT_CV_CKPROTO_LEN; |
5922 | ||
cbf82dd0 NC |
5923 | /* Can't just use a strcmp on the prototype, as CONSTSUBs "cheat" by |
5924 | relying on SvCUR, and doubling up the buffer to hold CvFILE(). */ | |
5925 | if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */ | |
5926 | || (p && (len != SvCUR(cv) /* Not the same length. */ | |
5927 | || memNE(p, SvPVX_const(cv), len)))) | |
5928 | && ckWARN_d(WARN_PROTOTYPE)) { | |
2d03de9c | 5929 | SV* const msg = sv_newmortal(); |
a0714e2c | 5930 | SV* name = NULL; |
3fe9a6f1 | 5931 | |
5932 | if (gv) | |
bd61b366 | 5933 | gv_efullname3(name = sv_newmortal(), gv, NULL); |
6502358f | 5934 | sv_setpvs(msg, "Prototype mismatch:"); |
46fc3d4c | 5935 | if (name) |
be2597df | 5936 | Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name)); |
3fe9a6f1 | 5937 | if (SvPOK(cv)) |
be2597df | 5938 | Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv)); |
ebe643b9 | 5939 | else |
396482e1 GA |
5940 | sv_catpvs(msg, ": none"); |
5941 | sv_catpvs(msg, " vs "); | |
46fc3d4c | 5942 | if (p) |
cbf82dd0 | 5943 | Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p); |
46fc3d4c | 5944 | else |
396482e1 | 5945 | sv_catpvs(msg, "none"); |
be2597df | 5946 | Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg)); |
3fe9a6f1 | 5947 | } |
5948 | } | |
5949 | ||
35f1c1c7 SB |
5950 | static void const_sv_xsub(pTHX_ CV* cv); |
5951 | ||
beab0874 | 5952 | /* |
ccfc67b7 JH |
5953 | |
5954 | =head1 Optree Manipulation Functions | |
5955 | ||
beab0874 JT |
5956 | =for apidoc cv_const_sv |
5957 | ||
5958 | If C<cv> is a constant sub eligible for inlining. returns the constant | |
5959 | value returned by the sub. Otherwise, returns NULL. | |
5960 | ||
5961 | Constant subs can be created with C<newCONSTSUB> or as described in | |
5962 | L<perlsub/"Constant Functions">. | |
5963 | ||
5964 | =cut | |
5965 | */ | |
760ac839 | 5966 | SV * |
d45f5b30 | 5967 | Perl_cv_const_sv(pTHX_ const CV *const cv) |
760ac839 | 5968 | { |
96a5add6 | 5969 | PERL_UNUSED_CONTEXT; |
5069cc75 NC |
5970 | if (!cv) |
5971 | return NULL; | |
5972 | if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM)) | |
5973 | return NULL; | |
ad64d0ec | 5974 | return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL; |
fe5e78ed | 5975 | } |
760ac839 | 5976 | |
b5c19bd7 DM |
5977 | /* op_const_sv: examine an optree to determine whether it's in-lineable. |
5978 | * Can be called in 3 ways: | |
5979 | * | |
5980 | * !cv | |
5981 | * look for a single OP_CONST with attached value: return the value | |
5982 | * | |
5983 | * cv && CvCLONE(cv) && !CvCONST(cv) | |
5984 | * | |
5985 | * examine the clone prototype, and if contains only a single | |
5986 | * OP_CONST referencing a pad const, or a single PADSV referencing | |
5987 | * an outer lexical, return a non-zero value to indicate the CV is | |
5988 | * a candidate for "constizing" at clone time | |
5989 | * | |
5990 | * cv && CvCONST(cv) | |
5991 | * | |
5992 | * We have just cloned an anon prototype that was marked as a const | |
5993 | * candidiate. Try to grab the current value, and in the case of | |
5994 | * PADSV, ignore it if it has multiple references. Return the value. | |
5995 | */ | |
5996 | ||
fe5e78ed | 5997 | SV * |
6867be6d | 5998 | Perl_op_const_sv(pTHX_ const OP *o, CV *cv) |
fe5e78ed | 5999 | { |
97aff369 | 6000 | dVAR; |
a0714e2c | 6001 | SV *sv = NULL; |
fe5e78ed | 6002 | |
c631f32b GG |
6003 | if (PL_madskills) |
6004 | return NULL; | |
6005 | ||
0f79a09d | 6006 | if (!o) |
a0714e2c | 6007 | return NULL; |
1c846c1f NIS |
6008 | |
6009 | if (o->op_type == OP_LINESEQ && cLISTOPo->op_first) | |
fe5e78ed GS |
6010 | o = cLISTOPo->op_first->op_sibling; |
6011 | ||
6012 | for (; o; o = o->op_next) { | |
890ce7af | 6013 | const OPCODE type = o->op_type; |
fe5e78ed | 6014 | |
1c846c1f | 6015 | if (sv && o->op_next == o) |
fe5e78ed | 6016 | return sv; |
e576b457 JT |
6017 | if (o->op_next != o) { |
6018 | if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK) | |
6019 | continue; | |
6020 | if (type == OP_DBSTATE) | |
6021 | continue; | |
6022 | } | |
54310121 | 6023 | if (type == OP_LEAVESUB || type == OP_RETURN) |
6024 | break; | |
6025 | if (sv) | |
a0714e2c | 6026 | return NULL; |
7766f137 | 6027 | if (type == OP_CONST && cSVOPo->op_sv) |
5dc0d613 | 6028 | sv = cSVOPo->op_sv; |
b5c19bd7 | 6029 | else if (cv && type == OP_CONST) { |
dd2155a4 | 6030 | sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ); |
beab0874 | 6031 | if (!sv) |
a0714e2c | 6032 | return NULL; |
b5c19bd7 DM |
6033 | } |
6034 | else if (cv && type == OP_PADSV) { | |
6035 | if (CvCONST(cv)) { /* newly cloned anon */ | |
6036 | sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ); | |
6037 | /* the candidate should have 1 ref from this pad and 1 ref | |
6038 | * from the parent */ | |
6039 | if (!sv || SvREFCNT(sv) != 2) | |
a0714e2c | 6040 | return NULL; |
beab0874 | 6041 | sv = newSVsv(sv); |
b5c19bd7 DM |
6042 | SvREADONLY_on(sv); |
6043 | return sv; | |
6044 | } | |
6045 | else { | |
6046 | if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE) | |
6047 | sv = &PL_sv_undef; /* an arbitrary non-null value */ | |
beab0874 | 6048 | } |
760ac839 | 6049 | } |
b5c19bd7 | 6050 | else { |
a0714e2c | 6051 | return NULL; |
b5c19bd7 | 6052 | } |
760ac839 LW |
6053 | } |
6054 | return sv; | |
6055 | } | |
6056 | ||
eb8433b7 NC |
6057 | #ifdef PERL_MAD |
6058 | OP * | |
6059 | #else | |
09bef843 | 6060 | void |
eb8433b7 | 6061 | #endif |
09bef843 SB |
6062 | Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block) |
6063 | { | |
99129197 NC |
6064 | #if 0 |
6065 | /* This would be the return value, but the return cannot be reached. */ | |
eb8433b7 NC |
6066 | OP* pegop = newOP(OP_NULL, 0); |
6067 | #endif | |
6068 | ||
46c461b5 AL |
6069 | PERL_UNUSED_ARG(floor); |
6070 | ||
09bef843 SB |
6071 | if (o) |
6072 | SAVEFREEOP(o); | |
6073 | if (proto) | |
6074 | SAVEFREEOP(proto); | |
6075 | if (attrs) | |
6076 | SAVEFREEOP(attrs); | |
6077 | if (block) | |
6078 | SAVEFREEOP(block); | |
6079 | Perl_croak(aTHX_ "\"my sub\" not yet implemented"); | |
eb8433b7 | 6080 | #ifdef PERL_MAD |
99129197 | 6081 | NORETURN_FUNCTION_END; |
eb8433b7 | 6082 | #endif |
09bef843 SB |
6083 | } |
6084 | ||
748a9306 | 6085 | CV * |
864dbfa3 | 6086 | Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block) |
79072805 | 6087 | { |
5f66b61c | 6088 | return Perl_newATTRSUB(aTHX_ floor, o, proto, NULL, block); |
09bef843 SB |
6089 | } |
6090 | ||
6091 | CV * | |
6092 | Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block) | |
6093 | { | |
27da23d5 | 6094 | dVAR; |
83ee9e09 | 6095 | GV *gv; |
5c144d81 | 6096 | const char *ps; |
52a9a866 | 6097 | STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */ |
c445ea15 | 6098 | register CV *cv = NULL; |
beab0874 | 6099 | SV *const_sv; |
b48b272a NC |
6100 | /* If the subroutine has no body, no attributes, and no builtin attributes |
6101 | then it's just a sub declaration, and we may be able to get away with | |
6102 | storing with a placeholder scalar in the symbol table, rather than a | |
6103 | full GV and CV. If anything is present then it will take a full CV to | |
6104 | store it. */ | |
6105 | const I32 gv_fetch_flags | |
eb8433b7 NC |
6106 | = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS) |
6107 | || PL_madskills) | |
b48b272a | 6108 | ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT; |
4ea561bc | 6109 | const char * const name = o ? SvPV_nolen_const(cSVOPo->op_sv) : NULL; |
ed4a8a9b | 6110 | bool has_name; |
8e742a20 MHM |
6111 | |
6112 | if (proto) { | |
6113 | assert(proto->op_type == OP_CONST); | |
4ea561bc | 6114 | ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len); |
8e742a20 MHM |
6115 | } |
6116 | else | |
bd61b366 | 6117 | ps = NULL; |
8e742a20 | 6118 | |
ed4a8a9b NC |
6119 | if (name) { |
6120 | gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV); | |
6121 | has_name = TRUE; | |
6122 | } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) { | |
aec46f14 | 6123 | SV * const sv = sv_newmortal(); |
c99da370 JH |
6124 | Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]", |
6125 | PL_curstash ? "__ANON__" : "__ANON__::__ANON__", | |
83ee9e09 | 6126 | CopFILE(PL_curcop), (IV)CopLINE(PL_curcop)); |
ed4a8a9b NC |
6127 | gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV); |
6128 | has_name = TRUE; | |
c1754fce NC |
6129 | } else if (PL_curstash) { |
6130 | gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV); | |
ed4a8a9b | 6131 | has_name = FALSE; |
c1754fce NC |
6132 | } else { |
6133 | gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV); | |
ed4a8a9b | 6134 | has_name = FALSE; |
c1754fce | 6135 | } |
83ee9e09 | 6136 | |
eb8433b7 NC |
6137 | if (!PL_madskills) { |
6138 | if (o) | |
6139 | SAVEFREEOP(o); | |
6140 | if (proto) | |
6141 | SAVEFREEOP(proto); | |
6142 | if (attrs) | |
6143 | SAVEFREEOP(attrs); | |
6144 | } | |
3fe9a6f1 | 6145 | |
09bef843 | 6146 | if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at |
55d729e4 GS |
6147 | maximum a prototype before. */ |
6148 | if (SvTYPE(gv) > SVt_NULL) { | |
ad64d0ec | 6149 | if (!SvPOK((const SV *)gv) |
9b387841 | 6150 | && !(SvIOK((const SV *)gv) && SvIVX((const SV *)gv) == -1)) |
f248d071 | 6151 | { |
9b387841 | 6152 | Perl_ck_warner_d(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype"); |
f248d071 | 6153 | } |
ea726b52 | 6154 | cv_ckproto_len((const CV *)gv, NULL, ps, ps_len); |
55d729e4 GS |
6155 | } |
6156 | if (ps) | |
ad64d0ec | 6157 | sv_setpvn(MUTABLE_SV(gv), ps, ps_len); |
55d729e4 | 6158 | else |
ad64d0ec | 6159 | sv_setiv(MUTABLE_SV(gv), -1); |
e1a479c5 | 6160 | |
3280af22 NIS |
6161 | SvREFCNT_dec(PL_compcv); |
6162 | cv = PL_compcv = NULL; | |
beab0874 | 6163 | goto done; |
55d729e4 GS |
6164 | } |
6165 | ||
601f1833 | 6166 | cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv); |
beab0874 | 6167 | |
eb8433b7 NC |
6168 | if (!block || !ps || *ps || attrs |
6169 | || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS) | |
6170 | #ifdef PERL_MAD | |
6171 | || block->op_type == OP_NULL | |
6172 | #endif | |
6173 | ) | |
a0714e2c | 6174 | const_sv = NULL; |
beab0874 | 6175 | else |
601f1833 | 6176 | const_sv = op_const_sv(block, NULL); |
beab0874 JT |
6177 | |
6178 | if (cv) { | |
6867be6d | 6179 | const bool exists = CvROOT(cv) || CvXSUB(cv); |
5bd07a3d | 6180 | |
60ed1d8c GS |
6181 | /* if the subroutine doesn't exist and wasn't pre-declared |
6182 | * with a prototype, assume it will be AUTOLOADed, | |
6183 | * skipping the prototype check | |
6184 | */ | |
6185 | if (exists || SvPOK(cv)) | |
cbf82dd0 | 6186 | cv_ckproto_len(cv, gv, ps, ps_len); |
68dc0745 | 6187 | /* already defined (or promised)? */ |
60ed1d8c | 6188 | if (exists || GvASSUMECV(gv)) { |
eb8433b7 NC |
6189 | if ((!block |
6190 | #ifdef PERL_MAD | |
6191 | || block->op_type == OP_NULL | |
6192 | #endif | |
6193 | )&& !attrs) { | |
d3cea301 SB |
6194 | if (CvFLAGS(PL_compcv)) { |
6195 | /* might have had built-in attrs applied */ | |
963d9ce9 | 6196 | if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && ckWARN(WARN_MISC)) |
885ef6f5 GG |
6197 | Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined"); |
6198 | CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS & ~CVf_LVALUE); | |
d3cea301 | 6199 | } |
aa689395 | 6200 | /* just a "sub foo;" when &foo is already defined */ |
3280af22 | 6201 | SAVEFREESV(PL_compcv); |
aa689395 | 6202 | goto done; |
6203 | } | |
eb8433b7 NC |
6204 | if (block |
6205 | #ifdef PERL_MAD | |
6206 | && block->op_type != OP_NULL | |
6207 | #endif | |
6208 | ) { | |
beab0874 JT |
6209 | if (ckWARN(WARN_REDEFINE) |
6210 | || (CvCONST(cv) | |
6211 | && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv)))) | |
6212 | { | |
6867be6d | 6213 | const line_t oldline = CopLINE(PL_curcop); |
53a7735b DM |
6214 | if (PL_parser && PL_parser->copline != NOLINE) |
6215 | CopLINE_set(PL_curcop, PL_parser->copline); | |
9014280d | 6216 | Perl_warner(aTHX_ packWARN(WARN_REDEFINE), |
666ea192 JH |
6217 | CvCONST(cv) ? "Constant subroutine %s redefined" |
6218 | : "Subroutine %s redefined", name); | |
beab0874 JT |
6219 | CopLINE_set(PL_curcop, oldline); |
6220 | } | |
eb8433b7 NC |
6221 | #ifdef PERL_MAD |
6222 | if (!PL_minus_c) /* keep old one around for madskills */ | |
6223 | #endif | |
6224 | { | |
6225 | /* (PL_madskills unset in used file.) */ | |
6226 | SvREFCNT_dec(cv); | |
6227 | } | |
601f1833 | 6228 | cv = NULL; |
79072805 | 6229 | } |
79072805 LW |
6230 | } |
6231 | } | |
beab0874 | 6232 | if (const_sv) { |
f84c484e | 6233 | SvREFCNT_inc_simple_void_NN(const_sv); |
beab0874 | 6234 | if (cv) { |
0768512c | 6235 | assert(!CvROOT(cv) && !CvCONST(cv)); |
ad64d0ec | 6236 | sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */ |
beab0874 JT |
6237 | CvXSUBANY(cv).any_ptr = const_sv; |
6238 | CvXSUB(cv) = const_sv_xsub; | |
6239 | CvCONST_on(cv); | |
d04ba589 | 6240 | CvISXSUB_on(cv); |
beab0874 JT |
6241 | } |
6242 | else { | |
601f1833 | 6243 | GvCV(gv) = NULL; |
beab0874 JT |
6244 | cv = newCONSTSUB(NULL, name, const_sv); |
6245 | } | |
e1a479c5 BB |
6246 | mro_method_changed_in( /* sub Foo::Bar () { 123 } */ |
6247 | (CvGV(cv) && GvSTASH(CvGV(cv))) | |
6248 | ? GvSTASH(CvGV(cv)) | |
6249 | : CvSTASH(cv) | |
6250 | ? CvSTASH(cv) | |
6251 | : PL_curstash | |
6252 | ); | |
eb8433b7 NC |
6253 | if (PL_madskills) |
6254 | goto install_block; | |
beab0874 JT |
6255 | op_free(block); |
6256 | SvREFCNT_dec(PL_compcv); | |
6257 | PL_compcv = NULL; | |
beab0874 JT |
6258 | goto done; |
6259 | } | |
09330df8 Z |
6260 | if (cv) { /* must reuse cv if autoloaded */ |
6261 | /* transfer PL_compcv to cv */ | |
6262 | if (block | |
eb8433b7 | 6263 | #ifdef PERL_MAD |
09330df8 | 6264 | && block->op_type != OP_NULL |
eb8433b7 | 6265 | #endif |
09330df8 | 6266 | ) { |
eac910c8 | 6267 | cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS; |
09330df8 | 6268 | cv_undef(cv); |
eac910c8 | 6269 | CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs; |
09330df8 Z |
6270 | if (!CvWEAKOUTSIDE(cv)) |
6271 | SvREFCNT_dec(CvOUTSIDE(cv)); | |
6272 | CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv); | |
6273 | CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv); | |
6274 | CvOUTSIDE(PL_compcv) = 0; | |
6275 | CvPADLIST(cv) = CvPADLIST(PL_compcv); | |
6276 | CvPADLIST(PL_compcv) = 0; | |
6277 | /* inner references to PL_compcv must be fixed up ... */ | |
6278 | pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv); | |
6279 | if (PERLDB_INTER)/* Advice debugger on the new sub. */ | |
6280 | ++PL_sub_generation; | |
4c74a7df DM |
6281 | if (CvSTASH(cv)) |
6282 | sv_del_backref(MUTABLE_SV(CvSTASH(cv)), MUTABLE_SV(cv)); | |
09bef843 SB |
6283 | } |
6284 | else { | |
09330df8 Z |
6285 | /* Might have had built-in attributes applied -- propagate them. */ |
6286 | CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS); | |
09bef843 | 6287 | } |
282f25c9 | 6288 | /* ... before we throw it away */ |
3280af22 | 6289 | SvREFCNT_dec(PL_compcv); |
b5c19bd7 | 6290 | PL_compcv = cv; |
a0d0e21e LW |
6291 | } |
6292 | else { | |
3280af22 | 6293 | cv = PL_compcv; |
44a8e56a | 6294 | if (name) { |
6295 | GvCV(gv) = cv; | |
eb8433b7 NC |
6296 | if (PL_madskills) { |
6297 | if (strEQ(name, "import")) { | |
ad64d0ec | 6298 | PL_formfeed = MUTABLE_SV(cv); |
06f07c2f | 6299 | /* diag_listed_as: SKIPME */ |
fea10cf6 | 6300 | Perl_warner(aTHX_ packWARN(WARN_VOID), "0x%"UVxf"\n", PTR2UV(cv)); |
eb8433b7 NC |
6301 | } |
6302 | } | |
44a8e56a | 6303 | GvCVGEN(gv) = 0; |
e1a479c5 | 6304 | mro_method_changed_in(GvSTASH(gv)); /* sub Foo::bar { (shift)+1 } */ |
44a8e56a | 6305 | } |
a0d0e21e | 6306 | } |
09330df8 | 6307 | if (!CvGV(cv)) { |
b3f91e91 | 6308 | CvGV_set(cv, gv); |
09330df8 Z |
6309 | CvFILE_set_from_cop(cv, PL_curcop); |
6310 | CvSTASH(cv) = PL_curstash; | |
4c74a7df DM |
6311 | if (PL_curstash) |
6312 | Perl_sv_add_backref(aTHX_ MUTABLE_SV(PL_curstash), MUTABLE_SV(cv)); | |
09330df8 Z |
6313 | } |
6314 | if (attrs) { | |
6315 | /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */ | |
6316 | HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash; | |
6317 | apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE); | |
6318 | } | |
8990e307 | 6319 | |
3fe9a6f1 | 6320 | if (ps) |
ad64d0ec | 6321 | sv_setpvn(MUTABLE_SV(cv), ps, ps_len); |
4633a7c4 | 6322 | |
13765c85 | 6323 | if (PL_parser && PL_parser->error_count) { |
c07a80fd | 6324 | op_free(block); |
5f66b61c | 6325 | block = NULL; |
68dc0745 | 6326 | if (name) { |
6867be6d | 6327 | const char *s = strrchr(name, ':'); |
68dc0745 | 6328 | s = s ? s+1 : name; |
6d4c2119 | 6329 | if (strEQ(s, "BEGIN")) { |
e1ec3a88 | 6330 | const char not_safe[] = |
6d4c2119 | 6331 | "BEGIN not safe after errors--compilation aborted"; |
faef0170 | 6332 | if (PL_in_eval & EVAL_KEEPERR) |
cea2e8a9 | 6333 | Perl_croak(aTHX_ not_safe); |
6d4c2119 CS |
6334 | else { |
6335 | /* force display of errors found but not reported */ | |
38a03e6e | 6336 | sv_catpv(ERRSV, not_safe); |
be2597df | 6337 | Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV)); |
6d4c2119 CS |
6338 | } |
6339 | } | |
68dc0745 | 6340 | } |
c07a80fd | 6341 | } |
eb8433b7 | 6342 | install_block: |
beab0874 JT |
6343 | if (!block) |
6344 | goto done; | |
a0d0e21e | 6345 | |
aac018bb NC |
6346 | /* If we assign an optree to a PVCV, then we've defined a subroutine that |
6347 | the debugger could be able to set a breakpoint in, so signal to | |
6348 | pp_entereval that it should not throw away any saved lines at scope | |
6349 | exit. */ | |
6350 | ||
fd06b02c | 6351 | PL_breakable_sub_gen++; |
7766f137 | 6352 | if (CvLVALUE(cv)) { |
78f9721b SM |
6353 | CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0, |
6354 | mod(scalarseq(block), OP_LEAVESUBLV)); | |
7e5d8ed2 | 6355 | block->op_attached = 1; |
7766f137 GS |
6356 | } |
6357 | else { | |
09c2fd24 AE |
6358 | /* This makes sub {}; work as expected. */ |
6359 | if (block->op_type == OP_STUB) { | |
1496a290 | 6360 | OP* const newblock = newSTATEOP(0, NULL, 0); |
eb8433b7 NC |
6361 | #ifdef PERL_MAD |
6362 | op_getmad(block,newblock,'B'); | |
6363 | #else | |
09c2fd24 | 6364 | op_free(block); |
eb8433b7 NC |
6365 | #endif |
6366 | block = newblock; | |
09c2fd24 | 6367 | } |
7e5d8ed2 DM |
6368 | else |
6369 | block->op_attached = 1; | |
7766f137 GS |
6370 | CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block)); |
6371 | } | |
6372 | CvROOT(cv)->op_private |= OPpREFCOUNTED; | |
6373 | OpREFCNT_set(CvROOT(cv), 1); | |
6374 | CvSTART(cv) = LINKLIST(CvROOT(cv)); | |
6375 | CvROOT(cv)->op_next = 0; | |
a2efc822 | 6376 | CALL_PEEP(CvSTART(cv)); |
7766f137 GS |
6377 | |
6378 | /* now that optimizer has done its work, adjust pad values */ | |
54310121 | 6379 | |
dd2155a4 DM |
6380 | pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB); |
6381 | ||
6382 | if (CvCLONE(cv)) { | |
beab0874 JT |
6383 | assert(!CvCONST(cv)); |
6384 | if (ps && !*ps && op_const_sv(block, cv)) | |
6385 | CvCONST_on(cv); | |
a0d0e21e | 6386 | } |
79072805 | 6387 | |
ed4a8a9b | 6388 | if (has_name) { |
3280af22 | 6389 | if (PERLDB_SUBLINE && PL_curstash != PL_debstash) { |
c4420975 | 6390 | SV * const tmpstr = sv_newmortal(); |
5c1737d1 NC |
6391 | GV * const db_postponed = gv_fetchpvs("DB::postponed", |
6392 | GV_ADDMULTI, SVt_PVHV); | |
44a8e56a | 6393 | HV *hv; |
b081dd7e NC |
6394 | SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld", |
6395 | CopFILE(PL_curcop), | |
6396 | (long)PL_subline, | |
6397 | (long)CopLINE(PL_curcop)); | |
bd61b366 | 6398 | gv_efullname3(tmpstr, gv, NULL); |
04fe65b0 RGS |
6399 | (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr), |
6400 | SvCUR(tmpstr), sv, 0); | |
44a8e56a | 6401 | hv = GvHVn(db_postponed); |
f4431c56 | 6402 | if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) { |
551405c4 AL |
6403 | CV * const pcv = GvCV(db_postponed); |
6404 | if (pcv) { | |
6405 | dSP; | |
6406 | PUSHMARK(SP); | |
6407 | XPUSHs(tmpstr); | |
6408 | PUTBACK; | |
ad64d0ec | 6409 | call_sv(MUTABLE_SV(pcv), G_DISCARD); |
551405c4 | 6410 | } |
44a8e56a | 6411 | } |
6412 | } | |
79072805 | 6413 | |
13765c85 | 6414 | if (name && ! (PL_parser && PL_parser->error_count)) |
0cd10f52 | 6415 | process_special_blocks(name, gv, cv); |
33fb7a6e | 6416 | } |
ed094faf | 6417 | |
33fb7a6e | 6418 | done: |
53a7735b DM |
6419 | if (PL_parser) |
6420 | PL_parser->copline = NOLINE; | |
33fb7a6e NC |
6421 | LEAVE_SCOPE(floor); |
6422 | return cv; | |
6423 | } | |
ed094faf | 6424 | |
33fb7a6e NC |
6425 | STATIC void |
6426 | S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv, | |
6427 | CV *const cv) | |
6428 | { | |
6429 | const char *const colon = strrchr(fullname,':'); | |
6430 | const char *const name = colon ? colon + 1 : fullname; | |
6431 | ||
7918f24d NC |
6432 | PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS; |
6433 | ||
33fb7a6e | 6434 | if (*name == 'B') { |
6952d67e | 6435 | if (strEQ(name, "BEGIN")) { |
6867be6d | 6436 | const I32 oldscope = PL_scopestack_ix; |
28757baa | 6437 | ENTER; |
57843af0 GS |
6438 | SAVECOPFILE(&PL_compiling); |
6439 | SAVECOPLINE(&PL_compiling); | |
28757baa | 6440 | |
a58fb6f9 | 6441 | DEBUG_x( dump_sub(gv) ); |
ad64d0ec | 6442 | Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv)); |
ea2f84a3 | 6443 | GvCV(gv) = 0; /* cv has been hijacked */ |
3280af22 | 6444 | call_list(oldscope, PL_beginav); |
a6006777 | 6445 | |
3280af22 | 6446 | PL_curcop = &PL_compiling; |
623e6609 | 6447 | CopHINTS_set(&PL_compiling, PL_hints); |
28757baa | 6448 | LEAVE; |
6449 | } | |
33fb7a6e NC |
6450 | else |
6451 | return; | |
6452 | } else { | |
6453 | if (*name == 'E') { | |
6454 | if strEQ(name, "END") { | |
a58fb6f9 | 6455 | DEBUG_x( dump_sub(gv) ); |
ad64d0ec | 6456 | Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv)); |
33fb7a6e NC |
6457 | } else |
6458 | return; | |
6459 | } else if (*name == 'U') { | |
6460 | if (strEQ(name, "UNITCHECK")) { | |
6461 | /* It's never too late to run a unitcheck block */ | |
ad64d0ec | 6462 | Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv)); |
33fb7a6e NC |
6463 | } |
6464 | else | |
6465 | return; | |
6466 | } else if (*name == 'C') { | |
6467 | if (strEQ(name, "CHECK")) { | |
a2a5de95 NC |
6468 | if (PL_main_start) |
6469 | Perl_ck_warner(aTHX_ packWARN(WARN_VOID), | |
6470 | "Too late to run CHECK block"); | |
ad64d0ec | 6471 | Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv)); |
33fb7a6e NC |
6472 | } |
6473 | else | |
6474 | return; | |
6475 | } else if (*name == 'I') { | |
6476 | if (strEQ(name, "INIT")) { | |
a2a5de95 NC |
6477 | if (PL_main_start) |
6478 | Perl_ck_warner(aTHX_ packWARN(WARN_VOID), | |
6479 | "Too late to run INIT block"); | |
ad64d0ec | 6480 | Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv)); |
33fb7a6e NC |
6481 | } |
6482 | else | |
6483 | return; | |
6484 | } else | |
6485 | return; | |
a58fb6f9 | 6486 | DEBUG_x( dump_sub(gv) ); |
33fb7a6e | 6487 | GvCV(gv) = 0; /* cv has been hijacked */ |
79072805 | 6488 | } |
79072805 LW |
6489 | } |
6490 | ||
954c1994 GS |
6491 | /* |
6492 | =for apidoc newCONSTSUB | |
6493 | ||
6494 | Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is | |
6495 | eligible for inlining at compile-time. | |
6496 | ||
99ab892b NC |
6497 | Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>, |
6498 | which won't be called if used as a destructor, but will suppress the overhead | |
6499 | of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at | |
6500 | compile time.) | |
6501 | ||
954c1994 GS |
6502 | =cut |
6503 | */ | |
6504 | ||
beab0874 | 6505 | CV * |
e1ec3a88 | 6506 | Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv) |
5476c433 | 6507 | { |
27da23d5 | 6508 | dVAR; |
beab0874 | 6509 | CV* cv; |
cbf82dd0 | 6510 | #ifdef USE_ITHREADS |
54d012c6 | 6511 | const char *const file = CopFILE(PL_curcop); |
cbf82dd0 NC |
6512 | #else |
6513 | SV *const temp_sv = CopFILESV(PL_curcop); | |
def18e4c | 6514 | const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL; |
cbf82dd0 | 6515 | #endif |
5476c433 | 6516 | |
11faa288 | 6517 | ENTER; |
11faa288 | 6518 | |
401667e9 DM |
6519 | if (IN_PERL_RUNTIME) { |
6520 | /* at runtime, it's not safe to manipulate PL_curcop: it may be | |
6521 | * an op shared between threads. Use a non-shared COP for our | |
6522 | * dirty work */ | |
6523 | SAVEVPTR(PL_curcop); | |
6524 | PL_curcop = &PL_compiling; | |
6525 | } | |
f4dd75d9 | 6526 | SAVECOPLINE(PL_curcop); |
53a7735b | 6527 | CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE); |
f4dd75d9 GS |
6528 | |
6529 | SAVEHINTS(); | |
3280af22 | 6530 | PL_hints &= ~HINT_BLOCK_SCOPE; |
11faa288 GS |
6531 | |
6532 | if (stash) { | |
6533 | SAVESPTR(PL_curstash); | |
6534 | SAVECOPSTASH(PL_curcop); | |
6535 | PL_curstash = stash; | |
05ec9bb3 | 6536 | CopSTASH_set(PL_curcop,stash); |
11faa288 | 6537 | } |
5476c433 | 6538 | |
cbf82dd0 NC |
6539 | /* file becomes the CvFILE. For an XS, it's supposed to be static storage, |
6540 | and so doesn't get free()d. (It's expected to be from the C pre- | |
6541 | processor __FILE__ directive). But we need a dynamically allocated one, | |
77004dee | 6542 | and we need it to get freed. */ |
54d012c6 NC |
6543 | cv = newXS_flags(name, const_sv_xsub, file ? file : "", "", |
6544 | XS_DYNAMIC_FILENAME); | |
beab0874 JT |
6545 | CvXSUBANY(cv).any_ptr = sv; |
6546 | CvCONST_on(cv); | |
5476c433 | 6547 | |
65e66c80 | 6548 | #ifdef USE_ITHREADS |
02f28d44 MHM |
6549 | if (stash) |
6550 | CopSTASH_free(PL_curcop); | |
65e66c80 | 6551 | #endif |
11faa288 | 6552 | LEAVE; |
beab0874 JT |
6553 | |
6554 | return cv; | |
5476c433 JD |
6555 | } |
6556 | ||
77004dee NC |
6557 | CV * |
6558 | Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr, | |
6559 | const char *const filename, const char *const proto, | |
6560 | U32 flags) | |
6561 | { | |
6562 | CV *cv = newXS(name, subaddr, filename); | |
6563 | ||
7918f24d NC |
6564 | PERL_ARGS_ASSERT_NEWXS_FLAGS; |
6565 | ||
77004dee NC |
6566 | if (flags & XS_DYNAMIC_FILENAME) { |
6567 | /* We need to "make arrangements" (ie cheat) to ensure that the | |
6568 | filename lasts as long as the PVCV we just created, but also doesn't | |
6569 | leak */ | |
6570 | STRLEN filename_len = strlen(filename); | |
6571 | STRLEN proto_and_file_len = filename_len; | |
6572 | char *proto_and_file; | |
6573 | STRLEN proto_len; | |
6574 | ||
6575 | if (proto) { | |
6576 | proto_len = strlen(proto); | |
6577 | proto_and_file_len += proto_len; | |
6578 | ||
6579 | Newx(proto_and_file, proto_and_file_len + 1, char); | |
6580 | Copy(proto, proto_and_file, proto_len, char); | |
6581 | Copy(filename, proto_and_file + proto_len, filename_len + 1, char); | |
6582 | } else { | |
6583 | proto_len = 0; | |
6584 | proto_and_file = savepvn(filename, filename_len); | |
6585 | } | |
6586 | ||
6587 | /* This gets free()d. :-) */ | |
ad64d0ec | 6588 | sv_usepvn_flags(MUTABLE_SV(cv), proto_and_file, proto_and_file_len, |
77004dee NC |
6589 | SV_HAS_TRAILING_NUL); |
6590 | if (proto) { | |
6591 | /* This gives us the correct prototype, rather than one with the | |
6592 | file name appended. */ | |
6593 | SvCUR_set(cv, proto_len); | |
6594 | } else { | |
6595 | SvPOK_off(cv); | |
6596 | } | |
81a2b3b6 | 6597 | CvFILE(cv) = proto_and_file + proto_len; |
77004dee | 6598 | } else { |
ad64d0ec | 6599 | sv_setpv(MUTABLE_SV(cv), proto); |
77004dee NC |
6600 | } |
6601 | return cv; | |
6602 | } | |
6603 | ||
954c1994 GS |
6604 | /* |
6605 | =for apidoc U||newXS | |
6606 | ||
77004dee NC |
6607 | Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be |
6608 | static storage, as it is used directly as CvFILE(), without a copy being made. | |
954c1994 GS |
6609 | |
6610 | =cut | |
6611 | */ | |
6612 | ||
57d3b86d | 6613 | CV * |
bfed75c6 | 6614 | Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename) |
a0d0e21e | 6615 | { |
97aff369 | 6616 | dVAR; |
666ea192 JH |
6617 | GV * const gv = gv_fetchpv(name ? name : |
6618 | (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"), | |
6619 | GV_ADDMULTI, SVt_PVCV); | |
79072805 | 6620 | register CV *cv; |
44a8e56a | 6621 | |
7918f24d NC |
6622 | PERL_ARGS_ASSERT_NEWXS; |
6623 | ||
1ecdd9a8 HS |
6624 | if (!subaddr) |
6625 | Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename); | |
6626 | ||
601f1833 | 6627 | if ((cv = (name ? GvCV(gv) : NULL))) { |
44a8e56a | 6628 | if (GvCVGEN(gv)) { |
6629 | /* just a cached method */ | |
6630 | SvREFCNT_dec(cv); | |
601f1833 | 6631 | cv = NULL; |
44a8e56a | 6632 | } |
6633 | else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) { | |
6634 | /* already defined (or promised) */ | |
1df70142 | 6635 | /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */ |
66a1b24b AL |
6636 | if (ckWARN(WARN_REDEFINE)) { |
6637 | GV * const gvcv = CvGV(cv); | |
6638 | if (gvcv) { | |
6639 | HV * const stash = GvSTASH(gvcv); | |
6640 | if (stash) { | |
8b38226b AL |
6641 | const char *redefined_name = HvNAME_get(stash); |
6642 | if ( strEQ(redefined_name,"autouse") ) { | |
66a1b24b | 6643 | const line_t oldline = CopLINE(PL_curcop); |
53a7735b DM |
6644 | if (PL_parser && PL_parser->copline != NOLINE) |
6645 | CopLINE_set(PL_curcop, PL_parser->copline); | |
66a1b24b | 6646 | Perl_warner(aTHX_ packWARN(WARN_REDEFINE), |
666ea192 JH |
6647 | CvCONST(cv) ? "Constant subroutine %s redefined" |
6648 | : "Subroutine %s redefined" | |
6649 | ,name); | |
66a1b24b AL |
6650 | CopLINE_set(PL_curcop, oldline); |
6651 | } | |
6652 | } | |
6653 | } | |
a0d0e21e LW |
6654 | } |
6655 | SvREFCNT_dec(cv); | |
601f1833 | 6656 | cv = NULL; |
79072805 | 6657 | } |
79072805 | 6658 | } |
44a8e56a | 6659 | |
6660 | if (cv) /* must reuse cv if autoloaded */ | |
6661 | cv_undef(cv); | |
a0d0e21e | 6662 | else { |
ea726b52 | 6663 | cv = MUTABLE_CV(newSV_type(SVt_PVCV)); |
44a8e56a | 6664 | if (name) { |
6665 | GvCV(gv) = cv; | |
6666 | GvCVGEN(gv) = 0; | |
e1a479c5 | 6667 | mro_method_changed_in(GvSTASH(gv)); /* newXS */ |
44a8e56a | 6668 | } |
a0d0e21e | 6669 | } |
803f2748 DM |
6670 | if (!name) |
6671 | CvANON_on(cv); | |
b3f91e91 | 6672 | CvGV_set(cv, gv); |
b195d487 | 6673 | (void)gv_fetchfile(filename); |
dd374669 | 6674 | CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be |
57843af0 | 6675 | an external constant string */ |
d04ba589 | 6676 | CvISXSUB_on(cv); |
a0d0e21e | 6677 | CvXSUB(cv) = subaddr; |
44a8e56a | 6678 | |
33fb7a6e NC |
6679 | if (name) |
6680 | process_special_blocks(name, gv, cv); | |
44a8e56a | 6681 | |
a0d0e21e | 6682 | return cv; |
79072805 LW |
6683 | } |
6684 | ||
eb8433b7 NC |
6685 | #ifdef PERL_MAD |
6686 | OP * | |
6687 | #else | |
79072805 | 6688 | void |
eb8433b7 | 6689 | #endif |
864dbfa3 | 6690 | Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block) |
79072805 | 6691 | { |
97aff369 | 6692 | dVAR; |
79072805 | 6693 | register CV *cv; |
eb8433b7 NC |
6694 | #ifdef PERL_MAD |
6695 | OP* pegop = newOP(OP_NULL, 0); | |
6696 | #endif | |
79072805 | 6697 | |
0bd48802 | 6698 | GV * const gv = o |
f776e3cd | 6699 | ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM) |
fafc274c | 6700 | : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM); |
0bd48802 | 6701 | |
a5f75d66 | 6702 | GvMULTI_on(gv); |
155aba94 | 6703 | if ((cv = GvFORM(gv))) { |
599cee73 | 6704 | if (ckWARN(WARN_REDEFINE)) { |
6867be6d | 6705 | const line_t oldline = CopLINE(PL_curcop); |
53a7735b DM |
6706 | if (PL_parser && PL_parser->copline != NOLINE) |
6707 | CopLINE_set(PL_curcop, PL_parser->copline); | |
ee6d2783 NC |
6708 | if (o) { |
6709 | Perl_warner(aTHX_ packWARN(WARN_REDEFINE), | |
6710 | "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv)); | |
6711 | } else { | |
6712 | Perl_warner(aTHX_ packWARN(WARN_REDEFINE), | |
6713 | "Format STDOUT redefined"); | |
6714 | } | |
57843af0 | 6715 | CopLINE_set(PL_curcop, oldline); |
79072805 | 6716 | } |
8990e307 | 6717 | SvREFCNT_dec(cv); |
79072805 | 6718 | } |
3280af22 | 6719 | cv = PL_compcv; |
79072805 | 6720 | GvFORM(gv) = cv; |
b3f91e91 | 6721 | CvGV_set(cv, gv); |
a636914a | 6722 | CvFILE_set_from_cop(cv, PL_curcop); |
79072805 | 6723 | |
a0d0e21e | 6724 | |
dd2155a4 | 6725 | pad_tidy(padtidy_FORMAT); |
79072805 | 6726 | CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block)); |
7934575e GS |
6727 | CvROOT(cv)->op_private |= OPpREFCOUNTED; |
6728 | OpREFCNT_set(CvROOT(cv), 1); | |
79072805 LW |
6729 | CvSTART(cv) = LINKLIST(CvROOT(cv)); |
6730 | CvROOT(cv)->op_next = 0; | |
a2efc822 | 6731 | CALL_PEEP(CvSTART(cv)); |
eb8433b7 NC |
6732 | #ifdef PERL_MAD |
6733 | op_getmad(o,pegop,'n'); | |
6734 | op_getmad_weak(block, pegop, 'b'); | |
6735 | #else | |
11343788 | 6736 | op_free(o); |
eb8433b7 | 6737 | #endif |
53a7735b DM |
6738 | if (PL_parser) |
6739 | PL_parser->copline = NOLINE; | |
8990e307 | 6740 | LEAVE_SCOPE(floor); |
eb8433b7 NC |
6741 | #ifdef PERL_MAD |
6742 | return pegop; | |
6743 | #endif | |
79072805 LW |
6744 | } |
6745 | ||
6746 | OP * | |
864dbfa3 | 6747 | Perl_newANONLIST(pTHX_ OP *o) |
79072805 | 6748 | { |
78c72037 | 6749 | return convert(OP_ANONLIST, OPf_SPECIAL, o); |
79072805 LW |
6750 | } |
6751 | ||
6752 | OP * | |
864dbfa3 | 6753 | Perl_newANONHASH(pTHX_ OP *o) |
79072805 | 6754 | { |
78c72037 | 6755 | return convert(OP_ANONHASH, OPf_SPECIAL, o); |
a0d0e21e LW |
6756 | } |
6757 | ||
6758 | OP * | |
864dbfa3 | 6759 | Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block) |
a0d0e21e | 6760 | { |
5f66b61c | 6761 | return newANONATTRSUB(floor, proto, NULL, block); |
09bef843 SB |
6762 | } |
6763 | ||
6764 | OP * | |
6765 | Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block) | |
6766 | { | |
a0d0e21e | 6767 | return newUNOP(OP_REFGEN, 0, |
09bef843 | 6768 | newSVOP(OP_ANONCODE, 0, |
ad64d0ec | 6769 | MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block)))); |
79072805 LW |
6770 | } |
6771 | ||
6772 | OP * | |
864dbfa3 | 6773 | Perl_oopsAV(pTHX_ OP *o) |
79072805 | 6774 | { |
27da23d5 | 6775 | dVAR; |
7918f24d NC |
6776 | |
6777 | PERL_ARGS_ASSERT_OOPSAV; | |
6778 | ||
ed6116ce LW |
6779 | switch (o->op_type) { |
6780 | case OP_PADSV: | |
6781 | o->op_type = OP_PADAV; | |
22c35a8c | 6782 | o->op_ppaddr = PL_ppaddr[OP_PADAV]; |
51e247a3 | 6783 | return ref(o, OP_RV2AV); |
b2ffa427 | 6784 | |
ed6116ce | 6785 | case OP_RV2SV: |
79072805 | 6786 | o->op_type = OP_RV2AV; |
22c35a8c | 6787 | o->op_ppaddr = PL_ppaddr[OP_RV2AV]; |
79072805 | 6788 | ref(o, OP_RV2AV); |
ed6116ce LW |
6789 | break; |
6790 | ||
6791 | default: | |
9b387841 | 6792 | Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV"); |
ed6116ce LW |
6793 | break; |
6794 | } | |
79072805 LW |
6795 | return o; |
6796 | } | |
6797 | ||
6798 | OP * | |
864dbfa3 | 6799 | Perl_oopsHV(pTHX_ OP *o) |
79072805 | 6800 | { |
27da23d5 | 6801 | dVAR; |
7918f24d NC |
6802 | |
6803 | PERL_ARGS_ASSERT_OOPSHV; | |
6804 | ||
ed6116ce LW |
6805 | switch (o->op_type) { |
6806 | case OP_PADSV: | |
6807 | case OP_PADAV: | |
6808 | o->op_type = OP_PADHV; | |
22c35a8c | 6809 | o->op_ppaddr = PL_ppaddr[OP_PADHV]; |
51e247a3 | 6810 | return ref(o, OP_RV2HV); |
ed6116ce LW |
6811 | |
6812 | case OP_RV2SV: | |
6813 | case OP_RV2AV: | |
79072805 | 6814 | o->op_type = OP_RV2HV; |
22c35a8c | 6815 | o->op_ppaddr = PL_ppaddr[OP_RV2HV]; |
79072805 | 6816 | ref(o, OP_RV2HV); |
ed6116ce LW |
6817 | break; |
6818 | ||
6819 | default: | |
9b387841 | 6820 | Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV"); |
ed6116ce LW |
6821 | break; |
6822 | } | |
79072805 LW |
6823 | return o; |
6824 | } | |
6825 | ||
6826 | OP * | |
864dbfa3 | 6827 | Perl_newAVREF(pTHX_ OP *o) |
79072805 | 6828 | { |
27da23d5 | 6829 | dVAR; |
7918f24d NC |
6830 | |
6831 | PERL_ARGS_ASSERT_NEWAVREF; | |
6832 | ||
ed6116ce LW |
6833 | if (o->op_type == OP_PADANY) { |
6834 | o->op_type = OP_PADAV; | |
22c35a8c | 6835 | o->op_ppaddr = PL_ppaddr[OP_PADAV]; |
93a17b20 | 6836 | return o; |
ed6116ce | 6837 | } |
a2a5de95 | 6838 | else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) { |
d1d15184 | 6839 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 6840 | "Using an array as a reference is deprecated"); |
a1063b2d | 6841 | } |
79072805 LW |
6842 | return newUNOP(OP_RV2AV, 0, scalar(o)); |
6843 | } | |
6844 | ||
6845 | OP * | |
864dbfa3 | 6846 | Perl_newGVREF(pTHX_ I32 type, OP *o) |
79072805 | 6847 | { |
82092f1d | 6848 | if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT) |
a0d0e21e | 6849 | return newUNOP(OP_NULL, 0, o); |
748a9306 | 6850 | return ref(newUNOP(OP_RV2GV, OPf_REF, o), type); |
79072805 LW |
6851 | } |
6852 | ||
6853 | OP * | |
864dbfa3 | 6854 | Perl_newHVREF(pTHX_ OP *o) |
79072805 | 6855 | { |
27da23d5 | 6856 | dVAR; |
7918f24d NC |
6857 | |
6858 | PERL_ARGS_ASSERT_NEWHVREF; | |
6859 | ||
ed6116ce LW |
6860 | if (o->op_type == OP_PADANY) { |
6861 | o->op_type = OP_PADHV; | |
22c35a8c | 6862 | o->op_ppaddr = PL_ppaddr[OP_PADHV]; |
93a17b20 | 6863 | return o; |
ed6116ce | 6864 | } |
a2a5de95 | 6865 | else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) { |
d1d15184 | 6866 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 6867 | "Using a hash as a reference is deprecated"); |
a1063b2d | 6868 | } |
79072805 LW |
6869 | return newUNOP(OP_RV2HV, 0, scalar(o)); |
6870 | } | |
6871 | ||
6872 | OP * | |
864dbfa3 | 6873 | Perl_newCVREF(pTHX_ I32 flags, OP *o) |
79072805 | 6874 | { |
c07a80fd | 6875 | return newUNOP(OP_RV2CV, flags, scalar(o)); |
79072805 LW |
6876 | } |
6877 | ||
6878 | OP * | |
864dbfa3 | 6879 | Perl_newSVREF(pTHX_ OP *o) |
79072805 | 6880 | { |
27da23d5 | 6881 | dVAR; |
7918f24d NC |
6882 | |
6883 | PERL_ARGS_ASSERT_NEWSVREF; | |
6884 | ||
ed6116ce LW |
6885 | if (o->op_type == OP_PADANY) { |
6886 | o->op_type = OP_PADSV; | |
22c35a8c | 6887 | o->op_ppaddr = PL_ppaddr[OP_PADSV]; |
93a17b20 | 6888 | return o; |
ed6116ce | 6889 | } |
79072805 LW |
6890 | return newUNOP(OP_RV2SV, 0, scalar(o)); |
6891 | } | |
6892 | ||
61b743bb DM |
6893 | /* Check routines. See the comments at the top of this file for details |
6894 | * on when these are called */ | |
79072805 LW |
6895 | |
6896 | OP * | |
cea2e8a9 | 6897 | Perl_ck_anoncode(pTHX_ OP *o) |
5f05dabc | 6898 | { |
7918f24d NC |
6899 | PERL_ARGS_ASSERT_CK_ANONCODE; |
6900 | ||
dd2155a4 | 6901 | cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type); |
eb8433b7 | 6902 | if (!PL_madskills) |
1d866c12 | 6903 | cSVOPo->op_sv = NULL; |
5dc0d613 | 6904 | return o; |
5f05dabc | 6905 | } |
6906 | ||
6907 | OP * | |
cea2e8a9 | 6908 | Perl_ck_bitop(pTHX_ OP *o) |
55497cff | 6909 | { |
97aff369 | 6910 | dVAR; |
7918f24d NC |
6911 | |
6912 | PERL_ARGS_ASSERT_CK_BITOP; | |
6913 | ||
276b2a0c RGS |
6914 | #define OP_IS_NUMCOMPARE(op) \ |
6915 | ((op) == OP_LT || (op) == OP_I_LT || \ | |
6916 | (op) == OP_GT || (op) == OP_I_GT || \ | |
6917 | (op) == OP_LE || (op) == OP_I_LE || \ | |
6918 | (op) == OP_GE || (op) == OP_I_GE || \ | |
6919 | (op) == OP_EQ || (op) == OP_I_EQ || \ | |
6920 | (op) == OP_NE || (op) == OP_I_NE || \ | |
6921 | (op) == OP_NCMP || (op) == OP_I_NCMP) | |
d5ec2987 | 6922 | o->op_private = (U8)(PL_hints & HINT_INTEGER); |
2b84528b RGS |
6923 | if (!(o->op_flags & OPf_STACKED) /* Not an assignment */ |
6924 | && (o->op_type == OP_BIT_OR | |
6925 | || o->op_type == OP_BIT_AND | |
6926 | || o->op_type == OP_BIT_XOR)) | |
276b2a0c | 6927 | { |
1df70142 AL |
6928 | const OP * const left = cBINOPo->op_first; |
6929 | const OP * const right = left->op_sibling; | |
96a925ab YST |
6930 | if ((OP_IS_NUMCOMPARE(left->op_type) && |
6931 | (left->op_flags & OPf_PARENS) == 0) || | |
6932 | (OP_IS_NUMCOMPARE(right->op_type) && | |
6933 | (right->op_flags & OPf_PARENS) == 0)) | |
a2a5de95 NC |
6934 | Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE), |
6935 | "Possible precedence problem on bitwise %c operator", | |
6936 | o->op_type == OP_BIT_OR ? '|' | |
6937 | : o->op_type == OP_BIT_AND ? '&' : '^' | |
6938 | ); | |
276b2a0c | 6939 | } |
5dc0d613 | 6940 | return o; |
55497cff | 6941 | } |
6942 | ||
6943 | OP * | |
cea2e8a9 | 6944 | Perl_ck_concat(pTHX_ OP *o) |
79072805 | 6945 | { |
0bd48802 | 6946 | const OP * const kid = cUNOPo->op_first; |
7918f24d NC |
6947 | |
6948 | PERL_ARGS_ASSERT_CK_CONCAT; | |
96a5add6 | 6949 | PERL_UNUSED_CONTEXT; |
7918f24d | 6950 | |
df91b2c5 AE |
6951 | if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) && |
6952 | !(kUNOP->op_first->op_flags & OPf_MOD)) | |
0165acc7 | 6953 | o->op_flags |= OPf_STACKED; |
11343788 | 6954 | return o; |
79072805 LW |
6955 | } |
6956 | ||
6957 | OP * | |
cea2e8a9 | 6958 | Perl_ck_spair(pTHX_ OP *o) |
79072805 | 6959 | { |
27da23d5 | 6960 | dVAR; |
7918f24d NC |
6961 | |
6962 | PERL_ARGS_ASSERT_CK_SPAIR; | |
6963 | ||
11343788 | 6964 | if (o->op_flags & OPf_KIDS) { |
79072805 | 6965 | OP* newop; |
a0d0e21e | 6966 | OP* kid; |
6867be6d | 6967 | const OPCODE type = o->op_type; |
5dc0d613 | 6968 | o = modkids(ck_fun(o), type); |
11343788 | 6969 | kid = cUNOPo->op_first; |
a0d0e21e | 6970 | newop = kUNOP->op_first->op_sibling; |
1496a290 AL |
6971 | if (newop) { |
6972 | const OPCODE type = newop->op_type; | |
6973 | if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) || | |
6974 | type == OP_PADAV || type == OP_PADHV || | |
6975 | type == OP_RV2AV || type == OP_RV2HV) | |
6976 | return o; | |
a0d0e21e | 6977 | } |
eb8433b7 NC |
6978 | #ifdef PERL_MAD |
6979 | op_getmad(kUNOP->op_first,newop,'K'); | |
6980 | #else | |
a0d0e21e | 6981 | op_free(kUNOP->op_first); |
eb8433b7 | 6982 | #endif |
a0d0e21e LW |
6983 | kUNOP->op_first = newop; |
6984 | } | |
22c35a8c | 6985 | o->op_ppaddr = PL_ppaddr[++o->op_type]; |
11343788 | 6986 | return ck_fun(o); |
a0d0e21e LW |
6987 | } |
6988 | ||
6989 | OP * | |
cea2e8a9 | 6990 | Perl_ck_delete(pTHX_ OP *o) |
a0d0e21e | 6991 | { |
7918f24d NC |
6992 | PERL_ARGS_ASSERT_CK_DELETE; |
6993 | ||
11343788 | 6994 | o = ck_fun(o); |
5dc0d613 | 6995 | o->op_private = 0; |
11343788 | 6996 | if (o->op_flags & OPf_KIDS) { |
551405c4 | 6997 | OP * const kid = cUNOPo->op_first; |
01020589 GS |
6998 | switch (kid->op_type) { |
6999 | case OP_ASLICE: | |
7000 | o->op_flags |= OPf_SPECIAL; | |
7001 | /* FALL THROUGH */ | |
7002 | case OP_HSLICE: | |
5dc0d613 | 7003 | o->op_private |= OPpSLICE; |
01020589 GS |
7004 | break; |
7005 | case OP_AELEM: | |
7006 | o->op_flags |= OPf_SPECIAL; | |
7007 | /* FALL THROUGH */ | |
7008 | case OP_HELEM: | |
7009 | break; | |
7010 | default: | |
7011 | Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice", | |
53e06cf0 | 7012 | OP_DESC(o)); |
01020589 | 7013 | } |
7332a6c4 VP |
7014 | if (kid->op_private & OPpLVAL_INTRO) |
7015 | o->op_private |= OPpLVAL_INTRO; | |
93c66552 | 7016 | op_null(kid); |
79072805 | 7017 | } |
11343788 | 7018 | return o; |
79072805 LW |
7019 | } |
7020 | ||
7021 | OP * | |
96e176bf CL |
7022 | Perl_ck_die(pTHX_ OP *o) |
7023 | { | |
7918f24d NC |
7024 | PERL_ARGS_ASSERT_CK_DIE; |
7025 | ||
96e176bf CL |
7026 | #ifdef VMS |
7027 | if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH; | |
7028 | #endif | |
7029 | return ck_fun(o); | |
7030 | } | |
7031 | ||
7032 | OP * | |
cea2e8a9 | 7033 | Perl_ck_eof(pTHX_ OP *o) |
79072805 | 7034 | { |
97aff369 | 7035 | dVAR; |
79072805 | 7036 | |
7918f24d NC |
7037 | PERL_ARGS_ASSERT_CK_EOF; |
7038 | ||
11343788 MB |
7039 | if (o->op_flags & OPf_KIDS) { |
7040 | if (cLISTOPo->op_first->op_type == OP_STUB) { | |
1d866c12 AL |
7041 | OP * const newop |
7042 | = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv)); | |
eb8433b7 NC |
7043 | #ifdef PERL_MAD |
7044 | op_getmad(o,newop,'O'); | |
7045 | #else | |
11343788 | 7046 | op_free(o); |
eb8433b7 NC |
7047 | #endif |
7048 | o = newop; | |
8990e307 | 7049 | } |
11343788 | 7050 | return ck_fun(o); |
79072805 | 7051 | } |
11343788 | 7052 | return o; |
79072805 LW |
7053 | } |
7054 | ||
7055 | OP * | |
cea2e8a9 | 7056 | Perl_ck_eval(pTHX_ OP *o) |
79072805 | 7057 | { |
27da23d5 | 7058 | dVAR; |
7918f24d NC |
7059 | |
7060 | PERL_ARGS_ASSERT_CK_EVAL; | |
7061 | ||
3280af22 | 7062 | PL_hints |= HINT_BLOCK_SCOPE; |
11343788 | 7063 | if (o->op_flags & OPf_KIDS) { |
46c461b5 | 7064 | SVOP * const kid = (SVOP*)cUNOPo->op_first; |
79072805 | 7065 | |
93a17b20 | 7066 | if (!kid) { |
11343788 | 7067 | o->op_flags &= ~OPf_KIDS; |
93c66552 | 7068 | op_null(o); |
79072805 | 7069 | } |
b14574b4 | 7070 | else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) { |
79072805 | 7071 | LOGOP *enter; |
eb8433b7 | 7072 | #ifdef PERL_MAD |
1d866c12 | 7073 | OP* const oldo = o; |
eb8433b7 | 7074 | #endif |
79072805 | 7075 | |
11343788 | 7076 | cUNOPo->op_first = 0; |
eb8433b7 | 7077 | #ifndef PERL_MAD |
11343788 | 7078 | op_free(o); |
eb8433b7 | 7079 | #endif |
79072805 | 7080 | |
b7dc083c | 7081 | NewOp(1101, enter, 1, LOGOP); |
79072805 | 7082 | enter->op_type = OP_ENTERTRY; |
22c35a8c | 7083 | enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY]; |
79072805 LW |
7084 | enter->op_private = 0; |
7085 | ||
7086 | /* establish postfix order */ | |
7087 | enter->op_next = (OP*)enter; | |
7088 | ||
2fcb4757 | 7089 | o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid); |
11343788 | 7090 | o->op_type = OP_LEAVETRY; |
22c35a8c | 7091 | o->op_ppaddr = PL_ppaddr[OP_LEAVETRY]; |
11343788 | 7092 | enter->op_other = o; |
eb8433b7 | 7093 | op_getmad(oldo,o,'O'); |
11343788 | 7094 | return o; |
79072805 | 7095 | } |
b5c19bd7 | 7096 | else { |
473986ff | 7097 | scalar((OP*)kid); |
b5c19bd7 DM |
7098 | PL_cv_has_eval = 1; |
7099 | } | |
79072805 LW |
7100 | } |
7101 | else { | |
eb8433b7 | 7102 | #ifdef PERL_MAD |
1d866c12 | 7103 | OP* const oldo = o; |
eb8433b7 | 7104 | #else |
11343788 | 7105 | op_free(o); |
eb8433b7 | 7106 | #endif |
54b9620d | 7107 | o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP()); |
eb8433b7 | 7108 | op_getmad(oldo,o,'O'); |
79072805 | 7109 | } |
3280af22 | 7110 | o->op_targ = (PADOFFSET)PL_hints; |
7168684c | 7111 | if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) { |
996c9baa VP |
7112 | /* Store a copy of %^H that pp_entereval can pick up. */ |
7113 | OP *hhop = newSVOP(OP_HINTSEVAL, 0, | |
defdfed5 | 7114 | MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv)))); |
0d863452 RH |
7115 | cUNOPo->op_first->op_sibling = hhop; |
7116 | o->op_private |= OPpEVAL_HAS_HH; | |
7117 | } | |
11343788 | 7118 | return o; |
79072805 LW |
7119 | } |
7120 | ||
7121 | OP * | |
d98f61e7 GS |
7122 | Perl_ck_exit(pTHX_ OP *o) |
7123 | { | |
7918f24d NC |
7124 | PERL_ARGS_ASSERT_CK_EXIT; |
7125 | ||
d98f61e7 | 7126 | #ifdef VMS |
551405c4 | 7127 | HV * const table = GvHV(PL_hintgv); |
d98f61e7 | 7128 | if (table) { |
a4fc7abc | 7129 | SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE); |
d98f61e7 GS |
7130 | if (svp && *svp && SvTRUE(*svp)) |
7131 | o->op_private |= OPpEXIT_VMSISH; | |
7132 | } | |
96e176bf | 7133 | if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH; |
d98f61e7 GS |
7134 | #endif |
7135 | return ck_fun(o); | |
7136 | } | |
7137 | ||
7138 | OP * | |
cea2e8a9 | 7139 | Perl_ck_exec(pTHX_ OP *o) |
79072805 | 7140 | { |
7918f24d NC |
7141 | PERL_ARGS_ASSERT_CK_EXEC; |
7142 | ||
11343788 | 7143 | if (o->op_flags & OPf_STACKED) { |
6867be6d | 7144 | OP *kid; |
11343788 MB |
7145 | o = ck_fun(o); |
7146 | kid = cUNOPo->op_first->op_sibling; | |
8990e307 | 7147 | if (kid->op_type == OP_RV2GV) |
93c66552 | 7148 | op_null(kid); |
79072805 | 7149 | } |
463ee0b2 | 7150 | else |
11343788 MB |
7151 | o = listkids(o); |
7152 | return o; | |
79072805 LW |
7153 | } |
7154 | ||
7155 | OP * | |
cea2e8a9 | 7156 | Perl_ck_exists(pTHX_ OP *o) |
5f05dabc | 7157 | { |
97aff369 | 7158 | dVAR; |
7918f24d NC |
7159 | |
7160 | PERL_ARGS_ASSERT_CK_EXISTS; | |
7161 | ||
5196be3e MB |
7162 | o = ck_fun(o); |
7163 | if (o->op_flags & OPf_KIDS) { | |
46c461b5 | 7164 | OP * const kid = cUNOPo->op_first; |
afebc493 GS |
7165 | if (kid->op_type == OP_ENTERSUB) { |
7166 | (void) ref(kid, o->op_type); | |
13765c85 DM |
7167 | if (kid->op_type != OP_RV2CV |
7168 | && !(PL_parser && PL_parser->error_count)) | |
afebc493 | 7169 | Perl_croak(aTHX_ "%s argument is not a subroutine name", |
53e06cf0 | 7170 | OP_DESC(o)); |
afebc493 GS |
7171 | o->op_private |= OPpEXISTS_SUB; |
7172 | } | |
7173 | else if (kid->op_type == OP_AELEM) | |
01020589 GS |
7174 | o->op_flags |= OPf_SPECIAL; |
7175 | else if (kid->op_type != OP_HELEM) | |
b0fdf69e | 7176 | Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine", |
53e06cf0 | 7177 | OP_DESC(o)); |
93c66552 | 7178 | op_null(kid); |
5f05dabc | 7179 | } |
5196be3e | 7180 | return o; |
5f05dabc | 7181 | } |
7182 | ||
79072805 | 7183 | OP * |
cea2e8a9 | 7184 | Perl_ck_rvconst(pTHX_ register OP *o) |
79072805 | 7185 | { |
27da23d5 | 7186 | dVAR; |
0bd48802 | 7187 | SVOP * const kid = (SVOP*)cUNOPo->op_first; |
85e6fe83 | 7188 | |
7918f24d NC |
7189 | PERL_ARGS_ASSERT_CK_RVCONST; |
7190 | ||
3280af22 | 7191 | o->op_private |= (PL_hints & HINT_STRICT_REFS); |
e26df76a NC |
7192 | if (o->op_type == OP_RV2CV) |
7193 | o->op_private &= ~1; | |
7194 | ||
79072805 | 7195 | if (kid->op_type == OP_CONST) { |
44a8e56a | 7196 | int iscv; |
7197 | GV *gv; | |
504618e9 | 7198 | SV * const kidsv = kid->op_sv; |
44a8e56a | 7199 | |
779c5bc9 GS |
7200 | /* Is it a constant from cv_const_sv()? */ |
7201 | if (SvROK(kidsv) && SvREADONLY(kidsv)) { | |
0bd48802 | 7202 | SV * const rsv = SvRV(kidsv); |
42d0e0b7 | 7203 | const svtype type = SvTYPE(rsv); |
bd61b366 | 7204 | const char *badtype = NULL; |
779c5bc9 GS |
7205 | |
7206 | switch (o->op_type) { | |
7207 | case OP_RV2SV: | |
42d0e0b7 | 7208 | if (type > SVt_PVMG) |
779c5bc9 GS |
7209 | badtype = "a SCALAR"; |
7210 | break; | |
7211 | case OP_RV2AV: | |
42d0e0b7 | 7212 | if (type != SVt_PVAV) |
779c5bc9 GS |
7213 | badtype = "an ARRAY"; |
7214 | break; | |
7215 | case OP_RV2HV: | |
42d0e0b7 | 7216 | if (type != SVt_PVHV) |
779c5bc9 | 7217 | badtype = "a HASH"; |
779c5bc9 GS |
7218 | break; |
7219 | case OP_RV2CV: | |
42d0e0b7 | 7220 | if (type != SVt_PVCV) |
779c5bc9 GS |
7221 | badtype = "a CODE"; |
7222 | break; | |
7223 | } | |
7224 | if (badtype) | |
cea2e8a9 | 7225 | Perl_croak(aTHX_ "Constant is not %s reference", badtype); |
779c5bc9 GS |
7226 | return o; |
7227 | } | |
ce10b5d1 | 7228 | if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) { |
5f66b61c | 7229 | const char *badthing; |
5dc0d613 | 7230 | switch (o->op_type) { |
44a8e56a | 7231 | case OP_RV2SV: |
7232 | badthing = "a SCALAR"; | |
7233 | break; | |
7234 | case OP_RV2AV: | |
7235 | badthing = "an ARRAY"; | |
7236 | break; | |
7237 | case OP_RV2HV: | |
7238 | badthing = "a HASH"; | |
7239 | break; | |
5f66b61c AL |
7240 | default: |
7241 | badthing = NULL; | |
7242 | break; | |
44a8e56a | 7243 | } |
7244 | if (badthing) | |
1c846c1f | 7245 | Perl_croak(aTHX_ |
95b63a38 | 7246 | "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use", |
be2597df | 7247 | SVfARG(kidsv), badthing); |
44a8e56a | 7248 | } |
93233ece CS |
7249 | /* |
7250 | * This is a little tricky. We only want to add the symbol if we | |
7251 | * didn't add it in the lexer. Otherwise we get duplicate strict | |
7252 | * warnings. But if we didn't add it in the lexer, we must at | |
7253 | * least pretend like we wanted to add it even if it existed before, | |
7254 | * or we get possible typo warnings. OPpCONST_ENTERED says | |
7255 | * whether the lexer already added THIS instance of this symbol. | |
7256 | */ | |
5196be3e | 7257 | iscv = (o->op_type == OP_RV2CV) * 2; |
93233ece | 7258 | do { |
7a5fd60d | 7259 | gv = gv_fetchsv(kidsv, |
748a9306 | 7260 | iscv | !(kid->op_private & OPpCONST_ENTERED), |
a0d0e21e LW |
7261 | iscv |
7262 | ? SVt_PVCV | |
11343788 | 7263 | : o->op_type == OP_RV2SV |
a0d0e21e | 7264 | ? SVt_PV |
11343788 | 7265 | : o->op_type == OP_RV2AV |
a0d0e21e | 7266 | ? SVt_PVAV |
11343788 | 7267 | : o->op_type == OP_RV2HV |
a0d0e21e LW |
7268 | ? SVt_PVHV |
7269 | : SVt_PVGV); | |
93233ece CS |
7270 | } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++); |
7271 | if (gv) { | |
7272 | kid->op_type = OP_GV; | |
7273 | SvREFCNT_dec(kid->op_sv); | |
350de78d | 7274 | #ifdef USE_ITHREADS |
638eceb6 | 7275 | /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */ |
350de78d | 7276 | kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP); |
dd2155a4 | 7277 | SvREFCNT_dec(PAD_SVl(kPADOP->op_padix)); |
743e66e6 | 7278 | GvIN_PAD_on(gv); |
ad64d0ec | 7279 | PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv))); |
350de78d | 7280 | #else |
b37c2d43 | 7281 | kid->op_sv = SvREFCNT_inc_simple_NN(gv); |
350de78d | 7282 | #endif |
23f1ca44 | 7283 | kid->op_private = 0; |
76cd736e | 7284 | kid->op_ppaddr = PL_ppaddr[OP_GV]; |
a0d0e21e | 7285 | } |
79072805 | 7286 | } |
11343788 | 7287 | return o; |
79072805 LW |
7288 | } |
7289 | ||
7290 | OP * | |
cea2e8a9 | 7291 | Perl_ck_ftst(pTHX_ OP *o) |
79072805 | 7292 | { |
27da23d5 | 7293 | dVAR; |
6867be6d | 7294 | const I32 type = o->op_type; |
79072805 | 7295 | |
7918f24d NC |
7296 | PERL_ARGS_ASSERT_CK_FTST; |
7297 | ||
d0dca557 | 7298 | if (o->op_flags & OPf_REF) { |
6f207bd3 | 7299 | NOOP; |
d0dca557 JD |
7300 | } |
7301 | else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) { | |
551405c4 | 7302 | SVOP * const kid = (SVOP*)cUNOPo->op_first; |
1496a290 | 7303 | const OPCODE kidtype = kid->op_type; |
79072805 | 7304 | |
1496a290 | 7305 | if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) { |
551405c4 | 7306 | OP * const newop = newGVOP(type, OPf_REF, |
f776e3cd | 7307 | gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO)); |
eb8433b7 NC |
7308 | #ifdef PERL_MAD |
7309 | op_getmad(o,newop,'O'); | |
7310 | #else | |
11343788 | 7311 | op_free(o); |
eb8433b7 | 7312 | #endif |
1d866c12 | 7313 | return newop; |
79072805 | 7314 | } |
6ecf81d6 | 7315 | if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type)) |
1af34c76 | 7316 | o->op_private |= OPpFT_ACCESS; |
ef69c8fc | 7317 | if (PL_check[kidtype] == Perl_ck_ftst |
1496a290 | 7318 | && kidtype != OP_STAT && kidtype != OP_LSTAT) |
fbb0b3b3 | 7319 | o->op_private |= OPpFT_STACKED; |
79072805 LW |
7320 | } |
7321 | else { | |
eb8433b7 | 7322 | #ifdef PERL_MAD |
1d866c12 | 7323 | OP* const oldo = o; |
eb8433b7 | 7324 | #else |
11343788 | 7325 | op_free(o); |
eb8433b7 | 7326 | #endif |
79072805 | 7327 | if (type == OP_FTTTY) |
8fde6460 | 7328 | o = newGVOP(type, OPf_REF, PL_stdingv); |
79072805 | 7329 | else |
d0dca557 | 7330 | o = newUNOP(type, 0, newDEFSVOP()); |
eb8433b7 | 7331 | op_getmad(oldo,o,'O'); |
79072805 | 7332 | } |
11343788 | 7333 | return o; |
79072805 LW |
7334 | } |
7335 | ||
7336 | OP * | |
cea2e8a9 | 7337 | Perl_ck_fun(pTHX_ OP *o) |
79072805 | 7338 | { |
97aff369 | 7339 | dVAR; |
6867be6d | 7340 | const int type = o->op_type; |
22c35a8c | 7341 | register I32 oa = PL_opargs[type] >> OASHIFT; |
aeea060c | 7342 | |
7918f24d NC |
7343 | PERL_ARGS_ASSERT_CK_FUN; |
7344 | ||
11343788 | 7345 | if (o->op_flags & OPf_STACKED) { |
79072805 LW |
7346 | if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL)) |
7347 | oa &= ~OA_OPTIONAL; | |
7348 | else | |
11343788 | 7349 | return no_fh_allowed(o); |
79072805 LW |
7350 | } |
7351 | ||
11343788 | 7352 | if (o->op_flags & OPf_KIDS) { |
6867be6d AL |
7353 | OP **tokid = &cLISTOPo->op_first; |
7354 | register OP *kid = cLISTOPo->op_first; | |
7355 | OP *sibl; | |
7356 | I32 numargs = 0; | |
7357 | ||
8990e307 | 7358 | if (kid->op_type == OP_PUSHMARK || |
155aba94 | 7359 | (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)) |
8990e307 | 7360 | { |
79072805 LW |
7361 | tokid = &kid->op_sibling; |
7362 | kid = kid->op_sibling; | |
7363 | } | |
22c35a8c | 7364 | if (!kid && PL_opargs[type] & OA_DEFGV) |
54b9620d | 7365 | *tokid = kid = newDEFSVOP(); |
79072805 LW |
7366 | |
7367 | while (oa && kid) { | |
7368 | numargs++; | |
7369 | sibl = kid->op_sibling; | |
eb8433b7 NC |
7370 | #ifdef PERL_MAD |
7371 | if (!sibl && kid->op_type == OP_STUB) { | |
7372 | numargs--; | |
7373 | break; | |
7374 | } | |
7375 | #endif | |
79072805 LW |
7376 | switch (oa & 7) { |
7377 | case OA_SCALAR: | |
62c18ce2 GS |
7378 | /* list seen where single (scalar) arg expected? */ |
7379 | if (numargs == 1 && !(oa >> 4) | |
7380 | && kid->op_type == OP_LIST && type != OP_SCALAR) | |
7381 | { | |
7382 | return too_many_arguments(o,PL_op_desc[type]); | |
7383 | } | |
79072805 LW |
7384 | scalar(kid); |
7385 | break; | |
7386 | case OA_LIST: | |
7387 | if (oa < 16) { | |
7388 | kid = 0; | |
7389 | continue; | |
7390 | } | |
7391 | else | |
7392 | list(kid); | |
7393 | break; | |
7394 | case OA_AVREF: | |
936edb8b | 7395 | if ((type == OP_PUSH || type == OP_UNSHIFT) |
a2a5de95 NC |
7396 | && !kid->op_sibling) |
7397 | Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), | |
7398 | "Useless use of %s with no values", | |
7399 | PL_op_desc[type]); | |
b2ffa427 | 7400 | |
79072805 | 7401 | if (kid->op_type == OP_CONST && |
62c18ce2 GS |
7402 | (kid->op_private & OPpCONST_BARE)) |
7403 | { | |
551405c4 | 7404 | OP * const newop = newAVREF(newGVOP(OP_GV, 0, |
f776e3cd | 7405 | gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) )); |
d1d15184 | 7406 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 NC |
7407 | "Array @%"SVf" missing the @ in argument %"IVdf" of %s()", |
7408 | SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]); | |
eb8433b7 NC |
7409 | #ifdef PERL_MAD |
7410 | op_getmad(kid,newop,'K'); | |
7411 | #else | |
79072805 | 7412 | op_free(kid); |
eb8433b7 | 7413 | #endif |
79072805 LW |
7414 | kid = newop; |
7415 | kid->op_sibling = sibl; | |
7416 | *tokid = kid; | |
7417 | } | |
8990e307 | 7418 | else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV) |
35cd451c | 7419 | bad_type(numargs, "array", PL_op_desc[type], kid); |
a0d0e21e | 7420 | mod(kid, type); |
79072805 LW |
7421 | break; |
7422 | case OA_HVREF: | |
7423 | if (kid->op_type == OP_CONST && | |
62c18ce2 GS |
7424 | (kid->op_private & OPpCONST_BARE)) |
7425 | { | |
551405c4 | 7426 | OP * const newop = newHVREF(newGVOP(OP_GV, 0, |
f776e3cd | 7427 | gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) )); |
d1d15184 | 7428 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 NC |
7429 | "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()", |
7430 | SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]); | |
eb8433b7 NC |
7431 | #ifdef PERL_MAD |
7432 | op_getmad(kid,newop,'K'); | |
7433 | #else | |
79072805 | 7434 | op_free(kid); |
eb8433b7 | 7435 | #endif |
79072805 LW |
7436 | kid = newop; |
7437 | kid->op_sibling = sibl; | |
7438 | *tokid = kid; | |
7439 | } | |
8990e307 | 7440 | else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV) |
35cd451c | 7441 | bad_type(numargs, "hash", PL_op_desc[type], kid); |
a0d0e21e | 7442 | mod(kid, type); |
79072805 LW |
7443 | break; |
7444 | case OA_CVREF: | |
7445 | { | |
551405c4 | 7446 | OP * const newop = newUNOP(OP_NULL, 0, kid); |
79072805 | 7447 | kid->op_sibling = 0; |
5983a79d | 7448 | LINKLIST(kid); |
79072805 LW |
7449 | newop->op_next = newop; |
7450 | kid = newop; | |
7451 | kid->op_sibling = sibl; | |
7452 | *tokid = kid; | |
7453 | } | |
7454 | break; | |
7455 | case OA_FILEREF: | |
c340be78 | 7456 | if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) { |
79072805 | 7457 | if (kid->op_type == OP_CONST && |
62c18ce2 GS |
7458 | (kid->op_private & OPpCONST_BARE)) |
7459 | { | |
0bd48802 | 7460 | OP * const newop = newGVOP(OP_GV, 0, |
f776e3cd | 7461 | gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO)); |
afbdacea | 7462 | if (!(o->op_private & 1) && /* if not unop */ |
8a996ce8 | 7463 | kid == cLISTOPo->op_last) |
364daeac | 7464 | cLISTOPo->op_last = newop; |
eb8433b7 NC |
7465 | #ifdef PERL_MAD |
7466 | op_getmad(kid,newop,'K'); | |
7467 | #else | |
79072805 | 7468 | op_free(kid); |
eb8433b7 | 7469 | #endif |
79072805 LW |
7470 | kid = newop; |
7471 | } | |
1ea32a52 GS |
7472 | else if (kid->op_type == OP_READLINE) { |
7473 | /* neophyte patrol: open(<FH>), close(<FH>) etc. */ | |
53e06cf0 | 7474 | bad_type(numargs, "HANDLE", OP_DESC(o), kid); |
1ea32a52 | 7475 | } |
79072805 | 7476 | else { |
35cd451c | 7477 | I32 flags = OPf_SPECIAL; |
a6c40364 | 7478 | I32 priv = 0; |
2c8ac474 GS |
7479 | PADOFFSET targ = 0; |
7480 | ||
35cd451c | 7481 | /* is this op a FH constructor? */ |
853846ea | 7482 | if (is_handle_constructor(o,numargs)) { |
bd61b366 | 7483 | const char *name = NULL; |
dd2155a4 | 7484 | STRLEN len = 0; |
2c8ac474 GS |
7485 | |
7486 | flags = 0; | |
7487 | /* Set a flag to tell rv2gv to vivify | |
853846ea NIS |
7488 | * need to "prove" flag does not mean something |
7489 | * else already - NI-S 1999/05/07 | |
2c8ac474 GS |
7490 | */ |
7491 | priv = OPpDEREF; | |
7492 | if (kid->op_type == OP_PADSV) { | |
f8503592 NC |
7493 | SV *const namesv |
7494 | = PAD_COMPNAME_SV(kid->op_targ); | |
7495 | name = SvPV_const(namesv, len); | |
2c8ac474 GS |
7496 | } |
7497 | else if (kid->op_type == OP_RV2SV | |
7498 | && kUNOP->op_first->op_type == OP_GV) | |
7499 | { | |
0bd48802 | 7500 | GV * const gv = cGVOPx_gv(kUNOP->op_first); |
2c8ac474 GS |
7501 | name = GvNAME(gv); |
7502 | len = GvNAMELEN(gv); | |
7503 | } | |
afd1915d GS |
7504 | else if (kid->op_type == OP_AELEM |
7505 | || kid->op_type == OP_HELEM) | |
7506 | { | |
735fec84 | 7507 | OP *firstop; |
551405c4 | 7508 | OP *op = ((BINOP*)kid)->op_first; |
a4fc7abc | 7509 | name = NULL; |
551405c4 | 7510 | if (op) { |
a0714e2c | 7511 | SV *tmpstr = NULL; |
551405c4 | 7512 | const char * const a = |
666ea192 JH |
7513 | kid->op_type == OP_AELEM ? |
7514 | "[]" : "{}"; | |
0c4b0a3f JH |
7515 | if (((op->op_type == OP_RV2AV) || |
7516 | (op->op_type == OP_RV2HV)) && | |
735fec84 RGS |
7517 | (firstop = ((UNOP*)op)->op_first) && |
7518 | (firstop->op_type == OP_GV)) { | |
0c4b0a3f | 7519 | /* packagevar $a[] or $h{} */ |
735fec84 | 7520 | GV * const gv = cGVOPx_gv(firstop); |
0c4b0a3f JH |
7521 | if (gv) |
7522 | tmpstr = | |
7523 | Perl_newSVpvf(aTHX_ | |
7524 | "%s%c...%c", | |
7525 | GvNAME(gv), | |
7526 | a[0], a[1]); | |
7527 | } | |
7528 | else if (op->op_type == OP_PADAV | |
7529 | || op->op_type == OP_PADHV) { | |
7530 | /* lexicalvar $a[] or $h{} */ | |
551405c4 | 7531 | const char * const padname = |
0c4b0a3f JH |
7532 | PAD_COMPNAME_PV(op->op_targ); |
7533 | if (padname) | |
7534 | tmpstr = | |
7535 | Perl_newSVpvf(aTHX_ | |
7536 | "%s%c...%c", | |
7537 | padname + 1, | |
7538 | a[0], a[1]); | |
0c4b0a3f JH |
7539 | } |
7540 | if (tmpstr) { | |
93524f2b | 7541 | name = SvPV_const(tmpstr, len); |
0c4b0a3f JH |
7542 | sv_2mortal(tmpstr); |
7543 | } | |
7544 | } | |
7545 | if (!name) { | |
7546 | name = "__ANONIO__"; | |
7547 | len = 10; | |
7548 | } | |
7549 | mod(kid, type); | |
afd1915d | 7550 | } |
2c8ac474 GS |
7551 | if (name) { |
7552 | SV *namesv; | |
7553 | targ = pad_alloc(OP_RV2GV, SVs_PADTMP); | |
dd2155a4 | 7554 | namesv = PAD_SVl(targ); |
862a34c6 | 7555 | SvUPGRADE(namesv, SVt_PV); |
2c8ac474 | 7556 | if (*name != '$') |
76f68e9b | 7557 | sv_setpvs(namesv, "$"); |
2c8ac474 GS |
7558 | sv_catpvn(namesv, name, len); |
7559 | } | |
853846ea | 7560 | } |
79072805 | 7561 | kid->op_sibling = 0; |
35cd451c | 7562 | kid = newUNOP(OP_RV2GV, flags, scalar(kid)); |
2c8ac474 GS |
7563 | kid->op_targ = targ; |
7564 | kid->op_private |= priv; | |
79072805 LW |
7565 | } |
7566 | kid->op_sibling = sibl; | |
7567 | *tokid = kid; | |
7568 | } | |
7569 | scalar(kid); | |
7570 | break; | |
7571 | case OA_SCALARREF: | |
a0d0e21e | 7572 | mod(scalar(kid), type); |
79072805 LW |
7573 | break; |
7574 | } | |
7575 | oa >>= 4; | |
7576 | tokid = &kid->op_sibling; | |
7577 | kid = kid->op_sibling; | |
7578 | } | |
eb8433b7 NC |
7579 | #ifdef PERL_MAD |
7580 | if (kid && kid->op_type != OP_STUB) | |
7581 | return too_many_arguments(o,OP_DESC(o)); | |
7582 | o->op_private |= numargs; | |
7583 | #else | |
7584 | /* FIXME - should the numargs move as for the PERL_MAD case? */ | |
11343788 | 7585 | o->op_private |= numargs; |
79072805 | 7586 | if (kid) |
53e06cf0 | 7587 | return too_many_arguments(o,OP_DESC(o)); |
eb8433b7 | 7588 | #endif |
11343788 | 7589 | listkids(o); |
79072805 | 7590 | } |
22c35a8c | 7591 | else if (PL_opargs[type] & OA_DEFGV) { |
c56915e3 | 7592 | #ifdef PERL_MAD |
c7fe699d | 7593 | OP *newop = newUNOP(type, 0, newDEFSVOP()); |
c56915e3 | 7594 | op_getmad(o,newop,'O'); |
c7fe699d | 7595 | return newop; |
c56915e3 | 7596 | #else |
c7fe699d | 7597 | /* Ordering of these two is important to keep f_map.t passing. */ |
11343788 | 7598 | op_free(o); |
c7fe699d | 7599 | return newUNOP(type, 0, newDEFSVOP()); |
c56915e3 | 7600 | #endif |
a0d0e21e LW |
7601 | } |
7602 | ||
79072805 LW |
7603 | if (oa) { |
7604 | while (oa & OA_OPTIONAL) | |
7605 | oa >>= 4; | |
7606 | if (oa && oa != OA_LIST) | |
53e06cf0 | 7607 | return too_few_arguments(o,OP_DESC(o)); |
79072805 | 7608 | } |
11343788 | 7609 | return o; |
79072805 LW |
7610 | } |
7611 | ||
7612 | OP * | |
cea2e8a9 | 7613 | Perl_ck_glob(pTHX_ OP *o) |
79072805 | 7614 | { |
27da23d5 | 7615 | dVAR; |
fb73857a | 7616 | GV *gv; |
7617 | ||
7918f24d NC |
7618 | PERL_ARGS_ASSERT_CK_GLOB; |
7619 | ||
649da076 | 7620 | o = ck_fun(o); |
1f2bfc8a | 7621 | if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling) |
2fcb4757 | 7622 | op_append_elem(OP_GLOB, o, newDEFSVOP()); |
fb73857a | 7623 | |
fafc274c | 7624 | if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV)) |
b9f751c0 GS |
7625 | && GvCVu(gv) && GvIMPORTED_CV(gv))) |
7626 | { | |
5c1737d1 | 7627 | gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV); |
b9f751c0 | 7628 | } |
b1cb66bf | 7629 | |
52bb0670 | 7630 | #if !defined(PERL_EXTERNAL_GLOB) |
72b16652 | 7631 | /* XXX this can be tightened up and made more failsafe. */ |
f444d496 | 7632 | if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) { |
7d3fb230 | 7633 | GV *glob_gv; |
72b16652 | 7634 | ENTER; |
00ca71c1 | 7635 | Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT, |
a0714e2c | 7636 | newSVpvs("File::Glob"), NULL, NULL, NULL); |
4984aa34 FC |
7637 | if((glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV))) { |
7638 | gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV); | |
7639 | GvCV(gv) = GvCV(glob_gv); | |
7640 | SvREFCNT_inc_void(MUTABLE_SV(GvCV(gv))); | |
7641 | GvIMPORTED_CV_on(gv); | |
7642 | } | |
72b16652 GS |
7643 | LEAVE; |
7644 | } | |
52bb0670 | 7645 | #endif /* PERL_EXTERNAL_GLOB */ |
72b16652 | 7646 | |
b9f751c0 | 7647 | if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) { |
2fcb4757 | 7648 | op_append_elem(OP_GLOB, o, |
80252599 | 7649 | newSVOP(OP_CONST, 0, newSViv(PL_glob_index++))); |
1f2bfc8a | 7650 | o->op_type = OP_LIST; |
22c35a8c | 7651 | o->op_ppaddr = PL_ppaddr[OP_LIST]; |
1f2bfc8a | 7652 | cLISTOPo->op_first->op_type = OP_PUSHMARK; |
22c35a8c | 7653 | cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK]; |
ad33f57d | 7654 | cLISTOPo->op_first->op_targ = 0; |
1f2bfc8a | 7655 | o = newUNOP(OP_ENTERSUB, OPf_STACKED, |
2fcb4757 | 7656 | op_append_elem(OP_LIST, o, |
1f2bfc8a MB |
7657 | scalar(newUNOP(OP_RV2CV, 0, |
7658 | newGVOP(OP_GV, 0, gv))))); | |
d58bf5aa MB |
7659 | o = newUNOP(OP_NULL, 0, ck_subr(o)); |
7660 | o->op_targ = OP_GLOB; /* hint at what it used to be */ | |
7661 | return o; | |
b1cb66bf | 7662 | } |
7663 | gv = newGVgen("main"); | |
a0d0e21e | 7664 | gv_IOadd(gv); |
2fcb4757 | 7665 | op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv)); |
11343788 | 7666 | scalarkids(o); |
649da076 | 7667 | return o; |
79072805 LW |
7668 | } |
7669 | ||
7670 | OP * | |
cea2e8a9 | 7671 | Perl_ck_grep(pTHX_ OP *o) |
79072805 | 7672 | { |
27da23d5 | 7673 | dVAR; |
03ca120d | 7674 | LOGOP *gwop = NULL; |
79072805 | 7675 | OP *kid; |
6867be6d | 7676 | const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE; |
9f7d9405 | 7677 | PADOFFSET offset; |
79072805 | 7678 | |
7918f24d NC |
7679 | PERL_ARGS_ASSERT_CK_GREP; |
7680 | ||
22c35a8c | 7681 | o->op_ppaddr = PL_ppaddr[OP_GREPSTART]; |
13765c85 | 7682 | /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */ |
aeea060c | 7683 | |
11343788 | 7684 | if (o->op_flags & OPf_STACKED) { |
a0d0e21e | 7685 | OP* k; |
11343788 | 7686 | o = ck_sort(o); |
f6435df3 GG |
7687 | kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first; |
7688 | if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE) | |
7689 | return no_fh_allowed(o); | |
7690 | for (k = kid; k; k = k->op_next) { | |
a0d0e21e LW |
7691 | kid = k; |
7692 | } | |
03ca120d | 7693 | NewOp(1101, gwop, 1, LOGOP); |
a0d0e21e | 7694 | kid->op_next = (OP*)gwop; |
11343788 | 7695 | o->op_flags &= ~OPf_STACKED; |
93a17b20 | 7696 | } |
11343788 | 7697 | kid = cLISTOPo->op_first->op_sibling; |
a0d0e21e LW |
7698 | if (type == OP_MAPWHILE) |
7699 | list(kid); | |
7700 | else | |
7701 | scalar(kid); | |
11343788 | 7702 | o = ck_fun(o); |
13765c85 | 7703 | if (PL_parser && PL_parser->error_count) |
11343788 | 7704 | return o; |
aeea060c | 7705 | kid = cLISTOPo->op_first->op_sibling; |
79072805 | 7706 | if (kid->op_type != OP_NULL) |
cea2e8a9 | 7707 | Perl_croak(aTHX_ "panic: ck_grep"); |
79072805 LW |
7708 | kid = kUNOP->op_first; |
7709 | ||
03ca120d MHM |
7710 | if (!gwop) |
7711 | NewOp(1101, gwop, 1, LOGOP); | |
a0d0e21e | 7712 | gwop->op_type = type; |
22c35a8c | 7713 | gwop->op_ppaddr = PL_ppaddr[type]; |
11343788 | 7714 | gwop->op_first = listkids(o); |
79072805 | 7715 | gwop->op_flags |= OPf_KIDS; |
79072805 | 7716 | gwop->op_other = LINKLIST(kid); |
79072805 | 7717 | kid->op_next = (OP*)gwop; |
f8f98e0a | 7718 | offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0); |
00b1698f | 7719 | if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) { |
59f00321 RGS |
7720 | o->op_private = gwop->op_private = 0; |
7721 | gwop->op_targ = pad_alloc(type, SVs_PADTMP); | |
7722 | } | |
7723 | else { | |
7724 | o->op_private = gwop->op_private = OPpGREP_LEX; | |
7725 | gwop->op_targ = o->op_targ = offset; | |
7726 | } | |
79072805 | 7727 | |
11343788 | 7728 | kid = cLISTOPo->op_first->op_sibling; |
a0d0e21e | 7729 | if (!kid || !kid->op_sibling) |
53e06cf0 | 7730 | return too_few_arguments(o,OP_DESC(o)); |
a0d0e21e LW |
7731 | for (kid = kid->op_sibling; kid; kid = kid->op_sibling) |
7732 | mod(kid, OP_GREPSTART); | |
7733 | ||
79072805 LW |
7734 | return (OP*)gwop; |
7735 | } | |
7736 | ||
7737 | OP * | |
cea2e8a9 | 7738 | Perl_ck_index(pTHX_ OP *o) |
79072805 | 7739 | { |
7918f24d NC |
7740 | PERL_ARGS_ASSERT_CK_INDEX; |
7741 | ||
11343788 MB |
7742 | if (o->op_flags & OPf_KIDS) { |
7743 | OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ | |
0b71040e LW |
7744 | if (kid) |
7745 | kid = kid->op_sibling; /* get past "big" */ | |
79072805 | 7746 | if (kid && kid->op_type == OP_CONST) |
2779dcf1 | 7747 | fbm_compile(((SVOP*)kid)->op_sv, 0); |
79072805 | 7748 | } |
11343788 | 7749 | return ck_fun(o); |
79072805 LW |
7750 | } |
7751 | ||
7752 | OP * | |
cea2e8a9 | 7753 | Perl_ck_lfun(pTHX_ OP *o) |
79072805 | 7754 | { |
6867be6d | 7755 | const OPCODE type = o->op_type; |
7918f24d NC |
7756 | |
7757 | PERL_ARGS_ASSERT_CK_LFUN; | |
7758 | ||
5dc0d613 | 7759 | return modkids(ck_fun(o), type); |
79072805 LW |
7760 | } |
7761 | ||
7762 | OP * | |
cea2e8a9 | 7763 | Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */ |
69794302 | 7764 | { |
7918f24d NC |
7765 | PERL_ARGS_ASSERT_CK_DEFINED; |
7766 | ||
a2a5de95 | 7767 | if ((o->op_flags & OPf_KIDS)) { |
d0334bed GS |
7768 | switch (cUNOPo->op_first->op_type) { |
7769 | case OP_RV2AV: | |
a8739d98 JH |
7770 | /* This is needed for |
7771 | if (defined %stash::) | |
7772 | to work. Do not break Tk. | |
7773 | */ | |
1c846c1f | 7774 | break; /* Globals via GV can be undef */ |
d0334bed GS |
7775 | case OP_PADAV: |
7776 | case OP_AASSIGN: /* Is this a good idea? */ | |
d1d15184 | 7777 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 7778 | "defined(@array) is deprecated"); |
d1d15184 | 7779 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 7780 | "\t(Maybe you should just omit the defined()?)\n"); |
69794302 | 7781 | break; |
d0334bed GS |
7782 | case OP_RV2HV: |
7783 | case OP_PADHV: | |
d1d15184 | 7784 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 7785 | "defined(%%hash) is deprecated"); |
d1d15184 | 7786 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 7787 | "\t(Maybe you should just omit the defined()?)\n"); |
d0334bed GS |
7788 | break; |
7789 | default: | |
7790 | /* no warning */ | |
7791 | break; | |
7792 | } | |
69794302 MJD |
7793 | } |
7794 | return ck_rfun(o); | |
7795 | } | |
7796 | ||
7797 | OP * | |
e4b7ebf3 RGS |
7798 | Perl_ck_readline(pTHX_ OP *o) |
7799 | { | |
7918f24d NC |
7800 | PERL_ARGS_ASSERT_CK_READLINE; |
7801 | ||
e4b7ebf3 RGS |
7802 | if (!(o->op_flags & OPf_KIDS)) { |
7803 | OP * const newop | |
7804 | = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv)); | |
7805 | #ifdef PERL_MAD | |
7806 | op_getmad(o,newop,'O'); | |
7807 | #else | |
7808 | op_free(o); | |
7809 | #endif | |
7810 | return newop; | |
7811 | } | |
7812 | return o; | |
7813 | } | |
7814 | ||
7815 | OP * | |
cea2e8a9 | 7816 | Perl_ck_rfun(pTHX_ OP *o) |
8990e307 | 7817 | { |
6867be6d | 7818 | const OPCODE type = o->op_type; |
7918f24d NC |
7819 | |
7820 | PERL_ARGS_ASSERT_CK_RFUN; | |
7821 | ||
5dc0d613 | 7822 | return refkids(ck_fun(o), type); |
8990e307 LW |
7823 | } |
7824 | ||
7825 | OP * | |
cea2e8a9 | 7826 | Perl_ck_listiob(pTHX_ OP *o) |
79072805 LW |
7827 | { |
7828 | register OP *kid; | |
aeea060c | 7829 | |
7918f24d NC |
7830 | PERL_ARGS_ASSERT_CK_LISTIOB; |
7831 | ||
11343788 | 7832 | kid = cLISTOPo->op_first; |
79072805 | 7833 | if (!kid) { |
11343788 MB |
7834 | o = force_list(o); |
7835 | kid = cLISTOPo->op_first; | |
79072805 LW |
7836 | } |
7837 | if (kid->op_type == OP_PUSHMARK) | |
7838 | kid = kid->op_sibling; | |
11343788 | 7839 | if (kid && o->op_flags & OPf_STACKED) |
79072805 LW |
7840 | kid = kid->op_sibling; |
7841 | else if (kid && !kid->op_sibling) { /* print HANDLE; */ | |
7842 | if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) { | |
11343788 | 7843 | o->op_flags |= OPf_STACKED; /* make it a filehandle */ |
748a9306 | 7844 | kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid)); |
11343788 MB |
7845 | cLISTOPo->op_first->op_sibling = kid; |
7846 | cLISTOPo->op_last = kid; | |
79072805 LW |
7847 | kid = kid->op_sibling; |
7848 | } | |
7849 | } | |
b2ffa427 | 7850 | |
79072805 | 7851 | if (!kid) |
2fcb4757 | 7852 | op_append_elem(o->op_type, o, newDEFSVOP()); |
79072805 | 7853 | |
2de3dbcc | 7854 | return listkids(o); |
bbce6d69 | 7855 | } |
7856 | ||
7857 | OP * | |
0d863452 RH |
7858 | Perl_ck_smartmatch(pTHX_ OP *o) |
7859 | { | |
97aff369 | 7860 | dVAR; |
a4e74480 | 7861 | PERL_ARGS_ASSERT_CK_SMARTMATCH; |
0d863452 RH |
7862 | if (0 == (o->op_flags & OPf_SPECIAL)) { |
7863 | OP *first = cBINOPo->op_first; | |
7864 | OP *second = first->op_sibling; | |
7865 | ||
7866 | /* Implicitly take a reference to an array or hash */ | |
5f66b61c | 7867 | first->op_sibling = NULL; |
0d863452 RH |
7868 | first = cBINOPo->op_first = ref_array_or_hash(first); |
7869 | second = first->op_sibling = ref_array_or_hash(second); | |
7870 | ||
7871 | /* Implicitly take a reference to a regular expression */ | |
7872 | if (first->op_type == OP_MATCH) { | |
7873 | first->op_type = OP_QR; | |
7874 | first->op_ppaddr = PL_ppaddr[OP_QR]; | |
7875 | } | |
7876 | if (second->op_type == OP_MATCH) { | |
7877 | second->op_type = OP_QR; | |
7878 | second->op_ppaddr = PL_ppaddr[OP_QR]; | |
7879 | } | |
7880 | } | |
7881 | ||
7882 | return o; | |
7883 | } | |
7884 | ||
7885 | ||
7886 | OP * | |
b162f9ea IZ |
7887 | Perl_ck_sassign(pTHX_ OP *o) |
7888 | { | |
3088bf26 | 7889 | dVAR; |
1496a290 | 7890 | OP * const kid = cLISTOPo->op_first; |
7918f24d NC |
7891 | |
7892 | PERL_ARGS_ASSERT_CK_SASSIGN; | |
7893 | ||
b162f9ea IZ |
7894 | /* has a disposable target? */ |
7895 | if ((PL_opargs[kid->op_type] & OA_TARGLEX) | |
6b66af17 GS |
7896 | && !(kid->op_flags & OPf_STACKED) |
7897 | /* Cannot steal the second time! */ | |
1b438339 GG |
7898 | && !(kid->op_private & OPpTARGET_MY) |
7899 | /* Keep the full thing for madskills */ | |
7900 | && !PL_madskills | |
7901 | ) | |
b162f9ea | 7902 | { |
551405c4 | 7903 | OP * const kkid = kid->op_sibling; |
b162f9ea IZ |
7904 | |
7905 | /* Can just relocate the target. */ | |
2c2d71f5 JH |
7906 | if (kkid && kkid->op_type == OP_PADSV |
7907 | && !(kkid->op_private & OPpLVAL_INTRO)) | |
7908 | { | |
b162f9ea | 7909 | kid->op_targ = kkid->op_targ; |
743e66e6 | 7910 | kkid->op_targ = 0; |
b162f9ea IZ |
7911 | /* Now we do not need PADSV and SASSIGN. */ |
7912 | kid->op_sibling = o->op_sibling; /* NULL */ | |
7913 | cLISTOPo->op_first = NULL; | |
7914 | op_free(o); | |
7915 | op_free(kkid); | |
7916 | kid->op_private |= OPpTARGET_MY; /* Used for context settings */ | |
7917 | return kid; | |
7918 | } | |
7919 | } | |
c5917253 NC |
7920 | if (kid->op_sibling) { |
7921 | OP *kkid = kid->op_sibling; | |
7922 | if (kkid->op_type == OP_PADSV | |
7923 | && (kkid->op_private & OPpLVAL_INTRO) | |
7924 | && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) { | |
7925 | const PADOFFSET target = kkid->op_targ; | |
7926 | OP *const other = newOP(OP_PADSV, | |
7927 | kkid->op_flags | |
7928 | | ((kkid->op_private & ~OPpLVAL_INTRO) << 8)); | |
7929 | OP *const first = newOP(OP_NULL, 0); | |
7930 | OP *const nullop = newCONDOP(0, first, o, other); | |
7931 | OP *const condop = first->op_next; | |
7932 | /* hijacking PADSTALE for uninitialized state variables */ | |
7933 | SvPADSTALE_on(PAD_SVl(target)); | |
7934 | ||
7935 | condop->op_type = OP_ONCE; | |
7936 | condop->op_ppaddr = PL_ppaddr[OP_ONCE]; | |
7937 | condop->op_targ = target; | |
7938 | other->op_targ = target; | |
7939 | ||
95562366 NC |
7940 | /* Because we change the type of the op here, we will skip the |
7941 | assinment binop->op_last = binop->op_first->op_sibling; at the | |
7942 | end of Perl_newBINOP(). So need to do it here. */ | |
7943 | cBINOPo->op_last = cBINOPo->op_first->op_sibling; | |
7944 | ||
c5917253 NC |
7945 | return nullop; |
7946 | } | |
7947 | } | |
b162f9ea IZ |
7948 | return o; |
7949 | } | |
7950 | ||
7951 | OP * | |
cea2e8a9 | 7952 | Perl_ck_match(pTHX_ OP *o) |
79072805 | 7953 | { |
97aff369 | 7954 | dVAR; |
7918f24d NC |
7955 | |
7956 | PERL_ARGS_ASSERT_CK_MATCH; | |
7957 | ||
0d863452 | 7958 | if (o->op_type != OP_QR && PL_compcv) { |
f8f98e0a | 7959 | const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0); |
00b1698f | 7960 | if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) { |
59f00321 RGS |
7961 | o->op_targ = offset; |
7962 | o->op_private |= OPpTARGET_MY; | |
7963 | } | |
7964 | } | |
7965 | if (o->op_type == OP_MATCH || o->op_type == OP_QR) | |
7966 | o->op_private |= OPpRUNTIME; | |
11343788 | 7967 | return o; |
79072805 LW |
7968 | } |
7969 | ||
7970 | OP * | |
f5d5a27c CS |
7971 | Perl_ck_method(pTHX_ OP *o) |
7972 | { | |
551405c4 | 7973 | OP * const kid = cUNOPo->op_first; |
7918f24d NC |
7974 | |
7975 | PERL_ARGS_ASSERT_CK_METHOD; | |
7976 | ||
f5d5a27c CS |
7977 | if (kid->op_type == OP_CONST) { |
7978 | SV* sv = kSVOP->op_sv; | |
a4fc7abc AL |
7979 | const char * const method = SvPVX_const(sv); |
7980 | if (!(strchr(method, ':') || strchr(method, '\''))) { | |
f5d5a27c | 7981 | OP *cmop; |
1c846c1f | 7982 | if (!SvREADONLY(sv) || !SvFAKE(sv)) { |
a4fc7abc | 7983 | sv = newSVpvn_share(method, SvCUR(sv), 0); |
1c846c1f NIS |
7984 | } |
7985 | else { | |
a0714e2c | 7986 | kSVOP->op_sv = NULL; |
1c846c1f | 7987 | } |
f5d5a27c | 7988 | cmop = newSVOP(OP_METHOD_NAMED, 0, sv); |
eb8433b7 NC |
7989 | #ifdef PERL_MAD |
7990 | op_getmad(o,cmop,'O'); | |
7991 | #else | |
f5d5a27c | 7992 | op_free(o); |
eb8433b7 | 7993 | #endif |
f5d5a27c CS |
7994 | return cmop; |
7995 | } | |
7996 | } | |
7997 | return o; | |
7998 | } | |
7999 | ||
8000 | OP * | |
cea2e8a9 | 8001 | Perl_ck_null(pTHX_ OP *o) |
79072805 | 8002 | { |
7918f24d | 8003 | PERL_ARGS_ASSERT_CK_NULL; |
96a5add6 | 8004 | PERL_UNUSED_CONTEXT; |
11343788 | 8005 | return o; |
79072805 LW |
8006 | } |
8007 | ||
8008 | OP * | |
16fe6d59 GS |
8009 | Perl_ck_open(pTHX_ OP *o) |
8010 | { | |
97aff369 | 8011 | dVAR; |
551405c4 | 8012 | HV * const table = GvHV(PL_hintgv); |
7918f24d NC |
8013 | |
8014 | PERL_ARGS_ASSERT_CK_OPEN; | |
8015 | ||
16fe6d59 | 8016 | if (table) { |
a4fc7abc | 8017 | SV **svp = hv_fetchs(table, "open_IN", FALSE); |
16fe6d59 | 8018 | if (svp && *svp) { |
a79b25b7 VP |
8019 | STRLEN len = 0; |
8020 | const char *d = SvPV_const(*svp, len); | |
8021 | const I32 mode = mode_from_discipline(d, len); | |
16fe6d59 GS |
8022 | if (mode & O_BINARY) |
8023 | o->op_private |= OPpOPEN_IN_RAW; | |
8024 | else if (mode & O_TEXT) | |
8025 | o->op_private |= OPpOPEN_IN_CRLF; | |
8026 | } | |
8027 | ||
a4fc7abc | 8028 | svp = hv_fetchs(table, "open_OUT", FALSE); |
16fe6d59 | 8029 | if (svp && *svp) { |
a79b25b7 VP |
8030 | STRLEN len = 0; |
8031 | const char *d = SvPV_const(*svp, len); | |
8032 | const I32 mode = mode_from_discipline(d, len); | |
16fe6d59 GS |
8033 | if (mode & O_BINARY) |
8034 | o->op_private |= OPpOPEN_OUT_RAW; | |
8035 | else if (mode & O_TEXT) | |
8036 | o->op_private |= OPpOPEN_OUT_CRLF; | |
8037 | } | |
8038 | } | |
8d7403e6 RGS |
8039 | if (o->op_type == OP_BACKTICK) { |
8040 | if (!(o->op_flags & OPf_KIDS)) { | |
e4b7ebf3 RGS |
8041 | OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP()); |
8042 | #ifdef PERL_MAD | |
8043 | op_getmad(o,newop,'O'); | |
8044 | #else | |
8d7403e6 | 8045 | op_free(o); |
e4b7ebf3 RGS |
8046 | #endif |
8047 | return newop; | |
8d7403e6 | 8048 | } |
16fe6d59 | 8049 | return o; |
8d7403e6 | 8050 | } |
3b82e551 JH |
8051 | { |
8052 | /* In case of three-arg dup open remove strictness | |
8053 | * from the last arg if it is a bareword. */ | |
551405c4 AL |
8054 | OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */ |
8055 | OP * const last = cLISTOPx(o)->op_last; /* The bareword. */ | |
3b82e551 | 8056 | OP *oa; |
b15aece3 | 8057 | const char *mode; |
3b82e551 JH |
8058 | |
8059 | if ((last->op_type == OP_CONST) && /* The bareword. */ | |
8060 | (last->op_private & OPpCONST_BARE) && | |
8061 | (last->op_private & OPpCONST_STRICT) && | |
8062 | (oa = first->op_sibling) && /* The fh. */ | |
8063 | (oa = oa->op_sibling) && /* The mode. */ | |
ea1d064a | 8064 | (oa->op_type == OP_CONST) && |
3b82e551 | 8065 | SvPOK(((SVOP*)oa)->op_sv) && |
b15aece3 | 8066 | (mode = SvPVX_const(((SVOP*)oa)->op_sv)) && |
3b82e551 JH |
8067 | mode[0] == '>' && mode[1] == '&' && /* A dup open. */ |
8068 | (last == oa->op_sibling)) /* The bareword. */ | |
8069 | last->op_private &= ~OPpCONST_STRICT; | |
8070 | } | |
16fe6d59 GS |
8071 | return ck_fun(o); |
8072 | } | |
8073 | ||
8074 | OP * | |
cea2e8a9 | 8075 | Perl_ck_repeat(pTHX_ OP *o) |
79072805 | 8076 | { |
7918f24d NC |
8077 | PERL_ARGS_ASSERT_CK_REPEAT; |
8078 | ||
11343788 MB |
8079 | if (cBINOPo->op_first->op_flags & OPf_PARENS) { |
8080 | o->op_private |= OPpREPEAT_DOLIST; | |
8081 | cBINOPo->op_first = force_list(cBINOPo->op_first); | |
79072805 LW |
8082 | } |
8083 | else | |
11343788 MB |
8084 | scalar(o); |
8085 | return o; | |
79072805 LW |
8086 | } |
8087 | ||
8088 | OP * | |
cea2e8a9 | 8089 | Perl_ck_require(pTHX_ OP *o) |
8990e307 | 8090 | { |
97aff369 | 8091 | dVAR; |
a0714e2c | 8092 | GV* gv = NULL; |
ec4ab249 | 8093 | |
7918f24d NC |
8094 | PERL_ARGS_ASSERT_CK_REQUIRE; |
8095 | ||
11343788 | 8096 | if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */ |
551405c4 | 8097 | SVOP * const kid = (SVOP*)cUNOPo->op_first; |
8990e307 LW |
8098 | |
8099 | if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) { | |
551405c4 | 8100 | SV * const sv = kid->op_sv; |
5c144d81 | 8101 | U32 was_readonly = SvREADONLY(sv); |
8990e307 | 8102 | char *s; |
cfff9797 NC |
8103 | STRLEN len; |
8104 | const char *end; | |
5c144d81 NC |
8105 | |
8106 | if (was_readonly) { | |
8107 | if (SvFAKE(sv)) { | |
8108 | sv_force_normal_flags(sv, 0); | |
8109 | assert(!SvREADONLY(sv)); | |
8110 | was_readonly = 0; | |
8111 | } else { | |
8112 | SvREADONLY_off(sv); | |
8113 | } | |
8114 | } | |
8115 | ||
cfff9797 NC |
8116 | s = SvPVX(sv); |
8117 | len = SvCUR(sv); | |
8118 | end = s + len; | |
8119 | for (; s < end; s++) { | |
a0d0e21e LW |
8120 | if (*s == ':' && s[1] == ':') { |
8121 | *s = '/'; | |
5c6b2528 | 8122 | Move(s+2, s+1, end - s - 1, char); |
cfff9797 | 8123 | --end; |
a0d0e21e | 8124 | } |
8990e307 | 8125 | } |
cfff9797 | 8126 | SvEND_set(sv, end); |
396482e1 | 8127 | sv_catpvs(sv, ".pm"); |
5c144d81 | 8128 | SvFLAGS(sv) |= was_readonly; |
8990e307 LW |
8129 | } |
8130 | } | |
ec4ab249 | 8131 | |
a72a1c8b RGS |
8132 | if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */ |
8133 | /* handle override, if any */ | |
fafc274c | 8134 | gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV); |
d6a985f2 | 8135 | if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) { |
a4fc7abc | 8136 | GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE); |
a0714e2c | 8137 | gv = gvp ? *gvp : NULL; |
d6a985f2 | 8138 | } |
a72a1c8b | 8139 | } |
ec4ab249 | 8140 | |
b9f751c0 | 8141 | if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) { |
551405c4 | 8142 | OP * const kid = cUNOPo->op_first; |
f11453cb NC |
8143 | OP * newop; |
8144 | ||
ec4ab249 | 8145 | cUNOPo->op_first = 0; |
f11453cb | 8146 | #ifndef PERL_MAD |
ec4ab249 | 8147 | op_free(o); |
eb8433b7 | 8148 | #endif |
f11453cb | 8149 | newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED, |
2fcb4757 | 8150 | op_append_elem(OP_LIST, kid, |
f11453cb NC |
8151 | scalar(newUNOP(OP_RV2CV, 0, |
8152 | newGVOP(OP_GV, 0, | |
8153 | gv)))))); | |
8154 | op_getmad(o,newop,'O'); | |
eb8433b7 | 8155 | return newop; |
ec4ab249 GA |
8156 | } |
8157 | ||
021f53de | 8158 | return scalar(ck_fun(o)); |
8990e307 LW |
8159 | } |
8160 | ||
78f9721b SM |
8161 | OP * |
8162 | Perl_ck_return(pTHX_ OP *o) | |
8163 | { | |
97aff369 | 8164 | dVAR; |
e91684bf | 8165 | OP *kid; |
7918f24d NC |
8166 | |
8167 | PERL_ARGS_ASSERT_CK_RETURN; | |
8168 | ||
e91684bf | 8169 | kid = cLISTOPo->op_first->op_sibling; |
78f9721b | 8170 | if (CvLVALUE(PL_compcv)) { |
e91684bf | 8171 | for (; kid; kid = kid->op_sibling) |
78f9721b | 8172 | mod(kid, OP_LEAVESUBLV); |
e91684bf VP |
8173 | } else { |
8174 | for (; kid; kid = kid->op_sibling) | |
8175 | if ((kid->op_type == OP_NULL) | |
1c8a4223 | 8176 | && ((kid->op_flags & (OPf_SPECIAL|OPf_KIDS)) == (OPf_SPECIAL|OPf_KIDS))) { |
e91684bf | 8177 | /* This is a do block */ |
1c8a4223 VP |
8178 | OP *op = kUNOP->op_first; |
8179 | if (op->op_type == OP_LEAVE && op->op_flags & OPf_KIDS) { | |
8180 | op = cUNOPx(op)->op_first; | |
8181 | assert(op->op_type == OP_ENTER && !(op->op_flags & OPf_SPECIAL)); | |
8182 | /* Force the use of the caller's context */ | |
8183 | op->op_flags |= OPf_SPECIAL; | |
8184 | } | |
e91684bf | 8185 | } |
78f9721b | 8186 | } |
e91684bf | 8187 | |
78f9721b SM |
8188 | return o; |
8189 | } | |
8190 | ||
79072805 | 8191 | OP * |
cea2e8a9 | 8192 | Perl_ck_select(pTHX_ OP *o) |
79072805 | 8193 | { |
27da23d5 | 8194 | dVAR; |
c07a80fd | 8195 | OP* kid; |
7918f24d NC |
8196 | |
8197 | PERL_ARGS_ASSERT_CK_SELECT; | |
8198 | ||
11343788 MB |
8199 | if (o->op_flags & OPf_KIDS) { |
8200 | kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ | |
2304df62 | 8201 | if (kid && kid->op_sibling) { |
11343788 | 8202 | o->op_type = OP_SSELECT; |
22c35a8c | 8203 | o->op_ppaddr = PL_ppaddr[OP_SSELECT]; |
11343788 MB |
8204 | o = ck_fun(o); |
8205 | return fold_constants(o); | |
79072805 LW |
8206 | } |
8207 | } | |
11343788 MB |
8208 | o = ck_fun(o); |
8209 | kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ | |
c07a80fd | 8210 | if (kid && kid->op_type == OP_RV2GV) |
8211 | kid->op_private &= ~HINT_STRICT_REFS; | |
11343788 | 8212 | return o; |
79072805 LW |
8213 | } |
8214 | ||
8215 | OP * | |
cea2e8a9 | 8216 | Perl_ck_shift(pTHX_ OP *o) |
79072805 | 8217 | { |
97aff369 | 8218 | dVAR; |
6867be6d | 8219 | const I32 type = o->op_type; |
79072805 | 8220 | |
7918f24d NC |
8221 | PERL_ARGS_ASSERT_CK_SHIFT; |
8222 | ||
11343788 | 8223 | if (!(o->op_flags & OPf_KIDS)) { |
538f5756 RZ |
8224 | OP *argop; |
8225 | ||
8226 | if (!CvUNIQUE(PL_compcv)) { | |
8227 | o->op_flags |= OPf_SPECIAL; | |
8228 | return o; | |
8229 | } | |
8230 | ||
8231 | argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv))); | |
eb8433b7 | 8232 | #ifdef PERL_MAD |
790427a5 DM |
8233 | { |
8234 | OP * const oldo = o; | |
8235 | o = newUNOP(type, 0, scalar(argop)); | |
8236 | op_getmad(oldo,o,'O'); | |
8237 | return o; | |
8238 | } | |
eb8433b7 | 8239 | #else |
821005df | 8240 | op_free(o); |
6d4ff0d2 | 8241 | return newUNOP(type, 0, scalar(argop)); |
eb8433b7 | 8242 | #endif |
79072805 | 8243 | } |
11343788 | 8244 | return scalar(modkids(ck_fun(o), type)); |
79072805 LW |
8245 | } |
8246 | ||
8247 | OP * | |
cea2e8a9 | 8248 | Perl_ck_sort(pTHX_ OP *o) |
79072805 | 8249 | { |
97aff369 | 8250 | dVAR; |
8e3f9bdf | 8251 | OP *firstkid; |
bbce6d69 | 8252 | |
7918f24d NC |
8253 | PERL_ARGS_ASSERT_CK_SORT; |
8254 | ||
1496a290 | 8255 | if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) { |
a4fc7abc | 8256 | HV * const hinthv = GvHV(PL_hintgv); |
7b9ef140 | 8257 | if (hinthv) { |
a4fc7abc | 8258 | SV ** const svp = hv_fetchs(hinthv, "sort", FALSE); |
7b9ef140 | 8259 | if (svp) { |
a4fc7abc | 8260 | const I32 sorthints = (I32)SvIV(*svp); |
7b9ef140 RH |
8261 | if ((sorthints & HINT_SORT_QUICKSORT) != 0) |
8262 | o->op_private |= OPpSORT_QSORT; | |
8263 | if ((sorthints & HINT_SORT_STABLE) != 0) | |
8264 | o->op_private |= OPpSORT_STABLE; | |
8265 | } | |
8266 | } | |
8267 | } | |
8268 | ||
9ea6e965 | 8269 | if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED) |
51a19bc0 | 8270 | simplify_sort(o); |
8e3f9bdf GS |
8271 | firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ |
8272 | if (o->op_flags & OPf_STACKED) { /* may have been cleared */ | |
9c5ffd7c | 8273 | OP *k = NULL; |
8e3f9bdf | 8274 | OP *kid = cUNOPx(firstkid)->op_first; /* get past null */ |
79072805 | 8275 | |
463ee0b2 | 8276 | if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) { |
5983a79d | 8277 | LINKLIST(kid); |
463ee0b2 LW |
8278 | if (kid->op_type == OP_SCOPE) { |
8279 | k = kid->op_next; | |
8280 | kid->op_next = 0; | |
79072805 | 8281 | } |
463ee0b2 | 8282 | else if (kid->op_type == OP_LEAVE) { |
11343788 | 8283 | if (o->op_type == OP_SORT) { |
93c66552 | 8284 | op_null(kid); /* wipe out leave */ |
748a9306 | 8285 | kid->op_next = kid; |
463ee0b2 | 8286 | |
748a9306 LW |
8287 | for (k = kLISTOP->op_first->op_next; k; k = k->op_next) { |
8288 | if (k->op_next == kid) | |
8289 | k->op_next = 0; | |
71a29c3c GS |
8290 | /* don't descend into loops */ |
8291 | else if (k->op_type == OP_ENTERLOOP | |
8292 | || k->op_type == OP_ENTERITER) | |
8293 | { | |
8294 | k = cLOOPx(k)->op_lastop; | |
8295 | } | |
748a9306 | 8296 | } |
463ee0b2 | 8297 | } |
748a9306 LW |
8298 | else |
8299 | kid->op_next = 0; /* just disconnect the leave */ | |
a0d0e21e | 8300 | k = kLISTOP->op_first; |
463ee0b2 | 8301 | } |
a2efc822 | 8302 | CALL_PEEP(k); |
a0d0e21e | 8303 | |
8e3f9bdf GS |
8304 | kid = firstkid; |
8305 | if (o->op_type == OP_SORT) { | |
8306 | /* provide scalar context for comparison function/block */ | |
8307 | kid = scalar(kid); | |
a0d0e21e | 8308 | kid->op_next = kid; |
8e3f9bdf | 8309 | } |
a0d0e21e LW |
8310 | else |
8311 | kid->op_next = k; | |
11343788 | 8312 | o->op_flags |= OPf_SPECIAL; |
79072805 | 8313 | } |
c6e96bcb | 8314 | else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV) |
93c66552 | 8315 | op_null(firstkid); |
8e3f9bdf GS |
8316 | |
8317 | firstkid = firstkid->op_sibling; | |
79072805 | 8318 | } |
bbce6d69 | 8319 | |
8e3f9bdf GS |
8320 | /* provide list context for arguments */ |
8321 | if (o->op_type == OP_SORT) | |
8322 | list(firstkid); | |
8323 | ||
11343788 | 8324 | return o; |
79072805 | 8325 | } |
bda4119b GS |
8326 | |
8327 | STATIC void | |
cea2e8a9 | 8328 | S_simplify_sort(pTHX_ OP *o) |
9c007264 | 8329 | { |
97aff369 | 8330 | dVAR; |
9c007264 JH |
8331 | register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ |
8332 | OP *k; | |
eb209983 | 8333 | int descending; |
350de78d | 8334 | GV *gv; |
770526c1 | 8335 | const char *gvname; |
7918f24d NC |
8336 | |
8337 | PERL_ARGS_ASSERT_SIMPLIFY_SORT; | |
8338 | ||
9c007264 JH |
8339 | if (!(o->op_flags & OPf_STACKED)) |
8340 | return; | |
fafc274c NC |
8341 | GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV)); |
8342 | GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV)); | |
82092f1d | 8343 | kid = kUNOP->op_first; /* get past null */ |
9c007264 JH |
8344 | if (kid->op_type != OP_SCOPE) |
8345 | return; | |
8346 | kid = kLISTOP->op_last; /* get past scope */ | |
8347 | switch(kid->op_type) { | |
8348 | case OP_NCMP: | |
8349 | case OP_I_NCMP: | |
8350 | case OP_SCMP: | |
8351 | break; | |
8352 | default: | |
8353 | return; | |
8354 | } | |
8355 | k = kid; /* remember this node*/ | |
8356 | if (kBINOP->op_first->op_type != OP_RV2SV) | |
8357 | return; | |
8358 | kid = kBINOP->op_first; /* get past cmp */ | |
8359 | if (kUNOP->op_first->op_type != OP_GV) | |
8360 | return; | |
8361 | kid = kUNOP->op_first; /* get past rv2sv */ | |
638eceb6 | 8362 | gv = kGVOP_gv; |
350de78d | 8363 | if (GvSTASH(gv) != PL_curstash) |
9c007264 | 8364 | return; |
770526c1 NC |
8365 | gvname = GvNAME(gv); |
8366 | if (*gvname == 'a' && gvname[1] == '\0') | |
eb209983 | 8367 | descending = 0; |
770526c1 | 8368 | else if (*gvname == 'b' && gvname[1] == '\0') |
eb209983 | 8369 | descending = 1; |
9c007264 JH |
8370 | else |
8371 | return; | |
eb209983 | 8372 | |
9c007264 JH |
8373 | kid = k; /* back to cmp */ |
8374 | if (kBINOP->op_last->op_type != OP_RV2SV) | |
8375 | return; | |
8376 | kid = kBINOP->op_last; /* down to 2nd arg */ | |
8377 | if (kUNOP->op_first->op_type != OP_GV) | |
8378 | return; | |
8379 | kid = kUNOP->op_first; /* get past rv2sv */ | |
638eceb6 | 8380 | gv = kGVOP_gv; |
770526c1 NC |
8381 | if (GvSTASH(gv) != PL_curstash) |
8382 | return; | |
8383 | gvname = GvNAME(gv); | |
8384 | if ( descending | |
8385 | ? !(*gvname == 'a' && gvname[1] == '\0') | |
8386 | : !(*gvname == 'b' && gvname[1] == '\0')) | |
9c007264 JH |
8387 | return; |
8388 | o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL); | |
eb209983 NC |
8389 | if (descending) |
8390 | o->op_private |= OPpSORT_DESCEND; | |
9c007264 JH |
8391 | if (k->op_type == OP_NCMP) |
8392 | o->op_private |= OPpSORT_NUMERIC; | |
8393 | if (k->op_type == OP_I_NCMP) | |
8394 | o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER; | |
e507f050 SM |
8395 | kid = cLISTOPo->op_first->op_sibling; |
8396 | cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */ | |
eb8433b7 NC |
8397 | #ifdef PERL_MAD |
8398 | op_getmad(kid,o,'S'); /* then delete it */ | |
8399 | #else | |
e507f050 | 8400 | op_free(kid); /* then delete it */ |
eb8433b7 | 8401 | #endif |
9c007264 | 8402 | } |
79072805 LW |
8403 | |
8404 | OP * | |
cea2e8a9 | 8405 | Perl_ck_split(pTHX_ OP *o) |
79072805 | 8406 | { |
27da23d5 | 8407 | dVAR; |
79072805 | 8408 | register OP *kid; |
aeea060c | 8409 | |
7918f24d NC |
8410 | PERL_ARGS_ASSERT_CK_SPLIT; |
8411 | ||
11343788 MB |
8412 | if (o->op_flags & OPf_STACKED) |
8413 | return no_fh_allowed(o); | |
79072805 | 8414 | |
11343788 | 8415 | kid = cLISTOPo->op_first; |
8990e307 | 8416 | if (kid->op_type != OP_NULL) |
cea2e8a9 | 8417 | Perl_croak(aTHX_ "panic: ck_split"); |
8990e307 | 8418 | kid = kid->op_sibling; |
11343788 MB |
8419 | op_free(cLISTOPo->op_first); |
8420 | cLISTOPo->op_first = kid; | |
85e6fe83 | 8421 | if (!kid) { |
396482e1 | 8422 | cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" ")); |
11343788 | 8423 | cLISTOPo->op_last = kid; /* There was only one element previously */ |
85e6fe83 | 8424 | } |
79072805 | 8425 | |
de4bf5b3 | 8426 | if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) { |
551405c4 | 8427 | OP * const sibl = kid->op_sibling; |
463ee0b2 | 8428 | kid->op_sibling = 0; |
131b3ad0 | 8429 | kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0); |
11343788 MB |
8430 | if (cLISTOPo->op_first == cLISTOPo->op_last) |
8431 | cLISTOPo->op_last = kid; | |
8432 | cLISTOPo->op_first = kid; | |
79072805 LW |
8433 | kid->op_sibling = sibl; |
8434 | } | |
8435 | ||
8436 | kid->op_type = OP_PUSHRE; | |
22c35a8c | 8437 | kid->op_ppaddr = PL_ppaddr[OP_PUSHRE]; |
79072805 | 8438 | scalar(kid); |
a2a5de95 NC |
8439 | if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) { |
8440 | Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), | |
8441 | "Use of /g modifier is meaningless in split"); | |
f34840d8 | 8442 | } |
79072805 LW |
8443 | |
8444 | if (!kid->op_sibling) | |
2fcb4757 | 8445 | op_append_elem(OP_SPLIT, o, newDEFSVOP()); |
79072805 LW |
8446 | |
8447 | kid = kid->op_sibling; | |
8448 | scalar(kid); | |
8449 | ||
8450 | if (!kid->op_sibling) | |
2fcb4757 | 8451 | op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0))); |
ce3e5c45 | 8452 | assert(kid->op_sibling); |
79072805 LW |
8453 | |
8454 | kid = kid->op_sibling; | |
8455 | scalar(kid); | |
8456 | ||
8457 | if (kid->op_sibling) | |
53e06cf0 | 8458 | return too_many_arguments(o,OP_DESC(o)); |
79072805 | 8459 | |
11343788 | 8460 | return o; |
79072805 LW |
8461 | } |
8462 | ||
8463 | OP * | |
1c846c1f | 8464 | Perl_ck_join(pTHX_ OP *o) |
eb6e2d6f | 8465 | { |
551405c4 | 8466 | const OP * const kid = cLISTOPo->op_first->op_sibling; |
7918f24d NC |
8467 | |
8468 | PERL_ARGS_ASSERT_CK_JOIN; | |
8469 | ||
041457d9 DM |
8470 | if (kid && kid->op_type == OP_MATCH) { |
8471 | if (ckWARN(WARN_SYNTAX)) { | |
6867be6d | 8472 | const REGEXP *re = PM_GETRE(kPMOP); |
d2c6dc5e | 8473 | const char *pmstr = re ? RX_PRECOMP_const(re) : "STRING"; |
220fc49f | 8474 | const STRLEN len = re ? RX_PRELEN(re) : 6; |
9014280d | 8475 | Perl_warner(aTHX_ packWARN(WARN_SYNTAX), |
bcdf7404 | 8476 | "/%.*s/ should probably be written as \"%.*s\"", |
d83b45b8 | 8477 | (int)len, pmstr, (int)len, pmstr); |
eb6e2d6f GS |
8478 | } |
8479 | } | |
8480 | return ck_fun(o); | |
8481 | } | |
8482 | ||
d9088386 Z |
8483 | /* |
8484 | =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags | |
8485 | ||
8486 | Examines an op, which is expected to identify a subroutine at runtime, | |
8487 | and attempts to determine at compile time which subroutine it identifies. | |
8488 | This is normally used during Perl compilation to determine whether | |
8489 | a prototype can be applied to a function call. I<cvop> is the op | |
8490 | being considered, normally an C<rv2cv> op. A pointer to the identified | |
8491 | subroutine is returned, if it could be determined statically, and a null | |
8492 | pointer is returned if it was not possible to determine statically. | |
8493 | ||
8494 | Currently, the subroutine can be identified statically if the RV that the | |
8495 | C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op. | |
8496 | A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is | |
8497 | suitable if the constant value must be an RV pointing to a CV. Details of | |
8498 | this process may change in future versions of Perl. If the C<rv2cv> op | |
8499 | has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify | |
8500 | the subroutine statically: this flag is used to suppress compile-time | |
8501 | magic on a subroutine call, forcing it to use default runtime behaviour. | |
8502 | ||
8503 | If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling | |
8504 | of a GV reference is modified. If a GV was examined and its CV slot was | |
8505 | found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set. | |
8506 | If the op is not optimised away, and the CV slot is later populated with | |
8507 | a subroutine having a prototype, that flag eventually triggers the warning | |
8508 | "called too early to check prototype". | |
8509 | ||
8510 | If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead | |
8511 | of returning a pointer to the subroutine it returns a pointer to the | |
8512 | GV giving the most appropriate name for the subroutine in this context. | |
8513 | Normally this is just the C<CvGV> of the subroutine, but for an anonymous | |
8514 | (C<CvANON>) subroutine that is referenced through a GV it will be the | |
8515 | referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned. | |
8516 | A null pointer is returned as usual if there is no statically-determinable | |
8517 | subroutine. | |
7918f24d | 8518 | |
d9088386 Z |
8519 | =cut |
8520 | */ | |
9d88f058 | 8521 | |
d9088386 Z |
8522 | CV * |
8523 | Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags) | |
8524 | { | |
8525 | OP *rvop; | |
8526 | CV *cv; | |
8527 | GV *gv; | |
8528 | PERL_ARGS_ASSERT_RV2CV_OP_CV; | |
8529 | if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV)) | |
8530 | Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags); | |
8531 | if (cvop->op_type != OP_RV2CV) | |
8532 | return NULL; | |
8533 | if (cvop->op_private & OPpENTERSUB_AMPER) | |
8534 | return NULL; | |
8535 | if (!(cvop->op_flags & OPf_KIDS)) | |
8536 | return NULL; | |
8537 | rvop = cUNOPx(cvop)->op_first; | |
8538 | switch (rvop->op_type) { | |
8539 | case OP_GV: { | |
8540 | gv = cGVOPx_gv(rvop); | |
8541 | cv = GvCVu(gv); | |
8542 | if (!cv) { | |
8543 | if (flags & RV2CVOPCV_MARK_EARLY) | |
8544 | rvop->op_private |= OPpEARLY_CV; | |
8545 | return NULL; | |
46fc3d4c | 8546 | } |
d9088386 Z |
8547 | } break; |
8548 | case OP_CONST: { | |
8549 | SV *rv = cSVOPx_sv(rvop); | |
8550 | if (!SvROK(rv)) | |
8551 | return NULL; | |
8552 | cv = (CV*)SvRV(rv); | |
8553 | gv = NULL; | |
8554 | } break; | |
8555 | default: { | |
8556 | return NULL; | |
8557 | } break; | |
4633a7c4 | 8558 | } |
d9088386 Z |
8559 | if (SvTYPE((SV*)cv) != SVt_PVCV) |
8560 | return NULL; | |
8561 | if (flags & RV2CVOPCV_RETURN_NAME_GV) { | |
8562 | if (!CvANON(cv) || !gv) | |
8563 | gv = CvGV(cv); | |
8564 | return (CV*)gv; | |
8565 | } else { | |
8566 | return cv; | |
7a52d87a | 8567 | } |
d9088386 | 8568 | } |
9d88f058 | 8569 | |
d9088386 Z |
8570 | /* |
8571 | =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop | |
824afba1 | 8572 | |
d9088386 Z |
8573 | Performs the default fixup of the arguments part of an C<entersub> |
8574 | op tree. This consists of applying list context to each of the | |
8575 | argument ops. This is the standard treatment used on a call marked | |
8576 | with C<&>, or a method call, or a call through a subroutine reference, | |
8577 | or any other call where the callee can't be identified at compile time, | |
8578 | or a call where the callee has no prototype. | |
824afba1 | 8579 | |
d9088386 Z |
8580 | =cut |
8581 | */ | |
340458b5 | 8582 | |
d9088386 Z |
8583 | OP * |
8584 | Perl_ck_entersub_args_list(pTHX_ OP *entersubop) | |
8585 | { | |
8586 | OP *aop; | |
8587 | PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST; | |
8588 | aop = cUNOPx(entersubop)->op_first; | |
8589 | if (!aop->op_sibling) | |
8590 | aop = cUNOPx(aop)->op_first; | |
8591 | for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) { | |
8592 | if (!(PL_madskills && aop->op_type == OP_STUB)) { | |
8593 | list(aop); | |
8594 | mod(aop, OP_ENTERSUB); | |
8595 | } | |
8596 | } | |
8597 | return entersubop; | |
8598 | } | |
340458b5 | 8599 | |
d9088386 Z |
8600 | /* |
8601 | =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv | |
8602 | ||
8603 | Performs the fixup of the arguments part of an C<entersub> op tree | |
8604 | based on a subroutine prototype. This makes various modifications to | |
8605 | the argument ops, from applying context up to inserting C<refgen> ops, | |
8606 | and checking the number and syntactic types of arguments, as directed by | |
8607 | the prototype. This is the standard treatment used on a subroutine call, | |
8608 | not marked with C<&>, where the callee can be identified at compile time | |
8609 | and has a prototype. | |
8610 | ||
8611 | I<protosv> supplies the subroutine prototype to be applied to the call. | |
8612 | It may be a normal defined scalar, of which the string value will be used. | |
8613 | Alternatively, for convenience, it may be a subroutine object (a C<CV*> | |
8614 | that has been cast to C<SV*>) which has a prototype. The prototype | |
8615 | supplied, in whichever form, does not need to match the actual callee | |
8616 | referenced by the op tree. | |
8617 | ||
8618 | If the argument ops disagree with the prototype, for example by having | |
8619 | an unacceptable number of arguments, a valid op tree is returned anyway. | |
8620 | The error is reflected in the parser state, normally resulting in a single | |
8621 | exception at the top level of parsing which covers all the compilation | |
8622 | errors that occurred. In the error message, the callee is referred to | |
8623 | by the name defined by the I<namegv> parameter. | |
cbf82dd0 | 8624 | |
d9088386 Z |
8625 | =cut |
8626 | */ | |
8627 | ||
8628 | OP * | |
8629 | Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv) | |
8630 | { | |
8631 | STRLEN proto_len; | |
8632 | const char *proto, *proto_end; | |
8633 | OP *aop, *prev, *cvop; | |
8634 | int optional = 0; | |
8635 | I32 arg = 0; | |
8636 | I32 contextclass = 0; | |
8637 | const char *e = NULL; | |
8638 | PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO; | |
8639 | if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv)) | |
8640 | Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto"); | |
8641 | proto = SvPV(protosv, proto_len); | |
8642 | proto_end = proto + proto_len; | |
8643 | aop = cUNOPx(entersubop)->op_first; | |
8644 | if (!aop->op_sibling) | |
8645 | aop = cUNOPx(aop)->op_first; | |
8646 | prev = aop; | |
8647 | aop = aop->op_sibling; | |
8648 | for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ; | |
8649 | while (aop != cvop) { | |
8650 | OP* o3; | |
8651 | if (PL_madskills && aop->op_type == OP_STUB) { | |
8652 | aop = aop->op_sibling; | |
8653 | continue; | |
8654 | } | |
8655 | if (PL_madskills && aop->op_type == OP_NULL) | |
8656 | o3 = ((UNOP*)aop)->op_first; | |
8657 | else | |
8658 | o3 = aop; | |
8659 | ||
8660 | if (proto >= proto_end) | |
8661 | return too_many_arguments(entersubop, gv_ename(namegv)); | |
8662 | ||
8663 | switch (*proto) { | |
8664 | case ';': | |
8665 | optional = 1; | |
8666 | proto++; | |
8667 | continue; | |
8668 | case '_': | |
8669 | /* _ must be at the end */ | |
8670 | if (proto[1] && proto[1] != ';') | |
8671 | goto oops; | |
8672 | case '$': | |
8673 | proto++; | |
8674 | arg++; | |
8675 | scalar(aop); | |
8676 | break; | |
8677 | case '%': | |
8678 | case '@': | |
8679 | list(aop); | |
8680 | arg++; | |
8681 | break; | |
8682 | case '&': | |
8683 | proto++; | |
8684 | arg++; | |
8685 | if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF) | |
8686 | bad_type(arg, | |
8687 | arg == 1 ? "block or sub {}" : "sub {}", | |
8688 | gv_ename(namegv), o3); | |
8689 | break; | |
8690 | case '*': | |
8691 | /* '*' allows any scalar type, including bareword */ | |
8692 | proto++; | |
8693 | arg++; | |
8694 | if (o3->op_type == OP_RV2GV) | |
8695 | goto wrapref; /* autoconvert GLOB -> GLOBref */ | |
8696 | else if (o3->op_type == OP_CONST) | |
8697 | o3->op_private &= ~OPpCONST_STRICT; | |
8698 | else if (o3->op_type == OP_ENTERSUB) { | |
8699 | /* accidental subroutine, revert to bareword */ | |
8700 | OP *gvop = ((UNOP*)o3)->op_first; | |
8701 | if (gvop && gvop->op_type == OP_NULL) { | |
8702 | gvop = ((UNOP*)gvop)->op_first; | |
8703 | if (gvop) { | |
8704 | for (; gvop->op_sibling; gvop = gvop->op_sibling) | |
8705 | ; | |
8706 | if (gvop && | |
8707 | (gvop->op_private & OPpENTERSUB_NOPAREN) && | |
8708 | (gvop = ((UNOP*)gvop)->op_first) && | |
8709 | gvop->op_type == OP_GV) | |
8710 | { | |
8711 | GV * const gv = cGVOPx_gv(gvop); | |
8712 | OP * const sibling = aop->op_sibling; | |
8713 | SV * const n = newSVpvs(""); | |
eb8433b7 | 8714 | #ifdef PERL_MAD |
d9088386 | 8715 | OP * const oldaop = aop; |
eb8433b7 | 8716 | #else |
d9088386 | 8717 | op_free(aop); |
eb8433b7 | 8718 | #endif |
d9088386 Z |
8719 | gv_fullname4(n, gv, "", FALSE); |
8720 | aop = newSVOP(OP_CONST, 0, n); | |
8721 | op_getmad(oldaop,aop,'O'); | |
8722 | prev->op_sibling = aop; | |
8723 | aop->op_sibling = sibling; | |
9675f7ac GS |
8724 | } |
8725 | } | |
8726 | } | |
d9088386 Z |
8727 | } |
8728 | scalar(aop); | |
8729 | break; | |
8730 | case '[': case ']': | |
8731 | goto oops; | |
8732 | break; | |
8733 | case '\\': | |
8734 | proto++; | |
8735 | arg++; | |
8736 | again: | |
8737 | switch (*proto++) { | |
8738 | case '[': | |
8739 | if (contextclass++ == 0) { | |
8740 | e = strchr(proto, ']'); | |
8741 | if (!e || e == proto) | |
8742 | goto oops; | |
8743 | } | |
8744 | else | |
8745 | goto oops; | |
8746 | goto again; | |
5b794e05 | 8747 | break; |
d9088386 Z |
8748 | case ']': |
8749 | if (contextclass) { | |
8750 | const char *p = proto; | |
8751 | const char *const end = proto; | |
8752 | contextclass = 0; | |
8753 | while (*--p != '[') {} | |
8754 | bad_type(arg, Perl_form(aTHX_ "one of %.*s", | |
8755 | (int)(end - p), p), | |
8756 | gv_ename(namegv), o3); | |
8757 | } else | |
8758 | goto oops; | |
8759 | break; | |
8760 | case '*': | |
8761 | if (o3->op_type == OP_RV2GV) | |
8762 | goto wrapref; | |
8763 | if (!contextclass) | |
8764 | bad_type(arg, "symbol", gv_ename(namegv), o3); | |
8765 | break; | |
8766 | case '&': | |
8767 | if (o3->op_type == OP_ENTERSUB) | |
8768 | goto wrapref; | |
8769 | if (!contextclass) | |
8770 | bad_type(arg, "subroutine entry", gv_ename(namegv), | |
8771 | o3); | |
8772 | break; | |
8773 | case '$': | |
8774 | if (o3->op_type == OP_RV2SV || | |
8775 | o3->op_type == OP_PADSV || | |
8776 | o3->op_type == OP_HELEM || | |
8777 | o3->op_type == OP_AELEM) | |
8778 | goto wrapref; | |
8779 | if (!contextclass) | |
8780 | bad_type(arg, "scalar", gv_ename(namegv), o3); | |
8781 | break; | |
8782 | case '@': | |
8783 | if (o3->op_type == OP_RV2AV || | |
8784 | o3->op_type == OP_PADAV) | |
8785 | goto wrapref; | |
8786 | if (!contextclass) | |
8787 | bad_type(arg, "array", gv_ename(namegv), o3); | |
8788 | break; | |
8789 | case '%': | |
8790 | if (o3->op_type == OP_RV2HV || | |
8791 | o3->op_type == OP_PADHV) | |
8792 | goto wrapref; | |
8793 | if (!contextclass) | |
8794 | bad_type(arg, "hash", gv_ename(namegv), o3); | |
8795 | break; | |
8796 | wrapref: | |
8797 | { | |
8798 | OP* const kid = aop; | |
8799 | OP* const sib = kid->op_sibling; | |
8800 | kid->op_sibling = 0; | |
8801 | aop = newUNOP(OP_REFGEN, 0, kid); | |
8802 | aop->op_sibling = sib; | |
8803 | prev->op_sibling = aop; | |
8804 | } | |
8805 | if (contextclass && e) { | |
8806 | proto = e + 1; | |
8807 | contextclass = 0; | |
4633a7c4 LW |
8808 | } |
8809 | break; | |
d9088386 | 8810 | default: goto oops; |
4633a7c4 | 8811 | } |
d9088386 Z |
8812 | if (contextclass) |
8813 | goto again; | |
8814 | break; | |
8815 | case ' ': | |
8816 | proto++; | |
8817 | continue; | |
8818 | default: | |
8819 | oops: | |
8820 | Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf, | |
8821 | gv_ename(namegv), SVfARG(protosv)); | |
8822 | } | |
8823 | ||
8824 | mod(aop, OP_ENTERSUB); | |
8825 | prev = aop; | |
8826 | aop = aop->op_sibling; | |
8827 | } | |
8828 | if (aop == cvop && *proto == '_') { | |
8829 | /* generate an access to $_ */ | |
8830 | aop = newDEFSVOP(); | |
8831 | aop->op_sibling = prev->op_sibling; | |
8832 | prev->op_sibling = aop; /* instead of cvop */ | |
8833 | } | |
8834 | if (!optional && proto_end > proto && | |
8835 | (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_')) | |
8836 | return too_few_arguments(entersubop, gv_ename(namegv)); | |
8837 | return entersubop; | |
8838 | } | |
8839 | ||
8840 | /* | |
8841 | =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv | |
8842 | ||
8843 | Performs the fixup of the arguments part of an C<entersub> op tree either | |
8844 | based on a subroutine prototype or using default list-context processing. | |
8845 | This is the standard treatment used on a subroutine call, not marked | |
8846 | with C<&>, where the callee can be identified at compile time. | |
8847 | ||
8848 | I<protosv> supplies the subroutine prototype to be applied to the call, | |
8849 | or indicates that there is no prototype. It may be a normal scalar, | |
8850 | in which case if it is defined then the string value will be used | |
8851 | as a prototype, and if it is undefined then there is no prototype. | |
8852 | Alternatively, for convenience, it may be a subroutine object (a C<CV*> | |
8853 | that has been cast to C<SV*>), of which the prototype will be used if it | |
8854 | has one. The prototype (or lack thereof) supplied, in whichever form, | |
8855 | does not need to match the actual callee referenced by the op tree. | |
8856 | ||
8857 | If the argument ops disagree with the prototype, for example by having | |
8858 | an unacceptable number of arguments, a valid op tree is returned anyway. | |
8859 | The error is reflected in the parser state, normally resulting in a single | |
8860 | exception at the top level of parsing which covers all the compilation | |
8861 | errors that occurred. In the error message, the callee is referred to | |
8862 | by the name defined by the I<namegv> parameter. | |
8863 | ||
8864 | =cut | |
8865 | */ | |
8866 | ||
8867 | OP * | |
8868 | Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop, | |
8869 | GV *namegv, SV *protosv) | |
8870 | { | |
8871 | PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST; | |
8872 | if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv)) | |
8873 | return ck_entersub_args_proto(entersubop, namegv, protosv); | |
8874 | else | |
8875 | return ck_entersub_args_list(entersubop); | |
8876 | } | |
8877 | ||
8878 | /* | |
8879 | =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p | |
8880 | ||
8881 | Retrieves the function that will be used to fix up a call to I<cv>. | |
8882 | Specifically, the function is applied to an C<entersub> op tree for a | |
8883 | subroutine call, not marked with C<&>, where the callee can be identified | |
8884 | at compile time as I<cv>. | |
8885 | ||
8886 | The C-level function pointer is returned in I<*ckfun_p>, and an SV | |
8887 | argument for it is returned in I<*ckobj_p>. The function is intended | |
8888 | to be called in this manner: | |
8889 | ||
8890 | entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p)); | |
8891 | ||
8892 | In this call, I<entersubop> is a pointer to the C<entersub> op, | |
8893 | which may be replaced by the check function, and I<namegv> is a GV | |
8894 | supplying the name that should be used by the check function to refer | |
8895 | to the callee of the C<entersub> op if it needs to emit any diagnostics. | |
8896 | It is permitted to apply the check function in non-standard situations, | |
8897 | such as to a call to a different subroutine or to a method call. | |
340458b5 | 8898 | |
d9088386 Z |
8899 | By default, the function is |
8900 | L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>, | |
8901 | and the SV parameter is I<cv> itself. This implements standard | |
8902 | prototype processing. It can be changed, for a particular subroutine, | |
8903 | by L</cv_set_call_checker>. | |
74735042 | 8904 | |
d9088386 Z |
8905 | =cut |
8906 | */ | |
8907 | ||
8908 | void | |
8909 | Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p) | |
8910 | { | |
8911 | MAGIC *callmg; | |
8912 | PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER; | |
8913 | callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL; | |
8914 | if (callmg) { | |
8915 | *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr); | |
8916 | *ckobj_p = callmg->mg_obj; | |
8917 | } else { | |
8918 | *ckfun_p = Perl_ck_entersub_args_proto_or_list; | |
8919 | *ckobj_p = (SV*)cv; | |
8920 | } | |
8921 | } | |
8922 | ||
8923 | /* | |
8924 | =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj | |
8925 | ||
8926 | Sets the function that will be used to fix up a call to I<cv>. | |
8927 | Specifically, the function is applied to an C<entersub> op tree for a | |
8928 | subroutine call, not marked with C<&>, where the callee can be identified | |
8929 | at compile time as I<cv>. | |
8930 | ||
8931 | The C-level function pointer is supplied in I<ckfun>, and an SV argument | |
8932 | for it is supplied in I<ckobj>. The function is intended to be called | |
8933 | in this manner: | |
8934 | ||
8935 | entersubop = ckfun(aTHX_ entersubop, namegv, ckobj); | |
8936 | ||
8937 | In this call, I<entersubop> is a pointer to the C<entersub> op, | |
8938 | which may be replaced by the check function, and I<namegv> is a GV | |
8939 | supplying the name that should be used by the check function to refer | |
8940 | to the callee of the C<entersub> op if it needs to emit any diagnostics. | |
8941 | It is permitted to apply the check function in non-standard situations, | |
8942 | such as to a call to a different subroutine or to a method call. | |
8943 | ||
8944 | The current setting for a particular CV can be retrieved by | |
8945 | L</cv_get_call_checker>. | |
8946 | ||
8947 | =cut | |
8948 | */ | |
8949 | ||
8950 | void | |
8951 | Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj) | |
8952 | { | |
8953 | PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER; | |
8954 | if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) { | |
8955 | if (SvMAGICAL((SV*)cv)) | |
8956 | mg_free_type((SV*)cv, PERL_MAGIC_checkcall); | |
8957 | } else { | |
8958 | MAGIC *callmg; | |
8959 | sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0); | |
8960 | callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall); | |
8961 | if (callmg->mg_flags & MGf_REFCOUNTED) { | |
8962 | SvREFCNT_dec(callmg->mg_obj); | |
8963 | callmg->mg_flags &= ~MGf_REFCOUNTED; | |
8964 | } | |
8965 | callmg->mg_ptr = FPTR2DPTR(char *, ckfun); | |
8966 | callmg->mg_obj = ckobj; | |
8967 | if (ckobj != (SV*)cv) { | |
8968 | SvREFCNT_inc_simple_void_NN(ckobj); | |
8969 | callmg->mg_flags |= MGf_REFCOUNTED; | |
74735042 | 8970 | } |
340458b5 | 8971 | } |
d9088386 Z |
8972 | } |
8973 | ||
8974 | OP * | |
8975 | Perl_ck_subr(pTHX_ OP *o) | |
8976 | { | |
8977 | OP *aop, *cvop; | |
8978 | CV *cv; | |
8979 | GV *namegv; | |
8980 | ||
8981 | PERL_ARGS_ASSERT_CK_SUBR; | |
8982 | ||
8983 | aop = cUNOPx(o)->op_first; | |
8984 | if (!aop->op_sibling) | |
8985 | aop = cUNOPx(aop)->op_first; | |
8986 | aop = aop->op_sibling; | |
8987 | for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ; | |
8988 | cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY); | |
8989 | namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL; | |
8990 | ||
8991 | o->op_private |= OPpENTERSUB_HASTARG; | |
8992 | o->op_private |= (PL_hints & HINT_STRICT_REFS); | |
8993 | if (PERLDB_SUB && PL_curstash != PL_debstash) | |
8994 | o->op_private |= OPpENTERSUB_DB; | |
8995 | if (cvop->op_type == OP_RV2CV) { | |
8996 | o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER); | |
8997 | op_null(cvop); | |
8998 | } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) { | |
8999 | if (aop->op_type == OP_CONST) | |
9000 | aop->op_private &= ~OPpCONST_STRICT; | |
9001 | else if (aop->op_type == OP_LIST) { | |
9002 | OP * const sib = ((UNOP*)aop)->op_first->op_sibling; | |
9003 | if (sib && sib->op_type == OP_CONST) | |
9004 | sib->op_private &= ~OPpCONST_STRICT; | |
9005 | } | |
9006 | } | |
9007 | ||
9008 | if (!cv) { | |
9009 | return ck_entersub_args_list(o); | |
9010 | } else { | |
9011 | Perl_call_checker ckfun; | |
9012 | SV *ckobj; | |
9013 | cv_get_call_checker(cv, &ckfun, &ckobj); | |
9014 | return ckfun(aTHX_ o, namegv, ckobj); | |
9015 | } | |
79072805 LW |
9016 | } |
9017 | ||
9018 | OP * | |
cea2e8a9 | 9019 | Perl_ck_svconst(pTHX_ OP *o) |
8990e307 | 9020 | { |
7918f24d | 9021 | PERL_ARGS_ASSERT_CK_SVCONST; |
96a5add6 | 9022 | PERL_UNUSED_CONTEXT; |
11343788 MB |
9023 | SvREADONLY_on(cSVOPo->op_sv); |
9024 | return o; | |
8990e307 LW |
9025 | } |
9026 | ||
9027 | OP * | |
d4ac975e GA |
9028 | Perl_ck_chdir(pTHX_ OP *o) |
9029 | { | |
a4e74480 | 9030 | PERL_ARGS_ASSERT_CK_CHDIR; |
d4ac975e | 9031 | if (o->op_flags & OPf_KIDS) { |
1496a290 | 9032 | SVOP * const kid = (SVOP*)cUNOPo->op_first; |
d4ac975e GA |
9033 | |
9034 | if (kid && kid->op_type == OP_CONST && | |
9035 | (kid->op_private & OPpCONST_BARE)) | |
9036 | { | |
9037 | o->op_flags |= OPf_SPECIAL; | |
9038 | kid->op_private &= ~OPpCONST_STRICT; | |
9039 | } | |
9040 | } | |
9041 | return ck_fun(o); | |
9042 | } | |
9043 | ||
9044 | OP * | |
cea2e8a9 | 9045 | Perl_ck_trunc(pTHX_ OP *o) |
79072805 | 9046 | { |
7918f24d NC |
9047 | PERL_ARGS_ASSERT_CK_TRUNC; |
9048 | ||
11343788 MB |
9049 | if (o->op_flags & OPf_KIDS) { |
9050 | SVOP *kid = (SVOP*)cUNOPo->op_first; | |
79072805 | 9051 | |
a0d0e21e LW |
9052 | if (kid->op_type == OP_NULL) |
9053 | kid = (SVOP*)kid->op_sibling; | |
bb53490d GS |
9054 | if (kid && kid->op_type == OP_CONST && |
9055 | (kid->op_private & OPpCONST_BARE)) | |
9056 | { | |
11343788 | 9057 | o->op_flags |= OPf_SPECIAL; |
bb53490d GS |
9058 | kid->op_private &= ~OPpCONST_STRICT; |
9059 | } | |
79072805 | 9060 | } |
11343788 | 9061 | return ck_fun(o); |
79072805 LW |
9062 | } |
9063 | ||
35fba0d9 | 9064 | OP * |
bab9c0ac RGS |
9065 | Perl_ck_unpack(pTHX_ OP *o) |
9066 | { | |
9067 | OP *kid = cLISTOPo->op_first; | |
7918f24d NC |
9068 | |
9069 | PERL_ARGS_ASSERT_CK_UNPACK; | |
9070 | ||
bab9c0ac RGS |
9071 | if (kid->op_sibling) { |
9072 | kid = kid->op_sibling; | |
9073 | if (!kid->op_sibling) | |
9074 | kid->op_sibling = newDEFSVOP(); | |
9075 | } | |
9076 | return ck_fun(o); | |
9077 | } | |
9078 | ||
9079 | OP * | |
35fba0d9 RG |
9080 | Perl_ck_substr(pTHX_ OP *o) |
9081 | { | |
7918f24d NC |
9082 | PERL_ARGS_ASSERT_CK_SUBSTR; |
9083 | ||
35fba0d9 | 9084 | o = ck_fun(o); |
1d866c12 | 9085 | if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) { |
35fba0d9 RG |
9086 | OP *kid = cLISTOPo->op_first; |
9087 | ||
9088 | if (kid->op_type == OP_NULL) | |
9089 | kid = kid->op_sibling; | |
9090 | if (kid) | |
9091 | kid->op_flags |= OPf_MOD; | |
9092 | ||
9093 | } | |
9094 | return o; | |
9095 | } | |
9096 | ||
878d132a NC |
9097 | OP * |
9098 | Perl_ck_each(pTHX_ OP *o) | |
9099 | { | |
d75c0fe7 | 9100 | dVAR; |
a916b302 | 9101 | OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL; |
878d132a | 9102 | |
7918f24d NC |
9103 | PERL_ARGS_ASSERT_CK_EACH; |
9104 | ||
a916b302 RGS |
9105 | if (kid) { |
9106 | if (kid->op_type == OP_PADAV || kid->op_type == OP_RV2AV) { | |
9107 | const unsigned new_type = o->op_type == OP_EACH ? OP_AEACH | |
9108 | : o->op_type == OP_KEYS ? OP_AKEYS : OP_AVALUES; | |
9109 | o->op_type = new_type; | |
9110 | o->op_ppaddr = PL_ppaddr[new_type]; | |
9111 | } | |
9112 | else if (!(kid->op_type == OP_PADHV || kid->op_type == OP_RV2HV | |
9113 | || (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) | |
9114 | )) { | |
9115 | bad_type(1, "hash or array", PL_op_desc[o->op_type], kid); | |
9116 | return o; | |
9117 | } | |
878d132a NC |
9118 | } |
9119 | return ck_fun(o); | |
9120 | } | |
9121 | ||
867fa1e2 YO |
9122 | /* caller is supposed to assign the return to the |
9123 | container of the rep_op var */ | |
20381b50 | 9124 | STATIC OP * |
867fa1e2 | 9125 | S_opt_scalarhv(pTHX_ OP *rep_op) { |
749123ff | 9126 | dVAR; |
867fa1e2 YO |
9127 | UNOP *unop; |
9128 | ||
9129 | PERL_ARGS_ASSERT_OPT_SCALARHV; | |
9130 | ||
9131 | NewOp(1101, unop, 1, UNOP); | |
9132 | unop->op_type = (OPCODE)OP_BOOLKEYS; | |
9133 | unop->op_ppaddr = PL_ppaddr[OP_BOOLKEYS]; | |
9134 | unop->op_flags = (U8)(OPf_WANT_SCALAR | OPf_KIDS ); | |
9135 | unop->op_private = (U8)(1 | ((OPf_WANT_SCALAR | OPf_KIDS) >> 8)); | |
9136 | unop->op_first = rep_op; | |
9137 | unop->op_next = rep_op->op_next; | |
9138 | rep_op->op_next = (OP*)unop; | |
9139 | rep_op->op_flags|=(OPf_REF | OPf_MOD); | |
9140 | unop->op_sibling = rep_op->op_sibling; | |
9141 | rep_op->op_sibling = NULL; | |
9142 | /* unop->op_targ = pad_alloc(OP_BOOLKEYS, SVs_PADTMP); */ | |
9143 | if (rep_op->op_type == OP_PADHV) { | |
9144 | rep_op->op_flags &= ~OPf_WANT_SCALAR; | |
9145 | rep_op->op_flags |= OPf_WANT_LIST; | |
9146 | } | |
9147 | return (OP*)unop; | |
9148 | } | |
9149 | ||
2f9e2db0 VP |
9150 | /* Checks if o acts as an in-place operator on an array. oright points to the |
9151 | * beginning of the right-hand side. Returns the left-hand side of the | |
9152 | * assignment if o acts in-place, or NULL otherwise. */ | |
9153 | ||
20381b50 | 9154 | STATIC OP * |
2f9e2db0 VP |
9155 | S_is_inplace_av(pTHX_ OP *o, OP *oright) { |
9156 | OP *o2; | |
9157 | OP *oleft = NULL; | |
9158 | ||
9159 | PERL_ARGS_ASSERT_IS_INPLACE_AV; | |
9160 | ||
9161 | if (!oright || | |
9162 | (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV) | |
9163 | || oright->op_next != o | |
9164 | || (oright->op_private & OPpLVAL_INTRO) | |
9165 | ) | |
9166 | return NULL; | |
9167 | ||
9168 | /* o2 follows the chain of op_nexts through the LHS of the | |
9169 | * assign (if any) to the aassign op itself */ | |
9170 | o2 = o->op_next; | |
9171 | if (!o2 || o2->op_type != OP_NULL) | |
9172 | return NULL; | |
9173 | o2 = o2->op_next; | |
9174 | if (!o2 || o2->op_type != OP_PUSHMARK) | |
9175 | return NULL; | |
9176 | o2 = o2->op_next; | |
9177 | if (o2 && o2->op_type == OP_GV) | |
9178 | o2 = o2->op_next; | |
9179 | if (!o2 | |
9180 | || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV) | |
9181 | || (o2->op_private & OPpLVAL_INTRO) | |
9182 | ) | |
9183 | return NULL; | |
9184 | oleft = o2; | |
9185 | o2 = o2->op_next; | |
9186 | if (!o2 || o2->op_type != OP_NULL) | |
9187 | return NULL; | |
9188 | o2 = o2->op_next; | |
9189 | if (!o2 || o2->op_type != OP_AASSIGN | |
9190 | || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID) | |
9191 | return NULL; | |
9192 | ||
9193 | /* check that the sort is the first arg on RHS of assign */ | |
9194 | ||
9195 | o2 = cUNOPx(o2)->op_first; | |
9196 | if (!o2 || o2->op_type != OP_NULL) | |
9197 | return NULL; | |
9198 | o2 = cUNOPx(o2)->op_first; | |
9199 | if (!o2 || o2->op_type != OP_PUSHMARK) | |
9200 | return NULL; | |
9201 | if (o2->op_sibling != o) | |
9202 | return NULL; | |
9203 | ||
9204 | /* check the array is the same on both sides */ | |
9205 | if (oleft->op_type == OP_RV2AV) { | |
9206 | if (oright->op_type != OP_RV2AV | |
9207 | || !cUNOPx(oright)->op_first | |
9208 | || cUNOPx(oright)->op_first->op_type != OP_GV | |
9209 | || cGVOPx_gv(cUNOPx(oleft)->op_first) != | |
9210 | cGVOPx_gv(cUNOPx(oright)->op_first) | |
9211 | ) | |
9212 | return NULL; | |
9213 | } | |
9214 | else if (oright->op_type != OP_PADAV | |
9215 | || oright->op_targ != oleft->op_targ | |
9216 | ) | |
9217 | return NULL; | |
9218 | ||
9219 | return oleft; | |
9220 | } | |
9221 | ||
61b743bb DM |
9222 | /* A peephole optimizer. We visit the ops in the order they're to execute. |
9223 | * See the comments at the top of this file for more details about when | |
9224 | * peep() is called */ | |
463ee0b2 | 9225 | |
79072805 | 9226 | void |
1a0a2ba9 | 9227 | Perl_rpeep(pTHX_ register OP *o) |
79072805 | 9228 | { |
27da23d5 | 9229 | dVAR; |
c445ea15 | 9230 | register OP* oldop = NULL; |
2d8e6c8d | 9231 | |
2814eb74 | 9232 | if (!o || o->op_opt) |
79072805 | 9233 | return; |
a0d0e21e | 9234 | ENTER; |
462e5cf6 | 9235 | SAVEOP(); |
7766f137 | 9236 | SAVEVPTR(PL_curcop); |
a0d0e21e | 9237 | for (; o; o = o->op_next) { |
2814eb74 | 9238 | if (o->op_opt) |
a0d0e21e | 9239 | break; |
6d7dd4a5 NC |
9240 | /* By default, this op has now been optimised. A couple of cases below |
9241 | clear this again. */ | |
9242 | o->op_opt = 1; | |
533c011a | 9243 | PL_op = o; |
a0d0e21e | 9244 | switch (o->op_type) { |
a0d0e21e | 9245 | case OP_DBSTATE: |
3280af22 | 9246 | PL_curcop = ((COP*)o); /* for warnings */ |
a0d0e21e | 9247 | break; |
ac56e7de NC |
9248 | case OP_NEXTSTATE: |
9249 | PL_curcop = ((COP*)o); /* for warnings */ | |
9250 | ||
9251 | /* Two NEXTSTATEs in a row serve no purpose. Except if they happen | |
9252 | to carry two labels. For now, take the easier option, and skip | |
9253 | this optimisation if the first NEXTSTATE has a label. */ | |
9254 | if (!CopLABEL((COP*)o)) { | |
9255 | OP *nextop = o->op_next; | |
9256 | while (nextop && nextop->op_type == OP_NULL) | |
9257 | nextop = nextop->op_next; | |
9258 | ||
9259 | if (nextop && (nextop->op_type == OP_NEXTSTATE)) { | |
9260 | COP *firstcop = (COP *)o; | |
9261 | COP *secondcop = (COP *)nextop; | |
9262 | /* We want the COP pointed to by o (and anything else) to | |
9263 | become the next COP down the line. */ | |
9264 | cop_free(firstcop); | |
9265 | ||
9266 | firstcop->op_next = secondcop->op_next; | |
9267 | ||
9268 | /* Now steal all its pointers, and duplicate the other | |
9269 | data. */ | |
9270 | firstcop->cop_line = secondcop->cop_line; | |
9271 | #ifdef USE_ITHREADS | |
9272 | firstcop->cop_stashpv = secondcop->cop_stashpv; | |
9273 | firstcop->cop_file = secondcop->cop_file; | |
9274 | #else | |
9275 | firstcop->cop_stash = secondcop->cop_stash; | |
9276 | firstcop->cop_filegv = secondcop->cop_filegv; | |
9277 | #endif | |
9278 | firstcop->cop_hints = secondcop->cop_hints; | |
9279 | firstcop->cop_seq = secondcop->cop_seq; | |
9280 | firstcop->cop_warnings = secondcop->cop_warnings; | |
9281 | firstcop->cop_hints_hash = secondcop->cop_hints_hash; | |
9282 | ||
9283 | #ifdef USE_ITHREADS | |
9284 | secondcop->cop_stashpv = NULL; | |
9285 | secondcop->cop_file = NULL; | |
9286 | #else | |
9287 | secondcop->cop_stash = NULL; | |
9288 | secondcop->cop_filegv = NULL; | |
9289 | #endif | |
9290 | secondcop->cop_warnings = NULL; | |
9291 | secondcop->cop_hints_hash = NULL; | |
9292 | ||
9293 | /* If we use op_null(), and hence leave an ex-COP, some | |
9294 | warnings are misreported. For example, the compile-time | |
9295 | error in 'use strict; no strict refs;' */ | |
9296 | secondcop->op_type = OP_NULL; | |
9297 | secondcop->op_ppaddr = PL_ppaddr[OP_NULL]; | |
9298 | } | |
9299 | } | |
9300 | break; | |
a0d0e21e | 9301 | |
a0d0e21e | 9302 | case OP_CONST: |
7a52d87a GS |
9303 | if (cSVOPo->op_private & OPpCONST_STRICT) |
9304 | no_bareword_allowed(o); | |
7766f137 | 9305 | #ifdef USE_ITHREADS |
996c9baa | 9306 | case OP_HINTSEVAL: |
3848b962 | 9307 | case OP_METHOD_NAMED: |
7766f137 GS |
9308 | /* Relocate sv to the pad for thread safety. |
9309 | * Despite being a "constant", the SV is written to, | |
9310 | * for reference counts, sv_upgrade() etc. */ | |
9311 | if (cSVOP->op_sv) { | |
6867be6d | 9312 | const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP); |
996c9baa | 9313 | if (o->op_type != OP_METHOD_NAMED && SvPADTMP(cSVOPo->op_sv)) { |
6a7129a1 | 9314 | /* If op_sv is already a PADTMP then it is being used by |
9a049f1c | 9315 | * some pad, so make a copy. */ |
dd2155a4 DM |
9316 | sv_setsv(PAD_SVl(ix),cSVOPo->op_sv); |
9317 | SvREADONLY_on(PAD_SVl(ix)); | |
6a7129a1 GS |
9318 | SvREFCNT_dec(cSVOPo->op_sv); |
9319 | } | |
996c9baa | 9320 | else if (o->op_type != OP_METHOD_NAMED |
052ca17e NC |
9321 | && cSVOPo->op_sv == &PL_sv_undef) { |
9322 | /* PL_sv_undef is hack - it's unsafe to store it in the | |
9323 | AV that is the pad, because av_fetch treats values of | |
9324 | PL_sv_undef as a "free" AV entry and will merrily | |
9325 | replace them with a new SV, causing pad_alloc to think | |
9326 | that this pad slot is free. (When, clearly, it is not) | |
9327 | */ | |
9328 | SvOK_off(PAD_SVl(ix)); | |
9329 | SvPADTMP_on(PAD_SVl(ix)); | |
9330 | SvREADONLY_on(PAD_SVl(ix)); | |
9331 | } | |
6a7129a1 | 9332 | else { |
dd2155a4 | 9333 | SvREFCNT_dec(PAD_SVl(ix)); |
6a7129a1 | 9334 | SvPADTMP_on(cSVOPo->op_sv); |
dd2155a4 | 9335 | PAD_SETSV(ix, cSVOPo->op_sv); |
9a049f1c | 9336 | /* XXX I don't know how this isn't readonly already. */ |
dd2155a4 | 9337 | SvREADONLY_on(PAD_SVl(ix)); |
6a7129a1 | 9338 | } |
a0714e2c | 9339 | cSVOPo->op_sv = NULL; |
7766f137 GS |
9340 | o->op_targ = ix; |
9341 | } | |
9342 | #endif | |
07447971 GS |
9343 | break; |
9344 | ||
df91b2c5 AE |
9345 | case OP_CONCAT: |
9346 | if (o->op_next && o->op_next->op_type == OP_STRINGIFY) { | |
9347 | if (o->op_next->op_private & OPpTARGET_MY) { | |
9348 | if (o->op_flags & OPf_STACKED) /* chained concats */ | |
a6aa0b75 | 9349 | break; /* ignore_optimization */ |
df91b2c5 AE |
9350 | else { |
9351 | /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */ | |
9352 | o->op_targ = o->op_next->op_targ; | |
9353 | o->op_next->op_targ = 0; | |
9354 | o->op_private |= OPpTARGET_MY; | |
9355 | } | |
9356 | } | |
9357 | op_null(o->op_next); | |
9358 | } | |
df91b2c5 | 9359 | break; |
6d7dd4a5 NC |
9360 | case OP_STUB: |
9361 | if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) { | |
9362 | break; /* Scalar stub must produce undef. List stub is noop */ | |
9363 | } | |
9364 | goto nothin; | |
79072805 | 9365 | case OP_NULL: |
acb36ea4 | 9366 | if (o->op_targ == OP_NEXTSTATE |
5edb5b2a | 9367 | || o->op_targ == OP_DBSTATE) |
acb36ea4 | 9368 | { |
3280af22 | 9369 | PL_curcop = ((COP*)o); |
acb36ea4 | 9370 | } |
dad75012 | 9371 | /* XXX: We avoid setting op_seq here to prevent later calls |
1a0a2ba9 | 9372 | to rpeep() from mistakenly concluding that optimisation |
dad75012 AMS |
9373 | has already occurred. This doesn't fix the real problem, |
9374 | though (See 20010220.007). AMS 20010719 */ | |
2814eb74 | 9375 | /* op_seq functionality is now replaced by op_opt */ |
6d7dd4a5 | 9376 | o->op_opt = 0; |
f46f2f82 | 9377 | /* FALL THROUGH */ |
79072805 | 9378 | case OP_SCALAR: |
93a17b20 | 9379 | case OP_LINESEQ: |
463ee0b2 | 9380 | case OP_SCOPE: |
6d7dd4a5 | 9381 | nothin: |
a0d0e21e LW |
9382 | if (oldop && o->op_next) { |
9383 | oldop->op_next = o->op_next; | |
6d7dd4a5 | 9384 | o->op_opt = 0; |
79072805 LW |
9385 | continue; |
9386 | } | |
79072805 LW |
9387 | break; |
9388 | ||
6a077020 | 9389 | case OP_PADAV: |
79072805 | 9390 | case OP_GV: |
6a077020 | 9391 | if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) { |
0bd48802 | 9392 | OP* const pop = (o->op_type == OP_PADAV) ? |
6a077020 | 9393 | o->op_next : o->op_next->op_next; |
a0d0e21e | 9394 | IV i; |
f9dc862f | 9395 | if (pop && pop->op_type == OP_CONST && |
af5acbb4 | 9396 | ((PL_op = pop->op_next)) && |
8990e307 | 9397 | pop->op_next->op_type == OP_AELEM && |
a0d0e21e | 9398 | !(pop->op_next->op_private & |
78f9721b | 9399 | (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) && |
fc15ae8f | 9400 | (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop)) |
a0d0e21e | 9401 | <= 255 && |
8990e307 LW |
9402 | i >= 0) |
9403 | { | |
350de78d | 9404 | GV *gv; |
af5acbb4 DM |
9405 | if (cSVOPx(pop)->op_private & OPpCONST_STRICT) |
9406 | no_bareword_allowed(pop); | |
6a077020 DM |
9407 | if (o->op_type == OP_GV) |
9408 | op_null(o->op_next); | |
93c66552 DM |
9409 | op_null(pop->op_next); |
9410 | op_null(pop); | |
a0d0e21e LW |
9411 | o->op_flags |= pop->op_next->op_flags & OPf_MOD; |
9412 | o->op_next = pop->op_next->op_next; | |
22c35a8c | 9413 | o->op_ppaddr = PL_ppaddr[OP_AELEMFAST]; |
a0d0e21e | 9414 | o->op_private = (U8)i; |
6a077020 DM |
9415 | if (o->op_type == OP_GV) { |
9416 | gv = cGVOPo_gv; | |
9417 | GvAVn(gv); | |
9418 | } | |
9419 | else | |
9420 | o->op_flags |= OPf_SPECIAL; | |
9421 | o->op_type = OP_AELEMFAST; | |
9422 | } | |
6a077020 DM |
9423 | break; |
9424 | } | |
9425 | ||
9426 | if (o->op_next->op_type == OP_RV2SV) { | |
9427 | if (!(o->op_next->op_private & OPpDEREF)) { | |
9428 | op_null(o->op_next); | |
9429 | o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO | |
9430 | | OPpOUR_INTRO); | |
9431 | o->op_next = o->op_next->op_next; | |
9432 | o->op_type = OP_GVSV; | |
9433 | o->op_ppaddr = PL_ppaddr[OP_GVSV]; | |
8990e307 | 9434 | } |
79072805 | 9435 | } |
e476b1b5 | 9436 | else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) { |
551405c4 | 9437 | GV * const gv = cGVOPo_gv; |
b15aece3 | 9438 | if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) { |
76cd736e | 9439 | /* XXX could check prototype here instead of just carping */ |
551405c4 | 9440 | SV * const sv = sv_newmortal(); |
bd61b366 | 9441 | gv_efullname3(sv, gv, NULL); |
9014280d | 9442 | Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), |
35c1215d | 9443 | "%"SVf"() called too early to check prototype", |
be2597df | 9444 | SVfARG(sv)); |
76cd736e GS |
9445 | } |
9446 | } | |
89de2904 AMS |
9447 | else if (o->op_next->op_type == OP_READLINE |
9448 | && o->op_next->op_next->op_type == OP_CONCAT | |
9449 | && (o->op_next->op_next->op_flags & OPf_STACKED)) | |
9450 | { | |
d2c45030 AMS |
9451 | /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */ |
9452 | o->op_type = OP_RCATLINE; | |
9453 | o->op_flags |= OPf_STACKED; | |
9454 | o->op_ppaddr = PL_ppaddr[OP_RCATLINE]; | |
89de2904 | 9455 | op_null(o->op_next->op_next); |
d2c45030 | 9456 | op_null(o->op_next); |
89de2904 | 9457 | } |
76cd736e | 9458 | |
79072805 | 9459 | break; |
867fa1e2 YO |
9460 | |
9461 | { | |
9462 | OP *fop; | |
9463 | OP *sop; | |
9464 | ||
9465 | case OP_NOT: | |
9466 | fop = cUNOP->op_first; | |
9467 | sop = NULL; | |
9468 | goto stitch_keys; | |
9469 | break; | |
9470 | ||
9471 | case OP_AND: | |
79072805 | 9472 | case OP_OR: |
c963b151 | 9473 | case OP_DOR: |
867fa1e2 YO |
9474 | fop = cLOGOP->op_first; |
9475 | sop = fop->op_sibling; | |
9476 | while (cLOGOP->op_other->op_type == OP_NULL) | |
9477 | cLOGOP->op_other = cLOGOP->op_other->op_next; | |
1a0a2ba9 | 9478 | CALL_RPEEP(cLOGOP->op_other); |
867fa1e2 YO |
9479 | |
9480 | stitch_keys: | |
9481 | o->op_opt = 1; | |
9482 | if ((fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV) | |
9483 | || ( sop && | |
9484 | (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV) | |
9485 | ) | |
9486 | ){ | |
9487 | OP * nop = o; | |
9488 | OP * lop = o; | |
aaf643ce | 9489 | if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) { |
867fa1e2 YO |
9490 | while (nop && nop->op_next) { |
9491 | switch (nop->op_next->op_type) { | |
9492 | case OP_NOT: | |
9493 | case OP_AND: | |
9494 | case OP_OR: | |
9495 | case OP_DOR: | |
9496 | lop = nop = nop->op_next; | |
9497 | break; | |
9498 | case OP_NULL: | |
9499 | nop = nop->op_next; | |
9500 | break; | |
9501 | default: | |
9502 | nop = NULL; | |
9503 | break; | |
9504 | } | |
9505 | } | |
9506 | } | |
aaf643ce | 9507 | if ((lop->op_flags & OPf_WANT) == OPf_WANT_VOID) { |
867fa1e2 YO |
9508 | if (fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV) |
9509 | cLOGOP->op_first = opt_scalarhv(fop); | |
9510 | if (sop && (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV)) | |
9511 | cLOGOP->op_first->op_sibling = opt_scalarhv(sop); | |
9512 | } | |
9513 | } | |
9514 | ||
9515 | ||
9516 | break; | |
9517 | } | |
9518 | ||
9519 | case OP_MAPWHILE: | |
9520 | case OP_GREPWHILE: | |
2c2d71f5 JH |
9521 | case OP_ANDASSIGN: |
9522 | case OP_ORASSIGN: | |
c963b151 | 9523 | case OP_DORASSIGN: |
1a67a97c SM |
9524 | case OP_COND_EXPR: |
9525 | case OP_RANGE: | |
c5917253 | 9526 | case OP_ONCE: |
fd4d1407 IZ |
9527 | while (cLOGOP->op_other->op_type == OP_NULL) |
9528 | cLOGOP->op_other = cLOGOP->op_other->op_next; | |
1a0a2ba9 | 9529 | CALL_RPEEP(cLOGOP->op_other); |
79072805 LW |
9530 | break; |
9531 | ||
79072805 | 9532 | case OP_ENTERLOOP: |
9c2ca71a | 9533 | case OP_ENTERITER: |
58cccf98 SM |
9534 | while (cLOOP->op_redoop->op_type == OP_NULL) |
9535 | cLOOP->op_redoop = cLOOP->op_redoop->op_next; | |
1a0a2ba9 | 9536 | CALL_RPEEP(cLOOP->op_redoop); |
58cccf98 SM |
9537 | while (cLOOP->op_nextop->op_type == OP_NULL) |
9538 | cLOOP->op_nextop = cLOOP->op_nextop->op_next; | |
1a0a2ba9 | 9539 | CALL_RPEEP(cLOOP->op_nextop); |
58cccf98 SM |
9540 | while (cLOOP->op_lastop->op_type == OP_NULL) |
9541 | cLOOP->op_lastop = cLOOP->op_lastop->op_next; | |
1a0a2ba9 | 9542 | CALL_RPEEP(cLOOP->op_lastop); |
79072805 LW |
9543 | break; |
9544 | ||
79072805 | 9545 | case OP_SUBST: |
29f2e912 NC |
9546 | assert(!(cPMOP->op_pmflags & PMf_ONCE)); |
9547 | while (cPMOP->op_pmstashstartu.op_pmreplstart && | |
9548 | cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL) | |
9549 | cPMOP->op_pmstashstartu.op_pmreplstart | |
9550 | = cPMOP->op_pmstashstartu.op_pmreplstart->op_next; | |
1a0a2ba9 | 9551 | CALL_RPEEP(cPMOP->op_pmstashstartu.op_pmreplstart); |
79072805 LW |
9552 | break; |
9553 | ||
a0d0e21e | 9554 | case OP_EXEC: |
041457d9 DM |
9555 | if (o->op_next && o->op_next->op_type == OP_NEXTSTATE |
9556 | && ckWARN(WARN_SYNTAX)) | |
9557 | { | |
1496a290 AL |
9558 | if (o->op_next->op_sibling) { |
9559 | const OPCODE type = o->op_next->op_sibling->op_type; | |
9560 | if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) { | |
9561 | const line_t oldline = CopLINE(PL_curcop); | |
9562 | CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next)); | |
9563 | Perl_warner(aTHX_ packWARN(WARN_EXEC), | |
9564 | "Statement unlikely to be reached"); | |
9565 | Perl_warner(aTHX_ packWARN(WARN_EXEC), | |
9566 | "\t(Maybe you meant system() when you said exec()?)\n"); | |
9567 | CopLINE_set(PL_curcop, oldline); | |
9568 | } | |
a0d0e21e LW |
9569 | } |
9570 | } | |
9571 | break; | |
b2ffa427 | 9572 | |
c750a3ec | 9573 | case OP_HELEM: { |
e75d1f10 | 9574 | UNOP *rop; |
6d822dc4 | 9575 | SV *lexname; |
e75d1f10 | 9576 | GV **fields; |
6d822dc4 | 9577 | SV **svp, *sv; |
d5263905 | 9578 | const char *key = NULL; |
c750a3ec | 9579 | STRLEN keylen; |
b2ffa427 | 9580 | |
1c846c1f | 9581 | if (((BINOP*)o)->op_last->op_type != OP_CONST) |
c750a3ec | 9582 | break; |
1c846c1f NIS |
9583 | |
9584 | /* Make the CONST have a shared SV */ | |
9585 | svp = cSVOPx_svp(((BINOP*)o)->op_last); | |
38bb37b9 | 9586 | if (!SvFAKE(sv = *svp) || !SvREADONLY(sv)) { |
d5263905 | 9587 | key = SvPV_const(sv, keylen); |
25716404 | 9588 | lexname = newSVpvn_share(key, |
bb7a0f54 | 9589 | SvUTF8(sv) ? -(I32)keylen : (I32)keylen, |
25716404 | 9590 | 0); |
1c846c1f NIS |
9591 | SvREFCNT_dec(sv); |
9592 | *svp = lexname; | |
9593 | } | |
e75d1f10 RD |
9594 | |
9595 | if ((o->op_private & (OPpLVAL_INTRO))) | |
9596 | break; | |
9597 | ||
9598 | rop = (UNOP*)((BINOP*)o)->op_first; | |
9599 | if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV) | |
9600 | break; | |
9601 | lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE); | |
00b1698f | 9602 | if (!SvPAD_TYPED(lexname)) |
e75d1f10 | 9603 | break; |
a4fc7abc | 9604 | fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE); |
e75d1f10 RD |
9605 | if (!fields || !GvHV(*fields)) |
9606 | break; | |
93524f2b | 9607 | key = SvPV_const(*svp, keylen); |
e75d1f10 | 9608 | if (!hv_fetch(GvHV(*fields), key, |
bb7a0f54 | 9609 | SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) |
e75d1f10 RD |
9610 | { |
9611 | Perl_croak(aTHX_ "No such class field \"%s\" " | |
9612 | "in variable %s of type %s", | |
93524f2b | 9613 | key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname))); |
e75d1f10 RD |
9614 | } |
9615 | ||
6d822dc4 MS |
9616 | break; |
9617 | } | |
c750a3ec | 9618 | |
e75d1f10 RD |
9619 | case OP_HSLICE: { |
9620 | UNOP *rop; | |
9621 | SV *lexname; | |
9622 | GV **fields; | |
9623 | SV **svp; | |
93524f2b | 9624 | const char *key; |
e75d1f10 RD |
9625 | STRLEN keylen; |
9626 | SVOP *first_key_op, *key_op; | |
9627 | ||
9628 | if ((o->op_private & (OPpLVAL_INTRO)) | |
9629 | /* I bet there's always a pushmark... */ | |
9630 | || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST) | |
9631 | /* hmmm, no optimization if list contains only one key. */ | |
9632 | break; | |
9633 | rop = (UNOP*)((LISTOP*)o)->op_last; | |
9634 | if (rop->op_type != OP_RV2HV) | |
9635 | break; | |
9636 | if (rop->op_first->op_type == OP_PADSV) | |
9637 | /* @$hash{qw(keys here)} */ | |
9638 | rop = (UNOP*)rop->op_first; | |
9639 | else { | |
9640 | /* @{$hash}{qw(keys here)} */ | |
9641 | if (rop->op_first->op_type == OP_SCOPE | |
9642 | && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV) | |
9643 | { | |
9644 | rop = (UNOP*)cLISTOPx(rop->op_first)->op_last; | |
9645 | } | |
9646 | else | |
9647 | break; | |
9648 | } | |
9649 | ||
9650 | lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE); | |
00b1698f | 9651 | if (!SvPAD_TYPED(lexname)) |
e75d1f10 | 9652 | break; |
a4fc7abc | 9653 | fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE); |
e75d1f10 RD |
9654 | if (!fields || !GvHV(*fields)) |
9655 | break; | |
9656 | /* Again guessing that the pushmark can be jumped over.... */ | |
9657 | first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling) | |
9658 | ->op_first->op_sibling; | |
9659 | for (key_op = first_key_op; key_op; | |
9660 | key_op = (SVOP*)key_op->op_sibling) { | |
9661 | if (key_op->op_type != OP_CONST) | |
9662 | continue; | |
9663 | svp = cSVOPx_svp(key_op); | |
93524f2b | 9664 | key = SvPV_const(*svp, keylen); |
e75d1f10 | 9665 | if (!hv_fetch(GvHV(*fields), key, |
bb7a0f54 | 9666 | SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) |
e75d1f10 RD |
9667 | { |
9668 | Perl_croak(aTHX_ "No such class field \"%s\" " | |
9669 | "in variable %s of type %s", | |
bfcb3514 | 9670 | key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname))); |
e75d1f10 RD |
9671 | } |
9672 | } | |
9673 | break; | |
9674 | } | |
0824d667 DM |
9675 | case OP_RV2SV: |
9676 | case OP_RV2AV: | |
9677 | case OP_RV2HV: | |
9678 | if (oldop | |
9679 | && ( oldop->op_type == OP_AELEM | |
9680 | || oldop->op_type == OP_PADSV | |
9681 | || oldop->op_type == OP_RV2SV | |
9682 | || oldop->op_type == OP_RV2GV | |
9683 | || oldop->op_type == OP_HELEM | |
9684 | ) | |
9685 | && (oldop->op_private & OPpDEREF) | |
9686 | ) { | |
9687 | o->op_private |= OPpDEREFed; | |
9688 | } | |
e75d1f10 | 9689 | |
fe1bc4cf | 9690 | case OP_SORT: { |
fe1bc4cf | 9691 | /* will point to RV2AV or PADAV op on LHS/RHS of assign */ |
551405c4 | 9692 | OP *oleft; |
fe1bc4cf DM |
9693 | OP *o2; |
9694 | ||
fe1bc4cf | 9695 | /* check that RHS of sort is a single plain array */ |
551405c4 | 9696 | OP *oright = cUNOPo->op_first; |
fe1bc4cf DM |
9697 | if (!oright || oright->op_type != OP_PUSHMARK) |
9698 | break; | |
471178c0 NC |
9699 | |
9700 | /* reverse sort ... can be optimised. */ | |
9701 | if (!cUNOPo->op_sibling) { | |
9702 | /* Nothing follows us on the list. */ | |
551405c4 | 9703 | OP * const reverse = o->op_next; |
471178c0 NC |
9704 | |
9705 | if (reverse->op_type == OP_REVERSE && | |
9706 | (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) { | |
551405c4 | 9707 | OP * const pushmark = cUNOPx(reverse)->op_first; |
471178c0 NC |
9708 | if (pushmark && (pushmark->op_type == OP_PUSHMARK) |
9709 | && (cUNOPx(pushmark)->op_sibling == o)) { | |
9710 | /* reverse -> pushmark -> sort */ | |
9711 | o->op_private |= OPpSORT_REVERSE; | |
9712 | op_null(reverse); | |
9713 | pushmark->op_next = oright->op_next; | |
9714 | op_null(oright); | |
9715 | } | |
9716 | } | |
9717 | } | |
9718 | ||
9719 | /* make @a = sort @a act in-place */ | |
9720 | ||
fe1bc4cf DM |
9721 | oright = cUNOPx(oright)->op_sibling; |
9722 | if (!oright) | |
9723 | break; | |
9724 | if (oright->op_type == OP_NULL) { /* skip sort block/sub */ | |
9725 | oright = cUNOPx(oright)->op_sibling; | |
9726 | } | |
9727 | ||
2f9e2db0 VP |
9728 | oleft = is_inplace_av(o, oright); |
9729 | if (!oleft) | |
fe1bc4cf DM |
9730 | break; |
9731 | ||
9732 | /* transfer MODishness etc from LHS arg to RHS arg */ | |
9733 | oright->op_flags = oleft->op_flags; | |
9734 | o->op_private |= OPpSORT_INPLACE; | |
9735 | ||
9736 | /* excise push->gv->rv2av->null->aassign */ | |
9737 | o2 = o->op_next->op_next; | |
9738 | op_null(o2); /* PUSHMARK */ | |
9739 | o2 = o2->op_next; | |
9740 | if (o2->op_type == OP_GV) { | |
9741 | op_null(o2); /* GV */ | |
9742 | o2 = o2->op_next; | |
9743 | } | |
9744 | op_null(o2); /* RV2AV or PADAV */ | |
9745 | o2 = o2->op_next->op_next; | |
9746 | op_null(o2); /* AASSIGN */ | |
9747 | ||
9748 | o->op_next = o2->op_next; | |
9749 | ||
9750 | break; | |
9751 | } | |
ef3e5ea9 NC |
9752 | |
9753 | case OP_REVERSE: { | |
e682d7b7 | 9754 | OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av; |
ce335f37 | 9755 | OP *gvop = NULL; |
484c818f | 9756 | OP *oleft, *oright; |
ef3e5ea9 | 9757 | LISTOP *enter, *exlist; |
ef3e5ea9 | 9758 | |
484c818f VP |
9759 | /* @a = reverse @a */ |
9760 | if ((oright = cLISTOPo->op_first) | |
9761 | && (oright->op_type == OP_PUSHMARK) | |
9762 | && (oright = oright->op_sibling) | |
9763 | && (oleft = is_inplace_av(o, oright))) { | |
9764 | OP *o2; | |
9765 | ||
9766 | /* transfer MODishness etc from LHS arg to RHS arg */ | |
9767 | oright->op_flags = oleft->op_flags; | |
9768 | o->op_private |= OPpREVERSE_INPLACE; | |
9769 | ||
9770 | /* excise push->gv->rv2av->null->aassign */ | |
9771 | o2 = o->op_next->op_next; | |
9772 | op_null(o2); /* PUSHMARK */ | |
9773 | o2 = o2->op_next; | |
9774 | if (o2->op_type == OP_GV) { | |
9775 | op_null(o2); /* GV */ | |
9776 | o2 = o2->op_next; | |
9777 | } | |
9778 | op_null(o2); /* RV2AV or PADAV */ | |
9779 | o2 = o2->op_next->op_next; | |
9780 | op_null(o2); /* AASSIGN */ | |
9781 | ||
9782 | o->op_next = o2->op_next; | |
9783 | break; | |
9784 | } | |
9785 | ||
ef3e5ea9 NC |
9786 | enter = (LISTOP *) o->op_next; |
9787 | if (!enter) | |
9788 | break; | |
9789 | if (enter->op_type == OP_NULL) { | |
9790 | enter = (LISTOP *) enter->op_next; | |
9791 | if (!enter) | |
9792 | break; | |
9793 | } | |
d46f46af NC |
9794 | /* for $a (...) will have OP_GV then OP_RV2GV here. |
9795 | for (...) just has an OP_GV. */ | |
ce335f37 NC |
9796 | if (enter->op_type == OP_GV) { |
9797 | gvop = (OP *) enter; | |
9798 | enter = (LISTOP *) enter->op_next; | |
9799 | if (!enter) | |
9800 | break; | |
d46f46af NC |
9801 | if (enter->op_type == OP_RV2GV) { |
9802 | enter = (LISTOP *) enter->op_next; | |
9803 | if (!enter) | |
ce335f37 | 9804 | break; |
d46f46af | 9805 | } |
ce335f37 NC |
9806 | } |
9807 | ||
ef3e5ea9 NC |
9808 | if (enter->op_type != OP_ENTERITER) |
9809 | break; | |
9810 | ||
9811 | iter = enter->op_next; | |
9812 | if (!iter || iter->op_type != OP_ITER) | |
9813 | break; | |
9814 | ||
ce335f37 NC |
9815 | expushmark = enter->op_first; |
9816 | if (!expushmark || expushmark->op_type != OP_NULL | |
9817 | || expushmark->op_targ != OP_PUSHMARK) | |
9818 | break; | |
9819 | ||
9820 | exlist = (LISTOP *) expushmark->op_sibling; | |
ef3e5ea9 NC |
9821 | if (!exlist || exlist->op_type != OP_NULL |
9822 | || exlist->op_targ != OP_LIST) | |
9823 | break; | |
9824 | ||
9825 | if (exlist->op_last != o) { | |
9826 | /* Mmm. Was expecting to point back to this op. */ | |
9827 | break; | |
9828 | } | |
9829 | theirmark = exlist->op_first; | |
9830 | if (!theirmark || theirmark->op_type != OP_PUSHMARK) | |
9831 | break; | |
9832 | ||
c491ecac | 9833 | if (theirmark->op_sibling != o) { |
ef3e5ea9 NC |
9834 | /* There's something between the mark and the reverse, eg |
9835 | for (1, reverse (...)) | |
9836 | so no go. */ | |
9837 | break; | |
9838 | } | |
9839 | ||
c491ecac NC |
9840 | ourmark = ((LISTOP *)o)->op_first; |
9841 | if (!ourmark || ourmark->op_type != OP_PUSHMARK) | |
9842 | break; | |
9843 | ||
ef3e5ea9 NC |
9844 | ourlast = ((LISTOP *)o)->op_last; |
9845 | if (!ourlast || ourlast->op_next != o) | |
9846 | break; | |
9847 | ||
e682d7b7 NC |
9848 | rv2av = ourmark->op_sibling; |
9849 | if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0 | |
9850 | && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS) | |
9851 | && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) { | |
9852 | /* We're just reversing a single array. */ | |
9853 | rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF; | |
9854 | enter->op_flags |= OPf_STACKED; | |
9855 | } | |
9856 | ||
ef3e5ea9 NC |
9857 | /* We don't have control over who points to theirmark, so sacrifice |
9858 | ours. */ | |
9859 | theirmark->op_next = ourmark->op_next; | |
9860 | theirmark->op_flags = ourmark->op_flags; | |
ce335f37 | 9861 | ourlast->op_next = gvop ? gvop : (OP *) enter; |
ef3e5ea9 NC |
9862 | op_null(ourmark); |
9863 | op_null(o); | |
9864 | enter->op_private |= OPpITER_REVERSED; | |
9865 | iter->op_private |= OPpITER_REVERSED; | |
9866 | ||
9867 | break; | |
9868 | } | |
e26df76a NC |
9869 | |
9870 | case OP_SASSIGN: { | |
9871 | OP *rv2gv; | |
9872 | UNOP *refgen, *rv2cv; | |
9873 | LISTOP *exlist; | |
9874 | ||
50baa5ea | 9875 | if ((o->op_flags & OPf_WANT) != OPf_WANT_VOID) |
de3370bc NC |
9876 | break; |
9877 | ||
e26df76a NC |
9878 | if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2) |
9879 | break; | |
9880 | ||
9881 | rv2gv = ((BINOP *)o)->op_last; | |
9882 | if (!rv2gv || rv2gv->op_type != OP_RV2GV) | |
9883 | break; | |
9884 | ||
9885 | refgen = (UNOP *)((BINOP *)o)->op_first; | |
9886 | ||
9887 | if (!refgen || refgen->op_type != OP_REFGEN) | |
9888 | break; | |
9889 | ||
9890 | exlist = (LISTOP *)refgen->op_first; | |
9891 | if (!exlist || exlist->op_type != OP_NULL | |
9892 | || exlist->op_targ != OP_LIST) | |
9893 | break; | |
9894 | ||
9895 | if (exlist->op_first->op_type != OP_PUSHMARK) | |
9896 | break; | |
9897 | ||
9898 | rv2cv = (UNOP*)exlist->op_last; | |
9899 | ||
9900 | if (rv2cv->op_type != OP_RV2CV) | |
9901 | break; | |
9902 | ||
9903 | assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0); | |
9904 | assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0); | |
9905 | assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0); | |
9906 | ||
9907 | o->op_private |= OPpASSIGN_CV_TO_GV; | |
9908 | rv2gv->op_private |= OPpDONT_INIT_GV; | |
9909 | rv2cv->op_private |= OPpMAY_RETURN_CONSTANT; | |
9910 | ||
9911 | break; | |
9912 | } | |
9913 | ||
fe1bc4cf | 9914 | |
0477511c NC |
9915 | case OP_QR: |
9916 | case OP_MATCH: | |
29f2e912 NC |
9917 | if (!(cPMOP->op_pmflags & PMf_ONCE)) { |
9918 | assert (!cPMOP->op_pmstashstartu.op_pmreplstart); | |
9919 | } | |
79072805 LW |
9920 | break; |
9921 | } | |
a0d0e21e | 9922 | oldop = o; |
79072805 | 9923 | } |
a0d0e21e | 9924 | LEAVE; |
79072805 | 9925 | } |
beab0874 | 9926 | |
1a0a2ba9 Z |
9927 | void |
9928 | Perl_peep(pTHX_ register OP *o) | |
9929 | { | |
9930 | CALL_RPEEP(o); | |
9931 | } | |
9932 | ||
cef6ea9d | 9933 | const char* |
1cb0ed9b | 9934 | Perl_custom_op_name(pTHX_ const OP* o) |
53e06cf0 | 9935 | { |
97aff369 | 9936 | dVAR; |
e1ec3a88 | 9937 | const IV index = PTR2IV(o->op_ppaddr); |
53e06cf0 SC |
9938 | SV* keysv; |
9939 | HE* he; | |
9940 | ||
7918f24d NC |
9941 | PERL_ARGS_ASSERT_CUSTOM_OP_NAME; |
9942 | ||
53e06cf0 | 9943 | if (!PL_custom_op_names) /* This probably shouldn't happen */ |
27da23d5 | 9944 | return (char *)PL_op_name[OP_CUSTOM]; |
53e06cf0 SC |
9945 | |
9946 | keysv = sv_2mortal(newSViv(index)); | |
9947 | ||
9948 | he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0); | |
9949 | if (!he) | |
27da23d5 | 9950 | return (char *)PL_op_name[OP_CUSTOM]; /* Don't know who you are */ |
53e06cf0 SC |
9951 | |
9952 | return SvPV_nolen(HeVAL(he)); | |
9953 | } | |
9954 | ||
cef6ea9d | 9955 | const char* |
1cb0ed9b | 9956 | Perl_custom_op_desc(pTHX_ const OP* o) |
53e06cf0 | 9957 | { |
97aff369 | 9958 | dVAR; |
e1ec3a88 | 9959 | const IV index = PTR2IV(o->op_ppaddr); |
53e06cf0 SC |
9960 | SV* keysv; |
9961 | HE* he; | |
9962 | ||
7918f24d NC |
9963 | PERL_ARGS_ASSERT_CUSTOM_OP_DESC; |
9964 | ||
53e06cf0 | 9965 | if (!PL_custom_op_descs) |
27da23d5 | 9966 | return (char *)PL_op_desc[OP_CUSTOM]; |
53e06cf0 SC |
9967 | |
9968 | keysv = sv_2mortal(newSViv(index)); | |
9969 | ||
9970 | he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0); | |
9971 | if (!he) | |
27da23d5 | 9972 | return (char *)PL_op_desc[OP_CUSTOM]; |
53e06cf0 SC |
9973 | |
9974 | return SvPV_nolen(HeVAL(he)); | |
9975 | } | |
19e8ce8e | 9976 | |
beab0874 JT |
9977 | #include "XSUB.h" |
9978 | ||
9979 | /* Efficient sub that returns a constant scalar value. */ | |
9980 | static void | |
acfe0abc | 9981 | const_sv_xsub(pTHX_ CV* cv) |
beab0874 | 9982 | { |
97aff369 | 9983 | dVAR; |
beab0874 | 9984 | dXSARGS; |
99ab892b | 9985 | SV *const sv = MUTABLE_SV(XSANY.any_ptr); |
9cbac4c7 | 9986 | if (items != 0) { |
6f207bd3 | 9987 | NOOP; |
9cbac4c7 | 9988 | #if 0 |
fe13d51d | 9989 | /* diag_listed_as: SKIPME */ |
9cbac4c7 | 9990 | Perl_croak(aTHX_ "usage: %s::%s()", |
bfcb3514 | 9991 | HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv))); |
9cbac4c7 DM |
9992 | #endif |
9993 | } | |
99ab892b NC |
9994 | if (!sv) { |
9995 | XSRETURN(0); | |
9996 | } | |
9a049f1c | 9997 | EXTEND(sp, 1); |
99ab892b | 9998 | ST(0) = sv; |
beab0874 JT |
9999 | XSRETURN(1); |
10000 | } | |
4946a0fa NC |
10001 | |
10002 | /* | |
10003 | * Local variables: | |
10004 | * c-indentation-style: bsd | |
10005 | * c-basic-offset: 4 | |
10006 | * indent-tabs-mode: t | |
10007 | * End: | |
10008 | * | |
37442d52 RGS |
10009 | * ex: set ts=8 sts=4 sw=4 noet: |
10010 | */ |