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)
876 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
877 if (!kPMOP->op_pmreplrootu.op_pmreplroot)
878 deprecate_old("implicit split to @_");
886 if (o->op_flags & OPf_KIDS) {
887 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
893 kid = cLISTOPo->op_first;
895 while ((kid = kid->op_sibling)) {
901 PL_curcop = &PL_compiling;
906 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
912 PL_curcop = &PL_compiling;
915 if (ckWARN(WARN_VOID))
916 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
923 Perl_scalarvoid(pTHX_ OP *o)
927 const char* useless = NULL;
931 PERL_ARGS_ASSERT_SCALARVOID;
933 /* trailing mad null ops don't count as "there" for void processing */
935 o->op_type != OP_NULL &&
937 o->op_sibling->op_type == OP_NULL)
940 for (sib = o->op_sibling;
941 sib && sib->op_type == OP_NULL;
942 sib = sib->op_sibling) ;
948 if (o->op_type == OP_NEXTSTATE
949 || o->op_type == OP_DBSTATE
950 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
951 || o->op_targ == OP_DBSTATE)))
952 PL_curcop = (COP*)o; /* for warning below */
954 /* assumes no premature commitment */
955 want = o->op_flags & OPf_WANT;
956 if ((want && want != OPf_WANT_SCALAR)
957 || (PL_parser && PL_parser->error_count)
958 || o->op_type == OP_RETURN)
963 if ((o->op_private & OPpTARGET_MY)
964 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
966 return scalar(o); /* As if inside SASSIGN */
969 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
971 switch (o->op_type) {
973 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
977 if (o->op_flags & OPf_STACKED)
981 if (o->op_private == 4)
1024 case OP_GETSOCKNAME:
1025 case OP_GETPEERNAME:
1030 case OP_GETPRIORITY:
1054 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1055 /* Otherwise it's "Useless use of grep iterator" */
1056 useless = OP_DESC(o);
1060 kid = cUNOPo->op_first;
1061 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1062 kid->op_type != OP_TRANS) {
1065 useless = "negative pattern binding (!~)";
1072 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1073 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1074 useless = "a variable";
1079 if (cSVOPo->op_private & OPpCONST_STRICT)
1080 no_bareword_allowed(o);
1082 if (ckWARN(WARN_VOID)) {
1084 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1085 "a constant (%"SVf")", sv));
1086 useless = SvPV_nolen(msv);
1089 useless = "a constant (undef)";
1090 if (o->op_private & OPpCONST_ARYBASE)
1092 /* don't warn on optimised away booleans, eg
1093 * use constant Foo, 5; Foo || print; */
1094 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1096 /* the constants 0 and 1 are permitted as they are
1097 conventionally used as dummies in constructs like
1098 1 while some_condition_with_side_effects; */
1099 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1101 else if (SvPOK(sv)) {
1102 /* perl4's way of mixing documentation and code
1103 (before the invention of POD) was based on a
1104 trick to mix nroff and perl code. The trick was
1105 built upon these three nroff macros being used in
1106 void context. The pink camel has the details in
1107 the script wrapman near page 319. */
1108 const char * const maybe_macro = SvPVX_const(sv);
1109 if (strnEQ(maybe_macro, "di", 2) ||
1110 strnEQ(maybe_macro, "ds", 2) ||
1111 strnEQ(maybe_macro, "ig", 2))
1116 op_null(o); /* don't execute or even remember it */
1120 o->op_type = OP_PREINC; /* pre-increment is faster */
1121 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1125 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1126 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1130 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1131 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1135 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1136 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1141 kid = cLOGOPo->op_first;
1142 if (kid->op_type == OP_NOT
1143 && (kid->op_flags & OPf_KIDS)
1145 if (o->op_type == OP_AND) {
1147 o->op_ppaddr = PL_ppaddr[OP_OR];
1149 o->op_type = OP_AND;
1150 o->op_ppaddr = PL_ppaddr[OP_AND];
1159 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1164 if (o->op_flags & OPf_STACKED)
1171 if (!(o->op_flags & OPf_KIDS))
1182 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1189 /* all requires must return a boolean value */
1190 o->op_flags &= ~OPf_WANT;
1195 if ((kid = cLISTOPo->op_first) && kid->op_type == OP_PUSHRE) {
1196 if (!kPMOP->op_pmreplrootu.op_pmreplroot)
1197 deprecate_old("implicit split to @_");
1201 if (useless && ckWARN(WARN_VOID))
1202 Perl_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
1207 S_listkids(pTHX_ OP *o)
1209 if (o && o->op_flags & OPf_KIDS) {
1211 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1218 Perl_list(pTHX_ OP *o)
1223 /* assumes no premature commitment */
1224 if (!o || (o->op_flags & OPf_WANT)
1225 || (PL_parser && PL_parser->error_count)
1226 || o->op_type == OP_RETURN)
1231 if ((o->op_private & OPpTARGET_MY)
1232 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1234 return o; /* As if inside SASSIGN */
1237 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1239 switch (o->op_type) {
1242 list(cBINOPo->op_first);
1247 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1255 if (!(o->op_flags & OPf_KIDS))
1257 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1258 list(cBINOPo->op_first);
1259 return gen_constant_list(o);
1266 kid = cLISTOPo->op_first;
1268 while ((kid = kid->op_sibling)) {
1269 if (kid->op_sibling)
1274 PL_curcop = &PL_compiling;
1278 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1279 if (kid->op_sibling)
1284 PL_curcop = &PL_compiling;
1287 /* all requires must return a boolean value */
1288 o->op_flags &= ~OPf_WANT;
1295 S_scalarseq(pTHX_ OP *o)
1299 const OPCODE type = o->op_type;
1301 if (type == OP_LINESEQ || type == OP_SCOPE ||
1302 type == OP_LEAVE || type == OP_LEAVETRY)
1305 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1306 if (kid->op_sibling) {
1310 PL_curcop = &PL_compiling;
1312 o->op_flags &= ~OPf_PARENS;
1313 if (PL_hints & HINT_BLOCK_SCOPE)
1314 o->op_flags |= OPf_PARENS;
1317 o = newOP(OP_STUB, 0);
1322 S_modkids(pTHX_ OP *o, I32 type)
1324 if (o && o->op_flags & OPf_KIDS) {
1326 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1332 /* Propagate lvalue ("modifiable") context to an op and its children.
1333 * 'type' represents the context type, roughly based on the type of op that
1334 * would do the modifying, although local() is represented by OP_NULL.
1335 * It's responsible for detecting things that can't be modified, flag
1336 * things that need to behave specially in an lvalue context (e.g., "$$x = 5"
1337 * might have to vivify a reference in $x), and so on.
1339 * For example, "$a+1 = 2" would cause mod() to be called with o being
1340 * OP_ADD and type being OP_SASSIGN, and would output an error.
1344 Perl_mod(pTHX_ OP *o, I32 type)
1348 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1351 if (!o || (PL_parser && PL_parser->error_count))
1354 if ((o->op_private & OPpTARGET_MY)
1355 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1360 switch (o->op_type) {
1366 if (!(o->op_private & OPpCONST_ARYBASE))
1369 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1370 CopARYBASE_set(&PL_compiling,
1371 (I32)SvIV(cSVOPx(PL_eval_start)->op_sv));
1375 SAVECOPARYBASE(&PL_compiling);
1376 CopARYBASE_set(&PL_compiling, 0);
1378 else if (type == OP_REFGEN)
1381 Perl_croak(aTHX_ "That use of $[ is unsupported");
1384 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1388 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1389 !(o->op_flags & OPf_STACKED)) {
1390 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1391 /* The default is to set op_private to the number of children,
1392 which for a UNOP such as RV2CV is always 1. And w're using
1393 the bit for a flag in RV2CV, so we need it clear. */
1394 o->op_private &= ~1;
1395 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1396 assert(cUNOPo->op_first->op_type == OP_NULL);
1397 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1400 else if (o->op_private & OPpENTERSUB_NOMOD)
1402 else { /* lvalue subroutine call */
1403 o->op_private |= OPpLVAL_INTRO;
1404 PL_modcount = RETURN_UNLIMITED_NUMBER;
1405 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1406 /* Backward compatibility mode: */
1407 o->op_private |= OPpENTERSUB_INARGS;
1410 else { /* Compile-time error message: */
1411 OP *kid = cUNOPo->op_first;
1415 if (kid->op_type != OP_PUSHMARK) {
1416 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1418 "panic: unexpected lvalue entersub "
1419 "args: type/targ %ld:%"UVuf,
1420 (long)kid->op_type, (UV)kid->op_targ);
1421 kid = kLISTOP->op_first;
1423 while (kid->op_sibling)
1424 kid = kid->op_sibling;
1425 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1427 if (kid->op_type == OP_METHOD_NAMED
1428 || kid->op_type == OP_METHOD)
1432 NewOp(1101, newop, 1, UNOP);
1433 newop->op_type = OP_RV2CV;
1434 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1435 newop->op_first = NULL;
1436 newop->op_next = (OP*)newop;
1437 kid->op_sibling = (OP*)newop;
1438 newop->op_private |= OPpLVAL_INTRO;
1439 newop->op_private &= ~1;
1443 if (kid->op_type != OP_RV2CV)
1445 "panic: unexpected lvalue entersub "
1446 "entry via type/targ %ld:%"UVuf,
1447 (long)kid->op_type, (UV)kid->op_targ);
1448 kid->op_private |= OPpLVAL_INTRO;
1449 break; /* Postpone until runtime */
1453 kid = kUNOP->op_first;
1454 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1455 kid = kUNOP->op_first;
1456 if (kid->op_type == OP_NULL)
1458 "Unexpected constant lvalue entersub "
1459 "entry via type/targ %ld:%"UVuf,
1460 (long)kid->op_type, (UV)kid->op_targ);
1461 if (kid->op_type != OP_GV) {
1462 /* Restore RV2CV to check lvalueness */
1464 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1465 okid->op_next = kid->op_next;
1466 kid->op_next = okid;
1469 okid->op_next = NULL;
1470 okid->op_type = OP_RV2CV;
1472 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1473 okid->op_private |= OPpLVAL_INTRO;
1474 okid->op_private &= ~1;
1478 cv = GvCV(kGVOP_gv);
1488 /* grep, foreach, subcalls, refgen */
1489 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1491 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1492 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1494 : (o->op_type == OP_ENTERSUB
1495 ? "non-lvalue subroutine call"
1497 type ? PL_op_desc[type] : "local"));
1511 case OP_RIGHT_SHIFT:
1520 if (!(o->op_flags & OPf_STACKED))
1527 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1533 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1534 PL_modcount = RETURN_UNLIMITED_NUMBER;
1535 return o; /* Treat \(@foo) like ordinary list. */
1539 if (scalar_mod_type(o, type))
1541 ref(cUNOPo->op_first, o->op_type);
1545 if (type == OP_LEAVESUBLV)
1546 o->op_private |= OPpMAYBE_LVSUB;
1552 PL_modcount = RETURN_UNLIMITED_NUMBER;
1555 ref(cUNOPo->op_first, o->op_type);
1560 PL_hints |= HINT_BLOCK_SCOPE;
1575 PL_modcount = RETURN_UNLIMITED_NUMBER;
1576 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1577 return o; /* Treat \(@foo) like ordinary list. */
1578 if (scalar_mod_type(o, type))
1580 if (type == OP_LEAVESUBLV)
1581 o->op_private |= OPpMAYBE_LVSUB;
1585 if (!type) /* local() */
1586 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1587 PAD_COMPNAME_PV(o->op_targ));
1595 if (type != OP_SASSIGN)
1599 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1604 if (type == OP_LEAVESUBLV)
1605 o->op_private |= OPpMAYBE_LVSUB;
1607 pad_free(o->op_targ);
1608 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1609 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1610 if (o->op_flags & OPf_KIDS)
1611 mod(cBINOPo->op_first->op_sibling, type);
1616 ref(cBINOPo->op_first, o->op_type);
1617 if (type == OP_ENTERSUB &&
1618 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1619 o->op_private |= OPpLVAL_DEFER;
1620 if (type == OP_LEAVESUBLV)
1621 o->op_private |= OPpMAYBE_LVSUB;
1631 if (o->op_flags & OPf_KIDS)
1632 mod(cLISTOPo->op_last, type);
1637 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1639 else if (!(o->op_flags & OPf_KIDS))
1641 if (o->op_targ != OP_LIST) {
1642 mod(cBINOPo->op_first, type);
1648 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1653 if (type != OP_LEAVESUBLV)
1655 break; /* mod()ing was handled by ck_return() */
1658 /* [20011101.069] File test operators interpret OPf_REF to mean that
1659 their argument is a filehandle; thus \stat(".") should not set
1661 if (type == OP_REFGEN &&
1662 PL_check[o->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst))
1665 if (type != OP_LEAVESUBLV)
1666 o->op_flags |= OPf_MOD;
1668 if (type == OP_AASSIGN || type == OP_SASSIGN)
1669 o->op_flags |= OPf_SPECIAL|OPf_REF;
1670 else if (!type) { /* local() */
1673 o->op_private |= OPpLVAL_INTRO;
1674 o->op_flags &= ~OPf_SPECIAL;
1675 PL_hints |= HINT_BLOCK_SCOPE;
1680 if (ckWARN(WARN_SYNTAX)) {
1681 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
1682 "Useless localization of %s", OP_DESC(o));
1686 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1687 && type != OP_LEAVESUBLV)
1688 o->op_flags |= OPf_REF;
1693 S_scalar_mod_type(const OP *o, I32 type)
1695 PERL_ARGS_ASSERT_SCALAR_MOD_TYPE;
1699 if (o->op_type == OP_RV2GV)
1723 case OP_RIGHT_SHIFT:
1743 S_is_handle_constructor(const OP *o, I32 numargs)
1745 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
1747 switch (o->op_type) {
1755 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1768 S_refkids(pTHX_ OP *o, I32 type)
1770 if (o && o->op_flags & OPf_KIDS) {
1772 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1779 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
1784 PERL_ARGS_ASSERT_DOREF;
1786 if (!o || (PL_parser && PL_parser->error_count))
1789 switch (o->op_type) {
1791 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1792 !(o->op_flags & OPf_STACKED)) {
1793 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1794 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1795 assert(cUNOPo->op_first->op_type == OP_NULL);
1796 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1797 o->op_flags |= OPf_SPECIAL;
1798 o->op_private &= ~1;
1803 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1804 doref(kid, type, set_op_ref);
1807 if (type == OP_DEFINED)
1808 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1809 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1812 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1813 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1814 : type == OP_RV2HV ? OPpDEREF_HV
1816 o->op_flags |= OPf_MOD;
1823 o->op_flags |= OPf_REF;
1826 if (type == OP_DEFINED)
1827 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1828 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1834 o->op_flags |= OPf_REF;
1839 if (!(o->op_flags & OPf_KIDS))
1841 doref(cBINOPo->op_first, type, set_op_ref);
1845 doref(cBINOPo->op_first, o->op_type, set_op_ref);
1846 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1847 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1848 : type == OP_RV2HV ? OPpDEREF_HV
1850 o->op_flags |= OPf_MOD;
1860 if (!(o->op_flags & OPf_KIDS))
1862 doref(cLISTOPo->op_last, type, set_op_ref);
1872 S_dup_attrlist(pTHX_ OP *o)
1877 PERL_ARGS_ASSERT_DUP_ATTRLIST;
1879 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1880 * where the first kid is OP_PUSHMARK and the remaining ones
1881 * are OP_CONST. We need to push the OP_CONST values.
1883 if (o->op_type == OP_CONST)
1884 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
1886 else if (o->op_type == OP_NULL)
1890 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1892 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1893 if (o->op_type == OP_CONST)
1894 rop = append_elem(OP_LIST, rop,
1895 newSVOP(OP_CONST, o->op_flags,
1896 SvREFCNT_inc_NN(cSVOPo->op_sv)));
1903 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
1908 PERL_ARGS_ASSERT_APPLY_ATTRS;
1910 /* fake up C<use attributes $pkg,$rv,@attrs> */
1911 ENTER; /* need to protect against side-effects of 'use' */
1912 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1914 #define ATTRSMODULE "attributes"
1915 #define ATTRSMODULE_PM "attributes.pm"
1918 /* Don't force the C<use> if we don't need it. */
1919 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
1920 if (svp && *svp != &PL_sv_undef)
1921 NOOP; /* already in %INC */
1923 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
1924 newSVpvs(ATTRSMODULE), NULL);
1927 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1928 newSVpvs(ATTRSMODULE),
1930 prepend_elem(OP_LIST,
1931 newSVOP(OP_CONST, 0, stashsv),
1932 prepend_elem(OP_LIST,
1933 newSVOP(OP_CONST, 0,
1935 dup_attrlist(attrs))));
1941 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
1944 OP *pack, *imop, *arg;
1947 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
1952 assert(target->op_type == OP_PADSV ||
1953 target->op_type == OP_PADHV ||
1954 target->op_type == OP_PADAV);
1956 /* Ensure that attributes.pm is loaded. */
1957 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
1959 /* Need package name for method call. */
1960 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
1962 /* Build up the real arg-list. */
1963 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1965 arg = newOP(OP_PADSV, 0);
1966 arg->op_targ = target->op_targ;
1967 arg = prepend_elem(OP_LIST,
1968 newSVOP(OP_CONST, 0, stashsv),
1969 prepend_elem(OP_LIST,
1970 newUNOP(OP_REFGEN, 0,
1971 mod(arg, OP_REFGEN)),
1972 dup_attrlist(attrs)));
1974 /* Fake up a method call to import */
1975 meth = newSVpvs_share("import");
1976 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
1977 append_elem(OP_LIST,
1978 prepend_elem(OP_LIST, pack, list(arg)),
1979 newSVOP(OP_METHOD_NAMED, 0, meth)));
1980 imop->op_private |= OPpENTERSUB_NOMOD;
1982 /* Combine the ops. */
1983 *imopsp = append_elem(OP_LIST, *imopsp, imop);
1987 =notfor apidoc apply_attrs_string
1989 Attempts to apply a list of attributes specified by the C<attrstr> and
1990 C<len> arguments to the subroutine identified by the C<cv> argument which
1991 is expected to be associated with the package identified by the C<stashpv>
1992 argument (see L<attributes>). It gets this wrong, though, in that it
1993 does not correctly identify the boundaries of the individual attribute
1994 specifications within C<attrstr>. This is not really intended for the
1995 public API, but has to be listed here for systems such as AIX which
1996 need an explicit export list for symbols. (It's called from XS code
1997 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
1998 to respect attribute syntax properly would be welcome.
2004 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2005 const char *attrstr, STRLEN len)
2009 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2012 len = strlen(attrstr);
2016 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2018 const char * const sstr = attrstr;
2019 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2020 attrs = append_elem(OP_LIST, attrs,
2021 newSVOP(OP_CONST, 0,
2022 newSVpvn(sstr, attrstr-sstr)));
2026 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2027 newSVpvs(ATTRSMODULE),
2028 NULL, prepend_elem(OP_LIST,
2029 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2030 prepend_elem(OP_LIST,
2031 newSVOP(OP_CONST, 0,
2032 newRV(MUTABLE_SV(cv))),
2037 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2042 PERL_ARGS_ASSERT_MY_KID;
2044 if (!o || (PL_parser && PL_parser->error_count))
2048 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2049 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2053 if (type == OP_LIST) {
2055 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2056 my_kid(kid, attrs, imopsp);
2057 } else if (type == OP_UNDEF
2063 } else if (type == OP_RV2SV || /* "our" declaration */
2065 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2066 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2067 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2069 PL_parser->in_my == KEY_our
2071 : PL_parser->in_my == KEY_state ? "state" : "my"));
2073 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2074 PL_parser->in_my = FALSE;
2075 PL_parser->in_my_stash = NULL;
2076 apply_attrs(GvSTASH(gv),
2077 (type == OP_RV2SV ? GvSV(gv) :
2078 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2079 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2082 o->op_private |= OPpOUR_INTRO;
2085 else if (type != OP_PADSV &&
2088 type != OP_PUSHMARK)
2090 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2092 PL_parser->in_my == KEY_our
2094 : PL_parser->in_my == KEY_state ? "state" : "my"));
2097 else if (attrs && type != OP_PUSHMARK) {
2100 PL_parser->in_my = FALSE;
2101 PL_parser->in_my_stash = NULL;
2103 /* check for C<my Dog $spot> when deciding package */
2104 stash = PAD_COMPNAME_TYPE(o->op_targ);
2106 stash = PL_curstash;
2107 apply_attrs_my(stash, o, attrs, imopsp);
2109 o->op_flags |= OPf_MOD;
2110 o->op_private |= OPpLVAL_INTRO;
2111 if (PL_parser->in_my == KEY_state)
2112 o->op_private |= OPpPAD_STATE;
2117 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2121 int maybe_scalar = 0;
2123 PERL_ARGS_ASSERT_MY_ATTRS;
2125 /* [perl #17376]: this appears to be premature, and results in code such as
2126 C< our(%x); > executing in list mode rather than void mode */
2128 if (o->op_flags & OPf_PARENS)
2138 o = my_kid(o, attrs, &rops);
2140 if (maybe_scalar && o->op_type == OP_PADSV) {
2141 o = scalar(append_list(OP_LIST, (LISTOP*)rops, (LISTOP*)o));
2142 o->op_private |= OPpLVAL_INTRO;
2145 o = append_list(OP_LIST, (LISTOP*)o, (LISTOP*)rops);
2147 PL_parser->in_my = FALSE;
2148 PL_parser->in_my_stash = NULL;
2153 Perl_sawparens(pTHX_ OP *o)
2155 PERL_UNUSED_CONTEXT;
2157 o->op_flags |= OPf_PARENS;
2162 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2166 const OPCODE ltype = left->op_type;
2167 const OPCODE rtype = right->op_type;
2169 PERL_ARGS_ASSERT_BIND_MATCH;
2171 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2172 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2174 const char * const desc
2175 = PL_op_desc[(rtype == OP_SUBST || rtype == OP_TRANS)
2176 ? (int)rtype : OP_MATCH];
2177 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
2178 ? "@array" : "%hash");
2179 Perl_warner(aTHX_ packWARN(WARN_MISC),
2180 "Applying %s to %s will act on scalar(%s)",
2181 desc, sample, sample);
2184 if (rtype == OP_CONST &&
2185 cSVOPx(right)->op_private & OPpCONST_BARE &&
2186 cSVOPx(right)->op_private & OPpCONST_STRICT)
2188 no_bareword_allowed(right);
2191 ismatchop = rtype == OP_MATCH ||
2192 rtype == OP_SUBST ||
2194 if (ismatchop && right->op_private & OPpTARGET_MY) {
2196 right->op_private &= ~OPpTARGET_MY;
2198 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2201 right->op_flags |= OPf_STACKED;
2202 if (rtype != OP_MATCH &&
2203 ! (rtype == OP_TRANS &&
2204 right->op_private & OPpTRANS_IDENTICAL))
2205 newleft = mod(left, rtype);
2208 if (right->op_type == OP_TRANS)
2209 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2211 o = prepend_elem(rtype, scalar(newleft), right);
2213 return newUNOP(OP_NOT, 0, scalar(o));
2217 return bind_match(type, left,
2218 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
2222 Perl_invert(pTHX_ OP *o)
2226 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2230 Perl_scope(pTHX_ OP *o)
2234 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2235 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2236 o->op_type = OP_LEAVE;
2237 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2239 else if (o->op_type == OP_LINESEQ) {
2241 o->op_type = OP_SCOPE;
2242 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2243 kid = ((LISTOP*)o)->op_first;
2244 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2247 /* The following deals with things like 'do {1 for 1}' */
2248 kid = kid->op_sibling;
2250 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2255 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2261 Perl_block_start(pTHX_ int full)
2264 const int retval = PL_savestack_ix;
2265 pad_block_start(full);
2267 PL_hints &= ~HINT_BLOCK_SCOPE;
2268 SAVECOMPILEWARNINGS();
2269 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2274 Perl_block_end(pTHX_ I32 floor, OP *seq)
2277 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2278 OP* const retval = scalarseq(seq);
2280 CopHINTS_set(&PL_compiling, PL_hints);
2282 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2291 const PADOFFSET offset = pad_findmy("$_");
2292 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2293 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2296 OP * const o = newOP(OP_PADSV, 0);
2297 o->op_targ = offset;
2303 Perl_newPROG(pTHX_ OP *o)
2307 PERL_ARGS_ASSERT_NEWPROG;
2312 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2313 ((PL_in_eval & EVAL_KEEPERR)
2314 ? OPf_SPECIAL : 0), o);
2315 PL_eval_start = linklist(PL_eval_root);
2316 PL_eval_root->op_private |= OPpREFCOUNTED;
2317 OpREFCNT_set(PL_eval_root, 1);
2318 PL_eval_root->op_next = 0;
2319 CALL_PEEP(PL_eval_start);
2322 if (o->op_type == OP_STUB) {
2323 PL_comppad_name = 0;
2325 S_op_destroy(aTHX_ o);
2328 PL_main_root = scope(sawparens(scalarvoid(o)));
2329 PL_curcop = &PL_compiling;
2330 PL_main_start = LINKLIST(PL_main_root);
2331 PL_main_root->op_private |= OPpREFCOUNTED;
2332 OpREFCNT_set(PL_main_root, 1);
2333 PL_main_root->op_next = 0;
2334 CALL_PEEP(PL_main_start);
2337 /* Register with debugger */
2339 CV * const cv = get_cvs("DB::postponed", 0);
2343 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
2345 call_sv(MUTABLE_SV(cv), G_DISCARD);
2352 Perl_localize(pTHX_ OP *o, I32 lex)
2356 PERL_ARGS_ASSERT_LOCALIZE;
2358 if (o->op_flags & OPf_PARENS)
2359 /* [perl #17376]: this appears to be premature, and results in code such as
2360 C< our(%x); > executing in list mode rather than void mode */
2367 if ( PL_parser->bufptr > PL_parser->oldbufptr
2368 && PL_parser->bufptr[-1] == ','
2369 && ckWARN(WARN_PARENTHESIS))
2371 char *s = PL_parser->bufptr;
2374 /* some heuristics to detect a potential error */
2375 while (*s && (strchr(", \t\n", *s)))
2379 if (*s && strchr("@$%*", *s) && *++s
2380 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2383 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2385 while (*s && (strchr(", \t\n", *s)))
2391 if (sigil && (*s == ';' || *s == '=')) {
2392 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2393 "Parentheses missing around \"%s\" list",
2395 ? (PL_parser->in_my == KEY_our
2397 : PL_parser->in_my == KEY_state
2407 o = mod(o, OP_NULL); /* a bit kludgey */
2408 PL_parser->in_my = FALSE;
2409 PL_parser->in_my_stash = NULL;
2414 Perl_jmaybe(pTHX_ OP *o)
2416 PERL_ARGS_ASSERT_JMAYBE;
2418 if (o->op_type == OP_LIST) {
2420 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2421 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2427 S_fold_constants(pTHX_ register OP *o)
2430 register OP * VOL curop;
2432 VOL I32 type = o->op_type;
2437 SV * const oldwarnhook = PL_warnhook;
2438 SV * const olddiehook = PL_diehook;
2442 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2444 if (PL_opargs[type] & OA_RETSCALAR)
2446 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2447 o->op_targ = pad_alloc(type, SVs_PADTMP);
2449 /* integerize op, unless it happens to be C<-foo>.
2450 * XXX should pp_i_negate() do magic string negation instead? */
2451 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2452 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2453 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2455 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2458 if (!(PL_opargs[type] & OA_FOLDCONST))
2463 /* XXX might want a ck_negate() for this */
2464 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2475 /* XXX what about the numeric ops? */
2476 if (PL_hints & HINT_LOCALE)
2481 if (PL_parser && PL_parser->error_count)
2482 goto nope; /* Don't try to run w/ errors */
2484 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2485 const OPCODE type = curop->op_type;
2486 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2488 type != OP_SCALAR &&
2490 type != OP_PUSHMARK)
2496 curop = LINKLIST(o);
2497 old_next = o->op_next;
2501 oldscope = PL_scopestack_ix;
2502 create_eval_scope(G_FAKINGEVAL);
2504 /* Verify that we don't need to save it: */
2505 assert(PL_curcop == &PL_compiling);
2506 StructCopy(&PL_compiling, ¬_compiling, COP);
2507 PL_curcop = ¬_compiling;
2508 /* The above ensures that we run with all the correct hints of the
2509 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
2510 assert(IN_PERL_RUNTIME);
2511 PL_warnhook = PERL_WARNHOOK_FATAL;
2518 sv = *(PL_stack_sp--);
2519 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2520 pad_swipe(o->op_targ, FALSE);
2521 else if (SvTEMP(sv)) { /* grab mortal temp? */
2522 SvREFCNT_inc_simple_void(sv);
2527 /* Something tried to die. Abandon constant folding. */
2528 /* Pretend the error never happened. */
2530 o->op_next = old_next;
2534 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
2535 PL_warnhook = oldwarnhook;
2536 PL_diehook = olddiehook;
2537 /* XXX note that this croak may fail as we've already blown away
2538 * the stack - eg any nested evals */
2539 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
2542 PL_warnhook = oldwarnhook;
2543 PL_diehook = olddiehook;
2544 PL_curcop = &PL_compiling;
2546 if (PL_scopestack_ix > oldscope)
2547 delete_eval_scope();
2556 if (type == OP_RV2GV)
2557 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
2559 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
2560 op_getmad(o,newop,'f');
2568 S_gen_constant_list(pTHX_ register OP *o)
2572 const I32 oldtmps_floor = PL_tmps_floor;
2575 if (PL_parser && PL_parser->error_count)
2576 return o; /* Don't attempt to run with errors */
2578 PL_op = curop = LINKLIST(o);
2584 assert (!(curop->op_flags & OPf_SPECIAL));
2585 assert(curop->op_type == OP_RANGE);
2587 PL_tmps_floor = oldtmps_floor;
2589 o->op_type = OP_RV2AV;
2590 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2591 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2592 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
2593 o->op_opt = 0; /* needs to be revisited in peep() */
2594 curop = ((UNOP*)o)->op_first;
2595 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
2597 op_getmad(curop,o,'O');
2606 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2609 if (!o || o->op_type != OP_LIST)
2610 o = newLISTOP(OP_LIST, 0, o, NULL);
2612 o->op_flags &= ~OPf_WANT;
2614 if (!(PL_opargs[type] & OA_MARK))
2615 op_null(cLISTOPo->op_first);
2617 o->op_type = (OPCODE)type;
2618 o->op_ppaddr = PL_ppaddr[type];
2619 o->op_flags |= flags;
2621 o = CHECKOP(type, o);
2622 if (o->op_type != (unsigned)type)
2625 return fold_constants(o);
2628 /* List constructors */
2631 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2639 if (first->op_type != (unsigned)type
2640 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2642 return newLISTOP(type, 0, first, last);
2645 if (first->op_flags & OPf_KIDS)
2646 ((LISTOP*)first)->op_last->op_sibling = last;
2648 first->op_flags |= OPf_KIDS;
2649 ((LISTOP*)first)->op_first = last;
2651 ((LISTOP*)first)->op_last = last;
2656 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2664 if (first->op_type != (unsigned)type)
2665 return prepend_elem(type, (OP*)first, (OP*)last);
2667 if (last->op_type != (unsigned)type)
2668 return append_elem(type, (OP*)first, (OP*)last);
2670 first->op_last->op_sibling = last->op_first;
2671 first->op_last = last->op_last;
2672 first->op_flags |= (last->op_flags & OPf_KIDS);
2675 if (last->op_first && first->op_madprop) {
2676 MADPROP *mp = last->op_first->op_madprop;
2678 while (mp->mad_next)
2680 mp->mad_next = first->op_madprop;
2683 last->op_first->op_madprop = first->op_madprop;
2686 first->op_madprop = last->op_madprop;
2687 last->op_madprop = 0;
2690 S_op_destroy(aTHX_ (OP*)last);
2696 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2704 if (last->op_type == (unsigned)type) {
2705 if (type == OP_LIST) { /* already a PUSHMARK there */
2706 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2707 ((LISTOP*)last)->op_first->op_sibling = first;
2708 if (!(first->op_flags & OPf_PARENS))
2709 last->op_flags &= ~OPf_PARENS;
2712 if (!(last->op_flags & OPf_KIDS)) {
2713 ((LISTOP*)last)->op_last = first;
2714 last->op_flags |= OPf_KIDS;
2716 first->op_sibling = ((LISTOP*)last)->op_first;
2717 ((LISTOP*)last)->op_first = first;
2719 last->op_flags |= OPf_KIDS;
2723 return newLISTOP(type, 0, first, last);
2731 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
2734 Newxz(tk, 1, TOKEN);
2735 tk->tk_type = (OPCODE)optype;
2736 tk->tk_type = 12345;
2738 tk->tk_mad = madprop;
2743 Perl_token_free(pTHX_ TOKEN* tk)
2745 PERL_ARGS_ASSERT_TOKEN_FREE;
2747 if (tk->tk_type != 12345)
2749 mad_free(tk->tk_mad);
2754 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
2759 PERL_ARGS_ASSERT_TOKEN_GETMAD;
2761 if (tk->tk_type != 12345) {
2762 Perl_warner(aTHX_ packWARN(WARN_MISC),
2763 "Invalid TOKEN object ignored");
2770 /* faked up qw list? */
2772 tm->mad_type == MAD_SV &&
2773 SvPVX((const SV *)tm->mad_val)[0] == 'q')
2780 /* pretend constant fold didn't happen? */
2781 if (mp->mad_key == 'f' &&
2782 (o->op_type == OP_CONST ||
2783 o->op_type == OP_GV) )
2785 token_getmad(tk,(OP*)mp->mad_val,slot);
2799 if (mp->mad_key == 'X')
2800 mp->mad_key = slot; /* just change the first one */
2810 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
2819 /* pretend constant fold didn't happen? */
2820 if (mp->mad_key == 'f' &&
2821 (o->op_type == OP_CONST ||
2822 o->op_type == OP_GV) )
2824 op_getmad(from,(OP*)mp->mad_val,slot);
2831 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
2834 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
2840 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
2849 /* pretend constant fold didn't happen? */
2850 if (mp->mad_key == 'f' &&
2851 (o->op_type == OP_CONST ||
2852 o->op_type == OP_GV) )
2854 op_getmad(from,(OP*)mp->mad_val,slot);
2861 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
2864 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
2868 PerlIO_printf(PerlIO_stderr(),
2869 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
2875 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
2893 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
2897 addmad(tm, &(o->op_madprop), slot);
2901 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
2922 Perl_newMADsv(pTHX_ char key, SV* sv)
2924 PERL_ARGS_ASSERT_NEWMADSV;
2926 return newMADPROP(key, MAD_SV, sv, 0);
2930 Perl_newMADPROP(pTHX_ char key, char type, const void* val, I32 vlen)
2933 Newxz(mp, 1, MADPROP);
2936 mp->mad_vlen = vlen;
2937 mp->mad_type = type;
2939 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
2944 Perl_mad_free(pTHX_ MADPROP* mp)
2946 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
2950 mad_free(mp->mad_next);
2951 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
2952 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
2953 switch (mp->mad_type) {
2957 Safefree((char*)mp->mad_val);
2960 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
2961 op_free((OP*)mp->mad_val);
2964 sv_free(MUTABLE_SV(mp->mad_val));
2967 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
2976 Perl_newNULLLIST(pTHX)
2978 return newOP(OP_STUB, 0);
2982 S_force_list(pTHX_ OP *o)
2984 if (!o || o->op_type != OP_LIST)
2985 o = newLISTOP(OP_LIST, 0, o, NULL);
2991 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
2996 NewOp(1101, listop, 1, LISTOP);
2998 listop->op_type = (OPCODE)type;
2999 listop->op_ppaddr = PL_ppaddr[type];
3002 listop->op_flags = (U8)flags;
3006 else if (!first && last)
3009 first->op_sibling = last;
3010 listop->op_first = first;
3011 listop->op_last = last;
3012 if (type == OP_LIST) {
3013 OP* const pushop = newOP(OP_PUSHMARK, 0);
3014 pushop->op_sibling = first;
3015 listop->op_first = pushop;
3016 listop->op_flags |= OPf_KIDS;
3018 listop->op_last = pushop;
3021 return CHECKOP(type, listop);
3025 Perl_newOP(pTHX_ I32 type, I32 flags)
3029 NewOp(1101, o, 1, OP);
3030 o->op_type = (OPCODE)type;
3031 o->op_ppaddr = PL_ppaddr[type];
3032 o->op_flags = (U8)flags;
3034 o->op_latefreed = 0;
3038 o->op_private = (U8)(0 | (flags >> 8));
3039 if (PL_opargs[type] & OA_RETSCALAR)
3041 if (PL_opargs[type] & OA_TARGET)
3042 o->op_targ = pad_alloc(type, SVs_PADTMP);
3043 return CHECKOP(type, o);
3047 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3053 first = newOP(OP_STUB, 0);
3054 if (PL_opargs[type] & OA_MARK)
3055 first = force_list(first);
3057 NewOp(1101, unop, 1, UNOP);
3058 unop->op_type = (OPCODE)type;
3059 unop->op_ppaddr = PL_ppaddr[type];
3060 unop->op_first = first;
3061 unop->op_flags = (U8)(flags | OPf_KIDS);
3062 unop->op_private = (U8)(1 | (flags >> 8));
3063 unop = (UNOP*) CHECKOP(type, unop);
3067 return fold_constants((OP *) unop);
3071 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3075 NewOp(1101, binop, 1, BINOP);
3078 first = newOP(OP_NULL, 0);
3080 binop->op_type = (OPCODE)type;
3081 binop->op_ppaddr = PL_ppaddr[type];
3082 binop->op_first = first;
3083 binop->op_flags = (U8)(flags | OPf_KIDS);
3086 binop->op_private = (U8)(1 | (flags >> 8));
3089 binop->op_private = (U8)(2 | (flags >> 8));
3090 first->op_sibling = last;
3093 binop = (BINOP*)CHECKOP(type, binop);
3094 if (binop->op_next || binop->op_type != (OPCODE)type)
3097 binop->op_last = binop->op_first->op_sibling;
3099 return fold_constants((OP *)binop);
3102 static int uvcompare(const void *a, const void *b)
3103 __attribute__nonnull__(1)
3104 __attribute__nonnull__(2)
3105 __attribute__pure__;
3106 static int uvcompare(const void *a, const void *b)
3108 if (*((const UV *)a) < (*(const UV *)b))
3110 if (*((const UV *)a) > (*(const UV *)b))
3112 if (*((const UV *)a+1) < (*(const UV *)b+1))
3114 if (*((const UV *)a+1) > (*(const UV *)b+1))
3120 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3123 SV * const tstr = ((SVOP*)expr)->op_sv;
3126 (repl->op_type == OP_NULL)
3127 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3129 ((SVOP*)repl)->op_sv;
3132 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3133 const U8 *r = (U8*)SvPV_const(rstr, rlen);
3137 register short *tbl;
3139 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3140 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3141 I32 del = o->op_private & OPpTRANS_DELETE;
3144 PERL_ARGS_ASSERT_PMTRANS;
3146 PL_hints |= HINT_BLOCK_SCOPE;
3149 o->op_private |= OPpTRANS_FROM_UTF;
3152 o->op_private |= OPpTRANS_TO_UTF;
3154 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
3155 SV* const listsv = newSVpvs("# comment\n");
3157 const U8* tend = t + tlen;
3158 const U8* rend = r + rlen;
3172 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3173 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
3176 const U32 flags = UTF8_ALLOW_DEFAULT;
3180 t = tsave = bytes_to_utf8(t, &len);
3183 if (!to_utf && rlen) {
3185 r = rsave = bytes_to_utf8(r, &len);
3189 /* There are several snags with this code on EBCDIC:
3190 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3191 2. scan_const() in toke.c has encoded chars in native encoding which makes
3192 ranges at least in EBCDIC 0..255 range the bottom odd.
3196 U8 tmpbuf[UTF8_MAXBYTES+1];
3199 Newx(cp, 2*tlen, UV);
3201 transv = newSVpvs("");
3203 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3205 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
3207 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3211 cp[2*i+1] = cp[2*i];
3215 qsort(cp, i, 2*sizeof(UV), uvcompare);
3216 for (j = 0; j < i; j++) {
3218 diff = val - nextmin;
3220 t = uvuni_to_utf8(tmpbuf,nextmin);
3221 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3223 U8 range_mark = UTF_TO_NATIVE(0xff);
3224 t = uvuni_to_utf8(tmpbuf, val - 1);
3225 sv_catpvn(transv, (char *)&range_mark, 1);
3226 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3233 t = uvuni_to_utf8(tmpbuf,nextmin);
3234 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3236 U8 range_mark = UTF_TO_NATIVE(0xff);
3237 sv_catpvn(transv, (char *)&range_mark, 1);
3239 t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff,
3240 UNICODE_ALLOW_SUPER);
3241 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3242 t = (const U8*)SvPVX_const(transv);
3243 tlen = SvCUR(transv);
3247 else if (!rlen && !del) {
3248 r = t; rlen = tlen; rend = tend;
3251 if ((!rlen && !del) || t == r ||
3252 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
3254 o->op_private |= OPpTRANS_IDENTICAL;
3258 while (t < tend || tfirst <= tlast) {
3259 /* see if we need more "t" chars */
3260 if (tfirst > tlast) {
3261 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3263 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
3265 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3272 /* now see if we need more "r" chars */
3273 if (rfirst > rlast) {
3275 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3277 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
3279 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3288 rfirst = rlast = 0xffffffff;
3292 /* now see which range will peter our first, if either. */
3293 tdiff = tlast - tfirst;
3294 rdiff = rlast - rfirst;
3301 if (rfirst == 0xffffffff) {
3302 diff = tdiff; /* oops, pretend rdiff is infinite */
3304 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
3305 (long)tfirst, (long)tlast);
3307 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
3311 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
3312 (long)tfirst, (long)(tfirst + diff),
3315 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
3316 (long)tfirst, (long)rfirst);
3318 if (rfirst + diff > max)
3319 max = rfirst + diff;
3321 grows = (tfirst < rfirst &&
3322 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
3334 else if (max > 0xff)
3339 PerlMemShared_free(cPVOPo->op_pv);
3340 cPVOPo->op_pv = NULL;
3342 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
3344 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
3345 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
3346 PAD_SETSV(cPADOPo->op_padix, swash);
3349 cSVOPo->op_sv = swash;
3351 SvREFCNT_dec(listsv);
3352 SvREFCNT_dec(transv);
3354 if (!del && havefinal && rlen)
3355 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
3356 newSVuv((UV)final), 0);
3359 o->op_private |= OPpTRANS_GROWS;
3365 op_getmad(expr,o,'e');
3366 op_getmad(repl,o,'r');
3374 tbl = (short*)cPVOPo->op_pv;
3376 Zero(tbl, 256, short);
3377 for (i = 0; i < (I32)tlen; i++)
3379 for (i = 0, j = 0; i < 256; i++) {
3381 if (j >= (I32)rlen) {
3390 if (i < 128 && r[j] >= 128)
3400 o->op_private |= OPpTRANS_IDENTICAL;
3402 else if (j >= (I32)rlen)
3407 PerlMemShared_realloc(tbl,
3408 (0x101+rlen-j) * sizeof(short));
3409 cPVOPo->op_pv = (char*)tbl;
3411 tbl[0x100] = (short)(rlen - j);
3412 for (i=0; i < (I32)rlen - j; i++)
3413 tbl[0x101+i] = r[j+i];
3417 if (!rlen && !del) {
3420 o->op_private |= OPpTRANS_IDENTICAL;
3422 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
3423 o->op_private |= OPpTRANS_IDENTICAL;
3425 for (i = 0; i < 256; i++)
3427 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
3428 if (j >= (I32)rlen) {
3430 if (tbl[t[i]] == -1)
3436 if (tbl[t[i]] == -1) {
3437 if (t[i] < 128 && r[j] >= 128)
3444 if(ckWARN(WARN_MISC)) {
3445 if(del && rlen == tlen) {
3446 Perl_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
3447 } else if(rlen > tlen) {
3448 Perl_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
3453 o->op_private |= OPpTRANS_GROWS;
3455 op_getmad(expr,o,'e');
3456 op_getmad(repl,o,'r');
3466 Perl_newPMOP(pTHX_ I32 type, I32 flags)
3471 NewOp(1101, pmop, 1, PMOP);
3472 pmop->op_type = (OPCODE)type;
3473 pmop->op_ppaddr = PL_ppaddr[type];
3474 pmop->op_flags = (U8)flags;
3475 pmop->op_private = (U8)(0 | (flags >> 8));
3477 if (PL_hints & HINT_RE_TAINT)
3478 pmop->op_pmflags |= PMf_RETAINT;
3479 if (PL_hints & HINT_LOCALE)
3480 pmop->op_pmflags |= PMf_LOCALE;
3484 assert(SvPOK(PL_regex_pad[0]));
3485 if (SvCUR(PL_regex_pad[0])) {
3486 /* Pop off the "packed" IV from the end. */
3487 SV *const repointer_list = PL_regex_pad[0];
3488 const char *p = SvEND(repointer_list) - sizeof(IV);
3489 const IV offset = *((IV*)p);
3491 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
3493 SvEND_set(repointer_list, p);
3495 pmop->op_pmoffset = offset;
3496 /* This slot should be free, so assert this: */
3497 assert(PL_regex_pad[offset] == &PL_sv_undef);
3499 SV * const repointer = &PL_sv_undef;
3500 av_push(PL_regex_padav, repointer);
3501 pmop->op_pmoffset = av_len(PL_regex_padav);
3502 PL_regex_pad = AvARRAY(PL_regex_padav);
3506 return CHECKOP(type, pmop);
3509 /* Given some sort of match op o, and an expression expr containing a
3510 * pattern, either compile expr into a regex and attach it to o (if it's
3511 * constant), or convert expr into a runtime regcomp op sequence (if it's
3514 * isreg indicates that the pattern is part of a regex construct, eg
3515 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
3516 * split "pattern", which aren't. In the former case, expr will be a list
3517 * if the pattern contains more than one term (eg /a$b/) or if it contains
3518 * a replacement, ie s/// or tr///.
3522 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
3527 I32 repl_has_vars = 0;
3531 PERL_ARGS_ASSERT_PMRUNTIME;
3533 if (o->op_type == OP_SUBST || o->op_type == OP_TRANS) {
3534 /* last element in list is the replacement; pop it */
3536 repl = cLISTOPx(expr)->op_last;
3537 kid = cLISTOPx(expr)->op_first;
3538 while (kid->op_sibling != repl)
3539 kid = kid->op_sibling;
3540 kid->op_sibling = NULL;
3541 cLISTOPx(expr)->op_last = kid;
3544 if (isreg && expr->op_type == OP_LIST &&
3545 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
3547 /* convert single element list to element */
3548 OP* const oe = expr;
3549 expr = cLISTOPx(oe)->op_first->op_sibling;
3550 cLISTOPx(oe)->op_first->op_sibling = NULL;
3551 cLISTOPx(oe)->op_last = NULL;
3555 if (o->op_type == OP_TRANS) {
3556 return pmtrans(o, expr, repl);
3559 reglist = isreg && expr->op_type == OP_LIST;
3563 PL_hints |= HINT_BLOCK_SCOPE;
3566 if (expr->op_type == OP_CONST) {
3567 SV *pat = ((SVOP*)expr)->op_sv;
3568 U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME;
3570 if (o->op_flags & OPf_SPECIAL)
3571 pm_flags |= RXf_SPLIT;
3574 assert (SvUTF8(pat));
3575 } else if (SvUTF8(pat)) {
3576 /* Not doing UTF-8, despite what the SV says. Is this only if we're
3577 trapped in use 'bytes'? */
3578 /* Make a copy of the octet sequence, but without the flag on, as
3579 the compiler now honours the SvUTF8 flag on pat. */
3581 const char *const p = SvPV(pat, len);
3582 pat = newSVpvn_flags(p, len, SVs_TEMP);
3585 PM_SETRE(pm, CALLREGCOMP(pat, pm_flags));
3588 op_getmad(expr,(OP*)pm,'e');
3594 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
3595 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
3597 : OP_REGCMAYBE),0,expr);
3599 NewOp(1101, rcop, 1, LOGOP);
3600 rcop->op_type = OP_REGCOMP;
3601 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
3602 rcop->op_first = scalar(expr);
3603 rcop->op_flags |= OPf_KIDS
3604 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
3605 | (reglist ? OPf_STACKED : 0);
3606 rcop->op_private = 1;
3609 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
3611 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
3614 /* establish postfix order */
3615 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
3617 rcop->op_next = expr;
3618 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
3621 rcop->op_next = LINKLIST(expr);
3622 expr->op_next = (OP*)rcop;
3625 prepend_elem(o->op_type, scalar((OP*)rcop), o);
3630 if (pm->op_pmflags & PMf_EVAL) {
3632 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
3633 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
3635 else if (repl->op_type == OP_CONST)
3639 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
3640 if (curop->op_type == OP_SCOPE
3641 || curop->op_type == OP_LEAVE
3642 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
3643 if (curop->op_type == OP_GV) {
3644 GV * const gv = cGVOPx_gv(curop);
3646 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
3649 else if (curop->op_type == OP_RV2CV)
3651 else if (curop->op_type == OP_RV2SV ||
3652 curop->op_type == OP_RV2AV ||
3653 curop->op_type == OP_RV2HV ||
3654 curop->op_type == OP_RV2GV) {
3655 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3658 else if (curop->op_type == OP_PADSV ||
3659 curop->op_type == OP_PADAV ||
3660 curop->op_type == OP_PADHV ||
3661 curop->op_type == OP_PADANY)
3665 else if (curop->op_type == OP_PUSHRE)
3666 NOOP; /* Okay here, dangerous in newASSIGNOP */
3676 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
3678 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3679 prepend_elem(o->op_type, scalar(repl), o);
3682 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
3683 pm->op_pmflags |= PMf_MAYBE_CONST;
3685 NewOp(1101, rcop, 1, LOGOP);
3686 rcop->op_type = OP_SUBSTCONT;
3687 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3688 rcop->op_first = scalar(repl);
3689 rcop->op_flags |= OPf_KIDS;
3690 rcop->op_private = 1;
3693 /* establish postfix order */
3694 rcop->op_next = LINKLIST(repl);
3695 repl->op_next = (OP*)rcop;
3697 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
3698 assert(!(pm->op_pmflags & PMf_ONCE));
3699 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
3708 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3713 PERL_ARGS_ASSERT_NEWSVOP;
3715 NewOp(1101, svop, 1, SVOP);
3716 svop->op_type = (OPCODE)type;
3717 svop->op_ppaddr = PL_ppaddr[type];
3719 svop->op_next = (OP*)svop;
3720 svop->op_flags = (U8)flags;
3721 if (PL_opargs[type] & OA_RETSCALAR)
3723 if (PL_opargs[type] & OA_TARGET)
3724 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3725 return CHECKOP(type, svop);
3730 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3735 PERL_ARGS_ASSERT_NEWPADOP;
3737 NewOp(1101, padop, 1, PADOP);
3738 padop->op_type = (OPCODE)type;
3739 padop->op_ppaddr = PL_ppaddr[type];
3740 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3741 SvREFCNT_dec(PAD_SVl(padop->op_padix));
3742 PAD_SETSV(padop->op_padix, sv);
3745 padop->op_next = (OP*)padop;
3746 padop->op_flags = (U8)flags;
3747 if (PL_opargs[type] & OA_RETSCALAR)
3749 if (PL_opargs[type] & OA_TARGET)
3750 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3751 return CHECKOP(type, padop);
3756 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3760 PERL_ARGS_ASSERT_NEWGVOP;
3764 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3766 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3771 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3775 NewOp(1101, pvop, 1, PVOP);
3776 pvop->op_type = (OPCODE)type;
3777 pvop->op_ppaddr = PL_ppaddr[type];
3779 pvop->op_next = (OP*)pvop;
3780 pvop->op_flags = (U8)flags;
3781 if (PL_opargs[type] & OA_RETSCALAR)
3783 if (PL_opargs[type] & OA_TARGET)
3784 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3785 return CHECKOP(type, pvop);
3793 Perl_package(pTHX_ OP *o)
3796 SV *const sv = cSVOPo->op_sv;
3801 PERL_ARGS_ASSERT_PACKAGE;
3803 save_hptr(&PL_curstash);
3804 save_item(PL_curstname);
3806 PL_curstash = gv_stashsv(sv, GV_ADD);
3808 sv_setsv(PL_curstname, sv);
3810 PL_hints |= HINT_BLOCK_SCOPE;
3811 PL_parser->copline = NOLINE;
3812 PL_parser->expect = XSTATE;
3817 if (!PL_madskills) {
3822 pegop = newOP(OP_NULL,0);
3823 op_getmad(o,pegop,'P');
3833 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
3840 OP *pegop = newOP(OP_NULL,0);
3843 PERL_ARGS_ASSERT_UTILIZE;
3845 if (idop->op_type != OP_CONST)
3846 Perl_croak(aTHX_ "Module name must be constant");
3849 op_getmad(idop,pegop,'U');
3854 SV * const vesv = ((SVOP*)version)->op_sv;
3857 op_getmad(version,pegop,'V');
3858 if (!arg && !SvNIOKp(vesv)) {
3865 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3866 Perl_croak(aTHX_ "Version number must be a constant number");
3868 /* Make copy of idop so we don't free it twice */
3869 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3871 /* Fake up a method call to VERSION */
3872 meth = newSVpvs_share("VERSION");
3873 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3874 append_elem(OP_LIST,
3875 prepend_elem(OP_LIST, pack, list(version)),
3876 newSVOP(OP_METHOD_NAMED, 0, meth)));
3880 /* Fake up an import/unimport */
3881 if (arg && arg->op_type == OP_STUB) {
3883 op_getmad(arg,pegop,'S');
3884 imop = arg; /* no import on explicit () */
3886 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
3887 imop = NULL; /* use 5.0; */
3889 idop->op_private |= OPpCONST_NOVER;
3895 op_getmad(arg,pegop,'A');
3897 /* Make copy of idop so we don't free it twice */
3898 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3900 /* Fake up a method call to import/unimport */
3902 ? newSVpvs_share("import") : newSVpvs_share("unimport");
3903 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3904 append_elem(OP_LIST,
3905 prepend_elem(OP_LIST, pack, list(arg)),
3906 newSVOP(OP_METHOD_NAMED, 0, meth)));
3909 /* Fake up the BEGIN {}, which does its thing immediately. */
3911 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
3914 append_elem(OP_LINESEQ,
3915 append_elem(OP_LINESEQ,
3916 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
3917 newSTATEOP(0, NULL, veop)),
3918 newSTATEOP(0, NULL, imop) ));
3920 /* The "did you use incorrect case?" warning used to be here.
3921 * The problem is that on case-insensitive filesystems one
3922 * might get false positives for "use" (and "require"):
3923 * "use Strict" or "require CARP" will work. This causes
3924 * portability problems for the script: in case-strict
3925 * filesystems the script will stop working.
3927 * The "incorrect case" warning checked whether "use Foo"
3928 * imported "Foo" to your namespace, but that is wrong, too:
3929 * there is no requirement nor promise in the language that
3930 * a Foo.pm should or would contain anything in package "Foo".
3932 * There is very little Configure-wise that can be done, either:
3933 * the case-sensitivity of the build filesystem of Perl does not
3934 * help in guessing the case-sensitivity of the runtime environment.
3937 PL_hints |= HINT_BLOCK_SCOPE;
3938 PL_parser->copline = NOLINE;
3939 PL_parser->expect = XSTATE;
3940 PL_cop_seqmax++; /* Purely for B::*'s benefit */
3943 if (!PL_madskills) {
3944 /* FIXME - don't allocate pegop if !PL_madskills */
3953 =head1 Embedding Functions
3955 =for apidoc load_module
3957 Loads the module whose name is pointed to by the string part of name.
3958 Note that the actual module name, not its filename, should be given.
3959 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
3960 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
3961 (or 0 for no flags). ver, if specified, provides version semantics
3962 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
3963 arguments can be used to specify arguments to the module's import()
3964 method, similar to C<use Foo::Bar VERSION LIST>.
3969 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3973 PERL_ARGS_ASSERT_LOAD_MODULE;
3975 va_start(args, ver);
3976 vload_module(flags, name, ver, &args);
3980 #ifdef PERL_IMPLICIT_CONTEXT
3982 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3986 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
3987 va_start(args, ver);
3988 vload_module(flags, name, ver, &args);
3994 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3998 OP * const modname = newSVOP(OP_CONST, 0, name);
4000 PERL_ARGS_ASSERT_VLOAD_MODULE;
4002 modname->op_private |= OPpCONST_BARE;
4004 veop = newSVOP(OP_CONST, 0, ver);
4008 if (flags & PERL_LOADMOD_NOIMPORT) {
4009 imop = sawparens(newNULLLIST());
4011 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
4012 imop = va_arg(*args, OP*);
4017 sv = va_arg(*args, SV*);
4019 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
4020 sv = va_arg(*args, SV*);
4024 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
4025 * that it has a PL_parser to play with while doing that, and also
4026 * that it doesn't mess with any existing parser, by creating a tmp
4027 * new parser with lex_start(). This won't actually be used for much,
4028 * since pp_require() will create another parser for the real work. */
4031 SAVEVPTR(PL_curcop);
4032 lex_start(NULL, NULL, FALSE);
4033 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
4034 veop, modname, imop);
4039 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
4045 PERL_ARGS_ASSERT_DOFILE;
4047 if (!force_builtin) {
4048 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
4049 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
4050 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
4051 gv = gvp ? *gvp : NULL;
4055 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
4056 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
4057 append_elem(OP_LIST, term,
4058 scalar(newUNOP(OP_RV2CV, 0,
4059 newGVOP(OP_GV, 0, gv))))));
4062 doop = newUNOP(OP_DOFILE, 0, scalar(term));
4068 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
4070 return newBINOP(OP_LSLICE, flags,
4071 list(force_list(subscript)),
4072 list(force_list(listval)) );
4076 S_is_list_assignment(pTHX_ register const OP *o)
4084 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
4085 o = cUNOPo->op_first;
4087 flags = o->op_flags;
4089 if (type == OP_COND_EXPR) {
4090 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
4091 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
4096 yyerror("Assignment to both a list and a scalar");
4100 if (type == OP_LIST &&
4101 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
4102 o->op_private & OPpLVAL_INTRO)
4105 if (type == OP_LIST || flags & OPf_PARENS ||
4106 type == OP_RV2AV || type == OP_RV2HV ||
4107 type == OP_ASLICE || type == OP_HSLICE)
4110 if (type == OP_PADAV || type == OP_PADHV)
4113 if (type == OP_RV2SV)
4120 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
4126 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
4127 return newLOGOP(optype, 0,
4128 mod(scalar(left), optype),
4129 newUNOP(OP_SASSIGN, 0, scalar(right)));
4132 return newBINOP(optype, OPf_STACKED,
4133 mod(scalar(left), optype), scalar(right));
4137 if (is_list_assignment(left)) {
4138 static const char no_list_state[] = "Initialization of state variables"
4139 " in list context currently forbidden";
4141 bool maybe_common_vars = TRUE;
4144 /* Grandfathering $[ assignment here. Bletch.*/
4145 /* Only simple assignments like C<< ($[) = 1 >> are allowed */
4146 PL_eval_start = (left->op_type == OP_CONST) ? right : NULL;
4147 left = mod(left, OP_AASSIGN);
4150 else if (left->op_type == OP_CONST) {
4152 /* Result of assignment is always 1 (or we'd be dead already) */
4153 return newSVOP(OP_CONST, 0, newSViv(1));
4155 curop = list(force_list(left));
4156 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
4157 o->op_private = (U8)(0 | (flags >> 8));
4159 if ((left->op_type == OP_LIST
4160 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
4162 OP* lop = ((LISTOP*)left)->op_first;
4163 maybe_common_vars = FALSE;
4165 if (lop->op_type == OP_PADSV ||
4166 lop->op_type == OP_PADAV ||
4167 lop->op_type == OP_PADHV ||
4168 lop->op_type == OP_PADANY) {
4169 if (!(lop->op_private & OPpLVAL_INTRO))
4170 maybe_common_vars = TRUE;
4172 if (lop->op_private & OPpPAD_STATE) {
4173 if (left->op_private & OPpLVAL_INTRO) {
4174 /* Each variable in state($a, $b, $c) = ... */
4177 /* Each state variable in
4178 (state $a, my $b, our $c, $d, undef) = ... */
4180 yyerror(no_list_state);
4182 /* Each my variable in
4183 (state $a, my $b, our $c, $d, undef) = ... */
4185 } else if (lop->op_type == OP_UNDEF ||
4186 lop->op_type == OP_PUSHMARK) {
4187 /* undef may be interesting in
4188 (state $a, undef, state $c) */
4190 /* Other ops in the list. */
4191 maybe_common_vars = TRUE;
4193 lop = lop->op_sibling;
4196 else if ((left->op_private & OPpLVAL_INTRO)
4197 && ( left->op_type == OP_PADSV
4198 || left->op_type == OP_PADAV
4199 || left->op_type == OP_PADHV
4200 || left->op_type == OP_PADANY))
4202 maybe_common_vars = FALSE;
4203 if (left->op_private & OPpPAD_STATE) {
4204 /* All single variable list context state assignments, hence
4214 yyerror(no_list_state);
4218 /* PL_generation sorcery:
4219 * an assignment like ($a,$b) = ($c,$d) is easier than
4220 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
4221 * To detect whether there are common vars, the global var
4222 * PL_generation is incremented for each assign op we compile.
4223 * Then, while compiling the assign op, we run through all the
4224 * variables on both sides of the assignment, setting a spare slot
4225 * in each of them to PL_generation. If any of them already have
4226 * that value, we know we've got commonality. We could use a
4227 * single bit marker, but then we'd have to make 2 passes, first
4228 * to clear the flag, then to test and set it. To find somewhere
4229 * to store these values, evil chicanery is done with SvUVX().
4232 if (maybe_common_vars) {
4235 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
4236 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
4237 if (curop->op_type == OP_GV) {
4238 GV *gv = cGVOPx_gv(curop);
4240 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4242 GvASSIGN_GENERATION_set(gv, PL_generation);
4244 else if (curop->op_type == OP_PADSV ||
4245 curop->op_type == OP_PADAV ||
4246 curop->op_type == OP_PADHV ||
4247 curop->op_type == OP_PADANY)
4249 if (PAD_COMPNAME_GEN(curop->op_targ)
4250 == (STRLEN)PL_generation)
4252 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
4255 else if (curop->op_type == OP_RV2CV)
4257 else if (curop->op_type == OP_RV2SV ||
4258 curop->op_type == OP_RV2AV ||
4259 curop->op_type == OP_RV2HV ||
4260 curop->op_type == OP_RV2GV) {
4261 if (lastop->op_type != OP_GV) /* funny deref? */
4264 else if (curop->op_type == OP_PUSHRE) {
4266 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
4267 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
4269 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4271 GvASSIGN_GENERATION_set(gv, PL_generation);
4275 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
4278 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4280 GvASSIGN_GENERATION_set(gv, PL_generation);
4290 o->op_private |= OPpASSIGN_COMMON;
4293 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
4294 OP* tmpop = ((LISTOP*)right)->op_first;
4295 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
4296 PMOP * const pm = (PMOP*)tmpop;
4297 if (left->op_type == OP_RV2AV &&
4298 !(left->op_private & OPpLVAL_INTRO) &&
4299 !(o->op_private & OPpASSIGN_COMMON) )
4301 tmpop = ((UNOP*)left)->op_first;
4302 if (tmpop->op_type == OP_GV
4304 && !pm->op_pmreplrootu.op_pmtargetoff
4306 && !pm->op_pmreplrootu.op_pmtargetgv
4310 pm->op_pmreplrootu.op_pmtargetoff
4311 = cPADOPx(tmpop)->op_padix;
4312 cPADOPx(tmpop)->op_padix = 0; /* steal it */
4314 pm->op_pmreplrootu.op_pmtargetgv
4315 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
4316 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
4318 pm->op_pmflags |= PMf_ONCE;
4319 tmpop = cUNOPo->op_first; /* to list (nulled) */
4320 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
4321 tmpop->op_sibling = NULL; /* don't free split */
4322 right->op_next = tmpop->op_next; /* fix starting loc */
4323 op_free(o); /* blow off assign */
4324 right->op_flags &= ~OPf_WANT;
4325 /* "I don't know and I don't care." */
4330 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
4331 ((LISTOP*)right)->op_last->op_type == OP_CONST)
4333 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
4334 if (SvIOK(sv) && SvIVX(sv) == 0)
4335 sv_setiv(sv, PL_modcount+1);
4343 right = newOP(OP_UNDEF, 0);
4344 if (right->op_type == OP_READLINE) {
4345 right->op_flags |= OPf_STACKED;
4346 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
4349 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
4350 o = newBINOP(OP_SASSIGN, flags,
4351 scalar(right), mod(scalar(left), OP_SASSIGN) );
4355 if (!PL_madskills) { /* assignment to $[ is ignored when making a mad dump */
4356 deprecate("assignment to $[");
4358 o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling)));
4359 o->op_private |= OPpCONST_ARYBASE;
4367 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
4370 const U32 seq = intro_my();
4373 NewOp(1101, cop, 1, COP);
4374 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
4375 cop->op_type = OP_DBSTATE;
4376 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
4379 cop->op_type = OP_NEXTSTATE;
4380 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
4382 cop->op_flags = (U8)flags;
4383 CopHINTS_set(cop, PL_hints);
4385 cop->op_private |= NATIVE_HINTS;
4387 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
4388 cop->op_next = (OP*)cop;
4391 /* CopARYBASE is now "virtual", in that it's stored as a flag bit in
4392 CopHINTS and a possible value in cop_hints_hash, so no need to copy it.
4394 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
4395 cop->cop_hints_hash = PL_curcop->cop_hints_hash;
4396 if (cop->cop_hints_hash) {
4398 cop->cop_hints_hash->refcounted_he_refcnt++;
4399 HINTS_REFCNT_UNLOCK;
4403 = Perl_store_cop_label(aTHX_ cop->cop_hints_hash, label);
4405 PL_hints |= HINT_BLOCK_SCOPE;
4406 /* It seems that we need to defer freeing this pointer, as other parts
4407 of the grammar end up wanting to copy it after this op has been
4412 if (PL_parser && PL_parser->copline == NOLINE)
4413 CopLINE_set(cop, CopLINE(PL_curcop));
4415 CopLINE_set(cop, PL_parser->copline);
4417 PL_parser->copline = NOLINE;
4420 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
4422 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
4424 CopSTASH_set(cop, PL_curstash);
4426 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
4427 /* this line can have a breakpoint - store the cop in IV */
4428 AV *av = CopFILEAVx(PL_curcop);
4430 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
4431 if (svp && *svp != &PL_sv_undef ) {
4432 (void)SvIOK_on(*svp);
4433 SvIV_set(*svp, PTR2IV(cop));
4438 if (flags & OPf_SPECIAL)
4440 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
4445 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
4449 PERL_ARGS_ASSERT_NEWLOGOP;
4451 return new_logop(type, flags, &first, &other);
4455 S_search_const(pTHX_ OP *o)
4457 PERL_ARGS_ASSERT_SEARCH_CONST;
4459 switch (o->op_type) {
4463 if (o->op_flags & OPf_KIDS)
4464 return search_const(cUNOPo->op_first);
4471 if (!(o->op_flags & OPf_KIDS))
4473 kid = cLISTOPo->op_first;
4475 switch (kid->op_type) {
4479 kid = kid->op_sibling;
4482 if (kid != cLISTOPo->op_last)
4488 kid = cLISTOPo->op_last;
4490 return search_const(kid);
4498 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
4506 int prepend_not = 0;
4508 PERL_ARGS_ASSERT_NEW_LOGOP;
4513 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
4514 return newBINOP(type, flags, scalar(first), scalar(other));
4516 scalarboolean(first);
4517 /* optimize AND and OR ops that have NOTs as children */
4518 if (first->op_type == OP_NOT
4519 && (first->op_flags & OPf_KIDS)
4520 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
4521 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
4523 if (type == OP_AND || type == OP_OR) {
4529 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
4531 prepend_not = 1; /* prepend a NOT op later */
4535 /* search for a constant op that could let us fold the test */
4536 if ((cstop = search_const(first))) {
4537 if (cstop->op_private & OPpCONST_STRICT)
4538 no_bareword_allowed(cstop);
4539 else if ((cstop->op_private & OPpCONST_BARE) && ckWARN(WARN_BAREWORD))
4540 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
4541 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
4542 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
4543 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
4545 if (other->op_type == OP_CONST)
4546 other->op_private |= OPpCONST_SHORTCIRCUIT;
4548 OP *newop = newUNOP(OP_NULL, 0, other);
4549 op_getmad(first, newop, '1');
4550 newop->op_targ = type; /* set "was" field */
4557 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
4558 const OP *o2 = other;
4559 if ( ! (o2->op_type == OP_LIST
4560 && (( o2 = cUNOPx(o2)->op_first))
4561 && o2->op_type == OP_PUSHMARK
4562 && (( o2 = o2->op_sibling)) )
4565 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
4566 || o2->op_type == OP_PADHV)
4567 && o2->op_private & OPpLVAL_INTRO
4568 && !(o2->op_private & OPpPAD_STATE)
4569 && ckWARN(WARN_DEPRECATED))
4571 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4572 "Deprecated use of my() in false conditional");
4576 if (first->op_type == OP_CONST)
4577 first->op_private |= OPpCONST_SHORTCIRCUIT;
4579 first = newUNOP(OP_NULL, 0, first);
4580 op_getmad(other, first, '2');
4581 first->op_targ = type; /* set "was" field */
4588 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
4589 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
4591 const OP * const k1 = ((UNOP*)first)->op_first;
4592 const OP * const k2 = k1->op_sibling;
4594 switch (first->op_type)
4597 if (k2 && k2->op_type == OP_READLINE
4598 && (k2->op_flags & OPf_STACKED)
4599 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4601 warnop = k2->op_type;
4606 if (k1->op_type == OP_READDIR
4607 || k1->op_type == OP_GLOB
4608 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4609 || k1->op_type == OP_EACH)
4611 warnop = ((k1->op_type == OP_NULL)
4612 ? (OPCODE)k1->op_targ : k1->op_type);
4617 const line_t oldline = CopLINE(PL_curcop);
4618 CopLINE_set(PL_curcop, PL_parser->copline);
4619 Perl_warner(aTHX_ packWARN(WARN_MISC),
4620 "Value of %s%s can be \"0\"; test with defined()",
4622 ((warnop == OP_READLINE || warnop == OP_GLOB)
4623 ? " construct" : "() operator"));
4624 CopLINE_set(PL_curcop, oldline);
4631 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
4632 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
4634 NewOp(1101, logop, 1, LOGOP);
4636 logop->op_type = (OPCODE)type;
4637 logop->op_ppaddr = PL_ppaddr[type];
4638 logop->op_first = first;
4639 logop->op_flags = (U8)(flags | OPf_KIDS);
4640 logop->op_other = LINKLIST(other);
4641 logop->op_private = (U8)(1 | (flags >> 8));
4643 /* establish postfix order */
4644 logop->op_next = LINKLIST(first);
4645 first->op_next = (OP*)logop;
4646 first->op_sibling = other;
4648 CHECKOP(type,logop);
4650 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
4657 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
4665 PERL_ARGS_ASSERT_NEWCONDOP;
4668 return newLOGOP(OP_AND, 0, first, trueop);
4670 return newLOGOP(OP_OR, 0, first, falseop);
4672 scalarboolean(first);
4673 if ((cstop = search_const(first))) {
4674 /* Left or right arm of the conditional? */
4675 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
4676 OP *live = left ? trueop : falseop;
4677 OP *const dead = left ? falseop : trueop;
4678 if (cstop->op_private & OPpCONST_BARE &&
4679 cstop->op_private & OPpCONST_STRICT) {
4680 no_bareword_allowed(cstop);
4683 /* This is all dead code when PERL_MAD is not defined. */
4684 live = newUNOP(OP_NULL, 0, live);
4685 op_getmad(first, live, 'C');
4686 op_getmad(dead, live, left ? 'e' : 't');
4693 NewOp(1101, logop, 1, LOGOP);
4694 logop->op_type = OP_COND_EXPR;
4695 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
4696 logop->op_first = first;
4697 logop->op_flags = (U8)(flags | OPf_KIDS);
4698 logop->op_private = (U8)(1 | (flags >> 8));
4699 logop->op_other = LINKLIST(trueop);
4700 logop->op_next = LINKLIST(falseop);
4702 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
4705 /* establish postfix order */
4706 start = LINKLIST(first);
4707 first->op_next = (OP*)logop;
4709 first->op_sibling = trueop;
4710 trueop->op_sibling = falseop;
4711 o = newUNOP(OP_NULL, 0, (OP*)logop);
4713 trueop->op_next = falseop->op_next = o;
4720 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
4729 PERL_ARGS_ASSERT_NEWRANGE;
4731 NewOp(1101, range, 1, LOGOP);
4733 range->op_type = OP_RANGE;
4734 range->op_ppaddr = PL_ppaddr[OP_RANGE];
4735 range->op_first = left;
4736 range->op_flags = OPf_KIDS;
4737 leftstart = LINKLIST(left);
4738 range->op_other = LINKLIST(right);
4739 range->op_private = (U8)(1 | (flags >> 8));
4741 left->op_sibling = right;
4743 range->op_next = (OP*)range;
4744 flip = newUNOP(OP_FLIP, flags, (OP*)range);
4745 flop = newUNOP(OP_FLOP, 0, flip);
4746 o = newUNOP(OP_NULL, 0, flop);
4748 range->op_next = leftstart;
4750 left->op_next = flip;
4751 right->op_next = flop;
4753 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4754 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
4755 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4756 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
4758 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4759 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4762 if (!flip->op_private || !flop->op_private)
4763 linklist(o); /* blow off optimizer unless constant */
4769 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
4774 const bool once = block && block->op_flags & OPf_SPECIAL &&
4775 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
4777 PERL_UNUSED_ARG(debuggable);
4780 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
4781 return block; /* do {} while 0 does once */
4782 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4783 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4784 expr = newUNOP(OP_DEFINED, 0,
4785 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4786 } else if (expr->op_flags & OPf_KIDS) {
4787 const OP * const k1 = ((UNOP*)expr)->op_first;
4788 const OP * const k2 = k1 ? k1->op_sibling : NULL;
4789 switch (expr->op_type) {
4791 if (k2 && k2->op_type == OP_READLINE
4792 && (k2->op_flags & OPf_STACKED)
4793 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4794 expr = newUNOP(OP_DEFINED, 0, expr);
4798 if (k1 && (k1->op_type == OP_READDIR
4799 || k1->op_type == OP_GLOB
4800 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4801 || k1->op_type == OP_EACH))
4802 expr = newUNOP(OP_DEFINED, 0, expr);
4808 /* if block is null, the next append_elem() would put UNSTACK, a scalar
4809 * op, in listop. This is wrong. [perl #27024] */
4811 block = newOP(OP_NULL, 0);
4812 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
4813 o = new_logop(OP_AND, 0, &expr, &listop);
4816 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
4818 if (once && o != listop)
4819 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
4822 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
4824 o->op_flags |= flags;
4826 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
4831 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32
4832 whileline, OP *expr, OP *block, OP *cont, I32 has_my)
4841 PERL_UNUSED_ARG(debuggable);
4844 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4845 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4846 expr = newUNOP(OP_DEFINED, 0,
4847 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4848 } else if (expr->op_flags & OPf_KIDS) {
4849 const OP * const k1 = ((UNOP*)expr)->op_first;
4850 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
4851 switch (expr->op_type) {
4853 if (k2 && k2->op_type == OP_READLINE
4854 && (k2->op_flags & OPf_STACKED)
4855 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4856 expr = newUNOP(OP_DEFINED, 0, expr);
4860 if (k1 && (k1->op_type == OP_READDIR
4861 || k1->op_type == OP_GLOB
4862 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4863 || k1->op_type == OP_EACH))
4864 expr = newUNOP(OP_DEFINED, 0, expr);
4871 block = newOP(OP_NULL, 0);
4872 else if (cont || has_my) {
4873 block = scope(block);
4877 next = LINKLIST(cont);
4880 OP * const unstack = newOP(OP_UNSTACK, 0);
4883 cont = append_elem(OP_LINESEQ, cont, unstack);
4887 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
4889 redo = LINKLIST(listop);
4892 PL_parser->copline = (line_t)whileline;
4894 o = new_logop(OP_AND, 0, &expr, &listop);
4895 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
4896 op_free(expr); /* oops, it's a while (0) */
4898 return NULL; /* listop already freed by new_logop */
4901 ((LISTOP*)listop)->op_last->op_next =
4902 (o == listop ? redo : LINKLIST(o));
4908 NewOp(1101,loop,1,LOOP);
4909 loop->op_type = OP_ENTERLOOP;
4910 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
4911 loop->op_private = 0;
4912 loop->op_next = (OP*)loop;
4915 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
4917 loop->op_redoop = redo;
4918 loop->op_lastop = o;
4919 o->op_private |= loopflags;
4922 loop->op_nextop = next;
4924 loop->op_nextop = o;
4926 o->op_flags |= flags;
4927 o->op_private |= (flags >> 8);
4932 Perl_newFOROP(pTHX_ I32 flags, char *label, line_t forline, OP *sv, OP *expr, OP *block, OP *cont)
4937 PADOFFSET padoff = 0;
4942 PERL_ARGS_ASSERT_NEWFOROP;
4945 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
4946 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
4947 sv->op_type = OP_RV2GV;
4948 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
4950 /* The op_type check is needed to prevent a possible segfault
4951 * if the loop variable is undeclared and 'strict vars' is in
4952 * effect. This is illegal but is nonetheless parsed, so we
4953 * may reach this point with an OP_CONST where we're expecting
4956 if (cUNOPx(sv)->op_first->op_type == OP_GV
4957 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
4958 iterpflags |= OPpITER_DEF;
4960 else if (sv->op_type == OP_PADSV) { /* private variable */
4961 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
4962 padoff = sv->op_targ;
4972 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
4974 SV *const namesv = PAD_COMPNAME_SV(padoff);
4976 const char *const name = SvPV_const(namesv, len);
4978 if (len == 2 && name[0] == '$' && name[1] == '_')
4979 iterpflags |= OPpITER_DEF;
4983 const PADOFFSET offset = pad_findmy("$_");
4984 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
4985 sv = newGVOP(OP_GV, 0, PL_defgv);
4990 iterpflags |= OPpITER_DEF;
4992 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4993 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4994 iterflags |= OPf_STACKED;
4996 else if (expr->op_type == OP_NULL &&
4997 (expr->op_flags & OPf_KIDS) &&
4998 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
5000 /* Basically turn for($x..$y) into the same as for($x,$y), but we
5001 * set the STACKED flag to indicate that these values are to be
5002 * treated as min/max values by 'pp_iterinit'.
5004 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
5005 LOGOP* const range = (LOGOP*) flip->op_first;
5006 OP* const left = range->op_first;
5007 OP* const right = left->op_sibling;
5010 range->op_flags &= ~OPf_KIDS;
5011 range->op_first = NULL;
5013 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
5014 listop->op_first->op_next = range->op_next;
5015 left->op_next = range->op_other;
5016 right->op_next = (OP*)listop;
5017 listop->op_next = listop->op_first;
5020 op_getmad(expr,(OP*)listop,'O');
5024 expr = (OP*)(listop);
5026 iterflags |= OPf_STACKED;
5029 expr = mod(force_list(expr), OP_GREPSTART);
5032 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
5033 append_elem(OP_LIST, expr, scalar(sv))));
5034 assert(!loop->op_next);
5035 /* for my $x () sets OPpLVAL_INTRO;
5036 * for our $x () sets OPpOUR_INTRO */
5037 loop->op_private = (U8)iterpflags;
5038 #ifdef PL_OP_SLAB_ALLOC
5041 NewOp(1234,tmp,1,LOOP);
5042 Copy(loop,tmp,1,LISTOP);
5043 S_op_destroy(aTHX_ (OP*)loop);
5047 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
5049 loop->op_targ = padoff;
5050 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont, 0);
5052 op_getmad(madsv, (OP*)loop, 'v');
5053 PL_parser->copline = forline;
5054 return newSTATEOP(0, label, wop);
5058 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
5063 PERL_ARGS_ASSERT_NEWLOOPEX;
5065 if (type != OP_GOTO || label->op_type == OP_CONST) {
5066 /* "last()" means "last" */
5067 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
5068 o = newOP(type, OPf_SPECIAL);
5070 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
5071 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
5075 op_getmad(label,o,'L');
5081 /* Check whether it's going to be a goto &function */
5082 if (label->op_type == OP_ENTERSUB
5083 && !(label->op_flags & OPf_STACKED))
5084 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
5085 o = newUNOP(type, OPf_STACKED, label);
5087 PL_hints |= HINT_BLOCK_SCOPE;
5091 /* if the condition is a literal array or hash
5092 (or @{ ... } etc), make a reference to it.
5095 S_ref_array_or_hash(pTHX_ OP *cond)
5098 && (cond->op_type == OP_RV2AV
5099 || cond->op_type == OP_PADAV
5100 || cond->op_type == OP_RV2HV
5101 || cond->op_type == OP_PADHV))
5103 return newUNOP(OP_REFGEN,
5104 0, mod(cond, OP_REFGEN));
5110 /* These construct the optree fragments representing given()
5113 entergiven and enterwhen are LOGOPs; the op_other pointer
5114 points up to the associated leave op. We need this so we
5115 can put it in the context and make break/continue work.
5116 (Also, of course, pp_enterwhen will jump straight to
5117 op_other if the match fails.)
5121 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
5122 I32 enter_opcode, I32 leave_opcode,
5123 PADOFFSET entertarg)
5129 PERL_ARGS_ASSERT_NEWGIVWHENOP;
5131 NewOp(1101, enterop, 1, LOGOP);
5132 enterop->op_type = (Optype)enter_opcode;
5133 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
5134 enterop->op_flags = (U8) OPf_KIDS;
5135 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
5136 enterop->op_private = 0;
5138 o = newUNOP(leave_opcode, 0, (OP *) enterop);
5141 enterop->op_first = scalar(cond);
5142 cond->op_sibling = block;
5144 o->op_next = LINKLIST(cond);
5145 cond->op_next = (OP *) enterop;
5148 /* This is a default {} block */
5149 enterop->op_first = block;
5150 enterop->op_flags |= OPf_SPECIAL;
5152 o->op_next = (OP *) enterop;
5155 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
5156 entergiven and enterwhen both
5159 enterop->op_next = LINKLIST(block);
5160 block->op_next = enterop->op_other = o;
5165 /* Does this look like a boolean operation? For these purposes
5166 a boolean operation is:
5167 - a subroutine call [*]
5168 - a logical connective
5169 - a comparison operator
5170 - a filetest operator, with the exception of -s -M -A -C
5171 - defined(), exists() or eof()
5172 - /$re/ or $foo =~ /$re/
5174 [*] possibly surprising
5177 S_looks_like_bool(pTHX_ const OP *o)
5181 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
5183 switch(o->op_type) {
5186 return looks_like_bool(cLOGOPo->op_first);
5190 looks_like_bool(cLOGOPo->op_first)
5191 && looks_like_bool(cLOGOPo->op_first->op_sibling));
5195 o->op_flags & OPf_KIDS
5196 && looks_like_bool(cUNOPo->op_first));
5200 case OP_NOT: case OP_XOR:
5202 case OP_EQ: case OP_NE: case OP_LT:
5203 case OP_GT: case OP_LE: case OP_GE:
5205 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
5206 case OP_I_GT: case OP_I_LE: case OP_I_GE:
5208 case OP_SEQ: case OP_SNE: case OP_SLT:
5209 case OP_SGT: case OP_SLE: case OP_SGE:
5213 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
5214 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
5215 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
5216 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
5217 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
5218 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
5219 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
5220 case OP_FTTEXT: case OP_FTBINARY:
5222 case OP_DEFINED: case OP_EXISTS:
5223 case OP_MATCH: case OP_EOF:
5230 /* Detect comparisons that have been optimized away */
5231 if (cSVOPo->op_sv == &PL_sv_yes
5232 || cSVOPo->op_sv == &PL_sv_no)
5245 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
5248 PERL_ARGS_ASSERT_NEWGIVENOP;
5249 return newGIVWHENOP(
5250 ref_array_or_hash(cond),
5252 OP_ENTERGIVEN, OP_LEAVEGIVEN,
5256 /* If cond is null, this is a default {} block */
5258 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
5260 const bool cond_llb = (!cond || looks_like_bool(cond));
5263 PERL_ARGS_ASSERT_NEWWHENOP;
5268 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
5270 scalar(ref_array_or_hash(cond)));
5273 return newGIVWHENOP(
5275 append_elem(block->op_type, block, newOP(OP_BREAK, OPf_SPECIAL)),
5276 OP_ENTERWHEN, OP_LEAVEWHEN, 0);
5280 =for apidoc cv_undef
5282 Clear out all the active components of a CV. This can happen either
5283 by an explicit C<undef &foo>, or by the reference count going to zero.
5284 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
5285 children can still follow the full lexical scope chain.
5291 Perl_cv_undef(pTHX_ CV *cv)
5295 PERL_ARGS_ASSERT_CV_UNDEF;
5297 DEBUG_X(PerlIO_printf(Perl_debug_log,
5298 "CV undef: cv=0x%"UVxf" comppad=0x%"UVxf"\n",
5299 PTR2UV(cv), PTR2UV(PL_comppad))
5303 if (CvFILE(cv) && !CvISXSUB(cv)) {
5304 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
5305 Safefree(CvFILE(cv));
5310 if (!CvISXSUB(cv) && CvROOT(cv)) {
5311 if (SvTYPE(cv) == SVt_PVCV && CvDEPTH(cv))
5312 Perl_croak(aTHX_ "Can't undef active subroutine");
5315 PAD_SAVE_SETNULLPAD();
5317 op_free(CvROOT(cv));
5322 SvPOK_off(MUTABLE_SV(cv)); /* forget prototype */
5327 /* remove CvOUTSIDE unless this is an undef rather than a free */
5328 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
5329 if (!CvWEAKOUTSIDE(cv))
5330 SvREFCNT_dec(CvOUTSIDE(cv));
5331 CvOUTSIDE(cv) = NULL;
5334 SvREFCNT_dec(MUTABLE_SV(CvXSUBANY(cv).any_ptr));
5337 if (CvISXSUB(cv) && CvXSUB(cv)) {
5340 /* delete all flags except WEAKOUTSIDE */
5341 CvFLAGS(cv) &= CVf_WEAKOUTSIDE;
5345 Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p,
5348 PERL_ARGS_ASSERT_CV_CKPROTO_LEN;
5350 /* Can't just use a strcmp on the prototype, as CONSTSUBs "cheat" by
5351 relying on SvCUR, and doubling up the buffer to hold CvFILE(). */
5352 if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */
5353 || (p && (len != SvCUR(cv) /* Not the same length. */
5354 || memNE(p, SvPVX_const(cv), len))))
5355 && ckWARN_d(WARN_PROTOTYPE)) {
5356 SV* const msg = sv_newmortal();
5360 gv_efullname3(name = sv_newmortal(), gv, NULL);
5361 sv_setpvs(msg, "Prototype mismatch:");
5363 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
5365 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv));
5367 sv_catpvs(msg, ": none");
5368 sv_catpvs(msg, " vs ");
5370 Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p);
5372 sv_catpvs(msg, "none");
5373 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
5377 static void const_sv_xsub(pTHX_ CV* cv);
5381 =head1 Optree Manipulation Functions
5383 =for apidoc cv_const_sv
5385 If C<cv> is a constant sub eligible for inlining. returns the constant
5386 value returned by the sub. Otherwise, returns NULL.
5388 Constant subs can be created with C<newCONSTSUB> or as described in
5389 L<perlsub/"Constant Functions">.
5394 Perl_cv_const_sv(pTHX_ const CV *const cv)
5396 PERL_UNUSED_CONTEXT;
5399 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
5401 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
5404 /* op_const_sv: examine an optree to determine whether it's in-lineable.
5405 * Can be called in 3 ways:
5408 * look for a single OP_CONST with attached value: return the value
5410 * cv && CvCLONE(cv) && !CvCONST(cv)
5412 * examine the clone prototype, and if contains only a single
5413 * OP_CONST referencing a pad const, or a single PADSV referencing
5414 * an outer lexical, return a non-zero value to indicate the CV is
5415 * a candidate for "constizing" at clone time
5419 * We have just cloned an anon prototype that was marked as a const
5420 * candidiate. Try to grab the current value, and in the case of
5421 * PADSV, ignore it if it has multiple references. Return the value.
5425 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
5436 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
5437 o = cLISTOPo->op_first->op_sibling;
5439 for (; o; o = o->op_next) {
5440 const OPCODE type = o->op_type;
5442 if (sv && o->op_next == o)
5444 if (o->op_next != o) {
5445 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
5447 if (type == OP_DBSTATE)
5450 if (type == OP_LEAVESUB || type == OP_RETURN)
5454 if (type == OP_CONST && cSVOPo->op_sv)
5456 else if (cv && type == OP_CONST) {
5457 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5461 else if (cv && type == OP_PADSV) {
5462 if (CvCONST(cv)) { /* newly cloned anon */
5463 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5464 /* the candidate should have 1 ref from this pad and 1 ref
5465 * from the parent */
5466 if (!sv || SvREFCNT(sv) != 2)
5473 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
5474 sv = &PL_sv_undef; /* an arbitrary non-null value */
5489 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5492 /* This would be the return value, but the return cannot be reached. */
5493 OP* pegop = newOP(OP_NULL, 0);
5496 PERL_UNUSED_ARG(floor);
5506 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
5508 NORETURN_FUNCTION_END;
5513 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
5515 return Perl_newATTRSUB(aTHX_ floor, o, proto, NULL, block);
5519 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5526 register CV *cv = NULL;
5528 /* If the subroutine has no body, no attributes, and no builtin attributes
5529 then it's just a sub declaration, and we may be able to get away with
5530 storing with a placeholder scalar in the symbol table, rather than a
5531 full GV and CV. If anything is present then it will take a full CV to
5533 const I32 gv_fetch_flags
5534 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5536 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
5537 const char * const name = o ? SvPV_nolen_const(cSVOPo->op_sv) : NULL;
5540 assert(proto->op_type == OP_CONST);
5541 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
5546 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
5547 SV * const sv = sv_newmortal();
5548 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
5549 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
5550 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
5551 aname = SvPVX_const(sv);
5556 gv = name ? gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV)
5557 : gv_fetchpv(aname ? aname
5558 : (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
5559 gv_fetch_flags, SVt_PVCV);
5561 if (!PL_madskills) {
5570 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
5571 maximum a prototype before. */
5572 if (SvTYPE(gv) > SVt_NULL) {
5573 if (!SvPOK((const SV *)gv)
5574 && !(SvIOK((const SV *)gv) && SvIVX((const SV *)gv) == -1)
5575 && ckWARN_d(WARN_PROTOTYPE))
5577 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
5579 cv_ckproto_len((const CV *)gv, NULL, ps, ps_len);
5582 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
5584 sv_setiv(MUTABLE_SV(gv), -1);
5586 SvREFCNT_dec(PL_compcv);
5587 cv = PL_compcv = NULL;
5591 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
5593 if (!block || !ps || *ps || attrs
5594 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5596 || block->op_type == OP_NULL
5601 const_sv = op_const_sv(block, NULL);
5604 const bool exists = CvROOT(cv) || CvXSUB(cv);
5606 /* if the subroutine doesn't exist and wasn't pre-declared
5607 * with a prototype, assume it will be AUTOLOADed,
5608 * skipping the prototype check
5610 if (exists || SvPOK(cv))
5611 cv_ckproto_len(cv, gv, ps, ps_len);
5612 /* already defined (or promised)? */
5613 if (exists || GvASSUMECV(gv)) {
5616 || block->op_type == OP_NULL
5619 if (CvFLAGS(PL_compcv)) {
5620 /* might have had built-in attrs applied */
5621 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5623 /* just a "sub foo;" when &foo is already defined */
5624 SAVEFREESV(PL_compcv);
5629 && block->op_type != OP_NULL
5632 if (ckWARN(WARN_REDEFINE)
5634 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
5636 const line_t oldline = CopLINE(PL_curcop);
5637 if (PL_parser && PL_parser->copline != NOLINE)
5638 CopLINE_set(PL_curcop, PL_parser->copline);
5639 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5640 CvCONST(cv) ? "Constant subroutine %s redefined"
5641 : "Subroutine %s redefined", name);
5642 CopLINE_set(PL_curcop, oldline);
5645 if (!PL_minus_c) /* keep old one around for madskills */
5648 /* (PL_madskills unset in used file.) */
5656 SvREFCNT_inc_simple_void_NN(const_sv);
5658 assert(!CvROOT(cv) && !CvCONST(cv));
5659 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
5660 CvXSUBANY(cv).any_ptr = const_sv;
5661 CvXSUB(cv) = const_sv_xsub;
5667 cv = newCONSTSUB(NULL, name, const_sv);
5669 mro_method_changed_in( /* sub Foo::Bar () { 123 } */
5670 (CvGV(cv) && GvSTASH(CvGV(cv)))
5679 SvREFCNT_dec(PL_compcv);
5687 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
5688 * before we clobber PL_compcv.
5692 || block->op_type == OP_NULL
5695 rcv = MUTABLE_SV(cv);
5696 /* Might have had built-in attributes applied -- propagate them. */
5697 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5698 if (CvGV(cv) && GvSTASH(CvGV(cv)))
5699 stash = GvSTASH(CvGV(cv));
5700 else if (CvSTASH(cv))
5701 stash = CvSTASH(cv);
5703 stash = PL_curstash;
5706 /* possibly about to re-define existing subr -- ignore old cv */
5707 rcv = MUTABLE_SV(PL_compcv);
5708 if (name && GvSTASH(gv))
5709 stash = GvSTASH(gv);
5711 stash = PL_curstash;
5713 apply_attrs(stash, rcv, attrs, FALSE);
5715 if (cv) { /* must reuse cv if autoloaded */
5722 || block->op_type == OP_NULL) && !PL_madskills
5725 /* got here with just attrs -- work done, so bug out */
5726 SAVEFREESV(PL_compcv);
5729 /* transfer PL_compcv to cv */
5731 CvFLAGS(cv) = CvFLAGS(PL_compcv);
5732 if (!CvWEAKOUTSIDE(cv))
5733 SvREFCNT_dec(CvOUTSIDE(cv));
5734 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
5735 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
5736 CvOUTSIDE(PL_compcv) = 0;
5737 CvPADLIST(cv) = CvPADLIST(PL_compcv);
5738 CvPADLIST(PL_compcv) = 0;
5739 /* inner references to PL_compcv must be fixed up ... */
5740 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
5741 /* ... before we throw it away */
5742 SvREFCNT_dec(PL_compcv);
5744 if (PERLDB_INTER)/* Advice debugger on the new sub. */
5745 ++PL_sub_generation;
5752 if (strEQ(name, "import")) {
5753 PL_formfeed = MUTABLE_SV(cv);
5754 Perl_warner(aTHX_ packWARN(WARN_VOID), "%lx\n", (long)cv);
5758 mro_method_changed_in(GvSTASH(gv)); /* sub Foo::bar { (shift)+1 } */
5762 CvFILE_set_from_cop(cv, PL_curcop);
5763 CvSTASH(cv) = PL_curstash;
5766 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
5768 if (PL_parser && PL_parser->error_count) {
5772 const char *s = strrchr(name, ':');
5774 if (strEQ(s, "BEGIN")) {
5775 const char not_safe[] =
5776 "BEGIN not safe after errors--compilation aborted";
5777 if (PL_in_eval & EVAL_KEEPERR)
5778 Perl_croak(aTHX_ not_safe);
5780 /* force display of errors found but not reported */
5781 sv_catpv(ERRSV, not_safe);
5782 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
5791 /* If we assign an optree to a PVCV, then we've defined a subroutine that
5792 the debugger could be able to set a breakpoint in, so signal to
5793 pp_entereval that it should not throw away any saved lines at scope
5796 PL_breakable_sub_gen++;
5798 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
5799 mod(scalarseq(block), OP_LEAVESUBLV));
5800 block->op_attached = 1;
5803 /* This makes sub {}; work as expected. */
5804 if (block->op_type == OP_STUB) {
5805 OP* const newblock = newSTATEOP(0, NULL, 0);
5807 op_getmad(block,newblock,'B');
5814 block->op_attached = 1;
5815 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
5817 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5818 OpREFCNT_set(CvROOT(cv), 1);
5819 CvSTART(cv) = LINKLIST(CvROOT(cv));
5820 CvROOT(cv)->op_next = 0;
5821 CALL_PEEP(CvSTART(cv));
5823 /* now that optimizer has done its work, adjust pad values */
5825 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
5828 assert(!CvCONST(cv));
5829 if (ps && !*ps && op_const_sv(block, cv))
5833 if (name || aname) {
5834 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
5835 SV * const sv = newSV(0);
5836 SV * const tmpstr = sv_newmortal();
5837 GV * const db_postponed = gv_fetchpvs("DB::postponed",
5838 GV_ADDMULTI, SVt_PVHV);
5841 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
5843 (long)PL_subline, (long)CopLINE(PL_curcop));
5844 gv_efullname3(tmpstr, gv, NULL);
5845 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
5846 SvCUR(tmpstr), sv, 0);
5847 hv = GvHVn(db_postponed);
5848 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) {
5849 CV * const pcv = GvCV(db_postponed);
5855 call_sv(MUTABLE_SV(pcv), G_DISCARD);
5860 if (name && ! (PL_parser && PL_parser->error_count))
5861 process_special_blocks(name, gv, cv);
5866 PL_parser->copline = NOLINE;
5872 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
5875 const char *const colon = strrchr(fullname,':');
5876 const char *const name = colon ? colon + 1 : fullname;
5878 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
5881 if (strEQ(name, "BEGIN")) {
5882 const I32 oldscope = PL_scopestack_ix;
5884 SAVECOPFILE(&PL_compiling);
5885 SAVECOPLINE(&PL_compiling);
5887 DEBUG_x( dump_sub(gv) );
5888 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
5889 GvCV(gv) = 0; /* cv has been hijacked */
5890 call_list(oldscope, PL_beginav);
5892 PL_curcop = &PL_compiling;
5893 CopHINTS_set(&PL_compiling, PL_hints);
5900 if strEQ(name, "END") {
5901 DEBUG_x( dump_sub(gv) );
5902 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
5905 } else if (*name == 'U') {
5906 if (strEQ(name, "UNITCHECK")) {
5907 /* It's never too late to run a unitcheck block */
5908 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
5912 } else if (*name == 'C') {
5913 if (strEQ(name, "CHECK")) {
5914 if (PL_main_start && ckWARN(WARN_VOID))
5915 Perl_warner(aTHX_ packWARN(WARN_VOID),
5916 "Too late to run CHECK block");
5917 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
5921 } else if (*name == 'I') {
5922 if (strEQ(name, "INIT")) {
5923 if (PL_main_start && ckWARN(WARN_VOID))
5924 Perl_warner(aTHX_ packWARN(WARN_VOID),
5925 "Too late to run INIT block");
5926 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
5932 DEBUG_x( dump_sub(gv) );
5933 GvCV(gv) = 0; /* cv has been hijacked */
5938 =for apidoc newCONSTSUB
5940 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
5941 eligible for inlining at compile-time.
5943 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
5944 which won't be called if used as a destructor, but will suppress the overhead
5945 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
5952 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
5957 const char *const file = CopFILE(PL_curcop);
5959 SV *const temp_sv = CopFILESV(PL_curcop);
5960 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
5965 if (IN_PERL_RUNTIME) {
5966 /* at runtime, it's not safe to manipulate PL_curcop: it may be
5967 * an op shared between threads. Use a non-shared COP for our
5969 SAVEVPTR(PL_curcop);
5970 PL_curcop = &PL_compiling;
5972 SAVECOPLINE(PL_curcop);
5973 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
5976 PL_hints &= ~HINT_BLOCK_SCOPE;
5979 SAVESPTR(PL_curstash);
5980 SAVECOPSTASH(PL_curcop);
5981 PL_curstash = stash;
5982 CopSTASH_set(PL_curcop,stash);
5985 /* file becomes the CvFILE. For an XS, it's supposed to be static storage,
5986 and so doesn't get free()d. (It's expected to be from the C pre-
5987 processor __FILE__ directive). But we need a dynamically allocated one,
5988 and we need it to get freed. */
5989 cv = newXS_flags(name, const_sv_xsub, file ? file : "", "",
5990 XS_DYNAMIC_FILENAME);
5991 CvXSUBANY(cv).any_ptr = sv;
5996 CopSTASH_free(PL_curcop);
6004 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
6005 const char *const filename, const char *const proto,
6008 CV *cv = newXS(name, subaddr, filename);
6010 PERL_ARGS_ASSERT_NEWXS_FLAGS;
6012 if (flags & XS_DYNAMIC_FILENAME) {
6013 /* We need to "make arrangements" (ie cheat) to ensure that the
6014 filename lasts as long as the PVCV we just created, but also doesn't
6016 STRLEN filename_len = strlen(filename);
6017 STRLEN proto_and_file_len = filename_len;
6018 char *proto_and_file;
6022 proto_len = strlen(proto);
6023 proto_and_file_len += proto_len;
6025 Newx(proto_and_file, proto_and_file_len + 1, char);
6026 Copy(proto, proto_and_file, proto_len, char);
6027 Copy(filename, proto_and_file + proto_len, filename_len + 1, char);
6030 proto_and_file = savepvn(filename, filename_len);
6033 /* This gets free()d. :-) */
6034 sv_usepvn_flags(MUTABLE_SV(cv), proto_and_file, proto_and_file_len,
6035 SV_HAS_TRAILING_NUL);
6037 /* This gives us the correct prototype, rather than one with the
6038 file name appended. */
6039 SvCUR_set(cv, proto_len);
6043 CvFILE(cv) = proto_and_file + proto_len;
6045 sv_setpv(MUTABLE_SV(cv), proto);
6051 =for apidoc U||newXS
6053 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
6054 static storage, as it is used directly as CvFILE(), without a copy being made.
6060 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
6063 GV * const gv = gv_fetchpv(name ? name :
6064 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
6065 GV_ADDMULTI, SVt_PVCV);
6068 PERL_ARGS_ASSERT_NEWXS;
6071 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
6073 if ((cv = (name ? GvCV(gv) : NULL))) {
6075 /* just a cached method */
6079 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
6080 /* already defined (or promised) */
6081 /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */
6082 if (ckWARN(WARN_REDEFINE)) {
6083 GV * const gvcv = CvGV(cv);
6085 HV * const stash = GvSTASH(gvcv);
6087 const char *redefined_name = HvNAME_get(stash);
6088 if ( strEQ(redefined_name,"autouse") ) {
6089 const line_t oldline = CopLINE(PL_curcop);
6090 if (PL_parser && PL_parser->copline != NOLINE)
6091 CopLINE_set(PL_curcop, PL_parser->copline);
6092 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6093 CvCONST(cv) ? "Constant subroutine %s redefined"
6094 : "Subroutine %s redefined"
6096 CopLINE_set(PL_curcop, oldline);
6106 if (cv) /* must reuse cv if autoloaded */
6109 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
6113 mro_method_changed_in(GvSTASH(gv)); /* newXS */
6117 (void)gv_fetchfile(filename);
6118 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
6119 an external constant string */
6121 CvXSUB(cv) = subaddr;
6124 process_special_blocks(name, gv, cv);
6136 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
6141 OP* pegop = newOP(OP_NULL, 0);
6145 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
6146 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
6149 if ((cv = GvFORM(gv))) {
6150 if (ckWARN(WARN_REDEFINE)) {
6151 const line_t oldline = CopLINE(PL_curcop);
6152 if (PL_parser && PL_parser->copline != NOLINE)
6153 CopLINE_set(PL_curcop, PL_parser->copline);
6155 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6156 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
6158 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6159 "Format STDOUT redefined");
6161 CopLINE_set(PL_curcop, oldline);
6168 CvFILE_set_from_cop(cv, PL_curcop);
6171 pad_tidy(padtidy_FORMAT);
6172 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
6173 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6174 OpREFCNT_set(CvROOT(cv), 1);
6175 CvSTART(cv) = LINKLIST(CvROOT(cv));
6176 CvROOT(cv)->op_next = 0;
6177 CALL_PEEP(CvSTART(cv));
6179 op_getmad(o,pegop,'n');
6180 op_getmad_weak(block, pegop, 'b');
6185 PL_parser->copline = NOLINE;
6193 Perl_newANONLIST(pTHX_ OP *o)
6195 return convert(OP_ANONLIST, OPf_SPECIAL, o);
6199 Perl_newANONHASH(pTHX_ OP *o)
6201 return convert(OP_ANONHASH, OPf_SPECIAL, o);
6205 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
6207 return newANONATTRSUB(floor, proto, NULL, block);
6211 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
6213 return newUNOP(OP_REFGEN, 0,
6214 newSVOP(OP_ANONCODE, 0,
6215 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
6219 Perl_oopsAV(pTHX_ OP *o)
6223 PERL_ARGS_ASSERT_OOPSAV;
6225 switch (o->op_type) {
6227 o->op_type = OP_PADAV;
6228 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6229 return ref(o, OP_RV2AV);
6232 o->op_type = OP_RV2AV;
6233 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
6238 if (ckWARN_d(WARN_INTERNAL))
6239 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
6246 Perl_oopsHV(pTHX_ OP *o)
6250 PERL_ARGS_ASSERT_OOPSHV;
6252 switch (o->op_type) {
6255 o->op_type = OP_PADHV;
6256 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6257 return ref(o, OP_RV2HV);
6261 o->op_type = OP_RV2HV;
6262 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
6267 if (ckWARN_d(WARN_INTERNAL))
6268 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
6275 Perl_newAVREF(pTHX_ OP *o)
6279 PERL_ARGS_ASSERT_NEWAVREF;
6281 if (o->op_type == OP_PADANY) {
6282 o->op_type = OP_PADAV;
6283 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6286 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)
6287 && ckWARN(WARN_DEPRECATED)) {
6288 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
6289 "Using an array as a reference is deprecated");
6291 return newUNOP(OP_RV2AV, 0, scalar(o));
6295 Perl_newGVREF(pTHX_ I32 type, OP *o)
6297 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
6298 return newUNOP(OP_NULL, 0, o);
6299 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
6303 Perl_newHVREF(pTHX_ OP *o)
6307 PERL_ARGS_ASSERT_NEWHVREF;
6309 if (o->op_type == OP_PADANY) {
6310 o->op_type = OP_PADHV;
6311 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6314 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)
6315 && ckWARN(WARN_DEPRECATED)) {
6316 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
6317 "Using a hash as a reference is deprecated");
6319 return newUNOP(OP_RV2HV, 0, scalar(o));
6323 Perl_newCVREF(pTHX_ I32 flags, OP *o)
6325 return newUNOP(OP_RV2CV, flags, scalar(o));
6329 Perl_newSVREF(pTHX_ OP *o)
6333 PERL_ARGS_ASSERT_NEWSVREF;
6335 if (o->op_type == OP_PADANY) {
6336 o->op_type = OP_PADSV;
6337 o->op_ppaddr = PL_ppaddr[OP_PADSV];
6340 return newUNOP(OP_RV2SV, 0, scalar(o));
6343 /* Check routines. See the comments at the top of this file for details
6344 * on when these are called */
6347 Perl_ck_anoncode(pTHX_ OP *o)
6349 PERL_ARGS_ASSERT_CK_ANONCODE;
6351 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
6353 cSVOPo->op_sv = NULL;
6358 Perl_ck_bitop(pTHX_ OP *o)
6362 PERL_ARGS_ASSERT_CK_BITOP;
6364 #define OP_IS_NUMCOMPARE(op) \
6365 ((op) == OP_LT || (op) == OP_I_LT || \
6366 (op) == OP_GT || (op) == OP_I_GT || \
6367 (op) == OP_LE || (op) == OP_I_LE || \
6368 (op) == OP_GE || (op) == OP_I_GE || \
6369 (op) == OP_EQ || (op) == OP_I_EQ || \
6370 (op) == OP_NE || (op) == OP_I_NE || \
6371 (op) == OP_NCMP || (op) == OP_I_NCMP)
6372 o->op_private = (U8)(PL_hints & HINT_INTEGER);
6373 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
6374 && (o->op_type == OP_BIT_OR
6375 || o->op_type == OP_BIT_AND
6376 || o->op_type == OP_BIT_XOR))
6378 const OP * const left = cBINOPo->op_first;
6379 const OP * const right = left->op_sibling;
6380 if ((OP_IS_NUMCOMPARE(left->op_type) &&
6381 (left->op_flags & OPf_PARENS) == 0) ||
6382 (OP_IS_NUMCOMPARE(right->op_type) &&
6383 (right->op_flags & OPf_PARENS) == 0))
6384 if (ckWARN(WARN_PRECEDENCE))
6385 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
6386 "Possible precedence problem on bitwise %c operator",
6387 o->op_type == OP_BIT_OR ? '|'
6388 : o->op_type == OP_BIT_AND ? '&' : '^'
6395 Perl_ck_concat(pTHX_ OP *o)
6397 const OP * const kid = cUNOPo->op_first;
6399 PERL_ARGS_ASSERT_CK_CONCAT;
6400 PERL_UNUSED_CONTEXT;
6402 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
6403 !(kUNOP->op_first->op_flags & OPf_MOD))
6404 o->op_flags |= OPf_STACKED;
6409 Perl_ck_spair(pTHX_ OP *o)
6413 PERL_ARGS_ASSERT_CK_SPAIR;
6415 if (o->op_flags & OPf_KIDS) {
6418 const OPCODE type = o->op_type;
6419 o = modkids(ck_fun(o), type);
6420 kid = cUNOPo->op_first;
6421 newop = kUNOP->op_first->op_sibling;
6423 const OPCODE type = newop->op_type;
6424 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
6425 type == OP_PADAV || type == OP_PADHV ||
6426 type == OP_RV2AV || type == OP_RV2HV)
6430 op_getmad(kUNOP->op_first,newop,'K');
6432 op_free(kUNOP->op_first);
6434 kUNOP->op_first = newop;
6436 o->op_ppaddr = PL_ppaddr[++o->op_type];
6441 Perl_ck_delete(pTHX_ OP *o)
6443 PERL_ARGS_ASSERT_CK_DELETE;
6447 if (o->op_flags & OPf_KIDS) {
6448 OP * const kid = cUNOPo->op_first;
6449 switch (kid->op_type) {
6451 o->op_flags |= OPf_SPECIAL;
6454 o->op_private |= OPpSLICE;
6457 o->op_flags |= OPf_SPECIAL;
6462 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
6471 Perl_ck_die(pTHX_ OP *o)
6473 PERL_ARGS_ASSERT_CK_DIE;
6476 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6482 Perl_ck_eof(pTHX_ OP *o)
6486 PERL_ARGS_ASSERT_CK_EOF;
6488 if (o->op_flags & OPf_KIDS) {
6489 if (cLISTOPo->op_first->op_type == OP_STUB) {
6491 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
6493 op_getmad(o,newop,'O');
6505 Perl_ck_eval(pTHX_ OP *o)
6509 PERL_ARGS_ASSERT_CK_EVAL;
6511 PL_hints |= HINT_BLOCK_SCOPE;
6512 if (o->op_flags & OPf_KIDS) {
6513 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6516 o->op_flags &= ~OPf_KIDS;
6519 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
6525 cUNOPo->op_first = 0;
6530 NewOp(1101, enter, 1, LOGOP);
6531 enter->op_type = OP_ENTERTRY;
6532 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
6533 enter->op_private = 0;
6535 /* establish postfix order */
6536 enter->op_next = (OP*)enter;
6538 CHECKOP(OP_ENTERTRY, enter);
6540 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
6541 o->op_type = OP_LEAVETRY;
6542 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
6543 enter->op_other = o;
6544 op_getmad(oldo,o,'O');
6558 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
6559 op_getmad(oldo,o,'O');
6561 o->op_targ = (PADOFFSET)PL_hints;
6562 if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) {
6563 /* Store a copy of %^H that pp_entereval can pick up. */
6564 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
6565 MUTABLE_SV(Perl_hv_copy_hints_hv(aTHX_ GvHV(PL_hintgv))));
6566 cUNOPo->op_first->op_sibling = hhop;
6567 o->op_private |= OPpEVAL_HAS_HH;
6573 Perl_ck_exit(pTHX_ OP *o)
6575 PERL_ARGS_ASSERT_CK_EXIT;
6578 HV * const table = GvHV(PL_hintgv);
6580 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
6581 if (svp && *svp && SvTRUE(*svp))
6582 o->op_private |= OPpEXIT_VMSISH;
6584 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6590 Perl_ck_exec(pTHX_ OP *o)
6592 PERL_ARGS_ASSERT_CK_EXEC;
6594 if (o->op_flags & OPf_STACKED) {
6597 kid = cUNOPo->op_first->op_sibling;
6598 if (kid->op_type == OP_RV2GV)
6607 Perl_ck_exists(pTHX_ OP *o)
6611 PERL_ARGS_ASSERT_CK_EXISTS;
6614 if (o->op_flags & OPf_KIDS) {
6615 OP * const kid = cUNOPo->op_first;
6616 if (kid->op_type == OP_ENTERSUB) {
6617 (void) ref(kid, o->op_type);
6618 if (kid->op_type != OP_RV2CV
6619 && !(PL_parser && PL_parser->error_count))
6620 Perl_croak(aTHX_ "%s argument is not a subroutine name",
6622 o->op_private |= OPpEXISTS_SUB;
6624 else if (kid->op_type == OP_AELEM)
6625 o->op_flags |= OPf_SPECIAL;
6626 else if (kid->op_type != OP_HELEM)
6627 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
6635 Perl_ck_rvconst(pTHX_ register OP *o)
6638 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6640 PERL_ARGS_ASSERT_CK_RVCONST;
6642 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6643 if (o->op_type == OP_RV2CV)
6644 o->op_private &= ~1;
6646 if (kid->op_type == OP_CONST) {
6649 SV * const kidsv = kid->op_sv;
6651 /* Is it a constant from cv_const_sv()? */
6652 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
6653 SV * const rsv = SvRV(kidsv);
6654 const svtype type = SvTYPE(rsv);
6655 const char *badtype = NULL;
6657 switch (o->op_type) {
6659 if (type > SVt_PVMG)
6660 badtype = "a SCALAR";
6663 if (type != SVt_PVAV)
6664 badtype = "an ARRAY";
6667 if (type != SVt_PVHV)
6671 if (type != SVt_PVCV)
6676 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
6679 else if ((o->op_type == OP_RV2HV || o->op_type == OP_RV2SV) &&
6680 (PL_hints & HINT_STRICT_REFS) && SvPOK(kidsv)) {
6681 /* If this is an access to a stash, disable "strict refs", because
6682 * stashes aren't auto-vivified at compile-time (unless we store
6683 * symbols in them), and we don't want to produce a run-time
6684 * stricture error when auto-vivifying the stash. */
6685 const char *s = SvPV_nolen(kidsv);
6686 const STRLEN l = SvCUR(kidsv);
6687 if (l > 1 && s[l-1] == ':' && s[l-2] == ':')
6688 o->op_private &= ~HINT_STRICT_REFS;
6690 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
6691 const char *badthing;
6692 switch (o->op_type) {
6694 badthing = "a SCALAR";
6697 badthing = "an ARRAY";
6700 badthing = "a HASH";
6708 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
6709 SVfARG(kidsv), badthing);
6712 * This is a little tricky. We only want to add the symbol if we
6713 * didn't add it in the lexer. Otherwise we get duplicate strict
6714 * warnings. But if we didn't add it in the lexer, we must at
6715 * least pretend like we wanted to add it even if it existed before,
6716 * or we get possible typo warnings. OPpCONST_ENTERED says
6717 * whether the lexer already added THIS instance of this symbol.
6719 iscv = (o->op_type == OP_RV2CV) * 2;
6721 gv = gv_fetchsv(kidsv,
6722 iscv | !(kid->op_private & OPpCONST_ENTERED),
6725 : o->op_type == OP_RV2SV
6727 : o->op_type == OP_RV2AV
6729 : o->op_type == OP_RV2HV
6732 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
6734 kid->op_type = OP_GV;
6735 SvREFCNT_dec(kid->op_sv);
6737 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
6738 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
6739 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
6741 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
6743 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
6745 kid->op_private = 0;
6746 kid->op_ppaddr = PL_ppaddr[OP_GV];
6753 Perl_ck_ftst(pTHX_ OP *o)
6756 const I32 type = o->op_type;
6758 PERL_ARGS_ASSERT_CK_FTST;
6760 if (o->op_flags & OPf_REF) {
6763 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
6764 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6765 const OPCODE kidtype = kid->op_type;
6767 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6768 OP * const newop = newGVOP(type, OPf_REF,
6769 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
6771 op_getmad(o,newop,'O');
6777 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
6778 o->op_private |= OPpFT_ACCESS;
6779 if (PL_check[kidtype] == MEMBER_TO_FPTR(Perl_ck_ftst)
6780 && kidtype != OP_STAT && kidtype != OP_LSTAT)
6781 o->op_private |= OPpFT_STACKED;
6789 if (type == OP_FTTTY)
6790 o = newGVOP(type, OPf_REF, PL_stdingv);
6792 o = newUNOP(type, 0, newDEFSVOP());
6793 op_getmad(oldo,o,'O');
6799 Perl_ck_fun(pTHX_ OP *o)
6802 const int type = o->op_type;
6803 register I32 oa = PL_opargs[type] >> OASHIFT;
6805 PERL_ARGS_ASSERT_CK_FUN;
6807 if (o->op_flags & OPf_STACKED) {
6808 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
6811 return no_fh_allowed(o);
6814 if (o->op_flags & OPf_KIDS) {
6815 OP **tokid = &cLISTOPo->op_first;
6816 register OP *kid = cLISTOPo->op_first;
6820 if (kid->op_type == OP_PUSHMARK ||
6821 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
6823 tokid = &kid->op_sibling;
6824 kid = kid->op_sibling;
6826 if (!kid && PL_opargs[type] & OA_DEFGV)
6827 *tokid = kid = newDEFSVOP();
6831 sibl = kid->op_sibling;
6833 if (!sibl && kid->op_type == OP_STUB) {
6840 /* list seen where single (scalar) arg expected? */
6841 if (numargs == 1 && !(oa >> 4)
6842 && kid->op_type == OP_LIST && type != OP_SCALAR)
6844 return too_many_arguments(o,PL_op_desc[type]);
6857 if ((type == OP_PUSH || type == OP_UNSHIFT)
6858 && !kid->op_sibling && ckWARN(WARN_SYNTAX))
6859 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6860 "Useless use of %s with no values",
6863 if (kid->op_type == OP_CONST &&
6864 (kid->op_private & OPpCONST_BARE))
6866 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
6867 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
6868 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
6869 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6870 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
6871 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6873 op_getmad(kid,newop,'K');
6878 kid->op_sibling = sibl;
6881 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
6882 bad_type(numargs, "array", PL_op_desc[type], kid);
6886 if (kid->op_type == OP_CONST &&
6887 (kid->op_private & OPpCONST_BARE))
6889 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
6890 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
6891 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
6892 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6893 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
6894 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6896 op_getmad(kid,newop,'K');
6901 kid->op_sibling = sibl;
6904 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
6905 bad_type(numargs, "hash", PL_op_desc[type], kid);
6910 OP * const newop = newUNOP(OP_NULL, 0, kid);
6911 kid->op_sibling = 0;
6913 newop->op_next = newop;
6915 kid->op_sibling = sibl;
6920 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
6921 if (kid->op_type == OP_CONST &&
6922 (kid->op_private & OPpCONST_BARE))
6924 OP * const newop = newGVOP(OP_GV, 0,
6925 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
6926 if (!(o->op_private & 1) && /* if not unop */
6927 kid == cLISTOPo->op_last)
6928 cLISTOPo->op_last = newop;
6930 op_getmad(kid,newop,'K');
6936 else if (kid->op_type == OP_READLINE) {
6937 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
6938 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
6941 I32 flags = OPf_SPECIAL;
6945 /* is this op a FH constructor? */
6946 if (is_handle_constructor(o,numargs)) {
6947 const char *name = NULL;
6951 /* Set a flag to tell rv2gv to vivify
6952 * need to "prove" flag does not mean something
6953 * else already - NI-S 1999/05/07
6956 if (kid->op_type == OP_PADSV) {
6958 = PAD_COMPNAME_SV(kid->op_targ);
6959 name = SvPV_const(namesv, len);
6961 else if (kid->op_type == OP_RV2SV
6962 && kUNOP->op_first->op_type == OP_GV)
6964 GV * const gv = cGVOPx_gv(kUNOP->op_first);
6966 len = GvNAMELEN(gv);
6968 else if (kid->op_type == OP_AELEM
6969 || kid->op_type == OP_HELEM)
6972 OP *op = ((BINOP*)kid)->op_first;
6976 const char * const a =
6977 kid->op_type == OP_AELEM ?
6979 if (((op->op_type == OP_RV2AV) ||
6980 (op->op_type == OP_RV2HV)) &&
6981 (firstop = ((UNOP*)op)->op_first) &&
6982 (firstop->op_type == OP_GV)) {
6983 /* packagevar $a[] or $h{} */
6984 GV * const gv = cGVOPx_gv(firstop);
6992 else if (op->op_type == OP_PADAV
6993 || op->op_type == OP_PADHV) {
6994 /* lexicalvar $a[] or $h{} */
6995 const char * const padname =
6996 PAD_COMPNAME_PV(op->op_targ);
7005 name = SvPV_const(tmpstr, len);
7010 name = "__ANONIO__";
7017 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
7018 namesv = PAD_SVl(targ);
7019 SvUPGRADE(namesv, SVt_PV);
7021 sv_setpvs(namesv, "$");
7022 sv_catpvn(namesv, name, len);
7025 kid->op_sibling = 0;
7026 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
7027 kid->op_targ = targ;
7028 kid->op_private |= priv;
7030 kid->op_sibling = sibl;
7036 mod(scalar(kid), type);
7040 tokid = &kid->op_sibling;
7041 kid = kid->op_sibling;
7044 if (kid && kid->op_type != OP_STUB)
7045 return too_many_arguments(o,OP_DESC(o));
7046 o->op_private |= numargs;
7048 /* FIXME - should the numargs move as for the PERL_MAD case? */
7049 o->op_private |= numargs;
7051 return too_many_arguments(o,OP_DESC(o));
7055 else if (PL_opargs[type] & OA_DEFGV) {
7057 OP *newop = newUNOP(type, 0, newDEFSVOP());
7058 op_getmad(o,newop,'O');
7061 /* Ordering of these two is important to keep f_map.t passing. */
7063 return newUNOP(type, 0, newDEFSVOP());
7068 while (oa & OA_OPTIONAL)
7070 if (oa && oa != OA_LIST)
7071 return too_few_arguments(o,OP_DESC(o));
7077 Perl_ck_glob(pTHX_ OP *o)
7082 PERL_ARGS_ASSERT_CK_GLOB;
7085 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
7086 append_elem(OP_GLOB, o, newDEFSVOP());
7088 if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
7089 && GvCVu(gv) && GvIMPORTED_CV(gv)))
7091 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7094 #if !defined(PERL_EXTERNAL_GLOB)
7095 /* XXX this can be tightened up and made more failsafe. */
7096 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7099 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
7100 newSVpvs("File::Glob"), NULL, NULL, NULL);
7101 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7102 glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV);
7103 GvCV(gv) = GvCV(glob_gv);
7104 SvREFCNT_inc_void(MUTABLE_SV(GvCV(gv)));
7105 GvIMPORTED_CV_on(gv);
7108 #endif /* PERL_EXTERNAL_GLOB */
7110 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7111 append_elem(OP_GLOB, o,
7112 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
7113 o->op_type = OP_LIST;
7114 o->op_ppaddr = PL_ppaddr[OP_LIST];
7115 cLISTOPo->op_first->op_type = OP_PUSHMARK;
7116 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
7117 cLISTOPo->op_first->op_targ = 0;
7118 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
7119 append_elem(OP_LIST, o,
7120 scalar(newUNOP(OP_RV2CV, 0,
7121 newGVOP(OP_GV, 0, gv)))));
7122 o = newUNOP(OP_NULL, 0, ck_subr(o));
7123 o->op_targ = OP_GLOB; /* hint at what it used to be */
7126 gv = newGVgen("main");
7128 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
7134 Perl_ck_grep(pTHX_ OP *o)
7139 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
7142 PERL_ARGS_ASSERT_CK_GREP;
7144 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
7145 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
7147 if (o->op_flags & OPf_STACKED) {
7150 kid = cLISTOPo->op_first->op_sibling;
7151 if (!cUNOPx(kid)->op_next)
7152 Perl_croak(aTHX_ "panic: ck_grep");
7153 for (k = cUNOPx(kid)->op_first; k; k = k->op_next) {
7156 NewOp(1101, gwop, 1, LOGOP);
7157 kid->op_next = (OP*)gwop;
7158 o->op_flags &= ~OPf_STACKED;
7160 kid = cLISTOPo->op_first->op_sibling;
7161 if (type == OP_MAPWHILE)
7166 if (PL_parser && PL_parser->error_count)
7168 kid = cLISTOPo->op_first->op_sibling;
7169 if (kid->op_type != OP_NULL)
7170 Perl_croak(aTHX_ "panic: ck_grep");
7171 kid = kUNOP->op_first;
7174 NewOp(1101, gwop, 1, LOGOP);
7175 gwop->op_type = type;
7176 gwop->op_ppaddr = PL_ppaddr[type];
7177 gwop->op_first = listkids(o);
7178 gwop->op_flags |= OPf_KIDS;
7179 gwop->op_other = LINKLIST(kid);
7180 kid->op_next = (OP*)gwop;
7181 offset = pad_findmy("$_");
7182 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
7183 o->op_private = gwop->op_private = 0;
7184 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
7187 o->op_private = gwop->op_private = OPpGREP_LEX;
7188 gwop->op_targ = o->op_targ = offset;
7191 kid = cLISTOPo->op_first->op_sibling;
7192 if (!kid || !kid->op_sibling)
7193 return too_few_arguments(o,OP_DESC(o));
7194 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
7195 mod(kid, OP_GREPSTART);
7201 Perl_ck_index(pTHX_ OP *o)
7203 PERL_ARGS_ASSERT_CK_INDEX;
7205 if (o->op_flags & OPf_KIDS) {
7206 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7208 kid = kid->op_sibling; /* get past "big" */
7209 if (kid && kid->op_type == OP_CONST)
7210 fbm_compile(((SVOP*)kid)->op_sv, 0);
7216 Perl_ck_lfun(pTHX_ OP *o)
7218 const OPCODE type = o->op_type;
7220 PERL_ARGS_ASSERT_CK_LFUN;
7222 return modkids(ck_fun(o), type);
7226 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
7228 PERL_ARGS_ASSERT_CK_DEFINED;
7230 if ((o->op_flags & OPf_KIDS) && ckWARN2(WARN_DEPRECATED, WARN_SYNTAX)) {
7231 switch (cUNOPo->op_first->op_type) {
7233 /* This is needed for
7234 if (defined %stash::)
7235 to work. Do not break Tk.
7237 break; /* Globals via GV can be undef */
7239 case OP_AASSIGN: /* Is this a good idea? */
7240 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7241 "defined(@array) is deprecated");
7242 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7243 "\t(Maybe you should just omit the defined()?)\n");
7246 /* This is needed for
7247 if (defined %stash::)
7248 to work. Do not break Tk.
7250 break; /* Globals via GV can be undef */
7252 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7253 "defined(%%hash) is deprecated");
7254 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7255 "\t(Maybe you should just omit the defined()?)\n");
7266 Perl_ck_readline(pTHX_ OP *o)
7268 PERL_ARGS_ASSERT_CK_READLINE;
7270 if (!(o->op_flags & OPf_KIDS)) {
7272 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
7274 op_getmad(o,newop,'O');
7284 Perl_ck_rfun(pTHX_ OP *o)
7286 const OPCODE type = o->op_type;
7288 PERL_ARGS_ASSERT_CK_RFUN;
7290 return refkids(ck_fun(o), type);
7294 Perl_ck_listiob(pTHX_ OP *o)
7298 PERL_ARGS_ASSERT_CK_LISTIOB;
7300 kid = cLISTOPo->op_first;
7303 kid = cLISTOPo->op_first;
7305 if (kid->op_type == OP_PUSHMARK)
7306 kid = kid->op_sibling;
7307 if (kid && o->op_flags & OPf_STACKED)
7308 kid = kid->op_sibling;
7309 else if (kid && !kid->op_sibling) { /* print HANDLE; */
7310 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
7311 o->op_flags |= OPf_STACKED; /* make it a filehandle */
7312 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
7313 cLISTOPo->op_first->op_sibling = kid;
7314 cLISTOPo->op_last = kid;
7315 kid = kid->op_sibling;
7320 append_elem(o->op_type, o, newDEFSVOP());
7326 Perl_ck_smartmatch(pTHX_ OP *o)
7329 if (0 == (o->op_flags & OPf_SPECIAL)) {
7330 OP *first = cBINOPo->op_first;
7331 OP *second = first->op_sibling;
7333 /* Implicitly take a reference to an array or hash */
7334 first->op_sibling = NULL;
7335 first = cBINOPo->op_first = ref_array_or_hash(first);
7336 second = first->op_sibling = ref_array_or_hash(second);
7338 /* Implicitly take a reference to a regular expression */
7339 if (first->op_type == OP_MATCH) {
7340 first->op_type = OP_QR;
7341 first->op_ppaddr = PL_ppaddr[OP_QR];
7343 if (second->op_type == OP_MATCH) {
7344 second->op_type = OP_QR;
7345 second->op_ppaddr = PL_ppaddr[OP_QR];
7354 Perl_ck_sassign(pTHX_ OP *o)
7357 OP * const kid = cLISTOPo->op_first;
7359 PERL_ARGS_ASSERT_CK_SASSIGN;
7361 /* has a disposable target? */
7362 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
7363 && !(kid->op_flags & OPf_STACKED)
7364 /* Cannot steal the second time! */
7365 && !(kid->op_private & OPpTARGET_MY)
7366 /* Keep the full thing for madskills */
7370 OP * const kkid = kid->op_sibling;
7372 /* Can just relocate the target. */
7373 if (kkid && kkid->op_type == OP_PADSV
7374 && !(kkid->op_private & OPpLVAL_INTRO))
7376 kid->op_targ = kkid->op_targ;
7378 /* Now we do not need PADSV and SASSIGN. */
7379 kid->op_sibling = o->op_sibling; /* NULL */
7380 cLISTOPo->op_first = NULL;
7383 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
7387 if (kid->op_sibling) {
7388 OP *kkid = kid->op_sibling;
7389 if (kkid->op_type == OP_PADSV
7390 && (kkid->op_private & OPpLVAL_INTRO)
7391 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
7392 const PADOFFSET target = kkid->op_targ;
7393 OP *const other = newOP(OP_PADSV,
7395 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
7396 OP *const first = newOP(OP_NULL, 0);
7397 OP *const nullop = newCONDOP(0, first, o, other);
7398 OP *const condop = first->op_next;
7399 /* hijacking PADSTALE for uninitialized state variables */
7400 SvPADSTALE_on(PAD_SVl(target));
7402 condop->op_type = OP_ONCE;
7403 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
7404 condop->op_targ = target;
7405 other->op_targ = target;
7407 /* Because we change the type of the op here, we will skip the
7408 assinment binop->op_last = binop->op_first->op_sibling; at the
7409 end of Perl_newBINOP(). So need to do it here. */
7410 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
7419 Perl_ck_match(pTHX_ OP *o)
7423 PERL_ARGS_ASSERT_CK_MATCH;
7425 if (o->op_type != OP_QR && PL_compcv) {
7426 const PADOFFSET offset = pad_findmy("$_");
7427 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
7428 o->op_targ = offset;
7429 o->op_private |= OPpTARGET_MY;
7432 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
7433 o->op_private |= OPpRUNTIME;
7438 Perl_ck_method(pTHX_ OP *o)
7440 OP * const kid = cUNOPo->op_first;
7442 PERL_ARGS_ASSERT_CK_METHOD;
7444 if (kid->op_type == OP_CONST) {
7445 SV* sv = kSVOP->op_sv;
7446 const char * const method = SvPVX_const(sv);
7447 if (!(strchr(method, ':') || strchr(method, '\''))) {
7449 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
7450 sv = newSVpvn_share(method, SvCUR(sv), 0);
7453 kSVOP->op_sv = NULL;
7455 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
7457 op_getmad(o,cmop,'O');
7468 Perl_ck_null(pTHX_ OP *o)
7470 PERL_ARGS_ASSERT_CK_NULL;
7471 PERL_UNUSED_CONTEXT;
7476 Perl_ck_open(pTHX_ OP *o)
7479 HV * const table = GvHV(PL_hintgv);
7481 PERL_ARGS_ASSERT_CK_OPEN;
7484 SV **svp = hv_fetchs(table, "open_IN", FALSE);
7487 const char *d = SvPV_const(*svp, len);
7488 const I32 mode = mode_from_discipline(d, len);
7489 if (mode & O_BINARY)
7490 o->op_private |= OPpOPEN_IN_RAW;
7491 else if (mode & O_TEXT)
7492 o->op_private |= OPpOPEN_IN_CRLF;
7495 svp = hv_fetchs(table, "open_OUT", FALSE);
7498 const char *d = SvPV_const(*svp, len);
7499 const I32 mode = mode_from_discipline(d, len);
7500 if (mode & O_BINARY)
7501 o->op_private |= OPpOPEN_OUT_RAW;
7502 else if (mode & O_TEXT)
7503 o->op_private |= OPpOPEN_OUT_CRLF;
7506 if (o->op_type == OP_BACKTICK) {
7507 if (!(o->op_flags & OPf_KIDS)) {
7508 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
7510 op_getmad(o,newop,'O');
7519 /* In case of three-arg dup open remove strictness
7520 * from the last arg if it is a bareword. */
7521 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
7522 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
7526 if ((last->op_type == OP_CONST) && /* The bareword. */
7527 (last->op_private & OPpCONST_BARE) &&
7528 (last->op_private & OPpCONST_STRICT) &&
7529 (oa = first->op_sibling) && /* The fh. */
7530 (oa = oa->op_sibling) && /* The mode. */
7531 (oa->op_type == OP_CONST) &&
7532 SvPOK(((SVOP*)oa)->op_sv) &&
7533 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
7534 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
7535 (last == oa->op_sibling)) /* The bareword. */
7536 last->op_private &= ~OPpCONST_STRICT;
7542 Perl_ck_repeat(pTHX_ OP *o)
7544 PERL_ARGS_ASSERT_CK_REPEAT;
7546 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
7547 o->op_private |= OPpREPEAT_DOLIST;
7548 cBINOPo->op_first = force_list(cBINOPo->op_first);
7556 Perl_ck_require(pTHX_ OP *o)
7561 PERL_ARGS_ASSERT_CK_REQUIRE;
7563 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
7564 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7566 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
7567 SV * const sv = kid->op_sv;
7568 U32 was_readonly = SvREADONLY(sv);
7575 sv_force_normal_flags(sv, 0);
7576 assert(!SvREADONLY(sv));
7586 for (; s < end; s++) {
7587 if (*s == ':' && s[1] == ':') {
7589 Move(s+2, s+1, end - s - 1, char);
7594 sv_catpvs(sv, ".pm");
7595 SvFLAGS(sv) |= was_readonly;
7599 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
7600 /* handle override, if any */
7601 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
7602 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7603 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
7604 gv = gvp ? *gvp : NULL;
7608 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7609 OP * const kid = cUNOPo->op_first;
7612 cUNOPo->op_first = 0;
7616 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
7617 append_elem(OP_LIST, kid,
7618 scalar(newUNOP(OP_RV2CV, 0,
7621 op_getmad(o,newop,'O');
7629 Perl_ck_return(pTHX_ OP *o)
7634 PERL_ARGS_ASSERT_CK_RETURN;
7636 kid = cLISTOPo->op_first->op_sibling;
7637 if (CvLVALUE(PL_compcv)) {
7638 for (; kid; kid = kid->op_sibling)
7639 mod(kid, OP_LEAVESUBLV);
7641 for (; kid; kid = kid->op_sibling)
7642 if ((kid->op_type == OP_NULL)
7643 && ((kid->op_flags & (OPf_SPECIAL|OPf_KIDS)) == (OPf_SPECIAL|OPf_KIDS))) {
7644 /* This is a do block */
7645 OP *op = kUNOP->op_first;
7646 if (op->op_type == OP_LEAVE && op->op_flags & OPf_KIDS) {
7647 op = cUNOPx(op)->op_first;
7648 assert(op->op_type == OP_ENTER && !(op->op_flags & OPf_SPECIAL));
7649 /* Force the use of the caller's context */
7650 op->op_flags |= OPf_SPECIAL;
7659 Perl_ck_select(pTHX_ OP *o)
7664 PERL_ARGS_ASSERT_CK_SELECT;
7666 if (o->op_flags & OPf_KIDS) {
7667 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7668 if (kid && kid->op_sibling) {
7669 o->op_type = OP_SSELECT;
7670 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
7672 return fold_constants(o);
7676 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7677 if (kid && kid->op_type == OP_RV2GV)
7678 kid->op_private &= ~HINT_STRICT_REFS;
7683 Perl_ck_shift(pTHX_ OP *o)
7686 const I32 type = o->op_type;
7688 PERL_ARGS_ASSERT_CK_SHIFT;
7690 if (!(o->op_flags & OPf_KIDS)) {
7692 /* FIXME - this can be refactored to reduce code in #ifdefs */
7694 OP * const oldo = o;
7698 argop = newUNOP(OP_RV2AV, 0,
7699 scalar(newGVOP(OP_GV, 0, CvUNIQUE(PL_compcv) ? PL_argvgv : PL_defgv)));
7701 o = newUNOP(type, 0, scalar(argop));
7702 op_getmad(oldo,o,'O');
7705 return newUNOP(type, 0, scalar(argop));
7708 return scalar(modkids(ck_fun(o), type));
7712 Perl_ck_sort(pTHX_ OP *o)
7717 PERL_ARGS_ASSERT_CK_SORT;
7719 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
7720 HV * const hinthv = GvHV(PL_hintgv);
7722 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
7724 const I32 sorthints = (I32)SvIV(*svp);
7725 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
7726 o->op_private |= OPpSORT_QSORT;
7727 if ((sorthints & HINT_SORT_STABLE) != 0)
7728 o->op_private |= OPpSORT_STABLE;
7733 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
7735 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7736 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
7738 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
7740 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
7742 if (kid->op_type == OP_SCOPE) {
7746 else if (kid->op_type == OP_LEAVE) {
7747 if (o->op_type == OP_SORT) {
7748 op_null(kid); /* wipe out leave */
7751 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
7752 if (k->op_next == kid)
7754 /* don't descend into loops */
7755 else if (k->op_type == OP_ENTERLOOP
7756 || k->op_type == OP_ENTERITER)
7758 k = cLOOPx(k)->op_lastop;
7763 kid->op_next = 0; /* just disconnect the leave */
7764 k = kLISTOP->op_first;
7769 if (o->op_type == OP_SORT) {
7770 /* provide scalar context for comparison function/block */
7776 o->op_flags |= OPf_SPECIAL;
7778 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
7781 firstkid = firstkid->op_sibling;
7784 /* provide list context for arguments */
7785 if (o->op_type == OP_SORT)
7792 S_simplify_sort(pTHX_ OP *o)
7795 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7801 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
7803 if (!(o->op_flags & OPf_STACKED))
7805 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
7806 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
7807 kid = kUNOP->op_first; /* get past null */
7808 if (kid->op_type != OP_SCOPE)
7810 kid = kLISTOP->op_last; /* get past scope */
7811 switch(kid->op_type) {
7819 k = kid; /* remember this node*/
7820 if (kBINOP->op_first->op_type != OP_RV2SV)
7822 kid = kBINOP->op_first; /* get past cmp */
7823 if (kUNOP->op_first->op_type != OP_GV)
7825 kid = kUNOP->op_first; /* get past rv2sv */
7827 if (GvSTASH(gv) != PL_curstash)
7829 gvname = GvNAME(gv);
7830 if (*gvname == 'a' && gvname[1] == '\0')
7832 else if (*gvname == 'b' && gvname[1] == '\0')
7837 kid = k; /* back to cmp */
7838 if (kBINOP->op_last->op_type != OP_RV2SV)
7840 kid = kBINOP->op_last; /* down to 2nd arg */
7841 if (kUNOP->op_first->op_type != OP_GV)
7843 kid = kUNOP->op_first; /* get past rv2sv */
7845 if (GvSTASH(gv) != PL_curstash)
7847 gvname = GvNAME(gv);
7849 ? !(*gvname == 'a' && gvname[1] == '\0')
7850 : !(*gvname == 'b' && gvname[1] == '\0'))
7852 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
7854 o->op_private |= OPpSORT_DESCEND;
7855 if (k->op_type == OP_NCMP)
7856 o->op_private |= OPpSORT_NUMERIC;
7857 if (k->op_type == OP_I_NCMP)
7858 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
7859 kid = cLISTOPo->op_first->op_sibling;
7860 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
7862 op_getmad(kid,o,'S'); /* then delete it */
7864 op_free(kid); /* then delete it */
7869 Perl_ck_split(pTHX_ OP *o)
7874 PERL_ARGS_ASSERT_CK_SPLIT;
7876 if (o->op_flags & OPf_STACKED)
7877 return no_fh_allowed(o);
7879 kid = cLISTOPo->op_first;
7880 if (kid->op_type != OP_NULL)
7881 Perl_croak(aTHX_ "panic: ck_split");
7882 kid = kid->op_sibling;
7883 op_free(cLISTOPo->op_first);
7884 cLISTOPo->op_first = kid;
7886 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
7887 cLISTOPo->op_last = kid; /* There was only one element previously */
7890 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
7891 OP * const sibl = kid->op_sibling;
7892 kid->op_sibling = 0;
7893 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
7894 if (cLISTOPo->op_first == cLISTOPo->op_last)
7895 cLISTOPo->op_last = kid;
7896 cLISTOPo->op_first = kid;
7897 kid->op_sibling = sibl;
7900 kid->op_type = OP_PUSHRE;
7901 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
7903 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL && ckWARN(WARN_REGEXP)) {
7904 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
7905 "Use of /g modifier is meaningless in split");
7908 if (!kid->op_sibling)
7909 append_elem(OP_SPLIT, o, newDEFSVOP());
7911 kid = kid->op_sibling;
7914 if (!kid->op_sibling)
7915 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
7916 assert(kid->op_sibling);
7918 kid = kid->op_sibling;
7921 if (kid->op_sibling)
7922 return too_many_arguments(o,OP_DESC(o));
7928 Perl_ck_join(pTHX_ OP *o)
7930 const OP * const kid = cLISTOPo->op_first->op_sibling;
7932 PERL_ARGS_ASSERT_CK_JOIN;
7934 if (kid && kid->op_type == OP_MATCH) {
7935 if (ckWARN(WARN_SYNTAX)) {
7936 const REGEXP *re = PM_GETRE(kPMOP);
7937 const char *pmstr = re ? RX_PRECOMP_const(re) : "STRING";
7938 const STRLEN len = re ? RX_PRELEN(re) : 6;
7939 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7940 "/%.*s/ should probably be written as \"%.*s\"",
7941 (int)len, pmstr, (int)len, pmstr);
7948 Perl_ck_subr(pTHX_ OP *o)
7951 OP *prev = ((cUNOPo->op_first->op_sibling)
7952 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
7953 OP *o2 = prev->op_sibling;
7955 const char *proto = NULL;
7956 const char *proto_end = NULL;
7961 I32 contextclass = 0;
7962 const char *e = NULL;
7965 PERL_ARGS_ASSERT_CK_SUBR;
7967 o->op_private |= OPpENTERSUB_HASTARG;
7968 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
7969 if (cvop->op_type == OP_RV2CV) {
7971 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
7972 op_null(cvop); /* disable rv2cv */
7973 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
7974 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
7975 GV *gv = cGVOPx_gv(tmpop);
7978 tmpop->op_private |= OPpEARLY_CV;
7982 namegv = CvANON(cv) ? gv : CvGV(cv);
7983 proto = SvPV(MUTABLE_SV(cv), len);
7984 proto_end = proto + len;
7989 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
7990 if (o2->op_type == OP_CONST)
7991 o2->op_private &= ~OPpCONST_STRICT;
7992 else if (o2->op_type == OP_LIST) {
7993 OP * const sib = ((UNOP*)o2)->op_first->op_sibling;
7994 if (sib && sib->op_type == OP_CONST)
7995 sib->op_private &= ~OPpCONST_STRICT;
7998 o->op_private |= (PL_hints & HINT_STRICT_REFS);
7999 if (PERLDB_SUB && PL_curstash != PL_debstash)
8000 o->op_private |= OPpENTERSUB_DB;
8001 while (o2 != cvop) {
8003 if (PL_madskills && o2->op_type == OP_STUB) {
8004 o2 = o2->op_sibling;
8007 if (PL_madskills && o2->op_type == OP_NULL)
8008 o3 = ((UNOP*)o2)->op_first;
8012 if (proto >= proto_end)
8013 return too_many_arguments(o, gv_ename(namegv));
8021 /* _ must be at the end */
8022 if (proto[1] && proto[1] != ';')
8037 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
8039 arg == 1 ? "block or sub {}" : "sub {}",
8040 gv_ename(namegv), o3);
8043 /* '*' allows any scalar type, including bareword */
8046 if (o3->op_type == OP_RV2GV)
8047 goto wrapref; /* autoconvert GLOB -> GLOBref */
8048 else if (o3->op_type == OP_CONST)
8049 o3->op_private &= ~OPpCONST_STRICT;
8050 else if (o3->op_type == OP_ENTERSUB) {
8051 /* accidental subroutine, revert to bareword */
8052 OP *gvop = ((UNOP*)o3)->op_first;
8053 if (gvop && gvop->op_type == OP_NULL) {
8054 gvop = ((UNOP*)gvop)->op_first;
8056 for (; gvop->op_sibling; gvop = gvop->op_sibling)
8059 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
8060 (gvop = ((UNOP*)gvop)->op_first) &&
8061 gvop->op_type == OP_GV)
8063 GV * const gv = cGVOPx_gv(gvop);
8064 OP * const sibling = o2->op_sibling;
8065 SV * const n = newSVpvs("");
8067 OP * const oldo2 = o2;
8071 gv_fullname4(n, gv, "", FALSE);
8072 o2 = newSVOP(OP_CONST, 0, n);
8073 op_getmad(oldo2,o2,'O');
8074 prev->op_sibling = o2;
8075 o2->op_sibling = sibling;
8091 if (contextclass++ == 0) {
8092 e = strchr(proto, ']');
8093 if (!e || e == proto)
8102 const char *p = proto;
8103 const char *const end = proto;
8105 while (*--p != '[') {}
8106 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
8108 gv_ename(namegv), o3);
8113 if (o3->op_type == OP_RV2GV)
8116 bad_type(arg, "symbol", gv_ename(namegv), o3);
8119 if (o3->op_type == OP_ENTERSUB)
8122 bad_type(arg, "subroutine entry", gv_ename(namegv),
8126 if (o3->op_type == OP_RV2SV ||
8127 o3->op_type == OP_PADSV ||
8128 o3->op_type == OP_HELEM ||
8129 o3->op_type == OP_AELEM)
8132 bad_type(arg, "scalar", gv_ename(namegv), o3);
8135 if (o3->op_type == OP_RV2AV ||
8136 o3->op_type == OP_PADAV)
8139 bad_type(arg, "array", gv_ename(namegv), o3);
8142 if (o3->op_type == OP_RV2HV ||
8143 o3->op_type == OP_PADHV)
8146 bad_type(arg, "hash", gv_ename(namegv), o3);
8151 OP* const sib = kid->op_sibling;
8152 kid->op_sibling = 0;
8153 o2 = newUNOP(OP_REFGEN, 0, kid);
8154 o2->op_sibling = sib;
8155 prev->op_sibling = o2;
8157 if (contextclass && e) {
8172 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
8173 gv_ename(namegv), SVfARG(cv));
8178 mod(o2, OP_ENTERSUB);
8180 o2 = o2->op_sibling;
8182 if (o2 == cvop && proto && *proto == '_') {
8183 /* generate an access to $_ */
8185 o2->op_sibling = prev->op_sibling;
8186 prev->op_sibling = o2; /* instead of cvop */
8188 if (proto && !optional && proto_end > proto &&
8189 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
8190 return too_few_arguments(o, gv_ename(namegv));
8193 OP * const oldo = o;
8197 o=newSVOP(OP_CONST, 0, newSViv(0));
8198 op_getmad(oldo,o,'O');
8204 Perl_ck_svconst(pTHX_ OP *o)
8206 PERL_ARGS_ASSERT_CK_SVCONST;
8207 PERL_UNUSED_CONTEXT;
8208 SvREADONLY_on(cSVOPo->op_sv);
8213 Perl_ck_chdir(pTHX_ OP *o)
8215 if (o->op_flags & OPf_KIDS) {
8216 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8218 if (kid && kid->op_type == OP_CONST &&
8219 (kid->op_private & OPpCONST_BARE))
8221 o->op_flags |= OPf_SPECIAL;
8222 kid->op_private &= ~OPpCONST_STRICT;
8229 Perl_ck_trunc(pTHX_ OP *o)
8231 PERL_ARGS_ASSERT_CK_TRUNC;
8233 if (o->op_flags & OPf_KIDS) {
8234 SVOP *kid = (SVOP*)cUNOPo->op_first;
8236 if (kid->op_type == OP_NULL)
8237 kid = (SVOP*)kid->op_sibling;
8238 if (kid && kid->op_type == OP_CONST &&
8239 (kid->op_private & OPpCONST_BARE))
8241 o->op_flags |= OPf_SPECIAL;
8242 kid->op_private &= ~OPpCONST_STRICT;
8249 Perl_ck_unpack(pTHX_ OP *o)
8251 OP *kid = cLISTOPo->op_first;
8253 PERL_ARGS_ASSERT_CK_UNPACK;
8255 if (kid->op_sibling) {
8256 kid = kid->op_sibling;
8257 if (!kid->op_sibling)
8258 kid->op_sibling = newDEFSVOP();
8264 Perl_ck_substr(pTHX_ OP *o)
8266 PERL_ARGS_ASSERT_CK_SUBSTR;
8269 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
8270 OP *kid = cLISTOPo->op_first;
8272 if (kid->op_type == OP_NULL)
8273 kid = kid->op_sibling;
8275 kid->op_flags |= OPf_MOD;
8282 Perl_ck_each(pTHX_ OP *o)
8285 OP *kid = cLISTOPo->op_first;
8287 PERL_ARGS_ASSERT_CK_EACH;
8289 if (kid->op_type == OP_PADAV || kid->op_type == OP_RV2AV) {
8290 const unsigned new_type = o->op_type == OP_EACH ? OP_AEACH
8291 : o->op_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
8292 o->op_type = new_type;
8293 o->op_ppaddr = PL_ppaddr[new_type];
8295 else if (!(kid->op_type == OP_PADHV || kid->op_type == OP_RV2HV
8296 || (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE)
8298 bad_type(1, "hash or array", PL_op_desc[o->op_type], kid);
8304 /* A peephole optimizer. We visit the ops in the order they're to execute.
8305 * See the comments at the top of this file for more details about when
8306 * peep() is called */
8309 Perl_peep(pTHX_ register OP *o)
8312 register OP* oldop = NULL;
8314 if (!o || o->op_opt)
8318 SAVEVPTR(PL_curcop);
8319 for (; o; o = o->op_next) {
8322 /* By default, this op has now been optimised. A couple of cases below
8323 clear this again. */
8326 switch (o->op_type) {
8329 PL_curcop = ((COP*)o); /* for warnings */
8333 if (cSVOPo->op_private & OPpCONST_STRICT)
8334 no_bareword_allowed(o);
8337 case OP_METHOD_NAMED:
8338 /* Relocate sv to the pad for thread safety.
8339 * Despite being a "constant", the SV is written to,
8340 * for reference counts, sv_upgrade() etc. */
8342 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
8343 if (o->op_type != OP_METHOD_NAMED && SvPADTMP(cSVOPo->op_sv)) {
8344 /* If op_sv is already a PADTMP then it is being used by
8345 * some pad, so make a copy. */
8346 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
8347 SvREADONLY_on(PAD_SVl(ix));
8348 SvREFCNT_dec(cSVOPo->op_sv);
8350 else if (o->op_type != OP_METHOD_NAMED
8351 && cSVOPo->op_sv == &PL_sv_undef) {
8352 /* PL_sv_undef is hack - it's unsafe to store it in the
8353 AV that is the pad, because av_fetch treats values of
8354 PL_sv_undef as a "free" AV entry and will merrily
8355 replace them with a new SV, causing pad_alloc to think
8356 that this pad slot is free. (When, clearly, it is not)
8358 SvOK_off(PAD_SVl(ix));
8359 SvPADTMP_on(PAD_SVl(ix));
8360 SvREADONLY_on(PAD_SVl(ix));
8363 SvREFCNT_dec(PAD_SVl(ix));
8364 SvPADTMP_on(cSVOPo->op_sv);
8365 PAD_SETSV(ix, cSVOPo->op_sv);
8366 /* XXX I don't know how this isn't readonly already. */
8367 SvREADONLY_on(PAD_SVl(ix));
8369 cSVOPo->op_sv = NULL;
8376 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
8377 if (o->op_next->op_private & OPpTARGET_MY) {
8378 if (o->op_flags & OPf_STACKED) /* chained concats */
8379 break; /* ignore_optimization */
8381 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
8382 o->op_targ = o->op_next->op_targ;
8383 o->op_next->op_targ = 0;
8384 o->op_private |= OPpTARGET_MY;
8387 op_null(o->op_next);
8391 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
8392 break; /* Scalar stub must produce undef. List stub is noop */
8396 if (o->op_targ == OP_NEXTSTATE
8397 || o->op_targ == OP_DBSTATE)
8399 PL_curcop = ((COP*)o);
8401 /* XXX: We avoid setting op_seq here to prevent later calls
8402 to peep() from mistakenly concluding that optimisation
8403 has already occurred. This doesn't fix the real problem,
8404 though (See 20010220.007). AMS 20010719 */
8405 /* op_seq functionality is now replaced by op_opt */
8412 if (oldop && o->op_next) {
8413 oldop->op_next = o->op_next;
8421 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
8422 OP* const pop = (o->op_type == OP_PADAV) ?
8423 o->op_next : o->op_next->op_next;
8425 if (pop && pop->op_type == OP_CONST &&
8426 ((PL_op = pop->op_next)) &&
8427 pop->op_next->op_type == OP_AELEM &&
8428 !(pop->op_next->op_private &
8429 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
8430 (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop))
8435 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
8436 no_bareword_allowed(pop);
8437 if (o->op_type == OP_GV)
8438 op_null(o->op_next);
8439 op_null(pop->op_next);
8441 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
8442 o->op_next = pop->op_next->op_next;
8443 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
8444 o->op_private = (U8)i;
8445 if (o->op_type == OP_GV) {
8450 o->op_flags |= OPf_SPECIAL;
8451 o->op_type = OP_AELEMFAST;
8456 if (o->op_next->op_type == OP_RV2SV) {
8457 if (!(o->op_next->op_private & OPpDEREF)) {
8458 op_null(o->op_next);
8459 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
8461 o->op_next = o->op_next->op_next;
8462 o->op_type = OP_GVSV;
8463 o->op_ppaddr = PL_ppaddr[OP_GVSV];
8466 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
8467 GV * const gv = cGVOPo_gv;
8468 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
8469 /* XXX could check prototype here instead of just carping */
8470 SV * const sv = sv_newmortal();
8471 gv_efullname3(sv, gv, NULL);
8472 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
8473 "%"SVf"() called too early to check prototype",
8477 else if (o->op_next->op_type == OP_READLINE
8478 && o->op_next->op_next->op_type == OP_CONCAT
8479 && (o->op_next->op_next->op_flags & OPf_STACKED))
8481 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
8482 o->op_type = OP_RCATLINE;
8483 o->op_flags |= OPf_STACKED;
8484 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
8485 op_null(o->op_next->op_next);
8486 op_null(o->op_next);
8502 while (cLOGOP->op_other->op_type == OP_NULL)
8503 cLOGOP->op_other = cLOGOP->op_other->op_next;
8504 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
8509 while (cLOOP->op_redoop->op_type == OP_NULL)
8510 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
8511 peep(cLOOP->op_redoop);
8512 while (cLOOP->op_nextop->op_type == OP_NULL)
8513 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
8514 peep(cLOOP->op_nextop);
8515 while (cLOOP->op_lastop->op_type == OP_NULL)
8516 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
8517 peep(cLOOP->op_lastop);
8521 assert(!(cPMOP->op_pmflags & PMf_ONCE));
8522 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
8523 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
8524 cPMOP->op_pmstashstartu.op_pmreplstart
8525 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
8526 peep(cPMOP->op_pmstashstartu.op_pmreplstart);
8530 if (o->op_next && o->op_next->op_type == OP_NEXTSTATE
8531 && ckWARN(WARN_SYNTAX))
8533 if (o->op_next->op_sibling) {
8534 const OPCODE type = o->op_next->op_sibling->op_type;
8535 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
8536 const line_t oldline = CopLINE(PL_curcop);
8537 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
8538 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8539 "Statement unlikely to be reached");
8540 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8541 "\t(Maybe you meant system() when you said exec()?)\n");
8542 CopLINE_set(PL_curcop, oldline);
8553 const char *key = NULL;
8556 if (((BINOP*)o)->op_last->op_type != OP_CONST)
8559 /* Make the CONST have a shared SV */
8560 svp = cSVOPx_svp(((BINOP*)o)->op_last);
8561 if (!SvFAKE(sv = *svp) || !SvREADONLY(sv)) {
8562 key = SvPV_const(sv, keylen);
8563 lexname = newSVpvn_share(key,
8564 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
8570 if ((o->op_private & (OPpLVAL_INTRO)))
8573 rop = (UNOP*)((BINOP*)o)->op_first;
8574 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
8576 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
8577 if (!SvPAD_TYPED(lexname))
8579 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8580 if (!fields || !GvHV(*fields))
8582 key = SvPV_const(*svp, keylen);
8583 if (!hv_fetch(GvHV(*fields), key,
8584 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8586 Perl_croak(aTHX_ "No such class field \"%s\" "
8587 "in variable %s of type %s",
8588 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
8601 SVOP *first_key_op, *key_op;
8603 if ((o->op_private & (OPpLVAL_INTRO))
8604 /* I bet there's always a pushmark... */
8605 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
8606 /* hmmm, no optimization if list contains only one key. */
8608 rop = (UNOP*)((LISTOP*)o)->op_last;
8609 if (rop->op_type != OP_RV2HV)
8611 if (rop->op_first->op_type == OP_PADSV)
8612 /* @$hash{qw(keys here)} */
8613 rop = (UNOP*)rop->op_first;
8615 /* @{$hash}{qw(keys here)} */
8616 if (rop->op_first->op_type == OP_SCOPE
8617 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
8619 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
8625 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
8626 if (!SvPAD_TYPED(lexname))
8628 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8629 if (!fields || !GvHV(*fields))
8631 /* Again guessing that the pushmark can be jumped over.... */
8632 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
8633 ->op_first->op_sibling;
8634 for (key_op = first_key_op; key_op;
8635 key_op = (SVOP*)key_op->op_sibling) {
8636 if (key_op->op_type != OP_CONST)
8638 svp = cSVOPx_svp(key_op);
8639 key = SvPV_const(*svp, keylen);
8640 if (!hv_fetch(GvHV(*fields), key,
8641 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8643 Perl_croak(aTHX_ "No such class field \"%s\" "
8644 "in variable %s of type %s",
8645 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
8652 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
8656 /* check that RHS of sort is a single plain array */
8657 OP *oright = cUNOPo->op_first;
8658 if (!oright || oright->op_type != OP_PUSHMARK)
8661 /* reverse sort ... can be optimised. */
8662 if (!cUNOPo->op_sibling) {
8663 /* Nothing follows us on the list. */
8664 OP * const reverse = o->op_next;
8666 if (reverse->op_type == OP_REVERSE &&
8667 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
8668 OP * const pushmark = cUNOPx(reverse)->op_first;
8669 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
8670 && (cUNOPx(pushmark)->op_sibling == o)) {
8671 /* reverse -> pushmark -> sort */
8672 o->op_private |= OPpSORT_REVERSE;
8674 pushmark->op_next = oright->op_next;
8680 /* make @a = sort @a act in-place */
8682 oright = cUNOPx(oright)->op_sibling;
8685 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
8686 oright = cUNOPx(oright)->op_sibling;
8690 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
8691 || oright->op_next != o
8692 || (oright->op_private & OPpLVAL_INTRO)
8696 /* o2 follows the chain of op_nexts through the LHS of the
8697 * assign (if any) to the aassign op itself */
8699 if (!o2 || o2->op_type != OP_NULL)
8702 if (!o2 || o2->op_type != OP_PUSHMARK)
8705 if (o2 && o2->op_type == OP_GV)
8708 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
8709 || (o2->op_private & OPpLVAL_INTRO)
8714 if (!o2 || o2->op_type != OP_NULL)
8717 if (!o2 || o2->op_type != OP_AASSIGN
8718 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
8721 /* check that the sort is the first arg on RHS of assign */
8723 o2 = cUNOPx(o2)->op_first;
8724 if (!o2 || o2->op_type != OP_NULL)
8726 o2 = cUNOPx(o2)->op_first;
8727 if (!o2 || o2->op_type != OP_PUSHMARK)
8729 if (o2->op_sibling != o)
8732 /* check the array is the same on both sides */
8733 if (oleft->op_type == OP_RV2AV) {
8734 if (oright->op_type != OP_RV2AV
8735 || !cUNOPx(oright)->op_first
8736 || cUNOPx(oright)->op_first->op_type != OP_GV
8737 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
8738 cGVOPx_gv(cUNOPx(oright)->op_first)
8742 else if (oright->op_type != OP_PADAV
8743 || oright->op_targ != oleft->op_targ
8747 /* transfer MODishness etc from LHS arg to RHS arg */
8748 oright->op_flags = oleft->op_flags;
8749 o->op_private |= OPpSORT_INPLACE;
8751 /* excise push->gv->rv2av->null->aassign */
8752 o2 = o->op_next->op_next;
8753 op_null(o2); /* PUSHMARK */
8755 if (o2->op_type == OP_GV) {
8756 op_null(o2); /* GV */
8759 op_null(o2); /* RV2AV or PADAV */
8760 o2 = o2->op_next->op_next;
8761 op_null(o2); /* AASSIGN */
8763 o->op_next = o2->op_next;
8769 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
8771 LISTOP *enter, *exlist;
8773 enter = (LISTOP *) o->op_next;
8776 if (enter->op_type == OP_NULL) {
8777 enter = (LISTOP *) enter->op_next;
8781 /* for $a (...) will have OP_GV then OP_RV2GV here.
8782 for (...) just has an OP_GV. */
8783 if (enter->op_type == OP_GV) {
8784 gvop = (OP *) enter;
8785 enter = (LISTOP *) enter->op_next;
8788 if (enter->op_type == OP_RV2GV) {
8789 enter = (LISTOP *) enter->op_next;
8795 if (enter->op_type != OP_ENTERITER)
8798 iter = enter->op_next;
8799 if (!iter || iter->op_type != OP_ITER)
8802 expushmark = enter->op_first;
8803 if (!expushmark || expushmark->op_type != OP_NULL
8804 || expushmark->op_targ != OP_PUSHMARK)
8807 exlist = (LISTOP *) expushmark->op_sibling;
8808 if (!exlist || exlist->op_type != OP_NULL
8809 || exlist->op_targ != OP_LIST)
8812 if (exlist->op_last != o) {
8813 /* Mmm. Was expecting to point back to this op. */
8816 theirmark = exlist->op_first;
8817 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
8820 if (theirmark->op_sibling != o) {
8821 /* There's something between the mark and the reverse, eg
8822 for (1, reverse (...))
8827 ourmark = ((LISTOP *)o)->op_first;
8828 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
8831 ourlast = ((LISTOP *)o)->op_last;
8832 if (!ourlast || ourlast->op_next != o)
8835 rv2av = ourmark->op_sibling;
8836 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
8837 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
8838 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
8839 /* We're just reversing a single array. */
8840 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
8841 enter->op_flags |= OPf_STACKED;
8844 /* We don't have control over who points to theirmark, so sacrifice
8846 theirmark->op_next = ourmark->op_next;
8847 theirmark->op_flags = ourmark->op_flags;
8848 ourlast->op_next = gvop ? gvop : (OP *) enter;
8851 enter->op_private |= OPpITER_REVERSED;
8852 iter->op_private |= OPpITER_REVERSED;
8859 UNOP *refgen, *rv2cv;
8862 if ((o->op_flags & OPf_WANT) != OPf_WANT_VOID)
8865 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
8868 rv2gv = ((BINOP *)o)->op_last;
8869 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
8872 refgen = (UNOP *)((BINOP *)o)->op_first;
8874 if (!refgen || refgen->op_type != OP_REFGEN)
8877 exlist = (LISTOP *)refgen->op_first;
8878 if (!exlist || exlist->op_type != OP_NULL
8879 || exlist->op_targ != OP_LIST)
8882 if (exlist->op_first->op_type != OP_PUSHMARK)
8885 rv2cv = (UNOP*)exlist->op_last;
8887 if (rv2cv->op_type != OP_RV2CV)
8890 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
8891 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
8892 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
8894 o->op_private |= OPpASSIGN_CV_TO_GV;
8895 rv2gv->op_private |= OPpDONT_INIT_GV;
8896 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
8904 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
8905 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
8915 Perl_custom_op_name(pTHX_ const OP* o)
8918 const IV index = PTR2IV(o->op_ppaddr);
8922 PERL_ARGS_ASSERT_CUSTOM_OP_NAME;
8924 if (!PL_custom_op_names) /* This probably shouldn't happen */
8925 return (char *)PL_op_name[OP_CUSTOM];
8927 keysv = sv_2mortal(newSViv(index));
8929 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
8931 return (char *)PL_op_name[OP_CUSTOM]; /* Don't know who you are */
8933 return SvPV_nolen(HeVAL(he));
8937 Perl_custom_op_desc(pTHX_ const OP* o)
8940 const IV index = PTR2IV(o->op_ppaddr);
8944 PERL_ARGS_ASSERT_CUSTOM_OP_DESC;
8946 if (!PL_custom_op_descs)
8947 return (char *)PL_op_desc[OP_CUSTOM];
8949 keysv = sv_2mortal(newSViv(index));
8951 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
8953 return (char *)PL_op_desc[OP_CUSTOM];
8955 return SvPV_nolen(HeVAL(he));
8960 /* Efficient sub that returns a constant scalar value. */
8962 const_sv_xsub(pTHX_ CV* cv)
8966 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
8970 /* diag_listed_as: SKIPME */
8971 Perl_croak(aTHX_ "usage: %s::%s()",
8972 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
8985 * c-indentation-style: bsd
8987 * indent-tabs-mode: t
8990 * ex: set ts=8 sts=4 sw=4 noet: