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
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.
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
19 * [p.23 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
22 /* This file contains the functions that create, manipulate and optimize
23 * the OP structures that hold a compiled perl program.
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
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):
38 * newBINOP(OP_ADD, flags,
40 * newBINOP(OP_MULTIPLY, flags, newSVREF($b), newSVREF($c))
43 * Note that during the build of miniperl, a temporary copy of this file
44 * is made, called opmini.c.
48 Perl's compiler is essentially a 3-pass compiler with interleaved phases:
52 An execution-order pass
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
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.
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.
79 /* To implement user lexical pragmas, there needs to be a way at run time to
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
87 leaf, ignoring any key you've already seen (placeholder or not), storing
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.
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.
95 C<Perl_magic_sethint> updates C<PL_compiling.cop_hints_hash> with a store
96 record, with deletes written by C<Perl_magic_clearhint>. C<SAVEHINTS>
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.
104 #include "keywords.h"
108 #define CALL_PEEP(o) PL_peepp(aTHX_ o)
109 #define CALL_RPEEP(o) PL_rpeepp(aTHX_ o)
110 #define CALL_OPFREEHOOK(o) if (PL_opfreehook) PL_opfreehook(aTHX_ o)
112 /* See the explanatory comments above struct opslab in op.h. */
114 #ifdef PERL_DEBUG_READONLY_OPS
115 # define PERL_SLAB_SIZE 128
116 # define PERL_MAX_SLAB_SIZE 4096
117 # include <sys/mman.h>
120 #ifndef PERL_SLAB_SIZE
121 # define PERL_SLAB_SIZE 64
123 #ifndef PERL_MAX_SLAB_SIZE
124 # define PERL_MAX_SLAB_SIZE 2048
127 /* rounds up to nearest pointer */
128 #define SIZE_TO_PSIZE(x) (((x) + sizeof(I32 *) - 1)/sizeof(I32 *))
129 #define DIFF(o,p) ((size_t)((I32 **)(p) - (I32**)(o)))
132 S_new_slab(pTHX_ size_t sz)
134 #ifdef PERL_DEBUG_READONLY_OPS
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");
144 slab->opslab_size = (U16)sz;
146 OPSLAB *slab = (OPSLAB *)PerlMemShared_calloc(sz, sizeof(I32 *));
148 slab->opslab_first = (OPSLOT *)((I32 **)slab + sz - 1);
152 /* requires double parens and aTHX_ */
153 #define DEBUG_S_warn(args) \
155 PerlIO_printf(Perl_debug_log, "%s", SvPVx_nolen(Perl_mess args)) \
159 Perl_Slab_Alloc(pTHX_ size_t sz)
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. */
174 if (!PL_compcv || CvROOT(PL_compcv)
175 || (CvSTART(PL_compcv) && !CvSLABBED(PL_compcv)))
176 return PerlMemShared_calloc(1, sz);
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
184 if (!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 */
190 else ++(slab = (OPSLAB *)CvSTART(PL_compcv))->opslab_refcnt;
192 opsz = SIZE_TO_PSIZE(sz);
193 sz = opsz + OPSLOT_HEADER_P;
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. */
198 if (slab->opslab_freed) {
199 OP **too = &slab->opslab_freed;
201 DEBUG_S_warn((aTHX_ "found free op at %p, slab %p", o, slab));
202 while (o && DIFF(OpSLOT(o), OpSLOT(o)->opslot_next) < sz) {
203 DEBUG_S_warn((aTHX_ "Alas! too small"));
204 o = *(too = &o->op_next);
205 if (o) { DEBUG_S_warn((aTHX_ "found another free op at %p", o)); }
209 Zero(o, opsz, I32 *);
215 #define INIT_OPSLOT \
216 slot->opslot_slab = slab; \
217 slot->opslot_next = slab2->opslab_first; \
218 slab2->opslab_first = slot; \
219 o = &slot->opslot_op; \
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. */
227 /* If we can fit a BASEOP, add it to the free chain, so as not
229 if (space >= SIZE_TO_PSIZE(sizeof(OP)) + OPSLOT_HEADER_P) {
230 slot = &slab2->opslab_slots;
232 o->op_type = OP_FREED;
233 o->op_next = slab->opslab_freed;
234 slab->opslab_freed = o;
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;
240 slab2 = S_new_slab(aTHX_
241 (DIFF(slab2, slot)+1)*2 > PERL_MAX_SLAB_SIZE
243 : (DIFF(slab2, slot)+1)*2);
244 slab2->opslab_next = slab->opslab_next;
245 slab->opslab_next = slab2;
247 assert(DIFF(&slab2->opslab_slots, slab2->opslab_first) >= sz);
249 /* Create a new op slot */
250 slot = (OPSLOT *)((I32 **)slab2->opslab_first - sz);
251 assert(slot >= &slab2->opslab_slots);
252 if (DIFF(&slab2->opslab_slots, slot)
253 < SIZE_TO_PSIZE(sizeof(OP)) + OPSLOT_HEADER_P)
254 slot = &slab2->opslab_slots;
256 DEBUG_S_warn((aTHX_ "allocating op at %p, slab %p", o, slab));
262 #ifdef PERL_DEBUG_READONLY_OPS
264 Perl_Slab_to_ro(pTHX_ OPSLAB *slab)
266 PERL_ARGS_ASSERT_SLAB_TO_RO;
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);
280 Perl_Slab_to_rw(pTHX_ OPSLAB *const slab)
284 PERL_ARGS_ASSERT_SLAB_TO_RW;
286 if (!slab->opslab_readonly) return;
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);
297 slab->opslab_readonly = 0;
301 # define Slab_to_rw(op) NOOP
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
308 # define PerlMemShared PerlMem
312 Perl_Slab_Free(pTHX_ void *op)
315 OP * const o = (OP *)op;
318 PERL_ARGS_ASSERT_SLAB_FREE;
320 if (!o->op_slabbed) {
322 PerlMemShared_free(op);
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;
332 DEBUG_S_warn((aTHX_ "free op at %p, recorded in slab %p", o, slab));
333 OpslabREFCNT_dec_padok(slab);
337 Perl_opslab_free_nopad(pTHX_ OPSLAB *slab)
340 const bool havepad = !!PL_comppad;
341 PERL_ARGS_ASSERT_OPSLAB_FREE_NOPAD;
344 PAD_SAVE_SETNULLPAD();
351 Perl_opslab_free(pTHX_ OPSLAB *slab)
355 PERL_ARGS_ASSERT_OPSLAB_FREE;
356 DEBUG_S_warn((aTHX_ "freeing slab %p", slab));
357 assert(slab->opslab_refcnt == 1);
358 for (; slab; slab = slab2) {
359 slab2 = slab->opslab_next;
361 slab->opslab_refcnt = ~(size_t)0;
363 #ifdef PERL_DEBUG_READONLY_OPS
364 DEBUG_m(PerlIO_printf(Perl_debug_log, "Deallocate slab at %p\n",
366 if (munmap(slab, slab->opslab_size * sizeof(I32 *))) {
367 perror("munmap failed");
371 PerlMemShared_free(slab);
377 Perl_opslab_force_free(pTHX_ OPSLAB *slab)
382 size_t savestack_count = 0;
384 PERL_ARGS_ASSERT_OPSLAB_FORCE_FREE;
387 for (slot = slab2->opslab_first;
389 slot = slot->opslot_next) {
390 if (slot->opslot_op.op_type != OP_FREED
391 && !(slot->opslot_op.op_savefree
397 assert(slot->opslot_op.op_slabbed);
398 op_free(&slot->opslot_op);
399 if (slab->opslab_refcnt == 1) goto free;
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 */
406 assert(savestack_count == slab->opslab_refcnt-1);
408 /* Remove the CV’s reference count. */
409 slab->opslab_refcnt--;
416 #ifdef PERL_DEBUG_READONLY_OPS
418 Perl_op_refcnt_inc(pTHX_ OP *o)
421 OPSLAB *const slab = o->op_slabbed ? OpSLAB(o) : NULL;
422 if (slab && slab->opslab_readonly) {
435 Perl_op_refcnt_dec(pTHX_ OP *o)
438 OPSLAB *const slab = o->op_slabbed ? OpSLAB(o) : NULL;
440 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
442 if (slab && slab->opslab_readonly) {
444 result = --o->op_targ;
447 result = --o->op_targ;
453 * In the following definition, the ", (OP*)0" is just to make the compiler
454 * think the expression is of the right type: croak actually does a Siglongjmp.
456 #define CHECKOP(type,o) \
457 ((PL_op_mask && PL_op_mask[type]) \
458 ? ( op_free((OP*)o), \
459 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
461 : PL_check[type](aTHX_ (OP*)o))
463 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
465 #define CHANGE_TYPE(o,type) \
467 o->op_type = (OPCODE)type; \
468 o->op_ppaddr = PL_ppaddr[type]; \
472 S_gv_ename(pTHX_ GV *gv)
474 SV* const tmpsv = sv_newmortal();
476 PERL_ARGS_ASSERT_GV_ENAME;
478 gv_efullname3(tmpsv, gv, NULL);
483 S_no_fh_allowed(pTHX_ OP *o)
485 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
487 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
493 S_too_few_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags)
495 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_SV;
496 yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %"SVf, namesv),
497 SvUTF8(namesv) | flags);
502 S_too_few_arguments_pv(pTHX_ OP *o, const char* name, U32 flags)
504 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_PV;
505 yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %s", name), flags);
510 S_too_many_arguments_pv(pTHX_ OP *o, const char *name, U32 flags)
512 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_PV;
514 yyerror_pv(Perl_form(aTHX_ "Too many arguments for %s", name), flags);
519 S_too_many_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags)
521 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_SV;
523 yyerror_pv(Perl_form(aTHX_ "Too many arguments for %"SVf, SVfARG(namesv)),
524 SvUTF8(namesv) | flags);
529 S_bad_type_pv(pTHX_ I32 n, const char *t, const char *name, U32 flags, const OP *kid)
531 PERL_ARGS_ASSERT_BAD_TYPE_PV;
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);
538 S_bad_type_gv(pTHX_ I32 n, const char *t, GV *gv, U32 flags, const OP *kid)
540 SV * const namesv = gv_ename(gv);
541 PERL_ARGS_ASSERT_BAD_TYPE_GV;
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);
548 S_no_bareword_allowed(pTHX_ OP *o)
550 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
553 return; /* various ok barewords are hidden in extra OP_NULL */
554 qerror(Perl_mess(aTHX_
555 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
557 o->op_private &= ~OPpCONST_STRICT; /* prevent warning twice about the same OP */
560 /* "register" allocation */
563 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
567 const bool is_our = (PL_parser->in_my == KEY_our);
569 PERL_ARGS_ASSERT_ALLOCMY;
571 if (flags & ~SVf_UTF8)
572 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
575 /* Until we're using the length for real, cross check that we're being
577 assert(strlen(name) == len);
579 /* complain about "my $<special_var>" etc etc */
583 ((flags & SVf_UTF8) && isIDFIRST_utf8((U8 *)name+1)) ||
584 (name[1] == '_' && (*name == '$' || len > 2))))
586 /* name[2] is true if strlen(name) > 2 */
587 if (!(flags & SVf_UTF8 && UTF8_IS_START(name[1]))
588 && (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1]))) {
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,
591 PL_parser->in_my == KEY_state ? "state" : "my"));
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);
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
605 /* allocate a spare slot and store the name in that slot */
607 off = pad_add_name_pvn(name, len,
608 (is_our ? padadd_OUR :
609 PL_parser->in_my == KEY_state ? padadd_STATE : 0)
610 | ( flags & SVf_UTF8 ? SVf_UTF8 : 0 ),
611 PL_parser->in_my_stash,
613 /* $_ is always in main::, even with our */
614 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
618 /* anon sub prototypes contains state vars should always be cloned,
619 * otherwise the state var would be shared between anon subs */
621 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
622 CvCLONE_on(PL_compcv);
628 =for apidoc alloccopstash
630 Available only under threaded builds, this function allocates an entry in
631 C<PL_stashpad> for the stash passed to it.
638 Perl_alloccopstash(pTHX_ HV *hv)
640 PADOFFSET off = 0, o = 1;
641 bool found_slot = FALSE;
643 PERL_ARGS_ASSERT_ALLOCCOPSTASH;
645 if (PL_stashpad[PL_stashpadix] == hv) return PL_stashpadix;
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;
653 Renew(PL_stashpad, PL_stashpadmax + 10, HV *);
654 Zero(PL_stashpad + PL_stashpadmax, 10, HV *);
655 off = PL_stashpadmax;
656 PL_stashpadmax += 10;
659 PL_stashpad[PL_stashpadix = off] = hv;
664 /* free the body of an op without examining its contents.
665 * Always use this rather than FreeOp directly */
668 S_op_destroy(pTHX_ OP *o)
676 Perl_op_free(pTHX_ OP *o)
681 /* Though ops may be freed twice, freeing the op after its slab is a
683 assert(!o || !o->op_slabbed || OpSLAB(o)->opslab_refcnt != ~(size_t)0);
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)
690 if (o->op_private & OPpREFCOUNTED) {
701 refcnt = OpREFCNT_dec(o);
704 /* Need to find and remove any pattern match ops from the list
705 we maintain for reset(). */
706 find_and_forget_pmops(o);
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
721 if (o->op_flags & OPf_KIDS) {
723 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
724 nextkid = kid->op_sibling; /* Get before next freeing kid */
729 type = (OPCODE)o->op_targ;
732 Slab_to_rw(OpSLAB(o));
734 /* COP* is not cleared by op_clear() so that we may track line
735 * numbers etc even after null() */
736 if (type == OP_NEXTSTATE || type == OP_DBSTATE) {
742 #ifdef DEBUG_LEAKING_SCALARS
749 Perl_op_clear(pTHX_ OP *o)
754 PERL_ARGS_ASSERT_OP_CLEAR;
757 mad_free(o->op_madprop);
762 switch (o->op_type) {
763 case OP_NULL: /* Was holding old type, if any. */
764 if (PL_madskills && o->op_targ != OP_NULL) {
765 o->op_type = (Optype)o->op_targ;
770 case OP_ENTEREVAL: /* Was holding hints. */
774 if (!(o->op_flags & OPf_REF)
775 || (PL_check[o->op_type] != Perl_ck_ftst))
782 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
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);
804 SvREFCNT_inc_simple_void(gv);
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;
813 SvREFCNT_dec(cSVOPo->op_sv);
814 cSVOPo->op_sv = NULL;
817 int try_downgrade = SvREFCNT(gv) == 2;
820 gv_try_downgrade(gv);
824 case OP_METHOD_NAMED:
827 SvREFCNT_dec(cSVOPo->op_sv);
828 cSVOPo->op_sv = NULL;
831 Even if op_clear does a pad_free for the target of the op,
832 pad_free doesn't actually remove the sv that exists in the pad;
833 instead it lives on. This results in that it could be reused as
834 a target later on when the pad was reallocated.
837 pad_swipe(o->op_targ,1);
847 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
852 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
853 assert(o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
855 if (cPADOPo->op_padix > 0) {
856 pad_swipe(cPADOPo->op_padix, TRUE);
857 cPADOPo->op_padix = 0;
860 SvREFCNT_dec(cSVOPo->op_sv);
861 cSVOPo->op_sv = NULL;
865 PerlMemShared_free(cPVOPo->op_pv);
866 cPVOPo->op_pv = NULL;
870 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
874 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
875 /* No GvIN_PAD_off here, because other references may still
876 * exist on the pad */
877 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
880 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
886 if (!(cPMOPo->op_pmflags & PMf_CODELIST_PRIVATE))
887 op_free(cPMOPo->op_code_list);
888 cPMOPo->op_code_list = NULL;
890 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
891 /* we use the same protection as the "SAFE" version of the PM_ macros
892 * here since sv_clean_all might release some PMOPs
893 * after PL_regex_padav has been cleared
894 * and the clearing of PL_regex_padav needs to
895 * happen before sv_clean_all
898 if(PL_regex_pad) { /* We could be in destruction */
899 const IV offset = (cPMOPo)->op_pmoffset;
900 ReREFCNT_dec(PM_GETRE(cPMOPo));
901 PL_regex_pad[offset] = &PL_sv_undef;
902 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
906 ReREFCNT_dec(PM_GETRE(cPMOPo));
907 PM_SETRE(cPMOPo, NULL);
913 if (o->op_targ > 0) {
914 pad_free(o->op_targ);
920 S_cop_free(pTHX_ COP* cop)
922 PERL_ARGS_ASSERT_COP_FREE;
925 if (! specialWARN(cop->cop_warnings))
926 PerlMemShared_free(cop->cop_warnings);
927 cophh_free(CopHINTHASH_get(cop));
928 if (PL_curcop == cop)
933 S_forget_pmop(pTHX_ PMOP *const o
936 HV * const pmstash = PmopSTASH(o);
938 PERL_ARGS_ASSERT_FORGET_PMOP;
940 if (pmstash && !SvIS_FREED(pmstash) && SvMAGICAL(pmstash)) {
941 MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab);
943 PMOP **const array = (PMOP**) mg->mg_ptr;
944 U32 count = mg->mg_len / sizeof(PMOP**);
949 /* Found it. Move the entry at the end to overwrite it. */
950 array[i] = array[--count];
951 mg->mg_len = count * sizeof(PMOP**);
952 /* Could realloc smaller at this point always, but probably
953 not worth it. Probably worth free()ing if we're the
956 Safefree(mg->mg_ptr);
969 S_find_and_forget_pmops(pTHX_ OP *o)
971 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
973 if (o->op_flags & OPf_KIDS) {
974 OP *kid = cUNOPo->op_first;
976 switch (kid->op_type) {
981 forget_pmop((PMOP*)kid);
983 find_and_forget_pmops(kid);
984 kid = kid->op_sibling;
990 Perl_op_null(pTHX_ OP *o)
994 PERL_ARGS_ASSERT_OP_NULL;
996 if (o->op_type == OP_NULL)
1000 o->op_targ = o->op_type;
1001 o->op_type = OP_NULL;
1002 o->op_ppaddr = PL_ppaddr[OP_NULL];
1006 Perl_op_refcnt_lock(pTHX)
1009 PERL_UNUSED_CONTEXT;
1014 Perl_op_refcnt_unlock(pTHX)
1017 PERL_UNUSED_CONTEXT;
1021 /* Contextualizers */
1024 =for apidoc Am|OP *|op_contextualize|OP *o|I32 context
1026 Applies a syntactic context to an op tree representing an expression.
1027 I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>,
1028 or C<G_VOID> to specify the context to apply. The modified op tree
1035 Perl_op_contextualize(pTHX_ OP *o, I32 context)
1037 PERL_ARGS_ASSERT_OP_CONTEXTUALIZE;
1039 case G_SCALAR: return scalar(o);
1040 case G_ARRAY: return list(o);
1041 case G_VOID: return scalarvoid(o);
1043 Perl_croak(aTHX_ "panic: op_contextualize bad context %ld",
1050 =head1 Optree Manipulation Functions
1052 =for apidoc Am|OP*|op_linklist|OP *o
1053 This function is the implementation of the L</LINKLIST> macro. It should
1054 not be called directly.
1060 Perl_op_linklist(pTHX_ OP *o)
1064 PERL_ARGS_ASSERT_OP_LINKLIST;
1069 /* establish postfix order */
1070 first = cUNOPo->op_first;
1073 o->op_next = LINKLIST(first);
1076 if (kid->op_sibling) {
1077 kid->op_next = LINKLIST(kid->op_sibling);
1078 kid = kid->op_sibling;
1092 S_scalarkids(pTHX_ OP *o)
1094 if (o && o->op_flags & OPf_KIDS) {
1096 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1103 S_scalarboolean(pTHX_ OP *o)
1107 PERL_ARGS_ASSERT_SCALARBOOLEAN;
1109 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST
1110 && !(cBINOPo->op_first->op_flags & OPf_SPECIAL)) {
1111 if (ckWARN(WARN_SYNTAX)) {
1112 const line_t oldline = CopLINE(PL_curcop);
1114 if (PL_parser && PL_parser->copline != NOLINE) {
1115 /* This ensures that warnings are reported at the first line
1116 of the conditional, not the last. */
1117 CopLINE_set(PL_curcop, PL_parser->copline);
1119 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
1120 CopLINE_set(PL_curcop, oldline);
1127 S_op_varname(pTHX_ const OP *o)
1130 assert(o->op_type == OP_PADAV || o->op_type == OP_RV2AV ||
1131 o->op_type == OP_PADHV || o->op_type == OP_RV2HV);
1133 const char funny = o->op_type == OP_PADAV
1134 || o->op_type == OP_RV2AV ? '@' : '%';
1135 if (o->op_type == OP_RV2AV || o->op_type == OP_RV2HV) {
1137 if (cUNOPo->op_first->op_type != OP_GV
1138 || !(gv = cGVOPx_gv(cUNOPo->op_first)))
1140 return varname(gv, funny, 0, NULL, 0, 1);
1143 varname(MUTABLE_GV(PL_compcv), funny, o->op_targ, NULL, 0, 1);
1148 S_op_pretty(pTHX_ const OP *o, SV **retsv, const char **retpv)
1149 { /* or not so pretty :-) */
1150 if (o->op_type == OP_CONST) {
1152 if (SvPOK(*retsv)) {
1154 *retsv = sv_newmortal();
1155 pv_pretty(*retsv, SvPVX_const(sv), SvCUR(sv), 32, NULL, NULL,
1156 PERL_PV_PRETTY_DUMP |PERL_PV_ESCAPE_UNI_DETECT);
1158 else if (!SvOK(*retsv))
1161 else *retpv = "...";
1165 S_scalar_slice_warning(pTHX_ const OP *o)
1169 o->op_type == OP_HSLICE ? '{' : '[';
1171 o->op_type == OP_HSLICE ? '}' : ']';
1173 SV *keysv = NULL; /* just to silence compiler warnings */
1174 const char *key = NULL;
1176 if (!(o->op_private & OPpSLICEWARNING))
1178 if (PL_parser && PL_parser->error_count)
1179 /* This warning can be nonsensical when there is a syntax error. */
1182 kid = cLISTOPo->op_first;
1183 kid = kid->op_sibling; /* get past pushmark */
1184 /* weed out false positives: any ops that can return lists */
1185 switch (kid->op_type) {
1213 assert(kid->op_sibling);
1214 name = S_op_varname(aTHX_ kid->op_sibling);
1215 if (!name) /* XS module fiddling with the op tree */
1217 S_op_pretty(aTHX_ kid, &keysv, &key);
1218 assert(SvPOK(name));
1219 sv_chop(name,SvPVX(name)+1);
1221 /* diag_listed_as: Scalar value @%s[%s] better written as $%s[%s] */
1222 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
1223 "Scalar value @%"SVf"%c%s%c better written as $%"SVf
1225 SVfARG(name), lbrack, key, rbrack, SVfARG(name),
1226 lbrack, key, rbrack);
1228 /* diag_listed_as: Scalar value @%s[%s] better written as $%s[%s] */
1229 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
1230 "Scalar value @%"SVf"%c%"SVf"%c better written as $%"
1232 SVfARG(name), lbrack, keysv, rbrack,
1233 SVfARG(name), lbrack, keysv, rbrack);
1237 Perl_scalar(pTHX_ OP *o)
1242 /* assumes no premature commitment */
1243 if (!o || (PL_parser && PL_parser->error_count)
1244 || (o->op_flags & OPf_WANT)
1245 || o->op_type == OP_RETURN)
1250 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
1252 switch (o->op_type) {
1254 scalar(cBINOPo->op_first);
1259 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1269 if (o->op_flags & OPf_KIDS) {
1270 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1276 kid = cLISTOPo->op_first;
1278 kid = kid->op_sibling;
1281 OP *sib = kid->op_sibling;
1282 if (sib && kid->op_type != OP_LEAVEWHEN)
1288 PL_curcop = &PL_compiling;
1293 kid = cLISTOPo->op_first;
1296 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
1301 /* Warn about scalar context */
1302 const char lbrack = o->op_type == OP_KVHSLICE ? '{' : '[';
1303 const char rbrack = o->op_type == OP_KVHSLICE ? '}' : ']';
1306 const char *key = NULL;
1308 /* This warning can be nonsensical when there is a syntax error. */
1309 if (PL_parser && PL_parser->error_count)
1312 if (!ckWARN(WARN_SYNTAX)) break;
1314 kid = cLISTOPo->op_first;
1315 kid = kid->op_sibling; /* get past pushmark */
1316 assert(kid->op_sibling);
1317 name = S_op_varname(aTHX_ kid->op_sibling);
1318 if (!name) /* XS module fiddling with the op tree */
1320 S_op_pretty(aTHX_ kid, &keysv, &key);
1321 assert(SvPOK(name));
1322 sv_chop(name,SvPVX(name)+1);
1324 /* diag_listed_as: %%s[%s] in scalar context better written as $%s[%s] */
1325 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
1326 "%%%"SVf"%c%s%c in scalar context better written "
1328 SVfARG(name), lbrack, key, rbrack, SVfARG(name),
1329 lbrack, key, rbrack);
1331 /* diag_listed_as: %%s[%s] in scalar context better written as $%s[%s] */
1332 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
1333 "%%%"SVf"%c%"SVf"%c in scalar context better "
1334 "written as $%"SVf"%c%"SVf"%c",
1335 SVfARG(name), lbrack, keysv, rbrack,
1336 SVfARG(name), lbrack, keysv, rbrack);
1343 Perl_scalarvoid(pTHX_ OP *o)
1347 SV *useless_sv = NULL;
1348 const char* useless = NULL;
1352 PERL_ARGS_ASSERT_SCALARVOID;
1354 /* trailing mad null ops don't count as "there" for void processing */
1356 o->op_type != OP_NULL &&
1358 o->op_sibling->op_type == OP_NULL)
1361 for (sib = o->op_sibling;
1362 sib && sib->op_type == OP_NULL;
1363 sib = sib->op_sibling) ;
1369 if (o->op_type == OP_NEXTSTATE
1370 || o->op_type == OP_DBSTATE
1371 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1372 || o->op_targ == OP_DBSTATE)))
1373 PL_curcop = (COP*)o; /* for warning below */
1375 /* assumes no premature commitment */
1376 want = o->op_flags & OPf_WANT;
1377 if ((want && want != OPf_WANT_SCALAR)
1378 || (PL_parser && PL_parser->error_count)
1379 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN)
1384 if ((o->op_private & OPpTARGET_MY)
1385 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1387 return scalar(o); /* As if inside SASSIGN */
1390 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1392 switch (o->op_type) {
1394 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1398 if (o->op_flags & OPf_STACKED)
1402 if (o->op_private == 4)
1427 case OP_AELEMFAST_LEX:
1448 case OP_GETSOCKNAME:
1449 case OP_GETPEERNAME:
1454 case OP_GETPRIORITY:
1479 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1480 /* Otherwise it's "Useless use of grep iterator" */
1481 useless = OP_DESC(o);
1485 kid = cLISTOPo->op_first;
1486 if (kid && kid->op_type == OP_PUSHRE
1488 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1490 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1492 useless = OP_DESC(o);
1496 kid = cUNOPo->op_first;
1497 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1498 kid->op_type != OP_TRANS && kid->op_type != OP_TRANSR) {
1501 useless = "negative pattern binding (!~)";
1505 if (cPMOPo->op_pmflags & PMf_NONDESTRUCT)
1506 useless = "non-destructive substitution (s///r)";
1510 useless = "non-destructive transliteration (tr///r)";
1517 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1518 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1519 useless = "a variable";
1524 if (cSVOPo->op_private & OPpCONST_STRICT)
1525 no_bareword_allowed(o);
1527 if (ckWARN(WARN_VOID)) {
1528 /* don't warn on optimised away booleans, eg
1529 * use constant Foo, 5; Foo || print; */
1530 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1532 /* the constants 0 and 1 are permitted as they are
1533 conventionally used as dummies in constructs like
1534 1 while some_condition_with_side_effects; */
1535 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1537 else if (SvPOK(sv)) {
1538 SV * const dsv = newSVpvs("");
1540 = Perl_newSVpvf(aTHX_
1542 pv_pretty(dsv, SvPVX_const(sv),
1543 SvCUR(sv), 32, NULL, NULL,
1545 | PERL_PV_ESCAPE_NOCLEAR
1546 | PERL_PV_ESCAPE_UNI_DETECT));
1547 SvREFCNT_dec_NN(dsv);
1549 else if (SvOK(sv)) {
1550 useless_sv = Perl_newSVpvf(aTHX_ "a constant (%"SVf")", sv);
1553 useless = "a constant (undef)";
1556 op_null(o); /* don't execute or even remember it */
1560 o->op_type = OP_PREINC; /* pre-increment is faster */
1561 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1565 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1566 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1570 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1571 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1575 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1576 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1581 UNOP *refgen, *rv2cv;
1584 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
1587 rv2gv = ((BINOP *)o)->op_last;
1588 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
1591 refgen = (UNOP *)((BINOP *)o)->op_first;
1593 if (!refgen || refgen->op_type != OP_REFGEN)
1596 exlist = (LISTOP *)refgen->op_first;
1597 if (!exlist || exlist->op_type != OP_NULL
1598 || exlist->op_targ != OP_LIST)
1601 if (exlist->op_first->op_type != OP_PUSHMARK)
1604 rv2cv = (UNOP*)exlist->op_last;
1606 if (rv2cv->op_type != OP_RV2CV)
1609 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
1610 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
1611 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
1613 o->op_private |= OPpASSIGN_CV_TO_GV;
1614 rv2gv->op_private |= OPpDONT_INIT_GV;
1615 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
1627 kid = cLOGOPo->op_first;
1628 if (kid->op_type == OP_NOT
1629 && (kid->op_flags & OPf_KIDS)
1631 if (o->op_type == OP_AND) {
1633 o->op_ppaddr = PL_ppaddr[OP_OR];
1635 o->op_type = OP_AND;
1636 o->op_ppaddr = PL_ppaddr[OP_AND];
1645 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1650 if (o->op_flags & OPf_STACKED)
1657 if (!(o->op_flags & OPf_KIDS))
1668 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1679 /* mortalise it, in case warnings are fatal. */
1680 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
1681 "Useless use of %"SVf" in void context",
1682 sv_2mortal(useless_sv));
1685 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
1686 "Useless use of %s in void context",
1693 S_listkids(pTHX_ OP *o)
1695 if (o && o->op_flags & OPf_KIDS) {
1697 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1704 Perl_list(pTHX_ OP *o)
1709 /* assumes no premature commitment */
1710 if (!o || (o->op_flags & OPf_WANT)
1711 || (PL_parser && PL_parser->error_count)
1712 || o->op_type == OP_RETURN)
1717 if ((o->op_private & OPpTARGET_MY)
1718 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1720 return o; /* As if inside SASSIGN */
1723 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1725 switch (o->op_type) {
1728 list(cBINOPo->op_first);
1733 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1741 if (!(o->op_flags & OPf_KIDS))
1743 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1744 list(cBINOPo->op_first);
1745 return gen_constant_list(o);
1752 kid = cLISTOPo->op_first;
1754 kid = kid->op_sibling;
1757 OP *sib = kid->op_sibling;
1758 if (sib && kid->op_type != OP_LEAVEWHEN)
1764 PL_curcop = &PL_compiling;
1768 kid = cLISTOPo->op_first;
1775 S_scalarseq(pTHX_ OP *o)
1779 const OPCODE type = o->op_type;
1781 if (type == OP_LINESEQ || type == OP_SCOPE ||
1782 type == OP_LEAVE || type == OP_LEAVETRY)
1785 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1786 if (kid->op_sibling) {
1790 PL_curcop = &PL_compiling;
1792 o->op_flags &= ~OPf_PARENS;
1793 if (PL_hints & HINT_BLOCK_SCOPE)
1794 o->op_flags |= OPf_PARENS;
1797 o = newOP(OP_STUB, 0);
1802 S_modkids(pTHX_ OP *o, I32 type)
1804 if (o && o->op_flags & OPf_KIDS) {
1806 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1807 op_lvalue(kid, type);
1813 =for apidoc finalize_optree
1815 This function finalizes the optree. Should be called directly after
1816 the complete optree is built. It does some additional
1817 checking which can't be done in the normal ck_xxx functions and makes
1818 the tree thread-safe.
1823 Perl_finalize_optree(pTHX_ OP* o)
1825 PERL_ARGS_ASSERT_FINALIZE_OPTREE;
1828 SAVEVPTR(PL_curcop);
1836 S_finalize_op(pTHX_ OP* o)
1838 PERL_ARGS_ASSERT_FINALIZE_OP;
1840 #if defined(PERL_MAD) && defined(USE_ITHREADS)
1842 /* Make sure mad ops are also thread-safe */
1843 MADPROP *mp = o->op_madprop;
1845 if (mp->mad_type == MAD_OP && mp->mad_vlen) {
1846 OP *prop_op = (OP *) mp->mad_val;
1847 /* We only need "Relocate sv to the pad for thread safety.", but this
1848 easiest way to make sure it traverses everything */
1849 if (prop_op->op_type == OP_CONST)
1850 cSVOPx(prop_op)->op_private &= ~OPpCONST_STRICT;
1851 finalize_op(prop_op);
1858 switch (o->op_type) {
1861 PL_curcop = ((COP*)o); /* for warnings */
1865 && (o->op_sibling->op_type == OP_NEXTSTATE || o->op_sibling->op_type == OP_DBSTATE)
1866 && ckWARN(WARN_EXEC))
1868 if (o->op_sibling->op_sibling) {
1869 const OPCODE type = o->op_sibling->op_sibling->op_type;
1870 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
1871 const line_t oldline = CopLINE(PL_curcop);
1872 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_sibling));
1873 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1874 "Statement unlikely to be reached");
1875 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1876 "\t(Maybe you meant system() when you said exec()?)\n");
1877 CopLINE_set(PL_curcop, oldline);
1884 if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
1885 GV * const gv = cGVOPo_gv;
1886 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
1887 /* XXX could check prototype here instead of just carping */
1888 SV * const sv = sv_newmortal();
1889 gv_efullname3(sv, gv, NULL);
1890 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
1891 "%"SVf"() called too early to check prototype",
1898 if (cSVOPo->op_private & OPpCONST_STRICT)
1899 no_bareword_allowed(o);
1903 case OP_METHOD_NAMED:
1904 /* Relocate sv to the pad for thread safety.
1905 * Despite being a "constant", the SV is written to,
1906 * for reference counts, sv_upgrade() etc. */
1907 if (cSVOPo->op_sv) {
1908 const PADOFFSET ix = pad_alloc(OP_CONST, SVf_READONLY);
1909 SvREFCNT_dec(PAD_SVl(ix));
1910 PAD_SETSV(ix, cSVOPo->op_sv);
1911 /* XXX I don't know how this isn't readonly already. */
1912 if (!SvIsCOW(PAD_SVl(ix))) SvREADONLY_on(PAD_SVl(ix));
1913 cSVOPo->op_sv = NULL;
1927 if ((key_op = cSVOPx(((BINOP*)o)->op_last))->op_type != OP_CONST)
1930 rop = (UNOP*)((BINOP*)o)->op_first;
1935 S_scalar_slice_warning(aTHX_ o);
1938 if (/* I bet there's always a pushmark... */
1939 (kid = cLISTOPo->op_first->op_sibling)->op_type != OP_LIST
1940 && kid->op_type != OP_CONST)
1943 key_op = (SVOP*)(kid->op_type == OP_CONST
1945 : kLISTOP->op_first->op_sibling);
1947 rop = (UNOP*)((LISTOP*)o)->op_last;
1950 if (o->op_private & OPpLVAL_INTRO || rop->op_type != OP_RV2HV)
1952 else if (rop->op_first->op_type == OP_PADSV)
1953 /* @$hash{qw(keys here)} */
1954 rop = (UNOP*)rop->op_first;
1956 /* @{$hash}{qw(keys here)} */
1957 if (rop->op_first->op_type == OP_SCOPE
1958 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
1960 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
1966 lexname = NULL; /* just to silence compiler warnings */
1967 fields = NULL; /* just to silence compiler warnings */
1971 && (lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE),
1972 SvPAD_TYPED(lexname))
1973 && (fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE))
1974 && isGV(*fields) && GvHV(*fields);
1976 key_op = (SVOP*)key_op->op_sibling) {
1978 if (key_op->op_type != OP_CONST)
1980 svp = cSVOPx_svp(key_op);
1982 /* Make the CONST have a shared SV */
1983 if ((!SvIsCOW_shared_hash(sv = *svp))
1984 && SvTYPE(sv) < SVt_PVMG && SvOK(sv) && !SvROK(sv)) {
1986 const char * const key = SvPV_const(sv, *(STRLEN*)&keylen);
1987 SV *nsv = newSVpvn_share(key,
1988 SvUTF8(sv) ? -keylen : keylen, 0);
1989 SvREFCNT_dec_NN(sv);
1994 && !hv_fetch_ent(GvHV(*fields), *svp, FALSE, 0)) {
1995 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1996 "in variable %"SVf" of type %"HEKf,
1997 SVfARG(*svp), SVfARG(lexname),
1998 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
2004 S_scalar_slice_warning(aTHX_ o);
2008 if (cPMOPo->op_pmreplrootu.op_pmreplroot)
2009 finalize_op(cPMOPo->op_pmreplrootu.op_pmreplroot);
2016 if (o->op_flags & OPf_KIDS) {
2018 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
2024 =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
2026 Propagate lvalue ("modifiable") context to an op and its children.
2027 I<type> represents the context type, roughly based on the type of op that
2028 would do the modifying, although C<local()> is represented by OP_NULL,
2029 because it has no op type of its own (it is signalled by a flag on
2032 This function detects things that can't be modified, such as C<$x+1>, and
2033 generates errors for them. For example, C<$x+1 = 2> would cause it to be
2034 called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN.
2036 It also flags things that need to behave specially in an lvalue context,
2037 such as C<$$x = 5> which might have to vivify a reference in C<$x>.
2043 Perl_op_lvalue_flags(pTHX_ OP *o, I32 type, U32 flags)
2047 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
2050 if (!o || (PL_parser && PL_parser->error_count))
2053 if ((o->op_private & OPpTARGET_MY)
2054 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
2059 assert( (o->op_flags & OPf_WANT) != OPf_WANT_VOID );
2061 if (type == OP_PRTF || type == OP_SPRINTF) type = OP_ENTERSUB;
2063 switch (o->op_type) {
2068 if ((o->op_flags & OPf_PARENS) || PL_madskills)
2072 if ((type == OP_UNDEF || type == OP_REFGEN || type == OP_LOCK) &&
2073 !(o->op_flags & OPf_STACKED)) {
2074 o->op_type = OP_RV2CV; /* entersub => rv2cv */
2075 /* Both ENTERSUB and RV2CV use this bit, but for different pur-
2076 poses, so we need it clear. */
2077 o->op_private &= ~1;
2078 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
2079 assert(cUNOPo->op_first->op_type == OP_NULL);
2080 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
2083 else { /* lvalue subroutine call */
2084 o->op_private |= OPpLVAL_INTRO
2085 |(OPpENTERSUB_INARGS * (type == OP_LEAVESUBLV));
2086 PL_modcount = RETURN_UNLIMITED_NUMBER;
2087 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
2088 /* Potential lvalue context: */
2089 o->op_private |= OPpENTERSUB_INARGS;
2092 else { /* Compile-time error message: */
2093 OP *kid = cUNOPo->op_first;
2096 if (kid->op_type != OP_PUSHMARK) {
2097 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
2099 "panic: unexpected lvalue entersub "
2100 "args: type/targ %ld:%"UVuf,
2101 (long)kid->op_type, (UV)kid->op_targ);
2102 kid = kLISTOP->op_first;
2104 while (kid->op_sibling)
2105 kid = kid->op_sibling;
2106 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
2107 break; /* Postpone until runtime */
2110 kid = kUNOP->op_first;
2111 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
2112 kid = kUNOP->op_first;
2113 if (kid->op_type == OP_NULL)
2115 "Unexpected constant lvalue entersub "
2116 "entry via type/targ %ld:%"UVuf,
2117 (long)kid->op_type, (UV)kid->op_targ);
2118 if (kid->op_type != OP_GV) {
2122 cv = GvCV(kGVOP_gv);
2132 if (flags & OP_LVALUE_NO_CROAK) return NULL;
2133 /* grep, foreach, subcalls, refgen */
2134 if (type == OP_GREPSTART || type == OP_ENTERSUB
2135 || type == OP_REFGEN || type == OP_LEAVESUBLV)
2137 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
2138 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
2140 : (o->op_type == OP_ENTERSUB
2141 ? "non-lvalue subroutine call"
2143 type ? PL_op_desc[type] : "local"));
2157 case OP_RIGHT_SHIFT:
2166 if (!(o->op_flags & OPf_STACKED))
2173 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2174 op_lvalue(kid, type);
2179 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
2180 PL_modcount = RETURN_UNLIMITED_NUMBER;
2181 return o; /* Treat \(@foo) like ordinary list. */
2185 if (scalar_mod_type(o, type))
2187 ref(cUNOPo->op_first, o->op_type);
2194 /* Do not apply the lvsub flag for rv2[ah]v in scalar context. */
2195 if (type == OP_LEAVESUBLV && (
2196 (o->op_type != OP_RV2AV && o->op_type != OP_RV2HV)
2197 || (o->op_flags & OPf_WANT) != OPf_WANT_SCALAR
2199 o->op_private |= OPpMAYBE_LVSUB;
2203 PL_modcount = RETURN_UNLIMITED_NUMBER;
2207 if (type == OP_LEAVESUBLV)
2208 o->op_private |= OPpMAYBE_LVSUB;
2211 PL_hints |= HINT_BLOCK_SCOPE;
2212 if (type == OP_LEAVESUBLV)
2213 o->op_private |= OPpMAYBE_LVSUB;
2217 ref(cUNOPo->op_first, o->op_type);
2221 PL_hints |= HINT_BLOCK_SCOPE;
2230 case OP_AELEMFAST_LEX:
2237 PL_modcount = RETURN_UNLIMITED_NUMBER;
2238 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
2239 return o; /* Treat \(@foo) like ordinary list. */
2240 if (scalar_mod_type(o, type))
2242 if ((o->op_flags & OPf_WANT) != OPf_WANT_SCALAR
2243 && type == OP_LEAVESUBLV)
2244 o->op_private |= OPpMAYBE_LVSUB;
2248 if (!type) /* local() */
2249 Perl_croak(aTHX_ "Can't localize lexical variable %"SVf,
2250 PAD_COMPNAME_SV(o->op_targ));
2259 if (type != OP_SASSIGN && type != OP_LEAVESUBLV)
2263 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
2269 if (type == OP_LEAVESUBLV)
2270 o->op_private |= OPpMAYBE_LVSUB;
2271 if (o->op_flags & OPf_KIDS)
2272 op_lvalue(cBINOPo->op_first->op_sibling, type);
2277 ref(cBINOPo->op_first, o->op_type);
2278 if (type == OP_ENTERSUB &&
2279 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
2280 o->op_private |= OPpLVAL_DEFER;
2281 if (type == OP_LEAVESUBLV)
2282 o->op_private |= OPpMAYBE_LVSUB;
2289 o->op_private |= OPpLVALUE;
2294 if (o->op_flags & OPf_KIDS)
2295 op_lvalue(cLISTOPo->op_last, type);
2300 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
2302 else if (!(o->op_flags & OPf_KIDS))
2304 if (o->op_targ != OP_LIST) {
2305 op_lvalue(cBINOPo->op_first, type);
2311 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2312 /* elements might be in void context because the list is
2313 in scalar context or because they are attribute sub calls */
2314 if ( (kid->op_flags & OPf_WANT) != OPf_WANT_VOID )
2315 op_lvalue(kid, type);
2319 if (type != OP_LEAVESUBLV)
2321 break; /* op_lvalue()ing was handled by ck_return() */
2328 op_lvalue(cLOGOPo->op_first, type);
2329 op_lvalue(cLOGOPo->op_first->op_sibling, type);
2333 /* [20011101.069] File test operators interpret OPf_REF to mean that
2334 their argument is a filehandle; thus \stat(".") should not set
2336 if (type == OP_REFGEN &&
2337 PL_check[o->op_type] == Perl_ck_ftst)
2340 if (type != OP_LEAVESUBLV)
2341 o->op_flags |= OPf_MOD;
2343 if (type == OP_AASSIGN || type == OP_SASSIGN)
2344 o->op_flags |= OPf_SPECIAL|OPf_REF;
2345 else if (!type) { /* local() */
2348 o->op_private |= OPpLVAL_INTRO;
2349 o->op_flags &= ~OPf_SPECIAL;
2350 PL_hints |= HINT_BLOCK_SCOPE;
2355 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
2356 "Useless localization of %s", OP_DESC(o));
2359 else if (type != OP_GREPSTART && type != OP_ENTERSUB
2360 && type != OP_LEAVESUBLV)
2361 o->op_flags |= OPf_REF;
2366 S_scalar_mod_type(const OP *o, I32 type)
2371 if (o && o->op_type == OP_RV2GV)
2395 case OP_RIGHT_SHIFT:
2416 S_is_handle_constructor(const OP *o, I32 numargs)
2418 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
2420 switch (o->op_type) {
2428 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
2441 S_refkids(pTHX_ OP *o, I32 type)
2443 if (o && o->op_flags & OPf_KIDS) {
2445 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2452 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
2457 PERL_ARGS_ASSERT_DOREF;
2459 if (!o || (PL_parser && PL_parser->error_count))
2462 switch (o->op_type) {
2464 if ((type == OP_EXISTS || type == OP_DEFINED) &&
2465 !(o->op_flags & OPf_STACKED)) {
2466 o->op_type = OP_RV2CV; /* entersub => rv2cv */
2467 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
2468 assert(cUNOPo->op_first->op_type == OP_NULL);
2469 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
2470 o->op_flags |= OPf_SPECIAL;
2471 o->op_private &= ~1;
2473 else if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV){
2474 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2475 : type == OP_RV2HV ? OPpDEREF_HV
2477 o->op_flags |= OPf_MOD;
2483 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2484 doref(kid, type, set_op_ref);
2487 if (type == OP_DEFINED)
2488 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2489 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2492 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2493 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2494 : type == OP_RV2HV ? OPpDEREF_HV
2496 o->op_flags |= OPf_MOD;
2503 o->op_flags |= OPf_REF;
2506 if (type == OP_DEFINED)
2507 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2508 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2514 o->op_flags |= OPf_REF;
2519 if (!(o->op_flags & OPf_KIDS) || type == OP_DEFINED)
2521 doref(cBINOPo->op_first, type, set_op_ref);
2525 doref(cBINOPo->op_first, o->op_type, set_op_ref);
2526 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2527 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2528 : type == OP_RV2HV ? OPpDEREF_HV
2530 o->op_flags |= OPf_MOD;
2540 if (!(o->op_flags & OPf_KIDS))
2542 doref(cLISTOPo->op_last, type, set_op_ref);
2552 S_dup_attrlist(pTHX_ OP *o)
2557 PERL_ARGS_ASSERT_DUP_ATTRLIST;
2559 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
2560 * where the first kid is OP_PUSHMARK and the remaining ones
2561 * are OP_CONST. We need to push the OP_CONST values.
2563 if (o->op_type == OP_CONST)
2564 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
2566 else if (o->op_type == OP_NULL)
2570 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
2572 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
2573 if (o->op_type == OP_CONST)
2574 rop = op_append_elem(OP_LIST, rop,
2575 newSVOP(OP_CONST, o->op_flags,
2576 SvREFCNT_inc_NN(cSVOPo->op_sv)));
2583 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs)
2586 SV * const stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2588 PERL_ARGS_ASSERT_APPLY_ATTRS;
2590 /* fake up C<use attributes $pkg,$rv,@attrs> */
2592 #define ATTRSMODULE "attributes"
2593 #define ATTRSMODULE_PM "attributes.pm"
2595 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2596 newSVpvs(ATTRSMODULE),
2598 op_prepend_elem(OP_LIST,
2599 newSVOP(OP_CONST, 0, stashsv),
2600 op_prepend_elem(OP_LIST,
2601 newSVOP(OP_CONST, 0,
2603 dup_attrlist(attrs))));
2607 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2610 OP *pack, *imop, *arg;
2611 SV *meth, *stashsv, **svp;
2613 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2618 assert(target->op_type == OP_PADSV ||
2619 target->op_type == OP_PADHV ||
2620 target->op_type == OP_PADAV);
2622 /* Ensure that attributes.pm is loaded. */
2623 /* Don't force the C<use> if we don't need it. */
2624 svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
2625 if (svp && *svp != &PL_sv_undef)
2626 NOOP; /* already in %INC */
2628 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
2629 newSVpvs(ATTRSMODULE), NULL);
2631 /* Need package name for method call. */
2632 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
2634 /* Build up the real arg-list. */
2635 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2637 arg = newOP(OP_PADSV, 0);
2638 arg->op_targ = target->op_targ;
2639 arg = op_prepend_elem(OP_LIST,
2640 newSVOP(OP_CONST, 0, stashsv),
2641 op_prepend_elem(OP_LIST,
2642 newUNOP(OP_REFGEN, 0,
2643 op_lvalue(arg, OP_REFGEN)),
2644 dup_attrlist(attrs)));
2646 /* Fake up a method call to import */
2647 meth = newSVpvs_share("import");
2648 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2649 op_append_elem(OP_LIST,
2650 op_prepend_elem(OP_LIST, pack, list(arg)),
2651 newSVOP(OP_METHOD_NAMED, 0, meth)));
2653 /* Combine the ops. */
2654 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
2658 =notfor apidoc apply_attrs_string
2660 Attempts to apply a list of attributes specified by the C<attrstr> and
2661 C<len> arguments to the subroutine identified by the C<cv> argument which
2662 is expected to be associated with the package identified by the C<stashpv>
2663 argument (see L<attributes>). It gets this wrong, though, in that it
2664 does not correctly identify the boundaries of the individual attribute
2665 specifications within C<attrstr>. This is not really intended for the
2666 public API, but has to be listed here for systems such as AIX which
2667 need an explicit export list for symbols. (It's called from XS code
2668 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2669 to respect attribute syntax properly would be welcome.
2675 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2676 const char *attrstr, STRLEN len)
2680 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2683 len = strlen(attrstr);
2687 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2689 const char * const sstr = attrstr;
2690 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2691 attrs = op_append_elem(OP_LIST, attrs,
2692 newSVOP(OP_CONST, 0,
2693 newSVpvn(sstr, attrstr-sstr)));
2697 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2698 newSVpvs(ATTRSMODULE),
2699 NULL, op_prepend_elem(OP_LIST,
2700 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2701 op_prepend_elem(OP_LIST,
2702 newSVOP(OP_CONST, 0,
2703 newRV(MUTABLE_SV(cv))),
2708 S_move_proto_attr(pTHX_ OP **proto, OP **attrs, const GV * name)
2710 OP *new_proto = NULL;
2715 PERL_ARGS_ASSERT_MOVE_PROTO_ATTR;
2721 if (o->op_type == OP_CONST) {
2722 pv = SvPV(cSVOPo_sv, pvlen);
2723 if (pvlen >= 10 && memEQ(pv, "prototype(", 10)) {
2724 SV * const tmpsv = newSVpvn_flags(pv + 10, pvlen - 11, SvUTF8(cSVOPo_sv));
2725 SV ** const tmpo = cSVOPx_svp(o);
2726 SvREFCNT_dec(cSVOPo_sv);
2731 } else if (o->op_type == OP_LIST) {
2733 assert(o->op_flags & OPf_KIDS);
2734 assert(cLISTOPo->op_first->op_type == OP_PUSHMARK);
2735 /* Counting on the first op to hit the lasto = o line */
2736 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
2737 if (o->op_type == OP_CONST) {
2738 pv = SvPV(cSVOPo_sv, pvlen);
2739 if (pvlen >= 10 && memEQ(pv, "prototype(", 10)) {
2740 SV * const tmpsv = newSVpvn_flags(pv + 10, pvlen - 11, SvUTF8(cSVOPo_sv));
2741 SV ** const tmpo = cSVOPx_svp(o);
2742 SvREFCNT_dec(cSVOPo_sv);
2744 if (new_proto && ckWARN(WARN_MISC)) {
2746 const char * newp = SvPV(cSVOPo_sv, new_len);
2747 Perl_warner(aTHX_ packWARN(WARN_MISC),
2748 "Attribute prototype(%"UTF8f") discards earlier prototype attribute in same sub",
2749 UTF8fARG(SvUTF8(cSVOPo_sv), new_len, newp));
2755 lasto->op_sibling = o->op_sibling;
2761 /* If the list is now just the PUSHMARK, scrap the whole thing; otherwise attributes.xs
2762 would get pulled in with no real need */
2763 if (!cLISTOPx(*attrs)->op_first->op_sibling) {
2772 svname = sv_newmortal();
2773 gv_efullname3(svname, name, NULL);
2775 else if (SvPOK(name) && *SvPVX((SV *)name) == '&')
2776 svname = newSVpvn_flags(SvPVX((SV *)name)+1, SvCUR(name)-1, SvUTF8(name)|SVs_TEMP);
2778 svname = (SV *)name;
2779 if (ckWARN(WARN_ILLEGALPROTO))
2780 (void)validate_proto(svname, cSVOPx_sv(new_proto), TRUE);
2781 if (*proto && ckWARN(WARN_PROTOTYPE)) {
2782 STRLEN old_len, new_len;
2783 const char * oldp = SvPV(cSVOPx_sv(*proto), old_len);
2784 const char * newp = SvPV(cSVOPx_sv(new_proto), new_len);
2786 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
2787 "Prototype '%"UTF8f"' overridden by attribute 'prototype(%"UTF8f")'"
2789 UTF8fARG(SvUTF8(cSVOPx_sv(*proto)), old_len, oldp),
2790 UTF8fARG(SvUTF8(cSVOPx_sv(new_proto)), new_len, newp),
2800 S_cant_declare(pTHX_ OP *o)
2802 if (o->op_type == OP_NULL
2803 && (o->op_flags & (OPf_SPECIAL|OPf_KIDS)) == OPf_KIDS)
2804 o = cUNOPo->op_first;
2805 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2806 o->op_type == OP_NULL
2807 && o->op_flags & OPf_SPECIAL
2810 PL_parser->in_my == KEY_our ? "our" :
2811 PL_parser->in_my == KEY_state ? "state" :
2816 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2820 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
2822 PERL_ARGS_ASSERT_MY_KID;
2824 if (!o || (PL_parser && PL_parser->error_count))
2828 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2829 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2833 if (type == OP_LIST) {
2835 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2836 my_kid(kid, attrs, imopsp);
2838 } else if (type == OP_UNDEF || type == OP_STUB) {
2840 } else if (type == OP_RV2SV || /* "our" declaration */
2842 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2843 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2844 S_cant_declare(aTHX_ o);
2846 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2847 PL_parser->in_my = FALSE;
2848 PL_parser->in_my_stash = NULL;
2849 apply_attrs(GvSTASH(gv),
2850 (type == OP_RV2SV ? GvSV(gv) :
2851 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2852 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2855 o->op_private |= OPpOUR_INTRO;
2858 else if (type != OP_PADSV &&
2861 type != OP_PUSHMARK)
2863 S_cant_declare(aTHX_ o);
2866 else if (attrs && type != OP_PUSHMARK) {
2869 PL_parser->in_my = FALSE;
2870 PL_parser->in_my_stash = NULL;
2872 /* check for C<my Dog $spot> when deciding package */
2873 stash = PAD_COMPNAME_TYPE(o->op_targ);
2875 stash = PL_curstash;
2876 apply_attrs_my(stash, o, attrs, imopsp);
2878 o->op_flags |= OPf_MOD;
2879 o->op_private |= OPpLVAL_INTRO;
2881 o->op_private |= OPpPAD_STATE;
2886 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2890 int maybe_scalar = 0;
2892 PERL_ARGS_ASSERT_MY_ATTRS;
2894 /* [perl #17376]: this appears to be premature, and results in code such as
2895 C< our(%x); > executing in list mode rather than void mode */
2897 if (o->op_flags & OPf_PARENS)
2907 o = my_kid(o, attrs, &rops);
2909 if (maybe_scalar && o->op_type == OP_PADSV) {
2910 o = scalar(op_append_list(OP_LIST, rops, o));
2911 o->op_private |= OPpLVAL_INTRO;
2914 /* The listop in rops might have a pushmark at the beginning,
2915 which will mess up list assignment. */
2916 LISTOP * const lrops = (LISTOP *)rops; /* for brevity */
2917 if (rops->op_type == OP_LIST &&
2918 lrops->op_first && lrops->op_first->op_type == OP_PUSHMARK)
2920 OP * const pushmark = lrops->op_first;
2921 lrops->op_first = pushmark->op_sibling;
2924 o = op_append_list(OP_LIST, o, rops);
2927 PL_parser->in_my = FALSE;
2928 PL_parser->in_my_stash = NULL;
2933 Perl_sawparens(pTHX_ OP *o)
2935 PERL_UNUSED_CONTEXT;
2937 o->op_flags |= OPf_PARENS;
2942 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2946 const OPCODE ltype = left->op_type;
2947 const OPCODE rtype = right->op_type;
2949 PERL_ARGS_ASSERT_BIND_MATCH;
2951 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2952 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2954 const char * const desc
2956 rtype == OP_SUBST || rtype == OP_TRANS
2957 || rtype == OP_TRANSR
2959 ? (int)rtype : OP_MATCH];
2960 const bool isary = ltype == OP_RV2AV || ltype == OP_PADAV;
2962 S_op_varname(aTHX_ left);
2964 Perl_warner(aTHX_ packWARN(WARN_MISC),
2965 "Applying %s to %"SVf" will act on scalar(%"SVf")",
2968 const char * const sample = (isary
2969 ? "@array" : "%hash");
2970 Perl_warner(aTHX_ packWARN(WARN_MISC),
2971 "Applying %s to %s will act on scalar(%s)",
2972 desc, sample, sample);
2976 if (rtype == OP_CONST &&
2977 cSVOPx(right)->op_private & OPpCONST_BARE &&
2978 cSVOPx(right)->op_private & OPpCONST_STRICT)
2980 no_bareword_allowed(right);
2983 /* !~ doesn't make sense with /r, so error on it for now */
2984 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2986 /* diag_listed_as: Using !~ with %s doesn't make sense */
2987 yyerror("Using !~ with s///r doesn't make sense");
2988 if (rtype == OP_TRANSR && type == OP_NOT)
2989 /* diag_listed_as: Using !~ with %s doesn't make sense */
2990 yyerror("Using !~ with tr///r doesn't make sense");
2992 ismatchop = (rtype == OP_MATCH ||
2993 rtype == OP_SUBST ||
2994 rtype == OP_TRANS || rtype == OP_TRANSR)
2995 && !(right->op_flags & OPf_SPECIAL);
2996 if (ismatchop && right->op_private & OPpTARGET_MY) {
2998 right->op_private &= ~OPpTARGET_MY;
3000 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
3003 right->op_flags |= OPf_STACKED;
3004 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
3005 ! (rtype == OP_TRANS &&
3006 right->op_private & OPpTRANS_IDENTICAL) &&
3007 ! (rtype == OP_SUBST &&
3008 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
3009 newleft = op_lvalue(left, rtype);
3012 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
3013 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
3015 o = op_prepend_elem(rtype, scalar(newleft), right);
3017 return newUNOP(OP_NOT, 0, scalar(o));
3021 return bind_match(type, left,
3022 pmruntime(newPMOP(OP_MATCH, 0), right, 0, 0));
3026 Perl_invert(pTHX_ OP *o)
3030 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
3034 =for apidoc Amx|OP *|op_scope|OP *o
3036 Wraps up an op tree with some additional ops so that at runtime a dynamic
3037 scope will be created. The original ops run in the new dynamic scope,
3038 and then, provided that they exit normally, the scope will be unwound.
3039 The additional ops used to create and unwind the dynamic scope will
3040 normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
3041 instead if the ops are simple enough to not need the full dynamic scope
3048 Perl_op_scope(pTHX_ OP *o)
3052 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || TAINTING_get) {
3053 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
3054 o->op_type = OP_LEAVE;
3055 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
3057 else if (o->op_type == OP_LINESEQ) {
3059 o->op_type = OP_SCOPE;
3060 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
3061 kid = ((LISTOP*)o)->op_first;
3062 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
3065 /* The following deals with things like 'do {1 for 1}' */
3066 kid = kid->op_sibling;
3068 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
3073 o = newLISTOP(OP_SCOPE, 0, o, NULL);
3079 Perl_op_unscope(pTHX_ OP *o)
3081 if (o && o->op_type == OP_LINESEQ) {
3082 OP *kid = cLISTOPo->op_first;
3083 for(; kid; kid = kid->op_sibling)
3084 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE)
3091 Perl_block_start(pTHX_ int full)
3094 const int retval = PL_savestack_ix;
3096 pad_block_start(full);
3098 PL_hints &= ~HINT_BLOCK_SCOPE;
3099 SAVECOMPILEWARNINGS();
3100 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
3102 CALL_BLOCK_HOOKS(bhk_start, full);
3108 Perl_block_end(pTHX_ I32 floor, OP *seq)
3111 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
3112 OP* retval = scalarseq(seq);
3115 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
3119 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
3123 /* pad_leavemy has created a sequence of introcv ops for all my
3124 subs declared in the block. We have to replicate that list with
3125 clonecv ops, to deal with this situation:
3130 sub s1 { state sub foo { \&s2 } }
3133 Originally, I was going to have introcv clone the CV and turn
3134 off the stale flag. Since &s1 is declared before &s2, the
3135 introcv op for &s1 is executed (on sub entry) before the one for
3136 &s2. But the &foo sub inside &s1 (which is cloned when &s1 is
3137 cloned, since it is a state sub) closes over &s2 and expects
3138 to see it in its outer CV’s pad. If the introcv op clones &s1,
3139 then &s2 is still marked stale. Since &s1 is not active, and
3140 &foo closes over &s1’s implicit entry for &s2, we get a ‘Varia-
3141 ble will not stay shared’ warning. Because it is the same stub
3142 that will be used when the introcv op for &s2 is executed, clos-
3143 ing over it is safe. Hence, we have to turn off the stale flag
3144 on all lexical subs in the block before we clone any of them.
3145 Hence, having introcv clone the sub cannot work. So we create a
3146 list of ops like this:
3170 OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : o;
3171 OP * const last = o->op_flags & OPf_KIDS ? cLISTOPo->op_last : o;
3172 for (;; kid = kid->op_sibling) {
3173 OP *newkid = newOP(OP_CLONECV, 0);
3174 newkid->op_targ = kid->op_targ;
3175 o = op_append_elem(OP_LINESEQ, o, newkid);
3176 if (kid == last) break;
3178 retval = op_prepend_elem(OP_LINESEQ, o, retval);
3181 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
3187 =head1 Compile-time scope hooks
3189 =for apidoc Aox||blockhook_register
3191 Register a set of hooks to be called when the Perl lexical scope changes
3192 at compile time. See L<perlguts/"Compile-time scope hooks">.
3198 Perl_blockhook_register(pTHX_ BHK *hk)
3200 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
3202 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
3209 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
3210 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
3211 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
3214 OP * const o = newOP(OP_PADSV, 0);
3215 o->op_targ = offset;
3221 Perl_newPROG(pTHX_ OP *o)
3225 PERL_ARGS_ASSERT_NEWPROG;
3232 PL_eval_root = newUNOP(OP_LEAVEEVAL,
3233 ((PL_in_eval & EVAL_KEEPERR)
3234 ? OPf_SPECIAL : 0), o);
3236 cx = &cxstack[cxstack_ix];
3237 assert(CxTYPE(cx) == CXt_EVAL);
3239 if ((cx->blk_gimme & G_WANT) == G_VOID)
3240 scalarvoid(PL_eval_root);
3241 else if ((cx->blk_gimme & G_WANT) == G_ARRAY)
3244 scalar(PL_eval_root);
3246 PL_eval_start = op_linklist(PL_eval_root);
3247 PL_eval_root->op_private |= OPpREFCOUNTED;
3248 OpREFCNT_set(PL_eval_root, 1);
3249 PL_eval_root->op_next = 0;
3250 i = PL_savestack_ix;
3253 CALL_PEEP(PL_eval_start);
3254 finalize_optree(PL_eval_root);
3256 PL_savestack_ix = i;
3259 if (o->op_type == OP_STUB) {
3260 /* This block is entered if nothing is compiled for the main
3261 program. This will be the case for an genuinely empty main
3262 program, or one which only has BEGIN blocks etc, so already
3265 Historically (5.000) the guard above was !o. However, commit
3266 f8a08f7b8bd67b28 (Jun 2001), integrated to blead as
3267 c71fccf11fde0068, changed perly.y so that newPROG() is now
3268 called with the output of block_end(), which returns a new
3269 OP_STUB for the case of an empty optree. ByteLoader (and
3270 maybe other things) also take this path, because they set up
3271 PL_main_start and PL_main_root directly, without generating an
3274 If the parsing the main program aborts (due to parse errors,
3275 or due to BEGIN or similar calling exit), then newPROG()
3276 isn't even called, and hence this code path and its cleanups
3277 are skipped. This shouldn't make a make a difference:
3278 * a non-zero return from perl_parse is a failure, and
3279 perl_destruct() should be called immediately.
3280 * however, if exit(0) is called during the parse, then
3281 perl_parse() returns 0, and perl_run() is called. As
3282 PL_main_start will be NULL, perl_run() will return
3283 promptly, and the exit code will remain 0.
3286 PL_comppad_name = 0;
3288 S_op_destroy(aTHX_ o);
3291 PL_main_root = op_scope(sawparens(scalarvoid(o)));
3292 PL_curcop = &PL_compiling;
3293 PL_main_start = LINKLIST(PL_main_root);
3294 PL_main_root->op_private |= OPpREFCOUNTED;
3295 OpREFCNT_set(PL_main_root, 1);
3296 PL_main_root->op_next = 0;
3297 CALL_PEEP(PL_main_start);
3298 finalize_optree(PL_main_root);
3299 cv_forget_slab(PL_compcv);
3302 /* Register with debugger */
3304 CV * const cv = get_cvs("DB::postponed", 0);
3308 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
3310 call_sv(MUTABLE_SV(cv), G_DISCARD);
3317 Perl_localize(pTHX_ OP *o, I32 lex)
3321 PERL_ARGS_ASSERT_LOCALIZE;
3323 if (o->op_flags & OPf_PARENS)
3324 /* [perl #17376]: this appears to be premature, and results in code such as
3325 C< our(%x); > executing in list mode rather than void mode */
3332 if ( PL_parser->bufptr > PL_parser->oldbufptr
3333 && PL_parser->bufptr[-1] == ','
3334 && ckWARN(WARN_PARENTHESIS))
3336 char *s = PL_parser->bufptr;
3339 /* some heuristics to detect a potential error */
3340 while (*s && (strchr(", \t\n", *s)))
3344 if (*s && strchr("@$%*", *s) && *++s
3345 && (isWORDCHAR(*s) || UTF8_IS_CONTINUED(*s))) {
3348 while (*s && (isWORDCHAR(*s) || UTF8_IS_CONTINUED(*s)))
3350 while (*s && (strchr(", \t\n", *s)))
3356 if (sigil && (*s == ';' || *s == '=')) {
3357 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
3358 "Parentheses missing around \"%s\" list",
3360 ? (PL_parser->in_my == KEY_our
3362 : PL_parser->in_my == KEY_state
3372 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
3373 PL_parser->in_my = FALSE;
3374 PL_parser->in_my_stash = NULL;
3379 Perl_jmaybe(pTHX_ OP *o)
3381 PERL_ARGS_ASSERT_JMAYBE;
3383 if (o->op_type == OP_LIST) {
3385 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
3386 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
3391 PERL_STATIC_INLINE OP *
3392 S_op_std_init(pTHX_ OP *o)
3394 I32 type = o->op_type;
3396 PERL_ARGS_ASSERT_OP_STD_INIT;
3398 if (PL_opargs[type] & OA_RETSCALAR)
3400 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
3401 o->op_targ = pad_alloc(type, SVs_PADTMP);
3406 PERL_STATIC_INLINE OP *
3407 S_op_integerize(pTHX_ OP *o)
3409 I32 type = o->op_type;
3411 PERL_ARGS_ASSERT_OP_INTEGERIZE;
3413 /* integerize op. */
3414 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER))
3417 o->op_ppaddr = PL_ppaddr[++(o->op_type)];
3420 if (type == OP_NEGATE)
3421 /* XXX might want a ck_negate() for this */
3422 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
3428 S_fold_constants(pTHX_ OP *o)
3433 VOL I32 type = o->op_type;
3438 SV * const oldwarnhook = PL_warnhook;
3439 SV * const olddiehook = PL_diehook;
3443 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
3445 if (!(PL_opargs[type] & OA_FOLDCONST))
3460 /* XXX what about the numeric ops? */
3461 if (IN_LOCALE_COMPILETIME)
3465 if (!cLISTOPo->op_first->op_sibling
3466 || cLISTOPo->op_first->op_sibling->op_type != OP_CONST)
3469 SV * const sv = cSVOPx_sv(cLISTOPo->op_first->op_sibling);
3470 if (!SvPOK(sv) || SvGMAGICAL(sv)) goto nope;
3472 const char *s = SvPVX_const(sv);
3473 while (s < SvEND(sv)) {
3474 if (*s == 'p' || *s == 'P') goto nope;
3481 if (o->op_private & OPpREPEAT_DOLIST) goto nope;
3484 if (cUNOPx(cUNOPo->op_first)->op_first->op_type != OP_CONST
3485 || SvPADTMP(cSVOPx_sv(cUNOPx(cUNOPo->op_first)->op_first)))
3489 if (PL_parser && PL_parser->error_count)
3490 goto nope; /* Don't try to run w/ errors */
3492 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3493 const OPCODE type = curop->op_type;
3494 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
3496 type != OP_SCALAR &&
3498 type != OP_PUSHMARK)
3504 curop = LINKLIST(o);
3505 old_next = o->op_next;
3509 oldscope = PL_scopestack_ix;
3510 create_eval_scope(G_FAKINGEVAL);
3512 /* Verify that we don't need to save it: */
3513 assert(PL_curcop == &PL_compiling);
3514 StructCopy(&PL_compiling, ¬_compiling, COP);
3515 PL_curcop = ¬_compiling;
3516 /* The above ensures that we run with all the correct hints of the
3517 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
3518 assert(IN_PERL_RUNTIME);
3519 PL_warnhook = PERL_WARNHOOK_FATAL;
3526 sv = *(PL_stack_sp--);
3527 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
3529 /* Can't simply swipe the SV from the pad, because that relies on
3530 the op being freed "real soon now". Under MAD, this doesn't
3531 happen (see the #ifdef below). */
3534 pad_swipe(o->op_targ, FALSE);
3537 else if (SvTEMP(sv)) { /* grab mortal temp? */
3538 SvREFCNT_inc_simple_void(sv);
3541 else { assert(SvIMMORTAL(sv)); }
3544 /* Something tried to die. Abandon constant folding. */
3545 /* Pretend the error never happened. */
3547 o->op_next = old_next;
3551 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
3552 PL_warnhook = oldwarnhook;
3553 PL_diehook = olddiehook;
3554 /* XXX note that this croak may fail as we've already blown away
3555 * the stack - eg any nested evals */
3556 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
3559 PL_warnhook = oldwarnhook;
3560 PL_diehook = olddiehook;
3561 PL_curcop = &PL_compiling;
3563 if (PL_scopestack_ix > oldscope)
3564 delete_eval_scope();
3573 if (type == OP_STRINGIFY) SvPADTMP_off(sv);
3574 else if (!SvIMMORTAL(sv)) {
3578 if (type == OP_RV2GV)
3579 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
3582 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
3583 if (type != OP_STRINGIFY) newop->op_folded = 1;
3585 op_getmad(o,newop,'f');
3593 S_gen_constant_list(pTHX_ OP *o)
3597 const SSize_t oldtmps_floor = PL_tmps_floor;
3602 if (PL_parser && PL_parser->error_count)
3603 return o; /* Don't attempt to run with errors */
3605 PL_op = curop = LINKLIST(o);
3608 Perl_pp_pushmark(aTHX);
3611 assert (!(curop->op_flags & OPf_SPECIAL));
3612 assert(curop->op_type == OP_RANGE);
3613 Perl_pp_anonlist(aTHX);
3614 PL_tmps_floor = oldtmps_floor;
3616 o->op_type = OP_RV2AV;
3617 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
3618 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
3619 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
3620 o->op_opt = 0; /* needs to be revisited in rpeep() */
3621 curop = ((UNOP*)o)->op_first;
3622 av = (AV *)SvREFCNT_inc_NN(*PL_stack_sp--);
3623 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, (SV *)av);
3624 if (AvFILLp(av) != -1)
3625 for (svp = AvARRAY(av) + AvFILLp(av); svp >= AvARRAY(av); --svp)
3628 SvREADONLY_on(*svp);
3631 op_getmad(curop,o,'O');
3640 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
3643 if (type < 0) type = -type, flags |= OPf_SPECIAL;
3644 if (!o || o->op_type != OP_LIST)
3645 o = newLISTOP(OP_LIST, 0, o, NULL);
3647 o->op_flags &= ~OPf_WANT;
3649 if (!(PL_opargs[type] & OA_MARK))
3650 op_null(cLISTOPo->op_first);
3652 OP * const kid2 = cLISTOPo->op_first->op_sibling;
3653 if (kid2 && kid2->op_type == OP_COREARGS) {
3654 op_null(cLISTOPo->op_first);
3655 kid2->op_private |= OPpCOREARGS_PUSHMARK;
3659 o->op_type = (OPCODE)type;
3660 o->op_ppaddr = PL_ppaddr[type];
3661 o->op_flags |= flags;
3663 o = CHECKOP(type, o);
3664 if (o->op_type != (unsigned)type)
3667 return fold_constants(op_integerize(op_std_init(o)));
3671 =head1 Optree Manipulation Functions
3674 /* List constructors */
3677 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
3679 Append an item to the list of ops contained directly within a list-type
3680 op, returning the lengthened list. I<first> is the list-type op,
3681 and I<last> is the op to append to the list. I<optype> specifies the
3682 intended opcode for the list. If I<first> is not already a list of the
3683 right type, it will be upgraded into one. If either I<first> or I<last>
3684 is null, the other is returned unchanged.
3690 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
3698 if (first->op_type != (unsigned)type
3699 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
3701 return newLISTOP(type, 0, first, last);
3704 if (first->op_flags & OPf_KIDS)
3705 ((LISTOP*)first)->op_last->op_sibling = last;
3707 first->op_flags |= OPf_KIDS;
3708 ((LISTOP*)first)->op_first = last;
3710 ((LISTOP*)first)->op_last = last;
3715 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
3717 Concatenate the lists of ops contained directly within two list-type ops,
3718 returning the combined list. I<first> and I<last> are the list-type ops
3719 to concatenate. I<optype> specifies the intended opcode for the list.
3720 If either I<first> or I<last> is not already a list of the right type,
3721 it will be upgraded into one. If either I<first> or I<last> is null,
3722 the other is returned unchanged.
3728 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
3736 if (first->op_type != (unsigned)type)
3737 return op_prepend_elem(type, first, last);
3739 if (last->op_type != (unsigned)type)
3740 return op_append_elem(type, first, last);
3742 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
3743 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
3744 first->op_flags |= (last->op_flags & OPf_KIDS);
3747 if (((LISTOP*)last)->op_first && first->op_madprop) {
3748 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
3750 while (mp->mad_next)
3752 mp->mad_next = first->op_madprop;
3755 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
3758 first->op_madprop = last->op_madprop;
3759 last->op_madprop = 0;
3762 S_op_destroy(aTHX_ last);
3768 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
3770 Prepend an item to the list of ops contained directly within a list-type
3771 op, returning the lengthened list. I<first> is the op to prepend to the
3772 list, and I<last> is the list-type op. I<optype> specifies the intended
3773 opcode for the list. If I<last> is not already a list of the right type,
3774 it will be upgraded into one. If either I<first> or I<last> is null,
3775 the other is returned unchanged.
3781 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
3789 if (last->op_type == (unsigned)type) {
3790 if (type == OP_LIST) { /* already a PUSHMARK there */
3791 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
3792 ((LISTOP*)last)->op_first->op_sibling = first;
3793 if (!(first->op_flags & OPf_PARENS))
3794 last->op_flags &= ~OPf_PARENS;
3797 if (!(last->op_flags & OPf_KIDS)) {
3798 ((LISTOP*)last)->op_last = first;
3799 last->op_flags |= OPf_KIDS;
3801 first->op_sibling = ((LISTOP*)last)->op_first;
3802 ((LISTOP*)last)->op_first = first;
3804 last->op_flags |= OPf_KIDS;
3808 return newLISTOP(type, 0, first, last);
3816 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
3819 Newxz(tk, 1, TOKEN);
3820 tk->tk_type = (OPCODE)optype;
3821 tk->tk_type = 12345;
3823 tk->tk_mad = madprop;
3828 Perl_token_free(pTHX_ TOKEN* tk)
3830 PERL_ARGS_ASSERT_TOKEN_FREE;
3832 if (tk->tk_type != 12345)
3834 mad_free(tk->tk_mad);
3839 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
3844 PERL_ARGS_ASSERT_TOKEN_GETMAD;
3846 if (tk->tk_type != 12345) {
3847 Perl_warner(aTHX_ packWARN(WARN_MISC),
3848 "Invalid TOKEN object ignored");
3855 /* faked up qw list? */
3857 tm->mad_type == MAD_SV &&
3858 SvPVX((SV *)tm->mad_val)[0] == 'q')
3865 /* pretend constant fold didn't happen? */
3866 if (mp->mad_key == 'f' &&
3867 (o->op_type == OP_CONST ||
3868 o->op_type == OP_GV) )
3870 token_getmad(tk,(OP*)mp->mad_val,slot);
3884 if (mp->mad_key == 'X')
3885 mp->mad_key = slot; /* just change the first one */
3895 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3904 /* pretend constant fold didn't happen? */
3905 if (mp->mad_key == 'f' &&
3906 (o->op_type == OP_CONST ||
3907 o->op_type == OP_GV) )
3909 op_getmad(from,(OP*)mp->mad_val,slot);
3916 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3919 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3925 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3934 /* pretend constant fold didn't happen? */
3935 if (mp->mad_key == 'f' &&
3936 (o->op_type == OP_CONST ||
3937 o->op_type == OP_GV) )
3939 op_getmad(from,(OP*)mp->mad_val,slot);
3946 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3949 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3953 PerlIO_printf(PerlIO_stderr(),
3954 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3960 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3978 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3982 addmad(tm, &(o->op_madprop), slot);
3986 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
4007 Perl_newMADsv(pTHX_ char key, SV* sv)
4009 PERL_ARGS_ASSERT_NEWMADSV;
4011 return newMADPROP(key, MAD_SV, sv, 0);
4015 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
4017 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
4020 mp->mad_vlen = vlen;
4021 mp->mad_type = type;
4023 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
4028 Perl_mad_free(pTHX_ MADPROP* mp)
4030 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
4034 mad_free(mp->mad_next);
4035 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
4036 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
4037 switch (mp->mad_type) {
4041 Safefree(mp->mad_val);
4044 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
4045 op_free((OP*)mp->mad_val);
4048 sv_free(MUTABLE_SV(mp->mad_val));
4051 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
4054 PerlMemShared_free(mp);
4060 =head1 Optree construction
4062 =for apidoc Am|OP *|newNULLLIST
4064 Constructs, checks, and returns a new C<stub> op, which represents an
4065 empty list expression.
4071 Perl_newNULLLIST(pTHX)
4073 return newOP(OP_STUB, 0);
4077 S_force_list(pTHX_ OP *o)
4079 if (!o || o->op_type != OP_LIST)
4080 o = newLISTOP(OP_LIST, 0, o, NULL);
4086 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
4088 Constructs, checks, and returns an op of any list type. I<type> is
4089 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
4090 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
4091 supply up to two ops to be direct children of the list op; they are
4092 consumed by this function and become part of the constructed op tree.
4098 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
4103 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
4105 NewOp(1101, listop, 1, LISTOP);
4107 listop->op_type = (OPCODE)type;
4108 listop->op_ppaddr = PL_ppaddr[type];
4111 listop->op_flags = (U8)flags;
4115 else if (!first && last)
4118 first->op_sibling = last;
4119 listop->op_first = first;
4120 listop->op_last = last;
4121 if (type == OP_LIST) {
4122 OP* const pushop = newOP(OP_PUSHMARK, 0);
4123 pushop->op_sibling = first;
4124 listop->op_first = pushop;
4125 listop->op_flags |= OPf_KIDS;
4127 listop->op_last = pushop;
4130 return CHECKOP(type, listop);
4134 =for apidoc Am|OP *|newOP|I32 type|I32 flags
4136 Constructs, checks, and returns an op of any base type (any type that
4137 has no extra fields). I<type> is the opcode. I<flags> gives the
4138 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
4145 Perl_newOP(pTHX_ I32 type, I32 flags)
4150 if (type == -OP_ENTEREVAL) {
4151 type = OP_ENTEREVAL;
4152 flags |= OPpEVAL_BYTES<<8;
4155 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
4156 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
4157 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
4158 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4160 NewOp(1101, o, 1, OP);
4161 o->op_type = (OPCODE)type;
4162 o->op_ppaddr = PL_ppaddr[type];
4163 o->op_flags = (U8)flags;
4166 o->op_private = (U8)(0 | (flags >> 8));
4167 if (PL_opargs[type] & OA_RETSCALAR)
4169 if (PL_opargs[type] & OA_TARGET)
4170 o->op_targ = pad_alloc(type, SVs_PADTMP);
4171 return CHECKOP(type, o);
4175 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
4177 Constructs, checks, and returns an op of any unary type. I<type> is
4178 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
4179 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
4180 bits, the eight bits of C<op_private>, except that the bit with value 1
4181 is automatically set. I<first> supplies an optional op to be the direct
4182 child of the unary op; it is consumed by this function and become part
4183 of the constructed op tree.
4189 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
4194 if (type == -OP_ENTEREVAL) {
4195 type = OP_ENTEREVAL;
4196 flags |= OPpEVAL_BYTES<<8;
4199 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
4200 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
4201 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
4202 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
4203 || type == OP_SASSIGN
4204 || type == OP_ENTERTRY
4205 || type == OP_NULL );
4208 first = newOP(OP_STUB, 0);
4209 if (PL_opargs[type] & OA_MARK)
4210 first = force_list(first);
4212 NewOp(1101, unop, 1, UNOP);
4213 unop->op_type = (OPCODE)type;
4214 unop->op_ppaddr = PL_ppaddr[type];
4215 unop->op_first = first;
4216 unop->op_flags = (U8)(flags | OPf_KIDS);
4217 unop->op_private = (U8)(1 | (flags >> 8));
4218 unop = (UNOP*) CHECKOP(type, unop);
4222 return fold_constants(op_integerize(op_std_init((OP *) unop)));
4226 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
4228 Constructs, checks, and returns an op of any binary type. I<type>
4229 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
4230 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
4231 the eight bits of C<op_private>, except that the bit with value 1 or
4232 2 is automatically set as required. I<first> and I<last> supply up to
4233 two ops to be the direct children of the binary op; they are consumed
4234 by this function and become part of the constructed op tree.
4240 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
4245 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
4246 || type == OP_SASSIGN || type == OP_NULL );
4248 NewOp(1101, binop, 1, BINOP);
4251 first = newOP(OP_NULL, 0);
4253 binop->op_type = (OPCODE)type;
4254 binop->op_ppaddr = PL_ppaddr[type];
4255 binop->op_first = first;
4256 binop->op_flags = (U8)(flags | OPf_KIDS);
4259 binop->op_private = (U8)(1 | (flags >> 8));
4262 binop->op_private = (U8)(2 | (flags >> 8));
4263 first->op_sibling = last;
4266 binop = (BINOP*)CHECKOP(type, binop);
4267 if (binop->op_next || binop->op_type != (OPCODE)type)
4270 binop->op_last = binop->op_first->op_sibling;
4272 return fold_constants(op_integerize(op_std_init((OP *)binop)));
4275 static int uvcompare(const void *a, const void *b)
4276 __attribute__nonnull__(1)
4277 __attribute__nonnull__(2)
4278 __attribute__pure__;
4279 static int uvcompare(const void *a, const void *b)
4281 if (*((const UV *)a) < (*(const UV *)b))
4283 if (*((const UV *)a) > (*(const UV *)b))
4285 if (*((const UV *)a+1) < (*(const UV *)b+1))
4287 if (*((const UV *)a+1) > (*(const UV *)b+1))
4293 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
4296 SV * const tstr = ((SVOP*)expr)->op_sv;
4299 (repl->op_type == OP_NULL)
4300 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
4302 ((SVOP*)repl)->op_sv;
4305 const U8 *t = (U8*)SvPV_const(tstr, tlen);
4306 const U8 *r = (U8*)SvPV_const(rstr, rlen);
4312 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
4313 const I32 squash = o->op_private & OPpTRANS_SQUASH;
4314 I32 del = o->op_private & OPpTRANS_DELETE;
4317 PERL_ARGS_ASSERT_PMTRANS;
4319 PL_hints |= HINT_BLOCK_SCOPE;
4322 o->op_private |= OPpTRANS_FROM_UTF;
4325 o->op_private |= OPpTRANS_TO_UTF;
4327 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
4328 SV* const listsv = newSVpvs("# comment\n");
4330 const U8* tend = t + tlen;
4331 const U8* rend = r + rlen;
4345 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
4346 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
4349 const U32 flags = UTF8_ALLOW_DEFAULT;
4353 t = tsave = bytes_to_utf8(t, &len);
4356 if (!to_utf && rlen) {
4358 r = rsave = bytes_to_utf8(r, &len);
4362 /* There is a snag with this code on EBCDIC: scan_const() in toke.c has
4363 * encoded chars in native encoding which makes ranges in the EBCDIC 0..255
4367 U8 tmpbuf[UTF8_MAXBYTES+1];
4370 Newx(cp, 2*tlen, UV);
4372 transv = newSVpvs("");
4374 cp[2*i] = utf8n_to_uvchr(t, tend-t, &ulen, flags);
4376 if (t < tend && *t == ILLEGAL_UTF8_BYTE) {
4378 cp[2*i+1] = utf8n_to_uvchr(t, tend-t, &ulen, flags);
4382 cp[2*i+1] = cp[2*i];
4386 qsort(cp, i, 2*sizeof(UV), uvcompare);
4387 for (j = 0; j < i; j++) {
4389 diff = val - nextmin;
4391 t = uvchr_to_utf8(tmpbuf,nextmin);
4392 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4394 U8 range_mark = ILLEGAL_UTF8_BYTE;
4395 t = uvchr_to_utf8(tmpbuf, val - 1);
4396 sv_catpvn(transv, (char *)&range_mark, 1);
4397 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4404 t = uvchr_to_utf8(tmpbuf,nextmin);
4405 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4407 U8 range_mark = ILLEGAL_UTF8_BYTE;
4408 sv_catpvn(transv, (char *)&range_mark, 1);
4410 t = uvchr_to_utf8(tmpbuf, 0x7fffffff);
4411 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
4412 t = (const U8*)SvPVX_const(transv);
4413 tlen = SvCUR(transv);
4417 else if (!rlen && !del) {
4418 r = t; rlen = tlen; rend = tend;
4421 if ((!rlen && !del) || t == r ||
4422 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
4424 o->op_private |= OPpTRANS_IDENTICAL;
4428 while (t < tend || tfirst <= tlast) {
4429 /* see if we need more "t" chars */
4430 if (tfirst > tlast) {
4431 tfirst = (I32)utf8n_to_uvchr(t, tend - t, &ulen, flags);
4433 if (t < tend && *t == ILLEGAL_UTF8_BYTE) { /* illegal utf8 val indicates range */
4435 tlast = (I32)utf8n_to_uvchr(t, tend - t, &ulen, flags);
4442 /* now see if we need more "r" chars */
4443 if (rfirst > rlast) {
4445 rfirst = (I32)utf8n_to_uvchr(r, rend - r, &ulen, flags);
4447 if (r < rend && *r == ILLEGAL_UTF8_BYTE) { /* illegal utf8 val indicates range */
4449 rlast = (I32)utf8n_to_uvchr(r, rend - r, &ulen, flags);
4458 rfirst = rlast = 0xffffffff;
4462 /* now see which range will peter our first, if either. */
4463 tdiff = tlast - tfirst;
4464 rdiff = rlast - rfirst;
4471 if (rfirst == 0xffffffff) {
4472 diff = tdiff; /* oops, pretend rdiff is infinite */
4474 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
4475 (long)tfirst, (long)tlast);
4477 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
4481 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
4482 (long)tfirst, (long)(tfirst + diff),
4485 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
4486 (long)tfirst, (long)rfirst);
4488 if (rfirst + diff > max)
4489 max = rfirst + diff;
4491 grows = (tfirst < rfirst &&
4492 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
4504 else if (max > 0xff)
4509 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
4511 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVf_READONLY);
4512 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
4513 PAD_SETSV(cPADOPo->op_padix, swash);
4515 SvREADONLY_on(swash);
4517 cSVOPo->op_sv = swash;
4519 SvREFCNT_dec(listsv);
4520 SvREFCNT_dec(transv);
4522 if (!del && havefinal && rlen)
4523 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
4524 newSVuv((UV)final), 0);
4527 o->op_private |= OPpTRANS_GROWS;
4533 op_getmad(expr,o,'e');
4534 op_getmad(repl,o,'r');
4542 tbl = (short*)PerlMemShared_calloc(
4543 (o->op_private & OPpTRANS_COMPLEMENT) &&
4544 !(o->op_private & OPpTRANS_DELETE) ? 258 : 256,
4546 cPVOPo->op_pv = (char*)tbl;
4548 for (i = 0; i < (I32)tlen; i++)
4550 for (i = 0, j = 0; i < 256; i++) {
4552 if (j >= (I32)rlen) {
4561 if (i < 128 && r[j] >= 128)
4571 o->op_private |= OPpTRANS_IDENTICAL;
4573 else if (j >= (I32)rlen)
4578 PerlMemShared_realloc(tbl,
4579 (0x101+rlen-j) * sizeof(short));
4580 cPVOPo->op_pv = (char*)tbl;
4582 tbl[0x100] = (short)(rlen - j);
4583 for (i=0; i < (I32)rlen - j; i++)
4584 tbl[0x101+i] = r[j+i];
4588 if (!rlen && !del) {
4591 o->op_private |= OPpTRANS_IDENTICAL;
4593 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
4594 o->op_private |= OPpTRANS_IDENTICAL;
4596 for (i = 0; i < 256; i++)
4598 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
4599 if (j >= (I32)rlen) {
4601 if (tbl[t[i]] == -1)
4607 if (tbl[t[i]] == -1) {
4608 if (t[i] < 128 && r[j] >= 128)
4615 if(del && rlen == tlen) {
4616 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
4617 } else if(rlen > tlen && !complement) {
4618 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
4622 o->op_private |= OPpTRANS_GROWS;
4624 op_getmad(expr,o,'e');
4625 op_getmad(repl,o,'r');
4635 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
4637 Constructs, checks, and returns an op of any pattern matching type.
4638 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
4639 and, shifted up eight bits, the eight bits of C<op_private>.
4645 Perl_newPMOP(pTHX_ I32 type, I32 flags)
4650 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
4652 NewOp(1101, pmop, 1, PMOP);
4653 pmop->op_type = (OPCODE)type;
4654 pmop->op_ppaddr = PL_ppaddr[type];
4655 pmop->op_flags = (U8)flags;
4656 pmop->op_private = (U8)(0 | (flags >> 8));
4658 if (PL_hints & HINT_RE_TAINT)
4659 pmop->op_pmflags |= PMf_RETAINT;
4660 if (IN_LOCALE_COMPILETIME) {
4661 set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET);
4663 else if ((! (PL_hints & HINT_BYTES))
4664 /* Both UNI_8_BIT and locale :not_characters imply Unicode */
4665 && (PL_hints & (HINT_UNI_8_BIT|HINT_LOCALE_NOT_CHARS)))
4667 set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET);
4669 if (PL_hints & HINT_RE_FLAGS) {
4670 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4671 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
4673 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
4674 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4675 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0
4677 if (reflags && SvOK(reflags)) {
4678 set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags));
4684 assert(SvPOK(PL_regex_pad[0]));
4685 if (SvCUR(PL_regex_pad[0])) {
4686 /* Pop off the "packed" IV from the end. */
4687 SV *const repointer_list = PL_regex_pad[0];
4688 const char *p = SvEND(repointer_list) - sizeof(IV);
4689 const IV offset = *((IV*)p);
4691 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
4693 SvEND_set(repointer_list, p);
4695 pmop->op_pmoffset = offset;
4696 /* This slot should be free, so assert this: */
4697 assert(PL_regex_pad[offset] == &PL_sv_undef);
4699 SV * const repointer = &PL_sv_undef;
4700 av_push(PL_regex_padav, repointer);
4701 pmop->op_pmoffset = av_len(PL_regex_padav);
4702 PL_regex_pad = AvARRAY(PL_regex_padav);
4706 return CHECKOP(type, pmop);
4709 /* Given some sort of match op o, and an expression expr containing a
4710 * pattern, either compile expr into a regex and attach it to o (if it's
4711 * constant), or convert expr into a runtime regcomp op sequence (if it's
4714 * isreg indicates that the pattern is part of a regex construct, eg
4715 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
4716 * split "pattern", which aren't. In the former case, expr will be a list
4717 * if the pattern contains more than one term (eg /a$b/) or if it contains
4718 * a replacement, ie s/// or tr///.
4720 * When the pattern has been compiled within a new anon CV (for
4721 * qr/(?{...})/ ), then floor indicates the savestack level just before
4722 * the new sub was created
4726 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg, I32 floor)
4731 I32 repl_has_vars = 0;
4733 bool is_trans = (o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
4734 bool is_compiletime;
4737 PERL_ARGS_ASSERT_PMRUNTIME;
4739 /* for s/// and tr///, last element in list is the replacement; pop it */
4741 if (is_trans || o->op_type == OP_SUBST) {
4743 repl = cLISTOPx(expr)->op_last;
4744 kid = cLISTOPx(expr)->op_first;
4745 while (kid->op_sibling != repl)
4746 kid = kid->op_sibling;
4747 kid->op_sibling = NULL;
4748 cLISTOPx(expr)->op_last = kid;
4751 /* for TRANS, convert LIST/PUSH/CONST into CONST, and pass to pmtrans() */
4754 OP* const oe = expr;
4755 assert(expr->op_type == OP_LIST);
4756 assert(cLISTOPx(expr)->op_first->op_type == OP_PUSHMARK);
4757 assert(cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last);
4758 expr = cLISTOPx(oe)->op_last;
4759 cLISTOPx(oe)->op_first->op_sibling = NULL;
4760 cLISTOPx(oe)->op_last = NULL;
4763 return pmtrans(o, expr, repl);
4766 /* find whether we have any runtime or code elements;
4767 * at the same time, temporarily set the op_next of each DO block;
4768 * then when we LINKLIST, this will cause the DO blocks to be excluded
4769 * from the op_next chain (and from having LINKLIST recursively
4770 * applied to them). We fix up the DOs specially later */
4774 if (expr->op_type == OP_LIST) {
4776 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4777 if (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)) {
4779 assert(!o->op_next && o->op_sibling);
4780 o->op_next = o->op_sibling;
4782 else if (o->op_type != OP_CONST && o->op_type != OP_PUSHMARK)
4786 else if (expr->op_type != OP_CONST)
4791 /* fix up DO blocks; treat each one as a separate little sub;
4792 * also, mark any arrays as LIST/REF */
4794 if (expr->op_type == OP_LIST) {
4796 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4798 if (o->op_type == OP_PADAV || o->op_type == OP_RV2AV) {
4799 assert( !(o->op_flags & OPf_WANT));
4800 /* push the array rather than its contents. The regex
4801 * engine will retrieve and join the elements later */
4802 o->op_flags |= (OPf_WANT_LIST | OPf_REF);
4806 if (!(o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)))
4808 o->op_next = NULL; /* undo temporary hack from above */
4811 if (cLISTOPo->op_first->op_type == OP_LEAVE) {
4812 LISTOP *leaveop = cLISTOPx(cLISTOPo->op_first);
4814 assert(leaveop->op_first->op_type == OP_ENTER);
4815 assert(leaveop->op_first->op_sibling);
4816 o->op_next = leaveop->op_first->op_sibling;
4818 assert(leaveop->op_flags & OPf_KIDS);
4819 assert(leaveop->op_last->op_next == (OP*)leaveop);
4820 leaveop->op_next = NULL; /* stop on last op */
4821 op_null((OP*)leaveop);
4825 OP *scope = cLISTOPo->op_first;
4826 assert(scope->op_type == OP_SCOPE);
4827 assert(scope->op_flags & OPf_KIDS);
4828 scope->op_next = NULL; /* stop on last op */
4831 /* have to peep the DOs individually as we've removed it from
4832 * the op_next chain */
4835 /* runtime finalizes as part of finalizing whole tree */
4839 else if (expr->op_type == OP_PADAV || expr->op_type == OP_RV2AV) {
4840 assert( !(expr->op_flags & OPf_WANT));
4841 /* push the array rather than its contents. The regex
4842 * engine will retrieve and join the elements later */
4843 expr->op_flags |= (OPf_WANT_LIST | OPf_REF);
4846 PL_hints |= HINT_BLOCK_SCOPE;
4848 assert(floor==0 || (pm->op_pmflags & PMf_HAS_CV));
4850 if (is_compiletime) {
4851 U32 rx_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4852 regexp_engine const *eng = current_re_engine();
4854 if (o->op_flags & OPf_SPECIAL)
4855 rx_flags |= RXf_SPLIT;
4857 if (!has_code || !eng->op_comp) {
4858 /* compile-time simple constant pattern */
4860 if ((pm->op_pmflags & PMf_HAS_CV) && !has_code) {
4861 /* whoops! we guessed that a qr// had a code block, but we
4862 * were wrong (e.g. /[(?{}]/ ). Throw away the PL_compcv
4863 * that isn't required now. Note that we have to be pretty
4864 * confident that nothing used that CV's pad while the
4865 * regex was parsed */
4866 assert(AvFILLp(PL_comppad) == 0); /* just @_ */
4867 /* But we know that one op is using this CV's slab. */
4868 cv_forget_slab(PL_compcv);
4870 pm->op_pmflags &= ~PMf_HAS_CV;
4875 ? eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4876 rx_flags, pm->op_pmflags)
4877 : Perl_re_op_compile(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4878 rx_flags, pm->op_pmflags)
4881 op_getmad(expr,(OP*)pm,'e');
4887 /* compile-time pattern that includes literal code blocks */
4888 REGEXP* re = eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4891 ((PL_hints & HINT_RE_EVAL) ? PMf_USE_RE_EVAL : 0))
4894 if (pm->op_pmflags & PMf_HAS_CV) {
4896 /* this QR op (and the anon sub we embed it in) is never
4897 * actually executed. It's just a placeholder where we can
4898 * squirrel away expr in op_code_list without the peephole
4899 * optimiser etc processing it for a second time */
4900 OP *qr = newPMOP(OP_QR, 0);
4901 ((PMOP*)qr)->op_code_list = expr;
4903 /* handle the implicit sub{} wrapped round the qr/(?{..})/ */
4904 SvREFCNT_inc_simple_void(PL_compcv);
4905 cv = newATTRSUB(floor, 0, NULL, NULL, qr);
4906 ReANY(re)->qr_anoncv = cv;
4908 /* attach the anon CV to the pad so that
4909 * pad_fixup_inner_anons() can find it */
4910 (void)pad_add_anon(cv, o->op_type);
4911 SvREFCNT_inc_simple_void(cv);
4914 pm->op_code_list = expr;
4919 /* runtime pattern: build chain of regcomp etc ops */
4921 PADOFFSET cv_targ = 0;
4923 reglist = isreg && expr->op_type == OP_LIST;
4928 pm->op_code_list = expr;
4929 /* don't free op_code_list; its ops are embedded elsewhere too */
4930 pm->op_pmflags |= PMf_CODELIST_PRIVATE;
4933 if (o->op_flags & OPf_SPECIAL)
4934 pm->op_pmflags |= PMf_SPLIT;
4936 /* the OP_REGCMAYBE is a placeholder in the non-threaded case
4937 * to allow its op_next to be pointed past the regcomp and
4938 * preceding stacking ops;
4939 * OP_REGCRESET is there to reset taint before executing the
4941 if (pm->op_pmflags & PMf_KEEP || TAINTING_get)
4942 expr = newUNOP((TAINTING_get ? OP_REGCRESET : OP_REGCMAYBE),0,expr);
4944 if (pm->op_pmflags & PMf_HAS_CV) {
4945 /* we have a runtime qr with literal code. This means
4946 * that the qr// has been wrapped in a new CV, which
4947 * means that runtime consts, vars etc will have been compiled
4948 * against a new pad. So... we need to execute those ops
4949 * within the environment of the new CV. So wrap them in a call
4950 * to a new anon sub. i.e. for
4954 * we build an anon sub that looks like
4956 * sub { "a", $b, '(?{...})' }
4958 * and call it, passing the returned list to regcomp.
4959 * Or to put it another way, the list of ops that get executed
4963 * ------ -------------------
4964 * pushmark (for regcomp)
4965 * pushmark (for entersub)
4966 * pushmark (for refgen)
4970 * regcreset regcreset
4972 * const("a") const("a")
4974 * const("(?{...})") const("(?{...})")
4979 SvREFCNT_inc_simple_void(PL_compcv);
4980 /* these lines are just an unrolled newANONATTRSUB */
4981 expr = newSVOP(OP_ANONCODE, 0,
4982 MUTABLE_SV(newATTRSUB(floor, 0, NULL, NULL, expr)));
4983 cv_targ = expr->op_targ;
4984 expr = newUNOP(OP_REFGEN, 0, expr);
4986 expr = list(force_list(newUNOP(OP_ENTERSUB, 0, scalar(expr))));
4989 NewOp(1101, rcop, 1, LOGOP);
4990 rcop->op_type = OP_REGCOMP;
4991 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
4992 rcop->op_first = scalar(expr);
4993 rcop->op_flags |= OPf_KIDS
4994 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
4995 | (reglist ? OPf_STACKED : 0);
4996 rcop->op_private = 0;
4998 rcop->op_targ = cv_targ;
5000 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
5001 if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1;
5003 /* establish postfix order */
5004 if (expr->op_type == OP_REGCRESET || expr->op_type == OP_REGCMAYBE) {
5006 rcop->op_next = expr;
5007 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
5010 rcop->op_next = LINKLIST(expr);
5011 expr->op_next = (OP*)rcop;
5014 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
5020 /* If we are looking at s//.../e with a single statement, get past
5021 the implicit do{}. */
5022 if (curop->op_type == OP_NULL && curop->op_flags & OPf_KIDS
5023 && cUNOPx(curop)->op_first->op_type == OP_SCOPE
5024 && cUNOPx(curop)->op_first->op_flags & OPf_KIDS) {
5025 OP *kid = cUNOPx(cUNOPx(curop)->op_first)->op_first;
5026 if (kid->op_type == OP_NULL && kid->op_sibling
5027 && !kid->op_sibling->op_sibling)
5028 curop = kid->op_sibling;
5030 if (curop->op_type == OP_CONST)
5032 else if (( (curop->op_type == OP_RV2SV ||
5033 curop->op_type == OP_RV2AV ||
5034 curop->op_type == OP_RV2HV ||
5035 curop->op_type == OP_RV2GV)
5036 && cUNOPx(curop)->op_first
5037 && cUNOPx(curop)->op_first->op_type == OP_GV )
5038 || curop->op_type == OP_PADSV
5039 || curop->op_type == OP_PADAV
5040 || curop->op_type == OP_PADHV
5041 || curop->op_type == OP_PADANY) {
5049 || !RX_PRELEN(PM_GETRE(pm))
5050 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
5052 pm->op_pmflags |= PMf_CONST; /* const for long enough */
5053 op_prepend_elem(o->op_type, scalar(repl), o);
5056 NewOp(1101, rcop, 1, LOGOP);
5057 rcop->op_type = OP_SUBSTCONT;
5058 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
5059 rcop->op_first = scalar(repl);
5060 rcop->op_flags |= OPf_KIDS;
5061 rcop->op_private = 1;
5064 /* establish postfix order */
5065 rcop->op_next = LINKLIST(repl);
5066 repl->op_next = (OP*)rcop;
5068 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
5069 assert(!(pm->op_pmflags & PMf_ONCE));
5070 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
5079 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
5081 Constructs, checks, and returns an op of any type that involves an
5082 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
5083 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
5084 takes ownership of one reference to it.
5090 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
5095 PERL_ARGS_ASSERT_NEWSVOP;
5097 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
5098 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
5099 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
5101 NewOp(1101, svop, 1, SVOP);
5102 svop->op_type = (OPCODE)type;
5103 svop->op_ppaddr = PL_ppaddr[type];
5105 svop->op_next = (OP*)svop;
5106 svop->op_flags = (U8)flags;
5107 svop->op_private = (U8)(0 | (flags >> 8));
5108 if (PL_opargs[type] & OA_RETSCALAR)
5110 if (PL_opargs[type] & OA_TARGET)
5111 svop->op_targ = pad_alloc(type, SVs_PADTMP);
5112 return CHECKOP(type, svop);
5118 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
5120 Constructs, checks, and returns an op of any type that involves a
5121 reference to a pad element. I<type> is the opcode. I<flags> gives the
5122 eight bits of C<op_flags>. A pad slot is automatically allocated, and
5123 is populated with I<sv>; this function takes ownership of one reference
5126 This function only exists if Perl has been compiled to use ithreads.
5132 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
5137 PERL_ARGS_ASSERT_NEWPADOP;
5139 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
5140 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
5141 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
5143 NewOp(1101, padop, 1, PADOP);
5144 padop->op_type = (OPCODE)type;
5145 padop->op_ppaddr = PL_ppaddr[type];
5146 padop->op_padix = pad_alloc(type, SVs_PADTMP);
5147 SvREFCNT_dec(PAD_SVl(padop->op_padix));
5148 PAD_SETSV(padop->op_padix, sv);
5151 padop->op_next = (OP*)padop;
5152 padop->op_flags = (U8)flags;
5153 if (PL_opargs[type] & OA_RETSCALAR)
5155 if (PL_opargs[type] & OA_TARGET)
5156 padop->op_targ = pad_alloc(type, SVs_PADTMP);
5157 return CHECKOP(type, padop);
5160 #endif /* USE_ITHREADS */
5163 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
5165 Constructs, checks, and returns an op of any type that involves an
5166 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
5167 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
5168 reference; calling this function does not transfer ownership of any
5175 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
5179 PERL_ARGS_ASSERT_NEWGVOP;
5183 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
5185 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
5190 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
5192 Constructs, checks, and returns an op of any type that involves an
5193 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
5194 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
5195 must have been allocated using C<PerlMemShared_malloc>; the memory will
5196 be freed when the op is destroyed.
5202 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
5205 const bool utf8 = cBOOL(flags & SVf_UTF8);
5210 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
5212 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
5214 NewOp(1101, pvop, 1, PVOP);
5215 pvop->op_type = (OPCODE)type;
5216 pvop->op_ppaddr = PL_ppaddr[type];
5218 pvop->op_next = (OP*)pvop;
5219 pvop->op_flags = (U8)flags;
5220 pvop->op_private = utf8 ? OPpPV_IS_UTF8 : 0;
5221 if (PL_opargs[type] & OA_RETSCALAR)
5223 if (PL_opargs[type] & OA_TARGET)
5224 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
5225 return CHECKOP(type, pvop);
5233 Perl_package(pTHX_ OP *o)
5236 SV *const sv = cSVOPo->op_sv;
5241 PERL_ARGS_ASSERT_PACKAGE;
5243 SAVEGENERICSV(PL_curstash);
5244 save_item(PL_curstname);
5246 PL_curstash = (HV *)SvREFCNT_inc(gv_stashsv(sv, GV_ADD));
5248 sv_setsv(PL_curstname, sv);
5250 PL_hints |= HINT_BLOCK_SCOPE;
5251 PL_parser->copline = NOLINE;
5252 PL_parser->expect = XSTATE;
5257 if (!PL_madskills) {
5262 pegop = newOP(OP_NULL,0);
5263 op_getmad(o,pegop,'P');
5269 Perl_package_version( pTHX_ OP *v )
5272 U32 savehints = PL_hints;
5273 PERL_ARGS_ASSERT_PACKAGE_VERSION;
5274 PL_hints &= ~HINT_STRICT_VARS;
5275 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
5276 PL_hints = savehints;
5285 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
5292 OP *pegop = PL_madskills ? newOP(OP_NULL,0) : NULL;
5294 SV *use_version = NULL;
5296 PERL_ARGS_ASSERT_UTILIZE;
5298 if (idop->op_type != OP_CONST)
5299 Perl_croak(aTHX_ "Module name must be constant");
5302 op_getmad(idop,pegop,'U');
5307 SV * const vesv = ((SVOP*)version)->op_sv;
5310 op_getmad(version,pegop,'V');
5311 if (!arg && !SvNIOKp(vesv)) {
5318 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
5319 Perl_croak(aTHX_ "Version number must be a constant number");
5321 /* Make copy of idop so we don't free it twice */
5322 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5324 /* Fake up a method call to VERSION */
5325 meth = newSVpvs_share("VERSION");
5326 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5327 op_append_elem(OP_LIST,
5328 op_prepend_elem(OP_LIST, pack, list(version)),
5329 newSVOP(OP_METHOD_NAMED, 0, meth)));
5333 /* Fake up an import/unimport */
5334 if (arg && arg->op_type == OP_STUB) {
5336 op_getmad(arg,pegop,'S');
5337 imop = arg; /* no import on explicit () */
5339 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
5340 imop = NULL; /* use 5.0; */
5342 use_version = ((SVOP*)idop)->op_sv;
5344 idop->op_private |= OPpCONST_NOVER;
5350 op_getmad(arg,pegop,'A');
5352 /* Make copy of idop so we don't free it twice */
5353 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
5355 /* Fake up a method call to import/unimport */
5357 ? newSVpvs_share("import") : newSVpvs_share("unimport");
5358 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
5359 op_append_elem(OP_LIST,
5360 op_prepend_elem(OP_LIST, pack, list(arg)),
5361 newSVOP(OP_METHOD_NAMED, 0, meth)));
5364 /* Fake up the BEGIN {}, which does its thing immediately. */
5366 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
5369 op_append_elem(OP_LINESEQ,
5370 op_append_elem(OP_LINESEQ,
5371 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
5372 newSTATEOP(0, NULL, veop)),
5373 newSTATEOP(0, NULL, imop) ));
5377 * feature bundle that corresponds to the required version. */
5378 use_version = sv_2mortal(new_version(use_version));
5379 S_enable_feature_bundle(aTHX_ use_version);
5381 /* If a version >= 5.11.0 is requested, strictures are on by default! */
5382 if (vcmp(use_version,
5383 sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) {
5384 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5385 PL_hints |= HINT_STRICT_REFS;
5386 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5387 PL_hints |= HINT_STRICT_SUBS;
5388 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5389 PL_hints |= HINT_STRICT_VARS;
5391 /* otherwise they are off */
5393 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
5394 PL_hints &= ~HINT_STRICT_REFS;
5395 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
5396 PL_hints &= ~HINT_STRICT_SUBS;
5397 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
5398 PL_hints &= ~HINT_STRICT_VARS;
5402 /* The "did you use incorrect case?" warning used to be here.
5403 * The problem is that on case-insensitive filesystems one
5404 * might get false positives for "use" (and "require"):
5405 * "use Strict" or "require CARP" will work. This causes
5406 * portability problems for the script: in case-strict
5407 * filesystems the script will stop working.
5409 * The "incorrect case" warning checked whether "use Foo"
5410 * imported "Foo" to your namespace, but that is wrong, too:
5411 * there is no requirement nor promise in the language that
5412 * a Foo.pm should or would contain anything in package "Foo".
5414 * There is very little Configure-wise that can be done, either:
5415 * the case-sensitivity of the build filesystem of Perl does not
5416 * help in guessing the case-sensitivity of the runtime environment.
5419 PL_hints |= HINT_BLOCK_SCOPE;
5420 PL_parser->copline = NOLINE;
5421 PL_parser->expect = XSTATE;
5422 PL_cop_seqmax++; /* Purely for B::*'s benefit */
5423 if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */
5432 =head1 Embedding Functions
5434 =for apidoc load_module
5436 Loads the module whose name is pointed to by the string part of name.
5437 Note that the actual module name, not its filename, should be given.
5438 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
5439 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
5440 (or 0 for no flags). ver, if specified and not NULL, provides version semantics
5441 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
5442 arguments can be used to specify arguments to the module's import()
5443 method, similar to C<use Foo::Bar VERSION LIST>. They must be
5444 terminated with a final NULL pointer. Note that this list can only
5445 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
5446 Otherwise at least a single NULL pointer to designate the default
5447 import list is required.
5449 The reference count for each specified C<SV*> parameter is decremented.
5454 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
5458 PERL_ARGS_ASSERT_LOAD_MODULE;
5460 va_start(args, ver);
5461 vload_module(flags, name, ver, &args);
5465 #ifdef PERL_IMPLICIT_CONTEXT
5467 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
5471 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
5472 va_start(args, ver);
5473 vload_module(flags, name, ver, &args);
5479 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
5483 OP * const modname = newSVOP(OP_CONST, 0, name);
5485 PERL_ARGS_ASSERT_VLOAD_MODULE;
5487 modname->op_private |= OPpCONST_BARE;
5489 veop = newSVOP(OP_CONST, 0, ver);
5493 if (flags & PERL_LOADMOD_NOIMPORT) {
5494 imop = sawparens(newNULLLIST());
5496 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
5497 imop = va_arg(*args, OP*);
5502 sv = va_arg(*args, SV*);
5504 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
5505 sv = va_arg(*args, SV*);
5509 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
5510 * that it has a PL_parser to play with while doing that, and also
5511 * that it doesn't mess with any existing parser, by creating a tmp
5512 * new parser with lex_start(). This won't actually be used for much,
5513 * since pp_require() will create another parser for the real work.
5514 * The ENTER/LEAVE pair protect callers from any side effects of use. */
5517 SAVEVPTR(PL_curcop);
5518 lex_start(NULL, NULL, LEX_START_SAME_FILTER);
5519 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
5520 veop, modname, imop);
5524 PERL_STATIC_INLINE OP *
5525 S_new_entersubop(pTHX_ GV *gv, OP *arg)
5527 return newUNOP(OP_ENTERSUB, OPf_STACKED,
5528 newLISTOP(OP_LIST, 0, arg,
5529 newUNOP(OP_RV2CV, 0,
5530 newGVOP(OP_GV, 0, gv))));
5534 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
5540 PERL_ARGS_ASSERT_DOFILE;
5542 if (!force_builtin && (gv = gv_override("do", 2))) {
5543 doop = S_new_entersubop(aTHX_ gv, term);
5546 doop = newUNOP(OP_DOFILE, 0, scalar(term));
5552 =head1 Optree construction
5554 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
5556 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
5557 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
5558 be set automatically, and, shifted up eight bits, the eight bits of
5559 C<op_private>, except that the bit with value 1 or 2 is automatically
5560 set as required. I<listval> and I<subscript> supply the parameters of
5561 the slice; they are consumed by this function and become part of the
5562 constructed op tree.
5568 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
5570 return newBINOP(OP_LSLICE, flags,
5571 list(force_list(subscript)),
5572 list(force_list(listval)) );
5576 S_is_list_assignment(pTHX_ const OP *o)
5584 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
5585 o = cUNOPo->op_first;
5587 flags = o->op_flags;
5589 if (type == OP_COND_EXPR) {
5590 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
5591 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
5596 yyerror("Assignment to both a list and a scalar");
5600 if (type == OP_LIST &&
5601 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
5602 o->op_private & OPpLVAL_INTRO)
5605 if (type == OP_LIST || flags & OPf_PARENS ||
5606 type == OP_RV2AV || type == OP_RV2HV ||
5607 type == OP_ASLICE || type == OP_HSLICE ||
5608 type == OP_KVASLICE || type == OP_KVHSLICE)
5611 if (type == OP_PADAV || type == OP_PADHV)
5614 if (type == OP_RV2SV)
5621 Helper function for newASSIGNOP to detection commonality between the
5622 lhs and the rhs. Marks all variables with PL_generation. If it
5623 returns TRUE the assignment must be able to handle common variables.
5625 PERL_STATIC_INLINE bool
5626 S_aassign_common_vars(pTHX_ OP* o)
5629 for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) {
5630 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
5631 if (curop->op_type == OP_GV) {
5632 GV *gv = cGVOPx_gv(curop);
5634 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5636 GvASSIGN_GENERATION_set(gv, PL_generation);
5638 else if (curop->op_type == OP_PADSV ||
5639 curop->op_type == OP_PADAV ||
5640 curop->op_type == OP_PADHV ||
5641 curop->op_type == OP_PADANY)
5643 if (PAD_COMPNAME_GEN(curop->op_targ)
5644 == (STRLEN)PL_generation)
5646 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
5649 else if (curop->op_type == OP_RV2CV)
5651 else if (curop->op_type == OP_RV2SV ||
5652 curop->op_type == OP_RV2AV ||
5653 curop->op_type == OP_RV2HV ||
5654 curop->op_type == OP_RV2GV) {
5655 if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */
5658 else if (curop->op_type == OP_PUSHRE) {
5661 ((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff
5662 ? MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff))
5665 ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
5669 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5671 GvASSIGN_GENERATION_set(gv, PL_generation);
5678 if (curop->op_flags & OPf_KIDS) {
5679 if (aassign_common_vars(curop))
5687 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
5689 Constructs, checks, and returns an assignment op. I<left> and I<right>
5690 supply the parameters of the assignment; they are consumed by this
5691 function and become part of the constructed op tree.
5693 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
5694 a suitable conditional optree is constructed. If I<optype> is the opcode
5695 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
5696 performs the binary operation and assigns the result to the left argument.
5697 Either way, if I<optype> is non-zero then I<flags> has no effect.
5699 If I<optype> is zero, then a plain scalar or list assignment is
5700 constructed. Which type of assignment it is is automatically determined.
5701 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5702 will be set automatically, and, shifted up eight bits, the eight bits
5703 of C<op_private>, except that the bit with value 1 or 2 is automatically
5710 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
5716 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
5717 return newLOGOP(optype, 0,
5718 op_lvalue(scalar(left), optype),
5719 newUNOP(OP_SASSIGN, 0, scalar(right)));
5722 return newBINOP(optype, OPf_STACKED,
5723 op_lvalue(scalar(left), optype), scalar(right));
5727 if (is_list_assignment(left)) {
5728 static const char no_list_state[] = "Initialization of state variables"
5729 " in list context currently forbidden";
5731 bool maybe_common_vars = TRUE;
5733 if (left->op_type == OP_ASLICE || left->op_type == OP_HSLICE)
5734 left->op_private &= ~ OPpSLICEWARNING;
5737 left = op_lvalue(left, OP_AASSIGN);
5738 curop = list(force_list(left));
5739 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
5740 o->op_private = (U8)(0 | (flags >> 8));
5742 if ((left->op_type == OP_LIST
5743 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
5745 OP* lop = ((LISTOP*)left)->op_first;
5746 maybe_common_vars = FALSE;
5748 if (lop->op_type == OP_PADSV ||
5749 lop->op_type == OP_PADAV ||
5750 lop->op_type == OP_PADHV ||
5751 lop->op_type == OP_PADANY) {
5752 if (!(lop->op_private & OPpLVAL_INTRO))
5753 maybe_common_vars = TRUE;
5755 if (lop->op_private & OPpPAD_STATE) {
5756 if (left->op_private & OPpLVAL_INTRO) {
5757 /* Each variable in state($a, $b, $c) = ... */
5760 /* Each state variable in
5761 (state $a, my $b, our $c, $d, undef) = ... */
5763 yyerror(no_list_state);
5765 /* Each my variable in
5766 (state $a, my $b, our $c, $d, undef) = ... */
5768 } else if (lop->op_type == OP_UNDEF ||
5769 lop->op_type == OP_PUSHMARK) {
5770 /* undef may be interesting in
5771 (state $a, undef, state $c) */
5773 /* Other ops in the list. */
5774 maybe_common_vars = TRUE;
5776 lop = lop->op_sibling;
5779 else if ((left->op_private & OPpLVAL_INTRO)
5780 && ( left->op_type == OP_PADSV
5781 || left->op_type == OP_PADAV
5782 || left->op_type == OP_PADHV
5783 || left->op_type == OP_PADANY))
5785 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
5786 if (left->op_private & OPpPAD_STATE) {
5787 /* All single variable list context state assignments, hence
5797 yyerror(no_list_state);
5801 /* PL_generation sorcery:
5802 * an assignment like ($a,$b) = ($c,$d) is easier than
5803 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
5804 * To detect whether there are common vars, the global var
5805 * PL_generation is incremented for each assign op we compile.
5806 * Then, while compiling the assign op, we run through all the
5807 * variables on both sides of the assignment, setting a spare slot
5808 * in each of them to PL_generation. If any of them already have
5809 * that value, we know we've got commonality. We could use a
5810 * single bit marker, but then we'd have to make 2 passes, first
5811 * to clear the flag, then to test and set it. To find somewhere
5812 * to store these values, evil chicanery is done with SvUVX().
5815 if (maybe_common_vars) {
5817 if (aassign_common_vars(o))
5818 o->op_private |= OPpASSIGN_COMMON;
5822 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
5823 OP* tmpop = ((LISTOP*)right)->op_first;
5824 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
5825 PMOP * const pm = (PMOP*)tmpop;
5826 if (left->op_type == OP_RV2AV &&
5827 !(left->op_private & OPpLVAL_INTRO) &&
5828 !(o->op_private & OPpASSIGN_COMMON) )
5830 tmpop = ((UNOP*)left)->op_first;
5831 if (tmpop->op_type == OP_GV
5833 && !pm->op_pmreplrootu.op_pmtargetoff
5835 && !pm->op_pmreplrootu.op_pmtargetgv
5839 pm->op_pmreplrootu.op_pmtargetoff
5840 = cPADOPx(tmpop)->op_padix;
5841 cPADOPx(tmpop)->op_padix = 0; /* steal it */
5843 pm->op_pmreplrootu.op_pmtargetgv
5844 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
5845 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
5847 tmpop = cUNOPo->op_first; /* to list (nulled) */
5848 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
5849 tmpop->op_sibling = NULL; /* don't free split */
5850 right->op_next = tmpop->op_next; /* fix starting loc */
5851 op_free(o); /* blow off assign */
5852 right->op_flags &= ~OPf_WANT;
5853 /* "I don't know and I don't care." */
5858 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
5859 ((LISTOP*)right)->op_last->op_type == OP_CONST)
5862 &((SVOP*)((LISTOP*)right)->op_last)->op_sv;
5863 SV * const sv = *svp;
5864 if (SvIOK(sv) && SvIVX(sv) == 0)
5866 if (right->op_private & OPpSPLIT_IMPLIM) {
5867 /* our own SV, created in ck_split */
5869 sv_setiv(sv, PL_modcount+1);
5872 /* SV may belong to someone else */
5874 *svp = newSViv(PL_modcount+1);
5884 right = newOP(OP_UNDEF, 0);
5885 if (right->op_type == OP_READLINE) {
5886 right->op_flags |= OPf_STACKED;
5887 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
5891 o = newBINOP(OP_SASSIGN, flags,
5892 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
5898 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
5900 Constructs a state op (COP). The state op is normally a C<nextstate> op,
5901 but will be a C<dbstate> op if debugging is enabled for currently-compiled
5902 code. The state op is populated from C<PL_curcop> (or C<PL_compiling>).
5903 If I<label> is non-null, it supplies the name of a label to attach to
5904 the state op; this function takes ownership of the memory pointed at by
5905 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
5908 If I<o> is null, the state op is returned. Otherwise the state op is
5909 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
5910 is consumed by this function and becomes part of the returned op tree.
5916 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
5919 const U32 seq = intro_my();
5920 const U32 utf8 = flags & SVf_UTF8;
5925 NewOp(1101, cop, 1, COP);
5926 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
5927 cop->op_type = OP_DBSTATE;
5928 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
5931 cop->op_type = OP_NEXTSTATE;
5932 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
5934 cop->op_flags = (U8)flags;
5935 CopHINTS_set(cop, PL_hints);
5937 cop->op_private |= NATIVE_HINTS;
5940 if (VMSISH_HUSHED) cop->op_private |= OPpHUSH_VMSISH;
5942 cop->op_next = (OP*)cop;
5945 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
5946 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
5948 Perl_cop_store_label(aTHX_ cop, label, strlen(label), utf8);
5950 PL_hints |= HINT_BLOCK_SCOPE;
5951 /* It seems that we need to defer freeing this pointer, as other parts
5952 of the grammar end up wanting to copy it after this op has been
5957 if (PL_parser->preambling != NOLINE) {
5958 CopLINE_set(cop, PL_parser->preambling);
5959 PL_parser->copline = NOLINE;
5961 else if (PL_parser->copline == NOLINE)
5962 CopLINE_set(cop, CopLINE(PL_curcop));
5964 CopLINE_set(cop, PL_parser->copline);
5965 PL_parser->copline = NOLINE;
5968 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
5970 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
5972 CopSTASH_set(cop, PL_curstash);
5974 if (cop->op_type == OP_DBSTATE) {
5975 /* this line can have a breakpoint - store the cop in IV */
5976 AV *av = CopFILEAVx(PL_curcop);
5978 SV * const * const svp = av_fetch(av, CopLINE(cop), FALSE);
5979 if (svp && *svp != &PL_sv_undef ) {
5980 (void)SvIOK_on(*svp);
5981 SvIV_set(*svp, PTR2IV(cop));
5986 if (flags & OPf_SPECIAL)
5988 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
5992 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
5994 Constructs, checks, and returns a logical (flow control) op. I<type>
5995 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
5996 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
5997 the eight bits of C<op_private>, except that the bit with value 1 is
5998 automatically set. I<first> supplies the expression controlling the
5999 flow, and I<other> supplies the side (alternate) chain of ops; they are
6000 consumed by this function and become part of the constructed op tree.
6006 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
6010 PERL_ARGS_ASSERT_NEWLOGOP;
6012 return new_logop(type, flags, &first, &other);
6016 S_search_const(pTHX_ OP *o)
6018 PERL_ARGS_ASSERT_SEARCH_CONST;
6020 switch (o->op_type) {
6024 if (o->op_flags & OPf_KIDS)
6025 return search_const(cUNOPo->op_first);
6032 if (!(o->op_flags & OPf_KIDS))
6034 kid = cLISTOPo->op_first;
6036 switch (kid->op_type) {
6040 kid = kid->op_sibling;
6043 if (kid != cLISTOPo->op_last)
6049 kid = cLISTOPo->op_last;
6051 return search_const(kid);
6059 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
6067 int prepend_not = 0;
6069 PERL_ARGS_ASSERT_NEW_LOGOP;
6074 /* [perl #59802]: Warn about things like "return $a or $b", which
6075 is parsed as "(return $a) or $b" rather than "return ($a or
6076 $b)". NB: This also applies to xor, which is why we do it
6079 switch (first->op_type) {
6083 /* XXX: Perhaps we should emit a stronger warning for these.
6084 Even with the high-precedence operator they don't seem to do
6087 But until we do, fall through here.
6093 /* XXX: Currently we allow people to "shoot themselves in the
6094 foot" by explicitly writing "(return $a) or $b".
6096 Warn unless we are looking at the result from folding or if
6097 the programmer explicitly grouped the operators like this.
6098 The former can occur with e.g.
6100 use constant FEATURE => ( $] >= ... );
6101 sub { not FEATURE and return or do_stuff(); }
6103 if (!first->op_folded && !(first->op_flags & OPf_PARENS))
6104 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
6105 "Possible precedence issue with control flow operator");
6106 /* XXX: Should we optimze this to "return $a;" (i.e. remove
6112 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
6113 return newBINOP(type, flags, scalar(first), scalar(other));
6115 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
6117 scalarboolean(first);
6118 /* optimize AND and OR ops that have NOTs as children */
6119 if (first->op_type == OP_NOT
6120 && (first->op_flags & OPf_KIDS)
6121 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
6122 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
6124 if (type == OP_AND || type == OP_OR) {
6130 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
6132 prepend_not = 1; /* prepend a NOT op later */
6136 /* search for a constant op that could let us fold the test */
6137 if ((cstop = search_const(first))) {
6138 if (cstop->op_private & OPpCONST_STRICT)
6139 no_bareword_allowed(cstop);
6140 else if ((cstop->op_private & OPpCONST_BARE))
6141 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
6142 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
6143 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
6144 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
6146 if (other->op_type == OP_CONST)
6147 other->op_private |= OPpCONST_SHORTCIRCUIT;
6149 OP *newop = newUNOP(OP_NULL, 0, other);
6150 op_getmad(first, newop, '1');
6151 newop->op_targ = type; /* set "was" field */
6155 if (other->op_type == OP_LEAVE)
6156 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
6157 else if (other->op_type == OP_MATCH
6158 || other->op_type == OP_SUBST
6159 || other->op_type == OP_TRANSR
6160 || other->op_type == OP_TRANS)
6161 /* Mark the op as being unbindable with =~ */
6162 other->op_flags |= OPf_SPECIAL;
6164 other->op_folded = 1;
6168 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
6169 const OP *o2 = other;
6170 if ( ! (o2->op_type == OP_LIST
6171 && (( o2 = cUNOPx(o2)->op_first))
6172 && o2->op_type == OP_PUSHMARK
6173 && (( o2 = o2->op_sibling)) )
6176 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
6177 || o2->op_type == OP_PADHV)
6178 && o2->op_private & OPpLVAL_INTRO
6179 && !(o2->op_private & OPpPAD_STATE))
6181 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6182 "Deprecated use of my() in false conditional");
6186 if (cstop->op_type == OP_CONST)
6187 cstop->op_private |= OPpCONST_SHORTCIRCUIT;
6189 first = newUNOP(OP_NULL, 0, first);
6190 op_getmad(other, first, '2');
6191 first->op_targ = type; /* set "was" field */
6198 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
6199 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
6201 const OP * const k1 = ((UNOP*)first)->op_first;
6202 const OP * const k2 = k1->op_sibling;
6204 switch (first->op_type)
6207 if (k2 && k2->op_type == OP_READLINE
6208 && (k2->op_flags & OPf_STACKED)
6209 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6211 warnop = k2->op_type;
6216 if (k1->op_type == OP_READDIR
6217 || k1->op_type == OP_GLOB
6218 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6219 || k1->op_type == OP_EACH
6220 || k1->op_type == OP_AEACH)
6222 warnop = ((k1->op_type == OP_NULL)
6223 ? (OPCODE)k1->op_targ : k1->op_type);
6228 const line_t oldline = CopLINE(PL_curcop);
6229 /* This ensures that warnings are reported at the first line
6230 of the construction, not the last. */
6231 CopLINE_set(PL_curcop, PL_parser->copline);
6232 Perl_warner(aTHX_ packWARN(WARN_MISC),
6233 "Value of %s%s can be \"0\"; test with defined()",
6235 ((warnop == OP_READLINE || warnop == OP_GLOB)
6236 ? " construct" : "() operator"));
6237 CopLINE_set(PL_curcop, oldline);
6244 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
6245 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
6247 NewOp(1101, logop, 1, LOGOP);
6249 logop->op_type = (OPCODE)type;
6250 logop->op_ppaddr = PL_ppaddr[type];
6251 logop->op_first = first;
6252 logop->op_flags = (U8)(flags | OPf_KIDS);
6253 logop->op_other = LINKLIST(other);
6254 logop->op_private = (U8)(1 | (flags >> 8));
6256 /* establish postfix order */
6257 logop->op_next = LINKLIST(first);
6258 first->op_next = (OP*)logop;
6259 first->op_sibling = other;
6261 CHECKOP(type,logop);
6263 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
6270 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
6272 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
6273 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
6274 will be set automatically, and, shifted up eight bits, the eight bits of
6275 C<op_private>, except that the bit with value 1 is automatically set.
6276 I<first> supplies the expression selecting between the two branches,
6277 and I<trueop> and I<falseop> supply the branches; they are consumed by
6278 this function and become part of the constructed op tree.
6284 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
6292 PERL_ARGS_ASSERT_NEWCONDOP;
6295 return newLOGOP(OP_AND, 0, first, trueop);
6297 return newLOGOP(OP_OR, 0, first, falseop);
6299 scalarboolean(first);
6300 if ((cstop = search_const(first))) {
6301 /* Left or right arm of the conditional? */
6302 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
6303 OP *live = left ? trueop : falseop;
6304 OP *const dead = left ? falseop : trueop;
6305 if (cstop->op_private & OPpCONST_BARE &&
6306 cstop->op_private & OPpCONST_STRICT) {
6307 no_bareword_allowed(cstop);
6310 /* This is all dead code when PERL_MAD is not defined. */
6311 live = newUNOP(OP_NULL, 0, live);
6312 op_getmad(first, live, 'C');
6313 op_getmad(dead, live, left ? 'e' : 't');
6318 if (live->op_type == OP_LEAVE)
6319 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
6320 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
6321 || live->op_type == OP_TRANS || live->op_type == OP_TRANSR)
6322 /* Mark the op as being unbindable with =~ */
6323 live->op_flags |= OPf_SPECIAL;
6324 live->op_folded = 1;
6327 NewOp(1101, logop, 1, LOGOP);
6328 logop->op_type = OP_COND_EXPR;
6329 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
6330 logop->op_first = first;
6331 logop->op_flags = (U8)(flags | OPf_KIDS);
6332 logop->op_private = (U8)(1 | (flags >> 8));
6333 logop->op_other = LINKLIST(trueop);
6334 logop->op_next = LINKLIST(falseop);
6336 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
6339 /* establish postfix order */
6340 start = LINKLIST(first);
6341 first->op_next = (OP*)logop;
6343 first->op_sibling = trueop;
6344 trueop->op_sibling = falseop;
6345 o = newUNOP(OP_NULL, 0, (OP*)logop);
6347 trueop->op_next = falseop->op_next = o;
6354 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
6356 Constructs and returns a C<range> op, with subordinate C<flip> and
6357 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
6358 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
6359 for both the C<flip> and C<range> ops, except that the bit with value
6360 1 is automatically set. I<left> and I<right> supply the expressions
6361 controlling the endpoints of the range; they are consumed by this function
6362 and become part of the constructed op tree.
6368 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
6377 PERL_ARGS_ASSERT_NEWRANGE;
6379 NewOp(1101, range, 1, LOGOP);
6381 range->op_type = OP_RANGE;
6382 range->op_ppaddr = PL_ppaddr[OP_RANGE];
6383 range->op_first = left;
6384 range->op_flags = OPf_KIDS;
6385 leftstart = LINKLIST(left);
6386 range->op_other = LINKLIST(right);
6387 range->op_private = (U8)(1 | (flags >> 8));
6389 left->op_sibling = right;
6391 range->op_next = (OP*)range;
6392 flip = newUNOP(OP_FLIP, flags, (OP*)range);
6393 flop = newUNOP(OP_FLOP, 0, flip);
6394 o = newUNOP(OP_NULL, 0, flop);
6396 range->op_next = leftstart;
6398 left->op_next = flip;
6399 right->op_next = flop;
6401 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6402 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
6403 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
6404 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
6406 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6407 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
6409 /* check barewords before they might be optimized aways */
6410 if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT)
6411 no_bareword_allowed(left);
6412 if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT)
6413 no_bareword_allowed(right);
6416 if (!flip->op_private || !flop->op_private)
6417 LINKLIST(o); /* blow off optimizer unless constant */
6423 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
6425 Constructs, checks, and returns an op tree expressing a loop. This is
6426 only a loop in the control flow through the op tree; it does not have
6427 the heavyweight loop structure that allows exiting the loop by C<last>
6428 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
6429 top-level op, except that some bits will be set automatically as required.
6430 I<expr> supplies the expression controlling loop iteration, and I<block>
6431 supplies the body of the loop; they are consumed by this function and
6432 become part of the constructed op tree. I<debuggable> is currently
6433 unused and should always be 1.
6439 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
6444 const bool once = block && block->op_flags & OPf_SPECIAL &&
6445 block->op_type == OP_NULL;
6447 PERL_UNUSED_ARG(debuggable);
6451 (expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
6452 || ( expr->op_type == OP_NOT
6453 && cUNOPx(expr)->op_first->op_type == OP_CONST
6454 && SvTRUE(cSVOPx_sv(cUNOPx(expr)->op_first))
6457 /* Return the block now, so that S_new_logop does not try to
6459 return block; /* do {} while 0 does once */
6460 if (expr->op_type == OP_READLINE
6461 || expr->op_type == OP_READDIR
6462 || expr->op_type == OP_GLOB
6463 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6464 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6465 expr = newUNOP(OP_DEFINED, 0,
6466 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6467 } else if (expr->op_flags & OPf_KIDS) {
6468 const OP * const k1 = ((UNOP*)expr)->op_first;
6469 const OP * const k2 = k1 ? k1->op_sibling : NULL;
6470 switch (expr->op_type) {
6472 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6473 && (k2->op_flags & OPf_STACKED)
6474 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6475 expr = newUNOP(OP_DEFINED, 0, expr);
6479 if (k1 && (k1->op_type == OP_READDIR
6480 || k1->op_type == OP_GLOB
6481 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6482 || k1->op_type == OP_EACH
6483 || k1->op_type == OP_AEACH))
6484 expr = newUNOP(OP_DEFINED, 0, expr);
6490 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
6491 * op, in listop. This is wrong. [perl #27024] */
6493 block = newOP(OP_NULL, 0);
6494 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
6495 o = new_logop(OP_AND, 0, &expr, &listop);
6502 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
6504 if (once && o != listop)
6506 assert(cUNOPo->op_first->op_type == OP_AND
6507 || cUNOPo->op_first->op_type == OP_OR);
6508 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
6512 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
6514 o->op_flags |= flags;
6516 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
6521 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
6523 Constructs, checks, and returns an op tree expressing a C<while> loop.
6524 This is a heavyweight loop, with structure that allows exiting the loop
6525 by C<last> and suchlike.
6527 I<loop> is an optional preconstructed C<enterloop> op to use in the
6528 loop; if it is null then a suitable op will be constructed automatically.
6529 I<expr> supplies the loop's controlling expression. I<block> supplies the
6530 main body of the loop, and I<cont> optionally supplies a C<continue> block
6531 that operates as a second half of the body. All of these optree inputs
6532 are consumed by this function and become part of the constructed op tree.
6534 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6535 op and, shifted up eight bits, the eight bits of C<op_private> for
6536 the C<leaveloop> op, except that (in both cases) some bits will be set
6537 automatically. I<debuggable> is currently unused and should always be 1.
6538 I<has_my> can be supplied as true to force the
6539 loop body to be enclosed in its own scope.
6545 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
6546 OP *expr, OP *block, OP *cont, I32 has_my)
6555 PERL_UNUSED_ARG(debuggable);
6558 if (expr->op_type == OP_READLINE
6559 || expr->op_type == OP_READDIR
6560 || expr->op_type == OP_GLOB
6561 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6562 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6563 expr = newUNOP(OP_DEFINED, 0,
6564 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6565 } else if (expr->op_flags & OPf_KIDS) {
6566 const OP * const k1 = ((UNOP*)expr)->op_first;
6567 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
6568 switch (expr->op_type) {
6570 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6571 && (k2->op_flags & OPf_STACKED)
6572 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6573 expr = newUNOP(OP_DEFINED, 0, expr);
6577 if (k1 && (k1->op_type == OP_READDIR
6578 || k1->op_type == OP_GLOB
6579 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6580 || k1->op_type == OP_EACH
6581 || k1->op_type == OP_AEACH))
6582 expr = newUNOP(OP_DEFINED, 0, expr);
6589 block = newOP(OP_NULL, 0);
6590 else if (cont || has_my) {
6591 block = op_scope(block);
6595 next = LINKLIST(cont);
6598 OP * const unstack = newOP(OP_UNSTACK, 0);
6601 cont = op_append_elem(OP_LINESEQ, cont, unstack);
6605 listop = op_append_list(OP_LINESEQ, block, cont);
6607 redo = LINKLIST(listop);
6611 o = new_logop(OP_AND, 0, &expr, &listop);
6612 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
6614 return expr; /* listop already freed by new_logop */
6617 ((LISTOP*)listop)->op_last->op_next =
6618 (o == listop ? redo : LINKLIST(o));
6624 NewOp(1101,loop,1,LOOP);
6625 loop->op_type = OP_ENTERLOOP;
6626 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
6627 loop->op_private = 0;
6628 loop->op_next = (OP*)loop;
6631 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
6633 loop->op_redoop = redo;
6634 loop->op_lastop = o;
6635 o->op_private |= loopflags;
6638 loop->op_nextop = next;
6640 loop->op_nextop = o;
6642 o->op_flags |= flags;
6643 o->op_private |= (flags >> 8);
6648 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
6650 Constructs, checks, and returns an op tree expressing a C<foreach>
6651 loop (iteration through a list of values). This is a heavyweight loop,
6652 with structure that allows exiting the loop by C<last> and suchlike.
6654 I<sv> optionally supplies the variable that will be aliased to each
6655 item in turn; if null, it defaults to C<$_> (either lexical or global).
6656 I<expr> supplies the list of values to iterate over. I<block> supplies
6657 the main body of the loop, and I<cont> optionally supplies a C<continue>
6658 block that operates as a second half of the body. All of these optree
6659 inputs are consumed by this function and become part of the constructed
6662 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6663 op and, shifted up eight bits, the eight bits of C<op_private> for
6664 the C<leaveloop> op, except that (in both cases) some bits will be set
6671 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
6676 PADOFFSET padoff = 0;
6681 PERL_ARGS_ASSERT_NEWFOROP;
6684 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
6685 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
6686 sv->op_type = OP_RV2GV;
6687 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
6689 /* The op_type check is needed to prevent a possible segfault
6690 * if the loop variable is undeclared and 'strict vars' is in
6691 * effect. This is illegal but is nonetheless parsed, so we
6692 * may reach this point with an OP_CONST where we're expecting
6695 if (cUNOPx(sv)->op_first->op_type == OP_GV
6696 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
6697 iterpflags |= OPpITER_DEF;
6699 else if (sv->op_type == OP_PADSV) { /* private variable */
6700 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
6701 padoff = sv->op_targ;
6711 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
6713 SV *const namesv = PAD_COMPNAME_SV(padoff);
6715 const char *const name = SvPV_const(namesv, len);
6717 if (len == 2 && name[0] == '$' && name[1] == '_')
6718 iterpflags |= OPpITER_DEF;
6722 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
6723 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
6724 sv = newGVOP(OP_GV, 0, PL_defgv);
6729 iterpflags |= OPpITER_DEF;
6731 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
6732 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
6733 iterflags |= OPf_STACKED;
6735 else if (expr->op_type == OP_NULL &&
6736 (expr->op_flags & OPf_KIDS) &&
6737 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
6739 /* Basically turn for($x..$y) into the same as for($x,$y), but we
6740 * set the STACKED flag to indicate that these values are to be
6741 * treated as min/max values by 'pp_enteriter'.
6743 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
6744 LOGOP* const range = (LOGOP*) flip->op_first;
6745 OP* const left = range->op_first;
6746 OP* const right = left->op_sibling;
6749 range->op_flags &= ~OPf_KIDS;
6750 range->op_first = NULL;
6752 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
6753 listop->op_first->op_next = range->op_next;
6754 left->op_next = range->op_other;
6755 right->op_next = (OP*)listop;
6756 listop->op_next = listop->op_first;
6759 op_getmad(expr,(OP*)listop,'O');
6763 expr = (OP*)(listop);
6765 iterflags |= OPf_STACKED;
6768 expr = op_lvalue(force_list(expr), OP_GREPSTART);
6771 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
6772 op_append_elem(OP_LIST, expr, scalar(sv))));
6773 assert(!loop->op_next);
6774 /* for my $x () sets OPpLVAL_INTRO;
6775 * for our $x () sets OPpOUR_INTRO */
6776 loop->op_private = (U8)iterpflags;
6777 if (loop->op_slabbed
6778 && DIFF(loop, OpSLOT(loop)->opslot_next)
6779 < SIZE_TO_PSIZE(sizeof(LOOP)))
6782 NewOp(1234,tmp,1,LOOP);
6783 Copy(loop,tmp,1,LISTOP);
6784 S_op_destroy(aTHX_ (OP*)loop);
6787 else if (!loop->op_slabbed)
6788 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
6789 loop->op_targ = padoff;
6790 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
6792 op_getmad(madsv, (OP*)loop, 'v');
6797 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
6799 Constructs, checks, and returns a loop-exiting op (such as C<goto>
6800 or C<last>). I<type> is the opcode. I<label> supplies the parameter
6801 determining the target of the op; it is consumed by this function and
6802 becomes part of the constructed op tree.
6808 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
6813 PERL_ARGS_ASSERT_NEWLOOPEX;
6815 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
6817 if (type != OP_GOTO) {
6818 /* "last()" means "last" */
6819 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS)) {
6820 o = newOP(type, OPf_SPECIAL);
6824 /* Check whether it's going to be a goto &function */
6825 if (label->op_type == OP_ENTERSUB
6826 && !(label->op_flags & OPf_STACKED))
6827 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
6830 /* Check for a constant argument */
6831 if (label->op_type == OP_CONST) {
6832 SV * const sv = ((SVOP *)label)->op_sv;
6834 const char *s = SvPV_const(sv,l);
6835 if (l == strlen(s)) {
6837 SvUTF8(((SVOP*)label)->op_sv),
6839 SvPV_nolen_const(((SVOP*)label)->op_sv)));
6843 /* If we have already created an op, we do not need the label. */
6846 op_getmad(label,o,'L');
6850 else o = newUNOP(type, OPf_STACKED, label);
6852 PL_hints |= HINT_BLOCK_SCOPE;
6856 /* if the condition is a literal array or hash
6857 (or @{ ... } etc), make a reference to it.
6860 S_ref_array_or_hash(pTHX_ OP *cond)
6863 && (cond->op_type == OP_RV2AV
6864 || cond->op_type == OP_PADAV
6865 || cond->op_type == OP_RV2HV
6866 || cond->op_type == OP_PADHV))
6868 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
6871 && (cond->op_type == OP_ASLICE
6872 || cond->op_type == OP_KVASLICE
6873 || cond->op_type == OP_HSLICE
6874 || cond->op_type == OP_KVHSLICE)) {
6876 /* anonlist now needs a list from this op, was previously used in
6878 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
6879 cond->op_flags |= OPf_WANT_LIST;
6881 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
6888 /* These construct the optree fragments representing given()
6891 entergiven and enterwhen are LOGOPs; the op_other pointer
6892 points up to the associated leave op. We need this so we
6893 can put it in the context and make break/continue work.
6894 (Also, of course, pp_enterwhen will jump straight to
6895 op_other if the match fails.)
6899 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
6900 I32 enter_opcode, I32 leave_opcode,
6901 PADOFFSET entertarg)
6907 PERL_ARGS_ASSERT_NEWGIVWHENOP;
6909 NewOp(1101, enterop, 1, LOGOP);
6910 enterop->op_type = (Optype)enter_opcode;
6911 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
6912 enterop->op_flags = (U8) OPf_KIDS;
6913 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
6914 enterop->op_private = 0;
6916 o = newUNOP(leave_opcode, 0, (OP *) enterop);
6919 enterop->op_first = scalar(cond);
6920 cond->op_sibling = block;
6922 o->op_next = LINKLIST(cond);
6923 cond->op_next = (OP *) enterop;
6926 /* This is a default {} block */
6927 enterop->op_first = block;
6928 enterop->op_flags |= OPf_SPECIAL;
6929 o ->op_flags |= OPf_SPECIAL;
6931 o->op_next = (OP *) enterop;
6934 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
6935 entergiven and enterwhen both
6938 enterop->op_next = LINKLIST(block);
6939 block->op_next = enterop->op_other = o;
6944 /* Does this look like a boolean operation? For these purposes
6945 a boolean operation is:
6946 - a subroutine call [*]
6947 - a logical connective
6948 - a comparison operator
6949 - a filetest operator, with the exception of -s -M -A -C
6950 - defined(), exists() or eof()
6951 - /$re/ or $foo =~ /$re/
6953 [*] possibly surprising
6956 S_looks_like_bool(pTHX_ const OP *o)
6960 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
6962 switch(o->op_type) {
6965 return looks_like_bool(cLOGOPo->op_first);
6969 looks_like_bool(cLOGOPo->op_first)
6970 && looks_like_bool(cLOGOPo->op_first->op_sibling));
6975 o->op_flags & OPf_KIDS
6976 && looks_like_bool(cUNOPo->op_first));
6980 case OP_NOT: case OP_XOR:
6982 case OP_EQ: case OP_NE: case OP_LT:
6983 case OP_GT: case OP_LE: case OP_GE:
6985 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
6986 case OP_I_GT: case OP_I_LE: case OP_I_GE:
6988 case OP_SEQ: case OP_SNE: case OP_SLT:
6989 case OP_SGT: case OP_SLE: case OP_SGE:
6993 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
6994 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
6995 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
6996 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
6997 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
6998 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
6999 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
7000 case OP_FTTEXT: case OP_FTBINARY:
7002 case OP_DEFINED: case OP_EXISTS:
7003 case OP_MATCH: case OP_EOF:
7010 /* Detect comparisons that have been optimized away */
7011 if (cSVOPo->op_sv == &PL_sv_yes
7012 || cSVOPo->op_sv == &PL_sv_no)
7025 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
7027 Constructs, checks, and returns an op tree expressing a C<given> block.
7028 I<cond> supplies the expression that will be locally assigned to a lexical
7029 variable, and I<block> supplies the body of the C<given> construct; they
7030 are consumed by this function and become part of the constructed op tree.
7031 I<defsv_off> is the pad offset of the scalar lexical variable that will
7032 be affected. If it is 0, the global $_ will be used.
7038 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
7041 PERL_ARGS_ASSERT_NEWGIVENOP;
7042 return newGIVWHENOP(
7043 ref_array_or_hash(cond),
7045 OP_ENTERGIVEN, OP_LEAVEGIVEN,
7050 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
7052 Constructs, checks, and returns an op tree expressing a C<when> block.
7053 I<cond> supplies the test expression, and I<block> supplies the block
7054 that will be executed if the test evaluates to true; they are consumed
7055 by this function and become part of the constructed op tree. I<cond>
7056 will be interpreted DWIMically, often as a comparison against C<$_>,
7057 and may be null to generate a C<default> block.
7063 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
7065 const bool cond_llb = (!cond || looks_like_bool(cond));
7068 PERL_ARGS_ASSERT_NEWWHENOP;
7073 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
7075 scalar(ref_array_or_hash(cond)));
7078 return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0);
7082 Perl_cv_ckproto_len_flags(pTHX_ const CV *cv, const GV *gv, const char *p,
7083 const STRLEN len, const U32 flags)
7085 SV *name = NULL, *msg;
7086 const char * cvp = SvROK(cv) ? "" : CvPROTO(cv);
7087 STRLEN clen = CvPROTOLEN(cv), plen = len;
7089 PERL_ARGS_ASSERT_CV_CKPROTO_LEN_FLAGS;
7091 if (p == NULL && cvp == NULL)
7094 if (!ckWARN_d(WARN_PROTOTYPE))
7098 p = S_strip_spaces(aTHX_ p, &plen);
7099 cvp = S_strip_spaces(aTHX_ cvp, &clen);
7100 if ((flags & SVf_UTF8) == SvUTF8(cv)) {
7101 if (plen == clen && memEQ(cvp, p, plen))
7104 if (flags & SVf_UTF8) {
7105 if (bytes_cmp_utf8((const U8 *)cvp, clen, (const U8 *)p, plen) == 0)
7109 if (bytes_cmp_utf8((const U8 *)p, plen, (const U8 *)cvp, clen) == 0)
7115 msg = sv_newmortal();
7120 gv_efullname3(name = sv_newmortal(), gv, NULL);
7121 else if (SvPOK(gv) && *SvPVX((SV *)gv) == '&')
7122 name = newSVpvn_flags(SvPVX((SV *)gv)+1, SvCUR(gv)-1, SvUTF8(gv)|SVs_TEMP);
7123 else name = (SV *)gv;
7125 sv_setpvs(msg, "Prototype mismatch:");
7127 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
7129 Perl_sv_catpvf(aTHX_ msg, " (%"UTF8f")",
7130 UTF8fARG(SvUTF8(cv),clen,cvp)
7133 sv_catpvs(msg, ": none");
7134 sv_catpvs(msg, " vs ");
7136 Perl_sv_catpvf(aTHX_ msg, "(%"UTF8f")", UTF8fARG(flags & SVf_UTF8,len,p));
7138 sv_catpvs(msg, "none");
7139 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
7142 static void const_sv_xsub(pTHX_ CV* cv);
7143 static void const_av_xsub(pTHX_ CV* cv);
7147 =head1 Optree Manipulation Functions
7149 =for apidoc cv_const_sv
7151 If C<cv> is a constant sub eligible for inlining. returns the constant
7152 value returned by the sub. Otherwise, returns NULL.
7154 Constant subs can be created with C<newCONSTSUB> or as described in
7155 L<perlsub/"Constant Functions">.
7160 Perl_cv_const_sv(pTHX_ const CV *const cv)
7163 PERL_UNUSED_CONTEXT;
7166 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
7168 sv = CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
7169 if (sv && SvTYPE(sv) == SVt_PVAV) return NULL;
7174 Perl_cv_const_sv_or_av(pTHX_ const CV * const cv)
7176 PERL_UNUSED_CONTEXT;
7179 assert (SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM);
7180 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
7183 /* op_const_sv: examine an optree to determine whether it's in-lineable.
7187 Perl_op_const_sv(pTHX_ const OP *o)
7198 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
7199 o = cLISTOPo->op_first->op_sibling;
7201 for (; o; o = o->op_next) {
7202 const OPCODE type = o->op_type;
7204 if (sv && o->op_next == o)
7206 if (o->op_next != o) {
7207 if (type == OP_NEXTSTATE
7208 || (type == OP_NULL && !(o->op_flags & OPf_KIDS))
7209 || type == OP_PUSHMARK)
7211 if (type == OP_DBSTATE)
7214 if (type == OP_LEAVESUB || type == OP_RETURN)
7218 if (type == OP_CONST && cSVOPo->op_sv)
7228 S_already_defined(pTHX_ CV *const cv, OP * const block, OP * const o,
7229 PADNAME * const name, SV ** const const_svp)
7236 || block->op_type == OP_NULL
7239 if (CvFLAGS(PL_compcv)) {
7240 /* might have had built-in attrs applied */
7241 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
7242 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl
7243 && ckWARN(WARN_MISC))
7245 /* protect against fatal warnings leaking compcv */
7246 SAVEFREESV(PL_compcv);
7247 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
7248 SvREFCNT_inc_simple_void_NN(PL_compcv);
7251 (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS
7252 & ~(CVf_LVALUE * pureperl));
7257 /* redundant check for speed: */
7258 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
7259 const line_t oldline = CopLINE(PL_curcop);
7262 : sv_2mortal(newSVpvn_utf8(
7263 PadnamePV(name)+1,PadnameLEN(name)-1, PadnameUTF8(name)
7265 if (PL_parser && PL_parser->copline != NOLINE)
7266 /* This ensures that warnings are reported at the first
7267 line of a redefinition, not the last. */
7268 CopLINE_set(PL_curcop, PL_parser->copline);
7269 /* protect against fatal warnings leaking compcv */
7270 SAVEFREESV(PL_compcv);
7271 report_redefined_cv(namesv, cv, const_svp);
7272 SvREFCNT_inc_simple_void_NN(PL_compcv);
7273 CopLINE_set(PL_curcop, oldline);
7276 if (!PL_minus_c) /* keep old one around for madskills */
7279 /* (PL_madskills unset in used file.) */
7286 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
7292 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
7295 CV *compcv = PL_compcv;
7298 PADOFFSET pax = o->op_targ;
7299 CV *outcv = CvOUTSIDE(PL_compcv);
7302 bool reusable = FALSE;
7304 PERL_ARGS_ASSERT_NEWMYSUB;
7306 /* Find the pad slot for storing the new sub.
7307 We cannot use PL_comppad, as it is the pad owned by the new sub. We
7308 need to look in CvOUTSIDE and find the pad belonging to the enclos-
7309 ing sub. And then we need to dig deeper if this is a lexical from
7311 my sub foo; sub { sub foo { } }
7314 name = PadlistNAMESARRAY(CvPADLIST(outcv))[pax];
7315 if (PadnameOUTER(name) && PARENT_PAD_INDEX(name)) {
7316 pax = PARENT_PAD_INDEX(name);
7317 outcv = CvOUTSIDE(outcv);
7322 &PadARRAY(PadlistARRAY(CvPADLIST(outcv))
7323 [CvDEPTH(outcv) ? CvDEPTH(outcv) : 1])[pax];
7324 spot = (CV **)svspot;
7326 if (!(PL_parser && PL_parser->error_count))
7327 move_proto_attr(&proto, &attrs, (GV *)name);
7330 assert(proto->op_type == OP_CONST);
7331 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
7332 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
7337 if (!PL_madskills) {
7344 if (PL_parser && PL_parser->error_count) {
7346 SvREFCNT_dec(PL_compcv);
7351 if (CvDEPTH(outcv) && CvCLONE(compcv)) {
7353 svspot = (SV **)(spot = &clonee);
7355 else if (PadnameIsSTATE(name) || CvDEPTH(outcv))
7359 SvUPGRADE(name, SVt_PVMG);
7360 mg = mg_find(name, PERL_MAGIC_proto);
7361 assert (SvTYPE(*spot) == SVt_PVCV);
7363 hek = CvNAME_HEK(*spot);
7365 CvNAME_HEK_set(*spot, hek =
7368 PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1), 0
7374 cv = (CV *)mg->mg_obj;
7377 sv_magic(name, &PL_sv_undef, PERL_MAGIC_proto, NULL, 0);
7378 mg = mg_find(name, PERL_MAGIC_proto);
7380 spot = (CV **)(svspot = &mg->mg_obj);
7383 if (!block || !ps || *ps || attrs
7384 || (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS)
7386 || block->op_type == OP_NULL
7391 const_sv = op_const_sv(block);
7394 const bool exists = CvROOT(cv) || CvXSUB(cv);
7396 /* if the subroutine doesn't exist and wasn't pre-declared
7397 * with a prototype, assume it will be AUTOLOADed,
7398 * skipping the prototype check
7400 if (exists || SvPOK(cv))
7401 cv_ckproto_len_flags(cv, (GV *)name, ps, ps_len, ps_utf8);
7402 /* already defined? */
7404 if (S_already_defined(aTHX_ cv,block,NULL,name,&const_sv))
7407 if (attrs) goto attrs;
7408 /* just a "sub foo;" when &foo is already defined */
7413 else if (CvDEPTH(outcv) && CvCLONE(compcv)) {
7419 SvREFCNT_inc_simple_void_NN(const_sv);
7420 SvFLAGS(const_sv) = (SvFLAGS(const_sv) & ~SVs_PADMY) | SVs_PADTMP;
7422 assert(!CvROOT(cv) && !CvCONST(cv));
7426 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7427 CvFILE_set_from_cop(cv, PL_curcop);
7428 CvSTASH_set(cv, PL_curstash);
7431 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7432 CvXSUBANY(cv).any_ptr = const_sv;
7433 CvXSUB(cv) = const_sv_xsub;
7439 SvREFCNT_dec(compcv);
7443 /* Checking whether outcv is CvOUTSIDE(compcv) is not sufficient to
7444 determine whether this sub definition is in the same scope as its
7445 declaration. If this sub definition is inside an inner named pack-
7446 age sub (my sub foo; sub bar { sub foo { ... } }), outcv points to
7447 the package sub. So check PadnameOUTER(name) too.
7449 if (outcv == CvOUTSIDE(compcv) && !PadnameOUTER(name)) {
7450 assert(!CvWEAKOUTSIDE(compcv));
7451 SvREFCNT_dec(CvOUTSIDE(compcv));
7452 CvWEAKOUTSIDE_on(compcv);
7454 /* XXX else do we have a circular reference? */
7455 if (cv) { /* must reuse cv in case stub is referenced elsewhere */
7456 /* transfer PL_compcv to cv */
7459 && block->op_type != OP_NULL
7462 cv_flags_t preserved_flags =
7463 CvFLAGS(cv) & (CVf_BUILTIN_ATTRS|CVf_NAMED);
7464 PADLIST *const temp_padl = CvPADLIST(cv);
7465 CV *const temp_cv = CvOUTSIDE(cv);
7466 const cv_flags_t other_flags =
7467 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7468 OP * const cvstart = CvSTART(cv);
7472 CvFLAGS(compcv) | preserved_flags;
7473 CvOUTSIDE(cv) = CvOUTSIDE(compcv);
7474 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(compcv);
7475 CvPADLIST(cv) = CvPADLIST(compcv);
7476 CvOUTSIDE(compcv) = temp_cv;
7477 CvPADLIST(compcv) = temp_padl;
7478 CvSTART(cv) = CvSTART(compcv);
7479 CvSTART(compcv) = cvstart;
7480 CvFLAGS(compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7481 CvFLAGS(compcv) |= other_flags;
7483 if (CvFILE(cv) && CvDYNFILE(cv)) {
7484 Safefree(CvFILE(cv));
7487 /* inner references to compcv must be fixed up ... */
7488 pad_fixup_inner_anons(CvPADLIST(cv), compcv, cv);
7489 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7490 ++PL_sub_generation;
7493 /* Might have had built-in attributes applied -- propagate them. */
7494 CvFLAGS(cv) |= (CvFLAGS(compcv) & CVf_BUILTIN_ATTRS);
7496 /* ... before we throw it away */
7497 SvREFCNT_dec(compcv);
7498 PL_compcv = compcv = cv;
7505 if (!CvNAME_HEK(cv)) {
7508 ? share_hek_hek(hek)
7509 : share_hek(PadnamePV(name)+1,
7510 PadnameLEN(name)-1 * (PadnameUTF8(name) ? -1 : 1),
7514 if (const_sv) goto clone;
7516 CvFILE_set_from_cop(cv, PL_curcop);
7517 CvSTASH_set(cv, PL_curstash);
7520 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7521 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7528 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7529 the debugger could be able to set a breakpoint in, so signal to
7530 pp_entereval that it should not throw away any saved lines at scope
7533 PL_breakable_sub_gen++;
7534 /* This makes sub {}; work as expected. */
7535 if (block->op_type == OP_STUB) {
7536 OP* const newblock = newSTATEOP(0, NULL, 0);
7538 op_getmad(block,newblock,'B');
7544 CvROOT(cv) = CvLVALUE(cv)
7545 ? newUNOP(OP_LEAVESUBLV, 0,
7546 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7547 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7548 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7549 OpREFCNT_set(CvROOT(cv), 1);
7550 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7551 itself has a refcount. */
7553 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7554 CvSTART(cv) = LINKLIST(CvROOT(cv));
7555 CvROOT(cv)->op_next = 0;
7556 CALL_PEEP(CvSTART(cv));
7557 finalize_optree(CvROOT(cv));
7559 /* now that optimizer has done its work, adjust pad values */
7561 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7565 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7566 apply_attrs(PL_curstash, MUTABLE_SV(cv), attrs);
7570 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7571 SV * const tmpstr = sv_newmortal();
7572 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7573 GV_ADDMULTI, SVt_PVHV);
7575 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7578 (long)CopLINE(PL_curcop));
7579 if (HvNAME_HEK(PL_curstash)) {
7580 sv_sethek(tmpstr, HvNAME_HEK(PL_curstash));
7581 sv_catpvs(tmpstr, "::");
7583 else sv_setpvs(tmpstr, "__ANON__::");
7584 sv_catpvn_flags(tmpstr, PadnamePV(name)+1, PadnameLEN(name)-1,
7585 PadnameUTF8(name) ? SV_CATUTF8 : SV_CATBYTES);
7586 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7587 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7588 hv = GvHVn(db_postponed);
7589 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7590 CV * const pcv = GvCV(db_postponed);
7596 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7604 assert(CvDEPTH(outcv));
7606 &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[CvDEPTH(outcv)])[pax];
7607 if (reusable) cv_clone_into(clonee, *spot);
7608 else *spot = cv_clone(clonee);
7609 SvREFCNT_dec_NN(clonee);
7613 if (CvDEPTH(outcv) && !reusable && PadnameIsSTATE(name)) {
7614 PADOFFSET depth = CvDEPTH(outcv);
7617 svspot = &PadARRAY(PadlistARRAY(CvPADLIST(outcv))[depth])[pax];
7619 *svspot = SvREFCNT_inc_simple_NN(cv);
7620 SvREFCNT_dec(oldcv);
7626 PL_parser->copline = NOLINE;
7634 Perl_newATTRSUB_x(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs,
7635 OP *block, bool o_is_gv)
7640 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
7644 const bool ec = PL_parser && PL_parser->error_count;
7645 /* If the subroutine has no body, no attributes, and no builtin attributes
7646 then it's just a sub declaration, and we may be able to get away with
7647 storing with a placeholder scalar in the symbol table, rather than a
7648 full GV and CV. If anything is present then it will take a full CV to
7650 const I32 gv_fetch_flags
7651 = ec ? GV_NOADD_NOINIT :
7652 (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7654 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
7656 const char * const name =
7657 o ? SvPV_const(o_is_gv ? (SV *)o : cSVOPo->op_sv, namlen) : NULL;
7659 bool name_is_utf8 = o && !o_is_gv && SvUTF8(cSVOPo->op_sv);
7660 #ifdef PERL_DEBUG_READONLY_OPS
7661 OPSLAB *slab = NULL;
7669 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
7671 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
7672 SV * const sv = sv_newmortal();
7673 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
7674 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
7675 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
7676 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
7678 } else if (PL_curstash) {
7679 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
7682 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
7687 move_proto_attr(&proto, &attrs, gv);
7690 assert(proto->op_type == OP_CONST);
7691 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
7692 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
7697 if (!PL_madskills) {
7708 if (name) SvREFCNT_dec(PL_compcv);
7709 else cv = PL_compcv;
7711 if (name && block) {
7712 const char *s = strrchr(name, ':');
7714 if (strEQ(s, "BEGIN")) {
7715 if (PL_in_eval & EVAL_KEEPERR)
7716 Perl_croak_nocontext("BEGIN not safe after errors--compilation aborted");
7718 SV * const errsv = ERRSV;
7719 /* force display of errors found but not reported */
7720 sv_catpvs(errsv, "BEGIN not safe after errors--compilation aborted");
7721 Perl_croak_nocontext("%"SVf, SVfARG(errsv));
7728 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
7729 maximum a prototype before. */
7730 if (SvTYPE(gv) > SVt_NULL) {
7731 cv_ckproto_len_flags((const CV *)gv,
7732 o ? (const GV *)cSVOPo->op_sv : NULL, ps,
7736 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
7737 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(gv));
7740 sv_setiv(MUTABLE_SV(gv), -1);
7742 SvREFCNT_dec(PL_compcv);
7743 cv = PL_compcv = NULL;
7747 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
7749 if (!block || !ps || *ps || attrs
7750 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
7752 || block->op_type == OP_NULL
7757 const_sv = op_const_sv(block);
7760 const bool exists = CvROOT(cv) || CvXSUB(cv);
7762 /* if the subroutine doesn't exist and wasn't pre-declared
7763 * with a prototype, assume it will be AUTOLOADed,
7764 * skipping the prototype check
7766 if (exists || SvPOK(cv))
7767 cv_ckproto_len_flags(cv, gv, ps, ps_len, ps_utf8);
7768 /* already defined (or promised)? */
7769 if (exists || GvASSUMECV(gv)) {
7770 if (S_already_defined(aTHX_ cv, block, o, NULL, &const_sv))
7773 if (attrs) goto attrs;
7774 /* just a "sub foo;" when &foo is already defined */
7775 SAVEFREESV(PL_compcv);
7781 SvREFCNT_inc_simple_void_NN(const_sv);
7782 SvFLAGS(const_sv) = (SvFLAGS(const_sv) & ~SVs_PADMY) | SVs_PADTMP;
7784 assert(!CvROOT(cv) && !CvCONST(cv));
7786 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
7787 CvXSUBANY(cv).any_ptr = const_sv;
7788 CvXSUB(cv) = const_sv_xsub;
7794 cv = newCONSTSUB_flags(
7795 NULL, name, namlen, name_is_utf8 ? SVf_UTF8 : 0,
7802 SvREFCNT_dec(PL_compcv);
7806 if (cv) { /* must reuse cv if autoloaded */
7807 /* transfer PL_compcv to cv */
7810 && block->op_type != OP_NULL
7813 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
7814 PADLIST *const temp_av = CvPADLIST(cv);
7815 CV *const temp_cv = CvOUTSIDE(cv);
7816 const cv_flags_t other_flags =
7817 CvFLAGS(cv) & (CVf_SLABBED|CVf_WEAKOUTSIDE);
7818 OP * const cvstart = CvSTART(cv);
7821 assert(!CvCVGV_RC(cv));
7822 assert(CvGV(cv) == gv);
7825 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
7826 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
7827 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
7828 CvPADLIST(cv) = CvPADLIST(PL_compcv);
7829 CvOUTSIDE(PL_compcv) = temp_cv;
7830 CvPADLIST(PL_compcv) = temp_av;
7831 CvSTART(cv) = CvSTART(PL_compcv);
7832 CvSTART(PL_compcv) = cvstart;
7833 CvFLAGS(PL_compcv) &= ~(CVf_SLABBED|CVf_WEAKOUTSIDE);
7834 CvFLAGS(PL_compcv) |= other_flags;
7836 if (CvFILE(cv) && CvDYNFILE(cv)) {
7837 Safefree(CvFILE(cv));
7839 CvFILE_set_from_cop(cv, PL_curcop);
7840 CvSTASH_set(cv, PL_curstash);
7842 /* inner references to PL_compcv must be fixed up ... */
7843 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
7844 if (PERLDB_INTER)/* Advice debugger on the new sub. */
7845 ++PL_sub_generation;
7848 /* Might have had built-in attributes applied -- propagate them. */
7849 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
7851 /* ... before we throw it away */
7852 SvREFCNT_dec(PL_compcv);
7860 if (HvENAME_HEK(GvSTASH(gv)))
7861 /* sub Foo::bar { (shift)+1 } */
7862 gv_method_changed(gv);
7867 CvFILE_set_from_cop(cv, PL_curcop);
7868 CvSTASH_set(cv, PL_curstash);
7872 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
7873 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
7880 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7881 the debugger could be able to set a breakpoint in, so signal to
7882 pp_entereval that it should not throw away any saved lines at scope
7885 PL_breakable_sub_gen++;
7886 /* This makes sub {}; work as expected. */
7887 if (block->op_type == OP_STUB) {
7888 OP* const newblock = newSTATEOP(0, NULL, 0);
7890 op_getmad(block,newblock,'B');
7896 CvROOT(cv) = CvLVALUE(cv)
7897 ? newUNOP(OP_LEAVESUBLV, 0,
7898 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7899 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7900 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7901 OpREFCNT_set(CvROOT(cv), 1);
7902 /* The cv no longer needs to hold a refcount on the slab, as CvROOT
7903 itself has a refcount. */
7905 OpslabREFCNT_dec_padok((OPSLAB *)CvSTART(cv));
7906 #ifdef PERL_DEBUG_READONLY_OPS
7907 slab = (OPSLAB *)CvSTART(cv);
7909 CvSTART(cv) = LINKLIST(CvROOT(cv));
7910 CvROOT(cv)->op_next = 0;
7911 CALL_PEEP(CvSTART(cv));
7912 finalize_optree(CvROOT(cv));
7914 /* now that optimizer has done its work, adjust pad values */
7916 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7920 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7921 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
7922 if (!name) SAVEFREESV(cv);
7923 apply_attrs(stash, MUTABLE_SV(cv), attrs);
7924 if (!name) SvREFCNT_inc_simple_void_NN(cv);
7927 if (block && has_name) {
7928 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7929 SV * const tmpstr = sv_newmortal();
7930 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7931 GV_ADDMULTI, SVt_PVHV);
7933 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7936 (long)CopLINE(PL_curcop));
7937 gv_efullname3(tmpstr, gv, NULL);
7938 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7939 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7940 hv = GvHVn(db_postponed);
7941 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7942 CV * const pcv = GvCV(db_postponed);
7948 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7953 if (name && ! (PL_parser && PL_parser->error_count))
7954 process_special_blocks(floor, name, gv, cv);
7959 PL_parser->copline = NOLINE;
7961 #ifdef PERL_DEBUG_READONLY_OPS
7962 /* Watch out for BEGIN blocks */
7963 if (slab && gv && isGV(gv) && GvCV(gv)) Slab_to_ro(slab);
7969 S_process_special_blocks(pTHX_ I32 floor, const char *const fullname,
7973 const char *const colon = strrchr(fullname,':');
7974 const char *const name = colon ? colon + 1 : fullname;
7976 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
7979 if (strEQ(name, "BEGIN")) {
7980 const I32 oldscope = PL_scopestack_ix;
7982 if (floor) LEAVE_SCOPE(floor);
7984 PUSHSTACKi(PERLSI_REQUIRE);
7985 SAVECOPFILE(&PL_compiling);
7986 SAVECOPLINE(&PL_compiling);
7987 SAVEVPTR(PL_curcop);
7989 DEBUG_x( dump_sub(gv) );
7990 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
7991 GvCV_set(gv,0); /* cv has been hijacked */
7992 call_list(oldscope, PL_beginav);
8001 if strEQ(name, "END") {
8002 DEBUG_x( dump_sub(gv) );
8003 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
8006 } else if (*name == 'U') {
8007 if (strEQ(name, "UNITCHECK")) {
8008 /* It's never too late to run a unitcheck block */
8009 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
8013 } else if (*name == 'C') {
8014 if (strEQ(name, "CHECK")) {
8016 /* diag_listed_as: Too late to run %s block */
8017 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
8018 "Too late to run CHECK block");
8019 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
8023 } else if (*name == 'I') {
8024 if (strEQ(name, "INIT")) {
8026 /* diag_listed_as: Too late to run %s block */
8027 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
8028 "Too late to run INIT block");
8029 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
8035 DEBUG_x( dump_sub(gv) );
8036 GvCV_set(gv,0); /* cv has been hijacked */
8041 =for apidoc newCONSTSUB
8043 See L</newCONSTSUB_flags>.
8049 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
8051 return newCONSTSUB_flags(stash, name, name ? strlen(name) : 0, 0, sv);
8055 =for apidoc newCONSTSUB_flags
8057 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
8058 eligible for inlining at compile-time.
8060 Currently, the only useful value for C<flags> is SVf_UTF8.
8062 The newly created subroutine takes ownership of a reference to the passed in
8065 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
8066 which won't be called if used as a destructor, but will suppress the overhead
8067 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
8074 Perl_newCONSTSUB_flags(pTHX_ HV *stash, const char *name, STRLEN len,
8079 const char *const file = CopFILE(PL_curcop);
8083 if (IN_PERL_RUNTIME) {
8084 /* at runtime, it's not safe to manipulate PL_curcop: it may be
8085 * an op shared between threads. Use a non-shared COP for our
8087 SAVEVPTR(PL_curcop);
8088 SAVECOMPILEWARNINGS();
8089 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
8090 PL_curcop = &PL_compiling;
8092 SAVECOPLINE(PL_curcop);
8093 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
8096 PL_hints &= ~HINT_BLOCK_SCOPE;
8099 SAVEGENERICSV(PL_curstash);
8100 PL_curstash = (HV *)SvREFCNT_inc_simple_NN(stash);
8103 /* Protect sv against leakage caused by fatal warnings. */
8104 if (sv) SAVEFREESV(sv);
8106 /* file becomes the CvFILE. For an XS, it's usually static storage,
8107 and so doesn't get free()d. (It's expected to be from the C pre-
8108 processor __FILE__ directive). But we need a dynamically allocated one,
8109 and we need it to get freed. */
8110 cv = newXS_len_flags(name, len,
8111 sv && SvTYPE(sv) == SVt_PVAV
8114 file ? file : "", "",
8115 &sv, XS_DYNAMIC_FILENAME | flags);
8116 CvXSUBANY(cv).any_ptr = SvREFCNT_inc_simple(sv);
8125 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
8126 const char *const filename, const char *const proto,
8129 PERL_ARGS_ASSERT_NEWXS_FLAGS;
8130 return newXS_len_flags(
8131 name, name ? strlen(name) : 0, subaddr, filename, proto, NULL, flags
8136 Perl_newXS_len_flags(pTHX_ const char *name, STRLEN len,
8137 XSUBADDR_t subaddr, const char *const filename,
8138 const char *const proto, SV **const_svp,
8142 bool interleave = FALSE;
8144 PERL_ARGS_ASSERT_NEWXS_LEN_FLAGS;
8147 GV * const gv = gv_fetchpvn(
8148 name ? name : PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
8149 name ? len : PL_curstash ? sizeof("__ANON__") - 1:
8150 sizeof("__ANON__::__ANON__") - 1,
8151 GV_ADDMULTI | flags, SVt_PVCV);
8154 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
8156 if ((cv = (name ? GvCV(gv) : NULL))) {
8158 /* just a cached method */
8162 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
8163 /* already defined (or promised) */
8164 /* Redundant check that allows us to avoid creating an SV
8165 most of the time: */
8166 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
8167 report_redefined_cv(newSVpvn_flags(
8168 name,len,(flags&SVf_UTF8)|SVs_TEMP
8179 if (cv) /* must reuse cv if autoloaded */
8182 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
8186 if (HvENAME_HEK(GvSTASH(gv)))
8187 gv_method_changed(gv); /* newXS */
8193 (void)gv_fetchfile(filename);
8194 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
8195 an external constant string */
8196 assert(!CvDYNFILE(cv)); /* cv_undef should have turned it off */
8198 CvXSUB(cv) = subaddr;
8201 process_special_blocks(0, name, gv, cv);
8204 if (flags & XS_DYNAMIC_FILENAME) {
8205 CvFILE(cv) = savepv(filename);
8208 sv_setpv(MUTABLE_SV(cv), proto);
8209 if (interleave) LEAVE;
8214 Perl_newSTUB(pTHX_ GV *gv, bool fake)
8216 CV *cv = MUTABLE_CV(newSV_type(SVt_PVCV));
8218 PERL_ARGS_ASSERT_NEWSTUB;
8222 if (!fake && HvENAME_HEK(GvSTASH(gv)))
8223 gv_method_changed(gv);
8225 cvgv = gv_fetchsv((SV *)gv, GV_ADDMULTI, SVt_PVCV);
8230 CvFILE_set_from_cop(cv, PL_curcop);
8231 CvSTASH_set(cv, PL_curstash);
8237 =for apidoc U||newXS
8239 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
8240 static storage, as it is used directly as CvFILE(), without a copy being made.
8246 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
8248 PERL_ARGS_ASSERT_NEWXS;
8249 return newXS_len_flags(
8250 name, name ? strlen(name) : 0, subaddr, filename, NULL, NULL, 0
8259 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
8264 OP* pegop = newOP(OP_NULL, 0);
8269 if (PL_parser && PL_parser->error_count) {
8275 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
8276 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
8279 if ((cv = GvFORM(gv))) {
8280 if (ckWARN(WARN_REDEFINE)) {
8281 const line_t oldline = CopLINE(PL_curcop);
8282 if (PL_parser && PL_parser->copline != NOLINE)
8283 CopLINE_set(PL_curcop, PL_parser->copline);
8285 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
8286 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
8288 /* diag_listed_as: Format %s redefined */
8289 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
8290 "Format STDOUT redefined");
8292 CopLINE_set(PL_curcop, oldline);
8297 GvFORM(gv) = (CV *)SvREFCNT_inc_simple_NN(cv);
8299 CvFILE_set_from_cop(cv, PL_curcop);
8302 pad_tidy(padtidy_FORMAT);
8303 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
8304 CvROOT(cv)->op_private |= OPpREFCOUNTED;
8305 OpREFCNT_set(CvROOT(cv), 1);
8306 CvSTART(cv) = LINKLIST(CvROOT(cv));
8307 CvROOT(cv)->op_next = 0;
8308 CALL_PEEP(CvSTART(cv));
8309 finalize_optree(CvROOT(cv));
8314 op_getmad(o,pegop,'n');
8315 op_getmad_weak(block, pegop, 'b');
8320 PL_parser->copline = NOLINE;
8328 Perl_newANONLIST(pTHX_ OP *o)
8330 return convert(OP_ANONLIST, OPf_SPECIAL, o);
8334 Perl_newANONHASH(pTHX_ OP *o)
8336 return convert(OP_ANONHASH, OPf_SPECIAL, o);
8340 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
8342 return newANONATTRSUB(floor, proto, NULL, block);
8346 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
8348 return newUNOP(OP_REFGEN, 0,
8349 newSVOP(OP_ANONCODE, 0,
8350 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
8354 Perl_oopsAV(pTHX_ OP *o)
8358 PERL_ARGS_ASSERT_OOPSAV;
8360 switch (o->op_type) {
8363 o->op_type = OP_PADAV;
8364 o->op_ppaddr = PL_ppaddr[OP_PADAV];
8365 return ref(o, OP_RV2AV);
8369 o->op_type = OP_RV2AV;
8370 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
8375 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
8382 Perl_oopsHV(pTHX_ OP *o)
8386 PERL_ARGS_ASSERT_OOPSHV;
8388 switch (o->op_type) {
8391 o->op_type = OP_PADHV;
8392 o->op_ppaddr = PL_ppaddr[OP_PADHV];
8393 return ref(o, OP_RV2HV);
8397 o->op_type = OP_RV2HV;
8398 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
8403 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
8410 Perl_newAVREF(pTHX_ OP *o)
8414 PERL_ARGS_ASSERT_NEWAVREF;
8416 if (o->op_type == OP_PADANY) {
8417 o->op_type = OP_PADAV;
8418 o->op_ppaddr = PL_ppaddr[OP_PADAV];
8421 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
8422 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8423 "Using an array as a reference is deprecated");
8425 return newUNOP(OP_RV2AV, 0, scalar(o));
8429 Perl_newGVREF(pTHX_ I32 type, OP *o)
8431 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
8432 return newUNOP(OP_NULL, 0, o);
8433 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
8437 Perl_newHVREF(pTHX_ OP *o)
8441 PERL_ARGS_ASSERT_NEWHVREF;
8443 if (o->op_type == OP_PADANY) {
8444 o->op_type = OP_PADHV;
8445 o->op_ppaddr = PL_ppaddr[OP_PADHV];
8448 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
8449 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8450 "Using a hash as a reference is deprecated");
8452 return newUNOP(OP_RV2HV, 0, scalar(o));
8456 Perl_newCVREF(pTHX_ I32 flags, OP *o)
8458 if (o->op_type == OP_PADANY) {
8460 o->op_type = OP_PADCV;
8461 o->op_ppaddr = PL_ppaddr[OP_PADCV];
8463 return newUNOP(OP_RV2CV, flags, scalar(o));
8467 Perl_newSVREF(pTHX_ OP *o)
8471 PERL_ARGS_ASSERT_NEWSVREF;
8473 if (o->op_type == OP_PADANY) {
8474 o->op_type = OP_PADSV;
8475 o->op_ppaddr = PL_ppaddr[OP_PADSV];
8478 return newUNOP(OP_RV2SV, 0, scalar(o));
8481 /* Check routines. See the comments at the top of this file for details
8482 * on when these are called */
8485 Perl_ck_anoncode(pTHX_ OP *o)
8487 PERL_ARGS_ASSERT_CK_ANONCODE;
8489 cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type);
8491 cSVOPo->op_sv = NULL;
8496 S_io_hints(pTHX_ OP *o)
8499 PL_hints & HINT_LOCALIZE_HH ? GvHV(PL_hintgv) : NULL;;
8501 SV **svp = hv_fetchs(table, "open_IN", FALSE);
8504 const char *d = SvPV_const(*svp, len);
8505 const I32 mode = mode_from_discipline(d, len);
8506 if (mode & O_BINARY)
8507 o->op_private |= OPpOPEN_IN_RAW;
8508 else if (mode & O_TEXT)
8509 o->op_private |= OPpOPEN_IN_CRLF;
8512 svp = hv_fetchs(table, "open_OUT", FALSE);
8515 const char *d = SvPV_const(*svp, len);
8516 const I32 mode = mode_from_discipline(d, len);
8517 if (mode & O_BINARY)
8518 o->op_private |= OPpOPEN_OUT_RAW;
8519 else if (mode & O_TEXT)
8520 o->op_private |= OPpOPEN_OUT_CRLF;
8526 Perl_ck_backtick(pTHX_ OP *o)
8530 PERL_ARGS_ASSERT_CK_BACKTICK;
8531 /* qx and `` have a null pushmark; CORE::readpipe has only one kid. */
8532 if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_sibling
8533 && (gv = gv_override("readpipe",8))) {
8534 newop = S_new_entersubop(aTHX_ gv, cUNOPo->op_first->op_sibling);
8535 cUNOPo->op_first->op_sibling = NULL;
8537 else if (!(o->op_flags & OPf_KIDS))
8538 newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
8541 op_getmad(o,newop,'O');
8547 S_io_hints(aTHX_ o);
8552 Perl_ck_bitop(pTHX_ OP *o)
8556 PERL_ARGS_ASSERT_CK_BITOP;
8558 o->op_private = (U8)(PL_hints & HINT_INTEGER);
8559 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
8560 && (o->op_type == OP_BIT_OR
8561 || o->op_type == OP_BIT_AND
8562 || o->op_type == OP_BIT_XOR))
8564 const OP * const left = cBINOPo->op_first;
8565 const OP * const right = left->op_sibling;
8566 if ((OP_IS_NUMCOMPARE(left->op_type) &&
8567 (left->op_flags & OPf_PARENS) == 0) ||
8568 (OP_IS_NUMCOMPARE(right->op_type) &&
8569 (right->op_flags & OPf_PARENS) == 0))
8570 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
8571 "Possible precedence problem on bitwise %c operator",
8572 o->op_type == OP_BIT_OR ? '|'
8573 : o->op_type == OP_BIT_AND ? '&' : '^'
8579 PERL_STATIC_INLINE bool
8580 is_dollar_bracket(pTHX_ const OP * const o)
8583 return o->op_type == OP_RV2SV && o->op_flags & OPf_KIDS
8584 && (kid = cUNOPx(o)->op_first)
8585 && kid->op_type == OP_GV
8586 && strEQ(GvNAME(cGVOPx_gv(kid)), "[");
8590 Perl_ck_cmp(pTHX_ OP *o)
8592 PERL_ARGS_ASSERT_CK_CMP;
8593 if (ckWARN(WARN_SYNTAX)) {
8594 const OP *kid = cUNOPo->op_first;
8597 is_dollar_bracket(aTHX_ kid)
8598 && kid->op_sibling && kid->op_sibling->op_type == OP_CONST
8600 || ( kid->op_type == OP_CONST
8601 && (kid = kid->op_sibling) && is_dollar_bracket(aTHX_ kid))
8603 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
8604 "$[ used in %s (did you mean $] ?)", OP_DESC(o));
8610 Perl_ck_concat(pTHX_ OP *o)
8612 const OP * const kid = cUNOPo->op_first;
8614 PERL_ARGS_ASSERT_CK_CONCAT;
8615 PERL_UNUSED_CONTEXT;
8617 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
8618 !(kUNOP->op_first->op_flags & OPf_MOD))
8619 o->op_flags |= OPf_STACKED;
8624 Perl_ck_spair(pTHX_ OP *o)
8628 PERL_ARGS_ASSERT_CK_SPAIR;
8630 if (o->op_flags & OPf_KIDS) {
8633 const OPCODE type = o->op_type;
8634 o = modkids(ck_fun(o), type);
8635 kid = cUNOPo->op_first;
8636 newop = kUNOP->op_first->op_sibling;
8638 const OPCODE type = newop->op_type;
8639 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
8640 type == OP_PADAV || type == OP_PADHV ||
8641 type == OP_RV2AV || type == OP_RV2HV)
8645 op_getmad(kUNOP->op_first,newop,'K');
8647 op_free(kUNOP->op_first);
8649 kUNOP->op_first = newop;
8651 /* transforms OP_REFGEN into OP_SREFGEN, OP_CHOP into OP_SCHOP,
8652 * and OP_CHOMP into OP_SCHOMP */
8653 o->op_ppaddr = PL_ppaddr[++o->op_type];
8658 Perl_ck_delete(pTHX_ OP *o)
8660 PERL_ARGS_ASSERT_CK_DELETE;
8664 if (o->op_flags & OPf_KIDS) {
8665 OP * const kid = cUNOPo->op_first;
8666 switch (kid->op_type) {
8668 o->op_flags |= OPf_SPECIAL;
8671 o->op_private |= OPpSLICE;
8674 o->op_flags |= OPf_SPECIAL;
8679 Perl_croak(aTHX_ "delete argument is index/value array slice,"
8680 " use array slice");
8682 Perl_croak(aTHX_ "delete argument is key/value hash slice, use"
8685 Perl_croak(aTHX_ "delete argument is not a HASH or ARRAY "
8686 "element or slice");
8688 if (kid->op_private & OPpLVAL_INTRO)
8689 o->op_private |= OPpLVAL_INTRO;
8696 Perl_ck_eof(pTHX_ OP *o)
8700 PERL_ARGS_ASSERT_CK_EOF;
8702 if (o->op_flags & OPf_KIDS) {
8704 if (cLISTOPo->op_first->op_type == OP_STUB) {
8706 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
8708 op_getmad(o,newop,'O');
8715 kid = cLISTOPo->op_first;
8716 if (kid->op_type == OP_RV2GV)
8717 kid->op_private |= OPpALLOW_FAKE;
8723 Perl_ck_eval(pTHX_ OP *o)
8727 PERL_ARGS_ASSERT_CK_EVAL;
8729 PL_hints |= HINT_BLOCK_SCOPE;
8730 if (o->op_flags & OPf_KIDS) {
8731 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8734 if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
8740 cUNOPo->op_first = 0;
8745 NewOp(1101, enter, 1, LOGOP);
8746 enter->op_type = OP_ENTERTRY;
8747 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
8748 enter->op_private = 0;
8750 /* establish postfix order */
8751 enter->op_next = (OP*)enter;
8753 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
8754 o->op_type = OP_LEAVETRY;
8755 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
8756 enter->op_other = o;
8757 op_getmad(oldo,o,'O');
8766 const U8 priv = o->op_private;
8772 o = newUNOP(OP_ENTEREVAL, priv <<8, newDEFSVOP());
8773 op_getmad(oldo,o,'O');
8775 o->op_targ = (PADOFFSET)PL_hints;
8776 if (o->op_private & OPpEVAL_BYTES) o->op_targ &= ~HINT_UTF8;
8777 if ((PL_hints & HINT_LOCALIZE_HH) != 0
8778 && !(o->op_private & OPpEVAL_COPHH) && GvHV(PL_hintgv)) {
8779 /* Store a copy of %^H that pp_entereval can pick up. */
8780 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
8781 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
8782 cUNOPo->op_first->op_sibling = hhop;
8783 o->op_private |= OPpEVAL_HAS_HH;
8785 if (!(o->op_private & OPpEVAL_BYTES)
8786 && FEATURE_UNIEVAL_IS_ENABLED)
8787 o->op_private |= OPpEVAL_UNICODE;
8792 Perl_ck_exec(pTHX_ OP *o)
8794 PERL_ARGS_ASSERT_CK_EXEC;
8796 if (o->op_flags & OPf_STACKED) {
8799 kid = cUNOPo->op_first->op_sibling;
8800 if (kid->op_type == OP_RV2GV)
8809 Perl_ck_exists(pTHX_ OP *o)
8813 PERL_ARGS_ASSERT_CK_EXISTS;
8816 if (o->op_flags & OPf_KIDS) {
8817 OP * const kid = cUNOPo->op_first;
8818 if (kid->op_type == OP_ENTERSUB) {
8819 (void) ref(kid, o->op_type);
8820 if (kid->op_type != OP_RV2CV
8821 && !(PL_parser && PL_parser->error_count))
8823 "exists argument is not a subroutine name");
8824 o->op_private |= OPpEXISTS_SUB;
8826 else if (kid->op_type == OP_AELEM)
8827 o->op_flags |= OPf_SPECIAL;
8828 else if (kid->op_type != OP_HELEM)
8829 Perl_croak(aTHX_ "exists argument is not a HASH or ARRAY "
8830 "element or a subroutine");
8837 Perl_ck_rvconst(pTHX_ OP *o)
8840 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8842 PERL_ARGS_ASSERT_CK_RVCONST;
8844 o->op_private |= (PL_hints & HINT_STRICT_REFS);
8845 if (o->op_type == OP_RV2CV)
8846 o->op_private &= ~1;
8848 if (kid->op_type == OP_CONST) {
8851 SV * const kidsv = kid->op_sv;
8853 /* Is it a constant from cv_const_sv()? */
8854 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
8855 SV * const rsv = SvRV(kidsv);
8856 const svtype type = SvTYPE(rsv);
8857 const char *badtype = NULL;
8859 switch (o->op_type) {
8861 if (type > SVt_PVMG)
8862 badtype = "a SCALAR";
8865 if (type != SVt_PVAV)
8866 badtype = "an ARRAY";
8869 if (type != SVt_PVHV)
8873 if (type != SVt_PVCV)
8878 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
8881 if (SvTYPE(kidsv) == SVt_PVAV) return o;
8882 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
8883 const char *badthing;
8884 switch (o->op_type) {
8886 badthing = "a SCALAR";
8889 badthing = "an ARRAY";
8892 badthing = "a HASH";
8900 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
8901 SVfARG(kidsv), badthing);
8904 * This is a little tricky. We only want to add the symbol if we
8905 * didn't add it in the lexer. Otherwise we get duplicate strict
8906 * warnings. But if we didn't add it in the lexer, we must at
8907 * least pretend like we wanted to add it even if it existed before,
8908 * or we get possible typo warnings. OPpCONST_ENTERED says
8909 * whether the lexer already added THIS instance of this symbol.
8911 iscv = (o->op_type == OP_RV2CV) * 2;
8913 gv = gv_fetchsv(kidsv,
8914 iscv | !(kid->op_private & OPpCONST_ENTERED),
8917 : o->op_type == OP_RV2SV
8919 : o->op_type == OP_RV2AV
8921 : o->op_type == OP_RV2HV
8924 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
8926 kid->op_type = OP_GV;
8927 SvREFCNT_dec(kid->op_sv);
8929 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
8930 assert (sizeof(PADOP) <= sizeof(SVOP));
8931 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
8932 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
8934 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
8936 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
8938 kid->op_private = 0;
8939 kid->op_ppaddr = PL_ppaddr[OP_GV];
8940 /* FAKE globs in the symbol table cause weird bugs (#77810) */
8948 Perl_ck_ftst(pTHX_ OP *o)
8951 const I32 type = o->op_type;
8953 PERL_ARGS_ASSERT_CK_FTST;
8955 if (o->op_flags & OPf_REF) {
8958 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
8959 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8960 const OPCODE kidtype = kid->op_type;
8962 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)
8963 && !kid->op_folded) {
8964 OP * const newop = newGVOP(type, OPf_REF,
8965 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
8967 op_getmad(o,newop,'O');
8973 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
8974 o->op_private |= OPpFT_ACCESS;
8975 if (PL_check[kidtype] == Perl_ck_ftst
8976 && kidtype != OP_STAT && kidtype != OP_LSTAT) {
8977 o->op_private |= OPpFT_STACKED;
8978 kid->op_private |= OPpFT_STACKING;
8979 if (kidtype == OP_FTTTY && (
8980 !(kid->op_private & OPpFT_STACKED)
8981 || kid->op_private & OPpFT_AFTER_t
8983 o->op_private |= OPpFT_AFTER_t;
8992 if (type == OP_FTTTY)
8993 o = newGVOP(type, OPf_REF, PL_stdingv);
8995 o = newUNOP(type, 0, newDEFSVOP());
8996 op_getmad(oldo,o,'O');
9002 Perl_ck_fun(pTHX_ OP *o)
9005 const int type = o->op_type;
9006 I32 oa = PL_opargs[type] >> OASHIFT;
9008 PERL_ARGS_ASSERT_CK_FUN;
9010 if (o->op_flags & OPf_STACKED) {
9011 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
9014 return no_fh_allowed(o);
9017 if (o->op_flags & OPf_KIDS) {
9018 OP **tokid = &cLISTOPo->op_first;
9019 OP *kid = cLISTOPo->op_first;
9022 bool seen_optional = FALSE;
9024 if (kid->op_type == OP_PUSHMARK ||
9025 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
9027 tokid = &kid->op_sibling;
9028 kid = kid->op_sibling;
9030 if (kid && kid->op_type == OP_COREARGS) {
9031 bool optional = FALSE;
9034 if (oa & OA_OPTIONAL) optional = TRUE;
9037 if (optional) o->op_private |= numargs;
9042 if (oa & OA_OPTIONAL || (oa & 7) == OA_LIST) {
9043 if (!kid && !seen_optional && PL_opargs[type] & OA_DEFGV)
9044 *tokid = kid = newDEFSVOP();
9045 seen_optional = TRUE;
9050 sibl = kid->op_sibling;
9052 if (!sibl && kid->op_type == OP_STUB) {
9059 /* list seen where single (scalar) arg expected? */
9060 if (numargs == 1 && !(oa >> 4)
9061 && kid->op_type == OP_LIST && type != OP_SCALAR)
9063 return too_many_arguments_pv(o,PL_op_desc[type], 0);
9065 if (type != OP_DELETE) scalar(kid);
9076 if ((type == OP_PUSH || type == OP_UNSHIFT)
9077 && !kid->op_sibling)
9078 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
9079 "Useless use of %s with no values",
9082 if (kid->op_type == OP_CONST &&
9083 (kid->op_private & OPpCONST_BARE))
9085 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
9086 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
9087 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9088 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
9089 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
9091 op_getmad(kid,newop,'K');
9096 kid->op_sibling = sibl;
9099 else if (kid->op_type == OP_CONST
9100 && ( !SvROK(cSVOPx_sv(kid))
9101 || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV )
9103 bad_type_pv(numargs, "array", PL_op_desc[type], 0, kid);
9104 /* Defer checks to run-time if we have a scalar arg */
9105 if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV)
9106 op_lvalue(kid, type);
9110 if (kid->op_type == OP_CONST &&
9111 (kid->op_private & OPpCONST_BARE))
9113 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
9114 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
9115 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9116 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
9117 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
9119 op_getmad(kid,newop,'K');
9124 kid->op_sibling = sibl;
9127 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
9128 bad_type_pv(numargs, "hash", PL_op_desc[type], 0, kid);
9129 op_lvalue(kid, type);
9133 OP * const newop = newUNOP(OP_NULL, 0, kid);
9134 kid->op_sibling = 0;
9135 newop->op_next = newop;
9137 kid->op_sibling = sibl;
9142 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
9143 if (kid->op_type == OP_CONST &&
9144 (kid->op_private & OPpCONST_BARE))
9146 OP * const newop = newGVOP(OP_GV, 0,
9147 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
9148 if (!(o->op_private & 1) && /* if not unop */
9149 kid == cLISTOPo->op_last)
9150 cLISTOPo->op_last = newop;
9152 op_getmad(kid,newop,'K');
9158 else if (kid->op_type == OP_READLINE) {
9159 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
9160 bad_type_pv(numargs, "HANDLE", OP_DESC(o), 0, kid);
9163 I32 flags = OPf_SPECIAL;
9167 /* is this op a FH constructor? */
9168 if (is_handle_constructor(o,numargs)) {
9169 const char *name = NULL;
9172 bool want_dollar = TRUE;
9175 /* Set a flag to tell rv2gv to vivify
9176 * need to "prove" flag does not mean something
9177 * else already - NI-S 1999/05/07
9180 if (kid->op_type == OP_PADSV) {
9182 = PAD_COMPNAME_SV(kid->op_targ);
9183 name = SvPV_const(namesv, len);
9184 name_utf8 = SvUTF8(namesv);
9186 else if (kid->op_type == OP_RV2SV
9187 && kUNOP->op_first->op_type == OP_GV)
9189 GV * const gv = cGVOPx_gv(kUNOP->op_first);
9191 len = GvNAMELEN(gv);
9192 name_utf8 = GvNAMEUTF8(gv) ? SVf_UTF8 : 0;
9194 else if (kid->op_type == OP_AELEM
9195 || kid->op_type == OP_HELEM)
9198 OP *op = ((BINOP*)kid)->op_first;
9202 const char * const a =
9203 kid->op_type == OP_AELEM ?
9205 if (((op->op_type == OP_RV2AV) ||
9206 (op->op_type == OP_RV2HV)) &&
9207 (firstop = ((UNOP*)op)->op_first) &&
9208 (firstop->op_type == OP_GV)) {
9209 /* packagevar $a[] or $h{} */
9210 GV * const gv = cGVOPx_gv(firstop);
9218 else if (op->op_type == OP_PADAV
9219 || op->op_type == OP_PADHV) {
9220 /* lexicalvar $a[] or $h{} */
9221 const char * const padname =
9222 PAD_COMPNAME_PV(op->op_targ);
9231 name = SvPV_const(tmpstr, len);
9232 name_utf8 = SvUTF8(tmpstr);
9237 name = "__ANONIO__";
9239 want_dollar = FALSE;
9241 op_lvalue(kid, type);
9245 targ = pad_alloc(OP_RV2GV, SVf_READONLY);
9246 namesv = PAD_SVl(targ);
9247 if (want_dollar && *name != '$')
9248 sv_setpvs(namesv, "$");
9250 sv_setpvs(namesv, "");
9251 sv_catpvn(namesv, name, len);
9252 if ( name_utf8 ) SvUTF8_on(namesv);
9255 kid->op_sibling = 0;
9256 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
9257 kid->op_targ = targ;
9258 kid->op_private |= priv;
9260 kid->op_sibling = sibl;
9266 if ((type == OP_UNDEF || type == OP_POS)
9267 && numargs == 1 && !(oa >> 4)
9268 && kid->op_type == OP_LIST)
9269 return too_many_arguments_pv(o,PL_op_desc[type], 0);
9270 op_lvalue(scalar(kid), type);
9274 tokid = &kid->op_sibling;
9275 kid = kid->op_sibling;
9278 if (kid && kid->op_type != OP_STUB)
9279 return too_many_arguments_pv(o,OP_DESC(o), 0);
9280 o->op_private |= numargs;
9282 /* FIXME - should the numargs move as for the PERL_MAD case? */
9283 o->op_private |= numargs;
9285 return too_many_arguments_pv(o,OP_DESC(o), 0);
9289 else if (PL_opargs[type] & OA_DEFGV) {
9291 OP *newop = newUNOP(type, 0, newDEFSVOP());
9292 op_getmad(o,newop,'O');
9295 /* Ordering of these two is important to keep f_map.t passing. */
9297 return newUNOP(type, 0, newDEFSVOP());
9302 while (oa & OA_OPTIONAL)
9304 if (oa && oa != OA_LIST)
9305 return too_few_arguments_pv(o,OP_DESC(o), 0);
9311 Perl_ck_glob(pTHX_ OP *o)
9316 PERL_ARGS_ASSERT_CK_GLOB;
9319 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
9320 op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */
9322 if (!(o->op_flags & OPf_SPECIAL) && (gv = gv_override("glob", 4)))
9326 * \ null - const(wildcard)
9331 * \ mark - glob - rv2cv
9332 * | \ gv(CORE::GLOBAL::glob)
9334 * \ null - const(wildcard)
9336 o->op_flags |= OPf_SPECIAL;
9337 o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP);
9338 o = S_new_entersubop(aTHX_ gv, o);
9339 o = newUNOP(OP_NULL, 0, o);
9340 o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */
9343 else o->op_flags &= ~OPf_SPECIAL;
9344 #if !defined(PERL_EXTERNAL_GLOB)
9347 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
9348 newSVpvs("File::Glob"), NULL, NULL, NULL);
9351 #endif /* !PERL_EXTERNAL_GLOB */
9352 gv = (GV *)newSV(0);
9353 gv_init(gv, 0, "", 0, 0);
9355 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
9356 SvREFCNT_dec_NN(gv); /* newGVOP increased it */
9362 Perl_ck_grep(pTHX_ OP *o)
9367 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
9370 PERL_ARGS_ASSERT_CK_GREP;
9372 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
9373 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
9375 if (o->op_flags & OPf_STACKED) {
9376 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
9377 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
9378 return no_fh_allowed(o);
9379 o->op_flags &= ~OPf_STACKED;
9381 kid = cLISTOPo->op_first->op_sibling;
9382 if (type == OP_MAPWHILE)
9387 if (PL_parser && PL_parser->error_count)
9389 kid = cLISTOPo->op_first->op_sibling;
9390 if (kid->op_type != OP_NULL)
9391 Perl_croak(aTHX_ "panic: ck_grep, type=%u", (unsigned) kid->op_type);
9392 kid = kUNOP->op_first;
9394 NewOp(1101, gwop, 1, LOGOP);
9395 gwop->op_type = type;
9396 gwop->op_ppaddr = PL_ppaddr[type];
9398 gwop->op_flags |= OPf_KIDS;
9399 gwop->op_other = LINKLIST(kid);
9400 kid->op_next = (OP*)gwop;
9401 offset = pad_findmy_pvs("$_", 0);
9402 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
9403 o->op_private = gwop->op_private = 0;
9404 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
9407 o->op_private = gwop->op_private = OPpGREP_LEX;
9408 gwop->op_targ = o->op_targ = offset;
9411 kid = cLISTOPo->op_first->op_sibling;
9412 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
9413 op_lvalue(kid, OP_GREPSTART);
9419 Perl_ck_index(pTHX_ OP *o)
9421 PERL_ARGS_ASSERT_CK_INDEX;
9423 if (o->op_flags & OPf_KIDS) {
9424 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9426 kid = kid->op_sibling; /* get past "big" */
9427 if (kid && kid->op_type == OP_CONST) {
9428 const bool save_taint = TAINT_get;
9429 SV *sv = kSVOP->op_sv;
9430 if ((!SvPOK(sv) || SvNIOKp(sv)) && SvOK(sv) && !SvROK(sv)) {
9432 sv_copypv(sv, kSVOP->op_sv);
9433 SvREFCNT_dec_NN(kSVOP->op_sv);
9436 if (SvOK(sv)) fbm_compile(sv, 0);
9437 TAINT_set(save_taint);
9438 #ifdef NO_TAINT_SUPPORT
9439 PERL_UNUSED_VAR(save_taint);
9447 Perl_ck_lfun(pTHX_ OP *o)
9449 const OPCODE type = o->op_type;
9451 PERL_ARGS_ASSERT_CK_LFUN;
9453 return modkids(ck_fun(o), type);
9457 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
9459 PERL_ARGS_ASSERT_CK_DEFINED;
9461 if ((o->op_flags & OPf_KIDS)) {
9462 switch (cUNOPo->op_first->op_type) {
9465 case OP_AASSIGN: /* Is this a good idea? */
9466 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9467 "defined(@array) is deprecated");
9468 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9469 "\t(Maybe you should just omit the defined()?)\n");
9473 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9474 "defined(%%hash) is deprecated");
9475 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
9476 "\t(Maybe you should just omit the defined()?)\n");
9487 Perl_ck_readline(pTHX_ OP *o)
9489 PERL_ARGS_ASSERT_CK_READLINE;
9491 if (o->op_flags & OPf_KIDS) {
9492 OP *kid = cLISTOPo->op_first;
9493 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
9497 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
9499 op_getmad(o,newop,'O');
9509 Perl_ck_rfun(pTHX_ OP *o)
9511 const OPCODE type = o->op_type;
9513 PERL_ARGS_ASSERT_CK_RFUN;
9515 return refkids(ck_fun(o), type);
9519 Perl_ck_listiob(pTHX_ OP *o)
9523 PERL_ARGS_ASSERT_CK_LISTIOB;
9525 kid = cLISTOPo->op_first;
9528 kid = cLISTOPo->op_first;
9530 if (kid->op_type == OP_PUSHMARK)
9531 kid = kid->op_sibling;
9532 if (kid && o->op_flags & OPf_STACKED)
9533 kid = kid->op_sibling;
9534 else if (kid && !kid->op_sibling) { /* print HANDLE; */
9535 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE
9536 && !kid->op_folded) {
9537 o->op_flags |= OPf_STACKED; /* make it a filehandle */
9538 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
9539 cLISTOPo->op_first->op_sibling = kid;
9540 cLISTOPo->op_last = kid;
9541 kid = kid->op_sibling;
9546 op_append_elem(o->op_type, o, newDEFSVOP());
9548 if (o->op_type == OP_PRTF) return modkids(listkids(o), OP_PRTF);
9553 Perl_ck_smartmatch(pTHX_ OP *o)
9556 PERL_ARGS_ASSERT_CK_SMARTMATCH;
9557 if (0 == (o->op_flags & OPf_SPECIAL)) {
9558 OP *first = cBINOPo->op_first;
9559 OP *second = first->op_sibling;
9561 /* Implicitly take a reference to an array or hash */
9562 first->op_sibling = NULL;
9563 first = cBINOPo->op_first = ref_array_or_hash(first);
9564 second = first->op_sibling = ref_array_or_hash(second);
9566 /* Implicitly take a reference to a regular expression */
9567 if (first->op_type == OP_MATCH) {
9568 first->op_type = OP_QR;
9569 first->op_ppaddr = PL_ppaddr[OP_QR];
9571 if (second->op_type == OP_MATCH) {
9572 second->op_type = OP_QR;
9573 second->op_ppaddr = PL_ppaddr[OP_QR];
9582 Perl_ck_sassign(pTHX_ OP *o)
9585 OP * const kid = cLISTOPo->op_first;
9587 PERL_ARGS_ASSERT_CK_SASSIGN;
9589 /* has a disposable target? */
9590 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
9591 && !(kid->op_flags & OPf_STACKED)
9592 /* Cannot steal the second time! */
9593 && !(kid->op_private & OPpTARGET_MY)
9594 /* Keep the full thing for madskills */
9598 OP * const kkid = kid->op_sibling;
9600 /* Can just relocate the target. */
9601 if (kkid && kkid->op_type == OP_PADSV
9602 && !(kkid->op_private & OPpLVAL_INTRO))
9604 kid->op_targ = kkid->op_targ;
9606 /* Now we do not need PADSV and SASSIGN. */
9607 kid->op_sibling = o->op_sibling; /* NULL */
9608 cLISTOPo->op_first = NULL;
9611 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
9615 if (kid->op_sibling) {
9616 OP *kkid = kid->op_sibling;
9617 /* For state variable assignment, kkid is a list op whose op_last
9619 if ((kkid->op_type == OP_PADSV ||
9620 (kkid->op_type == OP_LIST &&
9621 (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV
9624 && (kkid->op_private & OPpLVAL_INTRO)
9625 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
9626 const PADOFFSET target = kkid->op_targ;
9627 OP *const other = newOP(OP_PADSV,
9629 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
9630 OP *const first = newOP(OP_NULL, 0);
9631 OP *const nullop = newCONDOP(0, first, o, other);
9632 OP *const condop = first->op_next;
9633 /* hijacking PADSTALE for uninitialized state variables */
9634 SvPADSTALE_on(PAD_SVl(target));
9636 condop->op_type = OP_ONCE;
9637 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
9638 condop->op_targ = target;
9639 other->op_targ = target;
9641 /* Because we change the type of the op here, we will skip the
9642 assignment binop->op_last = binop->op_first->op_sibling; at the
9643 end of Perl_newBINOP(). So need to do it here. */
9644 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
9653 Perl_ck_match(pTHX_ OP *o)
9657 PERL_ARGS_ASSERT_CK_MATCH;
9659 if (o->op_type != OP_QR && PL_compcv) {
9660 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
9661 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
9662 o->op_targ = offset;
9663 o->op_private |= OPpTARGET_MY;
9666 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
9667 o->op_private |= OPpRUNTIME;
9672 Perl_ck_method(pTHX_ OP *o)
9674 OP * const kid = cUNOPo->op_first;
9676 PERL_ARGS_ASSERT_CK_METHOD;
9678 if (kid->op_type == OP_CONST) {
9679 SV* sv = kSVOP->op_sv;
9680 const char * const method = SvPVX_const(sv);
9681 if (!(strchr(method, ':') || strchr(method, '\''))) {
9683 if (!SvIsCOW_shared_hash(sv)) {
9684 sv = newSVpvn_share(method, SvUTF8(sv) ? -(I32)SvCUR(sv) : (I32)SvCUR(sv), 0);
9687 kSVOP->op_sv = NULL;
9689 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
9691 op_getmad(o,cmop,'O');
9702 Perl_ck_null(pTHX_ OP *o)
9704 PERL_ARGS_ASSERT_CK_NULL;
9705 PERL_UNUSED_CONTEXT;
9710 Perl_ck_open(pTHX_ OP *o)
9714 PERL_ARGS_ASSERT_CK_OPEN;
9716 S_io_hints(aTHX_ o);
9718 /* In case of three-arg dup open remove strictness
9719 * from the last arg if it is a bareword. */
9720 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
9721 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
9725 if ((last->op_type == OP_CONST) && /* The bareword. */
9726 (last->op_private & OPpCONST_BARE) &&
9727 (last->op_private & OPpCONST_STRICT) &&
9728 (oa = first->op_sibling) && /* The fh. */
9729 (oa = oa->op_sibling) && /* The mode. */
9730 (oa->op_type == OP_CONST) &&
9731 SvPOK(((SVOP*)oa)->op_sv) &&
9732 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
9733 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
9734 (last == oa->op_sibling)) /* The bareword. */
9735 last->op_private &= ~OPpCONST_STRICT;
9741 Perl_ck_repeat(pTHX_ OP *o)
9743 PERL_ARGS_ASSERT_CK_REPEAT;
9745 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
9746 o->op_private |= OPpREPEAT_DOLIST;
9747 cBINOPo->op_first = force_list(cBINOPo->op_first);
9755 Perl_ck_require(pTHX_ OP *o)
9760 PERL_ARGS_ASSERT_CK_REQUIRE;
9762 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
9763 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9765 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
9766 SV * const sv = kid->op_sv;
9767 U32 was_readonly = SvREADONLY(sv);
9775 if (SvIsCOW(sv)) sv_force_normal_flags(sv, 0);
9780 for (; s < end; s++) {
9781 if (*s == ':' && s[1] == ':') {
9783 Move(s+2, s+1, end - s - 1, char);
9788 sv_catpvs(sv, ".pm");
9789 SvFLAGS(sv) |= was_readonly;
9793 if (!(o->op_flags & OPf_SPECIAL) /* Wasn't written as CORE::require */
9794 /* handle override, if any */
9795 && (gv = gv_override("require", 7))) {
9797 if (o->op_flags & OPf_KIDS) {
9798 kid = cUNOPo->op_first;
9799 cUNOPo->op_first = NULL;
9807 newop = S_new_entersubop(aTHX_ gv, kid);
9808 op_getmad(o,newop,'O');
9812 return scalar(ck_fun(o));
9816 Perl_ck_return(pTHX_ OP *o)
9821 PERL_ARGS_ASSERT_CK_RETURN;
9823 kid = cLISTOPo->op_first->op_sibling;
9824 if (CvLVALUE(PL_compcv)) {
9825 for (; kid; kid = kid->op_sibling)
9826 op_lvalue(kid, OP_LEAVESUBLV);
9833 Perl_ck_select(pTHX_ OP *o)
9838 PERL_ARGS_ASSERT_CK_SELECT;
9840 if (o->op_flags & OPf_KIDS) {
9841 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9842 if (kid && kid->op_sibling) {
9843 o->op_type = OP_SSELECT;
9844 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
9846 return fold_constants(op_integerize(op_std_init(o)));
9850 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9851 if (kid && kid->op_type == OP_RV2GV)
9852 kid->op_private &= ~HINT_STRICT_REFS;
9857 Perl_ck_shift(pTHX_ OP *o)
9860 const I32 type = o->op_type;
9862 PERL_ARGS_ASSERT_CK_SHIFT;
9864 if (!(o->op_flags & OPf_KIDS)) {
9867 if (!CvUNIQUE(PL_compcv)) {
9868 o->op_flags |= OPf_SPECIAL;
9872 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
9875 OP * const oldo = o;
9876 o = newUNOP(type, 0, scalar(argop));
9877 op_getmad(oldo,o,'O');
9882 return newUNOP(type, 0, scalar(argop));
9885 return scalar(ck_fun(o));
9889 Perl_ck_sort(pTHX_ OP *o)
9895 PL_hints & HINT_LOCALIZE_HH ? GvHV(PL_hintgv) : NULL;
9898 PERL_ARGS_ASSERT_CK_SORT;
9901 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
9903 const I32 sorthints = (I32)SvIV(*svp);
9904 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
9905 o->op_private |= OPpSORT_QSORT;
9906 if ((sorthints & HINT_SORT_STABLE) != 0)
9907 o->op_private |= OPpSORT_STABLE;
9911 if (o->op_flags & OPf_STACKED)
9913 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9914 if ((stacked = o->op_flags & OPf_STACKED)) { /* may have been cleared */
9915 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
9917 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
9919 if (kid->op_type == OP_LEAVE)
9920 op_null(kid); /* wipe out leave */
9921 /* Prevent execution from escaping out of the sort block. */
9924 /* provide scalar context for comparison function/block */
9925 kid = scalar(firstkid);
9927 o->op_flags |= OPf_SPECIAL;
9930 firstkid = firstkid->op_sibling;
9933 for (kid = firstkid; kid; kid = kid->op_sibling) {
9934 /* provide list context for arguments */
9937 op_lvalue(kid, OP_GREPSTART);
9944 S_simplify_sort(pTHX_ OP *o)
9947 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9954 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
9956 kid = kUNOP->op_first; /* get past null */
9957 if (!(have_scopeop = kid->op_type == OP_SCOPE)
9958 && kid->op_type != OP_LEAVE)
9960 kid = kLISTOP->op_last; /* get past scope */
9961 switch(kid->op_type) {
9965 if (!have_scopeop) goto padkids;
9970 k = kid; /* remember this node*/
9971 if (kBINOP->op_first->op_type != OP_RV2SV
9972 || kBINOP->op_last ->op_type != OP_RV2SV)
9975 Warn about my($a) or my($b) in a sort block, *if* $a or $b is
9976 then used in a comparison. This catches most, but not
9977 all cases. For instance, it catches
9978 sort { my($a); $a <=> $b }
9980 sort { my($a); $a < $b ? -1 : $a == $b ? 0 : 1; }
9981 (although why you'd do that is anyone's guess).
9985 if (!ckWARN(WARN_SYNTAX)) return;
9986 kid = kBINOP->op_first;
9988 if (kid->op_type == OP_PADSV) {
9989 SV * const name = AvARRAY(PL_comppad_name)[kid->op_targ];
9990 if (SvCUR(name) == 2 && *SvPVX(name) == '$'
9991 && (SvPVX(name)[1] == 'a' || SvPVX(name)[1] == 'b'))
9992 /* diag_listed_as: "my %s" used in sort comparison */
9993 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9994 "\"%s %s\" used in sort comparison",
9995 SvPAD_STATE(name) ? "state" : "my",
9998 } while ((kid = kid->op_sibling));
10001 kid = kBINOP->op_first; /* get past cmp */
10002 if (kUNOP->op_first->op_type != OP_GV)
10004 kid = kUNOP->op_first; /* get past rv2sv */
10006 if (GvSTASH(gv) != PL_curstash)
10008 gvname = GvNAME(gv);
10009 if (*gvname == 'a' && gvname[1] == '\0')
10011 else if (*gvname == 'b' && gvname[1] == '\0')
10016 kid = k; /* back to cmp */
10017 /* already checked above that it is rv2sv */
10018 kid = kBINOP->op_last; /* down to 2nd arg */
10019 if (kUNOP->op_first->op_type != OP_GV)
10021 kid = kUNOP->op_first; /* get past rv2sv */
10023 if (GvSTASH(gv) != PL_curstash)
10025 gvname = GvNAME(gv);
10027 ? !(*gvname == 'a' && gvname[1] == '\0')
10028 : !(*gvname == 'b' && gvname[1] == '\0'))
10030 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
10032 o->op_private |= OPpSORT_DESCEND;
10033 if (k->op_type == OP_NCMP)
10034 o->op_private |= OPpSORT_NUMERIC;
10035 if (k->op_type == OP_I_NCMP)
10036 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
10037 kid = cLISTOPo->op_first->op_sibling;
10038 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
10040 op_getmad(kid,o,'S'); /* then delete it */
10042 op_free(kid); /* then delete it */
10047 Perl_ck_split(pTHX_ OP *o)
10052 PERL_ARGS_ASSERT_CK_SPLIT;
10054 if (o->op_flags & OPf_STACKED)
10055 return no_fh_allowed(o);
10057 kid = cLISTOPo->op_first;
10058 if (kid->op_type != OP_NULL)
10059 Perl_croak(aTHX_ "panic: ck_split, type=%u", (unsigned) kid->op_type);
10060 kid = kid->op_sibling;
10061 op_free(cLISTOPo->op_first);
10063 cLISTOPo->op_first = kid;
10065 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
10066 cLISTOPo->op_last = kid; /* There was only one element previously */
10069 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
10070 OP * const sibl = kid->op_sibling;
10071 kid->op_sibling = 0;
10072 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0, 0); /* OPf_SPECIAL is used to trigger split " " behavior */
10073 if (cLISTOPo->op_first == cLISTOPo->op_last)
10074 cLISTOPo->op_last = kid;
10075 cLISTOPo->op_first = kid;
10076 kid->op_sibling = sibl;
10079 kid->op_type = OP_PUSHRE;
10080 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
10082 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
10083 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
10084 "Use of /g modifier is meaningless in split");
10087 if (!kid->op_sibling)
10088 op_append_elem(OP_SPLIT, o, newDEFSVOP());
10090 kid = kid->op_sibling;
10093 if (!kid->op_sibling)
10095 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
10096 o->op_private |= OPpSPLIT_IMPLIM;
10098 assert(kid->op_sibling);
10100 kid = kid->op_sibling;
10103 if (kid->op_sibling)
10104 return too_many_arguments_pv(o,OP_DESC(o), 0);
10110 Perl_ck_join(pTHX_ OP *o)
10112 const OP * const kid = cLISTOPo->op_first->op_sibling;
10114 PERL_ARGS_ASSERT_CK_JOIN;
10116 if (kid && kid->op_type == OP_MATCH) {
10117 if (ckWARN(WARN_SYNTAX)) {
10118 const REGEXP *re = PM_GETRE(kPMOP);
10120 ? newSVpvn_flags( RX_PRECOMP_const(re), RX_PRELEN(re),
10121 SVs_TEMP | ( RX_UTF8(re) ? SVf_UTF8 : 0 ) )
10122 : newSVpvs_flags( "STRING", SVs_TEMP );
10123 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10124 "/%"SVf"/ should probably be written as \"%"SVf"\"",
10125 SVfARG(msg), SVfARG(msg));
10132 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
10134 Examines an op, which is expected to identify a subroutine at runtime,
10135 and attempts to determine at compile time which subroutine it identifies.
10136 This is normally used during Perl compilation to determine whether
10137 a prototype can be applied to a function call. I<cvop> is the op
10138 being considered, normally an C<rv2cv> op. A pointer to the identified
10139 subroutine is returned, if it could be determined statically, and a null
10140 pointer is returned if it was not possible to determine statically.
10142 Currently, the subroutine can be identified statically if the RV that the
10143 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
10144 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
10145 suitable if the constant value must be an RV pointing to a CV. Details of
10146 this process may change in future versions of Perl. If the C<rv2cv> op
10147 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
10148 the subroutine statically: this flag is used to suppress compile-time
10149 magic on a subroutine call, forcing it to use default runtime behaviour.
10151 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
10152 of a GV reference is modified. If a GV was examined and its CV slot was
10153 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
10154 If the op is not optimised away, and the CV slot is later populated with
10155 a subroutine having a prototype, that flag eventually triggers the warning
10156 "called too early to check prototype".
10158 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
10159 of returning a pointer to the subroutine it returns a pointer to the
10160 GV giving the most appropriate name for the subroutine in this context.
10161 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
10162 (C<CvANON>) subroutine that is referenced through a GV it will be the
10163 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
10164 A null pointer is returned as usual if there is no statically-determinable
10170 /* shared by toke.c:yylex */
10172 Perl_find_lexical_cv(pTHX_ PADOFFSET off)
10174 PADNAME *name = PAD_COMPNAME(off);
10175 CV *compcv = PL_compcv;
10176 while (PadnameOUTER(name)) {
10177 assert(PARENT_PAD_INDEX(name));
10178 compcv = CvOUTSIDE(PL_compcv);
10179 name = PadlistNAMESARRAY(CvPADLIST(compcv))
10180 [off = PARENT_PAD_INDEX(name)];
10182 assert(!PadnameIsOUR(name));
10183 if (!PadnameIsSTATE(name) && SvMAGICAL(name)) {
10184 MAGIC * mg = mg_find(name, PERL_MAGIC_proto);
10186 assert(mg->mg_obj);
10187 return (CV *)mg->mg_obj;
10189 return (CV *)AvARRAY(PadlistARRAY(CvPADLIST(compcv))[1])[off];
10193 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
10198 PERL_ARGS_ASSERT_RV2CV_OP_CV;
10199 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
10200 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
10201 if (cvop->op_type != OP_RV2CV)
10203 if (cvop->op_private & OPpENTERSUB_AMPER)
10205 if (!(cvop->op_flags & OPf_KIDS))
10207 rvop = cUNOPx(cvop)->op_first;
10208 switch (rvop->op_type) {
10210 gv = cGVOPx_gv(rvop);
10213 if (flags & RV2CVOPCV_MARK_EARLY)
10214 rvop->op_private |= OPpEARLY_CV;
10219 SV *rv = cSVOPx_sv(rvop);
10222 cv = (CV*)SvRV(rv);
10226 cv = find_lexical_cv(rvop->op_targ);
10233 if (SvTYPE((SV*)cv) != SVt_PVCV)
10235 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
10236 if (!CvANON(cv) || !gv)
10245 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
10247 Performs the default fixup of the arguments part of an C<entersub>
10248 op tree. This consists of applying list context to each of the
10249 argument ops. This is the standard treatment used on a call marked
10250 with C<&>, or a method call, or a call through a subroutine reference,
10251 or any other call where the callee can't be identified at compile time,
10252 or a call where the callee has no prototype.
10258 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
10261 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
10262 aop = cUNOPx(entersubop)->op_first;
10263 if (!aop->op_sibling)
10264 aop = cUNOPx(aop)->op_first;
10265 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
10266 if (!(PL_madskills && aop->op_type == OP_STUB)) {
10268 op_lvalue(aop, OP_ENTERSUB);
10275 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
10277 Performs the fixup of the arguments part of an C<entersub> op tree
10278 based on a subroutine prototype. This makes various modifications to
10279 the argument ops, from applying context up to inserting C<refgen> ops,
10280 and checking the number and syntactic types of arguments, as directed by
10281 the prototype. This is the standard treatment used on a subroutine call,
10282 not marked with C<&>, where the callee can be identified at compile time
10283 and has a prototype.
10285 I<protosv> supplies the subroutine prototype to be applied to the call.
10286 It may be a normal defined scalar, of which the string value will be used.
10287 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
10288 that has been cast to C<SV*>) which has a prototype. The prototype
10289 supplied, in whichever form, does not need to match the actual callee
10290 referenced by the op tree.
10292 If the argument ops disagree with the prototype, for example by having
10293 an unacceptable number of arguments, a valid op tree is returned anyway.
10294 The error is reflected in the parser state, normally resulting in a single
10295 exception at the top level of parsing which covers all the compilation
10296 errors that occurred. In the error message, the callee is referred to
10297 by the name defined by the I<namegv> parameter.
10303 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
10306 const char *proto, *proto_end;
10307 OP *aop, *prev, *cvop;
10310 I32 contextclass = 0;
10311 const char *e = NULL;
10312 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
10313 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
10314 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto, "
10315 "flags=%lx", (unsigned long) SvFLAGS(protosv));
10316 if (SvTYPE(protosv) == SVt_PVCV)
10317 proto = CvPROTO(protosv), proto_len = CvPROTOLEN(protosv);
10318 else proto = SvPV(protosv, proto_len);
10319 proto = S_strip_spaces(aTHX_ proto, &proto_len);
10320 proto_end = proto + proto_len;
10321 aop = cUNOPx(entersubop)->op_first;
10322 if (!aop->op_sibling)
10323 aop = cUNOPx(aop)->op_first;
10325 aop = aop->op_sibling;
10326 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10327 while (aop != cvop) {
10329 if (PL_madskills && aop->op_type == OP_STUB) {
10330 aop = aop->op_sibling;
10333 if (PL_madskills && aop->op_type == OP_NULL)
10334 o3 = ((UNOP*)aop)->op_first;
10338 if (proto >= proto_end)
10339 return too_many_arguments_sv(entersubop, gv_ename(namegv), 0);
10347 /* _ must be at the end */
10348 if (proto[1] && !strchr(";@%", proto[1]))
10363 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
10365 arg == 1 ? "block or sub {}" : "sub {}",
10369 /* '*' allows any scalar type, including bareword */
10372 if (o3->op_type == OP_RV2GV)
10373 goto wrapref; /* autoconvert GLOB -> GLOBref */
10374 else if (o3->op_type == OP_CONST)
10375 o3->op_private &= ~OPpCONST_STRICT;
10376 else if (o3->op_type == OP_ENTERSUB) {
10377 /* accidental subroutine, revert to bareword */
10378 OP *gvop = ((UNOP*)o3)->op_first;
10379 if (gvop && gvop->op_type == OP_NULL) {
10380 gvop = ((UNOP*)gvop)->op_first;
10382 for (; gvop->op_sibling; gvop = gvop->op_sibling)
10385 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
10386 (gvop = ((UNOP*)gvop)->op_first) &&
10387 gvop->op_type == OP_GV)
10389 GV * const gv = cGVOPx_gv(gvop);
10390 OP * const sibling = aop->op_sibling;
10391 SV * const n = newSVpvs("");
10393 OP * const oldaop = aop;
10397 gv_fullname4(n, gv, "", FALSE);
10398 aop = newSVOP(OP_CONST, 0, n);
10399 op_getmad(oldaop,aop,'O');
10400 prev->op_sibling = aop;
10401 aop->op_sibling = sibling;
10411 if (o3->op_type == OP_RV2AV ||
10412 o3->op_type == OP_PADAV ||
10413 o3->op_type == OP_RV2HV ||
10414 o3->op_type == OP_PADHV
10420 case '[': case ']':
10427 switch (*proto++) {
10429 if (contextclass++ == 0) {
10430 e = strchr(proto, ']');
10431 if (!e || e == proto)
10439 if (contextclass) {
10440 const char *p = proto;
10441 const char *const end = proto;
10443 while (*--p != '[')
10444 /* \[$] accepts any scalar lvalue */
10446 && Perl_op_lvalue_flags(aTHX_
10448 OP_READ, /* not entersub */
10451 bad_type_gv(arg, Perl_form(aTHX_ "one of %.*s",
10452 (int)(end - p), p),
10458 if (o3->op_type == OP_RV2GV)
10461 bad_type_gv(arg, "symbol", namegv, 0, o3);
10464 if (o3->op_type == OP_ENTERSUB)
10467 bad_type_gv(arg, "subroutine entry", namegv, 0,
10471 if (o3->op_type == OP_RV2SV ||
10472 o3->op_type == OP_PADSV ||
10473 o3->op_type == OP_HELEM ||
10474 o3->op_type == OP_AELEM)
10476 if (!contextclass) {
10477 /* \$ accepts any scalar lvalue */
10478 if (Perl_op_lvalue_flags(aTHX_
10480 OP_READ, /* not entersub */
10483 bad_type_gv(arg, "scalar", namegv, 0, o3);
10487 if (o3->op_type == OP_RV2AV ||
10488 o3->op_type == OP_PADAV)
10491 bad_type_gv(arg, "array", namegv, 0, o3);
10494 if (o3->op_type == OP_RV2HV ||
10495 o3->op_type == OP_PADHV)
10498 bad_type_gv(arg, "hash", namegv, 0, o3);
10502 OP* const kid = aop;
10503 OP* const sib = kid->op_sibling;
10504 kid->op_sibling = 0;
10505 aop = newUNOP(OP_REFGEN, 0, kid);
10506 aop->op_sibling = sib;
10507 prev->op_sibling = aop;
10509 if (contextclass && e) {
10514 default: goto oops;
10524 SV* const tmpsv = sv_newmortal();
10525 gv_efullname3(tmpsv, namegv, NULL);
10526 Perl_croak(aTHX_ "Malformed prototype for %"SVf": %"SVf,
10527 SVfARG(tmpsv), SVfARG(protosv));
10531 op_lvalue(aop, OP_ENTERSUB);
10533 aop = aop->op_sibling;
10535 if (aop == cvop && *proto == '_') {
10536 /* generate an access to $_ */
10537 aop = newDEFSVOP();
10538 aop->op_sibling = prev->op_sibling;
10539 prev->op_sibling = aop; /* instead of cvop */
10541 if (!optional && proto_end > proto &&
10542 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
10543 return too_few_arguments_sv(entersubop, gv_ename(namegv), 0);
10548 =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv
10550 Performs the fixup of the arguments part of an C<entersub> op tree either
10551 based on a subroutine prototype or using default list-context processing.
10552 This is the standard treatment used on a subroutine call, not marked
10553 with C<&>, where the callee can be identified at compile time.
10555 I<protosv> supplies the subroutine prototype to be applied to the call,
10556 or indicates that there is no prototype. It may be a normal scalar,
10557 in which case if it is defined then the string value will be used
10558 as a prototype, and if it is undefined then there is no prototype.
10559 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
10560 that has been cast to C<SV*>), of which the prototype will be used if it
10561 has one. The prototype (or lack thereof) supplied, in whichever form,
10562 does not need to match the actual callee referenced by the op tree.
10564 If the argument ops disagree with the prototype, for example by having
10565 an unacceptable number of arguments, a valid op tree is returned anyway.
10566 The error is reflected in the parser state, normally resulting in a single
10567 exception at the top level of parsing which covers all the compilation
10568 errors that occurred. In the error message, the callee is referred to
10569 by the name defined by the I<namegv> parameter.
10575 Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop,
10576 GV *namegv, SV *protosv)
10578 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST;
10579 if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv))
10580 return ck_entersub_args_proto(entersubop, namegv, protosv);
10582 return ck_entersub_args_list(entersubop);
10586 Perl_ck_entersub_args_core(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
10588 int opnum = SvTYPE(protosv) == SVt_PVCV ? 0 : (int)SvUV(protosv);
10589 OP *aop = cUNOPx(entersubop)->op_first;
10591 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_CORE;
10595 if (!aop->op_sibling)
10596 aop = cUNOPx(aop)->op_first;
10597 aop = aop->op_sibling;
10598 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10599 if (PL_madskills) while (aop != cvop && aop->op_type == OP_STUB) {
10600 aop = aop->op_sibling;
10603 (void)too_many_arguments_pv(entersubop, GvNAME(namegv), 0);
10605 op_free(entersubop);
10606 switch(GvNAME(namegv)[2]) {
10607 case 'F': return newSVOP(OP_CONST, 0,
10608 newSVpv(CopFILE(PL_curcop),0));
10609 case 'L': return newSVOP(
10611 Perl_newSVpvf(aTHX_
10612 "%"IVdf, (IV)CopLINE(PL_curcop)
10615 case 'P': return newSVOP(OP_CONST, 0,
10617 ? newSVhek(HvNAME_HEK(PL_curstash))
10628 bool seenarg = FALSE;
10630 if (!aop->op_sibling)
10631 aop = cUNOPx(aop)->op_first;
10634 aop = aop->op_sibling;
10635 prev->op_sibling = NULL;
10638 prev=cvop, cvop = cvop->op_sibling)
10640 if (PL_madskills && cvop->op_sibling
10641 && cvop->op_type != OP_STUB) seenarg = TRUE
10644 prev->op_sibling = NULL;
10645 flags = OPf_SPECIAL * !(cvop->op_private & OPpENTERSUB_NOPAREN);
10647 if (aop == cvop) aop = NULL;
10648 op_free(entersubop);
10650 if (opnum == OP_ENTEREVAL
10651 && GvNAMELEN(namegv)==9 && strnEQ(GvNAME(namegv), "evalbytes", 9))
10652 flags |= OPpEVAL_BYTES <<8;
10654 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
10656 case OA_BASEOP_OR_UNOP:
10657 case OA_FILESTATOP:
10658 return aop ? newUNOP(opnum,flags,aop) : newOP(opnum,flags);
10662 if (!PL_madskills || seenarg)
10664 (void)too_many_arguments_pv(aop, GvNAME(namegv), 0);
10667 return opnum == OP_RUNCV
10668 ? newPVOP(OP_RUNCV,0,NULL)
10671 return convert(opnum,0,aop);
10679 =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p
10681 Retrieves the function that will be used to fix up a call to I<cv>.
10682 Specifically, the function is applied to an C<entersub> op tree for a
10683 subroutine call, not marked with C<&>, where the callee can be identified
10684 at compile time as I<cv>.
10686 The C-level function pointer is returned in I<*ckfun_p>, and an SV
10687 argument for it is returned in I<*ckobj_p>. The function is intended
10688 to be called in this manner:
10690 entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p));
10692 In this call, I<entersubop> is a pointer to the C<entersub> op,
10693 which may be replaced by the check function, and I<namegv> is a GV
10694 supplying the name that should be used by the check function to refer
10695 to the callee of the C<entersub> op if it needs to emit any diagnostics.
10696 It is permitted to apply the check function in non-standard situations,
10697 such as to a call to a different subroutine or to a method call.
10699 By default, the function is
10700 L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>,
10701 and the SV parameter is I<cv> itself. This implements standard
10702 prototype processing. It can be changed, for a particular subroutine,
10703 by L</cv_set_call_checker>.
10709 Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p)
10712 PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER;
10713 callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL;
10715 *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr);
10716 *ckobj_p = callmg->mg_obj;
10718 *ckfun_p = Perl_ck_entersub_args_proto_or_list;
10719 *ckobj_p = (SV*)cv;
10724 =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj
10726 Sets the function that will be used to fix up a call to I<cv>.
10727 Specifically, the function is applied to an C<entersub> op tree for a
10728 subroutine call, not marked with C<&>, where the callee can be identified
10729 at compile time as I<cv>.
10731 The C-level function pointer is supplied in I<ckfun>, and an SV argument
10732 for it is supplied in I<ckobj>. The function is intended to be called
10735 entersubop = ckfun(aTHX_ entersubop, namegv, ckobj);
10737 In this call, I<entersubop> is a pointer to the C<entersub> op,
10738 which may be replaced by the check function, and I<namegv> is a GV
10739 supplying the name that should be used by the check function to refer
10740 to the callee of the C<entersub> op if it needs to emit any diagnostics.
10741 It is permitted to apply the check function in non-standard situations,
10742 such as to a call to a different subroutine or to a method call.
10744 The current setting for a particular CV can be retrieved by
10745 L</cv_get_call_checker>.
10751 Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj)
10753 PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER;
10754 if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) {
10755 if (SvMAGICAL((SV*)cv))
10756 mg_free_type((SV*)cv, PERL_MAGIC_checkcall);
10759 sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0);
10760 callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall);
10761 if (callmg->mg_flags & MGf_REFCOUNTED) {
10762 SvREFCNT_dec(callmg->mg_obj);
10763 callmg->mg_flags &= ~MGf_REFCOUNTED;
10765 callmg->mg_ptr = FPTR2DPTR(char *, ckfun);
10766 callmg->mg_obj = ckobj;
10767 if (ckobj != (SV*)cv) {
10768 SvREFCNT_inc_simple_void_NN(ckobj);
10769 callmg->mg_flags |= MGf_REFCOUNTED;
10771 callmg->mg_flags |= MGf_COPY;
10776 Perl_ck_subr(pTHX_ OP *o)
10782 PERL_ARGS_ASSERT_CK_SUBR;
10784 aop = cUNOPx(o)->op_first;
10785 if (!aop->op_sibling)
10786 aop = cUNOPx(aop)->op_first;
10787 aop = aop->op_sibling;
10788 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
10789 cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY);
10790 namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL;
10792 o->op_private &= ~1;
10793 o->op_private |= OPpENTERSUB_HASTARG;
10794 o->op_private |= (PL_hints & HINT_STRICT_REFS);
10795 if (PERLDB_SUB && PL_curstash != PL_debstash)
10796 o->op_private |= OPpENTERSUB_DB;
10797 if (cvop->op_type == OP_RV2CV) {
10798 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
10800 } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
10801 if (aop->op_type == OP_CONST)
10802 aop->op_private &= ~OPpCONST_STRICT;
10803 else if (aop->op_type == OP_LIST) {
10804 OP * const sib = ((UNOP*)aop)->op_first->op_sibling;
10805 if (sib && sib->op_type == OP_CONST)
10806 sib->op_private &= ~OPpCONST_STRICT;
10811 return ck_entersub_args_list(o);
10813 Perl_call_checker ckfun;
10815 cv_get_call_checker(cv, &ckfun, &ckobj);
10816 if (!namegv) { /* expletive! */
10817 /* XXX The call checker API is public. And it guarantees that
10818 a GV will be provided with the right name. So we have
10819 to create a GV. But it is still not correct, as its
10820 stringification will include the package. What we
10821 really need is a new call checker API that accepts a
10822 GV or string (or GV or CV). */
10823 HEK * const hek = CvNAME_HEK(cv);
10824 /* After a syntax error in a lexical sub, the cv that
10825 rv2cv_op_cv returns may be a nameless stub. */
10826 if (!hek) return ck_entersub_args_list(o);;
10827 namegv = (GV *)sv_newmortal();
10828 gv_init_pvn(namegv, PL_curstash, HEK_KEY(hek), HEK_LEN(hek),
10829 SVf_UTF8 * !!HEK_UTF8(hek));
10831 return ckfun(aTHX_ o, namegv, ckobj);
10836 Perl_ck_svconst(pTHX_ OP *o)
10838 SV * const sv = cSVOPo->op_sv;
10839 PERL_ARGS_ASSERT_CK_SVCONST;
10840 PERL_UNUSED_CONTEXT;
10841 #ifdef PERL_OLD_COPY_ON_WRITE
10842 if (SvIsCOW(sv)) sv_force_normal(sv);
10843 #elif defined(PERL_NEW_COPY_ON_WRITE)
10844 /* Since the read-only flag may be used to protect a string buffer, we
10845 cannot do copy-on-write with existing read-only scalars that are not
10846 already copy-on-write scalars. To allow $_ = "hello" to do COW with
10847 that constant, mark the constant as COWable here, if it is not
10848 already read-only. */
10849 if (!SvREADONLY(sv) && !SvIsCOW(sv) && SvCANCOW(sv)) {
10859 Perl_ck_trunc(pTHX_ OP *o)
10861 PERL_ARGS_ASSERT_CK_TRUNC;
10863 if (o->op_flags & OPf_KIDS) {
10864 SVOP *kid = (SVOP*)cUNOPo->op_first;
10866 if (kid->op_type == OP_NULL)
10867 kid = (SVOP*)kid->op_sibling;
10868 if (kid && kid->op_type == OP_CONST &&
10869 (kid->op_private & OPpCONST_BARE) &&
10872 o->op_flags |= OPf_SPECIAL;
10873 kid->op_private &= ~OPpCONST_STRICT;
10880 Perl_ck_substr(pTHX_ OP *o)
10882 PERL_ARGS_ASSERT_CK_SUBSTR;
10885 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
10886 OP *kid = cLISTOPo->op_first;
10888 if (kid->op_type == OP_NULL)
10889 kid = kid->op_sibling;
10891 kid->op_flags |= OPf_MOD;
10898 Perl_ck_tell(pTHX_ OP *o)
10900 PERL_ARGS_ASSERT_CK_TELL;
10902 if (o->op_flags & OPf_KIDS) {
10903 OP *kid = cLISTOPo->op_first;
10904 if (kid->op_type == OP_NULL && kid->op_sibling) kid = kid->op_sibling;
10905 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
10911 Perl_ck_each(pTHX_ OP *o)
10914 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
10915 const unsigned orig_type = o->op_type;
10916 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
10917 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
10918 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
10919 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
10921 PERL_ARGS_ASSERT_CK_EACH;
10924 switch (kid->op_type) {
10930 CHANGE_TYPE(o, array_type);
10933 if (kid->op_private == OPpCONST_BARE
10934 || !SvROK(cSVOPx_sv(kid))
10935 || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV
10936 && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV )
10938 /* we let ck_fun handle it */
10941 CHANGE_TYPE(o, ref_type);
10945 /* if treating as a reference, defer additional checks to runtime */
10946 return o->op_type == ref_type ? o : ck_fun(o);
10950 Perl_ck_length(pTHX_ OP *o)
10952 PERL_ARGS_ASSERT_CK_LENGTH;
10956 if (ckWARN(WARN_SYNTAX)) {
10957 const OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
10961 const bool hash = kid->op_type == OP_PADHV
10962 || kid->op_type == OP_RV2HV;
10963 switch (kid->op_type) {
10968 name = S_op_varname(aTHX_ kid);
10974 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10975 "length() used on %"SVf" (did you mean \"scalar(%s%"SVf
10977 name, hash ? "keys " : "", name
10980 /* diag_listed_as: length() used on %s (did you mean "scalar(%s)"?) */
10981 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10982 "length() used on %%hash (did you mean \"scalar(keys %%hash)\"?)");
10984 /* diag_listed_as: length() used on %s (did you mean "scalar(%s)"?) */
10985 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10986 "length() used on @array (did you mean \"scalar(@array)\"?)");
10993 /* Check for in place reverse and sort assignments like "@a = reverse @a"
10994 and modify the optree to make them work inplace */
10997 S_inplace_aassign(pTHX_ OP *o) {
10999 OP *modop, *modop_pushmark;
11001 OP *oleft, *oleft_pushmark;
11003 PERL_ARGS_ASSERT_INPLACE_AASSIGN;
11005 assert((o->op_flags & OPf_WANT) == OPf_WANT_VOID);
11007 assert(cUNOPo->op_first->op_type == OP_NULL);
11008 modop_pushmark = cUNOPx(cUNOPo->op_first)->op_first;
11009 assert(modop_pushmark->op_type == OP_PUSHMARK);
11010 modop = modop_pushmark->op_sibling;
11012 if (modop->op_type != OP_SORT && modop->op_type != OP_REVERSE)
11015 /* no other operation except sort/reverse */
11016 if (modop->op_sibling)
11019 assert(cUNOPx(modop)->op_first->op_type == OP_PUSHMARK);
11020 if (!(oright = cUNOPx(modop)->op_first->op_sibling)) return;
11022 if (modop->op_flags & OPf_STACKED) {
11023 /* skip sort subroutine/block */
11024 assert(oright->op_type == OP_NULL);
11025 oright = oright->op_sibling;
11028 assert(cUNOPo->op_first->op_sibling->op_type == OP_NULL);
11029 oleft_pushmark = cUNOPx(cUNOPo->op_first->op_sibling)->op_first;
11030 assert(oleft_pushmark->op_type == OP_PUSHMARK);
11031 oleft = oleft_pushmark->op_sibling;
11033 /* Check the lhs is an array */
11035 (oleft->op_type != OP_RV2AV && oleft->op_type != OP_PADAV)
11036 || oleft->op_sibling
11037 || (oleft->op_private & OPpLVAL_INTRO)
11041 /* Only one thing on the rhs */
11042 if (oright->op_sibling)
11045 /* check the array is the same on both sides */
11046 if (oleft->op_type == OP_RV2AV) {
11047 if (oright->op_type != OP_RV2AV
11048 || !cUNOPx(oright)->op_first
11049 || cUNOPx(oright)->op_first->op_type != OP_GV
11050 || cUNOPx(oleft )->op_first->op_type != OP_GV
11051 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
11052 cGVOPx_gv(cUNOPx(oright)->op_first)
11056 else if (oright->op_type != OP_PADAV
11057 || oright->op_targ != oleft->op_targ
11061 /* This actually is an inplace assignment */
11063 modop->op_private |= OPpSORT_INPLACE;
11065 /* transfer MODishness etc from LHS arg to RHS arg */
11066 oright->op_flags = oleft->op_flags;
11068 /* remove the aassign op and the lhs */
11070 op_null(oleft_pushmark);
11071 if (oleft->op_type == OP_RV2AV && cUNOPx(oleft)->op_first)
11072 op_null(cUNOPx(oleft)->op_first);
11076 #define MAX_DEFERRED 4
11080 if (defer_ix == (MAX_DEFERRED-1)) { \
11081 CALL_RPEEP(defer_queue[defer_base]); \
11082 defer_base = (defer_base + 1) % MAX_DEFERRED; \
11085 defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o; \
11088 #define IS_AND_OP(o) (o->op_type == OP_AND)
11089 #define IS_OR_OP(o) (o->op_type == OP_OR)
11091 /* A peephole optimizer. We visit the ops in the order they're to execute.
11092 * See the comments at the top of this file for more details about when
11093 * peep() is called */
11096 Perl_rpeep(pTHX_ OP *o)
11100 OP* oldoldop = NULL;
11101 OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */
11102 int defer_base = 0;
11105 if (!o || o->op_opt)
11109 SAVEVPTR(PL_curcop);
11110 for (;; o = o->op_next) {
11111 if (o && o->op_opt)
11114 while (defer_ix >= 0)
11115 CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]);
11119 /* By default, this op has now been optimised. A couple of cases below
11120 clear this again. */
11123 switch (o->op_type) {
11125 PL_curcop = ((COP*)o); /* for warnings */
11128 PL_curcop = ((COP*)o); /* for warnings */
11130 /* Optimise a "return ..." at the end of a sub to just be "...".
11131 * This saves 2 ops. Before:
11132 * 1 <;> nextstate(main 1 -e:1) v ->2
11133 * 4 <@> return K ->5
11134 * 2 <0> pushmark s ->3
11135 * - <1> ex-rv2sv sK/1 ->4
11136 * 3 <#> gvsv[*cat] s ->4
11139 * - <@> return K ->-
11140 * - <0> pushmark s ->2
11141 * - <1> ex-rv2sv sK/1 ->-
11142 * 2 <$> gvsv(*cat) s ->3
11145 OP *next = o->op_next;
11146 OP *sibling = o->op_sibling;
11147 if ( OP_TYPE_IS(next, OP_PUSHMARK)
11148 && OP_TYPE_IS(sibling, OP_RETURN)
11149 && OP_TYPE_IS(sibling->op_next, OP_LINESEQ)
11150 && OP_TYPE_IS(sibling->op_next->op_next, OP_LEAVESUB)
11151 && cUNOPx(sibling)->op_first == next
11152 && next->op_sibling && next->op_sibling->op_next
11155 /* Look through the PUSHMARK's siblings for one that
11156 * points to the RETURN */
11157 OP *top = next->op_sibling;
11158 while (top && top->op_next) {
11159 if (top->op_next == sibling) {
11160 top->op_next = sibling->op_next;
11161 o->op_next = next->op_next;
11164 top = top->op_sibling;
11169 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
11170 to carry two labels. For now, take the easier option, and skip
11171 this optimisation if the first NEXTSTATE has a label. */
11172 if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) {
11173 OP *nextop = o->op_next;
11174 while (nextop && nextop->op_type == OP_NULL)
11175 nextop = nextop->op_next;
11177 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
11178 COP *firstcop = (COP *)o;
11179 COP *secondcop = (COP *)nextop;
11180 /* We want the COP pointed to by o (and anything else) to
11181 become the next COP down the line. */
11182 cop_free(firstcop);
11184 firstcop->op_next = secondcop->op_next;
11186 /* Now steal all its pointers, and duplicate the other
11188 firstcop->cop_line = secondcop->cop_line;
11189 #ifdef USE_ITHREADS
11190 firstcop->cop_stashoff = secondcop->cop_stashoff;
11191 firstcop->cop_file = secondcop->cop_file;
11193 firstcop->cop_stash = secondcop->cop_stash;
11194 firstcop->cop_filegv = secondcop->cop_filegv;
11196 firstcop->cop_hints = secondcop->cop_hints;
11197 firstcop->cop_seq = secondcop->cop_seq;
11198 firstcop->cop_warnings = secondcop->cop_warnings;
11199 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
11201 #ifdef USE_ITHREADS
11202 secondcop->cop_stashoff = 0;
11203 secondcop->cop_file = NULL;
11205 secondcop->cop_stash = NULL;
11206 secondcop->cop_filegv = NULL;
11208 secondcop->cop_warnings = NULL;
11209 secondcop->cop_hints_hash = NULL;
11211 /* If we use op_null(), and hence leave an ex-COP, some
11212 warnings are misreported. For example, the compile-time
11213 error in 'use strict; no strict refs;' */
11214 secondcop->op_type = OP_NULL;
11215 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
11221 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
11222 if (o->op_next->op_private & OPpTARGET_MY) {
11223 if (o->op_flags & OPf_STACKED) /* chained concats */
11224 break; /* ignore_optimization */
11226 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
11227 o->op_targ = o->op_next->op_targ;
11228 o->op_next->op_targ = 0;
11229 o->op_private |= OPpTARGET_MY;
11232 op_null(o->op_next);
11236 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
11237 break; /* Scalar stub must produce undef. List stub is noop */
11241 if (o->op_targ == OP_NEXTSTATE
11242 || o->op_targ == OP_DBSTATE)
11244 PL_curcop = ((COP*)o);
11246 /* XXX: We avoid setting op_seq here to prevent later calls
11247 to rpeep() from mistakenly concluding that optimisation
11248 has already occurred. This doesn't fix the real problem,
11249 though (See 20010220.007). AMS 20010719 */
11250 /* op_seq functionality is now replaced by op_opt */
11257 if (oldop && o->op_next) {
11258 oldop->op_next = o->op_next;
11266 /* Convert a series of PAD ops for my vars plus support into a
11267 * single padrange op. Basically
11269 * pushmark -> pad[ahs]v -> pad[ahs]?v -> ... -> (list) -> rest
11271 * becomes, depending on circumstances, one of
11273 * padrange ----------------------------------> (list) -> rest
11274 * padrange --------------------------------------------> rest
11276 * where all the pad indexes are sequential and of the same type
11278 * We convert the pushmark into a padrange op, then skip
11279 * any other pad ops, and possibly some trailing ops.
11280 * Note that we don't null() the skipped ops, to make it
11281 * easier for Deparse to undo this optimisation (and none of
11282 * the skipped ops are holding any resourses). It also makes
11283 * it easier for find_uninit_var(), as it can just ignore
11284 * padrange, and examine the original pad ops.
11288 OP *followop = NULL; /* the op that will follow the padrange op */
11291 PADOFFSET base = 0; /* init only to stop compiler whining */
11292 U8 gimme = 0; /* init only to stop compiler whining */
11293 bool defav = 0; /* seen (...) = @_ */
11294 bool reuse = 0; /* reuse an existing padrange op */
11296 /* look for a pushmark -> gv[_] -> rv2av */
11302 if ( p->op_type == OP_GV
11303 && (gv = cGVOPx_gv(p))
11304 && GvNAMELEN_get(gv) == 1
11305 && *GvNAME_get(gv) == '_'
11306 && GvSTASH(gv) == PL_defstash
11307 && (rv2av = p->op_next)
11308 && rv2av->op_type == OP_RV2AV
11309 && !(rv2av->op_flags & OPf_REF)
11310 && !(rv2av->op_private & (OPpLVAL_INTRO|OPpMAYBE_LVSUB))
11311 && ((rv2av->op_flags & OPf_WANT) == OPf_WANT_LIST)
11312 && o->op_sibling == rv2av /* these two for Deparse */
11313 && cUNOPx(rv2av)->op_first == p
11315 q = rv2av->op_next;
11316 if (q->op_type == OP_NULL)
11318 if (q->op_type == OP_PUSHMARK) {
11325 /* To allow Deparse to pessimise this, it needs to be able
11326 * to restore the pushmark's original op_next, which it
11327 * will assume to be the same as op_sibling. */
11328 if (o->op_next != o->op_sibling)
11333 /* scan for PAD ops */
11335 for (p = p->op_next; p; p = p->op_next) {
11336 if (p->op_type == OP_NULL)
11339 if (( p->op_type != OP_PADSV
11340 && p->op_type != OP_PADAV
11341 && p->op_type != OP_PADHV
11343 /* any private flag other than INTRO? e.g. STATE */
11344 || (p->op_private & ~OPpLVAL_INTRO)
11348 /* let $a[N] potentially be optimised into ALEMFAST_LEX
11350 if ( p->op_type == OP_PADAV
11352 && p->op_next->op_type == OP_CONST
11353 && p->op_next->op_next
11354 && p->op_next->op_next->op_type == OP_AELEM
11358 /* for 1st padop, note what type it is and the range
11359 * start; for the others, check that it's the same type
11360 * and that the targs are contiguous */
11362 intro = (p->op_private & OPpLVAL_INTRO);
11364 gimme = (p->op_flags & OPf_WANT);
11367 if ((p->op_private & OPpLVAL_INTRO) != intro)
11369 /* Note that you'd normally expect targs to be
11370 * contiguous in my($a,$b,$c), but that's not the case
11371 * when external modules start doing things, e.g.
11372 i* Function::Parameters */
11373 if (p->op_targ != base + count)
11375 assert(p->op_targ == base + count);
11376 /* all the padops should be in the same context */
11377 if (gimme != (p->op_flags & OPf_WANT))
11381 /* for AV, HV, only when we're not flattening */
11382 if ( p->op_type != OP_PADSV
11383 && gimme != OPf_WANT_VOID
11384 && !(p->op_flags & OPf_REF)
11388 if (count >= OPpPADRANGE_COUNTMASK)
11391 /* there's a biggest base we can fit into a
11392 * SAVEt_CLEARPADRANGE in pp_padrange */
11393 if (intro && base >
11394 (UV_MAX >> (OPpPADRANGE_COUNTSHIFT+SAVE_TIGHT_SHIFT)))
11397 /* Success! We've got another valid pad op to optimise away */
11399 followop = p->op_next;
11405 /* pp_padrange in specifically compile-time void context
11406 * skips pushing a mark and lexicals; in all other contexts
11407 * (including unknown till runtime) it pushes a mark and the
11408 * lexicals. We must be very careful then, that the ops we
11409 * optimise away would have exactly the same effect as the
11411 * In particular in void context, we can only optimise to
11412 * a padrange if see see the complete sequence
11413 * pushmark, pad*v, ...., list, nextstate
11414 * which has the net effect of of leaving the stack empty
11415 * (for now we leave the nextstate in the execution chain, for
11416 * its other side-effects).
11419 if (gimme == OPf_WANT_VOID) {
11420 if (followop->op_type == OP_LIST
11421 && gimme == (followop->op_flags & OPf_WANT)
11422 && ( followop->op_next->op_type == OP_NEXTSTATE
11423 || followop->op_next->op_type == OP_DBSTATE))
11425 followop = followop->op_next; /* skip OP_LIST */
11427 /* consolidate two successive my(...);'s */
11430 && oldoldop->op_type == OP_PADRANGE
11431 && (oldoldop->op_flags & OPf_WANT) == OPf_WANT_VOID
11432 && (oldoldop->op_private & OPpLVAL_INTRO) == intro
11433 && !(oldoldop->op_flags & OPf_SPECIAL)
11436 assert(oldoldop->op_next == oldop);
11437 assert( oldop->op_type == OP_NEXTSTATE
11438 || oldop->op_type == OP_DBSTATE);
11439 assert(oldop->op_next == o);
11442 = (oldoldop->op_private & OPpPADRANGE_COUNTMASK);
11444 /* Do not assume pad offsets for $c and $d are con-
11449 if ( oldoldop->op_targ + old_count == base
11450 && old_count < OPpPADRANGE_COUNTMASK - count) {
11451 base = oldoldop->op_targ;
11452 count += old_count;
11457 /* if there's any immediately following singleton
11458 * my var's; then swallow them and the associated
11460 * my ($a,$b); my $c; my $d;
11462 * my ($a,$b,$c,$d);
11465 while ( ((p = followop->op_next))
11466 && ( p->op_type == OP_PADSV
11467 || p->op_type == OP_PADAV
11468 || p->op_type == OP_PADHV)
11469 && (p->op_flags & OPf_WANT) == OPf_WANT_VOID
11470 && (p->op_private & OPpLVAL_INTRO) == intro
11472 && ( p->op_next->op_type == OP_NEXTSTATE
11473 || p->op_next->op_type == OP_DBSTATE)
11474 && count < OPpPADRANGE_COUNTMASK
11475 && base + count == p->op_targ
11478 followop = p->op_next;
11486 assert(oldoldop->op_type == OP_PADRANGE);
11487 oldoldop->op_next = followop;
11488 oldoldop->op_private = (intro | count);
11494 /* Convert the pushmark into a padrange.
11495 * To make Deparse easier, we guarantee that a padrange was
11496 * *always* formerly a pushmark */
11497 assert(o->op_type == OP_PUSHMARK);
11498 o->op_next = followop;
11499 o->op_type = OP_PADRANGE;
11500 o->op_ppaddr = PL_ppaddr[OP_PADRANGE];
11502 /* bit 7: INTRO; bit 6..0: count */
11503 o->op_private = (intro | count);
11504 o->op_flags = ((o->op_flags & ~(OPf_WANT|OPf_SPECIAL))
11505 | gimme | (defav ? OPf_SPECIAL : 0));
11512 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
11513 OP* const pop = (o->op_type == OP_PADAV) ?
11514 o->op_next : o->op_next->op_next;
11516 if (pop && pop->op_type == OP_CONST &&
11517 ((PL_op = pop->op_next)) &&
11518 pop->op_next->op_type == OP_AELEM &&
11519 !(pop->op_next->op_private &
11520 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
11521 (i = SvIV(((SVOP*)pop)->op_sv)) <= 255 && i >= 0)
11524 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
11525 no_bareword_allowed(pop);
11526 if (o->op_type == OP_GV)
11527 op_null(o->op_next);
11528 op_null(pop->op_next);
11530 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
11531 o->op_next = pop->op_next->op_next;
11532 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
11533 o->op_private = (U8)i;
11534 if (o->op_type == OP_GV) {
11537 o->op_type = OP_AELEMFAST;
11540 o->op_type = OP_AELEMFAST_LEX;
11545 if (o->op_next->op_type == OP_RV2SV) {
11546 if (!(o->op_next->op_private & OPpDEREF)) {
11547 op_null(o->op_next);
11548 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
11550 o->op_next = o->op_next->op_next;
11551 o->op_type = OP_GVSV;
11552 o->op_ppaddr = PL_ppaddr[OP_GVSV];
11555 else if (o->op_next->op_type == OP_READLINE
11556 && o->op_next->op_next->op_type == OP_CONCAT
11557 && (o->op_next->op_next->op_flags & OPf_STACKED))
11559 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
11560 o->op_type = OP_RCATLINE;
11561 o->op_flags |= OPf_STACKED;
11562 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
11563 op_null(o->op_next->op_next);
11564 op_null(o->op_next);
11573 #define HV_OR_SCALARHV(op) \
11574 ( (op)->op_type == OP_PADHV || (op)->op_type == OP_RV2HV \
11576 : (op)->op_type == OP_SCALAR && (op)->op_flags & OPf_KIDS \
11577 && ( cUNOPx(op)->op_first->op_type == OP_PADHV \
11578 || cUNOPx(op)->op_first->op_type == OP_RV2HV) \
11579 ? cUNOPx(op)->op_first \
11583 if ((fop = HV_OR_SCALARHV(cUNOP->op_first)))
11584 fop->op_private |= OPpTRUEBOOL;
11590 fop = cLOGOP->op_first;
11591 sop = fop->op_sibling;
11592 while (cLOGOP->op_other->op_type == OP_NULL)
11593 cLOGOP->op_other = cLOGOP->op_other->op_next;
11594 while (o->op_next && ( o->op_type == o->op_next->op_type
11595 || o->op_next->op_type == OP_NULL))
11596 o->op_next = o->op_next->op_next;
11598 /* if we're an OR and our next is a AND in void context, we'll
11599 follow it's op_other on short circuit, same for reverse.
11600 We can't do this with OP_DOR since if it's true, its return
11601 value is the underlying value which must be evaluated
11605 (IS_AND_OP(o) && IS_OR_OP(o->op_next))
11606 || (IS_OR_OP(o) && IS_AND_OP(o->op_next))
11608 && (o->op_next->op_flags & OPf_WANT) == OPf_WANT_VOID
11610 o->op_next = ((LOGOP*)o->op_next)->op_other;
11612 DEFER(cLOGOP->op_other);
11615 fop = HV_OR_SCALARHV(fop);
11616 if (sop) sop = HV_OR_SCALARHV(sop);
11621 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
11622 while (nop && nop->op_next) {
11623 switch (nop->op_next->op_type) {
11628 lop = nop = nop->op_next;
11631 nop = nop->op_next;
11640 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
11641 || o->op_type == OP_AND )
11642 fop->op_private |= OPpTRUEBOOL;
11643 else if (!(lop->op_flags & OPf_WANT))
11644 fop->op_private |= OPpMAYBE_TRUEBOOL;
11646 if ( (lop->op_flags & OPf_WANT) == OPf_WANT_VOID
11648 sop->op_private |= OPpTRUEBOOL;
11655 if ((fop = HV_OR_SCALARHV(cLOGOP->op_first)))
11656 fop->op_private |= OPpTRUEBOOL;
11657 #undef HV_OR_SCALARHV
11668 while (cLOGOP->op_other->op_type == OP_NULL)
11669 cLOGOP->op_other = cLOGOP->op_other->op_next;
11670 DEFER(cLOGOP->op_other);
11675 while (cLOOP->op_redoop->op_type == OP_NULL)
11676 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
11677 while (cLOOP->op_nextop->op_type == OP_NULL)
11678 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
11679 while (cLOOP->op_lastop->op_type == OP_NULL)
11680 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
11681 /* a while(1) loop doesn't have an op_next that escapes the
11682 * loop, so we have to explicitly follow the op_lastop to
11683 * process the rest of the code */
11684 DEFER(cLOOP->op_lastop);
11688 assert(!(cPMOP->op_pmflags & PMf_ONCE));
11689 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
11690 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
11691 cPMOP->op_pmstashstartu.op_pmreplstart
11692 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
11693 DEFER(cPMOP->op_pmstashstartu.op_pmreplstart);
11699 if (o->op_flags & OPf_STACKED) {
11701 cUNOPx(cLISTOP->op_first->op_sibling)->op_first;
11702 if (kid->op_type == OP_SCOPE
11703 || (kid->op_type == OP_NULL && kid->op_targ == OP_LEAVE))
11704 DEFER(kLISTOP->op_first);
11707 /* check that RHS of sort is a single plain array */
11708 oright = cUNOPo->op_first;
11709 if (!oright || oright->op_type != OP_PUSHMARK)
11712 if (o->op_private & OPpSORT_INPLACE)
11715 /* reverse sort ... can be optimised. */
11716 if (!cUNOPo->op_sibling) {
11717 /* Nothing follows us on the list. */
11718 OP * const reverse = o->op_next;
11720 if (reverse->op_type == OP_REVERSE &&
11721 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
11722 OP * const pushmark = cUNOPx(reverse)->op_first;
11723 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
11724 && (cUNOPx(pushmark)->op_sibling == o)) {
11725 /* reverse -> pushmark -> sort */
11726 o->op_private |= OPpSORT_REVERSE;
11728 pushmark->op_next = oright->op_next;
11738 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
11740 LISTOP *enter, *exlist;
11742 if (o->op_private & OPpSORT_INPLACE)
11745 enter = (LISTOP *) o->op_next;
11748 if (enter->op_type == OP_NULL) {
11749 enter = (LISTOP *) enter->op_next;
11753 /* for $a (...) will have OP_GV then OP_RV2GV here.
11754 for (...) just has an OP_GV. */
11755 if (enter->op_type == OP_GV) {
11756 gvop = (OP *) enter;
11757 enter = (LISTOP *) enter->op_next;
11760 if (enter->op_type == OP_RV2GV) {
11761 enter = (LISTOP *) enter->op_next;
11767 if (enter->op_type != OP_ENTERITER)
11770 iter = enter->op_next;
11771 if (!iter || iter->op_type != OP_ITER)
11774 expushmark = enter->op_first;
11775 if (!expushmark || expushmark->op_type != OP_NULL
11776 || expushmark->op_targ != OP_PUSHMARK)
11779 exlist = (LISTOP *) expushmark->op_sibling;
11780 if (!exlist || exlist->op_type != OP_NULL
11781 || exlist->op_targ != OP_LIST)
11784 if (exlist->op_last != o) {
11785 /* Mmm. Was expecting to point back to this op. */
11788 theirmark = exlist->op_first;
11789 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
11792 if (theirmark->op_sibling != o) {
11793 /* There's something between the mark and the reverse, eg
11794 for (1, reverse (...))
11799 ourmark = ((LISTOP *)o)->op_first;
11800 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
11803 ourlast = ((LISTOP *)o)->op_last;
11804 if (!ourlast || ourlast->op_next != o)
11807 rv2av = ourmark->op_sibling;
11808 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
11809 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
11810 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
11811 /* We're just reversing a single array. */
11812 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
11813 enter->op_flags |= OPf_STACKED;
11816 /* We don't have control over who points to theirmark, so sacrifice
11818 theirmark->op_next = ourmark->op_next;
11819 theirmark->op_flags = ourmark->op_flags;
11820 ourlast->op_next = gvop ? gvop : (OP *) enter;
11823 enter->op_private |= OPpITER_REVERSED;
11824 iter->op_private |= OPpITER_REVERSED;
11831 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
11832 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
11837 if (!(o->op_private & OPpOFFBYONE) && !CvCLONE(PL_compcv)) {
11839 if (CvEVAL(PL_compcv)) sv = &PL_sv_undef;
11841 sv = newRV((SV *)PL_compcv);
11845 o->op_type = OP_CONST;
11846 o->op_ppaddr = PL_ppaddr[OP_CONST];
11847 o->op_flags |= OPf_SPECIAL;
11848 cSVOPo->op_sv = sv;
11853 if (OP_GIMME(o,0) == G_VOID) {
11854 OP *right = cBINOP->op_first;
11856 OP *left = right->op_sibling;
11857 if (left->op_type == OP_SUBSTR
11858 && (left->op_private & 7) < 4) {
11860 cBINOP->op_first = left;
11861 right->op_sibling =
11862 cBINOPx(left)->op_first->op_sibling;
11863 cBINOPx(left)->op_first->op_sibling = right;
11864 left->op_private |= OPpSUBSTR_REPL_FIRST;
11866 (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
11873 Perl_cpeep_t cpeep =
11874 XopENTRYCUSTOM(o, xop_peep);
11876 cpeep(aTHX_ o, oldop);
11888 Perl_peep(pTHX_ OP *o)
11894 =head1 Custom Operators
11896 =for apidoc Ao||custom_op_xop
11897 Return the XOP structure for a given custom op. This macro should be
11898 considered internal to OP_NAME and the other access macros: use them instead.
11899 This macro does call a function. Prior to 5.19.8, this was implemented as a
11906 Perl_custom_op_get_field(pTHX_ const OP *o, const xop_flags_enum field)
11912 static const XOP xop_null = { 0, 0, 0, 0, 0 };
11914 PERL_ARGS_ASSERT_CUSTOM_OP_GET_FIELD;
11915 assert(o->op_type == OP_CUSTOM);
11917 /* This is wrong. It assumes a function pointer can be cast to IV,
11918 * which isn't guaranteed, but this is what the old custom OP code
11919 * did. In principle it should be safer to Copy the bytes of the
11920 * pointer into a PV: since the new interface is hidden behind
11921 * functions, this can be changed later if necessary. */
11922 /* Change custom_op_xop if this ever happens */
11923 keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr)));
11926 he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0);
11928 /* assume noone will have just registered a desc */
11929 if (!he && PL_custom_op_names &&
11930 (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0))
11935 /* XXX does all this need to be shared mem? */
11936 Newxz(xop, 1, XOP);
11937 pv = SvPV(HeVAL(he), l);
11938 XopENTRY_set(xop, xop_name, savepvn(pv, l));
11939 if (PL_custom_op_descs &&
11940 (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0))
11942 pv = SvPV(HeVAL(he), l);
11943 XopENTRY_set(xop, xop_desc, savepvn(pv, l));
11945 Perl_custom_op_register(aTHX_ o->op_ppaddr, xop);
11949 xop = (XOP *)&xop_null;
11951 xop = INT2PTR(XOP *, SvIV(HeVAL(he)));
11955 if(field == XOPe_xop_ptr) {
11958 const U32 flags = XopFLAGS(xop);
11959 if(flags & field) {
11961 case XOPe_xop_name:
11962 any.xop_name = xop->xop_name;
11964 case XOPe_xop_desc:
11965 any.xop_desc = xop->xop_desc;
11967 case XOPe_xop_class:
11968 any.xop_class = xop->xop_class;
11970 case XOPe_xop_peep:
11971 any.xop_peep = xop->xop_peep;
11979 case XOPe_xop_name:
11980 any.xop_name = XOPd_xop_name;
11982 case XOPe_xop_desc:
11983 any.xop_desc = XOPd_xop_desc;
11985 case XOPe_xop_class:
11986 any.xop_class = XOPd_xop_class;
11988 case XOPe_xop_peep:
11989 any.xop_peep = XOPd_xop_peep;
12002 =for apidoc Ao||custom_op_register
12003 Register a custom op. See L<perlguts/"Custom Operators">.
12009 Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop)
12013 PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER;
12015 /* see the comment in custom_op_xop */
12016 keysv = sv_2mortal(newSViv(PTR2IV(ppaddr)));
12018 if (!PL_custom_ops)
12019 PL_custom_ops = newHV();
12021 if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0))
12022 Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name);
12026 =head1 Functions in file op.c
12028 =for apidoc core_prototype
12029 This function assigns the prototype of the named core function to C<sv>, or
12030 to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or
12031 NULL if the core function has no prototype. C<code> is a code as returned
12032 by C<keyword()>. It must not be equal to 0.
12038 Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code,
12041 int i = 0, n = 0, seen_question = 0, defgv = 0;
12043 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
12044 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
12045 bool nullret = FALSE;
12047 PERL_ARGS_ASSERT_CORE_PROTOTYPE;
12051 if (!sv) sv = sv_newmortal();
12053 #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv
12055 switch (code < 0 ? -code : code) {
12056 case KEY_and : case KEY_chop: case KEY_chomp:
12057 case KEY_cmp : case KEY_defined: case KEY_delete: case KEY_exec :
12058 case KEY_exists: case KEY_eq : case KEY_ge : case KEY_goto :
12059 case KEY_grep : case KEY_gt : case KEY_last : case KEY_le :
12060 case KEY_lt : case KEY_map : case KEY_ne : case KEY_next :
12061 case KEY_or : case KEY_print : case KEY_printf: case KEY_qr :
12062 case KEY_redo : case KEY_require: case KEY_return: case KEY_say :
12063 case KEY_select: case KEY_sort : case KEY_split : case KEY_system:
12064 case KEY_x : case KEY_xor :
12065 if (!opnum) return NULL; nullret = TRUE; goto findopnum;
12066 case KEY_glob: retsetpvs("_;", OP_GLOB);
12067 case KEY_keys: retsetpvs("+", OP_KEYS);
12068 case KEY_values: retsetpvs("+", OP_VALUES);
12069 case KEY_each: retsetpvs("+", OP_EACH);
12070 case KEY_push: retsetpvs("+@", OP_PUSH);
12071 case KEY_unshift: retsetpvs("+@", OP_UNSHIFT);
12072 case KEY_pop: retsetpvs(";+", OP_POP);
12073 case KEY_shift: retsetpvs(";+", OP_SHIFT);
12074 case KEY_pos: retsetpvs(";\\[$*]", OP_POS);
12076 retsetpvs("+;$$@", OP_SPLICE);
12077 case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__:
12079 case KEY_evalbytes:
12080 name = "entereval"; break;
12088 while (i < MAXO) { /* The slow way. */
12089 if (strEQ(name, PL_op_name[i])
12090 || strEQ(name, PL_op_desc[i]))
12092 if (nullret) { assert(opnum); *opnum = i; return NULL; }
12099 defgv = PL_opargs[i] & OA_DEFGV;
12100 oa = PL_opargs[i] >> OASHIFT;
12102 if (oa & OA_OPTIONAL && !seen_question && (
12103 !defgv || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF
12108 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
12109 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
12110 /* But globs are already references (kinda) */
12111 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
12115 if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF
12116 && !scalar_mod_type(NULL, i)) {
12121 if (i == OP_LOCK || i == OP_UNDEF) str[n++] = '&';
12125 else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
12126 if (oa & OA_OPTIONAL && defgv && str[n-1] == '$') {
12127 str[n-1] = '_'; defgv = 0;
12131 if (code == -KEY_not || code == -KEY_getprotobynumber) str[n++] = ';';
12133 sv_setpvn(sv, str, n - 1);
12134 if (opnum) *opnum = i;
12139 Perl_coresub_op(pTHX_ SV * const coreargssv, const int code,
12142 OP * const argop = newSVOP(OP_COREARGS,0,coreargssv);
12145 PERL_ARGS_ASSERT_CORESUB_OP;
12149 return op_append_elem(OP_LINESEQ,
12152 newSVOP(OP_CONST, 0, newSViv(-code % 3)),
12156 case OP_SELECT: /* which represents OP_SSELECT as well */
12161 newAVREF(newGVOP(OP_GV, 0, PL_defgv)),
12162 newSVOP(OP_CONST, 0, newSVuv(1))
12164 coresub_op(newSVuv((UV)OP_SSELECT), 0,
12166 coresub_op(coreargssv, 0, OP_SELECT)
12170 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
12172 return op_append_elem(
12175 opnum == OP_WANTARRAY || opnum == OP_RUNCV
12176 ? OPpOFFBYONE << 8 : 0)
12178 case OA_BASEOP_OR_UNOP:
12179 if (opnum == OP_ENTEREVAL) {
12180 o = newUNOP(OP_ENTEREVAL,OPpEVAL_COPHH<<8,argop);
12181 if (code == -KEY_evalbytes) o->op_private |= OPpEVAL_BYTES;
12183 else o = newUNOP(opnum,0,argop);
12184 if (opnum == OP_CALLER) o->op_private |= OPpOFFBYONE;
12187 if (is_handle_constructor(o, 1))
12188 argop->op_private |= OPpCOREARGS_DEREF1;
12189 if (scalar_mod_type(NULL, opnum))
12190 argop->op_private |= OPpCOREARGS_SCALARMOD;
12194 o = convert(opnum,OPf_SPECIAL*(opnum == OP_GLOB),argop);
12195 if (is_handle_constructor(o, 2))
12196 argop->op_private |= OPpCOREARGS_DEREF2;
12197 if (opnum == OP_SUBSTR) {
12198 o->op_private |= OPpMAYBE_LVSUB;
12207 Perl_report_redefined_cv(pTHX_ const SV *name, const CV *old_cv,
12208 SV * const *new_const_svp)
12210 const char *hvname;
12211 bool is_const = !!CvCONST(old_cv);
12212 SV *old_const_sv = is_const ? cv_const_sv(old_cv) : NULL;
12214 PERL_ARGS_ASSERT_REPORT_REDEFINED_CV;
12216 if (is_const && new_const_svp && old_const_sv == *new_const_svp)
12218 /* They are 2 constant subroutines generated from
12219 the same constant. This probably means that
12220 they are really the "same" proxy subroutine
12221 instantiated in 2 places. Most likely this is
12222 when a constant is exported twice. Don't warn.
12225 (ckWARN(WARN_REDEFINE)
12227 CvGV(old_cv) && GvSTASH(CvGV(old_cv))
12228 && HvNAMELEN(GvSTASH(CvGV(old_cv))) == 7
12229 && (hvname = HvNAME(GvSTASH(CvGV(old_cv))),
12230 strEQ(hvname, "autouse"))
12234 && ckWARN_d(WARN_REDEFINE)
12235 && (!new_const_svp || sv_cmp(old_const_sv, *new_const_svp))
12238 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
12240 ? "Constant subroutine %"SVf" redefined"
12241 : "Subroutine %"SVf" redefined",
12246 =head1 Hook manipulation
12248 These functions provide convenient and thread-safe means of manipulating
12255 =for apidoc Am|void|wrap_op_checker|Optype opcode|Perl_check_t new_checker|Perl_check_t *old_checker_p
12257 Puts a C function into the chain of check functions for a specified op
12258 type. This is the preferred way to manipulate the L</PL_check> array.
12259 I<opcode> specifies which type of op is to be affected. I<new_checker>
12260 is a pointer to the C function that is to be added to that opcode's
12261 check chain, and I<old_checker_p> points to the storage location where a
12262 pointer to the next function in the chain will be stored. The value of
12263 I<new_pointer> is written into the L</PL_check> array, while the value
12264 previously stored there is written to I<*old_checker_p>.
12266 L</PL_check> is global to an entire process, and a module wishing to
12267 hook op checking may find itself invoked more than once per process,
12268 typically in different threads. To handle that situation, this function
12269 is idempotent. The location I<*old_checker_p> must initially (once
12270 per process) contain a null pointer. A C variable of static duration
12271 (declared at file scope, typically also marked C<static> to give
12272 it internal linkage) will be implicitly initialised appropriately,
12273 if it does not have an explicit initialiser. This function will only
12274 actually modify the check chain if it finds I<*old_checker_p> to be null.
12275 This function is also thread safe on the small scale. It uses appropriate
12276 locking to avoid race conditions in accessing L</PL_check>.
12278 When this function is called, the function referenced by I<new_checker>
12279 must be ready to be called, except for I<*old_checker_p> being unfilled.
12280 In a threading situation, I<new_checker> may be called immediately,
12281 even before this function has returned. I<*old_checker_p> will always
12282 be appropriately set before I<new_checker> is called. If I<new_checker>
12283 decides not to do anything special with an op that it is given (which
12284 is the usual case for most uses of op check hooking), it must chain the
12285 check function referenced by I<*old_checker_p>.
12287 If you want to influence compilation of calls to a specific subroutine,
12288 then use L</cv_set_call_checker> rather than hooking checking of all
12295 Perl_wrap_op_checker(pTHX_ Optype opcode,
12296 Perl_check_t new_checker, Perl_check_t *old_checker_p)
12300 PERL_ARGS_ASSERT_WRAP_OP_CHECKER;
12301 if (*old_checker_p) return;
12302 OP_CHECK_MUTEX_LOCK;
12303 if (!*old_checker_p) {
12304 *old_checker_p = PL_check[opcode];
12305 PL_check[opcode] = new_checker;
12307 OP_CHECK_MUTEX_UNLOCK;
12312 /* Efficient sub that returns a constant scalar value. */
12314 const_sv_xsub(pTHX_ CV* cv)
12318 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
12319 PERL_UNUSED_ARG(items);
12329 const_av_xsub(pTHX_ CV* cv)
12333 AV * const av = MUTABLE_AV(XSANY.any_ptr);
12341 if (SvRMAGICAL(av))
12342 Perl_croak(aTHX_ "Magical list constants are not supported");
12343 if (GIMME_V != G_ARRAY) {
12345 ST(0) = newSViv((IV)AvFILLp(av)+1);
12348 EXTEND(SP, AvFILLp(av)+1);
12349 Copy(AvARRAY(av), &ST(0), AvFILLp(av)+1, SV *);
12350 XSRETURN(AvFILLp(av)+1);
12355 * c-indentation-style: bsd
12356 * c-basic-offset: 4
12357 * indent-tabs-mode: nil
12360 * ex: set ts=8 sts=4 sw=4 et: