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" |
2846acbf | 105 | #include "feature.h" |
74529a43 | 106 | #include "regcomp.h" |
79072805 | 107 | |
16c91539 | 108 | #define CALL_PEEP(o) PL_peepp(aTHX_ o) |
1a0a2ba9 | 109 | #define CALL_RPEEP(o) PL_rpeepp(aTHX_ o) |
16c91539 | 110 | #define CALL_OPFREEHOOK(o) if (PL_opfreehook) PL_opfreehook(aTHX_ o) |
a2efc822 | 111 | |
8be227ab FC |
112 | /* See the explanatory comments above struct opslab in op.h. */ |
113 | ||
7aef8e5b | 114 | #ifdef PERL_DEBUG_READONLY_OPS |
3107b51f FC |
115 | # define PERL_SLAB_SIZE 128 |
116 | # define PERL_MAX_SLAB_SIZE 4096 | |
117 | # include <sys/mman.h> | |
7aef8e5b | 118 | #endif |
3107b51f | 119 | |
7aef8e5b | 120 | #ifndef PERL_SLAB_SIZE |
8be227ab | 121 | # define PERL_SLAB_SIZE 64 |
7aef8e5b FC |
122 | #endif |
123 | #ifndef PERL_MAX_SLAB_SIZE | |
e6cee8c0 | 124 | # define PERL_MAX_SLAB_SIZE 2048 |
7aef8e5b | 125 | #endif |
8be227ab FC |
126 | |
127 | /* rounds up to nearest pointer */ | |
7aef8e5b FC |
128 | #define SIZE_TO_PSIZE(x) (((x) + sizeof(I32 *) - 1)/sizeof(I32 *)) |
129 | #define DIFF(o,p) ((size_t)((I32 **)(p) - (I32**)(o))) | |
8be227ab FC |
130 | |
131 | static OPSLAB * | |
132 | S_new_slab(pTHX_ size_t sz) | |
133 | { | |
7aef8e5b | 134 | #ifdef PERL_DEBUG_READONLY_OPS |
3107b51f FC |
135 | OPSLAB *slab = (OPSLAB *) mmap(0, sz * sizeof(I32 *), |
136 | PROT_READ|PROT_WRITE, | |
137 | MAP_ANON|MAP_PRIVATE, -1, 0); | |
138 | DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n", | |
139 | (unsigned long) sz, slab)); | |
140 | if (slab == MAP_FAILED) { | |
141 | perror("mmap failed"); | |
142 | abort(); | |
143 | } | |
144 | slab->opslab_size = (U16)sz; | |
7aef8e5b | 145 | #else |
8be227ab | 146 | OPSLAB *slab = (OPSLAB *)PerlMemShared_calloc(sz, sizeof(I32 *)); |
7aef8e5b | 147 | #endif |
8be227ab FC |
148 | slab->opslab_first = (OPSLOT *)((I32 **)slab + sz - 1); |
149 | return slab; | |
150 | } | |
151 | ||
e7372881 FC |
152 | /* requires double parens and aTHX_ */ |
153 | #define DEBUG_S_warn(args) \ | |
154 | DEBUG_S( \ | |
155 | PerlIO_printf(Perl_debug_log, "%s", SvPVx_nolen(Perl_mess args)) \ | |
156 | ) | |
157 | ||
8be227ab FC |
158 | void * |
159 | Perl_Slab_Alloc(pTHX_ size_t sz) | |
160 | { | |
161 | dVAR; | |
162 | OPSLAB *slab; | |
163 | OPSLAB *slab2; | |
164 | OPSLOT *slot; | |
165 | OP *o; | |
5cb52f30 | 166 | size_t opsz, space; |
8be227ab | 167 | |
2073970f NC |
168 | /* We only allocate ops from the slab during subroutine compilation. |
169 | We find the slab via PL_compcv, hence that must be non-NULL. It could | |
170 | also be pointing to a subroutine which is now fully set up (CvROOT() | |
171 | pointing to the top of the optree for that sub), or a subroutine | |
172 | which isn't using the slab allocator. If our sanity checks aren't met, | |
173 | don't use a slab, but allocate the OP directly from the heap. */ | |
8be227ab FC |
174 | if (!PL_compcv || CvROOT(PL_compcv) |
175 | || (CvSTART(PL_compcv) && !CvSLABBED(PL_compcv))) | |
176 | return PerlMemShared_calloc(1, sz); | |
177 | ||
2073970f NC |
178 | /* While the subroutine is under construction, the slabs are accessed via |
179 | CvSTART(), to avoid needing to expand PVCV by one pointer for something | |
180 | unneeded at runtime. Once a subroutine is constructed, the slabs are | |
181 | accessed via CvROOT(). So if CvSTART() is NULL, no slab has been | |
182 | allocated yet. See the commit message for 8be227ab5eaa23f2 for more | |
183 | details. */ | |
184 | if (!CvSTART(PL_compcv)) { | |
8be227ab FC |
185 | CvSTART(PL_compcv) = |
186 | (OP *)(slab = S_new_slab(aTHX_ PERL_SLAB_SIZE)); | |
187 | CvSLABBED_on(PL_compcv); | |
188 | slab->opslab_refcnt = 2; /* one for the CV; one for the new OP */ | |
189 | } | |
190 | else ++(slab = (OPSLAB *)CvSTART(PL_compcv))->opslab_refcnt; | |
191 | ||
5cb52f30 FC |
192 | opsz = SIZE_TO_PSIZE(sz); |
193 | sz = opsz + OPSLOT_HEADER_P; | |
8be227ab | 194 | |
2073970f NC |
195 | /* The slabs maintain a free list of OPs. In particular, constant folding |
196 | will free up OPs, so it makes sense to re-use them where possible. A | |
197 | freed up slot is used in preference to a new allocation. */ | |
8be227ab FC |
198 | if (slab->opslab_freed) { |
199 | OP **too = &slab->opslab_freed; | |
200 | o = *too; | |
e7372881 | 201 | DEBUG_S_warn((aTHX_ "found free op at %p, slab %p", o, slab)); |
8be227ab | 202 | while (o && DIFF(OpSLOT(o), OpSLOT(o)->opslot_next) < sz) { |
e7372881 | 203 | DEBUG_S_warn((aTHX_ "Alas! too small")); |
8be227ab | 204 | o = *(too = &o->op_next); |
94b67eb2 | 205 | if (o) { DEBUG_S_warn((aTHX_ "found another free op at %p", o)); } |
8be227ab FC |
206 | } |
207 | if (o) { | |
208 | *too = o->op_next; | |
5cb52f30 | 209 | Zero(o, opsz, I32 *); |
8be227ab FC |
210 | o->op_slabbed = 1; |
211 | return (void *)o; | |
212 | } | |
213 | } | |
214 | ||
7aef8e5b | 215 | #define INIT_OPSLOT \ |
8be227ab FC |
216 | slot->opslot_slab = slab; \ |
217 | slot->opslot_next = slab2->opslab_first; \ | |
218 | slab2->opslab_first = slot; \ | |
219 | o = &slot->opslot_op; \ | |
220 | o->op_slabbed = 1 | |
221 | ||
222 | /* The partially-filled slab is next in the chain. */ | |
223 | slab2 = slab->opslab_next ? slab->opslab_next : slab; | |
224 | if ((space = DIFF(&slab2->opslab_slots, slab2->opslab_first)) < sz) { | |
225 | /* Remaining space is too small. */ | |
226 | ||
8be227ab FC |
227 | /* If we can fit a BASEOP, add it to the free chain, so as not |
228 | to waste it. */ | |
229 | if (space >= SIZE_TO_PSIZE(sizeof(OP)) + OPSLOT_HEADER_P) { | |
230 | slot = &slab2->opslab_slots; | |
231 | INIT_OPSLOT; | |
232 | o->op_type = OP_FREED; | |
233 | o->op_next = slab->opslab_freed; | |
234 | slab->opslab_freed = o; | |
235 | } | |
236 | ||
237 | /* Create a new slab. Make this one twice as big. */ | |
238 | slot = slab2->opslab_first; | |
239 | while (slot->opslot_next) slot = slot->opslot_next; | |
af7751f6 FC |
240 | slab2 = S_new_slab(aTHX_ |
241 | (DIFF(slab2, slot)+1)*2 > PERL_MAX_SLAB_SIZE | |
e6cee8c0 | 242 | ? PERL_MAX_SLAB_SIZE |
af7751f6 | 243 | : (DIFF(slab2, slot)+1)*2); |
9963ffa2 FC |
244 | slab2->opslab_next = slab->opslab_next; |
245 | slab->opslab_next = slab2; | |
8be227ab FC |
246 | } |
247 | assert(DIFF(&slab2->opslab_slots, slab2->opslab_first) >= sz); | |
248 | ||
249 | /* Create a new op slot */ | |
250 | slot = (OPSLOT *)((I32 **)slab2->opslab_first - sz); | |
251 | assert(slot >= &slab2->opslab_slots); | |
51c777ca FC |
252 | if (DIFF(&slab2->opslab_slots, slot) |
253 | < SIZE_TO_PSIZE(sizeof(OP)) + OPSLOT_HEADER_P) | |
254 | slot = &slab2->opslab_slots; | |
8be227ab | 255 | INIT_OPSLOT; |
e7372881 | 256 | DEBUG_S_warn((aTHX_ "allocating op at %p, slab %p", o, slab)); |
8be227ab FC |
257 | return (void *)o; |
258 | } | |
259 | ||
7aef8e5b | 260 | #undef INIT_OPSLOT |
8be227ab | 261 | |
7aef8e5b | 262 | #ifdef PERL_DEBUG_READONLY_OPS |
3107b51f FC |
263 | void |
264 | Perl_Slab_to_ro(pTHX_ OPSLAB *slab) | |
265 | { | |
266 | PERL_ARGS_ASSERT_SLAB_TO_RO; | |
267 | ||
268 | if (slab->opslab_readonly) return; | |
269 | slab->opslab_readonly = 1; | |
270 | for (; slab; slab = slab->opslab_next) { | |
271 | /*DEBUG_U(PerlIO_printf(Perl_debug_log,"mprotect ->ro %lu at %p\n", | |
272 | (unsigned long) slab->opslab_size, slab));*/ | |
273 | if (mprotect(slab, slab->opslab_size * sizeof(I32 *), PROT_READ)) | |
274 | Perl_warn(aTHX_ "mprotect for %p %lu failed with %d", slab, | |
275 | (unsigned long)slab->opslab_size, errno); | |
276 | } | |
277 | } | |
278 | ||
7bbbc3c0 NC |
279 | void |
280 | Perl_Slab_to_rw(pTHX_ OPSLAB *const slab) | |
3107b51f | 281 | { |
3107b51f FC |
282 | OPSLAB *slab2; |
283 | ||
284 | PERL_ARGS_ASSERT_SLAB_TO_RW; | |
285 | ||
3107b51f FC |
286 | if (!slab->opslab_readonly) return; |
287 | slab2 = slab; | |
288 | for (; slab2; slab2 = slab2->opslab_next) { | |
289 | /*DEBUG_U(PerlIO_printf(Perl_debug_log,"mprotect ->rw %lu at %p\n", | |
290 | (unsigned long) size, slab2));*/ | |
291 | if (mprotect((void *)slab2, slab2->opslab_size * sizeof(I32 *), | |
292 | PROT_READ|PROT_WRITE)) { | |
293 | Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d", slab, | |
294 | (unsigned long)slab2->opslab_size, errno); | |
295 | } | |
296 | } | |
297 | slab->opslab_readonly = 0; | |
298 | } | |
299 | ||
300 | #else | |
9e4d7a13 | 301 | # define Slab_to_rw(op) NOOP |
3107b51f FC |
302 | #endif |
303 | ||
8be227ab FC |
304 | /* This cannot possibly be right, but it was copied from the old slab |
305 | allocator, to which it was originally added, without explanation, in | |
306 | commit 083fcd5. */ | |
7aef8e5b | 307 | #ifdef NETWARE |
8be227ab | 308 | # define PerlMemShared PerlMem |
7aef8e5b | 309 | #endif |
8be227ab FC |
310 | |
311 | void | |
312 | Perl_Slab_Free(pTHX_ void *op) | |
313 | { | |
20429ba0 | 314 | dVAR; |
8be227ab FC |
315 | OP * const o = (OP *)op; |
316 | OPSLAB *slab; | |
317 | ||
318 | PERL_ARGS_ASSERT_SLAB_FREE; | |
319 | ||
320 | if (!o->op_slabbed) { | |
90840c5d RU |
321 | if (!o->op_static) |
322 | PerlMemShared_free(op); | |
8be227ab FC |
323 | return; |
324 | } | |
325 | ||
326 | slab = OpSLAB(o); | |
327 | /* If this op is already freed, our refcount will get screwy. */ | |
328 | assert(o->op_type != OP_FREED); | |
329 | o->op_type = OP_FREED; | |
330 | o->op_next = slab->opslab_freed; | |
331 | slab->opslab_freed = o; | |
e7372881 | 332 | DEBUG_S_warn((aTHX_ "free op at %p, recorded in slab %p", o, slab)); |
8be227ab FC |
333 | OpslabREFCNT_dec_padok(slab); |
334 | } | |
335 | ||
336 | void | |
337 | Perl_opslab_free_nopad(pTHX_ OPSLAB *slab) | |
338 | { | |
339 | dVAR; | |
340 | const bool havepad = !!PL_comppad; | |
341 | PERL_ARGS_ASSERT_OPSLAB_FREE_NOPAD; | |
342 | if (havepad) { | |
343 | ENTER; | |
344 | PAD_SAVE_SETNULLPAD(); | |
345 | } | |
346 | opslab_free(slab); | |
347 | if (havepad) LEAVE; | |
348 | } | |
349 | ||
350 | void | |
351 | Perl_opslab_free(pTHX_ OPSLAB *slab) | |
352 | { | |
20429ba0 | 353 | dVAR; |
8be227ab FC |
354 | OPSLAB *slab2; |
355 | PERL_ARGS_ASSERT_OPSLAB_FREE; | |
e7372881 | 356 | DEBUG_S_warn((aTHX_ "freeing slab %p", slab)); |
8be227ab FC |
357 | assert(slab->opslab_refcnt == 1); |
358 | for (; slab; slab = slab2) { | |
359 | slab2 = slab->opslab_next; | |
7aef8e5b | 360 | #ifdef DEBUGGING |
8be227ab | 361 | slab->opslab_refcnt = ~(size_t)0; |
7aef8e5b FC |
362 | #endif |
363 | #ifdef PERL_DEBUG_READONLY_OPS | |
3107b51f FC |
364 | DEBUG_m(PerlIO_printf(Perl_debug_log, "Deallocate slab at %p\n", |
365 | slab)); | |
366 | if (munmap(slab, slab->opslab_size * sizeof(I32 *))) { | |
367 | perror("munmap failed"); | |
368 | abort(); | |
369 | } | |
7aef8e5b | 370 | #else |
8be227ab | 371 | PerlMemShared_free(slab); |
7aef8e5b | 372 | #endif |
8be227ab FC |
373 | } |
374 | } | |
375 | ||
376 | void | |
377 | Perl_opslab_force_free(pTHX_ OPSLAB *slab) | |
378 | { | |
379 | OPSLAB *slab2; | |
380 | OPSLOT *slot; | |
7aef8e5b | 381 | #ifdef DEBUGGING |
8be227ab | 382 | size_t savestack_count = 0; |
7aef8e5b | 383 | #endif |
8be227ab FC |
384 | PERL_ARGS_ASSERT_OPSLAB_FORCE_FREE; |
385 | slab2 = slab; | |
386 | do { | |
387 | for (slot = slab2->opslab_first; | |
388 | slot->opslot_next; | |
389 | slot = slot->opslot_next) { | |
390 | if (slot->opslot_op.op_type != OP_FREED | |
391 | && !(slot->opslot_op.op_savefree | |
7aef8e5b | 392 | #ifdef DEBUGGING |
8be227ab | 393 | && ++savestack_count |
7aef8e5b | 394 | #endif |
8be227ab FC |
395 | ) |
396 | ) { | |
397 | assert(slot->opslot_op.op_slabbed); | |
8be227ab | 398 | op_free(&slot->opslot_op); |
3bf28c7e | 399 | if (slab->opslab_refcnt == 1) goto free; |
8be227ab FC |
400 | } |
401 | } | |
402 | } while ((slab2 = slab2->opslab_next)); | |
403 | /* > 1 because the CV still holds a reference count. */ | |
404 | if (slab->opslab_refcnt > 1) { /* still referenced by the savestack */ | |
7aef8e5b | 405 | #ifdef DEBUGGING |
8be227ab | 406 | assert(savestack_count == slab->opslab_refcnt-1); |
7aef8e5b | 407 | #endif |
ee5ee853 FC |
408 | /* Remove the CV’s reference count. */ |
409 | slab->opslab_refcnt--; | |
8be227ab FC |
410 | return; |
411 | } | |
412 | free: | |
413 | opslab_free(slab); | |
414 | } | |
415 | ||
3107b51f FC |
416 | #ifdef PERL_DEBUG_READONLY_OPS |
417 | OP * | |
418 | Perl_op_refcnt_inc(pTHX_ OP *o) | |
419 | { | |
420 | if(o) { | |
372eab01 NC |
421 | OPSLAB *const slab = o->op_slabbed ? OpSLAB(o) : NULL; |
422 | if (slab && slab->opslab_readonly) { | |
83519873 | 423 | Slab_to_rw(slab); |
372eab01 NC |
424 | ++o->op_targ; |
425 | Slab_to_ro(slab); | |
426 | } else { | |
427 | ++o->op_targ; | |
428 | } | |
3107b51f FC |
429 | } |
430 | return o; | |
431 | ||
432 | } | |
433 | ||
434 | PADOFFSET | |
435 | Perl_op_refcnt_dec(pTHX_ OP *o) | |
436 | { | |
372eab01 NC |
437 | PADOFFSET result; |
438 | OPSLAB *const slab = o->op_slabbed ? OpSLAB(o) : NULL; | |
439 | ||
3107b51f | 440 | PERL_ARGS_ASSERT_OP_REFCNT_DEC; |
372eab01 NC |
441 | |
442 | if (slab && slab->opslab_readonly) { | |
83519873 | 443 | Slab_to_rw(slab); |
372eab01 NC |
444 | result = --o->op_targ; |
445 | Slab_to_ro(slab); | |
446 | } else { | |
447 | result = --o->op_targ; | |
448 | } | |
449 | return result; | |
3107b51f FC |
450 | } |
451 | #endif | |
e50aee73 | 452 | /* |
ce6f1cbc | 453 | * In the following definition, the ", (OP*)0" is just to make the compiler |
a5f75d66 | 454 | * think the expression is of the right type: croak actually does a Siglongjmp. |
e50aee73 | 455 | */ |
11343788 | 456 | #define CHECKOP(type,o) \ |
ce6f1cbc | 457 | ((PL_op_mask && PL_op_mask[type]) \ |
5dc0d613 | 458 | ? ( op_free((OP*)o), \ |
cb77fdf0 | 459 | Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \ |
ce6f1cbc | 460 | (OP*)0 ) \ |
16c91539 | 461 | : PL_check[type](aTHX_ (OP*)o)) |
e50aee73 | 462 | |
e6438c1a | 463 | #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2) |
c53d7c7d | 464 | |
cba5a3b0 DG |
465 | #define CHANGE_TYPE(o,type) \ |
466 | STMT_START { \ | |
467 | o->op_type = (OPCODE)type; \ | |
468 | o->op_ppaddr = PL_ppaddr[type]; \ | |
469 | } STMT_END | |
470 | ||
ce16c625 | 471 | STATIC SV* |
cea2e8a9 | 472 | S_gv_ename(pTHX_ GV *gv) |
4633a7c4 | 473 | { |
46c461b5 | 474 | SV* const tmpsv = sv_newmortal(); |
7918f24d NC |
475 | |
476 | PERL_ARGS_ASSERT_GV_ENAME; | |
477 | ||
bd61b366 | 478 | gv_efullname3(tmpsv, gv, NULL); |
ce16c625 | 479 | return tmpsv; |
4633a7c4 LW |
480 | } |
481 | ||
76e3520e | 482 | STATIC OP * |
cea2e8a9 | 483 | S_no_fh_allowed(pTHX_ OP *o) |
79072805 | 484 | { |
7918f24d NC |
485 | PERL_ARGS_ASSERT_NO_FH_ALLOWED; |
486 | ||
cea2e8a9 | 487 | yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function", |
53e06cf0 | 488 | OP_DESC(o))); |
11343788 | 489 | return o; |
79072805 LW |
490 | } |
491 | ||
76e3520e | 492 | STATIC OP * |
ce16c625 | 493 | S_too_few_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags) |
79072805 | 494 | { |
ce16c625 BF |
495 | PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_SV; |
496 | yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %"SVf, namesv), | |
497 | SvUTF8(namesv) | flags); | |
498 | return o; | |
499 | } | |
500 | ||
501 | STATIC OP * | |
502 | S_too_few_arguments_pv(pTHX_ OP *o, const char* name, U32 flags) | |
503 | { | |
504 | PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_PV; | |
505 | yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %s", name), flags); | |
506 | return o; | |
507 | } | |
508 | ||
509 | STATIC OP * | |
510 | S_too_many_arguments_pv(pTHX_ OP *o, const char *name, U32 flags) | |
511 | { | |
512 | PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_PV; | |
7918f24d | 513 | |
ce16c625 | 514 | yyerror_pv(Perl_form(aTHX_ "Too many arguments for %s", name), flags); |
11343788 | 515 | return o; |
79072805 LW |
516 | } |
517 | ||
76e3520e | 518 | STATIC OP * |
ce16c625 | 519 | S_too_many_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags) |
79072805 | 520 | { |
ce16c625 | 521 | PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_SV; |
7918f24d | 522 | |
ce16c625 BF |
523 | yyerror_pv(Perl_form(aTHX_ "Too many arguments for %"SVf, SVfARG(namesv)), |
524 | SvUTF8(namesv) | flags); | |
11343788 | 525 | return o; |
79072805 LW |
526 | } |
527 | ||
76e3520e | 528 | STATIC void |
ce16c625 | 529 | S_bad_type_pv(pTHX_ I32 n, const char *t, const char *name, U32 flags, const OP *kid) |
8990e307 | 530 | { |
ce16c625 BF |
531 | PERL_ARGS_ASSERT_BAD_TYPE_PV; |
532 | ||
533 | yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)", | |
534 | (int)n, name, t, OP_DESC(kid)), flags); | |
535 | } | |
7918f24d | 536 | |
ce16c625 | 537 | STATIC void |
7b3b0904 | 538 | S_bad_type_gv(pTHX_ I32 n, const char *t, GV *gv, U32 flags, const OP *kid) |
ce16c625 | 539 | { |
7b3b0904 FC |
540 | SV * const namesv = gv_ename(gv); |
541 | PERL_ARGS_ASSERT_BAD_TYPE_GV; | |
ce16c625 BF |
542 | |
543 | yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %"SVf" must be %s (not %s)", | |
544 | (int)n, SVfARG(namesv), t, OP_DESC(kid)), SvUTF8(namesv) | flags); | |
8990e307 LW |
545 | } |
546 | ||
7a52d87a | 547 | STATIC void |
eb796c7f | 548 | S_no_bareword_allowed(pTHX_ OP *o) |
7a52d87a | 549 | { |
7918f24d NC |
550 | PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED; |
551 | ||
eb8433b7 NC |
552 | if (PL_madskills) |
553 | return; /* various ok barewords are hidden in extra OP_NULL */ | |
5a844595 | 554 | qerror(Perl_mess(aTHX_ |
35c1215d | 555 | "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use", |
be2597df | 556 | SVfARG(cSVOPo_sv))); |
eb796c7f | 557 | o->op_private &= ~OPpCONST_STRICT; /* prevent warning twice about the same OP */ |
7a52d87a GS |
558 | } |
559 | ||
79072805 LW |
560 | /* "register" allocation */ |
561 | ||
562 | PADOFFSET | |
d6447115 | 563 | Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags) |
93a17b20 | 564 | { |
97aff369 | 565 | dVAR; |
a0d0e21e | 566 | PADOFFSET off; |
12bd6ede | 567 | const bool is_our = (PL_parser->in_my == KEY_our); |
a0d0e21e | 568 | |
7918f24d NC |
569 | PERL_ARGS_ASSERT_ALLOCMY; |
570 | ||
48d0d1be | 571 | if (flags & ~SVf_UTF8) |
d6447115 NC |
572 | Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf, |
573 | (UV)flags); | |
574 | ||
575 | /* Until we're using the length for real, cross check that we're being | |
576 | told the truth. */ | |
577 | assert(strlen(name) == len); | |
578 | ||
59f00321 | 579 | /* complain about "my $<special_var>" etc etc */ |
d6447115 | 580 | if (len && |
3edf23ff | 581 | !(is_our || |
155aba94 | 582 | isALPHA(name[1]) || |
b14845b4 | 583 | ((flags & SVf_UTF8) && isIDFIRST_utf8((U8 *)name+1)) || |
d6447115 | 584 | (name[1] == '_' && (*name == '$' || len > 2)))) |
834a4ddd | 585 | { |
6b58708b | 586 | /* name[2] is true if strlen(name) > 2 */ |
b14845b4 FC |
587 | if (!(flags & SVf_UTF8 && UTF8_IS_START(name[1])) |
588 | && (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1]))) { | |
d6447115 NC |
589 | yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"", |
590 | name[0], toCTRL(name[1]), (int)(len - 2), name + 2, | |
aab6a793 | 591 | PL_parser->in_my == KEY_state ? "state" : "my")); |
d1544d85 | 592 | } else { |
ce16c625 BF |
593 | yyerror_pv(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name, |
594 | PL_parser->in_my == KEY_state ? "state" : "my"), flags & SVf_UTF8); | |
46fc3d4c | 595 | } |
a0d0e21e | 596 | } |
4055dbce RS |
597 | else if (len == 2 && name[1] == '_' && !is_our) |
598 | /* diag_listed_as: Use of my $_ is experimental */ | |
599 | Perl_ck_warner_d(aTHX_ packWARN(WARN_EXPERIMENTAL__LEXICAL_TOPIC), | |
600 | "Use of %s $_ is experimental", | |
601 | PL_parser->in_my == KEY_state | |
602 | ? "state" | |
603 | : "my"); | |
748a9306 | 604 | |
dd2155a4 | 605 | /* allocate a spare slot and store the name in that slot */ |
93a17b20 | 606 | |
cc76b5cc | 607 | off = pad_add_name_pvn(name, len, |
48d0d1be BF |
608 | (is_our ? padadd_OUR : |
609 | PL_parser->in_my == KEY_state ? padadd_STATE : 0) | |
610 | | ( flags & SVf_UTF8 ? SVf_UTF8 : 0 ), | |
12bd6ede | 611 | PL_parser->in_my_stash, |
3edf23ff | 612 | (is_our |
133706a6 RGS |
613 | /* $_ is always in main::, even with our */ |
614 | ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash) | |
5c284bb0 | 615 | : NULL |
cca43f78 | 616 | ) |
dd2155a4 | 617 | ); |
a74073ad DM |
618 | /* anon sub prototypes contains state vars should always be cloned, |
619 | * otherwise the state var would be shared between anon subs */ | |
620 | ||
621 | if (PL_parser->in_my == KEY_state && CvANON(PL_compcv)) | |
622 | CvCLONE_on(PL_compcv); | |
623 | ||
dd2155a4 | 624 | return off; |
79072805 LW |
625 | } |
626 | ||
c0b8aebd FC |
627 | /* |
628 | =for apidoc alloccopstash | |
629 | ||
630 | Available only under threaded builds, this function allocates an entry in | |
631 | C<PL_stashpad> for the stash passed to it. | |
632 | ||
633 | =cut | |
634 | */ | |
635 | ||
d4d03940 FC |
636 | #ifdef USE_ITHREADS |
637 | PADOFFSET | |
638 | Perl_alloccopstash(pTHX_ HV *hv) | |
639 | { | |
640 | PADOFFSET off = 0, o = 1; | |
641 | bool found_slot = FALSE; | |
642 | ||
643 | PERL_ARGS_ASSERT_ALLOCCOPSTASH; | |
644 | ||
645 | if (PL_stashpad[PL_stashpadix] == hv) return PL_stashpadix; | |
646 | ||
647 | for (; o < PL_stashpadmax; ++o) { | |
648 | if (PL_stashpad[o] == hv) return PL_stashpadix = o; | |
649 | if (!PL_stashpad[o] || SvTYPE(PL_stashpad[o]) != SVt_PVHV) | |
650 | found_slot = TRUE, off = o; | |
651 | } | |
652 | if (!found_slot) { | |
653 | Renew(PL_stashpad, PL_stashpadmax + 10, HV *); | |
654 | Zero(PL_stashpad + PL_stashpadmax, 10, HV *); | |
655 | off = PL_stashpadmax; | |
656 | PL_stashpadmax += 10; | |
657 | } | |
658 | ||
659 | PL_stashpad[PL_stashpadix = off] = hv; | |
660 | return off; | |
661 | } | |
662 | #endif | |
663 | ||
d2c837a0 DM |
664 | /* free the body of an op without examining its contents. |
665 | * Always use this rather than FreeOp directly */ | |
666 | ||
4136a0f7 | 667 | static void |
d2c837a0 DM |
668 | S_op_destroy(pTHX_ OP *o) |
669 | { | |
d2c837a0 DM |
670 | FreeOp(o); |
671 | } | |
672 | ||
79072805 LW |
673 | /* Destructor */ |
674 | ||
675 | void | |
864dbfa3 | 676 | Perl_op_free(pTHX_ OP *o) |
79072805 | 677 | { |
27da23d5 | 678 | dVAR; |
acb36ea4 | 679 | OPCODE type; |
79072805 | 680 | |
8be227ab FC |
681 | /* Though ops may be freed twice, freeing the op after its slab is a |
682 | big no-no. */ | |
683 | assert(!o || !o->op_slabbed || OpSLAB(o)->opslab_refcnt != ~(size_t)0); | |
8be227ab FC |
684 | /* During the forced freeing of ops after compilation failure, kidops |
685 | may be freed before their parents. */ | |
686 | if (!o || o->op_type == OP_FREED) | |
79072805 LW |
687 | return; |
688 | ||
67566ccd | 689 | type = o->op_type; |
7934575e | 690 | if (o->op_private & OPpREFCOUNTED) { |
67566ccd | 691 | switch (type) { |
7934575e GS |
692 | case OP_LEAVESUB: |
693 | case OP_LEAVESUBLV: | |
694 | case OP_LEAVEEVAL: | |
695 | case OP_LEAVE: | |
696 | case OP_SCOPE: | |
697 | case OP_LEAVEWRITE: | |
67566ccd AL |
698 | { |
699 | PADOFFSET refcnt; | |
7934575e | 700 | OP_REFCNT_LOCK; |
4026c95a | 701 | refcnt = OpREFCNT_dec(o); |
7934575e | 702 | OP_REFCNT_UNLOCK; |
bfd0ff22 NC |
703 | if (refcnt) { |
704 | /* Need to find and remove any pattern match ops from the list | |
705 | we maintain for reset(). */ | |
706 | find_and_forget_pmops(o); | |
4026c95a | 707 | return; |
67566ccd | 708 | } |
bfd0ff22 | 709 | } |
7934575e GS |
710 | break; |
711 | default: | |
712 | break; | |
713 | } | |
714 | } | |
715 | ||
f37b8c3f VP |
716 | /* Call the op_free hook if it has been set. Do it now so that it's called |
717 | * at the right time for refcounted ops, but still before all of the kids | |
718 | * are freed. */ | |
719 | CALL_OPFREEHOOK(o); | |
720 | ||
11343788 | 721 | if (o->op_flags & OPf_KIDS) { |
eb578fdb | 722 | OP *kid, *nextkid; |
11343788 | 723 | for (kid = cUNOPo->op_first; kid; kid = nextkid) { |
85e6fe83 | 724 | nextkid = kid->op_sibling; /* Get before next freeing kid */ |
79072805 | 725 | op_free(kid); |
85e6fe83 | 726 | } |
79072805 | 727 | } |
513f78f7 FC |
728 | if (type == OP_NULL) |
729 | type = (OPCODE)o->op_targ; | |
acb36ea4 | 730 | |
9e4d7a13 NC |
731 | if (o->op_slabbed) |
732 | Slab_to_rw(OpSLAB(o)); | |
fc97af9c | 733 | |
acb36ea4 GS |
734 | /* COP* is not cleared by op_clear() so that we may track line |
735 | * numbers etc even after null() */ | |
513f78f7 | 736 | if (type == OP_NEXTSTATE || type == OP_DBSTATE) { |
acb36ea4 | 737 | cop_free((COP*)o); |
3235b7a3 | 738 | } |
acb36ea4 GS |
739 | |
740 | op_clear(o); | |
238a4c30 | 741 | FreeOp(o); |
4d494880 DM |
742 | #ifdef DEBUG_LEAKING_SCALARS |
743 | if (PL_op == o) | |
5f66b61c | 744 | PL_op = NULL; |
4d494880 | 745 | #endif |
acb36ea4 | 746 | } |
79072805 | 747 | |
93c66552 DM |
748 | void |
749 | Perl_op_clear(pTHX_ OP *o) | |
acb36ea4 | 750 | { |
13137afc | 751 | |
27da23d5 | 752 | dVAR; |
7918f24d NC |
753 | |
754 | PERL_ARGS_ASSERT_OP_CLEAR; | |
755 | ||
eb8433b7 | 756 | #ifdef PERL_MAD |
df31c78c NC |
757 | mad_free(o->op_madprop); |
758 | o->op_madprop = 0; | |
eb8433b7 NC |
759 | #endif |
760 | ||
761 | retry: | |
11343788 | 762 | switch (o->op_type) { |
acb36ea4 | 763 | case OP_NULL: /* Was holding old type, if any. */ |
eb8433b7 | 764 | if (PL_madskills && o->op_targ != OP_NULL) { |
61a59f30 | 765 | o->op_type = (Optype)o->op_targ; |
eb8433b7 NC |
766 | o->op_targ = 0; |
767 | goto retry; | |
768 | } | |
4d193d44 | 769 | case OP_ENTERTRY: |
acb36ea4 | 770 | case OP_ENTEREVAL: /* Was holding hints. */ |
acb36ea4 | 771 | o->op_targ = 0; |
a0d0e21e | 772 | break; |
a6006777 | 773 | default: |
ac4c12e7 | 774 | if (!(o->op_flags & OPf_REF) |
ef69c8fc | 775 | || (PL_check[o->op_type] != Perl_ck_ftst)) |
a6006777 | 776 | break; |
777 | /* FALL THROUGH */ | |
463ee0b2 | 778 | case OP_GVSV: |
79072805 | 779 | case OP_GV: |
a6006777 | 780 | case OP_AELEMFAST: |
93bad3fd | 781 | { |
f7461760 Z |
782 | GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV) |
783 | #ifdef USE_ITHREADS | |
784 | && PL_curpad | |
785 | #endif | |
786 | ? cGVOPo_gv : NULL; | |
b327b36f NC |
787 | /* It's possible during global destruction that the GV is freed |
788 | before the optree. Whilst the SvREFCNT_inc is happy to bump from | |
789 | 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0 | |
790 | will trigger an assertion failure, because the entry to sv_clear | |
791 | checks that the scalar is not already freed. A check of for | |
792 | !SvIS_FREED(gv) turns out to be invalid, because during global | |
793 | destruction the reference count can be forced down to zero | |
794 | (with SVf_BREAK set). In which case raising to 1 and then | |
795 | dropping to 0 triggers cleanup before it should happen. I | |
796 | *think* that this might actually be a general, systematic, | |
797 | weakness of the whole idea of SVf_BREAK, in that code *is* | |
798 | allowed to raise and lower references during global destruction, | |
799 | so any *valid* code that happens to do this during global | |
800 | destruction might well trigger premature cleanup. */ | |
801 | bool still_valid = gv && SvREFCNT(gv); | |
802 | ||
803 | if (still_valid) | |
804 | SvREFCNT_inc_simple_void(gv); | |
350de78d | 805 | #ifdef USE_ITHREADS |
6a077020 DM |
806 | if (cPADOPo->op_padix > 0) { |
807 | /* No GvIN_PAD_off(cGVOPo_gv) here, because other references | |
808 | * may still exist on the pad */ | |
809 | pad_swipe(cPADOPo->op_padix, TRUE); | |
810 | cPADOPo->op_padix = 0; | |
811 | } | |
350de78d | 812 | #else |
6a077020 | 813 | SvREFCNT_dec(cSVOPo->op_sv); |
a0714e2c | 814 | cSVOPo->op_sv = NULL; |
350de78d | 815 | #endif |
b327b36f | 816 | if (still_valid) { |
f7461760 | 817 | int try_downgrade = SvREFCNT(gv) == 2; |
fc2b2dca | 818 | SvREFCNT_dec_NN(gv); |
f7461760 Z |
819 | if (try_downgrade) |
820 | gv_try_downgrade(gv); | |
821 | } | |
6a077020 | 822 | } |
79072805 | 823 | break; |
a1ae71d2 | 824 | case OP_METHOD_NAMED: |
79072805 | 825 | case OP_CONST: |
996c9baa | 826 | case OP_HINTSEVAL: |
11343788 | 827 | SvREFCNT_dec(cSVOPo->op_sv); |
a0714e2c | 828 | cSVOPo->op_sv = NULL; |
3b1c21fa AB |
829 | #ifdef USE_ITHREADS |
830 | /** Bug #15654 | |
831 | Even if op_clear does a pad_free for the target of the op, | |
6a077020 | 832 | pad_free doesn't actually remove the sv that exists in the pad; |
3b1c21fa AB |
833 | instead it lives on. This results in that it could be reused as |
834 | a target later on when the pad was reallocated. | |
835 | **/ | |
836 | if(o->op_targ) { | |
837 | pad_swipe(o->op_targ,1); | |
838 | o->op_targ = 0; | |
839 | } | |
840 | #endif | |
79072805 | 841 | break; |
c9df4fda | 842 | case OP_DUMP: |
748a9306 LW |
843 | case OP_GOTO: |
844 | case OP_NEXT: | |
845 | case OP_LAST: | |
846 | case OP_REDO: | |
11343788 | 847 | if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS)) |
748a9306 LW |
848 | break; |
849 | /* FALL THROUGH */ | |
a0d0e21e | 850 | case OP_TRANS: |
bb16bae8 | 851 | case OP_TRANSR: |
acb36ea4 | 852 | if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) { |
99a1d0d1 | 853 | assert(o->op_type == OP_TRANS || o->op_type == OP_TRANSR); |
043e41b8 DM |
854 | #ifdef USE_ITHREADS |
855 | if (cPADOPo->op_padix > 0) { | |
856 | pad_swipe(cPADOPo->op_padix, TRUE); | |
857 | cPADOPo->op_padix = 0; | |
858 | } | |
859 | #else | |
a0ed51b3 | 860 | SvREFCNT_dec(cSVOPo->op_sv); |
a0714e2c | 861 | cSVOPo->op_sv = NULL; |
043e41b8 | 862 | #endif |
acb36ea4 GS |
863 | } |
864 | else { | |
ea71c68d | 865 | PerlMemShared_free(cPVOPo->op_pv); |
bd61b366 | 866 | cPVOPo->op_pv = NULL; |
acb36ea4 | 867 | } |
a0d0e21e LW |
868 | break; |
869 | case OP_SUBST: | |
20e98b0f | 870 | op_free(cPMOPo->op_pmreplrootu.op_pmreplroot); |
971a9dd3 | 871 | goto clear_pmop; |
748a9306 | 872 | case OP_PUSHRE: |
971a9dd3 | 873 | #ifdef USE_ITHREADS |
20e98b0f | 874 | if (cPMOPo->op_pmreplrootu.op_pmtargetoff) { |
dd2155a4 DM |
875 | /* No GvIN_PAD_off here, because other references may still |
876 | * exist on the pad */ | |
20e98b0f | 877 | pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE); |
971a9dd3 GS |
878 | } |
879 | #else | |
ad64d0ec | 880 | SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv)); |
971a9dd3 GS |
881 | #endif |
882 | /* FALL THROUGH */ | |
a0d0e21e | 883 | case OP_MATCH: |
8782bef2 | 884 | case OP_QR: |
971a9dd3 | 885 | clear_pmop: |
867940b8 DM |
886 | if (!(cPMOPo->op_pmflags & PMf_CODELIST_PRIVATE)) |
887 | op_free(cPMOPo->op_code_list); | |
68e2671b | 888 | cPMOPo->op_code_list = NULL; |
23083432 | 889 | forget_pmop(cPMOPo); |
20e98b0f | 890 | cPMOPo->op_pmreplrootu.op_pmreplroot = NULL; |
9cddf794 NC |
891 | /* we use the same protection as the "SAFE" version of the PM_ macros |
892 | * here since sv_clean_all might release some PMOPs | |
5f8cb046 DM |
893 | * after PL_regex_padav has been cleared |
894 | * and the clearing of PL_regex_padav needs to | |
895 | * happen before sv_clean_all | |
896 | */ | |
13137afc AB |
897 | #ifdef USE_ITHREADS |
898 | if(PL_regex_pad) { /* We could be in destruction */ | |
402d2eb1 | 899 | const IV offset = (cPMOPo)->op_pmoffset; |
9cddf794 | 900 | ReREFCNT_dec(PM_GETRE(cPMOPo)); |
402d2eb1 NC |
901 | PL_regex_pad[offset] = &PL_sv_undef; |
902 | sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset, | |
903 | sizeof(offset)); | |
13137afc | 904 | } |
9cddf794 NC |
905 | #else |
906 | ReREFCNT_dec(PM_GETRE(cPMOPo)); | |
907 | PM_SETRE(cPMOPo, NULL); | |
1eb1540c | 908 | #endif |
13137afc | 909 | |
a0d0e21e | 910 | break; |
79072805 LW |
911 | } |
912 | ||
743e66e6 | 913 | if (o->op_targ > 0) { |
11343788 | 914 | pad_free(o->op_targ); |
743e66e6 GS |
915 | o->op_targ = 0; |
916 | } | |
79072805 LW |
917 | } |
918 | ||
76e3520e | 919 | STATIC void |
3eb57f73 HS |
920 | S_cop_free(pTHX_ COP* cop) |
921 | { | |
7918f24d NC |
922 | PERL_ARGS_ASSERT_COP_FREE; |
923 | ||
05ec9bb3 | 924 | CopFILE_free(cop); |
0453d815 | 925 | if (! specialWARN(cop->cop_warnings)) |
72dc9ed5 | 926 | PerlMemShared_free(cop->cop_warnings); |
20439bc7 | 927 | cophh_free(CopHINTHASH_get(cop)); |
3eb57f73 HS |
928 | } |
929 | ||
c2b1997a | 930 | STATIC void |
c4bd3ae5 | 931 | S_forget_pmop(pTHX_ PMOP *const o |
c4bd3ae5 | 932 | ) |
c2b1997a NC |
933 | { |
934 | HV * const pmstash = PmopSTASH(o); | |
7918f24d NC |
935 | |
936 | PERL_ARGS_ASSERT_FORGET_PMOP; | |
937 | ||
e39a6381 | 938 | if (pmstash && !SvIS_FREED(pmstash) && SvMAGICAL(pmstash)) { |
ad64d0ec | 939 | MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab); |
c2b1997a NC |
940 | if (mg) { |
941 | PMOP **const array = (PMOP**) mg->mg_ptr; | |
942 | U32 count = mg->mg_len / sizeof(PMOP**); | |
943 | U32 i = count; | |
944 | ||
945 | while (i--) { | |
946 | if (array[i] == o) { | |
947 | /* Found it. Move the entry at the end to overwrite it. */ | |
948 | array[i] = array[--count]; | |
949 | mg->mg_len = count * sizeof(PMOP**); | |
950 | /* Could realloc smaller at this point always, but probably | |
951 | not worth it. Probably worth free()ing if we're the | |
952 | last. */ | |
953 | if(!count) { | |
954 | Safefree(mg->mg_ptr); | |
955 | mg->mg_ptr = NULL; | |
956 | } | |
957 | break; | |
958 | } | |
959 | } | |
960 | } | |
961 | } | |
1cdf7faf NC |
962 | if (PL_curpm == o) |
963 | PL_curpm = NULL; | |
c2b1997a NC |
964 | } |
965 | ||
bfd0ff22 NC |
966 | STATIC void |
967 | S_find_and_forget_pmops(pTHX_ OP *o) | |
968 | { | |
7918f24d NC |
969 | PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS; |
970 | ||
bfd0ff22 NC |
971 | if (o->op_flags & OPf_KIDS) { |
972 | OP *kid = cUNOPo->op_first; | |
973 | while (kid) { | |
974 | switch (kid->op_type) { | |
975 | case OP_SUBST: | |
976 | case OP_PUSHRE: | |
977 | case OP_MATCH: | |
978 | case OP_QR: | |
23083432 | 979 | forget_pmop((PMOP*)kid); |
bfd0ff22 NC |
980 | } |
981 | find_and_forget_pmops(kid); | |
982 | kid = kid->op_sibling; | |
983 | } | |
984 | } | |
985 | } | |
986 | ||
93c66552 DM |
987 | void |
988 | Perl_op_null(pTHX_ OP *o) | |
8990e307 | 989 | { |
27da23d5 | 990 | dVAR; |
7918f24d NC |
991 | |
992 | PERL_ARGS_ASSERT_OP_NULL; | |
993 | ||
acb36ea4 GS |
994 | if (o->op_type == OP_NULL) |
995 | return; | |
eb8433b7 NC |
996 | if (!PL_madskills) |
997 | op_clear(o); | |
11343788 MB |
998 | o->op_targ = o->op_type; |
999 | o->op_type = OP_NULL; | |
22c35a8c | 1000 | o->op_ppaddr = PL_ppaddr[OP_NULL]; |
8990e307 LW |
1001 | } |
1002 | ||
4026c95a SH |
1003 | void |
1004 | Perl_op_refcnt_lock(pTHX) | |
1005 | { | |
27da23d5 | 1006 | dVAR; |
96a5add6 | 1007 | PERL_UNUSED_CONTEXT; |
4026c95a SH |
1008 | OP_REFCNT_LOCK; |
1009 | } | |
1010 | ||
1011 | void | |
1012 | Perl_op_refcnt_unlock(pTHX) | |
1013 | { | |
27da23d5 | 1014 | dVAR; |
96a5add6 | 1015 | PERL_UNUSED_CONTEXT; |
4026c95a SH |
1016 | OP_REFCNT_UNLOCK; |
1017 | } | |
1018 | ||
79072805 LW |
1019 | /* Contextualizers */ |
1020 | ||
d9088386 Z |
1021 | /* |
1022 | =for apidoc Am|OP *|op_contextualize|OP *o|I32 context | |
1023 | ||
1024 | Applies a syntactic context to an op tree representing an expression. | |
1025 | I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>, | |
1026 | or C<G_VOID> to specify the context to apply. The modified op tree | |
1027 | is returned. | |
1028 | ||
1029 | =cut | |
1030 | */ | |
1031 | ||
1032 | OP * | |
1033 | Perl_op_contextualize(pTHX_ OP *o, I32 context) | |
1034 | { | |
1035 | PERL_ARGS_ASSERT_OP_CONTEXTUALIZE; | |
1036 | switch (context) { | |
1037 | case G_SCALAR: return scalar(o); | |
1038 | case G_ARRAY: return list(o); | |
1039 | case G_VOID: return scalarvoid(o); | |
1040 | default: | |
5637ef5b NC |
1041 | Perl_croak(aTHX_ "panic: op_contextualize bad context %ld", |
1042 | (long) context); | |
d9088386 Z |
1043 | return o; |
1044 | } | |
1045 | } | |
1046 | ||
5983a79d BM |
1047 | /* |
1048 | =head1 Optree Manipulation Functions | |
79072805 | 1049 | |
5983a79d BM |
1050 | =for apidoc Am|OP*|op_linklist|OP *o |
1051 | This function is the implementation of the L</LINKLIST> macro. It should | |
1052 | not be called directly. | |
1053 | ||
1054 | =cut | |
1055 | */ | |
1056 | ||
1057 | OP * | |
1058 | Perl_op_linklist(pTHX_ OP *o) | |
79072805 | 1059 | { |
3edf23ff | 1060 | OP *first; |
79072805 | 1061 | |
5983a79d | 1062 | PERL_ARGS_ASSERT_OP_LINKLIST; |
7918f24d | 1063 | |
11343788 MB |
1064 | if (o->op_next) |
1065 | return o->op_next; | |
79072805 LW |
1066 | |
1067 | /* establish postfix order */ | |
3edf23ff AL |
1068 | first = cUNOPo->op_first; |
1069 | if (first) { | |
eb578fdb | 1070 | OP *kid; |
3edf23ff AL |
1071 | o->op_next = LINKLIST(first); |
1072 | kid = first; | |
1073 | for (;;) { | |
1074 | if (kid->op_sibling) { | |
79072805 | 1075 | kid->op_next = LINKLIST(kid->op_sibling); |
3edf23ff AL |
1076 | kid = kid->op_sibling; |
1077 | } else { | |
11343788 | 1078 | kid->op_next = o; |
3edf23ff AL |
1079 | break; |
1080 | } | |
79072805 LW |
1081 | } |
1082 | } | |
1083 | else | |
11343788 | 1084 | o->op_next = o; |
79072805 | 1085 | |
11343788 | 1086 | return o->op_next; |
79072805 LW |
1087 | } |
1088 | ||
1f676739 | 1089 | static OP * |
2dd5337b | 1090 | S_scalarkids(pTHX_ OP *o) |
79072805 | 1091 | { |
11343788 | 1092 | if (o && o->op_flags & OPf_KIDS) { |
bfed75c6 | 1093 | OP *kid; |
11343788 | 1094 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
79072805 LW |
1095 | scalar(kid); |
1096 | } | |
11343788 | 1097 | return o; |
79072805 LW |
1098 | } |
1099 | ||
76e3520e | 1100 | STATIC OP * |
cea2e8a9 | 1101 | S_scalarboolean(pTHX_ OP *o) |
8990e307 | 1102 | { |
97aff369 | 1103 | dVAR; |
7918f24d NC |
1104 | |
1105 | PERL_ARGS_ASSERT_SCALARBOOLEAN; | |
1106 | ||
6b7c6d95 FC |
1107 | if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST |
1108 | && !(cBINOPo->op_first->op_flags & OPf_SPECIAL)) { | |
d008e5eb | 1109 | if (ckWARN(WARN_SYNTAX)) { |
6867be6d | 1110 | const line_t oldline = CopLINE(PL_curcop); |
a0d0e21e | 1111 | |
2b7cddde NC |
1112 | if (PL_parser && PL_parser->copline != NOLINE) { |
1113 | /* This ensures that warnings are reported at the first line | |
1114 | of the conditional, not the last. */ | |
53a7735b | 1115 | CopLINE_set(PL_curcop, PL_parser->copline); |
2b7cddde | 1116 | } |
9014280d | 1117 | Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be =="); |
57843af0 | 1118 | CopLINE_set(PL_curcop, oldline); |
d008e5eb | 1119 | } |
a0d0e21e | 1120 | } |
11343788 | 1121 | return scalar(o); |
8990e307 LW |
1122 | } |
1123 | ||
1124 | OP * | |
864dbfa3 | 1125 | Perl_scalar(pTHX_ OP *o) |
79072805 | 1126 | { |
27da23d5 | 1127 | dVAR; |
79072805 LW |
1128 | OP *kid; |
1129 | ||
a0d0e21e | 1130 | /* assumes no premature commitment */ |
13765c85 DM |
1131 | if (!o || (PL_parser && PL_parser->error_count) |
1132 | || (o->op_flags & OPf_WANT) | |
5dc0d613 | 1133 | || o->op_type == OP_RETURN) |
7e363e51 | 1134 | { |
11343788 | 1135 | return o; |
7e363e51 | 1136 | } |
79072805 | 1137 | |
5dc0d613 | 1138 | o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR; |
79072805 | 1139 | |
11343788 | 1140 | switch (o->op_type) { |
79072805 | 1141 | case OP_REPEAT: |
11343788 | 1142 | scalar(cBINOPo->op_first); |
8990e307 | 1143 | break; |
79072805 LW |
1144 | case OP_OR: |
1145 | case OP_AND: | |
1146 | case OP_COND_EXPR: | |
11343788 | 1147 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
8990e307 | 1148 | scalar(kid); |
79072805 | 1149 | break; |
a0d0e21e | 1150 | /* FALL THROUGH */ |
a6d8037e | 1151 | case OP_SPLIT: |
79072805 | 1152 | case OP_MATCH: |
8782bef2 | 1153 | case OP_QR: |
79072805 LW |
1154 | case OP_SUBST: |
1155 | case OP_NULL: | |
8990e307 | 1156 | default: |
11343788 MB |
1157 | if (o->op_flags & OPf_KIDS) { |
1158 | for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) | |
8990e307 LW |
1159 | scalar(kid); |
1160 | } | |
79072805 LW |
1161 | break; |
1162 | case OP_LEAVE: | |
1163 | case OP_LEAVETRY: | |
5dc0d613 | 1164 | kid = cLISTOPo->op_first; |
54310121 | 1165 | scalar(kid); |
25b991bf VP |
1166 | kid = kid->op_sibling; |
1167 | do_kids: | |
1168 | while (kid) { | |
1169 | OP *sib = kid->op_sibling; | |
c08f093b VP |
1170 | if (sib && kid->op_type != OP_LEAVEWHEN) |
1171 | scalarvoid(kid); | |
1172 | else | |
54310121 | 1173 | scalar(kid); |
25b991bf | 1174 | kid = sib; |
54310121 | 1175 | } |
11206fdd | 1176 | PL_curcop = &PL_compiling; |
54310121 | 1177 | break; |
748a9306 | 1178 | case OP_SCOPE: |
79072805 | 1179 | case OP_LINESEQ: |
8990e307 | 1180 | case OP_LIST: |
25b991bf VP |
1181 | kid = cLISTOPo->op_first; |
1182 | goto do_kids; | |
a801c63c | 1183 | case OP_SORT: |
a2a5de95 | 1184 | Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context"); |
553e7bb0 | 1185 | break; |
79072805 | 1186 | } |
11343788 | 1187 | return o; |
79072805 LW |
1188 | } |
1189 | ||
1190 | OP * | |
864dbfa3 | 1191 | Perl_scalarvoid(pTHX_ OP *o) |
79072805 | 1192 | { |
27da23d5 | 1193 | dVAR; |
79072805 | 1194 | OP *kid; |
095b19d1 | 1195 | SV *useless_sv = NULL; |
c445ea15 | 1196 | const char* useless = NULL; |
8990e307 | 1197 | SV* sv; |
2ebea0a1 GS |
1198 | U8 want; |
1199 | ||
7918f24d NC |
1200 | PERL_ARGS_ASSERT_SCALARVOID; |
1201 | ||
eb8433b7 NC |
1202 | /* trailing mad null ops don't count as "there" for void processing */ |
1203 | if (PL_madskills && | |
1204 | o->op_type != OP_NULL && | |
1205 | o->op_sibling && | |
1206 | o->op_sibling->op_type == OP_NULL) | |
1207 | { | |
1208 | OP *sib; | |
1209 | for (sib = o->op_sibling; | |
1210 | sib && sib->op_type == OP_NULL; | |
1211 | sib = sib->op_sibling) ; | |
1212 | ||
1213 | if (!sib) | |
1214 | return o; | |
1215 | } | |
1216 | ||
acb36ea4 | 1217 | if (o->op_type == OP_NEXTSTATE |
acb36ea4 GS |
1218 | || o->op_type == OP_DBSTATE |
1219 | || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE | |
acb36ea4 | 1220 | || o->op_targ == OP_DBSTATE))) |
2ebea0a1 | 1221 | PL_curcop = (COP*)o; /* for warning below */ |
79072805 | 1222 | |
54310121 | 1223 | /* assumes no premature commitment */ |
2ebea0a1 | 1224 | want = o->op_flags & OPf_WANT; |
13765c85 DM |
1225 | if ((want && want != OPf_WANT_SCALAR) |
1226 | || (PL_parser && PL_parser->error_count) | |
25b991bf | 1227 | || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN) |
7e363e51 | 1228 | { |
11343788 | 1229 | return o; |
7e363e51 | 1230 | } |
79072805 | 1231 | |
b162f9ea | 1232 | if ((o->op_private & OPpTARGET_MY) |
7e363e51 GS |
1233 | && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */ |
1234 | { | |
b162f9ea | 1235 | return scalar(o); /* As if inside SASSIGN */ |
7e363e51 | 1236 | } |
1c846c1f | 1237 | |
5dc0d613 | 1238 | o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID; |
79072805 | 1239 | |
11343788 | 1240 | switch (o->op_type) { |
79072805 | 1241 | default: |
22c35a8c | 1242 | if (!(PL_opargs[o->op_type] & OA_FOLDCONST)) |
8990e307 | 1243 | break; |
36477c24 | 1244 | /* FALL THROUGH */ |
1245 | case OP_REPEAT: | |
11343788 | 1246 | if (o->op_flags & OPf_STACKED) |
8990e307 | 1247 | break; |
5d82c453 GA |
1248 | goto func_ops; |
1249 | case OP_SUBSTR: | |
1250 | if (o->op_private == 4) | |
1251 | break; | |
8990e307 LW |
1252 | /* FALL THROUGH */ |
1253 | case OP_GVSV: | |
1254 | case OP_WANTARRAY: | |
1255 | case OP_GV: | |
74295f0b | 1256 | case OP_SMARTMATCH: |
8990e307 LW |
1257 | case OP_PADSV: |
1258 | case OP_PADAV: | |
1259 | case OP_PADHV: | |
1260 | case OP_PADANY: | |
1261 | case OP_AV2ARYLEN: | |
8990e307 | 1262 | case OP_REF: |
a0d0e21e LW |
1263 | case OP_REFGEN: |
1264 | case OP_SREFGEN: | |
8990e307 LW |
1265 | case OP_DEFINED: |
1266 | case OP_HEX: | |
1267 | case OP_OCT: | |
1268 | case OP_LENGTH: | |
8990e307 LW |
1269 | case OP_VEC: |
1270 | case OP_INDEX: | |
1271 | case OP_RINDEX: | |
1272 | case OP_SPRINTF: | |
1273 | case OP_AELEM: | |
1274 | case OP_AELEMFAST: | |
93bad3fd | 1275 | case OP_AELEMFAST_LEX: |
8990e307 | 1276 | case OP_ASLICE: |
8990e307 LW |
1277 | case OP_HELEM: |
1278 | case OP_HSLICE: | |
1279 | case OP_UNPACK: | |
1280 | case OP_PACK: | |
8990e307 LW |
1281 | case OP_JOIN: |
1282 | case OP_LSLICE: | |
1283 | case OP_ANONLIST: | |
1284 | case OP_ANONHASH: | |
1285 | case OP_SORT: | |
1286 | case OP_REVERSE: | |
1287 | case OP_RANGE: | |
1288 | case OP_FLIP: | |
1289 | case OP_FLOP: | |
1290 | case OP_CALLER: | |
1291 | case OP_FILENO: | |
1292 | case OP_EOF: | |
1293 | case OP_TELL: | |
1294 | case OP_GETSOCKNAME: | |
1295 | case OP_GETPEERNAME: | |
1296 | case OP_READLINK: | |
1297 | case OP_TELLDIR: | |
1298 | case OP_GETPPID: | |
1299 | case OP_GETPGRP: | |
1300 | case OP_GETPRIORITY: | |
1301 | case OP_TIME: | |
1302 | case OP_TMS: | |
1303 | case OP_LOCALTIME: | |
1304 | case OP_GMTIME: | |
1305 | case OP_GHBYNAME: | |
1306 | case OP_GHBYADDR: | |
1307 | case OP_GHOSTENT: | |
1308 | case OP_GNBYNAME: | |
1309 | case OP_GNBYADDR: | |
1310 | case OP_GNETENT: | |
1311 | case OP_GPBYNAME: | |
1312 | case OP_GPBYNUMBER: | |
1313 | case OP_GPROTOENT: | |
1314 | case OP_GSBYNAME: | |
1315 | case OP_GSBYPORT: | |
1316 | case OP_GSERVENT: | |
1317 | case OP_GPWNAM: | |
1318 | case OP_GPWUID: | |
1319 | case OP_GGRNAM: | |
1320 | case OP_GGRGID: | |
1321 | case OP_GETLOGIN: | |
78e1b766 | 1322 | case OP_PROTOTYPE: |
703227f5 | 1323 | case OP_RUNCV: |
5d82c453 | 1324 | func_ops: |
64aac5a9 | 1325 | if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO))) |
74295f0b | 1326 | /* Otherwise it's "Useless use of grep iterator" */ |
f5df4782 | 1327 | useless = OP_DESC(o); |
75068674 RGS |
1328 | break; |
1329 | ||
1330 | case OP_SPLIT: | |
1331 | kid = cLISTOPo->op_first; | |
1332 | if (kid && kid->op_type == OP_PUSHRE | |
1333 | #ifdef USE_ITHREADS | |
1334 | && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff) | |
1335 | #else | |
1336 | && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv) | |
1337 | #endif | |
1338 | useless = OP_DESC(o); | |
8990e307 LW |
1339 | break; |
1340 | ||
9f82cd5f YST |
1341 | case OP_NOT: |
1342 | kid = cUNOPo->op_first; | |
1343 | if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST && | |
bb16bae8 | 1344 | kid->op_type != OP_TRANS && kid->op_type != OP_TRANSR) { |
9f82cd5f YST |
1345 | goto func_ops; |
1346 | } | |
1347 | useless = "negative pattern binding (!~)"; | |
1348 | break; | |
1349 | ||
4f4d7508 DC |
1350 | case OP_SUBST: |
1351 | if (cPMOPo->op_pmflags & PMf_NONDESTRUCT) | |
8db9069c | 1352 | useless = "non-destructive substitution (s///r)"; |
4f4d7508 DC |
1353 | break; |
1354 | ||
bb16bae8 FC |
1355 | case OP_TRANSR: |
1356 | useless = "non-destructive transliteration (tr///r)"; | |
1357 | break; | |
1358 | ||
8990e307 LW |
1359 | case OP_RV2GV: |
1360 | case OP_RV2SV: | |
1361 | case OP_RV2AV: | |
1362 | case OP_RV2HV: | |
192587c2 | 1363 | if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) && |
11343788 | 1364 | (!o->op_sibling || o->op_sibling->op_type != OP_READLINE)) |
8990e307 LW |
1365 | useless = "a variable"; |
1366 | break; | |
79072805 LW |
1367 | |
1368 | case OP_CONST: | |
7766f137 | 1369 | sv = cSVOPo_sv; |
7a52d87a GS |
1370 | if (cSVOPo->op_private & OPpCONST_STRICT) |
1371 | no_bareword_allowed(o); | |
1372 | else { | |
d008e5eb | 1373 | if (ckWARN(WARN_VOID)) { |
e7fec78e | 1374 | /* don't warn on optimised away booleans, eg |
b5a930ec | 1375 | * use constant Foo, 5; Foo || print; */ |
e7fec78e | 1376 | if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT) |
d4c19fe8 | 1377 | useless = NULL; |
960b4253 MG |
1378 | /* the constants 0 and 1 are permitted as they are |
1379 | conventionally used as dummies in constructs like | |
1380 | 1 while some_condition_with_side_effects; */ | |
e7fec78e | 1381 | else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0)) |
d4c19fe8 | 1382 | useless = NULL; |
d008e5eb | 1383 | else if (SvPOK(sv)) { |
1e3f3188 KW |
1384 | SV * const dsv = newSVpvs(""); |
1385 | useless_sv | |
1386 | = Perl_newSVpvf(aTHX_ | |
1387 | "a constant (%s)", | |
1388 | pv_pretty(dsv, SvPVX_const(sv), | |
1389 | SvCUR(sv), 32, NULL, NULL, | |
1390 | PERL_PV_PRETTY_DUMP | |
1391 | | PERL_PV_ESCAPE_NOCLEAR | |
1392 | | PERL_PV_ESCAPE_UNI_DETECT)); | |
1393 | SvREFCNT_dec_NN(dsv); | |
d008e5eb | 1394 | } |
919f76a3 | 1395 | else if (SvOK(sv)) { |
095b19d1 | 1396 | useless_sv = Perl_newSVpvf(aTHX_ "a constant (%"SVf")", sv); |
919f76a3 RGS |
1397 | } |
1398 | else | |
1399 | useless = "a constant (undef)"; | |
8990e307 LW |
1400 | } |
1401 | } | |
93c66552 | 1402 | op_null(o); /* don't execute or even remember it */ |
79072805 LW |
1403 | break; |
1404 | ||
1405 | case OP_POSTINC: | |
11343788 | 1406 | o->op_type = OP_PREINC; /* pre-increment is faster */ |
22c35a8c | 1407 | o->op_ppaddr = PL_ppaddr[OP_PREINC]; |
79072805 LW |
1408 | break; |
1409 | ||
1410 | case OP_POSTDEC: | |
11343788 | 1411 | o->op_type = OP_PREDEC; /* pre-decrement is faster */ |
22c35a8c | 1412 | o->op_ppaddr = PL_ppaddr[OP_PREDEC]; |
79072805 LW |
1413 | break; |
1414 | ||
679d6c4e HS |
1415 | case OP_I_POSTINC: |
1416 | o->op_type = OP_I_PREINC; /* pre-increment is faster */ | |
1417 | o->op_ppaddr = PL_ppaddr[OP_I_PREINC]; | |
1418 | break; | |
1419 | ||
1420 | case OP_I_POSTDEC: | |
1421 | o->op_type = OP_I_PREDEC; /* pre-decrement is faster */ | |
1422 | o->op_ppaddr = PL_ppaddr[OP_I_PREDEC]; | |
1423 | break; | |
1424 | ||
f2f8fd84 GG |
1425 | case OP_SASSIGN: { |
1426 | OP *rv2gv; | |
1427 | UNOP *refgen, *rv2cv; | |
1428 | LISTOP *exlist; | |
1429 | ||
1430 | if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2) | |
1431 | break; | |
1432 | ||
1433 | rv2gv = ((BINOP *)o)->op_last; | |
1434 | if (!rv2gv || rv2gv->op_type != OP_RV2GV) | |
1435 | break; | |
1436 | ||
1437 | refgen = (UNOP *)((BINOP *)o)->op_first; | |
1438 | ||
1439 | if (!refgen || refgen->op_type != OP_REFGEN) | |
1440 | break; | |
1441 | ||
1442 | exlist = (LISTOP *)refgen->op_first; | |
1443 | if (!exlist || exlist->op_type != OP_NULL | |
1444 | || exlist->op_targ != OP_LIST) | |
1445 | break; | |
1446 | ||
1447 | if (exlist->op_first->op_type != OP_PUSHMARK) | |
1448 | break; | |
1449 | ||
1450 | rv2cv = (UNOP*)exlist->op_last; | |
1451 | ||
1452 | if (rv2cv->op_type != OP_RV2CV) | |
1453 | break; | |
1454 | ||
1455 | assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0); | |
1456 | assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0); | |
1457 | assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0); | |
1458 | ||
1459 | o->op_private |= OPpASSIGN_CV_TO_GV; | |
1460 | rv2gv->op_private |= OPpDONT_INIT_GV; | |
1461 | rv2cv->op_private |= OPpMAY_RETURN_CONSTANT; | |
1462 | ||
1463 | break; | |
1464 | } | |
1465 | ||
540dd770 GG |
1466 | case OP_AASSIGN: { |
1467 | inplace_aassign(o); | |
1468 | break; | |
1469 | } | |
1470 | ||
79072805 LW |
1471 | case OP_OR: |
1472 | case OP_AND: | |
edbe35ea VP |
1473 | kid = cLOGOPo->op_first; |
1474 | if (kid->op_type == OP_NOT | |
1475 | && (kid->op_flags & OPf_KIDS) | |
1476 | && !PL_madskills) { | |
1477 | if (o->op_type == OP_AND) { | |
1478 | o->op_type = OP_OR; | |
1479 | o->op_ppaddr = PL_ppaddr[OP_OR]; | |
1480 | } else { | |
1481 | o->op_type = OP_AND; | |
1482 | o->op_ppaddr = PL_ppaddr[OP_AND]; | |
1483 | } | |
1484 | op_null(kid); | |
1485 | } | |
1486 | ||
c963b151 | 1487 | case OP_DOR: |
79072805 | 1488 | case OP_COND_EXPR: |
0d863452 RH |
1489 | case OP_ENTERGIVEN: |
1490 | case OP_ENTERWHEN: | |
11343788 | 1491 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
79072805 LW |
1492 | scalarvoid(kid); |
1493 | break; | |
5aabfad6 | 1494 | |
a0d0e21e | 1495 | case OP_NULL: |
11343788 | 1496 | if (o->op_flags & OPf_STACKED) |
a0d0e21e | 1497 | break; |
5aabfad6 | 1498 | /* FALL THROUGH */ |
2ebea0a1 GS |
1499 | case OP_NEXTSTATE: |
1500 | case OP_DBSTATE: | |
79072805 LW |
1501 | case OP_ENTERTRY: |
1502 | case OP_ENTER: | |
11343788 | 1503 | if (!(o->op_flags & OPf_KIDS)) |
79072805 | 1504 | break; |
54310121 | 1505 | /* FALL THROUGH */ |
463ee0b2 | 1506 | case OP_SCOPE: |
79072805 LW |
1507 | case OP_LEAVE: |
1508 | case OP_LEAVETRY: | |
a0d0e21e | 1509 | case OP_LEAVELOOP: |
79072805 | 1510 | case OP_LINESEQ: |
79072805 | 1511 | case OP_LIST: |
0d863452 RH |
1512 | case OP_LEAVEGIVEN: |
1513 | case OP_LEAVEWHEN: | |
11343788 | 1514 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
79072805 LW |
1515 | scalarvoid(kid); |
1516 | break; | |
c90c0ff4 | 1517 | case OP_ENTEREVAL: |
5196be3e | 1518 | scalarkids(o); |
c90c0ff4 | 1519 | break; |
d6483035 | 1520 | case OP_SCALAR: |
5196be3e | 1521 | return scalar(o); |
79072805 | 1522 | } |
095b19d1 NC |
1523 | |
1524 | if (useless_sv) { | |
1525 | /* mortalise it, in case warnings are fatal. */ | |
1526 | Perl_ck_warner(aTHX_ packWARN(WARN_VOID), | |
1527 | "Useless use of %"SVf" in void context", | |
1528 | sv_2mortal(useless_sv)); | |
1529 | } | |
1530 | else if (useless) { | |
1531 | Perl_ck_warner(aTHX_ packWARN(WARN_VOID), | |
1532 | "Useless use of %s in void context", | |
1533 | useless); | |
1534 | } | |
11343788 | 1535 | return o; |
79072805 LW |
1536 | } |
1537 | ||
1f676739 | 1538 | static OP * |
412da003 | 1539 | S_listkids(pTHX_ OP *o) |
79072805 | 1540 | { |
11343788 | 1541 | if (o && o->op_flags & OPf_KIDS) { |
6867be6d | 1542 | OP *kid; |
11343788 | 1543 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
79072805 LW |
1544 | list(kid); |
1545 | } | |
11343788 | 1546 | return o; |
79072805 LW |
1547 | } |
1548 | ||
1549 | OP * | |
864dbfa3 | 1550 | Perl_list(pTHX_ OP *o) |
79072805 | 1551 | { |
27da23d5 | 1552 | dVAR; |
79072805 LW |
1553 | OP *kid; |
1554 | ||
a0d0e21e | 1555 | /* assumes no premature commitment */ |
13765c85 DM |
1556 | if (!o || (o->op_flags & OPf_WANT) |
1557 | || (PL_parser && PL_parser->error_count) | |
5dc0d613 | 1558 | || o->op_type == OP_RETURN) |
7e363e51 | 1559 | { |
11343788 | 1560 | return o; |
7e363e51 | 1561 | } |
79072805 | 1562 | |
b162f9ea | 1563 | if ((o->op_private & OPpTARGET_MY) |
7e363e51 GS |
1564 | && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */ |
1565 | { | |
b162f9ea | 1566 | return o; /* As if inside SASSIGN */ |
7e363e51 | 1567 | } |
1c846c1f | 1568 | |
5dc0d613 | 1569 | o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST; |
79072805 | 1570 | |
11343788 | 1571 | switch (o->op_type) { |
79072805 LW |
1572 | case OP_FLOP: |
1573 | case OP_REPEAT: | |
11343788 | 1574 | list(cBINOPo->op_first); |
79072805 LW |
1575 | break; |
1576 | case OP_OR: | |
1577 | case OP_AND: | |
1578 | case OP_COND_EXPR: | |
11343788 | 1579 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
79072805 LW |
1580 | list(kid); |
1581 | break; | |
1582 | default: | |
1583 | case OP_MATCH: | |
8782bef2 | 1584 | case OP_QR: |
79072805 LW |
1585 | case OP_SUBST: |
1586 | case OP_NULL: | |
11343788 | 1587 | if (!(o->op_flags & OPf_KIDS)) |
79072805 | 1588 | break; |
11343788 MB |
1589 | if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) { |
1590 | list(cBINOPo->op_first); | |
1591 | return gen_constant_list(o); | |
79072805 LW |
1592 | } |
1593 | case OP_LIST: | |
11343788 | 1594 | listkids(o); |
79072805 LW |
1595 | break; |
1596 | case OP_LEAVE: | |
1597 | case OP_LEAVETRY: | |
5dc0d613 | 1598 | kid = cLISTOPo->op_first; |
54310121 | 1599 | list(kid); |
25b991bf VP |
1600 | kid = kid->op_sibling; |
1601 | do_kids: | |
1602 | while (kid) { | |
1603 | OP *sib = kid->op_sibling; | |
c08f093b VP |
1604 | if (sib && kid->op_type != OP_LEAVEWHEN) |
1605 | scalarvoid(kid); | |
1606 | else | |
54310121 | 1607 | list(kid); |
25b991bf | 1608 | kid = sib; |
54310121 | 1609 | } |
11206fdd | 1610 | PL_curcop = &PL_compiling; |
54310121 | 1611 | break; |
748a9306 | 1612 | case OP_SCOPE: |
79072805 | 1613 | case OP_LINESEQ: |
25b991bf VP |
1614 | kid = cLISTOPo->op_first; |
1615 | goto do_kids; | |
79072805 | 1616 | } |
11343788 | 1617 | return o; |
79072805 LW |
1618 | } |
1619 | ||
1f676739 | 1620 | static OP * |
2dd5337b | 1621 | S_scalarseq(pTHX_ OP *o) |
79072805 | 1622 | { |
97aff369 | 1623 | dVAR; |
11343788 | 1624 | if (o) { |
1496a290 AL |
1625 | const OPCODE type = o->op_type; |
1626 | ||
1627 | if (type == OP_LINESEQ || type == OP_SCOPE || | |
1628 | type == OP_LEAVE || type == OP_LEAVETRY) | |
463ee0b2 | 1629 | { |
6867be6d | 1630 | OP *kid; |
11343788 | 1631 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) { |
ed6116ce | 1632 | if (kid->op_sibling) { |
463ee0b2 | 1633 | scalarvoid(kid); |
ed6116ce | 1634 | } |
463ee0b2 | 1635 | } |
3280af22 | 1636 | PL_curcop = &PL_compiling; |
79072805 | 1637 | } |
11343788 | 1638 | o->op_flags &= ~OPf_PARENS; |
3280af22 | 1639 | if (PL_hints & HINT_BLOCK_SCOPE) |
11343788 | 1640 | o->op_flags |= OPf_PARENS; |
79072805 | 1641 | } |
8990e307 | 1642 | else |
11343788 MB |
1643 | o = newOP(OP_STUB, 0); |
1644 | return o; | |
79072805 LW |
1645 | } |
1646 | ||
76e3520e | 1647 | STATIC OP * |
cea2e8a9 | 1648 | S_modkids(pTHX_ OP *o, I32 type) |
79072805 | 1649 | { |
11343788 | 1650 | if (o && o->op_flags & OPf_KIDS) { |
6867be6d | 1651 | OP *kid; |
11343788 | 1652 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
3ad73efd | 1653 | op_lvalue(kid, type); |
79072805 | 1654 | } |
11343788 | 1655 | return o; |
79072805 LW |
1656 | } |
1657 | ||
3ad73efd | 1658 | /* |
d164302a GG |
1659 | =for apidoc finalize_optree |
1660 | ||
1661 | This function finalizes the optree. Should be called directly after | |
1662 | the complete optree is built. It does some additional | |
1663 | checking which can't be done in the normal ck_xxx functions and makes | |
1664 | the tree thread-safe. | |
1665 | ||
1666 | =cut | |
1667 | */ | |
1668 | void | |
1669 | Perl_finalize_optree(pTHX_ OP* o) | |
1670 | { | |
1671 | PERL_ARGS_ASSERT_FINALIZE_OPTREE; | |
1672 | ||
1673 | ENTER; | |
1674 | SAVEVPTR(PL_curcop); | |
1675 | ||
1676 | finalize_op(o); | |
1677 | ||
1678 | LEAVE; | |
1679 | } | |
1680 | ||
60dde6b2 | 1681 | STATIC void |
d164302a GG |
1682 | S_finalize_op(pTHX_ OP* o) |
1683 | { | |
1684 | PERL_ARGS_ASSERT_FINALIZE_OP; | |
1685 | ||
1686 | #if defined(PERL_MAD) && defined(USE_ITHREADS) | |
1687 | { | |
1688 | /* Make sure mad ops are also thread-safe */ | |
1689 | MADPROP *mp = o->op_madprop; | |
1690 | while (mp) { | |
1691 | if (mp->mad_type == MAD_OP && mp->mad_vlen) { | |
1692 | OP *prop_op = (OP *) mp->mad_val; | |
1693 | /* We only need "Relocate sv to the pad for thread safety.", but this | |
1694 | easiest way to make sure it traverses everything */ | |
4dc304e0 FC |
1695 | if (prop_op->op_type == OP_CONST) |
1696 | cSVOPx(prop_op)->op_private &= ~OPpCONST_STRICT; | |
d164302a GG |
1697 | finalize_op(prop_op); |
1698 | } | |
1699 | mp = mp->mad_next; | |
1700 | } | |
1701 | } | |
1702 | #endif | |
1703 | ||
1704 | switch (o->op_type) { | |
1705 | case OP_NEXTSTATE: | |
1706 | case OP_DBSTATE: | |
1707 | PL_curcop = ((COP*)o); /* for warnings */ | |
1708 | break; | |
1709 | case OP_EXEC: | |
ea31ed66 GG |
1710 | if ( o->op_sibling |
1711 | && (o->op_sibling->op_type == OP_NEXTSTATE || o->op_sibling->op_type == OP_DBSTATE) | |
573d2b1a | 1712 | && ckWARN(WARN_EXEC)) |
d164302a | 1713 | { |
ea31ed66 GG |
1714 | if (o->op_sibling->op_sibling) { |
1715 | const OPCODE type = o->op_sibling->op_sibling->op_type; | |
d164302a GG |
1716 | if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) { |
1717 | const line_t oldline = CopLINE(PL_curcop); | |
ea31ed66 | 1718 | CopLINE_set(PL_curcop, CopLINE((COP*)o->op_sibling)); |
d164302a GG |
1719 | Perl_warner(aTHX_ packWARN(WARN_EXEC), |
1720 | "Statement unlikely to be reached"); | |
1721 | Perl_warner(aTHX_ packWARN(WARN_EXEC), | |
1722 | "\t(Maybe you meant system() when you said exec()?)\n"); | |
1723 | CopLINE_set(PL_curcop, oldline); | |
1724 | } | |
1725 | } | |
1726 | } | |
1727 | break; | |
1728 | ||
1729 | case OP_GV: | |
1730 | if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) { | |
1731 | GV * const gv = cGVOPo_gv; | |
1732 | if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) { | |
1733 | /* XXX could check prototype here instead of just carping */ | |
1734 | SV * const sv = sv_newmortal(); | |
1735 | gv_efullname3(sv, gv, NULL); | |
1736 | Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), | |
1737 | "%"SVf"() called too early to check prototype", | |
1738 | SVfARG(sv)); | |
1739 | } | |
1740 | } | |
1741 | break; | |
1742 | ||
1743 | case OP_CONST: | |
eb796c7f GG |
1744 | if (cSVOPo->op_private & OPpCONST_STRICT) |
1745 | no_bareword_allowed(o); | |
1746 | /* FALLTHROUGH */ | |
d164302a GG |
1747 | #ifdef USE_ITHREADS |
1748 | case OP_HINTSEVAL: | |
1749 | case OP_METHOD_NAMED: | |
1750 | /* Relocate sv to the pad for thread safety. | |
1751 | * Despite being a "constant", the SV is written to, | |
1752 | * for reference counts, sv_upgrade() etc. */ | |
1753 | if (cSVOPo->op_sv) { | |
325e1816 | 1754 | const PADOFFSET ix = pad_alloc(OP_CONST, SVf_READONLY); |
82b84d04 | 1755 | if (o->op_type != OP_METHOD_NAMED |
d164302a GG |
1756 | && cSVOPo->op_sv == &PL_sv_undef) { |
1757 | /* PL_sv_undef is hack - it's unsafe to store it in the | |
1758 | AV that is the pad, because av_fetch treats values of | |
1759 | PL_sv_undef as a "free" AV entry and will merrily | |
1760 | replace them with a new SV, causing pad_alloc to think | |
1761 | that this pad slot is free. (When, clearly, it is not) | |
1762 | */ | |
1763 | SvOK_off(PAD_SVl(ix)); | |
1764 | SvPADTMP_on(PAD_SVl(ix)); | |
1765 | SvREADONLY_on(PAD_SVl(ix)); | |
1766 | } | |
1767 | else { | |
1768 | SvREFCNT_dec(PAD_SVl(ix)); | |
d164302a GG |
1769 | PAD_SETSV(ix, cSVOPo->op_sv); |
1770 | /* XXX I don't know how this isn't readonly already. */ | |
e3918bb7 | 1771 | if (!SvIsCOW(PAD_SVl(ix))) SvREADONLY_on(PAD_SVl(ix)); |
d164302a GG |
1772 | } |
1773 | cSVOPo->op_sv = NULL; | |
1774 | o->op_targ = ix; | |
1775 | } | |
1776 | #endif | |
1777 | break; | |
1778 | ||
1779 | case OP_HELEM: { | |
1780 | UNOP *rop; | |
1781 | SV *lexname; | |
1782 | GV **fields; | |
1783 | SV **svp, *sv; | |
1784 | const char *key = NULL; | |
1785 | STRLEN keylen; | |
1786 | ||
1787 | if (((BINOP*)o)->op_last->op_type != OP_CONST) | |
1788 | break; | |
1789 | ||
1790 | /* Make the CONST have a shared SV */ | |
1791 | svp = cSVOPx_svp(((BINOP*)o)->op_last); | |
e3918bb7 | 1792 | if ((!SvIsCOW(sv = *svp)) |
d164302a GG |
1793 | && SvTYPE(sv) < SVt_PVMG && !SvROK(sv)) { |
1794 | key = SvPV_const(sv, keylen); | |
1795 | lexname = newSVpvn_share(key, | |
1796 | SvUTF8(sv) ? -(I32)keylen : (I32)keylen, | |
1797 | 0); | |
fc2b2dca | 1798 | SvREFCNT_dec_NN(sv); |
d164302a GG |
1799 | *svp = lexname; |
1800 | } | |
1801 | ||
1802 | if ((o->op_private & (OPpLVAL_INTRO))) | |
1803 | break; | |
1804 | ||
1805 | rop = (UNOP*)((BINOP*)o)->op_first; | |
1806 | if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV) | |
1807 | break; | |
1808 | lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE); | |
1809 | if (!SvPAD_TYPED(lexname)) | |
1810 | break; | |
1811 | fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE); | |
1812 | if (!fields || !GvHV(*fields)) | |
1813 | break; | |
1814 | key = SvPV_const(*svp, keylen); | |
1815 | if (!hv_fetch(GvHV(*fields), key, | |
1816 | SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) { | |
ce16c625 | 1817 | Perl_croak(aTHX_ "No such class field \"%"SVf"\" " |
84cf752c | 1818 | "in variable %"SVf" of type %"HEKf, |
ce16c625 | 1819 | SVfARG(*svp), SVfARG(lexname), |
84cf752c | 1820 | HEKfARG(HvNAME_HEK(SvSTASH(lexname)))); |
d164302a GG |
1821 | } |
1822 | break; | |
1823 | } | |
1824 | ||
1825 | case OP_HSLICE: { | |
1826 | UNOP *rop; | |
1827 | SV *lexname; | |
1828 | GV **fields; | |
1829 | SV **svp; | |
1830 | const char *key; | |
1831 | STRLEN keylen; | |
1832 | SVOP *first_key_op, *key_op; | |
1833 | ||
1834 | if ((o->op_private & (OPpLVAL_INTRO)) | |
1835 | /* I bet there's always a pushmark... */ | |
1836 | || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST) | |
1837 | /* hmmm, no optimization if list contains only one key. */ | |
1838 | break; | |
1839 | rop = (UNOP*)((LISTOP*)o)->op_last; | |
1840 | if (rop->op_type != OP_RV2HV) | |
1841 | break; | |
1842 | if (rop->op_first->op_type == OP_PADSV) | |
1843 | /* @$hash{qw(keys here)} */ | |
1844 | rop = (UNOP*)rop->op_first; | |
1845 | else { | |
1846 | /* @{$hash}{qw(keys here)} */ | |
1847 | if (rop->op_first->op_type == OP_SCOPE | |
1848 | && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV) | |
1849 | { | |
1850 | rop = (UNOP*)cLISTOPx(rop->op_first)->op_last; | |
1851 | } | |
1852 | else | |
1853 | break; | |
1854 | } | |
1855 | ||
1856 | lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE); | |
1857 | if (!SvPAD_TYPED(lexname)) | |
1858 | break; | |
1859 | fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE); | |
1860 | if (!fields || !GvHV(*fields)) | |
1861 | break; | |
1862 | /* Again guessing that the pushmark can be jumped over.... */ | |
1863 | first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling) | |
1864 | ->op_first->op_sibling; | |
1865 | for (key_op = first_key_op; key_op; | |
1866 | key_op = (SVOP*)key_op->op_sibling) { | |
1867 | if (key_op->op_type != OP_CONST) | |
1868 | continue; | |
1869 | svp = cSVOPx_svp(key_op); | |
1870 | key = SvPV_const(*svp, keylen); | |
1871 | if (!hv_fetch(GvHV(*fields), key, | |
1872 | SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) { | |
ce16c625 | 1873 | Perl_croak(aTHX_ "No such class field \"%"SVf"\" " |
84cf752c | 1874 | "in variable %"SVf" of type %"HEKf, |
ce16c625 | 1875 | SVfARG(*svp), SVfARG(lexname), |
84cf752c | 1876 | HEKfARG(HvNAME_HEK(SvSTASH(lexname)))); |
d164302a GG |
1877 | } |
1878 | } | |
1879 | break; | |
1880 | } | |
a7fd8ef6 | 1881 | |
d164302a GG |
1882 | case OP_SUBST: { |
1883 | if (cPMOPo->op_pmreplrootu.op_pmreplroot) | |
1884 | finalize_op(cPMOPo->op_pmreplrootu.op_pmreplroot); | |
1885 | break; | |
1886 | } | |
1887 | default: | |
1888 | break; | |
1889 | } | |
1890 | ||
1891 | if (o->op_flags & OPf_KIDS) { | |
1892 | OP *kid; | |
1893 | for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling) | |
1894 | finalize_op(kid); | |
1895 | } | |
1896 | } | |
1897 | ||
1898 | /* | |
3ad73efd Z |
1899 | =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type |
1900 | ||
1901 | Propagate lvalue ("modifiable") context to an op and its children. | |
1902 | I<type> represents the context type, roughly based on the type of op that | |
1903 | would do the modifying, although C<local()> is represented by OP_NULL, | |
1904 | because it has no op type of its own (it is signalled by a flag on | |
001c3c51 FC |
1905 | the lvalue op). |
1906 | ||
1907 | This function detects things that can't be modified, such as C<$x+1>, and | |
1908 | generates errors for them. For example, C<$x+1 = 2> would cause it to be | |
1909 | called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN. | |
1910 | ||
1911 | It also flags things that need to behave specially in an lvalue context, | |
1912 | such as C<$$x = 5> which might have to vivify a reference in C<$x>. | |
3ad73efd Z |
1913 | |
1914 | =cut | |
1915 | */ | |
ddeae0f1 | 1916 | |
79072805 | 1917 | OP * |
d3d7d28f | 1918 | Perl_op_lvalue_flags(pTHX_ OP *o, I32 type, U32 flags) |
79072805 | 1919 | { |
27da23d5 | 1920 | dVAR; |
79072805 | 1921 | OP *kid; |
ddeae0f1 DM |
1922 | /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */ |
1923 | int localize = -1; | |
79072805 | 1924 | |
13765c85 | 1925 | if (!o || (PL_parser && PL_parser->error_count)) |
11343788 | 1926 | return o; |
79072805 | 1927 | |
b162f9ea | 1928 | if ((o->op_private & OPpTARGET_MY) |
7e363e51 GS |
1929 | && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */ |
1930 | { | |
b162f9ea | 1931 | return o; |
7e363e51 | 1932 | } |
1c846c1f | 1933 | |
5c906035 GG |
1934 | assert( (o->op_flags & OPf_WANT) != OPf_WANT_VOID ); |
1935 | ||
69974ce6 FC |
1936 | if (type == OP_PRTF || type == OP_SPRINTF) type = OP_ENTERSUB; |
1937 | ||
11343788 | 1938 | switch (o->op_type) { |
68dc0745 | 1939 | case OP_UNDEF: |
3280af22 | 1940 | PL_modcount++; |
5dc0d613 | 1941 | return o; |
5f05dabc | 1942 | case OP_STUB: |
58bde88d | 1943 | if ((o->op_flags & OPf_PARENS) || PL_madskills) |
5f05dabc | 1944 | break; |
1945 | goto nomod; | |
a0d0e21e | 1946 | case OP_ENTERSUB: |
f79aa60b | 1947 | if ((type == OP_UNDEF || type == OP_REFGEN || type == OP_LOCK) && |
11343788 MB |
1948 | !(o->op_flags & OPf_STACKED)) { |
1949 | o->op_type = OP_RV2CV; /* entersub => rv2cv */ | |
767eda44 FC |
1950 | /* Both ENTERSUB and RV2CV use this bit, but for different pur- |
1951 | poses, so we need it clear. */ | |
e26df76a | 1952 | o->op_private &= ~1; |
22c35a8c | 1953 | o->op_ppaddr = PL_ppaddr[OP_RV2CV]; |
11343788 | 1954 | assert(cUNOPo->op_first->op_type == OP_NULL); |
93c66552 | 1955 | op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */ |
79072805 LW |
1956 | break; |
1957 | } | |
cd06dffe | 1958 | else { /* lvalue subroutine call */ |
777d9014 FC |
1959 | o->op_private |= OPpLVAL_INTRO |
1960 | |(OPpENTERSUB_INARGS * (type == OP_LEAVESUBLV)); | |
e6438c1a | 1961 | PL_modcount = RETURN_UNLIMITED_NUMBER; |
4978d6d9 | 1962 | if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) { |
d0887bf3 | 1963 | /* Potential lvalue context: */ |
cd06dffe GS |
1964 | o->op_private |= OPpENTERSUB_INARGS; |
1965 | break; | |
1966 | } | |
1967 | else { /* Compile-time error message: */ | |
1968 | OP *kid = cUNOPo->op_first; | |
1969 | CV *cv; | |
cd06dffe | 1970 | |
3ea285d1 AL |
1971 | if (kid->op_type != OP_PUSHMARK) { |
1972 | if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST) | |
1973 | Perl_croak(aTHX_ | |
1974 | "panic: unexpected lvalue entersub " | |
1975 | "args: type/targ %ld:%"UVuf, | |
1976 | (long)kid->op_type, (UV)kid->op_targ); | |
1977 | kid = kLISTOP->op_first; | |
1978 | } | |
cd06dffe GS |
1979 | while (kid->op_sibling) |
1980 | kid = kid->op_sibling; | |
1981 | if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) { | |
cd06dffe GS |
1982 | break; /* Postpone until runtime */ |
1983 | } | |
b2ffa427 | 1984 | |
cd06dffe GS |
1985 | kid = kUNOP->op_first; |
1986 | if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV) | |
1987 | kid = kUNOP->op_first; | |
b2ffa427 | 1988 | if (kid->op_type == OP_NULL) |
cd06dffe GS |
1989 | Perl_croak(aTHX_ |
1990 | "Unexpected constant lvalue entersub " | |
55140b79 | 1991 | "entry via type/targ %ld:%"UVuf, |
3d811634 | 1992 | (long)kid->op_type, (UV)kid->op_targ); |
cd06dffe | 1993 | if (kid->op_type != OP_GV) { |
cd06dffe GS |
1994 | break; |
1995 | } | |
b2ffa427 | 1996 | |
638eceb6 | 1997 | cv = GvCV(kGVOP_gv); |
1c846c1f | 1998 | if (!cv) |
da1dff94 | 1999 | break; |
cd06dffe GS |
2000 | if (CvLVALUE(cv)) |
2001 | break; | |
2002 | } | |
2003 | } | |
79072805 LW |
2004 | /* FALL THROUGH */ |
2005 | default: | |
a0d0e21e | 2006 | nomod: |
f5d552b4 | 2007 | if (flags & OP_LVALUE_NO_CROAK) return NULL; |
6fbb66d6 | 2008 | /* grep, foreach, subcalls, refgen */ |
145b2bbb FC |
2009 | if (type == OP_GREPSTART || type == OP_ENTERSUB |
2010 | || type == OP_REFGEN || type == OP_LEAVESUBLV) | |
a0d0e21e | 2011 | break; |
cea2e8a9 | 2012 | yyerror(Perl_form(aTHX_ "Can't modify %s in %s", |
638bc118 | 2013 | (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL) |
cd06dffe GS |
2014 | ? "do block" |
2015 | : (o->op_type == OP_ENTERSUB | |
2016 | ? "non-lvalue subroutine call" | |
53e06cf0 | 2017 | : OP_DESC(o))), |
22c35a8c | 2018 | type ? PL_op_desc[type] : "local")); |
11343788 | 2019 | return o; |
79072805 | 2020 | |
a0d0e21e LW |
2021 | case OP_PREINC: |
2022 | case OP_PREDEC: | |
2023 | case OP_POW: | |
2024 | case OP_MULTIPLY: | |
2025 | case OP_DIVIDE: | |
2026 | case OP_MODULO: | |
2027 | case OP_REPEAT: | |
2028 | case OP_ADD: | |
2029 | case OP_SUBTRACT: | |
2030 | case OP_CONCAT: | |
2031 | case OP_LEFT_SHIFT: | |
2032 | case OP_RIGHT_SHIFT: | |
2033 | case OP_BIT_AND: | |
2034 | case OP_BIT_XOR: | |
2035 | case OP_BIT_OR: | |
2036 | case OP_I_MULTIPLY: | |
2037 | case OP_I_DIVIDE: | |
2038 | case OP_I_MODULO: | |
2039 | case OP_I_ADD: | |
2040 | case OP_I_SUBTRACT: | |
11343788 | 2041 | if (!(o->op_flags & OPf_STACKED)) |
a0d0e21e | 2042 | goto nomod; |
3280af22 | 2043 | PL_modcount++; |
a0d0e21e | 2044 | break; |
b2ffa427 | 2045 | |
79072805 | 2046 | case OP_COND_EXPR: |
ddeae0f1 | 2047 | localize = 1; |
11343788 | 2048 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
3ad73efd | 2049 | op_lvalue(kid, type); |
79072805 LW |
2050 | break; |
2051 | ||
2052 | case OP_RV2AV: | |
2053 | case OP_RV2HV: | |
11343788 | 2054 | if (type == OP_REFGEN && o->op_flags & OPf_PARENS) { |
e6438c1a | 2055 | PL_modcount = RETURN_UNLIMITED_NUMBER; |
11343788 | 2056 | return o; /* Treat \(@foo) like ordinary list. */ |
748a9306 LW |
2057 | } |
2058 | /* FALL THROUGH */ | |
79072805 | 2059 | case OP_RV2GV: |
5dc0d613 | 2060 | if (scalar_mod_type(o, type)) |
3fe9a6f1 | 2061 | goto nomod; |
11343788 | 2062 | ref(cUNOPo->op_first, o->op_type); |
79072805 | 2063 | /* FALL THROUGH */ |
79072805 LW |
2064 | case OP_ASLICE: |
2065 | case OP_HSLICE: | |
ddeae0f1 | 2066 | localize = 1; |
78f9721b SM |
2067 | /* FALL THROUGH */ |
2068 | case OP_AASSIGN: | |
631dbaa2 FC |
2069 | if (type == OP_LEAVESUBLV) |
2070 | o->op_private |= OPpMAYBE_LVSUB; | |
2071 | /* FALL THROUGH */ | |
93a17b20 LW |
2072 | case OP_NEXTSTATE: |
2073 | case OP_DBSTATE: | |
e6438c1a | 2074 | PL_modcount = RETURN_UNLIMITED_NUMBER; |
79072805 | 2075 | break; |
28c5b5bc RGS |
2076 | case OP_AV2ARYLEN: |
2077 | PL_hints |= HINT_BLOCK_SCOPE; | |
2078 | if (type == OP_LEAVESUBLV) | |
2079 | o->op_private |= OPpMAYBE_LVSUB; | |
2080 | PL_modcount++; | |
2081 | break; | |
463ee0b2 | 2082 | case OP_RV2SV: |
aeea060c | 2083 | ref(cUNOPo->op_first, o->op_type); |
ddeae0f1 | 2084 | localize = 1; |
463ee0b2 | 2085 | /* FALL THROUGH */ |
79072805 | 2086 | case OP_GV: |
3280af22 | 2087 | PL_hints |= HINT_BLOCK_SCOPE; |
463ee0b2 | 2088 | case OP_SASSIGN: |
bf4b1e52 GS |
2089 | case OP_ANDASSIGN: |
2090 | case OP_ORASSIGN: | |
c963b151 | 2091 | case OP_DORASSIGN: |
ddeae0f1 DM |
2092 | PL_modcount++; |
2093 | break; | |
2094 | ||
8990e307 | 2095 | case OP_AELEMFAST: |
93bad3fd | 2096 | case OP_AELEMFAST_LEX: |
6a077020 | 2097 | localize = -1; |
3280af22 | 2098 | PL_modcount++; |
8990e307 LW |
2099 | break; |
2100 | ||
748a9306 LW |
2101 | case OP_PADAV: |
2102 | case OP_PADHV: | |
e6438c1a | 2103 | PL_modcount = RETURN_UNLIMITED_NUMBER; |
5196be3e MB |
2104 | if (type == OP_REFGEN && o->op_flags & OPf_PARENS) |
2105 | return o; /* Treat \(@foo) like ordinary list. */ | |
2106 | if (scalar_mod_type(o, type)) | |
3fe9a6f1 | 2107 | goto nomod; |
78f9721b SM |
2108 | if (type == OP_LEAVESUBLV) |
2109 | o->op_private |= OPpMAYBE_LVSUB; | |
748a9306 LW |
2110 | /* FALL THROUGH */ |
2111 | case OP_PADSV: | |
3280af22 | 2112 | PL_modcount++; |
ddeae0f1 | 2113 | if (!type) /* local() */ |
5ede95a0 BF |
2114 | Perl_croak(aTHX_ "Can't localize lexical variable %"SVf, |
2115 | PAD_COMPNAME_SV(o->op_targ)); | |
463ee0b2 LW |
2116 | break; |
2117 | ||
748a9306 | 2118 | case OP_PUSHMARK: |
ddeae0f1 | 2119 | localize = 0; |
748a9306 | 2120 | break; |
b2ffa427 | 2121 | |
69969c6f | 2122 | case OP_KEYS: |
d8065907 | 2123 | case OP_RKEYS: |
fad4a2e4 | 2124 | if (type != OP_SASSIGN && type != OP_LEAVESUBLV) |
69969c6f | 2125 | goto nomod; |
5d82c453 GA |
2126 | goto lvalue_func; |
2127 | case OP_SUBSTR: | |
2128 | if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */ | |
2129 | goto nomod; | |
5f05dabc | 2130 | /* FALL THROUGH */ |
a0d0e21e | 2131 | case OP_POS: |
463ee0b2 | 2132 | case OP_VEC: |
fad4a2e4 | 2133 | lvalue_func: |
78f9721b SM |
2134 | if (type == OP_LEAVESUBLV) |
2135 | o->op_private |= OPpMAYBE_LVSUB; | |
11343788 | 2136 | if (o->op_flags & OPf_KIDS) |
3ad73efd | 2137 | op_lvalue(cBINOPo->op_first->op_sibling, type); |
463ee0b2 | 2138 | break; |
a0d0e21e | 2139 | |
463ee0b2 LW |
2140 | case OP_AELEM: |
2141 | case OP_HELEM: | |
11343788 | 2142 | ref(cBINOPo->op_first, o->op_type); |
68dc0745 | 2143 | if (type == OP_ENTERSUB && |
5dc0d613 MB |
2144 | !(o->op_private & (OPpLVAL_INTRO | OPpDEREF))) |
2145 | o->op_private |= OPpLVAL_DEFER; | |
78f9721b SM |
2146 | if (type == OP_LEAVESUBLV) |
2147 | o->op_private |= OPpMAYBE_LVSUB; | |
ddeae0f1 | 2148 | localize = 1; |
3280af22 | 2149 | PL_modcount++; |
463ee0b2 LW |
2150 | break; |
2151 | ||
2152 | case OP_SCOPE: | |
2153 | case OP_LEAVE: | |
2154 | case OP_ENTER: | |
78f9721b | 2155 | case OP_LINESEQ: |
ddeae0f1 | 2156 | localize = 0; |
11343788 | 2157 | if (o->op_flags & OPf_KIDS) |
3ad73efd | 2158 | op_lvalue(cLISTOPo->op_last, type); |
a0d0e21e LW |
2159 | break; |
2160 | ||
2161 | case OP_NULL: | |
ddeae0f1 | 2162 | localize = 0; |
638bc118 GS |
2163 | if (o->op_flags & OPf_SPECIAL) /* do BLOCK */ |
2164 | goto nomod; | |
2165 | else if (!(o->op_flags & OPf_KIDS)) | |
463ee0b2 | 2166 | break; |
11343788 | 2167 | if (o->op_targ != OP_LIST) { |
3ad73efd | 2168 | op_lvalue(cBINOPo->op_first, type); |
a0d0e21e LW |
2169 | break; |
2170 | } | |
2171 | /* FALL THROUGH */ | |
463ee0b2 | 2172 | case OP_LIST: |
ddeae0f1 | 2173 | localize = 0; |
11343788 | 2174 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
5c906035 GG |
2175 | /* elements might be in void context because the list is |
2176 | in scalar context or because they are attribute sub calls */ | |
2177 | if ( (kid->op_flags & OPf_WANT) != OPf_WANT_VOID ) | |
2178 | op_lvalue(kid, type); | |
463ee0b2 | 2179 | break; |
78f9721b SM |
2180 | |
2181 | case OP_RETURN: | |
2182 | if (type != OP_LEAVESUBLV) | |
2183 | goto nomod; | |
3ad73efd | 2184 | break; /* op_lvalue()ing was handled by ck_return() */ |
1efec5ed FC |
2185 | |
2186 | case OP_COREARGS: | |
2187 | return o; | |
463ee0b2 | 2188 | } |
58d95175 | 2189 | |
8be1be90 AMS |
2190 | /* [20011101.069] File test operators interpret OPf_REF to mean that |
2191 | their argument is a filehandle; thus \stat(".") should not set | |
2192 | it. AMS 20011102 */ | |
2193 | if (type == OP_REFGEN && | |
ef69c8fc | 2194 | PL_check[o->op_type] == Perl_ck_ftst) |
8be1be90 AMS |
2195 | return o; |
2196 | ||
2197 | if (type != OP_LEAVESUBLV) | |
2198 | o->op_flags |= OPf_MOD; | |
2199 | ||
2200 | if (type == OP_AASSIGN || type == OP_SASSIGN) | |
2201 | o->op_flags |= OPf_SPECIAL|OPf_REF; | |
ddeae0f1 DM |
2202 | else if (!type) { /* local() */ |
2203 | switch (localize) { | |
2204 | case 1: | |
2205 | o->op_private |= OPpLVAL_INTRO; | |
2206 | o->op_flags &= ~OPf_SPECIAL; | |
2207 | PL_hints |= HINT_BLOCK_SCOPE; | |
2208 | break; | |
2209 | case 0: | |
2210 | break; | |
2211 | case -1: | |
a2a5de95 NC |
2212 | Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), |
2213 | "Useless localization of %s", OP_DESC(o)); | |
ddeae0f1 | 2214 | } |
463ee0b2 | 2215 | } |
8be1be90 AMS |
2216 | else if (type != OP_GREPSTART && type != OP_ENTERSUB |
2217 | && type != OP_LEAVESUBLV) | |
2218 | o->op_flags |= OPf_REF; | |
11343788 | 2219 | return o; |
463ee0b2 LW |
2220 | } |
2221 | ||
864dbfa3 | 2222 | STATIC bool |
5f66b61c | 2223 | S_scalar_mod_type(const OP *o, I32 type) |
3fe9a6f1 | 2224 | { |
2225 | switch (type) { | |
32a60974 | 2226 | case OP_POS: |
3fe9a6f1 | 2227 | case OP_SASSIGN: |
1efec5ed | 2228 | if (o && o->op_type == OP_RV2GV) |
3fe9a6f1 | 2229 | return FALSE; |
2230 | /* FALL THROUGH */ | |
2231 | case OP_PREINC: | |
2232 | case OP_PREDEC: | |
2233 | case OP_POSTINC: | |
2234 | case OP_POSTDEC: | |
2235 | case OP_I_PREINC: | |
2236 | case OP_I_PREDEC: | |
2237 | case OP_I_POSTINC: | |
2238 | case OP_I_POSTDEC: | |
2239 | case OP_POW: | |
2240 | case OP_MULTIPLY: | |
2241 | case OP_DIVIDE: | |
2242 | case OP_MODULO: | |
2243 | case OP_REPEAT: | |
2244 | case OP_ADD: | |
2245 | case OP_SUBTRACT: | |
2246 | case OP_I_MULTIPLY: | |
2247 | case OP_I_DIVIDE: | |
2248 | case OP_I_MODULO: | |
2249 | case OP_I_ADD: | |
2250 | case OP_I_SUBTRACT: | |
2251 | case OP_LEFT_SHIFT: | |
2252 | case OP_RIGHT_SHIFT: | |
2253 | case OP_BIT_AND: | |
2254 | case OP_BIT_XOR: | |
2255 | case OP_BIT_OR: | |
2256 | case OP_CONCAT: | |
2257 | case OP_SUBST: | |
2258 | case OP_TRANS: | |
bb16bae8 | 2259 | case OP_TRANSR: |
49e9fbe6 GS |
2260 | case OP_READ: |
2261 | case OP_SYSREAD: | |
2262 | case OP_RECV: | |
bf4b1e52 GS |
2263 | case OP_ANDASSIGN: |
2264 | case OP_ORASSIGN: | |
410d09fe | 2265 | case OP_DORASSIGN: |
3fe9a6f1 | 2266 | return TRUE; |
2267 | default: | |
2268 | return FALSE; | |
2269 | } | |
2270 | } | |
2271 | ||
35cd451c | 2272 | STATIC bool |
5f66b61c | 2273 | S_is_handle_constructor(const OP *o, I32 numargs) |
35cd451c | 2274 | { |
7918f24d NC |
2275 | PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR; |
2276 | ||
35cd451c GS |
2277 | switch (o->op_type) { |
2278 | case OP_PIPE_OP: | |
2279 | case OP_SOCKPAIR: | |
504618e9 | 2280 | if (numargs == 2) |
35cd451c GS |
2281 | return TRUE; |
2282 | /* FALL THROUGH */ | |
2283 | case OP_SYSOPEN: | |
2284 | case OP_OPEN: | |
ded8aa31 | 2285 | case OP_SELECT: /* XXX c.f. SelectSaver.pm */ |
35cd451c GS |
2286 | case OP_SOCKET: |
2287 | case OP_OPEN_DIR: | |
2288 | case OP_ACCEPT: | |
504618e9 | 2289 | if (numargs == 1) |
35cd451c | 2290 | return TRUE; |
5f66b61c | 2291 | /* FALLTHROUGH */ |
35cd451c GS |
2292 | default: |
2293 | return FALSE; | |
2294 | } | |
2295 | } | |
2296 | ||
0d86688d NC |
2297 | static OP * |
2298 | S_refkids(pTHX_ OP *o, I32 type) | |
463ee0b2 | 2299 | { |
11343788 | 2300 | if (o && o->op_flags & OPf_KIDS) { |
6867be6d | 2301 | OP *kid; |
11343788 | 2302 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
463ee0b2 LW |
2303 | ref(kid, type); |
2304 | } | |
11343788 | 2305 | return o; |
463ee0b2 LW |
2306 | } |
2307 | ||
2308 | OP * | |
e4c5ccf3 | 2309 | Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref) |
463ee0b2 | 2310 | { |
27da23d5 | 2311 | dVAR; |
463ee0b2 | 2312 | OP *kid; |
463ee0b2 | 2313 | |
7918f24d NC |
2314 | PERL_ARGS_ASSERT_DOREF; |
2315 | ||
13765c85 | 2316 | if (!o || (PL_parser && PL_parser->error_count)) |
11343788 | 2317 | return o; |
463ee0b2 | 2318 | |
11343788 | 2319 | switch (o->op_type) { |
a0d0e21e | 2320 | case OP_ENTERSUB: |
f4df43b5 | 2321 | if ((type == OP_EXISTS || type == OP_DEFINED) && |
11343788 MB |
2322 | !(o->op_flags & OPf_STACKED)) { |
2323 | o->op_type = OP_RV2CV; /* entersub => rv2cv */ | |
22c35a8c | 2324 | o->op_ppaddr = PL_ppaddr[OP_RV2CV]; |
11343788 | 2325 | assert(cUNOPo->op_first->op_type == OP_NULL); |
93c66552 | 2326 | op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */ |
11343788 | 2327 | o->op_flags |= OPf_SPECIAL; |
e26df76a | 2328 | o->op_private &= ~1; |
8990e307 | 2329 | } |
767eda44 | 2330 | else if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV){ |
0e9700df GG |
2331 | o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV |
2332 | : type == OP_RV2HV ? OPpDEREF_HV | |
2333 | : OPpDEREF_SV); | |
767eda44 FC |
2334 | o->op_flags |= OPf_MOD; |
2335 | } | |
2336 | ||
8990e307 | 2337 | break; |
aeea060c | 2338 | |
463ee0b2 | 2339 | case OP_COND_EXPR: |
11343788 | 2340 | for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling) |
e4c5ccf3 | 2341 | doref(kid, type, set_op_ref); |
463ee0b2 | 2342 | break; |
8990e307 | 2343 | case OP_RV2SV: |
35cd451c GS |
2344 | if (type == OP_DEFINED) |
2345 | o->op_flags |= OPf_SPECIAL; /* don't create GV */ | |
e4c5ccf3 | 2346 | doref(cUNOPo->op_first, o->op_type, set_op_ref); |
4633a7c4 LW |
2347 | /* FALL THROUGH */ |
2348 | case OP_PADSV: | |
5f05dabc | 2349 | if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) { |
5dc0d613 MB |
2350 | o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV |
2351 | : type == OP_RV2HV ? OPpDEREF_HV | |
2352 | : OPpDEREF_SV); | |
11343788 | 2353 | o->op_flags |= OPf_MOD; |
a0d0e21e | 2354 | } |
8990e307 | 2355 | break; |
1c846c1f | 2356 | |
463ee0b2 LW |
2357 | case OP_RV2AV: |
2358 | case OP_RV2HV: | |
e4c5ccf3 RH |
2359 | if (set_op_ref) |
2360 | o->op_flags |= OPf_REF; | |
8990e307 | 2361 | /* FALL THROUGH */ |
463ee0b2 | 2362 | case OP_RV2GV: |
35cd451c GS |
2363 | if (type == OP_DEFINED) |
2364 | o->op_flags |= OPf_SPECIAL; /* don't create GV */ | |
e4c5ccf3 | 2365 | doref(cUNOPo->op_first, o->op_type, set_op_ref); |
463ee0b2 | 2366 | break; |
8990e307 | 2367 | |
463ee0b2 LW |
2368 | case OP_PADAV: |
2369 | case OP_PADHV: | |
e4c5ccf3 RH |
2370 | if (set_op_ref) |
2371 | o->op_flags |= OPf_REF; | |
79072805 | 2372 | break; |
aeea060c | 2373 | |
8990e307 | 2374 | case OP_SCALAR: |
79072805 | 2375 | case OP_NULL: |
518618af | 2376 | if (!(o->op_flags & OPf_KIDS) || type == OP_DEFINED) |
463ee0b2 | 2377 | break; |
e4c5ccf3 | 2378 | doref(cBINOPo->op_first, type, set_op_ref); |
79072805 LW |
2379 | break; |
2380 | case OP_AELEM: | |
2381 | case OP_HELEM: | |
e4c5ccf3 | 2382 | doref(cBINOPo->op_first, o->op_type, set_op_ref); |
5f05dabc | 2383 | if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) { |
5dc0d613 MB |
2384 | o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV |
2385 | : type == OP_RV2HV ? OPpDEREF_HV | |
2386 | : OPpDEREF_SV); | |
11343788 | 2387 | o->op_flags |= OPf_MOD; |
8990e307 | 2388 | } |
79072805 LW |
2389 | break; |
2390 | ||
463ee0b2 | 2391 | case OP_SCOPE: |
79072805 | 2392 | case OP_LEAVE: |
e4c5ccf3 RH |
2393 | set_op_ref = FALSE; |
2394 | /* FALL THROUGH */ | |
79072805 | 2395 | case OP_ENTER: |
8990e307 | 2396 | case OP_LIST: |
11343788 | 2397 | if (!(o->op_flags & OPf_KIDS)) |
79072805 | 2398 | break; |
e4c5ccf3 | 2399 | doref(cLISTOPo->op_last, type, set_op_ref); |
79072805 | 2400 | break; |
a0d0e21e LW |
2401 | default: |
2402 | break; | |
79072805 | 2403 | } |
11343788 | 2404 | return scalar(o); |
8990e307 | 2405 | |
79072805 LW |
2406 | } |
2407 | ||
09bef843 SB |
2408 | STATIC OP * |
2409 | S_dup_attrlist(pTHX_ OP *o) | |
2410 | { | |
97aff369 | 2411 | dVAR; |
0bd48802 | 2412 | OP *rop; |
09bef843 | 2413 | |
7918f24d NC |
2414 | PERL_ARGS_ASSERT_DUP_ATTRLIST; |
2415 | ||
09bef843 SB |
2416 | /* An attrlist is either a simple OP_CONST or an OP_LIST with kids, |
2417 | * where the first kid is OP_PUSHMARK and the remaining ones | |
2418 | * are OP_CONST. We need to push the OP_CONST values. | |
2419 | */ | |
2420 | if (o->op_type == OP_CONST) | |
b37c2d43 | 2421 | rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv)); |
eb8433b7 NC |
2422 | #ifdef PERL_MAD |
2423 | else if (o->op_type == OP_NULL) | |
1d866c12 | 2424 | rop = NULL; |
eb8433b7 | 2425 | #endif |
09bef843 SB |
2426 | else { |
2427 | assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS)); | |
5f66b61c | 2428 | rop = NULL; |
09bef843 SB |
2429 | for (o = cLISTOPo->op_first; o; o=o->op_sibling) { |
2430 | if (o->op_type == OP_CONST) | |
2fcb4757 | 2431 | rop = op_append_elem(OP_LIST, rop, |
09bef843 | 2432 | newSVOP(OP_CONST, o->op_flags, |
b37c2d43 | 2433 | SvREFCNT_inc_NN(cSVOPo->op_sv))); |
09bef843 SB |
2434 | } |
2435 | } | |
2436 | return rop; | |
2437 | } | |
2438 | ||
2439 | STATIC void | |
ad0dc73b | 2440 | S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs) |
09bef843 | 2441 | { |
27da23d5 | 2442 | dVAR; |
ad0dc73b | 2443 | SV * const stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no; |
09bef843 | 2444 | |
7918f24d NC |
2445 | PERL_ARGS_ASSERT_APPLY_ATTRS; |
2446 | ||
09bef843 SB |
2447 | /* fake up C<use attributes $pkg,$rv,@attrs> */ |
2448 | ENTER; /* need to protect against side-effects of 'use' */ | |
e4783991 | 2449 | |
09bef843 | 2450 | #define ATTRSMODULE "attributes" |
95f0a2f1 SB |
2451 | #define ATTRSMODULE_PM "attributes.pm" |
2452 | ||
ad0dc73b | 2453 | Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS, |
6136c704 AL |
2454 | newSVpvs(ATTRSMODULE), |
2455 | NULL, | |
2fcb4757 | 2456 | op_prepend_elem(OP_LIST, |
95f0a2f1 | 2457 | newSVOP(OP_CONST, 0, stashsv), |
2fcb4757 | 2458 | op_prepend_elem(OP_LIST, |
95f0a2f1 SB |
2459 | newSVOP(OP_CONST, 0, |
2460 | newRV(target)), | |
2461 | dup_attrlist(attrs)))); | |
09bef843 SB |
2462 | LEAVE; |
2463 | } | |
2464 | ||
95f0a2f1 SB |
2465 | STATIC void |
2466 | S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp) | |
2467 | { | |
97aff369 | 2468 | dVAR; |
95f0a2f1 | 2469 | OP *pack, *imop, *arg; |
ad0dc73b | 2470 | SV *meth, *stashsv, **svp; |
95f0a2f1 | 2471 | |
7918f24d NC |
2472 | PERL_ARGS_ASSERT_APPLY_ATTRS_MY; |
2473 | ||
95f0a2f1 SB |
2474 | if (!attrs) |
2475 | return; | |
2476 | ||
2477 | assert(target->op_type == OP_PADSV || | |
2478 | target->op_type == OP_PADHV || | |
2479 | target->op_type == OP_PADAV); | |
2480 | ||
2481 | /* Ensure that attributes.pm is loaded. */ | |
ad0dc73b FC |
2482 | ENTER; /* need to protect against side-effects of 'use' */ |
2483 | /* Don't force the C<use> if we don't need it. */ | |
2484 | svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE); | |
2485 | if (svp && *svp != &PL_sv_undef) | |
2486 | NOOP; /* already in %INC */ | |
2487 | else | |
2488 | Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT, | |
2489 | newSVpvs(ATTRSMODULE), NULL); | |
2490 | LEAVE; | |
95f0a2f1 SB |
2491 | |
2492 | /* Need package name for method call. */ | |
6136c704 | 2493 | pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE)); |
95f0a2f1 SB |
2494 | |
2495 | /* Build up the real arg-list. */ | |
5aaec2b4 NC |
2496 | stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no; |
2497 | ||
95f0a2f1 SB |
2498 | arg = newOP(OP_PADSV, 0); |
2499 | arg->op_targ = target->op_targ; | |
2fcb4757 | 2500 | arg = op_prepend_elem(OP_LIST, |
95f0a2f1 | 2501 | newSVOP(OP_CONST, 0, stashsv), |
2fcb4757 | 2502 | op_prepend_elem(OP_LIST, |
95f0a2f1 | 2503 | newUNOP(OP_REFGEN, 0, |
3ad73efd | 2504 | op_lvalue(arg, OP_REFGEN)), |
95f0a2f1 SB |
2505 | dup_attrlist(attrs))); |
2506 | ||
2507 | /* Fake up a method call to import */ | |
18916d0d | 2508 | meth = newSVpvs_share("import"); |
95f0a2f1 | 2509 | imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID, |
2fcb4757 Z |
2510 | op_append_elem(OP_LIST, |
2511 | op_prepend_elem(OP_LIST, pack, list(arg)), | |
95f0a2f1 | 2512 | newSVOP(OP_METHOD_NAMED, 0, meth))); |
95f0a2f1 SB |
2513 | |
2514 | /* Combine the ops. */ | |
2fcb4757 | 2515 | *imopsp = op_append_elem(OP_LIST, *imopsp, imop); |
95f0a2f1 SB |
2516 | } |
2517 | ||
2518 | /* | |
2519 | =notfor apidoc apply_attrs_string | |
2520 | ||
2521 | Attempts to apply a list of attributes specified by the C<attrstr> and | |
2522 | C<len> arguments to the subroutine identified by the C<cv> argument which | |
2523 | is expected to be associated with the package identified by the C<stashpv> | |
2524 | argument (see L<attributes>). It gets this wrong, though, in that it | |
2525 | does not correctly identify the boundaries of the individual attribute | |
2526 | specifications within C<attrstr>. This is not really intended for the | |
2527 | public API, but has to be listed here for systems such as AIX which | |
2528 | need an explicit export list for symbols. (It's called from XS code | |
2529 | in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it | |
2530 | to respect attribute syntax properly would be welcome. | |
2531 | ||
2532 | =cut | |
2533 | */ | |
2534 | ||
be3174d2 | 2535 | void |
6867be6d AL |
2536 | Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv, |
2537 | const char *attrstr, STRLEN len) | |
be3174d2 | 2538 | { |
5f66b61c | 2539 | OP *attrs = NULL; |
be3174d2 | 2540 | |
7918f24d NC |
2541 | PERL_ARGS_ASSERT_APPLY_ATTRS_STRING; |
2542 | ||
be3174d2 GS |
2543 | if (!len) { |
2544 | len = strlen(attrstr); | |
2545 | } | |
2546 | ||
2547 | while (len) { | |
2548 | for (; isSPACE(*attrstr) && len; --len, ++attrstr) ; | |
2549 | if (len) { | |
890ce7af | 2550 | const char * const sstr = attrstr; |
be3174d2 | 2551 | for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ; |
2fcb4757 | 2552 | attrs = op_append_elem(OP_LIST, attrs, |
be3174d2 GS |
2553 | newSVOP(OP_CONST, 0, |
2554 | newSVpvn(sstr, attrstr-sstr))); | |
2555 | } | |
2556 | } | |
2557 | ||
2558 | Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS, | |
6136c704 | 2559 | newSVpvs(ATTRSMODULE), |
2fcb4757 | 2560 | NULL, op_prepend_elem(OP_LIST, |
be3174d2 | 2561 | newSVOP(OP_CONST, 0, newSVpv(stashpv,0)), |
2fcb4757 | 2562 | op_prepend_elem(OP_LIST, |
be3174d2 | 2563 | newSVOP(OP_CONST, 0, |
ad64d0ec | 2564 | newRV(MUTABLE_SV(cv))), |
be3174d2 GS |
2565 | attrs))); |
2566 | } | |
2567 | ||
09bef843 | 2568 | STATIC OP * |
95f0a2f1 | 2569 | S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp) |
93a17b20 | 2570 | { |
97aff369 | 2571 | dVAR; |
93a17b20 | 2572 | I32 type; |
a1fba7eb | 2573 | const bool stately = PL_parser && PL_parser->in_my == KEY_state; |
93a17b20 | 2574 | |
7918f24d NC |
2575 | PERL_ARGS_ASSERT_MY_KID; |
2576 | ||
13765c85 | 2577 | if (!o || (PL_parser && PL_parser->error_count)) |
11343788 | 2578 | return o; |
93a17b20 | 2579 | |
bc61e325 | 2580 | type = o->op_type; |
eb8433b7 NC |
2581 | if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) { |
2582 | (void)my_kid(cUNOPo->op_first, attrs, imopsp); | |
2583 | return o; | |
2584 | } | |
2585 | ||
93a17b20 | 2586 | if (type == OP_LIST) { |
6867be6d | 2587 | OP *kid; |
11343788 | 2588 | for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) |
95f0a2f1 | 2589 | my_kid(kid, attrs, imopsp); |
0865059d | 2590 | return o; |
8b8c1fb9 | 2591 | } else if (type == OP_UNDEF || type == OP_STUB) { |
7766148a | 2592 | return o; |
77ca0c92 LW |
2593 | } else if (type == OP_RV2SV || /* "our" declaration */ |
2594 | type == OP_RV2AV || | |
2595 | type == OP_RV2HV) { /* XXX does this let anything illegal in? */ | |
1ce0b88c | 2596 | if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */ |
fab01b8e | 2597 | yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"", |
952306ac | 2598 | OP_DESC(o), |
12bd6ede DM |
2599 | PL_parser->in_my == KEY_our |
2600 | ? "our" | |
2601 | : PL_parser->in_my == KEY_state ? "state" : "my")); | |
1ce0b88c | 2602 | } else if (attrs) { |
551405c4 | 2603 | GV * const gv = cGVOPx_gv(cUNOPo->op_first); |
12bd6ede DM |
2604 | PL_parser->in_my = FALSE; |
2605 | PL_parser->in_my_stash = NULL; | |
1ce0b88c RGS |
2606 | apply_attrs(GvSTASH(gv), |
2607 | (type == OP_RV2SV ? GvSV(gv) : | |
ad64d0ec NC |
2608 | type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) : |
2609 | type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)), | |
ad0dc73b | 2610 | attrs); |
1ce0b88c | 2611 | } |
192587c2 | 2612 | o->op_private |= OPpOUR_INTRO; |
77ca0c92 | 2613 | return o; |
95f0a2f1 SB |
2614 | } |
2615 | else if (type != OP_PADSV && | |
93a17b20 LW |
2616 | type != OP_PADAV && |
2617 | type != OP_PADHV && | |
2618 | type != OP_PUSHMARK) | |
2619 | { | |
eb64745e | 2620 | yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"", |
53e06cf0 | 2621 | OP_DESC(o), |
12bd6ede DM |
2622 | PL_parser->in_my == KEY_our |
2623 | ? "our" | |
2624 | : PL_parser->in_my == KEY_state ? "state" : "my")); | |
11343788 | 2625 | return o; |
93a17b20 | 2626 | } |
09bef843 SB |
2627 | else if (attrs && type != OP_PUSHMARK) { |
2628 | HV *stash; | |
09bef843 | 2629 | |
12bd6ede DM |
2630 | PL_parser->in_my = FALSE; |
2631 | PL_parser->in_my_stash = NULL; | |
eb64745e | 2632 | |
09bef843 | 2633 | /* check for C<my Dog $spot> when deciding package */ |
dd2155a4 DM |
2634 | stash = PAD_COMPNAME_TYPE(o->op_targ); |
2635 | if (!stash) | |
09bef843 | 2636 | stash = PL_curstash; |
95f0a2f1 | 2637 | apply_attrs_my(stash, o, attrs, imopsp); |
09bef843 | 2638 | } |
11343788 MB |
2639 | o->op_flags |= OPf_MOD; |
2640 | o->op_private |= OPpLVAL_INTRO; | |
a1fba7eb | 2641 | if (stately) |
952306ac | 2642 | o->op_private |= OPpPAD_STATE; |
11343788 | 2643 | return o; |
93a17b20 LW |
2644 | } |
2645 | ||
2646 | OP * | |
09bef843 SB |
2647 | Perl_my_attrs(pTHX_ OP *o, OP *attrs) |
2648 | { | |
97aff369 | 2649 | dVAR; |
0bd48802 | 2650 | OP *rops; |
95f0a2f1 SB |
2651 | int maybe_scalar = 0; |
2652 | ||
7918f24d NC |
2653 | PERL_ARGS_ASSERT_MY_ATTRS; |
2654 | ||
d2be0de5 | 2655 | /* [perl #17376]: this appears to be premature, and results in code such as |
c754c3d7 | 2656 | C< our(%x); > executing in list mode rather than void mode */ |
d2be0de5 | 2657 | #if 0 |
09bef843 SB |
2658 | if (o->op_flags & OPf_PARENS) |
2659 | list(o); | |
95f0a2f1 SB |
2660 | else |
2661 | maybe_scalar = 1; | |
d2be0de5 YST |
2662 | #else |
2663 | maybe_scalar = 1; | |
2664 | #endif | |
09bef843 SB |
2665 | if (attrs) |
2666 | SAVEFREEOP(attrs); | |
5f66b61c | 2667 | rops = NULL; |
95f0a2f1 SB |
2668 | o = my_kid(o, attrs, &rops); |
2669 | if (rops) { | |
2670 | if (maybe_scalar && o->op_type == OP_PADSV) { | |
2fcb4757 | 2671 | o = scalar(op_append_list(OP_LIST, rops, o)); |
95f0a2f1 SB |
2672 | o->op_private |= OPpLVAL_INTRO; |
2673 | } | |
f5d1ed10 FC |
2674 | else { |
2675 | /* The listop in rops might have a pushmark at the beginning, | |
2676 | which will mess up list assignment. */ | |
2677 | LISTOP * const lrops = (LISTOP *)rops; /* for brevity */ | |
2678 | if (rops->op_type == OP_LIST && | |
2679 | lrops->op_first && lrops->op_first->op_type == OP_PUSHMARK) | |
2680 | { | |
2681 | OP * const pushmark = lrops->op_first; | |
2682 | lrops->op_first = pushmark->op_sibling; | |
2683 | op_free(pushmark); | |
2684 | } | |
2fcb4757 | 2685 | o = op_append_list(OP_LIST, o, rops); |
f5d1ed10 | 2686 | } |
95f0a2f1 | 2687 | } |
12bd6ede DM |
2688 | PL_parser->in_my = FALSE; |
2689 | PL_parser->in_my_stash = NULL; | |
eb64745e | 2690 | return o; |
09bef843 SB |
2691 | } |
2692 | ||
2693 | OP * | |
864dbfa3 | 2694 | Perl_sawparens(pTHX_ OP *o) |
79072805 | 2695 | { |
96a5add6 | 2696 | PERL_UNUSED_CONTEXT; |
79072805 LW |
2697 | if (o) |
2698 | o->op_flags |= OPf_PARENS; | |
2699 | return o; | |
2700 | } | |
2701 | ||
2702 | OP * | |
864dbfa3 | 2703 | Perl_bind_match(pTHX_ I32 type, OP *left, OP *right) |
79072805 | 2704 | { |
11343788 | 2705 | OP *o; |
59f00321 | 2706 | bool ismatchop = 0; |
1496a290 AL |
2707 | const OPCODE ltype = left->op_type; |
2708 | const OPCODE rtype = right->op_type; | |
79072805 | 2709 | |
7918f24d NC |
2710 | PERL_ARGS_ASSERT_BIND_MATCH; |
2711 | ||
1496a290 AL |
2712 | if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV |
2713 | || ltype == OP_PADHV) && ckWARN(WARN_MISC)) | |
041457d9 | 2714 | { |
1496a290 | 2715 | const char * const desc |
bb16bae8 FC |
2716 | = PL_op_desc[( |
2717 | rtype == OP_SUBST || rtype == OP_TRANS | |
2718 | || rtype == OP_TRANSR | |
2719 | ) | |
666ea192 | 2720 | ? (int)rtype : OP_MATCH]; |
c6771ab6 FC |
2721 | const bool isary = ltype == OP_RV2AV || ltype == OP_PADAV; |
2722 | GV *gv; | |
2723 | SV * const name = | |
2724 | (ltype == OP_RV2AV || ltype == OP_RV2HV) | |
2725 | ? cUNOPx(left)->op_first->op_type == OP_GV | |
2726 | && (gv = cGVOPx_gv(cUNOPx(left)->op_first)) | |
2727 | ? varname(gv, isary ? '@' : '%', 0, NULL, 0, 1) | |
2728 | : NULL | |
ba510004 FC |
2729 | : varname( |
2730 | (GV *)PL_compcv, isary ? '@' : '%', left->op_targ, NULL, 0, 1 | |
2731 | ); | |
c6771ab6 FC |
2732 | if (name) |
2733 | Perl_warner(aTHX_ packWARN(WARN_MISC), | |
2734 | "Applying %s to %"SVf" will act on scalar(%"SVf")", | |
2735 | desc, name, name); | |
2736 | else { | |
2737 | const char * const sample = (isary | |
666ea192 | 2738 | ? "@array" : "%hash"); |
c6771ab6 | 2739 | Perl_warner(aTHX_ packWARN(WARN_MISC), |
1c846c1f | 2740 | "Applying %s to %s will act on scalar(%s)", |
599cee73 | 2741 | desc, sample, sample); |
c6771ab6 | 2742 | } |
2ae324a7 | 2743 | } |
2744 | ||
1496a290 | 2745 | if (rtype == OP_CONST && |
5cc9e5c9 RH |
2746 | cSVOPx(right)->op_private & OPpCONST_BARE && |
2747 | cSVOPx(right)->op_private & OPpCONST_STRICT) | |
2748 | { | |
2749 | no_bareword_allowed(right); | |
2750 | } | |
2751 | ||
bb16bae8 | 2752 | /* !~ doesn't make sense with /r, so error on it for now */ |
4f4d7508 DC |
2753 | if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) && |
2754 | type == OP_NOT) | |
2755 | yyerror("Using !~ with s///r doesn't make sense"); | |
bb16bae8 FC |
2756 | if (rtype == OP_TRANSR && type == OP_NOT) |
2757 | yyerror("Using !~ with tr///r doesn't make sense"); | |
4f4d7508 | 2758 | |
2474a784 FC |
2759 | ismatchop = (rtype == OP_MATCH || |
2760 | rtype == OP_SUBST || | |
bb16bae8 | 2761 | rtype == OP_TRANS || rtype == OP_TRANSR) |
2474a784 | 2762 | && !(right->op_flags & OPf_SPECIAL); |
59f00321 RGS |
2763 | if (ismatchop && right->op_private & OPpTARGET_MY) { |
2764 | right->op_targ = 0; | |
2765 | right->op_private &= ~OPpTARGET_MY; | |
2766 | } | |
2767 | if (!(right->op_flags & OPf_STACKED) && ismatchop) { | |
1496a290 AL |
2768 | OP *newleft; |
2769 | ||
79072805 | 2770 | right->op_flags |= OPf_STACKED; |
bb16bae8 | 2771 | if (rtype != OP_MATCH && rtype != OP_TRANSR && |
1496a290 | 2772 | ! (rtype == OP_TRANS && |
4f4d7508 DC |
2773 | right->op_private & OPpTRANS_IDENTICAL) && |
2774 | ! (rtype == OP_SUBST && | |
2775 | (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT))) | |
3ad73efd | 2776 | newleft = op_lvalue(left, rtype); |
1496a290 AL |
2777 | else |
2778 | newleft = left; | |
bb16bae8 | 2779 | if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR) |
1496a290 | 2780 | o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right); |
79072805 | 2781 | else |
2fcb4757 | 2782 | o = op_prepend_elem(rtype, scalar(newleft), right); |
79072805 | 2783 | if (type == OP_NOT) |
11343788 MB |
2784 | return newUNOP(OP_NOT, 0, scalar(o)); |
2785 | return o; | |
79072805 LW |
2786 | } |
2787 | else | |
2788 | return bind_match(type, left, | |
d63c20f2 | 2789 | pmruntime(newPMOP(OP_MATCH, 0), right, 0, 0)); |
79072805 LW |
2790 | } |
2791 | ||
2792 | OP * | |
864dbfa3 | 2793 | Perl_invert(pTHX_ OP *o) |
79072805 | 2794 | { |
11343788 | 2795 | if (!o) |
1d866c12 | 2796 | return NULL; |
11343788 | 2797 | return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o)); |
79072805 LW |
2798 | } |
2799 | ||
3ad73efd Z |
2800 | /* |
2801 | =for apidoc Amx|OP *|op_scope|OP *o | |
2802 | ||
2803 | Wraps up an op tree with some additional ops so that at runtime a dynamic | |
2804 | scope will be created. The original ops run in the new dynamic scope, | |
2805 | and then, provided that they exit normally, the scope will be unwound. | |
2806 | The additional ops used to create and unwind the dynamic scope will | |
2807 | normally be an C<enter>/C<leave> pair, but a C<scope> op may be used | |
2808 | instead if the ops are simple enough to not need the full dynamic scope | |
2809 | structure. | |
2810 | ||
2811 | =cut | |
2812 | */ | |
2813 | ||
79072805 | 2814 | OP * |
3ad73efd | 2815 | Perl_op_scope(pTHX_ OP *o) |
79072805 | 2816 | { |
27da23d5 | 2817 | dVAR; |
79072805 | 2818 | if (o) { |
284167a5 | 2819 | if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || TAINTING_get) { |
2fcb4757 | 2820 | o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o); |
463ee0b2 | 2821 | o->op_type = OP_LEAVE; |
22c35a8c | 2822 | o->op_ppaddr = PL_ppaddr[OP_LEAVE]; |
463ee0b2 | 2823 | } |
fdb22418 HS |
2824 | else if (o->op_type == OP_LINESEQ) { |
2825 | OP *kid; | |
2826 | o->op_type = OP_SCOPE; | |
2827 | o->op_ppaddr = PL_ppaddr[OP_SCOPE]; | |
2828 | kid = ((LISTOP*)o)->op_first; | |
59110972 | 2829 | if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) { |
fdb22418 | 2830 | op_null(kid); |
59110972 RH |
2831 | |
2832 | /* The following deals with things like 'do {1 for 1}' */ | |
2833 | kid = kid->op_sibling; | |
2834 | if (kid && | |
2835 | (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)) | |
2836 | op_null(kid); | |
2837 | } | |
463ee0b2 | 2838 | } |
fdb22418 | 2839 | else |
5f66b61c | 2840 | o = newLISTOP(OP_SCOPE, 0, o, NULL); |
79072805 LW |
2841 | } |
2842 | return o; | |
2843 | } | |
1930840b | 2844 | |
705fe0e5 FC |
2845 | OP * |
2846 | Perl_op_unscope(pTHX_ OP *o) | |
2847 | { | |
2848 | if (o && o->op_type == OP_LINESEQ) { | |
2849 | OP *kid = cLISTOPo->op_first; | |
2850 | for(; kid; kid = kid->op_sibling) | |
2851 | if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) | |
2852 | op_null(kid); | |
2853 | } | |
2854 | return o; | |
2855 | } | |
2856 | ||
a0d0e21e | 2857 | int |
864dbfa3 | 2858 | Perl_block_start(pTHX_ int full) |
79072805 | 2859 | { |
97aff369 | 2860 | dVAR; |
73d840c0 | 2861 | const int retval = PL_savestack_ix; |
1930840b | 2862 | |
dd2155a4 | 2863 | pad_block_start(full); |
b3ac6de7 | 2864 | SAVEHINTS(); |
3280af22 | 2865 | PL_hints &= ~HINT_BLOCK_SCOPE; |
68da3b2f | 2866 | SAVECOMPILEWARNINGS(); |
72dc9ed5 | 2867 | PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings); |
1930840b | 2868 | |
a88d97bf | 2869 | CALL_BLOCK_HOOKS(bhk_start, full); |
1930840b | 2870 | |
a0d0e21e LW |
2871 | return retval; |
2872 | } | |
2873 | ||
2874 | OP* | |
864dbfa3 | 2875 | Perl_block_end(pTHX_ I32 floor, OP *seq) |
a0d0e21e | 2876 | { |
97aff369 | 2877 | dVAR; |
6867be6d | 2878 | const int needblockscope = PL_hints & HINT_BLOCK_SCOPE; |
1930840b | 2879 | OP* retval = scalarseq(seq); |
6d5c2147 | 2880 | OP *o; |
1930840b | 2881 | |
a88d97bf | 2882 | CALL_BLOCK_HOOKS(bhk_pre_end, &retval); |
1930840b | 2883 | |
e9818f4e | 2884 | LEAVE_SCOPE(floor); |
623e6609 | 2885 | CopHINTS_set(&PL_compiling, PL_hints); |
a0d0e21e | 2886 | if (needblockscope) |
3280af22 | 2887 | PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */ |
6d5c2147 FC |
2888 | o = pad_leavemy(); |
2889 | ||
2890 | if (o) { | |
2891 | /* pad_leavemy has created a sequence of introcv ops for all my | |
2892 | subs declared in the block. We have to replicate that list with | |
2893 | clonecv ops, to deal with this situation: | |
2894 | ||
2895 | sub { | |
2896 | my sub s1; | |
2897 | my sub s2; | |
2898 | sub s1 { state sub foo { \&s2 } } | |
2899 | }->() | |
2900 | ||
2901 | Originally, I was going to have introcv clone the CV and turn | |
2902 | off the stale flag. Since &s1 is declared before &s2, the | |
2903 | introcv op for &s1 is executed (on sub entry) before the one for | |
2904 | &s2. But the &foo sub inside &s1 (which is cloned when &s1 is | |
2905 | cloned, since it is a state sub) closes over &s2 and expects | |
2906 | to see it in its outer CV’s pad. If the introcv op clones &s1, | |
2907 | then &s2 is still marked stale. Since &s1 is not active, and | |
2908 | &foo closes over &s1’s implicit entry for &s2, we get a ‘Varia- | |
2909 | ble will not stay shared’ warning. Because it is the same stub | |
2910 | that will be used when the introcv op for &s2 is executed, clos- | |
2911 | ing over it is safe. Hence, we have to turn off the stale flag | |
2912 | on all lexical subs in the block before we clone any of them. | |
2913 | Hence, having introcv clone the sub cannot work. So we create a | |
2914 | list of ops like this: | |
2915 | ||
2916 | lineseq | |
2917 | | | |
2918 | +-- introcv | |
2919 | | | |
2920 | +-- introcv | |
2921 | | | |
2922 | +-- introcv | |
2923 | | | |
2924 | . | |
2925 | . | |
2926 | . | |
2927 | | | |
2928 | +-- clonecv | |
2929 | | | |
2930 | +-- clonecv | |
2931 | | | |
2932 | +-- clonecv | |
2933 | | | |
2934 | . | |
2935 | . | |
2936 | . | |
2937 | */ | |
2938 | OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : o; | |
2939 | OP * const last = o->op_flags & OPf_KIDS ? cLISTOPo->op_last : o; | |
2940 | for (;; kid = kid->op_sibling) { | |
2941 | OP *newkid = newOP(OP_CLONECV, 0); | |
2942 | newkid->op_targ = kid->op_targ; | |
2943 | o = op_append_elem(OP_LINESEQ, o, newkid); | |
2944 | if (kid == last) break; | |
2945 | } | |
2946 | retval = op_prepend_elem(OP_LINESEQ, o, retval); | |
2947 | } | |
1930840b | 2948 | |
a88d97bf | 2949 | CALL_BLOCK_HOOKS(bhk_post_end, &retval); |
1930840b | 2950 | |
a0d0e21e LW |
2951 | return retval; |
2952 | } | |
2953 | ||
fd85fad2 BM |
2954 | /* |
2955 | =head1 Compile-time scope hooks | |
2956 | ||
3e4ddde5 | 2957 | =for apidoc Aox||blockhook_register |
fd85fad2 BM |
2958 | |
2959 | Register a set of hooks to be called when the Perl lexical scope changes | |
2960 | at compile time. See L<perlguts/"Compile-time scope hooks">. | |
2961 | ||
2962 | =cut | |
2963 | */ | |
2964 | ||
bb6c22e7 BM |
2965 | void |
2966 | Perl_blockhook_register(pTHX_ BHK *hk) | |
2967 | { | |
2968 | PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER; | |
2969 | ||
2970 | Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk))); | |
2971 | } | |
2972 | ||
76e3520e | 2973 | STATIC OP * |
cea2e8a9 | 2974 | S_newDEFSVOP(pTHX) |
54b9620d | 2975 | { |
97aff369 | 2976 | dVAR; |
cc76b5cc | 2977 | const PADOFFSET offset = pad_findmy_pvs("$_", 0); |
00b1698f | 2978 | if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) { |
59f00321 RGS |
2979 | return newSVREF(newGVOP(OP_GV, 0, PL_defgv)); |
2980 | } | |
2981 | else { | |
551405c4 | 2982 | OP * const o = newOP(OP_PADSV, 0); |
59f00321 RGS |
2983 | o->op_targ = offset; |
2984 | return o; | |
2985 | } | |
54b9620d MB |
2986 | } |
2987 | ||
a0d0e21e | 2988 | void |
864dbfa3 | 2989 | Perl_newPROG(pTHX_ OP *o) |
a0d0e21e | 2990 | { |
97aff369 | 2991 | dVAR; |
7918f24d NC |
2992 | |
2993 | PERL_ARGS_ASSERT_NEWPROG; | |
2994 | ||
3280af22 | 2995 | if (PL_in_eval) { |
86a64801 | 2996 | PERL_CONTEXT *cx; |
63429d50 | 2997 | I32 i; |
b295d113 TH |
2998 | if (PL_eval_root) |
2999 | return; | |
faef0170 HS |
3000 | PL_eval_root = newUNOP(OP_LEAVEEVAL, |
3001 | ((PL_in_eval & EVAL_KEEPERR) | |
3002 | ? OPf_SPECIAL : 0), o); | |
86a64801 GG |
3003 | |
3004 | cx = &cxstack[cxstack_ix]; | |
3005 | assert(CxTYPE(cx) == CXt_EVAL); | |
3006 | ||
3007 | if ((cx->blk_gimme & G_WANT) == G_VOID) | |
3008 | scalarvoid(PL_eval_root); | |
3009 | else if ((cx->blk_gimme & G_WANT) == G_ARRAY) | |
3010 | list(PL_eval_root); | |
3011 | else | |
3012 | scalar(PL_eval_root); | |
3013 | ||
5983a79d | 3014 | PL_eval_start = op_linklist(PL_eval_root); |
7934575e GS |
3015 | PL_eval_root->op_private |= OPpREFCOUNTED; |
3016 | OpREFCNT_set(PL_eval_root, 1); | |
3280af22 | 3017 | PL_eval_root->op_next = 0; |
63429d50 FC |
3018 | i = PL_savestack_ix; |
3019 | SAVEFREEOP(o); | |
3020 | ENTER; | |
a2efc822 | 3021 | CALL_PEEP(PL_eval_start); |
86a64801 | 3022 | finalize_optree(PL_eval_root); |
63429d50 FC |
3023 | LEAVE; |
3024 | PL_savestack_ix = i; | |
a0d0e21e LW |
3025 | } |
3026 | else { | |
6be89cf9 | 3027 | if (o->op_type == OP_STUB) { |
22e660b4 NC |
3028 | /* This block is entered if nothing is compiled for the main |
3029 | program. This will be the case for an genuinely empty main | |
3030 | program, or one which only has BEGIN blocks etc, so already | |
3031 | run and freed. | |
3032 | ||
3033 | Historically (5.000) the guard above was !o. However, commit | |
3034 | f8a08f7b8bd67b28 (Jun 2001), integrated to blead as | |
3035 | c71fccf11fde0068, changed perly.y so that newPROG() is now | |
3036 | called with the output of block_end(), which returns a new | |
3037 | OP_STUB for the case of an empty optree. ByteLoader (and | |
3038 | maybe other things) also take this path, because they set up | |
3039 | PL_main_start and PL_main_root directly, without generating an | |
3040 | optree. | |
8b31d4e4 NC |
3041 | |
3042 | If the parsing the main program aborts (due to parse errors, | |
3043 | or due to BEGIN or similar calling exit), then newPROG() | |
3044 | isn't even called, and hence this code path and its cleanups | |
3045 | are skipped. This shouldn't make a make a difference: | |
3046 | * a non-zero return from perl_parse is a failure, and | |
3047 | perl_destruct() should be called immediately. | |
3048 | * however, if exit(0) is called during the parse, then | |
3049 | perl_parse() returns 0, and perl_run() is called. As | |
3050 | PL_main_start will be NULL, perl_run() will return | |
3051 | promptly, and the exit code will remain 0. | |
22e660b4 NC |
3052 | */ |
3053 | ||
6be89cf9 AE |
3054 | PL_comppad_name = 0; |
3055 | PL_compcv = 0; | |
d2c837a0 | 3056 | S_op_destroy(aTHX_ o); |
a0d0e21e | 3057 | return; |
6be89cf9 | 3058 | } |
3ad73efd | 3059 | PL_main_root = op_scope(sawparens(scalarvoid(o))); |
3280af22 NIS |
3060 | PL_curcop = &PL_compiling; |
3061 | PL_main_start = LINKLIST(PL_main_root); | |
7934575e GS |
3062 | PL_main_root->op_private |= OPpREFCOUNTED; |
3063 | OpREFCNT_set(PL_main_root, 1); | |
3280af22 | 3064 | PL_main_root->op_next = 0; |
a2efc822 | 3065 | CALL_PEEP(PL_main_start); |
d164302a | 3066 | finalize_optree(PL_main_root); |
8be227ab | 3067 | cv_forget_slab(PL_compcv); |
3280af22 | 3068 | PL_compcv = 0; |
3841441e | 3069 | |
4fdae800 | 3070 | /* Register with debugger */ |
84902520 | 3071 | if (PERLDB_INTER) { |
b96d8cd9 | 3072 | CV * const cv = get_cvs("DB::postponed", 0); |
3841441e CS |
3073 | if (cv) { |
3074 | dSP; | |
924508f0 | 3075 | PUSHMARK(SP); |
ad64d0ec | 3076 | XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling))); |
3841441e | 3077 | PUTBACK; |
ad64d0ec | 3078 | call_sv(MUTABLE_SV(cv), G_DISCARD); |
3841441e CS |
3079 | } |
3080 | } | |
79072805 | 3081 | } |
79072805 LW |
3082 | } |
3083 | ||
3084 | OP * | |
864dbfa3 | 3085 | Perl_localize(pTHX_ OP *o, I32 lex) |
79072805 | 3086 | { |
97aff369 | 3087 | dVAR; |
7918f24d NC |
3088 | |
3089 | PERL_ARGS_ASSERT_LOCALIZE; | |
3090 | ||
79072805 | 3091 | if (o->op_flags & OPf_PARENS) |
d2be0de5 YST |
3092 | /* [perl #17376]: this appears to be premature, and results in code such as |
3093 | C< our(%x); > executing in list mode rather than void mode */ | |
3094 | #if 0 | |
79072805 | 3095 | list(o); |
d2be0de5 | 3096 | #else |
6f207bd3 | 3097 | NOOP; |
d2be0de5 | 3098 | #endif |
8990e307 | 3099 | else { |
f06b5848 DM |
3100 | if ( PL_parser->bufptr > PL_parser->oldbufptr |
3101 | && PL_parser->bufptr[-1] == ',' | |
041457d9 | 3102 | && ckWARN(WARN_PARENTHESIS)) |
64420d0d | 3103 | { |
f06b5848 | 3104 | char *s = PL_parser->bufptr; |
bac662ee | 3105 | bool sigil = FALSE; |
64420d0d | 3106 | |
8473848f | 3107 | /* some heuristics to detect a potential error */ |
bac662ee | 3108 | while (*s && (strchr(", \t\n", *s))) |
64420d0d | 3109 | s++; |
8473848f | 3110 | |
bac662ee TS |
3111 | while (1) { |
3112 | if (*s && strchr("@$%*", *s) && *++s | |
0eb30aeb | 3113 | && (isWORDCHAR(*s) || UTF8_IS_CONTINUED(*s))) { |
bac662ee TS |
3114 | s++; |
3115 | sigil = TRUE; | |
0eb30aeb | 3116 | while (*s && (isWORDCHAR(*s) || UTF8_IS_CONTINUED(*s))) |
bac662ee TS |
3117 | s++; |
3118 | while (*s && (strchr(", \t\n", *s))) | |
3119 | s++; | |
3120 | } | |
3121 | else | |
3122 | break; | |
3123 | } | |
3124 | if (sigil && (*s == ';' || *s == '=')) { | |
3125 | Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS), | |
8473848f | 3126 | "Parentheses missing around \"%s\" list", |
12bd6ede DM |
3127 | lex |
3128 | ? (PL_parser->in_my == KEY_our | |
3129 | ? "our" | |
3130 | : PL_parser->in_my == KEY_state | |
3131 | ? "state" | |
3132 | : "my") | |
3133 | : "local"); | |
8473848f | 3134 | } |
8990e307 LW |
3135 | } |
3136 | } | |
93a17b20 | 3137 | if (lex) |
eb64745e | 3138 | o = my(o); |
93a17b20 | 3139 | else |
3ad73efd | 3140 | o = op_lvalue(o, OP_NULL); /* a bit kludgey */ |
12bd6ede DM |
3141 | PL_parser->in_my = FALSE; |
3142 | PL_parser->in_my_stash = NULL; | |
eb64745e | 3143 | return o; |
79072805 LW |
3144 | } |
3145 | ||
3146 | OP * | |
864dbfa3 | 3147 | Perl_jmaybe(pTHX_ OP *o) |
79072805 | 3148 | { |
7918f24d NC |
3149 | PERL_ARGS_ASSERT_JMAYBE; |
3150 | ||
79072805 | 3151 | if (o->op_type == OP_LIST) { |
fafc274c | 3152 | OP * const o2 |
d4c19fe8 | 3153 | = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV))); |
2fcb4757 | 3154 | o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o)); |
79072805 LW |
3155 | } |
3156 | return o; | |
3157 | } | |
3158 | ||
985b9e54 GG |
3159 | PERL_STATIC_INLINE OP * |
3160 | S_op_std_init(pTHX_ OP *o) | |
3161 | { | |
3162 | I32 type = o->op_type; | |
3163 | ||
3164 | PERL_ARGS_ASSERT_OP_STD_INIT; | |
3165 | ||
3166 | if (PL_opargs[type] & OA_RETSCALAR) | |
3167 | scalar(o); | |
3168 | if (PL_opargs[type] & OA_TARGET && !o->op_targ) | |
3169 | o->op_targ = pad_alloc(type, SVs_PADTMP); | |
3170 | ||
3171 | return o; | |
3172 | } | |
3173 | ||
3174 | PERL_STATIC_INLINE OP * | |
3175 | S_op_integerize(pTHX_ OP *o) | |
3176 | { | |
3177 | I32 type = o->op_type; | |
3178 | ||
3179 | PERL_ARGS_ASSERT_OP_INTEGERIZE; | |
3180 | ||
077da62f FC |
3181 | /* integerize op. */ |
3182 | if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)) | |
985b9e54 | 3183 | { |
f5f19483 | 3184 | dVAR; |
985b9e54 GG |
3185 | o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)]; |
3186 | } | |
3187 | ||
3188 | if (type == OP_NEGATE) | |
3189 | /* XXX might want a ck_negate() for this */ | |
3190 | cUNOPo->op_first->op_private &= ~OPpCONST_STRICT; | |
3191 | ||
3192 | return o; | |
3193 | } | |
3194 | ||
1f676739 | 3195 | static OP * |
5aaab254 | 3196 | S_fold_constants(pTHX_ OP *o) |
79072805 | 3197 | { |
27da23d5 | 3198 | dVAR; |
eb578fdb | 3199 | OP * VOL curop; |
eb8433b7 | 3200 | OP *newop; |
8ea43dc8 | 3201 | VOL I32 type = o->op_type; |
e3cbe32f | 3202 | SV * VOL sv = NULL; |
b7f7fd0b NC |
3203 | int ret = 0; |
3204 | I32 oldscope; | |
3205 | OP *old_next; | |
5f2d9966 DM |
3206 | SV * const oldwarnhook = PL_warnhook; |
3207 | SV * const olddiehook = PL_diehook; | |
c427f4d2 | 3208 | COP not_compiling; |
b7f7fd0b | 3209 | dJMPENV; |
79072805 | 3210 | |
7918f24d NC |
3211 | PERL_ARGS_ASSERT_FOLD_CONSTANTS; |
3212 | ||
22c35a8c | 3213 | if (!(PL_opargs[type] & OA_FOLDCONST)) |
79072805 LW |
3214 | goto nope; |
3215 | ||
de939608 | 3216 | switch (type) { |
de939608 CS |
3217 | case OP_UCFIRST: |
3218 | case OP_LCFIRST: | |
3219 | case OP_UC: | |
3220 | case OP_LC: | |
7ccde120 | 3221 | case OP_FC: |
69dcf70c MB |
3222 | case OP_SLT: |
3223 | case OP_SGT: | |
3224 | case OP_SLE: | |
3225 | case OP_SGE: | |
3226 | case OP_SCMP: | |
b3fd6149 | 3227 | case OP_SPRINTF: |
2de3dbcc | 3228 | /* XXX what about the numeric ops? */ |
82ad65bb | 3229 | if (IN_LOCALE_COMPILETIME) |
de939608 | 3230 | goto nope; |
553e7bb0 | 3231 | break; |
dd9a6ccf FC |
3232 | case OP_PACK: |
3233 | if (!cLISTOPo->op_first->op_sibling | |
3234 | || cLISTOPo->op_first->op_sibling->op_type != OP_CONST) | |
3235 | goto nope; | |
3236 | { | |
3237 | SV * const sv = cSVOPx_sv(cLISTOPo->op_first->op_sibling); | |
3238 | if (!SvPOK(sv) || SvGMAGICAL(sv)) goto nope; | |
3239 | { | |
3240 | const char *s = SvPVX_const(sv); | |
3241 | while (s < SvEND(sv)) { | |
3242 | if (*s == 'p' || *s == 'P') goto nope; | |
3243 | s++; | |
3244 | } | |
3245 | } | |
3246 | } | |
3247 | break; | |
baed7faa FC |
3248 | case OP_REPEAT: |
3249 | if (o->op_private & OPpREPEAT_DOLIST) goto nope; | |
de939608 CS |
3250 | } |
3251 | ||
13765c85 | 3252 | if (PL_parser && PL_parser->error_count) |
a0d0e21e LW |
3253 | goto nope; /* Don't try to run w/ errors */ |
3254 | ||
79072805 | 3255 | for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) { |
1496a290 AL |
3256 | const OPCODE type = curop->op_type; |
3257 | if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) && | |
3258 | type != OP_LIST && | |
3259 | type != OP_SCALAR && | |
3260 | type != OP_NULL && | |
3261 | type != OP_PUSHMARK) | |
7a52d87a | 3262 | { |
79072805 LW |
3263 | goto nope; |
3264 | } | |
3265 | } | |
3266 | ||
3267 | curop = LINKLIST(o); | |
b7f7fd0b | 3268 | old_next = o->op_next; |
79072805 | 3269 | o->op_next = 0; |
533c011a | 3270 | PL_op = curop; |
b7f7fd0b NC |
3271 | |
3272 | oldscope = PL_scopestack_ix; | |
edb2152a | 3273 | create_eval_scope(G_FAKINGEVAL); |
b7f7fd0b | 3274 | |
c427f4d2 NC |
3275 | /* Verify that we don't need to save it: */ |
3276 | assert(PL_curcop == &PL_compiling); | |
3277 | StructCopy(&PL_compiling, ¬_compiling, COP); | |
3278 | PL_curcop = ¬_compiling; | |
3279 | /* The above ensures that we run with all the correct hints of the | |
3280 | currently compiling COP, but that IN_PERL_RUNTIME is not true. */ | |
3281 | assert(IN_PERL_RUNTIME); | |
5f2d9966 DM |
3282 | PL_warnhook = PERL_WARNHOOK_FATAL; |
3283 | PL_diehook = NULL; | |
b7f7fd0b NC |
3284 | JMPENV_PUSH(ret); |
3285 | ||
3286 | switch (ret) { | |
3287 | case 0: | |
3288 | CALLRUNOPS(aTHX); | |
3289 | sv = *(PL_stack_sp--); | |
523a0f0c NC |
3290 | if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */ |
3291 | #ifdef PERL_MAD | |
3292 | /* Can't simply swipe the SV from the pad, because that relies on | |
3293 | the op being freed "real soon now". Under MAD, this doesn't | |
3294 | happen (see the #ifdef below). */ | |
3295 | sv = newSVsv(sv); | |
3296 | #else | |
b7f7fd0b | 3297 | pad_swipe(o->op_targ, FALSE); |
523a0f0c NC |
3298 | #endif |
3299 | } | |
b7f7fd0b NC |
3300 | else if (SvTEMP(sv)) { /* grab mortal temp? */ |
3301 | SvREFCNT_inc_simple_void(sv); | |
3302 | SvTEMP_off(sv); | |
3303 | } | |
ba610af8 | 3304 | else { assert(SvIMMORTAL(sv)); } |
b7f7fd0b NC |
3305 | break; |
3306 | case 3: | |
3307 | /* Something tried to die. Abandon constant folding. */ | |
3308 | /* Pretend the error never happened. */ | |
ab69dbc2 | 3309 | CLEAR_ERRSV(); |
b7f7fd0b NC |
3310 | o->op_next = old_next; |
3311 | break; | |
3312 | default: | |
3313 | JMPENV_POP; | |
5f2d9966 DM |
3314 | /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */ |
3315 | PL_warnhook = oldwarnhook; | |
3316 | PL_diehook = olddiehook; | |
3317 | /* XXX note that this croak may fail as we've already blown away | |
3318 | * the stack - eg any nested evals */ | |
b7f7fd0b NC |
3319 | Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret); |
3320 | } | |
b7f7fd0b | 3321 | JMPENV_POP; |
5f2d9966 DM |
3322 | PL_warnhook = oldwarnhook; |
3323 | PL_diehook = olddiehook; | |
c427f4d2 | 3324 | PL_curcop = &PL_compiling; |
edb2152a NC |
3325 | |
3326 | if (PL_scopestack_ix > oldscope) | |
3327 | delete_eval_scope(); | |
eb8433b7 | 3328 | |
b7f7fd0b NC |
3329 | if (ret) |
3330 | goto nope; | |
3331 | ||
eb8433b7 | 3332 | #ifndef PERL_MAD |
79072805 | 3333 | op_free(o); |
eb8433b7 | 3334 | #endif |
de5e01c2 | 3335 | assert(sv); |
2484f8db | 3336 | if (!SvIMMORTAL(sv)) SvPADTMP_on(sv); |
79072805 | 3337 | if (type == OP_RV2GV) |
159b6efe | 3338 | newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv)); |
eb8433b7 | 3339 | else |
3513c740 | 3340 | { |
cc2ebcd7 | 3341 | newop = newSVOP(OP_CONST, OPpCONST_FOLDED<<8, MUTABLE_SV(sv)); |
3513c740 NT |
3342 | newop->op_folded = 1; |
3343 | } | |
eb8433b7 NC |
3344 | op_getmad(o,newop,'f'); |
3345 | return newop; | |
aeea060c | 3346 | |
b7f7fd0b | 3347 | nope: |
79072805 LW |
3348 | return o; |
3349 | } | |
3350 | ||
1f676739 | 3351 | static OP * |
5aaab254 | 3352 | S_gen_constant_list(pTHX_ OP *o) |
79072805 | 3353 | { |
27da23d5 | 3354 | dVAR; |
eb578fdb | 3355 | OP *curop; |
6867be6d | 3356 | const I32 oldtmps_floor = PL_tmps_floor; |
5608dcc6 FC |
3357 | SV **svp; |
3358 | AV *av; | |
79072805 | 3359 | |
a0d0e21e | 3360 | list(o); |
13765c85 | 3361 | if (PL_parser && PL_parser->error_count) |
a0d0e21e LW |
3362 | return o; /* Don't attempt to run with errors */ |
3363 | ||
533c011a | 3364 | PL_op = curop = LINKLIST(o); |
a0d0e21e | 3365 | o->op_next = 0; |
a2efc822 | 3366 | CALL_PEEP(curop); |
897d3989 | 3367 | Perl_pp_pushmark(aTHX); |
cea2e8a9 | 3368 | CALLRUNOPS(aTHX); |
533c011a | 3369 | PL_op = curop; |
78c72037 NC |
3370 | assert (!(curop->op_flags & OPf_SPECIAL)); |
3371 | assert(curop->op_type == OP_RANGE); | |
897d3989 | 3372 | Perl_pp_anonlist(aTHX); |
3280af22 | 3373 | PL_tmps_floor = oldtmps_floor; |
79072805 LW |
3374 | |
3375 | o->op_type = OP_RV2AV; | |
22c35a8c | 3376 | o->op_ppaddr = PL_ppaddr[OP_RV2AV]; |
fb53bbb2 SG |
3377 | o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */ |
3378 | o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */ | |
1a0a2ba9 | 3379 | o->op_opt = 0; /* needs to be revisited in rpeep() */ |
79072805 | 3380 | curop = ((UNOP*)o)->op_first; |
5608dcc6 FC |
3381 | av = (AV *)SvREFCNT_inc_NN(*PL_stack_sp--); |
3382 | ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, (SV *)av); | |
3383 | if (AvFILLp(av) != -1) | |
3384 | for (svp = AvARRAY(av) + AvFILLp(av); svp >= AvARRAY(av); --svp) | |
3385 | SvPADTMP_on(*svp); | |
eb8433b7 NC |
3386 | #ifdef PERL_MAD |
3387 | op_getmad(curop,o,'O'); | |
3388 | #else | |
79072805 | 3389 | op_free(curop); |
eb8433b7 | 3390 | #endif |
5983a79d | 3391 | LINKLIST(o); |
79072805 LW |
3392 | return list(o); |
3393 | } | |
3394 | ||
3395 | OP * | |
864dbfa3 | 3396 | Perl_convert(pTHX_ I32 type, I32 flags, OP *o) |
79072805 | 3397 | { |
27da23d5 | 3398 | dVAR; |
d67594ff | 3399 | if (type < 0) type = -type, flags |= OPf_SPECIAL; |
11343788 | 3400 | if (!o || o->op_type != OP_LIST) |
5f66b61c | 3401 | o = newLISTOP(OP_LIST, 0, o, NULL); |
748a9306 | 3402 | else |
5dc0d613 | 3403 | o->op_flags &= ~OPf_WANT; |
79072805 | 3404 | |
22c35a8c | 3405 | if (!(PL_opargs[type] & OA_MARK)) |
93c66552 | 3406 | op_null(cLISTOPo->op_first); |
bf0571fd FC |
3407 | else { |
3408 | OP * const kid2 = cLISTOPo->op_first->op_sibling; | |
3409 | if (kid2 && kid2->op_type == OP_COREARGS) { | |
3410 | op_null(cLISTOPo->op_first); | |
3411 | kid2->op_private |= OPpCOREARGS_PUSHMARK; | |
3412 | } | |
3413 | } | |
8990e307 | 3414 | |
eb160463 | 3415 | o->op_type = (OPCODE)type; |
22c35a8c | 3416 | o->op_ppaddr = PL_ppaddr[type]; |
11343788 | 3417 | o->op_flags |= flags; |
79072805 | 3418 | |
11343788 | 3419 | o = CHECKOP(type, o); |
fe2774ed | 3420 | if (o->op_type != (unsigned)type) |
11343788 | 3421 | return o; |
79072805 | 3422 | |
985b9e54 | 3423 | return fold_constants(op_integerize(op_std_init(o))); |
79072805 LW |
3424 | } |
3425 | ||
2fcb4757 Z |
3426 | /* |
3427 | =head1 Optree Manipulation Functions | |
3428 | */ | |
3429 | ||
79072805 LW |
3430 | /* List constructors */ |
3431 | ||
2fcb4757 Z |
3432 | /* |
3433 | =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last | |
3434 | ||
3435 | Append an item to the list of ops contained directly within a list-type | |
3436 | op, returning the lengthened list. I<first> is the list-type op, | |
3437 | and I<last> is the op to append to the list. I<optype> specifies the | |
3438 | intended opcode for the list. If I<first> is not already a list of the | |
3439 | right type, it will be upgraded into one. If either I<first> or I<last> | |
3440 | is null, the other is returned unchanged. | |
3441 | ||
3442 | =cut | |
3443 | */ | |
3444 | ||
79072805 | 3445 | OP * |
2fcb4757 | 3446 | Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last) |
79072805 LW |
3447 | { |
3448 | if (!first) | |
3449 | return last; | |
8990e307 LW |
3450 | |
3451 | if (!last) | |
79072805 | 3452 | return first; |
8990e307 | 3453 | |
fe2774ed | 3454 | if (first->op_type != (unsigned)type |
155aba94 GS |
3455 | || (type == OP_LIST && (first->op_flags & OPf_PARENS))) |
3456 | { | |
3457 | return newLISTOP(type, 0, first, last); | |
3458 | } | |
79072805 | 3459 | |
a0d0e21e LW |
3460 | if (first->op_flags & OPf_KIDS) |
3461 | ((LISTOP*)first)->op_last->op_sibling = last; | |
3462 | else { | |
3463 | first->op_flags |= OPf_KIDS; | |
3464 | ((LISTOP*)first)->op_first = last; | |
3465 | } | |
3466 | ((LISTOP*)first)->op_last = last; | |
a0d0e21e | 3467 | return first; |
79072805 LW |
3468 | } |
3469 | ||
2fcb4757 Z |
3470 | /* |
3471 | =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last | |
3472 | ||
3473 | Concatenate the lists of ops contained directly within two list-type ops, | |
3474 | returning the combined list. I<first> and I<last> are the list-type ops | |
3475 | to concatenate. I<optype> specifies the intended opcode for the list. | |
3476 | If either I<first> or I<last> is not already a list of the right type, | |
3477 | it will be upgraded into one. If either I<first> or I<last> is null, | |
3478 | the other is returned unchanged. | |
3479 | ||
3480 | =cut | |
3481 | */ | |
3482 | ||
79072805 | 3483 | OP * |
2fcb4757 | 3484 | Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last) |
79072805 LW |
3485 | { |
3486 | if (!first) | |
2fcb4757 | 3487 | return last; |
8990e307 LW |
3488 | |
3489 | if (!last) | |
2fcb4757 | 3490 | return first; |
8990e307 | 3491 | |
fe2774ed | 3492 | if (first->op_type != (unsigned)type) |
2fcb4757 | 3493 | return op_prepend_elem(type, first, last); |
8990e307 | 3494 | |
fe2774ed | 3495 | if (last->op_type != (unsigned)type) |
2fcb4757 | 3496 | return op_append_elem(type, first, last); |
79072805 | 3497 | |
2fcb4757 Z |
3498 | ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first; |
3499 | ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last; | |
117dada2 | 3500 | first->op_flags |= (last->op_flags & OPf_KIDS); |
1c846c1f | 3501 | |
eb8433b7 | 3502 | #ifdef PERL_MAD |
2fcb4757 Z |
3503 | if (((LISTOP*)last)->op_first && first->op_madprop) { |
3504 | MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop; | |
eb8433b7 NC |
3505 | if (mp) { |
3506 | while (mp->mad_next) | |
3507 | mp = mp->mad_next; | |
3508 | mp->mad_next = first->op_madprop; | |
3509 | } | |
3510 | else { | |
2fcb4757 | 3511 | ((LISTOP*)last)->op_first->op_madprop = first->op_madprop; |
eb8433b7 NC |
3512 | } |
3513 | } | |
3514 | first->op_madprop = last->op_madprop; | |
3515 | last->op_madprop = 0; | |
3516 | #endif | |
3517 | ||
2fcb4757 | 3518 | S_op_destroy(aTHX_ last); |
238a4c30 | 3519 | |
2fcb4757 | 3520 | return first; |
79072805 LW |
3521 | } |
3522 | ||
2fcb4757 Z |
3523 | /* |
3524 | =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last | |
3525 | ||
3526 | Prepend an item to the list of ops contained directly within a list-type | |
3527 | op, returning the lengthened list. I<first> is the op to prepend to the | |
3528 | list, and I<last> is the list-type op. I<optype> specifies the intended | |
3529 | opcode for the list. If I<last> is not already a list of the right type, | |
3530 | it will be upgraded into one. If either I<first> or I<last> is null, | |
3531 | the other is returned unchanged. | |
3532 | ||
3533 | =cut | |
3534 | */ | |
3535 | ||
79072805 | 3536 | OP * |
2fcb4757 | 3537 | Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last) |
79072805 LW |
3538 | { |
3539 | if (!first) | |
3540 | return last; | |
8990e307 LW |
3541 | |
3542 | if (!last) | |
79072805 | 3543 | return first; |
8990e307 | 3544 | |
fe2774ed | 3545 | if (last->op_type == (unsigned)type) { |
8990e307 LW |
3546 | if (type == OP_LIST) { /* already a PUSHMARK there */ |
3547 | first->op_sibling = ((LISTOP*)last)->op_first->op_sibling; | |
3548 | ((LISTOP*)last)->op_first->op_sibling = first; | |
36a5d4ba DC |
3549 | if (!(first->op_flags & OPf_PARENS)) |
3550 | last->op_flags &= ~OPf_PARENS; | |
8990e307 LW |
3551 | } |
3552 | else { | |
3553 | if (!(last->op_flags & OPf_KIDS)) { | |
3554 | ((LISTOP*)last)->op_last = first; | |
3555 | last->op_flags |= OPf_KIDS; | |
3556 | } | |
3557 | first->op_sibling = ((LISTOP*)last)->op_first; | |
3558 | ((LISTOP*)last)->op_first = first; | |
79072805 | 3559 | } |
117dada2 | 3560 | last->op_flags |= OPf_KIDS; |
79072805 LW |
3561 | return last; |
3562 | } | |
3563 | ||
3564 | return newLISTOP(type, 0, first, last); | |
3565 | } | |
3566 | ||
3567 | /* Constructors */ | |
3568 | ||
eb8433b7 NC |
3569 | #ifdef PERL_MAD |
3570 | ||
3571 | TOKEN * | |
3572 | Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop) | |
3573 | { | |
3574 | TOKEN *tk; | |
99129197 | 3575 | Newxz(tk, 1, TOKEN); |
eb8433b7 NC |
3576 | tk->tk_type = (OPCODE)optype; |
3577 | tk->tk_type = 12345; | |
3578 | tk->tk_lval = lval; | |
3579 | tk->tk_mad = madprop; | |
3580 | return tk; | |
3581 | } | |
3582 | ||
3583 | void | |
3584 | Perl_token_free(pTHX_ TOKEN* tk) | |
3585 | { | |
7918f24d NC |
3586 | PERL_ARGS_ASSERT_TOKEN_FREE; |
3587 | ||
eb8433b7 NC |
3588 | if (tk->tk_type != 12345) |
3589 | return; | |
3590 | mad_free(tk->tk_mad); | |
3591 | Safefree(tk); | |
3592 | } | |
3593 | ||
3594 | void | |
3595 | Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot) | |
3596 | { | |
3597 | MADPROP* mp; | |
3598 | MADPROP* tm; | |
7918f24d NC |
3599 | |
3600 | PERL_ARGS_ASSERT_TOKEN_GETMAD; | |
3601 | ||
eb8433b7 NC |
3602 | if (tk->tk_type != 12345) { |
3603 | Perl_warner(aTHX_ packWARN(WARN_MISC), | |
3604 | "Invalid TOKEN object ignored"); | |
3605 | return; | |
3606 | } | |
3607 | tm = tk->tk_mad; | |
3608 | if (!tm) | |
3609 | return; | |
3610 | ||
3611 | /* faked up qw list? */ | |
3612 | if (slot == '(' && | |
3613 | tm->mad_type == MAD_SV && | |
d503a9ba | 3614 | SvPVX((SV *)tm->mad_val)[0] == 'q') |
eb8433b7 NC |
3615 | slot = 'x'; |
3616 | ||
3617 | if (o) { | |
3618 | mp = o->op_madprop; | |
3619 | if (mp) { | |
3620 | for (;;) { | |
3621 | /* pretend constant fold didn't happen? */ | |
3622 | if (mp->mad_key == 'f' && | |
3623 | (o->op_type == OP_CONST || | |
3624 | o->op_type == OP_GV) ) | |
3625 | { | |
3626 | token_getmad(tk,(OP*)mp->mad_val,slot); | |
3627 | return; | |
3628 | } | |
3629 | if (!mp->mad_next) | |
3630 | break; | |
3631 | mp = mp->mad_next; | |
3632 | } | |
3633 | mp->mad_next = tm; | |
3634 | mp = mp->mad_next; | |
3635 | } | |
3636 | else { | |
3637 | o->op_madprop = tm; | |
3638 | mp = o->op_madprop; | |
3639 | } | |
3640 | if (mp->mad_key == 'X') | |
3641 | mp->mad_key = slot; /* just change the first one */ | |
3642 | ||
3643 | tk->tk_mad = 0; | |
3644 | } | |
3645 | else | |
3646 | mad_free(tm); | |
3647 | Safefree(tk); | |
3648 | } | |
3649 | ||
3650 | void | |
3651 | Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot) | |
3652 | { | |
3653 | MADPROP* mp; | |
3654 | if (!from) | |
3655 | return; | |
3656 | if (o) { | |
3657 | mp = o->op_madprop; | |
3658 | if (mp) { | |
3659 | for (;;) { | |
3660 | /* pretend constant fold didn't happen? */ | |
3661 | if (mp->mad_key == 'f' && | |
3662 | (o->op_type == OP_CONST || | |
3663 | o->op_type == OP_GV) ) | |
3664 | { | |
3665 | op_getmad(from,(OP*)mp->mad_val,slot); | |
3666 | return; | |
3667 | } | |
3668 | if (!mp->mad_next) | |
3669 | break; | |
3670 | mp = mp->mad_next; | |
3671 | } | |
3672 | mp->mad_next = newMADPROP(slot,MAD_OP,from,0); | |
3673 | } | |
3674 | else { | |
3675 | o->op_madprop = newMADPROP(slot,MAD_OP,from,0); | |
3676 | } | |
3677 | } | |
3678 | } | |
3679 | ||
3680 | void | |
3681 | Perl_op_getmad(pTHX_ OP* from, OP* o, char slot) | |
3682 | { | |
3683 | MADPROP* mp; | |
3684 | if (!from) | |
3685 | return; | |
3686 | if (o) { | |
3687 | mp = o->op_madprop; | |
3688 | if (mp) { | |
3689 | for (;;) { | |
3690 | /* pretend constant fold didn't happen? */ | |
3691 | if (mp->mad_key == 'f' && | |
3692 | (o->op_type == OP_CONST || | |
3693 | o->op_type == OP_GV) ) | |
3694 | { | |
3695 | op_getmad(from,(OP*)mp->mad_val,slot); | |
3696 | return; | |
3697 | } | |
3698 | if (!mp->mad_next) | |
3699 | break; | |
3700 | mp = mp->mad_next; | |
3701 | } | |
3702 | mp->mad_next = newMADPROP(slot,MAD_OP,from,1); | |
3703 | } | |
3704 | else { | |
3705 | o->op_madprop = newMADPROP(slot,MAD_OP,from,1); | |
3706 | } | |
3707 | } | |
3708 | else { | |
99129197 NC |
3709 | PerlIO_printf(PerlIO_stderr(), |
3710 | "DESTROYING op = %0"UVxf"\n", PTR2UV(from)); | |
eb8433b7 NC |
3711 | op_free(from); |
3712 | } | |
3713 | } | |
3714 | ||
3715 | void | |
3716 | Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot) | |
3717 | { | |
3718 | MADPROP* tm; | |
3719 | if (!mp || !o) | |
3720 | return; | |
3721 | if (slot) | |
3722 | mp->mad_key = slot; | |
3723 | tm = o->op_madprop; | |
3724 | o->op_madprop = mp; | |
3725 | for (;;) { | |
3726 | if (!mp->mad_next) | |
3727 | break; | |
3728 | mp = mp->mad_next; | |
3729 | } | |
3730 | mp->mad_next = tm; | |
3731 | } | |
3732 | ||
3733 | void | |
3734 | Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot) | |
3735 | { | |
3736 | if (!o) | |
3737 | return; | |
3738 | addmad(tm, &(o->op_madprop), slot); | |
3739 | } | |
3740 | ||
3741 | void | |
3742 | Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot) | |
3743 | { | |
3744 | MADPROP* mp; | |
3745 | if (!tm || !root) | |
3746 | return; | |
3747 | if (slot) | |
3748 | tm->mad_key = slot; | |
3749 | mp = *root; | |
3750 | if (!mp) { | |
3751 | *root = tm; | |
3752 | return; | |
3753 | } | |
3754 | for (;;) { | |
3755 | if (!mp->mad_next) | |
3756 | break; | |
3757 | mp = mp->mad_next; | |
3758 | } | |
3759 | mp->mad_next = tm; | |
3760 | } | |
3761 | ||
3762 | MADPROP * | |
3763 | Perl_newMADsv(pTHX_ char key, SV* sv) | |
3764 | { | |
7918f24d NC |
3765 | PERL_ARGS_ASSERT_NEWMADSV; |
3766 | ||
eb8433b7 NC |
3767 | return newMADPROP(key, MAD_SV, sv, 0); |
3768 | } | |
3769 | ||
3770 | MADPROP * | |
d503a9ba | 3771 | Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen) |
eb8433b7 | 3772 | { |
c111d5f1 | 3773 | MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP)); |
eb8433b7 NC |
3774 | mp->mad_next = 0; |
3775 | mp->mad_key = key; | |
3776 | mp->mad_vlen = vlen; | |
3777 | mp->mad_type = type; | |
3778 | mp->mad_val = val; | |
3779 | /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */ | |
3780 | return mp; | |
3781 | } | |
3782 | ||
3783 | void | |
3784 | Perl_mad_free(pTHX_ MADPROP* mp) | |
3785 | { | |
3786 | /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */ | |
3787 | if (!mp) | |
3788 | return; | |
3789 | if (mp->mad_next) | |
3790 | mad_free(mp->mad_next); | |
bc177e6b | 3791 | /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen) |
eb8433b7 NC |
3792 | PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */ |
3793 | switch (mp->mad_type) { | |
3794 | case MAD_NULL: | |
3795 | break; | |
3796 | case MAD_PV: | |
04d1a275 | 3797 | Safefree(mp->mad_val); |
eb8433b7 NC |
3798 | break; |
3799 | case MAD_OP: | |
3800 | if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */ | |
3801 | op_free((OP*)mp->mad_val); | |
3802 | break; | |
3803 | case MAD_SV: | |
ad64d0ec | 3804 | sv_free(MUTABLE_SV(mp->mad_val)); |
eb8433b7 NC |
3805 | break; |
3806 | default: | |
3807 | PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n"); | |
3808 | break; | |
3809 | } | |
c111d5f1 | 3810 | PerlMemShared_free(mp); |
eb8433b7 NC |
3811 | } |
3812 | ||
3813 | #endif | |
3814 | ||
d67eb5f4 Z |
3815 | /* |
3816 | =head1 Optree construction | |
3817 | ||
3818 | =for apidoc Am|OP *|newNULLLIST | |
3819 | ||
3820 | Constructs, checks, and returns a new C<stub> op, which represents an | |
3821 | empty list expression. | |
3822 | ||
3823 | =cut | |
3824 | */ | |
3825 | ||
79072805 | 3826 | OP * |
864dbfa3 | 3827 | Perl_newNULLLIST(pTHX) |
79072805 | 3828 | { |
8990e307 LW |
3829 | return newOP(OP_STUB, 0); |
3830 | } | |
3831 | ||
1f676739 | 3832 | static OP * |
b7783a12 | 3833 | S_force_list(pTHX_ OP *o) |
8990e307 | 3834 | { |
11343788 | 3835 | if (!o || o->op_type != OP_LIST) |
5f66b61c | 3836 | o = newLISTOP(OP_LIST, 0, o, NULL); |
93c66552 | 3837 | op_null(o); |
11343788 | 3838 | return o; |
79072805 LW |
3839 | } |
3840 | ||
d67eb5f4 Z |
3841 | /* |
3842 | =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last | |
3843 | ||
3844 | Constructs, checks, and returns an op of any list type. I<type> is | |
3845 | the opcode. I<flags> gives the eight bits of C<op_flags>, except that | |
3846 | C<OPf_KIDS> will be set automatically if required. I<first> and I<last> | |
3847 | supply up to two ops to be direct children of the list op; they are | |
3848 | consumed by this function and become part of the constructed op tree. | |
3849 | ||
3850 | =cut | |
3851 | */ | |
3852 | ||
79072805 | 3853 | OP * |
864dbfa3 | 3854 | Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last) |
79072805 | 3855 | { |
27da23d5 | 3856 | dVAR; |
79072805 LW |
3857 | LISTOP *listop; |
3858 | ||
e69777c1 GG |
3859 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP); |
3860 | ||
b7dc083c | 3861 | NewOp(1101, listop, 1, LISTOP); |
79072805 | 3862 | |
eb160463 | 3863 | listop->op_type = (OPCODE)type; |
22c35a8c | 3864 | listop->op_ppaddr = PL_ppaddr[type]; |
117dada2 SM |
3865 | if (first || last) |
3866 | flags |= OPf_KIDS; | |
eb160463 | 3867 | listop->op_flags = (U8)flags; |
79072805 LW |
3868 | |
3869 | if (!last && first) | |
3870 | last = first; | |
3871 | else if (!first && last) | |
3872 | first = last; | |
8990e307 LW |
3873 | else if (first) |
3874 | first->op_sibling = last; | |
79072805 LW |
3875 | listop->op_first = first; |
3876 | listop->op_last = last; | |
8990e307 | 3877 | if (type == OP_LIST) { |
551405c4 | 3878 | OP* const pushop = newOP(OP_PUSHMARK, 0); |
8990e307 LW |
3879 | pushop->op_sibling = first; |
3880 | listop->op_first = pushop; | |
3881 | listop->op_flags |= OPf_KIDS; | |
3882 | if (!last) | |
3883 | listop->op_last = pushop; | |
3884 | } | |
79072805 | 3885 | |
463d09e6 | 3886 | return CHECKOP(type, listop); |
79072805 LW |
3887 | } |
3888 | ||
d67eb5f4 Z |
3889 | /* |
3890 | =for apidoc Am|OP *|newOP|I32 type|I32 flags | |
3891 | ||
3892 | Constructs, checks, and returns an op of any base type (any type that | |
3893 | has no extra fields). I<type> is the opcode. I<flags> gives the | |
3894 | eight bits of C<op_flags>, and, shifted up eight bits, the eight bits | |
3895 | of C<op_private>. | |
3896 | ||
3897 | =cut | |
3898 | */ | |
3899 | ||
79072805 | 3900 | OP * |
864dbfa3 | 3901 | Perl_newOP(pTHX_ I32 type, I32 flags) |
79072805 | 3902 | { |
27da23d5 | 3903 | dVAR; |
11343788 | 3904 | OP *o; |
e69777c1 | 3905 | |
7d789282 FC |
3906 | if (type == -OP_ENTEREVAL) { |
3907 | type = OP_ENTEREVAL; | |
3908 | flags |= OPpEVAL_BYTES<<8; | |
3909 | } | |
3910 | ||
e69777c1 GG |
3911 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP |
3912 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP | |
3913 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP | |
3914 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP); | |
3915 | ||
b7dc083c | 3916 | NewOp(1101, o, 1, OP); |
eb160463 | 3917 | o->op_type = (OPCODE)type; |
22c35a8c | 3918 | o->op_ppaddr = PL_ppaddr[type]; |
eb160463 | 3919 | o->op_flags = (U8)flags; |
79072805 | 3920 | |
11343788 | 3921 | o->op_next = o; |
eb160463 | 3922 | o->op_private = (U8)(0 | (flags >> 8)); |
22c35a8c | 3923 | if (PL_opargs[type] & OA_RETSCALAR) |
11343788 | 3924 | scalar(o); |
22c35a8c | 3925 | if (PL_opargs[type] & OA_TARGET) |
11343788 MB |
3926 | o->op_targ = pad_alloc(type, SVs_PADTMP); |
3927 | return CHECKOP(type, o); | |
79072805 LW |
3928 | } |
3929 | ||
d67eb5f4 Z |
3930 | /* |
3931 | =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first | |
3932 | ||
3933 | Constructs, checks, and returns an op of any unary type. I<type> is | |
3934 | the opcode. I<flags> gives the eight bits of C<op_flags>, except that | |
3935 | C<OPf_KIDS> will be set automatically if required, and, shifted up eight | |
3936 | bits, the eight bits of C<op_private>, except that the bit with value 1 | |
3937 | is automatically set. I<first> supplies an optional op to be the direct | |
3938 | child of the unary op; it is consumed by this function and become part | |
3939 | of the constructed op tree. | |
3940 | ||
3941 | =cut | |
3942 | */ | |
3943 | ||
79072805 | 3944 | OP * |
864dbfa3 | 3945 | Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first) |
79072805 | 3946 | { |
27da23d5 | 3947 | dVAR; |
79072805 LW |
3948 | UNOP *unop; |
3949 | ||
7d789282 FC |
3950 | if (type == -OP_ENTEREVAL) { |
3951 | type = OP_ENTEREVAL; | |
3952 | flags |= OPpEVAL_BYTES<<8; | |
3953 | } | |
3954 | ||
e69777c1 GG |
3955 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP |
3956 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP | |
3957 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP | |
3958 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP | |
3959 | || type == OP_SASSIGN | |
32e2a35d | 3960 | || type == OP_ENTERTRY |
e69777c1 GG |
3961 | || type == OP_NULL ); |
3962 | ||
93a17b20 | 3963 | if (!first) |
aeea060c | 3964 | first = newOP(OP_STUB, 0); |
22c35a8c | 3965 | if (PL_opargs[type] & OA_MARK) |
8990e307 | 3966 | first = force_list(first); |
93a17b20 | 3967 | |
b7dc083c | 3968 | NewOp(1101, unop, 1, UNOP); |
eb160463 | 3969 | unop->op_type = (OPCODE)type; |
22c35a8c | 3970 | unop->op_ppaddr = PL_ppaddr[type]; |
79072805 | 3971 | unop->op_first = first; |
585ec06d | 3972 | unop->op_flags = (U8)(flags | OPf_KIDS); |
eb160463 | 3973 | unop->op_private = (U8)(1 | (flags >> 8)); |
e50aee73 | 3974 | unop = (UNOP*) CHECKOP(type, unop); |
79072805 LW |
3975 | if (unop->op_next) |
3976 | return (OP*)unop; | |
3977 | ||
985b9e54 | 3978 | return fold_constants(op_integerize(op_std_init((OP *) unop))); |
79072805 LW |
3979 | } |
3980 | ||
d67eb5f4 Z |
3981 | /* |
3982 | =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last | |
3983 | ||
3984 | Constructs, checks, and returns an op of any binary type. I<type> | |
3985 | is the opcode. I<flags> gives the eight bits of C<op_flags>, except | |
3986 | that C<OPf_KIDS> will be set automatically, and, shifted up eight bits, | |
3987 | the eight bits of C<op_private>, except that the bit with value 1 or | |
3988 | 2 is automatically set as required. I<first> and I<last> supply up to | |
3989 | two ops to be the direct children of the binary op; they are consumed | |
3990 | by this function and become part of the constructed op tree. | |
3991 | ||
3992 | =cut | |
3993 | */ | |
3994 | ||
79072805 | 3995 | OP * |
864dbfa3 | 3996 | Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last) |
79072805 | 3997 | { |
27da23d5 | 3998 | dVAR; |
79072805 | 3999 | BINOP *binop; |
e69777c1 GG |
4000 | |
4001 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP | |
4002 | || type == OP_SASSIGN || type == OP_NULL ); | |
4003 | ||
b7dc083c | 4004 | NewOp(1101, binop, 1, BINOP); |
79072805 LW |
4005 | |
4006 | if (!first) | |
4007 | first = newOP(OP_NULL, 0); | |
4008 | ||
eb160463 | 4009 | binop->op_type = (OPCODE)type; |
22c35a8c | 4010 | binop->op_ppaddr = PL_ppaddr[type]; |
79072805 | 4011 | binop->op_first = first; |
585ec06d | 4012 | binop->op_flags = (U8)(flags | OPf_KIDS); |
79072805 LW |
4013 | if (!last) { |
4014 | last = first; | |
eb160463 | 4015 | binop->op_private = (U8)(1 | (flags >> 8)); |
79072805 LW |
4016 | } |
4017 | else { | |
eb160463 | 4018 | binop->op_private = (U8)(2 | (flags >> 8)); |
79072805 LW |
4019 | first->op_sibling = last; |
4020 | } | |
4021 | ||
e50aee73 | 4022 | binop = (BINOP*)CHECKOP(type, binop); |
eb160463 | 4023 | if (binop->op_next || binop->op_type != (OPCODE)type) |
79072805 LW |
4024 | return (OP*)binop; |
4025 | ||
7284ab6f | 4026 | binop->op_last = binop->op_first->op_sibling; |
79072805 | 4027 | |
985b9e54 | 4028 | return fold_constants(op_integerize(op_std_init((OP *)binop))); |
79072805 LW |
4029 | } |
4030 | ||
5f66b61c AL |
4031 | static int uvcompare(const void *a, const void *b) |
4032 | __attribute__nonnull__(1) | |
4033 | __attribute__nonnull__(2) | |
4034 | __attribute__pure__; | |
abb2c242 | 4035 | static int uvcompare(const void *a, const void *b) |
2b9d42f0 | 4036 | { |
e1ec3a88 | 4037 | if (*((const UV *)a) < (*(const UV *)b)) |
2b9d42f0 | 4038 | return -1; |
e1ec3a88 | 4039 | if (*((const UV *)a) > (*(const UV *)b)) |
2b9d42f0 | 4040 | return 1; |
e1ec3a88 | 4041 | if (*((const UV *)a+1) < (*(const UV *)b+1)) |
2b9d42f0 | 4042 | return -1; |
e1ec3a88 | 4043 | if (*((const UV *)a+1) > (*(const UV *)b+1)) |
2b9d42f0 | 4044 | return 1; |
a0ed51b3 LW |
4045 | return 0; |
4046 | } | |
4047 | ||
0d86688d NC |
4048 | static OP * |
4049 | S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl) | |
79072805 | 4050 | { |
97aff369 | 4051 | dVAR; |
2d03de9c | 4052 | SV * const tstr = ((SVOP*)expr)->op_sv; |
fbbb0949 DM |
4053 | SV * const rstr = |
4054 | #ifdef PERL_MAD | |
4055 | (repl->op_type == OP_NULL) | |
4056 | ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv : | |
4057 | #endif | |
4058 | ((SVOP*)repl)->op_sv; | |
463ee0b2 LW |
4059 | STRLEN tlen; |
4060 | STRLEN rlen; | |
5c144d81 NC |
4061 | const U8 *t = (U8*)SvPV_const(tstr, tlen); |
4062 | const U8 *r = (U8*)SvPV_const(rstr, rlen); | |
eb578fdb KW |
4063 | I32 i; |
4064 | I32 j; | |
9b877dbb | 4065 | I32 grows = 0; |
eb578fdb | 4066 | short *tbl; |
79072805 | 4067 | |
551405c4 AL |
4068 | const I32 complement = o->op_private & OPpTRANS_COMPLEMENT; |
4069 | const I32 squash = o->op_private & OPpTRANS_SQUASH; | |
4070 | I32 del = o->op_private & OPpTRANS_DELETE; | |
043e41b8 | 4071 | SV* swash; |
7918f24d NC |
4072 | |
4073 | PERL_ARGS_ASSERT_PMTRANS; | |
4074 | ||
800b4dc4 | 4075 | PL_hints |= HINT_BLOCK_SCOPE; |
1c846c1f | 4076 | |
036b4402 GS |
4077 | if (SvUTF8(tstr)) |
4078 | o->op_private |= OPpTRANS_FROM_UTF; | |
1c846c1f NIS |
4079 | |
4080 | if (SvUTF8(rstr)) | |
036b4402 | 4081 | o->op_private |= OPpTRANS_TO_UTF; |
79072805 | 4082 | |
a0ed51b3 | 4083 | if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) { |
396482e1 | 4084 | SV* const listsv = newSVpvs("# comment\n"); |
c445ea15 | 4085 | SV* transv = NULL; |
5c144d81 NC |
4086 | const U8* tend = t + tlen; |
4087 | const U8* rend = r + rlen; | |
ba210ebe | 4088 | STRLEN ulen; |
84c133a0 RB |
4089 | UV tfirst = 1; |
4090 | UV tlast = 0; | |
4091 | IV tdiff; | |
4092 | UV rfirst = 1; | |
4093 | UV rlast = 0; | |
4094 | IV rdiff; | |
4095 | IV diff; | |
a0ed51b3 LW |
4096 | I32 none = 0; |
4097 | U32 max = 0; | |
4098 | I32 bits; | |
a0ed51b3 | 4099 | I32 havefinal = 0; |
9c5ffd7c | 4100 | U32 final = 0; |
551405c4 AL |
4101 | const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF; |
4102 | const I32 to_utf = o->op_private & OPpTRANS_TO_UTF; | |
bf4a1e57 JH |
4103 | U8* tsave = NULL; |
4104 | U8* rsave = NULL; | |
9f7f3913 | 4105 | const U32 flags = UTF8_ALLOW_DEFAULT; |
bf4a1e57 JH |
4106 | |
4107 | if (!from_utf) { | |
4108 | STRLEN len = tlen; | |
5c144d81 | 4109 | t = tsave = bytes_to_utf8(t, &len); |
bf4a1e57 JH |
4110 | tend = t + len; |
4111 | } | |
4112 | if (!to_utf && rlen) { | |
4113 | STRLEN len = rlen; | |
5c144d81 | 4114 | r = rsave = bytes_to_utf8(r, &len); |
bf4a1e57 JH |
4115 | rend = r + len; |
4116 | } | |
a0ed51b3 | 4117 | |
2b9d42f0 NIS |
4118 | /* There are several snags with this code on EBCDIC: |
4119 | 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes). | |
4120 | 2. scan_const() in toke.c has encoded chars in native encoding which makes | |
4121 | ranges at least in EBCDIC 0..255 range the bottom odd. | |
4122 | */ | |
4123 | ||
a0ed51b3 | 4124 | if (complement) { |
89ebb4a3 | 4125 | U8 tmpbuf[UTF8_MAXBYTES+1]; |
2b9d42f0 | 4126 | UV *cp; |
a0ed51b3 | 4127 | UV nextmin = 0; |
a02a5408 | 4128 | Newx(cp, 2*tlen, UV); |
a0ed51b3 | 4129 | i = 0; |
396482e1 | 4130 | transv = newSVpvs(""); |
a0ed51b3 | 4131 | while (t < tend) { |
9f7f3913 | 4132 | cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags); |
2b9d42f0 NIS |
4133 | t += ulen; |
4134 | if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { | |
a0ed51b3 | 4135 | t++; |
9f7f3913 | 4136 | cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags); |
2b9d42f0 | 4137 | t += ulen; |
a0ed51b3 | 4138 | } |
2b9d42f0 NIS |
4139 | else { |
4140 | cp[2*i+1] = cp[2*i]; | |
4141 | } | |
4142 | i++; | |
a0ed51b3 | 4143 | } |
2b9d42f0 | 4144 | qsort(cp, i, 2*sizeof(UV), uvcompare); |
a0ed51b3 | 4145 | for (j = 0; j < i; j++) { |
2b9d42f0 | 4146 | UV val = cp[2*j]; |
a0ed51b3 LW |
4147 | diff = val - nextmin; |
4148 | if (diff > 0) { | |
9041c2e3 | 4149 | t = uvuni_to_utf8(tmpbuf,nextmin); |
dfe13c55 | 4150 | sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf); |
a0ed51b3 | 4151 | if (diff > 1) { |
2b9d42f0 | 4152 | U8 range_mark = UTF_TO_NATIVE(0xff); |
9041c2e3 | 4153 | t = uvuni_to_utf8(tmpbuf, val - 1); |
2b9d42f0 | 4154 | sv_catpvn(transv, (char *)&range_mark, 1); |
dfe13c55 | 4155 | sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf); |
a0ed51b3 LW |
4156 | } |
4157 | } | |
2b9d42f0 | 4158 | val = cp[2*j+1]; |
a0ed51b3 LW |
4159 | if (val >= nextmin) |
4160 | nextmin = val + 1; | |
4161 | } | |
9041c2e3 | 4162 | t = uvuni_to_utf8(tmpbuf,nextmin); |
dfe13c55 | 4163 | sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf); |
2b9d42f0 NIS |
4164 | { |
4165 | U8 range_mark = UTF_TO_NATIVE(0xff); | |
4166 | sv_catpvn(transv, (char *)&range_mark, 1); | |
4167 | } | |
6247ead0 | 4168 | t = uvuni_to_utf8(tmpbuf, 0x7fffffff); |
dfe13c55 | 4169 | sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf); |
93524f2b | 4170 | t = (const U8*)SvPVX_const(transv); |
a0ed51b3 LW |
4171 | tlen = SvCUR(transv); |
4172 | tend = t + tlen; | |
455d824a | 4173 | Safefree(cp); |
a0ed51b3 LW |
4174 | } |
4175 | else if (!rlen && !del) { | |
4176 | r = t; rlen = tlen; rend = tend; | |
4757a243 LW |
4177 | } |
4178 | if (!squash) { | |
05d340b8 | 4179 | if ((!rlen && !del) || t == r || |
12ae5dfc | 4180 | (tlen == rlen && memEQ((char *)t, (char *)r, tlen))) |
01ec43d0 | 4181 | { |
4757a243 | 4182 | o->op_private |= OPpTRANS_IDENTICAL; |
01ec43d0 | 4183 | } |
a0ed51b3 LW |
4184 | } |
4185 | ||
4186 | while (t < tend || tfirst <= tlast) { | |
4187 | /* see if we need more "t" chars */ | |
4188 | if (tfirst > tlast) { | |
9f7f3913 | 4189 | tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags); |
a0ed51b3 | 4190 | t += ulen; |
2b9d42f0 | 4191 | if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */ |
ba210ebe | 4192 | t++; |
9f7f3913 | 4193 | tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags); |
a0ed51b3 LW |
4194 | t += ulen; |
4195 | } | |
4196 | else | |
4197 | tlast = tfirst; | |
4198 | } | |
4199 | ||
4200 | /* now see if we need more "r" chars */ | |
4201 | if (rfirst > rlast) { | |
4202 | if (r < rend) { | |
9f7f3913 | 4203 | rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags); |
a0ed51b3 | 4204 | r += ulen; |
2b9d42f0 | 4205 | if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */ |
ba210ebe | 4206 | r++; |
9f7f3913 | 4207 | rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags); |
a0ed51b3 LW |
4208 | r += ulen; |
4209 | } | |
4210 | else | |
4211 | rlast = rfirst; | |
4212 | } | |
4213 | else { | |
4214 | if (!havefinal++) | |
4215 | final = rlast; | |
4216 | rfirst = rlast = 0xffffffff; | |
4217 | } | |
4218 | } | |
4219 | ||
4220 | /* now see which range will peter our first, if either. */ | |
4221 | tdiff = tlast - tfirst; | |
4222 | rdiff = rlast - rfirst; | |
4223 | ||
4224 | if (tdiff <= rdiff) | |
4225 | diff = tdiff; | |
4226 | else | |
4227 | diff = rdiff; | |
4228 | ||
4229 | if (rfirst == 0xffffffff) { | |
4230 | diff = tdiff; /* oops, pretend rdiff is infinite */ | |
4231 | if (diff > 0) | |
894356b3 GS |
4232 | Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n", |
4233 | (long)tfirst, (long)tlast); | |
a0ed51b3 | 4234 | else |
894356b3 | 4235 | Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst); |
a0ed51b3 LW |
4236 | } |
4237 | else { | |
4238 | if (diff > 0) | |
894356b3 GS |
4239 | Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n", |
4240 | (long)tfirst, (long)(tfirst + diff), | |
4241 | (long)rfirst); | |
a0ed51b3 | 4242 | else |
894356b3 GS |
4243 | Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n", |
4244 | (long)tfirst, (long)rfirst); | |
a0ed51b3 LW |
4245 | |
4246 | if (rfirst + diff > max) | |
4247 | max = rfirst + diff; | |
9b877dbb | 4248 | if (!grows) |
45005bfb JH |
4249 | grows = (tfirst < rfirst && |
4250 | UNISKIP(tfirst) < UNISKIP(rfirst + diff)); | |
4251 | rfirst += diff + 1; | |
a0ed51b3 LW |
4252 | } |
4253 | tfirst += diff + 1; | |
4254 | } | |
4255 | ||
4256 | none = ++max; | |
4257 | if (del) | |
4258 | del = ++max; | |
4259 | ||
4260 | if (max > 0xffff) | |
4261 | bits = 32; | |
4262 | else if (max > 0xff) | |
4263 | bits = 16; | |
4264 | else | |
4265 | bits = 8; | |
4266 | ||
ad64d0ec | 4267 | swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none)); |
043e41b8 DM |
4268 | #ifdef USE_ITHREADS |
4269 | cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP); | |
4270 | SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix)); | |
4271 | PAD_SETSV(cPADOPo->op_padix, swash); | |
4272 | SvPADTMP_on(swash); | |
a5446a64 | 4273 | SvREADONLY_on(swash); |
043e41b8 DM |
4274 | #else |
4275 | cSVOPo->op_sv = swash; | |
4276 | #endif | |
a0ed51b3 | 4277 | SvREFCNT_dec(listsv); |
b37c2d43 | 4278 | SvREFCNT_dec(transv); |
a0ed51b3 | 4279 | |
45005bfb | 4280 | if (!del && havefinal && rlen) |
85fbaab2 | 4281 | (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5, |
b448e4fe | 4282 | newSVuv((UV)final), 0); |
a0ed51b3 | 4283 | |
9b877dbb | 4284 | if (grows) |
a0ed51b3 LW |
4285 | o->op_private |= OPpTRANS_GROWS; |
4286 | ||
b37c2d43 AL |
4287 | Safefree(tsave); |
4288 | Safefree(rsave); | |
9b877dbb | 4289 | |
eb8433b7 NC |
4290 | #ifdef PERL_MAD |
4291 | op_getmad(expr,o,'e'); | |
4292 | op_getmad(repl,o,'r'); | |
4293 | #else | |
a0ed51b3 LW |
4294 | op_free(expr); |
4295 | op_free(repl); | |
eb8433b7 | 4296 | #endif |
a0ed51b3 LW |
4297 | return o; |
4298 | } | |
4299 | ||
9100eeb1 Z |
4300 | tbl = (short*)PerlMemShared_calloc( |
4301 | (o->op_private & OPpTRANS_COMPLEMENT) && | |
4302 | !(o->op_private & OPpTRANS_DELETE) ? 258 : 256, | |
4303 | sizeof(short)); | |
4304 | cPVOPo->op_pv = (char*)tbl; | |
79072805 | 4305 | if (complement) { |
eb160463 | 4306 | for (i = 0; i < (I32)tlen; i++) |
ec49126f | 4307 | tbl[t[i]] = -1; |
79072805 LW |
4308 | for (i = 0, j = 0; i < 256; i++) { |
4309 | if (!tbl[i]) { | |
eb160463 | 4310 | if (j >= (I32)rlen) { |
a0ed51b3 | 4311 | if (del) |
79072805 LW |
4312 | tbl[i] = -2; |
4313 | else if (rlen) | |
ec49126f | 4314 | tbl[i] = r[j-1]; |
79072805 | 4315 | else |
eb160463 | 4316 | tbl[i] = (short)i; |
79072805 | 4317 | } |
9b877dbb IH |
4318 | else { |
4319 | if (i < 128 && r[j] >= 128) | |
4320 | grows = 1; | |
ec49126f | 4321 | tbl[i] = r[j++]; |
9b877dbb | 4322 | } |
79072805 LW |
4323 | } |
4324 | } | |
05d340b8 JH |
4325 | if (!del) { |
4326 | if (!rlen) { | |
4327 | j = rlen; | |
4328 | if (!squash) | |
4329 | o->op_private |= OPpTRANS_IDENTICAL; | |
4330 | } | |
eb160463 | 4331 | else if (j >= (I32)rlen) |
05d340b8 | 4332 | j = rlen - 1; |
10db182f | 4333 | else { |
aa1f7c5b JH |
4334 | tbl = |
4335 | (short *) | |
4336 | PerlMemShared_realloc(tbl, | |
4337 | (0x101+rlen-j) * sizeof(short)); | |
10db182f YO |
4338 | cPVOPo->op_pv = (char*)tbl; |
4339 | } | |
585ec06d | 4340 | tbl[0x100] = (short)(rlen - j); |
eb160463 | 4341 | for (i=0; i < (I32)rlen - j; i++) |
8973db79 JH |
4342 | tbl[0x101+i] = r[j+i]; |
4343 | } | |
79072805 LW |
4344 | } |
4345 | else { | |
a0ed51b3 | 4346 | if (!rlen && !del) { |
79072805 | 4347 | r = t; rlen = tlen; |
5d06d08e | 4348 | if (!squash) |
4757a243 | 4349 | o->op_private |= OPpTRANS_IDENTICAL; |
79072805 | 4350 | } |
94bfe852 RGS |
4351 | else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) { |
4352 | o->op_private |= OPpTRANS_IDENTICAL; | |
4353 | } | |
79072805 LW |
4354 | for (i = 0; i < 256; i++) |
4355 | tbl[i] = -1; | |
eb160463 GS |
4356 | for (i = 0, j = 0; i < (I32)tlen; i++,j++) { |
4357 | if (j >= (I32)rlen) { | |
a0ed51b3 | 4358 | if (del) { |
ec49126f | 4359 | if (tbl[t[i]] == -1) |
4360 | tbl[t[i]] = -2; | |
79072805 LW |
4361 | continue; |
4362 | } | |
4363 | --j; | |
4364 | } | |
9b877dbb IH |
4365 | if (tbl[t[i]] == -1) { |
4366 | if (t[i] < 128 && r[j] >= 128) | |
4367 | grows = 1; | |
ec49126f | 4368 | tbl[t[i]] = r[j]; |
9b877dbb | 4369 | } |
79072805 LW |
4370 | } |
4371 | } | |
b08e453b | 4372 | |
a2a5de95 NC |
4373 | if(del && rlen == tlen) { |
4374 | Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator"); | |
b8c388a9 | 4375 | } else if(rlen > tlen && !complement) { |
a2a5de95 | 4376 | Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list"); |
b08e453b RB |
4377 | } |
4378 | ||
9b877dbb IH |
4379 | if (grows) |
4380 | o->op_private |= OPpTRANS_GROWS; | |
eb8433b7 NC |
4381 | #ifdef PERL_MAD |
4382 | op_getmad(expr,o,'e'); | |
4383 | op_getmad(repl,o,'r'); | |
4384 | #else | |
79072805 LW |
4385 | op_free(expr); |
4386 | op_free(repl); | |
eb8433b7 | 4387 | #endif |
79072805 | 4388 | |
11343788 | 4389 | return o; |
79072805 LW |
4390 | } |
4391 | ||
d67eb5f4 Z |
4392 | /* |
4393 | =for apidoc Am|OP *|newPMOP|I32 type|I32 flags | |
4394 | ||
4395 | Constructs, checks, and returns an op of any pattern matching type. | |
4396 | I<type> is the opcode. I<flags> gives the eight bits of C<op_flags> | |
4397 | and, shifted up eight bits, the eight bits of C<op_private>. | |
4398 | ||
4399 | =cut | |
4400 | */ | |
4401 | ||
79072805 | 4402 | OP * |
864dbfa3 | 4403 | Perl_newPMOP(pTHX_ I32 type, I32 flags) |
79072805 | 4404 | { |
27da23d5 | 4405 | dVAR; |
79072805 LW |
4406 | PMOP *pmop; |
4407 | ||
e69777c1 GG |
4408 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP); |
4409 | ||
b7dc083c | 4410 | NewOp(1101, pmop, 1, PMOP); |
eb160463 | 4411 | pmop->op_type = (OPCODE)type; |
22c35a8c | 4412 | pmop->op_ppaddr = PL_ppaddr[type]; |
eb160463 GS |
4413 | pmop->op_flags = (U8)flags; |
4414 | pmop->op_private = (U8)(0 | (flags >> 8)); | |
79072805 | 4415 | |
3280af22 | 4416 | if (PL_hints & HINT_RE_TAINT) |
c737faaf | 4417 | pmop->op_pmflags |= PMf_RETAINT; |
82ad65bb | 4418 | if (IN_LOCALE_COMPILETIME) { |
a62b1201 | 4419 | set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET); |
9de15fec | 4420 | } |
66cbab2c KW |
4421 | else if ((! (PL_hints & HINT_BYTES)) |
4422 | /* Both UNI_8_BIT and locale :not_characters imply Unicode */ | |
4423 | && (PL_hints & (HINT_UNI_8_BIT|HINT_LOCALE_NOT_CHARS))) | |
4424 | { | |
a62b1201 | 4425 | set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET); |
9de15fec | 4426 | } |
1e215989 | 4427 | if (PL_hints & HINT_RE_FLAGS) { |
20439bc7 Z |
4428 | SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_ |
4429 | PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0 | |
1e215989 FC |
4430 | ); |
4431 | if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags); | |
20439bc7 | 4432 | reflags = Perl_refcounted_he_fetch_pvn(aTHX_ |
6320bfaf | 4433 | PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0 |
1e215989 FC |
4434 | ); |
4435 | if (reflags && SvOK(reflags)) { | |
dabded94 | 4436 | set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags)); |
1e215989 FC |
4437 | } |
4438 | } | |
c737faaf | 4439 | |
36477c24 | 4440 | |
debc9467 | 4441 | #ifdef USE_ITHREADS |
402d2eb1 NC |
4442 | assert(SvPOK(PL_regex_pad[0])); |
4443 | if (SvCUR(PL_regex_pad[0])) { | |
4444 | /* Pop off the "packed" IV from the end. */ | |
4445 | SV *const repointer_list = PL_regex_pad[0]; | |
4446 | const char *p = SvEND(repointer_list) - sizeof(IV); | |
4447 | const IV offset = *((IV*)p); | |
4448 | ||
4449 | assert(SvCUR(repointer_list) % sizeof(IV) == 0); | |
4450 | ||
4451 | SvEND_set(repointer_list, p); | |
4452 | ||
110f3028 | 4453 | pmop->op_pmoffset = offset; |
14a49a24 NC |
4454 | /* This slot should be free, so assert this: */ |
4455 | assert(PL_regex_pad[offset] == &PL_sv_undef); | |
551405c4 | 4456 | } else { |
14a49a24 | 4457 | SV * const repointer = &PL_sv_undef; |
9a8b6709 | 4458 | av_push(PL_regex_padav, repointer); |
551405c4 AL |
4459 | pmop->op_pmoffset = av_len(PL_regex_padav); |
4460 | PL_regex_pad = AvARRAY(PL_regex_padav); | |
13137afc | 4461 | } |
debc9467 | 4462 | #endif |
1eb1540c | 4463 | |
463d09e6 | 4464 | return CHECKOP(type, pmop); |
79072805 LW |
4465 | } |
4466 | ||
131b3ad0 DM |
4467 | /* Given some sort of match op o, and an expression expr containing a |
4468 | * pattern, either compile expr into a regex and attach it to o (if it's | |
4469 | * constant), or convert expr into a runtime regcomp op sequence (if it's | |
4470 | * not) | |
4471 | * | |
4472 | * isreg indicates that the pattern is part of a regex construct, eg | |
4473 | * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or | |
4474 | * split "pattern", which aren't. In the former case, expr will be a list | |
4475 | * if the pattern contains more than one term (eg /a$b/) or if it contains | |
4476 | * a replacement, ie s/// or tr///. | |
d63c20f2 DM |
4477 | * |
4478 | * When the pattern has been compiled within a new anon CV (for | |
4479 | * qr/(?{...})/ ), then floor indicates the savestack level just before | |
4480 | * the new sub was created | |
131b3ad0 DM |
4481 | */ |
4482 | ||
79072805 | 4483 | OP * |
d63c20f2 | 4484 | Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg, I32 floor) |
79072805 | 4485 | { |
27da23d5 | 4486 | dVAR; |
79072805 LW |
4487 | PMOP *pm; |
4488 | LOGOP *rcop; | |
ce862d02 | 4489 | I32 repl_has_vars = 0; |
5f66b61c | 4490 | OP* repl = NULL; |
74529a43 DM |
4491 | bool is_trans = (o->op_type == OP_TRANS || o->op_type == OP_TRANSR); |
4492 | bool is_compiletime; | |
4493 | bool has_code; | |
131b3ad0 | 4494 | |
7918f24d NC |
4495 | PERL_ARGS_ASSERT_PMRUNTIME; |
4496 | ||
74529a43 DM |
4497 | /* for s/// and tr///, last element in list is the replacement; pop it */ |
4498 | ||
4499 | if (is_trans || o->op_type == OP_SUBST) { | |
131b3ad0 DM |
4500 | OP* kid; |
4501 | repl = cLISTOPx(expr)->op_last; | |
4502 | kid = cLISTOPx(expr)->op_first; | |
4503 | while (kid->op_sibling != repl) | |
4504 | kid = kid->op_sibling; | |
5f66b61c | 4505 | kid->op_sibling = NULL; |
131b3ad0 DM |
4506 | cLISTOPx(expr)->op_last = kid; |
4507 | } | |
79072805 | 4508 | |
74529a43 DM |
4509 | /* for TRANS, convert LIST/PUSH/CONST into CONST, and pass to pmtrans() */ |
4510 | ||
4511 | if (is_trans) { | |
4512 | OP* const oe = expr; | |
4513 | assert(expr->op_type == OP_LIST); | |
4514 | assert(cLISTOPx(expr)->op_first->op_type == OP_PUSHMARK); | |
4515 | assert(cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last); | |
4516 | expr = cLISTOPx(oe)->op_last; | |
4517 | cLISTOPx(oe)->op_first->op_sibling = NULL; | |
4518 | cLISTOPx(oe)->op_last = NULL; | |
4519 | op_free(oe); | |
4520 | ||
4521 | return pmtrans(o, expr, repl); | |
4522 | } | |
4523 | ||
8a45afe5 DM |
4524 | /* find whether we have any runtime or code elements; |
4525 | * at the same time, temporarily set the op_next of each DO block; | |
4526 | * then when we LINKLIST, this will cause the DO blocks to be excluded | |
4527 | * from the op_next chain (and from having LINKLIST recursively | |
4528 | * applied to them). We fix up the DOs specially later */ | |
74529a43 DM |
4529 | |
4530 | is_compiletime = 1; | |
4531 | has_code = 0; | |
4532 | if (expr->op_type == OP_LIST) { | |
4533 | OP *o; | |
4534 | for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) { | |
8a45afe5 | 4535 | if (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)) { |
74529a43 | 4536 | has_code = 1; |
8a45afe5 DM |
4537 | assert(!o->op_next && o->op_sibling); |
4538 | o->op_next = o->op_sibling; | |
4539 | } | |
74529a43 DM |
4540 | else if (o->op_type != OP_CONST && o->op_type != OP_PUSHMARK) |
4541 | is_compiletime = 0; | |
4542 | } | |
4543 | } | |
68e2671b | 4544 | else if (expr->op_type != OP_CONST) |
74529a43 | 4545 | is_compiletime = 0; |
74529a43 | 4546 | |
8a45afe5 DM |
4547 | LINKLIST(expr); |
4548 | ||
491453ba DM |
4549 | /* fix up DO blocks; treat each one as a separate little sub; |
4550 | * also, mark any arrays as LIST/REF */ | |
74529a43 | 4551 | |
68e2671b | 4552 | if (expr->op_type == OP_LIST) { |
8a45afe5 DM |
4553 | OP *o; |
4554 | for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) { | |
491453ba DM |
4555 | |
4556 | if (o->op_type == OP_PADAV || o->op_type == OP_RV2AV) { | |
4557 | assert( !(o->op_flags & OPf_WANT)); | |
4558 | /* push the array rather than its contents. The regex | |
4559 | * engine will retrieve and join the elements later */ | |
4560 | o->op_flags |= (OPf_WANT_LIST | OPf_REF); | |
4561 | continue; | |
4562 | } | |
4563 | ||
8a45afe5 DM |
4564 | if (!(o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL))) |
4565 | continue; | |
4566 | o->op_next = NULL; /* undo temporary hack from above */ | |
4567 | scalar(o); | |
4568 | LINKLIST(o); | |
4569 | if (cLISTOPo->op_first->op_type == OP_LEAVE) { | |
106d2451 | 4570 | LISTOP *leaveop = cLISTOPx(cLISTOPo->op_first); |
8a45afe5 | 4571 | /* skip ENTER */ |
106d2451 DM |
4572 | assert(leaveop->op_first->op_type == OP_ENTER); |
4573 | assert(leaveop->op_first->op_sibling); | |
4574 | o->op_next = leaveop->op_first->op_sibling; | |
4575 | /* skip leave */ | |
4576 | assert(leaveop->op_flags & OPf_KIDS); | |
35431808 | 4577 | assert(leaveop->op_last->op_next == (OP*)leaveop); |
106d2451 DM |
4578 | leaveop->op_next = NULL; /* stop on last op */ |
4579 | op_null((OP*)leaveop); | |
9da1dd8f | 4580 | } |
8a45afe5 DM |
4581 | else { |
4582 | /* skip SCOPE */ | |
4583 | OP *scope = cLISTOPo->op_first; | |
4584 | assert(scope->op_type == OP_SCOPE); | |
4585 | assert(scope->op_flags & OPf_KIDS); | |
4586 | scope->op_next = NULL; /* stop on last op */ | |
4587 | op_null(scope); | |
9da1dd8f | 4588 | } |
8a45afe5 DM |
4589 | /* have to peep the DOs individually as we've removed it from |
4590 | * the op_next chain */ | |
4591 | CALL_PEEP(o); | |
4592 | if (is_compiletime) | |
4593 | /* runtime finalizes as part of finalizing whole tree */ | |
4594 | finalize_optree(o); | |
9da1dd8f | 4595 | } |
9da1dd8f | 4596 | } |
491453ba DM |
4597 | else if (expr->op_type == OP_PADAV || expr->op_type == OP_RV2AV) { |
4598 | assert( !(expr->op_flags & OPf_WANT)); | |
4599 | /* push the array rather than its contents. The regex | |
4600 | * engine will retrieve and join the elements later */ | |
4601 | expr->op_flags |= (OPf_WANT_LIST | OPf_REF); | |
4602 | } | |
9da1dd8f | 4603 | |
3280af22 | 4604 | PL_hints |= HINT_BLOCK_SCOPE; |
11343788 | 4605 | pm = (PMOP*)o; |
d63c20f2 | 4606 | assert(floor==0 || (pm->op_pmflags & PMf_HAS_CV)); |
79072805 | 4607 | |
74529a43 | 4608 | if (is_compiletime) { |
514a91f1 | 4609 | U32 rx_flags = pm->op_pmflags & RXf_PMf_COMPILETIME; |
3c13cae6 | 4610 | regexp_engine const *eng = current_re_engine(); |
5c144d81 | 4611 | |
dbc200c5 YO |
4612 | if (o->op_flags & OPf_SPECIAL) |
4613 | rx_flags |= RXf_SPLIT; | |
4614 | ||
3c13cae6 | 4615 | if (!has_code || !eng->op_comp) { |
d63c20f2 | 4616 | /* compile-time simple constant pattern */ |
d63c20f2 DM |
4617 | |
4618 | if ((pm->op_pmflags & PMf_HAS_CV) && !has_code) { | |
4619 | /* whoops! we guessed that a qr// had a code block, but we | |
4620 | * were wrong (e.g. /[(?{}]/ ). Throw away the PL_compcv | |
4621 | * that isn't required now. Note that we have to be pretty | |
4622 | * confident that nothing used that CV's pad while the | |
4623 | * regex was parsed */ | |
4624 | assert(AvFILLp(PL_comppad) == 0); /* just @_ */ | |
8be227ab FC |
4625 | /* But we know that one op is using this CV's slab. */ |
4626 | cv_forget_slab(PL_compcv); | |
d63c20f2 DM |
4627 | LEAVE_SCOPE(floor); |
4628 | pm->op_pmflags &= ~PMf_HAS_CV; | |
4629 | } | |
4630 | ||
e485beb8 DM |
4631 | PM_SETRE(pm, |
4632 | eng->op_comp | |
4633 | ? eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL, | |
4634 | rx_flags, pm->op_pmflags) | |
4635 | : Perl_re_op_compile(aTHX_ NULL, 0, expr, eng, NULL, NULL, | |
4636 | rx_flags, pm->op_pmflags) | |
4637 | ); | |
eb8433b7 | 4638 | #ifdef PERL_MAD |
68e2671b | 4639 | op_getmad(expr,(OP*)pm,'e'); |
eb8433b7 | 4640 | #else |
68e2671b | 4641 | op_free(expr); |
eb8433b7 | 4642 | #endif |
68e2671b DM |
4643 | } |
4644 | else { | |
d63c20f2 | 4645 | /* compile-time pattern that includes literal code blocks */ |
3c13cae6 | 4646 | REGEXP* re = eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL, |
732caac7 DM |
4647 | rx_flags, |
4648 | (pm->op_pmflags | | |
4649 | ((PL_hints & HINT_RE_EVAL) ? PMf_USE_RE_EVAL : 0)) | |
4650 | ); | |
d63c20f2 DM |
4651 | PM_SETRE(pm, re); |
4652 | if (pm->op_pmflags & PMf_HAS_CV) { | |
4653 | CV *cv; | |
4654 | /* this QR op (and the anon sub we embed it in) is never | |
4655 | * actually executed. It's just a placeholder where we can | |
4656 | * squirrel away expr in op_code_list without the peephole | |
4657 | * optimiser etc processing it for a second time */ | |
4658 | OP *qr = newPMOP(OP_QR, 0); | |
4659 | ((PMOP*)qr)->op_code_list = expr; | |
4660 | ||
4661 | /* handle the implicit sub{} wrapped round the qr/(?{..})/ */ | |
4662 | SvREFCNT_inc_simple_void(PL_compcv); | |
4663 | cv = newATTRSUB(floor, 0, NULL, NULL, qr); | |
8d919b0a | 4664 | ReANY(re)->qr_anoncv = cv; |
d63c20f2 DM |
4665 | |
4666 | /* attach the anon CV to the pad so that | |
4667 | * pad_fixup_inner_anons() can find it */ | |
4d2dfd15 | 4668 | (void)pad_add_anon(cv, o->op_type); |
d63c20f2 DM |
4669 | SvREFCNT_inc_simple_void(cv); |
4670 | } | |
4671 | else { | |
4672 | pm->op_code_list = expr; | |
4673 | } | |
68e2671b | 4674 | } |
79072805 LW |
4675 | } |
4676 | else { | |
d63c20f2 | 4677 | /* runtime pattern: build chain of regcomp etc ops */ |
74529a43 | 4678 | bool reglist; |
346d3070 | 4679 | PADOFFSET cv_targ = 0; |
74529a43 DM |
4680 | |
4681 | reglist = isreg && expr->op_type == OP_LIST; | |
4682 | if (reglist) | |
4683 | op_null(expr); | |
4684 | ||
867940b8 DM |
4685 | if (has_code) { |
4686 | pm->op_code_list = expr; | |
4687 | /* don't free op_code_list; its ops are embedded elsewhere too */ | |
4688 | pm->op_pmflags |= PMf_CODELIST_PRIVATE; | |
4689 | } | |
4690 | ||
dbc200c5 YO |
4691 | if (o->op_flags & OPf_SPECIAL) |
4692 | pm->op_pmflags |= PMf_SPLIT; | |
4693 | ||
7fb31b92 DM |
4694 | /* the OP_REGCMAYBE is a placeholder in the non-threaded case |
4695 | * to allow its op_next to be pointed past the regcomp and | |
4696 | * preceding stacking ops; | |
4697 | * OP_REGCRESET is there to reset taint before executing the | |
4698 | * stacking ops */ | |
284167a5 S |
4699 | if (pm->op_pmflags & PMf_KEEP || TAINTING_get) |
4700 | expr = newUNOP((TAINTING_get ? OP_REGCRESET : OP_REGCMAYBE),0,expr); | |
463ee0b2 | 4701 | |
d63c20f2 DM |
4702 | if (pm->op_pmflags & PMf_HAS_CV) { |
4703 | /* we have a runtime qr with literal code. This means | |
4704 | * that the qr// has been wrapped in a new CV, which | |
4705 | * means that runtime consts, vars etc will have been compiled | |
4706 | * against a new pad. So... we need to execute those ops | |
4707 | * within the environment of the new CV. So wrap them in a call | |
4708 | * to a new anon sub. i.e. for | |
4709 | * | |
4710 | * qr/a$b(?{...})/, | |
4711 | * | |
4712 | * we build an anon sub that looks like | |
4713 | * | |
4714 | * sub { "a", $b, '(?{...})' } | |
4715 | * | |
4716 | * and call it, passing the returned list to regcomp. | |
4717 | * Or to put it another way, the list of ops that get executed | |
4718 | * are: | |
4719 | * | |
4720 | * normal PMf_HAS_CV | |
4721 | * ------ ------------------- | |
4722 | * pushmark (for regcomp) | |
4723 | * pushmark (for entersub) | |
4724 | * pushmark (for refgen) | |
4725 | * anoncode | |
4726 | * refgen | |
4727 | * entersub | |
4728 | * regcreset regcreset | |
4729 | * pushmark pushmark | |
4730 | * const("a") const("a") | |
4731 | * gvsv(b) gvsv(b) | |
4732 | * const("(?{...})") const("(?{...})") | |
4733 | * leavesub | |
4734 | * regcomp regcomp | |
4735 | */ | |
4736 | ||
4737 | SvREFCNT_inc_simple_void(PL_compcv); | |
346d3070 DM |
4738 | /* these lines are just an unrolled newANONATTRSUB */ |
4739 | expr = newSVOP(OP_ANONCODE, 0, | |
4740 | MUTABLE_SV(newATTRSUB(floor, 0, NULL, NULL, expr))); | |
4741 | cv_targ = expr->op_targ; | |
4742 | expr = newUNOP(OP_REFGEN, 0, expr); | |
4743 | ||
4744 | expr = list(force_list(newUNOP(OP_ENTERSUB, 0, scalar(expr)))); | |
d63c20f2 DM |
4745 | } |
4746 | ||
b7dc083c | 4747 | NewOp(1101, rcop, 1, LOGOP); |
79072805 | 4748 | rcop->op_type = OP_REGCOMP; |
22c35a8c | 4749 | rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP]; |
79072805 | 4750 | rcop->op_first = scalar(expr); |
131b3ad0 DM |
4751 | rcop->op_flags |= OPf_KIDS |
4752 | | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0) | |
4753 | | (reglist ? OPf_STACKED : 0); | |
188c1910 | 4754 | rcop->op_private = 0; |
11343788 | 4755 | rcop->op_other = o; |
346d3070 | 4756 | rcop->op_targ = cv_targ; |
131b3ad0 | 4757 | |
b5c19bd7 | 4758 | /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */ |
ec192197 | 4759 | if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1; |
79072805 LW |
4760 | |
4761 | /* establish postfix order */ | |
d63c20f2 | 4762 | if (expr->op_type == OP_REGCRESET || expr->op_type == OP_REGCMAYBE) { |
463ee0b2 LW |
4763 | LINKLIST(expr); |
4764 | rcop->op_next = expr; | |
4765 | ((UNOP*)expr)->op_first->op_next = (OP*)rcop; | |
4766 | } | |
4767 | else { | |
4768 | rcop->op_next = LINKLIST(expr); | |
4769 | expr->op_next = (OP*)rcop; | |
4770 | } | |
79072805 | 4771 | |
2fcb4757 | 4772 | op_prepend_elem(o->op_type, scalar((OP*)rcop), o); |
79072805 LW |
4773 | } |
4774 | ||
4775 | if (repl) { | |
ef90d20a | 4776 | OP *curop = repl; |
bb933b9b | 4777 | bool konst; |
0244c3a4 | 4778 | if (pm->op_pmflags & PMf_EVAL) { |
670a9cb2 DM |
4779 | if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end) |
4780 | CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end); | |
0244c3a4 | 4781 | } |
ef90d20a FC |
4782 | /* If we are looking at s//.../e with a single statement, get past |
4783 | the implicit do{}. */ | |
4784 | if (curop->op_type == OP_NULL && curop->op_flags & OPf_KIDS | |
4785 | && cUNOPx(curop)->op_first->op_type == OP_SCOPE | |
4786 | && cUNOPx(curop)->op_first->op_flags & OPf_KIDS) { | |
4787 | OP *kid = cUNOPx(cUNOPx(curop)->op_first)->op_first; | |
4788 | if (kid->op_type == OP_NULL && kid->op_sibling | |
4789 | && !kid->op_sibling->op_sibling) | |
4790 | curop = kid->op_sibling; | |
4791 | } | |
4792 | if (curop->op_type == OP_CONST) | |
bb933b9b | 4793 | konst = TRUE; |
ef90d20a FC |
4794 | else if (( (curop->op_type == OP_RV2SV || |
4795 | curop->op_type == OP_RV2AV || | |
4796 | curop->op_type == OP_RV2HV || | |
4797 | curop->op_type == OP_RV2GV) | |
4798 | && cUNOPx(curop)->op_first | |
4799 | && cUNOPx(curop)->op_first->op_type == OP_GV ) | |
4800 | || curop->op_type == OP_PADSV | |
4801 | || curop->op_type == OP_PADAV | |
4802 | || curop->op_type == OP_PADHV | |
4803 | || curop->op_type == OP_PADANY) { | |
bb933b9b FC |
4804 | repl_has_vars = 1; |
4805 | konst = TRUE; | |
748a9306 | 4806 | } |
bb933b9b FC |
4807 | else konst = FALSE; |
4808 | if (konst | |
e80b829c RGS |
4809 | && !(repl_has_vars |
4810 | && (!PM_GETRE(pm) | |
b97b7b69 | 4811 | || !RX_PRELEN(PM_GETRE(pm)) |
07bc277f | 4812 | || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN))) |
3be69782 | 4813 | { |
748a9306 | 4814 | pm->op_pmflags |= PMf_CONST; /* const for long enough */ |
2fcb4757 | 4815 | op_prepend_elem(o->op_type, scalar(repl), o); |
748a9306 LW |
4816 | } |
4817 | else { | |
b7dc083c | 4818 | NewOp(1101, rcop, 1, LOGOP); |
748a9306 | 4819 | rcop->op_type = OP_SUBSTCONT; |
22c35a8c | 4820 | rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT]; |
748a9306 LW |
4821 | rcop->op_first = scalar(repl); |
4822 | rcop->op_flags |= OPf_KIDS; | |
4823 | rcop->op_private = 1; | |
11343788 | 4824 | rcop->op_other = o; |
748a9306 LW |
4825 | |
4826 | /* establish postfix order */ | |
4827 | rcop->op_next = LINKLIST(repl); | |
4828 | repl->op_next = (OP*)rcop; | |
4829 | ||
20e98b0f | 4830 | pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop); |
29f2e912 NC |
4831 | assert(!(pm->op_pmflags & PMf_ONCE)); |
4832 | pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop); | |
748a9306 | 4833 | rcop->op_next = 0; |
79072805 LW |
4834 | } |
4835 | } | |
4836 | ||
4837 | return (OP*)pm; | |
4838 | } | |
4839 | ||
d67eb5f4 Z |
4840 | /* |
4841 | =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv | |
4842 | ||
4843 | Constructs, checks, and returns an op of any type that involves an | |
4844 | embedded SV. I<type> is the opcode. I<flags> gives the eight bits | |
4845 | of C<op_flags>. I<sv> gives the SV to embed in the op; this function | |
4846 | takes ownership of one reference to it. | |
4847 | ||
4848 | =cut | |
4849 | */ | |
4850 | ||
79072805 | 4851 | OP * |
864dbfa3 | 4852 | Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv) |
79072805 | 4853 | { |
27da23d5 | 4854 | dVAR; |
79072805 | 4855 | SVOP *svop; |
7918f24d NC |
4856 | |
4857 | PERL_ARGS_ASSERT_NEWSVOP; | |
4858 | ||
e69777c1 GG |
4859 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP |
4860 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP | |
4861 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP); | |
4862 | ||
b7dc083c | 4863 | NewOp(1101, svop, 1, SVOP); |
eb160463 | 4864 | svop->op_type = (OPCODE)type; |
22c35a8c | 4865 | svop->op_ppaddr = PL_ppaddr[type]; |
79072805 LW |
4866 | svop->op_sv = sv; |
4867 | svop->op_next = (OP*)svop; | |
eb160463 | 4868 | svop->op_flags = (U8)flags; |
cc2ebcd7 | 4869 | svop->op_private = (U8)(0 | (flags >> 8)); |
22c35a8c | 4870 | if (PL_opargs[type] & OA_RETSCALAR) |
463ee0b2 | 4871 | scalar((OP*)svop); |
22c35a8c | 4872 | if (PL_opargs[type] & OA_TARGET) |
ed6116ce | 4873 | svop->op_targ = pad_alloc(type, SVs_PADTMP); |
e50aee73 | 4874 | return CHECKOP(type, svop); |
79072805 LW |
4875 | } |
4876 | ||
392d04bb | 4877 | #ifdef USE_ITHREADS |
d67eb5f4 Z |
4878 | |
4879 | /* | |
4880 | =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv | |
4881 | ||
4882 | Constructs, checks, and returns an op of any type that involves a | |
4883 | reference to a pad element. I<type> is the opcode. I<flags> gives the | |
4884 | eight bits of C<op_flags>. A pad slot is automatically allocated, and | |
4885 | is populated with I<sv>; this function takes ownership of one reference | |
4886 | to it. | |
4887 | ||
4888 | This function only exists if Perl has been compiled to use ithreads. | |
4889 | ||
4890 | =cut | |
4891 | */ | |
4892 | ||
79072805 | 4893 | OP * |
350de78d GS |
4894 | Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv) |
4895 | { | |
27da23d5 | 4896 | dVAR; |
350de78d | 4897 | PADOP *padop; |
7918f24d NC |
4898 | |
4899 | PERL_ARGS_ASSERT_NEWPADOP; | |
4900 | ||
e69777c1 GG |
4901 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP |
4902 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP | |
4903 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP); | |
4904 | ||
350de78d | 4905 | NewOp(1101, padop, 1, PADOP); |
eb160463 | 4906 | padop->op_type = (OPCODE)type; |
350de78d GS |
4907 | padop->op_ppaddr = PL_ppaddr[type]; |
4908 | padop->op_padix = pad_alloc(type, SVs_PADTMP); | |
dd2155a4 DM |
4909 | SvREFCNT_dec(PAD_SVl(padop->op_padix)); |
4910 | PAD_SETSV(padop->op_padix, sv); | |
58182927 NC |
4911 | assert(sv); |
4912 | SvPADTMP_on(sv); | |
350de78d | 4913 | padop->op_next = (OP*)padop; |
eb160463 | 4914 | padop->op_flags = (U8)flags; |
350de78d GS |
4915 | if (PL_opargs[type] & OA_RETSCALAR) |
4916 | scalar((OP*)padop); | |
4917 | if (PL_opargs[type] & OA_TARGET) | |
4918 | padop->op_targ = pad_alloc(type, SVs_PADTMP); | |
4919 | return CHECKOP(type, padop); | |
4920 | } | |
d67eb5f4 Z |
4921 | |
4922 | #endif /* !USE_ITHREADS */ | |
4923 | ||
4924 | /* | |
4925 | =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv | |
4926 | ||
4927 | Constructs, checks, and returns an op of any type that involves an | |
4928 | embedded reference to a GV. I<type> is the opcode. I<flags> gives the | |
4929 | eight bits of C<op_flags>. I<gv> identifies the GV that the op should | |
4930 | reference; calling this function does not transfer ownership of any | |
4931 | reference to it. | |
4932 | ||
4933 | =cut | |
4934 | */ | |
350de78d GS |
4935 | |
4936 | OP * | |
864dbfa3 | 4937 | Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv) |
79072805 | 4938 | { |
27da23d5 | 4939 | dVAR; |
7918f24d NC |
4940 | |
4941 | PERL_ARGS_ASSERT_NEWGVOP; | |
4942 | ||
350de78d | 4943 | #ifdef USE_ITHREADS |
58182927 | 4944 | GvIN_PAD_on(gv); |
ff8997d7 | 4945 | return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv)); |
350de78d | 4946 | #else |
ff8997d7 | 4947 | return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv)); |
350de78d | 4948 | #endif |
79072805 LW |
4949 | } |
4950 | ||
d67eb5f4 Z |
4951 | /* |
4952 | =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv | |
4953 | ||
4954 | Constructs, checks, and returns an op of any type that involves an | |
4955 | embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives | |
4956 | the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which | |
3d6c5fec | 4957 | must have been allocated using C<PerlMemShared_malloc>; the memory will |
d67eb5f4 Z |
4958 | be freed when the op is destroyed. |
4959 | ||
4960 | =cut | |
4961 | */ | |
4962 | ||
79072805 | 4963 | OP * |
864dbfa3 | 4964 | Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv) |
79072805 | 4965 | { |
27da23d5 | 4966 | dVAR; |
5db1eb8d | 4967 | const bool utf8 = cBOOL(flags & SVf_UTF8); |
79072805 | 4968 | PVOP *pvop; |
e69777c1 | 4969 | |
5db1eb8d BF |
4970 | flags &= ~SVf_UTF8; |
4971 | ||
e69777c1 | 4972 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP |
1a35f9ff | 4973 | || type == OP_RUNCV |
e69777c1 GG |
4974 | || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP); |
4975 | ||
b7dc083c | 4976 | NewOp(1101, pvop, 1, PVOP); |
eb160463 | 4977 | pvop->op_type = (OPCODE)type; |
22c35a8c | 4978 | pvop->op_ppaddr = PL_ppaddr[type]; |
79072805 LW |
4979 | pvop->op_pv = pv; |
4980 | pvop->op_next = (OP*)pvop; | |
eb160463 | 4981 | pvop->op_flags = (U8)flags; |
5db1eb8d | 4982 | pvop->op_private = utf8 ? OPpPV_IS_UTF8 : 0; |
22c35a8c | 4983 | if (PL_opargs[type] & OA_RETSCALAR) |
463ee0b2 | 4984 | scalar((OP*)pvop); |
22c35a8c | 4985 | if (PL_opargs[type] & OA_TARGET) |
ed6116ce | 4986 | pvop->op_targ = pad_alloc(type, SVs_PADTMP); |
e50aee73 | 4987 | return CHECKOP(type, pvop); |
79072805 LW |
4988 | } |
4989 | ||
eb8433b7 NC |
4990 | #ifdef PERL_MAD |
4991 | OP* | |
4992 | #else | |
79072805 | 4993 | void |
eb8433b7 | 4994 | #endif |
864dbfa3 | 4995 | Perl_package(pTHX_ OP *o) |
79072805 | 4996 | { |
97aff369 | 4997 | dVAR; |
bf070237 | 4998 | SV *const sv = cSVOPo->op_sv; |
eb8433b7 NC |
4999 | #ifdef PERL_MAD |
5000 | OP *pegop; | |
5001 | #endif | |
79072805 | 5002 | |
7918f24d NC |
5003 | PERL_ARGS_ASSERT_PACKAGE; |
5004 | ||
03d9f026 | 5005 | SAVEGENERICSV(PL_curstash); |
3280af22 | 5006 | save_item(PL_curstname); |
de11ba31 | 5007 | |
03d9f026 | 5008 | PL_curstash = (HV *)SvREFCNT_inc(gv_stashsv(sv, GV_ADD)); |
e1a479c5 | 5009 | |
bf070237 | 5010 | sv_setsv(PL_curstname, sv); |
de11ba31 | 5011 | |
7ad382f4 | 5012 | PL_hints |= HINT_BLOCK_SCOPE; |
53a7735b DM |
5013 | PL_parser->copline = NOLINE; |
5014 | PL_parser->expect = XSTATE; | |
eb8433b7 NC |
5015 | |
5016 | #ifndef PERL_MAD | |
5017 | op_free(o); | |
5018 | #else | |
5019 | if (!PL_madskills) { | |
5020 | op_free(o); | |
1d866c12 | 5021 | return NULL; |
eb8433b7 NC |
5022 | } |
5023 | ||
5024 | pegop = newOP(OP_NULL,0); | |
5025 | op_getmad(o,pegop,'P'); | |
5026 | return pegop; | |
5027 | #endif | |
79072805 LW |
5028 | } |
5029 | ||
6fa4d285 DG |
5030 | void |
5031 | Perl_package_version( pTHX_ OP *v ) | |
5032 | { | |
5033 | dVAR; | |
458818ec | 5034 | U32 savehints = PL_hints; |
6fa4d285 | 5035 | PERL_ARGS_ASSERT_PACKAGE_VERSION; |
458818ec | 5036 | PL_hints &= ~HINT_STRICT_VARS; |
e92f586b | 5037 | sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv ); |
458818ec | 5038 | PL_hints = savehints; |
6fa4d285 DG |
5039 | op_free(v); |
5040 | } | |
5041 | ||
eb8433b7 NC |
5042 | #ifdef PERL_MAD |
5043 | OP* | |
5044 | #else | |
85e6fe83 | 5045 | void |
eb8433b7 | 5046 | #endif |
88d95a4d | 5047 | Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg) |
85e6fe83 | 5048 | { |
97aff369 | 5049 | dVAR; |
a0d0e21e | 5050 | OP *pack; |
a0d0e21e | 5051 | OP *imop; |
b1cb66bf | 5052 | OP *veop; |
eb8433b7 | 5053 | #ifdef PERL_MAD |
d8842ae9 | 5054 | OP *pegop = PL_madskills ? newOP(OP_NULL,0) : NULL; |
eb8433b7 | 5055 | #endif |
88e9444c | 5056 | SV *use_version = NULL; |
85e6fe83 | 5057 | |
7918f24d NC |
5058 | PERL_ARGS_ASSERT_UTILIZE; |
5059 | ||
88d95a4d | 5060 | if (idop->op_type != OP_CONST) |
cea2e8a9 | 5061 | Perl_croak(aTHX_ "Module name must be constant"); |
85e6fe83 | 5062 | |
eb8433b7 NC |
5063 | if (PL_madskills) |
5064 | op_getmad(idop,pegop,'U'); | |
5065 | ||
5f66b61c | 5066 | veop = NULL; |
b1cb66bf | 5067 | |
aec46f14 | 5068 | if (version) { |
551405c4 | 5069 | SV * const vesv = ((SVOP*)version)->op_sv; |
b1cb66bf | 5070 | |
eb8433b7 NC |
5071 | if (PL_madskills) |
5072 | op_getmad(version,pegop,'V'); | |
aec46f14 | 5073 | if (!arg && !SvNIOKp(vesv)) { |
b1cb66bf | 5074 | arg = version; |
5075 | } | |
5076 | else { | |
5077 | OP *pack; | |
0f79a09d | 5078 | SV *meth; |
b1cb66bf | 5079 | |
44dcb63b | 5080 | if (version->op_type != OP_CONST || !SvNIOKp(vesv)) |
fe13d51d | 5081 | Perl_croak(aTHX_ "Version number must be a constant number"); |
b1cb66bf | 5082 | |
88d95a4d JH |
5083 | /* Make copy of idop so we don't free it twice */ |
5084 | pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv)); | |
b1cb66bf | 5085 | |
5086 | /* Fake up a method call to VERSION */ | |
18916d0d | 5087 | meth = newSVpvs_share("VERSION"); |
b1cb66bf | 5088 | veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL, |
2fcb4757 Z |
5089 | op_append_elem(OP_LIST, |
5090 | op_prepend_elem(OP_LIST, pack, list(version)), | |
0f79a09d | 5091 | newSVOP(OP_METHOD_NAMED, 0, meth))); |
b1cb66bf | 5092 | } |
5093 | } | |
aeea060c | 5094 | |
a0d0e21e | 5095 | /* Fake up an import/unimport */ |
eb8433b7 NC |
5096 | if (arg && arg->op_type == OP_STUB) { |
5097 | if (PL_madskills) | |
5098 | op_getmad(arg,pegop,'S'); | |
4633a7c4 | 5099 | imop = arg; /* no import on explicit () */ |
eb8433b7 | 5100 | } |
88d95a4d | 5101 | else if (SvNIOKp(((SVOP*)idop)->op_sv)) { |
5f66b61c | 5102 | imop = NULL; /* use 5.0; */ |
88e9444c NC |
5103 | if (aver) |
5104 | use_version = ((SVOP*)idop)->op_sv; | |
5105 | else | |
468aa647 | 5106 | idop->op_private |= OPpCONST_NOVER; |
b1cb66bf | 5107 | } |
4633a7c4 | 5108 | else { |
0f79a09d GS |
5109 | SV *meth; |
5110 | ||
eb8433b7 NC |
5111 | if (PL_madskills) |
5112 | op_getmad(arg,pegop,'A'); | |
5113 | ||
88d95a4d JH |
5114 | /* Make copy of idop so we don't free it twice */ |
5115 | pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv)); | |
0f79a09d GS |
5116 | |
5117 | /* Fake up a method call to import/unimport */ | |
427d62a4 | 5118 | meth = aver |
18916d0d | 5119 | ? newSVpvs_share("import") : newSVpvs_share("unimport"); |
4633a7c4 | 5120 | imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL, |
2fcb4757 Z |
5121 | op_append_elem(OP_LIST, |
5122 | op_prepend_elem(OP_LIST, pack, list(arg)), | |
0f79a09d | 5123 | newSVOP(OP_METHOD_NAMED, 0, meth))); |
4633a7c4 LW |
5124 | } |
5125 | ||
a0d0e21e | 5126 | /* Fake up the BEGIN {}, which does its thing immediately. */ |
09bef843 | 5127 | newATTRSUB(floor, |
18916d0d | 5128 | newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")), |
5f66b61c AL |
5129 | NULL, |
5130 | NULL, | |
2fcb4757 Z |
5131 | op_append_elem(OP_LINESEQ, |
5132 | op_append_elem(OP_LINESEQ, | |
bd61b366 SS |
5133 | newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)), |
5134 | newSTATEOP(0, NULL, veop)), | |
5135 | newSTATEOP(0, NULL, imop) )); | |
85e6fe83 | 5136 | |
88e9444c | 5137 | if (use_version) { |
6634bb9d | 5138 | /* Enable the |
88e9444c NC |
5139 | * feature bundle that corresponds to the required version. */ |
5140 | use_version = sv_2mortal(new_version(use_version)); | |
6634bb9d | 5141 | S_enable_feature_bundle(aTHX_ use_version); |
88e9444c | 5142 | |
88e9444c NC |
5143 | /* If a version >= 5.11.0 is requested, strictures are on by default! */ |
5144 | if (vcmp(use_version, | |
5145 | sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) { | |
d1718a7c | 5146 | if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS)) |
b50b2058 | 5147 | PL_hints |= HINT_STRICT_REFS; |
d1718a7c | 5148 | if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS)) |
b50b2058 | 5149 | PL_hints |= HINT_STRICT_SUBS; |
d1718a7c | 5150 | if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS)) |
b50b2058 FC |
5151 | PL_hints |= HINT_STRICT_VARS; |
5152 | } | |
5153 | /* otherwise they are off */ | |
5154 | else { | |
d1718a7c | 5155 | if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS)) |
b50b2058 | 5156 | PL_hints &= ~HINT_STRICT_REFS; |
d1718a7c | 5157 | if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS)) |
b50b2058 | 5158 | PL_hints &= ~HINT_STRICT_SUBS; |
d1718a7c | 5159 | if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS)) |
b50b2058 | 5160 | PL_hints &= ~HINT_STRICT_VARS; |
88e9444c NC |
5161 | } |
5162 | } | |
5163 | ||
70f5e4ed JH |
5164 | /* The "did you use incorrect case?" warning used to be here. |
5165 | * The problem is that on case-insensitive filesystems one | |
5166 | * might get false positives for "use" (and "require"): | |
5167 | * "use Strict" or "require CARP" will work. This causes | |
5168 | * portability problems for the script: in case-strict | |
5169 | * filesystems the script will stop working. | |
5170 | * | |
5171 | * The "incorrect case" warning checked whether "use Foo" | |
5172 | * imported "Foo" to your namespace, but that is wrong, too: | |
5173 | * there is no requirement nor promise in the language that | |
5174 | * a Foo.pm should or would contain anything in package "Foo". | |
5175 | * | |
5176 | * There is very little Configure-wise that can be done, either: | |
5177 | * the case-sensitivity of the build filesystem of Perl does not | |
5178 | * help in guessing the case-sensitivity of the runtime environment. | |
5179 | */ | |
18fc9488 | 5180 | |
c305c6a0 | 5181 | PL_hints |= HINT_BLOCK_SCOPE; |
53a7735b DM |
5182 | PL_parser->copline = NOLINE; |
5183 | PL_parser->expect = XSTATE; | |
8ec8fbef | 5184 | PL_cop_seqmax++; /* Purely for B::*'s benefit */ |
6012dc80 DM |
5185 | if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */ |
5186 | PL_cop_seqmax++; | |
eb8433b7 NC |
5187 | |
5188 | #ifdef PERL_MAD | |
eb8433b7 NC |
5189 | return pegop; |
5190 | #endif | |
85e6fe83 LW |
5191 | } |
5192 | ||
7d3fb230 | 5193 | /* |
ccfc67b7 JH |
5194 | =head1 Embedding Functions |
5195 | ||
7d3fb230 BS |
5196 | =for apidoc load_module |
5197 | ||
5198 | Loads the module whose name is pointed to by the string part of name. | |
5199 | Note that the actual module name, not its filename, should be given. | |
5200 | Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of | |
5201 | PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS | |
d9f23c72 | 5202 | (or 0 for no flags). ver, if specified and not NULL, provides version semantics |
7d3fb230 BS |
5203 | similar to C<use Foo::Bar VERSION>. The optional trailing SV* |
5204 | arguments can be used to specify arguments to the module's import() | |
76f108ac JD |
5205 | method, similar to C<use Foo::Bar VERSION LIST>. They must be |
5206 | terminated with a final NULL pointer. Note that this list can only | |
5207 | be omitted when the PERL_LOADMOD_NOIMPORT flag has been used. | |
5208 | Otherwise at least a single NULL pointer to designate the default | |
5209 | import list is required. | |
7d3fb230 | 5210 | |
d9f23c72 KW |
5211 | The reference count for each specified C<SV*> parameter is decremented. |
5212 | ||
7d3fb230 BS |
5213 | =cut */ |
5214 | ||
e4783991 GS |
5215 | void |
5216 | Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...) | |
5217 | { | |
5218 | va_list args; | |
7918f24d NC |
5219 | |
5220 | PERL_ARGS_ASSERT_LOAD_MODULE; | |
5221 | ||
e4783991 GS |
5222 | va_start(args, ver); |
5223 | vload_module(flags, name, ver, &args); | |
5224 | va_end(args); | |
5225 | } | |
5226 | ||
5227 | #ifdef PERL_IMPLICIT_CONTEXT | |
5228 | void | |
5229 | Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...) | |
5230 | { | |
5231 | dTHX; | |
5232 | va_list args; | |
7918f24d | 5233 | PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT; |
e4783991 GS |
5234 | va_start(args, ver); |
5235 | vload_module(flags, name, ver, &args); | |
5236 | va_end(args); | |
5237 | } | |
5238 | #endif | |
5239 | ||
5240 | void | |
5241 | Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args) | |
5242 | { | |
97aff369 | 5243 | dVAR; |
551405c4 | 5244 | OP *veop, *imop; |
551405c4 | 5245 | OP * const modname = newSVOP(OP_CONST, 0, name); |
7918f24d NC |
5246 | |
5247 | PERL_ARGS_ASSERT_VLOAD_MODULE; | |
5248 | ||
e4783991 GS |
5249 | modname->op_private |= OPpCONST_BARE; |
5250 | if (ver) { | |
5251 | veop = newSVOP(OP_CONST, 0, ver); | |
5252 | } | |
5253 | else | |
5f66b61c | 5254 | veop = NULL; |
e4783991 GS |
5255 | if (flags & PERL_LOADMOD_NOIMPORT) { |
5256 | imop = sawparens(newNULLLIST()); | |
5257 | } | |
5258 | else if (flags & PERL_LOADMOD_IMPORT_OPS) { | |
5259 | imop = va_arg(*args, OP*); | |
5260 | } | |
5261 | else { | |
5262 | SV *sv; | |
5f66b61c | 5263 | imop = NULL; |
e4783991 GS |
5264 | sv = va_arg(*args, SV*); |
5265 | while (sv) { | |
2fcb4757 | 5266 | imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv)); |
e4783991 GS |
5267 | sv = va_arg(*args, SV*); |
5268 | } | |
5269 | } | |
81885997 | 5270 | |
53a7735b DM |
5271 | /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure |
5272 | * that it has a PL_parser to play with while doing that, and also | |
5273 | * that it doesn't mess with any existing parser, by creating a tmp | |
5274 | * new parser with lex_start(). This won't actually be used for much, | |
5275 | * since pp_require() will create another parser for the real work. */ | |
5276 | ||
5277 | ENTER; | |
5278 | SAVEVPTR(PL_curcop); | |
27fcb6ee | 5279 | lex_start(NULL, NULL, LEX_START_SAME_FILTER); |
53a7735b DM |
5280 | utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0), |
5281 | veop, modname, imop); | |
5282 | LEAVE; | |
e4783991 GS |
5283 | } |
5284 | ||
79072805 | 5285 | OP * |
850e8516 | 5286 | Perl_dofile(pTHX_ OP *term, I32 force_builtin) |
78ca652e | 5287 | { |
97aff369 | 5288 | dVAR; |
78ca652e | 5289 | OP *doop; |
a0714e2c | 5290 | GV *gv = NULL; |
78ca652e | 5291 | |
7918f24d NC |
5292 | PERL_ARGS_ASSERT_DOFILE; |
5293 | ||
850e8516 | 5294 | if (!force_builtin) { |
fafc274c | 5295 | gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV); |
850e8516 | 5296 | if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) { |
a4fc7abc | 5297 | GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE); |
a0714e2c | 5298 | gv = gvp ? *gvp : NULL; |
850e8516 RGS |
5299 | } |
5300 | } | |
78ca652e | 5301 | |
b9f751c0 | 5302 | if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) { |
213aa87d | 5303 | doop = newUNOP(OP_ENTERSUB, OPf_STACKED, |
2fcb4757 | 5304 | op_append_elem(OP_LIST, term, |
78ca652e | 5305 | scalar(newUNOP(OP_RV2CV, 0, |
213aa87d | 5306 | newGVOP(OP_GV, 0, gv))))); |
78ca652e GS |
5307 | } |
5308 | else { | |
5309 | doop = newUNOP(OP_DOFILE, 0, scalar(term)); | |
5310 | } | |
5311 | return doop; | |
5312 | } | |
5313 | ||
d67eb5f4 Z |
5314 | /* |
5315 | =head1 Optree construction | |
5316 | ||
5317 | =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval | |
5318 | ||
5319 | Constructs, checks, and returns an C<lslice> (list slice) op. I<flags> | |
5320 | gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will | |
5321 | be set automatically, and, shifted up eight bits, the eight bits of | |
5322 | C<op_private>, except that the bit with value 1 or 2 is automatically | |
5323 | set as required. I<listval> and I<subscript> supply the parameters of | |
5324 | the slice; they are consumed by this function and become part of the | |
5325 | constructed op tree. | |
5326 | ||
5327 | =cut | |
5328 | */ | |
5329 | ||
78ca652e | 5330 | OP * |
864dbfa3 | 5331 | Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval) |
79072805 LW |
5332 | { |
5333 | return newBINOP(OP_LSLICE, flags, | |
8990e307 LW |
5334 | list(force_list(subscript)), |
5335 | list(force_list(listval)) ); | |
79072805 LW |
5336 | } |
5337 | ||
76e3520e | 5338 | STATIC I32 |
5aaab254 | 5339 | S_is_list_assignment(pTHX_ const OP *o) |
79072805 | 5340 | { |
1496a290 AL |
5341 | unsigned type; |
5342 | U8 flags; | |
5343 | ||
11343788 | 5344 | if (!o) |
79072805 LW |
5345 | return TRUE; |
5346 | ||
1496a290 | 5347 | if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS)) |
11343788 | 5348 | o = cUNOPo->op_first; |
79072805 | 5349 | |
1496a290 AL |
5350 | flags = o->op_flags; |
5351 | type = o->op_type; | |
5352 | if (type == OP_COND_EXPR) { | |
504618e9 AL |
5353 | const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling); |
5354 | const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling); | |
79072805 LW |
5355 | |
5356 | if (t && f) | |
5357 | return TRUE; | |
5358 | if (t || f) | |
5359 | yyerror("Assignment to both a list and a scalar"); | |
5360 | return FALSE; | |
5361 | } | |
5362 | ||
1496a290 AL |
5363 | if (type == OP_LIST && |
5364 | (flags & OPf_WANT) == OPf_WANT_SCALAR && | |
95f0a2f1 SB |
5365 | o->op_private & OPpLVAL_INTRO) |
5366 | return FALSE; | |
5367 | ||
1496a290 AL |
5368 | if (type == OP_LIST || flags & OPf_PARENS || |
5369 | type == OP_RV2AV || type == OP_RV2HV || | |
5370 | type == OP_ASLICE || type == OP_HSLICE) | |
79072805 LW |
5371 | return TRUE; |
5372 | ||
1496a290 | 5373 | if (type == OP_PADAV || type == OP_PADHV) |
93a17b20 LW |
5374 | return TRUE; |
5375 | ||
1496a290 | 5376 | if (type == OP_RV2SV) |
79072805 LW |
5377 | return FALSE; |
5378 | ||
5379 | return FALSE; | |
5380 | } | |
5381 | ||
d67eb5f4 | 5382 | /* |
83f9fced GG |
5383 | Helper function for newASSIGNOP to detection commonality between the |
5384 | lhs and the rhs. Marks all variables with PL_generation. If it | |
5385 | returns TRUE the assignment must be able to handle common variables. | |
5386 | */ | |
5387 | PERL_STATIC_INLINE bool | |
5388 | S_aassign_common_vars(pTHX_ OP* o) | |
5389 | { | |
83f9fced | 5390 | OP *curop; |
3023b5f3 | 5391 | for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) { |
83f9fced GG |
5392 | if (PL_opargs[curop->op_type] & OA_DANGEROUS) { |
5393 | if (curop->op_type == OP_GV) { | |
5394 | GV *gv = cGVOPx_gv(curop); | |
5395 | if (gv == PL_defgv | |
5396 | || (int)GvASSIGN_GENERATION(gv) == PL_generation) | |
5397 | return TRUE; | |
5398 | GvASSIGN_GENERATION_set(gv, PL_generation); | |
5399 | } | |
5400 | else if (curop->op_type == OP_PADSV || | |
5401 | curop->op_type == OP_PADAV || | |
5402 | curop->op_type == OP_PADHV || | |
5403 | curop->op_type == OP_PADANY) | |
5404 | { | |
5405 | if (PAD_COMPNAME_GEN(curop->op_targ) | |
5406 | == (STRLEN)PL_generation) | |
5407 | return TRUE; | |
5408 | PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation); | |
5409 | ||
5410 | } | |
5411 | else if (curop->op_type == OP_RV2CV) | |
5412 | return TRUE; | |
5413 | else if (curop->op_type == OP_RV2SV || | |
5414 | curop->op_type == OP_RV2AV || | |
5415 | curop->op_type == OP_RV2HV || | |
5416 | curop->op_type == OP_RV2GV) { | |
3023b5f3 | 5417 | if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */ |
83f9fced GG |
5418 | return TRUE; |
5419 | } | |
5420 | else if (curop->op_type == OP_PUSHRE) { | |
5421 | #ifdef USE_ITHREADS | |
5422 | if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) { | |
5423 | GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff)); | |
5424 | if (gv == PL_defgv | |
5425 | || (int)GvASSIGN_GENERATION(gv) == PL_generation) | |
5426 | return TRUE; | |
5427 | GvASSIGN_GENERATION_set(gv, PL_generation); | |
5428 | } | |
5429 | #else | |
5430 | GV *const gv | |
5431 | = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv; | |
5432 | if (gv) { | |
5433 | if (gv == PL_defgv | |
5434 | || (int)GvASSIGN_GENERATION(gv) == PL_generation) | |
5435 | return TRUE; | |
5436 | GvASSIGN_GENERATION_set(gv, PL_generation); | |
5437 | } | |
5438 | #endif | |
5439 | } | |
5440 | else | |
5441 | return TRUE; | |
5442 | } | |
3023b5f3 GG |
5443 | |
5444 | if (curop->op_flags & OPf_KIDS) { | |
5445 | if (aassign_common_vars(curop)) | |
5446 | return TRUE; | |
5447 | } | |
83f9fced GG |
5448 | } |
5449 | return FALSE; | |
5450 | } | |
5451 | ||
5452 | /* | |
d67eb5f4 Z |
5453 | =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right |
5454 | ||
5455 | Constructs, checks, and returns an assignment op. I<left> and I<right> | |
5456 | supply the parameters of the assignment; they are consumed by this | |
5457 | function and become part of the constructed op tree. | |
5458 | ||
5459 | If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then | |
5460 | a suitable conditional optree is constructed. If I<optype> is the opcode | |
5461 | of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that | |
5462 | performs the binary operation and assigns the result to the left argument. | |
5463 | Either way, if I<optype> is non-zero then I<flags> has no effect. | |
5464 | ||
5465 | If I<optype> is zero, then a plain scalar or list assignment is | |
5466 | constructed. Which type of assignment it is is automatically determined. | |
5467 | I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS> | |
5468 | will be set automatically, and, shifted up eight bits, the eight bits | |
5469 | of C<op_private>, except that the bit with value 1 or 2 is automatically | |
5470 | set as required. | |
5471 | ||
5472 | =cut | |
5473 | */ | |
5474 | ||
79072805 | 5475 | OP * |
864dbfa3 | 5476 | Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right) |
79072805 | 5477 | { |
97aff369 | 5478 | dVAR; |
11343788 | 5479 | OP *o; |
79072805 | 5480 | |
a0d0e21e | 5481 | if (optype) { |
c963b151 | 5482 | if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) { |
a0d0e21e | 5483 | return newLOGOP(optype, 0, |
3ad73efd | 5484 | op_lvalue(scalar(left), optype), |
a0d0e21e LW |
5485 | newUNOP(OP_SASSIGN, 0, scalar(right))); |
5486 | } | |
5487 | else { | |
5488 | return newBINOP(optype, OPf_STACKED, | |
3ad73efd | 5489 | op_lvalue(scalar(left), optype), scalar(right)); |
a0d0e21e LW |
5490 | } |
5491 | } | |
5492 | ||
504618e9 | 5493 | if (is_list_assignment(left)) { |
6dbe9451 NC |
5494 | static const char no_list_state[] = "Initialization of state variables" |
5495 | " in list context currently forbidden"; | |
10c8fecd | 5496 | OP *curop; |
fafafbaf | 5497 | bool maybe_common_vars = TRUE; |
10c8fecd | 5498 | |
3280af22 | 5499 | PL_modcount = 0; |
3ad73efd | 5500 | left = op_lvalue(left, OP_AASSIGN); |
10c8fecd GS |
5501 | curop = list(force_list(left)); |
5502 | o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop); | |
eb160463 | 5503 | o->op_private = (U8)(0 | (flags >> 8)); |
dd2155a4 | 5504 | |
fafafbaf RD |
5505 | if ((left->op_type == OP_LIST |
5506 | || (left->op_type == OP_NULL && left->op_targ == OP_LIST))) | |
5507 | { | |
5508 | OP* lop = ((LISTOP*)left)->op_first; | |
5509 | maybe_common_vars = FALSE; | |
5510 | while (lop) { | |
5511 | if (lop->op_type == OP_PADSV || | |
5512 | lop->op_type == OP_PADAV || | |
5513 | lop->op_type == OP_PADHV || | |
5514 | lop->op_type == OP_PADANY) { | |
5515 | if (!(lop->op_private & OPpLVAL_INTRO)) | |
5516 | maybe_common_vars = TRUE; | |
5517 | ||
5518 | if (lop->op_private & OPpPAD_STATE) { | |
5519 | if (left->op_private & OPpLVAL_INTRO) { | |
5520 | /* Each variable in state($a, $b, $c) = ... */ | |
5521 | } | |
5522 | else { | |
5523 | /* Each state variable in | |
5524 | (state $a, my $b, our $c, $d, undef) = ... */ | |
5525 | } | |
5526 | yyerror(no_list_state); | |
5527 | } else { | |
5528 | /* Each my variable in | |
5529 | (state $a, my $b, our $c, $d, undef) = ... */ | |
5530 | } | |
5531 | } else if (lop->op_type == OP_UNDEF || | |
5532 | lop->op_type == OP_PUSHMARK) { | |
5533 | /* undef may be interesting in | |
5534 | (state $a, undef, state $c) */ | |
5535 | } else { | |
5536 | /* Other ops in the list. */ | |
5537 | maybe_common_vars = TRUE; | |
5538 | } | |
5539 | lop = lop->op_sibling; | |
5540 | } | |
5541 | } | |
5542 | else if ((left->op_private & OPpLVAL_INTRO) | |
5543 | && ( left->op_type == OP_PADSV | |
5544 | || left->op_type == OP_PADAV | |
5545 | || left->op_type == OP_PADHV | |
5546 | || left->op_type == OP_PADANY)) | |
5547 | { | |
0f907b96 | 5548 | if (left->op_type == OP_PADSV) maybe_common_vars = FALSE; |
fafafbaf RD |
5549 | if (left->op_private & OPpPAD_STATE) { |
5550 | /* All single variable list context state assignments, hence | |
5551 | state ($a) = ... | |
5552 | (state $a) = ... | |
5553 | state @a = ... | |
5554 | state (@a) = ... | |
5555 | (state @a) = ... | |
5556 | state %a = ... | |
5557 | state (%a) = ... | |
5558 | (state %a) = ... | |
5559 | */ | |
5560 | yyerror(no_list_state); | |
5561 | } | |
5562 | } | |
5563 | ||
dd2155a4 DM |
5564 | /* PL_generation sorcery: |
5565 | * an assignment like ($a,$b) = ($c,$d) is easier than | |
5566 | * ($a,$b) = ($c,$a), since there is no need for temporary vars. | |
5567 | * To detect whether there are common vars, the global var | |
5568 | * PL_generation is incremented for each assign op we compile. | |
5569 | * Then, while compiling the assign op, we run through all the | |
5570 | * variables on both sides of the assignment, setting a spare slot | |
5571 | * in each of them to PL_generation. If any of them already have | |
5572 | * that value, we know we've got commonality. We could use a | |
5573 | * single bit marker, but then we'd have to make 2 passes, first | |
5574 | * to clear the flag, then to test and set it. To find somewhere | |
931b58fb | 5575 | * to store these values, evil chicanery is done with SvUVX(). |
dd2155a4 DM |
5576 | */ |
5577 | ||
fafafbaf | 5578 | if (maybe_common_vars) { |
3280af22 | 5579 | PL_generation++; |
83f9fced | 5580 | if (aassign_common_vars(o)) |
10c8fecd | 5581 | o->op_private |= OPpASSIGN_COMMON; |
3023b5f3 | 5582 | LINKLIST(o); |
461824dc | 5583 | } |
9fdc7570 | 5584 | |
e9cc17ba | 5585 | if (right && right->op_type == OP_SPLIT && !PL_madskills) { |
1496a290 AL |
5586 | OP* tmpop = ((LISTOP*)right)->op_first; |
5587 | if (tmpop && (tmpop->op_type == OP_PUSHRE)) { | |
551405c4 | 5588 | PMOP * const pm = (PMOP*)tmpop; |
c07a80fd | 5589 | if (left->op_type == OP_RV2AV && |
5590 | !(left->op_private & OPpLVAL_INTRO) && | |
11343788 | 5591 | !(o->op_private & OPpASSIGN_COMMON) ) |
c07a80fd | 5592 | { |
5593 | tmpop = ((UNOP*)left)->op_first; | |
20e98b0f NC |
5594 | if (tmpop->op_type == OP_GV |
5595 | #ifdef USE_ITHREADS | |
5596 | && !pm->op_pmreplrootu.op_pmtargetoff | |
5597 | #else | |
5598 | && !pm->op_pmreplrootu.op_pmtargetgv | |
5599 | #endif | |
5600 | ) { | |
971a9dd3 | 5601 | #ifdef USE_ITHREADS |
20e98b0f NC |
5602 | pm->op_pmreplrootu.op_pmtargetoff |
5603 | = cPADOPx(tmpop)->op_padix; | |
971a9dd3 GS |
5604 | cPADOPx(tmpop)->op_padix = 0; /* steal it */ |
5605 | #else | |
20e98b0f | 5606 | pm->op_pmreplrootu.op_pmtargetgv |
159b6efe | 5607 | = MUTABLE_GV(cSVOPx(tmpop)->op_sv); |
a0714e2c | 5608 | cSVOPx(tmpop)->op_sv = NULL; /* steal it */ |
971a9dd3 | 5609 | #endif |
11343788 | 5610 | tmpop = cUNOPo->op_first; /* to list (nulled) */ |
c07a80fd | 5611 | tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */ |
5f66b61c | 5612 | tmpop->op_sibling = NULL; /* don't free split */ |
c07a80fd | 5613 | right->op_next = tmpop->op_next; /* fix starting loc */ |
11343788 | 5614 | op_free(o); /* blow off assign */ |
54310121 | 5615 | right->op_flags &= ~OPf_WANT; |
a5f75d66 | 5616 | /* "I don't know and I don't care." */ |
c07a80fd | 5617 | return right; |
5618 | } | |
5619 | } | |
5620 | else { | |
e6438c1a | 5621 | if (PL_modcount < RETURN_UNLIMITED_NUMBER && |
c07a80fd | 5622 | ((LISTOP*)right)->op_last->op_type == OP_CONST) |
5623 | { | |
60041a09 FC |
5624 | SV ** const svp = |
5625 | &((SVOP*)((LISTOP*)right)->op_last)->op_sv; | |
5626 | SV * const sv = *svp; | |
b8de32d5 | 5627 | if (SvIOK(sv) && SvIVX(sv) == 0) |
60041a09 FC |
5628 | { |
5629 | if (right->op_private & OPpSPLIT_IMPLIM) { | |
5630 | /* our own SV, created in ck_split */ | |
5631 | SvREADONLY_off(sv); | |
3280af22 | 5632 | sv_setiv(sv, PL_modcount+1); |
60041a09 FC |
5633 | } |
5634 | else { | |
5635 | /* SV may belong to someone else */ | |
5636 | SvREFCNT_dec(sv); | |
5637 | *svp = newSViv(PL_modcount+1); | |
5638 | } | |
5639 | } | |
c07a80fd | 5640 | } |
5641 | } | |
5642 | } | |
5643 | } | |
11343788 | 5644 | return o; |
79072805 LW |
5645 | } |
5646 | if (!right) | |
5647 | right = newOP(OP_UNDEF, 0); | |
5648 | if (right->op_type == OP_READLINE) { | |
5649 | right->op_flags |= OPf_STACKED; | |
3ad73efd Z |
5650 | return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN), |
5651 | scalar(right)); | |
79072805 | 5652 | } |
a0d0e21e | 5653 | else { |
11343788 | 5654 | o = newBINOP(OP_SASSIGN, flags, |
3ad73efd | 5655 | scalar(right), op_lvalue(scalar(left), OP_SASSIGN) ); |
a0d0e21e | 5656 | } |
11343788 | 5657 | return o; |
79072805 LW |
5658 | } |
5659 | ||
d67eb5f4 Z |
5660 | /* |
5661 | =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o | |
5662 | ||
5663 | Constructs a state op (COP). The state op is normally a C<nextstate> op, | |
5664 | but will be a C<dbstate> op if debugging is enabled for currently-compiled | |
3d6c5fec | 5665 | code. The state op is populated from C<PL_curcop> (or C<PL_compiling>). |
d67eb5f4 Z |
5666 | If I<label> is non-null, it supplies the name of a label to attach to |
5667 | the state op; this function takes ownership of the memory pointed at by | |
5668 | I<label>, and will free it. I<flags> gives the eight bits of C<op_flags> | |
5669 | for the state op. | |
5670 | ||
5671 | If I<o> is null, the state op is returned. Otherwise the state op is | |
5672 | combined with I<o> into a C<lineseq> list op, which is returned. I<o> | |
5673 | is consumed by this function and becomes part of the returned op tree. | |
5674 | ||
5675 | =cut | |
5676 | */ | |
5677 | ||
79072805 | 5678 | OP * |
864dbfa3 | 5679 | Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o) |
79072805 | 5680 | { |
27da23d5 | 5681 | dVAR; |
e1ec3a88 | 5682 | const U32 seq = intro_my(); |
5db1eb8d | 5683 | const U32 utf8 = flags & SVf_UTF8; |
eb578fdb | 5684 | COP *cop; |
79072805 | 5685 | |
5db1eb8d BF |
5686 | flags &= ~SVf_UTF8; |
5687 | ||
b7dc083c | 5688 | NewOp(1101, cop, 1, COP); |
57843af0 | 5689 | if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) { |
8990e307 | 5690 | cop->op_type = OP_DBSTATE; |
22c35a8c | 5691 | cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ]; |
8990e307 LW |
5692 | } |
5693 | else { | |
5694 | cop->op_type = OP_NEXTSTATE; | |
22c35a8c | 5695 | cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ]; |
8990e307 | 5696 | } |
eb160463 | 5697 | cop->op_flags = (U8)flags; |
623e6609 | 5698 | CopHINTS_set(cop, PL_hints); |
ff0cee69 | 5699 | #ifdef NATIVE_HINTS |
5700 | cop->op_private |= NATIVE_HINTS; | |
5701 | #endif | |
623e6609 | 5702 | CopHINTS_set(&PL_compiling, CopHINTS_get(cop)); |
79072805 LW |
5703 | cop->op_next = (OP*)cop; |
5704 | ||
bbce6d69 | 5705 | cop->cop_seq = seq; |
72dc9ed5 | 5706 | cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings); |
20439bc7 | 5707 | CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop))); |
dca6062a | 5708 | if (label) { |
5db1eb8d BF |
5709 | Perl_cop_store_label(aTHX_ cop, label, strlen(label), utf8); |
5710 | ||
dca6062a NC |
5711 | PL_hints |= HINT_BLOCK_SCOPE; |
5712 | /* It seems that we need to defer freeing this pointer, as other parts | |
5713 | of the grammar end up wanting to copy it after this op has been | |
5714 | created. */ | |
5715 | SAVEFREEPV(label); | |
dca6062a | 5716 | } |
79072805 | 5717 | |
53a7735b | 5718 | if (PL_parser && PL_parser->copline == NOLINE) |
57843af0 | 5719 | CopLINE_set(cop, CopLINE(PL_curcop)); |
79072805 | 5720 | else { |
53a7735b | 5721 | CopLINE_set(cop, PL_parser->copline); |
4b1709c8 | 5722 | PL_parser->copline = NOLINE; |
79072805 | 5723 | } |
57843af0 | 5724 | #ifdef USE_ITHREADS |
f4dd75d9 | 5725 | CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */ |
57843af0 | 5726 | #else |
f4dd75d9 | 5727 | CopFILEGV_set(cop, CopFILEGV(PL_curcop)); |
57843af0 | 5728 | #endif |
11faa288 | 5729 | CopSTASH_set(cop, PL_curstash); |
79072805 | 5730 | |
65269a95 TB |
5731 | if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) { |
5732 | /* this line can have a breakpoint - store the cop in IV */ | |
80a702cd RGS |
5733 | AV *av = CopFILEAVx(PL_curcop); |
5734 | if (av) { | |
5735 | SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE); | |
5736 | if (svp && *svp != &PL_sv_undef ) { | |
5737 | (void)SvIOK_on(*svp); | |
5738 | SvIV_set(*svp, PTR2IV(cop)); | |
5739 | } | |
1eb1540c | 5740 | } |
93a17b20 LW |
5741 | } |
5742 | ||
f6f3a1fe RGS |
5743 | if (flags & OPf_SPECIAL) |
5744 | op_null((OP*)cop); | |
2fcb4757 | 5745 | return op_prepend_elem(OP_LINESEQ, (OP*)cop, o); |
79072805 LW |
5746 | } |
5747 | ||
d67eb5f4 Z |
5748 | /* |
5749 | =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other | |
5750 | ||
5751 | Constructs, checks, and returns a logical (flow control) op. I<type> | |
5752 | is the opcode. I<flags> gives the eight bits of C<op_flags>, except | |
5753 | that C<OPf_KIDS> will be set automatically, and, shifted up eight bits, | |
5754 | the eight bits of C<op_private>, except that the bit with value 1 is | |
5755 | automatically set. I<first> supplies the expression controlling the | |
5756 | flow, and I<other> supplies the side (alternate) chain of ops; they are | |
5757 | consumed by this function and become part of the constructed op tree. | |
5758 | ||
5759 | =cut | |
5760 | */ | |
bbce6d69 | 5761 | |
79072805 | 5762 | OP * |
864dbfa3 | 5763 | Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other) |
79072805 | 5764 | { |
27da23d5 | 5765 | dVAR; |
7918f24d NC |
5766 | |
5767 | PERL_ARGS_ASSERT_NEWLOGOP; | |
5768 | ||
883ffac3 CS |
5769 | return new_logop(type, flags, &first, &other); |
5770 | } | |
5771 | ||
3bd495df | 5772 | STATIC OP * |
71c4dbc3 VP |
5773 | S_search_const(pTHX_ OP *o) |
5774 | { | |
5775 | PERL_ARGS_ASSERT_SEARCH_CONST; | |
5776 | ||
5777 | switch (o->op_type) { | |
5778 | case OP_CONST: | |
5779 | return o; | |
5780 | case OP_NULL: | |
5781 | if (o->op_flags & OPf_KIDS) | |
5782 | return search_const(cUNOPo->op_first); | |
5783 | break; | |
5784 | case OP_LEAVE: | |
5785 | case OP_SCOPE: | |
5786 | case OP_LINESEQ: | |
5787 | { | |
5788 | OP *kid; | |
5789 | if (!(o->op_flags & OPf_KIDS)) | |
5790 | return NULL; | |
5791 | kid = cLISTOPo->op_first; | |
5792 | do { | |
5793 | switch (kid->op_type) { | |
5794 | case OP_ENTER: | |
5795 | case OP_NULL: | |
5796 | case OP_NEXTSTATE: | |
5797 | kid = kid->op_sibling; | |
5798 | break; | |
5799 | default: | |
5800 | if (kid != cLISTOPo->op_last) | |
5801 | return NULL; | |
5802 | goto last; | |
5803 | } | |
5804 | } while (kid); | |
5805 | if (!kid) | |
5806 | kid = cLISTOPo->op_last; | |
5807 | last: | |
5808 | return search_const(kid); | |
5809 | } | |
5810 | } | |
5811 | ||
5812 | return NULL; | |
5813 | } | |
5814 | ||
5815 | STATIC OP * | |
cea2e8a9 | 5816 | S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp) |
883ffac3 | 5817 | { |
27da23d5 | 5818 | dVAR; |
79072805 | 5819 | LOGOP *logop; |
11343788 | 5820 | OP *o; |
71c4dbc3 VP |
5821 | OP *first; |
5822 | OP *other; | |
5823 | OP *cstop = NULL; | |
edbe35ea | 5824 | int prepend_not = 0; |
79072805 | 5825 | |
7918f24d NC |
5826 | PERL_ARGS_ASSERT_NEW_LOGOP; |
5827 | ||
71c4dbc3 VP |
5828 | first = *firstp; |
5829 | other = *otherp; | |
5830 | ||
a0d0e21e LW |
5831 | if (type == OP_XOR) /* Not short circuit, but here by precedence. */ |
5832 | return newBINOP(type, flags, scalar(first), scalar(other)); | |
5833 | ||
e69777c1 GG |
5834 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP); |
5835 | ||
8990e307 | 5836 | scalarboolean(first); |
edbe35ea | 5837 | /* optimize AND and OR ops that have NOTs as children */ |
68726e16 | 5838 | if (first->op_type == OP_NOT |
b6214b80 | 5839 | && (first->op_flags & OPf_KIDS) |
edbe35ea VP |
5840 | && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */ |
5841 | || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */ | |
b6214b80 | 5842 | && !PL_madskills) { |
79072805 LW |
5843 | if (type == OP_AND || type == OP_OR) { |
5844 | if (type == OP_AND) | |
5845 | type = OP_OR; | |
5846 | else | |
5847 | type = OP_AND; | |
07f3cdf5 | 5848 | op_null(first); |
edbe35ea | 5849 | if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */ |
07f3cdf5 | 5850 | op_null(other); |
edbe35ea VP |
5851 | prepend_not = 1; /* prepend a NOT op later */ |
5852 | } | |
79072805 LW |
5853 | } |
5854 | } | |
71c4dbc3 VP |
5855 | /* search for a constant op that could let us fold the test */ |
5856 | if ((cstop = search_const(first))) { | |
5857 | if (cstop->op_private & OPpCONST_STRICT) | |
5858 | no_bareword_allowed(cstop); | |
a2a5de95 NC |
5859 | else if ((cstop->op_private & OPpCONST_BARE)) |
5860 | Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional"); | |
71c4dbc3 VP |
5861 | if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) || |
5862 | (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) || | |
5863 | (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) { | |
5f66b61c | 5864 | *firstp = NULL; |
d6fee5c7 DM |
5865 | if (other->op_type == OP_CONST) |
5866 | other->op_private |= OPpCONST_SHORTCIRCUIT; | |
eb8433b7 NC |
5867 | if (PL_madskills) { |
5868 | OP *newop = newUNOP(OP_NULL, 0, other); | |
5869 | op_getmad(first, newop, '1'); | |
5870 | newop->op_targ = type; /* set "was" field */ | |
5871 | return newop; | |
5872 | } | |
5873 | op_free(first); | |
dd3e51dc VP |
5874 | if (other->op_type == OP_LEAVE) |
5875 | other = newUNOP(OP_NULL, OPf_SPECIAL, other); | |
2474a784 FC |
5876 | else if (other->op_type == OP_MATCH |
5877 | || other->op_type == OP_SUBST | |
bb16bae8 | 5878 | || other->op_type == OP_TRANSR |
2474a784 FC |
5879 | || other->op_type == OP_TRANS) |
5880 | /* Mark the op as being unbindable with =~ */ | |
5881 | other->op_flags |= OPf_SPECIAL; | |
cc2ebcd7 FC |
5882 | else if (other->op_type == OP_CONST) |
5883 | other->op_private |= OPpCONST_FOLDED; | |
3513c740 NT |
5884 | |
5885 | other->op_folded = 1; | |
79072805 LW |
5886 | return other; |
5887 | } | |
5888 | else { | |
7921d0f2 | 5889 | /* check for C<my $x if 0>, or C<my($x,$y) if 0> */ |
6867be6d | 5890 | const OP *o2 = other; |
7921d0f2 DM |
5891 | if ( ! (o2->op_type == OP_LIST |
5892 | && (( o2 = cUNOPx(o2)->op_first)) | |
5893 | && o2->op_type == OP_PUSHMARK | |
5894 | && (( o2 = o2->op_sibling)) ) | |
5895 | ) | |
5896 | o2 = other; | |
5897 | if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV | |
5898 | || o2->op_type == OP_PADHV) | |
5899 | && o2->op_private & OPpLVAL_INTRO | |
a2a5de95 | 5900 | && !(o2->op_private & OPpPAD_STATE)) |
7921d0f2 | 5901 | { |
d1d15184 NC |
5902 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
5903 | "Deprecated use of my() in false conditional"); | |
7921d0f2 DM |
5904 | } |
5905 | ||
5f66b61c | 5906 | *otherp = NULL; |
d6fee5c7 DM |
5907 | if (first->op_type == OP_CONST) |
5908 | first->op_private |= OPpCONST_SHORTCIRCUIT; | |
eb8433b7 NC |
5909 | if (PL_madskills) { |
5910 | first = newUNOP(OP_NULL, 0, first); | |
5911 | op_getmad(other, first, '2'); | |
5912 | first->op_targ = type; /* set "was" field */ | |
5913 | } | |
5914 | else | |
5915 | op_free(other); | |
79072805 LW |
5916 | return first; |
5917 | } | |
5918 | } | |
041457d9 DM |
5919 | else if ((first->op_flags & OPf_KIDS) && type != OP_DOR |
5920 | && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */ | |
59e10468 | 5921 | { |
b22e6366 AL |
5922 | const OP * const k1 = ((UNOP*)first)->op_first; |
5923 | const OP * const k2 = k1->op_sibling; | |
a6006777 | 5924 | OPCODE warnop = 0; |
5925 | switch (first->op_type) | |
5926 | { | |
5927 | case OP_NULL: | |
5928 | if (k2 && k2->op_type == OP_READLINE | |
5929 | && (k2->op_flags & OPf_STACKED) | |
1c846c1f | 5930 | && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR)) |
72b16652 | 5931 | { |
a6006777 | 5932 | warnop = k2->op_type; |
72b16652 | 5933 | } |
a6006777 | 5934 | break; |
5935 | ||
5936 | case OP_SASSIGN: | |
68dc0745 | 5937 | if (k1->op_type == OP_READDIR |
5938 | || k1->op_type == OP_GLOB | |
72b16652 | 5939 | || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB) |
459b64da HY |
5940 | || k1->op_type == OP_EACH |
5941 | || k1->op_type == OP_AEACH) | |
72b16652 GS |
5942 | { |
5943 | warnop = ((k1->op_type == OP_NULL) | |
eb160463 | 5944 | ? (OPCODE)k1->op_targ : k1->op_type); |
72b16652 | 5945 | } |
a6006777 | 5946 | break; |
5947 | } | |
8ebc5c01 | 5948 | if (warnop) { |
6867be6d | 5949 | const line_t oldline = CopLINE(PL_curcop); |
502e5101 NC |
5950 | /* This ensures that warnings are reported at the first line |
5951 | of the construction, not the last. */ | |
53a7735b | 5952 | CopLINE_set(PL_curcop, PL_parser->copline); |
9014280d | 5953 | Perl_warner(aTHX_ packWARN(WARN_MISC), |
599cee73 | 5954 | "Value of %s%s can be \"0\"; test with defined()", |
22c35a8c | 5955 | PL_op_desc[warnop], |
68dc0745 | 5956 | ((warnop == OP_READLINE || warnop == OP_GLOB) |
5957 | ? " construct" : "() operator")); | |
57843af0 | 5958 | CopLINE_set(PL_curcop, oldline); |
8ebc5c01 | 5959 | } |
a6006777 | 5960 | } |
79072805 LW |
5961 | |
5962 | if (!other) | |
5963 | return first; | |
5964 | ||
c963b151 | 5965 | if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN) |
a0d0e21e LW |
5966 | other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */ |
5967 | ||
b7dc083c | 5968 | NewOp(1101, logop, 1, LOGOP); |
79072805 | 5969 | |
eb160463 | 5970 | logop->op_type = (OPCODE)type; |
22c35a8c | 5971 | logop->op_ppaddr = PL_ppaddr[type]; |
79072805 | 5972 | logop->op_first = first; |
585ec06d | 5973 | logop->op_flags = (U8)(flags | OPf_KIDS); |
79072805 | 5974 | logop->op_other = LINKLIST(other); |
eb160463 | 5975 | logop->op_private = (U8)(1 | (flags >> 8)); |
79072805 LW |
5976 | |
5977 | /* establish postfix order */ | |
5978 | logop->op_next = LINKLIST(first); | |
5979 | first->op_next = (OP*)logop; | |
5980 | first->op_sibling = other; | |
5981 | ||
463d09e6 RGS |
5982 | CHECKOP(type,logop); |
5983 | ||
edbe35ea | 5984 | o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop); |
11343788 | 5985 | other->op_next = o; |
79072805 | 5986 | |
11343788 | 5987 | return o; |
79072805 LW |
5988 | } |
5989 | ||
d67eb5f4 Z |
5990 | /* |
5991 | =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop | |
5992 | ||
5993 | Constructs, checks, and returns a conditional-expression (C<cond_expr>) | |
5994 | op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS> | |
5995 | will be set automatically, and, shifted up eight bits, the eight bits of | |
5996 | C<op_private>, except that the bit with value 1 is automatically set. | |
5997 | I<first> supplies the expression selecting between the two branches, | |
5998 | and I<trueop> and I<falseop> supply the branches; they are consumed by | |
5999 | this function and become part of the constructed op tree. | |
6000 | ||
6001 | =cut | |
6002 | */ | |
6003 | ||
79072805 | 6004 | OP * |
864dbfa3 | 6005 | Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop) |
79072805 | 6006 | { |
27da23d5 | 6007 | dVAR; |
1a67a97c SM |
6008 | LOGOP *logop; |
6009 | OP *start; | |
11343788 | 6010 | OP *o; |
71c4dbc3 | 6011 | OP *cstop; |
79072805 | 6012 | |
7918f24d NC |
6013 | PERL_ARGS_ASSERT_NEWCONDOP; |
6014 | ||
b1cb66bf | 6015 | if (!falseop) |
6016 | return newLOGOP(OP_AND, 0, first, trueop); | |
6017 | if (!trueop) | |
6018 | return newLOGOP(OP_OR, 0, first, falseop); | |
79072805 | 6019 | |
8990e307 | 6020 | scalarboolean(first); |
71c4dbc3 | 6021 | if ((cstop = search_const(first))) { |
5b6782b2 | 6022 | /* Left or right arm of the conditional? */ |
71c4dbc3 | 6023 | const bool left = SvTRUE(((SVOP*)cstop)->op_sv); |
5b6782b2 NC |
6024 | OP *live = left ? trueop : falseop; |
6025 | OP *const dead = left ? falseop : trueop; | |
71c4dbc3 VP |
6026 | if (cstop->op_private & OPpCONST_BARE && |
6027 | cstop->op_private & OPpCONST_STRICT) { | |
6028 | no_bareword_allowed(cstop); | |
b22e6366 | 6029 | } |
5b6782b2 NC |
6030 | if (PL_madskills) { |
6031 | /* This is all dead code when PERL_MAD is not defined. */ | |
6032 | live = newUNOP(OP_NULL, 0, live); | |
6033 | op_getmad(first, live, 'C'); | |
6034 | op_getmad(dead, live, left ? 'e' : 't'); | |
6035 | } else { | |
6036 | op_free(first); | |
6037 | op_free(dead); | |
79072805 | 6038 | } |
ef9da979 FC |
6039 | if (live->op_type == OP_LEAVE) |
6040 | live = newUNOP(OP_NULL, OPf_SPECIAL, live); | |
2474a784 | 6041 | else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST |
bb16bae8 | 6042 | || live->op_type == OP_TRANS || live->op_type == OP_TRANSR) |
2474a784 FC |
6043 | /* Mark the op as being unbindable with =~ */ |
6044 | live->op_flags |= OPf_SPECIAL; | |
cc2ebcd7 FC |
6045 | else if (live->op_type == OP_CONST) |
6046 | live->op_private |= OPpCONST_FOLDED; | |
3513c740 | 6047 | live->op_folded = 1; |
5b6782b2 | 6048 | return live; |
79072805 | 6049 | } |
1a67a97c SM |
6050 | NewOp(1101, logop, 1, LOGOP); |
6051 | logop->op_type = OP_COND_EXPR; | |
6052 | logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR]; | |
6053 | logop->op_first = first; | |
585ec06d | 6054 | logop->op_flags = (U8)(flags | OPf_KIDS); |
eb160463 | 6055 | logop->op_private = (U8)(1 | (flags >> 8)); |
1a67a97c SM |
6056 | logop->op_other = LINKLIST(trueop); |
6057 | logop->op_next = LINKLIST(falseop); | |
79072805 | 6058 | |
463d09e6 RGS |
6059 | CHECKOP(OP_COND_EXPR, /* that's logop->op_type */ |
6060 | logop); | |
79072805 LW |
6061 | |
6062 | /* establish postfix order */ | |
1a67a97c SM |
6063 | start = LINKLIST(first); |
6064 | first->op_next = (OP*)logop; | |
79072805 | 6065 | |
b1cb66bf | 6066 | first->op_sibling = trueop; |
6067 | trueop->op_sibling = falseop; | |
1a67a97c | 6068 | o = newUNOP(OP_NULL, 0, (OP*)logop); |
79072805 | 6069 | |
1a67a97c | 6070 | trueop->op_next = falseop->op_next = o; |
79072805 | 6071 | |
1a67a97c | 6072 | o->op_next = start; |
11343788 | 6073 | return o; |
79072805 LW |
6074 | } |
6075 | ||
d67eb5f4 Z |
6076 | /* |
6077 | =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right | |
6078 | ||
6079 | Constructs and returns a C<range> op, with subordinate C<flip> and | |
6080 | C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the | |
6081 | C<flip> op and, shifted up eight bits, the eight bits of C<op_private> | |
6082 | for both the C<flip> and C<range> ops, except that the bit with value | |
6083 | 1 is automatically set. I<left> and I<right> supply the expressions | |
6084 | controlling the endpoints of the range; they are consumed by this function | |
6085 | and become part of the constructed op tree. | |
6086 | ||
6087 | =cut | |
6088 | */ | |
6089 | ||
79072805 | 6090 | OP * |
864dbfa3 | 6091 | Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right) |
79072805 | 6092 | { |
27da23d5 | 6093 | dVAR; |
1a67a97c | 6094 | LOGOP *range; |
79072805 LW |
6095 | OP *flip; |
6096 | OP *flop; | |
1a67a97c | 6097 | OP *leftstart; |
11343788 | 6098 | OP *o; |
79072805 | 6099 | |
7918f24d NC |
6100 | PERL_ARGS_ASSERT_NEWRANGE; |
6101 | ||
1a67a97c | 6102 | NewOp(1101, range, 1, LOGOP); |
79072805 | 6103 | |
1a67a97c SM |
6104 | range->op_type = OP_RANGE; |
6105 | range->op_ppaddr = PL_ppaddr[OP_RANGE]; | |
6106 | range->op_first = left; | |
6107 | range->op_flags = OPf_KIDS; | |
6108 | leftstart = LINKLIST(left); | |
6109 | range->op_other = LINKLIST(right); | |
eb160463 | 6110 | range->op_private = (U8)(1 | (flags >> 8)); |
79072805 LW |
6111 | |
6112 | left->op_sibling = right; | |
6113 | ||
1a67a97c SM |
6114 | range->op_next = (OP*)range; |
6115 | flip = newUNOP(OP_FLIP, flags, (OP*)range); | |
79072805 | 6116 | flop = newUNOP(OP_FLOP, 0, flip); |
11343788 | 6117 | o = newUNOP(OP_NULL, 0, flop); |
5983a79d | 6118 | LINKLIST(flop); |
1a67a97c | 6119 | range->op_next = leftstart; |
79072805 LW |
6120 | |
6121 | left->op_next = flip; | |
6122 | right->op_next = flop; | |
6123 | ||
1a67a97c SM |
6124 | range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY); |
6125 | sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV); | |
ed6116ce | 6126 | flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY); |
79072805 LW |
6127 | sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV); |
6128 | ||
6129 | flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0; | |
6130 | flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0; | |
6131 | ||
eb796c7f GG |
6132 | /* check barewords before they might be optimized aways */ |
6133 | if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT) | |
6134 | no_bareword_allowed(left); | |
6135 | if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT) | |
6136 | no_bareword_allowed(right); | |
6137 | ||
11343788 | 6138 | flip->op_next = o; |
79072805 | 6139 | if (!flip->op_private || !flop->op_private) |
5983a79d | 6140 | LINKLIST(o); /* blow off optimizer unless constant */ |
79072805 | 6141 | |
11343788 | 6142 | return o; |
79072805 LW |
6143 | } |
6144 | ||
d67eb5f4 Z |
6145 | /* |
6146 | =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block | |
6147 | ||
6148 | Constructs, checks, and returns an op tree expressing a loop. This is | |
6149 | only a loop in the control flow through the op tree; it does not have | |
6150 | the heavyweight loop structure that allows exiting the loop by C<last> | |
6151 | and suchlike. I<flags> gives the eight bits of C<op_flags> for the | |
6152 | top-level op, except that some bits will be set automatically as required. | |
6153 | I<expr> supplies the expression controlling loop iteration, and I<block> | |
6154 | supplies the body of the loop; they are consumed by this function and | |
6155 | become part of the constructed op tree. I<debuggable> is currently | |
6156 | unused and should always be 1. | |
6157 | ||
6158 | =cut | |
6159 | */ | |
6160 | ||
79072805 | 6161 | OP * |
864dbfa3 | 6162 | Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block) |
79072805 | 6163 | { |
97aff369 | 6164 | dVAR; |
463ee0b2 | 6165 | OP* listop; |
11343788 | 6166 | OP* o; |
73d840c0 | 6167 | const bool once = block && block->op_flags & OPf_SPECIAL && |
a0d0e21e | 6168 | (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL); |
46c461b5 AL |
6169 | |
6170 | PERL_UNUSED_ARG(debuggable); | |
93a17b20 | 6171 | |
463ee0b2 LW |
6172 | if (expr) { |
6173 | if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv)) | |
6174 | return block; /* do {} while 0 does once */ | |
114c60ec BG |
6175 | if (expr->op_type == OP_READLINE |
6176 | || expr->op_type == OP_READDIR | |
6177 | || expr->op_type == OP_GLOB | |
8ae39f60 | 6178 | || expr->op_type == OP_EACH || expr->op_type == OP_AEACH |
fb73857a | 6179 | || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) { |
774d564b | 6180 | expr = newUNOP(OP_DEFINED, 0, |
54b9620d | 6181 | newASSIGNOP(0, newDEFSVOP(), 0, expr) ); |
55d729e4 | 6182 | } else if (expr->op_flags & OPf_KIDS) { |
46c461b5 AL |
6183 | const OP * const k1 = ((UNOP*)expr)->op_first; |
6184 | const OP * const k2 = k1 ? k1->op_sibling : NULL; | |
55d729e4 | 6185 | switch (expr->op_type) { |
1c846c1f | 6186 | case OP_NULL: |
114c60ec | 6187 | if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR) |
55d729e4 | 6188 | && (k2->op_flags & OPf_STACKED) |
1c846c1f | 6189 | && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR)) |
55d729e4 | 6190 | expr = newUNOP(OP_DEFINED, 0, expr); |
1c846c1f | 6191 | break; |
55d729e4 GS |
6192 | |
6193 | case OP_SASSIGN: | |
06dc7ac6 | 6194 | if (k1 && (k1->op_type == OP_READDIR |
55d729e4 | 6195 | || k1->op_type == OP_GLOB |
6531c3e6 | 6196 | || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB) |
459b64da HY |
6197 | || k1->op_type == OP_EACH |
6198 | || k1->op_type == OP_AEACH)) | |
55d729e4 GS |
6199 | expr = newUNOP(OP_DEFINED, 0, expr); |
6200 | break; | |
6201 | } | |
774d564b | 6202 | } |
463ee0b2 | 6203 | } |
93a17b20 | 6204 | |
2fcb4757 | 6205 | /* if block is null, the next op_append_elem() would put UNSTACK, a scalar |
e1548254 RGS |
6206 | * op, in listop. This is wrong. [perl #27024] */ |
6207 | if (!block) | |
6208 | block = newOP(OP_NULL, 0); | |
2fcb4757 | 6209 | listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0)); |
883ffac3 | 6210 | o = new_logop(OP_AND, 0, &expr, &listop); |
463ee0b2 | 6211 | |
883ffac3 CS |
6212 | if (listop) |
6213 | ((LISTOP*)listop)->op_last->op_next = LINKLIST(o); | |
79072805 | 6214 | |
11343788 MB |
6215 | if (once && o != listop) |
6216 | o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other; | |
79072805 | 6217 | |
11343788 MB |
6218 | if (o == listop) |
6219 | o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */ | |
748a9306 | 6220 | |
11343788 | 6221 | o->op_flags |= flags; |
3ad73efd | 6222 | o = op_scope(o); |
11343788 MB |
6223 | o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/ |
6224 | return o; | |
79072805 LW |
6225 | } |
6226 | ||
d67eb5f4 | 6227 | /* |
94bf0465 | 6228 | =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my |
d67eb5f4 Z |
6229 | |
6230 | Constructs, checks, and returns an op tree expressing a C<while> loop. | |
6231 | This is a heavyweight loop, with structure that allows exiting the loop | |
6232 | by C<last> and suchlike. | |
6233 | ||
6234 | I<loop> is an optional preconstructed C<enterloop> op to use in the | |
6235 | loop; if it is null then a suitable op will be constructed automatically. | |
6236 | I<expr> supplies the loop's controlling expression. I<block> supplies the | |
6237 | main body of the loop, and I<cont> optionally supplies a C<continue> block | |
6238 | that operates as a second half of the body. All of these optree inputs | |
6239 | are consumed by this function and become part of the constructed op tree. | |
6240 | ||
6241 | I<flags> gives the eight bits of C<op_flags> for the C<leaveloop> | |
6242 | op and, shifted up eight bits, the eight bits of C<op_private> for | |
6243 | the C<leaveloop> op, except that (in both cases) some bits will be set | |
6244 | automatically. I<debuggable> is currently unused and should always be 1. | |
94bf0465 | 6245 | I<has_my> can be supplied as true to force the |
d67eb5f4 Z |
6246 | loop body to be enclosed in its own scope. |
6247 | ||
6248 | =cut | |
6249 | */ | |
6250 | ||
79072805 | 6251 | OP * |
94bf0465 Z |
6252 | Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, |
6253 | OP *expr, OP *block, OP *cont, I32 has_my) | |
79072805 | 6254 | { |
27da23d5 | 6255 | dVAR; |
79072805 | 6256 | OP *redo; |
c445ea15 | 6257 | OP *next = NULL; |
79072805 | 6258 | OP *listop; |
11343788 | 6259 | OP *o; |
1ba6ee2b | 6260 | U8 loopflags = 0; |
46c461b5 AL |
6261 | |
6262 | PERL_UNUSED_ARG(debuggable); | |
79072805 | 6263 | |
2d03de9c | 6264 | if (expr) { |
114c60ec BG |
6265 | if (expr->op_type == OP_READLINE |
6266 | || expr->op_type == OP_READDIR | |
6267 | || expr->op_type == OP_GLOB | |
8ae39f60 | 6268 | || expr->op_type == OP_EACH || expr->op_type == OP_AEACH |
2d03de9c AL |
6269 | || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) { |
6270 | expr = newUNOP(OP_DEFINED, 0, | |
6271 | newASSIGNOP(0, newDEFSVOP(), 0, expr) ); | |
6272 | } else if (expr->op_flags & OPf_KIDS) { | |
6273 | const OP * const k1 = ((UNOP*)expr)->op_first; | |
6274 | const OP * const k2 = (k1) ? k1->op_sibling : NULL; | |
6275 | switch (expr->op_type) { | |
6276 | case OP_NULL: | |
114c60ec | 6277 | if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR) |
2d03de9c AL |
6278 | && (k2->op_flags & OPf_STACKED) |
6279 | && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR)) | |
6280 | expr = newUNOP(OP_DEFINED, 0, expr); | |
6281 | break; | |
55d729e4 | 6282 | |
2d03de9c | 6283 | case OP_SASSIGN: |
72c8de1a | 6284 | if (k1 && (k1->op_type == OP_READDIR |
2d03de9c AL |
6285 | || k1->op_type == OP_GLOB |
6286 | || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB) | |
459b64da HY |
6287 | || k1->op_type == OP_EACH |
6288 | || k1->op_type == OP_AEACH)) | |
2d03de9c AL |
6289 | expr = newUNOP(OP_DEFINED, 0, expr); |
6290 | break; | |
6291 | } | |
55d729e4 | 6292 | } |
748a9306 | 6293 | } |
79072805 LW |
6294 | |
6295 | if (!block) | |
6296 | block = newOP(OP_NULL, 0); | |
a034e688 | 6297 | else if (cont || has_my) { |
3ad73efd | 6298 | block = op_scope(block); |
87246558 | 6299 | } |
79072805 | 6300 | |
1ba6ee2b | 6301 | if (cont) { |
79072805 | 6302 | next = LINKLIST(cont); |
1ba6ee2b | 6303 | } |
fb73857a | 6304 | if (expr) { |
551405c4 | 6305 | OP * const unstack = newOP(OP_UNSTACK, 0); |
85538317 GS |
6306 | if (!next) |
6307 | next = unstack; | |
2fcb4757 | 6308 | cont = op_append_elem(OP_LINESEQ, cont, unstack); |
fb73857a | 6309 | } |
79072805 | 6310 | |
ce3e5c45 | 6311 | assert(block); |
2fcb4757 | 6312 | listop = op_append_list(OP_LINESEQ, block, cont); |
ce3e5c45 | 6313 | assert(listop); |
79072805 LW |
6314 | redo = LINKLIST(listop); |
6315 | ||
6316 | if (expr) { | |
883ffac3 CS |
6317 | scalar(listop); |
6318 | o = new_logop(OP_AND, 0, &expr, &listop); | |
11343788 | 6319 | if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) { |
463ee0b2 | 6320 | op_free((OP*)loop); |
317f3b66 | 6321 | return expr; /* listop already freed by new_logop */ |
463ee0b2 | 6322 | } |
883ffac3 | 6323 | if (listop) |
497b47a8 | 6324 | ((LISTOP*)listop)->op_last->op_next = |
883ffac3 | 6325 | (o == listop ? redo : LINKLIST(o)); |
79072805 LW |
6326 | } |
6327 | else | |
11343788 | 6328 | o = listop; |
79072805 LW |
6329 | |
6330 | if (!loop) { | |
b7dc083c | 6331 | NewOp(1101,loop,1,LOOP); |
79072805 | 6332 | loop->op_type = OP_ENTERLOOP; |
22c35a8c | 6333 | loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP]; |
79072805 LW |
6334 | loop->op_private = 0; |
6335 | loop->op_next = (OP*)loop; | |
6336 | } | |
6337 | ||
11343788 | 6338 | o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o); |
79072805 LW |
6339 | |
6340 | loop->op_redoop = redo; | |
11343788 | 6341 | loop->op_lastop = o; |
1ba6ee2b | 6342 | o->op_private |= loopflags; |
79072805 LW |
6343 | |
6344 | if (next) | |
6345 | loop->op_nextop = next; | |
6346 | else | |
11343788 | 6347 | loop->op_nextop = o; |
79072805 | 6348 | |
11343788 MB |
6349 | o->op_flags |= flags; |
6350 | o->op_private |= (flags >> 8); | |
6351 | return o; | |
79072805 LW |
6352 | } |
6353 | ||
d67eb5f4 | 6354 | /* |
94bf0465 | 6355 | =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont |
d67eb5f4 Z |
6356 | |
6357 | Constructs, checks, and returns an op tree expressing a C<foreach> | |
6358 | loop (iteration through a list of values). This is a heavyweight loop, | |
6359 | with structure that allows exiting the loop by C<last> and suchlike. | |
6360 | ||
6361 | I<sv> optionally supplies the variable that will be aliased to each | |
6362 | item in turn; if null, it defaults to C<$_> (either lexical or global). | |
6363 | I<expr> supplies the list of values to iterate over. I<block> supplies | |
6364 | the main body of the loop, and I<cont> optionally supplies a C<continue> | |
6365 | block that operates as a second half of the body. All of these optree | |
6366 | inputs are consumed by this function and become part of the constructed | |
6367 | op tree. | |
6368 | ||
6369 | I<flags> gives the eight bits of C<op_flags> for the C<leaveloop> | |
6370 | op and, shifted up eight bits, the eight bits of C<op_private> for | |
6371 | the C<leaveloop> op, except that (in both cases) some bits will be set | |
94bf0465 | 6372 | automatically. |
d67eb5f4 Z |
6373 | |
6374 | =cut | |
6375 | */ | |
6376 | ||
79072805 | 6377 | OP * |
94bf0465 | 6378 | Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont) |
79072805 | 6379 | { |
27da23d5 | 6380 | dVAR; |
79072805 | 6381 | LOOP *loop; |
fb73857a | 6382 | OP *wop; |
4bbc6d12 | 6383 | PADOFFSET padoff = 0; |
4633a7c4 | 6384 | I32 iterflags = 0; |
241416b8 | 6385 | I32 iterpflags = 0; |
d4c19fe8 | 6386 | OP *madsv = NULL; |
79072805 | 6387 | |
7918f24d NC |
6388 | PERL_ARGS_ASSERT_NEWFOROP; |
6389 | ||
79072805 | 6390 | if (sv) { |
85e6fe83 | 6391 | if (sv->op_type == OP_RV2SV) { /* symbol table variable */ |
241416b8 | 6392 | iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */ |
748a9306 | 6393 | sv->op_type = OP_RV2GV; |
22c35a8c | 6394 | sv->op_ppaddr = PL_ppaddr[OP_RV2GV]; |
0be9a6bb RH |
6395 | |
6396 | /* The op_type check is needed to prevent a possible segfault | |
6397 | * if the loop variable is undeclared and 'strict vars' is in | |
6398 | * effect. This is illegal but is nonetheless parsed, so we | |
6399 | * may reach this point with an OP_CONST where we're expecting | |
6400 | * an OP_GV. | |
6401 | */ | |
6402 | if (cUNOPx(sv)->op_first->op_type == OP_GV | |
6403 | && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv) | |
0d863452 | 6404 | iterpflags |= OPpITER_DEF; |
79072805 | 6405 | } |
85e6fe83 | 6406 | else if (sv->op_type == OP_PADSV) { /* private variable */ |
241416b8 | 6407 | iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */ |
85e6fe83 | 6408 | padoff = sv->op_targ; |
eb8433b7 NC |
6409 | if (PL_madskills) |
6410 | madsv = sv; | |
6411 | else { | |
6412 | sv->op_targ = 0; | |
6413 | op_free(sv); | |
6414 | } | |
5f66b61c | 6415 | sv = NULL; |
85e6fe83 | 6416 | } |
79072805 | 6417 | else |
cea2e8a9 | 6418 | Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]); |
f8503592 NC |
6419 | if (padoff) { |
6420 | SV *const namesv = PAD_COMPNAME_SV(padoff); | |
6421 | STRLEN len; | |
6422 | const char *const name = SvPV_const(namesv, len); | |
6423 | ||
6424 | if (len == 2 && name[0] == '$' && name[1] == '_') | |
6425 | iterpflags |= OPpITER_DEF; | |
6426 | } | |
79072805 LW |
6427 | } |
6428 | else { | |
cc76b5cc | 6429 | const PADOFFSET offset = pad_findmy_pvs("$_", 0); |
00b1698f | 6430 | if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) { |
aabe9514 RGS |
6431 | sv = newGVOP(OP_GV, 0, PL_defgv); |
6432 | } | |
6433 | else { | |
6434 | padoff = offset; | |
aabe9514 | 6435 | } |
0d863452 | 6436 | iterpflags |= OPpITER_DEF; |
79072805 | 6437 | } |
5f05dabc | 6438 | if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) { |
3ad73efd | 6439 | expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART); |
4633a7c4 LW |
6440 | iterflags |= OPf_STACKED; |
6441 | } | |
89ea2908 GA |
6442 | else if (expr->op_type == OP_NULL && |
6443 | (expr->op_flags & OPf_KIDS) && | |
6444 | ((BINOP*)expr)->op_first->op_type == OP_FLOP) | |
6445 | { | |
6446 | /* Basically turn for($x..$y) into the same as for($x,$y), but we | |
6447 | * set the STACKED flag to indicate that these values are to be | |
08bf00be | 6448 | * treated as min/max values by 'pp_enteriter'. |
89ea2908 | 6449 | */ |
d4c19fe8 | 6450 | const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first; |
551405c4 | 6451 | LOGOP* const range = (LOGOP*) flip->op_first; |
66a1b24b AL |
6452 | OP* const left = range->op_first; |
6453 | OP* const right = left->op_sibling; | |
5152d7c7 | 6454 | LISTOP* listop; |
89ea2908 GA |
6455 | |
6456 | range->op_flags &= ~OPf_KIDS; | |
5f66b61c | 6457 | range->op_first = NULL; |
89ea2908 | 6458 | |
5152d7c7 | 6459 | listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right); |
1a67a97c SM |
6460 | listop->op_first->op_next = range->op_next; |
6461 | left->op_next = range->op_other; | |
5152d7c7 GS |
6462 | right->op_next = (OP*)listop; |
6463 | listop->op_next = listop->op_first; | |
89ea2908 | 6464 | |
eb8433b7 NC |
6465 | #ifdef PERL_MAD |
6466 | op_getmad(expr,(OP*)listop,'O'); | |
6467 | #else | |
89ea2908 | 6468 | op_free(expr); |
eb8433b7 | 6469 | #endif |
5152d7c7 | 6470 | expr = (OP*)(listop); |
93c66552 | 6471 | op_null(expr); |
89ea2908 GA |
6472 | iterflags |= OPf_STACKED; |
6473 | } | |
6474 | else { | |
3ad73efd | 6475 | expr = op_lvalue(force_list(expr), OP_GREPSTART); |
89ea2908 GA |
6476 | } |
6477 | ||
4633a7c4 | 6478 | loop = (LOOP*)list(convert(OP_ENTERITER, iterflags, |
2fcb4757 | 6479 | op_append_elem(OP_LIST, expr, scalar(sv)))); |
85e6fe83 | 6480 | assert(!loop->op_next); |
241416b8 | 6481 | /* for my $x () sets OPpLVAL_INTRO; |
14f338dc | 6482 | * for our $x () sets OPpOUR_INTRO */ |
c5661c80 | 6483 | loop->op_private = (U8)iterpflags; |
b448305b FC |
6484 | if (loop->op_slabbed |
6485 | && DIFF(loop, OpSLOT(loop)->opslot_next) | |
8be227ab | 6486 | < SIZE_TO_PSIZE(sizeof(LOOP))) |
155aba94 GS |
6487 | { |
6488 | LOOP *tmp; | |
6489 | NewOp(1234,tmp,1,LOOP); | |
bd5f3bc4 | 6490 | Copy(loop,tmp,1,LISTOP); |
bfafaa29 | 6491 | S_op_destroy(aTHX_ (OP*)loop); |
155aba94 GS |
6492 | loop = tmp; |
6493 | } | |
b448305b FC |
6494 | else if (!loop->op_slabbed) |
6495 | loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP)); | |
85e6fe83 | 6496 | loop->op_targ = padoff; |
94bf0465 | 6497 | wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0); |
eb8433b7 NC |
6498 | if (madsv) |
6499 | op_getmad(madsv, (OP*)loop, 'v'); | |
eae48c89 | 6500 | return wop; |
79072805 LW |
6501 | } |
6502 | ||
d67eb5f4 Z |
6503 | /* |
6504 | =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label | |
6505 | ||
6506 | Constructs, checks, and returns a loop-exiting op (such as C<goto> | |
6507 | or C<last>). I<type> is the opcode. I<label> supplies the parameter | |
6508 | determining the target of the op; it is consumed by this function and | |
d001e19d | 6509 | becomes part of the constructed op tree. |
d67eb5f4 Z |
6510 | |
6511 | =cut | |
6512 | */ | |
6513 | ||
8990e307 | 6514 | OP* |
864dbfa3 | 6515 | Perl_newLOOPEX(pTHX_ I32 type, OP *label) |
8990e307 | 6516 | { |
97aff369 | 6517 | dVAR; |
1ec4f607 | 6518 | OP *o = NULL; |
2d8e6c8d | 6519 | |
7918f24d NC |
6520 | PERL_ARGS_ASSERT_NEWLOOPEX; |
6521 | ||
e69777c1 GG |
6522 | assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP); |
6523 | ||
3532f34a | 6524 | if (type != OP_GOTO) { |
cdaebead | 6525 | /* "last()" means "last" */ |
1f039d60 | 6526 | if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS)) { |
cdaebead | 6527 | o = newOP(type, OPf_SPECIAL); |
cdaebead | 6528 | } |
8990e307 LW |
6529 | } |
6530 | else { | |
e3aba57a RGS |
6531 | /* Check whether it's going to be a goto &function */ |
6532 | if (label->op_type == OP_ENTERSUB | |
6533 | && !(label->op_flags & OPf_STACKED)) | |
3ad73efd | 6534 | label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN)); |
1f039d60 FC |
6535 | } |
6536 | ||
6537 | /* Check for a constant argument */ | |
6538 | if (label->op_type == OP_CONST) { | |
3532f34a FC |
6539 | SV * const sv = ((SVOP *)label)->op_sv; |
6540 | STRLEN l; | |
6541 | const char *s = SvPV_const(sv,l); | |
1f039d60 FC |
6542 | if (l == strlen(s)) { |
6543 | o = newPVOP(type, | |
6544 | SvUTF8(((SVOP*)label)->op_sv), | |
6545 | savesharedpv( | |
6546 | SvPV_nolen_const(((SVOP*)label)->op_sv))); | |
1ec4f607 FC |
6547 | } |
6548 | } | |
6549 | ||
6550 | /* If we have already created an op, we do not need the label. */ | |
6551 | if (o) | |
1f039d60 FC |
6552 | #ifdef PERL_MAD |
6553 | op_getmad(label,o,'L'); | |
6554 | #else | |
6555 | op_free(label); | |
6556 | #endif | |
1ec4f607 | 6557 | else o = newUNOP(type, OPf_STACKED, label); |
1f039d60 | 6558 | |
3280af22 | 6559 | PL_hints |= HINT_BLOCK_SCOPE; |
11343788 | 6560 | return o; |
8990e307 LW |
6561 | } |
6562 | ||
0d863452 RH |
6563 | /* if the condition is a literal array or hash |
6564 | (or @{ ... } etc), make a reference to it. | |
6565 | */ | |
6566 | STATIC OP * | |
6567 | S_ref_array_or_hash(pTHX_ OP *cond) | |
6568 | { | |
6569 | if (cond | |
6570 | && (cond->op_type == OP_RV2AV | |
6571 | || cond->op_type == OP_PADAV | |
6572 | || cond->op_type == OP_RV2HV | |
6573 | || cond->op_type == OP_PADHV)) | |
6574 | ||
3ad73efd | 6575 | return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN)); |
0d863452 | 6576 | |
329a333e DL |
6577 | else if(cond |
6578 | && (cond->op_type == OP_ASLICE | |
6579 | || cond->op_type == OP_HSLICE)) { | |
6580 | ||
6581 | /* anonlist now needs a list from this op, was previously used in | |
6582 | * scalar context */ | |
6583 | cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF); | |
6584 | cond->op_flags |= OPf_WANT_LIST; | |
6585 | ||
3ad73efd | 6586 | return newANONLIST(op_lvalue(cond, OP_ANONLIST)); |
329a333e DL |
6587 | } |
6588 | ||
0d863452 RH |
6589 | else |
6590 | return cond; | |
6591 | } | |
6592 | ||
6593 | /* These construct the optree fragments representing given() | |
6594 | and when() blocks. | |
6595 | ||
6596 | entergiven and enterwhen are LOGOPs; the op_other pointer | |
6597 | points up to the associated leave op. We need this so we | |
6598 | can put it in the context and make break/continue work. | |
6599 | (Also, of course, pp_enterwhen will jump straight to | |
6600 | op_other if the match fails.) | |
6601 | */ | |
6602 | ||
4136a0f7 | 6603 | STATIC OP * |
0d863452 RH |
6604 | S_newGIVWHENOP(pTHX_ OP *cond, OP *block, |
6605 | I32 enter_opcode, I32 leave_opcode, | |
6606 | PADOFFSET entertarg) | |
6607 | { | |
97aff369 | 6608 | dVAR; |
0d863452 RH |
6609 | LOGOP *enterop; |
6610 | OP *o; | |
6611 | ||
7918f24d NC |
6612 | PERL_ARGS_ASSERT_NEWGIVWHENOP; |
6613 | ||
0d863452 | 6614 | NewOp(1101, enterop, 1, LOGOP); |
61a59f30 | 6615 | enterop->op_type = (Optype)enter_opcode; |
0d863452 RH |
6616 | enterop->op_ppaddr = PL_ppaddr[enter_opcode]; |
6617 | enterop->op_flags = (U8) OPf_KIDS; | |
6618 | enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg); | |
6619 | enterop->op_private = 0; | |
6620 | ||
6621 | o = newUNOP(leave_opcode, 0, (OP *) enterop); | |
6622 | ||
6623 | if (cond) { | |
6624 | enterop->op_first = scalar(cond); | |
6625 | cond->op_sibling = block; | |
6626 | ||
6627 | o->op_next = LINKLIST(cond); | |
6628 | cond->op_next = (OP *) enterop; | |
6629 | } | |
6630 | else { | |
6631 | /* This is a default {} block */ | |
6632 | enterop->op_first = block; | |
6633 | enterop->op_flags |= OPf_SPECIAL; | |
fc7debfb | 6634 | o ->op_flags |= OPf_SPECIAL; |
0d863452 RH |
6635 | |
6636 | o->op_next = (OP *) enterop; | |
6637 | } | |
6638 | ||
6639 | CHECKOP(enter_opcode, enterop); /* Currently does nothing, since | |
6640 | entergiven and enterwhen both | |
6641 | use ck_null() */ | |
6642 | ||
6643 | enterop->op_next = LINKLIST(block); | |
6644 | block->op_next = enterop->op_other = o; | |
6645 | ||
6646 | return o; | |
6647 | } | |
6648 | ||
6649 | /* Does this look like a boolean operation? For these purposes | |
6650 | a boolean operation is: | |
6651 | - a subroutine call [*] | |
6652 | - a logical connective | |
6653 | - a comparison operator | |
6654 | - a filetest operator, with the exception of -s -M -A -C | |
6655 | - defined(), exists() or eof() | |
6656 | - /$re/ or $foo =~ /$re/ | |
6657 | ||
6658 | [*] possibly surprising | |
6659 | */ | |
4136a0f7 | 6660 | STATIC bool |
ef519e13 | 6661 | S_looks_like_bool(pTHX_ const OP *o) |
0d863452 | 6662 | { |
97aff369 | 6663 | dVAR; |
7918f24d NC |
6664 | |
6665 | PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL; | |
6666 | ||
0d863452 RH |
6667 | switch(o->op_type) { |
6668 | case OP_OR: | |
f92e1a16 | 6669 | case OP_DOR: |
0d863452 RH |
6670 | return looks_like_bool(cLOGOPo->op_first); |
6671 | ||
6672 | case OP_AND: | |
6673 | return ( | |
6674 | looks_like_bool(cLOGOPo->op_first) | |
6675 | && looks_like_bool(cLOGOPo->op_first->op_sibling)); | |
6676 | ||
1e1d4b91 | 6677 | case OP_NULL: |
08fe1c44 | 6678 | case OP_SCALAR: |
1e1d4b91 JJ |
6679 | return ( |
6680 | o->op_flags & OPf_KIDS | |
6681 | && looks_like_bool(cUNOPo->op_first)); | |
6682 | ||
0d863452 RH |
6683 | case OP_ENTERSUB: |
6684 | ||
6685 | case OP_NOT: case OP_XOR: | |
0d863452 RH |
6686 | |
6687 | case OP_EQ: case OP_NE: case OP_LT: | |
6688 | case OP_GT: case OP_LE: case OP_GE: | |
6689 | ||
6690 | case OP_I_EQ: case OP_I_NE: case OP_I_LT: | |
6691 | case OP_I_GT: case OP_I_LE: case OP_I_GE: | |
6692 | ||
6693 | case OP_SEQ: case OP_SNE: case OP_SLT: | |
6694 | case OP_SGT: case OP_SLE: case OP_SGE: | |
6695 | ||
6696 | case OP_SMARTMATCH: | |
6697 | ||
6698 | case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC: | |
6699 | case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC: | |
6700 | case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED: | |
6701 | case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR: | |
6702 | case OP_FTBLK: case OP_FTFILE: case OP_FTDIR: | |
6703 | case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID: | |
6704 | case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY: | |
6705 | case OP_FTTEXT: case OP_FTBINARY: | |
6706 | ||
6707 | case OP_DEFINED: case OP_EXISTS: | |
6708 | case OP_MATCH: case OP_EOF: | |
6709 | ||
f118ea0d RGS |
6710 | case OP_FLOP: |
6711 | ||
0d863452 RH |
6712 | return TRUE; |
6713 | ||
6714 | case OP_CONST: | |
6715 | /* Detect comparisons that have been optimized away */ | |
6716 | if (cSVOPo->op_sv == &PL_sv_yes | |
6717 | || cSVOPo->op_sv == &PL_sv_no) | |
6718 | ||
6719 | return TRUE; | |
6e03d743 RGS |
6720 | else |
6721 | return FALSE; | |
6e03d743 | 6722 | |
0d863452 RH |
6723 | /* FALL THROUGH */ |
6724 | default: | |
6725 | return FALSE; | |
6726 | } | |
6727 | } | |
6728 | ||
d67eb5f4 Z |
6729 | /* |
6730 | =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off | |
6731 | ||
6732 | Constructs, checks, and returns an op tree expressing a C<given> block. | |
6733 | I<cond> supplies the expression that will be locally assigned to a lexical | |
6734 | variable, and I<block> supplies the body of the C<given> construct; they | |
6735 | are consumed by this function and become part of the constructed op tree. | |
6736 | I<defsv_off> is the pad offset of the scalar lexical variable that will | |
a8bd1c84 | 6737 | be affected. If it is 0, the global $_ will be used. |
d67eb5f4 Z |
6738 | |
6739 | =cut | |
6740 | */ | |
6741 | ||
0d863452 RH |
6742 | OP * |
6743 | Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off) | |
6744 | { | |
97aff369 | 6745 | dVAR; |
7918f24d | 6746 | PERL_ARGS_ASSERT_NEWGIVENOP; |
0d863452 RH |
6747 | return newGIVWHENOP( |
6748 | ref_array_or_hash(cond), | |
6749 | block, | |
6750 | OP_ENTERGIVEN, OP_LEAVEGIVEN, | |
6751 | defsv_off); | |
6752 | } | |
6753 | ||
d67eb5f4 Z |
6754 | /* |
6755 | =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block | |
6756 | ||
6757 | Constructs, checks, and returns an op tree expressing a C<when> block. | |
6758 | I<cond> supplies the test expression, and I<block> supplies the block | |
6759 | that will be executed if the test evaluates to true; they are consumed | |
6760 | by this function and become part of the constructed op tree. I<cond> | |
6761 | will be interpreted DWIMically, often as a comparison against C<$_>, | |
6762 | and may be null to generate a C<default> block. | |
6763 | ||
6764 | =cut | |
6765 | */ | |
6766 | ||
0d863452 RH |
6767 | OP * |
6768 | Perl_newWHENOP(pTHX_ OP *cond, OP *block) | |
6769 | { | |
ef519e13 | 6770 | const bool cond_llb = (!cond || looks_like_bool(cond)); |
0d863452 RH |
6771 | OP *cond_op; |
6772 | ||
7918f24d NC |
6773 | PERL_ARGS_ASSERT_NEWWHENOP; |
6774 | ||
0d863452 RH |
6775 | if (cond_llb) |
6776 | cond_op = cond; | |
6777 | else { | |
6778 | cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL, | |
6779 | newDEFSVOP(), | |
6780 | scalar(ref_array_or_hash(cond))); | |
6781 | } | |
6782 | ||
c08f093b | 6783 | return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0); |
0d863452 RH |
6784 | } |
6785 | ||
3fe9a6f1 | 6786 | void |
dab1c735 BF |
6787 | Perl_cv_ckproto_len_flags(pTHX_ const CV *cv, const GV *gv, const char *p, |
6788 | const STRLEN len, const U32 flags) | |
cbf82dd0 | 6789 | { |
7a2f0b06 PM |
6790 | SV *name = NULL, *msg; |
6791 | const char * cvp = SvROK(cv) ? "" : CvPROTO(cv); | |
6792 | STRLEN clen = CvPROTOLEN(cv), plen = len; | |
8fa6a409 | 6793 | |
dab1c735 | 6794 | PERL_ARGS_ASSERT_CV_CKPROTO_LEN_FLAGS; |
8fa6a409 | 6795 | |
38d27505 | 6796 | if (p == NULL && cvp == NULL) |
7a2f0b06 | 6797 | return; |
3fe9a6f1 | 6798 | |
38d27505 | 6799 | if (!ckWARN_d(WARN_PROTOTYPE)) |
7a2f0b06 PM |
6800 | return; |
6801 | ||
6802 | if (p && cvp) { | |
6803 | p = S_strip_spaces(aTHX_ p, &plen); | |
6804 | cvp = S_strip_spaces(aTHX_ cvp, &clen); | |
6805 | if ((flags & SVf_UTF8) == SvUTF8(cv)) { | |
6806 | if (plen == clen && memEQ(cvp, p, plen)) | |
6807 | return; | |
6808 | } else { | |
6809 | if (flags & SVf_UTF8) { | |
6810 | if (bytes_cmp_utf8((const U8 *)cvp, clen, (const U8 *)p, plen) == 0) | |
6811 | return; | |
6812 | } | |
6813 | else { | |
6814 | if (bytes_cmp_utf8((const U8 *)p, plen, (const U8 *)cvp, clen) == 0) | |
6815 | return; | |
6816 | } | |
105ff74c | 6817 | } |
3fe9a6f1 | 6818 | } |
7a2f0b06 PM |
6819 | |
6820 | msg = sv_newmortal(); | |
6821 | ||
6822 | if (gv) | |
6823 | { | |
6824 | if (isGV(gv)) | |
6825 | gv_efullname3(name = sv_newmortal(), gv, NULL); | |
6826 | else if (SvPOK(gv) && *SvPVX((SV *)gv) == '&') | |
6827 | name = newSVpvn_flags(SvPVX((SV *)gv)+1, SvCUR(gv)-1, SvUTF8(gv)|SVs_TEMP); | |
6828 | else name = (SV *)gv; | |
6829 | } | |
6830 | sv_setpvs(msg, "Prototype mismatch:"); | |
6831 | if (name) | |
6832 | Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name)); | |
6833 | if (cvp) | |
b17a0679 FC |
6834 | Perl_sv_catpvf(aTHX_ msg, " (%"UTF8f")", |
6835 | UTF8fARG(SvUTF8(cv),clen,cvp) | |
7a2f0b06 PM |
6836 | ); |
6837 | else | |
6838 | sv_catpvs(msg, ": none"); | |
6839 | sv_catpvs(msg, " vs "); | |
6840 | if (p) | |
b17a0679 | 6841 | Perl_sv_catpvf(aTHX_ msg, "(%"UTF8f")", UTF8fARG(flags & SVf_UTF8,len,p)); |
7a2f0b06 PM |
6842 | else |
6843 | sv_catpvs(msg, "none"); | |
6844 | Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg)); | |
3fe9a6f1 | 6845 | } |
6846 | ||
35f1c1c7 | 6847 | static void const_sv_xsub(pTHX_ CV* cv); |
6f1b3ab0 | 6848 | static void const_av_xsub(pTHX_ CV* cv); |
35f1c1c7 | 6849 | |
beab0874 | 6850 | /* |
ccfc67b7 JH |
6851 | |
6852 | =head1 Optree Manipulation Functions | |
6853 | ||
beab0874 JT |
6854 | =for apidoc cv_const_sv |
6855 | ||
6856 | If C<cv> is a constant sub eligible for inlining. returns the constant | |
6857 | value returned by the sub. Otherwise, returns NULL. | |
6858 | ||
6859 | Constant subs can be created with C<newCONSTSUB> or as described in | |
6860 | L<perlsub/"Constant Functions">. | |
6861 | ||
6862 | =cut | |
6863 | */ | |
760ac839 | 6864 | SV * |
d45f5b30 | 6865 | Perl_cv_const_sv(pTHX_ const CV *const cv) |
760ac839 | 6866 | { |
6f1b3ab0 | 6867 | SV *sv; |
96a5add6 | 6868 | PERL_UNUSED_CONTEXT; |
5069cc75 NC |
6869 | if (!cv) |
6870 | return NULL; | |
6871 | if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM)) | |
6872 | return NULL; | |
6f1b3ab0 FC |
6873 | sv = CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL; |
6874 | if (sv && SvTYPE(sv) == SVt_PVAV) return NULL; | |
6875 | return sv; | |
fe5e78ed | 6876 | } |
760ac839 | 6877 | |
f815dc14 FC |
6878 | SV * |
6879 | Perl_cv_const_sv_or_av(pTHX_ const CV * const cv) | |
6880 | { | |
6881 | PERL_UNUSED_CONTEXT; | |
6882 | if (!cv) | |
6883 | return NULL; | |
6884 | assert (SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM); | |
6885 | return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL; | |
6886 | } | |
6887 | ||
b5c19bd7 | 6888 | /* op_const_sv: examine an optree to determine whether it's in-lineable. |
b5c19bd7 DM |
6889 | */ |
6890 | ||
fe5e78ed | 6891 | SV * |
137da2b0 | 6892 | Perl_op_const_sv(pTHX_ const OP *o) |
fe5e78ed | 6893 | { |
97aff369 | 6894 | dVAR; |
a0714e2c | 6895 | SV *sv = NULL; |
fe5e78ed | 6896 | |
c631f32b GG |
6897 | if (PL_madskills) |
6898 | return NULL; | |
6899 | ||
0f79a09d | 6900 | if (!o) |
a0714e2c | 6901 | return NULL; |
1c846c1f NIS |
6902 | |
6903 | if (o->op_type == OP_LINESEQ && cLISTOPo->op_first) | |
fe5e78ed GS |
6904 | o = cLISTOPo->op_first->op_sibling; |
6905 | ||
6906 | for (; o; o = o->op_next) { | |
890ce7af | 6907 | const OPCODE type = o->op_type; |
fe5e78ed | 6908 | |
1c846c1f | 6909 | if (sv && o->op_next == o) |
fe5e78ed | 6910 | return sv; |
e576b457 | 6911 | if (o->op_next != o) { |
dbe92b04 FC |
6912 | if (type == OP_NEXTSTATE |
6913 | || (type == OP_NULL && !(o->op_flags & OPf_KIDS)) | |
6914 | || type == OP_PUSHMARK) | |
e576b457 JT |
6915 | continue; |
6916 | if (type == OP_DBSTATE) | |
6917 | continue; | |
6918 | } | |
54310121 | 6919 | if (type == OP_LEAVESUB || type == OP_RETURN) |
6920 | break; | |
6921 | if (sv) | |
a0714e2c | 6922 | return NULL; |
7766f137 | 6923 | if (type == OP_CONST && cSVOPo->op_sv) |
5dc0d613 | 6924 | sv = cSVOPo->op_sv; |
b5c19bd7 | 6925 | else { |
a0714e2c | 6926 | return NULL; |
b5c19bd7 | 6927 | } |
760ac839 LW |
6928 | } |
6929 | return sv; | |
6930 | } | |
6931 | ||
2b141370 FC |
6932 | static bool |
6933 | S_already_defined(pTHX_ CV *const cv, OP * const block, OP * const o, | |
6934 | PADNAME * const name, SV ** const const_svp) | |
6935 | { | |
6936 | assert (cv); | |
6937 | assert (o || name); | |
6938 | assert (const_svp); | |
6939 | if ((!block | |
6940 | #ifdef PERL_MAD | |
6941 | || block->op_type == OP_NULL | |
6942 | #endif | |
6943 | )) { | |
6944 | if (CvFLAGS(PL_compcv)) { | |
6945 | /* might have had built-in attrs applied */ | |
6946 | const bool pureperl = !CvISXSUB(cv) && CvROOT(cv); | |
6947 | if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl | |
6948 | && ckWARN(WARN_MISC)) | |
6949 | { | |
6950 | /* protect against fatal warnings leaking compcv */ | |
6951 | SAVEFREESV(PL_compcv); | |
6952 | Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined"); | |
6953 | SvREFCNT_inc_simple_void_NN(PL_compcv); | |
6954 | } | |
6955 | CvFLAGS(cv) |= | |
6956 | (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS | |
6957 | & ~(CVf_LVALUE * pureperl)); | |
6958 | } | |
6959 | return FALSE; | |
6960 | } | |
6961 | ||
6962 | /* redundant check for speed: */ | |
6963 | if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) { | |
6964 | const line_t oldline = CopLINE(PL_curcop); | |
6965 | SV *namesv = o | |
6966 | ? cSVOPo->op_sv | |
6967 | : sv_2mortal(newSVpvn_utf8( | |
6968 | PadnamePV(name)+1,PadnameLEN(name)-1, PadnameUTF8(name) | |
6969 | )); | |
6970 | if (PL_parser && PL_parser->copline != NOLINE) | |
6971 | /* This ensures that warnings are reported at the first | |
6972 | line of a redefinition, not the last. */ | |
6973 | CopLINE_set(PL_curcop, PL_parser->copline); | |
d0761305 FC |
6974 | /* protect against fatal warnings leaking compcv */ |
6975 | SAVEFREESV(PL_compcv); | |
2b141370 | 6976 | report_redefined_cv(namesv, cv, const_svp); |
d0761305 | 6977 | SvREFCNT_inc_simple_void_NN(PL_compcv); |
2b141370 FC |
6978 | CopLINE_set(PL_curcop, oldline); |
6979 | } | |
6980 | #ifdef PERL_MAD | |
6981 | if (!PL_minus_c) /* keep old one around for madskills */ | |
6982 | #endif | |
6983 | { | |
6984 | /* (PL_madskills unset in used file.) */ | |
6985 | SvREFCNT_dec(cv); | |
6986 | } | |
6987 | return TRUE; | |
6988 | } | |
6989 | ||
50278755 | 6990 | CV * |
09bef843 SB |
6991 | Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block) |
6992 | { | |
50278755 | 6993 | dVAR; |
50278755 FC |
6994 | CV **spot; |
6995 | SV **svspot; | |
6996 | const char *ps; | |
6997 | STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */ | |
6998 | U32 ps_utf8 = 0; | |
5aaab254 KW |
6999 | CV *cv = NULL; |
7000 | CV *compcv = PL_compcv; | |
50278755 | 7001 | SV *const_sv; |
50278755 | 7002 | PADNAME *name; |
10342479 FC |
7003 | PADOFFSET pax = o->op_targ; |
7004 | CV *outcv = CvOUTSIDE(PL_compcv); | |
a70c2d56 | 7005 | CV *clonee = NULL; |
6d5c2147 | 7006 | HEK *hek = NULL; |
a70c2d56 | 7007 | bool reusable = FALSE; |
50278755 FC |
7008 | |
7009 | PERL_ARGS_ASSERT_NEWMYSUB; | |
7010 | ||
10342479 FC |
7011 | /* Find the pad slot for storing the new sub. |
7012 | We cannot use PL_comppad, as it is the pad owned by the new sub. We | |
7013 | need to look in CvOUTSIDE and find the pad belonging to the enclos- | |
7014 | ing sub. And then we need to dig deeper if this is a lexical from | |
7015 | outside, as in: | |
7016 | my sub foo; sub { sub foo { } } | |
7017 | */ | |
7018 | redo: | |
7019 | name = PadlistNAMESARRAY(CvPADLIST(outcv))[pax]; | |
7020 | if (PadnameOUTER(name) && PARENT_PAD_INDEX(name)) { | |
7021 | pax = PARENT_PAD_INDEX(name); | |
7022 | outcv = CvOUTSIDE(outcv); | |
7023 | assert(outcv); | |
7024 | goto redo; | |
7025 | } | |
2435fbd5 | 7026 | svspot = |
a70c2d56 FC |
7027 | &PadARRAY(PadlistARRAY(CvPADLIST(outcv)) |
7028 | [CvDEPTH(outcv) ? CvDEPTH(outcv) : 1])[pax]; | |
50278755 FC |
7029 | spot = (CV **)svspot; |
7030 | ||
7031 | if (proto) { | |
7032 | assert(proto->op_type == OP_CONST); | |
7033 | ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len); | |
7034 | ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv); | |
7035 | } | |
7036 | else | |
7037 | ps = NULL; | |
7038 | ||
50278755 | 7039 | if (!PL_madskills) { |
50278755 FC |
7040 | if (proto) |
7041 | SAVEFREEOP(proto); | |
7042 | if (attrs) | |
7043 | SAVEFREEOP(attrs); | |
7044 | } | |
7045 | ||
b0305fa3 | 7046 | if (PL_parser && PL_parser->error_count) { |
50278755 | 7047 | op_free(block); |
8ca8859f FC |
7048 | SvREFCNT_dec(PL_compcv); |
7049 | PL_compcv = 0; | |
50278755 FC |
7050 | goto done; |
7051 | } | |
7052 | ||
a70c2d56 FC |
7053 | if (CvDEPTH(outcv) && CvCLONE(compcv)) { |
7054 | cv = *spot; | |
7055 | svspot = (SV **)(spot = &clonee); | |
7056 | } | |
7057 | else if (PadnameIsSTATE(name) || CvDEPTH(outcv)) | |
6d5c2147 FC |
7058 | cv = *spot; |
7059 | else { | |
7060 | MAGIC *mg; | |
81df9f6f FC |
7061 | SvUPGRADE(name, SVt_PVMG); |
7062 | mg = mg_find(name, PERL_MAGIC_proto); | |
6d5c2147 | 7063 | assert (SvTYPE(*spot) == SVt_PVCV); |
6d5c2147 FC |
7064 | if (CvNAMED(*spot)) |
7065 | hek = CvNAME_HEK(*spot); | |
7066 | else { | |
2e800d79 | 7067 | CvNAME_HEK_set(*spot, hek = |
6d5c2147 FC |
7068 | share_hek( |
7069 | PadnamePV(name)+1, | |
7070 | PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1), 0 | |
2e800d79 FC |
7071 | ) |
7072 | ); | |
6d5c2147 | 7073 | } |
6d5c2147 FC |
7074 | if (mg) { |
7075 | assert(mg->mg_obj); | |
7076 | cv = (CV *)mg->mg_obj; | |
7077 | } | |
7078 | else { | |
81df9f6f FC |
7079 | sv_magic(name, &PL_sv_undef, PERL_MAGIC_proto, NULL, 0); |
7080 | mg = mg_find(name, PERL_MAGIC_proto); | |
6d5c2147 FC |
7081 | } |
7082 | spot = (CV **)(svspot = &mg->mg_obj); | |
50278755 FC |
7083 | } |
7084 | ||
50278755 FC |
7085 | if (!block || !ps || *ps || attrs |
7086 | || (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS) | |
7087 | #ifdef PERL_MAD | |
7088 | || block->op_type == OP_NULL | |
eb8433b7 | 7089 | #endif |
50278755 FC |
7090 | ) |
7091 | const_sv = NULL; | |
7092 | else | |
137da2b0 | 7093 | const_sv = op_const_sv(block); |
eb8433b7 | 7094 | |
50278755 FC |
7095 | if (cv) { |
7096 | const bool exists = CvROOT(cv) || CvXSUB(cv); | |
46c461b5 | 7097 | |
50278755 FC |
7098 | /* if the subroutine doesn't exist and wasn't pre-declared |
7099 | * with a prototype, assume it will be AUTOLOADed, | |
7100 | * skipping the prototype check | |
7101 | */ | |
7102 | if (exists || SvPOK(cv)) | |
2435fbd5 | 7103 | cv_ckproto_len_flags(cv, (GV *)name, ps, ps_len, ps_utf8); |
50278755 FC |
7104 | /* already defined? */ |
7105 | if (exists) { | |
2b141370 FC |
7106 | if (S_already_defined(aTHX_ cv, block, NULL, name, &const_sv)) |
7107 | cv = NULL; | |
7108 | else { | |
50278755 FC |
7109 | if (attrs) goto attrs; |
7110 | /* just a "sub foo;" when &foo is already defined */ | |
7111 | SAVEFREESV(compcv); | |
7112 | goto done; | |
7113 | } | |
50278755 | 7114 | } |
a70c2d56 FC |
7115 | else if (CvDEPTH(outcv) && CvCLONE(compcv)) { |
7116 | cv = NULL; | |
7117 | reusable = TRUE; | |
7118 | } | |
50278755 FC |
7119 | } |
7120 | if (const_sv) { | |
7121 | SvREFCNT_inc_simple_void_NN(const_sv); | |
d2440203 | 7122 | SvFLAGS(const_sv) = (SvFLAGS(const_sv) & ~SVs_PADMY) | SVs_PADTMP; |
50278755 FC |
7123 | if (cv) { |
7124 | assert(!CvROOT(cv) && !CvCONST(cv)); | |
7125 | cv_forget_slab(cv); | |
7126 | } | |
7127 | else { | |
7128 | cv = MUTABLE_CV(newSV_type(SVt_PVCV)); | |
7129 | CvFILE_set_from_cop(cv, PL_curcop); | |
7130 | CvSTASH_set(cv, PL_curstash); | |
7131 | *spot = cv; | |
7132 | } | |
7133 | sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */ | |
7134 | CvXSUBANY(cv).any_ptr = const_sv; | |
7135 | CvXSUB(cv) = const_sv_xsub; | |
7136 | CvCONST_on(cv); | |
7137 | CvISXSUB_on(cv); | |
7138 | if (PL_madskills) | |
7139 | goto install_block; | |
7140 | op_free(block); | |
7141 | SvREFCNT_dec(compcv); | |
2435fbd5 | 7142 | PL_compcv = NULL; |
83a72a15 | 7143 | goto setname; |
50278755 | 7144 | } |
1f122f9b FC |
7145 | /* Checking whether outcv is CvOUTSIDE(compcv) is not sufficient to |
7146 | determine whether this sub definition is in the same scope as its | |
7147 | declaration. If this sub definition is inside an inner named pack- | |
7148 | age sub (my sub foo; sub bar { sub foo { ... } }), outcv points to | |
7149 | the package sub. So check PadnameOUTER(name) too. | |
7150 | */ | |
7151 | if (outcv == CvOUTSIDE(compcv) && !PadnameOUTER(name)) { | |
10342479 FC |
7152 | assert(!CvWEAKOUTSIDE(compcv)); |
7153 | SvREFCNT_dec(CvOUTSIDE(compcv)); | |
7154 | CvWEAKOUTSIDE_on(compcv); | |
7155 | } | |
7156 | /* XXX else do we have a circular reference? */ | |
50278755 FC |
7157 | if (cv) { /* must reuse cv in case stub is referenced elsewhere */ |
7158 | /* transfer PL_compcv to cv */ | |
7159 | if (block | |
eb8433b7 | 7160 | #ifdef PERL_MAD |
50278755 | 7161 | && block->op_type != OP_NULL |
eb8433b7 | 7162 | #endif |
50278755 | 7163 | ) { |
6d5c2147 FC |
7164 | cv_flags_t preserved_flags = |
7165 | CvFLAGS(cv) & (CVf_BUILTIN_ATTRS|CVf_NAMED); | |
50278755 FC |
7166 | PADLIST *const temp_padl = CvPADLIST(cv); |
7167 | CV *const temp_cv = CvOUTSIDE(cv); | |
10342479 FC |
7168 | const cv_flags_t other_flags = |
7169 | CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE); | |
50278755 FC |
7170 | OP * const cvstart = CvSTART(cv); |
7171 | ||
50278755 FC |
7172 | SvPOK_off(cv); |
7173 | CvFLAGS(cv) = | |
6d5c2147 | 7174 | CvFLAGS(compcv) | preserved_flags; |
50278755 FC |
7175 | CvOUTSIDE(cv) = CvOUTSIDE(compcv); |
7176 | CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(compcv); | |
7177 | CvPADLIST(cv) = CvPADLIST(compcv); | |
7178 | CvOUTSIDE(compcv) = temp_cv; | |
7179 | CvPADLIST(compcv) = temp_padl; | |
7180 | CvSTART(cv) = CvSTART(compcv); | |
7181 | CvSTART(compcv) = cvstart; | |
10342479 FC |
7182 | CvFLAGS(compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE); |
7183 | CvFLAGS(compcv) |= other_flags; | |
50278755 FC |
7184 | |
7185 | if (CvFILE(cv) && CvDYNFILE(cv)) { | |
7186 | Safefree(CvFILE(cv)); | |
7187 | } | |
7188 | ||
7189 | /* inner references to compcv must be fixed up ... */ | |
7190 | pad_fixup_inner_anons(CvPADLIST(cv), compcv, cv); | |
7191 | if (PERLDB_INTER)/* Advice debugger on the new sub. */ | |
7192 | ++PL_sub_generation; | |
7193 | } | |
7194 | else { | |
7195 | /* Might have had built-in attributes applied -- propagate them. */ | |
7196 | CvFLAGS(cv) |= (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS); | |
7197 | } | |
7198 | /* ... before we throw it away */ | |
7199 | SvREFCNT_dec(compcv); | |
2435fbd5 | 7200 | PL_compcv = compcv = cv; |
50278755 FC |
7201 | } |
7202 | else { | |
7203 | cv = compcv; | |
7204 | *spot = cv; | |
6d5c2147 | 7205 | } |
83a72a15 | 7206 | setname: |
6d5c2147 | 7207 | if (!CvNAME_HEK(cv)) { |
2e800d79 | 7208 | CvNAME_HEK_set(cv, |
6d5c2147 FC |
7209 | hek |
7210 | ? share_hek_hek(hek) | |
7211 | : share_hek(PadnamePV(name)+1, | |
2435fbd5 | 7212 | PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1), |
2e800d79 FC |
7213 | 0) |
7214 | ); | |
50278755 | 7215 | } |
83a72a15 FC |
7216 | if (const_sv) goto clone; |
7217 | ||
50278755 FC |
7218 | CvFILE_set_from_cop(cv, PL_curcop); |
7219 | CvSTASH_set(cv, PL_curstash); | |
7220 | ||
7221 | if (ps) { | |
7222 | sv_setpvn(MUTABLE_SV(cv), ps, ps_len); | |
7223 | if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv)); | |
7224 | } | |
7225 | ||
7226 | install_block: | |
7227 | if (!block) | |
7228 | goto attrs; | |
7229 | ||
7230 | /* If we assign an optree to a PVCV, then we've defined a subroutine that | |
7231 | the debugger could be able to set a breakpoint in, so signal to | |
7232 | pp_entereval that it should not throw away any saved lines at scope | |
7233 | exit. */ | |
7234 | ||
7235 | PL_breakable_sub_gen++; | |
7236 | /* This makes sub {}; work as expected. */ | |
7237 | if (block->op_type == OP_STUB) { | |
7238 | OP* const newblock = newSTATEOP(0, NULL, 0); | |
7239 | #ifdef PERL_MAD | |
7240 | op_getmad(block,newblock,'B'); | |
7241 | #else | |
7242 | op_free(block); | |
7243 | #endif | |
7244 | block = newblock; | |
7245 | } | |
7246 | CvROOT(cv) = CvLVALUE(cv) | |
7247 | ? newUNOP(OP_LEAVESUBLV, 0, | |
7248 | op_lvalue(scalarseq(block), OP_LEAVESUBLV)) | |
7249 | : newUNOP(OP_LEAVESUB, 0, scalarseq(block)); | |
7250 | CvROOT(cv)->op_private |= OPpREFCOUNTED; | |
7251 | OpREFCNT_set(CvROOT(cv), 1); | |
7252 | /* The cv no longer needs to hold a refcount on the slab, as CvROOT | |
7253 | itself has a refcount. */ | |
7254 | CvSLABBED_off(cv); | |
7255 | OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv)); | |
7256 | CvSTART(cv) = LINKLIST(CvROOT(cv)); | |
7257 | CvROOT(cv)->op_next = 0; | |
7258 | CALL_PEEP(CvSTART(cv)); | |
7259 | finalize_optree(CvROOT(cv)); | |
7260 | ||
7261 | /* now that optimizer has done its work, adjust pad values */ | |
7262 | ||
50278755 | 7263 | pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB); |
50278755 | 7264 | |
50278755 FC |
7265 | attrs: |
7266 | if (attrs) { | |
7267 | /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */ | |
ad0dc73b | 7268 | apply_attrs(PL_curstash, MUTABLE_SV(cv), attrs); |
50278755 FC |
7269 | } |
7270 | ||
7271 | if (block) { | |
7272 | if (PERLDB_SUBLINE && PL_curstash != PL_debstash) { | |
7273 | SV * const tmpstr = sv_newmortal(); | |
7274 | GV * const db_postponed = gv_fetchpvs("DB::postponed", | |
7275 | GV_ADDMULTI, SVt_PVHV); | |
7276 | HV *hv; | |
7277 | SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld", | |
7278 | CopFILE(PL_curcop), | |
7279 | (long)PL_subline, | |
7280 | (long)CopLINE(PL_curcop)); | |
a56613a9 FC |
7281 | if (HvNAME_HEK(PL_curstash)) { |
7282 | sv_sethek(tmpstr, HvNAME_HEK(PL_curstash)); | |
7283 | sv_catpvs(tmpstr, "::"); | |
7284 | } | |
7285 | else sv_setpvs(tmpstr, "__ANON__::"); | |
2435fbd5 FC |
7286 | sv_catpvn_flags(tmpstr, PadnamePV(name)+1, PadnameLEN(name)-1, |
7287 | PadnameUTF8(name) ? SV_CATUTF8 : SV_CATBYTES); | |
50278755 FC |
7288 | (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr), |
7289 | SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0); | |
7290 | hv = GvHVn(db_postponed); | |
7291 | if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) { | |
7292 | CV * const pcv = GvCV(db_postponed); | |
7293 | if (pcv) { | |
7294 | dSP; | |
7295 | PUSHMARK(SP); | |
7296 | XPUSHs(tmpstr); | |
7297 | PUTBACK; | |
7298 | call_sv(MUTABLE_SV(pcv), G_DISCARD); | |
7299 | } | |
7300 | } | |
7301 | } | |
7302 | } | |
7303 | ||
a70c2d56 FC |
7304 | clone: |
7305 | if (clonee) { | |
7306 | assert(CvDEPTH(outcv)); | |
7307 | spot = (CV **) | |
7308 | &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[CvDEPTH(outcv)])[pax]; | |
7309 | if (reusable) cv_clone_into(clonee, *spot); | |
7310 | else *spot = cv_clone(clonee); | |
fc2b2dca | 7311 | SvREFCNT_dec_NN(clonee); |
a70c2d56 FC |
7312 | cv = *spot; |
7313 | SvPADMY_on(cv); | |
7314 | } | |
7315 | if (CvDEPTH(outcv) && !reusable && PadnameIsSTATE(name)) { | |
7316 | PADOFFSET depth = CvDEPTH(outcv); | |
7317 | while (--depth) { | |
7318 | SV *oldcv; | |
7319 | svspot = &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[depth])[pax]; | |
7320 | oldcv = *svspot; | |
7321 | *svspot = SvREFCNT_inc_simple_NN(cv); | |
7322 | SvREFCNT_dec(oldcv); | |
7323 | } | |
7324 | } | |
7325 | ||
50278755 FC |
7326 | done: |
7327 | if (PL_parser) | |
7328 | PL_parser->copline = NOLINE; | |
2435fbd5 FC |
7329 | LEAVE_SCOPE(floor); |
7330 | if (o) op_free(o); | |
50278755 | 7331 | return cv; |
09bef843 SB |
7332 | } |
7333 | ||
748a9306 | 7334 | CV * |
09bef843 SB |
7335 | Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block) |
7336 | { | |
7e68c38b FC |
7337 | return newATTRSUB_flags(floor, o, proto, attrs, block, 0); |
7338 | } | |
7339 | ||
7340 | CV * | |
7341 | Perl_newATTRSUB_flags(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, | |
7342 | OP *block, U32 flags) | |
7343 | { | |
27da23d5 | 7344 | dVAR; |
83ee9e09 | 7345 | GV *gv; |
5c144d81 | 7346 | const char *ps; |
52a9a866 | 7347 | STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */ |
e0260a5b | 7348 | U32 ps_utf8 = 0; |
eb578fdb | 7349 | CV *cv = NULL; |
beab0874 | 7350 | SV *const_sv; |
a73ef99b | 7351 | const bool ec = PL_parser && PL_parser->error_count; |
b48b272a NC |
7352 | /* If the subroutine has no body, no attributes, and no builtin attributes |
7353 | then it's just a sub declaration, and we may be able to get away with | |
7354 | storing with a placeholder scalar in the symbol table, rather than a | |
7355 | full GV and CV. If anything is present then it will take a full CV to | |
7356 | store it. */ | |
7357 | const I32 gv_fetch_flags | |
a73ef99b FC |
7358 | = ec ? GV_NOADD_NOINIT : |
7359 | (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS) | |
eb8433b7 | 7360 | || PL_madskills) |
b48b272a | 7361 | ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT; |
6e948d54 | 7362 | STRLEN namlen = 0; |
7e68c38b FC |
7363 | const bool o_is_gv = flags & 1; |
7364 | const char * const name = | |
7365 | o ? SvPV_const(o_is_gv ? (SV *)o : cSVOPo->op_sv, namlen) : NULL; | |
ed4a8a9b | 7366 | bool has_name; |
7e68c38b | 7367 | bool name_is_utf8 = o && !o_is_gv && SvUTF8(cSVOPo->op_sv); |
7aef8e5b | 7368 | #ifdef PERL_DEBUG_READONLY_OPS |
3107b51f FC |
7369 | OPSLAB *slab = NULL; |
7370 | #endif | |
8e742a20 MHM |
7371 | |
7372 | if (proto) { | |
7373 | assert(proto->op_type == OP_CONST); | |
4ea561bc | 7374 | ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len); |
e0260a5b | 7375 | ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv); |
8e742a20 MHM |
7376 | } |
7377 | else | |
bd61b366 | 7378 | ps = NULL; |
8e742a20 | 7379 | |
7e68c38b FC |
7380 | if (o_is_gv) { |
7381 | gv = (GV*)o; | |
7382 | o = NULL; | |
7383 | has_name = TRUE; | |
7384 | } else if (name) { | |
7385 | gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV); | |
ed4a8a9b NC |
7386 | has_name = TRUE; |
7387 | } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) { | |
aec46f14 | 7388 | SV * const sv = sv_newmortal(); |
c99da370 JH |
7389 | Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]", |
7390 | PL_curstash ? "__ANON__" : "__ANON__::__ANON__", | |
83ee9e09 | 7391 | CopFILE(PL_curcop), (IV)CopLINE(PL_curcop)); |
ed4a8a9b NC |
7392 | gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV); |
7393 | has_name = TRUE; | |
c1754fce NC |
7394 | } else if (PL_curstash) { |
7395 | gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV); | |
ed4a8a9b | 7396 | has_name = FALSE; |
c1754fce NC |
7397 | } else { |
7398 | gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV); | |
ed4a8a9b | 7399 | has_name = FALSE; |
c1754fce | 7400 | } |
83ee9e09 | 7401 | |
eb8433b7 NC |
7402 | if (!PL_madskills) { |
7403 | if (o) | |
7404 | SAVEFREEOP(o); | |
7405 | if (proto) | |
7406 | SAVEFREEOP(proto); | |
7407 | if (attrs) | |
7408 | SAVEFREEOP(attrs); | |
7409 | } | |
3fe9a6f1 | 7410 | |
a73ef99b FC |
7411 | if (ec) { |
7412 | op_free(block); | |
4d2dfd15 FC |
7413 | if (name) SvREFCNT_dec(PL_compcv); |
7414 | else cv = PL_compcv; | |
9ffcdca1 | 7415 | PL_compcv = 0; |
a73ef99b FC |
7416 | if (name && block) { |
7417 | const char *s = strrchr(name, ':'); | |
7418 | s = s ? s+1 : name; | |
7419 | if (strEQ(s, "BEGIN")) { | |
a73ef99b | 7420 | if (PL_in_eval & EVAL_KEEPERR) |
eed484f9 | 7421 | Perl_croak_nocontext("BEGIN not safe after errors--compilation aborted"); |
a73ef99b | 7422 | else { |
eed484f9 | 7423 | SV * const errsv = ERRSV; |
a73ef99b | 7424 | /* force display of errors found but not reported */ |
eed484f9 DD |
7425 | sv_catpvs(errsv, "BEGIN not safe after errors--compilation aborted"); |
7426 | Perl_croak_nocontext("%"SVf, SVfARG(errsv)); | |
a73ef99b FC |
7427 | } |
7428 | } | |
7429 | } | |
a73ef99b FC |
7430 | goto done; |
7431 | } | |
7432 | ||
09bef843 | 7433 | if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at |
55d729e4 GS |
7434 | maximum a prototype before. */ |
7435 | if (SvTYPE(gv) > SVt_NULL) { | |
105ff74c FC |
7436 | cv_ckproto_len_flags((const CV *)gv, |
7437 | o ? (const GV *)cSVOPo->op_sv : NULL, ps, | |
7438 | ps_len, ps_utf8); | |
55d729e4 | 7439 | } |
e0260a5b | 7440 | if (ps) { |
ad64d0ec | 7441 | sv_setpvn(MUTABLE_SV(gv), ps, ps_len); |
e0260a5b BF |
7442 | if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(gv)); |
7443 | } | |
55d729e4 | 7444 | else |
ad64d0ec | 7445 | sv_setiv(MUTABLE_SV(gv), -1); |
e1a479c5 | 7446 | |
3280af22 NIS |
7447 | SvREFCNT_dec(PL_compcv); |
7448 | cv = PL_compcv = NULL; | |
beab0874 | 7449 | goto done; |
55d729e4 GS |
7450 | } |
7451 | ||
601f1833 | 7452 | cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv); |
beab0874 | 7453 | |
eb8433b7 NC |
7454 | if (!block || !ps || *ps || attrs |
7455 | || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS) | |
7456 | #ifdef PERL_MAD | |
7457 | || block->op_type == OP_NULL | |
7458 | #endif | |
7459 | ) | |
a0714e2c | 7460 | const_sv = NULL; |
beab0874 | 7461 | else |
137da2b0 | 7462 | const_sv = op_const_sv(block); |
beab0874 JT |
7463 | |
7464 | if (cv) { | |
6867be6d | 7465 | const bool exists = CvROOT(cv) || CvXSUB(cv); |
5bd07a3d | 7466 | |
60ed1d8c GS |
7467 | /* if the subroutine doesn't exist and wasn't pre-declared |
7468 | * with a prototype, assume it will be AUTOLOADed, | |
7469 | * skipping the prototype check | |
7470 | */ | |
7471 | if (exists || SvPOK(cv)) | |
dab1c735 | 7472 | cv_ckproto_len_flags(cv, gv, ps, ps_len, ps_utf8); |
68dc0745 | 7473 | /* already defined (or promised)? */ |
60ed1d8c | 7474 | if (exists || GvASSUMECV(gv)) { |
2b141370 FC |
7475 | if (S_already_defined(aTHX_ cv, block, o, NULL, &const_sv)) |
7476 | cv = NULL; | |
7477 | else { | |
fff96ff7 | 7478 | if (attrs) goto attrs; |
aa689395 | 7479 | /* just a "sub foo;" when &foo is already defined */ |
3280af22 | 7480 | SAVEFREESV(PL_compcv); |
aa689395 | 7481 | goto done; |
7482 | } | |
79072805 LW |
7483 | } |
7484 | } | |
beab0874 | 7485 | if (const_sv) { |
f84c484e | 7486 | SvREFCNT_inc_simple_void_NN(const_sv); |
d2440203 | 7487 | SvFLAGS(const_sv) = (SvFLAGS(const_sv) & ~SVs_PADMY) | SVs_PADTMP; |
beab0874 | 7488 | if (cv) { |
0768512c | 7489 | assert(!CvROOT(cv) && !CvCONST(cv)); |
8be227ab | 7490 | cv_forget_slab(cv); |
ad64d0ec | 7491 | sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */ |
beab0874 JT |
7492 | CvXSUBANY(cv).any_ptr = const_sv; |
7493 | CvXSUB(cv) = const_sv_xsub; | |
7494 | CvCONST_on(cv); | |
d04ba589 | 7495 | CvISXSUB_on(cv); |
beab0874 JT |
7496 | } |
7497 | else { | |
c43ae56f | 7498 | GvCV_set(gv, NULL); |
9c0a6090 | 7499 | cv = newCONSTSUB_flags( |
6e948d54 | 7500 | NULL, name, namlen, name_is_utf8 ? SVf_UTF8 : 0, |
9c0a6090 FC |
7501 | const_sv |
7502 | ); | |
7ad40bcb | 7503 | } |
eb8433b7 NC |
7504 | if (PL_madskills) |
7505 | goto install_block; | |
beab0874 JT |
7506 | op_free(block); |
7507 | SvREFCNT_dec(PL_compcv); | |
7508 | PL_compcv = NULL; | |
beab0874 JT |
7509 | goto done; |
7510 | } | |
09330df8 Z |
7511 | if (cv) { /* must reuse cv if autoloaded */ |
7512 | /* transfer PL_compcv to cv */ | |
7513 | if (block | |
eb8433b7 | 7514 | #ifdef PERL_MAD |
09330df8 | 7515 | && block->op_type != OP_NULL |
eb8433b7 | 7516 | #endif |
09330df8 | 7517 | ) { |
eac910c8 | 7518 | cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS; |
b70d5558 | 7519 | PADLIST *const temp_av = CvPADLIST(cv); |
437388a9 | 7520 | CV *const temp_cv = CvOUTSIDE(cv); |
e52de15a FC |
7521 | const cv_flags_t other_flags = |
7522 | CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE); | |
8be227ab | 7523 | OP * const cvstart = CvSTART(cv); |
437388a9 | 7524 | |
f6894bc8 | 7525 | CvGV_set(cv,gv); |
437388a9 NC |
7526 | assert(!CvCVGV_RC(cv)); |
7527 | assert(CvGV(cv) == gv); | |
7528 | ||
7529 | SvPOK_off(cv); | |
eac910c8 | 7530 | CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs; |
09330df8 Z |
7531 | CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv); |
7532 | CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv); | |
09330df8 | 7533 | CvPADLIST(cv) = CvPADLIST(PL_compcv); |
437388a9 NC |
7534 | CvOUTSIDE(PL_compcv) = temp_cv; |
7535 | CvPADLIST(PL_compcv) = temp_av; | |
8be227ab FC |
7536 | CvSTART(cv) = CvSTART(PL_compcv); |
7537 | CvSTART(PL_compcv) = cvstart; | |
e52de15a FC |
7538 | CvFLAGS(PL_compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE); |
7539 | CvFLAGS(PL_compcv) |= other_flags; | |
437388a9 | 7540 | |
bad4ae38 | 7541 | if (CvFILE(cv) && CvDYNFILE(cv)) { |
437388a9 NC |
7542 | Safefree(CvFILE(cv)); |
7543 | } | |
437388a9 NC |
7544 | CvFILE_set_from_cop(cv, PL_curcop); |
7545 | CvSTASH_set(cv, PL_curstash); | |
7546 | ||
09330df8 Z |
7547 | /* inner references to PL_compcv must be fixed up ... */ |
7548 | pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv); | |
7549 | if (PERLDB_INTER)/* Advice debugger on the new sub. */ | |
7550 | ++PL_sub_generation; | |
09bef843 SB |
7551 | } |
7552 | else { | |
09330df8 Z |
7553 | /* Might have had built-in attributes applied -- propagate them. */ |
7554 | CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS); | |
09bef843 | 7555 | } |
282f25c9 | 7556 | /* ... before we throw it away */ |
3280af22 | 7557 | SvREFCNT_dec(PL_compcv); |
b5c19bd7 | 7558 | PL_compcv = cv; |
a0d0e21e LW |
7559 | } |
7560 | else { | |
3280af22 | 7561 | cv = PL_compcv; |
44a8e56a | 7562 | if (name) { |
c43ae56f | 7563 | GvCV_set(gv, cv); |
44a8e56a | 7564 | GvCVGEN(gv) = 0; |
03d9f026 FC |
7565 | if (HvENAME_HEK(GvSTASH(gv))) |
7566 | /* sub Foo::bar { (shift)+1 } */ | |
978a498e | 7567 | gv_method_changed(gv); |
44a8e56a | 7568 | } |
a0d0e21e | 7569 | } |
09330df8 | 7570 | if (!CvGV(cv)) { |
b3f91e91 | 7571 | CvGV_set(cv, gv); |
09330df8 | 7572 | CvFILE_set_from_cop(cv, PL_curcop); |
c68d9564 | 7573 | CvSTASH_set(cv, PL_curstash); |
09330df8 | 7574 | } |
8990e307 | 7575 | |
e0260a5b | 7576 | if (ps) { |
ad64d0ec | 7577 | sv_setpvn(MUTABLE_SV(cv), ps, ps_len); |
e0260a5b BF |
7578 | if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv)); |
7579 | } | |
4633a7c4 | 7580 | |
eb8433b7 | 7581 | install_block: |
beab0874 | 7582 | if (!block) |
fb834abd | 7583 | goto attrs; |
a0d0e21e | 7584 | |
aac018bb NC |
7585 | /* If we assign an optree to a PVCV, then we've defined a subroutine that |
7586 | the debugger could be able to set a breakpoint in, so signal to | |
7587 | pp_entereval that it should not throw away any saved lines at scope | |
7588 | exit. */ | |
7589 | ||
fd06b02c | 7590 | PL_breakable_sub_gen++; |
69b22cd1 FC |
7591 | /* This makes sub {}; work as expected. */ |
7592 | if (block->op_type == OP_STUB) { | |
1496a290 | 7593 | OP* const newblock = newSTATEOP(0, NULL, 0); |
eb8433b7 NC |
7594 | #ifdef PERL_MAD |
7595 | op_getmad(block,newblock,'B'); | |
7596 | #else | |
09c2fd24 | 7597 | op_free(block); |
eb8433b7 NC |
7598 | #endif |
7599 | block = newblock; | |
7766f137 | 7600 | } |
69b22cd1 FC |
7601 | CvROOT(cv) = CvLVALUE(cv) |
7602 | ? newUNOP(OP_LEAVESUBLV, 0, | |
7603 | op_lvalue(scalarseq(block), OP_LEAVESUBLV)) | |
7604 | : newUNOP(OP_LEAVESUB, 0, scalarseq(block)); | |
7766f137 GS |
7605 | CvROOT(cv)->op_private |= OPpREFCOUNTED; |
7606 | OpREFCNT_set(CvROOT(cv), 1); | |
8be227ab FC |
7607 | /* The cv no longer needs to hold a refcount on the slab, as CvROOT |
7608 | itself has a refcount. */ | |
7609 | CvSLABBED_off(cv); | |
7610 | OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv)); | |
7aef8e5b | 7611 | #ifdef PERL_DEBUG_READONLY_OPS |
3107b51f | 7612 | slab = (OPSLAB *)CvSTART(cv); |
8be227ab | 7613 | #endif |
7766f137 GS |
7614 | CvSTART(cv) = LINKLIST(CvROOT(cv)); |
7615 | CvROOT(cv)->op_next = 0; | |
a2efc822 | 7616 | CALL_PEEP(CvSTART(cv)); |
d164302a | 7617 | finalize_optree(CvROOT(cv)); |
7766f137 GS |
7618 | |
7619 | /* now that optimizer has done its work, adjust pad values */ | |
54310121 | 7620 | |
dd2155a4 DM |
7621 | pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB); |
7622 | ||
fb834abd FC |
7623 | attrs: |
7624 | if (attrs) { | |
7625 | /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */ | |
7626 | HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash; | |
12d3c230 | 7627 | if (!name) SAVEFREESV(cv); |
ad0dc73b | 7628 | apply_attrs(stash, MUTABLE_SV(cv), attrs); |
12d3c230 | 7629 | if (!name) SvREFCNT_inc_simple_void_NN(cv); |
fb834abd FC |
7630 | } |
7631 | ||
7632 | if (block && has_name) { | |
3280af22 | 7633 | if (PERLDB_SUBLINE && PL_curstash != PL_debstash) { |
c4420975 | 7634 | SV * const tmpstr = sv_newmortal(); |
5c1737d1 NC |
7635 | GV * const db_postponed = gv_fetchpvs("DB::postponed", |
7636 | GV_ADDMULTI, SVt_PVHV); | |
44a8e56a | 7637 | HV *hv; |
b081dd7e NC |
7638 | SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld", |
7639 | CopFILE(PL_curcop), | |
7640 | (long)PL_subline, | |
7641 | (long)CopLINE(PL_curcop)); | |
bd61b366 | 7642 | gv_efullname3(tmpstr, gv, NULL); |
04fe65b0 | 7643 | (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr), |
c60dbbc3 | 7644 | SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0); |
44a8e56a | 7645 | hv = GvHVn(db_postponed); |
c60dbbc3 | 7646 | if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) { |
551405c4 AL |
7647 | CV * const pcv = GvCV(db_postponed); |
7648 | if (pcv) { | |
7649 | dSP; | |
7650 | PUSHMARK(SP); | |
7651 | XPUSHs(tmpstr); | |
7652 | PUTBACK; | |
ad64d0ec | 7653 | call_sv(MUTABLE_SV(pcv), G_DISCARD); |
551405c4 | 7654 | } |
44a8e56a | 7655 | } |
7656 | } | |
79072805 | 7657 | |
13765c85 | 7658 | if (name && ! (PL_parser && PL_parser->error_count)) |
d699ecb7 | 7659 | process_special_blocks(floor, name, gv, cv); |
33fb7a6e | 7660 | } |
ed094faf | 7661 | |
33fb7a6e | 7662 | done: |
53a7735b DM |
7663 | if (PL_parser) |
7664 | PL_parser->copline = NOLINE; | |
33fb7a6e | 7665 | LEAVE_SCOPE(floor); |
7aef8e5b | 7666 | #ifdef PERL_DEBUG_READONLY_OPS |
3107b51f FC |
7667 | /* Watch out for BEGIN blocks */ |
7668 | if (slab && gv && isGV(gv) && GvCV(gv)) Slab_to_ro(slab); | |
7669 | #endif | |
33fb7a6e NC |
7670 | return cv; |
7671 | } | |
ed094faf | 7672 | |
33fb7a6e | 7673 | STATIC void |
d699ecb7 FC |
7674 | S_process_special_blocks(pTHX_ I32 floor, const char *const fullname, |
7675 | GV *const gv, | |
33fb7a6e NC |
7676 | CV *const cv) |
7677 | { | |
7678 | const char *const colon = strrchr(fullname,':'); | |
7679 | const char *const name = colon ? colon + 1 : fullname; | |
7680 | ||
7918f24d NC |
7681 | PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS; |
7682 | ||
33fb7a6e | 7683 | if (*name == 'B') { |
6952d67e | 7684 | if (strEQ(name, "BEGIN")) { |
6867be6d | 7685 | const I32 oldscope = PL_scopestack_ix; |
d699ecb7 | 7686 | if (floor) LEAVE_SCOPE(floor); |
28757baa | 7687 | ENTER; |
57843af0 GS |
7688 | SAVECOPFILE(&PL_compiling); |
7689 | SAVECOPLINE(&PL_compiling); | |
16c63275 | 7690 | SAVEVPTR(PL_curcop); |
28757baa | 7691 | |
a58fb6f9 | 7692 | DEBUG_x( dump_sub(gv) ); |
ad64d0ec | 7693 | Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv)); |
c43ae56f | 7694 | GvCV_set(gv,0); /* cv has been hijacked */ |
3280af22 | 7695 | call_list(oldscope, PL_beginav); |
a6006777 | 7696 | |
623e6609 | 7697 | CopHINTS_set(&PL_compiling, PL_hints); |
28757baa | 7698 | LEAVE; |
7699 | } | |
33fb7a6e NC |
7700 | else |
7701 | return; | |
7702 | } else { | |
7703 | if (*name == 'E') { | |
7704 | if strEQ(name, "END") { | |
a58fb6f9 | 7705 | DEBUG_x( dump_sub(gv) ); |
ad64d0ec | 7706 | Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv)); |
33fb7a6e NC |
7707 | } else |
7708 | return; | |
7709 | } else if (*name == 'U') { | |
7710 | if (strEQ(name, "UNITCHECK")) { | |
7711 | /* It's never too late to run a unitcheck block */ | |
ad64d0ec | 7712 | Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv)); |
33fb7a6e NC |
7713 | } |
7714 | else | |
7715 | return; | |
7716 | } else if (*name == 'C') { | |
7717 | if (strEQ(name, "CHECK")) { | |
a2a5de95 | 7718 | if (PL_main_start) |
dcbac5bb | 7719 | /* diag_listed_as: Too late to run %s block */ |
a2a5de95 NC |
7720 | Perl_ck_warner(aTHX_ packWARN(WARN_VOID), |
7721 | "Too late to run CHECK block"); | |
ad64d0ec | 7722 | Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv)); |
33fb7a6e NC |
7723 | } |
7724 | else | |
7725 | return; | |
7726 | } else if (*name == 'I') { | |
7727 | if (strEQ(name, "INIT")) { | |
a2a5de95 | 7728 | if (PL_main_start) |
dcbac5bb | 7729 | /* diag_listed_as: Too late to run %s block */ |
a2a5de95 NC |
7730 | Perl_ck_warner(aTHX_ packWARN(WARN_VOID), |
7731 | "Too late to run INIT block"); | |
ad64d0ec | 7732 | Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv)); |
33fb7a6e NC |
7733 | } |
7734 | else | |
7735 | return; | |
7736 | } else | |
7737 | return; | |
a58fb6f9 | 7738 | DEBUG_x( dump_sub(gv) ); |
c43ae56f | 7739 | GvCV_set(gv,0); /* cv has been hijacked */ |
79072805 | 7740 | } |
79072805 LW |
7741 | } |
7742 | ||
954c1994 GS |
7743 | /* |
7744 | =for apidoc newCONSTSUB | |
7745 | ||
3453414d BF |
7746 | See L</newCONSTSUB_flags>. |
7747 | ||
7748 | =cut | |
7749 | */ | |
7750 | ||
7751 | CV * | |
7752 | Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv) | |
7753 | { | |
9c0a6090 | 7754 | return newCONSTSUB_flags(stash, name, name ? strlen(name) : 0, 0, sv); |
3453414d BF |
7755 | } |
7756 | ||
7757 | /* | |
7758 | =for apidoc newCONSTSUB_flags | |
7759 | ||
954c1994 GS |
7760 | Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is |
7761 | eligible for inlining at compile-time. | |
7762 | ||
3453414d BF |
7763 | Currently, the only useful value for C<flags> is SVf_UTF8. |
7764 | ||
be8851fc NC |
7765 | The newly created subroutine takes ownership of a reference to the passed in |
7766 | SV. | |
7767 | ||
99ab892b NC |
7768 | Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>, |
7769 | which won't be called if used as a destructor, but will suppress the overhead | |
7770 | of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at | |
7771 | compile time.) | |
7772 | ||
954c1994 GS |
7773 | =cut |
7774 | */ | |
7775 | ||
beab0874 | 7776 | CV * |
9c0a6090 FC |
7777 | Perl_newCONSTSUB_flags(pTHX_ HV *stash, const char *name, STRLEN len, |
7778 | U32 flags, SV *sv) | |
5476c433 | 7779 | { |
27da23d5 | 7780 | dVAR; |
beab0874 | 7781 | CV* cv; |
cbf82dd0 | 7782 | #ifdef USE_ITHREADS |
54d012c6 | 7783 | const char *const file = CopFILE(PL_curcop); |
cbf82dd0 NC |
7784 | #else |
7785 | SV *const temp_sv = CopFILESV(PL_curcop); | |
def18e4c | 7786 | const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL; |
cbf82dd0 | 7787 | #endif |
5476c433 | 7788 | |
11faa288 | 7789 | ENTER; |
11faa288 | 7790 | |
401667e9 DM |
7791 | if (IN_PERL_RUNTIME) { |
7792 | /* at runtime, it's not safe to manipulate PL_curcop: it may be | |
7793 | * an op shared between threads. Use a non-shared COP for our | |
7794 | * dirty work */ | |
7795 | SAVEVPTR(PL_curcop); | |
08f1b312 FC |
7796 | SAVECOMPILEWARNINGS(); |
7797 | PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings); | |
401667e9 DM |
7798 | PL_curcop = &PL_compiling; |
7799 | } | |
f4dd75d9 | 7800 | SAVECOPLINE(PL_curcop); |
53a7735b | 7801 | CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE); |
f4dd75d9 GS |
7802 | |
7803 | SAVEHINTS(); | |
3280af22 | 7804 | PL_hints &= ~HINT_BLOCK_SCOPE; |
11faa288 GS |
7805 | |
7806 | if (stash) { | |
03d9f026 | 7807 | SAVEGENERICSV(PL_curstash); |
03d9f026 | 7808 | PL_curstash = (HV *)SvREFCNT_inc_simple_NN(stash); |
11faa288 | 7809 | } |
5476c433 | 7810 | |
95934569 FC |
7811 | /* Protect sv against leakage caused by fatal warnings. */ |
7812 | if (sv) SAVEFREESV(sv); | |
7813 | ||
bad4ae38 | 7814 | /* file becomes the CvFILE. For an XS, it's usually static storage, |
cbf82dd0 NC |
7815 | and so doesn't get free()d. (It's expected to be from the C pre- |
7816 | processor __FILE__ directive). But we need a dynamically allocated one, | |
77004dee | 7817 | and we need it to get freed. */ |
6f1b3ab0 FC |
7818 | cv = newXS_len_flags(name, len, |
7819 | sv && SvTYPE(sv) == SVt_PVAV | |
7820 | ? const_av_xsub | |
7821 | : const_sv_xsub, | |
7822 | file ? file : "", "", | |
8f82b567 | 7823 | &sv, XS_DYNAMIC_FILENAME | flags); |
95934569 | 7824 | CvXSUBANY(cv).any_ptr = SvREFCNT_inc_simple(sv); |
beab0874 | 7825 | CvCONST_on(cv); |
5476c433 | 7826 | |
11faa288 | 7827 | LEAVE; |
beab0874 JT |
7828 | |
7829 | return cv; | |
5476c433 JD |
7830 | } |
7831 | ||
77004dee NC |
7832 | CV * |
7833 | Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr, | |
7834 | const char *const filename, const char *const proto, | |
7835 | U32 flags) | |
7836 | { | |
032a0447 FC |
7837 | PERL_ARGS_ASSERT_NEWXS_FLAGS; |
7838 | return newXS_len_flags( | |
8f82b567 | 7839 | name, name ? strlen(name) : 0, subaddr, filename, proto, NULL, flags |
032a0447 FC |
7840 | ); |
7841 | } | |
7842 | ||
7843 | CV * | |
7844 | Perl_newXS_len_flags(pTHX_ const char *name, STRLEN len, | |
7845 | XSUBADDR_t subaddr, const char *const filename, | |
8f82b567 FC |
7846 | const char *const proto, SV **const_svp, |
7847 | U32 flags) | |
032a0447 | 7848 | { |
3453414d | 7849 | CV *cv; |
77004dee | 7850 | |
032a0447 | 7851 | PERL_ARGS_ASSERT_NEWXS_LEN_FLAGS; |
7918f24d | 7852 | |
3453414d | 7853 | { |
9b566a5e DD |
7854 | GV * const gv = gv_fetchpvn( |
7855 | name ? name : PL_curstash ? "__ANON__" : "__ANON__::__ANON__", | |
7856 | name ? len : PL_curstash ? sizeof("__ANON__") - 1: | |
7857 | sizeof("__ANON__::__ANON__") - 1, | |
7858 | GV_ADDMULTI | flags, SVt_PVCV); | |
3453414d BF |
7859 | |
7860 | if (!subaddr) | |
7861 | Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename); | |
7862 | ||
7863 | if ((cv = (name ? GvCV(gv) : NULL))) { | |
7864 | if (GvCVGEN(gv)) { | |
7865 | /* just a cached method */ | |
7866 | SvREFCNT_dec(cv); | |
7867 | cv = NULL; | |
7868 | } | |
7869 | else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) { | |
7870 | /* already defined (or promised) */ | |
18225a01 | 7871 | /* Redundant check that allows us to avoid creating an SV |
156d738f FC |
7872 | most of the time: */ |
7873 | if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) { | |
156d738f | 7874 | report_redefined_cv(newSVpvn_flags( |
46538741 | 7875 | name,len,(flags&SVf_UTF8)|SVs_TEMP |
156d738f FC |
7876 | ), |
7877 | cv, const_svp); | |
3453414d | 7878 | } |
fc2b2dca | 7879 | SvREFCNT_dec_NN(cv); |
3453414d BF |
7880 | cv = NULL; |
7881 | } | |
7882 | } | |
7883 | ||
7884 | if (cv) /* must reuse cv if autoloaded */ | |
7885 | cv_undef(cv); | |
7886 | else { | |
7887 | cv = MUTABLE_CV(newSV_type(SVt_PVCV)); | |
7888 | if (name) { | |
7889 | GvCV_set(gv,cv); | |
7890 | GvCVGEN(gv) = 0; | |
03d9f026 | 7891 | if (HvENAME_HEK(GvSTASH(gv))) |
978a498e | 7892 | gv_method_changed(gv); /* newXS */ |
3453414d BF |
7893 | } |
7894 | } | |
7895 | if (!name) | |
7896 | CvANON_on(cv); | |
7897 | CvGV_set(cv, gv); | |
7898 | (void)gv_fetchfile(filename); | |
7899 | CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be | |
7900 | an external constant string */ | |
7901 | assert(!CvDYNFILE(cv)); /* cv_undef should have turned it off */ | |
7902 | CvISXSUB_on(cv); | |
7903 | CvXSUB(cv) = subaddr; | |
7904 | ||
7905 | if (name) | |
d699ecb7 | 7906 | process_special_blocks(0, name, gv, cv); |
3453414d BF |
7907 | } |
7908 | ||
77004dee | 7909 | if (flags & XS_DYNAMIC_FILENAME) { |
bad4ae38 FC |
7910 | CvFILE(cv) = savepv(filename); |
7911 | CvDYNFILE_on(cv); | |
77004dee | 7912 | } |
bad4ae38 | 7913 | sv_setpv(MUTABLE_SV(cv), proto); |
77004dee NC |
7914 | return cv; |
7915 | } | |
7916 | ||
186a5ba8 FC |
7917 | CV * |
7918 | Perl_newSTUB(pTHX_ GV *gv, bool fake) | |
7919 | { | |
eb578fdb | 7920 | CV *cv = MUTABLE_CV(newSV_type(SVt_PVCV)); |
186a5ba8 FC |
7921 | PERL_ARGS_ASSERT_NEWSTUB; |
7922 | assert(!GvCVu(gv)); | |
7923 | GvCV_set(gv, cv); | |
7924 | GvCVGEN(gv) = 0; | |
7925 | if (!fake && HvENAME_HEK(GvSTASH(gv))) | |
978a498e | 7926 | gv_method_changed(gv); |
186a5ba8 FC |
7927 | CvGV_set(cv, gv); |
7928 | CvFILE_set_from_cop(cv, PL_curcop); | |
7929 | CvSTASH_set(cv, PL_curstash); | |
7930 | GvMULTI_on(gv); | |
7931 | return cv; | |
7932 | } | |
7933 | ||
954c1994 GS |
7934 | /* |
7935 | =for apidoc U||newXS | |
7936 | ||
77004dee NC |
7937 | Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be |
7938 | static storage, as it is used directly as CvFILE(), without a copy being made. | |
954c1994 GS |
7939 | |
7940 | =cut | |
7941 | */ | |
7942 | ||
57d3b86d | 7943 | CV * |
bfed75c6 | 7944 | Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename) |
a0d0e21e | 7945 | { |
7918f24d | 7946 | PERL_ARGS_ASSERT_NEWXS; |
ce9f52ad FC |
7947 | return newXS_len_flags( |
7948 | name, name ? strlen(name) : 0, subaddr, filename, NULL, NULL, 0 | |
7949 | ); | |
79072805 LW |
7950 | } |
7951 | ||
eb8433b7 NC |
7952 | #ifdef PERL_MAD |
7953 | OP * | |
7954 | #else | |
79072805 | 7955 | void |
eb8433b7 | 7956 | #endif |
864dbfa3 | 7957 | Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block) |
79072805 | 7958 | { |
97aff369 | 7959 | dVAR; |
eb578fdb | 7960 | CV *cv; |
eb8433b7 NC |
7961 | #ifdef PERL_MAD |
7962 | OP* pegop = newOP(OP_NULL, 0); | |
7963 | #endif | |
79072805 | 7964 | |
2c658e55 FC |
7965 | GV *gv; |
7966 | ||
7967 | if (PL_parser && PL_parser->error_count) { | |
7968 | op_free(block); | |
7969 | goto finish; | |
7970 | } | |
7971 | ||
7972 | gv = o | |
f776e3cd | 7973 | ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM) |
fafc274c | 7974 | : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM); |
0bd48802 | 7975 | |
a5f75d66 | 7976 | GvMULTI_on(gv); |
155aba94 | 7977 | if ((cv = GvFORM(gv))) { |
599cee73 | 7978 | if (ckWARN(WARN_REDEFINE)) { |
6867be6d | 7979 | const line_t oldline = CopLINE(PL_curcop); |
53a7735b DM |
7980 | if (PL_parser && PL_parser->copline != NOLINE) |
7981 | CopLINE_set(PL_curcop, PL_parser->copline); | |
ee6d2783 NC |
7982 | if (o) { |
7983 | Perl_warner(aTHX_ packWARN(WARN_REDEFINE), | |
7984 | "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv)); | |
7985 | } else { | |
dcbac5bb | 7986 | /* diag_listed_as: Format %s redefined */ |
ee6d2783 NC |
7987 | Perl_warner(aTHX_ packWARN(WARN_REDEFINE), |
7988 | "Format STDOUT redefined"); | |
7989 | } | |
57843af0 | 7990 | CopLINE_set(PL_curcop, oldline); |
79072805 | 7991 | } |
8990e307 | 7992 | SvREFCNT_dec(cv); |
79072805 | 7993 | } |
3280af22 | 7994 | cv = PL_compcv; |
2c658e55 | 7995 | GvFORM(gv) = (CV *)SvREFCNT_inc_simple_NN(cv); |
b3f91e91 | 7996 | CvGV_set(cv, gv); |
a636914a | 7997 | CvFILE_set_from_cop(cv, PL_curcop); |
79072805 | 7998 | |
a0d0e21e | 7999 | |
dd2155a4 | 8000 | pad_tidy(padtidy_FORMAT); |
79072805 | 8001 | CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block)); |
7934575e GS |
8002 | CvROOT(cv)->op_private |= OPpREFCOUNTED; |
8003 | OpREFCNT_set(CvROOT(cv), 1); | |
79072805 LW |
8004 | CvSTART(cv) = LINKLIST(CvROOT(cv)); |
8005 | CvROOT(cv)->op_next = 0; | |
a2efc822 | 8006 | CALL_PEEP(CvSTART(cv)); |
aee4f072 | 8007 | finalize_optree(CvROOT(cv)); |
2c658e55 FC |
8008 | cv_forget_slab(cv); |
8009 | ||
8010 | finish: | |
eb8433b7 NC |
8011 | #ifdef PERL_MAD |
8012 | op_getmad(o,pegop,'n'); | |
8013 | op_getmad_weak(block, pegop, 'b'); | |
8014 | #else | |
11343788 | 8015 | op_free(o); |
eb8433b7 | 8016 | #endif |
53a7735b DM |
8017 | if (PL_parser) |
8018 | PL_parser->copline = NOLINE; | |
8990e307 | 8019 | LEAVE_SCOPE(floor); |
eb8433b7 NC |
8020 | #ifdef PERL_MAD |
8021 | return pegop; | |
8022 | #endif | |
79072805 LW |
8023 | } |
8024 | ||
8025 | OP * | |
864dbfa3 | 8026 | Perl_newANONLIST(pTHX_ OP *o) |
79072805 | 8027 | { |
78c72037 | 8028 | return convert(OP_ANONLIST, OPf_SPECIAL, o); |
79072805 LW |
8029 | } |
8030 | ||
8031 | OP * | |
864dbfa3 | 8032 | Perl_newANONHASH(pTHX_ OP *o) |
79072805 | 8033 | { |
78c72037 | 8034 | return convert(OP_ANONHASH, OPf_SPECIAL, o); |
a0d0e21e LW |
8035 | } |
8036 | ||
8037 | OP * | |
864dbfa3 | 8038 | Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block) |
a0d0e21e | 8039 | { |
5f66b61c | 8040 | return newANONATTRSUB(floor, proto, NULL, block); |
09bef843 SB |
8041 | } |
8042 | ||
8043 | OP * | |
8044 | Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block) | |
8045 | { | |
a0d0e21e | 8046 | return newUNOP(OP_REFGEN, 0, |
09bef843 | 8047 | newSVOP(OP_ANONCODE, 0, |
ad64d0ec | 8048 | MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block)))); |
79072805 LW |
8049 | } |
8050 | ||
8051 | OP * | |
864dbfa3 | 8052 | Perl_oopsAV(pTHX_ OP *o) |
79072805 | 8053 | { |
27da23d5 | 8054 | dVAR; |
7918f24d NC |
8055 | |
8056 | PERL_ARGS_ASSERT_OOPSAV; | |
8057 | ||
ed6116ce LW |
8058 | switch (o->op_type) { |
8059 | case OP_PADSV: | |
8060 | o->op_type = OP_PADAV; | |
22c35a8c | 8061 | o->op_ppaddr = PL_ppaddr[OP_PADAV]; |
51e247a3 | 8062 | return ref(o, OP_RV2AV); |
b2ffa427 | 8063 | |
ed6116ce | 8064 | case OP_RV2SV: |
79072805 | 8065 | o->op_type = OP_RV2AV; |
22c35a8c | 8066 | o->op_ppaddr = PL_ppaddr[OP_RV2AV]; |
79072805 | 8067 | ref(o, OP_RV2AV); |
ed6116ce LW |
8068 | break; |
8069 | ||
8070 | default: | |
9b387841 | 8071 | Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV"); |
ed6116ce LW |
8072 | break; |
8073 | } | |
79072805 LW |
8074 | return o; |
8075 | } | |
8076 | ||
8077 | OP * | |
864dbfa3 | 8078 | Perl_oopsHV(pTHX_ OP *o) |
79072805 | 8079 | { |
27da23d5 | 8080 | dVAR; |
7918f24d NC |
8081 | |
8082 | PERL_ARGS_ASSERT_OOPSHV; | |
8083 | ||
ed6116ce LW |
8084 | switch (o->op_type) { |
8085 | case OP_PADSV: | |
8086 | case OP_PADAV: | |
8087 | o->op_type = OP_PADHV; | |
22c35a8c | 8088 | o->op_ppaddr = PL_ppaddr[OP_PADHV]; |
51e247a3 | 8089 | return ref(o, OP_RV2HV); |
ed6116ce LW |
8090 | |
8091 | case OP_RV2SV: | |
8092 | case OP_RV2AV: | |
79072805 | 8093 | o->op_type = OP_RV2HV; |
22c35a8c | 8094 | o->op_ppaddr = PL_ppaddr[OP_RV2HV]; |
79072805 | 8095 | ref(o, OP_RV2HV); |
ed6116ce LW |
8096 | break; |
8097 | ||
8098 | default: | |
9b387841 | 8099 | Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV"); |
ed6116ce LW |
8100 | break; |
8101 | } | |
79072805 LW |
8102 | return o; |
8103 | } | |
8104 | ||
8105 | OP * | |
864dbfa3 | 8106 | Perl_newAVREF(pTHX_ OP *o) |
79072805 | 8107 | { |
27da23d5 | 8108 | dVAR; |
7918f24d NC |
8109 | |
8110 | PERL_ARGS_ASSERT_NEWAVREF; | |
8111 | ||
ed6116ce LW |
8112 | if (o->op_type == OP_PADANY) { |
8113 | o->op_type = OP_PADAV; | |
22c35a8c | 8114 | o->op_ppaddr = PL_ppaddr[OP_PADAV]; |
93a17b20 | 8115 | return o; |
ed6116ce | 8116 | } |
a2a5de95 | 8117 | else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) { |
d1d15184 | 8118 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 8119 | "Using an array as a reference is deprecated"); |
a1063b2d | 8120 | } |
79072805 LW |
8121 | return newUNOP(OP_RV2AV, 0, scalar(o)); |
8122 | } | |
8123 | ||
8124 | OP * | |
864dbfa3 | 8125 | Perl_newGVREF(pTHX_ I32 type, OP *o) |
79072805 | 8126 | { |
82092f1d | 8127 | if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT) |
a0d0e21e | 8128 | return newUNOP(OP_NULL, 0, o); |
748a9306 | 8129 | return ref(newUNOP(OP_RV2GV, OPf_REF, o), type); |
79072805 LW |
8130 | } |
8131 | ||
8132 | OP * | |
864dbfa3 | 8133 | Perl_newHVREF(pTHX_ OP *o) |
79072805 | 8134 | { |
27da23d5 | 8135 | dVAR; |
7918f24d NC |
8136 | |
8137 | PERL_ARGS_ASSERT_NEWHVREF; | |
8138 | ||
ed6116ce LW |
8139 | if (o->op_type == OP_PADANY) { |
8140 | o->op_type = OP_PADHV; | |
22c35a8c | 8141 | o->op_ppaddr = PL_ppaddr[OP_PADHV]; |
93a17b20 | 8142 | return o; |
ed6116ce | 8143 | } |
a2a5de95 | 8144 | else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) { |
d1d15184 | 8145 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 8146 | "Using a hash as a reference is deprecated"); |
a1063b2d | 8147 | } |
79072805 LW |
8148 | return newUNOP(OP_RV2HV, 0, scalar(o)); |
8149 | } | |
8150 | ||
8151 | OP * | |
864dbfa3 | 8152 | Perl_newCVREF(pTHX_ I32 flags, OP *o) |
79072805 | 8153 | { |
97b03d64 | 8154 | if (o->op_type == OP_PADANY) { |
c04ef36e | 8155 | dVAR; |
97b03d64 FC |
8156 | o->op_type = OP_PADCV; |
8157 | o->op_ppaddr = PL_ppaddr[OP_PADCV]; | |
8158 | } | |
c07a80fd | 8159 | return newUNOP(OP_RV2CV, flags, scalar(o)); |
79072805 LW |
8160 | } |
8161 | ||
8162 | OP * | |
864dbfa3 | 8163 | Perl_newSVREF(pTHX_ OP *o) |
79072805 | 8164 | { |
27da23d5 | 8165 | dVAR; |
7918f24d NC |
8166 | |
8167 | PERL_ARGS_ASSERT_NEWSVREF; | |
8168 | ||
ed6116ce LW |
8169 | if (o->op_type == OP_PADANY) { |
8170 | o->op_type = OP_PADSV; | |
22c35a8c | 8171 | o->op_ppaddr = PL_ppaddr[OP_PADSV]; |
93a17b20 | 8172 | return o; |
ed6116ce | 8173 | } |
79072805 LW |
8174 | return newUNOP(OP_RV2SV, 0, scalar(o)); |
8175 | } | |
8176 | ||
61b743bb DM |
8177 | /* Check routines. See the comments at the top of this file for details |
8178 | * on when these are called */ | |
79072805 LW |
8179 | |
8180 | OP * | |
cea2e8a9 | 8181 | Perl_ck_anoncode(pTHX_ OP *o) |
5f05dabc | 8182 | { |
7918f24d NC |
8183 | PERL_ARGS_ASSERT_CK_ANONCODE; |
8184 | ||
cc76b5cc | 8185 | cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type); |
eb8433b7 | 8186 | if (!PL_madskills) |
1d866c12 | 8187 | cSVOPo->op_sv = NULL; |
5dc0d613 | 8188 | return o; |
5f05dabc | 8189 | } |
8190 | ||
8191 | OP * | |
cea2e8a9 | 8192 | Perl_ck_bitop(pTHX_ OP *o) |
55497cff | 8193 | { |
97aff369 | 8194 | dVAR; |
7918f24d NC |
8195 | |
8196 | PERL_ARGS_ASSERT_CK_BITOP; | |
8197 | ||
d5ec2987 | 8198 | o->op_private = (U8)(PL_hints & HINT_INTEGER); |
2b84528b RGS |
8199 | if (!(o->op_flags & OPf_STACKED) /* Not an assignment */ |
8200 | && (o->op_type == OP_BIT_OR | |
8201 | || o->op_type == OP_BIT_AND | |
8202 | || o->op_type == OP_BIT_XOR)) | |
276b2a0c | 8203 | { |
1df70142 AL |
8204 | const OP * const left = cBINOPo->op_first; |
8205 | const OP * const right = left->op_sibling; | |
96a925ab YST |
8206 | if ((OP_IS_NUMCOMPARE(left->op_type) && |
8207 | (left->op_flags & OPf_PARENS) == 0) || | |
8208 | (OP_IS_NUMCOMPARE(right->op_type) && | |
8209 | (right->op_flags & OPf_PARENS) == 0)) | |
a2a5de95 NC |
8210 | Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE), |
8211 | "Possible precedence problem on bitwise %c operator", | |
8212 | o->op_type == OP_BIT_OR ? '|' | |
8213 | : o->op_type == OP_BIT_AND ? '&' : '^' | |
8214 | ); | |
276b2a0c | 8215 | } |
5dc0d613 | 8216 | return o; |
55497cff | 8217 | } |
8218 | ||
89474f50 FC |
8219 | PERL_STATIC_INLINE bool |
8220 | is_dollar_bracket(pTHX_ const OP * const o) | |
8221 | { | |
8222 | const OP *kid; | |
8223 | return o->op_type == OP_RV2SV && o->op_flags & OPf_KIDS | |
8224 | && (kid = cUNOPx(o)->op_first) | |
8225 | && kid->op_type == OP_GV | |
8226 | && strEQ(GvNAME(cGVOPx_gv(kid)), "["); | |
8227 | } | |
8228 | ||
8229 | OP * | |
8230 | Perl_ck_cmp(pTHX_ OP *o) | |
8231 | { | |
8232 | PERL_ARGS_ASSERT_CK_CMP; | |
8233 | if (ckWARN(WARN_SYNTAX)) { | |
8234 | const OP *kid = cUNOPo->op_first; | |
8235 | if (kid && ( | |
7c2b3c78 FC |
8236 | ( |
8237 | is_dollar_bracket(aTHX_ kid) | |
8238 | && kid->op_sibling && kid->op_sibling->op_type == OP_CONST | |
8239 | ) | |
8240 | || ( kid->op_type == OP_CONST | |
8241 | && (kid = kid->op_sibling) && is_dollar_bracket(aTHX_ kid)) | |
89474f50 FC |
8242 | )) |
8243 | Perl_warner(aTHX_ packWARN(WARN_SYNTAX), | |
8244 | "$[ used in %s (did you mean $] ?)", OP_DESC(o)); | |
8245 | } | |
8246 | return o; | |
8247 | } | |
8248 | ||
55497cff | 8249 | OP * |
cea2e8a9 | 8250 | Perl_ck_concat(pTHX_ OP *o) |
79072805 | 8251 | { |
0bd48802 | 8252 | const OP * const kid = cUNOPo->op_first; |
7918f24d NC |
8253 | |
8254 | PERL_ARGS_ASSERT_CK_CONCAT; | |
96a5add6 | 8255 | PERL_UNUSED_CONTEXT; |
7918f24d | 8256 | |
df91b2c5 AE |
8257 | if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) && |
8258 | !(kUNOP->op_first->op_flags & OPf_MOD)) | |
0165acc7 | 8259 | o->op_flags |= OPf_STACKED; |
11343788 | 8260 | return o; |
79072805 LW |
8261 | } |
8262 | ||
8263 | OP * | |
cea2e8a9 | 8264 | Perl_ck_spair(pTHX_ OP *o) |
79072805 | 8265 | { |
27da23d5 | 8266 | dVAR; |
7918f24d NC |
8267 | |
8268 | PERL_ARGS_ASSERT_CK_SPAIR; | |
8269 | ||
11343788 | 8270 | if (o->op_flags & OPf_KIDS) { |
79072805 | 8271 | OP* newop; |
a0d0e21e | 8272 | OP* kid; |
6867be6d | 8273 | const OPCODE type = o->op_type; |
5dc0d613 | 8274 | o = modkids(ck_fun(o), type); |
11343788 | 8275 | kid = cUNOPo->op_first; |
a0d0e21e | 8276 | newop = kUNOP->op_first->op_sibling; |
1496a290 AL |
8277 | if (newop) { |
8278 | const OPCODE type = newop->op_type; | |
8279 | if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) || | |
8280 | type == OP_PADAV || type == OP_PADHV || | |
8281 | type == OP_RV2AV || type == OP_RV2HV) | |
8282 | return o; | |
a0d0e21e | 8283 | } |
eb8433b7 NC |
8284 | #ifdef PERL_MAD |
8285 | op_getmad(kUNOP->op_first,newop,'K'); | |
8286 | #else | |
a0d0e21e | 8287 | op_free(kUNOP->op_first); |
eb8433b7 | 8288 | #endif |
a0d0e21e LW |
8289 | kUNOP->op_first = newop; |
8290 | } | |
707b805e RGS |
8291 | /* transforms OP_REFGEN into OP_SREFGEN, OP_CHOP into OP_SCHOP, |
8292 | * and OP_CHOMP into OP_SCHOMP */ | |
22c35a8c | 8293 | o->op_ppaddr = PL_ppaddr[++o->op_type]; |
11343788 | 8294 | return ck_fun(o); |
a0d0e21e LW |
8295 | } |
8296 | ||
8297 | OP * | |
cea2e8a9 | 8298 | Perl_ck_delete(pTHX_ OP *o) |
a0d0e21e | 8299 | { |
7918f24d NC |
8300 | PERL_ARGS_ASSERT_CK_DELETE; |
8301 | ||
11343788 | 8302 | o = ck_fun(o); |
5dc0d613 | 8303 | o->op_private = 0; |
11343788 | 8304 | if (o->op_flags & OPf_KIDS) { |
551405c4 | 8305 | OP * const kid = cUNOPo->op_first; |
01020589 GS |
8306 | switch (kid->op_type) { |
8307 | case OP_ASLICE: | |
8308 | o->op_flags |= OPf_SPECIAL; | |
8309 | /* FALL THROUGH */ | |
8310 | case OP_HSLICE: | |
5dc0d613 | 8311 | o->op_private |= OPpSLICE; |
01020589 GS |
8312 | break; |
8313 | case OP_AELEM: | |
8314 | o->op_flags |= OPf_SPECIAL; | |
8315 | /* FALL THROUGH */ | |
8316 | case OP_HELEM: | |
8317 | break; | |
8318 | default: | |
8319 | Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice", | |
53e06cf0 | 8320 | OP_DESC(o)); |
01020589 | 8321 | } |
7332a6c4 VP |
8322 | if (kid->op_private & OPpLVAL_INTRO) |
8323 | o->op_private |= OPpLVAL_INTRO; | |
93c66552 | 8324 | op_null(kid); |
79072805 | 8325 | } |
11343788 | 8326 | return o; |
79072805 LW |
8327 | } |
8328 | ||
8329 | OP * | |
96e176bf CL |
8330 | Perl_ck_die(pTHX_ OP *o) |
8331 | { | |
7918f24d NC |
8332 | PERL_ARGS_ASSERT_CK_DIE; |
8333 | ||
96e176bf CL |
8334 | #ifdef VMS |
8335 | if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH; | |
8336 | #endif | |
8337 | return ck_fun(o); | |
8338 | } | |
8339 | ||
8340 | OP * | |
cea2e8a9 | 8341 | Perl_ck_eof(pTHX_ OP *o) |
79072805 | 8342 | { |
97aff369 | 8343 | dVAR; |
79072805 | 8344 | |
7918f24d NC |
8345 | PERL_ARGS_ASSERT_CK_EOF; |
8346 | ||
11343788 | 8347 | if (o->op_flags & OPf_KIDS) { |
3500db16 | 8348 | OP *kid; |
11343788 | 8349 | if (cLISTOPo->op_first->op_type == OP_STUB) { |
1d866c12 AL |
8350 | OP * const newop |
8351 | = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv)); | |
eb8433b7 NC |
8352 | #ifdef PERL_MAD |
8353 | op_getmad(o,newop,'O'); | |
8354 | #else | |
11343788 | 8355 | op_free(o); |
eb8433b7 NC |
8356 | #endif |
8357 | o = newop; | |
8990e307 | 8358 | } |
3500db16 FC |
8359 | o = ck_fun(o); |
8360 | kid = cLISTOPo->op_first; | |
8361 | if (kid->op_type == OP_RV2GV) | |
8362 | kid->op_private |= OPpALLOW_FAKE; | |
79072805 | 8363 | } |
11343788 | 8364 | return o; |
79072805 LW |
8365 | } |
8366 | ||
8367 | OP * | |
cea2e8a9 | 8368 | Perl_ck_eval(pTHX_ OP *o) |
79072805 | 8369 | { |
27da23d5 | 8370 | dVAR; |
7918f24d NC |
8371 | |
8372 | PERL_ARGS_ASSERT_CK_EVAL; | |
8373 | ||
3280af22 | 8374 | PL_hints |= HINT_BLOCK_SCOPE; |
11343788 | 8375 | if (o->op_flags & OPf_KIDS) { |
46c461b5 | 8376 | SVOP * const kid = (SVOP*)cUNOPo->op_first; |
79072805 | 8377 | |
93a17b20 | 8378 | if (!kid) { |
11343788 | 8379 | o->op_flags &= ~OPf_KIDS; |
93c66552 | 8380 | op_null(o); |
79072805 | 8381 | } |
b14574b4 | 8382 | else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) { |
79072805 | 8383 | LOGOP *enter; |
eb8433b7 | 8384 | #ifdef PERL_MAD |
1d866c12 | 8385 | OP* const oldo = o; |
eb8433b7 | 8386 | #endif |
79072805 | 8387 | |
11343788 | 8388 | cUNOPo->op_first = 0; |
eb8433b7 | 8389 | #ifndef PERL_MAD |
11343788 | 8390 | op_free(o); |
eb8433b7 | 8391 | #endif |
79072805 | 8392 | |
b7dc083c | 8393 | NewOp(1101, enter, 1, LOGOP); |
79072805 | 8394 | enter->op_type = OP_ENTERTRY; |
22c35a8c | 8395 | enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY]; |
79072805 LW |
8396 | enter->op_private = 0; |
8397 | ||
8398 | /* establish postfix order */ | |
8399 | enter->op_next = (OP*)enter; | |
8400 | ||
2fcb4757 | 8401 | o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid); |
11343788 | 8402 | o->op_type = OP_LEAVETRY; |
22c35a8c | 8403 | o->op_ppaddr = PL_ppaddr[OP_LEAVETRY]; |
11343788 | 8404 | enter->op_other = o; |
eb8433b7 | 8405 | op_getmad(oldo,o,'O'); |
11343788 | 8406 | return o; |
79072805 | 8407 | } |
b5c19bd7 | 8408 | else { |
473986ff | 8409 | scalar((OP*)kid); |
b5c19bd7 DM |
8410 | PL_cv_has_eval = 1; |
8411 | } | |
79072805 LW |
8412 | } |
8413 | else { | |
a4a3cf74 | 8414 | const U8 priv = o->op_private; |
eb8433b7 | 8415 | #ifdef PERL_MAD |
1d866c12 | 8416 | OP* const oldo = o; |
eb8433b7 | 8417 | #else |
11343788 | 8418 | op_free(o); |
eb8433b7 | 8419 | #endif |
7d789282 | 8420 | o = newUNOP(OP_ENTEREVAL, priv <<8, newDEFSVOP()); |
eb8433b7 | 8421 | op_getmad(oldo,o,'O'); |
79072805 | 8422 | } |
3280af22 | 8423 | o->op_targ = (PADOFFSET)PL_hints; |
547ae129 | 8424 | if (o->op_private & OPpEVAL_BYTES) o->op_targ &= ~HINT_UTF8; |
7d789282 FC |
8425 | if ((PL_hints & HINT_LOCALIZE_HH) != 0 |
8426 | && !(o->op_private & OPpEVAL_COPHH) && GvHV(PL_hintgv)) { | |
996c9baa VP |
8427 | /* Store a copy of %^H that pp_entereval can pick up. */ |
8428 | OP *hhop = newSVOP(OP_HINTSEVAL, 0, | |
defdfed5 | 8429 | MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv)))); |
0d863452 RH |
8430 | cUNOPo->op_first->op_sibling = hhop; |
8431 | o->op_private |= OPpEVAL_HAS_HH; | |
915a83fe FC |
8432 | } |
8433 | if (!(o->op_private & OPpEVAL_BYTES) | |
2846acbf | 8434 | && FEATURE_UNIEVAL_IS_ENABLED) |
802a15e9 | 8435 | o->op_private |= OPpEVAL_UNICODE; |
11343788 | 8436 | return o; |
79072805 LW |
8437 | } |
8438 | ||
8439 | OP * | |
d98f61e7 GS |
8440 | Perl_ck_exit(pTHX_ OP *o) |
8441 | { | |
7918f24d NC |
8442 | PERL_ARGS_ASSERT_CK_EXIT; |
8443 | ||
d98f61e7 | 8444 | #ifdef VMS |
551405c4 | 8445 | HV * const table = GvHV(PL_hintgv); |
d98f61e7 | 8446 | if (table) { |
a4fc7abc | 8447 | SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE); |
d98f61e7 GS |
8448 | if (svp && *svp && SvTRUE(*svp)) |
8449 | o->op_private |= OPpEXIT_VMSISH; | |
8450 | } | |
96e176bf | 8451 | if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH; |
d98f61e7 GS |
8452 | #endif |
8453 | return ck_fun(o); | |
8454 | } | |
8455 | ||
8456 | OP * | |
cea2e8a9 | 8457 | Perl_ck_exec(pTHX_ OP *o) |
79072805 | 8458 | { |
7918f24d NC |
8459 | PERL_ARGS_ASSERT_CK_EXEC; |
8460 | ||
11343788 | 8461 | if (o->op_flags & OPf_STACKED) { |
6867be6d | 8462 | OP *kid; |
11343788 MB |
8463 | o = ck_fun(o); |
8464 | kid = cUNOPo->op_first->op_sibling; | |
8990e307 | 8465 | if (kid->op_type == OP_RV2GV) |
93c66552 | 8466 | op_null(kid); |
79072805 | 8467 | } |
463ee0b2 | 8468 | else |
11343788 MB |
8469 | o = listkids(o); |
8470 | return o; | |
79072805 LW |
8471 | } |
8472 | ||
8473 | OP * | |
cea2e8a9 | 8474 | Perl_ck_exists(pTHX_ OP *o) |
5f05dabc | 8475 | { |
97aff369 | 8476 | dVAR; |
7918f24d NC |
8477 | |
8478 | PERL_ARGS_ASSERT_CK_EXISTS; | |
8479 | ||
5196be3e MB |
8480 | o = ck_fun(o); |
8481 | if (o->op_flags & OPf_KIDS) { | |
46c461b5 | 8482 | OP * const kid = cUNOPo->op_first; |
afebc493 GS |
8483 | if (kid->op_type == OP_ENTERSUB) { |
8484 | (void) ref(kid, o->op_type); | |
13765c85 DM |
8485 | if (kid->op_type != OP_RV2CV |
8486 | && !(PL_parser && PL_parser->error_count)) | |
afebc493 | 8487 | Perl_croak(aTHX_ "%s argument is not a subroutine name", |
53e06cf0 | 8488 | OP_DESC(o)); |
afebc493 GS |
8489 | o->op_private |= OPpEXISTS_SUB; |
8490 | } | |
8491 | else if (kid->op_type == OP_AELEM) | |
01020589 GS |
8492 | o->op_flags |= OPf_SPECIAL; |
8493 | else if (kid->op_type != OP_HELEM) | |
b0fdf69e | 8494 | Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine", |
53e06cf0 | 8495 | OP_DESC(o)); |
93c66552 | 8496 | op_null(kid); |
5f05dabc | 8497 | } |
5196be3e | 8498 | return o; |
5f05dabc | 8499 | } |
8500 | ||
79072805 | 8501 | OP * |
5aaab254 | 8502 | Perl_ck_rvconst(pTHX_ OP *o) |
79072805 | 8503 | { |
27da23d5 | 8504 | dVAR; |
0bd48802 | 8505 | SVOP * const kid = (SVOP*)cUNOPo->op_first; |
85e6fe83 | 8506 | |
7918f24d NC |
8507 | PERL_ARGS_ASSERT_CK_RVCONST; |
8508 | ||
3280af22 | 8509 | o->op_private |= (PL_hints & HINT_STRICT_REFS); |
e26df76a NC |
8510 | if (o->op_type == OP_RV2CV) |
8511 | o->op_private &= ~1; | |
8512 | ||
79072805 | 8513 | if (kid->op_type == OP_CONST) { |
44a8e56a | 8514 | int iscv; |
8515 | GV *gv; | |
504618e9 | 8516 | SV * const kidsv = kid->op_sv; |
44a8e56a | 8517 | |
779c5bc9 GS |
8518 | /* Is it a constant from cv_const_sv()? */ |
8519 | if (SvROK(kidsv) && SvREADONLY(kidsv)) { | |
0bd48802 | 8520 | SV * const rsv = SvRV(kidsv); |
42d0e0b7 | 8521 | const svtype type = SvTYPE(rsv); |
bd61b366 | 8522 | const char *badtype = NULL; |
779c5bc9 GS |
8523 | |
8524 | switch (o->op_type) { | |
8525 | case OP_RV2SV: | |
42d0e0b7 | 8526 | if (type > SVt_PVMG) |
779c5bc9 GS |
8527 | badtype = "a SCALAR"; |
8528 | break; | |
8529 | case OP_RV2AV: | |
42d0e0b7 | 8530 | if (type != SVt_PVAV) |
779c5bc9 GS |
8531 | badtype = "an ARRAY"; |
8532 | break; | |
8533 | case OP_RV2HV: | |
42d0e0b7 | 8534 | if (type != SVt_PVHV) |
779c5bc9 | 8535 | badtype = "a HASH"; |
779c5bc9 GS |
8536 | break; |
8537 | case OP_RV2CV: | |
42d0e0b7 | 8538 | if (type != SVt_PVCV) |
779c5bc9 GS |
8539 | badtype = "a CODE"; |
8540 | break; | |
8541 | } | |
8542 | if (badtype) | |
cea2e8a9 | 8543 | Perl_croak(aTHX_ "Constant is not %s reference", badtype); |
779c5bc9 GS |
8544 | return o; |
8545 | } | |
f815dc14 | 8546 | if (SvTYPE(kidsv) == SVt_PVAV) return o; |
ce10b5d1 | 8547 | if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) { |
5f66b61c | 8548 | const char *badthing; |
5dc0d613 | 8549 | switch (o->op_type) { |
44a8e56a | 8550 | case OP_RV2SV: |
8551 | badthing = "a SCALAR"; | |
8552 | break; | |
8553 | case OP_RV2AV: | |
8554 | badthing = "an ARRAY"; | |
8555 | break; | |
8556 | case OP_RV2HV: | |
8557 | badthing = "a HASH"; | |
8558 | break; | |
5f66b61c AL |
8559 | default: |
8560 | badthing = NULL; | |
8561 | break; | |
44a8e56a | 8562 | } |
8563 | if (badthing) | |
1c846c1f | 8564 | Perl_croak(aTHX_ |
95b63a38 | 8565 | "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use", |
be2597df | 8566 | SVfARG(kidsv), badthing); |
44a8e56a | 8567 | } |
93233ece CS |
8568 | /* |
8569 | * This is a little tricky. We only want to add the symbol if we | |
8570 | * didn't add it in the lexer. Otherwise we get duplicate strict | |
8571 | * warnings. But if we didn't add it in the lexer, we must at | |
8572 | * least pretend like we wanted to add it even if it existed before, | |
8573 | * or we get possible typo warnings. OPpCONST_ENTERED says | |
8574 | * whether the lexer already added THIS instance of this symbol. | |
8575 | */ | |
5196be3e | 8576 | iscv = (o->op_type == OP_RV2CV) * 2; |
93233ece | 8577 | do { |
7a5fd60d | 8578 | gv = gv_fetchsv(kidsv, |
748a9306 | 8579 | iscv | !(kid->op_private & OPpCONST_ENTERED), |
a0d0e21e LW |
8580 | iscv |
8581 | ? SVt_PVCV | |
11343788 | 8582 | : o->op_type == OP_RV2SV |
a0d0e21e | 8583 | ? SVt_PV |
11343788 | 8584 | : o->op_type == OP_RV2AV |
a0d0e21e | 8585 | ? SVt_PVAV |
11343788 | 8586 | : o->op_type == OP_RV2HV |
a0d0e21e LW |
8587 | ? SVt_PVHV |
8588 | : SVt_PVGV); | |
93233ece CS |
8589 | } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++); |
8590 | if (gv) { | |
8591 | kid->op_type = OP_GV; | |
8592 | SvREFCNT_dec(kid->op_sv); | |
350de78d | 8593 | #ifdef USE_ITHREADS |
638eceb6 | 8594 | /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */ |
653e8c97 | 8595 | assert (sizeof(PADOP) <= sizeof(SVOP)); |
350de78d | 8596 | kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP); |
dd2155a4 | 8597 | SvREFCNT_dec(PAD_SVl(kPADOP->op_padix)); |
743e66e6 | 8598 | GvIN_PAD_on(gv); |
ad64d0ec | 8599 | PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv))); |
350de78d | 8600 | #else |
b37c2d43 | 8601 | kid->op_sv = SvREFCNT_inc_simple_NN(gv); |
350de78d | 8602 | #endif |
23f1ca44 | 8603 | kid->op_private = 0; |
76cd736e | 8604 | kid->op_ppaddr = PL_ppaddr[OP_GV]; |
2acc3314 FC |
8605 | /* FAKE globs in the symbol table cause weird bugs (#77810) */ |
8606 | SvFAKE_off(gv); | |
a0d0e21e | 8607 | } |
79072805 | 8608 | } |
11343788 | 8609 | return o; |
79072805 LW |
8610 | } |
8611 | ||
8612 | OP * | |
cea2e8a9 | 8613 | Perl_ck_ftst(pTHX_ OP *o) |
79072805 | 8614 | { |
27da23d5 | 8615 | dVAR; |
6867be6d | 8616 | const I32 type = o->op_type; |
79072805 | 8617 | |
7918f24d NC |
8618 | PERL_ARGS_ASSERT_CK_FTST; |
8619 | ||
d0dca557 | 8620 | if (o->op_flags & OPf_REF) { |
6f207bd3 | 8621 | NOOP; |
d0dca557 JD |
8622 | } |
8623 | else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) { | |
551405c4 | 8624 | SVOP * const kid = (SVOP*)cUNOPo->op_first; |
1496a290 | 8625 | const OPCODE kidtype = kid->op_type; |
79072805 | 8626 | |
9a0c9949 | 8627 | if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE) |
3513c740 | 8628 | && !kid->op_folded) { |
551405c4 | 8629 | OP * const newop = newGVOP(type, OPf_REF, |
f776e3cd | 8630 | gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO)); |
eb8433b7 NC |
8631 | #ifdef PERL_MAD |
8632 | op_getmad(o,newop,'O'); | |
8633 | #else | |
11343788 | 8634 | op_free(o); |
eb8433b7 | 8635 | #endif |
1d866c12 | 8636 | return newop; |
79072805 | 8637 | } |
6ecf81d6 | 8638 | if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type)) |
1af34c76 | 8639 | o->op_private |= OPpFT_ACCESS; |
ef69c8fc | 8640 | if (PL_check[kidtype] == Perl_ck_ftst |
bbd91306 | 8641 | && kidtype != OP_STAT && kidtype != OP_LSTAT) { |
fbb0b3b3 | 8642 | o->op_private |= OPpFT_STACKED; |
bbd91306 | 8643 | kid->op_private |= OPpFT_STACKING; |
8db8f6b6 FC |
8644 | if (kidtype == OP_FTTTY && ( |
8645 | !(kid->op_private & OPpFT_STACKED) | |
8646 | || kid->op_private & OPpFT_AFTER_t | |
8647 | )) | |
8648 | o->op_private |= OPpFT_AFTER_t; | |
bbd91306 | 8649 | } |
79072805 LW |
8650 | } |
8651 | else { | |
eb8433b7 | 8652 | #ifdef PERL_MAD |
1d866c12 | 8653 | OP* const oldo = o; |
eb8433b7 | 8654 | #else |
11343788 | 8655 | op_free(o); |
eb8433b7 | 8656 | #endif |
79072805 | 8657 | if (type == OP_FTTTY) |
8fde6460 | 8658 | o = newGVOP(type, OPf_REF, PL_stdingv); |
79072805 | 8659 | else |
d0dca557 | 8660 | o = newUNOP(type, 0, newDEFSVOP()); |
eb8433b7 | 8661 | op_getmad(oldo,o,'O'); |
79072805 | 8662 | } |
11343788 | 8663 | return o; |
79072805 LW |
8664 | } |
8665 | ||
8666 | OP * | |
cea2e8a9 | 8667 | Perl_ck_fun(pTHX_ OP *o) |
79072805 | 8668 | { |
97aff369 | 8669 | dVAR; |
6867be6d | 8670 | const int type = o->op_type; |
eb578fdb | 8671 | I32 oa = PL_opargs[type] >> OASHIFT; |
aeea060c | 8672 | |
7918f24d NC |
8673 | PERL_ARGS_ASSERT_CK_FUN; |
8674 | ||
11343788 | 8675 | if (o->op_flags & OPf_STACKED) { |
79072805 LW |
8676 | if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL)) |
8677 | oa &= ~OA_OPTIONAL; | |
8678 | else | |
11343788 | 8679 | return no_fh_allowed(o); |
79072805 LW |
8680 | } |
8681 | ||
11343788 | 8682 | if (o->op_flags & OPf_KIDS) { |
6867be6d | 8683 | OP **tokid = &cLISTOPo->op_first; |
eb578fdb | 8684 | OP *kid = cLISTOPo->op_first; |
6867be6d AL |
8685 | OP *sibl; |
8686 | I32 numargs = 0; | |
ea5703f4 | 8687 | bool seen_optional = FALSE; |
6867be6d | 8688 | |
8990e307 | 8689 | if (kid->op_type == OP_PUSHMARK || |
155aba94 | 8690 | (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK)) |
8990e307 | 8691 | { |
79072805 LW |
8692 | tokid = &kid->op_sibling; |
8693 | kid = kid->op_sibling; | |
8694 | } | |
f6a16869 FC |
8695 | if (kid && kid->op_type == OP_COREARGS) { |
8696 | bool optional = FALSE; | |
8697 | while (oa) { | |
8698 | numargs++; | |
8699 | if (oa & OA_OPTIONAL) optional = TRUE; | |
8700 | oa = oa >> 4; | |
8701 | } | |
8702 | if (optional) o->op_private |= numargs; | |
8703 | return o; | |
8704 | } | |
79072805 | 8705 | |
ea5703f4 | 8706 | while (oa) { |
72ec8a82 | 8707 | if (oa & OA_OPTIONAL || (oa & 7) == OA_LIST) { |
ea5703f4 FC |
8708 | if (!kid && !seen_optional && PL_opargs[type] & OA_DEFGV) |
8709 | *tokid = kid = newDEFSVOP(); | |
8710 | seen_optional = TRUE; | |
8711 | } | |
8712 | if (!kid) break; | |
8713 | ||
79072805 LW |
8714 | numargs++; |
8715 | sibl = kid->op_sibling; | |
eb8433b7 NC |
8716 | #ifdef PERL_MAD |
8717 | if (!sibl && kid->op_type == OP_STUB) { | |
8718 | numargs--; | |
8719 | break; | |
8720 | } | |
8721 | #endif | |
79072805 LW |
8722 | switch (oa & 7) { |
8723 | case OA_SCALAR: | |
62c18ce2 GS |
8724 | /* list seen where single (scalar) arg expected? */ |
8725 | if (numargs == 1 && !(oa >> 4) | |
8726 | && kid->op_type == OP_LIST && type != OP_SCALAR) | |
8727 | { | |
ce16c625 | 8728 | return too_many_arguments_pv(o,PL_op_desc[type], 0); |
62c18ce2 | 8729 | } |
79072805 LW |
8730 | scalar(kid); |
8731 | break; | |
8732 | case OA_LIST: | |
8733 | if (oa < 16) { | |
8734 | kid = 0; | |
8735 | continue; | |
8736 | } | |
8737 | else | |
8738 | list(kid); | |
8739 | break; | |
8740 | case OA_AVREF: | |
936edb8b | 8741 | if ((type == OP_PUSH || type == OP_UNSHIFT) |
a2a5de95 NC |
8742 | && !kid->op_sibling) |
8743 | Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX), | |
8744 | "Useless use of %s with no values", | |
8745 | PL_op_desc[type]); | |
b2ffa427 | 8746 | |
79072805 | 8747 | if (kid->op_type == OP_CONST && |
62c18ce2 GS |
8748 | (kid->op_private & OPpCONST_BARE)) |
8749 | { | |
551405c4 | 8750 | OP * const newop = newAVREF(newGVOP(OP_GV, 0, |
f776e3cd | 8751 | gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) )); |
d1d15184 | 8752 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 NC |
8753 | "Array @%"SVf" missing the @ in argument %"IVdf" of %s()", |
8754 | SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]); | |
eb8433b7 NC |
8755 | #ifdef PERL_MAD |
8756 | op_getmad(kid,newop,'K'); | |
8757 | #else | |
79072805 | 8758 | op_free(kid); |
eb8433b7 | 8759 | #endif |
79072805 LW |
8760 | kid = newop; |
8761 | kid->op_sibling = sibl; | |
8762 | *tokid = kid; | |
8763 | } | |
d4fc4415 FC |
8764 | else if (kid->op_type == OP_CONST |
8765 | && ( !SvROK(cSVOPx_sv(kid)) | |
8766 | || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV ) | |
8767 | ) | |
ce16c625 | 8768 | bad_type_pv(numargs, "array", PL_op_desc[type], 0, kid); |
d4fc4415 FC |
8769 | /* Defer checks to run-time if we have a scalar arg */ |
8770 | if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV) | |
8771 | op_lvalue(kid, type); | |
8772 | else scalar(kid); | |
79072805 LW |
8773 | break; |
8774 | case OA_HVREF: | |
8775 | if (kid->op_type == OP_CONST && | |
62c18ce2 GS |
8776 | (kid->op_private & OPpCONST_BARE)) |
8777 | { | |
551405c4 | 8778 | OP * const newop = newHVREF(newGVOP(OP_GV, 0, |
f776e3cd | 8779 | gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) )); |
d1d15184 | 8780 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 NC |
8781 | "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()", |
8782 | SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]); | |
eb8433b7 NC |
8783 | #ifdef PERL_MAD |
8784 | op_getmad(kid,newop,'K'); | |
8785 | #else | |
79072805 | 8786 | op_free(kid); |
eb8433b7 | 8787 | #endif |
79072805 LW |
8788 | kid = newop; |
8789 | kid->op_sibling = sibl; | |
8790 | *tokid = kid; | |
8791 | } | |
8990e307 | 8792 | else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV) |
ce16c625 | 8793 | bad_type_pv(numargs, "hash", PL_op_desc[type], 0, kid); |
3ad73efd | 8794 | op_lvalue(kid, type); |
79072805 LW |
8795 | break; |
8796 | case OA_CVREF: | |
8797 | { | |
551405c4 | 8798 | OP * const newop = newUNOP(OP_NULL, 0, kid); |
79072805 | 8799 | kid->op_sibling = 0; |
79072805 LW |
8800 | newop->op_next = newop; |
8801 | kid = newop; | |
8802 | kid->op_sibling = sibl; | |
8803 | *tokid = kid; | |
8804 | } | |
8805 | break; | |
8806 | case OA_FILEREF: | |
c340be78 | 8807 | if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) { |
79072805 | 8808 | if (kid->op_type == OP_CONST && |
62c18ce2 GS |
8809 | (kid->op_private & OPpCONST_BARE)) |
8810 | { | |
0bd48802 | 8811 | OP * const newop = newGVOP(OP_GV, 0, |
f776e3cd | 8812 | gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO)); |
afbdacea | 8813 | if (!(o->op_private & 1) && /* if not unop */ |
8a996ce8 | 8814 | kid == cLISTOPo->op_last) |
364daeac | 8815 | cLISTOPo->op_last = newop; |
eb8433b7 NC |
8816 | #ifdef PERL_MAD |
8817 | op_getmad(kid,newop,'K'); | |
8818 | #else | |
79072805 | 8819 | op_free(kid); |
eb8433b7 | 8820 | #endif |
79072805 LW |
8821 | kid = newop; |
8822 | } | |
1ea32a52 GS |
8823 | else if (kid->op_type == OP_READLINE) { |
8824 | /* neophyte patrol: open(<FH>), close(<FH>) etc. */ | |
ce16c625 | 8825 | bad_type_pv(numargs, "HANDLE", OP_DESC(o), 0, kid); |
1ea32a52 | 8826 | } |
79072805 | 8827 | else { |
35cd451c | 8828 | I32 flags = OPf_SPECIAL; |
a6c40364 | 8829 | I32 priv = 0; |
2c8ac474 GS |
8830 | PADOFFSET targ = 0; |
8831 | ||
35cd451c | 8832 | /* is this op a FH constructor? */ |
853846ea | 8833 | if (is_handle_constructor(o,numargs)) { |
bd61b366 | 8834 | const char *name = NULL; |
dd2155a4 | 8835 | STRLEN len = 0; |
2dc9cdca | 8836 | U32 name_utf8 = 0; |
885f468a | 8837 | bool want_dollar = TRUE; |
2c8ac474 GS |
8838 | |
8839 | flags = 0; | |
8840 | /* Set a flag to tell rv2gv to vivify | |
853846ea NIS |
8841 | * need to "prove" flag does not mean something |
8842 | * else already - NI-S 1999/05/07 | |
2c8ac474 GS |
8843 | */ |
8844 | priv = OPpDEREF; | |
8845 | if (kid->op_type == OP_PADSV) { | |
f8503592 NC |
8846 | SV *const namesv |
8847 | = PAD_COMPNAME_SV(kid->op_targ); | |
8848 | name = SvPV_const(namesv, len); | |
2dc9cdca | 8849 | name_utf8 = SvUTF8(namesv); |
2c8ac474 GS |
8850 | } |
8851 | else if (kid->op_type == OP_RV2SV | |
8852 | && kUNOP->op_first->op_type == OP_GV) | |
8853 | { | |
0bd48802 | 8854 | GV * const gv = cGVOPx_gv(kUNOP->op_first); |
2c8ac474 GS |
8855 | name = GvNAME(gv); |
8856 | len = GvNAMELEN(gv); | |
2dc9cdca | 8857 | name_utf8 = GvNAMEUTF8(gv) ? SVf_UTF8 : 0; |
2c8ac474 | 8858 | } |
afd1915d GS |
8859 | else if (kid->op_type == OP_AELEM |
8860 | || kid->op_type == OP_HELEM) | |
8861 | { | |
735fec84 | 8862 | OP *firstop; |
551405c4 | 8863 | OP *op = ((BINOP*)kid)->op_first; |
a4fc7abc | 8864 | name = NULL; |
551405c4 | 8865 | if (op) { |
a0714e2c | 8866 | SV *tmpstr = NULL; |
551405c4 | 8867 | const char * const a = |
666ea192 JH |
8868 | kid->op_type == OP_AELEM ? |
8869 | "[]" : "{}"; | |
0c4b0a3f JH |
8870 | if (((op->op_type == OP_RV2AV) || |
8871 | (op->op_type == OP_RV2HV)) && | |
735fec84 RGS |
8872 | (firstop = ((UNOP*)op)->op_first) && |
8873 | (firstop->op_type == OP_GV)) { | |
0c4b0a3f | 8874 | /* packagevar $a[] or $h{} */ |
735fec84 | 8875 | GV * const gv = cGVOPx_gv(firstop); |
0c4b0a3f JH |
8876 | if (gv) |
8877 | tmpstr = | |
8878 | Perl_newSVpvf(aTHX_ | |
8879 | "%s%c...%c", | |
8880 | GvNAME(gv), | |
8881 | a[0], a[1]); | |
8882 | } | |
8883 | else if (op->op_type == OP_PADAV | |
8884 | || op->op_type == OP_PADHV) { | |
8885 | /* lexicalvar $a[] or $h{} */ | |
551405c4 | 8886 | const char * const padname = |
0c4b0a3f JH |
8887 | PAD_COMPNAME_PV(op->op_targ); |
8888 | if (padname) | |
8889 | tmpstr = | |
8890 | Perl_newSVpvf(aTHX_ | |
8891 | "%s%c...%c", | |
8892 | padname + 1, | |
8893 | a[0], a[1]); | |
0c4b0a3f JH |
8894 | } |
8895 | if (tmpstr) { | |
93524f2b | 8896 | name = SvPV_const(tmpstr, len); |
2dc9cdca | 8897 | name_utf8 = SvUTF8(tmpstr); |
0c4b0a3f JH |
8898 | sv_2mortal(tmpstr); |
8899 | } | |
8900 | } | |
8901 | if (!name) { | |
8902 | name = "__ANONIO__"; | |
8903 | len = 10; | |
885f468a | 8904 | want_dollar = FALSE; |
0c4b0a3f | 8905 | } |
3ad73efd | 8906 | op_lvalue(kid, type); |
afd1915d | 8907 | } |
2c8ac474 GS |
8908 | if (name) { |
8909 | SV *namesv; | |
8910 | targ = pad_alloc(OP_RV2GV, SVs_PADTMP); | |
dd2155a4 | 8911 | namesv = PAD_SVl(targ); |
862a34c6 | 8912 | SvUPGRADE(namesv, SVt_PV); |
885f468a | 8913 | if (want_dollar && *name != '$') |
76f68e9b | 8914 | sv_setpvs(namesv, "$"); |
2c8ac474 | 8915 | sv_catpvn(namesv, name, len); |
2dc9cdca | 8916 | if ( name_utf8 ) SvUTF8_on(namesv); |
2c8ac474 | 8917 | } |
853846ea | 8918 | } |
79072805 | 8919 | kid->op_sibling = 0; |
35cd451c | 8920 | kid = newUNOP(OP_RV2GV, flags, scalar(kid)); |
2c8ac474 GS |
8921 | kid->op_targ = targ; |
8922 | kid->op_private |= priv; | |
79072805 LW |
8923 | } |
8924 | kid->op_sibling = sibl; | |
8925 | *tokid = kid; | |
8926 | } | |
8927 | scalar(kid); | |
8928 | break; | |
8929 | case OA_SCALARREF: | |
1efec5ed FC |
8930 | if ((type == OP_UNDEF || type == OP_POS) |
8931 | && numargs == 1 && !(oa >> 4) | |
89c5c07e FC |
8932 | && kid->op_type == OP_LIST) |
8933 | return too_many_arguments_pv(o,PL_op_desc[type], 0); | |
3ad73efd | 8934 | op_lvalue(scalar(kid), type); |
79072805 LW |
8935 | break; |
8936 | } | |
8937 | oa >>= 4; | |
8938 | tokid = &kid->op_sibling; | |
8939 | kid = kid->op_sibling; | |
8940 | } | |
eb8433b7 NC |
8941 | #ifdef PERL_MAD |
8942 | if (kid && kid->op_type != OP_STUB) | |
ce16c625 | 8943 | return too_many_arguments_pv(o,OP_DESC(o), 0); |
eb8433b7 NC |
8944 | o->op_private |= numargs; |
8945 | #else | |
8946 | /* FIXME - should the numargs move as for the PERL_MAD case? */ | |
11343788 | 8947 | o->op_private |= numargs; |
79072805 | 8948 | if (kid) |
ce16c625 | 8949 | return too_many_arguments_pv(o,OP_DESC(o), 0); |
eb8433b7 | 8950 | #endif |
11343788 | 8951 | listkids(o); |
79072805 | 8952 | } |
22c35a8c | 8953 | else if (PL_opargs[type] & OA_DEFGV) { |
c56915e3 | 8954 | #ifdef PERL_MAD |
c7fe699d | 8955 | OP *newop = newUNOP(type, 0, newDEFSVOP()); |
c56915e3 | 8956 | op_getmad(o,newop,'O'); |
c7fe699d | 8957 | return newop; |
c56915e3 | 8958 | #else |
c7fe699d | 8959 | /* Ordering of these two is important to keep f_map.t passing. */ |
11343788 | 8960 | op_free(o); |
c7fe699d | 8961 | return newUNOP(type, 0, newDEFSVOP()); |
c56915e3 | 8962 | #endif |
a0d0e21e LW |
8963 | } |
8964 | ||
79072805 LW |
8965 | if (oa) { |
8966 | while (oa & OA_OPTIONAL) | |
8967 | oa >>= 4; | |
8968 | if (oa && oa != OA_LIST) | |
ce16c625 | 8969 | return too_few_arguments_pv(o,OP_DESC(o), 0); |
79072805 | 8970 | } |
11343788 | 8971 | return o; |
79072805 LW |
8972 | } |
8973 | ||
8974 | OP * | |
cea2e8a9 | 8975 | Perl_ck_glob(pTHX_ OP *o) |
79072805 | 8976 | { |
27da23d5 | 8977 | dVAR; |
fb73857a | 8978 | GV *gv; |
d67594ff | 8979 | const bool core = o->op_flags & OPf_SPECIAL; |
fb73857a | 8980 | |
7918f24d NC |
8981 | PERL_ARGS_ASSERT_CK_GLOB; |
8982 | ||
649da076 | 8983 | o = ck_fun(o); |
1f2bfc8a | 8984 | if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling) |
bd31915d | 8985 | op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */ |
fb73857a | 8986 | |
d67594ff FC |
8987 | if (core) gv = NULL; |
8988 | else if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV)) | |
b9f751c0 GS |
8989 | && GvCVu(gv) && GvIMPORTED_CV(gv))) |
8990 | { | |
8113e1cc FC |
8991 | GV * const * const gvp = |
8992 | (GV **)hv_fetchs(PL_globalstash, "glob", FALSE); | |
8993 | gv = gvp ? *gvp : NULL; | |
b9f751c0 | 8994 | } |
b1cb66bf | 8995 | |
b9f751c0 | 8996 | if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) { |
d1bea3d8 DM |
8997 | /* convert |
8998 | * glob | |
8999 | * \ null - const(wildcard) | |
9000 | * into | |
9001 | * null | |
9002 | * \ enter | |
9003 | * \ list | |
9004 | * \ mark - glob - rv2cv | |
9005 | * | \ gv(CORE::GLOBAL::glob) | |
9006 | * | | |
9423a867 | 9007 | * \ null - const(wildcard) |
d1bea3d8 DM |
9008 | */ |
9009 | o->op_flags |= OPf_SPECIAL; | |
9426e1a5 | 9010 | o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP); |
d1bea3d8 | 9011 | o = newLISTOP(OP_LIST, 0, o, NULL); |
1f2bfc8a | 9012 | o = newUNOP(OP_ENTERSUB, OPf_STACKED, |
2fcb4757 | 9013 | op_append_elem(OP_LIST, o, |
1f2bfc8a MB |
9014 | scalar(newUNOP(OP_RV2CV, 0, |
9015 | newGVOP(OP_GV, 0, gv))))); | |
7ae76aaa | 9016 | o = newUNOP(OP_NULL, 0, o); |
d1bea3d8 | 9017 | o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */ |
d58bf5aa | 9018 | return o; |
b1cb66bf | 9019 | } |
d67594ff | 9020 | else o->op_flags &= ~OPf_SPECIAL; |
39e3b1bc FC |
9021 | #if !defined(PERL_EXTERNAL_GLOB) |
9022 | if (!PL_globhook) { | |
9023 | ENTER; | |
9024 | Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT, | |
9025 | newSVpvs("File::Glob"), NULL, NULL, NULL); | |
9026 | LEAVE; | |
9027 | } | |
9028 | #endif /* !PERL_EXTERNAL_GLOB */ | |
e88567f2 FC |
9029 | gv = (GV *)newSV(0); |
9030 | gv_init(gv, 0, "", 0, 0); | |
a0d0e21e | 9031 | gv_IOadd(gv); |
2fcb4757 | 9032 | op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv)); |
fc2b2dca | 9033 | SvREFCNT_dec_NN(gv); /* newGVOP increased it */ |
11343788 | 9034 | scalarkids(o); |
649da076 | 9035 | return o; |
79072805 LW |
9036 | } |
9037 | ||
9038 | OP * | |
cea2e8a9 | 9039 | Perl_ck_grep(pTHX_ OP *o) |
79072805 | 9040 | { |
27da23d5 | 9041 | dVAR; |
2471236a | 9042 | LOGOP *gwop; |
79072805 | 9043 | OP *kid; |
6867be6d | 9044 | const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE; |
9f7d9405 | 9045 | PADOFFSET offset; |
79072805 | 9046 | |
7918f24d NC |
9047 | PERL_ARGS_ASSERT_CK_GREP; |
9048 | ||
22c35a8c | 9049 | o->op_ppaddr = PL_ppaddr[OP_GREPSTART]; |
13765c85 | 9050 | /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */ |
aeea060c | 9051 | |
11343788 | 9052 | if (o->op_flags & OPf_STACKED) { |
2471236a | 9053 | kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first; |
f6435df3 GG |
9054 | if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE) |
9055 | return no_fh_allowed(o); | |
11343788 | 9056 | o->op_flags &= ~OPf_STACKED; |
93a17b20 | 9057 | } |
11343788 | 9058 | kid = cLISTOPo->op_first->op_sibling; |
a0d0e21e LW |
9059 | if (type == OP_MAPWHILE) |
9060 | list(kid); | |
9061 | else | |
9062 | scalar(kid); | |
11343788 | 9063 | o = ck_fun(o); |
13765c85 | 9064 | if (PL_parser && PL_parser->error_count) |
11343788 | 9065 | return o; |
aeea060c | 9066 | kid = cLISTOPo->op_first->op_sibling; |
79072805 | 9067 | if (kid->op_type != OP_NULL) |
5637ef5b | 9068 | Perl_croak(aTHX_ "panic: ck_grep, type=%u", (unsigned) kid->op_type); |
79072805 LW |
9069 | kid = kUNOP->op_first; |
9070 | ||
2471236a | 9071 | NewOp(1101, gwop, 1, LOGOP); |
a0d0e21e | 9072 | gwop->op_type = type; |
22c35a8c | 9073 | gwop->op_ppaddr = PL_ppaddr[type]; |
09fe0e74 | 9074 | gwop->op_first = o; |
79072805 | 9075 | gwop->op_flags |= OPf_KIDS; |
79072805 | 9076 | gwop->op_other = LINKLIST(kid); |
79072805 | 9077 | kid->op_next = (OP*)gwop; |
cc76b5cc | 9078 | offset = pad_findmy_pvs("$_", 0); |
00b1698f | 9079 | if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) { |
59f00321 RGS |
9080 | o->op_private = gwop->op_private = 0; |
9081 | gwop->op_targ = pad_alloc(type, SVs_PADTMP); | |
9082 | } | |
9083 | else { | |
9084 | o->op_private = gwop->op_private = OPpGREP_LEX; | |
9085 | gwop->op_targ = o->op_targ = offset; | |
9086 | } | |
79072805 | 9087 | |
11343788 | 9088 | kid = cLISTOPo->op_first->op_sibling; |
a0d0e21e | 9089 | for (kid = kid->op_sibling; kid; kid = kid->op_sibling) |
3ad73efd | 9090 | op_lvalue(kid, OP_GREPSTART); |
a0d0e21e | 9091 | |
79072805 LW |
9092 | return (OP*)gwop; |
9093 | } | |
9094 | ||
9095 | OP * | |
cea2e8a9 | 9096 | Perl_ck_index(pTHX_ OP *o) |
79072805 | 9097 | { |
7918f24d NC |
9098 | PERL_ARGS_ASSERT_CK_INDEX; |
9099 | ||
11343788 MB |
9100 | if (o->op_flags & OPf_KIDS) { |
9101 | OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ | |
0b71040e LW |
9102 | if (kid) |
9103 | kid = kid->op_sibling; /* get past "big" */ | |
3b36395d | 9104 | if (kid && kid->op_type == OP_CONST) { |
9a9b5ec9 | 9105 | const bool save_taint = TAINT_get; |
310f4fdb FC |
9106 | SV *sv = kSVOP->op_sv; |
9107 | if ((!SvPOK(sv) || SvNIOKp(sv)) && SvOK(sv) && !SvROK(sv)) { | |
9108 | sv = newSV(0); | |
9109 | sv_copypv(sv, kSVOP->op_sv); | |
9110 | SvREFCNT_dec_NN(kSVOP->op_sv); | |
9111 | kSVOP->op_sv = sv; | |
9112 | } | |
9113 | if (SvOK(sv)) fbm_compile(sv, 0); | |
284167a5 | 9114 | TAINT_set(save_taint); |
9a9b5ec9 DM |
9115 | #ifdef NO_TAINT_SUPPORT |
9116 | PERL_UNUSED_VAR(save_taint); | |
9117 | #endif | |
3b36395d | 9118 | } |
79072805 | 9119 | } |
11343788 | 9120 | return ck_fun(o); |
79072805 LW |
9121 | } |
9122 | ||
9123 | OP * | |
cea2e8a9 | 9124 | Perl_ck_lfun(pTHX_ OP *o) |
79072805 | 9125 | { |
6867be6d | 9126 | const OPCODE type = o->op_type; |
7918f24d NC |
9127 | |
9128 | PERL_ARGS_ASSERT_CK_LFUN; | |
9129 | ||
5dc0d613 | 9130 | return modkids(ck_fun(o), type); |
79072805 LW |
9131 | } |
9132 | ||
9133 | OP * | |
cea2e8a9 | 9134 | Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */ |
69794302 | 9135 | { |
7918f24d NC |
9136 | PERL_ARGS_ASSERT_CK_DEFINED; |
9137 | ||
a2a5de95 | 9138 | if ((o->op_flags & OPf_KIDS)) { |
d0334bed GS |
9139 | switch (cUNOPo->op_first->op_type) { |
9140 | case OP_RV2AV: | |
9141 | case OP_PADAV: | |
9142 | case OP_AASSIGN: /* Is this a good idea? */ | |
d1d15184 | 9143 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 9144 | "defined(@array) is deprecated"); |
d1d15184 | 9145 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 9146 | "\t(Maybe you should just omit the defined()?)\n"); |
69794302 | 9147 | break; |
d0334bed GS |
9148 | case OP_RV2HV: |
9149 | case OP_PADHV: | |
d1d15184 | 9150 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 9151 | "defined(%%hash) is deprecated"); |
d1d15184 | 9152 | Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED), |
a2a5de95 | 9153 | "\t(Maybe you should just omit the defined()?)\n"); |
d0334bed GS |
9154 | break; |
9155 | default: | |
9156 | /* no warning */ | |
9157 | break; | |
9158 | } | |
69794302 MJD |
9159 | } |
9160 | return ck_rfun(o); | |
9161 | } | |
9162 | ||
9163 | OP * | |
e4b7ebf3 RGS |
9164 | Perl_ck_readline(pTHX_ OP *o) |
9165 | { | |
7918f24d NC |
9166 | PERL_ARGS_ASSERT_CK_READLINE; |
9167 | ||
b73e5385 FC |
9168 | if (o->op_flags & OPf_KIDS) { |
9169 | OP *kid = cLISTOPo->op_first; | |
9170 | if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE; | |
9171 | } | |
9172 | else { | |
e4b7ebf3 RGS |
9173 | OP * const newop |
9174 | = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv)); | |
9175 | #ifdef PERL_MAD | |
9176 | op_getmad(o,newop,'O'); | |
9177 | #else | |
9178 | op_free(o); | |
9179 | #endif | |
9180 | return newop; | |
9181 | } | |
9182 | return o; | |
9183 | } | |
9184 | ||
9185 | OP * | |
cea2e8a9 | 9186 | Perl_ck_rfun(pTHX_ OP *o) |
8990e307 | 9187 | { |
6867be6d | 9188 | const OPCODE type = o->op_type; |
7918f24d NC |
9189 | |
9190 | PERL_ARGS_ASSERT_CK_RFUN; | |
9191 | ||
5dc0d613 | 9192 | return refkids(ck_fun(o), type); |
8990e307 LW |
9193 | } |
9194 | ||
9195 | OP * | |
cea2e8a9 | 9196 | Perl_ck_listiob(pTHX_ OP *o) |
79072805 | 9197 | { |
eb578fdb | 9198 | OP *kid; |
aeea060c | 9199 | |
7918f24d NC |
9200 | PERL_ARGS_ASSERT_CK_LISTIOB; |
9201 | ||
11343788 | 9202 | kid = cLISTOPo->op_first; |
79072805 | 9203 | if (!kid) { |
11343788 MB |
9204 | o = force_list(o); |
9205 | kid = cLISTOPo->op_first; | |
79072805 LW |
9206 | } |
9207 | if (kid->op_type == OP_PUSHMARK) | |
9208 | kid = kid->op_sibling; | |
11343788 | 9209 | if (kid && o->op_flags & OPf_STACKED) |
79072805 LW |
9210 | kid = kid->op_sibling; |
9211 | else if (kid && !kid->op_sibling) { /* print HANDLE; */ | |
01050d49 | 9212 | if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE |
3513c740 | 9213 | && !kid->op_folded) { |
11343788 | 9214 | o->op_flags |= OPf_STACKED; /* make it a filehandle */ |
748a9306 | 9215 | kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid)); |
11343788 MB |
9216 | cLISTOPo->op_first->op_sibling = kid; |
9217 | cLISTOPo->op_last = kid; | |
79072805 LW |
9218 | kid = kid->op_sibling; |
9219 | } | |
9220 | } | |
b2ffa427 | 9221 | |
79072805 | 9222 | if (!kid) |
2fcb4757 | 9223 | op_append_elem(o->op_type, o, newDEFSVOP()); |
79072805 | 9224 | |
69974ce6 | 9225 | if (o->op_type == OP_PRTF) return modkids(listkids(o), OP_PRTF); |
2de3dbcc | 9226 | return listkids(o); |
bbce6d69 | 9227 | } |
9228 | ||
9229 | OP * | |
0d863452 RH |
9230 | Perl_ck_smartmatch(pTHX_ OP *o) |
9231 | { | |
97aff369 | 9232 | dVAR; |
a4e74480 | 9233 | PERL_ARGS_ASSERT_CK_SMARTMATCH; |
0d863452 RH |
9234 | if (0 == (o->op_flags & OPf_SPECIAL)) { |
9235 | OP *first = cBINOPo->op_first; | |
9236 | OP *second = first->op_sibling; | |
9237 | ||
9238 | /* Implicitly take a reference to an array or hash */ | |
5f66b61c | 9239 | first->op_sibling = NULL; |
0d863452 RH |
9240 | first = cBINOPo->op_first = ref_array_or_hash(first); |
9241 | second = first->op_sibling = ref_array_or_hash(second); | |
9242 | ||
9243 | /* Implicitly take a reference to a regular expression */ | |
9244 | if (first->op_type == OP_MATCH) { | |
9245 | first->op_type = OP_QR; | |
9246 | first->op_ppaddr = PL_ppaddr[OP_QR]; | |
9247 | } | |
9248 | if (second->op_type == OP_MATCH) { | |
9249 | second->op_type = OP_QR; | |
9250 | second->op_ppaddr = PL_ppaddr[OP_QR]; | |
9251 | } | |
9252 | } | |
9253 | ||
9254 | return o; | |
9255 | } | |
9256 | ||
9257 | ||
9258 | OP * | |
b162f9ea IZ |
9259 | Perl_ck_sassign(pTHX_ OP *o) |
9260 | { | |
3088bf26 | 9261 | dVAR; |
1496a290 | 9262 | OP * const kid = cLISTOPo->op_first; |
7918f24d NC |
9263 | |
9264 | PERL_ARGS_ASSERT_CK_SASSIGN; | |
9265 | ||
b162f9ea IZ |
9266 | /* has a disposable target? */ |
9267 | if ((PL_opargs[kid->op_type] & OA_TARGLEX) | |
6b66af17 GS |
9268 | && !(kid->op_flags & OPf_STACKED) |
9269 | /* Cannot steal the second time! */ | |
1b438339 GG |
9270 | && !(kid->op_private & OPpTARGET_MY) |
9271 | /* Keep the full thing for madskills */ | |
9272 | && !PL_madskills | |
9273 | ) | |
b162f9ea | 9274 | { |
551405c4 | 9275 | OP * const kkid = kid->op_sibling; |
b162f9ea IZ |
9276 | |
9277 | /* Can just relocate the target. */ | |
2c2d71f5 JH |
9278 | if (kkid && kkid->op_type == OP_PADSV |
9279 | && !(kkid->op_private & OPpLVAL_INTRO)) | |
9280 | { | |
b162f9ea | 9281 | kid->op_targ = kkid->op_targ; |
743e66e6 | 9282 | kkid->op_targ = 0; |
b162f9ea IZ |
9283 | /* Now we do not need PADSV and SASSIGN. */ |
9284 | kid->op_sibling = o->op_sibling; /* NULL */ | |
9285 | cLISTOPo->op_first = NULL; | |
9286 | op_free(o); | |
9287 | op_free(kkid); | |
9288 | kid->op_private |= OPpTARGET_MY; /* Used for context settings */ | |
9289 | return kid; | |
9290 | } | |
9291 | } | |
c5917253 NC |
9292 | if (kid->op_sibling) { |
9293 | OP *kkid = kid->op_sibling; | |
a1fba7eb FC |
9294 | /* For state variable assignment, kkid is a list op whose op_last |
9295 | is a padsv. */ | |
9296 | if ((kkid->op_type == OP_PADSV || | |
9297 | (kkid->op_type == OP_LIST && | |
9298 | (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV | |
9299 | ) | |
9300 | ) | |
c5917253 NC |
9301 | && (kkid->op_private & OPpLVAL_INTRO) |
9302 | && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) { | |
9303 | const PADOFFSET target = kkid->op_targ; | |
9304 | OP *const other = newOP(OP_PADSV, | |
9305 | kkid->op_flags | |
9306 | | ((kkid->op_private & ~OPpLVAL_INTRO) << 8)); | |
9307 | OP *const first = newOP(OP_NULL, 0); | |
9308 | OP *const nullop = newCONDOP(0, first, o, other); | |
9309 | OP *const condop = first->op_next; | |
9310 | /* hijacking PADSTALE for uninitialized state variables */ | |
9311 | SvPADSTALE_on(PAD_SVl(target)); | |
9312 | ||
9313 | condop->op_type = OP_ONCE; | |
9314 | condop->op_ppaddr = PL_ppaddr[OP_ONCE]; | |
9315 | condop->op_targ = target; | |
9316 | other->op_targ = target; | |
9317 | ||
95562366 | 9318 | /* Because we change the type of the op here, we will skip the |
486ec47a | 9319 | assignment binop->op_last = binop->op_first->op_sibling; at the |
95562366 NC |
9320 | end of Perl_newBINOP(). So need to do it here. */ |
9321 | cBINOPo->op_last = cBINOPo->op_first->op_sibling; | |
9322 | ||
c5917253 NC |
9323 | return nullop; |
9324 | } | |
9325 | } | |
b162f9ea IZ |
9326 | return o; |
9327 | } | |
9328 | ||
9329 | OP * | |
cea2e8a9 | 9330 | Perl_ck_match(pTHX_ OP *o) |
79072805 | 9331 | { |
97aff369 | 9332 | dVAR; |
7918f24d NC |
9333 | |
9334 | PERL_ARGS_ASSERT_CK_MATCH; | |
9335 | ||
0d863452 | 9336 | if (o->op_type != OP_QR && PL_compcv) { |
cc76b5cc | 9337 | const PADOFFSET offset = pad_findmy_pvs("$_", 0); |
00b1698f | 9338 | if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) { |
59f00321 RGS |
9339 | o->op_targ = offset; |
9340 | o->op_private |= OPpTARGET_MY; | |
9341 | } | |
9342 | } | |
9343 | if (o->op_type == OP_MATCH || o->op_type == OP_QR) | |
9344 | o->op_private |= OPpRUNTIME; | |
11343788 | 9345 | return o; |
79072805 LW |
9346 | } |
9347 | ||
9348 | OP * | |
f5d5a27c CS |
9349 | Perl_ck_method(pTHX_ OP *o) |
9350 | { | |
551405c4 | 9351 | OP * const kid = cUNOPo->op_first; |
7918f24d NC |
9352 | |
9353 | PERL_ARGS_ASSERT_CK_METHOD; | |
9354 | ||
f5d5a27c CS |
9355 | if (kid->op_type == OP_CONST) { |
9356 | SV* sv = kSVOP->op_sv; | |
a4fc7abc AL |
9357 | const char * const method = SvPVX_const(sv); |
9358 | if (!(strchr(method, ':') || strchr(method, '\''))) { | |
f5d5a27c | 9359 | OP *cmop; |
e3918bb7 | 9360 | if (!SvIsCOW(sv)) { |
c60dbbc3 | 9361 | sv = newSVpvn_share(method, SvUTF8(sv) ? -(I32)SvCUR(sv) : (I32)SvCUR(sv), 0); |
1c846c1f NIS |
9362 | } |
9363 | else { | |
a0714e2c | 9364 | kSVOP->op_sv = NULL; |
1c846c1f | 9365 | } |
f5d5a27c | 9366 | cmop = newSVOP(OP_METHOD_NAMED, 0, sv); |
eb8433b7 NC |
9367 | #ifdef PERL_MAD |
9368 | op_getmad(o,cmop,'O'); | |
9369 | #else | |
f5d5a27c | 9370 | op_free(o); |
eb8433b7 | 9371 | #endif |
f5d5a27c CS |
9372 | return cmop; |
9373 | } | |
9374 | } | |
9375 | return o; | |
9376 | } | |
9377 | ||
9378 | OP * | |
cea2e8a9 | 9379 | Perl_ck_null(pTHX_ OP *o) |
79072805 | 9380 | { |
7918f24d | 9381 | PERL_ARGS_ASSERT_CK_NULL; |
96a5add6 | 9382 | PERL_UNUSED_CONTEXT; |
11343788 | 9383 | return o; |
79072805 LW |
9384 | } |
9385 | ||
9386 | OP * | |
16fe6d59 GS |
9387 | Perl_ck_open(pTHX_ OP *o) |
9388 | { | |
97aff369 | 9389 | dVAR; |
551405c4 | 9390 | HV * const table = GvHV(PL_hintgv); |
7918f24d NC |
9391 | |
9392 | PERL_ARGS_ASSERT_CK_OPEN; | |
9393 | ||
16fe6d59 | 9394 | if (table) { |
a4fc7abc | 9395 | SV **svp = hv_fetchs(table, "open_IN", FALSE); |
16fe6d59 | 9396 | if (svp && *svp) { |
a79b25b7 VP |
9397 | STRLEN len = 0; |
9398 | const char *d = SvPV_const(*svp, len); | |
9399 | const I32 mode = mode_from_discipline(d, len); | |
16fe6d59 GS |
9400 | if (mode & O_BINARY) |
9401 | o->op_private |= OPpOPEN_IN_RAW; | |
9402 | else if (mode & O_TEXT) | |
9403 | o->op_private |= OPpOPEN_IN_CRLF; | |
9404 | } | |
9405 | ||
a4fc7abc | 9406 | svp = hv_fetchs(table, "open_OUT", FALSE); |
16fe6d59 | 9407 | if (svp && *svp) { |
a79b25b7 VP |
9408 | STRLEN len = 0; |
9409 | const char *d = SvPV_const(*svp, len); | |
9410 | const I32 mode = mode_from_discipline(d, len); | |
16fe6d59 GS |
9411 | if (mode & O_BINARY) |
9412 | o->op_private |= OPpOPEN_OUT_RAW; | |
9413 | else if (mode & O_TEXT) | |
9414 | o->op_private |= OPpOPEN_OUT_CRLF; | |
9415 | } | |
9416 | } | |
8d7403e6 RGS |
9417 | if (o->op_type == OP_BACKTICK) { |
9418 | if (!(o->op_flags & OPf_KIDS)) { | |
e4b7ebf3 RGS |
9419 | OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP()); |
9420 | #ifdef PERL_MAD | |
9421 | op_getmad(o,newop,'O'); | |
9422 | #else | |
8d7403e6 | 9423 | op_free(o); |
e4b7ebf3 RGS |
9424 | #endif |
9425 | return newop; | |
8d7403e6 | 9426 | } |
16fe6d59 | 9427 | return o; |
8d7403e6 | 9428 | } |
3b82e551 JH |
9429 | { |
9430 | /* In case of three-arg dup open remove strictness | |
9431 | * from the last arg if it is a bareword. */ | |
551405c4 AL |
9432 | OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */ |
9433 | OP * const last = cLISTOPx(o)->op_last; /* The bareword. */ | |
3b82e551 | 9434 | OP *oa; |
b15aece3 | 9435 | const char *mode; |
3b82e551 JH |
9436 | |
9437 | if ((last->op_type == OP_CONST) && /* The bareword. */ | |
9438 | (last->op_private & OPpCONST_BARE) && | |
9439 | (last->op_private & OPpCONST_STRICT) && | |
9440 | (oa = first->op_sibling) && /* The fh. */ | |
9441 | (oa = oa->op_sibling) && /* The mode. */ | |
ea1d064a | 9442 | (oa->op_type == OP_CONST) && |
3b82e551 | 9443 | SvPOK(((SVOP*)oa)->op_sv) && |
b15aece3 | 9444 | (mode = SvPVX_const(((SVOP*)oa)->op_sv)) && |
3b82e551 JH |
9445 | mode[0] == '>' && mode[1] == '&' && /* A dup open. */ |
9446 | (last == oa->op_sibling)) /* The bareword. */ | |
9447 | last->op_private &= ~OPpCONST_STRICT; | |
9448 | } | |
16fe6d59 GS |
9449 | return ck_fun(o); |
9450 | } | |
9451 | ||
9452 | OP * | |
cea2e8a9 | 9453 | Perl_ck_repeat(pTHX_ OP *o) |
79072805 | 9454 | { |
7918f24d NC |
9455 | PERL_ARGS_ASSERT_CK_REPEAT; |
9456 | ||
11343788 MB |
9457 | if (cBINOPo->op_first->op_flags & OPf_PARENS) { |
9458 | o->op_private |= OPpREPEAT_DOLIST; | |
9459 | cBINOPo->op_first = force_list(cBINOPo->op_first); | |
79072805 LW |
9460 | } |
9461 | else | |
11343788 MB |
9462 | scalar(o); |
9463 | return o; | |
79072805 LW |
9464 | } |
9465 | ||
9466 | OP * | |
cea2e8a9 | 9467 | Perl_ck_require(pTHX_ OP *o) |
8990e307 | 9468 | { |
97aff369 | 9469 | dVAR; |
a0714e2c | 9470 | GV* gv = NULL; |
ec4ab249 | 9471 | |
7918f24d NC |
9472 | PERL_ARGS_ASSERT_CK_REQUIRE; |
9473 | ||
11343788 | 9474 | if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */ |
551405c4 | 9475 | SVOP * const kid = (SVOP*)cUNOPo->op_first; |
8990e307 LW |
9476 | |
9477 | if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) { | |
551405c4 | 9478 | SV * const sv = kid->op_sv; |
5c144d81 | 9479 | U32 was_readonly = SvREADONLY(sv); |
8990e307 | 9480 | char *s; |
cfff9797 NC |
9481 | STRLEN len; |
9482 | const char *end; | |
5c144d81 NC |
9483 | |
9484 | if (was_readonly) { | |
5c144d81 | 9485 | SvREADONLY_off(sv); |
5c144d81 | 9486 | } |
e3918bb7 | 9487 | if (SvIsCOW(sv)) sv_force_normal_flags(sv, 0); |
5c144d81 | 9488 | |
cfff9797 NC |
9489 | s = SvPVX(sv); |
9490 | len = SvCUR(sv); | |
9491 | end = s + len; | |
9492 | for (; s < end; s++) { | |
a0d0e21e LW |
9493 | if (*s == ':' && s[1] == ':') { |
9494 | *s = '/'; | |
5c6b2528 | 9495 | Move(s+2, s+1, end - s - 1, char); |
cfff9797 | 9496 | --end; |
a0d0e21e | 9497 | } |
8990e307 | 9498 | } |
cfff9797 | 9499 | SvEND_set(sv, end); |
396482e1 | 9500 | sv_catpvs(sv, ".pm"); |
5c144d81 | 9501 | SvFLAGS(sv) |= was_readonly; |
8990e307 LW |
9502 | } |
9503 | } | |
ec4ab249 | 9504 | |
a72a1c8b RGS |
9505 | if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */ |
9506 | /* handle override, if any */ | |
fafc274c | 9507 | gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV); |
d6a985f2 | 9508 | if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) { |
a4fc7abc | 9509 | GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE); |
a0714e2c | 9510 | gv = gvp ? *gvp : NULL; |
d6a985f2 | 9511 | } |
a72a1c8b | 9512 | } |
ec4ab249 | 9513 | |
b9f751c0 | 9514 | if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) { |
7c864bb3 VP |
9515 | OP *kid, *newop; |
9516 | if (o->op_flags & OPf_KIDS) { | |
9517 | kid = cUNOPo->op_first; | |
9518 | cUNOPo->op_first = NULL; | |
9519 | } | |
9520 | else { | |
9521 | kid = newDEFSVOP(); | |
9522 | } | |
f11453cb | 9523 | #ifndef PERL_MAD |
ec4ab249 | 9524 | op_free(o); |
eb8433b7 | 9525 | #endif |
d1bef648 | 9526 | newop = newUNOP(OP_ENTERSUB, OPf_STACKED, |
2fcb4757 | 9527 | op_append_elem(OP_LIST, kid, |
f11453cb NC |
9528 | scalar(newUNOP(OP_RV2CV, 0, |
9529 | newGVOP(OP_GV, 0, | |
d1bef648 | 9530 | gv))))); |
f11453cb | 9531 | op_getmad(o,newop,'O'); |
eb8433b7 | 9532 | return newop; |
ec4ab249 GA |
9533 | } |
9534 | ||
021f53de | 9535 | return scalar(ck_fun(o)); |
8990e307 LW |
9536 | } |
9537 | ||
78f9721b SM |
9538 | OP * |
9539 | Perl_ck_return(pTHX_ OP *o) | |
9540 | { | |
97aff369 | 9541 | dVAR; |
e91684bf | 9542 | OP *kid; |
7918f24d NC |
9543 | |
9544 | PERL_ARGS_ASSERT_CK_RETURN; | |
9545 | ||
e91684bf | 9546 | kid = cLISTOPo->op_first->op_sibling; |
78f9721b | 9547 | if (CvLVALUE(PL_compcv)) { |
e91684bf | 9548 | for (; kid; kid = kid->op_sibling) |
3ad73efd | 9549 | op_lvalue(kid, OP_LEAVESUBLV); |
78f9721b | 9550 | } |
e91684bf | 9551 | |
78f9721b SM |
9552 | return o; |
9553 | } | |
9554 | ||
79072805 | 9555 | OP * |
cea2e8a9 | 9556 | Perl_ck_select(pTHX_ OP *o) |
79072805 | 9557 | { |
27da23d5 | 9558 | dVAR; |
c07a80fd | 9559 | OP* kid; |
7918f24d NC |
9560 | |
9561 | PERL_ARGS_ASSERT_CK_SELECT; | |
9562 | ||
11343788 MB |
9563 | if (o->op_flags & OPf_KIDS) { |
9564 | kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ | |
2304df62 | 9565 | if (kid && kid->op_sibling) { |
11343788 | 9566 | o->op_type = OP_SSELECT; |
22c35a8c | 9567 | o->op_ppaddr = PL_ppaddr[OP_SSELECT]; |
11343788 | 9568 | o = ck_fun(o); |
985b9e54 | 9569 | return fold_constants(op_integerize(op_std_init(o))); |
79072805 LW |
9570 | } |
9571 | } | |
11343788 MB |
9572 | o = ck_fun(o); |
9573 | kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ | |
c07a80fd | 9574 | if (kid && kid->op_type == OP_RV2GV) |
9575 | kid->op_private &= ~HINT_STRICT_REFS; | |
11343788 | 9576 | return o; |
79072805 LW |
9577 | } |
9578 | ||
9579 | OP * | |
cea2e8a9 | 9580 | Perl_ck_shift(pTHX_ OP *o) |
79072805 | 9581 | { |
97aff369 | 9582 | dVAR; |
6867be6d | 9583 | const I32 type = o->op_type; |
79072805 | 9584 | |
7918f24d NC |
9585 | PERL_ARGS_ASSERT_CK_SHIFT; |
9586 | ||
11343788 | 9587 | if (!(o->op_flags & OPf_KIDS)) { |
538f5756 RZ |
9588 | OP *argop; |
9589 | ||
9590 | if (!CvUNIQUE(PL_compcv)) { | |
9591 | o->op_flags |= OPf_SPECIAL; | |
9592 | return o; | |
9593 | } | |
9594 | ||
9595 | argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv))); | |
eb8433b7 | 9596 | #ifdef PERL_MAD |
790427a5 DM |
9597 | { |
9598 | OP * const oldo = o; | |
9599 | o = newUNOP(type, 0, scalar(argop)); | |
9600 | op_getmad(oldo,o,'O'); | |
9601 | return o; | |
9602 | } | |
eb8433b7 | 9603 | #else |
821005df | 9604 | op_free(o); |
6d4ff0d2 | 9605 | return newUNOP(type, 0, scalar(argop)); |
eb8433b7 | 9606 | #endif |
79072805 | 9607 | } |
d4fc4415 | 9608 | return scalar(ck_fun(o)); |
79072805 LW |
9609 | } |
9610 | ||
9611 | OP * | |
cea2e8a9 | 9612 | Perl_ck_sort(pTHX_ OP *o) |
79072805 | 9613 | { |
97aff369 | 9614 | dVAR; |
8e3f9bdf | 9615 | OP *firstkid; |
f65493df | 9616 | OP *kid; |
c3258369 FC |
9617 | HV * const hinthv = |
9618 | PL_hints & HINT_LOCALIZE_HH ? GvHV(PL_hintgv) : NULL; | |
f65493df | 9619 | U8 stacked; |
bbce6d69 | 9620 | |
7918f24d NC |
9621 | PERL_ARGS_ASSERT_CK_SORT; |
9622 | ||
354dd559 | 9623 | if (hinthv) { |
a4fc7abc | 9624 | SV ** const svp = hv_fetchs(hinthv, "sort", FALSE); |
7b9ef140 | 9625 | if (svp) { |
a4fc7abc | 9626 | const I32 sorthints = (I32)SvIV(*svp); |
7b9ef140 RH |
9627 | if ((sorthints & HINT_SORT_QUICKSORT) != 0) |
9628 | o->op_private |= OPpSORT_QSORT; | |
9629 | if ((sorthints & HINT_SORT_STABLE) != 0) | |
9630 | o->op_private |= OPpSORT_STABLE; | |
9631 | } | |
7b9ef140 RH |
9632 | } |
9633 | ||
354dd559 | 9634 | if (o->op_flags & OPf_STACKED) |
51a19bc0 | 9635 | simplify_sort(o); |
8e3f9bdf | 9636 | firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ |
f65493df | 9637 | if ((stacked = o->op_flags & OPf_STACKED)) { /* may have been cleared */ |
8e3f9bdf | 9638 | OP *kid = cUNOPx(firstkid)->op_first; /* get past null */ |
79072805 | 9639 | |
463ee0b2 | 9640 | if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) { |
5983a79d | 9641 | LINKLIST(kid); |
c650d697 | 9642 | if (kid->op_type == OP_LEAVE) |
93c66552 | 9643 | op_null(kid); /* wipe out leave */ |
c650d697 FC |
9644 | /* Prevent execution from escaping out of the sort block. */ |
9645 | kid->op_next = 0; | |
a0d0e21e | 9646 | |
354dd559 FC |
9647 | /* provide scalar context for comparison function/block */ |
9648 | kid = scalar(firstkid); | |
9649 | kid->op_next = kid; | |
11343788 | 9650 | o->op_flags |= OPf_SPECIAL; |
79072805 | 9651 | } |
8e3f9bdf GS |
9652 | |
9653 | firstkid = firstkid->op_sibling; | |
79072805 | 9654 | } |
bbce6d69 | 9655 | |
f65493df | 9656 | for (kid = firstkid; kid; kid = kid->op_sibling) { |
e9d9e6f3 FC |
9657 | /* provide list context for arguments */ |
9658 | list(kid); | |
f65493df FC |
9659 | if (stacked) |
9660 | op_lvalue(kid, OP_GREPSTART); | |
9661 | } | |
8e3f9bdf | 9662 | |
11343788 | 9663 | return o; |
79072805 | 9664 | } |
bda4119b GS |
9665 | |
9666 | STATIC void | |
cea2e8a9 | 9667 | S_simplify_sort(pTHX_ OP *o) |
9c007264 | 9668 | { |
97aff369 | 9669 | dVAR; |
eb578fdb | 9670 | OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */ |
9c007264 | 9671 | OP *k; |
eb209983 | 9672 | int descending; |
350de78d | 9673 | GV *gv; |
770526c1 | 9674 | const char *gvname; |
8023b711 | 9675 | bool have_scopeop; |
7918f24d NC |
9676 | |
9677 | PERL_ARGS_ASSERT_SIMPLIFY_SORT; | |
9678 | ||
fafc274c NC |
9679 | GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV)); |
9680 | GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV)); | |
82092f1d | 9681 | kid = kUNOP->op_first; /* get past null */ |
8023b711 FC |
9682 | if (!(have_scopeop = kid->op_type == OP_SCOPE) |
9683 | && kid->op_type != OP_LEAVE) | |
9c007264 JH |
9684 | return; |
9685 | kid = kLISTOP->op_last; /* get past scope */ | |
9686 | switch(kid->op_type) { | |
9687 | case OP_NCMP: | |
9688 | case OP_I_NCMP: | |
9689 | case OP_SCMP: | |
8023b711 | 9690 | if (!have_scopeop) goto padkids; |
9c007264 JH |
9691 | break; |
9692 | default: | |
9693 | return; | |
9694 | } | |
9695 | k = kid; /* remember this node*/ | |
271c8bde FC |
9696 | if (kBINOP->op_first->op_type != OP_RV2SV |
9697 | || kBINOP->op_last ->op_type != OP_RV2SV) | |
9698 | { | |
9699 | /* | |
9700 | Warn about my($a) or my($b) in a sort block, *if* $a or $b is | |
9701 | then used in a comparison. This catches most, but not | |
9702 | all cases. For instance, it catches | |
9703 | sort { my($a); $a <=> $b } | |
9704 | but not | |
9705 | sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; } | |
9706 | (although why you'd do that is anyone's guess). | |
9707 | */ | |
9708 | ||
9709 | padkids: | |
9710 | if (!ckWARN(WARN_SYNTAX)) return; | |
9711 | kid = kBINOP->op_first; | |
9712 | do { | |
9713 | if (kid->op_type == OP_PADSV) { | |
9714 | SV * const name = AvARRAY(PL_comppad_name)[kid->op_targ]; | |
9715 | if (SvCUR(name) == 2 && *SvPVX(name) == '$' | |
9716 | && (SvPVX(name)[1] == 'a' || SvPVX(name)[1] == 'b')) | |
a2e39214 | 9717 | /* diag_listed_as: "my %s" used in sort comparison */ |
271c8bde | 9718 | Perl_warner(aTHX_ packWARN(WARN_SYNTAX), |
a2e39214 FC |
9719 | "\"%s %s\" used in sort comparison", |
9720 | SvPAD_STATE(name) ? "state" : "my", | |
271c8bde FC |
9721 | SvPVX(name)); |
9722 | } | |
9723 | } while ((kid = kid->op_sibling)); | |
9c007264 | 9724 | return; |
271c8bde | 9725 | } |
9c007264 JH |
9726 | kid = kBINOP->op_first; /* get past cmp */ |
9727 | if (kUNOP->op_first->op_type != OP_GV) | |
9728 | return; | |
9729 | kid = kUNOP->op_first; /* get past rv2sv */ | |
638eceb6 | 9730 | gv = kGVOP_gv; |
350de78d | 9731 | if (GvSTASH(gv) != PL_curstash) |
9c007264 | 9732 | return; |
770526c1 NC |
9733 | gvname = GvNAME(gv); |
9734 | if (*gvname == 'a' && gvname[1] == '\0') | |
eb209983 | 9735 | descending = 0; |
770526c1 | 9736 | else if (*gvname == 'b' && gvname[1] == '\0') |
eb209983 | 9737 | descending = 1; |
9c007264 JH |
9738 | else |
9739 | return; | |
eb209983 | 9740 | |
9c007264 | 9741 | kid = k; /* back to cmp */ |
271c8bde | 9742 | /* already checked above that it is rv2sv */ |
9c007264 JH |
9743 | kid = kBINOP->op_last; /* down to 2nd arg */ |
9744 | if (kUNOP->op_first->op_type != OP_GV) | |
9745 | return; | |
9746 | kid = kUNOP->op_first; /* get past rv2sv */ | |
638eceb6 | 9747 | gv = kGVOP_gv; |
770526c1 NC |
9748 | if (GvSTASH(gv) != PL_curstash) |
9749 | return; | |
9750 | gvname = GvNAME(gv); | |
9751 | if ( descending | |
9752 | ? !(*gvname == 'a' && gvname[1] == '\0') | |
9753 | : !(*gvname == 'b' && gvname[1] == '\0')) | |
9c007264 JH |
9754 | return; |
9755 | o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL); | |
eb209983 NC |
9756 | if (descending) |
9757 | o->op_private |= OPpSORT_DESCEND; | |
9c007264 JH |
9758 | if (k->op_type == OP_NCMP) |
9759 | o->op_private |= OPpSORT_NUMERIC; | |
9760 | if (k->op_type == OP_I_NCMP) | |
9761 | o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER; | |
e507f050 SM |
9762 | kid = cLISTOPo->op_first->op_sibling; |
9763 | cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */ | |
eb8433b7 NC |
9764 | #ifdef PERL_MAD |
9765 | op_getmad(kid,o,'S'); /* then delete it */ | |
9766 | #else | |
e507f050 | 9767 | op_free(kid); /* then delete it */ |
eb8433b7 | 9768 | #endif |
9c007264 | 9769 | } |
79072805 LW |
9770 | |
9771 | OP * | |
cea2e8a9 | 9772 | Perl_ck_split(pTHX_ OP *o) |
79072805 | 9773 | { |
27da23d5 | 9774 | dVAR; |
eb578fdb | 9775 | OP *kid; |
aeea060c | 9776 | |
7918f24d NC |
9777 | PERL_ARGS_ASSERT_CK_SPLIT; |
9778 | ||
11343788 MB |
9779 | if (o->op_flags & OPf_STACKED) |
9780 | return no_fh_allowed(o); | |
79072805 | 9781 | |
11343788 | 9782 | kid = cLISTOPo->op_first; |
8990e307 | 9783 | if (kid->op_type != OP_NULL) |
5637ef5b | 9784 | Perl_croak(aTHX_ "panic: ck_split, type=%u", (unsigned) kid->op_type); |
8990e307 | 9785 | kid = kid->op_sibling; |
11343788 | 9786 | op_free(cLISTOPo->op_first); |
f126b75f MW |
9787 | if (kid) |
9788 | cLISTOPo->op_first = kid; | |
9789 | else { | |
396482e1 | 9790 | cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" ")); |
11343788 | 9791 | cLISTOPo->op_last = kid; /* There was only one element previously */ |
85e6fe83 | 9792 | } |
79072805 | 9793 | |
de4bf5b3 | 9794 | if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) { |
551405c4 | 9795 | OP * const sibl = kid->op_sibling; |
463ee0b2 | 9796 | kid->op_sibling = 0; |
dbc200c5 | 9797 | kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0, 0); /* OPf_SPECIAL is used to trigger split " " behavior */ |
11343788 MB |
9798 | if (cLISTOPo->op_first == cLISTOPo->op_last) |
9799 | cLISTOPo->op_last = kid; | |
9800 | cLISTOPo->op_first = kid; | |
79072805 LW |
9801 | kid->op_sibling = sibl; |
9802 | } | |
9803 | ||
9804 | kid->op_type = OP_PUSHRE; | |
22c35a8c | 9805 | kid->op_ppaddr = PL_ppaddr[OP_PUSHRE]; |
79072805 | 9806 | scalar(kid); |
a2a5de95 NC |
9807 | if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) { |
9808 | Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP), | |
9809 | "Use of /g modifier is meaningless in split"); | |
f34840d8 | 9810 | } |
79072805 LW |
9811 | |
9812 | if (!kid->op_sibling) | |
2fcb4757 | 9813 | op_append_elem(OP_SPLIT, o, newDEFSVOP()); |
79072805 LW |
9814 | |
9815 | kid = kid->op_sibling; | |
9816 | scalar(kid); | |
9817 | ||
9818 | if (!kid->op_sibling) | |
60041a09 | 9819 | { |
2fcb4757 | 9820 | op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0))); |
60041a09 FC |
9821 | o->op_private |= OPpSPLIT_IMPLIM; |
9822 | } | |
ce3e5c45 | 9823 | assert(kid->op_sibling); |
79072805 LW |
9824 | |
9825 | kid = kid->op_sibling; | |
9826 | scalar(kid); | |
9827 | ||
9828 | if (kid->op_sibling) | |
ce16c625 | 9829 | return too_many_arguments_pv(o,OP_DESC(o), 0); |
79072805 | 9830 | |
11343788 | 9831 | return o; |
79072805 LW |
9832 | } |
9833 | ||
9834 | OP * | |
1c846c1f | 9835 | Perl_ck_join(pTHX_ OP *o) |
eb6e2d6f | 9836 | { |
551405c4 | 9837 | const OP * const kid = cLISTOPo->op_first->op_sibling; |
7918f24d NC |
9838 | |
9839 | PERL_ARGS_ASSERT_CK_JOIN; | |
9840 | ||
041457d9 DM |
9841 | if (kid && kid->op_type == OP_MATCH) { |
9842 | if (ckWARN(WARN_SYNTAX)) { | |
6867be6d | 9843 | const REGEXP *re = PM_GETRE(kPMOP); |
ce16c625 BF |
9844 | const SV *msg = re |
9845 | ? newSVpvn_flags( RX_PRECOMP_const(re), RX_PRELEN(re), | |
9846 | SVs_TEMP | ( RX_UTF8(re) ? SVf_UTF8 : 0 ) ) | |
9847 | : newSVpvs_flags( "STRING", SVs_TEMP ); | |
9014280d | 9848 | Perl_warner(aTHX_ packWARN(WARN_SYNTAX), |
ce16c625 BF |
9849 | "/%"SVf"/ should probably be written as \"%"SVf"\"", |
9850 | SVfARG(msg), SVfARG(msg)); | |
eb6e2d6f GS |
9851 | } |
9852 | } | |
9853 | return ck_fun(o); | |
9854 | } | |
9855 | ||
d9088386 Z |
9856 | /* |
9857 | =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags | |
9858 | ||
9859 | Examines an op, which is expected to identify a subroutine at runtime, | |
9860 | and attempts to determine at compile time which subroutine it identifies. | |
9861 | This is normally used during Perl compilation to determine whether | |
9862 | a prototype can be applied to a function call. I<cvop> is the op | |
9863 | being considered, normally an C<rv2cv> op. A pointer to the identified | |
9864 | subroutine is returned, if it could be determined statically, and a null | |
9865 | pointer is returned if it was not possible to determine statically. | |
9866 | ||
9867 | Currently, the subroutine can be identified statically if the RV that the | |
9868 | C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op. | |
9869 | A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is | |
9870 | suitable if the constant value must be an RV pointing to a CV. Details of | |
9871 | this process may change in future versions of Perl. If the C<rv2cv> op | |
9872 | has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify | |
9873 | the subroutine statically: this flag is used to suppress compile-time | |
9874 | magic on a subroutine call, forcing it to use default runtime behaviour. | |
9875 | ||
9876 | If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling | |
9877 | of a GV reference is modified. If a GV was examined and its CV slot was | |
9878 | found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set. | |
9879 | If the op is not optimised away, and the CV slot is later populated with | |
9880 | a subroutine having a prototype, that flag eventually triggers the warning | |
9881 | "called too early to check prototype". | |
9882 | ||
9883 | If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead | |
9884 | of returning a pointer to the subroutine it returns a pointer to the | |
9885 | GV giving the most appropriate name for the subroutine in this context. | |
9886 | Normally this is just the C<CvGV> of the subroutine, but for an anonymous | |
9887 | (C<CvANON>) subroutine that is referenced through a GV it will be the | |
9888 | referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned. | |
9889 | A null pointer is returned as usual if there is no statically-determinable | |
9890 | subroutine. | |
7918f24d | 9891 | |
d9088386 Z |
9892 | =cut |
9893 | */ | |
9d88f058 | 9894 | |
9a5e6f3c FC |
9895 | /* shared by toke.c:yylex */ |
9896 | CV * | |
9897 | Perl_find_lexical_cv(pTHX_ PADOFFSET off) | |
9898 | { | |
9899 | PADNAME *name = PAD_COMPNAME(off); | |
9900 | CV *compcv = PL_compcv; | |
9901 | while (PadnameOUTER(name)) { | |
9902 | assert(PARENT_PAD_INDEX(name)); | |
9903 | compcv = CvOUTSIDE(PL_compcv); | |
9904 | name = PadlistNAMESARRAY(CvPADLIST(compcv)) | |
9905 | [off = PARENT_PAD_INDEX(name)]; | |
9906 | } | |
9907 | assert(!PadnameIsOUR(name)); | |
3a74e0e2 | 9908 | if (!PadnameIsSTATE(name) && SvMAGICAL(name)) { |
9a5e6f3c FC |
9909 | MAGIC * mg = mg_find(name, PERL_MAGIC_proto); |
9910 | assert(mg); | |
9911 | assert(mg->mg_obj); | |
9912 | return (CV *)mg->mg_obj; | |
9913 | } | |
9914 | return (CV *)AvARRAY(PadlistARRAY(CvPADLIST(compcv))[1])[off]; | |
9915 | } | |
9916 | ||
d9088386 Z |
9917 | CV * |
9918 | Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags) | |
9919 | { | |
9920 | OP *rvop; | |
9921 | CV *cv; | |
9922 | GV *gv; | |
9923 | PERL_ARGS_ASSERT_RV2CV_OP_CV; | |
9924 | if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV)) | |
9925 | Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags); | |
9926 | if (cvop->op_type != OP_RV2CV) | |
9927 | return NULL; | |
9928 | if (cvop->op_private & OPpENTERSUB_AMPER) | |
9929 | return NULL; | |
9930 | if (!(cvop->op_flags & OPf_KIDS)) | |
9931 | return NULL; | |
9932 | rvop = cUNOPx(cvop)->op_first; | |
9933 | switch (rvop->op_type) { | |
9934 | case OP_GV: { | |
9935 | gv = cGVOPx_gv(rvop); | |
9936 | cv = GvCVu(gv); | |
9937 | if (!cv) { | |
9938 | if (flags & RV2CVOPCV_MARK_EARLY) | |
9939 | rvop->op_private |= OPpEARLY_CV; | |
9940 | return NULL; | |
46fc3d4c | 9941 | } |
d9088386 Z |
9942 | } break; |
9943 | case OP_CONST: { | |
9944 | SV *rv = cSVOPx_sv(rvop); | |
9945 | if (!SvROK(rv)) | |
9946 | return NULL; | |
9947 | cv = (CV*)SvRV(rv); | |
9948 | gv = NULL; | |
9949 | } break; | |
279d09bf | 9950 | case OP_PADCV: { |
9a5e6f3c | 9951 | cv = find_lexical_cv(rvop->op_targ); |
279d09bf FC |
9952 | gv = NULL; |
9953 | } break; | |
d9088386 Z |
9954 | default: { |
9955 | return NULL; | |
9956 | } break; | |
4633a7c4 | 9957 | } |
d9088386 Z |
9958 | if (SvTYPE((SV*)cv) != SVt_PVCV) |
9959 | return NULL; | |
9960 | if (flags & RV2CVOPCV_RETURN_NAME_GV) { | |
9961 | if (!CvANON(cv) || !gv) | |
9962 | gv = CvGV(cv); | |
9963 | return (CV*)gv; | |
9964 | } else { | |
9965 | return cv; | |
7a52d87a | 9966 | } |
d9088386 | 9967 | } |
9d88f058 | 9968 | |
d9088386 Z |
9969 | /* |
9970 | =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop | |
824afba1 | 9971 | |
d9088386 Z |
9972 | Performs the default fixup of the arguments part of an C<entersub> |
9973 | op tree. This consists of applying list context to each of the | |
9974 | argument ops. This is the standard treatment used on a call marked | |
9975 | with C<&>, or a method call, or a call through a subroutine reference, | |
9976 | or any other call where the callee can't be identified at compile time, | |
9977 | or a call where the callee has no prototype. | |
824afba1 | 9978 | |
d9088386 Z |
9979 | =cut |
9980 | */ | |
340458b5 | 9981 | |
d9088386 Z |
9982 | OP * |
9983 | Perl_ck_entersub_args_list(pTHX_ OP *entersubop) | |
9984 | { | |
9985 | OP *aop; | |
9986 | PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST; | |
9987 | aop = cUNOPx(entersubop)->op_first; | |
9988 | if (!aop->op_sibling) | |
9989 | aop = cUNOPx(aop)->op_first; | |
9990 | for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) { | |
9991 | if (!(PL_madskills && aop->op_type == OP_STUB)) { | |
9992 | list(aop); | |
3ad73efd | 9993 | op_lvalue(aop, OP_ENTERSUB); |
d9088386 Z |
9994 | } |
9995 | } | |
9996 | return entersubop; | |
9997 | } | |
340458b5 | 9998 | |
d9088386 Z |
9999 | /* |
10000 | =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv | |
10001 | ||
10002 | Performs the fixup of the arguments part of an C<entersub> op tree | |
10003 | based on a subroutine prototype. This makes various modifications to | |
10004 | the argument ops, from applying context up to inserting C<refgen> ops, | |
10005 | and checking the number and syntactic types of arguments, as directed by | |
10006 | the prototype. This is the standard treatment used on a subroutine call, | |
10007 | not marked with C<&>, where the callee can be identified at compile time | |
10008 | and has a prototype. | |
10009 | ||
10010 | I<protosv> supplies the subroutine prototype to be applied to the call. | |
10011 | It may be a normal defined scalar, of which the string value will be used. | |
10012 | Alternatively, for convenience, it may be a subroutine object (a C<CV*> | |
10013 | that has been cast to C<SV*>) which has a prototype. The prototype | |
10014 | supplied, in whichever form, does not need to match the actual callee | |
10015 | referenced by the op tree. | |
10016 | ||
10017 | If the argument ops disagree with the prototype, for example by having | |
10018 | an unacceptable number of arguments, a valid op tree is returned anyway. | |
10019 | The error is reflected in the parser state, normally resulting in a single | |
10020 | exception at the top level of parsing which covers all the compilation | |
10021 | errors that occurred. In the error message, the callee is referred to | |
10022 | by the name defined by the I<namegv> parameter. | |
cbf82dd0 | 10023 | |
d9088386 Z |
10024 | =cut |
10025 | */ | |
10026 | ||
10027 | OP * | |
10028 | Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv) | |
10029 | { | |
10030 | STRLEN proto_len; | |
10031 | const char *proto, *proto_end; | |
10032 | OP *aop, *prev, *cvop; | |
10033 | int optional = 0; | |
10034 | I32 arg = 0; | |
10035 | I32 contextclass = 0; | |
10036 | const char *e = NULL; | |
10037 | PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO; | |
10038 | if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv)) | |
cb197492 | 10039 | Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto, " |
5637ef5b | 10040 | "flags=%lx", (unsigned long) SvFLAGS(protosv)); |
8fa6a409 FC |
10041 | if (SvTYPE(protosv) == SVt_PVCV) |
10042 | proto = CvPROTO(protosv), proto_len = CvPROTOLEN(protosv); | |
10043 | else proto = SvPV(protosv, proto_len); | |
d16269d8 | 10044 | proto = S_strip_spaces(aTHX_ proto, &proto_len); |
d9088386 Z |
10045 | proto_end = proto + proto_len; |
10046 | aop = cUNOPx(entersubop)->op_first; | |
10047 | if (!aop->op_sibling) | |
10048 | aop = cUNOPx(aop)->op_first; | |
10049 | prev = aop; | |
10050 | aop = aop->op_sibling; | |
10051 | for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ; | |
10052 | while (aop != cvop) { | |
10053 | OP* o3; | |
10054 | if (PL_madskills && aop->op_type == OP_STUB) { | |
10055 | aop = aop->op_sibling; | |
10056 | continue; | |
10057 | } | |
10058 | if (PL_madskills && aop->op_type == OP_NULL) | |
10059 | o3 = ((UNOP*)aop)->op_first; | |
10060 | else | |
10061 | o3 = aop; | |
10062 | ||
10063 | if (proto >= proto_end) | |
ce16c625 | 10064 | return too_many_arguments_sv(entersubop, gv_ename(namegv), 0); |
d9088386 Z |
10065 | |
10066 | switch (*proto) { | |
597dcb2b DG |
10067 | case ';': |
10068 | optional = 1; | |
10069 | proto++; | |
10070 | continue; | |
10071 | case '_': | |
10072 | /* _ must be at the end */ | |
34daab0f | 10073 | if (proto[1] && !strchr(";@%", proto[1])) |
597dcb2b DG |
10074 | goto oops; |
10075 | case '$': | |
10076 | proto++; | |
10077 | arg++; | |
10078 | scalar(aop); | |
10079 | break; | |
10080 | case '%': | |
10081 | case '@': | |
10082 | list(aop); | |
10083 | arg++; | |
10084 | break; | |
10085 | case '&': | |
10086 | proto++; | |
10087 | arg++; | |
10088 | if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF) | |
7b3b0904 | 10089 | bad_type_gv(arg, |
597dcb2b | 10090 | arg == 1 ? "block or sub {}" : "sub {}", |
7b3b0904 | 10091 | namegv, 0, o3); |
597dcb2b DG |
10092 | break; |
10093 | case '*': | |
10094 | /* '*' allows any scalar type, including bareword */ | |
10095 | proto++; | |
10096 | arg++; | |
10097 | if (o3->op_type == OP_RV2GV) | |
10098 | goto wrapref; /* autoconvert GLOB -> GLOBref */ | |
10099 | else if (o3->op_type == OP_CONST) | |
10100 | o3->op_private &= ~OPpCONST_STRICT; | |
10101 | else if (o3->op_type == OP_ENTERSUB) { | |
10102 | /* accidental subroutine, revert to bareword */ | |
10103 | OP *gvop = ((UNOP*)o3)->op_first; | |
10104 | if (gvop && gvop->op_type == OP_NULL) { | |
10105 | gvop = ((UNOP*)gvop)->op_first; | |
10106 | if (gvop) { | |
10107 | for (; gvop->op_sibling; gvop = gvop->op_sibling) | |
10108 | ; | |
10109 | if (gvop && | |
10110 | (gvop->op_private & OPpENTERSUB_NOPAREN) && | |
10111 | (gvop = ((UNOP*)gvop)->op_first) && | |
10112 | gvop->op_type == OP_GV) | |
10113 | { | |
10114 | GV * const gv = cGVOPx_gv(gvop); | |
10115 | OP * const sibling = aop->op_sibling; | |
10116 | SV * const n = newSVpvs(""); | |
eb8433b7 | 10117 | #ifdef PERL_MAD |
597dcb2b | 10118 | OP * const oldaop = aop; |
eb8433b7 | 10119 | #else |
597dcb2b | 10120 | op_free(aop); |
eb8433b7 | 10121 | #endif |
597dcb2b DG |
10122 | gv_fullname4(n, gv, "", FALSE); |
10123 | aop = newSVOP(OP_CONST, 0, n); | |
10124 | op_getmad(oldaop,aop,'O'); | |
10125 | prev->op_sibling = aop; | |
10126 | aop->op_sibling = sibling; | |
10127 | } | |
9675f7ac GS |
10128 | } |
10129 | } | |
10130 | } | |
597dcb2b | 10131 | scalar(aop); |
c035a075 DG |
10132 | break; |
10133 | case '+': | |
10134 | proto++; | |
10135 | arg++; | |
10136 | if (o3->op_type == OP_RV2AV || | |
10137 | o3->op_type == OP_PADAV || | |
10138 | o3->op_type == OP_RV2HV || | |
10139 | o3->op_type == OP_PADHV | |
10140 | ) { | |
10141 | goto wrapref; | |
10142 | } | |
10143 | scalar(aop); | |
d9088386 | 10144 | break; |
597dcb2b DG |
10145 | case '[': case ']': |
10146 | goto oops; | |
d9088386 | 10147 | break; |
597dcb2b DG |
10148 | case '\\': |
10149 | proto++; | |
10150 | arg++; | |
10151 | again: | |
10152 | switch (*proto++) { | |
10153 | case '[': | |
10154 | if (contextclass++ == 0) { | |
10155 | e = strchr(proto, ']'); | |
10156 | if (!e || e == proto) | |
10157 | goto oops; | |
10158 | } | |
10159 | else | |
10160 | goto oops; | |
10161 | goto again; | |
10162 | break; | |
10163 | case ']': | |
10164 | if (contextclass) { | |
10165 | const char *p = proto; | |
10166 | const char *const end = proto; | |
10167 | contextclass = 0; | |
062678b2 FC |
10168 | while (*--p != '[') |
10169 | /* \[$] accepts any scalar lvalue */ | |
10170 | if (*p == '$' | |
10171 | && Perl_op_lvalue_flags(aTHX_ | |
10172 | scalar(o3), | |
10173 | OP_READ, /* not entersub */ | |
10174 | OP_LVALUE_NO_CROAK | |
10175 | )) goto wrapref; | |
7b3b0904 | 10176 | bad_type_gv(arg, Perl_form(aTHX_ "one of %.*s", |
597dcb2b | 10177 | (int)(end - p), p), |
7b3b0904 | 10178 | namegv, 0, o3); |
597dcb2b DG |
10179 | } else |
10180 | goto oops; | |
10181 | break; | |
10182 | case '*': | |
10183 | if (o3->op_type == OP_RV2GV) | |
10184 | goto wrapref; | |
10185 | if (!contextclass) | |
7b3b0904 | 10186 | bad_type_gv(arg, "symbol", namegv, 0, o3); |
597dcb2b DG |
10187 | break; |
10188 | case '&': | |
10189 | if (o3->op_type == OP_ENTERSUB) | |
10190 | goto wrapref; | |
10191 | if (!contextclass) | |
7b3b0904 | 10192 | bad_type_gv(arg, "subroutine entry", namegv, 0, |
597dcb2b DG |
10193 | o3); |
10194 | break; | |
10195 | case '$': | |
10196 | if (o3->op_type == OP_RV2SV || | |
10197 | o3->op_type == OP_PADSV || | |
10198 | o3->op_type == OP_HELEM || | |
10199 | o3->op_type == OP_AELEM) | |
10200 | goto wrapref; | |
062678b2 FC |
10201 | if (!contextclass) { |
10202 | /* \$ accepts any scalar lvalue */ | |
10203 | if (Perl_op_lvalue_flags(aTHX_ | |
10204 | scalar(o3), | |
10205 | OP_READ, /* not entersub */ | |
10206 | OP_LVALUE_NO_CROAK | |
10207 | )) goto wrapref; | |
7b3b0904 | 10208 | bad_type_gv(arg, "scalar", namegv, 0, o3); |
062678b2 | 10209 | } |
597dcb2b DG |
10210 | break; |
10211 | case '@': | |
10212 | if (o3->op_type == OP_RV2AV || | |
10213 | o3->op_type == OP_PADAV) | |
10214 | goto wrapref; | |
10215 | if (!contextclass) | |
7b3b0904 | 10216 | bad_type_gv(arg, "array", namegv, 0, o3); |
597dcb2b DG |
10217 | break; |
10218 | case '%': | |
10219 | if (o3->op_type == OP_RV2HV || | |
10220 | o3->op_type == OP_PADHV) | |
10221 | goto wrapref; | |
10222 | if (!contextclass) | |
7b3b0904 | 10223 | bad_type_gv(arg, "hash", namegv, 0, o3); |
597dcb2b DG |
10224 | break; |
10225 | wrapref: | |
10226 | { | |
10227 | OP* const kid = aop; | |
10228 | OP* const sib = kid->op_sibling; | |
10229 | kid->op_sibling = 0; | |
10230 | aop = newUNOP(OP_REFGEN, 0, kid); | |
10231 | aop->op_sibling = sib; | |
10232 | prev->op_sibling = aop; | |
10233 | } | |
10234 | if (contextclass && e) { | |
10235 | proto = e + 1; | |
10236 | contextclass = 0; | |
10237 | } | |
10238 | break; | |
10239 | default: goto oops; | |
4633a7c4 | 10240 | } |
597dcb2b DG |
10241 | if (contextclass) |
10242 | goto again; | |
4633a7c4 | 10243 | break; |
597dcb2b DG |
10244 | case ' ': |
10245 | proto++; | |
10246 | continue; | |
10247 | default: | |
108f32a5 BF |
10248 | oops: { |
10249 | SV* const tmpsv = sv_newmortal(); | |
10250 | gv_efullname3(tmpsv, namegv, NULL); | |
10251 | Perl_croak(aTHX_ "Malformed prototype for %"SVf": %"SVf, | |
10252 | SVfARG(tmpsv), SVfARG(protosv)); | |
10253 | } | |
d9088386 Z |
10254 | } |
10255 | ||
3ad73efd | 10256 | op_lvalue(aop, OP_ENTERSUB); |
d9088386 Z |
10257 | prev = aop; |
10258 | aop = aop->op_sibling; | |
10259 | } | |
10260 | if (aop == cvop && *proto == '_') { | |
10261 | /* generate an access to $_ */ | |
10262 | aop = newDEFSVOP(); | |
10263 | aop->op_sibling = prev->op_sibling; | |
10264 | prev->op_sibling = aop; /* instead of cvop */ | |
10265 | } | |
10266 | if (!optional && proto_end > proto && | |
10267 | (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_')) | |
ce16c625 | 10268 | return too_few_arguments_sv(entersubop, gv_ename(namegv), 0); |
d9088386 Z |
10269 | return entersubop; |
10270 | } | |
10271 | ||
10272 | /* | |
10273 | =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv | |
10274 | ||
10275 | Performs the fixup of the arguments part of an C<entersub> op tree either | |
10276 | based on a subroutine prototype or using default list-context processing. | |
10277 | This is the standard treatment used on a subroutine call, not marked | |
10278 | with C<&>, where the callee can be identified at compile time. | |
10279 | ||
10280 | I<protosv> supplies the subroutine prototype to be applied to the call, | |
10281 | or indicates that there is no prototype. It may be a normal scalar, | |
10282 | in which case if it is defined then the string value will be used | |
10283 | as a prototype, and if it is undefined then there is no prototype. | |
10284 | Alternatively, for convenience, it may be a subroutine object (a C<CV*> | |
10285 | that has been cast to C<SV*>), of which the prototype will be used if it | |
10286 | has one. The prototype (or lack thereof) supplied, in whichever form, | |
10287 | does not need to match the actual callee referenced by the op tree. | |
10288 | ||
10289 | If the argument ops disagree with the prototype, for example by having | |
10290 | an unacceptable number of arguments, a valid op tree is returned anyway. | |
10291 | The error is reflected in the parser state, normally resulting in a single | |
10292 | exception at the top level of parsing which covers all the compilation | |
10293 | errors that occurred. In the error message, the callee is referred to | |
10294 | by the name defined by the I<namegv> parameter. | |
10295 | ||
10296 | =cut | |
10297 | */ | |
10298 | ||
10299 | OP * | |
10300 | Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop, | |
10301 | GV *namegv, SV *protosv) | |
10302 | { | |
10303 | PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST; | |
10304 | if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv)) | |
10305 | return ck_entersub_args_proto(entersubop, namegv, protosv); | |
10306 | else | |
10307 | return ck_entersub_args_list(entersubop); | |
10308 | } | |
10309 | ||
4aaa4757 FC |
10310 | OP * |
10311 | Perl_ck_entersub_args_core(pTHX_ OP *entersubop, GV *namegv, SV *protosv) | |
10312 | { | |
10313 | int opnum = SvTYPE(protosv) == SVt_PVCV ? 0 : (int)SvUV(protosv); | |
10314 | OP *aop = cUNOPx(entersubop)->op_first; | |
10315 | ||
10316 | PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_CORE; | |
10317 | ||
10318 | if (!opnum) { | |
14f0f125 | 10319 | OP *cvop; |
4aaa4757 FC |
10320 | if (!aop->op_sibling) |
10321 | aop = cUNOPx(aop)->op_first; | |
4aaa4757 FC |
10322 | aop = aop->op_sibling; |
10323 | for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ; | |
10324 | if (PL_madskills) while (aop != cvop && aop->op_type == OP_STUB) { | |
10325 | aop = aop->op_sibling; | |
4aaa4757 FC |
10326 | } |
10327 | if (aop != cvop) | |
ce16c625 | 10328 | (void)too_many_arguments_pv(entersubop, GvNAME(namegv), 0); |
4aaa4757 FC |
10329 | |
10330 | op_free(entersubop); | |
10331 | switch(GvNAME(namegv)[2]) { | |
10332 | case 'F': return newSVOP(OP_CONST, 0, | |
10333 | newSVpv(CopFILE(PL_curcop),0)); | |
10334 | case 'L': return newSVOP( | |
10335 | OP_CONST, 0, | |
10336 | Perl_newSVpvf(aTHX_ | |
10337 | "%"IVdf, (IV)CopLINE(PL_curcop) | |
10338 | ) | |
10339 | ); | |
10340 | case 'P': return newSVOP(OP_CONST, 0, | |
10341 | (PL_curstash | |
10342 | ? newSVhek(HvNAME_HEK(PL_curstash)) | |
10343 | : &PL_sv_undef | |
10344 | ) | |
10345 | ); | |
10346 | } | |
10347 | assert(0); | |
10348 | } | |
10349 | else { | |
10350 | OP *prev, *cvop; | |
7d789282 | 10351 | U32 flags; |
4aaa4757 FC |
10352 | #ifdef PERL_MAD |
10353 | bool seenarg = FALSE; | |
10354 | #endif | |
10355 | if (!aop->op_sibling) | |
10356 | aop = cUNOPx(aop)->op_first; | |
10357 | ||
10358 | prev = aop; | |
10359 | aop = aop->op_sibling; | |
10360 | prev->op_sibling = NULL; | |
10361 | for (cvop = aop; | |
10362 | cvop->op_sibling; | |
10363 | prev=cvop, cvop = cvop->op_sibling) | |
10364 | #ifdef PERL_MAD | |
10365 | if (PL_madskills && cvop->op_sibling | |
10366 | && cvop->op_type != OP_STUB) seenarg = TRUE | |
10367 | #endif | |
10368 | ; | |
10369 | prev->op_sibling = NULL; | |
7d789282 | 10370 | flags = OPf_SPECIAL * !(cvop->op_private & OPpENTERSUB_NOPAREN); |
4aaa4757 FC |
10371 | op_free(cvop); |
10372 | if (aop == cvop) aop = NULL; | |
10373 | op_free(entersubop); | |
10374 | ||
7d789282 FC |
10375 | if (opnum == OP_ENTEREVAL |
10376 | && GvNAMELEN(namegv)==9 && strnEQ(GvNAME(namegv), "evalbytes", 9)) | |
10377 | flags |= OPpEVAL_BYTES <<8; | |
10378 | ||
4aaa4757 FC |
10379 | switch (PL_opargs[opnum] & OA_CLASS_MASK) { |
10380 | case OA_UNOP: | |
10381 | case OA_BASEOP_OR_UNOP: | |
10382 | case OA_FILESTATOP: | |
7d789282 | 10383 | return aop ? newUNOP(opnum,flags,aop) : newOP(opnum,flags); |
4aaa4757 FC |
10384 | case OA_BASEOP: |
10385 | if (aop) { | |
10386 | #ifdef PERL_MAD | |
10387 | if (!PL_madskills || seenarg) | |
10388 | #endif | |
ce16c625 | 10389 | (void)too_many_arguments_pv(aop, GvNAME(namegv), 0); |
4aaa4757 FC |
10390 | op_free(aop); |
10391 | } | |
98be9964 FC |
10392 | return opnum == OP_RUNCV |
10393 | ? newPVOP(OP_RUNCV,0,NULL) | |
10394 | : newOP(opnum,0); | |
4aaa4757 FC |
10395 | default: |
10396 | return convert(opnum,0,aop); | |
10397 | } | |
10398 | } | |
10399 | assert(0); | |
10400 | return entersubop; | |
10401 | } | |
10402 | ||
d9088386 Z |
10403 | /* |
10404 | =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p | |
10405 | ||
10406 | Retrieves the function that will be used to fix up a call to I<cv>. | |
10407 | Specifically, the function is applied to an C<entersub> op tree for a | |
10408 | subroutine call, not marked with C<&>, where the callee can be identified | |
10409 | at compile time as I<cv>. | |
10410 | ||
10411 | The C-level function pointer is returned in I<*ckfun_p>, and an SV | |
10412 | argument for it is returned in I<*ckobj_p>. The function is intended | |
10413 | to be called in this manner: | |
10414 | ||
10415 | entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p)); | |
10416 | ||
10417 | In this call, I<entersubop> is a pointer to the C<entersub> op, | |
10418 | which may be replaced by the check function, and I<namegv> is a GV | |
10419 | supplying the name that should be used by the check function to refer | |
10420 | to the callee of the C<entersub> op if it needs to emit any diagnostics. | |
10421 | It is permitted to apply the check function in non-standard situations, | |
10422 | such as to a call to a different subroutine or to a method call. | |
340458b5 | 10423 | |
d9088386 Z |
10424 | By default, the function is |
10425 | L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>, | |
10426 | and the SV parameter is I<cv> itself. This implements standard | |
10427 | prototype processing. It can be changed, for a particular subroutine, | |
10428 | by L</cv_set_call_checker>. | |
74735042 | 10429 | |
d9088386 Z |
10430 | =cut |
10431 | */ | |
10432 | ||
10433 | void | |
10434 | Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p) | |
10435 | { | |
10436 | MAGIC *callmg; | |
10437 | PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER; | |
10438 | callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL; | |
10439 | if (callmg) { | |
10440 | *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr); | |
10441 | *ckobj_p = callmg->mg_obj; | |
10442 | } else { | |
10443 | *ckfun_p = Perl_ck_entersub_args_proto_or_list; | |
10444 | *ckobj_p = (SV*)cv; | |
10445 | } | |
10446 | } | |
10447 | ||
10448 | /* | |
10449 | =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj | |
10450 | ||
10451 | Sets the function that will be used to fix up a call to I<cv>. | |
10452 | Specifically, the function is applied to an C<entersub> op tree for a | |
10453 | subroutine call, not marked with C<&>, where the callee can be identified | |
10454 | at compile time as I<cv>. | |
10455 | ||
10456 | The C-level function pointer is supplied in I<ckfun>, and an SV argument | |
10457 | for it is supplied in I<ckobj>. The function is intended to be called | |
10458 | in this manner: | |
10459 | ||
10460 | entersubop = ckfun(aTHX_ entersubop, namegv, ckobj); | |
10461 | ||
10462 | In this call, I<entersubop> is a pointer to the C<entersub> op, | |
10463 | which may be replaced by the check function, and I<namegv> is a GV | |
10464 | supplying the name that should be used by the check function to refer | |
10465 | to the callee of the C<entersub> op if it needs to emit any diagnostics. | |
10466 | It is permitted to apply the check function in non-standard situations, | |
10467 | such as to a call to a different subroutine or to a method call. | |
10468 | ||
10469 | The current setting for a particular CV can be retrieved by | |
10470 | L</cv_get_call_checker>. | |
10471 | ||
10472 | =cut | |
10473 | */ | |
10474 | ||
10475 | void | |
10476 | Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj) | |
10477 | { | |
10478 | PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER; | |
10479 | if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) { | |
10480 | if (SvMAGICAL((SV*)cv)) | |
10481 | mg_free_type((SV*)cv, PERL_MAGIC_checkcall); | |
10482 | } else { | |
10483 | MAGIC *callmg; | |
10484 | sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0); | |
10485 | callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall); | |
10486 | if (callmg->mg_flags & MGf_REFCOUNTED) { | |
10487 | SvREFCNT_dec(callmg->mg_obj); | |
10488 | callmg->mg_flags &= ~MGf_REFCOUNTED; | |
10489 | } | |
10490 | callmg->mg_ptr = FPTR2DPTR(char *, ckfun); | |
10491 | callmg->mg_obj = ckobj; | |
10492 | if (ckobj != (SV*)cv) { | |
10493 | SvREFCNT_inc_simple_void_NN(ckobj); | |
10494 | callmg->mg_flags |= MGf_REFCOUNTED; | |
74735042 | 10495 | } |
09fb282d | 10496 | callmg->mg_flags |= MGf_COPY; |
340458b5 | 10497 | } |
d9088386 Z |
10498 | } |
10499 | ||
10500 | OP * | |
10501 | Perl_ck_subr(pTHX_ OP *o) | |
10502 | { | |
10503 | OP *aop, *cvop; | |
10504 | CV *cv; | |
10505 | GV *namegv; | |
10506 | ||
10507 | PERL_ARGS_ASSERT_CK_SUBR; | |
10508 | ||
10509 | aop = cUNOPx(o)->op_first; | |
10510 | if (!aop->op_sibling) | |
10511 | aop = cUNOPx(aop)->op_first; | |
10512 | aop = aop->op_sibling; | |
10513 | for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ; | |
10514 | cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY); | |
10515 | namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL; | |
10516 | ||
767eda44 | 10517 | o->op_private &= ~1; |
d9088386 Z |
10518 | o->op_private |= OPpENTERSUB_HASTARG; |
10519 | o->op_private |= (PL_hints & HINT_STRICT_REFS); | |
10520 | if (PERLDB_SUB && PL_curstash != PL_debstash) | |
10521 | o->op_private |= OPpENTERSUB_DB; | |
10522 | if (cvop->op_type == OP_RV2CV) { | |
10523 | o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER); | |
10524 | op_null(cvop); | |
10525 | } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) { | |
10526 | if (aop->op_type == OP_CONST) | |
10527 | aop->op_private &= ~OPpCONST_STRICT; | |
10528 | else if (aop->op_type == OP_LIST) { | |
10529 | OP * const sib = ((UNOP*)aop)->op_first->op_sibling; | |
10530 | if (sib && sib->op_type == OP_CONST) | |
10531 | sib->op_private &= ~OPpCONST_STRICT; | |
10532 | } | |
10533 | } | |
10534 | ||
10535 | if (!cv) { | |
10536 | return ck_entersub_args_list(o); | |
10537 | } else { | |
10538 | Perl_call_checker ckfun; | |
10539 | SV *ckobj; | |
10540 | cv_get_call_checker(cv, &ckfun, &ckobj); | |
279d09bf FC |
10541 | if (!namegv) { /* expletive! */ |
10542 | /* XXX The call checker API is public. And it guarantees that | |
10543 | a GV will be provided with the right name. So we have | |
10544 | to create a GV. But it is still not correct, as its | |
10545 | stringification will include the package. What we | |
10546 | really need is a new call checker API that accepts a | |
10547 | GV or string (or GV or CV). */ | |
10548 | HEK * const hek = CvNAME_HEK(cv); | |
3a74e0e2 FC |
10549 | /* After a syntax error in a lexical sub, the cv that |
10550 | rv2cv_op_cv returns may be a nameless stub. */ | |
10551 | if (!hek) return ck_entersub_args_list(o);; | |
279d09bf FC |
10552 | namegv = (GV *)sv_newmortal(); |
10553 | gv_init_pvn(namegv, PL_curstash, HEK_KEY(hek), HEK_LEN(hek), | |
10554 | SVf_UTF8 * !!HEK_UTF8(hek)); | |
10555 | } | |
d9088386 Z |
10556 | return ckfun(aTHX_ o, namegv, ckobj); |
10557 | } | |
79072805 LW |
10558 | } |
10559 | ||
10560 | OP * | |
cea2e8a9 | 10561 | Perl_ck_svconst(pTHX_ OP *o) |
8990e307 | 10562 | { |
7918f24d | 10563 | PERL_ARGS_ASSERT_CK_SVCONST; |
96a5add6 | 10564 | PERL_UNUSED_CONTEXT; |
19130678 | 10565 | SvREADONLY_on(cSVOPo->op_sv); |
11343788 | 10566 | return o; |
8990e307 LW |
10567 | } |
10568 | ||
10569 | OP * | |
cea2e8a9 | 10570 | Perl_ck_trunc(pTHX_ OP *o) |
79072805 | 10571 | { |
7918f24d NC |
10572 | PERL_ARGS_ASSERT_CK_TRUNC; |
10573 | ||
11343788 MB |
10574 | if (o->op_flags & OPf_KIDS) { |
10575 | SVOP *kid = (SVOP*)cUNOPo->op_first; | |
79072805 | 10576 | |
a0d0e21e LW |
10577 | if (kid->op_type == OP_NULL) |
10578 | kid = (SVOP*)kid->op_sibling; | |
bb53490d | 10579 | if (kid && kid->op_type == OP_CONST && |
3513c740 NT |
10580 | (kid->op_private & OPpCONST_BARE) && |
10581 | !kid->op_folded) | |
bb53490d | 10582 | { |
11343788 | 10583 | o->op_flags |= OPf_SPECIAL; |
bb53490d GS |
10584 | kid->op_private &= ~OPpCONST_STRICT; |
10585 | } | |
79072805 | 10586 | } |
11343788 | 10587 | return ck_fun(o); |
79072805 LW |
10588 | } |
10589 | ||
35fba0d9 RG |
10590 | OP * |
10591 | Perl_ck_substr(pTHX_ OP *o) | |
10592 | { | |
7918f24d NC |
10593 | PERL_ARGS_ASSERT_CK_SUBSTR; |
10594 | ||
35fba0d9 | 10595 | o = ck_fun(o); |
1d866c12 | 10596 | if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) { |
35fba0d9 RG |
10597 | OP *kid = cLISTOPo->op_first; |
10598 | ||
10599 | if (kid->op_type == OP_NULL) | |
10600 | kid = kid->op_sibling; | |
10601 | if (kid) | |
10602 | kid->op_flags |= OPf_MOD; | |
10603 | ||
10604 | } | |
10605 | return o; | |
10606 | } | |
10607 | ||
878d132a | 10608 | OP * |
8dc99089 FC |
10609 | Perl_ck_tell(pTHX_ OP *o) |
10610 | { | |
8dc99089 FC |
10611 | PERL_ARGS_ASSERT_CK_TELL; |
10612 | o = ck_fun(o); | |
e9d7a483 FC |
10613 | if (o->op_flags & OPf_KIDS) { |
10614 | OP *kid = cLISTOPo->op_first; | |
423e8af5 | 10615 | if (kid->op_type == OP_NULL && kid->op_sibling) kid = kid->op_sibling; |
e9d7a483 FC |
10616 | if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE; |
10617 | } | |
8dc99089 FC |
10618 | return o; |
10619 | } | |
10620 | ||
10621 | OP * | |
cba5a3b0 DG |
10622 | Perl_ck_each(pTHX_ OP *o) |
10623 | { | |
10624 | dVAR; | |
10625 | OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL; | |
10626 | const unsigned orig_type = o->op_type; | |
10627 | const unsigned array_type = orig_type == OP_EACH ? OP_AEACH | |
10628 | : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES; | |
10629 | const unsigned ref_type = orig_type == OP_EACH ? OP_REACH | |
10630 | : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES; | |
10631 | ||
10632 | PERL_ARGS_ASSERT_CK_EACH; | |
10633 | ||
10634 | if (kid) { | |
10635 | switch (kid->op_type) { | |
10636 | case OP_PADHV: | |
10637 | case OP_RV2HV: | |
10638 | break; | |
10639 | case OP_PADAV: | |
10640 | case OP_RV2AV: | |
10641 | CHANGE_TYPE(o, array_type); | |
10642 | break; | |
10643 | case OP_CONST: | |
7ac5715b FC |
10644 | if (kid->op_private == OPpCONST_BARE |
10645 | || !SvROK(cSVOPx_sv(kid)) | |
10646 | || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV | |
10647 | && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV ) | |
10648 | ) | |
10649 | /* we let ck_fun handle it */ | |
cba5a3b0 DG |
10650 | break; |
10651 | default: | |
10652 | CHANGE_TYPE(o, ref_type); | |
7ac5715b | 10653 | scalar(kid); |
cba5a3b0 DG |
10654 | } |
10655 | } | |
10656 | /* if treating as a reference, defer additional checks to runtime */ | |
10657 | return o->op_type == ref_type ? o : ck_fun(o); | |
10658 | } | |
10659 | ||
e508c8a4 MH |
10660 | OP * |
10661 | Perl_ck_length(pTHX_ OP *o) | |
10662 | { | |
10663 | PERL_ARGS_ASSERT_CK_LENGTH; | |
10664 | ||
10665 | o = ck_fun(o); | |
10666 | ||
10667 | if (ckWARN(WARN_SYNTAX)) { | |
10668 | const OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL; | |
10669 | ||
10670 | if (kid) { | |
579333ee FC |
10671 | SV *name = NULL; |
10672 | const bool hash = kid->op_type == OP_PADHV | |
10673 | || kid->op_type == OP_RV2HV; | |
e508c8a4 MH |
10674 | switch (kid->op_type) { |
10675 | case OP_PADHV: | |
e508c8a4 | 10676 | case OP_PADAV: |
579333ee | 10677 | name = varname( |
c6fb3f6e FC |
10678 | (GV *)PL_compcv, hash ? '%' : '@', kid->op_targ, |
10679 | NULL, 0, 1 | |
579333ee FC |
10680 | ); |
10681 | break; | |
10682 | case OP_RV2HV: | |
e508c8a4 | 10683 | case OP_RV2AV: |
579333ee FC |
10684 | if (cUNOPx(kid)->op_first->op_type != OP_GV) break; |
10685 | { | |
10686 | GV *gv = cGVOPx_gv(cUNOPx(kid)->op_first); | |
10687 | if (!gv) break; | |
10688 | name = varname(gv, hash?'%':'@', 0, NULL, 0, 1); | |
10689 | } | |
e508c8a4 | 10690 | break; |
e508c8a4 | 10691 | default: |
579333ee | 10692 | return o; |
e508c8a4 | 10693 | } |
579333ee FC |
10694 | if (name) |
10695 | Perl_warner(aTHX_ packWARN(WARN_SYNTAX), | |
10696 | "length() used on %"SVf" (did you mean \"scalar(%s%"SVf | |
10697 | ")\"?)", | |
10698 | name, hash ? "keys " : "", name | |
10699 | ); | |
10700 | else if (hash) | |
25e26107 | 10701 | /* diag_listed_as: length() used on %s (did you mean "scalar(%s)"?) */ |
579333ee FC |
10702 | Perl_warner(aTHX_ packWARN(WARN_SYNTAX), |
10703 | "length() used on %%hash (did you mean \"scalar(keys %%hash)\"?)"); | |
10704 | else | |
25e26107 | 10705 | /* diag_listed_as: length() used on %s (did you mean "scalar(%s)"?) */ |
579333ee FC |
10706 | Perl_warner(aTHX_ packWARN(WARN_SYNTAX), |
10707 | "length() used on @array (did you mean \"scalar(@array)\"?)"); | |
e508c8a4 MH |
10708 | } |
10709 | } | |
10710 | ||
10711 | return o; | |
10712 | } | |
10713 | ||
540dd770 GG |
10714 | /* Check for in place reverse and sort assignments like "@a = reverse @a" |
10715 | and modify the optree to make them work inplace */ | |
e52d58aa | 10716 | |
540dd770 GG |
10717 | STATIC void |
10718 | S_inplace_aassign(pTHX_ OP *o) { | |
e52d58aa | 10719 | |
540dd770 GG |
10720 | OP *modop, *modop_pushmark; |
10721 | OP *oright; | |
10722 | OP *oleft, *oleft_pushmark; | |
e52d58aa | 10723 | |
540dd770 | 10724 | PERL_ARGS_ASSERT_INPLACE_AASSIGN; |
e52d58aa | 10725 | |
540dd770 | 10726 | assert((o->op_flags & OPf_WANT) == OPf_WANT_VOID); |
e52d58aa | 10727 | |
540dd770 GG |
10728 | assert(cUNOPo->op_first->op_type == OP_NULL); |
10729 | modop_pushmark = cUNOPx(cUNOPo->op_first)->op_first; | |
10730 | assert(modop_pushmark->op_type == OP_PUSHMARK); | |
10731 | modop = modop_pushmark->op_sibling; | |
e92f843d | 10732 | |
540dd770 GG |
10733 | if (modop->op_type != OP_SORT && modop->op_type != OP_REVERSE) |
10734 | return; | |
10735 | ||
10736 | /* no other operation except sort/reverse */ | |
10737 | if (modop->op_sibling) | |
10738 | return; | |
10739 | ||
10740 | assert(cUNOPx(modop)->op_first->op_type == OP_PUSHMARK); | |
a46b39a8 | 10741 | if (!(oright = cUNOPx(modop)->op_first->op_sibling)) return; |
540dd770 GG |
10742 | |
10743 | if (modop->op_flags & OPf_STACKED) { | |
10744 | /* skip sort subroutine/block */ | |
10745 | assert(oright->op_type == OP_NULL); | |
10746 | oright = oright->op_sibling; | |
10747 | } | |
10748 | ||
10749 | assert(cUNOPo->op_first->op_sibling->op_type == OP_NULL); | |
10750 | oleft_pushmark = cUNOPx(cUNOPo->op_first->op_sibling)->op_first; | |
10751 | assert(oleft_pushmark->op_type == OP_PUSHMARK); | |
10752 | oleft = oleft_pushmark->op_sibling; | |
10753 | ||
10754 | /* Check the lhs is an array */ | |
10755 | if (!oleft || | |
10756 | (oleft->op_type != OP_RV2AV && oleft->op_type != OP_PADAV) | |
10757 | || oleft->op_sibling | |
10758 | || (oleft->op_private & OPpLVAL_INTRO) | |
10759 | ) | |
10760 | return; | |
10761 | ||
10762 | /* Only one thing on the rhs */ | |
10763 | if (oright->op_sibling) | |
10764 | return; | |
2f9e2db0 VP |
10765 | |
10766 | /* check the array is the same on both sides */ | |
10767 | if (oleft->op_type == OP_RV2AV) { | |
10768 | if (oright->op_type != OP_RV2AV | |
10769 | || !cUNOPx(oright)->op_first | |
10770 | || cUNOPx(oright)->op_first->op_type != OP_GV | |
18e3e9ce | 10771 | || cUNOPx(oleft )->op_first->op_type != OP_GV |
2f9e2db0 VP |
10772 | || cGVOPx_gv(cUNOPx(oleft)->op_first) != |
10773 | cGVOPx_gv(cUNOPx(oright)->op_first) | |
10774 | ) | |
540dd770 | 10775 | return; |
2f9e2db0 VP |
10776 | } |
10777 | else if (oright->op_type != OP_PADAV | |
10778 | || oright->op_targ != oleft->op_targ | |
10779 | ) | |
540dd770 GG |
10780 | return; |
10781 | ||
10782 | /* This actually is an inplace assignment */ | |
e52d58aa | 10783 | |
540dd770 GG |
10784 | modop->op_private |= OPpSORT_INPLACE; |
10785 | ||
10786 | /* transfer MODishness etc from LHS arg to RHS arg */ | |
10787 | oright->op_flags = oleft->op_flags; | |
10788 | ||
10789 | /* remove the aassign op and the lhs */ | |
10790 | op_null(o); | |
10791 | op_null(oleft_pushmark); | |
10792 | if (oleft->op_type == OP_RV2AV && cUNOPx(oleft)->op_first) | |
10793 | op_null(cUNOPx(oleft)->op_first); | |
10794 | op_null(oleft); | |
2f9e2db0 VP |
10795 | } |
10796 | ||
3c78429c DM |
10797 | #define MAX_DEFERRED 4 |
10798 | ||
10799 | #define DEFER(o) \ | |
d7ab38e8 | 10800 | STMT_START { \ |
3c78429c DM |
10801 | if (defer_ix == (MAX_DEFERRED-1)) { \ |
10802 | CALL_RPEEP(defer_queue[defer_base]); \ | |
10803 | defer_base = (defer_base + 1) % MAX_DEFERRED; \ | |
10804 | defer_ix--; \ | |
10805 | } \ | |
d7ab38e8 FC |
10806 | defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o; \ |
10807 | } STMT_END | |
3c78429c | 10808 | |
61b743bb DM |
10809 | /* A peephole optimizer. We visit the ops in the order they're to execute. |
10810 | * See the comments at the top of this file for more details about when | |
10811 | * peep() is called */ | |
463ee0b2 | 10812 | |
79072805 | 10813 | void |
5aaab254 | 10814 | Perl_rpeep(pTHX_ OP *o) |
79072805 | 10815 | { |
27da23d5 | 10816 | dVAR; |
eb578fdb | 10817 | OP* oldop = NULL; |
4774ee0a | 10818 | OP* oldoldop = NULL; |
3c78429c DM |
10819 | OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */ |
10820 | int defer_base = 0; | |
10821 | int defer_ix = -1; | |
2d8e6c8d | 10822 | |
2814eb74 | 10823 | if (!o || o->op_opt) |
79072805 | 10824 | return; |
a0d0e21e | 10825 | ENTER; |
462e5cf6 | 10826 | SAVEOP(); |
7766f137 | 10827 | SAVEVPTR(PL_curcop); |
3c78429c DM |
10828 | for (;; o = o->op_next) { |
10829 | if (o && o->op_opt) | |
10830 | o = NULL; | |
cd197e1e VP |
10831 | if (!o) { |
10832 | while (defer_ix >= 0) | |
10833 | CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]); | |
3c78429c | 10834 | break; |
cd197e1e | 10835 | } |
3c78429c | 10836 | |
6d7dd4a5 NC |
10837 | /* By default, this op has now been optimised. A couple of cases below |
10838 | clear this again. */ | |
10839 | o->op_opt = 1; | |
533c011a | 10840 | PL_op = o; |
a0d0e21e | 10841 | switch (o->op_type) { |
a0d0e21e | 10842 | case OP_DBSTATE: |
3280af22 | 10843 | PL_curcop = ((COP*)o); /* for warnings */ |
a0d0e21e | 10844 | break; |
ac56e7de NC |
10845 | case OP_NEXTSTATE: |
10846 | PL_curcop = ((COP*)o); /* for warnings */ | |
10847 | ||
10848 | /* Two NEXTSTATEs in a row serve no purpose. Except if they happen | |
10849 | to carry two labels. For now, take the easier option, and skip | |
10850 | this optimisation if the first NEXTSTATE has a label. */ | |
bcc76ee3 | 10851 | if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) { |
ac56e7de NC |
10852 | OP *nextop = o->op_next; |
10853 | while (nextop && nextop->op_type == OP_NULL) | |
10854 | nextop = nextop->op_next; | |
10855 | ||
10856 | if (nextop && (nextop->op_type == OP_NEXTSTATE)) { | |
10857 | COP *firstcop = (COP *)o; | |
10858 | COP *secondcop = (COP *)nextop; | |
10859 | /* We want the COP pointed to by o (and anything else) to | |
10860 | become the next COP down the line. */ | |
10861 | cop_free(firstcop); | |
10862 | ||
10863 | firstcop->op_next = secondcop->op_next; | |
10864 | ||
10865 | /* Now steal all its pointers, and duplicate the other | |
10866 | data. */ | |
10867 | firstcop->cop_line = secondcop->cop_line; | |
10868 | #ifdef USE_ITHREADS | |
d4d03940 | 10869 | firstcop->cop_stashoff = secondcop->cop_stashoff; |
ac56e7de NC |
10870 | firstcop->cop_file = secondcop->cop_file; |
10871 | #else | |
10872 | firstcop->cop_stash = secondcop->cop_stash; | |
10873 | firstcop->cop_filegv = secondcop->cop_filegv; | |
10874 | #endif | |
10875 | firstcop->cop_hints = secondcop->cop_hints; | |
10876 | firstcop->cop_seq = secondcop->cop_seq; | |
10877 | firstcop->cop_warnings = secondcop->cop_warnings; | |
10878 | firstcop->cop_hints_hash = secondcop->cop_hints_hash; | |
10879 | ||
10880 | #ifdef USE_ITHREADS | |
647688d8 | 10881 | secondcop->cop_stashoff = 0; |
ac56e7de NC |
10882 | secondcop->cop_file = NULL; |
10883 | #else | |
10884 | secondcop->cop_stash = NULL; | |
10885 | secondcop->cop_filegv = NULL; | |
10886 | #endif | |
10887 | secondcop->cop_warnings = NULL; | |
10888 | secondcop->cop_hints_hash = NULL; | |
10889 | ||
10890 | /* If we use op_null(), and hence leave an ex-COP, some | |
10891 | warnings are misreported. For example, the compile-time | |
10892 | error in 'use strict; no strict refs;' */ | |
10893 | secondcop->op_type = OP_NULL; | |
10894 | secondcop->op_ppaddr = PL_ppaddr[OP_NULL]; | |
10895 | } | |
10896 | } | |
10897 | break; | |
a0d0e21e | 10898 | |
df91b2c5 AE |
10899 | case OP_CONCAT: |
10900 | if (o->op_next && o->op_next->op_type == OP_STRINGIFY) { | |
10901 | if (o->op_next->op_private & OPpTARGET_MY) { | |
10902 | if (o->op_flags & OPf_STACKED) /* chained concats */ | |
a6aa0b75 | 10903 | break; /* ignore_optimization */ |
df91b2c5 AE |
10904 | else { |
10905 | /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */ | |
10906 | o->op_targ = o->op_next->op_targ; | |
10907 | o->op_next->op_targ = 0; | |
10908 | o->op_private |= OPpTARGET_MY; | |
10909 | } | |
10910 | } | |
10911 | op_null(o->op_next); | |
10912 | } | |
df91b2c5 | 10913 | break; |
6d7dd4a5 NC |
10914 | case OP_STUB: |
10915 | if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) { | |
10916 | break; /* Scalar stub must produce undef. List stub is noop */ | |
10917 | } | |
10918 | goto nothin; | |
79072805 | 10919 | case OP_NULL: |
acb36ea4 | 10920 | if (o->op_targ == OP_NEXTSTATE |
5edb5b2a | 10921 | || o->op_targ == OP_DBSTATE) |
acb36ea4 | 10922 | { |
3280af22 | 10923 | PL_curcop = ((COP*)o); |
acb36ea4 | 10924 | } |
dad75012 | 10925 | /* XXX: We avoid setting op_seq here to prevent later calls |
1a0a2ba9 | 10926 | to rpeep() from mistakenly concluding that optimisation |
dad75012 AMS |
10927 | has already occurred. This doesn't fix the real problem, |
10928 | though (See 20010220.007). AMS 20010719 */ | |
2814eb74 | 10929 | /* op_seq functionality is now replaced by op_opt */ |
6d7dd4a5 | 10930 | o->op_opt = 0; |
f46f2f82 | 10931 | /* FALL THROUGH */ |
79072805 | 10932 | case OP_SCALAR: |
93a17b20 | 10933 | case OP_LINESEQ: |
463ee0b2 | 10934 | case OP_SCOPE: |
6d7dd4a5 | 10935 | nothin: |
a0d0e21e LW |
10936 | if (oldop && o->op_next) { |
10937 | oldop->op_next = o->op_next; | |
6d7dd4a5 | 10938 | o->op_opt = 0; |
79072805 LW |
10939 | continue; |
10940 | } | |
79072805 LW |
10941 | break; |
10942 | ||
a7fd8ef6 DM |
10943 | case OP_PUSHMARK: |
10944 | ||
10945 | /* Convert a series of PAD ops for my vars plus support into a | |
10946 | * single padrange op. Basically | |
10947 | * | |
10948 | * pushmark -> pad[ahs]v -> pad[ahs]?v -> ... -> (list) -> rest | |
10949 | * | |
10950 | * becomes, depending on circumstances, one of | |
10951 | * | |
10952 | * padrange ----------------------------------> (list) -> rest | |
10953 | * padrange --------------------------------------------> rest | |
10954 | * | |
10955 | * where all the pad indexes are sequential and of the same type | |
10956 | * (INTRO or not). | |
10957 | * We convert the pushmark into a padrange op, then skip | |
10958 | * any other pad ops, and possibly some trailing ops. | |
10959 | * Note that we don't null() the skipped ops, to make it | |
10960 | * easier for Deparse to undo this optimisation (and none of | |
10961 | * the skipped ops are holding any resourses). It also makes | |
10962 | * it easier for find_uninit_var(), as it can just ignore | |
10963 | * padrange, and examine the original pad ops. | |
10964 | */ | |
10965 | { | |
10966 | OP *p; | |
10967 | OP *followop = NULL; /* the op that will follow the padrange op */ | |
10968 | U8 count = 0; | |
10969 | U8 intro = 0; | |
10970 | PADOFFSET base = 0; /* init only to stop compiler whining */ | |
10971 | U8 gimme = 0; /* init only to stop compiler whining */ | |
d5524600 | 10972 | bool defav = 0; /* seen (...) = @_ */ |
fd3cc9e5 | 10973 | bool reuse = 0; /* reuse an existing padrange op */ |
d5524600 DM |
10974 | |
10975 | /* look for a pushmark -> gv[_] -> rv2av */ | |
10976 | ||
10977 | { | |
10978 | GV *gv; | |
10979 | OP *rv2av, *q; | |
10980 | p = o->op_next; | |
10981 | if ( p->op_type == OP_GV | |
10982 | && (gv = cGVOPx_gv(p)) | |
10983 | && GvNAMELEN_get(gv) == 1 | |
10984 | && *GvNAME_get(gv) == '_' | |
10985 | && GvSTASH(gv) == PL_defstash | |
10986 | && (rv2av = p->op_next) | |
10987 | && rv2av->op_type == OP_RV2AV | |
10988 | && !(rv2av->op_flags & OPf_REF) | |
10989 | && !(rv2av->op_private & (OPpLVAL_INTRO|OPpMAYBE_LVSUB)) | |
10990 | && ((rv2av->op_flags & OPf_WANT) == OPf_WANT_LIST) | |
10991 | && o->op_sibling == rv2av /* these two for Deparse */ | |
10992 | && cUNOPx(rv2av)->op_first == p | |
10993 | ) { | |
10994 | q = rv2av->op_next; | |
10995 | if (q->op_type == OP_NULL) | |
10996 | q = q->op_next; | |
10997 | if (q->op_type == OP_PUSHMARK) { | |
10998 | defav = 1; | |
10999 | p = q; | |
11000 | } | |
11001 | } | |
11002 | } | |
11003 | if (!defav) { | |
11004 | /* To allow Deparse to pessimise this, it needs to be able | |
11005 | * to restore the pushmark's original op_next, which it | |
11006 | * will assume to be the same as op_sibling. */ | |
11007 | if (o->op_next != o->op_sibling) | |
11008 | break; | |
11009 | p = o; | |
11010 | } | |
a7fd8ef6 DM |
11011 | |
11012 | /* scan for PAD ops */ | |
11013 | ||
d5524600 | 11014 | for (p = p->op_next; p; p = p->op_next) { |
a7fd8ef6 DM |
11015 | if (p->op_type == OP_NULL) |
11016 | continue; | |
11017 | ||
11018 | if (( p->op_type != OP_PADSV | |
11019 | && p->op_type != OP_PADAV | |
11020 | && p->op_type != OP_PADHV | |
11021 | ) | |
11022 | /* any private flag other than INTRO? e.g. STATE */ | |
11023 | || (p->op_private & ~OPpLVAL_INTRO) | |
11024 | ) | |
11025 | break; | |
11026 | ||
11027 | /* let $a[N] potentially be optimised into ALEMFAST_LEX | |
11028 | * instead */ | |
11029 | if ( p->op_type == OP_PADAV | |
11030 | && p->op_next | |
11031 | && p->op_next->op_type == OP_CONST | |
11032 | && p->op_next->op_next | |
11033 | && p->op_next->op_next->op_type == OP_AELEM | |
11034 | ) | |
11035 | break; | |
11036 | ||
11037 | /* for 1st padop, note what type it is and the range | |
11038 | * start; for the others, check that it's the same type | |
11039 | * and that the targs are contiguous */ | |
11040 | if (count == 0) { | |
11041 | intro = (p->op_private & OPpLVAL_INTRO); | |
11042 | base = p->op_targ; | |
11043 | gimme = (p->op_flags & OPf_WANT); | |
11044 | } | |
11045 | else { | |
11046 | if ((p->op_private & OPpLVAL_INTRO) != intro) | |
11047 | break; | |
18c931a3 DM |
11048 | /* Note that you'd normally expect targs to be |
11049 | * contiguous in my($a,$b,$c), but that's not the case | |
11050 | * when external modules start doing things, e.g. | |
11051 | i* Function::Parameters */ | |
11052 | if (p->op_targ != base + count) | |
a7fd8ef6 DM |
11053 | break; |
11054 | assert(p->op_targ == base + count); | |
11055 | /* all the padops should be in the same context */ | |
11056 | if (gimme != (p->op_flags & OPf_WANT)) | |
11057 | break; | |
11058 | } | |
11059 | ||
11060 | /* for AV, HV, only when we're not flattening */ | |
11061 | if ( p->op_type != OP_PADSV | |
11062 | && gimme != OPf_WANT_VOID | |
11063 | && !(p->op_flags & OPf_REF) | |
11064 | ) | |
11065 | break; | |
11066 | ||
11067 | if (count >= OPpPADRANGE_COUNTMASK) | |
11068 | break; | |
11069 | ||
4e09461c DM |
11070 | /* there's a biggest base we can fit into a |
11071 | * SAVEt_CLEARPADRANGE in pp_padrange */ | |
11072 | if (intro && base > | |
11073 | (UV_MAX >> (OPpPADRANGE_COUNTSHIFT+SAVE_TIGHT_SHIFT))) | |
11074 | break; | |
11075 | ||
a7fd8ef6 DM |
11076 | /* Success! We've got another valid pad op to optimise away */ |
11077 | count++; | |
11078 | followop = p->op_next; | |
11079 | } | |
11080 | ||
11081 | if (count < 1) | |
11082 | break; | |
11083 | ||
4774ee0a | 11084 | /* pp_padrange in specifically compile-time void context |
a7fd8ef6 DM |
11085 | * skips pushing a mark and lexicals; in all other contexts |
11086 | * (including unknown till runtime) it pushes a mark and the | |
11087 | * lexicals. We must be very careful then, that the ops we | |
11088 | * optimise away would have exactly the same effect as the | |
11089 | * padrange. | |
11090 | * In particular in void context, we can only optimise to | |
11091 | * a padrange if see see the complete sequence | |
11092 | * pushmark, pad*v, ...., list, nextstate | |
11093 | * which has the net effect of of leaving the stack empty | |
11094 | * (for now we leave the nextstate in the execution chain, for | |
11095 | * its other side-effects). | |
11096 | */ | |
11097 | assert(followop); | |
11098 | if (gimme == OPf_WANT_VOID) { | |
11099 | if (followop->op_type == OP_LIST | |
11100 | && gimme == (followop->op_flags & OPf_WANT) | |
11101 | && ( followop->op_next->op_type == OP_NEXTSTATE | |
11102 | || followop->op_next->op_type == OP_DBSTATE)) | |
4774ee0a | 11103 | { |
a7fd8ef6 | 11104 | followop = followop->op_next; /* skip OP_LIST */ |
4774ee0a DM |
11105 | |
11106 | /* consolidate two successive my(...);'s */ | |
fd3cc9e5 | 11107 | |
4774ee0a DM |
11108 | if ( oldoldop |
11109 | && oldoldop->op_type == OP_PADRANGE | |
11110 | && (oldoldop->op_flags & OPf_WANT) == OPf_WANT_VOID | |
11111 | && (oldoldop->op_private & OPpLVAL_INTRO) == intro | |
fd3cc9e5 | 11112 | && !(oldoldop->op_flags & OPf_SPECIAL) |
4774ee0a DM |
11113 | ) { |
11114 | U8 old_count; | |
11115 | assert(oldoldop->op_next == oldop); | |
11116 | assert( oldop->op_type == OP_NEXTSTATE | |
11117 | || oldop->op_type == OP_DBSTATE); | |
11118 | assert(oldop->op_next == o); | |
11119 | ||
11120 | old_count | |
11121 | = (oldoldop->op_private & OPpPADRANGE_COUNTMASK); | |
11122 | assert(oldoldop->op_targ + old_count == base); | |
11123 | ||
11124 | if (old_count < OPpPADRANGE_COUNTMASK - count) { | |
fd3cc9e5 DM |
11125 | base = oldoldop->op_targ; |
11126 | count += old_count; | |
11127 | reuse = 1; | |
4774ee0a DM |
11128 | } |
11129 | } | |
fd3cc9e5 DM |
11130 | |
11131 | /* if there's any immediately following singleton | |
11132 | * my var's; then swallow them and the associated | |
11133 | * nextstates; i.e. | |
11134 | * my ($a,$b); my $c; my $d; | |
11135 | * is treated as | |
11136 | * my ($a,$b,$c,$d); | |
11137 | */ | |
11138 | ||
11139 | while ( ((p = followop->op_next)) | |
11140 | && ( p->op_type == OP_PADSV | |
11141 | || p->op_type == OP_PADAV | |
11142 | || p->op_type == OP_PADHV) | |
11143 | && (p->op_flags & OPf_WANT) == OPf_WANT_VOID | |
11144 | && (p->op_private & OPpLVAL_INTRO) == intro | |
11145 | && p->op_next | |
11146 | && ( p->op_next->op_type == OP_NEXTSTATE | |
11147 | || p->op_next->op_type == OP_DBSTATE) | |
11148 | && count < OPpPADRANGE_COUNTMASK | |
11149 | ) { | |
11150 | assert(base + count == p->op_targ); | |
11151 | count++; | |
11152 | followop = p->op_next; | |
11153 | } | |
4774ee0a | 11154 | } |
a7fd8ef6 DM |
11155 | else |
11156 | break; | |
11157 | } | |
11158 | ||
fd3cc9e5 DM |
11159 | if (reuse) { |
11160 | assert(oldoldop->op_type == OP_PADRANGE); | |
11161 | oldoldop->op_next = followop; | |
11162 | oldoldop->op_private = (intro | count); | |
11163 | o = oldoldop; | |
11164 | oldop = NULL; | |
11165 | oldoldop = NULL; | |
11166 | } | |
11167 | else { | |
11168 | /* Convert the pushmark into a padrange. | |
11169 | * To make Deparse easier, we guarantee that a padrange was | |
11170 | * *always* formerly a pushmark */ | |
11171 | assert(o->op_type == OP_PUSHMARK); | |
11172 | o->op_next = followop; | |
11173 | o->op_type = OP_PADRANGE; | |
11174 | o->op_ppaddr = PL_ppaddr[OP_PADRANGE]; | |
11175 | o->op_targ = base; | |
11176 | /* bit 7: INTRO; bit 6..0: count */ | |
11177 | o->op_private = (intro | count); | |
11178 | o->op_flags = ((o->op_flags & ~(OPf_WANT|OPf_SPECIAL)) | |
11179 | | gimme | (defav ? OPf_SPECIAL : 0)); | |
11180 | } | |
a7fd8ef6 DM |
11181 | break; |
11182 | } | |
11183 | ||
6a077020 | 11184 | case OP_PADAV: |
79072805 | 11185 | case OP_GV: |
6a077020 | 11186 | if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) { |
0bd48802 | 11187 | OP* const pop = (o->op_type == OP_PADAV) ? |
6a077020 | 11188 | o->op_next : o->op_next->op_next; |
a0d0e21e | 11189 | IV i; |
f9dc862f | 11190 | if (pop && pop->op_type == OP_CONST && |
af5acbb4 | 11191 | ((PL_op = pop->op_next)) && |
8990e307 | 11192 | pop->op_next->op_type == OP_AELEM && |
a0d0e21e | 11193 | !(pop->op_next->op_private & |
78f9721b | 11194 | (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) && |
e1dccc0d | 11195 | (i = SvIV(((SVOP*)pop)->op_sv)) <= 255 && i >= 0) |
8990e307 | 11196 | { |
350de78d | 11197 | GV *gv; |
af5acbb4 DM |
11198 | if (cSVOPx(pop)->op_private & OPpCONST_STRICT) |
11199 | no_bareword_allowed(pop); | |
6a077020 DM |
11200 | if (o->op_type == OP_GV) |
11201 | op_null(o->op_next); | |
93c66552 DM |
11202 | op_null(pop->op_next); |
11203 | op_null(pop); | |
a0d0e21e LW |
11204 | o->op_flags |= pop->op_next->op_flags & OPf_MOD; |
11205 | o->op_next = pop->op_next->op_next; | |
22c35a8c | 11206 | o->op_ppaddr = PL_ppaddr[OP_AELEMFAST]; |
a0d0e21e | 11207 | o->op_private = (U8)i; |
6a077020 DM |
11208 | if (o->op_type == OP_GV) { |
11209 | gv = cGVOPo_gv; | |
11210 | GvAVn(gv); | |
93bad3fd | 11211 | o->op_type = OP_AELEMFAST; |
6a077020 DM |
11212 | } |
11213 | else | |
93bad3fd | 11214 | o->op_type = OP_AELEMFAST_LEX; |
6a077020 | 11215 | } |
6a077020 DM |
11216 | break; |
11217 | } | |
11218 | ||
11219 | if (o->op_next->op_type == OP_RV2SV) { | |
11220 | if (!(o->op_next->op_private & OPpDEREF)) { | |
11221 | op_null(o->op_next); | |
11222 | o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO | |
11223 | | OPpOUR_INTRO); | |
11224 | o->op_next = o->op_next->op_next; | |
11225 | o->op_type = OP_GVSV; | |
11226 | o->op_ppaddr = PL_ppaddr[OP_GVSV]; | |
8990e307 | 11227 | } |
79072805 | 11228 | } |
89de2904 AMS |
11229 | else if (o->op_next->op_type == OP_READLINE |
11230 | && o->op_next->op_next->op_type == OP_CONCAT | |
11231 | && (o->op_next->op_next->op_flags & OPf_STACKED)) | |
11232 | { | |
d2c45030 AMS |
11233 | /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */ |
11234 | o->op_type = OP_RCATLINE; | |
11235 | o->op_flags |= OPf_STACKED; | |
11236 | o->op_ppaddr = PL_ppaddr[OP_RCATLINE]; | |
89de2904 | 11237 | op_null(o->op_next->op_next); |
d2c45030 | 11238 | op_null(o->op_next); |
89de2904 | 11239 | } |
76cd736e | 11240 | |
79072805 | 11241 | break; |
867fa1e2 YO |
11242 | |
11243 | { | |
11244 | OP *fop; | |
11245 | OP *sop; | |
11246 | ||
9e7f031c FC |
11247 | #define HV_OR_SCALARHV(op) \ |
11248 | ( (op)->op_type == OP_PADHV || (op)->op_type == OP_RV2HV \ | |
11249 | ? (op) \ | |
11250 | : (op)->op_type == OP_SCALAR && (op)->op_flags & OPf_KIDS \ | |
11251 | && ( cUNOPx(op)->op_first->op_type == OP_PADHV \ | |
11252 | || cUNOPx(op)->op_first->op_type == OP_RV2HV) \ | |
11253 | ? cUNOPx(op)->op_first \ | |
11254 | : NULL) | |
11255 | ||
867fa1e2 | 11256 | case OP_NOT: |
9e7f031c FC |
11257 | if ((fop = HV_OR_SCALARHV(cUNOP->op_first))) |
11258 | fop->op_private |= OPpTRUEBOOL; | |
867fa1e2 YO |
11259 | break; |
11260 | ||
11261 | case OP_AND: | |
79072805 | 11262 | case OP_OR: |
c963b151 | 11263 | case OP_DOR: |
867fa1e2 YO |
11264 | fop = cLOGOP->op_first; |
11265 | sop = fop->op_sibling; | |
11266 | while (cLOGOP->op_other->op_type == OP_NULL) | |
11267 | cLOGOP->op_other = cLOGOP->op_other->op_next; | |
db4d68cf DM |
11268 | while (o->op_next && ( o->op_type == o->op_next->op_type |
11269 | || o->op_next->op_type == OP_NULL)) | |
11270 | o->op_next = o->op_next->op_next; | |
3c78429c | 11271 | DEFER(cLOGOP->op_other); |
867fa1e2 | 11272 | |
867fa1e2 | 11273 | o->op_opt = 1; |
c8fe3bdf FC |
11274 | fop = HV_OR_SCALARHV(fop); |
11275 | if (sop) sop = HV_OR_SCALARHV(sop); | |
11276 | if (fop || sop | |
867fa1e2 YO |
11277 | ){ |
11278 | OP * nop = o; | |
11279 | OP * lop = o; | |
aaf643ce | 11280 | if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) { |
867fa1e2 YO |
11281 | while (nop && nop->op_next) { |
11282 | switch (nop->op_next->op_type) { | |
11283 | case OP_NOT: | |
11284 | case OP_AND: | |
11285 | case OP_OR: | |
11286 | case OP_DOR: | |
11287 | lop = nop = nop->op_next; | |
11288 | break; | |
11289 | case OP_NULL: | |
11290 | nop = nop->op_next; | |
11291 | break; | |
11292 | default: | |
11293 | nop = NULL; | |
11294 | break; | |
11295 | } | |
11296 | } | |
11297 | } | |
c8fe3bdf FC |
11298 | if (fop) { |
11299 | if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID | |
20e53f5f | 11300 | || o->op_type == OP_AND ) |
c8fe3bdf FC |
11301 | fop->op_private |= OPpTRUEBOOL; |
11302 | else if (!(lop->op_flags & OPf_WANT)) | |
adc42c31 | 11303 | fop->op_private |= OPpMAYBE_TRUEBOOL; |
6ea72b3a | 11304 | } |
20e53f5f | 11305 | if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID |
c8fe3bdf FC |
11306 | && sop) |
11307 | sop->op_private |= OPpTRUEBOOL; | |
867fa1e2 YO |
11308 | } |
11309 | ||
11310 | ||
11311 | break; | |
867fa1e2 | 11312 | |
a8b106e9 | 11313 | case OP_COND_EXPR: |
c8fe3bdf | 11314 | if ((fop = HV_OR_SCALARHV(cLOGOP->op_first))) |
9e7f031c | 11315 | fop->op_private |= OPpTRUEBOOL; |
a8b106e9 FC |
11316 | #undef HV_OR_SCALARHV |
11317 | /* GERONIMO! */ | |
c8fe3bdf | 11318 | } |
a8b106e9 | 11319 | |
867fa1e2 YO |
11320 | case OP_MAPWHILE: |
11321 | case OP_GREPWHILE: | |
2c2d71f5 JH |
11322 | case OP_ANDASSIGN: |
11323 | case OP_ORASSIGN: | |
c963b151 | 11324 | case OP_DORASSIGN: |
1a67a97c | 11325 | case OP_RANGE: |
c5917253 | 11326 | case OP_ONCE: |
fd4d1407 IZ |
11327 | while (cLOGOP->op_other->op_type == OP_NULL) |
11328 | cLOGOP->op_other = cLOGOP->op_other->op_next; | |
3c78429c | 11329 | DEFER(cLOGOP->op_other); |
79072805 LW |
11330 | break; |
11331 | ||
79072805 | 11332 | case OP_ENTERLOOP: |
9c2ca71a | 11333 | case OP_ENTERITER: |
58cccf98 SM |
11334 | while (cLOOP->op_redoop->op_type == OP_NULL) |
11335 | cLOOP->op_redoop = cLOOP->op_redoop->op_next; | |
58cccf98 SM |
11336 | while (cLOOP->op_nextop->op_type == OP_NULL) |
11337 | cLOOP->op_nextop = cLOOP->op_nextop->op_next; | |
58cccf98 SM |
11338 | while (cLOOP->op_lastop->op_type == OP_NULL) |
11339 | cLOOP->op_lastop = cLOOP->op_lastop->op_next; | |
3c78429c DM |
11340 | /* a while(1) loop doesn't have an op_next that escapes the |
11341 | * loop, so we have to explicitly follow the op_lastop to | |
11342 | * process the rest of the code */ | |
11343 | DEFER(cLOOP->op_lastop); | |
79072805 LW |
11344 | break; |
11345 | ||
79072805 | 11346 | case OP_SUBST: |
29f2e912 NC |
11347 | assert(!(cPMOP->op_pmflags & PMf_ONCE)); |
11348 | while (cPMOP->op_pmstashstartu.op_pmreplstart && | |
11349 | cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL) | |
11350 | cPMOP->op_pmstashstartu.op_pmreplstart | |
11351 | = cPMOP->op_pmstashstartu.op_pmreplstart->op_next; | |
3c78429c | 11352 | DEFER(cPMOP->op_pmstashstartu.op_pmreplstart); |
79072805 LW |
11353 | break; |
11354 | ||
fe1bc4cf | 11355 | case OP_SORT: { |
d7ab38e8 FC |
11356 | OP *oright; |
11357 | ||
11358 | if (o->op_flags & OPf_STACKED) { | |
11359 | OP * const kid = | |
11360 | cUNOPx(cLISTOP->op_first->op_sibling)->op_first; | |
11361 | if (kid->op_type == OP_SCOPE | |
08fdcd99 FC |
11362 | || (kid->op_type == OP_NULL && kid->op_targ == OP_LEAVE)) |
11363 | DEFER(kLISTOP->op_first); | |
d7ab38e8 FC |
11364 | } |
11365 | ||
fe1bc4cf | 11366 | /* check that RHS of sort is a single plain array */ |
d7ab38e8 | 11367 | oright = cUNOPo->op_first; |
fe1bc4cf DM |
11368 | if (!oright || oright->op_type != OP_PUSHMARK) |
11369 | break; | |
471178c0 | 11370 | |
540dd770 GG |
11371 | if (o->op_private & OPpSORT_INPLACE) |
11372 | break; | |
11373 | ||
471178c0 NC |
11374 | /* reverse sort ... can be optimised. */ |
11375 | if (!cUNOPo->op_sibling) { | |
11376 | /* Nothing follows us on the list. */ | |
551405c4 | 11377 | OP * const reverse = o->op_next; |
471178c0 NC |
11378 | |
11379 | if (reverse->op_type == OP_REVERSE && | |
11380 | (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) { | |
551405c4 | 11381 | OP * const pushmark = cUNOPx(reverse)->op_first; |
471178c0 NC |
11382 | if (pushmark && (pushmark->op_type == OP_PUSHMARK) |
11383 | && (cUNOPx(pushmark)->op_sibling == o)) { | |
11384 | /* reverse -> pushmark -> sort */ | |
11385 | o->op_private |= OPpSORT_REVERSE; | |
11386 | op_null(reverse); | |
11387 | pushmark->op_next = oright->op_next; | |
11388 | op_null(oright); | |
11389 | } | |
11390 | } | |
11391 | } | |
11392 | ||
fe1bc4cf DM |
11393 | break; |
11394 | } | |
ef3e5ea9 NC |
11395 | |
11396 | case OP_REVERSE: { | |
e682d7b7 | 11397 | OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av; |
ce335f37 | 11398 | OP *gvop = NULL; |
ef3e5ea9 | 11399 | LISTOP *enter, *exlist; |
ef3e5ea9 | 11400 | |
540dd770 | 11401 | if (o->op_private & OPpSORT_INPLACE) |
484c818f | 11402 | break; |
484c818f | 11403 | |
ef3e5ea9 NC |
11404 | enter = (LISTOP *) o->op_next; |
11405 | if (!enter) | |
11406 | break; | |
11407 | if (enter->op_type == OP_NULL) { | |
11408 | enter = (LISTOP *) enter->op_next; | |
11409 | if (!enter) | |
11410 | break; | |
11411 | } | |
d46f46af NC |
11412 | /* for $a (...) will have OP_GV then OP_RV2GV here. |
11413 | for (...) just has an OP_GV. */ | |
ce335f37 NC |
11414 | if (enter->op_type == OP_GV) { |
11415 | gvop = (OP *) enter; | |
11416 | enter = (LISTOP *) enter->op_next; | |
11417 | if (!enter) | |
11418 | break; | |
d46f46af NC |
11419 | if (enter->op_type == OP_RV2GV) { |
11420 | enter = (LISTOP *) enter->op_next; | |
11421 | if (!enter) | |
ce335f37 | 11422 | break; |
d46f46af | 11423 | } |
ce335f37 NC |
11424 | } |
11425 | ||
ef3e5ea9 NC |
11426 | if (enter->op_type != OP_ENTERITER) |
11427 | break; | |
11428 | ||
11429 | iter = enter->op_next; | |
11430 | if (!iter || iter->op_type != OP_ITER) | |
11431 | break; | |
11432 | ||
ce335f37 NC |
11433 | expushmark = enter->op_first; |
11434 | if (!expushmark || expushmark->op_type != OP_NULL | |
11435 | || expushmark->op_targ != OP_PUSHMARK) | |
11436 | break; | |
11437 | ||
11438 | exlist = (LISTOP *) expushmark->op_sibling; | |
ef3e5ea9 NC |
11439 | if (!exlist || exlist->op_type != OP_NULL |
11440 | || exlist->op_targ != OP_LIST) | |
11441 | break; | |
11442 | ||
11443 | if (exlist->op_last != o) { | |
11444 | /* Mmm. Was expecting to point back to this op. */ | |
11445 | break; | |
11446 | } | |
11447 | theirmark = exlist->op_first; | |
11448 | if (!theirmark || theirmark->op_type != OP_PUSHMARK) | |
11449 | break; | |
11450 | ||
c491ecac | 11451 | if (theirmark->op_sibling != o) { |
ef3e5ea9 NC |
11452 | /* There's something between the mark and the reverse, eg |
11453 | for (1, reverse (...)) | |
11454 | so no go. */ | |
11455 | break; | |
11456 | } | |
11457 | ||
c491ecac NC |
11458 | ourmark = ((LISTOP *)o)->op_first; |
11459 | if (!ourmark || ourmark->op_type != OP_PUSHMARK) | |
11460 | break; | |
11461 | ||
ef3e5ea9 NC |
11462 | ourlast = ((LISTOP *)o)->op_last; |
11463 | if (!ourlast || ourlast->op_next != o) | |
11464 | break; | |
11465 | ||
e682d7b7 NC |
11466 | rv2av = ourmark->op_sibling; |
11467 | if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0 | |
11468 | && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS) | |
11469 | && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) { | |
11470 | /* We're just reversing a single array. */ | |
11471 | rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF; | |
11472 | enter->op_flags |= OPf_STACKED; | |
11473 | } | |
11474 | ||
ef3e5ea9 NC |
11475 | /* We don't have control over who points to theirmark, so sacrifice |
11476 | ours. */ | |
11477 | theirmark->op_next = ourmark->op_next; | |
11478 | theirmark->op_flags = ourmark->op_flags; | |
ce335f37 | 11479 | ourlast->op_next = gvop ? gvop : (OP *) enter; |
ef3e5ea9 NC |
11480 | op_null(ourmark); |
11481 | op_null(o); | |
11482 | enter->op_private |= OPpITER_REVERSED; | |
11483 | iter->op_private |= OPpITER_REVERSED; | |
11484 | ||
11485 | break; | |
11486 | } | |
e26df76a | 11487 | |
0477511c NC |
11488 | case OP_QR: |
11489 | case OP_MATCH: | |
29f2e912 NC |
11490 | if (!(cPMOP->op_pmflags & PMf_ONCE)) { |
11491 | assert (!cPMOP->op_pmstashstartu.op_pmreplstart); | |
11492 | } | |
79072805 | 11493 | break; |
1830b3d9 | 11494 | |
1a35f9ff FC |
11495 | case OP_RUNCV: |
11496 | if (!(o->op_private & OPpOFFBYONE) && !CvCLONE(PL_compcv)) { | |
11497 | SV *sv; | |
e157a82b | 11498 | if (CvEVAL(PL_compcv)) sv = &PL_sv_undef; |
1a35f9ff FC |
11499 | else { |
11500 | sv = newRV((SV *)PL_compcv); | |
11501 | sv_rvweaken(sv); | |
11502 | SvREADONLY_on(sv); | |
11503 | } | |
11504 | o->op_type = OP_CONST; | |
11505 | o->op_ppaddr = PL_ppaddr[OP_CONST]; | |
11506 | o->op_flags |= OPf_SPECIAL; | |
11507 | cSVOPo->op_sv = sv; | |
11508 | } | |
11509 | break; | |
11510 | ||
24fcb59f FC |
11511 | case OP_SASSIGN: |
11512 | if (OP_GIMME(o,0) == G_VOID) { | |
11513 | OP *right = cBINOP->op_first; | |
11514 | if (right) { | |
11515 | OP *left = right->op_sibling; | |
11516 | if (left->op_type == OP_SUBSTR | |
11517 | && (left->op_private & 7) < 4) { | |
11518 | op_null(o); | |
11519 | cBINOP->op_first = left; | |
11520 | right->op_sibling = | |
11521 | cBINOPx(left)->op_first->op_sibling; | |
11522 | cBINOPx(left)->op_first->op_sibling = right; | |
11523 | left->op_private |= OPpSUBSTR_REPL_FIRST; | |
d72a08ce FC |
11524 | left->op_flags = |
11525 | (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID; | |
24fcb59f FC |
11526 | } |
11527 | } | |
11528 | } | |
11529 | break; | |
11530 | ||
1830b3d9 BM |
11531 | case OP_CUSTOM: { |
11532 | Perl_cpeep_t cpeep = | |
11533 | XopENTRY(Perl_custom_op_xop(aTHX_ o), xop_peep); | |
11534 | if (cpeep) | |
11535 | cpeep(aTHX_ o, oldop); | |
11536 | break; | |
11537 | } | |
11538 | ||
79072805 | 11539 | } |
4774ee0a | 11540 | oldoldop = oldop; |
a0d0e21e | 11541 | oldop = o; |
79072805 | 11542 | } |
a0d0e21e | 11543 | LEAVE; |
79072805 | 11544 | } |
beab0874 | 11545 | |
1a0a2ba9 | 11546 | void |
5aaab254 | 11547 | Perl_peep(pTHX_ OP *o) |
1a0a2ba9 Z |
11548 | { |
11549 | CALL_RPEEP(o); | |
11550 | } | |
11551 | ||
9733086d BM |
11552 | /* |
11553 | =head1 Custom Operators | |
11554 | ||
11555 | =for apidoc Ao||custom_op_xop | |
11556 | Return the XOP structure for a given custom op. This function should be | |
11557 | considered internal to OP_NAME and the other access macros: use them instead. | |
11558 | ||
11559 | =cut | |
11560 | */ | |
11561 | ||
1830b3d9 BM |
11562 | const XOP * |
11563 | Perl_custom_op_xop(pTHX_ const OP *o) | |
53e06cf0 | 11564 | { |
1830b3d9 BM |
11565 | SV *keysv; |
11566 | HE *he = NULL; | |
11567 | XOP *xop; | |
11568 | ||
11569 | static const XOP xop_null = { 0, 0, 0, 0, 0 }; | |
53e06cf0 | 11570 | |
1830b3d9 BM |
11571 | PERL_ARGS_ASSERT_CUSTOM_OP_XOP; |
11572 | assert(o->op_type == OP_CUSTOM); | |
7918f24d | 11573 | |
1830b3d9 BM |
11574 | /* This is wrong. It assumes a function pointer can be cast to IV, |
11575 | * which isn't guaranteed, but this is what the old custom OP code | |
11576 | * did. In principle it should be safer to Copy the bytes of the | |
11577 | * pointer into a PV: since the new interface is hidden behind | |
11578 | * functions, this can be changed later if necessary. */ | |
11579 | /* Change custom_op_xop if this ever happens */ | |
11580 | keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr))); | |
53e06cf0 | 11581 | |
1830b3d9 BM |
11582 | if (PL_custom_ops) |
11583 | he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0); | |
11584 | ||
11585 | /* assume noone will have just registered a desc */ | |
11586 | if (!he && PL_custom_op_names && | |
11587 | (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0)) | |
11588 | ) { | |
11589 | const char *pv; | |
11590 | STRLEN l; | |
11591 | ||
11592 | /* XXX does all this need to be shared mem? */ | |
aca83993 | 11593 | Newxz(xop, 1, XOP); |
1830b3d9 BM |
11594 | pv = SvPV(HeVAL(he), l); |
11595 | XopENTRY_set(xop, xop_name, savepvn(pv, l)); | |
11596 | if (PL_custom_op_descs && | |
11597 | (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0)) | |
11598 | ) { | |
11599 | pv = SvPV(HeVAL(he), l); | |
11600 | XopENTRY_set(xop, xop_desc, savepvn(pv, l)); | |
11601 | } | |
11602 | Perl_custom_op_register(aTHX_ o->op_ppaddr, xop); | |
11603 | return xop; | |
11604 | } | |
53e06cf0 | 11605 | |
1830b3d9 | 11606 | if (!he) return &xop_null; |
53e06cf0 | 11607 | |
1830b3d9 BM |
11608 | xop = INT2PTR(XOP *, SvIV(HeVAL(he))); |
11609 | return xop; | |
53e06cf0 SC |
11610 | } |
11611 | ||
9733086d BM |
11612 | /* |
11613 | =for apidoc Ao||custom_op_register | |
11614 | Register a custom op. See L<perlguts/"Custom Operators">. | |
53e06cf0 | 11615 | |
9733086d BM |
11616 | =cut |
11617 | */ | |
7918f24d | 11618 | |
1830b3d9 BM |
11619 | void |
11620 | Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop) | |
11621 | { | |
11622 | SV *keysv; | |
11623 | ||
11624 | PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER; | |
53e06cf0 | 11625 | |
1830b3d9 BM |
11626 | /* see the comment in custom_op_xop */ |
11627 | keysv = sv_2mortal(newSViv(PTR2IV(ppaddr))); | |
53e06cf0 | 11628 | |
1830b3d9 BM |
11629 | if (!PL_custom_ops) |
11630 | PL_custom_ops = newHV(); | |
53e06cf0 | 11631 | |
1830b3d9 BM |
11632 | if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0)) |
11633 | Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name); | |
53e06cf0 | 11634 | } |
19e8ce8e | 11635 | |
b8c38f0a FC |
11636 | /* |
11637 | =head1 Functions in file op.c | |
11638 | ||
11639 | =for apidoc core_prototype | |
11640 | This function assigns the prototype of the named core function to C<sv>, or | |
11641 | to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or | |
a051f6c4 | 11642 | NULL if the core function has no prototype. C<code> is a code as returned |
4e338c21 | 11643 | by C<keyword()>. It must not be equal to 0 or -KEY_CORE. |
b8c38f0a FC |
11644 | |
11645 | =cut | |
11646 | */ | |
11647 | ||
11648 | SV * | |
be1b855b | 11649 | Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code, |
b66130dd | 11650 | int * const opnum) |
b8c38f0a | 11651 | { |
b8c38f0a FC |
11652 | int i = 0, n = 0, seen_question = 0, defgv = 0; |
11653 | I32 oa; | |
11654 | #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2) | |
11655 | char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */ | |
9927957a | 11656 | bool nullret = FALSE; |
b8c38f0a FC |
11657 | |
11658 | PERL_ARGS_ASSERT_CORE_PROTOTYPE; | |
11659 | ||
4e338c21 | 11660 | assert (code && code != -KEY_CORE); |
b8c38f0a FC |
11661 | |
11662 | if (!sv) sv = sv_newmortal(); | |
11663 | ||
9927957a | 11664 | #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv |
b8c38f0a | 11665 | |
4e338c21 | 11666 | switch (code < 0 ? -code : code) { |
b8c38f0a | 11667 | case KEY_and : case KEY_chop: case KEY_chomp: |
4e338c21 FC |
11668 | case KEY_cmp : case KEY_defined: case KEY_delete: case KEY_exec : |
11669 | case KEY_exists: case KEY_eq : case KEY_ge : case KEY_goto : | |
11670 | case KEY_grep : case KEY_gt : case KEY_last : case KEY_le : | |
11671 | case KEY_lt : case KEY_map : case KEY_ne : case KEY_next : | |
11672 | case KEY_or : case KEY_print : case KEY_printf: case KEY_qr : | |
11673 | case KEY_redo : case KEY_require: case KEY_return: case KEY_say : | |
11674 | case KEY_select: case KEY_sort : case KEY_split : case KEY_system: | |
11675 | case KEY_x : case KEY_xor : | |
9927957a | 11676 | if (!opnum) return NULL; nullret = TRUE; goto findopnum; |
4e338c21 | 11677 | case KEY_glob: retsetpvs("_;", OP_GLOB); |
9927957a FC |
11678 | case KEY_keys: retsetpvs("+", OP_KEYS); |
11679 | case KEY_values: retsetpvs("+", OP_VALUES); | |
11680 | case KEY_each: retsetpvs("+", OP_EACH); | |
11681 | case KEY_push: retsetpvs("+@", OP_PUSH); | |
11682 | case KEY_unshift: retsetpvs("+@", OP_UNSHIFT); | |
11683 | case KEY_pop: retsetpvs(";+", OP_POP); | |
11684 | case KEY_shift: retsetpvs(";+", OP_SHIFT); | |
4e338c21 | 11685 | case KEY_pos: retsetpvs(";\\[$*]", OP_POS); |
b8c38f0a | 11686 | case KEY_splice: |
9927957a | 11687 | retsetpvs("+;$$@", OP_SPLICE); |
b8c38f0a | 11688 | case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__: |
9927957a | 11689 | retsetpvs("", 0); |
7d789282 FC |
11690 | case KEY_evalbytes: |
11691 | name = "entereval"; break; | |
b8c38f0a FC |
11692 | case KEY_readpipe: |
11693 | name = "backtick"; | |
11694 | } | |
11695 | ||
11696 | #undef retsetpvs | |
11697 | ||
9927957a | 11698 | findopnum: |
b8c38f0a FC |
11699 | while (i < MAXO) { /* The slow way. */ |
11700 | if (strEQ(name, PL_op_name[i]) | |
11701 | || strEQ(name, PL_op_desc[i])) | |
11702 | { | |
9927957a | 11703 | if (nullret) { assert(opnum); *opnum = i; return NULL; } |
b8c38f0a FC |
11704 | goto found; |
11705 | } | |
11706 | i++; | |
11707 | } | |
4e338c21 | 11708 | return NULL; |
b8c38f0a FC |
11709 | found: |
11710 | defgv = PL_opargs[i] & OA_DEFGV; | |
11711 | oa = PL_opargs[i] >> OASHIFT; | |
11712 | while (oa) { | |
465bc0f5 | 11713 | if (oa & OA_OPTIONAL && !seen_question && ( |
ea5703f4 | 11714 | !defgv || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF |
465bc0f5 | 11715 | )) { |
b8c38f0a FC |
11716 | seen_question = 1; |
11717 | str[n++] = ';'; | |
11718 | } | |
11719 | if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF | |
11720 | && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF | |
11721 | /* But globs are already references (kinda) */ | |
11722 | && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF | |
11723 | ) { | |
11724 | str[n++] = '\\'; | |
11725 | } | |
1ecbeecf FC |
11726 | if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF |
11727 | && !scalar_mod_type(NULL, i)) { | |
11728 | str[n++] = '['; | |
11729 | str[n++] = '$'; | |
11730 | str[n++] = '@'; | |
11731 | str[n++] = '%'; | |
89c5c07e | 11732 | if (i == OP_LOCK || i == OP_UNDEF) str[n++] = '&'; |
1ecbeecf FC |
11733 | str[n++] = '*'; |
11734 | str[n++] = ']'; | |
11735 | } | |
11736 | else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)]; | |
ea5703f4 FC |
11737 | if (oa & OA_OPTIONAL && defgv && str[n-1] == '$') { |
11738 | str[n-1] = '_'; defgv = 0; | |
11739 | } | |
b8c38f0a FC |
11740 | oa = oa >> 4; |
11741 | } | |
dcbdef25 | 11742 | if (code == -KEY_not || code == -KEY_getprotobynumber) str[n++] = ';'; |
b8c38f0a FC |
11743 | str[n++] = '\0'; |
11744 | sv_setpvn(sv, str, n - 1); | |
9927957a | 11745 | if (opnum) *opnum = i; |
b8c38f0a FC |
11746 | return sv; |
11747 | } | |
11748 | ||
1e4b6aa1 FC |
11749 | OP * |
11750 | Perl_coresub_op(pTHX_ SV * const coreargssv, const int code, | |
11751 | const int opnum) | |
11752 | { | |
11753 | OP * const argop = newSVOP(OP_COREARGS,0,coreargssv); | |
c931b036 | 11754 | OP *o; |
1e4b6aa1 FC |
11755 | |
11756 | PERL_ARGS_ASSERT_CORESUB_OP; | |
11757 | ||
11758 | switch(opnum) { | |
11759 | case 0: | |
c2f605db | 11760 | return op_append_elem(OP_LINESEQ, |
1e4b6aa1 FC |
11761 | argop, |
11762 | newSLICEOP(0, | |
c2f605db | 11763 | newSVOP(OP_CONST, 0, newSViv(-code % 3)), |
1e4b6aa1 FC |
11764 | newOP(OP_CALLER,0) |
11765 | ) | |
c2f605db | 11766 | ); |
720d5b2f FC |
11767 | case OP_SELECT: /* which represents OP_SSELECT as well */ |
11768 | if (code) | |
11769 | return newCONDOP( | |
11770 | 0, | |
11771 | newBINOP(OP_GT, 0, | |
11772 | newAVREF(newGVOP(OP_GV, 0, PL_defgv)), | |
11773 | newSVOP(OP_CONST, 0, newSVuv(1)) | |
11774 | ), | |
11775 | coresub_op(newSVuv((UV)OP_SSELECT), 0, | |
11776 | OP_SSELECT), | |
11777 | coresub_op(coreargssv, 0, OP_SELECT) | |
11778 | ); | |
11779 | /* FALL THROUGH */ | |
1e4b6aa1 FC |
11780 | default: |
11781 | switch (PL_opargs[opnum] & OA_CLASS_MASK) { | |
11782 | case OA_BASEOP: | |
11783 | return op_append_elem( | |
11784 | OP_LINESEQ, argop, | |
11785 | newOP(opnum, | |
84ed0108 FC |
11786 | opnum == OP_WANTARRAY || opnum == OP_RUNCV |
11787 | ? OPpOFFBYONE << 8 : 0) | |
1e4b6aa1 | 11788 | ); |
527d644b | 11789 | case OA_BASEOP_OR_UNOP: |
7d789282 FC |
11790 | if (opnum == OP_ENTEREVAL) { |
11791 | o = newUNOP(OP_ENTEREVAL,OPpEVAL_COPHH<<8,argop); | |
11792 | if (code == -KEY_evalbytes) o->op_private |= OPpEVAL_BYTES; | |
11793 | } | |
11794 | else o = newUNOP(opnum,0,argop); | |
ce0b554b FC |
11795 | if (opnum == OP_CALLER) o->op_private |= OPpOFFBYONE; |
11796 | else { | |
c931b036 | 11797 | onearg: |
ce0b554b | 11798 | if (is_handle_constructor(o, 1)) |
c931b036 | 11799 | argop->op_private |= OPpCOREARGS_DEREF1; |
1efec5ed FC |
11800 | if (scalar_mod_type(NULL, opnum)) |
11801 | argop->op_private |= OPpCOREARGS_SCALARMOD; | |
ce0b554b | 11802 | } |
c931b036 | 11803 | return o; |
527d644b | 11804 | default: |
498a02d8 | 11805 | o = convert(opnum,OPf_SPECIAL*(opnum == OP_GLOB),argop); |
c931b036 FC |
11806 | if (is_handle_constructor(o, 2)) |
11807 | argop->op_private |= OPpCOREARGS_DEREF2; | |
7bc95ae1 FC |
11808 | if (opnum == OP_SUBSTR) { |
11809 | o->op_private |= OPpMAYBE_LVSUB; | |
11810 | return o; | |
11811 | } | |
11812 | else goto onearg; | |
1e4b6aa1 FC |
11813 | } |
11814 | } | |
11815 | } | |
11816 | ||
156d738f FC |
11817 | void |
11818 | Perl_report_redefined_cv(pTHX_ const SV *name, const CV *old_cv, | |
11819 | SV * const *new_const_svp) | |
11820 | { | |
11821 | const char *hvname; | |
11822 | bool is_const = !!CvCONST(old_cv); | |
11823 | SV *old_const_sv = is_const ? cv_const_sv(old_cv) : NULL; | |
11824 | ||
11825 | PERL_ARGS_ASSERT_REPORT_REDEFINED_CV; | |
11826 | ||
11827 | if (is_const && new_const_svp && old_const_sv == *new_const_svp) | |
11828 | return; | |
11829 | /* They are 2 constant subroutines generated from | |
11830 | the same constant. This probably means that | |
11831 | they are really the "same" proxy subroutine | |
11832 | instantiated in 2 places. Most likely this is | |
11833 | when a constant is exported twice. Don't warn. | |
11834 | */ | |
11835 | if ( | |
11836 | (ckWARN(WARN_REDEFINE) | |
11837 | && !( | |
11838 | CvGV(old_cv) && GvSTASH(CvGV(old_cv)) | |
11839 | && HvNAMELEN(GvSTASH(CvGV(old_cv))) == 7 | |
11840 | && (hvname = HvNAME(GvSTASH(CvGV(old_cv))), | |
11841 | strEQ(hvname, "autouse")) | |
11842 | ) | |
11843 | ) | |
11844 | || (is_const | |
11845 | && ckWARN_d(WARN_REDEFINE) | |
11846 | && (!new_const_svp || sv_cmp(old_const_sv, *new_const_svp)) | |
11847 | ) | |
11848 | ) | |
11849 | Perl_warner(aTHX_ packWARN(WARN_REDEFINE), | |
11850 | is_const | |
11851 | ? "Constant subroutine %"SVf" redefined" | |
11852 | : "Subroutine %"SVf" redefined", | |
11853 | name); | |
11854 | } | |
11855 | ||
e8570548 Z |
11856 | /* |
11857 | =head1 Hook manipulation | |
11858 | ||
11859 | These functions provide convenient and thread-safe means of manipulating | |
11860 | hook variables. | |
11861 | ||
11862 | =cut | |
11863 | */ | |
11864 | ||
11865 | /* | |
11866 | =for apidoc Am|void|wrap_op_checker|Optype opcode|Perl_check_t new_checker|Perl_check_t *old_checker_p | |
11867 | ||
11868 | Puts a C function into the chain of check functions for a specified op | |
11869 | type. This is the preferred way to manipulate the L</PL_check> array. | |
11870 | I<opcode> specifies which type of op is to be affected. I<new_checker> | |
11871 | is a pointer to the C function that is to be added to that opcode's | |
11872 | check chain, and I<old_checker_p> points to the storage location where a | |
11873 | pointer to the next function in the chain will be stored. The value of | |
11874 | I<new_pointer> is written into the L</PL_check> array, while the value | |
11875 | previously stored there is written to I<*old_checker_p>. | |
11876 | ||
11877 | L</PL_check> is global to an entire process, and a module wishing to | |
11878 | hook op checking may find itself invoked more than once per process, | |
11879 | typically in different threads. To handle that situation, this function | |
11880 | is idempotent. The location I<*old_checker_p> must initially (once | |
11881 | per process) contain a null pointer. A C variable of static duration | |
11882 | (declared at file scope, typically also marked C<static> to give | |
11883 | it internal linkage) will be implicitly initialised appropriately, | |
11884 | if it does not have an explicit initialiser. This function will only | |
11885 | actually modify the check chain if it finds I<*old_checker_p> to be null. | |
11886 | This function is also thread safe on the small scale. It uses appropriate | |
11887 | locking to avoid race conditions in accessing L</PL_check>. | |
11888 | ||
11889 | When this function is called, the function referenced by I<new_checker> | |
11890 | must be ready to be called, except for I<*old_checker_p> being unfilled. | |
11891 | In a threading situation, I<new_checker> may be called immediately, | |
11892 | even before this function has returned. I<*old_checker_p> will always | |
11893 | be appropriately set before I<new_checker> is called. If I<new_checker> | |
11894 | decides not to do anything special with an op that it is given (which | |
11895 | is the usual case for most uses of op check hooking), it must chain the | |
11896 | check function referenced by I<*old_checker_p>. | |
11897 | ||
11898 | If you want to influence compilation of calls to a specific subroutine, | |
11899 | then use L</cv_set_call_checker> rather than hooking checking of all | |
11900 | C<entersub> ops. | |
11901 | ||
11902 | =cut | |
11903 | */ | |
11904 | ||
11905 | void | |
11906 | Perl_wrap_op_checker(pTHX_ Optype opcode, | |
11907 | Perl_check_t new_checker, Perl_check_t *old_checker_p) | |
11908 | { | |
9b11155f TC |
11909 | dVAR; |
11910 | ||
e8570548 Z |
11911 | PERL_ARGS_ASSERT_WRAP_OP_CHECKER; |
11912 | if (*old_checker_p) return; | |
11913 | OP_CHECK_MUTEX_LOCK; | |
11914 | if (!*old_checker_p) { | |
11915 | *old_checker_p = PL_check[opcode]; | |
11916 | PL_check[opcode] = new_checker; | |
11917 | } | |
11918 | OP_CHECK_MUTEX_UNLOCK; | |
11919 | } | |
11920 | ||
beab0874 JT |
11921 | #include "XSUB.h" |
11922 | ||
11923 | /* Efficient sub that returns a constant scalar value. */ | |
11924 | static void | |
acfe0abc | 11925 | const_sv_xsub(pTHX_ CV* cv) |
beab0874 | 11926 | { |
97aff369 | 11927 | dVAR; |
beab0874 | 11928 | dXSARGS; |
99ab892b | 11929 | SV *const sv = MUTABLE_SV(XSANY.any_ptr); |
fcfc2536 | 11930 | PERL_UNUSED_ARG(items); |
99ab892b NC |
11931 | if (!sv) { |
11932 | XSRETURN(0); | |
11933 | } | |
9a049f1c | 11934 | EXTEND(sp, 1); |
99ab892b | 11935 | ST(0) = sv; |
beab0874 JT |
11936 | XSRETURN(1); |
11937 | } | |
4946a0fa | 11938 | |
6f1b3ab0 FC |
11939 | static void |
11940 | const_av_xsub(pTHX_ CV* cv) | |
11941 | { | |
11942 | dVAR; | |
11943 | dXSARGS; | |
11944 | AV * const av = MUTABLE_AV(XSANY.any_ptr); | |
11945 | SP -= items; | |
11946 | assert(av); | |
11947 | #ifndef DEBUGGING | |
11948 | if (!av) { | |
11949 | XSRETURN(0); | |
11950 | } | |
11951 | #endif | |
11952 | if (SvRMAGICAL(av)) | |
11953 | Perl_croak(aTHX_ "Magical list constants are not supported"); | |
11954 | if (GIMME_V != G_ARRAY) { | |
11955 | EXTEND(SP, 1); | |
11956 | ST(0) = newSViv((IV)AvFILLp(av)+1); | |
11957 | XSRETURN(1); | |
11958 | } | |
11959 | EXTEND(SP, AvFILLp(av)+1); | |
11960 | Copy(AvARRAY(av), &ST(0), AvFILLp(av)+1, SV *); | |
11961 | XSRETURN(AvFILLp(av)+1); | |
11962 | } | |
11963 | ||
4946a0fa NC |
11964 | /* |
11965 | * Local variables: | |
11966 | * c-indentation-style: bsd | |
11967 | * c-basic-offset: 4 | |
14d04a33 | 11968 | * indent-tabs-mode: nil |
4946a0fa NC |
11969 | * End: |
11970 | * | |
14d04a33 | 11971 | * ex: set ts=8 sts=4 sw=4 et: |
37442d52 | 11972 | */ |