4 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
5 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
7 * You may distribute under the terms of either the GNU General Public
8 * License or the Artistic License, as specified in the README file.
13 * 'You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
14 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
15 * youngest of the Old Took's daughters); and Mr. Drogo was his second
16 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
17 * either way, as the saying is, if you follow me.' --the Gaffer
19 * [p.23 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
22 /* This file contains the functions that create, manipulate and optimize
23 * the OP structures that hold a compiled perl program.
25 * A Perl program is compiled into a tree of OPs. Each op contains
26 * structural pointers (eg to its siblings and the next op in the
27 * execution sequence), a pointer to the function that would execute the
28 * op, plus any data specific to that op. For example, an OP_CONST op
29 * points to the pp_const() function and to an SV containing the constant
30 * value. When pp_const() is executed, its job is to push that SV onto the
33 * OPs are mainly created by the newFOO() functions, which are mainly
34 * called from the parser (in perly.y) as the code is parsed. For example
35 * the Perl code $a + $b * $c would cause the equivalent of the following
36 * to be called (oversimplifying a bit):
38 * newBINOP(OP_ADD, flags,
40 * newBINOP(OP_MULTIPLY, flags, newSVREF($b), newSVREF($c))
43 * Note that during the build of miniperl, a temporary copy of this file
44 * is made, called opmini.c.
48 Perl's compiler is essentially a 3-pass compiler with interleaved phases:
52 An execution-order pass
54 The bottom-up pass is represented by all the "newOP" routines and
55 the ck_ routines. The bottom-upness is actually driven by yacc.
56 So at the point that a ck_ routine fires, we have no idea what the
57 context is, either upward in the syntax tree, or either forward or
58 backward in the execution order. (The bottom-up parser builds that
59 part of the execution order it knows about, but if you follow the "next"
60 links around, you'll find it's actually a closed loop through the
63 Whenever the bottom-up parser gets to a node that supplies context to
64 its components, it invokes that portion of the top-down pass that applies
65 to that part of the subtree (and marks the top node as processed, so
66 if a node further up supplies context, it doesn't have to take the
67 plunge again). As a particular subcase of this, as the new node is
68 built, it takes all the closed execution loops of its subcomponents
69 and links them into a new closed loop for the higher level node. But
70 it's still not the real execution order.
72 The actual execution order is not known till we get a grammar reduction
73 to a top-level unit like a subroutine or file that will be called by
74 "name" rather than via a "next" pointer. At that point, we can call
75 into peep() to do that code's portion of the 3rd pass. It has to be
76 recursive, but it's recursive on basic blocks, not on tree nodes.
79 /* To implement user lexical pragmas, there needs to be a way at run time to
80 get the compile time state of %^H for that block. Storing %^H in every
81 block (or even COP) would be very expensive, so a different approach is
82 taken. The (running) state of %^H is serialised into a tree of HE-like
83 structs. Stores into %^H are chained onto the current leaf as a struct
84 refcounted_he * with the key and the value. Deletes from %^H are saved
85 with a value of PL_sv_placeholder. The state of %^H at any point can be
86 turned back into a regular HV by walking back up the tree from that point's
87 leaf, ignoring any key you've already seen (placeholder or not), storing
88 the rest into the HV structure, then removing the placeholders. Hence
89 memory is only used to store the %^H deltas from the enclosing COP, rather
90 than the entire %^H on each COP.
92 To cause actions on %^H to write out the serialisation records, it has
93 magic type 'H'. This magic (itself) does nothing, but its presence causes
94 the values to gain magic type 'h', which has entries for set and clear.
95 C<Perl_magic_sethint> updates C<PL_compiling.cop_hints_hash> with a store
96 record, with deletes written by C<Perl_magic_clearhint>. C<SAVEHINTS>
97 saves the current C<PL_compiling.cop_hints_hash> on the save stack, so that
98 it will be correctly restored when any inner compiling scope is exited.
104 #include "keywords.h"
106 #define CALL_PEEP(o) PL_peepp(aTHX_ o)
107 #define CALL_RPEEP(o) PL_rpeepp(aTHX_ o)
108 #define CALL_OPFREEHOOK(o) if (PL_opfreehook) PL_opfreehook(aTHX_ o)
110 #if defined(PL_OP_SLAB_ALLOC)
112 #ifdef PERL_DEBUG_READONLY_OPS
113 # define PERL_SLAB_SIZE 4096
114 # include <sys/mman.h>
117 #ifndef PERL_SLAB_SIZE
118 #define PERL_SLAB_SIZE 2048
122 Perl_Slab_Alloc(pTHX_ size_t sz)
126 * To make incrementing use count easy PL_OpSlab is an I32 *
127 * To make inserting the link to slab PL_OpPtr is I32 **
128 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
129 * Add an overhead for pointer to slab and round up as a number of pointers
131 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
132 if ((PL_OpSpace -= sz) < 0) {
133 #ifdef PERL_DEBUG_READONLY_OPS
134 /* We need to allocate chunk by chunk so that we can control the VM
136 PL_OpPtr = (I32**) mmap(0, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE,
137 MAP_ANON|MAP_PRIVATE, -1, 0);
139 DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n",
140 (unsigned long) PERL_SLAB_SIZE*sizeof(I32*),
142 if(PL_OpPtr == MAP_FAILED) {
143 perror("mmap failed");
148 PL_OpPtr = (I32 **) PerlMemShared_calloc(PERL_SLAB_SIZE,sizeof(I32*));
153 /* We reserve the 0'th I32 sized chunk as a use count */
154 PL_OpSlab = (I32 *) PL_OpPtr;
155 /* Reduce size by the use count word, and by the size we need.
156 * Latter is to mimic the '-=' in the if() above
158 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
159 /* Allocation pointer starts at the top.
160 Theory: because we build leaves before trunk allocating at end
161 means that at run time access is cache friendly upward
163 PL_OpPtr += PERL_SLAB_SIZE;
165 #ifdef PERL_DEBUG_READONLY_OPS
166 /* We remember this slab. */
167 /* This implementation isn't efficient, but it is simple. */
168 PL_slabs = (I32**) realloc(PL_slabs, sizeof(I32**) * (PL_slab_count + 1));
169 PL_slabs[PL_slab_count++] = PL_OpSlab;
170 DEBUG_m(PerlIO_printf(Perl_debug_log, "Allocate %p\n", PL_OpSlab));
173 assert( PL_OpSpace >= 0 );
174 /* Move the allocation pointer down */
176 assert( PL_OpPtr > (I32 **) PL_OpSlab );
177 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
178 (*PL_OpSlab)++; /* Increment use count of slab */
179 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
180 assert( *PL_OpSlab > 0 );
181 return (void *)(PL_OpPtr + 1);
184 #ifdef PERL_DEBUG_READONLY_OPS
186 Perl_pending_Slabs_to_ro(pTHX) {
187 /* Turn all the allocated op slabs read only. */
188 U32 count = PL_slab_count;
189 I32 **const slabs = PL_slabs;
191 /* Reset the array of pending OP slabs, as we're about to turn this lot
192 read only. Also, do it ahead of the loop in case the warn triggers,
193 and a warn handler has an eval */
198 /* Force a new slab for any further allocation. */
202 void *const start = slabs[count];
203 const size_t size = PERL_SLAB_SIZE* sizeof(I32*);
204 if(mprotect(start, size, PROT_READ)) {
205 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d",
206 start, (unsigned long) size, errno);
214 S_Slab_to_rw(pTHX_ void *op)
216 I32 * const * const ptr = (I32 **) op;
217 I32 * const slab = ptr[-1];
219 PERL_ARGS_ASSERT_SLAB_TO_RW;
221 assert( ptr-1 > (I32 **) slab );
222 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
224 if(mprotect(slab, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE)) {
225 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d",
226 slab, (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), errno);
231 Perl_op_refcnt_inc(pTHX_ OP *o)
242 Perl_op_refcnt_dec(pTHX_ OP *o)
244 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
249 # define Slab_to_rw(op)
253 Perl_Slab_Free(pTHX_ void *op)
255 I32 * const * const ptr = (I32 **) op;
256 I32 * const slab = ptr[-1];
257 PERL_ARGS_ASSERT_SLAB_FREE;
258 assert( ptr-1 > (I32 **) slab );
259 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
262 if (--(*slab) == 0) {
264 # define PerlMemShared PerlMem
267 #ifdef PERL_DEBUG_READONLY_OPS
268 U32 count = PL_slab_count;
269 /* Need to remove this slab from our list of slabs */
272 if (PL_slabs[count] == slab) {
274 /* Found it. Move the entry at the end to overwrite it. */
275 DEBUG_m(PerlIO_printf(Perl_debug_log,
276 "Deallocate %p by moving %p from %lu to %lu\n",
278 PL_slabs[PL_slab_count - 1],
279 PL_slab_count, count));
280 PL_slabs[count] = PL_slabs[--PL_slab_count];
281 /* Could realloc smaller at this point, but probably not
283 if(munmap(slab, PERL_SLAB_SIZE*sizeof(I32*))) {
284 perror("munmap failed");
292 PerlMemShared_free(slab);
294 if (slab == PL_OpSlab) {
301 * In the following definition, the ", (OP*)0" is just to make the compiler
302 * think the expression is of the right type: croak actually does a Siglongjmp.
304 #define CHECKOP(type,o) \
305 ((PL_op_mask && PL_op_mask[type]) \
306 ? ( op_free((OP*)o), \
307 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
309 : PL_check[type](aTHX_ (OP*)o))
311 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
313 #define CHANGE_TYPE(o,type) \
315 o->op_type = (OPCODE)type; \
316 o->op_ppaddr = PL_ppaddr[type]; \
320 S_gv_ename(pTHX_ GV *gv)
322 SV* const tmpsv = sv_newmortal();
324 PERL_ARGS_ASSERT_GV_ENAME;
326 gv_efullname3(tmpsv, gv, NULL);
327 return SvPV_nolen_const(tmpsv);
331 S_no_fh_allowed(pTHX_ OP *o)
333 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
335 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
341 S_too_few_arguments(pTHX_ OP *o, const char *name)
343 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS;
345 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
350 S_too_many_arguments(pTHX_ OP *o, const char *name)
352 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS;
354 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
359 S_bad_type(pTHX_ I32 n, const char *t, const char *name, const OP *kid)
361 PERL_ARGS_ASSERT_BAD_TYPE;
363 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
364 (int)n, name, t, OP_DESC(kid)));
368 S_no_bareword_allowed(pTHX_ OP *o)
370 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
373 return; /* various ok barewords are hidden in extra OP_NULL */
374 qerror(Perl_mess(aTHX_
375 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
377 o->op_private &= ~OPpCONST_STRICT; /* prevent warning twice about the same OP */
380 /* "register" allocation */
383 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
387 const bool is_our = (PL_parser->in_my == KEY_our);
389 PERL_ARGS_ASSERT_ALLOCMY;
391 if (flags & ~SVf_UTF8)
392 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
395 /* Until we're using the length for real, cross check that we're being
397 assert(strlen(name) == len);
399 /* complain about "my $<special_var>" etc etc */
403 ((flags & SVf_UTF8) && UTF8_IS_START(name[1])) ||
404 (name[1] == '_' && (*name == '$' || len > 2))))
406 /* name[2] is true if strlen(name) > 2 */
407 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
408 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
409 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
410 PL_parser->in_my == KEY_state ? "state" : "my"));
412 yyerror(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
413 PL_parser->in_my == KEY_state ? "state" : "my"));
417 /* allocate a spare slot and store the name in that slot */
419 off = pad_add_name_pvn(name, len,
420 (is_our ? padadd_OUR :
421 PL_parser->in_my == KEY_state ? padadd_STATE : 0)
422 | ( flags & SVf_UTF8 ? SVf_UTF8 : 0 ),
423 PL_parser->in_my_stash,
425 /* $_ is always in main::, even with our */
426 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
430 /* anon sub prototypes contains state vars should always be cloned,
431 * otherwise the state var would be shared between anon subs */
433 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
434 CvCLONE_on(PL_compcv);
439 /* free the body of an op without examining its contents.
440 * Always use this rather than FreeOp directly */
443 S_op_destroy(pTHX_ OP *o)
445 if (o->op_latefree) {
453 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b)
455 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a)
461 Perl_op_free(pTHX_ OP *o)
468 if (o->op_latefreed) {
475 if (o->op_private & OPpREFCOUNTED) {
486 refcnt = OpREFCNT_dec(o);
489 /* Need to find and remove any pattern match ops from the list
490 we maintain for reset(). */
491 find_and_forget_pmops(o);
501 /* Call the op_free hook if it has been set. Do it now so that it's called
502 * at the right time for refcounted ops, but still before all of the kids
506 if (o->op_flags & OPf_KIDS) {
507 register OP *kid, *nextkid;
508 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
509 nextkid = kid->op_sibling; /* Get before next freeing kid */
514 #ifdef PERL_DEBUG_READONLY_OPS
518 /* COP* is not cleared by op_clear() so that we may track line
519 * numbers etc even after null() */
520 if (type == OP_NEXTSTATE || type == OP_DBSTATE
521 || (type == OP_NULL /* the COP might have been null'ed */
522 && ((OPCODE)o->op_targ == OP_NEXTSTATE
523 || (OPCODE)o->op_targ == OP_DBSTATE))) {
528 type = (OPCODE)o->op_targ;
531 if (o->op_latefree) {
537 #ifdef DEBUG_LEAKING_SCALARS
544 Perl_op_clear(pTHX_ OP *o)
549 PERL_ARGS_ASSERT_OP_CLEAR;
552 mad_free(o->op_madprop);
557 switch (o->op_type) {
558 case OP_NULL: /* Was holding old type, if any. */
559 if (PL_madskills && o->op_targ != OP_NULL) {
560 o->op_type = (Optype)o->op_targ;
565 case OP_ENTEREVAL: /* Was holding hints. */
569 if (!(o->op_flags & OPf_REF)
570 || (PL_check[o->op_type] != Perl_ck_ftst))
577 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
582 /* It's possible during global destruction that the GV is freed
583 before the optree. Whilst the SvREFCNT_inc is happy to bump from
584 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0
585 will trigger an assertion failure, because the entry to sv_clear
586 checks that the scalar is not already freed. A check of for
587 !SvIS_FREED(gv) turns out to be invalid, because during global
588 destruction the reference count can be forced down to zero
589 (with SVf_BREAK set). In which case raising to 1 and then
590 dropping to 0 triggers cleanup before it should happen. I
591 *think* that this might actually be a general, systematic,
592 weakness of the whole idea of SVf_BREAK, in that code *is*
593 allowed to raise and lower references during global destruction,
594 so any *valid* code that happens to do this during global
595 destruction might well trigger premature cleanup. */
596 bool still_valid = gv && SvREFCNT(gv);
599 SvREFCNT_inc_simple_void(gv);
601 if (cPADOPo->op_padix > 0) {
602 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
603 * may still exist on the pad */
604 pad_swipe(cPADOPo->op_padix, TRUE);
605 cPADOPo->op_padix = 0;
608 SvREFCNT_dec(cSVOPo->op_sv);
609 cSVOPo->op_sv = NULL;
612 int try_downgrade = SvREFCNT(gv) == 2;
615 gv_try_downgrade(gv);
619 case OP_METHOD_NAMED:
622 SvREFCNT_dec(cSVOPo->op_sv);
623 cSVOPo->op_sv = NULL;
626 Even if op_clear does a pad_free for the target of the op,
627 pad_free doesn't actually remove the sv that exists in the pad;
628 instead it lives on. This results in that it could be reused as
629 a target later on when the pad was reallocated.
632 pad_swipe(o->op_targ,1);
641 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
646 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
648 if (cPADOPo->op_padix > 0) {
649 pad_swipe(cPADOPo->op_padix, TRUE);
650 cPADOPo->op_padix = 0;
653 SvREFCNT_dec(cSVOPo->op_sv);
654 cSVOPo->op_sv = NULL;
658 PerlMemShared_free(cPVOPo->op_pv);
659 cPVOPo->op_pv = NULL;
663 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
667 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
668 /* No GvIN_PAD_off here, because other references may still
669 * exist on the pad */
670 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
673 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
679 forget_pmop(cPMOPo, 1);
680 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
681 /* we use the same protection as the "SAFE" version of the PM_ macros
682 * here since sv_clean_all might release some PMOPs
683 * after PL_regex_padav has been cleared
684 * and the clearing of PL_regex_padav needs to
685 * happen before sv_clean_all
688 if(PL_regex_pad) { /* We could be in destruction */
689 const IV offset = (cPMOPo)->op_pmoffset;
690 ReREFCNT_dec(PM_GETRE(cPMOPo));
691 PL_regex_pad[offset] = &PL_sv_undef;
692 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
696 ReREFCNT_dec(PM_GETRE(cPMOPo));
697 PM_SETRE(cPMOPo, NULL);
703 if (o->op_targ > 0) {
704 pad_free(o->op_targ);
710 S_cop_free(pTHX_ COP* cop)
712 PERL_ARGS_ASSERT_COP_FREE;
716 if (! specialWARN(cop->cop_warnings))
717 PerlMemShared_free(cop->cop_warnings);
718 cophh_free(CopHINTHASH_get(cop));
722 S_forget_pmop(pTHX_ PMOP *const o
728 HV * const pmstash = PmopSTASH(o);
730 PERL_ARGS_ASSERT_FORGET_PMOP;
732 if (pmstash && !SvIS_FREED(pmstash)) {
733 MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab);
735 PMOP **const array = (PMOP**) mg->mg_ptr;
736 U32 count = mg->mg_len / sizeof(PMOP**);
741 /* Found it. Move the entry at the end to overwrite it. */
742 array[i] = array[--count];
743 mg->mg_len = count * sizeof(PMOP**);
744 /* Could realloc smaller at this point always, but probably
745 not worth it. Probably worth free()ing if we're the
748 Safefree(mg->mg_ptr);
765 S_find_and_forget_pmops(pTHX_ OP *o)
767 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
769 if (o->op_flags & OPf_KIDS) {
770 OP *kid = cUNOPo->op_first;
772 switch (kid->op_type) {
777 forget_pmop((PMOP*)kid, 0);
779 find_and_forget_pmops(kid);
780 kid = kid->op_sibling;
786 Perl_op_null(pTHX_ OP *o)
790 PERL_ARGS_ASSERT_OP_NULL;
792 if (o->op_type == OP_NULL)
796 o->op_targ = o->op_type;
797 o->op_type = OP_NULL;
798 o->op_ppaddr = PL_ppaddr[OP_NULL];
802 Perl_op_refcnt_lock(pTHX)
810 Perl_op_refcnt_unlock(pTHX)
817 /* Contextualizers */
820 =for apidoc Am|OP *|op_contextualize|OP *o|I32 context
822 Applies a syntactic context to an op tree representing an expression.
823 I<o> is the op tree, and I<context> must be C<G_SCALAR>, C<G_ARRAY>,
824 or C<G_VOID> to specify the context to apply. The modified op tree
831 Perl_op_contextualize(pTHX_ OP *o, I32 context)
833 PERL_ARGS_ASSERT_OP_CONTEXTUALIZE;
835 case G_SCALAR: return scalar(o);
836 case G_ARRAY: return list(o);
837 case G_VOID: return scalarvoid(o);
839 Perl_croak(aTHX_ "panic: op_contextualize bad context");
845 =head1 Optree Manipulation Functions
847 =for apidoc Am|OP*|op_linklist|OP *o
848 This function is the implementation of the L</LINKLIST> macro. It should
849 not be called directly.
855 Perl_op_linklist(pTHX_ OP *o)
859 PERL_ARGS_ASSERT_OP_LINKLIST;
864 /* establish postfix order */
865 first = cUNOPo->op_first;
868 o->op_next = LINKLIST(first);
871 if (kid->op_sibling) {
872 kid->op_next = LINKLIST(kid->op_sibling);
873 kid = kid->op_sibling;
887 S_scalarkids(pTHX_ OP *o)
889 if (o && o->op_flags & OPf_KIDS) {
891 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
898 S_scalarboolean(pTHX_ OP *o)
902 PERL_ARGS_ASSERT_SCALARBOOLEAN;
904 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST
905 && !(cBINOPo->op_first->op_flags & OPf_SPECIAL)) {
906 if (ckWARN(WARN_SYNTAX)) {
907 const line_t oldline = CopLINE(PL_curcop);
909 if (PL_parser && PL_parser->copline != NOLINE)
910 CopLINE_set(PL_curcop, PL_parser->copline);
911 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
912 CopLINE_set(PL_curcop, oldline);
919 Perl_scalar(pTHX_ OP *o)
924 /* assumes no premature commitment */
925 if (!o || (PL_parser && PL_parser->error_count)
926 || (o->op_flags & OPf_WANT)
927 || o->op_type == OP_RETURN)
932 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
934 switch (o->op_type) {
936 scalar(cBINOPo->op_first);
941 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
951 if (o->op_flags & OPf_KIDS) {
952 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
958 kid = cLISTOPo->op_first;
960 kid = kid->op_sibling;
963 OP *sib = kid->op_sibling;
964 if (sib && kid->op_type != OP_LEAVEWHEN)
970 PL_curcop = &PL_compiling;
975 kid = cLISTOPo->op_first;
978 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
985 Perl_scalarvoid(pTHX_ OP *o)
989 const char* useless = NULL;
993 PERL_ARGS_ASSERT_SCALARVOID;
995 /* trailing mad null ops don't count as "there" for void processing */
997 o->op_type != OP_NULL &&
999 o->op_sibling->op_type == OP_NULL)
1002 for (sib = o->op_sibling;
1003 sib && sib->op_type == OP_NULL;
1004 sib = sib->op_sibling) ;
1010 if (o->op_type == OP_NEXTSTATE
1011 || o->op_type == OP_DBSTATE
1012 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
1013 || o->op_targ == OP_DBSTATE)))
1014 PL_curcop = (COP*)o; /* for warning below */
1016 /* assumes no premature commitment */
1017 want = o->op_flags & OPf_WANT;
1018 if ((want && want != OPf_WANT_SCALAR)
1019 || (PL_parser && PL_parser->error_count)
1020 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE || o->op_type == OP_LEAVEWHEN)
1025 if ((o->op_private & OPpTARGET_MY)
1026 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1028 return scalar(o); /* As if inside SASSIGN */
1031 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1033 switch (o->op_type) {
1035 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1039 if (o->op_flags & OPf_STACKED)
1043 if (o->op_private == 4)
1068 case OP_AELEMFAST_LEX:
1087 case OP_GETSOCKNAME:
1088 case OP_GETPEERNAME:
1093 case OP_GETPRIORITY:
1117 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1118 /* Otherwise it's "Useless use of grep iterator" */
1119 useless = OP_DESC(o);
1123 kid = cLISTOPo->op_first;
1124 if (kid && kid->op_type == OP_PUSHRE
1126 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1128 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1130 useless = OP_DESC(o);
1134 kid = cUNOPo->op_first;
1135 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1136 kid->op_type != OP_TRANS && kid->op_type != OP_TRANSR) {
1139 useless = "negative pattern binding (!~)";
1143 if (cPMOPo->op_pmflags & PMf_NONDESTRUCT)
1144 useless = "non-destructive substitution (s///r)";
1148 useless = "non-destructive transliteration (tr///r)";
1155 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1156 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1157 useless = "a variable";
1162 if (cSVOPo->op_private & OPpCONST_STRICT)
1163 no_bareword_allowed(o);
1165 if (ckWARN(WARN_VOID)) {
1167 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1168 "a constant (%"SVf")", sv));
1169 useless = SvPV_nolen(msv);
1172 useless = "a constant (undef)";
1173 if (o->op_private & OPpCONST_ARYBASE)
1175 /* don't warn on optimised away booleans, eg
1176 * use constant Foo, 5; Foo || print; */
1177 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1179 /* the constants 0 and 1 are permitted as they are
1180 conventionally used as dummies in constructs like
1181 1 while some_condition_with_side_effects; */
1182 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1184 else if (SvPOK(sv)) {
1185 /* perl4's way of mixing documentation and code
1186 (before the invention of POD) was based on a
1187 trick to mix nroff and perl code. The trick was
1188 built upon these three nroff macros being used in
1189 void context. The pink camel has the details in
1190 the script wrapman near page 319. */
1191 const char * const maybe_macro = SvPVX_const(sv);
1192 if (strnEQ(maybe_macro, "di", 2) ||
1193 strnEQ(maybe_macro, "ds", 2) ||
1194 strnEQ(maybe_macro, "ig", 2))
1199 op_null(o); /* don't execute or even remember it */
1203 o->op_type = OP_PREINC; /* pre-increment is faster */
1204 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1208 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1209 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1213 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1214 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1218 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1219 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1224 UNOP *refgen, *rv2cv;
1227 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
1230 rv2gv = ((BINOP *)o)->op_last;
1231 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
1234 refgen = (UNOP *)((BINOP *)o)->op_first;
1236 if (!refgen || refgen->op_type != OP_REFGEN)
1239 exlist = (LISTOP *)refgen->op_first;
1240 if (!exlist || exlist->op_type != OP_NULL
1241 || exlist->op_targ != OP_LIST)
1244 if (exlist->op_first->op_type != OP_PUSHMARK)
1247 rv2cv = (UNOP*)exlist->op_last;
1249 if (rv2cv->op_type != OP_RV2CV)
1252 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
1253 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
1254 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
1256 o->op_private |= OPpASSIGN_CV_TO_GV;
1257 rv2gv->op_private |= OPpDONT_INIT_GV;
1258 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
1270 kid = cLOGOPo->op_first;
1271 if (kid->op_type == OP_NOT
1272 && (kid->op_flags & OPf_KIDS)
1274 if (o->op_type == OP_AND) {
1276 o->op_ppaddr = PL_ppaddr[OP_OR];
1278 o->op_type = OP_AND;
1279 o->op_ppaddr = PL_ppaddr[OP_AND];
1288 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1293 if (o->op_flags & OPf_STACKED)
1300 if (!(o->op_flags & OPf_KIDS))
1311 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1321 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
1326 S_listkids(pTHX_ OP *o)
1328 if (o && o->op_flags & OPf_KIDS) {
1330 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1337 Perl_list(pTHX_ OP *o)
1342 /* assumes no premature commitment */
1343 if (!o || (o->op_flags & OPf_WANT)
1344 || (PL_parser && PL_parser->error_count)
1345 || o->op_type == OP_RETURN)
1350 if ((o->op_private & OPpTARGET_MY)
1351 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1353 return o; /* As if inside SASSIGN */
1356 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1358 switch (o->op_type) {
1361 list(cBINOPo->op_first);
1366 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1374 if (!(o->op_flags & OPf_KIDS))
1376 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1377 list(cBINOPo->op_first);
1378 return gen_constant_list(o);
1385 kid = cLISTOPo->op_first;
1387 kid = kid->op_sibling;
1390 OP *sib = kid->op_sibling;
1391 if (sib && kid->op_type != OP_LEAVEWHEN)
1397 PL_curcop = &PL_compiling;
1401 kid = cLISTOPo->op_first;
1408 S_scalarseq(pTHX_ OP *o)
1412 const OPCODE type = o->op_type;
1414 if (type == OP_LINESEQ || type == OP_SCOPE ||
1415 type == OP_LEAVE || type == OP_LEAVETRY)
1418 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1419 if (kid->op_sibling) {
1423 PL_curcop = &PL_compiling;
1425 o->op_flags &= ~OPf_PARENS;
1426 if (PL_hints & HINT_BLOCK_SCOPE)
1427 o->op_flags |= OPf_PARENS;
1430 o = newOP(OP_STUB, 0);
1435 S_modkids(pTHX_ OP *o, I32 type)
1437 if (o && o->op_flags & OPf_KIDS) {
1439 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1440 op_lvalue(kid, type);
1446 =for apidoc finalize_optree
1448 This function finalizes the optree. Should be called directly after
1449 the complete optree is built. It does some additional
1450 checking which can't be done in the normal ck_xxx functions and makes
1451 the tree thread-safe.
1456 Perl_finalize_optree(pTHX_ OP* o)
1458 PERL_ARGS_ASSERT_FINALIZE_OPTREE;
1461 SAVEVPTR(PL_curcop);
1469 S_finalize_op(pTHX_ OP* o)
1471 PERL_ARGS_ASSERT_FINALIZE_OP;
1473 #if defined(PERL_MAD) && defined(USE_ITHREADS)
1475 /* Make sure mad ops are also thread-safe */
1476 MADPROP *mp = o->op_madprop;
1478 if (mp->mad_type == MAD_OP && mp->mad_vlen) {
1479 OP *prop_op = (OP *) mp->mad_val;
1480 /* We only need "Relocate sv to the pad for thread safety.", but this
1481 easiest way to make sure it traverses everything */
1482 if (prop_op->op_type == OP_CONST)
1483 cSVOPx(prop_op)->op_private &= ~OPpCONST_STRICT;
1484 finalize_op(prop_op);
1491 switch (o->op_type) {
1494 PL_curcop = ((COP*)o); /* for warnings */
1498 && (o->op_sibling->op_type == OP_NEXTSTATE || o->op_sibling->op_type == OP_DBSTATE)
1499 && ckWARN(WARN_SYNTAX))
1501 if (o->op_sibling->op_sibling) {
1502 const OPCODE type = o->op_sibling->op_sibling->op_type;
1503 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
1504 const line_t oldline = CopLINE(PL_curcop);
1505 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_sibling));
1506 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1507 "Statement unlikely to be reached");
1508 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1509 "\t(Maybe you meant system() when you said exec()?)\n");
1510 CopLINE_set(PL_curcop, oldline);
1517 if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
1518 GV * const gv = cGVOPo_gv;
1519 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
1520 /* XXX could check prototype here instead of just carping */
1521 SV * const sv = sv_newmortal();
1522 gv_efullname3(sv, gv, NULL);
1523 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
1524 "%"SVf"() called too early to check prototype",
1531 if (cSVOPo->op_private & OPpCONST_STRICT)
1532 no_bareword_allowed(o);
1536 case OP_METHOD_NAMED:
1537 /* Relocate sv to the pad for thread safety.
1538 * Despite being a "constant", the SV is written to,
1539 * for reference counts, sv_upgrade() etc. */
1540 if (cSVOPo->op_sv) {
1541 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
1542 if (o->op_type != OP_METHOD_NAMED &&
1543 (SvPADTMP(cSVOPo->op_sv) || SvPADMY(cSVOPo->op_sv)))
1545 /* If op_sv is already a PADTMP/MY then it is being used by
1546 * some pad, so make a copy. */
1547 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
1548 SvREADONLY_on(PAD_SVl(ix));
1549 SvREFCNT_dec(cSVOPo->op_sv);
1551 else if (o->op_type != OP_METHOD_NAMED
1552 && cSVOPo->op_sv == &PL_sv_undef) {
1553 /* PL_sv_undef is hack - it's unsafe to store it in the
1554 AV that is the pad, because av_fetch treats values of
1555 PL_sv_undef as a "free" AV entry and will merrily
1556 replace them with a new SV, causing pad_alloc to think
1557 that this pad slot is free. (When, clearly, it is not)
1559 SvOK_off(PAD_SVl(ix));
1560 SvPADTMP_on(PAD_SVl(ix));
1561 SvREADONLY_on(PAD_SVl(ix));
1564 SvREFCNT_dec(PAD_SVl(ix));
1565 SvPADTMP_on(cSVOPo->op_sv);
1566 PAD_SETSV(ix, cSVOPo->op_sv);
1567 /* XXX I don't know how this isn't readonly already. */
1568 SvREADONLY_on(PAD_SVl(ix));
1570 cSVOPo->op_sv = NULL;
1581 const char *key = NULL;
1584 if (((BINOP*)o)->op_last->op_type != OP_CONST)
1587 /* Make the CONST have a shared SV */
1588 svp = cSVOPx_svp(((BINOP*)o)->op_last);
1589 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv))
1590 && SvTYPE(sv) < SVt_PVMG && !SvROK(sv)) {
1591 key = SvPV_const(sv, keylen);
1592 lexname = newSVpvn_share(key,
1593 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
1599 if ((o->op_private & (OPpLVAL_INTRO)))
1602 rop = (UNOP*)((BINOP*)o)->op_first;
1603 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
1605 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
1606 if (!SvPAD_TYPED(lexname))
1608 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1609 if (!fields || !GvHV(*fields))
1611 key = SvPV_const(*svp, keylen);
1612 if (!hv_fetch(GvHV(*fields), key,
1613 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1614 Perl_croak(aTHX_ "No such class field \"%s\" "
1615 "in variable %s of type %s",
1616 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
1628 SVOP *first_key_op, *key_op;
1630 if ((o->op_private & (OPpLVAL_INTRO))
1631 /* I bet there's always a pushmark... */
1632 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
1633 /* hmmm, no optimization if list contains only one key. */
1635 rop = (UNOP*)((LISTOP*)o)->op_last;
1636 if (rop->op_type != OP_RV2HV)
1638 if (rop->op_first->op_type == OP_PADSV)
1639 /* @$hash{qw(keys here)} */
1640 rop = (UNOP*)rop->op_first;
1642 /* @{$hash}{qw(keys here)} */
1643 if (rop->op_first->op_type == OP_SCOPE
1644 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
1646 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
1652 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
1653 if (!SvPAD_TYPED(lexname))
1655 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1656 if (!fields || !GvHV(*fields))
1658 /* Again guessing that the pushmark can be jumped over.... */
1659 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
1660 ->op_first->op_sibling;
1661 for (key_op = first_key_op; key_op;
1662 key_op = (SVOP*)key_op->op_sibling) {
1663 if (key_op->op_type != OP_CONST)
1665 svp = cSVOPx_svp(key_op);
1666 key = SvPV_const(*svp, keylen);
1667 if (!hv_fetch(GvHV(*fields), key,
1668 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1669 Perl_croak(aTHX_ "No such class field \"%s\" "
1670 "in variable %s of type %s",
1671 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
1677 if (cPMOPo->op_pmreplrootu.op_pmreplroot)
1678 finalize_op(cPMOPo->op_pmreplrootu.op_pmreplroot);
1685 if (o->op_flags & OPf_KIDS) {
1687 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1693 =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
1695 Propagate lvalue ("modifiable") context to an op and its children.
1696 I<type> represents the context type, roughly based on the type of op that
1697 would do the modifying, although C<local()> is represented by OP_NULL,
1698 because it has no op type of its own (it is signalled by a flag on
1701 This function detects things that can't be modified, such as C<$x+1>, and
1702 generates errors for them. For example, C<$x+1 = 2> would cause it to be
1703 called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN.
1705 It also flags things that need to behave specially in an lvalue context,
1706 such as C<$$x = 5> which might have to vivify a reference in C<$x>.
1712 Perl_op_lvalue_flags(pTHX_ OP *o, I32 type, U32 flags)
1716 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1719 if (!o || (PL_parser && PL_parser->error_count))
1722 if ((o->op_private & OPpTARGET_MY)
1723 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1728 assert( (o->op_flags & OPf_WANT) != OPf_WANT_VOID );
1730 switch (o->op_type) {
1736 if (!(o->op_private & OPpCONST_ARYBASE))
1739 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1740 CopARYBASE_set(&PL_compiling,
1741 (I32)SvIV(cSVOPx(PL_eval_start)->op_sv));
1745 SAVECOPARYBASE(&PL_compiling);
1746 CopARYBASE_set(&PL_compiling, 0);
1748 else if (type == OP_REFGEN)
1751 Perl_croak(aTHX_ "That use of $[ is unsupported");
1754 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1758 if ((type == OP_UNDEF || type == OP_REFGEN || type == OP_LOCK) &&
1759 !(o->op_flags & OPf_STACKED)) {
1760 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1761 /* Both ENTERSUB and RV2CV use this bit, but for different pur-
1762 poses, so we need it clear. */
1763 o->op_private &= ~1;
1764 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1765 assert(cUNOPo->op_first->op_type == OP_NULL);
1766 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1769 else { /* lvalue subroutine call */
1770 o->op_private |= OPpLVAL_INTRO
1771 |(OPpENTERSUB_INARGS * (type == OP_LEAVESUBLV));
1772 PL_modcount = RETURN_UNLIMITED_NUMBER;
1773 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1774 /* Backward compatibility mode: */
1775 o->op_private |= OPpENTERSUB_INARGS;
1778 else { /* Compile-time error message: */
1779 OP *kid = cUNOPo->op_first;
1783 if (kid->op_type != OP_PUSHMARK) {
1784 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1786 "panic: unexpected lvalue entersub "
1787 "args: type/targ %ld:%"UVuf,
1788 (long)kid->op_type, (UV)kid->op_targ);
1789 kid = kLISTOP->op_first;
1791 while (kid->op_sibling)
1792 kid = kid->op_sibling;
1793 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1795 if (kid->op_type == OP_METHOD_NAMED
1796 || kid->op_type == OP_METHOD)
1800 NewOp(1101, newop, 1, UNOP);
1801 newop->op_type = OP_RV2CV;
1802 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1803 newop->op_first = NULL;
1804 newop->op_next = (OP*)newop;
1805 kid->op_sibling = (OP*)newop;
1806 newop->op_private |= OPpLVAL_INTRO;
1807 newop->op_private &= ~1;
1811 if (kid->op_type != OP_RV2CV)
1813 "panic: unexpected lvalue entersub "
1814 "entry via type/targ %ld:%"UVuf,
1815 (long)kid->op_type, (UV)kid->op_targ);
1816 kid->op_private |= OPpLVAL_INTRO;
1817 break; /* Postpone until runtime */
1821 kid = kUNOP->op_first;
1822 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1823 kid = kUNOP->op_first;
1824 if (kid->op_type == OP_NULL)
1826 "Unexpected constant lvalue entersub "
1827 "entry via type/targ %ld:%"UVuf,
1828 (long)kid->op_type, (UV)kid->op_targ);
1829 if (kid->op_type != OP_GV) {
1830 /* Restore RV2CV to check lvalueness */
1832 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1833 okid->op_next = kid->op_next;
1834 kid->op_next = okid;
1837 okid->op_next = NULL;
1838 okid->op_type = OP_RV2CV;
1840 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1841 okid->op_private |= OPpLVAL_INTRO;
1842 okid->op_private &= ~1;
1846 cv = GvCV(kGVOP_gv);
1856 if (flags & OP_LVALUE_NO_CROAK) return NULL;
1857 /* grep, foreach, subcalls, refgen */
1858 if (type == OP_GREPSTART || type == OP_ENTERSUB
1859 || type == OP_REFGEN || type == OP_LEAVESUBLV)
1861 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1862 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1864 : (o->op_type == OP_ENTERSUB
1865 ? "non-lvalue subroutine call"
1867 type ? PL_op_desc[type] : "local"));
1881 case OP_RIGHT_SHIFT:
1890 if (!(o->op_flags & OPf_STACKED))
1897 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1898 op_lvalue(kid, type);
1903 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1904 PL_modcount = RETURN_UNLIMITED_NUMBER;
1905 return o; /* Treat \(@foo) like ordinary list. */
1909 if (scalar_mod_type(o, type))
1911 ref(cUNOPo->op_first, o->op_type);
1915 if (type == OP_LEAVESUBLV)
1916 o->op_private |= OPpMAYBE_LVSUB;
1922 PL_modcount = RETURN_UNLIMITED_NUMBER;
1925 PL_hints |= HINT_BLOCK_SCOPE;
1926 if (type == OP_LEAVESUBLV)
1927 o->op_private |= OPpMAYBE_LVSUB;
1931 ref(cUNOPo->op_first, o->op_type);
1935 PL_hints |= HINT_BLOCK_SCOPE;
1944 case OP_AELEMFAST_LEX:
1951 PL_modcount = RETURN_UNLIMITED_NUMBER;
1952 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1953 return o; /* Treat \(@foo) like ordinary list. */
1954 if (scalar_mod_type(o, type))
1956 if (type == OP_LEAVESUBLV)
1957 o->op_private |= OPpMAYBE_LVSUB;
1961 if (!type) /* local() */
1962 Perl_croak(aTHX_ "Can't localize lexical variable %"SVf,
1963 PAD_COMPNAME_SV(o->op_targ));
1972 if (type != OP_SASSIGN && type != OP_LEAVESUBLV)
1976 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1982 if (type == OP_LEAVESUBLV)
1983 o->op_private |= OPpMAYBE_LVSUB;
1984 pad_free(o->op_targ);
1985 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1986 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1987 if (o->op_flags & OPf_KIDS)
1988 op_lvalue(cBINOPo->op_first->op_sibling, type);
1993 ref(cBINOPo->op_first, o->op_type);
1994 if (type == OP_ENTERSUB &&
1995 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1996 o->op_private |= OPpLVAL_DEFER;
1997 if (type == OP_LEAVESUBLV)
1998 o->op_private |= OPpMAYBE_LVSUB;
2008 if (o->op_flags & OPf_KIDS)
2009 op_lvalue(cLISTOPo->op_last, type);
2014 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
2016 else if (!(o->op_flags & OPf_KIDS))
2018 if (o->op_targ != OP_LIST) {
2019 op_lvalue(cBINOPo->op_first, type);
2025 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2026 /* elements might be in void context because the list is
2027 in scalar context or because they are attribute sub calls */
2028 if ( (kid->op_flags & OPf_WANT) != OPf_WANT_VOID )
2029 op_lvalue(kid, type);
2033 if (type != OP_LEAVESUBLV)
2035 break; /* op_lvalue()ing was handled by ck_return() */
2038 /* [20011101.069] File test operators interpret OPf_REF to mean that
2039 their argument is a filehandle; thus \stat(".") should not set
2041 if (type == OP_REFGEN &&
2042 PL_check[o->op_type] == Perl_ck_ftst)
2045 if (type != OP_LEAVESUBLV)
2046 o->op_flags |= OPf_MOD;
2048 if (type == OP_AASSIGN || type == OP_SASSIGN)
2049 o->op_flags |= OPf_SPECIAL|OPf_REF;
2050 else if (!type) { /* local() */
2053 o->op_private |= OPpLVAL_INTRO;
2054 o->op_flags &= ~OPf_SPECIAL;
2055 PL_hints |= HINT_BLOCK_SCOPE;
2060 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
2061 "Useless localization of %s", OP_DESC(o));
2064 else if (type != OP_GREPSTART && type != OP_ENTERSUB
2065 && type != OP_LEAVESUBLV)
2066 o->op_flags |= OPf_REF;
2071 S_scalar_mod_type(const OP *o, I32 type)
2073 assert(o || type != OP_SASSIGN);
2077 if (o->op_type == OP_RV2GV)
2101 case OP_RIGHT_SHIFT:
2122 S_is_handle_constructor(const OP *o, I32 numargs)
2124 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
2126 switch (o->op_type) {
2134 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
2147 S_refkids(pTHX_ OP *o, I32 type)
2149 if (o && o->op_flags & OPf_KIDS) {
2151 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2158 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
2163 PERL_ARGS_ASSERT_DOREF;
2165 if (!o || (PL_parser && PL_parser->error_count))
2168 switch (o->op_type) {
2170 if ((type == OP_EXISTS || type == OP_DEFINED) &&
2171 !(o->op_flags & OPf_STACKED)) {
2172 o->op_type = OP_RV2CV; /* entersub => rv2cv */
2173 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
2174 assert(cUNOPo->op_first->op_type == OP_NULL);
2175 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
2176 o->op_flags |= OPf_SPECIAL;
2177 o->op_private &= ~1;
2179 else if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV){
2180 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2181 : type == OP_RV2HV ? OPpDEREF_HV
2183 o->op_flags |= OPf_MOD;
2189 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2190 doref(kid, type, set_op_ref);
2193 if (type == OP_DEFINED)
2194 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2195 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2198 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2199 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2200 : type == OP_RV2HV ? OPpDEREF_HV
2202 o->op_flags |= OPf_MOD;
2209 o->op_flags |= OPf_REF;
2212 if (type == OP_DEFINED)
2213 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2214 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2220 o->op_flags |= OPf_REF;
2225 if (!(o->op_flags & OPf_KIDS))
2227 doref(cBINOPo->op_first, type, set_op_ref);
2231 doref(cBINOPo->op_first, o->op_type, set_op_ref);
2232 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2233 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2234 : type == OP_RV2HV ? OPpDEREF_HV
2236 o->op_flags |= OPf_MOD;
2246 if (!(o->op_flags & OPf_KIDS))
2248 doref(cLISTOPo->op_last, type, set_op_ref);
2258 S_dup_attrlist(pTHX_ OP *o)
2263 PERL_ARGS_ASSERT_DUP_ATTRLIST;
2265 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
2266 * where the first kid is OP_PUSHMARK and the remaining ones
2267 * are OP_CONST. We need to push the OP_CONST values.
2269 if (o->op_type == OP_CONST)
2270 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
2272 else if (o->op_type == OP_NULL)
2276 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
2278 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
2279 if (o->op_type == OP_CONST)
2280 rop = op_append_elem(OP_LIST, rop,
2281 newSVOP(OP_CONST, o->op_flags,
2282 SvREFCNT_inc_NN(cSVOPo->op_sv)));
2289 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
2294 PERL_ARGS_ASSERT_APPLY_ATTRS;
2296 /* fake up C<use attributes $pkg,$rv,@attrs> */
2297 ENTER; /* need to protect against side-effects of 'use' */
2298 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2300 #define ATTRSMODULE "attributes"
2301 #define ATTRSMODULE_PM "attributes.pm"
2304 /* Don't force the C<use> if we don't need it. */
2305 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
2306 if (svp && *svp != &PL_sv_undef)
2307 NOOP; /* already in %INC */
2309 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
2310 newSVpvs(ATTRSMODULE), NULL);
2313 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2314 newSVpvs(ATTRSMODULE),
2316 op_prepend_elem(OP_LIST,
2317 newSVOP(OP_CONST, 0, stashsv),
2318 op_prepend_elem(OP_LIST,
2319 newSVOP(OP_CONST, 0,
2321 dup_attrlist(attrs))));
2327 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2330 OP *pack, *imop, *arg;
2333 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2338 assert(target->op_type == OP_PADSV ||
2339 target->op_type == OP_PADHV ||
2340 target->op_type == OP_PADAV);
2342 /* Ensure that attributes.pm is loaded. */
2343 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
2345 /* Need package name for method call. */
2346 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
2348 /* Build up the real arg-list. */
2349 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2351 arg = newOP(OP_PADSV, 0);
2352 arg->op_targ = target->op_targ;
2353 arg = op_prepend_elem(OP_LIST,
2354 newSVOP(OP_CONST, 0, stashsv),
2355 op_prepend_elem(OP_LIST,
2356 newUNOP(OP_REFGEN, 0,
2357 op_lvalue(arg, OP_REFGEN)),
2358 dup_attrlist(attrs)));
2360 /* Fake up a method call to import */
2361 meth = newSVpvs_share("import");
2362 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2363 op_append_elem(OP_LIST,
2364 op_prepend_elem(OP_LIST, pack, list(arg)),
2365 newSVOP(OP_METHOD_NAMED, 0, meth)));
2367 /* Combine the ops. */
2368 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
2372 =notfor apidoc apply_attrs_string
2374 Attempts to apply a list of attributes specified by the C<attrstr> and
2375 C<len> arguments to the subroutine identified by the C<cv> argument which
2376 is expected to be associated with the package identified by the C<stashpv>
2377 argument (see L<attributes>). It gets this wrong, though, in that it
2378 does not correctly identify the boundaries of the individual attribute
2379 specifications within C<attrstr>. This is not really intended for the
2380 public API, but has to be listed here for systems such as AIX which
2381 need an explicit export list for symbols. (It's called from XS code
2382 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2383 to respect attribute syntax properly would be welcome.
2389 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2390 const char *attrstr, STRLEN len)
2394 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2397 len = strlen(attrstr);
2401 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2403 const char * const sstr = attrstr;
2404 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2405 attrs = op_append_elem(OP_LIST, attrs,
2406 newSVOP(OP_CONST, 0,
2407 newSVpvn(sstr, attrstr-sstr)));
2411 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2412 newSVpvs(ATTRSMODULE),
2413 NULL, op_prepend_elem(OP_LIST,
2414 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2415 op_prepend_elem(OP_LIST,
2416 newSVOP(OP_CONST, 0,
2417 newRV(MUTABLE_SV(cv))),
2422 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2426 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
2428 PERL_ARGS_ASSERT_MY_KID;
2430 if (!o || (PL_parser && PL_parser->error_count))
2434 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2435 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2439 if (type == OP_LIST) {
2441 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2442 my_kid(kid, attrs, imopsp);
2443 } else if (type == OP_UNDEF
2449 } else if (type == OP_RV2SV || /* "our" declaration */
2451 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2452 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2453 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2455 PL_parser->in_my == KEY_our
2457 : PL_parser->in_my == KEY_state ? "state" : "my"));
2459 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2460 PL_parser->in_my = FALSE;
2461 PL_parser->in_my_stash = NULL;
2462 apply_attrs(GvSTASH(gv),
2463 (type == OP_RV2SV ? GvSV(gv) :
2464 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2465 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2468 o->op_private |= OPpOUR_INTRO;
2471 else if (type != OP_PADSV &&
2474 type != OP_PUSHMARK)
2476 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2478 PL_parser->in_my == KEY_our
2480 : PL_parser->in_my == KEY_state ? "state" : "my"));
2483 else if (attrs && type != OP_PUSHMARK) {
2486 PL_parser->in_my = FALSE;
2487 PL_parser->in_my_stash = NULL;
2489 /* check for C<my Dog $spot> when deciding package */
2490 stash = PAD_COMPNAME_TYPE(o->op_targ);
2492 stash = PL_curstash;
2493 apply_attrs_my(stash, o, attrs, imopsp);
2495 o->op_flags |= OPf_MOD;
2496 o->op_private |= OPpLVAL_INTRO;
2498 o->op_private |= OPpPAD_STATE;
2503 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2507 int maybe_scalar = 0;
2509 PERL_ARGS_ASSERT_MY_ATTRS;
2511 /* [perl #17376]: this appears to be premature, and results in code such as
2512 C< our(%x); > executing in list mode rather than void mode */
2514 if (o->op_flags & OPf_PARENS)
2524 o = my_kid(o, attrs, &rops);
2526 if (maybe_scalar && o->op_type == OP_PADSV) {
2527 o = scalar(op_append_list(OP_LIST, rops, o));
2528 o->op_private |= OPpLVAL_INTRO;
2531 /* The listop in rops might have a pushmark at the beginning,
2532 which will mess up list assignment. */
2533 LISTOP * const lrops = (LISTOP *)rops; /* for brevity */
2534 if (rops->op_type == OP_LIST &&
2535 lrops->op_first && lrops->op_first->op_type == OP_PUSHMARK)
2537 OP * const pushmark = lrops->op_first;
2538 lrops->op_first = pushmark->op_sibling;
2541 o = op_append_list(OP_LIST, o, rops);
2544 PL_parser->in_my = FALSE;
2545 PL_parser->in_my_stash = NULL;
2550 Perl_sawparens(pTHX_ OP *o)
2552 PERL_UNUSED_CONTEXT;
2554 o->op_flags |= OPf_PARENS;
2559 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2563 const OPCODE ltype = left->op_type;
2564 const OPCODE rtype = right->op_type;
2566 PERL_ARGS_ASSERT_BIND_MATCH;
2568 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2569 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2571 const char * const desc
2573 rtype == OP_SUBST || rtype == OP_TRANS
2574 || rtype == OP_TRANSR
2576 ? (int)rtype : OP_MATCH];
2577 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
2578 ? "@array" : "%hash");
2579 Perl_warner(aTHX_ packWARN(WARN_MISC),
2580 "Applying %s to %s will act on scalar(%s)",
2581 desc, sample, sample);
2584 if (rtype == OP_CONST &&
2585 cSVOPx(right)->op_private & OPpCONST_BARE &&
2586 cSVOPx(right)->op_private & OPpCONST_STRICT)
2588 no_bareword_allowed(right);
2591 /* !~ doesn't make sense with /r, so error on it for now */
2592 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2594 yyerror("Using !~ with s///r doesn't make sense");
2595 if (rtype == OP_TRANSR && type == OP_NOT)
2596 yyerror("Using !~ with tr///r doesn't make sense");
2598 ismatchop = (rtype == OP_MATCH ||
2599 rtype == OP_SUBST ||
2600 rtype == OP_TRANS || rtype == OP_TRANSR)
2601 && !(right->op_flags & OPf_SPECIAL);
2602 if (ismatchop && right->op_private & OPpTARGET_MY) {
2604 right->op_private &= ~OPpTARGET_MY;
2606 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2609 right->op_flags |= OPf_STACKED;
2610 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
2611 ! (rtype == OP_TRANS &&
2612 right->op_private & OPpTRANS_IDENTICAL) &&
2613 ! (rtype == OP_SUBST &&
2614 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
2615 newleft = op_lvalue(left, rtype);
2618 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
2619 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2621 o = op_prepend_elem(rtype, scalar(newleft), right);
2623 return newUNOP(OP_NOT, 0, scalar(o));
2627 return bind_match(type, left,
2628 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
2632 Perl_invert(pTHX_ OP *o)
2636 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2640 =for apidoc Amx|OP *|op_scope|OP *o
2642 Wraps up an op tree with some additional ops so that at runtime a dynamic
2643 scope will be created. The original ops run in the new dynamic scope,
2644 and then, provided that they exit normally, the scope will be unwound.
2645 The additional ops used to create and unwind the dynamic scope will
2646 normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2647 instead if the ops are simple enough to not need the full dynamic scope
2654 Perl_op_scope(pTHX_ OP *o)
2658 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2659 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2660 o->op_type = OP_LEAVE;
2661 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2663 else if (o->op_type == OP_LINESEQ) {
2665 o->op_type = OP_SCOPE;
2666 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2667 kid = ((LISTOP*)o)->op_first;
2668 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2671 /* The following deals with things like 'do {1 for 1}' */
2672 kid = kid->op_sibling;
2674 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2679 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2685 Perl_block_start(pTHX_ int full)
2688 const int retval = PL_savestack_ix;
2690 pad_block_start(full);
2692 PL_hints &= ~HINT_BLOCK_SCOPE;
2693 SAVECOMPILEWARNINGS();
2694 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2696 CALL_BLOCK_HOOKS(bhk_start, full);
2702 Perl_block_end(pTHX_ I32 floor, OP *seq)
2705 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2706 OP* retval = scalarseq(seq);
2708 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
2711 CopHINTS_set(&PL_compiling, PL_hints);
2713 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2716 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
2722 =head1 Compile-time scope hooks
2724 =for apidoc Aox||blockhook_register
2726 Register a set of hooks to be called when the Perl lexical scope changes
2727 at compile time. See L<perlguts/"Compile-time scope hooks">.
2733 Perl_blockhook_register(pTHX_ BHK *hk)
2735 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2737 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2744 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
2745 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2746 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2749 OP * const o = newOP(OP_PADSV, 0);
2750 o->op_targ = offset;
2756 Perl_newPROG(pTHX_ OP *o)
2760 PERL_ARGS_ASSERT_NEWPROG;
2766 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2767 ((PL_in_eval & EVAL_KEEPERR)
2768 ? OPf_SPECIAL : 0), o);
2770 cx = &cxstack[cxstack_ix];
2771 assert(CxTYPE(cx) == CXt_EVAL);
2773 if ((cx->blk_gimme & G_WANT) == G_VOID)
2774 scalarvoid(PL_eval_root);
2775 else if ((cx->blk_gimme & G_WANT) == G_ARRAY)
2778 scalar(PL_eval_root);
2780 /* don't use LINKLIST, since PL_eval_root might indirect through
2781 * a rather expensive function call and LINKLIST evaluates its
2782 * argument more than once */
2783 PL_eval_start = op_linklist(PL_eval_root);
2784 PL_eval_root->op_private |= OPpREFCOUNTED;
2785 OpREFCNT_set(PL_eval_root, 1);
2786 PL_eval_root->op_next = 0;
2787 CALL_PEEP(PL_eval_start);
2788 finalize_optree(PL_eval_root);
2792 if (o->op_type == OP_STUB) {
2793 PL_comppad_name = 0;
2795 S_op_destroy(aTHX_ o);
2798 PL_main_root = op_scope(sawparens(scalarvoid(o)));
2799 PL_curcop = &PL_compiling;
2800 PL_main_start = LINKLIST(PL_main_root);
2801 PL_main_root->op_private |= OPpREFCOUNTED;
2802 OpREFCNT_set(PL_main_root, 1);
2803 PL_main_root->op_next = 0;
2804 CALL_PEEP(PL_main_start);
2805 finalize_optree(PL_main_root);
2808 /* Register with debugger */
2810 CV * const cv = get_cvs("DB::postponed", 0);
2814 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
2816 call_sv(MUTABLE_SV(cv), G_DISCARD);
2823 Perl_localize(pTHX_ OP *o, I32 lex)
2827 PERL_ARGS_ASSERT_LOCALIZE;
2829 if (o->op_flags & OPf_PARENS)
2830 /* [perl #17376]: this appears to be premature, and results in code such as
2831 C< our(%x); > executing in list mode rather than void mode */
2838 if ( PL_parser->bufptr > PL_parser->oldbufptr
2839 && PL_parser->bufptr[-1] == ','
2840 && ckWARN(WARN_PARENTHESIS))
2842 char *s = PL_parser->bufptr;
2845 /* some heuristics to detect a potential error */
2846 while (*s && (strchr(", \t\n", *s)))
2850 if (*s && strchr("@$%*", *s) && *++s
2851 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2854 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2856 while (*s && (strchr(", \t\n", *s)))
2862 if (sigil && (*s == ';' || *s == '=')) {
2863 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2864 "Parentheses missing around \"%s\" list",
2866 ? (PL_parser->in_my == KEY_our
2868 : PL_parser->in_my == KEY_state
2878 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
2879 PL_parser->in_my = FALSE;
2880 PL_parser->in_my_stash = NULL;
2885 Perl_jmaybe(pTHX_ OP *o)
2887 PERL_ARGS_ASSERT_JMAYBE;
2889 if (o->op_type == OP_LIST) {
2891 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2892 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
2897 PERL_STATIC_INLINE OP *
2898 S_op_std_init(pTHX_ OP *o)
2900 I32 type = o->op_type;
2902 PERL_ARGS_ASSERT_OP_STD_INIT;
2904 if (PL_opargs[type] & OA_RETSCALAR)
2906 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2907 o->op_targ = pad_alloc(type, SVs_PADTMP);
2912 PERL_STATIC_INLINE OP *
2913 S_op_integerize(pTHX_ OP *o)
2915 I32 type = o->op_type;
2917 PERL_ARGS_ASSERT_OP_INTEGERIZE;
2919 /* integerize op, unless it happens to be C<-foo>.
2920 * XXX should pp_i_negate() do magic string negation instead? */
2921 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2922 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2923 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2926 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2929 if (type == OP_NEGATE)
2930 /* XXX might want a ck_negate() for this */
2931 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2937 S_fold_constants(pTHX_ register OP *o)
2940 register OP * VOL curop;
2942 VOL I32 type = o->op_type;
2947 SV * const oldwarnhook = PL_warnhook;
2948 SV * const olddiehook = PL_diehook;
2952 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2954 if (!(PL_opargs[type] & OA_FOLDCONST))
2968 /* XXX what about the numeric ops? */
2969 if (PL_hints & HINT_LOCALE)
2974 if (PL_parser && PL_parser->error_count)
2975 goto nope; /* Don't try to run w/ errors */
2977 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2978 const OPCODE type = curop->op_type;
2979 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2981 type != OP_SCALAR &&
2983 type != OP_PUSHMARK)
2989 curop = LINKLIST(o);
2990 old_next = o->op_next;
2994 oldscope = PL_scopestack_ix;
2995 create_eval_scope(G_FAKINGEVAL);
2997 /* Verify that we don't need to save it: */
2998 assert(PL_curcop == &PL_compiling);
2999 StructCopy(&PL_compiling, ¬_compiling, COP);
3000 PL_curcop = ¬_compiling;
3001 /* The above ensures that we run with all the correct hints of the
3002 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
3003 assert(IN_PERL_RUNTIME);
3004 PL_warnhook = PERL_WARNHOOK_FATAL;
3011 sv = *(PL_stack_sp--);
3012 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
3014 /* Can't simply swipe the SV from the pad, because that relies on
3015 the op being freed "real soon now". Under MAD, this doesn't
3016 happen (see the #ifdef below). */
3019 pad_swipe(o->op_targ, FALSE);
3022 else if (SvTEMP(sv)) { /* grab mortal temp? */
3023 SvREFCNT_inc_simple_void(sv);
3028 /* Something tried to die. Abandon constant folding. */
3029 /* Pretend the error never happened. */
3031 o->op_next = old_next;
3035 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
3036 PL_warnhook = oldwarnhook;
3037 PL_diehook = olddiehook;
3038 /* XXX note that this croak may fail as we've already blown away
3039 * the stack - eg any nested evals */
3040 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
3043 PL_warnhook = oldwarnhook;
3044 PL_diehook = olddiehook;
3045 PL_curcop = &PL_compiling;
3047 if (PL_scopestack_ix > oldscope)
3048 delete_eval_scope();
3057 if (type == OP_RV2GV)
3058 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
3060 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
3061 op_getmad(o,newop,'f');
3069 S_gen_constant_list(pTHX_ register OP *o)
3073 const I32 oldtmps_floor = PL_tmps_floor;
3076 if (PL_parser && PL_parser->error_count)
3077 return o; /* Don't attempt to run with errors */
3079 PL_op = curop = LINKLIST(o);
3082 Perl_pp_pushmark(aTHX);
3085 assert (!(curop->op_flags & OPf_SPECIAL));
3086 assert(curop->op_type == OP_RANGE);
3087 Perl_pp_anonlist(aTHX);
3088 PL_tmps_floor = oldtmps_floor;
3090 o->op_type = OP_RV2AV;
3091 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
3092 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
3093 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
3094 o->op_opt = 0; /* needs to be revisited in rpeep() */
3095 curop = ((UNOP*)o)->op_first;
3096 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
3098 op_getmad(curop,o,'O');
3107 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
3110 if (!o || o->op_type != OP_LIST)
3111 o = newLISTOP(OP_LIST, 0, o, NULL);
3113 o->op_flags &= ~OPf_WANT;
3115 if (!(PL_opargs[type] & OA_MARK))
3116 op_null(cLISTOPo->op_first);
3118 OP * const kid2 = cLISTOPo->op_first->op_sibling;
3119 if (kid2 && kid2->op_type == OP_COREARGS) {
3120 op_null(cLISTOPo->op_first);
3121 kid2->op_private |= OPpCOREARGS_PUSHMARK;
3125 o->op_type = (OPCODE)type;
3126 o->op_ppaddr = PL_ppaddr[type];
3127 o->op_flags |= flags;
3129 o = CHECKOP(type, o);
3130 if (o->op_type != (unsigned)type)
3133 return fold_constants(op_integerize(op_std_init(o)));
3137 =head1 Optree Manipulation Functions
3140 /* List constructors */
3143 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
3145 Append an item to the list of ops contained directly within a list-type
3146 op, returning the lengthened list. I<first> is the list-type op,
3147 and I<last> is the op to append to the list. I<optype> specifies the
3148 intended opcode for the list. If I<first> is not already a list of the
3149 right type, it will be upgraded into one. If either I<first> or I<last>
3150 is null, the other is returned unchanged.
3156 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
3164 if (first->op_type != (unsigned)type
3165 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
3167 return newLISTOP(type, 0, first, last);
3170 if (first->op_flags & OPf_KIDS)
3171 ((LISTOP*)first)->op_last->op_sibling = last;
3173 first->op_flags |= OPf_KIDS;
3174 ((LISTOP*)first)->op_first = last;
3176 ((LISTOP*)first)->op_last = last;
3181 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
3183 Concatenate the lists of ops contained directly within two list-type ops,
3184 returning the combined list. I<first> and I<last> are the list-type ops
3185 to concatenate. I<optype> specifies the intended opcode for the list.
3186 If either I<first> or I<last> is not already a list of the right type,
3187 it will be upgraded into one. If either I<first> or I<last> is null,
3188 the other is returned unchanged.
3194 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
3202 if (first->op_type != (unsigned)type)
3203 return op_prepend_elem(type, first, last);
3205 if (last->op_type != (unsigned)type)
3206 return op_append_elem(type, first, last);
3208 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
3209 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
3210 first->op_flags |= (last->op_flags & OPf_KIDS);
3213 if (((LISTOP*)last)->op_first && first->op_madprop) {
3214 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
3216 while (mp->mad_next)
3218 mp->mad_next = first->op_madprop;
3221 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
3224 first->op_madprop = last->op_madprop;
3225 last->op_madprop = 0;
3228 S_op_destroy(aTHX_ last);
3234 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
3236 Prepend an item to the list of ops contained directly within a list-type
3237 op, returning the lengthened list. I<first> is the op to prepend to the
3238 list, and I<last> is the list-type op. I<optype> specifies the intended
3239 opcode for the list. If I<last> is not already a list of the right type,
3240 it will be upgraded into one. If either I<first> or I<last> is null,
3241 the other is returned unchanged.
3247 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
3255 if (last->op_type == (unsigned)type) {
3256 if (type == OP_LIST) { /* already a PUSHMARK there */
3257 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
3258 ((LISTOP*)last)->op_first->op_sibling = first;
3259 if (!(first->op_flags & OPf_PARENS))
3260 last->op_flags &= ~OPf_PARENS;
3263 if (!(last->op_flags & OPf_KIDS)) {
3264 ((LISTOP*)last)->op_last = first;
3265 last->op_flags |= OPf_KIDS;
3267 first->op_sibling = ((LISTOP*)last)->op_first;
3268 ((LISTOP*)last)->op_first = first;
3270 last->op_flags |= OPf_KIDS;
3274 return newLISTOP(type, 0, first, last);
3282 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
3285 Newxz(tk, 1, TOKEN);
3286 tk->tk_type = (OPCODE)optype;
3287 tk->tk_type = 12345;
3289 tk->tk_mad = madprop;
3294 Perl_token_free(pTHX_ TOKEN* tk)
3296 PERL_ARGS_ASSERT_TOKEN_FREE;
3298 if (tk->tk_type != 12345)
3300 mad_free(tk->tk_mad);
3305 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
3310 PERL_ARGS_ASSERT_TOKEN_GETMAD;
3312 if (tk->tk_type != 12345) {
3313 Perl_warner(aTHX_ packWARN(WARN_MISC),
3314 "Invalid TOKEN object ignored");
3321 /* faked up qw list? */
3323 tm->mad_type == MAD_SV &&
3324 SvPVX((SV *)tm->mad_val)[0] == 'q')
3331 /* pretend constant fold didn't happen? */
3332 if (mp->mad_key == 'f' &&
3333 (o->op_type == OP_CONST ||
3334 o->op_type == OP_GV) )
3336 token_getmad(tk,(OP*)mp->mad_val,slot);
3350 if (mp->mad_key == 'X')
3351 mp->mad_key = slot; /* just change the first one */
3361 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3370 /* pretend constant fold didn't happen? */
3371 if (mp->mad_key == 'f' &&
3372 (o->op_type == OP_CONST ||
3373 o->op_type == OP_GV) )
3375 op_getmad(from,(OP*)mp->mad_val,slot);
3382 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3385 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3391 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3400 /* pretend constant fold didn't happen? */
3401 if (mp->mad_key == 'f' &&
3402 (o->op_type == OP_CONST ||
3403 o->op_type == OP_GV) )
3405 op_getmad(from,(OP*)mp->mad_val,slot);
3412 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3415 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3419 PerlIO_printf(PerlIO_stderr(),
3420 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3426 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3444 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3448 addmad(tm, &(o->op_madprop), slot);
3452 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3473 Perl_newMADsv(pTHX_ char key, SV* sv)
3475 PERL_ARGS_ASSERT_NEWMADSV;
3477 return newMADPROP(key, MAD_SV, sv, 0);
3481 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
3483 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
3486 mp->mad_vlen = vlen;
3487 mp->mad_type = type;
3489 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3494 Perl_mad_free(pTHX_ MADPROP* mp)
3496 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3500 mad_free(mp->mad_next);
3501 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
3502 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3503 switch (mp->mad_type) {
3507 Safefree((char*)mp->mad_val);
3510 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3511 op_free((OP*)mp->mad_val);
3514 sv_free(MUTABLE_SV(mp->mad_val));
3517 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3520 PerlMemShared_free(mp);
3526 =head1 Optree construction
3528 =for apidoc Am|OP *|newNULLLIST
3530 Constructs, checks, and returns a new C<stub> op, which represents an
3531 empty list expression.
3537 Perl_newNULLLIST(pTHX)
3539 return newOP(OP_STUB, 0);
3543 S_force_list(pTHX_ OP *o)
3545 if (!o || o->op_type != OP_LIST)
3546 o = newLISTOP(OP_LIST, 0, o, NULL);
3552 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3554 Constructs, checks, and returns an op of any list type. I<type> is
3555 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3556 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3557 supply up to two ops to be direct children of the list op; they are
3558 consumed by this function and become part of the constructed op tree.
3564 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3569 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3571 NewOp(1101, listop, 1, LISTOP);
3573 listop->op_type = (OPCODE)type;
3574 listop->op_ppaddr = PL_ppaddr[type];
3577 listop->op_flags = (U8)flags;
3581 else if (!first && last)
3584 first->op_sibling = last;
3585 listop->op_first = first;
3586 listop->op_last = last;
3587 if (type == OP_LIST) {
3588 OP* const pushop = newOP(OP_PUSHMARK, 0);
3589 pushop->op_sibling = first;
3590 listop->op_first = pushop;
3591 listop->op_flags |= OPf_KIDS;
3593 listop->op_last = pushop;
3596 return CHECKOP(type, listop);
3600 =for apidoc Am|OP *|newOP|I32 type|I32 flags
3602 Constructs, checks, and returns an op of any base type (any type that
3603 has no extra fields). I<type> is the opcode. I<flags> gives the
3604 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3611 Perl_newOP(pTHX_ I32 type, I32 flags)
3616 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3617 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3618 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3619 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3621 NewOp(1101, o, 1, OP);
3622 o->op_type = (OPCODE)type;
3623 o->op_ppaddr = PL_ppaddr[type];
3624 o->op_flags = (U8)flags;
3626 o->op_latefreed = 0;
3630 o->op_private = (U8)(0 | (flags >> 8));
3631 if (PL_opargs[type] & OA_RETSCALAR)
3633 if (PL_opargs[type] & OA_TARGET)
3634 o->op_targ = pad_alloc(type, SVs_PADTMP);
3635 return CHECKOP(type, o);
3639 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3641 Constructs, checks, and returns an op of any unary type. I<type> is
3642 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3643 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3644 bits, the eight bits of C<op_private>, except that the bit with value 1
3645 is automatically set. I<first> supplies an optional op to be the direct
3646 child of the unary op; it is consumed by this function and become part
3647 of the constructed op tree.
3653 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3658 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3659 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3660 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3661 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3662 || type == OP_SASSIGN
3663 || type == OP_ENTERTRY
3664 || type == OP_NULL );
3667 first = newOP(OP_STUB, 0);
3668 if (PL_opargs[type] & OA_MARK)
3669 first = force_list(first);
3671 NewOp(1101, unop, 1, UNOP);
3672 unop->op_type = (OPCODE)type;
3673 unop->op_ppaddr = PL_ppaddr[type];
3674 unop->op_first = first;
3675 unop->op_flags = (U8)(flags | OPf_KIDS);
3676 unop->op_private = (U8)(1 | (flags >> 8));
3677 unop = (UNOP*) CHECKOP(type, unop);
3681 return fold_constants(op_integerize(op_std_init((OP *) unop)));
3685 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3687 Constructs, checks, and returns an op of any binary type. I<type>
3688 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3689 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3690 the eight bits of C<op_private>, except that the bit with value 1 or
3691 2 is automatically set as required. I<first> and I<last> supply up to
3692 two ops to be the direct children of the binary op; they are consumed
3693 by this function and become part of the constructed op tree.
3699 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3704 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3705 || type == OP_SASSIGN || type == OP_NULL );
3707 NewOp(1101, binop, 1, BINOP);
3710 first = newOP(OP_NULL, 0);
3712 binop->op_type = (OPCODE)type;
3713 binop->op_ppaddr = PL_ppaddr[type];
3714 binop->op_first = first;
3715 binop->op_flags = (U8)(flags | OPf_KIDS);
3718 binop->op_private = (U8)(1 | (flags >> 8));
3721 binop->op_private = (U8)(2 | (flags >> 8));
3722 first->op_sibling = last;
3725 binop = (BINOP*)CHECKOP(type, binop);
3726 if (binop->op_next || binop->op_type != (OPCODE)type)
3729 binop->op_last = binop->op_first->op_sibling;
3731 return fold_constants(op_integerize(op_std_init((OP *)binop)));
3734 static int uvcompare(const void *a, const void *b)
3735 __attribute__nonnull__(1)
3736 __attribute__nonnull__(2)
3737 __attribute__pure__;
3738 static int uvcompare(const void *a, const void *b)
3740 if (*((const UV *)a) < (*(const UV *)b))
3742 if (*((const UV *)a) > (*(const UV *)b))
3744 if (*((const UV *)a+1) < (*(const UV *)b+1))
3746 if (*((const UV *)a+1) > (*(const UV *)b+1))
3752 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3755 SV * const tstr = ((SVOP*)expr)->op_sv;
3758 (repl->op_type == OP_NULL)
3759 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3761 ((SVOP*)repl)->op_sv;
3764 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3765 const U8 *r = (U8*)SvPV_const(rstr, rlen);
3769 register short *tbl;
3771 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3772 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3773 I32 del = o->op_private & OPpTRANS_DELETE;
3776 PERL_ARGS_ASSERT_PMTRANS;
3778 PL_hints |= HINT_BLOCK_SCOPE;
3781 o->op_private |= OPpTRANS_FROM_UTF;
3784 o->op_private |= OPpTRANS_TO_UTF;
3786 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
3787 SV* const listsv = newSVpvs("# comment\n");
3789 const U8* tend = t + tlen;
3790 const U8* rend = r + rlen;
3804 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3805 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
3808 const U32 flags = UTF8_ALLOW_DEFAULT;
3812 t = tsave = bytes_to_utf8(t, &len);
3815 if (!to_utf && rlen) {
3817 r = rsave = bytes_to_utf8(r, &len);
3821 /* There are several snags with this code on EBCDIC:
3822 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3823 2. scan_const() in toke.c has encoded chars in native encoding which makes
3824 ranges at least in EBCDIC 0..255 range the bottom odd.
3828 U8 tmpbuf[UTF8_MAXBYTES+1];
3831 Newx(cp, 2*tlen, UV);
3833 transv = newSVpvs("");
3835 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3837 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
3839 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3843 cp[2*i+1] = cp[2*i];
3847 qsort(cp, i, 2*sizeof(UV), uvcompare);
3848 for (j = 0; j < i; j++) {
3850 diff = val - nextmin;
3852 t = uvuni_to_utf8(tmpbuf,nextmin);
3853 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3855 U8 range_mark = UTF_TO_NATIVE(0xff);
3856 t = uvuni_to_utf8(tmpbuf, val - 1);
3857 sv_catpvn(transv, (char *)&range_mark, 1);
3858 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3865 t = uvuni_to_utf8(tmpbuf,nextmin);
3866 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3868 U8 range_mark = UTF_TO_NATIVE(0xff);
3869 sv_catpvn(transv, (char *)&range_mark, 1);
3871 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
3872 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3873 t = (const U8*)SvPVX_const(transv);
3874 tlen = SvCUR(transv);
3878 else if (!rlen && !del) {
3879 r = t; rlen = tlen; rend = tend;
3882 if ((!rlen && !del) || t == r ||
3883 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
3885 o->op_private |= OPpTRANS_IDENTICAL;
3889 while (t < tend || tfirst <= tlast) {
3890 /* see if we need more "t" chars */
3891 if (tfirst > tlast) {
3892 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3894 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
3896 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3903 /* now see if we need more "r" chars */
3904 if (rfirst > rlast) {
3906 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3908 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
3910 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3919 rfirst = rlast = 0xffffffff;
3923 /* now see which range will peter our first, if either. */
3924 tdiff = tlast - tfirst;
3925 rdiff = rlast - rfirst;
3932 if (rfirst == 0xffffffff) {
3933 diff = tdiff; /* oops, pretend rdiff is infinite */
3935 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
3936 (long)tfirst, (long)tlast);
3938 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
3942 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
3943 (long)tfirst, (long)(tfirst + diff),
3946 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
3947 (long)tfirst, (long)rfirst);
3949 if (rfirst + diff > max)
3950 max = rfirst + diff;
3952 grows = (tfirst < rfirst &&
3953 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
3965 else if (max > 0xff)
3970 PerlMemShared_free(cPVOPo->op_pv);
3971 cPVOPo->op_pv = NULL;
3973 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
3975 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
3976 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
3977 PAD_SETSV(cPADOPo->op_padix, swash);
3979 SvREADONLY_on(swash);
3981 cSVOPo->op_sv = swash;
3983 SvREFCNT_dec(listsv);
3984 SvREFCNT_dec(transv);
3986 if (!del && havefinal && rlen)
3987 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
3988 newSVuv((UV)final), 0);
3991 o->op_private |= OPpTRANS_GROWS;
3997 op_getmad(expr,o,'e');
3998 op_getmad(repl,o,'r');
4006 tbl = (short*)cPVOPo->op_pv;
4008 Zero(tbl, 256, short);
4009 for (i = 0; i < (I32)tlen; i++)
4011 for (i = 0, j = 0; i < 256; i++) {
4013 if (j >= (I32)rlen) {
4022 if (i < 128 && r[j] >= 128)
4032 o->op_private |= OPpTRANS_IDENTICAL;
4034 else if (j >= (I32)rlen)
4039 PerlMemShared_realloc(tbl,
4040 (0x101+rlen-j) * sizeof(short));
4041 cPVOPo->op_pv = (char*)tbl;
4043 tbl[0x100] = (short)(rlen - j);
4044 for (i=0; i < (I32)rlen - j; i++)
4045 tbl[0x101+i] = r[j+i];
4049 if (!rlen && !del) {
4052 o->op_private |= OPpTRANS_IDENTICAL;
4054 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
4055 o->op_private |= OPpTRANS_IDENTICAL;
4057 for (i = 0; i < 256; i++)
4059 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
4060 if (j >= (I32)rlen) {
4062 if (tbl[t[i]] == -1)
4068 if (tbl[t[i]] == -1) {
4069 if (t[i] < 128 && r[j] >= 128)
4076 if(del && rlen == tlen) {
4077 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
4078 } else if(rlen > tlen) {
4079 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
4083 o->op_private |= OPpTRANS_GROWS;
4085 op_getmad(expr,o,'e');
4086 op_getmad(repl,o,'r');
4096 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
4098 Constructs, checks, and returns an op of any pattern matching type.
4099 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
4100 and, shifted up eight bits, the eight bits of C<op_private>.
4106 Perl_newPMOP(pTHX_ I32 type, I32 flags)
4111 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
4113 NewOp(1101, pmop, 1, PMOP);
4114 pmop->op_type = (OPCODE)type;
4115 pmop->op_ppaddr = PL_ppaddr[type];
4116 pmop->op_flags = (U8)flags;
4117 pmop->op_private = (U8)(0 | (flags >> 8));
4119 if (PL_hints & HINT_RE_TAINT)
4120 pmop->op_pmflags |= PMf_RETAINT;
4121 if (PL_hints & HINT_LOCALE) {
4122 set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET);
4124 else if ((! (PL_hints & HINT_BYTES)) && (PL_hints & HINT_UNI_8_BIT)) {
4125 set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET);
4127 if (PL_hints & HINT_RE_FLAGS) {
4128 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4129 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
4131 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
4132 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4133 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0
4135 if (reflags && SvOK(reflags)) {
4136 set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags));
4142 assert(SvPOK(PL_regex_pad[0]));
4143 if (SvCUR(PL_regex_pad[0])) {
4144 /* Pop off the "packed" IV from the end. */
4145 SV *const repointer_list = PL_regex_pad[0];
4146 const char *p = SvEND(repointer_list) - sizeof(IV);
4147 const IV offset = *((IV*)p);
4149 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
4151 SvEND_set(repointer_list, p);
4153 pmop->op_pmoffset = offset;
4154 /* This slot should be free, so assert this: */
4155 assert(PL_regex_pad[offset] == &PL_sv_undef);
4157 SV * const repointer = &PL_sv_undef;
4158 av_push(PL_regex_padav, repointer);
4159 pmop->op_pmoffset = av_len(PL_regex_padav);
4160 PL_regex_pad = AvARRAY(PL_regex_padav);
4164 return CHECKOP(type, pmop);
4167 /* Given some sort of match op o, and an expression expr containing a
4168 * pattern, either compile expr into a regex and attach it to o (if it's
4169 * constant), or convert expr into a runtime regcomp op sequence (if it's
4172 * isreg indicates that the pattern is part of a regex construct, eg
4173 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
4174 * split "pattern", which aren't. In the former case, expr will be a list
4175 * if the pattern contains more than one term (eg /a$b/) or if it contains
4176 * a replacement, ie s/// or tr///.
4180 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
4185 I32 repl_has_vars = 0;
4189 PERL_ARGS_ASSERT_PMRUNTIME;
4192 o->op_type == OP_SUBST
4193 || o->op_type == OP_TRANS || o->op_type == OP_TRANSR
4195 /* last element in list is the replacement; pop it */
4197 repl = cLISTOPx(expr)->op_last;
4198 kid = cLISTOPx(expr)->op_first;
4199 while (kid->op_sibling != repl)
4200 kid = kid->op_sibling;
4201 kid->op_sibling = NULL;
4202 cLISTOPx(expr)->op_last = kid;
4205 if (isreg && expr->op_type == OP_LIST &&
4206 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
4208 /* convert single element list to element */
4209 OP* const oe = expr;
4210 expr = cLISTOPx(oe)->op_first->op_sibling;
4211 cLISTOPx(oe)->op_first->op_sibling = NULL;
4212 cLISTOPx(oe)->op_last = NULL;
4216 if (o->op_type == OP_TRANS || o->op_type == OP_TRANSR) {
4217 return pmtrans(o, expr, repl);
4220 reglist = isreg && expr->op_type == OP_LIST;
4224 PL_hints |= HINT_BLOCK_SCOPE;
4227 if (expr->op_type == OP_CONST) {
4228 SV *pat = ((SVOP*)expr)->op_sv;
4229 U32 pm_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4231 if (o->op_flags & OPf_SPECIAL)
4232 pm_flags |= RXf_SPLIT;
4235 assert (SvUTF8(pat));
4236 } else if (SvUTF8(pat)) {
4237 /* Not doing UTF-8, despite what the SV says. Is this only if we're
4238 trapped in use 'bytes'? */
4239 /* Make a copy of the octet sequence, but without the flag on, as
4240 the compiler now honours the SvUTF8 flag on pat. */
4242 const char *const p = SvPV(pat, len);
4243 pat = newSVpvn_flags(p, len, SVs_TEMP);
4246 PM_SETRE(pm, CALLREGCOMP(pat, pm_flags));
4249 op_getmad(expr,(OP*)pm,'e');
4255 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
4256 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
4258 : OP_REGCMAYBE),0,expr);
4260 NewOp(1101, rcop, 1, LOGOP);
4261 rcop->op_type = OP_REGCOMP;
4262 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
4263 rcop->op_first = scalar(expr);
4264 rcop->op_flags |= OPf_KIDS
4265 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
4266 | (reglist ? OPf_STACKED : 0);
4267 rcop->op_private = 1;
4270 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
4272 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
4273 if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1;
4275 /* establish postfix order */
4276 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
4278 rcop->op_next = expr;
4279 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
4282 rcop->op_next = LINKLIST(expr);
4283 expr->op_next = (OP*)rcop;
4286 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
4291 if (pm->op_pmflags & PMf_EVAL) {
4293 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
4294 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
4296 else if (repl->op_type == OP_CONST)
4300 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
4301 if (curop->op_type == OP_SCOPE
4302 || curop->op_type == OP_LEAVE
4303 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
4304 if (curop->op_type == OP_GV) {
4305 GV * const gv = cGVOPx_gv(curop);
4307 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
4310 else if (curop->op_type == OP_RV2CV)
4312 else if (curop->op_type == OP_RV2SV ||
4313 curop->op_type == OP_RV2AV ||
4314 curop->op_type == OP_RV2HV ||
4315 curop->op_type == OP_RV2GV) {
4316 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
4319 else if (curop->op_type == OP_PADSV ||
4320 curop->op_type == OP_PADAV ||
4321 curop->op_type == OP_PADHV ||
4322 curop->op_type == OP_PADANY)
4326 else if (curop->op_type == OP_PUSHRE)
4327 NOOP; /* Okay here, dangerous in newASSIGNOP */
4337 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
4339 pm->op_pmflags |= PMf_CONST; /* const for long enough */
4340 op_prepend_elem(o->op_type, scalar(repl), o);
4343 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
4344 pm->op_pmflags |= PMf_MAYBE_CONST;
4346 NewOp(1101, rcop, 1, LOGOP);
4347 rcop->op_type = OP_SUBSTCONT;
4348 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
4349 rcop->op_first = scalar(repl);
4350 rcop->op_flags |= OPf_KIDS;
4351 rcop->op_private = 1;
4354 /* establish postfix order */
4355 rcop->op_next = LINKLIST(repl);
4356 repl->op_next = (OP*)rcop;
4358 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
4359 assert(!(pm->op_pmflags & PMf_ONCE));
4360 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
4369 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
4371 Constructs, checks, and returns an op of any type that involves an
4372 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
4373 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
4374 takes ownership of one reference to it.
4380 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
4385 PERL_ARGS_ASSERT_NEWSVOP;
4387 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4388 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4389 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4391 NewOp(1101, svop, 1, SVOP);
4392 svop->op_type = (OPCODE)type;
4393 svop->op_ppaddr = PL_ppaddr[type];
4395 svop->op_next = (OP*)svop;
4396 svop->op_flags = (U8)flags;
4397 if (PL_opargs[type] & OA_RETSCALAR)
4399 if (PL_opargs[type] & OA_TARGET)
4400 svop->op_targ = pad_alloc(type, SVs_PADTMP);
4401 return CHECKOP(type, svop);
4407 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
4409 Constructs, checks, and returns an op of any type that involves a
4410 reference to a pad element. I<type> is the opcode. I<flags> gives the
4411 eight bits of C<op_flags>. A pad slot is automatically allocated, and
4412 is populated with I<sv>; this function takes ownership of one reference
4415 This function only exists if Perl has been compiled to use ithreads.
4421 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
4426 PERL_ARGS_ASSERT_NEWPADOP;
4428 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4429 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4430 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4432 NewOp(1101, padop, 1, PADOP);
4433 padop->op_type = (OPCODE)type;
4434 padop->op_ppaddr = PL_ppaddr[type];
4435 padop->op_padix = pad_alloc(type, SVs_PADTMP);
4436 SvREFCNT_dec(PAD_SVl(padop->op_padix));
4437 PAD_SETSV(padop->op_padix, sv);
4440 padop->op_next = (OP*)padop;
4441 padop->op_flags = (U8)flags;
4442 if (PL_opargs[type] & OA_RETSCALAR)
4444 if (PL_opargs[type] & OA_TARGET)
4445 padop->op_targ = pad_alloc(type, SVs_PADTMP);
4446 return CHECKOP(type, padop);
4449 #endif /* !USE_ITHREADS */
4452 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
4454 Constructs, checks, and returns an op of any type that involves an
4455 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
4456 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
4457 reference; calling this function does not transfer ownership of any
4464 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
4468 PERL_ARGS_ASSERT_NEWGVOP;
4472 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4474 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4479 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
4481 Constructs, checks, and returns an op of any type that involves an
4482 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
4483 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
4484 must have been allocated using L</PerlMemShared_malloc>; the memory will
4485 be freed when the op is destroyed.
4491 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
4496 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4497 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4499 NewOp(1101, pvop, 1, PVOP);
4500 pvop->op_type = (OPCODE)type;
4501 pvop->op_ppaddr = PL_ppaddr[type];
4503 pvop->op_next = (OP*)pvop;
4504 pvop->op_flags = (U8)flags;
4505 if (PL_opargs[type] & OA_RETSCALAR)
4507 if (PL_opargs[type] & OA_TARGET)
4508 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
4509 return CHECKOP(type, pvop);
4517 Perl_package(pTHX_ OP *o)
4520 SV *const sv = cSVOPo->op_sv;
4525 PERL_ARGS_ASSERT_PACKAGE;
4527 save_hptr(&PL_curstash);
4528 save_item(PL_curstname);
4530 PL_curstash = gv_stashsv(sv, GV_ADD);
4532 sv_setsv(PL_curstname, sv);
4534 PL_hints |= HINT_BLOCK_SCOPE;
4535 PL_parser->copline = NOLINE;
4536 PL_parser->expect = XSTATE;
4541 if (!PL_madskills) {
4546 pegop = newOP(OP_NULL,0);
4547 op_getmad(o,pegop,'P');
4553 Perl_package_version( pTHX_ OP *v )
4556 U32 savehints = PL_hints;
4557 PERL_ARGS_ASSERT_PACKAGE_VERSION;
4558 PL_hints &= ~HINT_STRICT_VARS;
4559 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
4560 PL_hints = savehints;
4569 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
4576 OP *pegop = newOP(OP_NULL,0);
4578 SV *use_version = NULL;
4580 PERL_ARGS_ASSERT_UTILIZE;
4582 if (idop->op_type != OP_CONST)
4583 Perl_croak(aTHX_ "Module name must be constant");
4586 op_getmad(idop,pegop,'U');
4591 SV * const vesv = ((SVOP*)version)->op_sv;
4594 op_getmad(version,pegop,'V');
4595 if (!arg && !SvNIOKp(vesv)) {
4602 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
4603 Perl_croak(aTHX_ "Version number must be a constant number");
4605 /* Make copy of idop so we don't free it twice */
4606 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
4608 /* Fake up a method call to VERSION */
4609 meth = newSVpvs_share("VERSION");
4610 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
4611 op_append_elem(OP_LIST,
4612 op_prepend_elem(OP_LIST, pack, list(version)),
4613 newSVOP(OP_METHOD_NAMED, 0, meth)));
4617 /* Fake up an import/unimport */
4618 if (arg && arg->op_type == OP_STUB) {
4620 op_getmad(arg,pegop,'S');
4621 imop = arg; /* no import on explicit () */
4623 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
4624 imop = NULL; /* use 5.0; */
4626 use_version = ((SVOP*)idop)->op_sv;
4628 idop->op_private |= OPpCONST_NOVER;
4634 op_getmad(arg,pegop,'A');
4636 /* Make copy of idop so we don't free it twice */
4637 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
4639 /* Fake up a method call to import/unimport */
4641 ? newSVpvs_share("import") : newSVpvs_share("unimport");
4642 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
4643 op_append_elem(OP_LIST,
4644 op_prepend_elem(OP_LIST, pack, list(arg)),
4645 newSVOP(OP_METHOD_NAMED, 0, meth)));
4648 /* Fake up the BEGIN {}, which does its thing immediately. */
4650 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
4653 op_append_elem(OP_LINESEQ,
4654 op_append_elem(OP_LINESEQ,
4655 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
4656 newSTATEOP(0, NULL, veop)),
4657 newSTATEOP(0, NULL, imop) ));
4660 /* If we request a version >= 5.9.5, load feature.pm with the
4661 * feature bundle that corresponds to the required version. */
4662 use_version = sv_2mortal(new_version(use_version));
4664 if (vcmp(use_version,
4665 sv_2mortal(upg_version(newSVnv(5.009005), FALSE))) >= 0) {
4666 SV *const importsv = vnormal(use_version);
4667 *SvPVX_mutable(importsv) = ':';
4668 ENTER_with_name("load_feature");
4669 Perl_load_module(aTHX_ 0, newSVpvs("feature"), NULL, importsv, NULL);
4670 LEAVE_with_name("load_feature");
4672 /* If a version >= 5.11.0 is requested, strictures are on by default! */
4673 if (vcmp(use_version,
4674 sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) {
4675 PL_hints |= (HINT_STRICT_REFS | HINT_STRICT_SUBS | HINT_STRICT_VARS);
4679 /* The "did you use incorrect case?" warning used to be here.
4680 * The problem is that on case-insensitive filesystems one
4681 * might get false positives for "use" (and "require"):
4682 * "use Strict" or "require CARP" will work. This causes
4683 * portability problems for the script: in case-strict
4684 * filesystems the script will stop working.
4686 * The "incorrect case" warning checked whether "use Foo"
4687 * imported "Foo" to your namespace, but that is wrong, too:
4688 * there is no requirement nor promise in the language that
4689 * a Foo.pm should or would contain anything in package "Foo".
4691 * There is very little Configure-wise that can be done, either:
4692 * the case-sensitivity of the build filesystem of Perl does not
4693 * help in guessing the case-sensitivity of the runtime environment.
4696 PL_hints |= HINT_BLOCK_SCOPE;
4697 PL_parser->copline = NOLINE;
4698 PL_parser->expect = XSTATE;
4699 PL_cop_seqmax++; /* Purely for B::*'s benefit */
4700 if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */
4704 if (!PL_madskills) {
4705 /* FIXME - don't allocate pegop if !PL_madskills */
4714 =head1 Embedding Functions
4716 =for apidoc load_module
4718 Loads the module whose name is pointed to by the string part of name.
4719 Note that the actual module name, not its filename, should be given.
4720 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
4721 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
4722 (or 0 for no flags). ver, if specified, provides version semantics
4723 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
4724 arguments can be used to specify arguments to the module's import()
4725 method, similar to C<use Foo::Bar VERSION LIST>. They must be
4726 terminated with a final NULL pointer. Note that this list can only
4727 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
4728 Otherwise at least a single NULL pointer to designate the default
4729 import list is required.
4734 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
4738 PERL_ARGS_ASSERT_LOAD_MODULE;
4740 va_start(args, ver);
4741 vload_module(flags, name, ver, &args);
4745 #ifdef PERL_IMPLICIT_CONTEXT
4747 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
4751 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
4752 va_start(args, ver);
4753 vload_module(flags, name, ver, &args);
4759 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
4763 OP * const modname = newSVOP(OP_CONST, 0, name);
4765 PERL_ARGS_ASSERT_VLOAD_MODULE;
4767 modname->op_private |= OPpCONST_BARE;
4769 veop = newSVOP(OP_CONST, 0, ver);
4773 if (flags & PERL_LOADMOD_NOIMPORT) {
4774 imop = sawparens(newNULLLIST());
4776 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
4777 imop = va_arg(*args, OP*);
4782 sv = va_arg(*args, SV*);
4784 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
4785 sv = va_arg(*args, SV*);
4789 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
4790 * that it has a PL_parser to play with while doing that, and also
4791 * that it doesn't mess with any existing parser, by creating a tmp
4792 * new parser with lex_start(). This won't actually be used for much,
4793 * since pp_require() will create another parser for the real work. */
4796 SAVEVPTR(PL_curcop);
4797 lex_start(NULL, NULL, LEX_START_SAME_FILTER);
4798 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
4799 veop, modname, imop);
4804 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
4810 PERL_ARGS_ASSERT_DOFILE;
4812 if (!force_builtin) {
4813 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
4814 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
4815 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
4816 gv = gvp ? *gvp : NULL;
4820 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
4821 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
4822 op_append_elem(OP_LIST, term,
4823 scalar(newUNOP(OP_RV2CV, 0,
4824 newGVOP(OP_GV, 0, gv))))));
4827 doop = newUNOP(OP_DOFILE, 0, scalar(term));
4833 =head1 Optree construction
4835 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
4837 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
4838 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
4839 be set automatically, and, shifted up eight bits, the eight bits of
4840 C<op_private>, except that the bit with value 1 or 2 is automatically
4841 set as required. I<listval> and I<subscript> supply the parameters of
4842 the slice; they are consumed by this function and become part of the
4843 constructed op tree.
4849 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
4851 return newBINOP(OP_LSLICE, flags,
4852 list(force_list(subscript)),
4853 list(force_list(listval)) );
4857 S_is_list_assignment(pTHX_ register const OP *o)
4865 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
4866 o = cUNOPo->op_first;
4868 flags = o->op_flags;
4870 if (type == OP_COND_EXPR) {
4871 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
4872 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
4877 yyerror("Assignment to both a list and a scalar");
4881 if (type == OP_LIST &&
4882 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
4883 o->op_private & OPpLVAL_INTRO)
4886 if (type == OP_LIST || flags & OPf_PARENS ||
4887 type == OP_RV2AV || type == OP_RV2HV ||
4888 type == OP_ASLICE || type == OP_HSLICE)
4891 if (type == OP_PADAV || type == OP_PADHV)
4894 if (type == OP_RV2SV)
4901 Helper function for newASSIGNOP to detection commonality between the
4902 lhs and the rhs. Marks all variables with PL_generation. If it
4903 returns TRUE the assignment must be able to handle common variables.
4905 PERL_STATIC_INLINE bool
4906 S_aassign_common_vars(pTHX_ OP* o)
4909 for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) {
4910 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
4911 if (curop->op_type == OP_GV) {
4912 GV *gv = cGVOPx_gv(curop);
4914 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4916 GvASSIGN_GENERATION_set(gv, PL_generation);
4918 else if (curop->op_type == OP_PADSV ||
4919 curop->op_type == OP_PADAV ||
4920 curop->op_type == OP_PADHV ||
4921 curop->op_type == OP_PADANY)
4923 if (PAD_COMPNAME_GEN(curop->op_targ)
4924 == (STRLEN)PL_generation)
4926 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
4929 else if (curop->op_type == OP_RV2CV)
4931 else if (curop->op_type == OP_RV2SV ||
4932 curop->op_type == OP_RV2AV ||
4933 curop->op_type == OP_RV2HV ||
4934 curop->op_type == OP_RV2GV) {
4935 if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */
4938 else if (curop->op_type == OP_PUSHRE) {
4940 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
4941 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
4943 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4945 GvASSIGN_GENERATION_set(gv, PL_generation);
4949 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
4952 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4954 GvASSIGN_GENERATION_set(gv, PL_generation);
4962 if (curop->op_flags & OPf_KIDS) {
4963 if (aassign_common_vars(curop))
4971 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
4973 Constructs, checks, and returns an assignment op. I<left> and I<right>
4974 supply the parameters of the assignment; they are consumed by this
4975 function and become part of the constructed op tree.
4977 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
4978 a suitable conditional optree is constructed. If I<optype> is the opcode
4979 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
4980 performs the binary operation and assigns the result to the left argument.
4981 Either way, if I<optype> is non-zero then I<flags> has no effect.
4983 If I<optype> is zero, then a plain scalar or list assignment is
4984 constructed. Which type of assignment it is is automatically determined.
4985 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
4986 will be set automatically, and, shifted up eight bits, the eight bits
4987 of C<op_private>, except that the bit with value 1 or 2 is automatically
4994 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
5000 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
5001 return newLOGOP(optype, 0,
5002 op_lvalue(scalar(left), optype),
5003 newUNOP(OP_SASSIGN, 0, scalar(right)));
5006 return newBINOP(optype, OPf_STACKED,
5007 op_lvalue(scalar(left), optype), scalar(right));
5011 if (is_list_assignment(left)) {
5012 static const char no_list_state[] = "Initialization of state variables"
5013 " in list context currently forbidden";
5015 bool maybe_common_vars = TRUE;
5018 /* Grandfathering $[ assignment here. Bletch.*/
5019 /* Only simple assignments like C<< ($[) = 1 >> are allowed */
5020 PL_eval_start = (left->op_type == OP_CONST) ? right : NULL;
5021 left = op_lvalue(left, OP_AASSIGN);
5024 else if (left->op_type == OP_CONST) {
5025 deprecate("assignment to $[");
5027 /* Result of assignment is always 1 (or we'd be dead already) */
5028 return newSVOP(OP_CONST, 0, newSViv(1));
5030 curop = list(force_list(left));
5031 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
5032 o->op_private = (U8)(0 | (flags >> 8));
5034 if ((left->op_type == OP_LIST
5035 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
5037 OP* lop = ((LISTOP*)left)->op_first;
5038 maybe_common_vars = FALSE;
5040 if (lop->op_type == OP_PADSV ||
5041 lop->op_type == OP_PADAV ||
5042 lop->op_type == OP_PADHV ||
5043 lop->op_type == OP_PADANY) {
5044 if (!(lop->op_private & OPpLVAL_INTRO))
5045 maybe_common_vars = TRUE;
5047 if (lop->op_private & OPpPAD_STATE) {
5048 if (left->op_private & OPpLVAL_INTRO) {
5049 /* Each variable in state($a, $b, $c) = ... */
5052 /* Each state variable in
5053 (state $a, my $b, our $c, $d, undef) = ... */
5055 yyerror(no_list_state);
5057 /* Each my variable in
5058 (state $a, my $b, our $c, $d, undef) = ... */
5060 } else if (lop->op_type == OP_UNDEF ||
5061 lop->op_type == OP_PUSHMARK) {
5062 /* undef may be interesting in
5063 (state $a, undef, state $c) */
5065 /* Other ops in the list. */
5066 maybe_common_vars = TRUE;
5068 lop = lop->op_sibling;
5071 else if ((left->op_private & OPpLVAL_INTRO)
5072 && ( left->op_type == OP_PADSV
5073 || left->op_type == OP_PADAV
5074 || left->op_type == OP_PADHV
5075 || left->op_type == OP_PADANY))
5077 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
5078 if (left->op_private & OPpPAD_STATE) {
5079 /* All single variable list context state assignments, hence
5089 yyerror(no_list_state);
5093 /* PL_generation sorcery:
5094 * an assignment like ($a,$b) = ($c,$d) is easier than
5095 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
5096 * To detect whether there are common vars, the global var
5097 * PL_generation is incremented for each assign op we compile.
5098 * Then, while compiling the assign op, we run through all the
5099 * variables on both sides of the assignment, setting a spare slot
5100 * in each of them to PL_generation. If any of them already have
5101 * that value, we know we've got commonality. We could use a
5102 * single bit marker, but then we'd have to make 2 passes, first
5103 * to clear the flag, then to test and set it. To find somewhere
5104 * to store these values, evil chicanery is done with SvUVX().
5107 if (maybe_common_vars) {
5109 if (aassign_common_vars(o))
5110 o->op_private |= OPpASSIGN_COMMON;
5114 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
5115 OP* tmpop = ((LISTOP*)right)->op_first;
5116 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
5117 PMOP * const pm = (PMOP*)tmpop;
5118 if (left->op_type == OP_RV2AV &&
5119 !(left->op_private & OPpLVAL_INTRO) &&
5120 !(o->op_private & OPpASSIGN_COMMON) )
5122 tmpop = ((UNOP*)left)->op_first;
5123 if (tmpop->op_type == OP_GV
5125 && !pm->op_pmreplrootu.op_pmtargetoff
5127 && !pm->op_pmreplrootu.op_pmtargetgv
5131 pm->op_pmreplrootu.op_pmtargetoff
5132 = cPADOPx(tmpop)->op_padix;
5133 cPADOPx(tmpop)->op_padix = 0; /* steal it */
5135 pm->op_pmreplrootu.op_pmtargetgv
5136 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
5137 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
5139 pm->op_pmflags |= PMf_ONCE;
5140 tmpop = cUNOPo->op_first; /* to list (nulled) */
5141 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
5142 tmpop->op_sibling = NULL; /* don't free split */
5143 right->op_next = tmpop->op_next; /* fix starting loc */
5144 op_free(o); /* blow off assign */
5145 right->op_flags &= ~OPf_WANT;
5146 /* "I don't know and I don't care." */
5151 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
5152 ((LISTOP*)right)->op_last->op_type == OP_CONST)
5154 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
5155 if (SvIOK(sv) && SvIVX(sv) == 0)
5156 sv_setiv(sv, PL_modcount+1);
5164 right = newOP(OP_UNDEF, 0);
5165 if (right->op_type == OP_READLINE) {
5166 right->op_flags |= OPf_STACKED;
5167 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
5171 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
5172 o = newBINOP(OP_SASSIGN, flags,
5173 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
5177 if (!PL_madskills) { /* assignment to $[ is ignored when making a mad dump */
5178 deprecate("assignment to $[");
5180 o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling)));
5181 o->op_private |= OPpCONST_ARYBASE;
5189 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
5191 Constructs a state op (COP). The state op is normally a C<nextstate> op,
5192 but will be a C<dbstate> op if debugging is enabled for currently-compiled
5193 code. The state op is populated from L</PL_curcop> (or L</PL_compiling>).
5194 If I<label> is non-null, it supplies the name of a label to attach to
5195 the state op; this function takes ownership of the memory pointed at by
5196 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
5199 If I<o> is null, the state op is returned. Otherwise the state op is
5200 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
5201 is consumed by this function and becomes part of the returned op tree.
5207 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
5210 const U32 seq = intro_my();
5213 NewOp(1101, cop, 1, COP);
5214 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
5215 cop->op_type = OP_DBSTATE;
5216 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
5219 cop->op_type = OP_NEXTSTATE;
5220 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
5222 cop->op_flags = (U8)flags;
5223 CopHINTS_set(cop, PL_hints);
5225 cop->op_private |= NATIVE_HINTS;
5227 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
5228 cop->op_next = (OP*)cop;
5231 /* CopARYBASE is now "virtual", in that it's stored as a flag bit in
5232 CopHINTS and a possible value in cop_hints_hash, so no need to copy it.
5234 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
5235 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
5237 Perl_cop_store_label(aTHX_ cop, label, strlen(label), 0);
5239 PL_hints |= HINT_BLOCK_SCOPE;
5240 /* It seems that we need to defer freeing this pointer, as other parts
5241 of the grammar end up wanting to copy it after this op has been
5246 if (PL_parser && PL_parser->copline == NOLINE)
5247 CopLINE_set(cop, CopLINE(PL_curcop));
5249 CopLINE_set(cop, PL_parser->copline);
5251 PL_parser->copline = NOLINE;
5254 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
5256 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
5258 CopSTASH_set(cop, PL_curstash);
5260 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
5261 /* this line can have a breakpoint - store the cop in IV */
5262 AV *av = CopFILEAVx(PL_curcop);
5264 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
5265 if (svp && *svp != &PL_sv_undef ) {
5266 (void)SvIOK_on(*svp);
5267 SvIV_set(*svp, PTR2IV(cop));
5272 if (flags & OPf_SPECIAL)
5274 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
5278 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
5280 Constructs, checks, and returns a logical (flow control) op. I<type>
5281 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
5282 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
5283 the eight bits of C<op_private>, except that the bit with value 1 is
5284 automatically set. I<first> supplies the expression controlling the
5285 flow, and I<other> supplies the side (alternate) chain of ops; they are
5286 consumed by this function and become part of the constructed op tree.
5292 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
5296 PERL_ARGS_ASSERT_NEWLOGOP;
5298 return new_logop(type, flags, &first, &other);
5302 S_search_const(pTHX_ OP *o)
5304 PERL_ARGS_ASSERT_SEARCH_CONST;
5306 switch (o->op_type) {
5310 if (o->op_flags & OPf_KIDS)
5311 return search_const(cUNOPo->op_first);
5318 if (!(o->op_flags & OPf_KIDS))
5320 kid = cLISTOPo->op_first;
5322 switch (kid->op_type) {
5326 kid = kid->op_sibling;
5329 if (kid != cLISTOPo->op_last)
5335 kid = cLISTOPo->op_last;
5337 return search_const(kid);
5345 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
5353 int prepend_not = 0;
5355 PERL_ARGS_ASSERT_NEW_LOGOP;
5360 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
5361 return newBINOP(type, flags, scalar(first), scalar(other));
5363 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
5365 scalarboolean(first);
5366 /* optimize AND and OR ops that have NOTs as children */
5367 if (first->op_type == OP_NOT
5368 && (first->op_flags & OPf_KIDS)
5369 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
5370 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
5372 if (type == OP_AND || type == OP_OR) {
5378 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
5380 prepend_not = 1; /* prepend a NOT op later */
5384 /* search for a constant op that could let us fold the test */
5385 if ((cstop = search_const(first))) {
5386 if (cstop->op_private & OPpCONST_STRICT)
5387 no_bareword_allowed(cstop);
5388 else if ((cstop->op_private & OPpCONST_BARE))
5389 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
5390 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
5391 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
5392 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
5394 if (other->op_type == OP_CONST)
5395 other->op_private |= OPpCONST_SHORTCIRCUIT;
5397 OP *newop = newUNOP(OP_NULL, 0, other);
5398 op_getmad(first, newop, '1');
5399 newop->op_targ = type; /* set "was" field */
5403 if (other->op_type == OP_LEAVE)
5404 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
5405 else if (other->op_type == OP_MATCH
5406 || other->op_type == OP_SUBST
5407 || other->op_type == OP_TRANSR
5408 || other->op_type == OP_TRANS)
5409 /* Mark the op as being unbindable with =~ */
5410 other->op_flags |= OPf_SPECIAL;
5414 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
5415 const OP *o2 = other;
5416 if ( ! (o2->op_type == OP_LIST
5417 && (( o2 = cUNOPx(o2)->op_first))
5418 && o2->op_type == OP_PUSHMARK
5419 && (( o2 = o2->op_sibling)) )
5422 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
5423 || o2->op_type == OP_PADHV)
5424 && o2->op_private & OPpLVAL_INTRO
5425 && !(o2->op_private & OPpPAD_STATE))
5427 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
5428 "Deprecated use of my() in false conditional");
5432 if (first->op_type == OP_CONST)
5433 first->op_private |= OPpCONST_SHORTCIRCUIT;
5435 first = newUNOP(OP_NULL, 0, first);
5436 op_getmad(other, first, '2');
5437 first->op_targ = type; /* set "was" field */
5444 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
5445 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
5447 const OP * const k1 = ((UNOP*)first)->op_first;
5448 const OP * const k2 = k1->op_sibling;
5450 switch (first->op_type)
5453 if (k2 && k2->op_type == OP_READLINE
5454 && (k2->op_flags & OPf_STACKED)
5455 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5457 warnop = k2->op_type;
5462 if (k1->op_type == OP_READDIR
5463 || k1->op_type == OP_GLOB
5464 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5465 || k1->op_type == OP_EACH
5466 || k1->op_type == OP_AEACH)
5468 warnop = ((k1->op_type == OP_NULL)
5469 ? (OPCODE)k1->op_targ : k1->op_type);
5474 const line_t oldline = CopLINE(PL_curcop);
5475 CopLINE_set(PL_curcop, PL_parser->copline);
5476 Perl_warner(aTHX_ packWARN(WARN_MISC),
5477 "Value of %s%s can be \"0\"; test with defined()",
5479 ((warnop == OP_READLINE || warnop == OP_GLOB)
5480 ? " construct" : "() operator"));
5481 CopLINE_set(PL_curcop, oldline);
5488 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
5489 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
5491 NewOp(1101, logop, 1, LOGOP);
5493 logop->op_type = (OPCODE)type;
5494 logop->op_ppaddr = PL_ppaddr[type];
5495 logop->op_first = first;
5496 logop->op_flags = (U8)(flags | OPf_KIDS);
5497 logop->op_other = LINKLIST(other);
5498 logop->op_private = (U8)(1 | (flags >> 8));
5500 /* establish postfix order */
5501 logop->op_next = LINKLIST(first);
5502 first->op_next = (OP*)logop;
5503 first->op_sibling = other;
5505 CHECKOP(type,logop);
5507 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
5514 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
5516 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
5517 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5518 will be set automatically, and, shifted up eight bits, the eight bits of
5519 C<op_private>, except that the bit with value 1 is automatically set.
5520 I<first> supplies the expression selecting between the two branches,
5521 and I<trueop> and I<falseop> supply the branches; they are consumed by
5522 this function and become part of the constructed op tree.
5528 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
5536 PERL_ARGS_ASSERT_NEWCONDOP;
5539 return newLOGOP(OP_AND, 0, first, trueop);
5541 return newLOGOP(OP_OR, 0, first, falseop);
5543 scalarboolean(first);
5544 if ((cstop = search_const(first))) {
5545 /* Left or right arm of the conditional? */
5546 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
5547 OP *live = left ? trueop : falseop;
5548 OP *const dead = left ? falseop : trueop;
5549 if (cstop->op_private & OPpCONST_BARE &&
5550 cstop->op_private & OPpCONST_STRICT) {
5551 no_bareword_allowed(cstop);
5554 /* This is all dead code when PERL_MAD is not defined. */
5555 live = newUNOP(OP_NULL, 0, live);
5556 op_getmad(first, live, 'C');
5557 op_getmad(dead, live, left ? 'e' : 't');
5562 if (live->op_type == OP_LEAVE)
5563 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
5564 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
5565 || live->op_type == OP_TRANS || live->op_type == OP_TRANSR)
5566 /* Mark the op as being unbindable with =~ */
5567 live->op_flags |= OPf_SPECIAL;
5570 NewOp(1101, logop, 1, LOGOP);
5571 logop->op_type = OP_COND_EXPR;
5572 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
5573 logop->op_first = first;
5574 logop->op_flags = (U8)(flags | OPf_KIDS);
5575 logop->op_private = (U8)(1 | (flags >> 8));
5576 logop->op_other = LINKLIST(trueop);
5577 logop->op_next = LINKLIST(falseop);
5579 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
5582 /* establish postfix order */
5583 start = LINKLIST(first);
5584 first->op_next = (OP*)logop;
5586 first->op_sibling = trueop;
5587 trueop->op_sibling = falseop;
5588 o = newUNOP(OP_NULL, 0, (OP*)logop);
5590 trueop->op_next = falseop->op_next = o;
5597 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
5599 Constructs and returns a C<range> op, with subordinate C<flip> and
5600 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
5601 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
5602 for both the C<flip> and C<range> ops, except that the bit with value
5603 1 is automatically set. I<left> and I<right> supply the expressions
5604 controlling the endpoints of the range; they are consumed by this function
5605 and become part of the constructed op tree.
5611 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
5620 PERL_ARGS_ASSERT_NEWRANGE;
5622 NewOp(1101, range, 1, LOGOP);
5624 range->op_type = OP_RANGE;
5625 range->op_ppaddr = PL_ppaddr[OP_RANGE];
5626 range->op_first = left;
5627 range->op_flags = OPf_KIDS;
5628 leftstart = LINKLIST(left);
5629 range->op_other = LINKLIST(right);
5630 range->op_private = (U8)(1 | (flags >> 8));
5632 left->op_sibling = right;
5634 range->op_next = (OP*)range;
5635 flip = newUNOP(OP_FLIP, flags, (OP*)range);
5636 flop = newUNOP(OP_FLOP, 0, flip);
5637 o = newUNOP(OP_NULL, 0, flop);
5639 range->op_next = leftstart;
5641 left->op_next = flip;
5642 right->op_next = flop;
5644 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
5645 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
5646 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
5647 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
5649 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
5650 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
5652 /* check barewords before they might be optimized aways */
5653 if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT)
5654 no_bareword_allowed(left);
5655 if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT)
5656 no_bareword_allowed(right);
5659 if (!flip->op_private || !flop->op_private)
5660 LINKLIST(o); /* blow off optimizer unless constant */
5666 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
5668 Constructs, checks, and returns an op tree expressing a loop. This is
5669 only a loop in the control flow through the op tree; it does not have
5670 the heavyweight loop structure that allows exiting the loop by C<last>
5671 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
5672 top-level op, except that some bits will be set automatically as required.
5673 I<expr> supplies the expression controlling loop iteration, and I<block>
5674 supplies the body of the loop; they are consumed by this function and
5675 become part of the constructed op tree. I<debuggable> is currently
5676 unused and should always be 1.
5682 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
5687 const bool once = block && block->op_flags & OPf_SPECIAL &&
5688 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
5690 PERL_UNUSED_ARG(debuggable);
5693 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
5694 return block; /* do {} while 0 does once */
5695 if (expr->op_type == OP_READLINE
5696 || expr->op_type == OP_READDIR
5697 || expr->op_type == OP_GLOB
5698 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
5699 expr = newUNOP(OP_DEFINED, 0,
5700 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
5701 } else if (expr->op_flags & OPf_KIDS) {
5702 const OP * const k1 = ((UNOP*)expr)->op_first;
5703 const OP * const k2 = k1 ? k1->op_sibling : NULL;
5704 switch (expr->op_type) {
5706 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
5707 && (k2->op_flags & OPf_STACKED)
5708 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5709 expr = newUNOP(OP_DEFINED, 0, expr);
5713 if (k1 && (k1->op_type == OP_READDIR
5714 || k1->op_type == OP_GLOB
5715 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5716 || k1->op_type == OP_EACH
5717 || k1->op_type == OP_AEACH))
5718 expr = newUNOP(OP_DEFINED, 0, expr);
5724 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
5725 * op, in listop. This is wrong. [perl #27024] */
5727 block = newOP(OP_NULL, 0);
5728 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
5729 o = new_logop(OP_AND, 0, &expr, &listop);
5732 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
5734 if (once && o != listop)
5735 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
5738 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
5740 o->op_flags |= flags;
5742 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
5747 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
5749 Constructs, checks, and returns an op tree expressing a C<while> loop.
5750 This is a heavyweight loop, with structure that allows exiting the loop
5751 by C<last> and suchlike.
5753 I<loop> is an optional preconstructed C<enterloop> op to use in the
5754 loop; if it is null then a suitable op will be constructed automatically.
5755 I<expr> supplies the loop's controlling expression. I<block> supplies the
5756 main body of the loop, and I<cont> optionally supplies a C<continue> block
5757 that operates as a second half of the body. All of these optree inputs
5758 are consumed by this function and become part of the constructed op tree.
5760 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
5761 op and, shifted up eight bits, the eight bits of C<op_private> for
5762 the C<leaveloop> op, except that (in both cases) some bits will be set
5763 automatically. I<debuggable> is currently unused and should always be 1.
5764 I<has_my> can be supplied as true to force the
5765 loop body to be enclosed in its own scope.
5771 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
5772 OP *expr, OP *block, OP *cont, I32 has_my)
5781 PERL_UNUSED_ARG(debuggable);
5784 if (expr->op_type == OP_READLINE
5785 || expr->op_type == OP_READDIR
5786 || expr->op_type == OP_GLOB
5787 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
5788 expr = newUNOP(OP_DEFINED, 0,
5789 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
5790 } else if (expr->op_flags & OPf_KIDS) {
5791 const OP * const k1 = ((UNOP*)expr)->op_first;
5792 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
5793 switch (expr->op_type) {
5795 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
5796 && (k2->op_flags & OPf_STACKED)
5797 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5798 expr = newUNOP(OP_DEFINED, 0, expr);
5802 if (k1 && (k1->op_type == OP_READDIR
5803 || k1->op_type == OP_GLOB
5804 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5805 || k1->op_type == OP_EACH
5806 || k1->op_type == OP_AEACH))
5807 expr = newUNOP(OP_DEFINED, 0, expr);
5814 block = newOP(OP_NULL, 0);
5815 else if (cont || has_my) {
5816 block = op_scope(block);
5820 next = LINKLIST(cont);
5823 OP * const unstack = newOP(OP_UNSTACK, 0);
5826 cont = op_append_elem(OP_LINESEQ, cont, unstack);
5830 listop = op_append_list(OP_LINESEQ, block, cont);
5832 redo = LINKLIST(listop);
5836 o = new_logop(OP_AND, 0, &expr, &listop);
5837 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
5838 op_free(expr); /* oops, it's a while (0) */
5840 return NULL; /* listop already freed by new_logop */
5843 ((LISTOP*)listop)->op_last->op_next =
5844 (o == listop ? redo : LINKLIST(o));
5850 NewOp(1101,loop,1,LOOP);
5851 loop->op_type = OP_ENTERLOOP;
5852 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
5853 loop->op_private = 0;
5854 loop->op_next = (OP*)loop;
5857 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
5859 loop->op_redoop = redo;
5860 loop->op_lastop = o;
5861 o->op_private |= loopflags;
5864 loop->op_nextop = next;
5866 loop->op_nextop = o;
5868 o->op_flags |= flags;
5869 o->op_private |= (flags >> 8);
5874 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
5876 Constructs, checks, and returns an op tree expressing a C<foreach>
5877 loop (iteration through a list of values). This is a heavyweight loop,
5878 with structure that allows exiting the loop by C<last> and suchlike.
5880 I<sv> optionally supplies the variable that will be aliased to each
5881 item in turn; if null, it defaults to C<$_> (either lexical or global).
5882 I<expr> supplies the list of values to iterate over. I<block> supplies
5883 the main body of the loop, and I<cont> optionally supplies a C<continue>
5884 block that operates as a second half of the body. All of these optree
5885 inputs are consumed by this function and become part of the constructed
5888 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
5889 op and, shifted up eight bits, the eight bits of C<op_private> for
5890 the C<leaveloop> op, except that (in both cases) some bits will be set
5897 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
5902 PADOFFSET padoff = 0;
5907 PERL_ARGS_ASSERT_NEWFOROP;
5910 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
5911 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
5912 sv->op_type = OP_RV2GV;
5913 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
5915 /* The op_type check is needed to prevent a possible segfault
5916 * if the loop variable is undeclared and 'strict vars' is in
5917 * effect. This is illegal but is nonetheless parsed, so we
5918 * may reach this point with an OP_CONST where we're expecting
5921 if (cUNOPx(sv)->op_first->op_type == OP_GV
5922 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
5923 iterpflags |= OPpITER_DEF;
5925 else if (sv->op_type == OP_PADSV) { /* private variable */
5926 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
5927 padoff = sv->op_targ;
5937 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
5939 SV *const namesv = PAD_COMPNAME_SV(padoff);
5941 const char *const name = SvPV_const(namesv, len);
5943 if (len == 2 && name[0] == '$' && name[1] == '_')
5944 iterpflags |= OPpITER_DEF;
5948 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
5949 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
5950 sv = newGVOP(OP_GV, 0, PL_defgv);
5955 iterpflags |= OPpITER_DEF;
5957 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
5958 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
5959 iterflags |= OPf_STACKED;
5961 else if (expr->op_type == OP_NULL &&
5962 (expr->op_flags & OPf_KIDS) &&
5963 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
5965 /* Basically turn for($x..$y) into the same as for($x,$y), but we
5966 * set the STACKED flag to indicate that these values are to be
5967 * treated as min/max values by 'pp_iterinit'.
5969 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
5970 LOGOP* const range = (LOGOP*) flip->op_first;
5971 OP* const left = range->op_first;
5972 OP* const right = left->op_sibling;
5975 range->op_flags &= ~OPf_KIDS;
5976 range->op_first = NULL;
5978 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
5979 listop->op_first->op_next = range->op_next;
5980 left->op_next = range->op_other;
5981 right->op_next = (OP*)listop;
5982 listop->op_next = listop->op_first;
5985 op_getmad(expr,(OP*)listop,'O');
5989 expr = (OP*)(listop);
5991 iterflags |= OPf_STACKED;
5994 expr = op_lvalue(force_list(expr), OP_GREPSTART);
5997 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
5998 op_append_elem(OP_LIST, expr, scalar(sv))));
5999 assert(!loop->op_next);
6000 /* for my $x () sets OPpLVAL_INTRO;
6001 * for our $x () sets OPpOUR_INTRO */
6002 loop->op_private = (U8)iterpflags;
6003 #ifdef PL_OP_SLAB_ALLOC
6006 NewOp(1234,tmp,1,LOOP);
6007 Copy(loop,tmp,1,LISTOP);
6008 S_op_destroy(aTHX_ (OP*)loop);
6012 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
6014 loop->op_targ = padoff;
6015 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
6017 op_getmad(madsv, (OP*)loop, 'v');
6022 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
6024 Constructs, checks, and returns a loop-exiting op (such as C<goto>
6025 or C<last>). I<type> is the opcode. I<label> supplies the parameter
6026 determining the target of the op; it is consumed by this function and
6027 become part of the constructed op tree.
6033 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
6038 PERL_ARGS_ASSERT_NEWLOOPEX;
6040 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
6042 if (type != OP_GOTO || label->op_type == OP_CONST) {
6043 /* "last()" means "last" */
6044 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
6045 o = newOP(type, OPf_SPECIAL);
6047 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
6048 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
6052 op_getmad(label,o,'L');
6058 /* Check whether it's going to be a goto &function */
6059 if (label->op_type == OP_ENTERSUB
6060 && !(label->op_flags & OPf_STACKED))
6061 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
6062 o = newUNOP(type, OPf_STACKED, label);
6064 PL_hints |= HINT_BLOCK_SCOPE;
6068 /* if the condition is a literal array or hash
6069 (or @{ ... } etc), make a reference to it.
6072 S_ref_array_or_hash(pTHX_ OP *cond)
6075 && (cond->op_type == OP_RV2AV
6076 || cond->op_type == OP_PADAV
6077 || cond->op_type == OP_RV2HV
6078 || cond->op_type == OP_PADHV))
6080 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
6083 && (cond->op_type == OP_ASLICE
6084 || cond->op_type == OP_HSLICE)) {
6086 /* anonlist now needs a list from this op, was previously used in
6088 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
6089 cond->op_flags |= OPf_WANT_LIST;
6091 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
6098 /* These construct the optree fragments representing given()
6101 entergiven and enterwhen are LOGOPs; the op_other pointer
6102 points up to the associated leave op. We need this so we
6103 can put it in the context and make break/continue work.
6104 (Also, of course, pp_enterwhen will jump straight to
6105 op_other if the match fails.)
6109 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
6110 I32 enter_opcode, I32 leave_opcode,
6111 PADOFFSET entertarg)
6117 PERL_ARGS_ASSERT_NEWGIVWHENOP;
6119 NewOp(1101, enterop, 1, LOGOP);
6120 enterop->op_type = (Optype)enter_opcode;
6121 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
6122 enterop->op_flags = (U8) OPf_KIDS;
6123 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
6124 enterop->op_private = 0;
6126 o = newUNOP(leave_opcode, 0, (OP *) enterop);
6129 enterop->op_first = scalar(cond);
6130 cond->op_sibling = block;
6132 o->op_next = LINKLIST(cond);
6133 cond->op_next = (OP *) enterop;
6136 /* This is a default {} block */
6137 enterop->op_first = block;
6138 enterop->op_flags |= OPf_SPECIAL;
6140 o->op_next = (OP *) enterop;
6143 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
6144 entergiven and enterwhen both
6147 enterop->op_next = LINKLIST(block);
6148 block->op_next = enterop->op_other = o;
6153 /* Does this look like a boolean operation? For these purposes
6154 a boolean operation is:
6155 - a subroutine call [*]
6156 - a logical connective
6157 - a comparison operator
6158 - a filetest operator, with the exception of -s -M -A -C
6159 - defined(), exists() or eof()
6160 - /$re/ or $foo =~ /$re/
6162 [*] possibly surprising
6165 S_looks_like_bool(pTHX_ const OP *o)
6169 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
6171 switch(o->op_type) {
6174 return looks_like_bool(cLOGOPo->op_first);
6178 looks_like_bool(cLOGOPo->op_first)
6179 && looks_like_bool(cLOGOPo->op_first->op_sibling));
6184 o->op_flags & OPf_KIDS
6185 && looks_like_bool(cUNOPo->op_first));
6189 case OP_NOT: case OP_XOR:
6191 case OP_EQ: case OP_NE: case OP_LT:
6192 case OP_GT: case OP_LE: case OP_GE:
6194 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
6195 case OP_I_GT: case OP_I_LE: case OP_I_GE:
6197 case OP_SEQ: case OP_SNE: case OP_SLT:
6198 case OP_SGT: case OP_SLE: case OP_SGE:
6202 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
6203 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
6204 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
6205 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
6206 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
6207 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
6208 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
6209 case OP_FTTEXT: case OP_FTBINARY:
6211 case OP_DEFINED: case OP_EXISTS:
6212 case OP_MATCH: case OP_EOF:
6219 /* Detect comparisons that have been optimized away */
6220 if (cSVOPo->op_sv == &PL_sv_yes
6221 || cSVOPo->op_sv == &PL_sv_no)
6234 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
6236 Constructs, checks, and returns an op tree expressing a C<given> block.
6237 I<cond> supplies the expression that will be locally assigned to a lexical
6238 variable, and I<block> supplies the body of the C<given> construct; they
6239 are consumed by this function and become part of the constructed op tree.
6240 I<defsv_off> is the pad offset of the scalar lexical variable that will
6247 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
6250 PERL_ARGS_ASSERT_NEWGIVENOP;
6251 return newGIVWHENOP(
6252 ref_array_or_hash(cond),
6254 OP_ENTERGIVEN, OP_LEAVEGIVEN,
6259 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
6261 Constructs, checks, and returns an op tree expressing a C<when> block.
6262 I<cond> supplies the test expression, and I<block> supplies the block
6263 that will be executed if the test evaluates to true; they are consumed
6264 by this function and become part of the constructed op tree. I<cond>
6265 will be interpreted DWIMically, often as a comparison against C<$_>,
6266 and may be null to generate a C<default> block.
6272 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
6274 const bool cond_llb = (!cond || looks_like_bool(cond));
6277 PERL_ARGS_ASSERT_NEWWHENOP;
6282 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
6284 scalar(ref_array_or_hash(cond)));
6287 return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0);
6291 Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p,
6294 PERL_ARGS_ASSERT_CV_CKPROTO_LEN;
6296 if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */
6297 || (p && (len != SvCUR(cv) /* Not the same length. */
6298 || memNE(p, SvPVX_const(cv), len))))
6299 && ckWARN_d(WARN_PROTOTYPE)) {
6300 SV* const msg = sv_newmortal();
6304 gv_efullname3(name = sv_newmortal(), gv, NULL);
6305 sv_setpvs(msg, "Prototype mismatch:");
6307 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
6309 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv));
6311 sv_catpvs(msg, ": none");
6312 sv_catpvs(msg, " vs ");
6314 Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p);
6316 sv_catpvs(msg, "none");
6317 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
6321 static void const_sv_xsub(pTHX_ CV* cv);
6325 =head1 Optree Manipulation Functions
6327 =for apidoc cv_const_sv
6329 If C<cv> is a constant sub eligible for inlining. returns the constant
6330 value returned by the sub. Otherwise, returns NULL.
6332 Constant subs can be created with C<newCONSTSUB> or as described in
6333 L<perlsub/"Constant Functions">.
6338 Perl_cv_const_sv(pTHX_ const CV *const cv)
6340 PERL_UNUSED_CONTEXT;
6343 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
6345 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6348 /* op_const_sv: examine an optree to determine whether it's in-lineable.
6349 * Can be called in 3 ways:
6352 * look for a single OP_CONST with attached value: return the value
6354 * cv && CvCLONE(cv) && !CvCONST(cv)
6356 * examine the clone prototype, and if contains only a single
6357 * OP_CONST referencing a pad const, or a single PADSV referencing
6358 * an outer lexical, return a non-zero value to indicate the CV is
6359 * a candidate for "constizing" at clone time
6363 * We have just cloned an anon prototype that was marked as a const
6364 * candidate. Try to grab the current value, and in the case of
6365 * PADSV, ignore it if it has multiple references. Return the value.
6369 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
6380 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
6381 o = cLISTOPo->op_first->op_sibling;
6383 for (; o; o = o->op_next) {
6384 const OPCODE type = o->op_type;
6386 if (sv && o->op_next == o)
6388 if (o->op_next != o) {
6389 if (type == OP_NEXTSTATE
6390 || (type == OP_NULL && !(o->op_flags & OPf_KIDS))
6391 || type == OP_PUSHMARK)
6393 if (type == OP_DBSTATE)
6396 if (type == OP_LEAVESUB || type == OP_RETURN)
6400 if (type == OP_CONST && cSVOPo->op_sv)
6402 else if (cv && type == OP_CONST) {
6403 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6407 else if (cv && type == OP_PADSV) {
6408 if (CvCONST(cv)) { /* newly cloned anon */
6409 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6410 /* the candidate should have 1 ref from this pad and 1 ref
6411 * from the parent */
6412 if (!sv || SvREFCNT(sv) != 2)
6419 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
6420 sv = &PL_sv_undef; /* an arbitrary non-null value */
6435 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6438 /* This would be the return value, but the return cannot be reached. */
6439 OP* pegop = newOP(OP_NULL, 0);
6442 PERL_UNUSED_ARG(floor);
6452 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
6454 NORETURN_FUNCTION_END;
6459 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6464 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
6465 register CV *cv = NULL;
6467 /* If the subroutine has no body, no attributes, and no builtin attributes
6468 then it's just a sub declaration, and we may be able to get away with
6469 storing with a placeholder scalar in the symbol table, rather than a
6470 full GV and CV. If anything is present then it will take a full CV to
6472 const I32 gv_fetch_flags
6473 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6475 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
6476 const char * const name = o ? SvPV_nolen_const(cSVOPo->op_sv) : NULL;
6480 assert(proto->op_type == OP_CONST);
6481 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
6487 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
6489 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
6490 SV * const sv = sv_newmortal();
6491 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
6492 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
6493 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
6494 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
6496 } else if (PL_curstash) {
6497 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
6500 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
6504 if (!PL_madskills) {
6513 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
6514 maximum a prototype before. */
6515 if (SvTYPE(gv) > SVt_NULL) {
6516 if (!SvPOK((const SV *)gv)
6517 && !(SvIOK((const SV *)gv) && SvIVX((const SV *)gv) == -1))
6519 Perl_ck_warner_d(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
6521 cv_ckproto_len((const CV *)gv, NULL, ps, ps_len);
6524 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
6526 sv_setiv(MUTABLE_SV(gv), -1);
6528 SvREFCNT_dec(PL_compcv);
6529 cv = PL_compcv = NULL;
6533 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
6535 if (!block || !ps || *ps || attrs
6536 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6538 || block->op_type == OP_NULL
6543 const_sv = op_const_sv(block, NULL);
6546 const bool exists = CvROOT(cv) || CvXSUB(cv);
6548 /* if the subroutine doesn't exist and wasn't pre-declared
6549 * with a prototype, assume it will be AUTOLOADed,
6550 * skipping the prototype check
6552 if (exists || SvPOK(cv))
6553 cv_ckproto_len(cv, gv, ps, ps_len);
6554 /* already defined (or promised)? */
6555 if (exists || GvASSUMECV(gv)) {
6558 || block->op_type == OP_NULL
6561 if (CvFLAGS(PL_compcv)) {
6562 /* might have had built-in attrs applied */
6563 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
6564 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl
6565 && ckWARN(WARN_MISC))
6566 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
6568 (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS
6569 & ~(CVf_LVALUE * pureperl));
6571 if (attrs) goto attrs;
6572 /* just a "sub foo;" when &foo is already defined */
6573 SAVEFREESV(PL_compcv);
6578 && block->op_type != OP_NULL
6581 if (ckWARN(WARN_REDEFINE)
6583 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
6585 const line_t oldline = CopLINE(PL_curcop);
6586 if (PL_parser && PL_parser->copline != NOLINE)
6587 CopLINE_set(PL_curcop, PL_parser->copline);
6588 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6589 CvCONST(cv) ? "Constant subroutine %s redefined"
6590 : "Subroutine %s redefined", name);
6591 CopLINE_set(PL_curcop, oldline);
6594 if (!PL_minus_c) /* keep old one around for madskills */
6597 /* (PL_madskills unset in used file.) */
6605 SvREFCNT_inc_simple_void_NN(const_sv);
6607 assert(!CvROOT(cv) && !CvCONST(cv));
6608 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
6609 CvXSUBANY(cv).any_ptr = const_sv;
6610 CvXSUB(cv) = const_sv_xsub;
6616 cv = newCONSTSUB(NULL, name, const_sv);
6618 mro_method_changed_in( /* sub Foo::Bar () { 123 } */
6619 (CvGV(cv) && GvSTASH(CvGV(cv)))
6628 SvREFCNT_dec(PL_compcv);
6632 if (cv) { /* must reuse cv if autoloaded */
6633 /* transfer PL_compcv to cv */
6636 && block->op_type != OP_NULL
6639 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
6640 AV *const temp_av = CvPADLIST(cv);
6641 CV *const temp_cv = CvOUTSIDE(cv);
6643 assert(!CvWEAKOUTSIDE(cv));
6644 assert(!CvCVGV_RC(cv));
6645 assert(CvGV(cv) == gv);
6648 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
6649 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
6650 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
6651 CvPADLIST(cv) = CvPADLIST(PL_compcv);
6652 CvOUTSIDE(PL_compcv) = temp_cv;
6653 CvPADLIST(PL_compcv) = temp_av;
6655 if (CvFILE(cv) && CvDYNFILE(cv)) {
6656 Safefree(CvFILE(cv));
6658 CvFILE_set_from_cop(cv, PL_curcop);
6659 CvSTASH_set(cv, PL_curstash);
6661 /* inner references to PL_compcv must be fixed up ... */
6662 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
6663 if (PERLDB_INTER)/* Advice debugger on the new sub. */
6664 ++PL_sub_generation;
6667 /* Might have had built-in attributes applied -- propagate them. */
6668 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
6670 /* ... before we throw it away */
6671 SvREFCNT_dec(PL_compcv);
6679 if (strEQ(name, "import")) {
6680 PL_formfeed = MUTABLE_SV(cv);
6681 /* diag_listed_as: SKIPME */
6682 Perl_warner(aTHX_ packWARN(WARN_VOID), "0x%"UVxf"\n", PTR2UV(cv));
6686 mro_method_changed_in(GvSTASH(gv)); /* sub Foo::bar { (shift)+1 } */
6691 CvFILE_set_from_cop(cv, PL_curcop);
6692 CvSTASH_set(cv, PL_curstash);
6696 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
6697 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
6698 apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE);
6702 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
6704 if (PL_parser && PL_parser->error_count) {
6708 const char *s = strrchr(name, ':');
6710 if (strEQ(s, "BEGIN")) {
6711 const char not_safe[] =
6712 "BEGIN not safe after errors--compilation aborted";
6713 if (PL_in_eval & EVAL_KEEPERR)
6714 Perl_croak(aTHX_ not_safe);
6716 /* force display of errors found but not reported */
6717 sv_catpv(ERRSV, not_safe);
6718 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
6727 /* If we assign an optree to a PVCV, then we've defined a subroutine that
6728 the debugger could be able to set a breakpoint in, so signal to
6729 pp_entereval that it should not throw away any saved lines at scope
6732 PL_breakable_sub_gen++;
6733 /* This makes sub {}; work as expected. */
6734 if (block->op_type == OP_STUB) {
6735 OP* const newblock = newSTATEOP(0, NULL, 0);
6737 op_getmad(block,newblock,'B');
6743 else block->op_attached = 1;
6744 CvROOT(cv) = CvLVALUE(cv)
6745 ? newUNOP(OP_LEAVESUBLV, 0,
6746 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
6747 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
6748 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6749 OpREFCNT_set(CvROOT(cv), 1);
6750 CvSTART(cv) = LINKLIST(CvROOT(cv));
6751 CvROOT(cv)->op_next = 0;
6752 CALL_PEEP(CvSTART(cv));
6753 finalize_optree(CvROOT(cv));
6755 /* now that optimizer has done its work, adjust pad values */
6757 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
6760 assert(!CvCONST(cv));
6761 if (ps && !*ps && op_const_sv(block, cv))
6766 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
6767 SV * const tmpstr = sv_newmortal();
6768 GV * const db_postponed = gv_fetchpvs("DB::postponed",
6769 GV_ADDMULTI, SVt_PVHV);
6771 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
6774 (long)CopLINE(PL_curcop));
6775 gv_efullname3(tmpstr, gv, NULL);
6776 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
6777 SvCUR(tmpstr), sv, 0);
6778 hv = GvHVn(db_postponed);
6779 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) {
6780 CV * const pcv = GvCV(db_postponed);
6786 call_sv(MUTABLE_SV(pcv), G_DISCARD);
6791 if (name && ! (PL_parser && PL_parser->error_count))
6792 process_special_blocks(name, gv, cv);
6797 PL_parser->copline = NOLINE;
6803 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
6806 const char *const colon = strrchr(fullname,':');
6807 const char *const name = colon ? colon + 1 : fullname;
6809 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
6812 if (strEQ(name, "BEGIN")) {
6813 const I32 oldscope = PL_scopestack_ix;
6815 SAVECOPFILE(&PL_compiling);
6816 SAVECOPLINE(&PL_compiling);
6818 DEBUG_x( dump_sub(gv) );
6819 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
6820 GvCV_set(gv,0); /* cv has been hijacked */
6821 call_list(oldscope, PL_beginav);
6823 PL_curcop = &PL_compiling;
6824 CopHINTS_set(&PL_compiling, PL_hints);
6831 if strEQ(name, "END") {
6832 DEBUG_x( dump_sub(gv) );
6833 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
6836 } else if (*name == 'U') {
6837 if (strEQ(name, "UNITCHECK")) {
6838 /* It's never too late to run a unitcheck block */
6839 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
6843 } else if (*name == 'C') {
6844 if (strEQ(name, "CHECK")) {
6846 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
6847 "Too late to run CHECK block");
6848 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
6852 } else if (*name == 'I') {
6853 if (strEQ(name, "INIT")) {
6855 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
6856 "Too late to run INIT block");
6857 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
6863 DEBUG_x( dump_sub(gv) );
6864 GvCV_set(gv,0); /* cv has been hijacked */
6869 =for apidoc newCONSTSUB
6871 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
6872 eligible for inlining at compile-time.
6874 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
6875 which won't be called if used as a destructor, but will suppress the overhead
6876 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
6883 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
6888 const char *const file = CopFILE(PL_curcop);
6890 SV *const temp_sv = CopFILESV(PL_curcop);
6891 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
6896 if (IN_PERL_RUNTIME) {
6897 /* at runtime, it's not safe to manipulate PL_curcop: it may be
6898 * an op shared between threads. Use a non-shared COP for our
6900 SAVEVPTR(PL_curcop);
6901 PL_curcop = &PL_compiling;
6903 SAVECOPLINE(PL_curcop);
6904 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
6907 PL_hints &= ~HINT_BLOCK_SCOPE;
6910 SAVESPTR(PL_curstash);
6911 SAVECOPSTASH(PL_curcop);
6912 PL_curstash = stash;
6913 CopSTASH_set(PL_curcop,stash);
6916 /* file becomes the CvFILE. For an XS, it's usually static storage,
6917 and so doesn't get free()d. (It's expected to be from the C pre-
6918 processor __FILE__ directive). But we need a dynamically allocated one,
6919 and we need it to get freed. */
6920 cv = newXS_flags(name, const_sv_xsub, file ? file : "", "",
6921 XS_DYNAMIC_FILENAME);
6922 CvXSUBANY(cv).any_ptr = sv;
6927 CopSTASH_free(PL_curcop);
6935 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
6936 const char *const filename, const char *const proto,
6939 CV *cv = newXS(name, subaddr, filename);
6941 PERL_ARGS_ASSERT_NEWXS_FLAGS;
6943 if (flags & XS_DYNAMIC_FILENAME) {
6944 CvFILE(cv) = savepv(filename);
6947 sv_setpv(MUTABLE_SV(cv), proto);
6952 =for apidoc U||newXS
6954 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
6955 static storage, as it is used directly as CvFILE(), without a copy being made.
6961 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
6964 GV * const gv = gv_fetchpv(name ? name :
6965 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
6966 GV_ADDMULTI, SVt_PVCV);
6969 PERL_ARGS_ASSERT_NEWXS;
6972 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
6974 if ((cv = (name ? GvCV(gv) : NULL))) {
6976 /* just a cached method */
6980 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
6981 /* already defined (or promised) */
6982 /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */
6983 if (ckWARN(WARN_REDEFINE)) {
6984 GV * const gvcv = CvGV(cv);
6986 HV * const stash = GvSTASH(gvcv);
6988 const char *redefined_name = HvNAME_get(stash);
6989 if ( strEQ(redefined_name,"autouse") ) {
6990 const line_t oldline = CopLINE(PL_curcop);
6991 if (PL_parser && PL_parser->copline != NOLINE)
6992 CopLINE_set(PL_curcop, PL_parser->copline);
6993 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6994 CvCONST(cv) ? "Constant subroutine %s redefined"
6995 : "Subroutine %s redefined"
6997 CopLINE_set(PL_curcop, oldline);
7007 if (cv) /* must reuse cv if autoloaded */
7010 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
7014 mro_method_changed_in(GvSTASH(gv)); /* newXS */
7020 (void)gv_fetchfile(filename);
7021 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
7022 an external constant string */
7023 assert(!CvDYNFILE(cv)); /* cv_undef should have turned it off */
7025 CvXSUB(cv) = subaddr;
7028 process_special_blocks(name, gv, cv);
7038 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
7043 OP* pegop = newOP(OP_NULL, 0);
7047 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
7048 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
7051 if ((cv = GvFORM(gv))) {
7052 if (ckWARN(WARN_REDEFINE)) {
7053 const line_t oldline = CopLINE(PL_curcop);
7054 if (PL_parser && PL_parser->copline != NOLINE)
7055 CopLINE_set(PL_curcop, PL_parser->copline);
7057 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7058 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
7060 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7061 "Format STDOUT redefined");
7063 CopLINE_set(PL_curcop, oldline);
7070 CvFILE_set_from_cop(cv, PL_curcop);
7073 pad_tidy(padtidy_FORMAT);
7074 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
7075 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7076 OpREFCNT_set(CvROOT(cv), 1);
7077 CvSTART(cv) = LINKLIST(CvROOT(cv));
7078 CvROOT(cv)->op_next = 0;
7079 CALL_PEEP(CvSTART(cv));
7080 finalize_optree(CvROOT(cv));
7082 op_getmad(o,pegop,'n');
7083 op_getmad_weak(block, pegop, 'b');
7088 PL_parser->copline = NOLINE;
7096 Perl_newANONLIST(pTHX_ OP *o)
7098 return convert(OP_ANONLIST, OPf_SPECIAL, o);
7102 Perl_newANONHASH(pTHX_ OP *o)
7104 return convert(OP_ANONHASH, OPf_SPECIAL, o);
7108 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
7110 return newANONATTRSUB(floor, proto, NULL, block);
7114 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
7116 return newUNOP(OP_REFGEN, 0,
7117 newSVOP(OP_ANONCODE, 0,
7118 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
7122 Perl_oopsAV(pTHX_ OP *o)
7126 PERL_ARGS_ASSERT_OOPSAV;
7128 switch (o->op_type) {
7130 o->op_type = OP_PADAV;
7131 o->op_ppaddr = PL_ppaddr[OP_PADAV];
7132 return ref(o, OP_RV2AV);
7135 o->op_type = OP_RV2AV;
7136 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
7141 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
7148 Perl_oopsHV(pTHX_ OP *o)
7152 PERL_ARGS_ASSERT_OOPSHV;
7154 switch (o->op_type) {
7157 o->op_type = OP_PADHV;
7158 o->op_ppaddr = PL_ppaddr[OP_PADHV];
7159 return ref(o, OP_RV2HV);
7163 o->op_type = OP_RV2HV;
7164 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
7169 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
7176 Perl_newAVREF(pTHX_ OP *o)
7180 PERL_ARGS_ASSERT_NEWAVREF;
7182 if (o->op_type == OP_PADANY) {
7183 o->op_type = OP_PADAV;
7184 o->op_ppaddr = PL_ppaddr[OP_PADAV];
7187 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
7188 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7189 "Using an array as a reference is deprecated");
7191 return newUNOP(OP_RV2AV, 0, scalar(o));
7195 Perl_newGVREF(pTHX_ I32 type, OP *o)
7197 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
7198 return newUNOP(OP_NULL, 0, o);
7199 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
7203 Perl_newHVREF(pTHX_ OP *o)
7207 PERL_ARGS_ASSERT_NEWHVREF;
7209 if (o->op_type == OP_PADANY) {
7210 o->op_type = OP_PADHV;
7211 o->op_ppaddr = PL_ppaddr[OP_PADHV];
7214 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
7215 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7216 "Using a hash as a reference is deprecated");
7218 return newUNOP(OP_RV2HV, 0, scalar(o));
7222 Perl_newCVREF(pTHX_ I32 flags, OP *o)
7224 return newUNOP(OP_RV2CV, flags, scalar(o));
7228 Perl_newSVREF(pTHX_ OP *o)
7232 PERL_ARGS_ASSERT_NEWSVREF;
7234 if (o->op_type == OP_PADANY) {
7235 o->op_type = OP_PADSV;
7236 o->op_ppaddr = PL_ppaddr[OP_PADSV];
7239 return newUNOP(OP_RV2SV, 0, scalar(o));
7242 /* Check routines. See the comments at the top of this file for details
7243 * on when these are called */
7246 Perl_ck_anoncode(pTHX_ OP *o)
7248 PERL_ARGS_ASSERT_CK_ANONCODE;
7250 cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type);
7252 cSVOPo->op_sv = NULL;
7257 Perl_ck_bitop(pTHX_ OP *o)
7261 PERL_ARGS_ASSERT_CK_BITOP;
7263 #define OP_IS_NUMCOMPARE(op) \
7264 ((op) == OP_LT || (op) == OP_I_LT || \
7265 (op) == OP_GT || (op) == OP_I_GT || \
7266 (op) == OP_LE || (op) == OP_I_LE || \
7267 (op) == OP_GE || (op) == OP_I_GE || \
7268 (op) == OP_EQ || (op) == OP_I_EQ || \
7269 (op) == OP_NE || (op) == OP_I_NE || \
7270 (op) == OP_NCMP || (op) == OP_I_NCMP)
7271 o->op_private = (U8)(PL_hints & HINT_INTEGER);
7272 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
7273 && (o->op_type == OP_BIT_OR
7274 || o->op_type == OP_BIT_AND
7275 || o->op_type == OP_BIT_XOR))
7277 const OP * const left = cBINOPo->op_first;
7278 const OP * const right = left->op_sibling;
7279 if ((OP_IS_NUMCOMPARE(left->op_type) &&
7280 (left->op_flags & OPf_PARENS) == 0) ||
7281 (OP_IS_NUMCOMPARE(right->op_type) &&
7282 (right->op_flags & OPf_PARENS) == 0))
7283 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
7284 "Possible precedence problem on bitwise %c operator",
7285 o->op_type == OP_BIT_OR ? '|'
7286 : o->op_type == OP_BIT_AND ? '&' : '^'
7293 Perl_ck_concat(pTHX_ OP *o)
7295 const OP * const kid = cUNOPo->op_first;
7297 PERL_ARGS_ASSERT_CK_CONCAT;
7298 PERL_UNUSED_CONTEXT;
7300 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
7301 !(kUNOP->op_first->op_flags & OPf_MOD))
7302 o->op_flags |= OPf_STACKED;
7307 Perl_ck_spair(pTHX_ OP *o)
7311 PERL_ARGS_ASSERT_CK_SPAIR;
7313 if (o->op_flags & OPf_KIDS) {
7316 const OPCODE type = o->op_type;
7317 o = modkids(ck_fun(o), type);
7318 kid = cUNOPo->op_first;
7319 newop = kUNOP->op_first->op_sibling;
7321 const OPCODE type = newop->op_type;
7322 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
7323 type == OP_PADAV || type == OP_PADHV ||
7324 type == OP_RV2AV || type == OP_RV2HV)
7328 op_getmad(kUNOP->op_first,newop,'K');
7330 op_free(kUNOP->op_first);
7332 kUNOP->op_first = newop;
7334 o->op_ppaddr = PL_ppaddr[++o->op_type];
7339 Perl_ck_delete(pTHX_ OP *o)
7341 PERL_ARGS_ASSERT_CK_DELETE;
7345 if (o->op_flags & OPf_KIDS) {
7346 OP * const kid = cUNOPo->op_first;
7347 switch (kid->op_type) {
7349 o->op_flags |= OPf_SPECIAL;
7352 o->op_private |= OPpSLICE;
7355 o->op_flags |= OPf_SPECIAL;
7360 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
7363 if (kid->op_private & OPpLVAL_INTRO)
7364 o->op_private |= OPpLVAL_INTRO;
7371 Perl_ck_die(pTHX_ OP *o)
7373 PERL_ARGS_ASSERT_CK_DIE;
7376 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7382 Perl_ck_eof(pTHX_ OP *o)
7386 PERL_ARGS_ASSERT_CK_EOF;
7388 if (o->op_flags & OPf_KIDS) {
7389 if (cLISTOPo->op_first->op_type == OP_STUB) {
7391 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
7393 op_getmad(o,newop,'O');
7405 Perl_ck_eval(pTHX_ OP *o)
7409 PERL_ARGS_ASSERT_CK_EVAL;
7411 PL_hints |= HINT_BLOCK_SCOPE;
7412 if (o->op_flags & OPf_KIDS) {
7413 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7416 o->op_flags &= ~OPf_KIDS;
7419 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
7425 cUNOPo->op_first = 0;
7430 NewOp(1101, enter, 1, LOGOP);
7431 enter->op_type = OP_ENTERTRY;
7432 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
7433 enter->op_private = 0;
7435 /* establish postfix order */
7436 enter->op_next = (OP*)enter;
7438 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
7439 o->op_type = OP_LEAVETRY;
7440 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
7441 enter->op_other = o;
7442 op_getmad(oldo,o,'O');
7456 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
7457 op_getmad(oldo,o,'O');
7459 o->op_targ = (PADOFFSET)PL_hints;
7460 if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) {
7461 /* Store a copy of %^H that pp_entereval can pick up. */
7462 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
7463 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
7464 cUNOPo->op_first->op_sibling = hhop;
7465 o->op_private |= OPpEVAL_HAS_HH;
7471 Perl_ck_exit(pTHX_ OP *o)
7473 PERL_ARGS_ASSERT_CK_EXIT;
7476 HV * const table = GvHV(PL_hintgv);
7478 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
7479 if (svp && *svp && SvTRUE(*svp))
7480 o->op_private |= OPpEXIT_VMSISH;
7482 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7488 Perl_ck_exec(pTHX_ OP *o)
7490 PERL_ARGS_ASSERT_CK_EXEC;
7492 if (o->op_flags & OPf_STACKED) {
7495 kid = cUNOPo->op_first->op_sibling;
7496 if (kid->op_type == OP_RV2GV)
7505 Perl_ck_exists(pTHX_ OP *o)
7509 PERL_ARGS_ASSERT_CK_EXISTS;
7512 if (o->op_flags & OPf_KIDS) {
7513 OP * const kid = cUNOPo->op_first;
7514 if (kid->op_type == OP_ENTERSUB) {
7515 (void) ref(kid, o->op_type);
7516 if (kid->op_type != OP_RV2CV
7517 && !(PL_parser && PL_parser->error_count))
7518 Perl_croak(aTHX_ "%s argument is not a subroutine name",
7520 o->op_private |= OPpEXISTS_SUB;
7522 else if (kid->op_type == OP_AELEM)
7523 o->op_flags |= OPf_SPECIAL;
7524 else if (kid->op_type != OP_HELEM)
7525 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
7533 Perl_ck_rvconst(pTHX_ register OP *o)
7536 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7538 PERL_ARGS_ASSERT_CK_RVCONST;
7540 o->op_private |= (PL_hints & HINT_STRICT_REFS);
7541 if (o->op_type == OP_RV2CV)
7542 o->op_private &= ~1;
7544 if (kid->op_type == OP_CONST) {
7547 SV * const kidsv = kid->op_sv;
7549 /* Is it a constant from cv_const_sv()? */
7550 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
7551 SV * const rsv = SvRV(kidsv);
7552 const svtype type = SvTYPE(rsv);
7553 const char *badtype = NULL;
7555 switch (o->op_type) {
7557 if (type > SVt_PVMG)
7558 badtype = "a SCALAR";
7561 if (type != SVt_PVAV)
7562 badtype = "an ARRAY";
7565 if (type != SVt_PVHV)
7569 if (type != SVt_PVCV)
7574 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
7577 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
7578 const char *badthing;
7579 switch (o->op_type) {
7581 badthing = "a SCALAR";
7584 badthing = "an ARRAY";
7587 badthing = "a HASH";
7595 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
7596 SVfARG(kidsv), badthing);
7599 * This is a little tricky. We only want to add the symbol if we
7600 * didn't add it in the lexer. Otherwise we get duplicate strict
7601 * warnings. But if we didn't add it in the lexer, we must at
7602 * least pretend like we wanted to add it even if it existed before,
7603 * or we get possible typo warnings. OPpCONST_ENTERED says
7604 * whether the lexer already added THIS instance of this symbol.
7606 iscv = (o->op_type == OP_RV2CV) * 2;
7608 gv = gv_fetchsv(kidsv,
7609 iscv | !(kid->op_private & OPpCONST_ENTERED),
7612 : o->op_type == OP_RV2SV
7614 : o->op_type == OP_RV2AV
7616 : o->op_type == OP_RV2HV
7619 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
7621 kid->op_type = OP_GV;
7622 SvREFCNT_dec(kid->op_sv);
7624 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
7625 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
7626 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
7628 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
7630 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
7632 kid->op_private = 0;
7633 kid->op_ppaddr = PL_ppaddr[OP_GV];
7634 /* FAKE globs in the symbol table cause weird bugs (#77810) */
7642 Perl_ck_ftst(pTHX_ OP *o)
7645 const I32 type = o->op_type;
7647 PERL_ARGS_ASSERT_CK_FTST;
7649 if (o->op_flags & OPf_REF) {
7652 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
7653 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7654 const OPCODE kidtype = kid->op_type;
7656 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
7657 OP * const newop = newGVOP(type, OPf_REF,
7658 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
7660 op_getmad(o,newop,'O');
7666 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
7667 o->op_private |= OPpFT_ACCESS;
7668 if (PL_check[kidtype] == Perl_ck_ftst
7669 && kidtype != OP_STAT && kidtype != OP_LSTAT) {
7670 o->op_private |= OPpFT_STACKED;
7671 kid->op_private |= OPpFT_STACKING;
7680 if (type == OP_FTTTY)
7681 o = newGVOP(type, OPf_REF, PL_stdingv);
7683 o = newUNOP(type, 0, newDEFSVOP());
7684 op_getmad(oldo,o,'O');
7690 Perl_ck_fun(pTHX_ OP *o)
7693 const int type = o->op_type;
7694 register I32 oa = PL_opargs[type] >> OASHIFT;
7696 PERL_ARGS_ASSERT_CK_FUN;
7698 if (o->op_flags & OPf_STACKED) {
7699 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
7702 return no_fh_allowed(o);
7705 if (o->op_flags & OPf_KIDS) {
7706 OP **tokid = &cLISTOPo->op_first;
7707 register OP *kid = cLISTOPo->op_first;
7710 bool seen_optional = FALSE;
7712 if (kid->op_type == OP_PUSHMARK ||
7713 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
7715 tokid = &kid->op_sibling;
7716 kid = kid->op_sibling;
7718 if (kid && kid->op_type == OP_COREARGS) {
7719 bool optional = FALSE;
7722 if (oa & OA_OPTIONAL) optional = TRUE;
7725 if (optional) o->op_private |= numargs;
7730 if (oa & OA_OPTIONAL || (oa & 7) == OA_LIST) {
7731 if (!kid && !seen_optional && PL_opargs[type] & OA_DEFGV)
7732 *tokid = kid = newDEFSVOP();
7733 seen_optional = TRUE;
7738 sibl = kid->op_sibling;
7740 if (!sibl && kid->op_type == OP_STUB) {
7747 /* list seen where single (scalar) arg expected? */
7748 if (numargs == 1 && !(oa >> 4)
7749 && kid->op_type == OP_LIST && type != OP_SCALAR)
7751 return too_many_arguments(o,PL_op_desc[type]);
7764 if ((type == OP_PUSH || type == OP_UNSHIFT)
7765 && !kid->op_sibling)
7766 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
7767 "Useless use of %s with no values",
7770 if (kid->op_type == OP_CONST &&
7771 (kid->op_private & OPpCONST_BARE))
7773 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
7774 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
7775 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7776 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
7777 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
7779 op_getmad(kid,newop,'K');
7784 kid->op_sibling = sibl;
7787 else if (kid->op_type == OP_CONST
7788 && ( !SvROK(cSVOPx_sv(kid))
7789 || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV )
7791 bad_type(numargs, "array", PL_op_desc[type], kid);
7792 /* Defer checks to run-time if we have a scalar arg */
7793 if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV)
7794 op_lvalue(kid, type);
7798 if (kid->op_type == OP_CONST &&
7799 (kid->op_private & OPpCONST_BARE))
7801 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
7802 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
7803 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7804 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
7805 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
7807 op_getmad(kid,newop,'K');
7812 kid->op_sibling = sibl;
7815 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
7816 bad_type(numargs, "hash", PL_op_desc[type], kid);
7817 op_lvalue(kid, type);
7821 OP * const newop = newUNOP(OP_NULL, 0, kid);
7822 kid->op_sibling = 0;
7824 newop->op_next = newop;
7826 kid->op_sibling = sibl;
7831 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
7832 if (kid->op_type == OP_CONST &&
7833 (kid->op_private & OPpCONST_BARE))
7835 OP * const newop = newGVOP(OP_GV, 0,
7836 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
7837 if (!(o->op_private & 1) && /* if not unop */
7838 kid == cLISTOPo->op_last)
7839 cLISTOPo->op_last = newop;
7841 op_getmad(kid,newop,'K');
7847 else if (kid->op_type == OP_READLINE) {
7848 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
7849 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
7852 I32 flags = OPf_SPECIAL;
7856 /* is this op a FH constructor? */
7857 if (is_handle_constructor(o,numargs)) {
7858 const char *name = NULL;
7862 /* Set a flag to tell rv2gv to vivify
7863 * need to "prove" flag does not mean something
7864 * else already - NI-S 1999/05/07
7867 if (kid->op_type == OP_PADSV) {
7869 = PAD_COMPNAME_SV(kid->op_targ);
7870 name = SvPV_const(namesv, len);
7872 else if (kid->op_type == OP_RV2SV
7873 && kUNOP->op_first->op_type == OP_GV)
7875 GV * const gv = cGVOPx_gv(kUNOP->op_first);
7877 len = GvNAMELEN(gv);
7879 else if (kid->op_type == OP_AELEM
7880 || kid->op_type == OP_HELEM)
7883 OP *op = ((BINOP*)kid)->op_first;
7887 const char * const a =
7888 kid->op_type == OP_AELEM ?
7890 if (((op->op_type == OP_RV2AV) ||
7891 (op->op_type == OP_RV2HV)) &&
7892 (firstop = ((UNOP*)op)->op_first) &&
7893 (firstop->op_type == OP_GV)) {
7894 /* packagevar $a[] or $h{} */
7895 GV * const gv = cGVOPx_gv(firstop);
7903 else if (op->op_type == OP_PADAV
7904 || op->op_type == OP_PADHV) {
7905 /* lexicalvar $a[] or $h{} */
7906 const char * const padname =
7907 PAD_COMPNAME_PV(op->op_targ);
7916 name = SvPV_const(tmpstr, len);
7921 name = "__ANONIO__";
7924 op_lvalue(kid, type);
7928 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
7929 namesv = PAD_SVl(targ);
7930 SvUPGRADE(namesv, SVt_PV);
7932 sv_setpvs(namesv, "$");
7933 sv_catpvn(namesv, name, len);
7936 kid->op_sibling = 0;
7937 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
7938 kid->op_targ = targ;
7939 kid->op_private |= priv;
7941 kid->op_sibling = sibl;
7947 op_lvalue(scalar(kid), type);
7951 tokid = &kid->op_sibling;
7952 kid = kid->op_sibling;
7955 if (kid && kid->op_type != OP_STUB)
7956 return too_many_arguments(o,OP_DESC(o));
7957 o->op_private |= numargs;
7959 /* FIXME - should the numargs move as for the PERL_MAD case? */
7960 o->op_private |= numargs;
7962 return too_many_arguments(o,OP_DESC(o));
7966 else if (PL_opargs[type] & OA_DEFGV) {
7968 OP *newop = newUNOP(type, 0, newDEFSVOP());
7969 op_getmad(o,newop,'O');
7972 /* Ordering of these two is important to keep f_map.t passing. */
7974 return newUNOP(type, 0, newDEFSVOP());
7979 while (oa & OA_OPTIONAL)
7981 if (oa && oa != OA_LIST)
7982 return too_few_arguments(o,OP_DESC(o));
7988 Perl_ck_glob(pTHX_ OP *o)
7993 PERL_ARGS_ASSERT_CK_GLOB;
7996 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
7997 op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */
7999 if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
8000 && GvCVu(gv) && GvIMPORTED_CV(gv)))
8002 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
8005 #if !defined(PERL_EXTERNAL_GLOB)
8006 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
8009 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
8010 newSVpvs("File::Glob"), NULL, NULL, NULL);
8011 if((glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV))) {
8012 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
8013 GvCV_set(gv, GvCV(glob_gv));
8014 SvREFCNT_inc_void(MUTABLE_SV(GvCV(gv)));
8015 GvIMPORTED_CV_on(gv);
8019 #endif /* PERL_EXTERNAL_GLOB */
8021 assert(!(o->op_flags & OPf_SPECIAL));
8022 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8025 * \ null - const(wildcard)
8030 * \ mark - glob - rv2cv
8031 * | \ gv(CORE::GLOBAL::glob)
8033 * \ null - const(wildcard) - const(ix)
8035 o->op_flags |= OPf_SPECIAL;
8036 o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP);
8037 op_append_elem(OP_GLOB, o,
8038 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
8039 o = newLISTOP(OP_LIST, 0, o, NULL);
8040 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
8041 op_append_elem(OP_LIST, o,
8042 scalar(newUNOP(OP_RV2CV, 0,
8043 newGVOP(OP_GV, 0, gv)))));
8044 o = newUNOP(OP_NULL, 0, ck_subr(o));
8045 o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */
8048 gv = newGVgen("main");
8050 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
8056 Perl_ck_grep(pTHX_ OP *o)
8061 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
8064 PERL_ARGS_ASSERT_CK_GREP;
8066 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
8067 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
8069 if (o->op_flags & OPf_STACKED) {
8072 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
8073 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
8074 return no_fh_allowed(o);
8075 for (k = kid; k; k = k->op_next) {
8078 NewOp(1101, gwop, 1, LOGOP);
8079 kid->op_next = (OP*)gwop;
8080 o->op_flags &= ~OPf_STACKED;
8082 kid = cLISTOPo->op_first->op_sibling;
8083 if (type == OP_MAPWHILE)
8088 if (PL_parser && PL_parser->error_count)
8090 kid = cLISTOPo->op_first->op_sibling;
8091 if (kid->op_type != OP_NULL)
8092 Perl_croak(aTHX_ "panic: ck_grep");
8093 kid = kUNOP->op_first;
8096 NewOp(1101, gwop, 1, LOGOP);
8097 gwop->op_type = type;
8098 gwop->op_ppaddr = PL_ppaddr[type];
8099 gwop->op_first = listkids(o);
8100 gwop->op_flags |= OPf_KIDS;
8101 gwop->op_other = LINKLIST(kid);
8102 kid->op_next = (OP*)gwop;
8103 offset = pad_findmy_pvs("$_", 0);
8104 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
8105 o->op_private = gwop->op_private = 0;
8106 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
8109 o->op_private = gwop->op_private = OPpGREP_LEX;
8110 gwop->op_targ = o->op_targ = offset;
8113 kid = cLISTOPo->op_first->op_sibling;
8114 if (!kid || !kid->op_sibling)
8115 return too_few_arguments(o,OP_DESC(o));
8116 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
8117 op_lvalue(kid, OP_GREPSTART);
8123 Perl_ck_index(pTHX_ OP *o)
8125 PERL_ARGS_ASSERT_CK_INDEX;
8127 if (o->op_flags & OPf_KIDS) {
8128 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8130 kid = kid->op_sibling; /* get past "big" */
8131 if (kid && kid->op_type == OP_CONST) {
8132 const bool save_taint = PL_tainted;
8133 fbm_compile(((SVOP*)kid)->op_sv, 0);
8134 PL_tainted = save_taint;
8141 Perl_ck_lfun(pTHX_ OP *o)
8143 const OPCODE type = o->op_type;
8145 PERL_ARGS_ASSERT_CK_LFUN;
8147 return modkids(ck_fun(o), type);
8151 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
8153 PERL_ARGS_ASSERT_CK_DEFINED;
8155 if ((o->op_flags & OPf_KIDS)) {
8156 switch (cUNOPo->op_first->op_type) {
8158 /* This is needed for
8159 if (defined %stash::)
8160 to work. Do not break Tk.
8162 break; /* Globals via GV can be undef */
8164 case OP_AASSIGN: /* Is this a good idea? */
8165 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8166 "defined(@array) is deprecated");
8167 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8168 "\t(Maybe you should just omit the defined()?)\n");
8172 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8173 "defined(%%hash) is deprecated");
8174 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8175 "\t(Maybe you should just omit the defined()?)\n");
8186 Perl_ck_readline(pTHX_ OP *o)
8188 PERL_ARGS_ASSERT_CK_READLINE;
8190 if (!(o->op_flags & OPf_KIDS)) {
8192 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
8194 op_getmad(o,newop,'O');
8204 Perl_ck_rfun(pTHX_ OP *o)
8206 const OPCODE type = o->op_type;
8208 PERL_ARGS_ASSERT_CK_RFUN;
8210 return refkids(ck_fun(o), type);
8214 Perl_ck_listiob(pTHX_ OP *o)
8218 PERL_ARGS_ASSERT_CK_LISTIOB;
8220 kid = cLISTOPo->op_first;
8223 kid = cLISTOPo->op_first;
8225 if (kid->op_type == OP_PUSHMARK)
8226 kid = kid->op_sibling;
8227 if (kid && o->op_flags & OPf_STACKED)
8228 kid = kid->op_sibling;
8229 else if (kid && !kid->op_sibling) { /* print HANDLE; */
8230 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
8231 o->op_flags |= OPf_STACKED; /* make it a filehandle */
8232 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
8233 cLISTOPo->op_first->op_sibling = kid;
8234 cLISTOPo->op_last = kid;
8235 kid = kid->op_sibling;
8240 op_append_elem(o->op_type, o, newDEFSVOP());
8246 Perl_ck_smartmatch(pTHX_ OP *o)
8249 PERL_ARGS_ASSERT_CK_SMARTMATCH;
8250 if (0 == (o->op_flags & OPf_SPECIAL)) {
8251 OP *first = cBINOPo->op_first;
8252 OP *second = first->op_sibling;
8254 /* Implicitly take a reference to an array or hash */
8255 first->op_sibling = NULL;
8256 first = cBINOPo->op_first = ref_array_or_hash(first);
8257 second = first->op_sibling = ref_array_or_hash(second);
8259 /* Implicitly take a reference to a regular expression */
8260 if (first->op_type == OP_MATCH) {
8261 first->op_type = OP_QR;
8262 first->op_ppaddr = PL_ppaddr[OP_QR];
8264 if (second->op_type == OP_MATCH) {
8265 second->op_type = OP_QR;
8266 second->op_ppaddr = PL_ppaddr[OP_QR];
8275 Perl_ck_sassign(pTHX_ OP *o)
8278 OP * const kid = cLISTOPo->op_first;
8280 PERL_ARGS_ASSERT_CK_SASSIGN;
8282 /* has a disposable target? */
8283 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
8284 && !(kid->op_flags & OPf_STACKED)
8285 /* Cannot steal the second time! */
8286 && !(kid->op_private & OPpTARGET_MY)
8287 /* Keep the full thing for madskills */
8291 OP * const kkid = kid->op_sibling;
8293 /* Can just relocate the target. */
8294 if (kkid && kkid->op_type == OP_PADSV
8295 && !(kkid->op_private & OPpLVAL_INTRO))
8297 kid->op_targ = kkid->op_targ;
8299 /* Now we do not need PADSV and SASSIGN. */
8300 kid->op_sibling = o->op_sibling; /* NULL */
8301 cLISTOPo->op_first = NULL;
8304 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
8308 if (kid->op_sibling) {
8309 OP *kkid = kid->op_sibling;
8310 /* For state variable assignment, kkid is a list op whose op_last
8312 if ((kkid->op_type == OP_PADSV ||
8313 (kkid->op_type == OP_LIST &&
8314 (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV
8317 && (kkid->op_private & OPpLVAL_INTRO)
8318 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
8319 const PADOFFSET target = kkid->op_targ;
8320 OP *const other = newOP(OP_PADSV,
8322 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
8323 OP *const first = newOP(OP_NULL, 0);
8324 OP *const nullop = newCONDOP(0, first, o, other);
8325 OP *const condop = first->op_next;
8326 /* hijacking PADSTALE for uninitialized state variables */
8327 SvPADSTALE_on(PAD_SVl(target));
8329 condop->op_type = OP_ONCE;
8330 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
8331 condop->op_targ = target;
8332 other->op_targ = target;
8334 /* Because we change the type of the op here, we will skip the
8335 assignment binop->op_last = binop->op_first->op_sibling; at the
8336 end of Perl_newBINOP(). So need to do it here. */
8337 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
8346 Perl_ck_match(pTHX_ OP *o)
8350 PERL_ARGS_ASSERT_CK_MATCH;
8352 if (o->op_type != OP_QR && PL_compcv) {
8353 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
8354 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
8355 o->op_targ = offset;
8356 o->op_private |= OPpTARGET_MY;
8359 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
8360 o->op_private |= OPpRUNTIME;
8365 Perl_ck_method(pTHX_ OP *o)
8367 OP * const kid = cUNOPo->op_first;
8369 PERL_ARGS_ASSERT_CK_METHOD;
8371 if (kid->op_type == OP_CONST) {
8372 SV* sv = kSVOP->op_sv;
8373 const char * const method = SvPVX_const(sv);
8374 if (!(strchr(method, ':') || strchr(method, '\''))) {
8376 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
8377 sv = newSVpvn_share(method, SvCUR(sv), 0);
8380 kSVOP->op_sv = NULL;
8382 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
8384 op_getmad(o,cmop,'O');
8395 Perl_ck_null(pTHX_ OP *o)
8397 PERL_ARGS_ASSERT_CK_NULL;
8398 PERL_UNUSED_CONTEXT;
8403 Perl_ck_open(pTHX_ OP *o)
8406 HV * const table = GvHV(PL_hintgv);
8408 PERL_ARGS_ASSERT_CK_OPEN;
8411 SV **svp = hv_fetchs(table, "open_IN", FALSE);
8414 const char *d = SvPV_const(*svp, len);
8415 const I32 mode = mode_from_discipline(d, len);
8416 if (mode & O_BINARY)
8417 o->op_private |= OPpOPEN_IN_RAW;
8418 else if (mode & O_TEXT)
8419 o->op_private |= OPpOPEN_IN_CRLF;
8422 svp = hv_fetchs(table, "open_OUT", FALSE);
8425 const char *d = SvPV_const(*svp, len);
8426 const I32 mode = mode_from_discipline(d, len);
8427 if (mode & O_BINARY)
8428 o->op_private |= OPpOPEN_OUT_RAW;
8429 else if (mode & O_TEXT)
8430 o->op_private |= OPpOPEN_OUT_CRLF;
8433 if (o->op_type == OP_BACKTICK) {
8434 if (!(o->op_flags & OPf_KIDS)) {
8435 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
8437 op_getmad(o,newop,'O');
8446 /* In case of three-arg dup open remove strictness
8447 * from the last arg if it is a bareword. */
8448 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
8449 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
8453 if ((last->op_type == OP_CONST) && /* The bareword. */
8454 (last->op_private & OPpCONST_BARE) &&
8455 (last->op_private & OPpCONST_STRICT) &&
8456 (oa = first->op_sibling) && /* The fh. */
8457 (oa = oa->op_sibling) && /* The mode. */
8458 (oa->op_type == OP_CONST) &&
8459 SvPOK(((SVOP*)oa)->op_sv) &&
8460 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
8461 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
8462 (last == oa->op_sibling)) /* The bareword. */
8463 last->op_private &= ~OPpCONST_STRICT;
8469 Perl_ck_repeat(pTHX_ OP *o)
8471 PERL_ARGS_ASSERT_CK_REPEAT;
8473 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
8474 o->op_private |= OPpREPEAT_DOLIST;
8475 cBINOPo->op_first = force_list(cBINOPo->op_first);
8483 Perl_ck_require(pTHX_ OP *o)
8488 PERL_ARGS_ASSERT_CK_REQUIRE;
8490 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
8491 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8493 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
8494 SV * const sv = kid->op_sv;
8495 U32 was_readonly = SvREADONLY(sv);
8502 sv_force_normal_flags(sv, 0);
8503 assert(!SvREADONLY(sv));
8513 for (; s < end; s++) {
8514 if (*s == ':' && s[1] == ':') {
8516 Move(s+2, s+1, end - s - 1, char);
8521 sv_catpvs(sv, ".pm");
8522 SvFLAGS(sv) |= was_readonly;
8526 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
8527 /* handle override, if any */
8528 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
8529 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
8530 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
8531 gv = gvp ? *gvp : NULL;
8535 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8536 OP * const kid = cUNOPo->op_first;
8539 cUNOPo->op_first = 0;
8543 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
8544 op_append_elem(OP_LIST, kid,
8545 scalar(newUNOP(OP_RV2CV, 0,
8548 op_getmad(o,newop,'O');
8552 return scalar(ck_fun(o));
8556 Perl_ck_return(pTHX_ OP *o)
8561 PERL_ARGS_ASSERT_CK_RETURN;
8563 kid = cLISTOPo->op_first->op_sibling;
8564 if (CvLVALUE(PL_compcv)) {
8565 for (; kid; kid = kid->op_sibling)
8566 op_lvalue(kid, OP_LEAVESUBLV);
8573 Perl_ck_select(pTHX_ OP *o)
8578 PERL_ARGS_ASSERT_CK_SELECT;
8580 if (o->op_flags & OPf_KIDS) {
8581 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8582 if (kid && kid->op_sibling) {
8583 o->op_type = OP_SSELECT;
8584 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
8586 return fold_constants(op_integerize(op_std_init(o)));
8590 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8591 if (kid && kid->op_type == OP_RV2GV)
8592 kid->op_private &= ~HINT_STRICT_REFS;
8597 Perl_ck_shift(pTHX_ OP *o)
8600 const I32 type = o->op_type;
8602 PERL_ARGS_ASSERT_CK_SHIFT;
8604 if (!(o->op_flags & OPf_KIDS)) {
8607 if (!CvUNIQUE(PL_compcv)) {
8608 o->op_flags |= OPf_SPECIAL;
8612 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
8615 OP * const oldo = o;
8616 o = newUNOP(type, 0, scalar(argop));
8617 op_getmad(oldo,o,'O');
8622 return newUNOP(type, 0, scalar(argop));
8625 return scalar(ck_fun(o));
8629 Perl_ck_sort(pTHX_ OP *o)
8634 PERL_ARGS_ASSERT_CK_SORT;
8636 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
8637 HV * const hinthv = GvHV(PL_hintgv);
8639 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
8641 const I32 sorthints = (I32)SvIV(*svp);
8642 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
8643 o->op_private |= OPpSORT_QSORT;
8644 if ((sorthints & HINT_SORT_STABLE) != 0)
8645 o->op_private |= OPpSORT_STABLE;
8650 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
8652 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8653 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
8655 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
8657 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
8659 if (kid->op_type == OP_SCOPE) {
8663 else if (kid->op_type == OP_LEAVE) {
8664 if (o->op_type == OP_SORT) {
8665 op_null(kid); /* wipe out leave */
8668 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
8669 if (k->op_next == kid)
8671 /* don't descend into loops */
8672 else if (k->op_type == OP_ENTERLOOP
8673 || k->op_type == OP_ENTERITER)
8675 k = cLOOPx(k)->op_lastop;
8680 kid->op_next = 0; /* just disconnect the leave */
8681 k = kLISTOP->op_first;
8686 if (o->op_type == OP_SORT) {
8687 /* provide scalar context for comparison function/block */
8693 o->op_flags |= OPf_SPECIAL;
8695 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
8698 firstkid = firstkid->op_sibling;
8701 /* provide list context for arguments */
8702 if (o->op_type == OP_SORT)
8709 S_simplify_sort(pTHX_ OP *o)
8712 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8718 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
8720 if (!(o->op_flags & OPf_STACKED))
8722 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
8723 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
8724 kid = kUNOP->op_first; /* get past null */
8725 if (kid->op_type != OP_SCOPE)
8727 kid = kLISTOP->op_last; /* get past scope */
8728 switch(kid->op_type) {
8736 k = kid; /* remember this node*/
8737 if (kBINOP->op_first->op_type != OP_RV2SV)
8739 kid = kBINOP->op_first; /* get past cmp */
8740 if (kUNOP->op_first->op_type != OP_GV)
8742 kid = kUNOP->op_first; /* get past rv2sv */
8744 if (GvSTASH(gv) != PL_curstash)
8746 gvname = GvNAME(gv);
8747 if (*gvname == 'a' && gvname[1] == '\0')
8749 else if (*gvname == 'b' && gvname[1] == '\0')
8754 kid = k; /* back to cmp */
8755 if (kBINOP->op_last->op_type != OP_RV2SV)
8757 kid = kBINOP->op_last; /* down to 2nd arg */
8758 if (kUNOP->op_first->op_type != OP_GV)
8760 kid = kUNOP->op_first; /* get past rv2sv */
8762 if (GvSTASH(gv) != PL_curstash)
8764 gvname = GvNAME(gv);
8766 ? !(*gvname == 'a' && gvname[1] == '\0')
8767 : !(*gvname == 'b' && gvname[1] == '\0'))
8769 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
8771 o->op_private |= OPpSORT_DESCEND;
8772 if (k->op_type == OP_NCMP)
8773 o->op_private |= OPpSORT_NUMERIC;
8774 if (k->op_type == OP_I_NCMP)
8775 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
8776 kid = cLISTOPo->op_first->op_sibling;
8777 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
8779 op_getmad(kid,o,'S'); /* then delete it */
8781 op_free(kid); /* then delete it */
8786 Perl_ck_split(pTHX_ OP *o)
8791 PERL_ARGS_ASSERT_CK_SPLIT;
8793 if (o->op_flags & OPf_STACKED)
8794 return no_fh_allowed(o);
8796 kid = cLISTOPo->op_first;
8797 if (kid->op_type != OP_NULL)
8798 Perl_croak(aTHX_ "panic: ck_split");
8799 kid = kid->op_sibling;
8800 op_free(cLISTOPo->op_first);
8802 cLISTOPo->op_first = kid;
8804 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
8805 cLISTOPo->op_last = kid; /* There was only one element previously */
8808 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
8809 OP * const sibl = kid->op_sibling;
8810 kid->op_sibling = 0;
8811 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
8812 if (cLISTOPo->op_first == cLISTOPo->op_last)
8813 cLISTOPo->op_last = kid;
8814 cLISTOPo->op_first = kid;
8815 kid->op_sibling = sibl;
8818 kid->op_type = OP_PUSHRE;
8819 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
8821 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
8822 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
8823 "Use of /g modifier is meaningless in split");
8826 if (!kid->op_sibling)
8827 op_append_elem(OP_SPLIT, o, newDEFSVOP());
8829 kid = kid->op_sibling;
8832 if (!kid->op_sibling)
8833 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
8834 assert(kid->op_sibling);
8836 kid = kid->op_sibling;
8839 if (kid->op_sibling)
8840 return too_many_arguments(o,OP_DESC(o));
8846 Perl_ck_join(pTHX_ OP *o)
8848 const OP * const kid = cLISTOPo->op_first->op_sibling;
8850 PERL_ARGS_ASSERT_CK_JOIN;
8852 if (kid && kid->op_type == OP_MATCH) {
8853 if (ckWARN(WARN_SYNTAX)) {
8854 const REGEXP *re = PM_GETRE(kPMOP);
8855 const char *pmstr = re ? RX_PRECOMP_const(re) : "STRING";
8856 const STRLEN len = re ? RX_PRELEN(re) : 6;
8857 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
8858 "/%.*s/ should probably be written as \"%.*s\"",
8859 (int)len, pmstr, (int)len, pmstr);
8866 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
8868 Examines an op, which is expected to identify a subroutine at runtime,
8869 and attempts to determine at compile time which subroutine it identifies.
8870 This is normally used during Perl compilation to determine whether
8871 a prototype can be applied to a function call. I<cvop> is the op
8872 being considered, normally an C<rv2cv> op. A pointer to the identified
8873 subroutine is returned, if it could be determined statically, and a null
8874 pointer is returned if it was not possible to determine statically.
8876 Currently, the subroutine can be identified statically if the RV that the
8877 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
8878 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
8879 suitable if the constant value must be an RV pointing to a CV. Details of
8880 this process may change in future versions of Perl. If the C<rv2cv> op
8881 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
8882 the subroutine statically: this flag is used to suppress compile-time
8883 magic on a subroutine call, forcing it to use default runtime behaviour.
8885 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
8886 of a GV reference is modified. If a GV was examined and its CV slot was
8887 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
8888 If the op is not optimised away, and the CV slot is later populated with
8889 a subroutine having a prototype, that flag eventually triggers the warning
8890 "called too early to check prototype".
8892 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
8893 of returning a pointer to the subroutine it returns a pointer to the
8894 GV giving the most appropriate name for the subroutine in this context.
8895 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
8896 (C<CvANON>) subroutine that is referenced through a GV it will be the
8897 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
8898 A null pointer is returned as usual if there is no statically-determinable
8905 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
8910 PERL_ARGS_ASSERT_RV2CV_OP_CV;
8911 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
8912 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
8913 if (cvop->op_type != OP_RV2CV)
8915 if (cvop->op_private & OPpENTERSUB_AMPER)
8917 if (!(cvop->op_flags & OPf_KIDS))
8919 rvop = cUNOPx(cvop)->op_first;
8920 switch (rvop->op_type) {
8922 gv = cGVOPx_gv(rvop);
8925 if (flags & RV2CVOPCV_MARK_EARLY)
8926 rvop->op_private |= OPpEARLY_CV;
8931 SV *rv = cSVOPx_sv(rvop);
8941 if (SvTYPE((SV*)cv) != SVt_PVCV)
8943 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
8944 if (!CvANON(cv) || !gv)
8953 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
8955 Performs the default fixup of the arguments part of an C<entersub>
8956 op tree. This consists of applying list context to each of the
8957 argument ops. This is the standard treatment used on a call marked
8958 with C<&>, or a method call, or a call through a subroutine reference,
8959 or any other call where the callee can't be identified at compile time,
8960 or a call where the callee has no prototype.
8966 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
8969 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
8970 aop = cUNOPx(entersubop)->op_first;
8971 if (!aop->op_sibling)
8972 aop = cUNOPx(aop)->op_first;
8973 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
8974 if (!(PL_madskills && aop->op_type == OP_STUB)) {
8976 op_lvalue(aop, OP_ENTERSUB);
8983 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
8985 Performs the fixup of the arguments part of an C<entersub> op tree
8986 based on a subroutine prototype. This makes various modifications to
8987 the argument ops, from applying context up to inserting C<refgen> ops,
8988 and checking the number and syntactic types of arguments, as directed by
8989 the prototype. This is the standard treatment used on a subroutine call,
8990 not marked with C<&>, where the callee can be identified at compile time
8991 and has a prototype.
8993 I<protosv> supplies the subroutine prototype to be applied to the call.
8994 It may be a normal defined scalar, of which the string value will be used.
8995 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
8996 that has been cast to C<SV*>) which has a prototype. The prototype
8997 supplied, in whichever form, does not need to match the actual callee
8998 referenced by the op tree.
9000 If the argument ops disagree with the prototype, for example by having
9001 an unacceptable number of arguments, a valid op tree is returned anyway.
9002 The error is reflected in the parser state, normally resulting in a single
9003 exception at the top level of parsing which covers all the compilation
9004 errors that occurred. In the error message, the callee is referred to
9005 by the name defined by the I<namegv> parameter.
9011 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
9014 const char *proto, *proto_end;
9015 OP *aop, *prev, *cvop;
9018 I32 contextclass = 0;
9019 const char *e = NULL;
9020 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
9021 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
9022 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto");
9023 proto = SvPV(protosv, proto_len);
9024 proto_end = proto + proto_len;
9025 aop = cUNOPx(entersubop)->op_first;
9026 if (!aop->op_sibling)
9027 aop = cUNOPx(aop)->op_first;
9029 aop = aop->op_sibling;
9030 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9031 while (aop != cvop) {
9033 if (PL_madskills && aop->op_type == OP_STUB) {
9034 aop = aop->op_sibling;
9037 if (PL_madskills && aop->op_type == OP_NULL)
9038 o3 = ((UNOP*)aop)->op_first;
9042 if (proto >= proto_end)
9043 return too_many_arguments(entersubop, gv_ename(namegv));
9051 /* _ must be at the end */
9052 if (proto[1] && proto[1] != ';')
9067 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
9069 arg == 1 ? "block or sub {}" : "sub {}",
9070 gv_ename(namegv), o3);
9073 /* '*' allows any scalar type, including bareword */
9076 if (o3->op_type == OP_RV2GV)
9077 goto wrapref; /* autoconvert GLOB -> GLOBref */
9078 else if (o3->op_type == OP_CONST)
9079 o3->op_private &= ~OPpCONST_STRICT;
9080 else if (o3->op_type == OP_ENTERSUB) {
9081 /* accidental subroutine, revert to bareword */
9082 OP *gvop = ((UNOP*)o3)->op_first;
9083 if (gvop && gvop->op_type == OP_NULL) {
9084 gvop = ((UNOP*)gvop)->op_first;
9086 for (; gvop->op_sibling; gvop = gvop->op_sibling)
9089 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
9090 (gvop = ((UNOP*)gvop)->op_first) &&
9091 gvop->op_type == OP_GV)
9093 GV * const gv = cGVOPx_gv(gvop);
9094 OP * const sibling = aop->op_sibling;
9095 SV * const n = newSVpvs("");
9097 OP * const oldaop = aop;
9101 gv_fullname4(n, gv, "", FALSE);
9102 aop = newSVOP(OP_CONST, 0, n);
9103 op_getmad(oldaop,aop,'O');
9104 prev->op_sibling = aop;
9105 aop->op_sibling = sibling;
9115 if (o3->op_type == OP_RV2AV ||
9116 o3->op_type == OP_PADAV ||
9117 o3->op_type == OP_RV2HV ||
9118 o3->op_type == OP_PADHV
9133 if (contextclass++ == 0) {
9134 e = strchr(proto, ']');
9135 if (!e || e == proto)
9144 const char *p = proto;
9145 const char *const end = proto;
9148 /* \[$] accepts any scalar lvalue */
9150 && Perl_op_lvalue_flags(aTHX_
9152 OP_READ, /* not entersub */
9155 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
9157 gv_ename(namegv), o3);
9162 if (o3->op_type == OP_RV2GV)
9165 bad_type(arg, "symbol", gv_ename(namegv), o3);
9168 if (o3->op_type == OP_ENTERSUB)
9171 bad_type(arg, "subroutine entry", gv_ename(namegv),
9175 if (o3->op_type == OP_RV2SV ||
9176 o3->op_type == OP_PADSV ||
9177 o3->op_type == OP_HELEM ||
9178 o3->op_type == OP_AELEM)
9180 if (!contextclass) {
9181 /* \$ accepts any scalar lvalue */
9182 if (Perl_op_lvalue_flags(aTHX_
9184 OP_READ, /* not entersub */
9187 bad_type(arg, "scalar", gv_ename(namegv), o3);
9191 if (o3->op_type == OP_RV2AV ||
9192 o3->op_type == OP_PADAV)
9195 bad_type(arg, "array", gv_ename(namegv), o3);
9198 if (o3->op_type == OP_RV2HV ||
9199 o3->op_type == OP_PADHV)
9202 bad_type(arg, "hash", gv_ename(namegv), o3);
9206 OP* const kid = aop;
9207 OP* const sib = kid->op_sibling;
9208 kid->op_sibling = 0;
9209 aop = newUNOP(OP_REFGEN, 0, kid);
9210 aop->op_sibling = sib;
9211 prev->op_sibling = aop;
9213 if (contextclass && e) {
9228 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
9229 gv_ename(namegv), SVfARG(protosv));
9232 op_lvalue(aop, OP_ENTERSUB);
9234 aop = aop->op_sibling;
9236 if (aop == cvop && *proto == '_') {
9237 /* generate an access to $_ */
9239 aop->op_sibling = prev->op_sibling;
9240 prev->op_sibling = aop; /* instead of cvop */
9242 if (!optional && proto_end > proto &&
9243 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
9244 return too_few_arguments(entersubop, gv_ename(namegv));
9249 =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv
9251 Performs the fixup of the arguments part of an C<entersub> op tree either
9252 based on a subroutine prototype or using default list-context processing.
9253 This is the standard treatment used on a subroutine call, not marked
9254 with C<&>, where the callee can be identified at compile time.
9256 I<protosv> supplies the subroutine prototype to be applied to the call,
9257 or indicates that there is no prototype. It may be a normal scalar,
9258 in which case if it is defined then the string value will be used
9259 as a prototype, and if it is undefined then there is no prototype.
9260 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
9261 that has been cast to C<SV*>), of which the prototype will be used if it
9262 has one. The prototype (or lack thereof) supplied, in whichever form,
9263 does not need to match the actual callee referenced by the op tree.
9265 If the argument ops disagree with the prototype, for example by having
9266 an unacceptable number of arguments, a valid op tree is returned anyway.
9267 The error is reflected in the parser state, normally resulting in a single
9268 exception at the top level of parsing which covers all the compilation
9269 errors that occurred. In the error message, the callee is referred to
9270 by the name defined by the I<namegv> parameter.
9276 Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop,
9277 GV *namegv, SV *protosv)
9279 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST;
9280 if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv))
9281 return ck_entersub_args_proto(entersubop, namegv, protosv);
9283 return ck_entersub_args_list(entersubop);
9287 Perl_ck_entersub_args_core(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
9289 int opnum = SvTYPE(protosv) == SVt_PVCV ? 0 : (int)SvUV(protosv);
9290 OP *aop = cUNOPx(entersubop)->op_first;
9292 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_CORE;
9296 if (!aop->op_sibling)
9297 aop = cUNOPx(aop)->op_first;
9298 aop = aop->op_sibling;
9299 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9300 if (PL_madskills) while (aop != cvop && aop->op_type == OP_STUB) {
9301 aop = aop->op_sibling;
9305 (void)too_many_arguments(entersubop, GvNAME(namegv));
9307 op_free(entersubop);
9308 switch(GvNAME(namegv)[2]) {
9309 case 'F': return newSVOP(OP_CONST, 0,
9310 newSVpv(CopFILE(PL_curcop),0));
9311 case 'L': return newSVOP(
9314 "%"IVdf, (IV)CopLINE(PL_curcop)
9317 case 'P': return newSVOP(OP_CONST, 0,
9319 ? newSVhek(HvNAME_HEK(PL_curstash))
9330 bool seenarg = FALSE;
9332 if (!aop->op_sibling)
9333 aop = cUNOPx(aop)->op_first;
9336 aop = aop->op_sibling;
9337 prev->op_sibling = NULL;
9340 prev=cvop, cvop = cvop->op_sibling)
9342 if (PL_madskills && cvop->op_sibling
9343 && cvop->op_type != OP_STUB) seenarg = TRUE
9346 prev->op_sibling = NULL;
9347 paren = OPf_SPECIAL * !(cvop->op_private & OPpENTERSUB_NOPAREN);
9349 if (aop == cvop) aop = NULL;
9350 op_free(entersubop);
9352 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
9354 case OA_BASEOP_OR_UNOP:
9356 return aop ? newUNOP(opnum,paren,aop) : newOP(opnum,paren);
9360 if (!PL_madskills || seenarg)
9362 (void)too_many_arguments(aop, GvNAME(namegv));
9365 return newOP(opnum,0);
9367 return convert(opnum,0,aop);
9375 =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p
9377 Retrieves the function that will be used to fix up a call to I<cv>.
9378 Specifically, the function is applied to an C<entersub> op tree for a
9379 subroutine call, not marked with C<&>, where the callee can be identified
9380 at compile time as I<cv>.
9382 The C-level function pointer is returned in I<*ckfun_p>, and an SV
9383 argument for it is returned in I<*ckobj_p>. The function is intended
9384 to be called in this manner:
9386 entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p));
9388 In this call, I<entersubop> is a pointer to the C<entersub> op,
9389 which may be replaced by the check function, and I<namegv> is a GV
9390 supplying the name that should be used by the check function to refer
9391 to the callee of the C<entersub> op if it needs to emit any diagnostics.
9392 It is permitted to apply the check function in non-standard situations,
9393 such as to a call to a different subroutine or to a method call.
9395 By default, the function is
9396 L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>,
9397 and the SV parameter is I<cv> itself. This implements standard
9398 prototype processing. It can be changed, for a particular subroutine,
9399 by L</cv_set_call_checker>.
9405 Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p)
9408 PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER;
9409 callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL;
9411 *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr);
9412 *ckobj_p = callmg->mg_obj;
9414 *ckfun_p = Perl_ck_entersub_args_proto_or_list;
9420 =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj
9422 Sets the function that will be used to fix up a call to I<cv>.
9423 Specifically, the function is applied to an C<entersub> op tree for a
9424 subroutine call, not marked with C<&>, where the callee can be identified
9425 at compile time as I<cv>.
9427 The C-level function pointer is supplied in I<ckfun>, and an SV argument
9428 for it is supplied in I<ckobj>. The function is intended to be called
9431 entersubop = ckfun(aTHX_ entersubop, namegv, ckobj);
9433 In this call, I<entersubop> is a pointer to the C<entersub> op,
9434 which may be replaced by the check function, and I<namegv> is a GV
9435 supplying the name that should be used by the check function to refer
9436 to the callee of the C<entersub> op if it needs to emit any diagnostics.
9437 It is permitted to apply the check function in non-standard situations,
9438 such as to a call to a different subroutine or to a method call.
9440 The current setting for a particular CV can be retrieved by
9441 L</cv_get_call_checker>.
9447 Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj)
9449 PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER;
9450 if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) {
9451 if (SvMAGICAL((SV*)cv))
9452 mg_free_type((SV*)cv, PERL_MAGIC_checkcall);
9455 sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0);
9456 callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall);
9457 if (callmg->mg_flags & MGf_REFCOUNTED) {
9458 SvREFCNT_dec(callmg->mg_obj);
9459 callmg->mg_flags &= ~MGf_REFCOUNTED;
9461 callmg->mg_ptr = FPTR2DPTR(char *, ckfun);
9462 callmg->mg_obj = ckobj;
9463 if (ckobj != (SV*)cv) {
9464 SvREFCNT_inc_simple_void_NN(ckobj);
9465 callmg->mg_flags |= MGf_REFCOUNTED;
9471 Perl_ck_subr(pTHX_ OP *o)
9477 PERL_ARGS_ASSERT_CK_SUBR;
9479 aop = cUNOPx(o)->op_first;
9480 if (!aop->op_sibling)
9481 aop = cUNOPx(aop)->op_first;
9482 aop = aop->op_sibling;
9483 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9484 cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY);
9485 namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL;
9487 o->op_private &= ~1;
9488 o->op_private |= OPpENTERSUB_HASTARG;
9489 o->op_private |= (PL_hints & HINT_STRICT_REFS);
9490 if (PERLDB_SUB && PL_curstash != PL_debstash)
9491 o->op_private |= OPpENTERSUB_DB;
9492 if (cvop->op_type == OP_RV2CV) {
9493 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
9495 } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
9496 if (aop->op_type == OP_CONST)
9497 aop->op_private &= ~OPpCONST_STRICT;
9498 else if (aop->op_type == OP_LIST) {
9499 OP * const sib = ((UNOP*)aop)->op_first->op_sibling;
9500 if (sib && sib->op_type == OP_CONST)
9501 sib->op_private &= ~OPpCONST_STRICT;
9506 return ck_entersub_args_list(o);
9508 Perl_call_checker ckfun;
9510 cv_get_call_checker(cv, &ckfun, &ckobj);
9511 return ckfun(aTHX_ o, namegv, ckobj);
9516 Perl_ck_svconst(pTHX_ OP *o)
9518 PERL_ARGS_ASSERT_CK_SVCONST;
9519 PERL_UNUSED_CONTEXT;
9520 SvREADONLY_on(cSVOPo->op_sv);
9525 Perl_ck_chdir(pTHX_ OP *o)
9527 PERL_ARGS_ASSERT_CK_CHDIR;
9528 if (o->op_flags & OPf_KIDS) {
9529 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9531 if (kid && kid->op_type == OP_CONST &&
9532 (kid->op_private & OPpCONST_BARE))
9534 o->op_flags |= OPf_SPECIAL;
9535 kid->op_private &= ~OPpCONST_STRICT;
9542 Perl_ck_trunc(pTHX_ OP *o)
9544 PERL_ARGS_ASSERT_CK_TRUNC;
9546 if (o->op_flags & OPf_KIDS) {
9547 SVOP *kid = (SVOP*)cUNOPo->op_first;
9549 if (kid->op_type == OP_NULL)
9550 kid = (SVOP*)kid->op_sibling;
9551 if (kid && kid->op_type == OP_CONST &&
9552 (kid->op_private & OPpCONST_BARE))
9554 o->op_flags |= OPf_SPECIAL;
9555 kid->op_private &= ~OPpCONST_STRICT;
9562 Perl_ck_substr(pTHX_ OP *o)
9564 PERL_ARGS_ASSERT_CK_SUBSTR;
9567 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
9568 OP *kid = cLISTOPo->op_first;
9570 if (kid->op_type == OP_NULL)
9571 kid = kid->op_sibling;
9573 kid->op_flags |= OPf_MOD;
9580 Perl_ck_each(pTHX_ OP *o)
9583 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
9584 const unsigned orig_type = o->op_type;
9585 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
9586 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
9587 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
9588 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
9590 PERL_ARGS_ASSERT_CK_EACH;
9593 switch (kid->op_type) {
9599 CHANGE_TYPE(o, array_type);
9602 if (kid->op_private == OPpCONST_BARE
9603 || !SvROK(cSVOPx_sv(kid))
9604 || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV
9605 && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV )
9607 /* we let ck_fun handle it */
9610 CHANGE_TYPE(o, ref_type);
9614 /* if treating as a reference, defer additional checks to runtime */
9615 return o->op_type == ref_type ? o : ck_fun(o);
9618 /* caller is supposed to assign the return to the
9619 container of the rep_op var */
9621 S_opt_scalarhv(pTHX_ OP *rep_op) {
9625 PERL_ARGS_ASSERT_OPT_SCALARHV;
9627 NewOp(1101, unop, 1, UNOP);
9628 unop->op_type = (OPCODE)OP_BOOLKEYS;
9629 unop->op_ppaddr = PL_ppaddr[OP_BOOLKEYS];
9630 unop->op_flags = (U8)(OPf_WANT_SCALAR | OPf_KIDS );
9631 unop->op_private = (U8)(1 | ((OPf_WANT_SCALAR | OPf_KIDS) >> 8));
9632 unop->op_first = rep_op;
9633 unop->op_next = rep_op->op_next;
9634 rep_op->op_next = (OP*)unop;
9635 rep_op->op_flags|=(OPf_REF | OPf_MOD);
9636 unop->op_sibling = rep_op->op_sibling;
9637 rep_op->op_sibling = NULL;
9638 /* unop->op_targ = pad_alloc(OP_BOOLKEYS, SVs_PADTMP); */
9639 if (rep_op->op_type == OP_PADHV) {
9640 rep_op->op_flags &= ~OPf_WANT_SCALAR;
9641 rep_op->op_flags |= OPf_WANT_LIST;
9646 /* Check for in place reverse and sort assignments like "@a = reverse @a"
9647 and modify the optree to make them work inplace */
9650 S_inplace_aassign(pTHX_ OP *o) {
9652 OP *modop, *modop_pushmark;
9654 OP *oleft, *oleft_pushmark;
9656 PERL_ARGS_ASSERT_INPLACE_AASSIGN;
9658 assert((o->op_flags & OPf_WANT) == OPf_WANT_VOID);
9660 assert(cUNOPo->op_first->op_type == OP_NULL);
9661 modop_pushmark = cUNOPx(cUNOPo->op_first)->op_first;
9662 assert(modop_pushmark->op_type == OP_PUSHMARK);
9663 modop = modop_pushmark->op_sibling;
9665 if (modop->op_type != OP_SORT && modop->op_type != OP_REVERSE)
9668 /* no other operation except sort/reverse */
9669 if (modop->op_sibling)
9672 assert(cUNOPx(modop)->op_first->op_type == OP_PUSHMARK);
9673 oright = cUNOPx(modop)->op_first->op_sibling;
9675 if (modop->op_flags & OPf_STACKED) {
9676 /* skip sort subroutine/block */
9677 assert(oright->op_type == OP_NULL);
9678 oright = oright->op_sibling;
9681 assert(cUNOPo->op_first->op_sibling->op_type == OP_NULL);
9682 oleft_pushmark = cUNOPx(cUNOPo->op_first->op_sibling)->op_first;
9683 assert(oleft_pushmark->op_type == OP_PUSHMARK);
9684 oleft = oleft_pushmark->op_sibling;
9686 /* Check the lhs is an array */
9688 (oleft->op_type != OP_RV2AV && oleft->op_type != OP_PADAV)
9689 || oleft->op_sibling
9690 || (oleft->op_private & OPpLVAL_INTRO)
9694 /* Only one thing on the rhs */
9695 if (oright->op_sibling)
9698 /* check the array is the same on both sides */
9699 if (oleft->op_type == OP_RV2AV) {
9700 if (oright->op_type != OP_RV2AV
9701 || !cUNOPx(oright)->op_first
9702 || cUNOPx(oright)->op_first->op_type != OP_GV
9703 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
9704 cGVOPx_gv(cUNOPx(oright)->op_first)
9708 else if (oright->op_type != OP_PADAV
9709 || oright->op_targ != oleft->op_targ
9713 /* This actually is an inplace assignment */
9715 modop->op_private |= OPpSORT_INPLACE;
9717 /* transfer MODishness etc from LHS arg to RHS arg */
9718 oright->op_flags = oleft->op_flags;
9720 /* remove the aassign op and the lhs */
9722 op_null(oleft_pushmark);
9723 if (oleft->op_type == OP_RV2AV && cUNOPx(oleft)->op_first)
9724 op_null(cUNOPx(oleft)->op_first);
9728 #define MAX_DEFERRED 4
9731 if (defer_ix == (MAX_DEFERRED-1)) { \
9732 CALL_RPEEP(defer_queue[defer_base]); \
9733 defer_base = (defer_base + 1) % MAX_DEFERRED; \
9736 defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o;
9738 /* A peephole optimizer. We visit the ops in the order they're to execute.
9739 * See the comments at the top of this file for more details about when
9740 * peep() is called */
9743 Perl_rpeep(pTHX_ register OP *o)
9746 register OP* oldop = NULL;
9747 OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */
9751 if (!o || o->op_opt)
9755 SAVEVPTR(PL_curcop);
9756 for (;; o = o->op_next) {
9760 while (defer_ix >= 0)
9761 CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]);
9765 /* By default, this op has now been optimised. A couple of cases below
9766 clear this again. */
9769 switch (o->op_type) {
9771 PL_curcop = ((COP*)o); /* for warnings */
9774 PL_curcop = ((COP*)o); /* for warnings */
9776 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
9777 to carry two labels. For now, take the easier option, and skip
9778 this optimisation if the first NEXTSTATE has a label. */
9779 if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) {
9780 OP *nextop = o->op_next;
9781 while (nextop && nextop->op_type == OP_NULL)
9782 nextop = nextop->op_next;
9784 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
9785 COP *firstcop = (COP *)o;
9786 COP *secondcop = (COP *)nextop;
9787 /* We want the COP pointed to by o (and anything else) to
9788 become the next COP down the line. */
9791 firstcop->op_next = secondcop->op_next;
9793 /* Now steal all its pointers, and duplicate the other
9795 firstcop->cop_line = secondcop->cop_line;
9797 firstcop->cop_stashpv = secondcop->cop_stashpv;
9798 firstcop->cop_file = secondcop->cop_file;
9800 firstcop->cop_stash = secondcop->cop_stash;
9801 firstcop->cop_filegv = secondcop->cop_filegv;
9803 firstcop->cop_hints = secondcop->cop_hints;
9804 firstcop->cop_seq = secondcop->cop_seq;
9805 firstcop->cop_warnings = secondcop->cop_warnings;
9806 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
9809 secondcop->cop_stashpv = NULL;
9810 secondcop->cop_file = NULL;
9812 secondcop->cop_stash = NULL;
9813 secondcop->cop_filegv = NULL;
9815 secondcop->cop_warnings = NULL;
9816 secondcop->cop_hints_hash = NULL;
9818 /* If we use op_null(), and hence leave an ex-COP, some
9819 warnings are misreported. For example, the compile-time
9820 error in 'use strict; no strict refs;' */
9821 secondcop->op_type = OP_NULL;
9822 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
9828 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
9829 if (o->op_next->op_private & OPpTARGET_MY) {
9830 if (o->op_flags & OPf_STACKED) /* chained concats */
9831 break; /* ignore_optimization */
9833 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
9834 o->op_targ = o->op_next->op_targ;
9835 o->op_next->op_targ = 0;
9836 o->op_private |= OPpTARGET_MY;
9839 op_null(o->op_next);
9843 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
9844 break; /* Scalar stub must produce undef. List stub is noop */
9848 if (o->op_targ == OP_NEXTSTATE
9849 || o->op_targ == OP_DBSTATE)
9851 PL_curcop = ((COP*)o);
9853 /* XXX: We avoid setting op_seq here to prevent later calls
9854 to rpeep() from mistakenly concluding that optimisation
9855 has already occurred. This doesn't fix the real problem,
9856 though (See 20010220.007). AMS 20010719 */
9857 /* op_seq functionality is now replaced by op_opt */
9864 if (oldop && o->op_next) {
9865 oldop->op_next = o->op_next;
9873 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
9874 OP* const pop = (o->op_type == OP_PADAV) ?
9875 o->op_next : o->op_next->op_next;
9877 if (pop && pop->op_type == OP_CONST &&
9878 ((PL_op = pop->op_next)) &&
9879 pop->op_next->op_type == OP_AELEM &&
9880 !(pop->op_next->op_private &
9881 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
9882 (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop))
9887 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
9888 no_bareword_allowed(pop);
9889 if (o->op_type == OP_GV)
9890 op_null(o->op_next);
9891 op_null(pop->op_next);
9893 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
9894 o->op_next = pop->op_next->op_next;
9895 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
9896 o->op_private = (U8)i;
9897 if (o->op_type == OP_GV) {
9900 o->op_type = OP_AELEMFAST;
9903 o->op_type = OP_AELEMFAST_LEX;
9908 if (o->op_next->op_type == OP_RV2SV) {
9909 if (!(o->op_next->op_private & OPpDEREF)) {
9910 op_null(o->op_next);
9911 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
9913 o->op_next = o->op_next->op_next;
9914 o->op_type = OP_GVSV;
9915 o->op_ppaddr = PL_ppaddr[OP_GVSV];
9918 else if (o->op_next->op_type == OP_READLINE
9919 && o->op_next->op_next->op_type == OP_CONCAT
9920 && (o->op_next->op_next->op_flags & OPf_STACKED))
9922 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
9923 o->op_type = OP_RCATLINE;
9924 o->op_flags |= OPf_STACKED;
9925 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
9926 op_null(o->op_next->op_next);
9927 op_null(o->op_next);
9937 fop = cUNOP->op_first;
9945 fop = cLOGOP->op_first;
9946 sop = fop->op_sibling;
9947 while (cLOGOP->op_other->op_type == OP_NULL)
9948 cLOGOP->op_other = cLOGOP->op_other->op_next;
9949 while (o->op_next && ( o->op_type == o->op_next->op_type
9950 || o->op_next->op_type == OP_NULL))
9951 o->op_next = o->op_next->op_next;
9952 DEFER(cLOGOP->op_other);
9956 if ((fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
9958 (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV)
9963 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
9964 while (nop && nop->op_next) {
9965 switch (nop->op_next->op_type) {
9970 lop = nop = nop->op_next;
9981 if ((lop->op_flags & OPf_WANT) == OPf_WANT_VOID) {
9982 if (fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
9983 cLOGOP->op_first = opt_scalarhv(fop);
9984 if (sop && (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV))
9985 cLOGOP->op_first->op_sibling = opt_scalarhv(sop);
10001 while (cLOGOP->op_other->op_type == OP_NULL)
10002 cLOGOP->op_other = cLOGOP->op_other->op_next;
10003 DEFER(cLOGOP->op_other);
10008 while (cLOOP->op_redoop->op_type == OP_NULL)
10009 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
10010 while (cLOOP->op_nextop->op_type == OP_NULL)
10011 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
10012 while (cLOOP->op_lastop->op_type == OP_NULL)
10013 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
10014 /* a while(1) loop doesn't have an op_next that escapes the
10015 * loop, so we have to explicitly follow the op_lastop to
10016 * process the rest of the code */
10017 DEFER(cLOOP->op_lastop);
10021 assert(!(cPMOP->op_pmflags & PMf_ONCE));
10022 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
10023 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
10024 cPMOP->op_pmstashstartu.op_pmreplstart
10025 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
10026 DEFER(cPMOP->op_pmstashstartu.op_pmreplstart);
10030 /* check that RHS of sort is a single plain array */
10031 OP *oright = cUNOPo->op_first;
10032 if (!oright || oright->op_type != OP_PUSHMARK)
10035 if (o->op_private & OPpSORT_INPLACE)
10038 /* reverse sort ... can be optimised. */
10039 if (!cUNOPo->op_sibling) {
10040 /* Nothing follows us on the list. */
10041 OP * const reverse = o->op_next;
10043 if (reverse->op_type == OP_REVERSE &&
10044 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
10045 OP * const pushmark = cUNOPx(reverse)->op_first;
10046 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
10047 && (cUNOPx(pushmark)->op_sibling == o)) {
10048 /* reverse -> pushmark -> sort */
10049 o->op_private |= OPpSORT_REVERSE;
10051 pushmark->op_next = oright->op_next;
10061 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
10063 LISTOP *enter, *exlist;
10065 if (o->op_private & OPpSORT_INPLACE)
10068 enter = (LISTOP *) o->op_next;
10071 if (enter->op_type == OP_NULL) {
10072 enter = (LISTOP *) enter->op_next;
10076 /* for $a (...) will have OP_GV then OP_RV2GV here.
10077 for (...) just has an OP_GV. */
10078 if (enter->op_type == OP_GV) {
10079 gvop = (OP *) enter;
10080 enter = (LISTOP *) enter->op_next;
10083 if (enter->op_type == OP_RV2GV) {
10084 enter = (LISTOP *) enter->op_next;
10090 if (enter->op_type != OP_ENTERITER)
10093 iter = enter->op_next;
10094 if (!iter || iter->op_type != OP_ITER)
10097 expushmark = enter->op_first;
10098 if (!expushmark || expushmark->op_type != OP_NULL
10099 || expushmark->op_targ != OP_PUSHMARK)
10102 exlist = (LISTOP *) expushmark->op_sibling;
10103 if (!exlist || exlist->op_type != OP_NULL
10104 || exlist->op_targ != OP_LIST)
10107 if (exlist->op_last != o) {
10108 /* Mmm. Was expecting to point back to this op. */
10111 theirmark = exlist->op_first;
10112 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
10115 if (theirmark->op_sibling != o) {
10116 /* There's something between the mark and the reverse, eg
10117 for (1, reverse (...))
10122 ourmark = ((LISTOP *)o)->op_first;
10123 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
10126 ourlast = ((LISTOP *)o)->op_last;
10127 if (!ourlast || ourlast->op_next != o)
10130 rv2av = ourmark->op_sibling;
10131 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
10132 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
10133 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
10134 /* We're just reversing a single array. */
10135 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
10136 enter->op_flags |= OPf_STACKED;
10139 /* We don't have control over who points to theirmark, so sacrifice
10141 theirmark->op_next = ourmark->op_next;
10142 theirmark->op_flags = ourmark->op_flags;
10143 ourlast->op_next = gvop ? gvop : (OP *) enter;
10146 enter->op_private |= OPpITER_REVERSED;
10147 iter->op_private |= OPpITER_REVERSED;
10154 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
10155 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
10160 Perl_cpeep_t cpeep =
10161 XopENTRY(Perl_custom_op_xop(aTHX_ o), xop_peep);
10163 cpeep(aTHX_ o, oldop);
10174 Perl_peep(pTHX_ register OP *o)
10180 =head1 Custom Operators
10182 =for apidoc Ao||custom_op_xop
10183 Return the XOP structure for a given custom op. This function should be
10184 considered internal to OP_NAME and the other access macros: use them instead.
10190 Perl_custom_op_xop(pTHX_ const OP *o)
10196 static const XOP xop_null = { 0, 0, 0, 0, 0 };
10198 PERL_ARGS_ASSERT_CUSTOM_OP_XOP;
10199 assert(o->op_type == OP_CUSTOM);
10201 /* This is wrong. It assumes a function pointer can be cast to IV,
10202 * which isn't guaranteed, but this is what the old custom OP code
10203 * did. In principle it should be safer to Copy the bytes of the
10204 * pointer into a PV: since the new interface is hidden behind
10205 * functions, this can be changed later if necessary. */
10206 /* Change custom_op_xop if this ever happens */
10207 keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr)));
10210 he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0);
10212 /* assume noone will have just registered a desc */
10213 if (!he && PL_custom_op_names &&
10214 (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0))
10219 /* XXX does all this need to be shared mem? */
10220 Newxz(xop, 1, XOP);
10221 pv = SvPV(HeVAL(he), l);
10222 XopENTRY_set(xop, xop_name, savepvn(pv, l));
10223 if (PL_custom_op_descs &&
10224 (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0))
10226 pv = SvPV(HeVAL(he), l);
10227 XopENTRY_set(xop, xop_desc, savepvn(pv, l));
10229 Perl_custom_op_register(aTHX_ o->op_ppaddr, xop);
10233 if (!he) return &xop_null;
10235 xop = INT2PTR(XOP *, SvIV(HeVAL(he)));
10240 =for apidoc Ao||custom_op_register
10241 Register a custom op. See L<perlguts/"Custom Operators">.
10247 Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop)
10251 PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER;
10253 /* see the comment in custom_op_xop */
10254 keysv = sv_2mortal(newSViv(PTR2IV(ppaddr)));
10256 if (!PL_custom_ops)
10257 PL_custom_ops = newHV();
10259 if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0))
10260 Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name);
10264 =head1 Functions in file op.c
10266 =for apidoc core_prototype
10267 This function assigns the prototype of the named core function to C<sv>, or
10268 to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or
10269 NULL if the core function has no prototype. C<code> is a code as returned
10270 by C<keyword()>. It must be negative and unequal to -KEY_CORE.
10276 Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code,
10279 int i = 0, n = 0, seen_question = 0, defgv = 0;
10281 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
10282 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
10283 bool nullret = FALSE;
10285 PERL_ARGS_ASSERT_CORE_PROTOTYPE;
10287 assert (code < 0 && code != -KEY_CORE);
10289 if (!sv) sv = sv_newmortal();
10291 #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv
10294 case KEY_and : case KEY_chop: case KEY_chomp:
10295 case KEY_cmp : case KEY_exec: case KEY_eq :
10296 case KEY_ge : case KEY_gt : case KEY_le :
10297 case KEY_lt : case KEY_ne : case KEY_or :
10298 case KEY_select: case KEY_system: case KEY_x : case KEY_xor:
10299 if (!opnum) return NULL; nullret = TRUE; goto findopnum;
10300 case KEY_keys: retsetpvs("+", OP_KEYS);
10301 case KEY_values: retsetpvs("+", OP_VALUES);
10302 case KEY_each: retsetpvs("+", OP_EACH);
10303 case KEY_push: retsetpvs("+@", OP_PUSH);
10304 case KEY_unshift: retsetpvs("+@", OP_UNSHIFT);
10305 case KEY_pop: retsetpvs(";+", OP_POP);
10306 case KEY_shift: retsetpvs(";+", OP_SHIFT);
10308 retsetpvs("+;$$@", OP_SPLICE);
10309 case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__:
10318 while (i < MAXO) { /* The slow way. */
10319 if (strEQ(name, PL_op_name[i])
10320 || strEQ(name, PL_op_desc[i]))
10322 if (nullret) { assert(opnum); *opnum = i; return NULL; }
10327 assert(0); return NULL; /* Should not happen... */
10329 defgv = PL_opargs[i] & OA_DEFGV;
10330 oa = PL_opargs[i] >> OASHIFT;
10332 if (oa & OA_OPTIONAL && !seen_question && (
10333 !defgv || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF
10338 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
10339 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
10340 /* But globs are already references (kinda) */
10341 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
10345 if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF
10346 && !scalar_mod_type(NULL, i)) {
10351 if (i == OP_LOCK) str[n++] = '&';
10355 else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
10356 if (oa & OA_OPTIONAL && defgv && str[n-1] == '$') {
10357 str[n-1] = '_'; defgv = 0;
10361 if (code == -KEY_not || code == -KEY_getprotobynumber) str[n++] = ';';
10363 sv_setpvn(sv, str, n - 1);
10364 if (opnum) *opnum = i;
10369 Perl_coresub_op(pTHX_ SV * const coreargssv, const int code,
10372 OP * const argop = newSVOP(OP_COREARGS,0,coreargssv);
10375 PERL_ARGS_ASSERT_CORESUB_OP;
10379 return op_append_elem(OP_LINESEQ,
10382 newSVOP(OP_CONST, 0, newSViv(-code % 3)),
10386 case OP_SELECT: /* which represents OP_SSELECT as well */
10391 newAVREF(newGVOP(OP_GV, 0, PL_defgv)),
10392 newSVOP(OP_CONST, 0, newSVuv(1))
10394 coresub_op(newSVuv((UV)OP_SSELECT), 0,
10396 coresub_op(coreargssv, 0, OP_SELECT)
10400 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
10402 return op_append_elem(
10405 opnum == OP_WANTARRAY ? OPpOFFBYONE << 8 : 0)
10407 case OA_BASEOP_OR_UNOP:
10408 o = newUNOP(opnum,0,argop);
10409 if (opnum == OP_CALLER) o->op_private |= OPpOFFBYONE;
10412 if (is_handle_constructor(o, 1))
10413 argop->op_private |= OPpCOREARGS_DEREF1;
10417 o = convert(opnum,0,argop);
10418 if (is_handle_constructor(o, 2))
10419 argop->op_private |= OPpCOREARGS_DEREF2;
10420 if (scalar_mod_type(NULL, opnum))
10421 argop->op_private |= OPpCOREARGS_SCALARMOD;
10422 if (opnum == OP_SUBSTR) {
10423 o->op_private |= OPpMAYBE_LVSUB;
10433 /* Efficient sub that returns a constant scalar value. */
10435 const_sv_xsub(pTHX_ CV* cv)
10439 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
10443 /* diag_listed_as: SKIPME */
10444 Perl_croak(aTHX_ "usage: %s::%s()",
10445 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
10458 * c-indentation-style: bsd
10459 * c-basic-offset: 4
10460 * indent-tabs-mode: t
10463 * ex: set ts=8 sts=4 sw=4 noet: