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"
106 #define CALL_PEEP(o) PL_peepp(aTHX_ o)
107 #define CALL_RPEEP(o) PL_rpeepp(aTHX_ o)
108 #define CALL_OPFREEHOOK(o) if (PL_opfreehook) PL_opfreehook(aTHX_ o)
110 #if defined(PL_OP_SLAB_ALLOC)
112 #ifdef PERL_DEBUG_READONLY_OPS
113 # define PERL_SLAB_SIZE 4096
114 # include <sys/mman.h>
117 #ifndef PERL_SLAB_SIZE
118 #define PERL_SLAB_SIZE 2048
122 Perl_Slab_Alloc(pTHX_ size_t sz)
126 * To make incrementing use count easy PL_OpSlab is an I32 *
127 * To make inserting the link to slab PL_OpPtr is I32 **
128 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
129 * Add an overhead for pointer to slab and round up as a number of pointers
131 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
132 if ((PL_OpSpace -= sz) < 0) {
133 #ifdef PERL_DEBUG_READONLY_OPS
134 /* We need to allocate chunk by chunk so that we can control the VM
136 PL_OpPtr = (I32**) mmap(0, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE,
137 MAP_ANON|MAP_PRIVATE, -1, 0);
139 DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n",
140 (unsigned long) PERL_SLAB_SIZE*sizeof(I32*),
142 if(PL_OpPtr == MAP_FAILED) {
143 perror("mmap failed");
148 PL_OpPtr = (I32 **) PerlMemShared_calloc(PERL_SLAB_SIZE,sizeof(I32*));
153 /* We reserve the 0'th I32 sized chunk as a use count */
154 PL_OpSlab = (I32 *) PL_OpPtr;
155 /* Reduce size by the use count word, and by the size we need.
156 * Latter is to mimic the '-=' in the if() above
158 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
159 /* Allocation pointer starts at the top.
160 Theory: because we build leaves before trunk allocating at end
161 means that at run time access is cache friendly upward
163 PL_OpPtr += PERL_SLAB_SIZE;
165 #ifdef PERL_DEBUG_READONLY_OPS
166 /* We remember this slab. */
167 /* This implementation isn't efficient, but it is simple. */
168 PL_slabs = (I32**) realloc(PL_slabs, sizeof(I32**) * (PL_slab_count + 1));
169 PL_slabs[PL_slab_count++] = PL_OpSlab;
170 DEBUG_m(PerlIO_printf(Perl_debug_log, "Allocate %p\n", PL_OpSlab));
173 assert( PL_OpSpace >= 0 );
174 /* Move the allocation pointer down */
176 assert( PL_OpPtr > (I32 **) PL_OpSlab );
177 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
178 (*PL_OpSlab)++; /* Increment use count of slab */
179 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
180 assert( *PL_OpSlab > 0 );
181 return (void *)(PL_OpPtr + 1);
184 #ifdef PERL_DEBUG_READONLY_OPS
186 Perl_pending_Slabs_to_ro(pTHX) {
187 /* Turn all the allocated op slabs read only. */
188 U32 count = PL_slab_count;
189 I32 **const slabs = PL_slabs;
191 /* Reset the array of pending OP slabs, as we're about to turn this lot
192 read only. Also, do it ahead of the loop in case the warn triggers,
193 and a warn handler has an eval */
198 /* Force a new slab for any further allocation. */
202 void *const start = slabs[count];
203 const size_t size = PERL_SLAB_SIZE* sizeof(I32*);
204 if(mprotect(start, size, PROT_READ)) {
205 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d",
206 start, (unsigned long) size, errno);
214 S_Slab_to_rw(pTHX_ void *op)
216 I32 * const * const ptr = (I32 **) op;
217 I32 * const slab = ptr[-1];
219 PERL_ARGS_ASSERT_SLAB_TO_RW;
221 assert( ptr-1 > (I32 **) slab );
222 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
224 if(mprotect(slab, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE)) {
225 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d",
226 slab, (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), errno);
231 Perl_op_refcnt_inc(pTHX_ OP *o)
242 Perl_op_refcnt_dec(pTHX_ OP *o)
244 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
249 # define Slab_to_rw(op)
253 Perl_Slab_Free(pTHX_ void *op)
255 I32 * const * const ptr = (I32 **) op;
256 I32 * const slab = ptr[-1];
257 PERL_ARGS_ASSERT_SLAB_FREE;
258 assert( ptr-1 > (I32 **) slab );
259 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
262 if (--(*slab) == 0) {
264 # define PerlMemShared PerlMem
267 #ifdef PERL_DEBUG_READONLY_OPS
268 U32 count = PL_slab_count;
269 /* Need to remove this slab from our list of slabs */
272 if (PL_slabs[count] == slab) {
274 /* Found it. Move the entry at the end to overwrite it. */
275 DEBUG_m(PerlIO_printf(Perl_debug_log,
276 "Deallocate %p by moving %p from %lu to %lu\n",
278 PL_slabs[PL_slab_count - 1],
279 PL_slab_count, count));
280 PL_slabs[count] = PL_slabs[--PL_slab_count];
281 /* Could realloc smaller at this point, but probably not
283 if(munmap(slab, PERL_SLAB_SIZE*sizeof(I32*))) {
284 perror("munmap failed");
292 PerlMemShared_free(slab);
294 if (slab == PL_OpSlab) {
301 * In the following definition, the ", (OP*)0" is just to make the compiler
302 * think the expression is of the right type: croak actually does a Siglongjmp.
304 #define CHECKOP(type,o) \
305 ((PL_op_mask && PL_op_mask[type]) \
306 ? ( op_free((OP*)o), \
307 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
309 : PL_check[type](aTHX_ (OP*)o))
311 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
313 #define CHANGE_TYPE(o,type) \
315 o->op_type = (OPCODE)type; \
316 o->op_ppaddr = PL_ppaddr[type]; \
320 S_gv_ename(pTHX_ GV *gv)
322 SV* const tmpsv = sv_newmortal();
324 PERL_ARGS_ASSERT_GV_ENAME;
326 gv_efullname3(tmpsv, gv, NULL);
327 return SvPV_nolen_const(tmpsv);
331 S_no_fh_allowed(pTHX_ OP *o)
333 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
335 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
341 S_too_few_arguments(pTHX_ OP *o, const char *name)
343 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS;
345 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
350 S_too_many_arguments(pTHX_ OP *o, const char *name)
352 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS;
354 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
359 S_bad_type(pTHX_ I32 n, const char *t, const char *name, const OP *kid)
361 PERL_ARGS_ASSERT_BAD_TYPE;
363 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
364 (int)n, name, t, OP_DESC(kid)));
368 S_no_bareword_allowed(pTHX_ const OP *o)
370 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
373 return; /* various ok barewords are hidden in extra OP_NULL */
374 qerror(Perl_mess(aTHX_
375 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
379 /* "register" allocation */
382 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
386 const bool is_our = (PL_parser->in_my == KEY_our);
388 PERL_ARGS_ASSERT_ALLOCMY;
391 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
394 /* Until we're using the length for real, cross check that we're being
396 assert(strlen(name) == len);
398 /* complain about "my $<special_var>" etc etc */
402 (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) ||
403 (name[1] == '_' && (*name == '$' || len > 2))))
405 /* name[2] is true if strlen(name) > 2 */
406 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
407 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
408 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
409 PL_parser->in_my == KEY_state ? "state" : "my"));
411 yyerror(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
412 PL_parser->in_my == KEY_state ? "state" : "my"));
416 /* allocate a spare slot and store the name in that slot */
418 off = pad_add_name(name, len,
419 is_our ? padadd_OUR :
420 PL_parser->in_my == KEY_state ? padadd_STATE : 0,
421 PL_parser->in_my_stash,
423 /* $_ is always in main::, even with our */
424 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
428 /* anon sub prototypes contains state vars should always be cloned,
429 * otherwise the state var would be shared between anon subs */
431 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
432 CvCLONE_on(PL_compcv);
437 /* free the body of an op without examining its contents.
438 * Always use this rather than FreeOp directly */
441 S_op_destroy(pTHX_ OP *o)
443 if (o->op_latefree) {
451 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b)
453 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a)
459 Perl_op_free(pTHX_ OP *o)
466 if (o->op_latefreed) {
473 if (o->op_private & OPpREFCOUNTED) {
484 refcnt = OpREFCNT_dec(o);
487 /* Need to find and remove any pattern match ops from the list
488 we maintain for reset(). */
489 find_and_forget_pmops(o);
499 /* Call the op_free hook if it has been set. Do it now so that it's called
500 * at the right time for refcounted ops, but still before all of the kids
504 if (o->op_flags & OPf_KIDS) {
505 register OP *kid, *nextkid;
506 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
507 nextkid = kid->op_sibling; /* Get before next freeing kid */
512 #ifdef PERL_DEBUG_READONLY_OPS
516 /* COP* is not cleared by op_clear() so that we may track line
517 * numbers etc even after null() */
518 if (type == OP_NEXTSTATE || type == OP_DBSTATE
519 || (type == OP_NULL /* the COP might have been null'ed */
520 && ((OPCODE)o->op_targ == OP_NEXTSTATE
521 || (OPCODE)o->op_targ == OP_DBSTATE))) {
526 type = (OPCODE)o->op_targ;
529 if (o->op_latefree) {
535 #ifdef DEBUG_LEAKING_SCALARS
542 Perl_op_clear(pTHX_ OP *o)
547 PERL_ARGS_ASSERT_OP_CLEAR;
550 /* if (o->op_madprop && o->op_madprop->mad_next)
552 /* FIXME for MAD - if I uncomment these two lines t/op/pack.t fails with
553 "modification of a read only value" for a reason I can't fathom why.
554 It's the "" stringification of $_, where $_ was set to '' in a foreach
555 loop, but it defies simplification into a small test case.
556 However, commenting them out has caused ext/List/Util/t/weak.t to fail
559 mad_free(o->op_madprop);
565 switch (o->op_type) {
566 case OP_NULL: /* Was holding old type, if any. */
567 if (PL_madskills && o->op_targ != OP_NULL) {
568 o->op_type = (Optype)o->op_targ;
573 case OP_ENTEREVAL: /* Was holding hints. */
577 if (!(o->op_flags & OPf_REF)
578 || (PL_check[o->op_type] != Perl_ck_ftst))
584 if (! (o->op_type == OP_AELEMFAST && o->op_flags & OPf_SPECIAL)) {
585 /* not an OP_PADAV replacement */
586 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
591 /* It's possible during global destruction that the GV is freed
592 before the optree. Whilst the SvREFCNT_inc is happy to bump from
593 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0
594 will trigger an assertion failure, because the entry to sv_clear
595 checks that the scalar is not already freed. A check of for
596 !SvIS_FREED(gv) turns out to be invalid, because during global
597 destruction the reference count can be forced down to zero
598 (with SVf_BREAK set). In which case raising to 1 and then
599 dropping to 0 triggers cleanup before it should happen. I
600 *think* that this might actually be a general, systematic,
601 weakness of the whole idea of SVf_BREAK, in that code *is*
602 allowed to raise and lower references during global destruction,
603 so any *valid* code that happens to do this during global
604 destruction might well trigger premature cleanup. */
605 bool still_valid = gv && SvREFCNT(gv);
608 SvREFCNT_inc_simple_void(gv);
610 if (cPADOPo->op_padix > 0) {
611 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
612 * may still exist on the pad */
613 pad_swipe(cPADOPo->op_padix, TRUE);
614 cPADOPo->op_padix = 0;
617 SvREFCNT_dec(cSVOPo->op_sv);
618 cSVOPo->op_sv = NULL;
621 int try_downgrade = SvREFCNT(gv) == 2;
624 gv_try_downgrade(gv);
628 case OP_METHOD_NAMED:
631 SvREFCNT_dec(cSVOPo->op_sv);
632 cSVOPo->op_sv = NULL;
635 Even if op_clear does a pad_free for the target of the op,
636 pad_free doesn't actually remove the sv that exists in the pad;
637 instead it lives on. This results in that it could be reused as
638 a target later on when the pad was reallocated.
641 pad_swipe(o->op_targ,1);
650 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
654 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
656 if (cPADOPo->op_padix > 0) {
657 pad_swipe(cPADOPo->op_padix, TRUE);
658 cPADOPo->op_padix = 0;
661 SvREFCNT_dec(cSVOPo->op_sv);
662 cSVOPo->op_sv = NULL;
666 PerlMemShared_free(cPVOPo->op_pv);
667 cPVOPo->op_pv = NULL;
671 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
675 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
676 /* No GvIN_PAD_off here, because other references may still
677 * exist on the pad */
678 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
681 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
687 forget_pmop(cPMOPo, 1);
688 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
689 /* we use the same protection as the "SAFE" version of the PM_ macros
690 * here since sv_clean_all might release some PMOPs
691 * after PL_regex_padav has been cleared
692 * and the clearing of PL_regex_padav needs to
693 * happen before sv_clean_all
696 if(PL_regex_pad) { /* We could be in destruction */
697 const IV offset = (cPMOPo)->op_pmoffset;
698 ReREFCNT_dec(PM_GETRE(cPMOPo));
699 PL_regex_pad[offset] = &PL_sv_undef;
700 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
704 ReREFCNT_dec(PM_GETRE(cPMOPo));
705 PM_SETRE(cPMOPo, NULL);
711 if (o->op_targ > 0) {
712 pad_free(o->op_targ);
718 S_cop_free(pTHX_ COP* cop)
720 PERL_ARGS_ASSERT_COP_FREE;
724 if (! specialWARN(cop->cop_warnings))
725 PerlMemShared_free(cop->cop_warnings);
726 cophh_free(CopHINTHASH_get(cop));
730 S_forget_pmop(pTHX_ PMOP *const o
736 HV * const pmstash = PmopSTASH(o);
738 PERL_ARGS_ASSERT_FORGET_PMOP;
740 if (pmstash && !SvIS_FREED(pmstash)) {
741 MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab);
743 PMOP **const array = (PMOP**) mg->mg_ptr;
744 U32 count = mg->mg_len / sizeof(PMOP**);
749 /* Found it. Move the entry at the end to overwrite it. */
750 array[i] = array[--count];
751 mg->mg_len = count * sizeof(PMOP**);
752 /* Could realloc smaller at this point always, but probably
753 not worth it. Probably worth free()ing if we're the
756 Safefree(mg->mg_ptr);
773 S_find_and_forget_pmops(pTHX_ OP *o)
775 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
777 if (o->op_flags & OPf_KIDS) {
778 OP *kid = cUNOPo->op_first;
780 switch (kid->op_type) {
785 forget_pmop((PMOP*)kid, 0);
787 find_and_forget_pmops(kid);
788 kid = kid->op_sibling;
794 Perl_op_null(pTHX_ OP *o)
798 PERL_ARGS_ASSERT_OP_NULL;
800 if (o->op_type == OP_NULL)
804 o->op_targ = o->op_type;
805 o->op_type = OP_NULL;
806 o->op_ppaddr = PL_ppaddr[OP_NULL];
810 Perl_op_refcnt_lock(pTHX)
818 Perl_op_refcnt_unlock(pTHX)
825 /* Contextualizers */
828 =for apidoc Am|OP *|op_contextualize|OP *o|I32 context
830 Applies a syntactic context to an op tree representing an expression.
831 I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>,
832 or C<G_VOID> to specify the context to apply. The modified op tree
839 Perl_op_contextualize(pTHX_ OP *o, I32 context)
841 PERL_ARGS_ASSERT_OP_CONTEXTUALIZE;
843 case G_SCALAR: return scalar(o);
844 case G_ARRAY: return list(o);
845 case G_VOID: return scalarvoid(o);
847 Perl_croak(aTHX_ "panic: op_contextualize bad context");
853 =head1 Optree Manipulation Functions
855 =for apidoc Am|OP*|op_linklist|OP *o
856 This function is the implementation of the L</LINKLIST> macro. It should
857 not be called directly.
863 Perl_op_linklist(pTHX_ OP *o)
867 PERL_ARGS_ASSERT_OP_LINKLIST;
872 /* establish postfix order */
873 first = cUNOPo->op_first;
876 o->op_next = LINKLIST(first);
879 if (kid->op_sibling) {
880 kid->op_next = LINKLIST(kid->op_sibling);
881 kid = kid->op_sibling;
895 S_scalarkids(pTHX_ OP *o)
897 if (o && o->op_flags & OPf_KIDS) {
899 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
906 S_scalarboolean(pTHX_ OP *o)
910 PERL_ARGS_ASSERT_SCALARBOOLEAN;
912 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
913 if (ckWARN(WARN_SYNTAX)) {
914 const line_t oldline = CopLINE(PL_curcop);
916 if (PL_parser && PL_parser->copline != NOLINE)
917 CopLINE_set(PL_curcop, PL_parser->copline);
918 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
919 CopLINE_set(PL_curcop, oldline);
926 Perl_scalar(pTHX_ OP *o)
931 /* assumes no premature commitment */
932 if (!o || (PL_parser && PL_parser->error_count)
933 || (o->op_flags & OPf_WANT)
934 || o->op_type == OP_RETURN)
939 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
941 switch (o->op_type) {
943 scalar(cBINOPo->op_first);
948 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
958 if (o->op_flags & OPf_KIDS) {
959 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
965 kid = cLISTOPo->op_first;
967 kid = kid->op_sibling;
970 OP *sib = kid->op_sibling;
971 if (sib && kid->op_type != OP_LEAVEWHEN) {
972 if (sib->op_type == OP_BREAK && sib->op_flags & OPf_SPECIAL) {
982 PL_curcop = &PL_compiling;
987 kid = cLISTOPo->op_first;
990 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
997 Perl_scalarvoid(pTHX_ OP *o)
1001 const char* useless = NULL;
1005 PERL_ARGS_ASSERT_SCALARVOID;
1007 /* trailing mad null ops don't count as "there" for void processing */
1009 o->op_type != OP_NULL &&
1011 o->op_sibling->op_type == OP_NULL)
1014 for (sib = o->op_sibling;
1015 sib && sib->op_type == OP_NULL;
1016 sib = sib->op_sibling) ;
1022 if (o->op_type == OP_NEXTSTATE
1023 || o->op_type == OP_DBSTATE
1024 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1025 || o->op_targ == OP_DBSTATE)))
1026 PL_curcop = (COP*)o; /* for warning below */
1028 /* assumes no premature commitment */
1029 want = o->op_flags & OPf_WANT;
1030 if ((want && want != OPf_WANT_SCALAR)
1031 || (PL_parser && PL_parser->error_count)
1032 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN)
1037 if ((o->op_private & OPpTARGET_MY)
1038 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1040 return scalar(o); /* As if inside SASSIGN */
1043 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1045 switch (o->op_type) {
1047 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1051 if (o->op_flags & OPf_STACKED)
1055 if (o->op_private == 4)
1098 case OP_GETSOCKNAME:
1099 case OP_GETPEERNAME:
1104 case OP_GETPRIORITY:
1128 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1129 /* Otherwise it's "Useless use of grep iterator" */
1130 useless = OP_DESC(o);
1134 kid = cLISTOPo->op_first;
1135 if (kid && kid->op_type == OP_PUSHRE
1137 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1139 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1141 useless = OP_DESC(o);
1145 kid = cUNOPo->op_first;
1146 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1147 kid->op_type != OP_TRANS) {
1150 useless = "negative pattern binding (!~)";
1154 if (cPMOPo->op_pmflags & PMf_NONDESTRUCT)
1155 useless = "Non-destructive substitution (s///r)";
1162 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1163 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1164 useless = "a variable";
1169 if (cSVOPo->op_private & OPpCONST_STRICT)
1170 no_bareword_allowed(o);
1172 if (ckWARN(WARN_VOID)) {
1174 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1175 "a constant (%"SVf")", sv));
1176 useless = SvPV_nolen(msv);
1179 useless = "a constant (undef)";
1180 if (o->op_private & OPpCONST_ARYBASE)
1182 /* don't warn on optimised away booleans, eg
1183 * use constant Foo, 5; Foo || print; */
1184 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1186 /* the constants 0 and 1 are permitted as they are
1187 conventionally used as dummies in constructs like
1188 1 while some_condition_with_side_effects; */
1189 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1191 else if (SvPOK(sv)) {
1192 /* perl4's way of mixing documentation and code
1193 (before the invention of POD) was based on a
1194 trick to mix nroff and perl code. The trick was
1195 built upon these three nroff macros being used in
1196 void context. The pink camel has the details in
1197 the script wrapman near page 319. */
1198 const char * const maybe_macro = SvPVX_const(sv);
1199 if (strnEQ(maybe_macro, "di", 2) ||
1200 strnEQ(maybe_macro, "ds", 2) ||
1201 strnEQ(maybe_macro, "ig", 2))
1206 op_null(o); /* don't execute or even remember it */
1210 o->op_type = OP_PREINC; /* pre-increment is faster */
1211 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1215 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1216 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1220 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1221 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1225 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1226 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1231 kid = cLOGOPo->op_first;
1232 if (kid->op_type == OP_NOT
1233 && (kid->op_flags & OPf_KIDS)
1235 if (o->op_type == OP_AND) {
1237 o->op_ppaddr = PL_ppaddr[OP_OR];
1239 o->op_type = OP_AND;
1240 o->op_ppaddr = PL_ppaddr[OP_AND];
1249 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1254 if (o->op_flags & OPf_STACKED)
1261 if (!(o->op_flags & OPf_KIDS))
1272 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1282 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
1287 S_listkids(pTHX_ OP *o)
1289 if (o && o->op_flags & OPf_KIDS) {
1291 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1298 Perl_list(pTHX_ OP *o)
1303 /* assumes no premature commitment */
1304 if (!o || (o->op_flags & OPf_WANT)
1305 || (PL_parser && PL_parser->error_count)
1306 || o->op_type == OP_RETURN)
1311 if ((o->op_private & OPpTARGET_MY)
1312 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1314 return o; /* As if inside SASSIGN */
1317 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1319 switch (o->op_type) {
1322 list(cBINOPo->op_first);
1327 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1335 if (!(o->op_flags & OPf_KIDS))
1337 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1338 list(cBINOPo->op_first);
1339 return gen_constant_list(o);
1346 kid = cLISTOPo->op_first;
1348 kid = kid->op_sibling;
1351 OP *sib = kid->op_sibling;
1352 if (sib && kid->op_type != OP_LEAVEWHEN) {
1353 if (sib->op_type == OP_BREAK && sib->op_flags & OPf_SPECIAL) {
1363 PL_curcop = &PL_compiling;
1367 kid = cLISTOPo->op_first;
1374 S_scalarseq(pTHX_ OP *o)
1378 const OPCODE type = o->op_type;
1380 if (type == OP_LINESEQ || type == OP_SCOPE ||
1381 type == OP_LEAVE || type == OP_LEAVETRY)
1384 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1385 if (kid->op_sibling) {
1389 PL_curcop = &PL_compiling;
1391 o->op_flags &= ~OPf_PARENS;
1392 if (PL_hints & HINT_BLOCK_SCOPE)
1393 o->op_flags |= OPf_PARENS;
1396 o = newOP(OP_STUB, 0);
1401 S_modkids(pTHX_ OP *o, I32 type)
1403 if (o && o->op_flags & OPf_KIDS) {
1405 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1406 op_lvalue(kid, type);
1412 =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
1414 Propagate lvalue ("modifiable") context to an op and its children.
1415 I<type> represents the context type, roughly based on the type of op that
1416 would do the modifying, although C<local()> is represented by OP_NULL,
1417 because it has no op type of its own (it is signalled by a flag on
1418 the lvalue op). This function detects things that can't be modified,
1419 such as C<$x+1>, and generates errors for them. It also flags things
1420 that need to behave specially in an lvalue context, such as C<$$x>
1421 which might have to vivify a reference in C<$x>.
1427 Perl_op_lvalue(pTHX_ OP *o, I32 type)
1431 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1434 if (!o || (PL_parser && PL_parser->error_count))
1437 if ((o->op_private & OPpTARGET_MY)
1438 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1443 switch (o->op_type) {
1449 if (!(o->op_private & OPpCONST_ARYBASE))
1452 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1453 CopARYBASE_set(&PL_compiling,
1454 (I32)SvIV(cSVOPx(PL_eval_start)->op_sv));
1458 SAVECOPARYBASE(&PL_compiling);
1459 CopARYBASE_set(&PL_compiling, 0);
1461 else if (type == OP_REFGEN)
1464 Perl_croak(aTHX_ "That use of $[ is unsupported");
1467 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1471 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1472 !(o->op_flags & OPf_STACKED)) {
1473 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1474 /* The default is to set op_private to the number of children,
1475 which for a UNOP such as RV2CV is always 1. And w're using
1476 the bit for a flag in RV2CV, so we need it clear. */
1477 o->op_private &= ~1;
1478 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1479 assert(cUNOPo->op_first->op_type == OP_NULL);
1480 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1483 else if (o->op_private & OPpENTERSUB_NOMOD)
1485 else { /* lvalue subroutine call */
1486 o->op_private |= OPpLVAL_INTRO;
1487 PL_modcount = RETURN_UNLIMITED_NUMBER;
1488 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1489 /* Backward compatibility mode: */
1490 o->op_private |= OPpENTERSUB_INARGS;
1493 else { /* Compile-time error message: */
1494 OP *kid = cUNOPo->op_first;
1498 if (kid->op_type != OP_PUSHMARK) {
1499 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1501 "panic: unexpected lvalue entersub "
1502 "args: type/targ %ld:%"UVuf,
1503 (long)kid->op_type, (UV)kid->op_targ);
1504 kid = kLISTOP->op_first;
1506 while (kid->op_sibling)
1507 kid = kid->op_sibling;
1508 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1510 if (kid->op_type == OP_METHOD_NAMED
1511 || kid->op_type == OP_METHOD)
1515 NewOp(1101, newop, 1, UNOP);
1516 newop->op_type = OP_RV2CV;
1517 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1518 newop->op_first = NULL;
1519 newop->op_next = (OP*)newop;
1520 kid->op_sibling = (OP*)newop;
1521 newop->op_private |= OPpLVAL_INTRO;
1522 newop->op_private &= ~1;
1526 if (kid->op_type != OP_RV2CV)
1528 "panic: unexpected lvalue entersub "
1529 "entry via type/targ %ld:%"UVuf,
1530 (long)kid->op_type, (UV)kid->op_targ);
1531 kid->op_private |= OPpLVAL_INTRO;
1532 break; /* Postpone until runtime */
1536 kid = kUNOP->op_first;
1537 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1538 kid = kUNOP->op_first;
1539 if (kid->op_type == OP_NULL)
1541 "Unexpected constant lvalue entersub "
1542 "entry via type/targ %ld:%"UVuf,
1543 (long)kid->op_type, (UV)kid->op_targ);
1544 if (kid->op_type != OP_GV) {
1545 /* Restore RV2CV to check lvalueness */
1547 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1548 okid->op_next = kid->op_next;
1549 kid->op_next = okid;
1552 okid->op_next = NULL;
1553 okid->op_type = OP_RV2CV;
1555 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1556 okid->op_private |= OPpLVAL_INTRO;
1557 okid->op_private &= ~1;
1561 cv = GvCV(kGVOP_gv);
1571 /* grep, foreach, subcalls, refgen */
1572 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1574 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1575 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1577 : (o->op_type == OP_ENTERSUB
1578 ? "non-lvalue subroutine call"
1580 type ? PL_op_desc[type] : "local"));
1594 case OP_RIGHT_SHIFT:
1603 if (!(o->op_flags & OPf_STACKED))
1610 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1611 op_lvalue(kid, type);
1616 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1617 PL_modcount = RETURN_UNLIMITED_NUMBER;
1618 return o; /* Treat \(@foo) like ordinary list. */
1622 if (scalar_mod_type(o, type))
1624 ref(cUNOPo->op_first, o->op_type);
1628 if (type == OP_LEAVESUBLV)
1629 o->op_private |= OPpMAYBE_LVSUB;
1635 PL_modcount = RETURN_UNLIMITED_NUMBER;
1638 PL_hints |= HINT_BLOCK_SCOPE;
1639 if (type == OP_LEAVESUBLV)
1640 o->op_private |= OPpMAYBE_LVSUB;
1644 ref(cUNOPo->op_first, o->op_type);
1648 PL_hints |= HINT_BLOCK_SCOPE;
1663 PL_modcount = RETURN_UNLIMITED_NUMBER;
1664 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1665 return o; /* Treat \(@foo) like ordinary list. */
1666 if (scalar_mod_type(o, type))
1668 if (type == OP_LEAVESUBLV)
1669 o->op_private |= OPpMAYBE_LVSUB;
1673 if (!type) /* local() */
1674 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1675 PAD_COMPNAME_PV(o->op_targ));
1683 if (type != OP_SASSIGN)
1687 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1692 if (type == OP_LEAVESUBLV)
1693 o->op_private |= OPpMAYBE_LVSUB;
1695 pad_free(o->op_targ);
1696 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1697 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1698 if (o->op_flags & OPf_KIDS)
1699 op_lvalue(cBINOPo->op_first->op_sibling, type);
1704 ref(cBINOPo->op_first, o->op_type);
1705 if (type == OP_ENTERSUB &&
1706 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1707 o->op_private |= OPpLVAL_DEFER;
1708 if (type == OP_LEAVESUBLV)
1709 o->op_private |= OPpMAYBE_LVSUB;
1719 if (o->op_flags & OPf_KIDS)
1720 op_lvalue(cLISTOPo->op_last, type);
1725 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1727 else if (!(o->op_flags & OPf_KIDS))
1729 if (o->op_targ != OP_LIST) {
1730 op_lvalue(cBINOPo->op_first, type);
1736 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1737 op_lvalue(kid, type);
1741 if (type != OP_LEAVESUBLV)
1743 break; /* op_lvalue()ing was handled by ck_return() */
1746 /* [20011101.069] File test operators interpret OPf_REF to mean that
1747 their argument is a filehandle; thus \stat(".") should not set
1749 if (type == OP_REFGEN &&
1750 PL_check[o->op_type] == Perl_ck_ftst)
1753 if (type != OP_LEAVESUBLV)
1754 o->op_flags |= OPf_MOD;
1756 if (type == OP_AASSIGN || type == OP_SASSIGN)
1757 o->op_flags |= OPf_SPECIAL|OPf_REF;
1758 else if (!type) { /* local() */
1761 o->op_private |= OPpLVAL_INTRO;
1762 o->op_flags &= ~OPf_SPECIAL;
1763 PL_hints |= HINT_BLOCK_SCOPE;
1768 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
1769 "Useless localization of %s", OP_DESC(o));
1772 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1773 && type != OP_LEAVESUBLV)
1774 o->op_flags |= OPf_REF;
1779 S_scalar_mod_type(const OP *o, I32 type)
1781 PERL_ARGS_ASSERT_SCALAR_MOD_TYPE;
1785 if (o->op_type == OP_RV2GV)
1809 case OP_RIGHT_SHIFT:
1829 S_is_handle_constructor(const OP *o, I32 numargs)
1831 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
1833 switch (o->op_type) {
1841 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1854 S_refkids(pTHX_ OP *o, I32 type)
1856 if (o && o->op_flags & OPf_KIDS) {
1858 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1865 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
1870 PERL_ARGS_ASSERT_DOREF;
1872 if (!o || (PL_parser && PL_parser->error_count))
1875 switch (o->op_type) {
1877 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1878 !(o->op_flags & OPf_STACKED)) {
1879 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1880 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1881 assert(cUNOPo->op_first->op_type == OP_NULL);
1882 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1883 o->op_flags |= OPf_SPECIAL;
1884 o->op_private &= ~1;
1889 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1890 doref(kid, type, set_op_ref);
1893 if (type == OP_DEFINED)
1894 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1895 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1898 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1899 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1900 : type == OP_RV2HV ? OPpDEREF_HV
1902 o->op_flags |= OPf_MOD;
1909 o->op_flags |= OPf_REF;
1912 if (type == OP_DEFINED)
1913 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1914 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1920 o->op_flags |= OPf_REF;
1925 if (!(o->op_flags & OPf_KIDS))
1927 doref(cBINOPo->op_first, type, set_op_ref);
1931 doref(cBINOPo->op_first, o->op_type, set_op_ref);
1932 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1933 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1934 : type == OP_RV2HV ? OPpDEREF_HV
1936 o->op_flags |= OPf_MOD;
1946 if (!(o->op_flags & OPf_KIDS))
1948 doref(cLISTOPo->op_last, type, set_op_ref);
1958 S_dup_attrlist(pTHX_ OP *o)
1963 PERL_ARGS_ASSERT_DUP_ATTRLIST;
1965 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1966 * where the first kid is OP_PUSHMARK and the remaining ones
1967 * are OP_CONST. We need to push the OP_CONST values.
1969 if (o->op_type == OP_CONST)
1970 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
1972 else if (o->op_type == OP_NULL)
1976 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1978 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1979 if (o->op_type == OP_CONST)
1980 rop = op_append_elem(OP_LIST, rop,
1981 newSVOP(OP_CONST, o->op_flags,
1982 SvREFCNT_inc_NN(cSVOPo->op_sv)));
1989 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
1994 PERL_ARGS_ASSERT_APPLY_ATTRS;
1996 /* fake up C<use attributes $pkg,$rv,@attrs> */
1997 ENTER; /* need to protect against side-effects of 'use' */
1998 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2000 #define ATTRSMODULE "attributes"
2001 #define ATTRSMODULE_PM "attributes.pm"
2004 /* Don't force the C<use> if we don't need it. */
2005 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
2006 if (svp && *svp != &PL_sv_undef)
2007 NOOP; /* already in %INC */
2009 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
2010 newSVpvs(ATTRSMODULE), NULL);
2013 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2014 newSVpvs(ATTRSMODULE),
2016 op_prepend_elem(OP_LIST,
2017 newSVOP(OP_CONST, 0, stashsv),
2018 op_prepend_elem(OP_LIST,
2019 newSVOP(OP_CONST, 0,
2021 dup_attrlist(attrs))));
2027 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2030 OP *pack, *imop, *arg;
2033 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2038 assert(target->op_type == OP_PADSV ||
2039 target->op_type == OP_PADHV ||
2040 target->op_type == OP_PADAV);
2042 /* Ensure that attributes.pm is loaded. */
2043 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
2045 /* Need package name for method call. */
2046 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
2048 /* Build up the real arg-list. */
2049 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2051 arg = newOP(OP_PADSV, 0);
2052 arg->op_targ = target->op_targ;
2053 arg = op_prepend_elem(OP_LIST,
2054 newSVOP(OP_CONST, 0, stashsv),
2055 op_prepend_elem(OP_LIST,
2056 newUNOP(OP_REFGEN, 0,
2057 op_lvalue(arg, OP_REFGEN)),
2058 dup_attrlist(attrs)));
2060 /* Fake up a method call to import */
2061 meth = newSVpvs_share("import");
2062 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2063 op_append_elem(OP_LIST,
2064 op_prepend_elem(OP_LIST, pack, list(arg)),
2065 newSVOP(OP_METHOD_NAMED, 0, meth)));
2066 imop->op_private |= OPpENTERSUB_NOMOD;
2068 /* Combine the ops. */
2069 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
2073 =notfor apidoc apply_attrs_string
2075 Attempts to apply a list of attributes specified by the C<attrstr> and
2076 C<len> arguments to the subroutine identified by the C<cv> argument which
2077 is expected to be associated with the package identified by the C<stashpv>
2078 argument (see L<attributes>). It gets this wrong, though, in that it
2079 does not correctly identify the boundaries of the individual attribute
2080 specifications within C<attrstr>. This is not really intended for the
2081 public API, but has to be listed here for systems such as AIX which
2082 need an explicit export list for symbols. (It's called from XS code
2083 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2084 to respect attribute syntax properly would be welcome.
2090 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2091 const char *attrstr, STRLEN len)
2095 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2098 len = strlen(attrstr);
2102 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2104 const char * const sstr = attrstr;
2105 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2106 attrs = op_append_elem(OP_LIST, attrs,
2107 newSVOP(OP_CONST, 0,
2108 newSVpvn(sstr, attrstr-sstr)));
2112 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2113 newSVpvs(ATTRSMODULE),
2114 NULL, op_prepend_elem(OP_LIST,
2115 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2116 op_prepend_elem(OP_LIST,
2117 newSVOP(OP_CONST, 0,
2118 newRV(MUTABLE_SV(cv))),
2123 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2128 PERL_ARGS_ASSERT_MY_KID;
2130 if (!o || (PL_parser && PL_parser->error_count))
2134 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2135 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2139 if (type == OP_LIST) {
2141 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2142 my_kid(kid, attrs, imopsp);
2143 } else if (type == OP_UNDEF
2149 } else if (type == OP_RV2SV || /* "our" declaration */
2151 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2152 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2153 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2155 PL_parser->in_my == KEY_our
2157 : PL_parser->in_my == KEY_state ? "state" : "my"));
2159 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2160 PL_parser->in_my = FALSE;
2161 PL_parser->in_my_stash = NULL;
2162 apply_attrs(GvSTASH(gv),
2163 (type == OP_RV2SV ? GvSV(gv) :
2164 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2165 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2168 o->op_private |= OPpOUR_INTRO;
2171 else if (type != OP_PADSV &&
2174 type != OP_PUSHMARK)
2176 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2178 PL_parser->in_my == KEY_our
2180 : PL_parser->in_my == KEY_state ? "state" : "my"));
2183 else if (attrs && type != OP_PUSHMARK) {
2186 PL_parser->in_my = FALSE;
2187 PL_parser->in_my_stash = NULL;
2189 /* check for C<my Dog $spot> when deciding package */
2190 stash = PAD_COMPNAME_TYPE(o->op_targ);
2192 stash = PL_curstash;
2193 apply_attrs_my(stash, o, attrs, imopsp);
2195 o->op_flags |= OPf_MOD;
2196 o->op_private |= OPpLVAL_INTRO;
2197 if (PL_parser->in_my == KEY_state)
2198 o->op_private |= OPpPAD_STATE;
2203 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2207 int maybe_scalar = 0;
2209 PERL_ARGS_ASSERT_MY_ATTRS;
2211 /* [perl #17376]: this appears to be premature, and results in code such as
2212 C< our(%x); > executing in list mode rather than void mode */
2214 if (o->op_flags & OPf_PARENS)
2224 o = my_kid(o, attrs, &rops);
2226 if (maybe_scalar && o->op_type == OP_PADSV) {
2227 o = scalar(op_append_list(OP_LIST, rops, o));
2228 o->op_private |= OPpLVAL_INTRO;
2231 o = op_append_list(OP_LIST, o, rops);
2233 PL_parser->in_my = FALSE;
2234 PL_parser->in_my_stash = NULL;
2239 Perl_sawparens(pTHX_ OP *o)
2241 PERL_UNUSED_CONTEXT;
2243 o->op_flags |= OPf_PARENS;
2248 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2252 const OPCODE ltype = left->op_type;
2253 const OPCODE rtype = right->op_type;
2255 PERL_ARGS_ASSERT_BIND_MATCH;
2257 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2258 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2260 const char * const desc
2261 = PL_op_desc[(rtype == OP_SUBST || rtype == OP_TRANS)
2262 ? (int)rtype : OP_MATCH];
2263 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
2264 ? "@array" : "%hash");
2265 Perl_warner(aTHX_ packWARN(WARN_MISC),
2266 "Applying %s to %s will act on scalar(%s)",
2267 desc, sample, sample);
2270 if (rtype == OP_CONST &&
2271 cSVOPx(right)->op_private & OPpCONST_BARE &&
2272 cSVOPx(right)->op_private & OPpCONST_STRICT)
2274 no_bareword_allowed(right);
2277 /* !~ doesn't make sense with s///r, so error on it for now */
2278 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2280 yyerror("Using !~ with s///r doesn't make sense");
2282 ismatchop = (rtype == OP_MATCH ||
2283 rtype == OP_SUBST ||
2285 && !(right->op_flags & OPf_SPECIAL);
2286 if (ismatchop && right->op_private & OPpTARGET_MY) {
2288 right->op_private &= ~OPpTARGET_MY;
2290 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2293 right->op_flags |= OPf_STACKED;
2294 if (rtype != OP_MATCH &&
2295 ! (rtype == OP_TRANS &&
2296 right->op_private & OPpTRANS_IDENTICAL) &&
2297 ! (rtype == OP_SUBST &&
2298 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
2299 newleft = op_lvalue(left, rtype);
2302 if (right->op_type == OP_TRANS)
2303 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2305 o = op_prepend_elem(rtype, scalar(newleft), right);
2307 return newUNOP(OP_NOT, 0, scalar(o));
2311 return bind_match(type, left,
2312 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
2316 Perl_invert(pTHX_ OP *o)
2320 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2324 =for apidoc Amx|OP *|op_scope|OP *o
2326 Wraps up an op tree with some additional ops so that at runtime a dynamic
2327 scope will be created. The original ops run in the new dynamic scope,
2328 and then, provided that they exit normally, the scope will be unwound.
2329 The additional ops used to create and unwind the dynamic scope will
2330 normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2331 instead if the ops are simple enough to not need the full dynamic scope
2338 Perl_op_scope(pTHX_ OP *o)
2342 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2343 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2344 o->op_type = OP_LEAVE;
2345 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2347 else if (o->op_type == OP_LINESEQ) {
2349 o->op_type = OP_SCOPE;
2350 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2351 kid = ((LISTOP*)o)->op_first;
2352 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2355 /* The following deals with things like 'do {1 for 1}' */
2356 kid = kid->op_sibling;
2358 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2363 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2369 Perl_block_start(pTHX_ int full)
2372 const int retval = PL_savestack_ix;
2374 pad_block_start(full);
2376 PL_hints &= ~HINT_BLOCK_SCOPE;
2377 SAVECOMPILEWARNINGS();
2378 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2380 CALL_BLOCK_HOOKS(bhk_start, full);
2386 Perl_block_end(pTHX_ I32 floor, OP *seq)
2389 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2390 OP* retval = scalarseq(seq);
2392 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
2395 CopHINTS_set(&PL_compiling, PL_hints);
2397 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2400 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
2406 =head1 Compile-time scope hooks
2408 =for apidoc Ao||blockhook_register
2410 Register a set of hooks to be called when the Perl lexical scope changes
2411 at compile time. See L<perlguts/"Compile-time scope hooks">.
2417 Perl_blockhook_register(pTHX_ BHK *hk)
2419 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2421 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2428 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
2429 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2430 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2433 OP * const o = newOP(OP_PADSV, 0);
2434 o->op_targ = offset;
2440 Perl_newPROG(pTHX_ OP *o)
2444 PERL_ARGS_ASSERT_NEWPROG;
2449 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2450 ((PL_in_eval & EVAL_KEEPERR)
2451 ? OPf_SPECIAL : 0), o);
2452 /* don't use LINKLIST, since PL_eval_root might indirect through
2453 * a rather expensive function call and LINKLIST evaluates its
2454 * argument more than once */
2455 PL_eval_start = op_linklist(PL_eval_root);
2456 PL_eval_root->op_private |= OPpREFCOUNTED;
2457 OpREFCNT_set(PL_eval_root, 1);
2458 PL_eval_root->op_next = 0;
2459 CALL_PEEP(PL_eval_start);
2462 if (o->op_type == OP_STUB) {
2463 PL_comppad_name = 0;
2465 S_op_destroy(aTHX_ o);
2468 PL_main_root = op_scope(sawparens(scalarvoid(o)));
2469 PL_curcop = &PL_compiling;
2470 PL_main_start = LINKLIST(PL_main_root);
2471 PL_main_root->op_private |= OPpREFCOUNTED;
2472 OpREFCNT_set(PL_main_root, 1);
2473 PL_main_root->op_next = 0;
2474 CALL_PEEP(PL_main_start);
2477 /* Register with debugger */
2479 CV * const cv = get_cvs("DB::postponed", 0);
2483 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
2485 call_sv(MUTABLE_SV(cv), G_DISCARD);
2492 Perl_localize(pTHX_ OP *o, I32 lex)
2496 PERL_ARGS_ASSERT_LOCALIZE;
2498 if (o->op_flags & OPf_PARENS)
2499 /* [perl #17376]: this appears to be premature, and results in code such as
2500 C< our(%x); > executing in list mode rather than void mode */
2507 if ( PL_parser->bufptr > PL_parser->oldbufptr
2508 && PL_parser->bufptr[-1] == ','
2509 && ckWARN(WARN_PARENTHESIS))
2511 char *s = PL_parser->bufptr;
2514 /* some heuristics to detect a potential error */
2515 while (*s && (strchr(", \t\n", *s)))
2519 if (*s && strchr("@$%*", *s) && *++s
2520 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2523 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2525 while (*s && (strchr(", \t\n", *s)))
2531 if (sigil && (*s == ';' || *s == '=')) {
2532 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2533 "Parentheses missing around \"%s\" list",
2535 ? (PL_parser->in_my == KEY_our
2537 : PL_parser->in_my == KEY_state
2547 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
2548 PL_parser->in_my = FALSE;
2549 PL_parser->in_my_stash = NULL;
2554 Perl_jmaybe(pTHX_ OP *o)
2556 PERL_ARGS_ASSERT_JMAYBE;
2558 if (o->op_type == OP_LIST) {
2560 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2561 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
2567 S_fold_constants(pTHX_ register OP *o)
2570 register OP * VOL curop;
2572 VOL I32 type = o->op_type;
2577 SV * const oldwarnhook = PL_warnhook;
2578 SV * const olddiehook = PL_diehook;
2582 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2584 if (PL_opargs[type] & OA_RETSCALAR)
2586 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2587 o->op_targ = pad_alloc(type, SVs_PADTMP);
2589 /* integerize op, unless it happens to be C<-foo>.
2590 * XXX should pp_i_negate() do magic string negation instead? */
2591 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2592 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2593 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2595 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2598 if (!(PL_opargs[type] & OA_FOLDCONST))
2603 /* XXX might want a ck_negate() for this */
2604 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2616 /* XXX what about the numeric ops? */
2617 if (PL_hints & HINT_LOCALE)
2622 if (PL_parser && PL_parser->error_count)
2623 goto nope; /* Don't try to run w/ errors */
2625 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2626 const OPCODE type = curop->op_type;
2627 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2629 type != OP_SCALAR &&
2631 type != OP_PUSHMARK)
2637 curop = LINKLIST(o);
2638 old_next = o->op_next;
2642 oldscope = PL_scopestack_ix;
2643 create_eval_scope(G_FAKINGEVAL);
2645 /* Verify that we don't need to save it: */
2646 assert(PL_curcop == &PL_compiling);
2647 StructCopy(&PL_compiling, ¬_compiling, COP);
2648 PL_curcop = ¬_compiling;
2649 /* The above ensures that we run with all the correct hints of the
2650 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
2651 assert(IN_PERL_RUNTIME);
2652 PL_warnhook = PERL_WARNHOOK_FATAL;
2659 sv = *(PL_stack_sp--);
2660 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2661 pad_swipe(o->op_targ, FALSE);
2662 else if (SvTEMP(sv)) { /* grab mortal temp? */
2663 SvREFCNT_inc_simple_void(sv);
2668 /* Something tried to die. Abandon constant folding. */
2669 /* Pretend the error never happened. */
2671 o->op_next = old_next;
2675 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
2676 PL_warnhook = oldwarnhook;
2677 PL_diehook = olddiehook;
2678 /* XXX note that this croak may fail as we've already blown away
2679 * the stack - eg any nested evals */
2680 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
2683 PL_warnhook = oldwarnhook;
2684 PL_diehook = olddiehook;
2685 PL_curcop = &PL_compiling;
2687 if (PL_scopestack_ix > oldscope)
2688 delete_eval_scope();
2697 if (type == OP_RV2GV)
2698 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
2700 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
2701 op_getmad(o,newop,'f');
2709 S_gen_constant_list(pTHX_ register OP *o)
2713 const I32 oldtmps_floor = PL_tmps_floor;
2716 if (PL_parser && PL_parser->error_count)
2717 return o; /* Don't attempt to run with errors */
2719 PL_op = curop = LINKLIST(o);
2725 assert (!(curop->op_flags & OPf_SPECIAL));
2726 assert(curop->op_type == OP_RANGE);
2728 PL_tmps_floor = oldtmps_floor;
2730 o->op_type = OP_RV2AV;
2731 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2732 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2733 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
2734 o->op_opt = 0; /* needs to be revisited in rpeep() */
2735 curop = ((UNOP*)o)->op_first;
2736 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
2738 op_getmad(curop,o,'O');
2747 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2750 if (!o || o->op_type != OP_LIST)
2751 o = newLISTOP(OP_LIST, 0, o, NULL);
2753 o->op_flags &= ~OPf_WANT;
2755 if (!(PL_opargs[type] & OA_MARK))
2756 op_null(cLISTOPo->op_first);
2758 o->op_type = (OPCODE)type;
2759 o->op_ppaddr = PL_ppaddr[type];
2760 o->op_flags |= flags;
2762 o = CHECKOP(type, o);
2763 if (o->op_type != (unsigned)type)
2766 return fold_constants(o);
2770 =head1 Optree Manipulation Functions
2773 /* List constructors */
2776 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
2778 Append an item to the list of ops contained directly within a list-type
2779 op, returning the lengthened list. I<first> is the list-type op,
2780 and I<last> is the op to append to the list. I<optype> specifies the
2781 intended opcode for the list. If I<first> is not already a list of the
2782 right type, it will be upgraded into one. If either I<first> or I<last>
2783 is null, the other is returned unchanged.
2789 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
2797 if (first->op_type != (unsigned)type
2798 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2800 return newLISTOP(type, 0, first, last);
2803 if (first->op_flags & OPf_KIDS)
2804 ((LISTOP*)first)->op_last->op_sibling = last;
2806 first->op_flags |= OPf_KIDS;
2807 ((LISTOP*)first)->op_first = last;
2809 ((LISTOP*)first)->op_last = last;
2814 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
2816 Concatenate the lists of ops contained directly within two list-type ops,
2817 returning the combined list. I<first> and I<last> are the list-type ops
2818 to concatenate. I<optype> specifies the intended opcode for the list.
2819 If either I<first> or I<last> is not already a list of the right type,
2820 it will be upgraded into one. If either I<first> or I<last> is null,
2821 the other is returned unchanged.
2827 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
2835 if (first->op_type != (unsigned)type)
2836 return op_prepend_elem(type, first, last);
2838 if (last->op_type != (unsigned)type)
2839 return op_append_elem(type, first, last);
2841 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
2842 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
2843 first->op_flags |= (last->op_flags & OPf_KIDS);
2846 if (((LISTOP*)last)->op_first && first->op_madprop) {
2847 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
2849 while (mp->mad_next)
2851 mp->mad_next = first->op_madprop;
2854 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
2857 first->op_madprop = last->op_madprop;
2858 last->op_madprop = 0;
2861 S_op_destroy(aTHX_ last);
2867 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
2869 Prepend an item to the list of ops contained directly within a list-type
2870 op, returning the lengthened list. I<first> is the op to prepend to the
2871 list, and I<last> is the list-type op. I<optype> specifies the intended
2872 opcode for the list. If I<last> is not already a list of the right type,
2873 it will be upgraded into one. If either I<first> or I<last> is null,
2874 the other is returned unchanged.
2880 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2888 if (last->op_type == (unsigned)type) {
2889 if (type == OP_LIST) { /* already a PUSHMARK there */
2890 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2891 ((LISTOP*)last)->op_first->op_sibling = first;
2892 if (!(first->op_flags & OPf_PARENS))
2893 last->op_flags &= ~OPf_PARENS;
2896 if (!(last->op_flags & OPf_KIDS)) {
2897 ((LISTOP*)last)->op_last = first;
2898 last->op_flags |= OPf_KIDS;
2900 first->op_sibling = ((LISTOP*)last)->op_first;
2901 ((LISTOP*)last)->op_first = first;
2903 last->op_flags |= OPf_KIDS;
2907 return newLISTOP(type, 0, first, last);
2915 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
2918 Newxz(tk, 1, TOKEN);
2919 tk->tk_type = (OPCODE)optype;
2920 tk->tk_type = 12345;
2922 tk->tk_mad = madprop;
2927 Perl_token_free(pTHX_ TOKEN* tk)
2929 PERL_ARGS_ASSERT_TOKEN_FREE;
2931 if (tk->tk_type != 12345)
2933 mad_free(tk->tk_mad);
2938 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
2943 PERL_ARGS_ASSERT_TOKEN_GETMAD;
2945 if (tk->tk_type != 12345) {
2946 Perl_warner(aTHX_ packWARN(WARN_MISC),
2947 "Invalid TOKEN object ignored");
2954 /* faked up qw list? */
2956 tm->mad_type == MAD_SV &&
2957 SvPVX((SV *)tm->mad_val)[0] == 'q')
2964 /* pretend constant fold didn't happen? */
2965 if (mp->mad_key == 'f' &&
2966 (o->op_type == OP_CONST ||
2967 o->op_type == OP_GV) )
2969 token_getmad(tk,(OP*)mp->mad_val,slot);
2983 if (mp->mad_key == 'X')
2984 mp->mad_key = slot; /* just change the first one */
2994 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3003 /* pretend constant fold didn't happen? */
3004 if (mp->mad_key == 'f' &&
3005 (o->op_type == OP_CONST ||
3006 o->op_type == OP_GV) )
3008 op_getmad(from,(OP*)mp->mad_val,slot);
3015 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3018 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3024 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3033 /* pretend constant fold didn't happen? */
3034 if (mp->mad_key == 'f' &&
3035 (o->op_type == OP_CONST ||
3036 o->op_type == OP_GV) )
3038 op_getmad(from,(OP*)mp->mad_val,slot);
3045 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3048 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3052 PerlIO_printf(PerlIO_stderr(),
3053 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3059 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3077 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3081 addmad(tm, &(o->op_madprop), slot);
3085 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3106 Perl_newMADsv(pTHX_ char key, SV* sv)
3108 PERL_ARGS_ASSERT_NEWMADSV;
3110 return newMADPROP(key, MAD_SV, sv, 0);
3114 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
3117 Newxz(mp, 1, MADPROP);
3120 mp->mad_vlen = vlen;
3121 mp->mad_type = type;
3123 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3128 Perl_mad_free(pTHX_ MADPROP* mp)
3130 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3134 mad_free(mp->mad_next);
3135 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
3136 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3137 switch (mp->mad_type) {
3141 Safefree((char*)mp->mad_val);
3144 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3145 op_free((OP*)mp->mad_val);
3148 sv_free(MUTABLE_SV(mp->mad_val));
3151 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3160 =head1 Optree construction
3162 =for apidoc Am|OP *|newNULLLIST
3164 Constructs, checks, and returns a new C<stub> op, which represents an
3165 empty list expression.
3171 Perl_newNULLLIST(pTHX)
3173 return newOP(OP_STUB, 0);
3177 S_force_list(pTHX_ OP *o)
3179 if (!o || o->op_type != OP_LIST)
3180 o = newLISTOP(OP_LIST, 0, o, NULL);
3186 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3188 Constructs, checks, and returns an op of any list type. I<type> is
3189 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3190 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3191 supply up to two ops to be direct children of the list op; they are
3192 consumed by this function and become part of the constructed op tree.
3198 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3203 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3205 NewOp(1101, listop, 1, LISTOP);
3207 listop->op_type = (OPCODE)type;
3208 listop->op_ppaddr = PL_ppaddr[type];
3211 listop->op_flags = (U8)flags;
3215 else if (!first && last)
3218 first->op_sibling = last;
3219 listop->op_first = first;
3220 listop->op_last = last;
3221 if (type == OP_LIST) {
3222 OP* const pushop = newOP(OP_PUSHMARK, 0);
3223 pushop->op_sibling = first;
3224 listop->op_first = pushop;
3225 listop->op_flags |= OPf_KIDS;
3227 listop->op_last = pushop;
3230 return CHECKOP(type, listop);
3234 =for apidoc Am|OP *|newOP|I32 type|I32 flags
3236 Constructs, checks, and returns an op of any base type (any type that
3237 has no extra fields). I<type> is the opcode. I<flags> gives the
3238 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3245 Perl_newOP(pTHX_ I32 type, I32 flags)
3250 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3251 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3252 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3253 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3255 NewOp(1101, o, 1, OP);
3256 o->op_type = (OPCODE)type;
3257 o->op_ppaddr = PL_ppaddr[type];
3258 o->op_flags = (U8)flags;
3260 o->op_latefreed = 0;
3264 o->op_private = (U8)(0 | (flags >> 8));
3265 if (PL_opargs[type] & OA_RETSCALAR)
3267 if (PL_opargs[type] & OA_TARGET)
3268 o->op_targ = pad_alloc(type, SVs_PADTMP);
3269 return CHECKOP(type, o);
3273 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3275 Constructs, checks, and returns an op of any unary type. I<type> is
3276 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3277 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3278 bits, the eight bits of C<op_private>, except that the bit with value 1
3279 is automatically set. I<first> supplies an optional op to be the direct
3280 child of the unary op; it is consumed by this function and become part
3281 of the constructed op tree.
3287 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3292 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3293 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3294 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3295 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3296 || type == OP_SASSIGN
3297 || type == OP_ENTERTRY
3298 || type == OP_NULL );
3301 first = newOP(OP_STUB, 0);
3302 if (PL_opargs[type] & OA_MARK)
3303 first = force_list(first);
3305 NewOp(1101, unop, 1, UNOP);
3306 unop->op_type = (OPCODE)type;
3307 unop->op_ppaddr = PL_ppaddr[type];
3308 unop->op_first = first;
3309 unop->op_flags = (U8)(flags | OPf_KIDS);
3310 unop->op_private = (U8)(1 | (flags >> 8));
3311 unop = (UNOP*) CHECKOP(type, unop);
3315 return fold_constants((OP *) unop);
3319 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3321 Constructs, checks, and returns an op of any binary type. I<type>
3322 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3323 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3324 the eight bits of C<op_private>, except that the bit with value 1 or
3325 2 is automatically set as required. I<first> and I<last> supply up to
3326 two ops to be the direct children of the binary op; they are consumed
3327 by this function and become part of the constructed op tree.
3333 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3338 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3339 || type == OP_SASSIGN || type == OP_NULL );
3341 NewOp(1101, binop, 1, BINOP);
3344 first = newOP(OP_NULL, 0);
3346 binop->op_type = (OPCODE)type;
3347 binop->op_ppaddr = PL_ppaddr[type];
3348 binop->op_first = first;
3349 binop->op_flags = (U8)(flags | OPf_KIDS);
3352 binop->op_private = (U8)(1 | (flags >> 8));
3355 binop->op_private = (U8)(2 | (flags >> 8));
3356 first->op_sibling = last;
3359 binop = (BINOP*)CHECKOP(type, binop);
3360 if (binop->op_next || binop->op_type != (OPCODE)type)
3363 binop->op_last = binop->op_first->op_sibling;
3365 return fold_constants((OP *)binop);
3368 static int uvcompare(const void *a, const void *b)
3369 __attribute__nonnull__(1)
3370 __attribute__nonnull__(2)
3371 __attribute__pure__;
3372 static int uvcompare(const void *a, const void *b)
3374 if (*((const UV *)a) < (*(const UV *)b))
3376 if (*((const UV *)a) > (*(const UV *)b))
3378 if (*((const UV *)a+1) < (*(const UV *)b+1))
3380 if (*((const UV *)a+1) > (*(const UV *)b+1))
3386 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3389 SV * const tstr = ((SVOP*)expr)->op_sv;
3392 (repl->op_type == OP_NULL)
3393 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3395 ((SVOP*)repl)->op_sv;
3398 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3399 const U8 *r = (U8*)SvPV_const(rstr, rlen);
3403 register short *tbl;
3405 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3406 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3407 I32 del = o->op_private & OPpTRANS_DELETE;
3410 PERL_ARGS_ASSERT_PMTRANS;
3412 PL_hints |= HINT_BLOCK_SCOPE;
3415 o->op_private |= OPpTRANS_FROM_UTF;
3418 o->op_private |= OPpTRANS_TO_UTF;
3420 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
3421 SV* const listsv = newSVpvs("# comment\n");
3423 const U8* tend = t + tlen;
3424 const U8* rend = r + rlen;
3438 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3439 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
3442 const U32 flags = UTF8_ALLOW_DEFAULT;
3446 t = tsave = bytes_to_utf8(t, &len);
3449 if (!to_utf && rlen) {
3451 r = rsave = bytes_to_utf8(r, &len);
3455 /* There are several snags with this code on EBCDIC:
3456 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3457 2. scan_const() in toke.c has encoded chars in native encoding which makes
3458 ranges at least in EBCDIC 0..255 range the bottom odd.
3462 U8 tmpbuf[UTF8_MAXBYTES+1];
3465 Newx(cp, 2*tlen, UV);
3467 transv = newSVpvs("");
3469 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3471 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
3473 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3477 cp[2*i+1] = cp[2*i];
3481 qsort(cp, i, 2*sizeof(UV), uvcompare);
3482 for (j = 0; j < i; j++) {
3484 diff = val - nextmin;
3486 t = uvuni_to_utf8(tmpbuf,nextmin);
3487 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3489 U8 range_mark = UTF_TO_NATIVE(0xff);
3490 t = uvuni_to_utf8(tmpbuf, val - 1);
3491 sv_catpvn(transv, (char *)&range_mark, 1);
3492 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3499 t = uvuni_to_utf8(tmpbuf,nextmin);
3500 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3502 U8 range_mark = UTF_TO_NATIVE(0xff);
3503 sv_catpvn(transv, (char *)&range_mark, 1);
3505 t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff,
3506 UNICODE_ALLOW_SUPER);
3507 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3508 t = (const U8*)SvPVX_const(transv);
3509 tlen = SvCUR(transv);
3513 else if (!rlen && !del) {
3514 r = t; rlen = tlen; rend = tend;
3517 if ((!rlen && !del) || t == r ||
3518 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
3520 o->op_private |= OPpTRANS_IDENTICAL;
3524 while (t < tend || tfirst <= tlast) {
3525 /* see if we need more "t" chars */
3526 if (tfirst > tlast) {
3527 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3529 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
3531 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3538 /* now see if we need more "r" chars */
3539 if (rfirst > rlast) {
3541 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3543 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
3545 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3554 rfirst = rlast = 0xffffffff;
3558 /* now see which range will peter our first, if either. */
3559 tdiff = tlast - tfirst;
3560 rdiff = rlast - rfirst;
3567 if (rfirst == 0xffffffff) {
3568 diff = tdiff; /* oops, pretend rdiff is infinite */
3570 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
3571 (long)tfirst, (long)tlast);
3573 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
3577 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
3578 (long)tfirst, (long)(tfirst + diff),
3581 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
3582 (long)tfirst, (long)rfirst);
3584 if (rfirst + diff > max)
3585 max = rfirst + diff;
3587 grows = (tfirst < rfirst &&
3588 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
3600 else if (max > 0xff)
3605 PerlMemShared_free(cPVOPo->op_pv);
3606 cPVOPo->op_pv = NULL;
3608 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
3610 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
3611 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
3612 PAD_SETSV(cPADOPo->op_padix, swash);
3614 SvREADONLY_on(swash);
3616 cSVOPo->op_sv = swash;
3618 SvREFCNT_dec(listsv);
3619 SvREFCNT_dec(transv);
3621 if (!del && havefinal && rlen)
3622 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
3623 newSVuv((UV)final), 0);
3626 o->op_private |= OPpTRANS_GROWS;
3632 op_getmad(expr,o,'e');
3633 op_getmad(repl,o,'r');
3641 tbl = (short*)cPVOPo->op_pv;
3643 Zero(tbl, 256, short);
3644 for (i = 0; i < (I32)tlen; i++)
3646 for (i = 0, j = 0; i < 256; i++) {
3648 if (j >= (I32)rlen) {
3657 if (i < 128 && r[j] >= 128)
3667 o->op_private |= OPpTRANS_IDENTICAL;
3669 else if (j >= (I32)rlen)
3674 PerlMemShared_realloc(tbl,
3675 (0x101+rlen-j) * sizeof(short));
3676 cPVOPo->op_pv = (char*)tbl;
3678 tbl[0x100] = (short)(rlen - j);
3679 for (i=0; i < (I32)rlen - j; i++)
3680 tbl[0x101+i] = r[j+i];
3684 if (!rlen && !del) {
3687 o->op_private |= OPpTRANS_IDENTICAL;
3689 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
3690 o->op_private |= OPpTRANS_IDENTICAL;
3692 for (i = 0; i < 256; i++)
3694 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
3695 if (j >= (I32)rlen) {
3697 if (tbl[t[i]] == -1)
3703 if (tbl[t[i]] == -1) {
3704 if (t[i] < 128 && r[j] >= 128)
3711 if(del && rlen == tlen) {
3712 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
3713 } else if(rlen > tlen) {
3714 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
3718 o->op_private |= OPpTRANS_GROWS;
3720 op_getmad(expr,o,'e');
3721 op_getmad(repl,o,'r');
3731 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
3733 Constructs, checks, and returns an op of any pattern matching type.
3734 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
3735 and, shifted up eight bits, the eight bits of C<op_private>.
3741 Perl_newPMOP(pTHX_ I32 type, I32 flags)
3746 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
3748 NewOp(1101, pmop, 1, PMOP);
3749 pmop->op_type = (OPCODE)type;
3750 pmop->op_ppaddr = PL_ppaddr[type];
3751 pmop->op_flags = (U8)flags;
3752 pmop->op_private = (U8)(0 | (flags >> 8));
3754 if (PL_hints & HINT_RE_TAINT)
3755 pmop->op_pmflags |= PMf_RETAINT;
3756 if (PL_hints & HINT_LOCALE) {
3757 pmop->op_pmflags |= PMf_LOCALE;
3759 else if ((! (PL_hints & HINT_BYTES)) && (PL_hints & HINT_UNI_8_BIT)) {
3760 pmop->op_pmflags |= RXf_PMf_UNICODE;
3762 if (PL_hints & HINT_RE_FLAGS) {
3763 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
3764 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
3766 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
3767 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
3768 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_dul"), 0, 0
3770 if (reflags && SvOK(reflags)) {
3771 pmop->op_pmflags &= ~(RXf_PMf_LOCALE|RXf_PMf_UNICODE);
3772 pmop->op_pmflags |= SvIV(reflags);
3778 assert(SvPOK(PL_regex_pad[0]));
3779 if (SvCUR(PL_regex_pad[0])) {
3780 /* Pop off the "packed" IV from the end. */
3781 SV *const repointer_list = PL_regex_pad[0];
3782 const char *p = SvEND(repointer_list) - sizeof(IV);
3783 const IV offset = *((IV*)p);
3785 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
3787 SvEND_set(repointer_list, p);
3789 pmop->op_pmoffset = offset;
3790 /* This slot should be free, so assert this: */
3791 assert(PL_regex_pad[offset] == &PL_sv_undef);
3793 SV * const repointer = &PL_sv_undef;
3794 av_push(PL_regex_padav, repointer);
3795 pmop->op_pmoffset = av_len(PL_regex_padav);
3796 PL_regex_pad = AvARRAY(PL_regex_padav);
3800 return CHECKOP(type, pmop);
3803 /* Given some sort of match op o, and an expression expr containing a
3804 * pattern, either compile expr into a regex and attach it to o (if it's
3805 * constant), or convert expr into a runtime regcomp op sequence (if it's
3808 * isreg indicates that the pattern is part of a regex construct, eg
3809 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
3810 * split "pattern", which aren't. In the former case, expr will be a list
3811 * if the pattern contains more than one term (eg /a$b/) or if it contains
3812 * a replacement, ie s/// or tr///.
3816 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
3821 I32 repl_has_vars = 0;
3825 PERL_ARGS_ASSERT_PMRUNTIME;
3827 if (o->op_type == OP_SUBST || o->op_type == OP_TRANS) {
3828 /* last element in list is the replacement; pop it */
3830 repl = cLISTOPx(expr)->op_last;
3831 kid = cLISTOPx(expr)->op_first;
3832 while (kid->op_sibling != repl)
3833 kid = kid->op_sibling;
3834 kid->op_sibling = NULL;
3835 cLISTOPx(expr)->op_last = kid;
3838 if (isreg && expr->op_type == OP_LIST &&
3839 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
3841 /* convert single element list to element */
3842 OP* const oe = expr;
3843 expr = cLISTOPx(oe)->op_first->op_sibling;
3844 cLISTOPx(oe)->op_first->op_sibling = NULL;
3845 cLISTOPx(oe)->op_last = NULL;
3849 if (o->op_type == OP_TRANS) {
3850 return pmtrans(o, expr, repl);
3853 reglist = isreg && expr->op_type == OP_LIST;
3857 PL_hints |= HINT_BLOCK_SCOPE;
3860 if (expr->op_type == OP_CONST) {
3861 SV *pat = ((SVOP*)expr)->op_sv;
3862 U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME;
3864 if (o->op_flags & OPf_SPECIAL)
3865 pm_flags |= RXf_SPLIT;
3868 assert (SvUTF8(pat));
3869 } else if (SvUTF8(pat)) {
3870 /* Not doing UTF-8, despite what the SV says. Is this only if we're
3871 trapped in use 'bytes'? */
3872 /* Make a copy of the octet sequence, but without the flag on, as
3873 the compiler now honours the SvUTF8 flag on pat. */
3875 const char *const p = SvPV(pat, len);
3876 pat = newSVpvn_flags(p, len, SVs_TEMP);
3879 PM_SETRE(pm, CALLREGCOMP(pat, pm_flags));
3882 op_getmad(expr,(OP*)pm,'e');
3888 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
3889 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
3891 : OP_REGCMAYBE),0,expr);
3893 NewOp(1101, rcop, 1, LOGOP);
3894 rcop->op_type = OP_REGCOMP;
3895 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
3896 rcop->op_first = scalar(expr);
3897 rcop->op_flags |= OPf_KIDS
3898 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
3899 | (reglist ? OPf_STACKED : 0);
3900 rcop->op_private = 1;
3903 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
3905 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
3908 /* establish postfix order */
3909 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
3911 rcop->op_next = expr;
3912 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
3915 rcop->op_next = LINKLIST(expr);
3916 expr->op_next = (OP*)rcop;
3919 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
3924 if (pm->op_pmflags & PMf_EVAL) {
3926 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
3927 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
3929 else if (repl->op_type == OP_CONST)
3933 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
3934 if (curop->op_type == OP_SCOPE
3935 || curop->op_type == OP_LEAVE
3936 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
3937 if (curop->op_type == OP_GV) {
3938 GV * const gv = cGVOPx_gv(curop);
3940 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
3943 else if (curop->op_type == OP_RV2CV)
3945 else if (curop->op_type == OP_RV2SV ||
3946 curop->op_type == OP_RV2AV ||
3947 curop->op_type == OP_RV2HV ||
3948 curop->op_type == OP_RV2GV) {
3949 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3952 else if (curop->op_type == OP_PADSV ||
3953 curop->op_type == OP_PADAV ||
3954 curop->op_type == OP_PADHV ||
3955 curop->op_type == OP_PADANY)
3959 else if (curop->op_type == OP_PUSHRE)
3960 NOOP; /* Okay here, dangerous in newASSIGNOP */
3970 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
3972 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3973 op_prepend_elem(o->op_type, scalar(repl), o);
3976 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
3977 pm->op_pmflags |= PMf_MAYBE_CONST;
3979 NewOp(1101, rcop, 1, LOGOP);
3980 rcop->op_type = OP_SUBSTCONT;
3981 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3982 rcop->op_first = scalar(repl);
3983 rcop->op_flags |= OPf_KIDS;
3984 rcop->op_private = 1;
3987 /* establish postfix order */
3988 rcop->op_next = LINKLIST(repl);
3989 repl->op_next = (OP*)rcop;
3991 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
3992 assert(!(pm->op_pmflags & PMf_ONCE));
3993 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
4002 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
4004 Constructs, checks, and returns an op of any type that involves an
4005 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
4006 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
4007 takes ownership of one reference to it.
4013 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
4018 PERL_ARGS_ASSERT_NEWSVOP;
4020 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4021 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4022 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4024 NewOp(1101, svop, 1, SVOP);
4025 svop->op_type = (OPCODE)type;
4026 svop->op_ppaddr = PL_ppaddr[type];
4028 svop->op_next = (OP*)svop;
4029 svop->op_flags = (U8)flags;
4030 if (PL_opargs[type] & OA_RETSCALAR)
4032 if (PL_opargs[type] & OA_TARGET)
4033 svop->op_targ = pad_alloc(type, SVs_PADTMP);
4034 return CHECKOP(type, svop);
4040 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
4042 Constructs, checks, and returns an op of any type that involves a
4043 reference to a pad element. I<type> is the opcode. I<flags> gives the
4044 eight bits of C<op_flags>. A pad slot is automatically allocated, and
4045 is populated with I<sv>; this function takes ownership of one reference
4048 This function only exists if Perl has been compiled to use ithreads.
4054 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
4059 PERL_ARGS_ASSERT_NEWPADOP;
4061 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4062 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4063 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4065 NewOp(1101, padop, 1, PADOP);
4066 padop->op_type = (OPCODE)type;
4067 padop->op_ppaddr = PL_ppaddr[type];
4068 padop->op_padix = pad_alloc(type, SVs_PADTMP);
4069 SvREFCNT_dec(PAD_SVl(padop->op_padix));
4070 PAD_SETSV(padop->op_padix, sv);
4073 padop->op_next = (OP*)padop;
4074 padop->op_flags = (U8)flags;
4075 if (PL_opargs[type] & OA_RETSCALAR)
4077 if (PL_opargs[type] & OA_TARGET)
4078 padop->op_targ = pad_alloc(type, SVs_PADTMP);
4079 return CHECKOP(type, padop);
4082 #endif /* !USE_ITHREADS */
4085 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
4087 Constructs, checks, and returns an op of any type that involves an
4088 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
4089 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
4090 reference; calling this function does not transfer ownership of any
4097 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
4101 PERL_ARGS_ASSERT_NEWGVOP;
4105 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4107 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4112 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
4114 Constructs, checks, and returns an op of any type that involves an
4115 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
4116 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
4117 must have been allocated using L</PerlMemShared_malloc>; the memory will
4118 be freed when the op is destroyed.
4124 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
4129 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4130 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4132 NewOp(1101, pvop, 1, PVOP);
4133 pvop->op_type = (OPCODE)type;
4134 pvop->op_ppaddr = PL_ppaddr[type];
4136 pvop->op_next = (OP*)pvop;
4137 pvop->op_flags = (U8)flags;
4138 if (PL_opargs[type] & OA_RETSCALAR)
4140 if (PL_opargs[type] & OA_TARGET)
4141 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
4142 return CHECKOP(type, pvop);
4150 Perl_package(pTHX_ OP *o)
4153 SV *const sv = cSVOPo->op_sv;
4158 PERL_ARGS_ASSERT_PACKAGE;
4160 save_hptr(&PL_curstash);
4161 save_item(PL_curstname);
4163 PL_curstash = gv_stashsv(sv, GV_ADD);
4165 sv_setsv(PL_curstname, sv);
4167 PL_hints |= HINT_BLOCK_SCOPE;
4168 PL_parser->copline = NOLINE;
4169 PL_parser->expect = XSTATE;
4174 if (!PL_madskills) {
4179 pegop = newOP(OP_NULL,0);
4180 op_getmad(o,pegop,'P');
4186 Perl_package_version( pTHX_ OP *v )
4189 U32 savehints = PL_hints;
4190 PERL_ARGS_ASSERT_PACKAGE_VERSION;
4191 PL_hints &= ~HINT_STRICT_VARS;
4192 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
4193 PL_hints = savehints;
4202 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
4209 OP *pegop = newOP(OP_NULL,0);
4212 PERL_ARGS_ASSERT_UTILIZE;
4214 if (idop->op_type != OP_CONST)
4215 Perl_croak(aTHX_ "Module name must be constant");
4218 op_getmad(idop,pegop,'U');
4223 SV * const vesv = ((SVOP*)version)->op_sv;
4226 op_getmad(version,pegop,'V');
4227 if (!arg && !SvNIOKp(vesv)) {
4234 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
4235 Perl_croak(aTHX_ "Version number must be a constant number");
4237 /* Make copy of idop so we don't free it twice */
4238 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
4240 /* Fake up a method call to VERSION */
4241 meth = newSVpvs_share("VERSION");
4242 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
4243 op_append_elem(OP_LIST,
4244 op_prepend_elem(OP_LIST, pack, list(version)),
4245 newSVOP(OP_METHOD_NAMED, 0, meth)));
4249 /* Fake up an import/unimport */
4250 if (arg && arg->op_type == OP_STUB) {
4252 op_getmad(arg,pegop,'S');
4253 imop = arg; /* no import on explicit () */
4255 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
4256 imop = NULL; /* use 5.0; */
4258 idop->op_private |= OPpCONST_NOVER;
4264 op_getmad(arg,pegop,'A');
4266 /* Make copy of idop so we don't free it twice */
4267 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
4269 /* Fake up a method call to import/unimport */
4271 ? newSVpvs_share("import") : newSVpvs_share("unimport");
4272 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
4273 op_append_elem(OP_LIST,
4274 op_prepend_elem(OP_LIST, pack, list(arg)),
4275 newSVOP(OP_METHOD_NAMED, 0, meth)));
4278 /* Fake up the BEGIN {}, which does its thing immediately. */
4280 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
4283 op_append_elem(OP_LINESEQ,
4284 op_append_elem(OP_LINESEQ,
4285 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
4286 newSTATEOP(0, NULL, veop)),
4287 newSTATEOP(0, NULL, imop) ));
4289 /* The "did you use incorrect case?" warning used to be here.
4290 * The problem is that on case-insensitive filesystems one
4291 * might get false positives for "use" (and "require"):
4292 * "use Strict" or "require CARP" will work. This causes
4293 * portability problems for the script: in case-strict
4294 * filesystems the script will stop working.
4296 * The "incorrect case" warning checked whether "use Foo"
4297 * imported "Foo" to your namespace, but that is wrong, too:
4298 * there is no requirement nor promise in the language that
4299 * a Foo.pm should or would contain anything in package "Foo".
4301 * There is very little Configure-wise that can be done, either:
4302 * the case-sensitivity of the build filesystem of Perl does not
4303 * help in guessing the case-sensitivity of the runtime environment.
4306 PL_hints |= HINT_BLOCK_SCOPE;
4307 PL_parser->copline = NOLINE;
4308 PL_parser->expect = XSTATE;
4309 PL_cop_seqmax++; /* Purely for B::*'s benefit */
4312 if (!PL_madskills) {
4313 /* FIXME - don't allocate pegop if !PL_madskills */
4322 =head1 Embedding Functions
4324 =for apidoc load_module
4326 Loads the module whose name is pointed to by the string part of name.
4327 Note that the actual module name, not its filename, should be given.
4328 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
4329 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
4330 (or 0 for no flags). ver, if specified, provides version semantics
4331 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
4332 arguments can be used to specify arguments to the module's import()
4333 method, similar to C<use Foo::Bar VERSION LIST>. They must be
4334 terminated with a final NULL pointer. Note that this list can only
4335 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
4336 Otherwise at least a single NULL pointer to designate the default
4337 import list is required.
4342 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
4346 PERL_ARGS_ASSERT_LOAD_MODULE;
4348 va_start(args, ver);
4349 vload_module(flags, name, ver, &args);
4353 #ifdef PERL_IMPLICIT_CONTEXT
4355 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
4359 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
4360 va_start(args, ver);
4361 vload_module(flags, name, ver, &args);
4367 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
4371 OP * const modname = newSVOP(OP_CONST, 0, name);
4373 PERL_ARGS_ASSERT_VLOAD_MODULE;
4375 modname->op_private |= OPpCONST_BARE;
4377 veop = newSVOP(OP_CONST, 0, ver);
4381 if (flags & PERL_LOADMOD_NOIMPORT) {
4382 imop = sawparens(newNULLLIST());
4384 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
4385 imop = va_arg(*args, OP*);
4390 sv = va_arg(*args, SV*);
4392 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
4393 sv = va_arg(*args, SV*);
4397 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
4398 * that it has a PL_parser to play with while doing that, and also
4399 * that it doesn't mess with any existing parser, by creating a tmp
4400 * new parser with lex_start(). This won't actually be used for much,
4401 * since pp_require() will create another parser for the real work. */
4404 SAVEVPTR(PL_curcop);
4405 lex_start(NULL, NULL, 0);
4406 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
4407 veop, modname, imop);
4412 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
4418 PERL_ARGS_ASSERT_DOFILE;
4420 if (!force_builtin) {
4421 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
4422 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
4423 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
4424 gv = gvp ? *gvp : NULL;
4428 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
4429 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
4430 op_append_elem(OP_LIST, term,
4431 scalar(newUNOP(OP_RV2CV, 0,
4432 newGVOP(OP_GV, 0, gv))))));
4435 doop = newUNOP(OP_DOFILE, 0, scalar(term));
4441 =head1 Optree construction
4443 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
4445 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
4446 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
4447 be set automatically, and, shifted up eight bits, the eight bits of
4448 C<op_private>, except that the bit with value 1 or 2 is automatically
4449 set as required. I<listval> and I<subscript> supply the parameters of
4450 the slice; they are consumed by this function and become part of the
4451 constructed op tree.
4457 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
4459 return newBINOP(OP_LSLICE, flags,
4460 list(force_list(subscript)),
4461 list(force_list(listval)) );
4465 S_is_list_assignment(pTHX_ register const OP *o)
4473 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
4474 o = cUNOPo->op_first;
4476 flags = o->op_flags;
4478 if (type == OP_COND_EXPR) {
4479 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
4480 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
4485 yyerror("Assignment to both a list and a scalar");
4489 if (type == OP_LIST &&
4490 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
4491 o->op_private & OPpLVAL_INTRO)
4494 if (type == OP_LIST || flags & OPf_PARENS ||
4495 type == OP_RV2AV || type == OP_RV2HV ||
4496 type == OP_ASLICE || type == OP_HSLICE)
4499 if (type == OP_PADAV || type == OP_PADHV)
4502 if (type == OP_RV2SV)
4509 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
4511 Constructs, checks, and returns an assignment op. I<left> and I<right>
4512 supply the parameters of the assignment; they are consumed by this
4513 function and become part of the constructed op tree.
4515 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
4516 a suitable conditional optree is constructed. If I<optype> is the opcode
4517 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
4518 performs the binary operation and assigns the result to the left argument.
4519 Either way, if I<optype> is non-zero then I<flags> has no effect.
4521 If I<optype> is zero, then a plain scalar or list assignment is
4522 constructed. Which type of assignment it is is automatically determined.
4523 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
4524 will be set automatically, and, shifted up eight bits, the eight bits
4525 of C<op_private>, except that the bit with value 1 or 2 is automatically
4532 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
4538 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
4539 return newLOGOP(optype, 0,
4540 op_lvalue(scalar(left), optype),
4541 newUNOP(OP_SASSIGN, 0, scalar(right)));
4544 return newBINOP(optype, OPf_STACKED,
4545 op_lvalue(scalar(left), optype), scalar(right));
4549 if (is_list_assignment(left)) {
4550 static const char no_list_state[] = "Initialization of state variables"
4551 " in list context currently forbidden";
4553 bool maybe_common_vars = TRUE;
4556 /* Grandfathering $[ assignment here. Bletch.*/
4557 /* Only simple assignments like C<< ($[) = 1 >> are allowed */
4558 PL_eval_start = (left->op_type == OP_CONST) ? right : NULL;
4559 left = op_lvalue(left, OP_AASSIGN);
4562 else if (left->op_type == OP_CONST) {
4563 deprecate("assignment to $[");
4565 /* Result of assignment is always 1 (or we'd be dead already) */
4566 return newSVOP(OP_CONST, 0, newSViv(1));
4568 curop = list(force_list(left));
4569 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
4570 o->op_private = (U8)(0 | (flags >> 8));
4572 if ((left->op_type == OP_LIST
4573 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
4575 OP* lop = ((LISTOP*)left)->op_first;
4576 maybe_common_vars = FALSE;
4578 if (lop->op_type == OP_PADSV ||
4579 lop->op_type == OP_PADAV ||
4580 lop->op_type == OP_PADHV ||
4581 lop->op_type == OP_PADANY) {
4582 if (!(lop->op_private & OPpLVAL_INTRO))
4583 maybe_common_vars = TRUE;
4585 if (lop->op_private & OPpPAD_STATE) {
4586 if (left->op_private & OPpLVAL_INTRO) {
4587 /* Each variable in state($a, $b, $c) = ... */
4590 /* Each state variable in
4591 (state $a, my $b, our $c, $d, undef) = ... */
4593 yyerror(no_list_state);
4595 /* Each my variable in
4596 (state $a, my $b, our $c, $d, undef) = ... */
4598 } else if (lop->op_type == OP_UNDEF ||
4599 lop->op_type == OP_PUSHMARK) {
4600 /* undef may be interesting in
4601 (state $a, undef, state $c) */
4603 /* Other ops in the list. */
4604 maybe_common_vars = TRUE;
4606 lop = lop->op_sibling;
4609 else if ((left->op_private & OPpLVAL_INTRO)
4610 && ( left->op_type == OP_PADSV
4611 || left->op_type == OP_PADAV
4612 || left->op_type == OP_PADHV
4613 || left->op_type == OP_PADANY))
4615 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
4616 if (left->op_private & OPpPAD_STATE) {
4617 /* All single variable list context state assignments, hence
4627 yyerror(no_list_state);
4631 /* PL_generation sorcery:
4632 * an assignment like ($a,$b) = ($c,$d) is easier than
4633 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
4634 * To detect whether there are common vars, the global var
4635 * PL_generation is incremented for each assign op we compile.
4636 * Then, while compiling the assign op, we run through all the
4637 * variables on both sides of the assignment, setting a spare slot
4638 * in each of them to PL_generation. If any of them already have
4639 * that value, we know we've got commonality. We could use a
4640 * single bit marker, but then we'd have to make 2 passes, first
4641 * to clear the flag, then to test and set it. To find somewhere
4642 * to store these values, evil chicanery is done with SvUVX().
4645 if (maybe_common_vars) {
4648 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
4649 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
4650 if (curop->op_type == OP_GV) {
4651 GV *gv = cGVOPx_gv(curop);
4653 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4655 GvASSIGN_GENERATION_set(gv, PL_generation);
4657 else if (curop->op_type == OP_PADSV ||
4658 curop->op_type == OP_PADAV ||
4659 curop->op_type == OP_PADHV ||
4660 curop->op_type == OP_PADANY)
4662 if (PAD_COMPNAME_GEN(curop->op_targ)
4663 == (STRLEN)PL_generation)
4665 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
4668 else if (curop->op_type == OP_RV2CV)
4670 else if (curop->op_type == OP_RV2SV ||
4671 curop->op_type == OP_RV2AV ||
4672 curop->op_type == OP_RV2HV ||
4673 curop->op_type == OP_RV2GV) {
4674 if (lastop->op_type != OP_GV) /* funny deref? */
4677 else if (curop->op_type == OP_PUSHRE) {
4679 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
4680 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
4682 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4684 GvASSIGN_GENERATION_set(gv, PL_generation);
4688 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
4691 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4693 GvASSIGN_GENERATION_set(gv, PL_generation);
4703 o->op_private |= OPpASSIGN_COMMON;
4706 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
4707 OP* tmpop = ((LISTOP*)right)->op_first;
4708 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
4709 PMOP * const pm = (PMOP*)tmpop;
4710 if (left->op_type == OP_RV2AV &&
4711 !(left->op_private & OPpLVAL_INTRO) &&
4712 !(o->op_private & OPpASSIGN_COMMON) )
4714 tmpop = ((UNOP*)left)->op_first;
4715 if (tmpop->op_type == OP_GV
4717 && !pm->op_pmreplrootu.op_pmtargetoff
4719 && !pm->op_pmreplrootu.op_pmtargetgv
4723 pm->op_pmreplrootu.op_pmtargetoff
4724 = cPADOPx(tmpop)->op_padix;
4725 cPADOPx(tmpop)->op_padix = 0; /* steal it */
4727 pm->op_pmreplrootu.op_pmtargetgv
4728 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
4729 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
4731 pm->op_pmflags |= PMf_ONCE;
4732 tmpop = cUNOPo->op_first; /* to list (nulled) */
4733 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
4734 tmpop->op_sibling = NULL; /* don't free split */
4735 right->op_next = tmpop->op_next; /* fix starting loc */
4736 op_free(o); /* blow off assign */
4737 right->op_flags &= ~OPf_WANT;
4738 /* "I don't know and I don't care." */
4743 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
4744 ((LISTOP*)right)->op_last->op_type == OP_CONST)
4746 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
4747 if (SvIOK(sv) && SvIVX(sv) == 0)
4748 sv_setiv(sv, PL_modcount+1);
4756 right = newOP(OP_UNDEF, 0);
4757 if (right->op_type == OP_READLINE) {
4758 right->op_flags |= OPf_STACKED;
4759 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
4763 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
4764 o = newBINOP(OP_SASSIGN, flags,
4765 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
4769 if (!PL_madskills) { /* assignment to $[ is ignored when making a mad dump */
4770 deprecate("assignment to $[");
4772 o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling)));
4773 o->op_private |= OPpCONST_ARYBASE;
4781 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
4783 Constructs a state op (COP). The state op is normally a C<nextstate> op,
4784 but will be a C<dbstate> op if debugging is enabled for currently-compiled
4785 code. The state op is populated from L</PL_curcop> (or L</PL_compiling>).
4786 If I<label> is non-null, it supplies the name of a label to attach to
4787 the state op; this function takes ownership of the memory pointed at by
4788 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
4791 If I<o> is null, the state op is returned. Otherwise the state op is
4792 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
4793 is consumed by this function and becomes part of the returned op tree.
4799 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
4802 const U32 seq = intro_my();
4805 NewOp(1101, cop, 1, COP);
4806 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
4807 cop->op_type = OP_DBSTATE;
4808 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
4811 cop->op_type = OP_NEXTSTATE;
4812 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
4814 cop->op_flags = (U8)flags;
4815 CopHINTS_set(cop, PL_hints);
4817 cop->op_private |= NATIVE_HINTS;
4819 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
4820 cop->op_next = (OP*)cop;
4823 /* CopARYBASE is now "virtual", in that it's stored as a flag bit in
4824 CopHINTS and a possible value in cop_hints_hash, so no need to copy it.
4826 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
4827 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
4829 Perl_store_cop_label(aTHX_ cop, label, strlen(label), 0);
4831 PL_hints |= HINT_BLOCK_SCOPE;
4832 /* It seems that we need to defer freeing this pointer, as other parts
4833 of the grammar end up wanting to copy it after this op has been
4838 if (PL_parser && PL_parser->copline == NOLINE)
4839 CopLINE_set(cop, CopLINE(PL_curcop));
4841 CopLINE_set(cop, PL_parser->copline);
4843 PL_parser->copline = NOLINE;
4846 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
4848 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
4850 CopSTASH_set(cop, PL_curstash);
4852 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
4853 /* this line can have a breakpoint - store the cop in IV */
4854 AV *av = CopFILEAVx(PL_curcop);
4856 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
4857 if (svp && *svp != &PL_sv_undef ) {
4858 (void)SvIOK_on(*svp);
4859 SvIV_set(*svp, PTR2IV(cop));
4864 if (flags & OPf_SPECIAL)
4866 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
4870 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
4872 Constructs, checks, and returns a logical (flow control) op. I<type>
4873 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
4874 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
4875 the eight bits of C<op_private>, except that the bit with value 1 is
4876 automatically set. I<first> supplies the expression controlling the
4877 flow, and I<other> supplies the side (alternate) chain of ops; they are
4878 consumed by this function and become part of the constructed op tree.
4884 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
4888 PERL_ARGS_ASSERT_NEWLOGOP;
4890 return new_logop(type, flags, &first, &other);
4894 S_search_const(pTHX_ OP *o)
4896 PERL_ARGS_ASSERT_SEARCH_CONST;
4898 switch (o->op_type) {
4902 if (o->op_flags & OPf_KIDS)
4903 return search_const(cUNOPo->op_first);
4910 if (!(o->op_flags & OPf_KIDS))
4912 kid = cLISTOPo->op_first;
4914 switch (kid->op_type) {
4918 kid = kid->op_sibling;
4921 if (kid != cLISTOPo->op_last)
4927 kid = cLISTOPo->op_last;
4929 return search_const(kid);
4937 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
4945 int prepend_not = 0;
4947 PERL_ARGS_ASSERT_NEW_LOGOP;
4952 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
4953 return newBINOP(type, flags, scalar(first), scalar(other));
4955 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
4957 scalarboolean(first);
4958 /* optimize AND and OR ops that have NOTs as children */
4959 if (first->op_type == OP_NOT
4960 && (first->op_flags & OPf_KIDS)
4961 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
4962 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
4964 if (type == OP_AND || type == OP_OR) {
4970 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
4972 prepend_not = 1; /* prepend a NOT op later */
4976 /* search for a constant op that could let us fold the test */
4977 if ((cstop = search_const(first))) {
4978 if (cstop->op_private & OPpCONST_STRICT)
4979 no_bareword_allowed(cstop);
4980 else if ((cstop->op_private & OPpCONST_BARE))
4981 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
4982 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
4983 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
4984 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
4986 if (other->op_type == OP_CONST)
4987 other->op_private |= OPpCONST_SHORTCIRCUIT;
4989 OP *newop = newUNOP(OP_NULL, 0, other);
4990 op_getmad(first, newop, '1');
4991 newop->op_targ = type; /* set "was" field */
4995 if (other->op_type == OP_LEAVE)
4996 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
4997 else if (other->op_type == OP_MATCH
4998 || other->op_type == OP_SUBST
4999 || other->op_type == OP_TRANS)
5000 /* Mark the op as being unbindable with =~ */
5001 other->op_flags |= OPf_SPECIAL;
5005 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
5006 const OP *o2 = other;
5007 if ( ! (o2->op_type == OP_LIST
5008 && (( o2 = cUNOPx(o2)->op_first))
5009 && o2->op_type == OP_PUSHMARK
5010 && (( o2 = o2->op_sibling)) )
5013 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
5014 || o2->op_type == OP_PADHV)
5015 && o2->op_private & OPpLVAL_INTRO
5016 && !(o2->op_private & OPpPAD_STATE))
5018 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
5019 "Deprecated use of my() in false conditional");
5023 if (first->op_type == OP_CONST)
5024 first->op_private |= OPpCONST_SHORTCIRCUIT;
5026 first = newUNOP(OP_NULL, 0, first);
5027 op_getmad(other, first, '2');
5028 first->op_targ = type; /* set "was" field */
5035 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
5036 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
5038 const OP * const k1 = ((UNOP*)first)->op_first;
5039 const OP * const k2 = k1->op_sibling;
5041 switch (first->op_type)
5044 if (k2 && k2->op_type == OP_READLINE
5045 && (k2->op_flags & OPf_STACKED)
5046 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5048 warnop = k2->op_type;
5053 if (k1->op_type == OP_READDIR
5054 || k1->op_type == OP_GLOB
5055 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5056 || k1->op_type == OP_EACH)
5058 warnop = ((k1->op_type == OP_NULL)
5059 ? (OPCODE)k1->op_targ : k1->op_type);
5064 const line_t oldline = CopLINE(PL_curcop);
5065 CopLINE_set(PL_curcop, PL_parser->copline);
5066 Perl_warner(aTHX_ packWARN(WARN_MISC),
5067 "Value of %s%s can be \"0\"; test with defined()",
5069 ((warnop == OP_READLINE || warnop == OP_GLOB)
5070 ? " construct" : "() operator"));
5071 CopLINE_set(PL_curcop, oldline);
5078 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
5079 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
5081 NewOp(1101, logop, 1, LOGOP);
5083 logop->op_type = (OPCODE)type;
5084 logop->op_ppaddr = PL_ppaddr[type];
5085 logop->op_first = first;
5086 logop->op_flags = (U8)(flags | OPf_KIDS);
5087 logop->op_other = LINKLIST(other);
5088 logop->op_private = (U8)(1 | (flags >> 8));
5090 /* establish postfix order */
5091 logop->op_next = LINKLIST(first);
5092 first->op_next = (OP*)logop;
5093 first->op_sibling = other;
5095 CHECKOP(type,logop);
5097 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
5104 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
5106 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
5107 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5108 will be set automatically, and, shifted up eight bits, the eight bits of
5109 C<op_private>, except that the bit with value 1 is automatically set.
5110 I<first> supplies the expression selecting between the two branches,
5111 and I<trueop> and I<falseop> supply the branches; they are consumed by
5112 this function and become part of the constructed op tree.
5118 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
5126 PERL_ARGS_ASSERT_NEWCONDOP;
5129 return newLOGOP(OP_AND, 0, first, trueop);
5131 return newLOGOP(OP_OR, 0, first, falseop);
5133 scalarboolean(first);
5134 if ((cstop = search_const(first))) {
5135 /* Left or right arm of the conditional? */
5136 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
5137 OP *live = left ? trueop : falseop;
5138 OP *const dead = left ? falseop : trueop;
5139 if (cstop->op_private & OPpCONST_BARE &&
5140 cstop->op_private & OPpCONST_STRICT) {
5141 no_bareword_allowed(cstop);
5144 /* This is all dead code when PERL_MAD is not defined. */
5145 live = newUNOP(OP_NULL, 0, live);
5146 op_getmad(first, live, 'C');
5147 op_getmad(dead, live, left ? 'e' : 't');
5152 if (live->op_type == OP_LEAVE)
5153 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
5154 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
5155 || live->op_type == OP_TRANS)
5156 /* Mark the op as being unbindable with =~ */
5157 live->op_flags |= OPf_SPECIAL;
5160 NewOp(1101, logop, 1, LOGOP);
5161 logop->op_type = OP_COND_EXPR;
5162 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
5163 logop->op_first = first;
5164 logop->op_flags = (U8)(flags | OPf_KIDS);
5165 logop->op_private = (U8)(1 | (flags >> 8));
5166 logop->op_other = LINKLIST(trueop);
5167 logop->op_next = LINKLIST(falseop);
5169 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
5172 /* establish postfix order */
5173 start = LINKLIST(first);
5174 first->op_next = (OP*)logop;
5176 first->op_sibling = trueop;
5177 trueop->op_sibling = falseop;
5178 o = newUNOP(OP_NULL, 0, (OP*)logop);
5180 trueop->op_next = falseop->op_next = o;
5187 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
5189 Constructs and returns a C<range> op, with subordinate C<flip> and
5190 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
5191 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
5192 for both the C<flip> and C<range> ops, except that the bit with value
5193 1 is automatically set. I<left> and I<right> supply the expressions
5194 controlling the endpoints of the range; they are consumed by this function
5195 and become part of the constructed op tree.
5201 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
5210 PERL_ARGS_ASSERT_NEWRANGE;
5212 NewOp(1101, range, 1, LOGOP);
5214 range->op_type = OP_RANGE;
5215 range->op_ppaddr = PL_ppaddr[OP_RANGE];
5216 range->op_first = left;
5217 range->op_flags = OPf_KIDS;
5218 leftstart = LINKLIST(left);
5219 range->op_other = LINKLIST(right);
5220 range->op_private = (U8)(1 | (flags >> 8));
5222 left->op_sibling = right;
5224 range->op_next = (OP*)range;
5225 flip = newUNOP(OP_FLIP, flags, (OP*)range);
5226 flop = newUNOP(OP_FLOP, 0, flip);
5227 o = newUNOP(OP_NULL, 0, flop);
5229 range->op_next = leftstart;
5231 left->op_next = flip;
5232 right->op_next = flop;
5234 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
5235 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
5236 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
5237 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
5239 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
5240 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
5243 if (!flip->op_private || !flop->op_private)
5244 LINKLIST(o); /* blow off optimizer unless constant */
5250 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
5252 Constructs, checks, and returns an op tree expressing a loop. This is
5253 only a loop in the control flow through the op tree; it does not have
5254 the heavyweight loop structure that allows exiting the loop by C<last>
5255 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
5256 top-level op, except that some bits will be set automatically as required.
5257 I<expr> supplies the expression controlling loop iteration, and I<block>
5258 supplies the body of the loop; they are consumed by this function and
5259 become part of the constructed op tree. I<debuggable> is currently
5260 unused and should always be 1.
5266 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
5271 const bool once = block && block->op_flags & OPf_SPECIAL &&
5272 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
5274 PERL_UNUSED_ARG(debuggable);
5277 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
5278 return block; /* do {} while 0 does once */
5279 if (expr->op_type == OP_READLINE
5280 || expr->op_type == OP_READDIR
5281 || expr->op_type == OP_GLOB
5282 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
5283 expr = newUNOP(OP_DEFINED, 0,
5284 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
5285 } else if (expr->op_flags & OPf_KIDS) {
5286 const OP * const k1 = ((UNOP*)expr)->op_first;
5287 const OP * const k2 = k1 ? k1->op_sibling : NULL;
5288 switch (expr->op_type) {
5290 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
5291 && (k2->op_flags & OPf_STACKED)
5292 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5293 expr = newUNOP(OP_DEFINED, 0, expr);
5297 if (k1 && (k1->op_type == OP_READDIR
5298 || k1->op_type == OP_GLOB
5299 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5300 || k1->op_type == OP_EACH))
5301 expr = newUNOP(OP_DEFINED, 0, expr);
5307 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
5308 * op, in listop. This is wrong. [perl #27024] */
5310 block = newOP(OP_NULL, 0);
5311 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
5312 o = new_logop(OP_AND, 0, &expr, &listop);
5315 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
5317 if (once && o != listop)
5318 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
5321 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
5323 o->op_flags |= flags;
5325 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
5330 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
5332 Constructs, checks, and returns an op tree expressing a C<while> loop.
5333 This is a heavyweight loop, with structure that allows exiting the loop
5334 by C<last> and suchlike.
5336 I<loop> is an optional preconstructed C<enterloop> op to use in the
5337 loop; if it is null then a suitable op will be constructed automatically.
5338 I<expr> supplies the loop's controlling expression. I<block> supplies the
5339 main body of the loop, and I<cont> optionally supplies a C<continue> block
5340 that operates as a second half of the body. All of these optree inputs
5341 are consumed by this function and become part of the constructed op tree.
5343 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
5344 op and, shifted up eight bits, the eight bits of C<op_private> for
5345 the C<leaveloop> op, except that (in both cases) some bits will be set
5346 automatically. I<debuggable> is currently unused and should always be 1.
5347 I<has_my> can be supplied as true to force the
5348 loop body to be enclosed in its own scope.
5354 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
5355 OP *expr, OP *block, OP *cont, I32 has_my)
5364 PERL_UNUSED_ARG(debuggable);
5367 if (expr->op_type == OP_READLINE
5368 || expr->op_type == OP_READDIR
5369 || expr->op_type == OP_GLOB
5370 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
5371 expr = newUNOP(OP_DEFINED, 0,
5372 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
5373 } else if (expr->op_flags & OPf_KIDS) {
5374 const OP * const k1 = ((UNOP*)expr)->op_first;
5375 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
5376 switch (expr->op_type) {
5378 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
5379 && (k2->op_flags & OPf_STACKED)
5380 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5381 expr = newUNOP(OP_DEFINED, 0, expr);
5385 if (k1 && (k1->op_type == OP_READDIR
5386 || k1->op_type == OP_GLOB
5387 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5388 || k1->op_type == OP_EACH))
5389 expr = newUNOP(OP_DEFINED, 0, expr);
5396 block = newOP(OP_NULL, 0);
5397 else if (cont || has_my) {
5398 block = op_scope(block);
5402 next = LINKLIST(cont);
5405 OP * const unstack = newOP(OP_UNSTACK, 0);
5408 cont = op_append_elem(OP_LINESEQ, cont, unstack);
5412 listop = op_append_list(OP_LINESEQ, block, cont);
5414 redo = LINKLIST(listop);
5418 o = new_logop(OP_AND, 0, &expr, &listop);
5419 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
5420 op_free(expr); /* oops, it's a while (0) */
5422 return NULL; /* listop already freed by new_logop */
5425 ((LISTOP*)listop)->op_last->op_next =
5426 (o == listop ? redo : LINKLIST(o));
5432 NewOp(1101,loop,1,LOOP);
5433 loop->op_type = OP_ENTERLOOP;
5434 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
5435 loop->op_private = 0;
5436 loop->op_next = (OP*)loop;
5439 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
5441 loop->op_redoop = redo;
5442 loop->op_lastop = o;
5443 o->op_private |= loopflags;
5446 loop->op_nextop = next;
5448 loop->op_nextop = o;
5450 o->op_flags |= flags;
5451 o->op_private |= (flags >> 8);
5456 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
5458 Constructs, checks, and returns an op tree expressing a C<foreach>
5459 loop (iteration through a list of values). This is a heavyweight loop,
5460 with structure that allows exiting the loop by C<last> and suchlike.
5462 I<sv> optionally supplies the variable that will be aliased to each
5463 item in turn; if null, it defaults to C<$_> (either lexical or global).
5464 I<expr> supplies the list of values to iterate over. I<block> supplies
5465 the main body of the loop, and I<cont> optionally supplies a C<continue>
5466 block that operates as a second half of the body. All of these optree
5467 inputs are consumed by this function and become part of the constructed
5470 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
5471 op and, shifted up eight bits, the eight bits of C<op_private> for
5472 the C<leaveloop> op, except that (in both cases) some bits will be set
5479 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
5484 PADOFFSET padoff = 0;
5489 PERL_ARGS_ASSERT_NEWFOROP;
5492 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
5493 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
5494 sv->op_type = OP_RV2GV;
5495 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
5497 /* The op_type check is needed to prevent a possible segfault
5498 * if the loop variable is undeclared and 'strict vars' is in
5499 * effect. This is illegal but is nonetheless parsed, so we
5500 * may reach this point with an OP_CONST where we're expecting
5503 if (cUNOPx(sv)->op_first->op_type == OP_GV
5504 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
5505 iterpflags |= OPpITER_DEF;
5507 else if (sv->op_type == OP_PADSV) { /* private variable */
5508 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
5509 padoff = sv->op_targ;
5519 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
5521 SV *const namesv = PAD_COMPNAME_SV(padoff);
5523 const char *const name = SvPV_const(namesv, len);
5525 if (len == 2 && name[0] == '$' && name[1] == '_')
5526 iterpflags |= OPpITER_DEF;
5530 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
5531 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
5532 sv = newGVOP(OP_GV, 0, PL_defgv);
5537 iterpflags |= OPpITER_DEF;
5539 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
5540 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
5541 iterflags |= OPf_STACKED;
5543 else if (expr->op_type == OP_NULL &&
5544 (expr->op_flags & OPf_KIDS) &&
5545 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
5547 /* Basically turn for($x..$y) into the same as for($x,$y), but we
5548 * set the STACKED flag to indicate that these values are to be
5549 * treated as min/max values by 'pp_iterinit'.
5551 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
5552 LOGOP* const range = (LOGOP*) flip->op_first;
5553 OP* const left = range->op_first;
5554 OP* const right = left->op_sibling;
5557 range->op_flags &= ~OPf_KIDS;
5558 range->op_first = NULL;
5560 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
5561 listop->op_first->op_next = range->op_next;
5562 left->op_next = range->op_other;
5563 right->op_next = (OP*)listop;
5564 listop->op_next = listop->op_first;
5567 op_getmad(expr,(OP*)listop,'O');
5571 expr = (OP*)(listop);
5573 iterflags |= OPf_STACKED;
5576 expr = op_lvalue(force_list(expr), OP_GREPSTART);
5579 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
5580 op_append_elem(OP_LIST, expr, scalar(sv))));
5581 assert(!loop->op_next);
5582 /* for my $x () sets OPpLVAL_INTRO;
5583 * for our $x () sets OPpOUR_INTRO */
5584 loop->op_private = (U8)iterpflags;
5585 #ifdef PL_OP_SLAB_ALLOC
5588 NewOp(1234,tmp,1,LOOP);
5589 Copy(loop,tmp,1,LISTOP);
5590 S_op_destroy(aTHX_ (OP*)loop);
5594 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
5596 loop->op_targ = padoff;
5597 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
5599 op_getmad(madsv, (OP*)loop, 'v');
5604 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
5606 Constructs, checks, and returns a loop-exiting op (such as C<goto>
5607 or C<last>). I<type> is the opcode. I<label> supplies the parameter
5608 determining the target of the op; it is consumed by this function and
5609 become part of the constructed op tree.
5615 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
5620 PERL_ARGS_ASSERT_NEWLOOPEX;
5622 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
5624 if (type != OP_GOTO || label->op_type == OP_CONST) {
5625 /* "last()" means "last" */
5626 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
5627 o = newOP(type, OPf_SPECIAL);
5629 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
5630 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
5634 op_getmad(label,o,'L');
5640 /* Check whether it's going to be a goto &function */
5641 if (label->op_type == OP_ENTERSUB
5642 && !(label->op_flags & OPf_STACKED))
5643 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
5644 o = newUNOP(type, OPf_STACKED, label);
5646 PL_hints |= HINT_BLOCK_SCOPE;
5650 /* if the condition is a literal array or hash
5651 (or @{ ... } etc), make a reference to it.
5654 S_ref_array_or_hash(pTHX_ OP *cond)
5657 && (cond->op_type == OP_RV2AV
5658 || cond->op_type == OP_PADAV
5659 || cond->op_type == OP_RV2HV
5660 || cond->op_type == OP_PADHV))
5662 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
5665 && (cond->op_type == OP_ASLICE
5666 || cond->op_type == OP_HSLICE)) {
5668 /* anonlist now needs a list from this op, was previously used in
5670 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
5671 cond->op_flags |= OPf_WANT_LIST;
5673 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
5680 /* These construct the optree fragments representing given()
5683 entergiven and enterwhen are LOGOPs; the op_other pointer
5684 points up to the associated leave op. We need this so we
5685 can put it in the context and make break/continue work.
5686 (Also, of course, pp_enterwhen will jump straight to
5687 op_other if the match fails.)
5691 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
5692 I32 enter_opcode, I32 leave_opcode,
5693 PADOFFSET entertarg)
5699 PERL_ARGS_ASSERT_NEWGIVWHENOP;
5701 NewOp(1101, enterop, 1, LOGOP);
5702 enterop->op_type = (Optype)enter_opcode;
5703 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
5704 enterop->op_flags = (U8) OPf_KIDS;
5705 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
5706 enterop->op_private = 0;
5708 o = newUNOP(leave_opcode, 0, (OP *) enterop);
5711 enterop->op_first = scalar(cond);
5712 cond->op_sibling = block;
5714 o->op_next = LINKLIST(cond);
5715 cond->op_next = (OP *) enterop;
5718 /* This is a default {} block */
5719 enterop->op_first = block;
5720 enterop->op_flags |= OPf_SPECIAL;
5722 o->op_next = (OP *) enterop;
5725 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
5726 entergiven and enterwhen both
5729 enterop->op_next = LINKLIST(block);
5730 block->op_next = enterop->op_other = o;
5735 /* Does this look like a boolean operation? For these purposes
5736 a boolean operation is:
5737 - a subroutine call [*]
5738 - a logical connective
5739 - a comparison operator
5740 - a filetest operator, with the exception of -s -M -A -C
5741 - defined(), exists() or eof()
5742 - /$re/ or $foo =~ /$re/
5744 [*] possibly surprising
5747 S_looks_like_bool(pTHX_ const OP *o)
5751 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
5753 switch(o->op_type) {
5756 return looks_like_bool(cLOGOPo->op_first);
5760 looks_like_bool(cLOGOPo->op_first)
5761 && looks_like_bool(cLOGOPo->op_first->op_sibling));
5766 o->op_flags & OPf_KIDS
5767 && looks_like_bool(cUNOPo->op_first));
5771 case OP_NOT: case OP_XOR:
5773 case OP_EQ: case OP_NE: case OP_LT:
5774 case OP_GT: case OP_LE: case OP_GE:
5776 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
5777 case OP_I_GT: case OP_I_LE: case OP_I_GE:
5779 case OP_SEQ: case OP_SNE: case OP_SLT:
5780 case OP_SGT: case OP_SLE: case OP_SGE:
5784 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
5785 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
5786 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
5787 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
5788 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
5789 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
5790 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
5791 case OP_FTTEXT: case OP_FTBINARY:
5793 case OP_DEFINED: case OP_EXISTS:
5794 case OP_MATCH: case OP_EOF:
5801 /* Detect comparisons that have been optimized away */
5802 if (cSVOPo->op_sv == &PL_sv_yes
5803 || cSVOPo->op_sv == &PL_sv_no)
5816 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
5818 Constructs, checks, and returns an op tree expressing a C<given> block.
5819 I<cond> supplies the expression that will be locally assigned to a lexical
5820 variable, and I<block> supplies the body of the C<given> construct; they
5821 are consumed by this function and become part of the constructed op tree.
5822 I<defsv_off> is the pad offset of the scalar lexical variable that will
5829 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
5832 PERL_ARGS_ASSERT_NEWGIVENOP;
5833 return newGIVWHENOP(
5834 ref_array_or_hash(cond),
5836 OP_ENTERGIVEN, OP_LEAVEGIVEN,
5841 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
5843 Constructs, checks, and returns an op tree expressing a C<when> block.
5844 I<cond> supplies the test expression, and I<block> supplies the block
5845 that will be executed if the test evaluates to true; they are consumed
5846 by this function and become part of the constructed op tree. I<cond>
5847 will be interpreted DWIMically, often as a comparison against C<$_>,
5848 and may be null to generate a C<default> block.
5854 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
5856 const bool cond_llb = (!cond || looks_like_bool(cond));
5859 PERL_ARGS_ASSERT_NEWWHENOP;
5864 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
5866 scalar(ref_array_or_hash(cond)));
5869 return newGIVWHENOP(
5871 op_append_elem(block->op_type, block, newOP(OP_BREAK, OPf_SPECIAL)),
5872 OP_ENTERWHEN, OP_LEAVEWHEN, 0);
5876 =head1 Embedding Functions
5878 =for apidoc cv_undef
5880 Clear out all the active components of a CV. This can happen either
5881 by an explicit C<undef &foo>, or by the reference count going to zero.
5882 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
5883 children can still follow the full lexical scope chain.
5889 Perl_cv_undef(pTHX_ CV *cv)
5893 PERL_ARGS_ASSERT_CV_UNDEF;
5895 DEBUG_X(PerlIO_printf(Perl_debug_log,
5896 "CV undef: cv=0x%"UVxf" comppad=0x%"UVxf"\n",
5897 PTR2UV(cv), PTR2UV(PL_comppad))
5901 if (CvFILE(cv) && !CvISXSUB(cv)) {
5902 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
5903 Safefree(CvFILE(cv));
5908 if (!CvISXSUB(cv) && CvROOT(cv)) {
5909 if (SvTYPE(cv) == SVt_PVCV && CvDEPTH(cv))
5910 Perl_croak(aTHX_ "Can't undef active subroutine");
5913 PAD_SAVE_SETNULLPAD();
5915 op_free(CvROOT(cv));
5920 SvPOK_off(MUTABLE_SV(cv)); /* forget prototype */
5925 /* remove CvOUTSIDE unless this is an undef rather than a free */
5926 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
5927 if (!CvWEAKOUTSIDE(cv))
5928 SvREFCNT_dec(CvOUTSIDE(cv));
5929 CvOUTSIDE(cv) = NULL;
5932 SvREFCNT_dec(MUTABLE_SV(CvXSUBANY(cv).any_ptr));
5935 if (CvISXSUB(cv) && CvXSUB(cv)) {
5938 /* delete all flags except WEAKOUTSIDE and CVGV_RC, which indicate the
5939 * ref status of CvOUTSIDE and CvGV */
5940 CvFLAGS(cv) &= (CVf_WEAKOUTSIDE|CVf_CVGV_RC);
5944 Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p,
5947 PERL_ARGS_ASSERT_CV_CKPROTO_LEN;
5949 /* Can't just use a strcmp on the prototype, as CONSTSUBs "cheat" by
5950 relying on SvCUR, and doubling up the buffer to hold CvFILE(). */
5951 if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */
5952 || (p && (len != SvCUR(cv) /* Not the same length. */
5953 || memNE(p, SvPVX_const(cv), len))))
5954 && ckWARN_d(WARN_PROTOTYPE)) {
5955 SV* const msg = sv_newmortal();
5959 gv_efullname3(name = sv_newmortal(), gv, NULL);
5960 sv_setpvs(msg, "Prototype mismatch:");
5962 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
5964 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv));
5966 sv_catpvs(msg, ": none");
5967 sv_catpvs(msg, " vs ");
5969 Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p);
5971 sv_catpvs(msg, "none");
5972 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
5976 static void const_sv_xsub(pTHX_ CV* cv);
5980 =head1 Optree Manipulation Functions
5982 =for apidoc cv_const_sv
5984 If C<cv> is a constant sub eligible for inlining. returns the constant
5985 value returned by the sub. Otherwise, returns NULL.
5987 Constant subs can be created with C<newCONSTSUB> or as described in
5988 L<perlsub/"Constant Functions">.
5993 Perl_cv_const_sv(pTHX_ const CV *const cv)
5995 PERL_UNUSED_CONTEXT;
5998 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
6000 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6003 /* op_const_sv: examine an optree to determine whether it's in-lineable.
6004 * Can be called in 3 ways:
6007 * look for a single OP_CONST with attached value: return the value
6009 * cv && CvCLONE(cv) && !CvCONST(cv)
6011 * examine the clone prototype, and if contains only a single
6012 * OP_CONST referencing a pad const, or a single PADSV referencing
6013 * an outer lexical, return a non-zero value to indicate the CV is
6014 * a candidate for "constizing" at clone time
6018 * We have just cloned an anon prototype that was marked as a const
6019 * candidiate. Try to grab the current value, and in the case of
6020 * PADSV, ignore it if it has multiple references. Return the value.
6024 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
6035 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
6036 o = cLISTOPo->op_first->op_sibling;
6038 for (; o; o = o->op_next) {
6039 const OPCODE type = o->op_type;
6041 if (sv && o->op_next == o)
6043 if (o->op_next != o) {
6044 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
6046 if (type == OP_DBSTATE)
6049 if (type == OP_LEAVESUB || type == OP_RETURN)
6053 if (type == OP_CONST && cSVOPo->op_sv)
6055 else if (cv && type == OP_CONST) {
6056 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6060 else if (cv && type == OP_PADSV) {
6061 if (CvCONST(cv)) { /* newly cloned anon */
6062 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6063 /* the candidate should have 1 ref from this pad and 1 ref
6064 * from the parent */
6065 if (!sv || SvREFCNT(sv) != 2)
6072 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
6073 sv = &PL_sv_undef; /* an arbitrary non-null value */
6088 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6091 /* This would be the return value, but the return cannot be reached. */
6092 OP* pegop = newOP(OP_NULL, 0);
6095 PERL_UNUSED_ARG(floor);
6105 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
6107 NORETURN_FUNCTION_END;
6112 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
6114 return Perl_newATTRSUB(aTHX_ floor, o, proto, NULL, block);
6118 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6123 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
6124 register CV *cv = NULL;
6126 /* If the subroutine has no body, no attributes, and no builtin attributes
6127 then it's just a sub declaration, and we may be able to get away with
6128 storing with a placeholder scalar in the symbol table, rather than a
6129 full GV and CV. If anything is present then it will take a full CV to
6131 const I32 gv_fetch_flags
6132 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6134 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
6135 const char * const name = o ? SvPV_nolen_const(cSVOPo->op_sv) : NULL;
6139 assert(proto->op_type == OP_CONST);
6140 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
6146 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
6148 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
6149 SV * const sv = sv_newmortal();
6150 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
6151 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
6152 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
6153 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
6155 } else if (PL_curstash) {
6156 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
6159 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
6163 if (!PL_madskills) {
6172 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
6173 maximum a prototype before. */
6174 if (SvTYPE(gv) > SVt_NULL) {
6175 if (!SvPOK((const SV *)gv)
6176 && !(SvIOK((const SV *)gv) && SvIVX((const SV *)gv) == -1))
6178 Perl_ck_warner_d(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
6180 cv_ckproto_len((const CV *)gv, NULL, ps, ps_len);
6183 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
6185 sv_setiv(MUTABLE_SV(gv), -1);
6187 SvREFCNT_dec(PL_compcv);
6188 cv = PL_compcv = NULL;
6192 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
6194 if (!block || !ps || *ps || attrs
6195 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6197 || block->op_type == OP_NULL
6202 const_sv = op_const_sv(block, NULL);
6205 const bool exists = CvROOT(cv) || CvXSUB(cv);
6207 /* if the subroutine doesn't exist and wasn't pre-declared
6208 * with a prototype, assume it will be AUTOLOADed,
6209 * skipping the prototype check
6211 if (exists || SvPOK(cv))
6212 cv_ckproto_len(cv, gv, ps, ps_len);
6213 /* already defined (or promised)? */
6214 if (exists || GvASSUMECV(gv)) {
6217 || block->op_type == OP_NULL
6220 if (CvFLAGS(PL_compcv)) {
6221 /* might have had built-in attrs applied */
6222 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && ckWARN(WARN_MISC))
6223 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
6224 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS & ~CVf_LVALUE);
6226 /* just a "sub foo;" when &foo is already defined */
6227 SAVEFREESV(PL_compcv);
6232 && block->op_type != OP_NULL
6235 if (ckWARN(WARN_REDEFINE)
6237 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
6239 const line_t oldline = CopLINE(PL_curcop);
6240 if (PL_parser && PL_parser->copline != NOLINE)
6241 CopLINE_set(PL_curcop, PL_parser->copline);
6242 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6243 CvCONST(cv) ? "Constant subroutine %s redefined"
6244 : "Subroutine %s redefined", name);
6245 CopLINE_set(PL_curcop, oldline);
6248 if (!PL_minus_c) /* keep old one around for madskills */
6251 /* (PL_madskills unset in used file.) */
6259 SvREFCNT_inc_simple_void_NN(const_sv);
6261 assert(!CvROOT(cv) && !CvCONST(cv));
6262 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
6263 CvXSUBANY(cv).any_ptr = const_sv;
6264 CvXSUB(cv) = const_sv_xsub;
6270 cv = newCONSTSUB(NULL, name, const_sv);
6272 mro_method_changed_in( /* sub Foo::Bar () { 123 } */
6273 (CvGV(cv) && GvSTASH(CvGV(cv)))
6282 SvREFCNT_dec(PL_compcv);
6286 if (cv) { /* must reuse cv if autoloaded */
6287 /* transfer PL_compcv to cv */
6290 && block->op_type != OP_NULL
6293 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
6295 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
6296 if (!CvWEAKOUTSIDE(cv))
6297 SvREFCNT_dec(CvOUTSIDE(cv));
6298 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
6299 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
6300 CvOUTSIDE(PL_compcv) = 0;
6301 CvPADLIST(cv) = CvPADLIST(PL_compcv);
6302 CvPADLIST(PL_compcv) = 0;
6303 /* inner references to PL_compcv must be fixed up ... */
6304 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
6305 if (PERLDB_INTER)/* Advice debugger on the new sub. */
6306 ++PL_sub_generation;
6309 /* Might have had built-in attributes applied -- propagate them. */
6310 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
6312 /* ... before we throw it away */
6313 SvREFCNT_dec(PL_compcv);
6321 if (strEQ(name, "import")) {
6322 PL_formfeed = MUTABLE_SV(cv);
6323 /* diag_listed_as: SKIPME */
6324 Perl_warner(aTHX_ packWARN(WARN_VOID), "0x%"UVxf"\n", PTR2UV(cv));
6328 mro_method_changed_in(GvSTASH(gv)); /* sub Foo::bar { (shift)+1 } */
6333 CvFILE_set_from_cop(cv, PL_curcop);
6334 CvSTASH_set(cv, PL_curstash);
6337 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
6338 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
6339 apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE);
6343 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
6345 if (PL_parser && PL_parser->error_count) {
6349 const char *s = strrchr(name, ':');
6351 if (strEQ(s, "BEGIN")) {
6352 const char not_safe[] =
6353 "BEGIN not safe after errors--compilation aborted";
6354 if (PL_in_eval & EVAL_KEEPERR)
6355 Perl_croak(aTHX_ not_safe);
6357 /* force display of errors found but not reported */
6358 sv_catpv(ERRSV, not_safe);
6359 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
6368 /* If we assign an optree to a PVCV, then we've defined a subroutine that
6369 the debugger could be able to set a breakpoint in, so signal to
6370 pp_entereval that it should not throw away any saved lines at scope
6373 PL_breakable_sub_gen++;
6375 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
6376 op_lvalue(scalarseq(block), OP_LEAVESUBLV));
6377 block->op_attached = 1;
6380 /* This makes sub {}; work as expected. */
6381 if (block->op_type == OP_STUB) {
6382 OP* const newblock = newSTATEOP(0, NULL, 0);
6384 op_getmad(block,newblock,'B');
6391 block->op_attached = 1;
6392 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
6394 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6395 OpREFCNT_set(CvROOT(cv), 1);
6396 CvSTART(cv) = LINKLIST(CvROOT(cv));
6397 CvROOT(cv)->op_next = 0;
6398 CALL_PEEP(CvSTART(cv));
6400 /* now that optimizer has done its work, adjust pad values */
6402 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
6405 assert(!CvCONST(cv));
6406 if (ps && !*ps && op_const_sv(block, cv))
6411 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
6412 SV * const tmpstr = sv_newmortal();
6413 GV * const db_postponed = gv_fetchpvs("DB::postponed",
6414 GV_ADDMULTI, SVt_PVHV);
6416 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
6419 (long)CopLINE(PL_curcop));
6420 gv_efullname3(tmpstr, gv, NULL);
6421 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
6422 SvCUR(tmpstr), sv, 0);
6423 hv = GvHVn(db_postponed);
6424 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) {
6425 CV * const pcv = GvCV(db_postponed);
6431 call_sv(MUTABLE_SV(pcv), G_DISCARD);
6436 if (name && ! (PL_parser && PL_parser->error_count))
6437 process_special_blocks(name, gv, cv);
6442 PL_parser->copline = NOLINE;
6448 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
6451 const char *const colon = strrchr(fullname,':');
6452 const char *const name = colon ? colon + 1 : fullname;
6454 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
6457 if (strEQ(name, "BEGIN")) {
6458 const I32 oldscope = PL_scopestack_ix;
6460 SAVECOPFILE(&PL_compiling);
6461 SAVECOPLINE(&PL_compiling);
6463 DEBUG_x( dump_sub(gv) );
6464 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
6465 GvCV(gv) = 0; /* cv has been hijacked */
6466 call_list(oldscope, PL_beginav);
6468 PL_curcop = &PL_compiling;
6469 CopHINTS_set(&PL_compiling, PL_hints);
6476 if strEQ(name, "END") {
6477 DEBUG_x( dump_sub(gv) );
6478 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
6481 } else if (*name == 'U') {
6482 if (strEQ(name, "UNITCHECK")) {
6483 /* It's never too late to run a unitcheck block */
6484 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
6488 } else if (*name == 'C') {
6489 if (strEQ(name, "CHECK")) {
6491 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
6492 "Too late to run CHECK block");
6493 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
6497 } else if (*name == 'I') {
6498 if (strEQ(name, "INIT")) {
6500 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
6501 "Too late to run INIT block");
6502 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
6508 DEBUG_x( dump_sub(gv) );
6509 GvCV(gv) = 0; /* cv has been hijacked */
6514 =for apidoc newCONSTSUB
6516 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
6517 eligible for inlining at compile-time.
6519 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
6520 which won't be called if used as a destructor, but will suppress the overhead
6521 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
6528 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
6533 const char *const file = CopFILE(PL_curcop);
6535 SV *const temp_sv = CopFILESV(PL_curcop);
6536 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
6541 if (IN_PERL_RUNTIME) {
6542 /* at runtime, it's not safe to manipulate PL_curcop: it may be
6543 * an op shared between threads. Use a non-shared COP for our
6545 SAVEVPTR(PL_curcop);
6546 PL_curcop = &PL_compiling;
6548 SAVECOPLINE(PL_curcop);
6549 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
6552 PL_hints &= ~HINT_BLOCK_SCOPE;
6555 SAVESPTR(PL_curstash);
6556 SAVECOPSTASH(PL_curcop);
6557 PL_curstash = stash;
6558 CopSTASH_set(PL_curcop,stash);
6561 /* file becomes the CvFILE. For an XS, it's supposed to be static storage,
6562 and so doesn't get free()d. (It's expected to be from the C pre-
6563 processor __FILE__ directive). But we need a dynamically allocated one,
6564 and we need it to get freed. */
6565 cv = newXS_flags(name, const_sv_xsub, file ? file : "", "",
6566 XS_DYNAMIC_FILENAME);
6567 CvXSUBANY(cv).any_ptr = sv;
6572 CopSTASH_free(PL_curcop);
6580 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
6581 const char *const filename, const char *const proto,
6584 CV *cv = newXS(name, subaddr, filename);
6586 PERL_ARGS_ASSERT_NEWXS_FLAGS;
6588 if (flags & XS_DYNAMIC_FILENAME) {
6589 /* We need to "make arrangements" (ie cheat) to ensure that the
6590 filename lasts as long as the PVCV we just created, but also doesn't
6592 STRLEN filename_len = strlen(filename);
6593 STRLEN proto_and_file_len = filename_len;
6594 char *proto_and_file;
6598 proto_len = strlen(proto);
6599 proto_and_file_len += proto_len;
6601 Newx(proto_and_file, proto_and_file_len + 1, char);
6602 Copy(proto, proto_and_file, proto_len, char);
6603 Copy(filename, proto_and_file + proto_len, filename_len + 1, char);
6606 proto_and_file = savepvn(filename, filename_len);
6609 /* This gets free()d. :-) */
6610 sv_usepvn_flags(MUTABLE_SV(cv), proto_and_file, proto_and_file_len,
6611 SV_HAS_TRAILING_NUL);
6613 /* This gives us the correct prototype, rather than one with the
6614 file name appended. */
6615 SvCUR_set(cv, proto_len);
6619 CvFILE(cv) = proto_and_file + proto_len;
6621 sv_setpv(MUTABLE_SV(cv), proto);
6627 =for apidoc U||newXS
6629 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
6630 static storage, as it is used directly as CvFILE(), without a copy being made.
6636 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
6639 GV * const gv = gv_fetchpv(name ? name :
6640 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
6641 GV_ADDMULTI, SVt_PVCV);
6644 PERL_ARGS_ASSERT_NEWXS;
6647 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
6649 if ((cv = (name ? GvCV(gv) : NULL))) {
6651 /* just a cached method */
6655 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
6656 /* already defined (or promised) */
6657 /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */
6658 if (ckWARN(WARN_REDEFINE)) {
6659 GV * const gvcv = CvGV(cv);
6661 HV * const stash = GvSTASH(gvcv);
6663 const char *redefined_name = HvNAME_get(stash);
6664 if ( strEQ(redefined_name,"autouse") ) {
6665 const line_t oldline = CopLINE(PL_curcop);
6666 if (PL_parser && PL_parser->copline != NOLINE)
6667 CopLINE_set(PL_curcop, PL_parser->copline);
6668 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6669 CvCONST(cv) ? "Constant subroutine %s redefined"
6670 : "Subroutine %s redefined"
6672 CopLINE_set(PL_curcop, oldline);
6682 if (cv) /* must reuse cv if autoloaded */
6685 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
6689 mro_method_changed_in(GvSTASH(gv)); /* newXS */
6695 (void)gv_fetchfile(filename);
6696 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
6697 an external constant string */
6699 CvXSUB(cv) = subaddr;
6702 process_special_blocks(name, gv, cv);
6712 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
6717 OP* pegop = newOP(OP_NULL, 0);
6721 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
6722 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
6725 if ((cv = GvFORM(gv))) {
6726 if (ckWARN(WARN_REDEFINE)) {
6727 const line_t oldline = CopLINE(PL_curcop);
6728 if (PL_parser && PL_parser->copline != NOLINE)
6729 CopLINE_set(PL_curcop, PL_parser->copline);
6731 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6732 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
6734 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6735 "Format STDOUT redefined");
6737 CopLINE_set(PL_curcop, oldline);
6744 CvFILE_set_from_cop(cv, PL_curcop);
6747 pad_tidy(padtidy_FORMAT);
6748 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
6749 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6750 OpREFCNT_set(CvROOT(cv), 1);
6751 CvSTART(cv) = LINKLIST(CvROOT(cv));
6752 CvROOT(cv)->op_next = 0;
6753 CALL_PEEP(CvSTART(cv));
6755 op_getmad(o,pegop,'n');
6756 op_getmad_weak(block, pegop, 'b');
6761 PL_parser->copline = NOLINE;
6769 Perl_newANONLIST(pTHX_ OP *o)
6771 return convert(OP_ANONLIST, OPf_SPECIAL, o);
6775 Perl_newANONHASH(pTHX_ OP *o)
6777 return convert(OP_ANONHASH, OPf_SPECIAL, o);
6781 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
6783 return newANONATTRSUB(floor, proto, NULL, block);
6787 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
6789 return newUNOP(OP_REFGEN, 0,
6790 newSVOP(OP_ANONCODE, 0,
6791 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
6795 Perl_oopsAV(pTHX_ OP *o)
6799 PERL_ARGS_ASSERT_OOPSAV;
6801 switch (o->op_type) {
6803 o->op_type = OP_PADAV;
6804 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6805 return ref(o, OP_RV2AV);
6808 o->op_type = OP_RV2AV;
6809 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
6814 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
6821 Perl_oopsHV(pTHX_ OP *o)
6825 PERL_ARGS_ASSERT_OOPSHV;
6827 switch (o->op_type) {
6830 o->op_type = OP_PADHV;
6831 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6832 return ref(o, OP_RV2HV);
6836 o->op_type = OP_RV2HV;
6837 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
6842 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
6849 Perl_newAVREF(pTHX_ OP *o)
6853 PERL_ARGS_ASSERT_NEWAVREF;
6855 if (o->op_type == OP_PADANY) {
6856 o->op_type = OP_PADAV;
6857 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6860 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
6861 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6862 "Using an array as a reference is deprecated");
6864 return newUNOP(OP_RV2AV, 0, scalar(o));
6868 Perl_newGVREF(pTHX_ I32 type, OP *o)
6870 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
6871 return newUNOP(OP_NULL, 0, o);
6872 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
6876 Perl_newHVREF(pTHX_ OP *o)
6880 PERL_ARGS_ASSERT_NEWHVREF;
6882 if (o->op_type == OP_PADANY) {
6883 o->op_type = OP_PADHV;
6884 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6887 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
6888 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6889 "Using a hash as a reference is deprecated");
6891 return newUNOP(OP_RV2HV, 0, scalar(o));
6895 Perl_newCVREF(pTHX_ I32 flags, OP *o)
6897 return newUNOP(OP_RV2CV, flags, scalar(o));
6901 Perl_newSVREF(pTHX_ OP *o)
6905 PERL_ARGS_ASSERT_NEWSVREF;
6907 if (o->op_type == OP_PADANY) {
6908 o->op_type = OP_PADSV;
6909 o->op_ppaddr = PL_ppaddr[OP_PADSV];
6912 return newUNOP(OP_RV2SV, 0, scalar(o));
6915 /* Check routines. See the comments at the top of this file for details
6916 * on when these are called */
6919 Perl_ck_anoncode(pTHX_ OP *o)
6921 PERL_ARGS_ASSERT_CK_ANONCODE;
6923 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
6925 cSVOPo->op_sv = NULL;
6930 Perl_ck_bitop(pTHX_ OP *o)
6934 PERL_ARGS_ASSERT_CK_BITOP;
6936 #define OP_IS_NUMCOMPARE(op) \
6937 ((op) == OP_LT || (op) == OP_I_LT || \
6938 (op) == OP_GT || (op) == OP_I_GT || \
6939 (op) == OP_LE || (op) == OP_I_LE || \
6940 (op) == OP_GE || (op) == OP_I_GE || \
6941 (op) == OP_EQ || (op) == OP_I_EQ || \
6942 (op) == OP_NE || (op) == OP_I_NE || \
6943 (op) == OP_NCMP || (op) == OP_I_NCMP)
6944 o->op_private = (U8)(PL_hints & HINT_INTEGER);
6945 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
6946 && (o->op_type == OP_BIT_OR
6947 || o->op_type == OP_BIT_AND
6948 || o->op_type == OP_BIT_XOR))
6950 const OP * const left = cBINOPo->op_first;
6951 const OP * const right = left->op_sibling;
6952 if ((OP_IS_NUMCOMPARE(left->op_type) &&
6953 (left->op_flags & OPf_PARENS) == 0) ||
6954 (OP_IS_NUMCOMPARE(right->op_type) &&
6955 (right->op_flags & OPf_PARENS) == 0))
6956 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
6957 "Possible precedence problem on bitwise %c operator",
6958 o->op_type == OP_BIT_OR ? '|'
6959 : o->op_type == OP_BIT_AND ? '&' : '^'
6966 Perl_ck_concat(pTHX_ OP *o)
6968 const OP * const kid = cUNOPo->op_first;
6970 PERL_ARGS_ASSERT_CK_CONCAT;
6971 PERL_UNUSED_CONTEXT;
6973 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
6974 !(kUNOP->op_first->op_flags & OPf_MOD))
6975 o->op_flags |= OPf_STACKED;
6980 Perl_ck_spair(pTHX_ OP *o)
6984 PERL_ARGS_ASSERT_CK_SPAIR;
6986 if (o->op_flags & OPf_KIDS) {
6989 const OPCODE type = o->op_type;
6990 o = modkids(ck_fun(o), type);
6991 kid = cUNOPo->op_first;
6992 newop = kUNOP->op_first->op_sibling;
6994 const OPCODE type = newop->op_type;
6995 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
6996 type == OP_PADAV || type == OP_PADHV ||
6997 type == OP_RV2AV || type == OP_RV2HV)
7001 op_getmad(kUNOP->op_first,newop,'K');
7003 op_free(kUNOP->op_first);
7005 kUNOP->op_first = newop;
7007 o->op_ppaddr = PL_ppaddr[++o->op_type];
7012 Perl_ck_delete(pTHX_ OP *o)
7014 PERL_ARGS_ASSERT_CK_DELETE;
7018 if (o->op_flags & OPf_KIDS) {
7019 OP * const kid = cUNOPo->op_first;
7020 switch (kid->op_type) {
7022 o->op_flags |= OPf_SPECIAL;
7025 o->op_private |= OPpSLICE;
7028 o->op_flags |= OPf_SPECIAL;
7033 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
7036 if (kid->op_private & OPpLVAL_INTRO)
7037 o->op_private |= OPpLVAL_INTRO;
7044 Perl_ck_die(pTHX_ OP *o)
7046 PERL_ARGS_ASSERT_CK_DIE;
7049 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7055 Perl_ck_eof(pTHX_ OP *o)
7059 PERL_ARGS_ASSERT_CK_EOF;
7061 if (o->op_flags & OPf_KIDS) {
7062 if (cLISTOPo->op_first->op_type == OP_STUB) {
7064 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
7066 op_getmad(o,newop,'O');
7078 Perl_ck_eval(pTHX_ OP *o)
7082 PERL_ARGS_ASSERT_CK_EVAL;
7084 PL_hints |= HINT_BLOCK_SCOPE;
7085 if (o->op_flags & OPf_KIDS) {
7086 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7089 o->op_flags &= ~OPf_KIDS;
7092 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
7098 cUNOPo->op_first = 0;
7103 NewOp(1101, enter, 1, LOGOP);
7104 enter->op_type = OP_ENTERTRY;
7105 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
7106 enter->op_private = 0;
7108 /* establish postfix order */
7109 enter->op_next = (OP*)enter;
7111 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
7112 o->op_type = OP_LEAVETRY;
7113 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
7114 enter->op_other = o;
7115 op_getmad(oldo,o,'O');
7129 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
7130 op_getmad(oldo,o,'O');
7132 o->op_targ = (PADOFFSET)PL_hints;
7133 if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) {
7134 /* Store a copy of %^H that pp_entereval can pick up. */
7135 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
7136 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
7137 cUNOPo->op_first->op_sibling = hhop;
7138 o->op_private |= OPpEVAL_HAS_HH;
7144 Perl_ck_exit(pTHX_ OP *o)
7146 PERL_ARGS_ASSERT_CK_EXIT;
7149 HV * const table = GvHV(PL_hintgv);
7151 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
7152 if (svp && *svp && SvTRUE(*svp))
7153 o->op_private |= OPpEXIT_VMSISH;
7155 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7161 Perl_ck_exec(pTHX_ OP *o)
7163 PERL_ARGS_ASSERT_CK_EXEC;
7165 if (o->op_flags & OPf_STACKED) {
7168 kid = cUNOPo->op_first->op_sibling;
7169 if (kid->op_type == OP_RV2GV)
7178 Perl_ck_exists(pTHX_ OP *o)
7182 PERL_ARGS_ASSERT_CK_EXISTS;
7185 if (o->op_flags & OPf_KIDS) {
7186 OP * const kid = cUNOPo->op_first;
7187 if (kid->op_type == OP_ENTERSUB) {
7188 (void) ref(kid, o->op_type);
7189 if (kid->op_type != OP_RV2CV
7190 && !(PL_parser && PL_parser->error_count))
7191 Perl_croak(aTHX_ "%s argument is not a subroutine name",
7193 o->op_private |= OPpEXISTS_SUB;
7195 else if (kid->op_type == OP_AELEM)
7196 o->op_flags |= OPf_SPECIAL;
7197 else if (kid->op_type != OP_HELEM)
7198 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
7206 Perl_ck_rvconst(pTHX_ register OP *o)
7209 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7211 PERL_ARGS_ASSERT_CK_RVCONST;
7213 o->op_private |= (PL_hints & HINT_STRICT_REFS);
7214 if (o->op_type == OP_RV2CV)
7215 o->op_private &= ~1;
7217 if (kid->op_type == OP_CONST) {
7220 SV * const kidsv = kid->op_sv;
7222 /* Is it a constant from cv_const_sv()? */
7223 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
7224 SV * const rsv = SvRV(kidsv);
7225 const svtype type = SvTYPE(rsv);
7226 const char *badtype = NULL;
7228 switch (o->op_type) {
7230 if (type > SVt_PVMG)
7231 badtype = "a SCALAR";
7234 if (type != SVt_PVAV)
7235 badtype = "an ARRAY";
7238 if (type != SVt_PVHV)
7242 if (type != SVt_PVCV)
7247 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
7250 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
7251 const char *badthing;
7252 switch (o->op_type) {
7254 badthing = "a SCALAR";
7257 badthing = "an ARRAY";
7260 badthing = "a HASH";
7268 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
7269 SVfARG(kidsv), badthing);
7272 * This is a little tricky. We only want to add the symbol if we
7273 * didn't add it in the lexer. Otherwise we get duplicate strict
7274 * warnings. But if we didn't add it in the lexer, we must at
7275 * least pretend like we wanted to add it even if it existed before,
7276 * or we get possible typo warnings. OPpCONST_ENTERED says
7277 * whether the lexer already added THIS instance of this symbol.
7279 iscv = (o->op_type == OP_RV2CV) * 2;
7281 gv = gv_fetchsv(kidsv,
7282 iscv | !(kid->op_private & OPpCONST_ENTERED),
7285 : o->op_type == OP_RV2SV
7287 : o->op_type == OP_RV2AV
7289 : o->op_type == OP_RV2HV
7292 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
7294 kid->op_type = OP_GV;
7295 SvREFCNT_dec(kid->op_sv);
7297 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
7298 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
7299 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
7301 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
7303 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
7305 kid->op_private = 0;
7306 kid->op_ppaddr = PL_ppaddr[OP_GV];
7307 /* FAKE globs in the symbol table cause weird bugs (#77810) */
7315 Perl_ck_ftst(pTHX_ OP *o)
7318 const I32 type = o->op_type;
7320 PERL_ARGS_ASSERT_CK_FTST;
7322 if (o->op_flags & OPf_REF) {
7325 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
7326 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7327 const OPCODE kidtype = kid->op_type;
7329 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
7330 OP * const newop = newGVOP(type, OPf_REF,
7331 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
7333 op_getmad(o,newop,'O');
7339 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
7340 o->op_private |= OPpFT_ACCESS;
7341 if (PL_check[kidtype] == Perl_ck_ftst
7342 && kidtype != OP_STAT && kidtype != OP_LSTAT)
7343 o->op_private |= OPpFT_STACKED;
7351 if (type == OP_FTTTY)
7352 o = newGVOP(type, OPf_REF, PL_stdingv);
7354 o = newUNOP(type, 0, newDEFSVOP());
7355 op_getmad(oldo,o,'O');
7361 Perl_ck_fun(pTHX_ OP *o)
7364 const int type = o->op_type;
7365 register I32 oa = PL_opargs[type] >> OASHIFT;
7367 PERL_ARGS_ASSERT_CK_FUN;
7369 if (o->op_flags & OPf_STACKED) {
7370 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
7373 return no_fh_allowed(o);
7376 if (o->op_flags & OPf_KIDS) {
7377 OP **tokid = &cLISTOPo->op_first;
7378 register OP *kid = cLISTOPo->op_first;
7382 if (kid->op_type == OP_PUSHMARK ||
7383 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
7385 tokid = &kid->op_sibling;
7386 kid = kid->op_sibling;
7388 if (!kid && PL_opargs[type] & OA_DEFGV)
7389 *tokid = kid = newDEFSVOP();
7393 sibl = kid->op_sibling;
7395 if (!sibl && kid->op_type == OP_STUB) {
7402 /* list seen where single (scalar) arg expected? */
7403 if (numargs == 1 && !(oa >> 4)
7404 && kid->op_type == OP_LIST && type != OP_SCALAR)
7406 return too_many_arguments(o,PL_op_desc[type]);
7419 if ((type == OP_PUSH || type == OP_UNSHIFT)
7420 && !kid->op_sibling)
7421 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
7422 "Useless use of %s with no values",
7425 if (kid->op_type == OP_CONST &&
7426 (kid->op_private & OPpCONST_BARE))
7428 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
7429 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
7430 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7431 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
7432 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
7434 op_getmad(kid,newop,'K');
7439 kid->op_sibling = sibl;
7442 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
7443 bad_type(numargs, "array", PL_op_desc[type], kid);
7444 op_lvalue(kid, type);
7447 if (kid->op_type == OP_CONST &&
7448 (kid->op_private & OPpCONST_BARE))
7450 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
7451 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
7452 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7453 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
7454 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
7456 op_getmad(kid,newop,'K');
7461 kid->op_sibling = sibl;
7464 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
7465 bad_type(numargs, "hash", PL_op_desc[type], kid);
7466 op_lvalue(kid, type);
7470 OP * const newop = newUNOP(OP_NULL, 0, kid);
7471 kid->op_sibling = 0;
7473 newop->op_next = newop;
7475 kid->op_sibling = sibl;
7480 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
7481 if (kid->op_type == OP_CONST &&
7482 (kid->op_private & OPpCONST_BARE))
7484 OP * const newop = newGVOP(OP_GV, 0,
7485 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
7486 if (!(o->op_private & 1) && /* if not unop */
7487 kid == cLISTOPo->op_last)
7488 cLISTOPo->op_last = newop;
7490 op_getmad(kid,newop,'K');
7496 else if (kid->op_type == OP_READLINE) {
7497 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
7498 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
7501 I32 flags = OPf_SPECIAL;
7505 /* is this op a FH constructor? */
7506 if (is_handle_constructor(o,numargs)) {
7507 const char *name = NULL;
7511 /* Set a flag to tell rv2gv to vivify
7512 * need to "prove" flag does not mean something
7513 * else already - NI-S 1999/05/07
7516 if (kid->op_type == OP_PADSV) {
7518 = PAD_COMPNAME_SV(kid->op_targ);
7519 name = SvPV_const(namesv, len);
7521 else if (kid->op_type == OP_RV2SV
7522 && kUNOP->op_first->op_type == OP_GV)
7524 GV * const gv = cGVOPx_gv(kUNOP->op_first);
7526 len = GvNAMELEN(gv);
7528 else if (kid->op_type == OP_AELEM
7529 || kid->op_type == OP_HELEM)
7532 OP *op = ((BINOP*)kid)->op_first;
7536 const char * const a =
7537 kid->op_type == OP_AELEM ?
7539 if (((op->op_type == OP_RV2AV) ||
7540 (op->op_type == OP_RV2HV)) &&
7541 (firstop = ((UNOP*)op)->op_first) &&
7542 (firstop->op_type == OP_GV)) {
7543 /* packagevar $a[] or $h{} */
7544 GV * const gv = cGVOPx_gv(firstop);
7552 else if (op->op_type == OP_PADAV
7553 || op->op_type == OP_PADHV) {
7554 /* lexicalvar $a[] or $h{} */
7555 const char * const padname =
7556 PAD_COMPNAME_PV(op->op_targ);
7565 name = SvPV_const(tmpstr, len);
7570 name = "__ANONIO__";
7573 op_lvalue(kid, type);
7577 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
7578 namesv = PAD_SVl(targ);
7579 SvUPGRADE(namesv, SVt_PV);
7581 sv_setpvs(namesv, "$");
7582 sv_catpvn(namesv, name, len);
7585 kid->op_sibling = 0;
7586 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
7587 kid->op_targ = targ;
7588 kid->op_private |= priv;
7590 kid->op_sibling = sibl;
7596 op_lvalue(scalar(kid), type);
7600 tokid = &kid->op_sibling;
7601 kid = kid->op_sibling;
7604 if (kid && kid->op_type != OP_STUB)
7605 return too_many_arguments(o,OP_DESC(o));
7606 o->op_private |= numargs;
7608 /* FIXME - should the numargs move as for the PERL_MAD case? */
7609 o->op_private |= numargs;
7611 return too_many_arguments(o,OP_DESC(o));
7615 else if (PL_opargs[type] & OA_DEFGV) {
7617 OP *newop = newUNOP(type, 0, newDEFSVOP());
7618 op_getmad(o,newop,'O');
7621 /* Ordering of these two is important to keep f_map.t passing. */
7623 return newUNOP(type, 0, newDEFSVOP());
7628 while (oa & OA_OPTIONAL)
7630 if (oa && oa != OA_LIST)
7631 return too_few_arguments(o,OP_DESC(o));
7637 Perl_ck_glob(pTHX_ OP *o)
7642 PERL_ARGS_ASSERT_CK_GLOB;
7645 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
7646 op_append_elem(OP_GLOB, o, newDEFSVOP());
7648 if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
7649 && GvCVu(gv) && GvIMPORTED_CV(gv)))
7651 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7654 #if !defined(PERL_EXTERNAL_GLOB)
7655 /* XXX this can be tightened up and made more failsafe. */
7656 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7659 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
7660 newSVpvs("File::Glob"), NULL, NULL, NULL);
7661 if((glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV))) {
7662 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7663 GvCV(gv) = GvCV(glob_gv);
7664 SvREFCNT_inc_void(MUTABLE_SV(GvCV(gv)));
7665 GvIMPORTED_CV_on(gv);
7669 #endif /* PERL_EXTERNAL_GLOB */
7671 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7672 op_append_elem(OP_GLOB, o,
7673 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
7674 o->op_type = OP_LIST;
7675 o->op_ppaddr = PL_ppaddr[OP_LIST];
7676 cLISTOPo->op_first->op_type = OP_PUSHMARK;
7677 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
7678 cLISTOPo->op_first->op_targ = 0;
7679 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
7680 op_append_elem(OP_LIST, o,
7681 scalar(newUNOP(OP_RV2CV, 0,
7682 newGVOP(OP_GV, 0, gv)))));
7683 o = newUNOP(OP_NULL, 0, ck_subr(o));
7684 o->op_targ = OP_GLOB; /* hint at what it used to be */
7687 gv = newGVgen("main");
7689 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
7695 Perl_ck_grep(pTHX_ OP *o)
7700 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
7703 PERL_ARGS_ASSERT_CK_GREP;
7705 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
7706 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
7708 if (o->op_flags & OPf_STACKED) {
7711 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
7712 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
7713 return no_fh_allowed(o);
7714 for (k = kid; k; k = k->op_next) {
7717 NewOp(1101, gwop, 1, LOGOP);
7718 kid->op_next = (OP*)gwop;
7719 o->op_flags &= ~OPf_STACKED;
7721 kid = cLISTOPo->op_first->op_sibling;
7722 if (type == OP_MAPWHILE)
7727 if (PL_parser && PL_parser->error_count)
7729 kid = cLISTOPo->op_first->op_sibling;
7730 if (kid->op_type != OP_NULL)
7731 Perl_croak(aTHX_ "panic: ck_grep");
7732 kid = kUNOP->op_first;
7735 NewOp(1101, gwop, 1, LOGOP);
7736 gwop->op_type = type;
7737 gwop->op_ppaddr = PL_ppaddr[type];
7738 gwop->op_first = listkids(o);
7739 gwop->op_flags |= OPf_KIDS;
7740 gwop->op_other = LINKLIST(kid);
7741 kid->op_next = (OP*)gwop;
7742 offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
7743 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
7744 o->op_private = gwop->op_private = 0;
7745 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
7748 o->op_private = gwop->op_private = OPpGREP_LEX;
7749 gwop->op_targ = o->op_targ = offset;
7752 kid = cLISTOPo->op_first->op_sibling;
7753 if (!kid || !kid->op_sibling)
7754 return too_few_arguments(o,OP_DESC(o));
7755 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
7756 op_lvalue(kid, OP_GREPSTART);
7762 Perl_ck_index(pTHX_ OP *o)
7764 PERL_ARGS_ASSERT_CK_INDEX;
7766 if (o->op_flags & OPf_KIDS) {
7767 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7769 kid = kid->op_sibling; /* get past "big" */
7770 if (kid && kid->op_type == OP_CONST)
7771 fbm_compile(((SVOP*)kid)->op_sv, 0);
7777 Perl_ck_lfun(pTHX_ OP *o)
7779 const OPCODE type = o->op_type;
7781 PERL_ARGS_ASSERT_CK_LFUN;
7783 return modkids(ck_fun(o), type);
7787 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
7789 PERL_ARGS_ASSERT_CK_DEFINED;
7791 if ((o->op_flags & OPf_KIDS)) {
7792 switch (cUNOPo->op_first->op_type) {
7794 /* This is needed for
7795 if (defined %stash::)
7796 to work. Do not break Tk.
7798 break; /* Globals via GV can be undef */
7800 case OP_AASSIGN: /* Is this a good idea? */
7801 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7802 "defined(@array) is deprecated");
7803 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7804 "\t(Maybe you should just omit the defined()?)\n");
7808 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7809 "defined(%%hash) is deprecated");
7810 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7811 "\t(Maybe you should just omit the defined()?)\n");
7822 Perl_ck_readline(pTHX_ OP *o)
7824 PERL_ARGS_ASSERT_CK_READLINE;
7826 if (!(o->op_flags & OPf_KIDS)) {
7828 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
7830 op_getmad(o,newop,'O');
7840 Perl_ck_rfun(pTHX_ OP *o)
7842 const OPCODE type = o->op_type;
7844 PERL_ARGS_ASSERT_CK_RFUN;
7846 return refkids(ck_fun(o), type);
7850 Perl_ck_listiob(pTHX_ OP *o)
7854 PERL_ARGS_ASSERT_CK_LISTIOB;
7856 kid = cLISTOPo->op_first;
7859 kid = cLISTOPo->op_first;
7861 if (kid->op_type == OP_PUSHMARK)
7862 kid = kid->op_sibling;
7863 if (kid && o->op_flags & OPf_STACKED)
7864 kid = kid->op_sibling;
7865 else if (kid && !kid->op_sibling) { /* print HANDLE; */
7866 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
7867 o->op_flags |= OPf_STACKED; /* make it a filehandle */
7868 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
7869 cLISTOPo->op_first->op_sibling = kid;
7870 cLISTOPo->op_last = kid;
7871 kid = kid->op_sibling;
7876 op_append_elem(o->op_type, o, newDEFSVOP());
7882 Perl_ck_smartmatch(pTHX_ OP *o)
7885 PERL_ARGS_ASSERT_CK_SMARTMATCH;
7886 if (0 == (o->op_flags & OPf_SPECIAL)) {
7887 OP *first = cBINOPo->op_first;
7888 OP *second = first->op_sibling;
7890 /* Implicitly take a reference to an array or hash */
7891 first->op_sibling = NULL;
7892 first = cBINOPo->op_first = ref_array_or_hash(first);
7893 second = first->op_sibling = ref_array_or_hash(second);
7895 /* Implicitly take a reference to a regular expression */
7896 if (first->op_type == OP_MATCH) {
7897 first->op_type = OP_QR;
7898 first->op_ppaddr = PL_ppaddr[OP_QR];
7900 if (second->op_type == OP_MATCH) {
7901 second->op_type = OP_QR;
7902 second->op_ppaddr = PL_ppaddr[OP_QR];
7911 Perl_ck_sassign(pTHX_ OP *o)
7914 OP * const kid = cLISTOPo->op_first;
7916 PERL_ARGS_ASSERT_CK_SASSIGN;
7918 /* has a disposable target? */
7919 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
7920 && !(kid->op_flags & OPf_STACKED)
7921 /* Cannot steal the second time! */
7922 && !(kid->op_private & OPpTARGET_MY)
7923 /* Keep the full thing for madskills */
7927 OP * const kkid = kid->op_sibling;
7929 /* Can just relocate the target. */
7930 if (kkid && kkid->op_type == OP_PADSV
7931 && !(kkid->op_private & OPpLVAL_INTRO))
7933 kid->op_targ = kkid->op_targ;
7935 /* Now we do not need PADSV and SASSIGN. */
7936 kid->op_sibling = o->op_sibling; /* NULL */
7937 cLISTOPo->op_first = NULL;
7940 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
7944 if (kid->op_sibling) {
7945 OP *kkid = kid->op_sibling;
7946 if (kkid->op_type == OP_PADSV
7947 && (kkid->op_private & OPpLVAL_INTRO)
7948 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
7949 const PADOFFSET target = kkid->op_targ;
7950 OP *const other = newOP(OP_PADSV,
7952 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
7953 OP *const first = newOP(OP_NULL, 0);
7954 OP *const nullop = newCONDOP(0, first, o, other);
7955 OP *const condop = first->op_next;
7956 /* hijacking PADSTALE for uninitialized state variables */
7957 SvPADSTALE_on(PAD_SVl(target));
7959 condop->op_type = OP_ONCE;
7960 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
7961 condop->op_targ = target;
7962 other->op_targ = target;
7964 /* Because we change the type of the op here, we will skip the
7965 assinment binop->op_last = binop->op_first->op_sibling; at the
7966 end of Perl_newBINOP(). So need to do it here. */
7967 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
7976 Perl_ck_match(pTHX_ OP *o)
7980 PERL_ARGS_ASSERT_CK_MATCH;
7982 if (o->op_type != OP_QR && PL_compcv) {
7983 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
7984 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
7985 o->op_targ = offset;
7986 o->op_private |= OPpTARGET_MY;
7989 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
7990 o->op_private |= OPpRUNTIME;
7995 Perl_ck_method(pTHX_ OP *o)
7997 OP * const kid = cUNOPo->op_first;
7999 PERL_ARGS_ASSERT_CK_METHOD;
8001 if (kid->op_type == OP_CONST) {
8002 SV* sv = kSVOP->op_sv;
8003 const char * const method = SvPVX_const(sv);
8004 if (!(strchr(method, ':') || strchr(method, '\''))) {
8006 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
8007 sv = newSVpvn_share(method, SvCUR(sv), 0);
8010 kSVOP->op_sv = NULL;
8012 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
8014 op_getmad(o,cmop,'O');
8025 Perl_ck_null(pTHX_ OP *o)
8027 PERL_ARGS_ASSERT_CK_NULL;
8028 PERL_UNUSED_CONTEXT;
8033 Perl_ck_open(pTHX_ OP *o)
8036 HV * const table = GvHV(PL_hintgv);
8038 PERL_ARGS_ASSERT_CK_OPEN;
8041 SV **svp = hv_fetchs(table, "open_IN", FALSE);
8044 const char *d = SvPV_const(*svp, len);
8045 const I32 mode = mode_from_discipline(d, len);
8046 if (mode & O_BINARY)
8047 o->op_private |= OPpOPEN_IN_RAW;
8048 else if (mode & O_TEXT)
8049 o->op_private |= OPpOPEN_IN_CRLF;
8052 svp = hv_fetchs(table, "open_OUT", FALSE);
8055 const char *d = SvPV_const(*svp, len);
8056 const I32 mode = mode_from_discipline(d, len);
8057 if (mode & O_BINARY)
8058 o->op_private |= OPpOPEN_OUT_RAW;
8059 else if (mode & O_TEXT)
8060 o->op_private |= OPpOPEN_OUT_CRLF;
8063 if (o->op_type == OP_BACKTICK) {
8064 if (!(o->op_flags & OPf_KIDS)) {
8065 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
8067 op_getmad(o,newop,'O');
8076 /* In case of three-arg dup open remove strictness
8077 * from the last arg if it is a bareword. */
8078 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
8079 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
8083 if ((last->op_type == OP_CONST) && /* The bareword. */
8084 (last->op_private & OPpCONST_BARE) &&
8085 (last->op_private & OPpCONST_STRICT) &&
8086 (oa = first->op_sibling) && /* The fh. */
8087 (oa = oa->op_sibling) && /* The mode. */
8088 (oa->op_type == OP_CONST) &&
8089 SvPOK(((SVOP*)oa)->op_sv) &&
8090 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
8091 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
8092 (last == oa->op_sibling)) /* The bareword. */
8093 last->op_private &= ~OPpCONST_STRICT;
8099 Perl_ck_repeat(pTHX_ OP *o)
8101 PERL_ARGS_ASSERT_CK_REPEAT;
8103 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
8104 o->op_private |= OPpREPEAT_DOLIST;
8105 cBINOPo->op_first = force_list(cBINOPo->op_first);
8113 Perl_ck_require(pTHX_ OP *o)
8118 PERL_ARGS_ASSERT_CK_REQUIRE;
8120 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
8121 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8123 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
8124 SV * const sv = kid->op_sv;
8125 U32 was_readonly = SvREADONLY(sv);
8132 sv_force_normal_flags(sv, 0);
8133 assert(!SvREADONLY(sv));
8143 for (; s < end; s++) {
8144 if (*s == ':' && s[1] == ':') {
8146 Move(s+2, s+1, end - s - 1, char);
8151 sv_catpvs(sv, ".pm");
8152 SvFLAGS(sv) |= was_readonly;
8156 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
8157 /* handle override, if any */
8158 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
8159 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
8160 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
8161 gv = gvp ? *gvp : NULL;
8165 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8166 OP * const kid = cUNOPo->op_first;
8169 cUNOPo->op_first = 0;
8173 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
8174 op_append_elem(OP_LIST, kid,
8175 scalar(newUNOP(OP_RV2CV, 0,
8178 op_getmad(o,newop,'O');
8182 return scalar(ck_fun(o));
8186 Perl_ck_return(pTHX_ OP *o)
8191 PERL_ARGS_ASSERT_CK_RETURN;
8193 kid = cLISTOPo->op_first->op_sibling;
8194 if (CvLVALUE(PL_compcv)) {
8195 for (; kid; kid = kid->op_sibling)
8196 op_lvalue(kid, OP_LEAVESUBLV);
8198 for (; kid; kid = kid->op_sibling)
8199 if ((kid->op_type == OP_NULL)
8200 && ((kid->op_flags & (OPf_SPECIAL|OPf_KIDS)) == (OPf_SPECIAL|OPf_KIDS))) {
8201 /* This is a do block */
8202 OP *op = kUNOP->op_first;
8203 if (op->op_type == OP_LEAVE && op->op_flags & OPf_KIDS) {
8204 op = cUNOPx(op)->op_first;
8205 assert(op->op_type == OP_ENTER && !(op->op_flags & OPf_SPECIAL));
8206 /* Force the use of the caller's context */
8207 op->op_flags |= OPf_SPECIAL;
8216 Perl_ck_select(pTHX_ OP *o)
8221 PERL_ARGS_ASSERT_CK_SELECT;
8223 if (o->op_flags & OPf_KIDS) {
8224 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8225 if (kid && kid->op_sibling) {
8226 o->op_type = OP_SSELECT;
8227 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
8229 return fold_constants(o);
8233 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8234 if (kid && kid->op_type == OP_RV2GV)
8235 kid->op_private &= ~HINT_STRICT_REFS;
8240 Perl_ck_shift(pTHX_ OP *o)
8243 const I32 type = o->op_type;
8245 PERL_ARGS_ASSERT_CK_SHIFT;
8247 if (!(o->op_flags & OPf_KIDS)) {
8250 if (!CvUNIQUE(PL_compcv)) {
8251 o->op_flags |= OPf_SPECIAL;
8255 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
8258 OP * const oldo = o;
8259 o = newUNOP(type, 0, scalar(argop));
8260 op_getmad(oldo,o,'O');
8265 return newUNOP(type, 0, scalar(argop));
8268 return scalar(modkids(ck_push(o), type));
8272 Perl_ck_sort(pTHX_ OP *o)
8277 PERL_ARGS_ASSERT_CK_SORT;
8279 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
8280 HV * const hinthv = GvHV(PL_hintgv);
8282 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
8284 const I32 sorthints = (I32)SvIV(*svp);
8285 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
8286 o->op_private |= OPpSORT_QSORT;
8287 if ((sorthints & HINT_SORT_STABLE) != 0)
8288 o->op_private |= OPpSORT_STABLE;
8293 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
8295 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8296 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
8298 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
8300 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
8302 if (kid->op_type == OP_SCOPE) {
8306 else if (kid->op_type == OP_LEAVE) {
8307 if (o->op_type == OP_SORT) {
8308 op_null(kid); /* wipe out leave */
8311 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
8312 if (k->op_next == kid)
8314 /* don't descend into loops */
8315 else if (k->op_type == OP_ENTERLOOP
8316 || k->op_type == OP_ENTERITER)
8318 k = cLOOPx(k)->op_lastop;
8323 kid->op_next = 0; /* just disconnect the leave */
8324 k = kLISTOP->op_first;
8329 if (o->op_type == OP_SORT) {
8330 /* provide scalar context for comparison function/block */
8336 o->op_flags |= OPf_SPECIAL;
8338 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
8341 firstkid = firstkid->op_sibling;
8344 /* provide list context for arguments */
8345 if (o->op_type == OP_SORT)
8352 S_simplify_sort(pTHX_ OP *o)
8355 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8361 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
8363 if (!(o->op_flags & OPf_STACKED))
8365 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
8366 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
8367 kid = kUNOP->op_first; /* get past null */
8368 if (kid->op_type != OP_SCOPE)
8370 kid = kLISTOP->op_last; /* get past scope */
8371 switch(kid->op_type) {
8379 k = kid; /* remember this node*/
8380 if (kBINOP->op_first->op_type != OP_RV2SV)
8382 kid = kBINOP->op_first; /* get past cmp */
8383 if (kUNOP->op_first->op_type != OP_GV)
8385 kid = kUNOP->op_first; /* get past rv2sv */
8387 if (GvSTASH(gv) != PL_curstash)
8389 gvname = GvNAME(gv);
8390 if (*gvname == 'a' && gvname[1] == '\0')
8392 else if (*gvname == 'b' && gvname[1] == '\0')
8397 kid = k; /* back to cmp */
8398 if (kBINOP->op_last->op_type != OP_RV2SV)
8400 kid = kBINOP->op_last; /* down to 2nd arg */
8401 if (kUNOP->op_first->op_type != OP_GV)
8403 kid = kUNOP->op_first; /* get past rv2sv */
8405 if (GvSTASH(gv) != PL_curstash)
8407 gvname = GvNAME(gv);
8409 ? !(*gvname == 'a' && gvname[1] == '\0')
8410 : !(*gvname == 'b' && gvname[1] == '\0'))
8412 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
8414 o->op_private |= OPpSORT_DESCEND;
8415 if (k->op_type == OP_NCMP)
8416 o->op_private |= OPpSORT_NUMERIC;
8417 if (k->op_type == OP_I_NCMP)
8418 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
8419 kid = cLISTOPo->op_first->op_sibling;
8420 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
8422 op_getmad(kid,o,'S'); /* then delete it */
8424 op_free(kid); /* then delete it */
8429 Perl_ck_split(pTHX_ OP *o)
8434 PERL_ARGS_ASSERT_CK_SPLIT;
8436 if (o->op_flags & OPf_STACKED)
8437 return no_fh_allowed(o);
8439 kid = cLISTOPo->op_first;
8440 if (kid->op_type != OP_NULL)
8441 Perl_croak(aTHX_ "panic: ck_split");
8442 kid = kid->op_sibling;
8443 op_free(cLISTOPo->op_first);
8444 cLISTOPo->op_first = kid;
8446 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
8447 cLISTOPo->op_last = kid; /* There was only one element previously */
8450 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
8451 OP * const sibl = kid->op_sibling;
8452 kid->op_sibling = 0;
8453 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
8454 if (cLISTOPo->op_first == cLISTOPo->op_last)
8455 cLISTOPo->op_last = kid;
8456 cLISTOPo->op_first = kid;
8457 kid->op_sibling = sibl;
8460 kid->op_type = OP_PUSHRE;
8461 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
8463 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
8464 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
8465 "Use of /g modifier is meaningless in split");
8468 if (!kid->op_sibling)
8469 op_append_elem(OP_SPLIT, o, newDEFSVOP());
8471 kid = kid->op_sibling;
8474 if (!kid->op_sibling)
8475 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
8476 assert(kid->op_sibling);
8478 kid = kid->op_sibling;
8481 if (kid->op_sibling)
8482 return too_many_arguments(o,OP_DESC(o));
8488 Perl_ck_join(pTHX_ OP *o)
8490 const OP * const kid = cLISTOPo->op_first->op_sibling;
8492 PERL_ARGS_ASSERT_CK_JOIN;
8494 if (kid && kid->op_type == OP_MATCH) {
8495 if (ckWARN(WARN_SYNTAX)) {
8496 const REGEXP *re = PM_GETRE(kPMOP);
8497 const char *pmstr = re ? RX_PRECOMP_const(re) : "STRING";
8498 const STRLEN len = re ? RX_PRELEN(re) : 6;
8499 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
8500 "/%.*s/ should probably be written as \"%.*s\"",
8501 (int)len, pmstr, (int)len, pmstr);
8508 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
8510 Examines an op, which is expected to identify a subroutine at runtime,
8511 and attempts to determine at compile time which subroutine it identifies.
8512 This is normally used during Perl compilation to determine whether
8513 a prototype can be applied to a function call. I<cvop> is the op
8514 being considered, normally an C<rv2cv> op. A pointer to the identified
8515 subroutine is returned, if it could be determined statically, and a null
8516 pointer is returned if it was not possible to determine statically.
8518 Currently, the subroutine can be identified statically if the RV that the
8519 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
8520 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
8521 suitable if the constant value must be an RV pointing to a CV. Details of
8522 this process may change in future versions of Perl. If the C<rv2cv> op
8523 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
8524 the subroutine statically: this flag is used to suppress compile-time
8525 magic on a subroutine call, forcing it to use default runtime behaviour.
8527 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
8528 of a GV reference is modified. If a GV was examined and its CV slot was
8529 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
8530 If the op is not optimised away, and the CV slot is later populated with
8531 a subroutine having a prototype, that flag eventually triggers the warning
8532 "called too early to check prototype".
8534 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
8535 of returning a pointer to the subroutine it returns a pointer to the
8536 GV giving the most appropriate name for the subroutine in this context.
8537 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
8538 (C<CvANON>) subroutine that is referenced through a GV it will be the
8539 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
8540 A null pointer is returned as usual if there is no statically-determinable
8547 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
8552 PERL_ARGS_ASSERT_RV2CV_OP_CV;
8553 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
8554 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
8555 if (cvop->op_type != OP_RV2CV)
8557 if (cvop->op_private & OPpENTERSUB_AMPER)
8559 if (!(cvop->op_flags & OPf_KIDS))
8561 rvop = cUNOPx(cvop)->op_first;
8562 switch (rvop->op_type) {
8564 gv = cGVOPx_gv(rvop);
8567 if (flags & RV2CVOPCV_MARK_EARLY)
8568 rvop->op_private |= OPpEARLY_CV;
8573 SV *rv = cSVOPx_sv(rvop);
8583 if (SvTYPE((SV*)cv) != SVt_PVCV)
8585 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
8586 if (!CvANON(cv) || !gv)
8595 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
8597 Performs the default fixup of the arguments part of an C<entersub>
8598 op tree. This consists of applying list context to each of the
8599 argument ops. This is the standard treatment used on a call marked
8600 with C<&>, or a method call, or a call through a subroutine reference,
8601 or any other call where the callee can't be identified at compile time,
8602 or a call where the callee has no prototype.
8608 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
8611 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
8612 aop = cUNOPx(entersubop)->op_first;
8613 if (!aop->op_sibling)
8614 aop = cUNOPx(aop)->op_first;
8615 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
8616 if (!(PL_madskills && aop->op_type == OP_STUB)) {
8618 op_lvalue(aop, OP_ENTERSUB);
8625 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
8627 Performs the fixup of the arguments part of an C<entersub> op tree
8628 based on a subroutine prototype. This makes various modifications to
8629 the argument ops, from applying context up to inserting C<refgen> ops,
8630 and checking the number and syntactic types of arguments, as directed by
8631 the prototype. This is the standard treatment used on a subroutine call,
8632 not marked with C<&>, where the callee can be identified at compile time
8633 and has a prototype.
8635 I<protosv> supplies the subroutine prototype to be applied to the call.
8636 It may be a normal defined scalar, of which the string value will be used.
8637 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
8638 that has been cast to C<SV*>) which has a prototype. The prototype
8639 supplied, in whichever form, does not need to match the actual callee
8640 referenced by the op tree.
8642 If the argument ops disagree with the prototype, for example by having
8643 an unacceptable number of arguments, a valid op tree is returned anyway.
8644 The error is reflected in the parser state, normally resulting in a single
8645 exception at the top level of parsing which covers all the compilation
8646 errors that occurred. In the error message, the callee is referred to
8647 by the name defined by the I<namegv> parameter.
8653 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
8656 const char *proto, *proto_end;
8657 OP *aop, *prev, *cvop;
8660 I32 contextclass = 0;
8661 const char *e = NULL;
8662 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
8663 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
8664 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto");
8665 proto = SvPV(protosv, proto_len);
8666 proto_end = proto + proto_len;
8667 aop = cUNOPx(entersubop)->op_first;
8668 if (!aop->op_sibling)
8669 aop = cUNOPx(aop)->op_first;
8671 aop = aop->op_sibling;
8672 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
8673 while (aop != cvop) {
8675 if (PL_madskills && aop->op_type == OP_STUB) {
8676 aop = aop->op_sibling;
8679 if (PL_madskills && aop->op_type == OP_NULL)
8680 o3 = ((UNOP*)aop)->op_first;
8684 if (proto >= proto_end)
8685 return too_many_arguments(entersubop, gv_ename(namegv));
8693 /* _ must be at the end */
8694 if (proto[1] && proto[1] != ';')
8709 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
8711 arg == 1 ? "block or sub {}" : "sub {}",
8712 gv_ename(namegv), o3);
8715 /* '*' allows any scalar type, including bareword */
8718 if (o3->op_type == OP_RV2GV)
8719 goto wrapref; /* autoconvert GLOB -> GLOBref */
8720 else if (o3->op_type == OP_CONST)
8721 o3->op_private &= ~OPpCONST_STRICT;
8722 else if (o3->op_type == OP_ENTERSUB) {
8723 /* accidental subroutine, revert to bareword */
8724 OP *gvop = ((UNOP*)o3)->op_first;
8725 if (gvop && gvop->op_type == OP_NULL) {
8726 gvop = ((UNOP*)gvop)->op_first;
8728 for (; gvop->op_sibling; gvop = gvop->op_sibling)
8731 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
8732 (gvop = ((UNOP*)gvop)->op_first) &&
8733 gvop->op_type == OP_GV)
8735 GV * const gv = cGVOPx_gv(gvop);
8736 OP * const sibling = aop->op_sibling;
8737 SV * const n = newSVpvs("");
8739 OP * const oldaop = aop;
8743 gv_fullname4(n, gv, "", FALSE);
8744 aop = newSVOP(OP_CONST, 0, n);
8745 op_getmad(oldaop,aop,'O');
8746 prev->op_sibling = aop;
8747 aop->op_sibling = sibling;
8757 if (o3->op_type == OP_RV2AV ||
8758 o3->op_type == OP_PADAV ||
8759 o3->op_type == OP_RV2HV ||
8760 o3->op_type == OP_PADHV
8775 if (contextclass++ == 0) {
8776 e = strchr(proto, ']');
8777 if (!e || e == proto)
8786 const char *p = proto;
8787 const char *const end = proto;
8789 while (*--p != '[') {}
8790 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
8792 gv_ename(namegv), o3);
8797 if (o3->op_type == OP_RV2GV)
8800 bad_type(arg, "symbol", gv_ename(namegv), o3);
8803 if (o3->op_type == OP_ENTERSUB)
8806 bad_type(arg, "subroutine entry", gv_ename(namegv),
8810 if (o3->op_type == OP_RV2SV ||
8811 o3->op_type == OP_PADSV ||
8812 o3->op_type == OP_HELEM ||
8813 o3->op_type == OP_AELEM)
8816 bad_type(arg, "scalar", gv_ename(namegv), o3);
8819 if (o3->op_type == OP_RV2AV ||
8820 o3->op_type == OP_PADAV)
8823 bad_type(arg, "array", gv_ename(namegv), o3);
8826 if (o3->op_type == OP_RV2HV ||
8827 o3->op_type == OP_PADHV)
8830 bad_type(arg, "hash", gv_ename(namegv), o3);
8834 OP* const kid = aop;
8835 OP* const sib = kid->op_sibling;
8836 kid->op_sibling = 0;
8837 aop = newUNOP(OP_REFGEN, 0, kid);
8838 aop->op_sibling = sib;
8839 prev->op_sibling = aop;
8841 if (contextclass && e) {
8856 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
8857 gv_ename(namegv), SVfARG(protosv));
8860 op_lvalue(aop, OP_ENTERSUB);
8862 aop = aop->op_sibling;
8864 if (aop == cvop && *proto == '_') {
8865 /* generate an access to $_ */
8867 aop->op_sibling = prev->op_sibling;
8868 prev->op_sibling = aop; /* instead of cvop */
8870 if (!optional && proto_end > proto &&
8871 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
8872 return too_few_arguments(entersubop, gv_ename(namegv));
8877 =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv
8879 Performs the fixup of the arguments part of an C<entersub> op tree either
8880 based on a subroutine prototype or using default list-context processing.
8881 This is the standard treatment used on a subroutine call, not marked
8882 with C<&>, where the callee can be identified at compile time.
8884 I<protosv> supplies the subroutine prototype to be applied to the call,
8885 or indicates that there is no prototype. It may be a normal scalar,
8886 in which case if it is defined then the string value will be used
8887 as a prototype, and if it is undefined then there is no prototype.
8888 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
8889 that has been cast to C<SV*>), of which the prototype will be used if it
8890 has one. The prototype (or lack thereof) supplied, in whichever form,
8891 does not need to match the actual callee referenced by the op tree.
8893 If the argument ops disagree with the prototype, for example by having
8894 an unacceptable number of arguments, a valid op tree is returned anyway.
8895 The error is reflected in the parser state, normally resulting in a single
8896 exception at the top level of parsing which covers all the compilation
8897 errors that occurred. In the error message, the callee is referred to
8898 by the name defined by the I<namegv> parameter.
8904 Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop,
8905 GV *namegv, SV *protosv)
8907 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST;
8908 if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv))
8909 return ck_entersub_args_proto(entersubop, namegv, protosv);
8911 return ck_entersub_args_list(entersubop);
8915 =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p
8917 Retrieves the function that will be used to fix up a call to I<cv>.
8918 Specifically, the function is applied to an C<entersub> op tree for a
8919 subroutine call, not marked with C<&>, where the callee can be identified
8920 at compile time as I<cv>.
8922 The C-level function pointer is returned in I<*ckfun_p>, and an SV
8923 argument for it is returned in I<*ckobj_p>. The function is intended
8924 to be called in this manner:
8926 entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p));
8928 In this call, I<entersubop> is a pointer to the C<entersub> op,
8929 which may be replaced by the check function, and I<namegv> is a GV
8930 supplying the name that should be used by the check function to refer
8931 to the callee of the C<entersub> op if it needs to emit any diagnostics.
8932 It is permitted to apply the check function in non-standard situations,
8933 such as to a call to a different subroutine or to a method call.
8935 By default, the function is
8936 L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>,
8937 and the SV parameter is I<cv> itself. This implements standard
8938 prototype processing. It can be changed, for a particular subroutine,
8939 by L</cv_set_call_checker>.
8945 Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p)
8948 PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER;
8949 callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL;
8951 *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr);
8952 *ckobj_p = callmg->mg_obj;
8954 *ckfun_p = Perl_ck_entersub_args_proto_or_list;
8960 =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj
8962 Sets the function that will be used to fix up a call to I<cv>.
8963 Specifically, the function is applied to an C<entersub> op tree for a
8964 subroutine call, not marked with C<&>, where the callee can be identified
8965 at compile time as I<cv>.
8967 The C-level function pointer is supplied in I<ckfun>, and an SV argument
8968 for it is supplied in I<ckobj>. The function is intended to be called
8971 entersubop = ckfun(aTHX_ entersubop, namegv, ckobj);
8973 In this call, I<entersubop> is a pointer to the C<entersub> op,
8974 which may be replaced by the check function, and I<namegv> is a GV
8975 supplying the name that should be used by the check function to refer
8976 to the callee of the C<entersub> op if it needs to emit any diagnostics.
8977 It is permitted to apply the check function in non-standard situations,
8978 such as to a call to a different subroutine or to a method call.
8980 The current setting for a particular CV can be retrieved by
8981 L</cv_get_call_checker>.
8987 Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj)
8989 PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER;
8990 if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) {
8991 if (SvMAGICAL((SV*)cv))
8992 mg_free_type((SV*)cv, PERL_MAGIC_checkcall);
8995 sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0);
8996 callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall);
8997 if (callmg->mg_flags & MGf_REFCOUNTED) {
8998 SvREFCNT_dec(callmg->mg_obj);
8999 callmg->mg_flags &= ~MGf_REFCOUNTED;
9001 callmg->mg_ptr = FPTR2DPTR(char *, ckfun);
9002 callmg->mg_obj = ckobj;
9003 if (ckobj != (SV*)cv) {
9004 SvREFCNT_inc_simple_void_NN(ckobj);
9005 callmg->mg_flags |= MGf_REFCOUNTED;
9011 Perl_ck_subr(pTHX_ OP *o)
9017 PERL_ARGS_ASSERT_CK_SUBR;
9019 aop = cUNOPx(o)->op_first;
9020 if (!aop->op_sibling)
9021 aop = cUNOPx(aop)->op_first;
9022 aop = aop->op_sibling;
9023 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9024 cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY);
9025 namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL;
9027 o->op_private |= OPpENTERSUB_HASTARG;
9028 o->op_private |= (PL_hints & HINT_STRICT_REFS);
9029 if (PERLDB_SUB && PL_curstash != PL_debstash)
9030 o->op_private |= OPpENTERSUB_DB;
9031 if (cvop->op_type == OP_RV2CV) {
9032 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
9034 } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
9035 if (aop->op_type == OP_CONST)
9036 aop->op_private &= ~OPpCONST_STRICT;
9037 else if (aop->op_type == OP_LIST) {
9038 OP * const sib = ((UNOP*)aop)->op_first->op_sibling;
9039 if (sib && sib->op_type == OP_CONST)
9040 sib->op_private &= ~OPpCONST_STRICT;
9045 return ck_entersub_args_list(o);
9047 Perl_call_checker ckfun;
9049 cv_get_call_checker(cv, &ckfun, &ckobj);
9050 return ckfun(aTHX_ o, namegv, ckobj);
9055 Perl_ck_svconst(pTHX_ OP *o)
9057 PERL_ARGS_ASSERT_CK_SVCONST;
9058 PERL_UNUSED_CONTEXT;
9059 SvREADONLY_on(cSVOPo->op_sv);
9064 Perl_ck_chdir(pTHX_ OP *o)
9066 PERL_ARGS_ASSERT_CK_CHDIR;
9067 if (o->op_flags & OPf_KIDS) {
9068 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9070 if (kid && kid->op_type == OP_CONST &&
9071 (kid->op_private & OPpCONST_BARE))
9073 o->op_flags |= OPf_SPECIAL;
9074 kid->op_private &= ~OPpCONST_STRICT;
9081 Perl_ck_trunc(pTHX_ OP *o)
9083 PERL_ARGS_ASSERT_CK_TRUNC;
9085 if (o->op_flags & OPf_KIDS) {
9086 SVOP *kid = (SVOP*)cUNOPo->op_first;
9088 if (kid->op_type == OP_NULL)
9089 kid = (SVOP*)kid->op_sibling;
9090 if (kid && kid->op_type == OP_CONST &&
9091 (kid->op_private & OPpCONST_BARE))
9093 o->op_flags |= OPf_SPECIAL;
9094 kid->op_private &= ~OPpCONST_STRICT;
9101 Perl_ck_unpack(pTHX_ OP *o)
9103 OP *kid = cLISTOPo->op_first;
9105 PERL_ARGS_ASSERT_CK_UNPACK;
9107 if (kid->op_sibling) {
9108 kid = kid->op_sibling;
9109 if (!kid->op_sibling)
9110 kid->op_sibling = newDEFSVOP();
9116 Perl_ck_substr(pTHX_ OP *o)
9118 PERL_ARGS_ASSERT_CK_SUBSTR;
9121 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
9122 OP *kid = cLISTOPo->op_first;
9124 if (kid->op_type == OP_NULL)
9125 kid = kid->op_sibling;
9127 kid->op_flags |= OPf_MOD;
9134 Perl_ck_push(pTHX_ OP *o)
9137 OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
9141 PERL_ARGS_ASSERT_CK_PUSH;
9143 /* If 1st kid is pushmark (e.g. push, unshift, splice), we need 2nd kid */
9145 cursor = kid->op_type == OP_PUSHMARK ? kid->op_sibling : kid;
9148 /* If not array or array deref, wrap it with an array deref.
9149 * For OP_CONST, we only wrap arrayrefs */
9151 if ( ( cursor->op_type != OP_PADAV
9152 && cursor->op_type != OP_RV2AV
9153 && cursor->op_type != OP_CONST
9156 ( cursor->op_type == OP_CONST
9157 && SvROK(cSVOPx_sv(cursor))
9158 && SvTYPE(SvRV(cSVOPx_sv(cursor))) == SVt_PVAV
9161 proxy = newAVREF(cursor);
9162 if ( cursor == kid ) {
9163 cLISTOPx(o)->op_first = proxy;
9166 cLISTOPx(kid)->op_sibling = proxy;
9168 cLISTOPx(proxy)->op_sibling = cLISTOPx(cursor)->op_sibling;
9169 cLISTOPx(cursor)->op_sibling = NULL;
9176 Perl_ck_each(pTHX_ OP *o)
9179 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
9180 const unsigned orig_type = o->op_type;
9181 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
9182 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
9183 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
9184 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
9186 PERL_ARGS_ASSERT_CK_EACH;
9189 switch (kid->op_type) {
9195 CHANGE_TYPE(o, array_type);
9198 if (kid->op_private == OPpCONST_BARE)
9199 /* we let ck_fun treat as hash */
9202 CHANGE_TYPE(o, ref_type);
9205 /* if treating as a reference, defer additional checks to runtime */
9206 return o->op_type == ref_type ? o : ck_fun(o);
9209 /* caller is supposed to assign the return to the
9210 container of the rep_op var */
9212 S_opt_scalarhv(pTHX_ OP *rep_op) {
9216 PERL_ARGS_ASSERT_OPT_SCALARHV;
9218 NewOp(1101, unop, 1, UNOP);
9219 unop->op_type = (OPCODE)OP_BOOLKEYS;
9220 unop->op_ppaddr = PL_ppaddr[OP_BOOLKEYS];
9221 unop->op_flags = (U8)(OPf_WANT_SCALAR | OPf_KIDS );
9222 unop->op_private = (U8)(1 | ((OPf_WANT_SCALAR | OPf_KIDS) >> 8));
9223 unop->op_first = rep_op;
9224 unop->op_next = rep_op->op_next;
9225 rep_op->op_next = (OP*)unop;
9226 rep_op->op_flags|=(OPf_REF | OPf_MOD);
9227 unop->op_sibling = rep_op->op_sibling;
9228 rep_op->op_sibling = NULL;
9229 /* unop->op_targ = pad_alloc(OP_BOOLKEYS, SVs_PADTMP); */
9230 if (rep_op->op_type == OP_PADHV) {
9231 rep_op->op_flags &= ~OPf_WANT_SCALAR;
9232 rep_op->op_flags |= OPf_WANT_LIST;
9237 /* Checks if o acts as an in-place operator on an array. oright points to the
9238 * beginning of the right-hand side. Returns the left-hand side of the
9239 * assignment if o acts in-place, or NULL otherwise. */
9242 S_is_inplace_av(pTHX_ OP *o, OP *oright) {
9246 PERL_ARGS_ASSERT_IS_INPLACE_AV;
9249 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
9250 || oright->op_next != o
9251 || (oright->op_private & OPpLVAL_INTRO)
9255 /* o2 follows the chain of op_nexts through the LHS of the
9256 * assign (if any) to the aassign op itself */
9258 if (!o2 || o2->op_type != OP_NULL)
9261 if (!o2 || o2->op_type != OP_PUSHMARK)
9264 if (o2 && o2->op_type == OP_GV)
9267 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
9268 || (o2->op_private & OPpLVAL_INTRO)
9273 if (!o2 || o2->op_type != OP_NULL)
9276 if (!o2 || o2->op_type != OP_AASSIGN
9277 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
9280 /* check that the sort is the first arg on RHS of assign */
9282 o2 = cUNOPx(o2)->op_first;
9283 if (!o2 || o2->op_type != OP_NULL)
9285 o2 = cUNOPx(o2)->op_first;
9286 if (!o2 || o2->op_type != OP_PUSHMARK)
9288 if (o2->op_sibling != o)
9291 /* check the array is the same on both sides */
9292 if (oleft->op_type == OP_RV2AV) {
9293 if (oright->op_type != OP_RV2AV
9294 || !cUNOPx(oright)->op_first
9295 || cUNOPx(oright)->op_first->op_type != OP_GV
9296 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
9297 cGVOPx_gv(cUNOPx(oright)->op_first)
9301 else if (oright->op_type != OP_PADAV
9302 || oright->op_targ != oleft->op_targ
9309 /* A peephole optimizer. We visit the ops in the order they're to execute.
9310 * See the comments at the top of this file for more details about when
9311 * peep() is called */
9314 Perl_rpeep(pTHX_ register OP *o)
9317 register OP* oldop = NULL;
9319 if (!o || o->op_opt)
9323 SAVEVPTR(PL_curcop);
9324 for (; o; o = o->op_next) {
9327 /* By default, this op has now been optimised. A couple of cases below
9328 clear this again. */
9331 switch (o->op_type) {
9333 PL_curcop = ((COP*)o); /* for warnings */
9336 PL_curcop = ((COP*)o); /* for warnings */
9338 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
9339 to carry two labels. For now, take the easier option, and skip
9340 this optimisation if the first NEXTSTATE has a label. */
9341 if (!CopLABEL((COP*)o)) {
9342 OP *nextop = o->op_next;
9343 while (nextop && nextop->op_type == OP_NULL)
9344 nextop = nextop->op_next;
9346 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
9347 COP *firstcop = (COP *)o;
9348 COP *secondcop = (COP *)nextop;
9349 /* We want the COP pointed to by o (and anything else) to
9350 become the next COP down the line. */
9353 firstcop->op_next = secondcop->op_next;
9355 /* Now steal all its pointers, and duplicate the other
9357 firstcop->cop_line = secondcop->cop_line;
9359 firstcop->cop_stashpv = secondcop->cop_stashpv;
9360 firstcop->cop_file = secondcop->cop_file;
9362 firstcop->cop_stash = secondcop->cop_stash;
9363 firstcop->cop_filegv = secondcop->cop_filegv;
9365 firstcop->cop_hints = secondcop->cop_hints;
9366 firstcop->cop_seq = secondcop->cop_seq;
9367 firstcop->cop_warnings = secondcop->cop_warnings;
9368 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
9371 secondcop->cop_stashpv = NULL;
9372 secondcop->cop_file = NULL;
9374 secondcop->cop_stash = NULL;
9375 secondcop->cop_filegv = NULL;
9377 secondcop->cop_warnings = NULL;
9378 secondcop->cop_hints_hash = NULL;
9380 /* If we use op_null(), and hence leave an ex-COP, some
9381 warnings are misreported. For example, the compile-time
9382 error in 'use strict; no strict refs;' */
9383 secondcop->op_type = OP_NULL;
9384 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
9390 if (cSVOPo->op_private & OPpCONST_STRICT)
9391 no_bareword_allowed(o);
9394 case OP_METHOD_NAMED:
9395 /* Relocate sv to the pad for thread safety.
9396 * Despite being a "constant", the SV is written to,
9397 * for reference counts, sv_upgrade() etc. */
9399 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
9400 if (o->op_type != OP_METHOD_NAMED && SvPADTMP(cSVOPo->op_sv)) {
9401 /* If op_sv is already a PADTMP then it is being used by
9402 * some pad, so make a copy. */
9403 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
9404 SvREADONLY_on(PAD_SVl(ix));
9405 SvREFCNT_dec(cSVOPo->op_sv);
9407 else if (o->op_type != OP_METHOD_NAMED
9408 && cSVOPo->op_sv == &PL_sv_undef) {
9409 /* PL_sv_undef is hack - it's unsafe to store it in the
9410 AV that is the pad, because av_fetch treats values of
9411 PL_sv_undef as a "free" AV entry and will merrily
9412 replace them with a new SV, causing pad_alloc to think
9413 that this pad slot is free. (When, clearly, it is not)
9415 SvOK_off(PAD_SVl(ix));
9416 SvPADTMP_on(PAD_SVl(ix));
9417 SvREADONLY_on(PAD_SVl(ix));
9420 SvREFCNT_dec(PAD_SVl(ix));
9421 SvPADTMP_on(cSVOPo->op_sv);
9422 PAD_SETSV(ix, cSVOPo->op_sv);
9423 /* XXX I don't know how this isn't readonly already. */
9424 SvREADONLY_on(PAD_SVl(ix));
9426 cSVOPo->op_sv = NULL;
9433 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
9434 if (o->op_next->op_private & OPpTARGET_MY) {
9435 if (o->op_flags & OPf_STACKED) /* chained concats */
9436 break; /* ignore_optimization */
9438 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
9439 o->op_targ = o->op_next->op_targ;
9440 o->op_next->op_targ = 0;
9441 o->op_private |= OPpTARGET_MY;
9444 op_null(o->op_next);
9448 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
9449 break; /* Scalar stub must produce undef. List stub is noop */
9453 if (o->op_targ == OP_NEXTSTATE
9454 || o->op_targ == OP_DBSTATE)
9456 PL_curcop = ((COP*)o);
9458 /* XXX: We avoid setting op_seq here to prevent later calls
9459 to rpeep() from mistakenly concluding that optimisation
9460 has already occurred. This doesn't fix the real problem,
9461 though (See 20010220.007). AMS 20010719 */
9462 /* op_seq functionality is now replaced by op_opt */
9469 if (oldop && o->op_next) {
9470 oldop->op_next = o->op_next;
9478 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
9479 OP* const pop = (o->op_type == OP_PADAV) ?
9480 o->op_next : o->op_next->op_next;
9482 if (pop && pop->op_type == OP_CONST &&
9483 ((PL_op = pop->op_next)) &&
9484 pop->op_next->op_type == OP_AELEM &&
9485 !(pop->op_next->op_private &
9486 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
9487 (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop))
9492 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
9493 no_bareword_allowed(pop);
9494 if (o->op_type == OP_GV)
9495 op_null(o->op_next);
9496 op_null(pop->op_next);
9498 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
9499 o->op_next = pop->op_next->op_next;
9500 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
9501 o->op_private = (U8)i;
9502 if (o->op_type == OP_GV) {
9507 o->op_flags |= OPf_SPECIAL;
9508 o->op_type = OP_AELEMFAST;
9513 if (o->op_next->op_type == OP_RV2SV) {
9514 if (!(o->op_next->op_private & OPpDEREF)) {
9515 op_null(o->op_next);
9516 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
9518 o->op_next = o->op_next->op_next;
9519 o->op_type = OP_GVSV;
9520 o->op_ppaddr = PL_ppaddr[OP_GVSV];
9523 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
9524 GV * const gv = cGVOPo_gv;
9525 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
9526 /* XXX could check prototype here instead of just carping */
9527 SV * const sv = sv_newmortal();
9528 gv_efullname3(sv, gv, NULL);
9529 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
9530 "%"SVf"() called too early to check prototype",
9534 else if (o->op_next->op_type == OP_READLINE
9535 && o->op_next->op_next->op_type == OP_CONCAT
9536 && (o->op_next->op_next->op_flags & OPf_STACKED))
9538 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
9539 o->op_type = OP_RCATLINE;
9540 o->op_flags |= OPf_STACKED;
9541 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
9542 op_null(o->op_next->op_next);
9543 op_null(o->op_next);
9553 fop = cUNOP->op_first;
9561 fop = cLOGOP->op_first;
9562 sop = fop->op_sibling;
9563 while (cLOGOP->op_other->op_type == OP_NULL)
9564 cLOGOP->op_other = cLOGOP->op_other->op_next;
9565 CALL_RPEEP(cLOGOP->op_other);
9569 if ((fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
9571 (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV)
9576 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
9577 while (nop && nop->op_next) {
9578 switch (nop->op_next->op_type) {
9583 lop = nop = nop->op_next;
9594 if ((lop->op_flags & OPf_WANT) == OPf_WANT_VOID) {
9595 if (fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
9596 cLOGOP->op_first = opt_scalarhv(fop);
9597 if (sop && (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV))
9598 cLOGOP->op_first->op_sibling = opt_scalarhv(sop);
9614 while (cLOGOP->op_other->op_type == OP_NULL)
9615 cLOGOP->op_other = cLOGOP->op_other->op_next;
9616 CALL_RPEEP(cLOGOP->op_other);
9621 while (cLOOP->op_redoop->op_type == OP_NULL)
9622 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
9623 CALL_RPEEP(cLOOP->op_redoop);
9624 while (cLOOP->op_nextop->op_type == OP_NULL)
9625 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
9626 CALL_RPEEP(cLOOP->op_nextop);
9627 while (cLOOP->op_lastop->op_type == OP_NULL)
9628 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
9629 CALL_RPEEP(cLOOP->op_lastop);
9633 assert(!(cPMOP->op_pmflags & PMf_ONCE));
9634 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
9635 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
9636 cPMOP->op_pmstashstartu.op_pmreplstart
9637 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
9638 CALL_RPEEP(cPMOP->op_pmstashstartu.op_pmreplstart);
9642 if (o->op_next && o->op_next->op_type == OP_NEXTSTATE
9643 && ckWARN(WARN_SYNTAX))
9645 if (o->op_next->op_sibling) {
9646 const OPCODE type = o->op_next->op_sibling->op_type;
9647 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
9648 const line_t oldline = CopLINE(PL_curcop);
9649 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
9650 Perl_warner(aTHX_ packWARN(WARN_EXEC),
9651 "Statement unlikely to be reached");
9652 Perl_warner(aTHX_ packWARN(WARN_EXEC),
9653 "\t(Maybe you meant system() when you said exec()?)\n");
9654 CopLINE_set(PL_curcop, oldline);
9665 const char *key = NULL;
9668 if (((BINOP*)o)->op_last->op_type != OP_CONST)
9671 /* Make the CONST have a shared SV */
9672 svp = cSVOPx_svp(((BINOP*)o)->op_last);
9673 if (!SvFAKE(sv = *svp) || !SvREADONLY(sv)) {
9674 key = SvPV_const(sv, keylen);
9675 lexname = newSVpvn_share(key,
9676 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
9682 if ((o->op_private & (OPpLVAL_INTRO)))
9685 rop = (UNOP*)((BINOP*)o)->op_first;
9686 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
9688 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
9689 if (!SvPAD_TYPED(lexname))
9691 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
9692 if (!fields || !GvHV(*fields))
9694 key = SvPV_const(*svp, keylen);
9695 if (!hv_fetch(GvHV(*fields), key,
9696 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
9698 Perl_croak(aTHX_ "No such class field \"%s\" "
9699 "in variable %s of type %s",
9700 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
9713 SVOP *first_key_op, *key_op;
9715 if ((o->op_private & (OPpLVAL_INTRO))
9716 /* I bet there's always a pushmark... */
9717 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
9718 /* hmmm, no optimization if list contains only one key. */
9720 rop = (UNOP*)((LISTOP*)o)->op_last;
9721 if (rop->op_type != OP_RV2HV)
9723 if (rop->op_first->op_type == OP_PADSV)
9724 /* @$hash{qw(keys here)} */
9725 rop = (UNOP*)rop->op_first;
9727 /* @{$hash}{qw(keys here)} */
9728 if (rop->op_first->op_type == OP_SCOPE
9729 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
9731 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
9737 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
9738 if (!SvPAD_TYPED(lexname))
9740 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
9741 if (!fields || !GvHV(*fields))
9743 /* Again guessing that the pushmark can be jumped over.... */
9744 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
9745 ->op_first->op_sibling;
9746 for (key_op = first_key_op; key_op;
9747 key_op = (SVOP*)key_op->op_sibling) {
9748 if (key_op->op_type != OP_CONST)
9750 svp = cSVOPx_svp(key_op);
9751 key = SvPV_const(*svp, keylen);
9752 if (!hv_fetch(GvHV(*fields), key,
9753 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
9755 Perl_croak(aTHX_ "No such class field \"%s\" "
9756 "in variable %s of type %s",
9757 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
9766 && ( oldop->op_type == OP_AELEM
9767 || oldop->op_type == OP_PADSV
9768 || oldop->op_type == OP_RV2SV
9769 || oldop->op_type == OP_RV2GV
9770 || oldop->op_type == OP_HELEM
9772 && (oldop->op_private & OPpDEREF)
9774 o->op_private |= OPpDEREFed;
9778 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
9782 /* check that RHS of sort is a single plain array */
9783 OP *oright = cUNOPo->op_first;
9784 if (!oright || oright->op_type != OP_PUSHMARK)
9787 /* reverse sort ... can be optimised. */
9788 if (!cUNOPo->op_sibling) {
9789 /* Nothing follows us on the list. */
9790 OP * const reverse = o->op_next;
9792 if (reverse->op_type == OP_REVERSE &&
9793 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
9794 OP * const pushmark = cUNOPx(reverse)->op_first;
9795 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
9796 && (cUNOPx(pushmark)->op_sibling == o)) {
9797 /* reverse -> pushmark -> sort */
9798 o->op_private |= OPpSORT_REVERSE;
9800 pushmark->op_next = oright->op_next;
9806 /* make @a = sort @a act in-place */
9808 oright = cUNOPx(oright)->op_sibling;
9811 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
9812 oright = cUNOPx(oright)->op_sibling;
9815 oleft = is_inplace_av(o, oright);
9819 /* transfer MODishness etc from LHS arg to RHS arg */
9820 oright->op_flags = oleft->op_flags;
9821 o->op_private |= OPpSORT_INPLACE;
9823 /* excise push->gv->rv2av->null->aassign */
9824 o2 = o->op_next->op_next;
9825 op_null(o2); /* PUSHMARK */
9827 if (o2->op_type == OP_GV) {
9828 op_null(o2); /* GV */
9831 op_null(o2); /* RV2AV or PADAV */
9832 o2 = o2->op_next->op_next;
9833 op_null(o2); /* AASSIGN */
9835 o->op_next = o2->op_next;
9841 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
9844 LISTOP *enter, *exlist;
9846 /* @a = reverse @a */
9847 if ((oright = cLISTOPo->op_first)
9848 && (oright->op_type == OP_PUSHMARK)
9849 && (oright = oright->op_sibling)
9850 && (oleft = is_inplace_av(o, oright))) {
9853 /* transfer MODishness etc from LHS arg to RHS arg */
9854 oright->op_flags = oleft->op_flags;
9855 o->op_private |= OPpREVERSE_INPLACE;
9857 /* excise push->gv->rv2av->null->aassign */
9858 o2 = o->op_next->op_next;
9859 op_null(o2); /* PUSHMARK */
9861 if (o2->op_type == OP_GV) {
9862 op_null(o2); /* GV */
9865 op_null(o2); /* RV2AV or PADAV */
9866 o2 = o2->op_next->op_next;
9867 op_null(o2); /* AASSIGN */
9869 o->op_next = o2->op_next;
9873 enter = (LISTOP *) o->op_next;
9876 if (enter->op_type == OP_NULL) {
9877 enter = (LISTOP *) enter->op_next;
9881 /* for $a (...) will have OP_GV then OP_RV2GV here.
9882 for (...) just has an OP_GV. */
9883 if (enter->op_type == OP_GV) {
9884 gvop = (OP *) enter;
9885 enter = (LISTOP *) enter->op_next;
9888 if (enter->op_type == OP_RV2GV) {
9889 enter = (LISTOP *) enter->op_next;
9895 if (enter->op_type != OP_ENTERITER)
9898 iter = enter->op_next;
9899 if (!iter || iter->op_type != OP_ITER)
9902 expushmark = enter->op_first;
9903 if (!expushmark || expushmark->op_type != OP_NULL
9904 || expushmark->op_targ != OP_PUSHMARK)
9907 exlist = (LISTOP *) expushmark->op_sibling;
9908 if (!exlist || exlist->op_type != OP_NULL
9909 || exlist->op_targ != OP_LIST)
9912 if (exlist->op_last != o) {
9913 /* Mmm. Was expecting to point back to this op. */
9916 theirmark = exlist->op_first;
9917 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
9920 if (theirmark->op_sibling != o) {
9921 /* There's something between the mark and the reverse, eg
9922 for (1, reverse (...))
9927 ourmark = ((LISTOP *)o)->op_first;
9928 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
9931 ourlast = ((LISTOP *)o)->op_last;
9932 if (!ourlast || ourlast->op_next != o)
9935 rv2av = ourmark->op_sibling;
9936 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
9937 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
9938 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
9939 /* We're just reversing a single array. */
9940 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
9941 enter->op_flags |= OPf_STACKED;
9944 /* We don't have control over who points to theirmark, so sacrifice
9946 theirmark->op_next = ourmark->op_next;
9947 theirmark->op_flags = ourmark->op_flags;
9948 ourlast->op_next = gvop ? gvop : (OP *) enter;
9951 enter->op_private |= OPpITER_REVERSED;
9952 iter->op_private |= OPpITER_REVERSED;
9959 UNOP *refgen, *rv2cv;
9962 if ((o->op_flags & OPf_WANT) != OPf_WANT_VOID)
9965 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
9968 rv2gv = ((BINOP *)o)->op_last;
9969 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
9972 refgen = (UNOP *)((BINOP *)o)->op_first;
9974 if (!refgen || refgen->op_type != OP_REFGEN)
9977 exlist = (LISTOP *)refgen->op_first;
9978 if (!exlist || exlist->op_type != OP_NULL
9979 || exlist->op_targ != OP_LIST)
9982 if (exlist->op_first->op_type != OP_PUSHMARK)
9985 rv2cv = (UNOP*)exlist->op_last;
9987 if (rv2cv->op_type != OP_RV2CV)
9990 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
9991 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
9992 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
9994 o->op_private |= OPpASSIGN_CV_TO_GV;
9995 rv2gv->op_private |= OPpDONT_INIT_GV;
9996 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
10004 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
10005 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
10015 Perl_peep(pTHX_ register OP *o)
10021 Perl_custom_op_name(pTHX_ const OP* o)
10024 const IV index = PTR2IV(o->op_ppaddr);
10028 PERL_ARGS_ASSERT_CUSTOM_OP_NAME;
10030 if (!PL_custom_op_names) /* This probably shouldn't happen */
10031 return (char *)PL_op_name[OP_CUSTOM];
10033 keysv = sv_2mortal(newSViv(index));
10035 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
10037 return (char *)PL_op_name[OP_CUSTOM]; /* Don't know who you are */
10039 return SvPV_nolen(HeVAL(he));
10043 Perl_custom_op_desc(pTHX_ const OP* o)
10046 const IV index = PTR2IV(o->op_ppaddr);
10050 PERL_ARGS_ASSERT_CUSTOM_OP_DESC;
10052 if (!PL_custom_op_descs)
10053 return (char *)PL_op_desc[OP_CUSTOM];
10055 keysv = sv_2mortal(newSViv(index));
10057 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
10059 return (char *)PL_op_desc[OP_CUSTOM];
10061 return SvPV_nolen(HeVAL(he));
10066 /* Efficient sub that returns a constant scalar value. */
10068 const_sv_xsub(pTHX_ CV* cv)
10072 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
10076 /* diag_listed_as: SKIPME */
10077 Perl_croak(aTHX_ "usage: %s::%s()",
10078 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
10091 * c-indentation-style: bsd
10092 * c-basic-offset: 4
10093 * indent-tabs-mode: t
10096 * ex: set ts=8 sts=4 sw=4 noet: