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) CALL_FPTR(PL_peepp)(aTHX_ o)
107 #define CALL_OPFREEHOOK(o) if (PL_opfreehook) CALL_FPTR(PL_opfreehook)(aTHX_ o)
109 #if defined(PL_OP_SLAB_ALLOC)
111 #ifdef PERL_DEBUG_READONLY_OPS
112 # define PERL_SLAB_SIZE 4096
113 # include <sys/mman.h>
116 #ifndef PERL_SLAB_SIZE
117 #define PERL_SLAB_SIZE 2048
121 Perl_Slab_Alloc(pTHX_ size_t sz)
125 * To make incrementing use count easy PL_OpSlab is an I32 *
126 * To make inserting the link to slab PL_OpPtr is I32 **
127 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
128 * Add an overhead for pointer to slab and round up as a number of pointers
130 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
131 if ((PL_OpSpace -= sz) < 0) {
132 #ifdef PERL_DEBUG_READONLY_OPS
133 /* We need to allocate chunk by chunk so that we can control the VM
135 PL_OpPtr = (I32**) mmap(0, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE,
136 MAP_ANON|MAP_PRIVATE, -1, 0);
138 DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n",
139 (unsigned long) PERL_SLAB_SIZE*sizeof(I32*),
141 if(PL_OpPtr == MAP_FAILED) {
142 perror("mmap failed");
147 PL_OpPtr = (I32 **) PerlMemShared_calloc(PERL_SLAB_SIZE,sizeof(I32*));
152 /* We reserve the 0'th I32 sized chunk as a use count */
153 PL_OpSlab = (I32 *) PL_OpPtr;
154 /* Reduce size by the use count word, and by the size we need.
155 * Latter is to mimic the '-=' in the if() above
157 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
158 /* Allocation pointer starts at the top.
159 Theory: because we build leaves before trunk allocating at end
160 means that at run time access is cache friendly upward
162 PL_OpPtr += PERL_SLAB_SIZE;
164 #ifdef PERL_DEBUG_READONLY_OPS
165 /* We remember this slab. */
166 /* This implementation isn't efficient, but it is simple. */
167 PL_slabs = (I32**) realloc(PL_slabs, sizeof(I32**) * (PL_slab_count + 1));
168 PL_slabs[PL_slab_count++] = PL_OpSlab;
169 DEBUG_m(PerlIO_printf(Perl_debug_log, "Allocate %p\n", PL_OpSlab));
172 assert( PL_OpSpace >= 0 );
173 /* Move the allocation pointer down */
175 assert( PL_OpPtr > (I32 **) PL_OpSlab );
176 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
177 (*PL_OpSlab)++; /* Increment use count of slab */
178 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
179 assert( *PL_OpSlab > 0 );
180 return (void *)(PL_OpPtr + 1);
183 #ifdef PERL_DEBUG_READONLY_OPS
185 Perl_pending_Slabs_to_ro(pTHX) {
186 /* Turn all the allocated op slabs read only. */
187 U32 count = PL_slab_count;
188 I32 **const slabs = PL_slabs;
190 /* Reset the array of pending OP slabs, as we're about to turn this lot
191 read only. Also, do it ahead of the loop in case the warn triggers,
192 and a warn handler has an eval */
197 /* Force a new slab for any further allocation. */
201 void *const start = slabs[count];
202 const size_t size = PERL_SLAB_SIZE* sizeof(I32*);
203 if(mprotect(start, size, PROT_READ)) {
204 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d",
205 start, (unsigned long) size, errno);
213 S_Slab_to_rw(pTHX_ void *op)
215 I32 * const * const ptr = (I32 **) op;
216 I32 * const slab = ptr[-1];
218 PERL_ARGS_ASSERT_SLAB_TO_RW;
220 assert( ptr-1 > (I32 **) slab );
221 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
223 if(mprotect(slab, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE)) {
224 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d",
225 slab, (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), errno);
230 Perl_op_refcnt_inc(pTHX_ OP *o)
241 Perl_op_refcnt_dec(pTHX_ OP *o)
243 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
248 # define Slab_to_rw(op)
252 Perl_Slab_Free(pTHX_ void *op)
254 I32 * const * const ptr = (I32 **) op;
255 I32 * const slab = ptr[-1];
256 PERL_ARGS_ASSERT_SLAB_FREE;
257 assert( ptr-1 > (I32 **) slab );
258 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
261 if (--(*slab) == 0) {
263 # define PerlMemShared PerlMem
266 #ifdef PERL_DEBUG_READONLY_OPS
267 U32 count = PL_slab_count;
268 /* Need to remove this slab from our list of slabs */
271 if (PL_slabs[count] == slab) {
273 /* Found it. Move the entry at the end to overwrite it. */
274 DEBUG_m(PerlIO_printf(Perl_debug_log,
275 "Deallocate %p by moving %p from %lu to %lu\n",
277 PL_slabs[PL_slab_count - 1],
278 PL_slab_count, count));
279 PL_slabs[count] = PL_slabs[--PL_slab_count];
280 /* Could realloc smaller at this point, but probably not
282 if(munmap(slab, PERL_SLAB_SIZE*sizeof(I32*))) {
283 perror("munmap failed");
291 PerlMemShared_free(slab);
293 if (slab == PL_OpSlab) {
300 * In the following definition, the ", (OP*)0" is just to make the compiler
301 * think the expression is of the right type: croak actually does a Siglongjmp.
303 #define CHECKOP(type,o) \
304 ((PL_op_mask && PL_op_mask[type]) \
305 ? ( op_free((OP*)o), \
306 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
308 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
310 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
313 S_gv_ename(pTHX_ GV *gv)
315 SV* const tmpsv = sv_newmortal();
317 PERL_ARGS_ASSERT_GV_ENAME;
319 gv_efullname3(tmpsv, gv, NULL);
320 return SvPV_nolen_const(tmpsv);
324 S_no_fh_allowed(pTHX_ OP *o)
326 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
328 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
334 S_too_few_arguments(pTHX_ OP *o, const char *name)
336 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS;
338 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
343 S_too_many_arguments(pTHX_ OP *o, const char *name)
345 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS;
347 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
352 S_bad_type(pTHX_ I32 n, const char *t, const char *name, const OP *kid)
354 PERL_ARGS_ASSERT_BAD_TYPE;
356 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
357 (int)n, name, t, OP_DESC(kid)));
361 S_no_bareword_allowed(pTHX_ const OP *o)
363 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
366 return; /* various ok barewords are hidden in extra OP_NULL */
367 qerror(Perl_mess(aTHX_
368 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
372 /* "register" allocation */
375 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
379 const bool is_our = (PL_parser->in_my == KEY_our);
381 PERL_ARGS_ASSERT_ALLOCMY;
384 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
387 /* Until we're using the length for real, cross check that we're being
389 assert(strlen(name) == len);
391 /* complain about "my $<special_var>" etc etc */
395 (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) ||
396 (name[1] == '_' && (*name == '$' || len > 2))))
398 /* name[2] is true if strlen(name) > 2 */
399 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
400 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
401 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
402 PL_parser->in_my == KEY_state ? "state" : "my"));
404 yyerror(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
405 PL_parser->in_my == KEY_state ? "state" : "my"));
409 /* allocate a spare slot and store the name in that slot */
411 off = pad_add_name(name, len,
412 is_our ? padadd_OUR :
413 PL_parser->in_my == KEY_state ? padadd_STATE : 0,
414 PL_parser->in_my_stash,
416 /* $_ is always in main::, even with our */
417 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
421 /* anon sub prototypes contains state vars should always be cloned,
422 * otherwise the state var would be shared between anon subs */
424 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
425 CvCLONE_on(PL_compcv);
430 /* free the body of an op without examining its contents.
431 * Always use this rather than FreeOp directly */
434 S_op_destroy(pTHX_ OP *o)
436 if (o->op_latefree) {
444 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b)
446 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a)
452 Perl_op_free(pTHX_ OP *o)
459 if (o->op_latefreed) {
466 if (o->op_private & OPpREFCOUNTED) {
477 refcnt = OpREFCNT_dec(o);
480 /* Need to find and remove any pattern match ops from the list
481 we maintain for reset(). */
482 find_and_forget_pmops(o);
492 /* Call the op_free hook if it has been set. Do it now so that it's called
493 * at the right time for refcounted ops, but still before all of the kids
497 if (o->op_flags & OPf_KIDS) {
498 register OP *kid, *nextkid;
499 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
500 nextkid = kid->op_sibling; /* Get before next freeing kid */
505 #ifdef PERL_DEBUG_READONLY_OPS
509 /* COP* is not cleared by op_clear() so that we may track line
510 * numbers etc even after null() */
511 if (type == OP_NEXTSTATE || type == OP_DBSTATE
512 || (type == OP_NULL /* the COP might have been null'ed */
513 && ((OPCODE)o->op_targ == OP_NEXTSTATE
514 || (OPCODE)o->op_targ == OP_DBSTATE))) {
519 type = (OPCODE)o->op_targ;
522 if (o->op_latefree) {
528 #ifdef DEBUG_LEAKING_SCALARS
535 Perl_op_clear(pTHX_ OP *o)
540 PERL_ARGS_ASSERT_OP_CLEAR;
543 /* if (o->op_madprop && o->op_madprop->mad_next)
545 /* FIXME for MAD - if I uncomment these two lines t/op/pack.t fails with
546 "modification of a read only value" for a reason I can't fathom why.
547 It's the "" stringification of $_, where $_ was set to '' in a foreach
548 loop, but it defies simplification into a small test case.
549 However, commenting them out has caused ext/List/Util/t/weak.t to fail
552 mad_free(o->op_madprop);
558 switch (o->op_type) {
559 case OP_NULL: /* Was holding old type, if any. */
560 if (PL_madskills && o->op_targ != OP_NULL) {
561 o->op_type = (Optype)o->op_targ;
565 case OP_ENTEREVAL: /* Was holding hints. */
569 if (!(o->op_flags & OPf_REF)
570 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
576 if (! (o->op_type == OP_AELEMFAST && o->op_flags & OPf_SPECIAL)) {
577 /* not an OP_PADAV replacement */
578 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
583 /* It's possible during global destruction that the GV is freed
584 before the optree. Whilst the SvREFCNT_inc is happy to bump from
585 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0
586 will trigger an assertion failure, because the entry to sv_clear
587 checks that the scalar is not already freed. A check of for
588 !SvIS_FREED(gv) turns out to be invalid, because during global
589 destruction the reference count can be forced down to zero
590 (with SVf_BREAK set). In which case raising to 1 and then
591 dropping to 0 triggers cleanup before it should happen. I
592 *think* that this might actually be a general, systematic,
593 weakness of the whole idea of SVf_BREAK, in that code *is*
594 allowed to raise and lower references during global destruction,
595 so any *valid* code that happens to do this during global
596 destruction might well trigger premature cleanup. */
597 bool still_valid = gv && SvREFCNT(gv);
600 SvREFCNT_inc_simple_void(gv);
602 if (cPADOPo->op_padix > 0) {
603 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
604 * may still exist on the pad */
605 pad_swipe(cPADOPo->op_padix, TRUE);
606 cPADOPo->op_padix = 0;
609 SvREFCNT_dec(cSVOPo->op_sv);
610 cSVOPo->op_sv = NULL;
613 int try_downgrade = SvREFCNT(gv) == 2;
616 gv_try_downgrade(gv);
620 case OP_METHOD_NAMED:
623 SvREFCNT_dec(cSVOPo->op_sv);
624 cSVOPo->op_sv = NULL;
627 Even if op_clear does a pad_free for the target of the op,
628 pad_free doesn't actually remove the sv that exists in the pad;
629 instead it lives on. This results in that it could be reused as
630 a target later on when the pad was reallocated.
633 pad_swipe(o->op_targ,1);
642 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
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 Perl_refcounted_he_free(aTHX_ cop->cop_hints_hash);
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 */
819 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
822 S_linklist(pTHX_ OP *o)
826 PERL_ARGS_ASSERT_LINKLIST;
831 /* establish postfix order */
832 first = cUNOPo->op_first;
835 o->op_next = LINKLIST(first);
838 if (kid->op_sibling) {
839 kid->op_next = LINKLIST(kid->op_sibling);
840 kid = kid->op_sibling;
854 S_scalarkids(pTHX_ OP *o)
856 if (o && o->op_flags & OPf_KIDS) {
858 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
865 S_scalarboolean(pTHX_ OP *o)
869 PERL_ARGS_ASSERT_SCALARBOOLEAN;
871 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
872 if (ckWARN(WARN_SYNTAX)) {
873 const line_t oldline = CopLINE(PL_curcop);
875 if (PL_parser && PL_parser->copline != NOLINE)
876 CopLINE_set(PL_curcop, PL_parser->copline);
877 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
878 CopLINE_set(PL_curcop, oldline);
885 Perl_scalar(pTHX_ OP *o)
890 /* assumes no premature commitment */
891 if (!o || (PL_parser && PL_parser->error_count)
892 || (o->op_flags & OPf_WANT)
893 || o->op_type == OP_RETURN)
898 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
900 switch (o->op_type) {
902 scalar(cBINOPo->op_first);
907 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
917 if (o->op_flags & OPf_KIDS) {
918 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
924 kid = cLISTOPo->op_first;
926 while ((kid = kid->op_sibling)) {
932 PL_curcop = &PL_compiling;
937 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
943 PL_curcop = &PL_compiling;
946 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
953 Perl_scalarvoid(pTHX_ OP *o)
957 const char* useless = NULL;
961 PERL_ARGS_ASSERT_SCALARVOID;
963 /* trailing mad null ops don't count as "there" for void processing */
965 o->op_type != OP_NULL &&
967 o->op_sibling->op_type == OP_NULL)
970 for (sib = o->op_sibling;
971 sib && sib->op_type == OP_NULL;
972 sib = sib->op_sibling) ;
978 if (o->op_type == OP_NEXTSTATE
979 || o->op_type == OP_DBSTATE
980 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
981 || o->op_targ == OP_DBSTATE)))
982 PL_curcop = (COP*)o; /* for warning below */
984 /* assumes no premature commitment */
985 want = o->op_flags & OPf_WANT;
986 if ((want && want != OPf_WANT_SCALAR)
987 || (PL_parser && PL_parser->error_count)
988 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE)
993 if ((o->op_private & OPpTARGET_MY)
994 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
996 return scalar(o); /* As if inside SASSIGN */
999 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1001 switch (o->op_type) {
1003 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1007 if (o->op_flags & OPf_STACKED)
1011 if (o->op_private == 4)
1054 case OP_GETSOCKNAME:
1055 case OP_GETPEERNAME:
1060 case OP_GETPRIORITY:
1084 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1085 /* Otherwise it's "Useless use of grep iterator" */
1086 useless = OP_DESC(o);
1090 kid = cLISTOPo->op_first;
1091 if (kid && kid->op_type == OP_PUSHRE
1093 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1095 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1097 useless = OP_DESC(o);
1101 kid = cUNOPo->op_first;
1102 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1103 kid->op_type != OP_TRANS) {
1106 useless = "negative pattern binding (!~)";
1113 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1114 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1115 useless = "a variable";
1120 if (cSVOPo->op_private & OPpCONST_STRICT)
1121 no_bareword_allowed(o);
1123 if (ckWARN(WARN_VOID)) {
1125 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1126 "a constant (%"SVf")", sv));
1127 useless = SvPV_nolen(msv);
1130 useless = "a constant (undef)";
1131 if (o->op_private & OPpCONST_ARYBASE)
1133 /* don't warn on optimised away booleans, eg
1134 * use constant Foo, 5; Foo || print; */
1135 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1137 /* the constants 0 and 1 are permitted as they are
1138 conventionally used as dummies in constructs like
1139 1 while some_condition_with_side_effects; */
1140 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1142 else if (SvPOK(sv)) {
1143 /* perl4's way of mixing documentation and code
1144 (before the invention of POD) was based on a
1145 trick to mix nroff and perl code. The trick was
1146 built upon these three nroff macros being used in
1147 void context. The pink camel has the details in
1148 the script wrapman near page 319. */
1149 const char * const maybe_macro = SvPVX_const(sv);
1150 if (strnEQ(maybe_macro, "di", 2) ||
1151 strnEQ(maybe_macro, "ds", 2) ||
1152 strnEQ(maybe_macro, "ig", 2))
1157 op_null(o); /* don't execute or even remember it */
1161 o->op_type = OP_PREINC; /* pre-increment is faster */
1162 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1166 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1167 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1171 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1172 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1176 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1177 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1182 kid = cLOGOPo->op_first;
1183 if (kid->op_type == OP_NOT
1184 && (kid->op_flags & OPf_KIDS)
1186 if (o->op_type == OP_AND) {
1188 o->op_ppaddr = PL_ppaddr[OP_OR];
1190 o->op_type = OP_AND;
1191 o->op_ppaddr = PL_ppaddr[OP_AND];
1200 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1205 if (o->op_flags & OPf_STACKED)
1212 if (!(o->op_flags & OPf_KIDS))
1223 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1233 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
1238 S_listkids(pTHX_ OP *o)
1240 if (o && o->op_flags & OPf_KIDS) {
1242 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1249 Perl_list(pTHX_ OP *o)
1254 /* assumes no premature commitment */
1255 if (!o || (o->op_flags & OPf_WANT)
1256 || (PL_parser && PL_parser->error_count)
1257 || o->op_type == OP_RETURN)
1262 if ((o->op_private & OPpTARGET_MY)
1263 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1265 return o; /* As if inside SASSIGN */
1268 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1270 switch (o->op_type) {
1273 list(cBINOPo->op_first);
1278 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1286 if (!(o->op_flags & OPf_KIDS))
1288 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1289 list(cBINOPo->op_first);
1290 return gen_constant_list(o);
1297 kid = cLISTOPo->op_first;
1299 while ((kid = kid->op_sibling)) {
1300 if (kid->op_sibling)
1305 PL_curcop = &PL_compiling;
1309 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1310 if (kid->op_sibling)
1315 PL_curcop = &PL_compiling;
1322 S_scalarseq(pTHX_ OP *o)
1326 const OPCODE type = o->op_type;
1328 if (type == OP_LINESEQ || type == OP_SCOPE ||
1329 type == OP_LEAVE || type == OP_LEAVETRY)
1332 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1333 if (kid->op_sibling) {
1337 PL_curcop = &PL_compiling;
1339 o->op_flags &= ~OPf_PARENS;
1340 if (PL_hints & HINT_BLOCK_SCOPE)
1341 o->op_flags |= OPf_PARENS;
1344 o = newOP(OP_STUB, 0);
1349 S_modkids(pTHX_ OP *o, I32 type)
1351 if (o && o->op_flags & OPf_KIDS) {
1353 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1359 /* Propagate lvalue ("modifiable") context to an op and its children.
1360 * 'type' represents the context type, roughly based on the type of op that
1361 * would do the modifying, although local() is represented by OP_NULL.
1362 * It's responsible for detecting things that can't be modified, flag
1363 * things that need to behave specially in an lvalue context (e.g., "$$x = 5"
1364 * might have to vivify a reference in $x), and so on.
1366 * For example, "$a+1 = 2" would cause mod() to be called with o being
1367 * OP_ADD and type being OP_SASSIGN, and would output an error.
1371 Perl_mod(pTHX_ OP *o, I32 type)
1375 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1378 if (!o || (PL_parser && PL_parser->error_count))
1381 if ((o->op_private & OPpTARGET_MY)
1382 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1387 switch (o->op_type) {
1393 if (!(o->op_private & OPpCONST_ARYBASE))
1396 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1397 CopARYBASE_set(&PL_compiling,
1398 (I32)SvIV(cSVOPx(PL_eval_start)->op_sv));
1402 SAVECOPARYBASE(&PL_compiling);
1403 CopARYBASE_set(&PL_compiling, 0);
1405 else if (type == OP_REFGEN)
1408 Perl_croak(aTHX_ "That use of $[ is unsupported");
1411 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1415 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1416 !(o->op_flags & OPf_STACKED)) {
1417 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1418 /* The default is to set op_private to the number of children,
1419 which for a UNOP such as RV2CV is always 1. And w're using
1420 the bit for a flag in RV2CV, so we need it clear. */
1421 o->op_private &= ~1;
1422 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1423 assert(cUNOPo->op_first->op_type == OP_NULL);
1424 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1427 else if (o->op_private & OPpENTERSUB_NOMOD)
1429 else { /* lvalue subroutine call */
1430 o->op_private |= OPpLVAL_INTRO;
1431 PL_modcount = RETURN_UNLIMITED_NUMBER;
1432 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1433 /* Backward compatibility mode: */
1434 o->op_private |= OPpENTERSUB_INARGS;
1437 else { /* Compile-time error message: */
1438 OP *kid = cUNOPo->op_first;
1442 if (kid->op_type != OP_PUSHMARK) {
1443 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1445 "panic: unexpected lvalue entersub "
1446 "args: type/targ %ld:%"UVuf,
1447 (long)kid->op_type, (UV)kid->op_targ);
1448 kid = kLISTOP->op_first;
1450 while (kid->op_sibling)
1451 kid = kid->op_sibling;
1452 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1454 if (kid->op_type == OP_METHOD_NAMED
1455 || kid->op_type == OP_METHOD)
1459 NewOp(1101, newop, 1, UNOP);
1460 newop->op_type = OP_RV2CV;
1461 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1462 newop->op_first = NULL;
1463 newop->op_next = (OP*)newop;
1464 kid->op_sibling = (OP*)newop;
1465 newop->op_private |= OPpLVAL_INTRO;
1466 newop->op_private &= ~1;
1470 if (kid->op_type != OP_RV2CV)
1472 "panic: unexpected lvalue entersub "
1473 "entry via type/targ %ld:%"UVuf,
1474 (long)kid->op_type, (UV)kid->op_targ);
1475 kid->op_private |= OPpLVAL_INTRO;
1476 break; /* Postpone until runtime */
1480 kid = kUNOP->op_first;
1481 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1482 kid = kUNOP->op_first;
1483 if (kid->op_type == OP_NULL)
1485 "Unexpected constant lvalue entersub "
1486 "entry via type/targ %ld:%"UVuf,
1487 (long)kid->op_type, (UV)kid->op_targ);
1488 if (kid->op_type != OP_GV) {
1489 /* Restore RV2CV to check lvalueness */
1491 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1492 okid->op_next = kid->op_next;
1493 kid->op_next = okid;
1496 okid->op_next = NULL;
1497 okid->op_type = OP_RV2CV;
1499 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1500 okid->op_private |= OPpLVAL_INTRO;
1501 okid->op_private &= ~1;
1505 cv = GvCV(kGVOP_gv);
1515 /* grep, foreach, subcalls, refgen */
1516 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1518 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1519 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1521 : (o->op_type == OP_ENTERSUB
1522 ? "non-lvalue subroutine call"
1524 type ? PL_op_desc[type] : "local"));
1538 case OP_RIGHT_SHIFT:
1547 if (!(o->op_flags & OPf_STACKED))
1554 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1560 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1561 PL_modcount = RETURN_UNLIMITED_NUMBER;
1562 return o; /* Treat \(@foo) like ordinary list. */
1566 if (scalar_mod_type(o, type))
1568 ref(cUNOPo->op_first, o->op_type);
1572 if (type == OP_LEAVESUBLV)
1573 o->op_private |= OPpMAYBE_LVSUB;
1579 PL_modcount = RETURN_UNLIMITED_NUMBER;
1582 PL_hints |= HINT_BLOCK_SCOPE;
1583 if (type == OP_LEAVESUBLV)
1584 o->op_private |= OPpMAYBE_LVSUB;
1588 ref(cUNOPo->op_first, o->op_type);
1592 PL_hints |= HINT_BLOCK_SCOPE;
1607 PL_modcount = RETURN_UNLIMITED_NUMBER;
1608 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1609 return o; /* Treat \(@foo) like ordinary list. */
1610 if (scalar_mod_type(o, type))
1612 if (type == OP_LEAVESUBLV)
1613 o->op_private |= OPpMAYBE_LVSUB;
1617 if (!type) /* local() */
1618 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1619 PAD_COMPNAME_PV(o->op_targ));
1627 if (type != OP_SASSIGN)
1631 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1636 if (type == OP_LEAVESUBLV)
1637 o->op_private |= OPpMAYBE_LVSUB;
1639 pad_free(o->op_targ);
1640 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1641 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1642 if (o->op_flags & OPf_KIDS)
1643 mod(cBINOPo->op_first->op_sibling, type);
1648 ref(cBINOPo->op_first, o->op_type);
1649 if (type == OP_ENTERSUB &&
1650 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1651 o->op_private |= OPpLVAL_DEFER;
1652 if (type == OP_LEAVESUBLV)
1653 o->op_private |= OPpMAYBE_LVSUB;
1663 if (o->op_flags & OPf_KIDS)
1664 mod(cLISTOPo->op_last, type);
1669 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1671 else if (!(o->op_flags & OPf_KIDS))
1673 if (o->op_targ != OP_LIST) {
1674 mod(cBINOPo->op_first, type);
1680 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1685 if (type != OP_LEAVESUBLV)
1687 break; /* mod()ing was handled by ck_return() */
1690 /* [20011101.069] File test operators interpret OPf_REF to mean that
1691 their argument is a filehandle; thus \stat(".") should not set
1693 if (type == OP_REFGEN &&
1694 PL_check[o->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst))
1697 if (type != OP_LEAVESUBLV)
1698 o->op_flags |= OPf_MOD;
1700 if (type == OP_AASSIGN || type == OP_SASSIGN)
1701 o->op_flags |= OPf_SPECIAL|OPf_REF;
1702 else if (!type) { /* local() */
1705 o->op_private |= OPpLVAL_INTRO;
1706 o->op_flags &= ~OPf_SPECIAL;
1707 PL_hints |= HINT_BLOCK_SCOPE;
1712 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
1713 "Useless localization of %s", OP_DESC(o));
1716 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1717 && type != OP_LEAVESUBLV)
1718 o->op_flags |= OPf_REF;
1723 S_scalar_mod_type(const OP *o, I32 type)
1725 PERL_ARGS_ASSERT_SCALAR_MOD_TYPE;
1729 if (o->op_type == OP_RV2GV)
1753 case OP_RIGHT_SHIFT:
1773 S_is_handle_constructor(const OP *o, I32 numargs)
1775 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
1777 switch (o->op_type) {
1785 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1798 S_refkids(pTHX_ OP *o, I32 type)
1800 if (o && o->op_flags & OPf_KIDS) {
1802 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1809 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
1814 PERL_ARGS_ASSERT_DOREF;
1816 if (!o || (PL_parser && PL_parser->error_count))
1819 switch (o->op_type) {
1821 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1822 !(o->op_flags & OPf_STACKED)) {
1823 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1824 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1825 assert(cUNOPo->op_first->op_type == OP_NULL);
1826 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1827 o->op_flags |= OPf_SPECIAL;
1828 o->op_private &= ~1;
1833 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1834 doref(kid, type, set_op_ref);
1837 if (type == OP_DEFINED)
1838 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1839 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1842 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1843 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1844 : type == OP_RV2HV ? OPpDEREF_HV
1846 o->op_flags |= OPf_MOD;
1853 o->op_flags |= OPf_REF;
1856 if (type == OP_DEFINED)
1857 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1858 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1864 o->op_flags |= OPf_REF;
1869 if (!(o->op_flags & OPf_KIDS))
1871 doref(cBINOPo->op_first, type, set_op_ref);
1875 doref(cBINOPo->op_first, o->op_type, set_op_ref);
1876 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1877 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1878 : type == OP_RV2HV ? OPpDEREF_HV
1880 o->op_flags |= OPf_MOD;
1890 if (!(o->op_flags & OPf_KIDS))
1892 doref(cLISTOPo->op_last, type, set_op_ref);
1902 S_dup_attrlist(pTHX_ OP *o)
1907 PERL_ARGS_ASSERT_DUP_ATTRLIST;
1909 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1910 * where the first kid is OP_PUSHMARK and the remaining ones
1911 * are OP_CONST. We need to push the OP_CONST values.
1913 if (o->op_type == OP_CONST)
1914 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
1916 else if (o->op_type == OP_NULL)
1920 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1922 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1923 if (o->op_type == OP_CONST)
1924 rop = append_elem(OP_LIST, rop,
1925 newSVOP(OP_CONST, o->op_flags,
1926 SvREFCNT_inc_NN(cSVOPo->op_sv)));
1933 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
1938 PERL_ARGS_ASSERT_APPLY_ATTRS;
1940 /* fake up C<use attributes $pkg,$rv,@attrs> */
1941 ENTER; /* need to protect against side-effects of 'use' */
1942 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1944 #define ATTRSMODULE "attributes"
1945 #define ATTRSMODULE_PM "attributes.pm"
1948 /* Don't force the C<use> if we don't need it. */
1949 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
1950 if (svp && *svp != &PL_sv_undef)
1951 NOOP; /* already in %INC */
1953 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
1954 newSVpvs(ATTRSMODULE), NULL);
1957 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1958 newSVpvs(ATTRSMODULE),
1960 prepend_elem(OP_LIST,
1961 newSVOP(OP_CONST, 0, stashsv),
1962 prepend_elem(OP_LIST,
1963 newSVOP(OP_CONST, 0,
1965 dup_attrlist(attrs))));
1971 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
1974 OP *pack, *imop, *arg;
1977 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
1982 assert(target->op_type == OP_PADSV ||
1983 target->op_type == OP_PADHV ||
1984 target->op_type == OP_PADAV);
1986 /* Ensure that attributes.pm is loaded. */
1987 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
1989 /* Need package name for method call. */
1990 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
1992 /* Build up the real arg-list. */
1993 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1995 arg = newOP(OP_PADSV, 0);
1996 arg->op_targ = target->op_targ;
1997 arg = prepend_elem(OP_LIST,
1998 newSVOP(OP_CONST, 0, stashsv),
1999 prepend_elem(OP_LIST,
2000 newUNOP(OP_REFGEN, 0,
2001 mod(arg, OP_REFGEN)),
2002 dup_attrlist(attrs)));
2004 /* Fake up a method call to import */
2005 meth = newSVpvs_share("import");
2006 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2007 append_elem(OP_LIST,
2008 prepend_elem(OP_LIST, pack, list(arg)),
2009 newSVOP(OP_METHOD_NAMED, 0, meth)));
2010 imop->op_private |= OPpENTERSUB_NOMOD;
2012 /* Combine the ops. */
2013 *imopsp = append_elem(OP_LIST, *imopsp, imop);
2017 =notfor apidoc apply_attrs_string
2019 Attempts to apply a list of attributes specified by the C<attrstr> and
2020 C<len> arguments to the subroutine identified by the C<cv> argument which
2021 is expected to be associated with the package identified by the C<stashpv>
2022 argument (see L<attributes>). It gets this wrong, though, in that it
2023 does not correctly identify the boundaries of the individual attribute
2024 specifications within C<attrstr>. This is not really intended for the
2025 public API, but has to be listed here for systems such as AIX which
2026 need an explicit export list for symbols. (It's called from XS code
2027 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2028 to respect attribute syntax properly would be welcome.
2034 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2035 const char *attrstr, STRLEN len)
2039 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2042 len = strlen(attrstr);
2046 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2048 const char * const sstr = attrstr;
2049 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2050 attrs = append_elem(OP_LIST, attrs,
2051 newSVOP(OP_CONST, 0,
2052 newSVpvn(sstr, attrstr-sstr)));
2056 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2057 newSVpvs(ATTRSMODULE),
2058 NULL, prepend_elem(OP_LIST,
2059 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2060 prepend_elem(OP_LIST,
2061 newSVOP(OP_CONST, 0,
2062 newRV(MUTABLE_SV(cv))),
2067 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2072 PERL_ARGS_ASSERT_MY_KID;
2074 if (!o || (PL_parser && PL_parser->error_count))
2078 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2079 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2083 if (type == OP_LIST) {
2085 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2086 my_kid(kid, attrs, imopsp);
2087 } else if (type == OP_UNDEF
2093 } else if (type == OP_RV2SV || /* "our" declaration */
2095 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2096 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2097 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2099 PL_parser->in_my == KEY_our
2101 : PL_parser->in_my == KEY_state ? "state" : "my"));
2103 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2104 PL_parser->in_my = FALSE;
2105 PL_parser->in_my_stash = NULL;
2106 apply_attrs(GvSTASH(gv),
2107 (type == OP_RV2SV ? GvSV(gv) :
2108 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2109 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2112 o->op_private |= OPpOUR_INTRO;
2115 else if (type != OP_PADSV &&
2118 type != OP_PUSHMARK)
2120 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2122 PL_parser->in_my == KEY_our
2124 : PL_parser->in_my == KEY_state ? "state" : "my"));
2127 else if (attrs && type != OP_PUSHMARK) {
2130 PL_parser->in_my = FALSE;
2131 PL_parser->in_my_stash = NULL;
2133 /* check for C<my Dog $spot> when deciding package */
2134 stash = PAD_COMPNAME_TYPE(o->op_targ);
2136 stash = PL_curstash;
2137 apply_attrs_my(stash, o, attrs, imopsp);
2139 o->op_flags |= OPf_MOD;
2140 o->op_private |= OPpLVAL_INTRO;
2141 if (PL_parser->in_my == KEY_state)
2142 o->op_private |= OPpPAD_STATE;
2147 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2151 int maybe_scalar = 0;
2153 PERL_ARGS_ASSERT_MY_ATTRS;
2155 /* [perl #17376]: this appears to be premature, and results in code such as
2156 C< our(%x); > executing in list mode rather than void mode */
2158 if (o->op_flags & OPf_PARENS)
2168 o = my_kid(o, attrs, &rops);
2170 if (maybe_scalar && o->op_type == OP_PADSV) {
2171 o = scalar(append_list(OP_LIST, (LISTOP*)rops, (LISTOP*)o));
2172 o->op_private |= OPpLVAL_INTRO;
2175 o = append_list(OP_LIST, (LISTOP*)o, (LISTOP*)rops);
2177 PL_parser->in_my = FALSE;
2178 PL_parser->in_my_stash = NULL;
2183 Perl_sawparens(pTHX_ OP *o)
2185 PERL_UNUSED_CONTEXT;
2187 o->op_flags |= OPf_PARENS;
2192 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2196 const OPCODE ltype = left->op_type;
2197 const OPCODE rtype = right->op_type;
2199 PERL_ARGS_ASSERT_BIND_MATCH;
2201 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2202 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2204 const char * const desc
2205 = PL_op_desc[(rtype == OP_SUBST || rtype == OP_TRANS)
2206 ? (int)rtype : OP_MATCH];
2207 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
2208 ? "@array" : "%hash");
2209 Perl_warner(aTHX_ packWARN(WARN_MISC),
2210 "Applying %s to %s will act on scalar(%s)",
2211 desc, sample, sample);
2214 if (rtype == OP_CONST &&
2215 cSVOPx(right)->op_private & OPpCONST_BARE &&
2216 cSVOPx(right)->op_private & OPpCONST_STRICT)
2218 no_bareword_allowed(right);
2221 ismatchop = rtype == OP_MATCH ||
2222 rtype == OP_SUBST ||
2224 if (ismatchop && right->op_private & OPpTARGET_MY) {
2226 right->op_private &= ~OPpTARGET_MY;
2228 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2231 right->op_flags |= OPf_STACKED;
2232 if (rtype != OP_MATCH &&
2233 ! (rtype == OP_TRANS &&
2234 right->op_private & OPpTRANS_IDENTICAL))
2235 newleft = mod(left, rtype);
2238 if (right->op_type == OP_TRANS)
2239 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2241 o = prepend_elem(rtype, scalar(newleft), right);
2243 return newUNOP(OP_NOT, 0, scalar(o));
2247 return bind_match(type, left,
2248 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
2252 Perl_invert(pTHX_ OP *o)
2256 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2260 Perl_scope(pTHX_ OP *o)
2264 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2265 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2266 o->op_type = OP_LEAVE;
2267 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2269 else if (o->op_type == OP_LINESEQ) {
2271 o->op_type = OP_SCOPE;
2272 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2273 kid = ((LISTOP*)o)->op_first;
2274 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2277 /* The following deals with things like 'do {1 for 1}' */
2278 kid = kid->op_sibling;
2280 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2285 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2291 Perl_block_start(pTHX_ int full)
2294 const int retval = PL_savestack_ix;
2295 pad_block_start(full);
2297 PL_hints &= ~HINT_BLOCK_SCOPE;
2298 SAVECOMPILEWARNINGS();
2299 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2304 Perl_block_end(pTHX_ I32 floor, OP *seq)
2307 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2308 OP* const retval = scalarseq(seq);
2310 CopHINTS_set(&PL_compiling, PL_hints);
2312 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2321 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
2322 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2323 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2326 OP * const o = newOP(OP_PADSV, 0);
2327 o->op_targ = offset;
2333 Perl_newPROG(pTHX_ OP *o)
2337 PERL_ARGS_ASSERT_NEWPROG;
2342 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2343 ((PL_in_eval & EVAL_KEEPERR)
2344 ? OPf_SPECIAL : 0), o);
2345 PL_eval_start = linklist(PL_eval_root);
2346 PL_eval_root->op_private |= OPpREFCOUNTED;
2347 OpREFCNT_set(PL_eval_root, 1);
2348 PL_eval_root->op_next = 0;
2349 CALL_PEEP(PL_eval_start);
2352 if (o->op_type == OP_STUB) {
2353 PL_comppad_name = 0;
2355 S_op_destroy(aTHX_ o);
2358 PL_main_root = scope(sawparens(scalarvoid(o)));
2359 PL_curcop = &PL_compiling;
2360 PL_main_start = LINKLIST(PL_main_root);
2361 PL_main_root->op_private |= OPpREFCOUNTED;
2362 OpREFCNT_set(PL_main_root, 1);
2363 PL_main_root->op_next = 0;
2364 CALL_PEEP(PL_main_start);
2367 /* Register with debugger */
2369 CV * const cv = get_cvs("DB::postponed", 0);
2373 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
2375 call_sv(MUTABLE_SV(cv), G_DISCARD);
2382 Perl_localize(pTHX_ OP *o, I32 lex)
2386 PERL_ARGS_ASSERT_LOCALIZE;
2388 if (o->op_flags & OPf_PARENS)
2389 /* [perl #17376]: this appears to be premature, and results in code such as
2390 C< our(%x); > executing in list mode rather than void mode */
2397 if ( PL_parser->bufptr > PL_parser->oldbufptr
2398 && PL_parser->bufptr[-1] == ','
2399 && ckWARN(WARN_PARENTHESIS))
2401 char *s = PL_parser->bufptr;
2404 /* some heuristics to detect a potential error */
2405 while (*s && (strchr(", \t\n", *s)))
2409 if (*s && strchr("@$%*", *s) && *++s
2410 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2413 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2415 while (*s && (strchr(", \t\n", *s)))
2421 if (sigil && (*s == ';' || *s == '=')) {
2422 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2423 "Parentheses missing around \"%s\" list",
2425 ? (PL_parser->in_my == KEY_our
2427 : PL_parser->in_my == KEY_state
2437 o = mod(o, OP_NULL); /* a bit kludgey */
2438 PL_parser->in_my = FALSE;
2439 PL_parser->in_my_stash = NULL;
2444 Perl_jmaybe(pTHX_ OP *o)
2446 PERL_ARGS_ASSERT_JMAYBE;
2448 if (o->op_type == OP_LIST) {
2450 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2451 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2457 S_fold_constants(pTHX_ register OP *o)
2460 register OP * VOL curop;
2462 VOL I32 type = o->op_type;
2467 SV * const oldwarnhook = PL_warnhook;
2468 SV * const olddiehook = PL_diehook;
2472 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2474 if (PL_opargs[type] & OA_RETSCALAR)
2476 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2477 o->op_targ = pad_alloc(type, SVs_PADTMP);
2479 /* integerize op, unless it happens to be C<-foo>.
2480 * XXX should pp_i_negate() do magic string negation instead? */
2481 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2482 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2483 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2485 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2488 if (!(PL_opargs[type] & OA_FOLDCONST))
2493 /* XXX might want a ck_negate() for this */
2494 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2505 /* XXX what about the numeric ops? */
2506 if (PL_hints & HINT_LOCALE)
2511 if (PL_parser && PL_parser->error_count)
2512 goto nope; /* Don't try to run w/ errors */
2514 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2515 const OPCODE type = curop->op_type;
2516 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2518 type != OP_SCALAR &&
2520 type != OP_PUSHMARK)
2526 curop = LINKLIST(o);
2527 old_next = o->op_next;
2531 oldscope = PL_scopestack_ix;
2532 create_eval_scope(G_FAKINGEVAL);
2534 /* Verify that we don't need to save it: */
2535 assert(PL_curcop == &PL_compiling);
2536 StructCopy(&PL_compiling, ¬_compiling, COP);
2537 PL_curcop = ¬_compiling;
2538 /* The above ensures that we run with all the correct hints of the
2539 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
2540 assert(IN_PERL_RUNTIME);
2541 PL_warnhook = PERL_WARNHOOK_FATAL;
2548 sv = *(PL_stack_sp--);
2549 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2550 pad_swipe(o->op_targ, FALSE);
2551 else if (SvTEMP(sv)) { /* grab mortal temp? */
2552 SvREFCNT_inc_simple_void(sv);
2557 /* Something tried to die. Abandon constant folding. */
2558 /* Pretend the error never happened. */
2560 o->op_next = old_next;
2564 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
2565 PL_warnhook = oldwarnhook;
2566 PL_diehook = olddiehook;
2567 /* XXX note that this croak may fail as we've already blown away
2568 * the stack - eg any nested evals */
2569 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
2572 PL_warnhook = oldwarnhook;
2573 PL_diehook = olddiehook;
2574 PL_curcop = &PL_compiling;
2576 if (PL_scopestack_ix > oldscope)
2577 delete_eval_scope();
2586 if (type == OP_RV2GV)
2587 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
2589 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
2590 op_getmad(o,newop,'f');
2598 S_gen_constant_list(pTHX_ register OP *o)
2602 const I32 oldtmps_floor = PL_tmps_floor;
2605 if (PL_parser && PL_parser->error_count)
2606 return o; /* Don't attempt to run with errors */
2608 PL_op = curop = LINKLIST(o);
2614 assert (!(curop->op_flags & OPf_SPECIAL));
2615 assert(curop->op_type == OP_RANGE);
2617 PL_tmps_floor = oldtmps_floor;
2619 o->op_type = OP_RV2AV;
2620 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2621 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2622 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
2623 o->op_opt = 0; /* needs to be revisited in peep() */
2624 curop = ((UNOP*)o)->op_first;
2625 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
2627 op_getmad(curop,o,'O');
2636 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2639 if (!o || o->op_type != OP_LIST)
2640 o = newLISTOP(OP_LIST, 0, o, NULL);
2642 o->op_flags &= ~OPf_WANT;
2644 if (!(PL_opargs[type] & OA_MARK))
2645 op_null(cLISTOPo->op_first);
2647 o->op_type = (OPCODE)type;
2648 o->op_ppaddr = PL_ppaddr[type];
2649 o->op_flags |= flags;
2651 o = CHECKOP(type, o);
2652 if (o->op_type != (unsigned)type)
2655 return fold_constants(o);
2658 /* List constructors */
2661 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2669 if (first->op_type != (unsigned)type
2670 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2672 return newLISTOP(type, 0, first, last);
2675 if (first->op_flags & OPf_KIDS)
2676 ((LISTOP*)first)->op_last->op_sibling = last;
2678 first->op_flags |= OPf_KIDS;
2679 ((LISTOP*)first)->op_first = last;
2681 ((LISTOP*)first)->op_last = last;
2686 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2694 if (first->op_type != (unsigned)type)
2695 return prepend_elem(type, (OP*)first, (OP*)last);
2697 if (last->op_type != (unsigned)type)
2698 return append_elem(type, (OP*)first, (OP*)last);
2700 first->op_last->op_sibling = last->op_first;
2701 first->op_last = last->op_last;
2702 first->op_flags |= (last->op_flags & OPf_KIDS);
2705 if (last->op_first && first->op_madprop) {
2706 MADPROP *mp = last->op_first->op_madprop;
2708 while (mp->mad_next)
2710 mp->mad_next = first->op_madprop;
2713 last->op_first->op_madprop = first->op_madprop;
2716 first->op_madprop = last->op_madprop;
2717 last->op_madprop = 0;
2720 S_op_destroy(aTHX_ (OP*)last);
2726 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2734 if (last->op_type == (unsigned)type) {
2735 if (type == OP_LIST) { /* already a PUSHMARK there */
2736 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2737 ((LISTOP*)last)->op_first->op_sibling = first;
2738 if (!(first->op_flags & OPf_PARENS))
2739 last->op_flags &= ~OPf_PARENS;
2742 if (!(last->op_flags & OPf_KIDS)) {
2743 ((LISTOP*)last)->op_last = first;
2744 last->op_flags |= OPf_KIDS;
2746 first->op_sibling = ((LISTOP*)last)->op_first;
2747 ((LISTOP*)last)->op_first = first;
2749 last->op_flags |= OPf_KIDS;
2753 return newLISTOP(type, 0, first, last);
2761 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
2764 Newxz(tk, 1, TOKEN);
2765 tk->tk_type = (OPCODE)optype;
2766 tk->tk_type = 12345;
2768 tk->tk_mad = madprop;
2773 Perl_token_free(pTHX_ TOKEN* tk)
2775 PERL_ARGS_ASSERT_TOKEN_FREE;
2777 if (tk->tk_type != 12345)
2779 mad_free(tk->tk_mad);
2784 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
2789 PERL_ARGS_ASSERT_TOKEN_GETMAD;
2791 if (tk->tk_type != 12345) {
2792 Perl_warner(aTHX_ packWARN(WARN_MISC),
2793 "Invalid TOKEN object ignored");
2800 /* faked up qw list? */
2802 tm->mad_type == MAD_SV &&
2803 SvPVX((SV *)tm->mad_val)[0] == 'q')
2810 /* pretend constant fold didn't happen? */
2811 if (mp->mad_key == 'f' &&
2812 (o->op_type == OP_CONST ||
2813 o->op_type == OP_GV) )
2815 token_getmad(tk,(OP*)mp->mad_val,slot);
2829 if (mp->mad_key == 'X')
2830 mp->mad_key = slot; /* just change the first one */
2840 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
2849 /* pretend constant fold didn't happen? */
2850 if (mp->mad_key == 'f' &&
2851 (o->op_type == OP_CONST ||
2852 o->op_type == OP_GV) )
2854 op_getmad(from,(OP*)mp->mad_val,slot);
2861 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
2864 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
2870 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
2879 /* pretend constant fold didn't happen? */
2880 if (mp->mad_key == 'f' &&
2881 (o->op_type == OP_CONST ||
2882 o->op_type == OP_GV) )
2884 op_getmad(from,(OP*)mp->mad_val,slot);
2891 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
2894 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
2898 PerlIO_printf(PerlIO_stderr(),
2899 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
2905 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
2923 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
2927 addmad(tm, &(o->op_madprop), slot);
2931 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
2952 Perl_newMADsv(pTHX_ char key, SV* sv)
2954 PERL_ARGS_ASSERT_NEWMADSV;
2956 return newMADPROP(key, MAD_SV, sv, 0);
2960 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
2963 Newxz(mp, 1, MADPROP);
2966 mp->mad_vlen = vlen;
2967 mp->mad_type = type;
2969 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
2974 Perl_mad_free(pTHX_ MADPROP* mp)
2976 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
2980 mad_free(mp->mad_next);
2981 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
2982 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
2983 switch (mp->mad_type) {
2987 Safefree((char*)mp->mad_val);
2990 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
2991 op_free((OP*)mp->mad_val);
2994 sv_free(MUTABLE_SV(mp->mad_val));
2997 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3006 Perl_newNULLLIST(pTHX)
3008 return newOP(OP_STUB, 0);
3012 S_force_list(pTHX_ OP *o)
3014 if (!o || o->op_type != OP_LIST)
3015 o = newLISTOP(OP_LIST, 0, o, NULL);
3021 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3026 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3028 NewOp(1101, listop, 1, LISTOP);
3030 listop->op_type = (OPCODE)type;
3031 listop->op_ppaddr = PL_ppaddr[type];
3034 listop->op_flags = (U8)flags;
3038 else if (!first && last)
3041 first->op_sibling = last;
3042 listop->op_first = first;
3043 listop->op_last = last;
3044 if (type == OP_LIST) {
3045 OP* const pushop = newOP(OP_PUSHMARK, 0);
3046 pushop->op_sibling = first;
3047 listop->op_first = pushop;
3048 listop->op_flags |= OPf_KIDS;
3050 listop->op_last = pushop;
3053 return CHECKOP(type, listop);
3057 Perl_newOP(pTHX_ I32 type, I32 flags)
3062 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3063 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3064 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3065 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3067 NewOp(1101, o, 1, OP);
3068 o->op_type = (OPCODE)type;
3069 o->op_ppaddr = PL_ppaddr[type];
3070 o->op_flags = (U8)flags;
3072 o->op_latefreed = 0;
3076 o->op_private = (U8)(0 | (flags >> 8));
3077 if (PL_opargs[type] & OA_RETSCALAR)
3079 if (PL_opargs[type] & OA_TARGET)
3080 o->op_targ = pad_alloc(type, SVs_PADTMP);
3081 return CHECKOP(type, o);
3085 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3090 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3091 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3092 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3093 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3094 || type == OP_SASSIGN
3095 || type == OP_ENTERTRY
3096 || type == OP_NULL );
3099 first = newOP(OP_STUB, 0);
3100 if (PL_opargs[type] & OA_MARK)
3101 first = force_list(first);
3103 NewOp(1101, unop, 1, UNOP);
3104 unop->op_type = (OPCODE)type;
3105 unop->op_ppaddr = PL_ppaddr[type];
3106 unop->op_first = first;
3107 unop->op_flags = (U8)(flags | OPf_KIDS);
3108 unop->op_private = (U8)(1 | (flags >> 8));
3109 unop = (UNOP*) CHECKOP(type, unop);
3113 return fold_constants((OP *) unop);
3117 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3122 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3123 || type == OP_SASSIGN || type == OP_NULL );
3125 NewOp(1101, binop, 1, BINOP);
3128 first = newOP(OP_NULL, 0);
3130 binop->op_type = (OPCODE)type;
3131 binop->op_ppaddr = PL_ppaddr[type];
3132 binop->op_first = first;
3133 binop->op_flags = (U8)(flags | OPf_KIDS);
3136 binop->op_private = (U8)(1 | (flags >> 8));
3139 binop->op_private = (U8)(2 | (flags >> 8));
3140 first->op_sibling = last;
3143 binop = (BINOP*)CHECKOP(type, binop);
3144 if (binop->op_next || binop->op_type != (OPCODE)type)
3147 binop->op_last = binop->op_first->op_sibling;
3149 return fold_constants((OP *)binop);
3152 static int uvcompare(const void *a, const void *b)
3153 __attribute__nonnull__(1)
3154 __attribute__nonnull__(2)
3155 __attribute__pure__;
3156 static int uvcompare(const void *a, const void *b)
3158 if (*((const UV *)a) < (*(const UV *)b))
3160 if (*((const UV *)a) > (*(const UV *)b))
3162 if (*((const UV *)a+1) < (*(const UV *)b+1))
3164 if (*((const UV *)a+1) > (*(const UV *)b+1))
3170 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3173 SV * const tstr = ((SVOP*)expr)->op_sv;
3176 (repl->op_type == OP_NULL)
3177 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3179 ((SVOP*)repl)->op_sv;
3182 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3183 const U8 *r = (U8*)SvPV_const(rstr, rlen);
3187 register short *tbl;
3189 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3190 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3191 I32 del = o->op_private & OPpTRANS_DELETE;
3194 PERL_ARGS_ASSERT_PMTRANS;
3196 PL_hints |= HINT_BLOCK_SCOPE;
3199 o->op_private |= OPpTRANS_FROM_UTF;
3202 o->op_private |= OPpTRANS_TO_UTF;
3204 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
3205 SV* const listsv = newSVpvs("# comment\n");
3207 const U8* tend = t + tlen;
3208 const U8* rend = r + rlen;
3222 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3223 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
3226 const U32 flags = UTF8_ALLOW_DEFAULT;
3230 t = tsave = bytes_to_utf8(t, &len);
3233 if (!to_utf && rlen) {
3235 r = rsave = bytes_to_utf8(r, &len);
3239 /* There are several snags with this code on EBCDIC:
3240 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3241 2. scan_const() in toke.c has encoded chars in native encoding which makes
3242 ranges at least in EBCDIC 0..255 range the bottom odd.
3246 U8 tmpbuf[UTF8_MAXBYTES+1];
3249 Newx(cp, 2*tlen, UV);
3251 transv = newSVpvs("");
3253 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3255 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
3257 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3261 cp[2*i+1] = cp[2*i];
3265 qsort(cp, i, 2*sizeof(UV), uvcompare);
3266 for (j = 0; j < i; j++) {
3268 diff = val - nextmin;
3270 t = uvuni_to_utf8(tmpbuf,nextmin);
3271 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3273 U8 range_mark = UTF_TO_NATIVE(0xff);
3274 t = uvuni_to_utf8(tmpbuf, val - 1);
3275 sv_catpvn(transv, (char *)&range_mark, 1);
3276 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3283 t = uvuni_to_utf8(tmpbuf,nextmin);
3284 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3286 U8 range_mark = UTF_TO_NATIVE(0xff);
3287 sv_catpvn(transv, (char *)&range_mark, 1);
3289 t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff,
3290 UNICODE_ALLOW_SUPER);
3291 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3292 t = (const U8*)SvPVX_const(transv);
3293 tlen = SvCUR(transv);
3297 else if (!rlen && !del) {
3298 r = t; rlen = tlen; rend = tend;
3301 if ((!rlen && !del) || t == r ||
3302 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
3304 o->op_private |= OPpTRANS_IDENTICAL;
3308 while (t < tend || tfirst <= tlast) {
3309 /* see if we need more "t" chars */
3310 if (tfirst > tlast) {
3311 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3313 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
3315 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3322 /* now see if we need more "r" chars */
3323 if (rfirst > rlast) {
3325 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3327 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
3329 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3338 rfirst = rlast = 0xffffffff;
3342 /* now see which range will peter our first, if either. */
3343 tdiff = tlast - tfirst;
3344 rdiff = rlast - rfirst;
3351 if (rfirst == 0xffffffff) {
3352 diff = tdiff; /* oops, pretend rdiff is infinite */
3354 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
3355 (long)tfirst, (long)tlast);
3357 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
3361 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
3362 (long)tfirst, (long)(tfirst + diff),
3365 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
3366 (long)tfirst, (long)rfirst);
3368 if (rfirst + diff > max)
3369 max = rfirst + diff;
3371 grows = (tfirst < rfirst &&
3372 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
3384 else if (max > 0xff)
3389 PerlMemShared_free(cPVOPo->op_pv);
3390 cPVOPo->op_pv = NULL;
3392 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
3394 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
3395 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
3396 PAD_SETSV(cPADOPo->op_padix, swash);
3398 SvREADONLY_on(swash);
3400 cSVOPo->op_sv = swash;
3402 SvREFCNT_dec(listsv);
3403 SvREFCNT_dec(transv);
3405 if (!del && havefinal && rlen)
3406 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
3407 newSVuv((UV)final), 0);
3410 o->op_private |= OPpTRANS_GROWS;
3416 op_getmad(expr,o,'e');
3417 op_getmad(repl,o,'r');
3425 tbl = (short*)cPVOPo->op_pv;
3427 Zero(tbl, 256, short);
3428 for (i = 0; i < (I32)tlen; i++)
3430 for (i = 0, j = 0; i < 256; i++) {
3432 if (j >= (I32)rlen) {
3441 if (i < 128 && r[j] >= 128)
3451 o->op_private |= OPpTRANS_IDENTICAL;
3453 else if (j >= (I32)rlen)
3458 PerlMemShared_realloc(tbl,
3459 (0x101+rlen-j) * sizeof(short));
3460 cPVOPo->op_pv = (char*)tbl;
3462 tbl[0x100] = (short)(rlen - j);
3463 for (i=0; i < (I32)rlen - j; i++)
3464 tbl[0x101+i] = r[j+i];
3468 if (!rlen && !del) {
3471 o->op_private |= OPpTRANS_IDENTICAL;
3473 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
3474 o->op_private |= OPpTRANS_IDENTICAL;
3476 for (i = 0; i < 256; i++)
3478 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
3479 if (j >= (I32)rlen) {
3481 if (tbl[t[i]] == -1)
3487 if (tbl[t[i]] == -1) {
3488 if (t[i] < 128 && r[j] >= 128)
3495 if(del && rlen == tlen) {
3496 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
3497 } else if(rlen > tlen) {
3498 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
3502 o->op_private |= OPpTRANS_GROWS;
3504 op_getmad(expr,o,'e');
3505 op_getmad(repl,o,'r');
3515 Perl_newPMOP(pTHX_ I32 type, I32 flags)
3520 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
3522 NewOp(1101, pmop, 1, PMOP);
3523 pmop->op_type = (OPCODE)type;
3524 pmop->op_ppaddr = PL_ppaddr[type];
3525 pmop->op_flags = (U8)flags;
3526 pmop->op_private = (U8)(0 | (flags >> 8));
3528 if (PL_hints & HINT_RE_TAINT)
3529 pmop->op_pmflags |= PMf_RETAINT;
3530 if (PL_hints & HINT_LOCALE)
3531 pmop->op_pmflags |= PMf_LOCALE;
3535 assert(SvPOK(PL_regex_pad[0]));
3536 if (SvCUR(PL_regex_pad[0])) {
3537 /* Pop off the "packed" IV from the end. */
3538 SV *const repointer_list = PL_regex_pad[0];
3539 const char *p = SvEND(repointer_list) - sizeof(IV);
3540 const IV offset = *((IV*)p);
3542 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
3544 SvEND_set(repointer_list, p);
3546 pmop->op_pmoffset = offset;
3547 /* This slot should be free, so assert this: */
3548 assert(PL_regex_pad[offset] == &PL_sv_undef);
3550 SV * const repointer = &PL_sv_undef;
3551 av_push(PL_regex_padav, repointer);
3552 pmop->op_pmoffset = av_len(PL_regex_padav);
3553 PL_regex_pad = AvARRAY(PL_regex_padav);
3557 return CHECKOP(type, pmop);
3560 /* Given some sort of match op o, and an expression expr containing a
3561 * pattern, either compile expr into a regex and attach it to o (if it's
3562 * constant), or convert expr into a runtime regcomp op sequence (if it's
3565 * isreg indicates that the pattern is part of a regex construct, eg
3566 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
3567 * split "pattern", which aren't. In the former case, expr will be a list
3568 * if the pattern contains more than one term (eg /a$b/) or if it contains
3569 * a replacement, ie s/// or tr///.
3573 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
3578 I32 repl_has_vars = 0;
3582 PERL_ARGS_ASSERT_PMRUNTIME;
3584 if (o->op_type == OP_SUBST || o->op_type == OP_TRANS) {
3585 /* last element in list is the replacement; pop it */
3587 repl = cLISTOPx(expr)->op_last;
3588 kid = cLISTOPx(expr)->op_first;
3589 while (kid->op_sibling != repl)
3590 kid = kid->op_sibling;
3591 kid->op_sibling = NULL;
3592 cLISTOPx(expr)->op_last = kid;
3595 if (isreg && expr->op_type == OP_LIST &&
3596 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
3598 /* convert single element list to element */
3599 OP* const oe = expr;
3600 expr = cLISTOPx(oe)->op_first->op_sibling;
3601 cLISTOPx(oe)->op_first->op_sibling = NULL;
3602 cLISTOPx(oe)->op_last = NULL;
3606 if (o->op_type == OP_TRANS) {
3607 return pmtrans(o, expr, repl);
3610 reglist = isreg && expr->op_type == OP_LIST;
3614 PL_hints |= HINT_BLOCK_SCOPE;
3617 if (expr->op_type == OP_CONST) {
3618 SV *pat = ((SVOP*)expr)->op_sv;
3619 U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME;
3621 if (o->op_flags & OPf_SPECIAL)
3622 pm_flags |= RXf_SPLIT;
3625 assert (SvUTF8(pat));
3626 } else if (SvUTF8(pat)) {
3627 /* Not doing UTF-8, despite what the SV says. Is this only if we're
3628 trapped in use 'bytes'? */
3629 /* Make a copy of the octet sequence, but without the flag on, as
3630 the compiler now honours the SvUTF8 flag on pat. */
3632 const char *const p = SvPV(pat, len);
3633 pat = newSVpvn_flags(p, len, SVs_TEMP);
3636 PM_SETRE(pm, CALLREGCOMP(pat, pm_flags));
3639 op_getmad(expr,(OP*)pm,'e');
3645 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
3646 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
3648 : OP_REGCMAYBE),0,expr);
3650 NewOp(1101, rcop, 1, LOGOP);
3651 rcop->op_type = OP_REGCOMP;
3652 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
3653 rcop->op_first = scalar(expr);
3654 rcop->op_flags |= OPf_KIDS
3655 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
3656 | (reglist ? OPf_STACKED : 0);
3657 rcop->op_private = 1;
3660 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
3662 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
3665 /* establish postfix order */
3666 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
3668 rcop->op_next = expr;
3669 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
3672 rcop->op_next = LINKLIST(expr);
3673 expr->op_next = (OP*)rcop;
3676 prepend_elem(o->op_type, scalar((OP*)rcop), o);
3681 if (pm->op_pmflags & PMf_EVAL) {
3683 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
3684 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
3686 else if (repl->op_type == OP_CONST)
3690 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
3691 if (curop->op_type == OP_SCOPE
3692 || curop->op_type == OP_LEAVE
3693 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
3694 if (curop->op_type == OP_GV) {
3695 GV * const gv = cGVOPx_gv(curop);
3697 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
3700 else if (curop->op_type == OP_RV2CV)
3702 else if (curop->op_type == OP_RV2SV ||
3703 curop->op_type == OP_RV2AV ||
3704 curop->op_type == OP_RV2HV ||
3705 curop->op_type == OP_RV2GV) {
3706 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3709 else if (curop->op_type == OP_PADSV ||
3710 curop->op_type == OP_PADAV ||
3711 curop->op_type == OP_PADHV ||
3712 curop->op_type == OP_PADANY)
3716 else if (curop->op_type == OP_PUSHRE)
3717 NOOP; /* Okay here, dangerous in newASSIGNOP */
3727 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
3729 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3730 prepend_elem(o->op_type, scalar(repl), o);
3733 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
3734 pm->op_pmflags |= PMf_MAYBE_CONST;
3736 NewOp(1101, rcop, 1, LOGOP);
3737 rcop->op_type = OP_SUBSTCONT;
3738 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3739 rcop->op_first = scalar(repl);
3740 rcop->op_flags |= OPf_KIDS;
3741 rcop->op_private = 1;
3744 /* establish postfix order */
3745 rcop->op_next = LINKLIST(repl);
3746 repl->op_next = (OP*)rcop;
3748 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
3749 assert(!(pm->op_pmflags & PMf_ONCE));
3750 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
3759 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3764 PERL_ARGS_ASSERT_NEWSVOP;
3766 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
3767 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
3768 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
3770 NewOp(1101, svop, 1, SVOP);
3771 svop->op_type = (OPCODE)type;
3772 svop->op_ppaddr = PL_ppaddr[type];
3774 svop->op_next = (OP*)svop;
3775 svop->op_flags = (U8)flags;
3776 if (PL_opargs[type] & OA_RETSCALAR)
3778 if (PL_opargs[type] & OA_TARGET)
3779 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3780 return CHECKOP(type, svop);
3785 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3790 PERL_ARGS_ASSERT_NEWPADOP;
3792 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
3793 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
3794 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
3796 NewOp(1101, padop, 1, PADOP);
3797 padop->op_type = (OPCODE)type;
3798 padop->op_ppaddr = PL_ppaddr[type];
3799 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3800 SvREFCNT_dec(PAD_SVl(padop->op_padix));
3801 PAD_SETSV(padop->op_padix, sv);
3804 padop->op_next = (OP*)padop;
3805 padop->op_flags = (U8)flags;
3806 if (PL_opargs[type] & OA_RETSCALAR)
3808 if (PL_opargs[type] & OA_TARGET)
3809 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3810 return CHECKOP(type, padop);
3815 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3819 PERL_ARGS_ASSERT_NEWGVOP;
3823 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3825 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3830 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3835 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
3836 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3838 NewOp(1101, pvop, 1, PVOP);
3839 pvop->op_type = (OPCODE)type;
3840 pvop->op_ppaddr = PL_ppaddr[type];
3842 pvop->op_next = (OP*)pvop;
3843 pvop->op_flags = (U8)flags;
3844 if (PL_opargs[type] & OA_RETSCALAR)
3846 if (PL_opargs[type] & OA_TARGET)
3847 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3848 return CHECKOP(type, pvop);
3856 Perl_package(pTHX_ OP *o)
3859 SV *const sv = cSVOPo->op_sv;
3864 PERL_ARGS_ASSERT_PACKAGE;
3866 save_hptr(&PL_curstash);
3867 save_item(PL_curstname);
3869 PL_curstash = gv_stashsv(sv, GV_ADD);
3871 sv_setsv(PL_curstname, sv);
3873 PL_hints |= HINT_BLOCK_SCOPE;
3874 PL_parser->copline = NOLINE;
3875 PL_parser->expect = XSTATE;
3880 if (!PL_madskills) {
3885 pegop = newOP(OP_NULL,0);
3886 op_getmad(o,pegop,'P');
3892 Perl_package_version( pTHX_ OP *v )
3895 U32 savehints = PL_hints;
3896 PERL_ARGS_ASSERT_PACKAGE_VERSION;
3897 PL_hints &= ~HINT_STRICT_VARS;
3898 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
3899 PL_hints = savehints;
3908 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
3915 OP *pegop = newOP(OP_NULL,0);
3918 PERL_ARGS_ASSERT_UTILIZE;
3920 if (idop->op_type != OP_CONST)
3921 Perl_croak(aTHX_ "Module name must be constant");
3924 op_getmad(idop,pegop,'U');
3929 SV * const vesv = ((SVOP*)version)->op_sv;
3932 op_getmad(version,pegop,'V');
3933 if (!arg && !SvNIOKp(vesv)) {
3940 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3941 Perl_croak(aTHX_ "Version number must be a constant number");
3943 /* Make copy of idop so we don't free it twice */
3944 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3946 /* Fake up a method call to VERSION */
3947 meth = newSVpvs_share("VERSION");
3948 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3949 append_elem(OP_LIST,
3950 prepend_elem(OP_LIST, pack, list(version)),
3951 newSVOP(OP_METHOD_NAMED, 0, meth)));
3955 /* Fake up an import/unimport */
3956 if (arg && arg->op_type == OP_STUB) {
3958 op_getmad(arg,pegop,'S');
3959 imop = arg; /* no import on explicit () */
3961 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
3962 imop = NULL; /* use 5.0; */
3964 idop->op_private |= OPpCONST_NOVER;
3970 op_getmad(arg,pegop,'A');
3972 /* Make copy of idop so we don't free it twice */
3973 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3975 /* Fake up a method call to import/unimport */
3977 ? newSVpvs_share("import") : newSVpvs_share("unimport");
3978 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3979 append_elem(OP_LIST,
3980 prepend_elem(OP_LIST, pack, list(arg)),
3981 newSVOP(OP_METHOD_NAMED, 0, meth)));
3984 /* Fake up the BEGIN {}, which does its thing immediately. */
3986 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
3989 append_elem(OP_LINESEQ,
3990 append_elem(OP_LINESEQ,
3991 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
3992 newSTATEOP(0, NULL, veop)),
3993 newSTATEOP(0, NULL, imop) ));
3995 /* The "did you use incorrect case?" warning used to be here.
3996 * The problem is that on case-insensitive filesystems one
3997 * might get false positives for "use" (and "require"):
3998 * "use Strict" or "require CARP" will work. This causes
3999 * portability problems for the script: in case-strict
4000 * filesystems the script will stop working.
4002 * The "incorrect case" warning checked whether "use Foo"
4003 * imported "Foo" to your namespace, but that is wrong, too:
4004 * there is no requirement nor promise in the language that
4005 * a Foo.pm should or would contain anything in package "Foo".
4007 * There is very little Configure-wise that can be done, either:
4008 * the case-sensitivity of the build filesystem of Perl does not
4009 * help in guessing the case-sensitivity of the runtime environment.
4012 PL_hints |= HINT_BLOCK_SCOPE;
4013 PL_parser->copline = NOLINE;
4014 PL_parser->expect = XSTATE;
4015 PL_cop_seqmax++; /* Purely for B::*'s benefit */
4018 if (!PL_madskills) {
4019 /* FIXME - don't allocate pegop if !PL_madskills */
4028 =head1 Embedding Functions
4030 =for apidoc load_module
4032 Loads the module whose name is pointed to by the string part of name.
4033 Note that the actual module name, not its filename, should be given.
4034 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
4035 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
4036 (or 0 for no flags). ver, if specified, provides version semantics
4037 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
4038 arguments can be used to specify arguments to the module's import()
4039 method, similar to C<use Foo::Bar VERSION LIST>. They must be
4040 terminated with a final NULL pointer. Note that this list can only
4041 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
4042 Otherwise at least a single NULL pointer to designate the default
4043 import list is required.
4048 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
4052 PERL_ARGS_ASSERT_LOAD_MODULE;
4054 va_start(args, ver);
4055 vload_module(flags, name, ver, &args);
4059 #ifdef PERL_IMPLICIT_CONTEXT
4061 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
4065 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
4066 va_start(args, ver);
4067 vload_module(flags, name, ver, &args);
4073 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
4077 OP * const modname = newSVOP(OP_CONST, 0, name);
4079 PERL_ARGS_ASSERT_VLOAD_MODULE;
4081 modname->op_private |= OPpCONST_BARE;
4083 veop = newSVOP(OP_CONST, 0, ver);
4087 if (flags & PERL_LOADMOD_NOIMPORT) {
4088 imop = sawparens(newNULLLIST());
4090 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
4091 imop = va_arg(*args, OP*);
4096 sv = va_arg(*args, SV*);
4098 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
4099 sv = va_arg(*args, SV*);
4103 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
4104 * that it has a PL_parser to play with while doing that, and also
4105 * that it doesn't mess with any existing parser, by creating a tmp
4106 * new parser with lex_start(). This won't actually be used for much,
4107 * since pp_require() will create another parser for the real work. */
4110 SAVEVPTR(PL_curcop);
4111 lex_start(NULL, NULL, FALSE);
4112 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
4113 veop, modname, imop);
4118 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
4124 PERL_ARGS_ASSERT_DOFILE;
4126 if (!force_builtin) {
4127 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
4128 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
4129 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
4130 gv = gvp ? *gvp : NULL;
4134 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
4135 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
4136 append_elem(OP_LIST, term,
4137 scalar(newUNOP(OP_RV2CV, 0,
4138 newGVOP(OP_GV, 0, gv))))));
4141 doop = newUNOP(OP_DOFILE, 0, scalar(term));
4147 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
4149 return newBINOP(OP_LSLICE, flags,
4150 list(force_list(subscript)),
4151 list(force_list(listval)) );
4155 S_is_list_assignment(pTHX_ register const OP *o)
4163 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
4164 o = cUNOPo->op_first;
4166 flags = o->op_flags;
4168 if (type == OP_COND_EXPR) {
4169 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
4170 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
4175 yyerror("Assignment to both a list and a scalar");
4179 if (type == OP_LIST &&
4180 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
4181 o->op_private & OPpLVAL_INTRO)
4184 if (type == OP_LIST || flags & OPf_PARENS ||
4185 type == OP_RV2AV || type == OP_RV2HV ||
4186 type == OP_ASLICE || type == OP_HSLICE)
4189 if (type == OP_PADAV || type == OP_PADHV)
4192 if (type == OP_RV2SV)
4199 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
4205 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
4206 return newLOGOP(optype, 0,
4207 mod(scalar(left), optype),
4208 newUNOP(OP_SASSIGN, 0, scalar(right)));
4211 return newBINOP(optype, OPf_STACKED,
4212 mod(scalar(left), optype), scalar(right));
4216 if (is_list_assignment(left)) {
4217 static const char no_list_state[] = "Initialization of state variables"
4218 " in list context currently forbidden";
4220 bool maybe_common_vars = TRUE;
4223 /* Grandfathering $[ assignment here. Bletch.*/
4224 /* Only simple assignments like C<< ($[) = 1 >> are allowed */
4225 PL_eval_start = (left->op_type == OP_CONST) ? right : NULL;
4226 left = mod(left, OP_AASSIGN);
4229 else if (left->op_type == OP_CONST) {
4231 /* Result of assignment is always 1 (or we'd be dead already) */
4232 return newSVOP(OP_CONST, 0, newSViv(1));
4234 curop = list(force_list(left));
4235 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
4236 o->op_private = (U8)(0 | (flags >> 8));
4238 if ((left->op_type == OP_LIST
4239 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
4241 OP* lop = ((LISTOP*)left)->op_first;
4242 maybe_common_vars = FALSE;
4244 if (lop->op_type == OP_PADSV ||
4245 lop->op_type == OP_PADAV ||
4246 lop->op_type == OP_PADHV ||
4247 lop->op_type == OP_PADANY) {
4248 if (!(lop->op_private & OPpLVAL_INTRO))
4249 maybe_common_vars = TRUE;
4251 if (lop->op_private & OPpPAD_STATE) {
4252 if (left->op_private & OPpLVAL_INTRO) {
4253 /* Each variable in state($a, $b, $c) = ... */
4256 /* Each state variable in
4257 (state $a, my $b, our $c, $d, undef) = ... */
4259 yyerror(no_list_state);
4261 /* Each my variable in
4262 (state $a, my $b, our $c, $d, undef) = ... */
4264 } else if (lop->op_type == OP_UNDEF ||
4265 lop->op_type == OP_PUSHMARK) {
4266 /* undef may be interesting in
4267 (state $a, undef, state $c) */
4269 /* Other ops in the list. */
4270 maybe_common_vars = TRUE;
4272 lop = lop->op_sibling;
4275 else if ((left->op_private & OPpLVAL_INTRO)
4276 && ( left->op_type == OP_PADSV
4277 || left->op_type == OP_PADAV
4278 || left->op_type == OP_PADHV
4279 || left->op_type == OP_PADANY))
4281 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
4282 if (left->op_private & OPpPAD_STATE) {
4283 /* All single variable list context state assignments, hence
4293 yyerror(no_list_state);
4297 /* PL_generation sorcery:
4298 * an assignment like ($a,$b) = ($c,$d) is easier than
4299 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
4300 * To detect whether there are common vars, the global var
4301 * PL_generation is incremented for each assign op we compile.
4302 * Then, while compiling the assign op, we run through all the
4303 * variables on both sides of the assignment, setting a spare slot
4304 * in each of them to PL_generation. If any of them already have
4305 * that value, we know we've got commonality. We could use a
4306 * single bit marker, but then we'd have to make 2 passes, first
4307 * to clear the flag, then to test and set it. To find somewhere
4308 * to store these values, evil chicanery is done with SvUVX().
4311 if (maybe_common_vars) {
4314 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
4315 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
4316 if (curop->op_type == OP_GV) {
4317 GV *gv = cGVOPx_gv(curop);
4319 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4321 GvASSIGN_GENERATION_set(gv, PL_generation);
4323 else if (curop->op_type == OP_PADSV ||
4324 curop->op_type == OP_PADAV ||
4325 curop->op_type == OP_PADHV ||
4326 curop->op_type == OP_PADANY)
4328 if (PAD_COMPNAME_GEN(curop->op_targ)
4329 == (STRLEN)PL_generation)
4331 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
4334 else if (curop->op_type == OP_RV2CV)
4336 else if (curop->op_type == OP_RV2SV ||
4337 curop->op_type == OP_RV2AV ||
4338 curop->op_type == OP_RV2HV ||
4339 curop->op_type == OP_RV2GV) {
4340 if (lastop->op_type != OP_GV) /* funny deref? */
4343 else if (curop->op_type == OP_PUSHRE) {
4345 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
4346 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
4348 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4350 GvASSIGN_GENERATION_set(gv, PL_generation);
4354 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
4357 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4359 GvASSIGN_GENERATION_set(gv, PL_generation);
4369 o->op_private |= OPpASSIGN_COMMON;
4372 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
4373 OP* tmpop = ((LISTOP*)right)->op_first;
4374 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
4375 PMOP * const pm = (PMOP*)tmpop;
4376 if (left->op_type == OP_RV2AV &&
4377 !(left->op_private & OPpLVAL_INTRO) &&
4378 !(o->op_private & OPpASSIGN_COMMON) )
4380 tmpop = ((UNOP*)left)->op_first;
4381 if (tmpop->op_type == OP_GV
4383 && !pm->op_pmreplrootu.op_pmtargetoff
4385 && !pm->op_pmreplrootu.op_pmtargetgv
4389 pm->op_pmreplrootu.op_pmtargetoff
4390 = cPADOPx(tmpop)->op_padix;
4391 cPADOPx(tmpop)->op_padix = 0; /* steal it */
4393 pm->op_pmreplrootu.op_pmtargetgv
4394 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
4395 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
4397 pm->op_pmflags |= PMf_ONCE;
4398 tmpop = cUNOPo->op_first; /* to list (nulled) */
4399 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
4400 tmpop->op_sibling = NULL; /* don't free split */
4401 right->op_next = tmpop->op_next; /* fix starting loc */
4402 op_free(o); /* blow off assign */
4403 right->op_flags &= ~OPf_WANT;
4404 /* "I don't know and I don't care." */
4409 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
4410 ((LISTOP*)right)->op_last->op_type == OP_CONST)
4412 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
4413 if (SvIOK(sv) && SvIVX(sv) == 0)
4414 sv_setiv(sv, PL_modcount+1);
4422 right = newOP(OP_UNDEF, 0);
4423 if (right->op_type == OP_READLINE) {
4424 right->op_flags |= OPf_STACKED;
4425 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
4428 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
4429 o = newBINOP(OP_SASSIGN, flags,
4430 scalar(right), mod(scalar(left), OP_SASSIGN) );
4434 if (!PL_madskills) { /* assignment to $[ is ignored when making a mad dump */
4435 deprecate("assignment to $[");
4437 o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling)));
4438 o->op_private |= OPpCONST_ARYBASE;
4446 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
4449 const U32 seq = intro_my();
4452 NewOp(1101, cop, 1, COP);
4453 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
4454 cop->op_type = OP_DBSTATE;
4455 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
4458 cop->op_type = OP_NEXTSTATE;
4459 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
4461 cop->op_flags = (U8)flags;
4462 CopHINTS_set(cop, PL_hints);
4464 cop->op_private |= NATIVE_HINTS;
4466 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
4467 cop->op_next = (OP*)cop;
4470 /* CopARYBASE is now "virtual", in that it's stored as a flag bit in
4471 CopHINTS and a possible value in cop_hints_hash, so no need to copy it.
4473 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
4474 cop->cop_hints_hash = PL_curcop->cop_hints_hash;
4475 if (cop->cop_hints_hash) {
4477 cop->cop_hints_hash->refcounted_he_refcnt++;
4478 HINTS_REFCNT_UNLOCK;
4482 = Perl_store_cop_label(aTHX_ cop->cop_hints_hash, label);
4484 PL_hints |= HINT_BLOCK_SCOPE;
4485 /* It seems that we need to defer freeing this pointer, as other parts
4486 of the grammar end up wanting to copy it after this op has been
4491 if (PL_parser && PL_parser->copline == NOLINE)
4492 CopLINE_set(cop, CopLINE(PL_curcop));
4494 CopLINE_set(cop, PL_parser->copline);
4496 PL_parser->copline = NOLINE;
4499 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
4501 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
4503 CopSTASH_set(cop, PL_curstash);
4505 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
4506 /* this line can have a breakpoint - store the cop in IV */
4507 AV *av = CopFILEAVx(PL_curcop);
4509 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
4510 if (svp && *svp != &PL_sv_undef ) {
4511 (void)SvIOK_on(*svp);
4512 SvIV_set(*svp, PTR2IV(cop));
4517 if (flags & OPf_SPECIAL)
4519 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
4524 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
4528 PERL_ARGS_ASSERT_NEWLOGOP;
4530 return new_logop(type, flags, &first, &other);
4534 S_search_const(pTHX_ OP *o)
4536 PERL_ARGS_ASSERT_SEARCH_CONST;
4538 switch (o->op_type) {
4542 if (o->op_flags & OPf_KIDS)
4543 return search_const(cUNOPo->op_first);
4550 if (!(o->op_flags & OPf_KIDS))
4552 kid = cLISTOPo->op_first;
4554 switch (kid->op_type) {
4558 kid = kid->op_sibling;
4561 if (kid != cLISTOPo->op_last)
4567 kid = cLISTOPo->op_last;
4569 return search_const(kid);
4577 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
4585 int prepend_not = 0;
4587 PERL_ARGS_ASSERT_NEW_LOGOP;
4592 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
4593 return newBINOP(type, flags, scalar(first), scalar(other));
4595 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
4597 scalarboolean(first);
4598 /* optimize AND and OR ops that have NOTs as children */
4599 if (first->op_type == OP_NOT
4600 && (first->op_flags & OPf_KIDS)
4601 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
4602 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
4604 if (type == OP_AND || type == OP_OR) {
4610 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
4612 prepend_not = 1; /* prepend a NOT op later */
4616 /* search for a constant op that could let us fold the test */
4617 if ((cstop = search_const(first))) {
4618 if (cstop->op_private & OPpCONST_STRICT)
4619 no_bareword_allowed(cstop);
4620 else if ((cstop->op_private & OPpCONST_BARE))
4621 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
4622 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
4623 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
4624 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
4626 if (other->op_type == OP_CONST)
4627 other->op_private |= OPpCONST_SHORTCIRCUIT;
4629 OP *newop = newUNOP(OP_NULL, 0, other);
4630 op_getmad(first, newop, '1');
4631 newop->op_targ = type; /* set "was" field */
4635 if (other->op_type == OP_LEAVE)
4636 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
4640 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
4641 const OP *o2 = other;
4642 if ( ! (o2->op_type == OP_LIST
4643 && (( o2 = cUNOPx(o2)->op_first))
4644 && o2->op_type == OP_PUSHMARK
4645 && (( o2 = o2->op_sibling)) )
4648 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
4649 || o2->op_type == OP_PADHV)
4650 && o2->op_private & OPpLVAL_INTRO
4651 && !(o2->op_private & OPpPAD_STATE))
4653 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
4654 "Deprecated use of my() in false conditional");
4658 if (first->op_type == OP_CONST)
4659 first->op_private |= OPpCONST_SHORTCIRCUIT;
4661 first = newUNOP(OP_NULL, 0, first);
4662 op_getmad(other, first, '2');
4663 first->op_targ = type; /* set "was" field */
4670 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
4671 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
4673 const OP * const k1 = ((UNOP*)first)->op_first;
4674 const OP * const k2 = k1->op_sibling;
4676 switch (first->op_type)
4679 if (k2 && k2->op_type == OP_READLINE
4680 && (k2->op_flags & OPf_STACKED)
4681 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4683 warnop = k2->op_type;
4688 if (k1->op_type == OP_READDIR
4689 || k1->op_type == OP_GLOB
4690 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4691 || k1->op_type == OP_EACH)
4693 warnop = ((k1->op_type == OP_NULL)
4694 ? (OPCODE)k1->op_targ : k1->op_type);
4699 const line_t oldline = CopLINE(PL_curcop);
4700 CopLINE_set(PL_curcop, PL_parser->copline);
4701 Perl_warner(aTHX_ packWARN(WARN_MISC),
4702 "Value of %s%s can be \"0\"; test with defined()",
4704 ((warnop == OP_READLINE || warnop == OP_GLOB)
4705 ? " construct" : "() operator"));
4706 CopLINE_set(PL_curcop, oldline);
4713 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
4714 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
4716 NewOp(1101, logop, 1, LOGOP);
4718 logop->op_type = (OPCODE)type;
4719 logop->op_ppaddr = PL_ppaddr[type];
4720 logop->op_first = first;
4721 logop->op_flags = (U8)(flags | OPf_KIDS);
4722 logop->op_other = LINKLIST(other);
4723 logop->op_private = (U8)(1 | (flags >> 8));
4725 /* establish postfix order */
4726 logop->op_next = LINKLIST(first);
4727 first->op_next = (OP*)logop;
4728 first->op_sibling = other;
4730 CHECKOP(type,logop);
4732 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
4739 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
4747 PERL_ARGS_ASSERT_NEWCONDOP;
4750 return newLOGOP(OP_AND, 0, first, trueop);
4752 return newLOGOP(OP_OR, 0, first, falseop);
4754 scalarboolean(first);
4755 if ((cstop = search_const(first))) {
4756 /* Left or right arm of the conditional? */
4757 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
4758 OP *live = left ? trueop : falseop;
4759 OP *const dead = left ? falseop : trueop;
4760 if (cstop->op_private & OPpCONST_BARE &&
4761 cstop->op_private & OPpCONST_STRICT) {
4762 no_bareword_allowed(cstop);
4765 /* This is all dead code when PERL_MAD is not defined. */
4766 live = newUNOP(OP_NULL, 0, live);
4767 op_getmad(first, live, 'C');
4768 op_getmad(dead, live, left ? 'e' : 't');
4773 if (live->op_type == OP_LEAVE)
4774 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
4777 NewOp(1101, logop, 1, LOGOP);
4778 logop->op_type = OP_COND_EXPR;
4779 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
4780 logop->op_first = first;
4781 logop->op_flags = (U8)(flags | OPf_KIDS);
4782 logop->op_private = (U8)(1 | (flags >> 8));
4783 logop->op_other = LINKLIST(trueop);
4784 logop->op_next = LINKLIST(falseop);
4786 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
4789 /* establish postfix order */
4790 start = LINKLIST(first);
4791 first->op_next = (OP*)logop;
4793 first->op_sibling = trueop;
4794 trueop->op_sibling = falseop;
4795 o = newUNOP(OP_NULL, 0, (OP*)logop);
4797 trueop->op_next = falseop->op_next = o;
4804 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
4813 PERL_ARGS_ASSERT_NEWRANGE;
4815 NewOp(1101, range, 1, LOGOP);
4817 range->op_type = OP_RANGE;
4818 range->op_ppaddr = PL_ppaddr[OP_RANGE];
4819 range->op_first = left;
4820 range->op_flags = OPf_KIDS;
4821 leftstart = LINKLIST(left);
4822 range->op_other = LINKLIST(right);
4823 range->op_private = (U8)(1 | (flags >> 8));
4825 left->op_sibling = right;
4827 range->op_next = (OP*)range;
4828 flip = newUNOP(OP_FLIP, flags, (OP*)range);
4829 flop = newUNOP(OP_FLOP, 0, flip);
4830 o = newUNOP(OP_NULL, 0, flop);
4832 range->op_next = leftstart;
4834 left->op_next = flip;
4835 right->op_next = flop;
4837 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4838 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
4839 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4840 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
4842 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4843 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4846 if (!flip->op_private || !flop->op_private)
4847 linklist(o); /* blow off optimizer unless constant */
4853 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
4858 const bool once = block && block->op_flags & OPf_SPECIAL &&
4859 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
4861 PERL_UNUSED_ARG(debuggable);
4864 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
4865 return block; /* do {} while 0 does once */
4866 if (expr->op_type == OP_READLINE
4867 || expr->op_type == OP_READDIR
4868 || expr->op_type == OP_GLOB
4869 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4870 expr = newUNOP(OP_DEFINED, 0,
4871 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4872 } else if (expr->op_flags & OPf_KIDS) {
4873 const OP * const k1 = ((UNOP*)expr)->op_first;
4874 const OP * const k2 = k1 ? k1->op_sibling : NULL;
4875 switch (expr->op_type) {
4877 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
4878 && (k2->op_flags & OPf_STACKED)
4879 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4880 expr = newUNOP(OP_DEFINED, 0, expr);
4884 if (k1 && (k1->op_type == OP_READDIR
4885 || k1->op_type == OP_GLOB
4886 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4887 || k1->op_type == OP_EACH))
4888 expr = newUNOP(OP_DEFINED, 0, expr);
4894 /* if block is null, the next append_elem() would put UNSTACK, a scalar
4895 * op, in listop. This is wrong. [perl #27024] */
4897 block = newOP(OP_NULL, 0);
4898 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
4899 o = new_logop(OP_AND, 0, &expr, &listop);
4902 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
4904 if (once && o != listop)
4905 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
4908 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
4910 o->op_flags |= flags;
4912 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
4917 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32
4918 whileline, OP *expr, OP *block, OP *cont, I32 has_my)
4927 PERL_UNUSED_ARG(debuggable);
4930 if (expr->op_type == OP_READLINE
4931 || expr->op_type == OP_READDIR
4932 || expr->op_type == OP_GLOB
4933 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4934 expr = newUNOP(OP_DEFINED, 0,
4935 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4936 } else if (expr->op_flags & OPf_KIDS) {
4937 const OP * const k1 = ((UNOP*)expr)->op_first;
4938 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
4939 switch (expr->op_type) {
4941 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
4942 && (k2->op_flags & OPf_STACKED)
4943 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4944 expr = newUNOP(OP_DEFINED, 0, expr);
4948 if (k1 && (k1->op_type == OP_READDIR
4949 || k1->op_type == OP_GLOB
4950 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4951 || k1->op_type == OP_EACH))
4952 expr = newUNOP(OP_DEFINED, 0, expr);
4959 block = newOP(OP_NULL, 0);
4960 else if (cont || has_my) {
4961 block = scope(block);
4965 next = LINKLIST(cont);
4968 OP * const unstack = newOP(OP_UNSTACK, 0);
4971 cont = append_elem(OP_LINESEQ, cont, unstack);
4975 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
4977 redo = LINKLIST(listop);
4980 PL_parser->copline = (line_t)whileline;
4982 o = new_logop(OP_AND, 0, &expr, &listop);
4983 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
4984 op_free(expr); /* oops, it's a while (0) */
4986 return NULL; /* listop already freed by new_logop */
4989 ((LISTOP*)listop)->op_last->op_next =
4990 (o == listop ? redo : LINKLIST(o));
4996 NewOp(1101,loop,1,LOOP);
4997 loop->op_type = OP_ENTERLOOP;
4998 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
4999 loop->op_private = 0;
5000 loop->op_next = (OP*)loop;
5003 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
5005 loop->op_redoop = redo;
5006 loop->op_lastop = o;
5007 o->op_private |= loopflags;
5010 loop->op_nextop = next;
5012 loop->op_nextop = o;
5014 o->op_flags |= flags;
5015 o->op_private |= (flags >> 8);
5020 Perl_newFOROP(pTHX_ I32 flags, char *label, line_t forline, OP *sv, OP *expr, OP *block, OP *cont)
5025 PADOFFSET padoff = 0;
5030 PERL_ARGS_ASSERT_NEWFOROP;
5033 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
5034 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
5035 sv->op_type = OP_RV2GV;
5036 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
5038 /* The op_type check is needed to prevent a possible segfault
5039 * if the loop variable is undeclared and 'strict vars' is in
5040 * effect. This is illegal but is nonetheless parsed, so we
5041 * may reach this point with an OP_CONST where we're expecting
5044 if (cUNOPx(sv)->op_first->op_type == OP_GV
5045 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
5046 iterpflags |= OPpITER_DEF;
5048 else if (sv->op_type == OP_PADSV) { /* private variable */
5049 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
5050 padoff = sv->op_targ;
5060 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
5062 SV *const namesv = PAD_COMPNAME_SV(padoff);
5064 const char *const name = SvPV_const(namesv, len);
5066 if (len == 2 && name[0] == '$' && name[1] == '_')
5067 iterpflags |= OPpITER_DEF;
5071 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
5072 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
5073 sv = newGVOP(OP_GV, 0, PL_defgv);
5078 iterpflags |= OPpITER_DEF;
5080 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
5081 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
5082 iterflags |= OPf_STACKED;
5084 else if (expr->op_type == OP_NULL &&
5085 (expr->op_flags & OPf_KIDS) &&
5086 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
5088 /* Basically turn for($x..$y) into the same as for($x,$y), but we
5089 * set the STACKED flag to indicate that these values are to be
5090 * treated as min/max values by 'pp_iterinit'.
5092 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
5093 LOGOP* const range = (LOGOP*) flip->op_first;
5094 OP* const left = range->op_first;
5095 OP* const right = left->op_sibling;
5098 range->op_flags &= ~OPf_KIDS;
5099 range->op_first = NULL;
5101 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
5102 listop->op_first->op_next = range->op_next;
5103 left->op_next = range->op_other;
5104 right->op_next = (OP*)listop;
5105 listop->op_next = listop->op_first;
5108 op_getmad(expr,(OP*)listop,'O');
5112 expr = (OP*)(listop);
5114 iterflags |= OPf_STACKED;
5117 expr = mod(force_list(expr), OP_GREPSTART);
5120 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
5121 append_elem(OP_LIST, expr, scalar(sv))));
5122 assert(!loop->op_next);
5123 /* for my $x () sets OPpLVAL_INTRO;
5124 * for our $x () sets OPpOUR_INTRO */
5125 loop->op_private = (U8)iterpflags;
5126 #ifdef PL_OP_SLAB_ALLOC
5129 NewOp(1234,tmp,1,LOOP);
5130 Copy(loop,tmp,1,LISTOP);
5131 S_op_destroy(aTHX_ (OP*)loop);
5135 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
5137 loop->op_targ = padoff;
5138 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont, 0);
5140 op_getmad(madsv, (OP*)loop, 'v');
5141 PL_parser->copline = forline;
5142 return newSTATEOP(0, label, wop);
5146 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
5151 PERL_ARGS_ASSERT_NEWLOOPEX;
5153 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
5155 if (type != OP_GOTO || label->op_type == OP_CONST) {
5156 /* "last()" means "last" */
5157 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
5158 o = newOP(type, OPf_SPECIAL);
5160 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
5161 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
5165 op_getmad(label,o,'L');
5171 /* Check whether it's going to be a goto &function */
5172 if (label->op_type == OP_ENTERSUB
5173 && !(label->op_flags & OPf_STACKED))
5174 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
5175 o = newUNOP(type, OPf_STACKED, label);
5177 PL_hints |= HINT_BLOCK_SCOPE;
5181 /* if the condition is a literal array or hash
5182 (or @{ ... } etc), make a reference to it.
5185 S_ref_array_or_hash(pTHX_ OP *cond)
5188 && (cond->op_type == OP_RV2AV
5189 || cond->op_type == OP_PADAV
5190 || cond->op_type == OP_RV2HV
5191 || cond->op_type == OP_PADHV))
5193 return newUNOP(OP_REFGEN,
5194 0, mod(cond, OP_REFGEN));
5200 /* These construct the optree fragments representing given()
5203 entergiven and enterwhen are LOGOPs; the op_other pointer
5204 points up to the associated leave op. We need this so we
5205 can put it in the context and make break/continue work.
5206 (Also, of course, pp_enterwhen will jump straight to
5207 op_other if the match fails.)
5211 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
5212 I32 enter_opcode, I32 leave_opcode,
5213 PADOFFSET entertarg)
5219 PERL_ARGS_ASSERT_NEWGIVWHENOP;
5221 NewOp(1101, enterop, 1, LOGOP);
5222 enterop->op_type = (Optype)enter_opcode;
5223 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
5224 enterop->op_flags = (U8) OPf_KIDS;
5225 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
5226 enterop->op_private = 0;
5228 o = newUNOP(leave_opcode, 0, (OP *) enterop);
5231 enterop->op_first = scalar(cond);
5232 cond->op_sibling = block;
5234 o->op_next = LINKLIST(cond);
5235 cond->op_next = (OP *) enterop;
5238 /* This is a default {} block */
5239 enterop->op_first = block;
5240 enterop->op_flags |= OPf_SPECIAL;
5242 o->op_next = (OP *) enterop;
5245 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
5246 entergiven and enterwhen both
5249 enterop->op_next = LINKLIST(block);
5250 block->op_next = enterop->op_other = o;
5255 /* Does this look like a boolean operation? For these purposes
5256 a boolean operation is:
5257 - a subroutine call [*]
5258 - a logical connective
5259 - a comparison operator
5260 - a filetest operator, with the exception of -s -M -A -C
5261 - defined(), exists() or eof()
5262 - /$re/ or $foo =~ /$re/
5264 [*] possibly surprising
5267 S_looks_like_bool(pTHX_ const OP *o)
5271 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
5273 switch(o->op_type) {
5276 return looks_like_bool(cLOGOPo->op_first);
5280 looks_like_bool(cLOGOPo->op_first)
5281 && looks_like_bool(cLOGOPo->op_first->op_sibling));
5285 o->op_flags & OPf_KIDS
5286 && looks_like_bool(cUNOPo->op_first));
5289 return looks_like_bool(cUNOPo->op_first);
5294 case OP_NOT: case OP_XOR:
5296 case OP_EQ: case OP_NE: case OP_LT:
5297 case OP_GT: case OP_LE: case OP_GE:
5299 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
5300 case OP_I_GT: case OP_I_LE: case OP_I_GE:
5302 case OP_SEQ: case OP_SNE: case OP_SLT:
5303 case OP_SGT: case OP_SLE: case OP_SGE:
5307 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
5308 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
5309 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
5310 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
5311 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
5312 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
5313 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
5314 case OP_FTTEXT: case OP_FTBINARY:
5316 case OP_DEFINED: case OP_EXISTS:
5317 case OP_MATCH: case OP_EOF:
5324 /* Detect comparisons that have been optimized away */
5325 if (cSVOPo->op_sv == &PL_sv_yes
5326 || cSVOPo->op_sv == &PL_sv_no)
5339 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
5342 PERL_ARGS_ASSERT_NEWGIVENOP;
5343 return newGIVWHENOP(
5344 ref_array_or_hash(cond),
5346 OP_ENTERGIVEN, OP_LEAVEGIVEN,
5350 /* If cond is null, this is a default {} block */
5352 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
5354 const bool cond_llb = (!cond || looks_like_bool(cond));
5357 PERL_ARGS_ASSERT_NEWWHENOP;
5362 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
5364 scalar(ref_array_or_hash(cond)));
5367 return newGIVWHENOP(
5369 append_elem(block->op_type, block, newOP(OP_BREAK, OPf_SPECIAL)),
5370 OP_ENTERWHEN, OP_LEAVEWHEN, 0);
5374 =for apidoc cv_undef
5376 Clear out all the active components of a CV. This can happen either
5377 by an explicit C<undef &foo>, or by the reference count going to zero.
5378 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
5379 children can still follow the full lexical scope chain.
5385 Perl_cv_undef(pTHX_ CV *cv)
5389 PERL_ARGS_ASSERT_CV_UNDEF;
5391 DEBUG_X(PerlIO_printf(Perl_debug_log,
5392 "CV undef: cv=0x%"UVxf" comppad=0x%"UVxf"\n",
5393 PTR2UV(cv), PTR2UV(PL_comppad))
5397 if (CvFILE(cv) && !CvISXSUB(cv)) {
5398 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
5399 Safefree(CvFILE(cv));
5404 if (!CvISXSUB(cv) && CvROOT(cv)) {
5405 if (SvTYPE(cv) == SVt_PVCV && CvDEPTH(cv))
5406 Perl_croak(aTHX_ "Can't undef active subroutine");
5409 PAD_SAVE_SETNULLPAD();
5411 op_free(CvROOT(cv));
5416 SvPOK_off(MUTABLE_SV(cv)); /* forget prototype */
5421 /* remove CvOUTSIDE unless this is an undef rather than a free */
5422 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
5423 if (!CvWEAKOUTSIDE(cv))
5424 SvREFCNT_dec(CvOUTSIDE(cv));
5425 CvOUTSIDE(cv) = NULL;
5428 SvREFCNT_dec(MUTABLE_SV(CvXSUBANY(cv).any_ptr));
5431 if (CvISXSUB(cv) && CvXSUB(cv)) {
5434 /* delete all flags except WEAKOUTSIDE */
5435 CvFLAGS(cv) &= CVf_WEAKOUTSIDE;
5439 Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p,
5442 PERL_ARGS_ASSERT_CV_CKPROTO_LEN;
5444 /* Can't just use a strcmp on the prototype, as CONSTSUBs "cheat" by
5445 relying on SvCUR, and doubling up the buffer to hold CvFILE(). */
5446 if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */
5447 || (p && (len != SvCUR(cv) /* Not the same length. */
5448 || memNE(p, SvPVX_const(cv), len))))
5449 && ckWARN_d(WARN_PROTOTYPE)) {
5450 SV* const msg = sv_newmortal();
5454 gv_efullname3(name = sv_newmortal(), gv, NULL);
5455 sv_setpvs(msg, "Prototype mismatch:");
5457 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
5459 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv));
5461 sv_catpvs(msg, ": none");
5462 sv_catpvs(msg, " vs ");
5464 Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p);
5466 sv_catpvs(msg, "none");
5467 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
5471 static void const_sv_xsub(pTHX_ CV* cv);
5475 =head1 Optree Manipulation Functions
5477 =for apidoc cv_const_sv
5479 If C<cv> is a constant sub eligible for inlining. returns the constant
5480 value returned by the sub. Otherwise, returns NULL.
5482 Constant subs can be created with C<newCONSTSUB> or as described in
5483 L<perlsub/"Constant Functions">.
5488 Perl_cv_const_sv(pTHX_ const CV *const cv)
5490 PERL_UNUSED_CONTEXT;
5493 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
5495 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
5498 /* op_const_sv: examine an optree to determine whether it's in-lineable.
5499 * Can be called in 3 ways:
5502 * look for a single OP_CONST with attached value: return the value
5504 * cv && CvCLONE(cv) && !CvCONST(cv)
5506 * examine the clone prototype, and if contains only a single
5507 * OP_CONST referencing a pad const, or a single PADSV referencing
5508 * an outer lexical, return a non-zero value to indicate the CV is
5509 * a candidate for "constizing" at clone time
5513 * We have just cloned an anon prototype that was marked as a const
5514 * candidiate. Try to grab the current value, and in the case of
5515 * PADSV, ignore it if it has multiple references. Return the value.
5519 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
5530 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
5531 o = cLISTOPo->op_first->op_sibling;
5533 for (; o; o = o->op_next) {
5534 const OPCODE type = o->op_type;
5536 if (sv && o->op_next == o)
5538 if (o->op_next != o) {
5539 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
5541 if (type == OP_DBSTATE)
5544 if (type == OP_LEAVESUB || type == OP_RETURN)
5548 if (type == OP_CONST && cSVOPo->op_sv)
5550 else if (cv && type == OP_CONST) {
5551 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5555 else if (cv && type == OP_PADSV) {
5556 if (CvCONST(cv)) { /* newly cloned anon */
5557 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5558 /* the candidate should have 1 ref from this pad and 1 ref
5559 * from the parent */
5560 if (!sv || SvREFCNT(sv) != 2)
5567 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
5568 sv = &PL_sv_undef; /* an arbitrary non-null value */
5583 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5586 /* This would be the return value, but the return cannot be reached. */
5587 OP* pegop = newOP(OP_NULL, 0);
5590 PERL_UNUSED_ARG(floor);
5600 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
5602 NORETURN_FUNCTION_END;
5607 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
5609 return Perl_newATTRSUB(aTHX_ floor, o, proto, NULL, block);
5613 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5619 register CV *cv = NULL;
5621 /* If the subroutine has no body, no attributes, and no builtin attributes
5622 then it's just a sub declaration, and we may be able to get away with
5623 storing with a placeholder scalar in the symbol table, rather than a
5624 full GV and CV. If anything is present then it will take a full CV to
5626 const I32 gv_fetch_flags
5627 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5629 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
5630 const char * const name = o ? SvPV_nolen_const(cSVOPo->op_sv) : NULL;
5634 assert(proto->op_type == OP_CONST);
5635 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
5641 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
5643 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
5644 SV * const sv = sv_newmortal();
5645 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
5646 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
5647 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
5648 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
5650 } else if (PL_curstash) {
5651 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
5654 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
5658 if (!PL_madskills) {
5667 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
5668 maximum a prototype before. */
5669 if (SvTYPE(gv) > SVt_NULL) {
5670 if (!SvPOK((const SV *)gv)
5671 && !(SvIOK((const SV *)gv) && SvIVX((const SV *)gv) == -1))
5673 Perl_ck_warner_d(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
5675 cv_ckproto_len((const CV *)gv, NULL, ps, ps_len);
5678 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
5680 sv_setiv(MUTABLE_SV(gv), -1);
5682 SvREFCNT_dec(PL_compcv);
5683 cv = PL_compcv = NULL;
5687 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
5689 if (!block || !ps || *ps || attrs
5690 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5692 || block->op_type == OP_NULL
5697 const_sv = op_const_sv(block, NULL);
5700 const bool exists = CvROOT(cv) || CvXSUB(cv);
5702 /* if the subroutine doesn't exist and wasn't pre-declared
5703 * with a prototype, assume it will be AUTOLOADed,
5704 * skipping the prototype check
5706 if (exists || SvPOK(cv))
5707 cv_ckproto_len(cv, gv, ps, ps_len);
5708 /* already defined (or promised)? */
5709 if (exists || GvASSUMECV(gv)) {
5712 || block->op_type == OP_NULL
5715 if (CvFLAGS(PL_compcv)) {
5716 /* might have had built-in attrs applied */
5717 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv))
5718 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
5719 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS & ~CVf_LVALUE);
5721 /* just a "sub foo;" when &foo is already defined */
5722 SAVEFREESV(PL_compcv);
5727 && block->op_type != OP_NULL
5730 if (ckWARN(WARN_REDEFINE)
5732 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
5734 const line_t oldline = CopLINE(PL_curcop);
5735 if (PL_parser && PL_parser->copline != NOLINE)
5736 CopLINE_set(PL_curcop, PL_parser->copline);
5737 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5738 CvCONST(cv) ? "Constant subroutine %s redefined"
5739 : "Subroutine %s redefined", name);
5740 CopLINE_set(PL_curcop, oldline);
5743 if (!PL_minus_c) /* keep old one around for madskills */
5746 /* (PL_madskills unset in used file.) */
5754 SvREFCNT_inc_simple_void_NN(const_sv);
5756 assert(!CvROOT(cv) && !CvCONST(cv));
5757 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
5758 CvXSUBANY(cv).any_ptr = const_sv;
5759 CvXSUB(cv) = const_sv_xsub;
5765 cv = newCONSTSUB(NULL, name, const_sv);
5767 mro_method_changed_in( /* sub Foo::Bar () { 123 } */
5768 (CvGV(cv) && GvSTASH(CvGV(cv)))
5777 SvREFCNT_dec(PL_compcv);
5781 if (cv) { /* must reuse cv if autoloaded */
5782 /* transfer PL_compcv to cv */
5785 && block->op_type != OP_NULL
5789 CvFLAGS(cv) = CvFLAGS(PL_compcv);
5790 if (!CvWEAKOUTSIDE(cv))
5791 SvREFCNT_dec(CvOUTSIDE(cv));
5792 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
5793 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
5794 CvOUTSIDE(PL_compcv) = 0;
5795 CvPADLIST(cv) = CvPADLIST(PL_compcv);
5796 CvPADLIST(PL_compcv) = 0;
5797 /* inner references to PL_compcv must be fixed up ... */
5798 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
5799 if (PERLDB_INTER)/* Advice debugger on the new sub. */
5800 ++PL_sub_generation;
5803 /* Might have had built-in attributes applied -- propagate them. */
5804 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5806 /* ... before we throw it away */
5807 SvREFCNT_dec(PL_compcv);
5815 if (strEQ(name, "import")) {
5816 PL_formfeed = MUTABLE_SV(cv);
5817 /* diag_listed_as: SKIPME */
5818 Perl_warner(aTHX_ packWARN(WARN_VOID), "0x%"UVxf"\n", PTR2UV(cv));
5822 mro_method_changed_in(GvSTASH(gv)); /* sub Foo::bar { (shift)+1 } */
5827 CvFILE_set_from_cop(cv, PL_curcop);
5828 CvSTASH(cv) = PL_curstash;
5831 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
5832 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
5833 apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE);
5837 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
5839 if (PL_parser && PL_parser->error_count) {
5843 const char *s = strrchr(name, ':');
5845 if (strEQ(s, "BEGIN")) {
5846 const char not_safe[] =
5847 "BEGIN not safe after errors--compilation aborted";
5848 if (PL_in_eval & EVAL_KEEPERR)
5849 Perl_croak(aTHX_ not_safe);
5851 /* force display of errors found but not reported */
5852 sv_catpv(ERRSV, not_safe);
5853 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
5862 /* If we assign an optree to a PVCV, then we've defined a subroutine that
5863 the debugger could be able to set a breakpoint in, so signal to
5864 pp_entereval that it should not throw away any saved lines at scope
5867 PL_breakable_sub_gen++;
5869 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
5870 mod(scalarseq(block), OP_LEAVESUBLV));
5871 block->op_attached = 1;
5874 /* This makes sub {}; work as expected. */
5875 if (block->op_type == OP_STUB) {
5876 OP* const newblock = newSTATEOP(0, NULL, 0);
5878 op_getmad(block,newblock,'B');
5885 block->op_attached = 1;
5886 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
5888 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5889 OpREFCNT_set(CvROOT(cv), 1);
5890 CvSTART(cv) = LINKLIST(CvROOT(cv));
5891 CvROOT(cv)->op_next = 0;
5892 CALL_PEEP(CvSTART(cv));
5894 /* now that optimizer has done its work, adjust pad values */
5896 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
5899 assert(!CvCONST(cv));
5900 if (ps && !*ps && op_const_sv(block, cv))
5905 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
5906 SV * const sv = newSV(0);
5907 SV * const tmpstr = sv_newmortal();
5908 GV * const db_postponed = gv_fetchpvs("DB::postponed",
5909 GV_ADDMULTI, SVt_PVHV);
5912 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
5914 (long)PL_subline, (long)CopLINE(PL_curcop));
5915 gv_efullname3(tmpstr, gv, NULL);
5916 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
5917 SvCUR(tmpstr), sv, 0);
5918 hv = GvHVn(db_postponed);
5919 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) {
5920 CV * const pcv = GvCV(db_postponed);
5926 call_sv(MUTABLE_SV(pcv), G_DISCARD);
5931 if (name && ! (PL_parser && PL_parser->error_count))
5932 process_special_blocks(name, gv, cv);
5937 PL_parser->copline = NOLINE;
5943 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
5946 const char *const colon = strrchr(fullname,':');
5947 const char *const name = colon ? colon + 1 : fullname;
5949 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
5952 if (strEQ(name, "BEGIN")) {
5953 const I32 oldscope = PL_scopestack_ix;
5955 SAVECOPFILE(&PL_compiling);
5956 SAVECOPLINE(&PL_compiling);
5958 DEBUG_x( dump_sub(gv) );
5959 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
5960 GvCV(gv) = 0; /* cv has been hijacked */
5961 call_list(oldscope, PL_beginav);
5963 PL_curcop = &PL_compiling;
5964 CopHINTS_set(&PL_compiling, PL_hints);
5971 if strEQ(name, "END") {
5972 DEBUG_x( dump_sub(gv) );
5973 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
5976 } else if (*name == 'U') {
5977 if (strEQ(name, "UNITCHECK")) {
5978 /* It's never too late to run a unitcheck block */
5979 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
5983 } else if (*name == 'C') {
5984 if (strEQ(name, "CHECK")) {
5986 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
5987 "Too late to run CHECK block");
5988 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
5992 } else if (*name == 'I') {
5993 if (strEQ(name, "INIT")) {
5995 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
5996 "Too late to run INIT block");
5997 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
6003 DEBUG_x( dump_sub(gv) );
6004 GvCV(gv) = 0; /* cv has been hijacked */
6009 =for apidoc newCONSTSUB
6011 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
6012 eligible for inlining at compile-time.
6014 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
6015 which won't be called if used as a destructor, but will suppress the overhead
6016 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
6023 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
6028 const char *const file = CopFILE(PL_curcop);
6030 SV *const temp_sv = CopFILESV(PL_curcop);
6031 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
6036 if (IN_PERL_RUNTIME) {
6037 /* at runtime, it's not safe to manipulate PL_curcop: it may be
6038 * an op shared between threads. Use a non-shared COP for our
6040 SAVEVPTR(PL_curcop);
6041 PL_curcop = &PL_compiling;
6043 SAVECOPLINE(PL_curcop);
6044 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
6047 PL_hints &= ~HINT_BLOCK_SCOPE;
6050 SAVESPTR(PL_curstash);
6051 SAVECOPSTASH(PL_curcop);
6052 PL_curstash = stash;
6053 CopSTASH_set(PL_curcop,stash);
6056 /* file becomes the CvFILE. For an XS, it's supposed to be static storage,
6057 and so doesn't get free()d. (It's expected to be from the C pre-
6058 processor __FILE__ directive). But we need a dynamically allocated one,
6059 and we need it to get freed. */
6060 cv = newXS_flags(name, const_sv_xsub, file ? file : "", "",
6061 XS_DYNAMIC_FILENAME);
6062 CvXSUBANY(cv).any_ptr = sv;
6067 CopSTASH_free(PL_curcop);
6075 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
6076 const char *const filename, const char *const proto,
6079 CV *cv = newXS(name, subaddr, filename);
6081 PERL_ARGS_ASSERT_NEWXS_FLAGS;
6083 if (flags & XS_DYNAMIC_FILENAME) {
6084 /* We need to "make arrangements" (ie cheat) to ensure that the
6085 filename lasts as long as the PVCV we just created, but also doesn't
6087 STRLEN filename_len = strlen(filename);
6088 STRLEN proto_and_file_len = filename_len;
6089 char *proto_and_file;
6093 proto_len = strlen(proto);
6094 proto_and_file_len += proto_len;
6096 Newx(proto_and_file, proto_and_file_len + 1, char);
6097 Copy(proto, proto_and_file, proto_len, char);
6098 Copy(filename, proto_and_file + proto_len, filename_len + 1, char);
6101 proto_and_file = savepvn(filename, filename_len);
6104 /* This gets free()d. :-) */
6105 sv_usepvn_flags(MUTABLE_SV(cv), proto_and_file, proto_and_file_len,
6106 SV_HAS_TRAILING_NUL);
6108 /* This gives us the correct prototype, rather than one with the
6109 file name appended. */
6110 SvCUR_set(cv, proto_len);
6114 CvFILE(cv) = proto_and_file + proto_len;
6116 sv_setpv(MUTABLE_SV(cv), proto);
6122 =for apidoc U||newXS
6124 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
6125 static storage, as it is used directly as CvFILE(), without a copy being made.
6131 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
6134 GV * const gv = gv_fetchpv(name ? name :
6135 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
6136 GV_ADDMULTI, SVt_PVCV);
6139 PERL_ARGS_ASSERT_NEWXS;
6142 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
6144 if ((cv = (name ? GvCV(gv) : NULL))) {
6146 /* just a cached method */
6150 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
6151 /* already defined (or promised) */
6152 /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */
6153 if (ckWARN(WARN_REDEFINE)) {
6154 GV * const gvcv = CvGV(cv);
6156 HV * const stash = GvSTASH(gvcv);
6158 const char *redefined_name = HvNAME_get(stash);
6159 if ( strEQ(redefined_name,"autouse") ) {
6160 const line_t oldline = CopLINE(PL_curcop);
6161 if (PL_parser && PL_parser->copline != NOLINE)
6162 CopLINE_set(PL_curcop, PL_parser->copline);
6163 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6164 CvCONST(cv) ? "Constant subroutine %s redefined"
6165 : "Subroutine %s redefined"
6167 CopLINE_set(PL_curcop, oldline);
6177 if (cv) /* must reuse cv if autoloaded */
6180 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
6184 mro_method_changed_in(GvSTASH(gv)); /* newXS */
6188 (void)gv_fetchfile(filename);
6189 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
6190 an external constant string */
6192 CvXSUB(cv) = subaddr;
6195 process_special_blocks(name, gv, cv);
6207 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
6212 OP* pegop = newOP(OP_NULL, 0);
6216 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
6217 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
6220 if ((cv = GvFORM(gv))) {
6221 if (ckWARN(WARN_REDEFINE)) {
6222 const line_t oldline = CopLINE(PL_curcop);
6223 if (PL_parser && PL_parser->copline != NOLINE)
6224 CopLINE_set(PL_curcop, PL_parser->copline);
6226 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6227 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
6229 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6230 "Format STDOUT redefined");
6232 CopLINE_set(PL_curcop, oldline);
6239 CvFILE_set_from_cop(cv, PL_curcop);
6242 pad_tidy(padtidy_FORMAT);
6243 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
6244 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6245 OpREFCNT_set(CvROOT(cv), 1);
6246 CvSTART(cv) = LINKLIST(CvROOT(cv));
6247 CvROOT(cv)->op_next = 0;
6248 CALL_PEEP(CvSTART(cv));
6250 op_getmad(o,pegop,'n');
6251 op_getmad_weak(block, pegop, 'b');
6256 PL_parser->copline = NOLINE;
6264 Perl_newANONLIST(pTHX_ OP *o)
6266 return convert(OP_ANONLIST, OPf_SPECIAL, o);
6270 Perl_newANONHASH(pTHX_ OP *o)
6272 return convert(OP_ANONHASH, OPf_SPECIAL, o);
6276 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
6278 return newANONATTRSUB(floor, proto, NULL, block);
6282 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
6284 return newUNOP(OP_REFGEN, 0,
6285 newSVOP(OP_ANONCODE, 0,
6286 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
6290 Perl_oopsAV(pTHX_ OP *o)
6294 PERL_ARGS_ASSERT_OOPSAV;
6296 switch (o->op_type) {
6298 o->op_type = OP_PADAV;
6299 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6300 return ref(o, OP_RV2AV);
6303 o->op_type = OP_RV2AV;
6304 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
6309 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
6316 Perl_oopsHV(pTHX_ OP *o)
6320 PERL_ARGS_ASSERT_OOPSHV;
6322 switch (o->op_type) {
6325 o->op_type = OP_PADHV;
6326 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6327 return ref(o, OP_RV2HV);
6331 o->op_type = OP_RV2HV;
6332 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
6337 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
6344 Perl_newAVREF(pTHX_ OP *o)
6348 PERL_ARGS_ASSERT_NEWAVREF;
6350 if (o->op_type == OP_PADANY) {
6351 o->op_type = OP_PADAV;
6352 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6355 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
6356 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6357 "Using an array as a reference is deprecated");
6359 return newUNOP(OP_RV2AV, 0, scalar(o));
6363 Perl_newGVREF(pTHX_ I32 type, OP *o)
6365 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
6366 return newUNOP(OP_NULL, 0, o);
6367 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
6371 Perl_newHVREF(pTHX_ OP *o)
6375 PERL_ARGS_ASSERT_NEWHVREF;
6377 if (o->op_type == OP_PADANY) {
6378 o->op_type = OP_PADHV;
6379 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6382 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
6383 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6384 "Using a hash as a reference is deprecated");
6386 return newUNOP(OP_RV2HV, 0, scalar(o));
6390 Perl_newCVREF(pTHX_ I32 flags, OP *o)
6392 return newUNOP(OP_RV2CV, flags, scalar(o));
6396 Perl_newSVREF(pTHX_ OP *o)
6400 PERL_ARGS_ASSERT_NEWSVREF;
6402 if (o->op_type == OP_PADANY) {
6403 o->op_type = OP_PADSV;
6404 o->op_ppaddr = PL_ppaddr[OP_PADSV];
6407 return newUNOP(OP_RV2SV, 0, scalar(o));
6410 /* Check routines. See the comments at the top of this file for details
6411 * on when these are called */
6414 Perl_ck_anoncode(pTHX_ OP *o)
6416 PERL_ARGS_ASSERT_CK_ANONCODE;
6418 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
6420 cSVOPo->op_sv = NULL;
6425 Perl_ck_bitop(pTHX_ OP *o)
6429 PERL_ARGS_ASSERT_CK_BITOP;
6431 #define OP_IS_NUMCOMPARE(op) \
6432 ((op) == OP_LT || (op) == OP_I_LT || \
6433 (op) == OP_GT || (op) == OP_I_GT || \
6434 (op) == OP_LE || (op) == OP_I_LE || \
6435 (op) == OP_GE || (op) == OP_I_GE || \
6436 (op) == OP_EQ || (op) == OP_I_EQ || \
6437 (op) == OP_NE || (op) == OP_I_NE || \
6438 (op) == OP_NCMP || (op) == OP_I_NCMP)
6439 o->op_private = (U8)(PL_hints & HINT_INTEGER);
6440 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
6441 && (o->op_type == OP_BIT_OR
6442 || o->op_type == OP_BIT_AND
6443 || o->op_type == OP_BIT_XOR))
6445 const OP * const left = cBINOPo->op_first;
6446 const OP * const right = left->op_sibling;
6447 if ((OP_IS_NUMCOMPARE(left->op_type) &&
6448 (left->op_flags & OPf_PARENS) == 0) ||
6449 (OP_IS_NUMCOMPARE(right->op_type) &&
6450 (right->op_flags & OPf_PARENS) == 0))
6451 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
6452 "Possible precedence problem on bitwise %c operator",
6453 o->op_type == OP_BIT_OR ? '|'
6454 : o->op_type == OP_BIT_AND ? '&' : '^'
6461 Perl_ck_concat(pTHX_ OP *o)
6463 const OP * const kid = cUNOPo->op_first;
6465 PERL_ARGS_ASSERT_CK_CONCAT;
6466 PERL_UNUSED_CONTEXT;
6468 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
6469 !(kUNOP->op_first->op_flags & OPf_MOD))
6470 o->op_flags |= OPf_STACKED;
6475 Perl_ck_spair(pTHX_ OP *o)
6479 PERL_ARGS_ASSERT_CK_SPAIR;
6481 if (o->op_flags & OPf_KIDS) {
6484 const OPCODE type = o->op_type;
6485 o = modkids(ck_fun(o), type);
6486 kid = cUNOPo->op_first;
6487 newop = kUNOP->op_first->op_sibling;
6489 const OPCODE type = newop->op_type;
6490 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
6491 type == OP_PADAV || type == OP_PADHV ||
6492 type == OP_RV2AV || type == OP_RV2HV)
6496 op_getmad(kUNOP->op_first,newop,'K');
6498 op_free(kUNOP->op_first);
6500 kUNOP->op_first = newop;
6502 o->op_ppaddr = PL_ppaddr[++o->op_type];
6507 Perl_ck_delete(pTHX_ OP *o)
6509 PERL_ARGS_ASSERT_CK_DELETE;
6513 if (o->op_flags & OPf_KIDS) {
6514 OP * const kid = cUNOPo->op_first;
6515 switch (kid->op_type) {
6517 o->op_flags |= OPf_SPECIAL;
6520 o->op_private |= OPpSLICE;
6523 o->op_flags |= OPf_SPECIAL;
6528 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
6531 if (kid->op_private & OPpLVAL_INTRO)
6532 o->op_private |= OPpLVAL_INTRO;
6539 Perl_ck_die(pTHX_ OP *o)
6541 PERL_ARGS_ASSERT_CK_DIE;
6544 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6550 Perl_ck_eof(pTHX_ OP *o)
6554 PERL_ARGS_ASSERT_CK_EOF;
6556 if (o->op_flags & OPf_KIDS) {
6557 if (cLISTOPo->op_first->op_type == OP_STUB) {
6559 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
6561 op_getmad(o,newop,'O');
6573 Perl_ck_eval(pTHX_ OP *o)
6577 PERL_ARGS_ASSERT_CK_EVAL;
6579 PL_hints |= HINT_BLOCK_SCOPE;
6580 if (o->op_flags & OPf_KIDS) {
6581 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6584 o->op_flags &= ~OPf_KIDS;
6587 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
6593 cUNOPo->op_first = 0;
6598 NewOp(1101, enter, 1, LOGOP);
6599 enter->op_type = OP_ENTERTRY;
6600 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
6601 enter->op_private = 0;
6603 /* establish postfix order */
6604 enter->op_next = (OP*)enter;
6606 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
6607 o->op_type = OP_LEAVETRY;
6608 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
6609 enter->op_other = o;
6610 op_getmad(oldo,o,'O');
6624 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
6625 op_getmad(oldo,o,'O');
6627 o->op_targ = (PADOFFSET)PL_hints;
6628 if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) {
6629 /* Store a copy of %^H that pp_entereval can pick up. */
6630 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
6631 MUTABLE_SV(Perl_hv_copy_hints_hv(aTHX_ GvHV(PL_hintgv))));
6632 cUNOPo->op_first->op_sibling = hhop;
6633 o->op_private |= OPpEVAL_HAS_HH;
6639 Perl_ck_exit(pTHX_ OP *o)
6641 PERL_ARGS_ASSERT_CK_EXIT;
6644 HV * const table = GvHV(PL_hintgv);
6646 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
6647 if (svp && *svp && SvTRUE(*svp))
6648 o->op_private |= OPpEXIT_VMSISH;
6650 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6656 Perl_ck_exec(pTHX_ OP *o)
6658 PERL_ARGS_ASSERT_CK_EXEC;
6660 if (o->op_flags & OPf_STACKED) {
6663 kid = cUNOPo->op_first->op_sibling;
6664 if (kid->op_type == OP_RV2GV)
6673 Perl_ck_exists(pTHX_ OP *o)
6677 PERL_ARGS_ASSERT_CK_EXISTS;
6680 if (o->op_flags & OPf_KIDS) {
6681 OP * const kid = cUNOPo->op_first;
6682 if (kid->op_type == OP_ENTERSUB) {
6683 (void) ref(kid, o->op_type);
6684 if (kid->op_type != OP_RV2CV
6685 && !(PL_parser && PL_parser->error_count))
6686 Perl_croak(aTHX_ "%s argument is not a subroutine name",
6688 o->op_private |= OPpEXISTS_SUB;
6690 else if (kid->op_type == OP_AELEM)
6691 o->op_flags |= OPf_SPECIAL;
6692 else if (kid->op_type != OP_HELEM)
6693 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
6701 Perl_ck_rvconst(pTHX_ register OP *o)
6704 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6706 PERL_ARGS_ASSERT_CK_RVCONST;
6708 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6709 if (o->op_type == OP_RV2CV)
6710 o->op_private &= ~1;
6712 if (kid->op_type == OP_CONST) {
6715 SV * const kidsv = kid->op_sv;
6717 /* Is it a constant from cv_const_sv()? */
6718 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
6719 SV * const rsv = SvRV(kidsv);
6720 const svtype type = SvTYPE(rsv);
6721 const char *badtype = NULL;
6723 switch (o->op_type) {
6725 if (type > SVt_PVMG)
6726 badtype = "a SCALAR";
6729 if (type != SVt_PVAV)
6730 badtype = "an ARRAY";
6733 if (type != SVt_PVHV)
6737 if (type != SVt_PVCV)
6742 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
6745 else if ((o->op_type == OP_RV2HV || o->op_type == OP_RV2SV) &&
6746 (PL_hints & HINT_STRICT_REFS) && SvPOK(kidsv)) {
6747 /* If this is an access to a stash, disable "strict refs", because
6748 * stashes aren't auto-vivified at compile-time (unless we store
6749 * symbols in them), and we don't want to produce a run-time
6750 * stricture error when auto-vivifying the stash. */
6751 const char *s = SvPV_nolen(kidsv);
6752 const STRLEN l = SvCUR(kidsv);
6753 if (l > 1 && s[l-1] == ':' && s[l-2] == ':')
6754 o->op_private &= ~HINT_STRICT_REFS;
6756 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
6757 const char *badthing;
6758 switch (o->op_type) {
6760 badthing = "a SCALAR";
6763 badthing = "an ARRAY";
6766 badthing = "a HASH";
6774 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
6775 SVfARG(kidsv), badthing);
6778 * This is a little tricky. We only want to add the symbol if we
6779 * didn't add it in the lexer. Otherwise we get duplicate strict
6780 * warnings. But if we didn't add it in the lexer, we must at
6781 * least pretend like we wanted to add it even if it existed before,
6782 * or we get possible typo warnings. OPpCONST_ENTERED says
6783 * whether the lexer already added THIS instance of this symbol.
6785 iscv = (o->op_type == OP_RV2CV) * 2;
6787 gv = gv_fetchsv(kidsv,
6788 iscv | !(kid->op_private & OPpCONST_ENTERED),
6791 : o->op_type == OP_RV2SV
6793 : o->op_type == OP_RV2AV
6795 : o->op_type == OP_RV2HV
6798 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
6800 kid->op_type = OP_GV;
6801 SvREFCNT_dec(kid->op_sv);
6803 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
6804 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
6805 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
6807 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
6809 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
6811 kid->op_private = 0;
6812 kid->op_ppaddr = PL_ppaddr[OP_GV];
6819 Perl_ck_ftst(pTHX_ OP *o)
6822 const I32 type = o->op_type;
6824 PERL_ARGS_ASSERT_CK_FTST;
6826 if (o->op_flags & OPf_REF) {
6829 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
6830 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6831 const OPCODE kidtype = kid->op_type;
6833 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6834 OP * const newop = newGVOP(type, OPf_REF,
6835 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
6837 op_getmad(o,newop,'O');
6843 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
6844 o->op_private |= OPpFT_ACCESS;
6845 if (PL_check[kidtype] == MEMBER_TO_FPTR(Perl_ck_ftst)
6846 && kidtype != OP_STAT && kidtype != OP_LSTAT)
6847 o->op_private |= OPpFT_STACKED;
6855 if (type == OP_FTTTY)
6856 o = newGVOP(type, OPf_REF, PL_stdingv);
6858 o = newUNOP(type, 0, newDEFSVOP());
6859 op_getmad(oldo,o,'O');
6865 Perl_ck_fun(pTHX_ OP *o)
6868 const int type = o->op_type;
6869 register I32 oa = PL_opargs[type] >> OASHIFT;
6871 PERL_ARGS_ASSERT_CK_FUN;
6873 if (o->op_flags & OPf_STACKED) {
6874 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
6877 return no_fh_allowed(o);
6880 if (o->op_flags & OPf_KIDS) {
6881 OP **tokid = &cLISTOPo->op_first;
6882 register OP *kid = cLISTOPo->op_first;
6886 if (kid->op_type == OP_PUSHMARK ||
6887 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
6889 tokid = &kid->op_sibling;
6890 kid = kid->op_sibling;
6892 if (!kid && PL_opargs[type] & OA_DEFGV)
6893 *tokid = kid = newDEFSVOP();
6897 sibl = kid->op_sibling;
6899 if (!sibl && kid->op_type == OP_STUB) {
6906 /* list seen where single (scalar) arg expected? */
6907 if (numargs == 1 && !(oa >> 4)
6908 && kid->op_type == OP_LIST && type != OP_SCALAR)
6910 return too_many_arguments(o,PL_op_desc[type]);
6923 if ((type == OP_PUSH || type == OP_UNSHIFT)
6924 && !kid->op_sibling)
6925 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
6926 "Useless use of %s with no values",
6929 if (kid->op_type == OP_CONST &&
6930 (kid->op_private & OPpCONST_BARE))
6932 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
6933 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
6934 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6935 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
6936 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6938 op_getmad(kid,newop,'K');
6943 kid->op_sibling = sibl;
6946 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
6947 bad_type(numargs, "array", PL_op_desc[type], kid);
6951 if (kid->op_type == OP_CONST &&
6952 (kid->op_private & OPpCONST_BARE))
6954 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
6955 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
6956 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6957 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
6958 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6960 op_getmad(kid,newop,'K');
6965 kid->op_sibling = sibl;
6968 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
6969 bad_type(numargs, "hash", PL_op_desc[type], kid);
6974 OP * const newop = newUNOP(OP_NULL, 0, kid);
6975 kid->op_sibling = 0;
6977 newop->op_next = newop;
6979 kid->op_sibling = sibl;
6984 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
6985 if (kid->op_type == OP_CONST &&
6986 (kid->op_private & OPpCONST_BARE))
6988 OP * const newop = newGVOP(OP_GV, 0,
6989 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
6990 if (!(o->op_private & 1) && /* if not unop */
6991 kid == cLISTOPo->op_last)
6992 cLISTOPo->op_last = newop;
6994 op_getmad(kid,newop,'K');
7000 else if (kid->op_type == OP_READLINE) {
7001 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
7002 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
7005 I32 flags = OPf_SPECIAL;
7009 /* is this op a FH constructor? */
7010 if (is_handle_constructor(o,numargs)) {
7011 const char *name = NULL;
7015 /* Set a flag to tell rv2gv to vivify
7016 * need to "prove" flag does not mean something
7017 * else already - NI-S 1999/05/07
7020 if (kid->op_type == OP_PADSV) {
7022 = PAD_COMPNAME_SV(kid->op_targ);
7023 name = SvPV_const(namesv, len);
7025 else if (kid->op_type == OP_RV2SV
7026 && kUNOP->op_first->op_type == OP_GV)
7028 GV * const gv = cGVOPx_gv(kUNOP->op_first);
7030 len = GvNAMELEN(gv);
7032 else if (kid->op_type == OP_AELEM
7033 || kid->op_type == OP_HELEM)
7036 OP *op = ((BINOP*)kid)->op_first;
7040 const char * const a =
7041 kid->op_type == OP_AELEM ?
7043 if (((op->op_type == OP_RV2AV) ||
7044 (op->op_type == OP_RV2HV)) &&
7045 (firstop = ((UNOP*)op)->op_first) &&
7046 (firstop->op_type == OP_GV)) {
7047 /* packagevar $a[] or $h{} */
7048 GV * const gv = cGVOPx_gv(firstop);
7056 else if (op->op_type == OP_PADAV
7057 || op->op_type == OP_PADHV) {
7058 /* lexicalvar $a[] or $h{} */
7059 const char * const padname =
7060 PAD_COMPNAME_PV(op->op_targ);
7069 name = SvPV_const(tmpstr, len);
7074 name = "__ANONIO__";
7081 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
7082 namesv = PAD_SVl(targ);
7083 SvUPGRADE(namesv, SVt_PV);
7085 sv_setpvs(namesv, "$");
7086 sv_catpvn(namesv, name, len);
7089 kid->op_sibling = 0;
7090 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
7091 kid->op_targ = targ;
7092 kid->op_private |= priv;
7094 kid->op_sibling = sibl;
7100 mod(scalar(kid), type);
7104 tokid = &kid->op_sibling;
7105 kid = kid->op_sibling;
7108 if (kid && kid->op_type != OP_STUB)
7109 return too_many_arguments(o,OP_DESC(o));
7110 o->op_private |= numargs;
7112 /* FIXME - should the numargs move as for the PERL_MAD case? */
7113 o->op_private |= numargs;
7115 return too_many_arguments(o,OP_DESC(o));
7119 else if (PL_opargs[type] & OA_DEFGV) {
7121 OP *newop = newUNOP(type, 0, newDEFSVOP());
7122 op_getmad(o,newop,'O');
7125 /* Ordering of these two is important to keep f_map.t passing. */
7127 return newUNOP(type, 0, newDEFSVOP());
7132 while (oa & OA_OPTIONAL)
7134 if (oa && oa != OA_LIST)
7135 return too_few_arguments(o,OP_DESC(o));
7141 Perl_ck_glob(pTHX_ OP *o)
7146 PERL_ARGS_ASSERT_CK_GLOB;
7149 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
7150 append_elem(OP_GLOB, o, newDEFSVOP());
7152 if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
7153 && GvCVu(gv) && GvIMPORTED_CV(gv)))
7155 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7158 #if !defined(PERL_EXTERNAL_GLOB)
7159 /* XXX this can be tightened up and made more failsafe. */
7160 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7163 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
7164 newSVpvs("File::Glob"), NULL, NULL, NULL);
7165 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7166 glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV);
7167 GvCV(gv) = GvCV(glob_gv);
7168 SvREFCNT_inc_void(MUTABLE_SV(GvCV(gv)));
7169 GvIMPORTED_CV_on(gv);
7172 #endif /* PERL_EXTERNAL_GLOB */
7174 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7175 append_elem(OP_GLOB, o,
7176 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
7177 o->op_type = OP_LIST;
7178 o->op_ppaddr = PL_ppaddr[OP_LIST];
7179 cLISTOPo->op_first->op_type = OP_PUSHMARK;
7180 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
7181 cLISTOPo->op_first->op_targ = 0;
7182 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
7183 append_elem(OP_LIST, o,
7184 scalar(newUNOP(OP_RV2CV, 0,
7185 newGVOP(OP_GV, 0, gv)))));
7186 o = newUNOP(OP_NULL, 0, ck_subr(o));
7187 o->op_targ = OP_GLOB; /* hint at what it used to be */
7190 gv = newGVgen("main");
7192 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
7198 Perl_ck_grep(pTHX_ OP *o)
7203 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
7206 PERL_ARGS_ASSERT_CK_GREP;
7208 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
7209 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
7211 if (o->op_flags & OPf_STACKED) {
7214 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
7215 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
7216 return no_fh_allowed(o);
7217 for (k = kid; k; k = k->op_next) {
7220 NewOp(1101, gwop, 1, LOGOP);
7221 kid->op_next = (OP*)gwop;
7222 o->op_flags &= ~OPf_STACKED;
7224 kid = cLISTOPo->op_first->op_sibling;
7225 if (type == OP_MAPWHILE)
7230 if (PL_parser && PL_parser->error_count)
7232 kid = cLISTOPo->op_first->op_sibling;
7233 if (kid->op_type != OP_NULL)
7234 Perl_croak(aTHX_ "panic: ck_grep");
7235 kid = kUNOP->op_first;
7238 NewOp(1101, gwop, 1, LOGOP);
7239 gwop->op_type = type;
7240 gwop->op_ppaddr = PL_ppaddr[type];
7241 gwop->op_first = listkids(o);
7242 gwop->op_flags |= OPf_KIDS;
7243 gwop->op_other = LINKLIST(kid);
7244 kid->op_next = (OP*)gwop;
7245 offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
7246 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
7247 o->op_private = gwop->op_private = 0;
7248 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
7251 o->op_private = gwop->op_private = OPpGREP_LEX;
7252 gwop->op_targ = o->op_targ = offset;
7255 kid = cLISTOPo->op_first->op_sibling;
7256 if (!kid || !kid->op_sibling)
7257 return too_few_arguments(o,OP_DESC(o));
7258 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
7259 mod(kid, OP_GREPSTART);
7265 Perl_ck_index(pTHX_ OP *o)
7267 PERL_ARGS_ASSERT_CK_INDEX;
7269 if (o->op_flags & OPf_KIDS) {
7270 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7272 kid = kid->op_sibling; /* get past "big" */
7273 if (kid && kid->op_type == OP_CONST)
7274 fbm_compile(((SVOP*)kid)->op_sv, 0);
7280 Perl_ck_lfun(pTHX_ OP *o)
7282 const OPCODE type = o->op_type;
7284 PERL_ARGS_ASSERT_CK_LFUN;
7286 return modkids(ck_fun(o), type);
7290 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
7292 PERL_ARGS_ASSERT_CK_DEFINED;
7294 if ((o->op_flags & OPf_KIDS)) {
7295 switch (cUNOPo->op_first->op_type) {
7297 /* This is needed for
7298 if (defined %stash::)
7299 to work. Do not break Tk.
7301 break; /* Globals via GV can be undef */
7303 case OP_AASSIGN: /* Is this a good idea? */
7304 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7305 "defined(@array) is deprecated");
7306 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7307 "\t(Maybe you should just omit the defined()?)\n");
7311 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7312 "defined(%%hash) is deprecated");
7313 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7314 "\t(Maybe you should just omit the defined()?)\n");
7325 Perl_ck_readline(pTHX_ OP *o)
7327 PERL_ARGS_ASSERT_CK_READLINE;
7329 if (!(o->op_flags & OPf_KIDS)) {
7331 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
7333 op_getmad(o,newop,'O');
7343 Perl_ck_rfun(pTHX_ OP *o)
7345 const OPCODE type = o->op_type;
7347 PERL_ARGS_ASSERT_CK_RFUN;
7349 return refkids(ck_fun(o), type);
7353 Perl_ck_listiob(pTHX_ OP *o)
7357 PERL_ARGS_ASSERT_CK_LISTIOB;
7359 kid = cLISTOPo->op_first;
7362 kid = cLISTOPo->op_first;
7364 if (kid->op_type == OP_PUSHMARK)
7365 kid = kid->op_sibling;
7366 if (kid && o->op_flags & OPf_STACKED)
7367 kid = kid->op_sibling;
7368 else if (kid && !kid->op_sibling) { /* print HANDLE; */
7369 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
7370 o->op_flags |= OPf_STACKED; /* make it a filehandle */
7371 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
7372 cLISTOPo->op_first->op_sibling = kid;
7373 cLISTOPo->op_last = kid;
7374 kid = kid->op_sibling;
7379 append_elem(o->op_type, o, newDEFSVOP());
7385 Perl_ck_smartmatch(pTHX_ OP *o)
7388 if (0 == (o->op_flags & OPf_SPECIAL)) {
7389 OP *first = cBINOPo->op_first;
7390 OP *second = first->op_sibling;
7392 /* Implicitly take a reference to an array or hash */
7393 first->op_sibling = NULL;
7394 first = cBINOPo->op_first = ref_array_or_hash(first);
7395 second = first->op_sibling = ref_array_or_hash(second);
7397 /* Implicitly take a reference to a regular expression */
7398 if (first->op_type == OP_MATCH) {
7399 first->op_type = OP_QR;
7400 first->op_ppaddr = PL_ppaddr[OP_QR];
7402 if (second->op_type == OP_MATCH) {
7403 second->op_type = OP_QR;
7404 second->op_ppaddr = PL_ppaddr[OP_QR];
7413 Perl_ck_sassign(pTHX_ OP *o)
7416 OP * const kid = cLISTOPo->op_first;
7418 PERL_ARGS_ASSERT_CK_SASSIGN;
7420 /* has a disposable target? */
7421 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
7422 && !(kid->op_flags & OPf_STACKED)
7423 /* Cannot steal the second time! */
7424 && !(kid->op_private & OPpTARGET_MY)
7425 /* Keep the full thing for madskills */
7429 OP * const kkid = kid->op_sibling;
7431 /* Can just relocate the target. */
7432 if (kkid && kkid->op_type == OP_PADSV
7433 && !(kkid->op_private & OPpLVAL_INTRO))
7435 kid->op_targ = kkid->op_targ;
7437 /* Now we do not need PADSV and SASSIGN. */
7438 kid->op_sibling = o->op_sibling; /* NULL */
7439 cLISTOPo->op_first = NULL;
7442 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
7446 if (kid->op_sibling) {
7447 OP *kkid = kid->op_sibling;
7448 if (kkid->op_type == OP_PADSV
7449 && (kkid->op_private & OPpLVAL_INTRO)
7450 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
7451 const PADOFFSET target = kkid->op_targ;
7452 OP *const other = newOP(OP_PADSV,
7454 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
7455 OP *const first = newOP(OP_NULL, 0);
7456 OP *const nullop = newCONDOP(0, first, o, other);
7457 OP *const condop = first->op_next;
7458 /* hijacking PADSTALE for uninitialized state variables */
7459 SvPADSTALE_on(PAD_SVl(target));
7461 condop->op_type = OP_ONCE;
7462 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
7463 condop->op_targ = target;
7464 other->op_targ = target;
7466 /* Because we change the type of the op here, we will skip the
7467 assinment binop->op_last = binop->op_first->op_sibling; at the
7468 end of Perl_newBINOP(). So need to do it here. */
7469 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
7478 Perl_ck_match(pTHX_ OP *o)
7482 PERL_ARGS_ASSERT_CK_MATCH;
7484 if (o->op_type != OP_QR && PL_compcv) {
7485 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
7486 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
7487 o->op_targ = offset;
7488 o->op_private |= OPpTARGET_MY;
7491 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
7492 o->op_private |= OPpRUNTIME;
7497 Perl_ck_method(pTHX_ OP *o)
7499 OP * const kid = cUNOPo->op_first;
7501 PERL_ARGS_ASSERT_CK_METHOD;
7503 if (kid->op_type == OP_CONST) {
7504 SV* sv = kSVOP->op_sv;
7505 const char * const method = SvPVX_const(sv);
7506 if (!(strchr(method, ':') || strchr(method, '\''))) {
7508 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
7509 sv = newSVpvn_share(method, SvCUR(sv), 0);
7512 kSVOP->op_sv = NULL;
7514 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
7516 op_getmad(o,cmop,'O');
7527 Perl_ck_null(pTHX_ OP *o)
7529 PERL_ARGS_ASSERT_CK_NULL;
7530 PERL_UNUSED_CONTEXT;
7535 Perl_ck_open(pTHX_ OP *o)
7538 HV * const table = GvHV(PL_hintgv);
7540 PERL_ARGS_ASSERT_CK_OPEN;
7543 SV **svp = hv_fetchs(table, "open_IN", FALSE);
7546 const char *d = SvPV_const(*svp, len);
7547 const I32 mode = mode_from_discipline(d, len);
7548 if (mode & O_BINARY)
7549 o->op_private |= OPpOPEN_IN_RAW;
7550 else if (mode & O_TEXT)
7551 o->op_private |= OPpOPEN_IN_CRLF;
7554 svp = hv_fetchs(table, "open_OUT", FALSE);
7557 const char *d = SvPV_const(*svp, len);
7558 const I32 mode = mode_from_discipline(d, len);
7559 if (mode & O_BINARY)
7560 o->op_private |= OPpOPEN_OUT_RAW;
7561 else if (mode & O_TEXT)
7562 o->op_private |= OPpOPEN_OUT_CRLF;
7565 if (o->op_type == OP_BACKTICK) {
7566 if (!(o->op_flags & OPf_KIDS)) {
7567 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
7569 op_getmad(o,newop,'O');
7578 /* In case of three-arg dup open remove strictness
7579 * from the last arg if it is a bareword. */
7580 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
7581 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
7585 if ((last->op_type == OP_CONST) && /* The bareword. */
7586 (last->op_private & OPpCONST_BARE) &&
7587 (last->op_private & OPpCONST_STRICT) &&
7588 (oa = first->op_sibling) && /* The fh. */
7589 (oa = oa->op_sibling) && /* The mode. */
7590 (oa->op_type == OP_CONST) &&
7591 SvPOK(((SVOP*)oa)->op_sv) &&
7592 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
7593 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
7594 (last == oa->op_sibling)) /* The bareword. */
7595 last->op_private &= ~OPpCONST_STRICT;
7601 Perl_ck_repeat(pTHX_ OP *o)
7603 PERL_ARGS_ASSERT_CK_REPEAT;
7605 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
7606 o->op_private |= OPpREPEAT_DOLIST;
7607 cBINOPo->op_first = force_list(cBINOPo->op_first);
7615 Perl_ck_require(pTHX_ OP *o)
7620 PERL_ARGS_ASSERT_CK_REQUIRE;
7622 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
7623 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7625 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
7626 SV * const sv = kid->op_sv;
7627 U32 was_readonly = SvREADONLY(sv);
7634 sv_force_normal_flags(sv, 0);
7635 assert(!SvREADONLY(sv));
7645 for (; s < end; s++) {
7646 if (*s == ':' && s[1] == ':') {
7648 Move(s+2, s+1, end - s - 1, char);
7653 sv_catpvs(sv, ".pm");
7654 SvFLAGS(sv) |= was_readonly;
7658 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
7659 /* handle override, if any */
7660 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
7661 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7662 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
7663 gv = gvp ? *gvp : NULL;
7667 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7668 OP * const kid = cUNOPo->op_first;
7671 cUNOPo->op_first = 0;
7675 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
7676 append_elem(OP_LIST, kid,
7677 scalar(newUNOP(OP_RV2CV, 0,
7680 op_getmad(o,newop,'O');
7684 return scalar(ck_fun(o));
7688 Perl_ck_return(pTHX_ OP *o)
7693 PERL_ARGS_ASSERT_CK_RETURN;
7695 kid = cLISTOPo->op_first->op_sibling;
7696 if (CvLVALUE(PL_compcv)) {
7697 for (; kid; kid = kid->op_sibling)
7698 mod(kid, OP_LEAVESUBLV);
7700 for (; kid; kid = kid->op_sibling)
7701 if ((kid->op_type == OP_NULL)
7702 && ((kid->op_flags & (OPf_SPECIAL|OPf_KIDS)) == (OPf_SPECIAL|OPf_KIDS))) {
7703 /* This is a do block */
7704 OP *op = kUNOP->op_first;
7705 if (op->op_type == OP_LEAVE && op->op_flags & OPf_KIDS) {
7706 op = cUNOPx(op)->op_first;
7707 assert(op->op_type == OP_ENTER && !(op->op_flags & OPf_SPECIAL));
7708 /* Force the use of the caller's context */
7709 op->op_flags |= OPf_SPECIAL;
7718 Perl_ck_select(pTHX_ OP *o)
7723 PERL_ARGS_ASSERT_CK_SELECT;
7725 if (o->op_flags & OPf_KIDS) {
7726 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7727 if (kid && kid->op_sibling) {
7728 o->op_type = OP_SSELECT;
7729 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
7731 return fold_constants(o);
7735 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7736 if (kid && kid->op_type == OP_RV2GV)
7737 kid->op_private &= ~HINT_STRICT_REFS;
7742 Perl_ck_shift(pTHX_ OP *o)
7745 const I32 type = o->op_type;
7747 PERL_ARGS_ASSERT_CK_SHIFT;
7749 if (!(o->op_flags & OPf_KIDS)) {
7750 OP *argop = newUNOP(OP_RV2AV, 0,
7751 scalar(newGVOP(OP_GV, 0, CvUNIQUE(PL_compcv) ? PL_argvgv : PL_defgv)));
7753 OP * const oldo = o;
7754 o = newUNOP(type, 0, scalar(argop));
7755 op_getmad(oldo,o,'O');
7759 return newUNOP(type, 0, scalar(argop));
7762 return scalar(modkids(ck_fun(o), type));
7766 Perl_ck_sort(pTHX_ OP *o)
7771 PERL_ARGS_ASSERT_CK_SORT;
7773 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
7774 HV * const hinthv = GvHV(PL_hintgv);
7776 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
7778 const I32 sorthints = (I32)SvIV(*svp);
7779 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
7780 o->op_private |= OPpSORT_QSORT;
7781 if ((sorthints & HINT_SORT_STABLE) != 0)
7782 o->op_private |= OPpSORT_STABLE;
7787 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
7789 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7790 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
7792 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
7794 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
7796 if (kid->op_type == OP_SCOPE) {
7800 else if (kid->op_type == OP_LEAVE) {
7801 if (o->op_type == OP_SORT) {
7802 op_null(kid); /* wipe out leave */
7805 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
7806 if (k->op_next == kid)
7808 /* don't descend into loops */
7809 else if (k->op_type == OP_ENTERLOOP
7810 || k->op_type == OP_ENTERITER)
7812 k = cLOOPx(k)->op_lastop;
7817 kid->op_next = 0; /* just disconnect the leave */
7818 k = kLISTOP->op_first;
7823 if (o->op_type == OP_SORT) {
7824 /* provide scalar context for comparison function/block */
7830 o->op_flags |= OPf_SPECIAL;
7832 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
7835 firstkid = firstkid->op_sibling;
7838 /* provide list context for arguments */
7839 if (o->op_type == OP_SORT)
7846 S_simplify_sort(pTHX_ OP *o)
7849 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7855 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
7857 if (!(o->op_flags & OPf_STACKED))
7859 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
7860 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
7861 kid = kUNOP->op_first; /* get past null */
7862 if (kid->op_type != OP_SCOPE)
7864 kid = kLISTOP->op_last; /* get past scope */
7865 switch(kid->op_type) {
7873 k = kid; /* remember this node*/
7874 if (kBINOP->op_first->op_type != OP_RV2SV)
7876 kid = kBINOP->op_first; /* get past cmp */
7877 if (kUNOP->op_first->op_type != OP_GV)
7879 kid = kUNOP->op_first; /* get past rv2sv */
7881 if (GvSTASH(gv) != PL_curstash)
7883 gvname = GvNAME(gv);
7884 if (*gvname == 'a' && gvname[1] == '\0')
7886 else if (*gvname == 'b' && gvname[1] == '\0')
7891 kid = k; /* back to cmp */
7892 if (kBINOP->op_last->op_type != OP_RV2SV)
7894 kid = kBINOP->op_last; /* down to 2nd arg */
7895 if (kUNOP->op_first->op_type != OP_GV)
7897 kid = kUNOP->op_first; /* get past rv2sv */
7899 if (GvSTASH(gv) != PL_curstash)
7901 gvname = GvNAME(gv);
7903 ? !(*gvname == 'a' && gvname[1] == '\0')
7904 : !(*gvname == 'b' && gvname[1] == '\0'))
7906 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
7908 o->op_private |= OPpSORT_DESCEND;
7909 if (k->op_type == OP_NCMP)
7910 o->op_private |= OPpSORT_NUMERIC;
7911 if (k->op_type == OP_I_NCMP)
7912 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
7913 kid = cLISTOPo->op_first->op_sibling;
7914 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
7916 op_getmad(kid,o,'S'); /* then delete it */
7918 op_free(kid); /* then delete it */
7923 Perl_ck_split(pTHX_ OP *o)
7928 PERL_ARGS_ASSERT_CK_SPLIT;
7930 if (o->op_flags & OPf_STACKED)
7931 return no_fh_allowed(o);
7933 kid = cLISTOPo->op_first;
7934 if (kid->op_type != OP_NULL)
7935 Perl_croak(aTHX_ "panic: ck_split");
7936 kid = kid->op_sibling;
7937 op_free(cLISTOPo->op_first);
7938 cLISTOPo->op_first = kid;
7940 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
7941 cLISTOPo->op_last = kid; /* There was only one element previously */
7944 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
7945 OP * const sibl = kid->op_sibling;
7946 kid->op_sibling = 0;
7947 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
7948 if (cLISTOPo->op_first == cLISTOPo->op_last)
7949 cLISTOPo->op_last = kid;
7950 cLISTOPo->op_first = kid;
7951 kid->op_sibling = sibl;
7954 kid->op_type = OP_PUSHRE;
7955 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
7957 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
7958 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
7959 "Use of /g modifier is meaningless in split");
7962 if (!kid->op_sibling)
7963 append_elem(OP_SPLIT, o, newDEFSVOP());
7965 kid = kid->op_sibling;
7968 if (!kid->op_sibling)
7969 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
7970 assert(kid->op_sibling);
7972 kid = kid->op_sibling;
7975 if (kid->op_sibling)
7976 return too_many_arguments(o,OP_DESC(o));
7982 Perl_ck_join(pTHX_ OP *o)
7984 const OP * const kid = cLISTOPo->op_first->op_sibling;
7986 PERL_ARGS_ASSERT_CK_JOIN;
7988 if (kid && kid->op_type == OP_MATCH) {
7989 if (ckWARN(WARN_SYNTAX)) {
7990 const REGEXP *re = PM_GETRE(kPMOP);
7991 const char *pmstr = re ? RX_PRECOMP_const(re) : "STRING";
7992 const STRLEN len = re ? RX_PRELEN(re) : 6;
7993 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7994 "/%.*s/ should probably be written as \"%.*s\"",
7995 (int)len, pmstr, (int)len, pmstr);
8002 Perl_ck_subr(pTHX_ OP *o)
8005 OP *prev = ((cUNOPo->op_first->op_sibling)
8006 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
8007 OP *o2 = prev->op_sibling;
8009 const char *proto = NULL;
8010 const char *proto_end = NULL;
8015 I32 contextclass = 0;
8016 const char *e = NULL;
8019 PERL_ARGS_ASSERT_CK_SUBR;
8021 o->op_private |= OPpENTERSUB_HASTARG;
8022 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
8023 if (cvop->op_type == OP_RV2CV) {
8024 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
8025 op_null(cvop); /* disable rv2cv */
8026 if (!(o->op_private & OPpENTERSUB_AMPER)) {
8027 SVOP *tmpop = (SVOP*)((UNOP*)cvop)->op_first;
8029 switch (tmpop->op_type) {
8031 gv = cGVOPx_gv(tmpop);
8034 tmpop->op_private |= OPpEARLY_CV;
8037 SV *sv = cSVOPx_sv(tmpop);
8038 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV)
8042 if (cv && SvPOK(cv)) {
8044 namegv = gv && CvANON(cv) ? gv : CvGV(cv);
8045 proto = SvPV(MUTABLE_SV(cv), len);
8046 proto_end = proto + len;
8050 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
8051 if (o2->op_type == OP_CONST)
8052 o2->op_private &= ~OPpCONST_STRICT;
8053 else if (o2->op_type == OP_LIST) {
8054 OP * const sib = ((UNOP*)o2)->op_first->op_sibling;
8055 if (sib && sib->op_type == OP_CONST)
8056 sib->op_private &= ~OPpCONST_STRICT;
8059 o->op_private |= (PL_hints & HINT_STRICT_REFS);
8060 if (PERLDB_SUB && PL_curstash != PL_debstash)
8061 o->op_private |= OPpENTERSUB_DB;
8062 while (o2 != cvop) {
8064 if (PL_madskills && o2->op_type == OP_STUB) {
8065 o2 = o2->op_sibling;
8068 if (PL_madskills && o2->op_type == OP_NULL)
8069 o3 = ((UNOP*)o2)->op_first;
8073 if (proto >= proto_end)
8074 return too_many_arguments(o, gv_ename(namegv));
8082 /* _ must be at the end */
8083 if (proto[1] && proto[1] != ';')
8098 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
8100 arg == 1 ? "block or sub {}" : "sub {}",
8101 gv_ename(namegv), o3);
8104 /* '*' allows any scalar type, including bareword */
8107 if (o3->op_type == OP_RV2GV)
8108 goto wrapref; /* autoconvert GLOB -> GLOBref */
8109 else if (o3->op_type == OP_CONST)
8110 o3->op_private &= ~OPpCONST_STRICT;
8111 else if (o3->op_type == OP_ENTERSUB) {
8112 /* accidental subroutine, revert to bareword */
8113 OP *gvop = ((UNOP*)o3)->op_first;
8114 if (gvop && gvop->op_type == OP_NULL) {
8115 gvop = ((UNOP*)gvop)->op_first;
8117 for (; gvop->op_sibling; gvop = gvop->op_sibling)
8120 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
8121 (gvop = ((UNOP*)gvop)->op_first) &&
8122 gvop->op_type == OP_GV)
8124 GV * const gv = cGVOPx_gv(gvop);
8125 OP * const sibling = o2->op_sibling;
8126 SV * const n = newSVpvs("");
8128 OP * const oldo2 = o2;
8132 gv_fullname4(n, gv, "", FALSE);
8133 o2 = newSVOP(OP_CONST, 0, n);
8134 op_getmad(oldo2,o2,'O');
8135 prev->op_sibling = o2;
8136 o2->op_sibling = sibling;
8152 if (contextclass++ == 0) {
8153 e = strchr(proto, ']');
8154 if (!e || e == proto)
8163 const char *p = proto;
8164 const char *const end = proto;
8166 while (*--p != '[') {}
8167 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
8169 gv_ename(namegv), o3);
8174 if (o3->op_type == OP_RV2GV)
8177 bad_type(arg, "symbol", gv_ename(namegv), o3);
8180 if (o3->op_type == OP_ENTERSUB)
8183 bad_type(arg, "subroutine entry", gv_ename(namegv),
8187 if (o3->op_type == OP_RV2SV ||
8188 o3->op_type == OP_PADSV ||
8189 o3->op_type == OP_HELEM ||
8190 o3->op_type == OP_AELEM)
8193 bad_type(arg, "scalar", gv_ename(namegv), o3);
8196 if (o3->op_type == OP_RV2AV ||
8197 o3->op_type == OP_PADAV)
8200 bad_type(arg, "array", gv_ename(namegv), o3);
8203 if (o3->op_type == OP_RV2HV ||
8204 o3->op_type == OP_PADHV)
8207 bad_type(arg, "hash", gv_ename(namegv), o3);
8212 OP* const sib = kid->op_sibling;
8213 kid->op_sibling = 0;
8214 o2 = newUNOP(OP_REFGEN, 0, kid);
8215 o2->op_sibling = sib;
8216 prev->op_sibling = o2;
8218 if (contextclass && e) {
8233 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
8234 gv_ename(namegv), SVfARG(cv));
8239 mod(o2, OP_ENTERSUB);
8241 o2 = o2->op_sibling;
8243 if (o2 == cvop && proto && *proto == '_') {
8244 /* generate an access to $_ */
8246 o2->op_sibling = prev->op_sibling;
8247 prev->op_sibling = o2; /* instead of cvop */
8249 if (proto && !optional && proto_end > proto &&
8250 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
8251 return too_few_arguments(o, gv_ename(namegv));
8254 OP * const oldo = o;
8258 o=newSVOP(OP_CONST, 0, newSViv(0));
8259 op_getmad(oldo,o,'O');
8265 Perl_ck_svconst(pTHX_ OP *o)
8267 PERL_ARGS_ASSERT_CK_SVCONST;
8268 PERL_UNUSED_CONTEXT;
8269 SvREADONLY_on(cSVOPo->op_sv);
8274 Perl_ck_chdir(pTHX_ OP *o)
8276 if (o->op_flags & OPf_KIDS) {
8277 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8279 if (kid && kid->op_type == OP_CONST &&
8280 (kid->op_private & OPpCONST_BARE))
8282 o->op_flags |= OPf_SPECIAL;
8283 kid->op_private &= ~OPpCONST_STRICT;
8290 Perl_ck_trunc(pTHX_ OP *o)
8292 PERL_ARGS_ASSERT_CK_TRUNC;
8294 if (o->op_flags & OPf_KIDS) {
8295 SVOP *kid = (SVOP*)cUNOPo->op_first;
8297 if (kid->op_type == OP_NULL)
8298 kid = (SVOP*)kid->op_sibling;
8299 if (kid && kid->op_type == OP_CONST &&
8300 (kid->op_private & OPpCONST_BARE))
8302 o->op_flags |= OPf_SPECIAL;
8303 kid->op_private &= ~OPpCONST_STRICT;
8310 Perl_ck_unpack(pTHX_ OP *o)
8312 OP *kid = cLISTOPo->op_first;
8314 PERL_ARGS_ASSERT_CK_UNPACK;
8316 if (kid->op_sibling) {
8317 kid = kid->op_sibling;
8318 if (!kid->op_sibling)
8319 kid->op_sibling = newDEFSVOP();
8325 Perl_ck_substr(pTHX_ OP *o)
8327 PERL_ARGS_ASSERT_CK_SUBSTR;
8330 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
8331 OP *kid = cLISTOPo->op_first;
8333 if (kid->op_type == OP_NULL)
8334 kid = kid->op_sibling;
8336 kid->op_flags |= OPf_MOD;
8343 Perl_ck_each(pTHX_ OP *o)
8346 OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
8348 PERL_ARGS_ASSERT_CK_EACH;
8351 if (kid->op_type == OP_PADAV || kid->op_type == OP_RV2AV) {
8352 const unsigned new_type = o->op_type == OP_EACH ? OP_AEACH
8353 : o->op_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
8354 o->op_type = new_type;
8355 o->op_ppaddr = PL_ppaddr[new_type];
8357 else if (!(kid->op_type == OP_PADHV || kid->op_type == OP_RV2HV
8358 || (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE)
8360 bad_type(1, "hash or array", PL_op_desc[o->op_type], kid);
8367 /* caller is supposed to assign the return to the
8368 container of the rep_op var */
8370 S_opt_scalarhv(pTHX_ OP *rep_op) {
8373 PERL_ARGS_ASSERT_OPT_SCALARHV;
8375 NewOp(1101, unop, 1, UNOP);
8376 unop->op_type = (OPCODE)OP_BOOLKEYS;
8377 unop->op_ppaddr = PL_ppaddr[OP_BOOLKEYS];
8378 unop->op_flags = (U8)(OPf_WANT_SCALAR | OPf_KIDS );
8379 unop->op_private = (U8)(1 | ((OPf_WANT_SCALAR | OPf_KIDS) >> 8));
8380 unop->op_first = rep_op;
8381 unop->op_next = rep_op->op_next;
8382 rep_op->op_next = (OP*)unop;
8383 rep_op->op_flags|=(OPf_REF | OPf_MOD);
8384 unop->op_sibling = rep_op->op_sibling;
8385 rep_op->op_sibling = NULL;
8386 /* unop->op_targ = pad_alloc(OP_BOOLKEYS, SVs_PADTMP); */
8387 if (rep_op->op_type == OP_PADHV) {
8388 rep_op->op_flags &= ~OPf_WANT_SCALAR;
8389 rep_op->op_flags |= OPf_WANT_LIST;
8394 /* Checks if o acts as an in-place operator on an array. oright points to the
8395 * beginning of the right-hand side. Returns the left-hand side of the
8396 * assignment if o acts in-place, or NULL otherwise. */
8399 S_is_inplace_av(pTHX_ OP *o, OP *oright) {
8403 PERL_ARGS_ASSERT_IS_INPLACE_AV;
8406 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
8407 || oright->op_next != o
8408 || (oright->op_private & OPpLVAL_INTRO)
8412 /* o2 follows the chain of op_nexts through the LHS of the
8413 * assign (if any) to the aassign op itself */
8415 if (!o2 || o2->op_type != OP_NULL)
8418 if (!o2 || o2->op_type != OP_PUSHMARK)
8421 if (o2 && o2->op_type == OP_GV)
8424 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
8425 || (o2->op_private & OPpLVAL_INTRO)
8430 if (!o2 || o2->op_type != OP_NULL)
8433 if (!o2 || o2->op_type != OP_AASSIGN
8434 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
8437 /* check that the sort is the first arg on RHS of assign */
8439 o2 = cUNOPx(o2)->op_first;
8440 if (!o2 || o2->op_type != OP_NULL)
8442 o2 = cUNOPx(o2)->op_first;
8443 if (!o2 || o2->op_type != OP_PUSHMARK)
8445 if (o2->op_sibling != o)
8448 /* check the array is the same on both sides */
8449 if (oleft->op_type == OP_RV2AV) {
8450 if (oright->op_type != OP_RV2AV
8451 || !cUNOPx(oright)->op_first
8452 || cUNOPx(oright)->op_first->op_type != OP_GV
8453 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
8454 cGVOPx_gv(cUNOPx(oright)->op_first)
8458 else if (oright->op_type != OP_PADAV
8459 || oright->op_targ != oleft->op_targ
8466 /* A peephole optimizer. We visit the ops in the order they're to execute.
8467 * See the comments at the top of this file for more details about when
8468 * peep() is called */
8471 Perl_peep(pTHX_ register OP *o)
8474 register OP* oldop = NULL;
8476 if (!o || o->op_opt)
8480 SAVEVPTR(PL_curcop);
8481 for (; o; o = o->op_next) {
8484 /* By default, this op has now been optimised. A couple of cases below
8485 clear this again. */
8488 switch (o->op_type) {
8491 PL_curcop = ((COP*)o); /* for warnings */
8495 if (cSVOPo->op_private & OPpCONST_STRICT)
8496 no_bareword_allowed(o);
8499 case OP_METHOD_NAMED:
8500 /* Relocate sv to the pad for thread safety.
8501 * Despite being a "constant", the SV is written to,
8502 * for reference counts, sv_upgrade() etc. */
8504 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
8505 if (o->op_type != OP_METHOD_NAMED && SvPADTMP(cSVOPo->op_sv)) {
8506 /* If op_sv is already a PADTMP then it is being used by
8507 * some pad, so make a copy. */
8508 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
8509 SvREADONLY_on(PAD_SVl(ix));
8510 SvREFCNT_dec(cSVOPo->op_sv);
8512 else if (o->op_type != OP_METHOD_NAMED
8513 && cSVOPo->op_sv == &PL_sv_undef) {
8514 /* PL_sv_undef is hack - it's unsafe to store it in the
8515 AV that is the pad, because av_fetch treats values of
8516 PL_sv_undef as a "free" AV entry and will merrily
8517 replace them with a new SV, causing pad_alloc to think
8518 that this pad slot is free. (When, clearly, it is not)
8520 SvOK_off(PAD_SVl(ix));
8521 SvPADTMP_on(PAD_SVl(ix));
8522 SvREADONLY_on(PAD_SVl(ix));
8525 SvREFCNT_dec(PAD_SVl(ix));
8526 SvPADTMP_on(cSVOPo->op_sv);
8527 PAD_SETSV(ix, cSVOPo->op_sv);
8528 /* XXX I don't know how this isn't readonly already. */
8529 SvREADONLY_on(PAD_SVl(ix));
8531 cSVOPo->op_sv = NULL;
8538 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
8539 if (o->op_next->op_private & OPpTARGET_MY) {
8540 if (o->op_flags & OPf_STACKED) /* chained concats */
8541 break; /* ignore_optimization */
8543 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
8544 o->op_targ = o->op_next->op_targ;
8545 o->op_next->op_targ = 0;
8546 o->op_private |= OPpTARGET_MY;
8549 op_null(o->op_next);
8553 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
8554 break; /* Scalar stub must produce undef. List stub is noop */
8558 if (o->op_targ == OP_NEXTSTATE
8559 || o->op_targ == OP_DBSTATE)
8561 PL_curcop = ((COP*)o);
8563 /* XXX: We avoid setting op_seq here to prevent later calls
8564 to peep() from mistakenly concluding that optimisation
8565 has already occurred. This doesn't fix the real problem,
8566 though (See 20010220.007). AMS 20010719 */
8567 /* op_seq functionality is now replaced by op_opt */
8574 if (oldop && o->op_next) {
8575 oldop->op_next = o->op_next;
8583 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
8584 OP* const pop = (o->op_type == OP_PADAV) ?
8585 o->op_next : o->op_next->op_next;
8587 if (pop && pop->op_type == OP_CONST &&
8588 ((PL_op = pop->op_next)) &&
8589 pop->op_next->op_type == OP_AELEM &&
8590 !(pop->op_next->op_private &
8591 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
8592 (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop))
8597 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
8598 no_bareword_allowed(pop);
8599 if (o->op_type == OP_GV)
8600 op_null(o->op_next);
8601 op_null(pop->op_next);
8603 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
8604 o->op_next = pop->op_next->op_next;
8605 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
8606 o->op_private = (U8)i;
8607 if (o->op_type == OP_GV) {
8612 o->op_flags |= OPf_SPECIAL;
8613 o->op_type = OP_AELEMFAST;
8618 if (o->op_next->op_type == OP_RV2SV) {
8619 if (!(o->op_next->op_private & OPpDEREF)) {
8620 op_null(o->op_next);
8621 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
8623 o->op_next = o->op_next->op_next;
8624 o->op_type = OP_GVSV;
8625 o->op_ppaddr = PL_ppaddr[OP_GVSV];
8628 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
8629 GV * const gv = cGVOPo_gv;
8630 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
8631 /* XXX could check prototype here instead of just carping */
8632 SV * const sv = sv_newmortal();
8633 gv_efullname3(sv, gv, NULL);
8634 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
8635 "%"SVf"() called too early to check prototype",
8639 else if (o->op_next->op_type == OP_READLINE
8640 && o->op_next->op_next->op_type == OP_CONCAT
8641 && (o->op_next->op_next->op_flags & OPf_STACKED))
8643 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
8644 o->op_type = OP_RCATLINE;
8645 o->op_flags |= OPf_STACKED;
8646 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
8647 op_null(o->op_next->op_next);
8648 op_null(o->op_next);
8658 fop = cUNOP->op_first;
8666 fop = cLOGOP->op_first;
8667 sop = fop->op_sibling;
8668 while (cLOGOP->op_other->op_type == OP_NULL)
8669 cLOGOP->op_other = cLOGOP->op_other->op_next;
8670 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
8674 if ((fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
8676 (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV)
8681 if (!(nop->op_flags && OPf_WANT_VOID)) {
8682 while (nop && nop->op_next) {
8683 switch (nop->op_next->op_type) {
8688 lop = nop = nop->op_next;
8699 if (lop->op_flags && OPf_WANT_VOID) {
8700 if (fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
8701 cLOGOP->op_first = opt_scalarhv(fop);
8702 if (sop && (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV))
8703 cLOGOP->op_first->op_sibling = opt_scalarhv(sop);
8719 while (cLOGOP->op_other->op_type == OP_NULL)
8720 cLOGOP->op_other = cLOGOP->op_other->op_next;
8721 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
8726 while (cLOOP->op_redoop->op_type == OP_NULL)
8727 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
8728 peep(cLOOP->op_redoop);
8729 while (cLOOP->op_nextop->op_type == OP_NULL)
8730 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
8731 peep(cLOOP->op_nextop);
8732 while (cLOOP->op_lastop->op_type == OP_NULL)
8733 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
8734 peep(cLOOP->op_lastop);
8738 assert(!(cPMOP->op_pmflags & PMf_ONCE));
8739 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
8740 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
8741 cPMOP->op_pmstashstartu.op_pmreplstart
8742 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
8743 peep(cPMOP->op_pmstashstartu.op_pmreplstart);
8747 if (o->op_next && o->op_next->op_type == OP_NEXTSTATE
8748 && ckWARN(WARN_SYNTAX))
8750 if (o->op_next->op_sibling) {
8751 const OPCODE type = o->op_next->op_sibling->op_type;
8752 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
8753 const line_t oldline = CopLINE(PL_curcop);
8754 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
8755 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8756 "Statement unlikely to be reached");
8757 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8758 "\t(Maybe you meant system() when you said exec()?)\n");
8759 CopLINE_set(PL_curcop, oldline);
8770 const char *key = NULL;
8773 if (((BINOP*)o)->op_last->op_type != OP_CONST)
8776 /* Make the CONST have a shared SV */
8777 svp = cSVOPx_svp(((BINOP*)o)->op_last);
8778 if (!SvFAKE(sv = *svp) || !SvREADONLY(sv)) {
8779 key = SvPV_const(sv, keylen);
8780 lexname = newSVpvn_share(key,
8781 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
8787 if ((o->op_private & (OPpLVAL_INTRO)))
8790 rop = (UNOP*)((BINOP*)o)->op_first;
8791 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
8793 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
8794 if (!SvPAD_TYPED(lexname))
8796 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8797 if (!fields || !GvHV(*fields))
8799 key = SvPV_const(*svp, keylen);
8800 if (!hv_fetch(GvHV(*fields), key,
8801 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8803 Perl_croak(aTHX_ "No such class field \"%s\" "
8804 "in variable %s of type %s",
8805 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
8818 SVOP *first_key_op, *key_op;
8820 if ((o->op_private & (OPpLVAL_INTRO))
8821 /* I bet there's always a pushmark... */
8822 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
8823 /* hmmm, no optimization if list contains only one key. */
8825 rop = (UNOP*)((LISTOP*)o)->op_last;
8826 if (rop->op_type != OP_RV2HV)
8828 if (rop->op_first->op_type == OP_PADSV)
8829 /* @$hash{qw(keys here)} */
8830 rop = (UNOP*)rop->op_first;
8832 /* @{$hash}{qw(keys here)} */
8833 if (rop->op_first->op_type == OP_SCOPE
8834 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
8836 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
8842 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
8843 if (!SvPAD_TYPED(lexname))
8845 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8846 if (!fields || !GvHV(*fields))
8848 /* Again guessing that the pushmark can be jumped over.... */
8849 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
8850 ->op_first->op_sibling;
8851 for (key_op = first_key_op; key_op;
8852 key_op = (SVOP*)key_op->op_sibling) {
8853 if (key_op->op_type != OP_CONST)
8855 svp = cSVOPx_svp(key_op);
8856 key = SvPV_const(*svp, keylen);
8857 if (!hv_fetch(GvHV(*fields), key,
8858 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8860 Perl_croak(aTHX_ "No such class field \"%s\" "
8861 "in variable %s of type %s",
8862 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
8869 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
8873 /* check that RHS of sort is a single plain array */
8874 OP *oright = cUNOPo->op_first;
8875 if (!oright || oright->op_type != OP_PUSHMARK)
8878 /* reverse sort ... can be optimised. */
8879 if (!cUNOPo->op_sibling) {
8880 /* Nothing follows us on the list. */
8881 OP * const reverse = o->op_next;
8883 if (reverse->op_type == OP_REVERSE &&
8884 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
8885 OP * const pushmark = cUNOPx(reverse)->op_first;
8886 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
8887 && (cUNOPx(pushmark)->op_sibling == o)) {
8888 /* reverse -> pushmark -> sort */
8889 o->op_private |= OPpSORT_REVERSE;
8891 pushmark->op_next = oright->op_next;
8897 /* make @a = sort @a act in-place */
8899 oright = cUNOPx(oright)->op_sibling;
8902 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
8903 oright = cUNOPx(oright)->op_sibling;
8906 oleft = is_inplace_av(o, oright);
8910 /* transfer MODishness etc from LHS arg to RHS arg */
8911 oright->op_flags = oleft->op_flags;
8912 o->op_private |= OPpSORT_INPLACE;
8914 /* excise push->gv->rv2av->null->aassign */
8915 o2 = o->op_next->op_next;
8916 op_null(o2); /* PUSHMARK */
8918 if (o2->op_type == OP_GV) {
8919 op_null(o2); /* GV */
8922 op_null(o2); /* RV2AV or PADAV */
8923 o2 = o2->op_next->op_next;
8924 op_null(o2); /* AASSIGN */
8926 o->op_next = o2->op_next;
8932 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
8935 LISTOP *enter, *exlist;
8937 /* @a = reverse @a */
8938 if ((oright = cLISTOPo->op_first)
8939 && (oright->op_type == OP_PUSHMARK)
8940 && (oright = oright->op_sibling)
8941 && (oleft = is_inplace_av(o, oright))) {
8944 /* transfer MODishness etc from LHS arg to RHS arg */
8945 oright->op_flags = oleft->op_flags;
8946 o->op_private |= OPpREVERSE_INPLACE;
8948 /* excise push->gv->rv2av->null->aassign */
8949 o2 = o->op_next->op_next;
8950 op_null(o2); /* PUSHMARK */
8952 if (o2->op_type == OP_GV) {
8953 op_null(o2); /* GV */
8956 op_null(o2); /* RV2AV or PADAV */
8957 o2 = o2->op_next->op_next;
8958 op_null(o2); /* AASSIGN */
8960 o->op_next = o2->op_next;
8964 enter = (LISTOP *) o->op_next;
8967 if (enter->op_type == OP_NULL) {
8968 enter = (LISTOP *) enter->op_next;
8972 /* for $a (...) will have OP_GV then OP_RV2GV here.
8973 for (...) just has an OP_GV. */
8974 if (enter->op_type == OP_GV) {
8975 gvop = (OP *) enter;
8976 enter = (LISTOP *) enter->op_next;
8979 if (enter->op_type == OP_RV2GV) {
8980 enter = (LISTOP *) enter->op_next;
8986 if (enter->op_type != OP_ENTERITER)
8989 iter = enter->op_next;
8990 if (!iter || iter->op_type != OP_ITER)
8993 expushmark = enter->op_first;
8994 if (!expushmark || expushmark->op_type != OP_NULL
8995 || expushmark->op_targ != OP_PUSHMARK)
8998 exlist = (LISTOP *) expushmark->op_sibling;
8999 if (!exlist || exlist->op_type != OP_NULL
9000 || exlist->op_targ != OP_LIST)
9003 if (exlist->op_last != o) {
9004 /* Mmm. Was expecting to point back to this op. */
9007 theirmark = exlist->op_first;
9008 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
9011 if (theirmark->op_sibling != o) {
9012 /* There's something between the mark and the reverse, eg
9013 for (1, reverse (...))
9018 ourmark = ((LISTOP *)o)->op_first;
9019 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
9022 ourlast = ((LISTOP *)o)->op_last;
9023 if (!ourlast || ourlast->op_next != o)
9026 rv2av = ourmark->op_sibling;
9027 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
9028 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
9029 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
9030 /* We're just reversing a single array. */
9031 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
9032 enter->op_flags |= OPf_STACKED;
9035 /* We don't have control over who points to theirmark, so sacrifice
9037 theirmark->op_next = ourmark->op_next;
9038 theirmark->op_flags = ourmark->op_flags;
9039 ourlast->op_next = gvop ? gvop : (OP *) enter;
9042 enter->op_private |= OPpITER_REVERSED;
9043 iter->op_private |= OPpITER_REVERSED;
9050 UNOP *refgen, *rv2cv;
9053 if ((o->op_flags & OPf_WANT) != OPf_WANT_VOID)
9056 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
9059 rv2gv = ((BINOP *)o)->op_last;
9060 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
9063 refgen = (UNOP *)((BINOP *)o)->op_first;
9065 if (!refgen || refgen->op_type != OP_REFGEN)
9068 exlist = (LISTOP *)refgen->op_first;
9069 if (!exlist || exlist->op_type != OP_NULL
9070 || exlist->op_targ != OP_LIST)
9073 if (exlist->op_first->op_type != OP_PUSHMARK)
9076 rv2cv = (UNOP*)exlist->op_last;
9078 if (rv2cv->op_type != OP_RV2CV)
9081 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
9082 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
9083 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
9085 o->op_private |= OPpASSIGN_CV_TO_GV;
9086 rv2gv->op_private |= OPpDONT_INIT_GV;
9087 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
9095 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
9096 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
9106 Perl_custom_op_name(pTHX_ const OP* o)
9109 const IV index = PTR2IV(o->op_ppaddr);
9113 PERL_ARGS_ASSERT_CUSTOM_OP_NAME;
9115 if (!PL_custom_op_names) /* This probably shouldn't happen */
9116 return (char *)PL_op_name[OP_CUSTOM];
9118 keysv = sv_2mortal(newSViv(index));
9120 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
9122 return (char *)PL_op_name[OP_CUSTOM]; /* Don't know who you are */
9124 return SvPV_nolen(HeVAL(he));
9128 Perl_custom_op_desc(pTHX_ const OP* o)
9131 const IV index = PTR2IV(o->op_ppaddr);
9135 PERL_ARGS_ASSERT_CUSTOM_OP_DESC;
9137 if (!PL_custom_op_descs)
9138 return (char *)PL_op_desc[OP_CUSTOM];
9140 keysv = sv_2mortal(newSViv(index));
9142 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
9144 return (char *)PL_op_desc[OP_CUSTOM];
9146 return SvPV_nolen(HeVAL(he));
9151 /* Efficient sub that returns a constant scalar value. */
9153 const_sv_xsub(pTHX_ CV* cv)
9157 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
9161 /* diag_listed_as: SKIPME */
9162 Perl_croak(aTHX_ "usage: %s::%s()",
9163 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
9176 * c-indentation-style: bsd
9178 * indent-tabs-mode: t
9181 * ex: set ts=8 sts=4 sw=4 noet: