3 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
4 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
6 * You may distribute under the terms of either the GNU General Public
7 * License or the Artistic License, as specified in the README file.
12 * 'You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
13 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
14 * youngest of the Old Took's daughters); and Mr. Drogo was his second
15 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
16 * either way, as the saying is, if you follow me.' --the Gaffer
18 * [p.23 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
21 /* This file contains the functions that create, manipulate and optimize
22 * the OP structures that hold a compiled perl program.
24 * A Perl program is compiled into a tree of OPs. Each op contains
25 * structural pointers (eg to its siblings and the next op in the
26 * execution sequence), a pointer to the function that would execute the
27 * op, plus any data specific to that op. For example, an OP_CONST op
28 * points to the pp_const() function and to an SV containing the constant
29 * value. When pp_const() is executed, its job is to push that SV onto the
32 * OPs are mainly created by the newFOO() functions, which are mainly
33 * called from the parser (in perly.y) as the code is parsed. For example
34 * the Perl code $a + $b * $c would cause the equivalent of the following
35 * to be called (oversimplifying a bit):
37 * newBINOP(OP_ADD, flags,
39 * newBINOP(OP_MULTIPLY, flags, newSVREF($b), newSVREF($c))
42 * Note that during the build of miniperl, a temporary copy of this file
43 * is made, called opmini.c.
47 Perl's compiler is essentially a 3-pass compiler with interleaved phases:
51 An execution-order pass
53 The bottom-up pass is represented by all the "newOP" routines and
54 the ck_ routines. The bottom-upness is actually driven by yacc.
55 So at the point that a ck_ routine fires, we have no idea what the
56 context is, either upward in the syntax tree, or either forward or
57 backward in the execution order. (The bottom-up parser builds that
58 part of the execution order it knows about, but if you follow the "next"
59 links around, you'll find it's actually a closed loop through the
62 Whenever the bottom-up parser gets to a node that supplies context to
63 its components, it invokes that portion of the top-down pass that applies
64 to that part of the subtree (and marks the top node as processed, so
65 if a node further up supplies context, it doesn't have to take the
66 plunge again). As a particular subcase of this, as the new node is
67 built, it takes all the closed execution loops of its subcomponents
68 and links them into a new closed loop for the higher level node. But
69 it's still not the real execution order.
71 The actual execution order is not known till we get a grammar reduction
72 to a top-level unit like a subroutine or file that will be called by
73 "name" rather than via a "next" pointer. At that point, we can call
74 into peep() to do that code's portion of the 3rd pass. It has to be
75 recursive, but it's recursive on basic blocks, not on tree nodes.
78 /* To implement user lexical pragmas, there needs to be a way at run time to
79 get the compile time state of %^H for that block. Storing %^H in every
80 block (or even COP) would be very expensive, so a different approach is
81 taken. The (running) state of %^H is serialised into a tree of HE-like
82 structs. Stores into %^H are chained onto the current leaf as a struct
83 refcounted_he * with the key and the value. Deletes from %^H are saved
84 with a value of PL_sv_placeholder. The state of %^H at any point can be
85 turned back into a regular HV by walking back up the tree from that point's
86 leaf, ignoring any key you've already seen (placeholder or not), storing
87 the rest into the HV structure, then removing the placeholders. Hence
88 memory is only used to store the %^H deltas from the enclosing COP, rather
89 than the entire %^H on each COP.
91 To cause actions on %^H to write out the serialisation records, it has
92 magic type 'H'. This magic (itself) does nothing, but its presence causes
93 the values to gain magic type 'h', which has entries for set and clear.
94 C<Perl_magic_sethint> updates C<PL_compiling.cop_hints_hash> with a store
95 record, with deletes written by C<Perl_magic_clearhint>. C<SAVEHINTS>
96 saves the current C<PL_compiling.cop_hints_hash> on the save stack, so that
97 it will be correctly restored when any inner compiling scope is exited.
103 #include "keywords.h"
105 #define CALL_PEEP(o) CALL_FPTR(PL_peepp)(aTHX_ o)
106 #define CALL_OPFREEHOOK(o) if (PL_opfreehook) CALL_FPTR(PL_opfreehook)(aTHX_ o)
108 #if defined(PL_OP_SLAB_ALLOC)
110 #ifdef PERL_DEBUG_READONLY_OPS
111 # define PERL_SLAB_SIZE 4096
112 # include <sys/mman.h>
115 #ifndef PERL_SLAB_SIZE
116 #define PERL_SLAB_SIZE 2048
120 Perl_Slab_Alloc(pTHX_ size_t sz)
124 * To make incrementing use count easy PL_OpSlab is an I32 *
125 * To make inserting the link to slab PL_OpPtr is I32 **
126 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
127 * Add an overhead for pointer to slab and round up as a number of pointers
129 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
130 if ((PL_OpSpace -= sz) < 0) {
131 #ifdef PERL_DEBUG_READONLY_OPS
132 /* We need to allocate chunk by chunk so that we can control the VM
134 PL_OpPtr = (I32**) mmap(0, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE,
135 MAP_ANON|MAP_PRIVATE, -1, 0);
137 DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n",
138 (unsigned long) PERL_SLAB_SIZE*sizeof(I32*),
140 if(PL_OpPtr == MAP_FAILED) {
141 perror("mmap failed");
146 PL_OpPtr = (I32 **) PerlMemShared_calloc(PERL_SLAB_SIZE,sizeof(I32*));
151 /* We reserve the 0'th I32 sized chunk as a use count */
152 PL_OpSlab = (I32 *) PL_OpPtr;
153 /* Reduce size by the use count word, and by the size we need.
154 * Latter is to mimic the '-=' in the if() above
156 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
157 /* Allocation pointer starts at the top.
158 Theory: because we build leaves before trunk allocating at end
159 means that at run time access is cache friendly upward
161 PL_OpPtr += PERL_SLAB_SIZE;
163 #ifdef PERL_DEBUG_READONLY_OPS
164 /* We remember this slab. */
165 /* This implementation isn't efficient, but it is simple. */
166 PL_slabs = (I32**) realloc(PL_slabs, sizeof(I32**) * (PL_slab_count + 1));
167 PL_slabs[PL_slab_count++] = PL_OpSlab;
168 DEBUG_m(PerlIO_printf(Perl_debug_log, "Allocate %p\n", PL_OpSlab));
171 assert( PL_OpSpace >= 0 );
172 /* Move the allocation pointer down */
174 assert( PL_OpPtr > (I32 **) PL_OpSlab );
175 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
176 (*PL_OpSlab)++; /* Increment use count of slab */
177 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
178 assert( *PL_OpSlab > 0 );
179 return (void *)(PL_OpPtr + 1);
182 #ifdef PERL_DEBUG_READONLY_OPS
184 Perl_pending_Slabs_to_ro(pTHX) {
185 /* Turn all the allocated op slabs read only. */
186 U32 count = PL_slab_count;
187 I32 **const slabs = PL_slabs;
189 /* Reset the array of pending OP slabs, as we're about to turn this lot
190 read only. Also, do it ahead of the loop in case the warn triggers,
191 and a warn handler has an eval */
196 /* Force a new slab for any further allocation. */
200 void *const start = slabs[count];
201 const size_t size = PERL_SLAB_SIZE* sizeof(I32*);
202 if(mprotect(start, size, PROT_READ)) {
203 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d",
204 start, (unsigned long) size, errno);
212 S_Slab_to_rw(pTHX_ void *op)
214 I32 * const * const ptr = (I32 **) op;
215 I32 * const slab = ptr[-1];
217 PERL_ARGS_ASSERT_SLAB_TO_RW;
219 assert( ptr-1 > (I32 **) slab );
220 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
222 if(mprotect(slab, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE)) {
223 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d",
224 slab, (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), errno);
229 Perl_op_refcnt_inc(pTHX_ OP *o)
240 Perl_op_refcnt_dec(pTHX_ OP *o)
242 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
247 # define Slab_to_rw(op)
251 Perl_Slab_Free(pTHX_ void *op)
253 I32 * const * const ptr = (I32 **) op;
254 I32 * const slab = ptr[-1];
255 PERL_ARGS_ASSERT_SLAB_FREE;
256 assert( ptr-1 > (I32 **) slab );
257 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
260 if (--(*slab) == 0) {
262 # define PerlMemShared PerlMem
265 #ifdef PERL_DEBUG_READONLY_OPS
266 U32 count = PL_slab_count;
267 /* Need to remove this slab from our list of slabs */
270 if (PL_slabs[count] == slab) {
272 /* Found it. Move the entry at the end to overwrite it. */
273 DEBUG_m(PerlIO_printf(Perl_debug_log,
274 "Deallocate %p by moving %p from %lu to %lu\n",
276 PL_slabs[PL_slab_count - 1],
277 PL_slab_count, count));
278 PL_slabs[count] = PL_slabs[--PL_slab_count];
279 /* Could realloc smaller at this point, but probably not
281 if(munmap(slab, PERL_SLAB_SIZE*sizeof(I32*))) {
282 perror("munmap failed");
290 PerlMemShared_free(slab);
292 if (slab == PL_OpSlab) {
299 * In the following definition, the ", (OP*)0" is just to make the compiler
300 * think the expression is of the right type: croak actually does a Siglongjmp.
302 #define CHECKOP(type,o) \
303 ((PL_op_mask && PL_op_mask[type]) \
304 ? ( op_free((OP*)o), \
305 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
307 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
309 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
312 S_gv_ename(pTHX_ GV *gv)
314 SV* const tmpsv = sv_newmortal();
316 PERL_ARGS_ASSERT_GV_ENAME;
318 gv_efullname3(tmpsv, gv, NULL);
319 return SvPV_nolen_const(tmpsv);
323 S_no_fh_allowed(pTHX_ OP *o)
325 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
327 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
333 S_too_few_arguments(pTHX_ OP *o, const char *name)
335 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS;
337 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
342 S_too_many_arguments(pTHX_ OP *o, const char *name)
344 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS;
346 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
351 S_bad_type(pTHX_ I32 n, const char *t, const char *name, const OP *kid)
353 PERL_ARGS_ASSERT_BAD_TYPE;
355 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
356 (int)n, name, t, OP_DESC(kid)));
360 S_no_bareword_allowed(pTHX_ const OP *o)
362 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
365 return; /* various ok barewords are hidden in extra OP_NULL */
366 qerror(Perl_mess(aTHX_
367 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
371 /* "register" allocation */
374 Perl_allocmy(pTHX_ const char *const name)
378 const bool is_our = (PL_parser->in_my == KEY_our);
380 PERL_ARGS_ASSERT_ALLOCMY;
382 /* complain about "my $<special_var>" etc etc */
386 (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) ||
387 (name[1] == '_' && (*name == '$' || name[2]))))
389 /* name[2] is true if strlen(name) > 2 */
390 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
391 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%s in \"%s\"",
392 name[0], toCTRL(name[1]), name + 2,
393 PL_parser->in_my == KEY_state ? "state" : "my"));
395 yyerror(Perl_form(aTHX_ "Can't use global %s in \"%s\"",name,
396 PL_parser->in_my == KEY_state ? "state" : "my"));
400 /* check for duplicate declaration */
401 pad_check_dup(name, is_our, (PL_curstash ? PL_curstash : PL_defstash));
403 /* allocate a spare slot and store the name in that slot */
405 off = pad_add_name(name,
406 PL_parser->in_my_stash,
408 /* $_ is always in main::, even with our */
409 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
413 PL_parser->in_my == KEY_state
415 /* anon sub prototypes contains state vars should always be cloned,
416 * otherwise the state var would be shared between anon subs */
418 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
419 CvCLONE_on(PL_compcv);
424 /* free the body of an op without examining its contents.
425 * Always use this rather than FreeOp directly */
428 S_op_destroy(pTHX_ OP *o)
430 if (o->op_latefree) {
438 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b)
440 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a)
446 Perl_op_free(pTHX_ OP *o)
453 if (o->op_latefreed) {
460 if (o->op_private & OPpREFCOUNTED) {
471 refcnt = OpREFCNT_dec(o);
474 /* Need to find and remove any pattern match ops from the list
475 we maintain for reset(). */
476 find_and_forget_pmops(o);
486 /* Call the op_free hook if it has been set. Do it now so that it's called
487 * at the right time for refcounted ops, but still before all of the kids
491 if (o->op_flags & OPf_KIDS) {
492 register OP *kid, *nextkid;
493 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
494 nextkid = kid->op_sibling; /* Get before next freeing kid */
499 #ifdef PERL_DEBUG_READONLY_OPS
503 /* COP* is not cleared by op_clear() so that we may track line
504 * numbers etc even after null() */
505 if (type == OP_NEXTSTATE || type == OP_DBSTATE
506 || (type == OP_NULL /* the COP might have been null'ed */
507 && ((OPCODE)o->op_targ == OP_NEXTSTATE
508 || (OPCODE)o->op_targ == OP_DBSTATE))) {
513 type = (OPCODE)o->op_targ;
516 if (o->op_latefree) {
522 #ifdef DEBUG_LEAKING_SCALARS
529 Perl_op_clear(pTHX_ OP *o)
534 PERL_ARGS_ASSERT_OP_CLEAR;
537 /* if (o->op_madprop && o->op_madprop->mad_next)
539 /* FIXME for MAD - if I uncomment these two lines t/op/pack.t fails with
540 "modification of a read only value" for a reason I can't fathom why.
541 It's the "" stringification of $_, where $_ was set to '' in a foreach
542 loop, but it defies simplification into a small test case.
543 However, commenting them out has caused ext/List/Util/t/weak.t to fail
546 mad_free(o->op_madprop);
552 switch (o->op_type) {
553 case OP_NULL: /* Was holding old type, if any. */
554 if (PL_madskills && o->op_targ != OP_NULL) {
555 o->op_type = (Optype)o->op_targ;
559 case OP_ENTEREVAL: /* Was holding hints. */
563 if (!(o->op_flags & OPf_REF)
564 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
570 if (! (o->op_type == OP_AELEMFAST && o->op_flags & OPf_SPECIAL)) {
571 /* not an OP_PADAV replacement */
573 if (cPADOPo->op_padix > 0) {
574 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
575 * may still exist on the pad */
576 pad_swipe(cPADOPo->op_padix, TRUE);
577 cPADOPo->op_padix = 0;
580 SvREFCNT_dec(cSVOPo->op_sv);
581 cSVOPo->op_sv = NULL;
585 case OP_METHOD_NAMED:
588 SvREFCNT_dec(cSVOPo->op_sv);
589 cSVOPo->op_sv = NULL;
592 Even if op_clear does a pad_free for the target of the op,
593 pad_free doesn't actually remove the sv that exists in the pad;
594 instead it lives on. This results in that it could be reused as
595 a target later on when the pad was reallocated.
598 pad_swipe(o->op_targ,1);
607 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
611 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
613 if (cPADOPo->op_padix > 0) {
614 pad_swipe(cPADOPo->op_padix, TRUE);
615 cPADOPo->op_padix = 0;
618 SvREFCNT_dec(cSVOPo->op_sv);
619 cSVOPo->op_sv = NULL;
623 PerlMemShared_free(cPVOPo->op_pv);
624 cPVOPo->op_pv = NULL;
628 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
632 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
633 /* No GvIN_PAD_off here, because other references may still
634 * exist on the pad */
635 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
638 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
644 forget_pmop(cPMOPo, 1);
645 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
646 /* we use the same protection as the "SAFE" version of the PM_ macros
647 * here since sv_clean_all might release some PMOPs
648 * after PL_regex_padav has been cleared
649 * and the clearing of PL_regex_padav needs to
650 * happen before sv_clean_all
653 if(PL_regex_pad) { /* We could be in destruction */
654 const IV offset = (cPMOPo)->op_pmoffset;
655 ReREFCNT_dec(PM_GETRE(cPMOPo));
656 PL_regex_pad[offset] = &PL_sv_undef;
657 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
661 ReREFCNT_dec(PM_GETRE(cPMOPo));
662 PM_SETRE(cPMOPo, NULL);
668 if (o->op_targ > 0) {
669 pad_free(o->op_targ);
675 S_cop_free(pTHX_ COP* cop)
677 PERL_ARGS_ASSERT_COP_FREE;
681 if (! specialWARN(cop->cop_warnings))
682 PerlMemShared_free(cop->cop_warnings);
683 Perl_refcounted_he_free(aTHX_ cop->cop_hints_hash);
687 S_forget_pmop(pTHX_ PMOP *const o
693 HV * const pmstash = PmopSTASH(o);
695 PERL_ARGS_ASSERT_FORGET_PMOP;
697 if (pmstash && !SvIS_FREED(pmstash)) {
698 MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab);
700 PMOP **const array = (PMOP**) mg->mg_ptr;
701 U32 count = mg->mg_len / sizeof(PMOP**);
706 /* Found it. Move the entry at the end to overwrite it. */
707 array[i] = array[--count];
708 mg->mg_len = count * sizeof(PMOP**);
709 /* Could realloc smaller at this point always, but probably
710 not worth it. Probably worth free()ing if we're the
713 Safefree(mg->mg_ptr);
730 S_find_and_forget_pmops(pTHX_ OP *o)
732 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
734 if (o->op_flags & OPf_KIDS) {
735 OP *kid = cUNOPo->op_first;
737 switch (kid->op_type) {
742 forget_pmop((PMOP*)kid, 0);
744 find_and_forget_pmops(kid);
745 kid = kid->op_sibling;
751 Perl_op_null(pTHX_ OP *o)
755 PERL_ARGS_ASSERT_OP_NULL;
757 if (o->op_type == OP_NULL)
761 o->op_targ = o->op_type;
762 o->op_type = OP_NULL;
763 o->op_ppaddr = PL_ppaddr[OP_NULL];
767 Perl_op_refcnt_lock(pTHX)
775 Perl_op_refcnt_unlock(pTHX)
782 /* Contextualizers */
784 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
787 S_linklist(pTHX_ OP *o)
791 PERL_ARGS_ASSERT_LINKLIST;
796 /* establish postfix order */
797 first = cUNOPo->op_first;
800 o->op_next = LINKLIST(first);
803 if (kid->op_sibling) {
804 kid->op_next = LINKLIST(kid->op_sibling);
805 kid = kid->op_sibling;
819 S_scalarkids(pTHX_ OP *o)
821 if (o && o->op_flags & OPf_KIDS) {
823 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
830 S_scalarboolean(pTHX_ OP *o)
834 PERL_ARGS_ASSERT_SCALARBOOLEAN;
836 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
837 if (ckWARN(WARN_SYNTAX)) {
838 const line_t oldline = CopLINE(PL_curcop);
840 if (PL_parser && PL_parser->copline != NOLINE)
841 CopLINE_set(PL_curcop, PL_parser->copline);
842 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
843 CopLINE_set(PL_curcop, oldline);
850 Perl_scalar(pTHX_ OP *o)
855 /* assumes no premature commitment */
856 if (!o || (PL_parser && PL_parser->error_count)
857 || (o->op_flags & OPf_WANT)
858 || o->op_type == OP_RETURN)
863 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
865 switch (o->op_type) {
867 scalar(cBINOPo->op_first);
872 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
882 if (o->op_flags & OPf_KIDS) {
883 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
889 kid = cLISTOPo->op_first;
891 while ((kid = kid->op_sibling)) {
897 PL_curcop = &PL_compiling;
902 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
908 PL_curcop = &PL_compiling;
911 if (ckWARN(WARN_VOID))
912 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
919 Perl_scalarvoid(pTHX_ OP *o)
923 const char* useless = NULL;
927 PERL_ARGS_ASSERT_SCALARVOID;
929 /* trailing mad null ops don't count as "there" for void processing */
931 o->op_type != OP_NULL &&
933 o->op_sibling->op_type == OP_NULL)
936 for (sib = o->op_sibling;
937 sib && sib->op_type == OP_NULL;
938 sib = sib->op_sibling) ;
944 if (o->op_type == OP_NEXTSTATE
945 || o->op_type == OP_DBSTATE
946 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
947 || o->op_targ == OP_DBSTATE)))
948 PL_curcop = (COP*)o; /* for warning below */
950 /* assumes no premature commitment */
951 want = o->op_flags & OPf_WANT;
952 if ((want && want != OPf_WANT_SCALAR)
953 || (PL_parser && PL_parser->error_count)
954 || o->op_type == OP_RETURN)
959 if ((o->op_private & OPpTARGET_MY)
960 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
962 return scalar(o); /* As if inside SASSIGN */
965 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
967 switch (o->op_type) {
969 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
973 if (o->op_flags & OPf_STACKED)
977 if (o->op_private == 4)
1020 case OP_GETSOCKNAME:
1021 case OP_GETPEERNAME:
1026 case OP_GETPRIORITY:
1050 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1051 /* Otherwise it's "Useless use of grep iterator" */
1052 useless = OP_DESC(o);
1056 kid = cUNOPo->op_first;
1057 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1058 kid->op_type != OP_TRANS) {
1061 useless = "negative pattern binding (!~)";
1068 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1069 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1070 useless = "a variable";
1075 if (cSVOPo->op_private & OPpCONST_STRICT)
1076 no_bareword_allowed(o);
1078 if (ckWARN(WARN_VOID)) {
1080 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1081 "a constant (%"SVf")", sv));
1082 useless = SvPV_nolen(msv);
1085 useless = "a constant (undef)";
1086 if (o->op_private & OPpCONST_ARYBASE)
1088 /* don't warn on optimised away booleans, eg
1089 * use constant Foo, 5; Foo || print; */
1090 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1092 /* the constants 0 and 1 are permitted as they are
1093 conventionally used as dummies in constructs like
1094 1 while some_condition_with_side_effects; */
1095 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1097 else if (SvPOK(sv)) {
1098 /* perl4's way of mixing documentation and code
1099 (before the invention of POD) was based on a
1100 trick to mix nroff and perl code. The trick was
1101 built upon these three nroff macros being used in
1102 void context. The pink camel has the details in
1103 the script wrapman near page 319. */
1104 const char * const maybe_macro = SvPVX_const(sv);
1105 if (strnEQ(maybe_macro, "di", 2) ||
1106 strnEQ(maybe_macro, "ds", 2) ||
1107 strnEQ(maybe_macro, "ig", 2))
1112 op_null(o); /* don't execute or even remember it */
1116 o->op_type = OP_PREINC; /* pre-increment is faster */
1117 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1121 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1122 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1126 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1127 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1131 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1132 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1137 kid = cLOGOPo->op_first;
1138 if (kid->op_type == OP_NOT
1139 && (kid->op_flags & OPf_KIDS)
1141 if (o->op_type == OP_AND) {
1143 o->op_ppaddr = PL_ppaddr[OP_OR];
1145 o->op_type = OP_AND;
1146 o->op_ppaddr = PL_ppaddr[OP_AND];
1155 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1160 if (o->op_flags & OPf_STACKED)
1167 if (!(o->op_flags & OPf_KIDS))
1178 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1185 /* all requires must return a boolean value */
1186 o->op_flags &= ~OPf_WANT;
1191 if (useless && ckWARN(WARN_VOID))
1192 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
1197 S_listkids(pTHX_ OP *o)
1199 if (o && o->op_flags & OPf_KIDS) {
1201 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1208 Perl_list(pTHX_ OP *o)
1213 /* assumes no premature commitment */
1214 if (!o || (o->op_flags & OPf_WANT)
1215 || (PL_parser && PL_parser->error_count)
1216 || o->op_type == OP_RETURN)
1221 if ((o->op_private & OPpTARGET_MY)
1222 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1224 return o; /* As if inside SASSIGN */
1227 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1229 switch (o->op_type) {
1232 list(cBINOPo->op_first);
1237 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1245 if (!(o->op_flags & OPf_KIDS))
1247 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1248 list(cBINOPo->op_first);
1249 return gen_constant_list(o);
1256 kid = cLISTOPo->op_first;
1258 while ((kid = kid->op_sibling)) {
1259 if (kid->op_sibling)
1264 PL_curcop = &PL_compiling;
1268 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1269 if (kid->op_sibling)
1274 PL_curcop = &PL_compiling;
1277 /* all requires must return a boolean value */
1278 o->op_flags &= ~OPf_WANT;
1285 S_scalarseq(pTHX_ OP *o)
1289 const OPCODE type = o->op_type;
1291 if (type == OP_LINESEQ || type == OP_SCOPE ||
1292 type == OP_LEAVE || type == OP_LEAVETRY)
1295 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1296 if (kid->op_sibling) {
1300 PL_curcop = &PL_compiling;
1302 o->op_flags &= ~OPf_PARENS;
1303 if (PL_hints & HINT_BLOCK_SCOPE)
1304 o->op_flags |= OPf_PARENS;
1307 o = newOP(OP_STUB, 0);
1312 S_modkids(pTHX_ OP *o, I32 type)
1314 if (o && o->op_flags & OPf_KIDS) {
1316 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1322 /* Propagate lvalue ("modifiable") context to an op and its children.
1323 * 'type' represents the context type, roughly based on the type of op that
1324 * would do the modifying, although local() is represented by OP_NULL.
1325 * It's responsible for detecting things that can't be modified, flag
1326 * things that need to behave specially in an lvalue context (e.g., "$$x = 5"
1327 * might have to vivify a reference in $x), and so on.
1329 * For example, "$a+1 = 2" would cause mod() to be called with o being
1330 * OP_ADD and type being OP_SASSIGN, and would output an error.
1334 Perl_mod(pTHX_ OP *o, I32 type)
1338 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1341 if (!o || (PL_parser && PL_parser->error_count))
1344 if ((o->op_private & OPpTARGET_MY)
1345 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1350 switch (o->op_type) {
1356 if (!(o->op_private & OPpCONST_ARYBASE))
1359 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1360 CopARYBASE_set(&PL_compiling,
1361 (I32)SvIV(cSVOPx(PL_eval_start)->op_sv));
1365 SAVECOPARYBASE(&PL_compiling);
1366 CopARYBASE_set(&PL_compiling, 0);
1368 else if (type == OP_REFGEN)
1371 Perl_croak(aTHX_ "That use of $[ is unsupported");
1374 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1378 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1379 !(o->op_flags & OPf_STACKED)) {
1380 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1381 /* The default is to set op_private to the number of children,
1382 which for a UNOP such as RV2CV is always 1. And w're using
1383 the bit for a flag in RV2CV, so we need it clear. */
1384 o->op_private &= ~1;
1385 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1386 assert(cUNOPo->op_first->op_type == OP_NULL);
1387 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1390 else if (o->op_private & OPpENTERSUB_NOMOD)
1392 else { /* lvalue subroutine call */
1393 o->op_private |= OPpLVAL_INTRO;
1394 PL_modcount = RETURN_UNLIMITED_NUMBER;
1395 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1396 /* Backward compatibility mode: */
1397 o->op_private |= OPpENTERSUB_INARGS;
1400 else { /* Compile-time error message: */
1401 OP *kid = cUNOPo->op_first;
1405 if (kid->op_type != OP_PUSHMARK) {
1406 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1408 "panic: unexpected lvalue entersub "
1409 "args: type/targ %ld:%"UVuf,
1410 (long)kid->op_type, (UV)kid->op_targ);
1411 kid = kLISTOP->op_first;
1413 while (kid->op_sibling)
1414 kid = kid->op_sibling;
1415 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1417 if (kid->op_type == OP_METHOD_NAMED
1418 || kid->op_type == OP_METHOD)
1422 NewOp(1101, newop, 1, UNOP);
1423 newop->op_type = OP_RV2CV;
1424 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1425 newop->op_first = NULL;
1426 newop->op_next = (OP*)newop;
1427 kid->op_sibling = (OP*)newop;
1428 newop->op_private |= OPpLVAL_INTRO;
1429 newop->op_private &= ~1;
1433 if (kid->op_type != OP_RV2CV)
1435 "panic: unexpected lvalue entersub "
1436 "entry via type/targ %ld:%"UVuf,
1437 (long)kid->op_type, (UV)kid->op_targ);
1438 kid->op_private |= OPpLVAL_INTRO;
1439 break; /* Postpone until runtime */
1443 kid = kUNOP->op_first;
1444 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1445 kid = kUNOP->op_first;
1446 if (kid->op_type == OP_NULL)
1448 "Unexpected constant lvalue entersub "
1449 "entry via type/targ %ld:%"UVuf,
1450 (long)kid->op_type, (UV)kid->op_targ);
1451 if (kid->op_type != OP_GV) {
1452 /* Restore RV2CV to check lvalueness */
1454 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1455 okid->op_next = kid->op_next;
1456 kid->op_next = okid;
1459 okid->op_next = NULL;
1460 okid->op_type = OP_RV2CV;
1462 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1463 okid->op_private |= OPpLVAL_INTRO;
1464 okid->op_private &= ~1;
1468 cv = GvCV(kGVOP_gv);
1478 /* grep, foreach, subcalls, refgen */
1479 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1481 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1482 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1484 : (o->op_type == OP_ENTERSUB
1485 ? "non-lvalue subroutine call"
1487 type ? PL_op_desc[type] : "local"));
1501 case OP_RIGHT_SHIFT:
1510 if (!(o->op_flags & OPf_STACKED))
1517 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1523 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1524 PL_modcount = RETURN_UNLIMITED_NUMBER;
1525 return o; /* Treat \(@foo) like ordinary list. */
1529 if (scalar_mod_type(o, type))
1531 ref(cUNOPo->op_first, o->op_type);
1535 if (type == OP_LEAVESUBLV)
1536 o->op_private |= OPpMAYBE_LVSUB;
1542 PL_modcount = RETURN_UNLIMITED_NUMBER;
1545 ref(cUNOPo->op_first, o->op_type);
1550 PL_hints |= HINT_BLOCK_SCOPE;
1565 PL_modcount = RETURN_UNLIMITED_NUMBER;
1566 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1567 return o; /* Treat \(@foo) like ordinary list. */
1568 if (scalar_mod_type(o, type))
1570 if (type == OP_LEAVESUBLV)
1571 o->op_private |= OPpMAYBE_LVSUB;
1575 if (!type) /* local() */
1576 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1577 PAD_COMPNAME_PV(o->op_targ));
1585 if (type != OP_SASSIGN)
1589 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1594 if (type == OP_LEAVESUBLV)
1595 o->op_private |= OPpMAYBE_LVSUB;
1597 pad_free(o->op_targ);
1598 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1599 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1600 if (o->op_flags & OPf_KIDS)
1601 mod(cBINOPo->op_first->op_sibling, type);
1606 ref(cBINOPo->op_first, o->op_type);
1607 if (type == OP_ENTERSUB &&
1608 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1609 o->op_private |= OPpLVAL_DEFER;
1610 if (type == OP_LEAVESUBLV)
1611 o->op_private |= OPpMAYBE_LVSUB;
1621 if (o->op_flags & OPf_KIDS)
1622 mod(cLISTOPo->op_last, type);
1627 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1629 else if (!(o->op_flags & OPf_KIDS))
1631 if (o->op_targ != OP_LIST) {
1632 mod(cBINOPo->op_first, type);
1638 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1643 if (type != OP_LEAVESUBLV)
1645 break; /* mod()ing was handled by ck_return() */
1648 /* [20011101.069] File test operators interpret OPf_REF to mean that
1649 their argument is a filehandle; thus \stat(".") should not set
1651 if (type == OP_REFGEN &&
1652 PL_check[o->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst))
1655 if (type != OP_LEAVESUBLV)
1656 o->op_flags |= OPf_MOD;
1658 if (type == OP_AASSIGN || type == OP_SASSIGN)
1659 o->op_flags |= OPf_SPECIAL|OPf_REF;
1660 else if (!type) { /* local() */
1663 o->op_private |= OPpLVAL_INTRO;
1664 o->op_flags &= ~OPf_SPECIAL;
1665 PL_hints |= HINT_BLOCK_SCOPE;
1670 if (ckWARN(WARN_SYNTAX)) {
1671 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
1672 "Useless localization of %s", OP_DESC(o));
1676 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1677 && type != OP_LEAVESUBLV)
1678 o->op_flags |= OPf_REF;
1683 S_scalar_mod_type(const OP *o, I32 type)
1685 PERL_ARGS_ASSERT_SCALAR_MOD_TYPE;
1689 if (o->op_type == OP_RV2GV)
1713 case OP_RIGHT_SHIFT:
1733 S_is_handle_constructor(const OP *o, I32 numargs)
1735 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
1737 switch (o->op_type) {
1745 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1758 S_refkids(pTHX_ OP *o, I32 type)
1760 if (o && o->op_flags & OPf_KIDS) {
1762 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1769 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
1774 PERL_ARGS_ASSERT_DOREF;
1776 if (!o || (PL_parser && PL_parser->error_count))
1779 switch (o->op_type) {
1781 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1782 !(o->op_flags & OPf_STACKED)) {
1783 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1784 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1785 assert(cUNOPo->op_first->op_type == OP_NULL);
1786 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1787 o->op_flags |= OPf_SPECIAL;
1788 o->op_private &= ~1;
1793 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1794 doref(kid, type, set_op_ref);
1797 if (type == OP_DEFINED)
1798 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1799 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1802 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1803 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1804 : type == OP_RV2HV ? OPpDEREF_HV
1806 o->op_flags |= OPf_MOD;
1813 o->op_flags |= OPf_REF;
1816 if (type == OP_DEFINED)
1817 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1818 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1824 o->op_flags |= OPf_REF;
1829 if (!(o->op_flags & OPf_KIDS))
1831 doref(cBINOPo->op_first, type, set_op_ref);
1835 doref(cBINOPo->op_first, o->op_type, set_op_ref);
1836 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1837 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1838 : type == OP_RV2HV ? OPpDEREF_HV
1840 o->op_flags |= OPf_MOD;
1850 if (!(o->op_flags & OPf_KIDS))
1852 doref(cLISTOPo->op_last, type, set_op_ref);
1862 S_dup_attrlist(pTHX_ OP *o)
1867 PERL_ARGS_ASSERT_DUP_ATTRLIST;
1869 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1870 * where the first kid is OP_PUSHMARK and the remaining ones
1871 * are OP_CONST. We need to push the OP_CONST values.
1873 if (o->op_type == OP_CONST)
1874 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
1876 else if (o->op_type == OP_NULL)
1880 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1882 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1883 if (o->op_type == OP_CONST)
1884 rop = append_elem(OP_LIST, rop,
1885 newSVOP(OP_CONST, o->op_flags,
1886 SvREFCNT_inc_NN(cSVOPo->op_sv)));
1893 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
1898 PERL_ARGS_ASSERT_APPLY_ATTRS;
1900 /* fake up C<use attributes $pkg,$rv,@attrs> */
1901 ENTER; /* need to protect against side-effects of 'use' */
1902 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1904 #define ATTRSMODULE "attributes"
1905 #define ATTRSMODULE_PM "attributes.pm"
1908 /* Don't force the C<use> if we don't need it. */
1909 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
1910 if (svp && *svp != &PL_sv_undef)
1911 NOOP; /* already in %INC */
1913 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
1914 newSVpvs(ATTRSMODULE), NULL);
1917 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1918 newSVpvs(ATTRSMODULE),
1920 prepend_elem(OP_LIST,
1921 newSVOP(OP_CONST, 0, stashsv),
1922 prepend_elem(OP_LIST,
1923 newSVOP(OP_CONST, 0,
1925 dup_attrlist(attrs))));
1931 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
1934 OP *pack, *imop, *arg;
1937 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
1942 assert(target->op_type == OP_PADSV ||
1943 target->op_type == OP_PADHV ||
1944 target->op_type == OP_PADAV);
1946 /* Ensure that attributes.pm is loaded. */
1947 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
1949 /* Need package name for method call. */
1950 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
1952 /* Build up the real arg-list. */
1953 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1955 arg = newOP(OP_PADSV, 0);
1956 arg->op_targ = target->op_targ;
1957 arg = prepend_elem(OP_LIST,
1958 newSVOP(OP_CONST, 0, stashsv),
1959 prepend_elem(OP_LIST,
1960 newUNOP(OP_REFGEN, 0,
1961 mod(arg, OP_REFGEN)),
1962 dup_attrlist(attrs)));
1964 /* Fake up a method call to import */
1965 meth = newSVpvs_share("import");
1966 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
1967 append_elem(OP_LIST,
1968 prepend_elem(OP_LIST, pack, list(arg)),
1969 newSVOP(OP_METHOD_NAMED, 0, meth)));
1970 imop->op_private |= OPpENTERSUB_NOMOD;
1972 /* Combine the ops. */
1973 *imopsp = append_elem(OP_LIST, *imopsp, imop);
1977 =notfor apidoc apply_attrs_string
1979 Attempts to apply a list of attributes specified by the C<attrstr> and
1980 C<len> arguments to the subroutine identified by the C<cv> argument which
1981 is expected to be associated with the package identified by the C<stashpv>
1982 argument (see L<attributes>). It gets this wrong, though, in that it
1983 does not correctly identify the boundaries of the individual attribute
1984 specifications within C<attrstr>. This is not really intended for the
1985 public API, but has to be listed here for systems such as AIX which
1986 need an explicit export list for symbols. (It's called from XS code
1987 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
1988 to respect attribute syntax properly would be welcome.
1994 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
1995 const char *attrstr, STRLEN len)
1999 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2002 len = strlen(attrstr);
2006 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2008 const char * const sstr = attrstr;
2009 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2010 attrs = append_elem(OP_LIST, attrs,
2011 newSVOP(OP_CONST, 0,
2012 newSVpvn(sstr, attrstr-sstr)));
2016 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2017 newSVpvs(ATTRSMODULE),
2018 NULL, prepend_elem(OP_LIST,
2019 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2020 prepend_elem(OP_LIST,
2021 newSVOP(OP_CONST, 0,
2022 newRV(MUTABLE_SV(cv))),
2027 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2032 PERL_ARGS_ASSERT_MY_KID;
2034 if (!o || (PL_parser && PL_parser->error_count))
2038 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2039 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2043 if (type == OP_LIST) {
2045 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2046 my_kid(kid, attrs, imopsp);
2047 } else if (type == OP_UNDEF
2053 } else if (type == OP_RV2SV || /* "our" declaration */
2055 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2056 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2057 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2059 PL_parser->in_my == KEY_our
2061 : PL_parser->in_my == KEY_state ? "state" : "my"));
2063 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2064 PL_parser->in_my = FALSE;
2065 PL_parser->in_my_stash = NULL;
2066 apply_attrs(GvSTASH(gv),
2067 (type == OP_RV2SV ? GvSV(gv) :
2068 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2069 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2072 o->op_private |= OPpOUR_INTRO;
2075 else if (type != OP_PADSV &&
2078 type != OP_PUSHMARK)
2080 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2082 PL_parser->in_my == KEY_our
2084 : PL_parser->in_my == KEY_state ? "state" : "my"));
2087 else if (attrs && type != OP_PUSHMARK) {
2090 PL_parser->in_my = FALSE;
2091 PL_parser->in_my_stash = NULL;
2093 /* check for C<my Dog $spot> when deciding package */
2094 stash = PAD_COMPNAME_TYPE(o->op_targ);
2096 stash = PL_curstash;
2097 apply_attrs_my(stash, o, attrs, imopsp);
2099 o->op_flags |= OPf_MOD;
2100 o->op_private |= OPpLVAL_INTRO;
2101 if (PL_parser->in_my == KEY_state)
2102 o->op_private |= OPpPAD_STATE;
2107 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2111 int maybe_scalar = 0;
2113 PERL_ARGS_ASSERT_MY_ATTRS;
2115 /* [perl #17376]: this appears to be premature, and results in code such as
2116 C< our(%x); > executing in list mode rather than void mode */
2118 if (o->op_flags & OPf_PARENS)
2128 o = my_kid(o, attrs, &rops);
2130 if (maybe_scalar && o->op_type == OP_PADSV) {
2131 o = scalar(append_list(OP_LIST, (LISTOP*)rops, (LISTOP*)o));
2132 o->op_private |= OPpLVAL_INTRO;
2135 o = append_list(OP_LIST, (LISTOP*)o, (LISTOP*)rops);
2137 PL_parser->in_my = FALSE;
2138 PL_parser->in_my_stash = NULL;
2143 Perl_sawparens(pTHX_ OP *o)
2145 PERL_UNUSED_CONTEXT;
2147 o->op_flags |= OPf_PARENS;
2152 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2156 const OPCODE ltype = left->op_type;
2157 const OPCODE rtype = right->op_type;
2159 PERL_ARGS_ASSERT_BIND_MATCH;
2161 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2162 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2164 const char * const desc
2165 = PL_op_desc[(rtype == OP_SUBST || rtype == OP_TRANS)
2166 ? (int)rtype : OP_MATCH];
2167 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
2168 ? "@array" : "%hash");
2169 Perl_warner(aTHX_ packWARN(WARN_MISC),
2170 "Applying %s to %s will act on scalar(%s)",
2171 desc, sample, sample);
2174 if (rtype == OP_CONST &&
2175 cSVOPx(right)->op_private & OPpCONST_BARE &&
2176 cSVOPx(right)->op_private & OPpCONST_STRICT)
2178 no_bareword_allowed(right);
2181 ismatchop = rtype == OP_MATCH ||
2182 rtype == OP_SUBST ||
2184 if (ismatchop && right->op_private & OPpTARGET_MY) {
2186 right->op_private &= ~OPpTARGET_MY;
2188 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2191 right->op_flags |= OPf_STACKED;
2192 if (rtype != OP_MATCH &&
2193 ! (rtype == OP_TRANS &&
2194 right->op_private & OPpTRANS_IDENTICAL))
2195 newleft = mod(left, rtype);
2198 if (right->op_type == OP_TRANS)
2199 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2201 o = prepend_elem(rtype, scalar(newleft), right);
2203 return newUNOP(OP_NOT, 0, scalar(o));
2207 return bind_match(type, left,
2208 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
2212 Perl_invert(pTHX_ OP *o)
2216 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2220 Perl_scope(pTHX_ OP *o)
2224 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2225 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2226 o->op_type = OP_LEAVE;
2227 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2229 else if (o->op_type == OP_LINESEQ) {
2231 o->op_type = OP_SCOPE;
2232 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2233 kid = ((LISTOP*)o)->op_first;
2234 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2237 /* The following deals with things like 'do {1 for 1}' */
2238 kid = kid->op_sibling;
2240 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2245 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2251 Perl_block_start(pTHX_ int full)
2254 const int retval = PL_savestack_ix;
2255 pad_block_start(full);
2257 PL_hints &= ~HINT_BLOCK_SCOPE;
2258 SAVECOMPILEWARNINGS();
2259 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2264 Perl_block_end(pTHX_ I32 floor, OP *seq)
2267 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2268 OP* const retval = scalarseq(seq);
2270 CopHINTS_set(&PL_compiling, PL_hints);
2272 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2281 const PADOFFSET offset = pad_findmy("$_");
2282 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2283 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2286 OP * const o = newOP(OP_PADSV, 0);
2287 o->op_targ = offset;
2293 Perl_newPROG(pTHX_ OP *o)
2297 PERL_ARGS_ASSERT_NEWPROG;
2302 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2303 ((PL_in_eval & EVAL_KEEPERR)
2304 ? OPf_SPECIAL : 0), o);
2305 PL_eval_start = linklist(PL_eval_root);
2306 PL_eval_root->op_private |= OPpREFCOUNTED;
2307 OpREFCNT_set(PL_eval_root, 1);
2308 PL_eval_root->op_next = 0;
2309 CALL_PEEP(PL_eval_start);
2312 if (o->op_type == OP_STUB) {
2313 PL_comppad_name = 0;
2315 S_op_destroy(aTHX_ o);
2318 PL_main_root = scope(sawparens(scalarvoid(o)));
2319 PL_curcop = &PL_compiling;
2320 PL_main_start = LINKLIST(PL_main_root);
2321 PL_main_root->op_private |= OPpREFCOUNTED;
2322 OpREFCNT_set(PL_main_root, 1);
2323 PL_main_root->op_next = 0;
2324 CALL_PEEP(PL_main_start);
2327 /* Register with debugger */
2329 CV * const cv = get_cvs("DB::postponed", 0);
2333 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
2335 call_sv(MUTABLE_SV(cv), G_DISCARD);
2342 Perl_localize(pTHX_ OP *o, I32 lex)
2346 PERL_ARGS_ASSERT_LOCALIZE;
2348 if (o->op_flags & OPf_PARENS)
2349 /* [perl #17376]: this appears to be premature, and results in code such as
2350 C< our(%x); > executing in list mode rather than void mode */
2357 if ( PL_parser->bufptr > PL_parser->oldbufptr
2358 && PL_parser->bufptr[-1] == ','
2359 && ckWARN(WARN_PARENTHESIS))
2361 char *s = PL_parser->bufptr;
2364 /* some heuristics to detect a potential error */
2365 while (*s && (strchr(", \t\n", *s)))
2369 if (*s && strchr("@$%*", *s) && *++s
2370 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2373 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2375 while (*s && (strchr(", \t\n", *s)))
2381 if (sigil && (*s == ';' || *s == '=')) {
2382 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2383 "Parentheses missing around \"%s\" list",
2385 ? (PL_parser->in_my == KEY_our
2387 : PL_parser->in_my == KEY_state
2397 o = mod(o, OP_NULL); /* a bit kludgey */
2398 PL_parser->in_my = FALSE;
2399 PL_parser->in_my_stash = NULL;
2404 Perl_jmaybe(pTHX_ OP *o)
2406 PERL_ARGS_ASSERT_JMAYBE;
2408 if (o->op_type == OP_LIST) {
2410 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2411 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2417 S_fold_constants(pTHX_ register OP *o)
2420 register OP * VOL curop;
2422 VOL I32 type = o->op_type;
2427 SV * const oldwarnhook = PL_warnhook;
2428 SV * const olddiehook = PL_diehook;
2432 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2434 if (PL_opargs[type] & OA_RETSCALAR)
2436 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2437 o->op_targ = pad_alloc(type, SVs_PADTMP);
2439 /* integerize op, unless it happens to be C<-foo>.
2440 * XXX should pp_i_negate() do magic string negation instead? */
2441 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2442 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2443 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2445 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2448 if (!(PL_opargs[type] & OA_FOLDCONST))
2453 /* XXX might want a ck_negate() for this */
2454 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2465 /* XXX what about the numeric ops? */
2466 if (PL_hints & HINT_LOCALE)
2471 if (PL_parser && PL_parser->error_count)
2472 goto nope; /* Don't try to run w/ errors */
2474 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2475 const OPCODE type = curop->op_type;
2476 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2478 type != OP_SCALAR &&
2480 type != OP_PUSHMARK)
2486 curop = LINKLIST(o);
2487 old_next = o->op_next;
2491 oldscope = PL_scopestack_ix;
2492 create_eval_scope(G_FAKINGEVAL);
2494 /* Verify that we don't need to save it: */
2495 assert(PL_curcop == &PL_compiling);
2496 StructCopy(&PL_compiling, ¬_compiling, COP);
2497 PL_curcop = ¬_compiling;
2498 /* The above ensures that we run with all the correct hints of the
2499 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
2500 assert(IN_PERL_RUNTIME);
2501 PL_warnhook = PERL_WARNHOOK_FATAL;
2508 sv = *(PL_stack_sp--);
2509 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2510 pad_swipe(o->op_targ, FALSE);
2511 else if (SvTEMP(sv)) { /* grab mortal temp? */
2512 SvREFCNT_inc_simple_void(sv);
2517 /* Something tried to die. Abandon constant folding. */
2518 /* Pretend the error never happened. */
2520 o->op_next = old_next;
2524 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
2525 PL_warnhook = oldwarnhook;
2526 PL_diehook = olddiehook;
2527 /* XXX note that this croak may fail as we've already blown away
2528 * the stack - eg any nested evals */
2529 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
2532 PL_warnhook = oldwarnhook;
2533 PL_diehook = olddiehook;
2534 PL_curcop = &PL_compiling;
2536 if (PL_scopestack_ix > oldscope)
2537 delete_eval_scope();
2546 if (type == OP_RV2GV)
2547 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
2549 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
2550 op_getmad(o,newop,'f');
2558 S_gen_constant_list(pTHX_ register OP *o)
2562 const I32 oldtmps_floor = PL_tmps_floor;
2565 if (PL_parser && PL_parser->error_count)
2566 return o; /* Don't attempt to run with errors */
2568 PL_op = curop = LINKLIST(o);
2574 assert (!(curop->op_flags & OPf_SPECIAL));
2575 assert(curop->op_type == OP_RANGE);
2577 PL_tmps_floor = oldtmps_floor;
2579 o->op_type = OP_RV2AV;
2580 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2581 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2582 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
2583 o->op_opt = 0; /* needs to be revisited in peep() */
2584 curop = ((UNOP*)o)->op_first;
2585 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
2587 op_getmad(curop,o,'O');
2596 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2599 if (!o || o->op_type != OP_LIST)
2600 o = newLISTOP(OP_LIST, 0, o, NULL);
2602 o->op_flags &= ~OPf_WANT;
2604 if (!(PL_opargs[type] & OA_MARK))
2605 op_null(cLISTOPo->op_first);
2607 o->op_type = (OPCODE)type;
2608 o->op_ppaddr = PL_ppaddr[type];
2609 o->op_flags |= flags;
2611 o = CHECKOP(type, o);
2612 if (o->op_type != (unsigned)type)
2615 return fold_constants(o);
2618 /* List constructors */
2621 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2629 if (first->op_type != (unsigned)type
2630 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2632 return newLISTOP(type, 0, first, last);
2635 if (first->op_flags & OPf_KIDS)
2636 ((LISTOP*)first)->op_last->op_sibling = last;
2638 first->op_flags |= OPf_KIDS;
2639 ((LISTOP*)first)->op_first = last;
2641 ((LISTOP*)first)->op_last = last;
2646 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2654 if (first->op_type != (unsigned)type)
2655 return prepend_elem(type, (OP*)first, (OP*)last);
2657 if (last->op_type != (unsigned)type)
2658 return append_elem(type, (OP*)first, (OP*)last);
2660 first->op_last->op_sibling = last->op_first;
2661 first->op_last = last->op_last;
2662 first->op_flags |= (last->op_flags & OPf_KIDS);
2665 if (last->op_first && first->op_madprop) {
2666 MADPROP *mp = last->op_first->op_madprop;
2668 while (mp->mad_next)
2670 mp->mad_next = first->op_madprop;
2673 last->op_first->op_madprop = first->op_madprop;
2676 first->op_madprop = last->op_madprop;
2677 last->op_madprop = 0;
2680 S_op_destroy(aTHX_ (OP*)last);
2686 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2694 if (last->op_type == (unsigned)type) {
2695 if (type == OP_LIST) { /* already a PUSHMARK there */
2696 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2697 ((LISTOP*)last)->op_first->op_sibling = first;
2698 if (!(first->op_flags & OPf_PARENS))
2699 last->op_flags &= ~OPf_PARENS;
2702 if (!(last->op_flags & OPf_KIDS)) {
2703 ((LISTOP*)last)->op_last = first;
2704 last->op_flags |= OPf_KIDS;
2706 first->op_sibling = ((LISTOP*)last)->op_first;
2707 ((LISTOP*)last)->op_first = first;
2709 last->op_flags |= OPf_KIDS;
2713 return newLISTOP(type, 0, first, last);
2721 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
2724 Newxz(tk, 1, TOKEN);
2725 tk->tk_type = (OPCODE)optype;
2726 tk->tk_type = 12345;
2728 tk->tk_mad = madprop;
2733 Perl_token_free(pTHX_ TOKEN* tk)
2735 PERL_ARGS_ASSERT_TOKEN_FREE;
2737 if (tk->tk_type != 12345)
2739 mad_free(tk->tk_mad);
2744 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
2749 PERL_ARGS_ASSERT_TOKEN_GETMAD;
2751 if (tk->tk_type != 12345) {
2752 Perl_warner(aTHX_ packWARN(WARN_MISC),
2753 "Invalid TOKEN object ignored");
2760 /* faked up qw list? */
2762 tm->mad_type == MAD_SV &&
2763 SvPVX((SV *)tm->mad_val)[0] == 'q')
2770 /* pretend constant fold didn't happen? */
2771 if (mp->mad_key == 'f' &&
2772 (o->op_type == OP_CONST ||
2773 o->op_type == OP_GV) )
2775 token_getmad(tk,(OP*)mp->mad_val,slot);
2789 if (mp->mad_key == 'X')
2790 mp->mad_key = slot; /* just change the first one */
2800 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
2809 /* pretend constant fold didn't happen? */
2810 if (mp->mad_key == 'f' &&
2811 (o->op_type == OP_CONST ||
2812 o->op_type == OP_GV) )
2814 op_getmad(from,(OP*)mp->mad_val,slot);
2821 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
2824 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
2830 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
2839 /* pretend constant fold didn't happen? */
2840 if (mp->mad_key == 'f' &&
2841 (o->op_type == OP_CONST ||
2842 o->op_type == OP_GV) )
2844 op_getmad(from,(OP*)mp->mad_val,slot);
2851 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
2854 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
2858 PerlIO_printf(PerlIO_stderr(),
2859 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
2865 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
2883 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
2887 addmad(tm, &(o->op_madprop), slot);
2891 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
2912 Perl_newMADsv(pTHX_ char key, SV* sv)
2914 PERL_ARGS_ASSERT_NEWMADSV;
2916 return newMADPROP(key, MAD_SV, sv, 0);
2920 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
2923 Newxz(mp, 1, MADPROP);
2926 mp->mad_vlen = vlen;
2927 mp->mad_type = type;
2929 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
2934 Perl_mad_free(pTHX_ MADPROP* mp)
2936 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
2940 mad_free(mp->mad_next);
2941 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
2942 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
2943 switch (mp->mad_type) {
2947 Safefree((char*)mp->mad_val);
2950 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
2951 op_free((OP*)mp->mad_val);
2954 sv_free(MUTABLE_SV(mp->mad_val));
2957 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
2966 Perl_newNULLLIST(pTHX)
2968 return newOP(OP_STUB, 0);
2972 S_force_list(pTHX_ OP *o)
2974 if (!o || o->op_type != OP_LIST)
2975 o = newLISTOP(OP_LIST, 0, o, NULL);
2981 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2986 NewOp(1101, listop, 1, LISTOP);
2988 listop->op_type = (OPCODE)type;
2989 listop->op_ppaddr = PL_ppaddr[type];
2992 listop->op_flags = (U8)flags;
2996 else if (!first && last)
2999 first->op_sibling = last;
3000 listop->op_first = first;
3001 listop->op_last = last;
3002 if (type == OP_LIST) {
3003 OP* const pushop = newOP(OP_PUSHMARK, 0);
3004 pushop->op_sibling = first;
3005 listop->op_first = pushop;
3006 listop->op_flags |= OPf_KIDS;
3008 listop->op_last = pushop;
3011 return CHECKOP(type, listop);
3015 Perl_newOP(pTHX_ I32 type, I32 flags)
3019 NewOp(1101, o, 1, OP);
3020 o->op_type = (OPCODE)type;
3021 o->op_ppaddr = PL_ppaddr[type];
3022 o->op_flags = (U8)flags;
3024 o->op_latefreed = 0;
3028 o->op_private = (U8)(0 | (flags >> 8));
3029 if (PL_opargs[type] & OA_RETSCALAR)
3031 if (PL_opargs[type] & OA_TARGET)
3032 o->op_targ = pad_alloc(type, SVs_PADTMP);
3033 return CHECKOP(type, o);
3037 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3043 first = newOP(OP_STUB, 0);
3044 if (PL_opargs[type] & OA_MARK)
3045 first = force_list(first);
3047 NewOp(1101, unop, 1, UNOP);
3048 unop->op_type = (OPCODE)type;
3049 unop->op_ppaddr = PL_ppaddr[type];
3050 unop->op_first = first;
3051 unop->op_flags = (U8)(flags | OPf_KIDS);
3052 unop->op_private = (U8)(1 | (flags >> 8));
3053 unop = (UNOP*) CHECKOP(type, unop);
3057 return fold_constants((OP *) unop);
3061 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3065 NewOp(1101, binop, 1, BINOP);
3068 first = newOP(OP_NULL, 0);
3070 binop->op_type = (OPCODE)type;
3071 binop->op_ppaddr = PL_ppaddr[type];
3072 binop->op_first = first;
3073 binop->op_flags = (U8)(flags | OPf_KIDS);
3076 binop->op_private = (U8)(1 | (flags >> 8));
3079 binop->op_private = (U8)(2 | (flags >> 8));
3080 first->op_sibling = last;
3083 binop = (BINOP*)CHECKOP(type, binop);
3084 if (binop->op_next || binop->op_type != (OPCODE)type)
3087 binop->op_last = binop->op_first->op_sibling;
3089 return fold_constants((OP *)binop);
3092 static int uvcompare(const void *a, const void *b)
3093 __attribute__nonnull__(1)
3094 __attribute__nonnull__(2)
3095 __attribute__pure__;
3096 static int uvcompare(const void *a, const void *b)
3098 if (*((const UV *)a) < (*(const UV *)b))
3100 if (*((const UV *)a) > (*(const UV *)b))
3102 if (*((const UV *)a+1) < (*(const UV *)b+1))
3104 if (*((const UV *)a+1) > (*(const UV *)b+1))
3110 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3113 SV * const tstr = ((SVOP*)expr)->op_sv;
3116 (repl->op_type == OP_NULL)
3117 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3119 ((SVOP*)repl)->op_sv;
3122 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3123 const U8 *r = (U8*)SvPV_const(rstr, rlen);
3127 register short *tbl;
3129 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3130 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3131 I32 del = o->op_private & OPpTRANS_DELETE;
3134 PERL_ARGS_ASSERT_PMTRANS;
3136 PL_hints |= HINT_BLOCK_SCOPE;
3139 o->op_private |= OPpTRANS_FROM_UTF;
3142 o->op_private |= OPpTRANS_TO_UTF;
3144 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
3145 SV* const listsv = newSVpvs("# comment\n");
3147 const U8* tend = t + tlen;
3148 const U8* rend = r + rlen;
3162 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3163 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
3166 const U32 flags = UTF8_ALLOW_DEFAULT;
3170 t = tsave = bytes_to_utf8(t, &len);
3173 if (!to_utf && rlen) {
3175 r = rsave = bytes_to_utf8(r, &len);
3179 /* There are several snags with this code on EBCDIC:
3180 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3181 2. scan_const() in toke.c has encoded chars in native encoding which makes
3182 ranges at least in EBCDIC 0..255 range the bottom odd.
3186 U8 tmpbuf[UTF8_MAXBYTES+1];
3189 Newx(cp, 2*tlen, UV);
3191 transv = newSVpvs("");
3193 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3195 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
3197 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3201 cp[2*i+1] = cp[2*i];
3205 qsort(cp, i, 2*sizeof(UV), uvcompare);
3206 for (j = 0; j < i; j++) {
3208 diff = val - nextmin;
3210 t = uvuni_to_utf8(tmpbuf,nextmin);
3211 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3213 U8 range_mark = UTF_TO_NATIVE(0xff);
3214 t = uvuni_to_utf8(tmpbuf, val - 1);
3215 sv_catpvn(transv, (char *)&range_mark, 1);
3216 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3223 t = uvuni_to_utf8(tmpbuf,nextmin);
3224 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3226 U8 range_mark = UTF_TO_NATIVE(0xff);
3227 sv_catpvn(transv, (char *)&range_mark, 1);
3229 t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff,
3230 UNICODE_ALLOW_SUPER);
3231 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3232 t = (const U8*)SvPVX_const(transv);
3233 tlen = SvCUR(transv);
3237 else if (!rlen && !del) {
3238 r = t; rlen = tlen; rend = tend;
3241 if ((!rlen && !del) || t == r ||
3242 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
3244 o->op_private |= OPpTRANS_IDENTICAL;
3248 while (t < tend || tfirst <= tlast) {
3249 /* see if we need more "t" chars */
3250 if (tfirst > tlast) {
3251 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3253 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
3255 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3262 /* now see if we need more "r" chars */
3263 if (rfirst > rlast) {
3265 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3267 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
3269 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3278 rfirst = rlast = 0xffffffff;
3282 /* now see which range will peter our first, if either. */
3283 tdiff = tlast - tfirst;
3284 rdiff = rlast - rfirst;
3291 if (rfirst == 0xffffffff) {
3292 diff = tdiff; /* oops, pretend rdiff is infinite */
3294 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
3295 (long)tfirst, (long)tlast);
3297 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
3301 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
3302 (long)tfirst, (long)(tfirst + diff),
3305 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
3306 (long)tfirst, (long)rfirst);
3308 if (rfirst + diff > max)
3309 max = rfirst + diff;
3311 grows = (tfirst < rfirst &&
3312 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
3324 else if (max > 0xff)
3329 PerlMemShared_free(cPVOPo->op_pv);
3330 cPVOPo->op_pv = NULL;
3332 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
3334 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
3335 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
3336 PAD_SETSV(cPADOPo->op_padix, swash);
3338 SvREADONLY_on(swash);
3340 cSVOPo->op_sv = swash;
3342 SvREFCNT_dec(listsv);
3343 SvREFCNT_dec(transv);
3345 if (!del && havefinal && rlen)
3346 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
3347 newSVuv((UV)final), 0);
3350 o->op_private |= OPpTRANS_GROWS;
3356 op_getmad(expr,o,'e');
3357 op_getmad(repl,o,'r');
3365 tbl = (short*)cPVOPo->op_pv;
3367 Zero(tbl, 256, short);
3368 for (i = 0; i < (I32)tlen; i++)
3370 for (i = 0, j = 0; i < 256; i++) {
3372 if (j >= (I32)rlen) {
3381 if (i < 128 && r[j] >= 128)
3391 o->op_private |= OPpTRANS_IDENTICAL;
3393 else if (j >= (I32)rlen)
3398 PerlMemShared_realloc(tbl,
3399 (0x101+rlen-j) * sizeof(short));
3400 cPVOPo->op_pv = (char*)tbl;
3402 tbl[0x100] = (short)(rlen - j);
3403 for (i=0; i < (I32)rlen - j; i++)
3404 tbl[0x101+i] = r[j+i];
3408 if (!rlen && !del) {
3411 o->op_private |= OPpTRANS_IDENTICAL;
3413 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
3414 o->op_private |= OPpTRANS_IDENTICAL;
3416 for (i = 0; i < 256; i++)
3418 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
3419 if (j >= (I32)rlen) {
3421 if (tbl[t[i]] == -1)
3427 if (tbl[t[i]] == -1) {
3428 if (t[i] < 128 && r[j] >= 128)
3435 if(ckWARN(WARN_MISC)) {
3436 if(del && rlen == tlen) {
3437 Perl_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
3438 } else if(rlen > tlen) {
3439 Perl_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
3444 o->op_private |= OPpTRANS_GROWS;
3446 op_getmad(expr,o,'e');
3447 op_getmad(repl,o,'r');
3457 Perl_newPMOP(pTHX_ I32 type, I32 flags)
3462 NewOp(1101, pmop, 1, PMOP);
3463 pmop->op_type = (OPCODE)type;
3464 pmop->op_ppaddr = PL_ppaddr[type];
3465 pmop->op_flags = (U8)flags;
3466 pmop->op_private = (U8)(0 | (flags >> 8));
3468 if (PL_hints & HINT_RE_TAINT)
3469 pmop->op_pmflags |= PMf_RETAINT;
3470 if (PL_hints & HINT_LOCALE)
3471 pmop->op_pmflags |= PMf_LOCALE;
3475 assert(SvPOK(PL_regex_pad[0]));
3476 if (SvCUR(PL_regex_pad[0])) {
3477 /* Pop off the "packed" IV from the end. */
3478 SV *const repointer_list = PL_regex_pad[0];
3479 const char *p = SvEND(repointer_list) - sizeof(IV);
3480 const IV offset = *((IV*)p);
3482 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
3484 SvEND_set(repointer_list, p);
3486 pmop->op_pmoffset = offset;
3487 /* This slot should be free, so assert this: */
3488 assert(PL_regex_pad[offset] == &PL_sv_undef);
3490 SV * const repointer = &PL_sv_undef;
3491 av_push(PL_regex_padav, repointer);
3492 pmop->op_pmoffset = av_len(PL_regex_padav);
3493 PL_regex_pad = AvARRAY(PL_regex_padav);
3497 return CHECKOP(type, pmop);
3500 /* Given some sort of match op o, and an expression expr containing a
3501 * pattern, either compile expr into a regex and attach it to o (if it's
3502 * constant), or convert expr into a runtime regcomp op sequence (if it's
3505 * isreg indicates that the pattern is part of a regex construct, eg
3506 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
3507 * split "pattern", which aren't. In the former case, expr will be a list
3508 * if the pattern contains more than one term (eg /a$b/) or if it contains
3509 * a replacement, ie s/// or tr///.
3513 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
3518 I32 repl_has_vars = 0;
3522 PERL_ARGS_ASSERT_PMRUNTIME;
3524 if (o->op_type == OP_SUBST || o->op_type == OP_TRANS) {
3525 /* last element in list is the replacement; pop it */
3527 repl = cLISTOPx(expr)->op_last;
3528 kid = cLISTOPx(expr)->op_first;
3529 while (kid->op_sibling != repl)
3530 kid = kid->op_sibling;
3531 kid->op_sibling = NULL;
3532 cLISTOPx(expr)->op_last = kid;
3535 if (isreg && expr->op_type == OP_LIST &&
3536 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
3538 /* convert single element list to element */
3539 OP* const oe = expr;
3540 expr = cLISTOPx(oe)->op_first->op_sibling;
3541 cLISTOPx(oe)->op_first->op_sibling = NULL;
3542 cLISTOPx(oe)->op_last = NULL;
3546 if (o->op_type == OP_TRANS) {
3547 return pmtrans(o, expr, repl);
3550 reglist = isreg && expr->op_type == OP_LIST;
3554 PL_hints |= HINT_BLOCK_SCOPE;
3557 if (expr->op_type == OP_CONST) {
3558 SV *pat = ((SVOP*)expr)->op_sv;
3559 U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME;
3561 if (o->op_flags & OPf_SPECIAL)
3562 pm_flags |= RXf_SPLIT;
3565 assert (SvUTF8(pat));
3566 } else if (SvUTF8(pat)) {
3567 /* Not doing UTF-8, despite what the SV says. Is this only if we're
3568 trapped in use 'bytes'? */
3569 /* Make a copy of the octet sequence, but without the flag on, as
3570 the compiler now honours the SvUTF8 flag on pat. */
3572 const char *const p = SvPV(pat, len);
3573 pat = newSVpvn_flags(p, len, SVs_TEMP);
3576 PM_SETRE(pm, CALLREGCOMP(pat, pm_flags));
3579 op_getmad(expr,(OP*)pm,'e');
3585 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
3586 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
3588 : OP_REGCMAYBE),0,expr);
3590 NewOp(1101, rcop, 1, LOGOP);
3591 rcop->op_type = OP_REGCOMP;
3592 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
3593 rcop->op_first = scalar(expr);
3594 rcop->op_flags |= OPf_KIDS
3595 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
3596 | (reglist ? OPf_STACKED : 0);
3597 rcop->op_private = 1;
3600 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
3602 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
3605 /* establish postfix order */
3606 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
3608 rcop->op_next = expr;
3609 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
3612 rcop->op_next = LINKLIST(expr);
3613 expr->op_next = (OP*)rcop;
3616 prepend_elem(o->op_type, scalar((OP*)rcop), o);
3621 if (pm->op_pmflags & PMf_EVAL) {
3623 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
3624 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
3626 else if (repl->op_type == OP_CONST)
3630 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
3631 if (curop->op_type == OP_SCOPE
3632 || curop->op_type == OP_LEAVE
3633 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
3634 if (curop->op_type == OP_GV) {
3635 GV * const gv = cGVOPx_gv(curop);
3637 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
3640 else if (curop->op_type == OP_RV2CV)
3642 else if (curop->op_type == OP_RV2SV ||
3643 curop->op_type == OP_RV2AV ||
3644 curop->op_type == OP_RV2HV ||
3645 curop->op_type == OP_RV2GV) {
3646 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3649 else if (curop->op_type == OP_PADSV ||
3650 curop->op_type == OP_PADAV ||
3651 curop->op_type == OP_PADHV ||
3652 curop->op_type == OP_PADANY)
3656 else if (curop->op_type == OP_PUSHRE)
3657 NOOP; /* Okay here, dangerous in newASSIGNOP */
3667 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
3669 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3670 prepend_elem(o->op_type, scalar(repl), o);
3673 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
3674 pm->op_pmflags |= PMf_MAYBE_CONST;
3676 NewOp(1101, rcop, 1, LOGOP);
3677 rcop->op_type = OP_SUBSTCONT;
3678 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3679 rcop->op_first = scalar(repl);
3680 rcop->op_flags |= OPf_KIDS;
3681 rcop->op_private = 1;
3684 /* establish postfix order */
3685 rcop->op_next = LINKLIST(repl);
3686 repl->op_next = (OP*)rcop;
3688 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
3689 assert(!(pm->op_pmflags & PMf_ONCE));
3690 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
3699 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3704 PERL_ARGS_ASSERT_NEWSVOP;
3706 NewOp(1101, svop, 1, SVOP);
3707 svop->op_type = (OPCODE)type;
3708 svop->op_ppaddr = PL_ppaddr[type];
3710 svop->op_next = (OP*)svop;
3711 svop->op_flags = (U8)flags;
3712 if (PL_opargs[type] & OA_RETSCALAR)
3714 if (PL_opargs[type] & OA_TARGET)
3715 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3716 return CHECKOP(type, svop);
3721 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3726 PERL_ARGS_ASSERT_NEWPADOP;
3728 NewOp(1101, padop, 1, PADOP);
3729 padop->op_type = (OPCODE)type;
3730 padop->op_ppaddr = PL_ppaddr[type];
3731 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3732 SvREFCNT_dec(PAD_SVl(padop->op_padix));
3733 PAD_SETSV(padop->op_padix, sv);
3736 padop->op_next = (OP*)padop;
3737 padop->op_flags = (U8)flags;
3738 if (PL_opargs[type] & OA_RETSCALAR)
3740 if (PL_opargs[type] & OA_TARGET)
3741 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3742 return CHECKOP(type, padop);
3747 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3751 PERL_ARGS_ASSERT_NEWGVOP;
3755 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3757 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3762 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3766 NewOp(1101, pvop, 1, PVOP);
3767 pvop->op_type = (OPCODE)type;
3768 pvop->op_ppaddr = PL_ppaddr[type];
3770 pvop->op_next = (OP*)pvop;
3771 pvop->op_flags = (U8)flags;
3772 if (PL_opargs[type] & OA_RETSCALAR)
3774 if (PL_opargs[type] & OA_TARGET)
3775 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3776 return CHECKOP(type, pvop);
3784 Perl_package(pTHX_ OP *o)
3787 SV *const sv = cSVOPo->op_sv;
3792 PERL_ARGS_ASSERT_PACKAGE;
3794 save_hptr(&PL_curstash);
3795 save_item(PL_curstname);
3797 PL_curstash = gv_stashsv(sv, GV_ADD);
3799 sv_setsv(PL_curstname, sv);
3801 PL_hints |= HINT_BLOCK_SCOPE;
3802 PL_parser->copline = NOLINE;
3803 PL_parser->expect = XSTATE;
3808 if (!PL_madskills) {
3813 pegop = newOP(OP_NULL,0);
3814 op_getmad(o,pegop,'P');
3824 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
3831 OP *pegop = newOP(OP_NULL,0);
3834 PERL_ARGS_ASSERT_UTILIZE;
3836 if (idop->op_type != OP_CONST)
3837 Perl_croak(aTHX_ "Module name must be constant");
3840 op_getmad(idop,pegop,'U');
3845 SV * const vesv = ((SVOP*)version)->op_sv;
3848 op_getmad(version,pegop,'V');
3849 if (!arg && !SvNIOKp(vesv)) {
3856 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3857 Perl_croak(aTHX_ "Version number must be a constant number");
3859 /* Make copy of idop so we don't free it twice */
3860 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3862 /* Fake up a method call to VERSION */
3863 meth = newSVpvs_share("VERSION");
3864 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3865 append_elem(OP_LIST,
3866 prepend_elem(OP_LIST, pack, list(version)),
3867 newSVOP(OP_METHOD_NAMED, 0, meth)));
3871 /* Fake up an import/unimport */
3872 if (arg && arg->op_type == OP_STUB) {
3874 op_getmad(arg,pegop,'S');
3875 imop = arg; /* no import on explicit () */
3877 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
3878 imop = NULL; /* use 5.0; */
3880 idop->op_private |= OPpCONST_NOVER;
3886 op_getmad(arg,pegop,'A');
3888 /* Make copy of idop so we don't free it twice */
3889 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3891 /* Fake up a method call to import/unimport */
3893 ? newSVpvs_share("import") : newSVpvs_share("unimport");
3894 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3895 append_elem(OP_LIST,
3896 prepend_elem(OP_LIST, pack, list(arg)),
3897 newSVOP(OP_METHOD_NAMED, 0, meth)));
3900 /* Fake up the BEGIN {}, which does its thing immediately. */
3902 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
3905 append_elem(OP_LINESEQ,
3906 append_elem(OP_LINESEQ,
3907 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
3908 newSTATEOP(0, NULL, veop)),
3909 newSTATEOP(0, NULL, imop) ));
3911 /* The "did you use incorrect case?" warning used to be here.
3912 * The problem is that on case-insensitive filesystems one
3913 * might get false positives for "use" (and "require"):
3914 * "use Strict" or "require CARP" will work. This causes
3915 * portability problems for the script: in case-strict
3916 * filesystems the script will stop working.
3918 * The "incorrect case" warning checked whether "use Foo"
3919 * imported "Foo" to your namespace, but that is wrong, too:
3920 * there is no requirement nor promise in the language that
3921 * a Foo.pm should or would contain anything in package "Foo".
3923 * There is very little Configure-wise that can be done, either:
3924 * the case-sensitivity of the build filesystem of Perl does not
3925 * help in guessing the case-sensitivity of the runtime environment.
3928 PL_hints |= HINT_BLOCK_SCOPE;
3929 PL_parser->copline = NOLINE;
3930 PL_parser->expect = XSTATE;
3931 PL_cop_seqmax++; /* Purely for B::*'s benefit */
3934 if (!PL_madskills) {
3935 /* FIXME - don't allocate pegop if !PL_madskills */
3944 =head1 Embedding Functions
3946 =for apidoc load_module
3948 Loads the module whose name is pointed to by the string part of name.
3949 Note that the actual module name, not its filename, should be given.
3950 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
3951 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
3952 (or 0 for no flags). ver, if specified, provides version semantics
3953 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
3954 arguments can be used to specify arguments to the module's import()
3955 method, similar to C<use Foo::Bar VERSION LIST>. They must be
3956 terminated with a final NULL pointer. Note that this list can only
3957 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
3958 Otherwise at least a single NULL pointer to designate the default
3959 import list is required.
3964 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3968 PERL_ARGS_ASSERT_LOAD_MODULE;
3970 va_start(args, ver);
3971 vload_module(flags, name, ver, &args);
3975 #ifdef PERL_IMPLICIT_CONTEXT
3977 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3981 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
3982 va_start(args, ver);
3983 vload_module(flags, name, ver, &args);
3989 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3993 OP * const modname = newSVOP(OP_CONST, 0, name);
3995 PERL_ARGS_ASSERT_VLOAD_MODULE;
3997 modname->op_private |= OPpCONST_BARE;
3999 veop = newSVOP(OP_CONST, 0, ver);
4003 if (flags & PERL_LOADMOD_NOIMPORT) {
4004 imop = sawparens(newNULLLIST());
4006 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
4007 imop = va_arg(*args, OP*);
4012 sv = va_arg(*args, SV*);
4014 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
4015 sv = va_arg(*args, SV*);
4019 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
4020 * that it has a PL_parser to play with while doing that, and also
4021 * that it doesn't mess with any existing parser, by creating a tmp
4022 * new parser with lex_start(). This won't actually be used for much,
4023 * since pp_require() will create another parser for the real work. */
4026 SAVEVPTR(PL_curcop);
4027 lex_start(NULL, NULL, FALSE);
4028 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
4029 veop, modname, imop);
4034 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
4040 PERL_ARGS_ASSERT_DOFILE;
4042 if (!force_builtin) {
4043 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
4044 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
4045 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
4046 gv = gvp ? *gvp : NULL;
4050 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
4051 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
4052 append_elem(OP_LIST, term,
4053 scalar(newUNOP(OP_RV2CV, 0,
4054 newGVOP(OP_GV, 0, gv))))));
4057 doop = newUNOP(OP_DOFILE, 0, scalar(term));
4063 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
4065 return newBINOP(OP_LSLICE, flags,
4066 list(force_list(subscript)),
4067 list(force_list(listval)) );
4071 S_is_list_assignment(pTHX_ register const OP *o)
4079 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
4080 o = cUNOPo->op_first;
4082 flags = o->op_flags;
4084 if (type == OP_COND_EXPR) {
4085 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
4086 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
4091 yyerror("Assignment to both a list and a scalar");
4095 if (type == OP_LIST &&
4096 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
4097 o->op_private & OPpLVAL_INTRO)
4100 if (type == OP_LIST || flags & OPf_PARENS ||
4101 type == OP_RV2AV || type == OP_RV2HV ||
4102 type == OP_ASLICE || type == OP_HSLICE)
4105 if (type == OP_PADAV || type == OP_PADHV)
4108 if (type == OP_RV2SV)
4115 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
4121 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
4122 return newLOGOP(optype, 0,
4123 mod(scalar(left), optype),
4124 newUNOP(OP_SASSIGN, 0, scalar(right)));
4127 return newBINOP(optype, OPf_STACKED,
4128 mod(scalar(left), optype), scalar(right));
4132 if (is_list_assignment(left)) {
4133 static const char no_list_state[] = "Initialization of state variables"
4134 " in list context currently forbidden";
4136 bool maybe_common_vars = TRUE;
4139 /* Grandfathering $[ assignment here. Bletch.*/
4140 /* Only simple assignments like C<< ($[) = 1 >> are allowed */
4141 PL_eval_start = (left->op_type == OP_CONST) ? right : NULL;
4142 left = mod(left, OP_AASSIGN);
4145 else if (left->op_type == OP_CONST) {
4147 /* Result of assignment is always 1 (or we'd be dead already) */
4148 return newSVOP(OP_CONST, 0, newSViv(1));
4150 curop = list(force_list(left));
4151 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
4152 o->op_private = (U8)(0 | (flags >> 8));
4154 if ((left->op_type == OP_LIST
4155 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
4157 OP* lop = ((LISTOP*)left)->op_first;
4158 maybe_common_vars = FALSE;
4160 if (lop->op_type == OP_PADSV ||
4161 lop->op_type == OP_PADAV ||
4162 lop->op_type == OP_PADHV ||
4163 lop->op_type == OP_PADANY) {
4164 if (!(lop->op_private & OPpLVAL_INTRO))
4165 maybe_common_vars = TRUE;
4167 if (lop->op_private & OPpPAD_STATE) {
4168 if (left->op_private & OPpLVAL_INTRO) {
4169 /* Each variable in state($a, $b, $c) = ... */
4172 /* Each state variable in
4173 (state $a, my $b, our $c, $d, undef) = ... */
4175 yyerror(no_list_state);
4177 /* Each my variable in
4178 (state $a, my $b, our $c, $d, undef) = ... */
4180 } else if (lop->op_type == OP_UNDEF ||
4181 lop->op_type == OP_PUSHMARK) {
4182 /* undef may be interesting in
4183 (state $a, undef, state $c) */
4185 /* Other ops in the list. */
4186 maybe_common_vars = TRUE;
4188 lop = lop->op_sibling;
4191 else if ((left->op_private & OPpLVAL_INTRO)
4192 && ( left->op_type == OP_PADSV
4193 || left->op_type == OP_PADAV
4194 || left->op_type == OP_PADHV
4195 || left->op_type == OP_PADANY))
4197 maybe_common_vars = FALSE;
4198 if (left->op_private & OPpPAD_STATE) {
4199 /* All single variable list context state assignments, hence
4209 yyerror(no_list_state);
4213 /* PL_generation sorcery:
4214 * an assignment like ($a,$b) = ($c,$d) is easier than
4215 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
4216 * To detect whether there are common vars, the global var
4217 * PL_generation is incremented for each assign op we compile.
4218 * Then, while compiling the assign op, we run through all the
4219 * variables on both sides of the assignment, setting a spare slot
4220 * in each of them to PL_generation. If any of them already have
4221 * that value, we know we've got commonality. We could use a
4222 * single bit marker, but then we'd have to make 2 passes, first
4223 * to clear the flag, then to test and set it. To find somewhere
4224 * to store these values, evil chicanery is done with SvUVX().
4227 if (maybe_common_vars) {
4230 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
4231 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
4232 if (curop->op_type == OP_GV) {
4233 GV *gv = cGVOPx_gv(curop);
4235 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4237 GvASSIGN_GENERATION_set(gv, PL_generation);
4239 else if (curop->op_type == OP_PADSV ||
4240 curop->op_type == OP_PADAV ||
4241 curop->op_type == OP_PADHV ||
4242 curop->op_type == OP_PADANY)
4244 if (PAD_COMPNAME_GEN(curop->op_targ)
4245 == (STRLEN)PL_generation)
4247 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
4250 else if (curop->op_type == OP_RV2CV)
4252 else if (curop->op_type == OP_RV2SV ||
4253 curop->op_type == OP_RV2AV ||
4254 curop->op_type == OP_RV2HV ||
4255 curop->op_type == OP_RV2GV) {
4256 if (lastop->op_type != OP_GV) /* funny deref? */
4259 else if (curop->op_type == OP_PUSHRE) {
4261 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
4262 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
4264 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4266 GvASSIGN_GENERATION_set(gv, PL_generation);
4270 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
4273 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4275 GvASSIGN_GENERATION_set(gv, PL_generation);
4285 o->op_private |= OPpASSIGN_COMMON;
4288 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
4289 OP* tmpop = ((LISTOP*)right)->op_first;
4290 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
4291 PMOP * const pm = (PMOP*)tmpop;
4292 if (left->op_type == OP_RV2AV &&
4293 !(left->op_private & OPpLVAL_INTRO) &&
4294 !(o->op_private & OPpASSIGN_COMMON) )
4296 tmpop = ((UNOP*)left)->op_first;
4297 if (tmpop->op_type == OP_GV
4299 && !pm->op_pmreplrootu.op_pmtargetoff
4301 && !pm->op_pmreplrootu.op_pmtargetgv
4305 pm->op_pmreplrootu.op_pmtargetoff
4306 = cPADOPx(tmpop)->op_padix;
4307 cPADOPx(tmpop)->op_padix = 0; /* steal it */
4309 pm->op_pmreplrootu.op_pmtargetgv
4310 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
4311 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
4313 pm->op_pmflags |= PMf_ONCE;
4314 tmpop = cUNOPo->op_first; /* to list (nulled) */
4315 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
4316 tmpop->op_sibling = NULL; /* don't free split */
4317 right->op_next = tmpop->op_next; /* fix starting loc */
4318 op_free(o); /* blow off assign */
4319 right->op_flags &= ~OPf_WANT;
4320 /* "I don't know and I don't care." */
4325 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
4326 ((LISTOP*)right)->op_last->op_type == OP_CONST)
4328 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
4329 if (SvIOK(sv) && SvIVX(sv) == 0)
4330 sv_setiv(sv, PL_modcount+1);
4338 right = newOP(OP_UNDEF, 0);
4339 if (right->op_type == OP_READLINE) {
4340 right->op_flags |= OPf_STACKED;
4341 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
4344 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
4345 o = newBINOP(OP_SASSIGN, flags,
4346 scalar(right), mod(scalar(left), OP_SASSIGN) );
4350 if (!PL_madskills) { /* assignment to $[ is ignored when making a mad dump */
4351 deprecate("assignment to $[");
4353 o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling)));
4354 o->op_private |= OPpCONST_ARYBASE;
4362 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
4365 const U32 seq = intro_my();
4368 NewOp(1101, cop, 1, COP);
4369 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
4370 cop->op_type = OP_DBSTATE;
4371 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
4374 cop->op_type = OP_NEXTSTATE;
4375 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
4377 cop->op_flags = (U8)flags;
4378 CopHINTS_set(cop, PL_hints);
4380 cop->op_private |= NATIVE_HINTS;
4382 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
4383 cop->op_next = (OP*)cop;
4386 /* CopARYBASE is now "virtual", in that it's stored as a flag bit in
4387 CopHINTS and a possible value in cop_hints_hash, so no need to copy it.
4389 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
4390 cop->cop_hints_hash = PL_curcop->cop_hints_hash;
4391 if (cop->cop_hints_hash) {
4393 cop->cop_hints_hash->refcounted_he_refcnt++;
4394 HINTS_REFCNT_UNLOCK;
4398 = Perl_store_cop_label(aTHX_ cop->cop_hints_hash, label);
4400 PL_hints |= HINT_BLOCK_SCOPE;
4401 /* It seems that we need to defer freeing this pointer, as other parts
4402 of the grammar end up wanting to copy it after this op has been
4407 if (PL_parser && PL_parser->copline == NOLINE)
4408 CopLINE_set(cop, CopLINE(PL_curcop));
4410 CopLINE_set(cop, PL_parser->copline);
4412 PL_parser->copline = NOLINE;
4415 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
4417 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
4419 CopSTASH_set(cop, PL_curstash);
4421 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
4422 /* this line can have a breakpoint - store the cop in IV */
4423 AV *av = CopFILEAVx(PL_curcop);
4425 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
4426 if (svp && *svp != &PL_sv_undef ) {
4427 (void)SvIOK_on(*svp);
4428 SvIV_set(*svp, PTR2IV(cop));
4433 if (flags & OPf_SPECIAL)
4435 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
4440 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
4444 PERL_ARGS_ASSERT_NEWLOGOP;
4446 return new_logop(type, flags, &first, &other);
4450 S_search_const(pTHX_ OP *o)
4452 PERL_ARGS_ASSERT_SEARCH_CONST;
4454 switch (o->op_type) {
4458 if (o->op_flags & OPf_KIDS)
4459 return search_const(cUNOPo->op_first);
4466 if (!(o->op_flags & OPf_KIDS))
4468 kid = cLISTOPo->op_first;
4470 switch (kid->op_type) {
4474 kid = kid->op_sibling;
4477 if (kid != cLISTOPo->op_last)
4483 kid = cLISTOPo->op_last;
4485 return search_const(kid);
4493 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
4501 int prepend_not = 0;
4503 PERL_ARGS_ASSERT_NEW_LOGOP;
4508 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
4509 return newBINOP(type, flags, scalar(first), scalar(other));
4511 scalarboolean(first);
4512 /* optimize AND and OR ops that have NOTs as children */
4513 if (first->op_type == OP_NOT
4514 && (first->op_flags & OPf_KIDS)
4515 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
4516 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
4518 if (type == OP_AND || type == OP_OR) {
4524 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
4526 prepend_not = 1; /* prepend a NOT op later */
4530 /* search for a constant op that could let us fold the test */
4531 if ((cstop = search_const(first))) {
4532 if (cstop->op_private & OPpCONST_STRICT)
4533 no_bareword_allowed(cstop);
4534 else if ((cstop->op_private & OPpCONST_BARE) && ckWARN(WARN_BAREWORD))
4535 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
4536 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
4537 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
4538 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
4540 if (other->op_type == OP_CONST)
4541 other->op_private |= OPpCONST_SHORTCIRCUIT;
4543 OP *newop = newUNOP(OP_NULL, 0, other);
4544 op_getmad(first, newop, '1');
4545 newop->op_targ = type; /* set "was" field */
4549 if (other->op_type == OP_LEAVE)
4550 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
4554 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
4555 const OP *o2 = other;
4556 if ( ! (o2->op_type == OP_LIST
4557 && (( o2 = cUNOPx(o2)->op_first))
4558 && o2->op_type == OP_PUSHMARK
4559 && (( o2 = o2->op_sibling)) )
4562 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
4563 || o2->op_type == OP_PADHV)
4564 && o2->op_private & OPpLVAL_INTRO
4565 && !(o2->op_private & OPpPAD_STATE)
4566 && ckWARN(WARN_DEPRECATED))
4568 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4569 "Deprecated use of my() in false conditional");
4573 if (first->op_type == OP_CONST)
4574 first->op_private |= OPpCONST_SHORTCIRCUIT;
4576 first = newUNOP(OP_NULL, 0, first);
4577 op_getmad(other, first, '2');
4578 first->op_targ = type; /* set "was" field */
4585 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
4586 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
4588 const OP * const k1 = ((UNOP*)first)->op_first;
4589 const OP * const k2 = k1->op_sibling;
4591 switch (first->op_type)
4594 if (k2 && k2->op_type == OP_READLINE
4595 && (k2->op_flags & OPf_STACKED)
4596 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4598 warnop = k2->op_type;
4603 if (k1->op_type == OP_READDIR
4604 || k1->op_type == OP_GLOB
4605 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4606 || k1->op_type == OP_EACH)
4608 warnop = ((k1->op_type == OP_NULL)
4609 ? (OPCODE)k1->op_targ : k1->op_type);
4614 const line_t oldline = CopLINE(PL_curcop);
4615 CopLINE_set(PL_curcop, PL_parser->copline);
4616 Perl_warner(aTHX_ packWARN(WARN_MISC),
4617 "Value of %s%s can be \"0\"; test with defined()",
4619 ((warnop == OP_READLINE || warnop == OP_GLOB)
4620 ? " construct" : "() operator"));
4621 CopLINE_set(PL_curcop, oldline);
4628 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
4629 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
4631 NewOp(1101, logop, 1, LOGOP);
4633 logop->op_type = (OPCODE)type;
4634 logop->op_ppaddr = PL_ppaddr[type];
4635 logop->op_first = first;
4636 logop->op_flags = (U8)(flags | OPf_KIDS);
4637 logop->op_other = LINKLIST(other);
4638 logop->op_private = (U8)(1 | (flags >> 8));
4640 /* establish postfix order */
4641 logop->op_next = LINKLIST(first);
4642 first->op_next = (OP*)logop;
4643 first->op_sibling = other;
4645 CHECKOP(type,logop);
4647 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
4654 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
4662 PERL_ARGS_ASSERT_NEWCONDOP;
4665 return newLOGOP(OP_AND, 0, first, trueop);
4667 return newLOGOP(OP_OR, 0, first, falseop);
4669 scalarboolean(first);
4670 if ((cstop = search_const(first))) {
4671 /* Left or right arm of the conditional? */
4672 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
4673 OP *live = left ? trueop : falseop;
4674 OP *const dead = left ? falseop : trueop;
4675 if (cstop->op_private & OPpCONST_BARE &&
4676 cstop->op_private & OPpCONST_STRICT) {
4677 no_bareword_allowed(cstop);
4680 /* This is all dead code when PERL_MAD is not defined. */
4681 live = newUNOP(OP_NULL, 0, live);
4682 op_getmad(first, live, 'C');
4683 op_getmad(dead, live, left ? 'e' : 't');
4688 if (live->op_type == OP_LEAVE)
4689 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
4692 NewOp(1101, logop, 1, LOGOP);
4693 logop->op_type = OP_COND_EXPR;
4694 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
4695 logop->op_first = first;
4696 logop->op_flags = (U8)(flags | OPf_KIDS);
4697 logop->op_private = (U8)(1 | (flags >> 8));
4698 logop->op_other = LINKLIST(trueop);
4699 logop->op_next = LINKLIST(falseop);
4701 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
4704 /* establish postfix order */
4705 start = LINKLIST(first);
4706 first->op_next = (OP*)logop;
4708 first->op_sibling = trueop;
4709 trueop->op_sibling = falseop;
4710 o = newUNOP(OP_NULL, 0, (OP*)logop);
4712 trueop->op_next = falseop->op_next = o;
4719 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
4728 PERL_ARGS_ASSERT_NEWRANGE;
4730 NewOp(1101, range, 1, LOGOP);
4732 range->op_type = OP_RANGE;
4733 range->op_ppaddr = PL_ppaddr[OP_RANGE];
4734 range->op_first = left;
4735 range->op_flags = OPf_KIDS;
4736 leftstart = LINKLIST(left);
4737 range->op_other = LINKLIST(right);
4738 range->op_private = (U8)(1 | (flags >> 8));
4740 left->op_sibling = right;
4742 range->op_next = (OP*)range;
4743 flip = newUNOP(OP_FLIP, flags, (OP*)range);
4744 flop = newUNOP(OP_FLOP, 0, flip);
4745 o = newUNOP(OP_NULL, 0, flop);
4747 range->op_next = leftstart;
4749 left->op_next = flip;
4750 right->op_next = flop;
4752 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4753 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
4754 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4755 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
4757 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4758 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4761 if (!flip->op_private || !flop->op_private)
4762 linklist(o); /* blow off optimizer unless constant */
4768 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
4773 const bool once = block && block->op_flags & OPf_SPECIAL &&
4774 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
4776 PERL_UNUSED_ARG(debuggable);
4779 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
4780 return block; /* do {} while 0 does once */
4781 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4782 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4783 expr = newUNOP(OP_DEFINED, 0,
4784 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4785 } else if (expr->op_flags & OPf_KIDS) {
4786 const OP * const k1 = ((UNOP*)expr)->op_first;
4787 const OP * const k2 = k1 ? k1->op_sibling : NULL;
4788 switch (expr->op_type) {
4790 if (k2 && k2->op_type == OP_READLINE
4791 && (k2->op_flags & OPf_STACKED)
4792 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4793 expr = newUNOP(OP_DEFINED, 0, expr);
4797 if (k1 && (k1->op_type == OP_READDIR
4798 || k1->op_type == OP_GLOB
4799 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4800 || k1->op_type == OP_EACH))
4801 expr = newUNOP(OP_DEFINED, 0, expr);
4807 /* if block is null, the next append_elem() would put UNSTACK, a scalar
4808 * op, in listop. This is wrong. [perl #27024] */
4810 block = newOP(OP_NULL, 0);
4811 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
4812 o = new_logop(OP_AND, 0, &expr, &listop);
4815 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
4817 if (once && o != listop)
4818 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
4821 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
4823 o->op_flags |= flags;
4825 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
4830 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32
4831 whileline, OP *expr, OP *block, OP *cont, I32 has_my)
4840 PERL_UNUSED_ARG(debuggable);
4843 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4844 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4845 expr = newUNOP(OP_DEFINED, 0,
4846 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4847 } else if (expr->op_flags & OPf_KIDS) {
4848 const OP * const k1 = ((UNOP*)expr)->op_first;
4849 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
4850 switch (expr->op_type) {
4852 if (k2 && k2->op_type == OP_READLINE
4853 && (k2->op_flags & OPf_STACKED)
4854 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4855 expr = newUNOP(OP_DEFINED, 0, expr);
4859 if (k1 && (k1->op_type == OP_READDIR
4860 || k1->op_type == OP_GLOB
4861 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4862 || k1->op_type == OP_EACH))
4863 expr = newUNOP(OP_DEFINED, 0, expr);
4870 block = newOP(OP_NULL, 0);
4871 else if (cont || has_my) {
4872 block = scope(block);
4876 next = LINKLIST(cont);
4879 OP * const unstack = newOP(OP_UNSTACK, 0);
4882 cont = append_elem(OP_LINESEQ, cont, unstack);
4886 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
4888 redo = LINKLIST(listop);
4891 PL_parser->copline = (line_t)whileline;
4893 o = new_logop(OP_AND, 0, &expr, &listop);
4894 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
4895 op_free(expr); /* oops, it's a while (0) */
4897 return NULL; /* listop already freed by new_logop */
4900 ((LISTOP*)listop)->op_last->op_next =
4901 (o == listop ? redo : LINKLIST(o));
4907 NewOp(1101,loop,1,LOOP);
4908 loop->op_type = OP_ENTERLOOP;
4909 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
4910 loop->op_private = 0;
4911 loop->op_next = (OP*)loop;
4914 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
4916 loop->op_redoop = redo;
4917 loop->op_lastop = o;
4918 o->op_private |= loopflags;
4921 loop->op_nextop = next;
4923 loop->op_nextop = o;
4925 o->op_flags |= flags;
4926 o->op_private |= (flags >> 8);
4931 Perl_newFOROP(pTHX_ I32 flags, char *label, line_t forline, OP *sv, OP *expr, OP *block, OP *cont)
4936 PADOFFSET padoff = 0;
4941 PERL_ARGS_ASSERT_NEWFOROP;
4944 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
4945 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
4946 sv->op_type = OP_RV2GV;
4947 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
4949 /* The op_type check is needed to prevent a possible segfault
4950 * if the loop variable is undeclared and 'strict vars' is in
4951 * effect. This is illegal but is nonetheless parsed, so we
4952 * may reach this point with an OP_CONST where we're expecting
4955 if (cUNOPx(sv)->op_first->op_type == OP_GV
4956 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
4957 iterpflags |= OPpITER_DEF;
4959 else if (sv->op_type == OP_PADSV) { /* private variable */
4960 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
4961 padoff = sv->op_targ;
4971 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
4973 SV *const namesv = PAD_COMPNAME_SV(padoff);
4975 const char *const name = SvPV_const(namesv, len);
4977 if (len == 2 && name[0] == '$' && name[1] == '_')
4978 iterpflags |= OPpITER_DEF;
4982 const PADOFFSET offset = pad_findmy("$_");
4983 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
4984 sv = newGVOP(OP_GV, 0, PL_defgv);
4989 iterpflags |= OPpITER_DEF;
4991 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4992 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4993 iterflags |= OPf_STACKED;
4995 else if (expr->op_type == OP_NULL &&
4996 (expr->op_flags & OPf_KIDS) &&
4997 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
4999 /* Basically turn for($x..$y) into the same as for($x,$y), but we
5000 * set the STACKED flag to indicate that these values are to be
5001 * treated as min/max values by 'pp_iterinit'.
5003 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
5004 LOGOP* const range = (LOGOP*) flip->op_first;
5005 OP* const left = range->op_first;
5006 OP* const right = left->op_sibling;
5009 range->op_flags &= ~OPf_KIDS;
5010 range->op_first = NULL;
5012 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
5013 listop->op_first->op_next = range->op_next;
5014 left->op_next = range->op_other;
5015 right->op_next = (OP*)listop;
5016 listop->op_next = listop->op_first;
5019 op_getmad(expr,(OP*)listop,'O');
5023 expr = (OP*)(listop);
5025 iterflags |= OPf_STACKED;
5028 expr = mod(force_list(expr), OP_GREPSTART);
5031 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
5032 append_elem(OP_LIST, expr, scalar(sv))));
5033 assert(!loop->op_next);
5034 /* for my $x () sets OPpLVAL_INTRO;
5035 * for our $x () sets OPpOUR_INTRO */
5036 loop->op_private = (U8)iterpflags;
5037 #ifdef PL_OP_SLAB_ALLOC
5040 NewOp(1234,tmp,1,LOOP);
5041 Copy(loop,tmp,1,LISTOP);
5042 S_op_destroy(aTHX_ (OP*)loop);
5046 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
5048 loop->op_targ = padoff;
5049 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont, 0);
5051 op_getmad(madsv, (OP*)loop, 'v');
5052 PL_parser->copline = forline;
5053 return newSTATEOP(0, label, wop);
5057 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
5062 PERL_ARGS_ASSERT_NEWLOOPEX;
5064 if (type != OP_GOTO || label->op_type == OP_CONST) {
5065 /* "last()" means "last" */
5066 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
5067 o = newOP(type, OPf_SPECIAL);
5069 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
5070 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
5074 op_getmad(label,o,'L');
5080 /* Check whether it's going to be a goto &function */
5081 if (label->op_type == OP_ENTERSUB
5082 && !(label->op_flags & OPf_STACKED))
5083 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
5084 o = newUNOP(type, OPf_STACKED, label);
5086 PL_hints |= HINT_BLOCK_SCOPE;
5090 /* if the condition is a literal array or hash
5091 (or @{ ... } etc), make a reference to it.
5094 S_ref_array_or_hash(pTHX_ OP *cond)
5097 && (cond->op_type == OP_RV2AV
5098 || cond->op_type == OP_PADAV
5099 || cond->op_type == OP_RV2HV
5100 || cond->op_type == OP_PADHV))
5102 return newUNOP(OP_REFGEN,
5103 0, mod(cond, OP_REFGEN));
5109 /* These construct the optree fragments representing given()
5112 entergiven and enterwhen are LOGOPs; the op_other pointer
5113 points up to the associated leave op. We need this so we
5114 can put it in the context and make break/continue work.
5115 (Also, of course, pp_enterwhen will jump straight to
5116 op_other if the match fails.)
5120 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
5121 I32 enter_opcode, I32 leave_opcode,
5122 PADOFFSET entertarg)
5128 PERL_ARGS_ASSERT_NEWGIVWHENOP;
5130 NewOp(1101, enterop, 1, LOGOP);
5131 enterop->op_type = (Optype)enter_opcode;
5132 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
5133 enterop->op_flags = (U8) OPf_KIDS;
5134 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
5135 enterop->op_private = 0;
5137 o = newUNOP(leave_opcode, 0, (OP *) enterop);
5140 enterop->op_first = scalar(cond);
5141 cond->op_sibling = block;
5143 o->op_next = LINKLIST(cond);
5144 cond->op_next = (OP *) enterop;
5147 /* This is a default {} block */
5148 enterop->op_first = block;
5149 enterop->op_flags |= OPf_SPECIAL;
5151 o->op_next = (OP *) enterop;
5154 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
5155 entergiven and enterwhen both
5158 enterop->op_next = LINKLIST(block);
5159 block->op_next = enterop->op_other = o;
5164 /* Does this look like a boolean operation? For these purposes
5165 a boolean operation is:
5166 - a subroutine call [*]
5167 - a logical connective
5168 - a comparison operator
5169 - a filetest operator, with the exception of -s -M -A -C
5170 - defined(), exists() or eof()
5171 - /$re/ or $foo =~ /$re/
5173 [*] possibly surprising
5176 S_looks_like_bool(pTHX_ const OP *o)
5180 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
5182 switch(o->op_type) {
5185 return looks_like_bool(cLOGOPo->op_first);
5189 looks_like_bool(cLOGOPo->op_first)
5190 && looks_like_bool(cLOGOPo->op_first->op_sibling));
5194 o->op_flags & OPf_KIDS
5195 && looks_like_bool(cUNOPo->op_first));
5199 case OP_NOT: case OP_XOR:
5201 case OP_EQ: case OP_NE: case OP_LT:
5202 case OP_GT: case OP_LE: case OP_GE:
5204 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
5205 case OP_I_GT: case OP_I_LE: case OP_I_GE:
5207 case OP_SEQ: case OP_SNE: case OP_SLT:
5208 case OP_SGT: case OP_SLE: case OP_SGE:
5212 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
5213 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
5214 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
5215 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
5216 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
5217 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
5218 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
5219 case OP_FTTEXT: case OP_FTBINARY:
5221 case OP_DEFINED: case OP_EXISTS:
5222 case OP_MATCH: case OP_EOF:
5229 /* Detect comparisons that have been optimized away */
5230 if (cSVOPo->op_sv == &PL_sv_yes
5231 || cSVOPo->op_sv == &PL_sv_no)
5244 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
5247 PERL_ARGS_ASSERT_NEWGIVENOP;
5248 return newGIVWHENOP(
5249 ref_array_or_hash(cond),
5251 OP_ENTERGIVEN, OP_LEAVEGIVEN,
5255 /* If cond is null, this is a default {} block */
5257 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
5259 const bool cond_llb = (!cond || looks_like_bool(cond));
5262 PERL_ARGS_ASSERT_NEWWHENOP;
5267 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
5269 scalar(ref_array_or_hash(cond)));
5272 return newGIVWHENOP(
5274 append_elem(block->op_type, block, newOP(OP_BREAK, OPf_SPECIAL)),
5275 OP_ENTERWHEN, OP_LEAVEWHEN, 0);
5279 =for apidoc cv_undef
5281 Clear out all the active components of a CV. This can happen either
5282 by an explicit C<undef &foo>, or by the reference count going to zero.
5283 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
5284 children can still follow the full lexical scope chain.
5290 Perl_cv_undef(pTHX_ CV *cv)
5294 PERL_ARGS_ASSERT_CV_UNDEF;
5296 DEBUG_X(PerlIO_printf(Perl_debug_log,
5297 "CV undef: cv=0x%"UVxf" comppad=0x%"UVxf"\n",
5298 PTR2UV(cv), PTR2UV(PL_comppad))
5302 if (CvFILE(cv) && !CvISXSUB(cv)) {
5303 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
5304 Safefree(CvFILE(cv));
5309 if (!CvISXSUB(cv) && CvROOT(cv)) {
5310 if (SvTYPE(cv) == SVt_PVCV && CvDEPTH(cv))
5311 Perl_croak(aTHX_ "Can't undef active subroutine");
5314 PAD_SAVE_SETNULLPAD();
5316 op_free(CvROOT(cv));
5321 SvPOK_off(MUTABLE_SV(cv)); /* forget prototype */
5326 /* remove CvOUTSIDE unless this is an undef rather than a free */
5327 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
5328 if (!CvWEAKOUTSIDE(cv))
5329 SvREFCNT_dec(CvOUTSIDE(cv));
5330 CvOUTSIDE(cv) = NULL;
5333 SvREFCNT_dec(MUTABLE_SV(CvXSUBANY(cv).any_ptr));
5336 if (CvISXSUB(cv) && CvXSUB(cv)) {
5339 /* delete all flags except WEAKOUTSIDE */
5340 CvFLAGS(cv) &= CVf_WEAKOUTSIDE;
5344 Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p,
5347 PERL_ARGS_ASSERT_CV_CKPROTO_LEN;
5349 /* Can't just use a strcmp on the prototype, as CONSTSUBs "cheat" by
5350 relying on SvCUR, and doubling up the buffer to hold CvFILE(). */
5351 if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */
5352 || (p && (len != SvCUR(cv) /* Not the same length. */
5353 || memNE(p, SvPVX_const(cv), len))))
5354 && ckWARN_d(WARN_PROTOTYPE)) {
5355 SV* const msg = sv_newmortal();
5359 gv_efullname3(name = sv_newmortal(), gv, NULL);
5360 sv_setpvs(msg, "Prototype mismatch:");
5362 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
5364 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv));
5366 sv_catpvs(msg, ": none");
5367 sv_catpvs(msg, " vs ");
5369 Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p);
5371 sv_catpvs(msg, "none");
5372 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
5376 static void const_sv_xsub(pTHX_ CV* cv);
5380 =head1 Optree Manipulation Functions
5382 =for apidoc cv_const_sv
5384 If C<cv> is a constant sub eligible for inlining. returns the constant
5385 value returned by the sub. Otherwise, returns NULL.
5387 Constant subs can be created with C<newCONSTSUB> or as described in
5388 L<perlsub/"Constant Functions">.
5393 Perl_cv_const_sv(pTHX_ const CV *const cv)
5395 PERL_UNUSED_CONTEXT;
5398 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
5400 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
5403 /* op_const_sv: examine an optree to determine whether it's in-lineable.
5404 * Can be called in 3 ways:
5407 * look for a single OP_CONST with attached value: return the value
5409 * cv && CvCLONE(cv) && !CvCONST(cv)
5411 * examine the clone prototype, and if contains only a single
5412 * OP_CONST referencing a pad const, or a single PADSV referencing
5413 * an outer lexical, return a non-zero value to indicate the CV is
5414 * a candidate for "constizing" at clone time
5418 * We have just cloned an anon prototype that was marked as a const
5419 * candidiate. Try to grab the current value, and in the case of
5420 * PADSV, ignore it if it has multiple references. Return the value.
5424 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
5435 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
5436 o = cLISTOPo->op_first->op_sibling;
5438 for (; o; o = o->op_next) {
5439 const OPCODE type = o->op_type;
5441 if (sv && o->op_next == o)
5443 if (o->op_next != o) {
5444 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
5446 if (type == OP_DBSTATE)
5449 if (type == OP_LEAVESUB || type == OP_RETURN)
5453 if (type == OP_CONST && cSVOPo->op_sv)
5455 else if (cv && type == OP_CONST) {
5456 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5460 else if (cv && type == OP_PADSV) {
5461 if (CvCONST(cv)) { /* newly cloned anon */
5462 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5463 /* the candidate should have 1 ref from this pad and 1 ref
5464 * from the parent */
5465 if (!sv || SvREFCNT(sv) != 2)
5472 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
5473 sv = &PL_sv_undef; /* an arbitrary non-null value */
5488 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5491 /* This would be the return value, but the return cannot be reached. */
5492 OP* pegop = newOP(OP_NULL, 0);
5495 PERL_UNUSED_ARG(floor);
5505 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
5507 NORETURN_FUNCTION_END;
5512 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
5514 return Perl_newATTRSUB(aTHX_ floor, o, proto, NULL, block);
5518 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5524 register CV *cv = NULL;
5526 /* If the subroutine has no body, no attributes, and no builtin attributes
5527 then it's just a sub declaration, and we may be able to get away with
5528 storing with a placeholder scalar in the symbol table, rather than a
5529 full GV and CV. If anything is present then it will take a full CV to
5531 const I32 gv_fetch_flags
5532 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5534 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
5535 const char * const name = o ? SvPV_nolen_const(cSVOPo->op_sv) : NULL;
5539 assert(proto->op_type == OP_CONST);
5540 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
5546 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
5548 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
5549 SV * const sv = sv_newmortal();
5550 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
5551 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
5552 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
5553 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
5555 } else if (PL_curstash) {
5556 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
5559 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
5563 if (!PL_madskills) {
5572 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
5573 maximum a prototype before. */
5574 if (SvTYPE(gv) > SVt_NULL) {
5575 if (!SvPOK((const SV *)gv)
5576 && !(SvIOK((const SV *)gv) && SvIVX((const SV *)gv) == -1)
5577 && ckWARN_d(WARN_PROTOTYPE))
5579 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
5581 cv_ckproto_len((const CV *)gv, NULL, ps, ps_len);
5584 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
5586 sv_setiv(MUTABLE_SV(gv), -1);
5588 SvREFCNT_dec(PL_compcv);
5589 cv = PL_compcv = NULL;
5593 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
5595 if (!block || !ps || *ps || attrs
5596 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5598 || block->op_type == OP_NULL
5603 const_sv = op_const_sv(block, NULL);
5606 const bool exists = CvROOT(cv) || CvXSUB(cv);
5608 /* if the subroutine doesn't exist and wasn't pre-declared
5609 * with a prototype, assume it will be AUTOLOADed,
5610 * skipping the prototype check
5612 if (exists || SvPOK(cv))
5613 cv_ckproto_len(cv, gv, ps, ps_len);
5614 /* already defined (or promised)? */
5615 if (exists || GvASSUMECV(gv)) {
5618 || block->op_type == OP_NULL
5621 if (CvFLAGS(PL_compcv)) {
5622 /* might have had built-in attrs applied */
5623 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5625 /* just a "sub foo;" when &foo is already defined */
5626 SAVEFREESV(PL_compcv);
5631 && block->op_type != OP_NULL
5634 if (ckWARN(WARN_REDEFINE)
5636 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
5638 const line_t oldline = CopLINE(PL_curcop);
5639 if (PL_parser && PL_parser->copline != NOLINE)
5640 CopLINE_set(PL_curcop, PL_parser->copline);
5641 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5642 CvCONST(cv) ? "Constant subroutine %s redefined"
5643 : "Subroutine %s redefined", name);
5644 CopLINE_set(PL_curcop, oldline);
5647 if (!PL_minus_c) /* keep old one around for madskills */
5650 /* (PL_madskills unset in used file.) */
5658 SvREFCNT_inc_simple_void_NN(const_sv);
5660 assert(!CvROOT(cv) && !CvCONST(cv));
5661 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
5662 CvXSUBANY(cv).any_ptr = const_sv;
5663 CvXSUB(cv) = const_sv_xsub;
5669 cv = newCONSTSUB(NULL, name, const_sv);
5671 mro_method_changed_in( /* sub Foo::Bar () { 123 } */
5672 (CvGV(cv) && GvSTASH(CvGV(cv)))
5681 SvREFCNT_dec(PL_compcv);
5685 if (cv) { /* must reuse cv if autoloaded */
5686 /* transfer PL_compcv to cv */
5689 && block->op_type != OP_NULL
5693 CvFLAGS(cv) = CvFLAGS(PL_compcv);
5694 if (!CvWEAKOUTSIDE(cv))
5695 SvREFCNT_dec(CvOUTSIDE(cv));
5696 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
5697 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
5698 CvOUTSIDE(PL_compcv) = 0;
5699 CvPADLIST(cv) = CvPADLIST(PL_compcv);
5700 CvPADLIST(PL_compcv) = 0;
5701 /* inner references to PL_compcv must be fixed up ... */
5702 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
5703 if (PERLDB_INTER)/* Advice debugger on the new sub. */
5704 ++PL_sub_generation;
5707 /* Might have had built-in attributes applied -- propagate them. */
5708 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5710 /* ... before we throw it away */
5711 SvREFCNT_dec(PL_compcv);
5719 if (strEQ(name, "import")) {
5720 PL_formfeed = MUTABLE_SV(cv);
5721 Perl_warner(aTHX_ packWARN(WARN_VOID), "%lx\n", (long)cv);
5725 mro_method_changed_in(GvSTASH(gv)); /* sub Foo::bar { (shift)+1 } */
5730 CvFILE_set_from_cop(cv, PL_curcop);
5731 CvSTASH(cv) = PL_curstash;
5734 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
5735 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
5736 apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE);
5740 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
5742 if (PL_parser && PL_parser->error_count) {
5746 const char *s = strrchr(name, ':');
5748 if (strEQ(s, "BEGIN")) {
5749 const char not_safe[] =
5750 "BEGIN not safe after errors--compilation aborted";
5751 if (PL_in_eval & EVAL_KEEPERR)
5752 Perl_croak(aTHX_ not_safe);
5754 /* force display of errors found but not reported */
5755 sv_catpv(ERRSV, not_safe);
5756 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
5765 /* If we assign an optree to a PVCV, then we've defined a subroutine that
5766 the debugger could be able to set a breakpoint in, so signal to
5767 pp_entereval that it should not throw away any saved lines at scope
5770 PL_breakable_sub_gen++;
5772 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
5773 mod(scalarseq(block), OP_LEAVESUBLV));
5774 block->op_attached = 1;
5777 /* This makes sub {}; work as expected. */
5778 if (block->op_type == OP_STUB) {
5779 OP* const newblock = newSTATEOP(0, NULL, 0);
5781 op_getmad(block,newblock,'B');
5788 block->op_attached = 1;
5789 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
5791 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5792 OpREFCNT_set(CvROOT(cv), 1);
5793 CvSTART(cv) = LINKLIST(CvROOT(cv));
5794 CvROOT(cv)->op_next = 0;
5795 CALL_PEEP(CvSTART(cv));
5797 /* now that optimizer has done its work, adjust pad values */
5799 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
5802 assert(!CvCONST(cv));
5803 if (ps && !*ps && op_const_sv(block, cv))
5808 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
5809 SV * const sv = newSV(0);
5810 SV * const tmpstr = sv_newmortal();
5811 GV * const db_postponed = gv_fetchpvs("DB::postponed",
5812 GV_ADDMULTI, SVt_PVHV);
5815 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
5817 (long)PL_subline, (long)CopLINE(PL_curcop));
5818 gv_efullname3(tmpstr, gv, NULL);
5819 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
5820 SvCUR(tmpstr), sv, 0);
5821 hv = GvHVn(db_postponed);
5822 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) {
5823 CV * const pcv = GvCV(db_postponed);
5829 call_sv(MUTABLE_SV(pcv), G_DISCARD);
5834 if (name && ! (PL_parser && PL_parser->error_count))
5835 process_special_blocks(name, gv, cv);
5840 PL_parser->copline = NOLINE;
5846 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
5849 const char *const colon = strrchr(fullname,':');
5850 const char *const name = colon ? colon + 1 : fullname;
5852 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
5855 if (strEQ(name, "BEGIN")) {
5856 const I32 oldscope = PL_scopestack_ix;
5858 SAVECOPFILE(&PL_compiling);
5859 SAVECOPLINE(&PL_compiling);
5861 DEBUG_x( dump_sub(gv) );
5862 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
5863 GvCV(gv) = 0; /* cv has been hijacked */
5864 call_list(oldscope, PL_beginav);
5866 PL_curcop = &PL_compiling;
5867 CopHINTS_set(&PL_compiling, PL_hints);
5874 if strEQ(name, "END") {
5875 DEBUG_x( dump_sub(gv) );
5876 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
5879 } else if (*name == 'U') {
5880 if (strEQ(name, "UNITCHECK")) {
5881 /* It's never too late to run a unitcheck block */
5882 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
5886 } else if (*name == 'C') {
5887 if (strEQ(name, "CHECK")) {
5888 if (PL_main_start && ckWARN(WARN_VOID))
5889 Perl_warner(aTHX_ packWARN(WARN_VOID),
5890 "Too late to run CHECK block");
5891 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
5895 } else if (*name == 'I') {
5896 if (strEQ(name, "INIT")) {
5897 if (PL_main_start && ckWARN(WARN_VOID))
5898 Perl_warner(aTHX_ packWARN(WARN_VOID),
5899 "Too late to run INIT block");
5900 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
5906 DEBUG_x( dump_sub(gv) );
5907 GvCV(gv) = 0; /* cv has been hijacked */
5912 =for apidoc newCONSTSUB
5914 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
5915 eligible for inlining at compile-time.
5917 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
5918 which won't be called if used as a destructor, but will suppress the overhead
5919 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
5926 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
5931 const char *const file = CopFILE(PL_curcop);
5933 SV *const temp_sv = CopFILESV(PL_curcop);
5934 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
5939 if (IN_PERL_RUNTIME) {
5940 /* at runtime, it's not safe to manipulate PL_curcop: it may be
5941 * an op shared between threads. Use a non-shared COP for our
5943 SAVEVPTR(PL_curcop);
5944 PL_curcop = &PL_compiling;
5946 SAVECOPLINE(PL_curcop);
5947 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
5950 PL_hints &= ~HINT_BLOCK_SCOPE;
5953 SAVESPTR(PL_curstash);
5954 SAVECOPSTASH(PL_curcop);
5955 PL_curstash = stash;
5956 CopSTASH_set(PL_curcop,stash);
5959 /* file becomes the CvFILE. For an XS, it's supposed to be static storage,
5960 and so doesn't get free()d. (It's expected to be from the C pre-
5961 processor __FILE__ directive). But we need a dynamically allocated one,
5962 and we need it to get freed. */
5963 cv = newXS_flags(name, const_sv_xsub, file ? file : "", "",
5964 XS_DYNAMIC_FILENAME);
5965 CvXSUBANY(cv).any_ptr = sv;
5970 CopSTASH_free(PL_curcop);
5978 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
5979 const char *const filename, const char *const proto,
5982 CV *cv = newXS(name, subaddr, filename);
5984 PERL_ARGS_ASSERT_NEWXS_FLAGS;
5986 if (flags & XS_DYNAMIC_FILENAME) {
5987 /* We need to "make arrangements" (ie cheat) to ensure that the
5988 filename lasts as long as the PVCV we just created, but also doesn't
5990 STRLEN filename_len = strlen(filename);
5991 STRLEN proto_and_file_len = filename_len;
5992 char *proto_and_file;
5996 proto_len = strlen(proto);
5997 proto_and_file_len += proto_len;
5999 Newx(proto_and_file, proto_and_file_len + 1, char);
6000 Copy(proto, proto_and_file, proto_len, char);
6001 Copy(filename, proto_and_file + proto_len, filename_len + 1, char);
6004 proto_and_file = savepvn(filename, filename_len);
6007 /* This gets free()d. :-) */
6008 sv_usepvn_flags(MUTABLE_SV(cv), proto_and_file, proto_and_file_len,
6009 SV_HAS_TRAILING_NUL);
6011 /* This gives us the correct prototype, rather than one with the
6012 file name appended. */
6013 SvCUR_set(cv, proto_len);
6017 CvFILE(cv) = proto_and_file + proto_len;
6019 sv_setpv(MUTABLE_SV(cv), proto);
6025 =for apidoc U||newXS
6027 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
6028 static storage, as it is used directly as CvFILE(), without a copy being made.
6034 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
6037 GV * const gv = gv_fetchpv(name ? name :
6038 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
6039 GV_ADDMULTI, SVt_PVCV);
6042 PERL_ARGS_ASSERT_NEWXS;
6045 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
6047 if ((cv = (name ? GvCV(gv) : NULL))) {
6049 /* just a cached method */
6053 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
6054 /* already defined (or promised) */
6055 /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */
6056 if (ckWARN(WARN_REDEFINE)) {
6057 GV * const gvcv = CvGV(cv);
6059 HV * const stash = GvSTASH(gvcv);
6061 const char *redefined_name = HvNAME_get(stash);
6062 if ( strEQ(redefined_name,"autouse") ) {
6063 const line_t oldline = CopLINE(PL_curcop);
6064 if (PL_parser && PL_parser->copline != NOLINE)
6065 CopLINE_set(PL_curcop, PL_parser->copline);
6066 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6067 CvCONST(cv) ? "Constant subroutine %s redefined"
6068 : "Subroutine %s redefined"
6070 CopLINE_set(PL_curcop, oldline);
6080 if (cv) /* must reuse cv if autoloaded */
6083 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
6087 mro_method_changed_in(GvSTASH(gv)); /* newXS */
6091 (void)gv_fetchfile(filename);
6092 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
6093 an external constant string */
6095 CvXSUB(cv) = subaddr;
6098 process_special_blocks(name, gv, cv);
6110 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
6115 OP* pegop = newOP(OP_NULL, 0);
6119 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
6120 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
6123 if ((cv = GvFORM(gv))) {
6124 if (ckWARN(WARN_REDEFINE)) {
6125 const line_t oldline = CopLINE(PL_curcop);
6126 if (PL_parser && PL_parser->copline != NOLINE)
6127 CopLINE_set(PL_curcop, PL_parser->copline);
6129 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6130 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
6132 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6133 "Format STDOUT redefined");
6135 CopLINE_set(PL_curcop, oldline);
6142 CvFILE_set_from_cop(cv, PL_curcop);
6145 pad_tidy(padtidy_FORMAT);
6146 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
6147 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6148 OpREFCNT_set(CvROOT(cv), 1);
6149 CvSTART(cv) = LINKLIST(CvROOT(cv));
6150 CvROOT(cv)->op_next = 0;
6151 CALL_PEEP(CvSTART(cv));
6153 op_getmad(o,pegop,'n');
6154 op_getmad_weak(block, pegop, 'b');
6159 PL_parser->copline = NOLINE;
6167 Perl_newANONLIST(pTHX_ OP *o)
6169 return convert(OP_ANONLIST, OPf_SPECIAL, o);
6173 Perl_newANONHASH(pTHX_ OP *o)
6175 return convert(OP_ANONHASH, OPf_SPECIAL, o);
6179 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
6181 return newANONATTRSUB(floor, proto, NULL, block);
6185 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
6187 return newUNOP(OP_REFGEN, 0,
6188 newSVOP(OP_ANONCODE, 0,
6189 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
6193 Perl_oopsAV(pTHX_ OP *o)
6197 PERL_ARGS_ASSERT_OOPSAV;
6199 switch (o->op_type) {
6201 o->op_type = OP_PADAV;
6202 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6203 return ref(o, OP_RV2AV);
6206 o->op_type = OP_RV2AV;
6207 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
6212 if (ckWARN_d(WARN_INTERNAL))
6213 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
6220 Perl_oopsHV(pTHX_ OP *o)
6224 PERL_ARGS_ASSERT_OOPSHV;
6226 switch (o->op_type) {
6229 o->op_type = OP_PADHV;
6230 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6231 return ref(o, OP_RV2HV);
6235 o->op_type = OP_RV2HV;
6236 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
6241 if (ckWARN_d(WARN_INTERNAL))
6242 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
6249 Perl_newAVREF(pTHX_ OP *o)
6253 PERL_ARGS_ASSERT_NEWAVREF;
6255 if (o->op_type == OP_PADANY) {
6256 o->op_type = OP_PADAV;
6257 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6260 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)
6261 && ckWARN(WARN_DEPRECATED)) {
6262 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
6263 "Using an array as a reference is deprecated");
6265 return newUNOP(OP_RV2AV, 0, scalar(o));
6269 Perl_newGVREF(pTHX_ I32 type, OP *o)
6271 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
6272 return newUNOP(OP_NULL, 0, o);
6273 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
6277 Perl_newHVREF(pTHX_ OP *o)
6281 PERL_ARGS_ASSERT_NEWHVREF;
6283 if (o->op_type == OP_PADANY) {
6284 o->op_type = OP_PADHV;
6285 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6288 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)
6289 && ckWARN(WARN_DEPRECATED)) {
6290 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
6291 "Using a hash as a reference is deprecated");
6293 return newUNOP(OP_RV2HV, 0, scalar(o));
6297 Perl_newCVREF(pTHX_ I32 flags, OP *o)
6299 return newUNOP(OP_RV2CV, flags, scalar(o));
6303 Perl_newSVREF(pTHX_ OP *o)
6307 PERL_ARGS_ASSERT_NEWSVREF;
6309 if (o->op_type == OP_PADANY) {
6310 o->op_type = OP_PADSV;
6311 o->op_ppaddr = PL_ppaddr[OP_PADSV];
6314 return newUNOP(OP_RV2SV, 0, scalar(o));
6317 /* Check routines. See the comments at the top of this file for details
6318 * on when these are called */
6321 Perl_ck_anoncode(pTHX_ OP *o)
6323 PERL_ARGS_ASSERT_CK_ANONCODE;
6325 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
6327 cSVOPo->op_sv = NULL;
6332 Perl_ck_bitop(pTHX_ OP *o)
6336 PERL_ARGS_ASSERT_CK_BITOP;
6338 #define OP_IS_NUMCOMPARE(op) \
6339 ((op) == OP_LT || (op) == OP_I_LT || \
6340 (op) == OP_GT || (op) == OP_I_GT || \
6341 (op) == OP_LE || (op) == OP_I_LE || \
6342 (op) == OP_GE || (op) == OP_I_GE || \
6343 (op) == OP_EQ || (op) == OP_I_EQ || \
6344 (op) == OP_NE || (op) == OP_I_NE || \
6345 (op) == OP_NCMP || (op) == OP_I_NCMP)
6346 o->op_private = (U8)(PL_hints & HINT_INTEGER);
6347 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
6348 && (o->op_type == OP_BIT_OR
6349 || o->op_type == OP_BIT_AND
6350 || o->op_type == OP_BIT_XOR))
6352 const OP * const left = cBINOPo->op_first;
6353 const OP * const right = left->op_sibling;
6354 if ((OP_IS_NUMCOMPARE(left->op_type) &&
6355 (left->op_flags & OPf_PARENS) == 0) ||
6356 (OP_IS_NUMCOMPARE(right->op_type) &&
6357 (right->op_flags & OPf_PARENS) == 0))
6358 if (ckWARN(WARN_PRECEDENCE))
6359 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
6360 "Possible precedence problem on bitwise %c operator",
6361 o->op_type == OP_BIT_OR ? '|'
6362 : o->op_type == OP_BIT_AND ? '&' : '^'
6369 Perl_ck_concat(pTHX_ OP *o)
6371 const OP * const kid = cUNOPo->op_first;
6373 PERL_ARGS_ASSERT_CK_CONCAT;
6374 PERL_UNUSED_CONTEXT;
6376 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
6377 !(kUNOP->op_first->op_flags & OPf_MOD))
6378 o->op_flags |= OPf_STACKED;
6383 Perl_ck_spair(pTHX_ OP *o)
6387 PERL_ARGS_ASSERT_CK_SPAIR;
6389 if (o->op_flags & OPf_KIDS) {
6392 const OPCODE type = o->op_type;
6393 o = modkids(ck_fun(o), type);
6394 kid = cUNOPo->op_first;
6395 newop = kUNOP->op_first->op_sibling;
6397 const OPCODE type = newop->op_type;
6398 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
6399 type == OP_PADAV || type == OP_PADHV ||
6400 type == OP_RV2AV || type == OP_RV2HV)
6404 op_getmad(kUNOP->op_first,newop,'K');
6406 op_free(kUNOP->op_first);
6408 kUNOP->op_first = newop;
6410 o->op_ppaddr = PL_ppaddr[++o->op_type];
6415 Perl_ck_delete(pTHX_ OP *o)
6417 PERL_ARGS_ASSERT_CK_DELETE;
6421 if (o->op_flags & OPf_KIDS) {
6422 OP * const kid = cUNOPo->op_first;
6423 switch (kid->op_type) {
6425 o->op_flags |= OPf_SPECIAL;
6428 o->op_private |= OPpSLICE;
6431 o->op_flags |= OPf_SPECIAL;
6436 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
6439 if (kid->op_private & OPpLVAL_INTRO)
6440 o->op_private |= OPpLVAL_INTRO;
6447 Perl_ck_die(pTHX_ OP *o)
6449 PERL_ARGS_ASSERT_CK_DIE;
6452 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6458 Perl_ck_eof(pTHX_ OP *o)
6462 PERL_ARGS_ASSERT_CK_EOF;
6464 if (o->op_flags & OPf_KIDS) {
6465 if (cLISTOPo->op_first->op_type == OP_STUB) {
6467 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
6469 op_getmad(o,newop,'O');
6481 Perl_ck_eval(pTHX_ OP *o)
6485 PERL_ARGS_ASSERT_CK_EVAL;
6487 PL_hints |= HINT_BLOCK_SCOPE;
6488 if (o->op_flags & OPf_KIDS) {
6489 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6492 o->op_flags &= ~OPf_KIDS;
6495 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
6501 cUNOPo->op_first = 0;
6506 NewOp(1101, enter, 1, LOGOP);
6507 enter->op_type = OP_ENTERTRY;
6508 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
6509 enter->op_private = 0;
6511 /* establish postfix order */
6512 enter->op_next = (OP*)enter;
6514 CHECKOP(OP_ENTERTRY, enter);
6516 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
6517 o->op_type = OP_LEAVETRY;
6518 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
6519 enter->op_other = o;
6520 op_getmad(oldo,o,'O');
6534 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
6535 op_getmad(oldo,o,'O');
6537 o->op_targ = (PADOFFSET)PL_hints;
6538 if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) {
6539 /* Store a copy of %^H that pp_entereval can pick up. */
6540 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
6541 MUTABLE_SV(Perl_hv_copy_hints_hv(aTHX_ GvHV(PL_hintgv))));
6542 cUNOPo->op_first->op_sibling = hhop;
6543 o->op_private |= OPpEVAL_HAS_HH;
6549 Perl_ck_exit(pTHX_ OP *o)
6551 PERL_ARGS_ASSERT_CK_EXIT;
6554 HV * const table = GvHV(PL_hintgv);
6556 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
6557 if (svp && *svp && SvTRUE(*svp))
6558 o->op_private |= OPpEXIT_VMSISH;
6560 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6566 Perl_ck_exec(pTHX_ OP *o)
6568 PERL_ARGS_ASSERT_CK_EXEC;
6570 if (o->op_flags & OPf_STACKED) {
6573 kid = cUNOPo->op_first->op_sibling;
6574 if (kid->op_type == OP_RV2GV)
6583 Perl_ck_exists(pTHX_ OP *o)
6587 PERL_ARGS_ASSERT_CK_EXISTS;
6590 if (o->op_flags & OPf_KIDS) {
6591 OP * const kid = cUNOPo->op_first;
6592 if (kid->op_type == OP_ENTERSUB) {
6593 (void) ref(kid, o->op_type);
6594 if (kid->op_type != OP_RV2CV
6595 && !(PL_parser && PL_parser->error_count))
6596 Perl_croak(aTHX_ "%s argument is not a subroutine name",
6598 o->op_private |= OPpEXISTS_SUB;
6600 else if (kid->op_type == OP_AELEM)
6601 o->op_flags |= OPf_SPECIAL;
6602 else if (kid->op_type != OP_HELEM)
6603 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
6611 Perl_ck_rvconst(pTHX_ register OP *o)
6614 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6616 PERL_ARGS_ASSERT_CK_RVCONST;
6618 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6619 if (o->op_type == OP_RV2CV)
6620 o->op_private &= ~1;
6622 if (kid->op_type == OP_CONST) {
6625 SV * const kidsv = kid->op_sv;
6627 /* Is it a constant from cv_const_sv()? */
6628 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
6629 SV * const rsv = SvRV(kidsv);
6630 const svtype type = SvTYPE(rsv);
6631 const char *badtype = NULL;
6633 switch (o->op_type) {
6635 if (type > SVt_PVMG)
6636 badtype = "a SCALAR";
6639 if (type != SVt_PVAV)
6640 badtype = "an ARRAY";
6643 if (type != SVt_PVHV)
6647 if (type != SVt_PVCV)
6652 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
6655 else if ((o->op_type == OP_RV2HV || o->op_type == OP_RV2SV) &&
6656 (PL_hints & HINT_STRICT_REFS) && SvPOK(kidsv)) {
6657 /* If this is an access to a stash, disable "strict refs", because
6658 * stashes aren't auto-vivified at compile-time (unless we store
6659 * symbols in them), and we don't want to produce a run-time
6660 * stricture error when auto-vivifying the stash. */
6661 const char *s = SvPV_nolen(kidsv);
6662 const STRLEN l = SvCUR(kidsv);
6663 if (l > 1 && s[l-1] == ':' && s[l-2] == ':')
6664 o->op_private &= ~HINT_STRICT_REFS;
6666 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
6667 const char *badthing;
6668 switch (o->op_type) {
6670 badthing = "a SCALAR";
6673 badthing = "an ARRAY";
6676 badthing = "a HASH";
6684 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
6685 SVfARG(kidsv), badthing);
6688 * This is a little tricky. We only want to add the symbol if we
6689 * didn't add it in the lexer. Otherwise we get duplicate strict
6690 * warnings. But if we didn't add it in the lexer, we must at
6691 * least pretend like we wanted to add it even if it existed before,
6692 * or we get possible typo warnings. OPpCONST_ENTERED says
6693 * whether the lexer already added THIS instance of this symbol.
6695 iscv = (o->op_type == OP_RV2CV) * 2;
6697 gv = gv_fetchsv(kidsv,
6698 iscv | !(kid->op_private & OPpCONST_ENTERED),
6701 : o->op_type == OP_RV2SV
6703 : o->op_type == OP_RV2AV
6705 : o->op_type == OP_RV2HV
6708 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
6710 kid->op_type = OP_GV;
6711 SvREFCNT_dec(kid->op_sv);
6713 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
6714 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
6715 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
6717 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
6719 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
6721 kid->op_private = 0;
6722 kid->op_ppaddr = PL_ppaddr[OP_GV];
6729 Perl_ck_ftst(pTHX_ OP *o)
6732 const I32 type = o->op_type;
6734 PERL_ARGS_ASSERT_CK_FTST;
6736 if (o->op_flags & OPf_REF) {
6739 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
6740 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6741 const OPCODE kidtype = kid->op_type;
6743 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6744 OP * const newop = newGVOP(type, OPf_REF,
6745 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
6747 op_getmad(o,newop,'O');
6753 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
6754 o->op_private |= OPpFT_ACCESS;
6755 if (PL_check[kidtype] == MEMBER_TO_FPTR(Perl_ck_ftst)
6756 && kidtype != OP_STAT && kidtype != OP_LSTAT)
6757 o->op_private |= OPpFT_STACKED;
6765 if (type == OP_FTTTY)
6766 o = newGVOP(type, OPf_REF, PL_stdingv);
6768 o = newUNOP(type, 0, newDEFSVOP());
6769 op_getmad(oldo,o,'O');
6775 Perl_ck_fun(pTHX_ OP *o)
6778 const int type = o->op_type;
6779 register I32 oa = PL_opargs[type] >> OASHIFT;
6781 PERL_ARGS_ASSERT_CK_FUN;
6783 if (o->op_flags & OPf_STACKED) {
6784 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
6787 return no_fh_allowed(o);
6790 if (o->op_flags & OPf_KIDS) {
6791 OP **tokid = &cLISTOPo->op_first;
6792 register OP *kid = cLISTOPo->op_first;
6796 if (kid->op_type == OP_PUSHMARK ||
6797 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
6799 tokid = &kid->op_sibling;
6800 kid = kid->op_sibling;
6802 if (!kid && PL_opargs[type] & OA_DEFGV)
6803 *tokid = kid = newDEFSVOP();
6807 sibl = kid->op_sibling;
6809 if (!sibl && kid->op_type == OP_STUB) {
6816 /* list seen where single (scalar) arg expected? */
6817 if (numargs == 1 && !(oa >> 4)
6818 && kid->op_type == OP_LIST && type != OP_SCALAR)
6820 return too_many_arguments(o,PL_op_desc[type]);
6833 if ((type == OP_PUSH || type == OP_UNSHIFT)
6834 && !kid->op_sibling && ckWARN(WARN_SYNTAX))
6835 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6836 "Useless use of %s with no values",
6839 if (kid->op_type == OP_CONST &&
6840 (kid->op_private & OPpCONST_BARE))
6842 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
6843 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
6844 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
6845 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6846 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
6847 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6849 op_getmad(kid,newop,'K');
6854 kid->op_sibling = sibl;
6857 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
6858 bad_type(numargs, "array", PL_op_desc[type], kid);
6862 if (kid->op_type == OP_CONST &&
6863 (kid->op_private & OPpCONST_BARE))
6865 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
6866 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
6867 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
6868 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6869 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
6870 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6872 op_getmad(kid,newop,'K');
6877 kid->op_sibling = sibl;
6880 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
6881 bad_type(numargs, "hash", PL_op_desc[type], kid);
6886 OP * const newop = newUNOP(OP_NULL, 0, kid);
6887 kid->op_sibling = 0;
6889 newop->op_next = newop;
6891 kid->op_sibling = sibl;
6896 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
6897 if (kid->op_type == OP_CONST &&
6898 (kid->op_private & OPpCONST_BARE))
6900 OP * const newop = newGVOP(OP_GV, 0,
6901 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
6902 if (!(o->op_private & 1) && /* if not unop */
6903 kid == cLISTOPo->op_last)
6904 cLISTOPo->op_last = newop;
6906 op_getmad(kid,newop,'K');
6912 else if (kid->op_type == OP_READLINE) {
6913 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
6914 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
6917 I32 flags = OPf_SPECIAL;
6921 /* is this op a FH constructor? */
6922 if (is_handle_constructor(o,numargs)) {
6923 const char *name = NULL;
6927 /* Set a flag to tell rv2gv to vivify
6928 * need to "prove" flag does not mean something
6929 * else already - NI-S 1999/05/07
6932 if (kid->op_type == OP_PADSV) {
6934 = PAD_COMPNAME_SV(kid->op_targ);
6935 name = SvPV_const(namesv, len);
6937 else if (kid->op_type == OP_RV2SV
6938 && kUNOP->op_first->op_type == OP_GV)
6940 GV * const gv = cGVOPx_gv(kUNOP->op_first);
6942 len = GvNAMELEN(gv);
6944 else if (kid->op_type == OP_AELEM
6945 || kid->op_type == OP_HELEM)
6948 OP *op = ((BINOP*)kid)->op_first;
6952 const char * const a =
6953 kid->op_type == OP_AELEM ?
6955 if (((op->op_type == OP_RV2AV) ||
6956 (op->op_type == OP_RV2HV)) &&
6957 (firstop = ((UNOP*)op)->op_first) &&
6958 (firstop->op_type == OP_GV)) {
6959 /* packagevar $a[] or $h{} */
6960 GV * const gv = cGVOPx_gv(firstop);
6968 else if (op->op_type == OP_PADAV
6969 || op->op_type == OP_PADHV) {
6970 /* lexicalvar $a[] or $h{} */
6971 const char * const padname =
6972 PAD_COMPNAME_PV(op->op_targ);
6981 name = SvPV_const(tmpstr, len);
6986 name = "__ANONIO__";
6993 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
6994 namesv = PAD_SVl(targ);
6995 SvUPGRADE(namesv, SVt_PV);
6997 sv_setpvs(namesv, "$");
6998 sv_catpvn(namesv, name, len);
7001 kid->op_sibling = 0;
7002 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
7003 kid->op_targ = targ;
7004 kid->op_private |= priv;
7006 kid->op_sibling = sibl;
7012 mod(scalar(kid), type);
7016 tokid = &kid->op_sibling;
7017 kid = kid->op_sibling;
7020 if (kid && kid->op_type != OP_STUB)
7021 return too_many_arguments(o,OP_DESC(o));
7022 o->op_private |= numargs;
7024 /* FIXME - should the numargs move as for the PERL_MAD case? */
7025 o->op_private |= numargs;
7027 return too_many_arguments(o,OP_DESC(o));
7031 else if (PL_opargs[type] & OA_DEFGV) {
7033 OP *newop = newUNOP(type, 0, newDEFSVOP());
7034 op_getmad(o,newop,'O');
7037 /* Ordering of these two is important to keep f_map.t passing. */
7039 return newUNOP(type, 0, newDEFSVOP());
7044 while (oa & OA_OPTIONAL)
7046 if (oa && oa != OA_LIST)
7047 return too_few_arguments(o,OP_DESC(o));
7053 Perl_ck_glob(pTHX_ OP *o)
7058 PERL_ARGS_ASSERT_CK_GLOB;
7061 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
7062 append_elem(OP_GLOB, o, newDEFSVOP());
7064 if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
7065 && GvCVu(gv) && GvIMPORTED_CV(gv)))
7067 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7070 #if !defined(PERL_EXTERNAL_GLOB)
7071 /* XXX this can be tightened up and made more failsafe. */
7072 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7075 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
7076 newSVpvs("File::Glob"), NULL, NULL, NULL);
7077 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7078 glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV);
7079 GvCV(gv) = GvCV(glob_gv);
7080 SvREFCNT_inc_void(MUTABLE_SV(GvCV(gv)));
7081 GvIMPORTED_CV_on(gv);
7084 #endif /* PERL_EXTERNAL_GLOB */
7086 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7087 append_elem(OP_GLOB, o,
7088 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
7089 o->op_type = OP_LIST;
7090 o->op_ppaddr = PL_ppaddr[OP_LIST];
7091 cLISTOPo->op_first->op_type = OP_PUSHMARK;
7092 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
7093 cLISTOPo->op_first->op_targ = 0;
7094 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
7095 append_elem(OP_LIST, o,
7096 scalar(newUNOP(OP_RV2CV, 0,
7097 newGVOP(OP_GV, 0, gv)))));
7098 o = newUNOP(OP_NULL, 0, ck_subr(o));
7099 o->op_targ = OP_GLOB; /* hint at what it used to be */
7102 gv = newGVgen("main");
7104 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
7110 Perl_ck_grep(pTHX_ OP *o)
7115 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
7118 PERL_ARGS_ASSERT_CK_GREP;
7120 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
7121 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
7123 if (o->op_flags & OPf_STACKED) {
7126 kid = cLISTOPo->op_first->op_sibling;
7127 if (!cUNOPx(kid)->op_next)
7128 Perl_croak(aTHX_ "panic: ck_grep");
7129 for (k = cUNOPx(kid)->op_first; k; k = k->op_next) {
7132 NewOp(1101, gwop, 1, LOGOP);
7133 kid->op_next = (OP*)gwop;
7134 o->op_flags &= ~OPf_STACKED;
7136 kid = cLISTOPo->op_first->op_sibling;
7137 if (type == OP_MAPWHILE)
7142 if (PL_parser && PL_parser->error_count)
7144 kid = cLISTOPo->op_first->op_sibling;
7145 if (kid->op_type != OP_NULL)
7146 Perl_croak(aTHX_ "panic: ck_grep");
7147 kid = kUNOP->op_first;
7150 NewOp(1101, gwop, 1, LOGOP);
7151 gwop->op_type = type;
7152 gwop->op_ppaddr = PL_ppaddr[type];
7153 gwop->op_first = listkids(o);
7154 gwop->op_flags |= OPf_KIDS;
7155 gwop->op_other = LINKLIST(kid);
7156 kid->op_next = (OP*)gwop;
7157 offset = pad_findmy("$_");
7158 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
7159 o->op_private = gwop->op_private = 0;
7160 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
7163 o->op_private = gwop->op_private = OPpGREP_LEX;
7164 gwop->op_targ = o->op_targ = offset;
7167 kid = cLISTOPo->op_first->op_sibling;
7168 if (!kid || !kid->op_sibling)
7169 return too_few_arguments(o,OP_DESC(o));
7170 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
7171 mod(kid, OP_GREPSTART);
7177 Perl_ck_index(pTHX_ OP *o)
7179 PERL_ARGS_ASSERT_CK_INDEX;
7181 if (o->op_flags & OPf_KIDS) {
7182 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7184 kid = kid->op_sibling; /* get past "big" */
7185 if (kid && kid->op_type == OP_CONST)
7186 fbm_compile(((SVOP*)kid)->op_sv, 0);
7192 Perl_ck_lfun(pTHX_ OP *o)
7194 const OPCODE type = o->op_type;
7196 PERL_ARGS_ASSERT_CK_LFUN;
7198 return modkids(ck_fun(o), type);
7202 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
7204 PERL_ARGS_ASSERT_CK_DEFINED;
7206 if ((o->op_flags & OPf_KIDS) && ckWARN2(WARN_DEPRECATED, WARN_SYNTAX)) {
7207 switch (cUNOPo->op_first->op_type) {
7209 /* This is needed for
7210 if (defined %stash::)
7211 to work. Do not break Tk.
7213 break; /* Globals via GV can be undef */
7215 case OP_AASSIGN: /* Is this a good idea? */
7216 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7217 "defined(@array) is deprecated");
7218 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7219 "\t(Maybe you should just omit the defined()?)\n");
7222 /* This is needed for
7223 if (defined %stash::)
7224 to work. Do not break Tk.
7226 break; /* Globals via GV can be undef */
7228 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7229 "defined(%%hash) is deprecated");
7230 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7231 "\t(Maybe you should just omit the defined()?)\n");
7242 Perl_ck_readline(pTHX_ OP *o)
7244 PERL_ARGS_ASSERT_CK_READLINE;
7246 if (!(o->op_flags & OPf_KIDS)) {
7248 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
7250 op_getmad(o,newop,'O');
7260 Perl_ck_rfun(pTHX_ OP *o)
7262 const OPCODE type = o->op_type;
7264 PERL_ARGS_ASSERT_CK_RFUN;
7266 return refkids(ck_fun(o), type);
7270 Perl_ck_listiob(pTHX_ OP *o)
7274 PERL_ARGS_ASSERT_CK_LISTIOB;
7276 kid = cLISTOPo->op_first;
7279 kid = cLISTOPo->op_first;
7281 if (kid->op_type == OP_PUSHMARK)
7282 kid = kid->op_sibling;
7283 if (kid && o->op_flags & OPf_STACKED)
7284 kid = kid->op_sibling;
7285 else if (kid && !kid->op_sibling) { /* print HANDLE; */
7286 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
7287 o->op_flags |= OPf_STACKED; /* make it a filehandle */
7288 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
7289 cLISTOPo->op_first->op_sibling = kid;
7290 cLISTOPo->op_last = kid;
7291 kid = kid->op_sibling;
7296 append_elem(o->op_type, o, newDEFSVOP());
7302 Perl_ck_smartmatch(pTHX_ OP *o)
7305 if (0 == (o->op_flags & OPf_SPECIAL)) {
7306 OP *first = cBINOPo->op_first;
7307 OP *second = first->op_sibling;
7309 /* Implicitly take a reference to an array or hash */
7310 first->op_sibling = NULL;
7311 first = cBINOPo->op_first = ref_array_or_hash(first);
7312 second = first->op_sibling = ref_array_or_hash(second);
7314 /* Implicitly take a reference to a regular expression */
7315 if (first->op_type == OP_MATCH) {
7316 first->op_type = OP_QR;
7317 first->op_ppaddr = PL_ppaddr[OP_QR];
7319 if (second->op_type == OP_MATCH) {
7320 second->op_type = OP_QR;
7321 second->op_ppaddr = PL_ppaddr[OP_QR];
7330 Perl_ck_sassign(pTHX_ OP *o)
7333 OP * const kid = cLISTOPo->op_first;
7335 PERL_ARGS_ASSERT_CK_SASSIGN;
7337 /* has a disposable target? */
7338 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
7339 && !(kid->op_flags & OPf_STACKED)
7340 /* Cannot steal the second time! */
7341 && !(kid->op_private & OPpTARGET_MY)
7342 /* Keep the full thing for madskills */
7346 OP * const kkid = kid->op_sibling;
7348 /* Can just relocate the target. */
7349 if (kkid && kkid->op_type == OP_PADSV
7350 && !(kkid->op_private & OPpLVAL_INTRO))
7352 kid->op_targ = kkid->op_targ;
7354 /* Now we do not need PADSV and SASSIGN. */
7355 kid->op_sibling = o->op_sibling; /* NULL */
7356 cLISTOPo->op_first = NULL;
7359 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
7363 if (kid->op_sibling) {
7364 OP *kkid = kid->op_sibling;
7365 if (kkid->op_type == OP_PADSV
7366 && (kkid->op_private & OPpLVAL_INTRO)
7367 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
7368 const PADOFFSET target = kkid->op_targ;
7369 OP *const other = newOP(OP_PADSV,
7371 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
7372 OP *const first = newOP(OP_NULL, 0);
7373 OP *const nullop = newCONDOP(0, first, o, other);
7374 OP *const condop = first->op_next;
7375 /* hijacking PADSTALE for uninitialized state variables */
7376 SvPADSTALE_on(PAD_SVl(target));
7378 condop->op_type = OP_ONCE;
7379 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
7380 condop->op_targ = target;
7381 other->op_targ = target;
7383 /* Because we change the type of the op here, we will skip the
7384 assinment binop->op_last = binop->op_first->op_sibling; at the
7385 end of Perl_newBINOP(). So need to do it here. */
7386 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
7395 Perl_ck_match(pTHX_ OP *o)
7399 PERL_ARGS_ASSERT_CK_MATCH;
7401 if (o->op_type != OP_QR && PL_compcv) {
7402 const PADOFFSET offset = pad_findmy("$_");
7403 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
7404 o->op_targ = offset;
7405 o->op_private |= OPpTARGET_MY;
7408 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
7409 o->op_private |= OPpRUNTIME;
7414 Perl_ck_method(pTHX_ OP *o)
7416 OP * const kid = cUNOPo->op_first;
7418 PERL_ARGS_ASSERT_CK_METHOD;
7420 if (kid->op_type == OP_CONST) {
7421 SV* sv = kSVOP->op_sv;
7422 const char * const method = SvPVX_const(sv);
7423 if (!(strchr(method, ':') || strchr(method, '\''))) {
7425 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
7426 sv = newSVpvn_share(method, SvCUR(sv), 0);
7429 kSVOP->op_sv = NULL;
7431 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
7433 op_getmad(o,cmop,'O');
7444 Perl_ck_null(pTHX_ OP *o)
7446 PERL_ARGS_ASSERT_CK_NULL;
7447 PERL_UNUSED_CONTEXT;
7452 Perl_ck_open(pTHX_ OP *o)
7455 HV * const table = GvHV(PL_hintgv);
7457 PERL_ARGS_ASSERT_CK_OPEN;
7460 SV **svp = hv_fetchs(table, "open_IN", FALSE);
7463 const char *d = SvPV_const(*svp, len);
7464 const I32 mode = mode_from_discipline(d, len);
7465 if (mode & O_BINARY)
7466 o->op_private |= OPpOPEN_IN_RAW;
7467 else if (mode & O_TEXT)
7468 o->op_private |= OPpOPEN_IN_CRLF;
7471 svp = hv_fetchs(table, "open_OUT", FALSE);
7474 const char *d = SvPV_const(*svp, len);
7475 const I32 mode = mode_from_discipline(d, len);
7476 if (mode & O_BINARY)
7477 o->op_private |= OPpOPEN_OUT_RAW;
7478 else if (mode & O_TEXT)
7479 o->op_private |= OPpOPEN_OUT_CRLF;
7482 if (o->op_type == OP_BACKTICK) {
7483 if (!(o->op_flags & OPf_KIDS)) {
7484 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
7486 op_getmad(o,newop,'O');
7495 /* In case of three-arg dup open remove strictness
7496 * from the last arg if it is a bareword. */
7497 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
7498 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
7502 if ((last->op_type == OP_CONST) && /* The bareword. */
7503 (last->op_private & OPpCONST_BARE) &&
7504 (last->op_private & OPpCONST_STRICT) &&
7505 (oa = first->op_sibling) && /* The fh. */
7506 (oa = oa->op_sibling) && /* The mode. */
7507 (oa->op_type == OP_CONST) &&
7508 SvPOK(((SVOP*)oa)->op_sv) &&
7509 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
7510 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
7511 (last == oa->op_sibling)) /* The bareword. */
7512 last->op_private &= ~OPpCONST_STRICT;
7518 Perl_ck_repeat(pTHX_ OP *o)
7520 PERL_ARGS_ASSERT_CK_REPEAT;
7522 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
7523 o->op_private |= OPpREPEAT_DOLIST;
7524 cBINOPo->op_first = force_list(cBINOPo->op_first);
7532 Perl_ck_require(pTHX_ OP *o)
7537 PERL_ARGS_ASSERT_CK_REQUIRE;
7539 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
7540 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7542 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
7543 SV * const sv = kid->op_sv;
7544 U32 was_readonly = SvREADONLY(sv);
7551 sv_force_normal_flags(sv, 0);
7552 assert(!SvREADONLY(sv));
7562 for (; s < end; s++) {
7563 if (*s == ':' && s[1] == ':') {
7565 Move(s+2, s+1, end - s - 1, char);
7570 sv_catpvs(sv, ".pm");
7571 SvFLAGS(sv) |= was_readonly;
7575 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
7576 /* handle override, if any */
7577 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
7578 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7579 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
7580 gv = gvp ? *gvp : NULL;
7584 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7585 OP * const kid = cUNOPo->op_first;
7588 cUNOPo->op_first = 0;
7592 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
7593 append_elem(OP_LIST, kid,
7594 scalar(newUNOP(OP_RV2CV, 0,
7597 op_getmad(o,newop,'O');
7605 Perl_ck_return(pTHX_ OP *o)
7610 PERL_ARGS_ASSERT_CK_RETURN;
7612 kid = cLISTOPo->op_first->op_sibling;
7613 if (CvLVALUE(PL_compcv)) {
7614 for (; kid; kid = kid->op_sibling)
7615 mod(kid, OP_LEAVESUBLV);
7617 for (; kid; kid = kid->op_sibling)
7618 if ((kid->op_type == OP_NULL)
7619 && ((kid->op_flags & (OPf_SPECIAL|OPf_KIDS)) == (OPf_SPECIAL|OPf_KIDS))) {
7620 /* This is a do block */
7621 OP *op = kUNOP->op_first;
7622 if (op->op_type == OP_LEAVE && op->op_flags & OPf_KIDS) {
7623 op = cUNOPx(op)->op_first;
7624 assert(op->op_type == OP_ENTER && !(op->op_flags & OPf_SPECIAL));
7625 /* Force the use of the caller's context */
7626 op->op_flags |= OPf_SPECIAL;
7635 Perl_ck_select(pTHX_ OP *o)
7640 PERL_ARGS_ASSERT_CK_SELECT;
7642 if (o->op_flags & OPf_KIDS) {
7643 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7644 if (kid && kid->op_sibling) {
7645 o->op_type = OP_SSELECT;
7646 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
7648 return fold_constants(o);
7652 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7653 if (kid && kid->op_type == OP_RV2GV)
7654 kid->op_private &= ~HINT_STRICT_REFS;
7659 Perl_ck_shift(pTHX_ OP *o)
7662 const I32 type = o->op_type;
7664 PERL_ARGS_ASSERT_CK_SHIFT;
7666 if (!(o->op_flags & OPf_KIDS)) {
7667 OP *argop = newUNOP(OP_RV2AV, 0,
7668 scalar(newGVOP(OP_GV, 0, CvUNIQUE(PL_compcv) ? PL_argvgv : PL_defgv)));
7670 OP * const oldo = o;
7671 o = newUNOP(type, 0, scalar(argop));
7672 op_getmad(oldo,o,'O');
7676 return newUNOP(type, 0, scalar(argop));
7679 return scalar(modkids(ck_fun(o), type));
7683 Perl_ck_sort(pTHX_ OP *o)
7688 PERL_ARGS_ASSERT_CK_SORT;
7690 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
7691 HV * const hinthv = GvHV(PL_hintgv);
7693 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
7695 const I32 sorthints = (I32)SvIV(*svp);
7696 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
7697 o->op_private |= OPpSORT_QSORT;
7698 if ((sorthints & HINT_SORT_STABLE) != 0)
7699 o->op_private |= OPpSORT_STABLE;
7704 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
7706 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7707 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
7709 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
7711 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
7713 if (kid->op_type == OP_SCOPE) {
7717 else if (kid->op_type == OP_LEAVE) {
7718 if (o->op_type == OP_SORT) {
7719 op_null(kid); /* wipe out leave */
7722 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
7723 if (k->op_next == kid)
7725 /* don't descend into loops */
7726 else if (k->op_type == OP_ENTERLOOP
7727 || k->op_type == OP_ENTERITER)
7729 k = cLOOPx(k)->op_lastop;
7734 kid->op_next = 0; /* just disconnect the leave */
7735 k = kLISTOP->op_first;
7740 if (o->op_type == OP_SORT) {
7741 /* provide scalar context for comparison function/block */
7747 o->op_flags |= OPf_SPECIAL;
7749 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
7752 firstkid = firstkid->op_sibling;
7755 /* provide list context for arguments */
7756 if (o->op_type == OP_SORT)
7763 S_simplify_sort(pTHX_ OP *o)
7766 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7772 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
7774 if (!(o->op_flags & OPf_STACKED))
7776 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
7777 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
7778 kid = kUNOP->op_first; /* get past null */
7779 if (kid->op_type != OP_SCOPE)
7781 kid = kLISTOP->op_last; /* get past scope */
7782 switch(kid->op_type) {
7790 k = kid; /* remember this node*/
7791 if (kBINOP->op_first->op_type != OP_RV2SV)
7793 kid = kBINOP->op_first; /* get past cmp */
7794 if (kUNOP->op_first->op_type != OP_GV)
7796 kid = kUNOP->op_first; /* get past rv2sv */
7798 if (GvSTASH(gv) != PL_curstash)
7800 gvname = GvNAME(gv);
7801 if (*gvname == 'a' && gvname[1] == '\0')
7803 else if (*gvname == 'b' && gvname[1] == '\0')
7808 kid = k; /* back to cmp */
7809 if (kBINOP->op_last->op_type != OP_RV2SV)
7811 kid = kBINOP->op_last; /* down to 2nd arg */
7812 if (kUNOP->op_first->op_type != OP_GV)
7814 kid = kUNOP->op_first; /* get past rv2sv */
7816 if (GvSTASH(gv) != PL_curstash)
7818 gvname = GvNAME(gv);
7820 ? !(*gvname == 'a' && gvname[1] == '\0')
7821 : !(*gvname == 'b' && gvname[1] == '\0'))
7823 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
7825 o->op_private |= OPpSORT_DESCEND;
7826 if (k->op_type == OP_NCMP)
7827 o->op_private |= OPpSORT_NUMERIC;
7828 if (k->op_type == OP_I_NCMP)
7829 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
7830 kid = cLISTOPo->op_first->op_sibling;
7831 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
7833 op_getmad(kid,o,'S'); /* then delete it */
7835 op_free(kid); /* then delete it */
7840 Perl_ck_split(pTHX_ OP *o)
7845 PERL_ARGS_ASSERT_CK_SPLIT;
7847 if (o->op_flags & OPf_STACKED)
7848 return no_fh_allowed(o);
7850 kid = cLISTOPo->op_first;
7851 if (kid->op_type != OP_NULL)
7852 Perl_croak(aTHX_ "panic: ck_split");
7853 kid = kid->op_sibling;
7854 op_free(cLISTOPo->op_first);
7855 cLISTOPo->op_first = kid;
7857 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
7858 cLISTOPo->op_last = kid; /* There was only one element previously */
7861 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
7862 OP * const sibl = kid->op_sibling;
7863 kid->op_sibling = 0;
7864 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
7865 if (cLISTOPo->op_first == cLISTOPo->op_last)
7866 cLISTOPo->op_last = kid;
7867 cLISTOPo->op_first = kid;
7868 kid->op_sibling = sibl;
7871 kid->op_type = OP_PUSHRE;
7872 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
7874 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL && ckWARN(WARN_REGEXP)) {
7875 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
7876 "Use of /g modifier is meaningless in split");
7879 if (!kid->op_sibling)
7880 append_elem(OP_SPLIT, o, newDEFSVOP());
7882 kid = kid->op_sibling;
7885 if (!kid->op_sibling)
7886 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
7887 assert(kid->op_sibling);
7889 kid = kid->op_sibling;
7892 if (kid->op_sibling)
7893 return too_many_arguments(o,OP_DESC(o));
7899 Perl_ck_join(pTHX_ OP *o)
7901 const OP * const kid = cLISTOPo->op_first->op_sibling;
7903 PERL_ARGS_ASSERT_CK_JOIN;
7905 if (kid && kid->op_type == OP_MATCH) {
7906 if (ckWARN(WARN_SYNTAX)) {
7907 const REGEXP *re = PM_GETRE(kPMOP);
7908 const char *pmstr = re ? RX_PRECOMP_const(re) : "STRING";
7909 const STRLEN len = re ? RX_PRELEN(re) : 6;
7910 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7911 "/%.*s/ should probably be written as \"%.*s\"",
7912 (int)len, pmstr, (int)len, pmstr);
7919 Perl_ck_subr(pTHX_ OP *o)
7922 OP *prev = ((cUNOPo->op_first->op_sibling)
7923 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
7924 OP *o2 = prev->op_sibling;
7926 const char *proto = NULL;
7927 const char *proto_end = NULL;
7932 I32 contextclass = 0;
7933 const char *e = NULL;
7936 PERL_ARGS_ASSERT_CK_SUBR;
7938 o->op_private |= OPpENTERSUB_HASTARG;
7939 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
7940 if (cvop->op_type == OP_RV2CV) {
7942 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
7943 op_null(cvop); /* disable rv2cv */
7944 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
7945 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
7946 GV *gv = cGVOPx_gv(tmpop);
7949 tmpop->op_private |= OPpEARLY_CV;
7953 namegv = CvANON(cv) ? gv : CvGV(cv);
7954 proto = SvPV(MUTABLE_SV(cv), len);
7955 proto_end = proto + len;
7960 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
7961 if (o2->op_type == OP_CONST)
7962 o2->op_private &= ~OPpCONST_STRICT;
7963 else if (o2->op_type == OP_LIST) {
7964 OP * const sib = ((UNOP*)o2)->op_first->op_sibling;
7965 if (sib && sib->op_type == OP_CONST)
7966 sib->op_private &= ~OPpCONST_STRICT;
7969 o->op_private |= (PL_hints & HINT_STRICT_REFS);
7970 if (PERLDB_SUB && PL_curstash != PL_debstash)
7971 o->op_private |= OPpENTERSUB_DB;
7972 while (o2 != cvop) {
7974 if (PL_madskills && o2->op_type == OP_STUB) {
7975 o2 = o2->op_sibling;
7978 if (PL_madskills && o2->op_type == OP_NULL)
7979 o3 = ((UNOP*)o2)->op_first;
7983 if (proto >= proto_end)
7984 return too_many_arguments(o, gv_ename(namegv));
7992 /* _ must be at the end */
7993 if (proto[1] && proto[1] != ';')
8008 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
8010 arg == 1 ? "block or sub {}" : "sub {}",
8011 gv_ename(namegv), o3);
8014 /* '*' allows any scalar type, including bareword */
8017 if (o3->op_type == OP_RV2GV)
8018 goto wrapref; /* autoconvert GLOB -> GLOBref */
8019 else if (o3->op_type == OP_CONST)
8020 o3->op_private &= ~OPpCONST_STRICT;
8021 else if (o3->op_type == OP_ENTERSUB) {
8022 /* accidental subroutine, revert to bareword */
8023 OP *gvop = ((UNOP*)o3)->op_first;
8024 if (gvop && gvop->op_type == OP_NULL) {
8025 gvop = ((UNOP*)gvop)->op_first;
8027 for (; gvop->op_sibling; gvop = gvop->op_sibling)
8030 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
8031 (gvop = ((UNOP*)gvop)->op_first) &&
8032 gvop->op_type == OP_GV)
8034 GV * const gv = cGVOPx_gv(gvop);
8035 OP * const sibling = o2->op_sibling;
8036 SV * const n = newSVpvs("");
8038 OP * const oldo2 = o2;
8042 gv_fullname4(n, gv, "", FALSE);
8043 o2 = newSVOP(OP_CONST, 0, n);
8044 op_getmad(oldo2,o2,'O');
8045 prev->op_sibling = o2;
8046 o2->op_sibling = sibling;
8062 if (contextclass++ == 0) {
8063 e = strchr(proto, ']');
8064 if (!e || e == proto)
8073 const char *p = proto;
8074 const char *const end = proto;
8076 while (*--p != '[') {}
8077 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
8079 gv_ename(namegv), o3);
8084 if (o3->op_type == OP_RV2GV)
8087 bad_type(arg, "symbol", gv_ename(namegv), o3);
8090 if (o3->op_type == OP_ENTERSUB)
8093 bad_type(arg, "subroutine entry", gv_ename(namegv),
8097 if (o3->op_type == OP_RV2SV ||
8098 o3->op_type == OP_PADSV ||
8099 o3->op_type == OP_HELEM ||
8100 o3->op_type == OP_AELEM)
8103 bad_type(arg, "scalar", gv_ename(namegv), o3);
8106 if (o3->op_type == OP_RV2AV ||
8107 o3->op_type == OP_PADAV)
8110 bad_type(arg, "array", gv_ename(namegv), o3);
8113 if (o3->op_type == OP_RV2HV ||
8114 o3->op_type == OP_PADHV)
8117 bad_type(arg, "hash", gv_ename(namegv), o3);
8122 OP* const sib = kid->op_sibling;
8123 kid->op_sibling = 0;
8124 o2 = newUNOP(OP_REFGEN, 0, kid);
8125 o2->op_sibling = sib;
8126 prev->op_sibling = o2;
8128 if (contextclass && e) {
8143 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
8144 gv_ename(namegv), SVfARG(cv));
8149 mod(o2, OP_ENTERSUB);
8151 o2 = o2->op_sibling;
8153 if (o2 == cvop && proto && *proto == '_') {
8154 /* generate an access to $_ */
8156 o2->op_sibling = prev->op_sibling;
8157 prev->op_sibling = o2; /* instead of cvop */
8159 if (proto && !optional && proto_end > proto &&
8160 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
8161 return too_few_arguments(o, gv_ename(namegv));
8164 OP * const oldo = o;
8168 o=newSVOP(OP_CONST, 0, newSViv(0));
8169 op_getmad(oldo,o,'O');
8175 Perl_ck_svconst(pTHX_ OP *o)
8177 PERL_ARGS_ASSERT_CK_SVCONST;
8178 PERL_UNUSED_CONTEXT;
8179 SvREADONLY_on(cSVOPo->op_sv);
8184 Perl_ck_chdir(pTHX_ OP *o)
8186 if (o->op_flags & OPf_KIDS) {
8187 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8189 if (kid && kid->op_type == OP_CONST &&
8190 (kid->op_private & OPpCONST_BARE))
8192 o->op_flags |= OPf_SPECIAL;
8193 kid->op_private &= ~OPpCONST_STRICT;
8200 Perl_ck_trunc(pTHX_ OP *o)
8202 PERL_ARGS_ASSERT_CK_TRUNC;
8204 if (o->op_flags & OPf_KIDS) {
8205 SVOP *kid = (SVOP*)cUNOPo->op_first;
8207 if (kid->op_type == OP_NULL)
8208 kid = (SVOP*)kid->op_sibling;
8209 if (kid && kid->op_type == OP_CONST &&
8210 (kid->op_private & OPpCONST_BARE))
8212 o->op_flags |= OPf_SPECIAL;
8213 kid->op_private &= ~OPpCONST_STRICT;
8220 Perl_ck_unpack(pTHX_ OP *o)
8222 OP *kid = cLISTOPo->op_first;
8224 PERL_ARGS_ASSERT_CK_UNPACK;
8226 if (kid->op_sibling) {
8227 kid = kid->op_sibling;
8228 if (!kid->op_sibling)
8229 kid->op_sibling = newDEFSVOP();
8235 Perl_ck_substr(pTHX_ OP *o)
8237 PERL_ARGS_ASSERT_CK_SUBSTR;
8240 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
8241 OP *kid = cLISTOPo->op_first;
8243 if (kid->op_type == OP_NULL)
8244 kid = kid->op_sibling;
8246 kid->op_flags |= OPf_MOD;
8253 Perl_ck_each(pTHX_ OP *o)
8256 OP *kid = cLISTOPo->op_first;
8258 PERL_ARGS_ASSERT_CK_EACH;
8260 if (kid->op_type == OP_PADAV || kid->op_type == OP_RV2AV) {
8261 const unsigned new_type = o->op_type == OP_EACH ? OP_AEACH
8262 : o->op_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
8263 o->op_type = new_type;
8264 o->op_ppaddr = PL_ppaddr[new_type];
8266 else if (!(kid->op_type == OP_PADHV || kid->op_type == OP_RV2HV
8267 || (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE)
8269 bad_type(1, "hash or array", PL_op_desc[o->op_type], kid);
8275 /* A peephole optimizer. We visit the ops in the order they're to execute.
8276 * See the comments at the top of this file for more details about when
8277 * peep() is called */
8280 Perl_peep(pTHX_ register OP *o)
8283 register OP* oldop = NULL;
8285 if (!o || o->op_opt)
8289 SAVEVPTR(PL_curcop);
8290 for (; o; o = o->op_next) {
8293 /* By default, this op has now been optimised. A couple of cases below
8294 clear this again. */
8297 switch (o->op_type) {
8300 PL_curcop = ((COP*)o); /* for warnings */
8304 if (cSVOPo->op_private & OPpCONST_STRICT)
8305 no_bareword_allowed(o);
8308 case OP_METHOD_NAMED:
8309 /* Relocate sv to the pad for thread safety.
8310 * Despite being a "constant", the SV is written to,
8311 * for reference counts, sv_upgrade() etc. */
8313 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
8314 if (o->op_type != OP_METHOD_NAMED && SvPADTMP(cSVOPo->op_sv)) {
8315 /* If op_sv is already a PADTMP then it is being used by
8316 * some pad, so make a copy. */
8317 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
8318 SvREADONLY_on(PAD_SVl(ix));
8319 SvREFCNT_dec(cSVOPo->op_sv);
8321 else if (o->op_type != OP_METHOD_NAMED
8322 && cSVOPo->op_sv == &PL_sv_undef) {
8323 /* PL_sv_undef is hack - it's unsafe to store it in the
8324 AV that is the pad, because av_fetch treats values of
8325 PL_sv_undef as a "free" AV entry and will merrily
8326 replace them with a new SV, causing pad_alloc to think
8327 that this pad slot is free. (When, clearly, it is not)
8329 SvOK_off(PAD_SVl(ix));
8330 SvPADTMP_on(PAD_SVl(ix));
8331 SvREADONLY_on(PAD_SVl(ix));
8334 SvREFCNT_dec(PAD_SVl(ix));
8335 SvPADTMP_on(cSVOPo->op_sv);
8336 PAD_SETSV(ix, cSVOPo->op_sv);
8337 /* XXX I don't know how this isn't readonly already. */
8338 SvREADONLY_on(PAD_SVl(ix));
8340 cSVOPo->op_sv = NULL;
8347 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
8348 if (o->op_next->op_private & OPpTARGET_MY) {
8349 if (o->op_flags & OPf_STACKED) /* chained concats */
8350 break; /* ignore_optimization */
8352 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
8353 o->op_targ = o->op_next->op_targ;
8354 o->op_next->op_targ = 0;
8355 o->op_private |= OPpTARGET_MY;
8358 op_null(o->op_next);
8362 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
8363 break; /* Scalar stub must produce undef. List stub is noop */
8367 if (o->op_targ == OP_NEXTSTATE
8368 || o->op_targ == OP_DBSTATE)
8370 PL_curcop = ((COP*)o);
8372 /* XXX: We avoid setting op_seq here to prevent later calls
8373 to peep() from mistakenly concluding that optimisation
8374 has already occurred. This doesn't fix the real problem,
8375 though (See 20010220.007). AMS 20010719 */
8376 /* op_seq functionality is now replaced by op_opt */
8383 if (oldop && o->op_next) {
8384 oldop->op_next = o->op_next;
8392 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
8393 OP* const pop = (o->op_type == OP_PADAV) ?
8394 o->op_next : o->op_next->op_next;
8396 if (pop && pop->op_type == OP_CONST &&
8397 ((PL_op = pop->op_next)) &&
8398 pop->op_next->op_type == OP_AELEM &&
8399 !(pop->op_next->op_private &
8400 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
8401 (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop))
8406 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
8407 no_bareword_allowed(pop);
8408 if (o->op_type == OP_GV)
8409 op_null(o->op_next);
8410 op_null(pop->op_next);
8412 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
8413 o->op_next = pop->op_next->op_next;
8414 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
8415 o->op_private = (U8)i;
8416 if (o->op_type == OP_GV) {
8421 o->op_flags |= OPf_SPECIAL;
8422 o->op_type = OP_AELEMFAST;
8427 if (o->op_next->op_type == OP_RV2SV) {
8428 if (!(o->op_next->op_private & OPpDEREF)) {
8429 op_null(o->op_next);
8430 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
8432 o->op_next = o->op_next->op_next;
8433 o->op_type = OP_GVSV;
8434 o->op_ppaddr = PL_ppaddr[OP_GVSV];
8437 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
8438 GV * const gv = cGVOPo_gv;
8439 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
8440 /* XXX could check prototype here instead of just carping */
8441 SV * const sv = sv_newmortal();
8442 gv_efullname3(sv, gv, NULL);
8443 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
8444 "%"SVf"() called too early to check prototype",
8448 else if (o->op_next->op_type == OP_READLINE
8449 && o->op_next->op_next->op_type == OP_CONCAT
8450 && (o->op_next->op_next->op_flags & OPf_STACKED))
8452 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
8453 o->op_type = OP_RCATLINE;
8454 o->op_flags |= OPf_STACKED;
8455 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
8456 op_null(o->op_next->op_next);
8457 op_null(o->op_next);
8473 while (cLOGOP->op_other->op_type == OP_NULL)
8474 cLOGOP->op_other = cLOGOP->op_other->op_next;
8475 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
8480 while (cLOOP->op_redoop->op_type == OP_NULL)
8481 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
8482 peep(cLOOP->op_redoop);
8483 while (cLOOP->op_nextop->op_type == OP_NULL)
8484 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
8485 peep(cLOOP->op_nextop);
8486 while (cLOOP->op_lastop->op_type == OP_NULL)
8487 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
8488 peep(cLOOP->op_lastop);
8492 assert(!(cPMOP->op_pmflags & PMf_ONCE));
8493 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
8494 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
8495 cPMOP->op_pmstashstartu.op_pmreplstart
8496 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
8497 peep(cPMOP->op_pmstashstartu.op_pmreplstart);
8501 if (o->op_next && o->op_next->op_type == OP_NEXTSTATE
8502 && ckWARN(WARN_SYNTAX))
8504 if (o->op_next->op_sibling) {
8505 const OPCODE type = o->op_next->op_sibling->op_type;
8506 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
8507 const line_t oldline = CopLINE(PL_curcop);
8508 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
8509 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8510 "Statement unlikely to be reached");
8511 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8512 "\t(Maybe you meant system() when you said exec()?)\n");
8513 CopLINE_set(PL_curcop, oldline);
8524 const char *key = NULL;
8527 if (((BINOP*)o)->op_last->op_type != OP_CONST)
8530 /* Make the CONST have a shared SV */
8531 svp = cSVOPx_svp(((BINOP*)o)->op_last);
8532 if (!SvFAKE(sv = *svp) || !SvREADONLY(sv)) {
8533 key = SvPV_const(sv, keylen);
8534 lexname = newSVpvn_share(key,
8535 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
8541 if ((o->op_private & (OPpLVAL_INTRO)))
8544 rop = (UNOP*)((BINOP*)o)->op_first;
8545 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
8547 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
8548 if (!SvPAD_TYPED(lexname))
8550 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8551 if (!fields || !GvHV(*fields))
8553 key = SvPV_const(*svp, keylen);
8554 if (!hv_fetch(GvHV(*fields), key,
8555 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8557 Perl_croak(aTHX_ "No such class field \"%s\" "
8558 "in variable %s of type %s",
8559 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
8572 SVOP *first_key_op, *key_op;
8574 if ((o->op_private & (OPpLVAL_INTRO))
8575 /* I bet there's always a pushmark... */
8576 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
8577 /* hmmm, no optimization if list contains only one key. */
8579 rop = (UNOP*)((LISTOP*)o)->op_last;
8580 if (rop->op_type != OP_RV2HV)
8582 if (rop->op_first->op_type == OP_PADSV)
8583 /* @$hash{qw(keys here)} */
8584 rop = (UNOP*)rop->op_first;
8586 /* @{$hash}{qw(keys here)} */
8587 if (rop->op_first->op_type == OP_SCOPE
8588 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
8590 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
8596 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
8597 if (!SvPAD_TYPED(lexname))
8599 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8600 if (!fields || !GvHV(*fields))
8602 /* Again guessing that the pushmark can be jumped over.... */
8603 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
8604 ->op_first->op_sibling;
8605 for (key_op = first_key_op; key_op;
8606 key_op = (SVOP*)key_op->op_sibling) {
8607 if (key_op->op_type != OP_CONST)
8609 svp = cSVOPx_svp(key_op);
8610 key = SvPV_const(*svp, keylen);
8611 if (!hv_fetch(GvHV(*fields), key,
8612 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8614 Perl_croak(aTHX_ "No such class field \"%s\" "
8615 "in variable %s of type %s",
8616 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
8623 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
8627 /* check that RHS of sort is a single plain array */
8628 OP *oright = cUNOPo->op_first;
8629 if (!oright || oright->op_type != OP_PUSHMARK)
8632 /* reverse sort ... can be optimised. */
8633 if (!cUNOPo->op_sibling) {
8634 /* Nothing follows us on the list. */
8635 OP * const reverse = o->op_next;
8637 if (reverse->op_type == OP_REVERSE &&
8638 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
8639 OP * const pushmark = cUNOPx(reverse)->op_first;
8640 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
8641 && (cUNOPx(pushmark)->op_sibling == o)) {
8642 /* reverse -> pushmark -> sort */
8643 o->op_private |= OPpSORT_REVERSE;
8645 pushmark->op_next = oright->op_next;
8651 /* make @a = sort @a act in-place */
8653 oright = cUNOPx(oright)->op_sibling;
8656 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
8657 oright = cUNOPx(oright)->op_sibling;
8661 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
8662 || oright->op_next != o
8663 || (oright->op_private & OPpLVAL_INTRO)
8667 /* o2 follows the chain of op_nexts through the LHS of the
8668 * assign (if any) to the aassign op itself */
8670 if (!o2 || o2->op_type != OP_NULL)
8673 if (!o2 || o2->op_type != OP_PUSHMARK)
8676 if (o2 && o2->op_type == OP_GV)
8679 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
8680 || (o2->op_private & OPpLVAL_INTRO)
8685 if (!o2 || o2->op_type != OP_NULL)
8688 if (!o2 || o2->op_type != OP_AASSIGN
8689 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
8692 /* check that the sort is the first arg on RHS of assign */
8694 o2 = cUNOPx(o2)->op_first;
8695 if (!o2 || o2->op_type != OP_NULL)
8697 o2 = cUNOPx(o2)->op_first;
8698 if (!o2 || o2->op_type != OP_PUSHMARK)
8700 if (o2->op_sibling != o)
8703 /* check the array is the same on both sides */
8704 if (oleft->op_type == OP_RV2AV) {
8705 if (oright->op_type != OP_RV2AV
8706 || !cUNOPx(oright)->op_first
8707 || cUNOPx(oright)->op_first->op_type != OP_GV
8708 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
8709 cGVOPx_gv(cUNOPx(oright)->op_first)
8713 else if (oright->op_type != OP_PADAV
8714 || oright->op_targ != oleft->op_targ
8718 /* transfer MODishness etc from LHS arg to RHS arg */
8719 oright->op_flags = oleft->op_flags;
8720 o->op_private |= OPpSORT_INPLACE;
8722 /* excise push->gv->rv2av->null->aassign */
8723 o2 = o->op_next->op_next;
8724 op_null(o2); /* PUSHMARK */
8726 if (o2->op_type == OP_GV) {
8727 op_null(o2); /* GV */
8730 op_null(o2); /* RV2AV or PADAV */
8731 o2 = o2->op_next->op_next;
8732 op_null(o2); /* AASSIGN */
8734 o->op_next = o2->op_next;
8740 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
8742 LISTOP *enter, *exlist;
8744 enter = (LISTOP *) o->op_next;
8747 if (enter->op_type == OP_NULL) {
8748 enter = (LISTOP *) enter->op_next;
8752 /* for $a (...) will have OP_GV then OP_RV2GV here.
8753 for (...) just has an OP_GV. */
8754 if (enter->op_type == OP_GV) {
8755 gvop = (OP *) enter;
8756 enter = (LISTOP *) enter->op_next;
8759 if (enter->op_type == OP_RV2GV) {
8760 enter = (LISTOP *) enter->op_next;
8766 if (enter->op_type != OP_ENTERITER)
8769 iter = enter->op_next;
8770 if (!iter || iter->op_type != OP_ITER)
8773 expushmark = enter->op_first;
8774 if (!expushmark || expushmark->op_type != OP_NULL
8775 || expushmark->op_targ != OP_PUSHMARK)
8778 exlist = (LISTOP *) expushmark->op_sibling;
8779 if (!exlist || exlist->op_type != OP_NULL
8780 || exlist->op_targ != OP_LIST)
8783 if (exlist->op_last != o) {
8784 /* Mmm. Was expecting to point back to this op. */
8787 theirmark = exlist->op_first;
8788 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
8791 if (theirmark->op_sibling != o) {
8792 /* There's something between the mark and the reverse, eg
8793 for (1, reverse (...))
8798 ourmark = ((LISTOP *)o)->op_first;
8799 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
8802 ourlast = ((LISTOP *)o)->op_last;
8803 if (!ourlast || ourlast->op_next != o)
8806 rv2av = ourmark->op_sibling;
8807 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
8808 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
8809 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
8810 /* We're just reversing a single array. */
8811 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
8812 enter->op_flags |= OPf_STACKED;
8815 /* We don't have control over who points to theirmark, so sacrifice
8817 theirmark->op_next = ourmark->op_next;
8818 theirmark->op_flags = ourmark->op_flags;
8819 ourlast->op_next = gvop ? gvop : (OP *) enter;
8822 enter->op_private |= OPpITER_REVERSED;
8823 iter->op_private |= OPpITER_REVERSED;
8830 UNOP *refgen, *rv2cv;
8833 if ((o->op_flags & OPf_WANT) != OPf_WANT_VOID)
8836 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
8839 rv2gv = ((BINOP *)o)->op_last;
8840 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
8843 refgen = (UNOP *)((BINOP *)o)->op_first;
8845 if (!refgen || refgen->op_type != OP_REFGEN)
8848 exlist = (LISTOP *)refgen->op_first;
8849 if (!exlist || exlist->op_type != OP_NULL
8850 || exlist->op_targ != OP_LIST)
8853 if (exlist->op_first->op_type != OP_PUSHMARK)
8856 rv2cv = (UNOP*)exlist->op_last;
8858 if (rv2cv->op_type != OP_RV2CV)
8861 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
8862 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
8863 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
8865 o->op_private |= OPpASSIGN_CV_TO_GV;
8866 rv2gv->op_private |= OPpDONT_INIT_GV;
8867 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
8875 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
8876 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
8886 Perl_custom_op_name(pTHX_ const OP* o)
8889 const IV index = PTR2IV(o->op_ppaddr);
8893 PERL_ARGS_ASSERT_CUSTOM_OP_NAME;
8895 if (!PL_custom_op_names) /* This probably shouldn't happen */
8896 return (char *)PL_op_name[OP_CUSTOM];
8898 keysv = sv_2mortal(newSViv(index));
8900 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
8902 return (char *)PL_op_name[OP_CUSTOM]; /* Don't know who you are */
8904 return SvPV_nolen(HeVAL(he));
8908 Perl_custom_op_desc(pTHX_ const OP* o)
8911 const IV index = PTR2IV(o->op_ppaddr);
8915 PERL_ARGS_ASSERT_CUSTOM_OP_DESC;
8917 if (!PL_custom_op_descs)
8918 return (char *)PL_op_desc[OP_CUSTOM];
8920 keysv = sv_2mortal(newSViv(index));
8922 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
8924 return (char *)PL_op_desc[OP_CUSTOM];
8926 return SvPV_nolen(HeVAL(he));
8931 /* Efficient sub that returns a constant scalar value. */
8933 const_sv_xsub(pTHX_ CV* cv)
8937 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
8941 /* diag_listed_as: SKIPME */
8942 Perl_croak(aTHX_ "usage: %s::%s()",
8943 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
8956 * c-indentation-style: bsd
8958 * indent-tabs-mode: t
8961 * ex: set ts=8 sts=4 sw=4 noet: