4 * Copyright (C) 1991, 1992, 1993, 1994, 1995, 1996, 1997, 1998, 1999, 2000,
5 * 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008 by Larry Wall and others
7 * You may distribute under the terms of either the GNU General Public
8 * License or the Artistic License, as specified in the README file.
13 * 'You see: Mr. Drogo, he married poor Miss Primula Brandybuck. She was
14 * our Mr. Bilbo's first cousin on the mother's side (her mother being the
15 * youngest of the Old Took's daughters); and Mr. Drogo was his second
16 * cousin. So Mr. Frodo is his first *and* second cousin, once removed
17 * either way, as the saying is, if you follow me.' --the Gaffer
19 * [p.23 of _The Lord of the Rings_, I/i: "A Long-Expected Party"]
22 /* This file contains the functions that create, manipulate and optimize
23 * the OP structures that hold a compiled perl program.
25 * A Perl program is compiled into a tree of OPs. Each op contains
26 * structural pointers (eg to its siblings and the next op in the
27 * execution sequence), a pointer to the function that would execute the
28 * op, plus any data specific to that op. For example, an OP_CONST op
29 * points to the pp_const() function and to an SV containing the constant
30 * value. When pp_const() is executed, its job is to push that SV onto the
33 * OPs are mainly created by the newFOO() functions, which are mainly
34 * called from the parser (in perly.y) as the code is parsed. For example
35 * the Perl code $a + $b * $c would cause the equivalent of the following
36 * to be called (oversimplifying a bit):
38 * newBINOP(OP_ADD, flags,
40 * newBINOP(OP_MULTIPLY, flags, newSVREF($b), newSVREF($c))
43 * Note that during the build of miniperl, a temporary copy of this file
44 * is made, called opmini.c.
48 Perl's compiler is essentially a 3-pass compiler with interleaved phases:
52 An execution-order pass
54 The bottom-up pass is represented by all the "newOP" routines and
55 the ck_ routines. The bottom-upness is actually driven by yacc.
56 So at the point that a ck_ routine fires, we have no idea what the
57 context is, either upward in the syntax tree, or either forward or
58 backward in the execution order. (The bottom-up parser builds that
59 part of the execution order it knows about, but if you follow the "next"
60 links around, you'll find it's actually a closed loop through the
63 Whenever the bottom-up parser gets to a node that supplies context to
64 its components, it invokes that portion of the top-down pass that applies
65 to that part of the subtree (and marks the top node as processed, so
66 if a node further up supplies context, it doesn't have to take the
67 plunge again). As a particular subcase of this, as the new node is
68 built, it takes all the closed execution loops of its subcomponents
69 and links them into a new closed loop for the higher level node. But
70 it's still not the real execution order.
72 The actual execution order is not known till we get a grammar reduction
73 to a top-level unit like a subroutine or file that will be called by
74 "name" rather than via a "next" pointer. At that point, we can call
75 into peep() to do that code's portion of the 3rd pass. It has to be
76 recursive, but it's recursive on basic blocks, not on tree nodes.
79 /* To implement user lexical pragmas, there needs to be a way at run time to
80 get the compile time state of %^H for that block. Storing %^H in every
81 block (or even COP) would be very expensive, so a different approach is
82 taken. The (running) state of %^H is serialised into a tree of HE-like
83 structs. Stores into %^H are chained onto the current leaf as a struct
84 refcounted_he * with the key and the value. Deletes from %^H are saved
85 with a value of PL_sv_placeholder. The state of %^H at any point can be
86 turned back into a regular HV by walking back up the tree from that point's
87 leaf, ignoring any key you've already seen (placeholder or not), storing
88 the rest into the HV structure, then removing the placeholders. Hence
89 memory is only used to store the %^H deltas from the enclosing COP, rather
90 than the entire %^H on each COP.
92 To cause actions on %^H to write out the serialisation records, it has
93 magic type 'H'. This magic (itself) does nothing, but its presence causes
94 the values to gain magic type 'h', which has entries for set and clear.
95 C<Perl_magic_sethint> updates C<PL_compiling.cop_hints_hash> with a store
96 record, with deletes written by C<Perl_magic_clearhint>. C<SAVEHINTS>
97 saves the current C<PL_compiling.cop_hints_hash> on the save stack, so that
98 it will be correctly restored when any inner compiling scope is exited.
104 #include "keywords.h"
106 #define CALL_PEEP(o) CALL_FPTR(PL_peepp)(aTHX_ o)
107 #define CALL_OPFREEHOOK(o) if (PL_opfreehook) CALL_FPTR(PL_opfreehook)(aTHX_ o)
109 #if defined(PL_OP_SLAB_ALLOC)
111 #ifdef PERL_DEBUG_READONLY_OPS
112 # define PERL_SLAB_SIZE 4096
113 # include <sys/mman.h>
116 #ifndef PERL_SLAB_SIZE
117 #define PERL_SLAB_SIZE 2048
121 Perl_Slab_Alloc(pTHX_ size_t sz)
125 * To make incrementing use count easy PL_OpSlab is an I32 *
126 * To make inserting the link to slab PL_OpPtr is I32 **
127 * So compute size in units of sizeof(I32 *) as that is how Pl_OpPtr increments
128 * Add an overhead for pointer to slab and round up as a number of pointers
130 sz = (sz + 2*sizeof(I32 *) -1)/sizeof(I32 *);
131 if ((PL_OpSpace -= sz) < 0) {
132 #ifdef PERL_DEBUG_READONLY_OPS
133 /* We need to allocate chunk by chunk so that we can control the VM
135 PL_OpPtr = (I32**) mmap(0, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE,
136 MAP_ANON|MAP_PRIVATE, -1, 0);
138 DEBUG_m(PerlIO_printf(Perl_debug_log, "mapped %lu at %p\n",
139 (unsigned long) PERL_SLAB_SIZE*sizeof(I32*),
141 if(PL_OpPtr == MAP_FAILED) {
142 perror("mmap failed");
147 PL_OpPtr = (I32 **) PerlMemShared_calloc(PERL_SLAB_SIZE,sizeof(I32*));
152 /* We reserve the 0'th I32 sized chunk as a use count */
153 PL_OpSlab = (I32 *) PL_OpPtr;
154 /* Reduce size by the use count word, and by the size we need.
155 * Latter is to mimic the '-=' in the if() above
157 PL_OpSpace = PERL_SLAB_SIZE - (sizeof(I32)+sizeof(I32 **)-1)/sizeof(I32 **) - sz;
158 /* Allocation pointer starts at the top.
159 Theory: because we build leaves before trunk allocating at end
160 means that at run time access is cache friendly upward
162 PL_OpPtr += PERL_SLAB_SIZE;
164 #ifdef PERL_DEBUG_READONLY_OPS
165 /* We remember this slab. */
166 /* This implementation isn't efficient, but it is simple. */
167 PL_slabs = (I32**) realloc(PL_slabs, sizeof(I32**) * (PL_slab_count + 1));
168 PL_slabs[PL_slab_count++] = PL_OpSlab;
169 DEBUG_m(PerlIO_printf(Perl_debug_log, "Allocate %p\n", PL_OpSlab));
172 assert( PL_OpSpace >= 0 );
173 /* Move the allocation pointer down */
175 assert( PL_OpPtr > (I32 **) PL_OpSlab );
176 *PL_OpPtr = PL_OpSlab; /* Note which slab it belongs to */
177 (*PL_OpSlab)++; /* Increment use count of slab */
178 assert( PL_OpPtr+sz <= ((I32 **) PL_OpSlab + PERL_SLAB_SIZE) );
179 assert( *PL_OpSlab > 0 );
180 return (void *)(PL_OpPtr + 1);
183 #ifdef PERL_DEBUG_READONLY_OPS
185 Perl_pending_Slabs_to_ro(pTHX) {
186 /* Turn all the allocated op slabs read only. */
187 U32 count = PL_slab_count;
188 I32 **const slabs = PL_slabs;
190 /* Reset the array of pending OP slabs, as we're about to turn this lot
191 read only. Also, do it ahead of the loop in case the warn triggers,
192 and a warn handler has an eval */
197 /* Force a new slab for any further allocation. */
201 void *const start = slabs[count];
202 const size_t size = PERL_SLAB_SIZE* sizeof(I32*);
203 if(mprotect(start, size, PROT_READ)) {
204 Perl_warn(aTHX_ "mprotect for %p %lu failed with %d",
205 start, (unsigned long) size, errno);
213 S_Slab_to_rw(pTHX_ void *op)
215 I32 * const * const ptr = (I32 **) op;
216 I32 * const slab = ptr[-1];
218 PERL_ARGS_ASSERT_SLAB_TO_RW;
220 assert( ptr-1 > (I32 **) slab );
221 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
223 if(mprotect(slab, PERL_SLAB_SIZE*sizeof(I32*), PROT_READ|PROT_WRITE)) {
224 Perl_warn(aTHX_ "mprotect RW for %p %lu failed with %d",
225 slab, (unsigned long) PERL_SLAB_SIZE*sizeof(I32*), errno);
230 Perl_op_refcnt_inc(pTHX_ OP *o)
241 Perl_op_refcnt_dec(pTHX_ OP *o)
243 PERL_ARGS_ASSERT_OP_REFCNT_DEC;
248 # define Slab_to_rw(op)
252 Perl_Slab_Free(pTHX_ void *op)
254 I32 * const * const ptr = (I32 **) op;
255 I32 * const slab = ptr[-1];
256 PERL_ARGS_ASSERT_SLAB_FREE;
257 assert( ptr-1 > (I32 **) slab );
258 assert( ptr < ( (I32 **) slab + PERL_SLAB_SIZE) );
261 if (--(*slab) == 0) {
263 # define PerlMemShared PerlMem
266 #ifdef PERL_DEBUG_READONLY_OPS
267 U32 count = PL_slab_count;
268 /* Need to remove this slab from our list of slabs */
271 if (PL_slabs[count] == slab) {
273 /* Found it. Move the entry at the end to overwrite it. */
274 DEBUG_m(PerlIO_printf(Perl_debug_log,
275 "Deallocate %p by moving %p from %lu to %lu\n",
277 PL_slabs[PL_slab_count - 1],
278 PL_slab_count, count));
279 PL_slabs[count] = PL_slabs[--PL_slab_count];
280 /* Could realloc smaller at this point, but probably not
282 if(munmap(slab, PERL_SLAB_SIZE*sizeof(I32*))) {
283 perror("munmap failed");
291 PerlMemShared_free(slab);
293 if (slab == PL_OpSlab) {
300 * In the following definition, the ", (OP*)0" is just to make the compiler
301 * think the expression is of the right type: croak actually does a Siglongjmp.
303 #define CHECKOP(type,o) \
304 ((PL_op_mask && PL_op_mask[type]) \
305 ? ( op_free((OP*)o), \
306 Perl_croak(aTHX_ "'%s' trapped by operation mask", PL_op_desc[type]), \
308 : CALL_FPTR(PL_check[type])(aTHX_ (OP*)o))
310 #define RETURN_UNLIMITED_NUMBER (PERL_INT_MAX / 2)
313 S_gv_ename(pTHX_ GV *gv)
315 SV* const tmpsv = sv_newmortal();
317 PERL_ARGS_ASSERT_GV_ENAME;
319 gv_efullname3(tmpsv, gv, NULL);
320 return SvPV_nolen_const(tmpsv);
324 S_no_fh_allowed(pTHX_ OP *o)
326 PERL_ARGS_ASSERT_NO_FH_ALLOWED;
328 yyerror(Perl_form(aTHX_ "Missing comma after first argument to %s function",
334 S_too_few_arguments(pTHX_ OP *o, const char *name)
336 PERL_ARGS_ASSERT_TOO_FEW_ARGUMENTS;
338 yyerror(Perl_form(aTHX_ "Not enough arguments for %s", name));
343 S_too_many_arguments(pTHX_ OP *o, const char *name)
345 PERL_ARGS_ASSERT_TOO_MANY_ARGUMENTS;
347 yyerror(Perl_form(aTHX_ "Too many arguments for %s", name));
352 S_bad_type(pTHX_ I32 n, const char *t, const char *name, const OP *kid)
354 PERL_ARGS_ASSERT_BAD_TYPE;
356 yyerror(Perl_form(aTHX_ "Type of arg %d to %s must be %s (not %s)",
357 (int)n, name, t, OP_DESC(kid)));
361 S_no_bareword_allowed(pTHX_ const OP *o)
363 PERL_ARGS_ASSERT_NO_BAREWORD_ALLOWED;
366 return; /* various ok barewords are hidden in extra OP_NULL */
367 qerror(Perl_mess(aTHX_
368 "Bareword \"%"SVf"\" not allowed while \"strict subs\" in use",
372 /* "register" allocation */
375 Perl_allocmy(pTHX_ const char *const name, const STRLEN len, const U32 flags)
379 const bool is_our = (PL_parser->in_my == KEY_our);
381 PERL_ARGS_ASSERT_ALLOCMY;
384 Perl_croak(aTHX_ "panic: allocmy illegal flag bits 0x%" UVxf,
387 /* Until we're using the length for real, cross check that we're being
389 assert(strlen(name) == len);
391 /* complain about "my $<special_var>" etc etc */
395 (USE_UTF8_IN_NAMES && UTF8_IS_START(name[1])) ||
396 (name[1] == '_' && (*name == '$' || len > 2))))
398 /* name[2] is true if strlen(name) > 2 */
399 if (!isPRINT(name[1]) || strchr("\t\n\r\f", name[1])) {
400 yyerror(Perl_form(aTHX_ "Can't use global %c^%c%.*s in \"%s\"",
401 name[0], toCTRL(name[1]), (int)(len - 2), name + 2,
402 PL_parser->in_my == KEY_state ? "state" : "my"));
404 yyerror(Perl_form(aTHX_ "Can't use global %.*s in \"%s\"", (int) len, name,
405 PL_parser->in_my == KEY_state ? "state" : "my"));
409 /* allocate a spare slot and store the name in that slot */
411 off = pad_add_name(name, len,
412 is_our ? padadd_OUR :
413 PL_parser->in_my == KEY_state ? padadd_STATE : 0,
414 PL_parser->in_my_stash,
416 /* $_ is always in main::, even with our */
417 ? (PL_curstash && !strEQ(name,"$_") ? PL_curstash : PL_defstash)
421 /* anon sub prototypes contains state vars should always be cloned,
422 * otherwise the state var would be shared between anon subs */
424 if (PL_parser->in_my == KEY_state && CvANON(PL_compcv))
425 CvCLONE_on(PL_compcv);
430 /* free the body of an op without examining its contents.
431 * Always use this rather than FreeOp directly */
434 S_op_destroy(pTHX_ OP *o)
436 if (o->op_latefree) {
444 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a,b)
446 # define forget_pmop(a,b) S_forget_pmop(aTHX_ a)
452 Perl_op_free(pTHX_ OP *o)
459 if (o->op_latefreed) {
466 if (o->op_private & OPpREFCOUNTED) {
477 refcnt = OpREFCNT_dec(o);
480 /* Need to find and remove any pattern match ops from the list
481 we maintain for reset(). */
482 find_and_forget_pmops(o);
492 /* Call the op_free hook if it has been set. Do it now so that it's called
493 * at the right time for refcounted ops, but still before all of the kids
497 if (o->op_flags & OPf_KIDS) {
498 register OP *kid, *nextkid;
499 for (kid = cUNOPo->op_first; kid; kid = nextkid) {
500 nextkid = kid->op_sibling; /* Get before next freeing kid */
505 #ifdef PERL_DEBUG_READONLY_OPS
509 /* COP* is not cleared by op_clear() so that we may track line
510 * numbers etc even after null() */
511 if (type == OP_NEXTSTATE || type == OP_DBSTATE
512 || (type == OP_NULL /* the COP might have been null'ed */
513 && ((OPCODE)o->op_targ == OP_NEXTSTATE
514 || (OPCODE)o->op_targ == OP_DBSTATE))) {
519 type = (OPCODE)o->op_targ;
522 if (o->op_latefree) {
528 #ifdef DEBUG_LEAKING_SCALARS
535 Perl_op_clear(pTHX_ OP *o)
540 PERL_ARGS_ASSERT_OP_CLEAR;
543 /* if (o->op_madprop && o->op_madprop->mad_next)
545 /* FIXME for MAD - if I uncomment these two lines t/op/pack.t fails with
546 "modification of a read only value" for a reason I can't fathom why.
547 It's the "" stringification of $_, where $_ was set to '' in a foreach
548 loop, but it defies simplification into a small test case.
549 However, commenting them out has caused ext/List/Util/t/weak.t to fail
552 mad_free(o->op_madprop);
558 switch (o->op_type) {
559 case OP_NULL: /* Was holding old type, if any. */
560 if (PL_madskills && o->op_targ != OP_NULL) {
561 o->op_type = (Optype)o->op_targ;
566 case OP_ENTEREVAL: /* Was holding hints. */
570 if (!(o->op_flags & OPf_REF)
571 || (PL_check[o->op_type] != MEMBER_TO_FPTR(Perl_ck_ftst)))
577 if (! (o->op_type == OP_AELEMFAST && o->op_flags & OPf_SPECIAL)) {
578 /* not an OP_PADAV replacement */
579 GV *gv = (o->op_type == OP_GV || o->op_type == OP_GVSV)
584 /* It's possible during global destruction that the GV is freed
585 before the optree. Whilst the SvREFCNT_inc is happy to bump from
586 0 to 1 on a freed SV, the corresponding SvREFCNT_dec from 1 to 0
587 will trigger an assertion failure, because the entry to sv_clear
588 checks that the scalar is not already freed. A check of for
589 !SvIS_FREED(gv) turns out to be invalid, because during global
590 destruction the reference count can be forced down to zero
591 (with SVf_BREAK set). In which case raising to 1 and then
592 dropping to 0 triggers cleanup before it should happen. I
593 *think* that this might actually be a general, systematic,
594 weakness of the whole idea of SVf_BREAK, in that code *is*
595 allowed to raise and lower references during global destruction,
596 so any *valid* code that happens to do this during global
597 destruction might well trigger premature cleanup. */
598 bool still_valid = gv && SvREFCNT(gv);
601 SvREFCNT_inc_simple_void(gv);
603 if (cPADOPo->op_padix > 0) {
604 /* No GvIN_PAD_off(cGVOPo_gv) here, because other references
605 * may still exist on the pad */
606 pad_swipe(cPADOPo->op_padix, TRUE);
607 cPADOPo->op_padix = 0;
610 SvREFCNT_dec(cSVOPo->op_sv);
611 cSVOPo->op_sv = NULL;
614 int try_downgrade = SvREFCNT(gv) == 2;
617 gv_try_downgrade(gv);
621 case OP_METHOD_NAMED:
624 SvREFCNT_dec(cSVOPo->op_sv);
625 cSVOPo->op_sv = NULL;
628 Even if op_clear does a pad_free for the target of the op,
629 pad_free doesn't actually remove the sv that exists in the pad;
630 instead it lives on. This results in that it could be reused as
631 a target later on when the pad was reallocated.
634 pad_swipe(o->op_targ,1);
643 if (o->op_flags & (OPf_SPECIAL|OPf_STACKED|OPf_KIDS))
647 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
649 if (cPADOPo->op_padix > 0) {
650 pad_swipe(cPADOPo->op_padix, TRUE);
651 cPADOPo->op_padix = 0;
654 SvREFCNT_dec(cSVOPo->op_sv);
655 cSVOPo->op_sv = NULL;
659 PerlMemShared_free(cPVOPo->op_pv);
660 cPVOPo->op_pv = NULL;
664 op_free(cPMOPo->op_pmreplrootu.op_pmreplroot);
668 if (cPMOPo->op_pmreplrootu.op_pmtargetoff) {
669 /* No GvIN_PAD_off here, because other references may still
670 * exist on the pad */
671 pad_swipe(cPMOPo->op_pmreplrootu.op_pmtargetoff, TRUE);
674 SvREFCNT_dec(MUTABLE_SV(cPMOPo->op_pmreplrootu.op_pmtargetgv));
680 forget_pmop(cPMOPo, 1);
681 cPMOPo->op_pmreplrootu.op_pmreplroot = NULL;
682 /* we use the same protection as the "SAFE" version of the PM_ macros
683 * here since sv_clean_all might release some PMOPs
684 * after PL_regex_padav has been cleared
685 * and the clearing of PL_regex_padav needs to
686 * happen before sv_clean_all
689 if(PL_regex_pad) { /* We could be in destruction */
690 const IV offset = (cPMOPo)->op_pmoffset;
691 ReREFCNT_dec(PM_GETRE(cPMOPo));
692 PL_regex_pad[offset] = &PL_sv_undef;
693 sv_catpvn_nomg(PL_regex_pad[0], (const char *)&offset,
697 ReREFCNT_dec(PM_GETRE(cPMOPo));
698 PM_SETRE(cPMOPo, NULL);
704 if (o->op_targ > 0) {
705 pad_free(o->op_targ);
711 S_cop_free(pTHX_ COP* cop)
713 PERL_ARGS_ASSERT_COP_FREE;
717 if (! specialWARN(cop->cop_warnings))
718 PerlMemShared_free(cop->cop_warnings);
719 Perl_refcounted_he_free(aTHX_ cop->cop_hints_hash);
723 S_forget_pmop(pTHX_ PMOP *const o
729 HV * const pmstash = PmopSTASH(o);
731 PERL_ARGS_ASSERT_FORGET_PMOP;
733 if (pmstash && !SvIS_FREED(pmstash)) {
734 MAGIC * const mg = mg_find((const SV *)pmstash, PERL_MAGIC_symtab);
736 PMOP **const array = (PMOP**) mg->mg_ptr;
737 U32 count = mg->mg_len / sizeof(PMOP**);
742 /* Found it. Move the entry at the end to overwrite it. */
743 array[i] = array[--count];
744 mg->mg_len = count * sizeof(PMOP**);
745 /* Could realloc smaller at this point always, but probably
746 not worth it. Probably worth free()ing if we're the
749 Safefree(mg->mg_ptr);
766 S_find_and_forget_pmops(pTHX_ OP *o)
768 PERL_ARGS_ASSERT_FIND_AND_FORGET_PMOPS;
770 if (o->op_flags & OPf_KIDS) {
771 OP *kid = cUNOPo->op_first;
773 switch (kid->op_type) {
778 forget_pmop((PMOP*)kid, 0);
780 find_and_forget_pmops(kid);
781 kid = kid->op_sibling;
787 Perl_op_null(pTHX_ OP *o)
791 PERL_ARGS_ASSERT_OP_NULL;
793 if (o->op_type == OP_NULL)
797 o->op_targ = o->op_type;
798 o->op_type = OP_NULL;
799 o->op_ppaddr = PL_ppaddr[OP_NULL];
803 Perl_op_refcnt_lock(pTHX)
811 Perl_op_refcnt_unlock(pTHX)
818 /* Contextualizers */
820 #define LINKLIST(o) ((o)->op_next ? (o)->op_next : linklist((OP*)o))
823 S_linklist(pTHX_ OP *o)
827 PERL_ARGS_ASSERT_LINKLIST;
832 /* establish postfix order */
833 first = cUNOPo->op_first;
836 o->op_next = LINKLIST(first);
839 if (kid->op_sibling) {
840 kid->op_next = LINKLIST(kid->op_sibling);
841 kid = kid->op_sibling;
855 S_scalarkids(pTHX_ OP *o)
857 if (o && o->op_flags & OPf_KIDS) {
859 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
866 S_scalarboolean(pTHX_ OP *o)
870 PERL_ARGS_ASSERT_SCALARBOOLEAN;
872 if (o->op_type == OP_SASSIGN && cBINOPo->op_first->op_type == OP_CONST) {
873 if (ckWARN(WARN_SYNTAX)) {
874 const line_t oldline = CopLINE(PL_curcop);
876 if (PL_parser && PL_parser->copline != NOLINE)
877 CopLINE_set(PL_curcop, PL_parser->copline);
878 Perl_warner(aTHX_ packWARN(WARN_SYNTAX), "Found = in conditional, should be ==");
879 CopLINE_set(PL_curcop, oldline);
886 Perl_scalar(pTHX_ OP *o)
891 /* assumes no premature commitment */
892 if (!o || (PL_parser && PL_parser->error_count)
893 || (o->op_flags & OPf_WANT)
894 || o->op_type == OP_RETURN)
899 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_SCALAR;
901 switch (o->op_type) {
903 scalar(cBINOPo->op_first);
908 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
918 if (o->op_flags & OPf_KIDS) {
919 for (kid = cUNOPo->op_first; kid; kid = kid->op_sibling)
925 kid = cLISTOPo->op_first;
927 while ((kid = kid->op_sibling)) {
933 PL_curcop = &PL_compiling;
938 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
944 PL_curcop = &PL_compiling;
947 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of sort in scalar context");
954 Perl_scalarvoid(pTHX_ OP *o)
958 const char* useless = NULL;
962 PERL_ARGS_ASSERT_SCALARVOID;
964 /* trailing mad null ops don't count as "there" for void processing */
966 o->op_type != OP_NULL &&
968 o->op_sibling->op_type == OP_NULL)
971 for (sib = o->op_sibling;
972 sib && sib->op_type == OP_NULL;
973 sib = sib->op_sibling) ;
979 if (o->op_type == OP_NEXTSTATE
980 || o->op_type == OP_DBSTATE
981 || (o->op_type == OP_NULL && (o->op_targ == OP_NEXTSTATE
982 || o->op_targ == OP_DBSTATE)))
983 PL_curcop = (COP*)o; /* for warning below */
985 /* assumes no premature commitment */
986 want = o->op_flags & OPf_WANT;
987 if ((want && want != OPf_WANT_SCALAR)
988 || (PL_parser && PL_parser->error_count)
989 || o->op_type == OP_RETURN || o->op_type == OP_REQUIRE)
994 if ((o->op_private & OPpTARGET_MY)
995 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
997 return scalar(o); /* As if inside SASSIGN */
1000 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_VOID;
1002 switch (o->op_type) {
1004 if (!(PL_opargs[o->op_type] & OA_FOLDCONST))
1008 if (o->op_flags & OPf_STACKED)
1012 if (o->op_private == 4)
1055 case OP_GETSOCKNAME:
1056 case OP_GETPEERNAME:
1061 case OP_GETPRIORITY:
1085 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)))
1086 /* Otherwise it's "Useless use of grep iterator" */
1087 useless = OP_DESC(o);
1091 kid = cLISTOPo->op_first;
1092 if (kid && kid->op_type == OP_PUSHRE
1094 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetoff)
1096 && !((PMOP*)kid)->op_pmreplrootu.op_pmtargetgv)
1098 useless = OP_DESC(o);
1102 kid = cUNOPo->op_first;
1103 if (kid->op_type != OP_MATCH && kid->op_type != OP_SUBST &&
1104 kid->op_type != OP_TRANS) {
1107 useless = "negative pattern binding (!~)";
1114 if (!(o->op_private & (OPpLVAL_INTRO|OPpOUR_INTRO)) &&
1115 (!o->op_sibling || o->op_sibling->op_type != OP_READLINE))
1116 useless = "a variable";
1121 if (cSVOPo->op_private & OPpCONST_STRICT)
1122 no_bareword_allowed(o);
1124 if (ckWARN(WARN_VOID)) {
1126 SV* msv = sv_2mortal(Perl_newSVpvf(aTHX_
1127 "a constant (%"SVf")", sv));
1128 useless = SvPV_nolen(msv);
1131 useless = "a constant (undef)";
1132 if (o->op_private & OPpCONST_ARYBASE)
1134 /* don't warn on optimised away booleans, eg
1135 * use constant Foo, 5; Foo || print; */
1136 if (cSVOPo->op_private & OPpCONST_SHORTCIRCUIT)
1138 /* the constants 0 and 1 are permitted as they are
1139 conventionally used as dummies in constructs like
1140 1 while some_condition_with_side_effects; */
1141 else if (SvNIOK(sv) && (SvNV(sv) == 0.0 || SvNV(sv) == 1.0))
1143 else if (SvPOK(sv)) {
1144 /* perl4's way of mixing documentation and code
1145 (before the invention of POD) was based on a
1146 trick to mix nroff and perl code. The trick was
1147 built upon these three nroff macros being used in
1148 void context. The pink camel has the details in
1149 the script wrapman near page 319. */
1150 const char * const maybe_macro = SvPVX_const(sv);
1151 if (strnEQ(maybe_macro, "di", 2) ||
1152 strnEQ(maybe_macro, "ds", 2) ||
1153 strnEQ(maybe_macro, "ig", 2))
1158 op_null(o); /* don't execute or even remember it */
1162 o->op_type = OP_PREINC; /* pre-increment is faster */
1163 o->op_ppaddr = PL_ppaddr[OP_PREINC];
1167 o->op_type = OP_PREDEC; /* pre-decrement is faster */
1168 o->op_ppaddr = PL_ppaddr[OP_PREDEC];
1172 o->op_type = OP_I_PREINC; /* pre-increment is faster */
1173 o->op_ppaddr = PL_ppaddr[OP_I_PREINC];
1177 o->op_type = OP_I_PREDEC; /* pre-decrement is faster */
1178 o->op_ppaddr = PL_ppaddr[OP_I_PREDEC];
1183 kid = cLOGOPo->op_first;
1184 if (kid->op_type == OP_NOT
1185 && (kid->op_flags & OPf_KIDS)
1187 if (o->op_type == OP_AND) {
1189 o->op_ppaddr = PL_ppaddr[OP_OR];
1191 o->op_type = OP_AND;
1192 o->op_ppaddr = PL_ppaddr[OP_AND];
1201 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1206 if (o->op_flags & OPf_STACKED)
1213 if (!(o->op_flags & OPf_KIDS))
1224 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1234 Perl_ck_warner(aTHX_ packWARN(WARN_VOID), "Useless use of %s in void context", useless);
1239 S_listkids(pTHX_ OP *o)
1241 if (o && o->op_flags & OPf_KIDS) {
1243 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1250 Perl_list(pTHX_ OP *o)
1255 /* assumes no premature commitment */
1256 if (!o || (o->op_flags & OPf_WANT)
1257 || (PL_parser && PL_parser->error_count)
1258 || o->op_type == OP_RETURN)
1263 if ((o->op_private & OPpTARGET_MY)
1264 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1266 return o; /* As if inside SASSIGN */
1269 o->op_flags = (o->op_flags & ~OPf_WANT) | OPf_WANT_LIST;
1271 switch (o->op_type) {
1274 list(cBINOPo->op_first);
1279 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1287 if (!(o->op_flags & OPf_KIDS))
1289 if (!o->op_next && cUNOPo->op_first->op_type == OP_FLOP) {
1290 list(cBINOPo->op_first);
1291 return gen_constant_list(o);
1298 kid = cLISTOPo->op_first;
1300 while ((kid = kid->op_sibling)) {
1301 if (kid->op_sibling)
1306 PL_curcop = &PL_compiling;
1310 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1311 if (kid->op_sibling)
1316 PL_curcop = &PL_compiling;
1323 S_scalarseq(pTHX_ OP *o)
1327 const OPCODE type = o->op_type;
1329 if (type == OP_LINESEQ || type == OP_SCOPE ||
1330 type == OP_LEAVE || type == OP_LEAVETRY)
1333 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling) {
1334 if (kid->op_sibling) {
1338 PL_curcop = &PL_compiling;
1340 o->op_flags &= ~OPf_PARENS;
1341 if (PL_hints & HINT_BLOCK_SCOPE)
1342 o->op_flags |= OPf_PARENS;
1345 o = newOP(OP_STUB, 0);
1350 S_modkids(pTHX_ OP *o, I32 type)
1352 if (o && o->op_flags & OPf_KIDS) {
1354 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1360 /* Propagate lvalue ("modifiable") context to an op and its children.
1361 * 'type' represents the context type, roughly based on the type of op that
1362 * would do the modifying, although local() is represented by OP_NULL.
1363 * It's responsible for detecting things that can't be modified, flag
1364 * things that need to behave specially in an lvalue context (e.g., "$$x = 5"
1365 * might have to vivify a reference in $x), and so on.
1367 * For example, "$a+1 = 2" would cause mod() to be called with o being
1368 * OP_ADD and type being OP_SASSIGN, and would output an error.
1372 Perl_mod(pTHX_ OP *o, I32 type)
1376 /* -1 = error on localize, 0 = ignore localize, 1 = ok to localize */
1379 if (!o || (PL_parser && PL_parser->error_count))
1382 if ((o->op_private & OPpTARGET_MY)
1383 && (PL_opargs[o->op_type] & OA_TARGLEX))/* OPp share the meaning */
1388 switch (o->op_type) {
1394 if (!(o->op_private & OPpCONST_ARYBASE))
1397 if (PL_eval_start && PL_eval_start->op_type == OP_CONST) {
1398 CopARYBASE_set(&PL_compiling,
1399 (I32)SvIV(cSVOPx(PL_eval_start)->op_sv));
1403 SAVECOPARYBASE(&PL_compiling);
1404 CopARYBASE_set(&PL_compiling, 0);
1406 else if (type == OP_REFGEN)
1409 Perl_croak(aTHX_ "That use of $[ is unsupported");
1412 if ((o->op_flags & OPf_PARENS) || PL_madskills)
1416 if ((type == OP_UNDEF || type == OP_REFGEN) &&
1417 !(o->op_flags & OPf_STACKED)) {
1418 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1419 /* The default is to set op_private to the number of children,
1420 which for a UNOP such as RV2CV is always 1. And w're using
1421 the bit for a flag in RV2CV, so we need it clear. */
1422 o->op_private &= ~1;
1423 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1424 assert(cUNOPo->op_first->op_type == OP_NULL);
1425 op_null(((LISTOP*)cUNOPo->op_first)->op_first);/* disable pushmark */
1428 else if (o->op_private & OPpENTERSUB_NOMOD)
1430 else { /* lvalue subroutine call */
1431 o->op_private |= OPpLVAL_INTRO;
1432 PL_modcount = RETURN_UNLIMITED_NUMBER;
1433 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN) {
1434 /* Backward compatibility mode: */
1435 o->op_private |= OPpENTERSUB_INARGS;
1438 else { /* Compile-time error message: */
1439 OP *kid = cUNOPo->op_first;
1443 if (kid->op_type != OP_PUSHMARK) {
1444 if (kid->op_type != OP_NULL || kid->op_targ != OP_LIST)
1446 "panic: unexpected lvalue entersub "
1447 "args: type/targ %ld:%"UVuf,
1448 (long)kid->op_type, (UV)kid->op_targ);
1449 kid = kLISTOP->op_first;
1451 while (kid->op_sibling)
1452 kid = kid->op_sibling;
1453 if (!(kid->op_type == OP_NULL && kid->op_targ == OP_RV2CV)) {
1455 if (kid->op_type == OP_METHOD_NAMED
1456 || kid->op_type == OP_METHOD)
1460 NewOp(1101, newop, 1, UNOP);
1461 newop->op_type = OP_RV2CV;
1462 newop->op_ppaddr = PL_ppaddr[OP_RV2CV];
1463 newop->op_first = NULL;
1464 newop->op_next = (OP*)newop;
1465 kid->op_sibling = (OP*)newop;
1466 newop->op_private |= OPpLVAL_INTRO;
1467 newop->op_private &= ~1;
1471 if (kid->op_type != OP_RV2CV)
1473 "panic: unexpected lvalue entersub "
1474 "entry via type/targ %ld:%"UVuf,
1475 (long)kid->op_type, (UV)kid->op_targ);
1476 kid->op_private |= OPpLVAL_INTRO;
1477 break; /* Postpone until runtime */
1481 kid = kUNOP->op_first;
1482 if (kid->op_type == OP_NULL && kid->op_targ == OP_RV2SV)
1483 kid = kUNOP->op_first;
1484 if (kid->op_type == OP_NULL)
1486 "Unexpected constant lvalue entersub "
1487 "entry via type/targ %ld:%"UVuf,
1488 (long)kid->op_type, (UV)kid->op_targ);
1489 if (kid->op_type != OP_GV) {
1490 /* Restore RV2CV to check lvalueness */
1492 if (kid->op_next && kid->op_next != kid) { /* Happens? */
1493 okid->op_next = kid->op_next;
1494 kid->op_next = okid;
1497 okid->op_next = NULL;
1498 okid->op_type = OP_RV2CV;
1500 okid->op_ppaddr = PL_ppaddr[OP_RV2CV];
1501 okid->op_private |= OPpLVAL_INTRO;
1502 okid->op_private &= ~1;
1506 cv = GvCV(kGVOP_gv);
1516 /* grep, foreach, subcalls, refgen */
1517 if (type == OP_GREPSTART || type == OP_ENTERSUB || type == OP_REFGEN)
1519 yyerror(Perl_form(aTHX_ "Can't modify %s in %s",
1520 (o->op_type == OP_NULL && (o->op_flags & OPf_SPECIAL)
1522 : (o->op_type == OP_ENTERSUB
1523 ? "non-lvalue subroutine call"
1525 type ? PL_op_desc[type] : "local"));
1539 case OP_RIGHT_SHIFT:
1548 if (!(o->op_flags & OPf_STACKED))
1555 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1561 if (type == OP_REFGEN && o->op_flags & OPf_PARENS) {
1562 PL_modcount = RETURN_UNLIMITED_NUMBER;
1563 return o; /* Treat \(@foo) like ordinary list. */
1567 if (scalar_mod_type(o, type))
1569 ref(cUNOPo->op_first, o->op_type);
1573 if (type == OP_LEAVESUBLV)
1574 o->op_private |= OPpMAYBE_LVSUB;
1580 PL_modcount = RETURN_UNLIMITED_NUMBER;
1583 PL_hints |= HINT_BLOCK_SCOPE;
1584 if (type == OP_LEAVESUBLV)
1585 o->op_private |= OPpMAYBE_LVSUB;
1589 ref(cUNOPo->op_first, o->op_type);
1593 PL_hints |= HINT_BLOCK_SCOPE;
1608 PL_modcount = RETURN_UNLIMITED_NUMBER;
1609 if (type == OP_REFGEN && o->op_flags & OPf_PARENS)
1610 return o; /* Treat \(@foo) like ordinary list. */
1611 if (scalar_mod_type(o, type))
1613 if (type == OP_LEAVESUBLV)
1614 o->op_private |= OPpMAYBE_LVSUB;
1618 if (!type) /* local() */
1619 Perl_croak(aTHX_ "Can't localize lexical variable %s",
1620 PAD_COMPNAME_PV(o->op_targ));
1628 if (type != OP_SASSIGN)
1632 if (o->op_private == 4) /* don't allow 4 arg substr as lvalue */
1637 if (type == OP_LEAVESUBLV)
1638 o->op_private |= OPpMAYBE_LVSUB;
1640 pad_free(o->op_targ);
1641 o->op_targ = pad_alloc(o->op_type, SVs_PADMY);
1642 assert(SvTYPE(PAD_SV(o->op_targ)) == SVt_NULL);
1643 if (o->op_flags & OPf_KIDS)
1644 mod(cBINOPo->op_first->op_sibling, type);
1649 ref(cBINOPo->op_first, o->op_type);
1650 if (type == OP_ENTERSUB &&
1651 !(o->op_private & (OPpLVAL_INTRO | OPpDEREF)))
1652 o->op_private |= OPpLVAL_DEFER;
1653 if (type == OP_LEAVESUBLV)
1654 o->op_private |= OPpMAYBE_LVSUB;
1664 if (o->op_flags & OPf_KIDS)
1665 mod(cLISTOPo->op_last, type);
1670 if (o->op_flags & OPf_SPECIAL) /* do BLOCK */
1672 else if (!(o->op_flags & OPf_KIDS))
1674 if (o->op_targ != OP_LIST) {
1675 mod(cBINOPo->op_first, type);
1681 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1686 if (type != OP_LEAVESUBLV)
1688 break; /* mod()ing was handled by ck_return() */
1691 /* [20011101.069] File test operators interpret OPf_REF to mean that
1692 their argument is a filehandle; thus \stat(".") should not set
1694 if (type == OP_REFGEN &&
1695 PL_check[o->op_type] == MEMBER_TO_FPTR(Perl_ck_ftst))
1698 if (type != OP_LEAVESUBLV)
1699 o->op_flags |= OPf_MOD;
1701 if (type == OP_AASSIGN || type == OP_SASSIGN)
1702 o->op_flags |= OPf_SPECIAL|OPf_REF;
1703 else if (!type) { /* local() */
1706 o->op_private |= OPpLVAL_INTRO;
1707 o->op_flags &= ~OPf_SPECIAL;
1708 PL_hints |= HINT_BLOCK_SCOPE;
1713 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
1714 "Useless localization of %s", OP_DESC(o));
1717 else if (type != OP_GREPSTART && type != OP_ENTERSUB
1718 && type != OP_LEAVESUBLV)
1719 o->op_flags |= OPf_REF;
1724 S_scalar_mod_type(const OP *o, I32 type)
1726 PERL_ARGS_ASSERT_SCALAR_MOD_TYPE;
1730 if (o->op_type == OP_RV2GV)
1754 case OP_RIGHT_SHIFT:
1774 S_is_handle_constructor(const OP *o, I32 numargs)
1776 PERL_ARGS_ASSERT_IS_HANDLE_CONSTRUCTOR;
1778 switch (o->op_type) {
1786 case OP_SELECT: /* XXX c.f. SelectSaver.pm */
1799 S_refkids(pTHX_ OP *o, I32 type)
1801 if (o && o->op_flags & OPf_KIDS) {
1803 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
1810 Perl_doref(pTHX_ OP *o, I32 type, bool set_op_ref)
1815 PERL_ARGS_ASSERT_DOREF;
1817 if (!o || (PL_parser && PL_parser->error_count))
1820 switch (o->op_type) {
1822 if ((type == OP_EXISTS || type == OP_DEFINED || type == OP_LOCK) &&
1823 !(o->op_flags & OPf_STACKED)) {
1824 o->op_type = OP_RV2CV; /* entersub => rv2cv */
1825 o->op_ppaddr = PL_ppaddr[OP_RV2CV];
1826 assert(cUNOPo->op_first->op_type == OP_NULL);
1827 op_null(((LISTOP*)cUNOPo->op_first)->op_first); /* disable pushmark */
1828 o->op_flags |= OPf_SPECIAL;
1829 o->op_private &= ~1;
1834 for (kid = cUNOPo->op_first->op_sibling; kid; kid = kid->op_sibling)
1835 doref(kid, type, set_op_ref);
1838 if (type == OP_DEFINED)
1839 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1840 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1843 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1844 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1845 : type == OP_RV2HV ? OPpDEREF_HV
1847 o->op_flags |= OPf_MOD;
1854 o->op_flags |= OPf_REF;
1857 if (type == OP_DEFINED)
1858 o->op_flags |= OPf_SPECIAL; /* don't create GV */
1859 doref(cUNOPo->op_first, o->op_type, set_op_ref);
1865 o->op_flags |= OPf_REF;
1870 if (!(o->op_flags & OPf_KIDS))
1872 doref(cBINOPo->op_first, type, set_op_ref);
1876 doref(cBINOPo->op_first, o->op_type, set_op_ref);
1877 if (type == OP_RV2SV || type == OP_RV2AV || type == OP_RV2HV) {
1878 o->op_private |= (type == OP_RV2AV ? OPpDEREF_AV
1879 : type == OP_RV2HV ? OPpDEREF_HV
1881 o->op_flags |= OPf_MOD;
1891 if (!(o->op_flags & OPf_KIDS))
1893 doref(cLISTOPo->op_last, type, set_op_ref);
1903 S_dup_attrlist(pTHX_ OP *o)
1908 PERL_ARGS_ASSERT_DUP_ATTRLIST;
1910 /* An attrlist is either a simple OP_CONST or an OP_LIST with kids,
1911 * where the first kid is OP_PUSHMARK and the remaining ones
1912 * are OP_CONST. We need to push the OP_CONST values.
1914 if (o->op_type == OP_CONST)
1915 rop = newSVOP(OP_CONST, o->op_flags, SvREFCNT_inc_NN(cSVOPo->op_sv));
1917 else if (o->op_type == OP_NULL)
1921 assert((o->op_type == OP_LIST) && (o->op_flags & OPf_KIDS));
1923 for (o = cLISTOPo->op_first; o; o=o->op_sibling) {
1924 if (o->op_type == OP_CONST)
1925 rop = append_elem(OP_LIST, rop,
1926 newSVOP(OP_CONST, o->op_flags,
1927 SvREFCNT_inc_NN(cSVOPo->op_sv)));
1934 S_apply_attrs(pTHX_ HV *stash, SV *target, OP *attrs, bool for_my)
1939 PERL_ARGS_ASSERT_APPLY_ATTRS;
1941 /* fake up C<use attributes $pkg,$rv,@attrs> */
1942 ENTER; /* need to protect against side-effects of 'use' */
1943 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1945 #define ATTRSMODULE "attributes"
1946 #define ATTRSMODULE_PM "attributes.pm"
1949 /* Don't force the C<use> if we don't need it. */
1950 SV * const * const svp = hv_fetchs(GvHVn(PL_incgv), ATTRSMODULE_PM, FALSE);
1951 if (svp && *svp != &PL_sv_undef)
1952 NOOP; /* already in %INC */
1954 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
1955 newSVpvs(ATTRSMODULE), NULL);
1958 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
1959 newSVpvs(ATTRSMODULE),
1961 prepend_elem(OP_LIST,
1962 newSVOP(OP_CONST, 0, stashsv),
1963 prepend_elem(OP_LIST,
1964 newSVOP(OP_CONST, 0,
1966 dup_attrlist(attrs))));
1972 S_apply_attrs_my(pTHX_ HV *stash, OP *target, OP *attrs, OP **imopsp)
1975 OP *pack, *imop, *arg;
1978 PERL_ARGS_ASSERT_APPLY_ATTRS_MY;
1983 assert(target->op_type == OP_PADSV ||
1984 target->op_type == OP_PADHV ||
1985 target->op_type == OP_PADAV);
1987 /* Ensure that attributes.pm is loaded. */
1988 apply_attrs(stash, PAD_SV(target->op_targ), attrs, TRUE);
1990 /* Need package name for method call. */
1991 pack = newSVOP(OP_CONST, 0, newSVpvs(ATTRSMODULE));
1993 /* Build up the real arg-list. */
1994 stashsv = stash ? newSVhek(HvNAME_HEK(stash)) : &PL_sv_no;
1996 arg = newOP(OP_PADSV, 0);
1997 arg->op_targ = target->op_targ;
1998 arg = prepend_elem(OP_LIST,
1999 newSVOP(OP_CONST, 0, stashsv),
2000 prepend_elem(OP_LIST,
2001 newUNOP(OP_REFGEN, 0,
2002 mod(arg, OP_REFGEN)),
2003 dup_attrlist(attrs)));
2005 /* Fake up a method call to import */
2006 meth = newSVpvs_share("import");
2007 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL|OPf_WANT_VOID,
2008 append_elem(OP_LIST,
2009 prepend_elem(OP_LIST, pack, list(arg)),
2010 newSVOP(OP_METHOD_NAMED, 0, meth)));
2011 imop->op_private |= OPpENTERSUB_NOMOD;
2013 /* Combine the ops. */
2014 *imopsp = append_elem(OP_LIST, *imopsp, imop);
2018 =notfor apidoc apply_attrs_string
2020 Attempts to apply a list of attributes specified by the C<attrstr> and
2021 C<len> arguments to the subroutine identified by the C<cv> argument which
2022 is expected to be associated with the package identified by the C<stashpv>
2023 argument (see L<attributes>). It gets this wrong, though, in that it
2024 does not correctly identify the boundaries of the individual attribute
2025 specifications within C<attrstr>. This is not really intended for the
2026 public API, but has to be listed here for systems such as AIX which
2027 need an explicit export list for symbols. (It's called from XS code
2028 in support of the C<ATTRS:> keyword from F<xsubpp>.) Patches to fix it
2029 to respect attribute syntax properly would be welcome.
2035 Perl_apply_attrs_string(pTHX_ const char *stashpv, CV *cv,
2036 const char *attrstr, STRLEN len)
2040 PERL_ARGS_ASSERT_APPLY_ATTRS_STRING;
2043 len = strlen(attrstr);
2047 for (; isSPACE(*attrstr) && len; --len, ++attrstr) ;
2049 const char * const sstr = attrstr;
2050 for (; !isSPACE(*attrstr) && len; --len, ++attrstr) ;
2051 attrs = append_elem(OP_LIST, attrs,
2052 newSVOP(OP_CONST, 0,
2053 newSVpvn(sstr, attrstr-sstr)));
2057 Perl_load_module(aTHX_ PERL_LOADMOD_IMPORT_OPS,
2058 newSVpvs(ATTRSMODULE),
2059 NULL, prepend_elem(OP_LIST,
2060 newSVOP(OP_CONST, 0, newSVpv(stashpv,0)),
2061 prepend_elem(OP_LIST,
2062 newSVOP(OP_CONST, 0,
2063 newRV(MUTABLE_SV(cv))),
2068 S_my_kid(pTHX_ OP *o, OP *attrs, OP **imopsp)
2073 PERL_ARGS_ASSERT_MY_KID;
2075 if (!o || (PL_parser && PL_parser->error_count))
2079 if (PL_madskills && type == OP_NULL && o->op_flags & OPf_KIDS) {
2080 (void)my_kid(cUNOPo->op_first, attrs, imopsp);
2084 if (type == OP_LIST) {
2086 for (kid = cLISTOPo->op_first; kid; kid = kid->op_sibling)
2087 my_kid(kid, attrs, imopsp);
2088 } else if (type == OP_UNDEF
2094 } else if (type == OP_RV2SV || /* "our" declaration */
2096 type == OP_RV2HV) { /* XXX does this let anything illegal in? */
2097 if (cUNOPo->op_first->op_type != OP_GV) { /* MJD 20011224 */
2098 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2100 PL_parser->in_my == KEY_our
2102 : PL_parser->in_my == KEY_state ? "state" : "my"));
2104 GV * const gv = cGVOPx_gv(cUNOPo->op_first);
2105 PL_parser->in_my = FALSE;
2106 PL_parser->in_my_stash = NULL;
2107 apply_attrs(GvSTASH(gv),
2108 (type == OP_RV2SV ? GvSV(gv) :
2109 type == OP_RV2AV ? MUTABLE_SV(GvAV(gv)) :
2110 type == OP_RV2HV ? MUTABLE_SV(GvHV(gv)) : MUTABLE_SV(gv)),
2113 o->op_private |= OPpOUR_INTRO;
2116 else if (type != OP_PADSV &&
2119 type != OP_PUSHMARK)
2121 yyerror(Perl_form(aTHX_ "Can't declare %s in \"%s\"",
2123 PL_parser->in_my == KEY_our
2125 : PL_parser->in_my == KEY_state ? "state" : "my"));
2128 else if (attrs && type != OP_PUSHMARK) {
2131 PL_parser->in_my = FALSE;
2132 PL_parser->in_my_stash = NULL;
2134 /* check for C<my Dog $spot> when deciding package */
2135 stash = PAD_COMPNAME_TYPE(o->op_targ);
2137 stash = PL_curstash;
2138 apply_attrs_my(stash, o, attrs, imopsp);
2140 o->op_flags |= OPf_MOD;
2141 o->op_private |= OPpLVAL_INTRO;
2142 if (PL_parser->in_my == KEY_state)
2143 o->op_private |= OPpPAD_STATE;
2148 Perl_my_attrs(pTHX_ OP *o, OP *attrs)
2152 int maybe_scalar = 0;
2154 PERL_ARGS_ASSERT_MY_ATTRS;
2156 /* [perl #17376]: this appears to be premature, and results in code such as
2157 C< our(%x); > executing in list mode rather than void mode */
2159 if (o->op_flags & OPf_PARENS)
2169 o = my_kid(o, attrs, &rops);
2171 if (maybe_scalar && o->op_type == OP_PADSV) {
2172 o = scalar(append_list(OP_LIST, (LISTOP*)rops, (LISTOP*)o));
2173 o->op_private |= OPpLVAL_INTRO;
2176 o = append_list(OP_LIST, (LISTOP*)o, (LISTOP*)rops);
2178 PL_parser->in_my = FALSE;
2179 PL_parser->in_my_stash = NULL;
2184 Perl_sawparens(pTHX_ OP *o)
2186 PERL_UNUSED_CONTEXT;
2188 o->op_flags |= OPf_PARENS;
2193 Perl_bind_match(pTHX_ I32 type, OP *left, OP *right)
2197 const OPCODE ltype = left->op_type;
2198 const OPCODE rtype = right->op_type;
2200 PERL_ARGS_ASSERT_BIND_MATCH;
2202 if ( (ltype == OP_RV2AV || ltype == OP_RV2HV || ltype == OP_PADAV
2203 || ltype == OP_PADHV) && ckWARN(WARN_MISC))
2205 const char * const desc
2206 = PL_op_desc[(rtype == OP_SUBST || rtype == OP_TRANS)
2207 ? (int)rtype : OP_MATCH];
2208 const char * const sample = ((ltype == OP_RV2AV || ltype == OP_PADAV)
2209 ? "@array" : "%hash");
2210 Perl_warner(aTHX_ packWARN(WARN_MISC),
2211 "Applying %s to %s will act on scalar(%s)",
2212 desc, sample, sample);
2215 if (rtype == OP_CONST &&
2216 cSVOPx(right)->op_private & OPpCONST_BARE &&
2217 cSVOPx(right)->op_private & OPpCONST_STRICT)
2219 no_bareword_allowed(right);
2222 ismatchop = rtype == OP_MATCH ||
2223 rtype == OP_SUBST ||
2225 if (ismatchop && right->op_private & OPpTARGET_MY) {
2227 right->op_private &= ~OPpTARGET_MY;
2229 if (!(right->op_flags & OPf_STACKED) && ismatchop) {
2232 right->op_flags |= OPf_STACKED;
2233 if (rtype != OP_MATCH &&
2234 ! (rtype == OP_TRANS &&
2235 right->op_private & OPpTRANS_IDENTICAL))
2236 newleft = mod(left, rtype);
2239 if (right->op_type == OP_TRANS)
2240 o = newBINOP(OP_NULL, OPf_STACKED, scalar(newleft), right);
2242 o = prepend_elem(rtype, scalar(newleft), right);
2244 return newUNOP(OP_NOT, 0, scalar(o));
2248 return bind_match(type, left,
2249 pmruntime(newPMOP(OP_MATCH, 0), right, 0));
2253 Perl_invert(pTHX_ OP *o)
2257 return newUNOP(OP_NOT, OPf_SPECIAL, scalar(o));
2261 Perl_scope(pTHX_ OP *o)
2265 if (o->op_flags & OPf_PARENS || PERLDB_NOOPT || PL_tainting) {
2266 o = prepend_elem(OP_LINESEQ, newOP(OP_ENTER, 0), o);
2267 o->op_type = OP_LEAVE;
2268 o->op_ppaddr = PL_ppaddr[OP_LEAVE];
2270 else if (o->op_type == OP_LINESEQ) {
2272 o->op_type = OP_SCOPE;
2273 o->op_ppaddr = PL_ppaddr[OP_SCOPE];
2274 kid = ((LISTOP*)o)->op_first;
2275 if (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE) {
2278 /* The following deals with things like 'do {1 for 1}' */
2279 kid = kid->op_sibling;
2281 (kid->op_type == OP_NEXTSTATE || kid->op_type == OP_DBSTATE))
2286 o = newLISTOP(OP_SCOPE, 0, o, NULL);
2292 Perl_block_start(pTHX_ int full)
2295 const int retval = PL_savestack_ix;
2296 pad_block_start(full);
2298 PL_hints &= ~HINT_BLOCK_SCOPE;
2299 SAVECOMPILEWARNINGS();
2300 PL_compiling.cop_warnings = DUP_WARNINGS(PL_compiling.cop_warnings);
2305 Perl_block_end(pTHX_ I32 floor, OP *seq)
2308 const int needblockscope = PL_hints & HINT_BLOCK_SCOPE;
2309 OP* const retval = scalarseq(seq);
2311 CopHINTS_set(&PL_compiling, PL_hints);
2313 PL_hints |= HINT_BLOCK_SCOPE; /* propagate out */
2322 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
2323 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
2324 return newSVREF(newGVOP(OP_GV, 0, PL_defgv));
2327 OP * const o = newOP(OP_PADSV, 0);
2328 o->op_targ = offset;
2334 Perl_newPROG(pTHX_ OP *o)
2338 PERL_ARGS_ASSERT_NEWPROG;
2343 PL_eval_root = newUNOP(OP_LEAVEEVAL,
2344 ((PL_in_eval & EVAL_KEEPERR)
2345 ? OPf_SPECIAL : 0), o);
2346 PL_eval_start = linklist(PL_eval_root);
2347 PL_eval_root->op_private |= OPpREFCOUNTED;
2348 OpREFCNT_set(PL_eval_root, 1);
2349 PL_eval_root->op_next = 0;
2350 CALL_PEEP(PL_eval_start);
2353 if (o->op_type == OP_STUB) {
2354 PL_comppad_name = 0;
2356 S_op_destroy(aTHX_ o);
2359 PL_main_root = scope(sawparens(scalarvoid(o)));
2360 PL_curcop = &PL_compiling;
2361 PL_main_start = LINKLIST(PL_main_root);
2362 PL_main_root->op_private |= OPpREFCOUNTED;
2363 OpREFCNT_set(PL_main_root, 1);
2364 PL_main_root->op_next = 0;
2365 CALL_PEEP(PL_main_start);
2368 /* Register with debugger */
2370 CV * const cv = get_cvs("DB::postponed", 0);
2374 XPUSHs(MUTABLE_SV(CopFILEGV(&PL_compiling)));
2376 call_sv(MUTABLE_SV(cv), G_DISCARD);
2383 Perl_localize(pTHX_ OP *o, I32 lex)
2387 PERL_ARGS_ASSERT_LOCALIZE;
2389 if (o->op_flags & OPf_PARENS)
2390 /* [perl #17376]: this appears to be premature, and results in code such as
2391 C< our(%x); > executing in list mode rather than void mode */
2398 if ( PL_parser->bufptr > PL_parser->oldbufptr
2399 && PL_parser->bufptr[-1] == ','
2400 && ckWARN(WARN_PARENTHESIS))
2402 char *s = PL_parser->bufptr;
2405 /* some heuristics to detect a potential error */
2406 while (*s && (strchr(", \t\n", *s)))
2410 if (*s && strchr("@$%*", *s) && *++s
2411 && (isALNUM(*s) || UTF8_IS_CONTINUED(*s))) {
2414 while (*s && (isALNUM(*s) || UTF8_IS_CONTINUED(*s)))
2416 while (*s && (strchr(", \t\n", *s)))
2422 if (sigil && (*s == ';' || *s == '=')) {
2423 Perl_warner(aTHX_ packWARN(WARN_PARENTHESIS),
2424 "Parentheses missing around \"%s\" list",
2426 ? (PL_parser->in_my == KEY_our
2428 : PL_parser->in_my == KEY_state
2438 o = mod(o, OP_NULL); /* a bit kludgey */
2439 PL_parser->in_my = FALSE;
2440 PL_parser->in_my_stash = NULL;
2445 Perl_jmaybe(pTHX_ OP *o)
2447 PERL_ARGS_ASSERT_JMAYBE;
2449 if (o->op_type == OP_LIST) {
2451 = newSVREF(newGVOP(OP_GV, 0, gv_fetchpvs(";", GV_ADD|GV_NOTQUAL, SVt_PV)));
2452 o = convert(OP_JOIN, 0, prepend_elem(OP_LIST, o2, o));
2458 S_fold_constants(pTHX_ register OP *o)
2461 register OP * VOL curop;
2463 VOL I32 type = o->op_type;
2468 SV * const oldwarnhook = PL_warnhook;
2469 SV * const olddiehook = PL_diehook;
2473 PERL_ARGS_ASSERT_FOLD_CONSTANTS;
2475 if (PL_opargs[type] & OA_RETSCALAR)
2477 if (PL_opargs[type] & OA_TARGET && !o->op_targ)
2478 o->op_targ = pad_alloc(type, SVs_PADTMP);
2480 /* integerize op, unless it happens to be C<-foo>.
2481 * XXX should pp_i_negate() do magic string negation instead? */
2482 if ((PL_opargs[type] & OA_OTHERINT) && (PL_hints & HINT_INTEGER)
2483 && !(type == OP_NEGATE && cUNOPo->op_first->op_type == OP_CONST
2484 && (cUNOPo->op_first->op_private & OPpCONST_BARE)))
2486 o->op_ppaddr = PL_ppaddr[type = ++(o->op_type)];
2489 if (!(PL_opargs[type] & OA_FOLDCONST))
2494 /* XXX might want a ck_negate() for this */
2495 cUNOPo->op_first->op_private &= ~OPpCONST_STRICT;
2506 /* XXX what about the numeric ops? */
2507 if (PL_hints & HINT_LOCALE)
2512 if (PL_parser && PL_parser->error_count)
2513 goto nope; /* Don't try to run w/ errors */
2515 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
2516 const OPCODE type = curop->op_type;
2517 if ((type != OP_CONST || (curop->op_private & OPpCONST_BARE)) &&
2519 type != OP_SCALAR &&
2521 type != OP_PUSHMARK)
2527 curop = LINKLIST(o);
2528 old_next = o->op_next;
2532 oldscope = PL_scopestack_ix;
2533 create_eval_scope(G_FAKINGEVAL);
2535 /* Verify that we don't need to save it: */
2536 assert(PL_curcop == &PL_compiling);
2537 StructCopy(&PL_compiling, ¬_compiling, COP);
2538 PL_curcop = ¬_compiling;
2539 /* The above ensures that we run with all the correct hints of the
2540 currently compiling COP, but that IN_PERL_RUNTIME is not true. */
2541 assert(IN_PERL_RUNTIME);
2542 PL_warnhook = PERL_WARNHOOK_FATAL;
2549 sv = *(PL_stack_sp--);
2550 if (o->op_targ && sv == PAD_SV(o->op_targ)) /* grab pad temp? */
2551 pad_swipe(o->op_targ, FALSE);
2552 else if (SvTEMP(sv)) { /* grab mortal temp? */
2553 SvREFCNT_inc_simple_void(sv);
2558 /* Something tried to die. Abandon constant folding. */
2559 /* Pretend the error never happened. */
2561 o->op_next = old_next;
2565 /* Don't expect 1 (setjmp failed) or 2 (something called my_exit) */
2566 PL_warnhook = oldwarnhook;
2567 PL_diehook = olddiehook;
2568 /* XXX note that this croak may fail as we've already blown away
2569 * the stack - eg any nested evals */
2570 Perl_croak(aTHX_ "panic: fold_constants JMPENV_PUSH returned %d", ret);
2573 PL_warnhook = oldwarnhook;
2574 PL_diehook = olddiehook;
2575 PL_curcop = &PL_compiling;
2577 if (PL_scopestack_ix > oldscope)
2578 delete_eval_scope();
2587 if (type == OP_RV2GV)
2588 newop = newGVOP(OP_GV, 0, MUTABLE_GV(sv));
2590 newop = newSVOP(OP_CONST, 0, MUTABLE_SV(sv));
2591 op_getmad(o,newop,'f');
2599 S_gen_constant_list(pTHX_ register OP *o)
2603 const I32 oldtmps_floor = PL_tmps_floor;
2606 if (PL_parser && PL_parser->error_count)
2607 return o; /* Don't attempt to run with errors */
2609 PL_op = curop = LINKLIST(o);
2615 assert (!(curop->op_flags & OPf_SPECIAL));
2616 assert(curop->op_type == OP_RANGE);
2618 PL_tmps_floor = oldtmps_floor;
2620 o->op_type = OP_RV2AV;
2621 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
2622 o->op_flags &= ~OPf_REF; /* treat \(1..2) like an ordinary list */
2623 o->op_flags |= OPf_PARENS; /* and flatten \(1..2,3) */
2624 o->op_opt = 0; /* needs to be revisited in peep() */
2625 curop = ((UNOP*)o)->op_first;
2626 ((UNOP*)o)->op_first = newSVOP(OP_CONST, 0, SvREFCNT_inc_NN(*PL_stack_sp--));
2628 op_getmad(curop,o,'O');
2637 Perl_convert(pTHX_ I32 type, I32 flags, OP *o)
2640 if (!o || o->op_type != OP_LIST)
2641 o = newLISTOP(OP_LIST, 0, o, NULL);
2643 o->op_flags &= ~OPf_WANT;
2645 if (!(PL_opargs[type] & OA_MARK))
2646 op_null(cLISTOPo->op_first);
2648 o->op_type = (OPCODE)type;
2649 o->op_ppaddr = PL_ppaddr[type];
2650 o->op_flags |= flags;
2652 o = CHECKOP(type, o);
2653 if (o->op_type != (unsigned)type)
2656 return fold_constants(o);
2659 /* List constructors */
2662 Perl_append_elem(pTHX_ I32 type, OP *first, OP *last)
2670 if (first->op_type != (unsigned)type
2671 || (type == OP_LIST && (first->op_flags & OPf_PARENS)))
2673 return newLISTOP(type, 0, first, last);
2676 if (first->op_flags & OPf_KIDS)
2677 ((LISTOP*)first)->op_last->op_sibling = last;
2679 first->op_flags |= OPf_KIDS;
2680 ((LISTOP*)first)->op_first = last;
2682 ((LISTOP*)first)->op_last = last;
2687 Perl_append_list(pTHX_ I32 type, LISTOP *first, LISTOP *last)
2695 if (first->op_type != (unsigned)type)
2696 return prepend_elem(type, (OP*)first, (OP*)last);
2698 if (last->op_type != (unsigned)type)
2699 return append_elem(type, (OP*)first, (OP*)last);
2701 first->op_last->op_sibling = last->op_first;
2702 first->op_last = last->op_last;
2703 first->op_flags |= (last->op_flags & OPf_KIDS);
2706 if (last->op_first && first->op_madprop) {
2707 MADPROP *mp = last->op_first->op_madprop;
2709 while (mp->mad_next)
2711 mp->mad_next = first->op_madprop;
2714 last->op_first->op_madprop = first->op_madprop;
2717 first->op_madprop = last->op_madprop;
2718 last->op_madprop = 0;
2721 S_op_destroy(aTHX_ (OP*)last);
2727 Perl_prepend_elem(pTHX_ I32 type, OP *first, OP *last)
2735 if (last->op_type == (unsigned)type) {
2736 if (type == OP_LIST) { /* already a PUSHMARK there */
2737 first->op_sibling = ((LISTOP*)last)->op_first->op_sibling;
2738 ((LISTOP*)last)->op_first->op_sibling = first;
2739 if (!(first->op_flags & OPf_PARENS))
2740 last->op_flags &= ~OPf_PARENS;
2743 if (!(last->op_flags & OPf_KIDS)) {
2744 ((LISTOP*)last)->op_last = first;
2745 last->op_flags |= OPf_KIDS;
2747 first->op_sibling = ((LISTOP*)last)->op_first;
2748 ((LISTOP*)last)->op_first = first;
2750 last->op_flags |= OPf_KIDS;
2754 return newLISTOP(type, 0, first, last);
2762 Perl_newTOKEN(pTHX_ I32 optype, YYSTYPE lval, MADPROP* madprop)
2765 Newxz(tk, 1, TOKEN);
2766 tk->tk_type = (OPCODE)optype;
2767 tk->tk_type = 12345;
2769 tk->tk_mad = madprop;
2774 Perl_token_free(pTHX_ TOKEN* tk)
2776 PERL_ARGS_ASSERT_TOKEN_FREE;
2778 if (tk->tk_type != 12345)
2780 mad_free(tk->tk_mad);
2785 Perl_token_getmad(pTHX_ TOKEN* tk, OP* o, char slot)
2790 PERL_ARGS_ASSERT_TOKEN_GETMAD;
2792 if (tk->tk_type != 12345) {
2793 Perl_warner(aTHX_ packWARN(WARN_MISC),
2794 "Invalid TOKEN object ignored");
2801 /* faked up qw list? */
2803 tm->mad_type == MAD_SV &&
2804 SvPVX((SV *)tm->mad_val)[0] == 'q')
2811 /* pretend constant fold didn't happen? */
2812 if (mp->mad_key == 'f' &&
2813 (o->op_type == OP_CONST ||
2814 o->op_type == OP_GV) )
2816 token_getmad(tk,(OP*)mp->mad_val,slot);
2830 if (mp->mad_key == 'X')
2831 mp->mad_key = slot; /* just change the first one */
2841 Perl_op_getmad_weak(pTHX_ OP* from, OP* o, char slot)
2850 /* pretend constant fold didn't happen? */
2851 if (mp->mad_key == 'f' &&
2852 (o->op_type == OP_CONST ||
2853 o->op_type == OP_GV) )
2855 op_getmad(from,(OP*)mp->mad_val,slot);
2862 mp->mad_next = newMADPROP(slot,MAD_OP,from,0);
2865 o->op_madprop = newMADPROP(slot,MAD_OP,from,0);
2871 Perl_op_getmad(pTHX_ OP* from, OP* o, char slot)
2880 /* pretend constant fold didn't happen? */
2881 if (mp->mad_key == 'f' &&
2882 (o->op_type == OP_CONST ||
2883 o->op_type == OP_GV) )
2885 op_getmad(from,(OP*)mp->mad_val,slot);
2892 mp->mad_next = newMADPROP(slot,MAD_OP,from,1);
2895 o->op_madprop = newMADPROP(slot,MAD_OP,from,1);
2899 PerlIO_printf(PerlIO_stderr(),
2900 "DESTROYING op = %0"UVxf"\n", PTR2UV(from));
2906 Perl_prepend_madprops(pTHX_ MADPROP* mp, OP* o, char slot)
2924 Perl_append_madprops(pTHX_ MADPROP* tm, OP* o, char slot)
2928 addmad(tm, &(o->op_madprop), slot);
2932 Perl_addmad(pTHX_ MADPROP* tm, MADPROP** root, char slot)
2953 Perl_newMADsv(pTHX_ char key, SV* sv)
2955 PERL_ARGS_ASSERT_NEWMADSV;
2957 return newMADPROP(key, MAD_SV, sv, 0);
2961 Perl_newMADPROP(pTHX_ char key, char type, void* val, I32 vlen)
2964 Newxz(mp, 1, MADPROP);
2967 mp->mad_vlen = vlen;
2968 mp->mad_type = type;
2970 /* PerlIO_printf(PerlIO_stderr(), "NEW mp = %0x\n", mp); */
2975 Perl_mad_free(pTHX_ MADPROP* mp)
2977 /* PerlIO_printf(PerlIO_stderr(), "FREE mp = %0x\n", mp); */
2981 mad_free(mp->mad_next);
2982 /* if (PL_parser && PL_parser->lex_state != LEX_NOTPARSING && mp->mad_vlen)
2983 PerlIO_printf(PerlIO_stderr(), "DESTROYING '%c'=<%s>\n", mp->mad_key & 255, mp->mad_val); */
2984 switch (mp->mad_type) {
2988 Safefree((char*)mp->mad_val);
2991 if (mp->mad_vlen) /* vlen holds "strong/weak" boolean */
2992 op_free((OP*)mp->mad_val);
2995 sv_free(MUTABLE_SV(mp->mad_val));
2998 PerlIO_printf(PerlIO_stderr(), "Unrecognized mad\n");
3007 Perl_newNULLLIST(pTHX)
3009 return newOP(OP_STUB, 0);
3013 S_force_list(pTHX_ OP *o)
3015 if (!o || o->op_type != OP_LIST)
3016 o = newLISTOP(OP_LIST, 0, o, NULL);
3022 Perl_newLISTOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3027 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LISTOP);
3029 NewOp(1101, listop, 1, LISTOP);
3031 listop->op_type = (OPCODE)type;
3032 listop->op_ppaddr = PL_ppaddr[type];
3035 listop->op_flags = (U8)flags;
3039 else if (!first && last)
3042 first->op_sibling = last;
3043 listop->op_first = first;
3044 listop->op_last = last;
3045 if (type == OP_LIST) {
3046 OP* const pushop = newOP(OP_PUSHMARK, 0);
3047 pushop->op_sibling = first;
3048 listop->op_first = pushop;
3049 listop->op_flags |= OPf_KIDS;
3051 listop->op_last = pushop;
3054 return CHECKOP(type, listop);
3058 Perl_newOP(pTHX_ I32 type, I32 flags)
3063 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP
3064 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3065 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3066 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3068 NewOp(1101, o, 1, OP);
3069 o->op_type = (OPCODE)type;
3070 o->op_ppaddr = PL_ppaddr[type];
3071 o->op_flags = (U8)flags;
3073 o->op_latefreed = 0;
3077 o->op_private = (U8)(0 | (flags >> 8));
3078 if (PL_opargs[type] & OA_RETSCALAR)
3080 if (PL_opargs[type] & OA_TARGET)
3081 o->op_targ = pad_alloc(type, SVs_PADTMP);
3082 return CHECKOP(type, o);
3086 Perl_newUNOP(pTHX_ I32 type, I32 flags, OP *first)
3091 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_UNOP
3092 || (PL_opargs[type] & OA_CLASS_MASK) == OA_BASEOP_OR_UNOP
3093 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP
3094 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP
3095 || type == OP_SASSIGN
3096 || type == OP_ENTERTRY
3097 || type == OP_NULL );
3100 first = newOP(OP_STUB, 0);
3101 if (PL_opargs[type] & OA_MARK)
3102 first = force_list(first);
3104 NewOp(1101, unop, 1, UNOP);
3105 unop->op_type = (OPCODE)type;
3106 unop->op_ppaddr = PL_ppaddr[type];
3107 unop->op_first = first;
3108 unop->op_flags = (U8)(flags | OPf_KIDS);
3109 unop->op_private = (U8)(1 | (flags >> 8));
3110 unop = (UNOP*) CHECKOP(type, unop);
3114 return fold_constants((OP *) unop);
3118 Perl_newBINOP(pTHX_ I32 type, I32 flags, OP *first, OP *last)
3123 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_BINOP
3124 || type == OP_SASSIGN || type == OP_NULL );
3126 NewOp(1101, binop, 1, BINOP);
3129 first = newOP(OP_NULL, 0);
3131 binop->op_type = (OPCODE)type;
3132 binop->op_ppaddr = PL_ppaddr[type];
3133 binop->op_first = first;
3134 binop->op_flags = (U8)(flags | OPf_KIDS);
3137 binop->op_private = (U8)(1 | (flags >> 8));
3140 binop->op_private = (U8)(2 | (flags >> 8));
3141 first->op_sibling = last;
3144 binop = (BINOP*)CHECKOP(type, binop);
3145 if (binop->op_next || binop->op_type != (OPCODE)type)
3148 binop->op_last = binop->op_first->op_sibling;
3150 return fold_constants((OP *)binop);
3153 static int uvcompare(const void *a, const void *b)
3154 __attribute__nonnull__(1)
3155 __attribute__nonnull__(2)
3156 __attribute__pure__;
3157 static int uvcompare(const void *a, const void *b)
3159 if (*((const UV *)a) < (*(const UV *)b))
3161 if (*((const UV *)a) > (*(const UV *)b))
3163 if (*((const UV *)a+1) < (*(const UV *)b+1))
3165 if (*((const UV *)a+1) > (*(const UV *)b+1))
3171 S_pmtrans(pTHX_ OP *o, OP *expr, OP *repl)
3174 SV * const tstr = ((SVOP*)expr)->op_sv;
3177 (repl->op_type == OP_NULL)
3178 ? ((SVOP*)((LISTOP*)repl)->op_first)->op_sv :
3180 ((SVOP*)repl)->op_sv;
3183 const U8 *t = (U8*)SvPV_const(tstr, tlen);
3184 const U8 *r = (U8*)SvPV_const(rstr, rlen);
3188 register short *tbl;
3190 const I32 complement = o->op_private & OPpTRANS_COMPLEMENT;
3191 const I32 squash = o->op_private & OPpTRANS_SQUASH;
3192 I32 del = o->op_private & OPpTRANS_DELETE;
3195 PERL_ARGS_ASSERT_PMTRANS;
3197 PL_hints |= HINT_BLOCK_SCOPE;
3200 o->op_private |= OPpTRANS_FROM_UTF;
3203 o->op_private |= OPpTRANS_TO_UTF;
3205 if (o->op_private & (OPpTRANS_FROM_UTF|OPpTRANS_TO_UTF)) {
3206 SV* const listsv = newSVpvs("# comment\n");
3208 const U8* tend = t + tlen;
3209 const U8* rend = r + rlen;
3223 const I32 from_utf = o->op_private & OPpTRANS_FROM_UTF;
3224 const I32 to_utf = o->op_private & OPpTRANS_TO_UTF;
3227 const U32 flags = UTF8_ALLOW_DEFAULT;
3231 t = tsave = bytes_to_utf8(t, &len);
3234 if (!to_utf && rlen) {
3236 r = rsave = bytes_to_utf8(r, &len);
3240 /* There are several snags with this code on EBCDIC:
3241 1. 0xFF is a legal UTF-EBCDIC byte (there are no illegal bytes).
3242 2. scan_const() in toke.c has encoded chars in native encoding which makes
3243 ranges at least in EBCDIC 0..255 range the bottom odd.
3247 U8 tmpbuf[UTF8_MAXBYTES+1];
3250 Newx(cp, 2*tlen, UV);
3252 transv = newSVpvs("");
3254 cp[2*i] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3256 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) {
3258 cp[2*i+1] = utf8n_to_uvuni(t, tend-t, &ulen, flags);
3262 cp[2*i+1] = cp[2*i];
3266 qsort(cp, i, 2*sizeof(UV), uvcompare);
3267 for (j = 0; j < i; j++) {
3269 diff = val - nextmin;
3271 t = uvuni_to_utf8(tmpbuf,nextmin);
3272 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3274 U8 range_mark = UTF_TO_NATIVE(0xff);
3275 t = uvuni_to_utf8(tmpbuf, val - 1);
3276 sv_catpvn(transv, (char *)&range_mark, 1);
3277 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3284 t = uvuni_to_utf8(tmpbuf,nextmin);
3285 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3287 U8 range_mark = UTF_TO_NATIVE(0xff);
3288 sv_catpvn(transv, (char *)&range_mark, 1);
3290 t = uvuni_to_utf8_flags(tmpbuf, 0x7fffffff,
3291 UNICODE_ALLOW_SUPER);
3292 sv_catpvn(transv, (char*)tmpbuf, t - tmpbuf);
3293 t = (const U8*)SvPVX_const(transv);
3294 tlen = SvCUR(transv);
3298 else if (!rlen && !del) {
3299 r = t; rlen = tlen; rend = tend;
3302 if ((!rlen && !del) || t == r ||
3303 (tlen == rlen && memEQ((char *)t, (char *)r, tlen)))
3305 o->op_private |= OPpTRANS_IDENTICAL;
3309 while (t < tend || tfirst <= tlast) {
3310 /* see if we need more "t" chars */
3311 if (tfirst > tlast) {
3312 tfirst = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3314 if (t < tend && NATIVE_TO_UTF(*t) == 0xff) { /* illegal utf8 val indicates range */
3316 tlast = (I32)utf8n_to_uvuni(t, tend - t, &ulen, flags);
3323 /* now see if we need more "r" chars */
3324 if (rfirst > rlast) {
3326 rfirst = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3328 if (r < rend && NATIVE_TO_UTF(*r) == 0xff) { /* illegal utf8 val indicates range */
3330 rlast = (I32)utf8n_to_uvuni(r, rend - r, &ulen, flags);
3339 rfirst = rlast = 0xffffffff;
3343 /* now see which range will peter our first, if either. */
3344 tdiff = tlast - tfirst;
3345 rdiff = rlast - rfirst;
3352 if (rfirst == 0xffffffff) {
3353 diff = tdiff; /* oops, pretend rdiff is infinite */
3355 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\tXXXX\n",
3356 (long)tfirst, (long)tlast);
3358 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\tXXXX\n", (long)tfirst);
3362 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t%04lx\t%04lx\n",
3363 (long)tfirst, (long)(tfirst + diff),
3366 Perl_sv_catpvf(aTHX_ listsv, "%04lx\t\t%04lx\n",
3367 (long)tfirst, (long)rfirst);
3369 if (rfirst + diff > max)
3370 max = rfirst + diff;
3372 grows = (tfirst < rfirst &&
3373 UNISKIP(tfirst) < UNISKIP(rfirst + diff));
3385 else if (max > 0xff)
3390 PerlMemShared_free(cPVOPo->op_pv);
3391 cPVOPo->op_pv = NULL;
3393 swash = MUTABLE_SV(swash_init("utf8", "", listsv, bits, none));
3395 cPADOPo->op_padix = pad_alloc(OP_TRANS, SVs_PADTMP);
3396 SvREFCNT_dec(PAD_SVl(cPADOPo->op_padix));
3397 PAD_SETSV(cPADOPo->op_padix, swash);
3399 SvREADONLY_on(swash);
3401 cSVOPo->op_sv = swash;
3403 SvREFCNT_dec(listsv);
3404 SvREFCNT_dec(transv);
3406 if (!del && havefinal && rlen)
3407 (void)hv_store(MUTABLE_HV(SvRV(swash)), "FINAL", 5,
3408 newSVuv((UV)final), 0);
3411 o->op_private |= OPpTRANS_GROWS;
3417 op_getmad(expr,o,'e');
3418 op_getmad(repl,o,'r');
3426 tbl = (short*)cPVOPo->op_pv;
3428 Zero(tbl, 256, short);
3429 for (i = 0; i < (I32)tlen; i++)
3431 for (i = 0, j = 0; i < 256; i++) {
3433 if (j >= (I32)rlen) {
3442 if (i < 128 && r[j] >= 128)
3452 o->op_private |= OPpTRANS_IDENTICAL;
3454 else if (j >= (I32)rlen)
3459 PerlMemShared_realloc(tbl,
3460 (0x101+rlen-j) * sizeof(short));
3461 cPVOPo->op_pv = (char*)tbl;
3463 tbl[0x100] = (short)(rlen - j);
3464 for (i=0; i < (I32)rlen - j; i++)
3465 tbl[0x101+i] = r[j+i];
3469 if (!rlen && !del) {
3472 o->op_private |= OPpTRANS_IDENTICAL;
3474 else if (!squash && rlen == tlen && memEQ((char*)t, (char*)r, tlen)) {
3475 o->op_private |= OPpTRANS_IDENTICAL;
3477 for (i = 0; i < 256; i++)
3479 for (i = 0, j = 0; i < (I32)tlen; i++,j++) {
3480 if (j >= (I32)rlen) {
3482 if (tbl[t[i]] == -1)
3488 if (tbl[t[i]] == -1) {
3489 if (t[i] < 128 && r[j] >= 128)
3496 if(del && rlen == tlen) {
3497 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Useless use of /d modifier in transliteration operator");
3498 } else if(rlen > tlen) {
3499 Perl_ck_warner(aTHX_ packWARN(WARN_MISC), "Replacement list is longer than search list");
3503 o->op_private |= OPpTRANS_GROWS;
3505 op_getmad(expr,o,'e');
3506 op_getmad(repl,o,'r');
3516 Perl_newPMOP(pTHX_ I32 type, I32 flags)
3521 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PMOP);
3523 NewOp(1101, pmop, 1, PMOP);
3524 pmop->op_type = (OPCODE)type;
3525 pmop->op_ppaddr = PL_ppaddr[type];
3526 pmop->op_flags = (U8)flags;
3527 pmop->op_private = (U8)(0 | (flags >> 8));
3529 if (PL_hints & HINT_RE_TAINT)
3530 pmop->op_pmflags |= PMf_RETAINT;
3531 if (PL_hints & HINT_LOCALE)
3532 pmop->op_pmflags |= PMf_LOCALE;
3536 assert(SvPOK(PL_regex_pad[0]));
3537 if (SvCUR(PL_regex_pad[0])) {
3538 /* Pop off the "packed" IV from the end. */
3539 SV *const repointer_list = PL_regex_pad[0];
3540 const char *p = SvEND(repointer_list) - sizeof(IV);
3541 const IV offset = *((IV*)p);
3543 assert(SvCUR(repointer_list) % sizeof(IV) == 0);
3545 SvEND_set(repointer_list, p);
3547 pmop->op_pmoffset = offset;
3548 /* This slot should be free, so assert this: */
3549 assert(PL_regex_pad[offset] == &PL_sv_undef);
3551 SV * const repointer = &PL_sv_undef;
3552 av_push(PL_regex_padav, repointer);
3553 pmop->op_pmoffset = av_len(PL_regex_padav);
3554 PL_regex_pad = AvARRAY(PL_regex_padav);
3558 return CHECKOP(type, pmop);
3561 /* Given some sort of match op o, and an expression expr containing a
3562 * pattern, either compile expr into a regex and attach it to o (if it's
3563 * constant), or convert expr into a runtime regcomp op sequence (if it's
3566 * isreg indicates that the pattern is part of a regex construct, eg
3567 * $x =~ /pattern/ or split /pattern/, as opposed to $x =~ $pattern or
3568 * split "pattern", which aren't. In the former case, expr will be a list
3569 * if the pattern contains more than one term (eg /a$b/) or if it contains
3570 * a replacement, ie s/// or tr///.
3574 Perl_pmruntime(pTHX_ OP *o, OP *expr, bool isreg)
3579 I32 repl_has_vars = 0;
3583 PERL_ARGS_ASSERT_PMRUNTIME;
3585 if (o->op_type == OP_SUBST || o->op_type == OP_TRANS) {
3586 /* last element in list is the replacement; pop it */
3588 repl = cLISTOPx(expr)->op_last;
3589 kid = cLISTOPx(expr)->op_first;
3590 while (kid->op_sibling != repl)
3591 kid = kid->op_sibling;
3592 kid->op_sibling = NULL;
3593 cLISTOPx(expr)->op_last = kid;
3596 if (isreg && expr->op_type == OP_LIST &&
3597 cLISTOPx(expr)->op_first->op_sibling == cLISTOPx(expr)->op_last)
3599 /* convert single element list to element */
3600 OP* const oe = expr;
3601 expr = cLISTOPx(oe)->op_first->op_sibling;
3602 cLISTOPx(oe)->op_first->op_sibling = NULL;
3603 cLISTOPx(oe)->op_last = NULL;
3607 if (o->op_type == OP_TRANS) {
3608 return pmtrans(o, expr, repl);
3611 reglist = isreg && expr->op_type == OP_LIST;
3615 PL_hints |= HINT_BLOCK_SCOPE;
3618 if (expr->op_type == OP_CONST) {
3619 SV *pat = ((SVOP*)expr)->op_sv;
3620 U32 pm_flags = pm->op_pmflags & PMf_COMPILETIME;
3622 if (o->op_flags & OPf_SPECIAL)
3623 pm_flags |= RXf_SPLIT;
3626 assert (SvUTF8(pat));
3627 } else if (SvUTF8(pat)) {
3628 /* Not doing UTF-8, despite what the SV says. Is this only if we're
3629 trapped in use 'bytes'? */
3630 /* Make a copy of the octet sequence, but without the flag on, as
3631 the compiler now honours the SvUTF8 flag on pat. */
3633 const char *const p = SvPV(pat, len);
3634 pat = newSVpvn_flags(p, len, SVs_TEMP);
3637 PM_SETRE(pm, CALLREGCOMP(pat, pm_flags));
3640 op_getmad(expr,(OP*)pm,'e');
3646 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL))
3647 expr = newUNOP((!(PL_hints & HINT_RE_EVAL)
3649 : OP_REGCMAYBE),0,expr);
3651 NewOp(1101, rcop, 1, LOGOP);
3652 rcop->op_type = OP_REGCOMP;
3653 rcop->op_ppaddr = PL_ppaddr[OP_REGCOMP];
3654 rcop->op_first = scalar(expr);
3655 rcop->op_flags |= OPf_KIDS
3656 | ((PL_hints & HINT_RE_EVAL) ? OPf_SPECIAL : 0)
3657 | (reglist ? OPf_STACKED : 0);
3658 rcop->op_private = 1;
3661 rcop->op_targ = pad_alloc(rcop->op_type, SVs_PADTMP);
3663 /* /$x/ may cause an eval, since $x might be qr/(?{..})/ */
3666 /* establish postfix order */
3667 if (pm->op_pmflags & PMf_KEEP || !(PL_hints & HINT_RE_EVAL)) {
3669 rcop->op_next = expr;
3670 ((UNOP*)expr)->op_first->op_next = (OP*)rcop;
3673 rcop->op_next = LINKLIST(expr);
3674 expr->op_next = (OP*)rcop;
3677 prepend_elem(o->op_type, scalar((OP*)rcop), o);
3682 if (pm->op_pmflags & PMf_EVAL) {
3684 if (CopLINE(PL_curcop) < (line_t)PL_parser->multi_end)
3685 CopLINE_set(PL_curcop, (line_t)PL_parser->multi_end);
3687 else if (repl->op_type == OP_CONST)
3691 for (curop = LINKLIST(repl); curop!=repl; curop = LINKLIST(curop)) {
3692 if (curop->op_type == OP_SCOPE
3693 || curop->op_type == OP_LEAVE
3694 || (PL_opargs[curop->op_type] & OA_DANGEROUS)) {
3695 if (curop->op_type == OP_GV) {
3696 GV * const gv = cGVOPx_gv(curop);
3698 if (strchr("&`'123456789+-\016\022", *GvENAME(gv)))
3701 else if (curop->op_type == OP_RV2CV)
3703 else if (curop->op_type == OP_RV2SV ||
3704 curop->op_type == OP_RV2AV ||
3705 curop->op_type == OP_RV2HV ||
3706 curop->op_type == OP_RV2GV) {
3707 if (lastop && lastop->op_type != OP_GV) /*funny deref?*/
3710 else if (curop->op_type == OP_PADSV ||
3711 curop->op_type == OP_PADAV ||
3712 curop->op_type == OP_PADHV ||
3713 curop->op_type == OP_PADANY)
3717 else if (curop->op_type == OP_PUSHRE)
3718 NOOP; /* Okay here, dangerous in newASSIGNOP */
3728 || RX_EXTFLAGS(PM_GETRE(pm)) & RXf_EVAL_SEEN)))
3730 pm->op_pmflags |= PMf_CONST; /* const for long enough */
3731 prepend_elem(o->op_type, scalar(repl), o);
3734 if (curop == repl && !PM_GETRE(pm)) { /* Has variables. */
3735 pm->op_pmflags |= PMf_MAYBE_CONST;
3737 NewOp(1101, rcop, 1, LOGOP);
3738 rcop->op_type = OP_SUBSTCONT;
3739 rcop->op_ppaddr = PL_ppaddr[OP_SUBSTCONT];
3740 rcop->op_first = scalar(repl);
3741 rcop->op_flags |= OPf_KIDS;
3742 rcop->op_private = 1;
3745 /* establish postfix order */
3746 rcop->op_next = LINKLIST(repl);
3747 repl->op_next = (OP*)rcop;
3749 pm->op_pmreplrootu.op_pmreplroot = scalar((OP*)rcop);
3750 assert(!(pm->op_pmflags & PMf_ONCE));
3751 pm->op_pmstashstartu.op_pmreplstart = LINKLIST(rcop);
3760 Perl_newSVOP(pTHX_ I32 type, I32 flags, SV *sv)
3765 PERL_ARGS_ASSERT_NEWSVOP;
3767 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
3768 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
3769 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
3771 NewOp(1101, svop, 1, SVOP);
3772 svop->op_type = (OPCODE)type;
3773 svop->op_ppaddr = PL_ppaddr[type];
3775 svop->op_next = (OP*)svop;
3776 svop->op_flags = (U8)flags;
3777 if (PL_opargs[type] & OA_RETSCALAR)
3779 if (PL_opargs[type] & OA_TARGET)
3780 svop->op_targ = pad_alloc(type, SVs_PADTMP);
3781 return CHECKOP(type, svop);
3786 Perl_newPADOP(pTHX_ I32 type, I32 flags, SV *sv)
3791 PERL_ARGS_ASSERT_NEWPADOP;
3793 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_SVOP
3794 || (PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
3795 || (PL_opargs[type] & OA_CLASS_MASK) == OA_FILESTATOP);
3797 NewOp(1101, padop, 1, PADOP);
3798 padop->op_type = (OPCODE)type;
3799 padop->op_ppaddr = PL_ppaddr[type];
3800 padop->op_padix = pad_alloc(type, SVs_PADTMP);
3801 SvREFCNT_dec(PAD_SVl(padop->op_padix));
3802 PAD_SETSV(padop->op_padix, sv);
3805 padop->op_next = (OP*)padop;
3806 padop->op_flags = (U8)flags;
3807 if (PL_opargs[type] & OA_RETSCALAR)
3809 if (PL_opargs[type] & OA_TARGET)
3810 padop->op_targ = pad_alloc(type, SVs_PADTMP);
3811 return CHECKOP(type, padop);
3816 Perl_newGVOP(pTHX_ I32 type, I32 flags, GV *gv)
3820 PERL_ARGS_ASSERT_NEWGVOP;
3824 return newPADOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3826 return newSVOP(type, flags, SvREFCNT_inc_simple_NN(gv));
3831 Perl_newPVOP(pTHX_ I32 type, I32 flags, char *pv)
3836 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_PVOP_OR_SVOP
3837 || (PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
3839 NewOp(1101, pvop, 1, PVOP);
3840 pvop->op_type = (OPCODE)type;
3841 pvop->op_ppaddr = PL_ppaddr[type];
3843 pvop->op_next = (OP*)pvop;
3844 pvop->op_flags = (U8)flags;
3845 if (PL_opargs[type] & OA_RETSCALAR)
3847 if (PL_opargs[type] & OA_TARGET)
3848 pvop->op_targ = pad_alloc(type, SVs_PADTMP);
3849 return CHECKOP(type, pvop);
3857 Perl_package(pTHX_ OP *o)
3860 SV *const sv = cSVOPo->op_sv;
3865 PERL_ARGS_ASSERT_PACKAGE;
3867 save_hptr(&PL_curstash);
3868 save_item(PL_curstname);
3870 PL_curstash = gv_stashsv(sv, GV_ADD);
3872 sv_setsv(PL_curstname, sv);
3874 PL_hints |= HINT_BLOCK_SCOPE;
3875 PL_parser->copline = NOLINE;
3876 PL_parser->expect = XSTATE;
3881 if (!PL_madskills) {
3886 pegop = newOP(OP_NULL,0);
3887 op_getmad(o,pegop,'P');
3893 Perl_package_version( pTHX_ OP *v )
3896 U32 savehints = PL_hints;
3897 PERL_ARGS_ASSERT_PACKAGE_VERSION;
3898 PL_hints &= ~HINT_STRICT_VARS;
3899 sv_setsv( GvSV(gv_fetchpvs("VERSION", GV_ADDMULTI, SVt_PV)), cSVOPx(v)->op_sv );
3900 PL_hints = savehints;
3909 Perl_utilize(pTHX_ int aver, I32 floor, OP *version, OP *idop, OP *arg)
3916 OP *pegop = newOP(OP_NULL,0);
3919 PERL_ARGS_ASSERT_UTILIZE;
3921 if (idop->op_type != OP_CONST)
3922 Perl_croak(aTHX_ "Module name must be constant");
3925 op_getmad(idop,pegop,'U');
3930 SV * const vesv = ((SVOP*)version)->op_sv;
3933 op_getmad(version,pegop,'V');
3934 if (!arg && !SvNIOKp(vesv)) {
3941 if (version->op_type != OP_CONST || !SvNIOKp(vesv))
3942 Perl_croak(aTHX_ "Version number must be a constant number");
3944 /* Make copy of idop so we don't free it twice */
3945 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3947 /* Fake up a method call to VERSION */
3948 meth = newSVpvs_share("VERSION");
3949 veop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3950 append_elem(OP_LIST,
3951 prepend_elem(OP_LIST, pack, list(version)),
3952 newSVOP(OP_METHOD_NAMED, 0, meth)));
3956 /* Fake up an import/unimport */
3957 if (arg && arg->op_type == OP_STUB) {
3959 op_getmad(arg,pegop,'S');
3960 imop = arg; /* no import on explicit () */
3962 else if (SvNIOKp(((SVOP*)idop)->op_sv)) {
3963 imop = NULL; /* use 5.0; */
3965 idop->op_private |= OPpCONST_NOVER;
3971 op_getmad(arg,pegop,'A');
3973 /* Make copy of idop so we don't free it twice */
3974 pack = newSVOP(OP_CONST, 0, newSVsv(((SVOP*)idop)->op_sv));
3976 /* Fake up a method call to import/unimport */
3978 ? newSVpvs_share("import") : newSVpvs_share("unimport");
3979 imop = convert(OP_ENTERSUB, OPf_STACKED|OPf_SPECIAL,
3980 append_elem(OP_LIST,
3981 prepend_elem(OP_LIST, pack, list(arg)),
3982 newSVOP(OP_METHOD_NAMED, 0, meth)));
3985 /* Fake up the BEGIN {}, which does its thing immediately. */
3987 newSVOP(OP_CONST, 0, newSVpvs_share("BEGIN")),
3990 append_elem(OP_LINESEQ,
3991 append_elem(OP_LINESEQ,
3992 newSTATEOP(0, NULL, newUNOP(OP_REQUIRE, 0, idop)),
3993 newSTATEOP(0, NULL, veop)),
3994 newSTATEOP(0, NULL, imop) ));
3996 /* The "did you use incorrect case?" warning used to be here.
3997 * The problem is that on case-insensitive filesystems one
3998 * might get false positives for "use" (and "require"):
3999 * "use Strict" or "require CARP" will work. This causes
4000 * portability problems for the script: in case-strict
4001 * filesystems the script will stop working.
4003 * The "incorrect case" warning checked whether "use Foo"
4004 * imported "Foo" to your namespace, but that is wrong, too:
4005 * there is no requirement nor promise in the language that
4006 * a Foo.pm should or would contain anything in package "Foo".
4008 * There is very little Configure-wise that can be done, either:
4009 * the case-sensitivity of the build filesystem of Perl does not
4010 * help in guessing the case-sensitivity of the runtime environment.
4013 PL_hints |= HINT_BLOCK_SCOPE;
4014 PL_parser->copline = NOLINE;
4015 PL_parser->expect = XSTATE;
4016 PL_cop_seqmax++; /* Purely for B::*'s benefit */
4019 if (!PL_madskills) {
4020 /* FIXME - don't allocate pegop if !PL_madskills */
4029 =head1 Embedding Functions
4031 =for apidoc load_module
4033 Loads the module whose name is pointed to by the string part of name.
4034 Note that the actual module name, not its filename, should be given.
4035 Eg, "Foo::Bar" instead of "Foo/Bar.pm". flags can be any of
4036 PERL_LOADMOD_DENY, PERL_LOADMOD_NOIMPORT, or PERL_LOADMOD_IMPORT_OPS
4037 (or 0 for no flags). ver, if specified, provides version semantics
4038 similar to C<use Foo::Bar VERSION>. The optional trailing SV*
4039 arguments can be used to specify arguments to the module's import()
4040 method, similar to C<use Foo::Bar VERSION LIST>. They must be
4041 terminated with a final NULL pointer. Note that this list can only
4042 be omitted when the PERL_LOADMOD_NOIMPORT flag has been used.
4043 Otherwise at least a single NULL pointer to designate the default
4044 import list is required.
4049 Perl_load_module(pTHX_ U32 flags, SV *name, SV *ver, ...)
4053 PERL_ARGS_ASSERT_LOAD_MODULE;
4055 va_start(args, ver);
4056 vload_module(flags, name, ver, &args);
4060 #ifdef PERL_IMPLICIT_CONTEXT
4062 Perl_load_module_nocontext(U32 flags, SV *name, SV *ver, ...)
4066 PERL_ARGS_ASSERT_LOAD_MODULE_NOCONTEXT;
4067 va_start(args, ver);
4068 vload_module(flags, name, ver, &args);
4074 Perl_vload_module(pTHX_ U32 flags, SV *name, SV *ver, va_list *args)
4078 OP * const modname = newSVOP(OP_CONST, 0, name);
4080 PERL_ARGS_ASSERT_VLOAD_MODULE;
4082 modname->op_private |= OPpCONST_BARE;
4084 veop = newSVOP(OP_CONST, 0, ver);
4088 if (flags & PERL_LOADMOD_NOIMPORT) {
4089 imop = sawparens(newNULLLIST());
4091 else if (flags & PERL_LOADMOD_IMPORT_OPS) {
4092 imop = va_arg(*args, OP*);
4097 sv = va_arg(*args, SV*);
4099 imop = append_elem(OP_LIST, imop, newSVOP(OP_CONST, 0, sv));
4100 sv = va_arg(*args, SV*);
4104 /* utilize() fakes up a BEGIN { require ..; import ... }, so make sure
4105 * that it has a PL_parser to play with while doing that, and also
4106 * that it doesn't mess with any existing parser, by creating a tmp
4107 * new parser with lex_start(). This won't actually be used for much,
4108 * since pp_require() will create another parser for the real work. */
4111 SAVEVPTR(PL_curcop);
4112 lex_start(NULL, NULL, FALSE);
4113 utilize(!(flags & PERL_LOADMOD_DENY), start_subparse(FALSE, 0),
4114 veop, modname, imop);
4119 Perl_dofile(pTHX_ OP *term, I32 force_builtin)
4125 PERL_ARGS_ASSERT_DOFILE;
4127 if (!force_builtin) {
4128 gv = gv_fetchpvs("do", GV_NOTQUAL, SVt_PVCV);
4129 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
4130 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "do", FALSE);
4131 gv = gvp ? *gvp : NULL;
4135 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
4136 doop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
4137 append_elem(OP_LIST, term,
4138 scalar(newUNOP(OP_RV2CV, 0,
4139 newGVOP(OP_GV, 0, gv))))));
4142 doop = newUNOP(OP_DOFILE, 0, scalar(term));
4148 Perl_newSLICEOP(pTHX_ I32 flags, OP *subscript, OP *listval)
4150 return newBINOP(OP_LSLICE, flags,
4151 list(force_list(subscript)),
4152 list(force_list(listval)) );
4156 S_is_list_assignment(pTHX_ register const OP *o)
4164 if ((o->op_type == OP_NULL) && (o->op_flags & OPf_KIDS))
4165 o = cUNOPo->op_first;
4167 flags = o->op_flags;
4169 if (type == OP_COND_EXPR) {
4170 const I32 t = is_list_assignment(cLOGOPo->op_first->op_sibling);
4171 const I32 f = is_list_assignment(cLOGOPo->op_first->op_sibling->op_sibling);
4176 yyerror("Assignment to both a list and a scalar");
4180 if (type == OP_LIST &&
4181 (flags & OPf_WANT) == OPf_WANT_SCALAR &&
4182 o->op_private & OPpLVAL_INTRO)
4185 if (type == OP_LIST || flags & OPf_PARENS ||
4186 type == OP_RV2AV || type == OP_RV2HV ||
4187 type == OP_ASLICE || type == OP_HSLICE)
4190 if (type == OP_PADAV || type == OP_PADHV)
4193 if (type == OP_RV2SV)
4200 Perl_newASSIGNOP(pTHX_ I32 flags, OP *left, I32 optype, OP *right)
4206 if (optype == OP_ANDASSIGN || optype == OP_ORASSIGN || optype == OP_DORASSIGN) {
4207 return newLOGOP(optype, 0,
4208 mod(scalar(left), optype),
4209 newUNOP(OP_SASSIGN, 0, scalar(right)));
4212 return newBINOP(optype, OPf_STACKED,
4213 mod(scalar(left), optype), scalar(right));
4217 if (is_list_assignment(left)) {
4218 static const char no_list_state[] = "Initialization of state variables"
4219 " in list context currently forbidden";
4221 bool maybe_common_vars = TRUE;
4224 /* Grandfathering $[ assignment here. Bletch.*/
4225 /* Only simple assignments like C<< ($[) = 1 >> are allowed */
4226 PL_eval_start = (left->op_type == OP_CONST) ? right : NULL;
4227 left = mod(left, OP_AASSIGN);
4230 else if (left->op_type == OP_CONST) {
4232 /* Result of assignment is always 1 (or we'd be dead already) */
4233 return newSVOP(OP_CONST, 0, newSViv(1));
4235 curop = list(force_list(left));
4236 o = newBINOP(OP_AASSIGN, flags, list(force_list(right)), curop);
4237 o->op_private = (U8)(0 | (flags >> 8));
4239 if ((left->op_type == OP_LIST
4240 || (left->op_type == OP_NULL && left->op_targ == OP_LIST)))
4242 OP* lop = ((LISTOP*)left)->op_first;
4243 maybe_common_vars = FALSE;
4245 if (lop->op_type == OP_PADSV ||
4246 lop->op_type == OP_PADAV ||
4247 lop->op_type == OP_PADHV ||
4248 lop->op_type == OP_PADANY) {
4249 if (!(lop->op_private & OPpLVAL_INTRO))
4250 maybe_common_vars = TRUE;
4252 if (lop->op_private & OPpPAD_STATE) {
4253 if (left->op_private & OPpLVAL_INTRO) {
4254 /* Each variable in state($a, $b, $c) = ... */
4257 /* Each state variable in
4258 (state $a, my $b, our $c, $d, undef) = ... */
4260 yyerror(no_list_state);
4262 /* Each my variable in
4263 (state $a, my $b, our $c, $d, undef) = ... */
4265 } else if (lop->op_type == OP_UNDEF ||
4266 lop->op_type == OP_PUSHMARK) {
4267 /* undef may be interesting in
4268 (state $a, undef, state $c) */
4270 /* Other ops in the list. */
4271 maybe_common_vars = TRUE;
4273 lop = lop->op_sibling;
4276 else if ((left->op_private & OPpLVAL_INTRO)
4277 && ( left->op_type == OP_PADSV
4278 || left->op_type == OP_PADAV
4279 || left->op_type == OP_PADHV
4280 || left->op_type == OP_PADANY))
4282 if (left->op_type == OP_PADSV) maybe_common_vars = FALSE;
4283 if (left->op_private & OPpPAD_STATE) {
4284 /* All single variable list context state assignments, hence
4294 yyerror(no_list_state);
4298 /* PL_generation sorcery:
4299 * an assignment like ($a,$b) = ($c,$d) is easier than
4300 * ($a,$b) = ($c,$a), since there is no need for temporary vars.
4301 * To detect whether there are common vars, the global var
4302 * PL_generation is incremented for each assign op we compile.
4303 * Then, while compiling the assign op, we run through all the
4304 * variables on both sides of the assignment, setting a spare slot
4305 * in each of them to PL_generation. If any of them already have
4306 * that value, we know we've got commonality. We could use a
4307 * single bit marker, but then we'd have to make 2 passes, first
4308 * to clear the flag, then to test and set it. To find somewhere
4309 * to store these values, evil chicanery is done with SvUVX().
4312 if (maybe_common_vars) {
4315 for (curop = LINKLIST(o); curop != o; curop = LINKLIST(curop)) {
4316 if (PL_opargs[curop->op_type] & OA_DANGEROUS) {
4317 if (curop->op_type == OP_GV) {
4318 GV *gv = cGVOPx_gv(curop);
4320 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4322 GvASSIGN_GENERATION_set(gv, PL_generation);
4324 else if (curop->op_type == OP_PADSV ||
4325 curop->op_type == OP_PADAV ||
4326 curop->op_type == OP_PADHV ||
4327 curop->op_type == OP_PADANY)
4329 if (PAD_COMPNAME_GEN(curop->op_targ)
4330 == (STRLEN)PL_generation)
4332 PAD_COMPNAME_GEN_set(curop->op_targ, PL_generation);
4335 else if (curop->op_type == OP_RV2CV)
4337 else if (curop->op_type == OP_RV2SV ||
4338 curop->op_type == OP_RV2AV ||
4339 curop->op_type == OP_RV2HV ||
4340 curop->op_type == OP_RV2GV) {
4341 if (lastop->op_type != OP_GV) /* funny deref? */
4344 else if (curop->op_type == OP_PUSHRE) {
4346 if (((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff) {
4347 GV *const gv = MUTABLE_GV(PAD_SVl(((PMOP*)curop)->op_pmreplrootu.op_pmtargetoff));
4349 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4351 GvASSIGN_GENERATION_set(gv, PL_generation);
4355 = ((PMOP*)curop)->op_pmreplrootu.op_pmtargetgv;
4358 || (int)GvASSIGN_GENERATION(gv) == PL_generation)
4360 GvASSIGN_GENERATION_set(gv, PL_generation);
4370 o->op_private |= OPpASSIGN_COMMON;
4373 if (right && right->op_type == OP_SPLIT && !PL_madskills) {
4374 OP* tmpop = ((LISTOP*)right)->op_first;
4375 if (tmpop && (tmpop->op_type == OP_PUSHRE)) {
4376 PMOP * const pm = (PMOP*)tmpop;
4377 if (left->op_type == OP_RV2AV &&
4378 !(left->op_private & OPpLVAL_INTRO) &&
4379 !(o->op_private & OPpASSIGN_COMMON) )
4381 tmpop = ((UNOP*)left)->op_first;
4382 if (tmpop->op_type == OP_GV
4384 && !pm->op_pmreplrootu.op_pmtargetoff
4386 && !pm->op_pmreplrootu.op_pmtargetgv
4390 pm->op_pmreplrootu.op_pmtargetoff
4391 = cPADOPx(tmpop)->op_padix;
4392 cPADOPx(tmpop)->op_padix = 0; /* steal it */
4394 pm->op_pmreplrootu.op_pmtargetgv
4395 = MUTABLE_GV(cSVOPx(tmpop)->op_sv);
4396 cSVOPx(tmpop)->op_sv = NULL; /* steal it */
4398 pm->op_pmflags |= PMf_ONCE;
4399 tmpop = cUNOPo->op_first; /* to list (nulled) */
4400 tmpop = ((UNOP*)tmpop)->op_first; /* to pushmark */
4401 tmpop->op_sibling = NULL; /* don't free split */
4402 right->op_next = tmpop->op_next; /* fix starting loc */
4403 op_free(o); /* blow off assign */
4404 right->op_flags &= ~OPf_WANT;
4405 /* "I don't know and I don't care." */
4410 if (PL_modcount < RETURN_UNLIMITED_NUMBER &&
4411 ((LISTOP*)right)->op_last->op_type == OP_CONST)
4413 SV *sv = ((SVOP*)((LISTOP*)right)->op_last)->op_sv;
4414 if (SvIOK(sv) && SvIVX(sv) == 0)
4415 sv_setiv(sv, PL_modcount+1);
4423 right = newOP(OP_UNDEF, 0);
4424 if (right->op_type == OP_READLINE) {
4425 right->op_flags |= OPf_STACKED;
4426 return newBINOP(OP_NULL, flags, mod(scalar(left), OP_SASSIGN), scalar(right));
4429 PL_eval_start = right; /* Grandfathering $[ assignment here. Bletch.*/
4430 o = newBINOP(OP_SASSIGN, flags,
4431 scalar(right), mod(scalar(left), OP_SASSIGN) );
4435 if (!PL_madskills) { /* assignment to $[ is ignored when making a mad dump */
4436 deprecate("assignment to $[");
4438 o = newSVOP(OP_CONST, 0, newSViv(CopARYBASE_get(&PL_compiling)));
4439 o->op_private |= OPpCONST_ARYBASE;
4447 Perl_newSTATEOP(pTHX_ I32 flags, char *label, OP *o)
4450 const U32 seq = intro_my();
4453 NewOp(1101, cop, 1, COP);
4454 if (PERLDB_LINE && CopLINE(PL_curcop) && PL_curstash != PL_debstash) {
4455 cop->op_type = OP_DBSTATE;
4456 cop->op_ppaddr = PL_ppaddr[ OP_DBSTATE ];
4459 cop->op_type = OP_NEXTSTATE;
4460 cop->op_ppaddr = PL_ppaddr[ OP_NEXTSTATE ];
4462 cop->op_flags = (U8)flags;
4463 CopHINTS_set(cop, PL_hints);
4465 cop->op_private |= NATIVE_HINTS;
4467 CopHINTS_set(&PL_compiling, CopHINTS_get(cop));
4468 cop->op_next = (OP*)cop;
4471 /* CopARYBASE is now "virtual", in that it's stored as a flag bit in
4472 CopHINTS and a possible value in cop_hints_hash, so no need to copy it.
4474 cop->cop_warnings = DUP_WARNINGS(PL_curcop->cop_warnings);
4475 cop->cop_hints_hash = PL_curcop->cop_hints_hash;
4476 if (cop->cop_hints_hash) {
4478 cop->cop_hints_hash->refcounted_he_refcnt++;
4479 HINTS_REFCNT_UNLOCK;
4483 = Perl_store_cop_label(aTHX_ cop->cop_hints_hash, label);
4485 PL_hints |= HINT_BLOCK_SCOPE;
4486 /* It seems that we need to defer freeing this pointer, as other parts
4487 of the grammar end up wanting to copy it after this op has been
4492 if (PL_parser && PL_parser->copline == NOLINE)
4493 CopLINE_set(cop, CopLINE(PL_curcop));
4495 CopLINE_set(cop, PL_parser->copline);
4497 PL_parser->copline = NOLINE;
4500 CopFILE_set(cop, CopFILE(PL_curcop)); /* XXX share in a pvtable? */
4502 CopFILEGV_set(cop, CopFILEGV(PL_curcop));
4504 CopSTASH_set(cop, PL_curstash);
4506 if ((PERLDB_LINE || PERLDB_SAVESRC) && PL_curstash != PL_debstash) {
4507 /* this line can have a breakpoint - store the cop in IV */
4508 AV *av = CopFILEAVx(PL_curcop);
4510 SV * const * const svp = av_fetch(av, (I32)CopLINE(cop), FALSE);
4511 if (svp && *svp != &PL_sv_undef ) {
4512 (void)SvIOK_on(*svp);
4513 SvIV_set(*svp, PTR2IV(cop));
4518 if (flags & OPf_SPECIAL)
4520 return prepend_elem(OP_LINESEQ, (OP*)cop, o);
4525 Perl_newLOGOP(pTHX_ I32 type, I32 flags, OP *first, OP *other)
4529 PERL_ARGS_ASSERT_NEWLOGOP;
4531 return new_logop(type, flags, &first, &other);
4535 S_search_const(pTHX_ OP *o)
4537 PERL_ARGS_ASSERT_SEARCH_CONST;
4539 switch (o->op_type) {
4543 if (o->op_flags & OPf_KIDS)
4544 return search_const(cUNOPo->op_first);
4551 if (!(o->op_flags & OPf_KIDS))
4553 kid = cLISTOPo->op_first;
4555 switch (kid->op_type) {
4559 kid = kid->op_sibling;
4562 if (kid != cLISTOPo->op_last)
4568 kid = cLISTOPo->op_last;
4570 return search_const(kid);
4578 S_new_logop(pTHX_ I32 type, I32 flags, OP** firstp, OP** otherp)
4586 int prepend_not = 0;
4588 PERL_ARGS_ASSERT_NEW_LOGOP;
4593 if (type == OP_XOR) /* Not short circuit, but here by precedence. */
4594 return newBINOP(type, flags, scalar(first), scalar(other));
4596 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOGOP);
4598 scalarboolean(first);
4599 /* optimize AND and OR ops that have NOTs as children */
4600 if (first->op_type == OP_NOT
4601 && (first->op_flags & OPf_KIDS)
4602 && ((first->op_flags & OPf_SPECIAL) /* unless ($x) { } */
4603 || (other->op_type == OP_NOT)) /* if (!$x && !$y) { } */
4605 if (type == OP_AND || type == OP_OR) {
4611 if (other->op_type == OP_NOT) { /* !a AND|OR !b => !(a OR|AND b) */
4613 prepend_not = 1; /* prepend a NOT op later */
4617 /* search for a constant op that could let us fold the test */
4618 if ((cstop = search_const(first))) {
4619 if (cstop->op_private & OPpCONST_STRICT)
4620 no_bareword_allowed(cstop);
4621 else if ((cstop->op_private & OPpCONST_BARE))
4622 Perl_ck_warner(aTHX_ packWARN(WARN_BAREWORD), "Bareword found in conditional");
4623 if ((type == OP_AND && SvTRUE(((SVOP*)cstop)->op_sv)) ||
4624 (type == OP_OR && !SvTRUE(((SVOP*)cstop)->op_sv)) ||
4625 (type == OP_DOR && !SvOK(((SVOP*)cstop)->op_sv))) {
4627 if (other->op_type == OP_CONST)
4628 other->op_private |= OPpCONST_SHORTCIRCUIT;
4630 OP *newop = newUNOP(OP_NULL, 0, other);
4631 op_getmad(first, newop, '1');
4632 newop->op_targ = type; /* set "was" field */
4636 if (other->op_type == OP_LEAVE)
4637 other = newUNOP(OP_NULL, OPf_SPECIAL, other);
4641 /* check for C<my $x if 0>, or C<my($x,$y) if 0> */
4642 const OP *o2 = other;
4643 if ( ! (o2->op_type == OP_LIST
4644 && (( o2 = cUNOPx(o2)->op_first))
4645 && o2->op_type == OP_PUSHMARK
4646 && (( o2 = o2->op_sibling)) )
4649 if ((o2->op_type == OP_PADSV || o2->op_type == OP_PADAV
4650 || o2->op_type == OP_PADHV)
4651 && o2->op_private & OPpLVAL_INTRO
4652 && !(o2->op_private & OPpPAD_STATE))
4654 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
4655 "Deprecated use of my() in false conditional");
4659 if (first->op_type == OP_CONST)
4660 first->op_private |= OPpCONST_SHORTCIRCUIT;
4662 first = newUNOP(OP_NULL, 0, first);
4663 op_getmad(other, first, '2');
4664 first->op_targ = type; /* set "was" field */
4671 else if ((first->op_flags & OPf_KIDS) && type != OP_DOR
4672 && ckWARN(WARN_MISC)) /* [#24076] Don't warn for <FH> err FOO. */
4674 const OP * const k1 = ((UNOP*)first)->op_first;
4675 const OP * const k2 = k1->op_sibling;
4677 switch (first->op_type)
4680 if (k2 && k2->op_type == OP_READLINE
4681 && (k2->op_flags & OPf_STACKED)
4682 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4684 warnop = k2->op_type;
4689 if (k1->op_type == OP_READDIR
4690 || k1->op_type == OP_GLOB
4691 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4692 || k1->op_type == OP_EACH)
4694 warnop = ((k1->op_type == OP_NULL)
4695 ? (OPCODE)k1->op_targ : k1->op_type);
4700 const line_t oldline = CopLINE(PL_curcop);
4701 CopLINE_set(PL_curcop, PL_parser->copline);
4702 Perl_warner(aTHX_ packWARN(WARN_MISC),
4703 "Value of %s%s can be \"0\"; test with defined()",
4705 ((warnop == OP_READLINE || warnop == OP_GLOB)
4706 ? " construct" : "() operator"));
4707 CopLINE_set(PL_curcop, oldline);
4714 if (type == OP_ANDASSIGN || type == OP_ORASSIGN || type == OP_DORASSIGN)
4715 other->op_private |= OPpASSIGN_BACKWARDS; /* other is an OP_SASSIGN */
4717 NewOp(1101, logop, 1, LOGOP);
4719 logop->op_type = (OPCODE)type;
4720 logop->op_ppaddr = PL_ppaddr[type];
4721 logop->op_first = first;
4722 logop->op_flags = (U8)(flags | OPf_KIDS);
4723 logop->op_other = LINKLIST(other);
4724 logop->op_private = (U8)(1 | (flags >> 8));
4726 /* establish postfix order */
4727 logop->op_next = LINKLIST(first);
4728 first->op_next = (OP*)logop;
4729 first->op_sibling = other;
4731 CHECKOP(type,logop);
4733 o = newUNOP(prepend_not ? OP_NOT : OP_NULL, 0, (OP*)logop);
4740 Perl_newCONDOP(pTHX_ I32 flags, OP *first, OP *trueop, OP *falseop)
4748 PERL_ARGS_ASSERT_NEWCONDOP;
4751 return newLOGOP(OP_AND, 0, first, trueop);
4753 return newLOGOP(OP_OR, 0, first, falseop);
4755 scalarboolean(first);
4756 if ((cstop = search_const(first))) {
4757 /* Left or right arm of the conditional? */
4758 const bool left = SvTRUE(((SVOP*)cstop)->op_sv);
4759 OP *live = left ? trueop : falseop;
4760 OP *const dead = left ? falseop : trueop;
4761 if (cstop->op_private & OPpCONST_BARE &&
4762 cstop->op_private & OPpCONST_STRICT) {
4763 no_bareword_allowed(cstop);
4766 /* This is all dead code when PERL_MAD is not defined. */
4767 live = newUNOP(OP_NULL, 0, live);
4768 op_getmad(first, live, 'C');
4769 op_getmad(dead, live, left ? 'e' : 't');
4774 if (live->op_type == OP_LEAVE)
4775 live = newUNOP(OP_NULL, OPf_SPECIAL, live);
4778 NewOp(1101, logop, 1, LOGOP);
4779 logop->op_type = OP_COND_EXPR;
4780 logop->op_ppaddr = PL_ppaddr[OP_COND_EXPR];
4781 logop->op_first = first;
4782 logop->op_flags = (U8)(flags | OPf_KIDS);
4783 logop->op_private = (U8)(1 | (flags >> 8));
4784 logop->op_other = LINKLIST(trueop);
4785 logop->op_next = LINKLIST(falseop);
4787 CHECKOP(OP_COND_EXPR, /* that's logop->op_type */
4790 /* establish postfix order */
4791 start = LINKLIST(first);
4792 first->op_next = (OP*)logop;
4794 first->op_sibling = trueop;
4795 trueop->op_sibling = falseop;
4796 o = newUNOP(OP_NULL, 0, (OP*)logop);
4798 trueop->op_next = falseop->op_next = o;
4805 Perl_newRANGE(pTHX_ I32 flags, OP *left, OP *right)
4814 PERL_ARGS_ASSERT_NEWRANGE;
4816 NewOp(1101, range, 1, LOGOP);
4818 range->op_type = OP_RANGE;
4819 range->op_ppaddr = PL_ppaddr[OP_RANGE];
4820 range->op_first = left;
4821 range->op_flags = OPf_KIDS;
4822 leftstart = LINKLIST(left);
4823 range->op_other = LINKLIST(right);
4824 range->op_private = (U8)(1 | (flags >> 8));
4826 left->op_sibling = right;
4828 range->op_next = (OP*)range;
4829 flip = newUNOP(OP_FLIP, flags, (OP*)range);
4830 flop = newUNOP(OP_FLOP, 0, flip);
4831 o = newUNOP(OP_NULL, 0, flop);
4833 range->op_next = leftstart;
4835 left->op_next = flip;
4836 right->op_next = flop;
4838 range->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4839 sv_upgrade(PAD_SV(range->op_targ), SVt_PVNV);
4840 flip->op_targ = pad_alloc(OP_RANGE, SVs_PADMY);
4841 sv_upgrade(PAD_SV(flip->op_targ), SVt_PVNV);
4843 flip->op_private = left->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4844 flop->op_private = right->op_type == OP_CONST ? OPpFLIP_LINENUM : 0;
4847 if (!flip->op_private || !flop->op_private)
4848 linklist(o); /* blow off optimizer unless constant */
4854 Perl_newLOOPOP(pTHX_ I32 flags, I32 debuggable, OP *expr, OP *block)
4859 const bool once = block && block->op_flags & OPf_SPECIAL &&
4860 (block->op_type == OP_ENTERSUB || block->op_type == OP_NULL);
4862 PERL_UNUSED_ARG(debuggable);
4865 if (once && expr->op_type == OP_CONST && !SvTRUE(((SVOP*)expr)->op_sv))
4866 return block; /* do {} while 0 does once */
4867 if (expr->op_type == OP_READLINE
4868 || expr->op_type == OP_READDIR
4869 || expr->op_type == OP_GLOB
4870 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4871 expr = newUNOP(OP_DEFINED, 0,
4872 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4873 } else if (expr->op_flags & OPf_KIDS) {
4874 const OP * const k1 = ((UNOP*)expr)->op_first;
4875 const OP * const k2 = k1 ? k1->op_sibling : NULL;
4876 switch (expr->op_type) {
4878 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
4879 && (k2->op_flags & OPf_STACKED)
4880 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4881 expr = newUNOP(OP_DEFINED, 0, expr);
4885 if (k1 && (k1->op_type == OP_READDIR
4886 || k1->op_type == OP_GLOB
4887 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4888 || k1->op_type == OP_EACH))
4889 expr = newUNOP(OP_DEFINED, 0, expr);
4895 /* if block is null, the next append_elem() would put UNSTACK, a scalar
4896 * op, in listop. This is wrong. [perl #27024] */
4898 block = newOP(OP_NULL, 0);
4899 listop = append_elem(OP_LINESEQ, block, newOP(OP_UNSTACK, 0));
4900 o = new_logop(OP_AND, 0, &expr, &listop);
4903 ((LISTOP*)listop)->op_last->op_next = LINKLIST(o);
4905 if (once && o != listop)
4906 o->op_next = ((LOGOP*)cUNOPo->op_first)->op_other;
4909 o = newUNOP(OP_NULL, 0, o); /* or do {} while 1 loses outer block */
4911 o->op_flags |= flags;
4913 o->op_flags |= OPf_SPECIAL; /* suppress POPBLOCK curpm restoration*/
4918 Perl_newWHILEOP(pTHX_ I32 flags, I32 debuggable, LOOP *loop, I32
4919 whileline, OP *expr, OP *block, OP *cont, I32 has_my)
4928 PERL_UNUSED_ARG(debuggable);
4931 if (expr->op_type == OP_READLINE
4932 || expr->op_type == OP_READDIR
4933 || expr->op_type == OP_GLOB
4934 || (expr->op_type == OP_NULL && expr->op_targ == OP_GLOB)) {
4935 expr = newUNOP(OP_DEFINED, 0,
4936 newASSIGNOP(0, newDEFSVOP(), 0, expr) );
4937 } else if (expr->op_flags & OPf_KIDS) {
4938 const OP * const k1 = ((UNOP*)expr)->op_first;
4939 const OP * const k2 = (k1) ? k1->op_sibling : NULL;
4940 switch (expr->op_type) {
4942 if (k2 && (k2->op_type == OP_READLINE || k2->op_type == OP_READDIR)
4943 && (k2->op_flags & OPf_STACKED)
4944 && ((k1->op_flags & OPf_WANT) == OPf_WANT_SCALAR))
4945 expr = newUNOP(OP_DEFINED, 0, expr);
4949 if (k1 && (k1->op_type == OP_READDIR
4950 || k1->op_type == OP_GLOB
4951 || (k1->op_type == OP_NULL && k1->op_targ == OP_GLOB)
4952 || k1->op_type == OP_EACH))
4953 expr = newUNOP(OP_DEFINED, 0, expr);
4960 block = newOP(OP_NULL, 0);
4961 else if (cont || has_my) {
4962 block = scope(block);
4966 next = LINKLIST(cont);
4969 OP * const unstack = newOP(OP_UNSTACK, 0);
4972 cont = append_elem(OP_LINESEQ, cont, unstack);
4976 listop = append_list(OP_LINESEQ, (LISTOP*)block, (LISTOP*)cont);
4978 redo = LINKLIST(listop);
4981 PL_parser->copline = (line_t)whileline;
4983 o = new_logop(OP_AND, 0, &expr, &listop);
4984 if (o == expr && o->op_type == OP_CONST && !SvTRUE(cSVOPo->op_sv)) {
4985 op_free(expr); /* oops, it's a while (0) */
4987 return NULL; /* listop already freed by new_logop */
4990 ((LISTOP*)listop)->op_last->op_next =
4991 (o == listop ? redo : LINKLIST(o));
4997 NewOp(1101,loop,1,LOOP);
4998 loop->op_type = OP_ENTERLOOP;
4999 loop->op_ppaddr = PL_ppaddr[OP_ENTERLOOP];
5000 loop->op_private = 0;
5001 loop->op_next = (OP*)loop;
5004 o = newBINOP(OP_LEAVELOOP, 0, (OP*)loop, o);
5006 loop->op_redoop = redo;
5007 loop->op_lastop = o;
5008 o->op_private |= loopflags;
5011 loop->op_nextop = next;
5013 loop->op_nextop = o;
5015 o->op_flags |= flags;
5016 o->op_private |= (flags >> 8);
5021 Perl_newFOROP(pTHX_ I32 flags, char *label, line_t forline, OP *sv, OP *expr, OP *block, OP *cont)
5026 PADOFFSET padoff = 0;
5031 PERL_ARGS_ASSERT_NEWFOROP;
5034 if (sv->op_type == OP_RV2SV) { /* symbol table variable */
5035 iterpflags = sv->op_private & OPpOUR_INTRO; /* for our $x () */
5036 sv->op_type = OP_RV2GV;
5037 sv->op_ppaddr = PL_ppaddr[OP_RV2GV];
5039 /* The op_type check is needed to prevent a possible segfault
5040 * if the loop variable is undeclared and 'strict vars' is in
5041 * effect. This is illegal but is nonetheless parsed, so we
5042 * may reach this point with an OP_CONST where we're expecting
5045 if (cUNOPx(sv)->op_first->op_type == OP_GV
5046 && cGVOPx_gv(cUNOPx(sv)->op_first) == PL_defgv)
5047 iterpflags |= OPpITER_DEF;
5049 else if (sv->op_type == OP_PADSV) { /* private variable */
5050 iterpflags = sv->op_private & OPpLVAL_INTRO; /* for my $x () */
5051 padoff = sv->op_targ;
5061 Perl_croak(aTHX_ "Can't use %s for loop variable", PL_op_desc[sv->op_type]);
5063 SV *const namesv = PAD_COMPNAME_SV(padoff);
5065 const char *const name = SvPV_const(namesv, len);
5067 if (len == 2 && name[0] == '$' && name[1] == '_')
5068 iterpflags |= OPpITER_DEF;
5072 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
5073 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
5074 sv = newGVOP(OP_GV, 0, PL_defgv);
5079 iterpflags |= OPpITER_DEF;
5081 if (expr->op_type == OP_RV2AV || expr->op_type == OP_PADAV) {
5082 expr = mod(force_list(scalar(ref(expr, OP_ITER))), OP_GREPSTART);
5083 iterflags |= OPf_STACKED;
5085 else if (expr->op_type == OP_NULL &&
5086 (expr->op_flags & OPf_KIDS) &&
5087 ((BINOP*)expr)->op_first->op_type == OP_FLOP)
5089 /* Basically turn for($x..$y) into the same as for($x,$y), but we
5090 * set the STACKED flag to indicate that these values are to be
5091 * treated as min/max values by 'pp_iterinit'.
5093 const UNOP* const flip = (UNOP*)((UNOP*)((BINOP*)expr)->op_first)->op_first;
5094 LOGOP* const range = (LOGOP*) flip->op_first;
5095 OP* const left = range->op_first;
5096 OP* const right = left->op_sibling;
5099 range->op_flags &= ~OPf_KIDS;
5100 range->op_first = NULL;
5102 listop = (LISTOP*)newLISTOP(OP_LIST, 0, left, right);
5103 listop->op_first->op_next = range->op_next;
5104 left->op_next = range->op_other;
5105 right->op_next = (OP*)listop;
5106 listop->op_next = listop->op_first;
5109 op_getmad(expr,(OP*)listop,'O');
5113 expr = (OP*)(listop);
5115 iterflags |= OPf_STACKED;
5118 expr = mod(force_list(expr), OP_GREPSTART);
5121 loop = (LOOP*)list(convert(OP_ENTERITER, iterflags,
5122 append_elem(OP_LIST, expr, scalar(sv))));
5123 assert(!loop->op_next);
5124 /* for my $x () sets OPpLVAL_INTRO;
5125 * for our $x () sets OPpOUR_INTRO */
5126 loop->op_private = (U8)iterpflags;
5127 #ifdef PL_OP_SLAB_ALLOC
5130 NewOp(1234,tmp,1,LOOP);
5131 Copy(loop,tmp,1,LISTOP);
5132 S_op_destroy(aTHX_ (OP*)loop);
5136 loop = (LOOP*)PerlMemShared_realloc(loop, sizeof(LOOP));
5138 loop->op_targ = padoff;
5139 wop = newWHILEOP(flags, 1, loop, forline, newOP(OP_ITER, 0), block, cont, 0);
5141 op_getmad(madsv, (OP*)loop, 'v');
5142 PL_parser->copline = forline;
5143 return newSTATEOP(0, label, wop);
5147 Perl_newLOOPEX(pTHX_ I32 type, OP *label)
5152 PERL_ARGS_ASSERT_NEWLOOPEX;
5154 assert((PL_opargs[type] & OA_CLASS_MASK) == OA_LOOPEXOP);
5156 if (type != OP_GOTO || label->op_type == OP_CONST) {
5157 /* "last()" means "last" */
5158 if (label->op_type == OP_STUB && (label->op_flags & OPf_PARENS))
5159 o = newOP(type, OPf_SPECIAL);
5161 o = newPVOP(type, 0, savesharedpv(label->op_type == OP_CONST
5162 ? SvPV_nolen_const(((SVOP*)label)->op_sv)
5166 op_getmad(label,o,'L');
5172 /* Check whether it's going to be a goto &function */
5173 if (label->op_type == OP_ENTERSUB
5174 && !(label->op_flags & OPf_STACKED))
5175 label = newUNOP(OP_REFGEN, 0, mod(label, OP_REFGEN));
5176 o = newUNOP(type, OPf_STACKED, label);
5178 PL_hints |= HINT_BLOCK_SCOPE;
5182 /* if the condition is a literal array or hash
5183 (or @{ ... } etc), make a reference to it.
5186 S_ref_array_or_hash(pTHX_ OP *cond)
5189 && (cond->op_type == OP_RV2AV
5190 || cond->op_type == OP_PADAV
5191 || cond->op_type == OP_RV2HV
5192 || cond->op_type == OP_PADHV))
5194 return newUNOP(OP_REFGEN,
5195 0, mod(cond, OP_REFGEN));
5201 /* These construct the optree fragments representing given()
5204 entergiven and enterwhen are LOGOPs; the op_other pointer
5205 points up to the associated leave op. We need this so we
5206 can put it in the context and make break/continue work.
5207 (Also, of course, pp_enterwhen will jump straight to
5208 op_other if the match fails.)
5212 S_newGIVWHENOP(pTHX_ OP *cond, OP *block,
5213 I32 enter_opcode, I32 leave_opcode,
5214 PADOFFSET entertarg)
5220 PERL_ARGS_ASSERT_NEWGIVWHENOP;
5222 NewOp(1101, enterop, 1, LOGOP);
5223 enterop->op_type = (Optype)enter_opcode;
5224 enterop->op_ppaddr = PL_ppaddr[enter_opcode];
5225 enterop->op_flags = (U8) OPf_KIDS;
5226 enterop->op_targ = ((entertarg == NOT_IN_PAD) ? 0 : entertarg);
5227 enterop->op_private = 0;
5229 o = newUNOP(leave_opcode, 0, (OP *) enterop);
5232 enterop->op_first = scalar(cond);
5233 cond->op_sibling = block;
5235 o->op_next = LINKLIST(cond);
5236 cond->op_next = (OP *) enterop;
5239 /* This is a default {} block */
5240 enterop->op_first = block;
5241 enterop->op_flags |= OPf_SPECIAL;
5243 o->op_next = (OP *) enterop;
5246 CHECKOP(enter_opcode, enterop); /* Currently does nothing, since
5247 entergiven and enterwhen both
5250 enterop->op_next = LINKLIST(block);
5251 block->op_next = enterop->op_other = o;
5256 /* Does this look like a boolean operation? For these purposes
5257 a boolean operation is:
5258 - a subroutine call [*]
5259 - a logical connective
5260 - a comparison operator
5261 - a filetest operator, with the exception of -s -M -A -C
5262 - defined(), exists() or eof()
5263 - /$re/ or $foo =~ /$re/
5265 [*] possibly surprising
5268 S_looks_like_bool(pTHX_ const OP *o)
5272 PERL_ARGS_ASSERT_LOOKS_LIKE_BOOL;
5274 switch(o->op_type) {
5277 return looks_like_bool(cLOGOPo->op_first);
5281 looks_like_bool(cLOGOPo->op_first)
5282 && looks_like_bool(cLOGOPo->op_first->op_sibling));
5286 o->op_flags & OPf_KIDS
5287 && looks_like_bool(cUNOPo->op_first));
5290 return looks_like_bool(cUNOPo->op_first);
5295 case OP_NOT: case OP_XOR:
5297 case OP_EQ: case OP_NE: case OP_LT:
5298 case OP_GT: case OP_LE: case OP_GE:
5300 case OP_I_EQ: case OP_I_NE: case OP_I_LT:
5301 case OP_I_GT: case OP_I_LE: case OP_I_GE:
5303 case OP_SEQ: case OP_SNE: case OP_SLT:
5304 case OP_SGT: case OP_SLE: case OP_SGE:
5308 case OP_FTRREAD: case OP_FTRWRITE: case OP_FTREXEC:
5309 case OP_FTEREAD: case OP_FTEWRITE: case OP_FTEEXEC:
5310 case OP_FTIS: case OP_FTEOWNED: case OP_FTROWNED:
5311 case OP_FTZERO: case OP_FTSOCK: case OP_FTCHR:
5312 case OP_FTBLK: case OP_FTFILE: case OP_FTDIR:
5313 case OP_FTPIPE: case OP_FTLINK: case OP_FTSUID:
5314 case OP_FTSGID: case OP_FTSVTX: case OP_FTTTY:
5315 case OP_FTTEXT: case OP_FTBINARY:
5317 case OP_DEFINED: case OP_EXISTS:
5318 case OP_MATCH: case OP_EOF:
5325 /* Detect comparisons that have been optimized away */
5326 if (cSVOPo->op_sv == &PL_sv_yes
5327 || cSVOPo->op_sv == &PL_sv_no)
5340 Perl_newGIVENOP(pTHX_ OP *cond, OP *block, PADOFFSET defsv_off)
5343 PERL_ARGS_ASSERT_NEWGIVENOP;
5344 return newGIVWHENOP(
5345 ref_array_or_hash(cond),
5347 OP_ENTERGIVEN, OP_LEAVEGIVEN,
5351 /* If cond is null, this is a default {} block */
5353 Perl_newWHENOP(pTHX_ OP *cond, OP *block)
5355 const bool cond_llb = (!cond || looks_like_bool(cond));
5358 PERL_ARGS_ASSERT_NEWWHENOP;
5363 cond_op = newBINOP(OP_SMARTMATCH, OPf_SPECIAL,
5365 scalar(ref_array_or_hash(cond)));
5368 return newGIVWHENOP(
5370 append_elem(block->op_type, block, newOP(OP_BREAK, OPf_SPECIAL)),
5371 OP_ENTERWHEN, OP_LEAVEWHEN, 0);
5375 =for apidoc cv_undef
5377 Clear out all the active components of a CV. This can happen either
5378 by an explicit C<undef &foo>, or by the reference count going to zero.
5379 In the former case, we keep the CvOUTSIDE pointer, so that any anonymous
5380 children can still follow the full lexical scope chain.
5386 Perl_cv_undef(pTHX_ CV *cv)
5390 PERL_ARGS_ASSERT_CV_UNDEF;
5392 DEBUG_X(PerlIO_printf(Perl_debug_log,
5393 "CV undef: cv=0x%"UVxf" comppad=0x%"UVxf"\n",
5394 PTR2UV(cv), PTR2UV(PL_comppad))
5398 if (CvFILE(cv) && !CvISXSUB(cv)) {
5399 /* for XSUBs CvFILE point directly to static memory; __FILE__ */
5400 Safefree(CvFILE(cv));
5405 if (!CvISXSUB(cv) && CvROOT(cv)) {
5406 if (SvTYPE(cv) == SVt_PVCV && CvDEPTH(cv))
5407 Perl_croak(aTHX_ "Can't undef active subroutine");
5410 PAD_SAVE_SETNULLPAD();
5412 op_free(CvROOT(cv));
5417 SvPOK_off(MUTABLE_SV(cv)); /* forget prototype */
5422 /* remove CvOUTSIDE unless this is an undef rather than a free */
5423 if (!SvREFCNT(cv) && CvOUTSIDE(cv)) {
5424 if (!CvWEAKOUTSIDE(cv))
5425 SvREFCNT_dec(CvOUTSIDE(cv));
5426 CvOUTSIDE(cv) = NULL;
5429 SvREFCNT_dec(MUTABLE_SV(CvXSUBANY(cv).any_ptr));
5432 if (CvISXSUB(cv) && CvXSUB(cv)) {
5435 /* delete all flags except WEAKOUTSIDE */
5436 CvFLAGS(cv) &= CVf_WEAKOUTSIDE;
5440 Perl_cv_ckproto_len(pTHX_ const CV *cv, const GV *gv, const char *p,
5443 PERL_ARGS_ASSERT_CV_CKPROTO_LEN;
5445 /* Can't just use a strcmp on the prototype, as CONSTSUBs "cheat" by
5446 relying on SvCUR, and doubling up the buffer to hold CvFILE(). */
5447 if (((!p != !SvPOK(cv)) /* One has prototype, one has not. */
5448 || (p && (len != SvCUR(cv) /* Not the same length. */
5449 || memNE(p, SvPVX_const(cv), len))))
5450 && ckWARN_d(WARN_PROTOTYPE)) {
5451 SV* const msg = sv_newmortal();
5455 gv_efullname3(name = sv_newmortal(), gv, NULL);
5456 sv_setpvs(msg, "Prototype mismatch:");
5458 Perl_sv_catpvf(aTHX_ msg, " sub %"SVf, SVfARG(name));
5460 Perl_sv_catpvf(aTHX_ msg, " (%"SVf")", SVfARG(cv));
5462 sv_catpvs(msg, ": none");
5463 sv_catpvs(msg, " vs ");
5465 Perl_sv_catpvf(aTHX_ msg, "(%.*s)", (int) len, p);
5467 sv_catpvs(msg, "none");
5468 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE), "%"SVf, SVfARG(msg));
5472 static void const_sv_xsub(pTHX_ CV* cv);
5476 =head1 Optree Manipulation Functions
5478 =for apidoc cv_const_sv
5480 If C<cv> is a constant sub eligible for inlining. returns the constant
5481 value returned by the sub. Otherwise, returns NULL.
5483 Constant subs can be created with C<newCONSTSUB> or as described in
5484 L<perlsub/"Constant Functions">.
5489 Perl_cv_const_sv(pTHX_ const CV *const cv)
5491 PERL_UNUSED_CONTEXT;
5494 if (!(SvTYPE(cv) == SVt_PVCV || SvTYPE(cv) == SVt_PVFM))
5496 return CvCONST(cv) ? MUTABLE_SV(CvXSUBANY(cv).any_ptr) : NULL;
5499 /* op_const_sv: examine an optree to determine whether it's in-lineable.
5500 * Can be called in 3 ways:
5503 * look for a single OP_CONST with attached value: return the value
5505 * cv && CvCLONE(cv) && !CvCONST(cv)
5507 * examine the clone prototype, and if contains only a single
5508 * OP_CONST referencing a pad const, or a single PADSV referencing
5509 * an outer lexical, return a non-zero value to indicate the CV is
5510 * a candidate for "constizing" at clone time
5514 * We have just cloned an anon prototype that was marked as a const
5515 * candidiate. Try to grab the current value, and in the case of
5516 * PADSV, ignore it if it has multiple references. Return the value.
5520 Perl_op_const_sv(pTHX_ const OP *o, CV *cv)
5531 if (o->op_type == OP_LINESEQ && cLISTOPo->op_first)
5532 o = cLISTOPo->op_first->op_sibling;
5534 for (; o; o = o->op_next) {
5535 const OPCODE type = o->op_type;
5537 if (sv && o->op_next == o)
5539 if (o->op_next != o) {
5540 if (type == OP_NEXTSTATE || type == OP_NULL || type == OP_PUSHMARK)
5542 if (type == OP_DBSTATE)
5545 if (type == OP_LEAVESUB || type == OP_RETURN)
5549 if (type == OP_CONST && cSVOPo->op_sv)
5551 else if (cv && type == OP_CONST) {
5552 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5556 else if (cv && type == OP_PADSV) {
5557 if (CvCONST(cv)) { /* newly cloned anon */
5558 sv = PAD_BASE_SV(CvPADLIST(cv), o->op_targ);
5559 /* the candidate should have 1 ref from this pad and 1 ref
5560 * from the parent */
5561 if (!sv || SvREFCNT(sv) != 2)
5568 if (PAD_COMPNAME_FLAGS(o->op_targ) & SVf_FAKE)
5569 sv = &PL_sv_undef; /* an arbitrary non-null value */
5584 Perl_newMYSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5587 /* This would be the return value, but the return cannot be reached. */
5588 OP* pegop = newOP(OP_NULL, 0);
5591 PERL_UNUSED_ARG(floor);
5601 Perl_croak(aTHX_ "\"my sub\" not yet implemented");
5603 NORETURN_FUNCTION_END;
5608 Perl_newSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *block)
5610 return Perl_newATTRSUB(aTHX_ floor, o, proto, NULL, block);
5614 Perl_newATTRSUB(pTHX_ I32 floor, OP *o, OP *proto, OP *attrs, OP *block)
5620 register CV *cv = NULL;
5622 /* If the subroutine has no body, no attributes, and no builtin attributes
5623 then it's just a sub declaration, and we may be able to get away with
5624 storing with a placeholder scalar in the symbol table, rather than a
5625 full GV and CV. If anything is present then it will take a full CV to
5627 const I32 gv_fetch_flags
5628 = (block || attrs || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5630 ? GV_ADDMULTI : GV_ADDMULTI | GV_NOINIT;
5631 const char * const name = o ? SvPV_nolen_const(cSVOPo->op_sv) : NULL;
5635 assert(proto->op_type == OP_CONST);
5636 ps = SvPV_const(((SVOP*)proto)->op_sv, ps_len);
5642 gv = gv_fetchsv(cSVOPo->op_sv, gv_fetch_flags, SVt_PVCV);
5644 } else if (PERLDB_NAMEANON && CopLINE(PL_curcop)) {
5645 SV * const sv = sv_newmortal();
5646 Perl_sv_setpvf(aTHX_ sv, "%s[%s:%"IVdf"]",
5647 PL_curstash ? "__ANON__" : "__ANON__::__ANON__",
5648 CopFILE(PL_curcop), (IV)CopLINE(PL_curcop));
5649 gv = gv_fetchsv(sv, gv_fetch_flags, SVt_PVCV);
5651 } else if (PL_curstash) {
5652 gv = gv_fetchpvs("__ANON__", gv_fetch_flags, SVt_PVCV);
5655 gv = gv_fetchpvs("__ANON__::__ANON__", gv_fetch_flags, SVt_PVCV);
5659 if (!PL_madskills) {
5668 if (SvTYPE(gv) != SVt_PVGV) { /* Maybe prototype now, and had at
5669 maximum a prototype before. */
5670 if (SvTYPE(gv) > SVt_NULL) {
5671 if (!SvPOK((const SV *)gv)
5672 && !(SvIOK((const SV *)gv) && SvIVX((const SV *)gv) == -1))
5674 Perl_ck_warner_d(aTHX_ packWARN(WARN_PROTOTYPE), "Runaway prototype");
5676 cv_ckproto_len((const CV *)gv, NULL, ps, ps_len);
5679 sv_setpvn(MUTABLE_SV(gv), ps, ps_len);
5681 sv_setiv(MUTABLE_SV(gv), -1);
5683 SvREFCNT_dec(PL_compcv);
5684 cv = PL_compcv = NULL;
5688 cv = (!name || GvCVGEN(gv)) ? NULL : GvCV(gv);
5690 if (!block || !ps || *ps || attrs
5691 || (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS)
5693 || block->op_type == OP_NULL
5698 const_sv = op_const_sv(block, NULL);
5701 const bool exists = CvROOT(cv) || CvXSUB(cv);
5703 /* if the subroutine doesn't exist and wasn't pre-declared
5704 * with a prototype, assume it will be AUTOLOADed,
5705 * skipping the prototype check
5707 if (exists || SvPOK(cv))
5708 cv_ckproto_len(cv, gv, ps, ps_len);
5709 /* already defined (or promised)? */
5710 if (exists || GvASSUMECV(gv)) {
5713 || block->op_type == OP_NULL
5716 if (CvFLAGS(PL_compcv)) {
5717 /* might have had built-in attrs applied */
5718 if (CvLVALUE(PL_compcv) && ! CvLVALUE(cv) && ckWARN(WARN_MISC))
5719 Perl_warner(aTHX_ packWARN(WARN_MISC), "lvalue attribute ignored after the subroutine has been defined");
5720 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS & ~CVf_LVALUE);
5722 /* just a "sub foo;" when &foo is already defined */
5723 SAVEFREESV(PL_compcv);
5728 && block->op_type != OP_NULL
5731 if (ckWARN(WARN_REDEFINE)
5733 && (!const_sv || sv_cmp(cv_const_sv(cv), const_sv))))
5735 const line_t oldline = CopLINE(PL_curcop);
5736 if (PL_parser && PL_parser->copline != NOLINE)
5737 CopLINE_set(PL_curcop, PL_parser->copline);
5738 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
5739 CvCONST(cv) ? "Constant subroutine %s redefined"
5740 : "Subroutine %s redefined", name);
5741 CopLINE_set(PL_curcop, oldline);
5744 if (!PL_minus_c) /* keep old one around for madskills */
5747 /* (PL_madskills unset in used file.) */
5755 SvREFCNT_inc_simple_void_NN(const_sv);
5757 assert(!CvROOT(cv) && !CvCONST(cv));
5758 sv_setpvs(MUTABLE_SV(cv), ""); /* prototype is "" */
5759 CvXSUBANY(cv).any_ptr = const_sv;
5760 CvXSUB(cv) = const_sv_xsub;
5766 cv = newCONSTSUB(NULL, name, const_sv);
5768 mro_method_changed_in( /* sub Foo::Bar () { 123 } */
5769 (CvGV(cv) && GvSTASH(CvGV(cv)))
5778 SvREFCNT_dec(PL_compcv);
5782 if (cv) { /* must reuse cv if autoloaded */
5783 /* transfer PL_compcv to cv */
5786 && block->op_type != OP_NULL
5789 cv_flags_t existing_builtin_attrs = CvFLAGS(cv) & CVf_BUILTIN_ATTRS;
5791 CvFLAGS(cv) = CvFLAGS(PL_compcv) | existing_builtin_attrs;
5792 if (!CvWEAKOUTSIDE(cv))
5793 SvREFCNT_dec(CvOUTSIDE(cv));
5794 CvOUTSIDE(cv) = CvOUTSIDE(PL_compcv);
5795 CvOUTSIDE_SEQ(cv) = CvOUTSIDE_SEQ(PL_compcv);
5796 CvOUTSIDE(PL_compcv) = 0;
5797 CvPADLIST(cv) = CvPADLIST(PL_compcv);
5798 CvPADLIST(PL_compcv) = 0;
5799 /* inner references to PL_compcv must be fixed up ... */
5800 pad_fixup_inner_anons(CvPADLIST(cv), PL_compcv, cv);
5801 if (PERLDB_INTER)/* Advice debugger on the new sub. */
5802 ++PL_sub_generation;
5805 /* Might have had built-in attributes applied -- propagate them. */
5806 CvFLAGS(cv) |= (CvFLAGS(PL_compcv) & CVf_BUILTIN_ATTRS);
5808 /* ... before we throw it away */
5809 SvREFCNT_dec(PL_compcv);
5817 if (strEQ(name, "import")) {
5818 PL_formfeed = MUTABLE_SV(cv);
5819 /* diag_listed_as: SKIPME */
5820 Perl_warner(aTHX_ packWARN(WARN_VOID), "0x%"UVxf"\n", PTR2UV(cv));
5824 mro_method_changed_in(GvSTASH(gv)); /* sub Foo::bar { (shift)+1 } */
5829 CvFILE_set_from_cop(cv, PL_curcop);
5830 CvSTASH(cv) = PL_curstash;
5833 /* Need to do a C<use attributes $stash_of_cv,\&cv,@attrs>. */
5834 HV *stash = name && GvSTASH(CvGV(cv)) ? GvSTASH(CvGV(cv)) : PL_curstash;
5835 apply_attrs(stash, MUTABLE_SV(cv), attrs, FALSE);
5839 sv_setpvn(MUTABLE_SV(cv), ps, ps_len);
5841 if (PL_parser && PL_parser->error_count) {
5845 const char *s = strrchr(name, ':');
5847 if (strEQ(s, "BEGIN")) {
5848 const char not_safe[] =
5849 "BEGIN not safe after errors--compilation aborted";
5850 if (PL_in_eval & EVAL_KEEPERR)
5851 Perl_croak(aTHX_ not_safe);
5853 /* force display of errors found but not reported */
5854 sv_catpv(ERRSV, not_safe);
5855 Perl_croak(aTHX_ "%"SVf, SVfARG(ERRSV));
5864 /* If we assign an optree to a PVCV, then we've defined a subroutine that
5865 the debugger could be able to set a breakpoint in, so signal to
5866 pp_entereval that it should not throw away any saved lines at scope
5869 PL_breakable_sub_gen++;
5871 CvROOT(cv) = newUNOP(OP_LEAVESUBLV, 0,
5872 mod(scalarseq(block), OP_LEAVESUBLV));
5873 block->op_attached = 1;
5876 /* This makes sub {}; work as expected. */
5877 if (block->op_type == OP_STUB) {
5878 OP* const newblock = newSTATEOP(0, NULL, 0);
5880 op_getmad(block,newblock,'B');
5887 block->op_attached = 1;
5888 CvROOT(cv) = newUNOP(OP_LEAVESUB, 0, scalarseq(block));
5890 CvROOT(cv)->op_private |= OPpREFCOUNTED;
5891 OpREFCNT_set(CvROOT(cv), 1);
5892 CvSTART(cv) = LINKLIST(CvROOT(cv));
5893 CvROOT(cv)->op_next = 0;
5894 CALL_PEEP(CvSTART(cv));
5896 /* now that optimizer has done its work, adjust pad values */
5898 pad_tidy(CvCLONE(cv) ? padtidy_SUBCLONE : padtidy_SUB);
5901 assert(!CvCONST(cv));
5902 if (ps && !*ps && op_const_sv(block, cv))
5907 if (PERLDB_SUBLINE && PL_curstash != PL_debstash) {
5908 SV * const sv = newSV(0);
5909 SV * const tmpstr = sv_newmortal();
5910 GV * const db_postponed = gv_fetchpvs("DB::postponed",
5911 GV_ADDMULTI, SVt_PVHV);
5914 Perl_sv_setpvf(aTHX_ sv, "%s:%ld-%ld",
5916 (long)PL_subline, (long)CopLINE(PL_curcop));
5917 gv_efullname3(tmpstr, gv, NULL);
5918 (void)hv_store(GvHV(PL_DBsub), SvPVX_const(tmpstr),
5919 SvCUR(tmpstr), sv, 0);
5920 hv = GvHVn(db_postponed);
5921 if (HvFILL(hv) > 0 && hv_exists(hv, SvPVX_const(tmpstr), SvCUR(tmpstr))) {
5922 CV * const pcv = GvCV(db_postponed);
5928 call_sv(MUTABLE_SV(pcv), G_DISCARD);
5933 if (name && ! (PL_parser && PL_parser->error_count))
5934 process_special_blocks(name, gv, cv);
5939 PL_parser->copline = NOLINE;
5945 S_process_special_blocks(pTHX_ const char *const fullname, GV *const gv,
5948 const char *const colon = strrchr(fullname,':');
5949 const char *const name = colon ? colon + 1 : fullname;
5951 PERL_ARGS_ASSERT_PROCESS_SPECIAL_BLOCKS;
5954 if (strEQ(name, "BEGIN")) {
5955 const I32 oldscope = PL_scopestack_ix;
5957 SAVECOPFILE(&PL_compiling);
5958 SAVECOPLINE(&PL_compiling);
5960 DEBUG_x( dump_sub(gv) );
5961 Perl_av_create_and_push(aTHX_ &PL_beginav, MUTABLE_SV(cv));
5962 GvCV(gv) = 0; /* cv has been hijacked */
5963 call_list(oldscope, PL_beginav);
5965 PL_curcop = &PL_compiling;
5966 CopHINTS_set(&PL_compiling, PL_hints);
5973 if strEQ(name, "END") {
5974 DEBUG_x( dump_sub(gv) );
5975 Perl_av_create_and_unshift_one(aTHX_ &PL_endav, MUTABLE_SV(cv));
5978 } else if (*name == 'U') {
5979 if (strEQ(name, "UNITCHECK")) {
5980 /* It's never too late to run a unitcheck block */
5981 Perl_av_create_and_unshift_one(aTHX_ &PL_unitcheckav, MUTABLE_SV(cv));
5985 } else if (*name == 'C') {
5986 if (strEQ(name, "CHECK")) {
5988 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
5989 "Too late to run CHECK block");
5990 Perl_av_create_and_unshift_one(aTHX_ &PL_checkav, MUTABLE_SV(cv));
5994 } else if (*name == 'I') {
5995 if (strEQ(name, "INIT")) {
5997 Perl_ck_warner(aTHX_ packWARN(WARN_VOID),
5998 "Too late to run INIT block");
5999 Perl_av_create_and_push(aTHX_ &PL_initav, MUTABLE_SV(cv));
6005 DEBUG_x( dump_sub(gv) );
6006 GvCV(gv) = 0; /* cv has been hijacked */
6011 =for apidoc newCONSTSUB
6013 Creates a constant sub equivalent to Perl C<sub FOO () { 123 }> which is
6014 eligible for inlining at compile-time.
6016 Passing NULL for SV creates a constant sub equivalent to C<sub BAR () {}>,
6017 which won't be called if used as a destructor, but will suppress the overhead
6018 of a call to C<AUTOLOAD>. (This form, however, isn't eligible for inlining at
6025 Perl_newCONSTSUB(pTHX_ HV *stash, const char *name, SV *sv)
6030 const char *const file = CopFILE(PL_curcop);
6032 SV *const temp_sv = CopFILESV(PL_curcop);
6033 const char *const file = temp_sv ? SvPV_nolen_const(temp_sv) : NULL;
6038 if (IN_PERL_RUNTIME) {
6039 /* at runtime, it's not safe to manipulate PL_curcop: it may be
6040 * an op shared between threads. Use a non-shared COP for our
6042 SAVEVPTR(PL_curcop);
6043 PL_curcop = &PL_compiling;
6045 SAVECOPLINE(PL_curcop);
6046 CopLINE_set(PL_curcop, PL_parser ? PL_parser->copline : NOLINE);
6049 PL_hints &= ~HINT_BLOCK_SCOPE;
6052 SAVESPTR(PL_curstash);
6053 SAVECOPSTASH(PL_curcop);
6054 PL_curstash = stash;
6055 CopSTASH_set(PL_curcop,stash);
6058 /* file becomes the CvFILE. For an XS, it's supposed to be static storage,
6059 and so doesn't get free()d. (It's expected to be from the C pre-
6060 processor __FILE__ directive). But we need a dynamically allocated one,
6061 and we need it to get freed. */
6062 cv = newXS_flags(name, const_sv_xsub, file ? file : "", "",
6063 XS_DYNAMIC_FILENAME);
6064 CvXSUBANY(cv).any_ptr = sv;
6069 CopSTASH_free(PL_curcop);
6077 Perl_newXS_flags(pTHX_ const char *name, XSUBADDR_t subaddr,
6078 const char *const filename, const char *const proto,
6081 CV *cv = newXS(name, subaddr, filename);
6083 PERL_ARGS_ASSERT_NEWXS_FLAGS;
6085 if (flags & XS_DYNAMIC_FILENAME) {
6086 /* We need to "make arrangements" (ie cheat) to ensure that the
6087 filename lasts as long as the PVCV we just created, but also doesn't
6089 STRLEN filename_len = strlen(filename);
6090 STRLEN proto_and_file_len = filename_len;
6091 char *proto_and_file;
6095 proto_len = strlen(proto);
6096 proto_and_file_len += proto_len;
6098 Newx(proto_and_file, proto_and_file_len + 1, char);
6099 Copy(proto, proto_and_file, proto_len, char);
6100 Copy(filename, proto_and_file + proto_len, filename_len + 1, char);
6103 proto_and_file = savepvn(filename, filename_len);
6106 /* This gets free()d. :-) */
6107 sv_usepvn_flags(MUTABLE_SV(cv), proto_and_file, proto_and_file_len,
6108 SV_HAS_TRAILING_NUL);
6110 /* This gives us the correct prototype, rather than one with the
6111 file name appended. */
6112 SvCUR_set(cv, proto_len);
6116 CvFILE(cv) = proto_and_file + proto_len;
6118 sv_setpv(MUTABLE_SV(cv), proto);
6124 =for apidoc U||newXS
6126 Used by C<xsubpp> to hook up XSUBs as Perl subs. I<filename> needs to be
6127 static storage, as it is used directly as CvFILE(), without a copy being made.
6133 Perl_newXS(pTHX_ const char *name, XSUBADDR_t subaddr, const char *filename)
6136 GV * const gv = gv_fetchpv(name ? name :
6137 (PL_curstash ? "__ANON__" : "__ANON__::__ANON__"),
6138 GV_ADDMULTI, SVt_PVCV);
6141 PERL_ARGS_ASSERT_NEWXS;
6144 Perl_croak(aTHX_ "panic: no address for '%s' in '%s'", name, filename);
6146 if ((cv = (name ? GvCV(gv) : NULL))) {
6148 /* just a cached method */
6152 else if (CvROOT(cv) || CvXSUB(cv) || GvASSUMECV(gv)) {
6153 /* already defined (or promised) */
6154 /* XXX It's possible for this HvNAME_get to return null, and get passed into strEQ */
6155 if (ckWARN(WARN_REDEFINE)) {
6156 GV * const gvcv = CvGV(cv);
6158 HV * const stash = GvSTASH(gvcv);
6160 const char *redefined_name = HvNAME_get(stash);
6161 if ( strEQ(redefined_name,"autouse") ) {
6162 const line_t oldline = CopLINE(PL_curcop);
6163 if (PL_parser && PL_parser->copline != NOLINE)
6164 CopLINE_set(PL_curcop, PL_parser->copline);
6165 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6166 CvCONST(cv) ? "Constant subroutine %s redefined"
6167 : "Subroutine %s redefined"
6169 CopLINE_set(PL_curcop, oldline);
6179 if (cv) /* must reuse cv if autoloaded */
6182 cv = MUTABLE_CV(newSV_type(SVt_PVCV));
6186 mro_method_changed_in(GvSTASH(gv)); /* newXS */
6190 (void)gv_fetchfile(filename);
6191 CvFILE(cv) = (char *)filename; /* NOTE: not copied, as it is expected to be
6192 an external constant string */
6194 CvXSUB(cv) = subaddr;
6197 process_special_blocks(name, gv, cv);
6209 Perl_newFORM(pTHX_ I32 floor, OP *o, OP *block)
6214 OP* pegop = newOP(OP_NULL, 0);
6218 ? gv_fetchsv(cSVOPo->op_sv, GV_ADD, SVt_PVFM)
6219 : gv_fetchpvs("STDOUT", GV_ADD|GV_NOTQUAL, SVt_PVFM);
6222 if ((cv = GvFORM(gv))) {
6223 if (ckWARN(WARN_REDEFINE)) {
6224 const line_t oldline = CopLINE(PL_curcop);
6225 if (PL_parser && PL_parser->copline != NOLINE)
6226 CopLINE_set(PL_curcop, PL_parser->copline);
6228 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6229 "Format %"SVf" redefined", SVfARG(cSVOPo->op_sv));
6231 Perl_warner(aTHX_ packWARN(WARN_REDEFINE),
6232 "Format STDOUT redefined");
6234 CopLINE_set(PL_curcop, oldline);
6241 CvFILE_set_from_cop(cv, PL_curcop);
6244 pad_tidy(padtidy_FORMAT);
6245 CvROOT(cv) = newUNOP(OP_LEAVEWRITE, 0, scalarseq(block));
6246 CvROOT(cv)->op_private |= OPpREFCOUNTED;
6247 OpREFCNT_set(CvROOT(cv), 1);
6248 CvSTART(cv) = LINKLIST(CvROOT(cv));
6249 CvROOT(cv)->op_next = 0;
6250 CALL_PEEP(CvSTART(cv));
6252 op_getmad(o,pegop,'n');
6253 op_getmad_weak(block, pegop, 'b');
6258 PL_parser->copline = NOLINE;
6266 Perl_newANONLIST(pTHX_ OP *o)
6268 return convert(OP_ANONLIST, OPf_SPECIAL, o);
6272 Perl_newANONHASH(pTHX_ OP *o)
6274 return convert(OP_ANONHASH, OPf_SPECIAL, o);
6278 Perl_newANONSUB(pTHX_ I32 floor, OP *proto, OP *block)
6280 return newANONATTRSUB(floor, proto, NULL, block);
6284 Perl_newANONATTRSUB(pTHX_ I32 floor, OP *proto, OP *attrs, OP *block)
6286 return newUNOP(OP_REFGEN, 0,
6287 newSVOP(OP_ANONCODE, 0,
6288 MUTABLE_SV(newATTRSUB(floor, 0, proto, attrs, block))));
6292 Perl_oopsAV(pTHX_ OP *o)
6296 PERL_ARGS_ASSERT_OOPSAV;
6298 switch (o->op_type) {
6300 o->op_type = OP_PADAV;
6301 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6302 return ref(o, OP_RV2AV);
6305 o->op_type = OP_RV2AV;
6306 o->op_ppaddr = PL_ppaddr[OP_RV2AV];
6311 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsAV");
6318 Perl_oopsHV(pTHX_ OP *o)
6322 PERL_ARGS_ASSERT_OOPSHV;
6324 switch (o->op_type) {
6327 o->op_type = OP_PADHV;
6328 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6329 return ref(o, OP_RV2HV);
6333 o->op_type = OP_RV2HV;
6334 o->op_ppaddr = PL_ppaddr[OP_RV2HV];
6339 Perl_ck_warner_d(aTHX_ packWARN(WARN_INTERNAL), "oops: oopsHV");
6346 Perl_newAVREF(pTHX_ OP *o)
6350 PERL_ARGS_ASSERT_NEWAVREF;
6352 if (o->op_type == OP_PADANY) {
6353 o->op_type = OP_PADAV;
6354 o->op_ppaddr = PL_ppaddr[OP_PADAV];
6357 else if ((o->op_type == OP_RV2AV || o->op_type == OP_PADAV)) {
6358 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6359 "Using an array as a reference is deprecated");
6361 return newUNOP(OP_RV2AV, 0, scalar(o));
6365 Perl_newGVREF(pTHX_ I32 type, OP *o)
6367 if (type == OP_MAPSTART || type == OP_GREPSTART || type == OP_SORT)
6368 return newUNOP(OP_NULL, 0, o);
6369 return ref(newUNOP(OP_RV2GV, OPf_REF, o), type);
6373 Perl_newHVREF(pTHX_ OP *o)
6377 PERL_ARGS_ASSERT_NEWHVREF;
6379 if (o->op_type == OP_PADANY) {
6380 o->op_type = OP_PADHV;
6381 o->op_ppaddr = PL_ppaddr[OP_PADHV];
6384 else if ((o->op_type == OP_RV2HV || o->op_type == OP_PADHV)) {
6385 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6386 "Using a hash as a reference is deprecated");
6388 return newUNOP(OP_RV2HV, 0, scalar(o));
6392 Perl_newCVREF(pTHX_ I32 flags, OP *o)
6394 return newUNOP(OP_RV2CV, flags, scalar(o));
6398 Perl_newSVREF(pTHX_ OP *o)
6402 PERL_ARGS_ASSERT_NEWSVREF;
6404 if (o->op_type == OP_PADANY) {
6405 o->op_type = OP_PADSV;
6406 o->op_ppaddr = PL_ppaddr[OP_PADSV];
6409 return newUNOP(OP_RV2SV, 0, scalar(o));
6412 /* Check routines. See the comments at the top of this file for details
6413 * on when these are called */
6416 Perl_ck_anoncode(pTHX_ OP *o)
6418 PERL_ARGS_ASSERT_CK_ANONCODE;
6420 cSVOPo->op_targ = pad_add_anon(cSVOPo->op_sv, o->op_type);
6422 cSVOPo->op_sv = NULL;
6427 Perl_ck_bitop(pTHX_ OP *o)
6431 PERL_ARGS_ASSERT_CK_BITOP;
6433 #define OP_IS_NUMCOMPARE(op) \
6434 ((op) == OP_LT || (op) == OP_I_LT || \
6435 (op) == OP_GT || (op) == OP_I_GT || \
6436 (op) == OP_LE || (op) == OP_I_LE || \
6437 (op) == OP_GE || (op) == OP_I_GE || \
6438 (op) == OP_EQ || (op) == OP_I_EQ || \
6439 (op) == OP_NE || (op) == OP_I_NE || \
6440 (op) == OP_NCMP || (op) == OP_I_NCMP)
6441 o->op_private = (U8)(PL_hints & HINT_INTEGER);
6442 if (!(o->op_flags & OPf_STACKED) /* Not an assignment */
6443 && (o->op_type == OP_BIT_OR
6444 || o->op_type == OP_BIT_AND
6445 || o->op_type == OP_BIT_XOR))
6447 const OP * const left = cBINOPo->op_first;
6448 const OP * const right = left->op_sibling;
6449 if ((OP_IS_NUMCOMPARE(left->op_type) &&
6450 (left->op_flags & OPf_PARENS) == 0) ||
6451 (OP_IS_NUMCOMPARE(right->op_type) &&
6452 (right->op_flags & OPf_PARENS) == 0))
6453 Perl_ck_warner(aTHX_ packWARN(WARN_PRECEDENCE),
6454 "Possible precedence problem on bitwise %c operator",
6455 o->op_type == OP_BIT_OR ? '|'
6456 : o->op_type == OP_BIT_AND ? '&' : '^'
6463 Perl_ck_concat(pTHX_ OP *o)
6465 const OP * const kid = cUNOPo->op_first;
6467 PERL_ARGS_ASSERT_CK_CONCAT;
6468 PERL_UNUSED_CONTEXT;
6470 if (kid->op_type == OP_CONCAT && !(kid->op_private & OPpTARGET_MY) &&
6471 !(kUNOP->op_first->op_flags & OPf_MOD))
6472 o->op_flags |= OPf_STACKED;
6477 Perl_ck_spair(pTHX_ OP *o)
6481 PERL_ARGS_ASSERT_CK_SPAIR;
6483 if (o->op_flags & OPf_KIDS) {
6486 const OPCODE type = o->op_type;
6487 o = modkids(ck_fun(o), type);
6488 kid = cUNOPo->op_first;
6489 newop = kUNOP->op_first->op_sibling;
6491 const OPCODE type = newop->op_type;
6492 if (newop->op_sibling || !(PL_opargs[type] & OA_RETSCALAR) ||
6493 type == OP_PADAV || type == OP_PADHV ||
6494 type == OP_RV2AV || type == OP_RV2HV)
6498 op_getmad(kUNOP->op_first,newop,'K');
6500 op_free(kUNOP->op_first);
6502 kUNOP->op_first = newop;
6504 o->op_ppaddr = PL_ppaddr[++o->op_type];
6509 Perl_ck_delete(pTHX_ OP *o)
6511 PERL_ARGS_ASSERT_CK_DELETE;
6515 if (o->op_flags & OPf_KIDS) {
6516 OP * const kid = cUNOPo->op_first;
6517 switch (kid->op_type) {
6519 o->op_flags |= OPf_SPECIAL;
6522 o->op_private |= OPpSLICE;
6525 o->op_flags |= OPf_SPECIAL;
6530 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or slice",
6533 if (kid->op_private & OPpLVAL_INTRO)
6534 o->op_private |= OPpLVAL_INTRO;
6541 Perl_ck_die(pTHX_ OP *o)
6543 PERL_ARGS_ASSERT_CK_DIE;
6546 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6552 Perl_ck_eof(pTHX_ OP *o)
6556 PERL_ARGS_ASSERT_CK_EOF;
6558 if (o->op_flags & OPf_KIDS) {
6559 if (cLISTOPo->op_first->op_type == OP_STUB) {
6561 = newUNOP(o->op_type, OPf_SPECIAL, newGVOP(OP_GV, 0, PL_argvgv));
6563 op_getmad(o,newop,'O');
6575 Perl_ck_eval(pTHX_ OP *o)
6579 PERL_ARGS_ASSERT_CK_EVAL;
6581 PL_hints |= HINT_BLOCK_SCOPE;
6582 if (o->op_flags & OPf_KIDS) {
6583 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6586 o->op_flags &= ~OPf_KIDS;
6589 else if (kid->op_type == OP_LINESEQ || kid->op_type == OP_STUB) {
6595 cUNOPo->op_first = 0;
6600 NewOp(1101, enter, 1, LOGOP);
6601 enter->op_type = OP_ENTERTRY;
6602 enter->op_ppaddr = PL_ppaddr[OP_ENTERTRY];
6603 enter->op_private = 0;
6605 /* establish postfix order */
6606 enter->op_next = (OP*)enter;
6608 o = prepend_elem(OP_LINESEQ, (OP*)enter, (OP*)kid);
6609 o->op_type = OP_LEAVETRY;
6610 o->op_ppaddr = PL_ppaddr[OP_LEAVETRY];
6611 enter->op_other = o;
6612 op_getmad(oldo,o,'O');
6626 o = newUNOP(OP_ENTEREVAL, 0, newDEFSVOP());
6627 op_getmad(oldo,o,'O');
6629 o->op_targ = (PADOFFSET)PL_hints;
6630 if ((PL_hints & HINT_LOCALIZE_HH) != 0 && GvHV(PL_hintgv)) {
6631 /* Store a copy of %^H that pp_entereval can pick up. */
6632 OP *hhop = newSVOP(OP_HINTSEVAL, 0,
6633 MUTABLE_SV(Perl_hv_copy_hints_hv(aTHX_ GvHV(PL_hintgv))));
6634 cUNOPo->op_first->op_sibling = hhop;
6635 o->op_private |= OPpEVAL_HAS_HH;
6641 Perl_ck_exit(pTHX_ OP *o)
6643 PERL_ARGS_ASSERT_CK_EXIT;
6646 HV * const table = GvHV(PL_hintgv);
6648 SV * const * const svp = hv_fetchs(table, "vmsish_exit", FALSE);
6649 if (svp && *svp && SvTRUE(*svp))
6650 o->op_private |= OPpEXIT_VMSISH;
6652 if (VMSISH_HUSHED) o->op_private |= OPpHUSH_VMSISH;
6658 Perl_ck_exec(pTHX_ OP *o)
6660 PERL_ARGS_ASSERT_CK_EXEC;
6662 if (o->op_flags & OPf_STACKED) {
6665 kid = cUNOPo->op_first->op_sibling;
6666 if (kid->op_type == OP_RV2GV)
6675 Perl_ck_exists(pTHX_ OP *o)
6679 PERL_ARGS_ASSERT_CK_EXISTS;
6682 if (o->op_flags & OPf_KIDS) {
6683 OP * const kid = cUNOPo->op_first;
6684 if (kid->op_type == OP_ENTERSUB) {
6685 (void) ref(kid, o->op_type);
6686 if (kid->op_type != OP_RV2CV
6687 && !(PL_parser && PL_parser->error_count))
6688 Perl_croak(aTHX_ "%s argument is not a subroutine name",
6690 o->op_private |= OPpEXISTS_SUB;
6692 else if (kid->op_type == OP_AELEM)
6693 o->op_flags |= OPf_SPECIAL;
6694 else if (kid->op_type != OP_HELEM)
6695 Perl_croak(aTHX_ "%s argument is not a HASH or ARRAY element or a subroutine",
6703 Perl_ck_rvconst(pTHX_ register OP *o)
6706 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6708 PERL_ARGS_ASSERT_CK_RVCONST;
6710 o->op_private |= (PL_hints & HINT_STRICT_REFS);
6711 if (o->op_type == OP_RV2CV)
6712 o->op_private &= ~1;
6714 if (kid->op_type == OP_CONST) {
6717 SV * const kidsv = kid->op_sv;
6719 /* Is it a constant from cv_const_sv()? */
6720 if (SvROK(kidsv) && SvREADONLY(kidsv)) {
6721 SV * const rsv = SvRV(kidsv);
6722 const svtype type = SvTYPE(rsv);
6723 const char *badtype = NULL;
6725 switch (o->op_type) {
6727 if (type > SVt_PVMG)
6728 badtype = "a SCALAR";
6731 if (type != SVt_PVAV)
6732 badtype = "an ARRAY";
6735 if (type != SVt_PVHV)
6739 if (type != SVt_PVCV)
6744 Perl_croak(aTHX_ "Constant is not %s reference", badtype);
6747 else if ((o->op_type == OP_RV2HV || o->op_type == OP_RV2SV) &&
6748 (PL_hints & HINT_STRICT_REFS) && SvPOK(kidsv)) {
6749 /* If this is an access to a stash, disable "strict refs", because
6750 * stashes aren't auto-vivified at compile-time (unless we store
6751 * symbols in them), and we don't want to produce a run-time
6752 * stricture error when auto-vivifying the stash. */
6753 const char *s = SvPV_nolen(kidsv);
6754 const STRLEN l = SvCUR(kidsv);
6755 if (l > 1 && s[l-1] == ':' && s[l-2] == ':')
6756 o->op_private &= ~HINT_STRICT_REFS;
6758 if ((o->op_private & HINT_STRICT_REFS) && (kid->op_private & OPpCONST_BARE)) {
6759 const char *badthing;
6760 switch (o->op_type) {
6762 badthing = "a SCALAR";
6765 badthing = "an ARRAY";
6768 badthing = "a HASH";
6776 "Can't use bareword (\"%"SVf"\") as %s ref while \"strict refs\" in use",
6777 SVfARG(kidsv), badthing);
6780 * This is a little tricky. We only want to add the symbol if we
6781 * didn't add it in the lexer. Otherwise we get duplicate strict
6782 * warnings. But if we didn't add it in the lexer, we must at
6783 * least pretend like we wanted to add it even if it existed before,
6784 * or we get possible typo warnings. OPpCONST_ENTERED says
6785 * whether the lexer already added THIS instance of this symbol.
6787 iscv = (o->op_type == OP_RV2CV) * 2;
6789 gv = gv_fetchsv(kidsv,
6790 iscv | !(kid->op_private & OPpCONST_ENTERED),
6793 : o->op_type == OP_RV2SV
6795 : o->op_type == OP_RV2AV
6797 : o->op_type == OP_RV2HV
6800 } while (!gv && !(kid->op_private & OPpCONST_ENTERED) && !iscv++);
6802 kid->op_type = OP_GV;
6803 SvREFCNT_dec(kid->op_sv);
6805 /* XXX hack: dependence on sizeof(PADOP) <= sizeof(SVOP) */
6806 kPADOP->op_padix = pad_alloc(OP_GV, SVs_PADTMP);
6807 SvREFCNT_dec(PAD_SVl(kPADOP->op_padix));
6809 PAD_SETSV(kPADOP->op_padix, MUTABLE_SV(SvREFCNT_inc_simple_NN(gv)));
6811 kid->op_sv = SvREFCNT_inc_simple_NN(gv);
6813 kid->op_private = 0;
6814 kid->op_ppaddr = PL_ppaddr[OP_GV];
6821 Perl_ck_ftst(pTHX_ OP *o)
6824 const I32 type = o->op_type;
6826 PERL_ARGS_ASSERT_CK_FTST;
6828 if (o->op_flags & OPf_REF) {
6831 else if (o->op_flags & OPf_KIDS && cUNOPo->op_first->op_type != OP_STUB) {
6832 SVOP * const kid = (SVOP*)cUNOPo->op_first;
6833 const OPCODE kidtype = kid->op_type;
6835 if (kidtype == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
6836 OP * const newop = newGVOP(type, OPf_REF,
6837 gv_fetchsv(kid->op_sv, GV_ADD, SVt_PVIO));
6839 op_getmad(o,newop,'O');
6845 if ((PL_hints & HINT_FILETEST_ACCESS) && OP_IS_FILETEST_ACCESS(o->op_type))
6846 o->op_private |= OPpFT_ACCESS;
6847 if (PL_check[kidtype] == MEMBER_TO_FPTR(Perl_ck_ftst)
6848 && kidtype != OP_STAT && kidtype != OP_LSTAT)
6849 o->op_private |= OPpFT_STACKED;
6857 if (type == OP_FTTTY)
6858 o = newGVOP(type, OPf_REF, PL_stdingv);
6860 o = newUNOP(type, 0, newDEFSVOP());
6861 op_getmad(oldo,o,'O');
6867 Perl_ck_fun(pTHX_ OP *o)
6870 const int type = o->op_type;
6871 register I32 oa = PL_opargs[type] >> OASHIFT;
6873 PERL_ARGS_ASSERT_CK_FUN;
6875 if (o->op_flags & OPf_STACKED) {
6876 if ((oa & OA_OPTIONAL) && (oa >> 4) && !((oa >> 4) & OA_OPTIONAL))
6879 return no_fh_allowed(o);
6882 if (o->op_flags & OPf_KIDS) {
6883 OP **tokid = &cLISTOPo->op_first;
6884 register OP *kid = cLISTOPo->op_first;
6888 if (kid->op_type == OP_PUSHMARK ||
6889 (kid->op_type == OP_NULL && kid->op_targ == OP_PUSHMARK))
6891 tokid = &kid->op_sibling;
6892 kid = kid->op_sibling;
6894 if (!kid && PL_opargs[type] & OA_DEFGV)
6895 *tokid = kid = newDEFSVOP();
6899 sibl = kid->op_sibling;
6901 if (!sibl && kid->op_type == OP_STUB) {
6908 /* list seen where single (scalar) arg expected? */
6909 if (numargs == 1 && !(oa >> 4)
6910 && kid->op_type == OP_LIST && type != OP_SCALAR)
6912 return too_many_arguments(o,PL_op_desc[type]);
6925 if ((type == OP_PUSH || type == OP_UNSHIFT)
6926 && !kid->op_sibling)
6927 Perl_ck_warner(aTHX_ packWARN(WARN_SYNTAX),
6928 "Useless use of %s with no values",
6931 if (kid->op_type == OP_CONST &&
6932 (kid->op_private & OPpCONST_BARE))
6934 OP * const newop = newAVREF(newGVOP(OP_GV, 0,
6935 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVAV) ));
6936 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6937 "Array @%"SVf" missing the @ in argument %"IVdf" of %s()",
6938 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6940 op_getmad(kid,newop,'K');
6945 kid->op_sibling = sibl;
6948 else if (kid->op_type != OP_RV2AV && kid->op_type != OP_PADAV)
6949 bad_type(numargs, "array", PL_op_desc[type], kid);
6953 if (kid->op_type == OP_CONST &&
6954 (kid->op_private & OPpCONST_BARE))
6956 OP * const newop = newHVREF(newGVOP(OP_GV, 0,
6957 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVHV) ));
6958 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
6959 "Hash %%%"SVf" missing the %% in argument %"IVdf" of %s()",
6960 SVfARG(((SVOP*)kid)->op_sv), (IV)numargs, PL_op_desc[type]);
6962 op_getmad(kid,newop,'K');
6967 kid->op_sibling = sibl;
6970 else if (kid->op_type != OP_RV2HV && kid->op_type != OP_PADHV)
6971 bad_type(numargs, "hash", PL_op_desc[type], kid);
6976 OP * const newop = newUNOP(OP_NULL, 0, kid);
6977 kid->op_sibling = 0;
6979 newop->op_next = newop;
6981 kid->op_sibling = sibl;
6986 if (kid->op_type != OP_GV && kid->op_type != OP_RV2GV) {
6987 if (kid->op_type == OP_CONST &&
6988 (kid->op_private & OPpCONST_BARE))
6990 OP * const newop = newGVOP(OP_GV, 0,
6991 gv_fetchsv(((SVOP*)kid)->op_sv, GV_ADD, SVt_PVIO));
6992 if (!(o->op_private & 1) && /* if not unop */
6993 kid == cLISTOPo->op_last)
6994 cLISTOPo->op_last = newop;
6996 op_getmad(kid,newop,'K');
7002 else if (kid->op_type == OP_READLINE) {
7003 /* neophyte patrol: open(<FH>), close(<FH>) etc. */
7004 bad_type(numargs, "HANDLE", OP_DESC(o), kid);
7007 I32 flags = OPf_SPECIAL;
7011 /* is this op a FH constructor? */
7012 if (is_handle_constructor(o,numargs)) {
7013 const char *name = NULL;
7017 /* Set a flag to tell rv2gv to vivify
7018 * need to "prove" flag does not mean something
7019 * else already - NI-S 1999/05/07
7022 if (kid->op_type == OP_PADSV) {
7024 = PAD_COMPNAME_SV(kid->op_targ);
7025 name = SvPV_const(namesv, len);
7027 else if (kid->op_type == OP_RV2SV
7028 && kUNOP->op_first->op_type == OP_GV)
7030 GV * const gv = cGVOPx_gv(kUNOP->op_first);
7032 len = GvNAMELEN(gv);
7034 else if (kid->op_type == OP_AELEM
7035 || kid->op_type == OP_HELEM)
7038 OP *op = ((BINOP*)kid)->op_first;
7042 const char * const a =
7043 kid->op_type == OP_AELEM ?
7045 if (((op->op_type == OP_RV2AV) ||
7046 (op->op_type == OP_RV2HV)) &&
7047 (firstop = ((UNOP*)op)->op_first) &&
7048 (firstop->op_type == OP_GV)) {
7049 /* packagevar $a[] or $h{} */
7050 GV * const gv = cGVOPx_gv(firstop);
7058 else if (op->op_type == OP_PADAV
7059 || op->op_type == OP_PADHV) {
7060 /* lexicalvar $a[] or $h{} */
7061 const char * const padname =
7062 PAD_COMPNAME_PV(op->op_targ);
7071 name = SvPV_const(tmpstr, len);
7076 name = "__ANONIO__";
7083 targ = pad_alloc(OP_RV2GV, SVs_PADTMP);
7084 namesv = PAD_SVl(targ);
7085 SvUPGRADE(namesv, SVt_PV);
7087 sv_setpvs(namesv, "$");
7088 sv_catpvn(namesv, name, len);
7091 kid->op_sibling = 0;
7092 kid = newUNOP(OP_RV2GV, flags, scalar(kid));
7093 kid->op_targ = targ;
7094 kid->op_private |= priv;
7096 kid->op_sibling = sibl;
7102 mod(scalar(kid), type);
7106 tokid = &kid->op_sibling;
7107 kid = kid->op_sibling;
7110 if (kid && kid->op_type != OP_STUB)
7111 return too_many_arguments(o,OP_DESC(o));
7112 o->op_private |= numargs;
7114 /* FIXME - should the numargs move as for the PERL_MAD case? */
7115 o->op_private |= numargs;
7117 return too_many_arguments(o,OP_DESC(o));
7121 else if (PL_opargs[type] & OA_DEFGV) {
7123 OP *newop = newUNOP(type, 0, newDEFSVOP());
7124 op_getmad(o,newop,'O');
7127 /* Ordering of these two is important to keep f_map.t passing. */
7129 return newUNOP(type, 0, newDEFSVOP());
7134 while (oa & OA_OPTIONAL)
7136 if (oa && oa != OA_LIST)
7137 return too_few_arguments(o,OP_DESC(o));
7143 Perl_ck_glob(pTHX_ OP *o)
7148 PERL_ARGS_ASSERT_CK_GLOB;
7151 if ((o->op_flags & OPf_KIDS) && !cLISTOPo->op_first->op_sibling)
7152 append_elem(OP_GLOB, o, newDEFSVOP());
7154 if (!((gv = gv_fetchpvs("glob", GV_NOTQUAL, SVt_PVCV))
7155 && GvCVu(gv) && GvIMPORTED_CV(gv)))
7157 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7160 #if !defined(PERL_EXTERNAL_GLOB)
7161 /* XXX this can be tightened up and made more failsafe. */
7162 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7165 Perl_load_module(aTHX_ PERL_LOADMOD_NOIMPORT,
7166 newSVpvs("File::Glob"), NULL, NULL, NULL);
7167 gv = gv_fetchpvs("CORE::GLOBAL::glob", 0, SVt_PVCV);
7168 glob_gv = gv_fetchpvs("File::Glob::csh_glob", 0, SVt_PVCV);
7169 GvCV(gv) = GvCV(glob_gv);
7170 SvREFCNT_inc_void(MUTABLE_SV(GvCV(gv)));
7171 GvIMPORTED_CV_on(gv);
7174 #endif /* PERL_EXTERNAL_GLOB */
7176 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7177 append_elem(OP_GLOB, o,
7178 newSVOP(OP_CONST, 0, newSViv(PL_glob_index++)));
7179 o->op_type = OP_LIST;
7180 o->op_ppaddr = PL_ppaddr[OP_LIST];
7181 cLISTOPo->op_first->op_type = OP_PUSHMARK;
7182 cLISTOPo->op_first->op_ppaddr = PL_ppaddr[OP_PUSHMARK];
7183 cLISTOPo->op_first->op_targ = 0;
7184 o = newUNOP(OP_ENTERSUB, OPf_STACKED,
7185 append_elem(OP_LIST, o,
7186 scalar(newUNOP(OP_RV2CV, 0,
7187 newGVOP(OP_GV, 0, gv)))));
7188 o = newUNOP(OP_NULL, 0, ck_subr(o));
7189 o->op_targ = OP_GLOB; /* hint at what it used to be */
7192 gv = newGVgen("main");
7194 append_elem(OP_GLOB, o, newGVOP(OP_GV, 0, gv));
7200 Perl_ck_grep(pTHX_ OP *o)
7205 const OPCODE type = o->op_type == OP_GREPSTART ? OP_GREPWHILE : OP_MAPWHILE;
7208 PERL_ARGS_ASSERT_CK_GREP;
7210 o->op_ppaddr = PL_ppaddr[OP_GREPSTART];
7211 /* don't allocate gwop here, as we may leak it if PL_parser->error_count > 0 */
7213 if (o->op_flags & OPf_STACKED) {
7216 kid = cUNOPx(cLISTOPo->op_first->op_sibling)->op_first;
7217 if (kid->op_type != OP_SCOPE && kid->op_type != OP_LEAVE)
7218 return no_fh_allowed(o);
7219 for (k = kid; k; k = k->op_next) {
7222 NewOp(1101, gwop, 1, LOGOP);
7223 kid->op_next = (OP*)gwop;
7224 o->op_flags &= ~OPf_STACKED;
7226 kid = cLISTOPo->op_first->op_sibling;
7227 if (type == OP_MAPWHILE)
7232 if (PL_parser && PL_parser->error_count)
7234 kid = cLISTOPo->op_first->op_sibling;
7235 if (kid->op_type != OP_NULL)
7236 Perl_croak(aTHX_ "panic: ck_grep");
7237 kid = kUNOP->op_first;
7240 NewOp(1101, gwop, 1, LOGOP);
7241 gwop->op_type = type;
7242 gwop->op_ppaddr = PL_ppaddr[type];
7243 gwop->op_first = listkids(o);
7244 gwop->op_flags |= OPf_KIDS;
7245 gwop->op_other = LINKLIST(kid);
7246 kid->op_next = (OP*)gwop;
7247 offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
7248 if (offset == NOT_IN_PAD || PAD_COMPNAME_FLAGS_isOUR(offset)) {
7249 o->op_private = gwop->op_private = 0;
7250 gwop->op_targ = pad_alloc(type, SVs_PADTMP);
7253 o->op_private = gwop->op_private = OPpGREP_LEX;
7254 gwop->op_targ = o->op_targ = offset;
7257 kid = cLISTOPo->op_first->op_sibling;
7258 if (!kid || !kid->op_sibling)
7259 return too_few_arguments(o,OP_DESC(o));
7260 for (kid = kid->op_sibling; kid; kid = kid->op_sibling)
7261 mod(kid, OP_GREPSTART);
7267 Perl_ck_index(pTHX_ OP *o)
7269 PERL_ARGS_ASSERT_CK_INDEX;
7271 if (o->op_flags & OPf_KIDS) {
7272 OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7274 kid = kid->op_sibling; /* get past "big" */
7275 if (kid && kid->op_type == OP_CONST)
7276 fbm_compile(((SVOP*)kid)->op_sv, 0);
7282 Perl_ck_lfun(pTHX_ OP *o)
7284 const OPCODE type = o->op_type;
7286 PERL_ARGS_ASSERT_CK_LFUN;
7288 return modkids(ck_fun(o), type);
7292 Perl_ck_defined(pTHX_ OP *o) /* 19990527 MJD */
7294 PERL_ARGS_ASSERT_CK_DEFINED;
7296 if ((o->op_flags & OPf_KIDS)) {
7297 switch (cUNOPo->op_first->op_type) {
7299 /* This is needed for
7300 if (defined %stash::)
7301 to work. Do not break Tk.
7303 break; /* Globals via GV can be undef */
7305 case OP_AASSIGN: /* Is this a good idea? */
7306 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7307 "defined(@array) is deprecated");
7308 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7309 "\t(Maybe you should just omit the defined()?)\n");
7313 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7314 "defined(%%hash) is deprecated");
7315 Perl_ck_warner_d(aTHX_ packWARN(WARN_DEPRECATED),
7316 "\t(Maybe you should just omit the defined()?)\n");
7327 Perl_ck_readline(pTHX_ OP *o)
7329 PERL_ARGS_ASSERT_CK_READLINE;
7331 if (!(o->op_flags & OPf_KIDS)) {
7333 = newUNOP(OP_READLINE, 0, newGVOP(OP_GV, 0, PL_argvgv));
7335 op_getmad(o,newop,'O');
7345 Perl_ck_rfun(pTHX_ OP *o)
7347 const OPCODE type = o->op_type;
7349 PERL_ARGS_ASSERT_CK_RFUN;
7351 return refkids(ck_fun(o), type);
7355 Perl_ck_listiob(pTHX_ OP *o)
7359 PERL_ARGS_ASSERT_CK_LISTIOB;
7361 kid = cLISTOPo->op_first;
7364 kid = cLISTOPo->op_first;
7366 if (kid->op_type == OP_PUSHMARK)
7367 kid = kid->op_sibling;
7368 if (kid && o->op_flags & OPf_STACKED)
7369 kid = kid->op_sibling;
7370 else if (kid && !kid->op_sibling) { /* print HANDLE; */
7371 if (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE) {
7372 o->op_flags |= OPf_STACKED; /* make it a filehandle */
7373 kid = newUNOP(OP_RV2GV, OPf_REF, scalar(kid));
7374 cLISTOPo->op_first->op_sibling = kid;
7375 cLISTOPo->op_last = kid;
7376 kid = kid->op_sibling;
7381 append_elem(o->op_type, o, newDEFSVOP());
7387 Perl_ck_smartmatch(pTHX_ OP *o)
7390 if (0 == (o->op_flags & OPf_SPECIAL)) {
7391 OP *first = cBINOPo->op_first;
7392 OP *second = first->op_sibling;
7394 /* Implicitly take a reference to an array or hash */
7395 first->op_sibling = NULL;
7396 first = cBINOPo->op_first = ref_array_or_hash(first);
7397 second = first->op_sibling = ref_array_or_hash(second);
7399 /* Implicitly take a reference to a regular expression */
7400 if (first->op_type == OP_MATCH) {
7401 first->op_type = OP_QR;
7402 first->op_ppaddr = PL_ppaddr[OP_QR];
7404 if (second->op_type == OP_MATCH) {
7405 second->op_type = OP_QR;
7406 second->op_ppaddr = PL_ppaddr[OP_QR];
7415 Perl_ck_sassign(pTHX_ OP *o)
7418 OP * const kid = cLISTOPo->op_first;
7420 PERL_ARGS_ASSERT_CK_SASSIGN;
7422 /* has a disposable target? */
7423 if ((PL_opargs[kid->op_type] & OA_TARGLEX)
7424 && !(kid->op_flags & OPf_STACKED)
7425 /* Cannot steal the second time! */
7426 && !(kid->op_private & OPpTARGET_MY)
7427 /* Keep the full thing for madskills */
7431 OP * const kkid = kid->op_sibling;
7433 /* Can just relocate the target. */
7434 if (kkid && kkid->op_type == OP_PADSV
7435 && !(kkid->op_private & OPpLVAL_INTRO))
7437 kid->op_targ = kkid->op_targ;
7439 /* Now we do not need PADSV and SASSIGN. */
7440 kid->op_sibling = o->op_sibling; /* NULL */
7441 cLISTOPo->op_first = NULL;
7444 kid->op_private |= OPpTARGET_MY; /* Used for context settings */
7448 if (kid->op_sibling) {
7449 OP *kkid = kid->op_sibling;
7450 if (kkid->op_type == OP_PADSV
7451 && (kkid->op_private & OPpLVAL_INTRO)
7452 && SvPAD_STATE(*av_fetch(PL_comppad_name, kkid->op_targ, FALSE))) {
7453 const PADOFFSET target = kkid->op_targ;
7454 OP *const other = newOP(OP_PADSV,
7456 | ((kkid->op_private & ~OPpLVAL_INTRO) << 8));
7457 OP *const first = newOP(OP_NULL, 0);
7458 OP *const nullop = newCONDOP(0, first, o, other);
7459 OP *const condop = first->op_next;
7460 /* hijacking PADSTALE for uninitialized state variables */
7461 SvPADSTALE_on(PAD_SVl(target));
7463 condop->op_type = OP_ONCE;
7464 condop->op_ppaddr = PL_ppaddr[OP_ONCE];
7465 condop->op_targ = target;
7466 other->op_targ = target;
7468 /* Because we change the type of the op here, we will skip the
7469 assinment binop->op_last = binop->op_first->op_sibling; at the
7470 end of Perl_newBINOP(). So need to do it here. */
7471 cBINOPo->op_last = cBINOPo->op_first->op_sibling;
7480 Perl_ck_match(pTHX_ OP *o)
7484 PERL_ARGS_ASSERT_CK_MATCH;
7486 if (o->op_type != OP_QR && PL_compcv) {
7487 const PADOFFSET offset = Perl_pad_findmy(aTHX_ STR_WITH_LEN("$_"), 0);
7488 if (offset != NOT_IN_PAD && !(PAD_COMPNAME_FLAGS_isOUR(offset))) {
7489 o->op_targ = offset;
7490 o->op_private |= OPpTARGET_MY;
7493 if (o->op_type == OP_MATCH || o->op_type == OP_QR)
7494 o->op_private |= OPpRUNTIME;
7499 Perl_ck_method(pTHX_ OP *o)
7501 OP * const kid = cUNOPo->op_first;
7503 PERL_ARGS_ASSERT_CK_METHOD;
7505 if (kid->op_type == OP_CONST) {
7506 SV* sv = kSVOP->op_sv;
7507 const char * const method = SvPVX_const(sv);
7508 if (!(strchr(method, ':') || strchr(method, '\''))) {
7510 if (!SvREADONLY(sv) || !SvFAKE(sv)) {
7511 sv = newSVpvn_share(method, SvCUR(sv), 0);
7514 kSVOP->op_sv = NULL;
7516 cmop = newSVOP(OP_METHOD_NAMED, 0, sv);
7518 op_getmad(o,cmop,'O');
7529 Perl_ck_null(pTHX_ OP *o)
7531 PERL_ARGS_ASSERT_CK_NULL;
7532 PERL_UNUSED_CONTEXT;
7537 Perl_ck_open(pTHX_ OP *o)
7540 HV * const table = GvHV(PL_hintgv);
7542 PERL_ARGS_ASSERT_CK_OPEN;
7545 SV **svp = hv_fetchs(table, "open_IN", FALSE);
7548 const char *d = SvPV_const(*svp, len);
7549 const I32 mode = mode_from_discipline(d, len);
7550 if (mode & O_BINARY)
7551 o->op_private |= OPpOPEN_IN_RAW;
7552 else if (mode & O_TEXT)
7553 o->op_private |= OPpOPEN_IN_CRLF;
7556 svp = hv_fetchs(table, "open_OUT", FALSE);
7559 const char *d = SvPV_const(*svp, len);
7560 const I32 mode = mode_from_discipline(d, len);
7561 if (mode & O_BINARY)
7562 o->op_private |= OPpOPEN_OUT_RAW;
7563 else if (mode & O_TEXT)
7564 o->op_private |= OPpOPEN_OUT_CRLF;
7567 if (o->op_type == OP_BACKTICK) {
7568 if (!(o->op_flags & OPf_KIDS)) {
7569 OP * const newop = newUNOP(OP_BACKTICK, 0, newDEFSVOP());
7571 op_getmad(o,newop,'O');
7580 /* In case of three-arg dup open remove strictness
7581 * from the last arg if it is a bareword. */
7582 OP * const first = cLISTOPx(o)->op_first; /* The pushmark. */
7583 OP * const last = cLISTOPx(o)->op_last; /* The bareword. */
7587 if ((last->op_type == OP_CONST) && /* The bareword. */
7588 (last->op_private & OPpCONST_BARE) &&
7589 (last->op_private & OPpCONST_STRICT) &&
7590 (oa = first->op_sibling) && /* The fh. */
7591 (oa = oa->op_sibling) && /* The mode. */
7592 (oa->op_type == OP_CONST) &&
7593 SvPOK(((SVOP*)oa)->op_sv) &&
7594 (mode = SvPVX_const(((SVOP*)oa)->op_sv)) &&
7595 mode[0] == '>' && mode[1] == '&' && /* A dup open. */
7596 (last == oa->op_sibling)) /* The bareword. */
7597 last->op_private &= ~OPpCONST_STRICT;
7603 Perl_ck_repeat(pTHX_ OP *o)
7605 PERL_ARGS_ASSERT_CK_REPEAT;
7607 if (cBINOPo->op_first->op_flags & OPf_PARENS) {
7608 o->op_private |= OPpREPEAT_DOLIST;
7609 cBINOPo->op_first = force_list(cBINOPo->op_first);
7617 Perl_ck_require(pTHX_ OP *o)
7622 PERL_ARGS_ASSERT_CK_REQUIRE;
7624 if (o->op_flags & OPf_KIDS) { /* Shall we supply missing .pm? */
7625 SVOP * const kid = (SVOP*)cUNOPo->op_first;
7627 if (kid->op_type == OP_CONST && (kid->op_private & OPpCONST_BARE)) {
7628 SV * const sv = kid->op_sv;
7629 U32 was_readonly = SvREADONLY(sv);
7636 sv_force_normal_flags(sv, 0);
7637 assert(!SvREADONLY(sv));
7647 for (; s < end; s++) {
7648 if (*s == ':' && s[1] == ':') {
7650 Move(s+2, s+1, end - s - 1, char);
7655 sv_catpvs(sv, ".pm");
7656 SvFLAGS(sv) |= was_readonly;
7660 if (!(o->op_flags & OPf_SPECIAL)) { /* Wasn't written as CORE::require */
7661 /* handle override, if any */
7662 gv = gv_fetchpvs("require", GV_NOTQUAL, SVt_PVCV);
7663 if (!(gv && GvCVu(gv) && GvIMPORTED_CV(gv))) {
7664 GV * const * const gvp = (GV**)hv_fetchs(PL_globalstash, "require", FALSE);
7665 gv = gvp ? *gvp : NULL;
7669 if (gv && GvCVu(gv) && GvIMPORTED_CV(gv)) {
7670 OP * const kid = cUNOPo->op_first;
7673 cUNOPo->op_first = 0;
7677 newop = ck_subr(newUNOP(OP_ENTERSUB, OPf_STACKED,
7678 append_elem(OP_LIST, kid,
7679 scalar(newUNOP(OP_RV2CV, 0,
7682 op_getmad(o,newop,'O');
7686 return scalar(ck_fun(o));
7690 Perl_ck_return(pTHX_ OP *o)
7695 PERL_ARGS_ASSERT_CK_RETURN;
7697 kid = cLISTOPo->op_first->op_sibling;
7698 if (CvLVALUE(PL_compcv)) {
7699 for (; kid; kid = kid->op_sibling)
7700 mod(kid, OP_LEAVESUBLV);
7702 for (; kid; kid = kid->op_sibling)
7703 if ((kid->op_type == OP_NULL)
7704 && ((kid->op_flags & (OPf_SPECIAL|OPf_KIDS)) == (OPf_SPECIAL|OPf_KIDS))) {
7705 /* This is a do block */
7706 OP *op = kUNOP->op_first;
7707 if (op->op_type == OP_LEAVE && op->op_flags & OPf_KIDS) {
7708 op = cUNOPx(op)->op_first;
7709 assert(op->op_type == OP_ENTER && !(op->op_flags & OPf_SPECIAL));
7710 /* Force the use of the caller's context */
7711 op->op_flags |= OPf_SPECIAL;
7720 Perl_ck_select(pTHX_ OP *o)
7725 PERL_ARGS_ASSERT_CK_SELECT;
7727 if (o->op_flags & OPf_KIDS) {
7728 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7729 if (kid && kid->op_sibling) {
7730 o->op_type = OP_SSELECT;
7731 o->op_ppaddr = PL_ppaddr[OP_SSELECT];
7733 return fold_constants(o);
7737 kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7738 if (kid && kid->op_type == OP_RV2GV)
7739 kid->op_private &= ~HINT_STRICT_REFS;
7744 Perl_ck_shift(pTHX_ OP *o)
7747 const I32 type = o->op_type;
7749 PERL_ARGS_ASSERT_CK_SHIFT;
7751 if (!(o->op_flags & OPf_KIDS)) {
7752 OP *argop = newUNOP(OP_RV2AV, 0,
7753 scalar(newGVOP(OP_GV, 0, CvUNIQUE(PL_compcv) ? PL_argvgv : PL_defgv)));
7755 OP * const oldo = o;
7756 o = newUNOP(type, 0, scalar(argop));
7757 op_getmad(oldo,o,'O');
7761 return newUNOP(type, 0, scalar(argop));
7764 return scalar(modkids(ck_fun(o), type));
7768 Perl_ck_sort(pTHX_ OP *o)
7773 PERL_ARGS_ASSERT_CK_SORT;
7775 if (o->op_type == OP_SORT && (PL_hints & HINT_LOCALIZE_HH) != 0) {
7776 HV * const hinthv = GvHV(PL_hintgv);
7778 SV ** const svp = hv_fetchs(hinthv, "sort", FALSE);
7780 const I32 sorthints = (I32)SvIV(*svp);
7781 if ((sorthints & HINT_SORT_QUICKSORT) != 0)
7782 o->op_private |= OPpSORT_QSORT;
7783 if ((sorthints & HINT_SORT_STABLE) != 0)
7784 o->op_private |= OPpSORT_STABLE;
7789 if (o->op_type == OP_SORT && o->op_flags & OPf_STACKED)
7791 firstkid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7792 if (o->op_flags & OPf_STACKED) { /* may have been cleared */
7794 OP *kid = cUNOPx(firstkid)->op_first; /* get past null */
7796 if (kid->op_type == OP_SCOPE || kid->op_type == OP_LEAVE) {
7798 if (kid->op_type == OP_SCOPE) {
7802 else if (kid->op_type == OP_LEAVE) {
7803 if (o->op_type == OP_SORT) {
7804 op_null(kid); /* wipe out leave */
7807 for (k = kLISTOP->op_first->op_next; k; k = k->op_next) {
7808 if (k->op_next == kid)
7810 /* don't descend into loops */
7811 else if (k->op_type == OP_ENTERLOOP
7812 || k->op_type == OP_ENTERITER)
7814 k = cLOOPx(k)->op_lastop;
7819 kid->op_next = 0; /* just disconnect the leave */
7820 k = kLISTOP->op_first;
7825 if (o->op_type == OP_SORT) {
7826 /* provide scalar context for comparison function/block */
7832 o->op_flags |= OPf_SPECIAL;
7834 else if (kid->op_type == OP_RV2SV || kid->op_type == OP_PADSV)
7837 firstkid = firstkid->op_sibling;
7840 /* provide list context for arguments */
7841 if (o->op_type == OP_SORT)
7848 S_simplify_sort(pTHX_ OP *o)
7851 register OP *kid = cLISTOPo->op_first->op_sibling; /* get past pushmark */
7857 PERL_ARGS_ASSERT_SIMPLIFY_SORT;
7859 if (!(o->op_flags & OPf_STACKED))
7861 GvMULTI_on(gv_fetchpvs("a", GV_ADD|GV_NOTQUAL, SVt_PV));
7862 GvMULTI_on(gv_fetchpvs("b", GV_ADD|GV_NOTQUAL, SVt_PV));
7863 kid = kUNOP->op_first; /* get past null */
7864 if (kid->op_type != OP_SCOPE)
7866 kid = kLISTOP->op_last; /* get past scope */
7867 switch(kid->op_type) {
7875 k = kid; /* remember this node*/
7876 if (kBINOP->op_first->op_type != OP_RV2SV)
7878 kid = kBINOP->op_first; /* get past cmp */
7879 if (kUNOP->op_first->op_type != OP_GV)
7881 kid = kUNOP->op_first; /* get past rv2sv */
7883 if (GvSTASH(gv) != PL_curstash)
7885 gvname = GvNAME(gv);
7886 if (*gvname == 'a' && gvname[1] == '\0')
7888 else if (*gvname == 'b' && gvname[1] == '\0')
7893 kid = k; /* back to cmp */
7894 if (kBINOP->op_last->op_type != OP_RV2SV)
7896 kid = kBINOP->op_last; /* down to 2nd arg */
7897 if (kUNOP->op_first->op_type != OP_GV)
7899 kid = kUNOP->op_first; /* get past rv2sv */
7901 if (GvSTASH(gv) != PL_curstash)
7903 gvname = GvNAME(gv);
7905 ? !(*gvname == 'a' && gvname[1] == '\0')
7906 : !(*gvname == 'b' && gvname[1] == '\0'))
7908 o->op_flags &= ~(OPf_STACKED | OPf_SPECIAL);
7910 o->op_private |= OPpSORT_DESCEND;
7911 if (k->op_type == OP_NCMP)
7912 o->op_private |= OPpSORT_NUMERIC;
7913 if (k->op_type == OP_I_NCMP)
7914 o->op_private |= OPpSORT_NUMERIC | OPpSORT_INTEGER;
7915 kid = cLISTOPo->op_first->op_sibling;
7916 cLISTOPo->op_first->op_sibling = kid->op_sibling; /* bypass old block */
7918 op_getmad(kid,o,'S'); /* then delete it */
7920 op_free(kid); /* then delete it */
7925 Perl_ck_split(pTHX_ OP *o)
7930 PERL_ARGS_ASSERT_CK_SPLIT;
7932 if (o->op_flags & OPf_STACKED)
7933 return no_fh_allowed(o);
7935 kid = cLISTOPo->op_first;
7936 if (kid->op_type != OP_NULL)
7937 Perl_croak(aTHX_ "panic: ck_split");
7938 kid = kid->op_sibling;
7939 op_free(cLISTOPo->op_first);
7940 cLISTOPo->op_first = kid;
7942 cLISTOPo->op_first = kid = newSVOP(OP_CONST, 0, newSVpvs(" "));
7943 cLISTOPo->op_last = kid; /* There was only one element previously */
7946 if (kid->op_type != OP_MATCH || kid->op_flags & OPf_STACKED) {
7947 OP * const sibl = kid->op_sibling;
7948 kid->op_sibling = 0;
7949 kid = pmruntime( newPMOP(OP_MATCH, OPf_SPECIAL), kid, 0);
7950 if (cLISTOPo->op_first == cLISTOPo->op_last)
7951 cLISTOPo->op_last = kid;
7952 cLISTOPo->op_first = kid;
7953 kid->op_sibling = sibl;
7956 kid->op_type = OP_PUSHRE;
7957 kid->op_ppaddr = PL_ppaddr[OP_PUSHRE];
7959 if (((PMOP *)kid)->op_pmflags & PMf_GLOBAL) {
7960 Perl_ck_warner(aTHX_ packWARN(WARN_REGEXP),
7961 "Use of /g modifier is meaningless in split");
7964 if (!kid->op_sibling)
7965 append_elem(OP_SPLIT, o, newDEFSVOP());
7967 kid = kid->op_sibling;
7970 if (!kid->op_sibling)
7971 append_elem(OP_SPLIT, o, newSVOP(OP_CONST, 0, newSViv(0)));
7972 assert(kid->op_sibling);
7974 kid = kid->op_sibling;
7977 if (kid->op_sibling)
7978 return too_many_arguments(o,OP_DESC(o));
7984 Perl_ck_join(pTHX_ OP *o)
7986 const OP * const kid = cLISTOPo->op_first->op_sibling;
7988 PERL_ARGS_ASSERT_CK_JOIN;
7990 if (kid && kid->op_type == OP_MATCH) {
7991 if (ckWARN(WARN_SYNTAX)) {
7992 const REGEXP *re = PM_GETRE(kPMOP);
7993 const char *pmstr = re ? RX_PRECOMP_const(re) : "STRING";
7994 const STRLEN len = re ? RX_PRELEN(re) : 6;
7995 Perl_warner(aTHX_ packWARN(WARN_SYNTAX),
7996 "/%.*s/ should probably be written as \"%.*s\"",
7997 (int)len, pmstr, (int)len, pmstr);
8004 Perl_ck_subr(pTHX_ OP *o)
8007 OP *prev = ((cUNOPo->op_first->op_sibling)
8008 ? cUNOPo : ((UNOP*)cUNOPo->op_first))->op_first;
8009 OP *o2 = prev->op_sibling;
8011 const char *proto = NULL;
8012 const char *proto_end = NULL;
8017 I32 contextclass = 0;
8018 const char *e = NULL;
8021 PERL_ARGS_ASSERT_CK_SUBR;
8023 o->op_private |= OPpENTERSUB_HASTARG;
8024 for (cvop = o2; cvop->op_sibling; cvop = cvop->op_sibling) ;
8025 if (cvop->op_type == OP_RV2CV) {
8026 o->op_private |= (cvop->op_private & OPpENTERSUB_AMPER);
8027 op_null(cvop); /* disable rv2cv */
8028 if (!(o->op_private & OPpENTERSUB_AMPER)) {
8029 SVOP *tmpop = (SVOP*)((UNOP*)cvop)->op_first;
8031 switch (tmpop->op_type) {
8033 gv = cGVOPx_gv(tmpop);
8036 tmpop->op_private |= OPpEARLY_CV;
8039 SV *sv = cSVOPx_sv(tmpop);
8040 if (SvROK(sv) && SvTYPE(SvRV(sv)) == SVt_PVCV)
8044 if (cv && SvPOK(cv)) {
8046 namegv = gv && CvANON(cv) ? gv : CvGV(cv);
8047 proto = SvPV(MUTABLE_SV(cv), len);
8048 proto_end = proto + len;
8052 else if (cvop->op_type == OP_METHOD || cvop->op_type == OP_METHOD_NAMED) {
8053 if (o2->op_type == OP_CONST)
8054 o2->op_private &= ~OPpCONST_STRICT;
8055 else if (o2->op_type == OP_LIST) {
8056 OP * const sib = ((UNOP*)o2)->op_first->op_sibling;
8057 if (sib && sib->op_type == OP_CONST)
8058 sib->op_private &= ~OPpCONST_STRICT;
8061 o->op_private |= (PL_hints & HINT_STRICT_REFS);
8062 if (PERLDB_SUB && PL_curstash != PL_debstash)
8063 o->op_private |= OPpENTERSUB_DB;
8064 while (o2 != cvop) {
8066 if (PL_madskills && o2->op_type == OP_STUB) {
8067 o2 = o2->op_sibling;
8070 if (PL_madskills && o2->op_type == OP_NULL)
8071 o3 = ((UNOP*)o2)->op_first;
8075 if (proto >= proto_end)
8076 return too_many_arguments(o, gv_ename(namegv));
8084 /* _ must be at the end */
8085 if (proto[1] && proto[1] != ';')
8100 if (o3->op_type != OP_REFGEN && o3->op_type != OP_UNDEF)
8102 arg == 1 ? "block or sub {}" : "sub {}",
8103 gv_ename(namegv), o3);
8106 /* '*' allows any scalar type, including bareword */
8109 if (o3->op_type == OP_RV2GV)
8110 goto wrapref; /* autoconvert GLOB -> GLOBref */
8111 else if (o3->op_type == OP_CONST)
8112 o3->op_private &= ~OPpCONST_STRICT;
8113 else if (o3->op_type == OP_ENTERSUB) {
8114 /* accidental subroutine, revert to bareword */
8115 OP *gvop = ((UNOP*)o3)->op_first;
8116 if (gvop && gvop->op_type == OP_NULL) {
8117 gvop = ((UNOP*)gvop)->op_first;
8119 for (; gvop->op_sibling; gvop = gvop->op_sibling)
8122 (gvop->op_private & OPpENTERSUB_NOPAREN) &&
8123 (gvop = ((UNOP*)gvop)->op_first) &&
8124 gvop->op_type == OP_GV)
8126 GV * const gv = cGVOPx_gv(gvop);
8127 OP * const sibling = o2->op_sibling;
8128 SV * const n = newSVpvs("");
8130 OP * const oldo2 = o2;
8134 gv_fullname4(n, gv, "", FALSE);
8135 o2 = newSVOP(OP_CONST, 0, n);
8136 op_getmad(oldo2,o2,'O');
8137 prev->op_sibling = o2;
8138 o2->op_sibling = sibling;
8154 if (contextclass++ == 0) {
8155 e = strchr(proto, ']');
8156 if (!e || e == proto)
8165 const char *p = proto;
8166 const char *const end = proto;
8168 while (*--p != '[') {}
8169 bad_type(arg, Perl_form(aTHX_ "one of %.*s",
8171 gv_ename(namegv), o3);
8176 if (o3->op_type == OP_RV2GV)
8179 bad_type(arg, "symbol", gv_ename(namegv), o3);
8182 if (o3->op_type == OP_ENTERSUB)
8185 bad_type(arg, "subroutine entry", gv_ename(namegv),
8189 if (o3->op_type == OP_RV2SV ||
8190 o3->op_type == OP_PADSV ||
8191 o3->op_type == OP_HELEM ||
8192 o3->op_type == OP_AELEM)
8195 bad_type(arg, "scalar", gv_ename(namegv), o3);
8198 if (o3->op_type == OP_RV2AV ||
8199 o3->op_type == OP_PADAV)
8202 bad_type(arg, "array", gv_ename(namegv), o3);
8205 if (o3->op_type == OP_RV2HV ||
8206 o3->op_type == OP_PADHV)
8209 bad_type(arg, "hash", gv_ename(namegv), o3);
8214 OP* const sib = kid->op_sibling;
8215 kid->op_sibling = 0;
8216 o2 = newUNOP(OP_REFGEN, 0, kid);
8217 o2->op_sibling = sib;
8218 prev->op_sibling = o2;
8220 if (contextclass && e) {
8235 Perl_croak(aTHX_ "Malformed prototype for %s: %"SVf,
8236 gv_ename(namegv), SVfARG(cv));
8241 mod(o2, OP_ENTERSUB);
8243 o2 = o2->op_sibling;
8245 if (o2 == cvop && proto && *proto == '_') {
8246 /* generate an access to $_ */
8248 o2->op_sibling = prev->op_sibling;
8249 prev->op_sibling = o2; /* instead of cvop */
8251 if (proto && !optional && proto_end > proto &&
8252 (*proto != '@' && *proto != '%' && *proto != ';' && *proto != '_'))
8253 return too_few_arguments(o, gv_ename(namegv));
8256 OP * const oldo = o;
8260 o=newSVOP(OP_CONST, 0, newSViv(0));
8261 op_getmad(oldo,o,'O');
8267 Perl_ck_svconst(pTHX_ OP *o)
8269 PERL_ARGS_ASSERT_CK_SVCONST;
8270 PERL_UNUSED_CONTEXT;
8271 SvREADONLY_on(cSVOPo->op_sv);
8276 Perl_ck_chdir(pTHX_ OP *o)
8278 if (o->op_flags & OPf_KIDS) {
8279 SVOP * const kid = (SVOP*)cUNOPo->op_first;
8281 if (kid && kid->op_type == OP_CONST &&
8282 (kid->op_private & OPpCONST_BARE))
8284 o->op_flags |= OPf_SPECIAL;
8285 kid->op_private &= ~OPpCONST_STRICT;
8292 Perl_ck_trunc(pTHX_ OP *o)
8294 PERL_ARGS_ASSERT_CK_TRUNC;
8296 if (o->op_flags & OPf_KIDS) {
8297 SVOP *kid = (SVOP*)cUNOPo->op_first;
8299 if (kid->op_type == OP_NULL)
8300 kid = (SVOP*)kid->op_sibling;
8301 if (kid && kid->op_type == OP_CONST &&
8302 (kid->op_private & OPpCONST_BARE))
8304 o->op_flags |= OPf_SPECIAL;
8305 kid->op_private &= ~OPpCONST_STRICT;
8312 Perl_ck_unpack(pTHX_ OP *o)
8314 OP *kid = cLISTOPo->op_first;
8316 PERL_ARGS_ASSERT_CK_UNPACK;
8318 if (kid->op_sibling) {
8319 kid = kid->op_sibling;
8320 if (!kid->op_sibling)
8321 kid->op_sibling = newDEFSVOP();
8327 Perl_ck_substr(pTHX_ OP *o)
8329 PERL_ARGS_ASSERT_CK_SUBSTR;
8332 if ((o->op_flags & OPf_KIDS) && (o->op_private == 4)) {
8333 OP *kid = cLISTOPo->op_first;
8335 if (kid->op_type == OP_NULL)
8336 kid = kid->op_sibling;
8338 kid->op_flags |= OPf_MOD;
8345 Perl_ck_each(pTHX_ OP *o)
8348 OP *kid = o->op_flags & OPf_KIDS ? cLISTOPo->op_first : NULL;
8350 PERL_ARGS_ASSERT_CK_EACH;
8353 if (kid->op_type == OP_PADAV || kid->op_type == OP_RV2AV) {
8354 const unsigned new_type = o->op_type == OP_EACH ? OP_AEACH
8355 : o->op_type == OP_KEYS ? OP_AKEYS : OP_AVALUES;
8356 o->op_type = new_type;
8357 o->op_ppaddr = PL_ppaddr[new_type];
8359 else if (!(kid->op_type == OP_PADHV || kid->op_type == OP_RV2HV
8360 || (kid->op_type == OP_CONST && kid->op_private & OPpCONST_BARE)
8362 bad_type(1, "hash or array", PL_op_desc[o->op_type], kid);
8369 /* caller is supposed to assign the return to the
8370 container of the rep_op var */
8372 S_opt_scalarhv(pTHX_ OP *rep_op) {
8376 PERL_ARGS_ASSERT_OPT_SCALARHV;
8378 NewOp(1101, unop, 1, UNOP);
8379 unop->op_type = (OPCODE)OP_BOOLKEYS;
8380 unop->op_ppaddr = PL_ppaddr[OP_BOOLKEYS];
8381 unop->op_flags = (U8)(OPf_WANT_SCALAR | OPf_KIDS );
8382 unop->op_private = (U8)(1 | ((OPf_WANT_SCALAR | OPf_KIDS) >> 8));
8383 unop->op_first = rep_op;
8384 unop->op_next = rep_op->op_next;
8385 rep_op->op_next = (OP*)unop;
8386 rep_op->op_flags|=(OPf_REF | OPf_MOD);
8387 unop->op_sibling = rep_op->op_sibling;
8388 rep_op->op_sibling = NULL;
8389 /* unop->op_targ = pad_alloc(OP_BOOLKEYS, SVs_PADTMP); */
8390 if (rep_op->op_type == OP_PADHV) {
8391 rep_op->op_flags &= ~OPf_WANT_SCALAR;
8392 rep_op->op_flags |= OPf_WANT_LIST;
8397 /* Checks if o acts as an in-place operator on an array. oright points to the
8398 * beginning of the right-hand side. Returns the left-hand side of the
8399 * assignment if o acts in-place, or NULL otherwise. */
8402 S_is_inplace_av(pTHX_ OP *o, OP *oright) {
8406 PERL_ARGS_ASSERT_IS_INPLACE_AV;
8409 (oright->op_type != OP_RV2AV && oright->op_type != OP_PADAV)
8410 || oright->op_next != o
8411 || (oright->op_private & OPpLVAL_INTRO)
8415 /* o2 follows the chain of op_nexts through the LHS of the
8416 * assign (if any) to the aassign op itself */
8418 if (!o2 || o2->op_type != OP_NULL)
8421 if (!o2 || o2->op_type != OP_PUSHMARK)
8424 if (o2 && o2->op_type == OP_GV)
8427 || (o2->op_type != OP_PADAV && o2->op_type != OP_RV2AV)
8428 || (o2->op_private & OPpLVAL_INTRO)
8433 if (!o2 || o2->op_type != OP_NULL)
8436 if (!o2 || o2->op_type != OP_AASSIGN
8437 || (o2->op_flags & OPf_WANT) != OPf_WANT_VOID)
8440 /* check that the sort is the first arg on RHS of assign */
8442 o2 = cUNOPx(o2)->op_first;
8443 if (!o2 || o2->op_type != OP_NULL)
8445 o2 = cUNOPx(o2)->op_first;
8446 if (!o2 || o2->op_type != OP_PUSHMARK)
8448 if (o2->op_sibling != o)
8451 /* check the array is the same on both sides */
8452 if (oleft->op_type == OP_RV2AV) {
8453 if (oright->op_type != OP_RV2AV
8454 || !cUNOPx(oright)->op_first
8455 || cUNOPx(oright)->op_first->op_type != OP_GV
8456 || cGVOPx_gv(cUNOPx(oleft)->op_first) !=
8457 cGVOPx_gv(cUNOPx(oright)->op_first)
8461 else if (oright->op_type != OP_PADAV
8462 || oright->op_targ != oleft->op_targ
8469 /* A peephole optimizer. We visit the ops in the order they're to execute.
8470 * See the comments at the top of this file for more details about when
8471 * peep() is called */
8474 Perl_peep(pTHX_ register OP *o)
8477 register OP* oldop = NULL;
8479 if (!o || o->op_opt)
8483 SAVEVPTR(PL_curcop);
8484 for (; o; o = o->op_next) {
8487 /* By default, this op has now been optimised. A couple of cases below
8488 clear this again. */
8491 switch (o->op_type) {
8494 PL_curcop = ((COP*)o); /* for warnings */
8498 if (cSVOPo->op_private & OPpCONST_STRICT)
8499 no_bareword_allowed(o);
8502 case OP_METHOD_NAMED:
8503 /* Relocate sv to the pad for thread safety.
8504 * Despite being a "constant", the SV is written to,
8505 * for reference counts, sv_upgrade() etc. */
8507 const PADOFFSET ix = pad_alloc(OP_CONST, SVs_PADTMP);
8508 if (o->op_type != OP_METHOD_NAMED && SvPADTMP(cSVOPo->op_sv)) {
8509 /* If op_sv is already a PADTMP then it is being used by
8510 * some pad, so make a copy. */
8511 sv_setsv(PAD_SVl(ix),cSVOPo->op_sv);
8512 SvREADONLY_on(PAD_SVl(ix));
8513 SvREFCNT_dec(cSVOPo->op_sv);
8515 else if (o->op_type != OP_METHOD_NAMED
8516 && cSVOPo->op_sv == &PL_sv_undef) {
8517 /* PL_sv_undef is hack - it's unsafe to store it in the
8518 AV that is the pad, because av_fetch treats values of
8519 PL_sv_undef as a "free" AV entry and will merrily
8520 replace them with a new SV, causing pad_alloc to think
8521 that this pad slot is free. (When, clearly, it is not)
8523 SvOK_off(PAD_SVl(ix));
8524 SvPADTMP_on(PAD_SVl(ix));
8525 SvREADONLY_on(PAD_SVl(ix));
8528 SvREFCNT_dec(PAD_SVl(ix));
8529 SvPADTMP_on(cSVOPo->op_sv);
8530 PAD_SETSV(ix, cSVOPo->op_sv);
8531 /* XXX I don't know how this isn't readonly already. */
8532 SvREADONLY_on(PAD_SVl(ix));
8534 cSVOPo->op_sv = NULL;
8541 if (o->op_next && o->op_next->op_type == OP_STRINGIFY) {
8542 if (o->op_next->op_private & OPpTARGET_MY) {
8543 if (o->op_flags & OPf_STACKED) /* chained concats */
8544 break; /* ignore_optimization */
8546 /* assert(PL_opargs[o->op_type] & OA_TARGLEX); */
8547 o->op_targ = o->op_next->op_targ;
8548 o->op_next->op_targ = 0;
8549 o->op_private |= OPpTARGET_MY;
8552 op_null(o->op_next);
8556 if ((o->op_flags & OPf_WANT) != OPf_WANT_LIST) {
8557 break; /* Scalar stub must produce undef. List stub is noop */
8561 if (o->op_targ == OP_NEXTSTATE
8562 || o->op_targ == OP_DBSTATE)
8564 PL_curcop = ((COP*)o);
8566 /* XXX: We avoid setting op_seq here to prevent later calls
8567 to peep() from mistakenly concluding that optimisation
8568 has already occurred. This doesn't fix the real problem,
8569 though (See 20010220.007). AMS 20010719 */
8570 /* op_seq functionality is now replaced by op_opt */
8577 if (oldop && o->op_next) {
8578 oldop->op_next = o->op_next;
8586 if (o->op_type == OP_PADAV || o->op_next->op_type == OP_RV2AV) {
8587 OP* const pop = (o->op_type == OP_PADAV) ?
8588 o->op_next : o->op_next->op_next;
8590 if (pop && pop->op_type == OP_CONST &&
8591 ((PL_op = pop->op_next)) &&
8592 pop->op_next->op_type == OP_AELEM &&
8593 !(pop->op_next->op_private &
8594 (OPpLVAL_INTRO|OPpLVAL_DEFER|OPpDEREF|OPpMAYBE_LVSUB)) &&
8595 (i = SvIV(((SVOP*)pop)->op_sv) - CopARYBASE_get(PL_curcop))
8600 if (cSVOPx(pop)->op_private & OPpCONST_STRICT)
8601 no_bareword_allowed(pop);
8602 if (o->op_type == OP_GV)
8603 op_null(o->op_next);
8604 op_null(pop->op_next);
8606 o->op_flags |= pop->op_next->op_flags & OPf_MOD;
8607 o->op_next = pop->op_next->op_next;
8608 o->op_ppaddr = PL_ppaddr[OP_AELEMFAST];
8609 o->op_private = (U8)i;
8610 if (o->op_type == OP_GV) {
8615 o->op_flags |= OPf_SPECIAL;
8616 o->op_type = OP_AELEMFAST;
8621 if (o->op_next->op_type == OP_RV2SV) {
8622 if (!(o->op_next->op_private & OPpDEREF)) {
8623 op_null(o->op_next);
8624 o->op_private |= o->op_next->op_private & (OPpLVAL_INTRO
8626 o->op_next = o->op_next->op_next;
8627 o->op_type = OP_GVSV;
8628 o->op_ppaddr = PL_ppaddr[OP_GVSV];
8631 else if ((o->op_private & OPpEARLY_CV) && ckWARN(WARN_PROTOTYPE)) {
8632 GV * const gv = cGVOPo_gv;
8633 if (SvTYPE(gv) == SVt_PVGV && GvCV(gv) && SvPVX_const(GvCV(gv))) {
8634 /* XXX could check prototype here instead of just carping */
8635 SV * const sv = sv_newmortal();
8636 gv_efullname3(sv, gv, NULL);
8637 Perl_warner(aTHX_ packWARN(WARN_PROTOTYPE),
8638 "%"SVf"() called too early to check prototype",
8642 else if (o->op_next->op_type == OP_READLINE
8643 && o->op_next->op_next->op_type == OP_CONCAT
8644 && (o->op_next->op_next->op_flags & OPf_STACKED))
8646 /* Turn "$a .= <FH>" into an OP_RCATLINE. AMS 20010917 */
8647 o->op_type = OP_RCATLINE;
8648 o->op_flags |= OPf_STACKED;
8649 o->op_ppaddr = PL_ppaddr[OP_RCATLINE];
8650 op_null(o->op_next->op_next);
8651 op_null(o->op_next);
8661 fop = cUNOP->op_first;
8669 fop = cLOGOP->op_first;
8670 sop = fop->op_sibling;
8671 while (cLOGOP->op_other->op_type == OP_NULL)
8672 cLOGOP->op_other = cLOGOP->op_other->op_next;
8673 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
8677 if ((fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
8679 (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV)
8684 if (!((nop->op_flags & OPf_WANT) == OPf_WANT_VOID)) {
8685 while (nop && nop->op_next) {
8686 switch (nop->op_next->op_type) {
8691 lop = nop = nop->op_next;
8702 if ((lop->op_flags & OPf_WANT) == OPf_WANT_VOID) {
8703 if (fop->op_type == OP_PADHV || fop->op_type == OP_RV2HV)
8704 cLOGOP->op_first = opt_scalarhv(fop);
8705 if (sop && (sop->op_type == OP_PADHV || sop->op_type == OP_RV2HV))
8706 cLOGOP->op_first->op_sibling = opt_scalarhv(sop);
8722 while (cLOGOP->op_other->op_type == OP_NULL)
8723 cLOGOP->op_other = cLOGOP->op_other->op_next;
8724 peep(cLOGOP->op_other); /* Recursive calls are not replaced by fptr calls */
8729 while (cLOOP->op_redoop->op_type == OP_NULL)
8730 cLOOP->op_redoop = cLOOP->op_redoop->op_next;
8731 peep(cLOOP->op_redoop);
8732 while (cLOOP->op_nextop->op_type == OP_NULL)
8733 cLOOP->op_nextop = cLOOP->op_nextop->op_next;
8734 peep(cLOOP->op_nextop);
8735 while (cLOOP->op_lastop->op_type == OP_NULL)
8736 cLOOP->op_lastop = cLOOP->op_lastop->op_next;
8737 peep(cLOOP->op_lastop);
8741 assert(!(cPMOP->op_pmflags & PMf_ONCE));
8742 while (cPMOP->op_pmstashstartu.op_pmreplstart &&
8743 cPMOP->op_pmstashstartu.op_pmreplstart->op_type == OP_NULL)
8744 cPMOP->op_pmstashstartu.op_pmreplstart
8745 = cPMOP->op_pmstashstartu.op_pmreplstart->op_next;
8746 peep(cPMOP->op_pmstashstartu.op_pmreplstart);
8750 if (o->op_next && o->op_next->op_type == OP_NEXTSTATE
8751 && ckWARN(WARN_SYNTAX))
8753 if (o->op_next->op_sibling) {
8754 const OPCODE type = o->op_next->op_sibling->op_type;
8755 if (type != OP_EXIT && type != OP_WARN && type != OP_DIE) {
8756 const line_t oldline = CopLINE(PL_curcop);
8757 CopLINE_set(PL_curcop, CopLINE((COP*)o->op_next));
8758 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8759 "Statement unlikely to be reached");
8760 Perl_warner(aTHX_ packWARN(WARN_EXEC),
8761 "\t(Maybe you meant system() when you said exec()?)\n");
8762 CopLINE_set(PL_curcop, oldline);
8773 const char *key = NULL;
8776 if (((BINOP*)o)->op_last->op_type != OP_CONST)
8779 /* Make the CONST have a shared SV */
8780 svp = cSVOPx_svp(((BINOP*)o)->op_last);
8781 if (!SvFAKE(sv = *svp) || !SvREADONLY(sv)) {
8782 key = SvPV_const(sv, keylen);
8783 lexname = newSVpvn_share(key,
8784 SvUTF8(sv) ? -(I32)keylen : (I32)keylen,
8790 if ((o->op_private & (OPpLVAL_INTRO)))
8793 rop = (UNOP*)((BINOP*)o)->op_first;
8794 if (rop->op_type != OP_RV2HV || rop->op_first->op_type != OP_PADSV)
8796 lexname = *av_fetch(PL_comppad_name, rop->op_first->op_targ, TRUE);
8797 if (!SvPAD_TYPED(lexname))
8799 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8800 if (!fields || !GvHV(*fields))
8802 key = SvPV_const(*svp, keylen);
8803 if (!hv_fetch(GvHV(*fields), key,
8804 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8806 Perl_croak(aTHX_ "No such class field \"%s\" "
8807 "in variable %s of type %s",
8808 key, SvPV_nolen_const(lexname), HvNAME_get(SvSTASH(lexname)));
8821 SVOP *first_key_op, *key_op;
8823 if ((o->op_private & (OPpLVAL_INTRO))
8824 /* I bet there's always a pushmark... */
8825 || ((LISTOP*)o)->op_first->op_sibling->op_type != OP_LIST)
8826 /* hmmm, no optimization if list contains only one key. */
8828 rop = (UNOP*)((LISTOP*)o)->op_last;
8829 if (rop->op_type != OP_RV2HV)
8831 if (rop->op_first->op_type == OP_PADSV)
8832 /* @$hash{qw(keys here)} */
8833 rop = (UNOP*)rop->op_first;
8835 /* @{$hash}{qw(keys here)} */
8836 if (rop->op_first->op_type == OP_SCOPE
8837 && cLISTOPx(rop->op_first)->op_last->op_type == OP_PADSV)
8839 rop = (UNOP*)cLISTOPx(rop->op_first)->op_last;
8845 lexname = *av_fetch(PL_comppad_name, rop->op_targ, TRUE);
8846 if (!SvPAD_TYPED(lexname))
8848 fields = (GV**)hv_fetchs(SvSTASH(lexname), "FIELDS", FALSE);
8849 if (!fields || !GvHV(*fields))
8851 /* Again guessing that the pushmark can be jumped over.... */
8852 first_key_op = (SVOP*)((LISTOP*)((LISTOP*)o)->op_first->op_sibling)
8853 ->op_first->op_sibling;
8854 for (key_op = first_key_op; key_op;
8855 key_op = (SVOP*)key_op->op_sibling) {
8856 if (key_op->op_type != OP_CONST)
8858 svp = cSVOPx_svp(key_op);
8859 key = SvPV_const(*svp, keylen);
8860 if (!hv_fetch(GvHV(*fields), key,
8861 SvUTF8(*svp) ? -(I32)keylen : (I32)keylen, FALSE))
8863 Perl_croak(aTHX_ "No such class field \"%s\" "
8864 "in variable %s of type %s",
8865 key, SvPV_nolen(lexname), HvNAME_get(SvSTASH(lexname)));
8872 /* will point to RV2AV or PADAV op on LHS/RHS of assign */
8876 /* check that RHS of sort is a single plain array */
8877 OP *oright = cUNOPo->op_first;
8878 if (!oright || oright->op_type != OP_PUSHMARK)
8881 /* reverse sort ... can be optimised. */
8882 if (!cUNOPo->op_sibling) {
8883 /* Nothing follows us on the list. */
8884 OP * const reverse = o->op_next;
8886 if (reverse->op_type == OP_REVERSE &&
8887 (reverse->op_flags & OPf_WANT) == OPf_WANT_LIST) {
8888 OP * const pushmark = cUNOPx(reverse)->op_first;
8889 if (pushmark && (pushmark->op_type == OP_PUSHMARK)
8890 && (cUNOPx(pushmark)->op_sibling == o)) {
8891 /* reverse -> pushmark -> sort */
8892 o->op_private |= OPpSORT_REVERSE;
8894 pushmark->op_next = oright->op_next;
8900 /* make @a = sort @a act in-place */
8902 oright = cUNOPx(oright)->op_sibling;
8905 if (oright->op_type == OP_NULL) { /* skip sort block/sub */
8906 oright = cUNOPx(oright)->op_sibling;
8909 oleft = is_inplace_av(o, oright);
8913 /* transfer MODishness etc from LHS arg to RHS arg */
8914 oright->op_flags = oleft->op_flags;
8915 o->op_private |= OPpSORT_INPLACE;
8917 /* excise push->gv->rv2av->null->aassign */
8918 o2 = o->op_next->op_next;
8919 op_null(o2); /* PUSHMARK */
8921 if (o2->op_type == OP_GV) {
8922 op_null(o2); /* GV */
8925 op_null(o2); /* RV2AV or PADAV */
8926 o2 = o2->op_next->op_next;
8927 op_null(o2); /* AASSIGN */
8929 o->op_next = o2->op_next;
8935 OP *ourmark, *theirmark, *ourlast, *iter, *expushmark, *rv2av;
8938 LISTOP *enter, *exlist;
8940 /* @a = reverse @a */
8941 if ((oright = cLISTOPo->op_first)
8942 && (oright->op_type == OP_PUSHMARK)
8943 && (oright = oright->op_sibling)
8944 && (oleft = is_inplace_av(o, oright))) {
8947 /* transfer MODishness etc from LHS arg to RHS arg */
8948 oright->op_flags = oleft->op_flags;
8949 o->op_private |= OPpREVERSE_INPLACE;
8951 /* excise push->gv->rv2av->null->aassign */
8952 o2 = o->op_next->op_next;
8953 op_null(o2); /* PUSHMARK */
8955 if (o2->op_type == OP_GV) {
8956 op_null(o2); /* GV */
8959 op_null(o2); /* RV2AV or PADAV */
8960 o2 = o2->op_next->op_next;
8961 op_null(o2); /* AASSIGN */
8963 o->op_next = o2->op_next;
8967 enter = (LISTOP *) o->op_next;
8970 if (enter->op_type == OP_NULL) {
8971 enter = (LISTOP *) enter->op_next;
8975 /* for $a (...) will have OP_GV then OP_RV2GV here.
8976 for (...) just has an OP_GV. */
8977 if (enter->op_type == OP_GV) {
8978 gvop = (OP *) enter;
8979 enter = (LISTOP *) enter->op_next;
8982 if (enter->op_type == OP_RV2GV) {
8983 enter = (LISTOP *) enter->op_next;
8989 if (enter->op_type != OP_ENTERITER)
8992 iter = enter->op_next;
8993 if (!iter || iter->op_type != OP_ITER)
8996 expushmark = enter->op_first;
8997 if (!expushmark || expushmark->op_type != OP_NULL
8998 || expushmark->op_targ != OP_PUSHMARK)
9001 exlist = (LISTOP *) expushmark->op_sibling;
9002 if (!exlist || exlist->op_type != OP_NULL
9003 || exlist->op_targ != OP_LIST)
9006 if (exlist->op_last != o) {
9007 /* Mmm. Was expecting to point back to this op. */
9010 theirmark = exlist->op_first;
9011 if (!theirmark || theirmark->op_type != OP_PUSHMARK)
9014 if (theirmark->op_sibling != o) {
9015 /* There's something between the mark and the reverse, eg
9016 for (1, reverse (...))
9021 ourmark = ((LISTOP *)o)->op_first;
9022 if (!ourmark || ourmark->op_type != OP_PUSHMARK)
9025 ourlast = ((LISTOP *)o)->op_last;
9026 if (!ourlast || ourlast->op_next != o)
9029 rv2av = ourmark->op_sibling;
9030 if (rv2av && rv2av->op_type == OP_RV2AV && rv2av->op_sibling == 0
9031 && rv2av->op_flags == (OPf_WANT_LIST | OPf_KIDS)
9032 && enter->op_flags == (OPf_WANT_LIST | OPf_KIDS)) {
9033 /* We're just reversing a single array. */
9034 rv2av->op_flags = OPf_WANT_SCALAR | OPf_KIDS | OPf_REF;
9035 enter->op_flags |= OPf_STACKED;
9038 /* We don't have control over who points to theirmark, so sacrifice
9040 theirmark->op_next = ourmark->op_next;
9041 theirmark->op_flags = ourmark->op_flags;
9042 ourlast->op_next = gvop ? gvop : (OP *) enter;
9045 enter->op_private |= OPpITER_REVERSED;
9046 iter->op_private |= OPpITER_REVERSED;
9053 UNOP *refgen, *rv2cv;
9056 if ((o->op_flags & OPf_WANT) != OPf_WANT_VOID)
9059 if ((o->op_private & ~OPpASSIGN_BACKWARDS) != 2)
9062 rv2gv = ((BINOP *)o)->op_last;
9063 if (!rv2gv || rv2gv->op_type != OP_RV2GV)
9066 refgen = (UNOP *)((BINOP *)o)->op_first;
9068 if (!refgen || refgen->op_type != OP_REFGEN)
9071 exlist = (LISTOP *)refgen->op_first;
9072 if (!exlist || exlist->op_type != OP_NULL
9073 || exlist->op_targ != OP_LIST)
9076 if (exlist->op_first->op_type != OP_PUSHMARK)
9079 rv2cv = (UNOP*)exlist->op_last;
9081 if (rv2cv->op_type != OP_RV2CV)
9084 assert ((rv2gv->op_private & OPpDONT_INIT_GV) == 0);
9085 assert ((o->op_private & OPpASSIGN_CV_TO_GV) == 0);
9086 assert ((rv2cv->op_private & OPpMAY_RETURN_CONSTANT) == 0);
9088 o->op_private |= OPpASSIGN_CV_TO_GV;
9089 rv2gv->op_private |= OPpDONT_INIT_GV;
9090 rv2cv->op_private |= OPpMAY_RETURN_CONSTANT;
9098 if (!(cPMOP->op_pmflags & PMf_ONCE)) {
9099 assert (!cPMOP->op_pmstashstartu.op_pmreplstart);
9109 Perl_custom_op_name(pTHX_ const OP* o)
9112 const IV index = PTR2IV(o->op_ppaddr);
9116 PERL_ARGS_ASSERT_CUSTOM_OP_NAME;
9118 if (!PL_custom_op_names) /* This probably shouldn't happen */
9119 return (char *)PL_op_name[OP_CUSTOM];
9121 keysv = sv_2mortal(newSViv(index));
9123 he = hv_fetch_ent(PL_custom_op_names, keysv, 0, 0);
9125 return (char *)PL_op_name[OP_CUSTOM]; /* Don't know who you are */
9127 return SvPV_nolen(HeVAL(he));
9131 Perl_custom_op_desc(pTHX_ const OP* o)
9134 const IV index = PTR2IV(o->op_ppaddr);
9138 PERL_ARGS_ASSERT_CUSTOM_OP_DESC;
9140 if (!PL_custom_op_descs)
9141 return (char *)PL_op_desc[OP_CUSTOM];
9143 keysv = sv_2mortal(newSViv(index));
9145 he = hv_fetch_ent(PL_custom_op_descs, keysv, 0, 0);
9147 return (char *)PL_op_desc[OP_CUSTOM];
9149 return SvPV_nolen(HeVAL(he));
9154 /* Efficient sub that returns a constant scalar value. */
9156 const_sv_xsub(pTHX_ CV* cv)
9160 SV *const sv = MUTABLE_SV(XSANY.any_ptr);
9164 /* diag_listed_as: SKIPME */
9165 Perl_croak(aTHX_ "usage: %s::%s()",
9166 HvNAME_get(GvSTASH(CvGV(cv))), GvNAME(CvGV(cv)));
9179 * c-indentation-style: bsd
9181 * indent-tabs-mode: t
9184 * ex: set ts=8 sts=4 sw=4 noet: