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);
3348 SvREADONLY_on(swash);
3350 cSVOPo->op_sv = swash;
3352 SvREFCNT_dec(listsv);
3353 SvREFCNT_dec(transv);
3355 if (!del && havefinal && rlen)
3356 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
3357 newSVuv((UV)final), 0);
3360 o->op_private |= OPpTRANS_GROWS;
3366 op_getmad(expr,o,'e');
3367 op_getmad(repl,o,'r');
3375 tbl = (short*)cPVOPo->op_pv;
3377 Zero(tbl, 256, short);
3378 for (i = 0; i < (I32)tlen; i++)
3380 for (i = 0, j = 0; i < 256; i++) {
3382 if (j >= (I32)rlen) {
3391 if (i < 128 && r[j] >= 128)
3401 o->op_private |= OPpTRANS_IDENTICAL;
3403 else if (j >= (I32)rlen)
3408 PerlMemShared_realloc(tbl,
3409 (0x101+rlen-j) * sizeof(short));
3410 cPVOPo->op_pv = (char*)tbl;
3412 tbl[0x100] = (short)(rlen - j);
3413 for (i=0; i < (I32)rlen - j; i++)
3414 tbl[0x101+i] = r[j+i];
3418 if (!rlen && !del) {
3421 o->op_private |= OPpTRANS_IDENTICAL;
3423 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
3424 o->op_private |= OPpTRANS_IDENTICAL;
3426 for (i = 0; i < 256; i++)
3428 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
3429 if (j >= (I32)rlen) {
3431 if (tbl[t[i]] == -1)
3437 if (tbl[t[i]] == -1) {
3438 if (t[i] < 128 && r[j] >= 128)
3445 if(ckWARN(WARN_MISC)) {
3446 if(del && rlen == tlen) {
3447 Perl_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
3448 } else if(rlen > tlen) {
3449 Perl_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
3454 o->op_private |= OPpTRANS_GROWS;
3456 op_getmad(expr,o,'e');
3457 op_getmad(repl,o,'r');
3467 Perl_newPMOP(pTHX_ I32 type, I32 flags)
3472 NewOp(1101, pmop, 1, PMOP);
3473 pmop->op_type = (OPCODE)type;
3474 pmop->op_ppaddr = PL_ppaddr[type];
3475 pmop->op_flags = (U8)flags;
3476 pmop->op_private = (U8)(0 | (flags >> 8));
3478 if (PL_hints & HINT_RE_TAINT)
3479 pmop->op_pmflags |= PMf_RETAINT;
3480 if (PL_hints & HINT_LOCALE)
3481 pmop->op_pmflags |= PMf_LOCALE;
3485 assert(SvPOK(PL_regex_pad[0]));
3486 if (SvCUR(PL_regex_pad[0])) {
3487 /* Pop off the "packed" IV from the end. */
3488 SV *const repointer_list = PL_regex_pad[0];
3489 const char *p = SvEND(repointer_list) - sizeof(IV);
3490 const IV offset = *((IV*)p);
3492 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
3494 SvEND_set(repointer_list, p);
3496 pmop->op_pmoffset = offset;
3497 /* This slot should be free, so assert this: */
3498 assert(PL_regex_pad[offset] == &PL_sv_undef);
3500 SV * const repointer = &PL_sv_undef;
3501 av_push(PL_regex_padav, repointer);
3502 pmop->op_pmoffset = av_len(PL_regex_padav);
3503 PL_regex_pad = AvARRAY(PL_regex_padav);
3507 return CHECKOP(type, pmop);
3510 /* Given some sort of match op o, and an expression expr containing a
3511 * pattern, either compile expr into a regex and attach it to o (if it's
3512 * constant), or convert expr into a runtime regcomp op sequence (if it's
3515 * isreg indicates that the pattern is part of a regex construct, eg
3516 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
3517 * split "pattern", which aren't. In the former case, expr will be a list
3518 * if the pattern contains more than one term (eg /a$b/) or if it contains
3519 * a replacement, ie s/// or tr///.
3523 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
3528 I32 repl_has_vars = 0;
3532 PERL_ARGS_ASSERT_PMRUNTIME;
3534 if (o->op_type == OP_SUBST || o->op_type == OP_TRANS) {
3535 /* last element in list is the replacement; pop it */
3537 repl = cLISTOPx(expr)->op_last;
3538 kid = cLISTOPx(expr)->op_first;
3539 while (kid->op_sibling != repl)
3540 kid = kid->op_sibling;
3541 kid->op_sibling = NULL;
3542 cLISTOPx(expr)->op_last = kid;
3545 if (isreg && expr->op_type == OP_LIST &&
3546 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
3548 /* convert single element list to element */
3549 OP* const oe = expr;
3550 expr = cLISTOPx(oe)->op_first->op_sibling;
3551 cLISTOPx(oe)->op_first->op_sibling = NULL;
3552 cLISTOPx(oe)->op_last = NULL;
3556 if (o->op_type == OP_TRANS) {
3557 return pmtrans(o, expr, repl);
3560 reglist = isreg && expr->op_type == OP_LIST;
3564 PL_hints |= HINT_BLOCK_SCOPE;
3567 if (expr->op_type == OP_CONST) {
3568 SV *pat = ((SVOP*)expr)->op_sv;
3569 U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME;
3571 if (o->op_flags & OPf_SPECIAL)
3572 pm_flags |= RXf_SPLIT;
3575 assert (SvUTF8(pat));
3576 } else if (SvUTF8(pat)) {
3577 /* Not doing UTF-8, despite what the SV says. Is this only if we're
3578 trapped in use 'bytes'? */
3579 /* Make a copy of the octet sequence, but without the flag on, as
3580 the compiler now honours the SvUTF8 flag on pat. */
3582 const char *const p = SvPV(pat, len);
3583 pat = newSVpvn_flags(p, len, SVs_TEMP);
3586 PM_SETRE(pm, CALLREGCOMP(pat, pm_flags));
3589 op_getmad(expr,(OP*)pm,'e');
3595 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
3596 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
3598 : OP_REGCMAYBE),0,expr);
3600 NewOp(1101, rcop, 1, LOGOP);
3601 rcop->op_type = OP_REGCOMP;
3602 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
3603 rcop->op_first = scalar(expr);
3604 rcop->op_flags |= OPf_KIDS
3605 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
3606 | (reglist ? OPf_STACKED : 0);
3607 rcop->op_private = 1;
3610 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
3612 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
3615 /* establish postfix order */
3616 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
3618 rcop->op_next = expr;
3619 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
3622 rcop->op_next = LINKLIST(expr);
3623 expr->op_next = (OP*)rcop;
3626 prepend_elem(o->op_type, scalar((OP*)rcop), o);
3631 if (pm->op_pmflags & PMf_EVAL) {
3633 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
3634 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
3636 else if (repl->op_type == OP_CONST)
3640 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
3641 if (curop->op_type == OP_SCOPE
3642 || curop->op_type == OP_LEAVE
3643 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
3644 if (curop->op_type == OP_GV) {
3645 GV * const gv = cGVOPx_gv(curop);
3647 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
3650 else if (curop->op_type == OP_RV2CV)
3652 else if (curop->op_type == OP_RV2SV ||
3653 curop->op_type == OP_RV2AV ||
3654 curop->op_type == OP_RV2HV ||
3655 curop->op_type == OP_RV2GV) {
3656 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3659 else if (curop->op_type == OP_PADSV ||
3660 curop->op_type == OP_PADAV ||
3661 curop->op_type == OP_PADHV ||
3662 curop->op_type == OP_PADANY)
3666 else if (curop->op_type == OP_PUSHRE)
3667 NOOP; /* Okay here, dangerous in newASSIGNOP */
3677 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
3679 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3680 prepend_elem(o->op_type, scalar(repl), o);
3683 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
3684 pm->op_pmflags |= PMf_MAYBE_CONST;
3686 NewOp(1101, rcop, 1, LOGOP);
3687 rcop->op_type = OP_SUBSTCONT;
3688 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3689 rcop->op_first = scalar(repl);
3690 rcop->op_flags |= OPf_KIDS;
3691 rcop->op_private = 1;
3694 /* establish postfix order */
3695 rcop->op_next = LINKLIST(repl);
3696 repl->op_next = (OP*)rcop;
3698 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
3699 assert(!(pm->op_pmflags & PMf_ONCE));
3700 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
3709 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3714 PERL_ARGS_ASSERT_NEWSVOP;
3716 NewOp(1101, svop, 1, SVOP);
3717 svop->op_type = (OPCODE)type;
3718 svop->op_ppaddr = PL_ppaddr[type];
3720 svop->op_next = (OP*)svop;
3721 svop->op_flags = (U8)flags;
3722 if (PL_opargs[type] & OA_RETSCALAR)
3724 if (PL_opargs[type] & OA_TARGET)
3725 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3726 return CHECKOP(type, svop);
3731 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3736 PERL_ARGS_ASSERT_NEWPADOP;
3738 NewOp(1101, padop, 1, PADOP);
3739 padop->op_type = (OPCODE)type;
3740 padop->op_ppaddr = PL_ppaddr[type];
3741 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3742 SvREFCNT_dec(PAD_SVl(padop->op_padix));
3743 PAD_SETSV(padop->op_padix, sv);
3746 padop->op_next = (OP*)padop;
3747 padop->op_flags = (U8)flags;
3748 if (PL_opargs[type] & OA_RETSCALAR)
3750 if (PL_opargs[type] & OA_TARGET)
3751 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3752 return CHECKOP(type, padop);
3757 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3761 PERL_ARGS_ASSERT_NEWGVOP;
3765 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3767 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3772 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3776 NewOp(1101, pvop, 1, PVOP);
3777 pvop->op_type = (OPCODE)type;
3778 pvop->op_ppaddr = PL_ppaddr[type];
3780 pvop->op_next = (OP*)pvop;
3781 pvop->op_flags = (U8)flags;
3782 if (PL_opargs[type] & OA_RETSCALAR)
3784 if (PL_opargs[type] & OA_TARGET)
3785 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3786 return CHECKOP(type, pvop);
3794 Perl_package(pTHX_ OP *o)
3797 SV *const sv = cSVOPo->op_sv;
3802 PERL_ARGS_ASSERT_PACKAGE;
3804 save_hptr(&PL_curstash);
3805 save_item(PL_curstname);
3807 PL_curstash = gv_stashsv(sv, GV_ADD);
3809 sv_setsv(PL_curstname, sv);
3811 PL_hints |= HINT_BLOCK_SCOPE;
3812 PL_parser->copline = NOLINE;
3813 PL_parser->expect = XSTATE;
3818 if (!PL_madskills) {
3823 pegop = newOP(OP_NULL,0);
3824 op_getmad(o,pegop,'P');
3834 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
3841 OP *pegop = newOP(OP_NULL,0);
3844 PERL_ARGS_ASSERT_UTILIZE;
3846 if (idop->op_type != OP_CONST)
3847 Perl_croak(aTHX_ "Module name must be constant");
3850 op_getmad(idop,pegop,'U');
3855 SV * const vesv = ((SVOP*)version)->op_sv;
3858 op_getmad(version,pegop,'V');
3859 if (!arg && !SvNIOKp(vesv)) {
3866 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3867 Perl_croak(aTHX_ "Version number must be a constant number");
3869 /* Make copy of idop so we don't free it twice */
3870 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3872 /* Fake up a method call to VERSION */
3873 meth = newSVpvs_share("VERSION");
3874 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3875 append_elem(OP_LIST,
3876 prepend_elem(OP_LIST, pack, list(version)),
3877 newSVOP(OP_METHOD_NAMED, 0, meth)));
3881 /* Fake up an import/unimport */
3882 if (arg && arg->op_type == OP_STUB) {
3884 op_getmad(arg,pegop,'S');
3885 imop = arg; /* no import on explicit () */
3887 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
3888 imop = NULL; /* use 5.0; */
3890 idop->op_private |= OPpCONST_NOVER;
3896 op_getmad(arg,pegop,'A');
3898 /* Make copy of idop so we don't free it twice */
3899 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3901 /* Fake up a method call to import/unimport */
3903 ? newSVpvs_share("import") : newSVpvs_share("unimport");
3904 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3905 append_elem(OP_LIST,
3906 prepend_elem(OP_LIST, pack, list(arg)),
3907 newSVOP(OP_METHOD_NAMED, 0, meth)));
3910 /* Fake up the BEGIN {}, which does its thing immediately. */
3912 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
3915 append_elem(OP_LINESEQ,
3916 append_elem(OP_LINESEQ,
3917 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
3918 newSTATEOP(0, NULL, veop)),
3919 newSTATEOP(0, NULL, imop) ));
3921 /* The "did you use incorrect case?" warning used to be here.
3922 * The problem is that on case-insensitive filesystems one
3923 * might get false positives for "use" (and "require"):
3924 * "use Strict" or "require CARP" will work. This causes
3925 * portability problems for the script: in case-strict
3926 * filesystems the script will stop working.
3928 * The "incorrect case" warning checked whether "use Foo"
3929 * imported "Foo" to your namespace, but that is wrong, too:
3930 * there is no requirement nor promise in the language that
3931 * a Foo.pm should or would contain anything in package "Foo".
3933 * There is very little Configure-wise that can be done, either:
3934 * the case-sensitivity of the build filesystem of Perl does not
3935 * help in guessing the case-sensitivity of the runtime environment.
3938 PL_hints |= HINT_BLOCK_SCOPE;
3939 PL_parser->copline = NOLINE;
3940 PL_parser->expect = XSTATE;
3941 PL_cop_seqmax++; /* Purely for B::*'s benefit */
3944 if (!PL_madskills) {
3945 /* FIXME - don't allocate pegop if !PL_madskills */
3954 =head1 Embedding Functions
3956 =for apidoc load_module
3958 Loads the module whose name is pointed to by the string part of name.
3959 Note that the actual module name, not its filename, should be given.
3960 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
3961 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
3962 (or 0 for no flags). ver, if specified, provides version semantics
3963 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
3964 arguments can be used to specify arguments to the module's import()
3965 method, similar to C<use Foo::Bar VERSION LIST>.
3970 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
3974 PERL_ARGS_ASSERT_LOAD_MODULE;
3976 va_start(args, ver);
3977 vload_module(flags, name, ver, &args);
3981 #ifdef PERL_IMPLICIT_CONTEXT
3983 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
3987 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
3988 va_start(args, ver);
3989 vload_module(flags, name, ver, &args);
3995 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
3999 OP * const modname = newSVOP(OP_CONST, 0, name);
4001 PERL_ARGS_ASSERT_VLOAD_MODULE;
4003 modname->op_private |= OPpCONST_BARE;
4005 veop = newSVOP(OP_CONST, 0, ver);
4009 if (flags & PERL_LOADMOD_NOIMPORT) {
4010 imop = sawparens(newNULLLIST());
4012 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
4013 imop = va_arg(*args, OP*);
4018 sv = va_arg(*args, SV*);
4020 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
4021 sv = va_arg(*args, SV*);
4025 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
4026 * that it has a PL_parser to play with while doing that, and also
4027 * that it doesn't mess with any existing parser, by creating a tmp
4028 * new parser with lex_start(). This won't actually be used for much,
4029 * since pp_require() will create another parser for the real work. */
4032 SAVEVPTR(PL_curcop);
4033 lex_start(NULL, NULL, FALSE);
4034 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
4035 veop, modname, imop);
4040 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
4046 PERL_ARGS_ASSERT_DOFILE;
4048 if (!force_builtin) {
4049 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
4050 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
4051 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
4052 gv = gvp ? *gvp : NULL;
4056 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
4057 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
4058 append_elem(OP_LIST, term,
4059 scalar(newUNOP(OP_RV2CV, 0,
4060 newGVOP(OP_GV, 0, gv))))));
4063 doop = newUNOP(OP_DOFILE, 0, scalar(term));
4069 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
4071 return newBINOP(OP_LSLICE, flags,
4072 list(force_list(subscript)),
4073 list(force_list(listval)) );
4077 S_is_list_assignment(pTHX_ register const OP *o)
4085 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
4086 o = cUNOPo->op_first;
4088 flags = o->op_flags;
4090 if (type == OP_COND_EXPR) {
4091 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
4092 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
4097 yyerror("Assignment to both a list and a scalar");
4101 if (type == OP_LIST &&
4102 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
4103 o->op_private & OPpLVAL_INTRO)
4106 if (type == OP_LIST || flags & OPf_PARENS ||
4107 type == OP_RV2AV || type == OP_RV2HV ||
4108 type == OP_ASLICE || type == OP_HSLICE)
4111 if (type == OP_PADAV || type == OP_PADHV)
4114 if (type == OP_RV2SV)
4121 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
4127 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
4128 return newLOGOP(optype, 0,
4129 mod(scalar(left), optype),
4130 newUNOP(OP_SASSIGN, 0, scalar(right)));
4133 return newBINOP(optype, OPf_STACKED,
4134 mod(scalar(left), optype), scalar(right));
4138 if (is_list_assignment(left)) {
4139 static const char no_list_state[] = "Initialization of state variables"
4140 " in list context currently forbidden";
4142 bool maybe_common_vars = TRUE;
4145 /* Grandfathering $[ assignment here. Bletch.*/
4146 /* Only simple assignments like C<< ($[) = 1 >> are allowed */
4147 PL_eval_start = (left->op_type == OP_CONST) ? right : NULL;
4148 left = mod(left, OP_AASSIGN);
4151 else if (left->op_type == OP_CONST) {
4153 /* Result of assignment is always 1 (or we'd be dead already) */
4154 return newSVOP(OP_CONST, 0, newSViv(1));
4156 curop = list(force_list(left));
4157 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
4158 o->op_private = (U8)(0 | (flags >> 8));
4160 if ((left->op_type == OP_LIST
4161 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
4163 OP* lop = ((LISTOP*)left)->op_first;
4164 maybe_common_vars = FALSE;
4166 if (lop->op_type == OP_PADSV ||
4167 lop->op_type == OP_PADAV ||
4168 lop->op_type == OP_PADHV ||
4169 lop->op_type == OP_PADANY) {
4170 if (!(lop->op_private & OPpLVAL_INTRO))
4171 maybe_common_vars = TRUE;
4173 if (lop->op_private & OPpPAD_STATE) {
4174 if (left->op_private & OPpLVAL_INTRO) {
4175 /* Each variable in state($a, $b, $c) = ... */
4178 /* Each state variable in
4179 (state $a, my $b, our $c, $d, undef) = ... */
4181 yyerror(no_list_state);
4183 /* Each my variable in
4184 (state $a, my $b, our $c, $d, undef) = ... */
4186 } else if (lop->op_type == OP_UNDEF ||
4187 lop->op_type == OP_PUSHMARK) {
4188 /* undef may be interesting in
4189 (state $a, undef, state $c) */
4191 /* Other ops in the list. */
4192 maybe_common_vars = TRUE;
4194 lop = lop->op_sibling;
4197 else if ((left->op_private & OPpLVAL_INTRO)
4198 && ( left->op_type == OP_PADSV
4199 || left->op_type == OP_PADAV
4200 || left->op_type == OP_PADHV
4201 || left->op_type == OP_PADANY))
4203 maybe_common_vars = FALSE;
4204 if (left->op_private & OPpPAD_STATE) {
4205 /* All single variable list context state assignments, hence
4215 yyerror(no_list_state);
4219 /* PL_generation sorcery:
4220 * an assignment like ($a,$b) = ($c,$d) is easier than
4221 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
4222 * To detect whether there are common vars, the global var
4223 * PL_generation is incremented for each assign op we compile.
4224 * Then, while compiling the assign op, we run through all the
4225 * variables on both sides of the assignment, setting a spare slot
4226 * in each of them to PL_generation. If any of them already have
4227 * that value, we know we've got commonality. We could use a
4228 * single bit marker, but then we'd have to make 2 passes, first
4229 * to clear the flag, then to test and set it. To find somewhere
4230 * to store these values, evil chicanery is done with SvUVX().
4233 if (maybe_common_vars) {
4236 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
4237 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
4238 if (curop->op_type == OP_GV) {
4239 GV *gv = cGVOPx_gv(curop);
4241 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4243 GvASSIGN_GENERATION_set(gv, PL_generation);
4245 else if (curop->op_type == OP_PADSV ||
4246 curop->op_type == OP_PADAV ||
4247 curop->op_type == OP_PADHV ||
4248 curop->op_type == OP_PADANY)
4250 if (PAD_COMPNAME_GEN(curop->op_targ)
4251 == (STRLEN)PL_generation)
4253 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
4256 else if (curop->op_type == OP_RV2CV)
4258 else if (curop->op_type == OP_RV2SV ||
4259 curop->op_type == OP_RV2AV ||
4260 curop->op_type == OP_RV2HV ||
4261 curop->op_type == OP_RV2GV) {
4262 if (lastop->op_type != OP_GV) /* funny deref? */
4265 else if (curop->op_type == OP_PUSHRE) {
4267 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
4268 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
4270 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4272 GvASSIGN_GENERATION_set(gv, PL_generation);
4276 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
4279 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4281 GvASSIGN_GENERATION_set(gv, PL_generation);
4291 o->op_private |= OPpASSIGN_COMMON;
4294 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
4295 OP* tmpop = ((LISTOP*)right)->op_first;
4296 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
4297 PMOP * const pm = (PMOP*)tmpop;
4298 if (left->op_type == OP_RV2AV &&
4299 !(left->op_private & OPpLVAL_INTRO) &&
4300 !(o->op_private & OPpASSIGN_COMMON) )
4302 tmpop = ((UNOP*)left)->op_first;
4303 if (tmpop->op_type == OP_GV
4305 && !pm->op_pmreplrootu.op_pmtargetoff
4307 && !pm->op_pmreplrootu.op_pmtargetgv
4311 pm->op_pmreplrootu.op_pmtargetoff
4312 = cPADOPx(tmpop)->op_padix;
4313 cPADOPx(tmpop)->op_padix = 0; /* steal it */
4315 pm->op_pmreplrootu.op_pmtargetgv
4316 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
4317 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
4319 pm->op_pmflags |= PMf_ONCE;
4320 tmpop = cUNOPo->op_first; /* to list (nulled) */
4321 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
4322 tmpop->op_sibling = NULL; /* don't free split */
4323 right->op_next = tmpop->op_next; /* fix starting loc */
4324 op_free(o); /* blow off assign */
4325 right->op_flags &= ~OPf_WANT;
4326 /* "I don't know and I don't care." */
4331 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
4332 ((LISTOP*)right)->op_last->op_type == OP_CONST)
4334 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
4335 if (SvIOK(sv) && SvIVX(sv) == 0)
4336 sv_setiv(sv, PL_modcount+1);
4344 right = newOP(OP_UNDEF, 0);
4345 if (right->op_type == OP_READLINE) {
4346 right->op_flags |= OPf_STACKED;
4347 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
4350 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
4351 o = newBINOP(OP_SASSIGN, flags,
4352 scalar(right), mod(scalar(left), OP_SASSIGN) );
4356 if (!PL_madskills) { /* assignment to $[ is ignored when making a mad dump */
4357 deprecate("assignment to $[");
4359 o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling)));
4360 o->op_private |= OPpCONST_ARYBASE;
4368 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
4371 const U32 seq = intro_my();
4374 NewOp(1101, cop, 1, COP);
4375 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
4376 cop->op_type = OP_DBSTATE;
4377 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
4380 cop->op_type = OP_NEXTSTATE;
4381 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
4383 cop->op_flags = (U8)flags;
4384 CopHINTS_set(cop, PL_hints);
4386 cop->op_private |= NATIVE_HINTS;
4388 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
4389 cop->op_next = (OP*)cop;
4392 /* CopARYBASE is now "virtual", in that it's stored as a flag bit in
4393 CopHINTS and a possible value in cop_hints_hash, so no need to copy it.
4395 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
4396 cop->cop_hints_hash = PL_curcop->cop_hints_hash;
4397 if (cop->cop_hints_hash) {
4399 cop->cop_hints_hash->refcounted_he_refcnt++;
4400 HINTS_REFCNT_UNLOCK;
4404 = Perl_store_cop_label(aTHX_ cop->cop_hints_hash, label);
4406 PL_hints |= HINT_BLOCK_SCOPE;
4407 /* It seems that we need to defer freeing this pointer, as other parts
4408 of the grammar end up wanting to copy it after this op has been
4413 if (PL_parser && PL_parser->copline == NOLINE)
4414 CopLINE_set(cop, CopLINE(PL_curcop));
4416 CopLINE_set(cop, PL_parser->copline);
4418 PL_parser->copline = NOLINE;
4421 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
4423 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
4425 CopSTASH_set(cop, PL_curstash);
4427 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
4428 /* this line can have a breakpoint - store the cop in IV */
4429 AV *av = CopFILEAVx(PL_curcop);
4431 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
4432 if (svp && *svp != &PL_sv_undef ) {
4433 (void)SvIOK_on(*svp);
4434 SvIV_set(*svp, PTR2IV(cop));
4439 if (flags & OPf_SPECIAL)
4441 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
4446 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
4450 PERL_ARGS_ASSERT_NEWLOGOP;
4452 return new_logop(type, flags, &first, &other);
4456 S_search_const(pTHX_ OP *o)
4458 PERL_ARGS_ASSERT_SEARCH_CONST;
4460 switch (o->op_type) {
4464 if (o->op_flags & OPf_KIDS)
4465 return search_const(cUNOPo->op_first);
4472 if (!(o->op_flags & OPf_KIDS))
4474 kid = cLISTOPo->op_first;
4476 switch (kid->op_type) {
4480 kid = kid->op_sibling;
4483 if (kid != cLISTOPo->op_last)
4489 kid = cLISTOPo->op_last;
4491 return search_const(kid);
4499 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
4507 int prepend_not = 0;
4509 PERL_ARGS_ASSERT_NEW_LOGOP;
4514 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
4515 return newBINOP(type, flags, scalar(first), scalar(other));
4517 scalarboolean(first);
4518 /* optimize AND and OR ops that have NOTs as children */
4519 if (first->op_type == OP_NOT
4520 && (first->op_flags & OPf_KIDS)
4521 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
4522 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
4524 if (type == OP_AND || type == OP_OR) {
4530 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
4532 prepend_not = 1; /* prepend a NOT op later */
4536 /* search for a constant op that could let us fold the test */
4537 if ((cstop = search_const(first))) {
4538 if (cstop->op_private & OPpCONST_STRICT)
4539 no_bareword_allowed(cstop);
4540 else if ((cstop->op_private & OPpCONST_BARE) && ckWARN(WARN_BAREWORD))
4541 Perl_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
4542 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
4543 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
4544 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
4546 if (other->op_type == OP_CONST)
4547 other->op_private |= OPpCONST_SHORTCIRCUIT;
4549 OP *newop = newUNOP(OP_NULL, 0, other);
4550 op_getmad(first, newop, '1');
4551 newop->op_targ = type; /* set "was" field */
4558 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
4559 const OP *o2 = other;
4560 if ( ! (o2->op_type == OP_LIST
4561 && (( o2 = cUNOPx(o2)->op_first))
4562 && o2->op_type == OP_PUSHMARK
4563 && (( o2 = o2->op_sibling)) )
4566 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
4567 || o2->op_type == OP_PADHV)
4568 && o2->op_private & OPpLVAL_INTRO
4569 && !(o2->op_private & OPpPAD_STATE)
4570 && ckWARN(WARN_DEPRECATED))
4572 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
4573 "Deprecated use of my() in false conditional");
4577 if (first->op_type == OP_CONST)
4578 first->op_private |= OPpCONST_SHORTCIRCUIT;
4580 first = newUNOP(OP_NULL, 0, first);
4581 op_getmad(other, first, '2');
4582 first->op_targ = type; /* set "was" field */
4589 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
4590 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
4592 const OP * const k1 = ((UNOP*)first)->op_first;
4593 const OP * const k2 = k1->op_sibling;
4595 switch (first->op_type)
4598 if (k2 && k2->op_type == OP_READLINE
4599 && (k2->op_flags & OPf_STACKED)
4600 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4602 warnop = k2->op_type;
4607 if (k1->op_type == OP_READDIR
4608 || k1->op_type == OP_GLOB
4609 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4610 || k1->op_type == OP_EACH)
4612 warnop = ((k1->op_type == OP_NULL)
4613 ? (OPCODE)k1->op_targ : k1->op_type);
4618 const line_t oldline = CopLINE(PL_curcop);
4619 CopLINE_set(PL_curcop, PL_parser->copline);
4620 Perl_warner(aTHX_ packWARN(WARN_MISC),
4621 "Value of %s%s can be \"0\"; test with defined()",
4623 ((warnop == OP_READLINE || warnop == OP_GLOB)
4624 ? " construct" : "() operator"));
4625 CopLINE_set(PL_curcop, oldline);
4632 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
4633 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
4635 NewOp(1101, logop, 1, LOGOP);
4637 logop->op_type = (OPCODE)type;
4638 logop->op_ppaddr = PL_ppaddr[type];
4639 logop->op_first = first;
4640 logop->op_flags = (U8)(flags | OPf_KIDS);
4641 logop->op_other = LINKLIST(other);
4642 logop->op_private = (U8)(1 | (flags >> 8));
4644 /* establish postfix order */
4645 logop->op_next = LINKLIST(first);
4646 first->op_next = (OP*)logop;
4647 first->op_sibling = other;
4649 CHECKOP(type,logop);
4651 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
4658 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
4666 PERL_ARGS_ASSERT_NEWCONDOP;
4669 return newLOGOP(OP_AND, 0, first, trueop);
4671 return newLOGOP(OP_OR, 0, first, falseop);
4673 scalarboolean(first);
4674 if ((cstop = search_const(first))) {
4675 /* Left or right arm of the conditional? */
4676 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
4677 OP *live = left ? trueop : falseop;
4678 OP *const dead = left ? falseop : trueop;
4679 if (cstop->op_private & OPpCONST_BARE &&
4680 cstop->op_private & OPpCONST_STRICT) {
4681 no_bareword_allowed(cstop);
4684 /* This is all dead code when PERL_MAD is not defined. */
4685 live = newUNOP(OP_NULL, 0, live);
4686 op_getmad(first, live, 'C');
4687 op_getmad(dead, live, left ? 'e' : 't');
4694 NewOp(1101, logop, 1, LOGOP);
4695 logop->op_type = OP_COND_EXPR;
4696 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
4697 logop->op_first = first;
4698 logop->op_flags = (U8)(flags | OPf_KIDS);
4699 logop->op_private = (U8)(1 | (flags >> 8));
4700 logop->op_other = LINKLIST(trueop);
4701 logop->op_next = LINKLIST(falseop);
4703 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
4706 /* establish postfix order */
4707 start = LINKLIST(first);
4708 first->op_next = (OP*)logop;
4710 first->op_sibling = trueop;
4711 trueop->op_sibling = falseop;
4712 o = newUNOP(OP_NULL, 0, (OP*)logop);
4714 trueop->op_next = falseop->op_next = o;
4721 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
4730 PERL_ARGS_ASSERT_NEWRANGE;
4732 NewOp(1101, range, 1, LOGOP);
4734 range->op_type = OP_RANGE;
4735 range->op_ppaddr = PL_ppaddr[OP_RANGE];
4736 range->op_first = left;
4737 range->op_flags = OPf_KIDS;
4738 leftstart = LINKLIST(left);
4739 range->op_other = LINKLIST(right);
4740 range->op_private = (U8)(1 | (flags >> 8));
4742 left->op_sibling = right;
4744 range->op_next = (OP*)range;
4745 flip = newUNOP(OP_FLIP, flags, (OP*)range);
4746 flop = newUNOP(OP_FLOP, 0, flip);
4747 o = newUNOP(OP_NULL, 0, flop);
4749 range->op_next = leftstart;
4751 left->op_next = flip;
4752 right->op_next = flop;
4754 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4755 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
4756 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4757 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
4759 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4760 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4763 if (!flip->op_private || !flop->op_private)
4764 linklist(o); /* blow off optimizer unless constant */
4770 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
4775 const bool once = block && block->op_flags & OPf_SPECIAL &&
4776 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
4778 PERL_UNUSED_ARG(debuggable);
4781 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
4782 return block; /* do {} while 0 does once */
4783 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4784 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4785 expr = newUNOP(OP_DEFINED, 0,
4786 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4787 } else if (expr->op_flags & OPf_KIDS) {
4788 const OP * const k1 = ((UNOP*)expr)->op_first;
4789 const OP * const k2 = k1 ? k1->op_sibling : NULL;
4790 switch (expr->op_type) {
4792 if (k2 && k2->op_type == OP_READLINE
4793 && (k2->op_flags & OPf_STACKED)
4794 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4795 expr = newUNOP(OP_DEFINED, 0, expr);
4799 if (k1 && (k1->op_type == OP_READDIR
4800 || k1->op_type == OP_GLOB
4801 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4802 || k1->op_type == OP_EACH))
4803 expr = newUNOP(OP_DEFINED, 0, expr);
4809 /* if block is null, the next append_elem() would put UNSTACK, a scalar
4810 * op, in listop. This is wrong. [perl #27024] */
4812 block = newOP(OP_NULL, 0);
4813 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
4814 o = new_logop(OP_AND, 0, &expr, &listop);
4817 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
4819 if (once && o != listop)
4820 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
4823 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
4825 o->op_flags |= flags;
4827 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
4832 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32
4833 whileline, OP *expr, OP *block, OP *cont, I32 has_my)
4842 PERL_UNUSED_ARG(debuggable);
4845 if (expr->op_type == OP_READLINE || expr->op_type == OP_GLOB
4846 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4847 expr = newUNOP(OP_DEFINED, 0,
4848 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4849 } else if (expr->op_flags & OPf_KIDS) {
4850 const OP * const k1 = ((UNOP*)expr)->op_first;
4851 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
4852 switch (expr->op_type) {
4854 if (k2 && k2->op_type == OP_READLINE
4855 && (k2->op_flags & OPf_STACKED)
4856 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4857 expr = newUNOP(OP_DEFINED, 0, expr);
4861 if (k1 && (k1->op_type == OP_READDIR
4862 || k1->op_type == OP_GLOB
4863 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4864 || k1->op_type == OP_EACH))
4865 expr = newUNOP(OP_DEFINED, 0, expr);
4872 block = newOP(OP_NULL, 0);
4873 else if (cont || has_my) {
4874 block = scope(block);
4878 next = LINKLIST(cont);
4881 OP * const unstack = newOP(OP_UNSTACK, 0);
4884 cont = append_elem(OP_LINESEQ, cont, unstack);
4888 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
4890 redo = LINKLIST(listop);
4893 PL_parser->copline = (line_t)whileline;
4895 o = new_logop(OP_AND, 0, &expr, &listop);
4896 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
4897 op_free(expr); /* oops, it's a while (0) */
4899 return NULL; /* listop already freed by new_logop */
4902 ((LISTOP*)listop)->op_last->op_next =
4903 (o == listop ? redo : LINKLIST(o));
4909 NewOp(1101,loop,1,LOOP);
4910 loop->op_type = OP_ENTERLOOP;
4911 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
4912 loop->op_private = 0;
4913 loop->op_next = (OP*)loop;
4916 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
4918 loop->op_redoop = redo;
4919 loop->op_lastop = o;
4920 o->op_private |= loopflags;
4923 loop->op_nextop = next;
4925 loop->op_nextop = o;
4927 o->op_flags |= flags;
4928 o->op_private |= (flags >> 8);
4933 Perl_newFOROP(pTHX_ I32 flags, char *label, line_t forline, OP *sv, OP *expr, OP *block, OP *cont)
4938 PADOFFSET padoff = 0;
4943 PERL_ARGS_ASSERT_NEWFOROP;
4946 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
4947 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
4948 sv->op_type = OP_RV2GV;
4949 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
4951 /* The op_type check is needed to prevent a possible segfault
4952 * if the loop variable is undeclared and 'strict vars' is in
4953 * effect. This is illegal but is nonetheless parsed, so we
4954 * may reach this point with an OP_CONST where we're expecting
4957 if (cUNOPx(sv)->op_first->op_type == OP_GV
4958 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
4959 iterpflags |= OPpITER_DEF;
4961 else if (sv->op_type == OP_PADSV) { /* private variable */
4962 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
4963 padoff = sv->op_targ;
4973 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
4975 SV *const namesv = PAD_COMPNAME_SV(padoff);
4977 const char *const name = SvPV_const(namesv, len);
4979 if (len == 2 && name[0] == '$' && name[1] == '_')
4980 iterpflags |= OPpITER_DEF;
4984 const PADOFFSET offset = pad_findmy("$_");
4985 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
4986 sv = newGVOP(OP_GV, 0, PL_defgv);
4991 iterpflags |= OPpITER_DEF;
4993 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
4994 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
4995 iterflags |= OPf_STACKED;
4997 else if (expr->op_type == OP_NULL &&
4998 (expr->op_flags & OPf_KIDS) &&
4999 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
5001 /* Basically turn for($x..$y) into the same as for($x,$y), but we
5002 * set the STACKED flag to indicate that these values are to be
5003 * treated as min/max values by 'pp_iterinit'.
5005 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
5006 LOGOP* const range = (LOGOP*) flip->op_first;
5007 OP* const left = range->op_first;
5008 OP* const right = left->op_sibling;
5011 range->op_flags &= ~OPf_KIDS;
5012 range->op_first = NULL;
5014 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
5015 listop->op_first->op_next = range->op_next;
5016 left->op_next = range->op_other;
5017 right->op_next = (OP*)listop;
5018 listop->op_next = listop->op_first;
5021 op_getmad(expr,(OP*)listop,'O');
5025 expr = (OP*)(listop);
5027 iterflags |= OPf_STACKED;
5030 expr = mod(force_list(expr), OP_GREPSTART);
5033 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
5034 append_elem(OP_LIST, expr, scalar(sv))));
5035 assert(!loop->op_next);
5036 /* for my $x () sets OPpLVAL_INTRO;
5037 * for our $x () sets OPpOUR_INTRO */
5038 loop->op_private = (U8)iterpflags;
5039 #ifdef PL_OP_SLAB_ALLOC
5042 NewOp(1234,tmp,1,LOOP);
5043 Copy(loop,tmp,1,LISTOP);
5044 S_op_destroy(aTHX_ (OP*)loop);
5048 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
5050 loop->op_targ = padoff;
5051 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont, 0);
5053 op_getmad(madsv, (OP*)loop, 'v');
5054 PL_parser->copline = forline;
5055 return newSTATEOP(0, label, wop);
5059 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
5064 PERL_ARGS_ASSERT_NEWLOOPEX;
5066 if (type != OP_GOTO || label->op_type == OP_CONST) {
5067 /* "last()" means "last" */
5068 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
5069 o = newOP(type, OPf_SPECIAL);
5071 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
5072 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
5076 op_getmad(label,o,'L');
5082 /* Check whether it's going to be a goto &function */
5083 if (label->op_type == OP_ENTERSUB
5084 && !(label->op_flags & OPf_STACKED))
5085 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
5086 o = newUNOP(type, OPf_STACKED, label);
5088 PL_hints |= HINT_BLOCK_SCOPE;
5092 /* if the condition is a literal array or hash
5093 (or @{ ... } etc), make a reference to it.
5096 S_ref_array_or_hash(pTHX_ OP *cond)
5099 && (cond->op_type == OP_RV2AV
5100 || cond->op_type == OP_PADAV
5101 || cond->op_type == OP_RV2HV
5102 || cond->op_type == OP_PADHV))
5104 return newUNOP(OP_REFGEN,
5105 0, mod(cond, OP_REFGEN));
5111 /* These construct the optree fragments representing given()
5114 entergiven and enterwhen are LOGOPs; the op_other pointer
5115 points up to the associated leave op. We need this so we
5116 can put it in the context and make break/continue work.
5117 (Also, of course, pp_enterwhen will jump straight to
5118 op_other if the match fails.)
5122 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
5123 I32 enter_opcode, I32 leave_opcode,
5124 PADOFFSET entertarg)
5130 PERL_ARGS_ASSERT_NEWGIVWHENOP;
5132 NewOp(1101, enterop, 1, LOGOP);
5133 enterop->op_type = (Optype)enter_opcode;
5134 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
5135 enterop->op_flags = (U8) OPf_KIDS;
5136 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
5137 enterop->op_private = 0;
5139 o = newUNOP(leave_opcode, 0, (OP *) enterop);
5142 enterop->op_first = scalar(cond);
5143 cond->op_sibling = block;
5145 o->op_next = LINKLIST(cond);
5146 cond->op_next = (OP *) enterop;
5149 /* This is a default {} block */
5150 enterop->op_first = block;
5151 enterop->op_flags |= OPf_SPECIAL;
5153 o->op_next = (OP *) enterop;
5156 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
5157 entergiven and enterwhen both
5160 enterop->op_next = LINKLIST(block);
5161 block->op_next = enterop->op_other = o;
5166 /* Does this look like a boolean operation? For these purposes
5167 a boolean operation is:
5168 - a subroutine call [*]
5169 - a logical connective
5170 - a comparison operator
5171 - a filetest operator, with the exception of -s -M -A -C
5172 - defined(), exists() or eof()
5173 - /$re/ or $foo =~ /$re/
5175 [*] possibly surprising
5178 S_looks_like_bool(pTHX_ const OP *o)
5182 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
5184 switch(o->op_type) {
5187 return looks_like_bool(cLOGOPo->op_first);
5191 looks_like_bool(cLOGOPo->op_first)
5192 && looks_like_bool(cLOGOPo->op_first->op_sibling));
5196 o->op_flags & OPf_KIDS
5197 && looks_like_bool(cUNOPo->op_first));
5201 case OP_NOT: case OP_XOR:
5203 case OP_EQ: case OP_NE: case OP_LT:
5204 case OP_GT: case OP_LE: case OP_GE:
5206 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
5207 case OP_I_GT: case OP_I_LE: case OP_I_GE:
5209 case OP_SEQ: case OP_SNE: case OP_SLT:
5210 case OP_SGT: case OP_SLE: case OP_SGE:
5214 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
5215 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
5216 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
5217 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
5218 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
5219 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
5220 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
5221 case OP_FTTEXT: case OP_FTBINARY:
5223 case OP_DEFINED: case OP_EXISTS:
5224 case OP_MATCH: case OP_EOF:
5231 /* Detect comparisons that have been optimized away */
5232 if (cSVOPo->op_sv == &PL_sv_yes
5233 || cSVOPo->op_sv == &PL_sv_no)
5246 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
5249 PERL_ARGS_ASSERT_NEWGIVENOP;
5250 return newGIVWHENOP(
5251 ref_array_or_hash(cond),
5253 OP_ENTERGIVEN, OP_LEAVEGIVEN,
5257 /* If cond is null, this is a default {} block */
5259 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
5261 const bool cond_llb = (!cond || looks_like_bool(cond));
5264 PERL_ARGS_ASSERT_NEWWHENOP;
5269 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
5271 scalar(ref_array_or_hash(cond)));
5274 return newGIVWHENOP(
5276 append_elem(block->op_type, block, newOP(OP_BREAK, OPf_SPECIAL)),
5277 OP_ENTERWHEN, OP_LEAVEWHEN, 0);
5281 =for apidoc cv_undef
5283 Clear out all the active components of a CV. This can happen either
5284 by an explicit C<undef &foo>, or by the reference count going to zero.
5285 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
5286 children can still follow the full lexical scope chain.
5292 Perl_cv_undef(pTHX_ CV *cv)
5296 PERL_ARGS_ASSERT_CV_UNDEF;
5298 DEBUG_X(PerlIO_printf(Perl_debug_log,
5299 "CV undef: cv=0x%"UVxf" comppad=0x%"UVxf"\n",
5300 PTR2UV(cv), PTR2UV(PL_comppad))
5304 if (CvFILE(cv) && !CvISXSUB(cv)) {
5305 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
5306 Safefree(CvFILE(cv));
5311 if (!CvISXSUB(cv) && CvROOT(cv)) {
5312 if (SvTYPE(cv) == SVt_PVCV && CvDEPTH(cv))
5313 Perl_croak(aTHX_ "Can't undef active subroutine");
5316 PAD_SAVE_SETNULLPAD();
5318 op_free(CvROOT(cv));
5323 SvPOK_off(MUTABLE_SV(cv)); /* forget prototype */
5328 /* remove CvOUTSIDE unless this is an undef rather than a free */
5329 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
5330 if (!CvWEAKOUTSIDE(cv))
5331 SvREFCNT_dec(CvOUTSIDE(cv));
5332 CvOUTSIDE(cv) = NULL;
5335 SvREFCNT_dec(MUTABLE_SV(CvXSUBANY(cv).any_ptr));
5338 if (CvISXSUB(cv) && CvXSUB(cv)) {
5341 /* delete all flags except WEAKOUTSIDE */
5342 CvFLAGS(cv) &= CVf_WEAKOUTSIDE;
5346 Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p,
5349 PERL_ARGS_ASSERT_CV_CKPROTO_LEN;
5351 /* Can't just use a strcmp on the prototype, as CONSTSUBs "cheat" by
5352 relying on SvCUR, and doubling up the buffer to hold CvFILE(). */
5353 if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */
5354 || (p && (len != SvCUR(cv) /* Not the same length. */
5355 || memNE(p, SvPVX_const(cv), len))))
5356 && ckWARN_d(WARN_PROTOTYPE)) {
5357 SV* const msg = sv_newmortal();
5361 gv_efullname3(name = sv_newmortal(), gv, NULL);
5362 sv_setpvs(msg, "Prototype mismatch:");
5364 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
5366 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv));
5368 sv_catpvs(msg, ": none");
5369 sv_catpvs(msg, " vs ");
5371 Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p);
5373 sv_catpvs(msg, "none");
5374 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
5378 static void const_sv_xsub(pTHX_ CV* cv);
5382 =head1 Optree Manipulation Functions
5384 =for apidoc cv_const_sv
5386 If C<cv> is a constant sub eligible for inlining. returns the constant
5387 value returned by the sub. Otherwise, returns NULL.
5389 Constant subs can be created with C<newCONSTSUB> or as described in
5390 L<perlsub/"Constant Functions">.
5395 Perl_cv_const_sv(pTHX_ const CV *const cv)
5397 PERL_UNUSED_CONTEXT;
5400 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
5402 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
5405 /* op_const_sv: examine an optree to determine whether it's in-lineable.
5406 * Can be called in 3 ways:
5409 * look for a single OP_CONST with attached value: return the value
5411 * cv && CvCLONE(cv) && !CvCONST(cv)
5413 * examine the clone prototype, and if contains only a single
5414 * OP_CONST referencing a pad const, or a single PADSV referencing
5415 * an outer lexical, return a non-zero value to indicate the CV is
5416 * a candidate for "constizing" at clone time
5420 * We have just cloned an anon prototype that was marked as a const
5421 * candidiate. Try to grab the current value, and in the case of
5422 * PADSV, ignore it if it has multiple references. Return the value.
5426 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
5437 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
5438 o = cLISTOPo->op_first->op_sibling;
5440 for (; o; o = o->op_next) {
5441 const OPCODE type = o->op_type;
5443 if (sv && o->op_next == o)
5445 if (o->op_next != o) {
5446 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
5448 if (type == OP_DBSTATE)
5451 if (type == OP_LEAVESUB || type == OP_RETURN)
5455 if (type == OP_CONST && cSVOPo->op_sv)
5457 else if (cv && type == OP_CONST) {
5458 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5462 else if (cv && type == OP_PADSV) {
5463 if (CvCONST(cv)) { /* newly cloned anon */
5464 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5465 /* the candidate should have 1 ref from this pad and 1 ref
5466 * from the parent */
5467 if (!sv || SvREFCNT(sv) != 2)
5474 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
5475 sv = &PL_sv_undef; /* an arbitrary non-null value */
5490 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5493 /* This would be the return value, but the return cannot be reached. */
5494 OP* pegop = newOP(OP_NULL, 0);
5497 PERL_UNUSED_ARG(floor);
5507 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
5509 NORETURN_FUNCTION_END;
5514 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
5516 return Perl_newATTRSUB(aTHX_ floor, o, proto, NULL, block);
5520 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5527 register CV *cv = NULL;
5529 /* If the subroutine has no body, no attributes, and no builtin attributes
5530 then it's just a sub declaration, and we may be able to get away with
5531 storing with a placeholder scalar in the symbol table, rather than a
5532 full GV and CV. If anything is present then it will take a full CV to
5534 const I32 gv_fetch_flags
5535 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5537 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
5538 const char * const name = o ? SvPV_nolen_const(cSVOPo->op_sv) : NULL;
5541 assert(proto->op_type == OP_CONST);
5542 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
5547 if (!name && PERLDB_NAMEANON && CopLINE(PL_curcop)) {
5548 SV * const sv = sv_newmortal();
5549 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
5550 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
5551 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
5552 aname = SvPVX_const(sv);
5557 gv = name ? gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV)
5558 : gv_fetchpv(aname ? aname
5559 : (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
5560 gv_fetch_flags, SVt_PVCV);
5562 if (!PL_madskills) {
5571 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
5572 maximum a prototype before. */
5573 if (SvTYPE(gv) > SVt_NULL) {
5574 if (!SvPOK((const SV *)gv)
5575 && !(SvIOK((const SV *)gv) && SvIVX((const SV *)gv) == -1)
5576 && ckWARN_d(WARN_PROTOTYPE))
5578 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
5580 cv_ckproto_len((const CV *)gv, NULL, ps, ps_len);
5583 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
5585 sv_setiv(MUTABLE_SV(gv), -1);
5587 SvREFCNT_dec(PL_compcv);
5588 cv = PL_compcv = NULL;
5592 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
5594 if (!block || !ps || *ps || attrs
5595 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5597 || block->op_type == OP_NULL
5602 const_sv = op_const_sv(block, NULL);
5605 const bool exists = CvROOT(cv) || CvXSUB(cv);
5607 /* if the subroutine doesn't exist and wasn't pre-declared
5608 * with a prototype, assume it will be AUTOLOADed,
5609 * skipping the prototype check
5611 if (exists || SvPOK(cv))
5612 cv_ckproto_len(cv, gv, ps, ps_len);
5613 /* already defined (or promised)? */
5614 if (exists || GvASSUMECV(gv)) {
5617 || block->op_type == OP_NULL
5620 if (CvFLAGS(PL_compcv)) {
5621 /* might have had built-in attrs applied */
5622 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5624 /* just a "sub foo;" when &foo is already defined */
5625 SAVEFREESV(PL_compcv);
5630 && block->op_type != OP_NULL
5633 if (ckWARN(WARN_REDEFINE)
5635 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
5637 const line_t oldline = CopLINE(PL_curcop);
5638 if (PL_parser && PL_parser->copline != NOLINE)
5639 CopLINE_set(PL_curcop, PL_parser->copline);
5640 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5641 CvCONST(cv) ? "Constant subroutine %s redefined"
5642 : "Subroutine %s redefined", name);
5643 CopLINE_set(PL_curcop, oldline);
5646 if (!PL_minus_c) /* keep old one around for madskills */
5649 /* (PL_madskills unset in used file.) */
5657 SvREFCNT_inc_simple_void_NN(const_sv);
5659 assert(!CvROOT(cv) && !CvCONST(cv));
5660 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
5661 CvXSUBANY(cv).any_ptr = const_sv;
5662 CvXSUB(cv) = const_sv_xsub;
5668 cv = newCONSTSUB(NULL, name, const_sv);
5670 mro_method_changed_in( /* sub Foo::Bar () { 123 } */
5671 (CvGV(cv) && GvSTASH(CvGV(cv)))
5680 SvREFCNT_dec(PL_compcv);
5688 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>
5689 * before we clobber PL_compcv.
5693 || block->op_type == OP_NULL
5696 rcv = MUTABLE_SV(cv);
5697 /* Might have had built-in attributes applied -- propagate them. */
5698 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5699 if (CvGV(cv) && GvSTASH(CvGV(cv)))
5700 stash = GvSTASH(CvGV(cv));
5701 else if (CvSTASH(cv))
5702 stash = CvSTASH(cv);
5704 stash = PL_curstash;
5707 /* possibly about to re-define existing subr -- ignore old cv */
5708 rcv = MUTABLE_SV(PL_compcv);
5709 if (name && GvSTASH(gv))
5710 stash = GvSTASH(gv);
5712 stash = PL_curstash;
5714 apply_attrs(stash, rcv, attrs, FALSE);
5716 if (cv) { /* must reuse cv if autoloaded */
5723 || block->op_type == OP_NULL) && !PL_madskills
5726 /* got here with just attrs -- work done, so bug out */
5727 SAVEFREESV(PL_compcv);
5730 /* transfer PL_compcv to cv */
5732 CvFLAGS(cv) = CvFLAGS(PL_compcv);
5733 if (!CvWEAKOUTSIDE(cv))
5734 SvREFCNT_dec(CvOUTSIDE(cv));
5735 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
5736 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
5737 CvOUTSIDE(PL_compcv) = 0;
5738 CvPADLIST(cv) = CvPADLIST(PL_compcv);
5739 CvPADLIST(PL_compcv) = 0;
5740 /* inner references to PL_compcv must be fixed up ... */
5741 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
5742 /* ... before we throw it away */
5743 SvREFCNT_dec(PL_compcv);
5745 if (PERLDB_INTER)/* Advice debugger on the new sub. */
5746 ++PL_sub_generation;
5753 if (strEQ(name, "import")) {
5754 PL_formfeed = MUTABLE_SV(cv);
5755 Perl_warner(aTHX_ packWARN(WARN_VOID), "%lx\n", (long)cv);
5759 mro_method_changed_in(GvSTASH(gv)); /* sub Foo::bar { (shift)+1 } */
5763 CvFILE_set_from_cop(cv, PL_curcop);
5764 CvSTASH(cv) = PL_curstash;
5767 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
5769 if (PL_parser && PL_parser->error_count) {
5773 const char *s = strrchr(name, ':');
5775 if (strEQ(s, "BEGIN")) {
5776 const char not_safe[] =
5777 "BEGIN not safe after errors--compilation aborted";
5778 if (PL_in_eval & EVAL_KEEPERR)
5779 Perl_croak(aTHX_ not_safe);
5781 /* force display of errors found but not reported */
5782 sv_catpv(ERRSV, not_safe);
5783 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
5792 /* If we assign an optree to a PVCV, then we've defined a subroutine that
5793 the debugger could be able to set a breakpoint in, so signal to
5794 pp_entereval that it should not throw away any saved lines at scope
5797 PL_breakable_sub_gen++;
5799 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
5800 mod(scalarseq(block), OP_LEAVESUBLV));
5801 block->op_attached = 1;
5804 /* This makes sub {}; work as expected. */
5805 if (block->op_type == OP_STUB) {
5806 OP* const newblock = newSTATEOP(0, NULL, 0);
5808 op_getmad(block,newblock,'B');
5815 block->op_attached = 1;
5816 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
5818 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5819 OpREFCNT_set(CvROOT(cv), 1);
5820 CvSTART(cv) = LINKLIST(CvROOT(cv));
5821 CvROOT(cv)->op_next = 0;
5822 CALL_PEEP(CvSTART(cv));
5824 /* now that optimizer has done its work, adjust pad values */
5826 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
5829 assert(!CvCONST(cv));
5830 if (ps && !*ps && op_const_sv(block, cv))
5834 if (name || aname) {
5835 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
5836 SV * const sv = newSV(0);
5837 SV * const tmpstr = sv_newmortal();
5838 GV * const db_postponed = gv_fetchpvs("DB::postponed",
5839 GV_ADDMULTI, SVt_PVHV);
5842 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
5844 (long)PL_subline, (long)CopLINE(PL_curcop));
5845 gv_efullname3(tmpstr, gv, NULL);
5846 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
5847 SvCUR(tmpstr), sv, 0);
5848 hv = GvHVn(db_postponed);
5849 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) {
5850 CV * const pcv = GvCV(db_postponed);
5856 call_sv(MUTABLE_SV(pcv), G_DISCARD);
5861 if (name && ! (PL_parser && PL_parser->error_count))
5862 process_special_blocks(name, gv, cv);
5867 PL_parser->copline = NOLINE;
5873 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
5876 const char *const colon = strrchr(fullname,':');
5877 const char *const name = colon ? colon + 1 : fullname;
5879 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
5882 if (strEQ(name, "BEGIN")) {
5883 const I32 oldscope = PL_scopestack_ix;
5885 SAVECOPFILE(&PL_compiling);
5886 SAVECOPLINE(&PL_compiling);
5888 DEBUG_x( dump_sub(gv) );
5889 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
5890 GvCV(gv) = 0; /* cv has been hijacked */
5891 call_list(oldscope, PL_beginav);
5893 PL_curcop = &PL_compiling;
5894 CopHINTS_set(&PL_compiling, PL_hints);
5901 if strEQ(name, "END") {
5902 DEBUG_x( dump_sub(gv) );
5903 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
5906 } else if (*name == 'U') {
5907 if (strEQ(name, "UNITCHECK")) {
5908 /* It's never too late to run a unitcheck block */
5909 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
5913 } else if (*name == 'C') {
5914 if (strEQ(name, "CHECK")) {
5915 if (PL_main_start && ckWARN(WARN_VOID))
5916 Perl_warner(aTHX_ packWARN(WARN_VOID),
5917 "Too late to run CHECK block");
5918 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
5922 } else if (*name == 'I') {
5923 if (strEQ(name, "INIT")) {
5924 if (PL_main_start && ckWARN(WARN_VOID))
5925 Perl_warner(aTHX_ packWARN(WARN_VOID),
5926 "Too late to run INIT block");
5927 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
5933 DEBUG_x( dump_sub(gv) );
5934 GvCV(gv) = 0; /* cv has been hijacked */
5939 =for apidoc newCONSTSUB
5941 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
5942 eligible for inlining at compile-time.
5944 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
5945 which won't be called if used as a destructor, but will suppress the overhead
5946 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
5953 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
5958 const char *const file = CopFILE(PL_curcop);
5960 SV *const temp_sv = CopFILESV(PL_curcop);
5961 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
5966 if (IN_PERL_RUNTIME) {
5967 /* at runtime, it's not safe to manipulate PL_curcop: it may be
5968 * an op shared between threads. Use a non-shared COP for our
5970 SAVEVPTR(PL_curcop);
5971 PL_curcop = &PL_compiling;
5973 SAVECOPLINE(PL_curcop);
5974 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
5977 PL_hints &= ~HINT_BLOCK_SCOPE;
5980 SAVESPTR(PL_curstash);
5981 SAVECOPSTASH(PL_curcop);
5982 PL_curstash = stash;
5983 CopSTASH_set(PL_curcop,stash);
5986 /* file becomes the CvFILE. For an XS, it's supposed to be static storage,
5987 and so doesn't get free()d. (It's expected to be from the C pre-
5988 processor __FILE__ directive). But we need a dynamically allocated one,
5989 and we need it to get freed. */
5990 cv = newXS_flags(name, const_sv_xsub, file ? file : "", "",
5991 XS_DYNAMIC_FILENAME);
5992 CvXSUBANY(cv).any_ptr = sv;
5997 CopSTASH_free(PL_curcop);
6005 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
6006 const char *const filename, const char *const proto,
6009 CV *cv = newXS(name, subaddr, filename);
6011 PERL_ARGS_ASSERT_NEWXS_FLAGS;
6013 if (flags & XS_DYNAMIC_FILENAME) {
6014 /* We need to "make arrangements" (ie cheat) to ensure that the
6015 filename lasts as long as the PVCV we just created, but also doesn't
6017 STRLEN filename_len = strlen(filename);
6018 STRLEN proto_and_file_len = filename_len;
6019 char *proto_and_file;
6023 proto_len = strlen(proto);
6024 proto_and_file_len += proto_len;
6026 Newx(proto_and_file, proto_and_file_len + 1, char);
6027 Copy(proto, proto_and_file, proto_len, char);
6028 Copy(filename, proto_and_file + proto_len, filename_len + 1, char);
6031 proto_and_file = savepvn(filename, filename_len);
6034 /* This gets free()d. :-) */
6035 sv_usepvn_flags(MUTABLE_SV(cv), proto_and_file, proto_and_file_len,
6036 SV_HAS_TRAILING_NUL);
6038 /* This gives us the correct prototype, rather than one with the
6039 file name appended. */
6040 SvCUR_set(cv, proto_len);
6044 CvFILE(cv) = proto_and_file + proto_len;
6046 sv_setpv(MUTABLE_SV(cv), proto);
6052 =for apidoc U||newXS
6054 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
6055 static storage, as it is used directly as CvFILE(), without a copy being made.
6061 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
6064 GV * const gv = gv_fetchpv(name ? name :
6065 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
6066 GV_ADDMULTI, SVt_PVCV);
6069 PERL_ARGS_ASSERT_NEWXS;
6072 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
6074 if ((cv = (name ? GvCV(gv) : NULL))) {
6076 /* just a cached method */
6080 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
6081 /* already defined (or promised) */
6082 /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */
6083 if (ckWARN(WARN_REDEFINE)) {
6084 GV * const gvcv = CvGV(cv);
6086 HV * const stash = GvSTASH(gvcv);
6088 const char *redefined_name = HvNAME_get(stash);
6089 if ( strEQ(redefined_name,"autouse") ) {
6090 const line_t oldline = CopLINE(PL_curcop);
6091 if (PL_parser && PL_parser->copline != NOLINE)
6092 CopLINE_set(PL_curcop, PL_parser->copline);
6093 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6094 CvCONST(cv) ? "Constant subroutine %s redefined"
6095 : "Subroutine %s redefined"
6097 CopLINE_set(PL_curcop, oldline);
6107 if (cv) /* must reuse cv if autoloaded */
6110 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
6114 mro_method_changed_in(GvSTASH(gv)); /* newXS */
6118 (void)gv_fetchfile(filename);
6119 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
6120 an external constant string */
6122 CvXSUB(cv) = subaddr;
6125 process_special_blocks(name, gv, cv);
6137 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
6142 OP* pegop = newOP(OP_NULL, 0);
6146 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
6147 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
6150 if ((cv = GvFORM(gv))) {
6151 if (ckWARN(WARN_REDEFINE)) {
6152 const line_t oldline = CopLINE(PL_curcop);
6153 if (PL_parser && PL_parser->copline != NOLINE)
6154 CopLINE_set(PL_curcop, PL_parser->copline);
6156 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6157 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
6159 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6160 "Format STDOUT redefined");
6162 CopLINE_set(PL_curcop, oldline);
6169 CvFILE_set_from_cop(cv, PL_curcop);
6172 pad_tidy(padtidy_FORMAT);
6173 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
6174 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6175 OpREFCNT_set(CvROOT(cv), 1);
6176 CvSTART(cv) = LINKLIST(CvROOT(cv));
6177 CvROOT(cv)->op_next = 0;
6178 CALL_PEEP(CvSTART(cv));
6180 op_getmad(o,pegop,'n');
6181 op_getmad_weak(block, pegop, 'b');
6186 PL_parser->copline = NOLINE;
6194 Perl_newANONLIST(pTHX_ OP *o)
6196 return convert(OP_ANONLIST, OPf_SPECIAL, o);
6200 Perl_newANONHASH(pTHX_ OP *o)
6202 return convert(OP_ANONHASH, OPf_SPECIAL, o);
6206 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
6208 return newANONATTRSUB(floor, proto, NULL, block);
6212 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
6214 return newUNOP(OP_REFGEN, 0,
6215 newSVOP(OP_ANONCODE, 0,
6216 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
6220 Perl_oopsAV(pTHX_ OP *o)
6224 PERL_ARGS_ASSERT_OOPSAV;
6226 switch (o->op_type) {
6228 o->op_type = OP_PADAV;
6229 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6230 return ref(o, OP_RV2AV);
6233 o->op_type = OP_RV2AV;
6234 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
6239 if (ckWARN_d(WARN_INTERNAL))
6240 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
6247 Perl_oopsHV(pTHX_ OP *o)
6251 PERL_ARGS_ASSERT_OOPSHV;
6253 switch (o->op_type) {
6256 o->op_type = OP_PADHV;
6257 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6258 return ref(o, OP_RV2HV);
6262 o->op_type = OP_RV2HV;
6263 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
6268 if (ckWARN_d(WARN_INTERNAL))
6269 Perl_warner(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
6276 Perl_newAVREF(pTHX_ OP *o)
6280 PERL_ARGS_ASSERT_NEWAVREF;
6282 if (o->op_type == OP_PADANY) {
6283 o->op_type = OP_PADAV;
6284 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6287 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)
6288 && ckWARN(WARN_DEPRECATED)) {
6289 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
6290 "Using an array as a reference is deprecated");
6292 return newUNOP(OP_RV2AV, 0, scalar(o));
6296 Perl_newGVREF(pTHX_ I32 type, OP *o)
6298 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
6299 return newUNOP(OP_NULL, 0, o);
6300 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
6304 Perl_newHVREF(pTHX_ OP *o)
6308 PERL_ARGS_ASSERT_NEWHVREF;
6310 if (o->op_type == OP_PADANY) {
6311 o->op_type = OP_PADHV;
6312 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6315 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)
6316 && ckWARN(WARN_DEPRECATED)) {
6317 Perl_warner(aTHX_ packWARN(WARN_DEPRECATED),
6318 "Using a hash as a reference is deprecated");
6320 return newUNOP(OP_RV2HV, 0, scalar(o));
6324 Perl_newCVREF(pTHX_ I32 flags, OP *o)
6326 return newUNOP(OP_RV2CV, flags, scalar(o));
6330 Perl_newSVREF(pTHX_ OP *o)
6334 PERL_ARGS_ASSERT_NEWSVREF;
6336 if (o->op_type == OP_PADANY) {
6337 o->op_type = OP_PADSV;
6338 o->op_ppaddr = PL_ppaddr[OP_PADSV];
6341 return newUNOP(OP_RV2SV, 0, scalar(o));
6344 /* Check routines. See the comments at the top of this file for details
6345 * on when these are called */
6348 Perl_ck_anoncode(pTHX_ OP *o)
6350 PERL_ARGS_ASSERT_CK_ANONCODE;
6352 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
6354 cSVOPo->op_sv = NULL;
6359 Perl_ck_bitop(pTHX_ OP *o)
6363 PERL_ARGS_ASSERT_CK_BITOP;
6365 #define OP_IS_NUMCOMPARE(op) \
6366 ((op) == OP_LT || (op) == OP_I_LT || \
6367 (op) == OP_GT || (op) == OP_I_GT || \
6368 (op) == OP_LE || (op) == OP_I_LE || \
6369 (op) == OP_GE || (op) == OP_I_GE || \
6370 (op) == OP_EQ || (op) == OP_I_EQ || \
6371 (op) == OP_NE || (op) == OP_I_NE || \
6372 (op) == OP_NCMP || (op) == OP_I_NCMP)
6373 o->op_private = (U8)(PL_hints & HINT_INTEGER);
6374 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
6375 && (o->op_type == OP_BIT_OR
6376 || o->op_type == OP_BIT_AND
6377 || o->op_type == OP_BIT_XOR))
6379 const OP * const left = cBINOPo->op_first;
6380 const OP * const right = left->op_sibling;
6381 if ((OP_IS_NUMCOMPARE(left->op_type) &&
6382 (left->op_flags & OPf_PARENS) == 0) ||
6383 (OP_IS_NUMCOMPARE(right->op_type) &&
6384 (right->op_flags & OPf_PARENS) == 0))
6385 if (ckWARN(WARN_PRECEDENCE))
6386 Perl_warner(aTHX_ packWARN(WARN_PRECEDENCE),
6387 "Possible precedence problem on bitwise %c operator",
6388 o->op_type == OP_BIT_OR ? '|'
6389 : o->op_type == OP_BIT_AND ? '&' : '^'
6396 Perl_ck_concat(pTHX_ OP *o)
6398 const OP * const kid = cUNOPo->op_first;
6400 PERL_ARGS_ASSERT_CK_CONCAT;
6401 PERL_UNUSED_CONTEXT;
6403 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
6404 !(kUNOP->op_first->op_flags & OPf_MOD))
6405 o->op_flags |= OPf_STACKED;
6410 Perl_ck_spair(pTHX_ OP *o)
6414 PERL_ARGS_ASSERT_CK_SPAIR;
6416 if (o->op_flags & OPf_KIDS) {
6419 const OPCODE type = o->op_type;
6420 o = modkids(ck_fun(o), type);
6421 kid = cUNOPo->op_first;
6422 newop = kUNOP->op_first->op_sibling;
6424 const OPCODE type = newop->op_type;
6425 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
6426 type == OP_PADAV || type == OP_PADHV ||
6427 type == OP_RV2AV || type == OP_RV2HV)
6431 op_getmad(kUNOP->op_first,newop,'K');
6433 op_free(kUNOP->op_first);
6435 kUNOP->op_first = newop;
6437 o->op_ppaddr = PL_ppaddr[++o->op_type];
6442 Perl_ck_delete(pTHX_ OP *o)
6444 PERL_ARGS_ASSERT_CK_DELETE;
6448 if (o->op_flags & OPf_KIDS) {
6449 OP * const kid = cUNOPo->op_first;
6450 switch (kid->op_type) {
6452 o->op_flags |= OPf_SPECIAL;
6455 o->op_private |= OPpSLICE;
6458 o->op_flags |= OPf_SPECIAL;
6463 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
6472 Perl_ck_die(pTHX_ OP *o)
6474 PERL_ARGS_ASSERT_CK_DIE;
6477 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6483 Perl_ck_eof(pTHX_ OP *o)
6487 PERL_ARGS_ASSERT_CK_EOF;
6489 if (o->op_flags & OPf_KIDS) {
6490 if (cLISTOPo->op_first->op_type == OP_STUB) {
6492 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
6494 op_getmad(o,newop,'O');
6506 Perl_ck_eval(pTHX_ OP *o)
6510 PERL_ARGS_ASSERT_CK_EVAL;
6512 PL_hints |= HINT_BLOCK_SCOPE;
6513 if (o->op_flags & OPf_KIDS) {
6514 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6517 o->op_flags &= ~OPf_KIDS;
6520 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
6526 cUNOPo->op_first = 0;
6531 NewOp(1101, enter, 1, LOGOP);
6532 enter->op_type = OP_ENTERTRY;
6533 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
6534 enter->op_private = 0;
6536 /* establish postfix order */
6537 enter->op_next = (OP*)enter;
6539 CHECKOP(OP_ENTERTRY, enter);
6541 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
6542 o->op_type = OP_LEAVETRY;
6543 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
6544 enter->op_other = o;
6545 op_getmad(oldo,o,'O');
6559 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
6560 op_getmad(oldo,o,'O');
6562 o->op_targ = (PADOFFSET)PL_hints;
6563 if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) {
6564 /* Store a copy of %^H that pp_entereval can pick up. */
6565 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
6566 MUTABLE_SV(Perl_hv_copy_hints_hv(aTHX_ GvHV(PL_hintgv))));
6567 cUNOPo->op_first->op_sibling = hhop;
6568 o->op_private |= OPpEVAL_HAS_HH;
6574 Perl_ck_exit(pTHX_ OP *o)
6576 PERL_ARGS_ASSERT_CK_EXIT;
6579 HV * const table = GvHV(PL_hintgv);
6581 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
6582 if (svp && *svp && SvTRUE(*svp))
6583 o->op_private |= OPpEXIT_VMSISH;
6585 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6591 Perl_ck_exec(pTHX_ OP *o)
6593 PERL_ARGS_ASSERT_CK_EXEC;
6595 if (o->op_flags & OPf_STACKED) {
6598 kid = cUNOPo->op_first->op_sibling;
6599 if (kid->op_type == OP_RV2GV)
6608 Perl_ck_exists(pTHX_ OP *o)
6612 PERL_ARGS_ASSERT_CK_EXISTS;
6615 if (o->op_flags & OPf_KIDS) {
6616 OP * const kid = cUNOPo->op_first;
6617 if (kid->op_type == OP_ENTERSUB) {
6618 (void) ref(kid, o->op_type);
6619 if (kid->op_type != OP_RV2CV
6620 && !(PL_parser && PL_parser->error_count))
6621 Perl_croak(aTHX_ "%s argument is not a subroutine name",
6623 o->op_private |= OPpEXISTS_SUB;
6625 else if (kid->op_type == OP_AELEM)
6626 o->op_flags |= OPf_SPECIAL;
6627 else if (kid->op_type != OP_HELEM)
6628 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
6636 Perl_ck_rvconst(pTHX_ register OP *o)
6639 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6641 PERL_ARGS_ASSERT_CK_RVCONST;
6643 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6644 if (o->op_type == OP_RV2CV)
6645 o->op_private &= ~1;
6647 if (kid->op_type == OP_CONST) {
6650 SV * const kidsv = kid->op_sv;
6652 /* Is it a constant from cv_const_sv()? */
6653 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
6654 SV * const rsv = SvRV(kidsv);
6655 const svtype type = SvTYPE(rsv);
6656 const char *badtype = NULL;
6658 switch (o->op_type) {
6660 if (type > SVt_PVMG)
6661 badtype = "a SCALAR";
6664 if (type != SVt_PVAV)
6665 badtype = "an ARRAY";
6668 if (type != SVt_PVHV)
6672 if (type != SVt_PVCV)
6677 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
6680 else if ((o->op_type == OP_RV2HV || o->op_type == OP_RV2SV) &&
6681 (PL_hints & HINT_STRICT_REFS) && SvPOK(kidsv)) {
6682 /* If this is an access to a stash, disable "strict refs", because
6683 * stashes aren't auto-vivified at compile-time (unless we store
6684 * symbols in them), and we don't want to produce a run-time
6685 * stricture error when auto-vivifying the stash. */
6686 const char *s = SvPV_nolen(kidsv);
6687 const STRLEN l = SvCUR(kidsv);
6688 if (l > 1 && s[l-1] == ':' && s[l-2] == ':')
6689 o->op_private &= ~HINT_STRICT_REFS;
6691 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
6692 const char *badthing;
6693 switch (o->op_type) {
6695 badthing = "a SCALAR";
6698 badthing = "an ARRAY";
6701 badthing = "a HASH";
6709 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
6710 SVfARG(kidsv), badthing);
6713 * This is a little tricky. We only want to add the symbol if we
6714 * didn't add it in the lexer. Otherwise we get duplicate strict
6715 * warnings. But if we didn't add it in the lexer, we must at
6716 * least pretend like we wanted to add it even if it existed before,
6717 * or we get possible typo warnings. OPpCONST_ENTERED says
6718 * whether the lexer already added THIS instance of this symbol.
6720 iscv = (o->op_type == OP_RV2CV) * 2;
6722 gv = gv_fetchsv(kidsv,
6723 iscv | !(kid->op_private & OPpCONST_ENTERED),
6726 : o->op_type == OP_RV2SV
6728 : o->op_type == OP_RV2AV
6730 : o->op_type == OP_RV2HV
6733 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
6735 kid->op_type = OP_GV;
6736 SvREFCNT_dec(kid->op_sv);
6738 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
6739 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
6740 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
6742 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
6744 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
6746 kid->op_private = 0;
6747 kid->op_ppaddr = PL_ppaddr[OP_GV];
6754 Perl_ck_ftst(pTHX_ OP *o)
6757 const I32 type = o->op_type;
6759 PERL_ARGS_ASSERT_CK_FTST;
6761 if (o->op_flags & OPf_REF) {
6764 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
6765 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6766 const OPCODE kidtype = kid->op_type;
6768 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6769 OP * const newop = newGVOP(type, OPf_REF,
6770 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
6772 op_getmad(o,newop,'O');
6778 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
6779 o->op_private |= OPpFT_ACCESS;
6780 if (PL_check[kidtype] == MEMBER_TO_FPTR(Perl_ck_ftst)
6781 && kidtype != OP_STAT && kidtype != OP_LSTAT)
6782 o->op_private |= OPpFT_STACKED;
6790 if (type == OP_FTTTY)
6791 o = newGVOP(type, OPf_REF, PL_stdingv);
6793 o = newUNOP(type, 0, newDEFSVOP());
6794 op_getmad(oldo,o,'O');
6800 Perl_ck_fun(pTHX_ OP *o)
6803 const int type = o->op_type;
6804 register I32 oa = PL_opargs[type] >> OASHIFT;
6806 PERL_ARGS_ASSERT_CK_FUN;
6808 if (o->op_flags & OPf_STACKED) {
6809 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
6812 return no_fh_allowed(o);
6815 if (o->op_flags & OPf_KIDS) {
6816 OP **tokid = &cLISTOPo->op_first;
6817 register OP *kid = cLISTOPo->op_first;
6821 if (kid->op_type == OP_PUSHMARK ||
6822 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
6824 tokid = &kid->op_sibling;
6825 kid = kid->op_sibling;
6827 if (!kid && PL_opargs[type] & OA_DEFGV)
6828 *tokid = kid = newDEFSVOP();
6832 sibl = kid->op_sibling;
6834 if (!sibl && kid->op_type == OP_STUB) {
6841 /* list seen where single (scalar) arg expected? */
6842 if (numargs == 1 && !(oa >> 4)
6843 && kid->op_type == OP_LIST && type != OP_SCALAR)
6845 return too_many_arguments(o,PL_op_desc[type]);
6858 if ((type == OP_PUSH || type == OP_UNSHIFT)
6859 && !kid->op_sibling && ckWARN(WARN_SYNTAX))
6860 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
6861 "Useless use of %s with no values",
6864 if (kid->op_type == OP_CONST &&
6865 (kid->op_private & OPpCONST_BARE))
6867 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
6868 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
6869 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
6870 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6871 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
6872 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6874 op_getmad(kid,newop,'K');
6879 kid->op_sibling = sibl;
6882 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
6883 bad_type(numargs, "array", PL_op_desc[type], kid);
6887 if (kid->op_type == OP_CONST &&
6888 (kid->op_private & OPpCONST_BARE))
6890 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
6891 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
6892 if (ckWARN2(WARN_DEPRECATED, WARN_SYNTAX))
6893 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
6894 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
6895 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6897 op_getmad(kid,newop,'K');
6902 kid->op_sibling = sibl;
6905 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
6906 bad_type(numargs, "hash", PL_op_desc[type], kid);
6911 OP * const newop = newUNOP(OP_NULL, 0, kid);
6912 kid->op_sibling = 0;
6914 newop->op_next = newop;
6916 kid->op_sibling = sibl;
6921 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
6922 if (kid->op_type == OP_CONST &&
6923 (kid->op_private & OPpCONST_BARE))
6925 OP * const newop = newGVOP(OP_GV, 0,
6926 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
6927 if (!(o->op_private & 1) && /* if not unop */
6928 kid == cLISTOPo->op_last)
6929 cLISTOPo->op_last = newop;
6931 op_getmad(kid,newop,'K');
6937 else if (kid->op_type == OP_READLINE) {
6938 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
6939 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
6942 I32 flags = OPf_SPECIAL;
6946 /* is this op a FH constructor? */
6947 if (is_handle_constructor(o,numargs)) {
6948 const char *name = NULL;
6952 /* Set a flag to tell rv2gv to vivify
6953 * need to "prove" flag does not mean something
6954 * else already - NI-S 1999/05/07
6957 if (kid->op_type == OP_PADSV) {
6959 = PAD_COMPNAME_SV(kid->op_targ);
6960 name = SvPV_const(namesv, len);
6962 else if (kid->op_type == OP_RV2SV
6963 && kUNOP->op_first->op_type == OP_GV)
6965 GV * const gv = cGVOPx_gv(kUNOP->op_first);
6967 len = GvNAMELEN(gv);
6969 else if (kid->op_type == OP_AELEM
6970 || kid->op_type == OP_HELEM)
6973 OP *op = ((BINOP*)kid)->op_first;
6977 const char * const a =
6978 kid->op_type == OP_AELEM ?
6980 if (((op->op_type == OP_RV2AV) ||
6981 (op->op_type == OP_RV2HV)) &&
6982 (firstop = ((UNOP*)op)->op_first) &&
6983 (firstop->op_type == OP_GV)) {
6984 /* packagevar $a[] or $h{} */
6985 GV * const gv = cGVOPx_gv(firstop);
6993 else if (op->op_type == OP_PADAV
6994 || op->op_type == OP_PADHV) {
6995 /* lexicalvar $a[] or $h{} */
6996 const char * const padname =
6997 PAD_COMPNAME_PV(op->op_targ);
7006 name = SvPV_const(tmpstr, len);
7011 name = "__ANONIO__";
7018 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
7019 namesv = PAD_SVl(targ);
7020 SvUPGRADE(namesv, SVt_PV);
7022 sv_setpvs(namesv, "$");
7023 sv_catpvn(namesv, name, len);
7026 kid->op_sibling = 0;
7027 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
7028 kid->op_targ = targ;
7029 kid->op_private |= priv;
7031 kid->op_sibling = sibl;
7037 mod(scalar(kid), type);
7041 tokid = &kid->op_sibling;
7042 kid = kid->op_sibling;
7045 if (kid && kid->op_type != OP_STUB)
7046 return too_many_arguments(o,OP_DESC(o));
7047 o->op_private |= numargs;
7049 /* FIXME - should the numargs move as for the PERL_MAD case? */
7050 o->op_private |= numargs;
7052 return too_many_arguments(o,OP_DESC(o));
7056 else if (PL_opargs[type] & OA_DEFGV) {
7058 OP *newop = newUNOP(type, 0, newDEFSVOP());
7059 op_getmad(o,newop,'O');
7062 /* Ordering of these two is important to keep f_map.t passing. */
7064 return newUNOP(type, 0, newDEFSVOP());
7069 while (oa & OA_OPTIONAL)
7071 if (oa && oa != OA_LIST)
7072 return too_few_arguments(o,OP_DESC(o));
7078 Perl_ck_glob(pTHX_ OP *o)
7083 PERL_ARGS_ASSERT_CK_GLOB;
7086 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
7087 append_elem(OP_GLOB, o, newDEFSVOP());
7089 if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
7090 && GvCVu(gv) && GvIMPORTED_CV(gv)))
7092 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7095 #if !defined(PERL_EXTERNAL_GLOB)
7096 /* XXX this can be tightened up and made more failsafe. */
7097 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7100 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
7101 newSVpvs("File::Glob"), NULL, NULL, NULL);
7102 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7103 glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV);
7104 GvCV(gv) = GvCV(glob_gv);
7105 SvREFCNT_inc_void(MUTABLE_SV(GvCV(gv)));
7106 GvIMPORTED_CV_on(gv);
7109 #endif /* PERL_EXTERNAL_GLOB */
7111 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7112 append_elem(OP_GLOB, o,
7113 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
7114 o->op_type = OP_LIST;
7115 o->op_ppaddr = PL_ppaddr[OP_LIST];
7116 cLISTOPo->op_first->op_type = OP_PUSHMARK;
7117 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
7118 cLISTOPo->op_first->op_targ = 0;
7119 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
7120 append_elem(OP_LIST, o,
7121 scalar(newUNOP(OP_RV2CV, 0,
7122 newGVOP(OP_GV, 0, gv)))));
7123 o = newUNOP(OP_NULL, 0, ck_subr(o));
7124 o->op_targ = OP_GLOB; /* hint at what it used to be */
7127 gv = newGVgen("main");
7129 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
7135 Perl_ck_grep(pTHX_ OP *o)
7140 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
7143 PERL_ARGS_ASSERT_CK_GREP;
7145 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
7146 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
7148 if (o->op_flags & OPf_STACKED) {
7151 kid = cLISTOPo->op_first->op_sibling;
7152 if (!cUNOPx(kid)->op_next)
7153 Perl_croak(aTHX_ "panic: ck_grep");
7154 for (k = cUNOPx(kid)->op_first; k; k = k->op_next) {
7157 NewOp(1101, gwop, 1, LOGOP);
7158 kid->op_next = (OP*)gwop;
7159 o->op_flags &= ~OPf_STACKED;
7161 kid = cLISTOPo->op_first->op_sibling;
7162 if (type == OP_MAPWHILE)
7167 if (PL_parser && PL_parser->error_count)
7169 kid = cLISTOPo->op_first->op_sibling;
7170 if (kid->op_type != OP_NULL)
7171 Perl_croak(aTHX_ "panic: ck_grep");
7172 kid = kUNOP->op_first;
7175 NewOp(1101, gwop, 1, LOGOP);
7176 gwop->op_type = type;
7177 gwop->op_ppaddr = PL_ppaddr[type];
7178 gwop->op_first = listkids(o);
7179 gwop->op_flags |= OPf_KIDS;
7180 gwop->op_other = LINKLIST(kid);
7181 kid->op_next = (OP*)gwop;
7182 offset = pad_findmy("$_");
7183 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
7184 o->op_private = gwop->op_private = 0;
7185 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
7188 o->op_private = gwop->op_private = OPpGREP_LEX;
7189 gwop->op_targ = o->op_targ = offset;
7192 kid = cLISTOPo->op_first->op_sibling;
7193 if (!kid || !kid->op_sibling)
7194 return too_few_arguments(o,OP_DESC(o));
7195 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
7196 mod(kid, OP_GREPSTART);
7202 Perl_ck_index(pTHX_ OP *o)
7204 PERL_ARGS_ASSERT_CK_INDEX;
7206 if (o->op_flags & OPf_KIDS) {
7207 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7209 kid = kid->op_sibling; /* get past "big" */
7210 if (kid && kid->op_type == OP_CONST)
7211 fbm_compile(((SVOP*)kid)->op_sv, 0);
7217 Perl_ck_lfun(pTHX_ OP *o)
7219 const OPCODE type = o->op_type;
7221 PERL_ARGS_ASSERT_CK_LFUN;
7223 return modkids(ck_fun(o), type);
7227 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
7229 PERL_ARGS_ASSERT_CK_DEFINED;
7231 if ((o->op_flags & OPf_KIDS) && ckWARN2(WARN_DEPRECATED, WARN_SYNTAX)) {
7232 switch (cUNOPo->op_first->op_type) {
7234 /* This is needed for
7235 if (defined %stash::)
7236 to work. Do not break Tk.
7238 break; /* Globals via GV can be undef */
7240 case OP_AASSIGN: /* Is this a good idea? */
7241 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7242 "defined(@array) is deprecated");
7243 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7244 "\t(Maybe you should just omit the defined()?)\n");
7247 /* This is needed for
7248 if (defined %stash::)
7249 to work. Do not break Tk.
7251 break; /* Globals via GV can be undef */
7253 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7254 "defined(%%hash) is deprecated");
7255 Perl_warner(aTHX_ packWARN2(WARN_DEPRECATED, WARN_SYNTAX),
7256 "\t(Maybe you should just omit the defined()?)\n");
7267 Perl_ck_readline(pTHX_ OP *o)
7269 PERL_ARGS_ASSERT_CK_READLINE;
7271 if (!(o->op_flags & OPf_KIDS)) {
7273 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
7275 op_getmad(o,newop,'O');
7285 Perl_ck_rfun(pTHX_ OP *o)
7287 const OPCODE type = o->op_type;
7289 PERL_ARGS_ASSERT_CK_RFUN;
7291 return refkids(ck_fun(o), type);
7295 Perl_ck_listiob(pTHX_ OP *o)
7299 PERL_ARGS_ASSERT_CK_LISTIOB;
7301 kid = cLISTOPo->op_first;
7304 kid = cLISTOPo->op_first;
7306 if (kid->op_type == OP_PUSHMARK)
7307 kid = kid->op_sibling;
7308 if (kid && o->op_flags & OPf_STACKED)
7309 kid = kid->op_sibling;
7310 else if (kid && !kid->op_sibling) { /* print HANDLE; */
7311 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
7312 o->op_flags |= OPf_STACKED; /* make it a filehandle */
7313 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
7314 cLISTOPo->op_first->op_sibling = kid;
7315 cLISTOPo->op_last = kid;
7316 kid = kid->op_sibling;
7321 append_elem(o->op_type, o, newDEFSVOP());
7327 Perl_ck_smartmatch(pTHX_ OP *o)
7330 if (0 == (o->op_flags & OPf_SPECIAL)) {
7331 OP *first = cBINOPo->op_first;
7332 OP *second = first->op_sibling;
7334 /* Implicitly take a reference to an array or hash */
7335 first->op_sibling = NULL;
7336 first = cBINOPo->op_first = ref_array_or_hash(first);
7337 second = first->op_sibling = ref_array_or_hash(second);
7339 /* Implicitly take a reference to a regular expression */
7340 if (first->op_type == OP_MATCH) {
7341 first->op_type = OP_QR;
7342 first->op_ppaddr = PL_ppaddr[OP_QR];
7344 if (second->op_type == OP_MATCH) {
7345 second->op_type = OP_QR;
7346 second->op_ppaddr = PL_ppaddr[OP_QR];
7355 Perl_ck_sassign(pTHX_ OP *o)
7358 OP * const kid = cLISTOPo->op_first;
7360 PERL_ARGS_ASSERT_CK_SASSIGN;
7362 /* has a disposable target? */
7363 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
7364 && !(kid->op_flags & OPf_STACKED)
7365 /* Cannot steal the second time! */
7366 && !(kid->op_private & OPpTARGET_MY)
7367 /* Keep the full thing for madskills */
7371 OP * const kkid = kid->op_sibling;
7373 /* Can just relocate the target. */
7374 if (kkid && kkid->op_type == OP_PADSV
7375 && !(kkid->op_private & OPpLVAL_INTRO))
7377 kid->op_targ = kkid->op_targ;
7379 /* Now we do not need PADSV and SASSIGN. */
7380 kid->op_sibling = o->op_sibling; /* NULL */
7381 cLISTOPo->op_first = NULL;
7384 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
7388 if (kid->op_sibling) {
7389 OP *kkid = kid->op_sibling;
7390 if (kkid->op_type == OP_PADSV
7391 && (kkid->op_private & OPpLVAL_INTRO)
7392 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
7393 const PADOFFSET target = kkid->op_targ;
7394 OP *const other = newOP(OP_PADSV,
7396 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
7397 OP *const first = newOP(OP_NULL, 0);
7398 OP *const nullop = newCONDOP(0, first, o, other);
7399 OP *const condop = first->op_next;
7400 /* hijacking PADSTALE for uninitialized state variables */
7401 SvPADSTALE_on(PAD_SVl(target));
7403 condop->op_type = OP_ONCE;
7404 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
7405 condop->op_targ = target;
7406 other->op_targ = target;
7408 /* Because we change the type of the op here, we will skip the
7409 assinment binop->op_last = binop->op_first->op_sibling; at the
7410 end of Perl_newBINOP(). So need to do it here. */
7411 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
7420 Perl_ck_match(pTHX_ OP *o)
7424 PERL_ARGS_ASSERT_CK_MATCH;
7426 if (o->op_type != OP_QR && PL_compcv) {
7427 const PADOFFSET offset = pad_findmy("$_");
7428 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
7429 o->op_targ = offset;
7430 o->op_private |= OPpTARGET_MY;
7433 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
7434 o->op_private |= OPpRUNTIME;
7439 Perl_ck_method(pTHX_ OP *o)
7441 OP * const kid = cUNOPo->op_first;
7443 PERL_ARGS_ASSERT_CK_METHOD;
7445 if (kid->op_type == OP_CONST) {
7446 SV* sv = kSVOP->op_sv;
7447 const char * const method = SvPVX_const(sv);
7448 if (!(strchr(method, ':') || strchr(method, '\''))) {
7450 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
7451 sv = newSVpvn_share(method, SvCUR(sv), 0);
7454 kSVOP->op_sv = NULL;
7456 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
7458 op_getmad(o,cmop,'O');
7469 Perl_ck_null(pTHX_ OP *o)
7471 PERL_ARGS_ASSERT_CK_NULL;
7472 PERL_UNUSED_CONTEXT;
7477 Perl_ck_open(pTHX_ OP *o)
7480 HV * const table = GvHV(PL_hintgv);
7482 PERL_ARGS_ASSERT_CK_OPEN;
7485 SV **svp = hv_fetchs(table, "open_IN", FALSE);
7488 const char *d = SvPV_const(*svp, len);
7489 const I32 mode = mode_from_discipline(d, len);
7490 if (mode & O_BINARY)
7491 o->op_private |= OPpOPEN_IN_RAW;
7492 else if (mode & O_TEXT)
7493 o->op_private |= OPpOPEN_IN_CRLF;
7496 svp = hv_fetchs(table, "open_OUT", FALSE);
7499 const char *d = SvPV_const(*svp, len);
7500 const I32 mode = mode_from_discipline(d, len);
7501 if (mode & O_BINARY)
7502 o->op_private |= OPpOPEN_OUT_RAW;
7503 else if (mode & O_TEXT)
7504 o->op_private |= OPpOPEN_OUT_CRLF;
7507 if (o->op_type == OP_BACKTICK) {
7508 if (!(o->op_flags & OPf_KIDS)) {
7509 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
7511 op_getmad(o,newop,'O');
7520 /* In case of three-arg dup open remove strictness
7521 * from the last arg if it is a bareword. */
7522 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
7523 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
7527 if ((last->op_type == OP_CONST) && /* The bareword. */
7528 (last->op_private & OPpCONST_BARE) &&
7529 (last->op_private & OPpCONST_STRICT) &&
7530 (oa = first->op_sibling) && /* The fh. */
7531 (oa = oa->op_sibling) && /* The mode. */
7532 (oa->op_type == OP_CONST) &&
7533 SvPOK(((SVOP*)oa)->op_sv) &&
7534 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
7535 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
7536 (last == oa->op_sibling)) /* The bareword. */
7537 last->op_private &= ~OPpCONST_STRICT;
7543 Perl_ck_repeat(pTHX_ OP *o)
7545 PERL_ARGS_ASSERT_CK_REPEAT;
7547 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
7548 o->op_private |= OPpREPEAT_DOLIST;
7549 cBINOPo->op_first = force_list(cBINOPo->op_first);
7557 Perl_ck_require(pTHX_ OP *o)
7562 PERL_ARGS_ASSERT_CK_REQUIRE;
7564 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
7565 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7567 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
7568 SV * const sv = kid->op_sv;
7569 U32 was_readonly = SvREADONLY(sv);
7576 sv_force_normal_flags(sv, 0);
7577 assert(!SvREADONLY(sv));
7587 for (; s < end; s++) {
7588 if (*s == ':' && s[1] == ':') {
7590 Move(s+2, s+1, end - s - 1, char);
7595 sv_catpvs(sv, ".pm");
7596 SvFLAGS(sv) |= was_readonly;
7600 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
7601 /* handle override, if any */
7602 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
7603 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7604 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
7605 gv = gvp ? *gvp : NULL;
7609 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7610 OP * const kid = cUNOPo->op_first;
7613 cUNOPo->op_first = 0;
7617 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
7618 append_elem(OP_LIST, kid,
7619 scalar(newUNOP(OP_RV2CV, 0,
7622 op_getmad(o,newop,'O');
7630 Perl_ck_return(pTHX_ OP *o)
7635 PERL_ARGS_ASSERT_CK_RETURN;
7637 kid = cLISTOPo->op_first->op_sibling;
7638 if (CvLVALUE(PL_compcv)) {
7639 for (; kid; kid = kid->op_sibling)
7640 mod(kid, OP_LEAVESUBLV);
7642 for (; kid; kid = kid->op_sibling)
7643 if ((kid->op_type == OP_NULL)
7644 && ((kid->op_flags & (OPf_SPECIAL|OPf_KIDS)) == (OPf_SPECIAL|OPf_KIDS))) {
7645 /* This is a do block */
7646 OP *op = kUNOP->op_first;
7647 if (op->op_type == OP_LEAVE && op->op_flags & OPf_KIDS) {
7648 op = cUNOPx(op)->op_first;
7649 assert(op->op_type == OP_ENTER && !(op->op_flags & OPf_SPECIAL));
7650 /* Force the use of the caller's context */
7651 op->op_flags |= OPf_SPECIAL;
7660 Perl_ck_select(pTHX_ OP *o)
7665 PERL_ARGS_ASSERT_CK_SELECT;
7667 if (o->op_flags & OPf_KIDS) {
7668 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7669 if (kid && kid->op_sibling) {
7670 o->op_type = OP_SSELECT;
7671 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
7673 return fold_constants(o);
7677 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7678 if (kid && kid->op_type == OP_RV2GV)
7679 kid->op_private &= ~HINT_STRICT_REFS;
7684 Perl_ck_shift(pTHX_ OP *o)
7687 const I32 type = o->op_type;
7689 PERL_ARGS_ASSERT_CK_SHIFT;
7691 if (!(o->op_flags & OPf_KIDS)) {
7693 /* FIXME - this can be refactored to reduce code in #ifdefs */
7695 OP * const oldo = o;
7699 argop = newUNOP(OP_RV2AV, 0,
7700 scalar(newGVOP(OP_GV, 0, CvUNIQUE(PL_compcv) ? PL_argvgv : PL_defgv)));
7702 o = newUNOP(type, 0, scalar(argop));
7703 op_getmad(oldo,o,'O');
7706 return newUNOP(type, 0, scalar(argop));
7709 return scalar(modkids(ck_fun(o), type));
7713 Perl_ck_sort(pTHX_ OP *o)
7718 PERL_ARGS_ASSERT_CK_SORT;
7720 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
7721 HV * const hinthv = GvHV(PL_hintgv);
7723 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
7725 const I32 sorthints = (I32)SvIV(*svp);
7726 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
7727 o->op_private |= OPpSORT_QSORT;
7728 if ((sorthints & HINT_SORT_STABLE) != 0)
7729 o->op_private |= OPpSORT_STABLE;
7734 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
7736 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7737 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
7739 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
7741 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
7743 if (kid->op_type == OP_SCOPE) {
7747 else if (kid->op_type == OP_LEAVE) {
7748 if (o->op_type == OP_SORT) {
7749 op_null(kid); /* wipe out leave */
7752 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
7753 if (k->op_next == kid)
7755 /* don't descend into loops */
7756 else if (k->op_type == OP_ENTERLOOP
7757 || k->op_type == OP_ENTERITER)
7759 k = cLOOPx(k)->op_lastop;
7764 kid->op_next = 0; /* just disconnect the leave */
7765 k = kLISTOP->op_first;
7770 if (o->op_type == OP_SORT) {
7771 /* provide scalar context for comparison function/block */
7777 o->op_flags |= OPf_SPECIAL;
7779 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
7782 firstkid = firstkid->op_sibling;
7785 /* provide list context for arguments */
7786 if (o->op_type == OP_SORT)
7793 S_simplify_sort(pTHX_ OP *o)
7796 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7802 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
7804 if (!(o->op_flags & OPf_STACKED))
7806 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
7807 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
7808 kid = kUNOP->op_first; /* get past null */
7809 if (kid->op_type != OP_SCOPE)
7811 kid = kLISTOP->op_last; /* get past scope */
7812 switch(kid->op_type) {
7820 k = kid; /* remember this node*/
7821 if (kBINOP->op_first->op_type != OP_RV2SV)
7823 kid = kBINOP->op_first; /* get past cmp */
7824 if (kUNOP->op_first->op_type != OP_GV)
7826 kid = kUNOP->op_first; /* get past rv2sv */
7828 if (GvSTASH(gv) != PL_curstash)
7830 gvname = GvNAME(gv);
7831 if (*gvname == 'a' && gvname[1] == '\0')
7833 else if (*gvname == 'b' && gvname[1] == '\0')
7838 kid = k; /* back to cmp */
7839 if (kBINOP->op_last->op_type != OP_RV2SV)
7841 kid = kBINOP->op_last; /* down to 2nd arg */
7842 if (kUNOP->op_first->op_type != OP_GV)
7844 kid = kUNOP->op_first; /* get past rv2sv */
7846 if (GvSTASH(gv) != PL_curstash)
7848 gvname = GvNAME(gv);
7850 ? !(*gvname == 'a' && gvname[1] == '\0')
7851 : !(*gvname == 'b' && gvname[1] == '\0'))
7853 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
7855 o->op_private |= OPpSORT_DESCEND;
7856 if (k->op_type == OP_NCMP)
7857 o->op_private |= OPpSORT_NUMERIC;
7858 if (k->op_type == OP_I_NCMP)
7859 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
7860 kid = cLISTOPo->op_first->op_sibling;
7861 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
7863 op_getmad(kid,o,'S'); /* then delete it */
7865 op_free(kid); /* then delete it */
7870 Perl_ck_split(pTHX_ OP *o)
7875 PERL_ARGS_ASSERT_CK_SPLIT;
7877 if (o->op_flags & OPf_STACKED)
7878 return no_fh_allowed(o);
7880 kid = cLISTOPo->op_first;
7881 if (kid->op_type != OP_NULL)
7882 Perl_croak(aTHX_ "panic: ck_split");
7883 kid = kid->op_sibling;
7884 op_free(cLISTOPo->op_first);
7885 cLISTOPo->op_first = kid;
7887 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
7888 cLISTOPo->op_last = kid; /* There was only one element previously */
7891 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
7892 OP * const sibl = kid->op_sibling;
7893 kid->op_sibling = 0;
7894 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
7895 if (cLISTOPo->op_first == cLISTOPo->op_last)
7896 cLISTOPo->op_last = kid;
7897 cLISTOPo->op_first = kid;
7898 kid->op_sibling = sibl;
7901 kid->op_type = OP_PUSHRE;
7902 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
7904 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL && ckWARN(WARN_REGEXP)) {
7905 Perl_warner(aTHX_ packWARN(WARN_REGEXP),
7906 "Use of /g modifier is meaningless in split");
7909 if (!kid->op_sibling)
7910 append_elem(OP_SPLIT, o, newDEFSVOP());
7912 kid = kid->op_sibling;
7915 if (!kid->op_sibling)
7916 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
7917 assert(kid->op_sibling);
7919 kid = kid->op_sibling;
7922 if (kid->op_sibling)
7923 return too_many_arguments(o,OP_DESC(o));
7929 Perl_ck_join(pTHX_ OP *o)
7931 const OP * const kid = cLISTOPo->op_first->op_sibling;
7933 PERL_ARGS_ASSERT_CK_JOIN;
7935 if (kid && kid->op_type == OP_MATCH) {
7936 if (ckWARN(WARN_SYNTAX)) {
7937 const REGEXP *re = PM_GETRE(kPMOP);
7938 const char *pmstr = re ? RX_PRECOMP_const(re) : "STRING";
7939 const STRLEN len = re ? RX_PRELEN(re) : 6;
7940 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7941 "/%.*s/ should probably be written as \"%.*s\"",
7942 (int)len, pmstr, (int)len, pmstr);
7949 Perl_ck_subr(pTHX_ OP *o)
7952 OP *prev = ((cUNOPo->op_first->op_sibling)
7953 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
7954 OP *o2 = prev->op_sibling;
7956 const char *proto = NULL;
7957 const char *proto_end = NULL;
7962 I32 contextclass = 0;
7963 const char *e = NULL;
7966 PERL_ARGS_ASSERT_CK_SUBR;
7968 o->op_private |= OPpENTERSUB_HASTARG;
7969 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
7970 if (cvop->op_type == OP_RV2CV) {
7972 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
7973 op_null(cvop); /* disable rv2cv */
7974 tmpop = (SVOP*)((UNOP*)cvop)->op_first;
7975 if (tmpop->op_type == OP_GV && !(o->op_private & OPpENTERSUB_AMPER)) {
7976 GV *gv = cGVOPx_gv(tmpop);
7979 tmpop->op_private |= OPpEARLY_CV;
7983 namegv = CvANON(cv) ? gv : CvGV(cv);
7984 proto = SvPV(MUTABLE_SV(cv), len);
7985 proto_end = proto + len;
7990 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
7991 if (o2->op_type == OP_CONST)
7992 o2->op_private &= ~OPpCONST_STRICT;
7993 else if (o2->op_type == OP_LIST) {
7994 OP * const sib = ((UNOP*)o2)->op_first->op_sibling;
7995 if (sib && sib->op_type == OP_CONST)
7996 sib->op_private &= ~OPpCONST_STRICT;
7999 o->op_private |= (PL_hints & HINT_STRICT_REFS);
8000 if (PERLDB_SUB && PL_curstash != PL_debstash)
8001 o->op_private |= OPpENTERSUB_DB;
8002 while (o2 != cvop) {
8004 if (PL_madskills && o2->op_type == OP_STUB) {
8005 o2 = o2->op_sibling;
8008 if (PL_madskills && o2->op_type == OP_NULL)
8009 o3 = ((UNOP*)o2)->op_first;
8013 if (proto >= proto_end)
8014 return too_many_arguments(o, gv_ename(namegv));
8022 /* _ must be at the end */
8023 if (proto[1] && proto[1] != ';')
8038 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
8040 arg == 1 ? "block or sub {}" : "sub {}",
8041 gv_ename(namegv), o3);
8044 /* '*' allows any scalar type, including bareword */
8047 if (o3->op_type == OP_RV2GV)
8048 goto wrapref; /* autoconvert GLOB -> GLOBref */
8049 else if (o3->op_type == OP_CONST)
8050 o3->op_private &= ~OPpCONST_STRICT;
8051 else if (o3->op_type == OP_ENTERSUB) {
8052 /* accidental subroutine, revert to bareword */
8053 OP *gvop = ((UNOP*)o3)->op_first;
8054 if (gvop && gvop->op_type == OP_NULL) {
8055 gvop = ((UNOP*)gvop)->op_first;
8057 for (; gvop->op_sibling; gvop = gvop->op_sibling)
8060 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
8061 (gvop = ((UNOP*)gvop)->op_first) &&
8062 gvop->op_type == OP_GV)
8064 GV * const gv = cGVOPx_gv(gvop);
8065 OP * const sibling = o2->op_sibling;
8066 SV * const n = newSVpvs("");
8068 OP * const oldo2 = o2;
8072 gv_fullname4(n, gv, "", FALSE);
8073 o2 = newSVOP(OP_CONST, 0, n);
8074 op_getmad(oldo2,o2,'O');
8075 prev->op_sibling = o2;
8076 o2->op_sibling = sibling;
8092 if (contextclass++ == 0) {
8093 e = strchr(proto, ']');
8094 if (!e || e == proto)
8103 const char *p = proto;
8104 const char *const end = proto;
8106 while (*--p != '[') {}
8107 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
8109 gv_ename(namegv), o3);
8114 if (o3->op_type == OP_RV2GV)
8117 bad_type(arg, "symbol", gv_ename(namegv), o3);
8120 if (o3->op_type == OP_ENTERSUB)
8123 bad_type(arg, "subroutine entry", gv_ename(namegv),
8127 if (o3->op_type == OP_RV2SV ||
8128 o3->op_type == OP_PADSV ||
8129 o3->op_type == OP_HELEM ||
8130 o3->op_type == OP_AELEM)
8133 bad_type(arg, "scalar", gv_ename(namegv), o3);
8136 if (o3->op_type == OP_RV2AV ||
8137 o3->op_type == OP_PADAV)
8140 bad_type(arg, "array", gv_ename(namegv), o3);
8143 if (o3->op_type == OP_RV2HV ||
8144 o3->op_type == OP_PADHV)
8147 bad_type(arg, "hash", gv_ename(namegv), o3);
8152 OP* const sib = kid->op_sibling;
8153 kid->op_sibling = 0;
8154 o2 = newUNOP(OP_REFGEN, 0, kid);
8155 o2->op_sibling = sib;
8156 prev->op_sibling = o2;
8158 if (contextclass && e) {
8173 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
8174 gv_ename(namegv), SVfARG(cv));
8179 mod(o2, OP_ENTERSUB);
8181 o2 = o2->op_sibling;
8183 if (o2 == cvop && proto && *proto == '_') {
8184 /* generate an access to $_ */
8186 o2->op_sibling = prev->op_sibling;
8187 prev->op_sibling = o2; /* instead of cvop */
8189 if (proto && !optional && proto_end > proto &&
8190 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
8191 return too_few_arguments(o, gv_ename(namegv));
8194 OP * const oldo = o;
8198 o=newSVOP(OP_CONST, 0, newSViv(0));
8199 op_getmad(oldo,o,'O');
8205 Perl_ck_svconst(pTHX_ OP *o)
8207 PERL_ARGS_ASSERT_CK_SVCONST;
8208 PERL_UNUSED_CONTEXT;
8209 SvREADONLY_on(cSVOPo->op_sv);
8214 Perl_ck_chdir(pTHX_ OP *o)
8216 if (o->op_flags & OPf_KIDS) {
8217 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8219 if (kid && kid->op_type == OP_CONST &&
8220 (kid->op_private & OPpCONST_BARE))
8222 o->op_flags |= OPf_SPECIAL;
8223 kid->op_private &= ~OPpCONST_STRICT;
8230 Perl_ck_trunc(pTHX_ OP *o)
8232 PERL_ARGS_ASSERT_CK_TRUNC;
8234 if (o->op_flags & OPf_KIDS) {
8235 SVOP *kid = (SVOP*)cUNOPo->op_first;
8237 if (kid->op_type == OP_NULL)
8238 kid = (SVOP*)kid->op_sibling;
8239 if (kid && kid->op_type == OP_CONST &&
8240 (kid->op_private & OPpCONST_BARE))
8242 o->op_flags |= OPf_SPECIAL;
8243 kid->op_private &= ~OPpCONST_STRICT;
8250 Perl_ck_unpack(pTHX_ OP *o)
8252 OP *kid = cLISTOPo->op_first;
8254 PERL_ARGS_ASSERT_CK_UNPACK;
8256 if (kid->op_sibling) {
8257 kid = kid->op_sibling;
8258 if (!kid->op_sibling)
8259 kid->op_sibling = newDEFSVOP();
8265 Perl_ck_substr(pTHX_ OP *o)
8267 PERL_ARGS_ASSERT_CK_SUBSTR;
8270 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
8271 OP *kid = cLISTOPo->op_first;
8273 if (kid->op_type == OP_NULL)
8274 kid = kid->op_sibling;
8276 kid->op_flags |= OPf_MOD;
8283 Perl_ck_each(pTHX_ OP *o)
8286 OP *kid = cLISTOPo->op_first;
8288 PERL_ARGS_ASSERT_CK_EACH;
8290 if (kid->op_type == OP_PADAV || kid->op_type == OP_RV2AV) {
8291 const unsigned new_type = o->op_type == OP_EACH ? OP_AEACH
8292 : o->op_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
8293 o->op_type = new_type;
8294 o->op_ppaddr = PL_ppaddr[new_type];
8296 else if (!(kid->op_type == OP_PADHV || kid->op_type == OP_RV2HV
8297 || (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE)
8299 bad_type(1, "hash or array", PL_op_desc[o->op_type], kid);
8305 /* A peephole optimizer. We visit the ops in the order they're to execute.
8306 * See the comments at the top of this file for more details about when
8307 * peep() is called */
8310 Perl_peep(pTHX_ register OP *o)
8313 register OP* oldop = NULL;
8315 if (!o || o->op_opt)
8319 SAVEVPTR(PL_curcop);
8320 for (; o; o = o->op_next) {
8323 /* By default, this op has now been optimised. A couple of cases below
8324 clear this again. */
8327 switch (o->op_type) {
8330 PL_curcop = ((COP*)o); /* for warnings */
8334 if (cSVOPo->op_private & OPpCONST_STRICT)
8335 no_bareword_allowed(o);
8338 case OP_METHOD_NAMED:
8339 /* Relocate sv to the pad for thread safety.
8340 * Despite being a "constant", the SV is written to,
8341 * for reference counts, sv_upgrade() etc. */
8343 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
8344 if (o->op_type != OP_METHOD_NAMED && SvPADTMP(cSVOPo->op_sv)) {
8345 /* If op_sv is already a PADTMP then it is being used by
8346 * some pad, so make a copy. */
8347 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
8348 SvREADONLY_on(PAD_SVl(ix));
8349 SvREFCNT_dec(cSVOPo->op_sv);
8351 else if (o->op_type != OP_METHOD_NAMED
8352 && cSVOPo->op_sv == &PL_sv_undef) {
8353 /* PL_sv_undef is hack - it's unsafe to store it in the
8354 AV that is the pad, because av_fetch treats values of
8355 PL_sv_undef as a "free" AV entry and will merrily
8356 replace them with a new SV, causing pad_alloc to think
8357 that this pad slot is free. (When, clearly, it is not)
8359 SvOK_off(PAD_SVl(ix));
8360 SvPADTMP_on(PAD_SVl(ix));
8361 SvREADONLY_on(PAD_SVl(ix));
8364 SvREFCNT_dec(PAD_SVl(ix));
8365 SvPADTMP_on(cSVOPo->op_sv);
8366 PAD_SETSV(ix, cSVOPo->op_sv);
8367 /* XXX I don't know how this isn't readonly already. */
8368 SvREADONLY_on(PAD_SVl(ix));
8370 cSVOPo->op_sv = NULL;
8377 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
8378 if (o->op_next->op_private & OPpTARGET_MY) {
8379 if (o->op_flags & OPf_STACKED) /* chained concats */
8380 break; /* ignore_optimization */
8382 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
8383 o->op_targ = o->op_next->op_targ;
8384 o->op_next->op_targ = 0;
8385 o->op_private |= OPpTARGET_MY;
8388 op_null(o->op_next);
8392 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
8393 break; /* Scalar stub must produce undef. List stub is noop */
8397 if (o->op_targ == OP_NEXTSTATE
8398 || o->op_targ == OP_DBSTATE)
8400 PL_curcop = ((COP*)o);
8402 /* XXX: We avoid setting op_seq here to prevent later calls
8403 to peep() from mistakenly concluding that optimisation
8404 has already occurred. This doesn't fix the real problem,
8405 though (See 20010220.007). AMS 20010719 */
8406 /* op_seq functionality is now replaced by op_opt */
8413 if (oldop && o->op_next) {
8414 oldop->op_next = o->op_next;
8422 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
8423 OP* const pop = (o->op_type == OP_PADAV) ?
8424 o->op_next : o->op_next->op_next;
8426 if (pop && pop->op_type == OP_CONST &&
8427 ((PL_op = pop->op_next)) &&
8428 pop->op_next->op_type == OP_AELEM &&
8429 !(pop->op_next->op_private &
8430 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
8431 (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop))
8436 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
8437 no_bareword_allowed(pop);
8438 if (o->op_type == OP_GV)
8439 op_null(o->op_next);
8440 op_null(pop->op_next);
8442 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
8443 o->op_next = pop->op_next->op_next;
8444 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
8445 o->op_private = (U8)i;
8446 if (o->op_type == OP_GV) {
8451 o->op_flags |= OPf_SPECIAL;
8452 o->op_type = OP_AELEMFAST;
8457 if (o->op_next->op_type == OP_RV2SV) {
8458 if (!(o->op_next->op_private & OPpDEREF)) {
8459 op_null(o->op_next);
8460 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
8462 o->op_next = o->op_next->op_next;
8463 o->op_type = OP_GVSV;
8464 o->op_ppaddr = PL_ppaddr[OP_GVSV];
8467 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
8468 GV * const gv = cGVOPo_gv;
8469 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
8470 /* XXX could check prototype here instead of just carping */
8471 SV * const sv = sv_newmortal();
8472 gv_efullname3(sv, gv, NULL);
8473 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
8474 "%"SVf"() called too early to check prototype",
8478 else if (o->op_next->op_type == OP_READLINE
8479 && o->op_next->op_next->op_type == OP_CONCAT
8480 && (o->op_next->op_next->op_flags & OPf_STACKED))
8482 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
8483 o->op_type = OP_RCATLINE;
8484 o->op_flags |= OPf_STACKED;
8485 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
8486 op_null(o->op_next->op_next);
8487 op_null(o->op_next);
8503 while (cLOGOP->op_other->op_type == OP_NULL)
8504 cLOGOP->op_other = cLOGOP->op_other->op_next;
8505 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
8510 while (cLOOP->op_redoop->op_type == OP_NULL)
8511 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
8512 peep(cLOOP->op_redoop);
8513 while (cLOOP->op_nextop->op_type == OP_NULL)
8514 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
8515 peep(cLOOP->op_nextop);
8516 while (cLOOP->op_lastop->op_type == OP_NULL)
8517 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
8518 peep(cLOOP->op_lastop);
8522 assert(!(cPMOP->op_pmflags & PMf_ONCE));
8523 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
8524 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
8525 cPMOP->op_pmstashstartu.op_pmreplstart
8526 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
8527 peep(cPMOP->op_pmstashstartu.op_pmreplstart);
8531 if (o->op_next && o->op_next->op_type == OP_NEXTSTATE
8532 && ckWARN(WARN_SYNTAX))
8534 if (o->op_next->op_sibling) {
8535 const OPCODE type = o->op_next->op_sibling->op_type;
8536 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
8537 const line_t oldline = CopLINE(PL_curcop);
8538 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
8539 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8540 "Statement unlikely to be reached");
8541 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8542 "\t(Maybe you meant system() when you said exec()?)\n");
8543 CopLINE_set(PL_curcop, oldline);
8554 const char *key = NULL;
8557 if (((BINOP*)o)->op_last->op_type != OP_CONST)
8560 /* Make the CONST have a shared SV */
8561 svp = cSVOPx_svp(((BINOP*)o)->op_last);
8562 if (!SvFAKE(sv = *svp) || !SvREADONLY(sv)) {
8563 key = SvPV_const(sv, keylen);
8564 lexname = newSVpvn_share(key,
8565 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
8571 if ((o->op_private & (OPpLVAL_INTRO)))
8574 rop = (UNOP*)((BINOP*)o)->op_first;
8575 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
8577 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
8578 if (!SvPAD_TYPED(lexname))
8580 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8581 if (!fields || !GvHV(*fields))
8583 key = SvPV_const(*svp, keylen);
8584 if (!hv_fetch(GvHV(*fields), key,
8585 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8587 Perl_croak(aTHX_ "No such class field \"%s\" "
8588 "in variable %s of type %s",
8589 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
8602 SVOP *first_key_op, *key_op;
8604 if ((o->op_private & (OPpLVAL_INTRO))
8605 /* I bet there's always a pushmark... */
8606 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
8607 /* hmmm, no optimization if list contains only one key. */
8609 rop = (UNOP*)((LISTOP*)o)->op_last;
8610 if (rop->op_type != OP_RV2HV)
8612 if (rop->op_first->op_type == OP_PADSV)
8613 /* @$hash{qw(keys here)} */
8614 rop = (UNOP*)rop->op_first;
8616 /* @{$hash}{qw(keys here)} */
8617 if (rop->op_first->op_type == OP_SCOPE
8618 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
8620 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
8626 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
8627 if (!SvPAD_TYPED(lexname))
8629 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8630 if (!fields || !GvHV(*fields))
8632 /* Again guessing that the pushmark can be jumped over.... */
8633 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
8634 ->op_first->op_sibling;
8635 for (key_op = first_key_op; key_op;
8636 key_op = (SVOP*)key_op->op_sibling) {
8637 if (key_op->op_type != OP_CONST)
8639 svp = cSVOPx_svp(key_op);
8640 key = SvPV_const(*svp, keylen);
8641 if (!hv_fetch(GvHV(*fields), key,
8642 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8644 Perl_croak(aTHX_ "No such class field \"%s\" "
8645 "in variable %s of type %s",
8646 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
8653 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
8657 /* check that RHS of sort is a single plain array */
8658 OP *oright = cUNOPo->op_first;
8659 if (!oright || oright->op_type != OP_PUSHMARK)
8662 /* reverse sort ... can be optimised. */
8663 if (!cUNOPo->op_sibling) {
8664 /* Nothing follows us on the list. */
8665 OP * const reverse = o->op_next;
8667 if (reverse->op_type == OP_REVERSE &&
8668 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
8669 OP * const pushmark = cUNOPx(reverse)->op_first;
8670 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
8671 && (cUNOPx(pushmark)->op_sibling == o)) {
8672 /* reverse -> pushmark -> sort */
8673 o->op_private |= OPpSORT_REVERSE;
8675 pushmark->op_next = oright->op_next;
8681 /* make @a = sort @a act in-place */
8683 oright = cUNOPx(oright)->op_sibling;
8686 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
8687 oright = cUNOPx(oright)->op_sibling;
8691 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
8692 || oright->op_next != o
8693 || (oright->op_private & OPpLVAL_INTRO)
8697 /* o2 follows the chain of op_nexts through the LHS of the
8698 * assign (if any) to the aassign op itself */
8700 if (!o2 || o2->op_type != OP_NULL)
8703 if (!o2 || o2->op_type != OP_PUSHMARK)
8706 if (o2 && o2->op_type == OP_GV)
8709 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
8710 || (o2->op_private & OPpLVAL_INTRO)
8715 if (!o2 || o2->op_type != OP_NULL)
8718 if (!o2 || o2->op_type != OP_AASSIGN
8719 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
8722 /* check that the sort is the first arg on RHS of assign */
8724 o2 = cUNOPx(o2)->op_first;
8725 if (!o2 || o2->op_type != OP_NULL)
8727 o2 = cUNOPx(o2)->op_first;
8728 if (!o2 || o2->op_type != OP_PUSHMARK)
8730 if (o2->op_sibling != o)
8733 /* check the array is the same on both sides */
8734 if (oleft->op_type == OP_RV2AV) {
8735 if (oright->op_type != OP_RV2AV
8736 || !cUNOPx(oright)->op_first
8737 || cUNOPx(oright)->op_first->op_type != OP_GV
8738 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
8739 cGVOPx_gv(cUNOPx(oright)->op_first)
8743 else if (oright->op_type != OP_PADAV
8744 || oright->op_targ != oleft->op_targ
8748 /* transfer MODishness etc from LHS arg to RHS arg */
8749 oright->op_flags = oleft->op_flags;
8750 o->op_private |= OPpSORT_INPLACE;
8752 /* excise push->gv->rv2av->null->aassign */
8753 o2 = o->op_next->op_next;
8754 op_null(o2); /* PUSHMARK */
8756 if (o2->op_type == OP_GV) {
8757 op_null(o2); /* GV */
8760 op_null(o2); /* RV2AV or PADAV */
8761 o2 = o2->op_next->op_next;
8762 op_null(o2); /* AASSIGN */
8764 o->op_next = o2->op_next;
8770 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
8772 LISTOP *enter, *exlist;
8774 enter = (LISTOP *) o->op_next;
8777 if (enter->op_type == OP_NULL) {
8778 enter = (LISTOP *) enter->op_next;
8782 /* for $a (...) will have OP_GV then OP_RV2GV here.
8783 for (...) just has an OP_GV. */
8784 if (enter->op_type == OP_GV) {
8785 gvop = (OP *) enter;
8786 enter = (LISTOP *) enter->op_next;
8789 if (enter->op_type == OP_RV2GV) {
8790 enter = (LISTOP *) enter->op_next;
8796 if (enter->op_type != OP_ENTERITER)
8799 iter = enter->op_next;
8800 if (!iter || iter->op_type != OP_ITER)
8803 expushmark = enter->op_first;
8804 if (!expushmark || expushmark->op_type != OP_NULL
8805 || expushmark->op_targ != OP_PUSHMARK)
8808 exlist = (LISTOP *) expushmark->op_sibling;
8809 if (!exlist || exlist->op_type != OP_NULL
8810 || exlist->op_targ != OP_LIST)
8813 if (exlist->op_last != o) {
8814 /* Mmm. Was expecting to point back to this op. */
8817 theirmark = exlist->op_first;
8818 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
8821 if (theirmark->op_sibling != o) {
8822 /* There's something between the mark and the reverse, eg
8823 for (1, reverse (...))
8828 ourmark = ((LISTOP *)o)->op_first;
8829 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
8832 ourlast = ((LISTOP *)o)->op_last;
8833 if (!ourlast || ourlast->op_next != o)
8836 rv2av = ourmark->op_sibling;
8837 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
8838 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
8839 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
8840 /* We're just reversing a single array. */
8841 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
8842 enter->op_flags |= OPf_STACKED;
8845 /* We don't have control over who points to theirmark, so sacrifice
8847 theirmark->op_next = ourmark->op_next;
8848 theirmark->op_flags = ourmark->op_flags;
8849 ourlast->op_next = gvop ? gvop : (OP *) enter;
8852 enter->op_private |= OPpITER_REVERSED;
8853 iter->op_private |= OPpITER_REVERSED;
8860 UNOP *refgen, *rv2cv;
8863 if ((o->op_flags & OPf_WANT) != OPf_WANT_VOID)
8866 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
8869 rv2gv = ((BINOP *)o)->op_last;
8870 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
8873 refgen = (UNOP *)((BINOP *)o)->op_first;
8875 if (!refgen || refgen->op_type != OP_REFGEN)
8878 exlist = (LISTOP *)refgen->op_first;
8879 if (!exlist || exlist->op_type != OP_NULL
8880 || exlist->op_targ != OP_LIST)
8883 if (exlist->op_first->op_type != OP_PUSHMARK)
8886 rv2cv = (UNOP*)exlist->op_last;
8888 if (rv2cv->op_type != OP_RV2CV)
8891 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
8892 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
8893 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
8895 o->op_private |= OPpASSIGN_CV_TO_GV;
8896 rv2gv->op_private |= OPpDONT_INIT_GV;
8897 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
8905 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
8906 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
8916 Perl_custom_op_name(pTHX_ const OP* o)
8919 const IV index = PTR2IV(o->op_ppaddr);
8923 PERL_ARGS_ASSERT_CUSTOM_OP_NAME;
8925 if (!PL_custom_op_names) /* This probably shouldn't happen */
8926 return (char *)PL_op_name[OP_CUSTOM];
8928 keysv = sv_2mortal(newSViv(index));
8930 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
8932 return (char *)PL_op_name[OP_CUSTOM]; /* Don't know who you are */
8934 return SvPV_nolen(HeVAL(he));
8938 Perl_custom_op_desc(pTHX_ const OP* o)
8941 const IV index = PTR2IV(o->op_ppaddr);
8945 PERL_ARGS_ASSERT_CUSTOM_OP_DESC;
8947 if (!PL_custom_op_descs)
8948 return (char *)PL_op_desc[OP_CUSTOM];
8950 keysv = sv_2mortal(newSViv(index));
8952 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
8954 return (char *)PL_op_desc[OP_CUSTOM];
8956 return SvPV_nolen(HeVAL(he));
8961 /* Efficient sub that returns a constant scalar value. */
8963 const_sv_xsub(pTHX_ CV* cv)
8967 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
8971 /* diag_listed_as: SKIPME */
8972 Perl_croak(aTHX_ "usage: %s::%s()",
8973 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
8986 * c-indentation-style: bsd
8988 * indent-tabs-mode: t
8991 * ex: set ts=8 sts=4 sw=4 noet: