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 kid = cLOGOPo->op_first;
1225 if (kid->op_type == OP_NOT
1226 && (kid->op_flags & OPf_KIDS)
1228 if (o->op_type == OP_AND) {
1230 o->op_ppaddr = PL_ppaddr[OP_OR];
1232 o->op_type = OP_AND;
1233 o->op_ppaddr = PL_ppaddr[OP_AND];
1242 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1247 if (o->op_flags & OPf_STACKED)
1254 if (!(o->op_flags & OPf_KIDS))
1265 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1275 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
1280 S_listkids(pTHX_ OP *o)
1282 if (o && o->op_flags & OPf_KIDS) {
1284 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1291 Perl_list(pTHX_ OP *o)
1296 /* assumes no premature commitment */
1297 if (!o || (o->op_flags & OPf_WANT)
1298 || (PL_parser && PL_parser->error_count)
1299 || o->op_type == OP_RETURN)
1304 if ((o->op_private & OPpTARGET_MY)
1305 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1307 return o; /* As if inside SASSIGN */
1310 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1312 switch (o->op_type) {
1315 list(cBINOPo->op_first);
1320 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1328 if (!(o->op_flags & OPf_KIDS))
1330 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1331 list(cBINOPo->op_first);
1332 return gen_constant_list(o);
1339 kid = cLISTOPo->op_first;
1341 kid = kid->op_sibling;
1344 OP *sib = kid->op_sibling;
1345 if (sib && kid->op_type != OP_LEAVEWHEN)
1351 PL_curcop = &PL_compiling;
1355 kid = cLISTOPo->op_first;
1362 S_scalarseq(pTHX_ OP *o)
1366 const OPCODE type = o->op_type;
1368 if (type == OP_LINESEQ || type == OP_SCOPE ||
1369 type == OP_LEAVE || type == OP_LEAVETRY)
1372 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1373 if (kid->op_sibling) {
1377 PL_curcop = &PL_compiling;
1379 o->op_flags &= ~OPf_PARENS;
1380 if (PL_hints & HINT_BLOCK_SCOPE)
1381 o->op_flags |= OPf_PARENS;
1384 o = newOP(OP_STUB, 0);
1389 S_modkids(pTHX_ OP *o, I32 type)
1391 if (o && o->op_flags & OPf_KIDS) {
1393 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1394 op_lvalue(kid, type);
1400 =for apidoc finalize_optree
1402 This function finalizes the optree. Should be called directly after
1403 the complete optree is built. It does some additional
1404 checking which can't be done in the normal ck_xxx functions and makes
1405 the tree thread-safe.
1410 Perl_finalize_optree(pTHX_ OP* o)
1412 PERL_ARGS_ASSERT_FINALIZE_OPTREE;
1415 SAVEVPTR(PL_curcop);
1423 S_finalize_op(pTHX_ OP* o)
1425 PERL_ARGS_ASSERT_FINALIZE_OP;
1427 #if defined(PERL_MAD) && defined(USE_ITHREADS)
1429 /* Make sure mad ops are also thread-safe */
1430 MADPROP *mp = o->op_madprop;
1432 if (mp->mad_type == MAD_OP && mp->mad_vlen) {
1433 OP *prop_op = (OP *) mp->mad_val;
1434 /* We only need "Relocate sv to the pad for thread safety.", but this
1435 easiest way to make sure it traverses everything */
1436 finalize_op(prop_op);
1443 switch (o->op_type) {
1446 PL_curcop = ((COP*)o); /* for warnings */
1450 && (o->op_sibling->op_type == OP_NEXTSTATE || o->op_sibling->op_type == OP_DBSTATE)
1451 && ckWARN(WARN_SYNTAX))
1453 if (o->op_sibling->op_sibling) {
1454 const OPCODE type = o->op_sibling->op_sibling->op_type;
1455 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
1456 const line_t oldline = CopLINE(PL_curcop);
1457 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_sibling));
1458 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1459 "Statement unlikely to be reached");
1460 Perl_warner(aTHX_ packWARN(WARN_EXEC),
1461 "\t(Maybe you meant system() when you said exec()?)\n");
1462 CopLINE_set(PL_curcop, oldline);
1469 if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
1470 GV * const gv = cGVOPo_gv;
1471 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
1472 /* XXX could check prototype here instead of just carping */
1473 SV * const sv = sv_newmortal();
1474 gv_efullname3(sv, gv, NULL);
1475 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
1476 "%"SVf"() called too early to check prototype",
1483 if (cSVOPo->op_private & OPpCONST_STRICT)
1484 no_bareword_allowed(o);
1488 case OP_METHOD_NAMED:
1489 /* Relocate sv to the pad for thread safety.
1490 * Despite being a "constant", the SV is written to,
1491 * for reference counts, sv_upgrade() etc. */
1492 if (cSVOPo->op_sv) {
1493 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
1494 if (o->op_type != OP_METHOD_NAMED &&
1495 (SvPADTMP(cSVOPo->op_sv) || SvPADMY(cSVOPo->op_sv)))
1497 /* If op_sv is already a PADTMP/MY then it is being used by
1498 * some pad, so make a copy. */
1499 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
1500 SvREADONLY_on(PAD_SVl(ix));
1501 SvREFCNT_dec(cSVOPo->op_sv);
1503 else if (o->op_type != OP_METHOD_NAMED
1504 && cSVOPo->op_sv == &PL_sv_undef) {
1505 /* PL_sv_undef is hack - it's unsafe to store it in the
1506 AV that is the pad, because av_fetch treats values of
1507 PL_sv_undef as a "free" AV entry and will merrily
1508 replace them with a new SV, causing pad_alloc to think
1509 that this pad slot is free. (When, clearly, it is not)
1511 SvOK_off(PAD_SVl(ix));
1512 SvPADTMP_on(PAD_SVl(ix));
1513 SvREADONLY_on(PAD_SVl(ix));
1516 SvREFCNT_dec(PAD_SVl(ix));
1517 SvPADTMP_on(cSVOPo->op_sv);
1518 PAD_SETSV(ix, cSVOPo->op_sv);
1519 /* XXX I don't know how this isn't readonly already. */
1520 SvREADONLY_on(PAD_SVl(ix));
1522 cSVOPo->op_sv = NULL;
1533 const char *key = NULL;
1536 if (((BINOP*)o)->op_last->op_type != OP_CONST)
1539 /* Make the CONST have a shared SV */
1540 svp = cSVOPx_svp(((BINOP*)o)->op_last);
1541 if ((!SvFAKE(sv = *svp) || !SvREADONLY(sv))
1542 && SvTYPE(sv) < SVt_PVMG && !SvROK(sv)) {
1543 key = SvPV_const(sv, keylen);
1544 lexname = newSVpvn_share(key,
1545 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
1551 if ((o->op_private & (OPpLVAL_INTRO)))
1554 rop = (UNOP*)((BINOP*)o)->op_first;
1555 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
1557 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
1558 if (!SvPAD_TYPED(lexname))
1560 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1561 if (!fields || !GvHV(*fields))
1563 key = SvPV_const(*svp, keylen);
1564 if (!hv_fetch(GvHV(*fields), key,
1565 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1566 Perl_croak(aTHX_ "No such class field \"%s\" "
1567 "in variable %s of type %s",
1568 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
1580 SVOP *first_key_op, *key_op;
1582 if ((o->op_private & (OPpLVAL_INTRO))
1583 /* I bet there's always a pushmark... */
1584 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
1585 /* hmmm, no optimization if list contains only one key. */
1587 rop = (UNOP*)((LISTOP*)o)->op_last;
1588 if (rop->op_type != OP_RV2HV)
1590 if (rop->op_first->op_type == OP_PADSV)
1591 /* @$hash{qw(keys here)} */
1592 rop = (UNOP*)rop->op_first;
1594 /* @{$hash}{qw(keys here)} */
1595 if (rop->op_first->op_type == OP_SCOPE
1596 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
1598 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
1604 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
1605 if (!SvPAD_TYPED(lexname))
1607 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
1608 if (!fields || !GvHV(*fields))
1610 /* Again guessing that the pushmark can be jumped over.... */
1611 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
1612 ->op_first->op_sibling;
1613 for (key_op = first_key_op; key_op;
1614 key_op = (SVOP*)key_op->op_sibling) {
1615 if (key_op->op_type != OP_CONST)
1617 svp = cSVOPx_svp(key_op);
1618 key = SvPV_const(*svp, keylen);
1619 if (!hv_fetch(GvHV(*fields), key,
1620 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE)) {
1621 Perl_croak(aTHX_ "No such class field \"%s\" "
1622 "in variable %s of type %s",
1623 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
1629 if (cPMOPo->op_pmreplrootu.op_pmreplroot)
1630 finalize_op(cPMOPo->op_pmreplrootu.op_pmreplroot);
1637 if (o->op_flags & OPf_KIDS) {
1639 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
1645 =for apidoc Amx|OP *|op_lvalue|OP *o|I32 type
1647 Propagate lvalue ("modifiable") context to an op and its children.
1648 I<type> represents the context type, roughly based on the type of op that
1649 would do the modifying, although C<local()> is represented by OP_NULL,
1650 because it has no op type of its own (it is signalled by a flag on
1653 This function detects things that can't be modified, such as C<$x+1>, and
1654 generates errors for them. For example, C<$x+1 = 2> would cause it to be
1655 called with an op of type OP_ADD and a C<type> argument of OP_SASSIGN.
1657 It also flags things that need to behave specially in an lvalue context,
1658 such as C<$$x = 5> which might have to vivify a reference in C<$x>.
1664 Perl_op_lvalue_flags(pTHX_ OP *o, I32 type, U32 flags)
1668 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1671 if (!o || (PL_parser && PL_parser->error_count))
1674 if ((o->op_private & OPpTARGET_MY)
1675 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1680 switch (o->op_type) {
1686 if (!(o->op_private & OPpCONST_ARYBASE))
1689 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1690 CopARYBASE_set(&PL_compiling,
1691 (I32)SvIV(cSVOPx(PL_eval_start)->op_sv));
1695 SAVECOPARYBASE(&PL_compiling);
1696 CopARYBASE_set(&PL_compiling, 0);
1698 else if (type == OP_REFGEN)
1701 Perl_croak(aTHX_ "That use of $[ is unsupported");
1704 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1708 if ((type == OP_UNDEF || type == OP_REFGEN || type == OP_LOCK) &&
1709 !(o->op_flags & OPf_STACKED)) {
1710 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1711 /* Both ENTERSUB and RV2CV use this bit, but for different pur-
1712 poses, so we need it clear. */
1713 o->op_private &= ~1;
1714 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1715 assert(cUNOPo->op_first->op_type == OP_NULL);
1716 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1719 else if (o->op_private & OPpENTERSUB_NOMOD)
1721 else { /* lvalue subroutine call */
1722 o->op_private |= OPpLVAL_INTRO
1723 |(OPpENTERSUB_INARGS * (type == OP_LEAVESUBLV));
1724 PL_modcount = RETURN_UNLIMITED_NUMBER;
1725 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1726 /* Backward compatibility mode: */
1727 o->op_private |= OPpENTERSUB_INARGS;
1730 else { /* Compile-time error message: */
1731 OP *kid = cUNOPo->op_first;
1735 if (kid->op_type != OP_PUSHMARK) {
1736 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1738 "panic: unexpected lvalue entersub "
1739 "args: type/targ %ld:%"UVuf,
1740 (long)kid->op_type, (UV)kid->op_targ);
1741 kid = kLISTOP->op_first;
1743 while (kid->op_sibling)
1744 kid = kid->op_sibling;
1745 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1747 if (kid->op_type == OP_METHOD_NAMED
1748 || kid->op_type == OP_METHOD)
1752 NewOp(1101, newop, 1, UNOP);
1753 newop->op_type = OP_RV2CV;
1754 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1755 newop->op_first = NULL;
1756 newop->op_next = (OP*)newop;
1757 kid->op_sibling = (OP*)newop;
1758 newop->op_private |= OPpLVAL_INTRO;
1759 newop->op_private &= ~1;
1763 if (kid->op_type != OP_RV2CV)
1765 "panic: unexpected lvalue entersub "
1766 "entry via type/targ %ld:%"UVuf,
1767 (long)kid->op_type, (UV)kid->op_targ);
1768 kid->op_private |= OPpLVAL_INTRO;
1769 break; /* Postpone until runtime */
1773 kid = kUNOP->op_first;
1774 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1775 kid = kUNOP->op_first;
1776 if (kid->op_type == OP_NULL)
1778 "Unexpected constant lvalue entersub "
1779 "entry via type/targ %ld:%"UVuf,
1780 (long)kid->op_type, (UV)kid->op_targ);
1781 if (kid->op_type != OP_GV) {
1782 /* Restore RV2CV to check lvalueness */
1784 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1785 okid->op_next = kid->op_next;
1786 kid->op_next = okid;
1789 okid->op_next = NULL;
1790 okid->op_type = OP_RV2CV;
1792 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1793 okid->op_private |= OPpLVAL_INTRO;
1794 okid->op_private &= ~1;
1798 cv = GvCV(kGVOP_gv);
1808 if (flags & OP_LVALUE_NO_CROAK) return NULL;
1809 /* grep, foreach, subcalls, refgen */
1810 if (type == OP_GREPSTART || type == OP_ENTERSUB
1811 || type == OP_REFGEN || type == OP_LEAVESUBLV)
1813 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1814 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1816 : (o->op_type == OP_ENTERSUB
1817 ? "non-lvalue subroutine call"
1819 type ? PL_op_desc[type] : "local"));
1833 case OP_RIGHT_SHIFT:
1842 if (!(o->op_flags & OPf_STACKED))
1849 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1850 op_lvalue(kid, type);
1855 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1856 PL_modcount = RETURN_UNLIMITED_NUMBER;
1857 return o; /* Treat \(@foo) like ordinary list. */
1861 if (scalar_mod_type(o, type))
1863 ref(cUNOPo->op_first, o->op_type);
1867 if (type == OP_LEAVESUBLV)
1868 o->op_private |= OPpMAYBE_LVSUB;
1874 PL_modcount = RETURN_UNLIMITED_NUMBER;
1877 PL_hints |= HINT_BLOCK_SCOPE;
1878 if (type == OP_LEAVESUBLV)
1879 o->op_private |= OPpMAYBE_LVSUB;
1883 ref(cUNOPo->op_first, o->op_type);
1887 PL_hints |= HINT_BLOCK_SCOPE;
1896 case OP_AELEMFAST_LEX:
1903 PL_modcount = RETURN_UNLIMITED_NUMBER;
1904 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1905 return o; /* Treat \(@foo) like ordinary list. */
1906 if (scalar_mod_type(o, type))
1908 if (type == OP_LEAVESUBLV)
1909 o->op_private |= OPpMAYBE_LVSUB;
1913 if (!type) /* local() */
1914 Perl_croak(aTHX_ "Can't localize lexical variable %"SVf,
1915 PAD_COMPNAME_SV(o->op_targ));
1924 if (type != OP_SASSIGN && type != OP_LEAVESUBLV)
1928 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1934 if (type == OP_LEAVESUBLV)
1935 o->op_private |= OPpMAYBE_LVSUB;
1936 pad_free(o->op_targ);
1937 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1938 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1939 if (o->op_flags & OPf_KIDS)
1940 op_lvalue(cBINOPo->op_first->op_sibling, type);
1945 ref(cBINOPo->op_first, o->op_type);
1946 if (type == OP_ENTERSUB &&
1947 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1948 o->op_private |= OPpLVAL_DEFER;
1949 if (type == OP_LEAVESUBLV)
1950 o->op_private |= OPpMAYBE_LVSUB;
1960 if (o->op_flags & OPf_KIDS)
1961 op_lvalue(cLISTOPo->op_last, type);
1966 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1968 else if (!(o->op_flags & OPf_KIDS))
1970 if (o->op_targ != OP_LIST) {
1971 op_lvalue(cBINOPo->op_first, type);
1977 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1978 op_lvalue(kid, type);
1982 if (type != OP_LEAVESUBLV)
1984 break; /* op_lvalue()ing was handled by ck_return() */
1987 /* [20011101.069] File test operators interpret OPf_REF to mean that
1988 their argument is a filehandle; thus \stat(".") should not set
1990 if (type == OP_REFGEN &&
1991 PL_check[o->op_type] == Perl_ck_ftst)
1994 if (type != OP_LEAVESUBLV)
1995 o->op_flags |= OPf_MOD;
1997 if (type == OP_AASSIGN || type == OP_SASSIGN)
1998 o->op_flags |= OPf_SPECIAL|OPf_REF;
1999 else if (!type) { /* local() */
2002 o->op_private |= OPpLVAL_INTRO;
2003 o->op_flags &= ~OPf_SPECIAL;
2004 PL_hints |= HINT_BLOCK_SCOPE;
2009 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
2010 "Useless localization of %s", OP_DESC(o));
2013 else if (type != OP_GREPSTART && type != OP_ENTERSUB
2014 && type != OP_LEAVESUBLV)
2015 o->op_flags |= OPf_REF;
2020 S_scalar_mod_type(const OP *o, I32 type)
2022 assert(o || type != OP_SASSIGN);
2026 if (o->op_type == OP_RV2GV)
2050 case OP_RIGHT_SHIFT:
2071 S_is_handle_constructor(const OP *o, I32 numargs)
2073 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
2075 switch (o->op_type) {
2083 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
2096 S_refkids(pTHX_ OP *o, I32 type)
2098 if (o && o->op_flags & OPf_KIDS) {
2100 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2107 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
2112 PERL_ARGS_ASSERT_DOREF;
2114 if (!o || (PL_parser && PL_parser->error_count))
2117 switch (o->op_type) {
2119 if ((type == OP_EXISTS || type == OP_DEFINED) &&
2120 !(o->op_flags & OPf_STACKED)) {
2121 o->op_type = OP_RV2CV; /* entersub => rv2cv */
2122 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
2123 assert(cUNOPo->op_first->op_type == OP_NULL);
2124 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
2125 o->op_flags |= OPf_SPECIAL;
2126 o->op_private &= ~1;
2128 else if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV){
2129 o->op_private |= OPpENTERSUB_DEREF;
2130 o->op_flags |= OPf_MOD;
2136 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
2137 doref(kid, type, set_op_ref);
2140 if (type == OP_DEFINED)
2141 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2142 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2145 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
2146 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
2147 : type == OP_RV2HV ? OPpDEREF_HV
2149 o->op_flags |= OPf_MOD;
2156 o->op_flags |= OPf_REF;
2159 if (type == OP_DEFINED)
2160 o->op_flags |= OPf_SPECIAL; /* don't create GV */
2161 doref(cUNOPo->op_first, o->op_type, set_op_ref);
2167 o->op_flags |= OPf_REF;
2172 if (!(o->op_flags & OPf_KIDS))
2174 doref(cBINOPo->op_first, type, set_op_ref);
2178 doref(cBINOPo->op_first, o->op_type, set_op_ref);
2179 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;
2193 if (!(o->op_flags & OPf_KIDS))
2195 doref(cLISTOPo->op_last, type, set_op_ref);
2205 S_dup_attrlist(pTHX_ OP *o)
2210 PERL_ARGS_ASSERT_DUP_ATTRLIST;
2212 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
2213 * where the first kid is OP_PUSHMARK and the remaining ones
2214 * are OP_CONST. We need to push the OP_CONST values.
2216 if (o->op_type == OP_CONST)
2217 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
2219 else if (o->op_type == OP_NULL)
2223 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
2225 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
2226 if (o->op_type == OP_CONST)
2227 rop = op_append_elem(OP_LIST, rop,
2228 newSVOP(OP_CONST, o->op_flags,
2229 SvREFCNT_inc_NN(cSVOPo->op_sv)));
2236 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
2241 PERL_ARGS_ASSERT_APPLY_ATTRS;
2243 /* fake up C<use attributes $pkg,$rv,@attrs> */
2244 ENTER; /* need to protect against side-effects of 'use' */
2245 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2247 #define ATTRSMODULE "attributes"
2248 #define ATTRSMODULE_PM "attributes.pm"
2251 /* Don't force the C<use> if we don't need it. */
2252 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
2253 if (svp && *svp != &PL_sv_undef)
2254 NOOP; /* already in %INC */
2256 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
2257 newSVpvs(ATTRSMODULE), NULL);
2260 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2261 newSVpvs(ATTRSMODULE),
2263 op_prepend_elem(OP_LIST,
2264 newSVOP(OP_CONST, 0, stashsv),
2265 op_prepend_elem(OP_LIST,
2266 newSVOP(OP_CONST, 0,
2268 dup_attrlist(attrs))));
2274 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
2277 OP *pack, *imop, *arg;
2280 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
2285 assert(target->op_type == OP_PADSV ||
2286 target->op_type == OP_PADHV ||
2287 target->op_type == OP_PADAV);
2289 /* Ensure that attributes.pm is loaded. */
2290 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
2292 /* Need package name for method call. */
2293 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
2295 /* Build up the real arg-list. */
2296 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
2298 arg = newOP(OP_PADSV, 0);
2299 arg->op_targ = target->op_targ;
2300 arg = op_prepend_elem(OP_LIST,
2301 newSVOP(OP_CONST, 0, stashsv),
2302 op_prepend_elem(OP_LIST,
2303 newUNOP(OP_REFGEN, 0,
2304 op_lvalue(arg, OP_REFGEN)),
2305 dup_attrlist(attrs)));
2307 /* Fake up a method call to import */
2308 meth = newSVpvs_share("import");
2309 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2310 op_append_elem(OP_LIST,
2311 op_prepend_elem(OP_LIST, pack, list(arg)),
2312 newSVOP(OP_METHOD_NAMED, 0, meth)));
2313 imop->op_private |= OPpENTERSUB_NOMOD;
2315 /* Combine the ops. */
2316 *imopsp = op_append_elem(OP_LIST, *imopsp, imop);
2320 =notfor apidoc apply_attrs_string
2322 Attempts to apply a list of attributes specified by the C<attrstr> and
2323 C<len> arguments to the subroutine identified by the C<cv> argument which
2324 is expected to be associated with the package identified by the C<stashpv>
2325 argument (see L<attributes>). It gets this wrong, though, in that it
2326 does not correctly identify the boundaries of the individual attribute
2327 specifications within C<attrstr>. This is not really intended for the
2328 public API, but has to be listed here for systems such as AIX which
2329 need an explicit export list for symbols. (It's called from XS code
2330 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2331 to respect attribute syntax properly would be welcome.
2337 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2338 const char *attrstr, STRLEN len)
2342 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2345 len = strlen(attrstr);
2349 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2351 const char * const sstr = attrstr;
2352 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2353 attrs = op_append_elem(OP_LIST, attrs,
2354 newSVOP(OP_CONST, 0,
2355 newSVpvn(sstr, attrstr-sstr)));
2359 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2360 newSVpvs(ATTRSMODULE),
2361 NULL, op_prepend_elem(OP_LIST,
2362 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2363 op_prepend_elem(OP_LIST,
2364 newSVOP(OP_CONST, 0,
2365 newRV(MUTABLE_SV(cv))),
2370 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2374 const bool stately = PL_parser && PL_parser->in_my == KEY_state;
2376 PERL_ARGS_ASSERT_MY_KID;
2378 if (!o || (PL_parser && PL_parser->error_count))
2382 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2383 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2387 if (type == OP_LIST) {
2389 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2390 my_kid(kid, attrs, imopsp);
2391 } else if (type == OP_UNDEF
2397 } else if (type == OP_RV2SV || /* "our" declaration */
2399 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2400 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2401 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2403 PL_parser->in_my == KEY_our
2405 : PL_parser->in_my == KEY_state ? "state" : "my"));
2407 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2408 PL_parser->in_my = FALSE;
2409 PL_parser->in_my_stash = NULL;
2410 apply_attrs(GvSTASH(gv),
2411 (type == OP_RV2SV ? GvSV(gv) :
2412 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2413 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2416 o->op_private |= OPpOUR_INTRO;
2419 else if (type != OP_PADSV &&
2422 type != OP_PUSHMARK)
2424 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2426 PL_parser->in_my == KEY_our
2428 : PL_parser->in_my == KEY_state ? "state" : "my"));
2431 else if (attrs && type != OP_PUSHMARK) {
2434 PL_parser->in_my = FALSE;
2435 PL_parser->in_my_stash = NULL;
2437 /* check for C<my Dog $spot> when deciding package */
2438 stash = PAD_COMPNAME_TYPE(o->op_targ);
2440 stash = PL_curstash;
2441 apply_attrs_my(stash, o, attrs, imopsp);
2443 o->op_flags |= OPf_MOD;
2444 o->op_private |= OPpLVAL_INTRO;
2446 o->op_private |= OPpPAD_STATE;
2451 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2455 int maybe_scalar = 0;
2457 PERL_ARGS_ASSERT_MY_ATTRS;
2459 /* [perl #17376]: this appears to be premature, and results in code such as
2460 C< our(%x); > executing in list mode rather than void mode */
2462 if (o->op_flags & OPf_PARENS)
2472 o = my_kid(o, attrs, &rops);
2474 if (maybe_scalar && o->op_type == OP_PADSV) {
2475 o = scalar(op_append_list(OP_LIST, rops, o));
2476 o->op_private |= OPpLVAL_INTRO;
2479 /* The listop in rops might have a pushmark at the beginning,
2480 which will mess up list assignment. */
2481 LISTOP * const lrops = (LISTOP *)rops; /* for brevity */
2482 if (rops->op_type == OP_LIST &&
2483 lrops->op_first && lrops->op_first->op_type == OP_PUSHMARK)
2485 OP * const pushmark = lrops->op_first;
2486 lrops->op_first = pushmark->op_sibling;
2489 o = op_append_list(OP_LIST, o, rops);
2492 PL_parser->in_my = FALSE;
2493 PL_parser->in_my_stash = NULL;
2498 Perl_sawparens(pTHX_ OP *o)
2500 PERL_UNUSED_CONTEXT;
2502 o->op_flags |= OPf_PARENS;
2507 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2511 const OPCODE ltype = left->op_type;
2512 const OPCODE rtype = right->op_type;
2514 PERL_ARGS_ASSERT_BIND_MATCH;
2516 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2517 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2519 const char * const desc
2521 rtype == OP_SUBST || rtype == OP_TRANS
2522 || rtype == OP_TRANSR
2524 ? (int)rtype : OP_MATCH];
2525 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
2526 ? "@array" : "%hash");
2527 Perl_warner(aTHX_ packWARN(WARN_MISC),
2528 "Applying %s to %s will act on scalar(%s)",
2529 desc, sample, sample);
2532 if (rtype == OP_CONST &&
2533 cSVOPx(right)->op_private & OPpCONST_BARE &&
2534 cSVOPx(right)->op_private & OPpCONST_STRICT)
2536 no_bareword_allowed(right);
2539 /* !~ doesn't make sense with /r, so error on it for now */
2540 if (rtype == OP_SUBST && (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT) &&
2542 yyerror("Using !~ with s///r doesn't make sense");
2543 if (rtype == OP_TRANSR && type == OP_NOT)
2544 yyerror("Using !~ with tr///r doesn't make sense");
2546 ismatchop = (rtype == OP_MATCH ||
2547 rtype == OP_SUBST ||
2548 rtype == OP_TRANS || rtype == OP_TRANSR)
2549 && !(right->op_flags & OPf_SPECIAL);
2550 if (ismatchop && right->op_private & OPpTARGET_MY) {
2552 right->op_private &= ~OPpTARGET_MY;
2554 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2557 right->op_flags |= OPf_STACKED;
2558 if (rtype != OP_MATCH && rtype != OP_TRANSR &&
2559 ! (rtype == OP_TRANS &&
2560 right->op_private & OPpTRANS_IDENTICAL) &&
2561 ! (rtype == OP_SUBST &&
2562 (cPMOPx(right)->op_pmflags & PMf_NONDESTRUCT)))
2563 newleft = op_lvalue(left, rtype);
2566 if (right->op_type == OP_TRANS || right->op_type == OP_TRANSR)
2567 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2569 o = op_prepend_elem(rtype, scalar(newleft), right);
2571 return newUNOP(OP_NOT, 0, scalar(o));
2575 return bind_match(type, left,
2576 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
2580 Perl_invert(pTHX_ OP *o)
2584 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2588 =for apidoc Amx|OP *|op_scope|OP *o
2590 Wraps up an op tree with some additional ops so that at runtime a dynamic
2591 scope will be created. The original ops run in the new dynamic scope,
2592 and then, provided that they exit normally, the scope will be unwound.
2593 The additional ops used to create and unwind the dynamic scope will
2594 normally be an C<enter>/C<leave> pair, but a C<scope> op may be used
2595 instead if the ops are simple enough to not need the full dynamic scope
2602 Perl_op_scope(pTHX_ OP *o)
2606 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2607 o = op_prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2608 o->op_type = OP_LEAVE;
2609 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2611 else if (o->op_type == OP_LINESEQ) {
2613 o->op_type = OP_SCOPE;
2614 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2615 kid = ((LISTOP*)o)->op_first;
2616 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2619 /* The following deals with things like 'do {1 for 1}' */
2620 kid = kid->op_sibling;
2622 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2627 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2633 Perl_block_start(pTHX_ int full)
2636 const int retval = PL_savestack_ix;
2638 pad_block_start(full);
2640 PL_hints &= ~HINT_BLOCK_SCOPE;
2641 SAVECOMPILEWARNINGS();
2642 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2644 CALL_BLOCK_HOOKS(bhk_start, full);
2650 Perl_block_end(pTHX_ I32 floor, OP *seq)
2653 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2654 OP* retval = scalarseq(seq);
2656 CALL_BLOCK_HOOKS(bhk_pre_end, &retval);
2659 CopHINTS_set(&PL_compiling, PL_hints);
2661 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2664 CALL_BLOCK_HOOKS(bhk_post_end, &retval);
2670 =head1 Compile-time scope hooks
2672 =for apidoc Aox||blockhook_register
2674 Register a set of hooks to be called when the Perl lexical scope changes
2675 at compile time. See L<perlguts/"Compile-time scope hooks">.
2681 Perl_blockhook_register(pTHX_ BHK *hk)
2683 PERL_ARGS_ASSERT_BLOCKHOOK_REGISTER;
2685 Perl_av_create_and_push(aTHX_ &PL_blockhooks, newSViv(PTR2IV(hk)));
2692 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
2693 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2694 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2697 OP * const o = newOP(OP_PADSV, 0);
2698 o->op_targ = offset;
2704 Perl_newPROG(pTHX_ OP *o)
2708 PERL_ARGS_ASSERT_NEWPROG;
2714 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2715 ((PL_in_eval & EVAL_KEEPERR)
2716 ? OPf_SPECIAL : 0), o);
2718 cx = &cxstack[cxstack_ix];
2719 assert(CxTYPE(cx) == CXt_EVAL);
2721 if ((cx->blk_gimme & G_WANT) == G_VOID)
2722 scalarvoid(PL_eval_root);
2723 else if ((cx->blk_gimme & G_WANT) == G_ARRAY)
2726 scalar(PL_eval_root);
2728 /* don't use LINKLIST, since PL_eval_root might indirect through
2729 * a rather expensive function call and LINKLIST evaluates its
2730 * argument more than once */
2731 PL_eval_start = op_linklist(PL_eval_root);
2732 PL_eval_root->op_private |= OPpREFCOUNTED;
2733 OpREFCNT_set(PL_eval_root, 1);
2734 PL_eval_root->op_next = 0;
2735 CALL_PEEP(PL_eval_start);
2736 finalize_optree(PL_eval_root);
2740 if (o->op_type == OP_STUB) {
2741 PL_comppad_name = 0;
2743 S_op_destroy(aTHX_ o);
2746 PL_main_root = op_scope(sawparens(scalarvoid(o)));
2747 PL_curcop = &PL_compiling;
2748 PL_main_start = LINKLIST(PL_main_root);
2749 PL_main_root->op_private |= OPpREFCOUNTED;
2750 OpREFCNT_set(PL_main_root, 1);
2751 PL_main_root->op_next = 0;
2752 CALL_PEEP(PL_main_start);
2753 finalize_optree(PL_main_root);
2756 /* Register with debugger */
2758 CV * const cv = get_cvs("DB::postponed", 0);
2762 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
2764 call_sv(MUTABLE_SV(cv), G_DISCARD);
2771 Perl_localize(pTHX_ OP *o, I32 lex)
2775 PERL_ARGS_ASSERT_LOCALIZE;
2777 if (o->op_flags & OPf_PARENS)
2778 /* [perl #17376]: this appears to be premature, and results in code such as
2779 C< our(%x); > executing in list mode rather than void mode */
2786 if ( PL_parser->bufptr > PL_parser->oldbufptr
2787 && PL_parser->bufptr[-1] == ','
2788 && ckWARN(WARN_PARENTHESIS))
2790 char *s = PL_parser->bufptr;
2793 /* some heuristics to detect a potential error */
2794 while (*s && (strchr(", \t\n", *s)))
2798 if (*s && strchr("@$%*", *s) && *++s
2799 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2802 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2804 while (*s && (strchr(", \t\n", *s)))
2810 if (sigil && (*s == ';' || *s == '=')) {
2811 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2812 "Parentheses missing around \"%s\" list",
2814 ? (PL_parser->in_my == KEY_our
2816 : PL_parser->in_my == KEY_state
2826 o = op_lvalue(o, OP_NULL); /* a bit kludgey */
2827 PL_parser->in_my = FALSE;
2828 PL_parser->in_my_stash = NULL;
2833 Perl_jmaybe(pTHX_ OP *o)
2835 PERL_ARGS_ASSERT_JMAYBE;
2837 if (o->op_type == OP_LIST) {
2839 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2840 o = convert(OP_JOIN, 0, op_prepend_elem(OP_LIST, o2, o));
2846 S_fold_constants(pTHX_ register OP *o)
2849 register OP * VOL curop;
2851 VOL I32 type = o->op_type;
2856 SV * const oldwarnhook = PL_warnhook;
2857 SV * const olddiehook = PL_diehook;
2861 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2863 if (PL_opargs[type] & OA_RETSCALAR)
2865 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2866 o->op_targ = pad_alloc(type, SVs_PADTMP);
2868 /* integerize op, unless it happens to be C<-foo>.
2869 * XXX should pp_i_negate() do magic string negation instead? */
2870 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2871 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2872 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2874 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2877 if (!(PL_opargs[type] & OA_FOLDCONST))
2882 /* XXX might want a ck_negate() for this */
2883 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2895 /* XXX what about the numeric ops? */
2896 if (PL_hints & HINT_LOCALE)
2901 if (PL_parser && PL_parser->error_count)
2902 goto nope; /* Don't try to run w/ errors */
2904 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2905 const OPCODE type = curop->op_type;
2906 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2908 type != OP_SCALAR &&
2910 type != OP_PUSHMARK)
2916 curop = LINKLIST(o);
2917 old_next = o->op_next;
2921 oldscope = PL_scopestack_ix;
2922 create_eval_scope(G_FAKINGEVAL);
2924 /* Verify that we don't need to save it: */
2925 assert(PL_curcop == &PL_compiling);
2926 StructCopy(&PL_compiling, ¬_compiling, COP);
2927 PL_curcop = ¬_compiling;
2928 /* The above ensures that we run with all the correct hints of the
2929 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
2930 assert(IN_PERL_RUNTIME);
2931 PL_warnhook = PERL_WARNHOOK_FATAL;
2938 sv = *(PL_stack_sp--);
2939 if (o->op_targ && sv == PAD_SV(o->op_targ)) { /* grab pad temp? */
2941 /* Can't simply swipe the SV from the pad, because that relies on
2942 the op being freed "real soon now". Under MAD, this doesn't
2943 happen (see the #ifdef below). */
2946 pad_swipe(o->op_targ, FALSE);
2949 else if (SvTEMP(sv)) { /* grab mortal temp? */
2950 SvREFCNT_inc_simple_void(sv);
2955 /* Something tried to die. Abandon constant folding. */
2956 /* Pretend the error never happened. */
2958 o->op_next = old_next;
2962 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
2963 PL_warnhook = oldwarnhook;
2964 PL_diehook = olddiehook;
2965 /* XXX note that this croak may fail as we've already blown away
2966 * the stack - eg any nested evals */
2967 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
2970 PL_warnhook = oldwarnhook;
2971 PL_diehook = olddiehook;
2972 PL_curcop = &PL_compiling;
2974 if (PL_scopestack_ix > oldscope)
2975 delete_eval_scope();
2984 if (type == OP_RV2GV)
2985 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
2987 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
2988 op_getmad(o,newop,'f');
2996 S_gen_constant_list(pTHX_ register OP *o)
3000 const I32 oldtmps_floor = PL_tmps_floor;
3003 if (PL_parser && PL_parser->error_count)
3004 return o; /* Don't attempt to run with errors */
3006 PL_op = curop = LINKLIST(o);
3009 Perl_pp_pushmark(aTHX);
3012 assert (!(curop->op_flags & OPf_SPECIAL));
3013 assert(curop->op_type == OP_RANGE);
3014 Perl_pp_anonlist(aTHX);
3015 PL_tmps_floor = oldtmps_floor;
3017 o->op_type = OP_RV2AV;
3018 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
3019 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
3020 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
3021 o->op_opt = 0; /* needs to be revisited in rpeep() */
3022 curop = ((UNOP*)o)->op_first;
3023 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
3025 op_getmad(curop,o,'O');
3034 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
3037 if (!o || o->op_type != OP_LIST)
3038 o = newLISTOP(OP_LIST, 0, o, NULL);
3040 o->op_flags &= ~OPf_WANT;
3042 if (!(PL_opargs[type] & OA_MARK))
3043 op_null(cLISTOPo->op_first);
3045 o->op_type = (OPCODE)type;
3046 o->op_ppaddr = PL_ppaddr[type];
3047 o->op_flags |= flags;
3049 o = CHECKOP(type, o);
3050 if (o->op_type != (unsigned)type)
3053 return fold_constants(o);
3057 =head1 Optree Manipulation Functions
3060 /* List constructors */
3063 =for apidoc Am|OP *|op_append_elem|I32 optype|OP *first|OP *last
3065 Append an item to the list of ops contained directly within a list-type
3066 op, returning the lengthened list. I<first> is the list-type op,
3067 and I<last> is the op to append to the list. I<optype> specifies the
3068 intended opcode for the list. If I<first> is not already a list of the
3069 right type, it will be upgraded into one. If either I<first> or I<last>
3070 is null, the other is returned unchanged.
3076 Perl_op_append_elem(pTHX_ I32 type, OP *first, OP *last)
3084 if (first->op_type != (unsigned)type
3085 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
3087 return newLISTOP(type, 0, first, last);
3090 if (first->op_flags & OPf_KIDS)
3091 ((LISTOP*)first)->op_last->op_sibling = last;
3093 first->op_flags |= OPf_KIDS;
3094 ((LISTOP*)first)->op_first = last;
3096 ((LISTOP*)first)->op_last = last;
3101 =for apidoc Am|OP *|op_append_list|I32 optype|OP *first|OP *last
3103 Concatenate the lists of ops contained directly within two list-type ops,
3104 returning the combined list. I<first> and I<last> are the list-type ops
3105 to concatenate. I<optype> specifies the intended opcode for the list.
3106 If either I<first> or I<last> is not already a list of the right type,
3107 it will be upgraded into one. If either I<first> or I<last> is null,
3108 the other is returned unchanged.
3114 Perl_op_append_list(pTHX_ I32 type, OP *first, OP *last)
3122 if (first->op_type != (unsigned)type)
3123 return op_prepend_elem(type, first, last);
3125 if (last->op_type != (unsigned)type)
3126 return op_append_elem(type, first, last);
3128 ((LISTOP*)first)->op_last->op_sibling = ((LISTOP*)last)->op_first;
3129 ((LISTOP*)first)->op_last = ((LISTOP*)last)->op_last;
3130 first->op_flags |= (last->op_flags & OPf_KIDS);
3133 if (((LISTOP*)last)->op_first && first->op_madprop) {
3134 MADPROP *mp = ((LISTOP*)last)->op_first->op_madprop;
3136 while (mp->mad_next)
3138 mp->mad_next = first->op_madprop;
3141 ((LISTOP*)last)->op_first->op_madprop = first->op_madprop;
3144 first->op_madprop = last->op_madprop;
3145 last->op_madprop = 0;
3148 S_op_destroy(aTHX_ last);
3154 =for apidoc Am|OP *|op_prepend_elem|I32 optype|OP *first|OP *last
3156 Prepend an item to the list of ops contained directly within a list-type
3157 op, returning the lengthened list. I<first> is the op to prepend to the
3158 list, and I<last> is the list-type op. I<optype> specifies the intended
3159 opcode for the list. If I<last> is not already a list of the right type,
3160 it will be upgraded into one. If either I<first> or I<last> is null,
3161 the other is returned unchanged.
3167 Perl_op_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
3175 if (last->op_type == (unsigned)type) {
3176 if (type == OP_LIST) { /* already a PUSHMARK there */
3177 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
3178 ((LISTOP*)last)->op_first->op_sibling = first;
3179 if (!(first->op_flags & OPf_PARENS))
3180 last->op_flags &= ~OPf_PARENS;
3183 if (!(last->op_flags & OPf_KIDS)) {
3184 ((LISTOP*)last)->op_last = first;
3185 last->op_flags |= OPf_KIDS;
3187 first->op_sibling = ((LISTOP*)last)->op_first;
3188 ((LISTOP*)last)->op_first = first;
3190 last->op_flags |= OPf_KIDS;
3194 return newLISTOP(type, 0, first, last);
3202 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
3205 Newxz(tk, 1, TOKEN);
3206 tk->tk_type = (OPCODE)optype;
3207 tk->tk_type = 12345;
3209 tk->tk_mad = madprop;
3214 Perl_token_free(pTHX_ TOKEN* tk)
3216 PERL_ARGS_ASSERT_TOKEN_FREE;
3218 if (tk->tk_type != 12345)
3220 mad_free(tk->tk_mad);
3225 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
3230 PERL_ARGS_ASSERT_TOKEN_GETMAD;
3232 if (tk->tk_type != 12345) {
3233 Perl_warner(aTHX_ packWARN(WARN_MISC),
3234 "Invalid TOKEN object ignored");
3241 /* faked up qw list? */
3243 tm->mad_type == MAD_SV &&
3244 SvPVX((SV *)tm->mad_val)[0] == 'q')
3251 /* pretend constant fold didn't happen? */
3252 if (mp->mad_key == 'f' &&
3253 (o->op_type == OP_CONST ||
3254 o->op_type == OP_GV) )
3256 token_getmad(tk,(OP*)mp->mad_val,slot);
3270 if (mp->mad_key == 'X')
3271 mp->mad_key = slot; /* just change the first one */
3281 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
3290 /* pretend constant fold didn't happen? */
3291 if (mp->mad_key == 'f' &&
3292 (o->op_type == OP_CONST ||
3293 o->op_type == OP_GV) )
3295 op_getmad(from,(OP*)mp->mad_val,slot);
3302 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
3305 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
3311 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
3320 /* pretend constant fold didn't happen? */
3321 if (mp->mad_key == 'f' &&
3322 (o->op_type == OP_CONST ||
3323 o->op_type == OP_GV) )
3325 op_getmad(from,(OP*)mp->mad_val,slot);
3332 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
3335 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
3339 PerlIO_printf(PerlIO_stderr(),
3340 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
3346 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
3364 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
3368 addmad(tm, &(o->op_madprop), slot);
3372 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
3393 Perl_newMADsv(pTHX_ char key, SV* sv)
3395 PERL_ARGS_ASSERT_NEWMADSV;
3397 return newMADPROP(key, MAD_SV, sv, 0);
3401 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
3403 MADPROP *const mp = (MADPROP *) PerlMemShared_malloc(sizeof(MADPROP));
3406 mp->mad_vlen = vlen;
3407 mp->mad_type = type;
3409 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
3414 Perl_mad_free(pTHX_ MADPROP* mp)
3416 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
3420 mad_free(mp->mad_next);
3421 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
3422 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
3423 switch (mp->mad_type) {
3427 Safefree((char*)mp->mad_val);
3430 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
3431 op_free((OP*)mp->mad_val);
3434 sv_free(MUTABLE_SV(mp->mad_val));
3437 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3440 PerlMemShared_free(mp);
3446 =head1 Optree construction
3448 =for apidoc Am|OP *|newNULLLIST
3450 Constructs, checks, and returns a new C<stub> op, which represents an
3451 empty list expression.
3457 Perl_newNULLLIST(pTHX)
3459 return newOP(OP_STUB, 0);
3463 S_force_list(pTHX_ OP *o)
3465 if (!o || o->op_type != OP_LIST)
3466 o = newLISTOP(OP_LIST, 0, o, NULL);
3472 =for apidoc Am|OP *|newLISTOP|I32 type|I32 flags|OP *first|OP *last
3474 Constructs, checks, and returns an op of any list type. I<type> is
3475 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3476 C<OPf_KIDS> will be set automatically if required. I<first> and I<last>
3477 supply up to two ops to be direct children of the list op; they are
3478 consumed by this function and become part of the constructed op tree.
3484 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3489 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3491 NewOp(1101, listop, 1, LISTOP);
3493 listop->op_type = (OPCODE)type;
3494 listop->op_ppaddr = PL_ppaddr[type];
3497 listop->op_flags = (U8)flags;
3501 else if (!first && last)
3504 first->op_sibling = last;
3505 listop->op_first = first;
3506 listop->op_last = last;
3507 if (type == OP_LIST) {
3508 OP* const pushop = newOP(OP_PUSHMARK, 0);
3509 pushop->op_sibling = first;
3510 listop->op_first = pushop;
3511 listop->op_flags |= OPf_KIDS;
3513 listop->op_last = pushop;
3516 return CHECKOP(type, listop);
3520 =for apidoc Am|OP *|newOP|I32 type|I32 flags
3522 Constructs, checks, and returns an op of any base type (any type that
3523 has no extra fields). I<type> is the opcode. I<flags> gives the
3524 eight bits of C<op_flags>, and, shifted up eight bits, the eight bits
3531 Perl_newOP(pTHX_ I32 type, I32 flags)
3536 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3537 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3538 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3539 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3541 NewOp(1101, o, 1, OP);
3542 o->op_type = (OPCODE)type;
3543 o->op_ppaddr = PL_ppaddr[type];
3544 o->op_flags = (U8)flags;
3546 o->op_latefreed = 0;
3550 o->op_private = (U8)(0 | (flags >> 8));
3551 if (PL_opargs[type] & OA_RETSCALAR)
3553 if (PL_opargs[type] & OA_TARGET)
3554 o->op_targ = pad_alloc(type, SVs_PADTMP);
3555 return CHECKOP(type, o);
3559 =for apidoc Am|OP *|newUNOP|I32 type|I32 flags|OP *first
3561 Constructs, checks, and returns an op of any unary type. I<type> is
3562 the opcode. I<flags> gives the eight bits of C<op_flags>, except that
3563 C<OPf_KIDS> will be set automatically if required, and, shifted up eight
3564 bits, the eight bits of C<op_private>, except that the bit with value 1
3565 is automatically set. I<first> supplies an optional op to be the direct
3566 child of the unary op; it is consumed by this function and become part
3567 of the constructed op tree.
3573 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3578 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3579 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3580 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3581 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3582 || type == OP_SASSIGN
3583 || type == OP_ENTERTRY
3584 || type == OP_NULL );
3587 first = newOP(OP_STUB, 0);
3588 if (PL_opargs[type] & OA_MARK)
3589 first = force_list(first);
3591 NewOp(1101, unop, 1, UNOP);
3592 unop->op_type = (OPCODE)type;
3593 unop->op_ppaddr = PL_ppaddr[type];
3594 unop->op_first = first;
3595 unop->op_flags = (U8)(flags | OPf_KIDS);
3596 unop->op_private = (U8)(1 | (flags >> 8));
3597 unop = (UNOP*) CHECKOP(type, unop);
3601 return fold_constants((OP *) unop);
3605 =for apidoc Am|OP *|newBINOP|I32 type|I32 flags|OP *first|OP *last
3607 Constructs, checks, and returns an op of any binary type. I<type>
3608 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
3609 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
3610 the eight bits of C<op_private>, except that the bit with value 1 or
3611 2 is automatically set as required. I<first> and I<last> supply up to
3612 two ops to be the direct children of the binary op; they are consumed
3613 by this function and become part of the constructed op tree.
3619 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3624 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3625 || type == OP_SASSIGN || type == OP_NULL );
3627 NewOp(1101, binop, 1, BINOP);
3630 first = newOP(OP_NULL, 0);
3632 binop->op_type = (OPCODE)type;
3633 binop->op_ppaddr = PL_ppaddr[type];
3634 binop->op_first = first;
3635 binop->op_flags = (U8)(flags | OPf_KIDS);
3638 binop->op_private = (U8)(1 | (flags >> 8));
3641 binop->op_private = (U8)(2 | (flags >> 8));
3642 first->op_sibling = last;
3645 binop = (BINOP*)CHECKOP(type, binop);
3646 if (binop->op_next || binop->op_type != (OPCODE)type)
3649 binop->op_last = binop->op_first->op_sibling;
3651 return fold_constants((OP *)binop);
3654 static int uvcompare(const void *a, const void *b)
3655 __attribute__nonnull__(1)
3656 __attribute__nonnull__(2)
3657 __attribute__pure__;
3658 static int uvcompare(const void *a, const void *b)
3660 if (*((const UV *)a) < (*(const UV *)b))
3662 if (*((const UV *)a) > (*(const UV *)b))
3664 if (*((const UV *)a+1) < (*(const UV *)b+1))
3666 if (*((const UV *)a+1) > (*(const UV *)b+1))
3672 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3675 SV * const tstr = ((SVOP*)expr)->op_sv;
3678 (repl->op_type == OP_NULL)
3679 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3681 ((SVOP*)repl)->op_sv;
3684 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3685 const U8 *r = (U8*)SvPV_const(rstr, rlen);
3689 register short *tbl;
3691 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3692 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3693 I32 del = o->op_private & OPpTRANS_DELETE;
3696 PERL_ARGS_ASSERT_PMTRANS;
3698 PL_hints |= HINT_BLOCK_SCOPE;
3701 o->op_private |= OPpTRANS_FROM_UTF;
3704 o->op_private |= OPpTRANS_TO_UTF;
3706 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
3707 SV* const listsv = newSVpvs("# comment\n");
3709 const U8* tend = t + tlen;
3710 const U8* rend = r + rlen;
3724 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3725 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
3728 const U32 flags = UTF8_ALLOW_DEFAULT;
3732 t = tsave = bytes_to_utf8(t, &len);
3735 if (!to_utf && rlen) {
3737 r = rsave = bytes_to_utf8(r, &len);
3741 /* There are several snags with this code on EBCDIC:
3742 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3743 2. scan_const() in toke.c has encoded chars in native encoding which makes
3744 ranges at least in EBCDIC 0..255 range the bottom odd.
3748 U8 tmpbuf[UTF8_MAXBYTES+1];
3751 Newx(cp, 2*tlen, UV);
3753 transv = newSVpvs("");
3755 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3757 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
3759 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3763 cp[2*i+1] = cp[2*i];
3767 qsort(cp, i, 2*sizeof(UV), uvcompare);
3768 for (j = 0; j < i; j++) {
3770 diff = val - nextmin;
3772 t = uvuni_to_utf8(tmpbuf,nextmin);
3773 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3775 U8 range_mark = UTF_TO_NATIVE(0xff);
3776 t = uvuni_to_utf8(tmpbuf, val - 1);
3777 sv_catpvn(transv, (char *)&range_mark, 1);
3778 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3785 t = uvuni_to_utf8(tmpbuf,nextmin);
3786 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3788 U8 range_mark = UTF_TO_NATIVE(0xff);
3789 sv_catpvn(transv, (char *)&range_mark, 1);
3791 t = uvuni_to_utf8(tmpbuf, 0x7fffffff);
3792 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3793 t = (const U8*)SvPVX_const(transv);
3794 tlen = SvCUR(transv);
3798 else if (!rlen && !del) {
3799 r = t; rlen = tlen; rend = tend;
3802 if ((!rlen && !del) || t == r ||
3803 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
3805 o->op_private |= OPpTRANS_IDENTICAL;
3809 while (t < tend || tfirst <= tlast) {
3810 /* see if we need more "t" chars */
3811 if (tfirst > tlast) {
3812 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3814 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
3816 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3823 /* now see if we need more "r" chars */
3824 if (rfirst > rlast) {
3826 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3828 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
3830 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3839 rfirst = rlast = 0xffffffff;
3843 /* now see which range will peter our first, if either. */
3844 tdiff = tlast - tfirst;
3845 rdiff = rlast - rfirst;
3852 if (rfirst == 0xffffffff) {
3853 diff = tdiff; /* oops, pretend rdiff is infinite */
3855 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
3856 (long)tfirst, (long)tlast);
3858 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
3862 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
3863 (long)tfirst, (long)(tfirst + diff),
3866 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
3867 (long)tfirst, (long)rfirst);
3869 if (rfirst + diff > max)
3870 max = rfirst + diff;
3872 grows = (tfirst < rfirst &&
3873 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
3885 else if (max > 0xff)
3890 PerlMemShared_free(cPVOPo->op_pv);
3891 cPVOPo->op_pv = NULL;
3893 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
3895 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
3896 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
3897 PAD_SETSV(cPADOPo->op_padix, swash);
3899 SvREADONLY_on(swash);
3901 cSVOPo->op_sv = swash;
3903 SvREFCNT_dec(listsv);
3904 SvREFCNT_dec(transv);
3906 if (!del && havefinal && rlen)
3907 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
3908 newSVuv((UV)final), 0);
3911 o->op_private |= OPpTRANS_GROWS;
3917 op_getmad(expr,o,'e');
3918 op_getmad(repl,o,'r');
3926 tbl = (short*)cPVOPo->op_pv;
3928 Zero(tbl, 256, short);
3929 for (i = 0; i < (I32)tlen; i++)
3931 for (i = 0, j = 0; i < 256; i++) {
3933 if (j >= (I32)rlen) {
3942 if (i < 128 && r[j] >= 128)
3952 o->op_private |= OPpTRANS_IDENTICAL;
3954 else if (j >= (I32)rlen)
3959 PerlMemShared_realloc(tbl,
3960 (0x101+rlen-j) * sizeof(short));
3961 cPVOPo->op_pv = (char*)tbl;
3963 tbl[0x100] = (short)(rlen - j);
3964 for (i=0; i < (I32)rlen - j; i++)
3965 tbl[0x101+i] = r[j+i];
3969 if (!rlen && !del) {
3972 o->op_private |= OPpTRANS_IDENTICAL;
3974 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
3975 o->op_private |= OPpTRANS_IDENTICAL;
3977 for (i = 0; i < 256; i++)
3979 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
3980 if (j >= (I32)rlen) {
3982 if (tbl[t[i]] == -1)
3988 if (tbl[t[i]] == -1) {
3989 if (t[i] < 128 && r[j] >= 128)
3996 if(del && rlen == tlen) {
3997 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
3998 } else if(rlen > tlen) {
3999 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
4003 o->op_private |= OPpTRANS_GROWS;
4005 op_getmad(expr,o,'e');
4006 op_getmad(repl,o,'r');
4016 =for apidoc Am|OP *|newPMOP|I32 type|I32 flags
4018 Constructs, checks, and returns an op of any pattern matching type.
4019 I<type> is the opcode. I<flags> gives the eight bits of C<op_flags>
4020 and, shifted up eight bits, the eight bits of C<op_private>.
4026 Perl_newPMOP(pTHX_ I32 type, I32 flags)
4031 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
4033 NewOp(1101, pmop, 1, PMOP);
4034 pmop->op_type = (OPCODE)type;
4035 pmop->op_ppaddr = PL_ppaddr[type];
4036 pmop->op_flags = (U8)flags;
4037 pmop->op_private = (U8)(0 | (flags >> 8));
4039 if (PL_hints & HINT_RE_TAINT)
4040 pmop->op_pmflags |= PMf_RETAINT;
4041 if (PL_hints & HINT_LOCALE) {
4042 set_regex_charset(&(pmop->op_pmflags), REGEX_LOCALE_CHARSET);
4044 else if ((! (PL_hints & HINT_BYTES)) && (PL_hints & HINT_UNI_8_BIT)) {
4045 set_regex_charset(&(pmop->op_pmflags), REGEX_UNICODE_CHARSET);
4047 if (PL_hints & HINT_RE_FLAGS) {
4048 SV *reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4049 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags"), 0, 0
4051 if (reflags && SvOK(reflags)) pmop->op_pmflags |= SvIV(reflags);
4052 reflags = Perl_refcounted_he_fetch_pvn(aTHX_
4053 PL_compiling.cop_hints_hash, STR_WITH_LEN("reflags_charset"), 0, 0
4055 if (reflags && SvOK(reflags)) {
4056 set_regex_charset(&(pmop->op_pmflags), (regex_charset)SvIV(reflags));
4062 assert(SvPOK(PL_regex_pad[0]));
4063 if (SvCUR(PL_regex_pad[0])) {
4064 /* Pop off the "packed" IV from the end. */
4065 SV *const repointer_list = PL_regex_pad[0];
4066 const char *p = SvEND(repointer_list) - sizeof(IV);
4067 const IV offset = *((IV*)p);
4069 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
4071 SvEND_set(repointer_list, p);
4073 pmop->op_pmoffset = offset;
4074 /* This slot should be free, so assert this: */
4075 assert(PL_regex_pad[offset] == &PL_sv_undef);
4077 SV * const repointer = &PL_sv_undef;
4078 av_push(PL_regex_padav, repointer);
4079 pmop->op_pmoffset = av_len(PL_regex_padav);
4080 PL_regex_pad = AvARRAY(PL_regex_padav);
4084 return CHECKOP(type, pmop);
4087 /* Given some sort of match op o, and an expression expr containing a
4088 * pattern, either compile expr into a regex and attach it to o (if it's
4089 * constant), or convert expr into a runtime regcomp op sequence (if it's
4092 * isreg indicates that the pattern is part of a regex construct, eg
4093 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
4094 * split "pattern", which aren't. In the former case, expr will be a list
4095 * if the pattern contains more than one term (eg /a$b/) or if it contains
4096 * a replacement, ie s/// or tr///.
4100 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
4105 I32 repl_has_vars = 0;
4109 PERL_ARGS_ASSERT_PMRUNTIME;
4112 o->op_type == OP_SUBST
4113 || o->op_type == OP_TRANS || o->op_type == OP_TRANSR
4115 /* last element in list is the replacement; pop it */
4117 repl = cLISTOPx(expr)->op_last;
4118 kid = cLISTOPx(expr)->op_first;
4119 while (kid->op_sibling != repl)
4120 kid = kid->op_sibling;
4121 kid->op_sibling = NULL;
4122 cLISTOPx(expr)->op_last = kid;
4125 if (isreg && expr->op_type == OP_LIST &&
4126 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
4128 /* convert single element list to element */
4129 OP* const oe = expr;
4130 expr = cLISTOPx(oe)->op_first->op_sibling;
4131 cLISTOPx(oe)->op_first->op_sibling = NULL;
4132 cLISTOPx(oe)->op_last = NULL;
4136 if (o->op_type == OP_TRANS || o->op_type == OP_TRANSR) {
4137 return pmtrans(o, expr, repl);
4140 reglist = isreg && expr->op_type == OP_LIST;
4144 PL_hints |= HINT_BLOCK_SCOPE;
4147 if (expr->op_type == OP_CONST) {
4148 SV *pat = ((SVOP*)expr)->op_sv;
4149 U32 pm_flags = pm->op_pmflags & RXf_PMf_COMPILETIME;
4151 if (o->op_flags & OPf_SPECIAL)
4152 pm_flags |= RXf_SPLIT;
4155 assert (SvUTF8(pat));
4156 } else if (SvUTF8(pat)) {
4157 /* Not doing UTF-8, despite what the SV says. Is this only if we're
4158 trapped in use 'bytes'? */
4159 /* Make a copy of the octet sequence, but without the flag on, as
4160 the compiler now honours the SvUTF8 flag on pat. */
4162 const char *const p = SvPV(pat, len);
4163 pat = newSVpvn_flags(p, len, SVs_TEMP);
4166 PM_SETRE(pm, CALLREGCOMP(pat, pm_flags));
4169 op_getmad(expr,(OP*)pm,'e');
4175 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
4176 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
4178 : OP_REGCMAYBE),0,expr);
4180 NewOp(1101, rcop, 1, LOGOP);
4181 rcop->op_type = OP_REGCOMP;
4182 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
4183 rcop->op_first = scalar(expr);
4184 rcop->op_flags |= OPf_KIDS
4185 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
4186 | (reglist ? OPf_STACKED : 0);
4187 rcop->op_private = 1;
4190 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
4192 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
4193 if (PL_hints & HINT_RE_EVAL) PL_cv_has_eval = 1;
4195 /* establish postfix order */
4196 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
4198 rcop->op_next = expr;
4199 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
4202 rcop->op_next = LINKLIST(expr);
4203 expr->op_next = (OP*)rcop;
4206 op_prepend_elem(o->op_type, scalar((OP*)rcop), o);
4211 if (pm->op_pmflags & PMf_EVAL) {
4213 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
4214 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
4216 else if (repl->op_type == OP_CONST)
4220 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
4221 if (curop->op_type == OP_SCOPE
4222 || curop->op_type == OP_LEAVE
4223 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
4224 if (curop->op_type == OP_GV) {
4225 GV * const gv = cGVOPx_gv(curop);
4227 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
4230 else if (curop->op_type == OP_RV2CV)
4232 else if (curop->op_type == OP_RV2SV ||
4233 curop->op_type == OP_RV2AV ||
4234 curop->op_type == OP_RV2HV ||
4235 curop->op_type == OP_RV2GV) {
4236 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
4239 else if (curop->op_type == OP_PADSV ||
4240 curop->op_type == OP_PADAV ||
4241 curop->op_type == OP_PADHV ||
4242 curop->op_type == OP_PADANY)
4246 else if (curop->op_type == OP_PUSHRE)
4247 NOOP; /* Okay here, dangerous in newASSIGNOP */
4257 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
4259 pm->op_pmflags |= PMf_CONST; /* const for long enough */
4260 op_prepend_elem(o->op_type, scalar(repl), o);
4263 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
4264 pm->op_pmflags |= PMf_MAYBE_CONST;
4266 NewOp(1101, rcop, 1, LOGOP);
4267 rcop->op_type = OP_SUBSTCONT;
4268 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
4269 rcop->op_first = scalar(repl);
4270 rcop->op_flags |= OPf_KIDS;
4271 rcop->op_private = 1;
4274 /* establish postfix order */
4275 rcop->op_next = LINKLIST(repl);
4276 repl->op_next = (OP*)rcop;
4278 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
4279 assert(!(pm->op_pmflags & PMf_ONCE));
4280 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
4289 =for apidoc Am|OP *|newSVOP|I32 type|I32 flags|SV *sv
4291 Constructs, checks, and returns an op of any type that involves an
4292 embedded SV. I<type> is the opcode. I<flags> gives the eight bits
4293 of C<op_flags>. I<sv> gives the SV to embed in the op; this function
4294 takes ownership of one reference to it.
4300 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
4305 PERL_ARGS_ASSERT_NEWSVOP;
4307 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4308 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4309 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4311 NewOp(1101, svop, 1, SVOP);
4312 svop->op_type = (OPCODE)type;
4313 svop->op_ppaddr = PL_ppaddr[type];
4315 svop->op_next = (OP*)svop;
4316 svop->op_flags = (U8)flags;
4317 if (PL_opargs[type] & OA_RETSCALAR)
4319 if (PL_opargs[type] & OA_TARGET)
4320 svop->op_targ = pad_alloc(type, SVs_PADTMP);
4321 return CHECKOP(type, svop);
4327 =for apidoc Am|OP *|newPADOP|I32 type|I32 flags|SV *sv
4329 Constructs, checks, and returns an op of any type that involves a
4330 reference to a pad element. I<type> is the opcode. I<flags> gives the
4331 eight bits of C<op_flags>. A pad slot is automatically allocated, and
4332 is populated with I<sv>; this function takes ownership of one reference
4335 This function only exists if Perl has been compiled to use ithreads.
4341 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
4346 PERL_ARGS_ASSERT_NEWPADOP;
4348 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
4349 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4350 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
4352 NewOp(1101, padop, 1, PADOP);
4353 padop->op_type = (OPCODE)type;
4354 padop->op_ppaddr = PL_ppaddr[type];
4355 padop->op_padix = pad_alloc(type, SVs_PADTMP);
4356 SvREFCNT_dec(PAD_SVl(padop->op_padix));
4357 PAD_SETSV(padop->op_padix, sv);
4360 padop->op_next = (OP*)padop;
4361 padop->op_flags = (U8)flags;
4362 if (PL_opargs[type] & OA_RETSCALAR)
4364 if (PL_opargs[type] & OA_TARGET)
4365 padop->op_targ = pad_alloc(type, SVs_PADTMP);
4366 return CHECKOP(type, padop);
4369 #endif /* !USE_ITHREADS */
4372 =for apidoc Am|OP *|newGVOP|I32 type|I32 flags|GV *gv
4374 Constructs, checks, and returns an op of any type that involves an
4375 embedded reference to a GV. I<type> is the opcode. I<flags> gives the
4376 eight bits of C<op_flags>. I<gv> identifies the GV that the op should
4377 reference; calling this function does not transfer ownership of any
4384 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
4388 PERL_ARGS_ASSERT_NEWGVOP;
4392 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4394 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
4399 =for apidoc Am|OP *|newPVOP|I32 type|I32 flags|char *pv
4401 Constructs, checks, and returns an op of any type that involves an
4402 embedded C-level pointer (PV). I<type> is the opcode. I<flags> gives
4403 the eight bits of C<op_flags>. I<pv> supplies the C-level pointer, which
4404 must have been allocated using L</PerlMemShared_malloc>; the memory will
4405 be freed when the op is destroyed.
4411 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
4416 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
4417 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
4419 NewOp(1101, pvop, 1, PVOP);
4420 pvop->op_type = (OPCODE)type;
4421 pvop->op_ppaddr = PL_ppaddr[type];
4423 pvop->op_next = (OP*)pvop;
4424 pvop->op_flags = (U8)flags;
4425 if (PL_opargs[type] & OA_RETSCALAR)
4427 if (PL_opargs[type] & OA_TARGET)
4428 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
4429 return CHECKOP(type, pvop);
4437 Perl_package(pTHX_ OP *o)
4440 SV *const sv = cSVOPo->op_sv;
4445 PERL_ARGS_ASSERT_PACKAGE;
4447 save_hptr(&PL_curstash);
4448 save_item(PL_curstname);
4450 PL_curstash = gv_stashsv(sv, GV_ADD);
4452 sv_setsv(PL_curstname, sv);
4454 PL_hints |= HINT_BLOCK_SCOPE;
4455 PL_parser->copline = NOLINE;
4456 PL_parser->expect = XSTATE;
4461 if (!PL_madskills) {
4466 pegop = newOP(OP_NULL,0);
4467 op_getmad(o,pegop,'P');
4473 Perl_package_version( pTHX_ OP *v )
4476 U32 savehints = PL_hints;
4477 PERL_ARGS_ASSERT_PACKAGE_VERSION;
4478 PL_hints &= ~HINT_STRICT_VARS;
4479 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
4480 PL_hints = savehints;
4489 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
4496 OP *pegop = newOP(OP_NULL,0);
4498 SV *use_version = NULL;
4500 PERL_ARGS_ASSERT_UTILIZE;
4502 if (idop->op_type != OP_CONST)
4503 Perl_croak(aTHX_ "Module name must be constant");
4506 op_getmad(idop,pegop,'U');
4511 SV * const vesv = ((SVOP*)version)->op_sv;
4514 op_getmad(version,pegop,'V');
4515 if (!arg && !SvNIOKp(vesv)) {
4522 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
4523 Perl_croak(aTHX_ "Version number must be a constant number");
4525 /* Make copy of idop so we don't free it twice */
4526 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
4528 /* Fake up a method call to VERSION */
4529 meth = newSVpvs_share("VERSION");
4530 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
4531 op_append_elem(OP_LIST,
4532 op_prepend_elem(OP_LIST, pack, list(version)),
4533 newSVOP(OP_METHOD_NAMED, 0, meth)));
4537 /* Fake up an import/unimport */
4538 if (arg && arg->op_type == OP_STUB) {
4540 op_getmad(arg,pegop,'S');
4541 imop = arg; /* no import on explicit () */
4543 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
4544 imop = NULL; /* use 5.0; */
4546 use_version = ((SVOP*)idop)->op_sv;
4548 idop->op_private |= OPpCONST_NOVER;
4554 op_getmad(arg,pegop,'A');
4556 /* Make copy of idop so we don't free it twice */
4557 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
4559 /* Fake up a method call to import/unimport */
4561 ? newSVpvs_share("import") : newSVpvs_share("unimport");
4562 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
4563 op_append_elem(OP_LIST,
4564 op_prepend_elem(OP_LIST, pack, list(arg)),
4565 newSVOP(OP_METHOD_NAMED, 0, meth)));
4568 /* Fake up the BEGIN {}, which does its thing immediately. */
4570 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
4573 op_append_elem(OP_LINESEQ,
4574 op_append_elem(OP_LINESEQ,
4575 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
4576 newSTATEOP(0, NULL, veop)),
4577 newSTATEOP(0, NULL, imop) ));
4580 /* If we request a version >= 5.9.5, load feature.pm with the
4581 * feature bundle that corresponds to the required version. */
4582 use_version = sv_2mortal(new_version(use_version));
4584 if (vcmp(use_version,
4585 sv_2mortal(upg_version(newSVnv(5.009005), FALSE))) >= 0) {
4586 SV *const importsv = vnormal(use_version);
4587 *SvPVX_mutable(importsv) = ':';
4588 ENTER_with_name("load_feature");
4589 Perl_load_module(aTHX_ 0, newSVpvs("feature"), NULL, importsv, NULL);
4590 LEAVE_with_name("load_feature");
4592 /* If a version >= 5.11.0 is requested, strictures are on by default! */
4593 if (vcmp(use_version,
4594 sv_2mortal(upg_version(newSVnv(5.011000), FALSE))) >= 0) {
4595 PL_hints |= (HINT_STRICT_REFS | HINT_STRICT_SUBS | HINT_STRICT_VARS);
4599 /* The "did you use incorrect case?" warning used to be here.
4600 * The problem is that on case-insensitive filesystems one
4601 * might get false positives for "use" (and "require"):
4602 * "use Strict" or "require CARP" will work. This causes
4603 * portability problems for the script: in case-strict
4604 * filesystems the script will stop working.
4606 * The "incorrect case" warning checked whether "use Foo"
4607 * imported "Foo" to your namespace, but that is wrong, too:
4608 * there is no requirement nor promise in the language that
4609 * a Foo.pm should or would contain anything in package "Foo".
4611 * There is very little Configure-wise that can be done, either:
4612 * the case-sensitivity of the build filesystem of Perl does not
4613 * help in guessing the case-sensitivity of the runtime environment.
4616 PL_hints |= HINT_BLOCK_SCOPE;
4617 PL_parser->copline = NOLINE;
4618 PL_parser->expect = XSTATE;
4619 PL_cop_seqmax++; /* Purely for B::*'s benefit */
4620 if (PL_cop_seqmax == PERL_PADSEQ_INTRO) /* not a legal value */
4624 if (!PL_madskills) {
4625 /* FIXME - don't allocate pegop if !PL_madskills */
4634 =head1 Embedding Functions
4636 =for apidoc load_module
4638 Loads the module whose name is pointed to by the string part of name.
4639 Note that the actual module name, not its filename, should be given.
4640 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
4641 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
4642 (or 0 for no flags). ver, if specified, provides version semantics
4643 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
4644 arguments can be used to specify arguments to the module's import()
4645 method, similar to C<use Foo::Bar VERSION LIST>. They must be
4646 terminated with a final NULL pointer. Note that this list can only
4647 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
4648 Otherwise at least a single NULL pointer to designate the default
4649 import list is required.
4654 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
4658 PERL_ARGS_ASSERT_LOAD_MODULE;
4660 va_start(args, ver);
4661 vload_module(flags, name, ver, &args);
4665 #ifdef PERL_IMPLICIT_CONTEXT
4667 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
4671 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
4672 va_start(args, ver);
4673 vload_module(flags, name, ver, &args);
4679 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
4683 OP * const modname = newSVOP(OP_CONST, 0, name);
4685 PERL_ARGS_ASSERT_VLOAD_MODULE;
4687 modname->op_private |= OPpCONST_BARE;
4689 veop = newSVOP(OP_CONST, 0, ver);
4693 if (flags & PERL_LOADMOD_NOIMPORT) {
4694 imop = sawparens(newNULLLIST());
4696 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
4697 imop = va_arg(*args, OP*);
4702 sv = va_arg(*args, SV*);
4704 imop = op_append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
4705 sv = va_arg(*args, SV*);
4709 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
4710 * that it has a PL_parser to play with while doing that, and also
4711 * that it doesn't mess with any existing parser, by creating a tmp
4712 * new parser with lex_start(). This won't actually be used for much,
4713 * since pp_require() will create another parser for the real work. */
4716 SAVEVPTR(PL_curcop);
4717 lex_start(NULL, NULL, LEX_START_SAME_FILTER);
4718 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
4719 veop, modname, imop);
4724 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
4730 PERL_ARGS_ASSERT_DOFILE;
4732 if (!force_builtin) {
4733 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
4734 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
4735 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
4736 gv = gvp ? *gvp : NULL;
4740 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
4741 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
4742 op_append_elem(OP_LIST, term,
4743 scalar(newUNOP(OP_RV2CV, 0,
4744 newGVOP(OP_GV, 0, gv))))));
4747 doop = newUNOP(OP_DOFILE, 0, scalar(term));
4753 =head1 Optree construction
4755 =for apidoc Am|OP *|newSLICEOP|I32 flags|OP *subscript|OP *listval
4757 Constructs, checks, and returns an C<lslice> (list slice) op. I<flags>
4758 gives the eight bits of C<op_flags>, except that C<OPf_KIDS> will
4759 be set automatically, and, shifted up eight bits, the eight bits of
4760 C<op_private>, except that the bit with value 1 or 2 is automatically
4761 set as required. I<listval> and I<subscript> supply the parameters of
4762 the slice; they are consumed by this function and become part of the
4763 constructed op tree.
4769 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
4771 return newBINOP(OP_LSLICE, flags,
4772 list(force_list(subscript)),
4773 list(force_list(listval)) );
4777 S_is_list_assignment(pTHX_ register const OP *o)
4785 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
4786 o = cUNOPo->op_first;
4788 flags = o->op_flags;
4790 if (type == OP_COND_EXPR) {
4791 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
4792 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
4797 yyerror("Assignment to both a list and a scalar");
4801 if (type == OP_LIST &&
4802 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
4803 o->op_private & OPpLVAL_INTRO)
4806 if (type == OP_LIST || flags & OPf_PARENS ||
4807 type == OP_RV2AV || type == OP_RV2HV ||
4808 type == OP_ASLICE || type == OP_HSLICE)
4811 if (type == OP_PADAV || type == OP_PADHV)
4814 if (type == OP_RV2SV)
4821 Helper function for newASSIGNOP to detection commonality between the
4822 lhs and the rhs. Marks all variables with PL_generation. If it
4823 returns TRUE the assignment must be able to handle common variables.
4825 PERL_STATIC_INLINE bool
4826 S_aassign_common_vars(pTHX_ OP* o)
4829 for (curop = cUNOPo->op_first; curop; curop=curop->op_sibling) {
4830 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
4831 if (curop->op_type == OP_GV) {
4832 GV *gv = cGVOPx_gv(curop);
4834 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4836 GvASSIGN_GENERATION_set(gv, PL_generation);
4838 else if (curop->op_type == OP_PADSV ||
4839 curop->op_type == OP_PADAV ||
4840 curop->op_type == OP_PADHV ||
4841 curop->op_type == OP_PADANY)
4843 if (PAD_COMPNAME_GEN(curop->op_targ)
4844 == (STRLEN)PL_generation)
4846 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
4849 else if (curop->op_type == OP_RV2CV)
4851 else if (curop->op_type == OP_RV2SV ||
4852 curop->op_type == OP_RV2AV ||
4853 curop->op_type == OP_RV2HV ||
4854 curop->op_type == OP_RV2GV) {
4855 if (cUNOPx(curop)->op_first->op_type != OP_GV) /* funny deref? */
4858 else if (curop->op_type == OP_PUSHRE) {
4860 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
4861 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
4863 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4865 GvASSIGN_GENERATION_set(gv, PL_generation);
4869 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
4872 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4874 GvASSIGN_GENERATION_set(gv, PL_generation);
4882 if (curop->op_flags & OPf_KIDS) {
4883 if (aassign_common_vars(curop))
4891 =for apidoc Am|OP *|newASSIGNOP|I32 flags|OP *left|I32 optype|OP *right
4893 Constructs, checks, and returns an assignment op. I<left> and I<right>
4894 supply the parameters of the assignment; they are consumed by this
4895 function and become part of the constructed op tree.
4897 If I<optype> is C<OP_ANDASSIGN>, C<OP_ORASSIGN>, or C<OP_DORASSIGN>, then
4898 a suitable conditional optree is constructed. If I<optype> is the opcode
4899 of a binary operator, such as C<OP_BIT_OR>, then an op is constructed that
4900 performs the binary operation and assigns the result to the left argument.
4901 Either way, if I<optype> is non-zero then I<flags> has no effect.
4903 If I<optype> is zero, then a plain scalar or list assignment is
4904 constructed. Which type of assignment it is is automatically determined.
4905 I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
4906 will be set automatically, and, shifted up eight bits, the eight bits
4907 of C<op_private>, except that the bit with value 1 or 2 is automatically
4914 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
4920 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
4921 return newLOGOP(optype, 0,
4922 op_lvalue(scalar(left), optype),
4923 newUNOP(OP_SASSIGN, 0, scalar(right)));
4926 return newBINOP(optype, OPf_STACKED,
4927 op_lvalue(scalar(left), optype), scalar(right));
4931 if (is_list_assignment(left)) {
4932 static const char no_list_state[] = "Initialization of state variables"
4933 " in list context currently forbidden";
4935 bool maybe_common_vars = TRUE;
4938 /* Grandfathering $[ assignment here. Bletch.*/
4939 /* Only simple assignments like C<< ($[) = 1 >> are allowed */
4940 PL_eval_start = (left->op_type == OP_CONST) ? right : NULL;
4941 left = op_lvalue(left, OP_AASSIGN);
4944 else if (left->op_type == OP_CONST) {
4945 deprecate("assignment to $[");
4947 /* Result of assignment is always 1 (or we'd be dead already) */
4948 return newSVOP(OP_CONST, 0, newSViv(1));
4950 curop = list(force_list(left));
4951 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
4952 o->op_private = (U8)(0 | (flags >> 8));
4954 if ((left->op_type == OP_LIST
4955 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
4957 OP* lop = ((LISTOP*)left)->op_first;
4958 maybe_common_vars = FALSE;
4960 if (lop->op_type == OP_PADSV ||
4961 lop->op_type == OP_PADAV ||
4962 lop->op_type == OP_PADHV ||
4963 lop->op_type == OP_PADANY) {
4964 if (!(lop->op_private & OPpLVAL_INTRO))
4965 maybe_common_vars = TRUE;
4967 if (lop->op_private & OPpPAD_STATE) {
4968 if (left->op_private & OPpLVAL_INTRO) {
4969 /* Each variable in state($a, $b, $c) = ... */
4972 /* Each state variable in
4973 (state $a, my $b, our $c, $d, undef) = ... */
4975 yyerror(no_list_state);
4977 /* Each my variable in
4978 (state $a, my $b, our $c, $d, undef) = ... */
4980 } else if (lop->op_type == OP_UNDEF ||
4981 lop->op_type == OP_PUSHMARK) {
4982 /* undef may be interesting in
4983 (state $a, undef, state $c) */
4985 /* Other ops in the list. */
4986 maybe_common_vars = TRUE;
4988 lop = lop->op_sibling;
4991 else if ((left->op_private & OPpLVAL_INTRO)
4992 && ( left->op_type == OP_PADSV
4993 || left->op_type == OP_PADAV
4994 || left->op_type == OP_PADHV
4995 || left->op_type == OP_PADANY))
4997 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
4998 if (left->op_private & OPpPAD_STATE) {
4999 /* All single variable list context state assignments, hence
5009 yyerror(no_list_state);
5013 /* PL_generation sorcery:
5014 * an assignment like ($a,$b) = ($c,$d) is easier than
5015 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
5016 * To detect whether there are common vars, the global var
5017 * PL_generation is incremented for each assign op we compile.
5018 * Then, while compiling the assign op, we run through all the
5019 * variables on both sides of the assignment, setting a spare slot
5020 * in each of them to PL_generation. If any of them already have
5021 * that value, we know we've got commonality. We could use a
5022 * single bit marker, but then we'd have to make 2 passes, first
5023 * to clear the flag, then to test and set it. To find somewhere
5024 * to store these values, evil chicanery is done with SvUVX().
5027 if (maybe_common_vars) {
5029 if (aassign_common_vars(o))
5030 o->op_private |= OPpASSIGN_COMMON;
5034 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
5035 OP* tmpop = ((LISTOP*)right)->op_first;
5036 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
5037 PMOP * const pm = (PMOP*)tmpop;
5038 if (left->op_type == OP_RV2AV &&
5039 !(left->op_private & OPpLVAL_INTRO) &&
5040 !(o->op_private & OPpASSIGN_COMMON) )
5042 tmpop = ((UNOP*)left)->op_first;
5043 if (tmpop->op_type == OP_GV
5045 && !pm->op_pmreplrootu.op_pmtargetoff
5047 && !pm->op_pmreplrootu.op_pmtargetgv
5051 pm->op_pmreplrootu.op_pmtargetoff
5052 = cPADOPx(tmpop)->op_padix;
5053 cPADOPx(tmpop)->op_padix = 0; /* steal it */
5055 pm->op_pmreplrootu.op_pmtargetgv
5056 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
5057 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
5059 pm->op_pmflags |= PMf_ONCE;
5060 tmpop = cUNOPo->op_first; /* to list (nulled) */
5061 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
5062 tmpop->op_sibling = NULL; /* don't free split */
5063 right->op_next = tmpop->op_next; /* fix starting loc */
5064 op_free(o); /* blow off assign */
5065 right->op_flags &= ~OPf_WANT;
5066 /* "I don't know and I don't care." */
5071 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
5072 ((LISTOP*)right)->op_last->op_type == OP_CONST)
5074 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
5075 if (SvIOK(sv) && SvIVX(sv) == 0)
5076 sv_setiv(sv, PL_modcount+1);
5084 right = newOP(OP_UNDEF, 0);
5085 if (right->op_type == OP_READLINE) {
5086 right->op_flags |= OPf_STACKED;
5087 return newBINOP(OP_NULL, flags, op_lvalue(scalar(left), OP_SASSIGN),
5091 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
5092 o = newBINOP(OP_SASSIGN, flags,
5093 scalar(right), op_lvalue(scalar(left), OP_SASSIGN) );
5097 if (!PL_madskills) { /* assignment to $[ is ignored when making a mad dump */
5098 deprecate("assignment to $[");
5100 o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling)));
5101 o->op_private |= OPpCONST_ARYBASE;
5109 =for apidoc Am|OP *|newSTATEOP|I32 flags|char *label|OP *o
5111 Constructs a state op (COP). The state op is normally a C<nextstate> op,
5112 but will be a C<dbstate> op if debugging is enabled for currently-compiled
5113 code. The state op is populated from L</PL_curcop> (or L</PL_compiling>).
5114 If I<label> is non-null, it supplies the name of a label to attach to
5115 the state op; this function takes ownership of the memory pointed at by
5116 I<label>, and will free it. I<flags> gives the eight bits of C<op_flags>
5119 If I<o> is null, the state op is returned. Otherwise the state op is
5120 combined with I<o> into a C<lineseq> list op, which is returned. I<o>
5121 is consumed by this function and becomes part of the returned op tree.
5127 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
5130 const U32 seq = intro_my();
5133 NewOp(1101, cop, 1, COP);
5134 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
5135 cop->op_type = OP_DBSTATE;
5136 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
5139 cop->op_type = OP_NEXTSTATE;
5140 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
5142 cop->op_flags = (U8)flags;
5143 CopHINTS_set(cop, PL_hints);
5145 cop->op_private |= NATIVE_HINTS;
5147 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
5148 cop->op_next = (OP*)cop;
5151 /* CopARYBASE is now "virtual", in that it's stored as a flag bit in
5152 CopHINTS and a possible value in cop_hints_hash, so no need to copy it.
5154 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
5155 CopHINTHASH_set(cop, cophh_copy(CopHINTHASH_get(PL_curcop)));
5157 Perl_cop_store_label(aTHX_ cop, label, strlen(label), 0);
5159 PL_hints |= HINT_BLOCK_SCOPE;
5160 /* It seems that we need to defer freeing this pointer, as other parts
5161 of the grammar end up wanting to copy it after this op has been
5166 if (PL_parser && PL_parser->copline == NOLINE)
5167 CopLINE_set(cop, CopLINE(PL_curcop));
5169 CopLINE_set(cop, PL_parser->copline);
5171 PL_parser->copline = NOLINE;
5174 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
5176 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
5178 CopSTASH_set(cop, PL_curstash);
5180 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
5181 /* this line can have a breakpoint - store the cop in IV */
5182 AV *av = CopFILEAVx(PL_curcop);
5184 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
5185 if (svp && *svp != &PL_sv_undef ) {
5186 (void)SvIOK_on(*svp);
5187 SvIV_set(*svp, PTR2IV(cop));
5192 if (flags & OPf_SPECIAL)
5194 return op_prepend_elem(OP_LINESEQ, (OP*)cop, o);
5198 =for apidoc Am|OP *|newLOGOP|I32 type|I32 flags|OP *first|OP *other
5200 Constructs, checks, and returns a logical (flow control) op. I<type>
5201 is the opcode. I<flags> gives the eight bits of C<op_flags>, except
5202 that C<OPf_KIDS> will be set automatically, and, shifted up eight bits,
5203 the eight bits of C<op_private>, except that the bit with value 1 is
5204 automatically set. I<first> supplies the expression controlling the
5205 flow, and I<other> supplies the side (alternate) chain of ops; they are
5206 consumed by this function and become part of the constructed op tree.
5212 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
5216 PERL_ARGS_ASSERT_NEWLOGOP;
5218 return new_logop(type, flags, &first, &other);
5222 S_search_const(pTHX_ OP *o)
5224 PERL_ARGS_ASSERT_SEARCH_CONST;
5226 switch (o->op_type) {
5230 if (o->op_flags & OPf_KIDS)
5231 return search_const(cUNOPo->op_first);
5238 if (!(o->op_flags & OPf_KIDS))
5240 kid = cLISTOPo->op_first;
5242 switch (kid->op_type) {
5246 kid = kid->op_sibling;
5249 if (kid != cLISTOPo->op_last)
5255 kid = cLISTOPo->op_last;
5257 return search_const(kid);
5265 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
5273 int prepend_not = 0;
5275 PERL_ARGS_ASSERT_NEW_LOGOP;
5280 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
5281 return newBINOP(type, flags, scalar(first), scalar(other));
5283 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
5285 scalarboolean(first);
5286 /* optimize AND and OR ops that have NOTs as children */
5287 if (first->op_type == OP_NOT
5288 && (first->op_flags & OPf_KIDS)
5289 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
5290 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
5292 if (type == OP_AND || type == OP_OR) {
5298 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
5300 prepend_not = 1; /* prepend a NOT op later */
5304 /* search for a constant op that could let us fold the test */
5305 if ((cstop = search_const(first))) {
5306 if (cstop->op_private & OPpCONST_STRICT)
5307 no_bareword_allowed(cstop);
5308 else if ((cstop->op_private & OPpCONST_BARE))
5309 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
5310 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
5311 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
5312 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
5314 if (other->op_type == OP_CONST)
5315 other->op_private |= OPpCONST_SHORTCIRCUIT;
5317 OP *newop = newUNOP(OP_NULL, 0, other);
5318 op_getmad(first, newop, '1');
5319 newop->op_targ = type; /* set "was" field */
5323 if (other->op_type == OP_LEAVE)
5324 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
5325 else if (other->op_type == OP_MATCH
5326 || other->op_type == OP_SUBST
5327 || other->op_type == OP_TRANSR
5328 || other->op_type == OP_TRANS)
5329 /* Mark the op as being unbindable with =~ */
5330 other->op_flags |= OPf_SPECIAL;
5334 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
5335 const OP *o2 = other;
5336 if ( ! (o2->op_type == OP_LIST
5337 && (( o2 = cUNOPx(o2)->op_first))
5338 && o2->op_type == OP_PUSHMARK
5339 && (( o2 = o2->op_sibling)) )
5342 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
5343 || o2->op_type == OP_PADHV)
5344 && o2->op_private & OPpLVAL_INTRO
5345 && !(o2->op_private & OPpPAD_STATE))
5347 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
5348 "Deprecated use of my() in false conditional");
5352 if (first->op_type == OP_CONST)
5353 first->op_private |= OPpCONST_SHORTCIRCUIT;
5355 first = newUNOP(OP_NULL, 0, first);
5356 op_getmad(other, first, '2');
5357 first->op_targ = type; /* set "was" field */
5364 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
5365 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
5367 const OP * const k1 = ((UNOP*)first)->op_first;
5368 const OP * const k2 = k1->op_sibling;
5370 switch (first->op_type)
5373 if (k2 && k2->op_type == OP_READLINE
5374 && (k2->op_flags & OPf_STACKED)
5375 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5377 warnop = k2->op_type;
5382 if (k1->op_type == OP_READDIR
5383 || k1->op_type == OP_GLOB
5384 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5385 || k1->op_type == OP_EACH
5386 || k1->op_type == OP_AEACH)
5388 warnop = ((k1->op_type == OP_NULL)
5389 ? (OPCODE)k1->op_targ : k1->op_type);
5394 const line_t oldline = CopLINE(PL_curcop);
5395 CopLINE_set(PL_curcop, PL_parser->copline);
5396 Perl_warner(aTHX_ packWARN(WARN_MISC),
5397 "Value of %s%s can be \"0\"; test with defined()",
5399 ((warnop == OP_READLINE || warnop == OP_GLOB)
5400 ? " construct" : "() operator"));
5401 CopLINE_set(PL_curcop, oldline);
5408 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
5409 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
5411 NewOp(1101, logop, 1, LOGOP);
5413 logop->op_type = (OPCODE)type;
5414 logop->op_ppaddr = PL_ppaddr[type];
5415 logop->op_first = first;
5416 logop->op_flags = (U8)(flags | OPf_KIDS);
5417 logop->op_other = LINKLIST(other);
5418 logop->op_private = (U8)(1 | (flags >> 8));
5420 /* establish postfix order */
5421 logop->op_next = LINKLIST(first);
5422 first->op_next = (OP*)logop;
5423 first->op_sibling = other;
5425 CHECKOP(type,logop);
5427 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
5434 =for apidoc Am|OP *|newCONDOP|I32 flags|OP *first|OP *trueop|OP *falseop
5436 Constructs, checks, and returns a conditional-expression (C<cond_expr>)
5437 op. I<flags> gives the eight bits of C<op_flags>, except that C<OPf_KIDS>
5438 will be set automatically, and, shifted up eight bits, the eight bits of
5439 C<op_private>, except that the bit with value 1 is automatically set.
5440 I<first> supplies the expression selecting between the two branches,
5441 and I<trueop> and I<falseop> supply the branches; they are consumed by
5442 this function and become part of the constructed op tree.
5448 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
5456 PERL_ARGS_ASSERT_NEWCONDOP;
5459 return newLOGOP(OP_AND, 0, first, trueop);
5461 return newLOGOP(OP_OR, 0, first, falseop);
5463 scalarboolean(first);
5464 if ((cstop = search_const(first))) {
5465 /* Left or right arm of the conditional? */
5466 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
5467 OP *live = left ? trueop : falseop;
5468 OP *const dead = left ? falseop : trueop;
5469 if (cstop->op_private & OPpCONST_BARE &&
5470 cstop->op_private & OPpCONST_STRICT) {
5471 no_bareword_allowed(cstop);
5474 /* This is all dead code when PERL_MAD is not defined. */
5475 live = newUNOP(OP_NULL, 0, live);
5476 op_getmad(first, live, 'C');
5477 op_getmad(dead, live, left ? 'e' : 't');
5482 if (live->op_type == OP_LEAVE)
5483 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
5484 else if (live->op_type == OP_MATCH || live->op_type == OP_SUBST
5485 || live->op_type == OP_TRANS || live->op_type == OP_TRANSR)
5486 /* Mark the op as being unbindable with =~ */
5487 live->op_flags |= OPf_SPECIAL;
5490 NewOp(1101, logop, 1, LOGOP);
5491 logop->op_type = OP_COND_EXPR;
5492 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
5493 logop->op_first = first;
5494 logop->op_flags = (U8)(flags | OPf_KIDS);
5495 logop->op_private = (U8)(1 | (flags >> 8));
5496 logop->op_other = LINKLIST(trueop);
5497 logop->op_next = LINKLIST(falseop);
5499 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
5502 /* establish postfix order */
5503 start = LINKLIST(first);
5504 first->op_next = (OP*)logop;
5506 first->op_sibling = trueop;
5507 trueop->op_sibling = falseop;
5508 o = newUNOP(OP_NULL, 0, (OP*)logop);
5510 trueop->op_next = falseop->op_next = o;
5517 =for apidoc Am|OP *|newRANGE|I32 flags|OP *left|OP *right
5519 Constructs and returns a C<range> op, with subordinate C<flip> and
5520 C<flop> ops. I<flags> gives the eight bits of C<op_flags> for the
5521 C<flip> op and, shifted up eight bits, the eight bits of C<op_private>
5522 for both the C<flip> and C<range> ops, except that the bit with value
5523 1 is automatically set. I<left> and I<right> supply the expressions
5524 controlling the endpoints of the range; they are consumed by this function
5525 and become part of the constructed op tree.
5531 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
5540 PERL_ARGS_ASSERT_NEWRANGE;
5542 NewOp(1101, range, 1, LOGOP);
5544 range->op_type = OP_RANGE;
5545 range->op_ppaddr = PL_ppaddr[OP_RANGE];
5546 range->op_first = left;
5547 range->op_flags = OPf_KIDS;
5548 leftstart = LINKLIST(left);
5549 range->op_other = LINKLIST(right);
5550 range->op_private = (U8)(1 | (flags >> 8));
5552 left->op_sibling = right;
5554 range->op_next = (OP*)range;
5555 flip = newUNOP(OP_FLIP, flags, (OP*)range);
5556 flop = newUNOP(OP_FLOP, 0, flip);
5557 o = newUNOP(OP_NULL, 0, flop);
5559 range->op_next = leftstart;
5561 left->op_next = flip;
5562 right->op_next = flop;
5564 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
5565 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
5566 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
5567 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
5569 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
5570 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
5572 /* check barewords before they might be optimized aways */
5573 if (flip->op_private && cSVOPx(left)->op_private & OPpCONST_STRICT)
5574 no_bareword_allowed(left);
5575 if (flop->op_private && cSVOPx(right)->op_private & OPpCONST_STRICT)
5576 no_bareword_allowed(right);
5579 if (!flip->op_private || !flop->op_private)
5580 LINKLIST(o); /* blow off optimizer unless constant */
5586 =for apidoc Am|OP *|newLOOPOP|I32 flags|I32 debuggable|OP *expr|OP *block
5588 Constructs, checks, and returns an op tree expressing a loop. This is
5589 only a loop in the control flow through the op tree; it does not have
5590 the heavyweight loop structure that allows exiting the loop by C<last>
5591 and suchlike. I<flags> gives the eight bits of C<op_flags> for the
5592 top-level op, except that some bits will be set automatically as required.
5593 I<expr> supplies the expression controlling loop iteration, and I<block>
5594 supplies the body of the loop; they are consumed by this function and
5595 become part of the constructed op tree. I<debuggable> is currently
5596 unused and should always be 1.
5602 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
5607 const bool once = block && block->op_flags & OPf_SPECIAL &&
5608 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
5610 PERL_UNUSED_ARG(debuggable);
5613 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
5614 return block; /* do {} while 0 does once */
5615 if (expr->op_type == OP_READLINE
5616 || expr->op_type == OP_READDIR
5617 || expr->op_type == OP_GLOB
5618 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
5619 expr = newUNOP(OP_DEFINED, 0,
5620 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
5621 } else if (expr->op_flags & OPf_KIDS) {
5622 const OP * const k1 = ((UNOP*)expr)->op_first;
5623 const OP * const k2 = k1 ? k1->op_sibling : NULL;
5624 switch (expr->op_type) {
5626 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
5627 && (k2->op_flags & OPf_STACKED)
5628 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5629 expr = newUNOP(OP_DEFINED, 0, expr);
5633 if (k1 && (k1->op_type == OP_READDIR
5634 || k1->op_type == OP_GLOB
5635 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5636 || k1->op_type == OP_EACH
5637 || k1->op_type == OP_AEACH))
5638 expr = newUNOP(OP_DEFINED, 0, expr);
5644 /* if block is null, the next op_append_elem() would put UNSTACK, a scalar
5645 * op, in listop. This is wrong. [perl #27024] */
5647 block = newOP(OP_NULL, 0);
5648 listop = op_append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
5649 o = new_logop(OP_AND, 0, &expr, &listop);
5652 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
5654 if (once && o != listop)
5655 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
5658 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
5660 o->op_flags |= flags;
5662 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
5667 =for apidoc Am|OP *|newWHILEOP|I32 flags|I32 debuggable|LOOP *loop|OP *expr|OP *block|OP *cont|I32 has_my
5669 Constructs, checks, and returns an op tree expressing a C<while> loop.
5670 This is a heavyweight loop, with structure that allows exiting the loop
5671 by C<last> and suchlike.
5673 I<loop> is an optional preconstructed C<enterloop> op to use in the
5674 loop; if it is null then a suitable op will be constructed automatically.
5675 I<expr> supplies the loop's controlling expression. I<block> supplies the
5676 main body of the loop, and I<cont> optionally supplies a C<continue> block
5677 that operates as a second half of the body. All of these optree inputs
5678 are consumed by this function and become part of the constructed op tree.
5680 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
5681 op and, shifted up eight bits, the eight bits of C<op_private> for
5682 the C<leaveloop> op, except that (in both cases) some bits will be set
5683 automatically. I<debuggable> is currently unused and should always be 1.
5684 I<has_my> can be supplied as true to force the
5685 loop body to be enclosed in its own scope.
5691 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop,
5692 OP *expr, OP *block, OP *cont, I32 has_my)
5701 PERL_UNUSED_ARG(debuggable);
5704 if (expr->op_type == OP_READLINE
5705 || expr->op_type == OP_READDIR
5706 || expr->op_type == OP_GLOB
5707 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
5708 expr = newUNOP(OP_DEFINED, 0,
5709 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
5710 } else if (expr->op_flags & OPf_KIDS) {
5711 const OP * const k1 = ((UNOP*)expr)->op_first;
5712 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
5713 switch (expr->op_type) {
5715 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
5716 && (k2->op_flags & OPf_STACKED)
5717 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
5718 expr = newUNOP(OP_DEFINED, 0, expr);
5722 if (k1 && (k1->op_type == OP_READDIR
5723 || k1->op_type == OP_GLOB
5724 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
5725 || k1->op_type == OP_EACH
5726 || k1->op_type == OP_AEACH))
5727 expr = newUNOP(OP_DEFINED, 0, expr);
5734 block = newOP(OP_NULL, 0);
5735 else if (cont || has_my) {
5736 block = op_scope(block);
5740 next = LINKLIST(cont);
5743 OP * const unstack = newOP(OP_UNSTACK, 0);
5746 cont = op_append_elem(OP_LINESEQ, cont, unstack);
5750 listop = op_append_list(OP_LINESEQ, block, cont);
5752 redo = LINKLIST(listop);
5756 o = new_logop(OP_AND, 0, &expr, &listop);
5757 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
5758 op_free(expr); /* oops, it's a while (0) */
5760 return NULL; /* listop already freed by new_logop */
5763 ((LISTOP*)listop)->op_last->op_next =
5764 (o == listop ? redo : LINKLIST(o));
5770 NewOp(1101,loop,1,LOOP);
5771 loop->op_type = OP_ENTERLOOP;
5772 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
5773 loop->op_private = 0;
5774 loop->op_next = (OP*)loop;
5777 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
5779 loop->op_redoop = redo;
5780 loop->op_lastop = o;
5781 o->op_private |= loopflags;
5784 loop->op_nextop = next;
5786 loop->op_nextop = o;
5788 o->op_flags |= flags;
5789 o->op_private |= (flags >> 8);
5794 =for apidoc Am|OP *|newFOROP|I32 flags|OP *sv|OP *expr|OP *block|OP *cont
5796 Constructs, checks, and returns an op tree expressing a C<foreach>
5797 loop (iteration through a list of values). This is a heavyweight loop,
5798 with structure that allows exiting the loop by C<last> and suchlike.
5800 I<sv> optionally supplies the variable that will be aliased to each
5801 item in turn; if null, it defaults to C<$_> (either lexical or global).
5802 I<expr> supplies the list of values to iterate over. I<block> supplies
5803 the main body of the loop, and I<cont> optionally supplies a C<continue>
5804 block that operates as a second half of the body. All of these optree
5805 inputs are consumed by this function and become part of the constructed
5808 I<flags> gives the eight bits of C<op_flags> for the C<leaveloop>
5809 op and, shifted up eight bits, the eight bits of C<op_private> for
5810 the C<leaveloop> op, except that (in both cases) some bits will be set
5817 Perl_newFOROP(pTHX_ I32 flags, OP *sv, OP *expr, OP *block, OP *cont)
5822 PADOFFSET padoff = 0;
5827 PERL_ARGS_ASSERT_NEWFOROP;
5830 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
5831 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
5832 sv->op_type = OP_RV2GV;
5833 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
5835 /* The op_type check is needed to prevent a possible segfault
5836 * if the loop variable is undeclared and 'strict vars' is in
5837 * effect. This is illegal but is nonetheless parsed, so we
5838 * may reach this point with an OP_CONST where we're expecting
5841 if (cUNOPx(sv)->op_first->op_type == OP_GV
5842 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
5843 iterpflags |= OPpITER_DEF;
5845 else if (sv->op_type == OP_PADSV) { /* private variable */
5846 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
5847 padoff = sv->op_targ;
5857 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
5859 SV *const namesv = PAD_COMPNAME_SV(padoff);
5861 const char *const name = SvPV_const(namesv, len);
5863 if (len == 2 && name[0] == '$' && name[1] == '_')
5864 iterpflags |= OPpITER_DEF;
5868 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
5869 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
5870 sv = newGVOP(OP_GV, 0, PL_defgv);
5875 iterpflags |= OPpITER_DEF;
5877 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
5878 expr = op_lvalue(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
5879 iterflags |= OPf_STACKED;
5881 else if (expr->op_type == OP_NULL &&
5882 (expr->op_flags & OPf_KIDS) &&
5883 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
5885 /* Basically turn for($x..$y) into the same as for($x,$y), but we
5886 * set the STACKED flag to indicate that these values are to be
5887 * treated as min/max values by 'pp_iterinit'.
5889 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
5890 LOGOP* const range = (LOGOP*) flip->op_first;
5891 OP* const left = range->op_first;
5892 OP* const right = left->op_sibling;
5895 range->op_flags &= ~OPf_KIDS;
5896 range->op_first = NULL;
5898 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
5899 listop->op_first->op_next = range->op_next;
5900 left->op_next = range->op_other;
5901 right->op_next = (OP*)listop;
5902 listop->op_next = listop->op_first;
5905 op_getmad(expr,(OP*)listop,'O');
5909 expr = (OP*)(listop);
5911 iterflags |= OPf_STACKED;
5914 expr = op_lvalue(force_list(expr), OP_GREPSTART);
5917 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
5918 op_append_elem(OP_LIST, expr, scalar(sv))));
5919 assert(!loop->op_next);
5920 /* for my $x () sets OPpLVAL_INTRO;
5921 * for our $x () sets OPpOUR_INTRO */
5922 loop->op_private = (U8)iterpflags;
5923 #ifdef PL_OP_SLAB_ALLOC
5926 NewOp(1234,tmp,1,LOOP);
5927 Copy(loop,tmp,1,LISTOP);
5928 S_op_destroy(aTHX_ (OP*)loop);
5932 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
5934 loop->op_targ = padoff;
5935 wop = newWHILEOP(flags, 1, loop, newOP(OP_ITER, 0), block, cont, 0);
5937 op_getmad(madsv, (OP*)loop, 'v');
5942 =for apidoc Am|OP *|newLOOPEX|I32 type|OP *label
5944 Constructs, checks, and returns a loop-exiting op (such as C<goto>
5945 or C<last>). I<type> is the opcode. I<label> supplies the parameter
5946 determining the target of the op; it is consumed by this function and
5947 become part of the constructed op tree.
5953 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
5958 PERL_ARGS_ASSERT_NEWLOOPEX;
5960 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
5962 if (type != OP_GOTO || label->op_type == OP_CONST) {
5963 /* "last()" means "last" */
5964 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
5965 o = newOP(type, OPf_SPECIAL);
5967 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
5968 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
5972 op_getmad(label,o,'L');
5978 /* Check whether it's going to be a goto &function */
5979 if (label->op_type == OP_ENTERSUB
5980 && !(label->op_flags & OPf_STACKED))
5981 label = newUNOP(OP_REFGEN, 0, op_lvalue(label, OP_REFGEN));
5982 o = newUNOP(type, OPf_STACKED, label);
5984 PL_hints |= HINT_BLOCK_SCOPE;
5988 /* if the condition is a literal array or hash
5989 (or @{ ... } etc), make a reference to it.
5992 S_ref_array_or_hash(pTHX_ OP *cond)
5995 && (cond->op_type == OP_RV2AV
5996 || cond->op_type == OP_PADAV
5997 || cond->op_type == OP_RV2HV
5998 || cond->op_type == OP_PADHV))
6000 return newUNOP(OP_REFGEN, 0, op_lvalue(cond, OP_REFGEN));
6003 && (cond->op_type == OP_ASLICE
6004 || cond->op_type == OP_HSLICE)) {
6006 /* anonlist now needs a list from this op, was previously used in
6008 cond->op_flags |= ~(OPf_WANT_SCALAR | OPf_REF);
6009 cond->op_flags |= OPf_WANT_LIST;
6011 return newANONLIST(op_lvalue(cond, OP_ANONLIST));
6018 /* These construct the optree fragments representing given()
6021 entergiven and enterwhen are LOGOPs; the op_other pointer
6022 points up to the associated leave op. We need this so we
6023 can put it in the context and make break/continue work.
6024 (Also, of course, pp_enterwhen will jump straight to
6025 op_other if the match fails.)
6029 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
6030 I32 enter_opcode, I32 leave_opcode,
6031 PADOFFSET entertarg)
6037 PERL_ARGS_ASSERT_NEWGIVWHENOP;
6039 NewOp(1101, enterop, 1, LOGOP);
6040 enterop->op_type = (Optype)enter_opcode;
6041 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
6042 enterop->op_flags = (U8) OPf_KIDS;
6043 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
6044 enterop->op_private = 0;
6046 o = newUNOP(leave_opcode, 0, (OP *) enterop);
6049 enterop->op_first = scalar(cond);
6050 cond->op_sibling = block;
6052 o->op_next = LINKLIST(cond);
6053 cond->op_next = (OP *) enterop;
6056 /* This is a default {} block */
6057 enterop->op_first = block;
6058 enterop->op_flags |= OPf_SPECIAL;
6060 o->op_next = (OP *) enterop;
6063 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
6064 entergiven and enterwhen both
6067 enterop->op_next = LINKLIST(block);
6068 block->op_next = enterop->op_other = o;
6073 /* Does this look like a boolean operation? For these purposes
6074 a boolean operation is:
6075 - a subroutine call [*]
6076 - a logical connective
6077 - a comparison operator
6078 - a filetest operator, with the exception of -s -M -A -C
6079 - defined(), exists() or eof()
6080 - /$re/ or $foo =~ /$re/
6082 [*] possibly surprising
6085 S_looks_like_bool(pTHX_ const OP *o)
6089 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
6091 switch(o->op_type) {
6094 return looks_like_bool(cLOGOPo->op_first);
6098 looks_like_bool(cLOGOPo->op_first)
6099 && looks_like_bool(cLOGOPo->op_first->op_sibling));
6104 o->op_flags & OPf_KIDS
6105 && looks_like_bool(cUNOPo->op_first));
6109 case OP_NOT: case OP_XOR:
6111 case OP_EQ: case OP_NE: case OP_LT:
6112 case OP_GT: case OP_LE: case OP_GE:
6114 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
6115 case OP_I_GT: case OP_I_LE: case OP_I_GE:
6117 case OP_SEQ: case OP_SNE: case OP_SLT:
6118 case OP_SGT: case OP_SLE: case OP_SGE:
6122 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
6123 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
6124 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
6125 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
6126 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
6127 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
6128 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
6129 case OP_FTTEXT: case OP_FTBINARY:
6131 case OP_DEFINED: case OP_EXISTS:
6132 case OP_MATCH: case OP_EOF:
6139 /* Detect comparisons that have been optimized away */
6140 if (cSVOPo->op_sv == &PL_sv_yes
6141 || cSVOPo->op_sv == &PL_sv_no)
6154 =for apidoc Am|OP *|newGIVENOP|OP *cond|OP *block|PADOFFSET defsv_off
6156 Constructs, checks, and returns an op tree expressing a C<given> block.
6157 I<cond> supplies the expression that will be locally assigned to a lexical
6158 variable, and I<block> supplies the body of the C<given> construct; they
6159 are consumed by this function and become part of the constructed op tree.
6160 I<defsv_off> is the pad offset of the scalar lexical variable that will
6167 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
6170 PERL_ARGS_ASSERT_NEWGIVENOP;
6171 return newGIVWHENOP(
6172 ref_array_or_hash(cond),
6174 OP_ENTERGIVEN, OP_LEAVEGIVEN,
6179 =for apidoc Am|OP *|newWHENOP|OP *cond|OP *block
6181 Constructs, checks, and returns an op tree expressing a C<when> block.
6182 I<cond> supplies the test expression, and I<block> supplies the block
6183 that will be executed if the test evaluates to true; they are consumed
6184 by this function and become part of the constructed op tree. I<cond>
6185 will be interpreted DWIMically, often as a comparison against C<$_>,
6186 and may be null to generate a C<default> block.
6192 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
6194 const bool cond_llb = (!cond || looks_like_bool(cond));
6197 PERL_ARGS_ASSERT_NEWWHENOP;
6202 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
6204 scalar(ref_array_or_hash(cond)));
6207 return newGIVWHENOP(cond_op, block, OP_ENTERWHEN, OP_LEAVEWHEN, 0);
6211 Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p,
6214 PERL_ARGS_ASSERT_CV_CKPROTO_LEN;
6216 /* Can't just use a strcmp on the prototype, as CONSTSUBs "cheat" by
6217 relying on SvCUR, and doubling up the buffer to hold CvFILE(). */
6218 if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */
6219 || (p && (len != SvCUR(cv) /* Not the same length. */
6220 || memNE(p, SvPVX_const(cv), len))))
6221 && ckWARN_d(WARN_PROTOTYPE)) {
6222 SV* const msg = sv_newmortal();
6226 gv_efullname3(name = sv_newmortal(), gv, NULL);
6227 sv_setpvs(msg, "Prototype mismatch:");
6229 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
6231 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv));
6233 sv_catpvs(msg, ": none");
6234 sv_catpvs(msg, " vs ");
6236 Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p);
6238 sv_catpvs(msg, "none");
6239 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
6243 static void const_sv_xsub(pTHX_ CV* cv);
6247 =head1 Optree Manipulation Functions
6249 =for apidoc cv_const_sv
6251 If C<cv> is a constant sub eligible for inlining. returns the constant
6252 value returned by the sub. Otherwise, returns NULL.
6254 Constant subs can be created with C<newCONSTSUB> or as described in
6255 L<perlsub/"Constant Functions">.
6260 Perl_cv_const_sv(pTHX_ const CV *const cv)
6262 PERL_UNUSED_CONTEXT;
6265 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
6267 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
6270 /* op_const_sv: examine an optree to determine whether it's in-lineable.
6271 * Can be called in 3 ways:
6274 * look for a single OP_CONST with attached value: return the value
6276 * cv && CvCLONE(cv) && !CvCONST(cv)
6278 * examine the clone prototype, and if contains only a single
6279 * OP_CONST referencing a pad const, or a single PADSV referencing
6280 * an outer lexical, return a non-zero value to indicate the CV is
6281 * a candidate for "constizing" at clone time
6285 * We have just cloned an anon prototype that was marked as a const
6286 * candidate. Try to grab the current value, and in the case of
6287 * PADSV, ignore it if it has multiple references. Return the value.
6291 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
6302 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
6303 o = cLISTOPo->op_first->op_sibling;
6305 for (; o; o = o->op_next) {
6306 const OPCODE type = o->op_type;
6308 if (sv && o->op_next == o)
6310 if (o->op_next != o) {
6311 if (type == OP_NEXTSTATE
6312 || (type == OP_NULL && !(o->op_flags & OPf_KIDS))
6313 || type == OP_PUSHMARK)
6315 if (type == OP_DBSTATE)
6318 if (type == OP_LEAVESUB || type == OP_RETURN)
6322 if (type == OP_CONST && cSVOPo->op_sv)
6324 else if (cv && type == OP_CONST) {
6325 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6329 else if (cv && type == OP_PADSV) {
6330 if (CvCONST(cv)) { /* newly cloned anon */
6331 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
6332 /* the candidate should have 1 ref from this pad and 1 ref
6333 * from the parent */
6334 if (!sv || SvREFCNT(sv) != 2)
6341 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
6342 sv = &PL_sv_undef; /* an arbitrary non-null value */
6357 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6360 /* This would be the return value, but the return cannot be reached. */
6361 OP* pegop = newOP(OP_NULL, 0);
6364 PERL_UNUSED_ARG(floor);
6374 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
6376 NORETURN_FUNCTION_END;
6381 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
6386 STRLEN ps_len = 0; /* init it to avoid false uninit warning from icc */
6387 register CV *cv = NULL;
6389 /* If the subroutine has no body, no attributes, and no builtin attributes
6390 then it's just a sub declaration, and we may be able to get away with
6391 storing with a placeholder scalar in the symbol table, rather than a
6392 full GV and CV. If anything is present then it will take a full CV to
6394 const I32 gv_fetch_flags
6395 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6397 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
6398 const char * const name = o ? SvPV_nolen_const(cSVOPo->op_sv) : NULL;
6402 assert(proto->op_type == OP_CONST);
6403 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
6409 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
6411 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
6412 SV * const sv = sv_newmortal();
6413 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
6414 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
6415 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
6416 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
6418 } else if (PL_curstash) {
6419 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
6422 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
6426 if (!PL_madskills) {
6435 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
6436 maximum a prototype before. */
6437 if (SvTYPE(gv) > SVt_NULL) {
6438 if (!SvPOK((const SV *)gv)
6439 && !(SvIOK((const SV *)gv) && SvIVX((const SV *)gv) == -1))
6441 Perl_ck_warner_d(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
6443 cv_ckproto_len((const CV *)gv, NULL, ps, ps_len);
6446 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
6448 sv_setiv(MUTABLE_SV(gv), -1);
6450 SvREFCNT_dec(PL_compcv);
6451 cv = PL_compcv = NULL;
6455 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
6457 if (!block || !ps || *ps || attrs
6458 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
6460 || block->op_type == OP_NULL
6465 const_sv = op_const_sv(block, NULL);
6468 const bool exists = CvROOT(cv) || CvXSUB(cv);
6470 /* if the subroutine doesn't exist and wasn't pre-declared
6471 * with a prototype, assume it will be AUTOLOADed,
6472 * skipping the prototype check
6474 if (exists || SvPOK(cv))
6475 cv_ckproto_len(cv, gv, ps, ps_len);
6476 /* already defined (or promised)? */
6477 if (exists || GvASSUMECV(gv)) {
6480 || block->op_type == OP_NULL
6483 if (CvFLAGS(PL_compcv)) {
6484 /* might have had built-in attrs applied */
6485 const bool pureperl = !CvISXSUB(cv) && CvROOT(cv);
6486 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && pureperl
6487 && ckWARN(WARN_MISC))
6488 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
6490 (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS
6491 & ~(CVf_LVALUE * pureperl));
6493 if (attrs) goto attrs;
6494 /* just a "sub foo;" when &foo is already defined */
6495 SAVEFREESV(PL_compcv);
6500 && block->op_type != OP_NULL
6503 if (ckWARN(WARN_REDEFINE)
6505 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
6507 const line_t oldline = CopLINE(PL_curcop);
6508 if (PL_parser && PL_parser->copline != NOLINE)
6509 CopLINE_set(PL_curcop, PL_parser->copline);
6510 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6511 CvCONST(cv) ? "Constant subroutine %s redefined"
6512 : "Subroutine %s redefined", name);
6513 CopLINE_set(PL_curcop, oldline);
6516 if (!PL_minus_c) /* keep old one around for madskills */
6519 /* (PL_madskills unset in used file.) */
6527 SvREFCNT_inc_simple_void_NN(const_sv);
6529 assert(!CvROOT(cv) && !CvCONST(cv));
6530 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
6531 CvXSUBANY(cv).any_ptr = const_sv;
6532 CvXSUB(cv) = const_sv_xsub;
6538 cv = newCONSTSUB(NULL, name, const_sv);
6540 mro_method_changed_in( /* sub Foo::Bar () { 123 } */
6541 (CvGV(cv) && GvSTASH(CvGV(cv)))
6550 SvREFCNT_dec(PL_compcv);
6554 if (cv) { /* must reuse cv if autoloaded */
6555 /* transfer PL_compcv to cv */
6558 && block->op_type != OP_NULL
6561 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
6562 AV *const temp_av = CvPADLIST(cv);
6563 CV *const temp_cv = CvOUTSIDE(cv);
6565 assert(!CvWEAKOUTSIDE(cv));
6566 assert(!CvCVGV_RC(cv));
6567 assert(CvGV(cv) == gv);
6570 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
6571 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
6572 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
6573 CvPADLIST(cv) = CvPADLIST(PL_compcv);
6574 CvOUTSIDE(PL_compcv) = temp_cv;
6575 CvPADLIST(PL_compcv) = temp_av;
6578 if (CvFILE(cv) && !CvISXSUB(cv)) {
6579 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
6580 Safefree(CvFILE(cv));
6583 CvFILE_set_from_cop(cv, PL_curcop);
6584 CvSTASH_set(cv, PL_curstash);
6586 /* inner references to PL_compcv must be fixed up ... */
6587 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
6588 if (PERLDB_INTER)/* Advice debugger on the new sub. */
6589 ++PL_sub_generation;
6592 /* Might have had built-in attributes applied -- propagate them. */
6593 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
6595 /* ... before we throw it away */
6596 SvREFCNT_dec(PL_compcv);
6604 if (strEQ(name, "import")) {
6605 PL_formfeed = MUTABLE_SV(cv);
6606 /* diag_listed_as: SKIPME */
6607 Perl_warner(aTHX_ packWARN(WARN_VOID), "0x%"UVxf"\n", PTR2UV(cv));
6611 mro_method_changed_in(GvSTASH(gv)); /* sub Foo::bar { (shift)+1 } */
6616 CvFILE_set_from_cop(cv, PL_curcop);
6617 CvSTASH_set(cv, PL_curstash);
6621 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
6622 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
6623 apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE);
6627 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
6629 if (PL_parser && PL_parser->error_count) {
6633 const char *s = strrchr(name, ':');
6635 if (strEQ(s, "BEGIN")) {
6636 const char not_safe[] =
6637 "BEGIN not safe after errors--compilation aborted";
6638 if (PL_in_eval & EVAL_KEEPERR)
6639 Perl_croak(aTHX_ not_safe);
6641 /* force display of errors found but not reported */
6642 sv_catpv(ERRSV, not_safe);
6643 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
6652 /* If we assign an optree to a PVCV, then we've defined a subroutine that
6653 the debugger could be able to set a breakpoint in, so signal to
6654 pp_entereval that it should not throw away any saved lines at scope
6657 PL_breakable_sub_gen++;
6658 /* This makes sub {}; work as expected. */
6659 if (block->op_type == OP_STUB) {
6660 OP* const newblock = newSTATEOP(0, NULL, 0);
6662 op_getmad(block,newblock,'B');
6668 else block->op_attached = 1;
6669 CvROOT(cv) = CvLVALUE(cv)
6670 ? newUNOP(OP_LEAVESUBLV, 0,
6671 op_lvalue(scalarseq(block), OP_LEAVESUBLV))
6672 : newUNOP(OP_LEAVESUB, 0, scalarseq(block));
6673 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6674 OpREFCNT_set(CvROOT(cv), 1);
6675 CvSTART(cv) = LINKLIST(CvROOT(cv));
6676 CvROOT(cv)->op_next = 0;
6677 CALL_PEEP(CvSTART(cv));
6678 finalize_optree(CvROOT(cv));
6680 /* now that optimizer has done its work, adjust pad values */
6682 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
6685 assert(!CvCONST(cv));
6686 if (ps && !*ps && op_const_sv(block, cv))
6691 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
6692 SV * const tmpstr = sv_newmortal();
6693 GV * const db_postponed = gv_fetchpvs("DB::postponed",
6694 GV_ADDMULTI, SVt_PVHV);
6696 SV * const sv = Perl_newSVpvf(aTHX_ "%s:%ld-%ld",
6699 (long)CopLINE(PL_curcop));
6700 gv_efullname3(tmpstr, gv, NULL);
6701 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
6702 SvCUR(tmpstr), sv, 0);
6703 hv = GvHVn(db_postponed);
6704 if (HvTOTALKEYS(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) {
6705 CV * const pcv = GvCV(db_postponed);
6711 call_sv(MUTABLE_SV(pcv), G_DISCARD);
6716 if (name && ! (PL_parser && PL_parser->error_count))
6717 process_special_blocks(name, gv, cv);
6722 PL_parser->copline = NOLINE;
6728 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
6731 const char *const colon = strrchr(fullname,':');
6732 const char *const name = colon ? colon + 1 : fullname;
6734 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
6737 if (strEQ(name, "BEGIN")) {
6738 const I32 oldscope = PL_scopestack_ix;
6740 SAVECOPFILE(&PL_compiling);
6741 SAVECOPLINE(&PL_compiling);
6743 DEBUG_x( dump_sub(gv) );
6744 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
6745 GvCV_set(gv,0); /* cv has been hijacked */
6746 call_list(oldscope, PL_beginav);
6748 PL_curcop = &PL_compiling;
6749 CopHINTS_set(&PL_compiling, PL_hints);
6756 if strEQ(name, "END") {
6757 DEBUG_x( dump_sub(gv) );
6758 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
6761 } else if (*name == 'U') {
6762 if (strEQ(name, "UNITCHECK")) {
6763 /* It's never too late to run a unitcheck block */
6764 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
6768 } else if (*name == 'C') {
6769 if (strEQ(name, "CHECK")) {
6771 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
6772 "Too late to run CHECK block");
6773 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
6777 } else if (*name == 'I') {
6778 if (strEQ(name, "INIT")) {
6780 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
6781 "Too late to run INIT block");
6782 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
6788 DEBUG_x( dump_sub(gv) );
6789 GvCV_set(gv,0); /* cv has been hijacked */
6794 =for apidoc newCONSTSUB
6796 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
6797 eligible for inlining at compile-time.
6799 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
6800 which won't be called if used as a destructor, but will suppress the overhead
6801 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
6808 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
6813 const char *const file = CopFILE(PL_curcop);
6815 SV *const temp_sv = CopFILESV(PL_curcop);
6816 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
6821 if (IN_PERL_RUNTIME) {
6822 /* at runtime, it's not safe to manipulate PL_curcop: it may be
6823 * an op shared between threads. Use a non-shared COP for our
6825 SAVEVPTR(PL_curcop);
6826 PL_curcop = &PL_compiling;
6828 SAVECOPLINE(PL_curcop);
6829 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
6832 PL_hints &= ~HINT_BLOCK_SCOPE;
6835 SAVESPTR(PL_curstash);
6836 SAVECOPSTASH(PL_curcop);
6837 PL_curstash = stash;
6838 CopSTASH_set(PL_curcop,stash);
6841 /* file becomes the CvFILE. For an XS, it's supposed to be static storage,
6842 and so doesn't get free()d. (It's expected to be from the C pre-
6843 processor __FILE__ directive). But we need a dynamically allocated one,
6844 and we need it to get freed. */
6845 cv = newXS_flags(name, const_sv_xsub, file ? file : "", "",
6846 XS_DYNAMIC_FILENAME);
6847 CvXSUBANY(cv).any_ptr = sv;
6852 CopSTASH_free(PL_curcop);
6860 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
6861 const char *const filename, const char *const proto,
6864 CV *cv = newXS(name, subaddr, filename);
6866 PERL_ARGS_ASSERT_NEWXS_FLAGS;
6868 if (flags & XS_DYNAMIC_FILENAME) {
6869 /* We need to "make arrangements" (ie cheat) to ensure that the
6870 filename lasts as long as the PVCV we just created, but also doesn't
6872 STRLEN filename_len = strlen(filename);
6873 STRLEN proto_and_file_len = filename_len;
6874 char *proto_and_file;
6878 proto_len = strlen(proto);
6879 proto_and_file_len += proto_len;
6881 Newx(proto_and_file, proto_and_file_len + 1, char);
6882 Copy(proto, proto_and_file, proto_len, char);
6883 Copy(filename, proto_and_file + proto_len, filename_len + 1, char);
6886 proto_and_file = savepvn(filename, filename_len);
6889 /* This gets free()d. :-) */
6890 sv_usepvn_flags(MUTABLE_SV(cv), proto_and_file, proto_and_file_len,
6891 SV_HAS_TRAILING_NUL);
6893 /* This gives us the correct prototype, rather than one with the
6894 file name appended. */
6895 SvCUR_set(cv, proto_len);
6899 CvFILE(cv) = proto_and_file + proto_len;
6901 sv_setpv(MUTABLE_SV(cv), proto);
6907 =for apidoc U||newXS
6909 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
6910 static storage, as it is used directly as CvFILE(), without a copy being made.
6916 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
6919 GV * const gv = gv_fetchpv(name ? name :
6920 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
6921 GV_ADDMULTI, SVt_PVCV);
6924 PERL_ARGS_ASSERT_NEWXS;
6927 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
6929 if ((cv = (name ? GvCV(gv) : NULL))) {
6931 /* just a cached method */
6935 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
6936 /* already defined (or promised) */
6937 /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */
6938 if (ckWARN(WARN_REDEFINE)) {
6939 GV * const gvcv = CvGV(cv);
6941 HV * const stash = GvSTASH(gvcv);
6943 const char *redefined_name = HvNAME_get(stash);
6944 if ( strEQ(redefined_name,"autouse") ) {
6945 const line_t oldline = CopLINE(PL_curcop);
6946 if (PL_parser && PL_parser->copline != NOLINE)
6947 CopLINE_set(PL_curcop, PL_parser->copline);
6948 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6949 CvCONST(cv) ? "Constant subroutine %s redefined"
6950 : "Subroutine %s redefined"
6952 CopLINE_set(PL_curcop, oldline);
6962 if (cv) /* must reuse cv if autoloaded */
6965 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
6969 mro_method_changed_in(GvSTASH(gv)); /* newXS */
6975 (void)gv_fetchfile(filename);
6976 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
6977 an external constant string */
6979 CvXSUB(cv) = subaddr;
6982 process_special_blocks(name, gv, cv);
6992 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
6997 OP* pegop = newOP(OP_NULL, 0);
7001 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
7002 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
7005 if ((cv = GvFORM(gv))) {
7006 if (ckWARN(WARN_REDEFINE)) {
7007 const line_t oldline = CopLINE(PL_curcop);
7008 if (PL_parser && PL_parser->copline != NOLINE)
7009 CopLINE_set(PL_curcop, PL_parser->copline);
7011 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7012 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
7014 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
7015 "Format STDOUT redefined");
7017 CopLINE_set(PL_curcop, oldline);
7024 CvFILE_set_from_cop(cv, PL_curcop);
7027 pad_tidy(padtidy_FORMAT);
7028 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
7029 CvROOT(cv)->op_private |= OPpREFCOUNTED;
7030 OpREFCNT_set(CvROOT(cv), 1);
7031 CvSTART(cv) = LINKLIST(CvROOT(cv));
7032 CvROOT(cv)->op_next = 0;
7033 CALL_PEEP(CvSTART(cv));
7034 finalize_optree(CvROOT(cv));
7036 op_getmad(o,pegop,'n');
7037 op_getmad_weak(block, pegop, 'b');
7042 PL_parser->copline = NOLINE;
7050 Perl_newANONLIST(pTHX_ OP *o)
7052 return convert(OP_ANONLIST, OPf_SPECIAL, o);
7056 Perl_newANONHASH(pTHX_ OP *o)
7058 return convert(OP_ANONHASH, OPf_SPECIAL, o);
7062 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
7064 return newANONATTRSUB(floor, proto, NULL, block);
7068 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
7070 return newUNOP(OP_REFGEN, 0,
7071 newSVOP(OP_ANONCODE, 0,
7072 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
7076 Perl_oopsAV(pTHX_ OP *o)
7080 PERL_ARGS_ASSERT_OOPSAV;
7082 switch (o->op_type) {
7084 o->op_type = OP_PADAV;
7085 o->op_ppaddr = PL_ppaddr[OP_PADAV];
7086 return ref(o, OP_RV2AV);
7089 o->op_type = OP_RV2AV;
7090 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
7095 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
7102 Perl_oopsHV(pTHX_ OP *o)
7106 PERL_ARGS_ASSERT_OOPSHV;
7108 switch (o->op_type) {
7111 o->op_type = OP_PADHV;
7112 o->op_ppaddr = PL_ppaddr[OP_PADHV];
7113 return ref(o, OP_RV2HV);
7117 o->op_type = OP_RV2HV;
7118 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
7123 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
7130 Perl_newAVREF(pTHX_ OP *o)
7134 PERL_ARGS_ASSERT_NEWAVREF;
7136 if (o->op_type == OP_PADANY) {
7137 o->op_type = OP_PADAV;
7138 o->op_ppaddr = PL_ppaddr[OP_PADAV];
7141 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
7142 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7143 "Using an array as a reference is deprecated");
7145 return newUNOP(OP_RV2AV, 0, scalar(o));
7149 Perl_newGVREF(pTHX_ I32 type, OP *o)
7151 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
7152 return newUNOP(OP_NULL, 0, o);
7153 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
7157 Perl_newHVREF(pTHX_ OP *o)
7161 PERL_ARGS_ASSERT_NEWHVREF;
7163 if (o->op_type == OP_PADANY) {
7164 o->op_type = OP_PADHV;
7165 o->op_ppaddr = PL_ppaddr[OP_PADHV];
7168 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
7169 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7170 "Using a hash as a reference is deprecated");
7172 return newUNOP(OP_RV2HV, 0, scalar(o));
7176 Perl_newCVREF(pTHX_ I32 flags, OP *o)
7178 return newUNOP(OP_RV2CV, flags, scalar(o));
7182 Perl_newSVREF(pTHX_ OP *o)
7186 PERL_ARGS_ASSERT_NEWSVREF;
7188 if (o->op_type == OP_PADANY) {
7189 o->op_type = OP_PADSV;
7190 o->op_ppaddr = PL_ppaddr[OP_PADSV];
7193 return newUNOP(OP_RV2SV, 0, scalar(o));
7196 /* Check routines. See the comments at the top of this file for details
7197 * on when these are called */
7200 Perl_ck_anoncode(pTHX_ OP *o)
7202 PERL_ARGS_ASSERT_CK_ANONCODE;
7204 cSVOPo->op_targ = pad_add_anon((CV*)cSVOPo->op_sv, o->op_type);
7206 cSVOPo->op_sv = NULL;
7211 Perl_ck_bitop(pTHX_ OP *o)
7215 PERL_ARGS_ASSERT_CK_BITOP;
7217 #define OP_IS_NUMCOMPARE(op) \
7218 ((op) == OP_LT || (op) == OP_I_LT || \
7219 (op) == OP_GT || (op) == OP_I_GT || \
7220 (op) == OP_LE || (op) == OP_I_LE || \
7221 (op) == OP_GE || (op) == OP_I_GE || \
7222 (op) == OP_EQ || (op) == OP_I_EQ || \
7223 (op) == OP_NE || (op) == OP_I_NE || \
7224 (op) == OP_NCMP || (op) == OP_I_NCMP)
7225 o->op_private = (U8)(PL_hints & HINT_INTEGER);
7226 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
7227 && (o->op_type == OP_BIT_OR
7228 || o->op_type == OP_BIT_AND
7229 || o->op_type == OP_BIT_XOR))
7231 const OP * const left = cBINOPo->op_first;
7232 const OP * const right = left->op_sibling;
7233 if ((OP_IS_NUMCOMPARE(left->op_type) &&
7234 (left->op_flags & OPf_PARENS) == 0) ||
7235 (OP_IS_NUMCOMPARE(right->op_type) &&
7236 (right->op_flags & OPf_PARENS) == 0))
7237 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
7238 "Possible precedence problem on bitwise %c operator",
7239 o->op_type == OP_BIT_OR ? '|'
7240 : o->op_type == OP_BIT_AND ? '&' : '^'
7247 Perl_ck_concat(pTHX_ OP *o)
7249 const OP * const kid = cUNOPo->op_first;
7251 PERL_ARGS_ASSERT_CK_CONCAT;
7252 PERL_UNUSED_CONTEXT;
7254 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
7255 !(kUNOP->op_first->op_flags & OPf_MOD))
7256 o->op_flags |= OPf_STACKED;
7261 Perl_ck_spair(pTHX_ OP *o)
7265 PERL_ARGS_ASSERT_CK_SPAIR;
7267 if (o->op_flags & OPf_KIDS) {
7270 const OPCODE type = o->op_type;
7271 o = modkids(ck_fun(o), type);
7272 kid = cUNOPo->op_first;
7273 newop = kUNOP->op_first->op_sibling;
7275 const OPCODE type = newop->op_type;
7276 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
7277 type == OP_PADAV || type == OP_PADHV ||
7278 type == OP_RV2AV || type == OP_RV2HV)
7282 op_getmad(kUNOP->op_first,newop,'K');
7284 op_free(kUNOP->op_first);
7286 kUNOP->op_first = newop;
7288 o->op_ppaddr = PL_ppaddr[++o->op_type];
7293 Perl_ck_delete(pTHX_ OP *o)
7295 PERL_ARGS_ASSERT_CK_DELETE;
7299 if (o->op_flags & OPf_KIDS) {
7300 OP * const kid = cUNOPo->op_first;
7301 switch (kid->op_type) {
7303 o->op_flags |= OPf_SPECIAL;
7306 o->op_private |= OPpSLICE;
7309 o->op_flags |= OPf_SPECIAL;
7314 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
7317 if (kid->op_private & OPpLVAL_INTRO)
7318 o->op_private |= OPpLVAL_INTRO;
7325 Perl_ck_die(pTHX_ OP *o)
7327 PERL_ARGS_ASSERT_CK_DIE;
7330 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7336 Perl_ck_eof(pTHX_ OP *o)
7340 PERL_ARGS_ASSERT_CK_EOF;
7342 if (o->op_flags & OPf_KIDS) {
7343 if (cLISTOPo->op_first->op_type == OP_STUB) {
7345 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
7347 op_getmad(o,newop,'O');
7359 Perl_ck_eval(pTHX_ OP *o)
7363 PERL_ARGS_ASSERT_CK_EVAL;
7365 PL_hints |= HINT_BLOCK_SCOPE;
7366 if (o->op_flags & OPf_KIDS) {
7367 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7370 o->op_flags &= ~OPf_KIDS;
7373 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
7379 cUNOPo->op_first = 0;
7384 NewOp(1101, enter, 1, LOGOP);
7385 enter->op_type = OP_ENTERTRY;
7386 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
7387 enter->op_private = 0;
7389 /* establish postfix order */
7390 enter->op_next = (OP*)enter;
7392 o = op_prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
7393 o->op_type = OP_LEAVETRY;
7394 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
7395 enter->op_other = o;
7396 op_getmad(oldo,o,'O');
7410 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
7411 op_getmad(oldo,o,'O');
7413 o->op_targ = (PADOFFSET)PL_hints;
7414 if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) {
7415 /* Store a copy of %^H that pp_entereval can pick up. */
7416 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
7417 MUTABLE_SV(hv_copy_hints_hv(GvHV(PL_hintgv))));
7418 cUNOPo->op_first->op_sibling = hhop;
7419 o->op_private |= OPpEVAL_HAS_HH;
7425 Perl_ck_exit(pTHX_ OP *o)
7427 PERL_ARGS_ASSERT_CK_EXIT;
7430 HV * const table = GvHV(PL_hintgv);
7432 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
7433 if (svp && *svp && SvTRUE(*svp))
7434 o->op_private |= OPpEXIT_VMSISH;
7436 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
7442 Perl_ck_exec(pTHX_ OP *o)
7444 PERL_ARGS_ASSERT_CK_EXEC;
7446 if (o->op_flags & OPf_STACKED) {
7449 kid = cUNOPo->op_first->op_sibling;
7450 if (kid->op_type == OP_RV2GV)
7459 Perl_ck_exists(pTHX_ OP *o)
7463 PERL_ARGS_ASSERT_CK_EXISTS;
7466 if (o->op_flags & OPf_KIDS) {
7467 OP * const kid = cUNOPo->op_first;
7468 if (kid->op_type == OP_ENTERSUB) {
7469 (void) ref(kid, o->op_type);
7470 if (kid->op_type != OP_RV2CV
7471 && !(PL_parser && PL_parser->error_count))
7472 Perl_croak(aTHX_ "%s argument is not a subroutine name",
7474 o->op_private |= OPpEXISTS_SUB;
7476 else if (kid->op_type == OP_AELEM)
7477 o->op_flags |= OPf_SPECIAL;
7478 else if (kid->op_type != OP_HELEM)
7479 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
7487 Perl_ck_rvconst(pTHX_ register OP *o)
7490 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7492 PERL_ARGS_ASSERT_CK_RVCONST;
7494 o->op_private |= (PL_hints & HINT_STRICT_REFS);
7495 if (o->op_type == OP_RV2CV)
7496 o->op_private &= ~1;
7498 if (kid->op_type == OP_CONST) {
7501 SV * const kidsv = kid->op_sv;
7503 /* Is it a constant from cv_const_sv()? */
7504 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
7505 SV * const rsv = SvRV(kidsv);
7506 const svtype type = SvTYPE(rsv);
7507 const char *badtype = NULL;
7509 switch (o->op_type) {
7511 if (type > SVt_PVMG)
7512 badtype = "a SCALAR";
7515 if (type != SVt_PVAV)
7516 badtype = "an ARRAY";
7519 if (type != SVt_PVHV)
7523 if (type != SVt_PVCV)
7528 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
7531 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
7532 const char *badthing;
7533 switch (o->op_type) {
7535 badthing = "a SCALAR";
7538 badthing = "an ARRAY";
7541 badthing = "a HASH";
7549 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
7550 SVfARG(kidsv), badthing);
7553 * This is a little tricky. We only want to add the symbol if we
7554 * didn't add it in the lexer. Otherwise we get duplicate strict
7555 * warnings. But if we didn't add it in the lexer, we must at
7556 * least pretend like we wanted to add it even if it existed before,
7557 * or we get possible typo warnings. OPpCONST_ENTERED says
7558 * whether the lexer already added THIS instance of this symbol.
7560 iscv = (o->op_type == OP_RV2CV) * 2;
7562 gv = gv_fetchsv(kidsv,
7563 iscv | !(kid->op_private & OPpCONST_ENTERED),
7566 : o->op_type == OP_RV2SV
7568 : o->op_type == OP_RV2AV
7570 : o->op_type == OP_RV2HV
7573 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
7575 kid->op_type = OP_GV;
7576 SvREFCNT_dec(kid->op_sv);
7578 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
7579 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
7580 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
7582 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
7584 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
7586 kid->op_private = 0;
7587 kid->op_ppaddr = PL_ppaddr[OP_GV];
7588 /* FAKE globs in the symbol table cause weird bugs (#77810) */
7596 Perl_ck_ftst(pTHX_ OP *o)
7599 const I32 type = o->op_type;
7601 PERL_ARGS_ASSERT_CK_FTST;
7603 if (o->op_flags & OPf_REF) {
7606 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
7607 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7608 const OPCODE kidtype = kid->op_type;
7610 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
7611 OP * const newop = newGVOP(type, OPf_REF,
7612 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
7614 op_getmad(o,newop,'O');
7620 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
7621 o->op_private |= OPpFT_ACCESS;
7622 if (PL_check[kidtype] == Perl_ck_ftst
7623 && kidtype != OP_STAT && kidtype != OP_LSTAT) {
7624 o->op_private |= OPpFT_STACKED;
7625 kid->op_private |= OPpFT_STACKING;
7634 if (type == OP_FTTTY)
7635 o = newGVOP(type, OPf_REF, PL_stdingv);
7637 o = newUNOP(type, 0, newDEFSVOP());
7638 op_getmad(oldo,o,'O');
7644 Perl_ck_fun(pTHX_ OP *o)
7647 const int type = o->op_type;
7648 register I32 oa = PL_opargs[type] >> OASHIFT;
7650 PERL_ARGS_ASSERT_CK_FUN;
7652 if (o->op_flags & OPf_STACKED) {
7653 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
7656 return no_fh_allowed(o);
7659 if (o->op_flags & OPf_KIDS) {
7660 OP **tokid = &cLISTOPo->op_first;
7661 register OP *kid = cLISTOPo->op_first;
7665 if (kid->op_type == OP_PUSHMARK ||
7666 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
7668 tokid = &kid->op_sibling;
7669 kid = kid->op_sibling;
7671 if (!kid && PL_opargs[type] & OA_DEFGV)
7672 *tokid = kid = newDEFSVOP();
7676 sibl = kid->op_sibling;
7678 if (!sibl && kid->op_type == OP_STUB) {
7685 /* list seen where single (scalar) arg expected? */
7686 if (numargs == 1 && !(oa >> 4)
7687 && kid->op_type == OP_LIST && type != OP_SCALAR)
7689 return too_many_arguments(o,PL_op_desc[type]);
7702 if ((type == OP_PUSH || type == OP_UNSHIFT)
7703 && !kid->op_sibling)
7704 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
7705 "Useless use of %s with no values",
7708 if (kid->op_type == OP_CONST &&
7709 (kid->op_private & OPpCONST_BARE))
7711 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
7712 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
7713 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7714 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
7715 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
7717 op_getmad(kid,newop,'K');
7722 kid->op_sibling = sibl;
7725 else if (kid->op_type == OP_CONST
7726 && ( !SvROK(cSVOPx_sv(kid))
7727 || SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV )
7729 bad_type(numargs, "array", PL_op_desc[type], kid);
7730 /* Defer checks to run-time if we have a scalar arg */
7731 if (kid->op_type == OP_RV2AV || kid->op_type == OP_PADAV)
7732 op_lvalue(kid, type);
7736 if (kid->op_type == OP_CONST &&
7737 (kid->op_private & OPpCONST_BARE))
7739 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
7740 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
7741 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7742 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
7743 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
7745 op_getmad(kid,newop,'K');
7750 kid->op_sibling = sibl;
7753 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
7754 bad_type(numargs, "hash", PL_op_desc[type], kid);
7755 op_lvalue(kid, type);
7759 OP * const newop = newUNOP(OP_NULL, 0, kid);
7760 kid->op_sibling = 0;
7762 newop->op_next = newop;
7764 kid->op_sibling = sibl;
7769 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
7770 if (kid->op_type == OP_CONST &&
7771 (kid->op_private & OPpCONST_BARE))
7773 OP * const newop = newGVOP(OP_GV, 0,
7774 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
7775 if (!(o->op_private & 1) && /* if not unop */
7776 kid == cLISTOPo->op_last)
7777 cLISTOPo->op_last = newop;
7779 op_getmad(kid,newop,'K');
7785 else if (kid->op_type == OP_READLINE) {
7786 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
7787 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
7790 I32 flags = OPf_SPECIAL;
7794 /* is this op a FH constructor? */
7795 if (is_handle_constructor(o,numargs)) {
7796 const char *name = NULL;
7800 /* Set a flag to tell rv2gv to vivify
7801 * need to "prove" flag does not mean something
7802 * else already - NI-S 1999/05/07
7805 if (kid->op_type == OP_PADSV) {
7807 = PAD_COMPNAME_SV(kid->op_targ);
7808 name = SvPV_const(namesv, len);
7810 else if (kid->op_type == OP_RV2SV
7811 && kUNOP->op_first->op_type == OP_GV)
7813 GV * const gv = cGVOPx_gv(kUNOP->op_first);
7815 len = GvNAMELEN(gv);
7817 else if (kid->op_type == OP_AELEM
7818 || kid->op_type == OP_HELEM)
7821 OP *op = ((BINOP*)kid)->op_first;
7825 const char * const a =
7826 kid->op_type == OP_AELEM ?
7828 if (((op->op_type == OP_RV2AV) ||
7829 (op->op_type == OP_RV2HV)) &&
7830 (firstop = ((UNOP*)op)->op_first) &&
7831 (firstop->op_type == OP_GV)) {
7832 /* packagevar $a[] or $h{} */
7833 GV * const gv = cGVOPx_gv(firstop);
7841 else if (op->op_type == OP_PADAV
7842 || op->op_type == OP_PADHV) {
7843 /* lexicalvar $a[] or $h{} */
7844 const char * const padname =
7845 PAD_COMPNAME_PV(op->op_targ);
7854 name = SvPV_const(tmpstr, len);
7859 name = "__ANONIO__";
7862 op_lvalue(kid, type);
7866 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
7867 namesv = PAD_SVl(targ);
7868 SvUPGRADE(namesv, SVt_PV);
7870 sv_setpvs(namesv, "$");
7871 sv_catpvn(namesv, name, len);
7874 kid->op_sibling = 0;
7875 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
7876 kid->op_targ = targ;
7877 kid->op_private |= priv;
7879 kid->op_sibling = sibl;
7885 op_lvalue(scalar(kid), type);
7889 tokid = &kid->op_sibling;
7890 kid = kid->op_sibling;
7893 if (kid && kid->op_type != OP_STUB)
7894 return too_many_arguments(o,OP_DESC(o));
7895 o->op_private |= numargs;
7897 /* FIXME - should the numargs move as for the PERL_MAD case? */
7898 o->op_private |= numargs;
7900 return too_many_arguments(o,OP_DESC(o));
7904 else if (PL_opargs[type] & OA_DEFGV) {
7906 OP *newop = newUNOP(type, 0, newDEFSVOP());
7907 op_getmad(o,newop,'O');
7910 /* Ordering of these two is important to keep f_map.t passing. */
7912 return newUNOP(type, 0, newDEFSVOP());
7917 while (oa & OA_OPTIONAL)
7919 if (oa && oa != OA_LIST)
7920 return too_few_arguments(o,OP_DESC(o));
7926 Perl_ck_glob(pTHX_ OP *o)
7931 PERL_ARGS_ASSERT_CK_GLOB;
7934 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
7935 op_append_elem(OP_GLOB, o, newDEFSVOP()); /* glob() => glob($_) */
7937 if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
7938 && GvCVu(gv) && GvIMPORTED_CV(gv)))
7940 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7943 #if !defined(PERL_EXTERNAL_GLOB)
7944 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7947 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
7948 newSVpvs("File::Glob"), NULL, NULL, NULL);
7949 if((glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV))) {
7950 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7951 GvCV_set(gv, GvCV(glob_gv));
7952 SvREFCNT_inc_void(MUTABLE_SV(GvCV(gv)));
7953 GvIMPORTED_CV_on(gv);
7957 #endif /* PERL_EXTERNAL_GLOB */
7959 assert(!(o->op_flags & OPf_SPECIAL));
7960 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7963 * \ null - const(wildcard)
7968 * \ mark - glob - rv2cv
7969 * | \ gv(CORE::GLOBAL::glob)
7971 * \ null - const(wildcard) - const(ix)
7973 o->op_flags |= OPf_SPECIAL;
7974 o->op_targ = pad_alloc(OP_GLOB, SVs_PADTMP);
7975 op_append_elem(OP_GLOB, o,
7976 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
7977 o = newLISTOP(OP_LIST, 0, o, NULL);
7978 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
7979 op_append_elem(OP_LIST, o,
7980 scalar(newUNOP(OP_RV2CV, 0,
7981 newGVOP(OP_GV, 0, gv)))));
7982 o = newUNOP(OP_NULL, 0, ck_subr(o));
7983 o->op_targ = OP_GLOB; /* hint at what it used to be: eg in newWHILEOP */
7986 gv = newGVgen("main");
7988 op_append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
7994 Perl_ck_grep(pTHX_ OP *o)
7999 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
8002 PERL_ARGS_ASSERT_CK_GREP;
8004 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
8005 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
8007 if (o->op_flags & OPf_STACKED) {
8010 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
8011 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
8012 return no_fh_allowed(o);
8013 for (k = kid; k; k = k->op_next) {
8016 NewOp(1101, gwop, 1, LOGOP);
8017 kid->op_next = (OP*)gwop;
8018 o->op_flags &= ~OPf_STACKED;
8020 kid = cLISTOPo->op_first->op_sibling;
8021 if (type == OP_MAPWHILE)
8026 if (PL_parser && PL_parser->error_count)
8028 kid = cLISTOPo->op_first->op_sibling;
8029 if (kid->op_type != OP_NULL)
8030 Perl_croak(aTHX_ "panic: ck_grep");
8031 kid = kUNOP->op_first;
8034 NewOp(1101, gwop, 1, LOGOP);
8035 gwop->op_type = type;
8036 gwop->op_ppaddr = PL_ppaddr[type];
8037 gwop->op_first = listkids(o);
8038 gwop->op_flags |= OPf_KIDS;
8039 gwop->op_other = LINKLIST(kid);
8040 kid->op_next = (OP*)gwop;
8041 offset = pad_findmy_pvs("$_", 0);
8042 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
8043 o->op_private = gwop->op_private = 0;
8044 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
8047 o->op_private = gwop->op_private = OPpGREP_LEX;
8048 gwop->op_targ = o->op_targ = offset;
8051 kid = cLISTOPo->op_first->op_sibling;
8052 if (!kid || !kid->op_sibling)
8053 return too_few_arguments(o,OP_DESC(o));
8054 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
8055 op_lvalue(kid, OP_GREPSTART);
8061 Perl_ck_index(pTHX_ OP *o)
8063 PERL_ARGS_ASSERT_CK_INDEX;
8065 if (o->op_flags & OPf_KIDS) {
8066 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8068 kid = kid->op_sibling; /* get past "big" */
8069 if (kid && kid->op_type == OP_CONST) {
8070 const bool save_taint = PL_tainted;
8071 fbm_compile(((SVOP*)kid)->op_sv, 0);
8072 PL_tainted = save_taint;
8079 Perl_ck_lfun(pTHX_ OP *o)
8081 const OPCODE type = o->op_type;
8083 PERL_ARGS_ASSERT_CK_LFUN;
8085 return modkids(ck_fun(o), type);
8089 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
8091 PERL_ARGS_ASSERT_CK_DEFINED;
8093 if ((o->op_flags & OPf_KIDS)) {
8094 switch (cUNOPo->op_first->op_type) {
8096 /* This is needed for
8097 if (defined %stash::)
8098 to work. Do not break Tk.
8100 break; /* Globals via GV can be undef */
8102 case OP_AASSIGN: /* Is this a good idea? */
8103 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8104 "defined(@array) is deprecated");
8105 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8106 "\t(Maybe you should just omit the defined()?)\n");
8110 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8111 "defined(%%hash) is deprecated");
8112 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
8113 "\t(Maybe you should just omit the defined()?)\n");
8124 Perl_ck_readline(pTHX_ OP *o)
8126 PERL_ARGS_ASSERT_CK_READLINE;
8128 if (!(o->op_flags & OPf_KIDS)) {
8130 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
8132 op_getmad(o,newop,'O');
8142 Perl_ck_rfun(pTHX_ OP *o)
8144 const OPCODE type = o->op_type;
8146 PERL_ARGS_ASSERT_CK_RFUN;
8148 return refkids(ck_fun(o), type);
8152 Perl_ck_listiob(pTHX_ OP *o)
8156 PERL_ARGS_ASSERT_CK_LISTIOB;
8158 kid = cLISTOPo->op_first;
8161 kid = cLISTOPo->op_first;
8163 if (kid->op_type == OP_PUSHMARK)
8164 kid = kid->op_sibling;
8165 if (kid && o->op_flags & OPf_STACKED)
8166 kid = kid->op_sibling;
8167 else if (kid && !kid->op_sibling) { /* print HANDLE; */
8168 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
8169 o->op_flags |= OPf_STACKED; /* make it a filehandle */
8170 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
8171 cLISTOPo->op_first->op_sibling = kid;
8172 cLISTOPo->op_last = kid;
8173 kid = kid->op_sibling;
8178 op_append_elem(o->op_type, o, newDEFSVOP());
8184 Perl_ck_smartmatch(pTHX_ OP *o)
8187 PERL_ARGS_ASSERT_CK_SMARTMATCH;
8188 if (0 == (o->op_flags & OPf_SPECIAL)) {
8189 OP *first = cBINOPo->op_first;
8190 OP *second = first->op_sibling;
8192 /* Implicitly take a reference to an array or hash */
8193 first->op_sibling = NULL;
8194 first = cBINOPo->op_first = ref_array_or_hash(first);
8195 second = first->op_sibling = ref_array_or_hash(second);
8197 /* Implicitly take a reference to a regular expression */
8198 if (first->op_type == OP_MATCH) {
8199 first->op_type = OP_QR;
8200 first->op_ppaddr = PL_ppaddr[OP_QR];
8202 if (second->op_type == OP_MATCH) {
8203 second->op_type = OP_QR;
8204 second->op_ppaddr = PL_ppaddr[OP_QR];
8213 Perl_ck_sassign(pTHX_ OP *o)
8216 OP * const kid = cLISTOPo->op_first;
8218 PERL_ARGS_ASSERT_CK_SASSIGN;
8220 /* has a disposable target? */
8221 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
8222 && !(kid->op_flags & OPf_STACKED)
8223 /* Cannot steal the second time! */
8224 && !(kid->op_private & OPpTARGET_MY)
8225 /* Keep the full thing for madskills */
8229 OP * const kkid = kid->op_sibling;
8231 /* Can just relocate the target. */
8232 if (kkid && kkid->op_type == OP_PADSV
8233 && !(kkid->op_private & OPpLVAL_INTRO))
8235 kid->op_targ = kkid->op_targ;
8237 /* Now we do not need PADSV and SASSIGN. */
8238 kid->op_sibling = o->op_sibling; /* NULL */
8239 cLISTOPo->op_first = NULL;
8242 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
8246 if (kid->op_sibling) {
8247 OP *kkid = kid->op_sibling;
8248 /* For state variable assignment, kkid is a list op whose op_last
8250 if ((kkid->op_type == OP_PADSV ||
8251 (kkid->op_type == OP_LIST &&
8252 (kkid = cLISTOPx(kkid)->op_last)->op_type == OP_PADSV
8255 && (kkid->op_private & OPpLVAL_INTRO)
8256 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
8257 const PADOFFSET target = kkid->op_targ;
8258 OP *const other = newOP(OP_PADSV,
8260 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
8261 OP *const first = newOP(OP_NULL, 0);
8262 OP *const nullop = newCONDOP(0, first, o, other);
8263 OP *const condop = first->op_next;
8264 /* hijacking PADSTALE for uninitialized state variables */
8265 SvPADSTALE_on(PAD_SVl(target));
8267 condop->op_type = OP_ONCE;
8268 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
8269 condop->op_targ = target;
8270 other->op_targ = target;
8272 /* Because we change the type of the op here, we will skip the
8273 assignment binop->op_last = binop->op_first->op_sibling; at the
8274 end of Perl_newBINOP(). So need to do it here. */
8275 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
8284 Perl_ck_match(pTHX_ OP *o)
8288 PERL_ARGS_ASSERT_CK_MATCH;
8290 if (o->op_type != OP_QR && PL_compcv) {
8291 const PADOFFSET offset = pad_findmy_pvs("$_", 0);
8292 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
8293 o->op_targ = offset;
8294 o->op_private |= OPpTARGET_MY;
8297 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
8298 o->op_private |= OPpRUNTIME;
8303 Perl_ck_method(pTHX_ OP *o)
8305 OP * const kid = cUNOPo->op_first;
8307 PERL_ARGS_ASSERT_CK_METHOD;
8309 if (kid->op_type == OP_CONST) {
8310 SV* sv = kSVOP->op_sv;
8311 const char * const method = SvPVX_const(sv);
8312 if (!(strchr(method, ':') || strchr(method, '\''))) {
8314 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
8315 sv = newSVpvn_share(method, SvCUR(sv), 0);
8318 kSVOP->op_sv = NULL;
8320 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
8322 op_getmad(o,cmop,'O');
8333 Perl_ck_null(pTHX_ OP *o)
8335 PERL_ARGS_ASSERT_CK_NULL;
8336 PERL_UNUSED_CONTEXT;
8341 Perl_ck_open(pTHX_ OP *o)
8344 HV * const table = GvHV(PL_hintgv);
8346 PERL_ARGS_ASSERT_CK_OPEN;
8349 SV **svp = hv_fetchs(table, "open_IN", FALSE);
8352 const char *d = SvPV_const(*svp, len);
8353 const I32 mode = mode_from_discipline(d, len);
8354 if (mode & O_BINARY)
8355 o->op_private |= OPpOPEN_IN_RAW;
8356 else if (mode & O_TEXT)
8357 o->op_private |= OPpOPEN_IN_CRLF;
8360 svp = hv_fetchs(table, "open_OUT", FALSE);
8363 const char *d = SvPV_const(*svp, len);
8364 const I32 mode = mode_from_discipline(d, len);
8365 if (mode & O_BINARY)
8366 o->op_private |= OPpOPEN_OUT_RAW;
8367 else if (mode & O_TEXT)
8368 o->op_private |= OPpOPEN_OUT_CRLF;
8371 if (o->op_type == OP_BACKTICK) {
8372 if (!(o->op_flags & OPf_KIDS)) {
8373 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
8375 op_getmad(o,newop,'O');
8384 /* In case of three-arg dup open remove strictness
8385 * from the last arg if it is a bareword. */
8386 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
8387 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
8391 if ((last->op_type == OP_CONST) && /* The bareword. */
8392 (last->op_private & OPpCONST_BARE) &&
8393 (last->op_private & OPpCONST_STRICT) &&
8394 (oa = first->op_sibling) && /* The fh. */
8395 (oa = oa->op_sibling) && /* The mode. */
8396 (oa->op_type == OP_CONST) &&
8397 SvPOK(((SVOP*)oa)->op_sv) &&
8398 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
8399 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
8400 (last == oa->op_sibling)) /* The bareword. */
8401 last->op_private &= ~OPpCONST_STRICT;
8407 Perl_ck_repeat(pTHX_ OP *o)
8409 PERL_ARGS_ASSERT_CK_REPEAT;
8411 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
8412 o->op_private |= OPpREPEAT_DOLIST;
8413 cBINOPo->op_first = force_list(cBINOPo->op_first);
8421 Perl_ck_require(pTHX_ OP *o)
8426 PERL_ARGS_ASSERT_CK_REQUIRE;
8428 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
8429 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8431 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
8432 SV * const sv = kid->op_sv;
8433 U32 was_readonly = SvREADONLY(sv);
8440 sv_force_normal_flags(sv, 0);
8441 assert(!SvREADONLY(sv));
8451 for (; s < end; s++) {
8452 if (*s == ':' && s[1] == ':') {
8454 Move(s+2, s+1, end - s - 1, char);
8459 sv_catpvs(sv, ".pm");
8460 SvFLAGS(sv) |= was_readonly;
8464 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
8465 /* handle override, if any */
8466 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
8467 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
8468 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
8469 gv = gvp ? *gvp : NULL;
8473 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
8474 OP * const kid = cUNOPo->op_first;
8477 cUNOPo->op_first = 0;
8481 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
8482 op_append_elem(OP_LIST, kid,
8483 scalar(newUNOP(OP_RV2CV, 0,
8486 op_getmad(o,newop,'O');
8490 return scalar(ck_fun(o));
8494 Perl_ck_return(pTHX_ OP *o)
8499 PERL_ARGS_ASSERT_CK_RETURN;
8501 kid = cLISTOPo->op_first->op_sibling;
8502 if (CvLVALUE(PL_compcv)) {
8503 for (; kid; kid = kid->op_sibling)
8504 op_lvalue(kid, OP_LEAVESUBLV);
8511 Perl_ck_select(pTHX_ OP *o)
8516 PERL_ARGS_ASSERT_CK_SELECT;
8518 if (o->op_flags & OPf_KIDS) {
8519 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8520 if (kid && kid->op_sibling) {
8521 o->op_type = OP_SSELECT;
8522 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
8524 return fold_constants(o);
8528 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8529 if (kid && kid->op_type == OP_RV2GV)
8530 kid->op_private &= ~HINT_STRICT_REFS;
8535 Perl_ck_shift(pTHX_ OP *o)
8538 const I32 type = o->op_type;
8540 PERL_ARGS_ASSERT_CK_SHIFT;
8542 if (!(o->op_flags & OPf_KIDS)) {
8545 if (!CvUNIQUE(PL_compcv)) {
8546 o->op_flags |= OPf_SPECIAL;
8550 argop = newUNOP(OP_RV2AV, 0, scalar(newGVOP(OP_GV, 0, PL_argvgv)));
8553 OP * const oldo = o;
8554 o = newUNOP(type, 0, scalar(argop));
8555 op_getmad(oldo,o,'O');
8560 return newUNOP(type, 0, scalar(argop));
8563 return scalar(ck_fun(o));
8567 Perl_ck_sort(pTHX_ OP *o)
8572 PERL_ARGS_ASSERT_CK_SORT;
8574 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
8575 HV * const hinthv = GvHV(PL_hintgv);
8577 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
8579 const I32 sorthints = (I32)SvIV(*svp);
8580 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
8581 o->op_private |= OPpSORT_QSORT;
8582 if ((sorthints & HINT_SORT_STABLE) != 0)
8583 o->op_private |= OPpSORT_STABLE;
8588 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
8590 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8591 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
8593 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
8595 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
8597 if (kid->op_type == OP_SCOPE) {
8601 else if (kid->op_type == OP_LEAVE) {
8602 if (o->op_type == OP_SORT) {
8603 op_null(kid); /* wipe out leave */
8606 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
8607 if (k->op_next == kid)
8609 /* don't descend into loops */
8610 else if (k->op_type == OP_ENTERLOOP
8611 || k->op_type == OP_ENTERITER)
8613 k = cLOOPx(k)->op_lastop;
8618 kid->op_next = 0; /* just disconnect the leave */
8619 k = kLISTOP->op_first;
8624 if (o->op_type == OP_SORT) {
8625 /* provide scalar context for comparison function/block */
8631 o->op_flags |= OPf_SPECIAL;
8633 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
8636 firstkid = firstkid->op_sibling;
8639 /* provide list context for arguments */
8640 if (o->op_type == OP_SORT)
8647 S_simplify_sort(pTHX_ OP *o)
8650 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
8656 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
8658 if (!(o->op_flags & OPf_STACKED))
8660 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
8661 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
8662 kid = kUNOP->op_first; /* get past null */
8663 if (kid->op_type != OP_SCOPE)
8665 kid = kLISTOP->op_last; /* get past scope */
8666 switch(kid->op_type) {
8674 k = kid; /* remember this node*/
8675 if (kBINOP->op_first->op_type != OP_RV2SV)
8677 kid = kBINOP->op_first; /* get past cmp */
8678 if (kUNOP->op_first->op_type != OP_GV)
8680 kid = kUNOP->op_first; /* get past rv2sv */
8682 if (GvSTASH(gv) != PL_curstash)
8684 gvname = GvNAME(gv);
8685 if (*gvname == 'a' && gvname[1] == '\0')
8687 else if (*gvname == 'b' && gvname[1] == '\0')
8692 kid = k; /* back to cmp */
8693 if (kBINOP->op_last->op_type != OP_RV2SV)
8695 kid = kBINOP->op_last; /* down to 2nd arg */
8696 if (kUNOP->op_first->op_type != OP_GV)
8698 kid = kUNOP->op_first; /* get past rv2sv */
8700 if (GvSTASH(gv) != PL_curstash)
8702 gvname = GvNAME(gv);
8704 ? !(*gvname == 'a' && gvname[1] == '\0')
8705 : !(*gvname == 'b' && gvname[1] == '\0'))
8707 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
8709 o->op_private |= OPpSORT_DESCEND;
8710 if (k->op_type == OP_NCMP)
8711 o->op_private |= OPpSORT_NUMERIC;
8712 if (k->op_type == OP_I_NCMP)
8713 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
8714 kid = cLISTOPo->op_first->op_sibling;
8715 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
8717 op_getmad(kid,o,'S'); /* then delete it */
8719 op_free(kid); /* then delete it */
8724 Perl_ck_split(pTHX_ OP *o)
8729 PERL_ARGS_ASSERT_CK_SPLIT;
8731 if (o->op_flags & OPf_STACKED)
8732 return no_fh_allowed(o);
8734 kid = cLISTOPo->op_first;
8735 if (kid->op_type != OP_NULL)
8736 Perl_croak(aTHX_ "panic: ck_split");
8737 kid = kid->op_sibling;
8738 op_free(cLISTOPo->op_first);
8740 cLISTOPo->op_first = kid;
8742 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
8743 cLISTOPo->op_last = kid; /* There was only one element previously */
8746 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
8747 OP * const sibl = kid->op_sibling;
8748 kid->op_sibling = 0;
8749 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
8750 if (cLISTOPo->op_first == cLISTOPo->op_last)
8751 cLISTOPo->op_last = kid;
8752 cLISTOPo->op_first = kid;
8753 kid->op_sibling = sibl;
8756 kid->op_type = OP_PUSHRE;
8757 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
8759 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
8760 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
8761 "Use of /g modifier is meaningless in split");
8764 if (!kid->op_sibling)
8765 op_append_elem(OP_SPLIT, o, newDEFSVOP());
8767 kid = kid->op_sibling;
8770 if (!kid->op_sibling)
8771 op_append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
8772 assert(kid->op_sibling);
8774 kid = kid->op_sibling;
8777 if (kid->op_sibling)
8778 return too_many_arguments(o,OP_DESC(o));
8784 Perl_ck_join(pTHX_ OP *o)
8786 const OP * const kid = cLISTOPo->op_first->op_sibling;
8788 PERL_ARGS_ASSERT_CK_JOIN;
8790 if (kid && kid->op_type == OP_MATCH) {
8791 if (ckWARN(WARN_SYNTAX)) {
8792 const REGEXP *re = PM_GETRE(kPMOP);
8793 const char *pmstr = re ? RX_PRECOMP_const(re) : "STRING";
8794 const STRLEN len = re ? RX_PRELEN(re) : 6;
8795 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
8796 "/%.*s/ should probably be written as \"%.*s\"",
8797 (int)len, pmstr, (int)len, pmstr);
8804 =for apidoc Am|CV *|rv2cv_op_cv|OP *cvop|U32 flags
8806 Examines an op, which is expected to identify a subroutine at runtime,
8807 and attempts to determine at compile time which subroutine it identifies.
8808 This is normally used during Perl compilation to determine whether
8809 a prototype can be applied to a function call. I<cvop> is the op
8810 being considered, normally an C<rv2cv> op. A pointer to the identified
8811 subroutine is returned, if it could be determined statically, and a null
8812 pointer is returned if it was not possible to determine statically.
8814 Currently, the subroutine can be identified statically if the RV that the
8815 C<rv2cv> is to operate on is provided by a suitable C<gv> or C<const> op.
8816 A C<gv> op is suitable if the GV's CV slot is populated. A C<const> op is
8817 suitable if the constant value must be an RV pointing to a CV. Details of
8818 this process may change in future versions of Perl. If the C<rv2cv> op
8819 has the C<OPpENTERSUB_AMPER> flag set then no attempt is made to identify
8820 the subroutine statically: this flag is used to suppress compile-time
8821 magic on a subroutine call, forcing it to use default runtime behaviour.
8823 If I<flags> has the bit C<RV2CVOPCV_MARK_EARLY> set, then the handling
8824 of a GV reference is modified. If a GV was examined and its CV slot was
8825 found to be empty, then the C<gv> op has the C<OPpEARLY_CV> flag set.
8826 If the op is not optimised away, and the CV slot is later populated with
8827 a subroutine having a prototype, that flag eventually triggers the warning
8828 "called too early to check prototype".
8830 If I<flags> has the bit C<RV2CVOPCV_RETURN_NAME_GV> set, then instead
8831 of returning a pointer to the subroutine it returns a pointer to the
8832 GV giving the most appropriate name for the subroutine in this context.
8833 Normally this is just the C<CvGV> of the subroutine, but for an anonymous
8834 (C<CvANON>) subroutine that is referenced through a GV it will be the
8835 referencing GV. The resulting C<GV*> is cast to C<CV*> to be returned.
8836 A null pointer is returned as usual if there is no statically-determinable
8843 Perl_rv2cv_op_cv(pTHX_ OP *cvop, U32 flags)
8848 PERL_ARGS_ASSERT_RV2CV_OP_CV;
8849 if (flags & ~(RV2CVOPCV_MARK_EARLY|RV2CVOPCV_RETURN_NAME_GV))
8850 Perl_croak(aTHX_ "panic: rv2cv_op_cv bad flags %x", (unsigned)flags);
8851 if (cvop->op_type != OP_RV2CV)
8853 if (cvop->op_private & OPpENTERSUB_AMPER)
8855 if (!(cvop->op_flags & OPf_KIDS))
8857 rvop = cUNOPx(cvop)->op_first;
8858 switch (rvop->op_type) {
8860 gv = cGVOPx_gv(rvop);
8863 if (flags & RV2CVOPCV_MARK_EARLY)
8864 rvop->op_private |= OPpEARLY_CV;
8869 SV *rv = cSVOPx_sv(rvop);
8879 if (SvTYPE((SV*)cv) != SVt_PVCV)
8881 if (flags & RV2CVOPCV_RETURN_NAME_GV) {
8882 if (!CvANON(cv) || !gv)
8891 =for apidoc Am|OP *|ck_entersub_args_list|OP *entersubop
8893 Performs the default fixup of the arguments part of an C<entersub>
8894 op tree. This consists of applying list context to each of the
8895 argument ops. This is the standard treatment used on a call marked
8896 with C<&>, or a method call, or a call through a subroutine reference,
8897 or any other call where the callee can't be identified at compile time,
8898 or a call where the callee has no prototype.
8904 Perl_ck_entersub_args_list(pTHX_ OP *entersubop)
8907 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_LIST;
8908 aop = cUNOPx(entersubop)->op_first;
8909 if (!aop->op_sibling)
8910 aop = cUNOPx(aop)->op_first;
8911 for (aop = aop->op_sibling; aop->op_sibling; aop = aop->op_sibling) {
8912 if (!(PL_madskills && aop->op_type == OP_STUB)) {
8914 op_lvalue(aop, OP_ENTERSUB);
8921 =for apidoc Am|OP *|ck_entersub_args_proto|OP *entersubop|GV *namegv|SV *protosv
8923 Performs the fixup of the arguments part of an C<entersub> op tree
8924 based on a subroutine prototype. This makes various modifications to
8925 the argument ops, from applying context up to inserting C<refgen> ops,
8926 and checking the number and syntactic types of arguments, as directed by
8927 the prototype. This is the standard treatment used on a subroutine call,
8928 not marked with C<&>, where the callee can be identified at compile time
8929 and has a prototype.
8931 I<protosv> supplies the subroutine prototype to be applied to the call.
8932 It may be a normal defined scalar, of which the string value will be used.
8933 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
8934 that has been cast to C<SV*>) which has a prototype. The prototype
8935 supplied, in whichever form, does not need to match the actual callee
8936 referenced by the op tree.
8938 If the argument ops disagree with the prototype, for example by having
8939 an unacceptable number of arguments, a valid op tree is returned anyway.
8940 The error is reflected in the parser state, normally resulting in a single
8941 exception at the top level of parsing which covers all the compilation
8942 errors that occurred. In the error message, the callee is referred to
8943 by the name defined by the I<namegv> parameter.
8949 Perl_ck_entersub_args_proto(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
8952 const char *proto, *proto_end;
8953 OP *aop, *prev, *cvop;
8956 I32 contextclass = 0;
8957 const char *e = NULL;
8958 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO;
8959 if (SvTYPE(protosv) == SVt_PVCV ? !SvPOK(protosv) : !SvOK(protosv))
8960 Perl_croak(aTHX_ "panic: ck_entersub_args_proto CV with no proto");
8961 proto = SvPV(protosv, proto_len);
8962 proto_end = proto + proto_len;
8963 aop = cUNOPx(entersubop)->op_first;
8964 if (!aop->op_sibling)
8965 aop = cUNOPx(aop)->op_first;
8967 aop = aop->op_sibling;
8968 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
8969 while (aop != cvop) {
8971 if (PL_madskills && aop->op_type == OP_STUB) {
8972 aop = aop->op_sibling;
8975 if (PL_madskills && aop->op_type == OP_NULL)
8976 o3 = ((UNOP*)aop)->op_first;
8980 if (proto >= proto_end)
8981 return too_many_arguments(entersubop, gv_ename(namegv));
8989 /* _ must be at the end */
8990 if (proto[1] && proto[1] != ';')
9005 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
9007 arg == 1 ? "block or sub {}" : "sub {}",
9008 gv_ename(namegv), o3);
9011 /* '*' allows any scalar type, including bareword */
9014 if (o3->op_type == OP_RV2GV)
9015 goto wrapref; /* autoconvert GLOB -> GLOBref */
9016 else if (o3->op_type == OP_CONST)
9017 o3->op_private &= ~OPpCONST_STRICT;
9018 else if (o3->op_type == OP_ENTERSUB) {
9019 /* accidental subroutine, revert to bareword */
9020 OP *gvop = ((UNOP*)o3)->op_first;
9021 if (gvop && gvop->op_type == OP_NULL) {
9022 gvop = ((UNOP*)gvop)->op_first;
9024 for (; gvop->op_sibling; gvop = gvop->op_sibling)
9027 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
9028 (gvop = ((UNOP*)gvop)->op_first) &&
9029 gvop->op_type == OP_GV)
9031 GV * const gv = cGVOPx_gv(gvop);
9032 OP * const sibling = aop->op_sibling;
9033 SV * const n = newSVpvs("");
9035 OP * const oldaop = aop;
9039 gv_fullname4(n, gv, "", FALSE);
9040 aop = newSVOP(OP_CONST, 0, n);
9041 op_getmad(oldaop,aop,'O');
9042 prev->op_sibling = aop;
9043 aop->op_sibling = sibling;
9053 if (o3->op_type == OP_RV2AV ||
9054 o3->op_type == OP_PADAV ||
9055 o3->op_type == OP_RV2HV ||
9056 o3->op_type == OP_PADHV
9071 if (contextclass++ == 0) {
9072 e = strchr(proto, ']');
9073 if (!e || e == proto)
9082 const char *p = proto;
9083 const char *const end = proto;
9086 /* \[$] accepts any scalar lvalue */
9088 && Perl_op_lvalue_flags(aTHX_
9090 OP_READ, /* not entersub */
9093 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
9095 gv_ename(namegv), o3);
9100 if (o3->op_type == OP_RV2GV)
9103 bad_type(arg, "symbol", gv_ename(namegv), o3);
9106 if (o3->op_type == OP_ENTERSUB)
9109 bad_type(arg, "subroutine entry", gv_ename(namegv),
9113 if (o3->op_type == OP_RV2SV ||
9114 o3->op_type == OP_PADSV ||
9115 o3->op_type == OP_HELEM ||
9116 o3->op_type == OP_AELEM)
9118 if (!contextclass) {
9119 /* \$ accepts any scalar lvalue */
9120 if (Perl_op_lvalue_flags(aTHX_
9122 OP_READ, /* not entersub */
9125 bad_type(arg, "scalar", gv_ename(namegv), o3);
9129 if (o3->op_type == OP_RV2AV ||
9130 o3->op_type == OP_PADAV)
9133 bad_type(arg, "array", gv_ename(namegv), o3);
9136 if (o3->op_type == OP_RV2HV ||
9137 o3->op_type == OP_PADHV)
9140 bad_type(arg, "hash", gv_ename(namegv), o3);
9144 OP* const kid = aop;
9145 OP* const sib = kid->op_sibling;
9146 kid->op_sibling = 0;
9147 aop = newUNOP(OP_REFGEN, 0, kid);
9148 aop->op_sibling = sib;
9149 prev->op_sibling = aop;
9151 if (contextclass && e) {
9166 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
9167 gv_ename(namegv), SVfARG(protosv));
9170 op_lvalue(aop, OP_ENTERSUB);
9172 aop = aop->op_sibling;
9174 if (aop == cvop && *proto == '_') {
9175 /* generate an access to $_ */
9177 aop->op_sibling = prev->op_sibling;
9178 prev->op_sibling = aop; /* instead of cvop */
9180 if (!optional && proto_end > proto &&
9181 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
9182 return too_few_arguments(entersubop, gv_ename(namegv));
9187 =for apidoc Am|OP *|ck_entersub_args_proto_or_list|OP *entersubop|GV *namegv|SV *protosv
9189 Performs the fixup of the arguments part of an C<entersub> op tree either
9190 based on a subroutine prototype or using default list-context processing.
9191 This is the standard treatment used on a subroutine call, not marked
9192 with C<&>, where the callee can be identified at compile time.
9194 I<protosv> supplies the subroutine prototype to be applied to the call,
9195 or indicates that there is no prototype. It may be a normal scalar,
9196 in which case if it is defined then the string value will be used
9197 as a prototype, and if it is undefined then there is no prototype.
9198 Alternatively, for convenience, it may be a subroutine object (a C<CV*>
9199 that has been cast to C<SV*>), of which the prototype will be used if it
9200 has one. The prototype (or lack thereof) supplied, in whichever form,
9201 does not need to match the actual callee referenced by the op tree.
9203 If the argument ops disagree with the prototype, for example by having
9204 an unacceptable number of arguments, a valid op tree is returned anyway.
9205 The error is reflected in the parser state, normally resulting in a single
9206 exception at the top level of parsing which covers all the compilation
9207 errors that occurred. In the error message, the callee is referred to
9208 by the name defined by the I<namegv> parameter.
9214 Perl_ck_entersub_args_proto_or_list(pTHX_ OP *entersubop,
9215 GV *namegv, SV *protosv)
9217 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_PROTO_OR_LIST;
9218 if (SvTYPE(protosv) == SVt_PVCV ? SvPOK(protosv) : SvOK(protosv))
9219 return ck_entersub_args_proto(entersubop, namegv, protosv);
9221 return ck_entersub_args_list(entersubop);
9225 Perl_ck_entersub_args_core(pTHX_ OP *entersubop, GV *namegv, SV *protosv)
9227 int opnum = SvTYPE(protosv) == SVt_PVCV ? 0 : (int)SvUV(protosv);
9228 OP *aop = cUNOPx(entersubop)->op_first;
9230 PERL_ARGS_ASSERT_CK_ENTERSUB_ARGS_CORE;
9234 if (!aop->op_sibling)
9235 aop = cUNOPx(aop)->op_first;
9237 aop = aop->op_sibling;
9238 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9239 if (PL_madskills) while (aop != cvop && aop->op_type == OP_STUB) {
9240 aop = aop->op_sibling;
9244 (void)too_many_arguments(entersubop, GvNAME(namegv));
9246 op_free(entersubop);
9247 switch(GvNAME(namegv)[2]) {
9248 case 'F': return newSVOP(OP_CONST, 0,
9249 newSVpv(CopFILE(PL_curcop),0));
9250 case 'L': return newSVOP(
9253 "%"IVdf, (IV)CopLINE(PL_curcop)
9256 case 'P': return newSVOP(OP_CONST, 0,
9258 ? newSVhek(HvNAME_HEK(PL_curstash))
9269 bool seenarg = FALSE;
9271 if (!aop->op_sibling)
9272 aop = cUNOPx(aop)->op_first;
9275 aop = aop->op_sibling;
9276 prev->op_sibling = NULL;
9279 prev=cvop, cvop = cvop->op_sibling)
9281 if (PL_madskills && cvop->op_sibling
9282 && cvop->op_type != OP_STUB) seenarg = TRUE
9285 prev->op_sibling = NULL;
9286 paren = OPf_SPECIAL * !(cvop->op_private & OPpENTERSUB_NOPAREN);
9288 if (aop == cvop) aop = NULL;
9289 op_free(entersubop);
9291 switch (PL_opargs[opnum] & OA_CLASS_MASK) {
9293 case OA_BASEOP_OR_UNOP:
9295 return aop ? newUNOP(opnum,paren,aop) : newOP(opnum,paren);
9299 if (!PL_madskills || seenarg)
9301 (void)too_many_arguments(aop, GvNAME(namegv));
9304 return newOP(opnum,0);
9306 return convert(opnum,0,aop);
9314 =for apidoc Am|void|cv_get_call_checker|CV *cv|Perl_call_checker *ckfun_p|SV **ckobj_p
9316 Retrieves the function that will be used to fix up a call to I<cv>.
9317 Specifically, the function is applied to an C<entersub> op tree for a
9318 subroutine call, not marked with C<&>, where the callee can be identified
9319 at compile time as I<cv>.
9321 The C-level function pointer is returned in I<*ckfun_p>, and an SV
9322 argument for it is returned in I<*ckobj_p>. The function is intended
9323 to be called in this manner:
9325 entersubop = (*ckfun_p)(aTHX_ entersubop, namegv, (*ckobj_p));
9327 In this call, I<entersubop> is a pointer to the C<entersub> op,
9328 which may be replaced by the check function, and I<namegv> is a GV
9329 supplying the name that should be used by the check function to refer
9330 to the callee of the C<entersub> op if it needs to emit any diagnostics.
9331 It is permitted to apply the check function in non-standard situations,
9332 such as to a call to a different subroutine or to a method call.
9334 By default, the function is
9335 L<Perl_ck_entersub_args_proto_or_list|/ck_entersub_args_proto_or_list>,
9336 and the SV parameter is I<cv> itself. This implements standard
9337 prototype processing. It can be changed, for a particular subroutine,
9338 by L</cv_set_call_checker>.
9344 Perl_cv_get_call_checker(pTHX_ CV *cv, Perl_call_checker *ckfun_p, SV **ckobj_p)
9347 PERL_ARGS_ASSERT_CV_GET_CALL_CHECKER;
9348 callmg = SvMAGICAL((SV*)cv) ? mg_find((SV*)cv, PERL_MAGIC_checkcall) : NULL;
9350 *ckfun_p = DPTR2FPTR(Perl_call_checker, callmg->mg_ptr);
9351 *ckobj_p = callmg->mg_obj;
9353 *ckfun_p = Perl_ck_entersub_args_proto_or_list;
9359 =for apidoc Am|void|cv_set_call_checker|CV *cv|Perl_call_checker ckfun|SV *ckobj
9361 Sets the function that will be used to fix up a call to I<cv>.
9362 Specifically, the function is applied to an C<entersub> op tree for a
9363 subroutine call, not marked with C<&>, where the callee can be identified
9364 at compile time as I<cv>.
9366 The C-level function pointer is supplied in I<ckfun>, and an SV argument
9367 for it is supplied in I<ckobj>. The function is intended to be called
9370 entersubop = ckfun(aTHX_ entersubop, namegv, ckobj);
9372 In this call, I<entersubop> is a pointer to the C<entersub> op,
9373 which may be replaced by the check function, and I<namegv> is a GV
9374 supplying the name that should be used by the check function to refer
9375 to the callee of the C<entersub> op if it needs to emit any diagnostics.
9376 It is permitted to apply the check function in non-standard situations,
9377 such as to a call to a different subroutine or to a method call.
9379 The current setting for a particular CV can be retrieved by
9380 L</cv_get_call_checker>.
9386 Perl_cv_set_call_checker(pTHX_ CV *cv, Perl_call_checker ckfun, SV *ckobj)
9388 PERL_ARGS_ASSERT_CV_SET_CALL_CHECKER;
9389 if (ckfun == Perl_ck_entersub_args_proto_or_list && ckobj == (SV*)cv) {
9390 if (SvMAGICAL((SV*)cv))
9391 mg_free_type((SV*)cv, PERL_MAGIC_checkcall);
9394 sv_magic((SV*)cv, &PL_sv_undef, PERL_MAGIC_checkcall, NULL, 0);
9395 callmg = mg_find((SV*)cv, PERL_MAGIC_checkcall);
9396 if (callmg->mg_flags & MGf_REFCOUNTED) {
9397 SvREFCNT_dec(callmg->mg_obj);
9398 callmg->mg_flags &= ~MGf_REFCOUNTED;
9400 callmg->mg_ptr = FPTR2DPTR(char *, ckfun);
9401 callmg->mg_obj = ckobj;
9402 if (ckobj != (SV*)cv) {
9403 SvREFCNT_inc_simple_void_NN(ckobj);
9404 callmg->mg_flags |= MGf_REFCOUNTED;
9410 Perl_ck_subr(pTHX_ OP *o)
9416 PERL_ARGS_ASSERT_CK_SUBR;
9418 aop = cUNOPx(o)->op_first;
9419 if (!aop->op_sibling)
9420 aop = cUNOPx(aop)->op_first;
9421 aop = aop->op_sibling;
9422 for (cvop = aop; cvop->op_sibling; cvop = cvop->op_sibling) ;
9423 cv = rv2cv_op_cv(cvop, RV2CVOPCV_MARK_EARLY);
9424 namegv = cv ? (GV*)rv2cv_op_cv(cvop, RV2CVOPCV_RETURN_NAME_GV) : NULL;
9426 o->op_private &= ~1;
9427 o->op_private |= OPpENTERSUB_HASTARG;
9428 o->op_private |= (PL_hints & HINT_STRICT_REFS);
9429 if (PERLDB_SUB && PL_curstash != PL_debstash)
9430 o->op_private |= OPpENTERSUB_DB;
9431 if (cvop->op_type == OP_RV2CV) {
9432 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
9434 } else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
9435 if (aop->op_type == OP_CONST)
9436 aop->op_private &= ~OPpCONST_STRICT;
9437 else if (aop->op_type == OP_LIST) {
9438 OP * const sib = ((UNOP*)aop)->op_first->op_sibling;
9439 if (sib && sib->op_type == OP_CONST)
9440 sib->op_private &= ~OPpCONST_STRICT;
9445 return ck_entersub_args_list(o);
9447 Perl_call_checker ckfun;
9449 cv_get_call_checker(cv, &ckfun, &ckobj);
9450 return ckfun(aTHX_ o, namegv, ckobj);
9455 Perl_ck_svconst(pTHX_ OP *o)
9457 PERL_ARGS_ASSERT_CK_SVCONST;
9458 PERL_UNUSED_CONTEXT;
9459 SvREADONLY_on(cSVOPo->op_sv);
9464 Perl_ck_chdir(pTHX_ OP *o)
9466 PERL_ARGS_ASSERT_CK_CHDIR;
9467 if (o->op_flags & OPf_KIDS) {
9468 SVOP * const kid = (SVOP*)cUNOPo->op_first;
9470 if (kid && kid->op_type == OP_CONST &&
9471 (kid->op_private & OPpCONST_BARE))
9473 o->op_flags |= OPf_SPECIAL;
9474 kid->op_private &= ~OPpCONST_STRICT;
9481 Perl_ck_trunc(pTHX_ OP *o)
9483 PERL_ARGS_ASSERT_CK_TRUNC;
9485 if (o->op_flags & OPf_KIDS) {
9486 SVOP *kid = (SVOP*)cUNOPo->op_first;
9488 if (kid->op_type == OP_NULL)
9489 kid = (SVOP*)kid->op_sibling;
9490 if (kid && kid->op_type == OP_CONST &&
9491 (kid->op_private & OPpCONST_BARE))
9493 o->op_flags |= OPf_SPECIAL;
9494 kid->op_private &= ~OPpCONST_STRICT;
9501 Perl_ck_unpack(pTHX_ OP *o)
9503 OP *kid = cLISTOPo->op_first;
9505 PERL_ARGS_ASSERT_CK_UNPACK;
9507 if (kid->op_sibling) {
9508 kid = kid->op_sibling;
9509 if (!kid->op_sibling)
9510 kid->op_sibling = newDEFSVOP();
9516 Perl_ck_substr(pTHX_ OP *o)
9518 PERL_ARGS_ASSERT_CK_SUBSTR;
9521 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
9522 OP *kid = cLISTOPo->op_first;
9524 if (kid->op_type == OP_NULL)
9525 kid = kid->op_sibling;
9527 kid->op_flags |= OPf_MOD;
9534 Perl_ck_each(pTHX_ OP *o)
9537 OP *kid = o->op_flags & OPf_KIDS ? cUNOPo->op_first : NULL;
9538 const unsigned orig_type = o->op_type;
9539 const unsigned array_type = orig_type == OP_EACH ? OP_AEACH
9540 : orig_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
9541 const unsigned ref_type = orig_type == OP_EACH ? OP_REACH
9542 : orig_type == OP_KEYS ? OP_RKEYS : OP_RVALUES;
9544 PERL_ARGS_ASSERT_CK_EACH;
9547 switch (kid->op_type) {
9553 CHANGE_TYPE(o, array_type);
9556 if (kid->op_private == OPpCONST_BARE
9557 || !SvROK(cSVOPx_sv(kid))
9558 || ( SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVAV
9559 && SvTYPE(SvRV(cSVOPx_sv(kid))) != SVt_PVHV )
9561 /* we let ck_fun handle it */
9564 CHANGE_TYPE(o, ref_type);
9568 /* if treating as a reference, defer additional checks to runtime */
9569 return o->op_type == ref_type ? o : ck_fun(o);
9572 /* caller is supposed to assign the return to the
9573 container of the rep_op var */
9575 S_opt_scalarhv(pTHX_ OP *rep_op) {
9579 PERL_ARGS_ASSERT_OPT_SCALARHV;
9581 NewOp(1101, unop, 1, UNOP);
9582 unop->op_type = (OPCODE)OP_BOOLKEYS;
9583 unop->op_ppaddr = PL_ppaddr[OP_BOOLKEYS];
9584 unop->op_flags = (U8)(OPf_WANT_SCALAR | OPf_KIDS );
9585 unop->op_private = (U8)(1 | ((OPf_WANT_SCALAR | OPf_KIDS) >> 8));
9586 unop->op_first = rep_op;
9587 unop->op_next = rep_op->op_next;
9588 rep_op->op_next = (OP*)unop;
9589 rep_op->op_flags|=(OPf_REF | OPf_MOD);
9590 unop->op_sibling = rep_op->op_sibling;
9591 rep_op->op_sibling = NULL;
9592 /* unop->op_targ = pad_alloc(OP_BOOLKEYS, SVs_PADTMP); */
9593 if (rep_op->op_type == OP_PADHV) {
9594 rep_op->op_flags &= ~OPf_WANT_SCALAR;
9595 rep_op->op_flags |= OPf_WANT_LIST;
9600 /* Checks if o acts as an in-place operator on an array. oright points to the
9601 * beginning of the right-hand side. Returns the left-hand side of the
9602 * assignment if o acts in-place, or NULL otherwise. */
9605 S_is_inplace_av(pTHX_ OP *o, OP *oright) {
9609 PERL_ARGS_ASSERT_IS_INPLACE_AV;
9612 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
9613 || oright->op_next != o
9614 || (oright->op_private & OPpLVAL_INTRO)
9618 /* o2 follows the chain of op_nexts through the LHS of the
9619 * assign (if any) to the aassign op itself */
9621 if (!o2 || o2->op_type != OP_NULL)
9624 if (!o2 || o2->op_type != OP_PUSHMARK)
9627 if (o2 && o2->op_type == OP_GV)
9630 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
9631 || (o2->op_private & OPpLVAL_INTRO)
9636 if (!o2 || o2->op_type != OP_NULL)
9639 if (!o2 || o2->op_type != OP_AASSIGN
9640 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
9643 /* check that the sort is the first arg on RHS of assign */
9645 o2 = cUNOPx(o2)->op_first;
9646 if (!o2 || o2->op_type != OP_NULL)
9648 o2 = cUNOPx(o2)->op_first;
9649 if (!o2 || o2->op_type != OP_PUSHMARK)
9651 if (o2->op_sibling != o)
9654 /* check the array is the same on both sides */
9655 if (oleft->op_type == OP_RV2AV) {
9656 if (oright->op_type != OP_RV2AV
9657 || !cUNOPx(oright)->op_first
9658 || cUNOPx(oright)->op_first->op_type != OP_GV
9659 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
9660 cGVOPx_gv(cUNOPx(oright)->op_first)
9664 else if (oright->op_type != OP_PADAV
9665 || oright->op_targ != oleft->op_targ
9672 #define MAX_DEFERRED 4
9675 if (defer_ix == (MAX_DEFERRED-1)) { \
9676 CALL_RPEEP(defer_queue[defer_base]); \
9677 defer_base = (defer_base + 1) % MAX_DEFERRED; \
9680 defer_queue[(defer_base + ++defer_ix) % MAX_DEFERRED] = o;
9682 /* A peephole optimizer. We visit the ops in the order they're to execute.
9683 * See the comments at the top of this file for more details about when
9684 * peep() is called */
9687 Perl_rpeep(pTHX_ register OP *o)
9690 register OP* oldop = NULL;
9691 OP* defer_queue[MAX_DEFERRED]; /* small queue of deferred branches */
9695 if (!o || o->op_opt)
9699 SAVEVPTR(PL_curcop);
9700 for (;; o = o->op_next) {
9704 while (defer_ix >= 0)
9705 CALL_RPEEP(defer_queue[(defer_base + defer_ix--) % MAX_DEFERRED]);
9709 /* By default, this op has now been optimised. A couple of cases below
9710 clear this again. */
9713 switch (o->op_type) {
9715 PL_curcop = ((COP*)o); /* for warnings */
9718 PL_curcop = ((COP*)o); /* for warnings */
9720 /* Two NEXTSTATEs in a row serve no purpose. Except if they happen
9721 to carry two labels. For now, take the easier option, and skip
9722 this optimisation if the first NEXTSTATE has a label. */
9723 if (!CopLABEL((COP*)o) && !PERLDB_NOOPT) {
9724 OP *nextop = o->op_next;
9725 while (nextop && nextop->op_type == OP_NULL)
9726 nextop = nextop->op_next;
9728 if (nextop && (nextop->op_type == OP_NEXTSTATE)) {
9729 COP *firstcop = (COP *)o;
9730 COP *secondcop = (COP *)nextop;
9731 /* We want the COP pointed to by o (and anything else) to
9732 become the next COP down the line. */
9735 firstcop->op_next = secondcop->op_next;
9737 /* Now steal all its pointers, and duplicate the other
9739 firstcop->cop_line = secondcop->cop_line;
9741 firstcop->cop_stashpv = secondcop->cop_stashpv;
9742 firstcop->cop_file = secondcop->cop_file;
9744 firstcop->cop_stash = secondcop->cop_stash;
9745 firstcop->cop_filegv = secondcop->cop_filegv;
9747 firstcop->cop_hints = secondcop->cop_hints;
9748 firstcop->cop_seq = secondcop->cop_seq;
9749 firstcop->cop_warnings = secondcop->cop_warnings;
9750 firstcop->cop_hints_hash = secondcop->cop_hints_hash;
9753 secondcop->cop_stashpv = NULL;
9754 secondcop->cop_file = NULL;
9756 secondcop->cop_stash = NULL;
9757 secondcop->cop_filegv = NULL;
9759 secondcop->cop_warnings = NULL;
9760 secondcop->cop_hints_hash = NULL;
9762 /* If we use op_null(), and hence leave an ex-COP, some
9763 warnings are misreported. For example, the compile-time
9764 error in 'use strict; no strict refs;' */
9765 secondcop->op_type = OP_NULL;
9766 secondcop->op_ppaddr = PL_ppaddr[OP_NULL];
9772 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
9773 if (o->op_next->op_private & OPpTARGET_MY) {
9774 if (o->op_flags & OPf_STACKED) /* chained concats */
9775 break; /* ignore_optimization */
9777 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
9778 o->op_targ = o->op_next->op_targ;
9779 o->op_next->op_targ = 0;
9780 o->op_private |= OPpTARGET_MY;
9783 op_null(o->op_next);
9787 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
9788 break; /* Scalar stub must produce undef. List stub is noop */
9792 if (o->op_targ == OP_NEXTSTATE
9793 || o->op_targ == OP_DBSTATE)
9795 PL_curcop = ((COP*)o);
9797 /* XXX: We avoid setting op_seq here to prevent later calls
9798 to rpeep() from mistakenly concluding that optimisation
9799 has already occurred. This doesn't fix the real problem,
9800 though (See 20010220.007). AMS 20010719 */
9801 /* op_seq functionality is now replaced by op_opt */
9808 if (oldop && o->op_next) {
9809 oldop->op_next = o->op_next;
9817 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
9818 OP* const pop = (o->op_type == OP_PADAV) ?
9819 o->op_next : o->op_next->op_next;
9821 if (pop && pop->op_type == OP_CONST &&
9822 ((PL_op = pop->op_next)) &&
9823 pop->op_next->op_type == OP_AELEM &&
9824 !(pop->op_next->op_private &
9825 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
9826 (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop))
9831 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
9832 no_bareword_allowed(pop);
9833 if (o->op_type == OP_GV)
9834 op_null(o->op_next);
9835 op_null(pop->op_next);
9837 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
9838 o->op_next = pop->op_next->op_next;
9839 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
9840 o->op_private = (U8)i;
9841 if (o->op_type == OP_GV) {
9844 o->op_type = OP_AELEMFAST;
9847 o->op_type = OP_AELEMFAST_LEX;
9852 if (o->op_next->op_type == OP_RV2SV) {
9853 if (!(o->op_next->op_private & OPpDEREF)) {
9854 op_null(o->op_next);
9855 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
9857 o->op_next = o->op_next->op_next;
9858 o->op_type = OP_GVSV;
9859 o->op_ppaddr = PL_ppaddr[OP_GVSV];
9862 else if (o->op_next->op_type == OP_READLINE
9863 && o->op_next->op_next->op_type == OP_CONCAT
9864 && (o->op_next->op_next->op_flags & OPf_STACKED))
9866 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
9867 o->op_type = OP_RCATLINE;
9868 o->op_flags |= OPf_STACKED;
9869 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
9870 op_null(o->op_next->op_next);
9871 op_null(o->op_next);
9881 fop = cUNOP->op_first;
9889 fop = cLOGOP->op_first;
9890 sop = fop->op_sibling;
9891 while (cLOGOP->op_other->op_type == OP_NULL)
9892 cLOGOP->op_other = cLOGOP->op_other->op_next;
9893 while (o->op_next && ( o->op_type == o->op_next->op_type
9894 || o->op_next->op_type == OP_NULL))
9895 o->op_next = o->op_next->op_next;
9896 DEFER(cLOGOP->op_other);
9900 if ((fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
9902 (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV)
9907 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
9908 while (nop && nop->op_next) {
9909 switch (nop->op_next->op_type) {
9914 lop = nop = nop->op_next;
9925 if ((lop->op_flags & OPf_WANT) == OPf_WANT_VOID) {
9926 if (fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
9927 cLOGOP->op_first = opt_scalarhv(fop);
9928 if (sop && (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV))
9929 cLOGOP->op_first->op_sibling = opt_scalarhv(sop);
9945 while (cLOGOP->op_other->op_type == OP_NULL)
9946 cLOGOP->op_other = cLOGOP->op_other->op_next;
9947 DEFER(cLOGOP->op_other);
9952 while (cLOOP->op_redoop->op_type == OP_NULL)
9953 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
9954 while (cLOOP->op_nextop->op_type == OP_NULL)
9955 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
9956 while (cLOOP->op_lastop->op_type == OP_NULL)
9957 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
9958 /* a while(1) loop doesn't have an op_next that escapes the
9959 * loop, so we have to explicitly follow the op_lastop to
9960 * process the rest of the code */
9961 DEFER(cLOOP->op_lastop);
9965 assert(!(cPMOP->op_pmflags & PMf_ONCE));
9966 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
9967 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
9968 cPMOP->op_pmstashstartu.op_pmreplstart
9969 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
9970 DEFER(cPMOP->op_pmstashstartu.op_pmreplstart);
9979 ( oldop->op_type == OP_AELEM
9980 || oldop->op_type == OP_PADSV
9981 || oldop->op_type == OP_RV2SV
9982 || oldop->op_type == OP_RV2GV
9983 || oldop->op_type == OP_HELEM
9985 && (oldop->op_private & OPpDEREF)
9987 || ( oldop->op_type == OP_ENTERSUB
9988 && oldop->op_private & OPpENTERSUB_DEREF )
9991 o->op_private |= OPpDEREFed;
9995 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
9999 /* check that RHS of sort is a single plain array */
10000 OP *oright = cUNOPo->op_first;
10001 if (!oright || oright->op_type != OP_PUSHMARK)
10004 /* reverse sort ... can be optimised. */
10005 if (!cUNOPo->op_sibling) {
10006 /* Nothing follows us on the list. */
10007 OP * const reverse = o->op_next;
10009 if (reverse->op_type == OP_REVERSE &&
10010 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
10011 OP * const pushmark = cUNOPx(reverse)->op_first;
10012 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
10013 && (cUNOPx(pushmark)->op_sibling == o)) {
10014 /* reverse -> pushmark -> sort */
10015 o->op_private |= OPpSORT_REVERSE;
10017 pushmark->op_next = oright->op_next;
10023 /* make @a = sort @a act in-place */
10025 oright = cUNOPx(oright)->op_sibling;
10028 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
10029 oright = cUNOPx(oright)->op_sibling;
10032 oleft = is_inplace_av(o, oright);
10036 /* transfer MODishness etc from LHS arg to RHS arg */
10037 oright->op_flags = oleft->op_flags;
10038 o->op_private |= OPpSORT_INPLACE;
10040 /* excise push->gv->rv2av->null->aassign */
10041 o2 = o->op_next->op_next;
10042 op_null(o2); /* PUSHMARK */
10044 if (o2->op_type == OP_GV) {
10045 op_null(o2); /* GV */
10048 op_null(o2); /* RV2AV or PADAV */
10049 o2 = o2->op_next->op_next;
10050 op_null(o2); /* AASSIGN */
10052 o->op_next = o2->op_next;
10058 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
10060 OP *oleft, *oright;
10061 LISTOP *enter, *exlist;
10063 /* @a = reverse @a */
10064 if ((oright = cLISTOPo->op_first)
10065 && (oright->op_type == OP_PUSHMARK)
10066 && (oright = oright->op_sibling)
10067 && (oleft = is_inplace_av(o, oright))) {
10070 /* transfer MODishness etc from LHS arg to RHS arg */
10071 oright->op_flags = oleft->op_flags;
10072 o->op_private |= OPpREVERSE_INPLACE;
10074 /* excise push->gv->rv2av->null->aassign */
10075 o2 = o->op_next->op_next;
10076 op_null(o2); /* PUSHMARK */
10078 if (o2->op_type == OP_GV) {
10079 op_null(o2); /* GV */
10082 op_null(o2); /* RV2AV or PADAV */
10083 o2 = o2->op_next->op_next;
10084 op_null(o2); /* AASSIGN */
10086 o->op_next = o2->op_next;
10090 enter = (LISTOP *) o->op_next;
10093 if (enter->op_type == OP_NULL) {
10094 enter = (LISTOP *) enter->op_next;
10098 /* for $a (...) will have OP_GV then OP_RV2GV here.
10099 for (...) just has an OP_GV. */
10100 if (enter->op_type == OP_GV) {
10101 gvop = (OP *) enter;
10102 enter = (LISTOP *) enter->op_next;
10105 if (enter->op_type == OP_RV2GV) {
10106 enter = (LISTOP *) enter->op_next;
10112 if (enter->op_type != OP_ENTERITER)
10115 iter = enter->op_next;
10116 if (!iter || iter->op_type != OP_ITER)
10119 expushmark = enter->op_first;
10120 if (!expushmark || expushmark->op_type != OP_NULL
10121 || expushmark->op_targ != OP_PUSHMARK)
10124 exlist = (LISTOP *) expushmark->op_sibling;
10125 if (!exlist || exlist->op_type != OP_NULL
10126 || exlist->op_targ != OP_LIST)
10129 if (exlist->op_last != o) {
10130 /* Mmm. Was expecting to point back to this op. */
10133 theirmark = exlist->op_first;
10134 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
10137 if (theirmark->op_sibling != o) {
10138 /* There's something between the mark and the reverse, eg
10139 for (1, reverse (...))
10144 ourmark = ((LISTOP *)o)->op_first;
10145 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
10148 ourlast = ((LISTOP *)o)->op_last;
10149 if (!ourlast || ourlast->op_next != o)
10152 rv2av = ourmark->op_sibling;
10153 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
10154 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
10155 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
10156 /* We're just reversing a single array. */
10157 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
10158 enter->op_flags |= OPf_STACKED;
10161 /* We don't have control over who points to theirmark, so sacrifice
10163 theirmark->op_next = ourmark->op_next;
10164 theirmark->op_flags = ourmark->op_flags;
10165 ourlast->op_next = gvop ? gvop : (OP *) enter;
10168 enter->op_private |= OPpITER_REVERSED;
10169 iter->op_private |= OPpITER_REVERSED;
10176 UNOP *refgen, *rv2cv;
10179 if ((o->op_flags & OPf_WANT) != OPf_WANT_VOID)
10182 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
10185 rv2gv = ((BINOP *)o)->op_last;
10186 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
10189 refgen = (UNOP *)((BINOP *)o)->op_first;
10191 if (!refgen || refgen->op_type != OP_REFGEN)
10194 exlist = (LISTOP *)refgen->op_first;
10195 if (!exlist || exlist->op_type != OP_NULL
10196 || exlist->op_targ != OP_LIST)
10199 if (exlist->op_first->op_type != OP_PUSHMARK)
10202 rv2cv = (UNOP*)exlist->op_last;
10204 if (rv2cv->op_type != OP_RV2CV)
10207 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
10208 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
10209 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
10211 o->op_private |= OPpASSIGN_CV_TO_GV;
10212 rv2gv->op_private |= OPpDONT_INIT_GV;
10213 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
10221 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
10222 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
10227 Perl_cpeep_t cpeep =
10228 XopENTRY(Perl_custom_op_xop(aTHX_ o), xop_peep);
10230 cpeep(aTHX_ o, oldop);
10241 Perl_peep(pTHX_ register OP *o)
10247 =head1 Custom Operators
10249 =for apidoc Ao||custom_op_xop
10250 Return the XOP structure for a given custom op. This function should be
10251 considered internal to OP_NAME and the other access macros: use them instead.
10257 Perl_custom_op_xop(pTHX_ const OP *o)
10263 static const XOP xop_null = { 0, 0, 0, 0, 0 };
10265 PERL_ARGS_ASSERT_CUSTOM_OP_XOP;
10266 assert(o->op_type == OP_CUSTOM);
10268 /* This is wrong. It assumes a function pointer can be cast to IV,
10269 * which isn't guaranteed, but this is what the old custom OP code
10270 * did. In principle it should be safer to Copy the bytes of the
10271 * pointer into a PV: since the new interface is hidden behind
10272 * functions, this can be changed later if necessary. */
10273 /* Change custom_op_xop if this ever happens */
10274 keysv = sv_2mortal(newSViv(PTR2IV(o->op_ppaddr)));
10277 he = hv_fetch_ent(PL_custom_ops, keysv, 0, 0);
10279 /* assume noone will have just registered a desc */
10280 if (!he && PL_custom_op_names &&
10281 (he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0))
10286 /* XXX does all this need to be shared mem? */
10287 Newxz(xop, 1, XOP);
10288 pv = SvPV(HeVAL(he), l);
10289 XopENTRY_set(xop, xop_name, savepvn(pv, l));
10290 if (PL_custom_op_descs &&
10291 (he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0))
10293 pv = SvPV(HeVAL(he), l);
10294 XopENTRY_set(xop, xop_desc, savepvn(pv, l));
10296 Perl_custom_op_register(aTHX_ o->op_ppaddr, xop);
10300 if (!he) return &xop_null;
10302 xop = INT2PTR(XOP *, SvIV(HeVAL(he)));
10307 =for apidoc Ao||custom_op_register
10308 Register a custom op. See L<perlguts/"Custom Operators">.
10314 Perl_custom_op_register(pTHX_ Perl_ppaddr_t ppaddr, const XOP *xop)
10318 PERL_ARGS_ASSERT_CUSTOM_OP_REGISTER;
10320 /* see the comment in custom_op_xop */
10321 keysv = sv_2mortal(newSViv(PTR2IV(ppaddr)));
10323 if (!PL_custom_ops)
10324 PL_custom_ops = newHV();
10326 if (!hv_store_ent(PL_custom_ops, keysv, newSViv(PTR2IV(xop)), 0))
10327 Perl_croak(aTHX_ "panic: can't register custom OP %s", xop->xop_name);
10331 =head1 Functions in file op.c
10333 =for apidoc core_prototype
10334 This function assigns the prototype of the named core function to C<sv>, or
10335 to a new mortal SV if C<sv> is NULL. It returns the modified C<sv>, or
10336 NULL if the core function has no prototype. C<code> is a code as returned
10337 by C<keyword()>. It must be negative and unequal to -KEY_CORE.
10343 Perl_core_prototype(pTHX_ SV *sv, const char *name, const int code,
10346 int i = 0, n = 0, seen_question = 0, defgv = 0;
10348 #define MAX_ARGS_OP ((sizeof(I32) - 1) * 2)
10349 char str[ MAX_ARGS_OP * 2 + 2 ]; /* One ';', one '\0' */
10350 bool nullret = FALSE;
10352 PERL_ARGS_ASSERT_CORE_PROTOTYPE;
10354 assert (code < 0 && code != -KEY_CORE);
10356 if (!sv) sv = sv_newmortal();
10358 #define retsetpvs(x,y) sv_setpvs(sv, x); if(opnum) *opnum=(y); return sv
10361 case KEY_and : case KEY_chop: case KEY_chomp:
10362 case KEY_cmp : case KEY_exec: case KEY_eq :
10363 case KEY_ge : case KEY_gt : case KEY_le :
10364 case KEY_lt : case KEY_ne : case KEY_or :
10365 case KEY_select: case KEY_system: case KEY_x : case KEY_xor:
10366 if (!opnum) return NULL; nullret = TRUE; goto findopnum;
10367 case KEY_keys: retsetpvs("+", OP_KEYS);
10368 case KEY_values: retsetpvs("+", OP_VALUES);
10369 case KEY_each: retsetpvs("+", OP_EACH);
10370 case KEY_push: retsetpvs("+@", OP_PUSH);
10371 case KEY_unshift: retsetpvs("+@", OP_UNSHIFT);
10372 case KEY_pop: retsetpvs(";+", OP_POP);
10373 case KEY_shift: retsetpvs(";+", OP_SHIFT);
10375 retsetpvs("+;$$@", OP_SPLICE);
10376 case KEY___FILE__: case KEY___LINE__: case KEY___PACKAGE__:
10385 while (i < MAXO) { /* The slow way. */
10386 if (strEQ(name, PL_op_name[i])
10387 || strEQ(name, PL_op_desc[i]))
10389 if (nullret) { assert(opnum); *opnum = i; return NULL; }
10394 assert(0); return NULL; /* Should not happen... */
10396 defgv = PL_opargs[i] & OA_DEFGV;
10397 oa = PL_opargs[i] >> OASHIFT;
10399 if (oa & OA_OPTIONAL && !seen_question && (
10400 !defgv || n || (oa & (OA_OPTIONAL - 1)) == OA_FILEREF
10405 if ((oa & (OA_OPTIONAL - 1)) >= OA_AVREF
10406 && (oa & (OA_OPTIONAL - 1)) <= OA_SCALARREF
10407 /* But globs are already references (kinda) */
10408 && (oa & (OA_OPTIONAL - 1)) != OA_FILEREF
10412 if ((oa & (OA_OPTIONAL - 1)) == OA_SCALARREF
10413 && !scalar_mod_type(NULL, i)) {
10418 if (i == OP_LOCK) str[n++] = '&';
10422 else str[n++] = ("?$@@%&*$")[oa & (OA_OPTIONAL - 1)];
10425 if (defgv && str[0] == '$')
10428 sv_setpvn(sv, str, n - 1);
10429 if (opnum) *opnum = i;
10435 /* Efficient sub that returns a constant scalar value. */
10437 const_sv_xsub(pTHX_ CV* cv)
10441 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
10445 /* diag_listed_as: SKIPME */
10446 Perl_croak(aTHX_ "usage: %s::%s()",
10447 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
10460 * c-indentation-style: bsd
10461 * c-basic-offset: 4
10462 * indent-tabs-mode: t
10465 * ex: set ts=8 sts=4 sw=4 noet: