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"
107 #define CALL_PEEP(o) PL_peepp(aTHX_ o)
108 #define CALL_RPEEP(o) PL_rpeepp(aTHX_ o)
109 #define CALL_OPFREEHOOK(o) if (PL_opfreehook) PL_opfreehook(aTHX_ o)
111 #if defined(PL_OP_SLAB_ALLOC)
113 #ifdef PERL_DEBUG_READONLY_OPS
114 # define PERL_SLAB_SIZE 4096
115 # include <sys/mman.h>
118 #ifndef PERL_SLAB_SIZE
119 #define PERL_SLAB_SIZE 2048
123 Perl_Slab_Alloc(pTHX_ size_t sz)
127 * To make incrementing use count easy PL_OpSlab is an I32 *
128 * To make inserting the link to slab PL_OpPtr is I32 **
129 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
130 * Add an overhead for pointer to slab and round up as a number of pointers
132 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
133 if ((PL_OpSpace -= sz) < 0) {
134 #ifdef PERL_DEBUG_READONLY_OPS
135 /* We need to allocate chunk by chunk so that we can control the VM
137 PL_OpPtr = (I32**) mmap(0, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE,
138 MAP_ANON|MAP_PRIVATE, -1, 0);
140 DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n",
141 (unsigned long) PERL_SLAB_SIZE*sizeof(I32*),
143 if(PL_OpPtr == MAP_FAILED) {
144 perror("mmap failed");
149 PL_OpPtr = (I32 **) PerlMemShared_calloc(PERL_SLAB_SIZE,sizeof(I32*));
154 /* We reserve the 0'th I32 sized chunk as a use count */
155 PL_OpSlab = (I32 *) PL_OpPtr;
156 /* Reduce size by the use count word, and by the size we need.
157 * Latter is to mimic the '-=' in the if() above
159 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
160 /* Allocation pointer starts at the top.
161 Theory: because we build leaves before trunk allocating at end
162 means that at run time access is cache friendly upward
164 PL_OpPtr += PERL_SLAB_SIZE;
166 #ifdef PERL_DEBUG_READONLY_OPS
167 /* We remember this slab. */
168 /* This implementation isn't efficient, but it is simple. */
169 PL_slabs = (I32**) realloc(PL_slabs, sizeof(I32**) * (PL_slab_count + 1));
170 PL_slabs[PL_slab_count++] = PL_OpSlab;
171 DEBUG_m(PerlIO_printf(Perl_debug_log, "Allocate %p\n", PL_OpSlab));
174 assert( PL_OpSpace >= 0 );
175 /* Move the allocation pointer down */
177 assert( PL_OpPtr > (I32 **) PL_OpSlab );
178 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
179 (*PL_OpSlab)++; /* Increment use count of slab */
180 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
181 assert( *PL_OpSlab > 0 );
182 return (void *)(PL_OpPtr + 1);
185 #ifdef PERL_DEBUG_READONLY_OPS
187 Perl_pending_Slabs_to_ro(pTHX) {
188 /* Turn all the allocated op slabs read only. */
189 U32 count = PL_slab_count;
190 I32 **const slabs = PL_slabs;
192 /* Reset the array of pending OP slabs, as we're about to turn this lot
193 read only. Also, do it ahead of the loop in case the warn triggers,
194 and a warn handler has an eval */
199 /* Force a new slab for any further allocation. */
203 void *const start = slabs[count];
204 const size_t size = PERL_SLAB_SIZE* sizeof(I32*);
205 if(mprotect(start, size, PROT_READ)) {
206 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d",
207 start, (unsigned long) size, errno);
215 S_Slab_to_rw(pTHX_ void *op)
217 I32 * const * const ptr = (I32 **) op;
218 I32 * const slab = ptr[-1];
220 PERL_ARGS_ASSERT_SLAB_TO_RW;
222 assert( ptr-1 > (I32 **) slab );
223 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
225 if(mprotect(slab, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE)) {
226 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d",
227 slab, (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), errno);
232 Perl_op_refcnt_inc(pTHX_ OP *o)
243 Perl_op_refcnt_dec(pTHX_ OP *o)
245 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
250 # define Slab_to_rw(op)
254 Perl_Slab_Free(pTHX_ void *op)
256 I32 * const * const ptr = (I32 **) op;
257 I32 * const slab = ptr[-1];
258 PERL_ARGS_ASSERT_SLAB_FREE;
259 assert( ptr-1 > (I32 **) slab );
260 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
263 if (--(*slab) == 0) {
265 # define PerlMemShared PerlMem
268 #ifdef PERL_DEBUG_READONLY_OPS
269 U32 count = PL_slab_count;
270 /* Need to remove this slab from our list of slabs */
273 if (PL_slabs[count] == slab) {
275 /* Found it. Move the entry at the end to overwrite it. */
276 DEBUG_m(PerlIO_printf(Perl_debug_log,
277 "Deallocate %p by moving %p from %lu to %lu\n",
279 PL_slabs[PL_slab_count - 1],
280 PL_slab_count, count));
281 PL_slabs[count] = PL_slabs[--PL_slab_count];
282 /* Could realloc smaller at this point, but probably not
284 if(munmap(slab, PERL_SLAB_SIZE*sizeof(I32*))) {
285 perror("munmap failed");
293 PerlMemShared_free(slab);
295 if (slab == PL_OpSlab) {
302 * In the following definition, the ", (OP*)0" is just to make the compiler
303 * think the expression is of the right type: croak actually does a Siglongjmp.
305 #define CHECKOP(type,o) \
306 ((PL_op_mask && PL_op_mask[type]) \
307 ? ( op_free((OP*)o), \
308 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
310 : PL_check[type](aTHX_ (OP*)o))
312 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
314 #define CHANGE_TYPE(o,type) \
316 o->op_type = (OPCODE)type; \
317 o->op_ppaddr = PL_ppaddr[type]; \
321 S_gv_ename(pTHX_ GV *gv)
323 SV* const tmpsv = sv_newmortal();
325 PERL_ARGS_ASSERT_GV_ENAME;
327 gv_efullname3(tmpsv, gv, NULL);
328 return SvPV_nolen_const(tmpsv);
332 S_no_fh_allowed(pTHX_ OP *o)
334 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
336 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
342 S_too_few_arguments(pTHX_ OP *o, const char *name)
344 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS;
346 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
351 S_too_many_arguments(pTHX_ OP *o, const char *name)
353 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS;
355 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
360 S_bad_type(pTHX_ I32 n, const char *t, const char *name, const OP *kid)
362 PERL_ARGS_ASSERT_BAD_TYPE;
364 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
365 (int)n, name, t, OP_DESC(kid)));
369 S_no_bareword_allowed(pTHX_ OP *o)
371 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
374 return; /* various ok barewords are hidden in extra OP_NULL */
375 qerror(Perl_mess(aTHX_
376 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
378 o->op_private &= ~OPpCONST_STRICT; /* prevent warning twice about the same OP */
381 /* "register" allocation */
384 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
388 const bool is_our = (PL_parser->in_my == KEY_our);
390 PERL_ARGS_ASSERT_ALLOCMY;
392 if (flags & ~SVf_UTF8)
393 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
396 /* Until we're using the length for real, cross check that we're being
398 assert(strlen(name) == len);
400 /* complain about "my $<special_var>" etc etc */
404 ((flags & SVf_UTF8) && UTF8_IS_START(name[1])) ||
405 (name[1] == '_' && (*name == '$' || len > 2))))
407 /* name[2] is true if strlen(name) > 2 */
408 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
409 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
410 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
411 PL_parser->in_my == KEY_state ? "state" : "my"));
413 yyerror(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
414 PL_parser->in_my == KEY_state ? "state" : "my"));
418 /* allocate a spare slot and store the name in that slot */
420 off = pad_add_name_pvn(name, len,
421 (is_our ? padadd_OUR :
422 PL_parser->in_my == KEY_state ? padadd_STATE : 0)
423 | ( flags & SVf_UTF8 ? SVf_UTF8 : 0 ),
424 PL_parser->in_my_stash,
426 /* $_ is always in main::, even with our */
427 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
431 /* anon sub prototypes contains state vars should always be cloned,
432 * otherwise the state var would be shared between anon subs */
434 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
435 CvCLONE_on(PL_compcv);
440 /* free the body of an op without examining its contents.
441 * Always use this rather than FreeOp directly */
444 S_op_destroy(pTHX_ OP *o)
446 if (o->op_latefree) {
454 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b)
456 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a)
462 Perl_op_free(pTHX_ OP *o)
469 if (o->op_latefreed) {
476 if (o->op_private & OPpREFCOUNTED) {
487 refcnt = OpREFCNT_dec(o);
490 /* Need to find and remove any pattern match ops from the list
491 we maintain for reset(). */
492 find_and_forget_pmops(o);
502 /* Call the op_free hook if it has been set. Do it now so that it's called
503 * at the right time for refcounted ops, but still before all of the kids
507 if (o->op_flags & OPf_KIDS) {
508 register OP *kid, *nextkid;
509 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
510 nextkid = kid->op_sibling; /* Get before next freeing kid */
515 #ifdef PERL_DEBUG_READONLY_OPS
519 /* COP* is not cleared by op_clear() so that we may track line
520 * numbers etc even after null() */
521 if (type == OP_NEXTSTATE || type == OP_DBSTATE
522 || (type == OP_NULL /* the COP might have been null'ed */
523 && ((OPCODE)o->op_targ == OP_NEXTSTATE
524 || (OPCODE)o->op_targ == OP_DBSTATE))) {
529 type = (OPCODE)o->op_targ;
532 if (o->op_latefree) {
538 #ifdef DEBUG_LEAKING_SCALARS
545 Perl_op_clear(pTHX_ OP *o)
550 PERL_ARGS_ASSERT_OP_CLEAR;
553 mad_free(o->op_madprop);
558 switch (o->op_type) {
559 case OP_NULL: /* Was holding old type, if any. */
560 if (PL_madskills && o->op_targ != OP_NULL) {
561 o->op_type = (Optype)o->op_targ;
566 case OP_ENTEREVAL: /* Was holding hints. */
570 if (!(o->op_flags & OPf_REF)
571 || (PL_check[o->op_type] != Perl_ck_ftst))
578 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
583 /* It's possible during global destruction that the GV is freed
584 before the optree. Whilst the SvREFCNT_inc is happy to bump from
585 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0
586 will trigger an assertion failure, because the entry to sv_clear
587 checks that the scalar is not already freed. A check of for
588 !SvIS_FREED(gv) turns out to be invalid, because during global
589 destruction the reference count can be forced down to zero
590 (with SVf_BREAK set). In which case raising to 1 and then
591 dropping to 0 triggers cleanup before it should happen. I
592 *think* that this might actually be a general, systematic,
593 weakness of the whole idea of SVf_BREAK, in that code *is*
594 allowed to raise and lower references during global destruction,
595 so any *valid* code that happens to do this during global
596 destruction might well trigger premature cleanup. */
597 bool still_valid = gv && SvREFCNT(gv);
600 SvREFCNT_inc_simple_void(gv);
602 if (cPADOPo->op_padix > 0) {
603 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
604 * may still exist on the pad */
605 pad_swipe(cPADOPo->op_padix, TRUE);
606 cPADOPo->op_padix = 0;
609 SvREFCNT_dec(cSVOPo->op_sv);
610 cSVOPo->op_sv = NULL;
613 int try_downgrade = SvREFCNT(gv) == 2;
616 gv_try_downgrade(gv);
620 case OP_METHOD_NAMED:
623 SvREFCNT_dec(cSVOPo->op_sv);
624 cSVOPo->op_sv = NULL;
627 Even if op_clear does a pad_free for the target of the op,
628 pad_free doesn't actually remove the sv that exists in the pad;
629 instead it lives on. This results in that it could be reused as
630 a target later on when the pad was reallocated.
633 pad_swipe(o->op_targ,1);
642 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
647 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
649 if (cPADOPo->op_padix > 0) {
650 pad_swipe(cPADOPo->op_padix, TRUE);
651 cPADOPo->op_padix = 0;
654 SvREFCNT_dec(cSVOPo->op_sv);
655 cSVOPo->op_sv = NULL;
659 PerlMemShared_free(cPVOPo->op_pv);
660 cPVOPo->op_pv = NULL;
664 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
668 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
669 /* No GvIN_PAD_off here, because other references may still
670 * exist on the pad */
671 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
674 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
680 forget_pmop(cPMOPo, 1);
681 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
682 /* we use the same protection as the "SAFE" version of the PM_ macros
683 * here since sv_clean_all might release some PMOPs
684 * after PL_regex_padav has been cleared
685 * and the clearing of PL_regex_padav needs to
686 * happen before sv_clean_all
689 if(PL_regex_pad) { /* We could be in destruction */
690 const IV offset = (cPMOPo)->op_pmoffset;
691 ReREFCNT_dec(PM_GETRE(cPMOPo));
692 PL_regex_pad[offset] = &PL_sv_undef;
693 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
697 ReREFCNT_dec(PM_GETRE(cPMOPo));
698 PM_SETRE(cPMOPo, NULL);
704 if (o->op_targ > 0) {
705 pad_free(o->op_targ);
711 S_cop_free(pTHX_ COP* cop)
713 PERL_ARGS_ASSERT_COP_FREE;
717 if (! specialWARN(cop->cop_warnings))
718 PerlMemShared_free(cop->cop_warnings);
719 cophh_free(CopHINTHASH_get(cop));
723 S_forget_pmop(pTHX_ PMOP *const o
729 HV * const pmstash = PmopSTASH(o);
731 PERL_ARGS_ASSERT_FORGET_PMOP;
733 if (pmstash && !SvIS_FREED(pmstash)) {
734 MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab);
736 PMOP **const array = (PMOP**) mg->mg_ptr;
737 U32 count = mg->mg_len / sizeof(PMOP**);
742 /* Found it. Move the entry at the end to overwrite it. */
743 array[i] = array[--count];
744 mg->mg_len = count * sizeof(PMOP**);
745 /* Could realloc smaller at this point always, but probably
746 not worth it. Probably worth free()ing if we're the
749 Safefree(mg->mg_ptr);
766 S_find_and_forget_pmops(pTHX_ OP *o)
768 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
770 if (o->op_flags & OPf_KIDS) {
771 OP *kid = cUNOPo->op_first;
773 switch (kid->op_type) {
778 forget_pmop((PMOP*)kid, 0);
780 find_and_forget_pmops(kid);
781 kid = kid->op_sibling;
787 Perl_op_null(pTHX_ OP *o)
791 PERL_ARGS_ASSERT_OP_NULL;
793 if (o->op_type == OP_NULL)
797 o->op_targ = o->op_type;
798 o->op_type = OP_NULL;
799 o->op_ppaddr = PL_ppaddr[OP_NULL];
803 Perl_op_refcnt_lock(pTHX)
811 Perl_op_refcnt_unlock(pTHX)
818 /* Contextualizers */
821 =for apidoc Am|OP *|op_contextualize|OP *o|I32 context
823 Applies a syntactic context to an op tree representing an expression.
824 I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>,
825 or C<G_VOID> to specify the context to apply. The modified op tree
832 Perl_op_contextualize(pTHX_ OP *o, I32 context)
834 PERL_ARGS_ASSERT_OP_CONTEXTUALIZE;
836 case G_SCALAR: return scalar(o);
837 case G_ARRAY: return list(o);
838 case G_VOID: return scalarvoid(o);
840 Perl_croak(aTHX_ "panic: op_contextualize bad context %ld",
847 =head1 Optree Manipulation Functions
849 =for apidoc Am|OP*|op_linklist|OP *o
850 This function is the implementation of the L</LINKLIST> macro. It should
851 not be called directly.
857 Perl_op_linklist(pTHX_ OP *o)
861 PERL_ARGS_ASSERT_OP_LINKLIST;
866 /* establish postfix order */
867 first = cUNOPo->op_first;
870 o->op_next = LINKLIST(first);
873 if (kid->op_sibling) {
874 kid->op_next = LINKLIST(kid->op_sibling);
875 kid = kid->op_sibling;
889 S_scalarkids(pTHX_ OP *o)
891 if (o && o->op_flags & OPf_KIDS) {
893 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
900 S_scalarboolean(pTHX_ OP *o)
904 PERL_ARGS_ASSERT_SCALARBOOLEAN;
906 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST
907 && !(cBINOPo->op_first->op_flags & OPf_SPECIAL)) {
908 if (ckWARN(WARN_SYNTAX)) {
909 const line_t oldline = CopLINE(PL_curcop);
911 if (PL_parser && PL_parser->copline != NOLINE)
912 CopLINE_set(PL_curcop, PL_parser->copline);
913 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
914 CopLINE_set(PL_curcop, oldline);
921 Perl_scalar(pTHX_ OP *o)
926 /* assumes no premature commitment */
927 if (!o || (PL_parser && PL_parser->error_count)
928 || (o->op_flags & OPf_WANT)
929 || o->op_type == OP_RETURN)
934 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
936 switch (o->op_type) {
938 scalar(cBINOPo->op_first);
943 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
953 if (o->op_flags & OPf_KIDS) {
954 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
960 kid = cLISTOPo->op_first;
962 kid = kid->op_sibling;
965 OP *sib = kid->op_sibling;
966 if (sib && kid->op_type != OP_LEAVEWHEN)
972 PL_curcop = &PL_compiling;
977 kid = cLISTOPo->op_first;
980 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
987 Perl_scalarvoid(pTHX_ OP *o)
991 const char* useless = NULL;
992 U32 useless_is_utf8 = 0;
996 PERL_ARGS_ASSERT_SCALARVOID;
998 /* trailing mad null ops don't count as "there" for void processing */
1000 o->op_type != OP_NULL &&
1002 o->op_sibling->op_type == OP_NULL)
1005 for (sib = o->op_sibling;
1006 sib && sib->op_type == OP_NULL;
1007 sib = sib->op_sibling) ;
1013 if (o->op_type == OP_NEXTSTATE
1014 || o->op_type == OP_DBSTATE
1015 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1016 || o->op_targ == OP_DBSTATE)))
1017 PL_curcop = (COP*)o; /* for warning below */
1019 /* assumes no premature commitment */
1020 want = o->op_flags & OPf_WANT;
1021 if ((want && want != OPf_WANT_SCALAR)
1022 || (PL_parser && PL_parser->error_count)
1023 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN)
1028 if ((o->op_private & OPpTARGET_MY)
1029 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1031 return scalar(o); /* As if inside SASSIGN */
1034 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1036 switch (o->op_type) {
1038 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1042 if (o->op_flags & OPf_STACKED)
1046 if (o->op_private == 4)
1071 case OP_AELEMFAST_LEX:
1090 case OP_GETSOCKNAME:
1091 case OP_GETPEERNAME:
1096 case OP_GETPRIORITY:
1121 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1122 /* Otherwise it's "Useless use of grep iterator" */
1123 useless = OP_DESC(o);
1127 kid = cLISTOPo->op_first;
1128 if (kid && kid->op_type == OP_PUSHRE
1130 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1132 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1134 useless = OP_DESC(o);
1138 kid = cUNOPo->op_first;
1139 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1140 kid->op_type != OP_TRANS && kid->op_type != OP_TRANSR) {
1143 useless = "negative pattern binding (!~)";
1147 if (cPMOPo->op_pmflags & PMf_NONDESTRUCT)
1148 useless = "non-destructive substitution (s///r)";
1152 useless = "non-destructive transliteration (tr///r)";
1159 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1160 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1161 useless = "a variable";
1166 if (cSVOPo->op_private & OPpCONST_STRICT)
1167 no_bareword_allowed(o);
1169 if (ckWARN(WARN_VOID)) {
1170 /* don't warn on optimised away booleans, eg
1171 * use constant Foo, 5; Foo || print; */
1172 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1174 /* the constants 0 and 1 are permitted as they are
1175 conventionally used as dummies in constructs like
1176 1 while some_condition_with_side_effects; */
1177 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1179 else if (SvPOK(sv)) {
1180 /* perl4's way of mixing documentation and code
1181 (before the invention of POD) was based on a
1182 trick to mix nroff and perl code. The trick was
1183 built upon these three nroff macros being used in
1184 void context. The pink camel has the details in
1185 the script wrapman near page 319. */
1186 const char * const maybe_macro = SvPVX_const(sv);
1187 if (strnEQ(maybe_macro, "di", 2) ||
1188 strnEQ(maybe_macro, "ds", 2) ||
1189 strnEQ(maybe_macro, "ig", 2))
1192 SV * const dsv = newSVpvs("");
1193 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1195 pv_pretty(dsv, maybe_macro, SvCUR(sv), 32, NULL, NULL,
1196 PERL_PV_PRETTY_DUMP | PERL_PV_ESCAPE_NOCLEAR | PERL_PV_ESCAPE_UNI_DETECT )));
1198 useless = SvPV_nolen(msv);
1199 useless_is_utf8 = SvUTF8(msv);
1202 else if (SvOK(sv)) {
1203 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1204 "a constant (%"SVf")", sv));
1205 useless = SvPV_nolen(msv);
1208 useless = "a constant (undef)";
1211 op_null(o); /* don't execute or even remember it */
1215 o->op_type = OP_PREINC; /* pre-increment is faster */
1216 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1220 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1221 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1225 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1226 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1230 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1231 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1236 UNOP *refgen, *rv2cv;
1239 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
1242 rv2gv = ((BINOP *)o)->op_last;
1243 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
1246 refgen = (UNOP *)((BINOP *)o)->op_first;
1248 if (!refgen || refgen->op_type != OP_REFGEN)
1251 exlist = (LISTOP *)refgen->op_first;
1252 if (!exlist || exlist->op_type != OP_NULL
1253 || exlist->op_targ != OP_LIST)
1256 if (exlist->op_first->op_type != OP_PUSHMARK)
1259 rv2cv = (UNOP*)exlist->op_last;
1261 if (rv2cv->op_type != OP_RV2CV)
1264 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
1265 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
1266 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
1268 o->op_private |= OPpASSIGN_CV_TO_GV;
1269 rv2gv->op_private |= OPpDONT_INIT_GV;
1270 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
1282 kid = cLOGOPo->op_first;
1283 if (kid->op_type == OP_NOT
1284 && (kid->op_flags & OPf_KIDS)
1286 if (o->op_type == OP_AND) {
1288 o->op_ppaddr = PL_ppaddr[OP_OR];
1290 o->op_type = OP_AND;
1291 o->op_ppaddr = PL_ppaddr[OP_AND];
1300 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1305 if (o->op_flags & OPf_STACKED)
1312 if (!(o->op_flags & OPf_KIDS))
1323 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1333 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %"SVf" in void context",
1334 newSVpvn_flags(useless, strlen(useless),
1335 SVs_TEMP | ( useless_is_utf8 ? SVf_UTF8 : 0 )));
1340 S_listkids(pTHX_ OP *o)
1342 if (o && o->op_flags & OPf_KIDS) {
1344 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1351 Perl_list(pTHX_ OP *o)
1356 /* assumes no premature commitment */
1357 if (!o || (o->op_flags & OPf_WANT)
1358 || (PL_parser && PL_parser->error_count)
1359 || o->op_type == OP_RETURN)
1364 if ((o->op_private & OPpTARGET_MY)
1365 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1367 return o; /* As if inside SASSIGN */
1370 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1372 switch (o->op_type) {
1375 list(cBINOPo->op_first);
1380 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1388 if (!(o->op_flags & OPf_KIDS))
1390 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1391 list(cBINOPo->op_first);
1392 return gen_constant_list(o);
1399 kid = cLISTOPo->op_first;
1401 kid = kid->op_sibling;
1404 OP *sib = kid->op_sibling;
1405 if (sib && kid->op_type != OP_LEAVEWHEN)
1411 PL_curcop = &PL_compiling;
1415 kid = cLISTOPo->op_first;
1422 S_scalarseq(pTHX_ OP *o)
1426 const OPCODE type = o->op_type;
1428 if (type == OP_LINESEQ || type == OP_SCOPE ||
1429 type == OP_LEAVE || type == OP_LEAVETRY)
1432 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1433 if (kid->op_sibling) {
1437 PL_curcop = &PL_compiling;
1439 o->op_flags &= ~OPf_PARENS;
1440 if (PL_hints & HINT_BLOCK_SCOPE)
1441 o->op_flags |= OPf_PARENS;
1444 o = newOP(OP_STUB, 0);
1449 S_modkids(pTHX_ OP *o, I32 type)
1451 if (o && o->op_flags & OPf_KIDS) {
1453 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1454 op_lvalue(kid, type);
1460 =for apidoc finalize_optree
1462 This function finalizes the optree. Should be called directly after
1463 the complete optree is built. It does some additional
1464 checking which can't be done in the normal ck_xxx functions and makes
1465 the tree thread-safe.
1470 Perl_finalize_optree(pTHX_ OP* o)
1472 PERL_ARGS_ASSERT_FINALIZE_OPTREE;
1475 SAVEVPTR(PL_curcop);
1483 S_finalize_op(pTHX_ OP* o)
1485 PERL_ARGS_ASSERT_FINALIZE_OP;
1487 #if defined(PERL_MAD) && defined(USE_ITHREADS)
1489 /* Make sure mad ops are also thread-safe */
1490 MADPROP *mp = o->op_madprop;
1492 if (mp->mad_type == MAD_OP && mp->mad_vlen) {
1493 OP *prop_op = (OP *) mp->mad_val;
1494 /* We only need "Relocate sv to the pad for thread safety.", but this
1495 easiest way to make sure it traverses everything */
1496 if (prop_op->op_type == OP_CONST)
1497 cSVOPx(prop_op)->op_private &= ~OPpCONST_STRICT;
1498 finalize_op(prop_op);
1505 switch (o->op_type) {
1508 PL_curcop = ((COP*)o); /* for warnings */
1512 && (o->op_sibling->op_type == OP_NEXTSTATE || o->op_sibling->op_type == OP_DBSTATE)
1513 && ckWARN(WARN_SYNTAX))
1515 if (o->op_sibling->op_sibling) {
1516 const OPCODE type = o->op_sibling->op_sibling->op_type;
1517 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
1518 const line_t oldline = CopLINE(PL_curcop);
1519 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_sibling));
1520 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1521 "Statement unlikely to be reached");
1522 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1523 "\t(Maybe you meant system() when you said exec()?)\n");
1524 CopLINE_set(PL_curcop, oldline);
1531 if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
1532 GV * const gv = cGVOPo_gv;
1533 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
1534 /* XXX could check prototype here instead of just carping */
1535 SV * const sv = sv_newmortal();
1536 gv_efullname3(sv, gv, NULL);
1537 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
1538 "%"SVf"() called too early to check prototype",
1545 if (cSVOPo->op_private & OPpCONST_STRICT)
1546 no_bareword_allowed(o);
1550 case OP_METHOD_NAMED:
1551 /* Relocate sv to the pad for thread safety.
1552 * Despite being a "constant", the SV is written to,
1553 * for reference counts, sv_upgrade() etc. */
1554 if (cSVOPo->op_sv) {
1555 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
1556 if (o->op_type != OP_METHOD_NAMED &&
1557 (SvPADTMP(cSVOPo->op_sv) || SvPADMY(cSVOPo->op_sv)))
1559 /* If op_sv is already a PADTMP/MY then it is being used by
1560 * some pad, so make a copy. */
1561 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
1562 SvREADONLY_on(PAD_SVl(ix));
1563 SvREFCNT_dec(cSVOPo->op_sv);
1565 else if (o->op_type != OP_METHOD_NAMED
1566 && cSVOPo->op_sv == &PL_sv_undef) {
1567 /* PL_sv_undef is hack - it's unsafe to store it in the
1568 AV that is the pad, because av_fetch treats values of
1569 PL_sv_undef as a "free" AV entry and will merrily
1570 replace them with a new SV, causing pad_alloc to think
1571 that this pad slot is free. (When, clearly, it is not)
1573 SvOK_off(PAD_SVl(ix));
1574 SvPADTMP_on(PAD_SVl(ix));
1575 SvREADONLY_on(PAD_SVl(ix));
1578 SvREFCNT_dec(PAD_SVl(ix));
1579 SvPADTMP_on(cSVOPo->op_sv);
1580 PAD_SETSV(ix, cSVOPo->op_sv);
1581 /* XXX I don't know how this isn't readonly already. */
1582 SvREADONLY_on(PAD_SVl(ix));
1584 cSVOPo->op_sv = NULL;
1595 const char *key = NULL;
1598 if (((BINOP*)o)->op_last->op_type != OP_CONST)
1601 /* Make the CONST have a shared SV */
1602 svp = cSVOPx_svp(((BINOP*)o)->op_last);
1603 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv))
1604 && SvTYPE(sv) < SVt_PVMG && !SvROK(sv)) {
1605 key = SvPV_const(sv, keylen);
1606 lexname = newSVpvn_share(key,
1607 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
1613 if ((o->op_private & (OPpLVAL_INTRO)))
1616 rop = (UNOP*)((BINOP*)o)->op_first;
1617 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
1619 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
1620 if (!SvPAD_TYPED(lexname))
1622 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1623 if (!fields || !GvHV(*fields))
1625 key = SvPV_const(*svp, keylen);
1626 if (!hv_fetch(GvHV(*fields), key,
1627 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1628 Perl_croak(aTHX_ "No such class field \"%s\" "
1629 "in variable %s of type %s",
1630 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
1642 SVOP *first_key_op, *key_op;
1644 if ((o->op_private & (OPpLVAL_INTRO))
1645 /* I bet there's always a pushmark... */
1646 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
1647 /* hmmm, no optimization if list contains only one key. */
1649 rop = (UNOP*)((LISTOP*)o)->op_last;
1650 if (rop->op_type != OP_RV2HV)
1652 if (rop->op_first->op_type == OP_PADSV)
1653 /* @$hash{qw(keys here)} */
1654 rop = (UNOP*)rop->op_first;
1656 /* @{$hash}{qw(keys here)} */
1657 if (rop->op_first->op_type == OP_SCOPE
1658 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
1660 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
1666 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
1667 if (!SvPAD_TYPED(lexname))
1669 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1670 if (!fields || !GvHV(*fields))
1672 /* Again guessing that the pushmark can be jumped over.... */
1673 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
1674 ->op_first->op_sibling;
1675 for (key_op = first_key_op; key_op;
1676 key_op = (SVOP*)key_op->op_sibling) {
1677 if (key_op->op_type != OP_CONST)
1679 svp = cSVOPx_svp(key_op);
1680 key = SvPV_const(*svp, keylen);
1681 if (!hv_fetch(GvHV(*fields), key,
1682 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1683 Perl_croak(aTHX_ "No such class field \"%s\" "
1684 "in variable %s of type %s",
1685 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
1691 if (cPMOPo->op_pmreplrootu.op_pmreplroot)
1692 finalize_op(cPMOPo->op_pmreplrootu.op_pmreplroot);
1699 if (o->op_flags & OPf_KIDS) {
1701 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1707 =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
1709 Propagate lvalue ("modifiable") context to an op and its children.
1710 I<type> represents the context type, roughly based on the type of op that
1711 would do the modifying, although C<local()> is represented by OP_NULL,
1712 because it has no op type of its own (it is signalled by a flag on
1715 This function detects things that can't be modified, such as C<$x+1>, and
1716 generates errors for them. For example, C<$x+1 = 2> would cause it to be
1717 called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN.
1719 It also flags things that need to behave specially in an lvalue context,
1720 such as C<$$x = 5> which might have to vivify a reference in C<$x>.
1726 Perl_op_lvalue_flags(pTHX_ OP *o, I32 type, U32 flags)
1730 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1733 if (!o || (PL_parser && PL_parser->error_count))
1736 if ((o->op_private & OPpTARGET_MY)
1737 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1742 assert( (o->op_flags & OPf_WANT) != OPf_WANT_VOID );
1744 if (type == OP_PRTF || type == OP_SPRINTF) type = OP_ENTERSUB;
1746 switch (o->op_type) {
1752 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1756 if ((type == OP_UNDEF || type == OP_REFGEN || type == OP_LOCK) &&
1757 !(o->op_flags & OPf_STACKED)) {
1758 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1759 /* Both ENTERSUB and RV2CV use this bit, but for different pur-
1760 poses, so we need it clear. */
1761 o->op_private &= ~1;
1762 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1763 assert(cUNOPo->op_first->op_type == OP_NULL);
1764 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1767 else { /* lvalue subroutine call */
1768 o->op_private |= OPpLVAL_INTRO
1769 |(OPpENTERSUB_INARGS * (type == OP_LEAVESUBLV));
1770 PL_modcount = RETURN_UNLIMITED_NUMBER;
1771 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1772 /* Potential lvalue context: */
1773 o->op_private |= OPpENTERSUB_INARGS;
1776 else { /* Compile-time error message: */
1777 OP *kid = cUNOPo->op_first;
1781 if (kid->op_type != OP_PUSHMARK) {
1782 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1784 "panic: unexpected lvalue entersub "
1785 "args: type/targ %ld:%"UVuf,
1786 (long)kid->op_type, (UV)kid->op_targ);
1787 kid = kLISTOP->op_first;
1789 while (kid->op_sibling)
1790 kid = kid->op_sibling;
1791 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1792 break; /* Postpone until runtime */
1796 kid = kUNOP->op_first;
1797 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1798 kid = kUNOP->op_first;
1799 if (kid->op_type == OP_NULL)
1801 "Unexpected constant lvalue entersub "
1802 "entry via type/targ %ld:%"UVuf,
1803 (long)kid->op_type, (UV)kid->op_targ);
1804 if (kid->op_type != OP_GV) {
1808 cv = GvCV(kGVOP_gv);
1818 if (flags & OP_LVALUE_NO_CROAK) return NULL;
1819 /* grep, foreach, subcalls, refgen */
1820 if (type == OP_GREPSTART || type == OP_ENTERSUB
1821 || type == OP_REFGEN || type == OP_LEAVESUBLV)
1823 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1824 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1826 : (o->op_type == OP_ENTERSUB
1827 ? "non-lvalue subroutine call"
1829 type ? PL_op_desc[type] : "local"));
1843 case OP_RIGHT_SHIFT:
1852 if (!(o->op_flags & OPf_STACKED))
1859 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1860 op_lvalue(kid, type);
1865 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1866 PL_modcount = RETURN_UNLIMITED_NUMBER;
1867 return o; /* Treat \(@foo) like ordinary list. */
1871 if (scalar_mod_type(o, type))
1873 ref(cUNOPo->op_first, o->op_type);
1877 if (type == OP_LEAVESUBLV)
1878 o->op_private |= OPpMAYBE_LVSUB;
1884 PL_modcount = RETURN_UNLIMITED_NUMBER;
1887 PL_hints |= HINT_BLOCK_SCOPE;
1888 if (type == OP_LEAVESUBLV)
1889 o->op_private |= OPpMAYBE_LVSUB;
1893 ref(cUNOPo->op_first, o->op_type);
1897 PL_hints |= HINT_BLOCK_SCOPE;
1906 case OP_AELEMFAST_LEX:
1913 PL_modcount = RETURN_UNLIMITED_NUMBER;
1914 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1915 return o; /* Treat \(@foo) like ordinary list. */
1916 if (scalar_mod_type(o, type))
1918 if (type == OP_LEAVESUBLV)
1919 o->op_private |= OPpMAYBE_LVSUB;
1923 if (!type) /* local() */
1924 Perl_croak(aTHX_ "Can't localize lexical variable %"SVf,
1925 PAD_COMPNAME_SV(o->op_targ));
1934 if (type != OP_SASSIGN && type != OP_LEAVESUBLV)
1938 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1944 if (type == OP_LEAVESUBLV)
1945 o->op_private |= OPpMAYBE_LVSUB;
1946 pad_free(o->op_targ);
1947 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1948 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1949 if (o->op_flags & OPf_KIDS)
1950 op_lvalue(cBINOPo->op_first->op_sibling, type);
1955 ref(cBINOPo->op_first, o->op_type);
1956 if (type == OP_ENTERSUB &&
1957 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1958 o->op_private |= OPpLVAL_DEFER;
1959 if (type == OP_LEAVESUBLV)
1960 o->op_private |= OPpMAYBE_LVSUB;
1970 if (o->op_flags & OPf_KIDS)
1971 op_lvalue(cLISTOPo->op_last, type);
1976 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1978 else if (!(o->op_flags & OPf_KIDS))
1980 if (o->op_targ != OP_LIST) {
1981 op_lvalue(cBINOPo->op_first, type);
1987 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1988 /* elements might be in void context because the list is
1989 in scalar context or because they are attribute sub calls */
1990 if ( (kid->op_flags & OPf_WANT) != OPf_WANT_VOID )
1991 op_lvalue(kid, type);
1995 if (type != OP_LEAVESUBLV)
1997 break; /* op_lvalue()ing was handled by ck_return() */
2000 /* [20011101.069] File test operators interpret OPf_REF to mean that
2001 their argument is a filehandle; thus \stat(".") should not set
2003 if (type == OP_REFGEN &&
2004 PL_check[o->op_type] == Perl_ck_ftst)
2007 if (type != OP_LEAVESUBLV)
2008 o->op_flags |= OPf_MOD;
2010 if (type == OP_AASSIGN || type == OP_SASSIGN)
2011 o->op_flags |= OPf_SPECIAL|OPf_REF;
2012 else if (!type) { /* local() */
2015 o->op_private |= OPpLVAL_INTRO;
2016 o->op_flags &= ~OPf_SPECIAL;
2017 PL_hints |= HINT_BLOCK_SCOPE;
2022 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
2023 "Useless localization of %s", OP_DESC(o));
2026 else if (type != OP_GREPSTART && type != OP_ENTERSUB
2027 && type != OP_LEAVESUBLV)
2028 o->op_flags |= OPf_REF;
2033 S_scalar_mod_type(const OP *o, I32 type)
2035 assert(o || type != OP_SASSIGN);
2039 if (o->op_type == OP_RV2GV)
2063 case OP_RIGHT_SHIFT:
2084 S_is_handle_constructor(const OP *o, I32 numargs)
2086 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
2088 switch (o->op_type) {
2096 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
2109 S_refkids(pTHX_ OP *o, I32 type)
2111 if (o && o->op_flags & OPf_KIDS) {
2113 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2120 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
2125 PERL_ARGS_ASSERT_DOREF;
2127 if (!o || (PL_parser && PL_parser->error_count))
2130 switch (o->op_type) {
2132 if ((type == OP_EXISTS || type == OP_DEFINED) &&
2133 !(o->op_flags & OPf_STACKED)) {
2134 o->op_type = OP_RV2CV; /* entersub => rv2cv */
2135 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
2136 assert(cUNOPo->op_first->op_type == OP_NULL);
2137 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
2138 o->op_flags |= OPf_SPECIAL;
2139 o->op_private &= ~1;
2141 else if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV){
2142 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2143 : type == OP_RV2HV ? OPpDEREF_HV
2145 o->op_flags |= OPf_MOD;
2151 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2152 doref(kid, type, set_op_ref);
2155 if (type == OP_DEFINED)
2156 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2157 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2160 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2161 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2162 : type == OP_RV2HV ? OPpDEREF_HV
2164 o->op_flags |= OPf_MOD;
2171 o->op_flags |= OPf_REF;
2174 if (type == OP_DEFINED)
2175 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2176 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2182 o->op_flags |= OPf_REF;
2187 if (!(o->op_flags & OPf_KIDS))
2189 doref(cBINOPo->op_first, type, set_op_ref);
2193 doref(cBINOPo->op_first, o->op_type, set_op_ref);
2194 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2195 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2196 : type == OP_RV2HV ? OPpDEREF_HV
2198 o->op_flags |= OPf_MOD;
2208 if (!(o->op_flags & OPf_KIDS))
2210 doref(cLISTOPo->op_last, type, set_op_ref);
2220 S_dup_attrlist(pTHX_ OP *o)
2225 PERL_ARGS_ASSERT_DUP_ATTRLIST;
2227 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
2228 * where the first kid is OP_PUSHMARK and the remaining ones
2229 * are OP_CONST. We need to push the OP_CONST values.
2231 if (o->op_type == OP_CONST)
2232 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
2234 else if (o->op_type == OP_NULL)
2238 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
2240 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
2241 if (o->op_type == OP_CONST)
2242 rop = op_append_elem(OP_LIST, rop,
2243 newSVOP(OP_CONST, o->op_flags,
2244 SvREFCNT_inc_NN(cSVOPo->op_sv)));
2251 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
2256 PERL_ARGS_ASSERT_APPLY_ATTRS;
2258 /* fake up C<use attributes $pkg,$rv,@attrs> */
2259 ENTER; /* need to protect against side-effects of 'use' */
2260 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2262 #define ATTRSMODULE "attributes"
2263 #define ATTRSMODULE_PM "attributes.pm"
2266 /* Don't force the C<use> if we don't need it. */
2267 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
2268 if (svp && *svp != &PL_sv_undef)
2269 NOOP; /* already in %INC */
2271 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
2272 newSVpvs(ATTRSMODULE), NULL);
2275 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2276 newSVpvs(ATTRSMODULE),
2278 op_prepend_elem(OP_LIST,
2279 newSVOP(OP_CONST, 0, stashsv),
2280 op_prepend_elem(OP_LIST,
2281 newSVOP(OP_CONST, 0,
2283 dup_attrlist(attrs))));
2289 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2292 OP *pack, *imop, *arg;
2295 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2300 assert(target->op_type == OP_PADSV ||
2301 target->op_type == OP_PADHV ||
2302 target->op_type == OP_PADAV);
2304 /* Ensure that attributes.pm is loaded. */
2305 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
2307 /* Need package name for method call. */
2308 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
2310 /* Build up the real arg-list. */
2311 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2313 arg = newOP(OP_PADSV, 0);
2314 arg->op_targ = target->op_targ;
2315 arg = op_prepend_elem(OP_LIST,
2316 newSVOP(OP_CONST, 0, stashsv),
2317 op_prepend_elem(OP_LIST,
2318 newUNOP(OP_REFGEN, 0,
2319 op_lvalue(arg, OP_REFGEN)),
2320 dup_attrlist(attrs)));
2322 /* Fake up a method call to import */
2323 meth = newSVpvs_share("import");
2324 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2325 op_append_elem(OP_LIST,
2326 op_prepend_elem(OP_LIST, pack, list(arg)),
2327 newSVOP(OP_METHOD_NAMED, 0, meth)));
2329 /* Combine the ops. */
2330 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
2334 =notfor apidoc apply_attrs_string
2336 Attempts to apply a list of attributes specified by the C<attrstr> and
2337 C<len> arguments to the subroutine identified by the C<cv> argument which
2338 is expected to be associated with the package identified by the C<stashpv>
2339 argument (see L<attributes>). It gets this wrong, though, in that it
2340 does not correctly identify the boundaries of the individual attribute
2341 specifications within C<attrstr>. This is not really intended for the
2342 public API, but has to be listed here for systems such as AIX which
2343 need an explicit export list for symbols. (It's called from XS code
2344 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2345 to respect attribute syntax properly would be welcome.
2351 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2352 const char *attrstr, STRLEN len)
2356 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2359 len = strlen(attrstr);
2363 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2365 const char * const sstr = attrstr;
2366 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2367 attrs = op_append_elem(OP_LIST, attrs,
2368 newSVOP(OP_CONST, 0,
2369 newSVpvn(sstr, attrstr-sstr)));
2373 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2374 newSVpvs(ATTRSMODULE),
2375 NULL, op_prepend_elem(OP_LIST,
2376 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2377 op_prepend_elem(OP_LIST,
2378 newSVOP(OP_CONST, 0,
2379 newRV(MUTABLE_SV(cv))),
2384 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2388 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
2390 PERL_ARGS_ASSERT_MY_KID;
2392 if (!o || (PL_parser && PL_parser->error_count))
2396 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2397 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2401 if (type == OP_LIST) {
2403 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2404 my_kid(kid, attrs, imopsp);
2406 } else if (type == OP_UNDEF
2412 } else if (type == OP_RV2SV || /* "our" declaration */
2414 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2415 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2416 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2418 PL_parser->in_my == KEY_our
2420 : PL_parser->in_my == KEY_state ? "state" : "my"));
2422 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2423 PL_parser->in_my = FALSE;
2424 PL_parser->in_my_stash = NULL;
2425 apply_attrs(GvSTASH(gv),
2426 (type == OP_RV2SV ? GvSV(gv) :
2427 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2428 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2431 o->op_private |= OPpOUR_INTRO;
2434 else if (type != OP_PADSV &&
2437 type != OP_PUSHMARK)
2439 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2441 PL_parser->in_my == KEY_our
2443 : PL_parser->in_my == KEY_state ? "state" : "my"));
2446 else if (attrs && type != OP_PUSHMARK) {
2449 PL_parser->in_my = FALSE;
2450 PL_parser->in_my_stash = NULL;
2452 /* check for C<my Dog $spot> when deciding package */
2453 stash = PAD_COMPNAME_TYPE(o->op_targ);
2455 stash = PL_curstash;
2456 apply_attrs_my(stash, o, attrs, imopsp);
2458 o->op_flags |= OPf_MOD;
2459 o->op_private |= OPpLVAL_INTRO;
2461 o->op_private |= OPpPAD_STATE;
2466 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2470 int maybe_scalar = 0;
2472 PERL_ARGS_ASSERT_MY_ATTRS;
2474 /* [perl #17376]: this appears to be premature, and results in code such as
2475 C< our(%x); > executing in list mode rather than void mode */
2477 if (o->op_flags & OPf_PARENS)
2487 o = my_kid(o, attrs, &rops);
2489 if (maybe_scalar && o->op_type == OP_PADSV) {
2490 o = scalar(op_append_list(OP_LIST, rops, o));
2491 o->op_private |= OPpLVAL_INTRO;
2494 /* The listop in rops might have a pushmark at the beginning,
2495 which will mess up list assignment. */
2496 LISTOP * const lrops = (LISTOP *)rops; /* for brevity */
2497 if (rops->op_type == OP_LIST &&
2498 lrops->op_first && lrops->op_first->op_type == OP_PUSHMARK)
2500 OP * const pushmark = lrops->op_first;
2501 lrops->op_first = pushmark->op_sibling;
2504 o = op_append_list(OP_LIST, o, rops);
2507 PL_parser->in_my = FALSE;
2508 PL_parser->in_my_stash = NULL;
2513 Perl_sawparens(pTHX_ OP *o)
2515 PERL_UNUSED_CONTEXT;
2517 o->op_flags |= OPf_PARENS;
2522 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2526 const OPCODE ltype = left->op_type;
2527 const OPCODE rtype = right->op_type;
2529 PERL_ARGS_ASSERT_BIND_MATCH;
2531 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2532 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2534 const char * const desc
2536 rtype == OP_SUBST || rtype == OP_TRANS
2537 || rtype == OP_TRANSR
2539 ? (int)rtype : OP_MATCH];
2540 const bool isary = ltype == OP_RV2AV || ltype == OP_PADAV;
2543 (ltype == OP_RV2AV || ltype == OP_RV2HV)
2544 ? cUNOPx(left)->op_first->op_type == OP_GV
2545 && (gv = cGVOPx_gv(cUNOPx(left)->op_first))
2546 ? varname(gv, isary ? '@' : '%', 0, NULL, 0, 1)
2549 (GV *)PL_compcv, isary ? '@' : '%', left->op_targ, NULL, 0, 1
2552 Perl_warner(aTHX_ packWARN(WARN_MISC),
2553 "Applying %s to %"SVf" will act on scalar(%"SVf")",
2556 const char * const sample = (isary
2557 ? "@array" : "%hash");
2558 Perl_warner(aTHX_ packWARN(WARN_MISC),
2559 "Applying %s to %s will act on scalar(%s)",
2560 desc, sample, sample);
2564 if (rtype == OP_CONST &&
2565 cSVOPx(right)->op_private & OPpCONST_BARE &&
2566 cSVOPx(right)->op_private & OPpCONST_STRICT)
2568 no_bareword_allowed(right);
2571 /* !~ doesn't make sense with /r, so error on it for now */
2572 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2574 yyerror("Using !~ with s///r doesn't make sense");
2575 if (rtype == OP_TRANSR && type == OP_NOT)
2576 yyerror("Using !~ with tr///r doesn't make sense");
2578 ismatchop = (rtype == OP_MATCH ||
2579 rtype == OP_SUBST ||
2580 rtype == OP_TRANS || rtype == OP_TRANSR)
2581 && !(right->op_flags & OPf_SPECIAL);
2582 if (ismatchop && right->op_private & OPpTARGET_MY) {
2584 right->op_private &= ~OPpTARGET_MY;
2586 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2589 right->op_flags |= OPf_STACKED;
2590 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
2591 ! (rtype == OP_TRANS &&
2592 right->op_private & OPpTRANS_IDENTICAL) &&
2593 ! (rtype == OP_SUBST &&
2594 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
2595 newleft = op_lvalue(left, rtype);
2598 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
2599 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2601 o = op_prepend_elem(rtype, scalar(newleft), right);
2603 return newUNOP(OP_NOT, 0, scalar(o));
2607 return bind_match(type, left,
2608 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
2612 Perl_invert(pTHX_ OP *o)
2616 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2620 =for apidoc Amx|OP *|op_scope|OP *o
2622 Wraps up an op tree with some additional ops so that at runtime a dynamic
2623 scope will be created. The original ops run in the new dynamic scope,
2624 and then, provided that they exit normally, the scope will be unwound.
2625 The additional ops used to create and unwind the dynamic scope will
2626 normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2627 instead if the ops are simple enough to not need the full dynamic scope
2634 Perl_op_scope(pTHX_ OP *o)
2638 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2639 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2640 o->op_type = OP_LEAVE;
2641 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2643 else if (o->op_type == OP_LINESEQ) {
2645 o->op_type = OP_SCOPE;
2646 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2647 kid = ((LISTOP*)o)->op_first;
2648 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2651 /* The following deals with things like 'do {1 for 1}' */
2652 kid = kid->op_sibling;
2654 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2659 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2665 Perl_block_start(pTHX_ int full)
2668 const int retval = PL_savestack_ix;
2670 pad_block_start(full);
2672 PL_hints &= ~HINT_BLOCK_SCOPE;
2673 SAVECOMPILEWARNINGS();
2674 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2676 CALL_BLOCK_HOOKS(bhk_start, full);
2682 Perl_block_end(pTHX_ I32 floor, OP *seq)
2685 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2686 OP* retval = scalarseq(seq);
2688 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
2691 CopHINTS_set(&PL_compiling, PL_hints);
2693 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2696 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
2702 =head1 Compile-time scope hooks
2704 =for apidoc Aox||blockhook_register
2706 Register a set of hooks to be called when the Perl lexical scope changes
2707 at compile time. See L<perlguts/"Compile-time scope hooks">.
2713 Perl_blockhook_register(pTHX_ BHK *hk)
2715 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2717 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2724 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
2725 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2726 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2729 OP * const o = newOP(OP_PADSV, 0);
2730 o->op_targ = offset;
2736 Perl_newPROG(pTHX_ OP *o)
2740 PERL_ARGS_ASSERT_NEWPROG;
2746 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2747 ((PL_in_eval & EVAL_KEEPERR)
2748 ? OPf_SPECIAL : 0), o);
2750 cx = &cxstack[cxstack_ix];
2751 assert(CxTYPE(cx) == CXt_EVAL);
2753 if ((cx->blk_gimme & G_WANT) == G_VOID)
2754 scalarvoid(PL_eval_root);
2755 else if ((cx->blk_gimme & G_WANT) == G_ARRAY)
2758 scalar(PL_eval_root);
2760 /* don't use LINKLIST, since PL_eval_root might indirect through
2761 * a rather expensive function call and LINKLIST evaluates its
2762 * argument more than once */
2763 PL_eval_start = op_linklist(PL_eval_root);
2764 PL_eval_root->op_private |= OPpREFCOUNTED;
2765 OpREFCNT_set(PL_eval_root, 1);
2766 PL_eval_root->op_next = 0;
2767 CALL_PEEP(PL_eval_start);
2768 finalize_optree(PL_eval_root);
2772 if (o->op_type == OP_STUB) {
2773 PL_comppad_name = 0;
2775 S_op_destroy(aTHX_ o);
2778 PL_main_root = op_scope(sawparens(scalarvoid(o)));
2779 PL_curcop = &PL_compiling;
2780 PL_main_start = LINKLIST(PL_main_root);
2781 PL_main_root->op_private |= OPpREFCOUNTED;
2782 OpREFCNT_set(PL_main_root, 1);
2783 PL_main_root->op_next = 0;
2784 CALL_PEEP(PL_main_start);
2785 finalize_optree(PL_main_root);
2788 /* Register with debugger */
2790 CV * const cv = get_cvs("DB::postponed", 0);
2794 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
2796 call_sv(MUTABLE_SV(cv), G_DISCARD);
2803 Perl_localize(pTHX_ OP *o, I32 lex)
2807 PERL_ARGS_ASSERT_LOCALIZE;
2809 if (o->op_flags & OPf_PARENS)
2810 /* [perl #17376]: this appears to be premature, and results in code such as
2811 C< our(%x); > executing in list mode rather than void mode */
2818 if ( PL_parser->bufptr > PL_parser->oldbufptr
2819 && PL_parser->bufptr[-1] == ','
2820 && ckWARN(WARN_PARENTHESIS))
2822 char *s = PL_parser->bufptr;
2825 /* some heuristics to detect a potential error */
2826 while (*s && (strchr(", \t\n", *s)))
2830 if (*s && strchr("@$%*", *s) && *++s
2831 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2834 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2836 while (*s && (strchr(", \t\n", *s)))
2842 if (sigil && (*s == ';' || *s == '=')) {
2843 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2844 "Parentheses missing around \"%s\" list",
2846 ? (PL_parser->in_my == KEY_our
2848 : PL_parser->in_my == KEY_state
2858 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
2859 PL_parser->in_my = FALSE;
2860 PL_parser->in_my_stash = NULL;
2865 Perl_jmaybe(pTHX_ OP *o)
2867 PERL_ARGS_ASSERT_JMAYBE;
2869 if (o->op_type == OP_LIST) {
2871 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2872 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
2877 PERL_STATIC_INLINE OP *
2878 S_op_std_init(pTHX_ OP *o)
2880 I32 type = o->op_type;
2882 PERL_ARGS_ASSERT_OP_STD_INIT;
2884 if (PL_opargs[type] & OA_RETSCALAR)
2886 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2887 o->op_targ = pad_alloc(type, SVs_PADTMP);
2892 PERL_STATIC_INLINE OP *
2893 S_op_integerize(pTHX_ OP *o)
2895 I32 type = o->op_type;
2897 PERL_ARGS_ASSERT_OP_INTEGERIZE;
2899 /* integerize op, unless it happens to be C<-foo>.
2900 * XXX should pp_i_negate() do magic string negation instead? */
2901 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2902 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2903 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2906 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2909 if (type == OP_NEGATE)
2910 /* XXX might want a ck_negate() for this */
2911 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2917 S_fold_constants(pTHX_ register OP *o)
2920 register OP * VOL curop;
2922 VOL I32 type = o->op_type;
2927 SV * const oldwarnhook = PL_warnhook;
2928 SV * const olddiehook = PL_diehook;
2932 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2934 if (!(PL_opargs[type] & OA_FOLDCONST))
2948 /* XXX what about the numeric ops? */
2949 if (IN_LOCALE_COMPILETIME)
2954 if (PL_parser && PL_parser->error_count)
2955 goto nope; /* Don't try to run w/ errors */
2957 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2958 const OPCODE type = curop->op_type;
2959 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2961 type != OP_SCALAR &&
2963 type != OP_PUSHMARK)
2969 curop = LINKLIST(o);
2970 old_next = o->op_next;
2974 oldscope = PL_scopestack_ix;
2975 create_eval_scope(G_FAKINGEVAL);
2977 /* Verify that we don't need to save it: */
2978 assert(PL_curcop == &PL_compiling);
2979 StructCopy(&PL_compiling, ¬_compiling, COP);
2980 PL_curcop = ¬_compiling;
2981 /* The above ensures that we run with all the correct hints of the
2982 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
2983 assert(IN_PERL_RUNTIME);
2984 PL_warnhook = PERL_WARNHOOK_FATAL;
2991 sv = *(PL_stack_sp--);
2992 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
2994 /* Can't simply swipe the SV from the pad, because that relies on
2995 the op being freed "real soon now". Under MAD, this doesn't
2996 happen (see the #ifdef below). */
2999 pad_swipe(o->op_targ, FALSE);
3002 else if (SvTEMP(sv)) { /* grab mortal temp? */
3003 SvREFCNT_inc_simple_void(sv);
3008 /* Something tried to die. Abandon constant folding. */
3009 /* Pretend the error never happened. */
3011 o->op_next = old_next;
3015 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
3016 PL_warnhook = oldwarnhook;
3017 PL_diehook = olddiehook;
3018 /* XXX note that this croak may fail as we've already blown away
3019 * the stack - eg any nested evals */
3020 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
3023 PL_warnhook = oldwarnhook;
3024 PL_diehook = olddiehook;
3025 PL_curcop = &PL_compiling;
3027 if (PL_scopestack_ix > oldscope)
3028 delete_eval_scope();
3037 if (type == OP_RV2GV)
3038 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
3040 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
3041 op_getmad(o,newop,'f');
3049 S_gen_constant_list(pTHX_ register OP *o)
3053 const I32 oldtmps_floor = PL_tmps_floor;
3056 if (PL_parser && PL_parser->error_count)
3057 return o; /* Don't attempt to run with errors */
3059 PL_op = curop = LINKLIST(o);
3062 Perl_pp_pushmark(aTHX);
3065 assert (!(curop->op_flags & OPf_SPECIAL));
3066 assert(curop->op_type == OP_RANGE);
3067 Perl_pp_anonlist(aTHX);
3068 PL_tmps_floor = oldtmps_floor;
3070 o->op_type = OP_RV2AV;
3071 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
3072 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
3073 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
3074 o->op_opt = 0; /* needs to be revisited in rpeep() */
3075 curop = ((UNOP*)o)->op_first;
3076 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
3078 op_getmad(curop,o,'O');
3087 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
3090 if (type < 0) type = -type, flags |= OPf_SPECIAL;
3091 if (!o || o->op_type != OP_LIST)
3092 o = newLISTOP(OP_LIST, 0, o, NULL);
3094 o->op_flags &= ~OPf_WANT;
3096 if (!(PL_opargs[type] & OA_MARK))
3097 op_null(cLISTOPo->op_first);
3099 OP * const kid2 = cLISTOPo->op_first->op_sibling;
3100 if (kid2 && kid2->op_type == OP_COREARGS) {
3101 op_null(cLISTOPo->op_first);
3102 kid2->op_private |= OPpCOREARGS_PUSHMARK;
3106 o->op_type = (OPCODE)type;
3107 o->op_ppaddr = PL_ppaddr[type];
3108 o->op_flags |= flags;
3110 o = CHECKOP(type, o);
3111 if (o->op_type != (unsigned)type)
3114 return fold_constants(op_integerize(op_std_init(o)));
3118 =head1 Optree Manipulation Functions
3121 /* List constructors */
3124 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
3126 Append an item to the list of ops contained directly within a list-type
3127 op, returning the lengthened list. I<first> is the list-type op,
3128 and I<last> is the op to append to the list. I<optype> specifies the
3129 intended opcode for the list. If I<first> is not already a list of the
3130 right type, it will be upgraded into one. If either I<first> or I<last>
3131 is null, the other is returned unchanged.
3137 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
3145 if (first->op_type != (unsigned)type
3146 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
3148 return newLISTOP(type, 0, first, last);
3151 if (first->op_flags & OPf_KIDS)
3152 ((LISTOP*)first)->op_last->op_sibling = last;
3154 first->op_flags |= OPf_KIDS;
3155 ((LISTOP*)first)->op_first = last;
3157 ((LISTOP*)first)->op_last = last;
3162 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
3164 Concatenate the lists of ops contained directly within two list-type ops,
3165 returning the combined list. I<first> and I<last> are the list-type ops
3166 to concatenate. I<optype> specifies the intended opcode for the list.
3167 If either I<first> or I<last> is not already a list of the right type,
3168 it will be upgraded into one. If either I<first> or I<last> is null,
3169 the other is returned unchanged.
3175 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
3183 if (first->op_type != (unsigned)type)
3184 return op_prepend_elem(type, first, last);
3186 if (last->op_type != (unsigned)type)
3187 return op_append_elem(type, first, last);
3189 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
3190 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
3191 first->op_flags |= (last->op_flags & OPf_KIDS);
3194 if (((LISTOP*)last)->op_first && first->op_madprop) {
3195 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
3197 while (mp->mad_next)
3199 mp->mad_next = first->op_madprop;
3202 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
3205 first->op_madprop = last->op_madprop;
3206 last->op_madprop = 0;
3209 S_op_destroy(aTHX_ last);
3215 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
3217 Prepend an item to the list of ops contained directly within a list-type
3218 op, returning the lengthened list. I<first> is the op to prepend to the
3219 list, and I<last> is the list-type op. I<optype> specifies the intended
3220 opcode for the list. If I<last> is not already a list of the right type,
3221 it will be upgraded into one. If either I<first> or I<last> is null,
3222 the other is returned unchanged.
3228 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
3236 if (last->op_type == (unsigned)type) {
3237 if (type == OP_LIST) { /* already a PUSHMARK there */
3238 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
3239 ((LISTOP*)last)->op_first->op_sibling = first;
3240 if (!(first->op_flags & OPf_PARENS))
3241 last->op_flags &= ~OPf_PARENS;
3244 if (!(last->op_flags & OPf_KIDS)) {
3245 ((LISTOP*)last)->op_last = first;
3246 last->op_flags |= OPf_KIDS;
3248 first->op_sibling = ((LISTOP*)last)->op_first;
3249 ((LISTOP*)last)->op_first = first;
3251 last->op_flags |= OPf_KIDS;
3255 return newLISTOP(type, 0, first, last);
3263 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
3266 Newxz(tk, 1, TOKEN);
3267 tk->tk_type = (OPCODE)optype;
3268 tk->tk_type = 12345;
3270 tk->tk_mad = madprop;
3275 Perl_token_free(pTHX_ TOKEN* tk)
3277 PERL_ARGS_ASSERT_TOKEN_FREE;
3279 if (tk->tk_type != 12345)
3281 mad_free(tk->tk_mad);
3286 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
3291 PERL_ARGS_ASSERT_TOKEN_GETMAD;
3293 if (tk->tk_type != 12345) {
3294 Perl_warner(aTHX_ packWARN(WARN_MISC),
3295 "Invalid TOKEN object ignored");
3302 /* faked up qw list? */
3304 tm->mad_type == MAD_SV &&
3305 SvPVX((SV *)tm->mad_val)[0] == 'q')
3312 /* pretend constant fold didn't happen? */
3313 if (mp->mad_key == 'f' &&
3314 (o->op_type == OP_CONST ||
3315 o->op_type == OP_GV) )
3317 token_getmad(tk,(OP*)mp->mad_val,slot);
3331 if (mp->mad_key == 'X')
3332 mp->mad_key = slot; /* just change the first one */
3342 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3351 /* pretend constant fold didn't happen? */
3352 if (mp->mad_key == 'f' &&
3353 (o->op_type == OP_CONST ||
3354 o->op_type == OP_GV) )
3356 op_getmad(from,(OP*)mp->mad_val,slot);
3363 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3366 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3372 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3381 /* pretend constant fold didn't happen? */
3382 if (mp->mad_key == 'f' &&
3383 (o->op_type == OP_CONST ||
3384 o->op_type == OP_GV) )
3386 op_getmad(from,(OP*)mp->mad_val,slot);
3393 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3396 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3400 PerlIO_printf(PerlIO_stderr(),
3401 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3407 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3425 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3429 addmad(tm, &(o->op_madprop), slot);
3433 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3454 Perl_newMADsv(pTHX_ char key, SV* sv)
3456 PERL_ARGS_ASSERT_NEWMADSV;
3458 return newMADPROP(key, MAD_SV, sv, 0);
3462 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
3464 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
3467 mp->mad_vlen = vlen;
3468 mp->mad_type = type;
3470 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3475 Perl_mad_free(pTHX_ MADPROP* mp)
3477 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3481 mad_free(mp->mad_next);
3482 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
3483 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3484 switch (mp->mad_type) {
3488 Safefree((char*)mp->mad_val);
3491 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3492 op_free((OP*)mp->mad_val);
3495 sv_free(MUTABLE_SV(mp->mad_val));
3498 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3501 PerlMemShared_free(mp);
3507 =head1 Optree construction
3509 =for apidoc Am|OP *|newNULLLIST
3511 Constructs, checks, and returns a new C<stub> op, which represents an
3512 empty list expression.
3518 Perl_newNULLLIST(pTHX)
3520 return newOP(OP_STUB, 0);
3524 S_force_list(pTHX_ OP *o)
3526 if (!o || o->op_type != OP_LIST)
3527 o = newLISTOP(OP_LIST, 0, o, NULL);
3533 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3535 Constructs, checks, and returns an op of any list type. I<type> is
3536 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3537 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3538 supply up to two ops to be direct children of the list op; they are
3539 consumed by this function and become part of the constructed op tree.
3545 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3550 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3552 NewOp(1101, listop, 1, LISTOP);
3554 listop->op_type = (OPCODE)type;
3555 listop->op_ppaddr = PL_ppaddr[type];
3558 listop->op_flags = (U8)flags;
3562 else if (!first && last)
3565 first->op_sibling = last;
3566 listop->op_first = first;
3567 listop->op_last = last;
3568 if (type == OP_LIST) {
3569 OP* const pushop = newOP(OP_PUSHMARK, 0);
3570 pushop->op_sibling = first;
3571 listop->op_first = pushop;
3572 listop->op_flags |= OPf_KIDS;
3574 listop->op_last = pushop;
3577 return CHECKOP(type, listop);
3581 =for apidoc Am|OP *|newOP|I32 type|I32 flags
3583 Constructs, checks, and returns an op of any base type (any type that
3584 has no extra fields). I<type> is the opcode. I<flags> gives the
3585 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3592 Perl_newOP(pTHX_ I32 type, I32 flags)
3597 if (type == -OP_ENTEREVAL) {
3598 type = OP_ENTEREVAL;
3599 flags |= OPpEVAL_BYTES<<8;
3602 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3603 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3604 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3605 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3607 NewOp(1101, o, 1, OP);
3608 o->op_type = (OPCODE)type;
3609 o->op_ppaddr = PL_ppaddr[type];
3610 o->op_flags = (U8)flags;
3612 o->op_latefreed = 0;
3616 o->op_private = (U8)(0 | (flags >> 8));
3617 if (PL_opargs[type] & OA_RETSCALAR)
3619 if (PL_opargs[type] & OA_TARGET)
3620 o->op_targ = pad_alloc(type, SVs_PADTMP);
3621 return CHECKOP(type, o);
3625 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3627 Constructs, checks, and returns an op of any unary type. I<type> is
3628 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3629 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3630 bits, the eight bits of C<op_private>, except that the bit with value 1
3631 is automatically set. I<first> supplies an optional op to be the direct
3632 child of the unary op; it is consumed by this function and become part
3633 of the constructed op tree.
3639 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3644 if (type == -OP_ENTEREVAL) {
3645 type = OP_ENTEREVAL;
3646 flags |= OPpEVAL_BYTES<<8;
3649 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3650 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3651 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3652 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3653 || type == OP_SASSIGN
3654 || type == OP_ENTERTRY
3655 || type == OP_NULL );
3658 first = newOP(OP_STUB, 0);
3659 if (PL_opargs[type] & OA_MARK)
3660 first = force_list(first);
3662 NewOp(1101, unop, 1, UNOP);
3663 unop->op_type = (OPCODE)type;
3664 unop->op_ppaddr = PL_ppaddr[type];
3665 unop->op_first = first;
3666 unop->op_flags = (U8)(flags | OPf_KIDS);
3667 unop->op_private = (U8)(1 | (flags >> 8));
3668 unop = (UNOP*) CHECKOP(type, unop);
3672 return fold_constants(op_integerize(op_std_init((OP *) unop)));
3676 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3678 Constructs, checks, and returns an op of any binary type. I<type>
3679 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3680 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3681 the eight bits of C<op_private>, except that the bit with value 1 or
3682 2 is automatically set as required. I<first> and I<last> supply up to
3683 two ops to be the direct children of the binary op; they are consumed
3684 by this function and become part of the constructed op tree.
3690 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3695 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3696 || type == OP_SASSIGN || type == OP_NULL );
3698 NewOp(1101, binop, 1, BINOP);
3701 first = newOP(OP_NULL, 0);
3703 binop->op_type = (OPCODE)type;
3704 binop->op_ppaddr = PL_ppaddr[type];
3705 binop->op_first = first;
3706 binop->op_flags = (U8)(flags | OPf_KIDS);
3709 binop->op_private = (U8)(1 | (flags >> 8));
3712 binop->op_private = (U8)(2 | (flags >> 8));
3713 first->op_sibling = last;
3716 binop = (BINOP*)CHECKOP(type, binop);
3717 if (binop->op_next || binop->op_type != (OPCODE)type)
3720 binop->op_last = binop->op_first->op_sibling;
3722 return fold_constants(op_integerize(op_std_init((OP *)binop)));
3725 static int uvcompare(const void *a, const void *b)
3726 __attribute__nonnull__(1)
3727 __attribute__nonnull__(2)
3728 __attribute__pure__;
3729 static int uvcompare(const void *a, const void *b)
3731 if (*((const UV *)a) < (*(const UV *)b))
3733 if (*((const UV *)a) > (*(const UV *)b))
3735 if (*((const UV *)a+1) < (*(const UV *)b+1))
3737 if (*((const UV *)a+1) > (*(const UV *)b+1))
3743 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3746 SV * const tstr = ((SVOP*)expr)->op_sv;
3749 (repl->op_type == OP_NULL)
3750 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3752 ((SVOP*)repl)->op_sv;
3755 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3756 const U8 *r = (U8*)SvPV_const(rstr, rlen);
3760 register short *tbl;
3762 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3763 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3764 I32 del = o->op_private & OPpTRANS_DELETE;
3767 PERL_ARGS_ASSERT_PMTRANS;
3769 PL_hints |= HINT_BLOCK_SCOPE;
3772 o->op_private |= OPpTRANS_FROM_UTF;
3775 o->op_private |= OPpTRANS_TO_UTF;
3777 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
3778 SV* const listsv = newSVpvs("# comment\n");
3780 const U8* tend = t + tlen;
3781 const U8* rend = r + rlen;
3795 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3796 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
3799 const U32 flags = UTF8_ALLOW_DEFAULT;
3803 t = tsave = bytes_to_utf8(t, &len);
3806 if (!to_utf && rlen) {
3808 r = rsave = bytes_to_utf8(r, &len);
3812 /* There are several snags with this code on EBCDIC:
3813 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3814 2. scan_const() in toke.c has encoded chars in native encoding which makes
3815 ranges at least in EBCDIC 0..255 range the bottom odd.
3819 U8 tmpbuf[UTF8_MAXBYTES+1];
3822 Newx(cp, 2*tlen, UV);
3824 transv = newSVpvs("");
3826 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3828 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
3830 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3834 cp[2*i+1] = cp[2*i];
3838 qsort(cp, i, 2*sizeof(UV), uvcompare);
3839 for (j = 0; j < i; j++) {
3841 diff = val - nextmin;
3843 t = uvuni_to_utf8(tmpbuf,nextmin);
3844 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3846 U8 range_mark = UTF_TO_NATIVE(0xff);
3847 t = uvuni_to_utf8(tmpbuf, val - 1);
3848 sv_catpvn(transv, (char *)&range_mark, 1);
3849 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3856 t = uvuni_to_utf8(tmpbuf,nextmin);
3857 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3859 U8 range_mark = UTF_TO_NATIVE(0xff);
3860 sv_catpvn(transv, (char *)&range_mark, 1);
3862 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
3863 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3864 t = (const U8*)SvPVX_const(transv);
3865 tlen = SvCUR(transv);
3869 else if (!rlen && !del) {
3870 r = t; rlen = tlen; rend = tend;
3873 if ((!rlen && !del) || t == r ||
3874 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
3876 o->op_private |= OPpTRANS_IDENTICAL;
3880 while (t < tend || tfirst <= tlast) {
3881 /* see if we need more "t" chars */
3882 if (tfirst > tlast) {
3883 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3885 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
3887 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3894 /* now see if we need more "r" chars */
3895 if (rfirst > rlast) {
3897 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3899 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
3901 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3910 rfirst = rlast = 0xffffffff;
3914 /* now see which range will peter our first, if either. */
3915 tdiff = tlast - tfirst;
3916 rdiff = rlast - rfirst;
3923 if (rfirst == 0xffffffff) {
3924 diff = tdiff; /* oops, pretend rdiff is infinite */
3926 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
3927 (long)tfirst, (long)tlast);
3929 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
3933 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
3934 (long)tfirst, (long)(tfirst + diff),
3937 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
3938 (long)tfirst, (long)rfirst);
3940 if (rfirst + diff > max)
3941 max = rfirst + diff;
3943 grows = (tfirst < rfirst &&
3944 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
3956 else if (max > 0xff)
3961 PerlMemShared_free(cPVOPo->op_pv);
3962 cPVOPo->op_pv = NULL;
3964 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
3966 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
3967 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
3968 PAD_SETSV(cPADOPo->op_padix, swash);
3970 SvREADONLY_on(swash);
3972 cSVOPo->op_sv = swash;
3974 SvREFCNT_dec(listsv);
3975 SvREFCNT_dec(transv);
3977 if (!del && havefinal && rlen)
3978 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
3979 newSVuv((UV)final), 0);
3982 o->op_private |= OPpTRANS_GROWS;
3988 op_getmad(expr,o,'e');
3989 op_getmad(repl,o,'r');
3997 tbl = (short*)cPVOPo->op_pv;
3999 Zero(tbl, 256, short);
4000 for (i = 0; i < (I32)tlen; i++)
4002 for (i = 0, j = 0; i < 256; i++) {
4004 if (j >= (I32)rlen) {
4013 if (i < 128 && r[j] >= 128)
4023 o->op_private |= OPpTRANS_IDENTICAL;
4025 else if (j >= (I32)rlen)
4030 PerlMemShared_realloc(tbl,
4031 (0x101+rlen-j) * sizeof(short));
4032 cPVOPo->op_pv = (char*)tbl;
4034 tbl[0x100] = (short)(rlen - j);
4035 for (i=0; i < (I32)rlen - j; i++)
4036 tbl[0x101+i] = r[j+i];
4040 if (!rlen && !del) {
4043 o->op_private |= OPpTRANS_IDENTICAL;
4045 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
4046 o->op_private |= OPpTRANS_IDENTICAL;
4048 for (i = 0; i < 256; i++)
4050 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
4051 if (j >= (I32)rlen) {
4053 if (tbl[t[i]] == -1)
4059 if (tbl[t[i]] == -1) {
4060 if (t[i] < 128 && r[j] >= 128)
4067 if(del && rlen == tlen) {
4068 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
4069 } else if(rlen > tlen) {
4070 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
4074 o->op_private |= OPpTRANS_GROWS;
4076 op_getmad(expr,o,'e');
4077 op_getmad(repl,o,'r');
4087 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
4089 Constructs, checks, and returns an op of any pattern matching type.
4090 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
4091 and, shifted up eight bits, the eight bits of C<op_private>.
4097 Perl_newPMOP(pTHX_ I32 type, I32 flags)
4102 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
4104 NewOp(1101, pmop, 1, PMOP);
4105 pmop->op_type = (OPCODE)type;
4106 pmop->op_ppaddr = PL_ppaddr[type];
4107 pmop->op_flags = (U8)flags;
4108 pmop->op_private = (U8)(0 | (flags >> 8));
4110 if (PL_hints & HINT_RE_TAINT)
4111 pmop->op_pmflags |= PMf_RETAINT;
4112 if (IN_LOCALE_COMPILETIME) {
4113 set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET);
4115 else if ((! (PL_hints & HINT_BYTES))
4116 /* Both UNI_8_BIT and locale :not_characters imply Unicode */
4117 && (PL_hints & (HINT_UNI_8_BIT|HINT_LOCALE_NOT_CHARS)))
4119 set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET);
4121 if (PL_hints & HINT_RE_FLAGS) {
4122 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4123 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
4125 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
4126 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4127 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0
4129 if (reflags && SvOK(reflags)) {
4130 set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags));
4136 assert(SvPOK(PL_regex_pad[0]));
4137 if (SvCUR(PL_regex_pad[0])) {
4138 /* Pop off the "packed" IV from the end. */
4139 SV *const repointer_list = PL_regex_pad[0];
4140 const char *p = SvEND(repointer_list) - sizeof(IV);
4141 const IV offset = *((IV*)p);
4143 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
4145 SvEND_set(repointer_list, p);
4147 pmop->op_pmoffset = offset;
4148 /* This slot should be free, so assert this: */
4149 assert(PL_regex_pad[offset] == &PL_sv_undef);
4151 SV * const repointer = &PL_sv_undef;
4152 av_push(PL_regex_padav, repointer);
4153 pmop->op_pmoffset = av_len(PL_regex_padav);
4154 PL_regex_pad = AvARRAY(PL_regex_padav);
4158 return CHECKOP(type, pmop);
4161 /* Given some sort of match op o, and an expression expr containing a
4162 * pattern, either compile expr into a regex and attach it to o (if it's
4163 * constant), or convert expr into a runtime regcomp op sequence (if it's
4166 * isreg indicates that the pattern is part of a regex construct, eg
4167 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
4168 * split "pattern", which aren't. In the former case, expr will be a list
4169 * if the pattern contains more than one term (eg /a$b/) or if it contains
4170 * a replacement, ie s/// or tr///.
4174 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
4179 I32 repl_has_vars = 0;
4183 PERL_ARGS_ASSERT_PMRUNTIME;
4186 o->op_type == OP_SUBST
4187 || o->op_type == OP_TRANS || o->op_type == OP_TRANSR
4189 /* last element in list is the replacement; pop it */
4191 repl = cLISTOPx(expr)->op_last;
4192 kid = cLISTOPx(expr)->op_first;
4193 while (kid->op_sibling != repl)
4194 kid = kid->op_sibling;
4195 kid->op_sibling = NULL;
4196 cLISTOPx(expr)->op_last = kid;
4199 if (isreg && expr->op_type == OP_LIST &&
4200 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
4202 /* convert single element list to element */
4203 OP* const oe = expr;
4204 expr = cLISTOPx(oe)->op_first->op_sibling;
4205 cLISTOPx(oe)->op_first->op_sibling = NULL;
4206 cLISTOPx(oe)->op_last = NULL;
4210 if (o->op_type == OP_TRANS || o->op_type == OP_TRANSR) {
4211 return pmtrans(o, expr, repl);
4214 reglist = isreg && expr->op_type == OP_LIST;
4218 PL_hints |= HINT_BLOCK_SCOPE;
4221 if (expr->op_type == OP_CONST) {
4222 SV *pat = ((SVOP*)expr)->op_sv;
4223 U32 pm_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4225 if (o->op_flags & OPf_SPECIAL)
4226 pm_flags |= RXf_SPLIT;
4229 assert (SvUTF8(pat));
4230 } else if (SvUTF8(pat)) {
4231 /* Not doing UTF-8, despite what the SV says. Is this only if we're
4232 trapped in use 'bytes'? */
4233 /* Make a copy of the octet sequence, but without the flag on, as
4234 the compiler now honours the SvUTF8 flag on pat. */
4236 const char *const p = SvPV(pat, len);
4237 pat = newSVpvn_flags(p, len, SVs_TEMP);
4240 PM_SETRE(pm, CALLREGCOMP(pat, pm_flags));
4243 op_getmad(expr,(OP*)pm,'e');
4249 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
4250 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
4252 : OP_REGCMAYBE),0,expr);
4254 NewOp(1101, rcop, 1, LOGOP);
4255 rcop->op_type = OP_REGCOMP;
4256 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
4257 rcop->op_first = scalar(expr);
4258 rcop->op_flags |= OPf_KIDS
4259 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
4260 | (reglist ? OPf_STACKED : 0);
4261 rcop->op_private = 1;
4264 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
4266 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
4267 if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1;
4269 /* establish postfix order */
4270 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
4272 rcop->op_next = expr;
4273 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
4276 rcop->op_next = LINKLIST(expr);
4277 expr->op_next = (OP*)rcop;
4280 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
4285 if (pm->op_pmflags & PMf_EVAL) {
4287 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
4288 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
4290 else if (repl->op_type == OP_CONST)
4294 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
4295 if (curop->op_type == OP_SCOPE
4296 || curop->op_type == OP_LEAVE
4297 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
4298 if (curop->op_type == OP_GV) {
4299 GV * const gv = cGVOPx_gv(curop);
4301 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
4304 else if (curop->op_type == OP_RV2CV)
4306 else if (curop->op_type == OP_RV2SV ||
4307 curop->op_type == OP_RV2AV ||
4308 curop->op_type == OP_RV2HV ||
4309 curop->op_type == OP_RV2GV) {
4310 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
4313 else if (curop->op_type == OP_PADSV ||
4314 curop->op_type == OP_PADAV ||
4315 curop->op_type == OP_PADHV ||
4316 curop->op_type == OP_PADANY)
4320 else if (curop->op_type == OP_PUSHRE)
4321 NOOP; /* Okay here, dangerous in newASSIGNOP */
4331 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
4333 pm->op_pmflags |= PMf_CONST; /* const for long enough */
4334 op_prepend_elem(o->op_type, scalar(repl), o);
4337 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
4338 pm->op_pmflags |= PMf_MAYBE_CONST;
4340 NewOp(1101, rcop, 1, LOGOP);
4341 rcop->op_type = OP_SUBSTCONT;
4342 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
4343 rcop->op_first = scalar(repl);
4344 rcop->op_flags |= OPf_KIDS;
4345 rcop->op_private = 1;
4348 /* establish postfix order */
4349 rcop->op_next = LINKLIST(repl);
4350 repl->op_next = (OP*)rcop;
4352 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
4353 assert(!(pm->op_pmflags & PMf_ONCE));
4354 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
4363 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
4365 Constructs, checks, and returns an op of any type that involves an
4366 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
4367 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
4368 takes ownership of one reference to it.
4374 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
4379 PERL_ARGS_ASSERT_NEWSVOP;
4381 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4382 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4383 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4385 NewOp(1101, svop, 1, SVOP);
4386 svop->op_type = (OPCODE)type;
4387 svop->op_ppaddr = PL_ppaddr[type];
4389 svop->op_next = (OP*)svop;
4390 svop->op_flags = (U8)flags;
4391 if (PL_opargs[type] & OA_RETSCALAR)
4393 if (PL_opargs[type] & OA_TARGET)
4394 svop->op_targ = pad_alloc(type, SVs_PADTMP);
4395 return CHECKOP(type, svop);
4401 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
4403 Constructs, checks, and returns an op of any type that involves a
4404 reference to a pad element. I<type> is the opcode. I<flags> gives the
4405 eight bits of C<op_flags>. A pad slot is automatically allocated, and
4406 is populated with I<sv>; this function takes ownership of one reference
4409 This function only exists if Perl has been compiled to use ithreads.
4415 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
4420 PERL_ARGS_ASSERT_NEWPADOP;
4422 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4423 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4424 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4426 NewOp(1101, padop, 1, PADOP);
4427 padop->op_type = (OPCODE)type;
4428 padop->op_ppaddr = PL_ppaddr[type];
4429 padop->op_padix = pad_alloc(type, SVs_PADTMP);
4430 SvREFCNT_dec(PAD_SVl(padop->op_padix));
4431 PAD_SETSV(padop->op_padix, sv);
4434 padop->op_next = (OP*)padop;
4435 padop->op_flags = (U8)flags;
4436 if (PL_opargs[type] & OA_RETSCALAR)
4438 if (PL_opargs[type] & OA_TARGET)
4439 padop->op_targ = pad_alloc(type, SVs_PADTMP);
4440 return CHECKOP(type, padop);
4443 #endif /* !USE_ITHREADS */
4446 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
4448 Constructs, checks, and returns an op of any type that involves an
4449 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
4450 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
4451 reference; calling this function does not transfer ownership of any
4458 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
4462 PERL_ARGS_ASSERT_NEWGVOP;
4466 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4468 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4473 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
4475 Constructs, checks, and returns an op of any type that involves an
4476 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
4477 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
4478 must have been allocated using L</PerlMemShared_malloc>; the memory will
4479 be freed when the op is destroyed.
4485 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
4490 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4492 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4494 NewOp(1101, pvop, 1, PVOP);
4495 pvop->op_type = (OPCODE)type;
4496 pvop->op_ppaddr = PL_ppaddr[type];
4498 pvop->op_next = (OP*)pvop;
4499 pvop->op_flags = (U8)flags;
4500 if (PL_opargs[type] & OA_RETSCALAR)
4502 if (PL_opargs[type] & OA_TARGET)
4503 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
4504 return CHECKOP(type, pvop);
4512 Perl_package(pTHX_ OP *o)
4515 SV *const sv = cSVOPo->op_sv;
4520 PERL_ARGS_ASSERT_PACKAGE;
4522 SAVEGENERICSV(PL_curstash);
4523 save_item(PL_curstname);
4525 PL_curstash = (HV *)SvREFCNT_inc(gv_stashsv(sv, GV_ADD));
4527 sv_setsv(PL_curstname, sv);
4529 PL_hints |= HINT_BLOCK_SCOPE;
4530 PL_parser->copline = NOLINE;
4531 PL_parser->expect = XSTATE;
4536 if (!PL_madskills) {
4541 pegop = newOP(OP_NULL,0);
4542 op_getmad(o,pegop,'P');
4548 Perl_package_version( pTHX_ OP *v )
4551 U32 savehints = PL_hints;
4552 PERL_ARGS_ASSERT_PACKAGE_VERSION;
4553 PL_hints &= ~HINT_STRICT_VARS;
4554 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
4555 PL_hints = savehints;
4564 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
4571 OP *pegop = newOP(OP_NULL,0);
4573 SV *use_version = NULL;
4575 PERL_ARGS_ASSERT_UTILIZE;
4577 if (idop->op_type != OP_CONST)
4578 Perl_croak(aTHX_ "Module name must be constant");
4581 op_getmad(idop,pegop,'U');
4586 SV * const vesv = ((SVOP*)version)->op_sv;
4589 op_getmad(version,pegop,'V');
4590 if (!arg && !SvNIOKp(vesv)) {
4597 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
4598 Perl_croak(aTHX_ "Version number must be a constant number");
4600 /* Make copy of idop so we don't free it twice */
4601 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
4603 /* Fake up a method call to VERSION */
4604 meth = newSVpvs_share("VERSION");
4605 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
4606 op_append_elem(OP_LIST,
4607 op_prepend_elem(OP_LIST, pack, list(version)),
4608 newSVOP(OP_METHOD_NAMED, 0, meth)));
4612 /* Fake up an import/unimport */
4613 if (arg && arg->op_type == OP_STUB) {
4615 op_getmad(arg,pegop,'S');
4616 imop = arg; /* no import on explicit () */
4618 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
4619 imop = NULL; /* use 5.0; */
4621 use_version = ((SVOP*)idop)->op_sv;
4623 idop->op_private |= OPpCONST_NOVER;
4629 op_getmad(arg,pegop,'A');
4631 /* Make copy of idop so we don't free it twice */
4632 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
4634 /* Fake up a method call to import/unimport */
4636 ? newSVpvs_share("import") : newSVpvs_share("unimport");
4637 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
4638 op_append_elem(OP_LIST,
4639 op_prepend_elem(OP_LIST, pack, list(arg)),
4640 newSVOP(OP_METHOD_NAMED, 0, meth)));
4643 /* Fake up the BEGIN {}, which does its thing immediately. */
4645 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
4648 op_append_elem(OP_LINESEQ,
4649 op_append_elem(OP_LINESEQ,
4650 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
4651 newSTATEOP(0, NULL, veop)),
4652 newSTATEOP(0, NULL, imop) ));
4655 HV * const hinthv = GvHV(PL_hintgv);
4656 const bool hhoff = !hinthv || !(PL_hints & HINT_LOCALIZE_HH);
4659 * feature bundle that corresponds to the required version. */
4660 use_version = sv_2mortal(new_version(use_version));
4661 S_enable_feature_bundle(aTHX_ use_version);
4663 /* If a version >= 5.11.0 is requested, strictures are on by default! */
4664 if (vcmp(use_version,
4665 sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) {
4666 if (hhoff || !hv_exists(hinthv, "strict/refs", 11))
4667 PL_hints |= HINT_STRICT_REFS;
4668 if (hhoff || !hv_exists(hinthv, "strict/subs", 11))
4669 PL_hints |= HINT_STRICT_SUBS;
4670 if (hhoff || !hv_exists(hinthv, "strict/vars", 11))
4671 PL_hints |= HINT_STRICT_VARS;
4673 /* otherwise they are off */
4675 if (hhoff || !hv_exists(hinthv, "strict/refs", 11))
4676 PL_hints &= ~HINT_STRICT_REFS;
4677 if (hhoff || !hv_exists(hinthv, "strict/subs", 11))
4678 PL_hints &= ~HINT_STRICT_SUBS;
4679 if (hhoff || !hv_exists(hinthv, "strict/vars", 11))
4680 PL_hints &= ~HINT_STRICT_VARS;
4684 /* The "did you use incorrect case?" warning used to be here.
4685 * The problem is that on case-insensitive filesystems one
4686 * might get false positives for "use" (and "require"):
4687 * "use Strict" or "require CARP" will work. This causes
4688 * portability problems for the script: in case-strict
4689 * filesystems the script will stop working.
4691 * The "incorrect case" warning checked whether "use Foo"
4692 * imported "Foo" to your namespace, but that is wrong, too:
4693 * there is no requirement nor promise in the language that
4694 * a Foo.pm should or would contain anything in package "Foo".
4696 * There is very little Configure-wise that can be done, either:
4697 * the case-sensitivity of the build filesystem of Perl does not
4698 * help in guessing the case-sensitivity of the runtime environment.
4701 PL_hints |= HINT_BLOCK_SCOPE;
4702 PL_parser->copline = NOLINE;
4703 PL_parser->expect = XSTATE;
4704 PL_cop_seqmax++; /* Purely for B::*'s benefit */
4705 if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */
4709 if (!PL_madskills) {
4710 /* FIXME - don't allocate pegop if !PL_madskills */
4719 =head1 Embedding Functions
4721 =for apidoc load_module
4723 Loads the module whose name is pointed to by the string part of name.
4724 Note that the actual module name, not its filename, should be given.
4725 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
4726 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
4727 (or 0 for no flags). ver, if specified and not NULL, provides version semantics
4728 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
4729 arguments can be used to specify arguments to the module's import()
4730 method, similar to C<use Foo::Bar VERSION LIST>. They must be
4731 terminated with a final NULL pointer. Note that this list can only
4732 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
4733 Otherwise at least a single NULL pointer to designate the default
4734 import list is required.
4736 The reference count for each specified C<SV*> parameter is decremented.
4741 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
4745 PERL_ARGS_ASSERT_LOAD_MODULE;
4747 va_start(args, ver);
4748 vload_module(flags, name, ver, &args);
4752 #ifdef PERL_IMPLICIT_CONTEXT
4754 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
4758 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
4759 va_start(args, ver);
4760 vload_module(flags, name, ver, &args);
4766 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
4770 OP * const modname = newSVOP(OP_CONST, 0, name);
4772 PERL_ARGS_ASSERT_VLOAD_MODULE;
4774 modname->op_private |= OPpCONST_BARE;
4776 veop = newSVOP(OP_CONST, 0, ver);
4780 if (flags & PERL_LOADMOD_NOIMPORT) {
4781 imop = sawparens(newNULLLIST());
4783 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
4784 imop = va_arg(*args, OP*);
4789 sv = va_arg(*args, SV*);
4791 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
4792 sv = va_arg(*args, SV*);
4796 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
4797 * that it has a PL_parser to play with while doing that, and also
4798 * that it doesn't mess with any existing parser, by creating a tmp
4799 * new parser with lex_start(). This won't actually be used for much,
4800 * since pp_require() will create another parser for the real work. */
4803 SAVEVPTR(PL_curcop);
4804 lex_start(NULL, NULL, LEX_START_SAME_FILTER);
4805 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
4806 veop, modname, imop);
4811 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
4817 PERL_ARGS_ASSERT_DOFILE;
4819 if (!force_builtin) {
4820 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
4821 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
4822 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
4823 gv = gvp ? *gvp : NULL;
4827 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
4828 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
4829 op_append_elem(OP_LIST, term,
4830 scalar(newUNOP(OP_RV2CV, 0,
4831 newGVOP(OP_GV, 0, gv))))));
4834 doop = newUNOP(OP_DOFILE, 0, scalar(term));
4840 =head1 Optree construction
4842 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
4844 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
4845 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
4846 be set automatically, and, shifted up eight bits, the eight bits of
4847 C<op_private>, except that the bit with value 1 or 2 is automatically
4848 set as required. I<listval> and I<subscript> supply the parameters of
4849 the slice; they are consumed by this function and become part of the
4850 constructed op tree.
4856 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
4858 return newBINOP(OP_LSLICE, flags,
4859 list(force_list(subscript)),
4860 list(force_list(listval)) );
4864 S_is_list_assignment(pTHX_ register const OP *o)
4872 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
4873 o = cUNOPo->op_first;
4875 flags = o->op_flags;
4877 if (type == OP_COND_EXPR) {
4878 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
4879 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
4884 yyerror("Assignment to both a list and a scalar");
4888 if (type == OP_LIST &&
4889 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
4890 o->op_private & OPpLVAL_INTRO)
4893 if (type == OP_LIST || flags & OPf_PARENS ||
4894 type == OP_RV2AV || type == OP_RV2HV ||
4895 type == OP_ASLICE || type == OP_HSLICE)
4898 if (type == OP_PADAV || type == OP_PADHV)
4901 if (type == OP_RV2SV)
4908 Helper function for newASSIGNOP to detection commonality between the
4909 lhs and the rhs. Marks all variables with PL_generation. If it
4910 returns TRUE the assignment must be able to handle common variables.
4912 PERL_STATIC_INLINE bool
4913 S_aassign_common_vars(pTHX_ OP* o)
4916 for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) {
4917 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
4918 if (curop->op_type == OP_GV) {
4919 GV *gv = cGVOPx_gv(curop);
4921 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4923 GvASSIGN_GENERATION_set(gv, PL_generation);
4925 else if (curop->op_type == OP_PADSV ||
4926 curop->op_type == OP_PADAV ||
4927 curop->op_type == OP_PADHV ||
4928 curop->op_type == OP_PADANY)
4930 if (PAD_COMPNAME_GEN(curop->op_targ)
4931 == (STRLEN)PL_generation)
4933 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
4936 else if (curop->op_type == OP_RV2CV)
4938 else if (curop->op_type == OP_RV2SV ||
4939 curop->op_type == OP_RV2AV ||
4940 curop->op_type == OP_RV2HV ||
4941 curop->op_type == OP_RV2GV) {
4942 if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */
4945 else if (curop->op_type == OP_PUSHRE) {
4947 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
4948 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
4950 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4952 GvASSIGN_GENERATION_set(gv, PL_generation);
4956 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
4959 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4961 GvASSIGN_GENERATION_set(gv, PL_generation);
4969 if (curop->op_flags & OPf_KIDS) {
4970 if (aassign_common_vars(curop))
4978 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
4980 Constructs, checks, and returns an assignment op. I<left> and I<right>
4981 supply the parameters of the assignment; they are consumed by this
4982 function and become part of the constructed op tree.
4984 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
4985 a suitable conditional optree is constructed. If I<optype> is the opcode
4986 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
4987 performs the binary operation and assigns the result to the left argument.
4988 Either way, if I<optype> is non-zero then I<flags> has no effect.
4990 If I<optype> is zero, then a plain scalar or list assignment is
4991 constructed. Which type of assignment it is is automatically determined.
4992 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
4993 will be set automatically, and, shifted up eight bits, the eight bits
4994 of C<op_private>, except that the bit with value 1 or 2 is automatically
5001 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
5007 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
5008 return newLOGOP(optype, 0,
5009 op_lvalue(scalar(left), optype),
5010 newUNOP(OP_SASSIGN, 0, scalar(right)));
5013 return newBINOP(optype, OPf_STACKED,
5014 op_lvalue(scalar(left), optype), scalar(right));
5018 if (is_list_assignment(left)) {
5019 static const char no_list_state[] = "Initialization of state variables"
5020 " in list context currently forbidden";
5022 bool maybe_common_vars = TRUE;
5025 left = op_lvalue(left, OP_AASSIGN);
5026 curop = list(force_list(left));
5027 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
5028 o->op_private = (U8)(0 | (flags >> 8));
5030 if ((left->op_type == OP_LIST
5031 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
5033 OP* lop = ((LISTOP*)left)->op_first;
5034 maybe_common_vars = FALSE;
5036 if (lop->op_type == OP_PADSV ||
5037 lop->op_type == OP_PADAV ||
5038 lop->op_type == OP_PADHV ||
5039 lop->op_type == OP_PADANY) {
5040 if (!(lop->op_private & OPpLVAL_INTRO))
5041 maybe_common_vars = TRUE;
5043 if (lop->op_private & OPpPAD_STATE) {
5044 if (left->op_private & OPpLVAL_INTRO) {
5045 /* Each variable in state($a, $b, $c) = ... */
5048 /* Each state variable in
5049 (state $a, my $b, our $c, $d, undef) = ... */
5051 yyerror(no_list_state);
5053 /* Each my variable in
5054 (state $a, my $b, our $c, $d, undef) = ... */
5056 } else if (lop->op_type == OP_UNDEF ||
5057 lop->op_type == OP_PUSHMARK) {
5058 /* undef may be interesting in
5059 (state $a, undef, state $c) */
5061 /* Other ops in the list. */
5062 maybe_common_vars = TRUE;
5064 lop = lop->op_sibling;
5067 else if ((left->op_private & OPpLVAL_INTRO)
5068 && ( left->op_type == OP_PADSV
5069 || left->op_type == OP_PADAV
5070 || left->op_type == OP_PADHV
5071 || left->op_type == OP_PADANY))
5073 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
5074 if (left->op_private & OPpPAD_STATE) {
5075 /* All single variable list context state assignments, hence
5085 yyerror(no_list_state);
5089 /* PL_generation sorcery:
5090 * an assignment like ($a,$b) = ($c,$d) is easier than
5091 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
5092 * To detect whether there are common vars, the global var
5093 * PL_generation is incremented for each assign op we compile.
5094 * Then, while compiling the assign op, we run through all the
5095 * variables on both sides of the assignment, setting a spare slot
5096 * in each of them to PL_generation. If any of them already have
5097 * that value, we know we've got commonality. We could use a
5098 * single bit marker, but then we'd have to make 2 passes, first
5099 * to clear the flag, then to test and set it. To find somewhere
5100 * to store these values, evil chicanery is done with SvUVX().
5103 if (maybe_common_vars) {
5105 if (aassign_common_vars(o))
5106 o->op_private |= OPpASSIGN_COMMON;
5110 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
5111 OP* tmpop = ((LISTOP*)right)->op_first;
5112 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
5113 PMOP * const pm = (PMOP*)tmpop;
5114 if (left->op_type == OP_RV2AV &&
5115 !(left->op_private & OPpLVAL_INTRO) &&
5116 !(o->op_private & OPpASSIGN_COMMON) )
5118 tmpop = ((UNOP*)left)->op_first;
5119 if (tmpop->op_type == OP_GV
5121 && !pm->op_pmreplrootu.op_pmtargetoff
5123 && !pm->op_pmreplrootu.op_pmtargetgv
5127 pm->op_pmreplrootu.op_pmtargetoff
5128 = cPADOPx(tmpop)->op_padix;
5129 cPADOPx(tmpop)->op_padix = 0; /* steal it */
5131 pm->op_pmreplrootu.op_pmtargetgv
5132 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
5133 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
5135 pm->op_pmflags |= PMf_ONCE;
5136 tmpop = cUNOPo->op_first; /* to list (nulled) */
5137 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
5138 tmpop->op_sibling = NULL; /* don't free split */
5139 right->op_next = tmpop->op_next; /* fix starting loc */
5140 op_free(o); /* blow off assign */
5141 right->op_flags &= ~OPf_WANT;
5142 /* "I don't know and I don't care." */
5147 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
5148 ((LISTOP*)right)->op_last->op_type == OP_CONST)
5150 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
5151 if (SvIOK(sv) && SvIVX(sv) == 0)
5152 sv_setiv(sv, PL_modcount+1);
5160 right = newOP(OP_UNDEF, 0);
5161 if (right->op_type == OP_READLINE) {
5162 right->op_flags |= OPf_STACKED;
5163 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
5167 o = newBINOP(OP_SASSIGN, flags,
5168 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
5174 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
5176 Constructs a state op (COP). The state op is normally a C<nextstate> op,
5177 but will be a C<dbstate> op if debugging is enabled for currently-compiled
5178 code. The state op is populated from L</PL_curcop> (or L</PL_compiling>).
5179 If I<label> is non-null, it supplies the name of a label to attach to
5180 the state op; this function takes ownership of the memory pointed at by
5181 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
5184 If I<o> is null, the state op is returned. Otherwise the state op is
5185 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
5186 is consumed by this function and becomes part of the returned op tree.
5192 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
5195 const U32 seq = intro_my();
5198 NewOp(1101, cop, 1, COP);
5199 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
5200 cop->op_type = OP_DBSTATE;
5201 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
5204 cop->op_type = OP_NEXTSTATE;
5205 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
5207 cop->op_flags = (U8)flags;
5208 CopHINTS_set(cop, PL_hints);
5210 cop->op_private |= NATIVE_HINTS;
5212 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
5213 cop->op_next = (OP*)cop;
5216 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
5217 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
5219 Perl_cop_store_label(aTHX_ cop, label, strlen(label), 0);
5221 PL_hints |= HINT_BLOCK_SCOPE;
5222 /* It seems that we need to defer freeing this pointer, as other parts
5223 of the grammar end up wanting to copy it after this op has been
5228 if (PL_parser && PL_parser->copline == NOLINE)
5229 CopLINE_set(cop, CopLINE(PL_curcop));
5231 CopLINE_set(cop, PL_parser->copline);
5233 PL_parser->copline = NOLINE;
5236 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
5238 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
5240 CopSTASH_set(cop, PL_curstash);
5242 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
5243 /* this line can have a breakpoint - store the cop in IV */
5244 AV *av = CopFILEAVx(PL_curcop);
5246 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
5247 if (svp && *svp != &PL_sv_undef ) {
5248 (void)SvIOK_on(*svp);
5249 SvIV_set(*svp, PTR2IV(cop));
5254 if (flags & OPf_SPECIAL)
5256 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
5260 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
5262 Constructs, checks, and returns a logical (flow control) op. I<type>
5263 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
5264 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
5265 the eight bits of C<op_private>, except that the bit with value 1 is
5266 automatically set. I<first> supplies the expression controlling the
5267 flow, and I<other> supplies the side (alternate) chain of ops; they are
5268 consumed by this function and become part of the constructed op tree.
5274 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
5278 PERL_ARGS_ASSERT_NEWLOGOP;
5280 return new_logop(type, flags, &first, &other);
5284 S_search_const(pTHX_ OP *o)
5286 PERL_ARGS_ASSERT_SEARCH_CONST;
5288 switch (o->op_type) {
5292 if (o->op_flags & OPf_KIDS)
5293 return search_const(cUNOPo->op_first);
5300 if (!(o->op_flags & OPf_KIDS))
5302 kid = cLISTOPo->op_first;
5304 switch (kid->op_type) {
5308 kid = kid->op_sibling;
5311 if (kid != cLISTOPo->op_last)
5317 kid = cLISTOPo->op_last;
5319 return search_const(kid);
5327 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
5335 int prepend_not = 0;
5337 PERL_ARGS_ASSERT_NEW_LOGOP;
5342 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
5343 return newBINOP(type, flags, scalar(first), scalar(other));
5345 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
5347 scalarboolean(first);
5348 /* optimize AND and OR ops that have NOTs as children */
5349 if (first->op_type == OP_NOT
5350 && (first->op_flags & OPf_KIDS)
5351 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
5352 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
5354 if (type == OP_AND || type == OP_OR) {
5360 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
5362 prepend_not = 1; /* prepend a NOT op later */
5366 /* search for a constant op that could let us fold the test */
5367 if ((cstop = search_const(first))) {
5368 if (cstop->op_private & OPpCONST_STRICT)
5369 no_bareword_allowed(cstop);
5370 else if ((cstop->op_private & OPpCONST_BARE))
5371 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
5372 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
5373 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
5374 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
5376 if (other->op_type == OP_CONST)
5377 other->op_private |= OPpCONST_SHORTCIRCUIT;
5379 OP *newop = newUNOP(OP_NULL, 0, other);
5380 op_getmad(first, newop, '1');
5381 newop->op_targ = type; /* set "was" field */
5385 if (other->op_type == OP_LEAVE)
5386 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
5387 else if (other->op_type == OP_MATCH
5388 || other->op_type == OP_SUBST
5389 || other->op_type == OP_TRANSR
5390 || other->op_type == OP_TRANS)
5391 /* Mark the op as being unbindable with =~ */
5392 other->op_flags |= OPf_SPECIAL;
5396 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
5397 const OP *o2 = other;
5398 if ( ! (o2->op_type == OP_LIST
5399 && (( o2 = cUNOPx(o2)->op_first))
5400 && o2->op_type == OP_PUSHMARK
5401 && (( o2 = o2->op_sibling)) )
5404 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
5405 || o2->op_type == OP_PADHV)
5406 && o2->op_private & OPpLVAL_INTRO
5407 && !(o2->op_private & OPpPAD_STATE))
5409 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
5410 "Deprecated use of my() in false conditional");
5414 if (first->op_type == OP_CONST)
5415 first->op_private |= OPpCONST_SHORTCIRCUIT;
5417 first = newUNOP(OP_NULL, 0, first);
5418 op_getmad(other, first, '2');
5419 first->op_targ = type; /* set "was" field */
5426 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
5427 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
5429 const OP * const k1 = ((UNOP*)first)->op_first;
5430 const OP * const k2 = k1->op_sibling;
5432 switch (first->op_type)
5435 if (k2 && k2->op_type == OP_READLINE
5436 && (k2->op_flags & OPf_STACKED)
5437 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5439 warnop = k2->op_type;
5444 if (k1->op_type == OP_READDIR
5445 || k1->op_type == OP_GLOB
5446 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5447 || k1->op_type == OP_EACH
5448 || k1->op_type == OP_AEACH)
5450 warnop = ((k1->op_type == OP_NULL)
5451 ? (OPCODE)k1->op_targ : k1->op_type);
5456 const line_t oldline = CopLINE(PL_curcop);
5457 CopLINE_set(PL_curcop, PL_parser->copline);
5458 Perl_warner(aTHX_ packWARN(WARN_MISC),
5459 "Value of %s%s can be \"0\"; test with defined()",
5461 ((warnop == OP_READLINE || warnop == OP_GLOB)
5462 ? " construct" : "() operator"));
5463 CopLINE_set(PL_curcop, oldline);
5470 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
5471 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
5473 NewOp(1101, logop, 1, LOGOP);
5475 logop->op_type = (OPCODE)type;
5476 logop->op_ppaddr = PL_ppaddr[type];
5477 logop->op_first = first;
5478 logop->op_flags = (U8)(flags | OPf_KIDS);
5479 logop->op_other = LINKLIST(other);
5480 logop->op_private = (U8)(1 | (flags >> 8));
5482 /* establish postfix order */
5483 logop->op_next = LINKLIST(first);
5484 first->op_next = (OP*)logop;
5485 first->op_sibling = other;
5487 CHECKOP(type,logop);
5489 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
5496 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
5498 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
5499 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5500 will be set automatically, and, shifted up eight bits, the eight bits of
5501 C<op_private>, except that the bit with value 1 is automatically set.
5502 I<first> supplies the expression selecting between the two branches,
5503 and I<trueop> and I<falseop> supply the branches; they are consumed by
5504 this function and become part of the constructed op tree.
5510 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
5518 PERL_ARGS_ASSERT_NEWCONDOP;
5521 return newLOGOP(OP_AND, 0, first, trueop);
5523 return newLOGOP(OP_OR, 0, first, falseop);
5525 scalarboolean(first);
5526 if ((cstop = search_const(first))) {
5527 /* Left or right arm of the conditional? */
5528 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
5529 OP *live = left ? trueop : falseop;
5530 OP *const dead = left ? falseop : trueop;
5531 if (cstop->op_private & OPpCONST_BARE &&
5532 cstop->op_private & OPpCONST_STRICT) {
5533 no_bareword_allowed(cstop);
5536 /* This is all dead code when PERL_MAD is not defined. */
5537 live = newUNOP(OP_NULL, 0, live);
5538 op_getmad(first, live, 'C');
5539 op_getmad(dead, live, left ? 'e' : 't');
5544 if (live->op_type == OP_LEAVE)
5545 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
5546 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
5547 || live->op_type == OP_TRANS || live->op_type == OP_TRANSR)
5548 /* Mark the op as being unbindable with =~ */
5549 live->op_flags |= OPf_SPECIAL;
5552 NewOp(1101, logop, 1, LOGOP);
5553 logop->op_type = OP_COND_EXPR;
5554 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
5555 logop->op_first = first;
5556 logop->op_flags = (U8)(flags | OPf_KIDS);
5557 logop->op_private = (U8)(1 | (flags >> 8));
5558 logop->op_other = LINKLIST(trueop);
5559 logop->op_next = LINKLIST(falseop);
5561 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
5564 /* establish postfix order */
5565 start = LINKLIST(first);
5566 first->op_next = (OP*)logop;
5568 first->op_sibling = trueop;
5569 trueop->op_sibling = falseop;
5570 o = newUNOP(OP_NULL, 0, (OP*)logop);
5572 trueop->op_next = falseop->op_next = o;
5579 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
5581 Constructs and returns a C<range> op, with subordinate C<flip> and
5582 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
5583 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
5584 for both the C<flip> and C<range> ops, except that the bit with value
5585 1 is automatically set. I<left> and I<right> supply the expressions
5586 controlling the endpoints of the range; they are consumed by this function
5587 and become part of the constructed op tree.
5593 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
5602 PERL_ARGS_ASSERT_NEWRANGE;
5604 NewOp(1101, range, 1, LOGOP);
5606 range->op_type = OP_RANGE;
5607 range->op_ppaddr = PL_ppaddr[OP_RANGE];
5608 range->op_first = left;
5609 range->op_flags = OPf_KIDS;
5610 leftstart = LINKLIST(left);
5611 range->op_other = LINKLIST(right);
5612 range->op_private = (U8)(1 | (flags >> 8));
5614 left->op_sibling = right;
5616 range->op_next = (OP*)range;
5617 flip = newUNOP(OP_FLIP, flags, (OP*)range);
5618 flop = newUNOP(OP_FLOP, 0, flip);
5619 o = newUNOP(OP_NULL, 0, flop);
5621 range->op_next = leftstart;
5623 left->op_next = flip;
5624 right->op_next = flop;
5626 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
5627 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
5628 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
5629 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
5631 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
5632 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
5634 /* check barewords before they might be optimized aways */
5635 if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT)
5636 no_bareword_allowed(left);
5637 if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT)
5638 no_bareword_allowed(right);
5641 if (!flip->op_private || !flop->op_private)
5642 LINKLIST(o); /* blow off optimizer unless constant */
5648 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
5650 Constructs, checks, and returns an op tree expressing a loop. This is
5651 only a loop in the control flow through the op tree; it does not have
5652 the heavyweight loop structure that allows exiting the loop by C<last>
5653 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
5654 top-level op, except that some bits will be set automatically as required.
5655 I<expr> supplies the expression controlling loop iteration, and I<block>
5656 supplies the body of the loop; they are consumed by this function and
5657 become part of the constructed op tree. I<debuggable> is currently
5658 unused and should always be 1.
5664 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
5669 const bool once = block && block->op_flags & OPf_SPECIAL &&
5670 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
5672 PERL_UNUSED_ARG(debuggable);
5675 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
5676 return block; /* do {} while 0 does once */
5677 if (expr->op_type == OP_READLINE
5678 || expr->op_type == OP_READDIR
5679 || expr->op_type == OP_GLOB
5680 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
5681 expr = newUNOP(OP_DEFINED, 0,
5682 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
5683 } else if (expr->op_flags & OPf_KIDS) {
5684 const OP * const k1 = ((UNOP*)expr)->op_first;
5685 const OP * const k2 = k1 ? k1->op_sibling : NULL;
5686 switch (expr->op_type) {
5688 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
5689 && (k2->op_flags & OPf_STACKED)
5690 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5691 expr = newUNOP(OP_DEFINED, 0, expr);
5695 if (k1 && (k1->op_type == OP_READDIR
5696 || k1->op_type == OP_GLOB
5697 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5698 || k1->op_type == OP_EACH
5699 || k1->op_type == OP_AEACH))
5700 expr = newUNOP(OP_DEFINED, 0, expr);
5706 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
5707 * op, in listop. This is wrong. [perl #27024] */
5709 block = newOP(OP_NULL, 0);
5710 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
5711 o = new_logop(OP_AND, 0, &expr, &listop);
5714 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
5716 if (once && o != listop)
5717 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
5720 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
5722 o->op_flags |= flags;
5724 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
5729 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
5731 Constructs, checks, and returns an op tree expressing a C<while> loop.
5732 This is a heavyweight loop, with structure that allows exiting the loop
5733 by C<last> and suchlike.
5735 I<loop> is an optional preconstructed C<enterloop> op to use in the
5736 loop; if it is null then a suitable op will be constructed automatically.
5737 I<expr> supplies the loop's controlling expression. I<block> supplies the
5738 main body of the loop, and I<cont> optionally supplies a C<continue> block
5739 that operates as a second half of the body. All of these optree inputs
5740 are consumed by this function and become part of the constructed op tree.
5742 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
5743 op and, shifted up eight bits, the eight bits of C<op_private> for
5744 the C<leaveloop> op, except that (in both cases) some bits will be set
5745 automatically. I<debuggable> is currently unused and should always be 1.
5746 I<has_my> can be supplied as true to force the
5747 loop body to be enclosed in its own scope.
5753 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
5754 OP *expr, OP *block, OP *cont, I32 has_my)
5763 PERL_UNUSED_ARG(debuggable);
5766 if (expr->op_type == OP_READLINE
5767 || expr->op_type == OP_READDIR
5768 || expr->op_type == OP_GLOB
5769 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
5770 expr = newUNOP(OP_DEFINED, 0,
5771 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
5772 } else if (expr->op_flags & OPf_KIDS) {
5773 const OP * const k1 = ((UNOP*)expr)->op_first;
5774 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
5775 switch (expr->op_type) {
5777 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
5778 && (k2->op_flags & OPf_STACKED)
5779 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5780 expr = newUNOP(OP_DEFINED, 0, expr);
5784 if (k1 && (k1->op_type == OP_READDIR
5785 || k1->op_type == OP_GLOB
5786 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5787 || k1->op_type == OP_EACH
5788 || k1->op_type == OP_AEACH))
5789 expr = newUNOP(OP_DEFINED, 0, expr);
5796 block = newOP(OP_NULL, 0);
5797 else if (cont || has_my) {
5798 block = op_scope(block);
5802 next = LINKLIST(cont);
5805 OP * const unstack = newOP(OP_UNSTACK, 0);
5808 cont = op_append_elem(OP_LINESEQ, cont, unstack);
5812 listop = op_append_list(OP_LINESEQ, block, cont);
5814 redo = LINKLIST(listop);
5818 o = new_logop(OP_AND, 0, &expr, &listop);
5819 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
5820 op_free(expr); /* oops, it's a while (0) */
5822 return NULL; /* listop already freed by new_logop */
5825 ((LISTOP*)listop)->op_last->op_next =
5826 (o == listop ? redo : LINKLIST(o));
5832 NewOp(1101,loop,1,LOOP);
5833 loop->op_type = OP_ENTERLOOP;
5834 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
5835 loop->op_private = 0;
5836 loop->op_next = (OP*)loop;
5839 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
5841 loop->op_redoop = redo;
5842 loop->op_lastop = o;
5843 o->op_private |= loopflags;
5846 loop->op_nextop = next;
5848 loop->op_nextop = o;
5850 o->op_flags |= flags;
5851 o->op_private |= (flags >> 8);
5856 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
5858 Constructs, checks, and returns an op tree expressing a C<foreach>
5859 loop (iteration through a list of values). This is a heavyweight loop,
5860 with structure that allows exiting the loop by C<last> and suchlike.
5862 I<sv> optionally supplies the variable that will be aliased to each
5863 item in turn; if null, it defaults to C<$_> (either lexical or global).
5864 I<expr> supplies the list of values to iterate over. I<block> supplies
5865 the main body of the loop, and I<cont> optionally supplies a C<continue>
5866 block that operates as a second half of the body. All of these optree
5867 inputs are consumed by this function and become part of the constructed
5870 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
5871 op and, shifted up eight bits, the eight bits of C<op_private> for
5872 the C<leaveloop> op, except that (in both cases) some bits will be set
5879 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
5884 PADOFFSET padoff = 0;
5889 PERL_ARGS_ASSERT_NEWFOROP;
5892 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
5893 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
5894 sv->op_type = OP_RV2GV;
5895 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
5897 /* The op_type check is needed to prevent a possible segfault
5898 * if the loop variable is undeclared and 'strict vars' is in
5899 * effect. This is illegal but is nonetheless parsed, so we
5900 * may reach this point with an OP_CONST where we're expecting
5903 if (cUNOPx(sv)->op_first->op_type == OP_GV
5904 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
5905 iterpflags |= OPpITER_DEF;
5907 else if (sv->op_type == OP_PADSV) { /* private variable */
5908 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
5909 padoff = sv->op_targ;
5919 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
5921 SV *const namesv = PAD_COMPNAME_SV(padoff);
5923 const char *const name = SvPV_const(namesv, len);
5925 if (len == 2 && name[0] == '$' && name[1] == '_')
5926 iterpflags |= OPpITER_DEF;
5930 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
5931 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
5932 sv = newGVOP(OP_GV, 0, PL_defgv);
5937 iterpflags |= OPpITER_DEF;
5939 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
5940 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
5941 iterflags |= OPf_STACKED;
5943 else if (expr->op_type == OP_NULL &&
5944 (expr->op_flags & OPf_KIDS) &&
5945 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
5947 /* Basically turn for($x..$y) into the same as for($x,$y), but we
5948 * set the STACKED flag to indicate that these values are to be
5949 * treated as min/max values by 'pp_iterinit'.
5951 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
5952 LOGOP* const range = (LOGOP*) flip->op_first;
5953 OP* const left = range->op_first;
5954 OP* const right = left->op_sibling;
5957 range->op_flags &= ~OPf_KIDS;
5958 range->op_first = NULL;
5960 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
5961 listop->op_first->op_next = range->op_next;
5962 left->op_next = range->op_other;
5963 right->op_next = (OP*)listop;
5964 listop->op_next = listop->op_first;
5967 op_getmad(expr,(OP*)listop,'O');
5971 expr = (OP*)(listop);
5973 iterflags |= OPf_STACKED;
5976 expr = op_lvalue(force_list(expr), OP_GREPSTART);
5979 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
5980 op_append_elem(OP_LIST, expr, scalar(sv))));
5981 assert(!loop->op_next);
5982 /* for my $x () sets OPpLVAL_INTRO;
5983 * for our $x () sets OPpOUR_INTRO */
5984 loop->op_private = (U8)iterpflags;
5985 #ifdef PL_OP_SLAB_ALLOC
5988 NewOp(1234,tmp,1,LOOP);
5989 Copy(loop,tmp,1,LISTOP);
5990 S_op_destroy(aTHX_ (OP*)loop);
5994 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
5996 loop->op_targ = padoff;
5997 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
5999 op_getmad(madsv, (OP*)loop, 'v');
6004 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
6006 Constructs, checks, and returns a loop-exiting op (such as C<goto>
6007 or C<last>). I<type> is the opcode. I<label> supplies the parameter
6008 determining the target of the op; it is consumed by this function and
6009 become part of the constructed op tree.
6015 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
6020 PERL_ARGS_ASSERT_NEWLOOPEX;
6022 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
6024 if (type != OP_GOTO || label->op_type == OP_CONST) {
6025 /* "last()" means "last" */
6026 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
6027 o = newOP(type, OPf_SPECIAL);
6029 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
6030 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
6034 op_getmad(label,o,'L');
6040 /* Check whether it's going to be a goto &function */
6041 if (label->op_type == OP_ENTERSUB
6042 && !(label->op_flags & OPf_STACKED))
6043 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
6044 o = newUNOP(type, OPf_STACKED, label);
6046 PL_hints |= HINT_BLOCK_SCOPE;
6050 /* if the condition is a literal array or hash
6051 (or @{ ... } etc), make a reference to it.
6054 S_ref_array_or_hash(pTHX_ OP *cond)
6057 && (cond->op_type == OP_RV2AV
6058 || cond->op_type == OP_PADAV
6059 || cond->op_type == OP_RV2HV
6060 || cond->op_type == OP_PADHV))
6062 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
6065 && (cond->op_type == OP_ASLICE
6066 || cond->op_type == OP_HSLICE)) {
6068 /* anonlist now needs a list from this op, was previously used in
6070 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
6071 cond->op_flags |= OPf_WANT_LIST;
6073 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
6080 /* These construct the optree fragments representing given()
6083 entergiven and enterwhen are LOGOPs; the op_other pointer
6084 points up to the associated leave op. We need this so we
6085 can put it in the context and make break/continue work.
6086 (Also, of course, pp_enterwhen will jump straight to
6087 op_other if the match fails.)
6091 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
6092 I32 enter_opcode, I32 leave_opcode,
6093 PADOFFSET entertarg)
6099 PERL_ARGS_ASSERT_NEWGIVWHENOP;
6101 NewOp(1101, enterop, 1, LOGOP);
6102 enterop->op_type = (Optype)enter_opcode;
6103 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
6104 enterop->op_flags = (U8) OPf_KIDS;
6105 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
6106 enterop->op_private = 0;
6108 o = newUNOP(leave_opcode, 0, (OP *) enterop);
6111 enterop->op_first = scalar(cond);
6112 cond->op_sibling = block;
6114 o->op_next = LINKLIST(cond);
6115 cond->op_next = (OP *) enterop;
6118 /* This is a default {} block */
6119 enterop->op_first = block;
6120 enterop->op_flags |= OPf_SPECIAL;
6121 o ->op_flags |= OPf_SPECIAL;
6123 o->op_next = (OP *) enterop;
6126 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
6127 entergiven and enterwhen both
6130 enterop->op_next = LINKLIST(block);
6131 block->op_next = enterop->op_other = o;
6136 /* Does this look like a boolean operation? For these purposes
6137 a boolean operation is:
6138 - a subroutine call [*]
6139 - a logical connective
6140 - a comparison operator
6141 - a filetest operator, with the exception of -s -M -A -C
6142 - defined(), exists() or eof()
6143 - /$re/ or $foo =~ /$re/
6145 [*] possibly surprising
6148 S_looks_like_bool(pTHX_ const OP *o)
6152 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
6154 switch(o->op_type) {
6157 return looks_like_bool(cLOGOPo->op_first);
6161 looks_like_bool(cLOGOPo->op_first)
6162 && looks_like_bool(cLOGOPo->op_first->op_sibling));
6167 o->op_flags & OPf_KIDS
6168 && looks_like_bool(cUNOPo->op_first));
6172 case OP_NOT: case OP_XOR:
6174 case OP_EQ: case OP_NE: case OP_LT:
6175 case OP_GT: case OP_LE: case OP_GE:
6177 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
6178 case OP_I_GT: case OP_I_LE: case OP_I_GE:
6180 case OP_SEQ: case OP_SNE: case OP_SLT:
6181 case OP_SGT: case OP_SLE: case OP_SGE:
6185 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
6186 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
6187 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
6188 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
6189 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
6190 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
6191 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
6192 case OP_FTTEXT: case OP_FTBINARY:
6194 case OP_DEFINED: case OP_EXISTS:
6195 case OP_MATCH: case OP_EOF:
6202 /* Detect comparisons that have been optimized away */
6203 if (cSVOPo->op_sv == &PL_sv_yes
6204 || cSVOPo->op_sv == &PL_sv_no)
6217 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
6219 Constructs, checks, and returns an op tree expressing a C<given> block.
6220 I<cond> supplies the expression that will be locally assigned to a lexical
6221 variable, and I<block> supplies the body of the C<given> construct; they
6222 are consumed by this function and become part of the constructed op tree.
6223 I<defsv_off> is the pad offset of the scalar lexical variable that will
6230 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
6233 PERL_ARGS_ASSERT_NEWGIVENOP;
6234 return newGIVWHENOP(
6235 ref_array_or_hash(cond),
6237 OP_ENTERGIVEN, OP_LEAVEGIVEN,
6242 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
6244 Constructs, checks, and returns an op tree expressing a C<when> block.
6245 I<cond> supplies the test expression, and I<block> supplies the block
6246 that will be executed if the test evaluates to true; they are consumed
6247 by this function and become part of the constructed op tree. I<cond>
6248 will be interpreted DWIMically, often as a comparison against C<$_>,
6249 and may be null to generate a C<default> block.
6255 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
6257 const bool cond_llb = (!cond || looks_like_bool(cond));
6260 PERL_ARGS_ASSERT_NEWWHENOP;
6265 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
6267 scalar(ref_array_or_hash(cond)));
6270 return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0);
6274 Perl_cv_ckproto_len_flags(pTHX_ const CV *cv, const GV *gv, const char *p,
6275 const STRLEN len, const U32 flags)
6277 const char * const cvp = CvPROTO(cv);
6278 const STRLEN clen = CvPROTOLEN(cv);
6280 PERL_ARGS_ASSERT_CV_CKPROTO_LEN_FLAGS;
6282 if (((!p != !cvp) /* One has prototype, one has not. */
6284 (flags & SVf_UTF8) == SvUTF8(cv)
6285 ? len != clen || memNE(cvp, p, len)
6287 ? bytes_cmp_utf8((const U8 *)cvp, clen,
6289 : bytes_cmp_utf8((const U8 *)p, len,
6290 (const U8 *)cvp, clen)
6294 && ckWARN_d(WARN_PROTOTYPE)) {
6295 SV* const msg = sv_newmortal();
6299 gv_efullname3(name = sv_newmortal(), gv, NULL);
6300 sv_setpvs(msg, "Prototype mismatch:");
6302 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
6304 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")",
6305 SVfARG(newSVpvn_flags(cvp,clen, SvUTF8(cv)|SVs_TEMP))
6308 sv_catpvs(msg, ": none");
6309 sv_catpvs(msg, " vs ");
6311 Perl_sv_catpvf(aTHX_ msg, "(%"SVf")", SVfARG(newSVpvn_flags(p, len, flags | SVs_TEMP)));
6313 sv_catpvs(msg, "none");
6314 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
6318 static void const_sv_xsub(pTHX_ CV* cv);
6322 =head1 Optree Manipulation Functions
6324 =for apidoc cv_const_sv
6326 If C<cv> is a constant sub eligible for inlining. returns the constant
6327 value returned by the sub. Otherwise, returns NULL.
6329 Constant subs can be created with C<newCONSTSUB> or as described in
6330 L<perlsub/"Constant Functions">.
6335 Perl_cv_const_sv(pTHX_ const CV *const cv)
6337 PERL_UNUSED_CONTEXT;
6340 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
6342 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6345 /* op_const_sv: examine an optree to determine whether it's in-lineable.
6346 * Can be called in 3 ways:
6349 * look for a single OP_CONST with attached value: return the value
6351 * cv && CvCLONE(cv) && !CvCONST(cv)
6353 * examine the clone prototype, and if contains only a single
6354 * OP_CONST referencing a pad const, or a single PADSV referencing
6355 * an outer lexical, return a non-zero value to indicate the CV is
6356 * a candidate for "constizing" at clone time
6360 * We have just cloned an anon prototype that was marked as a const
6361 * candidate. Try to grab the current value, and in the case of
6362 * PADSV, ignore it if it has multiple references. Return the value.
6366 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
6377 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
6378 o = cLISTOPo->op_first->op_sibling;
6380 for (; o; o = o->op_next) {
6381 const OPCODE type = o->op_type;
6383 if (sv && o->op_next == o)
6385 if (o->op_next != o) {
6386 if (type == OP_NEXTSTATE
6387 || (type == OP_NULL && !(o->op_flags & OPf_KIDS))
6388 || type == OP_PUSHMARK)
6390 if (type == OP_DBSTATE)
6393 if (type == OP_LEAVESUB || type == OP_RETURN)
6397 if (type == OP_CONST && cSVOPo->op_sv)
6399 else if (cv && type == OP_CONST) {
6400 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6404 else if (cv && type == OP_PADSV) {
6405 if (CvCONST(cv)) { /* newly cloned anon */
6406 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6407 /* the candidate should have 1 ref from this pad and 1 ref
6408 * from the parent */
6409 if (!sv || SvREFCNT(sv) != 2)
6416 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
6417 sv = &PL_sv_undef; /* an arbitrary non-null value */
6432 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6435 /* This would be the return value, but the return cannot be reached. */
6436 OP* pegop = newOP(OP_NULL, 0);
6439 PERL_UNUSED_ARG(floor);
6449 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
6451 NORETURN_FUNCTION_END;
6456 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6458 return newATTRSUB_flags(floor, o, proto, attrs, block, 0);
6462 Perl_newATTRSUB_flags(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs,
6463 OP *block, U32 flags)
6468 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
6470 register CV *cv = NULL;
6472 /* If the subroutine has no body, no attributes, and no builtin attributes
6473 then it's just a sub declaration, and we may be able to get away with
6474 storing with a placeholder scalar in the symbol table, rather than a
6475 full GV and CV. If anything is present then it will take a full CV to
6477 const I32 gv_fetch_flags
6478 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6480 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
6482 const bool o_is_gv = flags & 1;
6483 const char * const name =
6484 o ? SvPV_const(o_is_gv ? (SV *)o : cSVOPo->op_sv, namlen) : NULL;
6486 bool name_is_utf8 = o && !o_is_gv && SvUTF8(cSVOPo->op_sv);
6489 assert(proto->op_type == OP_CONST);
6490 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
6491 ps_utf8 = SvUTF8(((SVOP*)proto)->op_sv);
6501 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
6503 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
6504 SV * const sv = sv_newmortal();
6505 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
6506 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
6507 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
6508 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
6510 } else if (PL_curstash) {
6511 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
6514 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
6518 if (!PL_madskills) {
6527 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
6528 maximum a prototype before. */
6529 if (SvTYPE(gv) > SVt_NULL) {
6530 if (!SvPOK((const SV *)gv)
6531 && !(SvIOK((const SV *)gv) && SvIVX((const SV *)gv) == -1))
6533 Perl_ck_warner_d(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
6535 cv_ckproto_len_flags((const CV *)gv, NULL, ps, ps_len, ps_utf8);
6538 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
6539 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(gv));
6542 sv_setiv(MUTABLE_SV(gv), -1);
6544 SvREFCNT_dec(PL_compcv);
6545 cv = PL_compcv = NULL;
6549 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
6551 if (!block || !ps || *ps || attrs
6552 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6554 || block->op_type == OP_NULL
6559 const_sv = op_const_sv(block, NULL);
6562 const bool exists = CvROOT(cv) || CvXSUB(cv);
6564 /* if the subroutine doesn't exist and wasn't pre-declared
6565 * with a prototype, assume it will be AUTOLOADed,
6566 * skipping the prototype check
6568 if (exists || SvPOK(cv))
6569 cv_ckproto_len_flags(cv, gv, ps, ps_len, ps_utf8);
6570 /* already defined (or promised)? */
6571 if (exists || GvASSUMECV(gv)) {
6574 || block->op_type == OP_NULL
6577 if (CvFLAGS(PL_compcv)) {
6578 /* might have had built-in attrs applied */
6579 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
6580 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl
6581 && ckWARN(WARN_MISC))
6582 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
6584 (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS
6585 & ~(CVf_LVALUE * pureperl));
6587 if (attrs) goto attrs;
6588 /* just a "sub foo;" when &foo is already defined */
6589 SAVEFREESV(PL_compcv);
6594 && block->op_type != OP_NULL
6597 const line_t oldline = CopLINE(PL_curcop);
6598 if (PL_parser && PL_parser->copline != NOLINE)
6599 CopLINE_set(PL_curcop, PL_parser->copline);
6600 report_redefined_cv(cSVOPo->op_sv, cv, &const_sv);
6601 CopLINE_set(PL_curcop, oldline);
6603 if (!PL_minus_c) /* keep old one around for madskills */
6606 /* (PL_madskills unset in used file.) */
6615 SvREFCNT_inc_simple_void_NN(const_sv);
6617 assert(!CvROOT(cv) && !CvCONST(cv));
6618 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
6619 CvXSUBANY(cv).any_ptr = const_sv;
6620 CvXSUB(cv) = const_sv_xsub;
6626 cv = newCONSTSUB_flags(
6627 NULL, name, namlen, name_is_utf8 ? SVf_UTF8 : 0,
6632 (CvGV(cv) && GvSTASH(CvGV(cv)))
6637 if (HvENAME_HEK(stash))
6638 mro_method_changed_in(stash); /* sub Foo::Bar () { 123 } */
6642 SvREFCNT_dec(PL_compcv);
6646 if (cv) { /* must reuse cv if autoloaded */
6647 /* transfer PL_compcv to cv */
6650 && block->op_type != OP_NULL
6653 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
6654 AV *const temp_av = CvPADLIST(cv);
6655 CV *const temp_cv = CvOUTSIDE(cv);
6657 assert(!CvWEAKOUTSIDE(cv));
6658 assert(!CvCVGV_RC(cv));
6659 assert(CvGV(cv) == gv);
6662 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
6663 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
6664 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
6665 CvPADLIST(cv) = CvPADLIST(PL_compcv);
6666 CvOUTSIDE(PL_compcv) = temp_cv;
6667 CvPADLIST(PL_compcv) = temp_av;
6669 if (CvFILE(cv) && CvDYNFILE(cv)) {
6670 Safefree(CvFILE(cv));
6672 CvFILE_set_from_cop(cv, PL_curcop);
6673 CvSTASH_set(cv, PL_curstash);
6675 /* inner references to PL_compcv must be fixed up ... */
6676 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
6677 if (PERLDB_INTER)/* Advice debugger on the new sub. */
6678 ++PL_sub_generation;
6681 /* Might have had built-in attributes applied -- propagate them. */
6682 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
6684 /* ... before we throw it away */
6685 SvREFCNT_dec(PL_compcv);
6693 if (strEQ(name, "import")) {
6694 PL_formfeed = MUTABLE_SV(cv);
6695 /* diag_listed_as: SKIPME */
6696 Perl_warner(aTHX_ packWARN(WARN_VOID), "0x%"UVxf"\n", PTR2UV(cv));
6700 if (HvENAME_HEK(GvSTASH(gv)))
6701 /* sub Foo::bar { (shift)+1 } */
6702 mro_method_changed_in(GvSTASH(gv));
6707 CvFILE_set_from_cop(cv, PL_curcop);
6708 CvSTASH_set(cv, PL_curstash);
6712 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
6713 if ( ps_utf8 ) SvUTF8_on(MUTABLE_SV(cv));
6716 if (PL_parser && PL_parser->error_count) {
6720 const char *s = strrchr(name, ':');
6722 if (strEQ(s, "BEGIN")) {
6723 const char not_safe[] =
6724 "BEGIN not safe after errors--compilation aborted";
6725 if (PL_in_eval & EVAL_KEEPERR)
6726 Perl_croak(aTHX_ not_safe);
6728 /* force display of errors found but not reported */
6729 sv_catpv(ERRSV, not_safe);
6730 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
6739 /* If we assign an optree to a PVCV, then we've defined a subroutine that
6740 the debugger could be able to set a breakpoint in, so signal to
6741 pp_entereval that it should not throw away any saved lines at scope
6744 PL_breakable_sub_gen++;
6745 /* This makes sub {}; work as expected. */
6746 if (block->op_type == OP_STUB) {
6747 OP* const newblock = newSTATEOP(0, NULL, 0);
6749 op_getmad(block,newblock,'B');
6755 else block->op_attached = 1;
6756 CvROOT(cv) = CvLVALUE(cv)
6757 ? newUNOP(OP_LEAVESUBLV, 0,
6758 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
6759 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
6760 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6761 OpREFCNT_set(CvROOT(cv), 1);
6762 CvSTART(cv) = LINKLIST(CvROOT(cv));
6763 CvROOT(cv)->op_next = 0;
6764 CALL_PEEP(CvSTART(cv));
6765 finalize_optree(CvROOT(cv));
6767 /* now that optimizer has done its work, adjust pad values */
6769 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
6772 assert(!CvCONST(cv));
6773 if (ps && !*ps && op_const_sv(block, cv))
6779 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
6780 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
6781 apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE);
6784 if (block && has_name) {
6785 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
6786 SV * const tmpstr = sv_newmortal();
6787 GV * const db_postponed = gv_fetchpvs("DB::postponed",
6788 GV_ADDMULTI, SVt_PVHV);
6790 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
6793 (long)CopLINE(PL_curcop));
6794 gv_efullname3(tmpstr, gv, NULL);
6795 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
6796 SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr), sv, 0);
6797 hv = GvHVn(db_postponed);
6798 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvUTF8(tmpstr) ? -(I32)SvCUR(tmpstr) : (I32)SvCUR(tmpstr))) {
6799 CV * const pcv = GvCV(db_postponed);
6805 call_sv(MUTABLE_SV(pcv), G_DISCARD);
6810 if (name && ! (PL_parser && PL_parser->error_count))
6811 process_special_blocks(name, gv, cv);
6816 PL_parser->copline = NOLINE;
6822 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
6825 const char *const colon = strrchr(fullname,':');
6826 const char *const name = colon ? colon + 1 : fullname;
6828 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
6831 if (strEQ(name, "BEGIN")) {
6832 const I32 oldscope = PL_scopestack_ix;
6834 SAVECOPFILE(&PL_compiling);
6835 SAVECOPLINE(&PL_compiling);
6836 SAVEVPTR(PL_curcop);
6838 DEBUG_x( dump_sub(gv) );
6839 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
6840 GvCV_set(gv,0); /* cv has been hijacked */
6841 call_list(oldscope, PL_beginav);
6843 CopHINTS_set(&PL_compiling, PL_hints);
6850 if strEQ(name, "END") {
6851 DEBUG_x( dump_sub(gv) );
6852 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
6855 } else if (*name == 'U') {
6856 if (strEQ(name, "UNITCHECK")) {
6857 /* It's never too late to run a unitcheck block */
6858 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
6862 } else if (*name == 'C') {
6863 if (strEQ(name, "CHECK")) {
6865 /* diag_listed_as: Too late to run %s block */
6866 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
6867 "Too late to run CHECK block");
6868 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
6872 } else if (*name == 'I') {
6873 if (strEQ(name, "INIT")) {
6875 /* diag_listed_as: Too late to run %s block */
6876 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
6877 "Too late to run INIT block");
6878 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
6884 DEBUG_x( dump_sub(gv) );
6885 GvCV_set(gv,0); /* cv has been hijacked */
6890 =for apidoc newCONSTSUB
6892 See L</newCONSTSUB_flags>.
6898 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
6900 return newCONSTSUB_flags(stash, name, name ? strlen(name) : 0, 0, sv);
6904 =for apidoc newCONSTSUB_flags
6906 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
6907 eligible for inlining at compile-time.
6909 Currently, the only useful value for C<flags> is SVf_UTF8.
6911 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
6912 which won't be called if used as a destructor, but will suppress the overhead
6913 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
6920 Perl_newCONSTSUB_flags(pTHX_ HV *stash, const char *name, STRLEN len,
6926 const char *const file = CopFILE(PL_curcop);
6928 SV *const temp_sv = CopFILESV(PL_curcop);
6929 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
6934 if (IN_PERL_RUNTIME) {
6935 /* at runtime, it's not safe to manipulate PL_curcop: it may be
6936 * an op shared between threads. Use a non-shared COP for our
6938 SAVEVPTR(PL_curcop);
6939 SAVECOMPILEWARNINGS();
6940 PL_compiling.cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
6941 PL_curcop = &PL_compiling;
6943 SAVECOPLINE(PL_curcop);
6944 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
6947 PL_hints &= ~HINT_BLOCK_SCOPE;
6950 SAVEGENERICSV(PL_curstash);
6951 SAVECOPSTASH(PL_curcop);
6952 PL_curstash = (HV *)SvREFCNT_inc_simple_NN(stash);
6953 CopSTASH_set(PL_curcop,stash);
6956 /* file becomes the CvFILE. For an XS, it's usually static storage,
6957 and so doesn't get free()d. (It's expected to be from the C pre-
6958 processor __FILE__ directive). But we need a dynamically allocated one,
6959 and we need it to get freed. */
6960 cv = newXS_len_flags(name, len, const_sv_xsub, file ? file : "", "",
6961 &sv, XS_DYNAMIC_FILENAME | flags);
6962 CvXSUBANY(cv).any_ptr = sv;
6967 CopSTASH_free(PL_curcop);
6975 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
6976 const char *const filename, const char *const proto,
6979 PERL_ARGS_ASSERT_NEWXS_FLAGS;
6980 return newXS_len_flags(
6981 name, name ? strlen(name) : 0, subaddr, filename, proto, NULL, flags
6986 Perl_newXS_len_flags(pTHX_ const char *name, STRLEN len,
6987 XSUBADDR_t subaddr, const char *const filename,
6988 const char *const proto, SV **const_svp,
6993 PERL_ARGS_ASSERT_NEWXS_LEN_FLAGS;
6996 GV * const gv = name
6998 name,len,GV_ADDMULTI|flags,SVt_PVCV
7001 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
7002 GV_ADDMULTI | flags, SVt_PVCV);
7005 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
7007 if ((cv = (name ? GvCV(gv) : NULL))) {
7009 /* just a cached method */
7013 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
7014 /* already defined (or promised) */
7015 /* Redundant check that allows us to avoid creating an SV
7016 most of the time: */
7017 if (CvCONST(cv) || ckWARN(WARN_REDEFINE)) {
7018 const line_t oldline = CopLINE(PL_curcop);
7019 if (PL_parser && PL_parser->copline != NOLINE)
7020 CopLINE_set(PL_curcop, PL_parser->copline);
7021 report_redefined_cv(newSVpvn_flags(
7022 name,len,(flags&SVf_UTF8)|SVs_TEMP
7025 CopLINE_set(PL_curcop, oldline);
7032 if (cv) /* must reuse cv if autoloaded */
7035 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7039 if (HvENAME_HEK(GvSTASH(gv)))
7040 mro_method_changed_in(GvSTASH(gv)); /* newXS */
7046 (void)gv_fetchfile(filename);
7047 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
7048 an external constant string */
7049 assert(!CvDYNFILE(cv)); /* cv_undef should have turned it off */
7051 CvXSUB(cv) = subaddr;
7054 process_special_blocks(name, gv, cv);
7057 if (flags & XS_DYNAMIC_FILENAME) {
7058 CvFILE(cv) = savepv(filename);
7061 sv_setpv(MUTABLE_SV(cv), proto);
7066 =for apidoc U||newXS
7068 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
7069 static storage, as it is used directly as CvFILE(), without a copy being made.
7075 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
7077 PERL_ARGS_ASSERT_NEWXS;
7078 return newXS_flags(name, subaddr, filename, NULL, 0);
7086 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
7091 OP* pegop = newOP(OP_NULL, 0);
7095 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
7096 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
7099 if ((cv = GvFORM(gv))) {
7100 if (ckWARN(WARN_REDEFINE)) {
7101 const line_t oldline = CopLINE(PL_curcop);
7102 if (PL_parser && PL_parser->copline != NOLINE)
7103 CopLINE_set(PL_curcop, PL_parser->copline);
7105 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7106 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
7108 /* diag_listed_as: Format %s redefined */
7109 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7110 "Format STDOUT redefined");
7112 CopLINE_set(PL_curcop, oldline);
7119 CvFILE_set_from_cop(cv, PL_curcop);
7122 pad_tidy(padtidy_FORMAT);
7123 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
7124 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7125 OpREFCNT_set(CvROOT(cv), 1);
7126 CvSTART(cv) = LINKLIST(CvROOT(cv));
7127 CvROOT(cv)->op_next = 0;
7128 CALL_PEEP(CvSTART(cv));
7129 finalize_optree(CvROOT(cv));
7131 op_getmad(o,pegop,'n');
7132 op_getmad_weak(block, pegop, 'b');
7137 PL_parser->copline = NOLINE;
7145 Perl_newANONLIST(pTHX_ OP *o)
7147 return convert(OP_ANONLIST, OPf_SPECIAL, o);
7151 Perl_newANONHASH(pTHX_ OP *o)
7153 return convert(OP_ANONHASH, OPf_SPECIAL, o);
7157 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
7159 return newANONATTRSUB(floor, proto, NULL, block);
7163 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
7165 return newUNOP(OP_REFGEN, 0,
7166 newSVOP(OP_ANONCODE, 0,
7167 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
7171 Perl_oopsAV(pTHX_ OP *o)
7175 PERL_ARGS_ASSERT_OOPSAV;
7177 switch (o->op_type) {
7179 o->op_type = OP_PADAV;
7180 o->op_ppaddr = PL_ppaddr[OP_PADAV];
7181 return ref(o, OP_RV2AV);
7184 o->op_type = OP_RV2AV;
7185 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
7190 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
7197 Perl_oopsHV(pTHX_ OP *o)
7201 PERL_ARGS_ASSERT_OOPSHV;
7203 switch (o->op_type) {
7206 o->op_type = OP_PADHV;
7207 o->op_ppaddr = PL_ppaddr[OP_PADHV];
7208 return ref(o, OP_RV2HV);
7212 o->op_type = OP_RV2HV;
7213 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
7218 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
7225 Perl_newAVREF(pTHX_ OP *o)
7229 PERL_ARGS_ASSERT_NEWAVREF;
7231 if (o->op_type == OP_PADANY) {
7232 o->op_type = OP_PADAV;
7233 o->op_ppaddr = PL_ppaddr[OP_PADAV];
7236 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
7237 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7238 "Using an array as a reference is deprecated");
7240 return newUNOP(OP_RV2AV, 0, scalar(o));
7244 Perl_newGVREF(pTHX_ I32 type, OP *o)
7246 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
7247 return newUNOP(OP_NULL, 0, o);
7248 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
7252 Perl_newHVREF(pTHX_ OP *o)
7256 PERL_ARGS_ASSERT_NEWHVREF;
7258 if (o->op_type == OP_PADANY) {
7259 o->op_type = OP_PADHV;
7260 o->op_ppaddr = PL_ppaddr[OP_PADHV];
7263 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
7264 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7265 "Using a hash as a reference is deprecated");
7267 return newUNOP(OP_RV2HV, 0, scalar(o));
7271 Perl_newCVREF(pTHX_ I32 flags, OP *o)
7273 return newUNOP(OP_RV2CV, flags, scalar(o));
7277 Perl_newSVREF(pTHX_ OP *o)
7281 PERL_ARGS_ASSERT_NEWSVREF;
7283 if (o->op_type == OP_PADANY) {
7284 o->op_type = OP_PADSV;
7285 o->op_ppaddr = PL_ppaddr[OP_PADSV];
7288 return newUNOP(OP_RV2SV, 0, scalar(o));
7291 /* Check routines. See the comments at the top of this file for details
7292 * on when these are called */
7295 Perl_ck_anoncode(pTHX_ OP *o)
7297 PERL_ARGS_ASSERT_CK_ANONCODE;
7299 cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type);
7301 cSVOPo->op_sv = NULL;
7306 Perl_ck_bitop(pTHX_ OP *o)
7310 PERL_ARGS_ASSERT_CK_BITOP;
7312 o->op_private = (U8)(PL_hints & HINT_INTEGER);
7313 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
7314 && (o->op_type == OP_BIT_OR
7315 || o->op_type == OP_BIT_AND
7316 || o->op_type == OP_BIT_XOR))
7318 const OP * const left = cBINOPo->op_first;
7319 const OP * const right = left->op_sibling;
7320 if ((OP_IS_NUMCOMPARE(left->op_type) &&
7321 (left->op_flags & OPf_PARENS) == 0) ||
7322 (OP_IS_NUMCOMPARE(right->op_type) &&
7323 (right->op_flags & OPf_PARENS) == 0))
7324 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
7325 "Possible precedence problem on bitwise %c operator",
7326 o->op_type == OP_BIT_OR ? '|'
7327 : o->op_type == OP_BIT_AND ? '&' : '^'
7333 PERL_STATIC_INLINE bool
7334 is_dollar_bracket(pTHX_ const OP * const o)
7337 return o->op_type == OP_RV2SV && o->op_flags & OPf_KIDS
7338 && (kid = cUNOPx(o)->op_first)
7339 && kid->op_type == OP_GV
7340 && strEQ(GvNAME(cGVOPx_gv(kid)), "[");
7344 Perl_ck_cmp(pTHX_ OP *o)
7346 PERL_ARGS_ASSERT_CK_CMP;
7347 if (ckWARN(WARN_SYNTAX)) {
7348 const OP *kid = cUNOPo->op_first;
7351 is_dollar_bracket(aTHX_ kid)
7352 && kid->op_sibling && kid->op_sibling->op_type == OP_CONST
7354 || ( kid->op_type == OP_CONST
7355 && (kid = kid->op_sibling) && is_dollar_bracket(aTHX_ kid))
7357 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7358 "$[ used in %s (did you mean $] ?)", OP_DESC(o));
7364 Perl_ck_concat(pTHX_ OP *o)
7366 const OP * const kid = cUNOPo->op_first;
7368 PERL_ARGS_ASSERT_CK_CONCAT;
7369 PERL_UNUSED_CONTEXT;
7371 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
7372 !(kUNOP->op_first->op_flags & OPf_MOD))
7373 o->op_flags |= OPf_STACKED;
7378 Perl_ck_spair(pTHX_ OP *o)
7382 PERL_ARGS_ASSERT_CK_SPAIR;
7384 if (o->op_flags & OPf_KIDS) {
7387 const OPCODE type = o->op_type;
7388 o = modkids(ck_fun(o), type);
7389 kid = cUNOPo->op_first;
7390 newop = kUNOP->op_first->op_sibling;
7392 const OPCODE type = newop->op_type;
7393 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
7394 type == OP_PADAV || type == OP_PADHV ||
7395 type == OP_RV2AV || type == OP_RV2HV)
7399 op_getmad(kUNOP->op_first,newop,'K');
7401 op_free(kUNOP->op_first);
7403 kUNOP->op_first = newop;
7405 o->op_ppaddr = PL_ppaddr[++o->op_type];
7410 Perl_ck_delete(pTHX_ OP *o)
7412 PERL_ARGS_ASSERT_CK_DELETE;
7416 if (o->op_flags & OPf_KIDS) {
7417 OP * const kid = cUNOPo->op_first;
7418 switch (kid->op_type) {
7420 o->op_flags |= OPf_SPECIAL;
7423 o->op_private |= OPpSLICE;
7426 o->op_flags |= OPf_SPECIAL;
7431 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
7434 if (kid->op_private & OPpLVAL_INTRO)
7435 o->op_private |= OPpLVAL_INTRO;
7442 Perl_ck_die(pTHX_ OP *o)
7444 PERL_ARGS_ASSERT_CK_DIE;
7447 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7453 Perl_ck_eof(pTHX_ OP *o)
7457 PERL_ARGS_ASSERT_CK_EOF;
7459 if (o->op_flags & OPf_KIDS) {
7461 if (cLISTOPo->op_first->op_type == OP_STUB) {
7463 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
7465 op_getmad(o,newop,'O');
7472 kid = cLISTOPo->op_first;
7473 if (kid->op_type == OP_RV2GV)
7474 kid->op_private |= OPpALLOW_FAKE;
7480 Perl_ck_eval(pTHX_ OP *o)
7484 PERL_ARGS_ASSERT_CK_EVAL;
7486 PL_hints |= HINT_BLOCK_SCOPE;
7487 if (o->op_flags & OPf_KIDS) {
7488 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7491 o->op_flags &= ~OPf_KIDS;
7494 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
7500 cUNOPo->op_first = 0;
7505 NewOp(1101, enter, 1, LOGOP);
7506 enter->op_type = OP_ENTERTRY;
7507 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
7508 enter->op_private = 0;
7510 /* establish postfix order */
7511 enter->op_next = (OP*)enter;
7513 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
7514 o->op_type = OP_LEAVETRY;
7515 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
7516 enter->op_other = o;
7517 op_getmad(oldo,o,'O');
7526 const U8 priv = o->op_private;
7532 o = newUNOP(OP_ENTEREVAL, priv <<8, newDEFSVOP());
7533 op_getmad(oldo,o,'O');
7535 o->op_targ = (PADOFFSET)PL_hints;
7536 if (o->op_private & OPpEVAL_BYTES) o->op_targ &= ~HINT_UTF8;
7537 if ((PL_hints & HINT_LOCALIZE_HH) != 0
7538 && !(o->op_private & OPpEVAL_COPHH) && GvHV(PL_hintgv)) {
7539 /* Store a copy of %^H that pp_entereval can pick up. */
7540 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
7541 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
7542 cUNOPo->op_first->op_sibling = hhop;
7543 o->op_private |= OPpEVAL_HAS_HH;
7545 if (!(o->op_private & OPpEVAL_BYTES)
7546 && FEATURE_UNIEVAL_IS_ENABLED)
7547 o->op_private |= OPpEVAL_UNICODE;
7553 Perl_ck_exit(pTHX_ OP *o)
7555 PERL_ARGS_ASSERT_CK_EXIT;
7558 HV * const table = GvHV(PL_hintgv);
7560 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
7561 if (svp && *svp && SvTRUE(*svp))
7562 o->op_private |= OPpEXIT_VMSISH;
7564 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7570 Perl_ck_exec(pTHX_ OP *o)
7572 PERL_ARGS_ASSERT_CK_EXEC;
7574 if (o->op_flags & OPf_STACKED) {
7577 kid = cUNOPo->op_first->op_sibling;
7578 if (kid->op_type == OP_RV2GV)
7587 Perl_ck_exists(pTHX_ OP *o)
7591 PERL_ARGS_ASSERT_CK_EXISTS;
7594 if (o->op_flags & OPf_KIDS) {
7595 OP * const kid = cUNOPo->op_first;
7596 if (kid->op_type == OP_ENTERSUB) {
7597 (void) ref(kid, o->op_type);
7598 if (kid->op_type != OP_RV2CV
7599 && !(PL_parser && PL_parser->error_count))
7600 Perl_croak(aTHX_ "%s argument is not a subroutine name",
7602 o->op_private |= OPpEXISTS_SUB;
7604 else if (kid->op_type == OP_AELEM)
7605 o->op_flags |= OPf_SPECIAL;
7606 else if (kid->op_type != OP_HELEM)
7607 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
7615 Perl_ck_rvconst(pTHX_ register OP *o)
7618 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7620 PERL_ARGS_ASSERT_CK_RVCONST;
7622 o->op_private |= (PL_hints & HINT_STRICT_REFS);
7623 if (o->op_type == OP_RV2CV)
7624 o->op_private &= ~1;
7626 if (kid->op_type == OP_CONST) {
7629 SV * const kidsv = kid->op_sv;
7631 /* Is it a constant from cv_const_sv()? */
7632 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
7633 SV * const rsv = SvRV(kidsv);
7634 const svtype type = SvTYPE(rsv);
7635 const char *badtype = NULL;
7637 switch (o->op_type) {
7639 if (type > SVt_PVMG)
7640 badtype = "a SCALAR";
7643 if (type != SVt_PVAV)
7644 badtype = "an ARRAY";
7647 if (type != SVt_PVHV)
7651 if (type != SVt_PVCV)
7656 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
7659 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
7660 const char *badthing;
7661 switch (o->op_type) {
7663 badthing = "a SCALAR";
7666 badthing = "an ARRAY";
7669 badthing = "a HASH";
7677 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
7678 SVfARG(kidsv), badthing);
7681 * This is a little tricky. We only want to add the symbol if we
7682 * didn't add it in the lexer. Otherwise we get duplicate strict
7683 * warnings. But if we didn't add it in the lexer, we must at
7684 * least pretend like we wanted to add it even if it existed before,
7685 * or we get possible typo warnings. OPpCONST_ENTERED says
7686 * whether the lexer already added THIS instance of this symbol.
7688 iscv = (o->op_type == OP_RV2CV) * 2;
7690 gv = gv_fetchsv(kidsv,
7691 iscv | !(kid->op_private & OPpCONST_ENTERED),
7694 : o->op_type == OP_RV2SV
7696 : o->op_type == OP_RV2AV
7698 : o->op_type == OP_RV2HV
7701 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
7703 kid->op_type = OP_GV;
7704 SvREFCNT_dec(kid->op_sv);
7706 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
7707 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
7708 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
7710 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
7712 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
7714 kid->op_private = 0;
7715 kid->op_ppaddr = PL_ppaddr[OP_GV];
7716 /* FAKE globs in the symbol table cause weird bugs (#77810) */
7724 Perl_ck_ftst(pTHX_ OP *o)
7727 const I32 type = o->op_type;
7729 PERL_ARGS_ASSERT_CK_FTST;
7731 if (o->op_flags & OPf_REF) {
7734 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
7735 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7736 const OPCODE kidtype = kid->op_type;
7738 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
7739 OP * const newop = newGVOP(type, OPf_REF,
7740 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
7742 op_getmad(o,newop,'O');
7748 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
7749 o->op_private |= OPpFT_ACCESS;
7750 if (PL_check[kidtype] == Perl_ck_ftst
7751 && kidtype != OP_STAT && kidtype != OP_LSTAT) {
7752 o->op_private |= OPpFT_STACKED;
7753 kid->op_private |= OPpFT_STACKING;
7754 if (kidtype == OP_FTTTY && (
7755 !(kid->op_private & OPpFT_STACKED)
7756 || kid->op_private & OPpFT_AFTER_t
7758 o->op_private |= OPpFT_AFTER_t;
7767 if (type == OP_FTTTY)
7768 o = newGVOP(type, OPf_REF, PL_stdingv);
7770 o = newUNOP(type, 0, newDEFSVOP());
7771 op_getmad(oldo,o,'O');
7777 Perl_ck_fun(pTHX_ OP *o)
7780 const int type = o->op_type;
7781 register I32 oa = PL_opargs[type] >> OASHIFT;
7783 PERL_ARGS_ASSERT_CK_FUN;
7785 if (o->op_flags & OPf_STACKED) {
7786 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
7789 return no_fh_allowed(o);
7792 if (o->op_flags & OPf_KIDS) {
7793 OP **tokid = &cLISTOPo->op_first;
7794 register OP *kid = cLISTOPo->op_first;
7797 bool seen_optional = FALSE;
7799 if (kid->op_type == OP_PUSHMARK ||
7800 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
7802 tokid = &kid->op_sibling;
7803 kid = kid->op_sibling;
7805 if (kid && kid->op_type == OP_COREARGS) {
7806 bool optional = FALSE;
7809 if (oa & OA_OPTIONAL) optional = TRUE;
7812 if (optional) o->op_private |= numargs;
7817 if (oa & OA_OPTIONAL || (oa & 7) == OA_LIST) {
7818 if (!kid && !seen_optional && PL_opargs[type] & OA_DEFGV)
7819 *tokid = kid = newDEFSVOP();
7820 seen_optional = TRUE;
7825 sibl = kid->op_sibling;
7827 if (!sibl && kid->op_type == OP_STUB) {
7834 /* list seen where single (scalar) arg expected? */
7835 if (numargs == 1 && !(oa >> 4)
7836 && kid->op_type == OP_LIST && type != OP_SCALAR)
7838 return too_many_arguments(o,PL_op_desc[type]);
7851 if ((type == OP_PUSH || type == OP_UNSHIFT)
7852 && !kid->op_sibling)
7853 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
7854 "Useless use of %s with no values",
7857 if (kid->op_type == OP_CONST &&
7858 (kid->op_private & OPpCONST_BARE))
7860 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
7861 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
7862 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7863 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
7864 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
7866 op_getmad(kid,newop,'K');
7871 kid->op_sibling = sibl;
7874 else if (kid->op_type == OP_CONST
7875 && ( !SvROK(cSVOPx_sv(kid))
7876 || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV )
7878 bad_type(numargs, "array", PL_op_desc[type], kid);
7879 /* Defer checks to run-time if we have a scalar arg */
7880 if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV)
7881 op_lvalue(kid, type);
7885 if (kid->op_type == OP_CONST &&
7886 (kid->op_private & OPpCONST_BARE))
7888 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
7889 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
7890 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7891 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
7892 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
7894 op_getmad(kid,newop,'K');
7899 kid->op_sibling = sibl;
7902 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
7903 bad_type(numargs, "hash", PL_op_desc[type], kid);
7904 op_lvalue(kid, type);
7908 OP * const newop = newUNOP(OP_NULL, 0, kid);
7909 kid->op_sibling = 0;
7911 newop->op_next = newop;
7913 kid->op_sibling = sibl;
7918 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
7919 if (kid->op_type == OP_CONST &&
7920 (kid->op_private & OPpCONST_BARE))
7922 OP * const newop = newGVOP(OP_GV, 0,
7923 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
7924 if (!(o->op_private & 1) && /* if not unop */
7925 kid == cLISTOPo->op_last)
7926 cLISTOPo->op_last = newop;
7928 op_getmad(kid,newop,'K');
7934 else if (kid->op_type == OP_READLINE) {
7935 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
7936 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
7939 I32 flags = OPf_SPECIAL;
7943 /* is this op a FH constructor? */
7944 if (is_handle_constructor(o,numargs)) {
7945 const char *name = NULL;
7948 bool want_dollar = TRUE;
7951 /* Set a flag to tell rv2gv to vivify
7952 * need to "prove" flag does not mean something
7953 * else already - NI-S 1999/05/07
7956 if (kid->op_type == OP_PADSV) {
7958 = PAD_COMPNAME_SV(kid->op_targ);
7959 name = SvPV_const(namesv, len);
7960 name_utf8 = SvUTF8(namesv);
7962 else if (kid->op_type == OP_RV2SV
7963 && kUNOP->op_first->op_type == OP_GV)
7965 GV * const gv = cGVOPx_gv(kUNOP->op_first);
7967 len = GvNAMELEN(gv);
7968 name_utf8 = GvNAMEUTF8(gv) ? SVf_UTF8 : 0;
7970 else if (kid->op_type == OP_AELEM
7971 || kid->op_type == OP_HELEM)
7974 OP *op = ((BINOP*)kid)->op_first;
7978 const char * const a =
7979 kid->op_type == OP_AELEM ?
7981 if (((op->op_type == OP_RV2AV) ||
7982 (op->op_type == OP_RV2HV)) &&
7983 (firstop = ((UNOP*)op)->op_first) &&
7984 (firstop->op_type == OP_GV)) {
7985 /* packagevar $a[] or $h{} */
7986 GV * const gv = cGVOPx_gv(firstop);
7994 else if (op->op_type == OP_PADAV
7995 || op->op_type == OP_PADHV) {
7996 /* lexicalvar $a[] or $h{} */
7997 const char * const padname =
7998 PAD_COMPNAME_PV(op->op_targ);
8007 name = SvPV_const(tmpstr, len);
8008 name_utf8 = SvUTF8(tmpstr);
8013 name = "__ANONIO__";
8015 want_dollar = FALSE;
8017 op_lvalue(kid, type);
8021 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
8022 namesv = PAD_SVl(targ);
8023 SvUPGRADE(namesv, SVt_PV);
8024 if (want_dollar && *name != '$')
8025 sv_setpvs(namesv, "$");
8026 sv_catpvn(namesv, name, len);
8027 if ( name_utf8 ) SvUTF8_on(namesv);
8030 kid->op_sibling = 0;
8031 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
8032 kid->op_targ = targ;
8033 kid->op_private |= priv;
8035 kid->op_sibling = sibl;
8041 op_lvalue(scalar(kid), type);
8045 tokid = &kid->op_sibling;
8046 kid = kid->op_sibling;
8049 if (kid && kid->op_type != OP_STUB)
8050 return too_many_arguments(o,OP_DESC(o));
8051 o->op_private |= numargs;
8053 /* FIXME - should the numargs move as for the PERL_MAD case? */
8054 o->op_private |= numargs;
8056 return too_many_arguments(o,OP_DESC(o));
8060 else if (PL_opargs[type] & OA_DEFGV) {
8062 OP *newop = newUNOP(type, 0, newDEFSVOP());
8063 op_getmad(o,newop,'O');
8066 /* Ordering of these two is important to keep f_map.t passing. */
8068 return newUNOP(type, 0, newDEFSVOP());
8073 while (oa & OA_OPTIONAL)
8075 if (oa && oa != OA_LIST)
8076 return too_few_arguments(o,OP_DESC(o));
8082 Perl_ck_glob(pTHX_ OP *o)
8086 const bool core = o->op_flags & OPf_SPECIAL;
8088 PERL_ARGS_ASSERT_CK_GLOB;
8091 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
8092 op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */
8094 if (core) gv = NULL;
8095 else if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
8096 && GvCVu(gv) && GvIMPORTED_CV(gv)))
8098 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
8101 #if !defined(PERL_EXTERNAL_GLOB)
8102 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
8104 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
8105 newSVpvs("File::Glob"), NULL, NULL, NULL);
8108 #endif /* !PERL_EXTERNAL_GLOB */
8110 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8113 * \ null - const(wildcard)
8118 * \ mark - glob - rv2cv
8119 * | \ gv(CORE::GLOBAL::glob)
8121 * \ null - const(wildcard) - const(ix)
8123 o->op_flags |= OPf_SPECIAL;
8124 o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP);
8125 op_append_elem(OP_GLOB, o,
8126 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
8127 o = newLISTOP(OP_LIST, 0, o, NULL);
8128 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
8129 op_append_elem(OP_LIST, o,
8130 scalar(newUNOP(OP_RV2CV, 0,
8131 newGVOP(OP_GV, 0, gv)))));
8132 o = newUNOP(OP_NULL, 0, ck_subr(o));
8133 o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */
8136 else o->op_flags &= ~OPf_SPECIAL;
8137 gv = newGVgen("main");
8139 #ifndef PERL_EXTERNAL_GLOB
8140 sv_setiv(GvSVn(gv),PL_glob_index++);
8142 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
8148 Perl_ck_grep(pTHX_ OP *o)
8153 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
8156 PERL_ARGS_ASSERT_CK_GREP;
8158 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
8159 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
8161 if (o->op_flags & OPf_STACKED) {
8164 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
8165 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
8166 return no_fh_allowed(o);
8167 for (k = kid; k; k = k->op_next) {
8170 NewOp(1101, gwop, 1, LOGOP);
8171 kid->op_next = (OP*)gwop;
8172 o->op_flags &= ~OPf_STACKED;
8174 kid = cLISTOPo->op_first->op_sibling;
8175 if (type == OP_MAPWHILE)
8180 if (PL_parser && PL_parser->error_count)
8182 kid = cLISTOPo->op_first->op_sibling;
8183 if (kid->op_type != OP_NULL)
8184 Perl_croak(aTHX_ "panic: ck_grep, type=%u", (unsigned) kid->op_type);
8185 kid = kUNOP->op_first;
8188 NewOp(1101, gwop, 1, LOGOP);
8189 gwop->op_type = type;
8190 gwop->op_ppaddr = PL_ppaddr[type];
8191 gwop->op_first = listkids(o);
8192 gwop->op_flags |= OPf_KIDS;
8193 gwop->op_other = LINKLIST(kid);
8194 kid->op_next = (OP*)gwop;
8195 offset = pad_findmy_pvs("$_", 0);
8196 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
8197 o->op_private = gwop->op_private = 0;
8198 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
8201 o->op_private = gwop->op_private = OPpGREP_LEX;
8202 gwop->op_targ = o->op_targ = offset;
8205 kid = cLISTOPo->op_first->op_sibling;
8206 if (!kid || !kid->op_sibling)
8207 return too_few_arguments(o,OP_DESC(o));
8208 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
8209 op_lvalue(kid, OP_GREPSTART);
8215 Perl_ck_index(pTHX_ OP *o)
8217 PERL_ARGS_ASSERT_CK_INDEX;
8219 if (o->op_flags & OPf_KIDS) {
8220 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8222 kid = kid->op_sibling; /* get past "big" */
8223 if (kid && kid->op_type == OP_CONST) {
8224 const bool save_taint = PL_tainted;
8225 fbm_compile(((SVOP*)kid)->op_sv, 0);
8226 PL_tainted = save_taint;
8233 Perl_ck_lfun(pTHX_ OP *o)
8235 const OPCODE type = o->op_type;
8237 PERL_ARGS_ASSERT_CK_LFUN;
8239 return modkids(ck_fun(o), type);
8243 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
8245 PERL_ARGS_ASSERT_CK_DEFINED;
8247 if ((o->op_flags & OPf_KIDS)) {
8248 switch (cUNOPo->op_first->op_type) {
8251 case OP_AASSIGN: /* Is this a good idea? */
8252 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8253 "defined(@array) is deprecated");
8254 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8255 "\t(Maybe you should just omit the defined()?)\n");
8259 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8260 "defined(%%hash) is deprecated");
8261 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8262 "\t(Maybe you should just omit the defined()?)\n");
8273 Perl_ck_readline(pTHX_ OP *o)
8275 PERL_ARGS_ASSERT_CK_READLINE;
8277 if (o->op_flags & OPf_KIDS) {
8278 OP *kid = cLISTOPo->op_first;
8279 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
8283 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
8285 op_getmad(o,newop,'O');
8295 Perl_ck_rfun(pTHX_ OP *o)
8297 const OPCODE type = o->op_type;
8299 PERL_ARGS_ASSERT_CK_RFUN;
8301 return refkids(ck_fun(o), type);
8305 Perl_ck_listiob(pTHX_ OP *o)
8309 PERL_ARGS_ASSERT_CK_LISTIOB;
8311 kid = cLISTOPo->op_first;
8314 kid = cLISTOPo->op_first;
8316 if (kid->op_type == OP_PUSHMARK)
8317 kid = kid->op_sibling;
8318 if (kid && o->op_flags & OPf_STACKED)
8319 kid = kid->op_sibling;
8320 else if (kid && !kid->op_sibling) { /* print HANDLE; */
8321 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
8322 o->op_flags |= OPf_STACKED; /* make it a filehandle */
8323 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
8324 cLISTOPo->op_first->op_sibling = kid;
8325 cLISTOPo->op_last = kid;
8326 kid = kid->op_sibling;
8331 op_append_elem(o->op_type, o, newDEFSVOP());
8333 if (o->op_type == OP_PRTF) return modkids(listkids(o), OP_PRTF);
8338 Perl_ck_smartmatch(pTHX_ OP *o)
8341 PERL_ARGS_ASSERT_CK_SMARTMATCH;
8342 if (0 == (o->op_flags & OPf_SPECIAL)) {
8343 OP *first = cBINOPo->op_first;
8344 OP *second = first->op_sibling;
8346 /* Implicitly take a reference to an array or hash */
8347 first->op_sibling = NULL;
8348 first = cBINOPo->op_first = ref_array_or_hash(first);
8349 second = first->op_sibling = ref_array_or_hash(second);
8351 /* Implicitly take a reference to a regular expression */
8352 if (first->op_type == OP_MATCH) {
8353 first->op_type = OP_QR;
8354 first->op_ppaddr = PL_ppaddr[OP_QR];
8356 if (second->op_type == OP_MATCH) {
8357 second->op_type = OP_QR;
8358 second->op_ppaddr = PL_ppaddr[OP_QR];
8367 Perl_ck_sassign(pTHX_ OP *o)
8370 OP * const kid = cLISTOPo->op_first;
8372 PERL_ARGS_ASSERT_CK_SASSIGN;
8374 /* has a disposable target? */
8375 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
8376 && !(kid->op_flags & OPf_STACKED)
8377 /* Cannot steal the second time! */
8378 && !(kid->op_private & OPpTARGET_MY)
8379 /* Keep the full thing for madskills */
8383 OP * const kkid = kid->op_sibling;
8385 /* Can just relocate the target. */
8386 if (kkid && kkid->op_type == OP_PADSV
8387 && !(kkid->op_private & OPpLVAL_INTRO))
8389 kid->op_targ = kkid->op_targ;
8391 /* Now we do not need PADSV and SASSIGN. */
8392 kid->op_sibling = o->op_sibling; /* NULL */
8393 cLISTOPo->op_first = NULL;
8396 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
8400 if (kid->op_sibling) {
8401 OP *kkid = kid->op_sibling;
8402 /* For state variable assignment, kkid is a list op whose op_last
8404 if ((kkid->op_type == OP_PADSV ||
8405 (kkid->op_type == OP_LIST &&
8406 (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV
8409 && (kkid->op_private & OPpLVAL_INTRO)
8410 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
8411 const PADOFFSET target = kkid->op_targ;
8412 OP *const other = newOP(OP_PADSV,
8414 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
8415 OP *const first = newOP(OP_NULL, 0);
8416 OP *const nullop = newCONDOP(0, first, o, other);
8417 OP *const condop = first->op_next;
8418 /* hijacking PADSTALE for uninitialized state variables */
8419 SvPADSTALE_on(PAD_SVl(target));
8421 condop->op_type = OP_ONCE;
8422 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
8423 condop->op_targ = target;
8424 other->op_targ = target;
8426 /* Because we change the type of the op here, we will skip the
8427 assignment binop->op_last = binop->op_first->op_sibling; at the
8428 end of Perl_newBINOP(). So need to do it here. */
8429 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
8438 Perl_ck_match(pTHX_ OP *o)
8442 PERL_ARGS_ASSERT_CK_MATCH;
8444 if (o->op_type != OP_QR && PL_compcv) {
8445 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
8446 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
8447 o->op_targ = offset;
8448 o->op_private |= OPpTARGET_MY;
8451 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
8452 o->op_private |= OPpRUNTIME;
8457 Perl_ck_method(pTHX_ OP *o)
8459 OP * const kid = cUNOPo->op_first;
8461 PERL_ARGS_ASSERT_CK_METHOD;
8463 if (kid->op_type == OP_CONST) {
8464 SV* sv = kSVOP->op_sv;
8465 const char * const method = SvPVX_const(sv);
8466 if (!(strchr(method, ':') || strchr(method, '\''))) {
8468 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
8469 sv = newSVpvn_share(method, SvUTF8(sv) ? -(I32)SvCUR(sv) : (I32)SvCUR(sv), 0);
8472 kSVOP->op_sv = NULL;
8474 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
8476 op_getmad(o,cmop,'O');
8487 Perl_ck_null(pTHX_ OP *o)
8489 PERL_ARGS_ASSERT_CK_NULL;
8490 PERL_UNUSED_CONTEXT;
8495 Perl_ck_open(pTHX_ OP *o)
8498 HV * const table = GvHV(PL_hintgv);
8500 PERL_ARGS_ASSERT_CK_OPEN;
8503 SV **svp = hv_fetchs(table, "open_IN", FALSE);
8506 const char *d = SvPV_const(*svp, len);
8507 const I32 mode = mode_from_discipline(d, len);
8508 if (mode & O_BINARY)
8509 o->op_private |= OPpOPEN_IN_RAW;
8510 else if (mode & O_TEXT)
8511 o->op_private |= OPpOPEN_IN_CRLF;
8514 svp = hv_fetchs(table, "open_OUT", FALSE);
8517 const char *d = SvPV_const(*svp, len);
8518 const I32 mode = mode_from_discipline(d, len);
8519 if (mode & O_BINARY)
8520 o->op_private |= OPpOPEN_OUT_RAW;
8521 else if (mode & O_TEXT)
8522 o->op_private |= OPpOPEN_OUT_CRLF;
8525 if (o->op_type == OP_BACKTICK) {
8526 if (!(o->op_flags & OPf_KIDS)) {
8527 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
8529 op_getmad(o,newop,'O');
8538 /* In case of three-arg dup open remove strictness
8539 * from the last arg if it is a bareword. */
8540 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
8541 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
8545 if ((last->op_type == OP_CONST) && /* The bareword. */
8546 (last->op_private & OPpCONST_BARE) &&
8547 (last->op_private & OPpCONST_STRICT) &&
8548 (oa = first->op_sibling) && /* The fh. */
8549 (oa = oa->op_sibling) && /* The mode. */
8550 (oa->op_type == OP_CONST) &&
8551 SvPOK(((SVOP*)oa)->op_sv) &&
8552 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
8553 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
8554 (last == oa->op_sibling)) /* The bareword. */
8555 last->op_private &= ~OPpCONST_STRICT;
8561 Perl_ck_repeat(pTHX_ OP *o)
8563 PERL_ARGS_ASSERT_CK_REPEAT;
8565 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
8566 o->op_private |= OPpREPEAT_DOLIST;
8567 cBINOPo->op_first = force_list(cBINOPo->op_first);
8575 Perl_ck_require(pTHX_ OP *o)
8580 PERL_ARGS_ASSERT_CK_REQUIRE;
8582 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
8583 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8585 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
8586 SV * const sv = kid->op_sv;
8587 U32 was_readonly = SvREADONLY(sv);
8594 sv_force_normal_flags(sv, 0);
8595 assert(!SvREADONLY(sv));
8605 for (; s < end; s++) {
8606 if (*s == ':' && s[1] == ':') {
8608 Move(s+2, s+1, end - s - 1, char);
8613 sv_catpvs(sv, ".pm");
8614 SvFLAGS(sv) |= was_readonly;
8618 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
8619 /* handle override, if any */
8620 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
8621 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
8622 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
8623 gv = gvp ? *gvp : NULL;
8627 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8629 if (o->op_flags & OPf_KIDS) {
8630 kid = cUNOPo->op_first;
8631 cUNOPo->op_first = NULL;
8639 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
8640 op_append_elem(OP_LIST, kid,
8641 scalar(newUNOP(OP_RV2CV, 0,
8644 op_getmad(o,newop,'O');
8648 return scalar(ck_fun(o));
8652 Perl_ck_return(pTHX_ OP *o)
8657 PERL_ARGS_ASSERT_CK_RETURN;
8659 kid = cLISTOPo->op_first->op_sibling;
8660 if (CvLVALUE(PL_compcv)) {
8661 for (; kid; kid = kid->op_sibling)
8662 op_lvalue(kid, OP_LEAVESUBLV);
8669 Perl_ck_select(pTHX_ OP *o)
8674 PERL_ARGS_ASSERT_CK_SELECT;
8676 if (o->op_flags & OPf_KIDS) {
8677 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8678 if (kid && kid->op_sibling) {
8679 o->op_type = OP_SSELECT;
8680 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
8682 return fold_constants(op_integerize(op_std_init(o)));
8686 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8687 if (kid && kid->op_type == OP_RV2GV)
8688 kid->op_private &= ~HINT_STRICT_REFS;
8693 Perl_ck_shift(pTHX_ OP *o)
8696 const I32 type = o->op_type;
8698 PERL_ARGS_ASSERT_CK_SHIFT;
8700 if (!(o->op_flags & OPf_KIDS)) {
8703 if (!CvUNIQUE(PL_compcv)) {
8704 o->op_flags |= OPf_SPECIAL;
8708 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
8711 OP * const oldo = o;
8712 o = newUNOP(type, 0, scalar(argop));
8713 op_getmad(oldo,o,'O');
8718 return newUNOP(type, 0, scalar(argop));
8721 return scalar(ck_fun(o));
8725 Perl_ck_sort(pTHX_ OP *o)
8730 PERL_ARGS_ASSERT_CK_SORT;
8732 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
8733 HV * const hinthv = GvHV(PL_hintgv);
8735 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
8737 const I32 sorthints = (I32)SvIV(*svp);
8738 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
8739 o->op_private |= OPpSORT_QSORT;
8740 if ((sorthints & HINT_SORT_STABLE) != 0)
8741 o->op_private |= OPpSORT_STABLE;
8746 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
8748 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8749 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
8751 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
8753 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
8755 if (kid->op_type == OP_SCOPE) {
8759 else if (kid->op_type == OP_LEAVE) {
8760 if (o->op_type == OP_SORT) {
8761 op_null(kid); /* wipe out leave */
8764 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
8765 if (k->op_next == kid)
8767 /* don't descend into loops */
8768 else if (k->op_type == OP_ENTERLOOP
8769 || k->op_type == OP_ENTERITER)
8771 k = cLOOPx(k)->op_lastop;
8776 kid->op_next = 0; /* just disconnect the leave */
8777 k = kLISTOP->op_first;
8782 if (o->op_type == OP_SORT) {
8783 /* provide scalar context for comparison function/block */
8789 o->op_flags |= OPf_SPECIAL;
8792 firstkid = firstkid->op_sibling;
8795 /* provide list context for arguments */
8796 if (o->op_type == OP_SORT)
8803 S_simplify_sort(pTHX_ OP *o)
8806 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8812 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
8814 if (!(o->op_flags & OPf_STACKED))
8816 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
8817 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
8818 kid = kUNOP->op_first; /* get past null */
8819 if (kid->op_type != OP_SCOPE)
8821 kid = kLISTOP->op_last; /* get past scope */
8822 switch(kid->op_type) {
8830 k = kid; /* remember this node*/
8831 if (kBINOP->op_first->op_type != OP_RV2SV)
8833 kid = kBINOP->op_first; /* get past cmp */
8834 if (kUNOP->op_first->op_type != OP_GV)
8836 kid = kUNOP->op_first; /* get past rv2sv */
8838 if (GvSTASH(gv) != PL_curstash)
8840 gvname = GvNAME(gv);
8841 if (*gvname == 'a' && gvname[1] == '\0')
8843 else if (*gvname == 'b' && gvname[1] == '\0')
8848 kid = k; /* back to cmp */
8849 if (kBINOP->op_last->op_type != OP_RV2SV)
8851 kid = kBINOP->op_last; /* down to 2nd arg */
8852 if (kUNOP->op_first->op_type != OP_GV)
8854 kid = kUNOP->op_first; /* get past rv2sv */
8856 if (GvSTASH(gv) != PL_curstash)
8858 gvname = GvNAME(gv);
8860 ? !(*gvname == 'a' && gvname[1] == '\0')
8861 : !(*gvname == 'b' && gvname[1] == '\0'))
8863 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
8865 o->op_private |= OPpSORT_DESCEND;
8866 if (k->op_type == OP_NCMP)
8867 o->op_private |= OPpSORT_NUMERIC;
8868 if (k->op_type == OP_I_NCMP)
8869 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
8870 kid = cLISTOPo->op_first->op_sibling;
8871 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
8873 op_getmad(kid,o,'S'); /* then delete it */
8875 op_free(kid); /* then delete it */
8880 Perl_ck_split(pTHX_ OP *o)
8885 PERL_ARGS_ASSERT_CK_SPLIT;
8887 if (o->op_flags & OPf_STACKED)
8888 return no_fh_allowed(o);
8890 kid = cLISTOPo->op_first;
8891 if (kid->op_type != OP_NULL)
8892 Perl_croak(aTHX_ "panic: ck_split, type=%u", (unsigned) kid->op_type);
8893 kid = kid->op_sibling;
8894 op_free(cLISTOPo->op_first);
8896 cLISTOPo->op_first = kid;
8898 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
8899 cLISTOPo->op_last = kid; /* There was only one element previously */
8902 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
8903 OP * const sibl = kid->op_sibling;
8904 kid->op_sibling = 0;
8905 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
8906 if (cLISTOPo->op_first == cLISTOPo->op_last)
8907 cLISTOPo->op_last = kid;
8908 cLISTOPo->op_first = kid;
8909 kid->op_sibling = sibl;
8912 kid->op_type = OP_PUSHRE;
8913 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
8915 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
8916 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
8917 "Use of /g modifier is meaningless in split");
8920 if (!kid->op_sibling)
8921 op_append_elem(OP_SPLIT, o, newDEFSVOP());
8923 kid = kid->op_sibling;
8926 if (!kid->op_sibling)
8927 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
8928 assert(kid->op_sibling);
8930 kid = kid->op_sibling;
8933 if (kid->op_sibling)
8934 return too_many_arguments(o,OP_DESC(o));
8940 Perl_ck_join(pTHX_ OP *o)
8942 const OP * const kid = cLISTOPo->op_first->op_sibling;
8944 PERL_ARGS_ASSERT_CK_JOIN;
8946 if (kid && kid->op_type == OP_MATCH) {
8947 if (ckWARN(WARN_SYNTAX)) {
8948 const REGEXP *re = PM_GETRE(kPMOP);
8949 const char *pmstr = re ? RX_PRECOMP_const(re) : "STRING";
8950 const STRLEN len = re ? RX_PRELEN(re) : 6;
8951 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
8952 "/%.*s/ should probably be written as \"%.*s\"",
8953 (int)len, pmstr, (int)len, pmstr);
8960 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
8962 Examines an op, which is expected to identify a subroutine at runtime,
8963 and attempts to determine at compile time which subroutine it identifies.
8964 This is normally used during Perl compilation to determine whether
8965 a prototype can be applied to a function call. I<cvop> is the op
8966 being considered, normally an C<rv2cv> op. A pointer to the identified
8967 subroutine is returned, if it could be determined statically, and a null
8968 pointer is returned if it was not possible to determine statically.
8970 Currently, the subroutine can be identified statically if the RV that the
8971 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
8972 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
8973 suitable if the constant value must be an RV pointing to a CV. Details of
8974 this process may change in future versions of Perl. If the C<rv2cv> op
8975 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
8976 the subroutine statically: this flag is used to suppress compile-time
8977 magic on a subroutine call, forcing it to use default runtime behaviour.
8979 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
8980 of a GV reference is modified. If a GV was examined and its CV slot was
8981 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
8982 If the op is not optimised away, and the CV slot is later populated with
8983 a subroutine having a prototype, that flag eventually triggers the warning
8984 "called too early to check prototype".
8986 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
8987 of returning a pointer to the subroutine it returns a pointer to the
8988 GV giving the most appropriate name for the subroutine in this context.
8989 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
8990 (C<CvANON>) subroutine that is referenced through a GV it will be the
8991 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
8992 A null pointer is returned as usual if there is no statically-determinable
8999 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
9004 PERL_ARGS_ASSERT_RV2CV_OP_CV;
9005 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
9006 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
9007 if (cvop->op_type != OP_RV2CV)
9009 if (cvop->op_private & OPpENTERSUB_AMPER)
9011 if (!(cvop->op_flags & OPf_KIDS))
9013 rvop = cUNOPx(cvop)->op_first;
9014 switch (rvop->op_type) {
9016 gv = cGVOPx_gv(rvop);
9019 if (flags & RV2CVOPCV_MARK_EARLY)
9020 rvop->op_private |= OPpEARLY_CV;
9025 SV *rv = cSVOPx_sv(rvop);
9035 if (SvTYPE((SV*)cv) != SVt_PVCV)
9037 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
9038 if (!CvANON(cv) || !gv)
9047 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
9049 Performs the default fixup of the arguments part of an C<entersub>
9050 op tree. This consists of applying list context to each of the
9051 argument ops. This is the standard treatment used on a call marked
9052 with C<&>, or a method call, or a call through a subroutine reference,
9053 or any other call where the callee can't be identified at compile time,
9054 or a call where the callee has no prototype.
9060 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
9063 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
9064 aop = cUNOPx(entersubop)->op_first;
9065 if (!aop->op_sibling)
9066 aop = cUNOPx(aop)->op_first;
9067 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
9068 if (!(PL_madskills && aop->op_type == OP_STUB)) {
9070 op_lvalue(aop, OP_ENTERSUB);
9077 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
9079 Performs the fixup of the arguments part of an C<entersub> op tree
9080 based on a subroutine prototype. This makes various modifications to
9081 the argument ops, from applying context up to inserting C<refgen> ops,
9082 and checking the number and syntactic types of arguments, as directed by
9083 the prototype. This is the standard treatment used on a subroutine call,
9084 not marked with C<&>, where the callee can be identified at compile time
9085 and has a prototype.
9087 I<protosv> supplies the subroutine prototype to be applied to the call.
9088 It may be a normal defined scalar, of which the string value will be used.
9089 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
9090 that has been cast to C<SV*>) which has a prototype. The prototype
9091 supplied, in whichever form, does not need to match the actual callee
9092 referenced by the op tree.
9094 If the argument ops disagree with the prototype, for example by having
9095 an unacceptable number of arguments, a valid op tree is returned anyway.
9096 The error is reflected in the parser state, normally resulting in a single
9097 exception at the top level of parsing which covers all the compilation
9098 errors that occurred. In the error message, the callee is referred to
9099 by the name defined by the I<namegv> parameter.
9105 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
9108 const char *proto, *proto_end;
9109 OP *aop, *prev, *cvop;
9112 I32 contextclass = 0;
9113 const char *e = NULL;
9114 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
9115 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
9116 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto,"
9117 "flags=%lx", (unsigned long) SvFLAGS(protosv));
9118 if (SvTYPE(protosv) == SVt_PVCV)
9119 proto = CvPROTO(protosv), proto_len = CvPROTOLEN(protosv);
9120 else proto = SvPV(protosv, proto_len);
9121 proto_end = proto + proto_len;
9122 aop = cUNOPx(entersubop)->op_first;
9123 if (!aop->op_sibling)
9124 aop = cUNOPx(aop)->op_first;
9126 aop = aop->op_sibling;
9127 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9128 while (aop != cvop) {
9130 if (PL_madskills && aop->op_type == OP_STUB) {
9131 aop = aop->op_sibling;
9134 if (PL_madskills && aop->op_type == OP_NULL)
9135 o3 = ((UNOP*)aop)->op_first;
9139 if (proto >= proto_end)
9140 return too_many_arguments(entersubop, gv_ename(namegv));
9148 /* _ must be at the end */
9149 if (proto[1] && !strchr(";@%", proto[1]))
9164 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
9166 arg == 1 ? "block or sub {}" : "sub {}",
9167 gv_ename(namegv), o3);
9170 /* '*' allows any scalar type, including bareword */
9173 if (o3->op_type == OP_RV2GV)
9174 goto wrapref; /* autoconvert GLOB -> GLOBref */
9175 else if (o3->op_type == OP_CONST)
9176 o3->op_private &= ~OPpCONST_STRICT;
9177 else if (o3->op_type == OP_ENTERSUB) {
9178 /* accidental subroutine, revert to bareword */
9179 OP *gvop = ((UNOP*)o3)->op_first;
9180 if (gvop && gvop->op_type == OP_NULL) {
9181 gvop = ((UNOP*)gvop)->op_first;
9183 for (; gvop->op_sibling; gvop = gvop->op_sibling)
9186 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
9187 (gvop = ((UNOP*)gvop)->op_first) &&
9188 gvop->op_type == OP_GV)
9190 GV * const gv = cGVOPx_gv(gvop);
9191 OP * const sibling = aop->op_sibling;
9192 SV * const n = newSVpvs("");
9194 OP * const oldaop = aop;
9198 gv_fullname4(n, gv, "", FALSE);
9199 aop = newSVOP(OP_CONST, 0, n);
9200 op_getmad(oldaop,aop,'O');
9201 prev->op_sibling = aop;
9202 aop->op_sibling = sibling;
9212 if (o3->op_type == OP_RV2AV ||
9213 o3->op_type == OP_PADAV ||
9214 o3->op_type == OP_RV2HV ||
9215 o3->op_type == OP_PADHV
9230 if (contextclass++ == 0) {
9231 e = strchr(proto, ']');
9232 if (!e || e == proto)
9241 const char *p = proto;
9242 const char *const end = proto;
9245 /* \[$] accepts any scalar lvalue */
9247 && Perl_op_lvalue_flags(aTHX_
9249 OP_READ, /* not entersub */
9252 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
9254 gv_ename(namegv), o3);
9259 if (o3->op_type == OP_RV2GV)
9262 bad_type(arg, "symbol", gv_ename(namegv), o3);
9265 if (o3->op_type == OP_ENTERSUB)
9268 bad_type(arg, "subroutine entry", gv_ename(namegv),
9272 if (o3->op_type == OP_RV2SV ||
9273 o3->op_type == OP_PADSV ||
9274 o3->op_type == OP_HELEM ||
9275 o3->op_type == OP_AELEM)
9277 if (!contextclass) {
9278 /* \$ accepts any scalar lvalue */
9279 if (Perl_op_lvalue_flags(aTHX_
9281 OP_READ, /* not entersub */
9284 bad_type(arg, "scalar", gv_ename(namegv), o3);
9288 if (o3->op_type == OP_RV2AV ||
9289 o3->op_type == OP_PADAV)
9292 bad_type(arg, "array", gv_ename(namegv), o3);
9295 if (o3->op_type == OP_RV2HV ||
9296 o3->op_type == OP_PADHV)
9299 bad_type(arg, "hash", gv_ename(namegv), o3);
9303 OP* const kid = aop;
9304 OP* const sib = kid->op_sibling;
9305 kid->op_sibling = 0;
9306 aop = newUNOP(OP_REFGEN, 0, kid);
9307 aop->op_sibling = sib;
9308 prev->op_sibling = aop;
9310 if (contextclass && e) {
9325 SV* const tmpsv = sv_newmortal();
9326 gv_efullname3(tmpsv, namegv, NULL);
9327 Perl_croak(aTHX_ "Malformed prototype for %"SVf": %"SVf,
9328 SVfARG(tmpsv), SVfARG(protosv));
9332 op_lvalue(aop, OP_ENTERSUB);
9334 aop = aop->op_sibling;
9336 if (aop == cvop && *proto == '_') {
9337 /* generate an access to $_ */
9339 aop->op_sibling = prev->op_sibling;
9340 prev->op_sibling = aop; /* instead of cvop */
9342 if (!optional && proto_end > proto &&
9343 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
9344 return too_few_arguments(entersubop, gv_ename(namegv));
9349 =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv
9351 Performs the fixup of the arguments part of an C<entersub> op tree either
9352 based on a subroutine prototype or using default list-context processing.
9353 This is the standard treatment used on a subroutine call, not marked
9354 with C<&>, where the callee can be identified at compile time.
9356 I<protosv> supplies the subroutine prototype to be applied to the call,
9357 or indicates that there is no prototype. It may be a normal scalar,
9358 in which case if it is defined then the string value will be used
9359 as a prototype, and if it is undefined then there is no prototype.
9360 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
9361 that has been cast to C<SV*>), of which the prototype will be used if it
9362 has one. The prototype (or lack thereof) supplied, in whichever form,
9363 does not need to match the actual callee referenced by the op tree.
9365 If the argument ops disagree with the prototype, for example by having
9366 an unacceptable number of arguments, a valid op tree is returned anyway.
9367 The error is reflected in the parser state, normally resulting in a single
9368 exception at the top level of parsing which covers all the compilation
9369 errors that occurred. In the error message, the callee is referred to
9370 by the name defined by the I<namegv> parameter.
9376 Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop,
9377 GV *namegv, SV *protosv)
9379 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST;
9380 if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv))
9381 return ck_entersub_args_proto(entersubop, namegv, protosv);
9383 return ck_entersub_args_list(entersubop);
9387 Perl_ck_entersub_args_core(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
9389 int opnum = SvTYPE(protosv) == SVt_PVCV ? 0 : (int)SvUV(protosv);
9390 OP *aop = cUNOPx(entersubop)->op_first;
9392 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_CORE;
9396 if (!aop->op_sibling)
9397 aop = cUNOPx(aop)->op_first;
9398 aop = aop->op_sibling;
9399 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9400 if (PL_madskills) while (aop != cvop && aop->op_type == OP_STUB) {
9401 aop = aop->op_sibling;
9404 (void)too_many_arguments(entersubop, GvNAME(namegv));
9406 op_free(entersubop);
9407 switch(GvNAME(namegv)[2]) {
9408 case 'F': return newSVOP(OP_CONST, 0,
9409 newSVpv(CopFILE(PL_curcop),0));
9410 case 'L': return newSVOP(
9413 "%"IVdf, (IV)CopLINE(PL_curcop)
9416 case 'P': return newSVOP(OP_CONST, 0,
9418 ? newSVhek(HvNAME_HEK(PL_curstash))
9429 bool seenarg = FALSE;
9431 if (!aop->op_sibling)
9432 aop = cUNOPx(aop)->op_first;
9435 aop = aop->op_sibling;
9436 prev->op_sibling = NULL;
9439 prev=cvop, cvop = cvop->op_sibling)
9441 if (PL_madskills && cvop->op_sibling
9442 && cvop->op_type != OP_STUB) seenarg = TRUE
9445 prev->op_sibling = NULL;
9446 flags = OPf_SPECIAL * !(cvop->op_private & OPpENTERSUB_NOPAREN);
9448 if (aop == cvop) aop = NULL;
9449 op_free(entersubop);
9451 if (opnum == OP_ENTEREVAL
9452 && GvNAMELEN(namegv)==9 && strnEQ(GvNAME(namegv), "evalbytes", 9))
9453 flags |= OPpEVAL_BYTES <<8;
9455 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
9457 case OA_BASEOP_OR_UNOP:
9459 return aop ? newUNOP(opnum,flags,aop) : newOP(opnum,flags);
9463 if (!PL_madskills || seenarg)
9465 (void)too_many_arguments(aop, GvNAME(namegv));
9468 return opnum == OP_RUNCV
9469 ? newPVOP(OP_RUNCV,0,NULL)
9472 return convert(opnum,0,aop);
9480 =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p
9482 Retrieves the function that will be used to fix up a call to I<cv>.
9483 Specifically, the function is applied to an C<entersub> op tree for a
9484 subroutine call, not marked with C<&>, where the callee can be identified
9485 at compile time as I<cv>.
9487 The C-level function pointer is returned in I<*ckfun_p>, and an SV
9488 argument for it is returned in I<*ckobj_p>. The function is intended
9489 to be called in this manner:
9491 entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p));
9493 In this call, I<entersubop> is a pointer to the C<entersub> op,
9494 which may be replaced by the check function, and I<namegv> is a GV
9495 supplying the name that should be used by the check function to refer
9496 to the callee of the C<entersub> op if it needs to emit any diagnostics.
9497 It is permitted to apply the check function in non-standard situations,
9498 such as to a call to a different subroutine or to a method call.
9500 By default, the function is
9501 L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>,
9502 and the SV parameter is I<cv> itself. This implements standard
9503 prototype processing. It can be changed, for a particular subroutine,
9504 by L</cv_set_call_checker>.
9510 Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p)
9513 PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER;
9514 callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL;
9516 *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr);
9517 *ckobj_p = callmg->mg_obj;
9519 *ckfun_p = Perl_ck_entersub_args_proto_or_list;
9525 =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj
9527 Sets the function that will be used to fix up a call to I<cv>.
9528 Specifically, the function is applied to an C<entersub> op tree for a
9529 subroutine call, not marked with C<&>, where the callee can be identified
9530 at compile time as I<cv>.
9532 The C-level function pointer is supplied in I<ckfun>, and an SV argument
9533 for it is supplied in I<ckobj>. The function is intended to be called
9536 entersubop = ckfun(aTHX_ entersubop, namegv, ckobj);
9538 In this call, I<entersubop> is a pointer to the C<entersub> op,
9539 which may be replaced by the check function, and I<namegv> is a GV
9540 supplying the name that should be used by the check function to refer
9541 to the callee of the C<entersub> op if it needs to emit any diagnostics.
9542 It is permitted to apply the check function in non-standard situations,
9543 such as to a call to a different subroutine or to a method call.
9545 The current setting for a particular CV can be retrieved by
9546 L</cv_get_call_checker>.
9552 Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj)
9554 PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER;
9555 if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) {
9556 if (SvMAGICAL((SV*)cv))
9557 mg_free_type((SV*)cv, PERL_MAGIC_checkcall);
9560 sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0);
9561 callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall);
9562 if (callmg->mg_flags & MGf_REFCOUNTED) {
9563 SvREFCNT_dec(callmg->mg_obj);
9564 callmg->mg_flags &= ~MGf_REFCOUNTED;
9566 callmg->mg_ptr = FPTR2DPTR(char *, ckfun);
9567 callmg->mg_obj = ckobj;
9568 if (ckobj != (SV*)cv) {
9569 SvREFCNT_inc_simple_void_NN(ckobj);
9570 callmg->mg_flags |= MGf_REFCOUNTED;
9576 Perl_ck_subr(pTHX_ OP *o)
9582 PERL_ARGS_ASSERT_CK_SUBR;
9584 aop = cUNOPx(o)->op_first;
9585 if (!aop->op_sibling)
9586 aop = cUNOPx(aop)->op_first;
9587 aop = aop->op_sibling;
9588 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9589 cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY);
9590 namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL;
9592 o->op_private &= ~1;
9593 o->op_private |= OPpENTERSUB_HASTARG;
9594 o->op_private |= (PL_hints & HINT_STRICT_REFS);
9595 if (PERLDB_SUB && PL_curstash != PL_debstash)
9596 o->op_private |= OPpENTERSUB_DB;
9597 if (cvop->op_type == OP_RV2CV) {
9598 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
9600 } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
9601 if (aop->op_type == OP_CONST)
9602 aop->op_private &= ~OPpCONST_STRICT;
9603 else if (aop->op_type == OP_LIST) {
9604 OP * const sib = ((UNOP*)aop)->op_first->op_sibling;
9605 if (sib && sib->op_type == OP_CONST)
9606 sib->op_private &= ~OPpCONST_STRICT;
9611 return ck_entersub_args_list(o);
9613 Perl_call_checker ckfun;
9615 cv_get_call_checker(cv, &ckfun, &ckobj);
9616 return ckfun(aTHX_ o, namegv, ckobj);
9621 Perl_ck_svconst(pTHX_ OP *o)
9623 PERL_ARGS_ASSERT_CK_SVCONST;
9624 PERL_UNUSED_CONTEXT;
9625 SvREADONLY_on(cSVOPo->op_sv);
9630 Perl_ck_chdir(pTHX_ OP *o)
9632 PERL_ARGS_ASSERT_CK_CHDIR;
9633 if (o->op_flags & OPf_KIDS) {
9634 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9636 if (kid && kid->op_type == OP_CONST &&
9637 (kid->op_private & OPpCONST_BARE))
9639 o->op_flags |= OPf_SPECIAL;
9640 kid->op_private &= ~OPpCONST_STRICT;
9647 Perl_ck_trunc(pTHX_ OP *o)
9649 PERL_ARGS_ASSERT_CK_TRUNC;
9651 if (o->op_flags & OPf_KIDS) {
9652 SVOP *kid = (SVOP*)cUNOPo->op_first;
9654 if (kid->op_type == OP_NULL)
9655 kid = (SVOP*)kid->op_sibling;
9656 if (kid && kid->op_type == OP_CONST &&
9657 (kid->op_private & OPpCONST_BARE))
9659 o->op_flags |= OPf_SPECIAL;
9660 kid->op_private &= ~OPpCONST_STRICT;
9667 Perl_ck_substr(pTHX_ OP *o)
9669 PERL_ARGS_ASSERT_CK_SUBSTR;
9672 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
9673 OP *kid = cLISTOPo->op_first;
9675 if (kid->op_type == OP_NULL)
9676 kid = kid->op_sibling;
9678 kid->op_flags |= OPf_MOD;
9685 Perl_ck_tell(pTHX_ OP *o)
9687 PERL_ARGS_ASSERT_CK_TELL;
9689 if (o->op_flags & OPf_KIDS) {
9690 OP *kid = cLISTOPo->op_first;
9691 if (kid->op_type == OP_NULL && kid->op_sibling) kid = kid->op_sibling;
9692 if (kid->op_type == OP_RV2GV) kid->op_private |= OPpALLOW_FAKE;
9698 Perl_ck_each(pTHX_ OP *o)
9701 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
9702 const unsigned orig_type = o->op_type;
9703 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
9704 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
9705 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
9706 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
9708 PERL_ARGS_ASSERT_CK_EACH;
9711 switch (kid->op_type) {
9717 CHANGE_TYPE(o, array_type);
9720 if (kid->op_private == OPpCONST_BARE
9721 || !SvROK(cSVOPx_sv(kid))
9722 || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV
9723 && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV )
9725 /* we let ck_fun handle it */
9728 CHANGE_TYPE(o, ref_type);
9732 /* if treating as a reference, defer additional checks to runtime */
9733 return o->op_type == ref_type ? o : ck_fun(o);
9737 Perl_ck_length(pTHX_ OP *o)
9739 PERL_ARGS_ASSERT_CK_LENGTH;
9743 if (ckWARN(WARN_SYNTAX)) {
9744 const OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
9748 const bool hash = kid->op_type == OP_PADHV
9749 || kid->op_type == OP_RV2HV;
9750 switch (kid->op_type) {
9754 (GV *)PL_compcv, hash ? '%' : '@', kid->op_targ,
9760 if (cUNOPx(kid)->op_first->op_type != OP_GV) break;
9762 GV *gv = cGVOPx_gv(cUNOPx(kid)->op_first);
9764 name = varname(gv, hash?'%':'@', 0, NULL, 0, 1);
9771 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9772 "length() used on %"SVf" (did you mean \"scalar(%s%"SVf
9774 name, hash ? "keys " : "", name
9777 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9778 "length() used on %%hash (did you mean \"scalar(keys %%hash)\"?)");
9780 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
9781 "length() used on @array (did you mean \"scalar(@array)\"?)");
9788 /* caller is supposed to assign the return to the
9789 container of the rep_op var */
9791 S_opt_scalarhv(pTHX_ OP *rep_op) {
9795 PERL_ARGS_ASSERT_OPT_SCALARHV;
9797 NewOp(1101, unop, 1, UNOP);
9798 unop->op_type = (OPCODE)OP_BOOLKEYS;
9799 unop->op_ppaddr = PL_ppaddr[OP_BOOLKEYS];
9800 unop->op_flags = (U8)(OPf_WANT_SCALAR | OPf_KIDS );
9801 unop->op_private = (U8)(1 | ((OPf_WANT_SCALAR | OPf_KIDS) >> 8));
9802 unop->op_first = rep_op;
9803 unop->op_next = rep_op->op_next;
9804 rep_op->op_next = (OP*)unop;
9805 rep_op->op_flags|=(OPf_REF | OPf_MOD);
9806 unop->op_sibling = rep_op->op_sibling;
9807 rep_op->op_sibling = NULL;
9808 /* unop->op_targ = pad_alloc(OP_BOOLKEYS, SVs_PADTMP); */
9809 if (rep_op->op_type == OP_PADHV) {
9810 rep_op->op_flags &= ~OPf_WANT_SCALAR;
9811 rep_op->op_flags |= OPf_WANT_LIST;
9816 /* Check for in place reverse and sort assignments like "@a = reverse @a"
9817 and modify the optree to make them work inplace */
9820 S_inplace_aassign(pTHX_ OP *o) {
9822 OP *modop, *modop_pushmark;
9824 OP *oleft, *oleft_pushmark;
9826 PERL_ARGS_ASSERT_INPLACE_AASSIGN;
9828 assert((o->op_flags & OPf_WANT) == OPf_WANT_VOID);
9830 assert(cUNOPo->op_first->op_type == OP_NULL);
9831 modop_pushmark = cUNOPx(cUNOPo->op_first)->op_first;
9832 assert(modop_pushmark->op_type == OP_PUSHMARK);
9833 modop = modop_pushmark->op_sibling;
9835 if (modop->op_type != OP_SORT && modop->op_type != OP_REVERSE)
9838 /* no other operation except sort/reverse */
9839 if (modop->op_sibling)
9842 assert(cUNOPx(modop)->op_first->op_type == OP_PUSHMARK);
9843 if (!(oright = cUNOPx(modop)->op_first->op_sibling)) return;
9845 if (modop->op_flags & OPf_STACKED) {
9846 /* skip sort subroutine/block */
9847 assert(oright->op_type == OP_NULL);
9848 oright = oright->op_sibling;
9851 assert(cUNOPo->op_first->op_sibling->op_type == OP_NULL);
9852 oleft_pushmark = cUNOPx(cUNOPo->op_first->op_sibling)->op_first;
9853 assert(oleft_pushmark->op_type == OP_PUSHMARK);
9854 oleft = oleft_pushmark->op_sibling;
9856 /* Check the lhs is an array */
9858 (oleft->op_type != OP_RV2AV && oleft->op_type != OP_PADAV)
9859 || oleft->op_sibling
9860 || (oleft->op_private & OPpLVAL_INTRO)
9864 /* Only one thing on the rhs */
9865 if (oright->op_sibling)
9868 /* check the array is the same on both sides */
9869 if (oleft->op_type == OP_RV2AV) {
9870 if (oright->op_type != OP_RV2AV
9871 || !cUNOPx(oright)->op_first
9872 || cUNOPx(oright)->op_first->op_type != OP_GV
9873 || cUNOPx(oleft )->op_first->op_type != OP_GV
9874 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
9875 cGVOPx_gv(cUNOPx(oright)->op_first)
9879 else if (oright->op_type != OP_PADAV
9880 || oright->op_targ != oleft->op_targ
9884 /* This actually is an inplace assignment */
9886 modop->op_private |= OPpSORT_INPLACE;
9888 /* transfer MODishness etc from LHS arg to RHS arg */
9889 oright->op_flags = oleft->op_flags;
9891 /* remove the aassign op and the lhs */
9893 op_null(oleft_pushmark);
9894 if (oleft->op_type == OP_RV2AV && cUNOPx(oleft)->op_first)
9895 op_null(cUNOPx(oleft)->op_first);
9899 #define MAX_DEFERRED 4
9902 if (defer_ix == (MAX_DEFERRED-1)) { \
9903 CALL_RPEEP(defer_queue[defer_base]); \
9904 defer_base = (defer_base + 1) % MAX_DEFERRED; \
9907 defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o;
9909 /* A peephole optimizer. We visit the ops in the order they're to execute.
9910 * See the comments at the top of this file for more details about when
9911 * peep() is called */
9914 Perl_rpeep(pTHX_ register OP *o)
9917 register OP* oldop = NULL;
9918 OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */
9922 if (!o || o->op_opt)
9926 SAVEVPTR(PL_curcop);
9927 for (;; o = o->op_next) {
9931 while (defer_ix >= 0)
9932 CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]);
9936 /* By default, this op has now been optimised. A couple of cases below
9937 clear this again. */
9940 switch (o->op_type) {
9942 PL_curcop = ((COP*)o); /* for warnings */
9945 PL_curcop = ((COP*)o); /* for warnings */
9947 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
9948 to carry two labels. For now, take the easier option, and skip
9949 this optimisation if the first NEXTSTATE has a label. */
9950 if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) {
9951 OP *nextop = o->op_next;
9952 while (nextop && nextop->op_type == OP_NULL)
9953 nextop = nextop->op_next;
9955 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
9956 COP *firstcop = (COP *)o;
9957 COP *secondcop = (COP *)nextop;
9958 /* We want the COP pointed to by o (and anything else) to
9959 become the next COP down the line. */
9962 firstcop->op_next = secondcop->op_next;
9964 /* Now steal all its pointers, and duplicate the other
9966 firstcop->cop_line = secondcop->cop_line;
9968 firstcop->cop_stashpv = secondcop->cop_stashpv;
9969 firstcop->cop_file = secondcop->cop_file;
9971 firstcop->cop_stash = secondcop->cop_stash;
9972 firstcop->cop_filegv = secondcop->cop_filegv;
9974 firstcop->cop_hints = secondcop->cop_hints;
9975 firstcop->cop_seq = secondcop->cop_seq;
9976 firstcop->cop_warnings = secondcop->cop_warnings;
9977 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
9980 secondcop->cop_stashpv = NULL;
9981 secondcop->cop_file = NULL;
9983 secondcop->cop_stash = NULL;
9984 secondcop->cop_filegv = NULL;
9986 secondcop->cop_warnings = NULL;
9987 secondcop->cop_hints_hash = NULL;
9989 /* If we use op_null(), and hence leave an ex-COP, some
9990 warnings are misreported. For example, the compile-time
9991 error in 'use strict; no strict refs;' */
9992 secondcop->op_type = OP_NULL;
9993 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
9999 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
10000 if (o->op_next->op_private & OPpTARGET_MY) {
10001 if (o->op_flags & OPf_STACKED) /* chained concats */
10002 break; /* ignore_optimization */
10004 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
10005 o->op_targ = o->op_next->op_targ;
10006 o->op_next->op_targ = 0;
10007 o->op_private |= OPpTARGET_MY;
10010 op_null(o->op_next);
10014 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
10015 break; /* Scalar stub must produce undef. List stub is noop */
10019 if (o->op_targ == OP_NEXTSTATE
10020 || o->op_targ == OP_DBSTATE)
10022 PL_curcop = ((COP*)o);
10024 /* XXX: We avoid setting op_seq here to prevent later calls
10025 to rpeep() from mistakenly concluding that optimisation
10026 has already occurred. This doesn't fix the real problem,
10027 though (See 20010220.007). AMS 20010719 */
10028 /* op_seq functionality is now replaced by op_opt */
10035 if (oldop && o->op_next) {
10036 oldop->op_next = o->op_next;
10044 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
10045 OP* const pop = (o->op_type == OP_PADAV) ?
10046 o->op_next : o->op_next->op_next;
10048 if (pop && pop->op_type == OP_CONST &&
10049 ((PL_op = pop->op_next)) &&
10050 pop->op_next->op_type == OP_AELEM &&
10051 !(pop->op_next->op_private &
10052 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
10053 (i = SvIV(((SVOP*)pop)->op_sv)) <= 255 && i >= 0)
10056 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
10057 no_bareword_allowed(pop);
10058 if (o->op_type == OP_GV)
10059 op_null(o->op_next);
10060 op_null(pop->op_next);
10062 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
10063 o->op_next = pop->op_next->op_next;
10064 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
10065 o->op_private = (U8)i;
10066 if (o->op_type == OP_GV) {
10069 o->op_type = OP_AELEMFAST;
10072 o->op_type = OP_AELEMFAST_LEX;
10077 if (o->op_next->op_type == OP_RV2SV) {
10078 if (!(o->op_next->op_private & OPpDEREF)) {
10079 op_null(o->op_next);
10080 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
10082 o->op_next = o->op_next->op_next;
10083 o->op_type = OP_GVSV;
10084 o->op_ppaddr = PL_ppaddr[OP_GVSV];
10087 else if (o->op_next->op_type == OP_READLINE
10088 && o->op_next->op_next->op_type == OP_CONCAT
10089 && (o->op_next->op_next->op_flags & OPf_STACKED))
10091 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
10092 o->op_type = OP_RCATLINE;
10093 o->op_flags |= OPf_STACKED;
10094 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
10095 op_null(o->op_next->op_next);
10096 op_null(o->op_next);
10106 fop = cUNOP->op_first;
10114 fop = cLOGOP->op_first;
10115 sop = fop->op_sibling;
10116 while (cLOGOP->op_other->op_type == OP_NULL)
10117 cLOGOP->op_other = cLOGOP->op_other->op_next;
10118 while (o->op_next && ( o->op_type == o->op_next->op_type
10119 || o->op_next->op_type == OP_NULL))
10120 o->op_next = o->op_next->op_next;
10121 DEFER(cLOGOP->op_other);
10125 if ((fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
10127 (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV)
10132 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
10133 while (nop && nop->op_next) {
10134 switch (nop->op_next->op_type) {
10139 lop = nop = nop->op_next;
10142 nop = nop->op_next;
10150 if ((lop->op_flags & OPf_WANT) == OPf_WANT_VOID) {
10151 if (fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
10152 cLOGOP->op_first = opt_scalarhv(fop);
10153 if (sop && (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV))
10154 cLOGOP->op_first->op_sibling = opt_scalarhv(sop);
10170 while (cLOGOP->op_other->op_type == OP_NULL)
10171 cLOGOP->op_other = cLOGOP->op_other->op_next;
10172 DEFER(cLOGOP->op_other);
10177 while (cLOOP->op_redoop->op_type == OP_NULL)
10178 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
10179 while (cLOOP->op_nextop->op_type == OP_NULL)
10180 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
10181 while (cLOOP->op_lastop->op_type == OP_NULL)
10182 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
10183 /* a while(1) loop doesn't have an op_next that escapes the
10184 * loop, so we have to explicitly follow the op_lastop to
10185 * process the rest of the code */
10186 DEFER(cLOOP->op_lastop);
10190 assert(!(cPMOP->op_pmflags & PMf_ONCE));
10191 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
10192 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
10193 cPMOP->op_pmstashstartu.op_pmreplstart
10194 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
10195 DEFER(cPMOP->op_pmstashstartu.op_pmreplstart);
10199 /* check that RHS of sort is a single plain array */
10200 OP *oright = cUNOPo->op_first;
10201 if (!oright || oright->op_type != OP_PUSHMARK)
10204 if (o->op_private & OPpSORT_INPLACE)
10207 /* reverse sort ... can be optimised. */
10208 if (!cUNOPo->op_sibling) {
10209 /* Nothing follows us on the list. */
10210 OP * const reverse = o->op_next;
10212 if (reverse->op_type == OP_REVERSE &&
10213 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
10214 OP * const pushmark = cUNOPx(reverse)->op_first;
10215 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
10216 && (cUNOPx(pushmark)->op_sibling == o)) {
10217 /* reverse -> pushmark -> sort */
10218 o->op_private |= OPpSORT_REVERSE;
10220 pushmark->op_next = oright->op_next;
10230 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
10232 LISTOP *enter, *exlist;
10234 if (o->op_private & OPpSORT_INPLACE)
10237 enter = (LISTOP *) o->op_next;
10240 if (enter->op_type == OP_NULL) {
10241 enter = (LISTOP *) enter->op_next;
10245 /* for $a (...) will have OP_GV then OP_RV2GV here.
10246 for (...) just has an OP_GV. */
10247 if (enter->op_type == OP_GV) {
10248 gvop = (OP *) enter;
10249 enter = (LISTOP *) enter->op_next;
10252 if (enter->op_type == OP_RV2GV) {
10253 enter = (LISTOP *) enter->op_next;
10259 if (enter->op_type != OP_ENTERITER)
10262 iter = enter->op_next;
10263 if (!iter || iter->op_type != OP_ITER)
10266 expushmark = enter->op_first;
10267 if (!expushmark || expushmark->op_type != OP_NULL
10268 || expushmark->op_targ != OP_PUSHMARK)
10271 exlist = (LISTOP *) expushmark->op_sibling;
10272 if (!exlist || exlist->op_type != OP_NULL
10273 || exlist->op_targ != OP_LIST)
10276 if (exlist->op_last != o) {
10277 /* Mmm. Was expecting to point back to this op. */
10280 theirmark = exlist->op_first;
10281 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
10284 if (theirmark->op_sibling != o) {
10285 /* There's something between the mark and the reverse, eg
10286 for (1, reverse (...))
10291 ourmark = ((LISTOP *)o)->op_first;
10292 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
10295 ourlast = ((LISTOP *)o)->op_last;
10296 if (!ourlast || ourlast->op_next != o)
10299 rv2av = ourmark->op_sibling;
10300 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
10301 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
10302 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
10303 /* We're just reversing a single array. */
10304 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
10305 enter->op_flags |= OPf_STACKED;
10308 /* We don't have control over who points to theirmark, so sacrifice
10310 theirmark->op_next = ourmark->op_next;
10311 theirmark->op_flags = ourmark->op_flags;
10312 ourlast->op_next = gvop ? gvop : (OP *) enter;
10315 enter->op_private |= OPpITER_REVERSED;
10316 iter->op_private |= OPpITER_REVERSED;
10323 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
10324 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
10329 if (!(o->op_private & OPpOFFBYONE) && !CvCLONE(PL_compcv)) {
10331 if (CvUNIQUE(PL_compcv)) sv = &PL_sv_undef;
10333 sv = newRV((SV *)PL_compcv);
10337 o->op_type = OP_CONST;
10338 o->op_ppaddr = PL_ppaddr[OP_CONST];
10339 o->op_flags |= OPf_SPECIAL;
10340 cSVOPo->op_sv = sv;
10345 if (OP_GIMME(o,0) == G_VOID) {
10346 OP *right = cBINOP->op_first;
10348 OP *left = right->op_sibling;
10349 if (left->op_type == OP_SUBSTR
10350 && (left->op_private & 7) < 4) {
10352 cBINOP->op_first = left;
10353 right->op_sibling =
10354 cBINOPx(left)->op_first->op_sibling;
10355 cBINOPx(left)->op_first->op_sibling = right;
10356 left->op_private |= OPpSUBSTR_REPL_FIRST;
10358 (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
10365 Perl_cpeep_t cpeep =
10366 XopENTRY(Perl_custom_op_xop(aTHX_ o), xop_peep);
10368 cpeep(aTHX_ o, oldop);
10379 Perl_peep(pTHX_ register OP *o)
10385 =head1 Custom Operators
10387 =for apidoc Ao||custom_op_xop
10388 Return the XOP structure for a given custom op. This function should be
10389 considered internal to OP_NAME and the other access macros: use them instead.
10395 Perl_custom_op_xop(pTHX_ const OP *o)
10401 static const XOP xop_null = { 0, 0, 0, 0, 0 };
10403 PERL_ARGS_ASSERT_CUSTOM_OP_XOP;
10404 assert(o->op_type == OP_CUSTOM);
10406 /* This is wrong. It assumes a function pointer can be cast to IV,
10407 * which isn't guaranteed, but this is what the old custom OP code
10408 * did. In principle it should be safer to Copy the bytes of the
10409 * pointer into a PV: since the new interface is hidden behind
10410 * functions, this can be changed later if necessary. */
10411 /* Change custom_op_xop if this ever happens */
10412 keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr)));
10415 he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0);
10417 /* assume noone will have just registered a desc */
10418 if (!he && PL_custom_op_names &&
10419 (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0))
10424 /* XXX does all this need to be shared mem? */
10425 Newxz(xop, 1, XOP);
10426 pv = SvPV(HeVAL(he), l);
10427 XopENTRY_set(xop, xop_name, savepvn(pv, l));
10428 if (PL_custom_op_descs &&
10429 (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0))
10431 pv = SvPV(HeVAL(he), l);
10432 XopENTRY_set(xop, xop_desc, savepvn(pv, l));
10434 Perl_custom_op_register(aTHX_ o->op_ppaddr, xop);
10438 if (!he) return &xop_null;
10440 xop = INT2PTR(XOP *, SvIV(HeVAL(he)));
10445 =for apidoc Ao||custom_op_register
10446 Register a custom op. See L<perlguts/"Custom Operators">.
10452 Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop)
10456 PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER;
10458 /* see the comment in custom_op_xop */
10459 keysv = sv_2mortal(newSViv(PTR2IV(ppaddr)));
10461 if (!PL_custom_ops)
10462 PL_custom_ops = newHV();
10464 if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0))
10465 Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name);
10469 =head1 Functions in file op.c
10471 =for apidoc core_prototype
10472 This function assigns the prototype of the named core function to C<sv>, or
10473 to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or
10474 NULL if the core function has no prototype. C<code> is a code as returned
10475 by C<keyword()>. It must be negative and unequal to -KEY_CORE.
10481 Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code,
10484 int i = 0, n = 0, seen_question = 0, defgv = 0;
10486 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
10487 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
10488 bool nullret = FALSE;
10490 PERL_ARGS_ASSERT_CORE_PROTOTYPE;
10492 assert (code < 0 && code != -KEY_CORE);
10494 if (!sv) sv = sv_newmortal();
10496 #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv
10499 case KEY_and : case KEY_chop: case KEY_chomp:
10500 case KEY_cmp : case KEY_exec: case KEY_eq :
10501 case KEY_ge : case KEY_gt : case KEY_le :
10502 case KEY_lt : case KEY_ne : case KEY_or :
10503 case KEY_select: case KEY_system: case KEY_x : case KEY_xor:
10504 if (!opnum) return NULL; nullret = TRUE; goto findopnum;
10505 case KEY_keys: retsetpvs("+", OP_KEYS);
10506 case KEY_values: retsetpvs("+", OP_VALUES);
10507 case KEY_each: retsetpvs("+", OP_EACH);
10508 case KEY_push: retsetpvs("+@", OP_PUSH);
10509 case KEY_unshift: retsetpvs("+@", OP_UNSHIFT);
10510 case KEY_pop: retsetpvs(";+", OP_POP);
10511 case KEY_shift: retsetpvs(";+", OP_SHIFT);
10513 retsetpvs("+;$$@", OP_SPLICE);
10514 case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__:
10516 case KEY_evalbytes:
10517 name = "entereval"; break;
10525 while (i < MAXO) { /* The slow way. */
10526 if (strEQ(name, PL_op_name[i])
10527 || strEQ(name, PL_op_desc[i]))
10529 if (nullret) { assert(opnum); *opnum = i; return NULL; }
10534 assert(0); return NULL; /* Should not happen... */
10536 defgv = PL_opargs[i] & OA_DEFGV;
10537 oa = PL_opargs[i] >> OASHIFT;
10539 if (oa & OA_OPTIONAL && !seen_question && (
10540 !defgv || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF
10545 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
10546 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
10547 /* But globs are already references (kinda) */
10548 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
10552 if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF
10553 && !scalar_mod_type(NULL, i)) {
10558 if (i == OP_LOCK) str[n++] = '&';
10562 else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
10563 if (oa & OA_OPTIONAL && defgv && str[n-1] == '$') {
10564 str[n-1] = '_'; defgv = 0;
10568 if (code == -KEY_not || code == -KEY_getprotobynumber) str[n++] = ';';
10570 sv_setpvn(sv, str, n - 1);
10571 if (opnum) *opnum = i;
10576 Perl_coresub_op(pTHX_ SV * const coreargssv, const int code,
10579 OP * const argop = newSVOP(OP_COREARGS,0,coreargssv);
10582 PERL_ARGS_ASSERT_CORESUB_OP;
10586 return op_append_elem(OP_LINESEQ,
10589 newSVOP(OP_CONST, 0, newSViv(-code % 3)),
10593 case OP_SELECT: /* which represents OP_SSELECT as well */
10598 newAVREF(newGVOP(OP_GV, 0, PL_defgv)),
10599 newSVOP(OP_CONST, 0, newSVuv(1))
10601 coresub_op(newSVuv((UV)OP_SSELECT), 0,
10603 coresub_op(coreargssv, 0, OP_SELECT)
10607 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
10609 return op_append_elem(
10612 opnum == OP_WANTARRAY || opnum == OP_RUNCV
10613 ? OPpOFFBYONE << 8 : 0)
10615 case OA_BASEOP_OR_UNOP:
10616 if (opnum == OP_ENTEREVAL) {
10617 o = newUNOP(OP_ENTEREVAL,OPpEVAL_COPHH<<8,argop);
10618 if (code == -KEY_evalbytes) o->op_private |= OPpEVAL_BYTES;
10620 else o = newUNOP(opnum,0,argop);
10621 if (opnum == OP_CALLER) o->op_private |= OPpOFFBYONE;
10624 if (is_handle_constructor(o, 1))
10625 argop->op_private |= OPpCOREARGS_DEREF1;
10629 o = convert(opnum,0,argop);
10630 if (is_handle_constructor(o, 2))
10631 argop->op_private |= OPpCOREARGS_DEREF2;
10632 if (scalar_mod_type(NULL, opnum))
10633 argop->op_private |= OPpCOREARGS_SCALARMOD;
10634 if (opnum == OP_SUBSTR) {
10635 o->op_private |= OPpMAYBE_LVSUB;
10644 Perl_report_redefined_cv(pTHX_ const SV *name, const CV *old_cv,
10645 SV * const *new_const_svp)
10647 const char *hvname;
10648 bool is_const = !!CvCONST(old_cv);
10649 SV *old_const_sv = is_const ? cv_const_sv(old_cv) : NULL;
10651 PERL_ARGS_ASSERT_REPORT_REDEFINED_CV;
10653 if (is_const && new_const_svp && old_const_sv == *new_const_svp)
10655 /* They are 2 constant subroutines generated from
10656 the same constant. This probably means that
10657 they are really the "same" proxy subroutine
10658 instantiated in 2 places. Most likely this is
10659 when a constant is exported twice. Don't warn.
10662 (ckWARN(WARN_REDEFINE)
10664 CvGV(old_cv) && GvSTASH(CvGV(old_cv))
10665 && HvNAMELEN(GvSTASH(CvGV(old_cv))) == 7
10666 && (hvname = HvNAME(GvSTASH(CvGV(old_cv))),
10667 strEQ(hvname, "autouse"))
10671 && ckWARN_d(WARN_REDEFINE)
10672 && (!new_const_svp || sv_cmp(old_const_sv, *new_const_svp))
10675 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
10677 ? "Constant subroutine %"SVf" redefined"
10678 : "Subroutine %"SVf" redefined",
10684 /* Efficient sub that returns a constant scalar value. */
10686 const_sv_xsub(pTHX_ CV* cv)
10690 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
10694 /* diag_listed_as: SKIPME */
10695 Perl_croak(aTHX_ "usage: %s::%s()",
10696 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
10709 * c-indentation-style: bsd
10710 * c-basic-offset: 4
10711 * indent-tabs-mode: t
10714 * ex: set ts=8 sts=4 sw=4 noet: