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 #if defined(PL_OP_SLAB_ALLOC)
114 #ifdef PERL_DEBUG_READONLY_OPS
115 # define PERL_SLAB_SIZE 4096
116 # include <sys/mman.h>
119 #ifndef PERL_SLAB_SIZE
120 #define PERL_SLAB_SIZE 2048
124 Perl_Slab_Alloc(pTHX_ size_t sz)
128 * To make incrementing use count easy PL_OpSlab is an I32 *
129 * To make inserting the link to slab PL_OpPtr is I32 **
130 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
131 * Add an overhead for pointer to slab and round up as a number of pointers
133 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
134 if ((PL_OpSpace -= sz) < 0) {
135 #ifdef PERL_DEBUG_READONLY_OPS
136 /* We need to allocate chunk by chunk so that we can control the VM
138 PL_OpPtr = (I32**) mmap(0, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE,
139 MAP_ANON|MAP_PRIVATE, -1, 0);
141 DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n",
142 (unsigned long) PERL_SLAB_SIZE*sizeof(I32*),
144 if(PL_OpPtr == MAP_FAILED) {
145 perror("mmap failed");
150 PL_OpPtr = (I32 **) PerlMemShared_calloc(PERL_SLAB_SIZE,sizeof(I32*));
155 /* We reserve the 0'th I32 sized chunk as a use count */
156 PL_OpSlab = (I32 *) PL_OpPtr;
157 /* Reduce size by the use count word, and by the size we need.
158 * Latter is to mimic the '-=' in the if() above
160 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
161 /* Allocation pointer starts at the top.
162 Theory: because we build leaves before trunk allocating at end
163 means that at run time access is cache friendly upward
165 PL_OpPtr += PERL_SLAB_SIZE;
167 #ifdef PERL_DEBUG_READONLY_OPS
168 /* We remember this slab. */
169 /* This implementation isn't efficient, but it is simple. */
170 PL_slabs = (I32**) realloc(PL_slabs, sizeof(I32**) * (PL_slab_count + 1));
171 PL_slabs[PL_slab_count++] = PL_OpSlab;
172 DEBUG_m(PerlIO_printf(Perl_debug_log, "Allocate %p\n", PL_OpSlab));
175 assert( PL_OpSpace >= 0 );
176 /* Move the allocation pointer down */
178 assert( PL_OpPtr > (I32 **) PL_OpSlab );
179 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
180 (*PL_OpSlab)++; /* Increment use count of slab */
181 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
182 assert( *PL_OpSlab > 0 );
183 return (void *)(PL_OpPtr + 1);
186 #ifdef PERL_DEBUG_READONLY_OPS
188 Perl_pending_Slabs_to_ro(pTHX) {
189 /* Turn all the allocated op slabs read only. */
190 U32 count = PL_slab_count;
191 I32 **const slabs = PL_slabs;
193 /* Reset the array of pending OP slabs, as we're about to turn this lot
194 read only. Also, do it ahead of the loop in case the warn triggers,
195 and a warn handler has an eval */
200 /* Force a new slab for any further allocation. */
204 void *const start = slabs[count];
205 const size_t size = PERL_SLAB_SIZE* sizeof(I32*);
206 if(mprotect(start, size, PROT_READ)) {
207 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d",
208 start, (unsigned long) size, errno);
216 S_Slab_to_rw(pTHX_ void *op)
218 I32 * const * const ptr = (I32 **) op;
219 I32 * const slab = ptr[-1];
221 PERL_ARGS_ASSERT_SLAB_TO_RW;
223 assert( ptr-1 > (I32 **) slab );
224 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
226 if(mprotect(slab, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE)) {
227 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d",
228 slab, (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), errno);
233 Perl_op_refcnt_inc(pTHX_ OP *o)
244 Perl_op_refcnt_dec(pTHX_ OP *o)
246 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
251 # define Slab_to_rw(op)
255 Perl_Slab_Free(pTHX_ void *op)
257 I32 * const * const ptr = (I32 **) op;
258 I32 * const slab = ptr[-1];
259 PERL_ARGS_ASSERT_SLAB_FREE;
260 assert( ptr-1 > (I32 **) slab );
261 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
264 if (--(*slab) == 0) {
266 # define PerlMemShared PerlMem
269 #ifdef PERL_DEBUG_READONLY_OPS
270 U32 count = PL_slab_count;
271 /* Need to remove this slab from our list of slabs */
274 if (PL_slabs[count] == slab) {
276 /* Found it. Move the entry at the end to overwrite it. */
277 DEBUG_m(PerlIO_printf(Perl_debug_log,
278 "Deallocate %p by moving %p from %lu to %lu\n",
280 PL_slabs[PL_slab_count - 1],
281 PL_slab_count, count));
282 PL_slabs[count] = PL_slabs[--PL_slab_count];
283 /* Could realloc smaller at this point, but probably not
285 if(munmap(slab, PERL_SLAB_SIZE*sizeof(I32*))) {
286 perror("munmap failed");
294 PerlMemShared_free(slab);
296 if (slab == PL_OpSlab) {
303 * In the following definition, the ", (OP*)0" is just to make the compiler
304 * think the expression is of the right type: croak actually does a Siglongjmp.
306 #define CHECKOP(type,o) \
307 ((PL_op_mask && PL_op_mask[type]) \
308 ? ( op_free((OP*)o), \
309 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
311 : PL_check[type](aTHX_ (OP*)o))
313 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
315 #define CHANGE_TYPE(o,type) \
317 o->op_type = (OPCODE)type; \
318 o->op_ppaddr = PL_ppaddr[type]; \
322 S_gv_ename(pTHX_ GV *gv)
324 SV* const tmpsv = sv_newmortal();
326 PERL_ARGS_ASSERT_GV_ENAME;
328 gv_efullname3(tmpsv, gv, NULL);
333 S_no_fh_allowed(pTHX_ OP *o)
335 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
337 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
343 S_too_few_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags)
345 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_SV;
346 yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %"SVf, namesv),
347 SvUTF8(namesv) | flags);
352 S_too_few_arguments_pv(pTHX_ OP *o, const char* name, U32 flags)
354 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS_PV;
355 yyerror_pv(Perl_form(aTHX_ "Not enough arguments for %s", name), flags);
360 S_too_many_arguments_pv(pTHX_ OP *o, const char *name, U32 flags)
362 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_PV;
364 yyerror_pv(Perl_form(aTHX_ "Too many arguments for %s", name), flags);
369 S_too_many_arguments_sv(pTHX_ OP *o, SV *namesv, U32 flags)
371 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS_SV;
373 yyerror_pv(Perl_form(aTHX_ "Too many arguments for %"SVf, SVfARG(namesv)),
374 SvUTF8(namesv) | flags);
379 S_bad_type_pv(pTHX_ I32 n, const char *t, const char *name, U32 flags, const OP *kid)
381 PERL_ARGS_ASSERT_BAD_TYPE_PV;
383 yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
384 (int)n, name, t, OP_DESC(kid)), flags);
388 S_bad_type_sv(pTHX_ I32 n, const char *t, SV *namesv, U32 flags, const OP *kid)
390 PERL_ARGS_ASSERT_BAD_TYPE_SV;
392 yyerror_pv(Perl_form(aTHX_ "Type of arg %d to %"SVf" must be %s (not %s)",
393 (int)n, SVfARG(namesv), t, OP_DESC(kid)), SvUTF8(namesv) | flags);
397 S_no_bareword_allowed(pTHX_ OP *o)
399 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
402 return; /* various ok barewords are hidden in extra OP_NULL */
403 qerror(Perl_mess(aTHX_
404 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
406 o->op_private &= ~OPpCONST_STRICT; /* prevent warning twice about the same OP */
409 /* "register" allocation */
412 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
416 const bool is_our = (PL_parser->in_my == KEY_our);
418 PERL_ARGS_ASSERT_ALLOCMY;
420 if (flags & ~SVf_UTF8)
421 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
424 /* Until we're using the length for real, cross check that we're being
426 assert(strlen(name) == len);
428 /* complain about "my $<special_var>" etc etc */
432 ((flags & SVf_UTF8) && isIDFIRST_utf8((U8 *)name+1)) ||
433 (name[1] == '_' && (*name == '$' || len > 2))))
435 /* name[2] is true if strlen(name) > 2 */
436 if (!(flags & SVf_UTF8 && UTF8_IS_START(name[1]))
437 && (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1]))) {
438 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
439 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
440 PL_parser->in_my == KEY_state ? "state" : "my"));
442 yyerror_pv(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
443 PL_parser->in_my == KEY_state ? "state" : "my"), flags & SVf_UTF8);
447 /* allocate a spare slot and store the name in that slot */
449 off = pad_add_name_pvn(name, len,
450 (is_our ? padadd_OUR :
451 PL_parser->in_my == KEY_state ? padadd_STATE : 0)
452 | ( flags & SVf_UTF8 ? SVf_UTF8 : 0 ),
453 PL_parser->in_my_stash,
455 /* $_ is always in main::, even with our */
456 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
460 /* anon sub prototypes contains state vars should always be cloned,
461 * otherwise the state var would be shared between anon subs */
463 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
464 CvCLONE_on(PL_compcv);
470 =for apidoc alloccopstash
472 Available only under threaded builds, this function allocates an entry in
473 C<PL_stashpad> for the stash passed to it.
480 Perl_alloccopstash(pTHX_ HV *hv)
482 PADOFFSET off = 0, o = 1;
483 bool found_slot = FALSE;
485 PERL_ARGS_ASSERT_ALLOCCOPSTASH;
487 if (PL_stashpad[PL_stashpadix] == hv) return PL_stashpadix;
489 for (; o < PL_stashpadmax; ++o) {
490 if (PL_stashpad[o] == hv) return PL_stashpadix = o;
491 if (!PL_stashpad[o] || SvTYPE(PL_stashpad[o]) != SVt_PVHV)
492 found_slot = TRUE, off = o;
495 Renew(PL_stashpad, PL_stashpadmax + 10, HV *);
496 Zero(PL_stashpad + PL_stashpadmax, 10, HV *);
497 off = PL_stashpadmax;
498 PL_stashpadmax += 10;
501 PL_stashpad[PL_stashpadix = off] = hv;
506 /* free the body of an op without examining its contents.
507 * Always use this rather than FreeOp directly */
510 S_op_destroy(pTHX_ OP *o)
512 if (o->op_latefree) {
520 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b)
522 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a)
528 Perl_op_free(pTHX_ OP *o)
535 if (o->op_latefreed) {
542 if (o->op_private & OPpREFCOUNTED) {
553 refcnt = OpREFCNT_dec(o);
556 /* Need to find and remove any pattern match ops from the list
557 we maintain for reset(). */
558 find_and_forget_pmops(o);
568 /* Call the op_free hook if it has been set. Do it now so that it's called
569 * at the right time for refcounted ops, but still before all of the kids
573 if (o->op_flags & OPf_KIDS) {
574 register OP *kid, *nextkid;
575 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
576 nextkid = kid->op_sibling; /* Get before next freeing kid */
581 #ifdef PERL_DEBUG_READONLY_OPS
585 /* COP* is not cleared by op_clear() so that we may track line
586 * numbers etc even after null() */
587 if (type == OP_NEXTSTATE || type == OP_DBSTATE
588 || (type == OP_NULL /* the COP might have been null'ed */
589 && ((OPCODE)o->op_targ == OP_NEXTSTATE
590 || (OPCODE)o->op_targ == OP_DBSTATE))) {
595 type = (OPCODE)o->op_targ;
598 if (o->op_latefree) {
604 #ifdef DEBUG_LEAKING_SCALARS
611 Perl_op_clear(pTHX_ OP *o)
616 PERL_ARGS_ASSERT_OP_CLEAR;
619 mad_free(o->op_madprop);
624 switch (o->op_type) {
625 case OP_NULL: /* Was holding old type, if any. */
626 if (PL_madskills && o->op_targ != OP_NULL) {
627 o->op_type = (Optype)o->op_targ;
632 case OP_ENTEREVAL: /* Was holding hints. */
636 if (!(o->op_flags & OPf_REF)
637 || (PL_check[o->op_type] != Perl_ck_ftst))
644 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
649 /* It's possible during global destruction that the GV is freed
650 before the optree. Whilst the SvREFCNT_inc is happy to bump from
651 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0
652 will trigger an assertion failure, because the entry to sv_clear
653 checks that the scalar is not already freed. A check of for
654 !SvIS_FREED(gv) turns out to be invalid, because during global
655 destruction the reference count can be forced down to zero
656 (with SVf_BREAK set). In which case raising to 1 and then
657 dropping to 0 triggers cleanup before it should happen. I
658 *think* that this might actually be a general, systematic,
659 weakness of the whole idea of SVf_BREAK, in that code *is*
660 allowed to raise and lower references during global destruction,
661 so any *valid* code that happens to do this during global
662 destruction might well trigger premature cleanup. */
663 bool still_valid = gv && SvREFCNT(gv);
666 SvREFCNT_inc_simple_void(gv);
668 if (cPADOPo->op_padix > 0) {
669 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
670 * may still exist on the pad */
671 pad_swipe(cPADOPo->op_padix, TRUE);
672 cPADOPo->op_padix = 0;
675 SvREFCNT_dec(cSVOPo->op_sv);
676 cSVOPo->op_sv = NULL;
679 int try_downgrade = SvREFCNT(gv) == 2;
682 gv_try_downgrade(gv);
686 case OP_METHOD_NAMED:
689 SvREFCNT_dec(cSVOPo->op_sv);
690 cSVOPo->op_sv = NULL;
693 Even if op_clear does a pad_free for the target of the op,
694 pad_free doesn't actually remove the sv that exists in the pad;
695 instead it lives on. This results in that it could be reused as
696 a target later on when the pad was reallocated.
699 pad_swipe(o->op_targ,1);
708 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
713 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
715 if (cPADOPo->op_padix > 0) {
716 pad_swipe(cPADOPo->op_padix, TRUE);
717 cPADOPo->op_padix = 0;
720 SvREFCNT_dec(cSVOPo->op_sv);
721 cSVOPo->op_sv = NULL;
725 PerlMemShared_free(cPVOPo->op_pv);
726 cPVOPo->op_pv = NULL;
730 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
734 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
735 /* No GvIN_PAD_off here, because other references may still
736 * exist on the pad */
737 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
740 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
746 if (!(cPMOPo->op_pmflags & PMf_CODELIST_PRIVATE))
747 op_free(cPMOPo->op_code_list);
748 cPMOPo->op_code_list = NULL;
749 forget_pmop(cPMOPo, 1);
750 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
751 /* we use the same protection as the "SAFE" version of the PM_ macros
752 * here since sv_clean_all might release some PMOPs
753 * after PL_regex_padav has been cleared
754 * and the clearing of PL_regex_padav needs to
755 * happen before sv_clean_all
758 if(PL_regex_pad) { /* We could be in destruction */
759 const IV offset = (cPMOPo)->op_pmoffset;
760 ReREFCNT_dec(PM_GETRE(cPMOPo));
761 PL_regex_pad[offset] = &PL_sv_undef;
762 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
766 ReREFCNT_dec(PM_GETRE(cPMOPo));
767 PM_SETRE(cPMOPo, NULL);
773 if (o->op_targ > 0) {
774 pad_free(o->op_targ);
780 S_cop_free(pTHX_ COP* cop)
782 PERL_ARGS_ASSERT_COP_FREE;
785 if (! specialWARN(cop->cop_warnings))
786 PerlMemShared_free(cop->cop_warnings);
787 cophh_free(CopHINTHASH_get(cop));
791 S_forget_pmop(pTHX_ PMOP *const o
797 HV * const pmstash = PmopSTASH(o);
799 PERL_ARGS_ASSERT_FORGET_PMOP;
801 if (pmstash && !SvIS_FREED(pmstash) && SvMAGICAL(pmstash)) {
802 MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab);
804 PMOP **const array = (PMOP**) mg->mg_ptr;
805 U32 count = mg->mg_len / sizeof(PMOP**);
810 /* Found it. Move the entry at the end to overwrite it. */
811 array[i] = array[--count];
812 mg->mg_len = count * sizeof(PMOP**);
813 /* Could realloc smaller at this point always, but probably
814 not worth it. Probably worth free()ing if we're the
817 Safefree(mg->mg_ptr);
834 S_find_and_forget_pmops(pTHX_ OP *o)
836 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
838 if (o->op_flags & OPf_KIDS) {
839 OP *kid = cUNOPo->op_first;
841 switch (kid->op_type) {
846 forget_pmop((PMOP*)kid, 0);
848 find_and_forget_pmops(kid);
849 kid = kid->op_sibling;
855 Perl_op_null(pTHX_ OP *o)
859 PERL_ARGS_ASSERT_OP_NULL;
861 if (o->op_type == OP_NULL)
865 o->op_targ = o->op_type;
866 o->op_type = OP_NULL;
867 o->op_ppaddr = PL_ppaddr[OP_NULL];
871 Perl_op_refcnt_lock(pTHX)
879 Perl_op_refcnt_unlock(pTHX)
886 /* Contextualizers */
889 =for apidoc Am|OP *|op_contextualize|OP *o|I32 context
891 Applies a syntactic context to an op tree representing an expression.
892 I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>,
893 or C<G_VOID> to specify the context to apply. The modified op tree
900 Perl_op_contextualize(pTHX_ OP *o, I32 context)
902 PERL_ARGS_ASSERT_OP_CONTEXTUALIZE;
904 case G_SCALAR: return scalar(o);
905 case G_ARRAY: return list(o);
906 case G_VOID: return scalarvoid(o);
908 Perl_croak(aTHX_ "panic: op_contextualize bad context %ld",
915 =head1 Optree Manipulation Functions
917 =for apidoc Am|OP*|op_linklist|OP *o
918 This function is the implementation of the L</LINKLIST> macro. It should
919 not be called directly.
925 Perl_op_linklist(pTHX_ OP *o)
929 PERL_ARGS_ASSERT_OP_LINKLIST;
934 /* establish postfix order */
935 first = cUNOPo->op_first;
938 o->op_next = LINKLIST(first);
941 if (kid->op_sibling) {
942 kid->op_next = LINKLIST(kid->op_sibling);
943 kid = kid->op_sibling;
957 S_scalarkids(pTHX_ OP *o)
959 if (o && o->op_flags & OPf_KIDS) {
961 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
968 S_scalarboolean(pTHX_ OP *o)
972 PERL_ARGS_ASSERT_SCALARBOOLEAN;
974 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST
975 && !(cBINOPo->op_first->op_flags & OPf_SPECIAL)) {
976 if (ckWARN(WARN_SYNTAX)) {
977 const line_t oldline = CopLINE(PL_curcop);
979 if (PL_parser && PL_parser->copline != NOLINE)
980 CopLINE_set(PL_curcop, PL_parser->copline);
981 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
982 CopLINE_set(PL_curcop, oldline);
989 Perl_scalar(pTHX_ OP *o)
994 /* assumes no premature commitment */
995 if (!o || (PL_parser && PL_parser->error_count)
996 || (o->op_flags & OPf_WANT)
997 || o->op_type == OP_RETURN)
1002 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
1004 switch (o->op_type) {
1006 scalar(cBINOPo->op_first);
1011 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1021 if (o->op_flags & OPf_KIDS) {
1022 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1028 kid = cLISTOPo->op_first;
1030 kid = kid->op_sibling;
1033 OP *sib = kid->op_sibling;
1034 if (sib && kid->op_type != OP_LEAVEWHEN)
1040 PL_curcop = &PL_compiling;
1045 kid = cLISTOPo->op_first;
1048 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
1055 Perl_scalarvoid(pTHX_ OP *o)
1059 const char* useless = NULL;
1060 U32 useless_is_utf8 = 0;
1064 PERL_ARGS_ASSERT_SCALARVOID;
1066 /* trailing mad null ops don't count as "there" for void processing */
1068 o->op_type != OP_NULL &&
1070 o->op_sibling->op_type == OP_NULL)
1073 for (sib = o->op_sibling;
1074 sib && sib->op_type == OP_NULL;
1075 sib = sib->op_sibling) ;
1081 if (o->op_type == OP_NEXTSTATE
1082 || o->op_type == OP_DBSTATE
1083 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1084 || o->op_targ == OP_DBSTATE)))
1085 PL_curcop = (COP*)o; /* for warning below */
1087 /* assumes no premature commitment */
1088 want = o->op_flags & OPf_WANT;
1089 if ((want && want != OPf_WANT_SCALAR)
1090 || (PL_parser && PL_parser->error_count)
1091 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN)
1096 if ((o->op_private & OPpTARGET_MY)
1097 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1099 return scalar(o); /* As if inside SASSIGN */
1102 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1104 switch (o->op_type) {
1106 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1110 if (o->op_flags & OPf_STACKED)
1114 if (o->op_private == 4)
1139 case OP_AELEMFAST_LEX:
1158 case OP_GETSOCKNAME:
1159 case OP_GETPEERNAME:
1164 case OP_GETPRIORITY:
1189 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1190 /* Otherwise it's "Useless use of grep iterator" */
1191 useless = OP_DESC(o);
1195 kid = cLISTOPo->op_first;
1196 if (kid && kid->op_type == OP_PUSHRE
1198 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1200 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1202 useless = OP_DESC(o);
1206 kid = cUNOPo->op_first;
1207 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1208 kid->op_type != OP_TRANS && kid->op_type != OP_TRANSR) {
1211 useless = "negative pattern binding (!~)";
1215 if (cPMOPo->op_pmflags & PMf_NONDESTRUCT)
1216 useless = "non-destructive substitution (s///r)";
1220 useless = "non-destructive transliteration (tr///r)";
1227 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1228 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1229 useless = "a variable";
1234 if (cSVOPo->op_private & OPpCONST_STRICT)
1235 no_bareword_allowed(o);
1237 if (ckWARN(WARN_VOID)) {
1238 /* don't warn on optimised away booleans, eg
1239 * use constant Foo, 5; Foo || print; */
1240 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1242 /* the constants 0 and 1 are permitted as they are
1243 conventionally used as dummies in constructs like
1244 1 while some_condition_with_side_effects; */
1245 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1247 else if (SvPOK(sv)) {
1248 /* perl4's way of mixing documentation and code
1249 (before the invention of POD) was based on a
1250 trick to mix nroff and perl code. The trick was
1251 built upon these three nroff macros being used in
1252 void context. The pink camel has the details in
1253 the script wrapman near page 319. */
1254 const char * const maybe_macro = SvPVX_const(sv);
1255 if (strnEQ(maybe_macro, "di", 2) ||
1256 strnEQ(maybe_macro, "ds", 2) ||
1257 strnEQ(maybe_macro, "ig", 2))
1260 SV * const dsv = newSVpvs("");
1261 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1263 pv_pretty(dsv, maybe_macro, SvCUR(sv), 32, NULL, NULL,
1264 PERL_PV_PRETTY_DUMP | PERL_PV_ESCAPE_NOCLEAR | PERL_PV_ESCAPE_UNI_DETECT )));
1266 useless = SvPV_nolen(msv);
1267 useless_is_utf8 = SvUTF8(msv);
1270 else if (SvOK(sv)) {
1271 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1272 "a constant (%"SVf")", sv));
1273 useless = SvPV_nolen(msv);
1276 useless = "a constant (undef)";
1279 op_null(o); /* don't execute or even remember it */
1283 o->op_type = OP_PREINC; /* pre-increment is faster */
1284 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1288 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1289 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1293 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1294 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1298 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1299 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1304 UNOP *refgen, *rv2cv;
1307 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
1310 rv2gv = ((BINOP *)o)->op_last;
1311 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
1314 refgen = (UNOP *)((BINOP *)o)->op_first;
1316 if (!refgen || refgen->op_type != OP_REFGEN)
1319 exlist = (LISTOP *)refgen->op_first;
1320 if (!exlist || exlist->op_type != OP_NULL
1321 || exlist->op_targ != OP_LIST)
1324 if (exlist->op_first->op_type != OP_PUSHMARK)
1327 rv2cv = (UNOP*)exlist->op_last;
1329 if (rv2cv->op_type != OP_RV2CV)
1332 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
1333 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
1334 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
1336 o->op_private |= OPpASSIGN_CV_TO_GV;
1337 rv2gv->op_private |= OPpDONT_INIT_GV;
1338 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
1350 kid = cLOGOPo->op_first;
1351 if (kid->op_type == OP_NOT
1352 && (kid->op_flags & OPf_KIDS)
1354 if (o->op_type == OP_AND) {
1356 o->op_ppaddr = PL_ppaddr[OP_OR];
1358 o->op_type = OP_AND;
1359 o->op_ppaddr = PL_ppaddr[OP_AND];
1368 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1373 if (o->op_flags & OPf_STACKED)
1380 if (!(o->op_flags & OPf_KIDS))
1391 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1401 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %"SVf" in void context",
1402 newSVpvn_flags(useless, strlen(useless),
1403 SVs_TEMP | ( useless_is_utf8 ? SVf_UTF8 : 0 )));
1408 S_listkids(pTHX_ OP *o)
1410 if (o && o->op_flags & OPf_KIDS) {
1412 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1419 Perl_list(pTHX_ OP *o)
1424 /* assumes no premature commitment */
1425 if (!o || (o->op_flags & OPf_WANT)
1426 || (PL_parser && PL_parser->error_count)
1427 || o->op_type == OP_RETURN)
1432 if ((o->op_private & OPpTARGET_MY)
1433 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1435 return o; /* As if inside SASSIGN */
1438 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1440 switch (o->op_type) {
1443 list(cBINOPo->op_first);
1448 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1456 if (!(o->op_flags & OPf_KIDS))
1458 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1459 list(cBINOPo->op_first);
1460 return gen_constant_list(o);
1467 kid = cLISTOPo->op_first;
1469 kid = kid->op_sibling;
1472 OP *sib = kid->op_sibling;
1473 if (sib && kid->op_type != OP_LEAVEWHEN)
1479 PL_curcop = &PL_compiling;
1483 kid = cLISTOPo->op_first;
1490 S_scalarseq(pTHX_ OP *o)
1494 const OPCODE type = o->op_type;
1496 if (type == OP_LINESEQ || type == OP_SCOPE ||
1497 type == OP_LEAVE || type == OP_LEAVETRY)
1500 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1501 if (kid->op_sibling) {
1505 PL_curcop = &PL_compiling;
1507 o->op_flags &= ~OPf_PARENS;
1508 if (PL_hints & HINT_BLOCK_SCOPE)
1509 o->op_flags |= OPf_PARENS;
1512 o = newOP(OP_STUB, 0);
1517 S_modkids(pTHX_ OP *o, I32 type)
1519 if (o && o->op_flags & OPf_KIDS) {
1521 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1522 op_lvalue(kid, type);
1528 =for apidoc finalize_optree
1530 This function finalizes the optree. Should be called directly after
1531 the complete optree is built. It does some additional
1532 checking which can't be done in the normal ck_xxx functions and makes
1533 the tree thread-safe.
1538 Perl_finalize_optree(pTHX_ OP* o)
1540 PERL_ARGS_ASSERT_FINALIZE_OPTREE;
1543 SAVEVPTR(PL_curcop);
1551 S_finalize_op(pTHX_ OP* o)
1553 PERL_ARGS_ASSERT_FINALIZE_OP;
1555 #if defined(PERL_MAD) && defined(USE_ITHREADS)
1557 /* Make sure mad ops are also thread-safe */
1558 MADPROP *mp = o->op_madprop;
1560 if (mp->mad_type == MAD_OP && mp->mad_vlen) {
1561 OP *prop_op = (OP *) mp->mad_val;
1562 /* We only need "Relocate sv to the pad for thread safety.", but this
1563 easiest way to make sure it traverses everything */
1564 if (prop_op->op_type == OP_CONST)
1565 cSVOPx(prop_op)->op_private &= ~OPpCONST_STRICT;
1566 finalize_op(prop_op);
1573 switch (o->op_type) {
1576 PL_curcop = ((COP*)o); /* for warnings */
1580 && (o->op_sibling->op_type == OP_NEXTSTATE || o->op_sibling->op_type == OP_DBSTATE)
1581 && ckWARN(WARN_SYNTAX))
1583 if (o->op_sibling->op_sibling) {
1584 const OPCODE type = o->op_sibling->op_sibling->op_type;
1585 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
1586 const line_t oldline = CopLINE(PL_curcop);
1587 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_sibling));
1588 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1589 "Statement unlikely to be reached");
1590 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1591 "\t(Maybe you meant system() when you said exec()?)\n");
1592 CopLINE_set(PL_curcop, oldline);
1599 if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
1600 GV * const gv = cGVOPo_gv;
1601 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
1602 /* XXX could check prototype here instead of just carping */
1603 SV * const sv = sv_newmortal();
1604 gv_efullname3(sv, gv, NULL);
1605 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
1606 "%"SVf"() called too early to check prototype",
1613 if (cSVOPo->op_private & OPpCONST_STRICT)
1614 no_bareword_allowed(o);
1618 case OP_METHOD_NAMED:
1619 /* Relocate sv to the pad for thread safety.
1620 * Despite being a "constant", the SV is written to,
1621 * for reference counts, sv_upgrade() etc. */
1622 if (cSVOPo->op_sv) {
1623 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
1624 if (o->op_type != OP_METHOD_NAMED &&
1625 (SvPADTMP(cSVOPo->op_sv) || SvPADMY(cSVOPo->op_sv)))
1627 /* If op_sv is already a PADTMP/MY then it is being used by
1628 * some pad, so make a copy. */
1629 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
1630 SvREADONLY_on(PAD_SVl(ix));
1631 SvREFCNT_dec(cSVOPo->op_sv);
1633 else if (o->op_type != OP_METHOD_NAMED
1634 && cSVOPo->op_sv == &PL_sv_undef) {
1635 /* PL_sv_undef is hack - it's unsafe to store it in the
1636 AV that is the pad, because av_fetch treats values of
1637 PL_sv_undef as a "free" AV entry and will merrily
1638 replace them with a new SV, causing pad_alloc to think
1639 that this pad slot is free. (When, clearly, it is not)
1641 SvOK_off(PAD_SVl(ix));
1642 SvPADTMP_on(PAD_SVl(ix));
1643 SvREADONLY_on(PAD_SVl(ix));
1646 SvREFCNT_dec(PAD_SVl(ix));
1647 SvPADTMP_on(cSVOPo->op_sv);
1648 PAD_SETSV(ix, cSVOPo->op_sv);
1649 /* XXX I don't know how this isn't readonly already. */
1650 SvREADONLY_on(PAD_SVl(ix));
1652 cSVOPo->op_sv = NULL;
1663 const char *key = NULL;
1666 if (((BINOP*)o)->op_last->op_type != OP_CONST)
1669 /* Make the CONST have a shared SV */
1670 svp = cSVOPx_svp(((BINOP*)o)->op_last);
1671 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv))
1672 && SvTYPE(sv) < SVt_PVMG && !SvROK(sv)) {
1673 key = SvPV_const(sv, keylen);
1674 lexname = newSVpvn_share(key,
1675 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
1681 if ((o->op_private & (OPpLVAL_INTRO)))
1684 rop = (UNOP*)((BINOP*)o)->op_first;
1685 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
1687 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
1688 if (!SvPAD_TYPED(lexname))
1690 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1691 if (!fields || !GvHV(*fields))
1693 key = SvPV_const(*svp, keylen);
1694 if (!hv_fetch(GvHV(*fields), key,
1695 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1696 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1697 "in variable %"SVf" of type %"HEKf,
1698 SVfARG(*svp), SVfARG(lexname),
1699 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
1711 SVOP *first_key_op, *key_op;
1713 if ((o->op_private & (OPpLVAL_INTRO))
1714 /* I bet there's always a pushmark... */
1715 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
1716 /* hmmm, no optimization if list contains only one key. */
1718 rop = (UNOP*)((LISTOP*)o)->op_last;
1719 if (rop->op_type != OP_RV2HV)
1721 if (rop->op_first->op_type == OP_PADSV)
1722 /* @$hash{qw(keys here)} */
1723 rop = (UNOP*)rop->op_first;
1725 /* @{$hash}{qw(keys here)} */
1726 if (rop->op_first->op_type == OP_SCOPE
1727 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
1729 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
1735 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
1736 if (!SvPAD_TYPED(lexname))
1738 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1739 if (!fields || !GvHV(*fields))
1741 /* Again guessing that the pushmark can be jumped over.... */
1742 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
1743 ->op_first->op_sibling;
1744 for (key_op = first_key_op; key_op;
1745 key_op = (SVOP*)key_op->op_sibling) {
1746 if (key_op->op_type != OP_CONST)
1748 svp = cSVOPx_svp(key_op);
1749 key = SvPV_const(*svp, keylen);
1750 if (!hv_fetch(GvHV(*fields), key,
1751 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1752 Perl_croak(aTHX_ "No such class field \"%"SVf"\" "
1753 "in variable %"SVf" of type %"HEKf,
1754 SVfARG(*svp), SVfARG(lexname),
1755 HEKfARG(HvNAME_HEK(SvSTASH(lexname))));
1761 if (cPMOPo->op_pmreplrootu.op_pmreplroot)
1762 finalize_op(cPMOPo->op_pmreplrootu.op_pmreplroot);
1769 if (o->op_flags & OPf_KIDS) {
1771 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1777 =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
1779 Propagate lvalue ("modifiable") context to an op and its children.
1780 I<type> represents the context type, roughly based on the type of op that
1781 would do the modifying, although C<local()> is represented by OP_NULL,
1782 because it has no op type of its own (it is signalled by a flag on
1785 This function detects things that can't be modified, such as C<$x+1>, and
1786 generates errors for them. For example, C<$x+1 = 2> would cause it to be
1787 called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN.
1789 It also flags things that need to behave specially in an lvalue context,
1790 such as C<$$x = 5> which might have to vivify a reference in C<$x>.
1796 Perl_op_lvalue_flags(pTHX_ OP *o, I32 type, U32 flags)
1800 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1803 if (!o || (PL_parser && PL_parser->error_count))
1806 if ((o->op_private & OPpTARGET_MY)
1807 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1812 assert( (o->op_flags & OPf_WANT) != OPf_WANT_VOID );
1814 if (type == OP_PRTF || type == OP_SPRINTF) type = OP_ENTERSUB;
1816 switch (o->op_type) {
1821 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1825 if ((type == OP_UNDEF || type == OP_REFGEN || type == OP_LOCK) &&
1826 !(o->op_flags & OPf_STACKED)) {
1827 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1828 /* Both ENTERSUB and RV2CV use this bit, but for different pur-
1829 poses, so we need it clear. */
1830 o->op_private &= ~1;
1831 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1832 assert(cUNOPo->op_first->op_type == OP_NULL);
1833 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1836 else { /* lvalue subroutine call */
1837 o->op_private |= OPpLVAL_INTRO
1838 |(OPpENTERSUB_INARGS * (type == OP_LEAVESUBLV));
1839 PL_modcount = RETURN_UNLIMITED_NUMBER;
1840 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1841 /* Potential lvalue context: */
1842 o->op_private |= OPpENTERSUB_INARGS;
1845 else { /* Compile-time error message: */
1846 OP *kid = cUNOPo->op_first;
1849 if (kid->op_type != OP_PUSHMARK) {
1850 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1852 "panic: unexpected lvalue entersub "
1853 "args: type/targ %ld:%"UVuf,
1854 (long)kid->op_type, (UV)kid->op_targ);
1855 kid = kLISTOP->op_first;
1857 while (kid->op_sibling)
1858 kid = kid->op_sibling;
1859 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1860 break; /* Postpone until runtime */
1863 kid = kUNOP->op_first;
1864 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1865 kid = kUNOP->op_first;
1866 if (kid->op_type == OP_NULL)
1868 "Unexpected constant lvalue entersub "
1869 "entry via type/targ %ld:%"UVuf,
1870 (long)kid->op_type, (UV)kid->op_targ);
1871 if (kid->op_type != OP_GV) {
1875 cv = GvCV(kGVOP_gv);
1885 if (flags & OP_LVALUE_NO_CROAK) return NULL;
1886 /* grep, foreach, subcalls, refgen */
1887 if (type == OP_GREPSTART || type == OP_ENTERSUB
1888 || type == OP_REFGEN || type == OP_LEAVESUBLV)
1890 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1891 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1893 : (o->op_type == OP_ENTERSUB
1894 ? "non-lvalue subroutine call"
1896 type ? PL_op_desc[type] : "local"));
1910 case OP_RIGHT_SHIFT:
1919 if (!(o->op_flags & OPf_STACKED))
1926 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1927 op_lvalue(kid, type);
1932 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1933 PL_modcount = RETURN_UNLIMITED_NUMBER;
1934 return o; /* Treat \(@foo) like ordinary list. */
1938 if (scalar_mod_type(o, type))
1940 ref(cUNOPo->op_first, o->op_type);
1944 if (type == OP_LEAVESUBLV)
1945 o->op_private |= OPpMAYBE_LVSUB;
1951 PL_modcount = RETURN_UNLIMITED_NUMBER;
1954 PL_hints |= HINT_BLOCK_SCOPE;
1955 if (type == OP_LEAVESUBLV)
1956 o->op_private |= OPpMAYBE_LVSUB;
1960 ref(cUNOPo->op_first, o->op_type);
1964 PL_hints |= HINT_BLOCK_SCOPE;
1973 case OP_AELEMFAST_LEX:
1980 PL_modcount = RETURN_UNLIMITED_NUMBER;
1981 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1982 return o; /* Treat \(@foo) like ordinary list. */
1983 if (scalar_mod_type(o, type))
1985 if (type == OP_LEAVESUBLV)
1986 o->op_private |= OPpMAYBE_LVSUB;
1990 if (!type) /* local() */
1991 Perl_croak(aTHX_ "Can't localize lexical variable %"SVf,
1992 PAD_COMPNAME_SV(o->op_targ));
2001 if (type != OP_SASSIGN && type != OP_LEAVESUBLV)
2005 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
2011 if (type == OP_LEAVESUBLV)
2012 o->op_private |= OPpMAYBE_LVSUB;
2013 pad_free(o->op_targ);
2014 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
2015 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
2016 if (o->op_flags & OPf_KIDS)
2017 op_lvalue(cBINOPo->op_first->op_sibling, type);
2022 ref(cBINOPo->op_first, o->op_type);
2023 if (type == OP_ENTERSUB &&
2024 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
2025 o->op_private |= OPpLVAL_DEFER;
2026 if (type == OP_LEAVESUBLV)
2027 o->op_private |= OPpMAYBE_LVSUB;
2037 if (o->op_flags & OPf_KIDS)
2038 op_lvalue(cLISTOPo->op_last, type);
2043 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
2045 else if (!(o->op_flags & OPf_KIDS))
2047 if (o->op_targ != OP_LIST) {
2048 op_lvalue(cBINOPo->op_first, type);
2054 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2055 /* elements might be in void context because the list is
2056 in scalar context or because they are attribute sub calls */
2057 if ( (kid->op_flags & OPf_WANT) != OPf_WANT_VOID )
2058 op_lvalue(kid, type);
2062 if (type != OP_LEAVESUBLV)
2064 break; /* op_lvalue()ing was handled by ck_return() */
2070 /* [20011101.069] File test operators interpret OPf_REF to mean that
2071 their argument is a filehandle; thus \stat(".") should not set
2073 if (type == OP_REFGEN &&
2074 PL_check[o->op_type] == Perl_ck_ftst)
2077 if (type != OP_LEAVESUBLV)
2078 o->op_flags |= OPf_MOD;
2080 if (type == OP_AASSIGN || type == OP_SASSIGN)
2081 o->op_flags |= OPf_SPECIAL|OPf_REF;
2082 else if (!type) { /* local() */
2085 o->op_private |= OPpLVAL_INTRO;
2086 o->op_flags &= ~OPf_SPECIAL;
2087 PL_hints |= HINT_BLOCK_SCOPE;
2092 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
2093 "Useless localization of %s", OP_DESC(o));
2096 else if (type != OP_GREPSTART && type != OP_ENTERSUB
2097 && type != OP_LEAVESUBLV)
2098 o->op_flags |= OPf_REF;
2103 S_scalar_mod_type(const OP *o, I32 type)
2108 if (o && o->op_type == OP_RV2GV)
2132 case OP_RIGHT_SHIFT:
2153 S_is_handle_constructor(const OP *o, I32 numargs)
2155 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
2157 switch (o->op_type) {
2165 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
2178 S_refkids(pTHX_ OP *o, I32 type)
2180 if (o && o->op_flags & OPf_KIDS) {
2182 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2189 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
2194 PERL_ARGS_ASSERT_DOREF;
2196 if (!o || (PL_parser && PL_parser->error_count))
2199 switch (o->op_type) {
2201 if ((type == OP_EXISTS || type == OP_DEFINED) &&
2202 !(o->op_flags & OPf_STACKED)) {
2203 o->op_type = OP_RV2CV; /* entersub => rv2cv */
2204 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
2205 assert(cUNOPo->op_first->op_type == OP_NULL);
2206 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
2207 o->op_flags |= OPf_SPECIAL;
2208 o->op_private &= ~1;
2210 else if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV){
2211 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2212 : type == OP_RV2HV ? OPpDEREF_HV
2214 o->op_flags |= OPf_MOD;
2220 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2221 doref(kid, type, set_op_ref);
2224 if (type == OP_DEFINED)
2225 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2226 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2229 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2230 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2231 : type == OP_RV2HV ? OPpDEREF_HV
2233 o->op_flags |= OPf_MOD;
2240 o->op_flags |= OPf_REF;
2243 if (type == OP_DEFINED)
2244 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2245 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2251 o->op_flags |= OPf_REF;
2256 if (!(o->op_flags & OPf_KIDS))
2258 doref(cBINOPo->op_first, type, set_op_ref);
2262 doref(cBINOPo->op_first, o->op_type, set_op_ref);
2263 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2264 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2265 : type == OP_RV2HV ? OPpDEREF_HV
2267 o->op_flags |= OPf_MOD;
2277 if (!(o->op_flags & OPf_KIDS))
2279 doref(cLISTOPo->op_last, type, set_op_ref);
2289 S_dup_attrlist(pTHX_ OP *o)
2294 PERL_ARGS_ASSERT_DUP_ATTRLIST;
2296 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
2297 * where the first kid is OP_PUSHMARK and the remaining ones
2298 * are OP_CONST. We need to push the OP_CONST values.
2300 if (o->op_type == OP_CONST)
2301 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
2303 else if (o->op_type == OP_NULL)
2307 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
2309 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
2310 if (o->op_type == OP_CONST)
2311 rop = op_append_elem(OP_LIST, rop,
2312 newSVOP(OP_CONST, o->op_flags,
2313 SvREFCNT_inc_NN(cSVOPo->op_sv)));
2320 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
2325 PERL_ARGS_ASSERT_APPLY_ATTRS;
2327 /* fake up C<use attributes $pkg,$rv,@attrs> */
2328 ENTER; /* need to protect against side-effects of 'use' */
2329 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2331 #define ATTRSMODULE "attributes"
2332 #define ATTRSMODULE_PM "attributes.pm"
2335 /* Don't force the C<use> if we don't need it. */
2336 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
2337 if (svp && *svp != &PL_sv_undef)
2338 NOOP; /* already in %INC */
2340 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
2341 newSVpvs(ATTRSMODULE), NULL);
2344 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2345 newSVpvs(ATTRSMODULE),
2347 op_prepend_elem(OP_LIST,
2348 newSVOP(OP_CONST, 0, stashsv),
2349 op_prepend_elem(OP_LIST,
2350 newSVOP(OP_CONST, 0,
2352 dup_attrlist(attrs))));
2358 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2361 OP *pack, *imop, *arg;
2364 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2369 assert(target->op_type == OP_PADSV ||
2370 target->op_type == OP_PADHV ||
2371 target->op_type == OP_PADAV);
2373 /* Ensure that attributes.pm is loaded. */
2374 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
2376 /* Need package name for method call. */
2377 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
2379 /* Build up the real arg-list. */
2380 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2382 arg = newOP(OP_PADSV, 0);
2383 arg->op_targ = target->op_targ;
2384 arg = op_prepend_elem(OP_LIST,
2385 newSVOP(OP_CONST, 0, stashsv),
2386 op_prepend_elem(OP_LIST,
2387 newUNOP(OP_REFGEN, 0,
2388 op_lvalue(arg, OP_REFGEN)),
2389 dup_attrlist(attrs)));
2391 /* Fake up a method call to import */
2392 meth = newSVpvs_share("import");
2393 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2394 op_append_elem(OP_LIST,
2395 op_prepend_elem(OP_LIST, pack, list(arg)),
2396 newSVOP(OP_METHOD_NAMED, 0, meth)));
2398 /* Combine the ops. */
2399 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
2403 =notfor apidoc apply_attrs_string
2405 Attempts to apply a list of attributes specified by the C<attrstr> and
2406 C<len> arguments to the subroutine identified by the C<cv> argument which
2407 is expected to be associated with the package identified by the C<stashpv>
2408 argument (see L<attributes>). It gets this wrong, though, in that it
2409 does not correctly identify the boundaries of the individual attribute
2410 specifications within C<attrstr>. This is not really intended for the
2411 public API, but has to be listed here for systems such as AIX which
2412 need an explicit export list for symbols. (It's called from XS code
2413 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2414 to respect attribute syntax properly would be welcome.
2420 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2421 const char *attrstr, STRLEN len)
2425 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2428 len = strlen(attrstr);
2432 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2434 const char * const sstr = attrstr;
2435 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2436 attrs = op_append_elem(OP_LIST, attrs,
2437 newSVOP(OP_CONST, 0,
2438 newSVpvn(sstr, attrstr-sstr)));
2442 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2443 newSVpvs(ATTRSMODULE),
2444 NULL, op_prepend_elem(OP_LIST,
2445 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2446 op_prepend_elem(OP_LIST,
2447 newSVOP(OP_CONST, 0,
2448 newRV(MUTABLE_SV(cv))),
2453 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2457 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
2459 PERL_ARGS_ASSERT_MY_KID;
2461 if (!o || (PL_parser && PL_parser->error_count))
2465 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2466 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2470 if (type == OP_LIST) {
2472 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2473 my_kid(kid, attrs, imopsp);
2475 } else if (type == OP_UNDEF
2481 } else if (type == OP_RV2SV || /* "our" declaration */
2483 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2484 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2485 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2487 PL_parser->in_my == KEY_our
2489 : PL_parser->in_my == KEY_state ? "state" : "my"));
2491 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2492 PL_parser->in_my = FALSE;
2493 PL_parser->in_my_stash = NULL;
2494 apply_attrs(GvSTASH(gv),
2495 (type == OP_RV2SV ? GvSV(gv) :
2496 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2497 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2500 o->op_private |= OPpOUR_INTRO;
2503 else if (type != OP_PADSV &&
2506 type != OP_PUSHMARK)
2508 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2510 PL_parser->in_my == KEY_our
2512 : PL_parser->in_my == KEY_state ? "state" : "my"));
2515 else if (attrs && type != OP_PUSHMARK) {
2518 PL_parser->in_my = FALSE;
2519 PL_parser->in_my_stash = NULL;
2521 /* check for C<my Dog $spot> when deciding package */
2522 stash = PAD_COMPNAME_TYPE(o->op_targ);
2524 stash = PL_curstash;
2525 apply_attrs_my(stash, o, attrs, imopsp);
2527 o->op_flags |= OPf_MOD;
2528 o->op_private |= OPpLVAL_INTRO;
2530 o->op_private |= OPpPAD_STATE;
2535 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2539 int maybe_scalar = 0;
2541 PERL_ARGS_ASSERT_MY_ATTRS;
2543 /* [perl #17376]: this appears to be premature, and results in code such as
2544 C< our(%x); > executing in list mode rather than void mode */
2546 if (o->op_flags & OPf_PARENS)
2556 o = my_kid(o, attrs, &rops);
2558 if (maybe_scalar && o->op_type == OP_PADSV) {
2559 o = scalar(op_append_list(OP_LIST, rops, o));
2560 o->op_private |= OPpLVAL_INTRO;
2563 /* The listop in rops might have a pushmark at the beginning,
2564 which will mess up list assignment. */
2565 LISTOP * const lrops = (LISTOP *)rops; /* for brevity */
2566 if (rops->op_type == OP_LIST &&
2567 lrops->op_first && lrops->op_first->op_type == OP_PUSHMARK)
2569 OP * const pushmark = lrops->op_first;
2570 lrops->op_first = pushmark->op_sibling;
2573 o = op_append_list(OP_LIST, o, rops);
2576 PL_parser->in_my = FALSE;
2577 PL_parser->in_my_stash = NULL;
2582 Perl_sawparens(pTHX_ OP *o)
2584 PERL_UNUSED_CONTEXT;
2586 o->op_flags |= OPf_PARENS;
2591 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2595 const OPCODE ltype = left->op_type;
2596 const OPCODE rtype = right->op_type;
2598 PERL_ARGS_ASSERT_BIND_MATCH;
2600 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2601 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2603 const char * const desc
2605 rtype == OP_SUBST || rtype == OP_TRANS
2606 || rtype == OP_TRANSR
2608 ? (int)rtype : OP_MATCH];
2609 const bool isary = ltype == OP_RV2AV || ltype == OP_PADAV;
2612 (ltype == OP_RV2AV || ltype == OP_RV2HV)
2613 ? cUNOPx(left)->op_first->op_type == OP_GV
2614 && (gv = cGVOPx_gv(cUNOPx(left)->op_first))
2615 ? varname(gv, isary ? '@' : '%', 0, NULL, 0, 1)
2618 (GV *)PL_compcv, isary ? '@' : '%', left->op_targ, NULL, 0, 1
2621 Perl_warner(aTHX_ packWARN(WARN_MISC),
2622 "Applying %s to %"SVf" will act on scalar(%"SVf")",
2625 const char * const sample = (isary
2626 ? "@array" : "%hash");
2627 Perl_warner(aTHX_ packWARN(WARN_MISC),
2628 "Applying %s to %s will act on scalar(%s)",
2629 desc, sample, sample);
2633 if (rtype == OP_CONST &&
2634 cSVOPx(right)->op_private & OPpCONST_BARE &&
2635 cSVOPx(right)->op_private & OPpCONST_STRICT)
2637 no_bareword_allowed(right);
2640 /* !~ doesn't make sense with /r, so error on it for now */
2641 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2643 yyerror("Using !~ with s///r doesn't make sense");
2644 if (rtype == OP_TRANSR && type == OP_NOT)
2645 yyerror("Using !~ with tr///r doesn't make sense");
2647 ismatchop = (rtype == OP_MATCH ||
2648 rtype == OP_SUBST ||
2649 rtype == OP_TRANS || rtype == OP_TRANSR)
2650 && !(right->op_flags & OPf_SPECIAL);
2651 if (ismatchop && right->op_private & OPpTARGET_MY) {
2653 right->op_private &= ~OPpTARGET_MY;
2655 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2658 right->op_flags |= OPf_STACKED;
2659 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
2660 ! (rtype == OP_TRANS &&
2661 right->op_private & OPpTRANS_IDENTICAL) &&
2662 ! (rtype == OP_SUBST &&
2663 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
2664 newleft = op_lvalue(left, rtype);
2667 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
2668 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2670 o = op_prepend_elem(rtype, scalar(newleft), right);
2672 return newUNOP(OP_NOT, 0, scalar(o));
2676 return bind_match(type, left,
2677 pmruntime(newPMOP(OP_MATCH, 0), right, 0, 0));
2681 Perl_invert(pTHX_ OP *o)
2685 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2689 =for apidoc Amx|OP *|op_scope|OP *o
2691 Wraps up an op tree with some additional ops so that at runtime a dynamic
2692 scope will be created. The original ops run in the new dynamic scope,
2693 and then, provided that they exit normally, the scope will be unwound.
2694 The additional ops used to create and unwind the dynamic scope will
2695 normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2696 instead if the ops are simple enough to not need the full dynamic scope
2703 Perl_op_scope(pTHX_ OP *o)
2707 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2708 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2709 o->op_type = OP_LEAVE;
2710 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2712 else if (o->op_type == OP_LINESEQ) {
2714 o->op_type = OP_SCOPE;
2715 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2716 kid = ((LISTOP*)o)->op_first;
2717 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2720 /* The following deals with things like 'do {1 for 1}' */
2721 kid = kid->op_sibling;
2723 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2728 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2734 Perl_block_start(pTHX_ int full)
2737 const int retval = PL_savestack_ix;
2739 pad_block_start(full);
2741 PL_hints &= ~HINT_BLOCK_SCOPE;
2742 SAVECOMPILEWARNINGS();
2743 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2745 CALL_BLOCK_HOOKS(bhk_start, full);
2751 Perl_block_end(pTHX_ I32 floor, OP *seq)
2754 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2755 OP* retval = scalarseq(seq);
2757 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
2760 CopHINTS_set(&PL_compiling, PL_hints);
2762 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2765 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
2771 =head1 Compile-time scope hooks
2773 =for apidoc Aox||blockhook_register
2775 Register a set of hooks to be called when the Perl lexical scope changes
2776 at compile time. See L<perlguts/"Compile-time scope hooks">.
2782 Perl_blockhook_register(pTHX_ BHK *hk)
2784 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2786 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2793 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
2794 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2795 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2798 OP * const o = newOP(OP_PADSV, 0);
2799 o->op_targ = offset;
2805 Perl_newPROG(pTHX_ OP *o)
2809 PERL_ARGS_ASSERT_NEWPROG;
2816 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2817 ((PL_in_eval & EVAL_KEEPERR)
2818 ? OPf_SPECIAL : 0), o);
2820 cx = &cxstack[cxstack_ix];
2821 assert(CxTYPE(cx) == CXt_EVAL);
2823 if ((cx->blk_gimme & G_WANT) == G_VOID)
2824 scalarvoid(PL_eval_root);
2825 else if ((cx->blk_gimme & G_WANT) == G_ARRAY)
2828 scalar(PL_eval_root);
2830 /* don't use LINKLIST, since PL_eval_root might indirect through
2831 * a rather expensive function call and LINKLIST evaluates its
2832 * argument more than once */
2833 PL_eval_start = op_linklist(PL_eval_root);
2834 PL_eval_root->op_private |= OPpREFCOUNTED;
2835 OpREFCNT_set(PL_eval_root, 1);
2836 PL_eval_root->op_next = 0;
2837 i = PL_savestack_ix;
2840 CALL_PEEP(PL_eval_start);
2841 finalize_optree(PL_eval_root);
2843 PL_savestack_ix = i;
2846 if (o->op_type == OP_STUB) {
2847 PL_comppad_name = 0;
2849 S_op_destroy(aTHX_ o);
2852 PL_main_root = op_scope(sawparens(scalarvoid(o)));
2853 PL_curcop = &PL_compiling;
2854 PL_main_start = LINKLIST(PL_main_root);
2855 PL_main_root->op_private |= OPpREFCOUNTED;
2856 OpREFCNT_set(PL_main_root, 1);
2857 PL_main_root->op_next = 0;
2858 CALL_PEEP(PL_main_start);
2859 finalize_optree(PL_main_root);
2862 /* Register with debugger */
2864 CV * const cv = get_cvs("DB::postponed", 0);
2868 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
2870 call_sv(MUTABLE_SV(cv), G_DISCARD);
2877 Perl_localize(pTHX_ OP *o, I32 lex)
2881 PERL_ARGS_ASSERT_LOCALIZE;
2883 if (o->op_flags & OPf_PARENS)
2884 /* [perl #17376]: this appears to be premature, and results in code such as
2885 C< our(%x); > executing in list mode rather than void mode */
2892 if ( PL_parser->bufptr > PL_parser->oldbufptr
2893 && PL_parser->bufptr[-1] == ','
2894 && ckWARN(WARN_PARENTHESIS))
2896 char *s = PL_parser->bufptr;
2899 /* some heuristics to detect a potential error */
2900 while (*s && (strchr(", \t\n", *s)))
2904 if (*s && strchr("@$%*", *s) && *++s
2905 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2908 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2910 while (*s && (strchr(", \t\n", *s)))
2916 if (sigil && (*s == ';' || *s == '=')) {
2917 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2918 "Parentheses missing around \"%s\" list",
2920 ? (PL_parser->in_my == KEY_our
2922 : PL_parser->in_my == KEY_state
2932 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
2933 PL_parser->in_my = FALSE;
2934 PL_parser->in_my_stash = NULL;
2939 Perl_jmaybe(pTHX_ OP *o)
2941 PERL_ARGS_ASSERT_JMAYBE;
2943 if (o->op_type == OP_LIST) {
2945 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2946 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
2951 PERL_STATIC_INLINE OP *
2952 S_op_std_init(pTHX_ OP *o)
2954 I32 type = o->op_type;
2956 PERL_ARGS_ASSERT_OP_STD_INIT;
2958 if (PL_opargs[type] & OA_RETSCALAR)
2960 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2961 o->op_targ = pad_alloc(type, SVs_PADTMP);
2966 PERL_STATIC_INLINE OP *
2967 S_op_integerize(pTHX_ OP *o)
2969 I32 type = o->op_type;
2971 PERL_ARGS_ASSERT_OP_INTEGERIZE;
2973 /* integerize op, unless it happens to be C<-foo>.
2974 * XXX should pp_i_negate() do magic string negation instead? */
2975 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2976 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2977 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2980 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2983 if (type == OP_NEGATE)
2984 /* XXX might want a ck_negate() for this */
2985 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2991 S_fold_constants(pTHX_ register OP *o)
2994 register OP * VOL curop;
2996 VOL I32 type = o->op_type;
3001 SV * const oldwarnhook = PL_warnhook;
3002 SV * const olddiehook = PL_diehook;
3006 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
3008 if (!(PL_opargs[type] & OA_FOLDCONST))
3022 /* XXX what about the numeric ops? */
3023 if (IN_LOCALE_COMPILETIME)
3027 if (o->op_private & OPpREPEAT_DOLIST) goto nope;
3030 if (PL_parser && PL_parser->error_count)
3031 goto nope; /* Don't try to run w/ errors */
3033 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
3034 const OPCODE type = curop->op_type;
3035 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
3037 type != OP_SCALAR &&
3039 type != OP_PUSHMARK)
3045 curop = LINKLIST(o);
3046 old_next = o->op_next;
3050 oldscope = PL_scopestack_ix;
3051 create_eval_scope(G_FAKINGEVAL);
3053 /* Verify that we don't need to save it: */
3054 assert(PL_curcop == &PL_compiling);
3055 StructCopy(&PL_compiling, ¬_compiling, COP);
3056 PL_curcop = ¬_compiling;
3057 /* The above ensures that we run with all the correct hints of the
3058 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
3059 assert(IN_PERL_RUNTIME);
3060 PL_warnhook = PERL_WARNHOOK_FATAL;
3067 sv = *(PL_stack_sp--);
3068 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
3070 /* Can't simply swipe the SV from the pad, because that relies on
3071 the op being freed "real soon now". Under MAD, this doesn't
3072 happen (see the #ifdef below). */
3075 pad_swipe(o->op_targ, FALSE);
3078 else if (SvTEMP(sv)) { /* grab mortal temp? */
3079 SvREFCNT_inc_simple_void(sv);
3084 /* Something tried to die. Abandon constant folding. */
3085 /* Pretend the error never happened. */
3087 o->op_next = old_next;
3091 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
3092 PL_warnhook = oldwarnhook;
3093 PL_diehook = olddiehook;
3094 /* XXX note that this croak may fail as we've already blown away
3095 * the stack - eg any nested evals */
3096 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
3099 PL_warnhook = oldwarnhook;
3100 PL_diehook = olddiehook;
3101 PL_curcop = &PL_compiling;
3103 if (PL_scopestack_ix > oldscope)
3104 delete_eval_scope();
3113 if (type == OP_RV2GV)
3114 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
3116 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
3117 op_getmad(o,newop,'f');
3125 S_gen_constant_list(pTHX_ register OP *o)
3129 const I32 oldtmps_floor = PL_tmps_floor;
3132 if (PL_parser && PL_parser->error_count)
3133 return o; /* Don't attempt to run with errors */
3135 PL_op = curop = LINKLIST(o);
3138 Perl_pp_pushmark(aTHX);
3141 assert (!(curop->op_flags & OPf_SPECIAL));
3142 assert(curop->op_type == OP_RANGE);
3143 Perl_pp_anonlist(aTHX);
3144 PL_tmps_floor = oldtmps_floor;
3146 o->op_type = OP_RV2AV;
3147 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
3148 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
3149 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
3150 o->op_opt = 0; /* needs to be revisited in rpeep() */
3151 curop = ((UNOP*)o)->op_first;
3152 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
3154 op_getmad(curop,o,'O');
3163 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
3166 if (type < 0) type = -type, flags |= OPf_SPECIAL;
3167 if (!o || o->op_type != OP_LIST)
3168 o = newLISTOP(OP_LIST, 0, o, NULL);
3170 o->op_flags &= ~OPf_WANT;
3172 if (!(PL_opargs[type] & OA_MARK))
3173 op_null(cLISTOPo->op_first);
3175 OP * const kid2 = cLISTOPo->op_first->op_sibling;
3176 if (kid2 && kid2->op_type == OP_COREARGS) {
3177 op_null(cLISTOPo->op_first);
3178 kid2->op_private |= OPpCOREARGS_PUSHMARK;
3182 o->op_type = (OPCODE)type;
3183 o->op_ppaddr = PL_ppaddr[type];
3184 o->op_flags |= flags;
3186 o = CHECKOP(type, o);
3187 if (o->op_type != (unsigned)type)
3190 return fold_constants(op_integerize(op_std_init(o)));
3194 =head1 Optree Manipulation Functions
3197 /* List constructors */
3200 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
3202 Append an item to the list of ops contained directly within a list-type
3203 op, returning the lengthened list. I<first> is the list-type op,
3204 and I<last> is the op to append to the list. I<optype> specifies the
3205 intended opcode for the list. If I<first> is not already a list of the
3206 right type, it will be upgraded into one. If either I<first> or I<last>
3207 is null, the other is returned unchanged.
3213 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
3221 if (first->op_type != (unsigned)type
3222 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
3224 return newLISTOP(type, 0, first, last);
3227 if (first->op_flags & OPf_KIDS)
3228 ((LISTOP*)first)->op_last->op_sibling = last;
3230 first->op_flags |= OPf_KIDS;
3231 ((LISTOP*)first)->op_first = last;
3233 ((LISTOP*)first)->op_last = last;
3238 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
3240 Concatenate the lists of ops contained directly within two list-type ops,
3241 returning the combined list. I<first> and I<last> are the list-type ops
3242 to concatenate. I<optype> specifies the intended opcode for the list.
3243 If either I<first> or I<last> is not already a list of the right type,
3244 it will be upgraded into one. If either I<first> or I<last> is null,
3245 the other is returned unchanged.
3251 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
3259 if (first->op_type != (unsigned)type)
3260 return op_prepend_elem(type, first, last);
3262 if (last->op_type != (unsigned)type)
3263 return op_append_elem(type, first, last);
3265 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
3266 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
3267 first->op_flags |= (last->op_flags & OPf_KIDS);
3270 if (((LISTOP*)last)->op_first && first->op_madprop) {
3271 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
3273 while (mp->mad_next)
3275 mp->mad_next = first->op_madprop;
3278 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
3281 first->op_madprop = last->op_madprop;
3282 last->op_madprop = 0;
3285 S_op_destroy(aTHX_ last);
3291 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
3293 Prepend an item to the list of ops contained directly within a list-type
3294 op, returning the lengthened list. I<first> is the op to prepend to the
3295 list, and I<last> is the list-type op. I<optype> specifies the intended
3296 opcode for the list. If I<last> is not already a list of the right type,
3297 it will be upgraded into one. If either I<first> or I<last> is null,
3298 the other is returned unchanged.
3304 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
3312 if (last->op_type == (unsigned)type) {
3313 if (type == OP_LIST) { /* already a PUSHMARK there */
3314 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
3315 ((LISTOP*)last)->op_first->op_sibling = first;
3316 if (!(first->op_flags & OPf_PARENS))
3317 last->op_flags &= ~OPf_PARENS;
3320 if (!(last->op_flags & OPf_KIDS)) {
3321 ((LISTOP*)last)->op_last = first;
3322 last->op_flags |= OPf_KIDS;
3324 first->op_sibling = ((LISTOP*)last)->op_first;
3325 ((LISTOP*)last)->op_first = first;
3327 last->op_flags |= OPf_KIDS;
3331 return newLISTOP(type, 0, first, last);
3339 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
3342 Newxz(tk, 1, TOKEN);
3343 tk->tk_type = (OPCODE)optype;
3344 tk->tk_type = 12345;
3346 tk->tk_mad = madprop;
3351 Perl_token_free(pTHX_ TOKEN* tk)
3353 PERL_ARGS_ASSERT_TOKEN_FREE;
3355 if (tk->tk_type != 12345)
3357 mad_free(tk->tk_mad);
3362 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
3367 PERL_ARGS_ASSERT_TOKEN_GETMAD;
3369 if (tk->tk_type != 12345) {
3370 Perl_warner(aTHX_ packWARN(WARN_MISC),
3371 "Invalid TOKEN object ignored");
3378 /* faked up qw list? */
3380 tm->mad_type == MAD_SV &&
3381 SvPVX((SV *)tm->mad_val)[0] == 'q')
3388 /* pretend constant fold didn't happen? */
3389 if (mp->mad_key == 'f' &&
3390 (o->op_type == OP_CONST ||
3391 o->op_type == OP_GV) )
3393 token_getmad(tk,(OP*)mp->mad_val,slot);
3407 if (mp->mad_key == 'X')
3408 mp->mad_key = slot; /* just change the first one */
3418 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3427 /* pretend constant fold didn't happen? */
3428 if (mp->mad_key == 'f' &&
3429 (o->op_type == OP_CONST ||
3430 o->op_type == OP_GV) )
3432 op_getmad(from,(OP*)mp->mad_val,slot);
3439 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3442 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3448 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3457 /* pretend constant fold didn't happen? */
3458 if (mp->mad_key == 'f' &&
3459 (o->op_type == OP_CONST ||
3460 o->op_type == OP_GV) )
3462 op_getmad(from,(OP*)mp->mad_val,slot);
3469 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3472 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3476 PerlIO_printf(PerlIO_stderr(),
3477 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3483 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3501 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3505 addmad(tm, &(o->op_madprop), slot);
3509 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3530 Perl_newMADsv(pTHX_ char key, SV* sv)
3532 PERL_ARGS_ASSERT_NEWMADSV;
3534 return newMADPROP(key, MAD_SV, sv, 0);
3538 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
3540 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
3543 mp->mad_vlen = vlen;
3544 mp->mad_type = type;
3546 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3551 Perl_mad_free(pTHX_ MADPROP* mp)
3553 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3557 mad_free(mp->mad_next);
3558 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
3559 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3560 switch (mp->mad_type) {
3564 Safefree((char*)mp->mad_val);
3567 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3568 op_free((OP*)mp->mad_val);
3571 sv_free(MUTABLE_SV(mp->mad_val));
3574 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3577 PerlMemShared_free(mp);
3583 =head1 Optree construction
3585 =for apidoc Am|OP *|newNULLLIST
3587 Constructs, checks, and returns a new C<stub> op, which represents an
3588 empty list expression.
3594 Perl_newNULLLIST(pTHX)
3596 return newOP(OP_STUB, 0);
3600 S_force_list(pTHX_ OP *o)
3602 if (!o || o->op_type != OP_LIST)
3603 o = newLISTOP(OP_LIST, 0, o, NULL);
3609 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3611 Constructs, checks, and returns an op of any list type. I<type> is
3612 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3613 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3614 supply up to two ops to be direct children of the list op; they are
3615 consumed by this function and become part of the constructed op tree.
3621 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3626 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3628 NewOp(1101, listop, 1, LISTOP);
3630 listop->op_type = (OPCODE)type;
3631 listop->op_ppaddr = PL_ppaddr[type];
3634 listop->op_flags = (U8)flags;
3638 else if (!first && last)
3641 first->op_sibling = last;
3642 listop->op_first = first;
3643 listop->op_last = last;
3644 if (type == OP_LIST) {
3645 OP* const pushop = newOP(OP_PUSHMARK, 0);
3646 pushop->op_sibling = first;
3647 listop->op_first = pushop;
3648 listop->op_flags |= OPf_KIDS;
3650 listop->op_last = pushop;
3653 return CHECKOP(type, listop);
3657 =for apidoc Am|OP *|newOP|I32 type|I32 flags
3659 Constructs, checks, and returns an op of any base type (any type that
3660 has no extra fields). I<type> is the opcode. I<flags> gives the
3661 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3668 Perl_newOP(pTHX_ I32 type, I32 flags)
3673 if (type == -OP_ENTEREVAL) {
3674 type = OP_ENTEREVAL;
3675 flags |= OPpEVAL_BYTES<<8;
3678 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3679 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3680 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3681 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3683 NewOp(1101, o, 1, OP);
3684 o->op_type = (OPCODE)type;
3685 o->op_ppaddr = PL_ppaddr[type];
3686 o->op_flags = (U8)flags;
3688 o->op_latefreed = 0;
3692 o->op_private = (U8)(0 | (flags >> 8));
3693 if (PL_opargs[type] & OA_RETSCALAR)
3695 if (PL_opargs[type] & OA_TARGET)
3696 o->op_targ = pad_alloc(type, SVs_PADTMP);
3697 return CHECKOP(type, o);
3701 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3703 Constructs, checks, and returns an op of any unary type. I<type> is
3704 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3705 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3706 bits, the eight bits of C<op_private>, except that the bit with value 1
3707 is automatically set. I<first> supplies an optional op to be the direct
3708 child of the unary op; it is consumed by this function and become part
3709 of the constructed op tree.
3715 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3720 if (type == -OP_ENTEREVAL) {
3721 type = OP_ENTEREVAL;
3722 flags |= OPpEVAL_BYTES<<8;
3725 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3726 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3727 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3728 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3729 || type == OP_SASSIGN
3730 || type == OP_ENTERTRY
3731 || type == OP_NULL );
3734 first = newOP(OP_STUB, 0);
3735 if (PL_opargs[type] & OA_MARK)
3736 first = force_list(first);
3738 NewOp(1101, unop, 1, UNOP);
3739 unop->op_type = (OPCODE)type;
3740 unop->op_ppaddr = PL_ppaddr[type];
3741 unop->op_first = first;
3742 unop->op_flags = (U8)(flags | OPf_KIDS);
3743 unop->op_private = (U8)(1 | (flags >> 8));
3744 unop = (UNOP*) CHECKOP(type, unop);
3748 return fold_constants(op_integerize(op_std_init((OP *) unop)));
3752 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3754 Constructs, checks, and returns an op of any binary type. I<type>
3755 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3756 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3757 the eight bits of C<op_private>, except that the bit with value 1 or
3758 2 is automatically set as required. I<first> and I<last> supply up to
3759 two ops to be the direct children of the binary op; they are consumed
3760 by this function and become part of the constructed op tree.
3766 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3771 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3772 || type == OP_SASSIGN || type == OP_NULL );
3774 NewOp(1101, binop, 1, BINOP);
3777 first = newOP(OP_NULL, 0);
3779 binop->op_type = (OPCODE)type;
3780 binop->op_ppaddr = PL_ppaddr[type];
3781 binop->op_first = first;
3782 binop->op_flags = (U8)(flags | OPf_KIDS);
3785 binop->op_private = (U8)(1 | (flags >> 8));
3788 binop->op_private = (U8)(2 | (flags >> 8));
3789 first->op_sibling = last;
3792 binop = (BINOP*)CHECKOP(type, binop);
3793 if (binop->op_next || binop->op_type != (OPCODE)type)
3796 binop->op_last = binop->op_first->op_sibling;
3798 return fold_constants(op_integerize(op_std_init((OP *)binop)));
3801 static int uvcompare(const void *a, const void *b)
3802 __attribute__nonnull__(1)
3803 __attribute__nonnull__(2)
3804 __attribute__pure__;
3805 static int uvcompare(const void *a, const void *b)
3807 if (*((const UV *)a) < (*(const UV *)b))
3809 if (*((const UV *)a) > (*(const UV *)b))
3811 if (*((const UV *)a+1) < (*(const UV *)b+1))
3813 if (*((const UV *)a+1) > (*(const UV *)b+1))
3819 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3822 SV * const tstr = ((SVOP*)expr)->op_sv;
3825 (repl->op_type == OP_NULL)
3826 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3828 ((SVOP*)repl)->op_sv;
3831 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3832 const U8 *r = (U8*)SvPV_const(rstr, rlen);
3836 register short *tbl;
3838 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3839 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3840 I32 del = o->op_private & OPpTRANS_DELETE;
3843 PERL_ARGS_ASSERT_PMTRANS;
3845 PL_hints |= HINT_BLOCK_SCOPE;
3848 o->op_private |= OPpTRANS_FROM_UTF;
3851 o->op_private |= OPpTRANS_TO_UTF;
3853 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
3854 SV* const listsv = newSVpvs("# comment\n");
3856 const U8* tend = t + tlen;
3857 const U8* rend = r + rlen;
3871 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3872 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
3875 const U32 flags = UTF8_ALLOW_DEFAULT;
3879 t = tsave = bytes_to_utf8(t, &len);
3882 if (!to_utf && rlen) {
3884 r = rsave = bytes_to_utf8(r, &len);
3888 /* There are several snags with this code on EBCDIC:
3889 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3890 2. scan_const() in toke.c has encoded chars in native encoding which makes
3891 ranges at least in EBCDIC 0..255 range the bottom odd.
3895 U8 tmpbuf[UTF8_MAXBYTES+1];
3898 Newx(cp, 2*tlen, UV);
3900 transv = newSVpvs("");
3902 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3904 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
3906 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3910 cp[2*i+1] = cp[2*i];
3914 qsort(cp, i, 2*sizeof(UV), uvcompare);
3915 for (j = 0; j < i; j++) {
3917 diff = val - nextmin;
3919 t = uvuni_to_utf8(tmpbuf,nextmin);
3920 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3922 U8 range_mark = UTF_TO_NATIVE(0xff);
3923 t = uvuni_to_utf8(tmpbuf, val - 1);
3924 sv_catpvn(transv, (char *)&range_mark, 1);
3925 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3932 t = uvuni_to_utf8(tmpbuf,nextmin);
3933 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3935 U8 range_mark = UTF_TO_NATIVE(0xff);
3936 sv_catpvn(transv, (char *)&range_mark, 1);
3938 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
3939 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3940 t = (const U8*)SvPVX_const(transv);
3941 tlen = SvCUR(transv);
3945 else if (!rlen && !del) {
3946 r = t; rlen = tlen; rend = tend;
3949 if ((!rlen && !del) || t == r ||
3950 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
3952 o->op_private |= OPpTRANS_IDENTICAL;
3956 while (t < tend || tfirst <= tlast) {
3957 /* see if we need more "t" chars */
3958 if (tfirst > tlast) {
3959 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3961 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
3963 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3970 /* now see if we need more "r" chars */
3971 if (rfirst > rlast) {
3973 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3975 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
3977 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3986 rfirst = rlast = 0xffffffff;
3990 /* now see which range will peter our first, if either. */
3991 tdiff = tlast - tfirst;
3992 rdiff = rlast - rfirst;
3999 if (rfirst == 0xffffffff) {
4000 diff = tdiff; /* oops, pretend rdiff is infinite */
4002 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
4003 (long)tfirst, (long)tlast);
4005 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
4009 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
4010 (long)tfirst, (long)(tfirst + diff),
4013 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
4014 (long)tfirst, (long)rfirst);
4016 if (rfirst + diff > max)
4017 max = rfirst + diff;
4019 grows = (tfirst < rfirst &&
4020 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
4032 else if (max > 0xff)
4037 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
4039 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
4040 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
4041 PAD_SETSV(cPADOPo->op_padix, swash);
4043 SvREADONLY_on(swash);
4045 cSVOPo->op_sv = swash;
4047 SvREFCNT_dec(listsv);
4048 SvREFCNT_dec(transv);
4050 if (!del && havefinal && rlen)
4051 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
4052 newSVuv((UV)final), 0);
4055 o->op_private |= OPpTRANS_GROWS;
4061 op_getmad(expr,o,'e');
4062 op_getmad(repl,o,'r');
4070 tbl = (short*)PerlMemShared_calloc(
4071 (o->op_private & OPpTRANS_COMPLEMENT) &&
4072 !(o->op_private & OPpTRANS_DELETE) ? 258 : 256,
4074 cPVOPo->op_pv = (char*)tbl;
4076 for (i = 0; i < (I32)tlen; i++)
4078 for (i = 0, j = 0; i < 256; i++) {
4080 if (j >= (I32)rlen) {
4089 if (i < 128 && r[j] >= 128)
4099 o->op_private |= OPpTRANS_IDENTICAL;
4101 else if (j >= (I32)rlen)
4106 PerlMemShared_realloc(tbl,
4107 (0x101+rlen-j) * sizeof(short));
4108 cPVOPo->op_pv = (char*)tbl;
4110 tbl[0x100] = (short)(rlen - j);
4111 for (i=0; i < (I32)rlen - j; i++)
4112 tbl[0x101+i] = r[j+i];
4116 if (!rlen && !del) {
4119 o->op_private |= OPpTRANS_IDENTICAL;
4121 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
4122 o->op_private |= OPpTRANS_IDENTICAL;
4124 for (i = 0; i < 256; i++)
4126 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
4127 if (j >= (I32)rlen) {
4129 if (tbl[t[i]] == -1)
4135 if (tbl[t[i]] == -1) {
4136 if (t[i] < 128 && r[j] >= 128)
4143 if(del && rlen == tlen) {
4144 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
4145 } else if(rlen > tlen) {
4146 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
4150 o->op_private |= OPpTRANS_GROWS;
4152 op_getmad(expr,o,'e');
4153 op_getmad(repl,o,'r');
4163 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
4165 Constructs, checks, and returns an op of any pattern matching type.
4166 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
4167 and, shifted up eight bits, the eight bits of C<op_private>.
4173 Perl_newPMOP(pTHX_ I32 type, I32 flags)
4178 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
4180 NewOp(1101, pmop, 1, PMOP);
4181 pmop->op_type = (OPCODE)type;
4182 pmop->op_ppaddr = PL_ppaddr[type];
4183 pmop->op_flags = (U8)flags;
4184 pmop->op_private = (U8)(0 | (flags >> 8));
4186 if (PL_hints & HINT_RE_TAINT)
4187 pmop->op_pmflags |= PMf_RETAINT;
4188 if (IN_LOCALE_COMPILETIME) {
4189 set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET);
4191 else if ((! (PL_hints & HINT_BYTES))
4192 /* Both UNI_8_BIT and locale :not_characters imply Unicode */
4193 && (PL_hints & (HINT_UNI_8_BIT|HINT_LOCALE_NOT_CHARS)))
4195 set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET);
4197 if (PL_hints & HINT_RE_FLAGS) {
4198 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4199 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
4201 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
4202 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4203 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0
4205 if (reflags && SvOK(reflags)) {
4206 set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags));
4212 assert(SvPOK(PL_regex_pad[0]));
4213 if (SvCUR(PL_regex_pad[0])) {
4214 /* Pop off the "packed" IV from the end. */
4215 SV *const repointer_list = PL_regex_pad[0];
4216 const char *p = SvEND(repointer_list) - sizeof(IV);
4217 const IV offset = *((IV*)p);
4219 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
4221 SvEND_set(repointer_list, p);
4223 pmop->op_pmoffset = offset;
4224 /* This slot should be free, so assert this: */
4225 assert(PL_regex_pad[offset] == &PL_sv_undef);
4227 SV * const repointer = &PL_sv_undef;
4228 av_push(PL_regex_padav, repointer);
4229 pmop->op_pmoffset = av_len(PL_regex_padav);
4230 PL_regex_pad = AvARRAY(PL_regex_padav);
4234 return CHECKOP(type, pmop);
4237 /* Given some sort of match op o, and an expression expr containing a
4238 * pattern, either compile expr into a regex and attach it to o (if it's
4239 * constant), or convert expr into a runtime regcomp op sequence (if it's
4242 * isreg indicates that the pattern is part of a regex construct, eg
4243 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
4244 * split "pattern", which aren't. In the former case, expr will be a list
4245 * if the pattern contains more than one term (eg /a$b/) or if it contains
4246 * a replacement, ie s/// or tr///.
4248 * When the pattern has been compiled within a new anon CV (for
4249 * qr/(?{...})/ ), then floor indicates the savestack level just before
4250 * the new sub was created
4254 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg, I32 floor)
4259 I32 repl_has_vars = 0;
4261 bool is_trans = (o->op_type == OP_TRANS || o->op_type == OP_TRANSR);
4262 bool is_compiletime;
4265 PERL_ARGS_ASSERT_PMRUNTIME;
4267 /* for s/// and tr///, last element in list is the replacement; pop it */
4269 if (is_trans || o->op_type == OP_SUBST) {
4271 repl = cLISTOPx(expr)->op_last;
4272 kid = cLISTOPx(expr)->op_first;
4273 while (kid->op_sibling != repl)
4274 kid = kid->op_sibling;
4275 kid->op_sibling = NULL;
4276 cLISTOPx(expr)->op_last = kid;
4279 /* for TRANS, convert LIST/PUSH/CONST into CONST, and pass to pmtrans() */
4282 OP* const oe = expr;
4283 assert(expr->op_type == OP_LIST);
4284 assert(cLISTOPx(expr)->op_first->op_type == OP_PUSHMARK);
4285 assert(cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last);
4286 expr = cLISTOPx(oe)->op_last;
4287 cLISTOPx(oe)->op_first->op_sibling = NULL;
4288 cLISTOPx(oe)->op_last = NULL;
4291 return pmtrans(o, expr, repl);
4294 /* find whether we have any runtime or code elements;
4295 * at the same time, temporarily set the op_next of each DO block;
4296 * then when we LINKLIST, this will cause the DO blocks to be excluded
4297 * from the op_next chain (and from having LINKLIST recursively
4298 * applied to them). We fix up the DOs specially later */
4302 if (expr->op_type == OP_LIST) {
4304 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4305 if (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)) {
4307 assert(!o->op_next && o->op_sibling);
4308 o->op_next = o->op_sibling;
4310 else if (o->op_type != OP_CONST && o->op_type != OP_PUSHMARK)
4314 else if (expr->op_type != OP_CONST)
4319 /* fix up DO blocks; treat each one as a separate little sub */
4321 if (expr->op_type == OP_LIST) {
4323 for (o = cLISTOPx(expr)->op_first; o; o = o->op_sibling) {
4324 if (!(o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)))
4326 o->op_next = NULL; /* undo temporary hack from above */
4329 if (cLISTOPo->op_first->op_type == OP_LEAVE) {
4330 LISTOP *leave = cLISTOPx(cLISTOPo->op_first);
4332 assert(leave->op_first->op_type == OP_ENTER);
4333 assert(leave->op_first->op_sibling);
4334 o->op_next = leave->op_first->op_sibling;
4336 assert(leave->op_flags & OPf_KIDS);
4337 assert(leave->op_last->op_next = (OP*)leave);
4338 leave->op_next = NULL; /* stop on last op */
4339 op_null((OP*)leave);
4343 OP *scope = cLISTOPo->op_first;
4344 assert(scope->op_type == OP_SCOPE);
4345 assert(scope->op_flags & OPf_KIDS);
4346 scope->op_next = NULL; /* stop on last op */
4349 /* have to peep the DOs individually as we've removed it from
4350 * the op_next chain */
4353 /* runtime finalizes as part of finalizing whole tree */
4358 PL_hints |= HINT_BLOCK_SCOPE;
4360 assert(floor==0 || (pm->op_pmflags & PMf_HAS_CV));
4362 if (is_compiletime) {
4363 U32 rx_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4364 regexp_engine const *eng = current_re_engine();
4366 if (o->op_flags & OPf_SPECIAL)
4367 rx_flags |= RXf_SPLIT;
4369 if (!has_code || !eng->op_comp) {
4370 /* compile-time simple constant pattern */
4373 if (expr->op_type == OP_CONST)
4374 pat = cSVOPx_sv(expr);
4376 /* concat any CONSTs */
4377 OP *kid = cLISTOPx(expr)->op_first;
4379 for (; kid; kid = kid->op_sibling) {
4380 if (kid->op_type != OP_CONST)
4383 sv_catsv(pat, cSVOPx_sv(kid));
4385 pat = cSVOPx_sv(kid);
4386 SvREADONLY_off(pat);
4392 if ((pm->op_pmflags & PMf_HAS_CV) && !has_code) {
4393 /* whoops! we guessed that a qr// had a code block, but we
4394 * were wrong (e.g. /[(?{}]/ ). Throw away the PL_compcv
4395 * that isn't required now. Note that we have to be pretty
4396 * confident that nothing used that CV's pad while the
4397 * regex was parsed */
4398 assert(AvFILLp(PL_comppad) == 0); /* just @_ */
4400 pm->op_pmflags &= ~PMf_HAS_CV;
4404 assert (SvUTF8(pat));
4405 } else if (SvUTF8(pat)) {
4406 /* Not doing UTF-8, despite what the SV says. Is this only if we're
4407 trapped in use 'bytes'? */
4408 /* Make a copy of the octet sequence, but without the flag on, as
4409 the compiler now honours the SvUTF8 flag on pat. */
4411 const char *const p = SvPV(pat, len);
4412 pat = newSVpvn_flags(p, len, SVs_TEMP);
4415 PM_SETRE(pm, CALLREGCOMP_ENG(eng, pat, rx_flags));
4417 op_getmad(expr,(OP*)pm,'e');
4423 /* compile-time pattern that includes literal code blocks */
4424 REGEXP* re = eng->op_comp(aTHX_ NULL, 0, expr, eng, NULL, NULL,
4425 rx_flags, pm->op_pmflags);
4427 if (pm->op_pmflags & PMf_HAS_CV) {
4429 /* this QR op (and the anon sub we embed it in) is never
4430 * actually executed. It's just a placeholder where we can
4431 * squirrel away expr in op_code_list without the peephole
4432 * optimiser etc processing it for a second time */
4433 OP *qr = newPMOP(OP_QR, 0);
4434 ((PMOP*)qr)->op_code_list = expr;
4436 /* handle the implicit sub{} wrapped round the qr/(?{..})/ */
4437 SvREFCNT_inc_simple_void(PL_compcv);
4438 cv = newATTRSUB(floor, 0, NULL, NULL, qr);
4439 ((struct regexp *)SvANY(re))->qr_anoncv = cv;
4441 /* attach the anon CV to the pad so that
4442 * pad_fixup_inner_anons() can find it */
4443 (void)pad_add_anon(cv, o->op_type);
4444 SvREFCNT_inc_simple_void(cv);
4447 pm->op_code_list = expr;
4452 /* runtime pattern: build chain of regcomp etc ops */
4454 PADOFFSET cv_targ = 0;
4456 reglist = isreg && expr->op_type == OP_LIST;
4461 pm->op_code_list = expr;
4462 /* don't free op_code_list; its ops are embedded elsewhere too */
4463 pm->op_pmflags |= PMf_CODELIST_PRIVATE;
4466 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
4467 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
4469 : OP_REGCMAYBE),0,expr);
4471 if (pm->op_pmflags & PMf_HAS_CV) {
4472 /* we have a runtime qr with literal code. This means
4473 * that the qr// has been wrapped in a new CV, which
4474 * means that runtime consts, vars etc will have been compiled
4475 * against a new pad. So... we need to execute those ops
4476 * within the environment of the new CV. So wrap them in a call
4477 * to a new anon sub. i.e. for
4481 * we build an anon sub that looks like
4483 * sub { "a", $b, '(?{...})' }
4485 * and call it, passing the returned list to regcomp.
4486 * Or to put it another way, the list of ops that get executed
4490 * ------ -------------------
4491 * pushmark (for regcomp)
4492 * pushmark (for entersub)
4493 * pushmark (for refgen)
4497 * regcreset regcreset
4499 * const("a") const("a")
4501 * const("(?{...})") const("(?{...})")
4506 SvREFCNT_inc_simple_void(PL_compcv);
4507 /* these lines are just an unrolled newANONATTRSUB */
4508 expr = newSVOP(OP_ANONCODE, 0,
4509 MUTABLE_SV(newATTRSUB(floor, 0, NULL, NULL, expr)));
4510 cv_targ = expr->op_targ;
4511 expr = newUNOP(OP_REFGEN, 0, expr);
4513 expr = list(force_list(newUNOP(OP_ENTERSUB, 0, scalar(expr))));
4516 NewOp(1101, rcop, 1, LOGOP);
4517 rcop->op_type = OP_REGCOMP;
4518 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
4519 rcop->op_first = scalar(expr);
4520 rcop->op_flags |= OPf_KIDS
4521 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
4522 | (reglist ? OPf_STACKED : 0);
4523 rcop->op_private = 0;
4525 rcop->op_targ = cv_targ;
4527 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
4528 if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1;
4530 /* establish postfix order */
4531 if (expr->op_type == OP_REGCRESET || expr->op_type == OP_REGCMAYBE) {
4533 rcop->op_next = expr;
4534 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
4537 rcop->op_next = LINKLIST(expr);
4538 expr->op_next = (OP*)rcop;
4541 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
4546 if (pm->op_pmflags & PMf_EVAL) {
4548 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
4549 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
4551 else if (repl->op_type == OP_CONST)
4555 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
4556 if (curop->op_type == OP_SCOPE
4557 || curop->op_type == OP_LEAVE
4558 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
4559 if (curop->op_type == OP_GV) {
4560 GV * const gv = cGVOPx_gv(curop);
4562 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
4565 else if (curop->op_type == OP_RV2CV)
4567 else if (curop->op_type == OP_RV2SV ||
4568 curop->op_type == OP_RV2AV ||
4569 curop->op_type == OP_RV2HV ||
4570 curop->op_type == OP_RV2GV) {
4571 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
4574 else if (curop->op_type == OP_PADSV ||
4575 curop->op_type == OP_PADAV ||
4576 curop->op_type == OP_PADHV ||
4577 curop->op_type == OP_PADANY)
4581 else if (curop->op_type == OP_PUSHRE)
4582 NOOP; /* Okay here, dangerous in newASSIGNOP */
4592 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
4594 pm->op_pmflags |= PMf_CONST; /* const for long enough */
4595 op_prepend_elem(o->op_type, scalar(repl), o);
4598 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
4599 pm->op_pmflags |= PMf_MAYBE_CONST;
4601 NewOp(1101, rcop, 1, LOGOP);
4602 rcop->op_type = OP_SUBSTCONT;
4603 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
4604 rcop->op_first = scalar(repl);
4605 rcop->op_flags |= OPf_KIDS;
4606 rcop->op_private = 1;
4609 /* establish postfix order */
4610 rcop->op_next = LINKLIST(repl);
4611 repl->op_next = (OP*)rcop;
4613 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
4614 assert(!(pm->op_pmflags & PMf_ONCE));
4615 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
4624 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
4626 Constructs, checks, and returns an op of any type that involves an
4627 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
4628 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
4629 takes ownership of one reference to it.
4635 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
4640 PERL_ARGS_ASSERT_NEWSVOP;
4642 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4643 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4644 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4646 NewOp(1101, svop, 1, SVOP);
4647 svop->op_type = (OPCODE)type;
4648 svop->op_ppaddr = PL_ppaddr[type];
4650 svop->op_next = (OP*)svop;
4651 svop->op_flags = (U8)flags;
4652 if (PL_opargs[type] & OA_RETSCALAR)
4654 if (PL_opargs[type] & OA_TARGET)
4655 svop->op_targ = pad_alloc(type, SVs_PADTMP);
4656 return CHECKOP(type, svop);
4662 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
4664 Constructs, checks, and returns an op of any type that involves a
4665 reference to a pad element. I<type> is the opcode. I<flags> gives the
4666 eight bits of C<op_flags>. A pad slot is automatically allocated, and
4667 is populated with I<sv>; this function takes ownership of one reference
4670 This function only exists if Perl has been compiled to use ithreads.
4676 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
4681 PERL_ARGS_ASSERT_NEWPADOP;
4683 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4684 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4685 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4687 NewOp(1101, padop, 1, PADOP);
4688 padop->op_type = (OPCODE)type;
4689 padop->op_ppaddr = PL_ppaddr[type];
4690 padop->op_padix = pad_alloc(type, SVs_PADTMP);
4691 SvREFCNT_dec(PAD_SVl(padop->op_padix));
4692 PAD_SETSV(padop->op_padix, sv);
4695 padop->op_next = (OP*)padop;
4696 padop->op_flags = (U8)flags;
4697 if (PL_opargs[type] & OA_RETSCALAR)
4699 if (PL_opargs[type] & OA_TARGET)
4700 padop->op_targ = pad_alloc(type, SVs_PADTMP);
4701 return CHECKOP(type, padop);
4704 #endif /* !USE_ITHREADS */
4707 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
4709 Constructs, checks, and returns an op of any type that involves an
4710 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
4711 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
4712 reference; calling this function does not transfer ownership of any
4719 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
4723 PERL_ARGS_ASSERT_NEWGVOP;
4727 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4729 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4734 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
4736 Constructs, checks, and returns an op of any type that involves an
4737 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
4738 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
4739 must have been allocated using L</PerlMemShared_malloc>; the memory will
4740 be freed when the op is destroyed.
4746 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
4749 const bool utf8 = cBOOL(flags & SVf_UTF8);
4754 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4756 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4758 NewOp(1101, pvop, 1, PVOP);
4759 pvop->op_type = (OPCODE)type;
4760 pvop->op_ppaddr = PL_ppaddr[type];
4762 pvop->op_next = (OP*)pvop;
4763 pvop->op_flags = (U8)flags;
4764 pvop->op_private = utf8 ? OPpPV_IS_UTF8 : 0;
4765 if (PL_opargs[type] & OA_RETSCALAR)
4767 if (PL_opargs[type] & OA_TARGET)
4768 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
4769 return CHECKOP(type, pvop);
4777 Perl_package(pTHX_ OP *o)
4780 SV *const sv = cSVOPo->op_sv;
4785 PERL_ARGS_ASSERT_PACKAGE;
4787 SAVEGENERICSV(PL_curstash);
4788 save_item(PL_curstname);
4790 PL_curstash = (HV *)SvREFCNT_inc(gv_stashsv(sv, GV_ADD));
4792 sv_setsv(PL_curstname, sv);
4794 PL_hints |= HINT_BLOCK_SCOPE;
4795 PL_parser->copline = NOLINE;
4796 PL_parser->expect = XSTATE;
4801 if (!PL_madskills) {
4806 pegop = newOP(OP_NULL,0);
4807 op_getmad(o,pegop,'P');
4813 Perl_package_version( pTHX_ OP *v )
4816 U32 savehints = PL_hints;
4817 PERL_ARGS_ASSERT_PACKAGE_VERSION;
4818 PL_hints &= ~HINT_STRICT_VARS;
4819 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
4820 PL_hints = savehints;
4829 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
4836 OP *pegop = newOP(OP_NULL,0);
4838 SV *use_version = NULL;
4840 PERL_ARGS_ASSERT_UTILIZE;
4842 if (idop->op_type != OP_CONST)
4843 Perl_croak(aTHX_ "Module name must be constant");
4846 op_getmad(idop,pegop,'U');
4851 SV * const vesv = ((SVOP*)version)->op_sv;
4854 op_getmad(version,pegop,'V');
4855 if (!arg && !SvNIOKp(vesv)) {
4862 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
4863 Perl_croak(aTHX_ "Version number must be a constant number");
4865 /* Make copy of idop so we don't free it twice */
4866 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
4868 /* Fake up a method call to VERSION */
4869 meth = newSVpvs_share("VERSION");
4870 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
4871 op_append_elem(OP_LIST,
4872 op_prepend_elem(OP_LIST, pack, list(version)),
4873 newSVOP(OP_METHOD_NAMED, 0, meth)));
4877 /* Fake up an import/unimport */
4878 if (arg && arg->op_type == OP_STUB) {
4880 op_getmad(arg,pegop,'S');
4881 imop = arg; /* no import on explicit () */
4883 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
4884 imop = NULL; /* use 5.0; */
4886 use_version = ((SVOP*)idop)->op_sv;
4888 idop->op_private |= OPpCONST_NOVER;
4894 op_getmad(arg,pegop,'A');
4896 /* Make copy of idop so we don't free it twice */
4897 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
4899 /* Fake up a method call to import/unimport */
4901 ? newSVpvs_share("import") : newSVpvs_share("unimport");
4902 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
4903 op_append_elem(OP_LIST,
4904 op_prepend_elem(OP_LIST, pack, list(arg)),
4905 newSVOP(OP_METHOD_NAMED, 0, meth)));
4908 /* Fake up the BEGIN {}, which does its thing immediately. */
4910 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
4913 op_append_elem(OP_LINESEQ,
4914 op_append_elem(OP_LINESEQ,
4915 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
4916 newSTATEOP(0, NULL, veop)),
4917 newSTATEOP(0, NULL, imop) ));
4921 * feature bundle that corresponds to the required version. */
4922 use_version = sv_2mortal(new_version(use_version));
4923 S_enable_feature_bundle(aTHX_ use_version);
4925 /* If a version >= 5.11.0 is requested, strictures are on by default! */
4926 if (vcmp(use_version,
4927 sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) {
4928 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
4929 PL_hints |= HINT_STRICT_REFS;
4930 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
4931 PL_hints |= HINT_STRICT_SUBS;
4932 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
4933 PL_hints |= HINT_STRICT_VARS;
4935 /* otherwise they are off */
4937 if (!(PL_hints & HINT_EXPLICIT_STRICT_REFS))
4938 PL_hints &= ~HINT_STRICT_REFS;
4939 if (!(PL_hints & HINT_EXPLICIT_STRICT_SUBS))
4940 PL_hints &= ~HINT_STRICT_SUBS;
4941 if (!(PL_hints & HINT_EXPLICIT_STRICT_VARS))
4942 PL_hints &= ~HINT_STRICT_VARS;
4946 /* The "did you use incorrect case?" warning used to be here.
4947 * The problem is that on case-insensitive filesystems one
4948 * might get false positives for "use" (and "require"):
4949 * "use Strict" or "require CARP" will work. This causes
4950 * portability problems for the script: in case-strict
4951 * filesystems the script will stop working.
4953 * The "incorrect case" warning checked whether "use Foo"
4954 * imported "Foo" to your namespace, but that is wrong, too:
4955 * there is no requirement nor promise in the language that
4956 * a Foo.pm should or would contain anything in package "Foo".
4958 * There is very little Configure-wise that can be done, either:
4959 * the case-sensitivity of the build filesystem of Perl does not
4960 * help in guessing the case-sensitivity of the runtime environment.
4963 PL_hints |= HINT_BLOCK_SCOPE;
4964 PL_parser->copline = NOLINE;
4965 PL_parser->expect = XSTATE;
4966 PL_cop_seqmax++; /* Purely for B::*'s benefit */
4967 if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */
4971 if (!PL_madskills) {
4972 /* FIXME - don't allocate pegop if !PL_madskills */
4981 =head1 Embedding Functions
4983 =for apidoc load_module
4985 Loads the module whose name is pointed to by the string part of name.
4986 Note that the actual module name, not its filename, should be given.
4987 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
4988 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
4989 (or 0 for no flags). ver, if specified and not NULL, provides version semantics
4990 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
4991 arguments can be used to specify arguments to the module's import()
4992 method, similar to C<use Foo::Bar VERSION LIST>. They must be
4993 terminated with a final NULL pointer. Note that this list can only
4994 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
4995 Otherwise at least a single NULL pointer to designate the default
4996 import list is required.
4998 The reference count for each specified C<SV*> parameter is decremented.
5003 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
5007 PERL_ARGS_ASSERT_LOAD_MODULE;
5009 va_start(args, ver);
5010 vload_module(flags, name, ver, &args);
5014 #ifdef PERL_IMPLICIT_CONTEXT
5016 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
5020 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
5021 va_start(args, ver);
5022 vload_module(flags, name, ver, &args);
5028 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
5032 OP * const modname = newSVOP(OP_CONST, 0, name);
5034 PERL_ARGS_ASSERT_VLOAD_MODULE;
5036 modname->op_private |= OPpCONST_BARE;
5038 veop = newSVOP(OP_CONST, 0, ver);
5042 if (flags & PERL_LOADMOD_NOIMPORT) {
5043 imop = sawparens(newNULLLIST());
5045 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
5046 imop = va_arg(*args, OP*);
5051 sv = va_arg(*args, SV*);
5053 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
5054 sv = va_arg(*args, SV*);
5058 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
5059 * that it has a PL_parser to play with while doing that, and also
5060 * that it doesn't mess with any existing parser, by creating a tmp
5061 * new parser with lex_start(). This won't actually be used for much,
5062 * since pp_require() will create another parser for the real work. */
5065 SAVEVPTR(PL_curcop);
5066 lex_start(NULL, NULL, LEX_START_SAME_FILTER);
5067 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
5068 veop, modname, imop);
5073 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
5079 PERL_ARGS_ASSERT_DOFILE;
5081 if (!force_builtin) {
5082 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
5083 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
5084 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
5085 gv = gvp ? *gvp : NULL;
5089 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
5090 doop = newUNOP(OP_ENTERSUB, OPf_STACKED,
5091 op_append_elem(OP_LIST, term,
5092 scalar(newUNOP(OP_RV2CV, 0,
5093 newGVOP(OP_GV, 0, gv)))));
5096 doop = newUNOP(OP_DOFILE, 0, scalar(term));
5102 =head1 Optree construction
5104 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
5106 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
5107 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
5108 be set automatically, and, shifted up eight bits, the eight bits of
5109 C<op_private>, except that the bit with value 1 or 2 is automatically
5110 set as required. I<listval> and I<subscript> supply the parameters of
5111 the slice; they are consumed by this function and become part of the
5112 constructed op tree.
5118 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
5120 return newBINOP(OP_LSLICE, flags,
5121 list(force_list(subscript)),
5122 list(force_list(listval)) );
5126 S_is_list_assignment(pTHX_ register const OP *o)
5134 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
5135 o = cUNOPo->op_first;
5137 flags = o->op_flags;
5139 if (type == OP_COND_EXPR) {
5140 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
5141 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
5146 yyerror("Assignment to both a list and a scalar");
5150 if (type == OP_LIST &&
5151 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
5152 o->op_private & OPpLVAL_INTRO)
5155 if (type == OP_LIST || flags & OPf_PARENS ||
5156 type == OP_RV2AV || type == OP_RV2HV ||
5157 type == OP_ASLICE || type == OP_HSLICE)
5160 if (type == OP_PADAV || type == OP_PADHV)
5163 if (type == OP_RV2SV)
5170 Helper function for newASSIGNOP to detection commonality between the
5171 lhs and the rhs. Marks all variables with PL_generation. If it
5172 returns TRUE the assignment must be able to handle common variables.
5174 PERL_STATIC_INLINE bool
5175 S_aassign_common_vars(pTHX_ OP* o)
5178 for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) {
5179 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
5180 if (curop->op_type == OP_GV) {
5181 GV *gv = cGVOPx_gv(curop);
5183 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5185 GvASSIGN_GENERATION_set(gv, PL_generation);
5187 else if (curop->op_type == OP_PADSV ||
5188 curop->op_type == OP_PADAV ||
5189 curop->op_type == OP_PADHV ||
5190 curop->op_type == OP_PADANY)
5192 if (PAD_COMPNAME_GEN(curop->op_targ)
5193 == (STRLEN)PL_generation)
5195 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
5198 else if (curop->op_type == OP_RV2CV)
5200 else if (curop->op_type == OP_RV2SV ||
5201 curop->op_type == OP_RV2AV ||
5202 curop->op_type == OP_RV2HV ||
5203 curop->op_type == OP_RV2GV) {
5204 if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */
5207 else if (curop->op_type == OP_PUSHRE) {
5209 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
5210 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
5212 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5214 GvASSIGN_GENERATION_set(gv, PL_generation);
5218 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
5221 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
5223 GvASSIGN_GENERATION_set(gv, PL_generation);
5231 if (curop->op_flags & OPf_KIDS) {
5232 if (aassign_common_vars(curop))
5240 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
5242 Constructs, checks, and returns an assignment op. I<left> and I<right>
5243 supply the parameters of the assignment; they are consumed by this
5244 function and become part of the constructed op tree.
5246 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
5247 a suitable conditional optree is constructed. If I<optype> is the opcode
5248 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
5249 performs the binary operation and assigns the result to the left argument.
5250 Either way, if I<optype> is non-zero then I<flags> has no effect.
5252 If I<optype> is zero, then a plain scalar or list assignment is
5253 constructed. Which type of assignment it is is automatically determined.
5254 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5255 will be set automatically, and, shifted up eight bits, the eight bits
5256 of C<op_private>, except that the bit with value 1 or 2 is automatically
5263 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
5269 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
5270 return newLOGOP(optype, 0,
5271 op_lvalue(scalar(left), optype),
5272 newUNOP(OP_SASSIGN, 0, scalar(right)));
5275 return newBINOP(optype, OPf_STACKED,
5276 op_lvalue(scalar(left), optype), scalar(right));
5280 if (is_list_assignment(left)) {
5281 static const char no_list_state[] = "Initialization of state variables"
5282 " in list context currently forbidden";
5284 bool maybe_common_vars = TRUE;
5287 left = op_lvalue(left, OP_AASSIGN);
5288 curop = list(force_list(left));
5289 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
5290 o->op_private = (U8)(0 | (flags >> 8));
5292 if ((left->op_type == OP_LIST
5293 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
5295 OP* lop = ((LISTOP*)left)->op_first;
5296 maybe_common_vars = FALSE;
5298 if (lop->op_type == OP_PADSV ||
5299 lop->op_type == OP_PADAV ||
5300 lop->op_type == OP_PADHV ||
5301 lop->op_type == OP_PADANY) {
5302 if (!(lop->op_private & OPpLVAL_INTRO))
5303 maybe_common_vars = TRUE;
5305 if (lop->op_private & OPpPAD_STATE) {
5306 if (left->op_private & OPpLVAL_INTRO) {
5307 /* Each variable in state($a, $b, $c) = ... */
5310 /* Each state variable in
5311 (state $a, my $b, our $c, $d, undef) = ... */
5313 yyerror(no_list_state);
5315 /* Each my variable in
5316 (state $a, my $b, our $c, $d, undef) = ... */
5318 } else if (lop->op_type == OP_UNDEF ||
5319 lop->op_type == OP_PUSHMARK) {
5320 /* undef may be interesting in
5321 (state $a, undef, state $c) */
5323 /* Other ops in the list. */
5324 maybe_common_vars = TRUE;
5326 lop = lop->op_sibling;
5329 else if ((left->op_private & OPpLVAL_INTRO)
5330 && ( left->op_type == OP_PADSV
5331 || left->op_type == OP_PADAV
5332 || left->op_type == OP_PADHV
5333 || left->op_type == OP_PADANY))
5335 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
5336 if (left->op_private & OPpPAD_STATE) {
5337 /* All single variable list context state assignments, hence
5347 yyerror(no_list_state);
5351 /* PL_generation sorcery:
5352 * an assignment like ($a,$b) = ($c,$d) is easier than
5353 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
5354 * To detect whether there are common vars, the global var
5355 * PL_generation is incremented for each assign op we compile.
5356 * Then, while compiling the assign op, we run through all the
5357 * variables on both sides of the assignment, setting a spare slot
5358 * in each of them to PL_generation. If any of them already have
5359 * that value, we know we've got commonality. We could use a
5360 * single bit marker, but then we'd have to make 2 passes, first
5361 * to clear the flag, then to test and set it. To find somewhere
5362 * to store these values, evil chicanery is done with SvUVX().
5365 if (maybe_common_vars) {
5367 if (aassign_common_vars(o))
5368 o->op_private |= OPpASSIGN_COMMON;
5372 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
5373 OP* tmpop = ((LISTOP*)right)->op_first;
5374 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
5375 PMOP * const pm = (PMOP*)tmpop;
5376 if (left->op_type == OP_RV2AV &&
5377 !(left->op_private & OPpLVAL_INTRO) &&
5378 !(o->op_private & OPpASSIGN_COMMON) )
5380 tmpop = ((UNOP*)left)->op_first;
5381 if (tmpop->op_type == OP_GV
5383 && !pm->op_pmreplrootu.op_pmtargetoff
5385 && !pm->op_pmreplrootu.op_pmtargetgv
5389 pm->op_pmreplrootu.op_pmtargetoff
5390 = cPADOPx(tmpop)->op_padix;
5391 cPADOPx(tmpop)->op_padix = 0; /* steal it */
5393 pm->op_pmreplrootu.op_pmtargetgv
5394 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
5395 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
5397 pm->op_pmflags |= PMf_ONCE;
5398 tmpop = cUNOPo->op_first; /* to list (nulled) */
5399 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
5400 tmpop->op_sibling = NULL; /* don't free split */
5401 right->op_next = tmpop->op_next; /* fix starting loc */
5402 op_free(o); /* blow off assign */
5403 right->op_flags &= ~OPf_WANT;
5404 /* "I don't know and I don't care." */
5409 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
5410 ((LISTOP*)right)->op_last->op_type == OP_CONST)
5412 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
5413 if (SvIOK(sv) && SvIVX(sv) == 0)
5414 sv_setiv(sv, PL_modcount+1);
5422 right = newOP(OP_UNDEF, 0);
5423 if (right->op_type == OP_READLINE) {
5424 right->op_flags |= OPf_STACKED;
5425 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
5429 o = newBINOP(OP_SASSIGN, flags,
5430 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
5436 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
5438 Constructs a state op (COP). The state op is normally a C<nextstate> op,
5439 but will be a C<dbstate> op if debugging is enabled for currently-compiled
5440 code. The state op is populated from L</PL_curcop> (or L</PL_compiling>).
5441 If I<label> is non-null, it supplies the name of a label to attach to
5442 the state op; this function takes ownership of the memory pointed at by
5443 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
5446 If I<o> is null, the state op is returned. Otherwise the state op is
5447 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
5448 is consumed by this function and becomes part of the returned op tree.
5454 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
5457 const U32 seq = intro_my();
5458 const U32 utf8 = flags & SVf_UTF8;
5463 NewOp(1101, cop, 1, COP);
5464 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
5465 cop->op_type = OP_DBSTATE;
5466 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
5469 cop->op_type = OP_NEXTSTATE;
5470 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
5472 cop->op_flags = (U8)flags;
5473 CopHINTS_set(cop, PL_hints);
5475 cop->op_private |= NATIVE_HINTS;
5477 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
5478 cop->op_next = (OP*)cop;
5481 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
5482 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
5484 Perl_cop_store_label(aTHX_ cop, label, strlen(label), utf8);
5486 PL_hints |= HINT_BLOCK_SCOPE;
5487 /* It seems that we need to defer freeing this pointer, as other parts
5488 of the grammar end up wanting to copy it after this op has been
5493 if (PL_parser && PL_parser->copline == NOLINE)
5494 CopLINE_set(cop, CopLINE(PL_curcop));
5496 CopLINE_set(cop, PL_parser->copline);
5498 PL_parser->copline = NOLINE;
5501 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
5503 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
5505 CopSTASH_set(cop, PL_curstash);
5507 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
5508 /* this line can have a breakpoint - store the cop in IV */
5509 AV *av = CopFILEAVx(PL_curcop);
5511 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
5512 if (svp && *svp != &PL_sv_undef ) {
5513 (void)SvIOK_on(*svp);
5514 SvIV_set(*svp, PTR2IV(cop));
5519 if (flags & OPf_SPECIAL)
5521 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
5525 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
5527 Constructs, checks, and returns a logical (flow control) op. I<type>
5528 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
5529 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
5530 the eight bits of C<op_private>, except that the bit with value 1 is
5531 automatically set. I<first> supplies the expression controlling the
5532 flow, and I<other> supplies the side (alternate) chain of ops; they are
5533 consumed by this function and become part of the constructed op tree.
5539 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
5543 PERL_ARGS_ASSERT_NEWLOGOP;
5545 return new_logop(type, flags, &first, &other);
5549 S_search_const(pTHX_ OP *o)
5551 PERL_ARGS_ASSERT_SEARCH_CONST;
5553 switch (o->op_type) {
5557 if (o->op_flags & OPf_KIDS)
5558 return search_const(cUNOPo->op_first);
5565 if (!(o->op_flags & OPf_KIDS))
5567 kid = cLISTOPo->op_first;
5569 switch (kid->op_type) {
5573 kid = kid->op_sibling;
5576 if (kid != cLISTOPo->op_last)
5582 kid = cLISTOPo->op_last;
5584 return search_const(kid);
5592 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
5600 int prepend_not = 0;
5602 PERL_ARGS_ASSERT_NEW_LOGOP;
5607 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
5608 return newBINOP(type, flags, scalar(first), scalar(other));
5610 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
5612 scalarboolean(first);
5613 /* optimize AND and OR ops that have NOTs as children */
5614 if (first->op_type == OP_NOT
5615 && (first->op_flags & OPf_KIDS)
5616 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
5617 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
5619 if (type == OP_AND || type == OP_OR) {
5625 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
5627 prepend_not = 1; /* prepend a NOT op later */
5631 /* search for a constant op that could let us fold the test */
5632 if ((cstop = search_const(first))) {
5633 if (cstop->op_private & OPpCONST_STRICT)
5634 no_bareword_allowed(cstop);
5635 else if ((cstop->op_private & OPpCONST_BARE))
5636 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
5637 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
5638 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
5639 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
5641 if (other->op_type == OP_CONST)
5642 other->op_private |= OPpCONST_SHORTCIRCUIT;
5644 OP *newop = newUNOP(OP_NULL, 0, other);
5645 op_getmad(first, newop, '1');
5646 newop->op_targ = type; /* set "was" field */
5650 if (other->op_type == OP_LEAVE)
5651 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
5652 else if (other->op_type == OP_MATCH
5653 || other->op_type == OP_SUBST
5654 || other->op_type == OP_TRANSR
5655 || other->op_type == OP_TRANS)
5656 /* Mark the op as being unbindable with =~ */
5657 other->op_flags |= OPf_SPECIAL;
5661 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
5662 const OP *o2 = other;
5663 if ( ! (o2->op_type == OP_LIST
5664 && (( o2 = cUNOPx(o2)->op_first))
5665 && o2->op_type == OP_PUSHMARK
5666 && (( o2 = o2->op_sibling)) )
5669 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
5670 || o2->op_type == OP_PADHV)
5671 && o2->op_private & OPpLVAL_INTRO
5672 && !(o2->op_private & OPpPAD_STATE))
5674 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
5675 "Deprecated use of my() in false conditional");
5679 if (first->op_type == OP_CONST)
5680 first->op_private |= OPpCONST_SHORTCIRCUIT;
5682 first = newUNOP(OP_NULL, 0, first);
5683 op_getmad(other, first, '2');
5684 first->op_targ = type; /* set "was" field */
5691 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
5692 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
5694 const OP * const k1 = ((UNOP*)first)->op_first;
5695 const OP * const k2 = k1->op_sibling;
5697 switch (first->op_type)
5700 if (k2 && k2->op_type == OP_READLINE
5701 && (k2->op_flags & OPf_STACKED)
5702 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5704 warnop = k2->op_type;
5709 if (k1->op_type == OP_READDIR
5710 || k1->op_type == OP_GLOB
5711 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5712 || k1->op_type == OP_EACH
5713 || k1->op_type == OP_AEACH)
5715 warnop = ((k1->op_type == OP_NULL)
5716 ? (OPCODE)k1->op_targ : k1->op_type);
5721 const line_t oldline = CopLINE(PL_curcop);
5722 CopLINE_set(PL_curcop, PL_parser->copline);
5723 Perl_warner(aTHX_ packWARN(WARN_MISC),
5724 "Value of %s%s can be \"0\"; test with defined()",
5726 ((warnop == OP_READLINE || warnop == OP_GLOB)
5727 ? " construct" : "() operator"));
5728 CopLINE_set(PL_curcop, oldline);
5735 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
5736 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
5738 NewOp(1101, logop, 1, LOGOP);
5740 logop->op_type = (OPCODE)type;
5741 logop->op_ppaddr = PL_ppaddr[type];
5742 logop->op_first = first;
5743 logop->op_flags = (U8)(flags | OPf_KIDS);
5744 logop->op_other = LINKLIST(other);
5745 logop->op_private = (U8)(1 | (flags >> 8));
5747 /* establish postfix order */
5748 logop->op_next = LINKLIST(first);
5749 first->op_next = (OP*)logop;
5750 first->op_sibling = other;
5752 CHECKOP(type,logop);
5754 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
5761 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
5763 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
5764 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5765 will be set automatically, and, shifted up eight bits, the eight bits of
5766 C<op_private>, except that the bit with value 1 is automatically set.
5767 I<first> supplies the expression selecting between the two branches,
5768 and I<trueop> and I<falseop> supply the branches; they are consumed by
5769 this function and become part of the constructed op tree.
5775 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
5783 PERL_ARGS_ASSERT_NEWCONDOP;
5786 return newLOGOP(OP_AND, 0, first, trueop);
5788 return newLOGOP(OP_OR, 0, first, falseop);
5790 scalarboolean(first);
5791 if ((cstop = search_const(first))) {
5792 /* Left or right arm of the conditional? */
5793 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
5794 OP *live = left ? trueop : falseop;
5795 OP *const dead = left ? falseop : trueop;
5796 if (cstop->op_private & OPpCONST_BARE &&
5797 cstop->op_private & OPpCONST_STRICT) {
5798 no_bareword_allowed(cstop);
5801 /* This is all dead code when PERL_MAD is not defined. */
5802 live = newUNOP(OP_NULL, 0, live);
5803 op_getmad(first, live, 'C');
5804 op_getmad(dead, live, left ? 'e' : 't');
5809 if (live->op_type == OP_LEAVE)
5810 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
5811 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
5812 || live->op_type == OP_TRANS || live->op_type == OP_TRANSR)
5813 /* Mark the op as being unbindable with =~ */
5814 live->op_flags |= OPf_SPECIAL;
5817 NewOp(1101, logop, 1, LOGOP);
5818 logop->op_type = OP_COND_EXPR;
5819 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
5820 logop->op_first = first;
5821 logop->op_flags = (U8)(flags | OPf_KIDS);
5822 logop->op_private = (U8)(1 | (flags >> 8));
5823 logop->op_other = LINKLIST(trueop);
5824 logop->op_next = LINKLIST(falseop);
5826 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
5829 /* establish postfix order */
5830 start = LINKLIST(first);
5831 first->op_next = (OP*)logop;
5833 first->op_sibling = trueop;
5834 trueop->op_sibling = falseop;
5835 o = newUNOP(OP_NULL, 0, (OP*)logop);
5837 trueop->op_next = falseop->op_next = o;
5844 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
5846 Constructs and returns a C<range> op, with subordinate C<flip> and
5847 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
5848 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
5849 for both the C<flip> and C<range> ops, except that the bit with value
5850 1 is automatically set. I<left> and I<right> supply the expressions
5851 controlling the endpoints of the range; they are consumed by this function
5852 and become part of the constructed op tree.
5858 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
5867 PERL_ARGS_ASSERT_NEWRANGE;
5869 NewOp(1101, range, 1, LOGOP);
5871 range->op_type = OP_RANGE;
5872 range->op_ppaddr = PL_ppaddr[OP_RANGE];
5873 range->op_first = left;
5874 range->op_flags = OPf_KIDS;
5875 leftstart = LINKLIST(left);
5876 range->op_other = LINKLIST(right);
5877 range->op_private = (U8)(1 | (flags >> 8));
5879 left->op_sibling = right;
5881 range->op_next = (OP*)range;
5882 flip = newUNOP(OP_FLIP, flags, (OP*)range);
5883 flop = newUNOP(OP_FLOP, 0, flip);
5884 o = newUNOP(OP_NULL, 0, flop);
5886 range->op_next = leftstart;
5888 left->op_next = flip;
5889 right->op_next = flop;
5891 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
5892 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
5893 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
5894 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
5896 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
5897 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
5899 /* check barewords before they might be optimized aways */
5900 if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT)
5901 no_bareword_allowed(left);
5902 if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT)
5903 no_bareword_allowed(right);
5906 if (!flip->op_private || !flop->op_private)
5907 LINKLIST(o); /* blow off optimizer unless constant */
5913 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
5915 Constructs, checks, and returns an op tree expressing a loop. This is
5916 only a loop in the control flow through the op tree; it does not have
5917 the heavyweight loop structure that allows exiting the loop by C<last>
5918 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
5919 top-level op, except that some bits will be set automatically as required.
5920 I<expr> supplies the expression controlling loop iteration, and I<block>
5921 supplies the body of the loop; they are consumed by this function and
5922 become part of the constructed op tree. I<debuggable> is currently
5923 unused and should always be 1.
5929 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
5934 const bool once = block && block->op_flags & OPf_SPECIAL &&
5935 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
5937 PERL_UNUSED_ARG(debuggable);
5940 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
5941 return block; /* do {} while 0 does once */
5942 if (expr->op_type == OP_READLINE
5943 || expr->op_type == OP_READDIR
5944 || expr->op_type == OP_GLOB
5945 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
5946 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
5947 expr = newUNOP(OP_DEFINED, 0,
5948 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
5949 } else if (expr->op_flags & OPf_KIDS) {
5950 const OP * const k1 = ((UNOP*)expr)->op_first;
5951 const OP * const k2 = k1 ? k1->op_sibling : NULL;
5952 switch (expr->op_type) {
5954 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
5955 && (k2->op_flags & OPf_STACKED)
5956 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5957 expr = newUNOP(OP_DEFINED, 0, expr);
5961 if (k1 && (k1->op_type == OP_READDIR
5962 || k1->op_type == OP_GLOB
5963 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5964 || k1->op_type == OP_EACH
5965 || k1->op_type == OP_AEACH))
5966 expr = newUNOP(OP_DEFINED, 0, expr);
5972 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
5973 * op, in listop. This is wrong. [perl #27024] */
5975 block = newOP(OP_NULL, 0);
5976 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
5977 o = new_logop(OP_AND, 0, &expr, &listop);
5980 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
5982 if (once && o != listop)
5983 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
5986 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
5988 o->op_flags |= flags;
5990 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
5995 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
5997 Constructs, checks, and returns an op tree expressing a C<while> loop.
5998 This is a heavyweight loop, with structure that allows exiting the loop
5999 by C<last> and suchlike.
6001 I<loop> is an optional preconstructed C<enterloop> op to use in the
6002 loop; if it is null then a suitable op will be constructed automatically.
6003 I<expr> supplies the loop's controlling expression. I<block> supplies the
6004 main body of the loop, and I<cont> optionally supplies a C<continue> block
6005 that operates as a second half of the body. All of these optree inputs
6006 are consumed by this function and become part of the constructed op tree.
6008 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6009 op and, shifted up eight bits, the eight bits of C<op_private> for
6010 the C<leaveloop> op, except that (in both cases) some bits will be set
6011 automatically. I<debuggable> is currently unused and should always be 1.
6012 I<has_my> can be supplied as true to force the
6013 loop body to be enclosed in its own scope.
6019 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
6020 OP *expr, OP *block, OP *cont, I32 has_my)
6029 PERL_UNUSED_ARG(debuggable);
6032 if (expr->op_type == OP_READLINE
6033 || expr->op_type == OP_READDIR
6034 || expr->op_type == OP_GLOB
6035 || expr->op_type == OP_EACH || expr->op_type == OP_AEACH
6036 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
6037 expr = newUNOP(OP_DEFINED, 0,
6038 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
6039 } else if (expr->op_flags & OPf_KIDS) {
6040 const OP * const k1 = ((UNOP*)expr)->op_first;
6041 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
6042 switch (expr->op_type) {
6044 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
6045 && (k2->op_flags & OPf_STACKED)
6046 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
6047 expr = newUNOP(OP_DEFINED, 0, expr);
6051 if (k1 && (k1->op_type == OP_READDIR
6052 || k1->op_type == OP_GLOB
6053 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
6054 || k1->op_type == OP_EACH
6055 || k1->op_type == OP_AEACH))
6056 expr = newUNOP(OP_DEFINED, 0, expr);
6063 block = newOP(OP_NULL, 0);
6064 else if (cont || has_my) {
6065 block = op_scope(block);
6069 next = LINKLIST(cont);
6072 OP * const unstack = newOP(OP_UNSTACK, 0);
6075 cont = op_append_elem(OP_LINESEQ, cont, unstack);
6079 listop = op_append_list(OP_LINESEQ, block, cont);
6081 redo = LINKLIST(listop);
6085 o = new_logop(OP_AND, 0, &expr, &listop);
6086 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
6087 op_free(expr); /* oops, it's a while (0) */
6089 return NULL; /* listop already freed by new_logop */
6092 ((LISTOP*)listop)->op_last->op_next =
6093 (o == listop ? redo : LINKLIST(o));
6099 NewOp(1101,loop,1,LOOP);
6100 loop->op_type = OP_ENTERLOOP;
6101 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
6102 loop->op_private = 0;
6103 loop->op_next = (OP*)loop;
6106 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
6108 loop->op_redoop = redo;
6109 loop->op_lastop = o;
6110 o->op_private |= loopflags;
6113 loop->op_nextop = next;
6115 loop->op_nextop = o;
6117 o->op_flags |= flags;
6118 o->op_private |= (flags >> 8);
6123 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
6125 Constructs, checks, and returns an op tree expressing a C<foreach>
6126 loop (iteration through a list of values). This is a heavyweight loop,
6127 with structure that allows exiting the loop by C<last> and suchlike.
6129 I<sv> optionally supplies the variable that will be aliased to each
6130 item in turn; if null, it defaults to C<$_> (either lexical or global).
6131 I<expr> supplies the list of values to iterate over. I<block> supplies
6132 the main body of the loop, and I<cont> optionally supplies a C<continue>
6133 block that operates as a second half of the body. All of these optree
6134 inputs are consumed by this function and become part of the constructed
6137 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
6138 op and, shifted up eight bits, the eight bits of C<op_private> for
6139 the C<leaveloop> op, except that (in both cases) some bits will be set
6146 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
6151 PADOFFSET padoff = 0;
6156 PERL_ARGS_ASSERT_NEWFOROP;
6159 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
6160 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
6161 sv->op_type = OP_RV2GV;
6162 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
6164 /* The op_type check is needed to prevent a possible segfault
6165 * if the loop variable is undeclared and 'strict vars' is in
6166 * effect. This is illegal but is nonetheless parsed, so we
6167 * may reach this point with an OP_CONST where we're expecting
6170 if (cUNOPx(sv)->op_first->op_type == OP_GV
6171 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
6172 iterpflags |= OPpITER_DEF;
6174 else if (sv->op_type == OP_PADSV) { /* private variable */
6175 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
6176 padoff = sv->op_targ;
6186 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
6188 SV *const namesv = PAD_COMPNAME_SV(padoff);
6190 const char *const name = SvPV_const(namesv, len);
6192 if (len == 2 && name[0] == '$' && name[1] == '_')
6193 iterpflags |= OPpITER_DEF;
6197 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
6198 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
6199 sv = newGVOP(OP_GV, 0, PL_defgv);
6204 iterpflags |= OPpITER_DEF;
6206 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
6207 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
6208 iterflags |= OPf_STACKED;
6210 else if (expr->op_type == OP_NULL &&
6211 (expr->op_flags & OPf_KIDS) &&
6212 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
6214 /* Basically turn for($x..$y) into the same as for($x,$y), but we
6215 * set the STACKED flag to indicate that these values are to be
6216 * treated as min/max values by 'pp_iterinit'.
6218 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
6219 LOGOP* const range = (LOGOP*) flip->op_first;
6220 OP* const left = range->op_first;
6221 OP* const right = left->op_sibling;
6224 range->op_flags &= ~OPf_KIDS;
6225 range->op_first = NULL;
6227 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
6228 listop->op_first->op_next = range->op_next;
6229 left->op_next = range->op_other;
6230 right->op_next = (OP*)listop;
6231 listop->op_next = listop->op_first;
6234 op_getmad(expr,(OP*)listop,'O');
6238 expr = (OP*)(listop);
6240 iterflags |= OPf_STACKED;
6243 expr = op_lvalue(force_list(expr), OP_GREPSTART);
6246 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
6247 op_append_elem(OP_LIST, expr, scalar(sv))));
6248 assert(!loop->op_next);
6249 /* for my $x () sets OPpLVAL_INTRO;
6250 * for our $x () sets OPpOUR_INTRO */
6251 loop->op_private = (U8)iterpflags;
6252 #ifdef PL_OP_SLAB_ALLOC
6255 NewOp(1234,tmp,1,LOOP);
6256 Copy(loop,tmp,1,LISTOP);
6257 S_op_destroy(aTHX_ (OP*)loop);
6261 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
6263 loop->op_targ = padoff;
6264 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
6266 op_getmad(madsv, (OP*)loop, 'v');
6271 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
6273 Constructs, checks, and returns a loop-exiting op (such as C<goto>
6274 or C<last>). I<type> is the opcode. I<label> supplies the parameter
6275 determining the target of the op; it is consumed by this function and
6276 become part of the constructed op tree.
6282 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
6287 PERL_ARGS_ASSERT_NEWLOOPEX;
6289 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
6291 if (type != OP_GOTO) {
6292 /* "last()" means "last" */
6293 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
6294 o = newOP(type, OPf_SPECIAL);
6298 label->op_type == OP_CONST
6299 ? SvUTF8(((SVOP*)label)->op_sv)
6301 savesharedpv(label->op_type == OP_CONST
6302 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
6306 op_getmad(label,o,'L');
6312 /* Check whether it's going to be a goto &function */
6313 if (label->op_type == OP_ENTERSUB
6314 && !(label->op_flags & OPf_STACKED))
6315 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
6316 else if (label->op_type == OP_CONST) {
6317 SV * const sv = ((SVOP *)label)->op_sv;
6319 const char *s = SvPV_const(sv,l);
6320 if (l == strlen(s)) goto const_label;
6322 o = newUNOP(type, OPf_STACKED, label);
6324 PL_hints |= HINT_BLOCK_SCOPE;
6328 /* if the condition is a literal array or hash
6329 (or @{ ... } etc), make a reference to it.
6332 S_ref_array_or_hash(pTHX_ OP *cond)
6335 && (cond->op_type == OP_RV2AV
6336 || cond->op_type == OP_PADAV
6337 || cond->op_type == OP_RV2HV
6338 || cond->op_type == OP_PADHV))
6340 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
6343 && (cond->op_type == OP_ASLICE
6344 || cond->op_type == OP_HSLICE)) {
6346 /* anonlist now needs a list from this op, was previously used in
6348 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
6349 cond->op_flags |= OPf_WANT_LIST;
6351 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
6358 /* These construct the optree fragments representing given()
6361 entergiven and enterwhen are LOGOPs; the op_other pointer
6362 points up to the associated leave op. We need this so we
6363 can put it in the context and make break/continue work.
6364 (Also, of course, pp_enterwhen will jump straight to
6365 op_other if the match fails.)
6369 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
6370 I32 enter_opcode, I32 leave_opcode,
6371 PADOFFSET entertarg)
6377 PERL_ARGS_ASSERT_NEWGIVWHENOP;
6379 NewOp(1101, enterop, 1, LOGOP);
6380 enterop->op_type = (Optype)enter_opcode;
6381 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
6382 enterop->op_flags = (U8) OPf_KIDS;
6383 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
6384 enterop->op_private = 0;
6386 o = newUNOP(leave_opcode, 0, (OP *) enterop);
6389 enterop->op_first = scalar(cond);
6390 cond->op_sibling = block;
6392 o->op_next = LINKLIST(cond);
6393 cond->op_next = (OP *) enterop;
6396 /* This is a default {} block */
6397 enterop->op_first = block;
6398 enterop->op_flags |= OPf_SPECIAL;
6399 o ->op_flags |= OPf_SPECIAL;
6401 o->op_next = (OP *) enterop;
6404 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
6405 entergiven and enterwhen both
6408 enterop->op_next = LINKLIST(block);
6409 block->op_next = enterop->op_other = o;
6414 /* Does this look like a boolean operation? For these purposes
6415 a boolean operation is:
6416 - a subroutine call [*]
6417 - a logical connective
6418 - a comparison operator
6419 - a filetest operator, with the exception of -s -M -A -C
6420 - defined(), exists() or eof()
6421 - /$re/ or $foo =~ /$re/
6423 [*] possibly surprising
6426 S_looks_like_bool(pTHX_ const OP *o)
6430 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
6432 switch(o->op_type) {
6435 return looks_like_bool(cLOGOPo->op_first);
6439 looks_like_bool(cLOGOPo->op_first)
6440 && looks_like_bool(cLOGOPo->op_first->op_sibling));
6445 o->op_flags & OPf_KIDS
6446 && looks_like_bool(cUNOPo->op_first));
6450 case OP_NOT: case OP_XOR:
6452 case OP_EQ: case OP_NE: case OP_LT:
6453 case OP_GT: case OP_LE: case OP_GE:
6455 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
6456 case OP_I_GT: case OP_I_LE: case OP_I_GE:
6458 case OP_SEQ: case OP_SNE: case OP_SLT:
6459 case OP_SGT: case OP_SLE: case OP_SGE:
6463 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
6464 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
6465 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
6466 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
6467 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
6468 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
6469 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
6470 case OP_FTTEXT: case OP_FTBINARY:
6472 case OP_DEFINED: case OP_EXISTS:
6473 case OP_MATCH: case OP_EOF:
6480 /* Detect comparisons that have been optimized away */
6481 if (cSVOPo->op_sv == &PL_sv_yes
6482 || cSVOPo->op_sv == &PL_sv_no)
6495 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
6497 Constructs, checks, and returns an op tree expressing a C<given> block.
6498 I<cond> supplies the expression that will be locally assigned to a lexical
6499 variable, and I<block> supplies the body of the C<given> construct; they
6500 are consumed by this function and become part of the constructed op tree.
6501 I<defsv_off> is the pad offset of the scalar lexical variable that will
6508 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
6511 PERL_ARGS_ASSERT_NEWGIVENOP;
6512 return newGIVWHENOP(
6513 ref_array_or_hash(cond),
6515 OP_ENTERGIVEN, OP_LEAVEGIVEN,
6520 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
6522 Constructs, checks, and returns an op tree expressing a C<when> block.
6523 I<cond> supplies the test expression, and I<block> supplies the block
6524 that will be executed if the test evaluates to true; they are consumed
6525 by this function and become part of the constructed op tree. I<cond>
6526 will be interpreted DWIMically, often as a comparison against C<$_>,
6527 and may be null to generate a C<default> block.
6533 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
6535 const bool cond_llb = (!cond || looks_like_bool(cond));
6538 PERL_ARGS_ASSERT_NEWWHENOP;
6543 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
6545 scalar(ref_array_or_hash(cond)));
6548 return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0);
6552 Perl_cv_ckproto_len_flags(pTHX_ const CV *cv, const GV *gv, const char *p,
6553 const STRLEN len, const U32 flags)
6555 const char * const cvp = CvPROTO(cv);
6556 const STRLEN clen = CvPROTOLEN(cv);
6558 PERL_ARGS_ASSERT_CV_CKPROTO_LEN_FLAGS;
6560 if (((!p != !cvp) /* One has prototype, one has not. */
6562 (flags & SVf_UTF8) == SvUTF8(cv)
6563 ? len != clen || memNE(cvp, p, len)
6565 ? bytes_cmp_utf8((const U8 *)cvp, clen,
6567 : bytes_cmp_utf8((const U8 *)p, len,
6568 (const U8 *)cvp, clen)
6572 && ckWARN_d(WARN_PROTOTYPE)) {
6573 SV* const msg = sv_newmortal();
6577 gv_efullname3(name = sv_newmortal(), gv, NULL);
6578 sv_setpvs(msg, "Prototype mismatch:");
6580 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
6582 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")",
6583 SVfARG(newSVpvn_flags(cvp,clen, SvUTF8(cv)|SVs_TEMP))
6586 sv_catpvs(msg, ": none");
6587 sv_catpvs(msg, " vs ");
6589 Perl_sv_catpvf(aTHX_ msg, "(%"SVf")", SVfARG(newSVpvn_flags(p, len, flags | SVs_TEMP)));
6591 sv_catpvs(msg, "none");
6592 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
6596 static void const_sv_xsub(pTHX_ CV* cv);
6600 =head1 Optree Manipulation Functions
6602 =for apidoc cv_const_sv
6604 If C<cv> is a constant sub eligible for inlining. returns the constant
6605 value returned by the sub. Otherwise, returns NULL.
6607 Constant subs can be created with C<newCONSTSUB> or as described in
6608 L<perlsub/"Constant Functions">.
6613 Perl_cv_const_sv(pTHX_ const CV *const cv)
6615 PERL_UNUSED_CONTEXT;
6618 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
6620 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6623 /* op_const_sv: examine an optree to determine whether it's in-lineable.
6624 * Can be called in 3 ways:
6627 * look for a single OP_CONST with attached value: return the value
6629 * cv && CvCLONE(cv) && !CvCONST(cv)
6631 * examine the clone prototype, and if contains only a single
6632 * OP_CONST referencing a pad const, or a single PADSV referencing
6633 * an outer lexical, return a non-zero value to indicate the CV is
6634 * a candidate for "constizing" at clone time
6638 * We have just cloned an anon prototype that was marked as a const
6639 * candidate. Try to grab the current value, and in the case of
6640 * PADSV, ignore it if it has multiple references. Return the value.
6644 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
6655 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
6656 o = cLISTOPo->op_first->op_sibling;
6658 for (; o; o = o->op_next) {
6659 const OPCODE type = o->op_type;
6661 if (sv && o->op_next == o)
6663 if (o->op_next != o) {
6664 if (type == OP_NEXTSTATE
6665 || (type == OP_NULL && !(o->op_flags & OPf_KIDS))
6666 || type == OP_PUSHMARK)
6668 if (type == OP_DBSTATE)
6671 if (type == OP_LEAVESUB || type == OP_RETURN)
6675 if (type == OP_CONST && cSVOPo->op_sv)
6677 else if (cv && type == OP_CONST) {
6678 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6682 else if (cv && type == OP_PADSV) {
6683 if (CvCONST(cv)) { /* newly cloned anon */
6684 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6685 /* the candidate should have 1 ref from this pad and 1 ref
6686 * from the parent */
6687 if (!sv || SvREFCNT(sv) != 2)
6694 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
6695 sv = &PL_sv_undef; /* an arbitrary non-null value */
6710 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6713 /* This would be the return value, but the return cannot be reached. */
6714 OP* pegop = newOP(OP_NULL, 0);
6717 PERL_UNUSED_ARG(floor);
6727 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
6729 NORETURN_FUNCTION_END;
6734 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6736 return newATTRSUB_flags(floor, o, proto, attrs, block, 0);
6740 Perl_newATTRSUB_flags(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs,
6741 OP *block, U32 flags)
6746 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
6748 register CV *cv = NULL;
6750 /* If the subroutine has no body, no attributes, and no builtin attributes
6751 then it's just a sub declaration, and we may be able to get away with
6752 storing with a placeholder scalar in the symbol table, rather than a
6753 full GV and CV. If anything is present then it will take a full CV to
6755 const I32 gv_fetch_flags
6756 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6758 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
6760 const bool o_is_gv = flags & 1;
6761 const char * const name =
6762 o ? SvPV_const(o_is_gv ? (SV *)o : cSVOPo->op_sv, namlen) : NULL;
6764 bool name_is_utf8 = o && !o_is_gv && SvUTF8(cSVOPo->op_sv);
6767 assert(proto->op_type == OP_CONST);
6768 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
6769 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
6779 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
6781 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
6782 SV * const sv = sv_newmortal();
6783 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
6784 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
6785 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
6786 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
6788 } else if (PL_curstash) {
6789 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
6792 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
6796 if (!PL_madskills) {
6805 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
6806 maximum a prototype before. */
6807 if (SvTYPE(gv) > SVt_NULL) {
6808 cv_ckproto_len_flags((const CV *)gv, NULL, ps, ps_len, ps_utf8);
6811 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
6812 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(gv));
6815 sv_setiv(MUTABLE_SV(gv), -1);
6817 SvREFCNT_dec(PL_compcv);
6818 cv = PL_compcv = NULL;
6822 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
6824 if (!block || !ps || *ps || attrs
6825 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6827 || block->op_type == OP_NULL
6832 const_sv = op_const_sv(block, NULL);
6835 const bool exists = CvROOT(cv) || CvXSUB(cv);
6837 /* if the subroutine doesn't exist and wasn't pre-declared
6838 * with a prototype, assume it will be AUTOLOADed,
6839 * skipping the prototype check
6841 if (exists || SvPOK(cv))
6842 cv_ckproto_len_flags(cv, gv, ps, ps_len, ps_utf8);
6843 /* already defined (or promised)? */
6844 if (exists || GvASSUMECV(gv)) {
6847 || block->op_type == OP_NULL
6850 if (CvFLAGS(PL_compcv)) {
6851 /* might have had built-in attrs applied */
6852 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
6853 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl
6854 && ckWARN(WARN_MISC))
6855 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
6857 (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS
6858 & ~(CVf_LVALUE * pureperl));
6860 if (attrs) goto attrs;
6861 /* just a "sub foo;" when &foo is already defined */
6862 SAVEFREESV(PL_compcv);
6867 && block->op_type != OP_NULL
6870 const line_t oldline = CopLINE(PL_curcop);
6871 if (PL_parser && PL_parser->copline != NOLINE)
6872 CopLINE_set(PL_curcop, PL_parser->copline);
6873 report_redefined_cv(cSVOPo->op_sv, cv, &const_sv);
6874 CopLINE_set(PL_curcop, oldline);
6876 if (!PL_minus_c) /* keep old one around for madskills */
6879 /* (PL_madskills unset in used file.) */
6888 SvREFCNT_inc_simple_void_NN(const_sv);
6890 assert(!CvROOT(cv) && !CvCONST(cv));
6891 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
6892 CvXSUBANY(cv).any_ptr = const_sv;
6893 CvXSUB(cv) = const_sv_xsub;
6899 cv = newCONSTSUB_flags(
6900 NULL, name, namlen, name_is_utf8 ? SVf_UTF8 : 0,
6905 (CvGV(cv) && GvSTASH(CvGV(cv)))
6910 if (HvENAME_HEK(stash))
6911 mro_method_changed_in(stash); /* sub Foo::Bar () { 123 } */
6915 SvREFCNT_dec(PL_compcv);
6919 if (cv) { /* must reuse cv if autoloaded */
6920 /* transfer PL_compcv to cv */
6923 && block->op_type != OP_NULL
6926 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
6927 AV *const temp_av = CvPADLIST(cv);
6928 CV *const temp_cv = CvOUTSIDE(cv);
6930 assert(!CvWEAKOUTSIDE(cv));
6931 assert(!CvCVGV_RC(cv));
6932 assert(CvGV(cv) == gv);
6935 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
6936 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
6937 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
6938 CvPADLIST(cv) = CvPADLIST(PL_compcv);
6939 CvOUTSIDE(PL_compcv) = temp_cv;
6940 CvPADLIST(PL_compcv) = temp_av;
6942 if (CvFILE(cv) && CvDYNFILE(cv)) {
6943 Safefree(CvFILE(cv));
6945 CvFILE_set_from_cop(cv, PL_curcop);
6946 CvSTASH_set(cv, PL_curstash);
6948 /* inner references to PL_compcv must be fixed up ... */
6949 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
6950 if (PERLDB_INTER)/* Advice debugger on the new sub. */
6951 ++PL_sub_generation;
6954 /* Might have had built-in attributes applied -- propagate them. */
6955 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
6957 /* ... before we throw it away */
6958 SvREFCNT_dec(PL_compcv);
6966 if (strEQ(name, "import")) {
6967 PL_formfeed = MUTABLE_SV(cv);
6968 /* diag_listed_as: SKIPME */
6969 Perl_warner(aTHX_ packWARN(WARN_VOID), "0x%"UVxf"\n", PTR2UV(cv));
6973 if (HvENAME_HEK(GvSTASH(gv)))
6974 /* sub Foo::bar { (shift)+1 } */
6975 mro_method_changed_in(GvSTASH(gv));
6980 CvFILE_set_from_cop(cv, PL_curcop);
6981 CvSTASH_set(cv, PL_curstash);
6985 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
6986 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
6989 if (PL_parser && PL_parser->error_count) {
6993 const char *s = strrchr(name, ':');
6995 if (strEQ(s, "BEGIN")) {
6996 const char not_safe[] =
6997 "BEGIN not safe after errors--compilation aborted";
6998 if (PL_in_eval & EVAL_KEEPERR)
6999 Perl_croak(aTHX_ not_safe);
7001 /* force display of errors found but not reported */
7002 sv_catpv(ERRSV, not_safe);
7003 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
7012 /* If we assign an optree to a PVCV, then we've defined a subroutine that
7013 the debugger could be able to set a breakpoint in, so signal to
7014 pp_entereval that it should not throw away any saved lines at scope
7017 PL_breakable_sub_gen++;
7018 /* This makes sub {}; work as expected. */
7019 if (block->op_type == OP_STUB) {
7020 OP* const newblock = newSTATEOP(0, NULL, 0);
7022 op_getmad(block,newblock,'B');
7028 else block->op_attached = 1;
7029 CvROOT(cv) = CvLVALUE(cv)
7030 ? newUNOP(OP_LEAVESUBLV, 0,
7031 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
7032 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
7033 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7034 OpREFCNT_set(CvROOT(cv), 1);
7035 CvSTART(cv) = LINKLIST(CvROOT(cv));
7036 CvROOT(cv)->op_next = 0;
7037 CALL_PEEP(CvSTART(cv));
7038 finalize_optree(CvROOT(cv));
7040 /* now that optimizer has done its work, adjust pad values */
7042 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
7045 assert(!CvCONST(cv));
7046 if (ps && !*ps && op_const_sv(block, cv))
7052 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
7053 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
7054 apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE);
7057 if (block && has_name) {
7058 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
7059 SV * const tmpstr = sv_newmortal();
7060 GV * const db_postponed = gv_fetchpvs("DB::postponed",
7061 GV_ADDMULTI, SVt_PVHV);
7063 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
7066 (long)CopLINE(PL_curcop));
7067 gv_efullname3(tmpstr, gv, NULL);
7068 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
7069 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
7070 hv = GvHVn(db_postponed);
7071 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
7072 CV * const pcv = GvCV(db_postponed);
7078 call_sv(MUTABLE_SV(pcv), G_DISCARD);
7083 if (name && ! (PL_parser && PL_parser->error_count))
7084 process_special_blocks(name, gv, cv);
7089 PL_parser->copline = NOLINE;
7095 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
7098 const char *const colon = strrchr(fullname,':');
7099 const char *const name = colon ? colon + 1 : fullname;
7101 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
7104 if (strEQ(name, "BEGIN")) {
7105 const I32 oldscope = PL_scopestack_ix;
7107 SAVECOPFILE(&PL_compiling);
7108 SAVECOPLINE(&PL_compiling);
7109 SAVEVPTR(PL_curcop);
7111 DEBUG_x( dump_sub(gv) );
7112 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
7113 GvCV_set(gv,0); /* cv has been hijacked */
7114 call_list(oldscope, PL_beginav);
7116 CopHINTS_set(&PL_compiling, PL_hints);
7123 if strEQ(name, "END") {
7124 DEBUG_x( dump_sub(gv) );
7125 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
7128 } else if (*name == 'U') {
7129 if (strEQ(name, "UNITCHECK")) {
7130 /* It's never too late to run a unitcheck block */
7131 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
7135 } else if (*name == 'C') {
7136 if (strEQ(name, "CHECK")) {
7138 /* diag_listed_as: Too late to run %s block */
7139 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7140 "Too late to run CHECK block");
7141 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
7145 } else if (*name == 'I') {
7146 if (strEQ(name, "INIT")) {
7148 /* diag_listed_as: Too late to run %s block */
7149 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
7150 "Too late to run INIT block");
7151 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
7157 DEBUG_x( dump_sub(gv) );
7158 GvCV_set(gv,0); /* cv has been hijacked */
7163 =for apidoc newCONSTSUB
7165 See L</newCONSTSUB_flags>.
7171 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
7173 return newCONSTSUB_flags(stash, name, name ? strlen(name) : 0, 0, sv);
7177 =for apidoc newCONSTSUB_flags
7179 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
7180 eligible for inlining at compile-time.
7182 Currently, the only useful value for C<flags> is SVf_UTF8.
7184 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
7185 which won't be called if used as a destructor, but will suppress the overhead
7186 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
7193 Perl_newCONSTSUB_flags(pTHX_ HV *stash, const char *name, STRLEN len,
7199 const char *const file = CopFILE(PL_curcop);
7201 SV *const temp_sv = CopFILESV(PL_curcop);
7202 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
7207 if (IN_PERL_RUNTIME) {
7208 /* at runtime, it's not safe to manipulate PL_curcop: it may be
7209 * an op shared between threads. Use a non-shared COP for our
7211 SAVEVPTR(PL_curcop);
7212 SAVECOMPILEWARNINGS();
7213 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
7214 PL_curcop = &PL_compiling;
7216 SAVECOPLINE(PL_curcop);
7217 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
7220 PL_hints &= ~HINT_BLOCK_SCOPE;
7223 SAVEGENERICSV(PL_curstash);
7224 PL_curstash = (HV *)SvREFCNT_inc_simple_NN(stash);
7227 /* file becomes the CvFILE. For an XS, it's usually static storage,
7228 and so doesn't get free()d. (It's expected to be from the C pre-
7229 processor __FILE__ directive). But we need a dynamically allocated one,
7230 and we need it to get freed. */
7231 cv = newXS_len_flags(name, len, const_sv_xsub, file ? file : "", "",
7232 &sv, XS_DYNAMIC_FILENAME | flags);
7233 CvXSUBANY(cv).any_ptr = sv;
7242 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
7243 const char *const filename, const char *const proto,
7246 PERL_ARGS_ASSERT_NEWXS_FLAGS;
7247 return newXS_len_flags(
7248 name, name ? strlen(name) : 0, subaddr, filename, proto, NULL, flags
7253 Perl_newXS_len_flags(pTHX_ const char *name, STRLEN len,
7254 XSUBADDR_t subaddr, const char *const filename,
7255 const char *const proto, SV **const_svp,
7260 PERL_ARGS_ASSERT_NEWXS_LEN_FLAGS;
7263 GV * const gv = name
7265 name,len,GV_ADDMULTI|flags,SVt_PVCV
7268 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
7269 GV_ADDMULTI | flags, SVt_PVCV);
7272 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
7274 if ((cv = (name ? GvCV(gv) : NULL))) {
7276 /* just a cached method */
7280 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
7281 /* already defined (or promised) */
7282 /* Redundant check that allows us to avoid creating an SV
7283 most of the time: */
7284 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
7285 const line_t oldline = CopLINE(PL_curcop);
7286 if (PL_parser && PL_parser->copline != NOLINE)
7287 CopLINE_set(PL_curcop, PL_parser->copline);
7288 report_redefined_cv(newSVpvn_flags(
7289 name,len,(flags&SVf_UTF8)|SVs_TEMP
7292 CopLINE_set(PL_curcop, oldline);
7299 if (cv) /* must reuse cv if autoloaded */
7302 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7306 if (HvENAME_HEK(GvSTASH(gv)))
7307 mro_method_changed_in(GvSTASH(gv)); /* newXS */
7313 (void)gv_fetchfile(filename);
7314 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
7315 an external constant string */
7316 assert(!CvDYNFILE(cv)); /* cv_undef should have turned it off */
7318 CvXSUB(cv) = subaddr;
7321 process_special_blocks(name, gv, cv);
7324 if (flags & XS_DYNAMIC_FILENAME) {
7325 CvFILE(cv) = savepv(filename);
7328 sv_setpv(MUTABLE_SV(cv), proto);
7333 =for apidoc U||newXS
7335 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
7336 static storage, as it is used directly as CvFILE(), without a copy being made.
7342 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
7344 PERL_ARGS_ASSERT_NEWXS;
7345 return newXS_len_flags(
7346 name, name ? strlen(name) : 0, subaddr, filename, NULL, NULL, 0
7355 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
7360 OP* pegop = newOP(OP_NULL, 0);
7364 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
7365 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
7368 if ((cv = GvFORM(gv))) {
7369 if (ckWARN(WARN_REDEFINE)) {
7370 const line_t oldline = CopLINE(PL_curcop);
7371 if (PL_parser && PL_parser->copline != NOLINE)
7372 CopLINE_set(PL_curcop, PL_parser->copline);
7374 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7375 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
7377 /* diag_listed_as: Format %s redefined */
7378 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7379 "Format STDOUT redefined");
7381 CopLINE_set(PL_curcop, oldline);
7388 CvFILE_set_from_cop(cv, PL_curcop);
7391 pad_tidy(padtidy_FORMAT);
7392 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
7393 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7394 OpREFCNT_set(CvROOT(cv), 1);
7395 CvSTART(cv) = LINKLIST(CvROOT(cv));
7396 CvROOT(cv)->op_next = 0;
7397 CALL_PEEP(CvSTART(cv));
7398 finalize_optree(CvROOT(cv));
7400 op_getmad(o,pegop,'n');
7401 op_getmad_weak(block, pegop, 'b');
7406 PL_parser->copline = NOLINE;
7414 Perl_newANONLIST(pTHX_ OP *o)
7416 return convert(OP_ANONLIST, OPf_SPECIAL, o);
7420 Perl_newANONHASH(pTHX_ OP *o)
7422 return convert(OP_ANONHASH, OPf_SPECIAL, o);
7426 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
7428 return newANONATTRSUB(floor, proto, NULL, block);
7432 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
7434 return newUNOP(OP_REFGEN, 0,
7435 newSVOP(OP_ANONCODE, 0,
7436 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
7440 Perl_oopsAV(pTHX_ OP *o)
7444 PERL_ARGS_ASSERT_OOPSAV;
7446 switch (o->op_type) {
7448 o->op_type = OP_PADAV;
7449 o->op_ppaddr = PL_ppaddr[OP_PADAV];
7450 return ref(o, OP_RV2AV);
7453 o->op_type = OP_RV2AV;
7454 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
7459 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
7466 Perl_oopsHV(pTHX_ OP *o)
7470 PERL_ARGS_ASSERT_OOPSHV;
7472 switch (o->op_type) {
7475 o->op_type = OP_PADHV;
7476 o->op_ppaddr = PL_ppaddr[OP_PADHV];
7477 return ref(o, OP_RV2HV);
7481 o->op_type = OP_RV2HV;
7482 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
7487 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
7494 Perl_newAVREF(pTHX_ OP *o)
7498 PERL_ARGS_ASSERT_NEWAVREF;
7500 if (o->op_type == OP_PADANY) {
7501 o->op_type = OP_PADAV;
7502 o->op_ppaddr = PL_ppaddr[OP_PADAV];
7505 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
7506 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7507 "Using an array as a reference is deprecated");
7509 return newUNOP(OP_RV2AV, 0, scalar(o));
7513 Perl_newGVREF(pTHX_ I32 type, OP *o)
7515 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
7516 return newUNOP(OP_NULL, 0, o);
7517 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
7521 Perl_newHVREF(pTHX_ OP *o)
7525 PERL_ARGS_ASSERT_NEWHVREF;
7527 if (o->op_type == OP_PADANY) {
7528 o->op_type = OP_PADHV;
7529 o->op_ppaddr = PL_ppaddr[OP_PADHV];
7532 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
7533 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7534 "Using a hash as a reference is deprecated");
7536 return newUNOP(OP_RV2HV, 0, scalar(o));
7540 Perl_newCVREF(pTHX_ I32 flags, OP *o)
7542 return newUNOP(OP_RV2CV, flags, scalar(o));
7546 Perl_newSVREF(pTHX_ OP *o)
7550 PERL_ARGS_ASSERT_NEWSVREF;
7552 if (o->op_type == OP_PADANY) {
7553 o->op_type = OP_PADSV;
7554 o->op_ppaddr = PL_ppaddr[OP_PADSV];
7557 return newUNOP(OP_RV2SV, 0, scalar(o));
7560 /* Check routines. See the comments at the top of this file for details
7561 * on when these are called */
7564 Perl_ck_anoncode(pTHX_ OP *o)
7566 PERL_ARGS_ASSERT_CK_ANONCODE;
7568 cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type);
7570 cSVOPo->op_sv = NULL;
7575 Perl_ck_bitop(pTHX_ OP *o)
7579 PERL_ARGS_ASSERT_CK_BITOP;
7581 o->op_private = (U8)(PL_hints & HINT_INTEGER);
7582 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
7583 && (o->op_type == OP_BIT_OR
7584 || o->op_type == OP_BIT_AND
7585 || o->op_type == OP_BIT_XOR))
7587 const OP * const left = cBINOPo->op_first;
7588 const OP * const right = left->op_sibling;
7589 if ((OP_IS_NUMCOMPARE(left->op_type) &&
7590 (left->op_flags & OPf_PARENS) == 0) ||
7591 (OP_IS_NUMCOMPARE(right->op_type) &&
7592 (right->op_flags & OPf_PARENS) == 0))
7593 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
7594 "Possible precedence problem on bitwise %c operator",
7595 o->op_type == OP_BIT_OR ? '|'
7596 : o->op_type == OP_BIT_AND ? '&' : '^'
7602 PERL_STATIC_INLINE bool
7603 is_dollar_bracket(pTHX_ const OP * const o)
7606 return o->op_type == OP_RV2SV && o->op_flags & OPf_KIDS
7607 && (kid = cUNOPx(o)->op_first)
7608 && kid->op_type == OP_GV
7609 && strEQ(GvNAME(cGVOPx_gv(kid)), "[");
7613 Perl_ck_cmp(pTHX_ OP *o)
7615 PERL_ARGS_ASSERT_CK_CMP;
7616 if (ckWARN(WARN_SYNTAX)) {
7617 const OP *kid = cUNOPo->op_first;
7620 is_dollar_bracket(aTHX_ kid)
7621 && kid->op_sibling && kid->op_sibling->op_type == OP_CONST
7623 || ( kid->op_type == OP_CONST
7624 && (kid = kid->op_sibling) && is_dollar_bracket(aTHX_ kid))
7626 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7627 "$[ used in %s (did you mean $] ?)", OP_DESC(o));
7633 Perl_ck_concat(pTHX_ OP *o)
7635 const OP * const kid = cUNOPo->op_first;
7637 PERL_ARGS_ASSERT_CK_CONCAT;
7638 PERL_UNUSED_CONTEXT;
7640 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
7641 !(kUNOP->op_first->op_flags & OPf_MOD))
7642 o->op_flags |= OPf_STACKED;
7647 Perl_ck_spair(pTHX_ OP *o)
7651 PERL_ARGS_ASSERT_CK_SPAIR;
7653 if (o->op_flags & OPf_KIDS) {
7656 const OPCODE type = o->op_type;
7657 o = modkids(ck_fun(o), type);
7658 kid = cUNOPo->op_first;
7659 newop = kUNOP->op_first->op_sibling;
7661 const OPCODE type = newop->op_type;
7662 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
7663 type == OP_PADAV || type == OP_PADHV ||
7664 type == OP_RV2AV || type == OP_RV2HV)
7668 op_getmad(kUNOP->op_first,newop,'K');
7670 op_free(kUNOP->op_first);
7672 kUNOP->op_first = newop;
7674 o->op_ppaddr = PL_ppaddr[++o->op_type];
7679 Perl_ck_delete(pTHX_ OP *o)
7681 PERL_ARGS_ASSERT_CK_DELETE;
7685 if (o->op_flags & OPf_KIDS) {
7686 OP * const kid = cUNOPo->op_first;
7687 switch (kid->op_type) {
7689 o->op_flags |= OPf_SPECIAL;
7692 o->op_private |= OPpSLICE;
7695 o->op_flags |= OPf_SPECIAL;
7700 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
7703 if (kid->op_private & OPpLVAL_INTRO)
7704 o->op_private |= OPpLVAL_INTRO;
7711 Perl_ck_die(pTHX_ OP *o)
7713 PERL_ARGS_ASSERT_CK_DIE;
7716 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7722 Perl_ck_eof(pTHX_ OP *o)
7726 PERL_ARGS_ASSERT_CK_EOF;
7728 if (o->op_flags & OPf_KIDS) {
7730 if (cLISTOPo->op_first->op_type == OP_STUB) {
7732 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
7734 op_getmad(o,newop,'O');
7741 kid = cLISTOPo->op_first;
7742 if (kid->op_type == OP_RV2GV)
7743 kid->op_private |= OPpALLOW_FAKE;
7749 Perl_ck_eval(pTHX_ OP *o)
7753 PERL_ARGS_ASSERT_CK_EVAL;
7755 PL_hints |= HINT_BLOCK_SCOPE;
7756 if (o->op_flags & OPf_KIDS) {
7757 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7760 o->op_flags &= ~OPf_KIDS;
7763 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
7769 cUNOPo->op_first = 0;
7774 NewOp(1101, enter, 1, LOGOP);
7775 enter->op_type = OP_ENTERTRY;
7776 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
7777 enter->op_private = 0;
7779 /* establish postfix order */
7780 enter->op_next = (OP*)enter;
7782 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
7783 o->op_type = OP_LEAVETRY;
7784 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
7785 enter->op_other = o;
7786 op_getmad(oldo,o,'O');
7795 const U8 priv = o->op_private;
7801 o = newUNOP(OP_ENTEREVAL, priv <<8, newDEFSVOP());
7802 op_getmad(oldo,o,'O');
7804 o->op_targ = (PADOFFSET)PL_hints;
7805 if (o->op_private & OPpEVAL_BYTES) o->op_targ &= ~HINT_UTF8;
7806 if ((PL_hints & HINT_LOCALIZE_HH) != 0
7807 && !(o->op_private & OPpEVAL_COPHH) && GvHV(PL_hintgv)) {
7808 /* Store a copy of %^H that pp_entereval can pick up. */
7809 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
7810 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
7811 cUNOPo->op_first->op_sibling = hhop;
7812 o->op_private |= OPpEVAL_HAS_HH;
7814 if (!(o->op_private & OPpEVAL_BYTES)
7815 && FEATURE_UNIEVAL_IS_ENABLED)
7816 o->op_private |= OPpEVAL_UNICODE;
7821 Perl_ck_exit(pTHX_ OP *o)
7823 PERL_ARGS_ASSERT_CK_EXIT;
7826 HV * const table = GvHV(PL_hintgv);
7828 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
7829 if (svp && *svp && SvTRUE(*svp))
7830 o->op_private |= OPpEXIT_VMSISH;
7832 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7838 Perl_ck_exec(pTHX_ OP *o)
7840 PERL_ARGS_ASSERT_CK_EXEC;
7842 if (o->op_flags & OPf_STACKED) {
7845 kid = cUNOPo->op_first->op_sibling;
7846 if (kid->op_type == OP_RV2GV)
7855 Perl_ck_exists(pTHX_ OP *o)
7859 PERL_ARGS_ASSERT_CK_EXISTS;
7862 if (o->op_flags & OPf_KIDS) {
7863 OP * const kid = cUNOPo->op_first;
7864 if (kid->op_type == OP_ENTERSUB) {
7865 (void) ref(kid, o->op_type);
7866 if (kid->op_type != OP_RV2CV
7867 && !(PL_parser && PL_parser->error_count))
7868 Perl_croak(aTHX_ "%s argument is not a subroutine name",
7870 o->op_private |= OPpEXISTS_SUB;
7872 else if (kid->op_type == OP_AELEM)
7873 o->op_flags |= OPf_SPECIAL;
7874 else if (kid->op_type != OP_HELEM)
7875 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
7883 Perl_ck_rvconst(pTHX_ register OP *o)
7886 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7888 PERL_ARGS_ASSERT_CK_RVCONST;
7890 o->op_private |= (PL_hints & HINT_STRICT_REFS);
7891 if (o->op_type == OP_RV2CV)
7892 o->op_private &= ~1;
7894 if (kid->op_type == OP_CONST) {
7897 SV * const kidsv = kid->op_sv;
7899 /* Is it a constant from cv_const_sv()? */
7900 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
7901 SV * const rsv = SvRV(kidsv);
7902 const svtype type = SvTYPE(rsv);
7903 const char *badtype = NULL;
7905 switch (o->op_type) {
7907 if (type > SVt_PVMG)
7908 badtype = "a SCALAR";
7911 if (type != SVt_PVAV)
7912 badtype = "an ARRAY";
7915 if (type != SVt_PVHV)
7919 if (type != SVt_PVCV)
7924 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
7927 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
7928 const char *badthing;
7929 switch (o->op_type) {
7931 badthing = "a SCALAR";
7934 badthing = "an ARRAY";
7937 badthing = "a HASH";
7945 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
7946 SVfARG(kidsv), badthing);
7949 * This is a little tricky. We only want to add the symbol if we
7950 * didn't add it in the lexer. Otherwise we get duplicate strict
7951 * warnings. But if we didn't add it in the lexer, we must at
7952 * least pretend like we wanted to add it even if it existed before,
7953 * or we get possible typo warnings. OPpCONST_ENTERED says
7954 * whether the lexer already added THIS instance of this symbol.
7956 iscv = (o->op_type == OP_RV2CV) * 2;
7958 gv = gv_fetchsv(kidsv,
7959 iscv | !(kid->op_private & OPpCONST_ENTERED),
7962 : o->op_type == OP_RV2SV
7964 : o->op_type == OP_RV2AV
7966 : o->op_type == OP_RV2HV
7969 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
7971 kid->op_type = OP_GV;
7972 SvREFCNT_dec(kid->op_sv);
7974 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
7975 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
7976 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
7978 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
7980 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
7982 kid->op_private = 0;
7983 kid->op_ppaddr = PL_ppaddr[OP_GV];
7984 /* FAKE globs in the symbol table cause weird bugs (#77810) */
7992 Perl_ck_ftst(pTHX_ OP *o)
7995 const I32 type = o->op_type;
7997 PERL_ARGS_ASSERT_CK_FTST;
7999 if (o->op_flags & OPf_REF) {
8002 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
8003 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8004 const OPCODE kidtype = kid->op_type;
8006 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
8007 OP * const newop = newGVOP(type, OPf_REF,
8008 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
8010 op_getmad(o,newop,'O');
8016 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
8017 o->op_private |= OPpFT_ACCESS;
8018 if (PL_check[kidtype] == Perl_ck_ftst
8019 && kidtype != OP_STAT && kidtype != OP_LSTAT) {
8020 o->op_private |= OPpFT_STACKED;
8021 kid->op_private |= OPpFT_STACKING;
8022 if (kidtype == OP_FTTTY && (
8023 !(kid->op_private & OPpFT_STACKED)
8024 || kid->op_private & OPpFT_AFTER_t
8026 o->op_private |= OPpFT_AFTER_t;
8035 if (type == OP_FTTTY)
8036 o = newGVOP(type, OPf_REF, PL_stdingv);
8038 o = newUNOP(type, 0, newDEFSVOP());
8039 op_getmad(oldo,o,'O');
8045 Perl_ck_fun(pTHX_ OP *o)
8048 const int type = o->op_type;
8049 register I32 oa = PL_opargs[type] >> OASHIFT;
8051 PERL_ARGS_ASSERT_CK_FUN;
8053 if (o->op_flags & OPf_STACKED) {
8054 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
8057 return no_fh_allowed(o);
8060 if (o->op_flags & OPf_KIDS) {
8061 OP **tokid = &cLISTOPo->op_first;
8062 register OP *kid = cLISTOPo->op_first;
8065 bool seen_optional = FALSE;
8067 if (kid->op_type == OP_PUSHMARK ||
8068 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
8070 tokid = &kid->op_sibling;
8071 kid = kid->op_sibling;
8073 if (kid && kid->op_type == OP_COREARGS) {
8074 bool optional = FALSE;
8077 if (oa & OA_OPTIONAL) optional = TRUE;
8080 if (optional) o->op_private |= numargs;
8085 if (oa & OA_OPTIONAL || (oa & 7) == OA_LIST) {
8086 if (!kid && !seen_optional && PL_opargs[type] & OA_DEFGV)
8087 *tokid = kid = newDEFSVOP();
8088 seen_optional = TRUE;
8093 sibl = kid->op_sibling;
8095 if (!sibl && kid->op_type == OP_STUB) {
8102 /* list seen where single (scalar) arg expected? */
8103 if (numargs == 1 && !(oa >> 4)
8104 && kid->op_type == OP_LIST && type != OP_SCALAR)
8106 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8119 if ((type == OP_PUSH || type == OP_UNSHIFT)
8120 && !kid->op_sibling)
8121 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
8122 "Useless use of %s with no values",
8125 if (kid->op_type == OP_CONST &&
8126 (kid->op_private & OPpCONST_BARE))
8128 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
8129 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
8130 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8131 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
8132 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8134 op_getmad(kid,newop,'K');
8139 kid->op_sibling = sibl;
8142 else if (kid->op_type == OP_CONST
8143 && ( !SvROK(cSVOPx_sv(kid))
8144 || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV )
8146 bad_type_pv(numargs, "array", PL_op_desc[type], 0, kid);
8147 /* Defer checks to run-time if we have a scalar arg */
8148 if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV)
8149 op_lvalue(kid, type);
8153 if (kid->op_type == OP_CONST &&
8154 (kid->op_private & OPpCONST_BARE))
8156 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
8157 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
8158 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8159 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
8160 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
8162 op_getmad(kid,newop,'K');
8167 kid->op_sibling = sibl;
8170 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
8171 bad_type_pv(numargs, "hash", PL_op_desc[type], 0, kid);
8172 op_lvalue(kid, type);
8176 OP * const newop = newUNOP(OP_NULL, 0, kid);
8177 kid->op_sibling = 0;
8179 newop->op_next = newop;
8181 kid->op_sibling = sibl;
8186 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
8187 if (kid->op_type == OP_CONST &&
8188 (kid->op_private & OPpCONST_BARE))
8190 OP * const newop = newGVOP(OP_GV, 0,
8191 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
8192 if (!(o->op_private & 1) && /* if not unop */
8193 kid == cLISTOPo->op_last)
8194 cLISTOPo->op_last = newop;
8196 op_getmad(kid,newop,'K');
8202 else if (kid->op_type == OP_READLINE) {
8203 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
8204 bad_type_pv(numargs, "HANDLE", OP_DESC(o), 0, kid);
8207 I32 flags = OPf_SPECIAL;
8211 /* is this op a FH constructor? */
8212 if (is_handle_constructor(o,numargs)) {
8213 const char *name = NULL;
8216 bool want_dollar = TRUE;
8219 /* Set a flag to tell rv2gv to vivify
8220 * need to "prove" flag does not mean something
8221 * else already - NI-S 1999/05/07
8224 if (kid->op_type == OP_PADSV) {
8226 = PAD_COMPNAME_SV(kid->op_targ);
8227 name = SvPV_const(namesv, len);
8228 name_utf8 = SvUTF8(namesv);
8230 else if (kid->op_type == OP_RV2SV
8231 && kUNOP->op_first->op_type == OP_GV)
8233 GV * const gv = cGVOPx_gv(kUNOP->op_first);
8235 len = GvNAMELEN(gv);
8236 name_utf8 = GvNAMEUTF8(gv) ? SVf_UTF8 : 0;
8238 else if (kid->op_type == OP_AELEM
8239 || kid->op_type == OP_HELEM)
8242 OP *op = ((BINOP*)kid)->op_first;
8246 const char * const a =
8247 kid->op_type == OP_AELEM ?
8249 if (((op->op_type == OP_RV2AV) ||
8250 (op->op_type == OP_RV2HV)) &&
8251 (firstop = ((UNOP*)op)->op_first) &&
8252 (firstop->op_type == OP_GV)) {
8253 /* packagevar $a[] or $h{} */
8254 GV * const gv = cGVOPx_gv(firstop);
8262 else if (op->op_type == OP_PADAV
8263 || op->op_type == OP_PADHV) {
8264 /* lexicalvar $a[] or $h{} */
8265 const char * const padname =
8266 PAD_COMPNAME_PV(op->op_targ);
8275 name = SvPV_const(tmpstr, len);
8276 name_utf8 = SvUTF8(tmpstr);
8281 name = "__ANONIO__";
8283 want_dollar = FALSE;
8285 op_lvalue(kid, type);
8289 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
8290 namesv = PAD_SVl(targ);
8291 SvUPGRADE(namesv, SVt_PV);
8292 if (want_dollar && *name != '$')
8293 sv_setpvs(namesv, "$");
8294 sv_catpvn(namesv, name, len);
8295 if ( name_utf8 ) SvUTF8_on(namesv);
8298 kid->op_sibling = 0;
8299 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
8300 kid->op_targ = targ;
8301 kid->op_private |= priv;
8303 kid->op_sibling = sibl;
8309 if ((type == OP_UNDEF || type == OP_POS)
8310 && numargs == 1 && !(oa >> 4)
8311 && kid->op_type == OP_LIST)
8312 return too_many_arguments_pv(o,PL_op_desc[type], 0);
8313 op_lvalue(scalar(kid), type);
8317 tokid = &kid->op_sibling;
8318 kid = kid->op_sibling;
8321 if (kid && kid->op_type != OP_STUB)
8322 return too_many_arguments_pv(o,OP_DESC(o), 0);
8323 o->op_private |= numargs;
8325 /* FIXME - should the numargs move as for the PERL_MAD case? */
8326 o->op_private |= numargs;
8328 return too_many_arguments_pv(o,OP_DESC(o), 0);
8332 else if (PL_opargs[type] & OA_DEFGV) {
8334 OP *newop = newUNOP(type, 0, newDEFSVOP());
8335 op_getmad(o,newop,'O');
8338 /* Ordering of these two is important to keep f_map.t passing. */
8340 return newUNOP(type, 0, newDEFSVOP());
8345 while (oa & OA_OPTIONAL)
8347 if (oa && oa != OA_LIST)
8348 return too_few_arguments_pv(o,OP_DESC(o), 0);
8354 Perl_ck_glob(pTHX_ OP *o)
8358 const bool core = o->op_flags & OPf_SPECIAL;
8360 PERL_ARGS_ASSERT_CK_GLOB;
8363 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
8364 op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */
8366 if (core) gv = NULL;
8367 else if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
8368 && GvCVu(gv) && GvIMPORTED_CV(gv)))
8370 GV * const * const gvp =
8371 (GV **)hv_fetchs(PL_globalstash, "glob", FALSE);
8372 gv = gvp ? *gvp : NULL;
8375 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8378 * \ null - const(wildcard)
8383 * \ mark - glob - rv2cv
8384 * | \ gv(CORE::GLOBAL::glob)
8386 * \ null - const(wildcard) - const(ix)
8388 o->op_flags |= OPf_SPECIAL;
8389 o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP);
8390 op_append_elem(OP_GLOB, o,
8391 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
8392 o = newLISTOP(OP_LIST, 0, o, NULL);
8393 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
8394 op_append_elem(OP_LIST, o,
8395 scalar(newUNOP(OP_RV2CV, 0,
8396 newGVOP(OP_GV, 0, gv)))));
8397 o = newUNOP(OP_NULL, 0, o);
8398 o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */
8401 else o->op_flags &= ~OPf_SPECIAL;
8402 #if !defined(PERL_EXTERNAL_GLOB)
8405 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
8406 newSVpvs("File::Glob"), NULL, NULL, NULL);
8409 #endif /* !PERL_EXTERNAL_GLOB */
8410 gv = newGVgen("main");
8412 #ifndef PERL_EXTERNAL_GLOB
8413 sv_setiv(GvSVn(gv),PL_glob_index++);
8415 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
8421 Perl_ck_grep(pTHX_ OP *o)
8426 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
8429 PERL_ARGS_ASSERT_CK_GREP;
8431 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
8432 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
8434 if (o->op_flags & OPf_STACKED) {
8437 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
8438 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
8439 return no_fh_allowed(o);
8440 for (k = kid; k; k = k->op_next) {
8443 NewOp(1101, gwop, 1, LOGOP);
8444 kid->op_next = (OP*)gwop;
8445 o->op_flags &= ~OPf_STACKED;
8447 kid = cLISTOPo->op_first->op_sibling;
8448 if (type == OP_MAPWHILE)
8453 if (PL_parser && PL_parser->error_count)
8455 kid = cLISTOPo->op_first->op_sibling;
8456 if (kid->op_type != OP_NULL)
8457 Perl_croak(aTHX_ "panic: ck_grep, type=%u", (unsigned) kid->op_type);
8458 kid = kUNOP->op_first;
8461 NewOp(1101, gwop, 1, LOGOP);
8462 gwop->op_type = type;
8463 gwop->op_ppaddr = PL_ppaddr[type];
8464 gwop->op_first = listkids(o);
8465 gwop->op_flags |= OPf_KIDS;
8466 gwop->op_other = LINKLIST(kid);
8467 kid->op_next = (OP*)gwop;
8468 offset = pad_findmy_pvs("$_", 0);
8469 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
8470 o->op_private = gwop->op_private = 0;
8471 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
8474 o->op_private = gwop->op_private = OPpGREP_LEX;
8475 gwop->op_targ = o->op_targ = offset;
8478 kid = cLISTOPo->op_first->op_sibling;
8479 if (!kid || !kid->op_sibling)
8480 return too_few_arguments_pv(o,OP_DESC(o), 0);
8481 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
8482 op_lvalue(kid, OP_GREPSTART);
8488 Perl_ck_index(pTHX_ OP *o)
8490 PERL_ARGS_ASSERT_CK_INDEX;
8492 if (o->op_flags & OPf_KIDS) {
8493 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8495 kid = kid->op_sibling; /* get past "big" */
8496 if (kid && kid->op_type == OP_CONST) {
8497 const bool save_taint = PL_tainted;
8498 fbm_compile(((SVOP*)kid)->op_sv, 0);
8499 PL_tainted = save_taint;
8506 Perl_ck_lfun(pTHX_ OP *o)
8508 const OPCODE type = o->op_type;
8510 PERL_ARGS_ASSERT_CK_LFUN;
8512 return modkids(ck_fun(o), type);
8516 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
8518 PERL_ARGS_ASSERT_CK_DEFINED;
8520 if ((o->op_flags & OPf_KIDS)) {
8521 switch (cUNOPo->op_first->op_type) {
8524 case OP_AASSIGN: /* Is this a good idea? */
8525 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8526 "defined(@array) is deprecated");
8527 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8528 "\t(Maybe you should just omit the defined()?)\n");
8532 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8533 "defined(%%hash) is deprecated");
8534 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8535 "\t(Maybe you should just omit the defined()?)\n");
8546 Perl_ck_readline(pTHX_ OP *o)
8548 PERL_ARGS_ASSERT_CK_READLINE;
8550 if (o->op_flags & OPf_KIDS) {
8551 OP *kid = cLISTOPo->op_first;
8552 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
8556 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
8558 op_getmad(o,newop,'O');
8568 Perl_ck_rfun(pTHX_ OP *o)
8570 const OPCODE type = o->op_type;
8572 PERL_ARGS_ASSERT_CK_RFUN;
8574 return refkids(ck_fun(o), type);
8578 Perl_ck_listiob(pTHX_ OP *o)
8582 PERL_ARGS_ASSERT_CK_LISTIOB;
8584 kid = cLISTOPo->op_first;
8587 kid = cLISTOPo->op_first;
8589 if (kid->op_type == OP_PUSHMARK)
8590 kid = kid->op_sibling;
8591 if (kid && o->op_flags & OPf_STACKED)
8592 kid = kid->op_sibling;
8593 else if (kid && !kid->op_sibling) { /* print HANDLE; */
8594 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
8595 o->op_flags |= OPf_STACKED; /* make it a filehandle */
8596 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
8597 cLISTOPo->op_first->op_sibling = kid;
8598 cLISTOPo->op_last = kid;
8599 kid = kid->op_sibling;
8604 op_append_elem(o->op_type, o, newDEFSVOP());
8606 if (o->op_type == OP_PRTF) return modkids(listkids(o), OP_PRTF);
8611 Perl_ck_smartmatch(pTHX_ OP *o)
8614 PERL_ARGS_ASSERT_CK_SMARTMATCH;
8615 if (0 == (o->op_flags & OPf_SPECIAL)) {
8616 OP *first = cBINOPo->op_first;
8617 OP *second = first->op_sibling;
8619 /* Implicitly take a reference to an array or hash */
8620 first->op_sibling = NULL;
8621 first = cBINOPo->op_first = ref_array_or_hash(first);
8622 second = first->op_sibling = ref_array_or_hash(second);
8624 /* Implicitly take a reference to a regular expression */
8625 if (first->op_type == OP_MATCH) {
8626 first->op_type = OP_QR;
8627 first->op_ppaddr = PL_ppaddr[OP_QR];
8629 if (second->op_type == OP_MATCH) {
8630 second->op_type = OP_QR;
8631 second->op_ppaddr = PL_ppaddr[OP_QR];
8640 Perl_ck_sassign(pTHX_ OP *o)
8643 OP * const kid = cLISTOPo->op_first;
8645 PERL_ARGS_ASSERT_CK_SASSIGN;
8647 /* has a disposable target? */
8648 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
8649 && !(kid->op_flags & OPf_STACKED)
8650 /* Cannot steal the second time! */
8651 && !(kid->op_private & OPpTARGET_MY)
8652 /* Keep the full thing for madskills */
8656 OP * const kkid = kid->op_sibling;
8658 /* Can just relocate the target. */
8659 if (kkid && kkid->op_type == OP_PADSV
8660 && !(kkid->op_private & OPpLVAL_INTRO))
8662 kid->op_targ = kkid->op_targ;
8664 /* Now we do not need PADSV and SASSIGN. */
8665 kid->op_sibling = o->op_sibling; /* NULL */
8666 cLISTOPo->op_first = NULL;
8669 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
8673 if (kid->op_sibling) {
8674 OP *kkid = kid->op_sibling;
8675 /* For state variable assignment, kkid is a list op whose op_last
8677 if ((kkid->op_type == OP_PADSV ||
8678 (kkid->op_type == OP_LIST &&
8679 (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV
8682 && (kkid->op_private & OPpLVAL_INTRO)
8683 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
8684 const PADOFFSET target = kkid->op_targ;
8685 OP *const other = newOP(OP_PADSV,
8687 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
8688 OP *const first = newOP(OP_NULL, 0);
8689 OP *const nullop = newCONDOP(0, first, o, other);
8690 OP *const condop = first->op_next;
8691 /* hijacking PADSTALE for uninitialized state variables */
8692 SvPADSTALE_on(PAD_SVl(target));
8694 condop->op_type = OP_ONCE;
8695 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
8696 condop->op_targ = target;
8697 other->op_targ = target;
8699 /* Because we change the type of the op here, we will skip the
8700 assignment binop->op_last = binop->op_first->op_sibling; at the
8701 end of Perl_newBINOP(). So need to do it here. */
8702 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
8711 Perl_ck_match(pTHX_ OP *o)
8715 PERL_ARGS_ASSERT_CK_MATCH;
8717 if (o->op_type != OP_QR && PL_compcv) {
8718 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
8719 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
8720 o->op_targ = offset;
8721 o->op_private |= OPpTARGET_MY;
8724 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
8725 o->op_private |= OPpRUNTIME;
8730 Perl_ck_method(pTHX_ OP *o)
8732 OP * const kid = cUNOPo->op_first;
8734 PERL_ARGS_ASSERT_CK_METHOD;
8736 if (kid->op_type == OP_CONST) {
8737 SV* sv = kSVOP->op_sv;
8738 const char * const method = SvPVX_const(sv);
8739 if (!(strchr(method, ':') || strchr(method, '\''))) {
8741 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
8742 sv = newSVpvn_share(method, SvUTF8(sv) ? -(I32)SvCUR(sv) : (I32)SvCUR(sv), 0);
8745 kSVOP->op_sv = NULL;
8747 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
8749 op_getmad(o,cmop,'O');
8760 Perl_ck_null(pTHX_ OP *o)
8762 PERL_ARGS_ASSERT_CK_NULL;
8763 PERL_UNUSED_CONTEXT;
8768 Perl_ck_open(pTHX_ OP *o)
8771 HV * const table = GvHV(PL_hintgv);
8773 PERL_ARGS_ASSERT_CK_OPEN;
8776 SV **svp = hv_fetchs(table, "open_IN", FALSE);
8779 const char *d = SvPV_const(*svp, len);
8780 const I32 mode = mode_from_discipline(d, len);
8781 if (mode & O_BINARY)
8782 o->op_private |= OPpOPEN_IN_RAW;
8783 else if (mode & O_TEXT)
8784 o->op_private |= OPpOPEN_IN_CRLF;
8787 svp = hv_fetchs(table, "open_OUT", FALSE);
8790 const char *d = SvPV_const(*svp, len);
8791 const I32 mode = mode_from_discipline(d, len);
8792 if (mode & O_BINARY)
8793 o->op_private |= OPpOPEN_OUT_RAW;
8794 else if (mode & O_TEXT)
8795 o->op_private |= OPpOPEN_OUT_CRLF;
8798 if (o->op_type == OP_BACKTICK) {
8799 if (!(o->op_flags & OPf_KIDS)) {
8800 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
8802 op_getmad(o,newop,'O');
8811 /* In case of three-arg dup open remove strictness
8812 * from the last arg if it is a bareword. */
8813 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
8814 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
8818 if ((last->op_type == OP_CONST) && /* The bareword. */
8819 (last->op_private & OPpCONST_BARE) &&
8820 (last->op_private & OPpCONST_STRICT) &&
8821 (oa = first->op_sibling) && /* The fh. */
8822 (oa = oa->op_sibling) && /* The mode. */
8823 (oa->op_type == OP_CONST) &&
8824 SvPOK(((SVOP*)oa)->op_sv) &&
8825 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
8826 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
8827 (last == oa->op_sibling)) /* The bareword. */
8828 last->op_private &= ~OPpCONST_STRICT;
8834 Perl_ck_repeat(pTHX_ OP *o)
8836 PERL_ARGS_ASSERT_CK_REPEAT;
8838 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
8839 o->op_private |= OPpREPEAT_DOLIST;
8840 cBINOPo->op_first = force_list(cBINOPo->op_first);
8848 Perl_ck_require(pTHX_ OP *o)
8853 PERL_ARGS_ASSERT_CK_REQUIRE;
8855 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
8856 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8858 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
8859 SV * const sv = kid->op_sv;
8860 U32 was_readonly = SvREADONLY(sv);
8867 sv_force_normal_flags(sv, 0);
8868 assert(!SvREADONLY(sv));
8878 for (; s < end; s++) {
8879 if (*s == ':' && s[1] == ':') {
8881 Move(s+2, s+1, end - s - 1, char);
8886 sv_catpvs(sv, ".pm");
8887 SvFLAGS(sv) |= was_readonly;
8891 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
8892 /* handle override, if any */
8893 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
8894 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
8895 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
8896 gv = gvp ? *gvp : NULL;
8900 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8902 if (o->op_flags & OPf_KIDS) {
8903 kid = cUNOPo->op_first;
8904 cUNOPo->op_first = NULL;
8912 newop = newUNOP(OP_ENTERSUB, OPf_STACKED,
8913 op_append_elem(OP_LIST, kid,
8914 scalar(newUNOP(OP_RV2CV, 0,
8917 op_getmad(o,newop,'O');
8921 return scalar(ck_fun(o));
8925 Perl_ck_return(pTHX_ OP *o)
8930 PERL_ARGS_ASSERT_CK_RETURN;
8932 kid = cLISTOPo->op_first->op_sibling;
8933 if (CvLVALUE(PL_compcv)) {
8934 for (; kid; kid = kid->op_sibling)
8935 op_lvalue(kid, OP_LEAVESUBLV);
8942 Perl_ck_select(pTHX_ OP *o)
8947 PERL_ARGS_ASSERT_CK_SELECT;
8949 if (o->op_flags & OPf_KIDS) {
8950 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8951 if (kid && kid->op_sibling) {
8952 o->op_type = OP_SSELECT;
8953 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
8955 return fold_constants(op_integerize(op_std_init(o)));
8959 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8960 if (kid && kid->op_type == OP_RV2GV)
8961 kid->op_private &= ~HINT_STRICT_REFS;
8966 Perl_ck_shift(pTHX_ OP *o)
8969 const I32 type = o->op_type;
8971 PERL_ARGS_ASSERT_CK_SHIFT;
8973 if (!(o->op_flags & OPf_KIDS)) {
8976 if (!CvUNIQUE(PL_compcv)) {
8977 o->op_flags |= OPf_SPECIAL;
8981 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
8984 OP * const oldo = o;
8985 o = newUNOP(type, 0, scalar(argop));
8986 op_getmad(oldo,o,'O');
8991 return newUNOP(type, 0, scalar(argop));
8994 return scalar(ck_fun(o));
8998 Perl_ck_sort(pTHX_ OP *o)
9003 PERL_ARGS_ASSERT_CK_SORT;
9005 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
9006 HV * const hinthv = GvHV(PL_hintgv);
9008 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
9010 const I32 sorthints = (I32)SvIV(*svp);
9011 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
9012 o->op_private |= OPpSORT_QSORT;
9013 if ((sorthints & HINT_SORT_STABLE) != 0)
9014 o->op_private |= OPpSORT_STABLE;
9019 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
9021 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9022 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
9024 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
9026 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
9028 if (kid->op_type == OP_SCOPE) {
9032 else if (kid->op_type == OP_LEAVE) {
9033 if (o->op_type == OP_SORT) {
9034 op_null(kid); /* wipe out leave */
9037 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
9038 if (k->op_next == kid)
9040 /* don't descend into loops */
9041 else if (k->op_type == OP_ENTERLOOP
9042 || k->op_type == OP_ENTERITER)
9044 k = cLOOPx(k)->op_lastop;
9049 kid->op_next = 0; /* just disconnect the leave */
9050 k = kLISTOP->op_first;
9055 if (o->op_type == OP_SORT) {
9056 /* provide scalar context for comparison function/block */
9062 o->op_flags |= OPf_SPECIAL;
9065 firstkid = firstkid->op_sibling;
9068 /* provide list context for arguments */
9069 if (o->op_type == OP_SORT)
9076 S_simplify_sort(pTHX_ OP *o)
9079 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
9085 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
9087 if (!(o->op_flags & OPf_STACKED))
9089 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
9090 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
9091 kid = kUNOP->op_first; /* get past null */
9092 if (kid->op_type != OP_SCOPE)
9094 kid = kLISTOP->op_last; /* get past scope */
9095 switch(kid->op_type) {
9103 k = kid; /* remember this node*/
9104 if (kBINOP->op_first->op_type != OP_RV2SV)
9106 kid = kBINOP->op_first; /* get past cmp */
9107 if (kUNOP->op_first->op_type != OP_GV)
9109 kid = kUNOP->op_first; /* get past rv2sv */
9111 if (GvSTASH(gv) != PL_curstash)
9113 gvname = GvNAME(gv);
9114 if (*gvname == 'a' && gvname[1] == '\0')
9116 else if (*gvname == 'b' && gvname[1] == '\0')
9121 kid = k; /* back to cmp */
9122 if (kBINOP->op_last->op_type != OP_RV2SV)
9124 kid = kBINOP->op_last; /* down to 2nd arg */
9125 if (kUNOP->op_first->op_type != OP_GV)
9127 kid = kUNOP->op_first; /* get past rv2sv */
9129 if (GvSTASH(gv) != PL_curstash)
9131 gvname = GvNAME(gv);
9133 ? !(*gvname == 'a' && gvname[1] == '\0')
9134 : !(*gvname == 'b' && gvname[1] == '\0'))
9136 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
9138 o->op_private |= OPpSORT_DESCEND;
9139 if (k->op_type == OP_NCMP)
9140 o->op_private |= OPpSORT_NUMERIC;
9141 if (k->op_type == OP_I_NCMP)
9142 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
9143 kid = cLISTOPo->op_first->op_sibling;
9144 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
9146 op_getmad(kid,o,'S'); /* then delete it */
9148 op_free(kid); /* then delete it */
9153 Perl_ck_split(pTHX_ OP *o)
9158 PERL_ARGS_ASSERT_CK_SPLIT;
9160 if (o->op_flags & OPf_STACKED)
9161 return no_fh_allowed(o);
9163 kid = cLISTOPo->op_first;
9164 if (kid->op_type != OP_NULL)
9165 Perl_croak(aTHX_ "panic: ck_split, type=%u", (unsigned) kid->op_type);
9166 kid = kid->op_sibling;
9167 op_free(cLISTOPo->op_first);
9169 cLISTOPo->op_first = kid;
9171 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
9172 cLISTOPo->op_last = kid; /* There was only one element previously */
9175 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
9176 OP * const sibl = kid->op_sibling;
9177 kid->op_sibling = 0;
9178 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0, 0);
9179 if (cLISTOPo->op_first == cLISTOPo->op_last)
9180 cLISTOPo->op_last = kid;
9181 cLISTOPo->op_first = kid;
9182 kid->op_sibling = sibl;
9185 kid->op_type = OP_PUSHRE;
9186 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
9188 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
9189 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
9190 "Use of /g modifier is meaningless in split");
9193 if (!kid->op_sibling)
9194 op_append_elem(OP_SPLIT, o, newDEFSVOP());
9196 kid = kid->op_sibling;
9199 if (!kid->op_sibling)
9200 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
9201 assert(kid->op_sibling);
9203 kid = kid->op_sibling;
9206 if (kid->op_sibling)
9207 return too_many_arguments_pv(o,OP_DESC(o), 0);
9213 Perl_ck_join(pTHX_ OP *o)
9215 const OP * const kid = cLISTOPo->op_first->op_sibling;
9217 PERL_ARGS_ASSERT_CK_JOIN;
9219 if (kid && kid->op_type == OP_MATCH) {
9220 if (ckWARN(WARN_SYNTAX)) {
9221 const REGEXP *re = PM_GETRE(kPMOP);
9223 ? newSVpvn_flags( RX_PRECOMP_const(re), RX_PRELEN(re),
9224 SVs_TEMP | ( RX_UTF8(re) ? SVf_UTF8 : 0 ) )
9225 : newSVpvs_flags( "STRING", SVs_TEMP );
9226 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9227 "/%"SVf"/ should probably be written as \"%"SVf"\"",
9228 SVfARG(msg), SVfARG(msg));
9235 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
9237 Examines an op, which is expected to identify a subroutine at runtime,
9238 and attempts to determine at compile time which subroutine it identifies.
9239 This is normally used during Perl compilation to determine whether
9240 a prototype can be applied to a function call. I<cvop> is the op
9241 being considered, normally an C<rv2cv> op. A pointer to the identified
9242 subroutine is returned, if it could be determined statically, and a null
9243 pointer is returned if it was not possible to determine statically.
9245 Currently, the subroutine can be identified statically if the RV that the
9246 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
9247 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
9248 suitable if the constant value must be an RV pointing to a CV. Details of
9249 this process may change in future versions of Perl. If the C<rv2cv> op
9250 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
9251 the subroutine statically: this flag is used to suppress compile-time
9252 magic on a subroutine call, forcing it to use default runtime behaviour.
9254 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
9255 of a GV reference is modified. If a GV was examined and its CV slot was
9256 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
9257 If the op is not optimised away, and the CV slot is later populated with
9258 a subroutine having a prototype, that flag eventually triggers the warning
9259 "called too early to check prototype".
9261 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
9262 of returning a pointer to the subroutine it returns a pointer to the
9263 GV giving the most appropriate name for the subroutine in this context.
9264 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
9265 (C<CvANON>) subroutine that is referenced through a GV it will be the
9266 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
9267 A null pointer is returned as usual if there is no statically-determinable
9274 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
9279 PERL_ARGS_ASSERT_RV2CV_OP_CV;
9280 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
9281 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
9282 if (cvop->op_type != OP_RV2CV)
9284 if (cvop->op_private & OPpENTERSUB_AMPER)
9286 if (!(cvop->op_flags & OPf_KIDS))
9288 rvop = cUNOPx(cvop)->op_first;
9289 switch (rvop->op_type) {
9291 gv = cGVOPx_gv(rvop);
9294 if (flags & RV2CVOPCV_MARK_EARLY)
9295 rvop->op_private |= OPpEARLY_CV;
9300 SV *rv = cSVOPx_sv(rvop);
9310 if (SvTYPE((SV*)cv) != SVt_PVCV)
9312 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
9313 if (!CvANON(cv) || !gv)
9322 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
9324 Performs the default fixup of the arguments part of an C<entersub>
9325 op tree. This consists of applying list context to each of the
9326 argument ops. This is the standard treatment used on a call marked
9327 with C<&>, or a method call, or a call through a subroutine reference,
9328 or any other call where the callee can't be identified at compile time,
9329 or a call where the callee has no prototype.
9335 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
9338 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
9339 aop = cUNOPx(entersubop)->op_first;
9340 if (!aop->op_sibling)
9341 aop = cUNOPx(aop)->op_first;
9342 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
9343 if (!(PL_madskills && aop->op_type == OP_STUB)) {
9345 op_lvalue(aop, OP_ENTERSUB);
9352 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
9354 Performs the fixup of the arguments part of an C<entersub> op tree
9355 based on a subroutine prototype. This makes various modifications to
9356 the argument ops, from applying context up to inserting C<refgen> ops,
9357 and checking the number and syntactic types of arguments, as directed by
9358 the prototype. This is the standard treatment used on a subroutine call,
9359 not marked with C<&>, where the callee can be identified at compile time
9360 and has a prototype.
9362 I<protosv> supplies the subroutine prototype to be applied to the call.
9363 It may be a normal defined scalar, of which the string value will be used.
9364 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
9365 that has been cast to C<SV*>) which has a prototype. The prototype
9366 supplied, in whichever form, does not need to match the actual callee
9367 referenced by the op tree.
9369 If the argument ops disagree with the prototype, for example by having
9370 an unacceptable number of arguments, a valid op tree is returned anyway.
9371 The error is reflected in the parser state, normally resulting in a single
9372 exception at the top level of parsing which covers all the compilation
9373 errors that occurred. In the error message, the callee is referred to
9374 by the name defined by the I<namegv> parameter.
9380 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
9383 const char *proto, *proto_end;
9384 OP *aop, *prev, *cvop;
9387 I32 contextclass = 0;
9388 const char *e = NULL;
9389 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
9390 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
9391 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto, "
9392 "flags=%lx", (unsigned long) SvFLAGS(protosv));
9393 if (SvTYPE(protosv) == SVt_PVCV)
9394 proto = CvPROTO(protosv), proto_len = CvPROTOLEN(protosv);
9395 else proto = SvPV(protosv, proto_len);
9396 proto_end = proto + proto_len;
9397 aop = cUNOPx(entersubop)->op_first;
9398 if (!aop->op_sibling)
9399 aop = cUNOPx(aop)->op_first;
9401 aop = aop->op_sibling;
9402 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9403 while (aop != cvop) {
9405 if (PL_madskills && aop->op_type == OP_STUB) {
9406 aop = aop->op_sibling;
9409 if (PL_madskills && aop->op_type == OP_NULL)
9410 o3 = ((UNOP*)aop)->op_first;
9414 if (proto >= proto_end)
9415 return too_many_arguments_sv(entersubop, gv_ename(namegv), 0);
9423 /* _ must be at the end */
9424 if (proto[1] && !strchr(";@%", proto[1]))
9439 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
9441 arg == 1 ? "block or sub {}" : "sub {}",
9442 gv_ename(namegv), 0, o3);
9445 /* '*' allows any scalar type, including bareword */
9448 if (o3->op_type == OP_RV2GV)
9449 goto wrapref; /* autoconvert GLOB -> GLOBref */
9450 else if (o3->op_type == OP_CONST)
9451 o3->op_private &= ~OPpCONST_STRICT;
9452 else if (o3->op_type == OP_ENTERSUB) {
9453 /* accidental subroutine, revert to bareword */
9454 OP *gvop = ((UNOP*)o3)->op_first;
9455 if (gvop && gvop->op_type == OP_NULL) {
9456 gvop = ((UNOP*)gvop)->op_first;
9458 for (; gvop->op_sibling; gvop = gvop->op_sibling)
9461 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
9462 (gvop = ((UNOP*)gvop)->op_first) &&
9463 gvop->op_type == OP_GV)
9465 GV * const gv = cGVOPx_gv(gvop);
9466 OP * const sibling = aop->op_sibling;
9467 SV * const n = newSVpvs("");
9469 OP * const oldaop = aop;
9473 gv_fullname4(n, gv, "", FALSE);
9474 aop = newSVOP(OP_CONST, 0, n);
9475 op_getmad(oldaop,aop,'O');
9476 prev->op_sibling = aop;
9477 aop->op_sibling = sibling;
9487 if (o3->op_type == OP_RV2AV ||
9488 o3->op_type == OP_PADAV ||
9489 o3->op_type == OP_RV2HV ||
9490 o3->op_type == OP_PADHV
9505 if (contextclass++ == 0) {
9506 e = strchr(proto, ']');
9507 if (!e || e == proto)
9516 const char *p = proto;
9517 const char *const end = proto;
9520 /* \[$] accepts any scalar lvalue */
9522 && Perl_op_lvalue_flags(aTHX_
9524 OP_READ, /* not entersub */
9527 bad_type_sv(arg, Perl_form(aTHX_ "one of %.*s",
9529 gv_ename(namegv), 0, o3);
9534 if (o3->op_type == OP_RV2GV)
9537 bad_type_sv(arg, "symbol", gv_ename(namegv), 0, o3);
9540 if (o3->op_type == OP_ENTERSUB)
9543 bad_type_sv(arg, "subroutine entry", gv_ename(namegv), 0,
9547 if (o3->op_type == OP_RV2SV ||
9548 o3->op_type == OP_PADSV ||
9549 o3->op_type == OP_HELEM ||
9550 o3->op_type == OP_AELEM)
9552 if (!contextclass) {
9553 /* \$ accepts any scalar lvalue */
9554 if (Perl_op_lvalue_flags(aTHX_
9556 OP_READ, /* not entersub */
9559 bad_type_sv(arg, "scalar", gv_ename(namegv), 0, o3);
9563 if (o3->op_type == OP_RV2AV ||
9564 o3->op_type == OP_PADAV)
9567 bad_type_sv(arg, "array", gv_ename(namegv), 0, o3);
9570 if (o3->op_type == OP_RV2HV ||
9571 o3->op_type == OP_PADHV)
9574 bad_type_sv(arg, "hash", gv_ename(namegv), 0, o3);
9578 OP* const kid = aop;
9579 OP* const sib = kid->op_sibling;
9580 kid->op_sibling = 0;
9581 aop = newUNOP(OP_REFGEN, 0, kid);
9582 aop->op_sibling = sib;
9583 prev->op_sibling = aop;
9585 if (contextclass && e) {
9600 SV* const tmpsv = sv_newmortal();
9601 gv_efullname3(tmpsv, namegv, NULL);
9602 Perl_croak(aTHX_ "Malformed prototype for %"SVf": %"SVf,
9603 SVfARG(tmpsv), SVfARG(protosv));
9607 op_lvalue(aop, OP_ENTERSUB);
9609 aop = aop->op_sibling;
9611 if (aop == cvop && *proto == '_') {
9612 /* generate an access to $_ */
9614 aop->op_sibling = prev->op_sibling;
9615 prev->op_sibling = aop; /* instead of cvop */
9617 if (!optional && proto_end > proto &&
9618 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
9619 return too_few_arguments_sv(entersubop, gv_ename(namegv), 0);
9624 =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv
9626 Performs the fixup of the arguments part of an C<entersub> op tree either
9627 based on a subroutine prototype or using default list-context processing.
9628 This is the standard treatment used on a subroutine call, not marked
9629 with C<&>, where the callee can be identified at compile time.
9631 I<protosv> supplies the subroutine prototype to be applied to the call,
9632 or indicates that there is no prototype. It may be a normal scalar,
9633 in which case if it is defined then the string value will be used
9634 as a prototype, and if it is undefined then there is no prototype.
9635 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
9636 that has been cast to C<SV*>), of which the prototype will be used if it
9637 has one. The prototype (or lack thereof) supplied, in whichever form,
9638 does not need to match the actual callee referenced by the op tree.
9640 If the argument ops disagree with the prototype, for example by having
9641 an unacceptable number of arguments, a valid op tree is returned anyway.
9642 The error is reflected in the parser state, normally resulting in a single
9643 exception at the top level of parsing which covers all the compilation
9644 errors that occurred. In the error message, the callee is referred to
9645 by the name defined by the I<namegv> parameter.
9651 Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop,
9652 GV *namegv, SV *protosv)
9654 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST;
9655 if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv))
9656 return ck_entersub_args_proto(entersubop, namegv, protosv);
9658 return ck_entersub_args_list(entersubop);
9662 Perl_ck_entersub_args_core(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
9664 int opnum = SvTYPE(protosv) == SVt_PVCV ? 0 : (int)SvUV(protosv);
9665 OP *aop = cUNOPx(entersubop)->op_first;
9667 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_CORE;
9671 if (!aop->op_sibling)
9672 aop = cUNOPx(aop)->op_first;
9673 aop = aop->op_sibling;
9674 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9675 if (PL_madskills) while (aop != cvop && aop->op_type == OP_STUB) {
9676 aop = aop->op_sibling;
9679 (void)too_many_arguments_pv(entersubop, GvNAME(namegv), 0);
9681 op_free(entersubop);
9682 switch(GvNAME(namegv)[2]) {
9683 case 'F': return newSVOP(OP_CONST, 0,
9684 newSVpv(CopFILE(PL_curcop),0));
9685 case 'L': return newSVOP(
9688 "%"IVdf, (IV)CopLINE(PL_curcop)
9691 case 'P': return newSVOP(OP_CONST, 0,
9693 ? newSVhek(HvNAME_HEK(PL_curstash))
9704 bool seenarg = FALSE;
9706 if (!aop->op_sibling)
9707 aop = cUNOPx(aop)->op_first;
9710 aop = aop->op_sibling;
9711 prev->op_sibling = NULL;
9714 prev=cvop, cvop = cvop->op_sibling)
9716 if (PL_madskills && cvop->op_sibling
9717 && cvop->op_type != OP_STUB) seenarg = TRUE
9720 prev->op_sibling = NULL;
9721 flags = OPf_SPECIAL * !(cvop->op_private & OPpENTERSUB_NOPAREN);
9723 if (aop == cvop) aop = NULL;
9724 op_free(entersubop);
9726 if (opnum == OP_ENTEREVAL
9727 && GvNAMELEN(namegv)==9 && strnEQ(GvNAME(namegv), "evalbytes", 9))
9728 flags |= OPpEVAL_BYTES <<8;
9730 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
9732 case OA_BASEOP_OR_UNOP:
9734 return aop ? newUNOP(opnum,flags,aop) : newOP(opnum,flags);
9738 if (!PL_madskills || seenarg)
9740 (void)too_many_arguments_pv(aop, GvNAME(namegv), 0);
9743 return opnum == OP_RUNCV
9744 ? newPVOP(OP_RUNCV,0,NULL)
9747 return convert(opnum,0,aop);
9755 =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p
9757 Retrieves the function that will be used to fix up a call to I<cv>.
9758 Specifically, the function is applied to an C<entersub> op tree for a
9759 subroutine call, not marked with C<&>, where the callee can be identified
9760 at compile time as I<cv>.
9762 The C-level function pointer is returned in I<*ckfun_p>, and an SV
9763 argument for it is returned in I<*ckobj_p>. The function is intended
9764 to be called in this manner:
9766 entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p));
9768 In this call, I<entersubop> is a pointer to the C<entersub> op,
9769 which may be replaced by the check function, and I<namegv> is a GV
9770 supplying the name that should be used by the check function to refer
9771 to the callee of the C<entersub> op if it needs to emit any diagnostics.
9772 It is permitted to apply the check function in non-standard situations,
9773 such as to a call to a different subroutine or to a method call.
9775 By default, the function is
9776 L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>,
9777 and the SV parameter is I<cv> itself. This implements standard
9778 prototype processing. It can be changed, for a particular subroutine,
9779 by L</cv_set_call_checker>.
9785 Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p)
9788 PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER;
9789 callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL;
9791 *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr);
9792 *ckobj_p = callmg->mg_obj;
9794 *ckfun_p = Perl_ck_entersub_args_proto_or_list;
9800 =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj
9802 Sets the function that will be used to fix up a call to I<cv>.
9803 Specifically, the function is applied to an C<entersub> op tree for a
9804 subroutine call, not marked with C<&>, where the callee can be identified
9805 at compile time as I<cv>.
9807 The C-level function pointer is supplied in I<ckfun>, and an SV argument
9808 for it is supplied in I<ckobj>. The function is intended to be called
9811 entersubop = ckfun(aTHX_ entersubop, namegv, ckobj);
9813 In this call, I<entersubop> is a pointer to the C<entersub> op,
9814 which may be replaced by the check function, and I<namegv> is a GV
9815 supplying the name that should be used by the check function to refer
9816 to the callee of the C<entersub> op if it needs to emit any diagnostics.
9817 It is permitted to apply the check function in non-standard situations,
9818 such as to a call to a different subroutine or to a method call.
9820 The current setting for a particular CV can be retrieved by
9821 L</cv_get_call_checker>.
9827 Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj)
9829 PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER;
9830 if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) {
9831 if (SvMAGICAL((SV*)cv))
9832 mg_free_type((SV*)cv, PERL_MAGIC_checkcall);
9835 sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0);
9836 callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall);
9837 if (callmg->mg_flags & MGf_REFCOUNTED) {
9838 SvREFCNT_dec(callmg->mg_obj);
9839 callmg->mg_flags &= ~MGf_REFCOUNTED;
9841 callmg->mg_ptr = FPTR2DPTR(char *, ckfun);
9842 callmg->mg_obj = ckobj;
9843 if (ckobj != (SV*)cv) {
9844 SvREFCNT_inc_simple_void_NN(ckobj);
9845 callmg->mg_flags |= MGf_REFCOUNTED;
9847 callmg->mg_flags |= MGf_COPY;
9852 Perl_ck_subr(pTHX_ OP *o)
9858 PERL_ARGS_ASSERT_CK_SUBR;
9860 aop = cUNOPx(o)->op_first;
9861 if (!aop->op_sibling)
9862 aop = cUNOPx(aop)->op_first;
9863 aop = aop->op_sibling;
9864 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9865 cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY);
9866 namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL;
9868 o->op_private &= ~1;
9869 o->op_private |= OPpENTERSUB_HASTARG;
9870 o->op_private |= (PL_hints & HINT_STRICT_REFS);
9871 if (PERLDB_SUB && PL_curstash != PL_debstash)
9872 o->op_private |= OPpENTERSUB_DB;
9873 if (cvop->op_type == OP_RV2CV) {
9874 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
9876 } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
9877 if (aop->op_type == OP_CONST)
9878 aop->op_private &= ~OPpCONST_STRICT;
9879 else if (aop->op_type == OP_LIST) {
9880 OP * const sib = ((UNOP*)aop)->op_first->op_sibling;
9881 if (sib && sib->op_type == OP_CONST)
9882 sib->op_private &= ~OPpCONST_STRICT;
9887 return ck_entersub_args_list(o);
9889 Perl_call_checker ckfun;
9891 cv_get_call_checker(cv, &ckfun, &ckobj);
9892 return ckfun(aTHX_ o, namegv, ckobj);
9897 Perl_ck_svconst(pTHX_ OP *o)
9899 PERL_ARGS_ASSERT_CK_SVCONST;
9900 PERL_UNUSED_CONTEXT;
9901 SvREADONLY_on(cSVOPo->op_sv);
9906 Perl_ck_chdir(pTHX_ OP *o)
9908 PERL_ARGS_ASSERT_CK_CHDIR;
9909 if (o->op_flags & OPf_KIDS) {
9910 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9912 if (kid && kid->op_type == OP_CONST &&
9913 (kid->op_private & OPpCONST_BARE))
9915 o->op_flags |= OPf_SPECIAL;
9916 kid->op_private &= ~OPpCONST_STRICT;
9923 Perl_ck_trunc(pTHX_ OP *o)
9925 PERL_ARGS_ASSERT_CK_TRUNC;
9927 if (o->op_flags & OPf_KIDS) {
9928 SVOP *kid = (SVOP*)cUNOPo->op_first;
9930 if (kid->op_type == OP_NULL)
9931 kid = (SVOP*)kid->op_sibling;
9932 if (kid && kid->op_type == OP_CONST &&
9933 (kid->op_private & OPpCONST_BARE))
9935 o->op_flags |= OPf_SPECIAL;
9936 kid->op_private &= ~OPpCONST_STRICT;
9943 Perl_ck_substr(pTHX_ OP *o)
9945 PERL_ARGS_ASSERT_CK_SUBSTR;
9948 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
9949 OP *kid = cLISTOPo->op_first;
9951 if (kid->op_type == OP_NULL)
9952 kid = kid->op_sibling;
9954 kid->op_flags |= OPf_MOD;
9961 Perl_ck_tell(pTHX_ OP *o)
9963 PERL_ARGS_ASSERT_CK_TELL;
9965 if (o->op_flags & OPf_KIDS) {
9966 OP *kid = cLISTOPo->op_first;
9967 if (kid->op_type == OP_NULL && kid->op_sibling) kid = kid->op_sibling;
9968 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
9974 Perl_ck_each(pTHX_ OP *o)
9977 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
9978 const unsigned orig_type = o->op_type;
9979 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
9980 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
9981 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
9982 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
9984 PERL_ARGS_ASSERT_CK_EACH;
9987 switch (kid->op_type) {
9993 CHANGE_TYPE(o, array_type);
9996 if (kid->op_private == OPpCONST_BARE
9997 || !SvROK(cSVOPx_sv(kid))
9998 || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV
9999 && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV )
10001 /* we let ck_fun handle it */
10004 CHANGE_TYPE(o, ref_type);
10008 /* if treating as a reference, defer additional checks to runtime */
10009 return o->op_type == ref_type ? o : ck_fun(o);
10013 Perl_ck_length(pTHX_ OP *o)
10015 PERL_ARGS_ASSERT_CK_LENGTH;
10019 if (ckWARN(WARN_SYNTAX)) {
10020 const OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
10024 const bool hash = kid->op_type == OP_PADHV
10025 || kid->op_type == OP_RV2HV;
10026 switch (kid->op_type) {
10030 (GV *)PL_compcv, hash ? '%' : '@', kid->op_targ,
10036 if (cUNOPx(kid)->op_first->op_type != OP_GV) break;
10038 GV *gv = cGVOPx_gv(cUNOPx(kid)->op_first);
10040 name = varname(gv, hash?'%':'@', 0, NULL, 0, 1);
10047 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10048 "length() used on %"SVf" (did you mean \"scalar(%s%"SVf
10050 name, hash ? "keys " : "", name
10053 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10054 "length() used on %%hash (did you mean \"scalar(keys %%hash)\"?)");
10056 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
10057 "length() used on @array (did you mean \"scalar(@array)\"?)");
10064 /* caller is supposed to assign the return to the
10065 container of the rep_op var */
10067 S_opt_scalarhv(pTHX_ OP *rep_op) {
10071 PERL_ARGS_ASSERT_OPT_SCALARHV;
10073 NewOp(1101, unop, 1, UNOP);
10074 unop->op_type = (OPCODE)OP_BOOLKEYS;
10075 unop->op_ppaddr = PL_ppaddr[OP_BOOLKEYS];
10076 unop->op_flags = (U8)(OPf_WANT_SCALAR | OPf_KIDS );
10077 unop->op_private = (U8)(1 | ((OPf_WANT_SCALAR | OPf_KIDS) >> 8));
10078 unop->op_first = rep_op;
10079 unop->op_next = rep_op->op_next;
10080 rep_op->op_next = (OP*)unop;
10081 rep_op->op_flags|=(OPf_REF | OPf_MOD);
10082 unop->op_sibling = rep_op->op_sibling;
10083 rep_op->op_sibling = NULL;
10084 /* unop->op_targ = pad_alloc(OP_BOOLKEYS, SVs_PADTMP); */
10085 if (rep_op->op_type == OP_PADHV) {
10086 rep_op->op_flags &= ~OPf_WANT_SCALAR;
10087 rep_op->op_flags |= OPf_WANT_LIST;
10092 /* Check for in place reverse and sort assignments like "@a = reverse @a"
10093 and modify the optree to make them work inplace */
10096 S_inplace_aassign(pTHX_ OP *o) {
10098 OP *modop, *modop_pushmark;
10100 OP *oleft, *oleft_pushmark;
10102 PERL_ARGS_ASSERT_INPLACE_AASSIGN;
10104 assert((o->op_flags & OPf_WANT) == OPf_WANT_VOID);
10106 assert(cUNOPo->op_first->op_type == OP_NULL);
10107 modop_pushmark = cUNOPx(cUNOPo->op_first)->op_first;
10108 assert(modop_pushmark->op_type == OP_PUSHMARK);
10109 modop = modop_pushmark->op_sibling;
10111 if (modop->op_type != OP_SORT && modop->op_type != OP_REVERSE)
10114 /* no other operation except sort/reverse */
10115 if (modop->op_sibling)
10118 assert(cUNOPx(modop)->op_first->op_type == OP_PUSHMARK);
10119 if (!(oright = cUNOPx(modop)->op_first->op_sibling)) return;
10121 if (modop->op_flags & OPf_STACKED) {
10122 /* skip sort subroutine/block */
10123 assert(oright->op_type == OP_NULL);
10124 oright = oright->op_sibling;
10127 assert(cUNOPo->op_first->op_sibling->op_type == OP_NULL);
10128 oleft_pushmark = cUNOPx(cUNOPo->op_first->op_sibling)->op_first;
10129 assert(oleft_pushmark->op_type == OP_PUSHMARK);
10130 oleft = oleft_pushmark->op_sibling;
10132 /* Check the lhs is an array */
10134 (oleft->op_type != OP_RV2AV && oleft->op_type != OP_PADAV)
10135 || oleft->op_sibling
10136 || (oleft->op_private & OPpLVAL_INTRO)
10140 /* Only one thing on the rhs */
10141 if (oright->op_sibling)
10144 /* check the array is the same on both sides */
10145 if (oleft->op_type == OP_RV2AV) {
10146 if (oright->op_type != OP_RV2AV
10147 || !cUNOPx(oright)->op_first
10148 || cUNOPx(oright)->op_first->op_type != OP_GV
10149 || cUNOPx(oleft )->op_first->op_type != OP_GV
10150 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
10151 cGVOPx_gv(cUNOPx(oright)->op_first)
10155 else if (oright->op_type != OP_PADAV
10156 || oright->op_targ != oleft->op_targ
10160 /* This actually is an inplace assignment */
10162 modop->op_private |= OPpSORT_INPLACE;
10164 /* transfer MODishness etc from LHS arg to RHS arg */
10165 oright->op_flags = oleft->op_flags;
10167 /* remove the aassign op and the lhs */
10169 op_null(oleft_pushmark);
10170 if (oleft->op_type == OP_RV2AV && cUNOPx(oleft)->op_first)
10171 op_null(cUNOPx(oleft)->op_first);
10175 #define MAX_DEFERRED 4
10178 if (defer_ix == (MAX_DEFERRED-1)) { \
10179 CALL_RPEEP(defer_queue[defer_base]); \
10180 defer_base = (defer_base + 1) % MAX_DEFERRED; \
10183 defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o;
10185 /* A peephole optimizer. We visit the ops in the order they're to execute.
10186 * See the comments at the top of this file for more details about when
10187 * peep() is called */
10190 Perl_rpeep(pTHX_ register OP *o)
10193 register OP* oldop = NULL;
10194 OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */
10195 int defer_base = 0;
10198 if (!o || o->op_opt)
10202 SAVEVPTR(PL_curcop);
10203 for (;; o = o->op_next) {
10204 if (o && o->op_opt)
10207 while (defer_ix >= 0)
10208 CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]);
10212 /* By default, this op has now been optimised. A couple of cases below
10213 clear this again. */
10216 switch (o->op_type) {
10218 PL_curcop = ((COP*)o); /* for warnings */
10221 PL_curcop = ((COP*)o); /* for warnings */
10223 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
10224 to carry two labels. For now, take the easier option, and skip
10225 this optimisation if the first NEXTSTATE has a label. */
10226 if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) {
10227 OP *nextop = o->op_next;
10228 while (nextop && nextop->op_type == OP_NULL)
10229 nextop = nextop->op_next;
10231 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
10232 COP *firstcop = (COP *)o;
10233 COP *secondcop = (COP *)nextop;
10234 /* We want the COP pointed to by o (and anything else) to
10235 become the next COP down the line. */
10236 cop_free(firstcop);
10238 firstcop->op_next = secondcop->op_next;
10240 /* Now steal all its pointers, and duplicate the other
10242 firstcop->cop_line = secondcop->cop_line;
10243 #ifdef USE_ITHREADS
10244 firstcop->cop_stashoff = secondcop->cop_stashoff;
10245 firstcop->cop_file = secondcop->cop_file;
10247 firstcop->cop_stash = secondcop->cop_stash;
10248 firstcop->cop_filegv = secondcop->cop_filegv;
10250 firstcop->cop_hints = secondcop->cop_hints;
10251 firstcop->cop_seq = secondcop->cop_seq;
10252 firstcop->cop_warnings = secondcop->cop_warnings;
10253 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
10255 #ifdef USE_ITHREADS
10256 secondcop->cop_stashoff = 0;
10257 secondcop->cop_file = NULL;
10259 secondcop->cop_stash = NULL;
10260 secondcop->cop_filegv = NULL;
10262 secondcop->cop_warnings = NULL;
10263 secondcop->cop_hints_hash = NULL;
10265 /* If we use op_null(), and hence leave an ex-COP, some
10266 warnings are misreported. For example, the compile-time
10267 error in 'use strict; no strict refs;' */
10268 secondcop->op_type = OP_NULL;
10269 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
10275 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
10276 if (o->op_next->op_private & OPpTARGET_MY) {
10277 if (o->op_flags & OPf_STACKED) /* chained concats */
10278 break; /* ignore_optimization */
10280 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
10281 o->op_targ = o->op_next->op_targ;
10282 o->op_next->op_targ = 0;
10283 o->op_private |= OPpTARGET_MY;
10286 op_null(o->op_next);
10290 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
10291 break; /* Scalar stub must produce undef. List stub is noop */
10295 if (o->op_targ == OP_NEXTSTATE
10296 || o->op_targ == OP_DBSTATE)
10298 PL_curcop = ((COP*)o);
10300 /* XXX: We avoid setting op_seq here to prevent later calls
10301 to rpeep() from mistakenly concluding that optimisation
10302 has already occurred. This doesn't fix the real problem,
10303 though (See 20010220.007). AMS 20010719 */
10304 /* op_seq functionality is now replaced by op_opt */
10311 if (oldop && o->op_next) {
10312 oldop->op_next = o->op_next;
10320 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
10321 OP* const pop = (o->op_type == OP_PADAV) ?
10322 o->op_next : o->op_next->op_next;
10324 if (pop && pop->op_type == OP_CONST &&
10325 ((PL_op = pop->op_next)) &&
10326 pop->op_next->op_type == OP_AELEM &&
10327 !(pop->op_next->op_private &
10328 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
10329 (i = SvIV(((SVOP*)pop)->op_sv)) <= 255 && i >= 0)
10332 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
10333 no_bareword_allowed(pop);
10334 if (o->op_type == OP_GV)
10335 op_null(o->op_next);
10336 op_null(pop->op_next);
10338 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
10339 o->op_next = pop->op_next->op_next;
10340 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
10341 o->op_private = (U8)i;
10342 if (o->op_type == OP_GV) {
10345 o->op_type = OP_AELEMFAST;
10348 o->op_type = OP_AELEMFAST_LEX;
10353 if (o->op_next->op_type == OP_RV2SV) {
10354 if (!(o->op_next->op_private & OPpDEREF)) {
10355 op_null(o->op_next);
10356 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
10358 o->op_next = o->op_next->op_next;
10359 o->op_type = OP_GVSV;
10360 o->op_ppaddr = PL_ppaddr[OP_GVSV];
10363 else if (o->op_next->op_type == OP_READLINE
10364 && o->op_next->op_next->op_type == OP_CONCAT
10365 && (o->op_next->op_next->op_flags & OPf_STACKED))
10367 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
10368 o->op_type = OP_RCATLINE;
10369 o->op_flags |= OPf_STACKED;
10370 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
10371 op_null(o->op_next->op_next);
10372 op_null(o->op_next);
10382 fop = cUNOP->op_first;
10390 fop = cLOGOP->op_first;
10391 sop = fop->op_sibling;
10392 while (cLOGOP->op_other->op_type == OP_NULL)
10393 cLOGOP->op_other = cLOGOP->op_other->op_next;
10394 while (o->op_next && ( o->op_type == o->op_next->op_type
10395 || o->op_next->op_type == OP_NULL))
10396 o->op_next = o->op_next->op_next;
10397 DEFER(cLOGOP->op_other);
10401 if ((fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
10403 (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV)
10408 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
10409 while (nop && nop->op_next) {
10410 switch (nop->op_next->op_type) {
10415 lop = nop = nop->op_next;
10418 nop = nop->op_next;
10426 if ((lop->op_flags & OPf_WANT) == OPf_WANT_VOID) {
10427 if (fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
10428 cLOGOP->op_first = opt_scalarhv(fop);
10429 if (sop && (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV))
10430 cLOGOP->op_first->op_sibling = opt_scalarhv(sop);
10446 while (cLOGOP->op_other->op_type == OP_NULL)
10447 cLOGOP->op_other = cLOGOP->op_other->op_next;
10448 DEFER(cLOGOP->op_other);
10453 while (cLOOP->op_redoop->op_type == OP_NULL)
10454 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
10455 while (cLOOP->op_nextop->op_type == OP_NULL)
10456 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
10457 while (cLOOP->op_lastop->op_type == OP_NULL)
10458 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
10459 /* a while(1) loop doesn't have an op_next that escapes the
10460 * loop, so we have to explicitly follow the op_lastop to
10461 * process the rest of the code */
10462 DEFER(cLOOP->op_lastop);
10466 assert(!(cPMOP->op_pmflags & PMf_ONCE));
10467 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
10468 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
10469 cPMOP->op_pmstashstartu.op_pmreplstart
10470 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
10471 DEFER(cPMOP->op_pmstashstartu.op_pmreplstart);
10475 /* check that RHS of sort is a single plain array */
10476 OP *oright = cUNOPo->op_first;
10477 if (!oright || oright->op_type != OP_PUSHMARK)
10480 if (o->op_private & OPpSORT_INPLACE)
10483 /* reverse sort ... can be optimised. */
10484 if (!cUNOPo->op_sibling) {
10485 /* Nothing follows us on the list. */
10486 OP * const reverse = o->op_next;
10488 if (reverse->op_type == OP_REVERSE &&
10489 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
10490 OP * const pushmark = cUNOPx(reverse)->op_first;
10491 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
10492 && (cUNOPx(pushmark)->op_sibling == o)) {
10493 /* reverse -> pushmark -> sort */
10494 o->op_private |= OPpSORT_REVERSE;
10496 pushmark->op_next = oright->op_next;
10506 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
10508 LISTOP *enter, *exlist;
10510 if (o->op_private & OPpSORT_INPLACE)
10513 enter = (LISTOP *) o->op_next;
10516 if (enter->op_type == OP_NULL) {
10517 enter = (LISTOP *) enter->op_next;
10521 /* for $a (...) will have OP_GV then OP_RV2GV here.
10522 for (...) just has an OP_GV. */
10523 if (enter->op_type == OP_GV) {
10524 gvop = (OP *) enter;
10525 enter = (LISTOP *) enter->op_next;
10528 if (enter->op_type == OP_RV2GV) {
10529 enter = (LISTOP *) enter->op_next;
10535 if (enter->op_type != OP_ENTERITER)
10538 iter = enter->op_next;
10539 if (!iter || iter->op_type != OP_ITER)
10542 expushmark = enter->op_first;
10543 if (!expushmark || expushmark->op_type != OP_NULL
10544 || expushmark->op_targ != OP_PUSHMARK)
10547 exlist = (LISTOP *) expushmark->op_sibling;
10548 if (!exlist || exlist->op_type != OP_NULL
10549 || exlist->op_targ != OP_LIST)
10552 if (exlist->op_last != o) {
10553 /* Mmm. Was expecting to point back to this op. */
10556 theirmark = exlist->op_first;
10557 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
10560 if (theirmark->op_sibling != o) {
10561 /* There's something between the mark and the reverse, eg
10562 for (1, reverse (...))
10567 ourmark = ((LISTOP *)o)->op_first;
10568 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
10571 ourlast = ((LISTOP *)o)->op_last;
10572 if (!ourlast || ourlast->op_next != o)
10575 rv2av = ourmark->op_sibling;
10576 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
10577 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
10578 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
10579 /* We're just reversing a single array. */
10580 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
10581 enter->op_flags |= OPf_STACKED;
10584 /* We don't have control over who points to theirmark, so sacrifice
10586 theirmark->op_next = ourmark->op_next;
10587 theirmark->op_flags = ourmark->op_flags;
10588 ourlast->op_next = gvop ? gvop : (OP *) enter;
10591 enter->op_private |= OPpITER_REVERSED;
10592 iter->op_private |= OPpITER_REVERSED;
10599 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
10600 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
10605 if (!(o->op_private & OPpOFFBYONE) && !CvCLONE(PL_compcv)) {
10607 if (CvEVAL(PL_compcv)) sv = &PL_sv_undef;
10609 sv = newRV((SV *)PL_compcv);
10613 o->op_type = OP_CONST;
10614 o->op_ppaddr = PL_ppaddr[OP_CONST];
10615 o->op_flags |= OPf_SPECIAL;
10616 cSVOPo->op_sv = sv;
10621 if (OP_GIMME(o,0) == G_VOID) {
10622 OP *right = cBINOP->op_first;
10624 OP *left = right->op_sibling;
10625 if (left->op_type == OP_SUBSTR
10626 && (left->op_private & 7) < 4) {
10628 cBINOP->op_first = left;
10629 right->op_sibling =
10630 cBINOPx(left)->op_first->op_sibling;
10631 cBINOPx(left)->op_first->op_sibling = right;
10632 left->op_private |= OPpSUBSTR_REPL_FIRST;
10634 (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
10641 Perl_cpeep_t cpeep =
10642 XopENTRY(Perl_custom_op_xop(aTHX_ o), xop_peep);
10644 cpeep(aTHX_ o, oldop);
10655 Perl_peep(pTHX_ register OP *o)
10661 =head1 Custom Operators
10663 =for apidoc Ao||custom_op_xop
10664 Return the XOP structure for a given custom op. This function should be
10665 considered internal to OP_NAME and the other access macros: use them instead.
10671 Perl_custom_op_xop(pTHX_ const OP *o)
10677 static const XOP xop_null = { 0, 0, 0, 0, 0 };
10679 PERL_ARGS_ASSERT_CUSTOM_OP_XOP;
10680 assert(o->op_type == OP_CUSTOM);
10682 /* This is wrong. It assumes a function pointer can be cast to IV,
10683 * which isn't guaranteed, but this is what the old custom OP code
10684 * did. In principle it should be safer to Copy the bytes of the
10685 * pointer into a PV: since the new interface is hidden behind
10686 * functions, this can be changed later if necessary. */
10687 /* Change custom_op_xop if this ever happens */
10688 keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr)));
10691 he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0);
10693 /* assume noone will have just registered a desc */
10694 if (!he && PL_custom_op_names &&
10695 (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0))
10700 /* XXX does all this need to be shared mem? */
10701 Newxz(xop, 1, XOP);
10702 pv = SvPV(HeVAL(he), l);
10703 XopENTRY_set(xop, xop_name, savepvn(pv, l));
10704 if (PL_custom_op_descs &&
10705 (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0))
10707 pv = SvPV(HeVAL(he), l);
10708 XopENTRY_set(xop, xop_desc, savepvn(pv, l));
10710 Perl_custom_op_register(aTHX_ o->op_ppaddr, xop);
10714 if (!he) return &xop_null;
10716 xop = INT2PTR(XOP *, SvIV(HeVAL(he)));
10721 =for apidoc Ao||custom_op_register
10722 Register a custom op. See L<perlguts/"Custom Operators">.
10728 Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop)
10732 PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER;
10734 /* see the comment in custom_op_xop */
10735 keysv = sv_2mortal(newSViv(PTR2IV(ppaddr)));
10737 if (!PL_custom_ops)
10738 PL_custom_ops = newHV();
10740 if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0))
10741 Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name);
10745 =head1 Functions in file op.c
10747 =for apidoc core_prototype
10748 This function assigns the prototype of the named core function to C<sv>, or
10749 to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or
10750 NULL if the core function has no prototype. C<code> is a code as returned
10751 by C<keyword()>. It must not be equal to 0 or -KEY_CORE.
10757 Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code,
10760 int i = 0, n = 0, seen_question = 0, defgv = 0;
10762 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
10763 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
10764 bool nullret = FALSE;
10766 PERL_ARGS_ASSERT_CORE_PROTOTYPE;
10768 assert (code && code != -KEY_CORE);
10770 if (!sv) sv = sv_newmortal();
10772 #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv
10774 switch (code < 0 ? -code : code) {
10775 case KEY_and : case KEY_chop: case KEY_chomp:
10776 case KEY_cmp : case KEY_defined: case KEY_delete: case KEY_exec :
10777 case KEY_exists: case KEY_eq : case KEY_ge : case KEY_goto :
10778 case KEY_grep : case KEY_gt : case KEY_last : case KEY_le :
10779 case KEY_lt : case KEY_map : case KEY_ne : case KEY_next :
10780 case KEY_or : case KEY_print : case KEY_printf: case KEY_qr :
10781 case KEY_redo : case KEY_require: case KEY_return: case KEY_say :
10782 case KEY_select: case KEY_sort : case KEY_split : case KEY_system:
10783 case KEY_x : case KEY_xor :
10784 if (!opnum) return NULL; nullret = TRUE; goto findopnum;
10785 case KEY_glob: retsetpvs("_;", OP_GLOB);
10786 case KEY_keys: retsetpvs("+", OP_KEYS);
10787 case KEY_values: retsetpvs("+", OP_VALUES);
10788 case KEY_each: retsetpvs("+", OP_EACH);
10789 case KEY_push: retsetpvs("+@", OP_PUSH);
10790 case KEY_unshift: retsetpvs("+@", OP_UNSHIFT);
10791 case KEY_pop: retsetpvs(";+", OP_POP);
10792 case KEY_shift: retsetpvs(";+", OP_SHIFT);
10793 case KEY_pos: retsetpvs(";\\[$*]", OP_POS);
10795 retsetpvs("+;$$@", OP_SPLICE);
10796 case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__:
10798 case KEY_evalbytes:
10799 name = "entereval"; break;
10807 while (i < MAXO) { /* The slow way. */
10808 if (strEQ(name, PL_op_name[i])
10809 || strEQ(name, PL_op_desc[i]))
10811 if (nullret) { assert(opnum); *opnum = i; return NULL; }
10818 defgv = PL_opargs[i] & OA_DEFGV;
10819 oa = PL_opargs[i] >> OASHIFT;
10821 if (oa & OA_OPTIONAL && !seen_question && (
10822 !defgv || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF
10827 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
10828 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
10829 /* But globs are already references (kinda) */
10830 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
10834 if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF
10835 && !scalar_mod_type(NULL, i)) {
10840 if (i == OP_LOCK || i == OP_UNDEF) str[n++] = '&';
10844 else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
10845 if (oa & OA_OPTIONAL && defgv && str[n-1] == '$') {
10846 str[n-1] = '_'; defgv = 0;
10850 if (code == -KEY_not || code == -KEY_getprotobynumber) str[n++] = ';';
10852 sv_setpvn(sv, str, n - 1);
10853 if (opnum) *opnum = i;
10858 Perl_coresub_op(pTHX_ SV * const coreargssv, const int code,
10861 OP * const argop = newSVOP(OP_COREARGS,0,coreargssv);
10864 PERL_ARGS_ASSERT_CORESUB_OP;
10868 return op_append_elem(OP_LINESEQ,
10871 newSVOP(OP_CONST, 0, newSViv(-code % 3)),
10875 case OP_SELECT: /* which represents OP_SSELECT as well */
10880 newAVREF(newGVOP(OP_GV, 0, PL_defgv)),
10881 newSVOP(OP_CONST, 0, newSVuv(1))
10883 coresub_op(newSVuv((UV)OP_SSELECT), 0,
10885 coresub_op(coreargssv, 0, OP_SELECT)
10889 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
10891 return op_append_elem(
10894 opnum == OP_WANTARRAY || opnum == OP_RUNCV
10895 ? OPpOFFBYONE << 8 : 0)
10897 case OA_BASEOP_OR_UNOP:
10898 if (opnum == OP_ENTEREVAL) {
10899 o = newUNOP(OP_ENTEREVAL,OPpEVAL_COPHH<<8,argop);
10900 if (code == -KEY_evalbytes) o->op_private |= OPpEVAL_BYTES;
10902 else o = newUNOP(opnum,0,argop);
10903 if (opnum == OP_CALLER) o->op_private |= OPpOFFBYONE;
10906 if (is_handle_constructor(o, 1))
10907 argop->op_private |= OPpCOREARGS_DEREF1;
10908 if (scalar_mod_type(NULL, opnum))
10909 argop->op_private |= OPpCOREARGS_SCALARMOD;
10913 o = convert(opnum,OPf_SPECIAL*(opnum == OP_GLOB),argop);
10914 if (is_handle_constructor(o, 2))
10915 argop->op_private |= OPpCOREARGS_DEREF2;
10916 if (opnum == OP_SUBSTR) {
10917 o->op_private |= OPpMAYBE_LVSUB;
10926 Perl_report_redefined_cv(pTHX_ const SV *name, const CV *old_cv,
10927 SV * const *new_const_svp)
10929 const char *hvname;
10930 bool is_const = !!CvCONST(old_cv);
10931 SV *old_const_sv = is_const ? cv_const_sv(old_cv) : NULL;
10933 PERL_ARGS_ASSERT_REPORT_REDEFINED_CV;
10935 if (is_const && new_const_svp && old_const_sv == *new_const_svp)
10937 /* They are 2 constant subroutines generated from
10938 the same constant. This probably means that
10939 they are really the "same" proxy subroutine
10940 instantiated in 2 places. Most likely this is
10941 when a constant is exported twice. Don't warn.
10944 (ckWARN(WARN_REDEFINE)
10946 CvGV(old_cv) && GvSTASH(CvGV(old_cv))
10947 && HvNAMELEN(GvSTASH(CvGV(old_cv))) == 7
10948 && (hvname = HvNAME(GvSTASH(CvGV(old_cv))),
10949 strEQ(hvname, "autouse"))
10953 && ckWARN_d(WARN_REDEFINE)
10954 && (!new_const_svp || sv_cmp(old_const_sv, *new_const_svp))
10957 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
10959 ? "Constant subroutine %"SVf" redefined"
10960 : "Subroutine %"SVf" redefined",
10965 =head1 Hook manipulation
10967 These functions provide convenient and thread-safe means of manipulating
10974 =for apidoc Am|void|wrap_op_checker|Optype opcode|Perl_check_t new_checker|Perl_check_t *old_checker_p
10976 Puts a C function into the chain of check functions for a specified op
10977 type. This is the preferred way to manipulate the L</PL_check> array.
10978 I<opcode> specifies which type of op is to be affected. I<new_checker>
10979 is a pointer to the C function that is to be added to that opcode's
10980 check chain, and I<old_checker_p> points to the storage location where a
10981 pointer to the next function in the chain will be stored. The value of
10982 I<new_pointer> is written into the L</PL_check> array, while the value
10983 previously stored there is written to I<*old_checker_p>.
10985 L</PL_check> is global to an entire process, and a module wishing to
10986 hook op checking may find itself invoked more than once per process,
10987 typically in different threads. To handle that situation, this function
10988 is idempotent. The location I<*old_checker_p> must initially (once
10989 per process) contain a null pointer. A C variable of static duration
10990 (declared at file scope, typically also marked C<static> to give
10991 it internal linkage) will be implicitly initialised appropriately,
10992 if it does not have an explicit initialiser. This function will only
10993 actually modify the check chain if it finds I<*old_checker_p> to be null.
10994 This function is also thread safe on the small scale. It uses appropriate
10995 locking to avoid race conditions in accessing L</PL_check>.
10997 When this function is called, the function referenced by I<new_checker>
10998 must be ready to be called, except for I<*old_checker_p> being unfilled.
10999 In a threading situation, I<new_checker> may be called immediately,
11000 even before this function has returned. I<*old_checker_p> will always
11001 be appropriately set before I<new_checker> is called. If I<new_checker>
11002 decides not to do anything special with an op that it is given (which
11003 is the usual case for most uses of op check hooking), it must chain the
11004 check function referenced by I<*old_checker_p>.
11006 If you want to influence compilation of calls to a specific subroutine,
11007 then use L</cv_set_call_checker> rather than hooking checking of all
11014 Perl_wrap_op_checker(pTHX_ Optype opcode,
11015 Perl_check_t new_checker, Perl_check_t *old_checker_p)
11019 PERL_ARGS_ASSERT_WRAP_OP_CHECKER;
11020 if (*old_checker_p) return;
11021 OP_CHECK_MUTEX_LOCK;
11022 if (!*old_checker_p) {
11023 *old_checker_p = PL_check[opcode];
11024 PL_check[opcode] = new_checker;
11026 OP_CHECK_MUTEX_UNLOCK;
11031 /* Efficient sub that returns a constant scalar value. */
11033 const_sv_xsub(pTHX_ CV* cv)
11037 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
11041 /* diag_listed_as: SKIPME */
11042 Perl_croak(aTHX_ "usage: %s::%s()",
11043 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
11056 * c-indentation-style: bsd
11057 * c-basic-offset: 4
11058 * indent-tabs-mode: nil
11061 * ex: set ts=8 sts=4 sw=4 et: